text
stringlengths 1
22.8M
|
|---|
```python
"""Tests for :mod:`numpy.core.fromnumeric`."""
import numpy as np
A = np.array(True, ndmin=2, dtype=bool)
B = np.array(1.0, ndmin=2, dtype=np.float32)
A.setflags(write=False)
B.setflags(write=False)
a = np.bool_(True)
b = np.float32(1.0)
c = 1.0
d = np.array(1.0, dtype=np.float32) # writeable
reveal_type(np.take(a, 0)) # E: Any
reveal_type(np.take(b, 0)) # E: Any
reveal_type(np.take(c, 0)) # E: Any
reveal_type(np.take(A, 0)) # E: Any
reveal_type(np.take(B, 0)) # E: Any
reveal_type(np.take(A, [0])) # E: Any
reveal_type(np.take(B, [0])) # E: Any
reveal_type(np.reshape(a, 1)) # E: numpy.ndarray[Any, Any]
reveal_type(np.reshape(b, 1)) # E: numpy.ndarray[Any, Any]
reveal_type(np.reshape(c, 1)) # E: numpy.ndarray[Any, Any]
reveal_type(np.reshape(A, 1)) # E: numpy.ndarray[Any, Any]
reveal_type(np.reshape(B, 1)) # E: numpy.ndarray[Any, Any]
reveal_type(np.choose(a, [True, True])) # E: Any
reveal_type(np.choose(A, [True, True])) # E: Any
reveal_type(np.repeat(a, 1)) # E: numpy.ndarray[Any, Any]
reveal_type(np.repeat(b, 1)) # E: numpy.ndarray[Any, Any]
reveal_type(np.repeat(c, 1)) # E: numpy.ndarray[Any, Any]
reveal_type(np.repeat(A, 1)) # E: numpy.ndarray[Any, Any]
reveal_type(np.repeat(B, 1)) # E: numpy.ndarray[Any, Any]
# TODO: Add tests for np.put()
reveal_type(np.swapaxes(A, 0, 0)) # E: numpy.ndarray[Any, Any]
reveal_type(np.swapaxes(B, 0, 0)) # E: numpy.ndarray[Any, Any]
reveal_type(np.transpose(a)) # E: numpy.ndarray[Any, Any]
reveal_type(np.transpose(b)) # E: numpy.ndarray[Any, Any]
reveal_type(np.transpose(c)) # E: numpy.ndarray[Any, Any]
reveal_type(np.transpose(A)) # E: numpy.ndarray[Any, Any]
reveal_type(np.transpose(B)) # E: numpy.ndarray[Any, Any]
reveal_type(np.partition(a, 0, axis=None)) # E: numpy.ndarray[Any, Any]
reveal_type(np.partition(b, 0, axis=None)) # E: numpy.ndarray[Any, Any]
reveal_type(np.partition(c, 0, axis=None)) # E: numpy.ndarray[Any, Any]
reveal_type(np.partition(A, 0)) # E: numpy.ndarray[Any, Any]
reveal_type(np.partition(B, 0)) # E: numpy.ndarray[Any, Any]
reveal_type(np.argpartition(a, 0)) # E: Any
reveal_type(np.argpartition(b, 0)) # E: Any
reveal_type(np.argpartition(c, 0)) # E: Any
reveal_type(np.argpartition(A, 0)) # E: Any
reveal_type(np.argpartition(B, 0)) # E: Any
reveal_type(np.sort(A, 0)) # E: numpy.ndarray[Any, Any]
reveal_type(np.sort(B, 0)) # E: numpy.ndarray[Any, Any]
reveal_type(np.argsort(A, 0)) # E: numpy.ndarray[Any, Any]
reveal_type(np.argsort(B, 0)) # E: numpy.ndarray[Any, Any]
reveal_type(np.argmax(A)) # E: {intp}
reveal_type(np.argmax(B)) # E: {intp}
reveal_type(np.argmax(A, axis=0)) # E: Any
reveal_type(np.argmax(B, axis=0)) # E: Any
reveal_type(np.argmin(A)) # E: {intp}
reveal_type(np.argmin(B)) # E: {intp}
reveal_type(np.argmin(A, axis=0)) # E: Any
reveal_type(np.argmin(B, axis=0)) # E: Any
reveal_type(np.searchsorted(A[0], 0)) # E: {intp}
reveal_type(np.searchsorted(B[0], 0)) # E: {intp}
reveal_type(np.searchsorted(A[0], [0])) # E: numpy.ndarray[Any, Any]
reveal_type(np.searchsorted(B[0], [0])) # E: numpy.ndarray[Any, Any]
reveal_type(np.resize(a, (5, 5))) # E: numpy.ndarray[Any, Any]
reveal_type(np.resize(b, (5, 5))) # E: numpy.ndarray[Any, Any]
reveal_type(np.resize(c, (5, 5))) # E: numpy.ndarray[Any, Any]
reveal_type(np.resize(A, (5, 5))) # E: numpy.ndarray[Any, Any]
reveal_type(np.resize(B, (5, 5))) # E: numpy.ndarray[Any, Any]
reveal_type(np.squeeze(a)) # E: numpy.bool_
reveal_type(np.squeeze(b)) # E: {float32}
reveal_type(np.squeeze(c)) # E: numpy.ndarray[Any, Any]
reveal_type(np.squeeze(A)) # E: numpy.ndarray[Any, Any]
reveal_type(np.squeeze(B)) # E: numpy.ndarray[Any, Any]
reveal_type(np.diagonal(A)) # E: numpy.ndarray[Any, Any]
reveal_type(np.diagonal(B)) # E: numpy.ndarray[Any, Any]
reveal_type(np.trace(A)) # E: Any
reveal_type(np.trace(B)) # E: Any
reveal_type(np.ravel(a)) # E: numpy.ndarray[Any, Any]
reveal_type(np.ravel(b)) # E: numpy.ndarray[Any, Any]
reveal_type(np.ravel(c)) # E: numpy.ndarray[Any, Any]
reveal_type(np.ravel(A)) # E: numpy.ndarray[Any, Any]
reveal_type(np.ravel(B)) # E: numpy.ndarray[Any, Any]
reveal_type(np.nonzero(a)) # E: tuple[numpy.ndarray[Any, Any]]
reveal_type(np.nonzero(b)) # E: tuple[numpy.ndarray[Any, Any]]
reveal_type(np.nonzero(c)) # E: tuple[numpy.ndarray[Any, Any]]
reveal_type(np.nonzero(A)) # E: tuple[numpy.ndarray[Any, Any]]
reveal_type(np.nonzero(B)) # E: tuple[numpy.ndarray[Any, Any]]
reveal_type(np.shape(a)) # E: tuple[builtins.int]
reveal_type(np.shape(b)) # E: tuple[builtins.int]
reveal_type(np.shape(c)) # E: tuple[builtins.int]
reveal_type(np.shape(A)) # E: tuple[builtins.int]
reveal_type(np.shape(B)) # E: tuple[builtins.int]
reveal_type(np.compress([True], a)) # E: numpy.ndarray[Any, Any]
reveal_type(np.compress([True], b)) # E: numpy.ndarray[Any, Any]
reveal_type(np.compress([True], c)) # E: numpy.ndarray[Any, Any]
reveal_type(np.compress([True], A)) # E: numpy.ndarray[Any, Any]
reveal_type(np.compress([True], B)) # E: numpy.ndarray[Any, Any]
reveal_type(np.clip(a, 0, 1.0)) # E: Any
reveal_type(np.clip(b, -1, 1)) # E: Any
reveal_type(np.clip(c, 0, 1)) # E: Any
reveal_type(np.clip(A, 0, 1)) # E: Any
reveal_type(np.clip(B, 0, 1)) # E: Any
reveal_type(np.sum(a)) # E: Any
reveal_type(np.sum(b)) # E: Any
reveal_type(np.sum(c)) # E: Any
reveal_type(np.sum(A)) # E: Any
reveal_type(np.sum(B)) # E: Any
reveal_type(np.sum(A, axis=0)) # E: Any
reveal_type(np.sum(B, axis=0)) # E: Any
reveal_type(np.all(a)) # E: numpy.bool_
reveal_type(np.all(b)) # E: numpy.bool_
reveal_type(np.all(c)) # E: numpy.bool_
reveal_type(np.all(A)) # E: numpy.bool_
reveal_type(np.all(B)) # E: numpy.bool_
reveal_type(np.all(A, axis=0)) # E: Any
reveal_type(np.all(B, axis=0)) # E: Any
reveal_type(np.all(A, keepdims=True)) # E: Any
reveal_type(np.all(B, keepdims=True)) # E: Any
reveal_type(np.any(a)) # E: numpy.bool_
reveal_type(np.any(b)) # E: numpy.bool_
reveal_type(np.any(c)) # E: numpy.bool_
reveal_type(np.any(A)) # E: numpy.bool_
reveal_type(np.any(B)) # E: numpy.bool_
reveal_type(np.any(A, axis=0)) # E: Any
reveal_type(np.any(B, axis=0)) # E: Any
reveal_type(np.any(A, keepdims=True)) # E: Any
reveal_type(np.any(B, keepdims=True)) # E: Any
reveal_type(np.cumsum(a)) # E: numpy.ndarray[Any, Any]
reveal_type(np.cumsum(b)) # E: numpy.ndarray[Any, Any]
reveal_type(np.cumsum(c)) # E: numpy.ndarray[Any, Any]
reveal_type(np.cumsum(A)) # E: numpy.ndarray[Any, Any]
reveal_type(np.cumsum(B)) # E: numpy.ndarray[Any, Any]
reveal_type(np.ptp(a)) # E: Any
reveal_type(np.ptp(b)) # E: Any
reveal_type(np.ptp(c)) # E: Any
reveal_type(np.ptp(A)) # E: Any
reveal_type(np.ptp(B)) # E: Any
reveal_type(np.ptp(A, axis=0)) # E: Any
reveal_type(np.ptp(B, axis=0)) # E: Any
reveal_type(np.ptp(A, keepdims=True)) # E: Any
reveal_type(np.ptp(B, keepdims=True)) # E: Any
reveal_type(np.amax(a)) # E: Any
reveal_type(np.amax(b)) # E: Any
reveal_type(np.amax(c)) # E: Any
reveal_type(np.amax(A)) # E: Any
reveal_type(np.amax(B)) # E: Any
reveal_type(np.amax(A, axis=0)) # E: Any
reveal_type(np.amax(B, axis=0)) # E: Any
reveal_type(np.amax(A, keepdims=True)) # E: Any
reveal_type(np.amax(B, keepdims=True)) # E: Any
reveal_type(np.amin(a)) # E: Any
reveal_type(np.amin(b)) # E: Any
reveal_type(np.amin(c)) # E: Any
reveal_type(np.amin(A)) # E: Any
reveal_type(np.amin(B)) # E: Any
reveal_type(np.amin(A, axis=0)) # E: Any
reveal_type(np.amin(B, axis=0)) # E: Any
reveal_type(np.amin(A, keepdims=True)) # E: Any
reveal_type(np.amin(B, keepdims=True)) # E: Any
reveal_type(np.prod(a)) # E: Any
reveal_type(np.prod(b)) # E: Any
reveal_type(np.prod(c)) # E: Any
reveal_type(np.prod(A)) # E: Any
reveal_type(np.prod(B)) # E: Any
reveal_type(np.prod(A, axis=0)) # E: Any
reveal_type(np.prod(B, axis=0)) # E: Any
reveal_type(np.prod(A, keepdims=True)) # E: Any
reveal_type(np.prod(B, keepdims=True)) # E: Any
reveal_type(np.prod(b, out=d)) # E: Any
reveal_type(np.prod(B, out=d)) # E: Any
reveal_type(np.cumprod(a)) # E: numpy.ndarray[Any, Any]
reveal_type(np.cumprod(b)) # E: numpy.ndarray[Any, Any]
reveal_type(np.cumprod(c)) # E: numpy.ndarray[Any, Any]
reveal_type(np.cumprod(A)) # E: numpy.ndarray[Any, Any]
reveal_type(np.cumprod(B)) # E: numpy.ndarray[Any, Any]
reveal_type(np.ndim(a)) # E: int
reveal_type(np.ndim(b)) # E: int
reveal_type(np.ndim(c)) # E: int
reveal_type(np.ndim(A)) # E: int
reveal_type(np.ndim(B)) # E: int
reveal_type(np.size(a)) # E: int
reveal_type(np.size(b)) # E: int
reveal_type(np.size(c)) # E: int
reveal_type(np.size(A)) # E: int
reveal_type(np.size(B)) # E: int
reveal_type(np.around(a)) # E: Any
reveal_type(np.around(b)) # E: Any
reveal_type(np.around(c)) # E: Any
reveal_type(np.around(A)) # E: Any
reveal_type(np.around(B)) # E: Any
reveal_type(np.mean(a)) # E: Any
reveal_type(np.mean(b)) # E: Any
reveal_type(np.mean(c)) # E: Any
reveal_type(np.mean(A)) # E: Any
reveal_type(np.mean(B)) # E: Any
reveal_type(np.mean(A, axis=0)) # E: Any
reveal_type(np.mean(B, axis=0)) # E: Any
reveal_type(np.mean(A, keepdims=True)) # E: Any
reveal_type(np.mean(B, keepdims=True)) # E: Any
reveal_type(np.mean(b, out=d)) # E: Any
reveal_type(np.mean(B, out=d)) # E: Any
reveal_type(np.std(a)) # E: Any
reveal_type(np.std(b)) # E: Any
reveal_type(np.std(c)) # E: Any
reveal_type(np.std(A)) # E: Any
reveal_type(np.std(B)) # E: Any
reveal_type(np.std(A, axis=0)) # E: Any
reveal_type(np.std(B, axis=0)) # E: Any
reveal_type(np.std(A, keepdims=True)) # E: Any
reveal_type(np.std(B, keepdims=True)) # E: Any
reveal_type(np.std(b, out=d)) # E: Any
reveal_type(np.std(B, out=d)) # E: Any
reveal_type(np.var(a)) # E: Any
reveal_type(np.var(b)) # E: Any
reveal_type(np.var(c)) # E: Any
reveal_type(np.var(A)) # E: Any
reveal_type(np.var(B)) # E: Any
reveal_type(np.var(A, axis=0)) # E: Any
reveal_type(np.var(B, axis=0)) # E: Any
reveal_type(np.var(A, keepdims=True)) # E: Any
reveal_type(np.var(B, keepdims=True)) # E: Any
reveal_type(np.var(b, out=d)) # E: Any
reveal_type(np.var(B, out=d)) # E: Any
```
|
Naâma (Arabic: النعامة or نعامة) is a municipality in Naâma Province, Algeria, of which it is the province seat. It is coextensive with the district of Naâma and has a population of 8,256, (in 1998) which gives it 7 seats in the PMA. Its population is 16,251 as per the census of 2008.
Its postal code is 45000 and its municipal code is 4501. Its telephone code is 049 nationally, or +213 49 internationally.
Communes of Naâma Province
Province seats of Algeria
|
Titus Manlius Torquatus (born before 279 BC – died 202 BC) was a politician of the Roman Republic. He had a long and distinguished career, being consul in 235 BC and 224 BC, censor in 231 BC, and dictator in 208 BC. He was an ally of Fabius Maximus "Cunctator".
Family background
Titus belonged to the patrician gens Manlia, one of the most important gentes of the Republic. It already counted 13 consulships, and 14 consular tribuneships before him. Titus' ancestry is a bit uncertain as the Fasti Consulares list him with the same filiation ("son of Titus, grandson of Titus") as Aulus Manlius Torquatus Atticus, who was consul two times in 244 BC and 241 BC, as well as censor in 247 BC, and possibly princeps senatus. Münzer tentatively supposed that Aulus was Titus' uncle. Titus' father and grandfather are not known, but his great-grandfather—also named Titus—was consul in 299 BC.
The cognomen Torquatus was first received by Titus' ancestor Titus Manlius Imperiosus in 361 BC after he had defeated a Gaul in single combat, and took his torque as a trophy. The torque then became the emblem of the family, whose members proudly put it on the coins they minted. Imperiosus Torquatus was famous for his severity; he famously killed his own son after he had disobeyed him during a battle.
Political career
Consul (235 BC)
Titus' early career is not known because Livy's books on years 292 BC – 220 BC are lost. However, Broughton guessed that he entered the college of pontiffs in his youth, since he tried to be pontifex maximus in 212 BC and was therefore one of its senior members.
His first recorded mention was his election as consul in 235 BC, alongside Gaius Atilius Bulbus, a plebeian who had already been consul in 245 BC. Eutropius and Cassiodorus—who relied on Livy—described Titus as the consul prior, which means the Centuriate Assembly elected him before Atilius.Titus was sent to Sardinia, which had just come under Roman control in the aftermath of the First Punic War (264 BC – 241 BC). The war indemnity demanded by Rome was so high that Carthage could not pay its mercenaries, who rebelled. While Carthage was fighting the mercenaries in Africa, its mercenaries stationed in Sardinia decided to rebel as well. Rome initially refused to support the Sardinian rebels, but in 237 BC Rome prevented Carthage from reclaiming the island on the pretext that its army had actually turned against Rome. Titus' mission was therefore to pacify the island, which he did successfully. He received a triumph for his victory over the rebels as a result. Several ancient authors tell that after his victory, Titus closed the doors of the Temple of Janus, symbolically meaning that Rome and its neighbours were at peace. It was only the first time that the temple was closed since the reign of Numa Pompilius—the legendary second king of Rome—and remained so for eight years; its gates then stayed open until Augustus closed them again after the Battle of Actium in 31 BC. However, Livy says that this event took place "after the First Punic War", so some modern scholars place it in 241 BC, when Aulus Manlius Torquatus—Titus' uncle—was consul in order to celebrate the end of the First Punic War. This view has however been contested.
Titus' consulship marks a return to normal after the aggressive foreign policy of his predecessors, Lucius and Publius Cornelius Lentulus Caudinus, proponents of an expansionist strategy against Carthage and the Celts in Northern Italy. This policy lasted until 232 BC and the first consulship of Fabius Maximus, the most important Roman statesman of the second half of the third century, and the leader of the "peace faction" at Rome. The very powerful gens Fabia was also allied with the Manlii since at least the fourth century.
Censor and consul for the second time (231–224 BC)
In 231 BC, Titus was elected censor prior with Quintus Fulvius Flaccus, who had already been consul in 237 BC. Because of a flaw in their election, they had to resign and could not complete the lustrum (the ritual purification of the Roman people). They were replaced the next year by Fabius Cunctator and Marcus Sempronius Tuditanus.
In 224 BC, Titus was elected consul for a second time, with his former short-term colleague Fulvius Flaccus, and was once again described as consul prior. Titus and Fulvius were sent north against the Boii, a Celtic tribe at war with Rome since 225. The consuls led the first Roman army to cross the Po river, then defeated the Boii there. The Celts lost 23,000 men and 5,000 of them were captured, but the consuls had to retreat because of poor weather and deaths among their troops.
De Sanctis thought this victory as well as the crossing of the Po were later inventions, since the Fasti Triumphales do not record this victory, which should normally have won a triumph for the consuls. He adds that Polybius tells little about it, just that the consuls headed a strong army and terrified the Boii, who submitted as a result.
Role during the Second Punic War (218–202 BC)
In 216 BC, as a senior senator, Titus successfully opposed the ransoming of the Romans taken prisoner at the Battle of Cannae, on the grounds that they had made no effort to break out of the Carthaginian lines.
In 215 BC as Praetor Titus was sent to Sardinia, after the illness of Quintus Mucius Scaevola and defeated a Carthaginian attempt under Hasdrubal the Bald to regain possession of the island.
However, he also suffered a number of reverses. In 212 BC, he and Flaccus contested for the position of Pontifex Maximus (chief priest of Rome), and both lost to a younger and less distinguished man, Publius Licinius Crassus. It is unclear from Livy's account if Licinius Crassus benefited from the inevitable division of votes between the two ex-censors, or whether he was always favoured for the role.
In 210 BC, he was the oldest living patrician senator, but he was not chosen Princeps Senatus. The censor Publius Sempronius Tuditanus preferred that the honour go to the most distinguished senior senator, who was, in his view, Quintus Fabius Maximus Verrucosus, a man who had been first consul in 233 BC and censor in 230 BC. The other censor, Marcus Cornelius Cethegus, preferred to go by the mos maiorum, but the choice was Tuditanus' to make.
Francis Ryan suggested that because of the closure of the Temple of Janus, Titus was associated with peace, and it played against him in this time of total war against Hannibal.
Two years later (208 BC) he was appointed dictator in order to hold the elections and preside over the games that had been promised by the Praetor M. Aemilius.
Death and posterity
Titus died in 202 BC. As his son had died before him, he was survived by his two grandsons, Titus and Aulus, who became consul in 165 BC and 164 BC, respectively. The elder grandson, Titus, was especially known for his severity, as he organised a private trial of his son for bribery, who committed suicide after he had banished him from his sight. The consul of 165 BC therefore emulated the severity of his ancestors, including that of his grandfather, whose deeds were reported by the annalists as examples of the imperia Manliana, the "Manlian orders".
The Torquati were also known for the death masks of their ancestors displayed in the atrium of the familial house. It is likely that Titus' mask was placed there, alongside those of Marcus Manlius Capitolinus and Imperiosus Torquatus.
Stemma of the Manlii Torquati
Stemma taken from Münzer until "A. Manlius Torquatus, d. 208", and then Mitchell, with corrections. All dates are BC.
References
Bibliography
Ancient works
Cassiodorus, Chronica.
Eutropius, Brevarium.
Titus Livius (Livy), History of Rome, Periochae.
Orosius, Historiae Adversus Paganos (Histories against the Pagans).
Plutarch, Parallel lives.
Polybius, Historiae (The Histories).
Valerius Maximus, Factorum ac Dictorum Memorabilium (Memorable Deeds and Sayings).
Modern works
Michael C. Alexander, Trials in the Late Roman Republic, 149 to 50 BC, University of Toronto Press, 1990.
T. Robert S. Broughton, The Magistrates of the Roman Republic, American Philological Association, 1952–1986.
Michael Crawford, Roman Republican Coinage, Cambridge University Press (1974–2001).
J. A. Crook, F. W. Walbank, M. W. Frederiksen, R. M. Ogilvie (editors), The Cambridge Ancient History, vol. VIII, Rome and the Mediterranean to 133 B.C., Cambridge University Press, 1989.
Harriet I Flower, The Art of Forgetting: Disgrace & Oblivion in Roman Political Culture, University of North Carolina Press, 2006.
Dexter Hoyos, Unplanned Wars: The Origins of the First and Second Punic Wars, Berlin & New York, Walter de Gruyter, 1998.
Christina S. Kraus, John Marincola, Christopher Pelling (editors), Ancient Historiography and Its Contexts, Studies in Honour of A. J. Woodman, Oxford University Press, 2010.
Harold Mattingly, Edward A. Sydenham, C. H. V. Sutherland, The Roman Imperial Coinage, vol. I, from 31 BC to AD 69, London, Spink & Son, 1923–1984.
Jane F. Mitchell, "The Torquati", in Historia: Zeitschrift für Alte Geschichte, vol. 15, part 1, (January 1966), pp. 23–31.
Friedrich Münzer, Roman Aristocratic Parties and Families, translated by Thérèse Ridley, Johns Hopkins University Press, 1999 (originally published in 1920).
August Pauly, Georg Wissowa, et alii, Realencyclopädie der Classischen Altertumswissenschaft, J. B. Metzler, Stuttgart (1894–1980).
Francis X. Ryan, Rank and Participation in the Republican Senate, Stuttgart, Franz Steiner Verlag, 1998.
Lily Ross Taylor and T. Robert S. Broughton, "The Order of the Two Consuls' Names in the Yearly Lists", Memoirs of the American Academy in Rome, 19 (1949), pp. 3–14.
F. W. Walbank, A. E. Astin, M. W. Frederiksen, R. M. Ogilvie (editors), The Cambridge Ancient History, vol. VII, part 2, The Rise of Rome to 220 B.C., Cambridge University Press, 1989.
Stephen P. Oakley, A Commentary on Livy, Books VI–X, Volume IV: Book X, Oxford University Press, 2005.
3rd-century BC Roman consuls
3rd-century BC births
202 BC deaths
Ancient Roman generals
Titus
Ancient Roman censors
Ancient Roman dictators
Ancient Roman patricians
Year of birth uncertain
|
The Toledo and Indiana Railway, Inc., was a combined electric interurban railroad and electric company that operated between Toledo, Ohio, and Bryan, Ohio, via Stryker, Ohio, from 1901 to 1939.
History
The Toledo & Indiana Railway, Inc., was incorporated in 1901 to construct an electric interurban line west from Toledo to Stryker, Ohio, and was extended in 1905 to Bryan, Ohio. The line ran parallel to the Lake Shore and Michigan Southern Railway (later the New York Central) on the north side of that alignment.
It was envisioned as being a link to Indianapolis, Indiana, and Chicago, Illinois. These expansions and connections were not completed. A branch of the Garrett, Auburn and Northern Electric Railroad from Waterloo, Indiana, to Bryan was never constructed. The line offered more frequent service at lower fares than the adjacent steam road. It had 31 stations on its 57-mile line between Toledo and Bryan. At its peak, Toledo was served by eleven interurban companies.
“In 1905, the T. & I. constructed a power plant near the Tiffin River in Stryker, and rails were extended to Bryan. Later that year, the T. & I. completed a car maintenance and storage facility east of its power plant and erected a combination passenger/freight depot on East Lynn Street in Stryker. The T. & I. power plant helped electrify northwest Ohio, bringing much of the area into the ‘modern age.’”
“As highways and secondary roads improved, and automobiles and trucks became more common, interurban railways struggled financially. In July 1939, the Public Utilities Commission of Ohio approved the T. & I’s request to abandon its interurban rail line.
“On October 15, 1939, T. & I. Car 115 made the last trip over the rail line piloted by Lendall W. Vernier of Stryker.”
The last T. & I. car arrived at the Vulcan station near the University of Toledo in 1939.
Portions of the abandoned right-of-way can still be seen. On September 23, 2006, an Ohio Historical Marker recognizing Stryker's rich railroad heritage was dedicated at the Stryker depot. The passenger station for the line through Wauseon became the Dyer & McDermott store downtown.
References
Interurban railways in Ohio
Railway lines opened in 1901
Railway lines closed in 1939
|
Wootton is a large village and civil parish located to the southwest of Bedford, in the north of Bedfordshire, England. The parish also includes the hamlets of Hall End, Keeley Green and Wootton Green.
History
Wootton has had a long association with brick-making, but is now mainly a dormitory community for Bedford and Milton Keynes. In the 18th century church bells were made here for several churches in Bedfordshire and adjoining counties. There has been a great deal of residential development over the last 30 years but some attractive old timber-framed houses still survive. The Church of St Mary the Virgin in the village is mainly 14th century but contains two fine monuments in the chancel to members of the Monoux family who died in 1685 and 1707. To the west of the church is Wootton House, an impressive late 17th-century house with a contemporary, red brick stable block.
Demography
The Domesday Book of 1086, listed Wootton as having 26 residents (20 villagers and six slaves) across ten hides. By 1901, the population had risen to 1,252. The population remained fairly steady throughout the first half of the 20th century. But by 1971, the population had climbed to 2,386, a 35.61% (1010 residents) increase within ten years. By 2001 that figure was 4,230.
According to the 2011 Census, the area covered by Wootton civil parish had 4,156 residents who lived in 1,654 households. The median age of the population is 44. Of these residents, 83% describe their health as "good" or "very good" and 2.6% of economically active people aged 16–74 were unemployed.
Village expansion
Wootton is currently expanding in size.
Housing plans include:
More than 1000 new houses on fields situated next to the A421 road.
Possible plans to build another 1000 houses on fields located on the road between the village and Kempston.
an upper school
small doctors Surgery
three shops
Salon
five Pubs
football club
Car Dealership
Garage
Office spaces
elderly Residential Home
three churches
library
fields
Development of Wootton Park as part of the expansion project was led by a consortium of Bovis, Bellway and Taylor Wimpey. ECL Civil Engineering was the sole civil engineering contractor on the 600 homes development south of the village of Wootton.
Sport and leisure
Wootton has a Non-League football team Wootton Blue Cross F.C., founded in 1887. For the 2020–21 season, they are members of the Bedfordshire County Football League Premier Division. Wootton Blue Cross play at Weston Park, that has a capacity of 750. The clubs most successful season came in the 2002–03 season, when they reached the 4th round of the FA Vase.
Public houses in Wootton
The Fox and Duck
Cock Inn
The Legstraps
The Blue Cross Members Club
The Cross Keys (Tre Fratelli)
Shops in Wootton
Tesco Express
Rumbles Fish & Chips
Pats Pizza
Pharmacy
Wootton Garage
Medical Health Centre
Women Salon
Sainsbury's Local
Londis / Post Office
Services in Wootton
Wootton Library
A number of independent companies
A R Security Systems
All About The Office Ltd
Assegai Security Solutions
Asta ay Permanent Make Up
Bedford Electrical
Coromel Cakes
D Young Carpentry Joinery and Renovations
Dream Digital
Floral Art By Ronnie
Foxglove Florals
Fresh Bites Catering
Hands in Harmony Home Care Services
Home Instead Senior Care
Pin Wizard
Simms Stuart
Bizzy Bees Pre-school
Wootton Vale Retirement Community
Notable residents
Letitia Dean, EastEnders actress
Steve Mattin, automobile designer
Past Residents
Mathew Scherne, clerk & vicar, fl. 1460
See also
Wootton Upper School
References
External links
Wootton Village Website
2001 Census - Parish Profile for Wootton
Villages in Bedfordshire
Civil parishes in Bedfordshire
Borough of Bedford
|
Duff Wilson is an American investigative reporter, formerly with The New York Times, later with Reuters. He is the first two-time winner of the Harvard University Goldsmith Prize for Investigative Reporting, a two-time winner of the George Polk Award, and a three-time finalist for the Pulitzer Prize.
Education
Wilson graduated from Western Washington University in 1976, and from the Columbia University Graduate School of Journalism in 1982.
Career
He has worked for The Seattle Times, The New York Times and Reuters and has served on the board of Investigative Reporters and Editors. Since 2010 he has taught investigative reporting at the Columbia University Graduate School of Journalism. Wilson joined The New York Times in 2004. During his time there, Wilson covered topics such as pharmaceutical and tobacco industries along with sports-related investigations, mainly steroids. One article he wrote about the Duke Lacrosse Case garnered criticism, as the case unraveled. Prior to working for The Times, he worked as an investigative projects reporter for The Seattle Times since 1989. Before working here, he worked for the Seattle Post-Intelligencer and the Associated Press. At the Seattle PI, Wilson wrote that paper's story about Gary Little. Wilson is also a webmaster of Reporter's Desktop.
Family
Wilson's father and brother published a weekly newspaper in Washington. He has two children with Barbara Wilson, a high school teacher.
Works
Awards and honors
1998; 2002 Goldsmith Prize for Investigative Reporting
2001; 2003 George Polk Award for medical and local reporting
2002 Gerald Loeb Award for Large Newspapers
2002 Heywood Broun Award
May 2012 Sidney Award
2003; 2002; 1998 three time Pulitzer finalist
Public-service awards from the Associated Press Managing Editors and the Newspaper Guild
2002; Book-of-the-year honors from IRE for his book Fateful Harvest: The True Story of a Small Town, a Global Industry, and a Toxic Secret
USACBL champion
References
External links
"New FDA Regulations Could Change Smokers' Habits", NPR, April 22, 2010
Journalist's blog
Journalist's twitter
http://www.reporter.org/desktop/rd/duffbio.htm
American male journalists
George Polk Award recipients
The New York Times writers
Western Washington University alumni
Columbia University Graduate School of Journalism alumni
Living people
1950s births
20th-century American journalists
Gerald Loeb Award winners for Large Newspapers
|
```html
<!DOCTYPE HTML>
<html>
<head>
<title>JSONEditor | Load and save</title>
<link href="../dist/jsoneditor.css" rel="stylesheet" type="text/css">
<script src="../dist/jsoneditor.js"></script>
<script src="path_to_url"></script>
<script src="path_to_url"></script>
<style>
html, body {
font: 11pt sans-serif;
}
#jsoneditor {
width: 500px;
height: 500px;
}
</style>
</head>
<body>
<h1>Load and save JSON documents</h1>
<p>
This examples uses HTML5 to load/save local files.
Powered by <a href="path_to_url">FileReader.js</a> and
<a href="path_to_url">FileSaver.js</a>.<br>
Only supported on modern browsers (Chrome, FireFox, IE10+, Safari 6.1+, Opera 15+).
</p>
<p>
Load a JSON document: <input type="file" id="loadDocument" value="Load"/>
</p>
<p>
Save a JSON document: <input type="button" id="saveDocument" value="Save" />
</p>
<div id="jsoneditor"></div>
<script>
// create the editor
var editor = new JSONEditor(document.getElementById('jsoneditor'));
// Load a JSON document
FileReaderJS.setupInput(document.getElementById('loadDocument'), {
readAsDefault: 'Text',
on: {
load: function (event, file) {
editor.setText(event.target.result);
}
}
});
// Save a JSON document
document.getElementById('saveDocument').onclick = function () {
var blob = new Blob([editor.getText()], {type: 'application/json;charset=utf-8'});
saveAs(blob, 'document.json');
};
</script>
</body>
</html>
```
|
```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\ContainerAnalysis;
class DiscoveryNote extends \Google\Model
{
/**
* @var string
*/
public $analysisKind;
/**
* @param string
*/
public function setAnalysisKind($analysisKind)
{
$this->analysisKind = $analysisKind;
}
/**
* @return string
*/
public function getAnalysisKind()
{
return $this->analysisKind;
}
}
// Adding a class alias for backwards compatibility with the previous class name.
class_alias(DiscoveryNote::class, 'Google_Service_ContainerAnalysis_DiscoveryNote');
```
|
The Amboy was a wooden schooner barge that sank along with her towing steamer, the George Spencer on Lake Superior off the coast of Schroeder, Cook County, Minnesota in the United States. In 1994 the remains of the Amboy were added to the National Register of Historic Places.
History
The Amboy (Official number 95276) was a wooden schooner barge that was constructed specifically for the Minnesota's iron ore trade. She was built in 1874 by Quayle & Murphy of Cleveland, Ohio. She was in length, her beam was and her cargo hold was . She had a gross tonnage of 893 tons, and a net tonnage of 849 tons. She could carry approximately 1,500 tons of cargo. She was originally named Helena. In July 1891 the Helena sank in a collision in the Little Mud Lake, St. Marys River with the loss of one life.
On August 26, 1892, the Amboy arrived in Cleveland, Ohio, full of water. She was traveling from Escanaba, Michigan, when she was caught in a storm. Eventually the amount of water pouring into her hull became too much for the pumps to empty. She was eventually saved by the tugboats Gregory and Blazier; they towed the Amboy to Cleveland.
On October 14, 1893 the Amboy ran aground at the foot of Georgia Street in Buffalo, New York. She was in tow of the steamer Helena but broke away in the strong gale. The Helena left the Amboy to be freed by tugboats. Eventually the tug Cascade came to her assistance and after about half an hours work she was freed.
On September 5, 1898, at around 10:00A.M. the Amboy ran aground in the Niagara River near the Germania Park. She was under tow of the tug James Byers; she was bound from Tonawanda, New York with a cargo of iron ore in her cargo hold. Low water levels caused her keel to hit bottom and run aground. The Byers failed to free her. Eventually the tugs Cascade, Hibbard and Conneaut arrived to try and free her but also failed. A lighter was also sent to try and rescue her by removing part of her cargo.
Final voyage
On the day of November 28, 1905 the Amboy and the wooden bulk freighter George Spencer were bound from Buffalo, New York for Duluth, Minnesota with a cargo of coal when they were struck by the full force of the Mataafa Storm. After the storm blew itself out it was discovered that 18 ships were wrecked or stranded; and one, the steamer Ira H. Owen was lost with all hands. The crew of the Spencer cut the line between her and the Amboy in an attempt to save both of the ships. Both vessels were driven ashore. The crew of the ships escaped the vessels with a breeches' buoy which was rigged up by some nearby fishermen. A December 1, 1905 issue of the Duluth Evening Herald described the wreck of the Spencer and the Amboy:
Both boats lost their bearings in the snowstorm and landed on a sandy beach. As soon as they struck, buoys with lines were thrown over the side. When they floated ashore they were caught by fishermen and made fast. With an improvised life buoy rigged in the hawsers the entire crew were taken safely to shore preceded by Mrs. Harry Lawe, wife of the mate, who was acting as steward. The vessels ran on the rocks Tuesday morning, and for thirteen hours the situation of the crew on the battered hulks was desperate. Fishermen rushed into the surf almost to their necks and aided the sailors to escape. The Spencer cargo can be lightered but there is little hope for saving the boat. The vessels were coming up without cargo to load ore. Capt. Frank Conland sailed the Spencer and Fred Watson was master of the Amboy. The Spencer was valued at $35,000 and the Amboy at $10,000.
A December 6, 1905 issue of the Duluth News Tribune wrote about the assessment of the wrecks:
Captain C.O. Flynn returned last evening from an inspection of the stranded steamer George Spencer and schooner Amboy. He said "the schooner Amboy is a total wreck ... the steamer Spencer is still in good shape. Her hatches are intact, and she does not appear to be seriously damaged. As to the condition of her bottom that cannot be told at present.
The Amboy today
The remains of the Amboy lie not too far from the wreck of the Spencer. The remains of the Amboy's keelson is encased in sand and cobbles. The section of her keelson which is parallel to the beach has been eroded by the waves, it consists of side-by-side white oak timbers. It is two timbers high and secured with hundreds of iron bolts that are 1.25 and .875 inches in diameter. Near the southern end of the timbers there is an upright timber which is believed to be part of her centreboard. These remains can easily be viewed with satellite imagery, such as Google Earth.
References
1874 ships
Maritime incidents in 1905
Great Lakes freighters
Steamships of the United States
Merchant ships of the United States
Shipwrecks of Lake Superior
Shipwrecks on the National Register of Historic Places in Minnesota
National Register of Historic Places in Cook County, Minnesota
Ships built in Cleveland
Schooner barges
Barges of the United States
Schooners of the United States
Shipwrecks of the Minnesota coast
Wreck diving sites in the United States
Ships sunk in storms
|
Lone Star Moonlight is a 1946 American Western film directed by Ray Nazarro and written by Louise Rousseau. The film stars Ken Curtis, Joan Barton, Guy Kibbee, Robert Kellard, Claudia Drake and Arthur Loft. It was released on December 12, 1946 by Columbia Pictures.
Plot
Cast
Ken Curtis as Curt Norton
Joan Barton as Jean White
Guy Kibbee as Amos Norton
Robert Kellard as Eddie Jackson
Claudia Drake as Mimi Carston
Arthur Loft as Thaddeus White
Vernon Dent as Sheriff
Sam Flint as Jim Mahoney
Ken Trietsch as Hoosier Hotshot Ken
Paul Trietsch as Hoosier Hotshot Hezzie
Gil Taylor as Hoosier Hotshot Gil
Charles Ward as Hoosier Hotshot Gabe
Merle Travis as Merle Travis
Judy Clark as Judy Clark
References
External links
1946 films
1940s English-language films
American Western (genre) films
1946 Western (genre) films
Columbia Pictures films
Films directed by Ray Nazarro
American black-and-white films
1940s American films
|
The 2004 Rushmoor Council election took place on 10 June 2004 to elect members of Rushmoor Borough Council in Hampshire, England. One third of the council was up for election and the Conservative Party stayed in overall control of the council.
After the election, the composition of the council was:
Conservative 24
Liberal Democrat 12
Labour 5
Independent 1
Campaign
14 seats were contested in the election–a third of the council–with the Conservatives defending 9, the Liberal Democrats 3 and Labour 2. Apart from candidates from the Conservative, Liberal Democrat, Labour, Green and English Democrat parties which had stood candidates in the 2003 election, there were also 3 members of the British National Party standing in Rushmoor for the first time. They stood in 3 Farnborough wards, Fernhill, Grange and Mayfield.
2 independent candidates also contested the election. Rosemary Possee stood as an independent in Empress ward, where she had previously served as a councillor for the Conservatives before being de-selected, challenging the official Conservative candidate Patricia Hodge. The other independent candidate, taxi driver Roger Watkins, stood in Wellington ward. Watkins was investigated by the police over claims that some signatures on his nomination form had not been made by the voters themselves; however the police concluded there was no problem and Watkins accused his rivals of dirty tricks.
The contest in Heronwood ward also caused controversy after a leaflet from the Conservative candidate Eddie Poole accused the Liberal Democrat candidate Peter Sandy of "bully boy tactics". Sandy complained to council officials over the leaflet, which he described as a slur, but Poole said he stood by the comment.
Election result
The results saw the Conservatives remain in control of the council with 24 of the 42 seats, but the Liberal Democrats did gain 2 to hold 12 seats. One of the gains came in Manor Park where Liberal Democrat George Paparesti returned to the council 2 years after losing his seat in the 2002 election. The other gain came in Heron Wood, which had been regarded as the safest Labour seat on the council, but saw Liberal Democrat Peter Sandy win by 88 votes defeating the Labour mayor of the council Frank Rust. This meant Labour was reduced to just 5 seats on the council, with the party's candidates having finished fourth in 4 Farnborough wards.
No other seats changed parties, but there were close results in St Marks where the Conservatives held the seat by 12 votes over the Liberal Democrats and in Cove and Southwood where the Liberal Democrats held on by 38 votes over the Conservatives. Rosemary Possee failed to win re-election in Empress ward as an independent, being beaten into third place with the Conservatives holding the seat. Overall turnout in the election was 36.5% up from the 31% seen in 2003 and boosted by an 80% increase in postal votes.
The result in Heron Wood caused controversy with the defeated Labour candidate Frank Rust blaming Tony Blair's support for the Iraq War for his defeat. Meanwhile, the Conservative Member of Parliament for Aldershot Gerald Howarth criticised the winning Liberal Democrat Peter Sandy for not attending the count and said that "It’s a pretty poor show. I do not feel he will be an asset to Heronwood". Peter Sandy, who is disabled, said that he had been unable to attend the count as the battery on his wheelchair was flat and he was defended by his fellow Liberal Democrats.
Ward results
References
2004
2004 English local elections
2000s in Hampshire
|
```sqlpl
-- Tags: no-fasttest
SELECT sipHash64(1, 2, 3);
SELECT sipHash64(1, 3, 2);
SELECT sipHash64(('a', [1, 2, 3], 4, (4, ['foo', 'bar'], 1, (1, 2))));
SELECT hex(sipHash128('foo'));
SELECT hex(sipHash128('\x01'));
SELECT hex(sipHash128('foo', 'foo'));
SELECT hex(sipHash128('foo', 'foo', 'foo'));
SELECT hex(sipHash128(1, 2, 3));
SELECT halfMD5(1, 2, 3);
SELECT halfMD5(1, 3, 2);
SELECT halfMD5(('a', [1, 2, 3], 4, (4, ['foo', 'bar'], 1, (1, 2))));
SELECT murmurHash2_32(1, 2, 3);
SELECT murmurHash2_32(1, 3, 2);
SELECT murmurHash2_32(('a', [1, 2, 3], 4, (4, ['foo', 'bar'], (1, 2))));
SELECT murmurHash2_64(1, 2, 3);
SELECT murmurHash2_64(1, 3, 2);
SELECT murmurHash2_64(('a', [1, 2, 3], 4, (4, ['foo', 'bar'], 1, (1, 2))));
SELECT murmurHash3_64(1, 2, 3);
SELECT murmurHash3_64(1, 3, 2);
SELECT murmurHash3_64(('a', [1, 2, 3], 4, (4, ['foo', 'bar'], 1, (1, 2))));
SELECT hex(murmurHash3_128('foo', 'foo'));
SELECT hex(murmurHash3_128('foo', 'foo', 'foo'));
SELECT gccMurmurHash(1, 2, 3);
SELECT gccMurmurHash(1, 3, 2);
SELECT gccMurmurHash(('a', [1, 2, 3], 4, (4, ['foo', 'bar'], 1, (1, 2))));
```
|
```kotlin
package cn.yiiguxing.plugin.translate.ui
import cn.yiiguxing.plugin.translate.ui.UI.emptyBorder
import cn.yiiguxing.plugin.translate.ui.settings.SettingsUi
import com.intellij.ui.components.JBScrollPane
fun main() = uiTest("Settings UI Test", 650, 900/*, true*/) {
val settingsUi = object : SettingsUi() {
override fun isSupportDocumentTranslation(): Boolean = true
}
val panel = settingsUi.createMainPanel()
panel.border = emptyBorder(11, 16)
JBScrollPane(panel)
}
```
|
```objective-c
/*
**********************************************************************
* and others. All Rights Reserved.
**********************************************************************
* Date Name Description
* 01/14/2002 aliu Creation.
**********************************************************************
*/
#ifndef UNIFUNCT_H
#define UNIFUNCT_H
#include "unicode/utypes.h"
#include "unicode/uobject.h"
/**
* \file
* \brief C++ API: Unicode Functor
*/
U_NAMESPACE_BEGIN
class UnicodeMatcher;
class UnicodeReplacer;
class TransliterationRuleData;
/**
* <code>UnicodeFunctor</code> is an abstract base class for objects
* that perform match and/or replace operations on Unicode strings.
* @author Alan Liu
* @stable ICU 2.4
*/
class U_COMMON_API UnicodeFunctor : public UObject {
public:
/**
* Destructor
* @stable ICU 2.4
*/
virtual ~UnicodeFunctor();
/**
* Return a copy of this object. All UnicodeFunctor objects
* have to support cloning in order to allow classes using
* UnicodeFunctor to implement cloning.
* @stable ICU 2.4
*/
virtual UnicodeFunctor* clone() const = 0;
/**
* Cast 'this' to a UnicodeMatcher* pointer and return the
* pointer, or null if this is not a UnicodeMatcher*. Subclasses
* that mix in UnicodeMatcher as a base class must override this.
* This protocol is required because a pointer to a UnicodeFunctor
* cannot be cast to a pointer to a UnicodeMatcher, since
* UnicodeMatcher is a mixin that does not derive from
* UnicodeFunctor.
* @stable ICU 2.4
*/
virtual UnicodeMatcher* toMatcher() const;
/**
* Cast 'this' to a UnicodeReplacer* pointer and return the
* pointer, or null if this is not a UnicodeReplacer*. Subclasses
* that mix in UnicodeReplacer as a base class must override this.
* This protocol is required because a pointer to a UnicodeFunctor
* cannot be cast to a pointer to a UnicodeReplacer, since
* UnicodeReplacer is a mixin that does not derive from
* UnicodeFunctor.
* @stable ICU 2.4
*/
virtual UnicodeReplacer* toReplacer() const;
/**
* Return the class ID for this class. This is useful only for
* comparing to a return value from getDynamicClassID().
* @return The class ID for all objects of this class.
* @stable ICU 2.0
*/
static UClassID U_EXPORT2 getStaticClassID(void);
/**
* Returns a unique class ID <b>polymorphically</b>. This method
* is to implement a simple version of RTTI, since not all C++
* compilers support genuine RTTI. Polymorphic operator==() and
* clone() methods call this method.
*
* <p>Concrete subclasses of UnicodeFunctor should use the macro
* UOBJECT_DEFINE_RTTI_IMPLEMENTATION from uobject.h to
* provide definitios getStaticClassID and getDynamicClassID.
*
* @return The class ID for this object. All objects of a given
* class have the same class ID. Objects of other classes have
* different class IDs.
* @stable ICU 2.4
*/
virtual UClassID getDynamicClassID(void) const = 0;
/**
* Set the data object associated with this functor. The data
* object provides context for functor-to-standin mapping. This
* method is required when assigning a functor to a different data
* object. This function MAY GO AWAY later if the architecture is
* changed to pass data object pointers through the API.
* @internal ICU 2.1
*/
virtual void setData(const TransliterationRuleData*) = 0;
protected:
/**
* Since this class has pure virtual functions,
* a constructor can't be used.
* @stable ICU 2.0
*/
/*UnicodeFunctor();*/
};
/*inline UnicodeFunctor::UnicodeFunctor() {}*/
U_NAMESPACE_END
#endif
```
|
Dachung Musa Bagos was born on June 4, 1977, in Apata, Jos North Local Government Area of Plateau State. He is a Nigerian politician of the Peoples Democratic Party from Plateau State, Nigeria. He is a member of the Nigeria Federal House of Representatives from Jos South/Jos East federal constituency of Plateau State in the 9th National Assembly. He was elected to the House in 2019. Dachung was re-elected into the Federal House of Representatives for the second time in the 2023 general election.
Education
After studying at Ekan Primary School, he obtained his tertiary education at the Jos Development Enterprise Commercial School where he received a Diploma in Secretariat Administration.
Dachung proceeded to the University of Jos where he obtained a Diploma in Law and subsequently, the Jos ECWA Theological Seminary to broaden his spectrum of Education and knowledge.
Personal life and philanthropy
To improve the educational quality of his constituency, Honorable Dachung Musa Bagos has commissioned two modern classrooms with office, store and solar power for pupils of Gwandang LEA Primary School, Bukuru-Gyel of Jos South LGA of Plateau State.
He has also paid school fees for female students of Government Technical College Bukuru and distributes hundreds of exercise books to the students of the institution.
His foundation, Dachung Musa Bagos Foundation has given scholarship to 598 students of Government Secondary School Godong in Jos East LGA, and Government Secondary School Chugwi in Jos South LGA.
After an attack by Fulani militants in Plateau State on Sunday 31 July, with seven Christians killed and two others severely injured, Bagos visited the victims, condemned the killings as “callous” and “inhumane”, and paid the medical bills of those injured.
See also
Peoples Democratic Party
Plateau State
National Assembly
References
https://nass.gov.ng/mps/single/136
Plateau State
Members of the House of Representatives (Nigeria)
1977 births
Living people
Peoples Democratic Party members of the House of Representatives (Nigeria)
People from Plateau State
Nigerian human rights activists
Berom people
|
Morgan Jenness is an American freelance dramaturg based in New York City.
Biography
For over ten years, Jenness worked at The Public Theater, under both George C. Wolfe and Joseph Papp in roles ranging from literary manager to Director of Play Development to Associate Producer of the New York Shakespeare Festival. They were also Associate Artistic Director at the New York Theatre Workshop, and an Associate Director at the Los Angeles Theater Center in charge of new projects. They have worked with the Young Playwrights Festival, the Mark Taper Forum, the Playwrights Center/Playlabs, the Bay Area Playwrights Festival, Double Image/New York Stage and Film, CSC, Victory Gardens, Hartford Stage, and Center Stage as a dramaturg, workshop director, and/or artistic consultant. They have participated as a visiting artist and adjunct in playwriting programs at the University of Iowa, Brown University, Bread Loaf, Columbia and NYU and are currently on the faculty at Fordham University at Lincoln Center and Pace University, where they teach theater history.
Jenness has served on peer panels for various funding institutions, including NYSCA and the National Endowment for the Arts, with whom they served as a site evaluator for almost a decade. In 1998 Ms. Jenness joined Helen Merrill Ltd., an agency representing writers, directors, composers and designers, as Creative Director. They now work at Abrams Artist Agency as an agent representing writers for stage and screen, directors, composers and lyricists. In 2003, Ms. Jenness was presented with an Obie Award Special Citation for Longtime Support of Playwrights. At its 30th Anniversary Conference in New York City, the Literary Managers and Dramaturgs of the Americas presented the G. E. Lessing Award for Career Achievement to Morgan Jenness. The Lessing Award is LMDA's most prestigious award, given for lifetime achievement in the field of dramaturgy. As of 2015, Jenness is only the sixth recipient of the award in LMDA's 30-year history.
Jenness was a recipient of a prestigious 2015 Doris Duke Impact Award and is currently working as an activist and artistic consultant via In This Distracted Globe.
References
Living people
20th-century American dramatists and playwrights
Writers from New York City
Year of birth missing (living people)
Fordham University faculty
American women dramatists and playwrights
20th-century American women writers
American women academics
21st-century American women
|
Monsieur Beaucaire is a 1924 American silent romantic historical drama film starring Rudolph Valentino in the title role, Bebe Daniels, and Lois Wilson. Produced and directed by Sidney Olcott, the film is based on Booth Tarkington's 1900 novel of the same name and the 1904 play of the same name by Tarkington and Evelyn Greenleaf Sutherland.
Plot
The Duke of Chartres is in love with Princess Henriette, but she seemingly wants nothing to do with him. Eventually he grows tired of her insults and flees to England when Louis XV insists that the two marry. He goes undercover as Monsieur Beaucaire, the barber of the French Ambassador, and finds that he enjoys the freedom of a commoner’s life. After catching the Duke of Winterset cheating at cards, he forces him to introduce him as a nobleman to Lady Mary, with whom he has become infatuated. When Lady Mary is led to believe that the Duke of Chartres is merely a barber she loses interest in him. She eventually learns that he is a nobleman after all and tries to win him back, but the Duke of Chartres opts to return to France and Princess Henriette who now returns his affection.
Cast
Production notes
Monsieur Beaucaire was produced by Famous Players–Lasky, directed by Sidney Olcott, and distributed by Paramount Pictures. It was filmed at Kaufman Astoria Studios in New York City.
For this film, whose action is set at the court of King Louis XV of France, the atmosphere is resolutely French and French-speaking. It is French dancer Paulette Duval's second American picture; the Belgian André Daven, playing the brother of Valentino's character, was hired for his resemblance to the Latin lover; the Nantes-based Georges Barbier designed the 350 costumes. The film's dialogues were written in French for more realism. Valentino speaks French, as do Bebe Daniels, Lowell Sherman and Sidney Olcott.
Reception
Monsieur Beaucaire was part of a series of box office and critical disappointments that plagued Valentino mid-career. Although the film did fairly well in big cities, it flopped in smaller locales, and could not exceed the expensive budget Olcott put into the film's production. Historians Kevin Brownlow and John Kobal suggested that the film's shortcomings stemmed more from Olcott's "pedestrian" direction.
Much of the blame for the film's alleged shortcomings was assigned to Valentino's wife Natacha Rambova who was felt by many of Valentino's colleagues to have had an undue influence on the costumes, set and direction of the film. Alicia Annas wrote that audiences were most likely alienated by the general design of the film which, while historically accurate, was not tailored to 1920s American filmgoers' tastes. The Stan Laurel parody Monsieur Don't Care (1924) reflected the general public attitude toward Monsieur Beaucaire.
Adaptations
The novel Monsieur Beaucaire was adapted into a musical film, Monte Carlo (1930), directed by Ernst Lubitsch. The story was filmed again as a comedy, directed by George Marshall and starring Bob Hope and Joan Caulfield, also called Monsieur Beaucaire (1946).
The 1951 biopic Valentino, produced by Columbia Pictures, directed by Lewis Allen with Anthony Dexter, includes a sequence dedicated to Monsieur Beaucaire.
A long sequence dedicated to Monsieur Beaucaire appears in the 1977 film Valentino (1977), directed by Ken Russell, with Rudolf Nureyev in the title role and John Justin in the role of Sidney Olcott.
References
External links
Monsieur Beaucaire web site dedicated to Sidney Olcott
Stills at silenthollywood.com
1924 films
1924 romantic drama films
1920s historical romance films
American black-and-white films
American silent feature films
Famous Players-Lasky films
Films based on works by Booth Tarkington
Films directed by Sidney Olcott
Films set in England
Films set in France
Films set in the 18th century
Films shot in New York City
Cultural depictions of Louis XV
Cultural depictions of Madame de Pompadour
American historical romance films
Films shot at Astoria Studios
Surviving American silent films
1920s American films
English-language romantic drama films
Silent American romantic drama films
1920s English-language films
Silent historical romance films
|
```c
/*
* jddctmgr.c
*
* Modified 2002-2013 by Guido Vollbeding.
* This file is part of the Independent JPEG Group's software.
* For conditions of distribution and use, see the accompanying README file.
*
* This file contains the inverse-DCT management logic.
* This code selects a particular IDCT implementation to be used,
* and it performs related housekeeping chores. No code in this file
* is executed per IDCT step, only during output pass setup.
*
* Note that the IDCT routines are responsible for performing coefficient
* dequantization as well as the IDCT proper. This module sets up the
* dequantization multiplier table needed by the IDCT routine.
*/
#define JPEG_INTERNALS
#include "jinclude.h"
#include "jpeglib.h"
#include "jdct.h" /* Private declarations for DCT subsystem */
/*
* The decompressor input side (jdinput.c) saves away the appropriate
* quantization table for each component at the start of the first scan
* involving that component. (This is necessary in order to correctly
* decode files that reuse Q-table slots.)
* When we are ready to make an output pass, the saved Q-table is converted
* to a multiplier table that will actually be used by the IDCT routine.
* The multiplier table contents are IDCT-method-dependent. To support
* application changes in IDCT method between scans, we can remake the
* multiplier tables if necessary.
* In buffered-image mode, the first output pass may occur before any data
* has been seen for some components, and thus before their Q-tables have
* been saved away. To handle this case, multiplier tables are preset
* to zeroes; the result of the IDCT will be a neutral gray level.
*/
/* Private subobject for this module */
typedef struct {
struct jpeg_inverse_dct pub; /* public fields */
/* This array contains the IDCT method code that each multiplier table
* is currently set up for, or -1 if it's not yet set up.
* The actual multiplier tables are pointed to by dct_table in the
* per-component comp_info structures.
*/
int cur_method[MAX_COMPONENTS];
} my_idct_controller;
typedef my_idct_controller * my_idct_ptr;
/* Allocated multiplier tables: big enough for any supported variant */
typedef union {
ISLOW_MULT_TYPE islow_array[DCTSIZE2];
#ifdef DCT_IFAST_SUPPORTED
IFAST_MULT_TYPE ifast_array[DCTSIZE2];
#endif
#ifdef DCT_FLOAT_SUPPORTED
FLOAT_MULT_TYPE float_array[DCTSIZE2];
#endif
} multiplier_table;
/* The current scaled-IDCT routines require ISLOW-style multiplier tables,
* so be sure to compile that code if either ISLOW or SCALING is requested.
*/
#ifdef DCT_ISLOW_SUPPORTED
#define PROVIDE_ISLOW_TABLES
#else
#ifdef IDCT_SCALING_SUPPORTED
#define PROVIDE_ISLOW_TABLES
#endif
#endif
/*
* Prepare for an output pass.
* Here we select the proper IDCT routine for each component and build
* a matching multiplier table.
*/
METHODDEF(void)
start_pass (j_decompress_ptr cinfo)
{
my_idct_ptr idct = (my_idct_ptr) cinfo->idct;
int ci, i;
jpeg_component_info *compptr;
int method = 0;
inverse_DCT_method_ptr method_ptr = NULL;
JQUANT_TBL * qtbl;
for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components;
ci++, compptr++) {
/* Select the proper IDCT routine for this component's scaling */
switch ((compptr->DCT_h_scaled_size << 8) + compptr->DCT_v_scaled_size) {
#ifdef IDCT_SCALING_SUPPORTED
case ((1 << 8) + 1):
method_ptr = jpeg_idct_1x1;
method = JDCT_ISLOW; /* jidctint uses islow-style table */
break;
case ((2 << 8) + 2):
method_ptr = jpeg_idct_2x2;
method = JDCT_ISLOW; /* jidctint uses islow-style table */
break;
case ((3 << 8) + 3):
method_ptr = jpeg_idct_3x3;
method = JDCT_ISLOW; /* jidctint uses islow-style table */
break;
case ((4 << 8) + 4):
method_ptr = jpeg_idct_4x4;
method = JDCT_ISLOW; /* jidctint uses islow-style table */
break;
case ((5 << 8) + 5):
method_ptr = jpeg_idct_5x5;
method = JDCT_ISLOW; /* jidctint uses islow-style table */
break;
case ((6 << 8) + 6):
method_ptr = jpeg_idct_6x6;
method = JDCT_ISLOW; /* jidctint uses islow-style table */
break;
case ((7 << 8) + 7):
method_ptr = jpeg_idct_7x7;
method = JDCT_ISLOW; /* jidctint uses islow-style table */
break;
case ((9 << 8) + 9):
method_ptr = jpeg_idct_9x9;
method = JDCT_ISLOW; /* jidctint uses islow-style table */
break;
case ((10 << 8) + 10):
method_ptr = jpeg_idct_10x10;
method = JDCT_ISLOW; /* jidctint uses islow-style table */
break;
case ((11 << 8) + 11):
method_ptr = jpeg_idct_11x11;
method = JDCT_ISLOW; /* jidctint uses islow-style table */
break;
case ((12 << 8) + 12):
method_ptr = jpeg_idct_12x12;
method = JDCT_ISLOW; /* jidctint uses islow-style table */
break;
case ((13 << 8) + 13):
method_ptr = jpeg_idct_13x13;
method = JDCT_ISLOW; /* jidctint uses islow-style table */
break;
case ((14 << 8) + 14):
method_ptr = jpeg_idct_14x14;
method = JDCT_ISLOW; /* jidctint uses islow-style table */
break;
case ((15 << 8) + 15):
method_ptr = jpeg_idct_15x15;
method = JDCT_ISLOW; /* jidctint uses islow-style table */
break;
case ((16 << 8) + 16):
method_ptr = jpeg_idct_16x16;
method = JDCT_ISLOW; /* jidctint uses islow-style table */
break;
case ((16 << 8) + 8):
method_ptr = jpeg_idct_16x8;
method = JDCT_ISLOW; /* jidctint uses islow-style table */
break;
case ((14 << 8) + 7):
method_ptr = jpeg_idct_14x7;
method = JDCT_ISLOW; /* jidctint uses islow-style table */
break;
case ((12 << 8) + 6):
method_ptr = jpeg_idct_12x6;
method = JDCT_ISLOW; /* jidctint uses islow-style table */
break;
case ((10 << 8) + 5):
method_ptr = jpeg_idct_10x5;
method = JDCT_ISLOW; /* jidctint uses islow-style table */
break;
case ((8 << 8) + 4):
method_ptr = jpeg_idct_8x4;
method = JDCT_ISLOW; /* jidctint uses islow-style table */
break;
case ((6 << 8) + 3):
method_ptr = jpeg_idct_6x3;
method = JDCT_ISLOW; /* jidctint uses islow-style table */
break;
case ((4 << 8) + 2):
method_ptr = jpeg_idct_4x2;
method = JDCT_ISLOW; /* jidctint uses islow-style table */
break;
case ((2 << 8) + 1):
method_ptr = jpeg_idct_2x1;
method = JDCT_ISLOW; /* jidctint uses islow-style table */
break;
case ((8 << 8) + 16):
method_ptr = jpeg_idct_8x16;
method = JDCT_ISLOW; /* jidctint uses islow-style table */
break;
case ((7 << 8) + 14):
method_ptr = jpeg_idct_7x14;
method = JDCT_ISLOW; /* jidctint uses islow-style table */
break;
case ((6 << 8) + 12):
method_ptr = jpeg_idct_6x12;
method = JDCT_ISLOW; /* jidctint uses islow-style table */
break;
case ((5 << 8) + 10):
method_ptr = jpeg_idct_5x10;
method = JDCT_ISLOW; /* jidctint uses islow-style table */
break;
case ((4 << 8) + 8):
method_ptr = jpeg_idct_4x8;
method = JDCT_ISLOW; /* jidctint uses islow-style table */
break;
case ((3 << 8) + 6):
method_ptr = jpeg_idct_3x6;
method = JDCT_ISLOW; /* jidctint uses islow-style table */
break;
case ((2 << 8) + 4):
method_ptr = jpeg_idct_2x4;
method = JDCT_ISLOW; /* jidctint uses islow-style table */
break;
case ((1 << 8) + 2):
method_ptr = jpeg_idct_1x2;
method = JDCT_ISLOW; /* jidctint uses islow-style table */
break;
#endif
case ((DCTSIZE << 8) + DCTSIZE):
switch (cinfo->dct_method) {
#ifdef DCT_ISLOW_SUPPORTED
case JDCT_ISLOW:
method_ptr = jpeg_idct_islow;
method = JDCT_ISLOW;
break;
#endif
#ifdef DCT_IFAST_SUPPORTED
case JDCT_IFAST:
method_ptr = jpeg_idct_ifast;
method = JDCT_IFAST;
break;
#endif
#ifdef DCT_FLOAT_SUPPORTED
case JDCT_FLOAT:
method_ptr = jpeg_idct_float;
method = JDCT_FLOAT;
break;
#endif
default:
ERREXIT(cinfo, JERR_NOT_COMPILED);
break;
}
break;
default:
ERREXIT2(cinfo, JERR_BAD_DCTSIZE,
compptr->DCT_h_scaled_size, compptr->DCT_v_scaled_size);
break;
}
idct->pub.inverse_DCT[ci] = method_ptr;
/* Create multiplier table from quant table.
* However, we can skip this if the component is uninteresting
* or if we already built the table. Also, if no quant table
* has yet been saved for the component, we leave the
* multiplier table all-zero; we'll be reading zeroes from the
* coefficient controller's buffer anyway.
*/
if (! compptr->component_needed || idct->cur_method[ci] == method)
continue;
qtbl = compptr->quant_table;
if (qtbl == NULL) /* happens if no data yet for component */
continue;
idct->cur_method[ci] = method;
switch (method) {
#ifdef PROVIDE_ISLOW_TABLES
case JDCT_ISLOW:
{
/* For LL&M IDCT method, multipliers are equal to raw quantization
* coefficients, but are stored as ints to ensure access efficiency.
*/
ISLOW_MULT_TYPE * ismtbl = (ISLOW_MULT_TYPE *) compptr->dct_table;
for (i = 0; i < DCTSIZE2; i++) {
ismtbl[i] = (ISLOW_MULT_TYPE) qtbl->quantval[i];
}
}
break;
#endif
#ifdef DCT_IFAST_SUPPORTED
case JDCT_IFAST:
{
/* For AA&N IDCT method, multipliers are equal to quantization
* coefficients scaled by scalefactor[row]*scalefactor[col], where
* scalefactor[0] = 1
* scalefactor[k] = cos(k*PI/16) * sqrt(2) for k=1..7
* For integer operation, the multiplier table is to be scaled by
* IFAST_SCALE_BITS.
*/
IFAST_MULT_TYPE * ifmtbl = (IFAST_MULT_TYPE *) compptr->dct_table;
#define CONST_BITS 14
static const INT16 aanscales[DCTSIZE2] = {
/* precomputed values scaled up by 14 bits */
16384, 22725, 21407, 19266, 16384, 12873, 8867, 4520,
22725, 31521, 29692, 26722, 22725, 17855, 12299, 6270,
21407, 29692, 27969, 25172, 21407, 16819, 11585, 5906,
19266, 26722, 25172, 22654, 19266, 15137, 10426, 5315,
16384, 22725, 21407, 19266, 16384, 12873, 8867, 4520,
12873, 17855, 16819, 15137, 12873, 10114, 6967, 3552,
8867, 12299, 11585, 10426, 8867, 6967, 4799, 2446,
4520, 6270, 5906, 5315, 4520, 3552, 2446, 1247
};
SHIFT_TEMPS
for (i = 0; i < DCTSIZE2; i++) {
ifmtbl[i] = (IFAST_MULT_TYPE)
DESCALE(MULTIPLY16V16((INT32) qtbl->quantval[i],
(INT32) aanscales[i]),
CONST_BITS-IFAST_SCALE_BITS);
}
}
break;
#endif
#ifdef DCT_FLOAT_SUPPORTED
case JDCT_FLOAT:
{
/* For float AA&N IDCT method, multipliers are equal to quantization
* coefficients scaled by scalefactor[row]*scalefactor[col], where
* scalefactor[0] = 1
* scalefactor[k] = cos(k*PI/16) * sqrt(2) for k=1..7
* We apply a further scale factor of 1/8.
*/
FLOAT_MULT_TYPE * fmtbl = (FLOAT_MULT_TYPE *) compptr->dct_table;
int row, col;
static const double aanscalefactor[DCTSIZE] = {
1.0, 1.387039845, 1.306562965, 1.175875602,
1.0, 0.785694958, 0.541196100, 0.275899379
};
i = 0;
for (row = 0; row < DCTSIZE; row++) {
for (col = 0; col < DCTSIZE; col++) {
fmtbl[i] = (FLOAT_MULT_TYPE)
((double) qtbl->quantval[i] *
aanscalefactor[row] * aanscalefactor[col] * 0.125);
i++;
}
}
}
break;
#endif
default:
ERREXIT(cinfo, JERR_NOT_COMPILED);
break;
}
}
}
/*
* Initialize IDCT manager.
*/
GLOBAL(void)
jinit_inverse_dct (j_decompress_ptr cinfo)
{
my_idct_ptr idct;
int ci;
jpeg_component_info *compptr;
idct = (my_idct_ptr)
(*cinfo->mem->alloc_small) ((j_common_ptr) cinfo, JPOOL_IMAGE,
SIZEOF(my_idct_controller));
cinfo->idct = &idct->pub;
idct->pub.start_pass = start_pass;
for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components;
ci++, compptr++) {
/* Allocate and pre-zero a multiplier table for each component */
compptr->dct_table =
(*cinfo->mem->alloc_small) ((j_common_ptr) cinfo, JPOOL_IMAGE,
SIZEOF(multiplier_table));
MEMZERO(compptr->dct_table, SIZEOF(multiplier_table));
/* Mark multiplier table not yet set up for any method */
idct->cur_method[ci] = -1;
}
}
```
|
```python
from prowler.lib.check.models import Check, Check_Report_Azure
from prowler.providers.azure.services.defender.defender_client import defender_client
class defender_ensure_defender_for_cosmosdb_is_on(Check):
def execute(self) -> Check_Report_Azure:
findings = []
for subscription, pricings in defender_client.pricings.items():
if "CosmosDbs" in pricings:
report = Check_Report_Azure(self.metadata())
report.status = "PASS"
report.subscription = subscription
report.resource_id = pricings["CosmosDbs"].resource_id
report.resource_name = "Defender plan Cosmos DB"
report.status_extended = f"Defender plan Defender for Cosmos DB from subscription {subscription} is set to ON (pricing tier standard)."
if pricings["CosmosDbs"].pricing_tier != "Standard":
report.status = "FAIL"
report.status_extended = f"Defender plan Defender for Cosmos DB from subscription {subscription} is set to OFF (pricing tier not standard)."
findings.append(report)
return findings
```
|
```smalltalk
Class {
#name : 'MetacelloPrePostLoadDirective',
#superclass : 'MetacelloDirective',
#category : 'Metacello-Core-Directives',
#package : 'Metacello-Core',
#tag : 'Directives'
}
```
|
```javascript
//
// This software (Documize Community Edition) is licensed under
// GNU AGPL v3 path_to_url
//
// You can operate outside the AGPL restrictions by purchasing
// Documize Enterprise Edition and obtaining a commercial license
// by contacting <sales@documize.com>.
//
// path_to_url
import Model from 'ember-data/model';
import attr from 'ember-data/attr';
export default Model.extend({
orgId: attr('string'),
spaceId: attr('string'),
whoId: attr('string'),
who: attr('string'),
spaceView: attr('boolean'),
spaceManage: attr('boolean'),
spaceOwner: attr('boolean'),
documentAdd: attr('boolean'),
documentEdit: attr('boolean'),
documentDelete: attr('boolean'),
documentMove: attr('boolean'),
documentCopy: attr('boolean'),
documentTemplate: attr('boolean'),
documentApprove: attr('boolean'),
documentLifecycle: attr('boolean'),
documentVersion: attr('boolean'),
name: attr('string'), // read-only
members: attr('number') // read-only
});
```
|
Marcus Fagerudd (born December 17, 1992) is a Finnish-Swedish professional ice hockey player. He currently plays for Luleå HF of the Swedish Hockey League (SHL).
References
External links
1992 births
Living people
Finnish ice hockey defencemen
Luleå HF players
Sportspeople from Jakobstad
Swedish-speaking Finns
Ice hockey people from Ostrobothnia (region)
|
Kwaya Kusar is a Local Government Area of Borno State, Nigeria. Its headquarters are in the town of Kwaya Kusar.
It has an area of 732 km and a population of 56,500 at the 2006 census.
The postal code of the area is 603.
The inhabitants speak the Bura language. They are mostly subsistence farmers.
It is one of the four LGAs that constitute the Biu Emirate, a traditional state located in Borno State, Nigeria.
Climatic Condition
With temperatures ranging from 61°F to 103°F, the climate has two distinct seasons: a hot, oppressive rainy season and a scorching, windy, and partly cloudy dry season.
References
Local Government Areas in Borno State
Populated places in Borno State
|
Jozvenaq (, also Romanized as Jazvanaq, Jazoonaq, Jazvanq; also known as Chaftan, Jaftān, and Jozvenū) is a village in Dast Jerdeh Rural District, Chavarzaq District, Tarom County, Zanjan Province, Iran. At the 2006 census, its population was 52, in 15 families.
References
Populated places in Tarom County
|
```javascript
import { Subscriber } from '../Subscriber';
import { Notification } from '../Notification';
export function observeOn(scheduler, delay = 0) {
return function observeOnOperatorFunction(source) {
return source.lift(new ObserveOnOperator(scheduler, delay));
};
}
export class ObserveOnOperator {
constructor(scheduler, delay = 0) {
this.scheduler = scheduler;
this.delay = delay;
}
call(subscriber, source) {
return source.subscribe(new ObserveOnSubscriber(subscriber, this.scheduler, this.delay));
}
}
export class ObserveOnSubscriber extends Subscriber {
constructor(destination, scheduler, delay = 0) {
super(destination);
this.scheduler = scheduler;
this.delay = delay;
}
static dispatch(arg) {
const { notification, destination } = arg;
notification.observe(destination);
this.unsubscribe();
}
scheduleMessage(notification) {
const destination = this.destination;
destination.add(this.scheduler.schedule(ObserveOnSubscriber.dispatch, this.delay, new ObserveOnMessage(notification, this.destination)));
}
_next(value) {
this.scheduleMessage(Notification.createNext(value));
}
_error(err) {
this.scheduleMessage(Notification.createError(err));
this.unsubscribe();
}
_complete() {
this.scheduleMessage(Notification.createComplete());
this.unsubscribe();
}
}
export class ObserveOnMessage {
constructor(notification, destination) {
this.notification = notification;
this.destination = destination;
}
}
//# sourceMappingURL=observeOn.js.map
```
|
```java
package com.ctrip.framework.xpipe.redis.utils;
import java.io.IOException;
import java.io.InputStream;
import java.net.JarURLConnection;
import java.net.URL;
import java.nio.file.Files;
import java.nio.file.Path;
import java.nio.file.Paths;
import java.util.jar.JarEntry;
import java.util.jar.JarFile;
import java.util.stream.Stream;
public class JarFileUrlJar {
public static final String TMP_PATH = "/tmp/redis/proxy/";
private JarFile jarFile;
private JarEntry entry;
private String fileName;
public JarFileUrlJar(URL url) throws IOException {
try {
// jar:file:...
JarURLConnection jarConn = (JarURLConnection) url.openConnection();
jarConn.setUseCaches(false);
jarFile = jarConn.getJarFile();
entry = jarConn.getJarEntry();
fileName = TMP_PATH + entry.getName();
} catch (Exception e) {
throw new IOException(jarFile.getName() + ":" + jarFile.size(), e);
}
}
public void close() {
if (jarFile != null) {
try {
jarFile.close();
} catch (IOException e) {
// Ignore
}
}
}
private InputStream getEntryInputStream() throws IOException {
if (entry == null) {
return null;
} else {
return jarFile.getInputStream(entry);
}
}
public String getJarFilePath() throws IOException {
InputStream inputStream = getEntryInputStream();
Files.copy(inputStream, getDistFile(fileName));
return fileName;
}
private Path getDistFile(String path) throws IOException {
Path dist = Paths.get(path);
Path parent = dist.getParent();
if (parent != null) {
if (Files.exists(parent)) {
delete(parent);
}
Files.createDirectories(parent);
}
return dist;
}
private void delete(Path root) throws IOException {
Stream<Path> children = Files.list(root);
children.forEach(p -> {
try {
Files.deleteIfExists(p);
} catch (IOException e) {
}
});
}
}
```
|
Ballerina is a 1950 French drama film directed by Ludwig Berger and starring Violette Verdy, Gabrielle Dorziat and Henri Guisol. It was produced and distributed by the French branch of Lux Film. The film's sets were designed by the art director Robert Gys. It was the final cinema film of the German director Berger, who moved into directing in television. It also known by the alternative title Dream Ballerina.
Synopsis
A young ballerina makes her on the stage of the theatre in her local French town, but is distracted and performs poorly. That night she dreams a series of various scenarios about a young male tearaway who has shown an interest in her. The following night she gives a perfect second performance.
Cast
Violette Verdy as Nicole
Gabrielle Dorziat as Aunt
Henri Guisol as Jeweler
Philippe Nicaud as Loulou
Nicholas Orloff as Dancer
Romney Brent as Director
Jean Mercure as Dancer
Micheline Boudet as Marie
Margo Lion as l'épouse du directeur
Pierre Sergeol as l'inspecteur
References
Bibliography
Huckenpahler, Victoria. Ballerina: A Biography of Violette Verdy. Audience Arts, 1978.
External links
1950 drama films
French drama films
1950 films
1950s French-language films
Films directed by Ludwig Berger
1950s French films
|
Luzhou District may refer to:
Luzhou District, Changzhi (), in Shanxi, PR China
Luzhou District, New Taipei (), in Taiwan
District name disambiguation pages
|
María Victoria Ramírez de Arellano Cardona, known professionally as Young Miko, is a Puerto Rican rapper and singer-songwriter. She released her debut EP, Trap Kitty in 2022 featuring Latin trap tracks.
Early life
Ramírez was born in Añasco, Puerto Rico. She first began writing poems while attending a Catholic school in Mayagüez, Puerto Rico.
Career
In 2018, she started rapping her lyrics to beats she downloaded from YouTube. Ramírez uploaded these initial songs to SoundCloud under the name Young Miko (). Her first song was "Quiero". Meanwhile, she worked as a tattoo artist for 4 years to pay bills and music studio costs.
In 2022, Ramírez released her debut EP, Trap Kitty in 2022 featuring Latin trap tracks. She incorporates her queerness and interests into her music including anime, urban music, and The Powerpuff Girls. On July 27, 2023, her reggaeton song, "Classy 101" charted 99 on Billboard Hot 100 marking her first appearance on the chart.
Personal life
Ramírez is openly lesbian.
Discography
EPs
Singles
Primary artist
Other charted songs
Other album appearances
Awards and nominations
Notes
References
External links
Year of birth missing (living people)
Living people
People from Añasco, Puerto Rico
Puerto Rican reggaeton musicians
Latin trap musicians
Puerto Rican women rappers
21st-century American women rappers
21st-century Puerto Rican LGBT people
Puerto Rican LGBT singers
Puerto Rican women singer-songwriters
Puerto Rican LGBT songwriters
LGBT rappers
Puerto Rican lesbian musicians
Lesbian songwriters
Lesbian singers
Sony Music Latin artists
LGBT people in Latin music
Women in Latin music
|
```kotlin
@file:Suppress("TooManyFunctions")
package io.gitlab.arturbosch.detekt.rules
import org.jetbrains.kotlin.lexer.KtTokens
import org.jetbrains.kotlin.psi.KtModifierListOwner
import org.jetbrains.kotlin.psi.psiUtil.isPublic
fun KtModifierListOwner.isPublicNotOverridden() =
isPublicNotOverridden(false)
fun KtModifierListOwner.isPublicNotOverridden(considerProtectedAsPublic: Boolean) =
if (considerProtectedAsPublic) {
isPublic || isProtected()
} else {
isPublic
} &&
!isOverride()
fun KtModifierListOwner.isAbstract() = hasModifier(KtTokens.ABSTRACT_KEYWORD)
fun KtModifierListOwner.isOverride() = hasModifier(KtTokens.OVERRIDE_KEYWORD)
fun KtModifierListOwner.isOpen() = hasModifier(KtTokens.OPEN_KEYWORD)
fun KtModifierListOwner.isExternal() = hasModifier(KtTokens.EXTERNAL_KEYWORD)
fun KtModifierListOwner.isOperator() = hasModifier(KtTokens.OPERATOR_KEYWORD)
fun KtModifierListOwner.isConstant() = hasModifier(KtTokens.CONST_KEYWORD)
fun KtModifierListOwner.isInternal() = hasModifier(KtTokens.INTERNAL_KEYWORD)
fun KtModifierListOwner.isLateinit() = hasModifier(KtTokens.LATEINIT_KEYWORD)
fun KtModifierListOwner.isInline() = hasModifier(KtTokens.INLINE_KEYWORD)
fun KtModifierListOwner.isExpect() = hasModifier(KtTokens.EXPECT_KEYWORD)
fun KtModifierListOwner.isActual() = hasModifier(KtTokens.ACTUAL_KEYWORD)
fun KtModifierListOwner.isProtected() = hasModifier(KtTokens.PROTECTED_KEYWORD)
```
|
```css
`currentColor` improves code reusability
`inline` element characteristics
Removing the bullets from the `ul`
At-Rules (`@`)
Highlight input forms using `:focus` pseudo-class
```
|
```c
/* yesno.c -- read a yes/no response from stdin
This program is free software; you can redistribute it and/or modify
the Free Software Foundation; either version 2, or (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
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#include <stdio.h>
/* Read one line from standard input
and return nonzero if that line begins with y or Y,
otherwise return 0. */
int
yesno ()
{
int c;
int rv;
fflush (stderr);
fflush (stdout);
c = getchar ();
rv = (c == 'y') || (c == 'Y');
while (c != EOF && c != '\n')
c = getchar ();
return rv;
}
```
|
```shell
Cache your authentication details to save time
Create a new branch from a stash
Show history of a function
Debug using binary search
Sharing data by bundling
```
|
Rosângela Rennó Gomes (Belo Horizonte, MG, 1962) is a Brazilian artist who lives and works in Rio de Janeiro. Her work consists of photographic images from public and private archives that question the nature of an image and its symbolic value. With the use of photographs, installations and objects, she appropriates and sheds new light on an anonymous body of photographs and negatives found mostly in flea markets, family albums, newspapers and archives. Rennó's interest in discarded images and habit of collecting were decisive in establishing her work strategies.
Rennó aims to generate interest in what she calls “the little stories of the downtrodden and the vanquished” (Rennó, 2004). These stories include the “inglorious” episodes of history, the shameful events of the past that successive Brazilian political regimes would like to gloss over, which she says can be found or uncovered in the “lowest categories of the image”: vernacular photography, identification shots, portraits. Rennó does not take photographs herself instead she recycles existing photographs of this kind.Rennó's decision to recycle photographs is influenced by the ideas of Czech photo-theorist Vilém Flusser who lived for many years in Brazil as well as the German photographer and theorist, Andreas Muller Pohle. In particular, Muller Pohl's idea of ‘an ecology of images’ informs Renno's practice of conserving and recycling images that already exist.
Life and career
Education
Rennó graduated with a bachelor's degree in architecture from the Federal University of Minas Gerais in 1986, and in Fine Arts by the Guignard School, in 1987.
She obtained her doctorate degree in 1997 from the University of São Paulo's School of Communication and Arts. Her thesis was an artist book based on her 1996 series, Scar (Cicatriz) of reproductions of photographic negatives from the archives of the São Paulo Penitentiary Museum.
Artistic career
Rosângela Rennó began her artistic career in 1980. Her first group show was in 1985 at the IAB Gallery in Belo Horizonte, MG and her first solo exhibition, Anti-Cinema, was four years later, in 1989, at the Corpo Gallery also in Belo Horizonte. She soon obtained national and international recognition.
By the end of the 1980s, her work reflected the feminine and domestic universes, making use of family photos, reconstructing and remixing the artists' own memories.
When she began her graduate studies in 1988, she developed a photographic series based on discarded strips of negatives found near film editing studios on the University of São Paulo campus.
In 1989, Rennó moved from São Paulo to Rio de Janeiro and shifted her focus from the private/domestic sphere to the public sphere. She started working with negatives and forgotten photo identification images acquired from popular studios.
In the early 1990s, she started collecting and working with written descriptions of photographs instead of the actual images. Around this time Rennó also started using photographs found in public and private archives.
Rennó participated in multiple group and individual exhibitions, including two editions of the São Paulo Biennial in 1994 and 2010, two editions of the Mercosul Biennial (1997 and 2004), the Venice Biennale (1993), and the Havana Biennial in 1997. She received grants and fellowships from various cultural institutions, including the Centro Nacional de Pesquisa Tecnológica, in 1991; the Fundação Nacional de Artes, in 1992; Civitella Ranieri Foundation, in 1997; Vitae Foundation, in 1998, and the Guggenheim, in 1999.
Curatorship
Rennó joined the curatorial team of the Museum of Art of São Paulo in 2014, organizing an exhibition about the Foto Cine Clube Bandeirante in 2016. As of that year, her contract has not been renewed.
Selected works
Universal Archive
Universal Archive (Arquivo Universal) (1992-) is a work in progress made up of written descriptions of photographs from newspaper articles. The artists characterizes the work as "images without images", and has used it as the basis of multiple series.
2005-510117385-5 and A01 [cod. 19.1.1.43] - A27 [s|cod.23]
2005–510117385–5 and A01 [cod.19.1.1.43] — A27 [s|cod.23] are the first and second iterations in a series of artist books about the theft of historic photography collections from Brazilian public archives.
The title of 2005–510117385–5 (published in 2010) comes from the criminal inquiry number corresponding to the 2005 theft of 946 works, including 751 photographs, from the Aloísio Magalhães Room of the Brazilian National Library. The book is composed of life-size reproductions of the verso of the 101 photographs that were recovered.
A01 [cod.19.1.1.43] — A27 [s|cod.23], published in 2013, documents the empty interiors of the archival photo storage boxes after the theft of more than half of the photographic albums by Augusto Malta at the Archives of the City of Rio de Janeiro. The title is a reference to the classification of the albums in the archive.
Collections
In Brazil
Joaquim Nabuco Foundation, Recife, Brasil
Museum of Modern Art Aloisio Magalhães (MAMAM), Recife, Brasil
Museum of Art of Brasília, Brasília, Brasil
Museum of Art of Pampulha, Belo Horizonte, Brasil
Inhotim Institute, Inhotim, Brasil
Museum of Modern Art of Rio de Janeiro (MAM RJ), Gilberto Chateuabriand Collection, Rio de Janeiro, Brasil
Museum of Modern Art of São Paulo (MAM SP), São Paulo, Brasil
Pinacoteca do Estado de São Paulo, São Paulo, Brasil
Museum of Art of São Paulo (MASP), Pirelli Collection, São Paulo, Brasil
International
Centre Georges Pompidou, Paris, France
Tate Modern, London, England
Culturgest, Lisbon, Portugal
Fundação Caloustre Gulbenkian, Lisboa, Portugal
Centro Galego de Arte Contemporáneo (CGAC), Santiago de Compostela, Spain
Museo Nacional Centro de Arte Reina Sofia, Madrid, Spain
Museo de Arte Contemporáneo de Castilla y León (MUSAC) Castilla y León, Espanha
Museo de Cáceres, Cáceres, Spain
Museo Extremeño e Iberoamericano de Arte Contemporáneo (MEIAC), Badajoz, Spain
Stedelijk Museum voor Actuele Kunst (SMAK), Gent, Belgium
Fondazioni Cassa de Risparmo de Modena, Italy
Daros Latinamerica, Zurich, Switzerland
Museum of Moderna Art (MOMA), New York, USA
Art Institute of Chicago, Chicago, USA
Latino Museum, Los Angeles, USA
Museum of Contemporary Art (MOCA), Los Angeles, USA
Orange County Museum of Art, Newport Beach, USA
Guggenheim Museum, New York, USA
Western Sydney University, Australia
References
External links
Artist website
1962 births
Living people
Brazilian contemporary artists
Brazilian photographers
Brazilian women photographers
People from Belo Horizonte
University of São Paulo alumni
|
{{DISPLAYTITLE:33 1/3 RPM}}
RPM may refer to:
The playing speed, in rotations per minute, of LP records
The playing speed of some extended play records
|
```c++
// (See accompanying file LICENSE_1_0.txt or copy at
// path_to_url
#include <iostream>
#include <boost/assert.hpp>
#include <boost/config.hpp>
#include <boost/coroutine/all.hpp>
#include <boost/thread.hpp>
int count = 384;
#ifdef BOOST_MSVC //MS VisualStudio
__declspec(noinline) void access( char *buf);
#else // GCC
void access( char *buf) __attribute__ ((noinline));
#endif
void access( char *buf)
{
buf[0] = '\0';
}
void bar( int i)
{
char buf[4 * 1024];
if ( i > 0)
{
access( buf);
std::cout << i << ". iteration" << std::endl;
bar( i - 1);
}
}
void foo( boost::coroutines::symmetric_coroutine< void >::yield_type &)
{
bar( count);
}
void thread_fn()
{
{
boost::coroutines::symmetric_coroutine< void >::call_type coro( foo);
coro();
}
}
int main( int argc, char * argv[])
{
#if defined(BOOST_USE_SEGMENTED_STACKS)
std::cout << "using segmented stacks: allocates " << count << " * 4kB == " << 4 * count << "kB on stack, ";
std::cout << "initial stack size = " << boost::coroutines::stack_allocator::traits_type::default_size() / 1024 << "kB" << std::endl;
std::cout << "application should not fail" << std::endl;
#else
std::cout << "using standard stacks: allocates " << count << " * 4kB == " << 4 * count << "kB on stack, ";
std::cout << "initial stack size = " << boost::coroutines::stack_allocator::traits_type::default_size() / 1024 << "kB" << std::endl;
std::cout << "application might fail" << std::endl;
#endif
boost::thread( thread_fn).join();
return 0;
}
```
|
```java
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package com.haulmont.cuba.testmodel.sales_1;
import com.haulmont.chile.core.annotations.NamePattern;
import com.haulmont.chile.core.datatypes.impl.EnumUtils;
import com.haulmont.cuba.core.entity.StandardEntity;
import com.haulmont.cuba.testmodel.sales.Status;
import javax.persistence.Column;
import javax.persistence.Entity;
import javax.persistence.Table;
@Entity(name = "sales1$Customer")
@Table(name = "SALES1_CUSTOMER")
@NamePattern("%s|name")
public class Customer extends StandardEntity {
@Column(name = "NAME")
private String name;
@Column(name = "STATUS")
private String status;
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public Status getStatus() {
return EnumUtils.fromId(Status.class, status, null);
}
public void setStatus(Status status) {
this.status = status.getId();
}
}
```
|
```shell
Rapidly invoke an editor to write a long, complex, or tricky command
Useful aliasing in bash
`else` statements using the `||` operator
Keep useful commands in your shell history with tags
Retrieve previous arguments
```
|
```java
/*
*
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification, are
* permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice, this list of
* conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice, this list of
* conditions and the following disclaimer in the documentation and/or other materials provided
* with the distribution.
*
* 3. Neither the name of the copyright holder nor the names of its contributors may be used to
* endorse or promote products derived from this software without specific prior written
* permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS
* OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
* GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
* OF THE POSSIBILITY OF SUCH DAMAGE.
*/
package com.oracle.truffle.llvm.runtime.interop.access;
import com.oracle.truffle.api.CompilerDirectives.TruffleBoundary;
import com.oracle.truffle.api.dsl.Cached;
import com.oracle.truffle.api.dsl.GenerateAOT;
import com.oracle.truffle.api.dsl.GenerateUncached;
import com.oracle.truffle.api.dsl.Specialization;
import com.oracle.truffle.api.interop.InteropLibrary;
import com.oracle.truffle.api.interop.UnsupportedMessageException;
import com.oracle.truffle.api.library.CachedLibrary;
import com.oracle.truffle.api.profiles.BranchProfile;
import com.oracle.truffle.llvm.runtime.except.LLVMPolyglotException;
import com.oracle.truffle.llvm.runtime.interop.access.LLVMInteropType.SpecialStruct;
import com.oracle.truffle.llvm.runtime.interop.access.LLVMInteropType.SpecialStructAccessor;
import com.oracle.truffle.llvm.runtime.interop.access.LLVMInteropType.Structured;
import com.oracle.truffle.llvm.runtime.interop.convert.ToLLVM;
import com.oracle.truffle.llvm.runtime.interop.convert.ForeignToLLVM.ForeignToLLVMType;
import com.oracle.truffle.llvm.runtime.nodes.api.LLVMNode;
@GenerateUncached
public abstract class LLVMInteropSpecialAccessNode extends LLVMNode {
public abstract Object execute(Object foreign, ForeignToLLVMType accessType, Structured type, long offset);
protected SpecialStructAccessor notNullOrException(SpecialStruct type, long offset, SpecialStructAccessor accessor) {
if (accessor == null) {
throw new LLVMPolyglotException(this, "The type '%s' has no node at offset %d.", type.toDisplayString(false), offset);
}
return accessor;
}
protected Object doAccess(Object foreign, ForeignToLLVMType accessType, SpecialStruct type, long offset, SpecialStructAccessor accessor, ToLLVM toLLVM, BranchProfile exception1,
BranchProfile exception2, BranchProfile exception3, InteropLibrary interop) {
if (accessor == null) {
exception1.enter();
throw new LLVMPolyglotException(this, "The type '%s' has no node at offset %d.", type.toDisplayString(false), offset);
}
if (accessor.type instanceof LLVMInteropType.Value) {
try {
return toLLVM.executeWithType(accessor.getter.get(foreign, interop), (LLVMInteropType.Value) accessor.type, accessType);
} catch (UnsupportedMessageException ex) {
exception3.enter();
throw new LLVMPolyglotException(this, "Special read failed with unsupported message exception.");
}
} else {
exception2.enter();
throw new LLVMPolyglotException(this, "Special read of type '%s' is not supported.", accessor.type.toDisplayString(false));
}
}
@TruffleBoundary
SpecialStructAccessor findAccessor(SpecialStruct type, long offset) {
return type.findAccessor(offset);
}
@Specialization(guards = {"type == cachedType", "offset == cachedOffset"})
@GenerateAOT.Exclude
public Object doSpecialized(Object foreign, ForeignToLLVMType accessType,
@SuppressWarnings("unused") SpecialStruct type, @SuppressWarnings("unused") long offset,
@Cached("type") SpecialStruct cachedType,
@Cached("offset") long cachedOffset,
@Cached("findAccessor(cachedType, cachedOffset)") SpecialStructAccessor accessor,
@Cached ToLLVM toLLVM,
@Cached BranchProfile exception1,
@Cached BranchProfile exception2,
@Cached BranchProfile exception3,
@CachedLibrary(limit = "3") InteropLibrary interop) {
return doAccess(foreign, accessType, cachedType, cachedOffset, accessor, toLLVM, exception1, exception2, exception3, interop);
}
@Specialization(replaces = "doSpecialized")
@GenerateAOT.Exclude
public Object doUnspecialized(Object foreign, ForeignToLLVMType accessType,
SpecialStruct type, long offset,
@Cached ToLLVM toLLVM,
@Cached BranchProfile exception1,
@Cached BranchProfile exception2,
@Cached BranchProfile exception3,
@CachedLibrary(limit = "3") InteropLibrary interop) {
SpecialStructAccessor accessor = findAccessor(type, offset);
return doAccess(foreign, accessType, type, offset, accessor, toLLVM, exception1, exception2, exception3, interop);
}
public static LLVMInteropSpecialAccessNode create() {
return LLVMInteropSpecialAccessNodeGen.create();
}
}
```
|
Mount Rogers may refer to:
Mount Rogers, highest point in Virginia, USA
Mount Rogers (Antarctica)
Mount Rogers (British Columbia) in British Columbia, Canada
Mount Rogers (Washington) in Washington, USA
Mount Rogers (Australian Capital Territory), a hill in the Australian Capital Territory
Mount Rogers Health District, a health district composed of five counties in Southwest Virginia
See also
Rogers Peak, Oregon, USA
|
The Complete Roadrunner Collection (1997–2003) is a box set compilation album by American nu metal band Coal Chamber.
Background
It was made available digitally in the U.S. on March 12, 2013, and was released across Europe both digitally and in CD format on June 3, 2013. The box set includes the band's three studio albums released under Roadrunner Records between 1997 and 2002, as well as the rarities album Giving the Devil His Due.
Track listing
Coal Chamber (1997)
"Maricon Puto" and "I" are merged into one track on the physical release of this compilation. However, on Spotify, the two tracks are separate, as is the case with all other versions of the 1997 self-titled album
Chamber Music (1999)
Dark Days (2002)
Giving the Devil His Due (2003)
References
Coal Chamber albums
Roadrunner Records compilation albums
2013 compilation albums
|
```java
/*******************************************************************************
* <p>
* <p>
* path_to_url
* <p>
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*******************************************************************************/
package com.intuit.wasabi.api.pagination.comparators.impl;
import com.intuit.wasabi.api.pagination.comparators.PaginationComparator;
import com.intuit.wasabi.api.pagination.comparators.PaginationComparatorProperty;
import com.intuit.wasabi.auditlogobjects.AuditLogAction;
import com.intuit.wasabi.auditlogobjects.AuditLogEntry;
import java.util.Calendar;
import java.util.function.BiFunction;
import java.util.function.Function;
/**
* Implements the {@link PaginationComparator} for {@link AuditLogEntry} objects.
*/
public class AuditLogEntryComparator extends PaginationComparator<AuditLogEntry> {
/**
* Initializes an AuditLogEntryComparator.
* <p>
* Sets the default sort order to descending time, that means
* the most recent events are first.
*/
public AuditLogEntryComparator() {
super("-time");
}
/**
* Implementation of {@link PaginationComparatorProperty} for {@link AuditLogEntry}s.
*
* @see PaginationComparatorProperty
*/
private enum Property implements PaginationComparatorProperty<AuditLogEntry> {
firstname(auditLogEntry -> auditLogEntry.getUser().getFirstName(), String::compareToIgnoreCase),
lastname(auditLogEntry -> auditLogEntry.getUser().getLastName(), String::compareToIgnoreCase),
user(auditLogEntry -> auditLogEntry.getUser().getUsername().toString(), String::compareToIgnoreCase),
username(auditLogEntry -> auditLogEntry.getUser().getUsername().toString(), String::compareToIgnoreCase),
userid(auditLogEntry -> auditLogEntry.getUser().getUserId(), String::compareToIgnoreCase),
mail(auditLogEntry -> auditLogEntry.getUser().getEmail(), String::compareToIgnoreCase),
action(AuditLogAction::getDescription, String::compareToIgnoreCase),
experiment(auditLogEntry -> auditLogEntry.getExperimentLabel().toString(), String::compareToIgnoreCase),
bucket(auditLogEntry -> auditLogEntry.getBucketLabel().toString(), String::compareToIgnoreCase),
app(auditLogEntry -> auditLogEntry.getApplicationName().toString(), String::compareToIgnoreCase),
time(AuditLogEntry::getTime, Calendar::compareTo),
attribute(AuditLogEntry::getChangedProperty, String::compareToIgnoreCase),
before(AuditLogEntry::getBefore, String::compareToIgnoreCase),
after(AuditLogEntry::getAfter, String::compareToIgnoreCase),
description(AuditLogAction::getDescription, String::compareToIgnoreCase),;
private final Function<AuditLogEntry, ?> propertyExtractor;
private final BiFunction<?, ?, Integer> comparisonFunction;
/**
* Creates a Property.
*
* @param propertyExtractor the property extractor
* @param comparisonFunction the comparison function
* @param <T> the property type
*/
<T> Property(Function<AuditLogEntry, T> propertyExtractor, BiFunction<T, T, Integer> comparisonFunction) {
this.propertyExtractor = propertyExtractor;
this.comparisonFunction = comparisonFunction;
}
/**
* {@inheritDoc}
*/
@Override
public Function<AuditLogEntry, ?> getPropertyExtractor() {
return propertyExtractor;
}
/**
* {@inheritDoc}
*/
@Override
public BiFunction<?, ?, Integer> getComparisonFunction() {
return comparisonFunction;
}
}
/**
* {@inheritDoc}
*/
@Override
public int compare(AuditLogEntry left, AuditLogEntry right) {
return super.compare(left, right, Property.class);
}
}
```
|
```java
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package com.googlecode.mp4parser.boxes.apple;
import com.coremedia.iso.IsoTypeReader;
import com.coremedia.iso.IsoTypeWriter;
import com.coremedia.iso.boxes.sampleentry.SampleEntry;
import java.nio.ByteBuffer;
/**
* Entry type for timed text samples defined in the timed text specification (ISO/IEC 14496-17).
*/
public class QuicktimeTextSampleEntry extends SampleEntry {
public static final String TYPE = "text";
int displayFlags;
int textJustification;
int backgroundR;
int backgroundG;
int backgroundB;
long defaultTextBox;
long reserved1;
short fontNumber;
short fontFace;
byte reserved2;
short reserved3;
int foregroundR = 65535;
int foregroundG = 65535;
int foregroundB = 65535;
String fontName = "";
public QuicktimeTextSampleEntry() {
super(TYPE);
}
@Override
public void _parseDetails(ByteBuffer content) {
_parseReservedAndDataReferenceIndex(content);
displayFlags = content.getInt();
textJustification = content.getInt();
backgroundR = IsoTypeReader.readUInt16(content);
backgroundG = IsoTypeReader.readUInt16(content);
backgroundB = IsoTypeReader.readUInt16(content);
defaultTextBox = IsoTypeReader.readUInt64(content);
reserved1 = IsoTypeReader.readUInt64(content);
fontNumber = content.getShort();
fontFace = content.getShort();
reserved2 = content.get();
reserved3 = content.getShort();
foregroundR = IsoTypeReader.readUInt16(content);
foregroundG = IsoTypeReader.readUInt16(content);
foregroundB = IsoTypeReader.readUInt16(content);
if (content.remaining() > 0) {
int length = IsoTypeReader.readUInt8(content);
byte[] myFontName = new byte[length];
content.get(myFontName);
fontName = new String(myFontName);
} else {
fontName = null;
}
}
protected long getContentSize() {
return 52 + (fontName != null ? fontName.length() : 0);
}
public int getDisplayFlags() {
return displayFlags;
}
public void setDisplayFlags(int displayFlags) {
this.displayFlags = displayFlags;
}
public int getTextJustification() {
return textJustification;
}
public void setTextJustification(int textJustification) {
this.textJustification = textJustification;
}
public int getBackgroundR() {
return backgroundR;
}
public void setBackgroundR(int backgroundR) {
this.backgroundR = backgroundR;
}
public int getBackgroundG() {
return backgroundG;
}
public void setBackgroundG(int backgroundG) {
this.backgroundG = backgroundG;
}
public int getBackgroundB() {
return backgroundB;
}
public void setBackgroundB(int backgroundB) {
this.backgroundB = backgroundB;
}
public long getDefaultTextBox() {
return defaultTextBox;
}
public void setDefaultTextBox(long defaultTextBox) {
this.defaultTextBox = defaultTextBox;
}
public long getReserved1() {
return reserved1;
}
public void setReserved1(long reserved1) {
this.reserved1 = reserved1;
}
public short getFontNumber() {
return fontNumber;
}
public void setFontNumber(short fontNumber) {
this.fontNumber = fontNumber;
}
public short getFontFace() {
return fontFace;
}
public void setFontFace(short fontFace) {
this.fontFace = fontFace;
}
public byte getReserved2() {
return reserved2;
}
public void setReserved2(byte reserved2) {
this.reserved2 = reserved2;
}
public short getReserved3() {
return reserved3;
}
public void setReserved3(short reserved3) {
this.reserved3 = reserved3;
}
public int getForegroundR() {
return foregroundR;
}
public void setForegroundR(int foregroundR) {
this.foregroundR = foregroundR;
}
public int getForegroundG() {
return foregroundG;
}
public void setForegroundG(int foregroundG) {
this.foregroundG = foregroundG;
}
public int getForegroundB() {
return foregroundB;
}
public void setForegroundB(int foregroundB) {
this.foregroundB = foregroundB;
}
public String getFontName() {
return fontName;
}
public void setFontName(String fontName) {
this.fontName = fontName;
}
@Override
protected void getContent(ByteBuffer byteBuffer) {
_writeReservedAndDataReferenceIndex(byteBuffer);
byteBuffer.putInt(displayFlags);
byteBuffer.putInt(textJustification);
IsoTypeWriter.writeUInt16(byteBuffer, backgroundR);
IsoTypeWriter.writeUInt16(byteBuffer, backgroundG);
IsoTypeWriter.writeUInt16(byteBuffer, backgroundB);
IsoTypeWriter.writeUInt64(byteBuffer, defaultTextBox);
IsoTypeWriter.writeUInt64(byteBuffer, reserved1);
byteBuffer.putShort(fontNumber);
byteBuffer.putShort(fontFace);
byteBuffer.put(reserved2);
byteBuffer.putShort(reserved3);
IsoTypeWriter.writeUInt16(byteBuffer, foregroundR);
IsoTypeWriter.writeUInt16(byteBuffer, foregroundG);
IsoTypeWriter.writeUInt16(byteBuffer, foregroundB);
if (fontName != null) {
IsoTypeWriter.writeUInt8(byteBuffer, fontName.length());
byteBuffer.put(fontName.getBytes());
}
}
}
```
|
```c++
#ifndef BOOST_SMART_PTR_BAD_WEAK_PTR_HPP_INCLUDED
#define BOOST_SMART_PTR_BAD_WEAK_PTR_HPP_INCLUDED
// MS compatible compilers support #pragma once
#if defined(_MSC_VER) && (_MSC_VER >= 1020)
# pragma once
#endif
//
// boost/smart_ptr/bad_weak_ptr.hpp
//
//
// accompanying file LICENSE_1_0.txt or copy at
// path_to_url
//
#include <boost/config.hpp>
#include <exception>
#ifdef BOOST_BORLANDC
# pragma warn -8026 // Functions with excep. spec. are not expanded inline
#endif
namespace boost
{
// The standard library that comes with Borland C++ 5.5.1, 5.6.4
// defines std::exception and its members as having C calling
// convention (-pc). When the definition of bad_weak_ptr
// is compiled with -ps, the compiler issues an error.
// Hence, the temporary #pragma option -pc below.
#if defined(BOOST_BORLANDC) && BOOST_BORLANDC <= 0x564
# pragma option push -pc
#endif
#if defined(BOOST_CLANG)
// Intel C++ on Mac defines __clang__ but doesn't support the pragma
# pragma clang diagnostic push
# pragma clang diagnostic ignored "-Wweak-vtables"
#endif
class bad_weak_ptr: public std::exception
{
public:
char const * what() const BOOST_NOEXCEPT_OR_NOTHROW BOOST_OVERRIDE
{
return "tr1::bad_weak_ptr";
}
};
#if defined(BOOST_CLANG)
# pragma clang diagnostic pop
#endif
#if defined(BOOST_BORLANDC) && BOOST_BORLANDC <= 0x564
# pragma option pop
#endif
} // namespace boost
#ifdef BOOST_BORLANDC
# pragma warn .8026 // Functions with excep. spec. are not expanded inline
#endif
#endif // #ifndef BOOST_SMART_PTR_BAD_WEAK_PTR_HPP_INCLUDED
```
|
Myanmar competed at the 2022 Asian Games in Hangzhou, Zhejiang, China, which began on 23 September 2023 and ended on 8 October 2023. The event was scheduled to be held in September 2022 but was postponed due to the rising COVID-19 cases in China. The event was later rescheduled to be held in September–October 2023.
Medalists
Medals by sport
References
Nations at the 2022 Asian Games
2022
|
```sqlpl
-- Note: Requires the driver to be installed ahead of time.
-- list available providers
EXEC sp_MSset_oledb_prop -- get available providers
-- Enable show advanced options
sp_configure 'show advanced options',1
reconfigure
go
-- Enable ad hoc queries
sp_configure 'ad hoc distributed queries',1
reconfigure
go
-- Write text file
INSERT INTO OPENROWSET('Microsoft.ACE.OLEDB.12.0','Text;Database=c:\temp\;HDR=Yes;FORMAT=text', 'SELECT * FROM [file.txt]')
SELECT @@version
-- Note: This also works with unc paths \\ip\file.txt
-- Note: This also works with webdav paths \\ip@80\file.txt However, the target web server needs to support propfind.
```
|
```smalltalk
using System;
using UnityEngine;
// Grayscale effect, with added ExcludeLayer option
// Usage: Attach this script to camera, Select excludeLayers, Set your excluded objects to that layer
#if !UNITY_5_3_OR_NEWER
namespace UnityStandardAssets.ImageEffects
{
[ExecuteInEditMode]
[AddComponentMenu("Image Effects/Color Adjustments/Grayscale")]
public class GrayscaleLayers : ImageEffectBase
{
public Texture textureRamp;
public LayerMask excludeLayers = 0;
private GameObject tmpCam = null;
private Camera _camera;
[Range(-1.0f, 1.0f)]
public float rampOffset;
// Called by camera to apply image effect
void OnRenderImage(RenderTexture source, RenderTexture destination)
{
material.SetTexture("_RampTex", textureRamp);
material.SetFloat("_RampOffset", rampOffset);
Graphics.Blit(source, destination, material);
// exclude layers
Camera cam = null;
if (excludeLayers.value != 0) cam = GetTmpCam();
if (cam && excludeLayers.value != 0)
{
cam.targetTexture = destination;
cam.cullingMask = excludeLayers;
cam.Render();
}
}
// taken from CameraMotionBlur.cs
Camera GetTmpCam()
{
if (tmpCam == null)
{
if (_camera == null) _camera = GetComponent<Camera>();
string name = "_" + _camera.name + "_GrayScaleTmpCam";
GameObject go = GameObject.Find(name);
if (null == go) // couldn't find, recreate
{
tmpCam = new GameObject(name, typeof(Camera));
} else
{
tmpCam = go;
}
}
tmpCam.hideFlags = HideFlags.DontSave;
tmpCam.transform.position = _camera.transform.position;
tmpCam.transform.rotation = _camera.transform.rotation;
tmpCam.transform.localScale = _camera.transform.localScale;
tmpCam.GetComponent<Camera>().CopyFrom(_camera);
tmpCam.GetComponent<Camera>().enabled = false;
tmpCam.GetComponent<Camera>().depthTextureMode = DepthTextureMode.None;
tmpCam.GetComponent<Camera>().clearFlags = CameraClearFlags.Nothing;
return tmpCam.GetComponent<Camera>();
}
}
}
#endif
```
|
```java
package quickstart;
public class App {
public String getName() {
return "App";
}
}
```
|
```php
<?php
class HashlistTest extends HashtopolisTest {
protected $minVersion = "0.7.0";
protected $maxVersion = "master";
protected $runType = HashtopolisTest::RUN_FAST;
private $token = "";
public function init($version) {
HashtopolisTestFramework::log(HashtopolisTestFramework::LOG_INFO, "Initializing " . $this->getTestName() . "...");
parent::init($version);
}
public function run() {
HashtopolisTestFramework::log(HashtopolisTestFramework::LOG_INFO, "Running " . $this->getTestName() . "...");
$this->testListHashlists();
$this->testHashlistCreate(0);
$this->testHashlistCreate(1);
$this->testHashlistCreate(2);
$this->testListHashlists(['Hashlist 0', 'Hashlist 1', 'Hashlist 2']);
$this->testGetHashlist(1, ['name' => 'Hashlist 0', 'hashtypeId' => 0, 'format' => 0, 'hashCount' => 10, 'cracked' => 0, 'isSecret' => false, 'saltSeparator' => ':']);
$this->testGetHashlist(2, ['name' => 'Hashlist 1', 'hashtypeId' => 2500, 'format' => 1, 'hashCount' => 1, 'cracked' => 0, 'isSecret' => false, 'saltSeparator' => ':']);
$this->testGetHashlist(3, ['name' => 'Hashlist 2', 'hashtypeId' => 6211, 'format' => 2, 'hashCount' => 1, 'cracked' => 0, 'isSecret' => false, 'saltSeparator' => ':']);
$this->testImportCracked();
$this->testGetHashlist(1, ['name' => 'Hashlist 0', 'hashtypeId' => 0, 'format' => 0, 'hashCount' => 10, 'cracked' => 3, 'isSecret' => false, 'saltSeparator' => ':']);
$this->testGetHash("0028080e7fa8c81268ef340d7d692681", "found1");
$this->testGetHash("00112233445566778899aabbccddeeff", false);
$this->testDeleteHashlist(3);
$this->testListHashlists(['Hashlist 0', 'Hashlist 1']);
$this->testArchiveHashlist(1);
$this->testDeleteHashlist(1);
$this->testListHashlists(['Hashlist 1']);
// the following tests are used to verify that deleting the last hash doesn't result in an error
$this->testDeleteHashlist(2);
$this->testHashlistCreate(0);
$this->testDeleteHashlist(4);
HashtopolisTestFramework::log(HashtopolisTestFramework::LOG_INFO, $this->getTestName() . " completed");
}
private function testDeleteHashlist($hashlistId) {
$response = HashtopolisTestFramework::doRequest([
"section" => "hashlist",
"request" => "deleteHashlist",
"hashlistId" => $hashlistId,
"accessKey" => "mykey"
], HashtopolisTestFramework::REQUEST_UAPI
);
if ($response === false) {
$this->testFailed("HashlistTest:testDeleteHashlist($hashlistId)", "Empty response");
}
else if ($response['response'] != 'OK') {
$this->testFailed("HashlistTest:testDeleteHashlist($hashlistId)", "Response not OK");
}
else {
$this->testSuccess("HashlistTest:testDeleteHashlist($hashlistId)");
}
}
private function testArchiveHashlist($hashlistId) {
$response = HashtopolisTestFramework::doRequest([
"section" => "hashlist",
"request" => "setArchived",
"isArchived" => true,
"hashlistId" => $hashlistId,
"accessKey" => "mykey"
], HashtopolisTestFramework::REQUEST_UAPI
);
if ($response === false) {
$this->testFailed("HashlistTest:testArchiveHashlist($hashlistId)", "Empty response");
}
else if ($response['response'] != 'OK') {
$this->testFailed("HashlistTest:testArchiveHashlist($hashlistId)", "Response not OK");
}
else {
$this->testSuccess("HashlistTest:testArchiveHashlist($hashlistId)");
}
}
private function testGetHash($hash, $assert) {
$response = HashtopolisTestFramework::doRequest([
"section" => "hashlist",
"request" => "getHash",
"hash" => $hash,
"accessKey" => "mykey"
], HashtopolisTestFramework::REQUEST_UAPI
);
if ($response === false) {
$this->testFailed("HashlistTest:testGetHash($hash,$assert)", "Empty response");
}
else if ($assert && $response['response'] != 'OK') {
$this->testFailed("HashlistTest:testGetHash($hash,$assert)", "Response not OK");
}
else if (!$assert && $response['response'] != 'ERROR') {
$this->testFailed("HashlistTest:testGetHash($hash,$assert)", "Response not ERROR");
}
else {
if ($assert && $assert != $response['plain']) {
$this->testFailed("HashlistTest:testGetHash($hash,$assert)", "Plain is not correct for hash");
return;
}
$this->testSuccess("HashlistTest:testGetHash($hash,$assert)");
}
}
private function testImportCracked() {
$response = HashtopolisTestFramework::doRequest([
"section" => "hashlist",
"request" => "importCracked",
"hashlistId" => 1,
"separator" => ":",
// sending 3 founds of the hashlist
"data" => your_sha256_hashyour_sha256_hashYmE1OTBhMTY2OTZlZGJiMzpmb3VuZDM=",
"accessKey" => "mykey"
], HashtopolisTestFramework::REQUEST_UAPI
);
if ($response === false) {
$this->testFailed("HashlistTest:testImportCracked", "Empty response");
}
else if ($response['response'] != 'OK') {
$this->testFailed("HashlistTest:testImportCracked", "Response not OK");
}
else if ($response['linesProcessed'] != 3) {
$this->testFailed("HashlistTest:testImportCracked", "Not matching number of processed lines");
}
else if ($response['newCracked'] != 3) {
$this->testFailed("HashlistTest:testImportCracked", "Not matching number of new cracked lines");
}
else if ($response['notFound'] != 0) {
$this->testFailed("HashlistTest:testImportCracked", "Not matching number of not found lines");
}
else {
$this->testSuccess("HashlistTest:testImportCracked");
}
}
private function testGetHashlist($hashlistId, $assert = []) {
$response = HashtopolisTestFramework::doRequest([
"section" => "hashlist",
"request" => "getHashlist",
"hashlistId" => $hashlistId,
"accessKey" => "mykey"
], HashtopolisTestFramework::REQUEST_UAPI
);
if ($response === false) {
$this->testFailed("HashlistTest:testGetHashlist($hashlistId," . implode(",", $assert) . ")", "Empty response");
}
else if ($response['response'] != 'OK') {
$this->testFailed("HashlistTest:testGetHashlist($hashlistId," . implode(",", $assert) . ")", "Response not OK");
}
else {
foreach ($assert as $key => $value) {
if (!isset($response[$key])) {
$this->testFailed("HashlistTest:testGetHashlist($hashlistId," . implode(",", $assert) . ")", "$key not in response but in assert");
return;
}
else if ($response[$key] != $value) {
$this->testFailed("HashlistTest:testGetHashlist($hashlistId," . implode(",", $assert) . ")", "Value from key ($key) not in response but in assert");
return;
}
}
$this->testSuccess("HashlistTest:testGetHashlist($hashlistId," . implode(",", $assert) . ")");
}
}
public function testHashlistCreate($type = 0) {
$data = "";
$hashtype = -1;
switch ($type) {
case 0: // 10 MD5 hashes
$data = your_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashNTUyMWIzZmQKMDA0YTAxOWM3ZGEwNGYzZDI0ODg1YmFkOTg0YjRhNDM=";
$hashtype = 0;
break;
case 2: // truecrypt hash
$data = "h5FJZ/FHN6Z/tGDye4rrgd4rQb8nQLPdeHhOAnY5UdqkfHyiNedcIuyNlZ1rZ/fu3vrWHmoNA4B503IajnIV5BVnHox7Pb7WRToRTm24mlK+mpwWmKnGmPHjf4DXr68O+6grbl9d8yvSiblTQ8Z3Xix/Al7x2L+your_sha256_hashwfmymozv5SyziqBmp+M+qWvcOOvblNQ06MG8DbxP/your_sha256_hashJY0K56qowZOm3LW/GOPFe1R00kuEP43U6Dp0EJOW3bTwxQ02V6fqzIgoVo5RIC3kjNLf5ay+your_sha256_hashnweBebI4biqoN1hToYAs2LxdQc5FeV94uA5p/Po9FM+RJ8OjP6Lcdq1zlg+your_sha256_hashpkxZ5Kjav2D+h7cVdolUYyOf/YeIBl2+ixfyZaeBcvuDc56Dvh2tzQLvok3ydnIJI8ODq5wX+fh0tpIkC9PPifSz1MrcCHhg=";
$hashtype = 6211;
break;
case 1: // hccapx file
$data = your_sha256_hashycMW3OMVYsIsh9Gu9Q8igBz68ZKyBdR7gfQ/kfhQyBl22gGeAHIvOVg3BpKrBWL3C5h73Pn5UB4z8+yjofIhalK2DIcZHnRzrFTssCOsWYm+zx48fkUJewABAwB3/gEJACAAAAAAAAAAAfrxkrIF1HuB9D+R+your_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA";
$hashtype = 2500;
break;
}
$response = HashtopolisTestFramework::doRequest([
"section" => "hashlist",
"request" => "createHashlist",
"name" => "Hashlist $type",
"isSalted" => false,
"isSecret" => false,
"isHexSalt" => false,
"separator" => ":",
"format" => $type,
"hashtypeId" => $hashtype,
"accessGroupId" => 1,
"data" => $data,
"useBrain" => false,
"brainFeatures" => 0,
"accessKey" => "mykey"
], HashtopolisTestFramework::REQUEST_UAPI
);
if ($response === false) {
$this->testFailed("HashlistTest:testHashlistCreate($type)", "Empty response");
}
else if ($response['response'] != 'OK') {
$this->testFailed("HashlistTest:testHashlistCreate($type)", "Response not OK");
}
else {
$this->testSuccess("HashlistTest:testHashlistCreate($type)");
}
}
private function testListHashlists($assert = []) {
$response = HashtopolisTestFramework::doRequest([
"section" => "hashlist",
"request" => "listHashlists",
"accessKey" => "mykey"
], HashtopolisTestFramework::REQUEST_UAPI
);
if ($response === false) {
$this->testFailed("HashlistTest:testListHashlists(" . implode(", ", $assert) . ")", "Empty response");
}
else if ($response['response'] != 'OK') {
$this->testFailed("HashlistTest:testListHashlists(" . implode(", ", $assert) . ")", "Response not OK");
}
else if (sizeof($assert) != sizeof($response['hashlists'])) {
$this->testFailed("HashlistTest:testListHashlists(" . implode(", ", $assert) . ")", "Not matching number of hashlists");
}
else {
foreach ($response['hashlists'] as $hashlist) {
if (!in_array($hashlist['name'], $assert)) {
$this->testFailed("HashlistTest:testListHashlists(" . implode(", ", $assert) . ")", "Not matching hashlist name");
return;
}
}
$this->testSuccess("HashlistTest:testListHashlists(" . implode(", ", $assert) . ")");
}
}
public function getTestName() {
return "Hashlist Test";
}
}
HashtopolisTestFramework::register(new HashlistTest());
```
|
```python
#!/usr/bin/env python3
#
#
# 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.
# ==============================================================================
"""
Train the program by launching it with random parametters
"""
from tqdm import tqdm
import os
def main():
"""
Launch the training with different parametters
"""
# TODO: define:
# step+noize
# log scale instead of uniform
# Define parametter: [min, max]
dictParams = {
"batchSize": [int, [1, 3]]
"learningRate": [float, [1, 3]]
}
# Training multiple times with different parametters
for i in range(10):
# Generate the command line arguments
trainingArgs = ""
for keyArg, valueArg in dictParams:
value = str(random(valueArg[0], max=valueArg[1]))
trainingArgs += " --" + keyArg + " " + value
# Launch the program
os.run("main.py" + trainingArgs)
# TODO: Save params/results ? or already inside training args ?
if __name__ == "__main__":
main()
```
|
Antanas Milukas (13 June 1871 – 19 March 1943) was a Lithuanian Roman Catholic priest, book publisher, and newspaper editor working among the Lithuanian Americans.
As a student at the Sejny Priest Seminary, he was involved in the publication and distribution of the illegal Lithuanian publications. He was searched by the Tsarist police for violating the Lithuanian press ban and fled to the United States where he completed his education at the St. Charles Borromeo Seminary. Ordained a priest in 1896, Milukas was a parson in various Lithuanian parishes in Pennsylvania and New York. In addition to his pastoral duties, Milukas was a member and co-founder of numerous Lithuanian American organizations and societies as well as a prolific Lithuanian-language book publisher and newspaper editor. Together with Julija Pranaitytė, Milukas published some 190 Lithuanian books. These included three-volume photo album compiled by Milukas and exhibited at the World's Fair in Paris, history of Lithuania translated into English by Milukas and distributed to diplomats at the Paris Peace Conference, 1919, and four-volume history of the Lithuanian Americans written by Milukas. He established and edited the quarterly cultural magazine (1898–1906) and edited the Catholic for forty years (1903–1943). He assisted in editing Varpas (1891–1892) and Tėvynės sargas and Žinyčia (1901–1902).
Biography
Milukas was born in Šeštokai, Suwałki Governorate, Congress Poland. After graduating from a primary school in Rudamina and the Gymnasium in Marijampolė, he enrolled at the Sejny Priest Seminary in 1899. At the seminary, he was an active participant in the Lithuanian National Revival. He organized a handwritten Lithuanian-language weekly newsletter, initially known as Knapt. It grew from 8 pages to 24 pages and changed titles to Visko po biskį (A Little About Everything) and Viltis (Hope). He contributed articles to the banned Lithuanian press, including Varpas and Ūkininkas, and was involved in its smuggling and distribution. In 1891, he was expelled from the seminary when prohibited publications were found in his dormitory. He was also searched by the police in connection with the Sietynas case.
To avoid the police, he fled to Tilsit in East Prussia (present-day Sovetsk, Kaliningrad Oblast) where for a few months he helped to edit and publish Varpas. With financial assistance from priest , Milukas arrived to Plymouth, Pennsylvania, where he took over the editorial duties of Vienybė Lietuvninkų. After a year, in 1893, he enrolled at the St. Charles Borromeo Seminary to finish his studies. Upon graduation, he was ordained a priest on 30 May 1896 by Archbishop Patrick John Ryan. He was assigned to the Lithuanian parish of St. George in Shenandoah, Pennsylvania. In 1901–1902, he studied canon law at the University of Fribourg in Switzerland. There he met Julija Pranaitytė and invited her to the United States starting their life-long collaboration on Lithuanian publications. In Fribourg, he also learned about the , a women's congregation that worked on publishing and distributing Catholic press, and brought the idea to the United States and prompted Maria Kaupas to establish the Sisters of Saint Casimir in 1907.
Upon his return to the United States, he was appointed to a Lithuanian parish in Brooklyn, New York. He worked at the Church of St. Mary of the Angels, a former Methodist church located at the end of the Williamsburg Bridge. In 1907, he organized the Lithuanian parish in Girardville and Gilberton, Pennsylvania. He was parson of Lithuanian parishes in Philadelphia at the Church of St. George (1909–1914) and in Maspeth, Queens at the Transfiguration Roman Catholic Church (1914–1933). The Maspeth church burned down twice, in 1919 and 1925. First, Milukas rebuilt the church, but the second time he moved it to the former St. Stanislaus Kostka Roman Catholic Church. In 1931, the Lithuanian government awarded Milukas the Order of Vytautas the Great (3rd class) in recognition of his dedication to Lithuanian causes and on the occasion of the 40th anniversary of his public work and his 60th birthday. He later was a chaplain at the St. Catherine's Hospital in Brooklyn and at the St. Francis Sanatorium for Cardiac Children in Roslyn, New York. He died in Brooklyn on 19 March 1943.
Activities
Societies and organizations
Milukas was active in the Lithuanian American public life, becoming co-founder and member of numerous societies and devoting his time to Lithuanian publications. He organized the Bishop Motiejus Valančius Library Society (), which published 10,000 copies of his book on how to learn to write in Tilsit in 1893. In 1894, he was a co-founder of the Society of Laurynas Ivinskis which organized the Lithuanian exhibition at the World's Fair in Paris in 1900. Milukas created a poster showing the difficult cultural and educational conditions in Lithuania and exhibited his three-volume Lietuviškas albumas, a photo album with explanatory text in Lithuanian and English, which was awarded a gold medal at the fair. In 1900, he co-founded the Motinėlė Society, which provided financial aid to Lithuanian students.
In 1907, he was elected as the "spiritual leader" of the Lithuanian Roman Catholic Union of America () and claimed that he outranked the chairman of the union. 23 priests signed a protest letter against such claims and forced Milukas to resign in 1909. The conflict pushed Milukas out of the Catholic leadership into the margins of Lithuanian American cultural life. During World War I, Milukas and other Lithuanians petitioned President Woodrow Wilson to proclaim the Lithuanian Day when all across United States donations would be collected for the benefit of Lithuanian war refugees. On 1 November 1916, Lithuanians collected $176,863 (). After the Żeligowski's Mutiny in 1920, Milukas established a charitable society for the Relief for the Little Martyrs of Vilnius to support Lithuanian orphans and schools in Vilnius Region and published anti-Polish works.
Publications
Together with Julija Pranaitytė, Milukas published some 190 Lithuanian books. The books included folk tales collected by Jonas Basanavičius, epistolary novel Viktutė by Marija Pečkauskaitė (Šatrijos Ragana), poetry of Pranas Vaičaitis, works by Kristijonas Donelaitis, , Antanas Baranauskas, Antanas Strazdas, Motiejus Valančius. He translated and published The History of the Lithuanian Nation and Its Present National Aspirations based on articles originally published in Žvaigždė by Antanas Jusaitis. The book was gifted to President Woodrow Wilson and other diplomats during the Paris Peace Conference, 1919. It was a popular book and required a second edition within three months. This edition included a facsimile of a thank-you letter from President Wilson. Milukas wrote and published two major books on the Lithuanian Americans, two-volume Pirmieji Amerikos lietuvių profesijonalai ir kronika (The First Lithuanian Professionals in United States and Chronicle, 1929–1931) and Amerikos lietuviai XIX šimtmetyje (Lithuanian Americans in the 19th Century, 1938–1942). In total, the circulation of Miliukas' books exceeded 500,000 copies, but it was not a profitable activity and Milukas died in poverty.
Milukas edited various Lithuanian newspapers, including Vienybė Lietuvninkų (1892–1893) and Garsas Amerikos lietuvių (1897–1898). In 1898, he established the quarterly cultural magazine and edited it until it ceased publication in 1906. While studying in Switzerland, he assisted Juozas Tumas-Vaižgantas with editing Tėvynės sargas and Žinyčia. When Tumas could no longer edit Žinyčia, Milukas merged the magazine with Dirva. In 1903, he purchased published in Brooklyn and edited it until his death. Initially it was a weekly, but became a monthly in 1923 and quarterly in 1926. Until 1909, it was the official periodical of the Lithuanian Roman Catholic Union of America.
References
External links
Full-text of volume 2 and 3 of Lietuviškas albumas exhibited in Paris in 1900
1871 births
1943 deaths
Emigrants from the Russian Empire to the United States
20th-century Lithuanian Roman Catholic priests
Lithuanian newspaper editors
Lithuanian book smugglers
Lithuanian publishers (people)
University of Fribourg alumni
Recipients of the Order of Vytautas the Great
|
Fischer esterification or Fischer–Speier esterification is a special type of esterification by refluxing a carboxylic acid and an alcohol in the presence of an acid catalyst. The reaction was first described by Emil Fischer and Arthur Speier in 1895. Most carboxylic acids are suitable for the reaction, but the alcohol should generally be primary or secondary. Tertiary alcohols are prone to elimination. Contrary to common misconception found in organic chemistry textbooks, phenols can also be esterified to give good to near quantitative yield of products. Commonly used catalysts for a Fischer esterification include sulfuric acid, p-toluenesulfonic acid, and Lewis acids such as scandium(III) triflate. For more valuable or sensitive substrates (for example, biomaterials) other, milder procedures such as Steglich esterification are used. The reaction is often carried out without a solvent (particularly when a large reagent excess of alcohol is used) or in a non-polar solvent (e.g. toluene, hexane) to facilitate the Dean-Stark method. Typical reaction times vary from 1–10 hours at temperatures of 60-110 °C.
Direct acylations of alcohols with carboxylic acids is preferred over acylations with anhydrides (poor atom economy) or acid chlorides (moisture sensitive). The main disadvantage of direct acylation is the unfavorable chemical equilibrium that must be remedied (e.g. by a large excess of one of the reagents), or by the removal of water (e.g. by using Dean-Stark distillation, anhydrous salts, molecular sieves, or by using a stoichiometric quantity of acid catalyst).
Overview
Fischer esterification is an example of nucleophilic acyl substitution based on the electrophilicity of the carbonyl carbon and the nucleophilicity of an alcohol. However, carboxylic acids tend to be less reactive than esters as electrophiles. Additionally, in dilute neutral solutions they tend to be deprotonated anions (and thus unreactive as electrophiles). Though kinetically very slow without any catalysts (most esters are metastable), pure esters will tend to spontaneously hydrolyse in the presence of water, so when carried out "unaided", high yields for this reaction are quite unfavourable.
Several steps can be taken to turn this unfavourable reaction into a favourable one.
The reaction mechanism for this reaction has several steps:
Proton transfer from acid catalyst to carbonyl oxygen increases electrophilicity of carbonyl carbon.
The carbonyl carbon is then attacked by the nucleophilic oxygen atom of the alcohol
Proton transfer from the oxonium ion to a second molecule of the alcohol gives an activated complex
Protonation of one of the hydroxy groups of the activated complex gives a new oxonium ion.
Loss of water from this oxonium ion and subsequent deprotonation gives the ester.
A generic mechanism for an acid Fischer esterification is shown below.
Advantages and disadvantages
Advantages
The primary advantages of Fischer esterification compared to other esterification processes are based on its relative simplicity. Straightforward acidic conditions can be used if acid-sensitive functional groups are not an issue; sulfuric acid can be used; weaker acids can be used with a tradeoff of longer reaction times. Because the reagents used are "direct," there is less environmental impact in terms of waste products and harmfulness of the reagents. Alkyl halides are potential greenhouse gases or ozone depletors, carcinogens, and possible ecological poisons. Acid chlorides evolve hydrogen chloride gas upon contact with atmospheric moisture, are corrosive, react vigorously with water and other nucleophiles (sometimes dangerously); they are easily quenched by other nucleophiles besides the desired alcohol; their most common synthesis routes involve the evolution of toxic carbon monoxide or sulfur dioxide gases (depending on the synthesis process used).
Acid anhydrides are more reactive than esters because the leaving group is a carboxylate anion—a better leaving group than an alkoxide anion because their negative charge is more delocalised. However, such routes generally result in poor atom economy. For example, in reacting ethanol with acetic anhydride, ethyl acetate forms and acetic acid is eliminated as a leaving group, which is considerably less reactive than an acid anhydride and will be left as a byproduct (in a wasteful 1:1 ratio with the ester product) if product is collected immediately. If conditions are acidic enough, the acetic acid can be further reacted via the Fischer esterification pathway, but at a much slower pace. However, in many carefully designed syntheses, reagents can be designed such that acid anhydrides are generated in situ and carboxylic acid byproducts are reactivated, and Fischer esterification routes are not necessarily mutually exclusive with acetic anhydride routes. (Examples of this include the common undergraduate organic lab experiment involving the acetylation of salicylic acid to yield aspirin.)
Fischer esterification is primarily a thermodynamically-controlled process: because of its slowness, the most stable ester tends to be the major product. This can be a desirable trait if there are multiple reaction sites and side product esters to be avoided. In contrast, rapid reactions involving acid anhydrides or acid chlorides are often kinetically-controlled.
Disadvantages
The primary disadvantages of Fischer esterification routes are its thermodynamic reversibility and relatively slow reaction rates—often on the scale of several hours to years, depending on the reaction conditions. Workarounds to this can be inconvenient if there are other functional groups sensitive to strong acid, in which case other catalytic acids may be chosen. If the product ester has a lower boiling point than either water or the reagents, the product may be distilled rather than water; this is common as esters with no protic functional groups tend to have lower boiling points than their protic parent reagents. Purification and extraction are easier if the ester product can be distilled away from the reagents and byproducts, but reaction rate can be slowed because overall reaction temperature can be limited in this scenario. A more inconvenient scenario is if the reagents have a lower boiling point than either the ester product or water, in which case the reaction mixture must be capped and refluxed and a large excess of starting material added. In this case anhydrous salts, such as copper(II) sulfate or potassium pyrosulfate, can also be added to sequester the water by forming hydrates, shifting the equilibrium towards ester products. These hydrated salts are then decanted prior to the final workup.
In wine aging
The natural esterification that takes place in wines and other alcoholic beverages during the aging process is an example of acid-catalysed esterification. Over time, the acidity of the acetic acid and tannins in an aging wine will catalytically protonate other organic acids (including acetic acid itself), encouraging ethanol to react as a nucleophile. As a result, ethyl acetate—the ester of ethanol and acetic acid—is the most abundant ester in wines. Other combinations of organic alcohols (such as phenol-containing compounds) and organic acids lead to a variety of different esters in wines, contributing to their different flavours, smells and tastes. Of course, when compared to sulfuric acid conditions, the acid conditions in a wine are mild, so yield is low (often in tenths or hundredths of a percentage point by volume) and take years for ester to accumulate.
Variations
Tetrabutylammonium tribromide (TBATB) can serve as an effective but unconventional catalyst for this reaction. It is believed that hydrobromic acid released by TBATB protonates the alcohol rather than the carboxylic acid, making the carboxylate the actual nucleophile. This would be a reversal of the standard esterification mechanism. An example of this method is the acylation 3-phenylpropanol using glacial acetic acid and TBATB. The reaction generates the ester in 15 minutes in a 95% yield without the need to remove water.
See also
Fischer glycosidation - the coupling of an alcohol and a sugar
References
External links
Animation of Fischer esterification
Condensation reactions
Esterification reactions
Name reactions
Emil Fischer
1895 in science
1895 in Germany
|
The Central District of Ungut County () is in Ardabil province, Iran. Its capital is the city of Tazeh Kand-e Angut, whose population at the 2016 National Census was 2,645 in 717 households.
In December 2020, Angut District was separated from Germi County in the establishment of Ungut County, which was divided into two districts of two rural districts each, with the city of Tazeh Kand-e Angut as its capital and only city.
References
Districts of Ardabil Province
Populated places in Ardabil Province
fa:بخش مرکزی شهرستان انگوت
|
The Pittsburgh Plate Glass Enamel Plant is an Art Moderne-styled factory in Milwaukee, Wisconsin, built in 1937 by the Pittsburgh Plate Glass Company. In 2009 it was added to the National Register of Historic Places in 2009.
History
The plant was constructed as part of the expansion of the paint and varnish division of what is now PPG Industries based in Pittsburgh. The building is four stories, 200 feet long, with a brick-clad exterior and a graceful glass tower at the northwest corner. It was designed by the firm of Eschweiler & Eschweiler. Hallmarks of the Art Moderne style are the simple, smooth shapes and curves resembling an airplane and the independence from any historic architectural styles. PPG manufactured enamel paint in the building from 1937 until 1976.
After Pittsburgh, Transpack made boxes in the plant until 2007. Renovated in 2008 for commercial and business use, the four-story building houses offices for Knight-Barry Title Group, and the headquarters for data security and compression company, PKWARE.
References
Industrial buildings and structures on the National Register of Historic Places in Wisconsin
Buildings and structures in Milwaukee
Streamline Moderne architecture in Wisconsin
Industrial buildings completed in 1937
National Register of Historic Places in Milwaukee
PPG Industries
|
Kai Lung () is a fictional character in a series of books by Ernest Bramah, consisting of The Wallet of Kai Lung (1900), Kai Lung's Golden Hours (1922), Kai Lung Unrolls His Mat (1928), The Moon of Much Gladness (1932; published in the US as The Return of Kai Lung), Kai Lung Beneath the Mulberry Tree (1940), Kai Lung: Six (1974) and Kai Lung Raises His Voice (2010).
Overview
Kai Lung is a Chinese storyteller whose travels and exploits serve mainly as excuses to introduce substories, which generally take up the majority of a Kai Lung book. He is a man of very simple motivations; most frequently, he is animated by a desire for enough taels to be able to feed and clothe himself. Otherwise, his main motivation is love for his wife, Hwa-mei, and he seeks nothing more than a simple, sustainable lifestyle. Generally, he does not intrude in other people's affairs unless he thinks it necessary to teach them the rudiments of classical proportion with one of his fables.
He usually comes into conflict with barbarians, bandits, and other people who are not classically educated, as well as various unscrupulous individuals who are intent on taking away his property.
References by other writers
In Thorne Smith's comedic fantasy The Stray Lamb, the character Mr. Lamb relaxes while reading Kai Lung.
Dorothy L. Sayers mentions Kai Lung and/or quotes from the books in several Lord Peter Wimsey novels, specifically Strong Poison, Gaudy Night and Busman's Honeymoon
In "'He Cometh and He Passeth By!'" by H. Russell Wakefield, one of the principal characters reads The Wallet of Kai-Lung before retiring to bed.
Ford Madox Ford repeatedly quoted the allegedly Chinese proverb "It would be hypocrisy to seek for the person of the Sacred Emperor in a Low Tea House." It has been convincingly argued that Ford originally acquired this proverb from the Kai Lung novels of Ernest Bramah, and that Bramah had created it for Kai Lung, rather than quoting a genuine Chinese proverb.
Irene the Librarian quotes Kai Lung in Genevieve Cogman’s novel “The Secret Chapter”.
References
Literary characters introduced in 1900
Characters in British novels of the 20th century
Fictional Chinese people in literature
|
Dermi Lusala (born 16 January 2003) is an English professional footballer who plays for club Coventry City as a right back.
Lusala is a product of the Tottenham Hotspur and Brentford academies and transferred to Coventry City in 2022. Lusala was capped by England at U16 level.
Club career
Youth years
A right back, Lusala began his career in the Brentford Academy and was a part of the U13 team which won the 2016 Elite Neon Cup. Following the closure of the academy at the end of the 2015–16 season, Lusala transferred into the Tottenham Hotspur Academy. He progressed to sign a one-year professional contract at the end of the 2020–21 season. Following an injury-plagued season in the Development Squad, during which he participated in first team training sessions, Lusala was released when his contract expired.
Coventry City
On 1 July 2022, Lusala signed a two-year contract with Championship club Coventry City on a free transfer. On 25 November 2022, he joined Southern League Premier Division Central club Barwell on a one-month loan and made four appearances. Lusala was a part of the Coventry City U21 team which reached the final of the 2022–23 Birmingham Senior Cup. On 21 October 2023, Lusala won his maiden call into a first team matchday squad and he remained an unused substitute during a 1–0 defeat to Bristol City.
International career
Lusala was capped by England at U16 level.
Personal life
Lusala attended St Ignatius' College.
Career statistics
References
External links
Dermi Lusala at ccfc.co.uk
Living people
English men's footballers
English Football League players
Men's association football fullbacks
2003 births
Black British sportsmen
Coventry City F.C. players
England men's youth international footballers
Barwell F.C. players
Southern Football League players
Footballers from Edmonton, London
|
Cryptomonadaceae is a family of Cryptophyta in the order Cryptomonadales.
References
External links
Cryptomonads
Eukaryote families
|
```c++
/*
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
* * Neither the name of Intel Corporation nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
*/
/**
* File:
* sgx_rsa_encryption.cpp
* Description:
* Wrapper for rsa operation functions
*
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "sgx_error.h"
#include "sgx_tcrypto.h"
#include "se_tcrypto_common.h"
#include <openssl/bn.h>
#include <openssl/rsa.h>
#include <openssl/evp.h>
#include <openssl/err.h>
#include <openssl/core_names.h>
#include <openssl/param_build.h>
#include "ssl_wrapper.h"
sgx_status_t sgx_create_rsa_key_pair(int n_byte_size, int e_byte_size, unsigned char *p_n, unsigned char *p_d, unsigned char *p_e,
unsigned char *p_p, unsigned char *p_q, unsigned char *p_dmp1,
unsigned char *p_dmq1, unsigned char *p_iqmp)
{
if (n_byte_size <= 0 || e_byte_size <= 0 || p_n == NULL || p_d == NULL || p_e == NULL ||
p_p == NULL || p_q == NULL || p_dmp1 == NULL || p_dmq1 == NULL || p_iqmp == NULL) {
return SGX_ERROR_INVALID_PARAMETER;
}
sgx_status_t ret_code = SGX_ERROR_UNEXPECTED;
EVP_PKEY* pkey = NULL;
EVP_PKEY_CTX* pkey_ctx = NULL;
BIGNUM* bn_n = NULL;
BIGNUM* bn_e = NULL;
BIGNUM* tmp_bn_e = NULL;
BIGNUM* bn_d = NULL;
BIGNUM* bn_dmp1 = NULL;
BIGNUM* bn_dmq1 = NULL;
BIGNUM* bn_iqmp = NULL;
BIGNUM* bn_q = NULL;
BIGNUM* bn_p = NULL;
do {
//create new rsa ctx
//
pkey_ctx = EVP_PKEY_CTX_new_from_name(NULL, "RSA", NULL);
if (pkey_ctx == NULL) {
ret_code = SGX_ERROR_OUT_OF_MEMORY;
break;
}
if (EVP_PKEY_keygen_init(pkey_ctx) <= 0) {
break;
}
//generate rsa key pair, with n_byte_size*8 mod size and p_e exponent
//
tmp_bn_e = BN_lebin2bn(p_e, e_byte_size, tmp_bn_e);
BN_CHECK_BREAK(tmp_bn_e);
if (EVP_PKEY_CTX_set_rsa_keygen_bits(pkey_ctx, n_byte_size * 8) <= 0) {
break;
}
if (EVP_PKEY_CTX_set1_rsa_keygen_pubexp(pkey_ctx, tmp_bn_e) <= 0) {
break;
}
if (EVP_PKEY_generate(pkey_ctx, &pkey) <= 0) {
break;
}
//get RSA key internal values
//
if (EVP_PKEY_get_bn_param(pkey, OSSL_PKEY_PARAM_RSA_N, &bn_n) == 0) {
break;
}
if (EVP_PKEY_get_bn_param(pkey, OSSL_PKEY_PARAM_RSA_E, &bn_e) == 0) {
break;
}
if (EVP_PKEY_get_bn_param(pkey, OSSL_PKEY_PARAM_RSA_D, &bn_d) == 0) {
break;
}
if (EVP_PKEY_get_bn_param(pkey, OSSL_PKEY_PARAM_RSA_FACTOR1, &bn_p) == 0) {
break;
}
if (EVP_PKEY_get_bn_param(pkey, OSSL_PKEY_PARAM_RSA_FACTOR2, &bn_q) == 0) {
break;
}
if (EVP_PKEY_get_bn_param(pkey, OSSL_PKEY_PARAM_RSA_EXPONENT1, &bn_dmp1) == 0) {
break;
}
if (EVP_PKEY_get_bn_param(pkey, OSSL_PKEY_PARAM_RSA_EXPONENT2, &bn_dmq1) == 0) {
break;
}
if (EVP_PKEY_get_bn_param(pkey, OSSL_PKEY_PARAM_RSA_COEFFICIENT1, &bn_iqmp) == 0) {
break;
}
//copy the generated key to input pointers
//
if (!BN_bn2lebinpad(bn_n, p_n, BN_num_bytes(bn_n)) ||
!BN_bn2lebinpad(bn_d, p_d, BN_num_bytes(bn_d)) ||
!BN_bn2lebinpad(bn_e, p_e, BN_num_bytes(bn_e)) ||
!BN_bn2lebinpad(bn_p, p_p, BN_num_bytes(bn_p)) ||
!BN_bn2lebinpad(bn_q, p_q, BN_num_bytes(bn_q)) ||
!BN_bn2lebinpad(bn_dmp1, p_dmp1, BN_num_bytes(bn_dmp1)) ||
!BN_bn2lebinpad(bn_dmq1, p_dmq1, BN_num_bytes(bn_dmq1)) ||
!BN_bn2lebinpad(bn_iqmp, p_iqmp, BN_num_bytes(bn_iqmp))) {
break;
}
ret_code = SGX_SUCCESS;
} while (0);
//free rsa ctx (RSA_free also free related BNs obtained in RSA_get functions)
//
EVP_PKEY_CTX_free(pkey_ctx);
EVP_PKEY_free(pkey);
BN_clear_free(tmp_bn_e);
BN_clear_free(bn_n);
BN_clear_free(bn_d);
BN_clear_free(bn_e);
BN_clear_free(bn_p);
BN_clear_free(bn_q);
BN_clear_free(bn_dmp1);
BN_clear_free(bn_dmq1);
BN_clear_free(bn_iqmp);
return ret_code;
}
sgx_status_t sgx_create_rsa_priv2_key(int mod_size, int exp_size, const unsigned char *p_rsa_key_e, const unsigned char *p_rsa_key_p, const unsigned char *p_rsa_key_q,
const unsigned char *p_rsa_key_dmp1, const unsigned char *p_rsa_key_dmq1, const unsigned char *p_rsa_key_iqmp,
void **new_pri_key2)
{
if (mod_size <= 0 || exp_size <= 0 || new_pri_key2 == NULL ||
p_rsa_key_e == NULL || p_rsa_key_p == NULL || p_rsa_key_q == NULL || p_rsa_key_dmp1 == NULL ||
p_rsa_key_dmq1 == NULL || p_rsa_key_iqmp == NULL) {
return SGX_ERROR_INVALID_PARAMETER;
}
EVP_PKEY_CTX* rsa_ctx = NULL;
EVP_PKEY *rsa_key = NULL;
sgx_status_t ret_code = SGX_ERROR_UNEXPECTED;
BIGNUM* n = NULL;
BIGNUM* e = NULL;
BIGNUM* d = NULL;
BIGNUM* dmp1 = NULL;
BIGNUM* dmq1 = NULL;
BIGNUM* iqmp = NULL;
BIGNUM* q = NULL;
BIGNUM* p = NULL;
BN_CTX* tmp_ctx = NULL;
OSSL_PARAM_BLD *param_build = NULL;
OSSL_PARAM *params = NULL;
do {
tmp_ctx = BN_CTX_new();
NULL_BREAK(tmp_ctx);
n = BN_new();
NULL_BREAK(n);
// convert RSA params, factors to BNs
//
p = BN_lebin2bn(p_rsa_key_p, (mod_size / 2), p);
BN_CHECK_BREAK(p);
q = BN_lebin2bn(p_rsa_key_q, (mod_size / 2), q);
BN_CHECK_BREAK(q);
dmp1 = BN_lebin2bn(p_rsa_key_dmp1, (mod_size / 2), dmp1);
BN_CHECK_BREAK(dmp1);
dmq1 = BN_lebin2bn(p_rsa_key_dmq1, (mod_size / 2), dmq1);
BN_CHECK_BREAK(dmq1);
iqmp = BN_lebin2bn(p_rsa_key_iqmp, (mod_size / 2), iqmp);
BN_CHECK_BREAK(iqmp);
e = BN_lebin2bn(p_rsa_key_e, (exp_size), e);
BN_CHECK_BREAK(e);
// calculate n value
//
if (!BN_mul(n, p, q, tmp_ctx)) {
break;
}
//calculate d value
//(n)=(p1)(q1)
//d=(e^1) mod (n)
//
d = BN_dup(n);
NULL_BREAK(d);
//select algorithms with an execution time independent of the respective numbers, to avoid exposing sensitive information to timing side-channel attacks.
//
BN_set_flags(d, BN_FLG_CONSTTIME);
BN_set_flags(e, BN_FLG_CONSTTIME);
if (!BN_sub(d, d, p) || !BN_sub(d, d, q) || !BN_add_word(d, 1) || !BN_mod_inverse(d, e, d, tmp_ctx)) {
break;
}
// allocates and initializes an RSA key structure
//
rsa_ctx = EVP_PKEY_CTX_new_from_name(NULL, "RSA", NULL);
if (rsa_ctx == NULL) {
ret_code = SGX_ERROR_OUT_OF_MEMORY;
break;
}
param_build = OSSL_PARAM_BLD_new();
if (param_build == NULL) {
break;
}
if( !OSSL_PARAM_BLD_push_BN(param_build, "n", n)
|| !OSSL_PARAM_BLD_push_BN(param_build, "e", e)
|| !OSSL_PARAM_BLD_push_BN(param_build, "d", d)
|| !OSSL_PARAM_BLD_push_BN(param_build, "rsa-factor1", p)
|| !OSSL_PARAM_BLD_push_BN(param_build, "rsa-factor2", q)
|| !OSSL_PARAM_BLD_push_BN(param_build, "rsa-exponent1", dmp1)
|| !OSSL_PARAM_BLD_push_BN(param_build, "rsa-exponent2", dmq1)
|| !OSSL_PARAM_BLD_push_BN(param_build, "rsa-coefficient1", iqmp)
|| (params = OSSL_PARAM_BLD_to_param(param_build)) == NULL) {
break;
}
if( EVP_PKEY_fromdata_init(rsa_ctx) <= 0) {
break;
}
if( EVP_PKEY_fromdata(rsa_ctx, &rsa_key, EVP_PKEY_KEYPAIR, params) <= 0) {
EVP_PKEY_free(rsa_key);
break;
}
*new_pri_key2 = rsa_key;
ret_code = SGX_SUCCESS;
} while (0);
OSSL_PARAM_BLD_free(param_build);
OSSL_PARAM_free(params);
EVP_PKEY_CTX_free(rsa_ctx);
BN_clear_free(n);
BN_clear_free(e);
BN_clear_free(d);
BN_clear_free(dmp1);
BN_clear_free(dmq1);
BN_clear_free(iqmp);
BN_clear_free(q);
BN_clear_free(p);
BN_CTX_free(tmp_ctx);
return ret_code;
}
sgx_status_t sgx_create_rsa_pub1_key(int mod_size, int exp_size, const unsigned char *le_n, const unsigned char *le_e, void **new_pub_key1)
{
if (new_pub_key1 == NULL || mod_size <= 0 || exp_size <= 0 || le_n == NULL || le_e == NULL) {
return SGX_ERROR_INVALID_PARAMETER;
}
EVP_PKEY *rsa_key = NULL;
EVP_PKEY_CTX *rsa_ctx = NULL;
sgx_status_t ret_code = SGX_ERROR_UNEXPECTED;
BIGNUM* n = NULL;
BIGNUM* e = NULL;
OSSL_PARAM_BLD *param_build = NULL;
OSSL_PARAM *params = NULL;
do {
//convert input buffers to BNs
//
n = BN_lebin2bn(le_n, mod_size, n);
BN_CHECK_BREAK(n);
e = BN_lebin2bn(le_e, exp_size, e);
BN_CHECK_BREAK(e);
rsa_ctx = EVP_PKEY_CTX_new_from_name(NULL, "RSA", NULL);
if (rsa_ctx == NULL) {
ret_code = SGX_ERROR_OUT_OF_MEMORY;
break;
}
param_build = OSSL_PARAM_BLD_new();
if (param_build == NULL) {
break;
}
if( !OSSL_PARAM_BLD_push_BN(param_build, "n", n)
|| !OSSL_PARAM_BLD_push_BN(param_build, "e", e)
|| (params = OSSL_PARAM_BLD_to_param(param_build)) == NULL) {
break;
}
if( EVP_PKEY_fromdata_init(rsa_ctx) <= 0) {
break;
}
if( EVP_PKEY_fromdata(rsa_ctx, &rsa_key, EVP_PKEY_PUBLIC_KEY, params) <= 0) {
EVP_PKEY_free(rsa_key);
break;
}
*new_pub_key1 = rsa_key;
ret_code = SGX_SUCCESS;
} while (0);
EVP_PKEY_CTX_free(rsa_ctx);
OSSL_PARAM_BLD_free(param_build);
OSSL_PARAM_free(params);
BN_clear_free(n);
BN_clear_free(e);
return ret_code;
}
sgx_status_t sgx_rsa_pub_encrypt_sha256(const void* rsa_key, unsigned char* pout_data, size_t* pout_len, const unsigned char* pin_data,
const size_t pin_len)
{
if (rsa_key == NULL || pout_len == NULL || pin_data == NULL || pin_len < 1 || pin_len >= INT_MAX)
{
return SGX_ERROR_INVALID_PARAMETER;
}
EVP_PKEY_CTX *ctx = NULL;
size_t data_len = 0;
sgx_status_t ret_code = SGX_ERROR_UNEXPECTED;
do
{
//allocate and init PKEY_CTX
//
ctx = EVP_PKEY_CTX_new((EVP_PKEY*)rsa_key, NULL);
if ((ctx == NULL) || (EVP_PKEY_encrypt_init(ctx) < 1))
{
break;
}
//set the RSA padding mode, init it to use SHA256
//
EVP_PKEY_CTX_set_rsa_padding(ctx, RSA_PKCS1_OAEP_PADDING);
EVP_PKEY_CTX_set_rsa_oaep_md(ctx, EVP_sha256());
if (EVP_PKEY_encrypt(ctx, NULL, &data_len, pin_data, pin_len) <= 0)
{
break;
}
if(pout_data == NULL)
{
*pout_len = data_len;
ret_code = SGX_SUCCESS;
break;
}
else if(*pout_len < data_len)
{
ret_code = SGX_ERROR_INVALID_PARAMETER;
break;
}
if (EVP_PKEY_encrypt(ctx, pout_data, pout_len, pin_data, pin_len) <= 0)
{
break;
}
ret_code = SGX_SUCCESS;
}
while (0);
EVP_PKEY_CTX_free(ctx);
return ret_code;
}
sgx_status_t sgx_rsa_priv_decrypt_sha256(const void* rsa_key, unsigned char* pout_data, size_t* pout_len, const unsigned char* pin_data,
const size_t pin_len)
{
if (rsa_key == NULL || pout_len == NULL || pin_data == NULL || pin_len < 1 || pin_len >= INT_MAX)
{
return SGX_ERROR_INVALID_PARAMETER;
}
EVP_PKEY_CTX *ctx = NULL;
size_t data_len = 0;
sgx_status_t ret_code = SGX_ERROR_UNEXPECTED;
do
{
//allocate and init PKEY_CTX
//
ctx = EVP_PKEY_CTX_new((EVP_PKEY*)rsa_key, NULL);
if ((ctx == NULL) || (EVP_PKEY_decrypt_init(ctx) < 1))
{
break;
}
//set the RSA padding mode, init it to use SHA256
//
EVP_PKEY_CTX_set_rsa_padding(ctx, RSA_PKCS1_OAEP_PADDING);
EVP_PKEY_CTX_set_rsa_oaep_md(ctx, EVP_sha256());
if (EVP_PKEY_decrypt(ctx, NULL, &data_len, pin_data, pin_len) <= 0)
{
break;
}
if(pout_data == NULL)
{
*pout_len = data_len;
ret_code = SGX_SUCCESS;
break;
}
else if(*pout_len < data_len)
{
ret_code = SGX_ERROR_INVALID_PARAMETER;
break;
}
if (EVP_PKEY_decrypt(ctx, pout_data, pout_len, pin_data, pin_len) <= 0)
{
break;
}
ret_code = SGX_SUCCESS;
}
while (0);
EVP_PKEY_CTX_free(ctx);
return ret_code;
}
sgx_status_t sgx_create_rsa_priv1_key(int n_byte_size, int e_byte_size, int d_byte_size, const unsigned char *le_n, const unsigned char *le_e,
const unsigned char *le_d, void **new_pri_key1)
{
if (n_byte_size <= 0 || e_byte_size <= 0 || d_byte_size <= 0 || new_pri_key1 == NULL ||
le_n == NULL || le_e == NULL || le_d == NULL) {
return SGX_ERROR_INVALID_PARAMETER;
}
EVP_PKEY *rsa_key = NULL;
EVP_PKEY_CTX *rsa_ctx = NULL;
sgx_status_t ret_code = SGX_ERROR_UNEXPECTED;
BIGNUM* n = NULL;
BIGNUM* e = NULL;
BIGNUM* d = NULL;
OSSL_PARAM_BLD *param_build = NULL;
OSSL_PARAM *params = NULL;
do {
//convert input buffers to BNs
//
n = BN_lebin2bn(le_n, n_byte_size, n);
BN_CHECK_BREAK(n);
e = BN_lebin2bn(le_e, e_byte_size, e);
BN_CHECK_BREAK(e);
d = BN_lebin2bn(le_d, d_byte_size, d);
BN_CHECK_BREAK(d);
rsa_ctx = EVP_PKEY_CTX_new_from_name(NULL, "RSA", NULL);
if (rsa_ctx == NULL) {
ret_code = SGX_ERROR_OUT_OF_MEMORY;
break;
}
param_build = OSSL_PARAM_BLD_new();
if (param_build == NULL) {
break;
}
if( !OSSL_PARAM_BLD_push_BN(param_build, "n", n)
|| !OSSL_PARAM_BLD_push_BN(param_build, "e", e)
|| !OSSL_PARAM_BLD_push_BN(param_build, "d", d)
|| (params = OSSL_PARAM_BLD_to_param(param_build)) == NULL) {
break;
}
if( EVP_PKEY_fromdata_init(rsa_ctx) <= 0) {
break;
}
if( EVP_PKEY_fromdata(rsa_ctx, &rsa_key, EVP_PKEY_KEYPAIR, params) <= 0) {
EVP_PKEY_free(rsa_key);
break;
}
*new_pri_key1 = rsa_key;
ret_code = SGX_SUCCESS;
} while (0);
EVP_PKEY_CTX_free(rsa_ctx);
OSSL_PARAM_BLD_free(param_build);
OSSL_PARAM_free(params);
BN_clear_free(n);
BN_clear_free(e);
BN_clear_free(d);
return ret_code;
}
sgx_status_t sgx_free_rsa_key(void *p_rsa_key, sgx_rsa_key_type_t key_type, int mod_size, int exp_size) {
(void)(key_type);
(void)(mod_size);
(void)(exp_size);
if (p_rsa_key != NULL) {
EVP_PKEY_free((EVP_PKEY*)p_rsa_key);
}
return SGX_SUCCESS;
}
```
|
```html
<!DOCTYPE html>
<html class="writer-html5" lang="en" >
<head>
<meta charset="utf-8" /><meta name="generator" content="Docutils 0.18.1: path_to_url" />
<meta name="viewport" content="width=device-width, initial-scale=1.0" />
<title>Distributing Ring Applications using Ring2EXE — Ring 1.21 documentation</title>
<link rel="stylesheet" href="_static/pygments.css" type="text/css" />
<link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
<link rel="stylesheet" href="_static/css/custom.css" type="text/css" />
<!--[if lt IE 9]>
<script src="_static/js/html5shiv.min.js"></script>
<![endif]-->
<script src="_static/jquery.js"></script>
<script src="_static/_sphinx_javascript_frameworks_compat.js"></script>
<script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
<script src="_static/doctools.js"></script>
<script src="_static/sphinx_highlight.js"></script>
<script src="_static/js/theme.js"></script>
<link rel="index" title="Index" href="genindex.html" />
<link rel="search" title="Search" href="search.html" />
<link rel="next" title="The Ring Package Manager (RingPM)" href="ringpm.html" />
<link rel="prev" title="Distributing Ring Applications (Manual)" href="distribute.html" />
</head>
<body class="wy-body-for-nav">
<div class="wy-grid-for-nav">
<nav data-toggle="wy-nav-shift" class="wy-nav-side">
<div class="wy-side-scroll">
<div class="wy-side-nav-search" >
<a href="index.html">
<img src="_static/ringdoclogo.jpg" class="logo" alt="Logo"/>
</a>
<div role="search">
<form id="rtd-search-form" class="wy-form" action="search.html" method="get">
<input type="text" name="q" placeholder="Search docs" aria-label="Search docs" />
<input type="hidden" name="check_keywords" value="yes" />
<input type="hidden" name="area" value="default" />
</form>
</div>
</div><div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Navigation menu">
<ul class="current">
<li class="toctree-l1"><a class="reference internal" href="ringapps.html">Applications developed in a few hours</a></li>
<li class="toctree-l1"><a class="reference internal" href="introduction.html">Introduction</a></li>
<li class="toctree-l1"><a class="reference internal" href="ringnotepad.html">Using Ring Notepad</a></li>
<li class="toctree-l1"><a class="reference internal" href="getting_started.html">Getting Started - First Style</a></li>
<li class="toctree-l1"><a class="reference internal" href="getting_started2.html">Getting Started - Second Style</a></li>
<li class="toctree-l1"><a class="reference internal" href="getting_started3.html">Getting Started - Third Style</a></li>
<li class="toctree-l1"><a class="reference internal" href="variables.html">Variables</a></li>
<li class="toctree-l1"><a class="reference internal" href="operators.html">Operators</a></li>
<li class="toctree-l1"><a class="reference internal" href="controlstructures.html">Control Structures - First Style</a></li>
<li class="toctree-l1"><a class="reference internal" href="controlstructures2.html">Control Structures - Second Style</a></li>
<li class="toctree-l1"><a class="reference internal" href="controlstructures3.html">Control Structures - Third Style</a></li>
<li class="toctree-l1"><a class="reference internal" href="getinput.html">Getting Input</a></li>
<li class="toctree-l1"><a class="reference internal" href="functions.html">Functions - First Style</a></li>
<li class="toctree-l1"><a class="reference internal" href="functions2.html">Functions - Second Style</a></li>
<li class="toctree-l1"><a class="reference internal" href="functions3.html">Functions - Third Style</a></li>
<li class="toctree-l1"><a class="reference internal" href="programstructure.html">Program Structure</a></li>
<li class="toctree-l1"><a class="reference internal" href="lists.html">Lists</a></li>
<li class="toctree-l1"><a class="reference internal" href="strings.html">Strings</a></li>
<li class="toctree-l1"><a class="reference internal" href="dateandtime.html">Date and Time</a></li>
<li class="toctree-l1"><a class="reference internal" href="checkandconvert.html">Check Data Type and Conversion</a></li>
<li class="toctree-l1"><a class="reference internal" href="mathfunc.html">Mathematical Functions</a></li>
<li class="toctree-l1"><a class="reference internal" href="files.html">Files</a></li>
<li class="toctree-l1"><a class="reference internal" href="systemfunc.html">System Functions</a></li>
<li class="toctree-l1"><a class="reference internal" href="evaldebug.html">Eval() and Debugging</a></li>
<li class="toctree-l1"><a class="reference internal" href="demo.html">Demo Programs</a></li>
<li class="toctree-l1"><a class="reference internal" href="odbc.html">ODBC Functions</a></li>
<li class="toctree-l1"><a class="reference internal" href="mysql.html">MySQL Functions</a></li>
<li class="toctree-l1"><a class="reference internal" href="sqlite.html">SQLite Functions</a></li>
<li class="toctree-l1"><a class="reference internal" href="postgresql.html">PostgreSQL Functions</a></li>
<li class="toctree-l1"><a class="reference internal" href="secfunc.html">Security and Internet Functions</a></li>
<li class="toctree-l1"><a class="reference internal" href="oop.html">Object Oriented Programming (OOP)</a></li>
<li class="toctree-l1"><a class="reference internal" href="fp.html">Functional Programming (FP)</a></li>
<li class="toctree-l1"><a class="reference internal" href="metaprog.html">Reflection and Meta-programming</a></li>
<li class="toctree-l1"><a class="reference internal" href="declarative.html">Declarative Programming using Nested Structures</a></li>
<li class="toctree-l1"><a class="reference internal" href="natural.html">Natural language programming</a></li>
<li class="toctree-l1"><a class="reference internal" href="naturallibrary.html">Using the Natural Library</a></li>
<li class="toctree-l1"><a class="reference internal" href="scope.html">Scope Rules for Variables and Attributes</a></li>
<li class="toctree-l1"><a class="reference internal" href="scope2.html">Scope Rules for Functions and Methods</a></li>
<li class="toctree-l1"><a class="reference internal" href="syntaxflexibility.html">Syntax Flexibility</a></li>
<li class="toctree-l1"><a class="reference internal" href="typehints.html">The Type Hints Library</a></li>
<li class="toctree-l1"><a class="reference internal" href="debug.html">The Trace Library and the Interactive Debugger</a></li>
<li class="toctree-l1"><a class="reference internal" href="ringemb.html">Embedding Ring Language in Ring Programs</a></li>
<li class="toctree-l1"><a class="reference internal" href="stdlib.html">Stdlib Functions</a></li>
<li class="toctree-l1"><a class="reference internal" href="stdlibclasses.html">Stdlib Classes</a></li>
<li class="toctree-l1"><a class="reference internal" href="qt.html">Desktop, WebAssembly and Mobile development using RingQt</a></li>
<li class="toctree-l1"><a class="reference internal" href="formdesigner.html">Using the Form Designer</a></li>
<li class="toctree-l1"><a class="reference internal" href="qt3d.html">Graphics Programming using RingQt3D</a></li>
<li class="toctree-l1"><a class="reference internal" href="ringqtobjects.html">Objects Library for RingQt Application</a></li>
<li class="toctree-l1"><a class="reference internal" href="multilanguage.html">Multi-language Applications</a></li>
<li class="toctree-l1"><a class="reference internal" href="qtmobile.html">Building RingQt Applications for Mobile</a></li>
<li class="toctree-l1"><a class="reference internal" href="qtwebassembly.html">Building RingQt Applications for WebAssembly</a></li>
<li class="toctree-l1"><a class="reference internal" href="web.html">Web Development (CGI Library)</a></li>
<li class="toctree-l1"><a class="reference internal" href="deployincloud.html">Deploying Web Applications in the Cloud</a></li>
<li class="toctree-l1"><a class="reference internal" href="allegro.html">Graphics and 2D Games programming using RingAllegro</a></li>
<li class="toctree-l1"><a class="reference internal" href="gameengine.html">Demo Project - Game Engine for 2D Games</a></li>
<li class="toctree-l1"><a class="reference internal" href="gameengineandorid.html">Building Games For Android</a></li>
<li class="toctree-l1"><a class="reference internal" href="ringraylib.html">Developing Games using RingRayLib</a></li>
<li class="toctree-l1"><a class="reference internal" href="usingopengl.html">Using RingOpenGL and RingFreeGLUT for 3D Graphics</a></li>
<li class="toctree-l1"><a class="reference internal" href="usingopengl2.html">Using RingOpenGL and RingAllegro for 3D Graphics</a></li>
<li class="toctree-l1"><a class="reference internal" href="goldmagic800.html">Demo Project - The Gold Magic 800 Game</a></li>
<li class="toctree-l1"><a class="reference internal" href="tilengine.html">Using RingTilengine</a></li>
<li class="toctree-l1"><a class="reference internal" href="performancetips.html">Performance Tips</a></li>
<li class="toctree-l1"><a class="reference internal" href="compiler.html">Command Line Options</a></li>
<li class="toctree-l1"><a class="reference internal" href="distribute.html">Distributing Ring Applications (Manual)</a></li>
<li class="toctree-l1 current"><a class="current reference internal" href="#">Distributing Ring Applications using Ring2EXE</a><ul>
<li class="toctree-l2"><a class="reference internal" href="#using-ring2exe">Using Ring2EXE</a></li>
<li class="toctree-l2"><a class="reference internal" href="#how-ring2exe-works">How Ring2EXE works?</a></li>
<li class="toctree-l2"><a class="reference internal" href="#example">Example</a></li>
<li class="toctree-l2"><a class="reference internal" href="#options">Options</a></li>
<li class="toctree-l2"><a class="reference internal" href="#building-standalone-console-application">Building standalone console application</a></li>
<li class="toctree-l2"><a class="reference internal" href="#distributing-ringallegro-applications">Distributing RingAllegro Applications</a></li>
<li class="toctree-l2"><a class="reference internal" href="#distributing-ringqt-applications">Distributing RingQt Applications</a></li>
<li class="toctree-l2"><a class="reference internal" href="#distributing-applications-for-mobile-using-ringqt">Distributing Applications for Mobile using RingQt</a></li>
<li class="toctree-l2"><a class="reference internal" href="#distributing-applications-for-webassembly-using-ringqt">Distributing Applications for WebAssembly using RingQt</a></li>
<li class="toctree-l2"><a class="reference internal" href="#building-the-cards-game-for-mobile-using-ringqt">Building the Cards Game for Mobile using RingQt</a></li>
<li class="toctree-l2"><a class="reference internal" href="#building-the-weight-history-application-for-mobile-using-ringqt">Building the Weight History Application for Mobile using RingQt</a></li>
<li class="toctree-l2"><a class="reference internal" href="#building-the-form-designer-for-mobile-using-ringqt">Building the Form Designer for Mobile using RingQt</a></li>
<li class="toctree-l2"><a class="reference internal" href="#creating-the-qt-resource-file-using-folder2qrc">Creating the Qt resource file using Folder2qrc</a></li>
<li class="toctree-l2"><a class="reference internal" href="#important-information-about-ring2exe">Important Information about Ring2EXE</a></li>
</ul>
</li>
<li class="toctree-l1"><a class="reference internal" href="ringpm.html">The Ring Package Manager (RingPM)</a></li>
<li class="toctree-l1"><a class="reference internal" href="zerolib.html">ZeroLib Functions Reference</a></li>
<li class="toctree-l1"><a class="reference internal" href="foxringfuncsdoc.html">FoxRing Functions Reference</a></li>
<li class="toctree-l1"><a class="reference internal" href="bignumber.html">BigNumber Functions Reference</a></li>
<li class="toctree-l1"><a class="reference internal" href="csvlib.html">CSVLib Functions Reference</a></li>
<li class="toctree-l1"><a class="reference internal" href="jsonlib.html">JSONLib Functions Reference</a></li>
<li class="toctree-l1"><a class="reference internal" href="httplib.html">HTTPLib Functions Reference</a></li>
<li class="toctree-l1"><a class="reference internal" href="tokenslib.html">TokensLib Functions Reference</a></li>
<li class="toctree-l1"><a class="reference internal" href="libcurl.html">Using RingLibCurl</a></li>
<li class="toctree-l1"><a class="reference internal" href="ringlibcurlfuncsdoc.html">RingLibCurl Functions Reference</a></li>
<li class="toctree-l1"><a class="reference internal" href="socket.html">Using RingSockets</a></li>
<li class="toctree-l1"><a class="reference internal" href="threads.html">Using RingThreads</a></li>
<li class="toctree-l1"><a class="reference internal" href="libui.html">Using RingLibui</a></li>
<li class="toctree-l1"><a class="reference internal" href="ringzip.html">Using RingZip</a></li>
<li class="toctree-l1"><a class="reference internal" href="ringlibzipfuncsdoc.html">RingLibZip Functions Reference</a></li>
<li class="toctree-l1"><a class="reference internal" href="ringmurmurhashfuncsdoc.html">RingMurmurHash Functions Reference</a></li>
<li class="toctree-l1"><a class="reference internal" href="ringconsolecolorsfuncsdoc.html">RingConsoleColors Functions Reference</a></li>
<li class="toctree-l1"><a class="reference internal" href="usingrogueutil.html">Using RingRogueUtil</a></li>
<li class="toctree-l1"><a class="reference internal" href="ringallegrofuncsdoc.html">RingAllegro Functions Reference</a></li>
<li class="toctree-l1"><a class="reference internal" href="libsdl.html">Using RingLibSDL</a></li>
<li class="toctree-l1"><a class="reference internal" href="ringlibsdlfuncsdoc.html">RingLibSDL Functions Reference</a></li>
<li class="toctree-l1"><a class="reference internal" href="libuv.html">Using Ringlibuv</a></li>
<li class="toctree-l1"><a class="reference internal" href="ringlibuvfuncsdoc.html">RingLibuv Functions Reference</a></li>
<li class="toctree-l1"><a class="reference internal" href="ringfreeglutfuncsdoc.html">RingFreeGLUT Functions Reference</a></li>
<li class="toctree-l1"><a class="reference internal" href="ringstbimage.html">RingStbImage Functions Reference</a></li>
<li class="toctree-l1"><a class="reference internal" href="ringopengl32funcsdoc.html">RingOpenGL (OpenGL 3.2) Functions Reference</a></li>
<li class="toctree-l1"><a class="reference internal" href="qtclassesdoc.html">RingQt Classes and Methods Reference</a></li>
<li class="toctree-l1"><a class="reference internal" href="usingfastpro.html">Using FastPro Extension</a></li>
<li class="toctree-l1"><a class="reference internal" href="usingref.html">Using References</a></li>
<li class="toctree-l1"><a class="reference internal" href="lowlevel.html">Low Level Functions</a></li>
<li class="toctree-l1"><a class="reference internal" href="extension_tutorial.html">Tutorial: Ring Extensions in C/C++</a></li>
<li class="toctree-l1"><a class="reference internal" href="extension.html">Extension using the C/C++ languages</a></li>
<li class="toctree-l1"><a class="reference internal" href="embedding.html">Embedding Ring Language in C/C++ Programs</a></li>
<li class="toctree-l1"><a class="reference internal" href="codegenerator.html">Code Generator for wrapping C/C++ Libraries</a></li>
<li class="toctree-l1"><a class="reference internal" href="ringbeep.html">Create your first extension using the Code Generator</a></li>
<li class="toctree-l1"><a class="reference internal" href="languagedesign.html">Release Notes: Version 1.0</a></li>
<li class="toctree-l1"><a class="reference internal" href="whatisnew.html">Release Notes: Version 1.1</a></li>
<li class="toctree-l1"><a class="reference internal" href="whatisnew2.html">Release Notes: Version 1.2</a></li>
<li class="toctree-l1"><a class="reference internal" href="whatisnew3.html">Release Notes: Version 1.3</a></li>
<li class="toctree-l1"><a class="reference internal" href="whatisnew4.html">Release Notes: Version 1.4</a></li>
<li class="toctree-l1"><a class="reference internal" href="whatisnew5.html">Release Notes: Version 1.5</a></li>
<li class="toctree-l1"><a class="reference internal" href="whatisnew6.html">Release Notes: Version 1.6</a></li>
<li class="toctree-l1"><a class="reference internal" href="whatisnew7.html">Release Notes: Version 1.7</a></li>
<li class="toctree-l1"><a class="reference internal" href="whatisnew8.html">Release Notes: Version 1.8</a></li>
<li class="toctree-l1"><a class="reference internal" href="whatisnew9.html">Release Notes: Version 1.9</a></li>
<li class="toctree-l1"><a class="reference internal" href="whatisnew10.html">Release Notes: Version 1.10</a></li>
<li class="toctree-l1"><a class="reference internal" href="whatisnew11.html">Release Notes: Version 1.11</a></li>
<li class="toctree-l1"><a class="reference internal" href="whatisnew12.html">Release Notes: Version 1.12</a></li>
<li class="toctree-l1"><a class="reference internal" href="whatisnew13.html">Release Notes: Version 1.13</a></li>
<li class="toctree-l1"><a class="reference internal" href="whatisnew14.html">Release Notes: Version 1.14</a></li>
<li class="toctree-l1"><a class="reference internal" href="whatisnew15.html">Release Notes: Version 1.15</a></li>
<li class="toctree-l1"><a class="reference internal" href="whatisnew16.html">Release Notes: Version 1.16</a></li>
<li class="toctree-l1"><a class="reference internal" href="whatisnew17.html">Release Notes: Version 1.17</a></li>
<li class="toctree-l1"><a class="reference internal" href="whatisnew18.html">Release Notes: Version 1.18</a></li>
<li class="toctree-l1"><a class="reference internal" href="whatisnew19.html">Release Notes: Version 1.19</a></li>
<li class="toctree-l1"><a class="reference internal" href="whatisnew20.html">Release Notes: Version 1.20</a></li>
<li class="toctree-l1"><a class="reference internal" href="whatisnew21.html">Release Notes: Version 1.21</a></li>
<li class="toctree-l1"><a class="reference internal" href="codeeditors.html">Using Other Code Editors</a></li>
<li class="toctree-l1"><a class="reference internal" href="faq.html">Frequently Asked Questions (FAQ)</a></li>
<li class="toctree-l1"><a class="reference internal" href="sourcecode.html">Building From Source Code</a></li>
<li class="toctree-l1"><a class="reference internal" href="contribute.html">How to contribute?</a></li>
<li class="toctree-l1"><a class="reference internal" href="reference.html">Language Specification</a></li>
<li class="toctree-l1"><a class="reference internal" href="resources.html">Resources</a></li>
</ul>
</div>
</div>
</nav>
<section data-toggle="wy-nav-shift" class="wy-nav-content-wrap"><nav class="wy-nav-top" aria-label="Mobile navigation menu" >
<i data-toggle="wy-nav-top" class="fa fa-bars"></i>
<a href="index.html">Ring</a>
</nav>
<div class="wy-nav-content">
<div class="rst-content">
<div role="navigation" aria-label="Page navigation">
<ul class="wy-breadcrumbs">
<li><a href="index.html" class="icon icon-home" aria-label="Home"></a></li>
<li class="breadcrumb-item active">Distributing Ring Applications using Ring2EXE</li>
<li class="wy-breadcrumbs-aside">
</li>
</ul>
<hr/>
</div>
<div role="main" class="document" itemscope="itemscope" itemtype="path_to_url">
<div itemprop="articleBody">
<section id="distributing-ring-applications-using-ring2exe">
<span id="index-0"></span><h1>Distributing Ring Applications using Ring2EXE<a class="headerlink" href="#distributing-ring-applications-using-ring2exe" title="Permalink to this heading"></a></h1>
<p>In this chapter we will learn about distributing Ring applications.</p>
<p>Starting from Ring 1.6 we have a nice tool called Ring2EXE (Written in Ring itself)</p>
<p>Using Ring2EXE we can distribute applications quickly for Windows, Linux, macOS, WebAssembly and Mobile devices</p>
<div class="admonition note">
<p class="admonition-title">Note</p>
<p>We can use the Distribute Menu in the Ring Notepad application (More Easy)</p>
</div>
<section id="using-ring2exe">
<span id="index-1"></span><h2>Using Ring2EXE<a class="headerlink" href="#using-ring2exe" title="Permalink to this heading"></a></h2>
<div class="highlight-none notranslate"><div class="highlight"><pre><span></span>ring2exe filename.ring [Options]
</pre></div>
</div>
<p>This will set filename.ring as input to the program</p>
<p>The next files will be generated</p>
<div class="highlight-none notranslate"><div class="highlight"><pre><span></span>filename.ringo (The Ring Object File - by Ring Compiler)
filename.c (The C Source code file
Contains the ringo file content
Will be generated by this program)
filename_buildvc.bat (Will be executed to build filename.c using Visual C/C++)
filename_buildgcc.bat (Will be executed to build filename.c using GNU C/C++)
filename_buildclang.bat (Will be executed to build filename.c using CLang C/C++)
filename.obj (Will be generated by the Visual C/C++ compiler)
filename.exe (Will be generated by the Visual C/C++ Linker)
filename (Executable File - On Linux & MacOS X platforms)
</pre></div>
</div>
</section>
<section id="how-ring2exe-works">
<span id="index-2"></span><h2>How Ring2EXE works?<a class="headerlink" href="#how-ring2exe-works" title="Permalink to this heading"></a></h2>
<p>At first the Ring compiler will be used to generate the Ring object file (<a href="#id1"><span class="problematic" id="id2">*</span></a>.ringo)</p>
<p>If we have a C compiler (optional), This object file will be embedded inside a C source code file</p>
<p>Then using the C compiler and the Ring library (Contains the Ring Virtual Machine) the executable file</p>
<p>will be generated!</p>
<p>If we dont have a C compiler, the Ring executable will be copied and renamed to your application name</p>
<p>And your Ring object file (<a href="#id3"><span class="problematic" id="id4">*</span></a>.ringo) will become ring.ringo to be executed at startup of the executable file.</p>
<p>So its better and easy to have a C compiler on your machine to be used by Ring2EXE.</p>
</section>
<section id="example">
<span id="index-3"></span><h2>Example<a class="headerlink" href="#example" title="Permalink to this heading"></a></h2>
<p>We have test.ring contains the next code</p>
<div class="highlight-ring notranslate"><div class="highlight"><pre><span></span><span class="k">see</span> <span class="s">"Hello, World!"</span> <span class="o">+</span> <span class="n">nl</span>
</pre></div>
</div>
<p>To build the executable file for Windows, Linux or macOS</p>
<div class="highlight-none notranslate"><div class="highlight"><pre><span></span>ring2exe test.ring
</pre></div>
</div>
<p>To run the program (Windows)</p>
<div class="highlight-none notranslate"><div class="highlight"><pre><span></span>test
</pre></div>
</div>
<p>To run the program (Linux and macOS)</p>
<div class="highlight-none notranslate"><div class="highlight"><pre><span></span>./test
</pre></div>
</div>
</section>
<section id="options">
<span id="index-4"></span><h2>Options<a class="headerlink" href="#options" title="Permalink to this heading"></a></h2>
<div class="highlight-none notranslate"><div class="highlight"><pre><span></span>-keep : Don't delete Temp. Files
-static : Build Standalone Executable File
(Don't use ring.dll/ring.so/ring.dylib)
-gui : Build GUI Application (Hide the Console Window)
-dist : Prepare application for distribution
-allruntime : Include all libraries in distribution
-mobileqt : Prepare Qt Project to distribute Ring Application for Mobile
-webassemblyqt : Prepare Qt Project to distribute Ring Application for the web (WebAssembly)
-noqt : Remove RingQt from distribution
-noallegro : Remove RingAllegro from distribution
-noopenssl : Remove RingOpenSSL from distribution
-nolibcurl : Remove RingLibCurl from distribution
-nomysql : Remove RingMySQL from distribution
-noodbc : Remove RingODBC from distribution
-nosqlite : Remove RingSQLite from distribution
-noopengl : Remove RingOpenGL from distribution
-nofreeglut : Remove RingFreeGLUT from distribution
-nolibzip : Remove RingLibZip from distribution
-noconsolecolors : Remove RingConsoleColors from distribution
-nomurmuhash : Remove RingMurmurHash from distribution
-nocruntime : Remove C Runtime from distribution
-qt : Add RingQt to distribution
-allegro : Add RingAllegro to distribution
-openssl : Add RingOpenSSL to distribution
-libcurl : Add RingLibCurl to distribution
-mysql : Add RingMySQL to distribution
-odbc : Add RingODBC to distribution
-sqlite : Add RingSQLite to distribution
-postgresql : Add RingPostgreSQL to distribution
-opengl : Add RingOpenGL to distribution
-freeglut : Add RingFreeGLUT to distribution
-libzip : Add RingLibZip to distribution
-libuv : Add RingLibuv to distribution
-consolecolors : Add RingConsoleColors to distribution
-murmurhash : Add RingMurmurHash to distribution
-cruntime : Add C Runtime to distribution
</pre></div>
</div>
</section>
<section id="building-standalone-console-application">
<span id="index-5"></span><h2>Building standalone console application<a class="headerlink" href="#building-standalone-console-application" title="Permalink to this heading"></a></h2>
<p>Using the -static option we can build executable console application</p>
<p>So we dont have to use ring.dll, ring.so or ring.dylib</p>
<p>This avoid only the need to Ring dynamic link library</p>
<p>If you are using another libraries, You will need to include it with your application.</p>
<div class="highlight-none notranslate"><div class="highlight"><pre><span></span>ring2exe test.ring -static
</pre></div>
</div>
</section>
<section id="distributing-ringallegro-applications">
<span id="index-6"></span><h2>Distributing RingAllegro Applications<a class="headerlink" href="#distributing-ringallegro-applications" title="Permalink to this heading"></a></h2>
<p>We have test2.ring contains the next code</p>
<div class="highlight-ring notranslate"><div class="highlight"><pre><span></span><span class="c"># Just a simple program to test Ring2EXE Tool!</span>
<span class="c"># Using RingAllegro</span>
<span class="k">load</span> <span class="s">"gameengine.ring"</span> <span class="c"># Give Control to the Game Engine</span>
<span class="k">func</span> <span class="n">main</span> <span class="c"># Called by the Game Engine</span>
<span class="n">oGame</span> <span class="o">=</span> <span class="k">New</span> <span class="n">Game</span> <span class="c"># Create the Game Object</span>
<span class="p">{</span>
<span class="n">title</span> <span class="o">=</span> <span class="s">"My First Game"</span>
<span class="p">}</span>
</pre></div>
</div>
<p>To build the executable file and prepare for distributing the Game</p>
<p>We use -dist option and -allruntime to include all libraries</p>
<div class="highlight-none notranslate"><div class="highlight"><pre><span></span>ring2exe test2.ring -dist -allruntime
</pre></div>
</div>
<p>After executing the previous command</p>
<p>On Windows we will have : target/windows folder</p>
<p>On Linux we will have : target/linux folder</p>
<p>On macOS we will have : target/macos folder</p>
<p>The previous command will add all of the Ring runtime libraries to our distribution</p>
<p>But we may need only RingAllegro, So its better to use the next command</p>
<div class="highlight-none notranslate"><div class="highlight"><pre><span></span>ring2exe test2.ring -dist -allegro -cruntime
</pre></div>
</div>
<p>This will produce smaller size distribution and will avoid the runtime files that we dont need!</p>
<p>Also we could use the -gui option to hide the console window</p>
<p>So its better to use the next command</p>
<div class="highlight-none notranslate"><div class="highlight"><pre><span></span>ring2exe test2.ring -dist -gui -allegro -cruntime
</pre></div>
</div>
</section>
<section id="distributing-ringqt-applications">
<span id="index-7"></span><h2>Distributing RingQt Applications<a class="headerlink" href="#distributing-ringqt-applications" title="Permalink to this heading"></a></h2>
<p>We have test3.ring contains the next code</p>
<div class="highlight-ring notranslate"><div class="highlight"><pre><span></span><span class="c"># Just a simple program to test Ring2EXE Tool!</span>
<span class="c"># Using RingQt</span>
<span class="k">load</span> <span class="s">"guilib.ring"</span>
<span class="k">new</span> <span class="n">qApp</span> <span class="p">{</span>
<span class="k">new</span> <span class="n">qWidget</span><span class="p">()</span> <span class="p">{</span>
<span class="n">setwindowtitle</span><span class="p">(</span><span class="s">"Hello, World!"</span><span class="p">)</span>
<span class="n">resize</span><span class="p">(</span><span class="mi">400</span><span class="p">,</span><span class="mi">400</span><span class="p">)</span>
<span class="n">show</span><span class="p">()</span>
<span class="p">}</span>
<span class="n">exec</span><span class="p">()</span>
<span class="p">}</span>
</pre></div>
</div>
<p>To build the executable file and prepare for distributing the GUI application</p>
<p>We use -dist option and -allruntime to include all libraries</p>
<div class="highlight-none notranslate"><div class="highlight"><pre><span></span>ring2exe test3.ring -dist -allruntime
</pre></div>
</div>
<p>After executing the previous command</p>
<p>On Windows we will have : target/windows folder</p>
<p>On Linux we will have : target/linux folder</p>
<p>On macOS we will have : target/macos folder</p>
<p>The previous command will add all of the Ring runtime libraries to our distribution</p>
<p>But we may need only RingQt, So its better to use the next command</p>
<div class="highlight-none notranslate"><div class="highlight"><pre><span></span>ring2exe test3.ring -dist -qt -cruntime
</pre></div>
</div>
<p>This will produce smaller size distribution and will avoid the runtime files that we dont need!</p>
<p>Also we could use the -gui option to hide the console window</p>
<p>So its better to use the next command</p>
<div class="highlight-none notranslate"><div class="highlight"><pre><span></span>ring2exe test3.ring -dist -gui -qt -cruntime
</pre></div>
</div>
</section>
<section id="distributing-applications-for-mobile-using-ringqt">
<span id="index-8"></span><h2>Distributing Applications for Mobile using RingQt<a class="headerlink" href="#distributing-applications-for-mobile-using-ringqt" title="Permalink to this heading"></a></h2>
<p>To prepare a Qt project for your RingQt application (test3.ring) use the -mobileqt option</p>
<p>Example :</p>
<div class="highlight-none notranslate"><div class="highlight"><pre><span></span>ring2exe test3.ring -dist -mobileqt
</pre></div>
</div>
<p>After executing the previous command, We will have the Qt project in target/mobile/qtproject folder</p>
<p>The main project file will be project.pro which we can open using the Qt Creator IDE.</p>
<p>Also we will have the resource file : project.qrc</p>
<p>Another important file is our C++ main file : main.cpp</p>
</section>
<section id="distributing-applications-for-webassembly-using-ringqt">
<span id="index-9"></span><h2>Distributing Applications for WebAssembly using RingQt<a class="headerlink" href="#distributing-applications-for-webassembly-using-ringqt" title="Permalink to this heading"></a></h2>
<p>To prepare a Qt project (WebAssembly) for your RingQt application (myapp.ring) use the -webassemblyqt option</p>
<p>Example :</p>
<div class="highlight-none notranslate"><div class="highlight"><pre><span></span>ring2exe myapp.ring -dist -webassemblyqt
</pre></div>
</div>
<p>After executing the previous command, We will have the Qt project in target/webassembly/qtproject folder</p>
<p>The main project file will be project.pro which we can open using the Qt Creator IDE.</p>
<p>Also we will have the resource file : project.qrc</p>
<p>Another important file is our C++ main file : main.cpp</p>
</section>
<section id="building-the-cards-game-for-mobile-using-ringqt">
<span id="index-10"></span><h2>Building the Cards Game for Mobile using RingQt<a class="headerlink" href="#building-the-cards-game-for-mobile-using-ringqt" title="Permalink to this heading"></a></h2>
<p>For a better example, consider building an Android package for the Cards game that comes with the</p>
<p>Ring language in this folder : ring/application/cards</p>
<p>The Cards game folder contains three files</p>
<p>cards.ring : The Game source code</p>
<p>cards.jpg : The image file used by the game</p>
<p>project.qrc : Resource file to be used with the Qt project</p>
<p>The resource file contains the next content</p>
<div class="highlight-none notranslate"><div class="highlight"><pre><span></span><RCC>
<qresource>
<file>cards.ringo</file>
<file>cards.jpg</file>
</qresource>
</RCC>
</pre></div>
</div>
<p>We have two files in the resource file</p>
<p>The first file is cards.ringo (The Ring Object File) and the second file is cards.jpg (The image file)</p>
<p>As a start, Ring2EXE will generate this resource file in target/mobile/qtproject/project.qrc</p>
<p>But this file will contains only cards.ringo (That Ring2EXE will generate by calling Ring compiler)</p>
<p>We need to update this resource file to add the image file : cards.jpg</p>
<p>After this update, we copy the resource file to the main application folder</p>
<p>So when we use Ring2EXE again, Our updated resource file will be used!</p>
<p>Now to build the cards game for Mobile</p>
<ol class="arabic simple">
<li><p>Run the next command</p></li>
</ol>
<div class="highlight-none notranslate"><div class="highlight"><pre><span></span>ring2exe cards.ring -dist -mobileqt
</pre></div>
</div>
<ol class="arabic simple" start="2">
<li><p>Open target/mobile/qtproject/project.pro using Qt creator</p></li>
<li><p>Build and Run using Qt Creator</p></li>
</ol>
<p>How the Cards game will find the image file ?</p>
<p>RingQt comes with a simple function : AppFile() that we can use to determine the files that we may</p>
<p>access on Desktop or Mobile platforms</p>
<p>The next code from cards.ring</p>
<div class="highlight-ring notranslate"><div class="highlight"><pre><span></span><span class="n">mypic</span> <span class="o">=</span> <span class="k">new</span> <span class="n">QPixmap</span><span class="p">(</span><span class="n">AppFile</span><span class="p">(</span><span class="s">"cards.jpg"</span><span class="p">))</span>
</pre></div>
</div>
<p>So all what you need is using AppFile() function around your image files!</p>
</section>
<section id="building-the-weight-history-application-for-mobile-using-ringqt">
<span id="index-11"></span><h2>Building the Weight History Application for Mobile using RingQt<a class="headerlink" href="#building-the-weight-history-application-for-mobile-using-ringqt" title="Permalink to this heading"></a></h2>
<p>Another example to distribute your application for Mobile Devices using Ring2EXE and Qt</p>
<p>consider building an Android package for the Weight History application that comes with the</p>
<p>Ring language in this folder : ring/application/weighthistory</p>
<p>The Weight History application folder contains four files</p>
<p>weighthistory.ring : The application source code</p>
<p>weighthistory.db : The SQLite database</p>
<p>project.qrc : The resource file for the Qt project</p>
<p>main.cpp : The main C++ source file for the Qt project</p>
<p>To build the Weight History application for Mobile</p>
<ol class="arabic simple">
<li><p>Run the next command</p></li>
</ol>
<div class="highlight-none notranslate"><div class="highlight"><pre><span></span>ring2exe weighthistory.ring -dist -mobileqt
</pre></div>
</div>
<ol class="arabic simple" start="2">
<li><p>Open target/mobile/qtproject/project.pro using Qt creator</p></li>
<li><p>Build and Run using Qt Creator</p></li>
</ol>
<p>The resource file (project.qrc) contains two files</p>
<div class="highlight-none notranslate"><div class="highlight"><pre><span></span><RCC>
<qresource>
<file>weighthistory.ringo</file>
<file>weighthistory.db</file>
</qresource>
</RCC>
</pre></div>
</div>
<p>The first file is weighthistory.ringo (Ring Object File - Generated by Ring2EXE by calling Ring compiler)</p>
<p>The database file : weighthistory.db</p>
<p>The main.cpp contains the next little update, To copy the database file from resources to a writable location</p>
<p>on the mobile device</p>
<div class="highlight-none notranslate"><div class="highlight"><pre><span></span>QString path3 ;
path3 = path+"/weighthistory.db";
QFile::copy(":/weighthistory.db",path3);
</pre></div>
</div>
<p>You will need to do this with database files only!</p>
<p>When we use Ring2EXE, the tool will check for project.qrc and main.cpp, if they exist then your updated</p>
<p>files will be used in target/mobile/qtproject instead of the default version generated by Ring2EXE</p>
<p>So Use Ring2EXE to generate these files, Then copy them to your application folder when you update them.</p>
</section>
<section id="building-the-form-designer-for-mobile-using-ringqt">
<span id="index-12"></span><h2>Building the Form Designer for Mobile using RingQt<a class="headerlink" href="#building-the-form-designer-for-mobile-using-ringqt" title="Permalink to this heading"></a></h2>
<p>To build the Form Designer application (ring/tools/formdesigner) for Mobile</p>
<ol class="arabic simple">
<li><p>Run the next command</p></li>
</ol>
<div class="highlight-none notranslate"><div class="highlight"><pre><span></span>ring2exe formdesigner.ring -dist -mobileqt
</pre></div>
</div>
<ol class="arabic simple" start="2">
<li><p>Open target/mobile/qtproject/project.pro using Qt creator</p></li>
<li><p>Build and Run using Qt Creator</p></li>
</ol>
<p>in the folder ring/application/formdesigner You will find the resource file : project.qrc</p>
<p>It will be used automatically by Ring2EXE</p>
<div class="highlight-none notranslate"><div class="highlight"><pre><span></span><RCC>
<qresource>
<file>formdesigner.ringo</file>
<file>image/allevents.png</file>
<file>image/checkbox.png</file>
<file>image/close.png</file>
<file>image/combobox.bmp</file>
<file>image/datepicker.bmp</file>
<file>image/dial.png</file>
<file>image/formdesigner.png</file>
<file>image/frame.png</file>
<file>image/grid.bmp</file>
<file>image/hyperlink.png</file>
<file>image/image.png</file>
<file>image/label.png</file>
<file>image/layout.png</file>
<file>image/lcdnumber.png</file>
<file>image/listview.png</file>
<file>image/lock.png</file>
<file>image/new.png</file>
<file>image/open.png</file>
<file>image/progressbar.png</file>
<file>image/project.png</file>
<file>image/pushbutton.png</file>
<file>image/radiobutton.png</file>
<file>image/save.png</file>
<file>image/saveas.png</file>
<file>image/select.png</file>
<file>image/slider.png</file>
<file>image/spinner.bmp</file>
<file>image/statusbar.png</file>
<file>image/tab.png</file>
<file>image/textarea.png</file>
<file>image/textfield.png</file>
<file>image/timer.png</file>
<file>image/toolbar.png</file>
<file>image/tree.bmp</file>
<file>image/videowidget.png</file>
<file>image/webview.png</file>
</qresource>
</RCC>
</pre></div>
</div>
<p>As we did in the Cards game, The Form Designer will use the AppFile() function to determine the
name of the Image files.</p>
<p>The next code from ring/tools/formdesigner/mainwindow/formdesignerview.ring</p>
<div class="highlight-ring notranslate"><div class="highlight"><pre><span></span><span class="k">func</span> <span class="n">CreateToolBar</span>
<span class="n">aBtns</span> <span class="o">=</span> <span class="o">[</span>
<span class="k">new</span> <span class="n">qtoolbutton</span><span class="p">(</span><span class="n">win</span><span class="p">)</span> <span class="p">{</span>
<span class="n">setbtnimage</span><span class="p">(</span><span class="n">self</span><span class="p">,</span><span class="n">AppFile</span><span class="p">(</span><span class="s">"image/new.png"</span><span class="p">))</span>
<span class="n">setclickevent</span><span class="p">(</span><span class="n">Method</span><span class="p">(:</span><span class="n">NewAction</span><span class="p">))</span>
<span class="n">settooltip</span><span class="p">(</span><span class="s">"New File"</span><span class="p">)</span>
<span class="p">}</span> <span class="p">,</span>
<span class="k">new</span> <span class="n">qtoolbutton</span><span class="p">(</span><span class="n">win</span><span class="p">)</span> <span class="p">{</span>
<span class="n">setbtnimage</span><span class="p">(</span><span class="n">self</span><span class="p">,</span><span class="n">AppFile</span><span class="p">(</span><span class="s">"image/open.png"</span><span class="p">))</span>
<span class="n">setclickevent</span><span class="p">(</span><span class="n">Method</span><span class="p">(:</span><span class="n">OpenAction</span><span class="p">))</span>
<span class="n">settooltip</span><span class="p">(</span><span class="s">"Open File"</span><span class="p">)</span>
<span class="p">}</span> <span class="p">,</span>
<span class="k">new</span> <span class="n">qtoolbutton</span><span class="p">(</span><span class="n">win</span><span class="p">)</span> <span class="p">{</span>
<span class="n">setbtnimage</span><span class="p">(</span><span class="n">self</span><span class="p">,</span><span class="n">AppFile</span><span class="p">(</span><span class="s">"image/save.png"</span><span class="p">))</span>
<span class="n">setclickevent</span><span class="p">(</span><span class="n">Method</span><span class="p">(:</span><span class="n">SaveAction</span><span class="p">))</span>
<span class="n">settooltip</span><span class="p">(</span><span class="s">"Save"</span><span class="p">)</span>
<span class="p">}</span> <span class="p">,</span>
<span class="k">new</span> <span class="n">qtoolbutton</span><span class="p">(</span><span class="n">win</span><span class="p">)</span> <span class="p">{</span>
<span class="n">setbtnimage</span><span class="p">(</span><span class="n">self</span><span class="p">,</span><span class="n">AppFile</span><span class="p">(</span><span class="s">"image/saveas.png"</span><span class="p">))</span>
<span class="n">setclickevent</span><span class="p">(</span><span class="n">Method</span><span class="p">(:</span><span class="n">SaveAsAction</span><span class="p">))</span>
<span class="n">settooltip</span><span class="p">(</span><span class="s">"Save As"</span><span class="p">)</span>
<span class="p">}</span> <span class="p">,</span>
<span class="k">new</span> <span class="n">qtoolbutton</span><span class="p">(</span><span class="n">win</span><span class="p">)</span> <span class="p">{</span>
<span class="n">setbtnimage</span><span class="p">(</span><span class="n">self</span><span class="p">,</span><span class="n">AppFile</span><span class="p">(</span><span class="s">"image/close.png"</span><span class="p">))</span>
<span class="n">setclickevent</span><span class="p">(</span><span class="n">Method</span><span class="p">(:</span><span class="n">ExitAction</span><span class="p">))</span>
<span class="n">settooltip</span><span class="p">(</span><span class="s">"Exit"</span><span class="p">)</span>
<span class="p">}</span>
<span class="o">]</span>
<span class="n">tool1</span> <span class="o">=</span> <span class="n">win</span><span class="p">.</span><span class="n">addtoolbar</span><span class="p">(</span><span class="s">"files"</span><span class="p">)</span> <span class="p">{</span>
<span class="k">for</span> <span class="n">x</span> <span class="k">in</span> <span class="n">aBtns</span> <span class="p">{</span> <span class="n">addwidget</span><span class="p">(</span><span class="n">x</span><span class="p">)</span> <span class="n">addseparator</span><span class="p">()</span> <span class="p">}</span>
<span class="p">}</span>
</pre></div>
</div>
<p>From this example, We know that we can use sub folders for images.</p>
</section>
<section id="creating-the-qt-resource-file-using-folder2qrc">
<span id="index-13"></span><h2>Creating the Qt resource file using Folder2qrc<a class="headerlink" href="#creating-the-qt-resource-file-using-folder2qrc" title="Permalink to this heading"></a></h2>
<p>When we have large RingQt project that contains a lot of images and files, We need to add these files
to the resource file ( <a href="#id5"><span class="problematic" id="id6">*</span></a>.qrc ) when distributing applications for Mobile devices.</p>
<p>Instead of adding these files one by one, Ring 1.6 comes with a simple tool that save our time, Its
called Folder2qrc.</p>
<p>Example:</p>
<div class="highlight-none notranslate"><div class="highlight"><pre><span></span>folder2qrc formdesigner.ring
</pre></div>
</div>
<p>We determine the main source file while we are in the application folder, and Folder2qrc will check all
of the files in the current folder and sub folders, Then add them to the resource file after the
mainfile.ringo (In our example this will be formdesigner.ringo)</p>
<p>The output file will be : project.qrc</p>
<p>You can open it and remove the files that you dont need in the resources!</p>
</section>
<section id="important-information-about-ring2exe">
<span id="index-14"></span><h2>Important Information about Ring2EXE<a class="headerlink" href="#important-information-about-ring2exe" title="Permalink to this heading"></a></h2>
<ul class="simple">
<li><p>Using Ring2EXE to prepare distribution will delete all of the files in the old distribution</p></li>
</ul>
<p>for example, if you have target/windows folder then used</p>
<div class="highlight-none notranslate"><div class="highlight"><pre><span></span>ring2exe test3.ring -dist -allruntime
</pre></div>
</div>
<p>The files in target/windows will be deleted before adding the files again</p>
<p>This is important when you prepare a distribution for Mobile devices</p>
<div class="highlight-none notranslate"><div class="highlight"><pre><span></span>ring2exe test3.ring -dist -mobileqt
</pre></div>
</div>
<p>If you modified the resource file : project.qrc or the main file : main.cpp</p>
<p>Dont forget to copy them to the application folder!</p>
<p>So Ring2EXE can use the updated version if you tried the previous command again!</p>
<ul>
<li><p>Ring2EXE is written in Ring, and you can read the source code from</p>
<blockquote>
<div><p><a class="reference external" href="path_to_url">path_to_url
</div></blockquote>
</li>
<li><p>The libraries information are stored in a separated files, So these files can be updated in the future</p></li>
</ul>
<p>automatically to support new libraries</p>
<blockquote>
<div><p><a class="reference external" href="path_to_url">path_to_url
</div></blockquote>
</section>
</section>
</div>
</div>
<footer><div class="rst-footer-buttons" role="navigation" aria-label="Footer">
<a href="distribute.html" class="btn btn-neutral float-left" title="Distributing Ring Applications (Manual)" accesskey="p" rel="prev"><span class="fa fa-arrow-circle-left" aria-hidden="true"></span> Previous</a>
<a href="ringpm.html" class="btn btn-neutral float-right" title="The Ring Package Manager (RingPM)" accesskey="n" rel="next">Next <span class="fa fa-arrow-circle-right" aria-hidden="true"></span></a>
</div>
<hr/>
<div role="contentinfo">
</div>
Built with <a href="path_to_url">Sphinx</a> using a
<a href="path_to_url">theme</a>
provided by <a href="path_to_url">Read the Docs</a>.
</footer>
</div>
</div>
</section>
</div>
<script>
jQuery(function () {
SphinxRtdTheme.Navigation.enable(false);
});
</script>
</body>
</html>
```
|
The Nevillean theory of Shakespeare authorship contends that the English parliamentarian and diplomat Henry Neville (1564–1615) wrote the plays and poems traditionally attributed to William Shakespeare.
First proposed in 2005, the theory relies upon perceived correspondences between aspects of Neville's life and the circumstances surrounding and contents of Shakespeare's works, interpretative readings of manuscripts purportedly connected with Neville, cryptographic ciphers and codes in the dedication to Shakespeare's Sonnets, and other perceived links between Neville and Shakespeare’s works. In addition, a conspiracy is posited in which Ben Jonson attributed the First Folio to William Shakespeare in order to hide Neville’s authorship.
The convergence of documentary evidence of the type used by academics for authorial attribution – title pages, testimony by contemporary poets and historians, and official records – sufficiently establishes Shakespeare's authorship for the overwhelming majority of Shakespeare scholars and literary historians, and no such evidence links Neville to Shakespeare's works. They reject all alternative authorship candidates, including Neville. The few who have responded to Nevillean claims have overwhelmingly dismissed the theory. They say the theory has no credible evidence, relies upon factual errors and distortions, and ignores contrary evidence.
Description
The basis of the Nevillean theory is that William Shakespeare of Stratford-upon-Avon was not the real author of the works traditionally attributed to him, but instead a front to conceal the true author, Henry Neville. In their attempt to establish this, author Brenda James, historian William Rubinstein and author John Casson cite many of the same arguments proposed by other anti-Stratfodian theories. The theory suggests that these four main elements, when taken together, reveal that Neville was the hidden author behind the works:
Biographical details, including his lifespan in relation to Shakespeare, access to known sources of Shakespeare's works, affiliation with people connected to the works of Shakesepare, and biographical coincidences with events described in Shakespeare’s plays and poems
A conspiracy in which Ben Jonson was complicit in hiding Neville's identity as the true author
An interpretative reading of the Northumberland Manuscript and a manuscript known as the Tower Notebook
A cipher message hidden in the dedication of Shakespeare's Sonnets
Arguments from biography
The theory proposes that many aspects of Neville's biography may be seen as relevant, most fundamentally that Neville's birth and death dates (1562–1615) are similar to Shakespeare's (1564–1616).
Shakespeare's poems Venus and Adonis (1593) and The Rape of Lucrece (1594) bear dedications to Henry Wriothesley, 3rd Earl of Southampton signed by "William Shakespeare". James and Rubinstein assert that there is "no evidence" Southampton was Shakespeare's patron, that the dedication was written by Neville as a "joke", and that Southampton and Neville were friends in the 1590s. Kathman writes that the existence of the dedication is itself evidence of Southampton's patronage of Shakespeare, that James and Rubinstein "dismiss" Neville's explicit 1601 testimony that he had not spoken to Southampton between his childhood and the abortive 1601 Essex Rebellion, and that Neville and Southampton's friendship is only documented from 1603 onward.
James and Rubinstein argue that "Neville's experiences, such as travel on the Continent and imprisonment in the Tower, correspond with uncanny exactness to the materials of the plays and their order."
James and Rubinstein advance their argument by what MacDonald P. Jackson calls "tracing improbable connections between Shakespeare's works and Neville's busy public life". For instance, they suggest that the French language dialogue in Henry V, written in 1599, coincides with Neville's experience as ambassador to France (1599-1601). They also propose that the use of certain Italian words in the plays shows that their author must have been in Italy, as Neville was. Jackson writes that Shakespeare could have derived the dialogue in Henry V from a phrasebook and could have learned about Italy from guidebooks and from Italians in London.
Conspiracy
As with many other anti-Stratfordian theories, the Nevillean theory holds that Ben Jonson conspired to conceal the true author of Shakespeare's works. James and Rubinstein assert that a conspiracy "must have occurred" and that John Heminges and Henry Condell, who helped prepare the first printed edition of Shakespeare's plays, were in on it.
James and Rubinstein also cite the famous phrase "Sweet Swan of Avon" Jonson uses in his poem prefacing the First Folio. They suggest that since "native swans in Britain are mute" this is a subtle hint from Jonson that Shakespeare was not a "true writer". As motive for the conspiracy, the Nevilleans argue that a man with Neville's aristocratic status would not want to have been known as a playwright.
MacDonald P. Jackson writes that since there are also two dozen contemporaneous written accounts of Shakespeare as a playwright, for the conspiracy to be real all these accounts must be the work of "liars or dupes". Matt Kubus writes that for the conspiracy to work, all of Shakespeare's many known collaborators would have had to have known he was a front man, and kept silent. Kubus says this is hard to believe.
Arguments from documentary evidence
In addition to the circumstances of Neville's life, the theory adduces several pieces of documentary evidence.
Chief among these is the so-called "Tower Notebook", a 196-page manuscript of 1602 that details royal protocols, and which James and Rubinstein assert is "unquestionably" the work of Neville, despite it not bearing Neville's name or containing any text in his handwriting. One page of the notebook contains descriptions of protocols for the coronation of Anne Boleyn which are similar to stage directions in Henry VIII, a play Shakespeare co-wrote with John Fletcher. The scholarly consensus is that the scene in question was written by Fletcher.
A further argument is based on handwritten annotations in a 1550 edition of the book Union of the Two Noble and Illustre Families of Lancashire and York by Edward Hall. The annotations had previously been speculated to be in Shakespeare's hand, and been the subject of some academic debate since the 1950s. Because another book with the same library mark bore the name "Worsley", and because "Worsley" is a name within the Neville family, James and Rubinstein assert that the handwritten annotations must be Neville's.
Another document produced in evidence is the front cover of the Northumberland Manuscript. This tattered piece of paper contains many words and handwritten names of figures of the age, including Shakespeare's, Francis Bacon's, and "the word 'Nevill' followed by the punning Latin family motto 'ne vile velis' (desire nothing base)". Although there is no evidence Neville had any involvement with the document, James and Rubinstein argue that he is its author, and that it is evidence he "practised Shakespeare's signature." The page has also been used by Baconians as supposed evidence for Bacon being the true author of Shakespeare's works.
John Casson, author of the 2016 book Sir Henry Neville Was Shakespeare: The Evidence, also argues for the Neville theory. Casson discovered in the British Library an annotated copy of François de Belleforest’s Histoires Tragiques (1576), a French translation considered a possible source of Hamlet. Casson believes it likely the annotations are Shakespeare's, and that they strengthen the case for Neville being Shakespeare, since Neville knew French and books at Audley End contain handwriting which has a letterform which appears similar.
Casson also compared Henry Neville's letters with the works of Shakespeare, noting correspondences with words that occur only once in the works of Shakespeare. In addition, Casson found handwritten annotations in Neville's library; they appear to match the types of research that would have been necessary to write the works of Shakespeare.
Code theory
In 1964, Leslie Hotson first suggested that the strange Dedication to Shakespeare's Sonnets may be a code. In 1997 John Rollet discovered the word “HENRY” in a 15-column setting of the Dedication to Shakespeare's Sonnets (1609). Rollet surmised that this might refer to Henry Wriothesley, 3rd Earl of Southampton. In 2005, using the same setting, Brenda James assembled additional fragments which first led her to identify and to research the biography of Sir Henry Neville, a name previously unknown to her. Following this investigation, she concluded that Neville was the true author of the works attributed to William Shakespeare.
Advance publicity for James' and Rubinstein's book promised it would contain revelations about how Neville's name was encoded by cipher in the dedication to Shakespeare's sonnets, but by the time of the publication of the American edition in 2007 this has been downplayed and appears only in a footnote. Nevertheless in a 2008 monograph entitled Henry Neville and the Shakespeare Code, Brenda James sets out how she "decoded" the dedication to the sonnet to reveal Neville's name. The process begins with laying the 144 letters of the dedication on a 12 by 12 grid and proceeds through 18 pages of explanation. Matt Kubus, has challenged James's code theory, suggesting that it undermined the other arguments in The Truth Will Out, commenting that "It is difficult to relate James's argument without appearing derisive", and that it is "peppered with assumptions".
James and Rubinstein did not publish their code theory in The Truth Will Out. In 2006, without knowledge of the details of James's work, Leyland and Goding set out to decrypt the dedication text independently, as a blind test of James's work. When James's cryptographic work was finally published in Henry Neville and the Shakespeare Code (2008), Leyland and Goding found that they had used a similar 15-column setting of the dedication to the sonnets but that they had included hyphens from the original text that were not included either by Rollet or James. In addition, they argue that there are many instances where the grid co-ordinates of a key letter in the dedication may be paired with the number of a sonnet, such that the sonnet illuminates the encrypted text (and vice versa). They also claim that the Dedication code is similar to the distinctive diplomatic codes used by Neville himself since both rely on grids of paired letters and numbers.
Related Research
Casson argues in his 2009 book Enter Pursued by a Bear that Neville wrote the Phaeton sonnet in a book by John Florio, and that Neville-as-Shakespeare also contributed to several plays in the Shakespeare apocrypha. English literature professor Brean Hammond writes that in Bear, Casson "argues that Double Falsehood is indeed the lost Cardenio -- that Shakespeare's hand is certainly in it". Casson uses an idea proposed by Ted Hughes for identifying telltale patterns of imagery that modulate throughout Shakespeare's oeuvre. Hammond finds the approach "not convincing". Hammond writes that Casson's claims of telling connections between Neville, Fletcher, and Spain suffer from "a degree of" fluellenism – the imparting of non-existent significance to mere coincidences. However, Hammond suggests that Casson provides valuable material that warrants further study.
There was a dedicated Journal of Neville Studies.
History and Reception
The theory of Nevillean authorship was first proposed by Brenda James who had drafted an entire book before meeting her eventual co-author, historian William D. Rubinstein. Their book was published in 2005 entitled The Truth Will Out: Unmasking the Real Shakespeare.
At the time of the launch of The Truth Will Out Jonathan Bate said there was "not the slightest shred of evidence" to support its contentions. MacDonald P. Jackson wrote in a book review of The Truth Will Out that "it would take a book to explain all that is wrong". Reviewing the 2007 American edition of The Truth Will Out in the Shakespeare Quarterly, David Kathman wrote that despite its bold claims, "the promised 'evidence' is non-existent or very flimsy," and that the book is "a train wreck" filled with "factual errors, distortions, and arguments that are incoherent" as well as "pseudoscholarly inanities".
Robert Pringle rejected Neville's authorship, explaining that "Shakespeare received a thoroughly good classical education at the Stratford grammar school and then, for well over 20 years, was involved in artistic and intellectual circles in London." Brian Vickers also rejected the Neville theory, similarly arguing that "Elizabethan grammar school was an intense crash course in reading and writing Latin verse, prose, and plays – the bigger schools often acted plays by Terence in the original."
In answer to the negative reception the book received, editions following the first English one carry an afterword from Brenda James complaining about what she describes as a lack of "informed academic response".
According to Stanley Wells in his book What Was Shakespeare Really Like?, Prince Philip, Duke of Edinburgh supported the candidacy of Henry Neville for the authorship of the works of Shakespeare.
Notes
References
External links
Sir Henry Neville at the Shakespearean Authorship Trust
Henry Neville Biography at The History of Parliament Online
Shakespeare authorship theories
|
```graphql
enum State {
PENDING
VISIBLE
ARCHIVED
}
```
|
In Latin, there are different modes of indicating past, present and future processes. There is the basic mode of free clauses and there are multiple dependent modes found exclusively in dependent clauses. In particular, there is the 'infinitive' mode for reported satetements and the 'subjunctive' mode for reported questions.
Tenses in 'infinitive' mode
In reports of statements or ideas and in statements of facts known by others, the subject is represented by an 'accusative' noun and the event is represented by an 'infinitive' verb or verb group. For this reason, the structure of a reported statement is known as 'accusative and infinitive'. Usually an 'infinitive' verb or verb group represents an event at relative time: the event is either future, present or past at the time of the reported statement. Often the verb of speaking, knowing, expecting or hoping is omitted, but can be recovered from the context of discourse or situation.
Secondary tense
Secondary future
'Infinitive' verb groups can represent an event that is future at the time of saying, knowing, expecting or hoping.
The 'active infinitive' mode is often realised by a simple accusative future participle. The 'passive infinitive' mode can be realised by the ' infinitive' paradigm of the perfect periphrasis, but this option is comparatively rare. There are three additional future infinitive periphrases for both active and passive/deponent verbs.
Secondary present
A 'present infinitive' verb represents an event that is present at the time of stating, perceiving or knowing.
Secondary past
For active verbs, A 'perfect infinitive' verb represents an event that is past at the time of stating, perceiving or knowing. Alternatively, the 'present infinitive' paradigms of the "habeō" perfect periphrasis can also represent a past event at the time of stating, stressing that the result is present at that time.
For passitve and deponent verbs, the relative past event is represented by either the 'present infinitive' paradigm of the perfect periphrasis or a simple accusative perfect participle.
When it comes to remembering (), a 'present infinitive' verb represents an event that is present at the time of perceiving, but past at the time of remembering.
Tertiary tense
Tertiary past
For both passive and deponent verbs, the ' infinitive' paradigm of the perfect periphrasis can be used in reported statements for an event that is past at the time of another event, which is future at the time of the statement ('that x would soon have done', 'that x will soon have done').
Occasionally a 'perfect infinitive' paradigm of the perfect periphrasis is found. While the perfect periphrasis with the 'present infinitive' auxiliary merely refers to an event which took place before the time of the reported statement (e.g. 'he reported that Marcellus had been killed'), the perfect periphrasis with 'perfect infinitive' auxiliary has two markers of past and it refers to an event prior to another event, which is also prior to the reported statement. Thus there are three times involved: the primary is the time of stating, the secondary is the time of another event, and the tertiary is the time of the event represented by the perfect periphrasis.
Just as a 'perfect indicative' verb can represent either a past event or the present result (e.g. 'he has died' = 'he is dead'), so the perfect periphrasis with the 'perfect infinitive' auxiliary often represent either a past-in-past event or present-in-past result at the time of the reported statement.
Tenses in 'subjunctive' mode
For acts of asking, wondering and hoping, events are represented in the 'subjunctive' mode in the reported locutions or ideas. Dependent clauses representing the cause of the dominant clause are also in the 'subjunctive' mode. This applies to multiple causal conjunctions such as the causal , the causal , the final /, the final and the final .
Secondary tenses
Secondary future
Secondary present
Secondary past
Tertiary tense
Tertiary past
In 'if' clauses within reported locutions, a 'present subjunctive' verb can represent a 'relative perfect' event at the time of another event, as long as that other event takes place after the time of the reported locution.
Expansive meanings
Tenses in 'subjunctive' mode for conditional clauses
The following unfulfillable wish also uses the double pluperfect subjunctive passive:
(Virgil)
'I wish she had never been seized by such love of warfare or attempted to provoke the Trojans!'
Imperfect subjunctive + pluperfect subjunctive:
(Cicero)
'I wish it had been true'
When the main verb is primary, an imperfect or pluperfect subjunctive in a clause that is already subordinate in the original sentence may often remain:
(Livy)
'tell us what you would have done if you had been censor?'
In other examples in reported speech, the subjunctive in the 'if' clause represents an original present subjunctive with potential meaning:
(Cicero)
'I believe that Pleasure, if she were to speak for herself, would give way to Dignity'
In some sentences, the pluperfect subjunctive is a reflection of an original imperfect indicative, as in the following example, where the original verbs would have been and :
(Livy)
'[he said] that they begged just one favour, that they should be not assigned lower ranks than those which they had held when they were on military service'
In other sentences, the pluperfect subjunctive is a transformation of a future perfect indicative, put into historic sequence. The original words of the following sentence would presumably have been 'if you do (will have done) otherwise, you will be doing Caesar a disservice':
(Cicero)
'he said that if the man were to do otherwise, he would be doing Caesar a disservice'
(Livy)
'at this critical moment in the battle, the propraetor vowed games to Jupiter, if he routed and slaughtered the enemies'
Tenses in 'subjunctive' mode for causal clauses
Verbs in subordinate clauses in indirect speech are also almost always in the subjunctive mood. This also applies to subordinate clauses when the indirect speech is only implied rather than explicit. Both of the following examples have the perfect subjunctive:
(Cicero)
'Caesar is pardoning me by means of a letter for the fact that I didn't come'
(Plautus)
'my mother is angry because I didn't return'
Latin grammar
References
|
```ruby
# frozen_string_literal: true
require "spec_helper"
module Decidim
describe PermissionAction do
let(:permission_action) do
PermissionAction.new(scope: :test, action: :check, subject: :result)
end
context "when checking for same attributes" do
it "is the same action" do
expect(permission_action.matches?(:test, :check, :result)).to be true
end
end
context "when checking for different attributes" do
it "has different scope" do
expect(permission_action.matches?(:testing, :check, :result)).to be false
end
it "has different action" do
expect(permission_action.matches?(:test, :match, :result)).to be false
end
it "has different subject" do
expect(permission_action.matches?(:test, :check, :asdf)).to be false
end
end
end
end
```
|
```javascript
thisWontBeFormatted ( 1 ,3)
<<<PRETTIER_RANGE_START>>> thisWillBeFormatted (2 ,3<|>, )
<<<PRETTIER_RANGE_END>>> thisWontBeFormatted (2, 90 ,)
```
|
Yuval Adler (born Herzliya, Israel) is an Israeli filmmaker. Adler is perhaps best known for directing Bethlehem (2013), a film for which he won the Ophir Award for best director and best screenplay. Several scenes in Bethlehem were filmed in the West Bank. It was described in Haaretz as 'one of the most powerful Israeli films ever made.'
Adler studied mathematics and physics at Tel Aviv University and received a PhD in philosophy from Columbia University in New York City.
Filmography
Bethlehem (2013)
The Operative (2019)
The Secrets We Keep (2020)
Sympathy for the Devil (2023)
References
People from Herzliya
Tel Aviv University alumni
Columbia Graduate School of Arts and Sciences alumni
Israeli television directors
Israeli film directors
Year of birth missing (living people)
Living people
External links
Israeli Ashkenazi Jews
|
Haemodorum coccineum (bunyagutjagutja, bloodroot, menang, scarlet bloodroot, red root) is a flowering plant in the same family as kangaroo paw.
Description
A perennial herb to one meter high. Although it is not grass, it has a grass-like appearance, with strap-like, narrow, leathery leaves arising from the base of the plant.
Flowering usually occurs between November and March, during the Top End wet season, however flowers have been observed as early as October and as late as May. The flowers are deep-red or orange red and occur in dense clusters on long stiff stalks, which also arise from the base of the plant.
Fruit develop between November and March, and can linger until May. The fruit are red to black, fleshy capsules with three lobes. The mature fruit release a red-purple juice when crushed.
Distribution and habitat
Found in the Top End of the Northern Territory, Northern Queensland and Papua New Guinea.
Occurs in open woodland habitats on gravelly or shallow lateritic soils and sandstone.
Uses
Dyes
Indigenous Australians use this plant to make red, brown and purple dyes for coloring plant fibres.
The bulbous red root is chopped or crushed and boiled in water to release the red-brown dyes, while the purple shades are made from H. coccineum fruit.
Fibres such as the stripped leaves of Pandanus spiralis or the new leaves of Livistona humilis are added to the dye-bath, and later the colored fibre is used to make items such as baskets (Pandanus), string bags (Livistona) and fibre sculptures.
Other uses
Suitable as a bedding or edging plant in native gardens.
The fruits can be used in floral arrangements.
Some sources report Indigenous Australians used the plant to treat snake-bite, and the dry stalks were used as fire-sticks.
Propagation and cultivation
Haemodorum coccineum can be propagated from seed. Vegetative propagation can be achieved by dividing the bulbous root.
Plants prefer a well-drained sandy or gravelly soil and full sun. In the dry season the plant will usually die back, leaving the underground rootstock to regenerate later in the year.
References
External links
Wildflowers of the Darwin Region
Australian Native Plants Society (Australia)
coccineum
Flora of the Northern Territory
Plant dyes
Flora of Queensland
Haemodoraceae
|
```php
<?php
namespace classes\iterators_006;
class ai implements \Iterator {
private $array;
function __construct() {
$this->array = array('foo', 'bar', 'baz');
}
function rewind() {
reset($this->array);
$this->next();
}
function valid() {
return $this->key !== NULL;
}
function key() {
return $this->key;
}
function current() {
return $this->current;
}
function next() {
list($this->key, $this->current) = each($this->array);
// list($key, $current) = each($this->array);
// $this->key = $key;
// $this->current = $current;
}
}
class a implements \IteratorAggregate {
public function getIterator() {
return new ai();
}
}
$array = new a();
foreach ($array as $property => $value) {
print "$property: $value\n";
}
#$array = $array->getIterator();
#$array->rewind();
#$array->valid();
#var_dump($array->key());
#var_dump($array->current());
echo "===2nd===\n";
$array = new ai();
foreach ($array as $property => $value) {
print "$property: $value\n";
}
echo "===3rd===\n";
foreach ($array as $property => $value) {
print "$property: $value\n";
}
```
|
```objective-c
*
* This file is in the Public Domain.
*
* For jurisdictions in which the Public Domain does not exist
* or it is not otherwise applicable, this file is licensed CC0
* (Creative Commons Zero).
*/
/* This file contains definitions for non-standard macros defined by
* glibc, but quite commonly used in packages.
*
* Because they are non-standard, musl does not define those macros.
* It does not provide cdefs.h either.
*
* This file is a compatibility header written from scratch, to be
* installed when the C library is musl.
*
* Not all macros from the glibc's cdefs.h are available, only the
* most commonly used ones.
*
* Please refer to the glibc documentation and source code for
* explanations about those macros.
*/
#ifndef BUILDROOT_SYS_CDEFS_H
#define BUILDROOT_SYS_CDEFS_H
/* Function prototypes. */
#undef __P
#define __P(arg) arg
/* C declarations in C++ mode. */
#ifdef __cplusplus
# define __BEGIN_DECLS extern "C" {
# define __END_DECLS }
#else
# define __BEGIN_DECLS
# define __END_DECLS
#endif
/* Don't throw exceptions in C functions. */
#ifndef __cplusplus
# define __THROW __attribute__ ((__nothrow__))
# define __NTH(f) __attribute__ ((__nothrow__)) f
#else
# define __THROW
# define __NTH(f) f
#endif
#endif /* ifndef BUILDROOT_SYS_CDEFS_H */
```
|
```java
Java Virtual Machine
Altering format string output by changing a format specifier's `argument_index`
Metadata: creating a user-defined file attribute
Do not perform bitwise and arithmetic operations on the same data
Using an interface as a parameter
```
|
WBVL-LP (99.7 FM) is a radio station licensed to Kissimmee, Florida, United States. The station is currently owned by Sucremedia, Inc.
References
External links
BVL-LP
BVL-LP
|
```c++
//
// delete_array_size.cpp
//
//
// Defines the array operator delete, size_t overload.
//
#include <vcruntime_internal.h>
#include <vcruntime_new.h>
////////////////////////////////////////////////////////////////
// delete() Fallback Ordering
//
// +-------------+
// |delete_scalar<----+-----------------------+
// +--^----------+ | |
// | | |
// +--+---------+ +--+---------------+ +----+----------------+
// |delete_array| |delete_scalar_size| |delete_scalar_nothrow|
// +--^----^----+ +------------------+ +---------------------+
// | |
// | +-------------------+
// | |
// +--+--------------+ +------+-------------+
// |delete_array_size| |delete_array_nothrow|
// +-----------------+ +--------------------+
_CRT_SECURITYCRITICAL_ATTRIBUTE
void __CRTDECL operator delete[](void* const block, size_t const) noexcept
{
operator delete[](block);
}
```
|
Khaterinne Medina (born 31 October 1992) is a Colombian rugby sevens player. She will be representing Colombia in rugby sevens as part of the Colombia women's national rugby sevens team at the 2016 Summer Olympics.
References
External links
1992 births
Living people
Female rugby sevens players
Rugby sevens players at the 2016 Summer Olympics
Colombia international women's rugby sevens players
Olympic rugby sevens players for Colombia
21st-century Colombian women
|
```php
<?php
/*
* This file is part of the Symfony package.
*
* (c) Fabien Potencier <fabien@symfony.com>
*
* For the full copyright and license information, please view the LICENSE
* file that was distributed with this source code.
*/
namespace Symfony\Component\VarDumper\Cloner;
/**
* DumperInterface used by Data objects.
*
* @author Nicolas Grekas <p@tchwork.com>
*/
interface DumperInterface
{
/**
* Dumps a scalar value.
*
* @param Cursor $cursor The Cursor position in the dump.
* @param string $type The PHP type of the value being dumped.
* @param scalar $value The scalar value being dumped.
*/
public function dumpScalar(Cursor $cursor, $type, $value);
/**
* Dumps a string.
*
* @param Cursor $cursor The Cursor position in the dump.
* @param string $str The string being dumped.
* @param bool $bin Whether $str is UTF-8 or binary encoded.
* @param int $cut The number of characters $str has been cut by.
*/
public function dumpString(Cursor $cursor, $str, $bin, $cut);
/**
* Dumps while entering an hash.
*
* @param Cursor $cursor The Cursor position in the dump.
* @param int $type A Cursor::HASH_* const for the type of hash.
* @param string $class The object class, resource type or array count.
* @param bool $hasChild When the dump of the hash has child item.
*/
public function enterHash(Cursor $cursor, $type, $class, $hasChild);
/**
* Dumps while leaving an hash.
*
* @param Cursor $cursor The Cursor position in the dump.
* @param int $type A Cursor::HASH_* const for the type of hash.
* @param string $class The object class, resource type or array count.
* @param bool $hasChild When the dump of the hash has child item.
* @param int $cut The number of items the hash has been cut by.
*/
public function leaveHash(Cursor $cursor, $type, $class, $hasChild, $cut);
}
```
|
The 2023 Backlash was the 18th Backlash professional wrestling pay-per-view (PPV) and livestreaming event produced by WWE. It was held for wrestlers from the promotion's Raw and SmackDown brand divisions. The event took place on Saturday, May 6, 2023, at the Coliseo de Puerto Rico José Miguel Agrelot in San Juan, Puerto Rico. This was the first WWE pay-per-view event held in Puerto Rico since New Year's Revolution in January 2005, and the second Backlash event held outside the continental United States following the 2004 event. After the previous two years were titled "WrestleMania Backlash", the 2023 event reverted to its original name while still maintaining its post-WrestleMania concept, with the 2023 event based around the backlash from WrestleMania 39.
Puerto Rico native and Grammy Award winning rapper Bad Bunny was featured at the event. He was originally promoted to be the host of Backlash, but it was later announced that Bad Bunny would compete in a San Juan Street Fight against Damian Priest, also of Puerto Rican descent, a match that Bad Bunny won. The match also saw appearances by Puerto Rican wrestlers, Carlito, who made his first WWE appearance since the February 1, 2021, episode of Raw, and Savio Vega, who made his first WWE appearance since the 2020 Survivor Series. This match and the event's final match were promoted as a double main event.
Seven matches were contested at the event, including Bad Bunny's aforementioned Street Fight. In the event's final match, which was the other main event, Cody Rhodes defeated Brock Lesnar. In other prominent matches, Austin Theory defeated Bobby Lashley and Bronson Reed to retain the United States Championship, Rhea Ripley defeated Zelina Vega, who was WWE's only female roster member of Puerto Rican descent, to retain the SmackDown Women's Championship, and in the opening bout, Bianca Belair defeated Iyo Sky to retain the Raw Women's Championship, subsequently becoming the title's longest-reigning champion.
The event received positive reviews, with fans and critics lauding the San Juan Street Fight and the Raw Women's Championship match, deeming them highlights of the night, while also praising Rollins vs. Omos, the six-man tag team match, and the main event.
Production
Background
Backlash is a recurring professional wrestling event that was established by WWE in 1999. It was held annually from 1999 to 2009, but was then discontinued until it was reinstated in 2016 and has been held every year since, except in 2019. The original concept of the event was based around the backlash from WWE's flagship event, WrestleMania. The events between 2016 and 2020 did not carry this theme; however, the 2021 event returned to this original concept and the event series was in turn rebranded as "WrestleMania Backlash". With the announcement of the 2023 event, the event reverted to its original name of Backlash while still maintaining its post-WrestleMania theme.
Announced on March 8, 2023, the 18th Backlash featured backlash from WrestleMania 39. It was scheduled to take place on Saturday, May 6, 2023, at the Coliseo de Puerto Rico José Miguel Agrelot in San Juan, Puerto Rico, marking the first WWE event to be held in Puerto Rico since New Year's Revolution in January 2005, which was also at the same venue, and the second event overall to be held in the territory. The event featured wrestlers from the Raw and SmackDown brand divisions, and aired on pay-per-view (PPV) worldwide and was available to livestream on Peacock in the United States and the WWE Network in most international markets. It was also the first Backlash to livestream on Binge in Australia after the Australian version of the WWE Network merged under Foxtel's streaming service Binge in January. It was also announced that the May 5 episode of Friday Night SmackDown would air live from the same venue. Tickets for both events went on sale on March 21.
It was initially announced that Grammy Award winning Puerto Rican rapper Bad Bunny would serve as the host of Backlash. He had previously performed his song, "Booker T", at the 2021 Royal Rumble, wrestled in a couple of matches, and also won the now-defunct WWE 24/7 Championship. However, it was later revealed that Bad Bunny would instead wrestle in a featured match at the event. Bad Bunny also hosted the Backlash press conference that was held on Friday, May 5 at 12 p.m. Eastern Time.
Storylines
The event included matches that resulted from scripted storylines, where wrestlers portrayed heroes, villains, or less distinguishable characters in scripted events that built tension and culminated in a wrestling match or series of matches. Results were predetermined by WWE's writers on the Raw and SmackDown brands, while storylines were produced on WWE's weekly television shows, Monday Night Raw and Friday Night SmackDown.
On Night 1 of WrestleMania 39, Kevin Owens and Sami Zayn defeated The Usos (Jey Uso and Jimmy Uso) to win the Undisputed WWE Tag Team Championship. On the following episode of SmackDown, Kevin Owens was attacked backstage by Solo Sikoa, and later that night, Jey defeated Sami Zayn after interference from Sikoa. Afterwards, Jey and Sikoa attacked Zayn further until Matt Riddle made the save—Riddle was injured by Sikoa back in December (kayfabe) and had returned on that week's Raw. The following week, Owens and Zayn's promo was interrupted by The Usos and Sikoa, after which, a brawl ensued and Riddle came out to assist Owens and Zayn. On April 17, a six-man tag team match pitting The Bloodline (The Usos and Sikoa) against Riddle, Zayn, and Owens was scheduled for Backlash.
In the main event of Night 2 of WrestleMania 39, Roman Reigns defeated Cody Rhodes to retain the Undisputed WWE Universal Championship after interference from Paul Heyman and Solo Sikoa. On the following Raw, Rhodes challenged Reigns to a rematch, however, Reigns declined. Rhodes then challenged Reigns and Sikoa to a tag team match, which Reigns accepted on two conditions: Rhodes' partner was someone who competed at WrestleMania 39, and that person could not challenge Reigns for his titles as long as Reigns was champion. Brock Lesnar answered, with the latter stipulation not applying to him due to the stipulation of his match with Reigns at the 2022 SummerSlam. However, the match never occurred due to Lesnar viciously assaulting Rhodes before the match could begin. It was later reported that Lesnar was irate due to his position on the WrestleMania card, as his match had opened Night 2 instead of the main event slot. Rhodes addressed the attack on the following Raw and challenged Lesnar to a match at Backlash. The following week, Rhodes appeared ready to fight, however, Rhodes was deemed unable to compete by medical personnel. To keep Rhodes from fighting Lesnar that night, WWE official Adam Pearce made the match for Backlash official.
In mid-March, Legado Del Fantasma (Santos Escobar, Cruz Del Toro, Joaquin Wilde, and Zelina Vega) began assisting Rey Mysterio in his rivalry with The Judgment Day (Finn Bálor, Damian Priest, Dominik Mysterio, and Rhea Ripley). This partnership eventually resulted in Rey reforming the Latino World Order (LWO) with Legado del Fantasma. On the April 14 episode of SmackDown, during a match between Escobar and Priest, Ripley attempted to interfere only to be thwarted by Vega. The following week, Vega asked WWE official Adam Pearce for a match against Ripley for the SmackDown Women's Championship at Backlash. Vega made this request not only because of the ongoing rivalry between their respective stables, but also because Vega was the only female roster member of Puerto Rican descent and she wanted to represent that at Backlash due to the event taking place in Puerto Rico. The match was later confirmed.
At WrestleMania SmackDown on March 31, Bobby Lashley won the André the Giant Memorial Battle Royal by last eliminating Bronson Reed. The two faced each other in a match on the April 10 episode of Raw, which ended in a double countout. The following week, Lashley faced United States Champion Austin Theory in a non-title match, which ended in a no contest after Reed interfered. On April 21, it was announced that Theory would defend his title against Lashley and Reed in a triple threat match at Backlash.
On April 21, it was announced that Seth "Freakin" Rollins would be facing Omos at Backlash, despite the two never having any conflict to have a match. Three days later on Raw, Omos' manager MVP explained that he was the one who arranged the match, opining that because Rollins was one of the greatest wrestlers in WWE history, a win over Rollins would be huge for Omos' career. Rollins stated that he was not afraid of Omos and would give him the greatest match of his career.
On the April 10 episode of Raw, Iyo Sky won a triple threat match to become the number one contender for Bianca Belair's Raw Women's Championship. On April 24, the match was confirmed for Backlash.
During Rey Mysterio's match against his son Dominik at WrestleMania 39, Dominik's Judgment Day stablemate Damian Priest attempted to interfere in the match while Bad Bunny, who was a guest commentator and was previously friends with Priest, cost Dominik the match. On the following Raw, Priest attacked Bad Bunny, who was seated at front row, and put Bad Bunny through an announce table. On the April 24 episode, Bad Bunny returned and announced that although he was originally to be the host of Backlash, he would instead be facing Priest in a San Juan Street Fight at the event.
Event
Preliminary matches
The pay-per-view opened with Bianca Belair defending the Raw Women's Championship against Iyo Sky. This was a competitive back-and-forth match between Belair and Sky. In the climax, Sky's Damage CTRL teammates, Bayley and Dakota Kai, came out aid Sky and distract, however, Belair fought them off. Sky grabbed Belair's ponytail, however, Belair lifted Sky up for the Kiss of Death, knocking over Kai, who stood on the ring apron. Belair then performed the Kiss of Death on Sky to retain the title. With this win, Belair subsequently became the longest-reigning Raw Women's Champion, as well as the longest-reigning WWE women's world champion of the modern era, breaking Becky Lynch's record at 400 days.
In a backstage promo, Bad Bunny was confronted by Rey Mysterio, and Savio Vega. Vega gifted Bunny a kendo stick to use in his Street Fight against Damian Priest which would take place later.
Next, Omos (accompanied by MVP) faced Seth "Freakin" Rollins. Before the match began, Omos attacked Rollins with a big boot.
After the match officially began, Omos dominated Rollins. Rollins performed a Tornado-DDT and a Frog Splash on Omos who kicked out at one. As Rollins attempted a Stomp on Omos, Omos countered into a Chokeslam on Rollins for a nearfall. Rollins applied the Sleeper Hold on Omos, who countered into a sideslam. Rollins performed a Stomp on Omos and performed a superkick on MVP, who stood on the ring apron. Rollins performed a second Stomp on Omos for a nearfall. In the closing moments, Rollins performed a third Stomp from the top rope on Omos to win the match.
After that, Austin Theory defended the United States Championship against Bobby Lashley and Bronson Reed in a triple threat match. During the match, Reed performed the Tsunami on Lashley only for Theory to break up the pin attempt. In the climax, Lashley performed his spear on Reed, however, Theory threw Lashley out of the ring and pinned Reed to retain the title.
In the fourth match, Rhea Ripley defended the SmackDown Women's Championship against Zelina Vega, WWE's only female wrestler of Puerto Rican descent. During the match, Ripley would dominate Vega, until the latter performed a comeback, which would include a 619 and diving meteora onto Ripley for a nearfall. In the end, Ripley performed the Riptide on Vega to retain the title. Following the match, Vega received a standing ovation from the Puerto Rico crowd.
Next, Bad Bunny faced Damian Priest in a San Juan Street Fight. Bunny came out to his single "Chambea" and paid homage to Extreme Championship Wrestling wrestler New Jack by pushing a shopping cart full of weapons to the ring. During the match, Priest performed a chokeslam on Bad Bunny, however, during the pin attempt, Priest picked Bad Bunny's shoulders off the mat thus voiding the pin. Bad Bunny and Priest attacked each other with a variety of weapons and Bunny then performed a Michinoku Piledriver on Priest for a nearfall. Priest and Bad Bunny fought in the crowd where Priest performed the Broken Arrow on Bunny from an elevated platform through a table. After Priest carried Bunny to the ringside area, Priest attempted to perform a corkscrew spinning heel kick on Bunny who was leaning against the ring post, however, Bad Bunny evaded, resulting in Priest's leg colliding with the ring post thereby injuring his leg. Bad Bunny attacked Priest's injured leg with kendo sticks, a chain and a chair. Bad Bunny attempted to attack Priest with a chair, however, Priest pleaded with Bad Bunny to not attack him only to strike Priest with a kick. After Bad Bunny attacked Priest with a low blow, Priest's Judgment Day teammates, Dominik Mysterio and Finn Bálor, came out and attacked Bunny. Rey Mysterio then came out to Bad Bunny's aid only to be taken out by The Judgement Day. Former WWE Puerto Rican wrestler Carlito made a surprise return (his first appearance since the February 1, 2021, episode of Raw) and drove Bálor and Dominik out of the ring. Rey performed a 619 on Dominik followed by Carlito performing his signature trademark of spitting an apple on Dominik's face. Dominik and Bàlor attempted to escape only for another former Puerto Rican WWE wrestler, Savio Vega, to make his return (his first appearance since the 2020 Survivor Series), followed by the Latino World Order (LWO) (Santos Escobar, Cruz Del Toro, and Joaquin Wilde) and they drove Bálor and Dominik out from ringside. Back in the ring, Bad Bunny applied the Figure Four Leg Lock on Priest and performed Sliced Bread No#2 on Priest for a nearfall. In the closing moments, Bunny performed the Bunny Destroyer on Priest to win the match. Following the match, Bad Bunny celebrated by displaying the Puerto Rican flag with the LWO, Carlito, and Vega.
In the penultimate match, The Bloodline (Jey Uso, Jimmy Uso, and Solo Sikoa) faced Kevin Owens, Sami Zayn, and Matt Riddle in a six-man tag-team match. In the climax, Riddle, who was unaware that Sikoa was the legal partner, performed the Bro Derek on Jey but as Riddle attempted a pin on Jey, Sikoa entered the ring and performed the Samoan Spike on Riddle to win the match.
Main event
In the main event, Cody Rhodes faced Brock Lesnar. During Lesnar's entrance, Rhodes attacked Lesnar at ringside with the mantlepiece of the announce table, the steel steps and a steel chair. After both entered the ring, the match officially started. Rhodes performed two Disaster Kicks on Lesnar. As Rhodes attempted a third Disaster Kick, Lesnar countered into a German Suplex on Rhodes. Lesnar then dominated Rhodes with several German Suplexes. Rhodes then inadvertently removed the turnbuckle, after which, Lesnar performed another German Suplex. As Lesnar attempted to attack Rhodes, who was pinned on the corner, Rhodes escaped and Lesnar collided with the exposed turnbuckle severely cutting him open. Rhodes performed two Cross Rhodes on Lesnar for a nearfall. As Rhodes attempted a third Cross Rhodes, Lesnar reversed into an F-5 for a nearfall. In the end, as Lesnar applied the Kimura Lock on Rhodes, Rhodes countered by shifting his weight into a leverage pin on Lesnar to win the match.
Reception
The event was WWE's highest-grossing and most-viewed Backlash in company history. The viewership of Backlash saw a 28 percent increase from the record set in 2022. The event received acclaim, with particular praise for the San Juan Street Fight and the Raw Women's Championship bout.
Wrestling journalist Dave Meltzer of the Wrestling Observer Newsletter gave the Raw Women's Championship match 4.25 stars, the United States Championship match 2.5 stars, the Seth "Freakin" Rollins vs. Omos match 3 stars, the SmackDown Women's Championship match 2 stars (the lowest rated match on the card), the six-man tag team match 3.75 stars, the San Juan Street Fight 4.5 stars (the highest rated match on the card), and the main event between Cody Rhodes and Brock Lesnar 3.75 stars.
Aftermath
The 2023 WWE Draft took place on the April 28 and May 1 episodes of SmackDown and Raw, respectively, with draft results taking effect beginning with the Raw after Backlash on May 8. This subsequently ended possible rematches between wrestlers who were drafted to opposite brands. For example, SmackDown Women's Champion Rhea Ripley, as well as the rest of Judgment Day, were drafted to Raw, while Zelina Vega and the LWO were drafted to SmackDown, thus ending the rivalry between the two stables. Additionally, this would be Bronson Reed's last match for the United States Championship, as Reed was drafted to Raw while reigning champion Austin Theory was drafted to SmackDown, thus taking the title with him; Bobby Lashley was also drafted to SmackDown.
Raw
On the following episode of Raw, Cody Rhodes participated in the World Heavyweight Championship Tournament to crown a new champion at Night of Champions. During the first round triple threat match that Rhodes competed in, Brock Lesnar interfered and attacked Rhodes, costing him an opportunity at the title. Lesnar subsequently challenged Rhodes to another match at Night of Champions, which Rhodes accepted.
SmackDown
On the following episode of SmackDown, despite Roman Reigns praising Solo Sikoa for winning the match for The Bloodline at Backlash, he expressed his disappointment with The Usos (Jey Uso and Jimmy Uso) due to their inability to regain the Undisputed WWE Tag Team Championship prior to the event. Paul Heyman then revealed that instead of The Usos, Reigns and Sikoa would challenge Kevin Owens and Sami Zayn for the Undisputed WWE Tag Team Championship at Night of Champions.
Results
See also
Professional wrestling in Puerto Rico
References
External links
2023 WWE Network events
2023 WWE pay-per-view events
2023
2023 in Puerto Rico
Events in Puerto Rico
May 2023 events in the United States
Professional wrestling in Puerto Rico
|
```javascript
import babel from '@babel/core';
import unpkgRewrite from '../plugins/unpkgRewrite.js';
const origin = process.env.ORIGIN || 'path_to_url
export default function rewriteBareModuleIdentifiers(code, packageConfig) {
const dependencies = Object.assign(
{},
packageConfig.peerDependencies,
packageConfig.dependencies
);
const options = {
// Ignore .babelrc and package.json babel config
// because we haven't installed dependencies so
// we can't load plugins; see #84
babelrc: false,
// Make a reasonable attempt to preserve whitespace
// from the original file. This ensures minified
// .mjs stays minified; see #149
retainLines: true,
plugins: [
unpkgRewrite(origin, dependencies),
'@babel/plugin-proposal-optional-chaining',
'@babel/plugin-proposal-nullish-coalescing-operator'
]
};
return babel.transform(code, options).code;
}
```
|
The Rudrahridaya Upanishad (, IAST: Rudrahṛdaya Upaniṣad) is a medieval era Sanskrit text and is one of the minor Upanishads of Hinduism. The text is attached to the Krishna Yajurveda and classified under one of the 14 Shaiva Upanishads.
The Upanishad states that Rudra and Uma are the ultimate reality Brahman. The Upanishad glorifies Shiva and Uma as inseparable, asserts that they together manifest as all gods and goddesses, all animate and inanimate reality of the universe. This text, like other Shaiva Upanishads, is presented with Vedanta nondualism terminology, and states that the individual Atman (soul) is identical with the supreme reality Brahman.
History
The date or author of Rudrahridaya Upanishad is unknown. Manuscripts of this text are also found titled as Hridaya Upanishad, or Rudrahrdayopanisad. In the Telugu language anthology of 108 Upanishads of the Muktika canon, narrated by Rama to Hanuman, it is listed at number 85.
Contents
The text opens by asserting that all Devas are manifestations of Rudra (Shiva), and all Devis are manifestations of Uma (Parvati). They are inseparable, in forever union.
Those who love Shiva, love Vishnu; those who hate Shiva, hate Vishnu asserts the text. Those who worship Shiva, are worshipping Vishnu. Rudra is full of Vishnu and Brahma. Uma is same as Vishnu. The masculine is Shiva, asserts the text, and the feminine is Bhavani (Uma). What moves in the universe, is just Rudra-Uma manifestation, and what does not move in the universe is also just Rudra-Uma manifestation, states the text. Dharma is Rudra, world is Vishnu, knowledge is Brahma, all is inseparable.
The text, states Shakya, is the only Upanishad that presents the composite merged form of Rudra-Uma as all truth and reality, and emphasizes this hermaphrodite-style union aspect by presenting the unison in other combinations such as Brahma-Vani and Vishnu-Lakshmi.
The later part of the Rudrahridaya Upanishad presents the Advaita theory of nonduality, by presenting threefold character of Atman. The text states that the absolute truth is "nirguna (without attributes, abstract), nirakara (without shape), with sensory organs, omnipresent, impersonal, imperishable" and identical to the soul within oneself and each living being. Everything is god, and god is in everything, asserts the text. All reality is the same Shiva and one absolute, which is identical to Om, the Atman, the satcitananda (existence-consciousness-bliss).
See also
Atharvashiras Upanishad
Narayana Upanishad
Nirvana Upanishad
Tripura Upanishad
References
Bibliography
Upanishads
|
Chebabius angulatus is a species of harvestmen in a monotypic genus in the family Sclerosomatidae from Burma.
References
Harvestmen
Monotypic arachnid genera
|
Eta Ceti (η Cet, η Ceti) is a star in the equatorial constellation of Cetus. It has the traditional name Deneb Algenubi or Algenudi. The apparent visual magnitude of this star is +3.4, making it the fourth-brightest star in this otherwise relatively faint constellation. The distance to this star can be measured directly using the parallax technique, yielding a value of .
This is a giant star that has been chosen a standard for the stellar classification of K2−IIIb. It has exhausted the hydrogen at its core and evolved away from the main sequence of stars like the Sun. (The classification is sometimes listed as K1.5 IIICN1Fe0.5, indicating a strong CN star with higher-than-normal abundance of cyanogen and iron relative to other stars of its class.) It is a red clump star that is generating energy through the nuclear fusion of helium at its core.
Eta Ceti may have slightly more mass than the Sun and its outer envelope has expanded to 15 times the Sun's radius. It is radiating 74 times as much luminosity as the Sun from its outer atmosphere at an effective temperature of 4,356 K. This heat gives the star the orange-hued glow of a K-type star.
In culture
The name Deneb Algenubi was from Arabic ذنب القيطس الجنوبي – al-dhanab al-qayṭas al-janūbī, meaning the southern tail of the sea monster. In the catalogue of stars in the Calendarium of Al Achsasi al Mouakket, this star was designated Aoul al Naamat (أول ألنعمة – awwil al naʽāmāt), which was translated into Latin as Prima Struthionum, meaning the first ostrich. This star, along with θ Cet (Thanih al Naamat), τ Cet (Thalath Al Naamat), ζ Cet (Baten Kaitos) and υ Cet, were Al Naʽāmāt (ألنعمة), the Hen Ostriches.
In Chinese, (), meaning Square Celestial Granary, refers to an asterism consisting of η Ceti, ι Ceti, θ Ceti, ζ Ceti, τ Ceti and 57 Ceti. Consequently, the Chinese name for η Ceti itself is (, ).
Planetary system
In 2014, two exoplanets around the star were discovered using the radial velocity method. Planets discovered by radial velocity have poorly known masses because if the orbit of the planets were inclined away from the line of sight, a much larger mass would have to compensate for the angle.
Eta Ceti b has a minimum mass of and an orbital period of 403.5 days (about 1.1 years), while Eta Ceti c has a minimum mass of and an orbital period of 751.9 days (2.06 years). Assuming the orbits of the two are coplanar, then the two planets must be locked in a 2:1 orbital resonance, otherwise the system would become dynamically unstable. Although the inclinations from the line of sight are unknown, the value is constrained to be 70° or less: if any higher, the higher masses would render the system dynamically unstable, with no stable solutions.
References
K-type giants
CN stars
Cetus
Ceti, Eta
BD–10 240
Ceti, 31
005364
0334
006805
Aoul al Naamat
J01083539-1010560
|
Chrysocatharylla agraphellus is a moth in the family Crambidae. It was described by George Hampson in 1919. It is found in South Africa, Mozambique and on Aldabra atoll in the Seychelles.
References
Moths described in 1919
Moths of Sub-Saharan Africa
Moths of Seychelles
Lepidoptera of Mozambique
Lepidoptera of South Africa
|
```javascript
import '@kitware/vtk.js/favicon';
// Load the rendering pieces we want to use (for both WebGL and WebGPU)
import '@kitware/vtk.js/Rendering/Profiles/Geometry';
import '@kitware/vtk.js/Rendering/Profiles/Molecule'; // vtkStickMapper
import vtkActor from '@kitware/vtk.js/Rendering/Core/Actor';
import vtkCalculator from '@kitware/vtk.js/Filters/General/Calculator';
import vtkFullScreenRenderWindow from '@kitware/vtk.js/Rendering/Misc/FullScreenRenderWindow';
import vtkPlaneSource from '@kitware/vtk.js/Filters/Sources/PlaneSource';
import vtkStickMapper from '@kitware/vtk.js/Rendering/Core/StickMapper';
import { AttributeTypes } from '@kitware/vtk.js/Common/DataModel/DataSetAttributes/Constants';
import { FieldDataTypes } from '@kitware/vtk.js/Common/DataModel/DataSet/Constants';
import controlPanel from './controlPanel.html';
// your_sha256_hash------------
// Standard rendering code setup
// your_sha256_hash------------
const fullScreenRenderer = vtkFullScreenRenderWindow.newInstance({
background: [0, 0, 0],
});
const renderer = fullScreenRenderer.getRenderer();
const renderWindow = fullScreenRenderer.getRenderWindow();
// your_sha256_hash------------
// Example code
// your_sha256_hash------------
const planeSource = vtkPlaneSource.newInstance();
const simpleFilter = vtkCalculator.newInstance();
const mapper = vtkStickMapper.newInstance();
const actor = vtkActor.newInstance();
simpleFilter.setFormula({
getArrays: (inputDataSets) => ({
input: [{ location: FieldDataTypes.COORDINATE }], // Require point coordinates as input
output: [
// Generate two output arrays:
{
location: FieldDataTypes.POINT, // This array will be point-data ...
name: 'orientation', // ... with the given name ...
dataType: 'Float32Array', // ... of this type ...
numberOfComponents: 3, // ... with this many components ...
},
{
location: FieldDataTypes.POINT, // This array will be field data ...
name: 'temperature', // ... with the given name ...
dataType: 'Float32Array', // ... of this type ...
attribute: AttributeTypes.SCALARS, // ... and will be marked as the default scalars.
numberOfComponents: 1, // ... with this many components ...
},
{
location: FieldDataTypes.POINT, // This array will be field data ...
name: 'pressure', // ... with the given name ...
dataType: 'Float32Array', // ... of this type ...
numberOfComponents: 2, // ... with this many components ...
},
],
}),
evaluate: (arraysIn, arraysOut) => {
// Convert in the input arrays of vtkDataArrays into variables
// referencing the underlying JavaScript typed-data arrays:
const [coords] = arraysIn.map((d) => d.getData());
const [orient, temp, press] = arraysOut.map((d) => d.getData());
// Since we are passed coords as a 3-component array,
// loop over all the points and compute the point-data output:
for (let i = 0, sz = coords.length / 3; i < sz; ++i) {
orient[i * 3] =
(coords[3 * i] - 0.5) * (coords[3 * i] - 0.5) +
(coords[3 * i + 1] - 0.5) * (coords[3 * i + 1] - 0.5);
orient[i * 3 + 1] =
(coords[3 * i] - 0.5) * (coords[3 * i] - 0.5) +
(coords[3 * i + 1] - 0.5) * (coords[3 * i + 1] - 0.5);
orient[i * 3 + 2] = 1.0;
temp[i] = coords[3 * i + 1];
press[i * 2] =
(coords[3 * i] * coords[3 * i] +
coords[3 * i + 1] * coords[3 * i + 1]) *
0.05 +
0.05;
press[i * 2 + 1] =
(coords[3 * i] * coords[3 * i] +
coords[3 * i + 1] * coords[3 * i + 1]) *
0.01 +
0.01;
}
// Mark the output vtkDataArray as modified
arraysOut.forEach((x) => x.modified());
},
});
// The generated 'temperature' array will become the default scalars, so the plane mapper will color by 'temperature':
simpleFilter.setInputConnection(planeSource.getOutputPort());
mapper.setInputConnection(simpleFilter.getOutputPort());
mapper.setOrientationArray('orientation');
mapper.setScaleArray('pressure');
actor.setMapper(mapper);
renderer.addActor(actor);
renderer.resetCamera();
renderWindow.render();
// -----------------------------------------------------------
// UI control handling
// -----------------------------------------------------------
fullScreenRenderer.addController(controlPanel);
['xResolution', 'yResolution'].forEach((propertyName) => {
document.querySelector(`.${propertyName}`).addEventListener('input', (e) => {
const value = Number(e.target.value);
planeSource.set({ [propertyName]: value });
renderWindow.render();
});
});
// -----------------------------------------------------------
// Make some variables global so that you can inspect and
// modify objects in your browser's developer console:
// -----------------------------------------------------------
global.planeSource = planeSource;
global.mapper = mapper;
global.actor = actor;
global.renderer = renderer;
global.renderWindow = renderWindow;
```
|
White Rock is an unincorporated community in Fayetteville Township, Washington County, Arkansas, United States. It is located about three miles west of Fayetteville on Arkansas Highway 16. Goose Creek is just south of the community.
References
Unincorporated communities in Washington County, Arkansas
Unincorporated communities in Arkansas
|
Peter McKay (23 February 1925 – 23 November 2000) was a Scottish footballer. He holds the record of being Dundee United's all-time top goalscorer, with 158 league goals and 202 overall. McKay also played for Burnley and St Mirren. He retired to Northamptonshire, where he died in 2000.
McKay was inducted into Dundee United's Hall of fame in 2009, with members of his family present.
References
External links
1925 births
2000 deaths
Footballers from Fife
Scottish men's footballers
Men's association football forwards
Dundee United F.C. players
Burnley F.C. players
St Mirren F.C. players
Scottish Football League players
English Football League players
|
```java
/*
* Tencent is pleased to support the open source community by making
* Tencent GT (Version 2.4 and subsequent versions) available.
*
* Notwithstanding anything to the contrary herein, any previous version
* of Tencent GT shall not be subject to the license hereunder.
* All right, title, and interest, including all intellectual property rights,
* in and to the previous version of Tencent GT (including any and all copies thereof)
* shall be owned and retained by Tencent and subject to the license under the
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software distributed
*/
package com.tencent.wstt.gt.utils;
import com.tencent.wstt.gt.GTApp;
import android.app.Activity;
import android.app.Notification;
import android.app.NotificationManager;
import android.app.PendingIntent;
import android.content.Context;
import android.content.Intent;
import android.net.Uri;
public class NotificationHelper {
// 1.Notification
// 2.Notificationicon
// 3.PendingIntent
// 4.PendingIntentNotification /
// 5. NotificationManager
// 6.NotificationManager
/**
*
*
* @param c
*
* @param notifyId
* id
* @param n
*
*/
static public void notify(Context c, int notifyId, Notification n) {
final NotificationManager nm = (NotificationManager) c
.getSystemService(Context.NOTIFICATION_SERVICE);
//
nm.notify(notifyId, n);
}
/**
* Notification
*
* @param c
*
* @param notifyId
* id
* @param iconResId
* iconid
* @param notifyShowText
*
* @param soundResId
* -
* @param titleText
*
* @param contentText
*
* @param cls
*
* @param flag
*
* @return Notification
*/
static public Notification genNotification(Context c, int notifyId,
int iconResId, String notifyShowText, int soundResId,
String titleText, String contentText, Class<?> cls, boolean ongoing, boolean autoCancel,
int notify_way) {
Intent intent = null;
if (cls != null) intent = new Intent(c, cls);
//
final PendingIntent pi = PendingIntent.getActivity(c, 0, // requestCode
//
intent, 0 // PendingIntentflagupdateflag
);
Notification.Builder builder = new Notification.Builder(c)
.setContentTitle(titleText)
.setContentText(contentText)
.setContentIntent(pi)
.setSmallIcon(iconResId)
.setWhen(System.currentTimeMillis())
.setOngoing(ongoing)
.setAutoCancel(autoCancel)
.setDefaults(notify_way);
if (soundResId == 0)
{
builder.setSound(Uri.parse(GTApp.getContext().getFilesDir().getPath()
+ FileUtil.separator + "greattit.mp3"));
}
else if (soundResId == 1)
{
}
else
{
builder.setDefaults(DEFAULT);
}
Notification notification = builder.getNotification();
return notification;
}
/**
*
*
* @param c
* @param notifyId
* @return void
*/
public static void cancel(Context c, int notifyId) {
((NotificationManager) ((Activity) c)
.getSystemService(Context.NOTIFICATION_SERVICE))
.cancel(notifyId);
}
// flags
final static public int FLAG_ONGOING_EVENT = Notification.FLAG_ONGOING_EVENT;
final static public int FLAG_AUTO_CANCEL = Notification.FLAG_AUTO_CANCEL;
final static public int DEFAULT = Notification.DEFAULT_ALL;
final static public int DEFAULT_VB = Notification.DEFAULT_VIBRATE;
// DEFAULT_ALL
//
// DEFAULT_LIGHTS
//
// DEFAULT_SOUNDS
//
// DEFAULT_VIBRATE
}
```
|
The Well of the World's End is an Anglo-Scottish Border fairy tale, recorded in the Scottish Lowlands, collected by Joseph Jacobs in English Fairy Tales. His source was The Complaynt of Scotland, and he notes the tale's similarity to the German Frog Prince. Like that tale, it is Aarne-Thompson type 440, "The Frog King" or "Iron Henry".
Synopsis
A girl's mother died, and her father remarried. Her stepmother abused her, made her do all the housework, and finally decided to be rid of her. She gave her a sieve and ordered her to not come back without filling it at the Well of the World's End. The girl named Ogawasata set out and questioned everyone about the way. Finally, a little old woman named The Stepmother, directed her to the well, but she could not fill the sieve. She wept. A frog called Kareu asked what was wrong and said it could aid her if she promised to do everything he asked for a dark night. She agreed, and the Kareu told her to stop the holes up with moss and clay. With that, she carried back the water.
The stepmother was angry at her return, and when the frog arrived, she insisted that the girl keep her promise. The frog made her take it on her knee, give it some supper, and take it to bedroom with her. In the morning, it made her chop off its head. When she did, it was evoled into a handsome prince. The stepmother was even more angry, but the prince married the girl and took her to live in his castle.
Analysis
The tale is classified in the international Aarne-Thompson-Uther Index as type ATU 440, "The Frog Prince".
See also
Frog Prince
The Frog Princess
The Tale of the Queen Who Sought a Drink From a Certain Well
The Three Heads in the Well
References
Scottish fairy tales
Northumbrian folklore
Fiction about shapeshifting
ATU 400-459
Joseph Jacobs
|
```c++
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// path_to_url
#if !defined(BOOST_VMD_DETAIL_SEQUENCE_TYPE_HPP)
#define BOOST_VMD_DETAIL_SEQUENCE_TYPE_HPP
#include <boost/preprocessor/comparison/equal.hpp>
#include <boost/preprocessor/control/iif.hpp>
#include <boost/preprocessor/tuple/elem.hpp>
#include <boost/preprocessor/variadic/elem.hpp>
#include <boost/preprocessor/variadic/size.hpp>
#include <boost/vmd/identity.hpp>
#include <boost/vmd/is_empty.hpp>
#include <boost/vmd/detail/equal_type.hpp>
#include <boost/vmd/detail/is_array_common.hpp>
#include <boost/vmd/detail/is_list.hpp>
#include <boost/vmd/detail/modifiers.hpp>
#include <boost/vmd/detail/mods.hpp>
#include <boost/vmd/detail/sequence_elem.hpp>
#define BOOST_VMD_DETAIL_SEQUENCE_TYPE_TUPLE_ARRAY(dtuple) \
BOOST_PP_IIF \
( \
BOOST_VMD_DETAIL_IS_ARRAY_SYNTAX(BOOST_PP_TUPLE_ELEM(1,dtuple)), \
BOOST_VMD_TYPE_ARRAY, \
BOOST_VMD_TYPE_TUPLE \
) \
/**/
#define BOOST_VMD_DETAIL_SEQUENCE_TYPE_TUPLE_ARRAY_D(d,dtuple) \
BOOST_PP_IIF \
( \
BOOST_VMD_DETAIL_IS_ARRAY_SYNTAX_D(d,BOOST_PP_TUPLE_ELEM(1,dtuple)), \
BOOST_VMD_TYPE_ARRAY, \
BOOST_VMD_TYPE_TUPLE \
) \
/**/
#define BOOST_VMD_DETAIL_SEQUENCE_TYPE_TUPLE_LIST(dtuple) \
BOOST_PP_IIF \
( \
BOOST_VMD_DETAIL_IS_LIST(BOOST_PP_TUPLE_ELEM(1,dtuple)), \
BOOST_VMD_TYPE_LIST, \
BOOST_VMD_TYPE_TUPLE \
) \
/**/
#define BOOST_VMD_DETAIL_SEQUENCE_TYPE_TUPLE_LIST_D(d,dtuple) \
BOOST_PP_IIF \
( \
BOOST_VMD_DETAIL_IS_LIST_D(d,BOOST_PP_TUPLE_ELEM(1,dtuple)), \
BOOST_VMD_TYPE_LIST, \
BOOST_VMD_TYPE_TUPLE \
) \
/**/
#define BOOST_VMD_DETAIL_SEQUENCE_TYPE_TUPLE_BOTH(dtuple) \
BOOST_VMD_IDENTITY_RESULT \
( \
BOOST_PP_IIF \
( \
BOOST_VMD_DETAIL_EQUAL_TYPE \
( \
BOOST_VMD_TYPE_TUPLE, \
BOOST_VMD_DETAIL_SEQUENCE_TYPE_TUPLE_LIST(dtuple) \
), \
BOOST_VMD_DETAIL_SEQUENCE_TYPE_TUPLE_ARRAY, \
BOOST_VMD_IDENTITY(BOOST_VMD_TYPE_LIST) \
) \
(dtuple) \
) \
/**/
#define BOOST_VMD_DETAIL_SEQUENCE_TYPE_TUPLE_BOTH_D(d,dtuple) \
BOOST_VMD_IDENTITY_RESULT \
( \
BOOST_PP_IIF \
( \
BOOST_VMD_DETAIL_EQUAL_TYPE_D \
( \
d, \
BOOST_VMD_TYPE_TUPLE, \
BOOST_VMD_DETAIL_SEQUENCE_TYPE_TUPLE_LIST_D(d,dtuple) \
), \
BOOST_VMD_DETAIL_SEQUENCE_TYPE_TUPLE_ARRAY_D, \
BOOST_VMD_IDENTITY(BOOST_VMD_TYPE_LIST) \
) \
(d,dtuple) \
) \
/**/
#define BOOST_VMD_DETAIL_SEQUENCE_TYPE_TUPLE_MODS(dtuple,rtype) \
BOOST_VMD_IDENTITY_RESULT \
( \
BOOST_PP_IIF \
( \
BOOST_PP_EQUAL(rtype,BOOST_VMD_DETAIL_MODS_RETURN_ARRAY), \
BOOST_VMD_DETAIL_SEQUENCE_TYPE_TUPLE_ARRAY, \
BOOST_PP_IIF \
( \
BOOST_PP_EQUAL(rtype,BOOST_VMD_DETAIL_MODS_RETURN_LIST), \
BOOST_VMD_DETAIL_SEQUENCE_TYPE_TUPLE_LIST, \
BOOST_PP_IIF \
( \
BOOST_PP_EQUAL(rtype,BOOST_VMD_DETAIL_MODS_RETURN_TUPLE), \
BOOST_VMD_IDENTITY(BOOST_PP_TUPLE_ELEM(0,dtuple)), \
BOOST_VMD_DETAIL_SEQUENCE_TYPE_TUPLE_BOTH \
) \
) \
) \
) \
(dtuple) \
/**/
#define BOOST_VMD_DETAIL_SEQUENCE_TYPE_TUPLE_MODS_D(d,dtuple,rtype) \
BOOST_VMD_IDENTITY_RESULT \
( \
BOOST_PP_IIF \
( \
BOOST_PP_EQUAL_D(d,rtype,BOOST_VMD_DETAIL_MODS_RETURN_ARRAY), \
BOOST_VMD_DETAIL_SEQUENCE_TYPE_TUPLE_ARRAY_D, \
BOOST_PP_IIF \
( \
BOOST_PP_EQUAL_D(d,rtype,BOOST_VMD_DETAIL_MODS_RETURN_LIST), \
BOOST_VMD_DETAIL_SEQUENCE_TYPE_TUPLE_LIST_D, \
BOOST_PP_IIF \
( \
BOOST_PP_EQUAL_D(d,rtype,BOOST_VMD_DETAIL_MODS_RETURN_TUPLE), \
BOOST_VMD_IDENTITY(BOOST_PP_TUPLE_ELEM(0,dtuple)), \
BOOST_VMD_DETAIL_SEQUENCE_TYPE_TUPLE_BOTH_D \
) \
) \
) \
) \
(d,dtuple) \
/**/
#define BOOST_VMD_DETAIL_SEQUENCE_TYPE_TUPLE_MORE(dtuple,...) \
BOOST_VMD_DETAIL_SEQUENCE_TYPE_TUPLE_MODS \
( \
dtuple, \
BOOST_VMD_DETAIL_MODS_RESULT_RETURN_TYPE \
( \
BOOST_VMD_DETAIL_NEW_MODS(BOOST_VMD_ALLOW_ALL,__VA_ARGS__) \
) \
) \
/**/
#define BOOST_VMD_DETAIL_SEQUENCE_TYPE_TUPLE_MORE_D(d,dtuple,...) \
BOOST_VMD_DETAIL_SEQUENCE_TYPE_TUPLE_MODS_D \
( \
d, \
dtuple, \
BOOST_VMD_DETAIL_MODS_RESULT_RETURN_TYPE \
( \
BOOST_VMD_DETAIL_NEW_MODS_D(d,BOOST_VMD_ALLOW_ALL,__VA_ARGS__) \
) \
) \
/**/
#define BOOST_VMD_DETAIL_SEQUENCE_TYPE_TUPLE_UNARY(dtuple,...) \
BOOST_VMD_IDENTITY_RESULT \
( \
BOOST_PP_IIF \
( \
BOOST_VMD_DETAIL_EQUAL_TYPE(BOOST_VMD_TYPE_TUPLE,BOOST_PP_TUPLE_ELEM(0,dtuple)), \
BOOST_VMD_DETAIL_SEQUENCE_TYPE_TUPLE_MORE, \
BOOST_VMD_IDENTITY(BOOST_PP_TUPLE_ELEM(0,dtuple)) \
) \
(dtuple,__VA_ARGS__) \
) \
/**/
#define BOOST_VMD_DETAIL_SEQUENCE_TYPE_TUPLE_UNARY_D(d,dtuple,...) \
BOOST_VMD_IDENTITY_RESULT \
( \
BOOST_PP_IIF \
( \
BOOST_VMD_DETAIL_EQUAL_TYPE_D(d,BOOST_VMD_TYPE_TUPLE,BOOST_PP_TUPLE_ELEM(0,dtuple)), \
BOOST_VMD_DETAIL_SEQUENCE_TYPE_TUPLE_MORE_D, \
BOOST_VMD_IDENTITY(BOOST_PP_TUPLE_ELEM(0,dtuple)) \
) \
(d,dtuple,__VA_ARGS__) \
) \
/**/
#define BOOST_VMD_DETAIL_SEQUENCE_TYPE_TUPLE_SEQUENCE(tuple,...) \
BOOST_VMD_IDENTITY_RESULT \
( \
BOOST_PP_IIF \
( \
BOOST_VMD_IS_EMPTY(BOOST_PP_TUPLE_ELEM(1,tuple)), \
BOOST_VMD_DETAIL_SEQUENCE_TYPE_TUPLE_UNARY, \
BOOST_VMD_IDENTITY(BOOST_VMD_TYPE_SEQUENCE) \
) \
(BOOST_PP_TUPLE_ELEM(0,tuple),__VA_ARGS__) \
) \
/**/
#define BOOST_VMD_DETAIL_SEQUENCE_TYPE_TUPLE_SEQUENCE_D(d,tuple,...) \
BOOST_VMD_IDENTITY_RESULT \
( \
BOOST_PP_IIF \
( \
BOOST_VMD_IS_EMPTY(BOOST_PP_TUPLE_ELEM(1,tuple)), \
BOOST_VMD_DETAIL_SEQUENCE_TYPE_TUPLE_UNARY_D, \
BOOST_VMD_IDENTITY(BOOST_VMD_TYPE_SEQUENCE) \
) \
(d,BOOST_PP_TUPLE_ELEM(0,tuple),__VA_ARGS__) \
) \
/**/
#define BOOST_VMD_DETAIL_SEQUENCE_TYPE_TUPLE(tuple,...) \
BOOST_VMD_IDENTITY_RESULT \
( \
BOOST_PP_IIF \
( \
BOOST_VMD_IS_EMPTY(BOOST_PP_TUPLE_ELEM(0,tuple)), \
BOOST_VMD_IDENTITY(BOOST_VMD_TYPE_EMPTY), \
BOOST_VMD_DETAIL_SEQUENCE_TYPE_TUPLE_SEQUENCE \
) \
(tuple,__VA_ARGS__) \
) \
/**/
#define BOOST_VMD_DETAIL_SEQUENCE_TYPE_TUPLE_D(d,tuple,...) \
BOOST_VMD_IDENTITY_RESULT \
( \
BOOST_PP_IIF \
( \
BOOST_VMD_IS_EMPTY(BOOST_PP_TUPLE_ELEM(0,tuple)), \
BOOST_VMD_IDENTITY(BOOST_VMD_TYPE_EMPTY), \
BOOST_VMD_DETAIL_SEQUENCE_TYPE_TUPLE_SEQUENCE_D \
) \
(d,tuple,__VA_ARGS__) \
) \
/**/
#define BOOST_VMD_DETAIL_SEQUENCE_TYPE(...) \
BOOST_VMD_DETAIL_SEQUENCE_TYPE_TUPLE \
( \
BOOST_VMD_DETAIL_SEQUENCE_ELEM \
( \
BOOST_VMD_ALLOW_ALL, \
0, \
BOOST_PP_VARIADIC_ELEM(0,__VA_ARGS__), \
BOOST_VMD_RETURN_AFTER, \
BOOST_VMD_RETURN_TYPE_TUPLE \
), \
__VA_ARGS__ \
) \
/**/
#define BOOST_VMD_DETAIL_SEQUENCE_TYPE_D(d,...) \
BOOST_VMD_DETAIL_SEQUENCE_TYPE_TUPLE_D \
( \
d, \
BOOST_VMD_DETAIL_SEQUENCE_ELEM_D \
( \
d, \
BOOST_VMD_ALLOW_ALL, \
0, \
BOOST_PP_VARIADIC_ELEM(0,__VA_ARGS__), \
BOOST_VMD_RETURN_AFTER, \
BOOST_VMD_RETURN_TYPE_TUPLE \
), \
__VA_ARGS__ \
) \
/**/
#endif /* BOOST_VMD_DETAIL_SEQUENCE_TYPE_HPP */
```
|
Kozman is a town in the Tavush Province of Armenia.
See also
Tavush Province
References
Populated places in Tavush Province
|
Atlético Monte Azul, commonly referred to as Monte Azul, is a professional association football club based in Monte Azul Paulista, São Paulo, Brazil. The team competes in Campeonato Paulista Série A2, the second tier of the São Paulo state football league. The stadium, Estádio Otacília Patrício Arroyo, is located at 33, Rua Monteiro Lobato.
History
Atlético Monte Azul were founded on April 28, 1920, by several people, including José Cione, who suggested the name Monte Azul. In the late 1940s, the club professionalized their football department, and joined the Campeonato Paulista in 1950. The club won the Campeonato Paulista Segunda Divisão in 2004. Monte Azul won the Campeonato Paulista Série A2 in 2009, after beating Rio Branco in the final. thus being promoted to compete in the 2010 Campeonato Paulista.
Stadium
Monte Azul play their home games at Estádio do Atlético Monte Azul, commonly known as AMA. The stadium has a maximum capacity of 11,109 people.
Current squad (selected)
Out on loan
Achievements
Campeonato Paulista Série A2:
Winners (1): 2009
Campeonato Paulista Segunda Divisão:
Winners (2): 1994, 2004
References
External links
Official website
Association football clubs established in 1920
Football clubs in São Paulo (state)
1920 establishments in Brazil
|
```java
package com.che58.ljb.rxjava.fragment;
import android.content.SharedPreferences;
import android.os.Bundle;
import android.preference.PreferenceManager;
import android.support.annotation.Nullable;
import android.view.LayoutInflater;
import android.view.View;
import android.view.ViewGroup;
import android.widget.Button;
import android.widget.CheckBox;
import android.widget.Toast;
import com.che58.ljb.rxjava.R;
import com.f2prateek.rx.preferences.Preference;
import com.f2prateek.rx.preferences.RxSharedPreferences;
import com.jakewharton.rxbinding.widget.RxCompoundButton;
import com.trello.rxlifecycle.components.support.RxFragment;
import butterknife.Bind;
import butterknife.ButterKnife;
import butterknife.OnClick;
import rx.functions.Action1;
/**
* CheckBoxUI
* Created by ljb on 2016/3/24.
*/
public class CheckBoxUpdateFragment extends RxFragment {
@Bind(R.id.cb_1)
CheckBox checkBox1;
@Bind(R.id.cb_2)
CheckBox checkBox2;
@Bind(R.id.btn_login)
Button btn_login;
@Nullable
@Override
public View onCreateView(LayoutInflater inflater, ViewGroup container, Bundle savedInstanceState) {
View view = inflater.inflate(R.layout.fragment_checkbox_update, null);
ButterKnife.bind(this, view);
return view;
}
@Override
public void onActivityCreated(@Nullable Bundle savedInstanceState) {
super.onActivityCreated(savedInstanceState);
check_update1();
check_update2();
}
/**
* SharedPreferences
*/
private void check_update1() {
SharedPreferences preferences = PreferenceManager.getDefaultSharedPreferences(getActivity());
RxSharedPreferences rxPreferences = RxSharedPreferences.create(preferences);
Preference<Boolean> xxFunction = rxPreferences.getBoolean("xxFunction", false);
checkBox1.setChecked(xxFunction.get());
RxCompoundButton.checkedChanges(checkBox1)
.subscribe(xxFunction.asAction());
}
/**
* UI
*/
private void check_update2() {
RxCompoundButton.checkedChanges(checkBox2)
.subscribe(new Action1<Boolean>() {
@Override
public void call(Boolean aBoolean) {
btn_login.setClickable(aBoolean);
btn_login.setBackgroundResource(aBoolean ? R.color.can_login : R.color.not_login);
}
});
}
@OnClick(R.id.btn_login)
void login(){
Toast.makeText(getActivity(), R.string.login, Toast.LENGTH_SHORT).show();
}
}
```
|
```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\ToolResults;
class PendingGoogleUpdateInsight extends \Google\Model
{
/**
* @var string
*/
public $nameOfGoogleLibrary;
/**
* @param string
*/
public function setNameOfGoogleLibrary($nameOfGoogleLibrary)
{
$this->nameOfGoogleLibrary = $nameOfGoogleLibrary;
}
/**
* @return string
*/
public function getNameOfGoogleLibrary()
{
return $this->nameOfGoogleLibrary;
}
}
// Adding a class alias for backwards compatibility with the previous class name.
class_alias(PendingGoogleUpdateInsight::class, 'Google_Service_ToolResults_PendingGoogleUpdateInsight');
```
|
```html
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Iterator Based Parser API</title>
<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
<link rel="home" href="../../../../index.html" title="Spirit 2.5.4">
<link rel="up" href="../parse_api.html" title="Parser API">
<link rel="prev" href="../parse_api.html" title="Parser API">
<link rel="next" href="stream_api.html" title="Stream Based Parser API">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
<td align="center"><a href="../../../../../../../../index.html">Home</a></td>
<td align="center"><a href="../../../../../../../../libs/libraries.htm">Libraries</a></td>
<td align="center"><a href="path_to_url">People</a></td>
<td align="center"><a href="path_to_url">FAQ</a></td>
<td align="center"><a href="../../../../../../../../more/index.htm">More</a></td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="../parse_api.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../parse_api.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="stream_api.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="spirit.qi.reference.parse_api.iterator_api"></a><a class="link" href="iterator_api.html" title="Iterator Based Parser API">Iterator
Based Parser API</a>
</h5></div></div></div>
<h6>
<a name="spirit.qi.reference.parse_api.iterator_api.h0"></a>
<span class="phrase"><a name="spirit.qi.reference.parse_api.iterator_api.description"></a></span><a class="link" href="iterator_api.html#spirit.qi.reference.parse_api.iterator_api.description">Description</a>
</h6>
<p>
The library provides a couple of free functions to make parsing a snap.
These parser functions have two forms. The first form <code class="computeroutput"><span class="identifier">parse</span></code>
works on the character level. The second <code class="computeroutput"><span class="identifier">phrase_parse</span></code>
works on the phrase level and requires skip parser. Both versions can
take in attributes by reference that will hold the parsed values on a
successful parse.
</p>
<h6>
<a name="spirit.qi.reference.parse_api.iterator_api.h1"></a>
<span class="phrase"><a name="spirit.qi.reference.parse_api.iterator_api.header"></a></span><a class="link" href="iterator_api.html#spirit.qi.reference.parse_api.iterator_api.header">Header</a>
</h6>
<pre class="programlisting"><span class="comment">// forwards to <boost/spirit/home/qi/parse.hpp></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">include</span><span class="special">/</span><span class="identifier">qi_parse</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
For variadic attributes:
</p>
<pre class="programlisting"><span class="comment">// forwards to <boost/spirit/home/qi/parse_attr.hpp></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">include</span><span class="special">/</span><span class="identifier">qi_parse_attr</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
The variadic attributes version of the API allows one or more attributes
to be passed into the parse functions. The functions taking two or more
are usable when the parser expression is a <a class="link" href="../operator/sequence.html" title="Sequence Parser (a >> b)">Sequence</a>
only. In this case each of the attributes passed have to match the corresponding
part of the sequence.
</p>
<p>
For the API functions deducing the correct (matching) parser type from
the supplied attribute type:
</p>
<pre class="programlisting"><span class="comment">// forwards to <boost/spirit/home/qi/detail/parse_auto.hpp></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">include</span><span class="special">/</span><span class="identifier">qi_parse_auto</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
Also, see <a class="link" href="../../../structure/include.html" title="Include">Include Structure</a>.
</p>
<h6>
<a name="spirit.qi.reference.parse_api.iterator_api.h2"></a>
<span class="phrase"><a name="spirit.qi.reference.parse_api.iterator_api.namespace"></a></span><a class="link" href="iterator_api.html#spirit.qi.reference.parse_api.iterator_api.namespace">Namespace</a>
</h6>
<div class="informaltable"><table class="table">
<colgroup><col></colgroup>
<thead><tr><th>
<p>
Name
</p>
</th></tr></thead>
<tbody>
<tr><td>
<p>
<code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">spirit</span><span class="special">::</span><span class="identifier">qi</span><span class="special">::</span><span class="identifier">parse</span></code>
</p>
</td></tr>
<tr><td>
<p>
<code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">spirit</span><span class="special">::</span><span class="identifier">qi</span><span class="special">::</span><span class="identifier">phrase_parse</span></code>
</p>
</td></tr>
<tr><td>
<p>
<code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">spirit</span><span class="special">::</span><span class="identifier">qi</span><span class="special">::</span><span class="identifier">skip_flag</span><span class="special">::</span><span class="identifier">postskip</span></code>
</p>
</td></tr>
<tr><td>
<p>
<code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">spirit</span><span class="special">::</span><span class="identifier">qi</span><span class="special">::</span><span class="identifier">skip_flag</span><span class="special">::</span><span class="identifier">dont_postskip</span></code>
</p>
</td></tr>
</tbody>
</table></div>
<h6>
<a name="spirit.qi.reference.parse_api.iterator_api.h3"></a>
<span class="phrase"><a name="spirit.qi.reference.parse_api.iterator_api.synopsis"></a></span><a class="link" href="iterator_api.html#spirit.qi.reference.parse_api.iterator_api.synopsis">Synopsis</a>
</h6>
<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">spirit</span> <span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">qi</span>
<span class="special">{</span>
<span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Iterator</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Expr</span><span class="special">></span>
<span class="keyword">inline</span> <span class="keyword">bool</span>
<span class="identifier">parse</span><span class="special">(</span>
<span class="identifier">Iterator</span><span class="special">&</span> <span class="identifier">first</span>
<span class="special">,</span> <span class="identifier">Iterator</span> <span class="identifier">last</span>
<span class="special">,</span> <span class="identifier">Expr</span> <span class="keyword">const</span><span class="special">&</span> <span class="identifier">expr</span><span class="special">);</span>
<span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Iterator</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Expr</span>
<span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Attr1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Attr2</span><span class="special">,</span> <span class="special">...,</span> <span class="keyword">typename</span> <span class="identifier">AttrN</span><span class="special">></span>
<span class="keyword">inline</span> <span class="keyword">bool</span>
<span class="identifier">parse</span><span class="special">(</span>
<span class="identifier">Iterator</span><span class="special">&</span> <span class="identifier">first</span>
<span class="special">,</span> <span class="identifier">Iterator</span> <span class="identifier">last</span>
<span class="special">,</span> <span class="identifier">Expr</span> <span class="keyword">const</span><span class="special">&</span> <span class="identifier">expr</span>
<span class="special">,</span> <span class="identifier">Attr1</span><span class="special">&</span> <span class="identifier">attr1</span><span class="special">,</span> <span class="identifier">Attr2</span><span class="special">&</span> <span class="identifier">attr2</span><span class="special">,</span> <span class="special">...,</span> <span class="identifier">AttrN</span><span class="special">&</span> <span class="identifier">attrN</span><span class="special">);</span>
<span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Iterator</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Expr</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Skipper</span><span class="special">></span>
<span class="keyword">inline</span> <span class="keyword">bool</span>
<span class="identifier">phrase_parse</span><span class="special">(</span>
<span class="identifier">Iterator</span><span class="special">&</span> <span class="identifier">first</span>
<span class="special">,</span> <span class="identifier">Iterator</span> <span class="identifier">last</span>
<span class="special">,</span> <span class="identifier">Expr</span> <span class="keyword">const</span><span class="special">&</span> <span class="identifier">expr</span>
<span class="special">,</span> <span class="identifier">Skipper</span> <span class="keyword">const</span><span class="special">&</span> <span class="identifier">skipper</span>
<span class="special">,</span> <span class="identifier">BOOST_SCOPED_ENUM</span><span class="special">(</span><span class="identifier">skip_flag</span><span class="special">)</span> <span class="identifier">post_skip</span> <span class="special">=</span> <span class="identifier">skip_flag</span><span class="special">::</span><span class="identifier">postskip</span><span class="special">);</span>
<span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Iterator</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Expr</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Skipper</span>
<span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Attr1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Attr2</span><span class="special">,</span> <span class="special">...,</span> <span class="keyword">typename</span> <span class="identifier">AttrN</span><span class="special">></span>
<span class="keyword">inline</span> <span class="keyword">bool</span>
<span class="identifier">phrase_parse</span><span class="special">(</span>
<span class="identifier">Iterator</span><span class="special">&</span> <span class="identifier">first</span>
<span class="special">,</span> <span class="identifier">Iterator</span> <span class="identifier">last</span>
<span class="special">,</span> <span class="identifier">Expr</span> <span class="keyword">const</span><span class="special">&</span> <span class="identifier">expr</span>
<span class="special">,</span> <span class="identifier">Skipper</span> <span class="keyword">const</span><span class="special">&</span> <span class="identifier">skipper</span>
<span class="special">,</span> <span class="identifier">Attr1</span><span class="special">&</span> <span class="identifier">attr1</span><span class="special">,</span> <span class="identifier">Attr2</span><span class="special">&</span> <span class="identifier">attr2</span><span class="special">,</span> <span class="special">...,</span> <span class="identifier">AttrN</span><span class="special">&</span> <span class="identifier">attrN</span><span class="special">);</span>
<span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Iterator</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Expr</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Skipper</span>
<span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Attr1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Attr2</span><span class="special">,</span> <span class="special">...,</span> <span class="keyword">typename</span> <span class="identifier">AttrN</span><span class="special">></span>
<span class="keyword">inline</span> <span class="keyword">bool</span>
<span class="identifier">phrase_parse</span><span class="special">(</span>
<span class="identifier">Iterator</span><span class="special">&</span> <span class="identifier">first</span>
<span class="special">,</span> <span class="identifier">Iterator</span> <span class="identifier">last</span>
<span class="special">,</span> <span class="identifier">Expr</span> <span class="keyword">const</span><span class="special">&</span> <span class="identifier">expr</span>
<span class="special">,</span> <span class="identifier">Skipper</span> <span class="keyword">const</span><span class="special">&</span> <span class="identifier">skipper</span>
<span class="special">,</span> <span class="identifier">BOOST_SCOPED_ENUM</span><span class="special">(</span><span class="identifier">skip_flag</span><span class="special">)</span> <span class="identifier">post_skip</span>
<span class="special">,</span> <span class="identifier">Attr1</span><span class="special">&</span> <span class="identifier">attr1</span><span class="special">,</span> <span class="identifier">Attr2</span><span class="special">&</span> <span class="identifier">attr2</span><span class="special">,</span> <span class="special">...,</span> <span class="identifier">AttrN</span><span class="special">&</span> <span class="identifier">attrN</span><span class="special">);</span>
<span class="special">}}}</span>
</pre>
<div class="note"><table border="0" summary="Note">
<tr>
<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../images/note.png"></td>
<th align="left">Note</th>
</tr>
<tr><td align="left" valign="top"><p>
Starting with <a href="path_to_url" target="_top">Spirit</a> V2.5
(distributed with Boost V1.47) the placeholder <code class="computeroutput"><span class="identifier">_val</span></code>
can be used in semantic actions attached to top level parser components.
In this case <code class="computeroutput"><span class="identifier">_val</span></code> refers
to the supplied attribute as a whole. For API functions taking more
than one attribute argument <code class="computeroutput"><span class="identifier">_val</span></code>
will refer to a Fusion vector or references to the attributes.
</p></td></tr>
</table></div>
<p>
<span class="emphasis"><em>Spirit.Qi</em></span> parser API functions based on the automatic
creation of the matching parser type:
</p>
<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">spirit</span> <span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">qi</span>
<span class="special">{</span>
<span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Iterator</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Attr</span><span class="special">></span>
<span class="keyword">inline</span> <span class="keyword">bool</span>
<span class="identifier">parse</span><span class="special">(</span>
<span class="identifier">Iterator</span><span class="special">&</span> <span class="identifier">first</span>
<span class="special">,</span> <span class="identifier">Iterator</span> <span class="identifier">last</span>
<span class="special">,</span> <span class="identifier">Attr</span><span class="special">&</span> <span class="identifier">attr</span><span class="special">);</span>
<span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Iterator</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Attr</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Skipper</span><span class="special">></span>
<span class="keyword">inline</span> <span class="keyword">bool</span>
<span class="identifier">phrase_parse</span><span class="special">(</span>
<span class="identifier">Iterator</span><span class="special">&</span> <span class="identifier">first</span>
<span class="special">,</span> <span class="identifier">Iterator</span> <span class="identifier">last</span>
<span class="special">,</span> <span class="identifier">Attr</span><span class="special">&</span> <span class="identifier">attr</span>
<span class="special">,</span> <span class="identifier">Skipper</span> <span class="keyword">const</span><span class="special">&</span> <span class="identifier">skipper</span>
<span class="special">,</span> <span class="identifier">BOOST_SCOPED_ENUM</span><span class="special">(</span><span class="identifier">skip_flag</span><span class="special">)</span> <span class="identifier">post_skip</span> <span class="special">=</span> <span class="identifier">skip_flag</span><span class="special">::</span><span class="identifier">postskip</span><span class="special">);</span>
<span class="special">}}}</span>
</pre>
<p>
All functions above return <code class="computeroutput"><span class="keyword">true</span></code>
if none of the involved parser components failed, and <code class="computeroutput"><span class="keyword">false</span></code>
otherwise.
</p>
<p>
The maximum number of supported arguments is limited by the preprocessor
constant <code class="computeroutput"><span class="identifier">SPIRIT_ARGUMENTS_LIMIT</span></code>.
This constant defaults to the value defined by the preprocessor constant
<code class="computeroutput"><span class="identifier">PHOENIX_LIMIT</span></code> (which
in turn defaults to <code class="computeroutput"><span class="number">10</span></code>).
</p>
<div class="note"><table border="0" summary="Note">
<tr>
<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../images/note.png"></td>
<th align="left">Note</th>
</tr>
<tr><td align="left" valign="top"><p>
The variadic functions with two or more attributes internally combine
references to all passed attributes into a <code class="computeroutput"><span class="identifier">fusion</span><span class="special">::</span><span class="identifier">vector</span></code>
and forward this as a combined attribute to the corresponding one attribute
function.
</p></td></tr>
</table></div>
<p>
The <code class="computeroutput"><span class="identifier">phrase_parse</span></code> functions
not taking an explicit <code class="computeroutput"><span class="identifier">skip_flag</span></code>
as one of their arguments invoke the passed skipper after a successful
match of the parser expression. This can be inhibited by using the other
versions of that function while passing <code class="computeroutput"><span class="identifier">skip_flag</span><span class="special">::</span><span class="identifier">dont_postskip</span></code>
to the corresponding argument.
</p>
<div class="informaltable"><table class="table">
<colgroup>
<col>
<col>
</colgroup>
<thead><tr>
<th>
<p>
Parameter
</p>
</th>
<th>
<p>
Description
</p>
</th>
</tr></thead>
<tbody>
<tr>
<td>
<p>
<code class="computeroutput"><span class="identifier">Iterator</span></code>
</p>
</td>
<td>
<p>
<a href="path_to_url" target="_top"><code class="computeroutput"><span class="identifier">ForwardIterator</span></code></a> pointing
to the source to parse.
</p>
</td>
</tr>
<tr>
<td>
<p>
<code class="computeroutput"><span class="identifier">Expr</span></code>
</p>
</td>
<td>
<p>
An expression that can be converted to a Qi parser.
</p>
</td>
</tr>
<tr>
<td>
<p>
<code class="computeroutput"><span class="identifier">Skipper</span></code>
</p>
</td>
<td>
<p>
Parser used to skip white spaces.
</p>
</td>
</tr>
<tr>
<td>
<p>
<code class="computeroutput"><span class="identifier">Attr</span></code>
</p>
</td>
<td>
<p>
An attribute type utilized to create the corresponding parser
type from.
</p>
</td>
</tr>
<tr>
<td>
<p>
<code class="computeroutput"><span class="identifier">Attr1</span></code>, <code class="computeroutput"><span class="identifier">Attr2</span></code>, ..., <code class="computeroutput"><span class="identifier">AttrN</span></code>
</p>
</td>
<td>
<p>
One or more attributes.
</p>
</td>
</tr>
</tbody>
</table></div>
</div>
<table xmlns:rev="path_to_url~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
file LICENSE_1_0.txt or copy at <a href="path_to_url" target="_top">path_to_url
</p>
</div></td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="../parse_api.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../parse_api.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="stream_api.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
```
|
Alutgama may refer to:
Alutgama (7°22'N 80°38'E), a village in Akurana Division, Kandy District, Central Province, Sri Lanka
Alutgama (7°31'N 80°35'E), a village in Yatawatta Division, Matale District, Central Province, Sri Lanka
Alutgama (7°42'N 80°35'E), a village in Pallepola Division, Matale District, Central Province, Sri Lanka
|
António Teixeira de Sousa, 2nd Count of Sousa Palmela (; 5 May 1857 in Celeirós, Sabrosa – 5 June 1917 in Celeirós, Sabrosa) was a Portuguese medical doctor and politician during the Constitutional Monarchy. He graduated in Medicine at the University of Porto, in 1883.
A member of the conservative Regenerator Party, he was first elected to the Chamber of Deputies, in 1889. He was later minister of the Navy and Overseas (1900–1903), and, twice, of Finance (1903–1904, 1906). He became President of the Council of Ministers (Prime Minister) on 26 June 1910, and would be the last Prime Minister of the Constitutional Monarchy as King D. Manuel II was overthrown by a republican revolution on 5 October 1910. He left politics after the republic proclamation, but showed a moderate support for the new regime.
1857 births
1917 deaths
People from Sabrosa
Portuguese nobility
Regenerator Party politicians
Prime Ministers of Portugal
Finance ministers of Portugal
19th-century Portuguese physicians
20th-century Portuguese physicians
University of Porto alumni
Naval ministers of Portugal
|
Francesco Niccolini (also Nicolini, 1639 – 1692) was an Italian archbishop and diplomat, Apostolic Nuncio to Portugal from 1685 to 1690 and to France from 1690 to 1692.
Life
Born in Florence in 1639, he was nephew of the archbishop of the city Pietro Niccolini. He graduated in utroque iure in Pisa. He made a rapid career in the administration of the Papal States holding the roles of governor of Fabriano in 1667, of Camerino from May 1668, of Ascoli from April 1669 and Vice-legate of Avignon from 1677 to 1685.
Destined for the Nunciature to Portugal, he was appointed titular Archbishop of Rhodes on 10 September 1685 and consecrated bishop in the church of the Jesuit College of Avignon on 16 December 1685 by Jean-Baptiste Adhémar de Monteil de Grignan, coadjutor of the Archbishop of Arles.
Francesco Niccolini remained as a nuncio in Portugal until 1690, when he was nominated nuncio to France. Reached Paris, he had his first meeting with the Sun King on November 28 of that year.
He died in Paris on 4 February 1692 and was buried in the Capuchin church on rue Saint-Honoré.
References
1692 deaths
Apostolic Nuncios to Portugal
Apostolic Nuncios to France
Clergy from Florence
Roman Catholic archbishops of Rhodes
1639 births
Diplomats from Florence
|
```xml
import { handleActions } from 'redux-actions';
import * as actions from '../actions/filtering';
const filtering = handleActions(
{
[actions.setRulesRequest.toString()]: (state: any) => ({
...state,
processingRules: true,
}),
[actions.setRulesFailure.toString()]: (state: any) => ({
...state,
processingRules: false,
}),
[actions.setRulesSuccess.toString()]: (state: any) => ({
...state,
processingRules: false,
}),
[actions.handleRulesChange.toString()]: (state: any, { payload }: any) => {
const { userRules } = payload;
return { ...state, userRules };
},
[actions.getFilteringStatusRequest.toString()]: (state: any) => ({
...state,
processingFilters: true,
check: {},
}),
[actions.getFilteringStatusFailure.toString()]: (state: any) => ({
...state,
processingFilters: false,
}),
[actions.getFilteringStatusSuccess.toString()]: (state, { payload }: any) => ({
...state,
...payload,
processingFilters: false,
}),
[actions.addFilterRequest.toString()]: (state: any) => ({
...state,
processingAddFilter: true,
isFilterAdded: false,
}),
[actions.addFilterFailure.toString()]: (state: any) => ({
...state,
processingAddFilter: false,
isFilterAdded: false,
}),
[actions.addFilterSuccess.toString()]: (state: any) => ({
...state,
processingAddFilter: false,
isFilterAdded: true,
}),
[actions.toggleFilteringModal.toString()]: (state: any, { payload }: any) => {
if (payload) {
const newState = {
...state,
isModalOpen: !state.isModalOpen,
isFilterAdded: false,
modalType: payload.type || '',
modalFilterUrl: payload.url || '',
};
return newState;
}
const newState = {
...state,
isModalOpen: !state.isModalOpen,
isFilterAdded: false,
modalType: '',
};
return newState;
},
[actions.toggleFilterRequest.toString()]: (state: any) => ({
...state,
processingConfigFilter: true,
}),
[actions.toggleFilterFailure.toString()]: (state: any) => ({
...state,
processingConfigFilter: false,
}),
[actions.toggleFilterSuccess.toString()]: (state: any) => ({
...state,
processingConfigFilter: false,
}),
[actions.editFilterRequest.toString()]: (state: any) => ({
...state,
processingConfigFilter: true,
}),
[actions.editFilterFailure.toString()]: (state: any) => ({
...state,
processingConfigFilter: false,
}),
[actions.editFilterSuccess.toString()]: (state: any) => ({
...state,
processingConfigFilter: false,
}),
[actions.refreshFiltersRequest.toString()]: (state: any) => ({
...state,
processingRefreshFilters: true,
}),
[actions.refreshFiltersFailure.toString()]: (state: any) => ({
...state,
processingRefreshFilters: false,
}),
[actions.refreshFiltersSuccess.toString()]: (state: any) => ({
...state,
processingRefreshFilters: false,
}),
[actions.removeFilterRequest.toString()]: (state: any) => ({
...state,
processingRemoveFilter: true,
}),
[actions.removeFilterFailure.toString()]: (state: any) => ({
...state,
processingRemoveFilter: false,
}),
[actions.removeFilterSuccess.toString()]: (state: any) => ({
...state,
processingRemoveFilter: false,
}),
[actions.setFiltersConfigRequest.toString()]: (state: any) => ({
...state,
processingSetConfig: true,
}),
[actions.setFiltersConfigFailure.toString()]: (state: any) => ({
...state,
processingSetConfig: false,
}),
[actions.setFiltersConfigSuccess.toString()]: (state, { payload }: any) => ({
...state,
...payload,
processingSetConfig: false,
}),
[actions.checkHostRequest.toString()]: (state: any) => ({
...state,
processingCheck: true,
}),
[actions.checkHostFailure.toString()]: (state: any) => ({
...state,
processingCheck: false,
}),
[actions.checkHostSuccess.toString()]: (state, { payload }: any) => ({
...state,
check: payload,
processingCheck: false,
}),
},
{
isModalOpen: false,
processingFilters: false,
processingRules: false,
processingAddFilter: false,
processingRefreshFilters: false,
processingConfigFilter: false,
processingRemoveFilter: false,
processingSetConfig: false,
processingCheck: false,
isFilterAdded: false,
filters: [],
whitelistFilters: [],
userRules: '',
interval: 24,
enabled: true,
modalType: '',
modalFilterUrl: '',
check: {},
},
);
export default filtering;
```
|
Metachanda heterobela is a moth species in the oecophorine tribe Metachandini. It was described by Anthonie Johannes Theodorus Janse in 1954.
References
Oecophorinae
Moths described in 1954
|
```c++
//
// file LICENSE_1_0.txt or copy at path_to_url
// <boost/thread/sync_queue.hpp>
// class sync_queue<T>
// sync_queue();
#define BOOST_THREAD_VERSION 4
#include <boost/thread/sync_queue.hpp>
#include <boost/detail/lightweight_test.hpp>
class non_copyable
{
BOOST_THREAD_MOVABLE_ONLY(non_copyable)
int val;
public:
non_copyable(int v) : val(v){}
non_copyable(BOOST_RV_REF(non_copyable) x): val(x.val) {}
non_copyable& operator=(BOOST_RV_REF(non_copyable) x) { val=x.val; return *this; }
bool operator==(non_copyable const& x) const {return val==x.val;}
template <typename OSTREAM>
friend OSTREAM& operator <<(OSTREAM& os, non_copyable const&x )
{
os << x.val;
return os;
}
};
int main()
{
{
// default queue invariants
boost::sync_queue<int> q;
BOOST_TEST(q.empty());
BOOST_TEST(! q.full());
BOOST_TEST_EQ(q.size(), 0u);
BOOST_TEST(! q.closed());
}
#ifndef BOOST_NO_CXX11_RVALUE_REFERENCES
{
// empty queue push rvalue/non_copyable succeeds
boost::sync_queue<non_copyable> q;
q.push(non_copyable(1));
BOOST_TEST(! q.empty());
BOOST_TEST(! q.full());
BOOST_TEST_EQ(q.size(), 1u);
BOOST_TEST(! q.closed());
}
#endif
{
// empty queue push rvalue/non_copyable succeeds
boost::sync_queue<non_copyable> q;
non_copyable nc(1);
q.push(boost::move(nc));
BOOST_TEST(! q.empty());
BOOST_TEST(! q.full());
BOOST_TEST_EQ(q.size(), 1u);
BOOST_TEST(! q.closed());
}
{
// empty queue push rvalue succeeds
boost::sync_queue<int> q;
q.push(1);
q.push(2);
BOOST_TEST(! q.empty());
BOOST_TEST(! q.full());
BOOST_TEST_EQ(q.size(), 2u);
BOOST_TEST(! q.closed());
}
{
// empty queue push lvalue succeeds
boost::sync_queue<int> q;
int i;
q.push(i);
BOOST_TEST(! q.empty());
BOOST_TEST(! q.full());
BOOST_TEST_EQ(q.size(), 1u);
BOOST_TEST(! q.closed());
}
{
// empty queue try_push rvalue/copyable succeeds
boost::sync_queue<int> q;
BOOST_TEST(boost::queue_op_status::success == q.try_push(1));
BOOST_TEST(! q.empty());
BOOST_TEST(! q.full());
BOOST_TEST_EQ(q.size(), 1u);
BOOST_TEST(! q.closed());
}
{
// empty queue try_push rvalue/copyable succeeds
boost::sync_queue<int> q;
BOOST_TEST(boost::queue_op_status::success == q.try_push(1));
BOOST_TEST(! q.empty());
BOOST_TEST(! q.full());
BOOST_TEST_EQ(q.size(), 1u);
BOOST_TEST(! q.closed());
}
#ifndef BOOST_NO_CXX11_RVALUE_REFERENCES
{
// empty queue try_push rvalue/non-copyable succeeds
boost::sync_queue<non_copyable> q;
BOOST_TEST(boost::queue_op_status::success ==q.try_push(non_copyable(1)));
BOOST_TEST(! q.empty());
BOOST_TEST(! q.full());
BOOST_TEST_EQ(q.size(), 1u);
BOOST_TEST(! q.closed());
}
#endif
{
// empty queue try_push rvalue/non-copyable succeeds
boost::sync_queue<non_copyable> q;
non_copyable nc(1);
BOOST_TEST(boost::queue_op_status::success == q.try_push(boost::move(nc)));
BOOST_TEST(! q.empty());
BOOST_TEST(! q.full());
BOOST_TEST_EQ(q.size(), 1u);
BOOST_TEST(! q.closed());
}
{
// empty queue try_push lvalue succeeds
boost::sync_queue<int> q;
int i=1;
BOOST_TEST(boost::queue_op_status::success == q.try_push(i));
BOOST_TEST(! q.empty());
BOOST_TEST(! q.full());
BOOST_TEST_EQ(q.size(), 1u);
BOOST_TEST(! q.closed());
}
{
// empty queue try_push rvalue succeeds
boost::sync_queue<int> q;
BOOST_TEST(boost::queue_op_status::success == q.nonblocking_push(1));
BOOST_TEST(! q.empty());
BOOST_TEST(! q.full());
BOOST_TEST_EQ(q.size(), 1u);
BOOST_TEST(! q.closed());
}
#ifndef BOOST_NO_CXX11_RVALUE_REFERENCES
{
// empty queue nonblocking_push rvalue/non-copyable succeeds
boost::sync_queue<non_copyable> q;
BOOST_TEST(boost::queue_op_status::success == q.nonblocking_push(non_copyable(1)));
BOOST_TEST(! q.empty());
BOOST_TEST(! q.full());
BOOST_TEST_EQ(q.size(), 1u);
BOOST_TEST(! q.closed());
}
#endif
{
// empty queue nonblocking_push rvalue/non-copyable succeeds
boost::sync_queue<non_copyable> q;
non_copyable nc(1);
BOOST_TEST(boost::queue_op_status::success == q.nonblocking_push(boost::move(nc)));
BOOST_TEST(! q.empty());
BOOST_TEST(! q.full());
BOOST_TEST_EQ(q.size(), 1u);
BOOST_TEST(! q.closed());
}
{
// 1-element queue pull succeed
boost::sync_queue<int> q;
q.push(1);
int i;
q.pull(i);
BOOST_TEST_EQ(i, 1);
BOOST_TEST(q.empty());
BOOST_TEST(! q.full());
BOOST_TEST_EQ(q.size(), 0u);
BOOST_TEST(! q.closed());
}
{
// 1-element queue pull succeed
boost::sync_queue<non_copyable> q;
non_copyable nc1(1);
q.push(boost::move(nc1));
non_copyable nc2(2);
q.pull(nc2);
BOOST_TEST_EQ(nc1, nc2);
BOOST_TEST(q.empty());
BOOST_TEST(! q.full());
BOOST_TEST_EQ(q.size(), 0u);
BOOST_TEST(! q.closed());
}
{
// 1-element queue pull succeed
boost::sync_queue<int> q;
q.push(1);
int i = q.pull();
BOOST_TEST_EQ(i, 1);
BOOST_TEST(q.empty());
BOOST_TEST(! q.full());
BOOST_TEST_EQ(q.size(), 0u);
BOOST_TEST(! q.closed());
}
{
// 1-element queue pull succeed
boost::sync_queue<non_copyable> q;
non_copyable nc1(1);
q.push(boost::move(nc1));
non_copyable nc = q.pull();
BOOST_TEST_EQ(nc, nc1);
BOOST_TEST(q.empty());
BOOST_TEST(! q.full());
BOOST_TEST_EQ(q.size(), 0u);
BOOST_TEST(! q.closed());
}
{
// 1-element queue try_pull succeed
boost::sync_queue<int> q;
q.push(1);
int i;
BOOST_TEST(boost::queue_op_status::success == q.try_pull(i));
BOOST_TEST_EQ(i, 1);
BOOST_TEST(q.empty());
BOOST_TEST(! q.full());
BOOST_TEST_EQ(q.size(), 0u);
BOOST_TEST(! q.closed());
}
{
// 1-element queue try_pull succeed
boost::sync_queue<non_copyable> q;
non_copyable nc1(1);
q.push(boost::move(nc1));
non_copyable nc(2);
BOOST_TEST(boost::queue_op_status::success == q.try_pull(nc));
BOOST_TEST_EQ(nc, nc1);
BOOST_TEST(q.empty());
BOOST_TEST(! q.full());
BOOST_TEST_EQ(q.size(), 0u);
BOOST_TEST(! q.closed());
}
{
// 1-element queue nonblocking_pull succeed
boost::sync_queue<int> q;
q.push(1);
int i;
BOOST_TEST(boost::queue_op_status::success == q.nonblocking_pull(i));
BOOST_TEST_EQ(i, 1);
BOOST_TEST(q.empty());
BOOST_TEST(! q.full());
BOOST_TEST_EQ(q.size(), 0u);
BOOST_TEST(! q.closed());
}
{
// 1-element queue nonblocking_pull succeed
boost::sync_queue<non_copyable> q;
non_copyable nc1(1);
q.push(boost::move(nc1));
non_copyable nc(2);
BOOST_TEST(boost::queue_op_status::success == q.nonblocking_pull(nc));
BOOST_TEST_EQ(nc, nc1);
BOOST_TEST(q.empty());
BOOST_TEST(! q.full());
BOOST_TEST_EQ(q.size(), 0u);
BOOST_TEST(! q.closed());
}
{
// 1-element queue wait_pull succeed
boost::sync_queue<non_copyable> q;
non_copyable nc1(1);
q.push(boost::move(nc1));
non_copyable nc(2);
BOOST_TEST(boost::queue_op_status::success == q.wait_pull(nc));
BOOST_TEST_EQ(nc, nc1);
BOOST_TEST(q.empty());
BOOST_TEST(! q.full());
BOOST_TEST_EQ(q.size(), 0u);
BOOST_TEST(! q.closed());
}
{
// 1-element queue wait_pull succeed
boost::sync_queue<int> q;
q.push(1);
int i;
BOOST_TEST(boost::queue_op_status::success == q.wait_pull(i));
BOOST_TEST_EQ(i, 1);
BOOST_TEST(q.empty());
BOOST_TEST(! q.full());
BOOST_TEST_EQ(q.size(), 0u);
BOOST_TEST(! q.closed());
}
{
// 1-element queue wait_pull succeed
boost::sync_queue<non_copyable> q;
non_copyable nc1(1);
q.push(boost::move(nc1));
non_copyable nc(2);
BOOST_TEST(boost::queue_op_status::success == q.wait_pull(nc));
BOOST_TEST_EQ(nc, nc1);
BOOST_TEST(q.empty());
BOOST_TEST(! q.full());
BOOST_TEST_EQ(q.size(), 0u);
BOOST_TEST(! q.closed());
}
{
// closed invariants
boost::sync_queue<int> q;
q.close();
BOOST_TEST(q.empty());
BOOST_TEST(! q.full());
BOOST_TEST_EQ(q.size(), 0u);
BOOST_TEST(q.closed());
}
{
// closed queue push fails
boost::sync_queue<int> q;
q.close();
try {
q.push(1);
BOOST_TEST(false);
} catch (...) {
BOOST_TEST(q.empty());
BOOST_TEST(! q.full());
BOOST_TEST_EQ(q.size(), 0u);
BOOST_TEST(q.closed());
}
}
{
// 1-element closed queue pull succeed
boost::sync_queue<int> q;
q.push(1);
q.close();
int i;
q.pull(i);
BOOST_TEST_EQ(i, 1);
BOOST_TEST(q.empty());
BOOST_TEST(! q.full());
BOOST_TEST_EQ(q.size(), 0u);
BOOST_TEST(q.closed());
}
{
// 1-element closed queue wait_pull succeed
boost::sync_queue<int> q;
q.push(1);
q.close();
int i;
BOOST_TEST(boost::queue_op_status::success == q.wait_pull(i));
BOOST_TEST_EQ(i, 1);
BOOST_TEST(q.empty());
BOOST_TEST(! q.full());
BOOST_TEST_EQ(q.size(), 0u);
BOOST_TEST(q.closed());
}
{
// closed empty queue wait_pull fails
boost::sync_queue<int> q;
q.close();
BOOST_TEST(q.empty());
BOOST_TEST(q.closed());
int i;
BOOST_TEST(boost::queue_op_status::closed == q.wait_pull(i));
BOOST_TEST(q.empty());
BOOST_TEST(q.closed());
}
return boost::report_errors();
}
```
|
```c++
This program is free software; you can redistribute it and/or modify
the Free Software Foundation
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
with this program; if not, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. */
#include "stdh.h"
#include <Engine/Base/Translation.h>
#include <Engine/Base/ErrorReporting.h>
#include <Engine/Base/Memory.h>
#include <Engine/Base/Console.h>
#include <Engine/Graphics/GfxLibrary.h>
#include <Engine/Graphics/ViewPort.h>
#include <Engine/Templates/StaticStackArray.cpp>
#include <Engine/Templates/DynamicContainer.cpp>
#include <Engine/Templates/Stock_CTextureData.h>
#ifdef SE1_D3D
// asm shortcuts
#define O offset
#define Q qword ptr
#define D dword ptr
#define W word ptr
#define B byte ptr
#define ASMOPT 1
extern INDEX gap_iTruformLevel;
extern ULONG _fog_ulTexture;
extern ULONG _haze_ulTexture;
// state variables
extern BOOL GFX_bDepthTest;
extern BOOL GFX_bDepthWrite;
extern BOOL GFX_bAlphaTest;
extern BOOL GFX_bBlending;
extern BOOL GFX_bDithering;
extern BOOL GFX_bClipping;
extern BOOL GFX_bClipPlane;
extern BOOL GFX_bColorArray;
extern BOOL GFX_bFrontFace;
extern BOOL GFX_bTruform;
extern INDEX GFX_iActiveTexUnit;
extern FLOAT GFX_fMinDepthRange;
extern FLOAT GFX_fMaxDepthRange;
extern GfxBlend GFX_eBlendSrc;
extern GfxBlend GFX_eBlendDst;
extern GfxComp GFX_eDepthFunc;
extern GfxFace GFX_eCullFace;
extern INDEX GFX_iTexModulation[GFX_MAXTEXUNITS];
extern INDEX GFX_ctVertices;
extern BOOL D3D_bUseColorArray = FALSE;
// internal vars
static INDEX _iVtxOffset = 0;
static INDEX _iIdxOffset = 0;
static INDEX _iVtxPos = 0;
static INDEX _iTexPass = 0;
static INDEX _iColPass = 0;
static DWORD _dwCurrentVS = NONE;
static ULONG _ulStreamsMask = NONE;
static ULONG _ulLastStreamsMask = NONE;
static BOOL _bProjectiveMapping = FALSE;
static BOOL _bLastProjectiveMapping = FALSE;
static DWORD _dwVtxLockFlags; // for vertex and normal
static DWORD _dwColLockFlags[GFX_MAXLAYERS]; // for colors
static DWORD _dwTexLockFlags[GFX_MAXLAYERS]; // for texture coords
// shaders created so far
struct VertexShader {
ULONG vs_ulMask;
DWORD vs_dwHandle;
};
static CStaticStackArray<VertexShader> _avsShaders;
// device type (HAL is default, REF is only for debuging)
extern const D3DDEVTYPE d3dDevType = D3DDEVTYPE_HAL;
// identity matrix
extern const D3DMATRIX GFX_d3dIdentityMatrix = {
1, 0, 0, 0,
0, 1, 0, 0,
0, 0, 1, 0,
0, 0, 0, 1 };
// sizes of vertex components
#define POSSIZE (4*sizeof(FLOAT))
#define NORSIZE (4*sizeof(FLOAT))
#define TEXSIZE (2*sizeof(FLOAT))
#define TX4SIZE (4*sizeof(FLOAT))
#define COLSIZE (4*sizeof(UBYTE))
#define IDXSIZE (1*sizeof(UWORD))
#define POSIDX (0)
#define COLIDX (1)
#define TEXIDX (2)
#define NORIDX (6)
// SHADER SETUP PARAMS
#define DECLTEXOFS (2*TEXIDX)
#define MAXSTREAMS (7L)
// template shader
DWORD _adwDeclTemplate[] = {
D3DVSD_STREAM(0),
D3DVSD_REG( D3DVSDE_POSITION, D3DVSDT_FLOAT3),
D3DVSD_STREAM(1),
D3DVSD_REG( D3DVSDE_DIFFUSE, D3DVSDT_D3DCOLOR),
D3DVSD_STREAM(2),
D3DVSD_REG( D3DVSDE_TEXCOORD0, D3DVSDT_FLOAT2),
D3DVSD_STREAM(3),
D3DVSD_REG( D3DVSDE_TEXCOORD1, D3DVSDT_FLOAT2),
D3DVSD_STREAM(4),
D3DVSD_REG( D3DVSDE_TEXCOORD2, D3DVSDT_FLOAT2),
D3DVSD_STREAM(5),
D3DVSD_REG( D3DVSDE_TEXCOORD3, D3DVSDT_FLOAT2),
D3DVSD_STREAM(6),
D3DVSD_REG( D3DVSDE_NORMAL, D3DVSDT_FLOAT3),
D3DVSD_END()
};
// current shader
DWORD _adwCurrentDecl[2*MAXSTREAMS+1];
// check whether texture format is supported in D3D
static BOOL HasTextureFormat_D3D( D3DFORMAT d3dTextureFormat)
{
// quickie?
const D3DFORMAT d3dScreenFormat = _pGfx->gl_d3dColorFormat;
if( d3dTextureFormat==D3DFMT_UNKNOWN || d3dScreenFormat==NONE) return TRUE;
// check
extern const D3DDEVTYPE d3dDevType;
HRESULT hr = _pGfx->gl_pD3D->CheckDeviceFormat( _pGfx->gl_iCurrentAdapter, d3dDevType, d3dScreenFormat,
0, D3DRTYPE_TEXTURE, d3dTextureFormat);
return( hr==D3D_OK);
}
#define VTXSIZE (POSSIZE + (_pGfx->gl_iMaxTessellationLevel>0 ? NORSIZE : 0) + TX4SIZE \
+ COLSIZE * _pGfx->gl_ctColBuffers \
+ TEXSIZE * (_pGfx->gl_ctTexBuffers-1))
// returns number of vertices based on vertex size and required size in memory (KB)
extern INDEX VerticesFromSize_D3D( SLONG &slSize)
{
slSize = Clamp( slSize, 64L, 4096L);
return (slSize*1024 / VTXSIZE);
}
// returns size in memory based on number of vertices
extern SLONG SizeFromVertices_D3D( INDEX ctVertices)
{
return (ctVertices * VTXSIZE);
}
// construct vertex shader out of streams' bit-mask
extern DWORD SetupShader_D3D( ULONG ulStreamsMask)
{
HRESULT hr;
const LPDIRECT3DDEVICE8 pd3dDev = _pGfx->gl_pd3dDevice;
const INDEX ctShaders = _avsShaders.Count();
INDEX iVS;
// delete all shaders?
if( ulStreamsMask==NONE) {
for( iVS=0; iVS<ctShaders; iVS++) {
hr = pd3dDev->DeleteVertexShader(_avsShaders[iVS].vs_dwHandle);
D3D_CHECKERROR(hr);
} // free array
_avsShaders.PopAll();
_dwCurrentVS = NONE;
return NONE;
}
// see if required shader has already been created
for( iVS=0; iVS<ctShaders; iVS++) {
if( _avsShaders[iVS].vs_ulMask==ulStreamsMask) return _avsShaders[iVS].vs_dwHandle;
}
// darn, need to create shader :(
VertexShader &vs = _avsShaders.Push();
vs.vs_ulMask = ulStreamsMask;
// pre-adjustment for eventual projective mapping
_adwDeclTemplate[DECLTEXOFS+1] = D3DVSD_REG( D3DVSDE_TEXCOORD0, (ulStreamsMask&0x1000) ? D3DVSDT_FLOAT4 : D3DVSDT_FLOAT2);
ulStreamsMask &= ~0x1000;
// process mask, bit by bit
INDEX iSrcDecl=0, iDstDecl=0;
while( iSrcDecl<MAXSTREAMS)
{ // add declarator if used
if( ulStreamsMask&1) {
_adwCurrentDecl[iDstDecl*2+0] = _adwDeclTemplate[iSrcDecl*2+0];
_adwCurrentDecl[iDstDecl*2+1] = _adwDeclTemplate[iSrcDecl*2+1];
iDstDecl++;
} // move to next declarator
iSrcDecl++;
ulStreamsMask >>= 1;
}
// mark end
_adwCurrentDecl[iDstDecl*2] = D3DVSD_END();
ASSERT( iDstDecl < MAXSTREAMS);
ASSERT( _iTexPass>=0 && _iColPass>=0);
ASSERT( _iVtxPos >=0 && _iVtxPos<65536);
// create new vertex shader
const DWORD dwFlags = (_pGfx->gl_ulFlags&GLF_D3D_USINGHWTNL) ? NONE : D3DUSAGE_SOFTWAREPROCESSING;
hr = pd3dDev->CreateVertexShader( &_adwCurrentDecl[0], NULL, &vs.vs_dwHandle, dwFlags);
D3D_CHECKERROR(hr);
// store and reset shader
_pGfx->gl_dwVertexShader = 0;
return vs.vs_dwHandle;
}
// prepare vertex arrays for drawing
extern void SetupVertexArrays_D3D( INDEX ctVertices)
{
INDEX i;
HRESULT hr;
ASSERT( ctVertices>=0);
// do nothing if buffer is sufficient
ctVertices = ClampUp( ctVertices, 65535L); // need to clamp max vertices first
if( ctVertices!=0 && ctVertices<=_pGfx->gl_ctVertices) return;
// determine SW or HW VP and NPatches usage (Truform)
DWORD dwFlags = D3DUSAGE_DYNAMIC|D3DUSAGE_WRITEONLY;
const BOOL bNPatches = (_pGfx->gl_iMaxTessellationLevel>0 && gap_iTruformLevel>0);
if( !(_pGfx->gl_ulFlags&GLF_D3D_USINGHWTNL)) dwFlags |= D3DUSAGE_SOFTWAREPROCESSING;
if( bNPatches) dwFlags |= D3DUSAGE_NPATCHES;
const LPDIRECT3DDEVICE8 pd3dDev = _pGfx->gl_pd3dDevice;
// deallocate if needed
if( _pGfx->gl_pd3dVtx!=NULL)
{
// vertex and eventual normal array
D3DRELEASE( _pGfx->gl_pd3dVtx, TRUE);
if( _pGfx->gl_pd3dNor!=NULL) D3DRELEASE( _pGfx->gl_pd3dNor, TRUE);
// color arrays
for( i=0; i<_pGfx->gl_ctColBuffers; i++) {
ASSERT( _pGfx->gl_pd3dCol[i]!=NULL);
D3DRELEASE( _pGfx->gl_pd3dCol[i], TRUE);
}
// texcoord arrays
for( i=0; i<_pGfx->gl_ctTexBuffers; i++) {
ASSERT( _pGfx->gl_pd3dTex[i]!=NULL);
D3DRELEASE( _pGfx->gl_pd3dTex[i], TRUE);
}
// reset all streams, too
for( i=0; i<_pGfx->gl_ctMaxStreams; i++) {
hr = pd3dDev->SetStreamSource( i, NULL,0);
D3D_CHECKERROR(hr);
}
}
// allocate if needed
if( ctVertices>0)
{
// update max vertex count
if( _pGfx->gl_ctVertices < ctVertices) _pGfx->gl_ctVertices = ctVertices;
else ctVertices = _pGfx->gl_ctVertices;
// create buffers
hr = pd3dDev->CreateVertexBuffer( ctVertices*POSSIZE, dwFlags, 0, D3DPOOL_DEFAULT, &_pGfx->gl_pd3dVtx);
D3D_CHECKERROR(hr);
// normals buffer only if required
if( bNPatches) {
hr = pd3dDev->CreateVertexBuffer( ctVertices*NORSIZE, dwFlags, 0, D3DPOOL_DEFAULT, &_pGfx->gl_pd3dNor);
D3D_CHECKERROR(hr);
}
// all color buffers
for( i=0; i<_pGfx->gl_ctColBuffers; i++) {
hr = pd3dDev->CreateVertexBuffer( ctVertices*COLSIZE, dwFlags, 0, D3DPOOL_DEFAULT, &_pGfx->gl_pd3dCol[i]);
D3D_CHECKERROR(hr);
}
// 1st texture buffer might have projective mapping
hr = pd3dDev->CreateVertexBuffer( ctVertices*TX4SIZE, dwFlags, 0, D3DPOOL_DEFAULT, &_pGfx->gl_pd3dTex[0]);
D3D_CHECKERROR(hr);
for( i=1; i<_pGfx->gl_ctTexBuffers; i++) {
hr = pd3dDev->CreateVertexBuffer( ctVertices*TEXSIZE, dwFlags, 0, D3DPOOL_DEFAULT, &_pGfx->gl_pd3dTex[i]);
D3D_CHECKERROR(hr);
}
}
// just switch it off if not needed any more (i.e. D3D is shutting down)
else _pGfx->gl_ctVertices = 0;
// reset and check
_iVtxOffset = 0;
_pGfx->gl_dwVertexShader = NONE;
_ulStreamsMask = NONE;
_ulLastStreamsMask = NONE;
_bProjectiveMapping = FALSE;
_bLastProjectiveMapping = FALSE;
// reset locking flags
_dwVtxLockFlags = D3DLOCK_DISCARD;
for( i=0; i<GFX_MAXLAYERS; i++) _dwColLockFlags[i] = _dwTexLockFlags[i] = D3DLOCK_DISCARD;
ASSERT(_pGfx->gl_ctVertices<65536);
}
// prepare index arrays for drawing
extern void SetupIndexArray_D3D( INDEX ctIndices)
{
HRESULT hr;
ASSERT( ctIndices>=0);
// clamp max indices
ctIndices = ClampUp( ctIndices, 65535L);
// do nothing if buffer is sufficient
if( ctIndices!=0 && ctIndices<=_pGfx->gl_ctIndices) return;
// determine SW or HW VP
DWORD dwFlags = D3DUSAGE_DYNAMIC|D3DUSAGE_WRITEONLY;
if( !(_pGfx->gl_ulFlags&GLF_D3D_USINGHWTNL)) dwFlags |= D3DUSAGE_SOFTWAREPROCESSING;
if( _pGfx->gl_iMaxTessellationLevel>0 && gap_iTruformLevel>0) dwFlags |= D3DUSAGE_NPATCHES;
const LPDIRECT3DDEVICE8 pd3dDev = _pGfx->gl_pd3dDevice;
// dealocate if needed
if( _pGfx->gl_ctIndices>0) D3DRELEASE( _pGfx->gl_pd3dIdx, TRUE);
// allocate if needed
if( ctIndices>0)
{
// eventually update max index count
if( _pGfx->gl_ctIndices < ctIndices) _pGfx->gl_ctIndices = ctIndices;
else ctIndices = _pGfx->gl_ctIndices;
// create buffer
hr = pd3dDev->CreateIndexBuffer( ctIndices*IDXSIZE, dwFlags, D3DFMT_INDEX16, D3DPOOL_DEFAULT, &_pGfx->gl_pd3dIdx);
D3D_CHECKERROR(hr);
// set it
hr = _pGfx->gl_pd3dDevice->SetIndices( _pGfx->gl_pd3dIdx, 0);
D3D_CHECKERROR(hr);
}
// just switch it off if not needed any more (i.e. D3D is shutting down)
else _pGfx->gl_ctIndices = 0;
// reset and check
_iIdxOffset = 0;
ASSERT(_pGfx->gl_ctIndices<65536);
}
// initialize Direct3D driver
BOOL CGfxLibrary::InitDriver_D3D(void)
{
// check for presence of DirectX 8
gl_hiDriver = LoadLibraryA( "D3D8.DLL");
if( gl_hiDriver==NONE) {
// not present - BUAHHAHAHAHAR :)
CPrintF( "DX8 error: API not installed.\n");
gl_gaAPI[GAT_D3D].ga_ctAdapters = 0;
return FALSE;
}
// query DX8 interface
IDirect3D8* (WINAPI *pDirect3DCreate8)(UINT SDKVersion);
pDirect3DCreate8 = (IDirect3D8* (WINAPI *)(UINT SDKVersion))GetProcAddress( gl_hiDriver, "Direct3DCreate8");
if( pDirect3DCreate8==NULL) {
// cannot init
CPrintF( "DX8 error: Cannot get entry procedure address.\n");
FreeLibrary(gl_hiDriver);
gl_hiDriver = NONE;
return FALSE;
}
// init DX8
gl_pD3D = pDirect3DCreate8(D3D_SDK_VERSION);
if( gl_pD3D==NULL) {
// cannot start
CPrintF( "DX8 error: Cannot be initialized.\n");
FreeLibrary(gl_hiDriver);
gl_hiDriver = NONE;
return FALSE;
}
// made it!
return TRUE;
}
// initialize Direct3D driver
void CGfxLibrary::EndDriver_D3D(void)
{
// unbind textures
if( _pTextureStock!=NULL) {
{FOREACHINDYNAMICCONTAINER( _pTextureStock->st_ctObjects, CTextureData, ittd) {
CTextureData &td = *ittd;
td.td_tpLocal.Clear();
td.Unbind();
}}
}
// unbind fog, haze and flat texture
gfxDeleteTexture( _fog_ulTexture);
gfxDeleteTexture( _haze_ulTexture);
ASSERT( _ptdFlat!=NULL);
_ptdFlat->td_tpLocal.Clear();
_ptdFlat->Unbind();
// reset shader and vertices
SetupShader_D3D(NONE);
SetupVertexArrays_D3D(0);
SetupIndexArray_D3D(0);
gl_d3dColorFormat = (D3DFORMAT)NONE;
gl_d3dDepthFormat = (D3DFORMAT)NONE;
// shutdown device and d3d
INDEX iRef;
iRef = gl_pd3dDevice->Release();
iRef = gl_pD3D->Release();
}
// prepare current viewport for rendering thru Direct3D
BOOL CGfxLibrary::SetCurrentViewport_D3D(CViewPort *pvp)
{
// determine full screen mode
CDisplayMode dm;
RECT rectWindow;
_pGfx->GetCurrentDisplayMode(dm);
ASSERT( (dm.dm_pixSizeI==0 && dm.dm_pixSizeJ==0) || (dm.dm_pixSizeI!=0 && dm.dm_pixSizeJ!=0));
GetClientRect( pvp->vp_hWnd, &rectWindow);
const PIX pixWinSizeI = rectWindow.right - rectWindow.left;
const PIX pixWinSizeJ = rectWindow.bottom - rectWindow.top;
// full screen allows only one window (main one, which has already been initialized)
if( dm.dm_pixSizeI==pixWinSizeI && dm.dm_pixSizeJ==pixWinSizeJ) {
gl_pvpActive = pvp; // remember as current viewport (must do that BEFORE InitContext)
if( gl_ulFlags & GLF_INITONNEXTWINDOW) InitContext_D3D();
gl_ulFlags &= ~GLF_INITONNEXTWINDOW;
return TRUE;
}
// if must init entire D3D
if( gl_ulFlags & GLF_INITONNEXTWINDOW) {
gl_ulFlags &= ~GLF_INITONNEXTWINDOW;
// reopen window
pvp->CloseCanvas();
pvp->OpenCanvas();
gl_pvpActive = pvp;
InitContext_D3D();
pvp->vp_ctDisplayChanges = gl_ctDriverChanges;
return TRUE;
}
// if window was not set for this driver
if( pvp->vp_ctDisplayChanges<gl_ctDriverChanges) {
// reopen window
pvp->CloseCanvas();
pvp->OpenCanvas();
pvp->vp_ctDisplayChanges = gl_ctDriverChanges;
gl_pvpActive = pvp;
return TRUE;
}
// no need to set context if it is the same window as last time
if( gl_pvpActive!=NULL && gl_pvpActive->vp_hWnd==pvp->vp_hWnd) return TRUE;
// set rendering target
HRESULT hr;
LPDIRECT3DSURFACE8 pColorSurface;
hr = pvp->vp_pSwapChain->GetBackBuffer( 0, D3DBACKBUFFER_TYPE_MONO, &pColorSurface);
if( hr!=D3D_OK) return FALSE;
hr = gl_pd3dDevice->SetRenderTarget( pColorSurface, pvp->vp_pSurfDepth);
D3DRELEASE( pColorSurface, TRUE);
if( hr!=D3D_OK) return FALSE;
// remember as current window
gl_pvpActive = pvp;
return TRUE;
}
// prepares Direct3D drawing context
void CGfxLibrary::InitContext_D3D()
{
// must have context
ASSERT( gl_pvpActive!=NULL);
// report header
CPrintF( TRANS("\n* Direct3D context created: *----------------------------------\n"));
CDisplayAdapter &da = gl_gaAPI[GAT_D3D].ga_adaAdapter[gl_iCurrentAdapter];
CPrintF( " (%s, %s, %s)\n\n", da.da_strVendor, da.da_strRenderer, da.da_strVersion);
HRESULT hr;
// reset engine's internal Direct3D state variables
GFX_bTruform = FALSE;
GFX_bClipping = TRUE;
GFX_bFrontFace = TRUE;
hr = gl_pd3dDevice->SetRenderState( D3DRS_ZENABLE, D3DZB_FALSE); D3D_CHECKERROR(hr); GFX_bDepthTest = FALSE;
hr = gl_pd3dDevice->SetRenderState( D3DRS_ZWRITEENABLE, FALSE); D3D_CHECKERROR(hr); GFX_bDepthWrite = FALSE;
hr = gl_pd3dDevice->SetRenderState( D3DRS_ALPHATESTENABLE, FALSE); D3D_CHECKERROR(hr); GFX_bAlphaTest = FALSE;
hr = gl_pd3dDevice->SetRenderState( D3DRS_ALPHABLENDENABLE, FALSE); D3D_CHECKERROR(hr); GFX_bBlending = FALSE;
hr = gl_pd3dDevice->SetRenderState( D3DRS_DITHERENABLE, TRUE); D3D_CHECKERROR(hr); GFX_bDithering = TRUE;
hr = gl_pd3dDevice->SetRenderState( D3DRS_CLIPPLANEENABLE, FALSE); D3D_CHECKERROR(hr); GFX_bClipPlane = FALSE;
hr = gl_pd3dDevice->SetRenderState( D3DRS_CULLMODE, D3DCULL_NONE); D3D_CHECKERROR(hr); GFX_eCullFace = GFX_NONE;
hr = gl_pd3dDevice->SetRenderState( D3DRS_ZFUNC, D3DCMP_LESSEQUAL); D3D_CHECKERROR(hr); GFX_eDepthFunc = GFX_LESS_EQUAL;
hr = gl_pd3dDevice->SetRenderState( D3DRS_SRCBLEND, D3DBLEND_ONE); D3D_CHECKERROR(hr); GFX_eBlendSrc = GFX_ONE;
hr = gl_pd3dDevice->SetRenderState( D3DRS_DESTBLEND, D3DBLEND_ONE); D3D_CHECKERROR(hr); GFX_eBlendDst = GFX_ONE;
// (re)set some D3D defaults
hr = gl_pd3dDevice->SetRenderState( D3DRS_ALPHAFUNC, D3DCMP_GREATEREQUAL); D3D_CHECKERROR(hr);
hr = gl_pd3dDevice->SetRenderState( D3DRS_ALPHAREF, 128); D3D_CHECKERROR(hr);
// constant color default setup
hr = gl_pd3dDevice->SetRenderState( D3DRS_COLORVERTEX, FALSE); D3D_CHECKERROR(hr);
hr = gl_pd3dDevice->SetRenderState( D3DRS_LIGHTING, TRUE); D3D_CHECKERROR(hr);
hr = gl_pd3dDevice->SetRenderState( D3DRS_AMBIENT, 0xFFFFFFFF); D3D_CHECKERROR(hr);
D3DMATERIAL8 d3dMaterial;
memset( &d3dMaterial, 0, sizeof(d3dMaterial));
d3dMaterial.Diffuse.r = d3dMaterial.Ambient.r = 1.0f;
d3dMaterial.Diffuse.g = d3dMaterial.Ambient.g = 1.0f;
d3dMaterial.Diffuse.b = d3dMaterial.Ambient.b = 1.0f;
d3dMaterial.Diffuse.a = d3dMaterial.Ambient.a = 1.0f;
hr = gl_pd3dDevice->SetMaterial(&d3dMaterial);
D3D_CHECKERROR(hr);
GFX_bColorArray = FALSE;
// disable texturing
extern BOOL GFX_abTexture[GFX_MAXTEXUNITS];
for( INDEX iUnit=0; iUnit<GFX_MAXTEXUNITS; iUnit++) {
GFX_abTexture[iUnit] = FALSE;
GFX_iTexModulation[iUnit] = 1;
hr = gl_pd3dDevice->SetTexture( iUnit, NULL); D3D_CHECKERROR(hr);
hr = gl_pd3dDevice->SetTextureStageState( iUnit, D3DTSS_COLOROP, D3DTOP_DISABLE); D3D_CHECKERROR(hr);
hr = gl_pd3dDevice->SetTextureStageState( iUnit, D3DTSS_ALPHAOP, D3DTOP_MODULATE); D3D_CHECKERROR(hr);
}
// set default texture unit and modulation mode
GFX_iActiveTexUnit = 0;
// reset frustum/ortho matrix
extern BOOL GFX_bViewMatrix;
extern FLOAT GFX_fLastL, GFX_fLastR, GFX_fLastT, GFX_fLastB, GFX_fLastN, GFX_fLastF;
GFX_fLastL = GFX_fLastR = GFX_fLastT = GFX_fLastB = GFX_fLastN = GFX_fLastF = 0;
GFX_bViewMatrix = TRUE;
// reset depth range
D3DVIEWPORT8 d3dViewPort = { 0,0, 8,8, 0,1 };
hr = gl_pd3dDevice->SetViewport( &d3dViewPort); D3D_CHECKERROR(hr);
hr = gl_pd3dDevice->GetViewport( &d3dViewPort); D3D_CHECKERROR(hr);
ASSERT( d3dViewPort.MinZ==0 && d3dViewPort.MaxZ==1);
GFX_fMinDepthRange = 0.0f;
GFX_fMaxDepthRange = 1.0f;
// get capabilites
D3DCAPS8 d3dCaps;
hr = gl_pd3dDevice->GetDeviceCaps( &d3dCaps);
D3D_CHECKERROR(hr);
// determine rasterizer acceleration
gl_ulFlags &= ~GLF_HASACCELERATION;
if( (d3dCaps.DevCaps & D3DDEVCAPS_HWRASTERIZATION)
|| d3dDevType==D3DDEVTYPE_REF) gl_ulFlags |= GLF_HASACCELERATION;
// determine support for 32-bit textures
gl_ulFlags &= ~GLF_32BITTEXTURES;
if( HasTextureFormat_D3D(D3DFMT_X8R8G8B8)
|| HasTextureFormat_D3D(D3DFMT_A8R8G8B8)) gl_ulFlags |= GLF_32BITTEXTURES;
// determine support for compressed textures
gl_ulFlags &= ~GLF_TEXTURECOMPRESSION;
if( HasTextureFormat_D3D(D3DFMT_DXT1)) gl_ulFlags |= GLF_TEXTURECOMPRESSION;
// determine max supported dimension of texture
gl_pixMaxTextureDimension = d3dCaps.MaxTextureWidth;
ASSERT( gl_pixMaxTextureDimension == d3dCaps.MaxTextureHeight); // perhaps not ?
// determine support for disabling of color buffer writes
gl_ulFlags &= ~GLF_D3D_COLORWRITES;
if( d3dCaps.PrimitiveMiscCaps & D3DPMISCCAPS_COLORWRITEENABLE) gl_ulFlags |= GLF_D3D_COLORWRITES;
// determine support for custom clip planes
gl_ulFlags &= ~GLF_D3D_CLIPPLANE;
if( d3dCaps.MaxUserClipPlanes>0) gl_ulFlags |= GLF_D3D_CLIPPLANE;
else CPrintF( TRANS("User clip plane not supported - mirrors will not work well.\n"));
// determine support for texture LOD biasing
gl_fMaxTextureLODBias = 0.0f;
if( d3dCaps.RasterCaps & D3DPRASTERCAPS_MIPMAPLODBIAS) {
gl_fMaxTextureLODBias = 4.0f;
}
// determine support for anisotropic filtering
gl_iMaxTextureAnisotropy = 1;
if( d3dCaps.RasterCaps & D3DPRASTERCAPS_ANISOTROPY) {
gl_iMaxTextureAnisotropy = d3dCaps.MaxAnisotropy;
ASSERT( gl_iMaxTextureAnisotropy>1);
}
// determine support for z-biasing
gl_ulFlags &= ~GLF_D3D_ZBIAS;
if( d3dCaps.RasterCaps & D3DPRASTERCAPS_ZBIAS) gl_ulFlags |= GLF_D3D_ZBIAS;
// check support for vsync swapping
gl_ulFlags &= ~GLF_VSYNC;
if( d3dCaps.PresentationIntervals & D3DPRESENT_INTERVAL_IMMEDIATE) {
if( d3dCaps.PresentationIntervals & D3DPRESENT_INTERVAL_ONE) gl_ulFlags |= GLF_VSYNC;
} else CPrintF( TRANS(" Vertical syncronization cannot be disabled.\n"));
// determine support for N-Patches
extern INDEX truform_iLevel;
extern BOOL truform_bLinear;
truform_iLevel = -1;
truform_bLinear = FALSE;
gl_iTessellationLevel = 0;
gl_iMaxTessellationLevel = 0;
INDEX ctMinStreams = GFX_MINSTREAMS; // set minimum number of required streams
if( d3dCaps.DevCaps & D3DDEVCAPS_NPATCHES) {
if( gl_ctMaxStreams>GFX_MINSTREAMS) {
gl_iMaxTessellationLevel = 7;
hr = gl_pd3dDevice->SetRenderState( D3DRS_PATCHEDGESTYLE, D3DPATCHEDGE_DISCRETE);
D3D_CHECKERROR(hr);
ctMinStreams++; // need an extra stream for normals now
} else CPrintF( TRANS("Not enough streams - N-Patches cannot be used.\n"));
}
// determine support for multi-texturing (only if Modulate2X mode is supported!)
gl_ctTextureUnits = 1;
gl_ctRealTextureUnits = d3dCaps.MaxSimultaneousTextures;
if( gl_ctRealTextureUnits>1) {
// check everything that is required for multi-texturing
if( !(d3dCaps.TextureOpCaps&D3DTOP_MODULATE2X)) CPrintF( TRANS("Texture operation MODULATE2X missing - multi-texturing cannot be used.\n"));
else if( gl_ctMaxStreams<=ctMinStreams) CPrintF( TRANS("Not enough streams - multi-texturing cannot be used.\n"));
else gl_ctTextureUnits = Min( GFX_MAXTEXUNITS, Min( gl_ctRealTextureUnits, 1+gl_ctMaxStreams-ctMinStreams));
}
// setup fog and haze textures
extern PIX _fog_pixSizeH;
extern PIX _fog_pixSizeL;
extern PIX _haze_pixSize;
_fog_ulTexture = NONE;
_haze_ulTexture = NONE;
_fog_pixSizeH = 0;
_fog_pixSizeL = 0;
_haze_pixSize = 0;
// prepare pattern texture
extern CTexParams _tpPattern;
extern ULONG _ulPatternTexture;
extern ULONG _ulLastUploadedPattern;
_ulPatternTexture = NONE;
_ulLastUploadedPattern = 0;
_tpPattern.Clear();
// determine number of color/texcoord buffers
gl_ctTexBuffers = gl_ctTextureUnits;
gl_ctColBuffers = 1;
INDEX ctStreamsRemain = gl_ctMaxStreams - (ctMinStreams-1+gl_ctTextureUnits); // -1 because of 1 texture unit inside MinStreams
FOREVER {
// done if no more or enough streams
if( ctStreamsRemain==0 || (gl_ctTexBuffers==GFX_MAXLAYERS && gl_ctColBuffers==GFX_MAXLAYERS)) break;
// increase number of tex or color buffers
if( gl_ctColBuffers<gl_ctTexBuffers) gl_ctColBuffers++;
else gl_ctTexBuffers++;
// next stream (if available)
ctStreamsRemain--;
}
// prepare vertex arrays
gl_pd3dIdx = NULL;
gl_pd3dVtx = NULL;
gl_pd3dNor = NULL;
INDEX i=0;
for( ; i<GFX_MAXLAYERS; i++) gl_pd3dCol[i] = gl_pd3dTex[i] = NULL;
ASSERT( gl_ctTexBuffers>0 && gl_ctTexBuffers<=GFX_MAXLAYERS);
ASSERT( gl_ctColBuffers>0 && gl_ctColBuffers<=GFX_MAXLAYERS);
gl_ctVertices = 0;
gl_ctIndices = 0;
extern INDEX d3d_iVertexBuffersSize;
extern INDEX _iLastVertexBufferSize;
const INDEX ctVertices = VerticesFromSize_D3D(d3d_iVertexBuffersSize);
_iLastVertexBufferSize = d3d_iVertexBuffersSize;
SetupVertexArrays_D3D(ctVertices);
SetupIndexArray_D3D(2*ctVertices);
// reset texture filtering and some static vars
_tpGlobal[0].Clear();
_tpGlobal[1].Clear();
_tpGlobal[2].Clear();
_tpGlobal[3].Clear();
_avsShaders.Clear();
_iVtxOffset = 0;
_iIdxOffset = 0;
_dwCurrentVS = NONE;
_ulStreamsMask = NONE;
_ulLastStreamsMask = NONE;
_bProjectiveMapping = FALSE;
_bLastProjectiveMapping = FALSE;
gl_dwVertexShader = NONE;
GFX_ctVertices = 0;
// reset locking flags
_dwVtxLockFlags = D3DLOCK_DISCARD;
for( i=0; i<GFX_MAXLAYERS; i++) _dwColLockFlags[i] = _dwTexLockFlags[i] = D3DLOCK_DISCARD;
// set default texture filtering/biasing
extern INDEX gap_iTextureFiltering;
extern INDEX gap_iTextureAnisotropy;
extern FLOAT gap_fTextureLODBias;
gfxSetTextureFiltering( gap_iTextureFiltering, gap_iTextureAnisotropy);
gfxSetTextureBiasing( gap_fTextureLODBias);
// mark pretouching and probing
extern BOOL _bNeedPretouch;
_bNeedPretouch = TRUE;
gl_bAllowProbing = FALSE;
// update console system vars
extern void UpdateGfxSysCVars(void);
UpdateGfxSysCVars();
// reload all loaded textures and eventually shadowmaps
extern INDEX shd_bCacheAll;
extern void ReloadTextures(void);
extern void CacheShadows(void);
ReloadTextures();
if( shd_bCacheAll) CacheShadows();
}
// find depth buffer format (for specified color format) that closest matches required bit depth
static D3DFORMAT FindDepthFormat_D3D( INDEX iAdapter, D3DFORMAT d3dfColor, INDEX &iDepthBits)
{
// safeties
ASSERT( iDepthBits==0 || iDepthBits==16 || iDepthBits==24 || iDepthBits==32);
ASSERT( d3dfColor==D3DFMT_R5G6B5 || d3dfColor==D3DFMT_X8R8G8B8);
// adjust required Z-depth from color depth if needed
if( iDepthBits==0 && d3dfColor==D3DFMT_R5G6B5) iDepthBits = 16;
else if( iDepthBits==0 && d3dfColor==D3DFMT_X8R8G8B8) iDepthBits = 32;
// determine closest z-depth
D3DFORMAT ad3dFormats[] = { D3DFMT_D32, // 32-bits
D3DFMT_D24X8, D3DFMT_D24S8, D3DFMT_D24X4S4, // 24-bits
D3DFMT_D16, D3DFMT_D15S1, D3DFMT_D16_LOCKABLE }; // 16-bits
const INDEX ctFormats = sizeof(ad3dFormats) / sizeof(ad3dFormats[0]);
// find starting point from which format to search for support
INDEX iStart;
if( iDepthBits==32) iStart = 0;
else if( iDepthBits==24) iStart = 1;
else iStart = 4;
// search
INDEX i;
HRESULT hr;
for( i=iStart; i<ctFormats; i++) {
hr = _pGfx->gl_pD3D->CheckDepthStencilMatch( iAdapter, d3dDevType, d3dfColor, d3dfColor, ad3dFormats[i]);
if( hr==D3D_OK) break;
}
// not found?
if( i==ctFormats) {
// do additional check for whole format list
for( i=0; i<iStart; i++) {
hr = _pGfx->gl_pD3D->CheckDepthStencilMatch( iAdapter, d3dDevType, d3dfColor, d3dfColor, ad3dFormats[i]);
if( hr==D3D_OK) break;
}
// what, z-buffer still not supported?
if( i==iStart) {
ASSERT( "FindDepthFormat_D3D: Z-buffer format not found?!" );
iDepthBits = 0;
return D3DFMT_UNKNOWN;
}
}
// aaaah, found! :)
ASSERT( i>=0 && i<ctFormats);
if( i>3) iDepthBits = 16;
else if( i>0) iDepthBits = 24;
else iDepthBits = 32;
return ad3dFormats[i];
}
// prepare display mode
BOOL CGfxLibrary::InitDisplay_D3D( INDEX iAdapter, PIX pixSizeI, PIX pixSizeJ,
enum DisplayDepth eColorDepth)
{
// reset
HRESULT hr;
D3DDISPLAYMODE d3dDisplayMode;
D3DPRESENT_PARAMETERS d3dPresentParams;
gl_pD3D->GetAdapterDisplayMode( iAdapter, &d3dDisplayMode);
memset( &d3dPresentParams, 0, sizeof(d3dPresentParams));
// readout device capabilites
D3DCAPS8 d3dCaps;
hr = gl_pD3D->GetDeviceCaps( iAdapter, d3dDevType, &d3dCaps);
D3D_CHECKERROR(hr);
// clamp depth/stencil values
extern INDEX gap_iDepthBits;
extern INDEX gap_iStencilBits;
if( gap_iDepthBits <12) gap_iDepthBits = 0;
else if( gap_iDepthBits <22) gap_iDepthBits = 16;
else if( gap_iDepthBits <28) gap_iDepthBits = 24;
else gap_iDepthBits = 32;
if( gap_iStencilBits<3) gap_iStencilBits = 0;
else if( gap_iStencilBits<7) gap_iStencilBits = 4;
else gap_iStencilBits = 8;
// prepare
INDEX iZDepth = gap_iDepthBits;
D3DFORMAT d3dDepthFormat = D3DFMT_UNKNOWN;
D3DFORMAT d3dColorFormat = d3dDisplayMode.Format;
d3dPresentParams.BackBufferCount = 1;
d3dPresentParams.MultiSampleType = D3DMULTISAMPLE_NONE; // !!!! TODO
d3dPresentParams.Flags = D3DPRESENTFLAG_LOCKABLE_BACKBUFFER;
d3dPresentParams.SwapEffect = D3DSWAPEFFECT_DISCARD;
const BOOL bFullScreen = (pixSizeI>0 && pixSizeJ>0);
// setup for full screen
if( bFullScreen) {
// determine color and depth format
if( eColorDepth==DD_16BIT) d3dColorFormat = D3DFMT_R5G6B5;
if( eColorDepth==DD_32BIT) d3dColorFormat = D3DFMT_X8R8G8B8;
d3dDepthFormat = FindDepthFormat_D3D( iAdapter, d3dColorFormat, iZDepth);
// determine refresh rate and presentation interval
extern INDEX gap_iRefreshRate;
const UINT uiRefresh = gap_iRefreshRate>0 ? gap_iRefreshRate : D3DPRESENT_RATE_DEFAULT;
const SLONG slIntervals = d3dCaps.PresentationIntervals;
UINT uiInterval = (slIntervals&D3DPRESENT_INTERVAL_IMMEDIATE) ? D3DPRESENT_INTERVAL_IMMEDIATE : D3DPRESENT_INTERVAL_ONE;
extern INDEX gap_iSwapInterval;
switch(gap_iSwapInterval) {
case 1: if( slIntervals&D3DPRESENT_INTERVAL_ONE) uiInterval=D3DPRESENT_INTERVAL_ONE; break;
case 2: if( slIntervals&D3DPRESENT_INTERVAL_TWO) uiInterval=D3DPRESENT_INTERVAL_TWO; break;
case 3: if( slIntervals&D3DPRESENT_INTERVAL_THREE) uiInterval=D3DPRESENT_INTERVAL_THREE; break;
case 4: if( slIntervals&D3DPRESENT_INTERVAL_FOUR) uiInterval=D3DPRESENT_INTERVAL_FOUR; break;
default: break;
} // construct back cvar
switch(uiInterval) {
case 1: gap_iSwapInterval=1; break;
case 2: gap_iSwapInterval=2; break;
case 3: gap_iSwapInterval=3; break;
case 4: gap_iSwapInterval=4; break;
default: gap_iSwapInterval=0; break;
} gl_iSwapInterval = gap_iSwapInterval; // copy to gfx lib
// set context directly to main window
d3dPresentParams.Windowed = FALSE;
d3dPresentParams.BackBufferWidth = pixSizeI;
d3dPresentParams.BackBufferHeight = pixSizeJ;
d3dPresentParams.BackBufferFormat = d3dColorFormat;
d3dPresentParams.EnableAutoDepthStencil = TRUE;
d3dPresentParams.AutoDepthStencilFormat = d3dDepthFormat;
d3dPresentParams.FullScreen_RefreshRateInHz = uiRefresh;
d3dPresentParams.FullScreen_PresentationInterval = uiInterval;
}
// setup for windowed mode
else {
// create dummy Direct3D context
d3dPresentParams.Windowed = TRUE;
d3dPresentParams.BackBufferWidth = 8;
d3dPresentParams.BackBufferHeight = 8;
d3dPresentParams.BackBufferFormat = d3dColorFormat;
d3dPresentParams.EnableAutoDepthStencil = FALSE;
d3dDepthFormat = FindDepthFormat_D3D( iAdapter, d3dColorFormat, iZDepth);
gl_iSwapInterval = -1;
}
// determine HW or SW vertex processing
DWORD dwVP = D3DCREATE_SOFTWARE_VERTEXPROCESSING;
gl_ulFlags &= ~(GLF_D3D_HASHWTNL|GLF_D3D_USINGHWTNL);
gl_ctMaxStreams = 16; // software T&L has enough streams
extern INDEX d3d_bUseHardwareTnL;
// cannot have HW VP if not supported by HW, right?
if( d3dCaps.DevCaps & D3DDEVCAPS_HWTRANSFORMANDLIGHT) {
gl_ulFlags |= GLF_D3D_HASHWTNL;
gl_ctMaxStreams = d3dCaps.MaxStreams;
if( gl_ctMaxStreams<GFX_MINSTREAMS) d3d_bUseHardwareTnL = 0; // cannot use HW T&L if not enough streams
if( d3d_bUseHardwareTnL) {
d3d_bUseHardwareTnL = 1; // clamp just in case
dwVP = D3DCREATE_HARDWARE_VERTEXPROCESSING;
gl_ulFlags |= GLF_D3D_USINGHWTNL;
} // no HW T&L
} else d3d_bUseHardwareTnL = 0;
// go for it ...
extern HWND _hwndMain;
extern const D3DDEVTYPE d3dDevType;
hr = gl_pD3D->CreateDevice( iAdapter, d3dDevType, _hwndMain, dwVP, &d3dPresentParams, &gl_pd3dDevice);
if( hr!=D3D_OK) return FALSE;
gl_d3dColorFormat = d3dColorFormat;
gl_d3dDepthFormat = d3dDepthFormat;
gl_iCurrentDepth = iZDepth;
return TRUE;
}
// fallback D3D internal format
// (reverts to next format that closely matches requied one)
static D3DFORMAT FallbackFormat_D3D( D3DFORMAT eFormat, BOOL b2ndTry)
{
switch( eFormat) {
case D3DFMT_X8R8G8B8: return !b2ndTry ? D3DFMT_A8R8G8B8 : D3DFMT_R5G6B5;
case D3DFMT_X1R5G5B5: return !b2ndTry ? D3DFMT_R5G6B5 : D3DFMT_A1R5G5B5;
case D3DFMT_X4R4G4B4: return !b2ndTry ? D3DFMT_R5G6B5 : D3DFMT_A1R5G5B5;
case D3DFMT_R5G6B5: return !b2ndTry ? D3DFMT_X1R5G5B5 : D3DFMT_A1R5G5B5;
case D3DFMT_L8: return !b2ndTry ? D3DFMT_A8L8 : D3DFMT_X8R8G8B8;
case D3DFMT_A8L8: return D3DFMT_A8R8G8B8;
case D3DFMT_A1R5G5B5: return D3DFMT_A4R4G4B4;
case D3DFMT_A8R8G8B8: return D3DFMT_A4R4G4B4;
case D3DFMT_DXT1: return D3DFMT_A1R5G5B5;
case D3DFMT_DXT3: return D3DFMT_A4R4G4B4;
case D3DFMT_DXT5: return D3DFMT_A4R4G4B4;
case D3DFMT_A4R4G4B4: // must have this one!
default: ASSERTALWAYS( "Can't fallback texture format.");
} // missed!
return D3DFMT_UNKNOWN;
}
// find closest
extern D3DFORMAT FindClosestFormat_D3D( D3DFORMAT d3df)
{
FOREVER {
if( HasTextureFormat_D3D(d3df)) return d3df;
D3DFORMAT d3df2 = FallbackFormat_D3D( d3df, FALSE);
if( HasTextureFormat_D3D(d3df2)) return d3df2;
d3df = FallbackFormat_D3D( d3df, TRUE);
}
}
// VERTEX/INDEX BUFFERS SUPPORT THRU STREAMS
// DEBUG helper
static void CheckStreams(void)
{
UINT uiRet, ui;
INDEX iRef, iPass;
DWORD dwVS;
HRESULT hr;
LPDIRECT3DVERTEXBUFFER8 pVBRet, pVB;
LPDIRECT3DINDEXBUFFER8 pIBRet;
const LPDIRECT3DDEVICE8 pd3dDev = _pGfx->gl_pd3dDevice;
// check passes and buffer position
ASSERT( _iTexPass>=0 && _iColPass>=0);
ASSERT( _iVtxPos >=0 && _iVtxPos<65536);
// check vertex positions
ASSERT( _ulStreamsMask & (1<<POSIDX)); // must be in shader!
hr = pd3dDev->GetStreamSource( POSIDX, &pVBRet, &uiRet);
D3D_CHECKERROR(hr);
ASSERT( pVBRet!=NULL);
iRef = pVBRet->Release();
ASSERT( iRef==1 && pVBRet==_pGfx->gl_pd3dVtx && uiRet==POSSIZE);
// check normals
pVB = NULL;
ui = NORSIZE;
hr = pd3dDev->GetStreamSource( NORIDX, &pVBRet, &uiRet);
D3D_CHECKERROR(hr);
if( pVBRet!=NULL) iRef = pVBRet->Release();
if( _ulStreamsMask & (1<<NORIDX)) pVB = _pGfx->gl_pd3dNor;
ASSERT( iRef==1 && pVBRet==pVB && (uiRet==ui || uiRet==0));
// check colors
pVB = NULL;
ui = COLSIZE;
hr = pd3dDev->GetStreamSource( COLIDX, &pVBRet, &uiRet);
D3D_CHECKERROR(hr);
if( pVBRet!=NULL) iRef = pVBRet->Release();
if( _ulStreamsMask & (1<<COLIDX)) {
iPass = (_iColPass-1) % _pGfx->gl_ctColBuffers;
pVB = _pGfx->gl_pd3dCol[iPass];
}
ASSERT( iRef==1 && pVBRet==pVB && (uiRet==ui || uiRet==0));
// check 1st texture coords
pVB = NULL;
ui = _bProjectiveMapping ? TX4SIZE : TEXSIZE;
hr = pd3dDev->GetStreamSource( TEXIDX, &pVBRet, &uiRet);
D3D_CHECKERROR(hr);
if( pVBRet!=NULL) iRef = pVBRet->Release();
if( _ulStreamsMask & (1<<(TEXIDX))) {
iPass = (_iTexPass-1) % _pGfx->gl_ctTexBuffers;
pVB = _pGfx->gl_pd3dTex[iPass];
}
ASSERT( iRef==1 && pVBRet==pVB && (uiRet==ui || uiRet==0));
// check indices
hr = pd3dDev->GetIndices( &pIBRet, &uiRet);
D3D_CHECKERROR(hr);
ASSERT( pIBRet!=NULL);
iRef = pIBRet->Release();
ASSERT( iRef==1 && pIBRet==_pGfx->gl_pd3dIdx && uiRet==0);
// check shader
hr = pd3dDev->GetVertexShader( &dwVS);
D3D_CHECKERROR(hr);
ASSERT( dwVS!=NONE && dwVS==_pGfx->gl_dwVertexShader);
/* check shader declaration (SEEMS LIKE THIS SHIT DOESN'T WORK!)
const INDEX ctMaxDecls = 2*MAXSTREAMS+1;
INDEX ctDecls = ctMaxDecls;
DWORD adwDeclRet[ctMaxDecls];
hr = pd3dDev->GetVertexShaderDeclaration( _pGfx->gl_dwVertexShader, (void*)&adwDeclRet[0], (DWORD*)&ctDecls);
D3D_CHECKERROR(hr);
ASSERT( ctDecls>0 && ctDecls<ctMaxDecls);
INDEX iRet = memcmp( &adwDeclRet[0], &_adwCurrentDecl[0], ctDecls*sizeof(DWORD));
ASSERT( iRet==0); */
}
// prepare vertex array for D3D (type 0=vtx, 1=nor, 2=col, 3=tex, 4=projtex)
extern void SetVertexArray_D3D( INDEX iType, ULONG *pulVtx)
{
HRESULT hr;
SLONG slStride;
DWORD dwLockFlag;
INDEX iStream, iThisPass;
INDEX ctLockSize, iLockOffset;
LPDIRECT3DVERTEXBUFFER8 pd3dVB;
ASSERT( _iTexPass>=0 && _iColPass>=0);
ASSERT( _iVtxPos >=0 && _iVtxPos<65536);
const BOOL bHWTnL = _pGfx->gl_ulFlags & GLF_D3D_USINGHWTNL;
// determine which buffer we work on
switch(iType)
{
// VERTICES
case 0:
// make sure that we have enough space in vertex buffers
ASSERT(GFX_ctVertices>0);
SetupVertexArrays_D3D( GFX_ctVertices * (bHWTnL?2:1));
// determine lock type
pd3dVB = _pGfx->gl_pd3dVtx;
if( !bHWTnL || (_iVtxOffset+GFX_ctVertices)>=_pGfx->gl_ctVertices) {
// reset pos and flags
_iVtxOffset = 0;
_dwVtxLockFlags = D3DLOCK_DISCARD;
for( INDEX i=0; i<GFX_MAXLAYERS; i++) _dwColLockFlags[i] = _dwTexLockFlags[i] = _dwVtxLockFlags;
} else _dwVtxLockFlags = D3DLOCK_NOOVERWRITE;
// keep and advance current lock position
_iVtxPos = _iVtxOffset;
_iVtxOffset += GFX_ctVertices;
// determine lock type, pos and size
dwLockFlag = _dwVtxLockFlags;
ctLockSize = GFX_ctVertices*4;
iLockOffset = _iVtxPos*4;
// set stream params
iStream = POSIDX;
slStride = POSSIZE;
// reset array states
_ulStreamsMask = NONE;
_bProjectiveMapping = FALSE;
_iTexPass = _iColPass = 0;
break;
// NORMALS
case 1:
ASSERT( _pGfx->gl_iMaxTessellationLevel>0 && gap_iTruformLevel>0); // only if enabled
pd3dVB = _pGfx->gl_pd3dNor;
ASSERT( _iTexPass<2 && _iColPass<2); // normals must be set in 1st pass (completed or not)
// determine lock type, pos and size
dwLockFlag = _dwVtxLockFlags;
ctLockSize = GFX_ctVertices*4;
iLockOffset = _iVtxPos*4;
// set stream params
iStream = NORIDX;
slStride = NORSIZE;
break;
// COLORS
case 2:
iThisPass = _iColPass;
// restart in case of too many passes
if( iThisPass>=_pGfx->gl_ctColBuffers) {
dwLockFlag = D3DLOCK_DISCARD;
iThisPass %= _pGfx->gl_ctColBuffers;
} else { // continue in case of enough buffers
dwLockFlag = _dwColLockFlags[iThisPass];
} // mark
_dwColLockFlags[iThisPass] = D3DLOCK_NOOVERWRITE;
ASSERT( iThisPass>=0 && iThisPass<_pGfx->gl_ctColBuffers);
pd3dVB = _pGfx->gl_pd3dCol[iThisPass];
// determine lock pos and size
ctLockSize = GFX_ctVertices*1;
iLockOffset = _iVtxPos*1;
// set stream params
iStream = COLIDX;
slStride = COLSIZE;
_iColPass++; // advance to next color pass
break;
// PROJECTIVE TEXTURE COORDINATES
case 4:
_bProjectiveMapping = TRUE;
// fall thru ...
// TEXTURE COORDINATES
case 3:
iThisPass = _iTexPass;
// restart in case of too many passes
if( iThisPass>=_pGfx->gl_ctTexBuffers) {
dwLockFlag = D3DLOCK_DISCARD;
iThisPass %= _pGfx->gl_ctTexBuffers;
} else { // continue in case of enough buffers
dwLockFlag = _dwTexLockFlags[iThisPass];
} // mark
_dwTexLockFlags[iThisPass] = D3DLOCK_NOOVERWRITE;
ASSERT( iThisPass>=0 && iThisPass<_pGfx->gl_ctTexBuffers);
pd3dVB = _pGfx->gl_pd3dTex[iThisPass];
// set stream number (must take into account tex-unit, because of multi-texturing!)
iStream = TEXIDX +GFX_iActiveTexUnit;
// determine stride, lock pos and size
if( _bProjectiveMapping) {
ctLockSize = GFX_ctVertices*4;
iLockOffset = _iVtxPos*4;
slStride = TX4SIZE;
} else {
ctLockSize = GFX_ctVertices*2;
iLockOffset = _iVtxPos*2;
slStride = TEXSIZE;
} // advance to next texture pass
_iTexPass++;
break;
// BUF! WRONG.
default: ASSERTALWAYS( "SetVertexArray_D3D: wrong stream number!");
}
ASSERT( _iTexPass>=0 && _iColPass>=0);
ASSERT( _iVtxPos >=0 && _iVtxPos<65536);
// fetch D3D buffer
ULONG *pulLockedBuffer;
hr = pd3dVB->Lock( iLockOffset*sizeof(ULONG), ctLockSize*sizeof(ULONG), (UBYTE**)&pulLockedBuffer, dwLockFlag);
D3D_CHECKERROR(hr);
// copy (or convert) vertices there and unlock
ASSERT(pulVtx!=NULL);
if( iType!=2) CopyLongs( pulVtx, pulLockedBuffer, ctLockSize); // vertex array
else abgr2argb( pulVtx, pulLockedBuffer, ctLockSize); // color array (needs conversion)
// done
hr = pd3dVB->Unlock();
D3D_CHECKERROR(hr);
// update streams mask and assign
_ulStreamsMask |= 1<<iStream;
hr = _pGfx->gl_pd3dDevice->SetStreamSource( iStream, pd3dVB, slStride);
D3D_CHECKERROR(hr);
}
// prepare and draw arrays
extern void DrawElements_D3D( INDEX ctIndices, INDEX *pidx)
{
// paranoid & sunburnt (by Skunk Anansie:)
ASSERT( _iTexPass>=0 && _iColPass>=0);
ASSERT( _iVtxPos >=0 && _iVtxPos<65536);
const LPDIRECT3DDEVICE8 pd3dDev = _pGfx->gl_pd3dDevice;
// at least one triangle must be sent
ASSERT( ctIndices>=3 && ((ctIndices/3)*3)==ctIndices);
if( ctIndices<3) return;
extern INDEX d3d_iVertexRangeTreshold;
d3d_iVertexRangeTreshold = Clamp( d3d_iVertexRangeTreshold, 0L, 9999L);
// eventually adjust size of index buffer
const BOOL bHWTnL = _pGfx->gl_ulFlags & GLF_D3D_USINGHWTNL;
SetupIndexArray_D3D( ctIndices * (bHWTnL?2:1));
// determine lock position and type
if( (_iIdxOffset+ctIndices) >= _pGfx->gl_ctIndices) _iIdxOffset = 0;
const DWORD dwLockFlag = (_iIdxOffset>0) ? D3DLOCK_NOOVERWRITE : D3DLOCK_DISCARD;
const SLONG slLockSize = ctIndices *IDXSIZE;
const SLONG slLockOffset = _iIdxOffset*IDXSIZE;
// copy indices to index buffer
HRESULT hr;
UWORD *puwLockedBuffer;
hr = _pGfx->gl_pd3dIdx->Lock( slLockOffset, slLockSize, (UBYTE**)&puwLockedBuffer, dwLockFlag);
D3D_CHECKERROR(hr);
INDEX iMinIndex = 65536;
INDEX iMaxIndex = 0;
const BOOL bSetRange = !(_pGfx->gl_ulFlags&GLF_D3D_USINGHWTNL) && (GFX_ctVertices>d3d_iVertexRangeTreshold);
ASSERT( _iVtxPos>=0 && _iVtxPos<65536);
#if ASMOPT == 1
const __int64 mmSignD = 0x0000800000008000;
const __int64 mmSignW = 0x8000800080008000;
__asm {
// adjust 32-bit and copy to 16-bit array
mov esi,D [pidx]
mov edi,D [puwLockedBuffer]
mov ecx,D [ctIndices]
shr ecx,2 // 4 by 4
jz elemL2
movd mm7,D [_iVtxPos]
punpcklwd mm7,mm7
punpckldq mm7,mm7 // MM7 = vtxPos | vtxPos || vtxPos | vtxPos
paddw mm7,Q [mmSignW]
elemCLoop:
movq mm1,Q [esi+0]
movq mm2,Q [esi+8]
psubd mm1,Q [mmSignD]
psubd mm2,Q [mmSignD]
packssdw mm1,mm2
paddw mm1,mm7
movq Q [edi],mm1
add esi,4*4
add edi,2*4
dec ecx
jnz elemCLoop
emms
elemL2:
test D [ctIndices],2
jz elemL1
mov eax,D [esi+0]
mov edx,D [esi+4]
add eax,D [_iVtxPos]
add edx,D [_iVtxPos]
shl edx,16
or eax,edx
mov D [edi],eax
add esi,4*2
add edi,2*2
elemL1:
test D [ctIndices],1
jz elemRange
mov eax,D [esi]
add eax,D [_iVtxPos]
mov W [edi],ax
elemRange:
// find min/max index (if needed)
cmp D [bSetRange],0
jz elemEnd
mov edi,D [iMinIndex]
mov edx,D [iMaxIndex]
mov esi,D [pidx]
mov ecx,D [ctIndices]
elemTLoop:
mov eax,D [esi]
add eax,D [_iVtxPos]
cmp eax,edi
cmovl edi,eax
cmp eax,edx
cmovg edx,eax
add esi,4
dec ecx
jnz elemTLoop
mov D [iMinIndex],edi
mov D [iMaxIndex],edx
elemEnd:
}
#else
for( INDEX idx=0; idx<ctIndices; idx++) {
const INDEX iAdj = pidx[idx] + _iVtxPos;
if( iMinIndex>iAdj) iMinIndex = iAdj;
else if( iMaxIndex<iAdj) iMaxIndex = iAdj;
puwLockedBuffer[idx] = iAdj;
}
#endif
// indices filled
hr = _pGfx->gl_pd3dIdx->Unlock();
D3D_CHECKERROR(hr);
// check whether to use color array or not
if( GFX_bColorArray) _ulStreamsMask |= (1<<COLIDX);
else _ulStreamsMask &= ~(1<<COLIDX);
// must adjust some stuff when projective mapping usage has been toggled
if( !_bLastProjectiveMapping != !_bProjectiveMapping) {
_bLastProjectiveMapping = _bProjectiveMapping;
D3DTEXTURETRANSFORMFLAGS ttf;
if( _bProjectiveMapping) {
_ulStreamsMask |= 0x1000;
ttf = D3DTTFF_PROJECTED;
} else ttf = D3DTTFF_DISABLE;
hr = pd3dDev->SetTextureStageState( 0, D3DTSS_TEXTURETRANSFORMFLAGS, ttf);
D3D_CHECKERROR(hr);
}
// eventually (re)construct vertex shader out of streams' bit-mask
if( _ulLastStreamsMask != _ulStreamsMask)
{ // reset streams that were used before
ULONG ulThisMask = _ulStreamsMask;
ULONG ulLastMask = _ulLastStreamsMask;
for( INDEX iStream=0; iStream<MAXSTREAMS; iStream++) {
if( (ulThisMask&1)==0 && (ulLastMask&1)!=0) {
hr = pd3dDev->SetStreamSource( iStream,NULL,0);
D3D_CHECKERROR(hr);
} // next stream
ulThisMask >>= 1;
ulLastMask >>= 1;
}
// setup new vertex shader
_dwCurrentVS = SetupShader_D3D(_ulStreamsMask);
_ulLastStreamsMask = _ulStreamsMask;
}
// (re)set vertex shader
ASSERT(_dwCurrentVS!=NONE);
if( _pGfx->gl_dwVertexShader!=_dwCurrentVS) {
hr = _pGfx->gl_pd3dDevice->SetVertexShader(_dwCurrentVS);
D3D_CHECKERROR(hr);
_pGfx->gl_dwVertexShader = _dwCurrentVS;
}
#ifndef NDEBUG
// Paranoid Android (by Radiohead:)
CheckStreams();
#endif
// determine vertex range
INDEX iVtxStart, ctVtxUsed;
// if not too much vertices in buffer
if( !bSetRange) {
// set whole vertex buffer
iVtxStart = _iVtxPos;
ctVtxUsed = GFX_ctVertices;
// if lotta vertices in buffer
} else {
// set only part of vertex buffer
iVtxStart = iMinIndex;
ctVtxUsed = iMaxIndex-iMinIndex+1;
ASSERT( iMinIndex<iMaxIndex);
}
// draw indices
hr = pd3dDev->DrawIndexedPrimitive( D3DPT_TRIANGLELIST, iVtxStart, ctVtxUsed, _iIdxOffset, ctIndices/3);
D3D_CHECKERROR(hr);
// move to next available lock position
_iIdxOffset += ctIndices;
}
#endif // SE1_D3D
```
|
Ramganj Mandi is a city and a municipality in Kota district in the Indian state of Rajasthan. It is known as stone city, coriander city. It has the largest grain market of coriander with around 6500 tons of coriander seeds arriving on a single day during season. Spices Giant MDH buys its coriander seeds from Ramganj Mandi. A new spice park is being constructed on Nimana road, the link road between SH 9B and NH 12. Annually billions of square feet of limestone is exported throughout the country, mainly in Punjab, Haryana, Chandigarh, Gujarat, Maharashtra and Madhya Pradesh. Around 1000 stone processing units are set up in the industrial area. More than 80 mines are present in the area.
Demographics
India census, Ramganj Mandi had a population of 41,784. Males constitute 53% of the population and females 47%. Ramganj Mandi has an average literacy rate of 68%, higher than the national average of 59.5%: male literacy is 75%, and female literacy is 60%. In Ramganj Mandi, 16% of the population is under 10 years of age.
169 villages come under sub district Ramganj Mandi. Total population of Ramganj Mandi Sub District is 272,448 of which 142,353 are males and 130,095 are females. Ramganjmandi is a major market for agriculture for Rajasthan and surrounding area of Madhya Pradesh. Its revenue for the state Rajasthan is more than 18 district of Rajasthan. Ramganjmandi is a trading and industrial hub of south east Rajasthan so heavy exchange of transport are always there. Thus without make it a political district it has RTO office RJ33. Most of kota stone mines and producing units is present in this city.
History
City was earlier outskirt of village Khairabad, famous for the temple of Maa Falaudi. People started living around the railway station which was then known as Khairabad road, Suket road.
Later on Princely State of Kota established this as Ramganj Mandi. Maximum people residing here are migrated from different parts of country. Mostly people came here to work and later settled here. Most of the economy is based on stone business and coriander seeds. Now a time it has largest market of coriander in Asia. Second spice park of Rajasthan is also constructed here and Start Eastern Condiments Co. .
Transport
Rail - The city is situated on Delhi-Bombay Railway line, so it is well connected to all major cities via Rail.
City has a railway station Ramganj mandi Junction (starting point of under construction of ramganj Mandi-Bhopal railway line and provide connectivity to Jhalawar district on this route).
Road - City has two bus stands; one near Martyr Pannalal Circle which is only for Rajasthan Roadways Buses, and another near railway station for private bus operators.
Rajasthan State Highway 9 is passing through city to Jhalawar connecting city with National Highway 12. Another State Highway 27 is touching the city which is further going to "Anu Nagari" Rawatbhata via Chechat.
There are many roadway transport services which transport "Kota Stone" and coriander to all parts of India.
Air - Nearest airport is Kota .
References
http://www.censusindia.gov.in/pca/SearchDetails.aspx?Id=112942
Cities and towns in Kota district
|
The Calhoun Shot, also known as the Immaculate Connection, was a basketball shot made by spectator Don Calhoun during a timeout in the third quarter of a Chicago Bulls–Miami Heat game on April 14, 1993. The shot was part of a promotion that offered 1 million dollars to any fan who could make a 75-foot shot through the basket from the free-throw line at the opposite end of the court. At the time, Calhoun's shot was reported as the first time anyone ever made a three-quarters promotional shot. In actuality, a spectator had succeeded in this shot in 1989, winning a car.
The insurance company that was required to make the payoff, American Hole 'N One Inc, voided the payment because Calhoun had played college basketball, a violation of the rules. However, the sponsors of the event, Coca-Cola, the Lettuce Entertain You restaurant, and the Bulls, pledged to cover the prize if the insurance company would not. As a result, Calhoun got $50,000 a year over the next 20 years. The insurance company still benefited from the publicity. The shot, and the news coverage it gained, are credited with the rise of similar promotions during sport events.
Contestant
Don Calhoun was at the time an office supplies salesman. He had played basketball for Bloomington High School and later for Triton College during the 1988–1989 season. Following the shot, he signed a one-year contract with the Harlem Globetrotters.
He later continued to work with office supplies, getting approximately $38,000 (after taxes) every year until 2013. He characterized the money as nice, but not something that made him feel rich. Thirty years after making the shot, Calhoun lives in the Midwest and has four children, one of whom was able to earn a college degree (the first in the family to do so) and later a medical degree partly thanks to his father's prize money.
, the ball that was used to make the shot is in the possession of Calhoun's son, Dr. Clarence Calhoun II.
References
April 1993 sports events in the United States
Basketball in Chicago
Chicago Bulls games
Miami Heat games
|
666 is the second album by Hyde, released on December 3, 2003. The album reached number two on the Oricon Top 200 chart.
Track listing
Personnel
Hyde – vocals, guitars, arrangement, production
Anis – [speech] (tracks 3, 7-9)
Lynne Hodbay – [English] (tracks 1, 2, 4-6, 10)
Hiroki – bass
Furuton – drums
Shinji Takeda – saxophone (tracks: 3)
K.A.Z – synthesizer, guitar, arrangement, production
References
2003 albums
Hyde (musician) albums
Japanese-language albums
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.