text
stringlengths 1
22.8M
|
|---|
The Petrovsky constituency (No.56) was a Russian legislative constituency in Stavropol Krai in 1993–2007. The constituency covered predominantly rural districts in central Stavropol Krai. During 2015 redistricting Petrovsky constituency was eliminated and its territory was partitioned between Stavropol, Nevinnomyssk and Georgiyevsk constituencies.
Members elected
Election results
1993
|-
! colspan=2 style="background-color:#E9E9E9;text-align:left;vertical-align:top;" |Candidate
! style="background-color:#E9E9E9;text-align:left;vertical-align:top;" |Party
! style="background-color:#E9E9E9;text-align:right;" |Votes
! style="background-color:#E9E9E9;text-align:right;" |%
|-
|style="background-color:"|
|align=left|Vasily Moroz
|align=left|Agrarian Party
|
|53.92%
|-
|style="background-color:"|
|align=left|Andrey Razin
|align=left|Independent
| -
|27.90%
|-
| colspan="5" style="background-color:#E9E9E9;"|
|- style="font-weight:bold"
| colspan="3" style="text-align:left;" | Total
|
| 100%
|-
| colspan="5" style="background-color:#E9E9E9;"|
|- style="font-weight:bold"
| colspan="4" |Source:
|
|}
1995
|-
! colspan=2 style="background-color:#E9E9E9;text-align:left;vertical-align:top;" |Candidate
! style="background-color:#E9E9E9;text-align:left;vertical-align:top;" |Party
! style="background-color:#E9E9E9;text-align:right;" |Votes
! style="background-color:#E9E9E9;text-align:right;" |%
|-
|style="background-color:"|
|align=left|Aleksandr Chernogorov
|align=left|Communist Party
|
|50.04%
|-
|style="background-color:"|
|align=left|Vasily Moroz (incumbent)
|align=left|Agrarian Party
|
|19.91%
|-
|style="background-color:"|
|align=left|Valery Panin
|align=left|Liberal Democratic Party
|
|11.13%
|-
|style="background-color:#2C299A"|
|align=left|Aleksandr Larionov
|align=left|Congress of Russian Communities
|
|10.32%
|-
|style="background-color:#000000"|
|colspan=2 |against all
|
|6.75%
|-
| colspan="5" style="background-color:#E9E9E9;"|
|- style="font-weight:bold"
| colspan="3" style="text-align:left;" | Total
|
| 100%
|-
| colspan="5" style="background-color:#E9E9E9;"|
|- style="font-weight:bold"
| colspan="4" |Source:
|
|}
1997
|-
! colspan=2 style="background-color:#E9E9E9;text-align:left;vertical-align:top;" |Candidate
! style="background-color:#E9E9E9;text-align:left;vertical-align:top;" |Party
! style="background-color:#E9E9E9;text-align:right;" |Votes
! style="background-color:#E9E9E9;text-align:right;" |%
|-
|style="background-color:"|
|align=left|Vasily Khmyrov
|align=left|Independent
|-
|34.75%
|-
| colspan="5" style="background-color:#E9E9E9;"|
|- style="font-weight:bold"
| colspan="3" style="text-align:left;" | Total
| -
| 100%
|-
| colspan="5" style="background-color:#E9E9E9;"|
|- style="font-weight:bold"
| colspan="4" |Source:
|
|}
1999
|-
! colspan=2 style="background-color:#E9E9E9;text-align:left;vertical-align:top;" |Candidate
! style="background-color:#E9E9E9;text-align:left;vertical-align:top;" |Party
! style="background-color:#E9E9E9;text-align:right;" |Votes
! style="background-color:#E9E9E9;text-align:right;" |%
|-
|style="background-color:"|
|align=left|Anatoly Kulikov
|align=left|Independent
|
|33.97%
|-
|style="background-color:"|
|align=left|Vasily Khmyrov (incumbent)
|align=left|Communist Party
|
|20.29%
|-
|style="background-color:"|
|align=left|Viktor Boroday
|align=left|Unity
|
|8.53%
|-
|style="background-color:"|
|align=left|Dmitry Atroshchenkov
|align=left|Independent
|
|7.19%
|-
|style="background-color:"|
|align=left|Aleksandr Kapustyansky
|align=left|Independent
|
|6.39%
|-
|style="background-color:"|
|align=left|Nikolay Dushka
|align=left|Independent
|
|4.80%
|-
|style="background-color:"|
|align=left|Aleksandr Pegishev
|align=left|Independent
|
|4.76%
|-
|style="background-color:"|
|align=left|Vasily Moroz
|align=left|Independent
|
|2.38%
|-
|style="background-color:#084284"|
|align=left|Mikhail Khlynov
|align=left|Spiritual Heritage
|
|1.93%
|-
|style="background-color:#C62B55"|
|align=left|Valery Kolesnikov
|align=left|Peace, Labour, May
|
|0.64%
|-
|style="background-color:#FCCA19"|
|align=left|German Barbashov
|align=left|Congress of Russian Communities-Yury Boldyrev Movement
|
|0.62%
|-
|style="background-color:#020266"|
|align=left|Vladimir Martynenko
|align=left|Russian Socialist Party
|
|0.54%
|-
|style="background-color:#000000"|
|colspan=2 |against all
|
|5.89%
|-
| colspan="5" style="background-color:#E9E9E9;"|
|- style="font-weight:bold"
| colspan="3" style="text-align:left;" | Total
|
| 100%
|-
| colspan="5" style="background-color:#E9E9E9;"|
|- style="font-weight:bold"
| colspan="4" |Source:
|
|}
2003
|-
! colspan=2 style="background-color:#E9E9E9;text-align:left;vertical-align:top;" |Candidate
! style="background-color:#E9E9E9;text-align:left;vertical-align:top;" |Party
! style="background-color:#E9E9E9;text-align:right;" |Votes
! style="background-color:#E9E9E9;text-align:right;" |%
|-
|style="background-color:"|
|align=left|Pavel Voronin
|align=left|Independent
|
|32.94%
|-
|style="background-color:"|
|align=left|Anatoly Kulikov (incumbent)
|align=left|United Russia
|
|30.06%
|-
|style="background-color:"|
|align=left|Yury Burlutsky
|align=left|Communist Party
|
|12.21%
|-
|style="background-color:"|
|align=left|Mikhail Khlynov
|align=left|Liberal Democratic Party
|
|4.47%
|-
|style="background-color:"|
|align=left|Valery Khuka
|align=left|Agrarian Party
|
|3.65%
|-
|style="background-color:"|
|align=left|Vitaly Zubenko
|align=left|Yabloko
|
|3.50%
|-
|style="background-color:#408080"|
|align=left|Viktor Sharkov
|align=left|For a Holy Russia
|
|1.37%
|-
|style="background-color:#000000"|
|colspan=2 |against all
|
|9.65%
|-
| colspan="5" style="background-color:#E9E9E9;"|
|- style="font-weight:bold"
| colspan="3" style="text-align:left;" | Total
|
| 100%
|-
| colspan="5" style="background-color:#E9E9E9;"|
|- style="font-weight:bold"
| colspan="4" |Source:
|
|}
Notes
References
Obsolete Russian legislative constituencies
Politics of Stavropol Krai
|
```javascript
/**
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
'use strict';
// MODULES //
var dsvariancepn = require( '@stdlib/stats/base/dsvariancepn' );
// MAIN //
/**
* Computes the variance of a single-precision floating-point strided array using extended accumulation and returning an extended precision result.
*
* @param {PositiveInteger} N - number of indexed elements
* @param {number} correction - degrees of freedom adjustment
* @param {Float32Array} x - input array
* @param {integer} stride - stride length
* @returns {number} variance
*
* @example
* var Float32Array = require( '@stdlib/array/float32' );
*
* var x = new Float32Array( [ 1.0, -2.0, 2.0 ] );
* var N = x.length;
*
* var v = dsvariance( N, 1, x, 1 );
* // returns ~4.3333
*/
function dsvariance( N, correction, x, stride ) {
return dsvariancepn( N, correction, x, stride );
}
// EXPORTS //
module.exports = dsvariance;
```
|
Juan Aguilar Leos (born July 31, 1984) is a Mexican luchador, or professional wrestler, better known by the ring name Texano Jr.
Aguilar is the son of Juan Conrado Aguilar Jáuregui, who wrestled under the name El Texano; Aguilar's brother is a wrestler known as Súper Nova / Bengala and he has several uncles and cousins that are professional wrestlers including El Dandy, Mictlán, Pólvora and Inquisidor.
For the early part of his career Aguilar worked for the Mexican professional wrestling promotion Consejo Mundial de Lucha Libre (CMLL), during which he also made several tours of Japan for New Japan Pro-Wrestling (NJPW) from 2005 until 2007. While in CMLL member of groups Los Hijos del Averno (Spanish for "the Sons of Hell") and Los Perros del Mal ("the Evil Dogs"), but opted to remain with CMLL when Los Perros left the promotion in 2010. In November 2011, Aguilar left CMLL to join Perros del Mal Producciones.
After signing with AAA under his current ring name, Texano became a two-time AAA Mega Champion, with his 735-day reign being the longest in history until Kenny Omega surpassed it in 2021. Texano has also gone on to become a two-time AAA World Trios Championship and a one-time AAA World Tag Team Championship (with Rey Escorpión). Texano also became the Rey de Reyes 2015 winner.
Professional wrestling career
Independent circuit (1999–2003)
Aguilar was trained by his father prior to his professional wrestling debut. In 1999 he began working as the enmascarado (masked wrestler) character "Kempo Kid", hiding his family relationship from the public. Between 1999 and 2002 or 2003 the Kempo Kid would win several Lucha de Apuestas, or "bet matches" where he forced his opponents to unmask as a result. His mask victories included Extasis, Avispón Jr., and Apolo Negro. In late 2002, or early 2003 Kempo Kid lost a Lucha de Apuestas match to Stuka Jr. and was forced to unmask. As part of the tradition wrestlers are supposed to announce their real name, which means that Aguilar revealed that he was the son of El Texano. He subsequently took the ring name "El Texano Jr.", adopting the same cowboy style character that his father used including carrying a Lariat with him to the ring.
Consejo Mundial de Lucha Libre (2003–2011)
Not long after adopting the new ring name he began working for Consejo Mundial de Lucha Libre (CMLL; "World Wrestling Council"), the world's oldest and Mexico's largest wrestling promotion. On October 7, 2005 Texano Jr. won his first professional wrestling championship when he teamed up with El Sagrado and Máximo to defeat Pandilla Guerrera ("Gang of Warriors"; Sangre Azteca, Doctor X and Nitro) to win the Mexican National Trios Championship. Over the next 569 days Texano Jr., Sagrado and Máximo defended the trios championship against teams such as Danger, Infierno, Magnum; deposed champions Doctor X, Nitro, Sangre Azteca and the team of Arkangel, Doctor X and Misterioso II. On April 29, 2007 the team lost the Mexican National Trios Title to the Los Perros del Mal ("The Bad Dogs") faction of Mr. Águila, Damián 666 and Halloween. The title change came about as El Texano Jr. turned on his partners mid-match, giving Los Perros del Mal an easy victory. Not long after turning Rudo (the Lucha Libre term for heel, or villain) Texano Jr. joined Los Perros del Mal and began teaming with El Terrible on a regular basis. On June 13, 2008 Texano Jr. participated in the main event of CMLL's annual Infierno en el Ring show, a multi-man steel cage match where the last man in the ring would have his hair shaved off. The match involved Los Perros del Mal, represented by Texano Jr. Damián 666, Mr. Águila, El Terrible and Perro Aguayo Jr. while the tecnico (Face or good guys in wrestling) side was represented by Alex Koslov, Marco Corleone, Shocker, Negro Casas and Heavy Metal. The match ended up with Texano Jr. and Heavy Metal being the last two in the ring, with Texano pinning Heavy Metal to force Heavy Metal to be shaved bald after the match. On August 26, 2008 Texano Jr. and El Terrible defeated Sagrado and Rayman to win the Occidente Tag Team Championship, a regional tag team title defended mainly in the Mexican stated of Guadalajara.
In late 2008 Perros del Mal leader Perro Aguayo Jr. decided to leave CMLL taking with him most of the Perros del Mal group, but El Texano Jr. and El Terrible decided not to leave CMLL. When Averno and Mephisto formed the group Los Hijos del Averno (The Sons of Hell) both Texano Jr. and El Terrible joined the group. On March 8, 2009 Texano Jr. won his second big "Luchas de Apuestas" match, defeating former teammate Máximo, forcing him to have his head shaved. Texano Jr. continued to be successful as he won his first singles championship, the NWA World Light Heavyweight Championship from Atlantis on April 5, 2009. Holding the NWA Light Heavyweight Championship qualified Texano Jr. for the "CMLL Universal Championship" tournament, a single elimination tournament for all male CMLL endorsed champions. El Texano Jr. won block A on June 5 defeating El Hijo del Fantasma (CMLL World Trios Champion), Black Warrior (Mexican National Trios Champion) and La Sombra (CMLL World Tag Team Champion) to qualify for the final. Texano Jr. was defeated by Último Guerrero in the finals of the tournament on June 19, 2009. On July 24, 2009 El Texano Jr. made his first successful NWA World Light Heavyweight Title defense, defeating former champion Shocker. In the fall of 2009 Texano Jr. and El Terrible became involved in a long-running "Mexico vs. Japan" storyline that had been going on since the summer as they began working with the Japanese duo No Limit (Yujiro and Naito).
On December 4, 2009 Terrible and Texano Jr. defeated No Limit in a Luchas de Apuesta hair vs. hair match that was the main event of CMLL's Sin Salida show. After the match both members of No Limit had their heads shaved completely bald per lucha libre traditions. On February 14, 2010 Texano Jr. and Terrible travelled to Japan to challenge No Limit for the IWGP Tag Team Championship, but were not able to defeat No Limit in their home country. By virtue of holding the NWA World Light Heavyweight Championship El Texano Jr. participated in the 2010 Universal Championship tournament. He was part of "Block A" that competed on the July 30, 2010 Super Viernes show. He co-won the eight-man seeding battle royal, and then won his first round match by defeating Ephesto. The second round was a rematch from the previous year's tournament, only this time La Sombra eliminated El Texano Jr. and not vice versa. On August 12, 2010, El Texano Jr.'s NWA World Light Heavyweight Championship was replaced with the new NWA World Historic Light Heavyweight Championship after CMLL had received complaints from the National Wrestling Alliance. In October and November 2010, El Texano Jr. and El Terrible took part in New Japan's 2010 G1 Tag League. After victories over Takashi Iizuka and Toru Yano and No Limit, Texano Jr. and Terrible finished fifth in their block and didn't advance to the semifinals of the tournament. On December 14, 2010, El Texano Jr. lost the NWA World Historic Light Heavyweight Championship to Shocker. Texano Jr. and El Terrible defeated the father/son team of Brazo de Plata and Máximo in the main event of the 2011 Homenaje a Dos Leyendas ("Homage to Two Legends") show, forcing La Dinastia Alvarado (Brazo de Plata and Máximo) both to have their heads shaved bald. In April 2011, Texano Jr. and El Terrible left Los Hijos del Averno to form a new group with Rey Bucanero. The following month, the group was named La Fuerza TRT.
Perros del Mal (2011)
On November 22, 2011, it was reported that El Texano Jr. had left CMLL and joined Perros del Mal Producciones. On November 24, El Texano Jr. appeared at a press conference, where he was officially presented as the newest member of the promotion, appearing alongside his brother Super Nova, who also works for the promotion.
Lucha Libre AAA Worldwide (2011–2021)
On December 8, El Texano Jr. and Toscano appeared at another press conference, where it was announced that they were joining CMLL's rival promotion Lucha Libre AAA Worldwide (AAA). Later that day at an International Wrestling Revolution Group (IWRG) event, both El Texano Jr. and Súper Nova joined the Perros del Mal stable. El Texano Jr. made his AAA debut on December 16 at Guerra de Titanes, forming the stable El Consejo ("The Council") with former CMLL workers Toscano and Máscara Año 2000 Jr. On January 21, 2012, Mortiz and Semental joined El Consejo as well, establishing it as a group opposing both AAA's tecnicos and rudos alike. On February 10, El Consejo was joined by Argos. El Consejos first big match in AAA took place on March 18 at Rey de Reyes, where El Texano Jr., Máscara Año 2000 Jr. and Toscano defeated AAA representatives Dr. Wagner Jr., Electroshock and Heavy Metal, following interference from the stable's newest member, "El Hombre de Negro" ("The Man in Black"). On May 19, El Texano Jr., Máscara Año 2000 Jr. and Toscano defeated Los Psycho Circus (Monster Clown, Murder Clown and Psycho Clown), following another interference from El Hombre de Negro, to win the AAA World Trios Championship. On June 16, El Hombre de Negro unmasked and revealed that it was Máscara Año 2000 under the mask. On October 7 at Héroes Inmortales, El Texano Jr. won the sixth annual Copa Antonio Peña tournament, scoring the last elimination over AAA Mega Champion El Mesías. However, afterwards the cup was taken away from El Texano Jr. when referee Copetes Salazar found out that Texano Jr. had cheated to win the match. With a shot at the AAA Mega Championship in his future, El Texano Jr. formed an alliance with Dorian Roldán, bringing El Consejo under the umbrella of his La Sociedad stable.
On December 2 at Guerra de Titanes, El Texano Jr. defeated El Mesías to become the youngest AAA Mega Champion in history. On February 18, 2013, El Consejo lost the AAA World Trios Championship to Los Psycho Circus, when Toscano turned on El Texano Jr. during the match. On March 17 at that year's Rey de Reyes ("King of Kings") show, El Texano Jr. successfully defended the AAA Mega Championship against Blue Demon Jr. On June 16 at Triplemanía XXI, El Texano Jr. successfully defended his title against Heavy Metal. On September 3, El Texano Jr. became the longest reigning AAA Mega Champion in its history as he eclipsed Jeff Jarrett's title reign of 274 days. On June 7, 2014, at Verano de Escándalo ("Summer of Scandal"), El Texano Jr. successfully defended the title against Psycho Clown, after former CMLL referee Rafael el Maya turned rudo and joined El Consejo. The rivalry between El Texano Jr. and Psycho Clown culminated on August 17 at Triplemanía XXII, where Psycho Clown was victorious in a Lucha de Apuestas between the two, forcing Texano Jr. to have his head shaved. After a two-year reign, El Texano Jr. lost the AAA Mega Championship to El Patrón Alberto on December 7, 2014, at Guerra de Titanes, ending his record 735-day reign. On March 18, 2015, El Texano Jr. won the 2015 Rey de Reyes tournament. On March 23, 2016, El Texano Jr. defeated El Mesías to win the vacant AAA Mega Championship for the second time. He lost the title to Johnny Mundo on March 19, 2017. On March 4, 2018, at Rey de Reyes lost against El Hijo del Fantasma in a Mask vs Hair match. On July 13, 2021, Texano Jr. was announcing Alberto El Patron's "Hecho en Mexico" event, announcing his departure from AAA after 9 years in his career.
Lucha Underground (2015–2017)
Texano made his Lucha Underground debut at the January 17, 2015, taping, when he attacked Alberto el Patrón, who was also making his debut at that taping. In Lucha Underground Aguila performed the name "Texano", without the "Junior" suffix. On the March 25 episode Texano unsuccessfully challenged el Patrón for the AAA Mega Championship in a Bullrope match. He would later turn face when LU needed to replace an injured Chavo Guerrero Jr. in a storyline with Blue Demon Jr. The two wrestled in a No Disqualification match at Ultima Lucha where Blue Demon Jr. won the match to cap off the first season. During season two Texano won one of the Aztec Medallions that allowed Texano to fight for the Lucha Underground Gift of the Gods Championship, a match he would lose to Chavo Guerrero Jr. For Ultima Lucha Dos he participated in a "Unique Opportunity" tournament, but lost to Son of Havoc in the first round.
He wouldn't appear in Season Four. Famous B explained he sent Texano to Mexico to win titles to justify his absence.
Impact Wrestling (2017–2018)
Texano made his Impact Wrestling debut, helping El Hijo del Fantasma and Pagano defeat Eddie Edwards and Ethan Carter III, after the match the three deliver a post match beat-down with Texano using a rope to whip before James Storm made the save. at Bound for Glory, Team AAA (Texano, El Hijo del Fantasma and Pagano) lost to Team Impact (Ethan Carter III, Eddie Edwards and James Storm) in a Six-man tag team match. On September 20, 2018 episode of Impact!, Texano unsuccessfully challenged Austin Aries for the Impact World Championship.
Personal life
Juan Aguilar Leos was born on July 31, 1984, in Mexicali, Baja California, Mexico; son of Juan Conrado Aguilar Jáuregui, a luchador or professional wrestler known under the ring name El Texano. Two years later his parents had another son who would later be known under the ring name Súper Nova and in 2016 as Bengala. Juan Aguilar grew up in a family of luchadors as several uncles were in the business as well including El Dandy, Negro Navarro, Apolo Navarro and Drako. Over time several of his cousins also became professional wrestlers such as Mictlán, Trauma I, Trauma II, Pólvora and Inquisidor.
Lawsuit against Lucha Underground
On February 13, 2019 it was reported that Aguilar had filed a lawsuit in California against the El Rey Network and the Baba-G production company behind Lucha Underground. The lawsuit claimed that the LU contract "Illegally restricted" wrestlers from working in their "lawful profession" by being restricted from working for other companies while under contract with LU, which only paid per match. Also, Aguilar didn't work in the 4th season, claiming he wasn't paid since 2016. The lawsuit was similar to the lawsuit made by King Cuerno, Ivelisse Vélez, Joey Ryan and Melissa Cervantes two weeks before looking to invalidate their contracts.
Championships and accomplishmentsLucha Libre AAA WorldwideAAA Mega Championship (2 times)
AAA World Tag Team Championship (1 time) – with Rey Escorpión
AAA World Trios Championship (2 times, Current) – with Máscara Año 2000 Jr. & Toscano (1) and La Hiedra, Rey Escorpion and Taurus (1, Current)
Copa Antonio Peña (2012)
Guitarra de Oro (2017)
Rey de Reyes (2015)Consejo Mundial de Lucha LibreMexican National Trios Championship (1 time) – with El Sagrado and Máximothe Mexican National Championships are sanctioned by the Mexico City Boxing and Wrestling Commission, but promoted by individual promotions, CMLL holds the exclusive rights to the National Trios Championship.
NWA World Light Heavyweight Championship (1 time)Up until the late 1980s CMLL was a member of the National Wrestling Alliance and retained the NWA Light Heavyweight Championship title after leaving the NWA. It is not officially recognized as an NWA Championship.
NWA World Historic Light Heavyweight Championship (1 time)
Mexican G1 Junior Climax (2005)CMLL GuadalajaraOccidente Tag Team Championship (1 time) – with El Terrible
DDT Pro-Wrestling Ironman Heavymetalweight Championship (1 time)Invasión IndyNWA Mexico Tag Team Championship (1 time, current) - with Super NovaPro Wrestling IllustratedPWI ranked him #48' of the top 500 singles wrestlers in the PWI 500 in 2013
Luchas de Apuestas record
Footnotes
References
External links
AAA profile (archived)
1984 births
Living people
Mexican male professional wrestlers
People from Mexicali
Professional wrestlers from Baja California
Professional wrestlers from Mexico City
AAA Mega Champions
AAA World Trios Champions
AAA World Tag Team Champions
Mexican National Trios Champions
20th-century professional wrestlers
21st-century professional wrestlers
NWA World Historic Light Heavyweight Champions
NWA World Light Heavyweight Champions
Ironman Heavymetalweight Champions
|
In Ancient Roman architecture, a basilica was a large public building with multiple functions that was typically built alongside the town's forum. The basilica was in the Latin West equivalent to a stoa in the Greek East. The building gave its name to the architectural form of the basilica.
Originally, a basilica was an ancient Roman public building, where courts were held, as well as serving other official and public functions. Basilicas are typically rectangular buildings with a central nave flanked by two or more longitudinal aisles, with the roof at two levels, being higher in the centre over the nave to admit a clerestory and lower over the side-aisles. An apse at one end, or less frequently at both ends or on the side, usually contained the raised tribunal occupied by the Roman magistrates. The basilica was centrally located in every Roman town, usually adjacent to the forum and often opposite a temple in imperial-era forums. Basilicas were also built in private residences and imperial palaces and were known as "palace basilicas".
In late antiquity, church buildings were typically constructed either as martyria, or with a basilica's architectural plan. A number of monumental Christian basilicas were constructed during the latter reign of Constantine the Great. In the post Nicene period, basilicas became a standard model for Christian spaces for congregational worship throughout the Mediterranean and Europe. From the early 4th century, Christian basilicas, along with their associated catacombs, were used for burial of the dead.
By extension, the name was later applied to Christian churches that adopted the same basic plan. It continues to be used in an architectural sense to describe rectangular buildings with a central nave and aisles, and usually a raised platform at the end opposite the door. In Europe and the Americas, the basilica remained the most common architectural style for churches of all Christian denominations, though this building plan has become less dominant in buildings constructed since the late 20th century.
The Catholic Church has come to use the term to refer to its especially historic churches, without reference to the architectural form.
Origins
The Latin word basilica derives from . The first known basilica—the Basilica Porcia in the Roman Forum—was constructed in 184 BC by Marcus Porcius Cato (the Elder). After the construction of Cato the Elder's basilica, the term came to be applied to any large covered hall, whether it was used for domestic purposes, was a commercial space, a military structure, or religious building.
The plays of Plautus suggest that basilica buildings may have existed prior to Cato's building. The plays were composed between 210 and 184 BC and refer to a building that might be identified with the Atrium Regium. Another early example is the basilica at Pompeii (late 2nd century BC). Inspiration may have come from prototypes like Athens's Stoa Basileios or the hypostyle hall on Delos, but the architectural form is most derived from the audience halls in the royal palaces of the Diadochi kingdoms of the Hellenistic period. These rooms were typically a high nave flanked by colonnades.
These basilicas were rectangular, typically with central nave and aisles, usually with a slightly raised platform and an apse at each of the two ends, adorned with a statue perhaps of the emperor, while the entrances were from the long sides. The Roman basilica was a large public building where business or legal matters could be transacted. Although their form was variable, basilicas often contained interior colonnades that divided the space, giving aisles or arcaded spaces on one or both sides, with an apse at one end (or less often at each end), where the magistrates sat, often on a slightly raised dais. The central aisle the nave tended to be wider and taller than the flanking aisles, so that light could penetrate through the clerestory windows.
In the late Republican era, basilicas were increasingly monumental; Julius Caesar replaced the Basilica Sempronia with his own Basilica Julia, dedicated in 46 BC, while the Basilica Aemilia was rebuilt around 54 BC in so spectacular a fashion that Pliny the Elder wrote that it was among the most beautiful buildings in the world (it was simultaneously renamed the Basilica Paulli). Thereafter until the 4th century AD, monumental basilicas were routinely constructed at Rome by both private citizens and the emperors. These basilicas were reception halls and grand spaces in which élite persons could impress guests and visitors, and could be attached to a large country villa or an urban domus. They were simpler and smaller than were civic basilicas, and can be identified by inscriptions or their position in the archaeological context. Domitian constructed a basilica on the Palatine Hill for his imperial residential complex around 92 AD, and a palatine basilica was typical in imperial palaces throughout the imperial period.
Roman Republic
Long, rectangular basilicas with internal peristyle became a quintessential element of Roman urbanism, often forming the architectural background to the city forum and used for diverse purposes. Beginning with Cato in the early second century BC, politicians of the Roman Republic competed with one another by building basilicas bearing their names in the Forum Romanum, the centre of ancient Rome. Outside the city, basilicas symbolised the influence of Rome and became a ubiquitous fixture of Roman of the late Republic from . The earliest surviving basilica is the basilica of Pompeii, built 120 BC. Basilicas were the administrative and commercial centres of major Roman settlements: the "quintessential architectural expression of Roman administration". Adjoining it there were normally various offices and rooms housing the curia and a shrine for the tutela. Like Roman public baths, basilicas were commonly used as venues for the display of honorific statues and other sculptures, complementing the outdoor public spaces and thoroughfares.
Beside the Basilica Porcia on the Forum Romanum, the Basilica Aemilia was built in 179 BC, and the Basilica Sempronia in 169 BC. In the Republic two types of basilica were built across Italy in the mid-2nd to early 1st centuries BC: either they were nearly square as at Fanum Fortunae, designed by Vitruvius, and Cosa, with a 3:4 width-length ratio; or else they were more rectangular, as Pompeii's basilica, whose ratio is 3:7.
The basilica at Ephesus is typical of the basilicas in the Roman East, which usually have a very elongated footprint and a ratio between 1:5 and 1:9, with open porticoes facing the agora (the Hellenic forum); this design was influenced by the existing tradition of long stoae in Hellenistic Asia. Provinces in the west lacked this tradition, and the basilicas the Romans commissioned there were more typically Italian, with the central nave divided from the side-aisles by an internal colonnade in regular proportions.
Early Empire
Beginning with the Forum of Caesar () at the end of the Roman Republic, the centre of Rome was embellished with a series of imperial fora typified by a large open space surrounded by a peristyle, honorific statues of the imperial family (), and a basilica, often accompanied by other facilities like a temple, market halls and public libraries. In the imperial period, statues of the emperors with inscribed dedications were often installed near the basilicas' tribunals, as Vitruvius recommended. Examples of such dedicatory inscriptions are known from basilicas at Lucus Feroniae and Veleia in Italy and at Cuicul in Africa Proconsolaris, and inscriptions of all kinds were visible in and around basilicas.
At Ephesus the basilica-stoa had two storeys and three aisles and extended the length of the civic agora's north side, complete with colossal statues of the emperor Augustus and his imperial family.
The remains of a large subterranean Neopythagorean basilica dating from the 1st century AD were found near the Porta Maggiore in Rome in 1917, and is known as the Porta Maggiore Basilica.
After its destruction in 60 AD, Londinium (London) was endowed with its first forum and basilica under the Flavian dynasty. The basilica delimited the northern edge of the forum with typical nave, aisles, and a tribunal, but with an atypical semi-basement at the western side. Unlike in Gaul, basilica-forum complexes in Roman Britain did not usually include a temple; instead a shrine was usually inside the basilica itself. At Londinium however, there was probably no temple at all attached to the original basilica, but instead a contemporary temple was constructed nearby. Later, in 79 AD, an inscription commemorated the completion of the basilica at Verulamium (St Albans) under the governor Gnaeus Julius Agricola; by contrast the first basilica at Londinium was only . The smallest known basilica in Britain was built by the Silures at Caerwent and measured .
When Londinium became a , the whole city was re-planned and a new great forum-basilica complex erected, larger than any in Britain. Londinium's basilica, more than long, was the largest north of the Alps and a similar length to the modern St Paul's Cathedral. Only the later basilica-forum complex at Treverorum was larger, while at Rome only the Basilica Ulpia exceeded London's in size. It probably had arcaded, rather than trabeate, aisles, and a double row of square offices on the northern side, serving as the administrative centre of the , and its size and splendour probably indicate an imperial decision to change the administrative capital of Britannia to Londinium from Camulodunum (Colchester), as all provincial capitals were designated coloniae. In 300 Londinium's basilica was destroyed as a result of the rebellion led by the Augustus of the break-away Britannic Empire, Carausius. Remains of the great basilica and its arches were discovered during the construction of Leadenhall Market in the 1880s.
At Corinth in the 1st century AD, a new basilica was constructed in on the east side of the forum. It was possibly inside the basilica that Paul the Apostle, according to the Acts of the Apostles (Acts 18:12–17) was investigated and found innocent by the Suffect Consul Lucius Junius Gallio Annaeanus, the brother of Seneca the Younger, after charges were brought against him by members of the local Jewish diaspora. Modern tradition instead associates the incident with an open-air inscribed bema in the forum itself.
The emperor Trajan constructed his own imperial forum in Rome accompanied by his Basilica Ulpia dedicated in 112. Trajan's Forum () was separated from the Temple of Trajan, the Ulpian Library, and his famous Column depicting the Dacian Wars by the Basilica. It was an especially grand example whose particular symmetrical arrangement with an apse at both ends was repeated in the provinces as a characteristic form. To improve the quality of the Roman concrete used in the Basilica Ulpia, volcanic scoria from the Bay of Naples and Mount Vesuvius were imported which, though heavier, was stronger than the pumice available closer to Rome. The Bailica Ulpia is probably an early example of tie bars to restrain the lateral thrust of the barrel vault resting on a colonnade; both tie-bars and scoria were used in contemporary work at the Baths of Trajan and later the Hadrianic domed vault of the Pantheon.
In early 123, the augusta and widow of the emperor Trajan, Pompeia Plotina died. Hadrian, successor to Trajan, deified her and had a basilica constructed in her honour in southern Gaul.
The Basilica Hilariana (built ) was designed for the use of the cult of Cybele.
The largest basilica built outside Rome was that built under the Antonine dynasty on the Byrsa hill in Carthage. The basilica was built together with a forum of enormous size and was contemporary with a great complex of public baths and a new aqueduct system running for , then the longest in the Roman Empire.
The basilica at Leptis Magna, built by the Septimius Severus a century later in about 216 is a notable 3rd century AD example of the traditional type, most notable among the works influenced by the Basilica Ulpia. The basilica at Leptis was built mainly of limestone ashlar, but the apses at either end were only limestone in the outer sections and built largely of rubble masonry faced with brick, with a number of decorative panels in opus reticulatum. The basilica stood in a new forum and was accompanied by a programme of Severan works at Leptis including thermae, a new harbour, and a public fountain. At Volubilis, principal city of Mauretania Tingitana, a basilica modelled on Leptis Magna's was completed during the short reign of Macrinus.
Basilicas in the Roman Forum
Basilica Porcia: first basilica built in Rome (184 BC), erected on the personal initiative and financing of the censor Marcus Porcius Cato (Cato the Elder) as an official building for the tribunes of the plebs
Basilica Aemilia, built by the censor Aemilius Lepidus in 179 BC
Basilica Sempronia, built by the censor Tiberius Sempronius Gracchus in 169 BC
Basilica Opimia, erected probably by the consul Lucius Opimius in 121 BC, at the same time that he restored the temple of Concord (Platner, Ashby 1929)
Basilica Julia, initially dedicated in 46 BC by Julius Caesar and completed by Augustus 27 BC to AD 14
Basilica Argentaria, erected under Trajan, emperor from AD 98 to 117
Basilica of Maxentius and Constantine (built between AD 308 and 312)
Late antiquity
The aisled-hall plan of the basilica was adopted by a number of religious cults in late antiquity. At Sardis, a monumental basilica housed the city's synagogue, serving the local Jewish diaspora. New religions like Christianity required space for congregational worship, and the basilica was adapted by the early Church for worship. Because they were able to hold large number of people, basilicas were adopted for Christian liturgical use after Constantine the Great. The early churches of Rome were basilicas with an apsidal tribunal and used the same construction techniques of columns and timber roofing.
At the start of the 4th century at Rome there was a change in burial and funerary practice, moving away from earlier preferences for inhumation in cemeteries popular from the 2nd and 3rd centuries AD to the newer practice of burial in catacombs and inhumation inside Christian basilicas themselves. Conversely, new basilicas often were erected on the site of existing early Christian cemeteries and martyria, related to the belief in Bodily Resurrection, and the cult of the sacred dead became monumentalised in basilica form. Traditional civic basilicas and bouleuteria declined in use with the weakening of the curial class () in the 4th and 5th centuries, while their structures were well suited to the requirements of congregational liturgies. The conversion of these types of buildings into Christian basilicas was also of symbolic significance, asserting the dominance of Christianity and supplanting the old political function of public space and the city-centre with an emphatic Christian social statement. Traditional monumental civic amenities like gymnasia, palaestrae, and thermae were also falling into disuse, and became favoured sites for the construction of new churches, including basilicas.
Under Constantine, the basilica became the most prestigious style of church building, was "normative" for church buildings by the end of the 4th century, and were ubiquitous in western Asia, North Africa, and most of Europe by the close of the 7th century. Christians also continued to hold services in synagogues, houses, and gardens, and continued practising baptism in rivers, ponds, and Roman bathhouses.
The development of Christian basilicas began even before Constantine's reign: a 3rd-century mud-brick house at Aqaba had become a Christian church and was rebuilt as a basilica. Within was a rectangular assembly hall with frescoes and at the east end an ambo, a cathedra, and an altar. Also within the church were a catecumenon (for catechumens), a baptistery, a diaconicon, and a prothesis: all features typical of later 4th century basilica churches. A Christian structure which included the prototype of the triumphal arch at the east end of later Constantinian basilicas. Known as the Megiddo church, it was built at Kefar 'Othnay in Palestine, possibly c. 230, for or by the Roman army stationed at Legio (later Lajjun). Its dedicatory inscriptions include the names of women who contributed to the building and were its major patrons, as well as men's names. A number of buildings previously believed to have been Constantinian or 4th century have been reassessed as dating to later periods, and certain examples of 4th century basilicas are not distributed throughout the Mediterranean world at all evenly. Christian basilicas and martyria attributable to the 4th century are rare on the Greek mainland and on the Cyclades, while the Christian basilicas of Egypt, Cyprus, Syria, Transjordan, Hispania, and Gaul are nearly all of later date. The basilica at Ephesus's Magnesian Gate, the episcopal church at Laodicea on the Lycus, and two extramural churches at Sardis have all been considered 4th century constructions, but on weak evidence. Development of pottery chronologies for Late Antiquity had helped resolve questions of dating basilicas of the period.
Three examples of a basilica discoperta or "hypaethral basilica" with no roof above the nave are inferred to have existed. The 6th century Anonymous pilgrim of Piacenza described a "a basilica built with a quadriporticus, with the middle atrium uncovered" at Hebron, while at Pécs and near Salona two ruined 5th buildings of debated interpretation might have been either roofless basilica churches or simply courtyards with an exedra at the end. An old theory by Ejnar Dyggve that these were the architectural intermediary between the Christian martyrium and the classical heröon is no longer credited.
The magnificence of early Christian basilicas reflected the patronage of the emperor and recalled his imperial palaces and reflected the royal associations of the basilica with the Hellenistic Kingdoms and even earlier monarchies like that of Pharaonic Egypt. Similarly, the name and association resounded with the Christian claims of the royalty of Christ – according to the Acts of the Apostles the earliest Christians had gathered at the royal Stoa of Solomon in Jerusalem to assert Jesus's royal heritage. For early Christians, the Bible supplied evidence that the First Temple and Solomon's palace were both hypostyle halls and somewhat resembled basilicas. Hypostyle synagogues, often built with apses in Palestine by the 6th century, share a common origin with the Christian basilicas in the civic basilicas and in the pre-Roman style of hypostyle halls in the Mediterranean Basin, particularly in Egypt, where pre-classical hypostyles continued to be built in the imperial period and were themselves converted into churches in the 6th century. Other influences on the evolution of Christian basilicas may have come from elements of domestic and palatial architecture during the pre-Constantinian period of Christianity, including the reception hall or () and the atria and triclinia of élite Roman dwellings. The versatility of the basilica form and its variability in size and ornament recommended itself to the early Christian Church: basilicas could be grandiose as the Basilica of Maxentius in the Forum Romanum or more practical like the so-called Basilica of Bahira in Bosra, while the Basilica Constantiniana on the Lateran Hill was of intermediate scale. This basilica, begun in 313, was the first imperial Christian basilica. Imperial basilicas were first constructed for the Christian Eucharist liturgy in the reign of Constantine.
Basilica churches were not economically inactive. Like non-Christian or civic basilicas, basilica churches had a commercial function integral to their local trade routes and economies. Amphorae discovered at basilicas attest their economic uses and can reveal their position in wider networks of exchange. At Dion near Mount Olympus in Macedonia, now an Archaeological Park, the latter 5th century Cemetery Basilica, a small church, was replete with potsherds from all over the Mediterranean, evidencing extensive economic activity took place there. Likewise at Maroni Petrera on Cyprus, the amphorae unearthed by archaeologists in the 5th century basilica church had been imported from North Africa, Egypt, Palestine, and the Aegean basin, as well as from neighbouring Asia Minor.
According to Vegetius, writing c. 390, basilicas were convenient for drilling soldiers of the Late Roman army during inclement weather.
Basilica of Maxentius
The 4th century Basilica of Maxentius, begun by Maxentius between 306 and 312 and according to Aurelius Victor's De Caesaribus completed by Constantine I, was an innovation. Earlier basilicas had mostly had wooden roofs, but this basilica dispensed with timber trusses and used instead cross-vaults made from Roman bricks and concrete to create one of the ancient world's largest covered spaces: 80 m long, 25 m wide, and 35 m high. The vertices of the cross-vaults, the largest Roman examples, were 35 m. The vault was supported on marble monolithic columns 14.5 m tall. The foundations are as much as 8 m deep. The vault was supported by brick latticework ribs () forming lattice ribbing, an early form of rib vault, and distributing the load evenly across the vault's span. Similar brick ribs were employed at the Baths of Maxentius on the Palatine Hill, where they supported walls on top of the vault. Also known as the or , it chanced to be the last civic basilica built in Rome.
Inside the basilica the central nave was accessed by five doors opening from an entrance hall on the eastern side and terminated in an apse at the western end. Another, shallower apse with niches for statues was added to the centre of the north wall in a second campaign of building, while the western apse housed a colossal acrolithic statue of the emperor Constantine enthroned. Fragments of this statue are now in the courtyard of the Palazzo dei Conservatori on the Capitoline Hill, part of the Capitoline Museums. Opposite the northern apse on the southern wall, another monumental entrance was added and elaborated with a portico of porphyry columns. One of the remaining marble interior columns was removed in 1613 by Pope Paul V and set up as an honorific column outside Santa Maria Maggiore.
Constantinian period
In the early 4th century Eusebius used the word basilica () to refer to Christian churches; in subsequent centuries as before, the word basilica referred in Greek to the civic, non-ecclesiastical buildings, and only in rare exceptions to churches. Churches were nonetheless basilican in form, with an apse or tribunal at the end of a nave with two or more aisles typical. A narthex (sometimes with an exonarthex) or vestibule could be added to the entrance, together with an atrium, and the interior might have transepts, a pastophorion, and galleries, but the basic scheme with clerestory windows and a wooden truss roof remained the most typical church type until the 6th century. The nave would be kept clear for liturgical processions by the clergy, with the laity in the galleries and aisles to either side. The function of Christian churches was similar to that of the civic basilicas but very different from temples in contemporary Graeco-Roman polytheism: while pagan temples were entered mainly by priests and thus had their splendour visible from without, within Christian basilicas the main ornamentation was visible to the congregants admitted inside. Christian priests did not interact with attendees during the rituals which took place at determined intervals, whereas pagan priests were required to perform individuals' sacrifices in the more chaotic environment of the temple precinct, with the temple's facade as backdrop. In basilicas constructed for Christian uses, the interior was often decorated with frescoes, but these buildings' wooden roof often decayed and failed to preserve the fragile frescoes within. Thus was lost an important part of the early history of Christian art, which would have sought to communicate early Christian ideas to the mainly illiterate Late Antique society. On the exterior, basilica church complexes included cemeteries, baptisteries, and fonts which "defined ritual and liturgical access to the sacred", elevated the social status of the Church hierarchy, and which complemented the development of a Christian historical landscape; Constantine and his mother Helena were patrons of basilicas in important Christian sites in the Holy Land and Rome, and at Milan and Constantinople.
Around 310, while still a self-proclaimed augustus unrecognised at Rome, Constantine began the construction of the Basilica Constantiniana or , as a reception hall for his imperial seat at Trier (), capital of Belgica Prima. On the exterior, Constantine's palatine basilica was plain and utilitarian, but inside was very grandly decorated.
In the reign of Constantine I, a basilica was constructed for the Pope in the former barracks of the Equites singulares Augusti, the cavalry arm of the Praetorian Guard. (Constantine had disbanded the Praetorian guard after his defeat of their emperor Maxentius and replaced them with another bodyguard, the Scholae Palatinae.) In 313 Constantine began construction of the Basilica Constantiniana on the Lateran Hill. This basilica became Rome's cathedral church, known as St John Lateran, and was more richly decorated and larger than any previous Christian structure. However, because of its remote position from the Forum Romanum on the city's edge, it did not connect with the older imperial basilicas in the fora of Rome. Outside the basilica was the Equestrian Statue of Marcus Aurelius, a rare example of an Antique statue that has never been underground.
According to the Liber Pontificalis, Constantine was also responsible for the rich interior decoration of the Lateran Baptistery constructed under Pope Sylvester I (r. 314–335), sited about . The Lateran Baptistery was the first monumental free-standing baptistery, and in subsequent centuries Christian basilica churches were often endowed with such baptisteries.
At Cirta, a Christian basilica erected by Constantine was taken over by his opponents, the Donatists. After Constantine's failure to resolve the Donatist controversy by coercion between 317 and 321, he allowed the Donatists, who dominated Africa, to retain the basilica and constructed a new one for the Catholic Church.
The original titular churches of Rome were those which had been private residences and which were donated to be converted to places of Christian worship. Above an originally 1st century AD villa and its later adjoining warehouse and Mithraeum, a large basilica church had been erected by 350, subsuming the earlier structures beneath it as a crypt. The basilica was the first church of San Clemente al Laterano. Similarly, at Santi Giovanni e Paolo al Celio, an entire ancient city block – a 2nd-century insula on the Caelian Hill – was buried beneath a 4th-century basilica. The site was already venerated as the martyrium of three early Christian burials beforehand, and part of the insula had been decorated in the style favoured by Christian communities frequenting the early Catacombs of Rome.
By 350 in Serdica (Sofia, Bulgaria), a monumental basilica – the Church of Saint Sophia – was erected, covering earlier structures including a Christian chapel, an oratory, and a cemetery dated to c. 310. Other major basilica from this period, in this part of Europe, is the Great Basilica in Philippopolis (Plovdiv, Bulgaria) from the 4th century AD.
Valentinianic–Theodosian period
In the late 4th century the dispute between Nicene and Arian Christianity came to head at Mediolanum (Milan), where Ambrose was bishop. At Easter in 386 the Arian party, preferred by the Theodosian dynasty, sought to wrest the use of the basilica from the Nicene partisan Ambrose. According to Augustine of Hippo, the dispute resulted in Ambrose organising an 'orthodox' sit-in at the basilica and arranged the miraculous invention and translation of martyrs, whose hidden remains had been revealed in a vision. During the sit-in, Augustine credits Ambrose with the introduction from the "eastern regions" of antiphonal chanting, to give heart to the orthodox congregation, though in fact music was likely part of Christian ritual since the time of the Pauline epistles. The arrival and reburial of the martyrs' uncorrupted remains in the basilica in time for the Easter celebrations was seen as powerful step towards divine approval.
At Philippi, the market adjoining the 1st-century forum was demolished and replaced with a Christian basilica. Civic basilicas throughout Asia Minor became Christian places of worship; examples are known at Ephesus, Aspendos, and at Magnesia on the Maeander. The Great Basilica in Antioch of Pisidia is a rare securely dated 4th century Christian basilica and was the city's cathedral church. The mosaics of the floor credit Optimus, the bishop, with its dedication. Optimus was a contemporary of Basil of Caesarea and corresponded with him c. 377. Optimus was the city's delegate at the First Council of Constantinople in 381, so the 70 m-long single-apsed basilica near the city walls must have been constructed around that time. Pisidia had a number of Christian basilicas constructed in Late Antiquity, particularly in former bouleuteria, as at Sagalassos, Selge, Pednelissus, while a civic basilica was converted for Christians' use in Cremna.
At Chalcedon, opposite Constantinople on the Bosporus, the relics of Euphemia – a supposed Christian martyr of the Diocletianic Persecution – were housed in a martyrium accompanied by a basilica. The basilica already existed when Egeria passed through Chalcedon in 384, and in 436 Melania the Younger visited the church on her own journey to the Holy Land. From the description of Evagrius Scholasticus the church is identifiable as an aisled basilica attached to the martyrium and preceded by an atrium. The Council of Chalcedon (8–31 October 451) was held in the basilica, which must have been large enough to accommodate the more than two hundred bishops that attended its third session, together with their translators and servants; around 350 bishops attended the Council in all. In an ekphrasis in his eleventh sermon, Asterius of Amasea described an icon in the church depicting Euphemia's martyrdom. The church was restored under the patronage of the patricia and daughter of Olybrius, Anicia Juliana. Pope Vigilius fled there from Constantinople during the Three-Chapter Controversy. The basilica, which lay outside the walls of Chalcedon, was destroyed by the Persians in the Byzantine–Sasanian War of 602–628 during one of the Sasanian occupations of the city in 615 and 626. The relics of Euphemia were reportedly translated to a new Church of St Euphemia in Constantinople in 680, though Cyril Mango argued the translation never took place. Subsequently, Asterius's sermon On the Martyrdom of St Euphemia was advanced as an argument for iconodulism at the Second Council of Nicaea in 787.
In the late 4th century, a large basilica church dedicated to Mary, mother of Jesus was constructed in Ephesus in the former south stoa (a commercial basilica) of the Temple of Hadrian Olympios. Ephesus was the centre of the Roman province of Asia, and was the site of the city's famed Temple of Artemis, one of the Seven Wonders of the Ancient World. It had also been a centre of the Roman imperial cult in Asia; Ephesus was three times declared () and had constructed a Temple of the Sebastoi to the Flavian dynasty. The Basilica of the Virgin Mary was probably the venue for the 431 Council of Ephesus and the 449 Second Council of Ephesus, both convened by Theodosius II. At some point during the Christianisation of the Roman world, Christian crosses were cut into the faces of the colossal statues of Augustus and Livia that stood in the basilica-stoa of Ephesus; the crosses were perhaps intended to exorcise demons in a process akin to baptism. In the eastern cemetery of Hierapolis the 5th century domed octagonal martyrium of Philip the Apostle was built alongside a basilica church, while at Myra the Basilica of St Nicholas was constructed at the tomb of Saint Nicholas.
At Constantinople the earliest basilica churches, like the 5th century basilica at the Monastery of Stoudios, were mostly equipped with a small cruciform crypt (), a space under the church floor beneath the altar. Typically, these crypts were accessed from the apse's interior, though not always, as at the 6th century Church of St John at the Hebdomon, where access was from outside the apse. At Thessaloniki, the Roman bath where tradition held Demetrius of Thessaloniki had been martyred was subsumed beneath the 5th century basilica of Hagios Demetrios, forming a crypt.
The largest and oldest basilica churches in Egypt were at Pbow, a coenobitic monastery established by Pachomius the Great in 330. The 4th century basilica was replaced by a large 5th century building (36 × 72 m) with five aisles and internal colonnades of pink granite columns and paved with limestone. This monastery was the administrative centre of the Pachomian order where the monks would gather twice annually and whose library may have produced many surviving manuscripts of biblical, Gnostic, and other texts in Greek and Coptic. In North Africa, late antique basilicas were often built on a doubled plan. In the 5th century, basilicas with two apses, multiple aisles, and doubled churches were common, including examples respectively at Sufetula, Tipasa, and Djémila. Generally, North African basilica churches' altars were in the nave and the main building medium was opus africanum of local stone, and spolia was infrequently used.
The Church of the East's Council of Seleucia-Ctesiphon was convened by the Sasanian Emperor Yazdegerd I at his capital at Ctesiphon; according to Synodicon Orientale, the emperor ordered that the former churches in the Sasanian Empire to be restored and rebuilt, that such clerics and ascetics as had been imprisoned were to be released, and their Nestorian Christian communities allowed to circulate freely and practice openly.
In eastern Syria, the Church of the East developed at typical pattern of basilica churches. Separate entrances for men and women were installed in the southern or northern wall; within, the east end of the nave was reserved for men, while women and children were stood behind. In the nave was a bema, from which Scripture could be read, and which were inspired by the equivalent in synagogues and regularised by the Church of Antioch. The Council of 410 stipulated that on Sunday the archdeacon would read the Gospels from the bema. Standing near the bema, the lay folk could chant responses to the reading and if positioned near the šqāqonā ("a walled floor-level pathway connecting the bema to the altar area") could try to kiss or touch the Gospel Book as it was processed from the deacons' room to the bema and thence to the altar. Some ten Eastern churches in eastern Syria have been investigated by thorough archaeology.
A Christian basilica was constructed in the first half of the 5th century at Olympia, where the statue of Zeus by Phidias had been noted as one of the Seven Wonders of the Ancient World ever since the 2nd century BC list compiled by Antipater of Sidon. Cultural tourism thrived at Olympia and Ancient Greek religion continued to be practised there well into the 4th century. At Nicopolis in Epirus, founded by Augustus to commemorate his victory at the Battle of Actium at the end of the Last war of the Roman Republic, four early Christian basilicas were built during Late Antiquity whose remains survive to the present. In the 4th or 5th century, Nicopolis was surrounded by a new city wall.
In Bulgaria there are major basilicas from that time like Elenska Basilica and the Red Church.
Leonid period
On Crete, the Roman cities suffered from repeated earthquakes in the 4th century, but between c. 450 and c. 550, a large number of Christian basilicas were constructed. Crete was throughout Late Antiquity a province of the Diocese of Macedonia, governed from Thessaloniki.
Nine basilica churches were built at Nea Anchialos, ancient Phthiotic Thebes (), which was in its heyday the primary port of Thessaly. The episcopal see was the three-aisled Basilica A, the Church of St Demetrius of Thessaloniki, and similar to the Church of the Acheiropoietos in Thessaloniki. Its atrium perhaps had a pair of towers to either side and its construction dates to the late 5th/early 6th century. The Elpidios Basilica Basilica B was of similar age, and the city was home to a large complex of ecclesiastical buildings including Basilica G, with its luxurious mosaic floors and a mid-6th century inscription proclaiming the patronage of the bishop Peter. Outside the defensive wall was Basilica D, a 7th-century cemetery church.
Stobi, () the capital from the late 4th century of the province of Macedonia II Salutaris, had numerous basilicas and six palaces in late antiquity. The Old Basilica had two phases of geometric pavements, the second phase of which credited the bishop Eustathios as patron of the renovations. A newer episcopal basilica was built by the bishop Philip atop the remains of the earlier structure, and two further basilicas were within the walls. The Central Basilica replaced a synagogue on a site razed in the late 5th century, and there was also a North Basilica and further basilicas without the walls. Various mosaics and sculptural decorations have been found there, and while the city suffered from the Ostrogoths in 479 and an earthquake in 518, ceasing to be a major city thereafter, it remained a bishopric until the end of the 7th century and the Basilica of Philip had its templon restored in the 8th century.
The Small Basilica of Philippopolis (Plovdiv, Bulgaria) in Thrace was built in the second half of the 5th century AD.
Justinianic period
Justinian I constructed at Ephesus a large basilica church, the Basilica of St John, above the supposed tomb of John the Apostle. The church was a domed cruciform basilica begun in 535/6; enormous and lavishly decorated, it was built in the same style as Justinian's Church of the Holy Apostles in Constantinople. The Justinianic basilica replaced an earlier, smaller structure which Egeria had planned to visit in the 4th century, and remains of a aqueduct branch built to supply the complex with water probably dates from Justinian's reign. The Ephesians' basilicas to St Mary and St John were both equipped with baptisteries with filling and draining pipes: both fonts were flush with the floor and unsuitable for infant baptism. As with most Justinianic baptisteries in the Balkans and Asia Minor, the baptistery at the Basilica of St John was on the northern side of the basilica's nave; the 734 m2 baptistery was separated from the basilica by a 3 m-wide corridor. According to the 6th century Syriac writer John of Ephesus, a Syriac Orthodox Christian, the heterodox Miaphysites held ordination services in the courtyard of the Basilica of St John under cover of night. Somewhat outside the ancient city on the hill of Selçuk, the Justinianic basilica became the centre of the city after the 7th century Arab–Byzantine wars.
At Constantinople, Justinian constructed the largest domed basilica: on the site of the 4th century basilica Church of Holy Wisdom, the emperor ordered construction of the huge domed basilica that survives to the present: the Hagia Sophia. This basilica, which "continues to stand as one of the most visually imposing and architecturally daring churches in the Mediterranean", was the cathedral of Constantinople and the patriarchal church of the Patriarch of Constantinople. Hagia Sophia, originally founded by Constantine, was at the social and political heart of Constantinople, near to the Great Palace, the Baths of Zeuxippus, and the Hippodrome of Constantinople, while the headquarters of the Ecumenical Patriarchate was within the basilica's immediate vicinity.
The mid-6th century Bishop of Poreč ( or ; ) replaced an earlier 4th century basilica with the magnificent Euphrasian Basilica in the style of contemporary basilicas at Ravenna. Some column capitals were of marble from Greece identical to those in Basilica of San Vitale and must have been imported from the Byzantine centre along with the columns and some of the opus sectile. There are conch mosaics in the basilica's three apses and the fine opus sectile on the central apse wall is "exceptionally well preserved".
The 4th century basilica of Saint Sophia Church at Serdica (Sofia, Bulgaria) was rebuilt in the 5th century and ultimately replaced by a new monumental basilica in the late 6th century, and some construction phases continued into the 8th century. This basilica was the cathedral of Serdica and was one of three basilicas known to lie outside the walls; three more churches were within the walled city, of which the Church of Saint George was a former Roman bath built in the 4th century, and another was a former Mithraeum. The basilicas were associated with cemeteries with Christian inscriptions and burials.
Another basilica from this period in Bulgaria was the Belovo Basilica (6th century AD).
The Miaphysite convert from the Church of the East, Ahudemmeh constructed a new basilica dedicated to Saint Sergius at ʿAin Qenoye (or ʿAin Qena according to Bar Hebraeus) after being ordained bishop of Beth Arbaye by Jacob Baradaeus and while proselytizing among the Bedouin of Arbayistan in the Sasanian Empire. According to Ahudemmeh's biographer this basilica and its martyrium, in the upper Tigris valley, was supposed to be a copy of the Basilica of St Sergius at Sergiopolis (Resafa), in the middle Euphrates, so that the Arabs would not have to travel so far on pilgrimage. More likely, with the support of Khosrow I for its construction and defence against the Nestorians who were Miaphysites' rivals, the basilica was part of an attempt to control the frontier tribes and limit their contact with the Roman territory of Justinian, who had agreed in the 562 Fifty-Year Peace Treaty to pay 30,000 nomismata annually to Khosrow in return for a demilitarization of the frontier after the latest phase of the Roman–Persian Wars. After being mentioned in 828 and 936, the basilica at ʿAin Qenoye disappeared from recorded history, though it may have remained occupied for centuries, and was rediscovered as a ruin by Carsten Niebuhr in 1766. The name of the modern site Qasr Serīj is derived from the basilica's dedication to St Sergius. Qasr Serīj's construction may have been part of the policy of toleration that Khosrow and his successors had for Miaphysitism a contrast with Justinian's persecution of heterodoxy within the Roman empire. This policy itself encouraged many tribes to favour the Persian cause, especially after the death in 569 of the Ghassanid Kingdom's Miaphysite king al-Harith ibn Jabalah (, ) and the 584 suppression by the Romans of his successors' dynasty.
Palace basilicas
In the Roman Imperial period (after about 27 BC), a basilica for large audiences also became a feature in palaces. In the 3rd century of the Christian era, the governing elite appeared less frequently in the forums.
They now tended to dominate their cities from opulent palaces and country villas, set a little apart from traditional centers of public life. Rather than retreats from public life, however, these residences were the forum made private.
— Peter Brown, in Paul Veyne, 1987
Seated in the tribune of his basilica, the great man would meet his dependent clientes early every morning.
Constantine's basilica at Trier, the Aula Palatina (AD 306), is still standing. A private basilica excavated at Bulla Regia (Tunisia), in the "House of the Hunt", dates from the first half of the 5th century. Its reception or audience hall is a long rectangular nave-like space, flanked by dependent rooms that mostly also open into one another, ending in a semi-circular apse, with matching transept spaces. Clustered columns emphasised the "crossing" of the two axes.
Christian adoption of the basilica form
In the 4th century, once the Imperial authorities had decriminalised Christianity with the 313 Edict of Milan, and with the activities of Constantine the Great and his mother Helena, Christians were prepared to build larger and more handsome edifices for worship than the furtive meeting-places (such as the Cenacle, cave-churches, house churches such as that of the martyrs John and Paul) they had been using. Architectural formulas for temples were unsuitable due to their pagan associations, and because pagan cult ceremonies and sacrifices occurred outdoors under the open sky in the sight of the gods, with the temple, housing the cult figures and the treasury, as a backdrop. The usable model at hand, when Constantine wanted to memorialise his imperial piety, was the familiar conventional architecture of the basilicas.
There were several variations of the basic plan of the secular basilica, always some kind of rectangular hall, but the one usually followed for churches had a central nave with one aisle at each side and an apse at one end opposite to the main door at the other end. In (and often also in front of) the apse was a raised platform, where the altar was placed, and from where the clergy officiated. In secular building this plan was more typically used for the smaller audience halls of the emperors, governors, and the very rich than for the great public basilicas functioning as law courts and other public purposes. Constantine built a basilica of this type in his palace complex at Trier, later very easily adopted for use as a church. It is a long rectangle two storeys high, with ranks of arch-headed windows one above the other, without aisles (there was no mercantile exchange in this imperial basilica) and, at the far end beyond a huge arch, the apse in which Constantine held state.
Development
Putting an altar instead of the throne, as was done at Trier, made a church. Basilicas of this type were built in western Europe, Greece, Syria, Egypt, and Palestine, that is, at any early centre of Christianity. Good early examples of the architectural basilica include the Church of the Nativity at Bethlehem (6th century), the church of St Elias at Thessalonica (5th century), and the two great basilicas at Ravenna.
The first basilicas with transepts were built under the orders of Emperor Constantine, both in Rome and in his "New Rome", Constantinople:
Around 380, Gregory Nazianzen, describing the Constantinian Church of the Holy Apostles at Constantinople, was the first to point out its resemblance to a cross. Because the cult of the cross was spreading at about the same time, this comparison met with stunning success.
— Yvon Thébert, in Veyne, 1987
Thus, a Christian symbolic theme was applied quite naturally to a form borrowed from civil semi-public precedents. The first great Imperially sponsored Christian basilica is that of St John Lateran, which was given to the Bishop of Rome by Constantine right before or around the Edict of Milan in 313 and was consecrated in the year 324. In the later 4th century, other Christian basilicas were built in Rome: Santa Sabina, and St Paul's Outside the Walls (4th century), and later St Clement (6th century).
A Christian basilica of the 4th or 5th century stood behind its entirely enclosed forecourt ringed with a colonnade or arcade, like the stoa or peristyle that was its ancestor or like the cloister that was its descendant. This forecourt was entered from outside through a range of buildings along the public street. This was the architectural ground-plan of St. Peter's Basilica in Rome, until in the 15th century it was demolished to make way for a modern church built to a new plan.
In most basilicas, the central nave is taller than the aisles, forming a row of windows called a clerestory. Some basilicas in the Caucasus, particularly those of Armenia and Georgia, have a central nave only slightly higher than the two aisles and a single pitched roof covering all three. The result is a much darker interior. This plan is known as the "oriental basilica", or "pseudobasilica" in central Europe. A peculiar type of basilica, known as three-church basilica, was developed in early medieval Georgia, characterised by the central nave which is completely separated from the aisles with solid walls.
Gradually, in the Early Middle Ages there emerged the massive Romanesque churches, which still kept the fundamental plan of the basilica.
In Medieval Bulgaria the Great Basilica was finished around 875. The architectural complex in Pliska, the first capital of the First Bulgarian Empire, included a cathedral, an archbishop's palace and a monastery. The basilica was one of the greatest Christian cathedrals in Europe of the time, with an area of . The still in use Church of Saint Sophia in Ohrid is another example from Medieval Bulgaria.
In Romania, the word for church both as a building and as an institution is biserică, derived from the term basilica.
In the United States the style was copied with variances. An American church built imitating the architecture of an Early Christian basilica, St. Mary's (German) Church in Pennsylvania, was demolished in 1997.
Catholic basilicas
In the Catholic Church, a basilica is a large and important church building. This designation may be made by the Pope or may date from time immemorial. Basilica churches are distinguished for ceremonial purposes from other churches. The building does not need to be a basilica in the architectural sense. Basilicas are either major basilicas – of which there are four, all in the diocese of Rome—or minor basilicas, of which there were 1,810 worldwide . The Umbraculum is displayed in a basilica to the right side (i.e. the Epistle side) of the altar to indicate that the church has been awarded the rank of a basilica.
See also
Macellum – Roman covered market
Market hall – modern covered market
Courthouse
Curia
Municipal curiae
Town hall
Architecture
Architecture of cathedrals and great churches
Byzantine architecture
Church architecture
References
Citations
General sources
Architecture of the basilica
Syndicus, Eduard, Early Christian Art, Burns & Oates, London, 1962
Basilica Porcia
W. Thayer, "Basilicas of Ancient Rome": from Samuel Ball Platner (as completed and revised by Thomas Ashby), 1929. A Topographical Dictionary of Ancient Rome (London: Oxford University Press)
Paul Veyne, ed. A History of Private Life I: From Pagan Rome to Byzantium, 1987
Heritage Foundation of Newfoundland and Labrador
External links
Vitruvius, a 1st-century B.C. Roman architect, on how to design a basilica
1st-millennium BC introductions
Ancient Roman architecture
Christian terminology
Roman law
Types of church buildings
|
```objective-c
// This file is part of Eigen, a lightweight C++ template library
// for linear algebra.
//
//
// This code initially comes from MINPACK whose original authors are:
//
// This Source Code Form is subject to the terms of the Minpack license
#ifndef EIGEN_LMQRSOLV_H
#define EIGEN_LMQRSOLV_H
namespace Eigen {
namespace internal {
template <typename Scalar,int Rows, int Cols, typename PermIndex>
void lmqrsolv(
Matrix<Scalar,Rows,Cols> &s,
const PermutationMatrix<Dynamic,Dynamic,PermIndex> &iPerm,
const Matrix<Scalar,Dynamic,1> &diag,
const Matrix<Scalar,Dynamic,1> &qtb,
Matrix<Scalar,Dynamic,1> &x,
Matrix<Scalar,Dynamic,1> &sdiag)
{
/* Local variables */
Index i, j, k;
Scalar temp;
Index n = s.cols();
Matrix<Scalar,Dynamic,1> wa(n);
JacobiRotation<Scalar> givens;
/* Function Body */
// the following will only change the lower triangular part of s, including
// the diagonal, though the diagonal is restored afterward
/* copy r and (q transpose)*b to preserve input and initialize s. */
/* in particular, save the diagonal elements of r in x. */
x = s.diagonal();
wa = qtb;
s.topLeftCorner(n,n).template triangularView<StrictlyLower>() = s.topLeftCorner(n,n).transpose();
/* eliminate the diagonal matrix d using a givens rotation. */
for (j = 0; j < n; ++j) {
/* prepare the row of d to be eliminated, locating the */
/* diagonal element using p from the qr factorization. */
const PermIndex l = iPerm.indices()(j);
if (diag[l] == 0.)
break;
sdiag.tail(n-j).setZero();
sdiag[j] = diag[l];
/* the transformations to eliminate the row of d */
/* modify only a single element of (q transpose)*b */
/* beyond the first n, which is initially zero. */
Scalar qtbpj = 0.;
for (k = j; k < n; ++k) {
/* determine a givens rotation which eliminates the */
/* appropriate element in the current row of d. */
givens.makeGivens(-s(k,k), sdiag[k]);
/* compute the modified diagonal element of r and */
/* the modified element of ((q transpose)*b,0). */
s(k,k) = givens.c() * s(k,k) + givens.s() * sdiag[k];
temp = givens.c() * wa[k] + givens.s() * qtbpj;
qtbpj = -givens.s() * wa[k] + givens.c() * qtbpj;
wa[k] = temp;
/* accumulate the tranformation in the row of s. */
for (i = k+1; i<n; ++i) {
temp = givens.c() * s(i,k) + givens.s() * sdiag[i];
sdiag[i] = -givens.s() * s(i,k) + givens.c() * sdiag[i];
s(i,k) = temp;
}
}
}
/* solve the triangular system for z. if the system is */
/* singular, then obtain a least squares solution. */
Index nsing;
for(nsing=0; nsing<n && sdiag[nsing]!=0; nsing++) {}
wa.tail(n-nsing).setZero();
s.topLeftCorner(nsing, nsing).transpose().template triangularView<Upper>().solveInPlace(wa.head(nsing));
// restore
sdiag = s.diagonal();
s.diagonal() = x;
/* permute the components of z back to components of x. */
x = iPerm * wa;
}
template <typename Scalar, int _Options, typename Index>
void lmqrsolv(
SparseMatrix<Scalar,_Options,Index> &s,
const PermutationMatrix<Dynamic,Dynamic> &iPerm,
const Matrix<Scalar,Dynamic,1> &diag,
const Matrix<Scalar,Dynamic,1> &qtb,
Matrix<Scalar,Dynamic,1> &x,
Matrix<Scalar,Dynamic,1> &sdiag)
{
/* Local variables */
typedef SparseMatrix<Scalar,RowMajor,Index> FactorType;
Index i, j, k, l;
Scalar temp;
Index n = s.cols();
Matrix<Scalar,Dynamic,1> wa(n);
JacobiRotation<Scalar> givens;
/* Function Body */
// the following will only change the lower triangular part of s, including
// the diagonal, though the diagonal is restored afterward
/* copy r and (q transpose)*b to preserve input and initialize R. */
wa = qtb;
FactorType R(s);
// Eliminate the diagonal matrix d using a givens rotation
for (j = 0; j < n; ++j)
{
// Prepare the row of d to be eliminated, locating the
// diagonal element using p from the qr factorization
l = iPerm.indices()(j);
if (diag(l) == Scalar(0))
break;
sdiag.tail(n-j).setZero();
sdiag[j] = diag[l];
// the transformations to eliminate the row of d
// modify only a single element of (q transpose)*b
// beyond the first n, which is initially zero.
Scalar qtbpj = 0;
// Browse the nonzero elements of row j of the upper triangular s
for (k = j; k < n; ++k)
{
typename FactorType::InnerIterator itk(R,k);
for (; itk; ++itk){
if (itk.index() < k) continue;
else break;
}
//At this point, we have the diagonal element R(k,k)
// Determine a givens rotation which eliminates
// the appropriate element in the current row of d
givens.makeGivens(-itk.value(), sdiag(k));
// Compute the modified diagonal element of r and
// the modified element of ((q transpose)*b,0).
itk.valueRef() = givens.c() * itk.value() + givens.s() * sdiag(k);
temp = givens.c() * wa(k) + givens.s() * qtbpj;
qtbpj = -givens.s() * wa(k) + givens.c() * qtbpj;
wa(k) = temp;
// Accumulate the transformation in the remaining k row/column of R
for (++itk; itk; ++itk)
{
i = itk.index();
temp = givens.c() * itk.value() + givens.s() * sdiag(i);
sdiag(i) = -givens.s() * itk.value() + givens.c() * sdiag(i);
itk.valueRef() = temp;
}
}
}
// Solve the triangular system for z. If the system is
// singular, then obtain a least squares solution
Index nsing;
for(nsing = 0; nsing<n && sdiag(nsing) !=0; nsing++) {}
wa.tail(n-nsing).setZero();
// x = wa;
wa.head(nsing) = R.topLeftCorner(nsing,nsing).template triangularView<Upper>().solve/*InPlace*/(wa.head(nsing));
sdiag = R.diagonal();
// Permute the components of z back to components of x
x = iPerm * wa;
}
} // end namespace internal
} // end namespace Eigen
#endif // EIGEN_LMQRSOLV_H
```
|
```html
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<title>proxy request</title>
<script src="path_to_url"></script>
<script src="../dist/ajaxhook.min.js"></script>
</head>
<body>
<div></div>
<button onclick="onClick()"></button>
<script>
var count = 0;
ah.proxy({
onRequest: (config, handler) => {
if (config.url === 'path_to_url {
if (count++ % 2) {
console.log('path_to_url ');
handler.resolve({
config: config,
status: 200,
headers: {'content-type': 'text/text'},
response: 'hi world'
})
} else {
console.log('path_to_url ');
handler.next(config);
}
} else {
handler.next(config);
}
},
})
function onClick() {
axios.get('path_to_url
.then((response) => {
// handle success
console.log('sucess', response);
}).catch((e) => {
console.log('error', e.message);
})
}
</script>
</body>
</html>
```
|
```css
.cm-s-abcdef.CodeMirror { background: #0f0f0f; color: #defdef; }
.cm-s-abcdef div.CodeMirror-selected { background: #515151; }
.cm-s-abcdef .CodeMirror-line::selection, .cm-s-abcdef .CodeMirror-line > span::selection, .cm-s-abcdef .CodeMirror-line > span > span::selection { background: rgba(56, 56, 56, 0.99); }
.cm-s-abcdef .CodeMirror-line::-moz-selection, .cm-s-abcdef .CodeMirror-line > span::-moz-selection, .cm-s-abcdef .CodeMirror-line > span > span::-moz-selection { background: rgba(56, 56, 56, 0.99); }
.cm-s-abcdef .CodeMirror-gutters { background: #555; border-right: 2px solid #314151; }
.cm-s-abcdef .CodeMirror-guttermarker { color: #222; }
.cm-s-abcdef .CodeMirror-guttermarker-subtle { color: azure; }
.cm-s-abcdef .CodeMirror-linenumber { color: #FFFFFF; }
.cm-s-abcdef .CodeMirror-cursor { border-left: 1px solid #00FF00; }
.cm-s-abcdef span.cm-keyword { color: darkgoldenrod; font-weight: bold; }
.cm-s-abcdef span.cm-atom { color: #77F; }
.cm-s-abcdef span.cm-number { color: violet; }
.cm-s-abcdef span.cm-def { color: #fffabc; }
.cm-s-abcdef span.cm-variable { color: #abcdef; }
.cm-s-abcdef span.cm-variable-2 { color: #cacbcc; }
.cm-s-abcdef span.cm-variable-3, .cm-s-abcdef span.cm-type { color: #def; }
.cm-s-abcdef span.cm-property { color: #fedcba; }
.cm-s-abcdef span.cm-operator { color: #ff0; }
.cm-s-abcdef span.cm-comment { color: #7a7b7c; font-style: italic;}
.cm-s-abcdef span.cm-string { color: #2b4; }
.cm-s-abcdef span.cm-meta { color: #C9F; }
.cm-s-abcdef span.cm-qualifier { color: #FFF700; }
.cm-s-abcdef span.cm-builtin { color: #30aabc; }
.cm-s-abcdef span.cm-bracket { color: #8a8a8a; }
.cm-s-abcdef span.cm-tag { color: #FFDD44; }
.cm-s-abcdef span.cm-attribute { color: #DDFF00; }
.cm-s-abcdef span.cm-error { color: #FF0000; }
.cm-s-abcdef span.cm-header { color: aquamarine; font-weight: bold; }
.cm-s-abcdef span.cm-link { color: blueviolet; }
.cm-s-abcdef .CodeMirror-activeline-background { background: #314151; }
```
|
```c++
// 2016 and later: Unicode, Inc. and others.
/*
*******************************************************************************
*
* Corporation and others. All Rights Reserved.
*
*******************************************************************************
* file name: pkgitems.cpp
* encoding: UTF-8
* tab size: 8 (not used)
* indentation:4
*
* created on: 2005sep18
* created by: Markus W. Scherer
*
* Companion file to package.cpp. Deals with details of ICU data item formats.
* Used for item dependencies.
* Contains adapted code from ucnv_bld.c (swapper code from 2003).
*/
#include "unicode/utypes.h"
#include "unicode/ures.h"
#include "unicode/putil.h"
#include "unicode/udata.h"
#include "cstring.h"
#include "uinvchar.h"
#include "ucmndata.h"
#include "udataswp.h"
#include "swapimpl.h"
#include "toolutil.h"
#include "package.h"
#include "pkg_imp.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/* item formats in common */
#include "uresdata.h"
#include "ucnv_bld.h"
#include "ucnv_io.h"
// general definitions ----------------------------------------------------- ***
U_CDECL_BEGIN
static void U_CALLCONV
printError(void *context, const char *fmt, va_list args) {
vfprintf((FILE *)context, fmt, args);
}
U_CDECL_END
// a data item in native-platform form ------------------------------------- ***
U_NAMESPACE_BEGIN
class NativeItem {
public:
NativeItem() : pItem(NULL), pInfo(NULL), bytes(NULL), swapped(NULL), length(0) {}
NativeItem(const Item *item, UDataSwapFn *swap) : swapped(NULL) {
setItem(item, swap);
}
~NativeItem() {
delete [] swapped;
}
const UDataInfo *getDataInfo() const {
return pInfo;
}
const uint8_t *getBytes() const {
return bytes;
}
int32_t getLength() const {
return length;
}
void setItem(const Item *item, UDataSwapFn *swap) {
pItem=item;
int32_t infoLength, itemHeaderLength;
UErrorCode errorCode=U_ZERO_ERROR;
pInfo=::getDataInfo(pItem->data, pItem->length, infoLength, itemHeaderLength, &errorCode);
if(U_FAILURE(errorCode)) {
exit(errorCode); // should succeed because readFile() checks headers
}
length=pItem->length-itemHeaderLength;
if(pInfo->isBigEndian==U_IS_BIG_ENDIAN && pInfo->charsetFamily==U_CHARSET_FAMILY) {
bytes=pItem->data+itemHeaderLength;
} else {
UDataSwapper *ds=udata_openSwapper((UBool)pInfo->isBigEndian, pInfo->charsetFamily, U_IS_BIG_ENDIAN, U_CHARSET_FAMILY, &errorCode);
if(U_FAILURE(errorCode)) {
fprintf(stderr, "icupkg: udata_openSwapper(\"%s\") failed - %s\n",
pItem->name, u_errorName(errorCode));
exit(errorCode);
}
ds->printError=printError;
ds->printErrorContext=stderr;
swapped=new uint8_t[pItem->length];
if(swapped==NULL) {
fprintf(stderr, "icupkg: unable to allocate memory for swapping \"%s\"\n", pItem->name);
exit(U_MEMORY_ALLOCATION_ERROR);
}
swap(ds, pItem->data, pItem->length, swapped, &errorCode);
pInfo=::getDataInfo(swapped, pItem->length, infoLength, itemHeaderLength, &errorCode);
bytes=swapped+itemHeaderLength;
udata_closeSwapper(ds);
}
}
private:
const Item *pItem;
const UDataInfo *pInfo;
const uint8_t *bytes;
uint8_t *swapped;
int32_t length;
};
// check a dependency ------------------------------------------------------ ***
/*
* assemble the target item name from the source item name, an ID
* and a suffix
*/
static void
makeTargetName(const char *itemName, const char *id, int32_t idLength, const char *suffix,
char *target, int32_t capacity,
UErrorCode *pErrorCode) {
const char *itemID;
int32_t treeLength, suffixLength, targetLength;
// get the item basename
itemID=strrchr(itemName, '/');
if(itemID!=NULL) {
++itemID;
} else {
itemID=itemName;
}
// build the target string
treeLength=(int32_t)(itemID-itemName);
if(idLength<0) {
idLength=(int32_t)strlen(id);
}
suffixLength=(int32_t)strlen(suffix);
targetLength=treeLength+idLength+suffixLength;
if(targetLength>=capacity) {
fprintf(stderr, "icupkg/makeTargetName(%s) target item name length %ld too long\n",
itemName, (long)targetLength);
*pErrorCode=U_BUFFER_OVERFLOW_ERROR;
return;
}
memcpy(target, itemName, treeLength);
memcpy(target+treeLength, id, idLength);
memcpy(target+treeLength+idLength, suffix, suffixLength+1); // +1 includes the terminating NUL
}
static void
checkIDSuffix(const char *itemName, const char *id, int32_t idLength, const char *suffix,
CheckDependency check, void *context,
UErrorCode *pErrorCode) {
char target[200];
makeTargetName(itemName, id, idLength, suffix, target, (int32_t)sizeof(target), pErrorCode);
if(U_SUCCESS(*pErrorCode)) {
check(context, itemName, target);
}
}
/* assemble the target item name from the item's parent item name */
static void
checkParent(const char *itemName, CheckDependency check, void *context,
UErrorCode *pErrorCode) {
const char *itemID, *parent, *parentLimit, *suffix;
int32_t parentLength;
// get the item basename
itemID=strrchr(itemName, '/');
if(itemID!=NULL) {
++itemID;
} else {
itemID=itemName;
}
// get the item suffix
suffix=strrchr(itemID, '.');
if(suffix==NULL) {
// empty suffix, point to the end of the string
suffix=strrchr(itemID, 0);
}
// get the position of the last '_'
for(parentLimit=suffix; parentLimit>itemID && *--parentLimit!='_';) {}
if(parentLimit!=itemID) {
// get the parent item name by truncating the last part of this item's name */
parent=itemID;
parentLength=(int32_t)(parentLimit-itemID);
} else {
// no '_' in the item name: the parent is the root bundle
parent="root";
parentLength=4;
if((suffix-itemID)==parentLength && 0==memcmp(itemID, parent, parentLength)) {
// the item itself is "root", which does not depend on a parent
return;
}
}
checkIDSuffix(itemName, parent, parentLength, suffix, check, context, pErrorCode);
}
// get dependencies from resource bundles ---------------------------------- ***
static const UChar SLASH=0x2f;
/*
* Check for the alias from the string or alias resource res.
*/
static void
checkAlias(const char *itemName,
Resource res, const UChar *alias, int32_t length, UBool useResSuffix,
CheckDependency check, void *context, UErrorCode *pErrorCode) {
int32_t i;
if(!uprv_isInvariantUString(alias, length)) {
fprintf(stderr, "icupkg/ures_enumDependencies(%s res=%08x) alias string contains non-invariant characters\n",
itemName, res);
*pErrorCode=U_INVALID_CHAR_FOUND;
return;
}
// extract the locale ID from alias strings like
// locale_ID/key1/key2/key3
// locale_ID
// search for the first slash
for(i=0; i<length && alias[i]!=SLASH; ++i) {}
if(res_getPublicType(res)==URES_ALIAS) {
// ignore aliases with an initial slash:
// /ICUDATA/... and /pkgname/... go to a different package
// /LOCALE/... are for dynamic sideways fallbacks and don't go to a fixed bundle
if(i==0) {
return; // initial slash ('/')
}
// ignore the intra-bundle path starting from the first slash ('/')
length=i;
} else /* URES_STRING */ {
// the whole string should only consist of a locale ID
if(i!=length) {
fprintf(stderr, "icupkg/ures_enumDependencies(%s res=%08x) %%ALIAS contains a '/'\n",
itemName, res);
*pErrorCode=U_UNSUPPORTED_ERROR;
return;
}
}
// convert the Unicode string to char *
char localeID[32];
if(length>=(int32_t)sizeof(localeID)) {
fprintf(stderr, "icupkg/ures_enumDependencies(%s res=%08x) alias locale ID length %ld too long\n",
itemName, res, (long)length);
*pErrorCode=U_BUFFER_OVERFLOW_ERROR;
return;
}
u_UCharsToChars(alias, localeID, length);
localeID[length]=0;
checkIDSuffix(itemName, localeID, -1, (useResSuffix ? ".res" : ""), check, context, pErrorCode);
}
/*
* Enumerate one resource item and its children and extract dependencies from
* aliases.
*/
static void
ures_enumDependencies(const char *itemName,
const ResourceData *pResData,
Resource res, const char *inKey, const char *parentKey, int32_t depth,
CheckDependency check, void *context,
Package *pkg,
UErrorCode *pErrorCode) {
switch(res_getPublicType(res)) {
case URES_STRING:
{
UBool useResSuffix = TRUE;
// Check for %%ALIAS
if(depth==1 && inKey!=NULL) {
if(0!=strcmp(inKey, "%%ALIAS")) {
break;
}
}
// Check for %%DEPENDENCY
else if(depth==2 && parentKey!=NULL) {
if(0!=strcmp(parentKey, "%%DEPENDENCY")) {
break;
}
useResSuffix = FALSE;
} else {
// we ignore all other strings
break;
}
int32_t length;
// No tracing: build tool
const UChar *alias=res_getStringNoTrace(pResData, res, &length);
checkAlias(itemName, res, alias, length, useResSuffix, check, context, pErrorCode);
}
break;
case URES_ALIAS:
{
int32_t length;
const UChar *alias=res_getAlias(pResData, res, &length);
checkAlias(itemName, res, alias, length, TRUE, check, context, pErrorCode);
}
break;
case URES_TABLE:
{
/* recurse */
int32_t count=res_countArrayItems(pResData, res);
for(int32_t i=0; i<count; ++i) {
const char *itemKey;
Resource item=res_getTableItemByIndex(pResData, res, i, &itemKey);
ures_enumDependencies(
itemName, pResData,
item, itemKey,
inKey, depth+1,
check, context,
pkg,
pErrorCode);
if(U_FAILURE(*pErrorCode)) {
fprintf(stderr, "icupkg/ures_enumDependencies(%s table res=%08x)[%d].recurse(%s: %08x) failed\n",
itemName, res, i, itemKey, item);
break;
}
}
}
break;
case URES_ARRAY:
{
/* recurse */
int32_t count=res_countArrayItems(pResData, res);
for(int32_t i=0; i<count; ++i) {
Resource item=res_getArrayItem(pResData, res, i);
ures_enumDependencies(
itemName, pResData,
item, NULL,
inKey, depth+1,
check, context,
pkg,
pErrorCode);
if(U_FAILURE(*pErrorCode)) {
fprintf(stderr, "icupkg/ures_enumDependencies(%s array res=%08x)[%d].recurse(%08x) failed\n",
itemName, res, i, item);
break;
}
}
}
break;
default:
break;
}
}
static void
ures_enumDependencies(const char *itemName, const UDataInfo *pInfo,
const uint8_t *inBytes, int32_t length,
CheckDependency check, void *context,
Package *pkg,
UErrorCode *pErrorCode) {
ResourceData resData;
res_read(&resData, pInfo, inBytes, length, pErrorCode);
if(U_FAILURE(*pErrorCode)) {
fprintf(stderr, "icupkg: .res format version %02x.%02x not supported, or bundle malformed\n",
pInfo->formatVersion[0], pInfo->formatVersion[1]);
exit(U_UNSUPPORTED_ERROR);
}
/*
* if the bundle attributes are present and the nofallback flag is not set,
* then add the parent bundle as a dependency
*/
if(pInfo->formatVersion[0]>1 || (pInfo->formatVersion[0]==1 && pInfo->formatVersion[1]>=1)) {
if(!resData.noFallback) {
/* this bundle participates in locale fallback */
checkParent(itemName, check, context, pErrorCode);
}
}
icu::NativeItem nativePool;
if(resData.usesPoolBundle) {
char poolName[200];
makeTargetName(itemName, "pool", 4, ".res", poolName, (int32_t)sizeof(poolName), pErrorCode);
if(U_FAILURE(*pErrorCode)) {
return;
}
check(context, itemName, poolName);
int32_t index=pkg->findItem(poolName);
if(index<0) {
// We cannot work with a bundle if its pool resource is missing.
// check() already printed a complaint.
return;
}
// TODO: Cache the native version in the Item itself.
nativePool.setItem(pkg->getItem(index), ures_swap);
const UDataInfo *poolInfo=nativePool.getDataInfo();
if(poolInfo->formatVersion[0]<=1) {
fprintf(stderr, "icupkg: %s is not a pool bundle\n", poolName);
return;
}
const int32_t *poolRoot=(const int32_t *)nativePool.getBytes();
const int32_t *poolIndexes=poolRoot+1;
int32_t poolIndexLength=poolIndexes[URES_INDEX_LENGTH]&0xff;
if(!(poolIndexLength>URES_INDEX_POOL_CHECKSUM &&
(poolIndexes[URES_INDEX_ATTRIBUTES]&URES_ATT_IS_POOL_BUNDLE))
) {
fprintf(stderr, "icupkg: %s is not a pool bundle\n", poolName);
return;
}
if(resData.pRoot[1+URES_INDEX_POOL_CHECKSUM]==poolIndexes[URES_INDEX_POOL_CHECKSUM]) {
resData.poolBundleKeys=(const char *)(poolIndexes+poolIndexLength);
resData.poolBundleStrings=(const uint16_t *)(poolRoot+poolIndexes[URES_INDEX_KEYS_TOP]);
} else {
fprintf(stderr, "icupkg: %s has mismatched checksum for %s\n", poolName, itemName);
return;
}
}
ures_enumDependencies(
itemName, &resData,
resData.rootRes, NULL, NULL, 0,
check, context,
pkg,
pErrorCode);
}
// get dependencies from conversion tables --------------------------------- ***
/* code adapted from ucnv_swap() */
static void
ucnv_enumDependencies(const UDataSwapper *ds,
const char *itemName, const UDataInfo *pInfo,
const uint8_t *inBytes, int32_t length,
CheckDependency check, void *context,
UErrorCode *pErrorCode) {
uint32_t staticDataSize;
const UConverterStaticData *inStaticData;
const _MBCSHeader *inMBCSHeader;
uint8_t outputType;
/* check format version */
if(!(
pInfo->formatVersion[0]==6 &&
pInfo->formatVersion[1]>=2
)) {
fprintf(stderr, "icupkg/ucnv_enumDependencies(): .cnv format version %02x.%02x not supported\n",
pInfo->formatVersion[0], pInfo->formatVersion[1]);
exit(U_UNSUPPORTED_ERROR);
}
/* read the initial UConverterStaticData structure after the UDataInfo header */
inStaticData=(const UConverterStaticData *)inBytes;
if( length<(int32_t)sizeof(UConverterStaticData) ||
(uint32_t)length<(staticDataSize=ds->readUInt32(inStaticData->structSize))
) {
udata_printError(ds, "icupkg/ucnv_enumDependencies(): too few bytes (%d after header) for an ICU .cnv conversion table\n",
length);
*pErrorCode=U_INDEX_OUTOFBOUNDS_ERROR;
return;
}
inBytes+=staticDataSize;
length-=(int32_t)staticDataSize;
/* check for supported conversionType values */
if(inStaticData->conversionType==UCNV_MBCS) {
/* MBCS data */
uint32_t mbcsHeaderLength, mbcsHeaderFlags, mbcsHeaderOptions;
int32_t extOffset;
inMBCSHeader=(const _MBCSHeader *)inBytes;
if(length<(int32_t)sizeof(_MBCSHeader)) {
udata_printError(ds, "icupkg/ucnv_enumDependencies(): too few bytes (%d after headers) for an ICU MBCS .cnv conversion table\n",
length);
*pErrorCode=U_INDEX_OUTOFBOUNDS_ERROR;
return;
}
if(inMBCSHeader->version[0]==4 && inMBCSHeader->version[1]>=1) {
mbcsHeaderLength=MBCS_HEADER_V4_LENGTH;
} else if(inMBCSHeader->version[0]==5 && inMBCSHeader->version[1]>=3 &&
((mbcsHeaderOptions=ds->readUInt32(inMBCSHeader->options))&
MBCS_OPT_UNKNOWN_INCOMPATIBLE_MASK)==0
) {
mbcsHeaderLength=mbcsHeaderOptions&MBCS_OPT_LENGTH_MASK;
} else {
udata_printError(ds, "icupkg/ucnv_enumDependencies(): unsupported _MBCSHeader.version %d.%d\n",
inMBCSHeader->version[0], inMBCSHeader->version[1]);
*pErrorCode=U_UNSUPPORTED_ERROR;
return;
}
mbcsHeaderFlags=ds->readUInt32(inMBCSHeader->flags);
extOffset=(int32_t)(mbcsHeaderFlags>>8);
outputType=(uint8_t)mbcsHeaderFlags;
if(outputType==MBCS_OUTPUT_EXT_ONLY) {
/*
* extension-only file,
* contains a base name instead of normal base table data
*/
char baseName[32];
int32_t baseNameLength;
/* there is extension data after the base data, see ucnv_ext.h */
if(length<(extOffset+UCNV_EXT_INDEXES_MIN_LENGTH*4)) {
udata_printError(ds, "icupkg/ucnv_enumDependencies(): too few bytes (%d after headers) for an ICU MBCS .cnv conversion table with extension data\n",
length);
*pErrorCode=U_INDEX_OUTOFBOUNDS_ERROR;
return;
}
/* swap the base name, between the header and the extension data */
const char *inBaseName=(const char *)inBytes+mbcsHeaderLength*4;
baseNameLength=(int32_t)strlen(inBaseName);
if(baseNameLength>=(int32_t)sizeof(baseName)) {
udata_printError(ds, "icupkg/ucnv_enumDependencies(%s): base name length %ld too long\n",
itemName, baseNameLength);
*pErrorCode=U_UNSUPPORTED_ERROR;
return;
}
ds->swapInvChars(ds, inBaseName, baseNameLength+1, baseName, pErrorCode);
checkIDSuffix(itemName, baseName, -1, ".cnv", check, context, pErrorCode);
}
}
}
// ICU data formats -------------------------------------------------------- ***
static const struct {
uint8_t dataFormat[4];
} dataFormats[]={
{ { 0x52, 0x65, 0x73, 0x42 } }, /* dataFormat="ResB" */
{ { 0x63, 0x6e, 0x76, 0x74 } }, /* dataFormat="cnvt" */
{ { 0x43, 0x76, 0x41, 0x6c } } /* dataFormat="CvAl" */
};
enum {
FMT_RES,
FMT_CNV,
FMT_ALIAS,
FMT_COUNT
};
static int32_t
getDataFormat(const uint8_t dataFormat[4]) {
int32_t i;
for(i=0; i<FMT_COUNT; ++i) {
if(0==memcmp(dataFormats[i].dataFormat, dataFormat, 4)) {
return i;
}
}
return -1;
}
// enumerate dependencies of a package item -------------------------------- ***
void
Package::enumDependencies(Item *pItem, void *context, CheckDependency check) {
int32_t infoLength, itemHeaderLength;
UErrorCode errorCode=U_ZERO_ERROR;
const UDataInfo *pInfo=getDataInfo(pItem->data, pItem->length, infoLength, itemHeaderLength, &errorCode);
if(U_FAILURE(errorCode)) {
return; // should not occur because readFile() checks headers
}
// find the data format and call the corresponding function, if any
int32_t format=getDataFormat(pInfo->dataFormat);
if(format>=0) {
switch(format) {
case FMT_RES:
{
/*
* Swap the resource bundle (if necessary) so that we can use
* the normal runtime uresdata.c code to read it.
* We do not want to duplicate that code, especially not together with on-the-fly swapping.
*/
NativeItem nrb(pItem, ures_swap);
ures_enumDependencies(pItem->name, nrb.getDataInfo(), nrb.getBytes(), nrb.getLength(), check, context, this, &errorCode);
break;
}
case FMT_CNV:
{
// TODO: share/cache swappers
UDataSwapper *ds=udata_openSwapper(
(UBool)pInfo->isBigEndian, pInfo->charsetFamily,
U_IS_BIG_ENDIAN, U_CHARSET_FAMILY,
&errorCode);
if(U_FAILURE(errorCode)) {
fprintf(stderr, "icupkg: udata_openSwapper(\"%s\") failed - %s\n",
pItem->name, u_errorName(errorCode));
exit(errorCode);
}
ds->printError=printError;
ds->printErrorContext=stderr;
const uint8_t *inBytes=pItem->data+itemHeaderLength;
int32_t length=pItem->length-itemHeaderLength;
ucnv_enumDependencies(ds, pItem->name, pInfo, inBytes, length, check, context, &errorCode);
udata_closeSwapper(ds);
break;
}
default:
break;
}
if(U_FAILURE(errorCode)) {
exit(errorCode);
}
}
}
U_NAMESPACE_END
```
|
```kotlin
/*
* that can be found in the LICENSE file.
*/
package codegen.localClass.noPrimaryConstructor
import kotlin.test.*
fun box(s: String): String {
class Local {
constructor(x: Int) {
this.x = x
}
constructor(z: String) {
x = z.length
}
val x: Int
fun result() = s
}
return Local(42).result() + Local("zzz").result()
}
@Test fun runTest() {
println(box("OK"))
}
```
|
Greenshaw High School is a coeducational academy of some 1600 pupils situated in Sutton, England.
The school was opened in the late 1960s as a purpose-built Comprehensive School. The first Headmaster was Mr R B Whellock.
Greenshaw became an academy on 1 June 2011. In October 2014 it was reconstituted as a multi academy trust under the name 'Greenshaw Learning Trust'. It also has a sixth form for students aged 16 to 18. In 2008, students in the Greenshaw Sixth Form achieved results in the top 25% of schools nationally. It has been awarded the Arts Council Silver award, Associate Training School, Investor in People and Healthy School awards.
The school was rated 'Good' in 2012 by Ofsted.
Notable pupils
Barry Winch, Olympic gymnast
Steve Spooner, professional footballer
Harry Aikines-Aryeetey, athlete
Sam Ardley, actor
Tayler Marshall, actor
Bradley McIntosh, musician
Jack Spring, film director
References
External links
Ofsted
Academies in the London Borough of Sutton
Secondary schools in the London Borough of Sutton
Sutton, London
|
```yaml
sample:
description: userspace memory domain protection
example application
name: protected memory
common:
integration_platforms:
- mps2/an385
tags: userspace
harness: console
harness_config:
type: one_line
regex:
- "MSG"
tests:
sample.kernel.memory_protection.shared_mem:
filter: CONFIG_ARCH_HAS_USERSPACE
arch_exclude:
- posix
platform_exclude:
- twr_ke18f
- cy8cproto_062_4343w
- cy8cproto_063_ble
- ucans32k1sic
extra_configs:
- CONFIG_TEST_HW_STACK_PROTECTION=n
```
|
```java
package com.dianping.zebra.group.router;
import junit.framework.Assert;
import org.junit.After;
import org.junit.Test;
public class LocalContextReadWriteStrategyTest {
@Test
public void test_force_master() {
LocalContextReadWriteStrategy.setReadFromMaster();
LocalContextReadWriteStrategy strategy = new LocalContextReadWriteStrategy();
Assert.assertTrue(strategy.shouldReadFromMaster());
}
@After
public void clearContext(){
LocalContextReadWriteStrategy.clearContext();
}
@Test
public void test_clear_context() {
LocalContextReadWriteStrategy strategy = new LocalContextReadWriteStrategy();
Assert.assertFalse(strategy.shouldReadFromMaster());
LocalContextReadWriteStrategy.setReadFromMaster();
Assert.assertTrue(strategy.shouldReadFromMaster());
LocalContextReadWriteStrategy.clearContext();
Assert.assertFalse(strategy.shouldReadFromMaster());
}
}
```
|
Kållekärr is a locality situated in Tjörn Municipality, Västra Götaland County, Sweden with 560 inhabitants in 2010.
References
Populated places in Västra Götaland County
Populated places in Tjörn Municipality
|
Mantšonyane is a town in central Lesotho. It is located southeast of the capital Maseru, close to the western approach to the Mokhoabong Pass, on a high mountain plateau between the towns of Marakabei and Thaba-Tseka, in the Thaba-Tseka District.
Located on the central mountain plateau of Lesotho, Mantšonyane is difficult to reach by ground transport. In the official biography of Archbishop Desmond Tutu, who was the Bishop of Lesotho in the late 1970s, the difficulty of travel around the mountainous central region of Lesotho is illustrated by a detailed account of the Bishop's journey from his official residence in Maseru to St James's Hospital in Mantšonyane.
St James' Hospital and regional health care
In 1963 the Anglican Church opened, through its USPG mission agency, a mission hospital in Mantšonyane. St James' Hospital has grown significantly and is now a major feature of the community. In addition to providing full hospital facilities (with 60 beds) to local residents, the hospital also operates a number of satellite health care facilities in the surrounding region, including six health centres, one health clinic, and two rural village health posts.
For many years resident doctors and matrons were provided through the Anglican Diocese of Lesotho and through USPG. The hospital buildings were largely constructed and staffed through USPG fundraising. Today USPG remains a mission partner, although the mission agency contributes chiefly through its hospital based "USPG connect project" for mothers and babies. Lesotho has a very high infant mortality rate. The hospital was connected to electricity for the first time in 1986, and to the landline telephone network in 2000.
Community facilities
The Anglican Diocese of Lesotho constructed and runs the parish church of St James and also St James' primary school. Both are located adjacent to St James' Mission Hospital. There is a local police station of the Lesotho Mounted Police Service. Mantšonyane Airport has a 2,300 foot paved runway.
Notable residents
Sam Matekane, a businessman and politician who is currently serving as prime minister of Lesotho, was born in the town in 1958.
References
Fitzpatrick, M., Blond, B., Pitcher, G., Richmond, S., and Warren, M. (2004) South Africa, Lesotho and Swaziland. Footscray, VIC: Lonely Planet.
Populated places in Thaba-Tseka District
Thaba-Tseka District
|
```xml
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "path_to_url">
<plist version="1.0">
<dict>
<key>CFBundleDevelopmentRegion</key>
<string>en</string>
<key>CFBundleExecutable</key>
<string>$(EXECUTABLE_NAME)</string>
<key>CFBundleIdentifier</key>
<string>com.facebook.wda.integrationApp</string>
<key>CFBundleInfoDictionaryVersion</key>
<string>6.0</string>
<key>CFBundleName</key>
<string>$(PRODUCT_NAME)</string>
<key>CFBundlePackageType</key>
<string>APPL</string>
<key>CFBundleShortVersionString</key>
<string>1.0</string>
<key>CFBundleSignature</key>
<string>????</string>
<key>CFBundleVersion</key>
<string>1</string>
<key>LSRequiresIPhoneOS</key>
<true/>
<key>NSLocationAlwaysUsageDescription</key>
<string>Yo Yo</string>
<key>NSLocationWhenInUseUsageDescription</key>
<string>Yo Yo</string>
<key>NSLocationAlwaysAndWhenInUseUsageDescription</key>
<string>Yo Yo</string>
<key>NSPhotoLibraryUsageDescription</key>
<string>Yo Yo</string>
<key>UILaunchStoryboardName</key>
<string>LaunchScreen</string>
<key>UIMainStoryboardFile</key>
<string>Main</string>
<key>UIRequiredDeviceCapabilities</key>
<array>
<string>armv7</string>
</array>
<key>UISupportedInterfaceOrientations</key>
<array>
<string>UIInterfaceOrientationPortrait</string>
<string>UIInterfaceOrientationLandscapeLeft</string>
<string>UIInterfaceOrientationLandscapeRight</string>
<string>UIInterfaceOrientationPortraitUpsideDown</string>
</array>
<key>UISupportedInterfaceOrientations~ipad</key>
<array>
<string>UIInterfaceOrientationPortrait</string>
<string>UIInterfaceOrientationPortraitUpsideDown</string>
<string>UIInterfaceOrientationLandscapeLeft</string>
<string>UIInterfaceOrientationLandscapeRight</string>
</array>
</dict>
</plist>
```
|
```smalltalk
// The .NET Foundation licenses this file to you under the MIT license.
// See the LICENSE file in the project root for more information.
using System;
using System.Collections.Generic;
using System.Data;
using System.IO;
using System.Linq;
using System.Reflection;
namespace Microsoft.DotNet.UnifiedBuild.Tests;
public static class AssemblyVersionHelpers
{
public static void WriteAssemblyVersionsToFile(Dictionary<string, Version?> assemblyVersions, string outputPath)
{
string[] lines = assemblyVersions
.Select(kvp => $"{kvp.Key} - {kvp.Value}")
.Order()
.ToArray();
File.WriteAllLines(outputPath, lines);
}
// It's known that assembly versions can be different between builds in their revision field. Disregard that difference
// by excluding that field in the output.
public static Version? GetVersion(AssemblyName assemblyName)
{
if (assemblyName.Version is not null)
{
return new Version(assemblyName.Version.ToString(3));
}
return null;
}
}
```
|
Oleksandr Ishchenko (, born 3 September 1953) is a former Ukrainian football player and manager who is currently the head coach of the Dynamo football school.
He played for SKA Odesa and FC Zirka Kirovohrad, and he coached the Ukraine national under-21 football team, FC Karpaty Lviv and FC Illichivets Mariupol.
Honours
Player
Cup of the Ukrainian SSR
Winner (2): 1973, 1975 (both Zirka Kirovohrad)
Coach
UEFA European Under-21 Championship
Runner-up (1): 2006 (Ukraine)
External links
Profile at Sports.com.ua
Profile at FC Dynamo Kyiv website
1953 births
Living people
Footballers from Kremenchuk
Soviet men's footballers
Ukrainian men's footballers
FC Metalurh Zaporizhzhia players
SKA Odesa players
FC Zvezda Tiraspol players
FC Zirka Kropyvnytskyi players
FC Polissya Zhytomyr players
FC Papirnyk Malyn players
Soviet Second League players
Soviet Second League managers
Ukraine national under-21 football team managers
Soviet football managers
Ukrainian football managers
FC Oleksandriya managers
FC Papirnyk Malyn managers
FC Polissya Zhytomyr managers
FC Zirka Kropyvnytskyi managers
FC Nyva Vinnytsia managers
SC Tavriya Simferopol managers
FC Spartak Ivano-Frankivsk managers
FC Kryvbas Kryvyi Rih managers
FC Karpaty Lviv managers
FC Mariupol managers
FC Aktobe managers
Ukrainian Premier League managers
Ukrainian First League managers
Ukrainian Second League managers
Kazakhstan Premier League managers
Dynamo Kyiv Football Academy managers
Ukrainian expatriate football managers
Ukrainian expatriate sportspeople in Kazakhstan
Expatriate football managers in Kazakhstan
Men's association football defenders
|
Lubomyr Ivansky (; born November 1, 1983) is a Ukrainian former footballer.
Playing career
Ivansky began his career in 1998 with FC Karpaty-2 Lviv in the Ukrainian Second League. In 2000, he spent time in the Ukrainian Premier League with the senior team FC Karpaty Lviv. He played with Lviv for five seasons and also featured with the club's reserve team FC Karpaty-3 Lviv in the Ukrainian Second League. After the relegation of Karpaty Lviv he signed with Obolon Kyiv in the Ukrainian First League. In 2006, he went abroad to Poland to sign with Wisła Płock of the Ekstraklasa, and won the Polish Cup.
The following season, he returned to Ukraine to play with FC Stal Alchevsk. The remainder of his time would be spent in the Ukrainian First & Second Leagues with FC Arsenal-Kyivshchyna Bila Tserkva, FC Komunalnyk Luhansk, Karpaty Kamenka-Bug, FC Desna Chernihiv, FC Rukh Vynnyky. In 2010, he returned to Poland to sign with Resovia Rzeszow in the II Liga. In 2016, he went overseas to Canada to sign with FC Ukraine United in the Canadian Soccer League. In his second season he assisted FC Ukraine in achieving a perfect season, and winning the Second Division Championship. While in his third year he assisted in securing the First Division title.
Honors
Wisła Płock
Polish Cup (1): 2006
FC Ukraine United
CSL Second Division Championship (1): 2017
Canadian Soccer League First Division (1): 2018
References
External links
1983 births
Living people
Footballers from Lviv
Ukrainian men's footballers
Ukrainian expatriate men's footballers
FC Karpaty Lviv players
FC Karpaty-2 Lviv players
FC Karpaty-3 Lviv players
FC Obolon Kyiv players
FC Obolon-2 Bucha players
Wisła Płock players
FC Stal Alchevsk players
FC Stal-2 Alchevsk players
FC Arsenal-Kyivshchyna Bila Tserkva players
FC Komunalnyk Luhansk players
FC Desna Chernihiv players
FC Rukh Lviv players
FC Ukraine United players
Ukrainian Premier League players
Ekstraklasa players
Canadian Soccer League (1998–present) players
Expatriate men's footballers in Poland
Men's association football defenders
Ukrainian First League players
Ukrainian Second League players
II liga players
|
Mtshabezi Mission is a ward in Gwanda District of Matabeleland South province in southern Zimbabwe.
Populated places in Zimbabwe
Wards of Zimbabwe
Gwanda District
|
```python
import json
import os
import boto3
import requests
client = boto3.client("s3", endpoint_url=os.environ["AWS_ENDPOINT_URL"])
def handler(event, context):
custom_localstack_hostname = os.environ["CUSTOM_LOCALSTACK_HOSTNAME"]
domain_endpoint = os.environ["DOMAIN_ENDPOINT"]
results_bucket = os.environ["RESULTS_BUCKET"]
results_key = os.environ["RESULTS_KEY"]
assert (
custom_localstack_hostname in domain_endpoint
), f"{custom_localstack_hostname} not in {domain_endpoint}"
print(f"Event handler function {context.function_name} invoked")
for record in event["Records"]:
body = json.loads(record["body"])
message = json.loads(body["Message"])
print(f"Got message: {message}")
# wait for cluster ready
try:
r = requests.get(
f"http://{domain_endpoint}/_cluster/health?wait_for_status=yellow,timeout=50s",
)
r.raise_for_status()
except Exception as e:
print(f"Error fetching cluster health status: {e!r}")
assert custom_localstack_hostname in body["UnsubscribeURL"]
# write the result to s3
client.put_object(
Bucket=results_bucket, Key=results_key, Body=message["message"].encode("utf8")
)
# just take the first record for now
return
```
|
```c
/*your_sha256_hash--
* memset8_s
*
* October 2008, Bo Berry
*
* All rights reserved.
*
* Permission is hereby granted, free of charge, to any person
* obtaining a copy of this software and associated documentation
* files (the "Software"), to deal in the Software without
* restriction, including without limitation the rights to use,
* copy, modify, merge, publish, distribute, sublicense, and/or
* sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following
* conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
* OTHER DEALINGS IN THE SOFTWARE.
*your_sha256_hash--
*/
#include "safeclib_private.h"
#include "safe_mem_constraint.h"
#include "mem_primitives_lib.h"
#include "safe_mem_lib.h"
/**
* NAME
* memset8_s
*
* SYNOPSIS
* #include "safe_mem_lib.h"
* errno_t
* memset8_s(void *dest, rsize_t len, uint8_t value)
*
* DESCRIPTION
* Sets len bytes starting at dest to the specified value.
*
* SPECIFIED IN
* ISO/IEC JTC1 SC22 WG14 N1172, Programming languages, environments
* and system software interfaces, Extensions to the C Library,
* Part I: Bounds-checking interfaces
*
* INPUT PARAMETERS
* dest pointer to memory that will be set to the value
*
* len number of bytes to be set
*
* value byte value
*
* OUTPUT PARAMETERS
* dest is updated
*
* RUNTIME CONSTRAINTS
* dest shall not be a null pointer.
* len shall not be 0 nor greater than RSIZE_MAX_MEM.
* If there is a runtime constraint, the operation is not performed.
*
* RETURN VALUE
* EOK successful operation
* ESNULLP NULL pointer
* ESZEROL zero length
* ESLEMAX length exceeds max limit
*
* ALSO SEE
* memset16_s(), memset32_s()
*
*/
errno_t
memset8_s (void *dest, rsize_t len, uint8_t value)
{
if (dest == NULL) {
invoke_safe_mem_constraint_handler("memset8_s: dest is null",
NULL, ESNULLP);
return (RCNEGATE(ESNULLP));
}
if (len == 0) {
invoke_safe_mem_constraint_handler("memset8_s: len is 0",
NULL, ESZEROL);
return (RCNEGATE(ESZEROL));
}
if (len > RSIZE_MAX_MEM) {
invoke_safe_mem_constraint_handler("memset8_s: len exceeds max",
NULL, ESLEMAX);
return (RCNEGATE(ESLEMAX));
}
mem_prim_set(dest, len, value);
return (RCNEGATE(EOK));
}
EXPORT_SYMBOL(memset8_s)
```
|
```html
<app-doc docTitle="Angular FileUpload Component" header="FileUpload" description="FileUpload is an advanced uploader with drag and drop support, multi file uploads, auto uploading, progress tracking and validations." [docs]="docs" [apiDocs]="['FileUpload']"></app-doc>
```
|
Dr. C.V. Raman University, Khandwa is a private university located at the village Balkhandsura, near the Khandwa-Indore road, in Khandwa district, Madhya Pradesh, India. The university was established in 2018 by the All India Society for Electronics & Computer Technology (AISECT) under the Madhya Pradesh Niji Vishwavidyalay (Sthapana Evam Sanchalan) Sanshodhan Adhiniyam, 2018, an Act which also established Shri Krishna University and Sardar Patel University Balaghat. The university offers various diploma, undergraduate and postgraduate courses in seven faculties. It is named after India physicist C. V. Raman.
Academics
The institute offers diploma, undergraduate and postgraduate courses through seven faculties:
Faculty of Arts
Faculty of Agriculture
Faculty of Fine Arts
Faculty of Commerce
Faculty of Computer Science and IT
Faculty of Management
Faculty of Science
References
External links
Khandwa district
Universities in Madhya Pradesh
Universities and colleges established in 2018
2018 establishments in Madhya Pradesh
Private universities in India
|
Tim Siegel may refer to:
Tim Siegel (One Life to Live), character in American soap opera One Life to Live
Tim Siegel (tennis) (born 1964), tennis player and coach
|
Now Kasht (, also Romanized as Now Kāsht) is a village in, and the capital of, Taher Gurab Rural District of Taher Gurab District, Sowme'eh Sara County, Gilan province, Iran.
At the 2006 National Census, its population was 859 in 226 households, when it was in the Central District. The following census in 2011 counted 812 people in 234 households. The latest census in 2016 showed a population of 646 people in 222 households. It was the largest village in its rural district.
After the census, the rural district was separated from the district in the formation of Taher Gurab District, which was divided into two rural districts, including the new Abatar Rural District.
References
Sowme'eh Sara County
Populated places in Gilan Province
Populated places in Sowme'eh Sara County
|
```objective-c
/* $OpenBSD: uidswap.h,v 1.14 2018/07/18 11:34:05 dtucker Exp $ */
/*
* Author: Tatu Ylonen <ylo@cs.hut.fi>
* All rights reserved
*
* As far as I am concerned, the code I have written for this software
* can be used freely for any purpose. Any derived versions of this
* software must be clearly marked as such, and if the derived work is
* incompatible with the protocol description in the RFC file, it must be
* called by a name other than "ssh" or "Secure Shell".
*/
void temporarily_use_uid(struct passwd *);
void restore_uid(void);
void permanently_set_uid(struct passwd *);
```
|
Vione (Camunian: ) is a comune in the province of Brescia, in Lombardy. It is situated above the right bank of the river Oglio, in upper Val Camonica. Neighbouring communes are Edolo, Ponte di Legno, Temù and Vezza d'Oglio. Its coat of arms shows a castle with an eagle over it.
References
Cities and towns in Lombardy
|
Interior design education is the teaching of skills and information needed to perform interior design work. Education in this field is offered in different parts of the world; however, the application requirements for acceptance vary among countries and schools. There are a number of different routes to attain qualifications in interior design. An interior design education will teach people how to draw and to plan out a space, and will cover the latest design software along with other important coursework that will prepare them for this field of work. Education includes consideration for the design brief, design processes from concept to scheme development and implementation, as well as exploring surrounding philosophies, trends, sector specialisms and professional skills required for practice.
This field offers multiple job opportunities such as owning a business and teaching along with chances of promotions within established firms. Some schools will offer education in interior architecture together with interior design; these are not the same field of study but do overlap in some ways.
Asia
Interior designing in Asia has been an old art. Several private institutions and universities offer interior design courses in Asia that are at par with the courses offered in the developed parts of the world. Associate, bachelor's and master's degrees in interior design are offered by institutes including Raffles, Indian Institute of Architecture and Design, Hong Kong Polytechnic University, and CID.
Israel
In Israel there are colleges offering four baccalaureate degrees in Interior Design. Some design colleges also offer an Interior Design program as a stand-alone program.
Africa
Interior design education has been delivered in South Africa since the 1870s, and this education is on par with programs offered in most developed countries of the world. In Africa, interior design programs are offered at universities, institutes of technology and at registered private colleges.
Europe
In Europe, the educational requirements differ between interior architects (considered a profession comparable to architects or structural engineers) and interior designers (considered a trade comparable to carpenters).
Traditionally in Germany, Interior Architecture has been taught at polytechnic universities or universities of applied sciences. Baccalaureate programs are normally three years (6 semesters) in length. In Germany, the adaptation of the university system to the international degrees Bachelor and Master has led to a restructuring of degree programs. Since university education traditionally lasted at least 5 years, many Diploma programs have been transformed into consecutive graduate Master programs. Some European universities form partnerships with other universities to offer "internationally orientated Masters courses" in Interior Design, where parts of the course takes place between European partner institutions to offer comprehensive instruction in the Interior Design program, including preparation for the Interior Design qualification exam.
In the UK around fifty universities and art colleges offer 3-year degree courses and, in some cases, year-long Master of Arts courses in interior design. London's Royal College of Art is the world's leading centre for post-graduate studies in art and design subjects and offers a two-year MA programme in interior design that is recognised as the foremost course in the subject. Manchester Metropolitan University runs a BA (Hons.) course in interior design.
North America
Canada
Canadian interior design education can be acquired through the college or university level. Unlike the programs offered in the United States, a degree is not required to become a registered professional designer. Admission to programs marks and creative ability as demonstrated in a portfolio submission. Once accepted into a program, seven years of combined educational and work experience is required before one can take the professional examination to become a registered interior designer. Therefore, if someone graduates from a three-year college diploma program, they will need a minimum of four years working experience, whereas someone graduating from a four-year degree program only needs three. Master's degree programs in Interior Design are far less common in Canada, with the most established being at the University of Manitoba.
United States
Interior Design degree offerings
In the United States many universities and colleges offer four year baccalaureate degrees in Interior Design. Some design colleges also offer Interior Design program as stand-alone program. Master's degrees (MS, MA, MFA and recently the MID) in Interior Design are also available, although this advanced degree is less common than the baccalaureate degree. Many professionals pursue advanced degrees in related subjects, such as industrial design, fine art or education. PhD programs in interior design are increasing in number at various institutions of higher education but only in certain states
Distance education in Interior Design
Educational institutions have expanded beyond the traditional, studio-based instruction in interior design by offering online degree programs for distance learners of interior design. The online degree programs, like the ones offered in traditional form, feature a comprehensive curriculum under offerings that range from 60-credit diploma courses to certificate programs, and to as many as 132 credits for a full-blown baccalaureate degree program.
Recognition of degree programs
Some graduate degree programs in interior design do not require a bachelor's degree in a related field. Although most interior design schools in the United States retain "Interior Design" in the program name, some schools have adopted the name "Interior Architecture" instead. However, programs with "Interior Architecture" in its name may not be comparable to programs for interior design. Sometimes the distinction is drawn between programs which teach courses in structures and programs which do not. It is important to note, that a practicing professional cannot use the title of "Interior Architect," unless the person also completes the requirements for becoming a licensed architect.
Training, other qualifications, and advancement for US interior designers
Post secondary education—especially a bachelor's degree—is recommended, but not required, for entry-level positions in interior design. 3 States plus the District of Columbia, and Puerto Rico license interior designers and 19 states certify or register interior designers. Following formal training, graduates may enter a 1-year to 3-year apprenticeship to gain experience before taking a national licensing exam or joining a professional association. Designers in States that do not require the exam may opt to take it as proof of their qualifications. The National Council for Interior Design Qualification (NCIDQ) administers the licensing exam. To be eligible to take the exam, applicants must have at least 6 years of combined education and experience in interior design, of which at least 2 years constitute post secondary education in design. Once candidates have passed the qualifying exam, they are granted the title of Certified, Registered, or Licensed Interior Designer, depending on the state. Some states require continuing education units in order to maintain one's license.
Training programs are available from professional design schools or from colleges and universities and usually take 2 to 4 years to complete. Graduates of 2-year and 3-year programs are awarded certificates or associate degrees in interior design and normally qualify as assistants to interior designers upon graduation. Graduates with bachelor's degrees usually qualify for entry into a formal design apprenticeship program. Basic coursework includes computer-aided design (CAD) and building information modeling (BIM), building and life safety codes, ADA regulations, building systems, space planning, drawing and sketching, perspective, color psychology, materiality, interior and architectural history, ergonomics, anthroprometrics, ethics, business principles and human psychology.
The National Association of Schools of Art and Design accredits approximately 250 post secondary institutions with programs in art and design. Most of these schools award a degree in interior design. Applicants may be required to submit sketches and other examples of their artistic ability.
The Council for Interior Design Accreditation is the preeminent accreditor of interior design programs that lead to a bachelor's degree. In 2016, there were 182 accredited programs in interior design worldwide, located primarily in schools of art, architecture, and design.
After the completion of formal training, interior designers will enter a 2-year to 3-year apprenticeship to gain experience before taking a licensing exam. Most apprentices work in design or architecture firms under the strict supervision of an experienced designer. Apprentices also may choose to gain experience working as an in-store designer in furniture stores. The NCIDQ offers the Interior Design Experience Program (IDEP), which helps entry-level interior designers gain valuable work experience by supervising work experience and offering mentoring services and workshops to new designers.
Following the apprenticeship, designers may choose to take the national licensing exam. Recent graduate may also choose to become members of a professional association. Because registration or license is not mandatory in all states, membership in a professional association is an indication of an interior designer's qualifications and professional standing.
Employers increasingly prefer interior designers who are familiar with CAD and BIM software. Interior designers also need to know the basics of architecture and engineering in order to ensure that their designs meet building safety codes and ADA requirements. Other skills obtained through an education in interior design include space planning, architectural lighting, textiles, rendering, ergonomics, etc.
In addition to possessing technical knowledge, interior designers must be creative, imaginative, and persistent and must be able to communicate their ideas in writing, visually, and verbally. Because technology and human experiences change rapidly, designers need to be well read, open to new ideas and influences, and quick to react to changing experiences. Problem-solving and critical thinking skills, and the ability to work independently and under pressure are important traits. People in this field need self-discipline to start projects on their own, to budget their time, and to meet deadlines and production schedules. Good business sense and sales ability also are important, especially for those who freelance or run their own business.
Beginning interior designers receive on-the-job training and normally need 1 to 3 years of training before they can advance to higher level positions. Experienced designers in large firms may advance to project designer, project manager, or some other supervisory position. Some experienced designers open their own firms or decide to specialize in one aspect of interior design. Other designers leave the occupation to become teachers in schools of design or in colleges and universities. Many faculty members continue to consult privately or operate small design studios to complement their classroom activities.
See also
Interior Architecture
Interior Design
References
education
Architectural education
|
```html
<!DOCTYPE HTML>
<html lang="" >
<head>
<meta charset="UTF-8">
<meta content="text/html; charset=utf-8" http-equiv="Content-Type">
<title>20170504 </title>
<meta http-equiv="X-UA-Compatible" content="IE=edge" />
<meta name="description" content="">
<meta name="generator" content="GitBook 3.2.2">
<link rel="stylesheet" href="../../gitbook/style.css">
<link rel="stylesheet" href="../../gitbook/gitbook-plugin-highlight/website.css">
<link rel="stylesheet" href="../../gitbook/gitbook-plugin-search/search.css">
<link rel="stylesheet" href="../../gitbook/gitbook-plugin-fontsettings/website.css">
<meta name="HandheldFriendly" content="true"/>
<meta name="viewport" content="width=device-width, initial-scale=1, user-scalable=no">
<meta name="apple-mobile-web-app-capable" content="yes">
<meta name="apple-mobile-web-app-status-bar-style" content="black">
<link rel="apple-touch-icon-precomposed" sizes="152x152" href="../../gitbook/images/apple-touch-icon-precomposed-152.png">
<link rel="shortcut icon" href="../../gitbook/images/favicon.ico" type="image/x-icon">
<link rel="next" href="05.html" />
<link rel="prev" href="03.html" />
</head>
<body>
<div class="book">
<div class="book-summary">
<div id="book-search-input" role="search">
<input type="text" placeholder="Type to search" />
</div>
<nav role="navigation">
<ul class="summary">
<li>
<a href="path_to_url" target="_blank" class="custom-link">WEB</a>
</li>
<li class="divider"></li>
<li class="chapter " data-level="1.1" data-path="../../">
<a href="../../">
</a>
</li>
<li class="chapter " data-level="1.2" data-path="../../INTRO.html">
<a href="../../INTRO.html">
</a>
</li>
<li class="chapter " data-level="1.3" >
<span>
20173
</span>
<ul class="articles">
<li class="chapter " data-level="1.3.1" data-path="../03/01.html">
<a href="../03/01.html">
20170301
</a>
</li>
<li class="chapter " data-level="1.3.2" data-path="../03/02.html">
<a href="../03/02.html">
20170302
</a>
</li>
<li class="chapter " data-level="1.3.3" data-path="../03/03.html">
<a href="../03/03.html">
20170303
</a>
</li>
<li class="chapter " data-level="1.3.4" data-path="../03/04.html">
<a href="../03/04.html">
20170304
</a>
</li>
<li class="chapter " data-level="1.3.5" data-path="../03/05.html">
<a href="../03/05.html">
20170305
</a>
</li>
<li class="chapter " data-level="1.3.6" data-path="../03/06.html">
<a href="../03/06.html">
20170306
</a>
</li>
<li class="chapter " data-level="1.3.7" data-path="../03/07.html">
<a href="../03/07.html">
20170307
</a>
</li>
<li class="chapter " data-level="1.3.8" data-path="../03/08.html">
<a href="../03/08.html">
20170308
</a>
</li>
<li class="chapter " data-level="1.3.9" data-path="../03/09.html">
<a href="../03/09.html">
20170309
</a>
</li>
<li class="chapter " data-level="1.3.10" data-path="../03/10.html">
<a href="../03/10.html">
20170310
</a>
</li>
<li class="chapter " data-level="1.3.11" data-path="../03/11.html">
<a href="../03/11.html">
20170311
</a>
</li>
<li class="chapter " data-level="1.3.12" data-path="../03/12.html">
<a href="../03/12.html">
20170312
</a>
</li>
<li class="chapter " data-level="1.3.13" data-path="../03/13.html">
<a href="../03/13.html">
20170313
</a>
</li>
<li class="chapter " data-level="1.3.14" data-path="../03/14.html">
<a href="../03/14.html">
20170314
</a>
</li>
<li class="chapter " data-level="1.3.15" data-path="../03/15.html">
<a href="../03/15.html">
20170315
</a>
</li>
<li class="chapter " data-level="1.3.16" data-path="../03/16.html">
<a href="../03/16.html">
20170316
</a>
</li>
<li class="chapter " data-level="1.3.17" data-path="../03/17.html">
<a href="../03/17.html">
20170317
</a>
</li>
<li class="chapter " data-level="1.3.18" data-path="../03/18.html">
<a href="../03/18.html">
20170318
</a>
</li>
<li class="chapter " data-level="1.3.19" data-path="../03/19.html">
<a href="../03/19.html">
20170319
</a>
</li>
<li class="chapter " data-level="1.3.20" data-path="../03/20.html">
<a href="../03/20.html">
20170320
</a>
</li>
<li class="chapter " data-level="1.3.21" data-path="../03/21.html">
<a href="../03/21.html">
20170321
</a>
</li>
<li class="chapter " data-level="1.3.22" data-path="../03/22.html">
<a href="../03/22.html">
20170322
</a>
</li>
<li class="chapter " data-level="1.3.23" data-path="../03/23.html">
<a href="../03/23.html">
20170323
</a>
</li>
<li class="chapter " data-level="1.3.24" data-path="../03/24.html">
<a href="../03/24.html">
20170324
</a>
</li>
<li class="chapter " data-level="1.3.25" data-path="../03/25.html">
<a href="../03/25.html">
20170325
</a>
</li>
<li class="chapter " data-level="1.3.26" data-path="../03/26.html">
<a href="../03/26.html">
20170326
</a>
</li>
<li class="chapter " data-level="1.3.27" data-path="../03/27.html">
<a href="../03/27.html">
20170327
</a>
</li>
<li class="chapter " data-level="1.3.28" data-path="../03/28.html">
<a href="../03/28.html">
20170328
</a>
</li>
</ul>
</li>
<li class="chapter " data-level="1.4" >
<span>
20174
</span>
<ul class="articles">
<li class="chapter " data-level="1.4.1" data-path="../04/01.html">
<a href="../04/01.html">
20170401
</a>
</li>
<li class="chapter " data-level="1.4.2" data-path="../04/02.md">
<span>
20170402
</a>
</li>
<li class="chapter " data-level="1.4.3" data-path="../04/03.html">
<a href="../04/03.html">
20170403
</a>
</li>
<li class="chapter " data-level="1.4.4" data-path="../04/04.html">
<a href="../04/04.html">
20170404
</a>
</li>
<li class="chapter " data-level="1.4.5" data-path="../04/05.html">
<a href="../04/05.html">
20170405
</a>
</li>
<li class="chapter " data-level="1.4.6" data-path="../04/06.html">
<a href="../04/06.html">
20170406
</a>
</li>
<li class="chapter " data-level="1.4.7" data-path="../04/07.html">
<a href="../04/07.html">
20170407
</a>
</li>
<li class="chapter " data-level="1.4.8" data-path="../04/08.html">
<a href="../04/08.html">
20170408
</a>
</li>
<li class="chapter " data-level="1.4.9" data-path="../04/09.html">
<a href="../04/09.html">
20170409
</a>
</li>
<li class="chapter " data-level="1.4.10" data-path="../04/10.md">
<span>
20170410
</a>
</li>
<li class="chapter " data-level="1.4.11" data-path="../04/11.html">
<a href="../04/11.html">
20170411
</a>
</li>
<li class="chapter " data-level="1.4.12" data-path="../04/12.html">
<a href="../04/12.html">
20170412
</a>
</li>
<li class="chapter " data-level="1.4.13" data-path="../04/13.html">
<a href="../04/13.html">
20170413
</a>
</li>
<li class="chapter " data-level="1.4.14" data-path="../04/14.html">
<a href="../04/14.html">
20170414
</a>
</li>
<li class="chapter " data-level="1.4.15" data-path="../04/15.html">
<a href="../04/15.html">
20170415
</a>
</li>
<li class="chapter " data-level="1.4.16" data-path="../04/16.html">
<a href="../04/16.html">
20170416
</a>
</li>
<li class="chapter " data-level="1.4.17" data-path="../04/17.html">
<a href="../04/17.html">
20170417
</a>
</li>
<li class="chapter " data-level="1.4.18" data-path="../04/18.html">
<a href="../04/18.html">
20170418
</a>
</li>
<li class="chapter " data-level="1.4.19" data-path="../04/19.html">
<a href="../04/19.html">
20170419
</a>
</li>
<li class="chapter " data-level="1.4.20" data-path="../04/20.html">
<a href="../04/20.html">
20170420
</a>
</li>
<li class="chapter " data-level="1.4.21" data-path="../04/21.html">
<a href="../04/21.html">
20170421
</a>
</li>
<li class="chapter " data-level="1.4.22" data-path="../04/22.html">
<a href="../04/22.html">
20170422
</a>
</li>
<li class="chapter " data-level="1.4.23" data-path="../04/23.html">
<a href="../04/23.html">
20170423
</a>
</li>
<li class="chapter " data-level="1.4.24" data-path="../04/24.html">
<a href="../04/24.html">
20170424
</a>
</li>
<li class="chapter " data-level="1.4.25" data-path="../04/25.html">
<a href="../04/25.html">
20170425
</a>
</li>
<li class="chapter " data-level="1.4.26" data-path="../04/26.html">
<a href="../04/26.html">
20170426
</a>
</li>
<li class="chapter " data-level="1.4.27" data-path="../04/27.html">
<a href="../04/27.html">
20170427
</a>
</li>
<li class="chapter " data-level="1.4.28" data-path="../04/28.html">
<a href="../04/28.html">
20170428
</a>
</li>
</ul>
</li>
<li class="chapter " data-level="1.5" >
<span>
20175
</span>
<ul class="articles">
<li class="chapter " data-level="1.5.1" data-path="01.html">
<a href="01.html">
20170501
</a>
</li>
<li class="chapter " data-level="1.5.2" data-path="02.html">
<a href="02.html">
20170502
</a>
</li>
<li class="chapter " data-level="1.5.3" data-path="03.html">
<a href="03.html">
20170503
</a>
</li>
<li class="chapter active" data-level="1.5.4" data-path="04.html">
<a href="04.html">
20170504
</a>
</li>
<li class="chapter " data-level="1.5.5" data-path="05.html">
<a href="05.html">
20170505
</a>
</li>
<li class="chapter " data-level="1.5.6" data-path="06.html">
<a href="06.html">
20170506
</a>
</li>
<li class="chapter " data-level="1.5.7" data-path="07.html">
<a href="07.html">
20170507
</a>
</li>
<li class="chapter " data-level="1.5.8" data-path="08.html">
<a href="08.html">
20170508
</a>
</li>
<li class="chapter " data-level="1.5.9" data-path="09.html">
<a href="09.html">
20170509
</a>
</li>
<li class="chapter " data-level="1.5.10" data-path="10.html">
<a href="10.html">
20170510
</a>
</li>
<li class="chapter " data-level="1.5.11" data-path="11.html">
<a href="11.html">
20170511
</a>
</li>
<li class="chapter " data-level="1.5.12" data-path="12.html">
<a href="12.html">
20170512
</a>
</li>
<li class="chapter " data-level="1.5.13" data-path="13.html">
<a href="13.html">
20170513
</a>
</li>
<li class="chapter " data-level="1.5.14" data-path="14.html">
<a href="14.html">
20170514
</a>
</li>
<li class="chapter " data-level="1.5.15" data-path="15.html">
<a href="15.html">
20170515
</a>
</li>
<li class="chapter " data-level="1.5.16" data-path="16.html">
<a href="16.html">
20170516
</a>
</li>
<li class="chapter " data-level="1.5.17" data-path="17.html">
<a href="17.html">
20170517
</a>
</li>
<li class="chapter " data-level="1.5.18" data-path="18.html">
<a href="18.html">
20170518
</a>
</li>
<li class="chapter " data-level="1.5.19" data-path="19.html">
<a href="19.html">
20170519
</a>
</li>
<li class="chapter " data-level="1.5.20" data-path="20.html">
<a href="20.html">
20170520
</a>
</li>
<li class="chapter " data-level="1.5.21" data-path="21.html">
<a href="21.html">
20170521
</a>
</li>
<li class="chapter " data-level="1.5.22" data-path="22.html">
<a href="22.html">
20170522
</a>
</li>
<li class="chapter " data-level="1.5.23" data-path="23.md">
<span>
20170523
</a>
</li>
<li class="chapter " data-level="1.5.24" data-path="24.md">
<span>
20170524
</a>
</li>
<li class="chapter " data-level="1.5.25" data-path="25.md">
<span>
20170525
</a>
</li>
<li class="chapter " data-level="1.5.26" data-path="26.md">
<span>
20170526
</a>
</li>
<li class="chapter " data-level="1.5.27" data-path="27.md">
<span>
20170527
</a>
</li>
<li class="chapter " data-level="1.5.28" data-path="28.md">
<span>
20170528
</a>
</li>
</ul>
</li>
<li class="divider"></li>
<li>
<a href="path_to_url" target="blank" class="gitbook-link">
Published with GitBook
</a>
</li>
</ul>
</nav>
</div>
<div class="book-body">
<div class="body-inner">
<div class="book-header" role="navigation">
<!-- Title -->
<h1>
<i class="fa fa-circle-o-notch fa-spin"></i>
<a href="../.." >20170504</a>
</h1>
</div>
<div class="page-wrapper" tabindex="-1" role="main">
<div class="page-inner">
<div id="book-search-results">
<div class="search-noresults">
<section class="normal markdown-section">
<h1 id="20170504-码农日报"><a href="04.html">20170504 码农日报</a></h1>
<p><a href="path_to_url" target="_blank">前端日报</a>栏目数据来自<a href="path_to_url" target="_blank">码农头条</a>（我开发的爬虫），每日分享前端、移动开发、设计、资源和资讯等，为开发者提供动力，点击Star按钮来关注这个项目，点击Watch来收听每日的更新<a href="path_to_url" target="_blank">Github主页</a></p>
<ul>
<li><a href="path_to_url" target="_blank">利用css3的animate实现点点点loading动画效果（二）</a> （SegmentFault）</li>
<li><a href="path_to_url" target="_blank">canvas 实现随机验证码</a> （SegmentFault）</li>
<li><a href="path_to_url" target="_blank">javascript——数组</a> （SegmentFault）</li>
<li><a href="path_to_url" target="_blank">使用vue-cli脚手架构建Vue+Vuex项目及Vuex的使用</a> （SegmentFault）</li>
<li><a href="path_to_url" target="_blank">Config Jenkins+Github</a> （SegmentFault）</li>
</ul>
<hr>
<ul>
<li><a href="path_to_url" target="_blank">从性能角度看react组件拆分的重要性</a> （SegmentFault）</li>
<li><a href="path_to_url" target="_blank">ECMAScript6系列之二：变量的解构赋值</a> （SegmentFault）</li>
<li><a href="path_to_url" target="_blank">前端技术实现一个脸萌</a> （开发者头条）</li>
<li><a href="path_to_url" target="_blank">简单的UML</a> （SegmentFault）</li>
<li><a href="path_to_url" target="_blank">Prepack：Facebook 出品的 JS 代码优化工具</a> （开发者头条）</li>
</ul>
<hr>
<ul>
<li><a href="path_to_url" target="_blank">深入学习 CSS3 的 matrix 属性</a> （稀土掘金）</li>
<li><a href="path_to_url" target="_blank">动手实现一个日期选择器 Datepicker-Vue.2x</a> （稀土掘金）</li>
<li><a href="path_to_url" target="_blank">Angular vs React 最全面深入对比</a> （稀土掘金）</li>
<li><a href="path_to_url" target="_blank">HTTP读书笔记——了解Web及网络基础</a> （SegmentFault）</li>
<li><a href="path_to_url" target="_blank">CSS揭秘之形状</a> （稀土掘金）</li>
</ul>
<hr>
<ul>
<li><a href="path_to_url" target="_blank">vue.js 初体验— Chrome 插件开发实录</a> （稀土掘金）</li>
<li><a href="path_to_url" target="_blank">jquery图片预加载插件</a> （SegmentFault）</li>
<li><a href="path_to_url" target="_blank">Create Next App – 用 Next.js 创建后端渲染的 React 应用</a> （稀土掘金）</li>
<li><a href="path_to_url" target="_blank">Freactal – Clean and robust state management for React and React-like libs</a> （稀土掘金）</li>
<li><a href="path_to_url" target="_blank">Sakura – 极简 CSS 框架 / 主题</a> （稀土掘金）</li>
</ul>
<hr>
<ul>
<li><a href="path_to_url" target="_blank">项目什么时候需要 React 框架呢？</a> （稀土掘金）</li>
<li><a href="path_to_url" target="_blank">可以打印栈信息的日志函数,移动混合开发必备!!</a> （SegmentFault）</li>
<li><a href="path_to_url" target="_blank">10 个基于 JavaScript 的机器学习实例</a> （稀土掘金）</li>
<li><a href="path_to_url" target="_blank">纪念我的大三实习春招</a> （SegmentFault）</li>
<li><a href="path_to_url" target="_blank">从 Velocity 到 Thymeleaf：浅谈模板迁移</a> （稀土掘金）</li>
</ul>
<hr>
<ul>
<li><a href="path_to_url" target="_blank">微信小程序登录页动画 – 云层漂浮</a> （稀土掘金）</li>
<li><a href="path_to_url" target="_blank">function 作为构造函数和非构造函数调用的区别</a> （开发者头条）</li>
<li><a href="path_to_url" target="_blank">Facebook 开源代码优化工具 Prepack</a> （稀土掘金）</li>
<li><a href="path_to_url" target="_blank">Multipath 多路径配置实践心得</a> （开发者头条）</li>
<li><a href="path_to_url" target="_blank">浏览器插件 | 帮助你从各个网站轻松 Copy 代码</a> （稀土掘金）</li>
</ul>
<p>日报维护作者：<a href="path_to_url" target="_blank">前端开发博客</a> </p>
</section>
</div>
<div class="search-results">
<div class="has-results">
<h1 class="search-results-title"><span class='search-results-count'></span> results matching "<span class='search-query'></span>"</h1>
<ul class="search-results-list"></ul>
</div>
<div class="no-results">
<h1 class="search-results-title">No results matching "<span class='search-query'></span>"</h1>
</div>
</div>
</div>
</div>
</div>
</div>
<a href="03.html" class="navigation navigation-prev " aria-label="Previous page: 20170503">
<i class="fa fa-angle-left"></i>
</a>
<a href="05.html" class="navigation navigation-next " aria-label="Next page: 20170505">
<i class="fa fa-angle-right"></i>
</a>
</div>
<script>
var gitbook = gitbook || [];
gitbook.push(function() {
gitbook.page.hasChanged({"page":{"title":"20170504","level":"1.5.4","depth":2,"next":{"title":"20170505","level":"1.5.5","depth":2,"path":"2017/05/05.md","ref":"2017/05/05.md","articles":[]},"previous":{"title":"20170503","level":"1.5.3","depth":2,"path":"2017/05/03.md","ref":"2017/05/03.md","articles":[]},"dir":"ltr"},"config":{"plugins":[],"styles":{"website":"styles/website.css","pdf":"styles/pdf.css","epub":"styles/epub.css","mobi":"styles/mobi.css","ebook":"styles/ebook.css","print":"styles/print.css"},"pluginsConfig":{"highlight":{},"search":{},"lunr":{"maxIndexSize":1000000,"ignoreSpecialCharacters":false},"sharing":{"facebook":true,"twitter":true,"google":false,"weibo":false,"instapaper":false,"vk":false,"all":["facebook","google","twitter","weibo","instapaper"]},"fontsettings":{"theme":"white","family":"sans","size":2},"theme-default":{"styles":{"website":"styles/website.css","pdf":"styles/pdf.css","epub":"styles/epub.css","mobi":"styles/mobi.css","ebook":"styles/ebook.css","print":"styles/print.css"},"showLevel":false}},"theme":"default","pdf":{"pageNumbers":true,"fontSize":12,"fontFamily":"Arial","paperSize":"a4","chapterMark":"pagebreak","pageBreaksBefore":"/","margin":{"right":62,"left":62,"top":56,"bottom":56}},"structure":{"langs":"LANGS.md","readme":"README.md","glossary":"GLOSSARY.md","summary":"SUMMARY.md"},"variables":{},"title":"","links":{"sidebar":{"WEB":"path_to_url"},"sharing":{"google":null,"facebook":null,"twitter":null,"weibo":null,"all":null}},"gitbook":"*","description":"Watch path_to_url"},"file":{"path":"2017/05/04.md","mtime":"2017-05-07T07:24:15.174Z","type":"markdown"},"gitbook":{"version":"3.2.2","time":"2017-05-23T14:32:08.524Z"},"basePath":"../..","book":{"language":""}});
});
</script>
</div>
<script src="../../gitbook/gitbook.js"></script>
<script src="../../gitbook/theme.js"></script>
<script src="../../gitbook/gitbook-plugin-search/search-engine.js"></script>
<script src="../../gitbook/gitbook-plugin-search/search.js"></script>
<script src="../../gitbook/gitbook-plugin-lunr/lunr.min.js"></script>
<script src="../../gitbook/gitbook-plugin-lunr/search-lunr.js"></script>
<script src="../../gitbook/gitbook-plugin-sharing/buttons.js"></script>
<script src="../../gitbook/gitbook-plugin-fontsettings/fontsettings.js"></script>
</body>
</html>
```
|
Neeraj Madhav (born 26 March 1990), also known by his stage name NJ is an Indian actor, rapper and dancer who predominantly works in Malayalam films.
Early life
Neeraj was born on 26 March 1990, in Kozhikode, Kerala into a Malayali Brahmin family. He did his schooling from St. Joseph's Boys' Higher Secondary School, Calicut. Then graduated in Visual communications from SRM Institute of Science and Technology, Kanchipuram and later did post-graduation in Theatre from School of Drama and Fine Arts, Thrissur. His father Dr. K. Madhavan is a veterinarian, and his mother Latha, a teacher.
The young talent started off as a dancer with the first edition of reality television programme ‘Super Dancer’ on Amrita TV and made it to the final round. Neeraj is also a trained Bharatanatyam dancer, having learned it under Kalamandalam Saraswathy and her daughter, Aswathy. He is also trained in chenda and is a disciple of Kalanilayam Udayan Namboodiri.
Neeraj has a younger brother Navneeth Madhav, another dancer turned actor in the family. He has acted in films such as Shikkar, Kottarathil Kutty Bhootham,Nallavan and Manikyakkallu and TV series such as Kuttichathan.
Career
Neeraj made his entry to the Malayalam cinema industry through Raaj Prabavathy Menon's Buddy into which he was selected through an audition. He was later noticed by director Jeethu Joseph and was invited to be a part of his movies Memories and Drishyam, both turned out to be box office successes, with the latter becoming the highest-grossing Malayalam film ever. Meanwhile, Neeraj also acted in Abrid Shine's 1983 and Sathyan Anthikad's Oru Indian Pranayakadha.
Anil Radhakrishnan Menon's Sapthamashree Thaskaraha, in which Neeraj plays one of the lead characters alongside Prithviraj, Anoop Kannan's Homely Meals and Apothecary (film) - a medical drama directed by Madhav Ramadasan are also other noted performances of the actor.
Neeraj also debuted as an official dance choreographer through Oru Vadakkan Selfie, scripted by Vineeth Sreenivasan, with the hit song "Enne Thallendammava". His other releases in 2015 also include Jamna Pyari, Kunjiramayanam, Madhura Naranga, KL.10 Pathu, Charlie and Adi Kapyare Kootamani.
The movie Oozham, which has Prithviraj in the lead, has Neeraj in a full-length role. Neeraj also portrayed a pivotal role in Tom Emmatty's Oru Mexican Aparatha.
Neeraj debuted as a screenplay writer through the movie Lavakusha in 2017 and also played one of the title characters in this along with Aju Varghese.
Neeraj plays his first lead role in the movie Paippin Chuvattile Pranayam. It was directed by debutant Domin D'Silva. In the movie, he portrays Govindankutty, a daily wage labourer.
In 2019, Neeraj starred as the main antagonist, Moosa Rehman in the Amazon Original web series titled The Family Man, helmed and produced by director duo Raj and DK. The series also stars Manoj Bajpayee, Priyamani and Kishore in major roles.
In July 2020, he released a rap song titled "Pani Paali". it depicts certain common events in the lives of common people during the COVID-19 pandemic. The song went viral in a very short period of time and was a huge hit among Malayalees and also around other parts of the globe. It also introduced rap music to a more mainstream audience.
Personal life
Neeraj is the son of Dr. K. Madhavan and Latha Madhavan. He married his long time girlfriend Deepthi who is also a native of Kozhikode, on April 2, 2018. The couple have a daughter born in 2021.
Filmography
All films are in Malayalam language unless otherwise noted.
Films
Web series
Other works
As choreographer
Discography
Awards and nominations
Asianet Film Awards
2018 – Won – Best Star Pair – Paippin Chuvattile Pranayam
Asiavision Awards
2015 – Won – New Sensation in Acting (Male) for performance in various movies
North American Film Awards
2016 – Special mention by the jury for performance in various movies
2017 – Special mention by the jury for performance in Paippin Chuvattile Pranayam
References
External links
1987 births
Living people
Male actors from Kozhikode
Male actors in Malayalam cinema
Indian male film actors
21st-century Indian male actors
|
Volvarina umlaasensis is a species of sea snail, a marine gastropod mollusk in the family Marginellidae, the margin snails.
Description
Distribution
This marine species occurs off Natal, South Africa.
References
Lussi, M.; Smith, G. (1996). Notes on members of the Genera Volvarina Hinds, 1844 and Dentimargo Cossmann, 1889 in S. Africa with the description of eight new species. World Shells. 16: 29–40.
Cossignani, T. (2006). Marginellidae & Cystiscidae of the World. L'Informatore Piceno. 408 pp
umlaasensis
Gastropods described in 1996
|
The 225th Engineer Brigade is a combat heavy engineer brigade of the Louisiana Army National Guard. It is one of the largest engineer formations in the United States Army National Guard. The 225th Engineer Brigade is headquartered at Camp Beauregard near Pineville, Louisiana in Rapides Parish. The brigade conducts missions of mobility, counter-mobility, survivability, and civil engineering support. The brigade possesses a mixture of civil and combat engineer units to accomplish these missions.
History
In 1990 the 769th Engineer Battalion participated in the "Fuertes Caminos", a low intensity conflict from 6 January to 7 July 1990. During Operation Beyond the Horizons 2008, the 225th Engineer Brigade will provide construction support to humanitarian assistance missions in Honduras.
The 769th Engineer Battalion participated in "Operation Minuteman" in 1990 by constructing a 12 km road in rural Panama. This battalion also repaired schools, churches, and medical facilities during this operation.
The brigade has deployed battalion and company sized elements to Afghanistan and Iraq during the "Global War on Terror" since 2001. In Afghanistan elements of the 769th Engineer Battalion served as part of Task Force Dragon and Task Force Panther under the 505th Infantry Regiment around Bagram Air Base.
The brigade deployed in support to the New Orleans area after Hurricane Katrina. Hundreds of soldiers from the 225th Engineer Brigade served on Joint Task Force Gator, which provided law enforcement support to New Orleans from summer 2006 to 28 February 2009.
In 2007, the 225th served as the headquarters and construction element for Operation New Horizons 2007. During this mission four construction projects consisting of two-classrooms were built at four different schools within the nation of Belize in Central America. These projects where at Carmelita; Crooked Tree, Hattieville and Trial Farm. In addition to these construction mission medical, dental, and veterinary services were provide for several thousand Belizeans at Orange Walk, Burrel Boom and Ladyville. In earlier New Horizons operations, the brigade constructed buildings at Price Barracks, a military installation outside of Ladyville shared by the British Army and the Belize Defence Force in 2000 and a school at Guadalupe in 1997.
On July 14, 2008, HSC and FSC of the 769th Engineer Battalion (combat) returned after a year in Iraq. The units mobilized and demobilized from Fort McCoy, Wisconsin. The 927th Sapper Company of the 769th Engineer Battalion (combat) deployed to serve a year in Afghanistan from February 2008 to March 2009.
In August 2008, the 225th Engineer Brigade mobilized in preparation for Hurricane Gustav. The brigade conducted operations alongside units from several states such as: 203rd Engineer Battalion Missouri, 216th Engineer Battalion Ohio, 224th Engineer Battalion Iowa, and also units of infantry and military police from Kentucky, Tennessee, and Nebraska. The 769th Engineer Battalion operated in the following parishes: East Baton Rouge Parish, Ascension, Assumption, and Iberville. The brigade continued operations through September 2008.
In May 2010, members of the 2225th Multi-Role Bridging Company, which is part of the 225th and located at Camp Villere in Slidell, Louisiana, built and operated floating bridges to help support the cleanup efforts of the Deepwater Horizon Oil Spill in the Gulf of Mexico.
In September 2017, members of the 922nd Engineer Company, 528 Engineer Battalion, were deployed to Puerto Rico to assist in recovery efforts in response to Hurricane Maria. The unit's main tasks were road clearance using heavy machinery and food/water/medical supply distribution.
Organization
The 225th Engineer Brigade consists of a headquarters company and four combat heavy engineer battalions:
225th Engineer Brigade (CASTLE)
Headquarters and Headquarters Company (HHC) at Camp Beauregard, LA
205th Engineer Battalion
HHC at Bogalusa, LA in Washington Parish
1021st Engineer Company (Vertical) at Covington, LA
843rd Engineer Company
2225th Engineer Company (Multi-Role Bridge) at Marrero, LA
Forward Support Company
527th Engineer Battalion (Triple Alpha) ("Anything, Anytime, Anywhere")
HHC at Lincoln Parish
844th Engineer Company (Horizontal) at Camp Beauregard
1020th Engineer Company (Vertical) at Marksville, LA in Avoyelles Parish
1022nd Engineer Company (Vertical) at West Monroe, LA in Ouachita Parish
Forward Support Company at Ruston, LA
528th Engineer Battalion (To The Very End)
Headquarters and Service Company at Monroe, LA in Ouachita Parish
Forward Support Company at Monroe, LA
922nd Engineer Company (Vertical) at Gonzales, Louisiana in Ascension Parish
830th Engineer Team (Concrete) at Monroe, LA
832nd Engineer Team (Asphalt) at Plaquemine, LA
921st Engineer Company (Horizontal) at Winnsboro, LA in Franklin Parish
1023rd Engineer Company (Vertical) at Bastrop, LA in Morehouse Parish
769th Engineer Battalion (Tigators)
HHC at Baton Rouge, Louisiana
926th Engineer Company (Mobility Augmentation) at Baker, Louisiana in East Baton Rouge Parish
927th Engineer Company (Sapper) at Baton Rouge, Louisiana in East Baton Rouge Parish
928th Engineer Company (Sapper) at Napoleonville in Assumption Parish
Forward Support Company at Baton Rouge, Louisiana in East Baton Rouge Parish
See also
256th Infantry Brigade
Louisiana Army National Guard
References
External links
Louisiana National Guard official homepage
225th Engineer Brigade
Brigades of the United States Army National Guard
Engineer 225
|
```scss
:host ::ng-deep .card-container {
.card {
width: 75px;
height: 75px;
display: flex;
align-items: center;
justify-content: center;
margin-right: 1rem;
user-select: none;
padding: 0;
&.primary-box {
background-color: var(--primary-color);
padding: 0;
color: var(--primary-color-text);
}
&.styled-box-green {
.p-ink {
background: rgba(#4baf50, 0.3);
}
}
&.styled-box-orange {
.p-ink {
background: rgba(#ffc106, 0.3);
}
}
&.styled-box-purple {
.p-ink {
background: rgba(#9c27b0, 0.3);
}
}
&:last-child {
margin-right: 0;
}
}
}
```
|
```css
.typing-block {
position: absolute;
padding: 0 0 0 72px;
bottom: 0;
width: 100%;
-webkit-box-sizing: border-box;
-moz-box-sizing: border-box;
box-sizing: border-box;
}
.typing-text {
font: var(--text-body2);
line-height: 13px;
color: var(--text-color-low);
display: inline-block;
white-space: nowrap;
text-overflow: ellipsis;
overflow: hidden;
max-width: calc(100% - 66px);
vertical-align: middle;
}
.typing-bounce {
width: 34px;
text-align: center;
display: inline-block;
vertical-align: middle;
margin-left: 4px;
}
.typing-bounce div {
width: 4px;
height: 4px;
background-color: #777777;
border-radius: 100%;
display: inline-block;
-webkit-animation: typing-bounce 1.4s ease-in-out 0s infinite both;
animation: typing-bounce 1.4s ease-in-out 0s infinite both;
vertical-align: middle;
margin: 0 1px;
}
.typing-bounce div.typing-bounce1 {
-webkit-animation-delay: -0.32s;
animation-delay: -0.32s;
}
.typing-bounce div.typing-bounce2 {
-webkit-animation-delay: -0.16s;
animation-delay: -0.16s;
}
@-webkit-keyframes typing-bounce {
0%, 80%, 100% {
-webkit-transform: scale(0);
transform: scale(0);
}
40% {
-webkit-transform: scale(1);
transform: scale(1);
}
}
@keyframes typing-bounce {
0%, 80%, 100% {
-webkit-transform: scale(0);
transform: scale(0);
}
40% {
-webkit-transform: scale(1);
transform: scale(1);
}
}
```
|
```php
<?php
declare(strict_types=1);
/**
* Passbolt ~ Open source password manager for teams
*
* For full copyright and license information, please see the LICENSE.txt
* Redistributions of files must retain the above copyright notice.
*
* @link path_to_url Passbolt(tm)
* @since 4.10.0
*/
namespace App\Test\TestCase\Command;
use App\Command\PassboltBuildCommandsListener;
use App\Command\PassboltCommand;
use Cake\Console\CommandCollection;
use Cake\Core\Container;
use Cake\Event\Event;
use Cake\TestSuite\TestCase;
use CakephpFixtureFactories\Command\PersistCommand;
use Migrations\Command\MigrationsCreateCommand;
use PassboltTestData\Command\DummyCommand;
use PassboltTestData\Command\InsertCommand;
class PassboltBuildCommandsListenerTest extends TestCase
{
/**
* Ensures that the passbolt commands are correctly filtered form the non-passbolt commands
* and are sorted alphabetically
*/
public function testPassboltBuildCommandsListener()
{
$listener = new PassboltBuildCommandsListener();
$commands = new CommandCollection([
'fixture_factories_persist' => PersistCommand::class,
'passbolt insert' => InsertCommand::class,
'passbolt dummy' => DummyCommand::class,
'migrations create' => MigrationsCreateCommand::class,
]);
$container = new Container();
$listener->setPassboltCommandCollection(new Event('foo'), $commands);
$listener->addCommandCollectionToContainer(new Event('bar'), $container);
/** @var PassboltCommand $passboltCommand */
$passboltCommand = $container->get(PassboltCommand::class);
$expectedCommands = new CommandCollection([
'insert' => InsertCommand::class,
'dummy' => DummyCommand::class,
]);
$this->assertEquals($expectedCommands, $passboltCommand->getPassboltCommandCollection());
}
}
```
|
Usman Ullah Khan (29 September 1974 – 20 February 2020) was a Pakistani boxer. He competed at the 1996 Summer Olympics and the 2000 Summer Olympics.
References
External links
1974 births
2020 deaths
Pakistani male boxers
Olympic boxers for Pakistan
Boxers at the 1996 Summer Olympics
Boxers at the 2000 Summer Olympics
People from Faisalabad
Asian Games medalists in boxing
Boxers at the 1994 Asian Games
Medalists at the 1994 Asian Games
Asian Games silver medalists for Pakistan
Sportspeople from Faisalabad
Welterweight boxers
20th-century Pakistani people
|
A stair is part of a flight of steps.
Stair may also refer to:
Places
Stair, Cumbria, England
Stair, East Ayrshire, Scotland
People
Randy Stair (1992–2017), perpetrator of the Eaton Township Weis Markets shooting
Sir Stair Agnew, (1831–1916), a Scottish public servant
James Dalrymple, 1st Viscount of Stair (1619–1695), Scottish lawyer and politician
John Dalrymple, 1st Earl of Stair (1648–1707), son of the previous
John Dalrymple, 2nd Earl of Stair (1673–1747), son of the previous
Other uses
The Stair Society, a learned society for the study of Scots Law, named for Viscount Stair
See also
Stairs (disambiguation)
House of Stairs (disambiguation)
Staircase (disambiguation)
Stairway (disambiguation)
Step (disambiguation)
|
```turing
#!./perl
# test added 29th April 1999 by Paul Johnson (pjcj@transeda.com)
# updated 28th May 1999 by Paul Johnson
my $File;
BEGIN {
$File = __FILE__;
require strict; strict->import();
}
use Test::More tests => 12;
use IO::File;
sub lineno
{
my ($f) = @_;
my $l;
$l .= "$. ";
$l .= $f->input_line_number;
$l .= " $."; # check $. before and after input_line_number
$l;
}
my $t;
open (F, '<', $File) or die $!;
my $io = IO::File->new($File) or die $!;
<F> for (1 .. 10);
is(lineno($io), "10 0 10");
$io->getline for (1 .. 5);
is(lineno($io), "5 5 5");
<F>;
is(lineno($io), "11 5 11");
$io->getline;
is(lineno($io), "6 6 6");
$t = tell F; # tell F; provokes a warning
is(lineno($io), "11 6 11");
<F>;
is(lineno($io), "12 6 12");
select F;
is(lineno($io), "12 6 12");
<F> for (1 .. 10);
is(lineno($io), "22 6 22");
$io->getline for (1 .. 5);
is(lineno($io), "11 11 11");
$t = tell F;
# We used to have problems here before local $. worked.
# input_line_number() used to use select and tell. When we did the
# same, that mechanism brise. It should work now.
is(lineno($io), "22 11 22");
{
local $.;
$io->getline for (1 .. 5);
is(lineno($io), "16 16 16");
}
is(lineno($io), "22 16 22");
```
|
Manitoba Provincial Road 207 (PR 207) is a provincial road in Manitoba, Canada. Much of PR 207 follows the historic Old Dawson Trail.
Route description
PR 207 begins at PR 213 (Garven Road), northeast of Winnipeg and heads south, intersecting PTH 15 and then the Trans-Canada Highway (PTH 1) at a junction known as Deacon's Corner. Five kilometres south of the Trans-Canada Highway, the road turns east and follows the old Dawson Road route to the communities of Lorette, Dufresne, and Ste. Anne. Approximately seven kilometres west of Richer, PR 207 turns north and ends at the Trans-Canada Highway.
PR 207 is a paved, two-lane road, except between Dufresne and Ste. Anne, where it is a gravel road. The road has a speed limit of 90 km/h.
The Dawson Road segment of PR 207 between Lorette and Ste. Anne was the original course for PTH 12. A more direct route for PTH 12 was later built to the north; this route is now PTH 1.
See also
Old Dawson Trail
External links
Official Manitoba Highway Map
207
|
```smalltalk
//
// GKPrimitives.cs
//
// Authors:
// Alex Soto <alexsoto@microsoft.com>
//
//
#nullable enable
using System;
using System.Runtime.InteropServices;
using ObjCRuntime;
#if NET
using Vector2 = global::System.Numerics.Vector2;
using Vector3 = global::System.Numerics.Vector3;
#else
using Vector2 = global::OpenTK.Vector2;
using Vector3 = global::OpenTK.Vector3;
#endif
namespace GameplayKit {
#if NET
[SupportedOSPlatform ("ios")]
[SupportedOSPlatform ("tvos")]
[SupportedOSPlatform ("macos")]
[SupportedOSPlatform ("maccatalyst")]
#endif
[StructLayout (LayoutKind.Sequential)]
public struct GKBox {
public Vector3 Min;
public Vector3 Max;
}
#if NET
[SupportedOSPlatform ("ios")]
[SupportedOSPlatform ("tvos")]
[SupportedOSPlatform ("macos")]
[SupportedOSPlatform ("maccatalyst")]
#endif
[StructLayout (LayoutKind.Sequential)]
public struct GKQuad {
public Vector2 Min;
public Vector2 Max;
}
#if NET
[SupportedOSPlatform ("ios")]
[SupportedOSPlatform ("tvos")]
[SupportedOSPlatform ("macos")]
[SupportedOSPlatform ("maccatalyst")]
#endif
[StructLayout (LayoutKind.Sequential)]
public struct GKTriangle {
Vector3 point1;
Vector3 point2;
Vector3 point3;
public Vector3 [] Points {
get {
return new Vector3 [] { point1, point2, point3 };
}
set {
if (value is null)
ObjCRuntime.ThrowHelper.ThrowArgumentNullException (nameof (value));
if (value.Length != 3)
throw new ArgumentOutOfRangeException (nameof (value), "The length of the Value array must be 3");
point1 = value [0];
point2 = value [1];
point3 = value [2];
}
}
}
}
```
|
```c
/* $OpenBSD: tests.c,v 1.10 2023/01/06 02:59:50 djm Exp $ */
/*
* Regress test for misc helper functions.
*
* Placed in the public domain.
*/
#include <sys/types.h>
#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include "test_helper.h"
#include "log.h"
#include "misc.h"
void test_parse(void);
void test_convtime(void);
void test_expand(void);
void test_argv(void);
void test_strdelim(void);
void test_hpdelim(void);
void test_ptimeout(void);
void
tests(void)
{
test_parse();
test_convtime();
test_expand();
test_argv();
test_strdelim();
test_hpdelim();
test_ptimeout();
}
```
|
```scheme
(define-library (srfi-116)
(import (scheme base))
(export iq)
(export ipair ilist xipair ipair* make-ilist ilist-copy ilist-tabulate iiota)
(export ipair?)
(export proper-ilist? ilist? dotted-ilist? not-ipair? null-ilist? ilist=)
(export icar icdr ilist-ref)
(export ifirst isecond ithird ifourth ififth isixth iseventh ieighth ininth itenth)
(export icaar icadr icdar icddr)
(export icaaar icaadr icadar icaddr icdaar icdadr icddar icdddr)
(export icaaaar icaaadr icaadar icaaddr icadaar icadadr icaddar icadddr)
(export icdaaar icdaadr icdadar icdaddr icddaar icddadr icdddar icddddr)
(export icar+icdr itake idrop ilist-tail)
(export itake-right idrop-right isplit-at ilast last-ipair)
(export ilength iappend iconcatenate ireverse iappend-reverse)
(export izip iunzip1 iunzip2 iunzip3 iunzip4 iunzip5)
(export icount imap ifor-each ifold iunfold ipair-fold ireduce )
(export ifold-right iunfold-right ipair-fold-right ireduce-right )
(export iappend-map ipair-for-each ifilter-map imap-in-order)
(export ifilter ipartition iremove imember imemq imemv)
(export ifind ifind-tail iany ievery)
(export ilist-index itake-while idrop-while ispan ibreak)
(export idelete idelete-duplicates )
(export iassoc iassq iassv ialist-cons ialist-delete)
(export replace-icar replace-icdr)
(export pair->ipair ipair->pair list->ilist ilist->list)
(export tree->itree itree->tree gtree->itree gtree->tree)
(export iapply)
(include "ilists-base.scm")
(include "ilists-impl.scm")
)
```
|
Lieutenant General Per-Ove Poul Ljung (18 May 1918 – 31 May 1997) was a Swedish Army officer. His senior commands include Chief of the Army Staff and the General Staff Corps, Master-General of the Ordnance, head of the Royal Swedish Army Materiel Administration, military commander of the Eastern Military District (Milo Ö) and Commandant General in Stockholm. Ljung retired from the military in 1974 and then served as Director General of the Defence Materiel Administration from 1974 to 1982.
Early life
Ljung was born on 18 May 1918 in Jönköping, Sweden, the son of Per Ljung, an accountant, and his wife Martha (née Jensen). He passed studentexamen in 1937.
Career
Military career
Ljung was commissioned as an officer in 1939. He belonged to an officer course, which, due to the increasingly threatening world political situation, had a dramatic shortening of their education in order to join units and strengthen the Swedish preparedness. Ljung was commissioned into the Jönköping-Kalmar Regiment (I 12) in Eksjö as second lieutenant in 1940 and then attended the Swedish School of Sport and Health Sciences in 1942 and was promoted to lieutenant the same year. During the following years he held alternately troop, staff and teaching positions. Ljung attended the Royal Swedish Army Staff College in 1948 and was promoted to captain the same year. Ljung then served in the General Staff Corps in 1950 and in 1955 he served as captain in the Northern Scanian Infantry Regiment (I 6) in Kristianstad. He was promoted to major in 1957 and served again in the General Staff Corps and as chief of staff of the I Military District in Kristianstad. In 1959 Ljung attended the Swedish National Defence College and in 1960 he was appointed head of the Organization Department of the Army Staff. A year later he was promoted to lieutenant colonel. In 1963 he was promoted to colonel and was appointed head of Section I of the Army Staff.
Ljung was appointed commanding officer of the Life Regiment Grenadiers (I 3) in 1964 and in 1966 he was promoted to major general and appointed Chief of the Army Staff and the General Staff Corps. He was also from 1966 serving as the Master-General of the Ordnance and acting head of the Royal Swedish Army Materiel Administration. Ljung was appointed head of the Army Materiel Administration (Armématerielförvaltningen, FMV-A) at the Defence Materiel Administration in 1968, a position he held for one year before being appointed military commander of the Eastern Military District (Milo Ö) and Commandant General in Stockholm. Ljung held this post until 1974 when he retired from the military and was appointed Director General of the Defence Materiel Administration. He served as Director General until 1982.
Other work
Ljung was a member of the board of the Central Federation for Voluntary Military Training (Centralförbundet för befälsutbildning) and the National Board of the Swedish Women's Voluntary Defence Organization (Lottaöverstyrelsen). He was also a member of the Administration Board of the Swedish Armed Forces and the board of the Swedish National Defence Research Institute from 1966 to 1968. Ljung was chairman of the Central Joint Consultation Board of the Swedish Armed Forces (Försvarets centrala företagsnämnd) from 1968 to 1974 and a member of the board of the Idun Society (Sällskapet Idun) from 1968 to 1990 and chairman of the same from 1981 to 1990.
Ljugn was a member of the State Administration's Central Cooperation Council for Human Resources (Statsförvaltningens centrala samarbetsråd för personalfrågor) from 1969 to 1974 and of the Industrial Council of the Royal Swedish Academy of Engineering Sciences from 1974. He was a member of the board of the Home Guard Fund (Hemvärnsfonden) from 1975 and vice chairman of the National Swedish Board of Economic Defence from 1975 to 1977. Ljung was a member of the board of the County Council's Fund for Technology Procurement and Product Development (Landstingets fond för teknikupphandling och produktutveckling) from 1982.
Personal life
In 1942 he married Inga-Maj Sjöholm (born 1918), the daughter of Ture Sjöholm and Gerda (née von Porat). He was the father of Per (born 1943) and Anders (born 1948).
Dates of rank
1940 – Second lieutenant
1942 – Lieutenant
1948 – Captain
1957 – Major
1961 – Lieutenant colonel
1963 – Colonel
1966 – Major general
1969 – Lieutenant general
Awards and decorations
Swedish
Commander of the Order of the Sword (6 June 1966)
Knight of the Order of the Sword
Swedish Women's Voluntary Defence Organization Royal Medal of Merit in silver
Foreign
Grand Cross of the Order of St. Olav (1 July 1979)
Honours
Member of the Royal Swedish Academy of War Sciences in 1964, (president 1975–1977)
Member of the Royal Swedish Academy of Engineering Sciences in 1979, (chairman of Department XI 1982–1985)
Honorary member of the Royal Swedish Society of Naval Sciences in 1975
References
Further reading
Ove Ljung's obituary 1
Ove Ljung's obituary 2
1918 births
1997 deaths
Swedish Army lieutenant generals
People from Jönköping
Members of the Royal Swedish Academy of War Sciences
Members of the Royal Swedish Academy of Engineering Sciences
Members of the Royal Swedish Society of Naval Sciences
Knights of the Order of the Sword
|
The Salinas monjita (Neoxolmis salinarum) is a species of bird in the tyrant flycatchers family Tyrannidae which is endemic to Argentina. It is threatened by habitat loss.
Taxonomy
This species was formerly placed in the genus Xolmis. Following the publication of a molecular phylogenetic study in 2020, it was one of three species moved to Neoxolmis.
References
Neoxolmis
Birds of Argentina
Endemic birds of Argentina
Birds described in 1979
Taxonomy articles created by Polbot
Taxobox binomials not recognized by IUCN
|
David B. Fogel (born February 2, 1964) is a pioneer in evolutionary computation.
Fogel received his Ph.D. in engineering from the University of California, San Diego in 1992. He is currently Chief Scientist at Trials.ai, and holds other founding positions at Natural Selection, Inc., Color Butler, Inc., and Effect Technologies, Inc., the maker of the patented EffectCheck sentiment analysis software tool. He has advised several AI companies in the areas of B2B lead generation, logistics, and employee retention, as well as other areas.
He received an honorary doctorate for his artificial intelligence research project, Blondie24, in which a deep learning adversarial neural network evolved itself into an expert checkers player. In further research, Fogel's Blondie25 evolutionary chess playing program earned wins over Fritz 8 (the fifth-ranked computer chess program in the world at the time) and was the first machine learning chess program to defeat a nationally ranked human master (James Quon).
Fogel co-founded Natural Selection, Inc. in 1993, and has worked on numerous successful applications of artificial intelligence. He served as Natural Selection, Inc.'s lead consultant for Agouron Pharmaceuticals' AGDOCK (formerly EPDOCK) protein-ligand docking software (1993-1998), was principal investigator on evolutionary neural networks for breast cancer detection (1995-2000), cybersecurity for a federal agency (early 2000s), and lead program manager for Natural Selection, Inc.'s machine learning system for screening food imports for the Food and Drug Administration (FDA) (2003-2008). The latter development was fielded nationwide as part of the FDA's PREDICT screening system and Natural Selection, Inc. received an honor award from the FDA in 2010 for its efforts. The IEEE Computational Intelligence Society recognized Natural Selection, Inc. with its inaugural Outstanding Organization Award in 2011. Fogel also led the development of evolutionary systematic market trading algorithms that were the foundation of Natural Selection Financial, Inc. (NSFIN), a registered investment advisor company, formed in 2006. NSFIN's intellectual property was acquired in 2008 by a hedge fund group.
Fogel's publications have been cited over 30,000 times. His h-index of 63 places him in the top 250 of computer scientists all time by that metric.
Fogel founded the Evolutionary Programming Society in 1991 and served as the founding chairman of the Evolutionary Programming Conference in 1992. He served as chairman again in 1993. The conference ran through 1998, with proceedings published by World Scientific, MIT Press, and Springer, whereupon it merged with the IEEE Conference on Evolutionary Computation and the IEE GALESIA conference to become the Congress on Evolutionary Computation, first held in 1999. (This later became the IEEE Congress on Evolutionary Computation.) In 1996, he was appointed the founding editor-in-chief of the IEEE Transactions on Evolutionary Computation, Following the passing of Prof. Michael Conrad, Fogel became the editor-in-chief of BioSystems in 2000,. He also served as general chairman for the 2002 IEEE World Congress on Computational Intelligence. and founded the IEEE Computational Intelligence Society's Symposium Series on Computational Intelligence in 2007. He is the author of 9 books and over 200 publications in evolutionary computing and neural networks. Fogel was president of the IEEE Computational Intelligence Society in 2008–2009. Fogel has given hundreds of public lectures at conferences, museums, and for corporate events regarding diverse aspects of AI, including the prospects of how it will be used to benefit humanity in the future.
In 2017, David Fogel began curating AI, science, and technology news on his website.
Scientific honors
2003 - Computational Intelligence Pioneer Award, SPIE
2004 - IEEE Kiyo Tomiyasu Award
2008 - IEEE Fellow
2008 - Evolutionary Computation Pioneer Award, IEEE Computational Intelligence Society
2008 - Honorary doctorate, University of Pretoria, South Africa
2009 - Top 100 most influential alumni from UC San Diego
2012 - CajAstur Prize in Soft Computing
2019 - Top 100 AI Researchers in Drug Design and Advanced Healthcare
Music
David Fogel is also an award-winning composer, creating the original orchestral score for Path of Totality: Eclipse 2017 (Music: David Fogel, Cinematography: Joe Woolbright, Sound Engineering: Gary Gray, Peter Sprague, and David Fogel), which received a 2018 Telly Award for Use of Music. Fogel released his first jazz EP, "Brighter Nights," on Spotify and other streaming services in 2018. In 2019, Fogel composed the score for Dream of a Childhood Sun, collaborating with Gary Gray (producer), which featured NASA footage of the sun and played in planetariums in the US, receiving a 2019 Telly Award for Use of Music as well as a Davey Award. He also released his first jazz LP, "Back in the Groove," on major streaming services in August 2019. Fogel created a new form of symphonic composition called a "Symphonina," a complete multi-movement symphony performed in about 10 minutes and co-founded the non-profit Symphonina Foundation with Gary Gray to promote symphonic music to younger audiences. Several of his symphonic compositions are available streaming online.
References
American computer scientists
Artificial intelligence researchers
1964 births
Living people
Fellow Members of the IEEE
University of California, San Diego alumni
|
Carlisle is an unincorporated community in Claiborne County, Mississippi, United States.
The Bayou Pierre, a tributary to the Mississippi River, flows north of the community.
Carlisle is located on the former Natchez, Jackson and Columbus Railroad, completed in 1882. Known locally as "The Little J", the line ran between Jackson and Natchez, and had various owners, including the Illinois Central Railroad, which abandoned it between 1979 and 1981.
Carlisle was once home to a cotton gin and school. Two general stores were also located in Carlisle.
A post office first began operation under the name Carlisle in 1884.
Education
Carlisle is served by the Claiborne County School District.
Notable people
Ephren Taylor, self-made teen millionaire; accused by U.S. Securities and Exchange Commission in 2012 of running an $11 million Ponzi scheme aimed at African-American churchgoers.
References
Unincorporated communities in Claiborne County, Mississippi
Unincorporated communities in Mississippi
|
```xml
import * as path from 'path';
import { runTests } from 'vscode-test';
async function main() {
try {
// The folder containing the Extension Manifest package.json
// Passed to `--extensionDevelopmentPath`
const extensionDevelopmentPath = path.resolve(__dirname, '../../');
// The path to test runner
// Passed to --extensionTestsPath
const extensionTestsPath = path.resolve(__dirname, './suite/index');
// Download VS Code, unzip it and run the integration test
await runTests({ extensionDevelopmentPath, extensionTestsPath });
} catch (err) {
console.error('Failed to run tests');
process.exit(1);
}
}
main();
```
|
```javascript
Computed property names in object literals
Template Strings
ES6 Arrow Functions
Rest parameters
Maps and Sets in ES6
```
|
```c++
/*******************************************************************************
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*******************************************************************************/
#ifndef GPU_INTEL_JIT_EMULATION_HPP
#define GPU_INTEL_JIT_EMULATION_HPP
#include <exception>
namespace dnnl {
namespace impl {
namespace gpu {
namespace intel {
namespace jit {
struct EmulationStrategy {
// Emulate 64-bit arithmetic (required for GenXLP)
bool emulate64 = false;
// Emulate DW x DW -> DW multiplication (required for Gen12)
bool emulateDWxDW = false;
// Use 32-bit adds for 64-bit arithmetic, assuming no 2^32 boundaries crossed.
bool emulate64_add32 = false;
// Emulate DW x DW -> QW multiplication (XeHPC)
bool emulate64_mul = false;
// Emulate QW and/or/xor operations (XeHPC)
bool emulate64_logic = false;
// Don't emulate QW shl/shr (XeHPC)
bool noemulate64_shift = false;
EmulationStrategy() = default;
EmulationStrategy(ngen::HW hw_, int stepping = 0) {
using namespace ngen;
if (hw_ == HW::Gen11) emulate64 = true;
if (hw_ >= HW::Gen11) emulateDWxDW = true;
if (hw_ == HW::Gen12LP) emulate64 = true;
if (hw_ == HW::XeHPG) emulate64 = true;
if (hw_ >= HW::XeHPC) {
if (hw_ == HW::XeHPC && stepping < SteppingPVCXTB0)
emulate64 = noemulate64_shift = true;
else
emulate64_mul = emulate64_logic = true;
}
emulate64_mul |= emulate64;
}
};
struct EmulationState {
ngen::GRF temp[2]; // Temporary GRFs for use in emulation sequences
ngen::FlagRegister
flag; // Flag register for use in emulating 64-bit adds (optional, avoids temporary registers/acc)
int flagOffset = 0; // Channel offset to use with flag register.
};
// Implementation wrapped as static methods in non-instantiated class.
// Clients should declare EmulationImplementation as a friend.
struct EmulationImplementation {
[[noreturn]] static void stub() {
throw std::runtime_error("Unimplemented");
}
template <typename DT, typename O>
static void applyDefaultType(O &op) {
using namespace ngen;
if (op.getType() == DataType::invalid) op.setType(getDataType<DT>());
}
template <typename O>
static bool isQW(const O &op) {
using namespace ngen;
return utils::one_of(op.getType(), DataType::q, DataType::uq);
}
template <typename O>
static bool isDW(const O &op) {
using namespace ngen;
return utils::one_of(op.getType(), DataType::d, DataType::ud);
}
template <typename O>
static bool isW(const O &op) {
using namespace ngen;
return utils::one_of(op.getType(), DataType::w, DataType::uw);
}
static bool isDW(const ngen::Immediate &op) {
using namespace ngen;
if (op.getType() == DataType::w)
return int16_t(static_cast<uint64_t>(op)) < 0;
else
return utils::one_of(op.getType(), DataType::d, DataType::ud);
}
template <typename O>
static O expandDW(const O &op) {
return op;
}
static ngen::Immediate expandDW(const ngen::Immediate &op) {
return op.forceInt32();
}
template <typename T1, typename T2>
static bool equal(const T1 &o1, const T2 &o2) {
return o1 == o2;
}
static bool equal(const ngen::RegData &o1, const ngen::Immediate &o2) {
return false;
}
static void downgradeToDW(ngen::RegData &op) {
using namespace ngen;
if (isQW(op)) {
op.setType(
(op.getType() == DataType::q) ? DataType::d : DataType::ud);
op.setOffset(op.getOffset() * 2);
}
}
static void downgradeToDW(ngen::Immediate &op) {
using namespace ngen;
if (isQW(op))
op.setType(
(op.getType() == DataType::q) ? DataType::d : DataType::ud);
}
// Get the DW equivalent of a QW region.
static void makeDWPair(ngen::RegData &op, int esize) {
if (isQW(op)) {
downgradeToDW(op);
if (op.getHS() > 1) {
if (op.getVS() != op.getHS() * op.getWidth()) stub();
op.setRegion(op.getHS() * 2, 2, 1);
} else {
auto newVS = op.getVS() * 2;
if (esize == op.getWidth()) newVS = esize * 2;
op.setRegion(newVS, op.getWidth() * 2, 1);
}
}
}
// Split a register into DW pairs.
static void splitToDW(
ngen::RegData in, ngen::RegData &outLo, ngen::RegData &outHi) {
using namespace ngen;
bool isQ = (in.getType() == DataType::q);
bool isUQ = (in.getType() == DataType::uq);
if (isQ || isUQ) {
outLo = in;
outLo.setRegion(in.getVS() * 2, in.getWidth(), in.getHS() * 2);
outLo.setOffset(in.getOffset() * 2);
outLo.setType(DataType::ud);
outHi = outLo;
outHi.setOffset(in.getOffset() * 2 + 1);
outHi.setType(isQ ? DataType::d : DataType::ud);
} else {
outLo = in;
outHi = Subregister {}; // invalid
}
}
// Split an ngen::Immediate into DW pairs.
static void splitToDW(const ngen::Immediate &in, ngen::Immediate &outLo,
ngen::Immediate &outHi) {
using namespace ngen;
bool isQ = (in.getType() == DataType::q);
bool isUQ = (in.getType() == DataType::uq);
if (isQ || isUQ) {
outLo = uint32_t(static_cast<uint64_t>(in));
outLo.setType(DataType::ud);
outHi = uint32_t(static_cast<uint64_t>(in) >> 32);
outHi.setType(isQ ? DataType::d : DataType::ud);
} else {
outLo = in;
outHi = uint16_t(0);
}
}
static ngen::RegData lowWord(ngen::RegData in) {
using namespace ngen;
if (isW(in)) return in;
auto outLo = in;
outLo.setRegion(in.getVS() * 2, in.getWidth(), in.getHS() * 2);
outLo.setOffset(in.getOffset() * 2);
outLo.setType(DataType::uw);
return outLo;
}
static ngen::Immediate lowWord(const ngen::Immediate &in) {
return uint16_t(static_cast<uint64_t>(in) & 0xffff);
}
static ngen::RegData highWord(ngen::RegData in) {
auto out = lowWord(in);
out.setOffset(out.getOffset() + 1);
return out;
}
static ngen::Immediate highWord(const ngen::Immediate &in) {
return uint16_t(static_cast<uint64_t>(in) >> 16);
}
static bool isUnitStride(const ngen::RegData &rd) {
return (rd.getHS() == 1 && rd.getVS() == rd.getWidth());
}
static void regionVSAdvance(ngen::HW hw, ngen::RegData &rd, int i) {
int ne = ngen::GRF::bytes(hw) / rd.getBytes();
int advance = rd.getWidth() > 0 ? (i / rd.getWidth()) * rd.getVS()
: i * rd.getHS();
int noffset = rd.getOffset() + advance;
if (noffset >= ne) {
noffset--;
rd.setBase(rd.getBase() + 1);
}
rd.setOffset(noffset);
}
static void regionVSAdvance(ngen::HW hw, ngen::Immediate &imm, int i) {}
// Move, emulating 64-bit moves with 32-bit (generally a good idea).
template <typename DT = void, typename Generator>
static void emov(Generator &g, const ngen::InstructionModifier &mod,
ngen::RegData dst, ngen::RegData src0,
const EmulationStrategy &strategy) {
using namespace ngen;
applyDefaultType<DT>(dst);
applyDefaultType<DT>(src0);
bool dstQ = isQW(dst);
bool s0Q = isQW(src0);
bool s0D = isDW(src0);
bool isDF = (src0.getType() == DataType::df
&& dst.getType() == DataType::df);
bool unaligned = (mod.getExecSize() > 1 && src0.getHS() != 0
&& src0.getOffset() != dst.getOffset());
if ((dstQ && s0D) && strategy.emulate64) {
if (src0.getNeg()) stub();
bool s0Signed = isSigned(src0.getType());
RegData dstHi, dstLo;
splitToDW(dst, dstLo, dstHi);
g.mov(mod, dstLo, src0);
if (!s0Signed)
g.mov(mod, dstHi, 0);
else
g.asr(mod, dstHi, dstLo, uint16_t(31));
} else if (((dstQ || s0Q) && strategy.emulate64)
|| (isDF && unaligned && g.hardware >= ngen::HW::XeHP)) {
if (dstQ != s0Q) stub();
auto mod2x = mod;
mod2x.setExecSize(mod.getExecSize() * 2);
makeDWPair(dst, mod.getExecSize());
makeDWPair(src0, mod.getExecSize());
g.mov(mod2x, dst, src0);
} else if (dst.getType() == DataType::f
&& src0.getType() == DataType::bf
&& (src0.getHS() != 1 || mod.getExecSize() == 1)) {
// Emulate bf16->f32 upconversion
dst.setType(DataType::ud);
src0.setType(DataType::uw);
g.shl(mod, dst, src0, 16);
} else
g.mov(mod, dst, src0);
}
template <typename DT = void, typename Generator>
static void emov(Generator &g, const ngen::InstructionModifier &mod,
ngen::RegData dst, ngen::Immediate src0,
const EmulationStrategy &strategy) {
using namespace ngen;
applyDefaultType<DT>(dst);
applyDefaultType<DT>(src0);
bool dstQ = isQW(dst);
bool s0Q = isQW(src0);
if ((dstQ || s0Q) && strategy.emulate64) {
if (!dstQ) stub();
RegData dstHi, dstLo;
Immediate s0Hi = 0, s0Lo = 0;
splitToDW(src0, s0Lo, s0Hi);
if (static_cast<uint64_t>(s0Lo) == static_cast<uint64_t>(s0Hi)
&& dst.getHS() <= 1) {
auto mod2x = mod;
mod2x.setExecSize(mod.getExecSize() * 2);
downgradeToDW(dst);
dst.setRegion(0, 0, 1);
g.mov(mod2x, dst, s0Lo);
} else {
splitToDW(dst, dstLo, dstHi);
g.mov(mod, dstLo, s0Lo);
g.mov(mod, dstHi, s0Hi);
}
} else
g.mov(mod, dst, src0);
}
template <typename Generator>
static void eaddSignExtend1(Generator &g,
const ngen::InstructionModifier &mod, bool &doSub,
const ngen::Immediate &src1, ngen::Immediate &s1LoPos,
const ngen::Immediate &s1Lo, const ngen::Immediate &s1Hi, bool &s1Q,
const ngen::GRF (&temp)[2]) {
using namespace ngen;
uint64_t raw = static_cast<uint64_t>(src1);
if (src1.getType() == DataType::d) {
auto val = int32_t(raw);
s1LoPos = uint32_t(std::abs(val));
doSub = (val < 0);
} else if (src1.getType() == DataType::w) {
auto val = int16_t(raw);
s1LoPos = uint16_t(std::abs(val));
doSub = (val < 0);
}
}
template <typename Generator>
static void eaddSignExtend1(Generator &g,
const ngen::InstructionModifier &mod, bool &doSub,
const ngen::RegData &src1, ngen::RegData &s1LoPos,
ngen::RegData &s1Lo, ngen::RegData &s1Hi, bool &s1Q,
const ngen::GRF (&temp)[2]) {
using namespace ngen;
s1Q = true;
s1Hi = temp[0].d();
if (s1Lo.getNeg()) {
g.asr(mod, s1Hi, -s1Lo, uint16_t(31));
s1Hi = -s1Hi;
} else
g.asr(mod, s1Hi, s1Lo, uint16_t(31));
s1Lo.setType(DataType::ud);
}
static void eaddHandleS1Neg(
bool &doSub, ngen::RegData &s1LoPos, const ngen::RegData &s1Lo) {
if (isSigned(s1Lo.getType())) stub();
doSub = s1Lo.getNeg();
s1LoPos = -s1Lo;
}
static void eaddHandleS1Neg(bool &doSub, const ngen::Immediate &s1LoPos,
const ngen::Immediate &s1Lo) {
/* no-op */
}
template <typename Generator>
static void eaddFixupQD(Generator &g, const ngen::InstructionModifier &mod,
const ngen::FlagRegister &flag, const ngen::RegData &dstHi,
const ngen::RegData &src1) {
if ((src1.getBytes() < 8) && isSigned(src1.getType())) {
// Add sign extension of src1 to high 32 bits of dst (inefficient but rarely used path).
g.cmp(mod | (src1.getNeg() ? g.le : g.lt) | flag, src1, 0);
g.add(mod | flag, dstHi, dstHi, -1);
}
}
template <typename Generator>
static void eaddFixupQD(Generator &g, const ngen::InstructionModifier &mod,
const ngen::FlagRegister &flag, const ngen::RegData &dstHi,
const ngen::Immediate &src1) {
/* no-op */
}
static bool eaddIsNegative(const ngen::RegData &r) { return r.getNeg(); }
static bool eaddIsNegative(const ngen::Immediate &i) {
return int32_t(uint64_t(i)) < 0;
}
// Integer addition, emulating 64-bit arithmetic if configured.
template <typename DT = void, typename S1, typename Generator>
static void eaddInternal(Generator &g, const ngen::InstructionModifier &mod,
ngen::RegData dst, ngen::RegData src0, S1 src1,
const EmulationStrategy &strategy, const EmulationState &state) {
using namespace ngen;
const auto &temp = state.temp;
applyDefaultType<DT>(dst);
applyDefaultType<DT>(src0);
applyDefaultType<DT>(src1);
bool dstQ = isQW(dst);
bool s0Q = isQW(src0);
bool s1Q = isQW(src1);
if (dstQ && strategy.emulate64_add32) {
RegData dstHi, dstLo, s0Hi, s0Lo;
S1 s1Hi, s1Lo;
splitToDW(dst, dstLo, dstHi);
splitToDW(src0, s0Lo, s0Hi);
splitToDW(src1, s1Lo, s1Hi);
g.add(mod, dstLo, s0Lo, s1Lo);
if (s0Q && s1Q) {
if (!equal(dstHi, s0Hi) && !equal(dstHi, s1Hi))
g.add(mod, dstHi, s0Hi, s1Hi);
} else if (s0Q) {
if (!equal(dstHi, s0Hi)) g.mov(mod, dstHi, s0Hi);
} else if (s1Q) {
if (!equal(dstHi, s1Hi)) g.mov(mod, dstHi, s1Hi);
} else
g.mov(mod, dstHi, uint16_t(0));
} else if (!strategy.emulate64)
g.add(mod, dst, src0, src1);
else {
if (!dstQ) {
downgradeToDW(src0);
downgradeToDW(src1);
g.add(mod, dst, src0, src1);
} else {
RegData dstHi, dstLo, s0Hi, s0Lo;
S1 s1Hi, s1Lo, s1LoPos;
FlagRegister flag = state.flag;
splitToDW(dst, dstLo, dstHi);
splitToDW(src0, s0Lo, s0Hi);
splitToDW(src1, s1Lo, s1Hi);
s1LoPos = s1Lo;
bool s0Signed = isSigned(s0Lo.getType());
bool s1Signed = isSigned(s1Lo.getType());
if (flag.isValid() && !eaddIsNegative(s0Lo)) {
// Use flag register + ov.
auto Mx = g.ExecutionOffset(state.flagOffset);
bool neg = eaddIsNegative(s1Lo);
bool revFlag = false;
auto s0LoUD = s0Lo;
auto s1LoMod = s1Lo;
s0LoUD.setType(DataType::ud);
if (s1Signed
&& !std::is_base_of<ngen::Immediate, S1>::value) {
s1LoMod.setType(DataType::ud);
revFlag = neg;
neg = false;
}
g.add(mod | Mx | g.ov | flag, dstLo, s0LoUD, s1LoMod);
if (s0Q && s1Q)
g.add(mod, dstHi, s0Hi, s1Hi);
else if (s0Q && !equal(dstHi, s0Hi))
g.mov(mod, dstHi, s0Hi);
else if (s1Q && !equal(dstHi, s1Hi))
g.mov(mod, dstHi, s1Hi);
else if (!s0Q && !s1Q)
g.mov(mod, dstHi, 0);
g.add(mod | Mx | (revFlag ? ~flag : flag), dstHi, dstHi,
neg ? -1 : +1);
eaddFixupQD(g, mod | Mx, flag, dstHi, src0);
eaddFixupQD(g, mod | Mx, flag, dstHi, src1);
} else {
// Slow path: addc/subb + acc.
RegData carry = temp[0].ud();
bool lateCarry = false;
RegData subDstLo;
bool doSub = false;
// For :uq + :d or :q + :ud, sign extend 32-bit input to 64 bits.
if (s0Signed != s1Signed) {
if (s0Signed) {
s0Q = true;
s0Hi = temp[0].d();
g.asr(mod, s0Hi, s0Lo, uint16_t(31));
s0Lo.setType(DataType::ud);
if (s0Lo.getNeg()) s0Hi = -s0Hi;
} else
eaddSignExtend1(g, mod, doSub, src1, s1LoPos, s1Lo,
s1Hi, s1Q, temp);
carry = temp[1].ud();
lateCarry = true;
}
// Handle modifiers.
if (s0Lo.getNeg()) stub();
eaddHandleS1Neg(doSub, s1LoPos, s1Lo);
// Compute low 32 bits, saving carry/borrow.
if (dstLo.getOffset() != 0) {
doSub ? g.subb(mod, g.null.retype(s0Lo.getType()), s0Lo,
s1LoPos)
: g.addc(mod, g.null.retype(s0Lo.getType()), s0Lo,
s1Lo);
g.add(mod, dstLo, s0Lo, s1Lo);
} else if ((mod.getExecSize() > 1)
&& !isUnitStride(dstLo)) {
subDstLo = temp[1].ud();
doSub ? g.subb(mod, subDstLo, s0Lo, s1LoPos)
: g.addc(mod, subDstLo, s0Lo, s1Lo);
} else {
doSub ? g.subb(mod, dstLo, s0Lo, s1LoPos)
: g.addc(mod, dstLo, s0Lo, s1Lo);
}
// Retrieve carry from accumulator, unless it conflicts with subDstLo.
if (!lateCarry) g.mov(mod, carry, g.acc0.ud());
// Move low 32-bits to final resting place, if needed.
if (subDstLo.isValid()) g.mov(mod, dstLo, subDstLo);
// Retrieve carry from accumulator once subDstLo isn't needed.
if (lateCarry) g.mov(mod, carry, g.acc0.ud());
if (doSub) carry = -carry;
// Compute high 32 bits of sum.
if (s0Q && s1Q) {
g.add(mod, dstHi, s0Hi, s1Hi);
g.add(mod, dstHi, carry, dstHi);
} else if (s0Q)
g.add(mod, dstHi, carry, s0Hi);
else if (s1Q)
g.add(mod, dstHi, carry, s1Hi);
else
g.mov(mod, dstHi, carry);
}
}
}
}
template <typename DT = void, typename Generator>
static void eadd(Generator &g, const ngen::InstructionModifier &mod,
const ngen::RegData &dst, const ngen::RegData &src0,
const ngen::RegData &src1, const EmulationStrategy &strategy,
const EmulationState &state) {
if (src0.getNeg() && !src1.getNeg() && strategy.emulate64
&& !strategy.emulate64_add32)
eaddInternal<DT>(g, mod, dst, src1, src0, strategy, state);
else
eaddInternal<DT>(g, mod, dst, src0, src1, strategy, state);
}
template <typename DT = void, typename Generator>
static void eadd(Generator &g, const ngen::InstructionModifier &mod,
const ngen::RegData &dst, const ngen::RegData &src0,
ngen::Immediate src1, const EmulationStrategy &strategy,
const EmulationState &state) {
eaddInternal<DT>(g, mod, dst, src0, src1, strategy, state);
}
// Integer multiplication, emulating 32x32 multiplication as configured.
template <typename DT = void, typename S1, typename Generator>
static void emulInternal(Generator &g, const ngen::InstructionModifier &mod,
ngen::RegData dst, ngen::RegData src0, S1 src1,
const EmulationStrategy &strategy, const EmulationState &state) {
using namespace ngen;
applyDefaultType<DT>(dst);
applyDefaultType<DT>(src0);
applyDefaultType<DT>(src1);
bool dstD = isDW(dst);
bool dstQ = isQW(dst);
bool s0W = isW(src0);
bool s0D = isDW(src0);
bool s0Q = isQW(src0);
bool s1W = isW(src1);
bool s1D = isDW(src1);
bool s1Q = isQW(src1);
bool s1Immed = std::is_base_of<ngen::Immediate, S1>::value;
bool s0Signed = isSigned(src0.getType());
bool s1Signed = isSigned(src1.getType());
auto mulHiType = (s0Signed || s1Signed) ? DataType::d : DataType::ud;
bool emulate64 = strategy.emulate64_mul;
if (s0Q || s1Q) {
stub();
} else if (dstQ && s0W && s1W) {
RegData dstLo, dstHi;
splitToDW(dst, dstLo, dstHi);
g.mul(mod, dstLo, src0, src1);
dstHi.setType(mulHiType);
dstLo.setType(mulHiType);
if (s0Signed || s1Signed)
g.asr(mod, dstHi, dstLo, 31);
else
g.mov(mod, dstHi, 0);
} else if (dstQ && s0W && s1D) {
stub();
} else if (dstQ && s0D
&& ((s1W && !s1Immed) || ((s1W || s1D) && emulate64))) {
RegData dstLo, dstHi;
splitToDW(dst, dstLo, dstHi);
auto acc = g.acc0.retype(mulHiType)[dstLo.getOffset()](
dstLo.getHS());
g.mul(mod, acc, src0, lowWord(src1));
if (s1D)
g.mach(mod, dstLo, src0, expandDW(src1));
else
g.mach(mod, dstLo, src0, int32_t(0));
g.mov(mod, dstHi, dstLo);
g.mov(mod, dstLo, acc);
} else if (dstD && s0D && s1D && strategy.emulateDWxDW) {
int ne1 = ngen::GRF::bytes(g.hardware) >> 2;
for (int r = 0; r < mod.getExecSize(); r += ne1) {
auto mmod = mod;
mmod.setExecSize(std::min(mod.getExecSize() - r, ne1));
auto acc = g.acc0.retype(mulHiType)[dst.getOffset()](
dst.getHS());
auto dummy = g.null.retype(mulHiType)[dst.getOffset()](
dst.getHS());
g.mul(mmod, acc, src0, lowWord(src1));
if (g.hardware < HW::Gen10) {
g.mach(mmod, dummy, src0, expandDW(src1));
g.mov(mmod, dst, acc);
} else {
g.macl(mmod, dst, src0, expandDW(src1));
}
regionVSAdvance(g.hardware, dst, ne1);
regionVSAdvance(g.hardware, src0, ne1);
regionVSAdvance(g.hardware, src1, ne1);
}
} else
g.mul(mod, dst, src0, src1);
}
template <typename DT = void, typename Generator>
static void emul(Generator &g, const ngen::InstructionModifier &mod,
const ngen::RegData &dst, const ngen::RegData &src0,
const ngen::RegData &src1, const EmulationStrategy &strategy,
const EmulationState &state) {
emulInternal<DT>(g, mod, dst, src0, src1, strategy, state);
}
template <typename DT = void, typename Generator>
static void emul(Generator &g, const ngen::InstructionModifier &mod,
const ngen::RegData &dst, const ngen::RegData &src0,
ngen::Immediate src1, const EmulationStrategy &strategy,
const EmulationState &state) {
emulInternal<DT>(g, mod, dst, src0, src1, strategy, state);
}
template <typename S1, typename Generator>
static void emul32High(Generator &g, const ngen::InstructionModifier &mod,
const ngen::RegData &dstHi, const ngen::RegData &src0,
const S1 &src1) {
g.mul(mod, g.acc0.ud(dstHi.getOffset()), src0, lowWord(src1));
g.mach(mod, dstHi, src0, src1);
}
// Shift left, emulating 64-bit arithmetic if configured.
template <typename DT = void, typename Generator>
static void eshl(Generator &g, const ngen::InstructionModifier &mod,
ngen::RegData dst, ngen::RegData src0, uint16_t src1,
const EmulationStrategy &strategy, const EmulationState &state) {
using namespace ngen;
const auto &temp = state.temp;
applyDefaultType<DT>(dst);
applyDefaultType<DT>(src0);
bool dstQ = isQW(dst);
bool s0Q = isQW(src0);
if (src1 == 0) {
emov<DT, Generator>(g, mod, dst, src0, strategy);
return;
}
if (dstQ && strategy.emulate64 && !strategy.noemulate64_shift) {
if (src1 >= 32) stub();
RegData dstHi, dstLo, s0Hi, s0Lo;
auto acc = temp[0].ud();
splitToDW(dst, dstLo, dstHi);
if (s0Q) {
splitToDW(dst, s0Lo, s0Hi);
g.shr(mod, acc, s0Lo, uint16_t(32 - src1));
g.shl(mod, dstHi, s0Hi, src1);
g.shl(mod, dstLo, s0Lo, src1);
g.or_(mod, dstHi, acc, dstHi);
} else {
dstHi.setType(DataType::ud);
g.shl(mod, dstLo, src0, src1);
g.shr(mod, dstHi, src0, uint16_t(32 - src1));
}
} else {
if (s0Q && !dstQ) downgradeToDW(src0);
g.shl(mod, dst, src0, src1);
}
}
// Shift right, emulating 64-bit arithmetic if configured.
template <typename DT = void, typename Generator>
static void eshr(Generator &g, const ngen::InstructionModifier &mod,
ngen::RegData dst, ngen::RegData src0, uint16_t src1,
const EmulationStrategy &strategy, const EmulationState &state) {
using namespace ngen;
const auto &temp = state.temp;
applyDefaultType<DT>(dst);
applyDefaultType<DT>(src0);
bool dstQ = isQW(dst);
bool s0Q = isQW(src0);
if (src1 == 0) {
emov<DT, Generator>(g, mod, dst, src0, strategy);
return;
}
if (dstQ && strategy.emulate64 && !strategy.noemulate64_shift) {
if (src1 >= 32) stub();
RegData dstHi, dstLo, s0Hi, s0Lo;
auto acc = temp[0].ud();
splitToDW(dst, dstLo, dstHi);
if (s0Q) {
splitToDW(dst, s0Lo, s0Hi);
g.shl(mod, acc, s0Lo, uint16_t(32 - src1));
g.shr(mod, dstLo, s0Lo, src1);
isSigned(src0.getType()) ? g.asr(mod, dstHi, s0Hi, src1)
: g.shr(mod, dstHi, s0Hi, src1);
g.or_(mod, dstLo, acc, dstLo);
} else {
dstLo.setType(dstHi.getType());
isSigned(src0.getType()) ? g.asr(mod, dstLo, src0, src1)
: g.shr(mod, dstLo, src0, src1);
g.mov(mod, dstHi, uint16_t(0));
}
} else {
if (s0Q && !dstQ) downgradeToDW(src0);
isSigned(src0.getType()) ? g.asr(mod, dst, src0, src1)
: g.shr(mod, dst, src0, src1);
}
}
// Multiply by a constant, optimizing for power-of-2 constants and emulating 64-bit arithmetic if configured.
template <typename DT = void, typename Generator>
static void emulConstant(Generator &g, const ngen::InstructionModifier &mod,
const ngen::RegData &dst, const ngen::RegData &src0, int32_t src1,
const EmulationStrategy &strategy, const EmulationState &state) {
if (src1 == 0)
emov<DT>(g, mod, dst, uint16_t(0), strategy);
else if (src1 == 1) {
if (dst != src0) emov<DT>(g, mod, dst, src0, strategy);
} else if (ngen::utils::is_zero_or_pow2(src1))
eshl<DT>(g, mod, dst, src0, uint16_t(ngen::utils::log2(src1)),
strategy, state);
else if (src1 > 0)
emul<DT>(g, mod, dst, src0, uint32_t(src1), strategy, state);
else
emul<DT>(g, mod, dst, src0, int32_t(src1), strategy, state);
}
}; // struct EmulationHelper
} // namespace jit
} // namespace intel
} // namespace gpu
} // namespace impl
} // namespace dnnl
#define EMULATION_FORWARD \
template <typename DT = void> \
void emov(const ngen::InstructionModifier &mod, ngen::RegData dst, \
ngen::RegData src0, const EmulationStrategy &strategy) { \
EmulationImplementation::emov<DT>(*this, mod, dst, src0, strategy); \
} \
template <typename DT = void> \
void emov(const ngen::InstructionModifier &mod, ngen::RegData dst, \
ngen::Immediate src0, const EmulationStrategy &strategy) { \
EmulationImplementation::emov<DT>(*this, mod, dst, src0, strategy); \
} \
template <typename DT = void> \
void eadd(const ngen::InstructionModifier &mod, const ngen::RegData &dst, \
const ngen::RegData &src0, const ngen::RegData &src1, \
const EmulationStrategy &strategy, const EmulationState &state) { \
EmulationImplementation::eadd<DT>( \
*this, mod, dst, src0, src1, strategy, state); \
} \
template <typename DT = void> \
void eadd(const ngen::InstructionModifier &mod, const ngen::RegData &dst, \
const ngen::RegData &src0, ngen::Immediate src1, \
const EmulationStrategy &strategy, const EmulationState &state) { \
EmulationImplementation::eadd<DT>( \
*this, mod, dst, src0, src1, strategy, state); \
} \
template <typename DT = void> \
void emul(const ngen::InstructionModifier &mod, const ngen::RegData &dst, \
const ngen::RegData &src0, const ngen::RegData &src1, \
const EmulationStrategy &strategy, const EmulationState &state) { \
EmulationImplementation::emul<DT>( \
*this, mod, dst, src0, src1, strategy, state); \
} \
template <typename DT = void> \
void emul(const ngen::InstructionModifier &mod, const ngen::RegData &dst, \
const ngen::RegData &src0, ngen::Immediate src1, \
const EmulationStrategy &strategy, const EmulationState &state) { \
EmulationImplementation::emul<DT>( \
*this, mod, dst, src0, src1, strategy, state); \
} \
template <typename DT = void> \
void eshl(const ngen::InstructionModifier &mod, ngen::RegData dst, \
ngen::RegData src0, uint16_t src1, \
const EmulationStrategy &strategy, const EmulationState &state) { \
EmulationImplementation::eshl<DT>( \
*this, mod, dst, src0, src1, strategy, state); \
} \
template <typename DT = void> \
void eshr(const ngen::InstructionModifier &mod, ngen::RegData dst, \
ngen::RegData src0, uint16_t src1, \
const EmulationStrategy &strategy, const EmulationState &state) { \
EmulationImplementation::eshr<DT>( \
*this, mod, dst, src0, src1, strategy, state); \
} \
template <typename DT = void> \
void emulConstant(const ngen::InstructionModifier &mod, \
const ngen::RegData &dst, const ngen::RegData &src0, int32_t src1, \
const EmulationStrategy &strategy, const EmulationState &state) { \
EmulationImplementation::emulConstant<DT>( \
*this, mod, dst, src0, src1, strategy, state); \
} \
template <typename S1> \
void emul32High(const ngen::InstructionModifier &mod, \
const ngen::RegData &dstHi, const ngen::RegData &src0, \
const S1 &src1) { \
EmulationImplementation::emul32High(*this, mod, dstHi, src0, src1); \
}
#endif
```
|
```java
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package com.weibo.api.motan.registry.support;
import com.weibo.api.motan.exception.MotanErrorMsgConstant;
import com.weibo.api.motan.exception.MotanFrameworkException;
import com.weibo.api.motan.registry.Registry;
import com.weibo.api.motan.registry.RegistryFactory;
import com.weibo.api.motan.rpc.URL;
import com.weibo.api.motan.runtime.GlobalRuntime;
import java.util.concurrent.ConcurrentHashMap;
import java.util.concurrent.locks.ReentrantLock;
/**
* Create and cache registry.
*
* @author fishermen
* @version V1.0 created at: 2013-5-28
*/
public abstract class AbstractRegistryFactory implements RegistryFactory {
private static final ConcurrentHashMap<String, Registry> registries = new ConcurrentHashMap<>();
private static final ReentrantLock lock = new ReentrantLock();
protected String getRegistryUri(URL url) {
return url.getUri();
}
@Override
public Registry getRegistry(URL url) {
String registryUri = getRegistryUri(url);
try {
lock.lock();
Registry registry = registries.get(registryUri);
if (registry != null) {
return registry;
}
registry = createRegistry(url);
if (registry == null) {
throw new MotanFrameworkException("Create registry false for url:" + url, MotanErrorMsgConstant.FRAMEWORK_INIT_ERROR);
}
registries.put(registryUri, registry);
GlobalRuntime.addRegistry(registryUri, registry);
return registry;
} catch (Exception e) {
throw new MotanFrameworkException("Create registry false for url:" + url, e, MotanErrorMsgConstant.FRAMEWORK_INIT_ERROR);
} finally {
lock.unlock();
}
}
protected abstract Registry createRegistry(URL url);
}
```
|
```objective-c
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
#ifndef COMMON_NAMES_H
#define COMMON_NAMES_H
#include <stdint.h>
// All names in system are stored as hashes (or maybe, for debug builds,
// as pointers to uniqued C strings containing names?).
// There are two types of hashes:
// - local hash, must be unique per class/scope (CityHash64 is being used)
// - global hash, must be unique globally (SHA1 is being used)
// Generic guideline is that global hash is being used in global persistent
// context, while local hashes are more local in scope.
// Local hash.
typedef int64_t LocalHash;
// Hash of field name.
typedef LocalHash FieldNameHash;
// Hash of open method name.
typedef LocalHash MethodNameHash;
// Global hash.
typedef struct {
uint8_t bits[20];
} GlobalHash;
// Hash of function name.
typedef GlobalHash FunctionNameHash;
// Hash of class name.
typedef GlobalHash ClassNameHash;
#ifdef __cplusplus
extern "C" {
#endif
// Make local hash out of arbitrary data.
void MakeLocalHash(const void* data, uint32_t size, LocalHash* hash);
// Make global hash out of arbitrary data.
void MakeGlobalHash(const void* data, uint32_t size, GlobalHash* hash);
// Make printable C string out of local hash.
void PrintableLocalHash(const LocalHash* hash, char* buffer, uint32_t size);
// Make printable C string out of global hash.
void PrintableGlobalHash(const GlobalHash* hash, char* buffer, uint32_t size);
#ifdef __cplusplus
} // extern "C"
#endif
#endif // COMMON_NAMES_H
```
|
```javascript
/**
* SnapshotController
*
* @description :: Server-side logic for managing snapshots
* @help :: See path_to_url#!/documentation/concepts/Controllers
*/
var _ = require("lodash");
var KongService = require('../services/KongService');
module.exports = _.merge(_.cloneDeep(require('../base/Controller')), {
listTags: function (req, res) {
sails.models.kongservices.find({
where: {
kong_node_id: req.connection.id
},
select: ['tags']
}, function (err, extras) {
if (err) return res.negotiate(err);
var tags = [];
extras.forEach(function (extra) {
if (extra.tags instanceof Array)
tags = tags.concat(extra.tags);
});
return res.json(_.uniq(tags));
})
},
consumers: async (req,res) => {
const serviceId = req.params.id;
let serviceAclPlugin;
let jwtPlugin;
let basicAuthPlugin;
let keyAuthPlugin;
let hmacAuthPlugin;
let oauth2Plugin;
sails.log("KongServiceController:consumers called");
let plugins = await KongService.fetch(`/services/${serviceId}/plugins?enabled=true`, req);
// Make sure only the enabled plugins are listed.
// Kong 1.x API stopped honoring the query string parameters for some reason,
// so ?enabled=true, makes no difference whatsoever.
// Putting this monkey patch here with the plan to remove it if Kong starts accepting query strings again.
plugins.data = _.filter(plugins.data, plugin => plugin.enabled);
plugins.total = plugins.data.length;
if(plugins.total == 0) return res.json([]);
sails.log("Service plugins =>", plugins);
serviceAclPlugin = _.filter(plugins.data, item => item.name === 'acl')[0];
jwtPlugin = _.filter(plugins.data, item => item.name === 'jwt')[0];
basicAuthPlugin = _.filter(plugins.data, item => item.name === 'basic-auth')[0];
keyAuthPlugin = _.filter(plugins.data, item => item.name === 'key-auth')[0];
hmacAuthPlugin = _.filter(plugins.data, item => item.name === 'hmac-auth')[0];
oauth2Plugin = _.filter(plugins.data, item => item.name === 'oauth2')[0];
sails.log("serviceAclPlugin",serviceAclPlugin)
sails.log("jwtPlugin",jwtPlugin)
sails.log("basicAuthPlugin",basicAuthPlugin)
sails.log("keyAuthPlugin",keyAuthPlugin)
sails.log("hmacAuthPlugin",hmacAuthPlugin)
sails.log("oauth2Plugin",oauth2Plugin)
let aclConsumerIds;
let authenticationPlugins = _.filter(plugins.data, item => ['jwt','basic-auth','key-auth','hmac-auth','oauth2'].indexOf(item.name) > -1);
authenticationPlugins = _.map(authenticationPlugins, item => item.name);
sails.log("authenticationPlugins",authenticationPlugins);
// This service is Access Controlled by ACL plugin
let whiteListedGroups = serviceAclPlugin ? serviceAclPlugin.config.whitelist || [] : [];
let blackListedGroups = serviceAclPlugin ? serviceAclPlugin.config.blacklist || [] : [];
// ACL
sails.log("whiteListedGroups",whiteListedGroups)
sails.log("blackListedGroups",blackListedGroups)
// We need to retrieve all acls and filter the accessible ones based on the whitelisted and blacklisted groups
let acls = await KongService.fetch(`/acls`, req);
let filteredAcls = _.filter(acls.data, item => {
return whiteListedGroups.indexOf(item.group) > -1 && blackListedGroups.indexOf(item.group) === -1;
});
sails.log("filteredAcls", filteredAcls);
// Gather the consume ids of the filtered groups
aclConsumerIds = _.map(filteredAcls, item => item.consumer.id);
// If the service is access controlled and no aclConsumerIds are found,
// it means that noone can use it
if(serviceAclPlugin && (!aclConsumerIds || !aclConsumerIds.length)) {
return res.json({
total: 0,
acl: serviceAclPlugin,
authenticationPlugins: authenticationPlugins,
data: []
})
}
let jwts, keyAuths, hmacAuths, oauth2, basicAuths
if(jwtPlugin) jwts = await KongService.fetch(`/jwts`, req);
if(keyAuthPlugin) keyAuths = await KongService.fetch(`/key-auths`, req);
if(hmacAuthPlugin) hmacAuths = await KongService.fetch(`/hmac-auths`, req);
if(oauth2Plugin) oauth2 = await KongService.fetch(`/oauth2`, req);
if(basicAuthPlugin) basicAuths = await KongService.fetch(`/basic-auths`, req);
sails.log("jwts",jwts)
sails.log("keyAuths",keyAuths)
sails.log("hmacAuths",hmacAuths)
sails.log("oauth2",oauth2)
sails.log("basicAuths",basicAuths)
let jwtConsumerIds = jwts ? _.map(jwts.data, item => item.consumer.id) : [];
let keyAuthConsumerIds = keyAuths ? _.map(keyAuths.data, item => item.consumer.id) : [];
let hmacAuthConsumerIds = hmacAuths ? _.map(hmacAuths.data, item => item.consumer.id) : [];
let oauth2ConsumerIds = oauth2 ? _.map(oauth2.data, item => item.consumer.id) : [];
let basicAuthConsumerIds = basicAuths ? _.map(basicAuths.data, item => item.consumer.id) : [];
sails.log("jwtConsumerIds",jwtConsumerIds)
sails.log("keyAuthConsumerIds",keyAuthConsumerIds)
sails.log("hmacAuthConsumerIds",hmacAuthConsumerIds)
sails.log("oauth2ConsumerIds",oauth2ConsumerIds)
sails.log("basicAuthConsumerIds",basicAuthConsumerIds)
let consumerIds;
let authenticationPluginsConsumerIds = _.uniq([
...jwtConsumerIds,
...keyAuthConsumerIds,
...hmacAuthConsumerIds,
...oauth2ConsumerIds,
...basicAuthConsumerIds
]);
if(aclConsumerIds && aclConsumerIds.length) {
sails.log("authenticationPluginsConsumerIds", authenticationPluginsConsumerIds);
sails.log("aclConsumerIds", _.uniq(aclConsumerIds));
consumerIds = authenticationPluginsConsumerIds.length ? _.intersection(_.uniq(aclConsumerIds), authenticationPluginsConsumerIds) : _.uniq(aclConsumerIds);
}else{
consumerIds = authenticationPluginsConsumerIds;
}
sails.log("consumerIds => ", consumerIds);
// Fetch all consumers
KongService.listAllCb(req, `/consumers`, (err, consumers) => {
if (err) return res.negotiate(err);
if(!consumers.data || !consumers.data.length) return res.json([]);
let eligibleConsumers = _.filter(consumers.data, item => {
return consumerIds.indexOf(item.id) > -1;
})
eligibleConsumers.forEach(consumer => {
let plugins = [];
if(keyAuths && _.filter(keyAuths.data,item => item.consumer.id === consumer.id).length) {
plugins.push('key-auth')
}
if(jwts && _.filter(jwts.data,item => item.consumer.id === consumer.id).length) {
plugins.push('jwt')
}
if(hmacAuths && _.filter(hmacAuths.data,item => item.consumer.id === consumer.id).length) {
plugins.push('hmac-auth')
}
if(oauth2 && _.filter(oauth2.data,item => item.consumer.id === consumer.id).length) {
plugins.push('oauth2')
}
if(basicAuths && _.filter(basicAuths.data,item => item.consumer.id === consumer.id).length) {
plugins.push('basic-auth')
}
consumer.plugins = plugins;
})
return res.json({
total: eligibleConsumers.length,
acl: serviceAclPlugin,
authenticationPlugins: authenticationPlugins,
data: eligibleConsumers
})
})
}
});
```
|
```css
`Border-radius` property can use `slash syntax(/)`
Making shapes with `transform`
Manipulating shapes using CSS: `clip-path`
Declaring linear gradients using the `background` property
Use the `box-shadow` property to create shadow effects on an element
```
|
```kotlin
package mega.privacy.android.domain.usecase.contact
import mega.privacy.android.domain.repository.ContactsRepository
import javax.inject.Inject
internal class DefaultReloadContactDatabase @Inject constructor(
private val contactsRepository: ContactsRepository,
private val getUserFirstName: GetUserFirstName,
private val getUserLastName: GetUserLastName,
private val getCurrentUserAliases: GetCurrentUserAliases,
) : ReloadContactDatabase {
override suspend fun invoke(isForceReload: Boolean) {
val contacts = contactsRepository.getContactEmails()
if (isForceReload || contacts.size != contactsRepository.getContactDatabaseSize()) {
contactsRepository.clearContactDatabase()
contacts.forEach { contact ->
val firstName =
getUserFirstName(handle = contact.key, skipCache = true, shouldNotify = true)
val lastName =
getUserLastName(handle = contact.key, skipCache = true, shouldNotify = true)
contactsRepository.createOrUpdateContact(
handle = contact.key,
email = contact.value,
firstName = firstName,
lastName = lastName,
nickname = null,
)
}
getCurrentUserAliases()
}
}
}
```
|
```yaml
---
fixes:
- |
Changes the hostname used for Docker events to be the hostname of the agent.
```
|
```java
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
String[] split = reader.readLine().split(" ");
Integer x = Integer.valueOf(split[0]) + Integer.valueOf(split[1]);
char[] chars = x.toString().toCharArray();
int modOffset = chars.length % 3;
for (int i = 0; i < chars.length; i++) {
if (chars[i] == '-') {
System.out.print('-');
continue;
}
System.out.print(chars[i] - 48);
if (i == chars.length - 1) {
System.out.println();
} else if ((i + 1) % 3 == modOffset) {
System.out.print(',');
}
}
}
}
```
|
```smalltalk
using System;
using System.Diagnostics;
using System.Globalization;
using System.Net.Sockets;
using System.Runtime.InteropServices;
using Microsoft.VisualStudio.TestTools.UnitTesting;
using Moq;
using Renci.SshNet.Common;
using Renci.SshNet.Tests.Common;
namespace Renci.SshNet.Tests.Classes.Connection
{
[TestClass]
public class Socks5ConnectorTest_Connect_TimeoutConnectingToProxy : Socks5ConnectorTestBase
{
private ConnectionInfo _connectionInfo;
private Exception _actualException;
private Socket _clientSocket;
private Stopwatch _stopWatch;
protected override void SetupData()
{
base.SetupData();
var random = new Random();
_connectionInfo = CreateConnectionInfo("proxyUser", "proxyPwd");
_connectionInfo.Timeout = TimeSpan.FromMilliseconds(random.Next(50, 200));
_stopWatch = new Stopwatch();
_actualException = null;
_clientSocket = SocketFactory.Create(SocketType.Stream, ProtocolType.Tcp);
}
protected override void SetupMocks()
{
_ = SocketFactoryMock.Setup(p => p.Create(SocketType.Stream, ProtocolType.Tcp))
.Returns(_clientSocket);
}
protected override void TearDown()
{
base.TearDown();
_clientSocket?.Dispose();
}
protected override void Act()
{
_stopWatch.Start();
try
{
_ = Connector.Connect(_connectionInfo);
Assert.Fail();
}
catch (SshOperationTimeoutException ex)
{
_actualException = ex;
}
catch (SocketException ex)
{
_actualException = ex;
}
finally
{
_stopWatch.Stop();
}
}
[TestMethodForPlatform(nameof(OSPlatform.Windows))]
public void ConnectShouldHaveThrownSshOperationTimeoutExceptionOnWindows()
{
Assert.IsNull(_actualException.InnerException);
Assert.IsInstanceOfType<SshOperationTimeoutException>(_actualException);
Assert.AreEqual(string.Format(CultureInfo.InvariantCulture, "Connection failed to establish within {0} milliseconds.", _connectionInfo.Timeout.TotalMilliseconds), _actualException.Message);
}
[TestMethodForPlatform(nameof(OSPlatform.Linux))]
public void ConnectShouldHaveThrownSshOperationTimeoutExceptionOnLinux()
{
Assert.IsNull(_actualException.InnerException);
Assert.IsInstanceOfType<SocketException>(_actualException);
Assert.AreEqual("Connection refused", _actualException.Message);
}
[TestMethodForPlatform(nameof(OSPlatform.Windows))]
public void ConnectShouldHaveRespectedTimeoutOnWindows()
{
var errorText = string.Format("Elapsed: {0}, Timeout: {1}",
_stopWatch.ElapsedMilliseconds,
_connectionInfo.Timeout.TotalMilliseconds);
// Compare elapsed time with configured timeout, allowing for a margin of error
Assert.IsTrue(_stopWatch.ElapsedMilliseconds >= _connectionInfo.Timeout.TotalMilliseconds - 10, errorText);
Assert.IsTrue(_stopWatch.ElapsedMilliseconds < _connectionInfo.Timeout.TotalMilliseconds + 100, errorText);
}
[TestMethod]
public void ClientSocketShouldHaveBeenDisposed()
{
try
{
_ = _clientSocket.Receive(new byte[0]);
Assert.Fail();
}
catch (ObjectDisposedException)
{
}
}
[TestMethod]
public void CreateOnSocketFactoryShouldHaveBeenInvokedOnce()
{
SocketFactoryMock.Verify(p => p.Create(SocketType.Stream, ProtocolType.Tcp),
Times.Once());
}
}
}
```
|
Dorothy Hartopp Radcliffe (16 September 1887 – 1959) was a British suffragette, member of the WSPU, and later a Carmelite nun.
Life
Radcliffe was born on 16 September 1887 in Hersham in Surrey, one of six children of Francis and Helen Radcliffe. Radcliffe was christened at St Michael and All Angels Anglican Church, Paddington, on 16 November 1887, with her full name being recorded as Dorothy Hartopp Yonge Radcliffe.
Radcliffe is found contributing small amounts of money to the £20,000 fund in the 6 February 1908 issue of Votes for Women, again in the 22 October 1908 issue and the £250,000 fund in the 2 January 1914 issue of The Suffragette. These contributions do not reflect her active membership of the WSPU.
Radcliffe appears in several photographs held by the Museum of London. She was the flag bearer at the Women's Sunday March on 21 June 1908, leading the procession which formed up on Victoria Embankment to march to Hyde Park. A Miss Radcliffe was secretary of the procession committee based at 400 King's Road, Chelsea, working with Chief Marshall Florence Haig.
Another picture from a week later shows Radcliffe at the front of a line of women with Dora Beedham, Hilda Dallas and Charlotte Marsh promoting the Women's Parliament on 30 June 1908. The final photograph shows her with Charlotte Marsh and Elsa Gye, preparing to welcome the release of Emmeline and Christabel Pankhurst from jail in December 1908.
She was Banner Marshal for the university graduates in the Women's March to the Albert Hall which took place on 18 June 1910. Radcliffe was Banner and Colour Captain leading the Empire Pageant for the Women's Coronation Procession on 17 June 1911.
She cannot be found in the 1911 Census when suffragettes refused to be counted.
Radcliffe was imprisoned during her suffrage campaigning. Her name appears on the Suffragette Roll of Honour, with her surname mis-spelt as Radclyffe. She used a false name in 1913, calling herself 'Heather Mitchell' in the list of fictitious names used by the suffragettes in 1913. She does not appear on the original arrest records as Dorothy Radcliffe, but a 'Hester Mitchell' is recorded and could be a misspelling.
At some point Radcliffe converted to Roman Catholicism and became a nun. She is recorded in the 1939 Census as being an enclosed nun at the Carmelite Monastery, Rushmere, near Ipswich in Suffolk. The Carmelites moved from there to their present convent at Quidenham, Norfolk, in 1948. Radcliffe died there in early 1959 at the age of 71.
References
1887 births
1959 deaths
Carmelite nuns
Converts to Roman Catholicism
English suffragists
People from Hersham
People from Quidenham
|
Yefyus is a small island in the shallow sea south of the Bird's Head Peninsula of New Guinea. It is known in Indonesian as Pulau Yus ( Yus Island), and its name was previously spelt using the Dutch orthography as Jef Joes. It is located south-southwest of the promontory of Tanjung Wamonket in the northwest of the Bird's Head mainland, east-southeast of the isolated island of Yefyal, and northwest of the islands of Efkasya in the archipelago off Misool.
Yefyus is about 300 meters long and 150 meters wide, and is in the middle of a coral reef. The land is covered by a patch of forest, which is surrounded by beaches of coral sand. There is a tower with a light on the island, and on the edge of the reef a shipwreck.
Sources
Islands of Western New Guinea
Landforms of Southwest Papua
|
```css
Determine the opacity of background-colors using the RGBA declaration
Use pseudo-classes to describe a special state of an element
Highlight input forms using `:focus` pseudo-class
Add `line-height` to `body`
Multiple borders with pseudo elements
```
|
The Portrait of Ferenc Kölcsey () is a painting by Anton Einsle in the Art Collection of the Hungarian Academy of Sciences in Budapest. It is probably the most famous portrait of Ferenc Kölcsey, a leading Hungarian poet, literary critic, orator, and politician in the Reform Era, who wrote the Himnusz, the national anthem of Hungary.
History
The idea of the portrait painting emerged for the first time in a letter written by the literary critic Ferenc Toldy to Kölcsey on 10 December 1834. There is a passing mention that Kölcsey was going to visit his friend, the poet József Bajza in Pest on his way towards Pozsony and there he was going to sit for a portrait. The original idea obviously came from Bajza. Kölcsey was 45 years old at the time when the portrait was created. He had served as deputy of Szatmár County in the Diet of Hungary until 1835. As poet, literary critic and member of the academy he was well-respected. On his way back from Pozsony to Szatmár he stayed in Pest again in the spring of 1835. There he had time to sit for the portrait again. The artist, Anton Einsle had been living in Pest since 1832 as court painter to Archduke Joseph, the Palatine of Hungary.
The portrait was made for the 1836 issue of Aurora, the prestigious literary almanac of the Reform Era whose editor was József Bajza. György Kilián, the publisher of the magazine wrote that "the portrait, painted by Einsle for this purpose, turned out perfect". Johann Ender copied it in drawing but in the end the almanac was published without the engraving because "the engraver was not able to recreate on the steel the beauty and the livingness of the original", as the publishers explained it to the public. Bajza wrote a private letter to Kölcsey on 17 January 1836: "The Aurora was published but without the image of my dear friend, because the engraver could not make his work done properly as I wished. [...] I respect my friend and the public more than publishing such a mediocre engraving, especially that the original painting by Einsle was executed with a great finesse". The drawing was sent to Weimar to Carl August Schwerdgeburth who made a new engraving that was published subsequently.
The original portrait was purchased by László Bártfay, a lawyer who served as the treasury superintendent of the Hungarian Academy of Sciences. Bártfay and Kölcsey were friends with common literary interests although Bártfay remained a dilettante. After Bártfay's death in 1858 the painting was inherited by his widow, Jozefin Mauks, although Bártfay gave it to the Academy of Sciences in his will; the institution received the artwork in 1860.
Description
The friends of the poet thought that the portrait captured his troubled and serious character very well. "At the time my poor, since deceased friend were on his way back to home after the unpleasantries of the diet", wrote Bártfay in a letter in 1839, more than three years after Kölcsey's sudden death. "The colour of learning and weariness, pallor was conspicuous on his face, this is the colour on my painting, showing him ill." In his diary Bártfay disclosed other details: "my painting was his only portrait [in his life], it shows him with a slightly bowed head and neck, that was his natural posture."
The painter did not to hide the fact that Kölcsey's right eye was blind, he was almost totally bald and his head was too large in proportion to his body. Despite his obvious physical flaws the face still conveys a compelling inner strength, seriousness and a sense of vocation.
Sources
Hungarian Academy of Sciences - information provided on the permanent exhibition
References
Hungarian Academy of Sciences
Portraits by Austrian artists
1835 paintings
Hungarian paintings
Neoclassical paintings
|
```c
/*====================================================================*
-
- Redistribution and use in source and binary forms, with or without
- modification, are permitted provided that the following conditions
- are met:
- 1. Redistributions of source code must retain the above copyright
- notice, this list of conditions and the following disclaimer.
- 2. Redistributions in binary form must reproduce the above
- copyright notice, this list of conditions and the following
- disclaimer in the documentation and/or other materials
- provided with the distribution.
-
- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*====================================================================*/
/*!
* Top-level fast hit-miss transform with auto-generated sels
*
* PIX *pixHMTDwa_1()
* PIX *pixFHMTGen_1()
*/
#include <string.h>
#include "allheaders.h"
PIX *pixHMTDwa_1(PIX *pixd, PIX *pixs, const char *selname);
PIX *pixFHMTGen_1(PIX *pixd, PIX *pixs, const char *selname);
l_int32 fhmtgen_low_1(l_uint32 *datad, l_int32 w,
l_int32 h, l_int32 wpld,
l_uint32 *datas, l_int32 wpls,
l_int32 index);
static l_int32 NUM_SELS_GENERATED = 10;
static char SEL_NAMES[][80] = {
"sel_3hm",
"sel_3de",
"sel_3ue",
"sel_3re",
"sel_3le",
"sel_sl1",
"sel_ulc",
"sel_urc",
"sel_llc",
"sel_lrc"};
/*!
* \brief pixHMTDwa_1()
*
* \param[in] pixd usual 3 choices: null, == pixs, != pixs
* \param[in] pixs 1 bpp
* \param[in] sel name
* \return pixd
*
* <pre>
* Notes:
* (1) This simply adds a 32 pixel border, calls the appropriate
* pixFHMTGen_*(), and removes the border.
* See notes below for that function.
* </pre>
*/
PIX *
pixHMTDwa_1(PIX *pixd,
PIX *pixs,
const char *selname)
{
PIX *pixt1, *pixt2, *pixt3;
if (!pixs)
return (PIX *)ERROR_PTR("pixs not defined", __func__, pixd);
if (pixGetDepth(pixs) != 1)
return (PIX *)ERROR_PTR("pixs must be 1 bpp", __func__, pixd);
pixt1 = pixAddBorder(pixs, 32, 0);
pixt2 = pixFHMTGen_1(NULL, pixt1, selname);
pixt3 = pixRemoveBorder(pixt2, 32);
pixDestroy(&pixt1);
pixDestroy(&pixt2);
if (!pixd)
return pixt3;
pixCopy(pixd, pixt3);
pixDestroy(&pixt3);
return pixd;
}
/*!
* \brief pixFHMTGen_1()
*
* \param[in] pixd usual 3 choices: null, == pixs, != pixs
* \param[in] pixs 1 bpp
* \param[in] sel name
* \return pixd
*
* <pre>
* Notes:
* (1) This is a dwa implementation of the hit-miss transform
* on pixs by the sel.
* (2) The sel must be limited in size to not more than 31 pixels
* about the origin. It must have at least one hit, and it
* can have any number of misses.
* (3) This handles all required setting of the border pixels
* before erosion and dilation.
* </pre>
*/
PIX *
pixFHMTGen_1(PIX *pixd,
PIX *pixs,
const char *selname)
{
l_int32 i, index, found, w, h, wpls, wpld;
l_uint32 *datad, *datas, *datat;
PIX *pixt;
if (!pixs)
return (PIX *)ERROR_PTR("pixs not defined", __func__, pixd);
if (pixGetDepth(pixs) != 1)
return (PIX *)ERROR_PTR("pixs must be 1 bpp", __func__, pixd);
found = FALSE;
for (i = 0; i < NUM_SELS_GENERATED; i++) {
if (strcmp(selname, SEL_NAMES[i]) == 0) {
found = TRUE;
index = i;
break;
}
}
if (found == FALSE)
return (PIX *)ERROR_PTR("sel index not found", __func__, pixd);
if (!pixd) {
if ((pixd = pixCreateTemplate(pixs)) == NULL)
return (PIX *)ERROR_PTR("pixd not made", __func__, NULL);
}
else /* for in-place or pre-allocated */
pixResizeImageData(pixd, pixs);
wpls = pixGetWpl(pixs);
wpld = pixGetWpl(pixd);
/* The images must be surrounded with 32 additional border
* pixels, that we'll read from. We fabricate a "proper"
* image as the subimage within the border, having the
* following parameters: */
w = pixGetWidth(pixs) - 64;
h = pixGetHeight(pixs) - 64;
datas = pixGetData(pixs) + 32 * wpls + 1;
datad = pixGetData(pixd) + 32 * wpld + 1;
if (pixd == pixs) { /* need temp image if in-place */
if ((pixt = pixCopy(NULL, pixs)) == NULL)
return (PIX *)ERROR_PTR("pixt not made", __func__, pixd);
datat = pixGetData(pixt) + 32 * wpls + 1;
fhmtgen_low_1(datad, w, h, wpld, datat, wpls, index);
pixDestroy(&pixt);
}
else { /* not in-place */
fhmtgen_low_1(datad, w, h, wpld, datas, wpls, index);
}
return pixd;
}
```
|
```javascript
import React from 'react'
import { shallow } from 'enzyme'
import LogoImage from '.'
const wrap = (props = {}) => shallow(<LogoImage {...props} />)
it('renders props when passed in', () => {
const wrapper = wrap({ id: 'foo' })
expect(wrapper.find({ id: 'foo' })).toHaveLength(1)
})
```
|
Don't Cry Wolf may refer to:
"Don't Cry Wolf" (song), a 1977 song by the Damned
Don't Cry Wolf (album), a 1986 album by London
Don't Cry Wolf (film), a 2003 Swedish comedy film
See also
Cry Wolf (disambiguation)
|
Stephen Bernard Lee (born c. 1951) is a South African former political prisoner best known for his 1979 escape from Pretoria Local Prison (part of the Pretoria Central Prison complex) with friend and fellow activist Tim Jenkin and a third inmate, Alex Moumbaris.
Biography
Early life and activism
Lee was born in South Africa. After developing an interest in Marxism and involving himself in left-leaning student politics at the University of Cape Town and subsequently switching courses from business science to sociology in 1971, he met Jenkin in a sociology class. They soon became friends and both of them sought out the literature banned by the apartheid government, devouring, photocopying it and swapping it with other students. They both found their sociology course disappointing, as the material reinforced the status quo of the apartheid system.
As they started realising the full extent of the unfair system of apartheid, they were fired with a desire to work towards change. Coming to the conclusion they could not effect any real change within the constitutional framework, which banned all effective and truly democratic opposition, they decided the ideals of the African National Congress (ANC) were worth fighting for. The only way they could work for this banned organisation was to move to the UK and make contact with the organisation there, so both set off in February 1974 by ship via Barcelona, spending a few weeks in the Netherlands en route.
Upon arrival in London in April 1974, they applied to join the ANC. While the ANC were checking their credentials, Lee went and worked as a carpenter in the Netherlands and taught English in Spain. At the end of 1974, the ANC informed him they had been approved and, after receiving some months of training with them, could return to South Africa to do something for the movement. During this time Lee worked as a bus conductor and joined the Transport and General Workers' Union (TGWU).
After their return to Cape Town in July 1975, Lee and Jenkin bought a typewriter, duplicator and stationery to print and post pamphlets and leased first a garage and then a tiny apartment. In March 1976 Lee decided to go to Johannesburg to look for work, and the ANC coincidentally sent them both on their first mission, to disperse leaflets urging support for the ANC and unity in the liberation struggle via a leaflet bomb in Johannesburg, close to the anniversary of the Sharpeville Massacre. After achieving this mission, Lee worked for the University of the Witwatersrand, while Jenkin ran the "cell" on his own in Cape Town. Not long after the Soweto uprising, Lee planted a number of leaflet bombs around Johannesburg.
In December 1976, Lee went to Cape Town and both he and Jenkin planted leaflet bombs in the city and suburbs. In Jenkin's words, "The actual message on the leaflets, important as it was, was not as important as the fact the ANC had done it. It is because of the propaganda effect...".
In June 1977 Lee distributed several caches of leaflets at a right-wing sociology conference in Johannesburg. In September, he and Jenkin hung a 10-metre-long banner with the words "ANC LIVES" from a high building in the centre of Cape Town, along with a timed device which distributed hundreds of leaflets over the crowds below. Lee moved back to Cape Town in December after enrolling in a master's degree in sociology, and the two continued their undercover work, but unbeknownst to them they were by this time under surveillance by police.
Arrest
At 3am on 2 March 1978, they were both arrested, after being seen moving their printing equipment into their own dwelling.
They were separated, interrogated and put into cells, without being informed of the charges or their rights. This was legal under Section 6 of the Terrorism Act, which allowed detention without trial for up to 60 days, and was extendable. Lee made an escape attempt and nearly succeeded. After a spell in the notorious John Vorster Square in Johannesburg, they were returned to Cape Town and after four weeks, allowed to see family, and held at Pollsmoor Prison as they awaited trial. After Lee's father brought him a copy of the book Papillon, the book inspired them to seriously consider the prospect of escape and they concentrated on rigorous observations of the world around them.
Trial
Along with Jenkin, Lee was tried in the Cape Town Supreme Court from 6 to 15 June 1978, charged with helping to produce and distribute pamphlets for the ANC and South African Communist Party (SACP), and/or participating in ANC, SACP and Umkhonto we Sizwe (MK) (all banned organisations in apartheid South Africa) activities. They received poor legal advice and were not allowed to make their own pleas in answer to the charges. Lee's family had insisted on using a different defence lawyer, and he and his witnesses – parents, a Roman Catholic chaplain and a family friend – used the line Jenkin was the ringleader and Lee had been corrupted. Lee was sentenced to eight years' imprisonment and Jenkin to twelve.
Prison
They were first taken to Pretoria Central Prison for assessment, where they were assigned to Pretoria Local Prison (aka Pretoria Prison) to serve out their sentences. This was a separate prison, one of three along with Pretoria Central proper and "Maximum" or "Beverly Hills" which were part of the complex - although all three were often referred to mistakenly as Pretoria Central. Within this prison, they were assigned to the maximum security part reserved for white male political prisoners, making the number up to 11 at that time. From the first day, they were observing their surroundings and weighing up the chances of an escape.
Escape
Lee, Jenkin and Alex Moumbaris escaped from Pretoria Prison in 1979, after meticulous planning and trial runs. The escape is described in great detail by Jenkin's book, Escape from Pretoria (1987, 2003).
Although Jenkin and Moumbaris contributed most towards the preparations for and material necessities of the plan, Lee was firmly behind their thinking and assisted in whatever ways he could. After escaping, Lee separated for some weeks from the others, staying with friends in Johannesburg before meeting up with them again at Luanda airport to fly out of Angola.
Life after prison
Lee and Jenkin appeared at a press conference in Lusaka, Zambia with Oliver Tambo on 2 January 1980 to tell their stories. After flying to Tanzania, Lee flew on to London on 13 January 1980, having renounced his South African citizenship soon after arrival in Pretoria.
In May 1980 the warden who had been on duty of the night of the escape, Sergeant Vermeulen, was put on trial for "aiding terrorists", or alternatively aiding in the escape of three prisoners. Lee, having first written to a newspaper explaining Vermeulen's innocence, upon request sent a sworn statement to his defence attorney stating Vermeulen's innocence. The combination of this and the many inconsistencies in his forced "confession" led to his eventual acquittal.
Lee and Jenkin went on a speaking tour in Sweden in the early 1980s.
In TV and film
In 2013, the story of the prison escape was dramatised in the 7th episode of the 2nd season of Breakout, a television series made by National Geographic TV channel dramatising real-life prison escapes. The video features excerpts from interviews with Jenkin, Lee, Moumbaris and Goldberg filmed in 2012, in between re-enacted scenes of the prison escape.
In May 2017, it was announced production would start on a film of Jenkin's book, produced by David Barron and starring Daniel Radcliffe as Jenkin and Ian Hart as Goldberg. Filming of Escape from Pretoria began in Adelaide, South Australia, in March 2019, with Daniel Webber joining the cast as Lee.
References
Cited works
Escapees from South African detention
University of Cape Town alumni
White South African anti-apartheid activists
UMkhonto we Sizwe personnel
Year of birth missing (living people)
Living people
|
Delino Diaab DeShields (born August 16, 1992) is an American professional baseball center fielder who is a free agent. He played in Major League Baseball (MLB) for the Texas Rangers from 2015 through 2019, the Cleveland Indians in 2020, and the Cincinnati Reds in 2021. He is the son of former MLB player Delino DeShields and the brother of basketball player Diamond DeShields.
Early life
DeShields, the eldest of his father's five children, was raised in the Atlanta area. He went to Woodward Academy, where he played both baseball and football. In his senior year at Woodward, he hit 9 home runs and batted .415, while stealing 29 bases. He was recruited by the Georgia Bulldogs and Ole Miss Rebels for football before deciding to pursue baseball instead. He was also recruited by the LSU Tigers for baseball, but they only committed a half-scholarship to him due to his desire to play professionally.
Professional career
Houston Astros
The Houston Astros selected DeShields in the first round, with the eighth overall selection, of the 2010 MLB draft. The Astros signed DeShields for a $2.15 million signing bonus. Astros general manager Ed Wade stated his intention to send DeShields to the rookie-level Greeneville Astros of the Appalachian League once he was signed, with a transition to second baseman during the winter.
In 2010, DeShields played 16 games for Greeneville and two for the GCL Astros. He also played for the Lexington Legends of the South Atlantic League, the Lancaster JetHawks of the California League, and the Corpus Christi Hooks of the Double-A Texas League. On April 18, 2014, DeShields was hit in the face by a pitch. He suffered a non-displaced maxillary sinus fracture.
Texas Rangers
At the 2014 Winter Meetings, the Texas Rangers selected DeShields from the Astros in the Rule 5 draft. DeShields made the Rangers' Opening Day roster. He recorded his first major league hit in the 8th inning on an infield single against Dan Otero of the Oakland Athletics on April 8. On June 3, 2015, DeShields was named American League Rookie of the Month for May after batting .296 for the month and scoring 22 runs. On August 14, he hit his first Major League home run against Tampa Bay. After the 2015 season, DeShields changed his uniform number from 7 to 3. After the completion of the 2015 season, DeShields finished in 7th place in the American League Rookie of the Year voting, with one third place vote. He was voted as the Texas Rangers' Rookie of the Year by fellow players and coaches.
DeShields began the 2016 season as the Rangers' starting center fielder, but eventually lost his job to Ian Desmond for inconsistency and was demoted to the Triple-A Round Rock Express. DeShields finished the season with a .209 batting average, four home runs and 13 RBI with eight stolen bases in 74 games. Deshields made the 2017 Opening Day roster. On April 21, 2017, he hit a walk-off RBI single in the bottom of the 13th inning in a game against the Kansas City Royals.
On March 31, 2018, DeShields experienced pain in his left hand after swinging. He was diagnosed with a broken hamate bone in the left hand, ruling him out for four to six weeks. DeShields ended the season with a .216 batting average with two home runs and 20 stolen bases. In 2019, he hit .249/.325/.347/.672 with four home runs, 32 RBI, and 24 stolen bases.
Cleveland Indians
On December 15, 2019, the Rangers traded DeShields and Emmanuel Clase to the Cleveland Indians in exchange for Corey Kluber and cash considerations. Overall with the 2020 Cleveland Indians, DeShields batted .252 with no home runs and 7 RBI in 37 games. On December 2, 2020, the Indians declined to tender DeShields a contract for the 2021 season, making him a free agent.
Texas Rangers (second stint)
On February 1, 2021, DeShields signed a minor-league contract with the Texas Rangers organization and was invited to spring training. He was not added to the 40-man roster, and was assigned to the Triple-A Round Rock Express. DeShields played in 66 games for Round Rock, hitting .263 with 5 home runs and 18 RBI's, while also stealing 16 bases.
Boston Red Sox
On August 5, 2021, DeShields was traded to the Boston Red Sox in exchange for cash considerations. He was assigned to the Triple-A Worcester Red Sox. DeShields played in 18 games for Triple-A Worcester, hitting .210 with one home run and four RBI.
Cincinnati Reds
On August 31, 2021, DeShields was traded to the Cincinnati Reds in exchange for cash considerations. He was assigned to the Triple-A Louisville Bats. The following day, the Reds selected DeShields' contract. DeShields played in 25 games for the Reds, hitting .255 with one home run and six RBI. On October 11, DeShields rejected his outright assignment and elected free agency.
Miami Marlins
On March 18, 2022, DeShields signed a minor league contract with the Miami Marlins. DeShields collected one hit in eight plate appearances during Spring Training before he was released by the Marlins organization on April 3.
Atlanta Braves
On April 8, 2022, DeShields signed a minor league contract with the Atlanta Braves. DeShields played in 109 games for the Triple-A Gwinnett Stripers, batting .220/.367/.264 with one home run, 26 RBI, and 35 stolen bases. He elected free agency after the season on November 10.
Seattle Mariners
On March 19, 2023, DeShields signed a minor league contract with the Seattle Mariners organization. He played in 12 games for the Triple-A Tacoma Rainiers, batting .222/.300/.222 with no home runs and 2 RBI. DeShields was released by Seattle on May 1.
Cleburne Railroaders
On May 7, 2023, DeShields signed with the Cleburne Railroaders of the American Association of Professional Baseball. In 34 contests, DeShields batted .291/.380/.440 with 4 home runs, 21 RBI, and 13 stolen bases. He was released by the Railroaders on June 28.
Awards
For the 2018 season, DeShields received the Texas Rangers' Harold McKinney Good Guy Award as voted by the Dallas–Fort Worth Baseball Writers' Association of America (BBWAA) chapter.
Personal life
DeShields is the son of former MLB player Delino DeShields. His sister, Diamond DeShields, is a professional basketball player in the WNBA. In addition to Diamond, DeShields has a brother, another sister and a paternal half-sister.
DeShields was arrested and charged with driving under the influence, possession of alcohol by a minor and a traffic violation in Georgia on January 16, 2011. He was released on $2,500 bail and charged with the three misdemeanors.
See also
Rule 5 draft results
Notes
References
External links
1992 births
Living people
African-American baseball players
Baseball players from Fulton County, Georgia
Cangrejeros de Santurce (baseball) players
Cincinnati Reds players
Cleburne Railroaders players
Cleveland Indians players
Corpus Christi Hooks players
Frisco RoughRiders players
Greeneville Astros players
Gulf Coast Astros players
Gwinnett Stripers players
Lancaster JetHawks players
Lexington Legends players
Major League Baseball center fielders
Nashville Sounds players
Peoria Javelinas players
Round Rock Express players
Sportspeople from College Park, Georgia
Tacoma Rainiers players
Texas Rangers players
Tigres del Licey players
Worcester Red Sox players
Woodward Academy alumni
Yaquis de Obregón players
21st-century African-American sportspeople
|
```python
import abc
from abc import ABC
from abc import abstractmethod
from abc import abstractmethod as notabstract
"""
Should emit:
B027 - on lines 13, 16, 19, 23, 31
"""
class AbstractClass(ABC):
def empty_1(self): # error
...
def empty_2(self): # error
pass
def empty_3(self): # error
"""docstring"""
...
def empty_4(self): # error
"""multiple ellipsis/pass"""
...
pass
...
pass
@notabstract
def empty_5(self): # error
...
@abstractmethod
def abstract_1(self): ...
@abstractmethod
def abstract_2(self):
pass
@abc.abstractmethod
def abstract_3(self): ...
def body_1(self):
print("foo")
...
def body_2(self):
self.body_1()
class NonAbstractClass:
def empty_1(self): # safe
...
def empty_2(self): # safe
pass
# ignore @overload, fixes issue #304
# ignore overload with other imports, fixes #308
import typing
import typing as t
import typing as anything
from typing import Union, overload
class AstractClass(ABC):
@overload
def empty_1(self, foo: str): ...
@typing.overload
def empty_1(self, foo: int): ...
@t.overload
def empty_1(self, foo: list): ...
@anything.overload
def empty_1(self, foo: float): ...
@abstractmethod
def empty_1(self, foo: Union[str, int, list, float]): ...
```
|
```java
/*
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing,
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* specific language governing permissions and limitations
*/
package org.apache.guacamole.io;
import java.io.IOException;
import java.io.Writer;
import java.net.SocketException;
import java.net.SocketTimeoutException;
import org.apache.guacamole.GuacamoleConnectionClosedException;
import org.apache.guacamole.GuacamoleException;
import org.apache.guacamole.GuacamoleServerException;
import org.apache.guacamole.GuacamoleUpstreamTimeoutException;
import org.apache.guacamole.protocol.GuacamoleInstruction;
/**
* A GuacamoleWriter which wraps a standard Java Writer, using that Writer as
* the Guacamole instruction stream.
*/
public class WriterGuacamoleWriter implements GuacamoleWriter {
/**
* Wrapped Writer to be used for all output.
*/
private Writer output;
/**
* Creates a new WriterGuacamoleWriter which will use the given Writer as
* the Guacamole instruction stream.
*
* @param output The Writer to use as the Guacamole instruction stream.
*/
public WriterGuacamoleWriter(Writer output) {
this.output = output;
}
@Override
public void write(char[] chunk, int off, int len) throws GuacamoleException {
try {
output.write(chunk, off, len);
output.flush();
}
catch (SocketTimeoutException e) {
throw new GuacamoleUpstreamTimeoutException("Connection to guacd timed out.", e);
}
catch (SocketException e) {
throw new GuacamoleConnectionClosedException("Connection to guacd is closed.", e);
}
catch (IOException e) {
throw new GuacamoleServerException(e);
}
}
@Override
public void write(char[] chunk) throws GuacamoleException {
write(chunk, 0, chunk.length);
}
@Override
public void writeInstruction(GuacamoleInstruction instruction) throws GuacamoleException {
write(instruction.toString().toCharArray());
}
}
```
|
Hun Neang (, Chinese: 云良; 27 August 1924 – 12 July 2013) was the father of Cambodia's Prime Minister, Hun Sen. A devout Buddhist, various schools throughout the country are named in honour after him. Hun Neang's official, full title is "Neak Oknha Moha Pheakdey Saburisak Phoukea Thipadei", which was presented to him by King Norodom Sihamoni in 2011.
Biography
Hun Neang was born on 27 August 1924, at the district of Stung Trang in Kampong Cham province. He was a resident monk in a local Wat in Kampong Cham province before defrocking himself to join the French resistance and married Hun Sen's mother, Dy Pok in the 1940s. Hun Neang's paternal grandparents were wealthy landowners of Teochew Chinese heritage. Hun Neang inherited some of his family assets and led a relatively comfortable life, as they owned several hectares of land until a kidnapping incident forced their family to sell off much of their assets. His wife Dy Pok died in 1998 of illness at the age of 81.
Hun Neang and Dy Pok had six children, of which Prime Minister Hun Sen is the third child. He also had 30 grandchildren and 66 great grandchildren.
Death and funeral
Hun Neang battled health issues in March 2012, according to his son, Hun Sen. He died on Friday, 12 July 2013, aged 88.
His funeral was held at Hun Sen's residence near the Independence Monument. Government officials and foreign leaders attended the funeral and sent their condolences to Hun Sen, including Vietnamese Prime Minister Nguyen Tan Dung, Thai former Prime Minister Thaksin Shinawatra, and Thai Prime Minister Yingluck Shinawatra. King Norodom Sihamoni and Queen-Mother Norodom Monineath were also present. He was interred near his wife's crypt in Vongkut Borei Pagoda in Toek Thla commune, Sen Sok district.
References
1924 births
2013 deaths
Cambodian Buddhists
Cambodian Theravada Buddhists
Cambodian people of Chinese descent
People from Kampong Cham province
Hun Sen
Hun family
Oknha
|
```xml
import React from 'react'
import { Marimekko, SvgProps } from '@nivo/marimekko'
import marimekkoLightNeutralImg from '../../assets/icons/marimekko-light-neutral.png'
import marimekkoLightColoredImg from '../../assets/icons/marimekko-light-colored.png'
import marimekkoDarkNeutralImg from '../../assets/icons/marimekko-dark-neutral.png'
import marimekkoDarkColoredImg from '../../assets/icons/marimekko-dark-colored.png'
import { ICON_SIZE, Icon, colors, IconImg } from './styled'
import { IconType } from './types'
type Datum = {
id: string
value: number
A: number
B: number
C: number
}
const chartProps: SvgProps<Datum> = {
width: ICON_SIZE,
height: ICON_SIZE,
id: 'id',
value: 'value',
innerPadding: 4,
margin: {
top: 12,
bottom: 16,
},
enableGridX: false,
enableGridY: false,
offset: 'expand',
data: [
{ id: '0', value: 2, A: 1, B: 2, C: 3 },
{ id: '1', value: 1, A: 2, B: 2, C: 2 },
{ id: '2', value: 3, A: 3, B: 2, C: 1 },
],
dimensions: [
{ id: 'A', value: 'A' },
{ id: 'B', value: 'B' },
{ id: 'C', value: 'C' },
],
isInteractive: false,
animate: false,
}
const MarimekkoIconItem = ({ type }: { type: IconType }) => (
<Icon id={`marimekko-${type}`} type={type}>
<Marimekko<Datum>
{...chartProps}
colors={[colors[type].colors[1], colors[type].colors[2], colors[type].colors[4]]}
/>
</Icon>
)
export const MarimekkoIcon = () => (
<>
<MarimekkoIconItem type="lightNeutral" />
<IconImg url={marimekkoLightNeutralImg} />
<MarimekkoIconItem type="lightColored" />
<IconImg url={marimekkoLightColoredImg} />
<MarimekkoIconItem type="darkNeutral" />
<IconImg url={marimekkoDarkNeutralImg} />
<MarimekkoIconItem type="darkColored" />
<IconImg url={marimekkoDarkColoredImg} />
</>
)
```
|
Dyoenergism (derived from Greek as term for "two energies") is a particular Christological doctrine that teaches the existence of two energies (divine and human) in the person of Jesus Christ. Specifically, dyoenergism correlates the distinctiveness of two energies with the existence of two specific natures (divine and human) in the person of Jesus Christ (dyophysitism), and rejects monoenergism. Therefore, dyoenergism teaches that Jesus Christ acts through two energies, divine and human. The Sixth Ecumenical Council in 680-681 reaffirmed dyoenergism as church doctrine.
See also
Essence–energies distinction (Eastern Orthodox theology)
Monoenergism
References
Sources
External links
Classical Christianity (2016): St. Cyril on Dyoenergism and Dyotheletism
Christology
Christian terminology
Eastern Orthodox theology
Christianity in the Byzantine Empire
7th-century Christianity
Nature of Jesus Christ
|
In geometry, the Beckman–Quarles theorem states that if a transformation of the Euclidean plane or a higher-dimensional Euclidean space preserves unit distances, then it preserves all Euclidean distances. Equivalently, every homomorphism from the unit distance graph of the plane to itself must be an isometry of the plane. The theorem is named after Frank S. Beckman and Donald A. Quarles Jr., who published this result in 1953; it was later rediscovered by other authors and re-proved in multiple ways. Analogous theorems for rational subsets of Euclidean spaces, or for non-Euclidean geometry, are also known.
Statement and proof idea
Formally, the result is as follows. Let be a function or multivalued function from a -dimensional Euclidean space to itself, and suppose that, for every pair of points and that are at unit distance from each other, every pair of images and are also at unit distance from each other. Then must be an isometry: it is a one-to-one function that preserves distances between all pairs of
One way of rephrasing the Beckman–Quarles theorem involves graph homomorphisms, mappings between undirected graphs that take vertices to vertices and edges to edges. For the unit distance graph whose vertices are all of the points in the plane, with an edge between any two points at unit distance, a homomorphism from this graph to itself is the same thing as a unit-distance-preserving transformation of the plane. Thus, the Beckman–Quarles theorem states that the only homomorphisms from this graph to itself are the obvious ones coming from isometries of the For this graph, all homomorphisms are symmetries of the graph, the defining property of a class of graphs called
As well as the original proofs of Beckman and Quarles of the theorem, and the proofs in later papers rediscovering the several alternative proofs have been If is the set of distances preserved by a then it follows from the triangle inequality that certain comparisons of other distances with members of are preserved Therefore, if can be shown to be a dense set, then all distances must be preserved. The main idea of several proofs of the Beckman–Quarles theorem is to use the structural rigidity of certain unit distance graphs, such as the graph of a regular simplex, to show that a mapping that preserves unit distances must preserve enough other distances to form a
Counterexamples for other spaces
Beckman and Quarles observe that the theorem is not true for the real line (one-dimensional Euclidean space). As an example, consider the function that returns if is an integer and returns otherwise. This function obeys the preconditions of the theorem: it preserves unit distances. However, it does not preserve the distances between integers and
Beckman and Quarles provide another counterexample showing that their theorem cannot be generalized to an infinite-dimensional space, the Hilbert space of square-summable sequences of real numbers. "Square-summable" means that the sum of the squares of the values in a sequence from this space must be finite. The distance between any two such sequences can be defined in the same way as the Euclidean distance for finite-dimensional spaces, by summing the squares of the differences of coordinates and then taking the square root. To construct a function that preserves unit distances but not other distances, Beckman and Quarles compose two discontinuous functions:
The first function maps every point of the Hilbert space onto a nearby point in a countable dense subspace. For instance the dense subspace could be chosen as the subspace of sequences of rational numbers. As long as this transformation moves each point by a distance it will map points at unit distance from each other to distinct images.
The second function maps this dense set onto a countable unit simplex, an infinite set of points all at unit distance from each other. One example of a countable simplex in this space consists of the sequences of real numbers that take the value in a single position and are zero everywhere else. There are infinitely many sequences of this form, and the distance between any two such sequences is one. This second function must be one-to-one but can otherwise be chosen arbitrarily.
When these two transformations are combined, they map any two points at unit distance from each other to two different points in the dense subspace, and from there map them to two different points of the simplex, which are necessarily at unit distance apart. Therefore, their composition preserves unit distances. However, it is not an isometry, because it maps every pair of points, no matter their original distance, either to the same point or to a unit
Related results
Every Euclidean space can be mapped to a space of sufficiently higher dimension in a way that preserves unit distances but is not an isometry. To do so, following known results on the Hadwiger–Nelson problem, color the points of the given space with a finite number of colors so that no two points at unit distance have the same color. Then, map each color to a vertex of a higher-dimensional regular simplex with unit edge lengths. For instance, the Euclidean plane can be colored with seven colors, using a tiling by hexagons of slightly less than unit diameter, so that no two points of the same color are a unit distance apart. Then the points of the plane can be mapped by their colors to the seven vertices of a six-dimensional regular simplex. It is not known whether six is the smallest dimension for which this is possible, and improved results on the Hadwiger–Nelson problem could improve this
For transformations of the points with rational number coordinates, the situation is more complicated than for the full Euclidean plane. There exist unit-distance-preserving maps of rational points to rational points that do not preserve other distances for dimensions up to four, but none for dimensions five and above. Similar results hold also for mappings of the rational points that preserve other distances, such as the square root of two, in addition to the unit distances. For pairs of points whose distance is an there is a finite version of this theorem: Maehara showed that, for every algebraic number , there is a finite rigid unit distance in which some two vertices must be at from each other. It follows from this that any transformation of the plane that preserves the unit distances in must also preserve the distance between
A. D. Alexandrov asked which metric spaces have the same property, that unit-distance-preserving mappings are and following this question several authors have studied analogous results for other types of geometries. For instance, it is possible to replace Euclidean distance by the value of a Beckman–Quarles theorems have been proven for non-Euclidean spaces such as inversive distance in the finite and spaces defined over fields with nonzero Additionally, theorems of this type have been used to characterize transformations other than the isometries, such as
History
The Beckman–Quarles theorem was first published by Frank S. Beckman and Donald A. Quarles Jr. in 1953. It was already named as "a theorem of Beckman and Quarles" as early as 1960, by Victor Klee. It was later rediscovered by other authors, through the 1960s and
Quarles was the son of communications engineer and defense executive Donald A. Quarles. He was educated at the Phillips Academy, Yale University, and the United States Naval Academy. He served as a meteorologist in the US Navy during World War II, and became an engineer for IBM. His work there included projects for tracking Sputnik, the development of a supercomputer, inkjet printing, and magnetic resonance imaging; he completed a Ph.D. in 1964 at the Courant Institute of Mathematical Sciences on the computer simulation of shock waves, jointly supervised by Robert D. Richtmyer and Peter Lax.
Beckman studied at the City College of New York and served in the US Army during the war. Like Quarles, he worked for IBM, beginning in 1951. He earned a Ph.D. in 1965, under the supervision of Louis Nirenberg at Columbia University, on partial differential equations. In 1971, he left IBM to become the founding chair of the Computer and Information Science Department at Brooklyn College, and he later directed the graduate program in computer science at the Graduate Center, CUNY.
References
Euclidean geometry
Metric geometry
Theorems in geometry
Mathematics of rigidity
|
```markdown
## Adaptive optimizers
In this seminar you will implement a logistic regression and train it using stochastic gradient descent modiffications, numpy and your brain.```
```python
#load our dakka
import numpy as np
%matplotlib inline
import matplotlib.pyplot as plt
```
```markdown
## Two-dimensional classification
To make things more intuitive, let's solve a 2D classification problem with syntetic data.```
```python
from sklearn import datasets, preprocessing
(X, y) = datasets.make_circles(n_samples=1024, shuffle=True, noise=0.2, factor=0.4)
ind = np.logical_or(y==1, X[:,1] > X[:,0] - 0.5)
X = X[ind,:]
m = np.array([[1, 1], [-2, 1]])
X = preprocessing.scale(X)
y = y[ind]
plt.scatter(X[:, 0], X[:, 1], c=y, cmap=plt.cm.Paired)
plt.show()
```
```python
print("X:
{}
y:
{}".format(X[:3],y[:3]))
```
```markdown
**Your task starts here**
Since the problem above isn't linearly separable, we add quadratic features to the classifier.
Implement this transformation in the __expand__ function __[1 point]__. ```
```python
def expand(X):
"""
Adds quadratic features.
This function allows your linear model to make non-linear separation.
For each sample (row in matrix), compute an expanded row:
[feature0, feature1, feature0^2, feature1^2, feature1*feature2, 1]
:param X: matrix of features, shape [n_samples,2]
:returns: expanded features of shape [n_samples,6]
"""
X_expanded = np.zeros((X.shape[0], 6))
<your code here>
return X_expanded
```
```python
#simple test on random numbers
#[all 8 random numbers are 100% random :P]
dummy_X = np.array([
[0,0],
[1,0],
[2.61,-1.28],
[-0.59,2.1]
])
#call your expand function
dummy_expanded = expand(dummy_X)
#what it should have returned: x0 x1 x0^2 x1^2 x0*x1 1
dummy_expanded_ans = np.array([[ 0. , 0. , 0. , 0. , 0. , 1. ],
[ 1. , 0. , 1. , 0. , 0. , 1. ],
[ 2.61 , -1.28 , 6.8121, 1.6384, -3.3408, 1. ],
[-0.59 , 2.1 , 0.3481, 4.41 , -1.239 , 1. ]])
#tests
assert isinstance(dummy_expanded,np.ndarray), "please make sure you return numpy array"
assert dummy_expanded.shape==dummy_expanded_ans.shape, "please make sure your shape is correct"
assert np.allclose(dummy_expanded,dummy_expanded_ans,1e-3), "Something's out of order with features"
print("Seems legit!")
```
```markdown
### Logistic regression (4 pts)
Now, let's write function that predicts class given X as in logistic regression.
The math should look like this:
$$ P(y| \vec x, \vec w) = \sigma(\vec x \cdot \vec w )$$
where x represents features, w are weights and $$\sigma(a) = {1 \over {1+e^{-a}}}$$
We shall omit $ \vec {arrows} $ in further formulae for simplicity.```
```python
def classify(X, w):
"""
Given input features and weights
return predicted probabilities of y==1 given x, P(y=1|x), see description above
__don't forget to expand X inside classify and other functions__
:param X: feature matrix X of shape [n_samples,2] (non-exanded)
:param w: weight vector w of shape [6] for each of the expanded features
:returns: an array of predicted probabilities in [0,1] interval.
"""
return <your code here>
```
```python
#sample usage / test just as the previous one
dummy_weights = np.linspace(-1,1,6)
dummy_probs = classify(dummy_X,dummy_weights)
dummy_answers = np.array([ 0.73105858, 0.450166 , 0.02020883, 0.59844257])
assert isinstance(dummy_probs,np.ndarray), "please return np.array"
assert dummy_probs.shape == dummy_answers.shape, "please return an 1-d vector with answers for each object"
assert np.allclose(dummy_probs,dummy_answers,1e-3), "There's something non-canonic about how probabilties are computed"
```
```markdown
The loss you should try to minimize is the Logistic Loss aka crossentropy aka negative log-likelihood:
$$ L = - {1 \over N} \sum_i {y_i \cdot log P(y_i|x_i,w) + (1-y_i) \cdot log (1-P(y_i|x_i,w))}$$
```
```python
def compute_loss(X, y, w):
"""
Given feature matrix X [n_samples,2], target vector y [n_samples] of +1/0,
and weight vector w [6], compute scalar loss function using formula above.
"""
return <your code here>
```
```python
dummy_y = np.array([0,1,0,1])
dummy_loss = compute_loss(dummy_X,dummy_y,dummy_weights)
assert np.allclose(dummy_loss,0.66131), "something wrong with loss"
```
```markdown
Since we train our model with gradient descent, we gotta compute gradients.
To be specific, we need a derivative of loss function over each weight [6 of them].
$$ \nabla L = {\partial L \over \partial w} = ...$$
No, we won't be giving you the exact formula this time. Instead, try figuring out a derivative with pen and paper.
As usual, we've made a small test for you, but if you need more, feel free to check your math against finite differences (estimate how L changes if you shift w by $10^{-5}$ or so).```
```python
def compute_grad(X, y, w):
"""
Given feature matrix X [n_samples,2], target vector y [n_samples] of +1/0,
and weight vector w [6], compute vector [6] of derivatives of L over each weights.
"""
return <your code here>
```
```python
#tests
dummy_grads = compute_grad(dummy_X,dummy_y,dummy_weights)
#correct answers in canonic form
dummy_grads_ans = np.array([-0.06504252, -0.21728448, -0.1379879 , -0.43443953, 0.107504 , -0.05003101])
assert isinstance(dummy_grads,np.ndarray)
assert dummy_grads.shape == (6,), "must return a vector of gradients for each weight"
assert len(set(np.round(dummy_grads/dummy_grads_ans,3))), "gradients are wrong"
assert np.allclose(dummy_grads,dummy_grads_ans,1e-3), "gradients are off by a coefficient"
```
```markdown
Here's an auxiliary function that visualizes the predictions```
```python
from IPython import display
h = 0.01
x_min, x_max = X[:, 0].min() - 1, X[:, 0].max() + 1
y_min, y_max = X[:, 1].min() - 1, X[:, 1].max() + 1
xx, yy = np.meshgrid(np.arange(x_min, x_max, h), np.arange(y_min, y_max, h))
def visualize(X, y, w, history):
"""draws classifier prediction with matplotlib magic"""
Z = classify(np.c_[xx.ravel(), yy.ravel()], w)
Z = Z.reshape(xx.shape)
plt.subplot(1,2,1)
plt.contourf(xx, yy, Z, alpha=0.8)
plt.scatter(X[:, 0], X[:, 1], c=y, cmap=plt.cm.Paired)
plt.xlim(xx.min(), xx.max())
plt.ylim(yy.min(), yy.max())
plt.subplot(1,2,2)
plt.plot(history)
plt.grid()
ymin, ymax = plt.ylim()
plt.ylim(0, ymax)
display.clear_output(wait=True)
plt.show()
```
```python
visualize(X,y,dummy_weights,[1,0.5,0.25],)
```
```markdown
### Training [1 point]
In this section, we'll use the functions you wrote to train our classifier using stochastic gradient descent.
Try to find an optimal learning rate for gradient descent for the given batch size.
**Don't change the batch size!**```
```python
w = np.array([0,0,0,0,0,1])
alpha = <learning rate>
n_iter = 50
batch_size = 4
loss = np.zeros(n_iter)
plt.figure(figsize=(12,5))
for i in range(n_iter):
ind = np.random.choice(X.shape[0], batch_size)
loss[i] = compute_loss(X, y, w)
visualize(X[ind,:], y[ind], w, loss)
w = w - alpha * compute_grad(X[ind,:], y[ind], w)
visualize(X, y, w, loss)
plt.clf()
```
```markdown
Implement gradient descent with momentum and test it's performance for different learning rate and momentum values. __[2 points]__```
```python
w = np.array([0,0,0,0,0,1])
alpha = 0.0 # learning rate. Please change.
mu = 0.0 # momentum. Please change.
n_iter = 50
batch_size = 4
loss = np.zeros(n_iter)
plt.figure(figsize=(12,5))
for i in range(n_iter):
ind = np.random.choice(X.shape[0], batch_size)
loss[i] = compute_loss(X, y, w)
visualize(X[ind,:], y[ind], w, loss)
<update w and anything else here>
visualize(X, y, w, loss)
plt.clf()
```
```markdown
Implement RMSPROP algorithm __[2 points]__
```
```python
w = np.array([0,0,0,0,0,1])
alpha = 0.0 # learning rate. Please change.
mean_squared_norm = 0.0 #moving average of gradient norm squared. Please change.
n_iter = 50
batch_size = 4
loss = np.zeros(n_iter)
plt.figure(figsize=(12,5))
for i in range(n_iter):
ind = np.random.choice(X.shape[0], batch_size)
loss[i] = compute_loss(X, y, w)
visualize(X[ind,:], y[ind], w, loss)
<update w and anything else here>
visualize(X, y, w, loss)
plt.clf()
```
```markdown
Which optimization method you consider the best? Type your answer in the cell below```
```markdown
```
```markdown
# Bonus quest
Try the same thing for Adagrad, Adam and anything else you find suitable.
_Each new adaptive optimizer is worth 2 points!_```
```python
```
|
Advanced Placement (AP) German Language and Culture (also known as AP German Language or AP German) is a course and examination provided by the College Board through the Advanced Placement Program. This course is designed to give high school students the opportunity to receive credit in a college-level German language course. It is generally taken in the fourth year of high school German study.
Exam
The AP German Language and Culture exam administered around the end of the academic year is split into two parts, a multiple choice section and a free response section, each with equal value in the overall exam score.
Format
Grade distribution
The grade distributions for the AP German Language and Culture exam since 2012 are:
AP German Literature
The College Board originally offered two AP German exams: AP German Language and AP German Literature. However, in 1983, due to the persistently low number of AP German Literature exam students, the College Board dropped the Literature exam. Since then, they have offered only the AP German Language exam.
References
External links
German Language and Culture at CollegeBoard.com
German language in the United States
Advanced Placement
German-language education
|
```yaml
apiVersion: rbac.authorization.k8s.io/v1
kind: ClusterRole
metadata:
name: strimzi-drain-cleaner
labels:
app: strimzi-drain-cleaner
rules:
# Drain Cleaner needs to be able to get the Kafka or ZooKeeper pods that are being evicted and patch them with the
# annotation which tells Strimzi Cluster Operator to roll the Pod
- apiGroups:
- ""
resources:
- pods
verbs:
- get
- patch
```
|
Worta J. McCaskill-Stevens is an American physician-scientist and medical oncologist specialized in cancer disparities research, management of comorbidities within clinical trials, and molecular research for cancer prevention interventions. She is chief of the community oncology and prevention trials research group at the National Cancer Institute.
Early life and education
McCaskill-Stevens was born in Louisburg, North Carolina. She attended Washington University in St. Louis and the American College of Switzerland. McCaskill-Stevens worked as an intern for Time and as a medical editor for Marcel Dekker and the Guttmacher Institute. At Georgetown University School of Medicine, she started medical school at the age of 30, earning a M.D. in 1985 and completing an internal medicine residency. McCaskill-Stevens did a medical oncology fellowship at the Mayo Clinic.
Career and research
McCaskill-Stevens, a medical oncologist, joined the National Cancer Institute (NCI) in 1998 as the program director for the study of tamoxifen and raloxifene (STAR), and assumed responsibilities for breast cancer prevention with the community clinical oncology program (CCOP). She chaired the 2009 National Institutes of Health (NIH) State-of-the Science Conference on ductal carcinoma in situ; is a member of the early breast cancer clinical trialist group in Oxford; and is a member of NCI’s breast cancer steering committee. McCaskill-Stevens co-directed the breast care and research center at the Indiana University Cancer Center.
McCaskill-Stevens is chief of the community oncology and prevention trials research group, which houses the NCI community oncology research program (NCORP), a community-based clinical trials network launched in 2014. As NCORP director, she oversees the program supporting community hospitals, physicians and others to participate in NCI-approved cancer treatment, prevention, screening, and control clinical trials, as well as cancer care delivery studies.
McCaskill-Stevens' interests include cancer disparities research both nationally and internationally, management of comorbidities within clinical trials and molecular research that helps to identify those individuals who will best benefit from cancer prevention interventions. She worked with the Study of Tamoxifen and Raloxifene (STAR), as the program director.
Awards and honors
In 2016, she was the recipient of the American Association for Cancer Research Jane Cooke Wright Memorial Lectureship. Her other honors and awards include: the Kaiser Family Fund Award for Excellence in Academic Achievement and Leadership in Medicine; Omega Alpha Medical Honor Society; the NIH Director’s Award for Clinical Trials; the NCI Merit Award for breast cancer prevention; and listed on Ebony’s 2013 Power 100 – Most Influential African Americans in Science and Health. In 2017, she received an honorary Doctor of Science from her alma mater, Georgetown University. McCaskill-Stevens was the recipient of the 2020 ACCC David King Community Clinical Scientist Award, from The Association of Community Cancer Centers (ACCC). Winners of the prestigious David King Award have "demonstrated leadership in the development, participation, and evaluation of clinical studies and/or are active in the development of new screening, risk assessment, treatment, or supportive care programs for cancer patients."
References
Living people
Year of birth missing (living people)
20th-century births
Washington University in St. Louis alumni
National Institutes of Health people
People from Louisburg, North Carolina
20th-century American women physicians
20th-century American women scientists
21st-century American women scientists
21st-century American women physicians
American oncologists
Women oncologists
Women medical researchers
American medical researchers
African-American women physicians
African-American physicians
African-American women scientists
Scientists from North Carolina
Physicians from North Carolina
Cancer researchers
20th-century American physicians
20th-century American scientists
21st-century American physicians
21st-century American scientists
Georgetown University School of Medicine alumni
|
```yaml
models:
- columns:
- name: id
tests:
- unique
- not_null
- relationships:
field: id
to: ref('node_0')
name: node_1301
version: 2
```
|
Sailing at the 2014 Summer Youth Olympics was held from 18 to 23 August at Jinniu Lake in Nanjing, China.
Qualification
Each National Olympic Committee (NOC) could enter a maximum of 4 boats, 1 per event. As hosts, China was given the maximum quota of 4, but since they did not compete in any of the qualification events, the spots were reallocated. An extra additional spot was created in the girls' Techno 293 event and given to China. A further 8, 2 in each event, was decided by the Tripartite Commission. The remaining 88 places were allocated based on qualification events, namely the 2013 World Championships and six continental qualification tournaments for each boat. If a country declined a spot or if there were spots that remained unfilled after the qualification event, the quota was reallocated to another nation, with priority going to nations that had not qualified for any sailing events.
To be eligible to participate at the Youth Olympics athletes must have been born between 1 January 1998 and 31 December 1999.
Byte CII
Reallocation spot
Techno 293
Reallocation spot
Schedule
The schedule was released by the Nanjing Youth Olympic Games Organizing Committee.
All times are CST (UTC+8)
Medal summary
Medal table
Boys
Girls
References
External links
Official Results Book – Sailing
2014 Summer Youth Olympics events
Youth Summer Olympics
2014
Sailing competitions in China
|
```smalltalk
using Algorithms.Other;
using NUnit.Framework;
using System;
using System.Collections.Generic;
namespace Algorithms.Tests.Other;
public static class GaussOptimizationTest
{
[Test]
public static void Verify_Gauss_Optimization_Positive()
{
// Arrange
var gaussOptimization = new GaussOptimization();
// Declaration of the constants that are used in the function
var coefficients = new List<double> { 0.3, 0.6, 2.6, 0.3, 0.2, 1.4 };
// Description of the function
var func = (double x1, double x2) =>
{
if (x1 > 1 || x1 < 0 || x2 > 1 || x2 < 0)
{
return 0;
}
return coefficients[0] + coefficients[1] * x1 + coefficients[2] * x2 + coefficients[3] * x1 * x2 +
coefficients[4] * x1 * x1 + coefficients[5] * x2 * x2;
};
// The parameter that identifies how much step size will be decreased each iteration
double n = 2.4;
// Default values of x1 and x2. These values will be used for the calculation of the next
// coordinates by Gauss optimization method
double x1 = 0.5;
double x2 = 0.5;
// Default optimization step
double step = 0.5;
// This value is used to control the accuracy of the optimization. In case if the error is less
// than eps, optimization will be stopped
double eps = Math.Pow(0.1, 10);
// Act
(x1, x2) = gaussOptimization.Optimize(func, n, step, eps, x1, x2);
// Assert
Assert.That(x1, Is.EqualTo(1).Within(0.3));
Assert.That(x2, Is.EqualTo(1).Within(0.3));
}
[Test]
public static void Verify_Gauss_Optimization_Negative()
{
// Arrange
var gaussOptimization = new GaussOptimization();
// Declaration of the constants that are used in the function
var coefficients = new List<double> { -0.3, -0.6, -2.6, -0.3, -0.2, -1.4 };
// Description of the function
var func = (double x1, double x2) =>
{
if (x1 > 0 || x1 < -1 || x2 > 0 || x2 < -1)
{
return 0;
}
return coefficients[0] + coefficients[1] * x1 + coefficients[2] * x2 + coefficients[3] * x1 * x2 +
coefficients[4] * x1 * x1 + coefficients[5] * x2 * x2;
};
// The parameter that identifies how much step size will be decreased each iteration
double n = 2.4;
// Default values of x1 and x2. These values will be used for the calculation of the next
// coordinates by Gauss optimization method
double x1 = -0.5;
double x2 = -0.5;
// Default optimization step
double step = 0.5;
// This value is used to control the accuracy of the optimization. In case if the error is less
// than eps, optimization will be stopped
double eps = Math.Pow(0.1, 10);
// Act
(x1, x2) = gaussOptimization.Optimize(func, n, step, eps, x1, x2);
// Assert
Assert.That(x1, Is.EqualTo(-1).Within(0.3));
Assert.That(x2, Is.EqualTo(-1).Within(0.3));
}
}
```
|
Ben Gastauer (born 14 November 1987) is a Luxembourgish former professional road cyclist, who rode professionally for the between 2010 and 2021.
He took three professional victories during his career: the Luxembourgish National Time Trial Championships in 2012, and the general classification and a stage at the 2015 Tour du Haut Var. He was part of the squad that won the team classification and delivered Jean-Christophe Péraud to the podium at the 2014 Tour de France, and part of those which assisted Romain Bardet to podium finishes at the 2016 Tour de France and the 2017 Tour de France. In August 2021 the announced that Gastauer would retire from competition at the end of the season due to a problem with his pelvic floor, finishing his career at the 2021 Tour de Luxembourg the following month.
Major results
Source:
2005
1st Time trial, National Junior Road Championships
2nd Classique des Alpes
10th Overall Grand Prix Rüebliland
2006
1st Road race, National Under-23 Road Championships
2007
1st Road race, National Under-23 Road Championships
5th Overall Grand Prix du Portugal
2008
1st Time trial, National Under-23 Road Championships
1st Ruota d'Oro
9th Overall Flèche du Sud
2009
National Under-23 Road Championships
1st Road race
1st Time trial
1st Overall Tour des Pays de Savoie
1st Points classification
1st Stage 1
2nd Overall Flèche du Sud
9th Giro del Mendrisiotto
2010
3rd Road race, National Road Championships
6th Overall Paris–Corrèze
2012
National Road Championships
1st Time trial
2nd Road race
2013
3rd Time trial, National Road Championships
2014
National Road Championships
2nd Road race
4th Time trial
2015
1st Overall Tour du Haut Var
1st Stage 1
National Road Championships
2nd Road race
4th Time trial
2016
1st Mountains classification, Tour du Haut Var
4th Road race, National Road Championships
2017
National Road Championships
3rd Road race
4th Time trial
2019
4th Time trial, National Road Championships
Grand Tour general classification results timeline
References
External links
Ben Gastauer profile at Ag2r-La Mondiale
1987 births
Living people
Luxembourgian male cyclists
People from Dudelange
|
```objective-c
#define ladderStepLeg \
addSub(x2,z2) \
addSub(x3,z3) \
integerMulLeg(b0,x2,z3) \
integerMulLeg(b1,x3,z2) \
reduceFromDoubleLeg(t0,b0) \
reduceFromDoubleLeg(t1,b1) \
addSub(t0,t1) \
cselect(x2,x3,regMove) \
cselect(z2,z3,regMove) \
integerSqrLeg(b0,t0) \
integerSqrLeg(b1,t1) \
reduceFromDoubleLeg(x3,b0) \
reduceFromDoubleLeg(z3,b1) \
integerMulLeg(b0,x1,z3) \
reduceFromDoubleLeg(z3,b0) \
integerSqrLeg(b0,x2) \
integerSqrLeg(b1,z2) \
reduceFromDoubleLeg(x2,b0) \
reduceFromDoubleLeg(z2,b1) \
subtraction(t0,x2,z2) \
multiplyA24Leg(t1,t0) \
additionLeg(t1,t1,z2) \
integerMulLeg(b0,x2,z2) \
integerMulLeg(b1,t0,t1) \
reduceFromDoubleLeg(x2,b0) \
reduceFromDoubleLeg(z2,b1)
#define ladderStepBmi2Adx \
addSub(x2,z2) \
addSub(x3,z3) \
integerMulAdx(b0,x2,z3) \
integerMulAdx(b1,x3,z2) \
reduceFromDoubleAdx(t0,b0) \
reduceFromDoubleAdx(t1,b1) \
addSub(t0,t1) \
cselect(x2,x3,regMove) \
cselect(z2,z3,regMove) \
integerSqrAdx(b0,t0) \
integerSqrAdx(b1,t1) \
reduceFromDoubleAdx(x3,b0) \
reduceFromDoubleAdx(z3,b1) \
integerMulAdx(b0,x1,z3) \
reduceFromDoubleAdx(z3,b0) \
integerSqrAdx(b0,x2) \
integerSqrAdx(b1,z2) \
reduceFromDoubleAdx(x2,b0) \
reduceFromDoubleAdx(z2,b1) \
subtraction(t0,x2,z2) \
multiplyA24Adx(t1,t0) \
additionAdx(t1,t1,z2) \
integerMulAdx(b0,x2,z2) \
integerMulAdx(b1,t0,t1) \
reduceFromDoubleAdx(x2,b0) \
reduceFromDoubleAdx(z2,b1)
#define difAddLeg \
addSub(x1,z1) \
integerMulLeg(b0,z1,ui) \
reduceFromDoubleLeg(z1,b0) \
addSub(x1,z1) \
integerSqrLeg(b0,x1) \
integerSqrLeg(b1,z1) \
reduceFromDoubleLeg(x1,b0) \
reduceFromDoubleLeg(z1,b1) \
integerMulLeg(b0,x1,z2) \
integerMulLeg(b1,z1,x2) \
reduceFromDoubleLeg(x1,b0) \
reduceFromDoubleLeg(z1,b1)
#define difAddBmi2Adx \
addSub(x1,z1) \
integerMulAdx(b0,z1,ui) \
reduceFromDoubleAdx(z1,b0) \
addSub(x1,z1) \
integerSqrAdx(b0,x1) \
integerSqrAdx(b1,z1) \
reduceFromDoubleAdx(x1,b0) \
reduceFromDoubleAdx(z1,b1) \
integerMulAdx(b0,x1,z2) \
integerMulAdx(b1,z1,x2) \
reduceFromDoubleAdx(x1,b0) \
reduceFromDoubleAdx(z1,b1)
#define doubleLeg \
addSub(x1,z1) \
integerSqrLeg(b0,x1) \
integerSqrLeg(b1,z1) \
reduceFromDoubleLeg(x1,b0) \
reduceFromDoubleLeg(z1,b1) \
subtraction(t0,x1,z1) \
multiplyA24Leg(t1,t0) \
additionLeg(t1,t1,z1) \
integerMulLeg(b0,x1,z1) \
integerMulLeg(b1,t0,t1) \
reduceFromDoubleLeg(x1,b0) \
reduceFromDoubleLeg(z1,b1)
#define doubleBmi2Adx \
addSub(x1,z1) \
integerSqrAdx(b0,x1) \
integerSqrAdx(b1,z1) \
reduceFromDoubleAdx(x1,b0) \
reduceFromDoubleAdx(z1,b1) \
subtraction(t0,x1,z1) \
multiplyA24Adx(t1,t0) \
additionAdx(t1,t1,z1) \
integerMulAdx(b0,x1,z1) \
integerMulAdx(b1,t0,t1) \
reduceFromDoubleAdx(x1,b0) \
reduceFromDoubleAdx(z1,b1)
```
|
```smalltalk
using System.Collections.Generic;
using Ductus.FluentDocker.Model.Containers;
using Ductus.FluentDocker.Model.Images;
using Ductus.FluentDocker.Extensions;
namespace Ductus.FluentDocker.Executors.Parsers
{
public sealed class ClientImagesResponseParser : IProcessResponseParser<IList<DockerImageRowResponse>>
{
public CommandResponse<IList<DockerImageRowResponse>> Response { get; private set; }
public IProcessResponse<IList<DockerImageRowResponse>> Process(ProcessExecutionResult response)
{
if (response.ExitCode != 0)
{
Response = response.ToErrorResponse((IList<DockerImageRowResponse>)new List<DockerImageRowResponse>());
return this;
}
var list = new List<DockerImageRowResponse>();
foreach (var row in response.StdOutAsArray)
{
var items = row.Split(';');
if (items.Length != 3)
{
continue;
}
list.Add(new DockerImageRowResponse
{
Id = items[0].ToPlainId(),
Name = items[1],
Tags = new[] { items[2] }
});
}
Response = response.ToResponse(true, string.Empty, (IList<DockerImageRowResponse>)list);
return this;
}
}
}
```
|
```php
<?php
/*
*
* File ini bagian dari:
*
* OpenSID
*
* Sistem informasi desa sumber terbuka untuk memajukan desa
*
* Aplikasi dan source code ini dirilis berdasarkan lisensi GPL V3
*
* Hak Cipta 2009 - 2015 Combine Resource Institution (path_to_url
* Hak Cipta 2016 - 2024 Perkumpulan Desa Digital Terbuka (path_to_url
*
* Dengan ini diberikan izin, secara gratis, kepada siapa pun yang mendapatkan salinan
* dari perangkat lunak ini dan file dokumentasi terkait ("Aplikasi Ini"), untuk diperlakukan
* tanpa batasan, termasuk hak untuk menggunakan, menyalin, mengubah dan/atau mendistribusikan,
* asal tunduk pada syarat berikut:
*
* Pemberitahuan hak cipta di atas dan pemberitahuan izin ini harus disertakan dalam
* setiap salinan atau bagian penting Aplikasi Ini. Barang siapa yang menghapus atau menghilangkan
* pemberitahuan ini melanggar ketentuan lisensi Aplikasi Ini.
*
* PERANGKAT LUNAK INI DISEDIAKAN "SEBAGAIMANA ADANYA", TANPA JAMINAN APA PUN, BAIK TERSURAT MAUPUN
* TERSIRAT. PENULIS ATAU PEMEGANG HAK CIPTA SAMA SEKALI TIDAK BERTANGGUNG JAWAB ATAS KLAIM, KERUSAKAN ATAU
* KEWAJIBAN APAPUN ATAS PENGGUNAAN ATAU LAINNYA TERKAIT APLIKASI INI.
*
* @package OpenSID
* @author Tim Pengembang OpenDesa
* @copyright Hak Cipta 2009 - 2015 Combine Resource Institution (path_to_url
* @copyright Hak Cipta 2016 - 2024 Perkumpulan Desa Digital Terbuka (path_to_url
* @license path_to_url GPL V3
* @link path_to_url
*
*/
namespace App\Models;
defined('BASEPATH') || exit('No direct script access allowed');
class RefDokumen extends BaseModel
{
/**
* The table associated with the model.
*
* @var string
*/
protected $table = 'ref_dokumen';
/**
* The fillable with the model.
*
* @var array
*/
protected $fillable = [
'nama',
];
}
```
|
Héléindjé-Salimani-Zounda is a village on the island of Grande Comore (Ngazidja) in the Comoros. According to the 1991 census, the village had a population of 1157.
References
Populated places in Grande Comore
|
```smalltalk
using System.ComponentModel;
namespace ScreenToGif.Domain.Enums;
public enum RateUnits
{
[Description("B")]
Bits,
[Description("K")]
Kilobits,
[Description("M")]
Megabits
}
```
|
```liquid
<div class="news">
{% if site.latest_posts != blank %}
{% assign latest_posts_size = site.posts | size %}
<div
class="table-responsive"
{% if site.latest_posts.scrollable and latest_posts_size > 3 %}
style="max-height: 60vw"
{% endif %}
>
<table class="table table-sm table-borderless">
{% assign latest_posts = site.posts %}
{% if site.latest_posts.limit %}
{% assign latest_posts_limit = site.latest_posts.limit %}
{% else %}
{% assign latest_posts_limit = latest_posts_size %}
{% endif %}
{% for item in latest_posts limit: latest_posts_limit %}
<tr>
<th scope="row" style="width: 20%">{{ item.date | date: '%b %d, %Y' }}</th>
<td>
{% if item.redirect == blank %}
<a class="news-title" href="{{ item.url | relative_url }}">{{ item.title }}</a>
{% elsif item.redirect contains '://' %}
<a class="news-title" href="{{ item.redirect }}" target="_blank">{{ item.title }}</a>
<svg width="2rem" height="2rem" viewBox="0 0 40 40" xmlns="path_to_url">
<path
d="M17 13.5v6H5v-12h6m3-3h6v6m0-6-9 9"
class="icon_svg-stroke"
stroke="#999"
stroke-width="1.5"
fill="none"
fill-rule="evenodd"
stroke-linecap="round"
stroke-linejoin="round"
></path>
</svg>
{% else %}
<a class="news-title" href="{{ item.redirect | relative_url }}">{{ item.title }}</a>
{% endif %}
</td>
</tr>
{% endfor %}
</table>
</div>
{% else %}
<p>No posts so far...</p>
{% endif %}
</div>
```
|
```javascript
"use strict";
module.exports = function (column, ascending) {
var sendRequest = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : true;
this.orderBy.column = column;
this.orderBy.ascending = ascending;
this.updateState('orderBy', {
column: column,
ascending: ascending
});
if (this.source == 'server' && sendRequest) {
this.getData();
}
};
```
|
```php
<?php
/*
|your_sha256_hash----------
| Web Routes
|your_sha256_hash----------
|
| This file is where you may define all of the routes that are handled
| by your application. Just tell Laravel the URIs it should respond
| to using a Closure or controller method. Build something great!
|
*/
Route::get('/', function () {
return redirect()->route('auth.login');
})->name('home');
Route::get('/dashboard', 'Web\UserController@dashboard')->name('user.dashboard')->middleware('user.authenticated', 'product-backlog');
Route::get('/profile/{username}', 'Web\UserController@show')->name('user.profile')->middleware('user.authenticated');
Route::group(['prefix' => 'auth'], function () {
Route::get('/register', 'Web\AuthController@register')->name('auth.register');
Route::get('/login', 'Web\AuthController@login')->name('auth.login');
Route::get('/dologin', 'Web\AuthController@dologin')->name('auth.dologin');
Route::get('/provider/{provider}', 'Web\AuthController@redirectToProvider')->name('auth.provider');
Route::get('/provider/{provider}/callback', 'Web\AuthController@handleProviderCallback');
Route::post('/provider/gitea/token', 'Web\AuthGiteaController@handleProviderCallback')->name('auth.gitea');
Route::get('/logout', 'Web\AuthController@logout')->name('auth.logout');
});
Route::group(['prefix' => 'product-backlogs', 'middleware' => ['user.authenticated']], function () {
Route::get('/list/{mode?}', 'Web\ProductBacklogController@index')->name('product_backlogs.index');
Route::get('/show/{slug}', 'Web\ProductBacklogController@show')->name('product_backlogs.show');
Route::get('/create', 'Web\ProductBacklogController@create')->name('product_backlogs.create');
Route::post('/store', 'Web\ProductBacklogController@store')->name('product_backlogs.store');
Route::get('/edit/{slug}', 'Web\ProductBacklogController@edit')->name('product_backlogs.edit');
Route::post('/update/{slug}', 'Web\ProductBacklogController@update')->name('product_backlogs.update');
});
Route::group(['prefix' => 'sprints', 'middleware' => ['user.authenticated', 'sprint.expired', 'global.activities']], function () {
Route::get('/planning/{slug}/issues', 'Web\IssueController@index')->name('issues.index');
Route::get('/list/{mode?}/{slug_product_backlog?}', 'Web\SprintController@index')->name('sprints.index');
Route::get('/show/{slug}', 'Web\SprintController@show')->name('sprints.show');
Route::get('/create/{slug_product_backlog?}', 'Web\SprintController@create')->name('sprints.create');
Route::post('/store', 'Web\SprintController@store')->name('sprints.store');
Route::get('/edit/{slug}', 'Web\SprintController@edit')->name('sprints.edit');
Route::post('/update/{slug}', 'Web\SprintController@update')->name('sprints.update');
Route::delete('/destroy', 'Web\SprintController@destroy')->name('sprints.destroy');
Route::any('/status-update/{slug?}/{status?}', 'Web\SprintController@statusUpdate')->name('sprints.status.update');
});
Route::group(['prefix' => 'user-stories', 'middleware' => ['user.authenticated']], function () {
Route::get('/list', 'Web\UserStoryController@index')->name('user_stories.index');
Route::get('/show/{slug}', 'Web\UserStoryController@show')->name('user_stories.show');
Route::get('/create/{slug_product_backlog?}', 'Web\UserStoryController@create')->name('user_stories.create');
Route::post('/store', 'Web\UserStoryController@store')->name('user_stories.store');
Route::get('/edit/{slug}', 'Web\UserStoryController@edit')->name('user_stories.edit');
Route::delete('/destroy', 'Web\UserStoryController@destroy')->name('user_stories.destroy');
Route::post('/update/{slug}', 'Web\UserStoryController@update')->name('user_stories.update');
});
Route::group(['prefix' => 'issues', 'middleware' => ['user.authenticated', 'issue']], function () {
Route::get('/show/{slug}', 'Web\IssueController@show')->name('issues.show');
Route::get('/create/{scope}/{slug}/{parent_id?}', 'Web\IssueController@create')->name('issues.create');
Route::post('/store', 'Web\IssueController@store')->name('issues.store');
Route::get('/edit/{slug}', 'Web\IssueController@edit')->name('issues.edit');
Route::post('/update/{slug}', 'Web\IssueController@update')->name('issues.update');
Route::delete('/destroy', 'Web\IssueController@destroy')->name('issues.destroy');
Route::any('/status-update/{slug?}/{status?}', 'Web\IssueController@statusUpdate')->name('issues.status.update');
});
Route::group(['prefix' => 'user-issue', 'middleware' => ['user.authenticated']], function () {
Route::get('/list/{username}/{slug_type?}/{mode?}', 'Web\UserIssueController@index')->name('user_issue.index');
Route::post('/update/{slug}', 'Web\UserIssueController@update')->name('user_issue.update');
});
Route::group(['prefix' => 'issue-types', 'middleware' => ['user.authenticated']], function () {
Route::get('/sprint/{slug_sprint}/{slug_type?}', 'Web\IssueTypeController@index')->name('issue_types.index');
});
Route::group(['prefix' => 'commits', 'middleware' => ['user.authenticated']], function () {
Route::get('/show/{sha}', 'Web\CommitController@show')->name('commits.show');
});
Route::group(['prefix' => 'notes', 'middleware' => ['user.authenticated']], function () {
Route::get('/--------', 'Web\NoteController@store')->name('notes.show');
Route::post('/store', 'Web\NoteController@store')->name('notes.store');
Route::get('/update/{slug}', 'Web\NoteController@update')->name('notes.update');
Route::get('/destroy/{id}', 'Web\NoteController@destroy')->name('notes.destroy');
});
Route::group(['prefix' => 'comments', 'middleware' => ['user.authenticated']], function () {
Route::get('/--------', 'Web\CommentController@store')->name('comments.show');
Route::get('/edit/{id}', 'Web\CommentController@edit')->name('comments.edit');
Route::post('/update/{id}', 'Web\CommentController@update')->name('comments.update');
Route::post('/store', 'Web\CommentController@store')->name('comments.store');
Route::get('/destroy/{id}', 'Web\CommentController@destroy')->name('comments.destroy');
});
Route::group(['prefix' => 'labels', 'middleware' => ['user.authenticated']], function () {
Route::get('/--------', 'Web\LabelController@store')->name('labels.show');
Route::get('/{model}/{slug_label?}', 'Web\LabelController@index')->name('labels.index');
Route::post('/store', 'Web\LabelController@store')->name('labels.store');
});
Route::group(['prefix' => 'favorites', 'middleware' => ['user.authenticated']], function () {
Route::get('/store/{type}/{id}', 'Web\FavoriteController@store')->name('favorites.store');
Route::get('/destroy/{type}/{id}', 'Web\FavoriteController@destroy')->name('favorites.destroy');
});
Route::group(['prefix' => 'attachments'], function () {
Route::get('/--------', 'Web\AttachmentController@store')->name('attachments.show');
Route::post('/store', 'Web\AttachmentController@store')->name('attachments.store');
});
Route::group(['prefix' => 'teams', 'middleware' => ['user.authenticated']], function () {
Route::get('/members', 'Web\TeamController@index')->name('team.index');
});
Route::group(['prefix' => 'wizard', 'middleware' => ['user.authenticated']], function () {
Route::get('/install', 'Web\WizardController@install')->name('wizard.install');
Route::get('/step1', 'Web\WizardController@step1')->name('wizard.step1');
Route::any('/step2', 'Web\WizardController@step2')->name('wizard.step2');
Route::get('/step3', 'Web\WizardController@step3')->name('wizard.step3');
});
Route::put('/slack', 'Web\SlackUserController@update')->name('slack.update')->middleware('user.authenticated');
```
|
```yaml
layer_wise_distillation:
num_steps: 30000
warmup_steps: 0
initial_learning_rate: 1.5e-3
end_learning_rate: 1.5e-3
decay_steps: 30000
end_to_end_distillation:
num_steps: 585000
warmup_steps: 20000
initial_learning_rate: 1.5e-3
end_learning_rate: 1.5e-7
decay_steps: 585000
distill_ground_truth_ratio: 0.5
optimizer:
optimizer:
lamb:
beta_1: 0.9
beta_2: 0.999
clipnorm: 1.0
epsilon: 1.0e-06
exclude_from_layer_adaptation: null
exclude_from_weight_decay: ['LayerNorm', 'bias', 'norm']
global_clipnorm: null
name: LAMB
weight_decay_rate: 0.01
type: lamb
orbit_config:
eval_interval: 1000
eval_steps: -1
mode: train
steps_per_loop: 1000
total_steps: 825000
runtime:
distribution_strategy: 'tpu'
student_model:
cls_heads: [{'activation': 'tanh',
'cls_token_idx': 0,
'dropout_rate': 0.0,
'inner_dim': 512,
'name': 'next_sentence',
'num_classes': 2}]
encoder:
mobilebert:
attention_probs_dropout_prob: 0.1
classifier_activation: false
hidden_activation: relu
hidden_dropout_prob: 0.0
hidden_size: 512
initializer_range: 0.02
input_mask_dtype: int32
intermediate_size: 1024
intra_bottleneck_size: 128
key_query_shared_bottleneck: true
max_sequence_length: 512
normalization_type: no_norm
num_attention_heads: 4
num_blocks: 6
num_feedforward_networks: 2
type_vocab_size: 2
use_bottleneck_attention: false
word_embed_size: 128
word_vocab_size: 30522
type: mobilebert
mlm_activation: relu
mlm_initializer_range: 0.02
mlm_output_weights_use_proj: true
teacher_model:
cls_heads: []
encoder:
mobilebert:
attention_probs_dropout_prob: 0.1
classifier_activation: false
hidden_activation: gelu
hidden_dropout_prob: 0.1
hidden_size: 512
initializer_range: 0.02
input_mask_dtype: int32
intermediate_size: 4096
intra_bottleneck_size: 1024
key_query_shared_bottleneck: false
max_sequence_length: 512
normalization_type: layer_norm
num_attention_heads: 4
num_blocks: 24
num_feedforward_networks: 1
type_vocab_size: 2
use_bottleneck_attention: false
word_embed_size: 128
word_vocab_size: 30522
type: mobilebert
mlm_activation: gelu
mlm_initializer_range: 0.02
teacher_model_init_checkpoint: gs://**/uncased_L-24_H-1024_B-512_A-4_teacher/tf2_checkpoint/bert_model.ckpt-1
student_model_init_checkpoint: ''
train_datasest:
block_length: 1
cache: false
cycle_length: null
deterministic: null
drop_remainder: true
enable_tf_data_service: false
global_batch_size: 2048
input_path: gs://**/seq_512_mask_20/wikipedia.tfrecord*,gs://**/seq_512_mask_20/books.tfrecord*
is_training: true
max_predictions_per_seq: 20
seq_length: 512
sharding: true
shuffle_buffer_size: 100
tf_data_service_address: null
tf_data_service_job_name: null
tfds_as_supervised: false
tfds_data_dir: ''
tfds_name: ''
tfds_skip_decoding_feature: ''
tfds_split: ''
use_next_sentence_label: true
use_position_id: false
use_v2_feature_names: false
eval_dataset:
block_length: 1
cache: false
cycle_length: null
deterministic: null
drop_remainder: true
enable_tf_data_service: false
global_batch_size: 2048
input_path: gs://**/seq_512_mask_20/wikipedia.tfrecord-00141-of-00500,gs://**/seq_512_mask_20/books.tfrecord-00141-of-00500
is_training: false
max_predictions_per_seq: 20
seq_length: 512
sharding: true
shuffle_buffer_size: 100
tf_data_service_address: null
tf_data_service_job_name: null
tfds_as_supervised: false
tfds_data_dir: ''
tfds_name: ''
tfds_skip_decoding_feature: ''
tfds_split: ''
use_next_sentence_label: true
use_position_id: false
use_v2_feature_names: false
```
|
```c++
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
//
// path_to_url
//
// Unless required by applicable law or agreed to in writing,
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
// specific language governing permissions and limitations
#include "arrow/flight/transport/ucx/ucx.h"
#include <mutex>
#include "arrow/flight/transport.h"
#include "arrow/flight/transport/ucx/ucx_internal.h"
#include "arrow/flight/transport_server.h"
#include "arrow/util/logging.h"
namespace arrow {
namespace flight {
namespace transport {
namespace ucx {
namespace {
std::once_flag kInitializeOnce;
}
void InitializeFlightUcx() {
std::call_once(kInitializeOnce, []() {
auto* registry = flight::internal::GetDefaultTransportRegistry();
DCHECK_OK(registry->RegisterClient("ucx", MakeUcxClientImpl));
DCHECK_OK(registry->RegisterServer("ucx", MakeUcxServerImpl));
});
}
} // namespace ucx
} // namespace transport
} // namespace flight
} // namespace arrow
```
|
The Earagail Arts Festival () is an annual festival which takes place in County Donegal, Ireland, every June or July. The festival began in June 1988.
The Festival includes parades, street performances and numerous plays, musical concerts and comedy acts in towns and villages across County Donegal. Letterkenny is at the centre of the festival with various venues such as An Grianán Theatre, Letterkenny Regional Cultural Centre and Donegal County Museum in the town hosting events. Many events take place in other towns and villages throughout Donegal, including Ballybofey, Gweedore, Inishowen, Falcarragh and Creeslough.
It also runs events in tourist attractions around Donegal itself. Drive-in movies at Downings Beach and at Ards Forest Park have been sell-outs in past years and the natural landscape of Glenveagh, Errigal, the Muckish and Aghla mountains, Tory Island and Magheraroarty Beach all form regular backdrops to the festival programme.
Festivals
Acts
The line-up for the 2001 festival included The Undertones, Richard Thompson, John Herald, Johnny Vegas, Phil Kay, Louis de Paor, The Wrigley Sisters, Dan Crary and Beppe Gambetta.
The line-up for the 2002 festival included Mory Kanté, Lambchop, Gail Davies, Hazel O'Connor and Adam Hills.
The line-up for the 2003 festival included Roy Hargrove, Mickey Harte, The Revs, Cathal Ó Searcaigh and Henry McCullough.
The line-up for the 2004 festival included David Strassman, Bob Geldof and Andy Irvine.
The line-up for the 2005 festival included The Saw Doctors, Kathryn Williams, Richie Havens and Pierce Turner.
The line-up for the 2006 festival included John Nee, Joanna MacGregor, Eddi Reader, Ukulele Orchestra of Great Britain and Kíla.
The line-up for the 2007 festival included The Skatalites, Patrick Street, Seth Lakeman, Declan O'Rourke and the RTÉ Vanbrugh Quartet.
The 2008 festival was officially launched at the Grill Music Venue. The line-up for the festival included Dave Geraghty, Altan, Donal Lunny, Liam Ó Maonlaí and Lisa Hannigan.
The 2009 Festival was launched in The Ramada Encore Hotel (now The Station House Hotel) on the Oldtown Road in Letterkenny. Launched on 2 June, it ran from 4 to 19 July. Highlights included The Festival Carnival Parade and Village Fete in Letterkenny on 12 July, Quarterdeck, The Stunning, Mary Black, The Henry Girls, Bassekou Kouate and The Hot 8 Brass Band.
The line-up for 2010's festival included Diving Comedy, Duke Special, The Villagers, Jerry Fish and The Pyros.
The 2012 festival featured We Cut Corners, LUXe, Love All, Dave Alvin and Bui Bolg.
The 2013 festival was the Earagail Arts Festival's 25th birthday. It included Josh Ritter, Backyard Devils, Clannad, Altan, Fidil, The Henry Girls & An Cosan Glas, Out to Lunch, In Their Thousands and LUXe.
The 2014 festival will feature Sharon Shannon, Frances Black and Mary Coughlan, Bombino, Eduardo Niebla, Melting Pod, Fishamble, LUXe, North West Opera, IMRAM, Dante or Die, and many other performances, exhibitions, workshops and drive-in films.
Funding
In 2011, the Arts Festival was principally funded by The Arts Council, Donegal County Council and Fáilte Ireland. Additional funders included British Council Ireland, Office of Public Works, Údarás na Gaeltachta, Donegal Local Development, Department of community, Equality and Gaeltacht Affairs, European Union, Ealaín na Gaeltachta Teoranta, Leader +, Donegal County Council Public Art Programme and Letterkenny Town Council. The 2011 festival was also supported by sponsors.
References
External links
Official Website
Annual events in Ireland
Arts festivals in the Republic of Ireland
Culture in County Donegal
Culture in Letterkenny
Parades in Ireland
Tourist attractions in County Donegal
Summer events in the Republic of Ireland
|
Contamine-Sarzin (; ) is a commune in the Haute-Savoie department in the Auvergne-Rhône-Alpes region in south-eastern France.
See also
Communes of the Haute-Savoie department
References
Communes of Haute-Savoie
|
Cuneiform is an open-source workflow language
for large-scale scientific data analysis.
It is a statically typed functional programming language promoting parallel computing. It features a versatile foreign function interface allowing users to integrate software from many external programming languages. At the organizational level Cuneiform provides facilities like conditional branching and general recursion making it Turing-complete. In this, Cuneiform is the attempt to close the gap between scientific workflow systems like Taverna, KNIME, or Galaxy and large-scale data analysis programming models like MapReduce or Pig Latin while offering the generality of a functional programming language.
Cuneiform is implemented in distributed Erlang. If run in distributed mode it drives a POSIX-compliant distributed file system like Gluster or Ceph (or a FUSE integration of some other file system, e.g., HDFS). Alternatively, Cuneiform scripts can be executed on top of HTCondor or Hadoop.
Cuneiform is influenced by the work of Peter Kelly who proposes functional programming as a model for scientific workflow execution.
In this, Cuneiform is distinct from related workflow languages based on dataflow programming like Swift.
External software integration
External tools and libraries (e.g., R or Python libraries) are integrated via a foreign function interface. In this it resembles, e.g., KNIME which allows the use of external software through snippet nodes, or Taverna which offers BeanShell services for integrating Java software. By defining a task in a foreign language it is possible to use the API of an external tool or library. This way, tools can be integrated directly without the need of writing a wrapper or reimplementing the tool.
Currently supported foreign programming languages are:
Bash
Elixir
Erlang
Java
JavaScript
MATLAB
GNU Octave
Perl
Python
R
Racket
Foreign language support for AWK and gnuplot are planned additions.
Type System
Cuneiform provides a simple, statically checked type system. While Cuneiform provides lists as compound data types it omits traditional list accessors (head and tail) to avoid the possibility of runtime errors which might arise when accessing the empty list. Instead lists are accessed in an all-or-nothing fashion by only mapping or folding over them. Additionally, Cuneiform omits (at the organizational level) arithmetics which excludes the possibility of division by zero. The omission of any partially defined operation allows to guarantee that runtime errors can arise exclusively in foreign code.
Base data types
As base data types Cuneiform provides Booleans, strings, and files. Herein, files are used to exchange data in arbitrary format between foreign functions.
Records and pattern matching
Cuneiform provides records (structs) as compound data types. The example below shows the definition of a variable r being a record with two fields a1 and a2, the first being a string and the second being a Boolean.
let r : <a1 : Str, a2 : Bool> =
<a1 = "my string", a2 = true>;
Records can be accessed either via projection or via pattern matching. The example below extracts the two fields a1 and a2 from the record r.
let a1 : Str = ( r|a1 );
let <a2 = a2 : Bool> = r;
Lists and list processing
Furthermore, Cuneiform provides lists as compound data types. The example below shows the definition of a variable xs being a file list with three elements.
let xs : [File] =
['a.txt', 'b.txt', 'c.txt' : File];
Lists can be processed with the for and fold operators. Herein, the for operator can be given multiple lists to consume list element-wise (similar to for/list in Racket, mapcar in Common Lisp or zipwith in Erlang).
The example below shows how to map over a single list, the result being a file list.
for x <- xs do
process-one( arg1 = x )
: File
end;
The example below shows how to zip two lists the result also being a file list.
for x <- xs, y <- ys do
process-two( arg1 = x, arg2 = y )
: File
end;
Finally, lists can be aggregated by using the fold operator. The following example sums up the elements of a list.
fold acc = 0, x <- xs do
add( a = acc, b = x )
end;
Parallel execution
Cuneiform is a purely functional language, i.e., it does not support mutable references. In the consequence, it can use subterm-independence to divide a program into parallelizable portions. The Cuneiform scheduler distributes these portions to worker nodes. In addition, Cuneiform uses a Call-by-Name evaluation strategy to compute values only if they contribute to the computation result. Finally, foreign function applications are memoized to speed up computations that contain previously derived results.
For example, the following Cuneiform program allows the applications of f and g to run in parallel while h is dependent and can be started only when both f and g are finished.
The following Cuneiform program creates three parallel applications of the function f by mapping f over a three-element list:
Similarly, the applications of f and g are independent in the construction of the record r and can, thus, be run in parallel:
Examples
A hello-world script:
def greet( person : Str ) -> <out : Str>
in Bash *{
out="Hello $person"
}*
( greet( person = "world" )|out );
This script defines a task greet in Bash which prepends "Hello " to its string argument person.
The function produces a record with a single string field out.
Applying greet, binding the argument person to the string "world" produces the record <out = "Hello world">. Projecting this record to its field out evaluates the string "Hello world".
Command line tools can be integrated by defining a task in Bash:
def samtoolsSort( bam : File ) -> <sorted : File>
in Bash *{
sorted=sorted.bam
samtools sort -m 2G $bam -o $sorted
}*
In this example a task samtoolsSort is defined.
It calls the tool SAMtools, consuming an input file, in BAM format, and producing a sorted output file, also in BAM format.
Release history
In April 2016, Cuneiform's implementation language switched from Java to Erlang and, in February 2018, its major distributed execution platform changed from a Hadoop to distributed Erlang. Additionally, from 2015 to 2018 HTCondor had been maintained as an alternative execution platform.
Cuneiform's surface syntax was revised twice, as reflected in the major version number.
Version 1
In its first draft published in May 2014, Cuneiform was closely related to Make in that it constructed a static data dependency graph which the interpreter traversed during execution. The major difference to later versions was the lack of conditionals, recursion, or static type checking. Files were distinguished from strings by juxtaposing single-quoted string values with a tilde ~. The script's query expression was introduced with the target keyword. Bash was the default foreign language. Function application had to be performed using an apply form that took task as its first keyword argument. One year later, this surface syntax was replaced by a streamlined but similar version.
The following example script downloads a reference genome from an FTP server.
declare download-ref-genome;
deftask download-fa( fa : ~path ~id ) *{
wget $path/$id.fa.gz
gunzip $id.fa.gz
mv $id.fa $fa
}*
ref-genome-path = ~'ftp://hgdownload.cse.ucsc.edu/goldenPath/hg19/chromosomes';
ref-genome-id = ~'chr22';
ref-genome = apply(
task : download-fa
path : ref-genome-path
id : ref-genome-id
);
target ref-genome;
Version 2
The second draft of the Cuneiform surface syntax, first published in March 2015, remained in use for three years outlasting the transition from Java to Erlang as Cuneiform's implementation language. Evaluation differs from earlier approaches in that the interpreter reduces a query expression instead of traversing a static graph. During the time the surface syntax remained in use the interpreter was formalized and simplified which resulted in a first specification of Cuneiform's semantics. The syntax featured conditionals. However, Booleans were encoded as lists, recycling the empty list as Boolean false and the non-empty list as Boolean true. Recursion was added later as a byproduct of formalization. However, static type checking was introduced only in Version 3.
The following script decompresses a zipped file and splits it into evenly sized partitions.
deftask unzip( <out( File )> : zip( File ) ) in bash *{
unzip -d dir $zip
out=`ls dir | awk '{print "dir/" $0}'`
}*
deftask split( <out( File )> : file( File ) ) in bash *{
split -l 1024 $file txt
out=txt*
}*
sotu = "sotu/stateoftheunion1790-2014.txt.zip";
fileLst = split( file: unzip( zip: sotu ) );
fileLst;
Version 3
The current version of Cuneiform's surface syntax, in comparison to earlier drafts, is an attempt to close the gap to mainstream functional programming languages. It features a simple, statically checked type system and introduces records in addition to lists as a second type of compound data structure. Booleans are a separate base data type.
The following script untars a file resulting in a file list.
def untar( tar : File ) -> <fileLst : [File]>
in Bash *{
tar xf $tar
fileLst=`tar tf $tar`
}*
let hg38Tar : File =
'hg38/hg38.tar';
let <fileLst = faLst : [File]> =
untar( tar = hg38Tar );
faLst;
References
Programming languages
Workflow languages
Functional languages
Scripting languages
Linux programming tools
Hadoop
Statically typed programming languages
Cross-platform free software
|
Iles Braghetto (born 9 March 1953 in San Giorgio delle Pertiche) is an Italian politician from Veneto.
Braghetto was a religion teacher in upper secondary schools since 1976 and graduated in modern literature in 1984.
Since the years of his youth he was a member of Christian Democracy. Between 1980 and 1985 he was town councillor and deputy mayor of Padua. In 1995 he was elected to the Regional Council of Veneto for the United Christian Democrats. From 1995 through 2000 he was regional minister of Health in Galan I Government. From 2003 to 2005 he was chairman of the Committee overseeing planning, the budget and institutional affairs.
In 2005 he entered the European Parliament representing the Union of Christian and Centre Democrats (UDC). During his tenure he was vice-chairman of the Committee on Fisheries and member of the Committee on Employment and Social Affairs, the delegation for relations with Iran, and the delegation for relations with Canada.
After failing re-election to the EP in 2009, he left the UDC and was involved in the Alliance of the Centre.
References
1953 births
Living people
Union of the Centre (2002) MEPs
Braghetto Iles
Braghetto Iles
Members of the Regional Council of Veneto
|
```c++
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
#include "paddle/phi/kernels/funcs/jit/kernel_key.h"
#include <xxhash.h> // XXH64: 13.8 GB/s
#include <array>
namespace phi::jit {
template <>
int64_t JitCodeKey<int>(const int& d) {
return d;
}
template <>
int64_t JitCodeKey<int64_t>(const int64_t& d) {
return d;
}
template <>
int64_t JitCodeKey<gru_attr_t>(const gru_attr_t& attr) {
return static_cast<int64_t>(XXH64(&attr, sizeof(gru_attr_t), 0));
}
template <>
int64_t JitCodeKey<lstm_attr_t>(const lstm_attr_t& attr) {
std::array<int, 5> keys = {attr.d,
static_cast<int>(attr.act_gate),
static_cast<int>(attr.act_cand),
static_cast<int>(attr.act_cell),
static_cast<int>(attr.use_peephole)};
return static_cast<int64_t>(XXH64(keys.data(), sizeof(int) * 5, 0));
}
template <>
int64_t JitCodeKey<seq_pool_attr_t>(const seq_pool_attr_t& attr) {
std::array<int, 2> keys = {attr.w, static_cast<int>(attr.type)};
return static_cast<int64_t>(XXH64(keys.data(), sizeof(int) * 2, 0));
}
template <>
int64_t JitCodeKey<matmul_attr_t>(const matmul_attr_t& attr) {
return static_cast<int64_t>(XXH64(&attr, sizeof(int) * 3, 0)); // m, n, k
}
template <>
int64_t JitCodeKey<emb_seq_pool_attr_t>(const emb_seq_pool_attr_t& attr) {
return attr.table_width;
}
template <>
int64_t JitCodeKey<sgd_attr_t>(const sgd_attr_t& attr) {
return attr.grad_width;
}
template <>
int64_t JitCodeKey<adam_attr_t>(const adam_attr_t& attr) {
return static_cast<int64_t>(attr.beta1 + attr.beta2);
}
} // namespace phi::jit
```
|
Hartshorne Public Schools is a school district headquartered in Hartshorne, Oklahoma. It includes an elementary school and a middle-high school.
It serves Hartsthorne, Adamson, and a portion of Haileyville.
Boarders in grades 7–12 at Jones Academy, a Native American boarding school, are educated by Hartsthorne school district.
History
Mark Ichord served as superintendent until his retirement in 2017. Jason Lindley replaced him.
In March 2020 Lindley suspended spring activities and criticized the state government's handling of the COVID-19 pandemic in Oklahoma.
References
External links
Hartshorne Public Schools
School districts in Oklahoma
Education in Pittsburg County, Oklahoma
|
The initialism OCL can have several meanings, depending on context:
OCl−, the hypochlorite ion, in chemistry
Open Content License
Object Constraint Language
IBM Open Class Library
Operational Control Language of IBM mid-range computers
Overseas Containers Limited, former shipping company
OFC Champions League, football tournament
|
The long-furred Atlantic tree-rat or Thomas's Atlantic tree-rat (Phyllomys medius), is a spiny rat species found in Brazil. In recent years, this species have unveiled itself in different parts of Brazil where researchers and scientists are still closely looking into due to lack of knowledge on this species. The Phyllomys medius is closely related to two other species that have recently been connected to the long furred Atlantic tree rat due to similarities in physical characteristics and DNA. (Yuri et.al., 2008) (Edson et al., 2018)
References
Edson Fiedler de Abreu-Júnior, Alexandre Reis Percequillo, Lena Geise, Yuri L.R. Leite, Ana Carolina Loss. (2018) Unveiling the identity of Kerr's Atlantic tree rat, Phyllomys kerri (Rodentia, Echimyidae). Mammalian Biology, Vol. 92, 57-70. https://doi.org/10.1016/j.mambio.2018.03.008
Yuri L. R. Leite, Alexandre U. Christoff, Valéria Fagundes, A New Species of Atlantic Forest Tree Rat, Genus Phyllomys (Rodentia, Echimyidae) from Southern Brazil, Journal of Mammalogy, Volume 89, Issue 4, 15 August 2008, Pages 845–851, https://doi.org/10.1644/07-MAMM-A-343.1
Phyllomys
Mammals described in 1909
Taxa named by Oldfield Thomas
|
Annamalai Reddiyar or Reddiar (1865–1891) was a Tamil poet and composer.
Born in Sennikulam, Sankarankoil taluk, Tirunelveli district, Tamil Nadu, he studied Tamil under Ramaswami Pulavar and U. V. Swaminatha Iyer and was later patronised by the zamindar of Uttrumalai.
He is particularly remembered for his Kavadi Chindu, a genre of songs chanted by devotees of Lord Murugan while performing Kavadi Attam.
References
Tamil poets
1865 births
1891 deaths
19th-century Indian poets
Poets from Tamil Nadu
Poets from British India
Musicians from British India
|
Thomas Garner was a leading English Gothic revival architect.
Thomas Garner may also refer to:
Thomas Garner (engraver) (1789–1868), English engraver
See also
Tom Garner (born 1961), American golfer
Thomas Gardner (disambiguation)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.