text stringlengths 1 22.8M |
|---|
The National Assembly (, Majlisi milli; ) is the upper chamber of Tajikistan's bicameral parliament. It has 33 members : 25 elected for a five-year term by deputies of local majlisi and 8 appointed by the president. By right, former presidents are members for life. Rustam Emomali, who is the son of incumbent President Emomali Rahmon, is serving as the Chairman of the Majlisi Milli since April 17, 2020.
Twenty-five members were elected on March 27, 2020 and President Emomali Rahmon appointed one quarter of the members in April, bringing the total number of members to thirty-one.
Chairmen of Majlisi milli
References
Tajikistan
Government of Tajikistan
Tajikistan
1999 establishments in Tajikistan |
```go
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
// +build linux
package ipv6
import (
"unsafe"
"golang.org/x/net/bpf"
"golang.org/x/net/internal/socket"
)
func (so *sockOpt) setAttachFilter(c *socket.Conn, f []bpf.RawInstruction) error {
prog := sockFProg{
Len: uint16(len(f)),
Filter: (*sockFilter)(unsafe.Pointer(&f[0])),
}
b := (*[sizeofSockFprog]byte)(unsafe.Pointer(&prog))[:sizeofSockFprog]
return so.Set(c, b)
}
``` |
Linguists use a variety of symbols to represent not just single sounds, but certain particular classes of sounds. They are usually capital letters. This article lists those "cover symbols".
Consonants
Vowels
Capitalized vowels are commonly used in discussions of languages with vowel harmony. They often indicate different harmonic variants of an underlying archiphonemic vowel.
Some vowel symbols in the International Phonetic Alphabet, such as are also sometimes used as cover symbols.
Other symbols
Phonetics |
Khola Amjad (; born 12 December 1952) is a Pakistani politician who was a Member of the Provincial Assembly of the Punjab, from May 2013 to May 2018.
Early life and education
She was born on 12 December 1952 in Multan.
She earned Master Diploma in French from Alliance Française in 1976. She completed postgraduate diploma in Office Management from Bahauddin Zakariya University in 2000.
Political career
She was elected to the Provincial Assembly of the Punjab as a candidate of Pakistan Muslim League (N) on a reserved seat for women in 2013 Pakistani general election.
References
Living people
Punjab MPAs 2013–2018
1952 births
Pakistan Muslim League (N) politicians |
Trasak Paem is commonly considered as a ruler from legend of the Khmer Empire who presumably died around 1340.
He is the first Khmer sovereign mentioned by the Cambodian Royal Chronicles alone. He is the first among a series of nineteen rulers of the Khmer Empire that are presumed to have ruled Cambodia since 443 BC. This list is possibly too short to be credible. The Chronicles indicate that Trasak Paem named Chay was the royal gardener of a king named « Sihanouk » and often identified with Jayavarman IX as known from Khmer inscriptions.
Narrative: a historical legend in the Cambodian Royal Chronicles
Rise of the regicidal gardener
According to the Cambodian Royal Chronicles, a certain Chay was born from the union of a hermit from Phnom Kulen and a peasant woman from the Samre tribe. His skill in growing sweet cucumbers earned him the title of Neay Trasac Paem (“Chef of Tasty Cucumbers”). He reserved the consumption of it for his king, named Norodom, son of Senaka, who had caused a flood to destroy his land after he angered the naga king Puchang. King Sihanouk gave Trasak Paem his spear to protect his crops. One night, Chay mortally wounded his sovereign with his weapon when the latter wanted to test his zeal. However, before succumbing, the monarch demanded that his assassin not be worried because he had only obeyed his orders and could not be held responsible for the recklessness of his king.
Election as the new king by the white elephant
As the deceased sovereign left no heir and the astrologers, Brahmans, generals and others could not agree on the name of the successor and decided to rely on the deities. To do this, a ceremony is organized where a white elephant was invited to choose among the most eminent members of the nobility that the empire then counted to determine which was the most eligible to become the new king. The pachyderm very quickly neglected this areopagus and turned towards the crowd who have come to join the celebration and directed itself toward an anonymous person who turned out to be the regicide gardener. The dignitaries had to reluctantly accept this monarch of modest extraction, but faced with their hostility, the new king resolved to leave Angkor for a residence that he had built at Banteay Samré; nevertheless this distance did not put an end to the defamatory practices and it was only after having eliminated the faithful of his predecessors that Chay could begin a reign which would prove to be uneventful.
Royal wedding and legitimate descendance
Trasak Paem married Candravati the daughter of his predecessor and the couple would thus be at the origin of the dynasty which still reigns over Cambodia today. According to the Chronicles King Chay left two sons known by their posthumous names:
Nippean Bat (Nirvanapada)
Sithean Reachea (Sidhanaraja)
Analysis
Historiography
The legend of Trasak Paem The Cambodian Royal Chronicles give two different accounts of the legend of Trasak Paem, one that happens after the flood of 729, and another one that is placed in 1340, as translated by Jean Moura and Etienne Aymonier. This time gap was filled in by a series of king and led French historiography to explain the little trust that could be given to Cambodian Royal Chronicles in terms of historical accuracy.
The legend of Trasak Paem has a narrative very similar to one present in the Burmese Chronicles of Maha Yazawin and Pagan Yazawin. The latter relates who the Bagan dynasty ended the invasion of Khubilai Khan. The Burmese legend probably made into the Khmer Chronicles through a Burmese collection of folk tales known as The Precedents of Princess Thoodamma Tsari from which other legends were also translated to Khmer. The Burmese legend had been translated into English by Richard Fleming St Andrew St John in the Burmese Reader .
In the Burmese folk tale, the time frame, which refers to the land of Parajinaka at the time of Vessabhū Buddha and the reign of King Mahamanda, is voluntarily purely fictional. Mahamanda, which means the "frivolous king" in Burmese, translates as Sdach Pal in Khmer, with Sdach meaning "king" and pal meaning "forgetful, idiotic, mean".
The correspondence between the two narratives is striking and due to the greater antiquity of the Burmese Chronicle, it is presumable that the Cambodian narrative of Trasak Paem was copied on the latter.
In 1905, Trasak Paem was widely believed in Cambodia as a historical figure. In 1965, he was still a common reference in the political debate. By 1995, Trasak Paem had widely been accepted as a legendary rather than historical figure.
Literal interpretation: a botanic discovery of the Khmer rulers
Belgian writer Jean Guillaume, in his research on the history of domesticated food plants, considers that the legend of Trasak Paem may be a myth related to the appearance of a new variety of vegetable, a sweet cucumber, of which Jayavarman would have been so fond that he reserved the crops for himself and putting them under the care of their gardener.
Historical interpretation: the Khmer revolution of the 14th century
The legend of Trasak Paem seems to symbolize the profound cultural change in the country that Achille Dauphin-Meunier calls the "14th Century Revolution".
This revolution would correspond with the definitive advent of Theravada Buddhism to the detriment of Hinduism which will experience a rapid decline. The king, until then of divine essence and considered as an intermediary between men and the heavens, suddenly became a simple mortal who owed his throne to the virtues he has accumulated in his lives. The goal for the inhabitants was no longer to build mountain temples that would earn them the favor and protection of the gods, but to follow the virtuous conduct of their king in the hope of reaching plenitude. At that period, Sanskrit also ceases to be used in the inscriptions which disappear definitively and in the cult in favor of the Pali.
Posterity
Royal regalia: the victory spear
The victory spear (Preah Lompeng Chey) associated with the legend of Trasak Paem is one of Khmer royal regalia, along with the royal sword called Preah Khan Reach, the dagger called Kris given to the Muslim king of Cambodia, Ramathipadi I by a Malay princess.
Political reference
Despite being a legendary figure, King Trasak Paem has been a regular reference for modern monarchs of Cambodia. Between 1872 and 1882, King Norodom made four visits to caves on Phnom Chriev in search of powerful Buddha images supposedly hidden there by legendary king Ta Trasak Paem.
King Sihanouk referred to the popular legend of King Trasak Paem, a neak mean bon, to justify his 1955 abdication in favour of his father Suramarit, and his new role as chairman of the Sangkum Reastr Niyum. In fact, Sihanouk described himself as a "very courageous and energetic man as was “Ta Trasak Paem” (the old man with sweet cucumbers) who did not hesitate to slay his King".
Topography
Street 63 in Phnom Penh is also known as Trasak Paem Street. It is next to Khan Châmkar Mon and has a length of 1.99 kilometres.
Bibliography
Edouard Huber, Études indochinoises - Le jardinier régicide qui devint roi', [Bulletin de l'École française d'Extrême-Orient, 1905, Vol 5,].
Achille Dauphin-Meunier, Histoire du Cambodge, Que sais-je ? , P.U.F 1968
Anthony Stokvis, Manuel d'histoire, de généalogie et de chronologie de tous les États du globe, depuis les temps les plus reculés jusqu'à nos jours, préf. H. F. Wijnman, éditions Brill Leyde 1888, réédition 1966, Volume 1 Part 1: Asia, chapitre XIV §.9 « Kambodge » Listes et tableau généalogique .
(en) & (de) Peter Truhart, Regents of Nations, K.G Saur Munich, 1984-1988 , Art. « Kampuchea », .
References
1340 deaths
14th-century Cambodian monarchs
Articles with missing Wikidata information
Regicides
Khmer folklore |
Ranpur Taluka is a taluka of Botad district, in the state of Gujarat, India. Prior to August 2013 it was part of Ahmedabad District.
Villages
Ranpur Taluka consists of thirty-four panchayat villages.
Notes and references
Botad district
Talukas of Gujarat |
A razo (, literally "cause", "reason") was a short piece of Occitan prose detailing the circumstances of a troubadour composition. A razo normally introduced an individual poem, acting as a prose preface and explanation; it might, however, share some of the characteristics of a vida (a biography of a troubadour, describing his origins, his loves, and his works) and the boundary between the two genres was never sharp.
In the chansonniers, the manuscript collections of medieval troubadour poetry, some poems are accompanied by a prose explanation whose purpose is to give the reason why the poem was composed. These texts are occasionally based on independent sources. To that extent, they supplement the vidas in the same manuscripts and are useful to modern literary and historical researchers. Often, however, it is clear that assertions in the razos are simply deduced from literal readings of details in the poems. Most of the surviving razo corpus is the work of Uc de Saint Circ, composed in Italy between 1227 and 1230.
In one case, a manuscript from Bergamo, there is an explanatory rubric preceding the Occitan partimen Si paradis et enfernz son aital by Girard Cavalaz and Aycart del Fossat is in Latin.
Sources
Boutière, Jean; Schutz, Alexander Herman. Biographies des troubadours: textes provençaux des XIIIe et XIVe siècle. Paris: A. G. Nizet, 1964.
Poe, Elizabeth W. "At the Boundary between Vida and Razo: The Biography of Raimon Jordan." Neophilologus, 72:2 (Apr., 1988) pp. 316–319.
Schutz, A. H. "Where Were the Provençal Vidas and Razos Written?" Modern Philology, 35:3 (Feb., 1938), pp. 225–232.
See also
Linquo coax ranis, a Latin equivalent
Occitan literary genres |
White Haitians (, ; Haitian Creole: blan ayisyen), also known as Euro-Haitians, are Haitians of predominant or full European descent. There were approximately 20,000 whites around the Haitian Revolution, mainly French, in Saint-Domingue. They were divided into two main groups: The Planters and Petit Blancs. The first white Europeans to settle in Haiti were the Spanish. The Spanish enslaved the indigenous Haitians to work on sugar plantations and in gold mines. European diseases such as measles and smallpox killed all but a few thousand of the indigenous Haitians. Many other indigenous Haitians died from overwork and harsh treatment in the mines from slavery.
History
European conquest and colonization
The presence of whites in Haiti dates back to the founding of La Navidad, the first European settlement in the Americas by Christopher Columbus in 1492. It was built from the timbers of his wrecked ship Santa María, during his first voyage in December 1492. When he returned in 1493 on his second voyage he found the settlement had been destroyed and all 39 settlers killed. Columbus continued east and founded a new settlement at La Isabela on the territory of the present-day Dominican Republic in 1493. The capital of the colony was moved to Santo Domingo in 1496, on the south east coast of the island also in the territory of the present-day Dominican Republic. The Spanish returned to western Hispaniola in 1502, establishing a settlement at Yaguana, near modern-day Léogâne. A second settlement was established on the north coast in 1504 called Puerto Real near modern Fort-Liberté – which in 1578 was relocated to a nearby site and renamed Bayaha. The Spanish began to enslave the indigenous Taíno and Ciboney people soon after December 1492.
The settlement of Yacanagua was burnt to the ground three times in its just over a century long existence as a Spanish settlement, first by French pirates in 1543, again on 27 May 1592 by a 110 strong landing party from a 4 ship English naval squadron led by Christopher Newport in his flagship Golden Dragon, who destroyed all 150 houses in the settlement and finally by the Spanish themselves in 1605, for reasons set out below.
In 1595, the Spanish, frustrated by the twenty-year rebellion of their Dutch subjects, closed their home ports to rebel shipping from the Netherlands, cutting them off from the critical salt supplies necessary for their herring industry. The Dutch responded by sourcing new salt supplies from Spanish America where colonists were more than happy to trade. So large numbers of Dutch traders/pirates joined their English and French brethren trading on the remote coasts of Hispaniola. In 1605, Spain was infuriated that Spanish settlements on the northern and western coasts of the island persisted in carrying out large scale and illegal trade with the Dutch, who were at that time fighting a war of independence against Spain in Europe and the English, a very recent enemy state, and so decided to forcibly resettle their inhabitants closer to the city of Santo Domingo. This action, known as the Devastaciones de Osorio, proved disastrous; more than half of the resettled colonists died of starvation or disease, over 100,000 cattle were abandoned and many slaves escaped. Five of the existing thirteen settlements on the island were brutally razed by Spanish troops including the two settlements on the territory of present-day Haiti, La Yaguana and Bayaja. Many of the inhabitants fought, escaped to the jungle or fled to the safety of passing Dutch ships This Spanish action was counterproductive as English, Dutch and French pirates were now free to establish bases on the island's abandoned northern and western coasts, where wild cattle were now plentiful and free.
Saint-Domingue
In the early seventeenth century, the Spanish government ordered the evacuation of the northern and western coast of the island and forcing the relocation to areas close to the city of Santo Domingo, to prevent the pirates from other European nations. This ended up being counterproductive to Spain, because in 1625 the pirates and French buccaneers began to establish settlements on the island of Tortuga and in a strip north of Hispaniola surrounding Port-de-Paix and were soon joined by like-minded English and Dutch privateers and pirates, who formed a lawless international community that survived by preying on Spanish ships and hunting wild cattle. Although the Spanish destroyed the buccaneers' settlements in 1629, 1635, 1638 and 1654, on each occasion they returned. In 1655, the newly established English administration on Jamaica sponsored the re-occupation of Tortuga under Elias Watts as governor. In 1660, the English made the mistake of replacing Watts as governor by a Frenchman Jeremie Deschamps, on condition he defended English interests. Deschamps on taking control of the island proclaimed for the King of France, set up French colours, and defeated several English attempts to reclaim the island. It is from this point in 1660 that unbroken French rule in Haiti begins. In 1663, Deschamps founded a French settlement Léogâne on the western coast of the island on the abandoned site of the former Spanish town of Yaguana.
In 1664, the newly established French West India Company took control of the new colony and France formally claimed control of the western portion of the island of Hispaniola. In 1665, they established a French settlement on the mainland of Hispaniola opposite Tortuga at Port-de-Paix. In 1670, the headland of Cap-Français (now Cap-Haïtien), was settled further to the east along the northern coast. In 1676, the colonial capital was moved from Tortuga to Port-de-Paix. In 1684, the French and Spanish signed the Treaty of Ratisbon that included provisions to suppress the actions of the Caribbean privateers, which effectively ended the era of the buccaneers on Tortuga, many being employed by the French Crown to hunt down any of their former comrades who preferred to turn outright pirate. Under the 1697 Treaty of Ryswick, Spain officially ceded the western third of Hispaniola to France which renamed the colony Saint-Domingue. By that time, planters outnumbered buccaneers and, with the encouragement of Louis XIV, they had begun to grow tobacco, indigo, cotton and cacao on the fertile northern plain, thus prompting the importation of African slaves.
In 1777, France and Spain signed a border treaty, in which the western and northwestern coast of Hispaniola would be French and the rest of the island would be Spanish. By 1780 Saint-Domingue was the richest colony in the world, even than all the British Thirteen Colonies and the West Indies together. The French established an economy based on the production and export of sugar sustained on the forced labor of black slaves imported from West and Central Africa. Slavery of blacks was characterized as one of the most ruthless in which terror and severe punishments were applied to slaves.
By 1789, the Saint Dominican population was composed as follows:
40,000 Grand-blancs (literally "Great whites" in French) and Petit-blancs ("Little whites")
28,000 Sang-melés (French for: "Mixed blood") or free people of color.
452,000 slaves
The white population were 8% of Saint-Domingue’s population, but they owned 70% of the wealth and 75% of the slaves in the colony. The mulatto population were 5% of the population and had the 30% of the wealth. The slaves were 87% of the population.
Haitian Revolution
When the French Revolution started, the ideas of freedom among men spread in Saint-Domingue. Blacks and the majority African descendants such as Jean-Jacques Dessalines, rebelled against their white French masters. The rebels killed more than a thousand French people in 1791. To preserve their lives, they fled Saint-Domingue. The wealthy grand-blancs returned to France or went to French Louisiana, but the petit-blancs who did not have many resources were compelled to move to the eastern side of Hispaniola, Cuba and Puerto Rico. Notably, there were many sang-melés — some of which fled from Saint-Domingue — who settled in neighboring islands (mostly Puerto Rico and Cuba).
Most French colonists died or fled Saint-Domingue during the Haitian Revolution and the surviving remainder were either killed in the 1804 Haiti massacre or were thought to be of some use to the country's development, such as doctors, teachers and engineers. These colonists were considered valuable and were not to be harmed in any way. Prior to the US occupation of 1915 it was hard for white foreigners to become Haitian citizens due to restrictions on owning land in Haiti. Exceptions were made for Germans, Poles and Frenchmen who had fought with the rebels against France in the war and their descendants. White foreigners could become citizens only by marrying Haitians.
Origins
Before the Haitian Revolution, Haitians were categorized under three major categories: white, black and mulatto. But these were far more complex in practice, involving the coarseness of one's hair, nose measurements and assessments of other facial features.
Demographics
Today, a group of Haitians are direct descendants of the Frenchmen who were saved from the massacre. As of 2013, people of solely European descent are a small minority in Haiti. The combined population of whites and multiracial people constitutes 5% of the population, roughly half a million people. People born to foreigners on Haitian soil are not automatically Haitian citizens due to the jus sanguinis () principle of nationality law. In addition to those of French descent, other White Haitians are of German, Polish, Italian, Spanish, English, Dutch, Irish and American descent. Most white Haitians live in the Port-au-Prince metropolitan area, particularly the wealthy suburb of Pétion-Ville.
According to the Haitian constitution since the time of independence, all citizens are to be referred to as black, where all races are considered equal to avoid prejudice. The creole term nèg is derived from the French word negre (which means "black") and is used similarly to dude or guy in English. A Haitian man is always a nèg, even if he is of European descent where he would be called a nèg blan ("white guy") and his counterpart being nèg nwa ("black guy"); all with no racist overtones. Foreigners are always referred to as simply blan regardless of skin-tone, denoting a double meaning for the word.
In the countryside, it is common to hear a poor light-skinned person called ti-wouj (little red), ti-blan (little white) or simply "blan" rather than a milat (mulatto), which is commonly being used to exclude individuals at the bottom of the social ladder as the term "mulatto" historically coincides with people who were more privileged.
See also
French Haitians
German Haitians
Italian Haitians
Mulatto Haitians
Polish Haitians
History of the Jews in Haiti
White Caribbeans
White Latin Americans
White Dominicans
References
Ethnic groups in Haiti
People from Saint-Domingue
White Caribbean |
Industrial Research Limited (IRL) was a Crown Research Institute of New Zealand that was established in 1992 and merged into Callaghan Innovation, a new Crown entity, on 1 February 2013. IRL provided research, development and commercialisation services aimed at fostering industry development, economic growth and business expansion. It was established when the Department of Scientific and Industrial Research was disbanded and its staff and assets redistributed to form the research institutes in 1992.
Like many New Zealand entities, its logo incorporated a Māori identity, in this case "Te Tauihu Pūtaiao", where Te Tauihu is the prow or leading edge of a waka (Māori war canoe) and Pūtaiao means science. The phrase is a metaphor for the way science and technology can open up new opportunities for New Zealand businesses.
IRL was based at Gracefield in Lower Hutt, and had offices in Auckland and Christchurch.
After 10 years of operation, IRL commissioned a book, The Littlest Clue, which followed the history of several scientists and their projects as they took their ideas from the lab to the market place.
In 2009, IRL ran a competition What's Your Problem New Zealand? to win up to $1 million of research and development services, receiving over 100 entries.
References
External links
Crown Research Institutes of New Zealand
1992 establishments in New Zealand
2013 disestablishments in New Zealand |
The 1992 Formula One Indoor Trophy took place on December 7–8 at the Bologna Motor Show. The winner was Johnny Herbert in a Lotus-Judd.
Participants
The 1992 Formula One Indoor Trophy, at the end of the 1992 Formula One season, was entered by just 5 competitors, one down on the previous year.
Johnny Herbert represented Lotus, as he had in 1991, continuing the role he had carried out during the season alongside Mika Häkkinen.
BMS Scuderia Italia, using their Dallara chassis, were represented once again by JJ Lehto, who had also driven for them during the regular season alongside Pierluigi Martini. Michele Alboreto also drove for them, and he would appear in the 1993 season for the team.
The field was completed by a pair of Minardis, driven by Christian Fittipaldi and Alessandro Zanardi. The pair had shared one of Minardi's cars during 1992, with former champion Gianni Morbidelli in the other, but Morbidelli was not selected for the event.
Results
Christian Fittipaldi received a bye to the semi-finals. In the quarters, Lehto was drawn against Zanardi while Herbert faced Alboreto. Lehto beat Zanardi in a close match-up, and Herbert won through against Alboreto in an equally close pairing. As the closest loser, Zanardi also went through to the semi-finals.
He was drawn against Herbert, but lost again, leaving Lehto to beat Fittipaldi in the other semi-final, eliminating both Minardis. Herbert defeated Lehto in the final, becoming the first person to win the event in a non-Italian car.
References
Bologna Sprint - The GEL Motorsport Information Page
Formula One Indoor Trophy
Formula One Indoor Trophy |
```objective-c
//===- llvm/ADT/CoalescingBitVector.h - A coalescing bitvector --*- C++ -*-===//
//
// See path_to_url for license information.
//
//===your_sha256_hash------===//
///
/// \file
/// A bitvector that uses an IntervalMap to coalesce adjacent elements
/// into intervals.
///
//===your_sha256_hash------===//
#ifndef LLVM_ADT_COALESCINGBITVECTOR_H
#define LLVM_ADT_COALESCINGBITVECTOR_H
#include "llvm/ADT/IntervalMap.h"
#include "llvm/ADT/STLExtras.h"
#include "llvm/ADT/SmallVector.h"
#include "llvm/ADT/iterator_range.h"
#include "llvm/Support/Debug.h"
#include "llvm/Support/raw_ostream.h"
#include <initializer_list>
namespace llvm {
/// A bitvector that, under the hood, relies on an IntervalMap to coalesce
/// elements into intervals. Good for representing sets which predominantly
/// contain contiguous ranges. Bad for representing sets with lots of gaps
/// between elements.
///
/// Compared to SparseBitVector, CoalescingBitVector offers more predictable
/// performance for non-sequential find() operations.
///
/// \tparam IndexT - The type of the index into the bitvector.
template <typename IndexT> class CoalescingBitVector {
static_assert(std::is_unsigned<IndexT>::value,
"Index must be an unsigned integer.");
using ThisT = CoalescingBitVector<IndexT>;
/// An interval map for closed integer ranges. The mapped values are unused.
using MapT = IntervalMap<IndexT, char>;
using UnderlyingIterator = typename MapT::const_iterator;
using IntervalT = std::pair<IndexT, IndexT>;
public:
using Allocator = typename MapT::Allocator;
/// Construct by passing in a CoalescingBitVector<IndexT>::Allocator
/// reference.
CoalescingBitVector(Allocator &Alloc)
: Alloc(&Alloc), Intervals(Alloc) {}
/// \name Copy/move constructors and assignment operators.
/// @{
CoalescingBitVector(const ThisT &Other)
: Alloc(Other.Alloc), Intervals(*Other.Alloc) {
set(Other);
}
ThisT &operator=(const ThisT &Other) {
clear();
set(Other);
return *this;
}
CoalescingBitVector(ThisT &&Other) = delete;
ThisT &operator=(ThisT &&Other) = delete;
/// @}
/// Clear all the bits.
void clear() { Intervals.clear(); }
/// Check whether no bits are set.
bool empty() const { return Intervals.empty(); }
/// Count the number of set bits.
unsigned count() const {
unsigned Bits = 0;
for (auto It = Intervals.begin(), End = Intervals.end(); It != End; ++It)
Bits += 1 + It.stop() - It.start();
return Bits;
}
/// Set the bit at \p Index.
///
/// This method does /not/ support setting a bit that has already been set,
/// for efficiency reasons. If possible, restructure your code to not set the
/// same bit multiple times, or use \ref test_and_set.
void set(IndexT Index) {
assert(!test(Index) && "Setting already-set bits not supported/efficient, "
"IntervalMap will assert");
insert(Index, Index);
}
/// Set the bits set in \p Other.
///
/// This method does /not/ support setting already-set bits, see \ref set
/// for the rationale. For a safe set union operation, use \ref operator|=.
void set(const ThisT &Other) {
for (auto It = Other.Intervals.begin(), End = Other.Intervals.end();
It != End; ++It)
insert(It.start(), It.stop());
}
/// Set the bits at \p Indices. Used for testing, primarily.
void set(std::initializer_list<IndexT> Indices) {
for (IndexT Index : Indices)
set(Index);
}
/// Check whether the bit at \p Index is set.
bool test(IndexT Index) const {
const auto It = Intervals.find(Index);
if (It == Intervals.end())
return false;
assert(It.stop() >= Index && "Interval must end after Index");
return It.start() <= Index;
}
/// Set the bit at \p Index. Supports setting an already-set bit.
void test_and_set(IndexT Index) {
if (!test(Index))
set(Index);
}
/// Reset the bit at \p Index. Supports resetting an already-unset bit.
void reset(IndexT Index) {
auto It = Intervals.find(Index);
if (It == Intervals.end())
return;
// Split the interval containing Index into up to two parts: one from
// [Start, Index-1] and another from [Index+1, Stop]. If Index is equal to
// either Start or Stop, we create one new interval. If Index is equal to
// both Start and Stop, we simply erase the existing interval.
IndexT Start = It.start();
if (Index < Start)
// The index was not set.
return;
IndexT Stop = It.stop();
assert(Index <= Stop && "Wrong interval for index");
It.erase();
if (Start < Index)
insert(Start, Index - 1);
if (Index < Stop)
insert(Index + 1, Stop);
}
/// Set union. If \p RHS is guaranteed to not overlap with this, \ref set may
/// be a faster alternative.
void operator|=(const ThisT &RHS) {
// Get the overlaps between the two interval maps.
SmallVector<IntervalT, 8> Overlaps;
getOverlaps(RHS, Overlaps);
// Insert the non-overlapping parts of all the intervals from RHS.
for (auto It = RHS.Intervals.begin(), End = RHS.Intervals.end();
It != End; ++It) {
IndexT Start = It.start();
IndexT Stop = It.stop();
SmallVector<IntervalT, 8> NonOverlappingParts;
getNonOverlappingParts(Start, Stop, Overlaps, NonOverlappingParts);
for (IntervalT AdditivePortion : NonOverlappingParts)
insert(AdditivePortion.first, AdditivePortion.second);
}
}
/// Set intersection.
void operator&=(const ThisT &RHS) {
// Get the overlaps between the two interval maps (i.e. the intersection).
SmallVector<IntervalT, 8> Overlaps;
getOverlaps(RHS, Overlaps);
// Rebuild the interval map, including only the overlaps.
clear();
for (IntervalT Overlap : Overlaps)
insert(Overlap.first, Overlap.second);
}
/// Reset all bits present in \p Other.
void intersectWithComplement(const ThisT &Other) {
SmallVector<IntervalT, 8> Overlaps;
if (!getOverlaps(Other, Overlaps)) {
// If there is no overlap with Other, the intersection is empty.
return;
}
// Delete the overlapping intervals. Split up intervals that only partially
// intersect an overlap.
for (IntervalT Overlap : Overlaps) {
IndexT OlapStart, OlapStop;
std::tie(OlapStart, OlapStop) = Overlap;
auto It = Intervals.find(OlapStart);
IndexT CurrStart = It.start();
IndexT CurrStop = It.stop();
assert(CurrStart <= OlapStart && OlapStop <= CurrStop &&
"Expected some intersection!");
// Split the overlap interval into up to two parts: one from [CurrStart,
// OlapStart-1] and another from [OlapStop+1, CurrStop]. If OlapStart is
// equal to CurrStart, the first split interval is unnecessary. Ditto for
// when OlapStop is equal to CurrStop, we omit the second split interval.
It.erase();
if (CurrStart < OlapStart)
insert(CurrStart, OlapStart - 1);
if (OlapStop < CurrStop)
insert(OlapStop + 1, CurrStop);
}
}
bool operator==(const ThisT &RHS) const {
// We cannot just use std::equal because it checks the dereferenced values
// of an iterator pair for equality, not the iterators themselves. In our
// case that results in comparison of the (unused) IntervalMap values.
auto ItL = Intervals.begin();
auto ItR = RHS.Intervals.begin();
while (ItL != Intervals.end() && ItR != RHS.Intervals.end() &&
ItL.start() == ItR.start() && ItL.stop() == ItR.stop()) {
++ItL;
++ItR;
}
return ItL == Intervals.end() && ItR == RHS.Intervals.end();
}
bool operator!=(const ThisT &RHS) const { return !operator==(RHS); }
class const_iterator {
friend class CoalescingBitVector;
public:
using iterator_category = std::forward_iterator_tag;
using value_type = IndexT;
using difference_type = std::ptrdiff_t;
using pointer = value_type *;
using reference = value_type &;
private:
// For performance reasons, make the offset at the end different than the
// one used in \ref begin, to optimize the common `It == end()` pattern.
static constexpr unsigned kIteratorAtTheEndOffset = ~0u;
UnderlyingIterator MapIterator;
unsigned OffsetIntoMapIterator = 0;
// Querying the start/stop of an IntervalMap iterator can be very expensive.
// Cache these values for performance reasons.
IndexT CachedStart = IndexT();
IndexT CachedStop = IndexT();
void setToEnd() {
OffsetIntoMapIterator = kIteratorAtTheEndOffset;
CachedStart = IndexT();
CachedStop = IndexT();
}
/// MapIterator has just changed, reset the cached state to point to the
/// start of the new underlying iterator.
void resetCache() {
if (MapIterator.valid()) {
OffsetIntoMapIterator = 0;
CachedStart = MapIterator.start();
CachedStop = MapIterator.stop();
} else {
setToEnd();
}
}
/// Advance the iterator to \p Index, if it is contained within the current
/// interval. The public-facing method which supports advancing past the
/// current interval is \ref advanceToLowerBound.
void advanceTo(IndexT Index) {
assert(Index <= CachedStop && "Cannot advance to OOB index");
if (Index < CachedStart)
// We're already past this index.
return;
OffsetIntoMapIterator = Index - CachedStart;
}
const_iterator(UnderlyingIterator MapIt) : MapIterator(MapIt) {
resetCache();
}
public:
const_iterator() { setToEnd(); }
bool operator==(const const_iterator &RHS) const {
// Do /not/ compare MapIterator for equality, as this is very expensive.
// The cached start/stop values make that check unnecessary.
return std::tie(OffsetIntoMapIterator, CachedStart, CachedStop) ==
std::tie(RHS.OffsetIntoMapIterator, RHS.CachedStart,
RHS.CachedStop);
}
bool operator!=(const const_iterator &RHS) const {
return !operator==(RHS);
}
IndexT operator*() const { return CachedStart + OffsetIntoMapIterator; }
const_iterator &operator++() { // Pre-increment (++It).
if (CachedStart + OffsetIntoMapIterator < CachedStop) {
// Keep going within the current interval.
++OffsetIntoMapIterator;
} else {
// We reached the end of the current interval: advance.
++MapIterator;
resetCache();
}
return *this;
}
const_iterator operator++(int) { // Post-increment (It++).
const_iterator tmp = *this;
operator++();
return tmp;
}
/// Advance the iterator to the first set bit AT, OR AFTER, \p Index. If
/// no such set bit exists, advance to end(). This is like std::lower_bound.
/// This is useful if \p Index is close to the current iterator position.
/// However, unlike \ref find(), this has worst-case O(n) performance.
void advanceToLowerBound(IndexT Index) {
if (OffsetIntoMapIterator == kIteratorAtTheEndOffset)
return;
// Advance to the first interval containing (or past) Index, or to end().
while (Index > CachedStop) {
++MapIterator;
resetCache();
if (OffsetIntoMapIterator == kIteratorAtTheEndOffset)
return;
}
advanceTo(Index);
}
};
const_iterator begin() const { return const_iterator(Intervals.begin()); }
const_iterator end() const { return const_iterator(); }
/// Return an iterator pointing to the first set bit AT, OR AFTER, \p Index.
/// If no such set bit exists, return end(). This is like std::lower_bound.
/// This has worst-case logarithmic performance (roughly O(log(gaps between
/// contiguous ranges))).
const_iterator find(IndexT Index) const {
auto UnderlyingIt = Intervals.find(Index);
if (UnderlyingIt == Intervals.end())
return end();
auto It = const_iterator(UnderlyingIt);
It.advanceTo(Index);
return It;
}
/// Return a range iterator which iterates over all of the set bits in the
/// half-open range [Start, End).
iterator_range<const_iterator> half_open_range(IndexT Start,
IndexT End) const {
assert(Start < End && "Not a valid range");
auto StartIt = find(Start);
if (StartIt == end() || *StartIt >= End)
return {end(), end()};
auto EndIt = StartIt;
EndIt.advanceToLowerBound(End);
return {StartIt, EndIt};
}
void print(raw_ostream &OS) const {
OS << "{";
for (auto It = Intervals.begin(), End = Intervals.end(); It != End;
++It) {
OS << "[" << It.start();
if (It.start() != It.stop())
OS << ", " << It.stop();
OS << "]";
}
OS << "}";
}
#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
LLVM_DUMP_METHOD void dump() const {
// LLDB swallows the first line of output after callling dump(). Add
// newlines before/after the braces to work around this.
dbgs() << "\n";
print(dbgs());
dbgs() << "\n";
}
#endif
private:
void insert(IndexT Start, IndexT End) { Intervals.insert(Start, End, 0); }
/// Record the overlaps between \p this and \p Other in \p Overlaps. Return
/// true if there is any overlap.
bool getOverlaps(const ThisT &Other,
SmallVectorImpl<IntervalT> &Overlaps) const {
for (IntervalMapOverlaps<MapT, MapT> I(Intervals, Other.Intervals);
I.valid(); ++I)
Overlaps.emplace_back(I.start(), I.stop());
assert(llvm::is_sorted(Overlaps,
[](IntervalT LHS, IntervalT RHS) {
return LHS.second < RHS.first;
}) &&
"Overlaps must be sorted");
return !Overlaps.empty();
}
/// Given the set of overlaps between this and some other bitvector, and an
/// interval [Start, Stop] from that bitvector, determine the portions of the
/// interval which do not overlap with this.
void getNonOverlappingParts(IndexT Start, IndexT Stop,
const SmallVectorImpl<IntervalT> &Overlaps,
SmallVectorImpl<IntervalT> &NonOverlappingParts) {
IndexT NextUncoveredBit = Start;
for (IntervalT Overlap : Overlaps) {
IndexT OlapStart, OlapStop;
std::tie(OlapStart, OlapStop) = Overlap;
// [Start;Stop] and [OlapStart;OlapStop] overlap iff OlapStart <= Stop
// and Start <= OlapStop.
bool DoesOverlap = OlapStart <= Stop && Start <= OlapStop;
if (!DoesOverlap)
continue;
// Cover the range [NextUncoveredBit, OlapStart). This puts the start of
// the next uncovered range at OlapStop+1.
if (NextUncoveredBit < OlapStart)
NonOverlappingParts.emplace_back(NextUncoveredBit, OlapStart - 1);
NextUncoveredBit = OlapStop + 1;
if (NextUncoveredBit > Stop)
break;
}
if (NextUncoveredBit <= Stop)
NonOverlappingParts.emplace_back(NextUncoveredBit, Stop);
}
Allocator *Alloc;
MapT Intervals;
};
} // namespace llvm
#endif // LLVM_ADT_COALESCINGBITVECTOR_H
``` |
Marine Fighting Squadron 155 (VMF-155) was a fighter squadron of the United States Marine Corps in World War II. During the war, they flew the SBC Helldiver and, after reconstitution in 1943, the F4F Wildcat. Later in the War the squadron also flew the F4U Corsair. One of the squadron's pilots who went on to great distinction later in his career was Lieutenant John Glenn. The squadron, also known as “Ready Teddy” was deactivated shortly after the war and is still inactive.
History
Marine Observation Squadron 155 (VMO-155) was activated on October 1, 1942, as part of Marine Aircraft Group 13. The squadron was initially based in American Samoa and its first personnel came from VMSB-151. Their first complement of aircraft were SBC Helldiver biplane dive bomber and the J2F-5 Duck amphibious biplane. In December 1942, the bulk of the squadrons personnel were sent to Guadalcanal where they were assigned as replacements. A small cadre of six officers and fifteen enlisted men were retained in the squadron and ordered to Camp Kearny in San Diego, California to re-equip and train.
Beginning in January 1943, VMO-155 began training on the F4F-3P Wildcat, a fighter specifically designed for photographic reconnaissance. During this time they also began receiving their carrier qualifications. In April 1943, with their training complete, a detachment from the squadron was ordered aboard the to participate in the invasion of Attu in the Aleutian Islands. This operation made them the first Marine squadron to operate from an aircraft carrier during World War II and the only Marine squadron to operate in the North Pacific.
Following the Operation in the Aleutians, the detachment rejoined the squadron in June 1943 and quickly moved to Marine Corps Air Station El Centro for further training. In February 1944, VMO-155 moved to Midway Atoll and became part of the local garrison. After four months on Midway, they were sent to Marine Corps Air Station Ewa, Hawaii. From MCAS Ewa, the squadron was again split up. This time the ground echelon was sent to Kwajalein and the flight echelon went to Roi. From these locations, for the rest of the war, the squadron took part in strikes against the Marshall Islands.
On January 31, 1945, VMO-155 was redesignated Marine Fighting Squadron 155 (VMF-155). The squadron was deactivated on October 15, 1945, shortly after the cessation of hostilities with Japan.
See also
United States Marine Corps Aviation
List of active United States Marine Corps aircraft squadrons
List of inactive United States Marine Corps aircraft squadrons
References
Notes
Bibliography
Crowder, Michael J. (2000). United States Marine Corps Aviation Squadron Lineage, Insignia & History - Volume One - The Fighter Squadrons. Turner Publishing Company. .
Web
https://kb.osu.edu/dspace/handle/1811/50372
Fighting155
Inactive units of the United States Marine Corps |
Where the Tracks End (Spanish: El último vagón, ) is a 2023 Mexican comedy-drama film directed by Ernesto Contreras from a screenplay by Javier Peñalosa. Starring Adriana Barraza and Kaarlo Isaacs. It is based on the novel of the same name by Ángeles Doñantes.
Synopsis
Ikal and his family live on a railway that travels across the country, as his father works in the repair and construction of railways, which prevents the family and the boy from settling in one place for a while. However, at the last stop, Ikal meets Chico, Valeria and Tuerto, friends who are students of Georgina, a teacher who does everything possible for her students to learn despite precarious circumstances. But, when everything seems to settle for Ikal at school, a new threat arrives, an inspector from the Ministry of Education, who has the mission of closing rural schools. With his sights set on Ikal's school, the inspector will see in the young man everything he has learned about the value of friendship, the importance of growing up and the inspiration that teachers can generate in the lives of students.
Cast
The actors participating in this film are:
Adriana Barraza as Teacher Georgina
Kaarlo Isaacs as Ikal
Memo Villegas as Hugo Valenzuela (adult Ikal)
Diego Montessoro as Chico
Frida Cruz as Valeria
Ikal Paredes as Tuerto
Teté Espinoza as Lucero
Jeronimo Medina as Tomás
Gabriela Cartol as Mirna
Nova Coronel as Diamantina
Adrián Vázquez as Mr. Ochoa
Leonardo Alonso as Foreman
Fátima Molina as Adult Valeria
Sofía Domínguez Corte as Carola
Osvani Rivera as Chesco
Victoria Díaz as Diana Dinamita
Blanca Guerra as Ethereal Mage
Production
Principal photography took place on location at Atlangatepec, Tlaxcala; Tlapacoyan, Veracruz and Oriental, Puebla located in Mexico.
Release
Where the Tracks End had a limited theatrical release on May 18, 2023, in Mexico and was later released worldwide on May 26 of the same year on Netflix.
References
External links
2023 films
2023 comedy-drama films
Mexican comedy-drama films
2020s Spanish-language films
Films set in Mexico
Films shot in Mexico
Films about educators
Films about education
Films about friendship
Films based on novels
Spanish-language Netflix original films
2020s Mexican films |
Micropterix paykullella is a species of moth belonging to the family Micropterigidae. It was described by Johan Christian Fabricius in 1794. It is distributed locally across the whole Alps, occurring in France, Italy, Austria and Switzerland.
The wingspan is 9–13 mm. Adults are on wing from May to June and fly during the day.
Adults have been found above the timberline (2,200 meters) feeding on pollen of Helianthemum species. They have also been observed swarming around dwarf shrubs in clearings and on the outskirts of forests at lower montane levels.
References
Micropterigidae
Moths described in 1794
Moths of Europe |
The 1924–25 Niagara Purple Eagles men's basketball team represented Niagara University during the 1924–25 NCAA college men's basketball season. The head coach was Peter Dwyer, coaching his second season with the Purple Eagles.
Schedule
|-
References
Niagara Purple Eagles men's basketball seasons
Niagara
Niagara Purple Eagles men's basketball
Niagara Purple Eagles men's basketball |
Dvorska Luda predstavlja: Ples sa vragom () is a compilation released in 2009.
The compilation features two EPs: 'Konflikt" by Joe Shua Kizz and "Zbog vlasti" by Dvorska Luda and Psiho Mistik.
Track listing
Konflikt EP
"Konflikt" - 3:40
"Korumpirani, a?" - 2:59
Guest musician: 2JNK
First verse: Joe Shua Kizz
Second verse: 2JNK
"Molotov koktel" - 4:59
Guest musicians: Dvorska Luda, 2JNK and Darzee
First verse: Dvorska Luda
Second verse: 2JNK
Third verse: Darzee
Fourth verse: Joe Shua Kizz
Zbog vlasti EP
"Zbog vlasti" - 5:00
First verse: Dvorska Luda
Second verse: Psiho Mistik
Third verse: Dvorska Luda
"Odjek revolucije" - 3:59
First verse: Psiho Mistik
Second verse: Dvorska Luda
Bonus Tracks
"Heavy jazzerica" - 3:46
First verse: Dvorska Luda
Second verse: Joe Shua Kizz
Third verse: Labia
Fourth verse: Psiho Mistik
"9. krug pakla" - 5:05
First verse: Dvorska Luda
Second verse: Labia
Third verse: Psiho Mistik
Chorus: Dvorska Luda
Fourth verse: 2JNK
Fifth verse: Darzee
Sixth verse: Joe Shua Kizz
Chorus: Dvorska Luda
2009 compilation albums
Dvorska Luda albums
Barska Stoka albums |
```yaml
{{- if .Values.influxdb.enabled }}
# Fluentbit deployment for Fission
#
# Requires:
# - service account: fission-svc
apiVersion: v1
kind: ConfigMap
metadata:
name: {{ .Release.Name }}-fission-fluentbit
data:
{{- if .Files.Get "config/fluentbit.conf" }}
fluentbit.conf: |
{{ .Files.Get "config/fluentbit.conf" | indent 3 }}
{{ else }}
{{ fail "invalid chart" }}
{{- end }}
{{- if .Files.Get "config/parsers.conf" }}
parsers.conf: |
{{ .Files.Get "config/parsers.conf" | indent 3 }}
{{ else }}
{{ fail "invalid chart" }}
{{- end }}
{{- if .Values.logger.podSecurityPolicy.enabled }}
---
apiVersion: policy/v1beta1
kind: PodSecurityPolicy
metadata:
name: {{ .Release.Name }}-fission-logger-privileged
labels:
chart: "{{ .Chart.Name }}-{{ .Chart.Version }}"
svc: logger
spec:
privileged: true
seLinux:
rule: RunAsAny
supplementalGroups:
rule: RunAsAny
runAsUser:
rule: RunAsAny
fsGroup:
rule: RunAsAny
volumes:
- '*'
{{- if .Values.logger.podSecurityPolicy.additionalCapabilities }}
allowedCapabilities:
{{- range .Values.logger.podSecurityPolicy.additionalCapabilities }}
- {{ . }}
{{- end }}
{{- end }}
---
apiVersion: rbac.authorization.k8s.io/v1
kind: Role
metadata:
name: psp:{{ .Release.Name }}-fission-logger-privileged
labels:
chart: "{{ .Chart.Name }}-{{ .Chart.Version }}"
svc: logger
rules:
- apiGroups: ['policy']
resources: ['podsecuritypolicies']
verbs: ['use']
resourceNames:
- {{ .Release.Name }}-fission-logger-privileged
---
apiVersion: rbac.authorization.k8s.io/v1
kind: RoleBinding
metadata:
name: psp:{{ .Release.Name }}-fission-logger-privileged
labels:
chart: "{{ .Chart.Name }}-{{ .Chart.Version }}"
svc: logger
roleRef:
kind: Role
name: psp:{{ .Release.Name }}-fission-logger-privileged
apiGroup: rbac.authorization.k8s.io
subjects:
- kind: ServiceAccount
name: default
namespace: {{ .Release.Namespace }}
{{- end }}
---
apiVersion: apps/v1
kind: DaemonSet
metadata:
name: logger
labels:
chart: "{{ .Chart.Name }}-{{ .Chart.Version }}"
svc: logger
spec:
selector:
matchLabels:
svc: logger
template:
metadata:
labels:
svc: logger
spec:
initContainers:
- name: init
image: {{ .Values.busyboxImage | quote }}
imagePullPolicy: {{ .Values.pullPolicy }}
command: ['mkdir', '-p', '/var/log/fission']
volumeMounts:
- name: container-log
mountPath: /var/log/
readOnly: false
{{- if .Values.logger.enableSecurityContext }}
securityContext:
privileged: true
{{- end }}
containers:
- name: logger
image: {{ include "fission-bundleImage" . | quote }}
imagePullPolicy: {{ .Values.pullPolicy }}
env:
- name: NODE_NAME
valueFrom:
fieldRef:
apiVersion: v1
fieldPath: spec.nodeName
command: ["/fission-bundle"]
args: ["--logger"]
volumeMounts:
- name: container-log
mountPath: /var/log/
readOnly: false
- name: docker-log
mountPath: /var/lib/docker/containers
readOnly: true
{{- if .Values.logger.enableSecurityContext }}
securityContext:
privileged: true
{{- end }}
- name: fluentbit
{{- if .Values.repository }}
image: "{{ .Values.logger.fluentdImageRepository }}/{{ .Values.logger.fluentdImage }}:{{ .Values.logger.fluentdImageTag }}"
{{ else }}
image: "{{ .Values.logger.fluentdImage }}:{{ .Values.logger.fluentdImageTag }}"
{{- end }}
imagePullPolicy: {{ .Values.pullPolicy }}
# CMD ["/fluent-bit/bin/fluent-bit", "-c", "/fluent-bit/etc/fluent-bit.conf"]
command: ["/fluent-bit/bin/fluent-bit", "-c", "/fluent-bit/etc/fluentbit.conf"]
env:
- name: INFLUXDB_ADDRESS
value: influxdb
- name: INFLUXDB_PORT
value: "8086"
- name: INFLUXDB_DBNAME
value: "fissionFunctionLog"
- name: INFLUXDB_USERNAME
valueFrom:
secretKeyRef:
name: influxdb
key: username
- name: INFLUXDB_PASSWD
valueFrom:
secretKeyRef:
name: influxdb
key: password
- name: LOG_PATH
value: /var/log/fission/*.log
{{- if .Values.logger.enableSecurityContext }}
securityContext:
privileged: true
{{- end }}
volumeMounts:
- name: container-log
mountPath: /var/log/
readOnly: false
- name: docker-log
mountPath: /var/lib/docker/containers
readOnly: true
- name: fluentbit-config
mountPath: /fluent-bit/etc/
readOnly: true
serviceAccountName: fission-fluentbit
volumes:
- name: container-log
hostPath:
path: /var/log/
- name: docker-log
hostPath:
path: /var/lib/docker/containers
# Fluentbit config location: /fluent-bit/etc/*.conf
- name: fluentbit-config
configMap:
name: {{ .Release.Name }}-fission-fluentbit
{{- with .Values.imagePullSecrets }}
imagePullSecrets:
{{- toYaml . | nindent 8 }}
{{- end }}
updateStrategy:
type: RollingUpdate
{{- end }}
``` |
```c++
/*
[auto_generated]
boost/numeric/odeint/integrate/integrate_const.hpp
[begin_description]
Constant integration of ODEs, meaning that the state of the ODE is observed on constant time intervals.
The routines makes full use of adaptive and dense-output methods.
[end_description]
(See accompanying file LICENSE_1_0.txt or
copy at path_to_url
*/
#ifndef BOOST_NUMERIC_ODEINT_INTEGRATE_INTEGRATE_CONST_HPP_INCLUDED
#define BOOST_NUMERIC_ODEINT_INTEGRATE_INTEGRATE_CONST_HPP_INCLUDED
#include <boost/type_traits/is_same.hpp>
#include <boost/numeric/odeint/stepper/stepper_categories.hpp>
#include <boost/numeric/odeint/iterator/integrate/null_observer.hpp>
#include <boost/numeric/odeint/iterator/integrate/detail/integrate_const.hpp>
#include <boost/numeric/odeint/iterator/integrate/detail/integrate_adaptive.hpp>
namespace boost {
namespace numeric {
namespace odeint {
/*
* Integrates with constant time step dt.
*/
template< class Stepper , class System , class State , class Time , class Observer >
size_t integrate_const(
Stepper stepper , System system , State &start_state ,
Time start_time , Time end_time , Time dt ,
Observer observer
)
{
typedef typename odeint::unwrap_reference< Stepper >::type::stepper_category stepper_category;
// we want to get as fast as possible to the end
if( boost::is_same< null_observer , Observer >::value )
{
return detail::integrate_adaptive(
stepper , system , start_state ,
start_time , end_time , dt ,
observer , stepper_category() );
}
else
{
return detail::integrate_const( stepper , system , start_state ,
start_time , end_time , dt ,
observer , stepper_category() );
}
}
/**
* \brief Second version to solve the forwarding problem,
* can be called with Boost.Range as start_state.
*/
template< class Stepper , class System , class State , class Time , class Observer >
size_t integrate_const(
Stepper stepper , System system , const State &start_state ,
Time start_time , Time end_time , Time dt ,
Observer observer
)
{
typedef typename odeint::unwrap_reference< Stepper >::type::stepper_category stepper_category;
// we want to get as fast as possible to the end
if( boost::is_same< null_observer , Observer >::value )
{
return detail::integrate_adaptive(
stepper , system , start_state ,
start_time , end_time , dt ,
observer , stepper_category() );
}
else
{
return detail::integrate_const( stepper , system , start_state ,
start_time , end_time , dt ,
observer , stepper_category() );
}
}
/**
* \brief integrate_const without observer calls
*/
template< class Stepper , class System , class State , class Time >
size_t integrate_const(
Stepper stepper , System system , State &start_state ,
Time start_time , Time end_time , Time dt
)
{
return integrate_const( stepper , system , start_state , start_time , end_time , dt , null_observer() );
}
/**
* \brief Second version to solve the forwarding problem,
* can be called with Boost.Range as start_state.
*/
template< class Stepper , class System , class State , class Time >
size_t integrate_const(
Stepper stepper , System system , const State &start_state ,
Time start_time , Time end_time , Time dt
)
{
return integrate_const( stepper , system , start_state , start_time , end_time , dt , null_observer() );
}
/********* DOXYGEN *********/
/**
* \fn integrate_const( Stepper stepper , System system , State &start_state , Time start_time , Time end_time , Time dt , Observer observer )
* \brief Integrates the ODE with constant step size.
*
* Integrates the ODE defined by system using the given stepper.
* This method ensures that the observer is called at constant intervals dt.
* If the Stepper is a normal stepper without step size control, dt is also
* used for the numerical scheme. If a ControlledStepper is provided, the
* algorithm might reduce the step size to meet the error bounds, but it is
* ensured that the observer is always called at equidistant time points
* t0 + n*dt. If a DenseOutputStepper is used, the step size also may vary
* and the dense output is used to call the observer at equidistant time
* points.
*
* \param stepper The stepper to be used for numerical integration.
* \param system Function/Functor defining the rhs of the ODE.
* \param start_state The initial condition x0.
* \param start_time The initial time t0.
* \param end_time The final integration time tend.
* \param dt The time step between observer calls, _not_ necessarily the
* time step of the integration.
* \param observer Function/Functor called at equidistant time intervals.
* \return The number of steps performed.
*/
} // namespace odeint
} // namespace numeric
} // namespace boost
#endif // BOOST_NUMERIC_ODEINT_INTEGRATE_INTEGRATE_CONST_HPP_INCLUDED
``` |
Minotti is an Italian surname. Notable people with the surname include:
Lorenzo Minotti (born 1967), Italian footballer
Nadir Minotti (born 1992), Italian footballer
Christian Minotti, Italian long-distance swimmer
Felice Minotti, (1887–1963), Italian actor
Italian-language surnames |
The Party of Eros: Radical Social Thought and the Realm of Freedom is a book-length contemporaneous intellectual history of the New Left written by Richard King and published by University of North Carolina Press in 1972. It analyzes the intellectual development of figures including Norman O. Brown, Paul Goodman, Herbert Marcuse, Dwight Macdonald, and Wilhelm Reich.
Bibliography
External links
Full text at the Internet Archive
1972 non-fiction books
English-language books
University of North Carolina Press books
Intellectual history |
Uzbekistan Banking Association (UBA) is a voluntary trade association for commercial banks of the Republic of Uzbekistan. It is a noncommercial public organization, which fulfils the tasks of protecting the legitimate interests of banks. It ensures national commercial bank's conformity to the level of international standards with subsequent integration of banking sector in the world banking community.
The Uzbekistan Banking Association has 23 member banks, which represent over 90% of bank assets in the Republic of Uzbekistan. Uzbekistan Banking Association plays an essential role in economic and educational development of Uzbekistan. It has created the infrastructure which consists of 11 companies, which makes big contributions to the Uzbekistan economy.
In addition to this, Uzbekistan Banking Association is one of the owners of Management Development Institute of Singapore in Tashkent, which trains professionals in the economics of Uzbekistan. Uzbekistan Banking Association fully operates by the laws of Republic of Uzbekistan, by the Edicts, Decrees of the President of Republic of Uzbekistan, and by the Edicts which are made by Cabinet of Ministers of Republic of Uzbekistan.
History
The Uzbekistan Banking Association was first established in July 1995, by edict of Presidents of the Republic of Uzbekistan Islam Karimov.
Missions and objectives
Islam Karimov, President of the Republic Uzbekistan said "the mission of the Association of banks of Uzbekistan is a command of time. In present new conditions, the banking network gains the increasing value that connects all branches of economy and serves their development. Banks define stability, direction and pace of development of a national economy, its banks that create a basis of decent life of each citizen".
Uzbekistan Banking Association has set its own missions and objectives, which would lead to the development of banks and economy in Uzbekistan. The main missions and objectives of the Uzbekistan Banking Association are given as follows:
Increase the roles of commercial banks in economy of Uzbekistan.
Creation of the unique bank infrastructure, for the development of the bank systems in Uzbekistan, and raise the quality of the banks to the international standards.
Cooperate for the self-development of commercial banks.
Protect the rights and interests of Uzbekistan Banking Association members.
Develop the reliability for the commercial banks among citizens.
Creating the conditions for the capitalization of the banks.
Activate the investment procedures at commercial banks.
Develop the system of credit card usage in Uzbekistan.
Developing the financial systems of banks
General Director
Uzbekistan Banking Association is controlled by general director. The general director is elected by its members the commercial banks of Uzbekistan. Currently, the general director of Uzbekistan Banking Association is Abdullaev Saidullo Parxodbekovich.
Location
Uzbekistan Banking Association's main building is located in Uzbekistan, Tashkent city, 100027, Chilanzar district, A.Xodjaeva street, house 1.
See also
Central Bank of Uzbekistan
National Bank of Uzbekistan
References
External links
Bank association of Uzbekistan
Bank system in Uzbekistan
Article about the association
Brochure about the bank association
Information about the bank association
Article about the bank
Constitution of the Banking Association of Uzbekistan
Structure of Banking association
Bankers associations
Tashkent
Banks of Uzbekistan |
Sonni is a village in Türi Parish, Rapla County in western-central Estonia.
References
Villages in Rapla County |
National Democratic Student Organization is a student organisation in Nepal. It is the student wing of the Constitutional monarchist Rastriya Prajatantra Party.
References
Student wings of political parties in Nepal
Student wings of conservative parties
Students' unions in Nepal
Rastriya Prajatantra Party |
Anat Lelior (; born April 29, 2000) is an Israeli surfer. She represented Israel at the 2020 Summer Olympics, and finished 17th in the shortboard.
Early life
Lelior was born in Tel Aviv, Israel, to a Jewish family. Her mother is painter Eti Jacobi, and her father is Yochai Lelior. She began surfing at the age of 5 when her father would take her out to the Mediterranean Sea at the coasts of her hometown Tel Aviv. Her younger sister Noa Lelior is a professional surfer as well, and in 2015 she decided to take the family to surfing contests abroad instead of having her Bat Mitzvah party - which in turn spearheaded her older sister Anat to a bigger stage in surfing. Lelior's surfing club Galim is owned by Shlomi Eyni and Inbar.
She serves as a soldier in the Israel Defense Forces.
Surfing career
Lelior was the 2018 World Surf League (WSL) Europe Pro Junior runner-up.
In 2019, she won the Burton Automotive Pro International Trials in Australia at Surfest. She also won the 2019 Deeply Pro Anglet, a WSL Qualifying Series (QS) 1,500 event at Chambre d’Amour.
2020 Olympic Games
Lelior qualified for the Surfing at the 2020 Summer Olympics by finishing as the highest-ranked surfer from Europe (Israel is considered part of Europe, according to International Olympic Committee protocol) and one of the top 30 surfers in the overall open division at the 2019 ISA World Surfing Games in Miyazaki, Japan.
References
External links
Anat Lelior at BoardRiding.com
2000 births
Living people
World Surf League surfers
Israeli surfers
Israeli female surfers
Sportspeople from Tel Aviv
Jewish sportspeople
Israeli Jews
Olympic surfers for Israel
Surfers at the 2020 Summer Olympics |
Coli Saco (born 15 May 2002) is a professional footballer who plays as a midfielder for club Ancona on loan from Napoli. Born in France, Saco represents Mali at under-23 level.
Club career
Born in Créteil, Saco joined Le Havre's youth sector in 2017, aged 15, before moving to Sochaux one year later. He then came through the youth ranks of the Lionceaux, taking part in the 2019–20 Coupe Gambardella, where Sochaux reached the round of 16 before the competition was cancelled, due to the emergency caused by the COVID-19 pandemic.
In October 2020, Saco entered AC Milan's academy; however, he was released after just one season, having not managed to break into the under-19 team consistently. In September 2021, he officially joined fellow Italian club Napoli after a successful trial.
Having impressed with his performances for Napoli's under-19 squad, during the 2021–22 season Saco started training with the first team, under manager Luciano Spalletti. The midfielder originally received his first official call-up to the senior team for a Serie A match against Juventus on 6 January 2022: however, having tested positive for COVID-19, he eventually had to withdraw from the match-day squad.
On 15 July 2022, Saco joined Serie C side Pro Vercelli on a season-long loan. He then made his professional debut for the club on 3 September, starting and playing 90 minutes in a 1–0 league win against Padova. On 5 November, he scored his first professional goal in a 3–1 league loss against AlbinoLeffe.
On 1 September 2023, Saco joined fellow Serie C club Ancona on loan for the remainder of the season.
International career
In June 2023, Saco was included in the final squad of the Malian under-23 national team for the 2023 U-23 Africa Cup of Nations, hosted in Morocco, where the Eagles finished in third place and qualified for the 2024 Summer Olympics in Paris.
Style of play
Saco is a left-footed midfielder, who has been mainly regarded for his physical attributes, which allow him to win many headers and keep possession. Despite his slow pace, he has proved to have good abilities in reading the game and finding goal opportunities, thanks to his off-the-ball movement and his heading. He has also been noticed for his vision and his long-range passing prowess.
Although he has been compared to André-Frank Zambo Anguissa, he cited Paul Pogba and Yaya Touré as his main sources of inspiration.
Personal life
Born in France, Saco is of Malian descent.
Career statistics
Club
Honours
Mali U23
U-23 Africa Cup of Nations bronze medal: 2023
References
External links
Player profile at UNFP
2002 births
Living people
French men's footballers
Malian men's footballers
Men's association football midfielders
Serie C players
Le Havre AC players
FC Sochaux-Montbéliard players
AC Milan players
SSC Napoli players
FC Pro Vercelli 1892 players
US Ancona players
French expatriate men's footballers
French expatriate sportspeople in Italy
Expatriate men's footballers in Italy |
```go
/*
path_to_url
Unless required by applicable law or agreed to in writing, software
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package docker
import (
"bytes"
"fmt"
"io"
"github.com/containerd/containerd/errdefs"
"github.com/containerd/containerd/log"
)
const maxRetry = 3
type httpReadSeeker struct {
size int64
offset int64
rc io.ReadCloser
open func(offset int64) (io.ReadCloser, error)
closed bool
errsWithNoProgress int
}
func newHTTPReadSeeker(size int64, open func(offset int64) (io.ReadCloser, error)) (io.ReadCloser, error) {
return &httpReadSeeker{
size: size,
open: open,
}, nil
}
func (hrs *httpReadSeeker) Read(p []byte) (n int, err error) {
if hrs.closed {
return 0, io.EOF
}
rd, err := hrs.reader()
if err != nil {
return 0, err
}
n, err = rd.Read(p)
hrs.offset += int64(n)
if n > 0 || err == nil {
hrs.errsWithNoProgress = 0
}
if err == io.ErrUnexpectedEOF {
// connection closed unexpectedly. try reconnecting.
if n == 0 {
hrs.errsWithNoProgress++
if hrs.errsWithNoProgress > maxRetry {
return // too many retries for this offset with no progress
}
}
if hrs.rc != nil {
if clsErr := hrs.rc.Close(); clsErr != nil {
log.L.WithError(clsErr).Error("httpReadSeeker: failed to close ReadCloser")
}
hrs.rc = nil
}
if _, err2 := hrs.reader(); err2 == nil {
return n, nil
}
} else if err == io.EOF {
// The CRI's imagePullProgressTimeout relies on responseBody.Close to
// update the process monitor's status. If the err is io.EOF, close
// the connection since there is no more available data.
if hrs.rc != nil {
if clsErr := hrs.rc.Close(); clsErr != nil {
log.L.WithError(clsErr).Error("httpReadSeeker: failed to close ReadCloser after io.EOF")
}
hrs.rc = nil
}
}
return
}
func (hrs *httpReadSeeker) Close() error {
if hrs.closed {
return nil
}
hrs.closed = true
if hrs.rc != nil {
return hrs.rc.Close()
}
return nil
}
func (hrs *httpReadSeeker) Seek(offset int64, whence int) (int64, error) {
if hrs.closed {
return 0, fmt.Errorf("Fetcher.Seek: closed: %w", errdefs.ErrUnavailable)
}
abs := hrs.offset
switch whence {
case io.SeekStart:
abs = offset
case io.SeekCurrent:
abs += offset
case io.SeekEnd:
if hrs.size == -1 {
return 0, fmt.Errorf("Fetcher.Seek: unknown size, cannot seek from end: %w", errdefs.ErrUnavailable)
}
abs = hrs.size + offset
default:
return 0, fmt.Errorf("Fetcher.Seek: invalid whence: %w", errdefs.ErrInvalidArgument)
}
if abs < 0 {
return 0, fmt.Errorf("Fetcher.Seek: negative offset: %w", errdefs.ErrInvalidArgument)
}
if abs != hrs.offset {
if hrs.rc != nil {
if err := hrs.rc.Close(); err != nil {
log.L.WithError(err).Error("Fetcher.Seek: failed to close ReadCloser")
}
hrs.rc = nil
}
hrs.offset = abs
}
return hrs.offset, nil
}
func (hrs *httpReadSeeker) reader() (io.Reader, error) {
if hrs.rc != nil {
return hrs.rc, nil
}
if hrs.size == -1 || hrs.offset < hrs.size {
// only try to reopen the body request if we are seeking to a value
// less than the actual size.
if hrs.open == nil {
return nil, fmt.Errorf("cannot open: %w", errdefs.ErrNotImplemented)
}
rc, err := hrs.open(hrs.offset)
if err != nil {
return nil, fmt.Errorf("httpReadSeeker: failed open: %w", err)
}
if hrs.rc != nil {
if err := hrs.rc.Close(); err != nil {
log.L.WithError(err).Error("httpReadSeeker: failed to close ReadCloser")
}
}
hrs.rc = rc
} else {
// There is an edge case here where offset == size of the content. If
// we seek, we will probably get an error for content that cannot be
// sought (?). In that case, we should err on committing the content,
// as the length is already satisfied but we just return the empty
// reader instead.
hrs.rc = io.NopCloser(bytes.NewReader([]byte{}))
}
return hrs.rc, nil
}
``` |
```pod
=pod
=head1 NAME
DSA_generate_parameters - generate DSA parameters
=head1 SYNOPSIS
#include <openssl/dsa.h>
DSA *DSA_generate_parameters(int bits, unsigned char *seed,
int seed_len, int *counter_ret, unsigned long *h_ret,
void (*callback)(int, int, void *), void *cb_arg);
=head1 DESCRIPTION
DSA_generate_parameters() generates primes p and q and a generator g
for use in the DSA.
B<bits> is the length of the prime to be generated; the DSS allows a
maximum of 1024 bits.
If B<seed> is B<NULL> or B<seed_len> E<lt> 20, the primes will be
generated at random. Otherwise, the seed is used to generate
them. If the given seed does not yield a prime q, a new random
seed is chosen.
DSA_generate_parameters() places the iteration count in
*B<counter_ret> and a counter used for finding a generator in
*B<h_ret>, unless these are B<NULL>.
A callback function may be used to provide feedback about the progress
of the key generation. If B<callback> is not B<NULL>, it will be
called as follows:
=over 4
=item *
When a candidate for q is generated, B<callback(0, m++, cb_arg)> is called
(m is 0 for the first candidate).
=item *
When a candidate for q has passed a test by trial division,
B<callback(1, -1, cb_arg)> is called.
While a candidate for q is tested by Miller-Rabin primality tests,
B<callback(1, i, cb_arg)> is called in the outer loop
(once for each witness that confirms that the candidate may be prime);
i is the loop counter (starting at 0).
=item *
When a prime q has been found, B<callback(2, 0, cb_arg)> and
B<callback(3, 0, cb_arg)> are called.
=item *
Before a candidate for p (other than the first) is generated and tested,
B<callback(0, counter, cb_arg)> is called.
=item *
When a candidate for p has passed the test by trial division,
B<callback(1, -1, cb_arg)> is called.
While it is tested by the Miller-Rabin primality test,
B<callback(1, i, cb_arg)> is called in the outer loop
(once for each witness that confirms that the candidate may be prime).
i is the loop counter (starting at 0).
=item *
When p has been found, B<callback(2, 1, cb_arg)> is called.
=item *
When the generator has been found, B<callback(3, 1, cb_arg)> is called.
=back
=head1 RETURN VALUE
DSA_generate_parameters() returns a pointer to the DSA structure, or
B<NULL> if the parameter generation fails. The error codes can be
obtained by L<ERR_get_error(3)|ERR_get_error(3)>.
=head1 BUGS
Seed lengths E<gt> 20 are not supported.
=head1 SEE ALSO
L<dsa(3)|dsa(3)>, L<ERR_get_error(3)|ERR_get_error(3)>, L<rand(3)|rand(3)>,
L<DSA_free(3)|DSA_free(3)>
=head1 HISTORY
DSA_generate_parameters() appeared in SSLeay 0.8. The B<cb_arg>
argument was added in SSLeay 0.9.0.
In versions up to OpenSSL 0.9.4, B<callback(1, ...)> was called
in the inner loop of the Miller-Rabin test whenever it reached the
squaring step (the parameters to B<callback> did not reveal how many
witnesses had been tested); since OpenSSL 0.9.5, B<callback(1, ...)>
is called as in BN_is_prime(3), i.e. once for each witness.
=cut
``` |
```c
/****************************************************************************
*
* gxvprop.c
*
* TrueTypeGX/AAT prop table validation (body).
*
* suzuki toshiya, Masatake YAMATO, Red Hat K.K.,
* David Turner, Robert Wilhelm, and Werner Lemberg.
*
* This file is part of the FreeType project, and may only be used,
* modified, and distributed under the terms of the FreeType project
* license, LICENSE.TXT. By continuing to use, modify, or distribute
* this file you indicate that you have read the license and
* understand and accept it fully.
*
*/
/****************************************************************************
*
* gxvalid is derived from both gxlayout module and otvalid module.
* Development of gxlayout is supported by the Information-technology
* Promotion Agency(IPA), Japan.
*
*/
#include "gxvalid.h"
#include "gxvcommn.h"
/**************************************************************************
*
* The macro FT_COMPONENT is used in trace mode. It is an implicit
* parameter of the FT_TRACE() and FT_ERROR() macros, used to print/log
* messages during execution.
*/
#undef FT_COMPONENT
#define FT_COMPONENT gxvprop
/*************************************************************************/
/*************************************************************************/
/***** *****/
/***** Data and Types *****/
/***** *****/
/*************************************************************************/
/*************************************************************************/
#define GXV_PROP_HEADER_SIZE ( 4 + 2 + 2 )
#define GXV_PROP_SIZE_MIN GXV_PROP_HEADER_SIZE
typedef struct GXV_prop_DataRec_
{
FT_Fixed version;
} GXV_prop_DataRec, *GXV_prop_Data;
#define GXV_PROP_DATA( field ) GXV_TABLE_DATA( prop, field )
#define GXV_PROP_FLOATER 0x8000U
#define GXV_PROP_USE_COMPLEMENTARY_BRACKET 0x1000U
#define GXV_PROP_COMPLEMENTARY_BRACKET_OFFSET 0x0F00U
#define GXV_PROP_ATTACHING_TO_RIGHT 0x0080U
#define GXV_PROP_RESERVED 0x0060U
#define GXV_PROP_DIRECTIONALITY_CLASS 0x001FU
/*************************************************************************/
/*************************************************************************/
/***** *****/
/***** UTILITY FUNCTIONS *****/
/***** *****/
/*************************************************************************/
/*************************************************************************/
static void
gxv_prop_zero_advance_validate( FT_UShort gid,
GXV_Validator gxvalid )
{
FT_Face face;
FT_Error error;
FT_GlyphSlot glyph;
GXV_NAME_ENTER( "zero advance" );
face = gxvalid->face;
error = FT_Load_Glyph( face,
gid,
FT_LOAD_IGNORE_TRANSFORM );
if ( error )
FT_INVALID_GLYPH_ID;
glyph = face->glyph;
if ( glyph->advance.x != (FT_Pos)0 ||
glyph->advance.y != (FT_Pos)0 )
{
GXV_TRACE(( " found non-zero advance in zero-advance glyph\n" ));
FT_INVALID_DATA;
}
GXV_EXIT;
}
/* Pass 0 as GLYPH to check the default property */
static void
gxv_prop_property_validate( FT_UShort property,
FT_UShort glyph,
GXV_Validator gxvalid )
{
if ( glyph != 0 && ( property & GXV_PROP_FLOATER ) )
gxv_prop_zero_advance_validate( glyph, gxvalid );
if ( property & GXV_PROP_USE_COMPLEMENTARY_BRACKET )
{
FT_UShort offset;
char complement;
offset = (FT_UShort)( property & GXV_PROP_COMPLEMENTARY_BRACKET_OFFSET );
if ( offset == 0 )
{
GXV_TRACE(( " found zero offset to property\n" ));
FT_INVALID_OFFSET;
}
complement = (char)( offset >> 8 );
if ( complement & 0x08 )
{
/* Top bit is set: negative */
/* Calculate the absolute offset */
complement = (char)( ( complement & 0x07 ) + 1 );
/* The gid for complement must be greater than 0 */
if ( glyph <= complement )
{
GXV_TRACE(( " found non-positive glyph complement\n" ));
FT_INVALID_DATA;
}
}
else
{
/* The gid for complement must be the face. */
gxv_glyphid_validate( (FT_UShort)( glyph + complement ), gxvalid );
}
}
else
{
if ( property & GXV_PROP_COMPLEMENTARY_BRACKET_OFFSET )
GXV_TRACE(( "glyph %d cannot have complementary bracketing\n",
glyph ));
}
/* this is introduced in version 2.0 */
if ( property & GXV_PROP_ATTACHING_TO_RIGHT )
{
if ( GXV_PROP_DATA( version ) == 0x00010000UL )
{
GXV_TRACE(( " found older version (1.0) in new version table\n" ));
FT_INVALID_DATA;
}
}
if ( property & GXV_PROP_RESERVED )
{
GXV_TRACE(( " found non-zero bits in reserved bits\n" ));
FT_INVALID_DATA;
}
if ( ( property & GXV_PROP_DIRECTIONALITY_CLASS ) > 11 )
{
/* TODO: Too restricted. Use the validation level. */
if ( GXV_PROP_DATA( version ) == 0x00010000UL ||
GXV_PROP_DATA( version ) == 0x00020000UL )
{
GXV_TRACE(( " found too old version in directionality class\n" ));
FT_INVALID_DATA;
}
}
}
static void
gxv_prop_LookupValue_validate( FT_UShort glyph,
GXV_LookupValueCPtr value_p,
GXV_Validator gxvalid )
{
gxv_prop_property_validate( value_p->u, glyph, gxvalid );
}
/*
+===============+ --------+
| lookup header | |
+===============+ |
| BinSrchHeader | |
+===============+ |
| lastGlyph[0] | |
+---------------+ |
| firstGlyph[0] | | head of lookup table
+---------------+ | +
| offset[0] | -> | offset [byte]
+===============+ | +
| lastGlyph[1] | | (glyphID - firstGlyph) * 2 [byte]
+---------------+ |
| firstGlyph[1] | |
+---------------+ |
| offset[1] | |
+===============+ |
|
... |
|
16bit value array |
+===============+ |
| value | <-------+
...
*/
static GXV_LookupValueDesc
gxv_prop_LookupFmt4_transit( FT_UShort relative_gindex,
GXV_LookupValueCPtr base_value_p,
FT_Bytes lookuptbl_limit,
GXV_Validator gxvalid )
{
FT_Bytes p;
FT_Bytes limit;
FT_UShort offset;
GXV_LookupValueDesc value;
/* XXX: check range? */
offset = (FT_UShort)( base_value_p->u +
relative_gindex * sizeof ( FT_UShort ) );
p = gxvalid->lookuptbl_head + offset;
limit = lookuptbl_limit;
GXV_LIMIT_CHECK ( 2 );
value.u = FT_NEXT_USHORT( p );
return value;
}
/*************************************************************************/
/*************************************************************************/
/***** *****/
/***** prop TABLE *****/
/***** *****/
/*************************************************************************/
/*************************************************************************/
FT_LOCAL_DEF( void )
gxv_prop_validate( FT_Bytes table,
FT_Face face,
FT_Validator ftvalid )
{
FT_Bytes p = table;
FT_Bytes limit = 0;
GXV_ValidatorRec gxvalidrec;
GXV_Validator gxvalid = &gxvalidrec;
GXV_prop_DataRec proprec;
GXV_prop_Data prop = &proprec;
FT_Fixed version;
FT_UShort format;
FT_UShort defaultProp;
gxvalid->root = ftvalid;
gxvalid->table_data = prop;
gxvalid->face = face;
FT_TRACE3(( "validating `prop' table\n" ));
GXV_INIT;
GXV_LIMIT_CHECK( 4 + 2 + 2 );
version = FT_NEXT_LONG( p );
format = FT_NEXT_USHORT( p );
defaultProp = FT_NEXT_USHORT( p );
GXV_TRACE(( " version 0x%08x\n", version ));
GXV_TRACE(( " format 0x%04x\n", format ));
GXV_TRACE(( " defaultProp 0x%04x\n", defaultProp ));
/* only versions 1.0, 2.0, 3.0 are defined (1996) */
if ( version != 0x00010000UL &&
version != 0x00020000UL &&
version != 0x00030000UL )
{
GXV_TRACE(( " found unknown version\n" ));
FT_INVALID_FORMAT;
}
/* only formats 0x0000, 0x0001 are defined (1996) */
if ( format > 1 )
{
GXV_TRACE(( " found unknown format\n" ));
FT_INVALID_FORMAT;
}
gxv_prop_property_validate( defaultProp, 0, gxvalid );
if ( format == 0 )
{
FT_TRACE3(( "(format 0, no per-glyph properties, "
"remaining %d bytes are skipped)", limit - p ));
goto Exit;
}
/* format == 1 */
GXV_PROP_DATA( version ) = version;
gxvalid->lookupval_sign = GXV_LOOKUPVALUE_UNSIGNED;
gxvalid->lookupval_func = gxv_prop_LookupValue_validate;
gxvalid->lookupfmt4_trans = gxv_prop_LookupFmt4_transit;
gxv_LookupTable_validate( p, limit, gxvalid );
Exit:
FT_TRACE4(( "\n" ));
}
/* END */
``` |
The women's doubles tournament in tennis at the 2007 Pan American Games was played from July 18 to July 22. Jorgelina Cravero and Betina Jozami of Argentina were the champions.
Medals
Seeds
(champions, gold medal)
(quarterfinals)
(semifinals, bronze medal)
(quarterfinals)
Draw
References
Sports123.com
Women's doubles |
Armand-Théophile Cassagne (3 May 1823, Le Landin - 5 June 1907, Fontainebleau) was a French painter, watercolorist, lithographer, and writer; associated with the Barbizon School.
Biography
He studied with the English painter and lithographer, James Duffield Harding, who influenced his depictions of trees and foliage. His favorite place to work was in the Forest of Fontainebleau, where he created over three hundred watercolors and paintings.
In 1847, he was appointed a researcher and file clerk at the Municipal Court in Rouen. It was there, in the city library, that he studied the local manuscripts and art collections, under the guidance of the miniaturist, Théodore Basset de Jolimont, who was then serving as Librarian.
He went to Paris in 1852. There, he met Eugène Viollet-le-Duc, and became his student in 1857. That same year, he had his first showing at the Salon. He would continue to exhibit there and at other venues in Paris until 1894. During those years, in addition to Fontainebleau, he worked in Barbizon, the valleys near Chevreuse, the mountains around Grenoble, and along the Rhine. Until 1868, he taught a course in drawing at Fontainebleau. In 1889, he was awarded the Ordre des Palmes académiques for his watercolors.
In addition to his paintings, he was the author of textbooks on painting, including a "Treatise on Watercolors" (1877) and a "Treatise on Perspective, Applied to Artistic and Industrial Design" (1884).
In 1904, he donated most of his art collection to the city of Melun. In 1905, he began to suffer from "congestion", and died in 1907. A street in Melun was named for him. His works may be seen at the , the , and the Musée d'Art Moderne et Contemporain de Strasbourg.
Sources
Benezit Dictionary of Artists, Vol.3
Obituary in L'Abeille de Fontainebleau, 7 June 1907
Gérald Schurr and Pierre Cabanne, Dictionnaire des Petits Maîtres de la peinture, 1820-1920, Les Éditions de l'Amateur, Paris, 2008
Annie-Claire Lussiez, Armand Cassagne un peintre, un collectionneur, Musée de Melun, 1996
External links
"La donation Cassagne", exhibition at the Musée de Melun
1823 births
1907 deaths
19th-century French painters
French landscape painters
French watercolourists
People from Eure
20th-century French painters |
Charles Ernest Hackett (16 April 1885 – 27 March 1963) was an Australian rules footballer who played with Collingwood in the Victorian Football League (VFL).
Notes
References
Football: Championship of Australia: Meeting of the "Magpies", The (Adelaide) Register, (Saturday, 15 October 1910), p.11.
Collingwood Football Team: Victorian Champions, 1910, The Referee, (Wednesday, 19 October 1910), p.13.
External links
Charlie Hackett's profile at Collingwood Forever
1885 births
1963 deaths
Australian rules footballers from Melbourne
Collingwood Football Club players
People from Brunswick, Victoria |
```shell
Debugging `ssh` client issues
`Firewall` as a service
Quick port test with `netcat`
Find services running on your host
Disable `IPv6`
``` |
The Guilmette Formation is a geologic formation in Nevada. It preserves fossils dating back to the Devonian period.
See also
List of fossiliferous stratigraphic units in Nevada
Paleontology in Nevada
References
Devonian geology of Nevada
Devonian southern paleotropical deposits |
```objective-c
// This file is part of Eigen, a lightweight C++ template library
// for linear algebra.
//
//
// This Source Code Form is subject to the terms of the Mozilla
// with this file, You can obtain one at path_to_url
#ifndef EIGEN_GEOMETRY_SSE_H
#define EIGEN_GEOMETRY_SSE_H
namespace Eigen {
namespace internal {
template<class Derived, class OtherDerived>
struct quat_product<Architecture::SSE, Derived, OtherDerived, float, Aligned16>
{
static inline Quaternion<float> run(const QuaternionBase<Derived>& _a, const QuaternionBase<OtherDerived>& _b)
{
Quaternion<float> res;
const __m128 mask = _mm_setr_ps(0.f,0.f,0.f,-0.f);
__m128 a = _a.coeffs().template packet<Aligned16>(0);
__m128 b = _b.coeffs().template packet<Aligned16>(0);
__m128 s1 = _mm_mul_ps(vec4f_swizzle1(a,1,2,0,2),vec4f_swizzle1(b,2,0,1,2));
__m128 s2 = _mm_mul_ps(vec4f_swizzle1(a,3,3,3,1),vec4f_swizzle1(b,0,1,2,1));
pstore(&res.x(),
_mm_add_ps(_mm_sub_ps(_mm_mul_ps(a,vec4f_swizzle1(b,3,3,3,3)),
_mm_mul_ps(vec4f_swizzle1(a,2,0,1,0),
vec4f_swizzle1(b,1,2,0,0))),
_mm_xor_ps(mask,_mm_add_ps(s1,s2))));
return res;
}
};
template<class Derived, int Alignment>
struct quat_conj<Architecture::SSE, Derived, float, Alignment>
{
static inline Quaternion<float> run(const QuaternionBase<Derived>& q)
{
Quaternion<float> res;
const __m128 mask = _mm_setr_ps(-0.f,-0.f,-0.f,0.f);
pstore(&res.x(), _mm_xor_ps(mask, q.coeffs().template packet<Alignment>(0)));
return res;
}
};
template<typename VectorLhs,typename VectorRhs>
struct cross3_impl<Architecture::SSE,VectorLhs,VectorRhs,float,true>
{
static inline typename plain_matrix_type<VectorLhs>::type
run(const VectorLhs& lhs, const VectorRhs& rhs)
{
__m128 a = lhs.template packet<traits<VectorLhs>::Alignment>(0);
__m128 b = rhs.template packet<traits<VectorRhs>::Alignment>(0);
__m128 mul1=_mm_mul_ps(vec4f_swizzle1(a,1,2,0,3),vec4f_swizzle1(b,2,0,1,3));
__m128 mul2=_mm_mul_ps(vec4f_swizzle1(a,2,0,1,3),vec4f_swizzle1(b,1,2,0,3));
typename plain_matrix_type<VectorLhs>::type res;
pstore(&res.x(),_mm_sub_ps(mul1,mul2));
return res;
}
};
template<class Derived, class OtherDerived, int Alignment>
struct quat_product<Architecture::SSE, Derived, OtherDerived, double, Alignment>
{
static inline Quaternion<double> run(const QuaternionBase<Derived>& _a, const QuaternionBase<OtherDerived>& _b)
{
const Packet2d mask = _mm_castsi128_pd(_mm_set_epi32(0x0,0x0,0x80000000,0x0));
Quaternion<double> res;
const double* a = _a.coeffs().data();
Packet2d b_xy = _b.coeffs().template packet<Alignment>(0);
Packet2d b_zw = _b.coeffs().template packet<Alignment>(2);
Packet2d a_xx = pset1<Packet2d>(a[0]);
Packet2d a_yy = pset1<Packet2d>(a[1]);
Packet2d a_zz = pset1<Packet2d>(a[2]);
Packet2d a_ww = pset1<Packet2d>(a[3]);
// two temporaries:
Packet2d t1, t2;
/*
* t1 = ww*xy + yy*zw
* t2 = zz*xy - xx*zw
* res.xy = t1 +/- swap(t2)
*/
t1 = padd(pmul(a_ww, b_xy), pmul(a_yy, b_zw));
t2 = psub(pmul(a_zz, b_xy), pmul(a_xx, b_zw));
#ifdef EIGEN_VECTORIZE_SSE3
EIGEN_UNUSED_VARIABLE(mask)
pstore(&res.x(), _mm_addsub_pd(t1, preverse(t2)));
#else
pstore(&res.x(), padd(t1, pxor(mask,preverse(t2))));
#endif
/*
* t1 = ww*zw - yy*xy
* t2 = zz*zw + xx*xy
* res.zw = t1 -/+ swap(t2) = swap( swap(t1) +/- t2)
*/
t1 = psub(pmul(a_ww, b_zw), pmul(a_yy, b_xy));
t2 = padd(pmul(a_zz, b_zw), pmul(a_xx, b_xy));
#ifdef EIGEN_VECTORIZE_SSE3
EIGEN_UNUSED_VARIABLE(mask)
pstore(&res.z(), preverse(_mm_addsub_pd(preverse(t1), t2)));
#else
pstore(&res.z(), psub(t1, pxor(mask,preverse(t2))));
#endif
return res;
}
};
template<class Derived, int Alignment>
struct quat_conj<Architecture::SSE, Derived, double, Alignment>
{
static inline Quaternion<double> run(const QuaternionBase<Derived>& q)
{
Quaternion<double> res;
const __m128d mask0 = _mm_setr_pd(-0.,-0.);
const __m128d mask2 = _mm_setr_pd(-0.,0.);
pstore(&res.x(), _mm_xor_pd(mask0, q.coeffs().template packet<Alignment>(0)));
pstore(&res.z(), _mm_xor_pd(mask2, q.coeffs().template packet<Alignment>(2)));
return res;
}
};
} // end namespace internal
} // end namespace Eigen
#endif // EIGEN_GEOMETRY_SSE_H
``` |
```xml
/**
*/
import axios from '@nextcloud/axios'
import { getCurrentUser } from '@nextcloud/auth'
import { loadState } from '@nextcloud/initial-state'
import { generateOcsUrl } from '@nextcloud/router'
import { defineComponent } from 'vue'
export default defineComponent({
props: {
resourceId: {
type: Number,
required: true,
},
resourceType: {
type: String,
default: 'files',
},
},
data() {
return {
editorData: {
actorDisplayName: getCurrentUser()!.displayName as string,
actorId: getCurrentUser()!.uid as string,
key: 'editor',
},
userData: {},
}
},
methods: {
/**
* Autocomplete @mentions
*
* @param {string} search the query
* @param {Function} callback the callback to process the results with
*/
async autoComplete(search, callback) {
const { data } = await axios.get(generateOcsUrl('core/autocomplete/get'), {
params: {
search,
itemType: 'files',
itemId: this.resourceId,
sorter: 'commenters|share-recipients',
limit: loadState('comments', 'maxAutoCompleteResults'),
},
})
// Save user data so it can be used by the editor to replace mentions
data.ocs.data.forEach(user => { this.userData[user.id] = user })
return callback(Object.values(this.userData))
},
/**
* Make sure we have all mentions as Array of objects
*
* @param mentions the mentions list
*/
// eslint-disable-next-line @typescript-eslint/no-explicit-any
genMentionsData(mentions: any[]): Record<string, object> {
Object.values(mentions)
.flat()
.forEach(mention => {
this.userData[mention.mentionId] = {
// TODO: support groups
icon: 'icon-user',
id: mention.mentionId,
label: mention.mentionDisplayName,
source: 'users',
primary: getCurrentUser()?.uid === mention.mentionId,
}
})
return this.userData
},
},
})
``` |
Agnesta Lambart Kaiza (born November 17, 1977) is a Tanzanian politician and a member of the CHADEMA political party. She was elected as a member of the Special Seats as women representative and serves as member of parliament since 2020.
References
Living people
1977 births
Chadema MPs
Tanzanian MPs 2020–2025
21st-century Tanzanian women politicians |
Russell Albion Meyer (March 21, 1922 – September 18, 2004) was an American film director, producer, screenwriter, cinematographer, and editor. He is known primarily for writing and directing a series of successful sexploitation films that featured campy humor, sly satire and large-breasted women, such as Faster, Pussycat! Kill! Kill!. Meyer often named Beyond the Valley of the Dolls (1970) as his definitive work.
Early years
Russ Meyer was born in San Leandro, California, the son of Lydia Lucinda (Hauck) and William Arthur Meyer, an Oakland police officer. His parents were both of German descent. Meyer's parents divorced soon after he was born, and Meyer was to have virtually no contact with his father during his life. When he was 14 years old, his mother pawned her wedding ring in order to buy him an 8 mm film camera. He made a number of amateur films at the age of 15, and served during World War II as a U.S. Army combat cameraman for the 166th Signal Photo Company, ultimately attaining the rank of staff sergeant.
In the Army, Meyer forged his strongest friendships, and he would later ask many of his fellow combat cameramen to work on his films. Much of Meyer's work during World War II can be seen in newsreels and in the film Patton (1970).
On his return to civilian life, he was unable to secure cinematography work in Hollywood due to a lack of industry connections. He made industrial films, freelanced as a still photographer for mainstream films (including Giant), and became a well known glamour photographer whose work included some of the initial shoots for Hugh Hefner's Playboy magazine. Meyer would go on to shoot three Playboy centerfolds during the magazine's early years, including one of his then-wife Eve Meyer in 1955. He also shot a pictorial of then-wife Edy Williams in March 1973.
Film career
Early films
Meyer was the cinematographer for the 1950 Pete DeCenzie film French Peep Show, and the 1954 Samuel Newman production, The Desperate Women, among the few Hollywood films to depict a woman dying from an illegal abortion in pre–Roe v. Wade America, the original version of which is believed lost.
The Immoral Mr. Teas and "nudie cuties"
His first feature, the naughty comedy The Immoral Mr. Teas (1959), cost $24,000 to produce and eventually grossed more than $1 million on the independent/exploitation circuit, enthroning Meyer as "King of the Nudies." It is considered one of the first nudie cuties.
Russ Meyer was an auteur who wrote, directed, edited, photographed and distributed all his own films. He was able to finance each new film from the proceeds of the earlier ones, and became very wealthy in the process.
Meyer followed Teas with some shorts, This Is My Body (1960) and The Naked Camera, then made a second nudie cutie, Eve and the Handyman (1960). This starred Meyer's wife Eve and Anthony-James Ryan, both of whom would be crucial to the production of Meyer's films.
His next features were Erotica (1961) and Wild Gals of the Naked West (1962). Audience reception of "Wild Gals" was lukewarm, and Meyer decided to change genres.
He did a documentary, Europe in the Raw (1963), and tried a comedy, Heavenly Bodies! (1963).
He then directed a version of Fanny Hill (1964) in Europe.
Lorna and the "Gothic" period
Lorna (1964) marked the end of Meyer's "nudies" and his first foray into serious film making.
He followed this with three other similar films, and would call this his "Gothic" period: Mudhoney (1965), Motorpsycho (1965) and Faster, Pussycat! Kill! Kill! (1965).
Lorna was very successful commercially, making almost a million dollars. Mudhoney was more ambitious, based on a novel, and did not perform as well. Motorpsycho, about three men terrorising the countryside, was a big hit—so much so Meyer decided to make a film about three bad girls, Faster Pussycat. Faster, Pussycat! Kill! Kill! was commercially underwhelming but would eventually be acclaimed as a cult classic. It has a following all over the world and has inspired countless imitations, music videos and tributes.
Color melodramas – including Vixen
Meyer made the popular mockumentary Mondo Topless (1966) with the remnants of his production company's assets and made two mildly successful color melodramas: Common Law Cabin (1967) and Good Morning... and Goodbye! (1967).
Meyer made headlines once again in 1968 with the controversial Vixen!. Although its lesbian overtones are tame by today's standards, the film—envisaged by Meyer and longtime producer Jim Ryan as a reaction to provocative European art films—grossed millions on a five-figure budget and captured the zeitgeist just as The Immoral Mr. Teas had a decade earlier.
He followed it with Finders Keepers, Lovers Weepers! (1969), and Cherry, Harry & Raquel! (1970), which utilized long montages of the California landscape (replete with anti-marijuana voiceovers) and Uschi Digard dancing in the desert as the film's "lost soul." These plot devices were necessitated after lead actress Linda Ashton left the shoot early, forcing Meyer to compensate for 20 minutes of unshot footage.
20th Century Fox: Beyond the Valley of the Dolls and The Seven Minutes
After the unexpected success of Columbia Pictures' low-budget Easy Rider, and impressed by Meyer's frugality and profitability, Richard D. Zanuck and David Brown of 20th Century Fox signed Meyer to produce and direct a proposed sequel to Valley of the Dolls in 1969, fulfilling Meyers's longstanding ambition to direct for a major Hollywood studio. What eventually appeared was Beyond the Valley of the Dolls (1970), scripted by Chicago Sun-Times film critic and longtime Meyer devotee Roger Ebert. Ebert, who became the first film critic to receive the Pulitzer Prize for Criticism in 1975, would remain a close friend and key artistic collaborator for the remainder of Meyer's life.
The film bears no relation to the novel or film adaptation's continuity, a development necessitated when Jacqueline Susann sued the studio after several drafts of her script were rejected. Many critics perceive the film as perhaps the greatest expression of his intentionally vapid surrealism, with Meyer going so far as to refer to it as his definitive work in several interviews. Others, such as Variety, saw it "as funny as a burning orphanage and a treat for the emotionally retarded." Contractually stipulated to produce an R-rated film, the brutally violent climax (depicting a decapitation) ensured an X rating (eventually reclassified to NC-17 in 1990). Despite gripes from the director after he attempted to recut the film to include more titillating scenes after the ratings debacle, it still earned $9 million domestically in the United States on a budget of $2.09 million.
The executives at Fox were delighted with the box office success of Dolls and signed a contract with Meyer to make three more films: The Seven Minutes, from a potboiler by Irving Wallace; Everything in the Garden, from a play by Edward Albee; and The Final Steal, from a 1966 novel by Peter George. "We've discovered that he's very talented and cost conscious", said Zanuck. "He can put his finger on the commercial ingredients of a film and do it exceedingly well. We feel he can do more than undress people."
Per his new contract, Meyer then made a faithful adaptation of The Seven Minutes (1971). Featuring loquacious courtroom scenes alongside little nudity, the comparatively subdued film was commercially unsuccessful, and his oeuvre would be disowned by the studio for decades after Zanuck and Brown departed to form an independent production company in 1972.
Return to independent film making
Richard Zanuck, who brought Meyer to Fox, had moved to Warner Bros and there was some talk Meyer would make a film at that studio. However, Meyer would never make a studio film again. He returned to grindhouse-style independent cinema in 1973 with the blaxploitation period piece Black Snake, which was dismissed by critics and audiences as incoherent.
Foxy, a proposed vehicle for Edy Williams, was cancelled in the wake of the United States Supreme Court's Miller v. California decision in June 1973, which modified its definition of obscenity from that of "utterly without socially redeeming value" to that which lacks "serious literary, artistic, political, or scientific value". His marriage to Williams subsequently disintegrated.
"Those years were very confusing to me", said Meyer. "But instead of rushing off and throwing myself out the window, I was able to psychoanalyze myself and discern what was best for me. I looked myself square in the face and realized I couldn't do everything."
In 1975, he released Supervixens, a return to the world of big bosoms, square jaws, and the Sonoran Desert that earned $17 million in the United States on a shoestring budget.
Meyer's theatrical career ended with the release of the surreal Up! (1976) and 1979's Beneath the Valley of the Ultra-Vixens, his most sexually graphic films. Film historians and fans have called these last three films "Bustoons" because his use of color and mise en scène recalled larger-than-life pop art settings and cartoonish characters.
In 1977, Malcolm McLaren hired Meyer to direct a film starring The Sex Pistols. Meyer handed the scriptwriting duties over to Ebert, who, in collaboration with McLaren, produced a screenplay entitled Who Killed Bambi? According to Ebert, filming ended after a day and a half when the electricians walked off the set after McLaren was unable to pay them. (McLaren has claimed that the project was scrapped at the behest of the main financier and Meyer's erstwhile employer, 20th Century Fox, whose board of directors considered the prospect of a Meyer production to be untenable and incompatible with the insurgent family values ethos in popular culture.) The project ultimately evolved into The Great Rock 'n' Roll Swindle.
Later years
Despite hardcore pornographic films overtaking Meyer's softcore market share, he retired from filmmaking in the late 1970s a very wealthy man. He made a one-off return to filmmaking in 2001 to direct Russ Meyer's Pandora Peaks, featuring the nude glamour model of the same name. Around the same time, he also participated in Voluptuous Vixens II, a made-for-video softcore production by Playboy.
Use of satire
Russ Meyer was also adept at mocking moral stereotypes and flagrantly lampooning conservative American values. Many of his films feature a narrator who attempts to give the audience a "moral roadmap" of what they are watching. Like his contemporary Terry Southern, Meyer realized that sex—as one of the few common interests among most humans—was a natural vehicle for satirizing values and conventions held by the Greatest Generation. According to Roger Ebert in a commentary recorded in 2003 for the DVD release of Beyond the Valley of the Dolls, Meyer continually reiterated that this irreverence was the true secret to his artistic success.
Meyer was also known for his quick wit. While participating with Ebert in a panel discussion at Yale University, he was confronted by an angry woman who accused him of being "nothing but a breast man." His immediate reply: "That's only the half of it."
The Meyer physical archetype
Russ Meyer's lifelong unabashed fixation on large breasts featured prominently in all his films and is his best-known character trait both as an artist and as a person. His discoveries include Kitten Natividad, Erica Gavin, Lorna Maitland, Tura Satana, and Uschi Digard among many others. The majority of them were naturally large-breasted and he occasionally cast women in their first trimesters of pregnancy as it enhanced their breast size even further.
Rarely were there cosmetically enhanced breasts in any of his films until Up! (1976) and Beneath the Valley of the Ultra-Vixens (1979). However, by the early 1980s, when surgical advancements had made the gargantuan breasts of Meyer's fantasies a reality, many felt he had started viewing the female body as simply a "tit transportation device" and that his aesthetic vision was no longer attractive or vibrant. Darlene Gray, a natural 36H-22-33 from Great Britain who appeared in Mondo Topless (1966), is said to be Russ Meyer's most busty discovery.
The Russ Meyer female physical archetype is fairly complex to decipher. Firstly, it's not to be confused with today's surgically enhanced Hollywood porn starlets or even slim, naturally endowed actresses. Russ Meyer was almost as much about a shapely 1950s hip-to-waist ratio or "wasp waist" as he was about very large breasts. The six-pack abdominal muscles and built-up squarish appearance of modern Hollywood figures do not mesh with his pin-up aesthetic. Secondly, he required that even his most busty actresses looked good braless; "gravity-defying" and "cantilevered" became two of his favorite expressions.
In his films such as Vixen! and Cherry, Harry & Raquel!, some of the actresses do not have large (by Russ Meyer standards) breasts yet their chests are always accentuated by use of camera angles and well-constructed bras. Reportedly, Erica Gavin was cast as the lead in Vixen! because her "smaller" bust would make the character "more relatable to women."
He went on record numerous times to say that Anita Ekberg was the most beautiful woman he ever photographed and that her 39DD breasts were the biggest in A-list Hollywood history, dwarfing both Jayne Mansfield and Sabrina.Dolly Parton was the only modern Hollywood actress Meyer ever expressed interest in working with.
While he often referred to his actresses as "Junoesque" and "Amazonian", this was probably more in their spirit than their actual physiques" as Meyer rarely cast very tall or symmetrically built actresses with strong legs and large posteriors.
So while the general public could easily perceive Jane Russell or Sophia Loren as "Russ Meyer material", their balanced bodies did not mesh with Meyer's precise aesthetic preferences." And indeed, Meyer said many times that it was Gina Lollobrigida's smaller-breasted figure that he preferred visually over her larger-breasted, taller and bigger-hipped rival, Sophia Loren. Thus, Meyer's oeuvre shows the viewer that while his actresses could easily be described as voluptuous, buxom and curvaceous, it's debatable to some if they were strapping, stately or even statuesque as Meyer readily proclaimed.
The tallest actress Meyer ever cast in a lead was the , slim-hipped, huge-breasted Lorna Maitland (working with whom he admitted he found intimidating). Nearly all the other women he featured were no taller than . Tura Satana's performance as Varla in Faster, Pussycat! Kill! Kill! was Meyer's only true portrayal of the large, strong and aggressive Amazonian archetype in the classic visual sense.
Female empowerment
Film historian and Meyer biographer Jimmy McDonough posits that Russ Meyer's usage of physically and sexually overwhelming female characters places him in his own separate genre. He argues that despite portraying women as sex objects, Meyer nonetheless depicts them as more powerful than men and is therefore an inadvertent feminist filmmaker.
In many of Meyer's films, women eventually defeat men, winning sexual fulfillment as their reward, e.g., Super Vixen (Supervixens), Margo Winchester (Up!) and Lavonia Shedd (Beneath the Valley of the Ultra-Vixens). Even in the 1950s and 1960s, his films were sometimes centered on a woman's need and struggle for sexual satisfaction (Lorna, Good Morning and... Goodbye! and Beneath the Valley of the Ultra-Vixens). Additionally, Russ Meyer's female characters were often allowed to express anger and violence towards men (Faster, Pussycat! Kill! Kill! and Supervixens).
Yet in his research, McDonough also notes that Meyer's female characters were limited in how powerful they could appear; often the female lead is raped (Up! and Lorna) or brutally murdered (Beyond the Valley of the Dolls, Supervixens, Lorna and Blacksnake). While Russ Meyer may have championed powerful woman characters, he also forced them into violent and terrifying situations, making them prove their physical and mental strength against tremendous odds. He also ensured that women's breasts were at least semi-exposed during these ordeals for comic or erotic effect. Furthermore, according to frequent collaborator and longtime lover Kitten Natividad, Meyer's love of dominant women extended to his personal life, and he was almost always in a tumultuous relationship.
Personal and family life
During World War II, according to Meyer, he was in a French brothel with Ernest Hemingway who, upon finding out that Meyer was a virgin, offered him the prostitute of his choice. Meyer picked the one with the largest breasts.
Despite his reputation, Meyer never employed the casting couch during his career's peak years, though that shifted during his post-1980 unfinished projects, and rarely had sex with any of his actresses. He had no children, though there were rumored unsuccessful pregnancies with his second wife Edy Williams and last serious girlfriend, Melissa Mounds, who was also found guilty of assaulting him in 1999. There is a long-standing rumor among his closest friends and at least one biographer that he had a son in 1964 with a secret lover who he would refer to only as "Miss Mattress" or "Janet Buxton."
Meyer was very upfront throughout his life about being too selfish to be a father or even a caring partner or husband. Yet he is also said to have been very generous with all his friends and acquaintances, and never isolated friends from one another. Biographers have attributed most of his brutish and eccentric nature to the fact that he was abandoned by his father, an Oakland police officer, and coddled by his mother, Lydia, who was married six times. Meyer had a half-sister, Lucinda, who was diagnosed in her 20s with paranoid schizophrenia and was committed to California State mental institutions until her death in 1999. Mental illness ran in his family and was something he secretly feared. During his entire life, Russ Meyer always spoke of his mother and sister with the highest reverence.
Meyer was married to:
Betty Valdovinos (born 1922, divorced)
Eve Meyer (December 13, 1928 – March 27, 1977, died in the Tenerife airport disaster)
Edy Williams (born July 9, 1942, divorced)
Contrary to some accounts, Meyer was never married to Kitten Natividad, his longtime companion and the star of his final two films.
Final years
Meyer owned the rights to nearly all of his films and spent the majority of the 1980s and 1990s making millions reselling his films on the home video and DVD market. He worked out of his Los Angeles home and usually took telephone orders in person. A major retrospective of his work was given at the British Film Institute which Meyer attended in 1982. The Chicago Film Festival honored his work in 1985, for which he also made a personal appearance, and many revival movie houses booked his films for midnight movie marathons.
He also worked obsessively for over a decade on a massive three-volume autobiography, titled A Clean Breast. Finally printed in 2000, it features numerous excerpts of reviews, clever details of each of his films and countless photos and erotic musings.
Starting in the mid-1990s, Meyer had frequent fits and bouts of memory loss. By 2000, he was diagnosed with Alzheimer's disease, and his health and well-being were thereafter looked after by Janice Cowart, his secretary and estate executor. That same year, with no wife or children to claim his wealth, Meyer willed that the majority of his money and estate would be sent to the Memorial Sloan Kettering Cancer Center in honor of his late mother.
Russ Meyer died at his home in the Hollywood Hills (from complications of pneumonia), on September 18, 2004, at the age of 82. Meyer's grave is located at Stockton Rural Cemetery in San Joaquin County, California.
Filmography
The French Peep Show (1950, short)
The Desperate Women (1954)
The Immoral Mr. Teas (1959)
The Naked Camera (1961, short)
Erotica (1961, short)
Eve and the Handyman (1961)
Wild Gals of the Naked West (1962)
Europe in the Raw (1963)
Heavenly Bodies! (1963, short)
Skyscrapers & Brassieres (1963, short)
Fanny Hill (1964)
Lorna (1964)
Mudhoney (1965)
Motorpsycho (1965)
Faster, Pussycat! Kill! Kill! (1965)
Mondo Topless (1966, mockumentary)
Common Law Cabin (1967)
Good Morning and... Goodbye! (1967)
Finders Keepers, Lovers Weepers! (1968)
Vixen! (1968)
Cherry, Harry & Raquel! (1969)
Beyond the Valley of the Dolls (1970)
The Seven Minutes (1971)
Foxy/Viva Foxy" (1972/73, trailer only)
Black Snake (1973)
Supervixens (1975)
Up! (1976)
Who Killed Bambi? (1978, unfinished)
Beneath the Valley of the Ultra-Vixens (1979)
The Breast of Russ Meyer (1979-2001, mockumentary, unfinished)
All the Way In!" (1984, actor only)
Amazon Women on the Moon (1987, actor only)
Faster Pussycat: Don't Change That Song (1987, music video)
Jean Park: Soultwister (1991, music video)
Pandora Peaks (2001, mockumentary)
Notes
References
Further reading
Jack Stevenson. "Russ Meyer: The Movie Man Who Would Be King" in Jack Stevenson (ed), Fleshpot: Cinema's Sexual Myth Makers and Taboo Breakers. Manchester: Critical Vision/Headpress, 2002, pp; 163-175
External links
Nathaniel Rich on Russ Meyer in the San Francisco Chronicle
1922 births
2004 deaths
American cinematographers
American male film actors
American film editors
Film producers from California
United States Army personnel of World War II
American people of German descent
American male screenwriters
Deaths from pneumonia in California
Writers from Oakland, California
People from San Leandro, California
United States Army non-commissioned officers
Film directors from California
Screenwriters from California
20th-century American male actors
20th-century American male writers
20th-century American screenwriters |
```java
/*
This file is part of the iText (R) project.
Authors: Apryse Software.
This program is offered under a commercial and under the AGPL license.
For commercial licensing, contact us at path_to_url For AGPL licensing, see below.
AGPL licensing:
This program is free software: you can redistribute it and/or modify
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
along with this program. If not, see <path_to_url
*/
package com.itextpdf.layout.renderer;
import com.itextpdf.io.font.otf.Glyph;
import com.itextpdf.io.font.otf.GlyphLine;
import com.itextpdf.io.util.TextUtil;
import com.itextpdf.kernel.font.PdfFont;
import com.itextpdf.kernel.font.PdfFontFactory;
import com.itextpdf.test.ExtendedITextTest;
import java.io.IOException;
import org.junit.jupiter.api.Assertions;
import org.junit.jupiter.api.BeforeAll;
import org.junit.jupiter.api.Test;
import org.junit.jupiter.api.Tag;
@Tag("UnitTest")
public class TextPreprocessingUtilTest extends ExtendedITextTest {
private static PdfFont pdfFont;
@BeforeAll
public static void initializeFont() throws IOException {
pdfFont = PdfFontFactory.createFont();
}
@Test
public void enSpaceTest() {
specialWhitespaceGlyphTest('\u2002');
}
@Test
public void emSpaceTest() {
specialWhitespaceGlyphTest('\u2003');
}
@Test
public void thinSpaceTest() {
specialWhitespaceGlyphTest('\u2009');
}
@Test
public void horizontalTabulationTest() {
specialWhitespaceGlyphTest('\t');
}
@Test
public void regularSymbolTest() {
GlyphLine glyphLine = new GlyphLine();
Glyph regularGlyph = pdfFont.getGlyph('a');
glyphLine.add(0, regularGlyph);
TextPreprocessingUtil.replaceSpecialWhitespaceGlyphs(glyphLine, pdfFont);
Glyph glyph = glyphLine.get(0);
Assertions.assertEquals(regularGlyph, glyph);
}
private void specialWhitespaceGlyphTest(int unicode) {
GlyphLine glyphLine = new GlyphLine();
// Create a new glyph, because it is a special glyph, and it is not contained in the regular font
glyphLine.add(0, new Glyph(0, unicode));
TextPreprocessingUtil.replaceSpecialWhitespaceGlyphs(glyphLine, pdfFont);
Glyph glyph = glyphLine.get(0);
Glyph space = pdfFont.getGlyph('\u0020');
Assertions.assertEquals(space.getCode(), glyph.getCode());
Assertions.assertEquals(space.getWidth(), glyph.getWidth());
Assertions.assertEquals(space.getUnicode(), glyph.getUnicode());
Assertions.assertArrayEquals(TextUtil.convertFromUtf32(unicode), glyph.getChars());
}
}
``` |
Ornithinicoccus hortensis is a Gram-positive bacterium species from the genus Ornithinicoccus which has been isolated from garden soil from Gießen in Germany.
References
Intrasporangiaceae
Bacteria described in 1999 |
The Comley Limestone is an Early Cambrian Lagerstätte exposed in Comley, Shropshire, England. It is known for its phosphatic microfossils, which can be extracted by acid maceration and are preserved in three dimensions in a similar fashion to the Orsten fossils. It represents around 10 million years of deposition, and was deposited from 519 to 501 million years ago. Fossils from the formation include the phosphatocopine arthropod Klausmuelleria.
See also
Geology of Shropshire
References
Lagerstätten
Geology of Shropshire
Ordovician south paleopolar deposits |
Bastrop is a city in Morehouse Parish, Louisiana, United States. It is the parish seat of Morehouse Parish. The population was 9,691 at the 2020 census, down from 11,365 in 2010. The population of Bastrop is 76 percent African American. It is included in the Monroe Metropolitan Statistical Area and is part of the Monroe–Ruston Combined Statistical Area.
History
Bastrop was founded by Felipe Enrique Neri, Baron de Bastrop, a Dutch businessman accused as an embezzler. He had fled to the then Spanish colony of Louisiana to escape prosecution and became involved in various land deals. In New Spain, he falsely claimed to be a nobleman. He received a large grant of land, provided that he could settle 450 families on it over the next several years. However, he was unable to do this, and so lost the grant. Afterwards, he moved to Texas, where he claimed to oppose the sale of Louisiana to the United States and became a minor government official. He proved instrumental in Moses Austin's plan (and later, that of his son, Stephen F. Austin) to bring American colonists to what was then northern Mexico.
Bastrop formally incorporated in 1857, and is the commercial and industrial center of Morehouse Parish. In the 19th century, it was notable as the western edge of the great North Louisiana swamp, but more favorable terrain resulted in the antebellum rail line connecting to Monroe, further to the south.
Bastrop was a Confederate stronghold during the American Civil War until January 1865, when 3,000 cavalrymen led by Colonel Embury D. Osband of the 3rd United States Colored Cavalry Regiment, embarked from Memphis, Tennessee, for northeastern Louisiana.
During the Great Mississippi Flood of 1927, Bastrop was the site of a relief camp for refugees. During World War II, it was the site of a German prisoner-of-war camp.
Bastrop is the parish seat of Morehouse Parish and is within an area marketed to tourists as the Sportsman's Paradise Region of Louisiana. It is a Main Street Community and has received Transportation Enhancement funding for improvements in its historic district.
Celebrations and concerts are held in the historic downtown at the restored 1914 Morehouse Parish Courthouse and Rose Theater. Bastrop is home to the Snyder Museum and Creative Arts Center, housed in the circa 1929 home of a local family. Volunteers lead heritage appreciation tours for children and interpret the history of the parish using local artifacts.
Geography
Bastrop is located in western Morehouse Parish at (32.777855, −91.914944). It is situated at the crossroads of U.S. Highway 425 and U.S. Highway 165. US 165 passes through the city as Madison Avenue, leading east to Mer Rouge and southwest to Monroe. US 425 leaves Bastrop to the east with US 165 but leaves the city to the north on Washington Street, where the next town to the north is Hamburg, Arkansas, away. Louisian Highways 2 and 139 also run through the town.
According to the United States Census Bureau, Bastrop has a total area of , all of it recorded as land. Bayou Bartholomew passes just west of the city limits, flowing southwest to the Ouachita River near Sterlington.
Climate
Neighborhoods
Park Place
White Star
Gladney Park Estates
Morehouse Country Club Estates
Morehouse Country Club Extension Estates
Ralph George Park Estates
Downtown
Austin Village
Naff Estates
South Point
Hill View
Twin Peaks
Emily Clark Park Estates
Briarwood Estates
Everglade Estates
Arrowhead Estates
Arlington Estates
Airport Estates
Cleveland Estates
Space Estates
Cooperlake Estates
Marlett Estates
Uptown Estates
United Estates
Rusty Acres Estates
Madison Place
E-Lane
Cherry Ridge
Suburbs
Wardville
Uscarco
Shelton
Rogers
Point Pleasant
Perryville
Newhlock
Log Cabin
Collinston
Gum Ridge
Marcarco
Spyker
Upland
Windsor
Oak Ridge
Bordenax
Mer Rouge
Galion
Stampley
Bonita
Haynes Landing
Jones
Laark
McGinty
New Land Grove Landing
Oak Landing
Beekman
Vaughn
Stevenson
Robinson
Naff
Humphreys
Geddie
Couters Neck
Demographics
As of the 2020 United States Census, there were 9,691 people, 3,834 households, and 2,273 families residing in the city.
Economy
The Bastrop area economy is largely based on forestry, cotton and rice farming, and potato shipping. Hunting, camping, and fishing are pastimes in the many bayous and rivers. Shopping is also a popular tourist attraction in the area. The Snyder Museum keeps information relating to local history and displays furniture typical of fine homes from the Civil War and early 20th century periods.
Barham's Drugs on the courthouse square in Bastrop was formerly owned and operated by Henry Alfred Barham, Jr. (1919-1993), and his wife, the former Ann Jocelyn Heres (1929-2015). Mrs. Barham, originally educated in home economics at Louisiana State University in Baton Rouge, was the first woman pharmacist in Morehouse Parish and a graduate of the pharmacy school at the University of Louisiana at Monroe. She was a two-term member of the Morehouse Parish School Board. Alfred Barham was an older brother of Mack Barham, a justice of the Louisiana Supreme Court, and a distant cousin of State Senators Robert J. Barham and Edwards Barham.
IPC mill closing
On November 21, 2008, International Paper Company, the largest area employer, announced the cessation of operations of its Bastrop mill. The company first said that the closure is "indefinite" and subsequently confirmed that the exodus is "permanent".
Poultry plant shutdowns affect Bastrop
In 2009, poultry processor Pilgrim's Pride announced that it was closing multiple facilities in Arcadia, Athens, Choudrant and Farmerville, a decision that impacted the economy of Bastrop. In response, Governor Bobby Jindal and the state legislature, moved to subsidize with $50 million from the state's megafund to a new poultry plant owner, Foster Farms of California. Subsequently, DG Foods based in Hazlehurst, Mississippi, opened a poultry processing plant at Bastrop to serve the poultry industry in June 2011. The company currently employs around 380 workers and serve customers with custom processing of products and sized portions for retail sales and restaurants. The poultry industry continues to be an important employer for low to medium skilled workers.
Drax Biomass
On December 17, 2012, Governor Jindal and Drax Biomass International Inc. CEO Chuck Davis traveled to Morehouse Parish, Louisiana to announce plans to build a wood pellet facility in Bastrop and a storage-and-shipping facility at the Port of Greater Baton Rouge. The project was completed and the plant was commissioned in 2015 adding 79 new direct jobs, with 64 of the jobs located at the Bastrop wood pellet facility. LED estimates the project generated an additional 150 indirect jobs in the state. Drax' budget for the Morehouse mill was about $120 million. Drax says the average pay plus benefits averages more than $35,000 annually at the pellet mill. Drax is shipping wood pellets formed in Morehouse Parish to its U.K. Energy facilities for use in generating renewable power. July, 2013, Drax Biomass started work on clearing the area for the new wood-based pellet facility in Bastrop.
Military
The 1023rd Engineer Company (Vertical) of the 528th Engineer Battalion of the 225th Engineer Brigade is located in Bastrop.
Government
Bastrop is governed by a mayor and board of aldermen.
In 2013, Arthur Jones, the former long-term Bastrop municipal recreation director, narrowly unseated Alford-Olive. In his first days on the job in July, he spent much of his time reopening the large East Madison swimming pool. The facility has a capacity of 450,000 gallons of water and can accommodate three hundred persons. Jones said that his interest in the pool is a reflection of his concern about idle youth. Jones will seek to attract new smaller industries to Bastrop to fill part of the void left by the closing in 2008 of the International Paper mill.
On April 29, 2017, Henry Cotton defeated former Mayor Betty Alford-Olive in a runoff election to become Mayor-elect. Cotton received 1,758 votes (58%) while Alford-Olive only obtained 741 votes (42%). On June 17, 2021, Betty Alford-Olive was inaugurated as mayor of Bastrop, Louisiana.
The Bastrop City Hall and Police Station were designed by native son Hugh G. Parker (1934–2007), who overcame childhood polio to become a significant architect in Louisiana. The original City Hall dates to 1927 under the Mayor A. G. Bride.
Education
School district
The Morehouse Parish School Board operates all public schools within the City of Bastrop and Morehouse Parish.
Elementary schools
Beekman Charter School
Delta Elementary School
Morehouse Magnet School
Morehouse Elementary School
Middle schools
Beekman Charter School
Delta Elementary School (6th)
Morehouse Magnet School
Bastrop High School (7th/8th)
High schools
Bastrop High School
Beekman Charter School
Morehouse Magnet School
Alternative schools
Bastrop Learning Academy - an Alternative School for students that prepares them for Career and Workforce Training
Private schools
Prairie View Academy - the only Private School in Bastrop and Morehouse Parish serving grades PreK 3 through 12th
Public libraries
The City of Bastrop is home to two public libraries.
The Main Branch which is Morehouse Parish Library and Dunbar Library. Morehouse Parish Public Library System
Postsecondary schools
Louisiana Delta Community College (Bastrop Campus & Bastrop Airport Campus)
The City of Bastrop offers its citizens and parish with two campuses of its Region Community and Technical College System. The Main Branch is on Kammell St.(CLOSED)and the other branch is on Airport Rd. adjacent to the City's and Parish Main Airport which is the Morehouse Memorial Airport.
Bastrop High School prayer controversy
In 2011, graduating senior Damon Fowler objected to prayer at the Bastrop High School graduation exercises, claiming a looming violation of the First Amendment to the Constitution of the United States. The American Civil Liberties Union of Louisiana asked the school not to include a prayer in the May 20 graduation. At the Thursday night rehearsal for the graduation, senior Sarah Barlow included a prayer that explicitly mentioned Jesus Christ, and during the graduation, student Laci Mattice led people in the Lord's Prayer before a moment of silence. The school says that Mattice was told not to include a prayer. Fowler stated that after his objections became public he was ostracized by other students.
Media
Bastrop and Morehouse Parish are served by a daily newspaper, the Bastrop Daily Enterprise.
Gallery
Notable people
Ronnie Coleman, professional bodybuilder
Bill Dickey, Major League Baseball Hall of Fame catcher for the New York Yankees
Denzel Devall, college football player
Michael Echols, member of the Louisiana House of Representatives
Stump Edington, Major League Baseball player who died in Bastrop
David 'Bo' Ginn, state senator from Morehouse Parish from 1980 to 1988
Luther E. Hall, governor of Louisiana
Stacey Hawkins, United States Air Force major general
Ed Head, Major League Baseball player who died in Bastrop
Mable John, Motown Records singer born in Bastrop
Jim Looney, NFL player
Bob Love, NBA basketball player
Calvin Natt, National Basketball Association player who was born in Monroe, but attended Bastrop High School, later NLU and was an NBA All-Star with the Denver Nuggets
Kenny Natt, National Basketball Association younger brother of Kenny Natt, drafted by Indiana Pacers in 1980
Willie Parker, NFL and WFL player
Rueben Randle, LSU Tigers football, wide receiver, led Bastrop High School to a state championship, was drafted by the New York Giants in 2012
Shane Reynolds, Major League Baseball player
John Wesley Ryles, country music singer born in Bastrop in 1950
Talance Sawyer, played for the Minnesota Vikings; born in Bastrop
Dylan Scott, country music singer-songwriter
Pat Williams, NFL player (Minnesota Vikings); born in Bastrop
Hulon B. Whittington, Medal of Honor recipient
References
External links
Morehouse Parish Schools
Cities in Louisiana
B
Cities in Morehouse Parish, Louisiana
1857 establishments in Louisiana |
Franz Rummel (January 11, 1853May 2, 1901) was a German pianist, born in England and active across continental Europe.
Rummel was born in London into a prominent German musical family, the son of pianist Joseph Rummel and grandson of composer and conductor Christian Rummel. He studied under Louis Brassin at the Brussels Conservatory, winning the first prize in 1872. He gave his first concert in Brussels, on November 24, 1872. In 1877–78 he toured through the Netherlands with Ole Bull and Minnie Hauk, and embarked on American tours in 1878, 1886, and 1898. He taught 1884–85 at Julius Stern's Conservatory, and then at Theodor Kullak's, both in Berlin. In 1897 he received the title of Professor from Eduard, Duke of Anhalt. By the start of his third American tour in 1898, he had played in about 700 concerts. Franz was the first pianist to play at Carnegie Hall in 1891.
He married a daughter of telegraph inventor Samuel Morse; one of their sons, Walter Morse Rummel, was also a well-known pianist.
References
1853 births
1901 deaths
German classical pianists
Male classical pianists
German music educators
Honorary Members of the Royal Philharmonic Society
19th-century classical pianists
19th-century German musicians
19th-century male musicians
Expatriates in the United Kingdom |
```php
<?php
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
*/
namespace Google\Service\Aiplatform;
class GoogleCloudAiplatformV1ListFeaturestoresResponse extends \Google\Collection
{
protected $collection_key = 'featurestores';
protected $featurestoresType = GoogleCloudAiplatformV1Featurestore::class;
protected $featurestoresDataType = 'array';
/**
* @var string
*/
public $nextPageToken;
/**
* @param GoogleCloudAiplatformV1Featurestore[]
*/
public function setFeaturestores($featurestores)
{
$this->featurestores = $featurestores;
}
/**
* @return GoogleCloudAiplatformV1Featurestore[]
*/
public function getFeaturestores()
{
return $this->featurestores;
}
/**
* @param string
*/
public function setNextPageToken($nextPageToken)
{
$this->nextPageToken = $nextPageToken;
}
/**
* @return string
*/
public function getNextPageToken()
{
return $this->nextPageToken;
}
}
// Adding a class alias for backwards compatibility with the previous class name.
class_alias(GoogleCloudAiplatformV1ListFeaturestoresResponse::class, your_sha256_hashesResponse');
``` |
```java
package com.dexvis.javafx.scene.control;
import java.util.ArrayList;
import java.util.List;
import javafx.collections.ObservableList;
import javafx.event.ActionEvent;
import javafx.scene.Scene;
import javafx.scene.control.ContextMenu;
import javafx.scene.control.Label;
import javafx.scene.control.ListCell;
import javafx.scene.control.ListView;
import javafx.scene.control.MenuItem;
import javafx.scene.control.SelectionMode;
import javafx.scene.image.ImageView;
import javafx.scene.input.ClipboardContent;
import javafx.scene.input.DragEvent;
import javafx.scene.input.Dragboard;
import javafx.scene.input.KeyCode;
import javafx.scene.input.KeyEvent;
import javafx.scene.input.MouseEvent;
import javafx.scene.input.TransferMode;
import javafx.scene.layout.HBox;
import javafx.scene.paint.Color;
import javafx.stage.Stage;
import javafx.util.Callback;
import com.dexvis.dex.DexConstants;
import com.dexvis.dex.wf.DexTask;
import com.thoughtworks.xstream.annotations.XStreamOmitField;
public class DexTaskList extends ListView<DexTaskItem> implements DexConstants
{
@XStreamOmitField
private int insertionPoint = -1;
@XStreamOmitField
private ModalText modalText;
@XStreamOmitField
private Stage stage = null;
@XStreamOmitField
private List<DexTaskItem> copyTasks = new ArrayList<DexTaskItem>();
public DexTaskList()
{
super();
setCellFactory(new Callback<ListView<DexTaskItem>, ListCell<DexTaskItem>>()
{
@Override
public ListCell<DexTaskItem> call(ListView<DexTaskItem> list)
{
return new DexTaskItemCell();
}
});
getSelectionModel().setSelectionMode(SelectionMode.MULTIPLE);
setOnKeyPressed(event -> keyPress(event));
setOnDragOver(event -> onDragOver(event));
setOnDragDropped(event -> onDragDropped(event));
ContextMenu ctxMenu = new ContextMenu();
MenuItem disableTask = new MenuItem("Disable");
MenuItem enableTask = new MenuItem("Enable");
MenuItem renameTask = new MenuItem("Rename");
MenuItem configTask = new MenuItem("Configure");
disableTask.setOnAction(action -> disableTask(action));
enableTask.setOnAction(action -> enableTask(action));
renameTask.setOnAction(action -> renameTask(action));
configTask.setOnAction(action -> configTask(action));
ctxMenu.getItems().addAll(disableTask, enableTask, renameTask, configTask);
setOnDragDetected(event -> onDragDetected(event));
setContextMenu(ctxMenu);
}
public void setStage(Stage stage)
{
this.stage = stage;
}
public class DexTaskItemCell extends ListCell<DexTaskItem>
{
private HBox hbox = new HBox();
private ImageView imageView = new ImageView();
private Label label = new Label("UNNAMED");
public DexTaskItemCell()
{
this.hbox.getChildren().addAll(imageView, label);
DexTaskItem item = getItem();
if (item != null)
{
imageView.setImage(getItem().getImage());
hbox.opacityProperty().bind(item.getOpacity());
label.textProperty().bind(item.getName());
setLabelColor(label, item);
}
setOnDragEntered(event -> onDragEntered(event));
setOnDragExited(event -> onDragExited(event));
}
private void setLabelColor(Label label, DexTaskItem item)
{
if (item != null && item.getActive() != null && item.getActive().get())
{
label.setTextFill(Color.BLACK);
}
else
{
label.setTextFill(Color.RED);
}
}
@Override
public void updateItem(DexTaskItem item, boolean empty)
{
super.updateItem(item, empty);
if (empty)
{
setText(null);
setGraphic(null);
}
else
{
if (item != null)
{
imageView.setImage(item.getImage());
label.textProperty().bind(item.getName());
setLabelColor(label, item);
hbox.opacityProperty().bind(item.getOpacity());
}
setGraphic(hbox);
}
}
public void onDragEntered(DragEvent evt)
{
System.out.println("On Cell Drag Entered");
/* the drag-and-drop gesture entered the target */
/* show to the user that it is an actual gesture target */
int index = getIndex();
insertionPoint = index;
label.setTextFill(Color.RED);
evt.consume();
}
public void onDragExited(DragEvent evt)
{
System.out.println("On Cell Drag Exited");
int index = getIndex();
insertionPoint = index;
setLabelColor(label, getItem());
evt.consume();
}
}
public void renameTask(ActionEvent evt)
{
// TODO: Replaced the actioneventhandler with an expression, weirdly, it
// worked.
// I am actually not sure why, how, or if it truly did work or introduced
// some
// subtle bug that it will take me hours to find later. Hence the TODO.
modalText = new ModalText(stage, "Change Name", "Enter New Name:",
getSelectionModel().getSelectedItem().getName().get(),
event -> changeName(event));
}
public void configTask(ActionEvent evt)
{
try
{
Stage configStage = new Stage();
DexTask task = getSelectionModel().getSelectedItem().getTask().getValue();
JsonGuiPane configGui = task.getConfigurationGui();
Scene configScene = new Scene(configGui, 800, 600);
configStage.setScene(configScene);
configStage.show();
}
catch(Exception ex)
{
ex.printStackTrace();
}
}
public void changeName(ActionEvent evt)
{
getSelectionModel().getSelectedItem().setName(modalText.getText());
}
public void enableTask(ActionEvent evt)
{
System.out.println("ENABLE EVENT: " + evt);
ObservableList<Integer> selected = getSelectionModel().getSelectedIndices();
ObservableList<DexTaskItem> items = getItems();
for (int i : selected)
{
DexTaskItem task = items.get(i);
task.setActive(true);
}
forcedRefresh();
}
public void disableTask(ActionEvent evt)
{
System.out.println("DISABLE EVENT: " + evt);
ObservableList<Integer> selected = getSelectionModel().getSelectedIndices();
ObservableList<DexTaskItem> items = getItems();
for (int i : selected)
{
DexTaskItem task = items.get(i);
task.setActive(false);
}
forcedRefresh();
}
public void enableAll()
{
for (DexTaskItem item : getItems())
{
item.setActive(true);
}
forcedRefresh();
}
public void disableAll()
{
for (DexTaskItem item : getItems())
{
item.setActive(false);
}
forcedRefresh();
}
private void forcedRefresh()
{
ObservableList<DexTaskItem> items = getItems();
setItems(null);
setItems(items);
}
public void keyPress(KeyEvent evt)
{
System.out.println("*** keypress: " + evt);
if (evt.getCode().equals(KeyCode.DELETE))
{
int delIndex = getSelectionModel().getSelectedIndex();
int size = getItems().size();
if (delIndex >= 0 && delIndex < size)
{
System.out.println("Deleting Task: " + (delIndex + 1) + " of " + size);
getItems().remove(delIndex);
}
}
else if (evt.getCode().equals(KeyCode.C) && evt.isControlDown())
{
System.out.println("Control-C");
copyTasks.clear();
ObservableList<Integer> selected = getSelectionModel()
.getSelectedIndices();
ObservableList<DexTaskItem> items = getItems();
for (int selectedIndex : selected)
{
copyTasks.add(items.get(selectedIndex).clone());
}
}
else if (evt.getCode().equals(KeyCode.V) && evt.isControlDown())
{
if (copyTasks == null)
{
return;
}
int insertionIndex = getSelectionModel().getSelectedIndex();
// Need to clone the entire list.
List<DexTaskItem> copiedTasks = new ArrayList<DexTaskItem>();
for (DexTaskItem task : copyTasks)
{
copiedTasks.add((DexTaskItem) (task.clone()));
}
getItems().addAll(insertionIndex, copiedTasks);
}
else
{
// System.out.println("Ignoring keypress");
}
}
public List<DexTaskItem> getCopyTasks()
{
return copyTasks;
}
public void setCopyTasks(List<DexTaskItem> copyTasks)
{
this.copyTasks = copyTasks;
}
public void clearCopyTasks()
{
this.copyTasks.clear();
}
public void onDragOver(DragEvent evt)
{
evt.acceptTransferModes(TransferMode.ANY);
evt.consume();
}
public void onDragDropped(DragEvent evt)
{
// System.out.println("On Drag Dropped");
Dragboard db = evt.getDragboard();
boolean success = false;
try
{
if (db.hasContent(DEX_TASK_CREATE))
{
System.out.println("DND-RECEIVING: '" + db.getContent(DEX_TASK_CREATE) + "'");
Class clazz = (Class) db.getContent(DEX_TASK_CREATE);
DexTask task = (DexTask) clazz.newInstance();
DexTaskItem item = new DexTaskItem(task);
int insertionPoint = getInsertionPoint();
System.out.println("Inserting at: " + insertionPoint + ", list size: "
+ getItems().size());
if (insertionPoint >= 0 && insertionPoint <= getItems().size())
{
getItems().add(insertionPoint - 1, item);
}
else
{
getItems().add(item);
}
success = true;
}
else if (db.hasContent(DEX_TASK_LIST_MOVE))
{
int movingTo = getInsertionPoint();
if (movingTo < 0)
{
movingTo = 0;
}
int movingFrom = (int) db.getContent(DEX_TASK_LIST_MOVE);
if (movingFrom < movingTo)
{
DexTaskItem movingItem = getItems().remove(movingFrom);
getItems().add(movingTo - 1, movingItem);
}
else if (movingFrom > movingTo)
{
DexTaskItem movingItem = getItems().remove(movingFrom);
getItems().add(movingTo, movingItem);
}
System.out.println("MOVING: " + movingFrom + "->" + movingTo);
}
// Kludgey, but resets all items to active/inactive default opacity.
List<DexTaskItem> items = getItems();
for (DexTaskItem item : items)
{
System.out.println("Setting item: " + item.getName() + " opacity="
+ (item.getActive().get() ? "1.0" : "0.5"));
item.getOpacity().set(item.getActive().get() ? 1.0 : .5);
}
}
catch(Exception ex)
{
ex.printStackTrace();
}
evt.setDropCompleted(success);
evt.consume();
}
public void onDragDetected(MouseEvent evt)
{
System.out.println("On Drag Detected");
DexTaskList source = (DexTaskList) evt.getSource();
/* drag was detected, start a drag-and-drop gesture */
/* allow any transfer mode */
int movingFrom = source.getSelectionModel().getSelectedIndex();
DexTaskItem item = source.getSelectionModel().getSelectedItem();
Dragboard db = source.startDragAndDrop(TransferMode.COPY_OR_MOVE);
/* Put a string on a dragboard */
ClipboardContent content = new ClipboardContent();
if (content != null && item != null && item.getTask() != null
&& item.getTask().get() != null)
{
content.put(DEX_TASK_LIST_MOVE, movingFrom);
db.setContent(content);
}
evt.consume();
}
public int getInsertionPoint()
{
return insertionPoint;
}
}
``` |
Roy Stewart (October 17, 1883 – April 26, 1933) was an American actor of the silent era. He appeared in more than 130 films between 1915 and 1933. He was born in San Diego, California. On April 26, 1933, he died at his Westwood, California, home, of a heart attack. He was 49 years old.
Partial filmography
The Solution to the Mystery (1915)
The Silver Lining (1915)
The Substitute Minister (1915)
The Wasp (1915)
The Exile of Bar-K Ranch (1915)
The Diamond from the Sky (1915)
The Hungry Actors (1915)
From Italy's Shores (1915)
Just Nuts (1915)
Willie Runs the Park (1915)
The House Built Upon Sand (1916)
Liberty (1916)
The Bruiser (1916)
The Craving (1916)
The Smugglers of Santa Cruz (1916)
The Thoroughbred (1916)
The Other Side of the Door (1916)
A Daughter of the Poor (1917)
The Double Standard (1917)
The Medicine Man (1917)
The Boss of the Lazy Y (1917)
Come Through (1917)
The Devil Dodger (1917)
One Shot Ross (1917)
Follow the Girl (1917)
The Learning of Jim Benton (1917)
Bond of Fear (1917)
The Red-Haired Cupid (1918)
The Beauty Market (1919)
The Westerners (1919)
The U.P. Trail (1920)
Riders of the Dawn (1920)
The Devil to Pay (1920)
Just a Wife (1920)
The Sagebrusher (1920)
The Money Changers (1920)
Prisoners of Love (1921)
The Mistress of Shenstone (1921)
A Motion to Adjourn (1921)
The Innocent Cheat (1921)
The Heart of the North (1921)
The Sagebrush Trail (1922)
The Radio King (1922)
The Snowshoe Trail (1922)
Back to Yellow Jacket (1922)
One Eighth Apache (1922)
Burning Words (1923)
Pure Grit (1923)
Trimmed in Scarlet (1923)
The Woman on the Jury (1924)
Sundown (1924)
Time, the Comedian (1925)
Where the Worst Begins (1925)
Daniel Boone Thru the Wilderness (1926)
With Buffalo Bill on the U. P. Trail (1926)
The Lady from Hell (1926)
General Custer at the Little Big Horn (1926)
One Woman to Another (1927)
Roaring Fires (1927)
The Viking (1928)
Stormy Waters (1928)
The Candy Kid (1928)
The Great Divide (1929)
Rough Romance (1930)
Born Reckless (1930)
Come on Danger! (1932)
Come On, Tarzan (1932)
Exposed (1932)
Fargo Express (1933)
References
External links
Roy Stewart at Virtual History
Kinotv
1883 births
1933 deaths
American male film actors
American male silent film actors
20th-century American male actors
Male actors from San Diego
Male Western (genre) film actors |
```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
*
*/
use Illuminate\Database\Migrations\Migration;
use Illuminate\Database\Schema\Blueprint;
use Illuminate\Support\Facades\Schema;
return new class () extends Migration {
/**
* Run the migrations.
*
* @return void
*/
public function up()
{
Schema::table('analisis_respon_bukti', static function (Blueprint $table) {
$table->foreign(['config_id'], 'analisis_respon_bukti_config_fk')->references(['id'])->on('config')->onUpdate('CASCADE')->onDelete('CASCADE');
});
}
/**
* Reverse the migrations.
*
* @return void
*/
public function down()
{
Schema::table('analisis_respon_bukti', static function (Blueprint $table) {
$table->dropForeign('analisis_respon_bukti_config_fk');
});
}
};
``` |
```scss
@include b(affix) {
@include define(zindex, 10);
z-index: var(--zindex);
}
``` |
Alexandra Attkisson Petri (, born March 15, 1988) is an American humorist and newspaper columnist. In 2010, she became the youngest person to have a column in The Washington Post. Petri runs the ComPost blog on the paper's website, on which she formerly worked with Dana Milbank. In 2017, a piece of satire she wrote about president Donald Trump was miscategorized as news and included in one of the White House's daily press briefings. She was recognized in the Forbes 30 Under 30 in 2018.
Biography
Early life and education
Petri grew up in Georgetown, Washington, D.C., the only child of Wisconsin congressman Tom Petri and nonprofit executive Anne D. Neal, and attended the National Cathedral School. In high school she wrote plays for a competition at Arena Stage; three of hers were chosen for performance. She would also perform standup comedy. She graduated summa cum laude and Phi Beta Kappa from Harvard University with a degree in English, concentrating in classics, in 2010; while there she joined the Harvard Stand Up Comedy Society, worked with the Hasty Pudding Club, and wrote for the Internet comedy series On Harvard Time and for the The Harvard Crimson. Her college roommate was Megan Amram. She was a summer intern at The Washington Post prior to receiving a job with the paper. She is also a member of a playwrights' collective in Washington, D.C., called The Welders.
Career
Her book of essays A Field Guide to Awkward Silences was published in 2015. She has appeared on Jeopardy!, won prizes in the O. Henry Pun-Off, and performed at an international whistling competition. Her play The Campsite Rule, a sex comedy whose title is derived from an idea taken from Dan Savage, was premiered at the Capital Fringe Festival in 2013.
In December 2015, Petri created the parody Twitter account "Emo Kylo Ren", which envisioned the Star Wars: The Force Awakens character Kylo Ren as an angsty teenager obsessed with Darth Vader. The account went viral after being retweeted by Hot Topic and receiving attention from media outlets such as USA Today and People Magazine, soon gaining more followers than Hot Topic. During the 8th Shorty Awards in 2016, the account won the award for best parody account. Petri revealed that she created this parody account in an interview with Syfy published on January 25, 2018.
Of her writing, Petri has said, "My goal is to be weirder than everybody else and hope that no one stops me. So far no one has." Writers and comedians she has listed as influences include James Thurber, Dave Barry, Mitch Hedberg, Mark Twain, Oscar Wilde, and William Shakespeare.
She made her comic book debut by writing the one-shot She-Hulk Annual #1, released on August 28, 2019. In April 2023 she released her second book "Alexandra Petri's US History: Important American Documents (I Made Up)"
Personal life
In June 2018, Petri married Stephen Stromberg, an editorial writer at the Washington Post. They welcomed their first child in February 2022.
Works
A Field Guide to Awkward Silences, New American Library, 2016.
Nothing Is Wrong and Here is Why: Essays, W. W. Norton & Company, 2020.
Alexandra Petri's US History: Important documents (I made up): Essays, W. W. Norton & Company, 2023.
References
External links
Alexandra Petri's page on The Washington Post
Emo Kylo Ren parody Twitter account
Living people
21st-century American dramatists and playwrights
21st-century American essayists
21st-century American journalists
21st-century American women writers
American columnists
American comics writers
American humorists
American women dramatists and playwrights
American women essayists
Female comics writers
Journalists from Washington, D.C.
The Harvard Crimson people
The Washington Post journalists
American women columnists
Women humorists
Writers from Washington, D.C.
National Cathedral School alumni
1988 births
Jeopardy! contestants
Shorty Award winners |
Splicing factor U2AF 65 kDa subunit is a protein that in humans is encoded by the U2AF2 gene.
Function
In eukaryotes, the introns in the transcribed pre-mRNA first have to be removed by spliceosome in order to form a mature mRNA. A spliceosome is assembled from small nuclear ribonucleoproteins(snRNP) and small nuclear RNAs(snRNA). And the splicing factor can be divided into snRNP and non snRNP proteins.U2 auxiliary factor (U2AF), composed of a large and a small subunit, is a non-snRNP protein required for the binding of U2 snRNP to the pre-mRNA branch site. This gene encodes the U2AF large subunit, which contains a sequence-specific RNA-binding region with 3 RNA recognition motifs and an Arg/Ser-rich domain necessary for splicing. The large subunit binds to the polypyrimidine tract of introns early during spliceosome assembly. Multiple alternatively spliced transcript variants have been detected for this gene, but the full-length natures of only two have been determined to date.
In humans and other tetrapods, it has been shown that without U2AF2, the splicing process is inhibited. However, in zebrafish and other teleosts the RNA splicing process can still occur on certain genes in the absence of U2AF2. This may be because 10% of genes have alternating TG and AC base pairs at the 3' splice site (3'ss) and 5' splice site (5'ss) respectively on each intron, which alters the secondary structure of the RNA and influences splicing.
The splicing factor U2AF65 can specifically recognizes the polypyrimidine tract (Py tract), that’s because U2AF65 consists of 3 RNA binding domains (RRMs), all of them have a high binding affinity to the Py tract on its adjacent 3’ splice site. The RRM1 and RRM2 are sufficient for specific RNA/protein binding, while RRM3 is responsible for protein/protein interactions. For example, the C-Terminal RRM3 contribute to establish protein–protein contacts with splicing factors like UAP56, SAP155, and mBBP/SF1.
Interactions
U2AF2 has been shown to interact with:
PUF60,
SF1,
SFRS11,
SFRS2IP,
SRPK2,
U2 small nuclear RNA auxiliary factor 1 and
WT1.
References
Further reading |
Black Tide was an American heavy metal band from Kendall, Florida. Formed in 2004, the band last consisted of Gabriel Garcia (lead guitar, lead vocals), Austin Diaz (rhythm guitar) and Cody Paige (drums). They released their debut album, Light from Above, on March 18, 2008 through Interscope Records when Garcia was 15 years old. Their second album, Post Mortem, was released on August 23, 2011. Black Tide's EP Bite the Bullet was released on November 12, 2013 by InnerCat Music Group, a Miami-based boutique label. On October 16, 2015 band released their last album Chasing Shadows. On July 22, 2016 Garcia announced on his Instagram that the band is over and he is concentrating on his solo project.
History
Formation and signing to Interscope Records (2004–2007)
Black Tide was founded in Kendall, Florida in 2004 under the name "Radio" by lead guitarist Gabriel Garcia and his older brother Raul Garcia. Raul recruited rhythm guitarist Alex Nuñez, then later bassist Zachary Sandler. At the time, Gabriel Garcia was 11 years old and Nuñez was just 13 years old. Garcia, Nuñez, and Sandler recruited drummer Steven Spence, after Raul's departure from the group. This completed the band's lineup. The band started playing local shows, eventually gaining the attention of record labels due to the members' young age and talent. Winder Marin, the former drummer was dropped and a replacement was brought in to keep the young image of the band. In 2005, Black Tide signed a demo deal with Atlantic Records as Radio. The deal lasted for only a year, before the band was spotted by a record executive for EMI, who notified Interscope Records of the band. By mid-2007, now named Black Tide, they were signed to Interscope.
Light from Above (2007–2009)
The band started touring and gained a position on the second stage of Ozzfest, but were removed from the tour because the stage was sponsored by Jägermeister and all of the members of Black Tide were under the legal drinking age. Although the band was no longer appearing on the second stage, Black Tide was able to be the opening act on the main stage in some areas, opening for Lordi, Static-X, Lamb of God, and Ozzy Osbourne. After Ozzfest, the band toured with Avenged Sevenfold and All That Remains.
In early 2007, half a year before playing Ozzfest, Black Tide entered the studio in Chicago with producer Johnny K. The band recorded 12 new tracks which included a cover of Metallica's first written song, "Hit the Lights", which originally appeared on Kill 'Em All. The resulting album, Light from Above, was released on March 18, 2008. The album was critically praised, with Dan Epstein of Revolver Magazine saying "Listening to the debut album from Miami's Black Tide is a little like stumbling across a cool late-80s metal record you'd completely forgotten about. A very promising debut" and Scott Alisoglu of Blabbermouth.net stating the album contains "Big, sometimes pop-based, melodies meets crunchy, guitar-driven metal that falls somewhere between thrash/traditional metal and the dirtier end of '80s glam/hair metal." Light from Above debuted at number 73 on the Billboard 200, with 11,400 copies sold in its first week of sales. Black Tide has also won the Kerrang! Award for Best Newcomer. On March 27, 2008, the band performed on the late-night show Jimmy Kimmel Live! on the ABC television network in the United States and Citytv in Canada.
In the summer of 2008, shortly before the Mayhem Festival guitarist Alex Nuñez left the band and was replaced by Austin Diaz. Austin "Panix" Diaz subsequently left his former hardcore/d-beat band The Panix for Black Tide. In an odd turn of events, Alex Nuñez joined The Panix to replace Diaz. Nuñez returned to his DIY punk roots and continues to play in many bands in Miami as a guitarist, vocalist, and drummer.
The band proceeded to tour on the Mayhem Festival, playing all around the U.S.
The band opened for Bullet for My Valentine on their European tour in November 2008, alongside Lacuna Coil and Bleeding Through. Black Tide also supported Bullet for My Valentine on their US tour in September. The band toured on the Kerrang! Relentless Energy Drink Tour with Mindless Self Indulgence, Dir en grey, Bring Me the Horizon and In Case of Fire. They have started performing "Prowler," an Iron Maiden cover, on this tour, which was formally recorded for Kerrang! Magazine's Iron Maiden Tribute CD, Maiden Heaven.
The band debuted on British television on January 17, 2009, on the BBC show SOUND before supporting Escape the Fate on their 2009 This War Is Ours Tour in February–March 2009. Other supporting acts included Attack Attack!, William Control, and Burn Halo. The band then supported Trivium between May 6, 2009 – May 19, 2009 on the Japanese and Australian legs of Into the Mouth of Hell We Tour. This followed a stint playing at the Warped Tour 2009, where the band started performing a new song entitled "Redefine".
Post Mortem (2010–2012)
In February 2010, it was confirmed that Black Tide was in the process of writing songs for their second album. In the May/June 2010 issue of Revolver magazine, it was confirmed that Black Tide has entered the studio with the intention of finishing recording by the end of June for a fall release. On the band's Facebook profile, Zakk filmed many different 1-minute videos from the studio about the work in the studio.
On July 26, 2010, Black Tide announced that they were going on tour supporting Bullet for My Valentine and Escape the Fate on their US tour in September–October 2010.
On September 17, 2010, the first single from the upcoming album, "Bury Me," was released. The CD single also included a B-side entitled "Honest Eyes" (which was later released as a single on its own). Following the release of the single, the band announced that the new album has a tentative release date of February 2011, through Interscope Records, and that it would be self-titled.
The band was the confirmed opening act for Iron Maiden on two shows in Florida. It was also announced that they will perform at the Sonisphere Festival in Knebworth, UK on Sunday July 10, 2011. On April 29, 2011, Black Tide has announced in an interview at the Golden Gods awards that the name of their second album is Post Mortem. They also confirmed that the new album has been delayed until summer 2011. The video for the next single was shot in May 2011. On May 17, the band made the announcement that the new album 'Post Mortem' would be released on August 23. The band was confirmed to perform at the 2011 Uproar Festival which featured dates in the United States and Canada. The tour started on August 26, 2011 and ended on October 15, 2011. They performed San Diego Comic-Con International in July 2011.
On August 10 the band released an acoustic version of the song "Let it Out" on the Revolver Magazine website. The album leaked on the internet August 17, 2011 and released later on August 23 selling 5,800 copies in the United States in its first week of release to land at a positioned number 73 on the Billboard 200 chart.
The band was part of the Uproar Festival along with bands Sevendust, Escape the Fate, Bullet for My Valentine, Seether, Three Days Grace, and Avenged Sevenfold. During the final two weeks of Uproar, bassist Zakk Sandler filled in for touring mates Escape the Fate while their bassist Max Green left to take care of a DUI but failed to return.
On October 8 the band released a digital EP titled the "Al Cielo EP", which is Spanish for "To the Sky EP". It featured Spanish re-recordings of songs "That Fire", "Let It Out" and "Into the Sky" with alternative names. They were to perform five dates in Australia as a part of the Soundwave Festival in February and March 2012 but canceled the tour for undisclosed reasons. The band has also released Acoustic versions of the songs "That Fire", and "Fight Til The Bitter End" via their YouTube account.
On March 23, 2012 the band appeared at the Vive Latino Festival in Mexico City in front of 120,000 people.
Just Another Drug (2012)
On July 11, 2012 Gabriel Garcia announced that the band has just recorded a new untitled EP, and that mixing and artwork is all that was left. One week later, the band stated the title of the EP will be titled Just Another Drug, and will be released on August 21 due to the artwork issues. On August 24, the band released an acoustic version of the song "Start Over" via their YouTube page.
On October 13, it was confirmed on Gabriel Garcia's Twitter that the band is working on demos for their next album.
On March 22, 2013, bassist Zakk Sandler gave an interview with The Vinnie Langdon show, stating that band was "on hiatus, for lack of a better word" and that the band is not currently doing anything together. He also stated that he was not invited to be a part of the Just Another Drug EP.
Departure of Steven Spence and Zakk Sandler and Bite the Bullet (2013)
On May 20, 2013, drummer Steven Spence announced his departure from the band. He stated on his Twitter account: "I was waiting for an announcement of my replacement but it's about time I let you all know that I will no longer be in Black Tide. I want to thank you all for your support throughout the years. It has been an amazing journey. I will still continue to write all types of music including Heavy Fucking Metal. I still love Light From Above and Post Mortem. I am a musician and I put my heart into everything that I create. It doesn't end here for me and I hope most of you will come along with me for the ride. Right now i'm working on my solo Suspense ep where I write/produce/engineer and perform electronic dance music with a twist of my live drums. I will be touring soon and if I don't know you, I want to meet you! I will be happy to answer any questions that you guys might have for me. Peace and Love"
On July 3, 2013, it was confirmed via Facebook that Tim D'Onofrio would be the new drummer of the band and that they were currently recording a new EP named Bite The Bullet. The band stated the EP would consist of 6 songs and will be released sometime in the summer. The vacancy of the bassist Zakk Sandler was filled by Gabriel Garcia himself. On August 5, Gabriel wrote on Facebook that "We really went back to our roots on this one & it is being mixed right now!" The EP will be released November 12, 2013.
On August 24, Black Tide announced that their first single off their upcoming EP would be titled "Not Afraid" and would be released on August 31.
On November 12, 2013, the band officially released Bite the Bullet (EP) via iTunes. The band went on to support the EP touring the East Coast from November 26 through December 9. A close friend to Gabriel, Ronny Gutierrez, filled in on bass duties during the tour.
Tim D'Onofrio announced via Facebook that he had left Black Tide on good terms.
Lineup changes, Chasing Shadows and breaking up (2014–2016)
On March 16, 2014, it was confirmed via Facebook that Ronny Gutierrez will permanently be the bassist of Black Tide and Cody Paige will be the new official drummer. Paige was discovered by Ronny Gutierrez; he was covering Black Tide songs on YouTube. Upon discovering Paige was a Florida native, he was immediately contacted to audition to be the band's new drummer.
Starting on May 23, 2014, Black Tide departed on their Rise Again Tour, in support of the Bite the Bullet (EP), with support from Threat Signal, Affiance, and Hatchet. Gabriel Garcia had the following to share about the upcoming headlining tour: "I can't wait to hit the road and bust this tour out. I've been driving around Miami blasting Hatchet all week. These guys are killer. We want to invite them to share our tour bus, but shit could get crazy. This is a kick ass bill, four high-energy live acts and the fans are gonna be blown away. A good time will be had by all. I may even announce our new record label on the last night of the tour."
In December 2014, it was reported Ronny was now playing guitar full-time with Shaggy, and would not be able to continue on bass duties due to Shaggy's extensive touring schedule.
As of January 2015, Gabe, Austin, and Cody have been recording a full-length album composed of all new material. On February 25, the band issued an update that drum work has been completed and guitars are being laid down. The sound of the new album is said to appease fans of both the first and second album, boasting rich solos, melodies, and heavy riffs. On May 22, the band announced through Facebook that the new album would be titled "Chasing Shadows" which was released October 16, 2015 via Pavement Entertainment.
On July 22, 2016, Gabriel Garcia announced in his Instagram that the band is over and he is concentrating on his solo project.
Musical style and influences
Their music has changed throughout each release. For their first album, Light from Above, critics described it as heavy metal and speed metal. For their second release, Post Mortem, they changed their sound to Metalcore. On their latest release, Just Another Drug EP, they have a more hard rock sound with a mix of some metalcore. In an interview, Gabriel has stated "We don't like to limit ourselves; If I did have to say something, I'd just say we're a rock band.
The band's influences include, Megadeth, Metallica, Iron Maiden, Pantera, Ozzy Osbourne, Judas Priest, Guns N' Roses, Mötley Crüe, Jimi Hendrix, Testament, Bullet for My Valentine, Trivium, Children of Bodom, Death, Van Halen, Kreator, Black Label Society, Avenged Sevenfold, Yngwie Malmsteen, Racer X, Incubus, Lamb of God, and The Beatles.
They have also covered Iron Maiden, and Metallica with the songs "Prowler" and "Hit the Lights". In an interview, Gabriel has said "I listen to everything from Justin Timberlake to U2 to Incubus to Pantera. I listen to a lot of hip hop — I just love music in general. I would say Guns N' Roses is one of my favorite bands." It was confirmed in an interview that Gabriel Garcia's favorite band is Megadeth, Zakk Sandler's is Iron Maiden and that Steven Spence's is Pantera.
In other media
The band's singles "Shockwave," and "Warriors of Time" were made available as downloadable content in the rhythm-based video game Rock Band; "Show Me the Way" was added later to Rock Band's downloadable content. "Shockwave" is also featured on the video game Skate 2 for Xbox 360 and PlayStation 3.
"Show Me the Way" is in MotorStorm: Pacific Rift, an all vehicle racing game for the PlayStation 3, and has also appeared on Rock Band Unplugged as a master track for PlayStation Portable.
"Warriors of Time" is also featured as the title theme in NHL 09 and is occasionally played during ice hockey matches in the NHL.
"Shout" is featured on the soundtrack for the racing game Colin McRae: Dirt 2 and NFL Tour.
"Warriors of Time", "Shockwave", "Light from Above", "Black Abyss" and "Shout" are featured as downloadable content for the iPod Touch and iPhone music game Tap Tap Revenge 2.
"Shockwave" is featured as the final song in Guitar Hero: Modern Hits.
"Honest Eyes" was featured in Street Fighter X Tekken, not only in multiple promotional trailers for the game, but also in the game itself as the background song for the introduction.
"That Fire" is featured as a level-up bonus in Tap Tap Revenge 4, and is featured on NHL 12, as well as a playable song in the GHTV section of Guitar Hero Live.
Band members
Gabriel Garcia – lead guitar, lead vocals (2004–2016), bass (2013–2014, 2014–2016)
Raul Garcia – drums (2004–2006)
Alex Nuñez – rhythm guitar, backing vocals (2004–2008)
Zakk Sandler – bass, backing vocals (2004–2013)
Steven Spence – drums (2006–2013)
Austin Diaz – rhythm guitar, backing vocals (2008–2016)
Tim D'Onofrio – drums (2013–2014)
Ronny Gutierrez – bass (2014)
Cody Paige – drums (2014–2016)
Timeline
Discography
Studio albums
Light from Above (2008)
Post Mortem (2011)
Chasing Shadows (2015)
References
External links
American thrash metal musical groups
Heavy metal musical groups from Florida
Interscope Records artists
Kerrang! Awards winners
Musical groups established in 2004
Musical groups from Miami
American musical quartets |
Digvijai Singh (11 December 1934 – 20 July 2018) was an Indian mechanical engineer and a former vice chancellor of the University of Roorkee before its reconstitution as the Indian Institute of Technology, Roorkee. He was also a former vice chairman of the All India Council for Technical Education (AICTE) and a former director of Central Road Research Institute. He is known for his studies on dynamics of single track vehicles and Fluid film lubrication and was an elected fellow of all the three major Indian science academies viz. Indian National Science Academy, Indian Academy of Sciences, and the National Academy of Sciences, India as well as the Indian National Academy of Engineering. The Council of Scientific and Industrial Research, the apex agency of the Government of India for scientific research, awarded him the Shanti Swarup Bhatnagar Prize for Science and Technology, one of the highest Indian science awards for his contributions to Engineering Sciences in 1978.
Biography
Born on 11 December 1934 in the Indian state of Uttar Pradesh, Digvijai Singh graduated in science from Allahabad University in 1953 before graduating in mechanical engineering from University of Roorkee (present-day Indian Institute of Technology, Roorkee) in 1956 and did another bachelor's degree in civil engineering in 1957 at the same institution before joining the university as a lecturer in 1958. Subsequently, he took a sabbatical to move to the US where he completed his master's degree (MS) in 1962 as well as a doctoral degree (PhD) in 1964 at the University of Wisconsin. On his return to India, he resumed his service at University of Roorkee and served as a professor, head of the department of mechanical and industrial engineering, dean of academics and dean of research and industrial liaison till 1990 when he was appointed as the director of the Central Road Research Institute. In 1996, he was made the vice chairman of the All India Council for Technical Education and after a service of 4 years, he became the vice chancellor of Roorkee University in 2000. He oversaw the transition of the university to an Indian Institute of Technology in 2001 and became the director of the IIT. He superannuated from service after handing over the charge to Prem Vrat in December 2001.
Legacy
Singh's early researches during his doctoral studies were funded by Harley-Davidson and were focused on single-track vehicles. Later, on Volkswagen and University of Stuttgart sponsorship, he worked on vehicle dynamics and tyre-pavement interaction and these studies assisted in improving the design of scooters as well as in the indigenization of their manufacturing. His work on welding technology covered weld pool solidification, effects of welding parameters on molten metal transfer, spatter, heat affected zones, changes in crystallographic structures, and solute redistribution and he proposed protocols for the analytical prediction and measurement of residual stresses in and around spot welds. Later in his career, he shifted his focus to tribological studies and contributed to widening the understanding of fluid film lubrication as well as hydrostatic and hydrodynamic lubrication. He also headed a research group engaged in the studies of Pavement management systems. His researches have been documented in 160 peer-reviewed articles; the online article repository of Indian Academy of Sciences has listed 49 of them. He has also mentored 19 doctoral and several master's scholars in their studies.
Singh sat in the board of directors of the International Road Federation from 1991 to 1994 and, as a founder member of the World Interchange Network, he served as a director of the organization from 1993 to 1996. He was the secretary of the Association of Academies and Societies of Sciences in Asia (AASSA) during 1993–94 and was a member of the Science and Engineering Council of the Department of Science and Technology during 1983–88 and 2000–03. He has been associated with several global and national bodies as a member; governing body of the Technology Information, Forecasting and Assessment Council (1997–99), committees of World Road Association, Central Board of Railway Research (1986–89, 1998-2000), National Accreditation Board for Testing and Calibration laboratories (1998-2000), Committee on Auto-Fuel Policy (2001–02) and Apex Committee on Road Construction and Transportation Equipment (2001–04) are some of them. He was a member of the board of governors of the Engineering Council of India (2002–07) and presided the Tribology Society of India from 1998 to 2000. He was the Lead Person of the Fly Ash Mission (FAM) of the Department of Science and Technology and chaired its Technology Advisory Group during 1993–99. He was also the chairman of programme advisory committee on the National Science and Technology Management System (1997–2003) and served as the national coordinator of the engineering sciences section of the Indo-Russian Integrated long term programme of cooperation in Science and Technology. He was closely associated with the Indian National Academy of Engineering; he has chaired the Engineering Education Forum of the academy and is a member of its Forum on Engineering Interventions for Disaster Mitigation.
Death
Professor D. V. Singh died in New Delhi on 20 July 2018.
Awards and honors
The Council of Scientific and Industrial Research awarded Singh the Shanti Swarup Bhatnagar Prize, one of the highest Indian science awards in 1978. He received two honors from the Institution of Engineers (India); the Mechanical Engineering Design Award in 1997 and the Eminent Engineering Personality Award in 2003. The Indian National Academy of Engineering awarded him the Jaikrishna Memorial Award in 2003; INAE would honor him again in 2015 with the Lifetime Achievement Award. In between, he received the Distinguished Alumnus Award of the Indian Institute of Technology, Roorkee in 2007 and the Lifetime Achievement Award of Tribology Society of India in 2011. He is also a recipient of the Silver Jubilee Award of IMDA.
The Indian Academy of Sciences elected him as a fellow in 1981 and he became an elected fellow of the Indian National Science Academy in 1983 and the National Academy of Sciences, India in 1990. He was also an elected fellow of the Indian National Academy of Engineering. He has held the National Professorship of the University Grants Commission of India and the award orations delivered by him include Dr. Guru Prasad Chatterjee Memorial Lecture of the Indian National Science Academy.
Selected bibliography
See also
Hydrostatics
Fluid dynamics
Notes
References
1934 births
2018 deaths
Recipients of the Shanti Swarup Bhatnagar Award in Engineering Science
Indian scientific authors
Fellows of the Indian Academy of Sciences
Fellows of the Indian National Science Academy
Scientists from Uttar Pradesh
Fellows of The National Academy of Sciences, India
Indian mechanical engineers
University of Allahabad alumni
IIT Roorkee alumni
University of Wisconsin–Madison alumni
Heads of universities and colleges in India
Tribologists
Fellows of the Indian National Academy of Engineering |
```javascript
'use strict';
import React, {Component} from 'react';
import PropTypes from 'prop-types';
import {withTranslation} from '../lib/i18n';
import {requiresAuthenticatedUser, Title, withPageHelpers} from '../lib/page';
import {Table} from '../lib/table';
import {HTTPMethod} from '../lib/axios';
import {withComponentMixins} from "../lib/decorator-helpers";
import {tableAddRestActionButton, tableRestActionDialogInit, tableRestActionDialogRender} from "../lib/modals";
@withComponentMixins([
withTranslation,
withPageHelpers,
requiresAuthenticatedUser
])
export default class UserShares extends Component {
constructor(props) {
super(props);
this.sharesTables = {};
this.state = {};
tableRestActionDialogInit(this);
}
static propTypes = {
user: PropTypes.object
}
render() {
const t = this.props.t;
const renderSharesTable = (entityTypeId, title, typeName) => {
const columns = [
{ data: 0, title: t('name') },
{ data: 1, title: t('role') },
{
actions: data => {
const actions = [];
const autoGenerated = data[3];
const perms = data[4];
if (!autoGenerated && perms.includes('share')) {
const name = data[0];
const entityId = data[2];
tableAddRestActionButton(
actions,
this,
{
method: HTTPMethod.PUT,
url: 'rest/shares',
data: {
entityTypeId,
entityId,
userId: this.props.user.id
},
refreshTables: () => {
for (const key in this.sharesTables) {
this.sharesTables[key].refresh();
}
}
},
{ icon: 'trash-alt', label: t('unshare') },
t('confirmUnsharing'),
t('areYouSureYouWantToRemoveTheSharingOfThe', {typeName, name}),
t('removingSharingOfTheTypeNameName', {typeName, name}),
t('sharingOfTheTypeNameNameRemoved', {typeName, name}),
null
);
}
return actions;
}
}
];
return (
<div>
<h3>{title}</h3>
<Table ref={node => this.sharesTables[entityTypeId] = node} withHeader dataUrl={`rest/shares-table-by-user/${entityTypeId}/${this.props.user.id}`} columns={columns} />
</div>
);
};
return (
<div>
{tableRestActionDialogRender(this)}
<Title>{t('sharesForUserUsername', {username: this.props.user.username})}</Title>
{renderSharesTable('namespace', t('namespaces'), t('namespace-1'))}
{renderSharesTable('list', t('lists'), t('list-1'))}
{renderSharesTable('template', t('templates'), t('template-1'))}
{renderSharesTable('mosaicoTemplate', t('mosaicoTemplates'), t('mosaicoTemplate'))}
{renderSharesTable('campaign', t('campaigns'), t('campaign-1'))}
{renderSharesTable('customForm', t('customForms-1', t('customForms-2')))}
{renderSharesTable('report', t('reports'), t('report-1'))}
{renderSharesTable('reportTemplate', t('reportTemplates'), t('reportTemplate-2'))}
{renderSharesTable('sendConfiguration', t('sendConfigurations-1'), t('sendConfiguration'))}
</div>
);
}
}
``` |
Luciano Cardenali (born 30 June 1986) is an Argentine former professional footballer who played as a forward.
External links
Profile at Tenfield
1986 births
Living people
Argentine men's footballers
Footballers from Buenos Aires
Men's association football forwards
Centro Atlético Fénix players
León de Huánuco footballers
Argentine expatriate men's footballers
Argentine expatriate sportspeople in Peru
Expatriate men's footballers in Peru
Argentine expatriate sportspeople in Uruguay
Expatriate men's footballers in Uruguay |
The Serra do Mar (, Portuguese for Sea's Ridge or Sea Ridge) is a 1,500 km long system of mountain ranges and escarpments in Southeastern Brazil.
Geography
The Serra do Mar runs parallel to the Atlantic Ocean coast from the state of Espírito Santo to southern Santa Catarina, although some literature includes the Serra Geral in the Serra do Mar, in which case the range would extend to northeastern Rio Grande do Sul.
The main escarpment forms the boundary between the sea-level littoral and the inland plateau (planalto), which has a mean altitude of . This escarpment is part of the Great Escarpment that runs along much of the eastern coast of Brazil south from the city of Salvador, Bahia.
Mountain ranges
The mountain ranges are discontinuous in several places and are given individual names such as Serra de Bocaina, Serra de Paranapiacaba, Serra Negra, Serra dos Órgãos, Serra do Indaiá, etc. The range also extends to some large islands near the coastline, such as Ilhabela and Ilha Anchieta. With an altitude of , Pico da Caledônia in Nova Friburgo is among the highest points in Serra do Mar.
Geologically, the range belongs to the massive crystalline rock platform that forms Eastern South America, and tectonically it is very stable. Most of the elevations of Serra do Mar were formed about 60 million years ago.
Natural history
At the time of the European discovery of Brazil (1500), the Serra do Mar supported a rich and highly diversified ecosystem, composed mainly of lush tropical rain forest, called Atlantic Forest (Mata Atlântica). Due to urbanization and deforestation, however, most of the forest cover has been destroyed and what cover remains is almost exclusively on the steep escarpments facing the sea.
A chain of national and state parks, ecological stations and biological reserves now protect the Mata Atlântica and its biological heritage, but acid rain, pollution, poachers, clandestine loggers, forest fires and encroachment by urban areas and farms are still causing active destruction, particularly in the areas around cities. Several large metropolises, such as Vale do Itajaí, Curitiba, São Paulo and Rio de Janeiro, are near the Serra do Mar.
Reforestation and recuperation of biological diversity are notoriously difficult to bring about in destroyed rain forest habitats.
See also
Ecoregions of the Atlantic Forest biome
List of plants of Atlantic Forest vegetation of Brazil
References
Mar, Serra do
Atlantic Forest
Escarpments
Landforms of Espírito Santo
Landforms of Rio de Janeiro (state)
Landforms of São Paulo (state)
Landforms of Santa Catarina (state)
World Heritage Sites in Brazil |
Montague is an unincorporated community in Pender County, North Carolina, United States. It is located east of Currie and southeast of Yamacraw.
Unincorporated communities in Pender County, North Carolina
Unincorporated communities in North Carolina |
The Canon PowerShot G is a series of digital cameras introduced by Canon in its PowerShot line in 2000. The G series cameras are Canon's flagship compact models aimed at photography enthusiasts desiring more flexibility than a point-and-shoot without the bulk of a digital single-lens reflex camera.
The G series has a lithium-ion battery, full manual exposure control, an articulated LCD screen (G7, G9, G10, G15, and G16 have a fixed screen), Raw image format capture (all models except G7), a lens with a wider maximum aperture than standard PowerShot models, remote capture (except G11), and faster image processing. The range also includes a hot shoe (except G7 X and G9 X) for an external flashgun, including Canon's EX range. New models in the series have larger sensors than most other point-and-shoot cameras (G1X, G1X Mark II, G7X).
Main specifications
G1 to G6
Common features across the early G series were:
A fast lens (minimum F number of 2.0).
A flip out and twist LCD, along with a smaller status LCD on the top of the camera.
Raw image format capture.
1/1.8″ CCD sensor.
Manual selection of aperture and shutter priority.
Custom white balance.
Built in flash.
Hot-shoe for external flash.
USB connectivity.
A Compact Flash card slot.
Availability of optional wide and teleconverter lenses.
Canon's proprietary EOS shooting modes, allowing the photographer to select different exposure settings for different environments.
Included infrared remote control.
In-built neutral density filter from the G3 onwards.
Lithium ion battery.
G7 to G12
The G7 marked a major change in the G series. Previous G series models had a fast lens, raw image format capture, and a tilt-and-swivel LCD. These were all considered hallmarks of the G series, but were removed or altered for the G7. Some of the major changes included:
Introduction of a lens with a minimum F number of 2.8, compared to 2.0 in other G series cameras. Although slower, this lens introduced improvements such as optical image stabilisation, a higher zoom range (6×), and a macro mode that would focus as close as 1 cm. The lens would also retract completely into the camera.
Change to a fixed LCD rather than a tilt-and-swivel model. The fixed LCD was larger (2.5″ versus 2.0″ on the G6) and increased the number of pixels by 75%. The tilt-and swivel LCD was restored with the G11, but removed again with the G15.
Removal of RAW image format on G7, but returned for the G9–G15.
No infrared remote control.
Change from CompactFlash to SDHC card storage.
Black, mostly metal, body.
Canon G12 records videos up to 720p HD quality, G15 1080p HD and G1 X 1080p. G15 and G1 X do allow to use zoom and autofocus during video recording.
Many of the changes made allowed the G7 to be significantly slimmer than previous G series cameras (e.g., the thickness of the G7 is 4.25 cm while the G6 is 7.3 cm), making it more portable.
Canon's removal of RAW shooting support was heavily criticized. DPReview expressed their disappointment with the loss of RAW format, while Luminous Landscape stated that the removal of RAW required too many technical decisions had to be made while shooting instead of during post-processing. RAW support can be enabled on the G7 using a free firmware add-on.
The G9 was released in 2007. RAW support was restored, and it has a larger LCD screen, and a 1/1.7″ sensor rather than the 1/1.8″ sensor on previous models.
The G11, released in 2009, reintroduced the flip out and twist LCD (2.8″). It also has a lower resolution sensor than that of its predecessor, the G10, because the new CCD favoured low light performance over resolution.
G15 and G16
The G15 was the successor to the G12 as the cheaper G-series model. It marked a return to a lens faster than those of early G cameras. It also has:
Minimum F numbers of 1.8 at the wide end and 2.8 at the tele end of the zoom range; the G12 had a minimum F number of 2.8 at the wide end
Pop-up flash button from the top of the camera
Because of the much larger sensor the G1 X still remained the top model despite G15 having nominally larger aperture.
The G16 shows only minor improvements over the G15, for example:
faster image processing
automatic star/star trail photography
60 fps HD movies
Wi-Fi
G1 X
The G1 X was introduced in February 2012 and is a significant step out of the traditional G-line because of its much larger sensor, and it is the first model with a CMOS sensor. The G1 X's sensor measures 18.7 x 14.0 mm (1.5"), which makes it even 16 percent bigger than the Micro Four Thirds standard (MFT), and 20 percent smaller than APS-C Canon sensor. G1 X was significant that it did not replace the older G12 but created a parallel model in the first time in G-series. Later that trend would continue with five parallel models from 2015 on. The camera is also bigger and heavier than the other G-series cameras, and the zoom range in equivalent 35mm is only 28-112mm (4x). With its maximum aperture over its zoom range being F2.8-5.8, and with its sensor smaller than Canon APS-C sensor, the G1 X camera-lens system can be compared to the APS-C DSLRs using the Canon EF-S 18-55mm f/3.5-5.6 IS II SLR Kit Lens: the G1 X is a little faster (wider aperture) at the wide angle and comparable thereafter, but with a longer zoom.
Released at early 2014, the G1 X Mark II has a 13.1-megapixel (in 4:3 aspect ratio), but still 1.5" CMOS sensor as the predecessor, a 24-120mm (5x) f/2-3.9 relatively a fast zoom lens, for better shallow depth of field throughout the maximum-aperture range, and sharp shots even in low light, a DIGIC 6 processor with capability to take 1080/60p MP4 video shoots. The camera lacks internal viewfinder but supports an external electronic one. It has no microphone input or headphone jack.
In October 2017 Canon introduced the third model of the G1 X-series: Canon PowerShot G1 X mark III. It replaced the 1.5" sensor with a 24 megapixel APS-C sensor used in many Canon EOS DSLR and mirrorless cameras. The camera also was much reduced in size and weight, weighting only 399 grams. To achieve the reduced size the zoom range was reduced to 15–45 mm (24–72 mm in 35 mm equivalence) and the size of the aperture was reduced from f/2.0-3.9 to f/2.8-5.6. The Mark III also has internal viewfinder and a DSLR-like form factor much similar to the G5 X. It also is the first PowerShot (with the exception of waterproof D-series) to have weather sealing.
G3 X
G3 X is the superzoom model in the G-series. It offers a 25x zoom (24–600 mm equivalent) with aperture f/2.8-5.6. It offers an alternative to the Canon Powershot SX-series cameras with much better image quality. Because of the lens the camera is much larger than other G-series cameras - weighing 739 grams. The camera supports an optional electronic viewfinder
G5 X and G9 X
In Q3 2015 Canon introduced the successors to its older G16 and S120 cameras. These were G5 X and G9 X respectively. Both of these use one inch sensor instead of the older 1/1.7". The G5 X is essentially a G7 X with an integral electronic viewfinder. The G16 had an optical viewfinder. The G5 X also has a DSLR-like form factor with viewfinder in the center instead of the rangefinder-like in the G16. The G9 X is similar in size to the S120 it replaced. The larger sensor necessitated that the zoom range was reduced from 5x to 3x i.e. 24 – 120 mm to 28 – 84 mm. With the introduction of the G9 X the S-series was discontinued and all top models are in G-series. It also meant the end of the use of 1/1.7" (9.5 mm diagonal) sensors in Canon cameras and all top models being at least one inch (16 mm diagonal) and other models having 1/2.3" (7.7 mm diagonal).
In 2017 Canon updated the G9 X into G9 X mark II with the new Digic 7 processor, faster operation and built in RAW processing. No external changes were done.
G7 X
With the G7 X, Canon added its own model to the large-sensor compact camera market. The G7X is Canon's first 1-inch sensor model, and boasts 20.2-megapixels and the DIGIC 6 image processor. Despite this, the camera is still small enough to be pocketable, like its primary competitor, the Sony RX100. It has a 4.2x zoom (24-100mm in 35mm format), a maximum aperture of f/1.8-f/2.8, ISO 12800, Full HD video shooting, 31 AF points, and Wi-Fi/NFC support. It inherits many characteristics of the previous G-series cameras, including the comparable G1X Mark II. The G7 X is the first G-series camera without a hot shoe.
G7 X Mark II
In 2016 Canon announced the Canon PowerShot G7 X Mark II which follows the original G7 X. It retains the same sensor and lens as its predecessor. The main improvement is the new DIGIC 7 Processor. In fact the G7 X Mark II is the first Canon camera to use this new chip. This new chip leads to better AF performance, object tracking, reduced ISO noise and higher speed burst shooting. Some other improvements are that the screen can now flip both up and down, a new grip, tiltable flash, auto functionality for the ND filter, battery charging over USB, and a new timelapse mode. The G7 X Mark II costs $650 on the official Canon website.
Model details
Note that the weight up to G12 is for the camera without the battery and from G1 X on the camera including the battery and the memory card.
Accessories
The Powershot G series can employ several photographic accessories:
Filters and other threaded lens accessories can be used with an adapter tube available from Canon or third party suppliers.
Close-up lenses
Wide angle or telephoto converter lenses
Starting from the G7, there is a bayonet mount on the front of the camera around the lens to directly attach lenses and accessories.
Powershot G series cameras have a standard threaded socket for mounting to a monopod or tripod. This can also be used for attaching the camera to various brackets or adapters.
With the hot-shoe for external flash, the Powershot G series can accept not only compatible flash units but also various connecting cords and wireless triggers. However, the Powershot G series is sensitive to the voltage produced by certain flash units, particularly older designs. Canon recommends that the maximum trigger voltage be less than 6 volts for any flash or accessory attached to the hot-shoe.
Flash compatibility is somewhat of an issue with the Powershot G series. Canon EX flashes are compatible but all EX features may not necessarily be usable. In particular, when the Powershot G is in manual exposure mode, the external flash is also in manual mode; that is, ETTL flash control is not operable.
Use by a journalist
John D McHugh used a G12 when covering the Bahraini uprising.
See also
Canon PowerShot A
Canon PowerShot S/SX
Canon PowerShot SD or Digital Elph
References
External links
New models
Canon PowerShot G7 – Canon USA website
Canon PowerShot G9 – Canon USA website
Canon PowerShot G10 – Canon USA website
Canon PowerShot G11 – Canon USA website
Canon PowerShot G12 - Canon USA website
Canon G11 vs G12
dpReview of G1 X
Old models
Canon G1 Info
Canon G3 Info
Canon G5 info
Canon G6 info
G |
Prasophyllum flavum, commonly known as the yellow leek orchid, is a species of orchid endemic to eastern Australia. It has a single tubular, green leaf with only a short free section and up to fifty scented, yellowish-green flowers.
Description
Prasophyllum flavum is a terrestrial, perennial, deciduous, herb with a rhizome-like underground tuber and a single tube-shaped leaf, up to long with a free section less than long. Between eight and fifty fragrant flowers up to across are crowded along a flowering spike up to tall. The flowers are yellowish-green with the ovary pressed up against the flowering stem. As with others in the genus, the flowers are inverted so that the labellum is above the column rather than below it. The dorsal sepal is egg-shaped to lance-shaped, up to long is deeply dished. The lateral sepals are also up to long, dished liked the dorsal sepal and usually, but not always, joined for most of their length. The petals are egg-shaped to lance-shaped, up to long and have a pointed end. The labellum is egg-shaped to lance-shaped, up to long, turns upwards and has wavy, wrinkled edges. Flowering occurs from October to January.
Taxonomy and naming
Prasophyllum flavum was first formally described in 1810 by Robert Brown and the description was published in Prodromus Florae Novae Hollandiae et Insulae Van Diemen. The specific epithet (flavum) is a Latin word meaning "yellow" or "golden-yellow".
Distribution and habitat
The yellow leek orchid grows in moist, fertile soils in high-rainfall forests. It is found on the coast and ranges of New South Wales and in Victoria south-east Queensland and in Tasmania.
References
External links
flavum
Flora of New South Wales
Flora of Queensland
Flora of Tasmania
Flora of Victoria (state)
Endemic orchids of Australia
Plants described in 1810 |
Ely do Amparo, commonly known as just Ely (May 14, 1921 – March 9, 1991), was a Brazilian football central defender, who played in two World Cups.
Career
Ely do Amparo started his career with América, in 1939. He joined Canto do Rio in 1940, leaving the club in 1945 to join Vasco. Ely, as part of Vasco's Expresso da Vitória squad, won the Campeonato Carioca in 1945, 1947, 1949, 1950 and in 1952, winning the South American Club Championship in 1948 as well. Ely do Amparo was transferred to Sport in 1953, winning the Campeonato Pernambucano in that year and in 1955, when he retired.
National team
He played 19 games for the Brazil national team, including being part of the World Cup squad in 1950 and in 1954. He was part of the squad that won the Panamerican Championship in 1952.
Honors
Club
Sport
Campeonato Pernambucano: 1953, 1955
Vasco
Campeonato Carioca: 1945, 1947, 1949, 1950, 1952
South American Championship of Champions: 1948
Country
Brazil
Copa América: 1949
Panamerican Championship: 1952
FIFA World Cup runner-up: 1950
References
1921 births
1991 deaths
Brazilian men's footballers
Brazil men's international footballers
1950 FIFA World Cup players
1954 FIFA World Cup players
America Football Club (Rio de Janeiro) players
Canto do Rio Foot-Ball Club players
CR Vasco da Gama players
Sport Club do Recife players
Men's association football defenders
People from Paracambi
Footballers from Rio de Janeiro (state) |
```go
// _ _
// __ _____ __ ___ ___ __ _| |_ ___
// \ \ /\ / / _ \/ _` \ \ / / |/ _` | __/ _ \
// \ V V / __/ (_| |\ V /| | (_| | || __/
// \_/\_/ \___|\__,_| \_/ |_|\__,_|\__\___|
//
//
// CONTACT: hello@weaviate.io
//
package v1
import (
"testing"
"github.com/weaviate/weaviate/entities/models"
"github.com/weaviate/weaviate/usecases/byteops"
"github.com/stretchr/testify/require"
"github.com/weaviate/weaviate/entities/schema"
pb "github.com/weaviate/weaviate/grpc/generated/protocol/v1"
)
type innerTest struct {
datatype schema.DataType
out *pb.Value
shouldError bool
}
func makeTestList(succeedingInnerTests map[schema.DataType]*pb.Value) []innerTest {
dtypes := append(schema.PrimitiveDataTypes, schema.DeprecatedPrimitiveDataTypes...)
list := make([]innerTest, len(dtypes))
for idx, dtype := range dtypes {
out, ok := succeedingInnerTests[dtype]
if ok {
list[idx] = innerTest{
datatype: dtype,
out: out,
shouldError: false,
}
} else {
list[idx] = innerTest{
datatype: dtype,
out: nil,
shouldError: true,
}
}
}
return list
}
func TestNewPrimitiveValue(t *testing.T) {
float_val := float32(1.1)
tests := []struct {
name string
in any
tests map[bool][]innerTest
}{
{
name: "bools",
in: []bool{true, false},
tests: map[bool][]innerTest{
false: makeTestList(map[schema.DataType]*pb.Value{
schema.DataTypeBooleanArray: {Kind: &pb.Value_ListValue{ListValue: &pb.ListValue{
Values: []*pb.Value{
{Kind: &pb.Value_BoolValue{BoolValue: true}},
{Kind: &pb.Value_BoolValue{BoolValue: false}},
},
}}},
}),
true: makeTestList(map[schema.DataType]*pb.Value{
schema.DataTypeBooleanArray: {Kind: &pb.Value_ListValue{ListValue: &pb.ListValue{
Kind: &pb.ListValue_BoolValues{BoolValues: &pb.BoolValues{Values: []bool{true, false}}},
}}},
}),
},
},
{
name: "strings",
in: []string{"a string", "another string"},
tests: map[bool][]innerTest{
false: makeTestList(map[schema.DataType]*pb.Value{
schema.DataTypeDateArray: {Kind: &pb.Value_ListValue{ListValue: &pb.ListValue{Values: []*pb.Value{
{Kind: &pb.Value_DateValue{DateValue: "a string"}},
{Kind: &pb.Value_DateValue{DateValue: "another string"}},
}}}},
schema.DataTypeStringArray: {Kind: &pb.Value_ListValue{ListValue: &pb.ListValue{Values: []*pb.Value{
{Kind: &pb.Value_StringValue{StringValue: "a string"}},
{Kind: &pb.Value_StringValue{StringValue: "another string"}},
}}}},
schema.DataTypeTextArray: {Kind: &pb.Value_ListValue{ListValue: &pb.ListValue{Values: []*pb.Value{
{Kind: &pb.Value_StringValue{StringValue: "a string"}},
{Kind: &pb.Value_StringValue{StringValue: "another string"}},
}}}},
schema.DataTypeUUIDArray: {Kind: &pb.Value_ListValue{ListValue: &pb.ListValue{Values: []*pb.Value{
{Kind: &pb.Value_UuidValue{UuidValue: "a string"}},
{Kind: &pb.Value_UuidValue{UuidValue: "another string"}},
}}}},
}),
true: makeTestList(map[schema.DataType]*pb.Value{
schema.DataTypeDateArray: {Kind: &pb.Value_ListValue{ListValue: &pb.ListValue{
Kind: &pb.ListValue_DateValues{DateValues: &pb.DateValues{Values: []string{"a string", "another string"}}},
}}},
schema.DataTypeStringArray: {Kind: &pb.Value_ListValue{ListValue: &pb.ListValue{
Kind: &pb.ListValue_TextValues{TextValues: &pb.TextValues{Values: []string{"a string", "another string"}}},
}}},
schema.DataTypeTextArray: {Kind: &pb.Value_ListValue{ListValue: &pb.ListValue{
Kind: &pb.ListValue_TextValues{TextValues: &pb.TextValues{Values: []string{"a string", "another string"}}},
}}},
schema.DataTypeUUIDArray: {Kind: &pb.Value_ListValue{ListValue: &pb.ListValue{
Kind: &pb.ListValue_UuidValues{UuidValues: &pb.UuidValues{Values: []string{"a string", "another string"}}},
}}},
}),
},
},
{
name: "float64s",
in: []float64{1.1, 2.2, 3.3},
tests: map[bool][]innerTest{
false: makeTestList(map[schema.DataType]*pb.Value{
schema.DataTypeNumberArray: {Kind: &pb.Value_ListValue{ListValue: &pb.ListValue{Values: []*pb.Value{
{Kind: &pb.Value_NumberValue{NumberValue: 1.1}},
{Kind: &pb.Value_NumberValue{NumberValue: 2.2}},
{Kind: &pb.Value_NumberValue{NumberValue: 3.3}},
}}}},
schema.DataTypeIntArray: {Kind: &pb.Value_ListValue{ListValue: &pb.ListValue{Values: []*pb.Value{
{Kind: &pb.Value_IntValue{IntValue: 1}},
{Kind: &pb.Value_IntValue{IntValue: 2}},
{Kind: &pb.Value_IntValue{IntValue: 3}},
}}}},
}),
true: makeTestList(map[schema.DataType]*pb.Value{
schema.DataTypeNumberArray: {Kind: &pb.Value_ListValue{ListValue: &pb.ListValue{
Kind: &pb.ListValue_NumberValues{NumberValues: &pb.NumberValues{Values: byteops.Float64ToByteVector([]float64{1.1, 2.2, 3.3})}},
}}},
schema.DataTypeIntArray: {Kind: &pb.Value_ListValue{ListValue: &pb.ListValue{
Kind: &pb.ListValue_IntValues{IntValues: &pb.IntValues{Values: byteops.IntsToByteVector([]float64{1, 2, 3})}},
}}},
}),
},
},
{
name: "empty array",
in: []interface{}{},
tests: map[bool][]innerTest{
false: makeTestList(map[schema.DataType]*pb.Value{
schema.DataTypeBooleanArray: {Kind: &pb.Value_ListValue{ListValue: &pb.ListValue{Values: []*pb.Value{}}}},
schema.DataTypeDateArray: {Kind: &pb.Value_ListValue{ListValue: &pb.ListValue{Values: []*pb.Value{}}}},
schema.DataTypeNumberArray: {Kind: &pb.Value_ListValue{ListValue: &pb.ListValue{Values: []*pb.Value{}}}},
schema.DataTypeIntArray: {Kind: &pb.Value_ListValue{ListValue: &pb.ListValue{Values: []*pb.Value{}}}},
schema.DataTypeStringArray: {Kind: &pb.Value_ListValue{ListValue: &pb.ListValue{Values: []*pb.Value{}}}},
schema.DataTypeTextArray: {Kind: &pb.Value_ListValue{ListValue: &pb.ListValue{Values: []*pb.Value{}}}},
schema.DataTypeUUIDArray: {Kind: &pb.Value_ListValue{ListValue: &pb.ListValue{Values: []*pb.Value{}}}},
}),
true: makeTestList(map[schema.DataType]*pb.Value{
schema.DataTypeBooleanArray: {Kind: &pb.Value_ListValue{ListValue: &pb.ListValue{
Kind: &pb.ListValue_BoolValues{BoolValues: &pb.BoolValues{Values: []bool{}}},
}}},
schema.DataTypeDateArray: {Kind: &pb.Value_ListValue{ListValue: &pb.ListValue{
Kind: &pb.ListValue_DateValues{DateValues: &pb.DateValues{Values: []string{}}},
}}},
schema.DataTypeNumberArray: {Kind: &pb.Value_ListValue{ListValue: &pb.ListValue{
Kind: &pb.ListValue_NumberValues{NumberValues: &pb.NumberValues{Values: byteops.Float64ToByteVector([]float64{})}},
}}},
schema.DataTypeIntArray: {Kind: &pb.Value_ListValue{ListValue: &pb.ListValue{
Kind: &pb.ListValue_IntValues{IntValues: &pb.IntValues{Values: byteops.IntsToByteVector([]float64{})}},
}}},
schema.DataTypeStringArray: {Kind: &pb.Value_ListValue{ListValue: &pb.ListValue{
Kind: &pb.ListValue_TextValues{TextValues: &pb.TextValues{Values: []string{}}},
}}},
schema.DataTypeTextArray: {Kind: &pb.Value_ListValue{ListValue: &pb.ListValue{
Kind: &pb.ListValue_TextValues{TextValues: &pb.TextValues{Values: []string{}}},
}}},
schema.DataTypeUUIDArray: {Kind: &pb.Value_ListValue{ListValue: &pb.ListValue{
Kind: &pb.ListValue_UuidValues{UuidValues: &pb.UuidValues{Values: []string{}}},
}}},
}),
},
},
{
name: "bool",
in: true,
tests: map[bool][]innerTest{
false: makeTestList(map[schema.DataType]*pb.Value{
schema.DataTypeBoolean: {Kind: &pb.Value_BoolValue{BoolValue: true}},
}),
true: makeTestList(map[schema.DataType]*pb.Value{
schema.DataTypeBoolean: {Kind: &pb.Value_BoolValue{BoolValue: true}},
}),
},
},
{
name: "string",
in: "a string",
tests: map[bool][]innerTest{
false: makeTestList(map[schema.DataType]*pb.Value{
schema.DataTypeDate: {Kind: &pb.Value_DateValue{DateValue: "a string"}},
schema.DataTypeString: {Kind: &pb.Value_StringValue{StringValue: "a string"}},
schema.DataTypeText: {Kind: &pb.Value_StringValue{StringValue: "a string"}},
schema.DataTypeUUID: {Kind: &pb.Value_UuidValue{UuidValue: "a string"}},
schema.DataTypeBlob: {Kind: &pb.Value_BlobValue{BlobValue: "a string"}},
}),
true: makeTestList(map[schema.DataType]*pb.Value{
schema.DataTypeDate: {Kind: &pb.Value_DateValue{DateValue: "a string"}},
schema.DataTypeString: {Kind: &pb.Value_TextValue{TextValue: "a string"}},
schema.DataTypeText: {Kind: &pb.Value_TextValue{TextValue: "a string"}},
schema.DataTypeUUID: {Kind: &pb.Value_UuidValue{UuidValue: "a string"}},
schema.DataTypeBlob: {Kind: &pb.Value_BlobValue{BlobValue: "a string"}},
}),
},
},
{
name: "float64",
in: 1.1,
tests: map[bool][]innerTest{
false: makeTestList(map[schema.DataType]*pb.Value{
schema.DataTypeNumber: {Kind: &pb.Value_NumberValue{NumberValue: 1.1}},
schema.DataTypeInt: {Kind: &pb.Value_IntValue{IntValue: 1}},
}),
true: makeTestList(map[schema.DataType]*pb.Value{
schema.DataTypeNumber: {Kind: &pb.Value_NumberValue{NumberValue: 1.1}},
schema.DataTypeInt: {Kind: &pb.Value_IntValue{IntValue: 1}},
}),
},
},
{
name: "geo",
in: &models.GeoCoordinates{Longitude: &float_val, Latitude: &float_val},
tests: map[bool][]innerTest{
false: makeTestList(map[schema.DataType]*pb.Value{
schema.DataTypeGeoCoordinates: {Kind: &pb.Value_GeoValue{GeoValue: &pb.GeoCoordinate{Latitude: float_val, Longitude: float_val}}},
}),
true: makeTestList(map[schema.DataType]*pb.Value{
schema.DataTypeGeoCoordinates: {Kind: &pb.Value_GeoValue{GeoValue: &pb.GeoCoordinate{Latitude: float_val, Longitude: float_val}}},
}),
},
},
{
name: "phone number",
in: &models.PhoneNumber{Input: "1234567890"},
tests: map[bool][]innerTest{
false: makeTestList(map[schema.DataType]*pb.Value{
schema.DataTypePhoneNumber: {Kind: &pb.Value_PhoneValue{PhoneValue: &pb.PhoneNumber{Input: "1234567890"}}},
}),
true: makeTestList(map[schema.DataType]*pb.Value{
schema.DataTypePhoneNumber: {Kind: &pb.Value_PhoneValue{PhoneValue: &pb.PhoneNumber{Input: "1234567890"}}},
}),
},
},
}
for _, tt := range tests {
for uses125, innerTests := range tt.tests {
for _, test := range innerTests {
m := NewMapping(uses125)
out, err := m.NewPrimitiveValue(tt.in, test.datatype)
if test.shouldError {
if err == nil {
t.Logf("expected an error for %v and %s", tt.in, test.datatype)
}
require.Error(t, err)
} else {
require.NoError(t, err)
require.Equal(t, test.out, out)
}
}
}
}
}
``` |
```c++
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#if V8_TARGET_ARCH_ARM64
#include "src/codegen.h"
#include "src/ic/ic.h"
#include "src/ic/ic-compiler.h"
#include "src/ic/stub-cache.h"
namespace v8 {
namespace internal {
#define __ ACCESS_MASM(masm)
// "type" holds an instance type on entry and is not clobbered.
// Generated code branch on "global_object" if type is any kind of global
// JS object.
static void GenerateGlobalInstanceTypeCheck(MacroAssembler* masm, Register type,
Label* global_object) {
__ Cmp(type, JS_GLOBAL_OBJECT_TYPE);
__ Ccmp(type, JS_GLOBAL_PROXY_TYPE, ZFlag, ne);
__ B(eq, global_object);
}
// Helper function used from LoadIC GenerateNormal.
//
// elements: Property dictionary. It is not clobbered if a jump to the miss
// label is done.
// name: Property name. It is not clobbered if a jump to the miss label is
// done
// result: Register for the result. It is only updated if a jump to the miss
// label is not done.
// The scratch registers need to be different from elements, name and result.
// The generated code assumes that the receiver has slow properties,
// is not a global object and does not have interceptors.
static void GenerateDictionaryLoad(MacroAssembler* masm, Label* miss,
Register elements, Register name,
Register result, Register scratch1,
Register scratch2) {
DCHECK(!AreAliased(elements, name, scratch1, scratch2));
DCHECK(!AreAliased(result, scratch1, scratch2));
Label done;
// Probe the dictionary.
NameDictionaryLookupStub::GeneratePositiveLookup(masm, miss, &done, elements,
name, scratch1, scratch2);
// If probing finds an entry check that the value is a normal property.
__ Bind(&done);
static const int kElementsStartOffset =
NameDictionary::kHeaderSize +
NameDictionary::kElementsStartIndex * kPointerSize;
static const int kDetailsOffset = kElementsStartOffset + 2 * kPointerSize;
__ Ldr(scratch1, FieldMemOperand(scratch2, kDetailsOffset));
__ Tst(scratch1, Smi::FromInt(PropertyDetails::TypeField::kMask));
__ B(ne, miss);
// Get the value at the masked, scaled index and return.
__ Ldr(result,
FieldMemOperand(scratch2, kElementsStartOffset + 1 * kPointerSize));
}
// Helper function used from StoreIC::GenerateNormal.
//
// elements: Property dictionary. It is not clobbered if a jump to the miss
// label is done.
// name: Property name. It is not clobbered if a jump to the miss label is
// done
// value: The value to store (never clobbered).
//
// The generated code assumes that the receiver has slow properties,
// is not a global object and does not have interceptors.
static void GenerateDictionaryStore(MacroAssembler* masm, Label* miss,
Register elements, Register name,
Register value, Register scratch1,
Register scratch2) {
DCHECK(!AreAliased(elements, name, value, scratch1, scratch2));
Label done;
// Probe the dictionary.
NameDictionaryLookupStub::GeneratePositiveLookup(masm, miss, &done, elements,
name, scratch1, scratch2);
// If probing finds an entry in the dictionary check that the value
// is a normal property that is not read only.
__ Bind(&done);
static const int kElementsStartOffset =
NameDictionary::kHeaderSize +
NameDictionary::kElementsStartIndex * kPointerSize;
static const int kDetailsOffset = kElementsStartOffset + 2 * kPointerSize;
static const int kTypeAndReadOnlyMask =
PropertyDetails::TypeField::kMask |
PropertyDetails::AttributesField::encode(READ_ONLY);
__ Ldrsw(scratch1, UntagSmiFieldMemOperand(scratch2, kDetailsOffset));
__ Tst(scratch1, kTypeAndReadOnlyMask);
__ B(ne, miss);
// Store the value at the masked, scaled index and return.
static const int kValueOffset = kElementsStartOffset + kPointerSize;
__ Add(scratch2, scratch2, kValueOffset - kHeapObjectTag);
__ Str(value, MemOperand(scratch2));
// Update the write barrier. Make sure not to clobber the value.
__ Mov(scratch1, value);
__ RecordWrite(elements, scratch2, scratch1, kLRHasNotBeenSaved,
kDontSaveFPRegs);
}
// Checks the receiver for special cases (value type, slow case bits).
// Falls through for regular JS object and return the map of the
// receiver in 'map_scratch' if the receiver is not a SMI.
static void GenerateKeyedLoadReceiverCheck(MacroAssembler* masm,
Register receiver,
Register map_scratch,
Register scratch,
int interceptor_bit, Label* slow) {
DCHECK(!AreAliased(map_scratch, scratch));
// Check that the object isn't a smi.
__ JumpIfSmi(receiver, slow);
// Get the map of the receiver.
__ Ldr(map_scratch, FieldMemOperand(receiver, HeapObject::kMapOffset));
// Check bit field.
__ Ldrb(scratch, FieldMemOperand(map_scratch, Map::kBitFieldOffset));
__ Tbnz(scratch, Map::kIsAccessCheckNeeded, slow);
__ Tbnz(scratch, interceptor_bit, slow);
// Check that the object is some kind of JS object EXCEPT JS Value type.
// In the case that the object is a value-wrapper object, we enter the
// runtime system to make sure that indexing into string objects work
// as intended.
STATIC_ASSERT(JS_OBJECT_TYPE > JS_VALUE_TYPE);
__ Ldrb(scratch, FieldMemOperand(map_scratch, Map::kInstanceTypeOffset));
__ Cmp(scratch, JS_OBJECT_TYPE);
__ B(lt, slow);
}
// Loads an indexed element from a fast case array.
//
// receiver - holds the receiver on entry.
// Unchanged unless 'result' is the same register.
//
// key - holds the smi key on entry.
// Unchanged unless 'result' is the same register.
//
// elements - holds the elements of the receiver and its prototypes. Clobbered.
//
// result - holds the result on exit if the load succeeded.
// Allowed to be the the same as 'receiver' or 'key'.
// Unchanged on bailout so 'receiver' and 'key' can be safely
// used by further computation.
static void GenerateFastArrayLoad(MacroAssembler* masm, Register receiver,
Register key, Register elements,
Register scratch1, Register scratch2,
Register result, Label* slow,
LanguageMode language_mode) {
DCHECK(!AreAliased(receiver, key, elements, scratch1, scratch2));
Label check_prototypes, check_next_prototype;
Label done, in_bounds, absent;
// Check for fast array.
__ Ldr(elements, FieldMemOperand(receiver, JSObject::kElementsOffset));
__ AssertFastElements(elements);
// Check that the key (index) is within bounds.
__ Ldr(scratch1, FieldMemOperand(elements, FixedArray::kLengthOffset));
__ Cmp(key, scratch1);
__ B(lo, &in_bounds);
// Out of bounds. Check the prototype chain to see if we can just return
// 'undefined'.
__ Cmp(key, Operand(Smi::FromInt(0)));
__ B(lt, slow); // Negative keys can't take the fast OOB path.
__ Bind(&check_prototypes);
__ Ldr(scratch2, FieldMemOperand(receiver, HeapObject::kMapOffset));
__ Bind(&check_next_prototype);
__ Ldr(scratch2, FieldMemOperand(scratch2, Map::kPrototypeOffset));
// scratch2: current prototype
__ JumpIfRoot(scratch2, Heap::kNullValueRootIndex, &absent);
__ Ldr(elements, FieldMemOperand(scratch2, JSObject::kElementsOffset));
__ Ldr(scratch2, FieldMemOperand(scratch2, HeapObject::kMapOffset));
// elements: elements of current prototype
// scratch2: map of current prototype
__ CompareInstanceType(scratch2, scratch1, JS_OBJECT_TYPE);
__ B(lo, slow);
__ Ldrb(scratch1, FieldMemOperand(scratch2, Map::kBitFieldOffset));
__ Tbnz(scratch1, Map::kIsAccessCheckNeeded, slow);
__ Tbnz(scratch1, Map::kHasIndexedInterceptor, slow);
__ JumpIfNotRoot(elements, Heap::kEmptyFixedArrayRootIndex, slow);
__ B(&check_next_prototype);
__ Bind(&absent);
if (is_strong(language_mode)) {
// Strong mode accesses must throw in this case, so call the runtime.
__ B(slow);
} else {
__ LoadRoot(result, Heap::kUndefinedValueRootIndex);
__ B(&done);
}
__ Bind(&in_bounds);
// Fast case: Do the load.
__ Add(scratch1, elements, FixedArray::kHeaderSize - kHeapObjectTag);
__ SmiUntag(scratch2, key);
__ Ldr(scratch2, MemOperand(scratch1, scratch2, LSL, kPointerSizeLog2));
// In case the loaded value is the_hole we have to check the prototype chain.
__ JumpIfRoot(scratch2, Heap::kTheHoleValueRootIndex, &check_prototypes);
// Move the value to the result register.
// 'result' can alias with 'receiver' or 'key' but these two must be
// preserved if we jump to 'slow'.
__ Mov(result, scratch2);
__ Bind(&done);
}
// Checks whether a key is an array index string or a unique name.
// Falls through if a key is a unique name.
// The map of the key is returned in 'map_scratch'.
// If the jump to 'index_string' is done the hash of the key is left
// in 'hash_scratch'.
static void GenerateKeyNameCheck(MacroAssembler* masm, Register key,
Register map_scratch, Register hash_scratch,
Label* index_string, Label* not_unique) {
DCHECK(!AreAliased(key, map_scratch, hash_scratch));
// Is the key a name?
Label unique;
__ JumpIfObjectType(key, map_scratch, hash_scratch, LAST_UNIQUE_NAME_TYPE,
not_unique, hi);
STATIC_ASSERT(LAST_UNIQUE_NAME_TYPE == FIRST_NONSTRING_TYPE);
__ B(eq, &unique);
// Is the string an array index with cached numeric value?
__ Ldr(hash_scratch.W(), FieldMemOperand(key, Name::kHashFieldOffset));
__ TestAndBranchIfAllClear(hash_scratch, Name::kContainsCachedArrayIndexMask,
index_string);
// Is the string internalized? We know it's a string, so a single bit test is
// enough.
__ Ldrb(hash_scratch, FieldMemOperand(map_scratch, Map::kInstanceTypeOffset));
STATIC_ASSERT(kInternalizedTag == 0);
__ TestAndBranchIfAnySet(hash_scratch, kIsNotInternalizedMask, not_unique);
__ Bind(&unique);
// Fall through if the key is a unique name.
}
void LoadIC::GenerateNormal(MacroAssembler* masm, LanguageMode language_mode) {
Register dictionary = x0;
DCHECK(!dictionary.is(LoadDescriptor::ReceiverRegister()));
DCHECK(!dictionary.is(LoadDescriptor::NameRegister()));
Label slow;
__ Ldr(dictionary, FieldMemOperand(LoadDescriptor::ReceiverRegister(),
JSObject::kPropertiesOffset));
GenerateDictionaryLoad(masm, &slow, dictionary,
LoadDescriptor::NameRegister(), x0, x3, x4);
__ Ret();
// Dictionary load failed, go slow (but don't miss).
__ Bind(&slow);
GenerateRuntimeGetProperty(masm, language_mode);
}
void LoadIC::GenerateMiss(MacroAssembler* masm) {
// The return address is in lr.
Isolate* isolate = masm->isolate();
ASM_LOCATION("LoadIC::GenerateMiss");
DCHECK(!AreAliased(x4, x5, LoadWithVectorDescriptor::SlotRegister(),
LoadWithVectorDescriptor::VectorRegister()));
__ IncrementCounter(isolate->counters()->load_miss(), 1, x4, x5);
// Perform tail call to the entry.
__ Push(LoadWithVectorDescriptor::ReceiverRegister(),
LoadWithVectorDescriptor::NameRegister(),
LoadWithVectorDescriptor::SlotRegister(),
LoadWithVectorDescriptor::VectorRegister());
int arg_count = 4;
__ TailCallRuntime(Runtime::kLoadIC_Miss, arg_count, 1);
}
void LoadIC::GenerateRuntimeGetProperty(MacroAssembler* masm,
LanguageMode language_mode) {
// The return address is in lr.
__ Push(LoadDescriptor::ReceiverRegister(), LoadDescriptor::NameRegister());
// Do tail-call to runtime routine.
__ TailCallRuntime(is_strong(language_mode) ? Runtime::kGetPropertyStrong
: Runtime::kGetProperty,
2, 1);
}
void KeyedLoadIC::GenerateMiss(MacroAssembler* masm) {
// The return address is in lr.
Isolate* isolate = masm->isolate();
DCHECK(!AreAliased(x10, x11, LoadWithVectorDescriptor::SlotRegister(),
LoadWithVectorDescriptor::VectorRegister()));
__ IncrementCounter(isolate->counters()->keyed_load_miss(), 1, x10, x11);
__ Push(LoadWithVectorDescriptor::ReceiverRegister(),
LoadWithVectorDescriptor::NameRegister(),
LoadWithVectorDescriptor::SlotRegister(),
LoadWithVectorDescriptor::VectorRegister());
// Perform tail call to the entry.
int arg_count = 4;
__ TailCallRuntime(Runtime::kKeyedLoadIC_Miss, arg_count, 1);
}
void KeyedLoadIC::GenerateRuntimeGetProperty(MacroAssembler* masm,
LanguageMode language_mode) {
// The return address is in lr.
__ Push(LoadDescriptor::ReceiverRegister(), LoadDescriptor::NameRegister());
// Do tail-call to runtime routine.
__ TailCallRuntime(is_strong(language_mode) ? Runtime::kKeyedGetPropertyStrong
: Runtime::kKeyedGetProperty,
2, 1);
}
static void GenerateKeyedLoadWithSmiKey(MacroAssembler* masm, Register key,
Register receiver, Register scratch1,
Register scratch2, Register scratch3,
Register scratch4, Register scratch5,
Label* slow,
LanguageMode language_mode) {
DCHECK(!AreAliased(key, receiver, scratch1, scratch2, scratch3, scratch4,
scratch5));
Isolate* isolate = masm->isolate();
Label check_number_dictionary;
// If we can load the value, it should be returned in x0.
Register result = x0;
GenerateKeyedLoadReceiverCheck(masm, receiver, scratch1, scratch2,
Map::kHasIndexedInterceptor, slow);
// Check the receiver's map to see if it has fast elements.
__ CheckFastElements(scratch1, scratch2, &check_number_dictionary);
GenerateFastArrayLoad(masm, receiver, key, scratch3, scratch2, scratch1,
result, slow, language_mode);
__ IncrementCounter(isolate->counters()->keyed_load_generic_smi(), 1,
scratch1, scratch2);
__ Ret();
__ Bind(&check_number_dictionary);
__ Ldr(scratch3, FieldMemOperand(receiver, JSObject::kElementsOffset));
__ Ldr(scratch2, FieldMemOperand(scratch3, JSObject::kMapOffset));
// Check whether we have a number dictionary.
__ JumpIfNotRoot(scratch2, Heap::kHashTableMapRootIndex, slow);
__ LoadFromNumberDictionary(slow, scratch3, key, result, scratch1, scratch2,
scratch4, scratch5);
__ Ret();
}
static void GenerateKeyedLoadWithNameKey(MacroAssembler* masm, Register key,
Register receiver, Register scratch1,
Register scratch2, Register scratch3,
Register scratch4, Register scratch5,
Label* slow) {
DCHECK(!AreAliased(key, receiver, scratch1, scratch2, scratch3, scratch4,
scratch5));
Isolate* isolate = masm->isolate();
Label probe_dictionary, property_array_property;
// If we can load the value, it should be returned in x0.
Register result = x0;
GenerateKeyedLoadReceiverCheck(masm, receiver, scratch1, scratch2,
Map::kHasNamedInterceptor, slow);
// If the receiver is a fast-case object, check the stub cache. Otherwise
// probe the dictionary.
__ Ldr(scratch2, FieldMemOperand(receiver, JSObject::kPropertiesOffset));
__ Ldr(scratch3, FieldMemOperand(scratch2, HeapObject::kMapOffset));
__ JumpIfRoot(scratch3, Heap::kHashTableMapRootIndex, &probe_dictionary);
// The handlers in the stub cache expect a vector and slot. Since we won't
// change the IC from any downstream misses, a dummy vector can be used.
Register vector = LoadWithVectorDescriptor::VectorRegister();
Register slot = LoadWithVectorDescriptor::SlotRegister();
DCHECK(!AreAliased(vector, slot, scratch1, scratch2, scratch3, scratch4));
Handle<TypeFeedbackVector> dummy_vector =
TypeFeedbackVector::DummyVector(masm->isolate());
int slot_index = dummy_vector->GetIndex(
FeedbackVectorSlot(TypeFeedbackVector::kDummyKeyedLoadICSlot));
__ LoadRoot(vector, Heap::kDummyVectorRootIndex);
__ Mov(slot, Operand(Smi::FromInt(slot_index)));
Code::Flags flags = Code::RemoveTypeAndHolderFromFlags(
Code::ComputeHandlerFlags(Code::LOAD_IC));
masm->isolate()->stub_cache()->GenerateProbe(masm, Code::KEYED_LOAD_IC, flags,
receiver, key, scratch1,
scratch2, scratch3, scratch4);
// Cache miss.
KeyedLoadIC::GenerateMiss(masm);
// Do a quick inline probe of the receiver's dictionary, if it exists.
__ Bind(&probe_dictionary);
__ Ldr(scratch1, FieldMemOperand(receiver, HeapObject::kMapOffset));
__ Ldrb(scratch1, FieldMemOperand(scratch1, Map::kInstanceTypeOffset));
GenerateGlobalInstanceTypeCheck(masm, scratch1, slow);
// Load the property.
GenerateDictionaryLoad(masm, slow, scratch2, key, result, scratch1, scratch3);
__ IncrementCounter(isolate->counters()->keyed_load_generic_symbol(), 1,
scratch1, scratch2);
__ Ret();
}
void KeyedLoadIC::GenerateMegamorphic(MacroAssembler* masm,
LanguageMode language_mode) {
// The return address is in lr.
Label slow, check_name, index_smi, index_name;
Register key = LoadDescriptor::NameRegister();
Register receiver = LoadDescriptor::ReceiverRegister();
DCHECK(key.is(x2));
DCHECK(receiver.is(x1));
__ JumpIfNotSmi(key, &check_name);
__ Bind(&index_smi);
// Now the key is known to be a smi. This place is also jumped to from below
// where a numeric string is converted to a smi.
GenerateKeyedLoadWithSmiKey(masm, key, receiver, x7, x3, x4, x5, x6, &slow,
language_mode);
// Slow case.
__ Bind(&slow);
__ IncrementCounter(masm->isolate()->counters()->keyed_load_generic_slow(), 1,
x4, x3);
GenerateRuntimeGetProperty(masm, language_mode);
__ Bind(&check_name);
GenerateKeyNameCheck(masm, key, x0, x3, &index_name, &slow);
GenerateKeyedLoadWithNameKey(masm, key, receiver, x4, x5, x6, x7, x3, &slow);
__ Bind(&index_name);
__ IndexFromHash(x3, key);
// Now jump to the place where smi keys are handled.
__ B(&index_smi);
}
static void StoreIC_PushArgs(MacroAssembler* masm) {
if (FLAG_vector_stores) {
__ Push(StoreDescriptor::ReceiverRegister(),
StoreDescriptor::NameRegister(), StoreDescriptor::ValueRegister(),
VectorStoreICDescriptor::SlotRegister(),
VectorStoreICDescriptor::VectorRegister());
} else {
__ Push(StoreDescriptor::ReceiverRegister(),
StoreDescriptor::NameRegister(), StoreDescriptor::ValueRegister());
}
}
void KeyedStoreIC::GenerateMiss(MacroAssembler* masm) {
ASM_LOCATION("KeyedStoreIC::GenerateMiss");
StoreIC_PushArgs(masm);
int args = FLAG_vector_stores ? 5 : 3;
__ TailCallRuntime(Runtime::kKeyedStoreIC_Miss, args, 1);
}
static void KeyedStoreGenerateMegamorphicHelper(
MacroAssembler* masm, Label* fast_object, Label* fast_double, Label* slow,
KeyedStoreCheckMap check_map, KeyedStoreIncrementLength increment_length,
Register value, Register key, Register receiver, Register receiver_map,
Register elements_map, Register elements) {
DCHECK(!AreAliased(value, key, receiver, receiver_map, elements_map, elements,
x10, x11));
Label transition_smi_elements;
Label transition_double_elements;
Label fast_double_without_map_check;
Label non_double_value;
Label finish_store;
__ Bind(fast_object);
if (check_map == kCheckMap) {
__ Ldr(elements_map, FieldMemOperand(elements, HeapObject::kMapOffset));
__ Cmp(elements_map,
Operand(masm->isolate()->factory()->fixed_array_map()));
__ B(ne, fast_double);
}
// HOLECHECK: guards "A[i] = V"
// We have to go to the runtime if the current value is the hole because there
// may be a callback on the element.
Label holecheck_passed;
__ Add(x10, elements, FixedArray::kHeaderSize - kHeapObjectTag);
__ Add(x10, x10, Operand::UntagSmiAndScale(key, kPointerSizeLog2));
__ Ldr(x11, MemOperand(x10));
__ JumpIfNotRoot(x11, Heap::kTheHoleValueRootIndex, &holecheck_passed);
__ JumpIfDictionaryInPrototypeChain(receiver, elements_map, x10, slow);
__ bind(&holecheck_passed);
// Smi stores don't require further checks.
__ JumpIfSmi(value, &finish_store);
// Escape to elements kind transition case.
__ CheckFastObjectElements(receiver_map, x10, &transition_smi_elements);
__ Bind(&finish_store);
if (increment_length == kIncrementLength) {
// Add 1 to receiver->length.
__ Add(x10, key, Smi::FromInt(1));
__ Str(x10, FieldMemOperand(receiver, JSArray::kLengthOffset));
}
Register address = x11;
__ Add(address, elements, FixedArray::kHeaderSize - kHeapObjectTag);
__ Add(address, address, Operand::UntagSmiAndScale(key, kPointerSizeLog2));
__ Str(value, MemOperand(address));
Label dont_record_write;
__ JumpIfSmi(value, &dont_record_write);
// Update write barrier for the elements array address.
__ Mov(x10, value); // Preserve the value which is returned.
__ RecordWrite(elements, address, x10, kLRHasNotBeenSaved, kDontSaveFPRegs,
EMIT_REMEMBERED_SET, OMIT_SMI_CHECK);
__ Bind(&dont_record_write);
__ Ret();
__ Bind(fast_double);
if (check_map == kCheckMap) {
// Check for fast double array case. If this fails, call through to the
// runtime.
__ JumpIfNotRoot(elements_map, Heap::kFixedDoubleArrayMapRootIndex, slow);
}
// HOLECHECK: guards "A[i] double hole?"
// We have to see if the double version of the hole is present. If so go to
// the runtime.
__ Add(x10, elements, FixedDoubleArray::kHeaderSize - kHeapObjectTag);
__ Add(x10, x10, Operand::UntagSmiAndScale(key, kPointerSizeLog2));
__ Ldr(x11, MemOperand(x10));
__ CompareAndBranch(x11, kHoleNanInt64, ne, &fast_double_without_map_check);
__ JumpIfDictionaryInPrototypeChain(receiver, elements_map, x10, slow);
__ Bind(&fast_double_without_map_check);
__ StoreNumberToDoubleElements(value, key, elements, x10, d0,
&transition_double_elements);
if (increment_length == kIncrementLength) {
// Add 1 to receiver->length.
__ Add(x10, key, Smi::FromInt(1));
__ Str(x10, FieldMemOperand(receiver, JSArray::kLengthOffset));
}
__ Ret();
__ Bind(&transition_smi_elements);
// Transition the array appropriately depending on the value type.
__ Ldr(x10, FieldMemOperand(value, HeapObject::kMapOffset));
__ JumpIfNotRoot(x10, Heap::kHeapNumberMapRootIndex, &non_double_value);
// Value is a double. Transition FAST_SMI_ELEMENTS ->
// FAST_DOUBLE_ELEMENTS and complete the store.
__ LoadTransitionedArrayMapConditional(
FAST_SMI_ELEMENTS, FAST_DOUBLE_ELEMENTS, receiver_map, x10, x11, slow);
AllocationSiteMode mode =
AllocationSite::GetMode(FAST_SMI_ELEMENTS, FAST_DOUBLE_ELEMENTS);
ElementsTransitionGenerator::GenerateSmiToDouble(masm, receiver, key, value,
receiver_map, mode, slow);
__ Ldr(elements, FieldMemOperand(receiver, JSObject::kElementsOffset));
__ B(&fast_double_without_map_check);
__ Bind(&non_double_value);
// Value is not a double, FAST_SMI_ELEMENTS -> FAST_ELEMENTS.
__ LoadTransitionedArrayMapConditional(FAST_SMI_ELEMENTS, FAST_ELEMENTS,
receiver_map, x10, x11, slow);
mode = AllocationSite::GetMode(FAST_SMI_ELEMENTS, FAST_ELEMENTS);
ElementsTransitionGenerator::GenerateMapChangeElementsTransition(
masm, receiver, key, value, receiver_map, mode, slow);
__ Ldr(elements, FieldMemOperand(receiver, JSObject::kElementsOffset));
__ B(&finish_store);
__ Bind(&transition_double_elements);
// Elements are FAST_DOUBLE_ELEMENTS, but value is an Object that's not a
// HeapNumber. Make sure that the receiver is a Array with FAST_ELEMENTS and
// transition array from FAST_DOUBLE_ELEMENTS to FAST_ELEMENTS
__ LoadTransitionedArrayMapConditional(FAST_DOUBLE_ELEMENTS, FAST_ELEMENTS,
receiver_map, x10, x11, slow);
mode = AllocationSite::GetMode(FAST_DOUBLE_ELEMENTS, FAST_ELEMENTS);
ElementsTransitionGenerator::GenerateDoubleToObject(
masm, receiver, key, value, receiver_map, mode, slow);
__ Ldr(elements, FieldMemOperand(receiver, JSObject::kElementsOffset));
__ B(&finish_store);
}
void KeyedStoreIC::GenerateMegamorphic(MacroAssembler* masm,
LanguageMode language_mode) {
ASM_LOCATION("KeyedStoreIC::GenerateMegamorphic");
Label slow;
Label array;
Label fast_object;
Label extra;
Label fast_object_grow;
Label fast_double_grow;
Label fast_double;
Label maybe_name_key;
Label miss;
Register value = StoreDescriptor::ValueRegister();
Register key = StoreDescriptor::NameRegister();
Register receiver = StoreDescriptor::ReceiverRegister();
DCHECK(receiver.is(x1));
DCHECK(key.is(x2));
DCHECK(value.is(x0));
Register receiver_map = x3;
Register elements = x4;
Register elements_map = x5;
__ JumpIfNotSmi(key, &maybe_name_key);
__ JumpIfSmi(receiver, &slow);
__ Ldr(receiver_map, FieldMemOperand(receiver, HeapObject::kMapOffset));
// Check that the receiver does not require access checks and is not observed.
// The generic stub does not perform map checks or handle observed objects.
__ Ldrb(x10, FieldMemOperand(receiver_map, Map::kBitFieldOffset));
__ TestAndBranchIfAnySet(
x10, (1 << Map::kIsAccessCheckNeeded) | (1 << Map::kIsObserved), &slow);
// Check if the object is a JS array or not.
Register instance_type = x10;
__ CompareInstanceType(receiver_map, instance_type, JS_ARRAY_TYPE);
__ B(eq, &array);
// Check that the object is some kind of JS object EXCEPT JS Value type. In
// the case that the object is a value-wrapper object, we enter the runtime
// system to make sure that indexing into string objects works as intended.
STATIC_ASSERT(JS_VALUE_TYPE < JS_OBJECT_TYPE);
__ Cmp(instance_type, JS_OBJECT_TYPE);
__ B(lo, &slow);
// Object case: Check key against length in the elements array.
__ Ldr(elements, FieldMemOperand(receiver, JSObject::kElementsOffset));
// Check array bounds. Both the key and the length of FixedArray are smis.
__ Ldrsw(x10, UntagSmiFieldMemOperand(elements, FixedArray::kLengthOffset));
__ Cmp(x10, Operand::UntagSmi(key));
__ B(hi, &fast_object);
__ Bind(&slow);
// Slow case, handle jump to runtime.
// Live values:
// x0: value
// x1: key
// x2: receiver
PropertyICCompiler::GenerateRuntimeSetProperty(masm, language_mode);
// Never returns to here.
__ bind(&maybe_name_key);
__ Ldr(x10, FieldMemOperand(key, HeapObject::kMapOffset));
__ Ldrb(x10, FieldMemOperand(x10, Map::kInstanceTypeOffset));
__ JumpIfNotUniqueNameInstanceType(x10, &slow);
if (FLAG_vector_stores) {
// The handlers in the stub cache expect a vector and slot. Since we won't
// change the IC from any downstream misses, a dummy vector can be used.
Register vector = VectorStoreICDescriptor::VectorRegister();
Register slot = VectorStoreICDescriptor::SlotRegister();
DCHECK(!AreAliased(vector, slot, x5, x6, x7, x8));
Handle<TypeFeedbackVector> dummy_vector =
TypeFeedbackVector::DummyVector(masm->isolate());
int slot_index = dummy_vector->GetIndex(
FeedbackVectorSlot(TypeFeedbackVector::kDummyKeyedStoreICSlot));
__ LoadRoot(vector, Heap::kDummyVectorRootIndex);
__ Mov(slot, Operand(Smi::FromInt(slot_index)));
}
Code::Flags flags = Code::RemoveTypeAndHolderFromFlags(
Code::ComputeHandlerFlags(Code::STORE_IC));
masm->isolate()->stub_cache()->GenerateProbe(masm, Code::STORE_IC, flags,
receiver, key, x5, x6, x7, x8);
// Cache miss.
__ B(&miss);
__ Bind(&extra);
// Extra capacity case: Check if there is extra capacity to
// perform the store and update the length. Used for adding one
// element to the array by writing to array[array.length].
// Check for room in the elements backing store.
// Both the key and the length of FixedArray are smis.
__ Ldrsw(x10, UntagSmiFieldMemOperand(elements, FixedArray::kLengthOffset));
__ Cmp(x10, Operand::UntagSmi(key));
__ B(ls, &slow);
__ Ldr(elements_map, FieldMemOperand(elements, HeapObject::kMapOffset));
__ Cmp(elements_map, Operand(masm->isolate()->factory()->fixed_array_map()));
__ B(eq, &fast_object_grow);
__ Cmp(elements_map,
Operand(masm->isolate()->factory()->fixed_double_array_map()));
__ B(eq, &fast_double_grow);
__ B(&slow);
__ Bind(&array);
// Array case: Get the length and the elements array from the JS
// array. Check that the array is in fast mode (and writable); if it
// is the length is always a smi.
__ Ldr(elements, FieldMemOperand(receiver, JSObject::kElementsOffset));
// Check the key against the length in the array.
__ Ldrsw(x10, UntagSmiFieldMemOperand(receiver, JSArray::kLengthOffset));
__ Cmp(x10, Operand::UntagSmi(key));
__ B(eq, &extra); // We can handle the case where we are appending 1 element.
__ B(lo, &slow);
KeyedStoreGenerateMegamorphicHelper(
masm, &fast_object, &fast_double, &slow, kCheckMap, kDontIncrementLength,
value, key, receiver, receiver_map, elements_map, elements);
KeyedStoreGenerateMegamorphicHelper(masm, &fast_object_grow,
&fast_double_grow, &slow, kDontCheckMap,
kIncrementLength, value, key, receiver,
receiver_map, elements_map, elements);
__ bind(&miss);
GenerateMiss(masm);
}
void StoreIC::GenerateMegamorphic(MacroAssembler* masm) {
Register receiver = StoreDescriptor::ReceiverRegister();
Register name = StoreDescriptor::NameRegister();
DCHECK(!AreAliased(receiver, name, StoreDescriptor::ValueRegister(), x3, x4,
x5, x6));
// Probe the stub cache.
Code::Flags flags = Code::RemoveTypeAndHolderFromFlags(
Code::ComputeHandlerFlags(Code::STORE_IC));
masm->isolate()->stub_cache()->GenerateProbe(masm, Code::STORE_IC, flags,
receiver, name, x3, x4, x5, x6);
// Cache miss: Jump to runtime.
GenerateMiss(masm);
}
void StoreIC::GenerateMiss(MacroAssembler* masm) {
StoreIC_PushArgs(masm);
// Tail call to the entry.
int args = FLAG_vector_stores ? 5 : 3;
__ TailCallRuntime(Runtime::kStoreIC_Miss, args, 1);
}
void StoreIC::GenerateNormal(MacroAssembler* masm) {
Label miss;
Register value = StoreDescriptor::ValueRegister();
Register receiver = StoreDescriptor::ReceiverRegister();
Register name = StoreDescriptor::NameRegister();
Register dictionary = x5;
DCHECK(!AreAliased(value, receiver, name,
VectorStoreICDescriptor::SlotRegister(),
VectorStoreICDescriptor::VectorRegister(), x5, x6, x7));
__ Ldr(dictionary, FieldMemOperand(receiver, JSObject::kPropertiesOffset));
GenerateDictionaryStore(masm, &miss, dictionary, name, value, x6, x7);
Counters* counters = masm->isolate()->counters();
__ IncrementCounter(counters->store_normal_hit(), 1, x6, x7);
__ Ret();
// Cache miss: Jump to runtime.
__ Bind(&miss);
__ IncrementCounter(counters->store_normal_miss(), 1, x6, x7);
GenerateMiss(masm);
}
Condition CompareIC::ComputeCondition(Token::Value op) {
switch (op) {
case Token::EQ_STRICT:
case Token::EQ:
return eq;
case Token::LT:
return lt;
case Token::GT:
return gt;
case Token::LTE:
return le;
case Token::GTE:
return ge;
default:
UNREACHABLE();
return al;
}
}
bool CompareIC::HasInlinedSmiCode(Address address) {
// The address of the instruction following the call.
Address info_address = Assembler::return_address_from_call_start(address);
InstructionSequence* patch_info = InstructionSequence::At(info_address);
return patch_info->IsInlineData();
}
// Activate a SMI fast-path by patching the instructions generated by
// JumpPatchSite::EmitJumpIf(Not)Smi(), using the information encoded by
// JumpPatchSite::EmitPatchInfo().
void PatchInlinedSmiCode(Address address, InlinedSmiCheck check) {
// The patch information is encoded in the instruction stream using
// instructions which have no side effects, so we can safely execute them.
// The patch information is encoded directly after the call to the helper
// function which is requesting this patch operation.
Address info_address = Assembler::return_address_from_call_start(address);
InlineSmiCheckInfo info(info_address);
// Check and decode the patch information instruction.
if (!info.HasSmiCheck()) {
return;
}
if (FLAG_trace_ic) {
PrintF("[ Patching ic at %p, marker=%p, SMI check=%p\n", address,
info_address, reinterpret_cast<void*>(info.SmiCheck()));
}
// Patch and activate code generated by JumpPatchSite::EmitJumpIfNotSmi()
// and JumpPatchSite::EmitJumpIfSmi().
// Changing
// tb(n)z xzr, #0, <target>
// to
// tb(!n)z test_reg, #0, <target>
Instruction* to_patch = info.SmiCheck();
PatchingAssembler patcher(to_patch, 1);
DCHECK(to_patch->IsTestBranch());
DCHECK(to_patch->ImmTestBranchBit5() == 0);
DCHECK(to_patch->ImmTestBranchBit40() == 0);
STATIC_ASSERT(kSmiTag == 0);
STATIC_ASSERT(kSmiTagMask == 1);
int branch_imm = to_patch->ImmTestBranch();
Register smi_reg;
if (check == ENABLE_INLINED_SMI_CHECK) {
DCHECK(to_patch->Rt() == xzr.code());
smi_reg = info.SmiRegister();
} else {
DCHECK(check == DISABLE_INLINED_SMI_CHECK);
DCHECK(to_patch->Rt() != xzr.code());
smi_reg = xzr;
}
if (to_patch->Mask(TestBranchMask) == TBZ) {
// This is JumpIfNotSmi(smi_reg, branch_imm).
patcher.tbnz(smi_reg, 0, branch_imm);
} else {
DCHECK(to_patch->Mask(TestBranchMask) == TBNZ);
// This is JumpIfSmi(smi_reg, branch_imm).
patcher.tbz(smi_reg, 0, branch_imm);
}
}
} // namespace internal
} // namespace v8
#endif // V8_TARGET_ARCH_ARM64
``` |
Aidan O'Shea (born 29 June 1990) is a Gaelic footballer who plays for Breaffy and the Mayo county team. He is captain of the senior team at Breaffy.
Career
O'Shea made his debut for the Mayo seniors against New York in 2009 and since then has been one of Mayo's best players, winning an All-Star in 2013 and playing in midfield in two All-Ireland football finals, the 2012 decider, which Mayo lost by 0–13 to 2–11 against Donegal and the 2013 decider, which Mayo lost by 1–14 to 2–12 against Dublin. In 2013, his man-of-the-match display drove Mayo to a 16-point victory in a rematch against 2012 conquerors Donegal at the All-Ireland quarter-final stage. He was afterwards refused entry at one of Dublin's biggest nightclubs. He was awarded the GAA's Player of the Month for August 2013.
He played in the first Test for Ireland against Australia in the 2013 International Rules Series, but club commitments ruled him out of the second Test. He is suspected of being concussed up to seven times. In 2016 Mayo were denied another All-Ireland title by just one point to Dublin after a replay on 1 October. Coincidentally the following year Mayo lost again against Dublin in the 2017 All-Ireland Senior Football Championship Final by another one-point margin.
O'Shea has lost in a lot of All-Ireland finals along with Lee Keegan,2012,2013,2016, 2017, 2020, and 2021. Aidan enjoys playing the guitar and is fluent in several languages including French , Irish , Italian and Swedish .
Personal life
O'Shea had a relationship with Sarah Rowe, the ladies' Gaelic footballer.
Career statistics
Honours
Dublin Institute of Technology
Sigerson Cup: 2013
Mayo
Connacht Senior Football Championship: 2009, 2011, 2012, 2013, 2014, 2015, 2020 (c), 2021 (c)
National Football League: (2) 2019, 2023
Connacht Under-21 Football Championship: 2009
Connacht Minor Football Championship: 2009
FBD League: 2010, 2011, 2012, 2023
Ireland
International Rules Series: 2013, 2015
References
1990 births
Living people
Mayo inter-county Gaelic footballers
Irish international rules football players
People educated at St Gerald's College, Castlebar
Sportspeople from Mullingar |
Karthago can refer to:
Karthago (band), a Hungarian rock band.
Karthago (German band), a West Berlin–based rock band, pioneers of the Krautrock
Karthago (musical company), a Belgian musical company, located in Ghent.
Carthage, the city in Tunisia, North Africa.
Karthago Airlines, a Tunisian charter airline. |
Frederick VI (30 July 1769 – 2 April 1829) reigned as Landgrave of Hesse-Homburg from 1820 until his death in 1829.
Biography
Born in Homburg, Hesse, on 30 July 1769, Friedrich Joseph Ludwig Carl August was the eldest son of the incumbent Landgrave of Hesse-Homburg, Frederick V, and his wife Caroline of Hesse-Darmstadt, the eldest child of the then Landgrave of Hesse-Darmstadt, Louis IX.
Frederick was appointed a captain of the Russian cavalry in 1783 and was made an Austrian general during the Great French War. For his services in that conflict, he was created a Commander of the Austrian Military Order of Maria Theresa.
Despite the vocal objections of her mother, Charlotte of Mecklenburg-Strelitz, Frederick married Princess Elizabeth of the United Kingdom, the third daughter of King George III, in the Queen's House in the Mall (now integrated into Buckingham Palace) on 7 April 1818. It was no love match: Elizabeth longed to be free from her domineering mother at any cost, while Frederick needed her sizeable dowry to improve the Landgraviate's strained finances. As Elizabeth was over the age of 48 at the time of their marriage, this union produced no offspring.
Landgrave Frederick V died on 20 January 1820; Frederick succeeded him as monarch of the principality. The new Landgrave struggled to repay his father's exorbitant debts. Nine years into his reign, the Landgrave died of complications from a pre-existing leg wound. He was succeeded by his brother, Louis William.
Ancestry
References
Fraser, Flora: Princesses: The Six Daughters of George III, John Murray, 2004, London,
Citations
External links
1769 births
1829 deaths
Frederick VI
Austrian generals
Austrian Empire commanders of the Napoleonic Wars
Commanders Cross of the Military Order of Maria Theresa |
```smalltalk
using System;
using UnityEngine;
namespace Microsoft.MixedReality.Toolkit.Utilities.Gltf.Schema
{
/// <summary>
/// The material appearance of a primitive.
/// path_to_url
/// </summary>
[Serializable]
public class GltfMaterial : GltfChildOfRootProperty
{
/// <summary>
/// A set of parameter values that are used to define the metallic-roughness
/// material model from Physically-Based Rendering (PBR) methodology.
/// </summary>
public GltfPbrMetallicRoughness pbrMetallicRoughness;
/// <summary>
/// A set of parameter values used to light flat-shaded materials
/// </summary>
public GltfMaterialCommonConstant commonConstant;
/// <summary>
/// A tangent space normal map. Each texel represents the XYZ components of a
/// normal vector in tangent space.
/// </summary>
public GltfNormalTextureInfo normalTexture;
/// <summary>
/// The occlusion map is a greyscale texture, with white indicating areas that
/// should receive full indirect lighting and black indicating no indirect
/// lighting.
/// </summary>
public GltfOcclusionTextureInfo occlusionTexture;
/// <summary>
/// The emissive map controls the color and intensity of the light being emitted
/// by the material. This texture contains RGB components in sRGB color space.
/// If a fourth component (A) is present, it is ignored.
/// </summary>
public GltfTextureInfo emissiveTexture;
/// <summary>
/// The RGB components of the emissive color of the material.
/// If an emissiveTexture is specified, this value is multiplied with the texel
/// values.
/// <items>
/// <minimum>0.0</minimum>
/// <maximum>1.0</maximum>
/// </items>
/// <minItems>3</minItems>
/// <maxItems>3</maxItems>
/// </summary>
public float[] emissiveFactor = { 0f, 0f, 0f, 0f };
/// <summary>
/// The material's alpha rendering mode enumeration specifying the interpretation of the
/// alpha value of the main factor and texture. In `OPAQUE` mode, the alpha value is
/// ignored and the rendered output is fully opaque. In `MASK` mode, the rendered output
/// is either fully opaque or fully transparent depending on the alpha value and the
/// specified alpha cutoff value. In `BLEND` mode, the alpha value is used to composite
/// the source and destination areas. The rendered output is combined with the background
/// using the normal painting operation (i.e. the Porter and Duff over operator).
/// </summary>
public string alphaMode;
/// <summary>
/// Specifies the cutoff threshold when in `MASK` mode. If the alpha value is greater than
/// or equal to this value then it is rendered as fully opaque, otherwise, it is rendered
/// as fully transparent. This value is ignored for other modes.
/// </summary>
public double alphaCutoff = 0.5f;
/// <summary>
/// Specifies whether the material is double sided. When this value is false, back-face
/// culling is enabled. When this value is true, back-face culling is disabled and double
/// sided lighting is enabled. The back-face must have its normals reversed before the
/// lighting equation is evaluated.
/// </summary>
public bool doubleSided;
/// <summary>
/// Unity Material wrapper for the GltfMaterial
/// </summary>
public Material Material { get; internal set; }
}
}
``` |
```haskell
{-# LANGUAGE AllowAmbiguousTypes #-}
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE DeriveAnyClass #-}
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE DerivingStrategies #-}
{-# LANGUAGE DuplicateRecordFields #-}
{-# LANGUAGE LambdaCase #-}
{-# LANGUAGE NamedFieldPuns #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE PolyKinds #-}
{-# LANGUAGE RecordWildCards #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE UndecidableInstances #-}
module PlutusTx.Blueprint.Schema where
import Control.Lens.Plated (Plated)
import Data.Aeson (ToJSON (..), (.=))
import Data.Aeson qualified as Aeson
import Data.Aeson.Extra (optionalField, requiredField)
import Data.Aeson.KeyMap qualified as KeyMap
import Data.ByteString (ByteString)
import Data.ByteString.Base16 qualified as Base16
import Data.Data (Data, Typeable)
import Data.Function ((&))
import Data.Kind (Type)
import Data.List.NonEmpty (NonEmpty, nonEmpty)
import Data.Text (Text)
import Data.Text.Encoding qualified as Text
import GHC.Generics (Generic)
import Numeric.Natural (Natural)
import PlutusTx.Blueprint.Definition.Id (DefinitionId, definitionIdToText)
import PlutusTx.Blueprint.Schema.Annotation (SchemaInfo, comment, description, title)
import Prelude hiding (max, maximum, min, minimum)
{- | Blueprint schema definition, as defined by the CIP-0057:
path_to_url#core-vocabulary
The 'referencedTypes' phantom type parameter is used to track the types used in the contract
making sure their schemas are included in the blueprint and that they are referenced
in a type-safe way.
-}
data Schema (referencedTypes :: [Type])
= SchemaInteger SchemaInfo IntegerSchema
| SchemaBytes SchemaInfo BytesSchema
| SchemaList SchemaInfo (ListSchema referencedTypes)
| SchemaMap SchemaInfo (MapSchema referencedTypes)
| SchemaConstructor SchemaInfo (ConstructorSchema referencedTypes)
| SchemaBuiltInData SchemaInfo
| SchemaBuiltInUnit SchemaInfo
| SchemaBuiltInBoolean SchemaInfo
| SchemaBuiltInInteger SchemaInfo
| SchemaBuiltInBytes SchemaInfo
| SchemaBuiltInString SchemaInfo
| SchemaBuiltInPair SchemaInfo (PairSchema referencedTypes)
| SchemaBuiltInList SchemaInfo (Schema referencedTypes)
| SchemaOneOf (NonEmpty (Schema referencedTypes))
| SchemaAnyOf (NonEmpty (Schema referencedTypes))
| SchemaAllOf (NonEmpty (Schema referencedTypes))
| SchemaNot (Schema referencedTypes)
| SchemaDefinitionRef DefinitionId
deriving stock (Eq, Ord, Show, Generic, Data)
deriving anyclass instance (Typeable referencedTypes) => Plated (Schema referencedTypes)
instance ToJSON (Schema referencedTypes) where
toJSON = \case
SchemaInteger info MkIntegerSchema{..} ->
dataType info "integer"
& optionalField "multipleOf" multipleOf
& optionalField "minimum" minimum
& optionalField "maximum" maximum
& optionalField "exclusiveMinimum" exclusiveMinimum
& optionalField "exclusiveMaximum" exclusiveMaximum
& Aeson.Object
SchemaBytes info MkBytesSchema{..} ->
dataType info "bytes"
& optionalField "enum" (fmap toHex <$> nonEmpty enum)
& optionalField "maxLength" maxLength
& optionalField "minLength" minLength
& Aeson.Object
where
toHex :: ByteString -> Text
toHex = Text.decodeUtf8 . Base16.encode
SchemaList info MkListSchema{..} ->
dataType info "list"
& requiredField "items" itemSchema
& optionalField "minItems" minItems
& optionalField "maxItems" maxItems
& optionalField "uniqueItems" uniqueItems
& Aeson.Object
SchemaMap info MkMapSchema{..} ->
dataType info "map"
& requiredField "keys" keySchema
& requiredField "values" valueSchema
& optionalField "minItems" minItems
& optionalField "maxItems" maxItems
& Aeson.Object
SchemaConstructor info MkConstructorSchema{..} ->
dataType info "constructor"
& requiredField "index" index
& requiredField "fields" fieldSchemas
& Aeson.Object
SchemaBuiltInData info ->
Aeson.Object $ infoFields info
SchemaBuiltInUnit info ->
Aeson.Object $ dataType info "#unit"
SchemaBuiltInBoolean info ->
Aeson.Object $ dataType info "#boolean"
SchemaBuiltInInteger info ->
Aeson.Object $ dataType info "#integer"
SchemaBuiltInBytes info ->
Aeson.Object $ dataType info "#bytes"
SchemaBuiltInString info ->
Aeson.Object $ dataType info "#string"
SchemaBuiltInPair info MkPairSchema{left, right} ->
dataType info "#pair"
& requiredField "left" left
& requiredField "right" right
& Aeson.Object
SchemaBuiltInList info schema ->
dataType info "#list"
& requiredField "items" schema
& Aeson.Object
SchemaOneOf schemas ->
Aeson.object ["oneOf" .= schemas]
SchemaAnyOf schemas ->
Aeson.object ["anyOf" .= schemas]
SchemaAllOf schemas ->
Aeson.object ["allOf" .= schemas]
SchemaNot schema ->
Aeson.object ["not" .= schema]
SchemaDefinitionRef definitionId ->
Aeson.object ["$ref" .= ("#/definitions/" <> definitionIdToText definitionId)]
where
dataType :: SchemaInfo -> String -> Aeson.Object
dataType info ty = requiredField "dataType" ty (infoFields info)
infoFields :: SchemaInfo -> Aeson.Object
infoFields info =
KeyMap.empty
& optionalField "title" (title info)
& optionalField "description" (description info)
& optionalField "$comment" (comment info)
data IntegerSchema = MkIntegerSchema
{ multipleOf :: Maybe Integer
-- ^ An instance is valid if division by this value results in an integer.
, minimum :: Maybe Integer
-- ^ An instance is valid only if it is greater than or exactly equal to "minimum".
, maximum :: Maybe Integer
-- ^ An instance is valid only if it is less than or exactly equal to "maximum".
, exclusiveMinimum :: Maybe Integer
-- ^ An instance is valid only if it is strictly greater than "exclusiveMinimum".
, exclusiveMaximum :: Maybe Integer
-- ^ An instance is valid only if it is strictly less than "exclusiveMaximum".
}
deriving stock (Eq, Ord, Show, Generic, Data)
emptyIntegerSchema :: IntegerSchema
emptyIntegerSchema =
MkIntegerSchema
{ multipleOf = Nothing
, minimum = Nothing
, maximum = Nothing
, exclusiveMinimum = Nothing
, exclusiveMaximum = Nothing
}
data BytesSchema = MkBytesSchema
{ enum :: [ByteString]
-- ^ An instance validates successfully if once hex-encoded,
-- its value matches one of the specified values.
, minLength :: Maybe Natural
-- ^ An instance is valid if its length is greater than, or equal to, this value.
, maxLength :: Maybe Natural
-- ^ An instance is valid if its length is less than, or equal to, this value.
}
deriving stock (Eq, Ord, Show, Generic, Data)
emptyBytesSchema :: BytesSchema
emptyBytesSchema = MkBytesSchema{enum = [], minLength = Nothing, maxLength = Nothing}
data ListSchema (referencedTypes :: [Type]) = MkListSchema
{ itemSchema :: Schema referencedTypes
-- ^ Element schema
, minItems :: Maybe Natural
-- ^ An array instance is valid if its size is greater than, or equal to, this value.
, maxItems :: Maybe Natural
-- ^ An array instance is valid if its size is less than, or equal to, this value.
, uniqueItems :: Maybe Bool
-- ^ If this value is false, the instance validates successfully.
-- If it is set to True, the instance validates successfully if all of its elements are unique.
}
deriving stock (Eq, Ord, Show, Generic, Data)
mkListSchema :: Schema referencedTypes -> ListSchema referencedTypes
mkListSchema itemSchema =
MkListSchema
{ itemSchema
, minItems = Nothing
, maxItems = Nothing
, uniqueItems = Nothing
}
data MapSchema (referencedTypes :: [Type]) = MkMapSchema
{ keySchema :: Schema referencedTypes
-- ^ Key schema
, valueSchema :: Schema referencedTypes
-- ^ Value schema
, minItems :: Maybe Natural
-- ^ A map instance is valid if its size is greater than, or equal to, this value.
, maxItems :: Maybe Natural
-- ^ A map instance is valid if its size is less than, or equal to, this value.
}
deriving stock (Eq, Ord, Show, Generic, Data)
data ConstructorSchema (referencedTypes :: [Type]) = MkConstructorSchema
{ index :: Natural
-- ^ Constructor index
, fieldSchemas :: [Schema referencedTypes]
-- ^ Field schemas
}
deriving stock (Eq, Ord, Show, Generic, Data)
data PairSchema (referencedTypes :: [Type]) = MkPairSchema
{ left :: Schema referencedTypes
-- ^ Schema of the first element
, right :: Schema referencedTypes
-- ^ Schema of the second element
}
deriving stock (Eq, Ord, Show, Generic, Data)
``` |
Theodore Roosevelt "Double Duty" Radcliffe (July 7, 1902 – August 11, 2005) was a professional baseball player in the Negro leagues. An accomplished two-way player, he played as a pitcher and a catcher, became a manager, and in his old age became a popular ambassador for the game. He is one of only a handful of professional baseball players who lived past their 100th birthdays, next to Red Hoff (who lived to 107) and fellow Negro leaguer Silas Simmons (who lived to age 103).
Newspaperman Damon Runyon coined the nickname "Double Duty" because Radcliffe played as a catcher and as a pitcher in the successive games of a 1932 doubleheader between the Pittsburgh Crawfords and the New York Black Yankees. In the first of the two games at Yankee Stadium, Radcliffe caught the pitcher Satchel Paige for a shutout and then pitched a shutout in the second game. Runyon wrote that Radcliffe "was worth the price of two admissions." Radcliffe considered his year with the 1932 Pittsburgh Crawfords to be one of the highlights of his career.
Of the six East–West All-Star Games in which he played, Radcliffe pitched in three and was a catcher in three. He also pitched in two and caught in six other All-Star games. He hit .376 (11-for-29) in nine exhibition games against major leaguers.
Career
Early life
Ted Radcliffe grew up in Mobile, Alabama as one of ten children. His brother Alex Radcliffe also achieved renown as a ballplayer playing third base. The boys played baseball using a taped ball of rags with their friends including future Negro league All-Star ballplayers Leroy "Satchel" Paige and Bobby Robinson.
In 1919, teenagers Ted and Alex hitchhiked north to Chicago to join an older brother. The rest of the family soon followed to live on the South Side of Chicago. A year later Ted Radcliffe signed on with the semi-pro Illinois Giants at $50 for every 15 games and 50¢ a day for meal money. This worked out at about $100 a month. He travelled with the Giants for a few seasons before joining Gilkerson's Union Giants, another semi-pro team with whom he played until he entered the Negro National League with the Detroit Stars in 1928.
Pro ball
After a brief tenure with the Detroit Stars, Radcliffe played for the St. Louis Stars (1930), Homestead Grays (1931), Pittsburgh Crawfords (1932), Columbus Blue Birds (1933), New York Black Yankees, Brooklyn Eagles, Cincinnati Tigers, Memphis Red Sox, Birmingham Black Barons, Chicago American Giants, Louisville Buckeyes and Kansas City Monarchs. Ted Radcliffe managed the Cincinnati Tigers in 1937, Memphis Red Sox in 1938 and Chicago American Giants in 1943.
Radcliffe was known as a glib, fast-talking player. Ty Cobb reported that Radcliffe wore a chest protector that said "thou shalt not steal" during one exhibition game. He could call a clever game as a catcher and his banter from the pitching mound distracted some hitters. Biographer Kyle P. McNary estimates that Radcliffe had a .303 batting average, 4,000 hits and 400 homers in 36 years in the game (see Baseball statistics).
Standing 5 ft 9 in and weighing 210 pounds (95 kg) Radcliffe had a strong throwing arm, good catching reflexes and great cunning. Even with these strengths, he also mastered many illegal pitches including the emery ball, the cut ball and the spitter. Statistics for the Negro league baseball are incomplete, but available records show him hitting .273 over eight of his 23 seasons.
With the Detroit Stars, he was the regular catcher for the first half of the season. When the pitching staff grew tired, he began pitching and led the team to championship. His career high for batting average was .316 for the 1929 Detroit Stars.
Radcliffe believed the Homestead Grays 1931 team to be the greatest team of all time. The side included Josh Gibson, Oscar Charleston, Jud Wilson, and Smokey Joe Williams. Gibson and Charleston joined him in the 1932 Pittsburgh Crawfords. Radcliffe and his close friend Satchel Paige were easily persuaded to change sides by offers of higher earnings and both moved frequently. They also formed several Negro league all-star teams to play exhibition games against white major league stars. By the end of his career Radcliffe had played for 30 different teams; in one season alone, he played on five different teams.
Radcliffe was player-manager of the integrated Jamestown Red Sox of North Dakota from May to October 1934. This made him the first black man to manage white professional players. He also played for the Chicago American Giants in that season. During that postseason, he managed a white semi-pro North Dakota team that toured Canada playing a major league all-star team gathered by Jimmie Foxx. Radcliffe's team won two games out of three before Foxx was hit on the head by a Chet Brewer pitch and the tour cancelled.
In the next season, Radcliffe had trouble securing his release from the Brooklyn Eagles of the Negro leagues, but on June 21 he joined the integrated Bismarck Churchills. Along with Satchel Paige, Moose Johnson, and others, Radcliffe helped to lead the club to the first National Semipro Championship. This North Dakota team was owned by Neil Churchill, a car dealer. Other Negro leaguers on the team included Chet Brewer, Hilton Smith, Barney Morris and Quincy Trouppe.
Radcliffe managed the Memphis Red Sox in 1937 as well as catching and pitching for them. He stayed there for 1938 and in 1943, aged 41, he rejoined the Chicago American Giants. Despite his age, Radcliffe won the Negro American League MVP award that season and a year later he struck a home run into the upper deck of Comiskey Park for the highlight of that season's East-West All-Star game.
In 1945 Radcliffe played for the Kansas City Monarchs and roomed with Jackie Robinson. He integrated two semipro leagues, the Southern Minny (Minnesota) and the Michigan-Indiana League in 1948, by signing black and white players. In 1950 Radcliffe managed the Chicago American Giants of the Negro American League. The team's owner, Dr. J. B. Martin, was concerned about black players joining Major League teams; he instructed Radcliffe to sign white players. Radcliffe recruited at least five young white players, including Lou Chirban and Lou Clarizio.
As player-manager with the Elmwood Giants in the Manitoba-Dakota League in 1951, Radcliffe batted .459 with a 3–0 pitching record; in 1952, at the age of 50, he batted .364 with a 1–0 pitching mark. A 1952 Pittsburgh Courier poll of Negro league experts named Double Duty the fifth greatest catcher in Negro league history and the 17th greatest pitcher. He retired two years later as a player-manager in Winnipeg, Manitoba, Canada. His peak earnings had been $850 a month; the top rate for a major league player of the time was $10,000, paid monthly to Hank Greenberg in 1947.
In the 1960s, Radcliffe was employed as a baseball scout including for a time with the Cleveland Indians.
Segregation
Throughout his career, Double Duty had to endure racial segregation. In every city except Saint Paul, Minnesota, he and his colleagues had to stay in segregated hotels and eat in segregated restaurants. It was difficult to get cabs at night. He also faced racist hostility from players and has said that, among others, "Ty Cobb didn't like colored people". Radcliffe also recalled stopping the team car to buy gas in Waycross, Georgia. When the players tried to drink water from the car wash hose, the owner of the gas station told them, "Put that hose down—that's for white folks to drink." Radcliffe told a Boston Globe interviewer: "After that, I refused to buy gas from him. About four miles down the road, the gas ran out and we had to push the car five miles."
Retirement
After leaving baseball, Radcliffe and his wife returned to a life of poverty until 1990, when they were robbed and beaten in their housing project on Chicago's South Side. A news report of this came to the attention of the Baseball Assistance Team, a charity that helps needy ex-players. With the help of the mayor's office, the team helped the couple move into a church-run residence for the elderly.
Writer Kyle McNary met Radcliffe in 1992 when he was trying to learn more about black baseball in his home town of Bismarck, North Dakota. Radcliffe subsequently suggested that McNary should write his biography and the result was self-published by McNary in 1994. Radcliffe would travel widely to ballgames and became known for his lively good humor and gentle clowning.
Despite two strokes and other age-related health problems, Radcliffe continued to be active in his community. He received the state of Illinois Historical Committee's Lifetime Achievement Award and was honored by Mayor Richard Daley as an outstanding citizen of Chicago. He has been the guest of three U.S. Presidents at the White House. A WGN documentary about Radcliffe's life, narrated by Morgan Freeman, won an Emmy Award. The Illinois Department of Aging inducted him into their Hall of Fame in 2002.
In 1997, Radcliffe was inducted into the "Yesterday's Negro League Baseball Players Wall of Fame" at County Stadium in Milwaukee. In 1999, aged 96, he became the oldest player to appear in a professional game; he threw a single pitch for the Schaumburg Flyers of the Northern League. After his 100th birthday, Double Duty celebrated each year by throwing a ceremonial first pitch for the Chicago White Sox at U.S. Cellular Field. On July 27, 2005, he threw the first pitch at Rickwood Field, Birmingham, Alabama. Two weeks later, Radcliffe died in Chicago on August 11, 2005, due to complications from cancer.
Radcliffe's stories were entertaining but not always reliable. His claim to have seen Fidel Castro with a cigar at a winter game in Cuba and his observation that the man "couldn't play" seems unlikely given that Castro would have been just 14 at the time.
Raelee Frazier cast Ted Radcliffe's twisted broken hands in bronze as part of the 2003 Hitters Hands series of baseball sculptures that toured the United States in Shades of Greatness, an exhibition sponsored by the Negro Leagues Baseball Museum.
Bibliography
'Ted "Double Duty" Radcliffe', Jet, July 22, 1996
'Still Loving Baseball At 100', Jet, (June 9, 2003)
'Honoring Legends', Jet, July 28, 2003
'Celebrating 102!', Jet, July 26, 2004
[http://www.state.il.us/aging/2awareness/awareness_hall2002.htm#theodore '2002 Hall of Fame Inductees', Illinois Department of Aging (2002)]. Retrieved July 24, 2005.
'"Double Duty" Knows Baseball' Los Angeles Times, June 20, 2003.
'Ted "Double Duty" Radcliffe', Negro League Baseball Players Association (2005)
'Exciting to watch, Ted "Double Duty" Radcliffe', The African America Registry (2005)
'Ted Radcliffe Biography', The History Makers (2005)
'Double-Duty to throw out first pitch', Birmingham News, July 22, 2005. Retrieved July 24, 2005.
Blake, Mike. Baseball Chronicles, (Cincinnati, Oh: Betterway Books, 1994)
Bogira, Steve. 'Blackball: Memories of the Negro Leagues and Notes On the Integration, To Use the Term Loosely, of Major League Baseball', City Paper (Washington (DC)), July 24, 1987 (Vol. 7, Issue 30) pp. 12–24
Floto, James. 'Ted "Double Duty" Radcliffe: 36 Years of Pitching & Catching in Baseball's Negro Leagues', The Diamond Angle (October 2001)
Gadfly. 'Hall of Merit discussion: Ted Radcliffe', Baseball Think Factory (May 2005) Retrieved July 25, 2005
Goldstein, Richard. 'Ted Radcliffe, Star of the Negro Leagues, Is Dead at 103', The New York Times (August 12, 2005)
Hershberger, Chuck. 'Baseball Book Review', Oldtyme Baseball News 1995 (Vol. 6, Issue 5) p. 28
Holway, John B. Voices From The Great Black Baseball Leagues (New York: Dodd, Mead & Co., 1975) (Revised Edition published New York: Da Capo Press, 1992)
Larry Lester, Sammy J. Miller and Dick Clark, Black Baseball in Chicago, (Mount Pleasant, South Carolina: Arcadia Publishing, 2000)
Ted Radcliffe - Baseballbiography.com
McNary, Kyle P. Ted "Double Duty" Radcliffe: 36 Years Of Pitching & Catching In Baseball's Negro Leagues (Minneapolis: McNary Publishing, 1994)
McNary, Kyle P. 'North Dakota Whips Big Leagues', Pitch Black Baseball (2001) Retrieved July 25, 2005.
McNary, Kyle P. 'Ted "Double Duty" Radcliffe', Simply Baseball Notebook: Legends (March 2002)
McNary, Kyle P. 'Negro Leaguer of the Month, July, 2004', Pitch Black Baseball (July 2004)
Peterson, Robert W. Only The Ball Was White, (New York: Prentice-Hall Englewood-Cliffs, 1970)
Sepulveda, Lefty. 'Grateful Memories of Ted "Double Duty" Radcliffe', Baseball Library (August 2, 2002)
Smith, Shelley. 'Remembering Their Game', Sports Illustrated, July 6, 1992 (Vol. 77, Issue 1) p. 80
Smith, Wendell. 'East-West Star Dust', Pittsburgh Courier, August 19, 1944
Steele, David. 'Negro Leaguers Seek Entry Into Hall', USA Today Baseball Weekly'', August 16, 1991 (Vol. 1, Issue 20) p. 17
References
External links
and Baseball-Reference Black Baseball and stats and Seamheads
Ted Radcliffe - Baseballbiography.com
Ted Radcliffe at SABR (Baseball BioProject)
1902 births
2005 deaths
African-American baseball players
African-American centenarians
American centenarians
American expatriate baseball players in Mexico
Azules de Veracruz players
Birmingham Black Barons players
Bismarck Churchills players
Brooklyn Eagles players
Chicago American Giants players
Cincinnati Tigers (baseball) players
Columbus Blue Birds players
Deaths from cancer in Illinois
Detroit Stars players
Elmwood Giants players
Homestead Grays players
Kansas City Monarchs players
Louisville Buckeyes players
Memphis Red Sox players
Men centenarians
Mexican League baseball players
Negro league baseball managers
New York Black Yankees players
Pittsburgh Crawfords players
St. Louis Stars (baseball) players
Baseball players from Mobile, Alabama
20th-century African-American sportspeople
21st-century African-American people |
Minuscule 519 (in the Gregory-Aland numbering), ε 343 (in the Soden numbering), is a Greek minuscule manuscript of the New Testament, on parchment. Palaeographically it has been assigned to the 13th century.
Scrivener labelled it by number 505. The manuscript is lacunose.
Description
The codex contains the complete text of the four Gospels on 308 parchment leaves (size ) with only one lacuna (Matthew 16:2-17). The text is written in one column per page, 17-24 lines per page.
The text is divided according to the (chapters), whose numbers are given at the margin, and some (titles of chapters) at the top of the pages. The is no another division according to the Ammonian Sections with references to the Eusebian Canons.
It contains prolegomena, the tables of the (tables of contents) before each Gospel, subscriptions at the end of each Gospel, and numbered .
Text
The Greek text of the codex is a representative of the Byzantine text-type. Hermann von Soden included it to the Kx group. Aland placed it in Category V.
According to the Claremont Profile Method it represents Kx in Luke 1 and Luke 20. In Luke 10 no profile was made.
History
The manuscript was written by several hands. In 1727 the manuscript came from Constantinople to England and was presented to archbishop of Canterbury, William Wake, together with the manuscripts 73, 74, 506-520. Wake presented it to the Christ Church College in Oxford.
The manuscript was added to the list of New Testament minuscule manuscripts by F. H. A. Scrivener (505) and C. R. Gregory (519). Gregory saw it in 1883.
It is currently housed at the Christ Church (Wake 39) in Oxford.
See also
List of New Testament minuscules
Biblical manuscript
Textual criticism
References
Further reading
External links
Greek New Testament minuscules
13th-century biblical manuscripts |
Nancie Ellen Caraway (born February 2, 1942) is the former First Lady of the U.S. state of Hawaii from 2010 to 2014. She is the spouse of former First Congressional District U.S. Representative and former Governor of Hawaii Neil Abercrombie. Caraway is a University of Hawaiʻi at Mānoa political scientist, feminist scholar and activist, a member of the university's Globalization Research Center and its Director of Women's Human Rights, leading its Trafficking Project. She is also a mentor and lecturer at the East–West Center.
Caraway was born in Alabama and arrived in Hawaii from Houston, Texas. She received her bachelor of arts degree in political science at the University of Hawaiʻi at Mānoa in 1980. She was a resident of New York City while studying for her Master of Science degree in journalism at Columbia University. She married her husband, Neil Abercrombie, in 1981 in Palm Springs, California. She returned to Hawaii and completed a master of arts in 1986 and doctorate in 1991, both in political science.
Following her husband to Washington, D.C. where he served in the United States Congress, Caraway became an assistant professor at Georgetown University, George Washington University and American University.
An author, Caraway won the Victoria Schuck Award—an international award for the best book on women and politics—from the American Political Science Association for her 1992 book, Segregated Sisterhood: Racism and the Politics of American Feminism, also the title of her University of Hawaiʻi at Mānoa at doctoral dissertation.
Further reading
References
1942 births
Living people
21st-century American women
American women political scientists
American political scientists
First ladies and gentlemen of Hawaii
University of Hawaiʻi at Mānoa alumni
University of Hawaiʻi at Mānoa faculty
American feminist writers
Columbia University Graduate School of Journalism alumni
American women academics |
```java
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package org.flowable.engine.delegate;
import java.util.concurrent.CompletableFuture;
import org.flowable.common.engine.api.async.AsyncTaskInvoker;
/**
* Convenience class which always uses the {@link AsyncTaskInvoker} to execute the async data.
* Provides intermediate methods to prepare the execution data before executing and do the
* actual execution without the need to work with futures.
*
* @param <Input> the input of the execution
* @param <Output> the output of the execution
* @author Filip Hrisafov
* @see MapBasedFlowableFutureJavaDelegate
* @see FutureJavaDelegate
*/
public interface FlowableFutureJavaDelegate<Input, Output> extends FutureJavaDelegate<Output> {
@Override
default CompletableFuture<Output> execute(DelegateExecution execution, AsyncTaskInvoker taskInvoker) {
Input inputData = prepareExecutionData(execution);
return taskInvoker.submit(() -> execute(inputData));
}
/**
* Method invoked before doing the execution to extract needed that from the execution
* on the main thread.
* This should be used to prepare and extract data from the execution before doing the execution in a different thread.
*
* @param execution the execution from which to extract data
* @return the data for the delegate
*/
Input prepareExecutionData(DelegateExecution execution);
/**
* Perform the actual execution of the delegate in another thread.
* This uses {@link #prepareExecutionData(DelegateExecution)} to get the needed data
* from the {@link DelegateExecution} and returns the output data that can is passed to {@link #afterExecution(DelegateExecution, Object)}.
*
* <b>IMPORTANT:</b> This is a completely new thread which does not participate in the transaction of the process.
*
* @param inputData the input data for the execution created via {@link #prepareExecutionData(DelegateExecution)}
* @return the output data of the execution
* @see #execute(DelegateExecution, AsyncTaskInvoker)
*/
Output execute(Input inputData);
/**
* Method invoked with the result from {@link #execute(Object)}.
* This should be used to set data on the {@link DelegateExecution}.
* This is on the same thread as {@link #prepareExecutionData(DelegateExecution)} and participates in the process transaction.
*
* @param execution the execution to which data can be set
* @param executionData the execution data
*/
@Override
void afterExecution(DelegateExecution execution, Output executionData);
}
``` |
```scala
/*
*/
package akka.stream.alpakka.googlecloud.bigquery.scaladsl.spray
import akka.util.ByteString
import spray.json.{deserializationError, JsBoolean, JsFalse, JsNumber, JsString, JsTrue, JsValue}
/**
* Provides the BigQueryJsonFormats for BigQuery table cells of the most important Scala types.
*/
trait BigQueryBasicFormats {
implicit object IntJsonFormat extends BigQueryJsonFormat[Int] {
def write(x: Int) = JsNumber(x)
def read(value: JsValue) = value match {
case JsNumber(x) if x.isValidInt => x.intValue
case BigQueryNumber(x) if x.isValidInt => x.intValue
case x => deserializationError("Expected Int as JsNumber or JsString, but got " + x)
}
}
implicit object LongJsonFormat extends BigQueryJsonFormat[Long] {
def write(x: Long) =
if (-9007199254740991L <= x & x <= 9007199254740991L)
JsNumber(x)
else
JsString(x.toString)
def read(value: JsValue) = value match {
case JsNumber(x) if x.isValidLong => x.longValue
case BigQueryNumber(x) if x.isValidLong => x.longValue
case x => deserializationError("Expected Long as JsNumber or JsString, but got " + x)
}
}
implicit object FloatJsonFormat extends BigQueryJsonFormat[Float] {
def write(x: Float) = JsNumber(x)
def read(value: JsValue) = value match {
case JsNumber(x) => x.floatValue
case BigQueryNumber(x) => x.floatValue
case x => deserializationError("Expected Float as JsNumber or JsString, but got " + x)
}
}
implicit object DoubleJsonFormat extends BigQueryJsonFormat[Double] {
def write(x: Double) = JsNumber(x)
def read(value: JsValue) = value match {
case JsNumber(x) => x.doubleValue
case BigQueryNumber(x) => x.doubleValue
case x => deserializationError("Expected Double as JsNumber or JsString, but got " + x)
}
}
implicit object ByteJsonFormat extends BigQueryJsonFormat[Byte] {
def write(x: Byte) = JsNumber(x)
def read(value: JsValue) = value match {
case JsNumber(x) if x.isValidByte => x.byteValue
case BigQueryNumber(x) if x.isValidByte => x.byteValue
case x => deserializationError("Expected Byte as JsNumber or JsString, but got " + x)
}
}
implicit object ShortJsonFormat extends BigQueryJsonFormat[Short] {
def write(x: Short) = JsNumber(x)
def read(value: JsValue) = value match {
case JsNumber(x) if x.isValidShort => x.shortValue
case BigQueryNumber(x) if x.isValidShort => x.shortValue
case x => deserializationError("Expected Short as JsNumber or JsString, but got " + x)
}
}
implicit object BigDecimalJsonFormat extends BigQueryJsonFormat[BigDecimal] {
def write(x: BigDecimal) = {
require(x ne null)
JsString(x.toString)
}
def read(value: JsValue) = value match {
case JsNumber(x) => x
case BigQueryNumber(x) => x
case x => deserializationError("Expected BigDecimal as JsNumber or JsString, but got " + x)
}
}
implicit object BigIntJsonFormat extends BigQueryJsonFormat[BigInt] {
def write(x: BigInt) = {
require(x ne null)
JsString(x.toString)
}
def read(value: JsValue) = value match {
case JsNumber(x) => x.toBigInt
case BigQueryNumber(x) => x.toBigInt
case x => deserializationError("Expected BigInt as JsNumber or JsString, but got " + x)
}
}
implicit object UnitJsonFormat extends BigQueryJsonFormat[Unit] {
def write(x: Unit) = JsNumber(1)
def read(value: JsValue): Unit = {}
}
implicit object BooleanJsonFormat extends BigQueryJsonFormat[Boolean] {
def write(x: Boolean) = JsBoolean(x)
def read(value: JsValue) = value match {
case JsTrue | JsString("true") => true
case JsFalse | JsString("false") => false
case x => deserializationError("Expected Boolean as JsBoolean or JsString, but got " + x)
}
}
implicit object CharJsonFormat extends BigQueryJsonFormat[Char] {
def write(x: Char) = JsString(String.valueOf(x))
def read(value: JsValue) = value match {
case JsString(x) if x.length == 1 => x.charAt(0)
case x => deserializationError("Expected Char as single-character JsString, but got " + x)
}
}
implicit object StringJsonFormat extends BigQueryJsonFormat[String] {
def write(x: String) = {
require(x ne null)
JsString(x)
}
def read(value: JsValue) = value match {
case JsString(x) => x
case x => deserializationError("Expected String as JsString, but got " + x)
}
}
implicit object SymbolJsonFormat extends BigQueryJsonFormat[Symbol] {
def write(x: Symbol) = JsString(x.name)
def read(value: JsValue) = value match {
case JsString(x) => Symbol(x)
case x => deserializationError("Expected Symbol as JsString, but got " + x)
}
}
implicit object ByteStringJsonFormat extends BigQueryJsonFormat[ByteString] {
import java.nio.charset.StandardCharsets.US_ASCII
def write(x: ByteString) = JsString(x.encodeBase64.decodeString(US_ASCII))
def read(value: JsValue) = value match {
case BigQueryBytes(x) => x
case x => deserializationError("Expected ByteString as JsString, but got " + x)
}
}
}
``` |
```html
<?xml version="1.0" encoding="utf-8" ?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "path_to_url">
<html xmlns="path_to_url" xml:lang="en" lang="en">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
<meta name="generator" content="Docutils 0.7: path_to_url" />
<title>The MPL Reference Manual: erase</title>
<link rel="stylesheet" href="../style.css" type="text/css" />
</head>
<body class="docframe refmanual">
<table class="header"><tr class="header"><td class="header-group navigation-bar"><span class="navigation-group"><a href="./end.html" class="navigation-link">Prev</a> <a href="./erase-key.html" class="navigation-link">Next</a></span><span class="navigation-group-separator"> | </span><span class="navigation-group"><a href="./end.html" class="navigation-link">Back</a> <a href="./erase-key.html" class="navigation-link">Along</a></span><span class="navigation-group-separator"> | </span><span class="navigation-group"><a href="./intrinsic-metafunctions.html" class="navigation-link">Up</a> <a href="../refmanual.html" class="navigation-link">Home</a></span><span class="navigation-group-separator"> | </span><span class="navigation-group"><a href="./refmanual_toc.html" class="navigation-link">Full TOC</a></span></td>
<td class="header-group page-location"><a href="../refmanual.html" class="navigation-link">Front Page</a> / <a href="./sequences.html" class="navigation-link">Sequences</a> / <a href="./intrinsic-metafunctions.html" class="navigation-link">Intrinsic Metafunctions</a> / <a href="./erase.html" class="navigation-link">erase</a></td>
</tr></table><div class="header-separator"></div>
<div class="section" id="erase">
<h1><a class="toc-backref" href="./intrinsic-metafunctions.html#id1432">erase</a></h1>
<div class="section" id="id238">
<h3><a class="subsection-title" href="#synopsis" name="synopsis">Synopsis</a></h3>
<pre class="literal-block">
template<
typename Sequence
, typename First
, typename Last = <em>unspecified</em>
>
struct <a href="./erase.html" class="identifier">erase</a>
{
typedef <em>unspecified</em> type;
};
</pre>
</div>
<div class="section" id="id239">
<h3><a class="subsection-title" href="#description" name="description">Description</a></h3>
<p><tt class="literal"><span class="pre"><a href="./erase.html" class="identifier">erase</a></span></tt> performs a removal of one or more adjacent elements in the sequence
starting from an arbitrary position.</p>
</div>
<div class="section" id="id240">
<h3><a class="subsection-title" href="#header" name="header">Header</a></h3>
<pre class="literal-block">
#include <<a href="../../../../boost/mpl/erase.hpp" class="header">boost/mpl/erase.hpp</a>>
</pre>
</div>
<div class="section" id="id241">
<h3><a class="subsection-title" href="#model-of" name="model-of">Model of</a></h3>
<p><a class="reference internal" href="./tag-dispatched-metafunction.html">Tag Dispatched Metafunction</a></p>
</div>
<div class="section" id="id242">
<h3><a class="subsection-title" href="#parameters" name="parameters">Parameters</a></h3>
<table border="1" class="docutils table">
<colgroup>
<col width="15%" />
<col width="36%" />
<col width="48%" />
</colgroup>
<thead valign="bottom">
<tr><th class="head">Parameter</th>
<th class="head">Requirement</th>
<th class="head">Description</th>
</tr>
</thead>
<tbody valign="top">
<tr><td><tt class="literal"><span class="pre">Sequence</span></tt></td>
<td><a class="reference internal" href="./extensible-sequence.html">Extensible Sequence</a> or
<a class="reference internal" href="./extensible-associative-sequence.html">Extensible Associative Sequence</a></td>
<td>A sequence to erase from.</td>
</tr>
<tr><td><tt class="literal"><span class="pre">First</span></tt></td>
<td><a class="reference internal" href="./forward-iterator.html">Forward Iterator</a></td>
<td>An iterator to the beginning of the range to
be erased.</td>
</tr>
<tr><td><tt class="literal"><span class="pre">Last</span></tt></td>
<td><a class="reference internal" href="./forward-iterator.html">Forward Iterator</a></td>
<td>An iterator past-the-end of the range to be
erased.</td>
</tr>
</tbody>
</table>
</div>
<div class="section" id="id243">
<h3><a class="subsection-title" href="#expression-semantics" name="expression-semantics">Expression semantics</a></h3>
<div class="expression-semantics compound">
<p class="compound-first">For any <a class="reference internal" href="./extensible-sequence.html">Extensible Sequence</a> <tt class="literal"><span class="pre">s</span></tt>, and iterators <tt class="literal"><span class="pre">pos</span></tt>, <tt class="literal"><span class="pre">first</span></tt> and <tt class="literal"><span class="pre">last</span></tt> into <tt class="literal"><span class="pre">s</span></tt>:</p>
<pre class="compound-middle literal-block">
typedef <a href="./erase.html" class="identifier">erase</a><s,first,last>::type r;
</pre>
<table class="compound-middle docutils field-list" frame="void" rules="none">
<col class="field-name" />
<col class="field-body" />
<tbody valign="top">
<tr class="field"><th class="field-name">Return type:</th><td class="field-body"><p class="first"><a class="reference internal" href="./extensible-sequence.html">Extensible Sequence</a>.</p>
</td>
</tr>
<tr class="field"><th class="field-name">Precondition:</th><td class="field-body"><p class="first"><tt class="literal"><span class="pre">[first,last)</span></tt> is a valid range in <tt class="literal"><span class="pre">s</span></tt>.</p>
</td>
</tr>
<tr class="field"><th class="field-name">Semantics:</th><td class="field-body"><p class="first"><tt class="literal"><span class="pre">r</span></tt> is a new sequence, <a class="reference internal" href="./terminology.html#concept-identical">concept-identical</a> to <tt class="literal"><span class="pre">s</span></tt>, of the following elements:
[<tt class="literal"><span class="pre"><a href="./begin.html" class="identifier">begin</a><s>::type</span></tt>, <tt class="literal"><span class="pre">pos</span></tt>), [<tt class="literal"><span class="pre">last</span></tt>, <tt class="literal"><span class="pre"><a href="./end.html" class="identifier">end</a><s>::type</span></tt>).</p>
</td>
</tr>
<tr class="field"><th class="field-name">Postcondition:</th><td class="field-body"><p class="first">The relative order of the elements in <tt class="literal"><span class="pre">r</span></tt> is the same as in <tt class="literal"><span class="pre">s</span></tt>;</p>
<pre class="last literal-block">
<a href="./size.html" class="identifier">size</a><r>::value == <a href="./size.html" class="identifier">size</a><s>::value - <a href="./distance.html" class="identifier">distance</a><first,last>::value
</pre>
</td>
</tr>
</tbody>
</table>
<!-- ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -->
<pre class="compound-middle literal-block">
typedef <a href="./erase.html" class="identifier">erase</a><s,pos>::type r;
</pre>
<table class="compound-last docutils field-list" frame="void" rules="none">
<col class="field-name" />
<col class="field-body" />
<tbody valign="top">
<tr class="field"><th class="field-name">Return type:</th><td class="field-body"><p class="first"><a class="reference internal" href="./extensible-sequence.html">Extensible Sequence</a>.</p>
</td>
</tr>
<tr class="field"><th class="field-name">Precondition:</th><td class="field-body"><p class="first"><tt class="literal"><span class="pre">pos</span></tt> is a dereferenceable iterator in <tt class="literal"><span class="pre">s</span></tt>.</p>
</td>
</tr>
<tr class="field"><th class="field-name">Semantics:</th><td class="field-body"><p class="first">Equivalent to</p>
<pre class="last literal-block">
typedef <a href="./erase.html" class="identifier">erase</a>< s,pos,<a href="./next.html" class="identifier">next</a><pos>::type >::type r;
</pre>
</td>
</tr>
</tbody>
</table>
</div>
<div class="expression-semantics compound">
<p class="compound-first">For any <a class="reference internal" href="./extensible-associative-sequence.html">Extensible Associative Sequence</a> <tt class="literal"><span class="pre">s</span></tt>, and iterator <tt class="literal"><span class="pre">pos</span></tt> into <tt class="literal"><span class="pre">s</span></tt>:</p>
<pre class="compound-middle literal-block">
typedef <a href="./erase.html" class="identifier">erase</a><s,pos>::type r;
</pre>
<table class="compound-last docutils field-list" frame="void" rules="none">
<col class="field-name" />
<col class="field-body" />
<tbody valign="top">
<tr class="field"><th class="field-name">Return type:</th><td class="field-body"><a class="reference internal" href="./extensible-sequence.html">Extensible Sequence</a>.</td>
</tr>
<tr class="field"><th class="field-name">Precondition:</th><td class="field-body"><tt class="literal"><span class="pre">pos</span></tt> is a dereferenceable iterator to <tt class="literal"><span class="pre">s</span></tt>.</td>
</tr>
<tr class="field"><th class="field-name">Semantics:</th><td class="field-body">Erases the element at a specific position <tt class="literal"><span class="pre">pos</span></tt>; equivalent to
<tt class="literal"><span class="pre"><a href="./erase-key.html" class="identifier">erase_key</a><s,</span> <span class="pre"><a href="./deref.html" class="identifier">deref</a><pos>::type</span> <span class="pre">>::type</span></tt>.</td>
</tr>
<tr class="field"><th class="field-name">Postcondition:</th><td class="field-body"><tt class="literal"><span class="pre"><a href="./size.html" class="identifier">size</a><r>::value</span> <span class="pre">==</span> <span class="pre"><a href="./size.html" class="identifier">size</a><s>::value</span> <span class="pre">-</span> <span class="pre">1</span></tt>.</td>
</tr>
</tbody>
</table>
</div>
</div>
<div class="section" id="id244">
<h3><a class="subsection-title" href="#complexity" name="complexity">Complexity</a></h3>
<table border="1" class="docutils table">
<colgroup>
<col width="45%" />
<col width="55%" />
</colgroup>
<thead valign="bottom">
<tr><th class="head">Sequence archetype</th>
<th class="head">Complexity (the range form)</th>
</tr>
</thead>
<tbody valign="top">
<tr><td><a class="reference internal" href="./extensible-associative-sequence.html">Extensible Associative Sequence</a></td>
<td>Amortized constant time.</td>
</tr>
<tr><td><a class="reference internal" href="./extensible-sequence.html">Extensible Sequence</a></td>
<td>Quadratic in the worst case, linear at best.</td>
</tr>
</tbody>
</table>
</div>
<div class="section" id="id245">
<h3><a class="subsection-title" href="#example" name="example">Example</a></h3>
<pre class="literal-block">
typedef <a href="./vector-c.html" class="identifier">vector_c</a><int,1,0,5,1,7,5,0,5> values;
typedef <a href="./find.html" class="identifier">find</a>< values, <a href="./integral-c.html" class="identifier">integral_c</a><int,7> >::type pos;
typedef <a href="./erase.html" class="identifier">erase</a><values,pos>::type result;
<a href="./assert-relation.html" class="identifier">BOOST_MPL_ASSERT_RELATION</a>( <a href="./size.html" class="identifier">size</a><result>::value, ==, 7 );
typedef <a href="./find.html" class="identifier">find</a><result, <a href="./integral-c.html" class="identifier">integral_c</a><int,7> >::type iter;
<a href="./assert.html" class="identifier">BOOST_MPL_ASSERT</a>(( is_same< iter, <a href="./end.html" class="identifier">end</a><result>::type > ));
</pre>
</div>
<div class="section" id="id246">
<h3><a class="subsection-title" href="#see-also" name="see-also">See also</a></h3>
<p><a class="reference internal" href="./extensible-sequence.html">Extensible Sequence</a>, <a class="reference internal" href="./extensible-associative-sequence.html">Extensible Associative Sequence</a>, <a class="reference internal" href="./erase-key.html">erase_key</a>, <a class="reference internal" href="./pop-front.html">pop_front</a>, <a class="reference internal" href="./pop-back.html">pop_back</a>, <a class="reference internal" href="./insert.html">insert</a></p>
<!-- Sequences/Intrinsic Metafunctions//erase_key -->
</div>
</div>
<div class="footer-separator"></div>
<table class="footer"><tr class="footer"><td class="header-group navigation-bar"><span class="navigation-group"><a href="./end.html" class="navigation-link">Prev</a> <a href="./erase-key.html" class="navigation-link">Next</a></span><span class="navigation-group-separator"> | </span><span class="navigation-group"><a href="./end.html" class="navigation-link">Back</a> <a href="./erase-key.html" class="navigation-link">Along</a></span><span class="navigation-group-separator"> | </span><span class="navigation-group"><a href="./intrinsic-metafunctions.html" class="navigation-link">Up</a> <a href="../refmanual.html" class="navigation-link">Home</a></span><span class="navigation-group-separator"> | </span><span class="navigation-group"><a href="./refmanual_toc.html" class="navigation-link">Full TOC</a></span></td>
file LICENSE_1_0.txt or copy at <a class="reference external" href="path_to_url" target="_top">path_to_url
</html>
``` |
For Better or Worse is a 1995 American comedy-drama film written by Jeff Nathanson and directed by Jason Alexander, who stars alongside Lolita Davidovich and James Woods. The film was given a limited theatrical release, and aired on TNT in 1996.
Plot
Michael Makeshift is a lonely, sad man who can't get over the fact his fiancée dumped him. He regularly attends various support groups to meet people. To make matters worse, his landlord is beginning to bug him for long-overdue rent.
It seems that things for Michael's brother Reggie are much better. A con, he regularly dupes his family, all of whom are oblivious except for Michael. He appears on his doorstep, newly married to Valerie. Reggie asks him to look after her, who's puzzled when she awakes at Michael's apartment after Reggie left her there whilst she was drunk and unconscious.
Valerie also does not know that Reggie has paid Michael for the favor, while he 'takes care of some business'. Disoriented when she wakes up, Valerie slowly warms to Michael.
Despite his well-laid plans to rob the credit union where his own mother works, things go badly for Reggie. His henchmen mutiny and force him to reveal that the clueless Valerie carries the security codes they need to pull off the job in her suitcase.
A chase ensues. While Michael helps Valerie escape, he reveals the truth about Reggie. At the same time, she becomes increasingly attracted to her new protector. Staying overnight in his dad's now closed hardware store, Reggie's henchmen find her, forcing her and Reggie to hit the credit union.
In the end, the henchmen are arrested, Reggie and Michael are released, and the later and Valerie (who hadn't married Reggie after all) declare their mutual love and kiss.
Cast
Jason Alexander as Michael Makeshift
Lolita Davidovich as Valeri Carboni
James Woods as Reggie Makeshift
Joe Mantegna as Stone
Jay Mohr as Dwayne
Robert Costanzo as Ranzier
Bea Arthur as Beverly Makeshift (Uncredited) Arthur refused to receive a screen credit for this film.
Eda Reiss Merin as Rose
John Amos as Gray
Rob Reiner as Dr. Plosner
Haley Joel Osment as Danny
Tiffany Salerno as Cindy
Beau Gravitte as Bob
Una Damon as the Bartender
Jerry Adler as Morton Makeshift
Rip Torn as Captain Cole
Steven Wright as Cabbie
Release
Box office
The film was first shown in America on March 19, 1995, and in the UK on 29 December 1995. On 1 April 1997, the film premiered in Italy and in Hungary too on 20 May 1997. In Sweden, the film first received a TV premier on 1 August 2004. The film grossed $25,912 on its opening weekend in America across 24 screens before totaling $40,622 by the end of March.
Critical reception
Iotis Erlewine of Allmovie gave the film two out of five stars. Both Video Movie Guide 2002 and Video Source Book gave the film two out of five stars as well.
In 2004, Vince Leo of Qwipster.net gave an unfavorable review, stating: "Not exactly the directorial debut that Seinfeld favorite Jason Alexander would have hoped for, For Better or Worse is little more than a ninety-minute collection of strained situations and unfunny moments. The problems start early, as it is just a bad idea for a romantic comedy to begin with, and it certainly doesn't help that Jeff Nathanson can't inject anything fresh into it. For Better or Worse isn't devoid of comedy, as it did occasionally make me chuckle, but not nearly enough as it made me annoyed. For Better or Worse is a rhetorical proposition, as all Alexander delivers is worse and worse. Unless you find him completely irresistible, there's not much going for this inept misfire."
The Atlanta Journal-Constitution reviewed the film upon release, giving a rating of two and a half stars out of four, noting: "Exceedingly strange comedy wavers between hilarity and "huh?". For Better or Worse just strange enough for cable."
Home media
Following its release, For Better or Worse remained out-of-print and only available on VHS, although, in recent years, it is available as a download via iTunes and on Amazon via Instant Video. In 1996, Home Video Hellas released the film on VHS in Greece, whilst LK-TEL Vídeo released it on the same format in Brazil. In 1999, Turner Home Entertainment released the film in America on VHS. Sony Pictures Home Entertainment released the film in the UK in 1999, where it featured slightly different artwork to the American release.
References
External links
1995 films
Films directed by Jason Alexander
1995 comedy-drama films
Columbia Pictures films
Films with screenplays by Jeff Nathanson
1995 directorial debut films
American comedy-drama films
Films scored by Miles Goodman
1990s English-language films
1990s American films |
Union Township, Indiana may refer to one of the following places:
Union Township, Adams County, Indiana
Union Township, Benton County, Indiana
Union Township, Boone County, Indiana
Union Township, Clark County, Indiana
Union Township, Clinton County, Indiana
Union Township, Crawford County, Indiana
Union Township, DeKalb County, Indiana
Union Township, Delaware County, Indiana
Union Township, Elkhart County, Indiana
Union Township, Fulton County, Indiana
Union Township, Gibson County, Indiana
Union Township, Hendricks County, Indiana
Union Township, Howard County, Indiana
Union Township, Huntington County, Indiana
Union Township, Jasper County, Indiana
Union Township, Johnson County, Indiana
Union Township, LaPorte County, Indiana
Union Township, Madison County, Indiana
Union Township, Marshall County, Indiana
Union Township, Miami County, Indiana
Union Township, Montgomery County, Indiana
Union Township, Ohio County, Indiana
Union Township, Parke County, Indiana
Union Township, Perry County, Indiana
Union Township, Porter County, Indiana
Union Township, Randolph County, Indiana
Union Township, Rush County, Indiana
Union Township, St. Joseph County, Indiana
Union Township, Shelby County, Indiana
Union Township, Tippecanoe County, Indiana
Union Township, Union County, Indiana
Union Township, Vanderburgh County, Indiana
Union Township, Wells County, Indiana
Union Township, White County, Indiana
Union Township, Whitley County, Indiana
See also
Union Township (disambiguation)
Indiana township disambiguation pages |
Steve Sowden (born, 14 February 1983), is an Australian Pentecostal worship leader and singer in the Planetshakers band.
Biography
Steve grew up in a Christian home and later joined a church worship team as a teenager. Where he studied singing and earned a BA in Musical Theater from the Central Queensland Conservatory of Music in Australia. Throughout his singing career. Sowden was lead vocalist in Tokyo Disney-Sea Broadway Revue 'Encore' from 2005 through 2006. The following year he joined the Ten Tenors group as lead vocalist in internationally acclaimed crossover vocal group from 2006 to 2010. From 2008 until now he belongs to Planetshakers Church, where he serves as a pastor and singer.
Personal life
Steve Sowden married on 4 January 2009 to Katie and together they have four children: Jonathan, Sophia, Eleanor and Joshua.
Discography
The Ten Tenors
2006 – Here's to the Heroes No. 8 AUS
2008 – Nostalgica No. 27 AUS
2009 – Amigos Para Siempre
Planetshakers
2011 – Nothing Is Impossible (August 2011)
2012 – Heal Our Land (live, April 2012)
2013 – Limitless (live, January 2013)
2014 – Endless Praise: Live (live, March 2014) (also a deluxe edition)
2014 – Nada Es Imposible (in Spanish, July 2014)
2014 – This Is Our Time: Live (live, October 2014) (also a deluxe edition)
2015 – Outback Worship Sessions (May 2015)
2015 – #LETSGO (live, September 2015) (also a deluxe edition)
2016 – Momentum (Live in Manila) (March 2016)
2016 – Overflow: Live (live, September 2016) (also a deluxe edition)
2016 – Sé Quién Eres Tú (in Spanish, November 2016)
2017 – Legacy (live, September 2017) (also a deluxe edition)
2017 – Legado (in Spanish, November 2017)
2018 – Heaven on Earth (live, October 2018) (also a deluxe edition)
2019 – Rain (live, September 2019)
2019 – It's Christmas (November 2019)
2020 – Over It All (November 2020)
2020 – It's Christmas Live (November 2020)
References
Singers from Melbourne
Planetshakers Church
Planetshakers members
21st-century Australian male singers
21st-century Christians
Australian gospel singers
Australian Pentecostals
Performers of contemporary worship music
Australian Charismatics
1983 births
Living people |
Queensland State Equestrian Centre is an equestrian sport venue located in Caboolture, Brisbane, Australia. It was opened in September 2011.
The facilities include:
An 80m x 40m indoor, sand arena with seating for 3,200 equestrian spectators or 5,200 for a concert, judges and commentators rooms and PA system
Warm up areas including a fully lit, 60m x 20m sand warm up arena
4 all-weather, sand dressage arenas with covered viewing areas
154 stables with anti-slip rubber matting
8 wash bays
55 camp sites with power and water access
Camp sites (see below)
2 meeting/training rooms
A licensed bar
The Queensland State Equestrian Centre has 154 stables in close proximity to the camp sites, the main arena, warm up arena and dressage arenas.
Stable Facilities:
154 stables measuring 3.6m x 3.6m with anti-slip rubber matting and bitumen aisles
Water and lighting in each aisle
8 wash bays
A dedicated vets room
Horse waste bays
A PA system link to the main arena
Sawdust bedding
The Queensland State Equestrian Centre has 55 camp sites with water and power access as well as additional ‘informal’ camping spaces. The camp sites are split into three different sizes allowing for large horse trucks, camper vans and goosenecks through to smaller horse trucks and horse floats. The width of all powered sites are 5.5m and the lengths vary from 16m to 25.5m.
Camping Facilities:
55 camp sites with power and water access
Further unpowered camp sites
A large amenities block toilets and showers
Camping reception
See also
Equestrian Australia
Sport in Brisbane
Sport in Queensland
References
External links
Official website
Sports venues in Brisbane
Equestrian venues
Sports venues completed in 2011
Indoor arenas in Australia
Equestrian sports in Australia |
Self-bondage refers to the use of restraints on oneself for erotic pleasure. It is a form of erotic bondage which can be practiced alone.
Self-bondage is characterized by experimentation and ingenuity, and can be riskier than conventional bondage. Self-bondage requires use of techniques for self-binding as movement becomes increasingly restricted as more restraints are applied, and also requires a reliable release mechanism. Many types of bondage equipment can be applied before the one that restrains the hands. For example, leg irons can be applied, as well as gags, blindfolds, etc.
For many of its practitioners, the added challenges and dangers are a part of the appeal of self-bondage, who often devise elaborate self-bondage schemes and release mechanisms, both in practice and in erotic fiction.
Risks
Self-bondage is considered a higher-risk activity than many other BDSM practices — particularly when combined with autoerotic asphyxia — and has led to a number of recorded deaths. The death in 1994 of Stephen Milligan, the British Conservative MP for Eastleigh, was a case of autoerotic asphyxiation combined with self-bondage.
Self-bondage has all the risks of physical restraint and sexual bondage, with the added factor that should anything go wrong, there is no one to effect a rescue. For example, if blood circulation cuts off sensation in limbs, the planned escape mechanism may not be usable.
Types
Self-bondage can be either strict or sensual.
Sensual self-bondage
In sensual self-bondage, escape from restraints is simple and available immediately, if desired. For example, the keys might be within reach or the knots loosely tied. The chief aim is the sensation of immobility and of constrained movement.
Strict self-bondage
Strict self-bondage requires that the means of escape be unavailable until the lapse of time before the release mechanism activates itself. This feature of strict self-bondage makes it potentially more hazardous, but some practice it for the greater sense of helplessness it creates.
Emergency intervention
A compromise position between safety and strictness allows for a backup release mechanism that is available immediately, but carries with it some penalty or cost with its use. For example, keys could be placed in a bucket of paint. The person in self-bondage can escape quickly if necessary, such as a fire breaking out, or excessive numbness of limbs. However, the annoyance of cleaning up the paint afterwards would coerce the person into waiting for the main release mechanism to come into effect if he or she were merely bored or uncomfortable. Another penalty may be the need to contact somebody, with the penalty being having to explain what has happened.
Release mechanisms
Many release mechanisms are used in self-bondage to allow the practitioner to escape the restraints after a period of time. There are various trade-offs to be made between ease of use, reliability, precision of timing, cost, and so forth. There should be several mechanisms available, thus ensuring redundancy and safety.
Ice cubes are commonly used as a release mechanism. For example, a key can be placed in water which is then frozen. The key will not be available until the ice melts. Advantages include simplicity and reliability. The disadvantage is that it can be difficult to gauge precisely how long a scenario will last, although some enjoy the uncertainty.
Ice locks are frozen together and do not move until the ice has melted down. These can be used alone (to lock a person to a stationary object) or in combination with tightening devices (to keep the tension for a certain period of time).
"Salt locks": Salt, sugar or any other safe water-soluble substance blocks parts of a lock. It needs to be dissolved in order to release the mechanism.
Combination locks can be used as release mechanisms. These can rely on the time needed to try every possibility for an unknown combination, or they can rely on light in order to see to enter the known combination correctly.
Unknown combination: The idea is that the lock is reset to an unknown combination, then used to lock the bondage in place. The person must find the correct combination by trial and error. A three digit combination lock contains a thousand possibilities. At a second per attempt, this could take up to 16 minutes and 40 seconds, usually less assuming the combination starts with lower numbers. For a four-digit lock, it is nearer two hours. Disadvantages include the fact that it may be distracting to actively "crack" the lock.
In darkness: Even if the number is known, for many locks, it is not possible to enter the combination without being able to see the faces of the dials. This release mechanism relies on darkness. The light can be provided either by the morning sunlight, or, preferably, through a light on a time switch. The advantages include a large amount of control over how long the bondage lasts (with a timer), and a backup of the onset of daylight. The disadvantages are only being able to use the technique at night, and having to perform the bondage in the dark.
Electromagnets: Electromagnets can be used to release keys after a delay. If combined with electronics or a computer, a large amount of control is possible over the timing, and the mechanism is somewhat "fail-safe" — if power fails, the key will fall early. Disadvantages include complexity and cost. The powerful electromagnets used in door locks can also be adapted for use directly as restraints.
Soldering irons: Soldering irons can be used, in conjunction with a timing mechanism, to cut a nylon rope, or to release keys. This may be a fire hazard unless appropriate precautions are taken.
The use of a delivery/messenger service or regular mail in order to obtain the object (usually key/keys) needed in order to become released. This relies on the delivery service being 100% reliable.
Emergency backup
There are also a number of release mechanisms designed to be emergency backups. The idea behind these release mechanisms is that triggering them will cause something undesirable to happen, and thus are only used in situations where death or serious injury could occur otherwise.
Paint tin: A backup key is stored in a bucket of paint, ink or motor oil in such a way that recovering the key will cause the contents of the container to spill, causing costly damage to a carpet or other possessions. This mechanism can be used for extremely quick release in an emergency such as a fire, but can make the situation worse if a flammable liquid is used.
Unpleasant drink: An unpleasant liquid, such as urine (the safety of this is discussed in the article Urophagia), is stored in a container. The key is only released when the contents of the container have been drunk (it should be designed so that the contents can not be spilled). The idea is to make the drink so unpleasant that it will only be considered as a last resort.
Rescue: A friend or relative is notified to come over at a certain time (that time being after the bondage session is planned to end). The friend may or may not be aware of the bondage. An alternative is to position a phone somewhere that is accessible during the bondage, so that a friend or the emergency services may be called if the planned release mechanisms fail.
Techniques
Apart from release mechanisms, self-bondage poses a somewhat awkward problem of getting into bondage, especially when using rope. What might be a relatively simple matter for more than one person can be considerably more complex alone.
With rope, the main difficulty is tying the hands in a way that is not easy to untie. One common solution is to use a cinch noose — essentially a kind of slip knot — together with a coil (a loop of rope). The wrists are placed through the coil with the cinch noose between the wrists and around the coil. To achieve a basic hogtie position, the cinch noose is tied to the ankles. With pressure, the noose tightens the wrist coil, securing the hands. It proves very difficult to escape from, and usually a knife or scissors is required to cut free.
Equipment that can be tightened only, and not loosened, often has application in self-bondage. This includes handcuffs, zip ties and ratcheting pulleys.
Commercial equipment
While for the most part self-bondage is performed using ordinary and easily available equipment (indeed, it lends itself to impromptu adaptation and a "do it yourself" approach), a few commercial products have appeared — in the United States and United Kingdom for the most part — catering for the self-bondage practitioner.
See also
Escape artist
References
External links
A set of summaries of and references to articles on self-bondage fatalities
Soc.subculture.bondage-bdsm FAQ appendix
Self-bondage techniques
Translation of the term "self-bondage" to other languages
Glossary of clinical sexology (it - en)
Bondage (BDSM)
BDSM activities
Physical restraint |
Karen Kristine Holtsmark (11 November 1907 – 7 March 1998) was a Norwegian painter.
Biography
Holtsmark was born at Ås in Akershus, Norway. She was a daughter of Gabriel Gabrielsen Holtsmark (1867–1954) and his wife Margrete Weisse (1871–1933). Her father was a physicist, and her mother was an educator. She was a maternal granddaughter of philologist Johan Peter Weisse, and a paternal granddaughter of agriculturalist and politician Bent Holtsmark. She was a niece of politicians Bernt and Torger Holtsmark, and a sister of professors Johan and Anne Holtsmark. She married Haakon R. Brækken in July 1936, but the marriage was dissolved.
Career
Holtsmark attended the Norwegian National Academy of Craft and Art Industry from 1924 to 1927 and the Norwegian National Academy of Fine Arts from 1927 to 1930. Her most important teacher was Axel Revold, and she was also influenced by Vilhelm Bjerke-Petersen to take up the Surrealist style. Some of her paintings were Expressionist. She also became a Communist and stayed several times in France where she also studied under Georg Jacobsen in 1936.
In 1932 Holtsmark participated in a group exhibition at the Kunstnerforbundet in Oslo with Bjarne Rise, Johannes Rian and Vilhelm Bjerke-Petersen. She had her first exhibit at Kunstnerforbundet in 1935 and had major exhibits in Copenhagen in 1935 and Lund, Sweden in 1937. In 1959 she was one of the winners of a contest to be displayed in the Parliament of Norway. Her work Solens gang was woven by Else Halling between 1959 and 1965 and was displayed in the Central Hall.
Some of her works, especially the main work Mennesket og vilkårene (1935), were controversial, and it was not bought by the National Gallery of Norway until 1993. The National Gallery now holds twelve of her landscape paintings. Her art is also on display at Lillehammer Art Museum and Bergen Billedgalleri.
Holtsmark retired in 1970 because of an eye condition. She died in March 1998 in Ås.
References
1907 births
1998 deaths
20th-century Norwegian women artists
20th-century Norwegian painters
People from Ås, Akershus
Oslo National Academy of the Arts alumni
Norwegian expatriates in France
Norwegian surrealist artists
Women surrealist artists
Expressionist painters
Norwegian communists
Norwegian women painters |
is a Japanese footballer currently playing as a centre-back for Iwaki FC.
Club career
In March 2019, Egawa moved to Brazilian side Londrina-PR on loan, alongside teammate Kohei Hattori. At the end of the following season, it was announced that Egawa would move to fellow Japanese side Iwaki FC ahead of the 2021 season.
Career statistics
Club
.
Notes
References
2000 births
Living people
People from Ōtsu, Shiga
Association football people from Shiga Prefecture
Japanese men's footballers
Men's association football defenders
Japan Football League players
J3 League players
J2 League players
Kyoto Sanga FC players
Iwaki FC players
Londrina Esporte Clube players
Japanese expatriate men's footballers
Japanese expatriate sportspeople in Brazil
Expatriate men's footballers in Brazil |
```php
<?php
$x = require $x;
$y = require $x &&
require $y;
if (require $x) {
return (require $x);
}
/* false-positives */
require_once $x;
return (require __DIR__ . 'semicolons.php');
``` |
The World Martial Arts Masterships is an international martial arts competition that has been held in the North Chungcheong Province, South Korea. A total of 2 masterships have been held, with the 2016 iteration being held in Cheongju, and the 2019 competition being held in Chungju.
:ko:세계무예마스터십
Background
The World Combat Games were founded by Global Association of International Sports Federations (then known as SportAccord) with the first rendition being held in Beijing, China in 2010. The 2013 rendition was then held in St. Petersburg, Russia. Following the demise of SportAccord due to conflicts with the International Olympic Committee after the 2013 games, the World Combat Games were halted. The World Martial Arts Masterships Committee was then created to continue the idea of a martial arts-only multi-sport event.
Games
Online Games
http://online.mastership.org/en/index.jsp
Duration : 2021. Oct. 29th ~ Nov. 2nd (5 days)
Youth Games
2016 Competition
The 2016 competition lasted for 1 week, featuring 2,400 martial artists from 81 countries competing in 17 martial arts. The martial art program consisted of: wrestling, judo, Jujutsu, kendo, kickboxing, muay thai, sambo, taekwondo, and wushu. The masterships events consisted of horseback archery, kabaddi, hapkido, kurash, taekkyeon, Tong-Il Moo-Do , yongmudo, and 'martial arts show' and 'martial arts contest' events.
Sports
Belt Wrestling
Horseback Archery
Judo
Ju-Jitsu
Hapkido
Kendo
Kurash
Kickboxing
Muaythai
Taekkyeon
Taekwondo
Yongmudo
Sambo
Tong-Il Moo-Do
Wushu
Martial Arts Record Contest
Martial Arts Show
2016 Medals
2019 Competition
The 2019 championships were the second iteration of the masterships and featured 3,119 martial artists from 106 countries competing in 20 different martial arts areas over 275 medals. The motto was "Beyond the Times, Bridge the World".
The opening ceremony for the 2019 competition was held at Chungju Central Sports Stadium on August 30. It had 15,000 attendees and featured a performance from the Republic of Korea Air Force's Black Eagles aerobatic team. In total, 150,556 spectators and 900 volunteers were present during the entire duration of the masterships. Turkmenistan finished at first place with 19 medals, followed by South Korea with 17. The cost of the 2019 championships has been estimated to be 15 billion Korean won. Additionally, an international martial arts film festival featuring 51 different films was also held during the same period.
Aikido and savate were added and kickboxing and kendo were removed from the martial arts program. Pencak silat and ssireum were added to the masterships program.
Sports
List of Sports:
GAISF Events (85):
Aikido (0)
Belt Wrestling (12)
Judo (5)
Ju-Jitsu (12)
Muaythai (10)
Sambo (15)
Savate (9)
Taekwondo (6)
Wushu (16)
Non GAISF Events (106):
Horseback Archery (10)
Korean Hapkido (9)
Kabaddi (2)
Kurash (15)
Pencak silat (15)
Ssireum (8)
Taekkyeon (8)
Yongmudo (10)
Tong-Il Moo-Do (12)
Martial Arts Record Contest (9)
Martial Arts Show (8)
2019 Medals (GAISF and Non GAISF)
2019 Medals (GAISF)
2019 Medals (Non GAISF)
2019 Individual medals (Non GAISF)
Tong-II Moo-Doo
Yongmudo
Kurash
Korean Hapkido
Kabaddi
Pencak Silat
Ssireum
Taekkyeon
Horseback Archery
Martial Arts Show
Martial Arts Record Contest
2017 Youth Competition
This games was held in 3-7 Nonember in 2017.
Sports
Hapkido
Kurash
Muaythai
Yongmudo
Martial Arts Record Contest (RC)
Martial Arts Show (MS)
Medals
2021 Online Games
Sports
http://online.mastership.org/en/schedule/ranking_event.jsp
GAISF Events (15):
Judo (5)
Muaythai (6)
Taekwondo (4)
Non GAISF Events (42):
e Martial Arts (0)
Kendo (0)
Korean Hapkido (5)
Kurash (6)
Taekkyeon (8)
Yongmudo (8)
Tong-Il Moo-Do (8)
Martial Arts Show (7)
2021 Medals (GAISF and Non GAISF)
http://online.mastership.org/en/schedule/ranking_noc.jsp
See also
World Combat Games
Hyeong
References
Martial arts competitions
2019 in South Korean sport
2016 in South Korean sport
Multi-sport events
Chungju
Cheongju |
Vacuum catastrophe can mean:
the cosmological constant problem in cosmology
the divergence in the calculation of vacuum energy in quantum field theory
vacuum instability in quantum field theory
See also
Quantum field theory
Renormalization
Vacuum energy |
Ivan Panteleyevich Mozgovenko (; 13 February 1924 – 31 December 2021) was a Soviet and Russian clarinetist and music teacher. He taught clarinet as a professor at the Gnessin State Musical College. For his participation as a soldier in World War II and for his later artistic achievements, he received numerous medals and honorary titles, including the title People's Artist of Russia.
Biography
Mozgovenko was born on 13 February 1924 in Yashalta, Stepnovsky District, Rostov Region, Russian SFSR, USSR (now the Republic of Kalmykia in the Russian Federation). In 1931, his family's property was expropriated and the family was exiled to the Ural region in the area of Nizhny Tagil. From 1939 to 1943, he studied at the Tchaikovsky Music College in Sverdlovsk in the clarinet class. In 1943, he joined the Ural Volunteer Tank Corps, where he served in the medical battalion, fighting from Oryol, Bryansk and Zhitomir to Berlin and Prague. He was offered a commission as his unit demobilized, but continued his musical studies instead.
In 1946, he continued his training as a clarinetist at the Gnessin State Musical College, where he studied with Alexander Leonidovich Shtark (or Stark) (first degree in 1951, the graduate school in 1954). In 1951 he won the first prize at an international competition in Berlin and since worked as a soloist and chamber musician. He played with the Borodin Quartet. From 1953 to 1968, Mozgovenko was principal clarinetist with the State Symphony Cinema Orchestra. In collaboration with the Borodin Quartet and other chamber ensembles, Mozgovenko recorded works by Mozart, Brahms, Prokofiev and some contemporary composers. In addition to his concert activities, Mozgovenko taught at the Gnessin State Musical College since 1951, and as an associate professor since 1966. In 1980 he was awarded the title of professor. His students include many clarinetists and award winners of international competitions. Mozgovenko is also the author of a number of textbooks and transcriptions for clarinet.
Mozgovenko performed with Russian quartets like the Prokofiev, Beethoven, Komitas and Glinka quartets, and with musicians like Svyatoslav Richter, Sergei Prokofiev, Maria Yudina, Van Cliburn and Mstislav Rostropovich.
He collaborated with notable conductors like Yevgeny Svetlanov, Kirill Kondrashin, Alexander Gauk, Leonard Bernstein, Yuri Temirkanov, Vladimir Fedoseyev and Gennady Rozhdestvensky. He trained many musicians, becoming a founder of the Russian clarinet school.
Mozgovenko died on 31 December 2021, at the age of 97.
Instruments
When Mosgowenko began to play the clarinet, the German fingering system for the clarinet dominated in the USSR. In the early 1960s, there was a general changeover to the Boehm system (including the Reform Boehm system, which came closer to the German sound, until the 1980s), which Mozgovenko was unable to avoid. In 1964, he also changed and has been playing Buffet Crampon instruments for many years.
Significance
In Russia, Mozgovenko was considered the father of the current generation of clarinetists. , fourteen full or associate professors and 50 prize winners were his students.
Mozgovenko said:
"I am glad that my students are working all over the world – in the USA, Canada and France. I have celebrated 70 years of teaching at the academy."
In a tribute to his 95th birthday it is reported that he saw himself as the "creative grandson" of the founder of the Russian clarinet school Sergej Sobnow, whom he regarded as the successor to the founder of the clarinet school in Germany Carl Baermann.
On his 90th birthday he performed again. Beginning on the occasion of his 95th birthday, an international clarinet competition named after Mozgovenko has been taking place in Russia since 2019.
For Margarita Konstantinovna, one of his former students, Mozgovenko is an icon of Russian and world-spiritual art, who has made a great contribution to its development, with its own school, its own technique and many students.
Recordings
Mosgowenko has made a number of vinyl recordings since 1951. His main recordings are:
Mozart's clarinet quintet KV 581 with the Borodin Quartet, with whom he worked from 1951 to 1976. The recording was made in 1961. The artist played a German clarinet at the time and was committed to German clarinet-playing tradition. The recording is still available on CD.
the clarinet quintet by Brahms op. 115, also with the Borodin Quartet, recorded in 1969 (with Böhm clarinet), available on CD.
the clarinet quintet by the contemporary Russian composer Alexander Lokshin, recorded in 1960 with the Komitas Quartet, available on CD.
Sergei Prokofjew, Overture on Hebrew themes op. 34, with Sviatoslav Richter, Piano, in: Sviatoslav Richter – Plays Rakhmaninov & Prokofiev, 11 CDs, CD Nr. 11/1 (another compilation: )
There are also a number of radio recordings.
Explanatory notes
References
External links
Clarinet Competition 2019
1924 births
2021 deaths
20th-century clarinetists
20th-century Russian male musicians
21st-century clarinetists
21st-century Russian male musicians
People from Yashaltinsky District
Russian clarinetists
Soviet military personnel of World War II |
In the 2015–16 season, Espérance Sportive de Tunis competed in the Ligue 1 for the 61st season, as well as the Tunisian Cup. It was their 61st consecutive season in the top flight of Tunisian football. They competed in Ligue 1, the Confederation Cup and the Tunisian Cup.
Squad list
Players and squad numbers last updated on 16 September 2015.Note: Flags indicate national team as has been defined under FIFA eligibility rules. Players may hold more than one non-FIFA nationality.
Competitions
Overview
{| class="wikitable" style="text-align: center"
|-
!rowspan=2|Competition
!colspan=8|Record
!rowspan=2|Started round
!rowspan=2|Final position / round
!rowspan=2|First match
!rowspan=2|Last match
|-
!
!
!
!
!
!
!
!
|-
| Ligue 1
|
| style="background:silver;"| Runners–up
| 16 September 2015
| 12 June 2016
|-
| 2015 Tunisian Cup
| Round of 16
| Quarter-finals
| 5 August 2015
| 16 August 2015
|-
| 2016 Tunisian Cup
| Round of 32
| Round of 16
| 30 January 2016
| 7 February 2016
|-
| 2015 Confederation Cup
| colspan=2| Group stage
| 28 June 2015
| 12 September 2015
|-
| 2016 Confederation Cup
| First round
| Play-off round
| 12 March 2016
| 17 May 2016
|-
! Total
Ligue 1
League table
Results summary
Results by round
Matches
2015 Tunisian Cup
2016 Tunisian Cup
2015 Confederation Cup
Group stage
Group A
2016 Confederation Cup
First round
Second round
Play-off round
Squad information
Playing statistics
|-
! colspan=12 style=background:#dcdcdc; text-align:center| Goalkeepers
|-
! colspan=12 style=background:#dcdcdc; text-align:center| Defenders
|-
! colspan=12 style=background:#dcdcdc; text-align:center| Midfielders
|-
! colspan=12 style=background:#dcdcdc; text-align:center| Forwards
|-
! colspan=12 style=background:#dcdcdc; text-align:center| Players transferred out during the season
Goalscorers
Includes all competitive matches. The list is sorted alphabetically by surname when total goals are equal.
Transfers
In
Out
References
2015-16
Tunisian football clubs 2015–16 season |
This is a list of the Iceland national football team results from 1946 to 1959. Only games against full national sides are counted.
1940s
1946
1947
1948
1949
1950s
1951
1953
1954
1955
1956
References
Iceland national football team results
1940s in Iceland
1950s in Iceland |
Hollywood-Monster (working title - released as Ghost Chase in the United States) is a 1987 horror comedy film directed by Roland Emmerich, about a film crew working in a haunted mansion. Emmerich's third film, it starred Jason Lively, Jill Whitlow, Paul Gleason, Chuck Mitchell, and Tim McDaniel.
A co-production between West Germany and the United States, the film was released theatrically in Germany on June 25, 1987.
Plot
Two cousins, Fred and Warren, live together in Hollywood. Fred, an aspiring horror-movie director with developed skills in SFX and animatronics, desperately tries to shoot his first movie in their house, but Warren, who plays the main male protagonist, keeps on flirting with Laurie, the main actress. When she can't stand it anymore, the project is over, and the bills are pilling up.
Out of the blue, Warren is called out to the reading of his grandfather's will and testament. The boys end up with an old clock, inhabited with the spirit of Louis, Warren's grandfather's deformed butler. The benevolent spirit, having appeared to Fred in the night, shows him a flashback of the day he and Warren's grandfather Karl died. Karl poisoned himself, and sealed himself in the basement with all his money to prevent his family from getting any. The butler coincidentally died by falling down stairs. The dream inspires Fred in making a new script for which he builds an animatronic version of the butler, whose spirit proceedes to inhabit the artificial body.
The butler and the boys will help each other as they face a new problem: the son of Warren's grandfather's partner who managed to swindle Warren's family out of their property, Producer Stan Gordon, who wants the grandfather's heritage to be kept secret, and try to get Fred's new movie made. It will all end in a race against the clock in an old house basement, and a fight against a demented ghost armor, as the movie pays homage to the late 1950s-to-1970s science fiction B movies.
Cast
Jason Lively as Warren McCloud
Tim McDaniel as Fred
Jill Whitlow as Laurie Sanders
Leonard Lansink as Karl
Paul Gleason as Stan Gordon
Ian MacNaughton as Frederick McCloud
Chuck Mitchell as Mr. Rosenbaum
Cynthia Frost as Secretary
Andreas Kovac-Zemen as Pawn Shop Owner
Toby Kaye as Laurie's Girlfriend
Ernie Lively as Production Manager
Julian Curry as Lawyer
Larry Pennell as Bum
Home Media
Ghost Chase was released on video cassette in the United States on February 7, 1990 by M.C.E.G. Virgin Home Entertainment. On March 13, 2001, the film was released on DVD by Image Entertainment.
References
External links
Films directed by Roland Emmerich
1987 comedy horror films
1980s ghost films
Films about Hollywood, Los Angeles
1987 films
1980s English-language films
English-language German films
Films with screenplays by Roland Emmerich
Films about filmmaking
Films about inheritances
Domestic workers in films
Films about spirit possession
English-language comedy horror films |
```python
# Owner(s): ["module: dynamo"]
import functools
import operator
import re
import sys
import warnings
from itertools import product
from unittest import expectedFailure as xfail, skipIf as skipif, SkipTest
import pytest
from pytest import raises as assert_raises
from torch.testing._internal.common_utils import (
instantiate_parametrized_tests,
parametrize,
run_tests,
skipIfTorchDynamo,
TEST_WITH_TORCHDYNAMO,
TestCase,
xpassIfTorchDynamo,
)
if TEST_WITH_TORCHDYNAMO:
import numpy as np
from numpy.testing import (
assert_,
assert_array_equal,
assert_equal,
assert_warns,
HAS_REFCOUNT,
)
else:
import torch._numpy as np
from torch._numpy.testing import (
assert_,
assert_array_equal,
assert_equal,
assert_warns,
HAS_REFCOUNT,
)
skip = functools.partial(skipif, True)
@instantiate_parametrized_tests
class TestIndexing(TestCase):
def test_index_no_floats(self):
a = np.array([[[5]]])
assert_raises(IndexError, lambda: a[0.0])
assert_raises(IndexError, lambda: a[0, 0.0])
assert_raises(IndexError, lambda: a[0.0, 0])
assert_raises(IndexError, lambda: a[0.0, :])
assert_raises(IndexError, lambda: a[:, 0.0])
assert_raises(IndexError, lambda: a[:, 0.0, :])
assert_raises(IndexError, lambda: a[0.0, :, :])
assert_raises(IndexError, lambda: a[0, 0, 0.0])
assert_raises(IndexError, lambda: a[0.0, 0, 0])
assert_raises(IndexError, lambda: a[0, 0.0, 0])
assert_raises(IndexError, lambda: a[-1.4])
assert_raises(IndexError, lambda: a[0, -1.4])
assert_raises(IndexError, lambda: a[-1.4, 0])
assert_raises(IndexError, lambda: a[-1.4, :])
assert_raises(IndexError, lambda: a[:, -1.4])
assert_raises(IndexError, lambda: a[:, -1.4, :])
assert_raises(IndexError, lambda: a[-1.4, :, :])
assert_raises(IndexError, lambda: a[0, 0, -1.4])
assert_raises(IndexError, lambda: a[-1.4, 0, 0])
assert_raises(IndexError, lambda: a[0, -1.4, 0])
# Note torch validates index arguments "depth-first", so will prioritise
# raising TypeError over IndexError, e.g.
#
# >>> a = np.array([[[5]]])
# >>> a[0.0:, 0.0]
# IndexError: only integers, slices (`:`), ellipsis (`...`),
# numpy.newaxis # (`None`) and integer or boolean arrays are
# valid indices
# >>> t = torch.as_tensor([[[5]]]) # identical to a
# >>> t[0.0:, 0.0]
# TypeError: slice indices must be integers or None or have an
# __index__ method
#
assert_raises((IndexError, TypeError), lambda: a[0.0:, 0.0])
assert_raises((IndexError, TypeError), lambda: a[0.0:, 0.0, :])
def test_slicing_no_floats(self):
a = np.array([[5]])
# start as float.
assert_raises(TypeError, lambda: a[0.0:])
assert_raises(TypeError, lambda: a[0:, 0.0:2])
assert_raises(TypeError, lambda: a[0.0::2, :0])
assert_raises(TypeError, lambda: a[0.0:1:2, :])
assert_raises(TypeError, lambda: a[:, 0.0:])
# stop as float.
assert_raises(TypeError, lambda: a[:0.0])
assert_raises(TypeError, lambda: a[:0, 1:2.0])
assert_raises(TypeError, lambda: a[:0.0:2, :0])
assert_raises(TypeError, lambda: a[:0.0, :])
assert_raises(TypeError, lambda: a[:, 0:4.0:2])
# step as float.
assert_raises(TypeError, lambda: a[::1.0])
assert_raises(TypeError, lambda: a[0:, :2:2.0])
assert_raises(TypeError, lambda: a[1::4.0, :0])
assert_raises(TypeError, lambda: a[::5.0, :])
assert_raises(TypeError, lambda: a[:, 0:4:2.0])
# mixed.
assert_raises(TypeError, lambda: a[1.0:2:2.0])
assert_raises(TypeError, lambda: a[1.0::2.0])
assert_raises(TypeError, lambda: a[0:, :2.0:2.0])
assert_raises(TypeError, lambda: a[1.0:1:4.0, :0])
assert_raises(TypeError, lambda: a[1.0:5.0:5.0, :])
assert_raises(TypeError, lambda: a[:, 0.4:4.0:2.0])
# should still get the DeprecationWarning if step = 0.
assert_raises(TypeError, lambda: a[::0.0])
@skip(reason="torch allows slicing with non-0d array components")
def test_index_no_array_to_index(self):
# No non-scalar arrays.
a = np.array([[[1]]])
assert_raises(TypeError, lambda: a[a:a:a])
# Conversely, using scalars doesn't raise in NumPy, e.g.
#
# >>> i = np.int64(1)
# >>> a[i:i:i]
# array([], shape=(0, 1, 1), dtype=int64)
#
def test_none_index(self):
# `None` index adds newaxis
a = np.array([1, 2, 3])
assert_equal(a[None], a[np.newaxis])
assert_equal(a[None].ndim, a.ndim + 1)
@skip
def test_empty_tuple_index(self):
# Empty tuple index creates a view
a = np.array([1, 2, 3])
assert_equal(a[()], a)
assert_(a[()].tensor._base is a.tensor)
a = np.array(0)
assert_(isinstance(a[()], np.int_))
def test_same_kind_index_casting(self):
# Indexes should be cast with same-kind and not safe, even if that
# is somewhat unsafe. So test various different code paths.
index = np.arange(5)
u_index = index.astype(np.uint8) # i.e. cast to default uint indexing dtype
arr = np.arange(10)
assert_array_equal(arr[index], arr[u_index])
arr[u_index] = np.arange(5)
assert_array_equal(arr, np.arange(10))
arr = np.arange(10).reshape(5, 2)
assert_array_equal(arr[index], arr[u_index])
arr[u_index] = np.arange(5)[:, None]
assert_array_equal(arr, np.arange(5)[:, None].repeat(2, axis=1))
arr = np.arange(25).reshape(5, 5)
assert_array_equal(arr[u_index, u_index], arr[index, index])
def test_empty_fancy_index(self):
# Empty list index creates an empty array
# with the same dtype (but with weird shape)
a = np.array([1, 2, 3])
assert_equal(a[[]], [])
assert_equal(a[[]].dtype, a.dtype)
b = np.array([], dtype=np.intp)
assert_equal(a[[]], [])
assert_equal(a[[]].dtype, a.dtype)
b = np.array([])
assert_raises(IndexError, a.__getitem__, b)
def test_ellipsis_index(self):
a = np.array([[1, 2, 3], [4, 5, 6], [7, 8, 9]])
assert_(a[...] is not a)
assert_equal(a[...], a)
# `a[...]` was `a` in numpy <1.9.
# Slicing with ellipsis can skip an
# arbitrary number of dimensions
assert_equal(a[0, ...], a[0])
assert_equal(a[0, ...], a[0, :])
assert_equal(a[..., 0], a[:, 0])
# Slicing with ellipsis always results
# in an array, not a scalar
assert_equal(a[0, ..., 1], np.array(2))
# Assignment with `(Ellipsis,)` on 0-d arrays
b = np.array(1)
b[(Ellipsis,)] = 2
assert_equal(b, 2)
@xpassIfTorchDynamo # 'torch_.np.array() does not have base attribute.
def test_ellipsis_index_2(self):
a = np.array([[1, 2, 3], [4, 5, 6], [7, 8, 9]])
assert_(a[...] is not a)
assert_equal(a[...], a)
# `a[...]` was `a` in numpy <1.9.
assert_(a[...].base is a)
def test_single_int_index(self):
# Single integer index selects one row
a = np.array([[1, 2, 3], [4, 5, 6], [7, 8, 9]])
assert_equal(a[0], [1, 2, 3])
assert_equal(a[-1], [7, 8, 9])
# Index out of bounds produces IndexError
assert_raises(IndexError, a.__getitem__, 1 << 30)
# Index overflow produces IndexError
# Note torch raises RuntimeError here
assert_raises((IndexError, RuntimeError), a.__getitem__, 1 << 64)
def test_single_bool_index(self):
# Single boolean index
a = np.array([[1, 2, 3], [4, 5, 6], [7, 8, 9]])
assert_equal(a[np.array(True)], a[None])
assert_equal(a[np.array(False)], a[None][0:0])
def test_boolean_shape_mismatch(self):
arr = np.ones((5, 4, 3))
index = np.array([True])
assert_raises(IndexError, arr.__getitem__, index)
index = np.array([False] * 6)
assert_raises(IndexError, arr.__getitem__, index)
index = np.zeros((4, 4), dtype=bool)
assert_raises(IndexError, arr.__getitem__, index)
assert_raises(IndexError, arr.__getitem__, (slice(None), index))
def test_boolean_indexing_onedim(self):
# Indexing a 2-dimensional array with
# boolean array of length one
a = np.array([[0.0, 0.0, 0.0]])
b = np.array([True], dtype=bool)
assert_equal(a[b], a)
# boolean assignment
a[b] = 1.0
assert_equal(a, [[1.0, 1.0, 1.0]])
@skip(reason="NP_VER: fails on CI")
def test_boolean_assignment_value_mismatch(self):
# A boolean assignment should fail when the shape of the values
# cannot be broadcast to the subscription. (see also gh-3458)
a = np.arange(4)
def f(a, v):
a[a > -1] = v
assert_raises((RuntimeError, ValueError, TypeError), f, a, [])
assert_raises((RuntimeError, ValueError, TypeError), f, a, [1, 2, 3])
assert_raises((RuntimeError, ValueError, TypeError), f, a[:1], [1, 2, 3])
def test_boolean_indexing_twodim(self):
# Indexing a 2-dimensional array with
# 2-dimensional boolean array
a = np.array([[1, 2, 3], [4, 5, 6], [7, 8, 9]])
b = np.array([[True, False, True], [False, True, False], [True, False, True]])
assert_equal(a[b], [1, 3, 5, 7, 9])
assert_equal(a[b[1]], [[4, 5, 6]])
assert_equal(a[b[0]], a[b[2]])
# boolean assignment
a[b] = 0
assert_equal(a, [[0, 2, 0], [4, 0, 6], [0, 8, 0]])
def test_boolean_indexing_list(self):
# Regression test for #13715. It's a use-after-free bug which the
# test won't directly catch, but it will show up in valgrind.
a = np.array([1, 2, 3])
b = [True, False, True]
# Two variants of the test because the first takes a fast path
assert_equal(a[b], [1, 3])
assert_equal(a[None, b], [[1, 3]])
def test_reverse_strides_and_subspace_bufferinit(self):
# This tests that the strides are not reversed for simple and
# subspace fancy indexing.
a = np.ones(5)
b = np.zeros(5, dtype=np.intp)[::-1]
c = np.arange(5)[::-1]
a[b] = c
# If the strides are not reversed, the 0 in the arange comes last.
assert_equal(a[0], 0)
# This also tests that the subspace buffer is initialized:
a = np.ones((5, 2))
c = np.arange(10).reshape(5, 2)[::-1]
a[b, :] = c
assert_equal(a[0], [0, 1])
def test_reversed_strides_result_allocation(self):
# Test a bug when calculating the output strides for a result array
# when the subspace size was 1 (and test other cases as well)
a = np.arange(10)[:, None]
i = np.arange(10)[::-1]
assert_array_equal(a[i], a[i.copy("C")])
a = np.arange(20).reshape(-1, 2)
def test_uncontiguous_subspace_assignment(self):
# During development there was a bug activating a skip logic
# based on ndim instead of size.
a = np.full((3, 4, 2), -1)
b = np.full((3, 4, 2), -1)
a[[0, 1]] = np.arange(2 * 4 * 2).reshape(2, 4, 2).T
b[[0, 1]] = np.arange(2 * 4 * 2).reshape(2, 4, 2).T.copy()
assert_equal(a, b)
@skip(reason="torch does not limit dims to 32")
def test_too_many_fancy_indices_special_case(self):
# Just documents behaviour, this is a small limitation.
a = np.ones((1,) * 32) # 32 is NPY_MAXDIMS
assert_raises(IndexError, a.__getitem__, (np.array([0]),) * 32)
def test_scalar_array_bool(self):
# NumPy bools can be used as boolean index (python ones as of yet not)
a = np.array(1)
assert_equal(a[np.bool_(True)], a[np.array(True)])
assert_equal(a[np.bool_(False)], a[np.array(False)])
# After deprecating bools as integers:
# a = np.array([0,1,2])
# assert_equal(a[True, :], a[None, :])
# assert_equal(a[:, True], a[:, None])
#
# assert_(not np.may_share_memory(a, a[True, :]))
def test_everything_returns_views(self):
# Before `...` would return a itself.
a = np.arange(5)
assert_(a is not a[()])
assert_(a is not a[...])
assert_(a is not a[:])
def test_broaderrors_indexing(self):
a = np.zeros((5, 5))
assert_raises(IndexError, a.__getitem__, ([0, 1], [0, 1, 2]))
assert_raises(IndexError, a.__setitem__, ([0, 1], [0, 1, 2]), 0)
def test_trivial_fancy_out_of_bounds(self):
a = np.zeros(5)
ind = np.ones(20, dtype=np.intp)
ind[-1] = 10
assert_raises(IndexError, a.__getitem__, ind)
assert_raises((IndexError, RuntimeError), a.__setitem__, ind, 0)
ind = np.ones(20, dtype=np.intp)
ind[0] = 11
assert_raises(IndexError, a.__getitem__, ind)
assert_raises((IndexError, RuntimeError), a.__setitem__, ind, 0)
def test_trivial_fancy_not_possible(self):
# Test that the fast path for trivial assignment is not incorrectly
# used when the index is not contiguous or 1D, see also gh-11467.
a = np.arange(6)
idx = np.arange(6, dtype=np.intp).reshape(2, 1, 3)[:, :, 0]
assert_array_equal(a[idx], idx)
# this case must not go into the fast path, note that idx is
# a non-contiuguous none 1D array here.
a[idx] = -1
res = np.arange(6)
res[0] = -1
res[3] = -1
assert_array_equal(a, res)
def test_memory_order(self):
# This is not necessary to preserve. Memory layouts for
# more complex indices are not as simple.
a = np.arange(10)
b = np.arange(10).reshape(5, 2).T
assert_(a[b].flags.f_contiguous)
# Takes a different implementation branch:
a = a.reshape(-1, 1)
assert_(a[b, 0].flags.f_contiguous)
@skipIfTorchDynamo() # XXX: flaky, depends on implementation details
def test_small_regressions(self):
# Reference count of intp for index checks
a = np.array([0])
if HAS_REFCOUNT:
refcount = sys.getrefcount(np.dtype(np.intp))
# item setting always checks indices in separate function:
a[np.array([0], dtype=np.intp)] = 1
a[np.array([0], dtype=np.uint8)] = 1
assert_raises(IndexError, a.__setitem__, np.array([1], dtype=np.intp), 1)
assert_raises(IndexError, a.__setitem__, np.array([1], dtype=np.uint8), 1)
if HAS_REFCOUNT:
assert_equal(sys.getrefcount(np.dtype(np.intp)), refcount)
def test_tuple_subclass(self):
arr = np.ones((5, 5))
# A tuple subclass should also be an nd-index
class TupleSubclass(tuple):
pass
index = ([1], [1])
index = TupleSubclass(index)
assert_(arr[index].shape == (1,))
# Unlike the non nd-index:
assert_(arr[index,].shape != (1,))
@xpassIfTorchDynamo # (reason="XXX: low-prio behaviour to support")
def test_broken_sequence_not_nd_index(self):
# See path_to_url
# If we have an object which claims to be a sequence, but fails
# on item getting, this should not be converted to an nd-index (tuple)
# If this object happens to be a valid index otherwise, it should work
# This object here is very dubious and probably bad though:
class SequenceLike:
def __index__(self):
return 0
def __len__(self):
return 1
def __getitem__(self, item):
raise IndexError("Not possible")
arr = np.arange(10)
assert_array_equal(arr[SequenceLike()], arr[SequenceLike(),])
# also test that field indexing does not segfault
# for a similar reason, by indexing a structured array
arr = np.zeros((1,), dtype=[("f1", "i8"), ("f2", "i8")])
assert_array_equal(arr[SequenceLike()], arr[SequenceLike(),])
def test_indexing_array_weird_strides(self):
# See also gh-6221
# the shapes used here come from the issue and create the correct
# size for the iterator buffering size.
x = np.ones(10)
x2 = np.ones((10, 2))
ind = np.arange(10)[:, None, None, None]
ind = np.broadcast_to(ind, (10, 55, 4, 4))
# single advanced index case
assert_array_equal(x[ind], x[ind.copy()])
# higher dimensional advanced index
zind = np.zeros(4, dtype=np.intp)
assert_array_equal(x2[ind, zind], x2[ind.copy(), zind])
def test_indexing_array_negative_strides(self):
# From gh-8264,
# core dumps if negative strides are used in iteration
arro = np.zeros((4, 4))
arr = arro[::-1, ::-1]
slices = (slice(None), [0, 1, 2, 3])
arr[slices] = 10
assert_array_equal(arr, 10.0)
@parametrize("index", [True, False, np.array([0])])
@parametrize("num", [32, 40])
@parametrize("original_ndim", [1, 32])
def test_too_many_advanced_indices(self, index, num, original_ndim):
# These are limitations based on the number of arguments we can process.
# For `num=32` (and all boolean cases), the result is actually define;
# but the use of NpyIter (NPY_MAXARGS) limits it for technical reasons.
if not (isinstance(index, np.ndarray) and original_ndim < num):
# unskipped cases fail because of assigning too many indices
raise SkipTest("torch does not limit dims to 32")
arr = np.ones((1,) * original_ndim)
with pytest.raises(IndexError):
arr[(index,) * num]
with pytest.raises(IndexError):
arr[(index,) * num] = 1.0
def test_nontuple_ndindex(self):
a = np.arange(25).reshape((5, 5))
assert_equal(a[[0, 1]], np.array([a[0], a[1]]))
assert_equal(a[[0, 1], [0, 1]], np.array([0, 6]))
raise SkipTest(
"torch happily consumes non-tuple sequences with multi-axis "
"indices (i.e. slices) as an index, whereas NumPy invalidates "
"them, assumedly to keep things simple. This invalidation "
"behaviour is just too niche to bother emulating."
)
assert_raises(IndexError, a.__getitem__, [slice(None)])
@instantiate_parametrized_tests
class TestBroadcastedAssignments(TestCase):
def assign(self, a, ind, val):
a[ind] = val
return a
def test_prepending_ones(self):
a = np.zeros((3, 2))
a[...] = np.ones((1, 3, 2))
# Fancy with subspace with and without transpose
a[[0, 1, 2], :] = np.ones((1, 3, 2))
a[:, [0, 1]] = np.ones((1, 3, 2))
# Fancy without subspace (with broadcasting)
a[[[0], [1], [2]], [0, 1]] = np.ones((1, 3, 2))
def test_prepend_not_one(self):
assign = self.assign
s_ = np.s_
a = np.zeros(5)
# Too large and not only ones.
try:
assign(a, s_[...], np.ones((2, 1)))
except Exception as e:
self.assertTrue(isinstance(e, (ValueError, RuntimeError)))
assert_raises(
(ValueError, RuntimeError), assign, a, s_[[1, 2, 3],], np.ones((2, 1))
)
assert_raises(
(ValueError, RuntimeError), assign, a, s_[[[1], [2]],], np.ones((2, 2, 1))
)
def test_simple_broadcasting_errors(self):
assign = self.assign
s_ = np.s_
a = np.zeros((5, 1))
try:
assign(a, s_[...], np.zeros((5, 2)))
except Exception as e:
self.assertTrue(isinstance(e, (ValueError, RuntimeError)))
try:
assign(a, s_[...], np.zeros((5, 0)))
except Exception as e:
self.assertTrue(isinstance(e, (ValueError, RuntimeError)))
assert_raises(
(ValueError, RuntimeError), assign, a, s_[:, [0]], np.zeros((5, 2))
)
assert_raises(
(ValueError, RuntimeError), assign, a, s_[:, [0]], np.zeros((5, 0))
)
assert_raises(
(ValueError, RuntimeError), assign, a, s_[[0], :], np.zeros((2, 1))
)
@parametrize(
"index", [(..., [1, 2], slice(None)), ([0, 1], ..., 0), (..., [1, 2], [1, 2])]
)
def test_broadcast_error_reports_correct_shape(self, index):
values = np.zeros((100, 100)) # will never broadcast below
arr = np.zeros((3, 4, 5, 6, 7))
with pytest.raises((ValueError, RuntimeError)) as e:
arr[index] = values
shape = arr[index].shape
r_inner_shape = "".join(f"{side}, ?" for side in shape[:-1]) + str(shape[-1])
assert re.search(rf"[\(\[]{r_inner_shape}[\]\)]$", str(e.value))
def test_index_is_larger(self):
# Simple case of fancy index broadcasting of the index.
a = np.zeros((5, 5))
a[[[0], [1], [2]], [0, 1, 2]] = [2, 3, 4]
assert_((a[:3, :3] == [2, 3, 4]).all())
def test_broadcast_subspace(self):
a = np.zeros((100, 100))
v = np.arange(100)[:, None]
b = np.arange(100)[::-1]
a[b] = v
assert_((a[::-1] == v).all())
class TestFancyIndexingCast(TestCase):
@xpassIfTorchDynamo # (
# reason="XXX: low-prio to support assigning complex values on floating arrays"
# )
def test_boolean_index_cast_assign(self):
# Setup the boolean index and float arrays.
shape = (8, 63)
bool_index = np.zeros(shape).astype(bool)
bool_index[0, 1] = True
zero_array = np.zeros(shape)
# Assigning float is fine.
zero_array[bool_index] = np.array([1])
assert_equal(zero_array[0, 1], 1)
# Fancy indexing works, although we get a cast warning.
assert_warns(
np.ComplexWarning, zero_array.__setitem__, ([0], [1]), np.array([2 + 1j])
)
assert_equal(zero_array[0, 1], 2) # No complex part
# Cast complex to float, throwing away the imaginary portion.
assert_warns(
np.ComplexWarning, zero_array.__setitem__, bool_index, np.array([1j])
)
assert_equal(zero_array[0, 1], 0)
@xfail # (reason="XXX: requires broadcast() and broadcast_to()")
class TestMultiIndexingAutomated(TestCase):
"""
These tests use code to mimic the C-Code indexing for selection.
NOTE:
* This still lacks tests for complex item setting.
* If you change behavior of indexing, you might want to modify
these tests to try more combinations.
* Behavior was written to match numpy version 1.8. (though a
first version matched 1.7.)
* Only tuple indices are supported by the mimicking code.
(and tested as of writing this)
* Error types should match most of the time as long as there
is only one error. For multiple errors, what gets raised
will usually not be the same one. They are *not* tested.
Update 2016-11-30: It is probably not worth maintaining this test
indefinitely and it can be dropped if maintenance becomes a burden.
"""
def setupUp(self):
self.a = np.arange(np.prod([3, 1, 5, 6])).reshape(3, 1, 5, 6)
self.b = np.empty((3, 0, 5, 6))
self.complex_indices = [
"skip",
Ellipsis,
0,
# Boolean indices, up to 3-d for some special cases of eating up
# dimensions, also need to test all False
np.array([True, False, False]),
np.array([[True, False], [False, True]]),
np.array([[[False, False], [False, False]]]),
# Some slices:
slice(-5, 5, 2),
slice(1, 1, 100),
slice(4, -1, -2),
slice(None, None, -3),
# Some Fancy indexes:
np.empty((0, 1, 1), dtype=np.intp), # empty and can be broadcast
np.array([0, 1, -2]),
np.array([[2], [0], [1]]),
np.array([[0, -1], [0, 1]], dtype=np.dtype("intp")),
np.array([2, -1], dtype=np.int8),
np.zeros([1] * 31, dtype=int), # trigger too large array.
np.array([0.0, 1.0]),
] # invalid datatype
# Some simpler indices that still cover a bit more
self.simple_indices = [Ellipsis, None, -1, [1], np.array([True]), "skip"]
# Very simple ones to fill the rest:
self.fill_indices = [slice(None, None), 0]
def _get_multi_index(self, arr, indices):
"""Mimic multi dimensional indexing.
Parameters
----------
arr : ndarray
Array to be indexed.
indices : tuple of index objects
Returns
-------
out : ndarray
An array equivalent to the indexing operation (but always a copy).
`arr[indices]` should be identical.
no_copy : bool
Whether the indexing operation requires a copy. If this is `True`,
`np.may_share_memory(arr, arr[indices])` should be `True` (with
some exceptions for scalars and possibly 0-d arrays).
Notes
-----
While the function may mostly match the errors of normal indexing this
is generally not the case.
"""
in_indices = list(indices)
indices = []
# if False, this is a fancy or boolean index
no_copy = True
# number of fancy/scalar indexes that are not consecutive
num_fancy = 0
# number of dimensions indexed by a "fancy" index
fancy_dim = 0
# NOTE: This is a funny twist (and probably OK to change).
# The boolean array has illegal indexes, but this is
# allowed if the broadcast fancy-indices are 0-sized.
# This variable is to catch that case.
error_unless_broadcast_to_empty = False
# We need to handle Ellipsis and make arrays from indices, also
# check if this is fancy indexing (set no_copy).
ndim = 0
ellipsis_pos = None # define here mostly to replace all but first.
for i, indx in enumerate(in_indices):
if indx is None:
continue
if isinstance(indx, np.ndarray) and indx.dtype == bool:
no_copy = False
if indx.ndim == 0:
raise IndexError
# boolean indices can have higher dimensions
ndim += indx.ndim
fancy_dim += indx.ndim
continue
if indx is Ellipsis:
if ellipsis_pos is None:
ellipsis_pos = i
continue # do not increment ndim counter
raise IndexError
if isinstance(indx, slice):
ndim += 1
continue
if not isinstance(indx, np.ndarray):
# This could be open for changes in numpy.
# numpy should maybe raise an error if casting to intp
# is not safe. It rejects np.array([1., 2.]) but not
# [1., 2.] as index (same for ie. np.take).
# (Note the importance of empty lists if changing this here)
try:
indx = np.array(indx, dtype=np.intp)
except ValueError:
raise IndexError from None
in_indices[i] = indx
elif indx.dtype.kind != "b" and indx.dtype.kind != "i":
raise IndexError(
"arrays used as indices must be of integer (or boolean) type"
)
if indx.ndim != 0:
no_copy = False
ndim += 1
fancy_dim += 1
if arr.ndim - ndim < 0:
# we can't take more dimensions then we have, not even for 0-d
# arrays. since a[()] makes sense, but not a[(),]. We will
# raise an error later on, unless a broadcasting error occurs
# first.
raise IndexError
if ndim == 0 and None not in in_indices:
# Well we have no indexes or one Ellipsis. This is legal.
return arr.copy(), no_copy
if ellipsis_pos is not None:
in_indices[ellipsis_pos : ellipsis_pos + 1] = [slice(None, None)] * (
arr.ndim - ndim
)
for ax, indx in enumerate(in_indices):
if isinstance(indx, slice):
# convert to an index array
indx = np.arange(*indx.indices(arr.shape[ax]))
indices.append(["s", indx])
continue
elif indx is None:
# this is like taking a slice with one element from a new axis:
indices.append(["n", np.array([0], dtype=np.intp)])
arr = arr.reshape(arr.shape[:ax] + (1,) + arr.shape[ax:])
continue
if isinstance(indx, np.ndarray) and indx.dtype == bool:
if indx.shape != arr.shape[ax : ax + indx.ndim]:
raise IndexError
try:
flat_indx = np.ravel_multi_index(
np.nonzero(indx), arr.shape[ax : ax + indx.ndim], mode="raise"
)
except Exception:
error_unless_broadcast_to_empty = True
# fill with 0s instead, and raise error later
flat_indx = np.array([0] * indx.sum(), dtype=np.intp)
# concatenate axis into a single one:
if indx.ndim != 0:
arr = arr.reshape(
arr.shape[:ax]
+ (np.prod(arr.shape[ax : ax + indx.ndim]),)
+ arr.shape[ax + indx.ndim :]
)
indx = flat_indx
else:
# This could be changed, a 0-d boolean index can
# make sense (even outside the 0-d indexed array case)
# Note that originally this is could be interpreted as
# integer in the full integer special case.
raise IndexError
else:
# If the index is a singleton, the bounds check is done
# before the broadcasting. This used to be different in <1.9
if indx.ndim == 0:
if indx >= arr.shape[ax] or indx < -arr.shape[ax]:
raise IndexError
if indx.ndim == 0:
# The index is a scalar. This used to be two fold, but if
# fancy indexing was active, the check was done later,
# possibly after broadcasting it away (1.7. or earlier).
# Now it is always done.
if indx >= arr.shape[ax] or indx < -arr.shape[ax]:
raise IndexError
if len(indices) > 0 and indices[-1][0] == "f" and ax != ellipsis_pos:
# NOTE: There could still have been a 0-sized Ellipsis
# between them. Checked that with ellipsis_pos.
indices[-1].append(indx)
else:
# We have a fancy index that is not after an existing one.
# NOTE: A 0-d array triggers this as well, while one may
# expect it to not trigger it, since a scalar would not be
# considered fancy indexing.
num_fancy += 1
indices.append(["f", indx])
if num_fancy > 1 and not no_copy:
# We have to flush the fancy indexes left
new_indices = indices[:]
axes = list(range(arr.ndim))
fancy_axes = []
new_indices.insert(0, ["f"])
ni = 0
ai = 0
for indx in indices:
ni += 1
if indx[0] == "f":
new_indices[0].extend(indx[1:])
del new_indices[ni]
ni -= 1
for ax in range(ai, ai + len(indx[1:])):
fancy_axes.append(ax)
axes.remove(ax)
ai += len(indx) - 1 # axis we are at
indices = new_indices
# and now we need to transpose arr:
arr = arr.transpose(*(fancy_axes + axes))
# We only have one 'f' index now and arr is transposed accordingly.
# Now handle newaxis by reshaping...
ax = 0
for indx in indices:
if indx[0] == "f":
if len(indx) == 1:
continue
# First of all, reshape arr to combine fancy axes into one:
orig_shape = arr.shape
orig_slice = orig_shape[ax : ax + len(indx[1:])]
arr = arr.reshape(
arr.shape[:ax]
+ (np.prod(orig_slice).astype(int),)
+ arr.shape[ax + len(indx[1:]) :]
)
# Check if broadcasting works
res = np.broadcast(*indx[1:])
# unfortunately the indices might be out of bounds. So check
# that first, and use mode='wrap' then. However only if
# there are any indices...
if res.size != 0:
if error_unless_broadcast_to_empty:
raise IndexError
for _indx, _size in zip(indx[1:], orig_slice):
if _indx.size == 0:
continue
if np.any(_indx >= _size) or np.any(_indx < -_size):
raise IndexError
if len(indx[1:]) == len(orig_slice):
if np.prod(orig_slice) == 0:
# Work around for a crash or IndexError with 'wrap'
# in some 0-sized cases.
try:
mi = np.ravel_multi_index(
indx[1:], orig_slice, mode="raise"
)
except Exception as exc:
# This happens with 0-sized orig_slice (sometimes?)
# here it is a ValueError, but indexing gives a:
raise IndexError("invalid index into 0-sized") from exc
else:
mi = np.ravel_multi_index(indx[1:], orig_slice, mode="wrap")
else:
# Maybe never happens...
raise ValueError
arr = arr.take(mi.ravel(), axis=ax)
try:
arr = arr.reshape(arr.shape[:ax] + mi.shape + arr.shape[ax + 1 :])
except ValueError:
# too many dimensions, probably
raise IndexError from None
ax += mi.ndim
continue
# If we are here, we have a 1D array for take:
arr = arr.take(indx[1], axis=ax)
ax += 1
return arr, no_copy
def _check_multi_index(self, arr, index):
"""Check a multi index item getting and simple setting.
Parameters
----------
arr : ndarray
Array to be indexed, must be a reshaped arange.
index : tuple of indexing objects
Index being tested.
"""
# Test item getting
try:
mimic_get, no_copy = self._get_multi_index(arr, index)
except Exception as e:
if HAS_REFCOUNT:
prev_refcount = sys.getrefcount(arr)
assert_raises(type(e), arr.__getitem__, index)
assert_raises(type(e), arr.__setitem__, index, 0)
if HAS_REFCOUNT:
assert_equal(prev_refcount, sys.getrefcount(arr))
return
self._compare_index_result(arr, index, mimic_get, no_copy)
def _check_single_index(self, arr, index):
"""Check a single index item getting and simple setting.
Parameters
----------
arr : ndarray
Array to be indexed, must be an arange.
index : indexing object
Index being tested. Must be a single index and not a tuple
of indexing objects (see also `_check_multi_index`).
"""
try:
mimic_get, no_copy = self._get_multi_index(arr, (index,))
except Exception as e:
if HAS_REFCOUNT:
prev_refcount = sys.getrefcount(arr)
assert_raises(type(e), arr.__getitem__, index)
assert_raises(type(e), arr.__setitem__, index, 0)
if HAS_REFCOUNT:
assert_equal(prev_refcount, sys.getrefcount(arr))
return
self._compare_index_result(arr, index, mimic_get, no_copy)
def _compare_index_result(self, arr, index, mimic_get, no_copy):
"""Compare mimicked result to indexing result."""
raise SkipTest("torch does not support subclassing")
arr = arr.copy()
indexed_arr = arr[index]
assert_array_equal(indexed_arr, mimic_get)
# Check if we got a view, unless its a 0-sized or 0-d array.
# (then its not a view, and that does not matter)
if indexed_arr.size != 0 and indexed_arr.ndim != 0:
assert_(np.may_share_memory(indexed_arr, arr) == no_copy)
# Check reference count of the original array
if HAS_REFCOUNT:
if no_copy:
# refcount increases by one:
assert_equal(sys.getrefcount(arr), 3)
else:
assert_equal(sys.getrefcount(arr), 2)
# Test non-broadcast setitem:
b = arr.copy()
b[index] = mimic_get + 1000
if b.size == 0:
return # nothing to compare here...
if no_copy and indexed_arr.ndim != 0:
# change indexed_arr in-place to manipulate original:
indexed_arr += 1000
assert_array_equal(arr, b)
return
# Use the fact that the array is originally an arange:
arr.flat[indexed_arr.ravel()] += 1000
assert_array_equal(arr, b)
def test_boolean(self):
a = np.array(5)
assert_equal(a[np.array(True)], 5)
a[np.array(True)] = 1
assert_equal(a, 1)
# NOTE: This is different from normal broadcasting, as
# arr[boolean_array] works like in a multi index. Which means
# it is aligned to the left. This is probably correct for
# consistency with arr[boolean_array,] also no broadcasting
# is done at all
self._check_multi_index(self.a, (np.zeros_like(self.a, dtype=bool),))
self._check_multi_index(self.a, (np.zeros_like(self.a, dtype=bool)[..., 0],))
self._check_multi_index(self.a, (np.zeros_like(self.a, dtype=bool)[None, ...],))
def test_multidim(self):
# Automatically test combinations with complex indexes on 2nd (or 1st)
# spot and the simple ones in one other spot.
with warnings.catch_warnings():
# This is so that np.array(True) is not accepted in a full integer
# index, when running the file separately.
warnings.filterwarnings("error", "", DeprecationWarning)
warnings.filterwarnings("error", "", np.VisibleDeprecationWarning)
def isskip(idx):
return isinstance(idx, str) and idx == "skip"
for simple_pos in [0, 2, 3]:
tocheck = [
self.fill_indices,
self.complex_indices,
self.fill_indices,
self.fill_indices,
]
tocheck[simple_pos] = self.simple_indices
for index in product(*tocheck):
index = tuple(i for i in index if not isskip(i))
self._check_multi_index(self.a, index)
self._check_multi_index(self.b, index)
# Check very simple item getting:
self._check_multi_index(self.a, (0, 0, 0, 0))
self._check_multi_index(self.b, (0, 0, 0, 0))
# Also check (simple cases of) too many indices:
assert_raises(IndexError, self.a.__getitem__, (0, 0, 0, 0, 0))
assert_raises(IndexError, self.a.__setitem__, (0, 0, 0, 0, 0), 0)
assert_raises(IndexError, self.a.__getitem__, (0, 0, [1], 0, 0))
assert_raises(IndexError, self.a.__setitem__, (0, 0, [1], 0, 0), 0)
def test_1d(self):
a = np.arange(10)
for index in self.complex_indices:
self._check_single_index(a, index)
class TestFloatNonIntegerArgument(TestCase):
"""
These test that ``TypeError`` is raised when you try to use
non-integers as arguments to for indexing and slicing e.g. ``a[0.0:5]``
and ``a[0.5]``, or other functions like ``array.reshape(1., -1)``.
"""
def test_valid_indexing(self):
# These should raise no errors.
a = np.array([[[5]]])
a[np.array([0])]
a[[0, 0]]
a[:, [0, 0]]
a[:, 0, :]
a[:, :, :]
def test_valid_slicing(self):
# These should raise no errors.
a = np.array([[[5]]])
a[::]
a[0:]
a[:2]
a[0:2]
a[::2]
a[1::2]
a[:2:2]
a[1:2:2]
def test_non_integer_argument_errors(self):
a = np.array([[5]])
assert_raises(TypeError, np.reshape, a, (1.0, 1.0, -1))
assert_raises(TypeError, np.reshape, a, (np.array(1.0), -1))
assert_raises(TypeError, np.take, a, [0], 1.0)
assert_raises((TypeError, RuntimeError), np.take, a, [0], np.float64(1.0))
@skip(
reason=("torch doesn't have scalar types with distinct element-wise behaviours")
)
def test_non_integer_sequence_multiplication(self):
# NumPy scalar sequence multiply should not work with non-integers
def mult(a, b):
return a * b
assert_raises(TypeError, mult, [1], np.float64(3))
# following should be OK
mult([1], np.int_(3))
def test_reduce_axis_float_index(self):
d = np.zeros((3, 3, 3))
assert_raises(TypeError, np.min, d, 0.5)
assert_raises(TypeError, np.min, d, (0.5, 1))
assert_raises(TypeError, np.min, d, (1, 2.2))
assert_raises(TypeError, np.min, d, (0.2, 1.2))
class TestBooleanIndexing(TestCase):
# Using a boolean as integer argument/indexing is an error.
def test_bool_as_int_argument_errors(self):
a = np.array([[[1]]])
assert_raises(TypeError, np.reshape, a, (True, -1))
# Note that operator.index(np.array(True)) does not work, a boolean
# array is thus also deprecated, but not with the same message:
# assert_warns(DeprecationWarning, operator.index, np.True_)
assert_raises(TypeError, np.take, args=(a, [0], False))
raise SkipTest("torch consumes boolean tensors as ints, no bother raising here")
assert_raises(TypeError, np.reshape, a, (np.bool_(True), -1))
assert_raises(TypeError, operator.index, np.array(True))
def test_boolean_indexing_weirdness(self):
# Weird boolean indexing things
a = np.ones((2, 3, 4))
assert a[False, True, ...].shape == (0, 2, 3, 4)
assert a[True, [0, 1], True, True, [1], [[2]]].shape == (1, 2)
assert_raises(IndexError, lambda: a[False, [0, 1], ...])
def test_boolean_indexing_fast_path(self):
# These used to either give the wrong error, or incorrectly give no
# error.
a = np.ones((3, 3))
# This used to incorrectly work (and give an array of shape (0,))
idx1 = np.array([[False] * 9])
with pytest.raises(IndexError):
a[idx1]
# This used to incorrectly give a ValueError: operands could not be broadcast together
idx2 = np.array([[False] * 8 + [True]])
with pytest.raises(IndexError):
a[idx2]
# This is the same as it used to be. The above two should work like this.
idx3 = np.array([[False] * 10])
with pytest.raises(IndexError):
a[idx3]
# This used to give ValueError: non-broadcastable operand
a = np.ones((1, 1, 2))
idx = np.array([[[True], [False]]])
with pytest.raises(IndexError):
a[idx]
class TestArrayToIndexDeprecation(TestCase):
"""Creating an index from array not 0-D is an error."""
def test_array_to_index_error(self):
# so no exception is expected. The raising is effectively tested above.
a = np.array([[[1]]])
assert_raises((TypeError, RuntimeError), np.take, a, [0], a)
raise SkipTest(
"Multi-dimensional tensors are indexable just as long as they only "
"contain a single element, no bother raising here"
)
assert_raises(TypeError, operator.index, np.array([1]))
raise SkipTest("torch consumes tensors as ints, no bother raising here")
assert_raises(TypeError, np.reshape, a, (a, -1))
class TestNonIntegerArrayLike(TestCase):
"""Tests that array_likes only valid if can safely cast to integer.
For instance, lists give IndexError when they cannot be safely cast to
an integer.
"""
@skip(
reason=(
"torch consumes floats by way of falling back on its deprecated "
"__index__ behaviour, no bother raising here"
)
)
def test_basic(self):
a = np.arange(10)
assert_raises(IndexError, a.__getitem__, [0.5, 1.5])
assert_raises(IndexError, a.__getitem__, (["1", "2"],))
# The following is valid
a.__getitem__([])
class TestMultipleEllipsisError(TestCase):
"""An index can only have a single ellipsis."""
@xfail # (
# reason=(
# "torch currently consumes multiple ellipsis, no bother raising "
# "here. See path_to_url#issue-917252204"
# )
# )
def test_basic(self):
a = np.arange(10)
assert_raises(IndexError, lambda: a[..., ...])
assert_raises(IndexError, a.__getitem__, ((Ellipsis,) * 2,))
assert_raises(IndexError, a.__getitem__, ((Ellipsis,) * 3,))
if __name__ == "__main__":
run_tests()
``` |
is a Japanese politician of the Liberal Democratic Party, a member of the House of Representatives in the Diet (national legislature). A native of Kanagawa Prefecture and graduate of Keio University, he was elected to the House of Representatives for the first time in 2005 after an unsuccessful run in 2003. He is the son of Shintaro Ishihara, former governor of Tokyo, and like his father affiliated to the revisionist lobby Nippon Kaigi.
See also
Koizumi Children
References
External links
.
1964 births
Living people
Politicians from Kanagawa Prefecture
Keio University alumni
Koizumi Children
Members of the House of Representatives from Tokyo
Liberal Democratic Party (Japan) politicians
Members of Nippon Kaigi
Shintaro Ishihara |
The Bagnold Dunes is a group of dark grey dunes in the Gale Crater on Mars. They are named after Ralph Alger Bagnold, who crossed the Libyan Desert and was one of the first explorers to acquire a deep understanding of the physics behind sand dunes. The dunes migrate around every Earth year.
Research
In November 2015, NASA's rover Curiosity began exploring the dunes, finishing the exploration in April 2017. Phase 1 investigated Namib and High Dunes on the edge of the dune field during the late autumn and winter, while Phase 2 was conducted in the southern summer at the linear Nathan Bridges Dune and Mount Desert Island, a ripple field on the southern side of the dunes.
In a research paper published on November 1, 2021, the samples taken and examined by the rover in a wet-chemistry derivatization experiment were analyzed, and according to the research, the samples taken in the dunes contained organic compounds. Specifically, it found in the sand samples chemically derivatized ammonia and benzoic acid, as well as phosphoric acid, phenol, several nitrogen-bearing molecules, and as-yet unidentified high-molecular-weight compounds.
References
Dunes on Mars |
```c
/*
*
* in the file LICENSE in the source distribution or at
* path_to_url
*/
#include <stdio.h>
#include "internal/cryptlib.h"
#include <openssl/conf.h>
#include <openssl/asn1.h>
#include <openssl/ocsp.h>
#include "ocsp_local.h"
#include <openssl/x509v3.h>
#include "../x509/ext_dat.h"
/*
* OCSP extensions and a couple of CRL entry extensions
*/
static int i2r_ocsp_crlid(const X509V3_EXT_METHOD *method, void *nonce,
BIO *out, int indent);
static int i2r_ocsp_acutoff(const X509V3_EXT_METHOD *method, void *nonce,
BIO *out, int indent);
static int i2r_object(const X509V3_EXT_METHOD *method, void *obj, BIO *out,
int indent);
static void *ocsp_nonce_new(void);
static int i2d_ocsp_nonce(const void *a, unsigned char **pp);
static void *d2i_ocsp_nonce(void *a, const unsigned char **pp, long length);
static void ocsp_nonce_free(void *a);
static int i2r_ocsp_nonce(const X509V3_EXT_METHOD *method, void *nonce,
BIO *out, int indent);
static int i2r_ocsp_nocheck(const X509V3_EXT_METHOD *method,
void *nocheck, BIO *out, int indent);
static void *s2i_ocsp_nocheck(const X509V3_EXT_METHOD *method,
X509V3_CTX *ctx, const char *str);
static int i2r_ocsp_serviceloc(const X509V3_EXT_METHOD *method, void *in,
BIO *bp, int ind);
const X509V3_EXT_METHOD ossl_v3_ocsp_crlid = {
NID_id_pkix_OCSP_CrlID, 0, ASN1_ITEM_ref(OCSP_CRLID),
0, 0, 0, 0,
0, 0,
0, 0,
i2r_ocsp_crlid, 0,
NULL
};
const X509V3_EXT_METHOD ossl_v3_ocsp_acutoff = {
NID_id_pkix_OCSP_archiveCutoff, 0, ASN1_ITEM_ref(ASN1_GENERALIZEDTIME),
0, 0, 0, 0,
0, 0,
0, 0,
i2r_ocsp_acutoff, 0,
NULL
};
const X509V3_EXT_METHOD ossl_v3_crl_invdate = {
NID_invalidity_date, 0, ASN1_ITEM_ref(ASN1_GENERALIZEDTIME),
0, 0, 0, 0,
0, 0,
0, 0,
i2r_ocsp_acutoff, 0,
NULL
};
const X509V3_EXT_METHOD ossl_v3_crl_hold = {
NID_hold_instruction_code, 0, ASN1_ITEM_ref(ASN1_OBJECT),
0, 0, 0, 0,
0, 0,
0, 0,
i2r_object, 0,
NULL
};
const X509V3_EXT_METHOD ossl_v3_ocsp_nonce = {
NID_id_pkix_OCSP_Nonce, 0, NULL,
ocsp_nonce_new,
ocsp_nonce_free,
d2i_ocsp_nonce,
i2d_ocsp_nonce,
0, 0,
0, 0,
i2r_ocsp_nonce, 0,
NULL
};
const X509V3_EXT_METHOD ossl_v3_ocsp_nocheck = {
NID_id_pkix_OCSP_noCheck, 0, ASN1_ITEM_ref(ASN1_NULL),
0, 0, 0, 0,
0, s2i_ocsp_nocheck,
0, 0,
i2r_ocsp_nocheck, 0,
NULL
};
const X509V3_EXT_METHOD ossl_v3_ocsp_serviceloc = {
NID_id_pkix_OCSP_serviceLocator, 0, ASN1_ITEM_ref(OCSP_SERVICELOC),
0, 0, 0, 0,
0, 0,
0, 0,
i2r_ocsp_serviceloc, 0,
NULL
};
static int i2r_ocsp_crlid(const X509V3_EXT_METHOD *method, void *in, BIO *bp,
int ind)
{
OCSP_CRLID *a = in;
if (a->crlUrl) {
if (BIO_printf(bp, "%*scrlUrl: ", ind, "") <= 0)
goto err;
if (!ASN1_STRING_print(bp, (ASN1_STRING *)a->crlUrl))
goto err;
if (BIO_write(bp, "\n", 1) <= 0)
goto err;
}
if (a->crlNum) {
if (BIO_printf(bp, "%*scrlNum: ", ind, "") <= 0)
goto err;
if (i2a_ASN1_INTEGER(bp, a->crlNum) <= 0)
goto err;
if (BIO_write(bp, "\n", 1) <= 0)
goto err;
}
if (a->crlTime) {
if (BIO_printf(bp, "%*scrlTime: ", ind, "") <= 0)
goto err;
if (!ASN1_GENERALIZEDTIME_print(bp, a->crlTime))
goto err;
if (BIO_write(bp, "\n", 1) <= 0)
goto err;
}
return 1;
err:
return 0;
}
static int i2r_ocsp_acutoff(const X509V3_EXT_METHOD *method, void *cutoff,
BIO *bp, int ind)
{
if (BIO_printf(bp, "%*s", ind, "") <= 0)
return 0;
if (!ASN1_GENERALIZEDTIME_print(bp, cutoff))
return 0;
return 1;
}
static int i2r_object(const X509V3_EXT_METHOD *method, void *oid, BIO *bp,
int ind)
{
if (BIO_printf(bp, "%*s", ind, "") <= 0)
return 0;
if (i2a_ASN1_OBJECT(bp, oid) <= 0)
return 0;
return 1;
}
/*
* OCSP nonce. This is needs special treatment because it doesn't have an
* ASN1 encoding at all: it just contains arbitrary data.
*/
static void *ocsp_nonce_new(void)
{
return ASN1_OCTET_STRING_new();
}
static int i2d_ocsp_nonce(const void *a, unsigned char **pp)
{
const ASN1_OCTET_STRING *os = a;
if (pp) {
memcpy(*pp, os->data, os->length);
*pp += os->length;
}
return os->length;
}
static void *d2i_ocsp_nonce(void *a, const unsigned char **pp, long length)
{
ASN1_OCTET_STRING *os, **pos;
pos = a;
if (pos == NULL || *pos == NULL) {
os = ASN1_OCTET_STRING_new();
if (os == NULL)
goto err;
} else {
os = *pos;
}
if (!ASN1_OCTET_STRING_set(os, *pp, length))
goto err;
*pp += length;
if (pos)
*pos = os;
return os;
err:
if ((pos == NULL) || (*pos != os))
ASN1_OCTET_STRING_free(os);
ERR_raise(ERR_LIB_OCSP, ERR_R_ASN1_LIB);
return NULL;
}
static void ocsp_nonce_free(void *a)
{
ASN1_OCTET_STRING_free(a);
}
static int i2r_ocsp_nonce(const X509V3_EXT_METHOD *method, void *nonce,
BIO *out, int indent)
{
if (BIO_printf(out, "%*s", indent, "") <= 0)
return 0;
if (i2a_ASN1_STRING(out, nonce, V_ASN1_OCTET_STRING) <= 0)
return 0;
return 1;
}
/* Nocheck is just a single NULL. Don't print anything and always set it */
static int i2r_ocsp_nocheck(const X509V3_EXT_METHOD *method, void *nocheck,
BIO *out, int indent)
{
return 1;
}
static void *s2i_ocsp_nocheck(const X509V3_EXT_METHOD *method,
X509V3_CTX *ctx, const char *str)
{
return ASN1_NULL_new();
}
static int i2r_ocsp_serviceloc(const X509V3_EXT_METHOD *method, void *in,
BIO *bp, int ind)
{
int i;
OCSP_SERVICELOC *a = in;
ACCESS_DESCRIPTION *ad;
if (BIO_printf(bp, "%*sIssuer: ", ind, "") <= 0)
goto err;
if (X509_NAME_print_ex(bp, a->issuer, 0, XN_FLAG_ONELINE) <= 0)
goto err;
for (i = 0; i < sk_ACCESS_DESCRIPTION_num(a->locator); i++) {
ad = sk_ACCESS_DESCRIPTION_value(a->locator, i);
if (BIO_printf(bp, "\n%*s", (2 * ind), "") <= 0)
goto err;
if (i2a_ASN1_OBJECT(bp, ad->method) <= 0)
goto err;
if (BIO_puts(bp, " - ") <= 0)
goto err;
if (GENERAL_NAME_print(bp, ad->location) <= 0)
goto err;
}
return 1;
err:
return 0;
}
``` |
```groovy
package fastdex.build.transform
import com.android.build.api.transform.Transform
import com.android.build.api.transform.TransformException
import com.android.build.api.transform.TransformInvocation
import fastdex.build.util.Constants
import fastdex.build.util.JarOperation
import fastdex.build.variant.FastdexVariant
import fastdex.common.utils.FileUtils
/**
* Created by tong on 17/10/31.
*/
class FastdexDexBuilderTransform extends TransformProxy {
FastdexDexBuilderTransform(Transform base,File streamOutputFolder, FastdexVariant fastdexVariant) {
super(base,streamOutputFolder,fastdexVariant)
}
@Override
void transform(TransformInvocation transformInvocation) throws TransformException, IOException, InterruptedException {
if (fastdexVariant.hasDexCache) {
project.logger.error("\n==fastdex patch transform start,we will generate dex file")
if (fastdexVariant.projectSnapshoot.diffResultSet.isJavaFileChanged()) {
FileUtils.deleteDir(streamOutputFolder)
File patchJar = new File(streamOutputFolder,Constants.PATCH_JAR)
//jar
JarOperation.generatePatchJar(fastdexVariant,transformInvocation,patchJar)
}
else {
project.logger.error("==fastdex no java files have changed, just ignore")
}
}
else {
fastdexBuilder.injectInputAndSaveClassPath(transformInvocation)
base.transform(transformInvocation)
}
}
}
``` |
Starksia lepicoelia, known commonly as the blackcheek blenny, is a species of labrisomid blenny native to the Caribbean Sea and adjacent Atlantic Ocean. It inhabits coral reefs and can be found at depths of from . This species can reach a length of TL.
References
lepicoelia
Fish described in 1961
Taxa named by Victor G. Springer
Taxa named by James Erwin Böhlke |
The Sentiero Ferrato Ivano Dibona is a challenging high alpine route along the Zurlon ridge, the main crest on Cristallo, a mountain group in the Italian Dolomites, northeast of Cortina d'Ampezzo, in the province of Belluno, Veneto, Italy. The use of a via ferrata set is recommended. The via ferrata is very well known because of the dolomitic scenery and the panoramic view.
History
The Ivano Dibona is a restored historical route, which was used by Italian troops during World War I. The route was explored in the 1960s by Freddy and Ivano Dibona, subsequently made safe for tourists, and reopened in September 1970. It was named after Ivano Dibona, who had perished on Cristallo in 1968. Remains of military constructions from 1915 to 1917 are still visible along the route: casemate, barracks and ladders.
Route details
The route starts from Forcella Staunies (2,919 m), the top of the cable car (not in operation since 2016 - there is only one lift from Capanna Rio Gero to Rifugio Son Forca) at Cristallo's south side, and ends at Rifugio Ospitale in the Val Felizon. It takes about four hours to walk from Capanna Rio Gero (1698 m) below Passo Tre Croci to the start of the via ferrata at the Forcella Staunies for the ascent, which is arduous in the last part due to loose scree. The VF Ivano Dibona is not a climbing route, but follows the mountain ridge, via ladders, tunnels and bridges. The exposed parts are supplied with steel wires typical for via ferratas, while the parts that originally were difficult are supplied with remedies to make them accessible for walkers.
From the start at Forcella Staunies is some upward ladder climbing, a short tunnel, and then the bridge Ponte Cristallo, 27 meters long, and the longest via ferrata suspension bridge in the Dolomites. The bridge was shown in the action film Cliffhanger from 1993. The peak Cristallino d'Ampezzo (3,008 m) can be climbed via a short side route from the main Ivano Dibona.
Further the route goes down to Forcella Grande (2,870 m), and passes Forcella Padeon (2,760 m), Forcella Alta (2,687 m), and Forcella Bassa, and along the ridge to the peaks Zurlon (2,363 m), and Col di Stombi (2,168 m), and finally down to Ospitale.
The total height difference of the tour is 1000 m in the ascent and 1720 m in the descent. In early summer, remains of hard snow can be a danger. There are refreshment stops in Rio Gere, at the Rifugio Son Forca and in Ospitale. There is an unmanaged shelter in the Forcella Padeon.
Gallery
References
Cortina d'Ampezzo e Dolomiti Ampezzane. 1:25,000, Carta Topografica. Casa Editrice Tobacco.
Tourist attractions in Italy
Hiking trails in Italy
Via ferrata |
```javascript
/*
* All rights reserved.
*
* This source code is licensed under the license found in the LICENSE file in
* the root directory of this source tree.
*/
import Calendar from 'components/Calendar/Calendar.react';
import { Directions } from 'lib/Constants';
import Icon from 'components/Icon/Icon.react';
import { monthDayStringUTC, monthsFrom, daysFrom } from 'lib/DateUtils';
import Popover from 'components/Popover/Popover.react';
import Position from 'lib/Position';
import PropTypes from 'lib/PropTypes';
import React from 'react';
import styles from 'components/DateRange/DateRange.scss';
export default class DateRange extends React.Component {
constructor(props) {
super();
const val = props.value || {};
this.state = {
open: false,
position: null,
start: val.start || monthsFrom(new Date(), -1),
end: val.end || new Date(),
};
this.wrapRef = React.createRef();
}
toggle() {
this.setState(() => {
if (this.state.open) {
return { open: false };
}
const pos = Position.inWindow(this.wrapRef.current);
if (this.props.align === Directions.RIGHT) {
pos.x += this.wrapRef.current.clientWidth;
}
return {
open: true,
position: pos,
};
});
}
setStart(start) {
let end = this.state.end;
if (start > end) {
end = daysFrom(start, 1);
}
this.setState({ start, end });
}
setEnd(end) {
let start = this.state.start;
if (start > end) {
start = daysFrom(end, -1);
}
this.setState({ start, end });
}
close() {
this.setState({
open: false,
});
this.props.onChange({ start: this.state.start, end: this.state.end });
}
rangeString() {
return `${monthDayStringUTC(this.state.start)} - ${monthDayStringUTC(this.state.end)}`;
}
render() {
let popover = null;
let content = null;
if (this.state.open) {
const classes = [styles.open];
if (this.props.align === Directions.RIGHT) {
classes.push(styles.right);
}
const renderShade =
this.state.start.getFullYear() < this.state.end.getFullYear() ||
this.state.start.getMonth() !== this.state.end.getMonth();
popover = (
<Popover
fixed={true}
position={this.state.position}
onExternalClick={this.close.bind(this)}
>
<div className={classes.join(' ')}>
<div className={styles.calendars}>
<Calendar
value={this.state.start}
onChange={start => this.setStart(start)}
shadeAfter={renderShade}
/>
<Calendar
value={this.state.end}
onChange={end => this.setEnd(end)}
shadeBefore={renderShade}
/>
</div>
<div className={styles.range} onClick={this.close.bind(this)}>
<span>{this.rangeString()}</span>
<Icon width={18} height={18} name="calendar-solid" fill="#169CEE" />
</div>
</div>
</Popover>
);
} else {
content = (
<div className={styles.range}>
<span>{this.rangeString()}</span>
<Icon width={18} height={18} name="calendar-solid" fill="#169CEE" />
</div>
);
}
return (
<div className={styles.wrap} onClick={this.toggle.bind(this)} ref={this.wrapRef}>
{content}
{popover}
</div>
);
}
}
DateRange.propTypes = {
value: PropTypes.object.describe(
'The value of the range. It has two props, "start" and "end," which are both Dates.'
),
onChange: PropTypes.func.describe(
'A function called when the date range is closed. It receives an object with two Date properties: start and end.'
),
align: PropTypes.string.describe(
'The side to align the range selector with. Possible options are Constants.Directions.LEFT or Constants.Directions.RIGHT.'
),
};
``` |
```javascript
const snippets = ["@let foo = 'Hello' + ', World'; "];
runFormatTest(
{
importMeta: import.meta,
snippets,
},
["angular"],
{ embeddedLanguageFormatting: "off" },
);
runFormatTest(
{
importMeta: import.meta,
snippets,
},
["angular"],
{ semi: false },
);
``` |
Tetrops mongolicus is a species of beetle in the family Cerambycidae. It was described by Murzin in 1977. It is known from Mongolia.
References
Tetropini
Beetles described in 1977 |
Seven Seasons of Buffy is a 2003 academic publication relating to the fictional Buffyverse established by the television series Buffy the Vampire Slayer and Angel.
Book description and contents
A batch of essays from science-fiction and fantasy writers that examine the show's scope, the growth of its characters, and the effect it had on its fans.
External links
Phil-books.com - review of this book
Nika-summers.com - review of "Seven Seasons of Buffy"
Ink 19.com - review of this book
Books about the Buffyverse
2003 non-fiction books
BenBella Books books |
The 1951–52 NBA season was the sixth season of the National Basketball Association. The season ended with the Minneapolis Lakers winning the NBA Championship, beating the New York Knicks 4 games to 3 in the NBA Finals.
Notable occurrences
The Tri-Cities Blackhawks relocated from the "Tri-Cities" area (Moline, Illinois, Rock Island, Illinois & Davenport, Iowa) to Milwaukee, Wisconsin and became the Milwaukee Hawks.
The 1952 NBA All-Star Game was played in Boston, Massachusetts, with the East beating the West 108–91. Paul Arizin of the Philadelphia Warriors won the game's MVP award.
Final standings
Eastern Division
Western Division
x – Clinched playoff spot
Playoffs
Statistics leaders
Note: Prior to the 1969–70 season, league leaders in points, rebounds, and assists were determined by totals rather than averages.
NBA awards
All-NBA First Team:
Paul Arizin, Philadelphia Warriors
Bob Cousy, Boston Celtics
Ed Macauley, Boston Celtics
Bob Davies, Rochester Royals
Dolph Schayes, Syracuse Nationals
George Mikan, Minneapolis Lakers
All-NBA Second Team:
Larry Foust, Fort Wayne Pistons
Vern Mikkelsen, Minneapolis Lakers
Andy Phillip, Philadelphia Warriors
Jim Pollard, Minneapolis Lakers
Bobby Wanzer, Rochester Royals
References |
```go
/*
path_to_url
Unless required by applicable law or agreed to in writing, software
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package nodevariant
import (
"github.com/pkg/errors"
"github.com/spf13/cobra"
"k8s.io/kubeadm/kinder/pkg/build/alter"
"k8s.io/kubeadm/kinder/pkg/constants"
)
type flagpole struct {
Image string
BaseImage string
InitArtifacts string
ImageTars []string
ImageNamePrefix string
UpgradeArtifacts string
Kubeadm string
Kubelet string
PrePullAdditionalImages bool
Path []string
}
// NewCommand returns a new cobra.Command for building the node image
func NewCommand() *cobra.Command {
flags := &flagpole{}
cmd := &cobra.Command{
Args: cobra.NoArgs,
Use: "node-image-variant",
Aliases: []string{"node-variant", "variant", "nv"},
Short: "build the node image variant",
Long: "build the variant for a node image by adding packages, images or replacing the kubeadm binary",
RunE: func(cmd *cobra.Command, args []string) error {
return runE(flags, cmd, args)
},
}
cmd.Flags().StringVar(
&flags.Image, "image",
constants.DefaultNodeImage,
"name:tag of the resulting image to be built",
)
cmd.Flags().StringVar(
&flags.BaseImage, "base-image",
constants.DefaultBaseImage,
"name:tag of the source image; this can be a kindest/base image or kindest/node image",
)
cmd.Flags().StringVar(
&flags.InitArtifacts, "with-init-artifacts",
"",
"version/build-label/path to a folder with Kubernetes binaries & image tarballs to be used for the kubeadm init workflow",
)
cmd.Flags().StringSliceVar(
&flags.ImageTars, "with-images",
nil,
"version/build-label/path to images tar or folder with images tars to be added to the images",
)
cmd.Flags().StringVar(
&flags.ImageNamePrefix, "image-name-prefix",
"",
"add a name prefix to images tars included in the image",
)
cmd.Flags().StringVar(
&flags.UpgradeArtifacts, "with-upgrade-artifacts",
"",
"version/build-label/path to a folder with Kubernetes binaries & image tarballs to be used for testing the kubeadm-upgrade workflow",
)
cmd.Flags().StringVar(
&flags.Kubeadm, "with-kubeadm",
"",
"override the kubeadm binary existing in the image with the given version/build-label/file or folder containing the kubeadm binary",
)
cmd.Flags().StringVar(
&flags.Kubelet, "with-kubelet",
"",
"override the kubeadm binary existing in the image with the given version/build-label/file or folder containing the kubelet binary",
)
cmd.Flags().BoolVar(
&flags.PrePullAdditionalImages, "with-kubeadm-additional-images",
true,
"pre-pull kubeadm additional required images such as etcd, coredns and pause, etc",
)
cmd.Flags().StringSliceVar(
&flags.Path, "with-path",
nil,
"sourcePath:destPath pairs; copies file/dir at sourcePath on the host to destPath inside the image, destPath has to be absolute",
)
return cmd
}
func runE(flags *flagpole, cmd *cobra.Command, args []string) error {
ctx, err := alter.NewContext(
// base build options
alter.WithBaseImage(flags.BaseImage),
alter.WithImage(flags.Image),
// bits to be added to the image
alter.WithInitArtifacts(flags.InitArtifacts),
alter.WithKubeadm(flags.Kubeadm),
alter.WithKubelet(flags.Kubelet),
alter.WithImageTars(flags.ImageTars),
alter.WithUpgradeArtifacts(flags.UpgradeArtifacts),
alter.WithPrePullAdditionalImages(flags.PrePullAdditionalImages),
// bits options
alter.WithImageNamePrefix(flags.ImageNamePrefix),
alter.WithPath(flags.Path),
)
if err != nil {
return errors.Wrap(err, "error creating alter context")
}
if err := ctx.Alter(); err != nil {
return errors.Wrap(err, "error altering node image")
}
return nil
}
``` |
The 2018 season of the Indian Premier League, also known as IPL 11 and branded as Vivo IPL 2018 , was the eleventh season of the IPL, a professional Twenty20 cricket league established by the BCCI in 2007. The season, which was held from 7 April to 27 May, saw the return of the Chennai Super Kings and the Rajasthan Royals after serving two years of suspension for the involvement of their respective owners in the 2013 IPL betting case. Star Sports purchased the media rights at ₹16,347.5 crore ($2.55 billion) for five years starting from 2018. The tagline was Best vs Best.
Chennai Super Kings won by 8 wickets against Sunrisers Hyderabad in the final to win their third title. Sunrisers Hyderabad captain Kane Williamson won the Orange Cap for the leading run-scorer of the tournament with 735 runs. Andrew Tye, of Kings XI Punjab, was awarded the Purple Cap for finishing as the leading wicket-taker of the tournament with 24 wickets. Sunil Narine of Kolkata Knight Riders was named Most Valuable Player, also known as Man of the Series, while Rishabh Pant of Delhi Daredevils was named the Emerging Player of the Series.
Background
This was the first season of the IPL to use DRS. IPL Fanpark, an initiative where matches are hosted in stadia on a large screen has been planned to be held across 36 cities in 19 states across the India. This season also introduced mid-season transfers. The transfer window will be a short five-day transfer window applicable only for uncapped players who have played not more than two matches at the halfway mark of the tournament.
Format
Eight teams were scheduled to play in 2018. The tournament involved each team playing every other team twice in a home-and-away, double round-robin format. At the conclusion of the double round-robin league, the top four teams on the basis of aggregate points qualified for the playoffs. In this stage, the top two teams compete with each other (in a match titled "Qualifier 1"), as do the remaining two teams (in a match titled "Eliminator"). While the winner of Qualifier 1 directly qualified for the final match, the losing team got another chance to qualify for the final match by playing the winning team of the Eliminator match; this match is titled Qualifier 2. The winner of this subsequent Qualifier 2 match moved onto the final match. The team that won the final match was crowned the Indian Premier League winners. The schedule for the tournament was published on 14 February 2018.
Broadcast
Star Sports won the global media rights at ₹16,347.5 crore ($2.55 billion) for five years starting from 2018. In India, the tournament will be broadcast on Star Network channels in six languages (English, Hindi, Tamil, Telugu, Kannada and Bengali). For the first time, IPL would also be broadcast on public broadcaster Doordarshan. The television rights for rest of the world were won by Willow TV for US and Canada, Sky Sports for UK, Fox Sports for Australia, Sky Sport for New Zealand, SuperSport for sub Saharan Africa, beIN Sports for Middle-East and North America, Flow TV for Caribbean, Geo Super for Pakistan, Channel 9 for Bangladesh and Lemar TV for Afghanistan. The radio rights were won by Cricket Radio globally (except Indian subcontinent), 89.1 Radio 4 FM and Gold 101.3 FM for US and Talksport for UK. Star's digital platform Hotstar held the digital rights for India, US and Canada. The digital rights for rest of the world were won by Sky Sports for UK, Fox Sports for Australia, Sky Sport for New Zealand, SuperSport for sub Saharan Africa, beIN Sports for Middle-East and North America, Flow TV for Caribbean, Geo Super for Pakistan, Channel 9 for Bangladesh and YuppTV for Australia, Europe, SE Asia & South America. Star India also announced its plan to broadcast IPL in Virtual Reality.
Venues
Per the original schedule, all teams except for Kings XI Punjab, would play their home games at their traditional home venues. Kings XI were scheduled to play three of their home games in Indore and the other four games in Mohali. The schedule was later changed due to logistical issues owing to the temporary closure of Chandigarh Airport, and as a result, Kings XI would play three of their home games in Mohali and the other four games in Indore making an exception to the rule of playing at least four home matches at their designated home venue. The IPL matches in Chennai were threatened due to the Kaveri water dispute protests. The Madras High Court issued a notice to BCCI after a PIL was filed seeking a stay on the IPL matches in Chennai. On 11 April that Chennai's six remaining home matches would be held in Pune instead due to security concerns resulting from the protests.
Ten venues were selected to host the matches. The opening match and the final will be played at the Wankhede Stadium in Mumbai. The venues for the two playoffs were not announced initially due to the norm of allotting the Eliminator and second qualifier to the home stadium of last season's runner-up, and the fact that the 2017 runner-up, Rising Pune Supergiant were no longer a part of the IPL. Later, both playoffs were allotted to Pune but after the venue of Chennai Super Kings was moved there, the matches were shifted to Kolkata.
Personnel changes
The IPL Governing Council announced that each IPL franchise could retain a maximum of five players from their respective current squads. Of the five players, a franchise could retain a maximum of three players through retention in lead up to the auction, and a maximum of three players through right-to-match card during the auction. The other restrictions on player retention were: a maximum of three capped Indian players could be retained, and only two overseas players and two uncapped Indian players could be retained. The salary cap for each team for the 2018 season was increased from ₹66 crore to ₹80 crore (approximately $12.4 million). A franchise was allowed to spend only ₹33 crore on retentions ahead of the 2018 IPL auction, leaving it at least ₹47 crore to spend at the auction.
IPL teams were asked to submit their retention list by 4 January. For the first time in IPL history, the player retention event was broadcast live on Star Sports. The IPL auction was held on 27 and 28 January at Bangalore a day after the final of the Syed Mushtaq Ali Trophy.
169 players (104 Indians and 56 Overseas) were sold at auction. Ben Stokes fetched the highest bid of ₹12.5 crore (US$1.95 million). Jaydev Unadkat was the most costly Indian player at ₹11.5 crore (US$1.80 million). Among uncapped players Krunal Pandya was most expensive at ₹8.8 crore(US$1.38 million). Many prominent players such as Lasith Malinga, Dale Steyn, Ishant Sharma, Hashim Amla , Martin Guptill and Joe Root remain unsold.
Opening ceremony
The season had a single opening ceremony, unlike 2017 IPL, before the first match on 7 April. The ceremony included performances by Varun Dhawan, Prabhu Deva, Mika Singh, Tamannaah Bhatia, Jacqueline Fernandez and Hrithik Roshan.
Teams and standings
Points table
("C" refers to the "Champions" of the Tournament. '2', '3' and '4' are the positions of the respective teams in the tournament.)
Match summary
League stage
Match results
Playoffs
Qualifier 1
Eliminator
Qualifier 2
Final
Statistics
Most Runs
Kane Williamson of Sunrisers Hyderabad received the Orange Cap.
Source: ESPNcricinfo
Most wickets
Andrew Tye of Kings XI Punjab received the Purple Cap.
Source: ESPNcricinfo
Special awards
Source:
See also
2018 Women's T20 Challenge
List of Indian Premier League records and statistics
References
External links
Series home on ESPN Cricinfo
Indian Premier League seasons
Domestic cricket competitions in 2017–18
2018 Indian Premier League |
Tejendra Khanna (born 16 December 1938) is the former Lieutenant Governor of Delhi twice, from January 1997 to April 1998 and again from April 2007 - July 2013. He also served as Chancellor of Delhi Technological University, Indraprastha Institute of Information Technology, Delhi, Guru Gobind Singh Indraprastha University and Ambedkar University.
Early life and education
Tejendra Khanna was born in Patna, Bihar on 16 December 1938. He earned his Master of Science (Physics) from Patna University and Master of Arts in Public Administration from University of California, Berkeley.
Career
He was a 1961 batch Indian Administrative Service (IAS) officer. He held different administrative positions in Punjab. He was the Chief Secretary, Punjab during 1991-92 and conducted the 1992 February elections in Punjab as Chief Election Officer, which brought back an elected Government in the state after a long period of President’s Rule.
He also held important positions in the Government of India. He served as Commercial Counselor, Indian High Commission, U.K. (1975–77), Chief Controller, Imports and Exports (1989–91), Secretary to Government of India, Ministry of Food (1992–93) and Commerce Secretary to Government of India (1993–96).
Immediately on his retirement on 31.12.1996, he was appointed 16th Lt. Governor and Administrator of the National Capital and served in this capacity up to April 1998. He again served as Delhi's 19th Lt. Governor from 9 April 2007 to 8 July 2013.
Honours, awards and international recognition
He was conferred an Honorary Doctorate Degree in Political Science, by the Wonkwang University on 2010 and a Doctorate Degree (Honoris Causa) by TERI University.
See also
Najeeb Jung
List of lieutenant governors of Delhi
References
External links
Profile on Delhi Govt website
news article
Address of the Shri Tejendra Khanna at Annual Convocation of Jamia Millia Islamia University
1938 births
Living people
Delhi politicians
Indian civil servants
Lieutenant Governors of Delhi
University of California, Berkeley alumni
Politicians from Patna
St. Xavier's Patna alumni
Indian National Congress politicians from Bihar
20th-century Indian politicians |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.