text
stringlengths 1
22.8M
|
|---|
The Central District of Bahmai County () is in Kohgiluyeh and Boyer-Ahmad province, Iran. Its capital is the city of Likak.
At the National Census in 2006, its population was 22,193 in 4,085 households. The following census in 2011 counted 26,307 people in 6,011 households. At the latest census in 2016, the district had 28,324 inhabitants in 7,373 households.
References
Bahmai County
Districts of Kohgiluyeh and Boyer-Ahmad Province
Populated places in Kohgiluyeh and Boyer-Ahmad Province
Populated places in Bahmai County
|
The Shandong University of Technology (SDUT; ) is a university located in Zibo, Shandong, China. The university was founded in 1956 and has a focus on engineering sciences.
History
The school was founded as the Shandong Institute of Technology () in June 1956. During the Cultural Revolution, it was one of only 13 undergraduate institutions of higher learning in Shandong. It expanded into a wider institution of polytechnic learning in 1990. Finally in 2001, it merged with several other colleges into a full university under its current name.
Campus
SDUT occupies two campuses, both located in the Zhangdian District of Zibo. Together, they cover an area of approximately 2.4 million square meters, with a building area of 1.3 million square meters. The campus features 268 lecture halls with multi-media facilities and 21 laboratories.
The headquarters for the Shandong Research Institute of Engineering and Technology is also located on the SDUT campus.
Students
There are 34,000 full-time undergraduate students and 5,300 postgraduate students enrolled at SDUT. Undergraduate students can elect to study 21 different subjects spanning nine categories: engineering, science, economics, management, literature, law, history, pedagogy, and art.
Masters' students have the choice of 14 subjects for engineering, five subjects in agricultural extension, as well as the subjects for a Master of Business Administration (MBA) and a Master of Finance (MF).
Academic Schools
School of Transportation & Vehicle Engineering
School of Agricultural Engineering& food science
School of Electrical & Electronic Engineering
School of Computer Science & Technology
School of Chemical Engineering
School of Architectural Engineering
School of Resources & Environment Engineering
School of Materials Science & Engineering
School of Life Science
School of Science
School of Business
MBA Education Centre
School of Literature & Media Dissemination
School of Foreign Languages
School of Laws
School Of Marxism
School of Fine Arts
School of Music
School of Physical Education
Lutai textile college
School of Innovation and Entrepreneurship
Programme List
Shandong University of Technology offers Bachelor's, Masters, and Doctoral Degrees for International students wishing to study in China. Undergraduate and Postgraduate courses range from studying the Arts to Mechanical Engineering, Chinese Philology to Economy.
SDUT has 12 Doctoral Degrees that specialize in different areas of Engineering and Technology.
Universities and colleges in Shandong
Technical universities and colleges in China
|
Siegfried Aram (real name Abraham, born May 28, 1891, in Heilbronn; died January, 1978 in New York) was a German lawyer, cultural politician, art collector and art dealer.
Early life
Siegfried Aram was a son of the merchant Sigmund Abraham and Thekla, née Grünwald. His maternal grandfather was the merchant Adolf or Adolph Grünwald, who, after returning from America in the early 1860s, joined Sigmund Abraham as a partner in 1893. Sigmund Abraham eventually became the owner of the Adolf Grünwald company, which was located at Kaiserstraße 27 after the addresses Kieselmarkt 3 and Lixstraße 12.
Education and professional life
Aram graduated from the Realgymnasium in his hometown, then studied law. He was then employed as a court assessor in Stuttgart, then as a lawyer at the Higher Regional Court. He co-founded the journal Das Gelbe Blatt and was its editor. He advocated the founding of an adult education center and founded the Schwäbische Landesbühne. His circle of friends included Hans Hildebrandt, Oskar Schlemmer, Willi Baumeister and Rudolf Utzinger. Aram bought the small castle of Schapbach near Freudenstadt, also known as Villa Hohenhaus, and worked as an art dealer. His father had collected art. After Sigmund Abraham's death in 1925, his widow sold the house in Heilbronn and moved to Berlin.
After the First World War, Aram became the target of radical right-wing persecution after the so-called Schefflenzer Waffenschiebung became known.
Warren Chase Merritt created a portrait of Aram.
Together with art dealer Martin Ehrhardt, Siegfried Aram bought the so-called Holzenhaus, the little castle of Schapbach, in the 1920s. In 1930 the Galerie Ehrhardt published a book about drawings he authored. Aram was one of the donors of the St. Cyriak Stations of the Cross in Schapbach painted by Bernhard G. Lucki.
Nazi persecution
When the Nazis came to power in Germany in 1933, Aram was persecuted because he was Jewish. He fled Nazi Germany via Italy and Gibraltar, arriving in the United States in 1934. He lived in Detroit and New York and ran the Aram-Ehrhardt Galleries. In 1937 he changed the name of the gallery to S.F. Aram, Inc. or Siegfried Aram Gallery,
In 2020 a painting that he had once owned was discovered with a false provenance and changed title in the Metropolitan Museum of Art. For decades, Aram had sought to recover the painting, called “The Rape of Tamar,” and attributed to the French artist Eustache Le Sueur, which he said had been taken by a businessman, Oskar Sommer, who purchased his home in Germany.
Literature
Hans Franke: Geschichte und Schicksal der Juden in Heilbronn. Stadtarchiv Heilbronn, Heilbronn 1963 (Veröffentlichungen des Archivs der Stadt Heilbronn, 11), S. 209ff. und 230 ff.
Links
Stadtarchiv Heilbronn, Datenbank HEUSS
See also
Eustache Le Sueur
List of claims for restitution for Nazi-looted art
The Holocaust
Aryanization
References
1978 deaths
1891 births
German art collectors
20th-century German lawyers
Subjects of Nazi art appropriations
Jewish art collectors
Emigrants from Nazi Germany to the United States
Jews who emigrated to escape Nazism
|
Nazareth is a native community in the Bagua Province, Amazonas Region, Peru. The elevation above sea level is . The nearest airport is named SHUMBA, bearing 224 airlines, located at .
References
Geographical Data about Nazareth, Peru (Falling Rain Genomics)
Populated places in the Amazonas Region
|
Heaven On My Mind is a 2018 Nigerian film directed and written by Nneka Ojor with Uche Jombo as co-writer.
Plot
The film tells a story of a young man called Ben Peter who has taken marriage as a life style and business transaction until he meets his right match called heaven.
Cast
Adunni Ade
Femi Adebayo
Mercy Aigbe
Ini Edo
Ray Emodi
Swanky Jerry
Uche Jombo
Eric Ogbonna
Princewill
Chidi Okereke
References
External links
2018 films
English-language Nigerian films
2010s English-language films
|
Naseemullah (Urdu/), better known as Naqeebullah Mehsud (), was killed on 13 January 2018 in Karachi, Pakistan, during a fake encounter staged by the senior superintendent of police (SSP) of Karachi's Malir District, Rao Anwar. On 3 January, Naqeebullah was kidnapped along with two of his friends, Hazrat Ali and Muhammad Qasim, by Rao Anwar's men in plainclothes from Gulsher Agha Hotel in Karachi. On 6 January, both of his friends were freed by the police, but Naqeebullah was kept in captivity, tortured, and then killed on 13 January in a fake encounter in which he was shot twice in the back. Alongside Naqeebullah, three other men namely Muhammad Sabir and Muhammad Ishaq from Bahawalpur and Nazar Jan Mahsud from South Waziristan were also killed by the police in the staged encounter, the latter of whom was shot from a close range. On 17 January, Naqeebullah's dead body was handed over to his relatives at the Chhipa Welfare Association morgue in Karachi. On 18 January, his body was taken by his relatives to Tank, Khyber Pakhtunkhwa, where Islamic funeral prayer was performed for him, and on the same day, he was buried at his hometown Makeen, South Waziristan. The fake encounter sparked countrywide protests against extrajudicial killings in Pakistan.
Referring to the killings, the police alleged that they killed four suspected terrorists in a shootout. Rao Anwar claimed that Naqeebullah had links with the Pakistani Taliban (Tehrik-i-Taliban Pakistan, or TTP), Lashkar-e-Jhangvi (LeJ), and the Islamic State of Iraq and the Levant (Daesh). However, the claims were contested by Naqeebullah's relatives and human rights activists, especially the Pashtun Tahafuz Movement (PTM, or 'Pashtun Protection Movement'), which launched a campaign to seek justice for him. An inquiry committee consisting of senior police officers was formed to investigate the killing, which found Naqeebullah to be innocent, and declared that the alleged police encounter staged to kill him and three others was fake.
Naqeebullah was survived by his wife, two daughters, and a son. On 24 January 2019, a Pakistani anti-terrorism court declared Naqeebullah and the three other persons murdered with him as innocent.
Background
Naqeebullah Mehsud
Naseemullah, usually known as Naqeebullah, was born in 1992 in the Makin Tehsil of South Waziristan. He belonged to the Abdullai Mahsud tribe of Pashtuns. In 2009, his family was forced to flee their home due to Operation Rah-e-Nijat by the Pakistan Armed Forces against the militants in South Waziristan. After migrating to Karachi, Naqeebullah had been working as a labourer. He was passionate about modeling and was an aspiring model. He had three brothers, one of whom had settled in Dubai, UAE. Naqeebullah was planning to start a garment business and had rented a shop in Sohrab Goth, Karachi just before being kidnapped and murdered.
Rao Anwar
Rao Anwar, a senior superintendent of police (SSP) in the Malir District of Karachi, led the team staging the fake encounter and was already known for carrying out controversial police encounters in Karachi. He was known as the "encounter specialist" of the Sindh Police.
Abduction of Naqeebullah and his friends
On the evening of 3 January 2018, Naqeebullah Mehsud and his two friends, Hazrat Ali and Muhammad Qasim, who had become friends with him via the social media website Facebook, were out together in Sohrab Goth when they were abducted by men in plainclothes. Hazrat Ali said, “we were taken to Sachal police station first. We waited for 50 minutes, then a cloth was tied to our eyes and we were taken to an undisclosed location."
Ali added, "we could hear that they took Naqeebullah first and he was being tortured. We could hear his screams. After Naqeebullah, the men came towards us [Ali and Qasim] and started to beat us up. After a while, the men forcefully put naswar down my throat. I couldn’t stop vomiting after that.” According to Qasim, the men also checked Naqeebullah's messages on their mobile phones and questioned them about him. "After some time, we were let go but Naqeebullah had been separated from us. The police threatened us to not discuss the incident with anyone else,” added Qasim.
Rao Anwar accused Naqeebullah of being a terrorist, but the inquiry committee of senior police officers probing the case found his allegation baseless. A mid-level police officer at the Malir police station, who had worked under Rao Anwar, remarked that money was the motive behind the picking up of Naqeebullah. He said: “Rao’s touts amongst the Sohrab Goth shopkeepers came to know that Naseem [Naqeebullah] was in possession of a hefty amount of money with which he wanted to buy a shop."
"Two policemen — SI Yaseen Dhukku and ASI Akbar Mallah — picked him up along with two of his friends from a restaurant on Abul Hassan Ispahani road. While they let his friends go, they continued to torture him even after extracting Rs9 million, demanding he pay them Rs20 million more. By then, he was in such bad shape that they decided it would be unwise to set him free,” added the police officer.
Killing of Gul Saeed
On 16 January 2018, when the inquiry against Rao Anwar was about to start following the killing of Naqeebullah Mehsud, Rao Anwar claimed that he came under attack in Karachi's Malir Cantonment while he was heading towards his house. He alleged that a suicide attacker detonated explosives near him and his squad but they remained unhurt, and that two accomplices of the attacker then opened fire on the police, both of whom were shot dead in the exchange of fire. He also alleged that a few militants escaped the site under the cover of fire while the police and Pakistan Rangers were conducting search operation. The alleged suicide attacker was later identified as Gul Saeed Afridi, a 34-year-old driver from Orangi Town, Karachi, who had gone missing a few months earlier.
Gul Saeed's body was found to be burned badly, but not blown up and still in one piece, although it had allegedly fell far from Rao Anwar's armoured vehicle. Gul Saeed's family was outraged at the demands of the police from them after the killing. They protested and took Gul Saeed's body away from the police by force, but returned it to the mortuary after negotiations. The police placed the three dead bodies at the Chhipa Welfare Association morgue in Karachi. The other two bodies besides Gul Saeed, which were still unidentified, had been riddled with bullets. The Pakistani Taliban (Tehrik-i-Taliban Pakistan, or TTP) immediately claimed responsibility of the alleged suicide attack. Gul Saeed's family, however, appealed against Rao Anwar's allegations and claimed that Gul Saeed was innocent and had no links with terrorists. They asked how a suicide attack could even be possible in a sensitive area surrounded by the military like the cantonment, and asserted that Rao Anwar had in fact murdered Gul Saeed extrajudicially.
The Counter-Terrorism Department (CTD) probing the case doubted if a suicide attack had taken place at the site. Suggesting that it was a fake encounter, a senior CTD officer Omar Khattab said: “This has been observed for the first time that the suicide bomber, despite having himself blown up with explosives, was only burnt. While examining the site of the attack, no traces of any explosive material were found. Even there was no smell of explosives.” The investigators found out that contrary to Rao Anwar's claim, no exchange of fire had taken place. According to the investigators, the alleged suicide attacker Gul Saeed was first riddled by the police with bullets, then a suicide vest was wrapped around his body, and then the vest was set on fire which burned his body.
Investigation
The inquiry committee of senior police officers probing Naqeebullah Mehsud's case found no sign of an exchange of gunfire at the site of the alleged police encounter, which was an abandoned poultry farm. Although the police officers who had taken part in the alleged shootout claimed that militants were hiding inside the poultry farm who attacked them when the police encircled the hideout, the inquiry committee found out that there was no gunfire from inside the poultry farm during the incident. Some marks of firing were found in a room and on walls of the poultry farm, which the inquiry team declared to be post-incident fabrications by the police team.
The committee found out that during his service as a senior police officer in the Malir District of Karachi between 2011 and 2018, Rao Anwar carried out at least 444 killings in 192 alleged encounters, whereas the total number of alleged police encounters led by him was 745, including 553 cases which did not involve any killings. However, not a single policeman was ever killed or even injured during his 745 alleged encounters. Eight people were killed in Rao Anwar's two alleged encounters in the first 19 days of January 2018 alone.
Senior police officers in Karachi, on condition of anonymity, claimed that the majority of the people killed during Rao Anwar's encounters were ethnic Pashtuns. They added that men were airlifted to Karachi from as far away as the Federally Administered Tribal Areas for Rao Anwar to deal with them. Another senior police officer stated: “[Rao Anwar] led a team of killing machines. There was no one to stop him.” Explaining why no notice was taken of Rao Anwar's actions earlier, the senior police officer revealed that “even the police command is afraid of him because of his close connections with criminal politician Asif Zardari and with elements in the security establishment.”
The inquiry committee termed the allegations by Rao Anwar against Naqeebullah as baseless and suggested to add Rao Anwar's name to the Exit Control List. They stated that the claims made by Rao Anwar, including the claim that Naqeebullah was unmarried, were untrue. The committee concluded that Naqeebullah was innocent and had no history of militancy or criminal activity, but was rather killed in a fake police encounter carried out by Rao Anwar. The four men including Naqeebullah were killed in two separate rooms of the abandoned farm by Rao Anwar's team and then their bodies were dumped in a single room. On 20 January 2018, Rao Anwar was removed from his post as senior superintendent of police (SSP) Malir on the recommendation of the committee.
On 23 January 2018, Rao Anwar attempted to flee the country in a Dubai-bound flight from Benazir Bhutto International Airport, Islamabad, but the Federal Investigation Agency foiled his attempt and stopped him at the immigration counter of the airport after observing that his No Objection Certificate was inauthentic.
On 24 January 2019, a Pakistani anti-terrorism court declared Naqeebullah and the three other persons murdered with him as innocent. On remand from the court, 13 police officials were imprisoned, but 7 suspects including Rao Anwar were granted bail. Anwar's trial began in 2020 and he was acquitted by the courts in January 2023.
Pashtun Tahafuz Movement
The Pashtun Tahafuz Movement (PTM), under the leadership of Manzoor Pashteen, launched a campaign to seek justice for Naqeebullah Mehsud soon after his murder. PTM organized a series of protest marches and sit-ins at various cities. They held public gatherings in Islamabad, Quetta, Peshawar, Lahore, Swat, Karachi, Dera Ismail Khan, Swabi, Bannu, Tank, as well as other cities and towns, in which one of the main demands was to punish Rao Anwar and his team for murdering Naqeebullah.
On 23 March 2018, PTM leader Arif Wazir led a protest rally from Wanna to the home of Naqeebullah in Makeen, South Waziristan. On 24 March, Wazir was detained by the authorities under the Frontier Crimes Regulation for organizing the rally. Three other PTM activists were also arrested. PTM supporters protested against the arrests in front of press clubs in Peshawar, Quetta, Swat, Swabi, Bannu, Dera Ismail Khan, Islamabad, Lahore, Karachi, Zhob, Loralai, Killa Saifullah, Ziarat, and other cities.
See also
Pashtun Tahafuz Movement
Manzoor Pashteen
Tahir Dawar
Arman Loni
References
2018 in Sindh
2018 murders in Pakistan
2010s crimes in Karachi
21st-century mass murder in Pakistan
Encounters in Pakistan
Enforced disappearances in Pakistan
Human rights abuses in Pakistan
January 2018 crimes in Asia
January 2018 events in Pakistan
Mass murder in 2018
Mass murder in Karachi
Pashtun Tahafuz Movement
People shot dead by law enforcement officers in Pakistan
Protests in Pakistan
Deaths by firearm in Sindh
People murdered in Karachi
|
```xml
import { RefObject, useCallback, useEffect, useState } from 'react';
import useObserveFocusVisible from './useObserveFocusVisible';
export default function useFocusVisible(targetRef: RefObject<HTMLElement>): [boolean] {
const [focusVisible, setFocusVisible] = useState(false);
const handleBlur = useCallback(() => setFocusVisible(false), [setFocusVisible]);
const handleFocusVisible = useCallback(() => setFocusVisible(true), [setFocusVisible]);
useObserveFocusVisible(targetRef, handleFocusVisible);
useEffect(() => {
const { current } = targetRef;
current.addEventListener('blur', handleBlur);
return () => current.removeEventListener('blur', handleBlur);
}, [handleBlur, targetRef]);
return [focusVisible];
}
```
|
```kotlin
package mega.privacy.android.data.mapper.notification
import mega.privacy.android.domain.entity.NotificationBehaviour
import mega.privacy.android.domain.entity.settings.ChatSettings
import mega.privacy.android.domain.entity.settings.ChatSettings.Companion.VIBRATION_OFF
import mega.privacy.android.domain.entity.settings.ChatSettings.Companion.VIBRATION_ON
import javax.inject.Inject
/**
* Mapper for converting data into [NotificationBehaviour].
*/
class ChatMessageNotificationBehaviourMapper @Inject constructor() {
/**
* Invoke.
*
* @param chatSettings [ChatSettings].
* @param beep Push notification flag indicating if the notification should beep or not.
* @param defaultSound Default device sound.
*/
operator fun invoke(
chatSettings: ChatSettings?,
beep: Boolean,
defaultSound: String?,
) = NotificationBehaviour(
sound = when {
beep && chatSettings != null -> chatSettings.notificationsSound.ifEmpty { defaultSound }
beep -> defaultSound
else -> null
}, vibration = when {
beep && chatSettings != null -> chatSettings.vibrationEnabled
beep -> VIBRATION_ON
else -> VIBRATION_OFF
})
}
```
|
```c++
///////////////////////////////////////////////////////////////////////////////
// test9.cpp
//
// LICENSE_1_0.txt or copy at path_to_url
#include <algorithm>
#include "./test9.hpp"
///////////////////////////////////////////////////////////////////////////////
// test_main
// read the tests from the input file and execute them
void test_main()
{
#ifndef BOOST_XPRESSIVE_NO_WREGEX
typedef std::wstring::const_iterator iterator_type;
boost::iterator_range<xpr_test_case<iterator_type> const *> rng = get_test_cases<iterator_type>();
std::for_each(rng.begin(), rng.end(), test_runner<iterator_type>());
#endif
}
///////////////////////////////////////////////////////////////////////////////
// init_unit_test_suite
//
test_suite* init_unit_test_suite( int argc, char* argv[] )
{
test_suite *test = BOOST_TEST_SUITE("test9u");
test->add(BOOST_TEST_CASE(&test_main));
return test;
}
```
|
```c
/*
*
* Use of this source code is governed by a BSD-style license
* that can be found in the LICENSE file in the root of the source
* tree. An additional intellectual property rights grant can be found
* in the file PATENTS. All contributing project authors may
* be found in the AUTHORS file in the root of the source tree.
*/
/*
* This file contains the function WebRtcSpl_SqrtOfOneMinusXSquared().
* The description header can be found in signal_processing_library.h
*
*/
#include "webrtc/common_audio/signal_processing/include/signal_processing_library.h"
void WebRtcSpl_SqrtOfOneMinusXSquared(int16_t *xQ15, size_t vector_length,
int16_t *yQ15)
{
int32_t sq;
size_t m;
int16_t tmp;
for (m = 0; m < vector_length; m++)
{
tmp = xQ15[m];
sq = tmp * tmp; // x^2 in Q30
sq = 1073741823 - sq; // 1-x^2, where 1 ~= 0.99999999906 is 1073741823 in Q30
sq = WebRtcSpl_Sqrt(sq); // sqrt(1-x^2) in Q15
yQ15[m] = (int16_t)sq;
}
}
```
|
```xml
<?xml version="1.0" encoding="utf-8"?>
<Project ToolsVersion="4.0" DefaultTargets="Build" xmlns="path_to_url">
<PropertyGroup>
<Configuration Condition=" '$(Configuration)' == '' ">Debug</Configuration>
<Platform Condition=" '$(Platform)' == '' ">x86</Platform>
<ProductVersion>8.0.30703</ProductVersion>
<SchemaVersion>2.0</SchemaVersion>
<ProjectGuid>{8C0AF5B7-AB42-4224-9E40-E7298CB5A059}</ProjectGuid>
<OutputType>Library</OutputType>
<AppDesignerFolder>Properties</AppDesignerFolder>
<RootNamespace>ZXing.Kinect</RootNamespace>
<AssemblyName>zxing.kinect</AssemblyName>
<TargetFrameworkVersion>v4.5</TargetFrameworkVersion>
<TargetFrameworkProfile>
</TargetFrameworkProfile>
<FileAlignment>512</FileAlignment>
<PublishUrl>publish\</PublishUrl>
<Install>true</Install>
<InstallFrom>Disk</InstallFrom>
<UpdateEnabled>false</UpdateEnabled>
<UpdateMode>Foreground</UpdateMode>
<UpdateInterval>7</UpdateInterval>
<UpdateIntervalUnits>Days</UpdateIntervalUnits>
<UpdatePeriodically>false</UpdatePeriodically>
<UpdateRequired>false</UpdateRequired>
<MapFileExtensions>true</MapFileExtensions>
<ApplicationRevision>0</ApplicationRevision>
<ApplicationVersion>1.0.0.%2a</ApplicationVersion>
<IsWebBootstrapper>false</IsWebBootstrapper>
<UseApplicationTrust>false</UseApplicationTrust>
<BootstrapperEnabled>true</BootstrapperEnabled>
<SccProjectName>SAK</SccProjectName>
<SccLocalPath>SAK</SccLocalPath>
<SccAuxPath>SAK</SccAuxPath>
<SccProvider>SAK</SccProvider>
</PropertyGroup>
<PropertyGroup>
<StartupObject />
</PropertyGroup>
<PropertyGroup Condition="'$(Configuration)|$(Platform)' == 'Debug|AnyCPU'">
<DebugSymbols>true</DebugSymbols>
<OutputPath>..\..\..\Build\Debug\Bindings\kinect\V2\</OutputPath>
<DefineConstants>TRACE;DEBUG;NET45;KINECTV2</DefineConstants>
<DebugType>full</DebugType>
<PlatformTarget>AnyCPU</PlatformTarget>
<CodeAnalysisLogFile>..\..\..\Build\Debug\Bindings\kinect\V2\zxing.kinect.dll.CodeAnalysisLog.xml</CodeAnalysisLogFile>
<CodeAnalysisUseTypeNameInSuppression>true</CodeAnalysisUseTypeNameInSuppression>
<CodeAnalysisModuleSuppressionsFile>GlobalSuppressions.cs</CodeAnalysisModuleSuppressionsFile>
<ErrorReport>prompt</ErrorReport>
<CodeAnalysisRuleSet>MinimumRecommendedRules.ruleset</CodeAnalysisRuleSet>
<CodeAnalysisRuleSetDirectories>;C:\Program Files (x86)\Microsoft Visual Studio 10.0\Team Tools\Static Analysis Tools\\Rule Sets</CodeAnalysisRuleSetDirectories>
<CodeAnalysisRuleDirectories>;C:\Program Files (x86)\Microsoft Visual Studio 10.0\Team Tools\Static Analysis Tools\FxCop\\Rules</CodeAnalysisRuleDirectories>
<NoWarn>
</NoWarn>
<BaseIntermediateOutputPath>obj\</BaseIntermediateOutputPath>
<IntermediateOutputPath Condition=" '$(PlatformName)' == 'AnyCPU' ">$(BaseIntermediateOutputPath)$(Configuration)\kinect\V2\</IntermediateOutputPath>
<IntermediateOutputPath Condition=" '$(PlatformName)' != 'AnyCPU' ">$(BaseIntermediateOutputPath)$(PlatformName)\$(Configuration)\kinect\V2\</IntermediateOutputPath>
<Prefer32Bit>false</Prefer32Bit>
</PropertyGroup>
<PropertyGroup Condition="'$(Configuration)|$(Platform)' == 'Release|AnyCPU'">
<OutputPath>..\..\..\Build\Release\Bindings\kinect\V2\</OutputPath>
<DefineConstants>TRACE;NET45;KINECTV2</DefineConstants>
<DocumentationFile>..\..\..\Build\Release\Bindings\kinect\V2\zxing.kinect.XML</DocumentationFile>
<Optimize>true</Optimize>
<DebugType>pdbonly</DebugType>
<PlatformTarget>AnyCPU</PlatformTarget>
<CodeAnalysisLogFile>..\..\..\Build\Release\Bindings\kinect\V2\zxing.kinect.dll.CodeAnalysisLog.xml</CodeAnalysisLogFile>
<CodeAnalysisUseTypeNameInSuppression>true</CodeAnalysisUseTypeNameInSuppression>
<CodeAnalysisModuleSuppressionsFile>GlobalSuppressions.cs</CodeAnalysisModuleSuppressionsFile>
<ErrorReport>prompt</ErrorReport>
<CodeAnalysisRuleSet>MinimumRecommendedRules.ruleset</CodeAnalysisRuleSet>
<CodeAnalysisRuleSetDirectories>;C:\Program Files (x86)\Microsoft Visual Studio 10.0\Team Tools\Static Analysis Tools\\Rule Sets</CodeAnalysisRuleSetDirectories>
<CodeAnalysisIgnoreBuiltInRuleSets>false</CodeAnalysisIgnoreBuiltInRuleSets>
<CodeAnalysisRuleDirectories>;C:\Program Files (x86)\Microsoft Visual Studio 10.0\Team Tools\Static Analysis Tools\FxCop\\Rules</CodeAnalysisRuleDirectories>
<CodeAnalysisIgnoreBuiltInRules>false</CodeAnalysisIgnoreBuiltInRules>
<CodeAnalysisFailOnMissingRules>false</CodeAnalysisFailOnMissingRules>
<NoWarn>
</NoWarn>
<BaseIntermediateOutputPath>obj\</BaseIntermediateOutputPath>
<IntermediateOutputPath Condition=" '$(PlatformName)' == 'AnyCPU' ">$(BaseIntermediateOutputPath)$(Configuration)\kinect\V2\</IntermediateOutputPath>
<IntermediateOutputPath Condition=" '$(PlatformName)' != 'AnyCPU' ">$(BaseIntermediateOutputPath)$(PlatformName)\$(Configuration)\kinect\V2\</IntermediateOutputPath>
<Prefer32Bit>false</Prefer32Bit>
</PropertyGroup>
<PropertyGroup Condition="'$(Configuration)|$(Platform)' == 'Debug - Reduced|AnyCPU'">
<DebugSymbols>true</DebugSymbols>
<OutputPath>..\..\..\Build\Debug\Bindings\kinect\V2\</OutputPath>
<DefineConstants>TRACE;DEBUG;NET45;KINECTV2</DefineConstants>
<DebugType>full</DebugType>
<PlatformTarget>AnyCPU</PlatformTarget>
<ErrorReport>prompt</ErrorReport>
<CodeAnalysisRuleSet>MinimumRecommendedRules.ruleset</CodeAnalysisRuleSet>
<Prefer32Bit>false</Prefer32Bit>
</PropertyGroup>
<PropertyGroup>
<SignAssembly>true</SignAssembly>
</PropertyGroup>
<PropertyGroup>
<AssemblyOriginatorKeyFile>..\..\..\Key\private.snk</AssemblyOriginatorKeyFile>
</PropertyGroup>
<ItemGroup>
<Reference Include="Microsoft.Kinect">
<HintPath>..\..\..\3rdparty\Kinect\V2\Microsoft.Kinect.dll</HintPath>
</Reference>
<Reference Include="System" />
</ItemGroup>
<ItemGroup>
<Compile Include="..\..\lib\Properties\AssemblyInfo.cs">
<Link>Properties\AssemblyInfo.cs</Link>
</Compile>
<Compile Include="BarcodeReader.cs" />
<Compile Include="ColorFrameLuminanceSource.cs" />
</ItemGroup>
<ItemGroup>
<BootstrapperPackage Include=".NETFramework,Version=v4.0,Profile=Client">
<Visible>False</Visible>
<ProductName>Microsoft .NET Framework 4 Client Profile %28x86 und x64%29</ProductName>
<Install>true</Install>
</BootstrapperPackage>
<BootstrapperPackage Include="Microsoft.Net.Client.3.5">
<Visible>False</Visible>
<ProductName>.NET Framework 3.5 SP1 Client Profile</ProductName>
<Install>false</Install>
</BootstrapperPackage>
<BootstrapperPackage Include="Microsoft.Net.Framework.3.5.SP1">
<Visible>False</Visible>
<ProductName>.NET Framework 3.5 SP1</ProductName>
<Install>false</Install>
</BootstrapperPackage>
<BootstrapperPackage Include="Microsoft.Windows.Installer.3.1">
<Visible>False</Visible>
<ProductName>Windows Installer 3.1</ProductName>
<Install>true</Install>
</BootstrapperPackage>
</ItemGroup>
<ItemGroup>
<ProjectReference Include="..\..\lib\zxing.net4.5.csproj">
<Project>{24074395-0196-4204-b516-cb6dba2fc4b9}</Project>
<Name>zxing.net4.5</Name>
</ProjectReference>
</ItemGroup>
<ItemGroup>
<None Include="..\..\..\Key\private.snk">
<Link>Properties\private.snk</Link>
</None>
</ItemGroup>
<Import Project="$(MSBuildToolsPath)\Microsoft.CSharp.targets" />
<!-- To modify your build process, add your task inside one of the targets below and uncomment it.
Other similar extension points exist, see Microsoft.Common.targets.
<Target Name="BeforeBuild">
</Target>
<Target Name="AfterBuild">
</Target>
-->
</Project>
```
|
```c++
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "src/torque/implementation-visitor.h"
#include "include/v8.h"
namespace v8 {
namespace internal {
namespace torque {
VisitResult ImplementationVisitor::Visit(Expression* expr) {
CurrentSourcePosition::Scope scope(expr->pos);
switch (expr->kind) {
#define ENUM_ITEM(name) \
case AstNode::Kind::k##name: \
return Visit(name::cast(expr));
AST_EXPRESSION_NODE_KIND_LIST(ENUM_ITEM)
#undef ENUM_ITEM
default:
UNIMPLEMENTED();
}
return VisitResult();
}
const Type* ImplementationVisitor::Visit(Statement* stmt) {
CurrentSourcePosition::Scope scope(stmt->pos);
switch (stmt->kind) {
#define ENUM_ITEM(name) \
case AstNode::Kind::k##name: \
return Visit(name::cast(stmt));
AST_STATEMENT_NODE_KIND_LIST(ENUM_ITEM)
#undef ENUM_ITEM
default:
UNIMPLEMENTED();
}
UNREACHABLE();
return nullptr;
}
void ImplementationVisitor::Visit(Declaration* decl) {
CurrentSourcePosition::Scope scope(decl->pos);
switch (decl->kind) {
#define ENUM_ITEM(name) \
case AstNode::Kind::k##name: \
return Visit(name::cast(decl));
AST_DECLARATION_NODE_KIND_LIST(ENUM_ITEM)
#undef ENUM_ITEM
default:
UNIMPLEMENTED();
}
}
void ImplementationVisitor::Visit(CallableNode* decl,
const Signature& signature, Statement* body) {
switch (decl->kind) {
#define ENUM_ITEM(name) \
case AstNode::Kind::k##name: \
return Visit(name::cast(decl), signature, body);
AST_CALLABLE_NODE_KIND_LIST(ENUM_ITEM)
#undef ENUM_ITEM
default:
UNIMPLEMENTED();
}
}
void ImplementationVisitor::Visit(ModuleDeclaration* decl) {
Module* module = decl->GetModule();
std::ostream& source = module->source_stream();
std::ostream& header = module->header_stream();
if (decl->IsDefault()) {
source << "#include \"src/code-stub-assembler.h\"";
} else {
source << "#include \"src/builtins/builtins-" +
DashifyString(module->name()) + "-gen.h\"";
}
source << std::endl;
source << "#include \"src/builtins/builtins-utils-gen.h\"" << std::endl;
source << "#include \"src/builtins/builtins.h\"" << std::endl;
source << "#include \"src/code-factory.h\"" << std::endl;
source << "#include \"src/elements-kind.h\"" << std::endl;
source << "#include \"src/heap/factory-inl.h\"" << std::endl;
source << "#include \"src/objects.h\"" << std::endl;
source << "#include \"builtins-" + DashifyString(module->name()) +
"-from-dsl-gen.h\"";
source << std::endl << std::endl;
source << "namespace v8 {" << std::endl
<< "namespace internal {" << std::endl
<< "" << std::endl
<< "using Node = compiler::Node;" << std::endl
<< "" << std::endl;
std::string upper_name(module->name());
transform(upper_name.begin(), upper_name.end(), upper_name.begin(),
::toupper);
std::string headerDefine =
std::string("V8_TORQUE_") + upper_name + "_FROM_DSL_BASE_H__";
header << "#ifndef " << headerDefine << std::endl;
header << "#define " << headerDefine << std::endl << std::endl;
if (decl->IsDefault()) {
header << "#include \"src/code-stub-assembler.h\"";
} else {
header << "#include \"src/builtins/builtins-" +
DashifyString(module->name()) + "-gen.h\""
<< std::endl;
}
header << std::endl << std::endl;
header << "namespace v8 {" << std::endl
<< "namespace internal {" << std::endl
<< "" << std::endl;
header << "class " << GetDSLAssemblerName(module) << ": public "
<< GetBaseAssemblerName(module) << " {" << std::endl;
header << " public:" << std::endl;
header << " explicit " << GetDSLAssemblerName(module)
<< "(compiler::CodeAssemblerState* state) : "
<< GetBaseAssemblerName(module) << "(state) {}" << std::endl;
header << std::endl;
header << " using Node = compiler::Node;" << std::endl;
header << " template <class T>" << std::endl;
header << " using TNode = compiler::TNode<T>;" << std::endl;
header << " template <class T>" << std::endl;
header << " using SloppyTNode = compiler::SloppyTNode<T>;" << std::endl
<< std::endl;
Module* saved_module = module_;
module_ = module;
Declarations::NodeScopeActivator scope(declarations(), decl);
for (auto& child : decl->declarations) Visit(child);
module_ = saved_module;
DrainSpecializationQueue();
source << "} // namepsace internal" << std::endl
<< "} // namespace v8" << std::endl
<< "" << std::endl;
header << "};" << std::endl << "" << std::endl;
header << "} // namepsace internal" << std::endl
<< "} // namespace v8" << std::endl
<< "" << std::endl;
header << "#endif // " << headerDefine << std::endl;
}
void ImplementationVisitor::Visit(TorqueMacroDeclaration* decl,
const Signature& sig, Statement* body) {
Signature signature = MakeSignature(decl, decl->signature.get());
std::string name = GetGeneratedCallableName(
decl->name, declarations()->GetCurrentSpecializationTypeNamesVector());
const TypeVector& list = signature.types();
Macro* macro = declarations()->LookupMacro(name, list);
CurrentCallableActivator activator(global_context_, macro, decl);
header_out() << " ";
GenerateMacroFunctionDeclaration(header_out(), "", macro);
header_out() << ";" << std::endl;
GenerateMacroFunctionDeclaration(
source_out(), GetDSLAssemblerName(CurrentModule()) + "::", macro);
source_out() << " {" << std::endl;
const Variable* result_var = nullptr;
if (macro->HasReturnValue()) {
const Type* return_type = macro->signature().return_type;
if (!return_type->IsConstexpr()) {
GenerateIndent();
source_out() << "Node* return_default = &*SmiConstant(0);" << std::endl;
}
VisitResult init = {
return_type,
return_type->IsConstexpr()
? (return_type->GetGeneratedTypeName() + "()")
: (std::string("UncheckedCast<") +
return_type->GetGeneratedTNodeTypeName() + ">(return_default)")};
result_var =
GenerateVariableDeclaration(decl, kReturnValueVariable, {}, init);
}
Label* macro_end = declarations()->DeclareLabel("macro_end");
GenerateLabelDefinition(macro_end, decl);
const Type* result = Visit(body);
if (result->IsNever()) {
if (!macro->signature().return_type->IsNever() && !macro->HasReturns()) {
std::stringstream s;
s << "macro " << decl->name
<< " that never returns must have return type never";
ReportError(s.str());
}
} else {
if (macro->signature().return_type->IsNever()) {
std::stringstream s;
s << "macro " << decl->name
<< " has implicit return at end of its declartion but return type "
"never";
ReportError(s.str());
} else if (!macro->signature().return_type->IsVoid()) {
std::stringstream s;
s << "macro " << decl->name
<< " expects to return a value but doesn't on all paths";
ReportError(s.str());
}
}
if (macro->HasReturns()) {
if (!result->IsNever()) {
GenerateLabelGoto(macro_end);
}
GenerateLabelBind(macro_end);
}
if (result_var != nullptr) {
GenerateIndent();
source_out() << "return " << result_var->GetValueForRead() << ";"
<< std::endl;
}
source_out() << "}" << std::endl << std::endl;
}
void ImplementationVisitor::Visit(TorqueBuiltinDeclaration* decl,
const Signature& signature, Statement* body) {
std::string name = GetGeneratedCallableName(
decl->name, declarations()->GetCurrentSpecializationTypeNamesVector());
source_out() << "TF_BUILTIN(" << name << ", "
<< GetDSLAssemblerName(CurrentModule()) << ") {" << std::endl;
Builtin* builtin = declarations()->LookupBuiltin(name);
CurrentCallableActivator activator(global_context_, builtin, decl);
// Context
const Value* val =
declarations()->LookupValue(decl->signature->parameters.names[0]);
GenerateIndent();
source_out() << "TNode<Context> " << val->GetValueForDeclaration()
<< " = UncheckedCast<Context>(Parameter("
<< (builtin->IsVarArgsJavaScript() ? "Builtin" : "")
<< "Descriptor::kContext));" << std::endl;
GenerateIndent();
source_out() << "USE(" << val->GetValueForDeclaration() << ");" << std::endl;
size_t first = 1;
if (builtin->IsVarArgsJavaScript()) {
assert(decl->signature->parameters.has_varargs);
Constant* arguments = Constant::cast(declarations()->LookupValue(
decl->signature->parameters.arguments_variable));
std::string arguments_name = arguments->GetValueForDeclaration();
GenerateIndent();
source_out()
<< "Node* argc = Parameter(BuiltinDescriptor::kArgumentsCount);"
<< std::endl;
GenerateIndent();
source_out() << "CodeStubArguments arguments_impl(this, "
"ChangeInt32ToIntPtr(argc));"
<< std::endl;
const Value* receiver =
declarations()->LookupValue(decl->signature->parameters.names[1]);
GenerateIndent();
source_out() << "TNode<Object> " << receiver->GetValueForDeclaration()
<< " = arguments_impl.GetReceiver();" << std::endl;
GenerateIndent();
source_out() << "auto arguments = &arguments_impl;" << std::endl;
GenerateIndent();
source_out() << "USE(arguments);" << std::endl;
GenerateIndent();
source_out() << "USE(" << receiver->GetValueForDeclaration() << ");"
<< std::endl;
first = 2;
}
GenerateParameterList(decl->signature->parameters.names, first);
Visit(body);
source_out() << "}" << std::endl << std::endl;
}
const Type* ImplementationVisitor::Visit(VarDeclarationStatement* stmt) {
base::Optional<VisitResult> init_result;
if (stmt->initializer) {
init_result = Visit(*stmt->initializer);
}
GenerateVariableDeclaration(stmt, stmt->name, {}, init_result);
return GetTypeOracle().GetVoidType();
}
const Type* ImplementationVisitor::Visit(TailCallStatement* stmt) {
return Visit(stmt->call, true).type();
}
VisitResult ImplementationVisitor::Visit(ConditionalExpression* expr) {
std::string f1 = NewTempVariable();
std::string f2 = NewTempVariable();
// The code for both paths of the conditional need to be generated first in
// lambdas before evaluating the conditional expression because the common
// type of the result of both the true and false of the condition needs to be
// known when declaring the variable to hold the result of the conditional.
VisitResult left, right;
GenerateIndent();
source_out() << "auto " << f1 << " = [=]() ";
{
ScopedIndent indent(this, false);
source_out() << "" << std::endl;
left = Visit(expr->if_true);
GenerateIndent();
source_out() << "return " << left.variable() << ";" << std::endl;
}
source_out() << ";" << std::endl;
GenerateIndent();
source_out() << "auto " << f2 << " = [=]() ";
{
ScopedIndent indent(this, false);
source_out() << "" << std::endl;
right = Visit(expr->if_false);
GenerateIndent();
source_out() << "return " << right.variable() << ";" << std::endl;
}
source_out() << ";" << std::endl;
const Type* common_type = GetCommonType(left.type(), right.type());
std::string result_var = NewTempVariable();
const Variable* result =
GenerateVariableDeclaration(expr, result_var, common_type);
{
ScopedIndent indent(this);
Declarations::NodeScopeActivator scope(declarations(), expr->condition);
Label* true_label = declarations()->LookupLabel(kTrueLabelName);
GenerateLabelDefinition(true_label);
Label* false_label = declarations()->LookupLabel(kFalseLabelName);
GenerateLabelDefinition(false_label);
Label* done_label = declarations()->DeclarePrivateLabel(kDoneLabelName);
GenerateLabelDefinition(done_label, expr);
VisitResult condition_result = Visit(expr->condition);
if (!condition_result.type()->IsNever()) {
GenerateBranch(condition_result, true_label, false_label);
}
GenerateLabelBind(true_label);
GenerateIndent();
source_out() << result->GetValueForWrite() << " = " << f1 << "();"
<< std::endl;
GenerateLabelGoto(done_label);
GenerateLabelBind(false_label);
GenerateIndent();
source_out() << result->GetValueForWrite() << " = " << f2 << "();"
<< std::endl;
GenerateLabelGoto(done_label);
GenerateLabelBind(done_label);
}
return VisitResult(common_type, result->GetValueForRead());
}
VisitResult ImplementationVisitor::Visit(LogicalOrExpression* expr) {
VisitResult left_result;
{
Declarations::NodeScopeActivator scope(declarations(), expr->left);
Label* false_label = declarations()->LookupLabel(kFalseLabelName);
GenerateLabelDefinition(false_label);
left_result = Visit(expr->left);
if (left_result.type()->IsBool()) {
Label* true_label = declarations()->LookupLabel(kTrueLabelName);
GenerateIndent();
source_out() << "GotoIf(" << left_result.variable() << ", "
<< true_label->generated() << ");" << std::endl;
} else if (!left_result.type()->IsConstexprBool()) {
GenerateLabelBind(false_label);
}
}
VisitResult right_result = Visit(expr->right);
if (right_result.type() != left_result.type()) {
std::stringstream stream;
stream << "types of left and right expression of logical OR don't match (\""
<< left_result.type() << "\" vs. \"" << right_result.type() << "\")";
ReportError(stream.str());
}
if (left_result.type()->IsConstexprBool()) {
return VisitResult(left_result.type(), std::string("(") +
left_result.variable() + " || " +
right_result.variable() + ")");
} else {
return right_result;
}
}
VisitResult ImplementationVisitor::Visit(LogicalAndExpression* expr) {
VisitResult left_result;
{
Declarations::NodeScopeActivator scope(declarations(), expr->left);
Label* true_label = declarations()->LookupLabel(kTrueLabelName);
GenerateLabelDefinition(true_label);
left_result = Visit(expr->left);
if (left_result.type()->IsBool()) {
Label* false_label = declarations()->LookupLabel(kFalseLabelName);
GenerateIndent();
source_out() << "GotoIfNot(" << left_result.variable() << ", "
<< false_label->generated() << ");" << std::endl;
} else if (!left_result.type()->IsConstexprBool()) {
GenerateLabelBind(true_label);
}
}
VisitResult right_result = Visit(expr->right);
if (right_result.type() != left_result.type()) {
std::stringstream stream;
stream
<< "types of left and right expression of logical AND don't match (\""
<< left_result.type() << "\" vs. \"" << right_result.type() << "\")";
ReportError(stream.str());
}
if (left_result.type()->IsConstexprBool()) {
return VisitResult(left_result.type(), std::string("(") +
left_result.variable() + " && " +
right_result.variable() + ")");
} else {
return right_result;
}
}
VisitResult ImplementationVisitor::Visit(IncrementDecrementExpression* expr) {
VisitResult value_copy;
auto location_ref = GetLocationReference(expr->location);
VisitResult current_value =
GenerateFetchFromLocation(expr->location, location_ref);
if (expr->postfix) {
value_copy = GenerateCopy(current_value);
}
VisitResult one = {GetTypeOracle().GetConstInt31Type(), "1"};
Arguments args;
args.parameters = {current_value, one};
VisitResult assignment_value = GenerateOperation(
expr->op == IncrementDecrementOperator::kIncrement ? "+" : "-", args);
GenerateAssignToLocation(expr->location, location_ref, assignment_value);
return expr->postfix ? value_copy : assignment_value;
}
VisitResult ImplementationVisitor::Visit(AssignmentExpression* expr) {
LocationReference location_ref = GetLocationReference(expr->location);
VisitResult assignment_value;
if (expr->op) {
VisitResult location_value =
GenerateFetchFromLocation(expr->location, location_ref);
assignment_value = Visit(expr->value);
Arguments args;
args.parameters = {assignment_value, assignment_value};
assignment_value = GenerateOperation(*expr->op, args);
GenerateAssignToLocation(expr->location, location_ref, assignment_value);
} else {
assignment_value = Visit(expr->value);
GenerateAssignToLocation(expr->location, location_ref, assignment_value);
}
return assignment_value;
}
VisitResult ImplementationVisitor::Visit(NumberLiteralExpression* expr) {
// TODO(tebbi): Do not silently loose precision; support 64bit literals.
double d = std::stod(expr->number.c_str());
int32_t i = static_cast<int32_t>(d);
const Type* result_type =
declarations()->LookupType(CONST_FLOAT64_TYPE_STRING);
if (i == d) {
if (Internals::IsValidSmi(i)) {
if (sizeof(void*) == sizeof(double) && ((i >> 30) != (i >> 31))) {
result_type = declarations()->LookupType(CONST_INT32_TYPE_STRING);
} else {
result_type = declarations()->LookupType(CONST_INT31_TYPE_STRING);
}
}
}
std::string temp = GenerateNewTempVariable(result_type);
source_out() << expr->number << ";" << std::endl;
return VisitResult{result_type, temp};
}
VisitResult ImplementationVisitor::Visit(StringLiteralExpression* expr) {
std::string temp = GenerateNewTempVariable(GetTypeOracle().GetStringType());
source_out() << "StringConstant(\""
<< expr->literal.substr(1, expr->literal.size() - 2) << "\");"
<< std::endl;
return VisitResult{GetTypeOracle().GetStringType(), temp};
}
VisitResult ImplementationVisitor::GetBuiltinCode(Builtin* builtin) {
if (builtin->IsExternal() || builtin->kind() != Builtin::kStub) {
ReportError(
"creating function pointers is only allowed for internal builtins with "
"stub linkage");
}
const Type* type = declarations()->GetFunctionPointerType(
builtin->signature().parameter_types.types,
builtin->signature().return_type);
std::string code =
"HeapConstant(Builtins::CallableFor(isolate(), Builtins::k" +
builtin->name() + ").code())";
return VisitResult(type, code);
}
VisitResult ImplementationVisitor::Visit(IdentifierExpression* expr) {
std::string name = expr->name;
if (expr->generic_arguments.size() != 0) {
Generic* generic = declarations()->LookupGeneric(expr->name);
TypeVector specialization_types = GetTypeVector(expr->generic_arguments);
name = GetGeneratedCallableName(name, specialization_types);
CallableNode* callable = generic->declaration()->callable;
QueueGenericSpecialization({generic, specialization_types}, callable,
callable->signature.get(),
generic->declaration()->body);
}
if (Builtin* builtin = Builtin::DynamicCast(declarations()->Lookup(name))) {
return GetBuiltinCode(builtin);
}
return GenerateFetchFromLocation(expr, GetLocationReference(expr));
}
VisitResult ImplementationVisitor::Visit(CastExpression* expr) {
Arguments args;
args.parameters = {Visit(expr->value)};
args.labels = LabelsFromIdentifiers({expr->otherwise});
return GenerateOperation("cast<>", args, declarations()->GetType(expr->type));
}
VisitResult ImplementationVisitor::Visit(ConvertExpression* expr) {
Arguments args;
args.parameters = {Visit(expr->value)};
return GenerateOperation("convert<>", args,
declarations()->GetType(expr->type));
}
const Type* ImplementationVisitor::Visit(GotoStatement* stmt) {
Label* label = declarations()->LookupLabel(stmt->label);
if (stmt->arguments.size() != label->GetParameterCount()) {
std::stringstream stream;
stream << "goto to label has incorrect number of parameters (expected "
<< std::to_string(label->GetParameterCount()) << " found "
<< std::to_string(stmt->arguments.size()) << ")";
ReportError(stream.str());
}
size_t i = 0;
for (Expression* e : stmt->arguments) {
VisitResult result = Visit(e);
Variable* var = label->GetParameter(i++);
GenerateAssignToVariable(var, result);
}
GenerateLabelGoto(label);
label->MarkUsed();
return GetTypeOracle().GetNeverType();
}
const Type* ImplementationVisitor::Visit(IfStatement* stmt) {
ScopedIndent indent(this);
bool has_else = stmt->if_false.has_value();
if (stmt->is_constexpr) {
VisitResult expression_result = Visit(stmt->condition);
if (!(expression_result.type() == GetTypeOracle().GetConstexprBoolType())) {
std::stringstream stream;
stream << "expression should return type \"constexpr bool\" but doesn't";
ReportError(stream.str());
}
const Type* left_result;
const Type* right_result = GetTypeOracle().GetVoidType();
{
GenerateIndent();
source_out() << "if ((" << expression_result.variable() << ")) ";
ScopedIndent indent(this, false);
source_out() << std::endl;
left_result = Visit(stmt->if_true);
}
if (has_else) {
source_out() << " else ";
ScopedIndent indent(this, false);
source_out() << std::endl;
right_result = Visit(*stmt->if_false);
}
if (left_result->IsNever() != right_result->IsNever()) {
std::stringstream stream;
stream << "either both or neither branches in a constexpr if statement "
"must reach their end at"
<< PositionAsString(stmt->pos);
ReportError(stream.str());
}
source_out() << std::endl;
return left_result;
} else {
Label* true_label = nullptr;
Label* false_label = nullptr;
{
Declarations::NodeScopeActivator scope(declarations(), &*stmt->condition);
true_label = declarations()->LookupLabel(kTrueLabelName);
GenerateLabelDefinition(true_label);
false_label = declarations()->LookupLabel(kFalseLabelName);
GenerateLabelDefinition(false_label, !has_else ? stmt : nullptr);
}
Label* done_label = nullptr;
bool live = false;
if (has_else) {
done_label = declarations()->DeclarePrivateLabel("if_done_label");
GenerateLabelDefinition(done_label, stmt);
} else {
done_label = false_label;
live = true;
}
std::vector<Statement*> blocks = {stmt->if_true};
std::vector<Label*> labels = {true_label, false_label};
if (has_else) blocks.push_back(*stmt->if_false);
if (GenerateExpressionBranch(stmt->condition, labels, blocks, done_label)) {
live = true;
}
if (live) {
GenerateLabelBind(done_label);
}
return live ? GetTypeOracle().GetVoidType()
: GetTypeOracle().GetNeverType();
}
}
const Type* ImplementationVisitor::Visit(WhileStatement* stmt) {
ScopedIndent indent(this);
Label* body_label = nullptr;
Label* exit_label = nullptr;
{
Declarations::NodeScopeActivator scope(declarations(), stmt->condition);
body_label = declarations()->LookupLabel(kTrueLabelName);
GenerateLabelDefinition(body_label);
exit_label = declarations()->LookupLabel(kFalseLabelName);
GenerateLabelDefinition(exit_label);
}
Label* header_label = declarations()->DeclarePrivateLabel("header");
GenerateLabelDefinition(header_label, stmt);
GenerateLabelGoto(header_label);
GenerateLabelBind(header_label);
Declarations::NodeScopeActivator scope(declarations(), stmt->body);
BreakContinueActivator activator(global_context_, exit_label, header_label);
GenerateExpressionBranch(stmt->condition, {body_label, exit_label},
{stmt->body}, header_label);
GenerateLabelBind(exit_label);
return GetTypeOracle().GetVoidType();
}
const Type* ImplementationVisitor::Visit(BlockStatement* block) {
Declarations::NodeScopeActivator scope(declarations(), block);
ScopedIndent indent(this);
const Type* type = GetTypeOracle().GetVoidType();
for (Statement* s : block->statements) {
if (type->IsNever()) {
std::stringstream stream;
stream << "statement after non-returning statement";
ReportError(stream.str());
}
type = Visit(s);
}
return type;
}
const Type* ImplementationVisitor::Visit(DebugStatement* stmt) {
#if defined(DEBUG)
GenerateIndent();
source_out() << "Print(\""
<< "halting because of '" << stmt->reason << "' at "
<< PositionAsString(stmt->pos) << "\");" << std::endl;
#endif
GenerateIndent();
if (stmt->never_continues) {
source_out() << "Unreachable();" << std::endl;
return GetTypeOracle().GetNeverType();
} else {
source_out() << "DebugBreak();" << std::endl;
return GetTypeOracle().GetVoidType();
}
}
const Type* ImplementationVisitor::Visit(AssertStatement* stmt) {
#if defined(DEBUG)
// CSA_ASSERT & co. are not used here on purpose for two reasons. First,
// Torque allows and handles two types of expressions in the if protocol
// automagically, ones that return TNode<BoolT> and those that use the
// BranchIf(..., Label* true, Label* false) idiom. Because the machinery to
// handle this is embedded in the expression handling and to it's not possible
// to make the decision to use CSA_ASSERT or CSA_ASSERT_BRANCH isn't trivial
// up-front. Secondly, on failure, the assert text should be the corresponding
// Torque code, not the -gen.cc code, which would be the case when using
// CSA_ASSERT_XXX.
Label* true_label = nullptr;
Label* false_label = nullptr;
Declarations::NodeScopeActivator scope(declarations(), stmt->expression);
true_label = declarations()->LookupLabel(kTrueLabelName);
GenerateLabelDefinition(true_label);
false_label = declarations()->LookupLabel(kFalseLabelName);
GenerateLabelDefinition(false_label);
VisitResult expression_result = Visit(stmt->expression);
if (expression_result.type() == GetTypeOracle().GetBoolType()) {
GenerateBranch(expression_result, true_label, false_label);
} else {
if (expression_result.type() != GetTypeOracle().GetNeverType()) {
std::stringstream s;
s << "unexpected return type " << expression_result.type()
<< " for branch expression";
ReportError(s.str());
}
}
GenerateLabelBind(false_label);
GenerateIndent();
source_out() << "Print(\""
<< "assert '" << stmt->source << "' failed at "
<< PositionAsString(stmt->pos) << "\");" << std::endl;
GenerateIndent();
source_out() << "Unreachable();" << std::endl;
GenerateLabelBind(true_label);
#endif
return GetTypeOracle().GetVoidType();
}
const Type* ImplementationVisitor::Visit(ExpressionStatement* stmt) {
const Type* type = Visit(stmt->expression).type();
return type->IsNever() ? type : GetTypeOracle().GetVoidType();
}
const Type* ImplementationVisitor::Visit(ReturnStatement* stmt) {
Callable* current_callable = global_context_.GetCurrentCallable();
if (current_callable->signature().return_type->IsNever()) {
std::stringstream s;
s << "cannot return from a function with return type never";
ReportError(s.str());
}
Label* end = current_callable->IsMacro()
? declarations()->LookupLabel("macro_end")
: nullptr;
if (current_callable->HasReturnValue()) {
if (!stmt->value) {
std::stringstream s;
s << "return expression needs to be specified for a return type of "
<< current_callable->signature().return_type;
ReportError(s.str());
}
VisitResult expression_result = Visit(*stmt->value);
VisitResult return_result = GenerateImplicitConvert(
current_callable->signature().return_type, expression_result);
if (current_callable->IsMacro()) {
Variable* var =
Variable::cast(declarations()->LookupValue(kReturnValueVariable));
GenerateAssignToVariable(var, return_result);
GenerateLabelGoto(end);
} else if (current_callable->IsBuiltin()) {
if (Builtin::cast(current_callable)->IsVarArgsJavaScript()) {
GenerateIndent();
source_out() << "arguments->PopAndReturn(" << return_result.variable()
<< ");" << std::endl;
} else {
GenerateIndent();
source_out() << "Return(" << return_result.variable() << ");"
<< std::endl;
}
} else {
UNREACHABLE();
}
} else {
if (stmt->value) {
std::stringstream s;
s << "return expression can't be specified for a void or never return "
"type";
ReportError(s.str());
}
GenerateLabelGoto(end);
}
current_callable->IncrementReturns();
return GetTypeOracle().GetNeverType();
}
const Type* ImplementationVisitor::Visit(ForOfLoopStatement* stmt) {
Declarations::NodeScopeActivator scope(declarations(), stmt);
VisitResult expression_result = Visit(stmt->iterable);
VisitResult begin =
stmt->begin ? Visit(*stmt->begin)
: VisitResult(GetTypeOracle().GetConstInt31Type(), "0");
VisitResult end =
stmt->end ? Visit(*stmt->end)
: GenerateOperation(".length", {{expression_result}, {}});
Label* body_label = declarations()->DeclarePrivateLabel("body");
GenerateLabelDefinition(body_label);
Label* increment_label = declarations()->DeclarePrivateLabel("increment");
GenerateLabelDefinition(increment_label);
Label* exit_label = declarations()->DeclarePrivateLabel("exit");
GenerateLabelDefinition(exit_label);
const Type* common_type = GetCommonType(begin.type(), end.type());
Variable* index_var = GenerateVariableDeclaration(
stmt, std::string(kForIndexValueVariable) + "_" + NewTempVariable(),
common_type, begin);
VisitResult index_for_read = {index_var->type(),
index_var->GetValueForRead()};
Label* header_label = declarations()->DeclarePrivateLabel("header");
GenerateLabelDefinition(header_label, stmt);
GenerateLabelGoto(header_label);
GenerateLabelBind(header_label);
BreakContinueActivator activator(global_context_, exit_label,
increment_label);
VisitResult result = GenerateOperation("<", {{index_for_read, end}, {}});
GenerateBranch(result, body_label, exit_label);
GenerateLabelBind(body_label);
VisitResult element_result =
GenerateOperation("[]", {{expression_result, index_for_read}, {}});
GenerateVariableDeclaration(stmt->var_declaration,
stmt->var_declaration->name, {}, element_result);
Visit(stmt->body);
GenerateLabelGoto(increment_label);
GenerateLabelBind(increment_label);
Arguments increment_args;
increment_args.parameters = {index_for_read,
{GetTypeOracle().GetConstInt31Type(), "1"}};
VisitResult increment_result = GenerateOperation("+", increment_args);
GenerateAssignToVariable(index_var, increment_result);
GenerateLabelGoto(header_label);
GenerateLabelBind(exit_label);
return GetTypeOracle().GetVoidType();
}
const Type* ImplementationVisitor::Visit(TryCatchStatement* stmt) {
ScopedIndent indent(this);
Label* try_done = declarations()->DeclarePrivateLabel("try_done");
GenerateLabelDefinition(try_done);
const Type* try_result = GetTypeOracle().GetNeverType();
std::vector<Label*> labels;
// Output labels for the goto handlers and for the merge after the try.
{
// Activate a new scope to see handler labels
Declarations::NodeScopeActivator scope(declarations(), stmt);
for (LabelBlock* block : stmt->label_blocks) {
CurrentSourcePosition::Scope scope(block->pos);
Label* label = declarations()->LookupLabel(block->label);
labels.push_back(label);
GenerateLabelDefinition(label);
}
size_t i = 0;
for (auto label : labels) {
Declarations::NodeScopeActivator scope(declarations(),
stmt->label_blocks[i]->body);
for (auto& v : label->GetParameters()) {
GenerateVariableDeclaration(stmt, v->name(), v->type());
v->Define();
}
++i;
}
Label* try_begin_label = declarations()->DeclarePrivateLabel("try_begin");
GenerateLabelDefinition(try_begin_label);
GenerateLabelGoto(try_begin_label);
// Visit try
if (GenerateLabeledStatementBlocks({stmt->try_block},
std::vector<Label*>({try_begin_label}),
try_done)) {
try_result = GetTypeOracle().GetVoidType();
}
}
// Make sure that each label clause is actually used. It's not just a friendly
// thing to do, it will cause problems downstream in the compiler if there are
// bound labels that are never jumped to.
auto label_iterator = stmt->label_blocks.begin();
for (auto label : labels) {
CurrentSourcePosition::Scope scope((*label_iterator)->pos);
if (!label->IsUsed()) {
std::stringstream s;
s << "label ";
s << (*label_iterator)->label;
s << " has a handler block but is never referred to in try block";
ReportError(s.str());
}
label_iterator++;
}
// Visit and output the code for each catch block, one-by-one.
std::vector<Statement*> bodies;
for (LabelBlock* block : stmt->label_blocks) bodies.push_back(block->body);
if (GenerateLabeledStatementBlocks(bodies, labels, try_done)) {
try_result = GetTypeOracle().GetVoidType();
}
if (!try_result->IsNever()) {
GenerateLabelBind(try_done);
}
return try_result;
}
const Type* ImplementationVisitor::Visit(BreakStatement* stmt) {
Label* break_label = global_context_.GetCurrentBreak();
if (break_label == nullptr) {
ReportError("break used outside of loop");
}
GenerateLabelGoto(break_label);
return GetTypeOracle().GetNeverType();
}
const Type* ImplementationVisitor::Visit(ContinueStatement* stmt) {
Label* continue_label = global_context_.GetCurrentContinue();
if (continue_label == nullptr) {
ReportError("continue used outside of loop");
}
GenerateLabelGoto(continue_label);
return GetTypeOracle().GetNeverType();
}
const Type* ImplementationVisitor::Visit(ForLoopStatement* stmt) {
Declarations::NodeScopeActivator scope(declarations(), stmt);
if (stmt->var_declaration) Visit(*stmt->var_declaration);
Label* body_label = nullptr;
Label* exit_label = nullptr;
{
Declarations::NodeScopeActivator scope(declarations(), stmt->test);
body_label = declarations()->LookupLabel(kTrueLabelName);
GenerateLabelDefinition(body_label);
exit_label = declarations()->LookupLabel(kFalseLabelName);
GenerateLabelDefinition(exit_label);
}
Label* header_label = declarations()->DeclarePrivateLabel("header");
GenerateLabelDefinition(header_label, stmt);
GenerateLabelGoto(header_label);
GenerateLabelBind(header_label);
Label* assignment_label = declarations()->DeclarePrivateLabel("assignment");
GenerateLabelDefinition(assignment_label);
BreakContinueActivator activator(global_context_, exit_label,
assignment_label);
std::vector<Label*> labels = {body_label, exit_label};
if (GenerateExpressionBranch(stmt->test, labels, {stmt->body},
assignment_label)) {
ScopedIndent indent(this);
GenerateLabelBind(assignment_label);
Visit(stmt->action);
GenerateLabelGoto(header_label);
}
GenerateLabelBind(exit_label);
return GetTypeOracle().GetVoidType();
}
void ImplementationVisitor::GenerateImplementation(const std::string& dir,
Module* module) {
std::string new_source(module->source());
std::string base_file_name =
"builtins-" + DashifyString(module->name()) + "-from-dsl-gen";
std::string source_file_name = dir + "/" + base_file_name + ".cc";
ReplaceFileContentsIfDifferent(source_file_name, new_source);
std::string new_header(module->header());
std::string header_file_name = dir + "/" + base_file_name + ".h";
ReplaceFileContentsIfDifferent(header_file_name, new_header);
}
std::string ImplementationVisitor::GetBaseAssemblerName(Module* module) {
if (module == global_context_.GetDefaultModule()) {
return "CodeStubAssembler";
} else {
std::string assembler_name(CamelifyString(module->name()) +
"BuiltinsAssembler");
return assembler_name;
}
}
std::string ImplementationVisitor::GetDSLAssemblerName(Module* module) {
std::string assembler_name(CamelifyString(module->name()) +
"BuiltinsFromDSLAssembler");
return assembler_name;
}
void ImplementationVisitor::GenerateIndent() {
for (size_t i = 0; i <= indent_; ++i) {
source_out() << " ";
}
}
void ImplementationVisitor::GenerateMacroFunctionDeclaration(
std::ostream& o, const std::string& macro_prefix, Macro* macro) {
if (global_context_.verbose()) {
std::cout << "generating source for declaration " << *macro << ""
<< std::endl;
}
// Quite a hack here. Make sure that TNode is namespace qualified if the
// macro name is also qualified.
std::string return_type_name(
macro->signature().return_type->GetGeneratedTypeName());
if (macro_prefix != "" && (return_type_name.length() > 5) &&
(return_type_name.substr(0, 5) == "TNode")) {
o << "compiler::";
}
o << return_type_name;
o << " " << macro_prefix << macro->name() << "(";
DCHECK_EQ(macro->signature().types().size(), macro->parameter_names().size());
auto type_iterator = macro->signature().types().begin();
bool first = true;
for (const std::string& name : macro->parameter_names()) {
if (!first) {
o << ", ";
}
const Value* parameter = declarations()->LookupValue(name);
const Type* parameter_type = *type_iterator;
const std::string& generated_type_name =
parameter_type->GetGeneratedTypeName();
o << generated_type_name << " " << parameter->GetValueForDeclaration();
type_iterator++;
first = false;
}
for (const LabelDeclaration& label_info : macro->signature().labels) {
Label* label = declarations()->LookupLabel(label_info.name);
if (!first) {
o << ", ";
}
o << "Label* " << label->generated();
for (Variable* var : label->GetParameters()) {
std::string generated_type_name("TVariable<");
generated_type_name += var->type()->GetGeneratedTNodeTypeName();
generated_type_name += ">*";
o << ", ";
o << generated_type_name << " " << var->GetValueForDeclaration();
}
}
o << ")";
}
VisitResult ImplementationVisitor::GenerateOperation(
const std::string& operation, Arguments arguments,
base::Optional<const Type*> return_type) {
TypeVector parameter_types(arguments.parameters.GetTypeVector());
auto i = global_context_.op_handlers_.find(operation);
if (i != global_context_.op_handlers_.end()) {
for (auto handler : i->second) {
if (GetTypeOracle().IsCompatibleSignature(handler.parameter_types,
parameter_types)) {
// Operators used in a bit context can also be function calls that never
// return but have a True and False label
if (!return_type && handler.result_type->IsNever()) {
if (arguments.labels.size() == 0) {
Label* true_label = declarations()->LookupLabel(kTrueLabelName);
arguments.labels.push_back(true_label);
Label* false_label = declarations()->LookupLabel(kFalseLabelName);
arguments.labels.push_back(false_label);
}
}
if (!return_type || (GetTypeOracle().IsAssignableFrom(
*return_type, handler.result_type))) {
return GenerateCall(handler.macro_name, arguments, false);
}
}
}
}
std::stringstream s;
s << "cannot find implementation of operation \"" << operation
<< "\" with types " << parameter_types;
ReportError(s.str());
return VisitResult(GetTypeOracle().GetVoidType(), "");
}
void ImplementationVisitor::GenerateChangedVarsFromControlSplit(AstNode* node) {
const std::set<const Variable*>& changed_vars =
global_context_.GetControlSplitChangedVariables(
node, declarations()->GetCurrentSpecializationTypeNamesVector());
source_out() << "{";
bool first = true;
for (auto v : changed_vars) {
if (v->type()->IsConstexpr()) continue;
if (first) {
first = false;
} else {
source_out() << ", ";
}
source_out() << v->GetValueForDeclaration();
}
source_out() << "}";
}
const Type* ImplementationVisitor::GetCommonType(const Type* left,
const Type* right) {
const Type* common_type = GetTypeOracle().GetVoidType();
if (GetTypeOracle().IsAssignableFrom(left, right)) {
common_type = left;
} else if (GetTypeOracle().IsAssignableFrom(right, left)) {
common_type = right;
} else {
std::stringstream s;
s << "illegal combination of types " << left << " and " << right;
ReportError(s.str());
}
return common_type;
}
VisitResult ImplementationVisitor::GenerateCopy(const VisitResult& to_copy) {
std::string temp = GenerateNewTempVariable(to_copy.type());
source_out() << to_copy.variable() << ";" << std::endl;
GenerateIndent();
source_out() << "USE(" << temp << ");" << std::endl;
return VisitResult(to_copy.type(), temp);
}
LocationReference ImplementationVisitor::GetLocationReference(
LocationExpression* location) {
switch (location->kind) {
case AstNode::Kind::kIdentifierExpression:
return GetLocationReference(static_cast<IdentifierExpression*>(location));
case AstNode::Kind::kFieldAccessExpression:
return GetLocationReference(
static_cast<FieldAccessExpression*>(location));
case AstNode::Kind::kElementAccessExpression:
return GetLocationReference(
static_cast<ElementAccessExpression*>(location));
default:
UNREACHABLE();
}
}
VisitResult ImplementationVisitor::GenerateFetchFromLocation(
LocationExpression* location, LocationReference reference) {
switch (location->kind) {
case AstNode::Kind::kIdentifierExpression:
return GenerateFetchFromLocation(
static_cast<IdentifierExpression*>(location), reference);
case AstNode::Kind::kFieldAccessExpression:
return GenerateFetchFromLocation(
static_cast<FieldAccessExpression*>(location), reference);
case AstNode::Kind::kElementAccessExpression:
return GenerateFetchFromLocation(
static_cast<ElementAccessExpression*>(location), reference);
default:
UNREACHABLE();
}
}
void ImplementationVisitor::GenerateAssignToVariable(Variable* var,
VisitResult value) {
VisitResult casted_value = GenerateImplicitConvert(var->type(), value);
GenerateIndent();
source_out() << var->GetValueForWrite() << " = " << casted_value.variable()
<< ";" << std::endl;
var->Define();
}
void ImplementationVisitor::GenerateAssignToLocation(
LocationExpression* location, const LocationReference& reference,
VisitResult assignment_value) {
if (IdentifierExpression::cast(location)) {
Value* value = reference.value;
if (value->IsConst()) {
std::stringstream s;
s << "\"" << value->name()
<< "\" is declared const (maybe implicitly) and cannot be assigned to";
ReportError(s.str());
}
Variable* var = Variable::cast(value);
GenerateAssignToVariable(var, assignment_value);
} else if (auto access = FieldAccessExpression::cast(location)) {
GenerateOperation(std::string(".") + access->field + "=",
{{reference.base, assignment_value}, {}});
} else {
DCHECK_NOT_NULL(ElementAccessExpression::cast(location));
GenerateOperation(
"[]=", {{reference.base, reference.index, assignment_value}, {}});
}
}
Variable* ImplementationVisitor::GenerateVariableDeclaration(
AstNode* node, const std::string& name,
const base::Optional<const Type*>& type,
const base::Optional<VisitResult>& initialization) {
Variable* variable = nullptr;
if (declarations()->TryLookup(name)) {
variable = Variable::cast(declarations()->LookupValue(name));
} else {
variable = declarations()->DeclareVariable(name, *type);
// Because the variable is being defined during code generation, it must be
// assumed that it changes along all control split paths because it's no
// longer possible to run the control-flow anlaysis in the declaration pass
// over the variable.
global_context_.MarkVariableChanged(
node, declarations()->GetCurrentSpecializationTypeNamesVector(),
variable);
}
GenerateIndent();
if (variable->type()->IsConstexpr()) {
source_out() << variable->type()->GetGeneratedTypeName();
source_out() << " " << variable->GetValueForDeclaration() << "_impl;"
<< std::endl;
} else {
source_out() << "TVARIABLE(";
source_out() << variable->type()->GetGeneratedTNodeTypeName();
source_out() << ", " << variable->GetValueForDeclaration() << "_impl);"
<< std::endl;
}
GenerateIndent();
source_out() << "auto " << variable->GetValueForDeclaration() << " = &"
<< variable->GetValueForDeclaration() << "_impl;" << std::endl;
GenerateIndent();
source_out() << "USE(" << variable->GetValueForDeclaration() << ");"
<< std::endl;
if (initialization) {
GenerateAssignToVariable(variable, *initialization);
}
return variable;
}
void ImplementationVisitor::GenerateParameter(
const std::string& parameter_name) {
const Value* val = declarations()->LookupValue(parameter_name);
std::string var = val->GetValueForDeclaration();
GenerateIndent();
source_out() << val->type()->GetGeneratedTypeName() << " " << var << " = ";
source_out() << "UncheckedCast<" << val->type()->GetGeneratedTNodeTypeName()
<< ">(Parameter(Descriptor::k" << CamelifyString(parameter_name)
<< "));" << std::endl;
GenerateIndent();
source_out() << "USE(" << var << ");" << std::endl;
}
void ImplementationVisitor::GenerateParameterList(const NameVector& list,
size_t first) {
for (auto p : list) {
if (first == 0) {
GenerateParameter(p);
} else {
first--;
}
}
}
VisitResult ImplementationVisitor::GeneratePointerCall(
Expression* callee, const Arguments& arguments, bool is_tailcall) {
TypeVector parameter_types(arguments.parameters.GetTypeVector());
VisitResult callee_result = Visit(callee);
if (!callee_result.type()->IsFunctionPointerType()) {
std::stringstream stream;
stream << "Expected a function pointer type but found "
<< callee_result.type();
ReportError(stream.str());
}
const FunctionPointerType* type =
FunctionPointerType::cast(callee_result.type());
std::vector<std::string> variables;
for (size_t current = 0; current < arguments.parameters.size(); ++current) {
const Type* to_type = type->parameter_types()[current];
VisitResult result =
GenerateImplicitConvert(to_type, arguments.parameters[current]);
variables.push_back(result.variable());
}
std::string result_variable_name;
bool no_result = type->return_type()->IsVoidOrNever() || is_tailcall;
if (no_result) {
GenerateIndent();
} else {
result_variable_name = GenerateNewTempVariable(type->return_type());
source_out() << "UncheckedCast<";
source_out() << type->return_type()->GetGeneratedTNodeTypeName();
source_out() << ">(";
}
Builtin* example_builtin =
declarations()->FindSomeInternalBuiltinWithType(type);
if (is_tailcall) {
source_out() << "TailCallStub(";
} else {
source_out() << "CallStub(";
}
source_out() << "Builtins::CallableFor(isolate(), Builtins::k"
<< example_builtin->name() << ").descriptor(), "
<< callee_result.variable() << ", ";
size_t total_parameters = 0;
for (size_t i = 0; i < arguments.parameters.size(); ++i) {
if (total_parameters++ != 0) {
source_out() << ", ";
}
source_out() << variables[i];
}
if (!no_result) {
source_out() << ")";
}
source_out() << ");" << std::endl;
return VisitResult(type->return_type(), result_variable_name);
}
VisitResult ImplementationVisitor::GenerateCall(
const std::string& callable_name, const Arguments& arguments,
bool is_tailcall) {
TypeVector parameter_types(arguments.parameters.GetTypeVector());
Callable* callable = LookupCall(callable_name, parameter_types);
const Type* result_type = callable->signature().return_type;
std::vector<std::string> variables;
for (size_t current = 0; current < arguments.parameters.size(); ++current) {
const Type* to_type = (current >= callable->signature().types().size())
? GetTypeOracle().GetObjectType()
: callable->signature().types()[current];
VisitResult result =
GenerateImplicitConvert(to_type, arguments.parameters[current]);
variables.push_back(result.variable());
}
std::string result_variable_name;
if (result_type->IsVoidOrNever() || is_tailcall) {
GenerateIndent();
} else {
result_variable_name = GenerateNewTempVariable(result_type);
if (!result_type->IsConstexpr()) {
source_out() << "UncheckedCast<";
source_out() << result_type->GetGeneratedTNodeTypeName();
source_out() << ">(";
}
}
if (callable->IsBuiltin()) {
if (is_tailcall) {
source_out() << "TailCallBuiltin(Builtins::k" << callable->name() << ", ";
} else {
source_out() << "CallBuiltin(Builtins::k" << callable->name() << ", ";
}
} else if (callable->IsMacro()) {
if (is_tailcall) {
std::stringstream stream;
stream << "can't tail call a macro";
ReportError(stream.str());
}
source_out() << callable->name() << "(";
} else if (callable->IsRuntimeFunction()) {
if (is_tailcall) {
source_out() << "TailCallRuntime(Runtime::k" << callable->name() << ", ";
} else {
source_out() << "CallRuntime(Runtime::k" << callable->name() << ", ";
}
} else {
UNREACHABLE();
}
if (global_context_.verbose()) {
std::cout << "generating code for call to " << callable_name << "\n";
}
size_t total_parameters = 0;
for (size_t i = 0; i < arguments.parameters.size(); ++i) {
if (total_parameters++ != 0) {
source_out() << ", ";
}
source_out() << variables[i];
}
size_t label_count = callable->signature().labels.size();
if (label_count != arguments.labels.size()) {
std::stringstream s;
s << "unexpected number of otherwise labels for " << callable->name()
<< " (expected " << std::to_string(label_count) << " found "
<< std::to_string(arguments.labels.size()) << ")";
ReportError(s.str());
}
for (size_t i = 0; i < label_count; ++i) {
if (total_parameters++ != 0) {
source_out() << ", ";
}
Label* label = arguments.labels[i];
size_t callee_label_parameters =
callable->signature().labels[i].types.size();
if (label->GetParameterCount() != callee_label_parameters) {
std::stringstream s;
s << "label " << label->name()
<< " doesn't have the right number of parameters (found "
<< std::to_string(label->GetParameterCount()) << " expected "
<< std::to_string(callee_label_parameters) << ")";
ReportError(s.str());
}
source_out() << label->generated();
size_t j = 0;
for (auto t : callable->signature().labels[i].types) {
source_out() << ", ";
Variable* variable = label->GetParameter(j);
if (!(variable->type() == t)) {
std::stringstream s;
s << "mismatch of label parameters (expected " << t << " got "
<< label->GetParameter(j)->type() << " for parameter "
<< std::to_string(i + 1) << ")";
ReportError(s.str());
}
j++;
source_out() << variable->GetValueForDeclaration();
}
label->MarkUsed();
}
if (global_context_.verbose()) {
std::cout << "finished generating code for call to " << callable_name
<< "\n";
}
if (!result_type->IsVoidOrNever() && !is_tailcall &&
!result_type->IsConstexpr()) {
source_out() << ")";
}
source_out() << ");" << std::endl;
return VisitResult(result_type, result_variable_name);
}
void ImplementationVisitor::Visit(StandardDeclaration* decl) {
Visit(decl->callable, {}, decl->body);
}
void ImplementationVisitor::Visit(SpecializationDeclaration* decl) {
Generic* generic = declarations()->LookupGeneric(decl->name);
TypeVector specialization_types = GetTypeVector(decl->generic_parameters);
CallableNode* callable = generic->declaration()->callable;
SpecializeGeneric({{generic, specialization_types},
callable,
decl->signature.get(),
decl->body});
}
VisitResult ImplementationVisitor::Visit(CallExpression* expr,
bool is_tailcall) {
Arguments arguments;
std::string name = expr->callee.name;
bool has_template_arguments = expr->callee.generic_arguments.size() != 0;
if (has_template_arguments) {
Generic* generic = declarations()->LookupGeneric(expr->callee.name);
TypeVector specialization_types =
GetTypeVector(expr->callee.generic_arguments);
name = GetGeneratedCallableName(name, specialization_types);
CallableNode* callable = generic->declaration()->callable;
QueueGenericSpecialization({generic, specialization_types}, callable,
callable->signature.get(),
generic->declaration()->body);
}
for (Expression* arg : expr->arguments)
arguments.parameters.push_back(Visit(arg));
arguments.labels = LabelsFromIdentifiers(expr->labels);
if (expr->is_operator) {
if (is_tailcall) {
std::stringstream s;
s << "can't tail call an operator";
ReportError(s.str());
}
return GenerateOperation(name, arguments);
}
VisitResult result;
if (!has_template_arguments &&
declarations()->Lookup(expr->callee.name)->IsValue()) {
result = GeneratePointerCall(&expr->callee, arguments, is_tailcall);
} else {
result = GenerateCall(name, arguments, is_tailcall);
}
if (!result.type()->IsVoidOrNever()) {
GenerateIndent();
source_out() << "USE(" << result.variable() << ");" << std::endl;
}
if (is_tailcall) {
result = {GetTypeOracle().GetNeverType(), ""};
}
return result;
}
bool ImplementationVisitor::GenerateLabeledStatementBlocks(
const std::vector<Statement*>& blocks,
const std::vector<Label*>& statement_labels, Label* merge_label) {
bool live = false;
auto label_iterator = statement_labels.begin();
for (Statement* block : blocks) {
GenerateIndent();
source_out() << "if (" << (*label_iterator)->generated() << "->is_used())"
<< std::endl;
ScopedIndent indent(this);
GenerateLabelBind(*label_iterator++);
if (!Visit(block)->IsNever()) {
GenerateLabelGoto(merge_label);
live = true;
}
}
return live;
}
void ImplementationVisitor::GenerateBranch(const VisitResult& condition,
Label* true_label,
Label* false_label) {
GenerateIndent();
source_out() << "Branch(" << condition.variable() << ", "
<< true_label->generated() << ", " << false_label->generated()
<< ");" << std::endl;
}
bool ImplementationVisitor::GenerateExpressionBranch(
Expression* expression, const std::vector<Label*>& statement_labels,
const std::vector<Statement*>& statement_blocks, Label* merge_label) {
// Activate a new scope to define True/False catch labels
Declarations::NodeScopeActivator scope(declarations(), expression);
VisitResult expression_result = Visit(expression);
if (expression_result.type() == GetTypeOracle().GetBoolType()) {
GenerateBranch(expression_result, statement_labels[0], statement_labels[1]);
} else {
if (expression_result.type() != GetTypeOracle().GetNeverType()) {
std::stringstream s;
s << "unexpected return type " << expression_result.type()
<< " for branch expression";
ReportError(s.str());
}
}
return GenerateLabeledStatementBlocks(statement_blocks, statement_labels,
merge_label);
}
VisitResult ImplementationVisitor::GenerateImplicitConvert(
const Type* destination_type, VisitResult source) {
if (destination_type == source.type()) {
return source;
}
if (GetTypeOracle().IsImplicitlyConverableFrom(destination_type,
source.type())) {
VisitResult result(source.type(), source.variable());
Arguments args;
args.parameters = {result};
return GenerateOperation("convert<>", args, destination_type);
} else if (GetTypeOracle().IsAssignableFrom(destination_type,
source.type())) {
return VisitResult(destination_type, source.variable());
} else {
std::stringstream s;
s << "cannot use expression of type " << source.type()
<< " as a value of type " << destination_type;
ReportError(s.str());
}
return VisitResult(GetTypeOracle().GetVoidType(), "");
}
std::string ImplementationVisitor::NewTempVariable() {
std::string name("t");
name += std::to_string(next_temp_++);
return name;
}
std::string ImplementationVisitor::GenerateNewTempVariable(const Type* type) {
std::string temp = NewTempVariable();
GenerateIndent();
source_out() << type->GetGeneratedTypeName() << " " << temp << " = ";
return temp;
}
void ImplementationVisitor::GenerateLabelDefinition(Label* label,
AstNode* node) {
std::string label_string = label->generated();
std::string label_string_impl = label_string + "_impl";
GenerateIndent();
source_out() << "Label " + label_string_impl + "(this";
if (node != nullptr) {
source_out() << ", ";
GenerateChangedVarsFromControlSplit(node);
}
source_out() << ");" << std::endl;
GenerateIndent();
source_out() << "Label* " + label_string + " = &" << label_string_impl << ";"
<< std::endl;
GenerateIndent();
source_out() << "USE(" << label_string << ");" << std::endl;
}
void ImplementationVisitor::GenerateLabelBind(Label* label) {
GenerateIndent();
source_out() << "BIND(" << label->generated() << ");" << std::endl;
}
void ImplementationVisitor::GenerateLabelGoto(Label* label) {
GenerateIndent();
source_out() << "Goto(" << label->generated() << ");" << std::endl;
}
std::vector<Label*> ImplementationVisitor::LabelsFromIdentifiers(
const std::vector<std::string>& names) {
std::vector<Label*> result;
for (auto name : names) {
result.push_back(declarations()->LookupLabel(name));
}
return result;
}
} // namespace torque
} // namespace internal
} // namespace v8
```
|
```javascript
import styles from './style.module.css'
export default function Template({ children }) {
return (
<>
<h1 className={styles.red}>
Template <span id="performance-now">{performance.now()}</span>
</h1>
{children}
</>
)
}
```
|
Mill River Park is a 12-acre urban park located in Stamford, Connecticut, which separates Downtown from the West Side.
History
The park's history began in 1998, when landscape architecture firm Sasaki Associates was commissioned to draft a plan to reclaim the area along a segment of the Rippowam River known as Mill River as a public park.
In July 2007, the city government of Stamford released a master plan for the redevelopment of the area. The plan entailed three stages: the first stage, where the U.S. Army Corps of Engineers would remove a dam along the river and decrease the river's floodplain, a second stage for the construction of programming elements and walkways, and a third stage for additional amenities. The width of the Mill River was to be narrowed to less than half of its then-expanse, which would expand the park's area and provide space for more amenities. The master plan outlined the construction of a carousel, fountain, ice rink, and a network of trails connecting a greenway with the Kosciuszko, Southfield, and Scalzi parks. Removing the dam will also allow fish to swim up from Long Island Sound. As of 2007, the U.S. Army Corps of Engineers had spent $800,000 on preliminary studies, planning, and design.
In 2009, an $8 million restoration of the Mill River, $5 million of which was federally funded, began. It was followed by a second $12-million phase, which consisted primarily of installing infrastructure such as lighting, benches, and plantings.
Mill River Park was expanded in an $8.5 million project, including $4 million in federal funding earmarked in 2007, with the city government financing the rest of the cost. The federal funding was to pay for removing the Mill River dam and dredging.
As of 2013, the master plan for Mill River Park is projected to cost $60 million and to encompass 28 acres.
12 acres of the Mill River Park opened in May 2013.
In 2017, the park inaugurated the indoor carousel, and the ice skating rink and fountain were added in 2018.
The Whittingham Discovery Center, a building for educational programming described by the Stamford Advocate as "part museum, part-classroom, part community space", opened in June 2022.
Notable flora and fauna
The Mill River Park was formerly home to a grove of cherry trees, which were presented to the city on April 27, 1957, by Junzo Nojima, a native of Japan who had settled in the city in 1926, and in 1932 became the first Japanese man to own a restaurant in the state (K&J Three Decker Restaurant on Atlantic Street). Nojima gave the city 120 trees, and for three years he watered each one until they took root. He gave the city instructions on how to care for them, but when they were overlooked, he began tending the trees himself. On Arbor Day, April 27, 2007, the city celebrated the 50th anniversary of the gift with a ceremony at the park. The cherry trees were removed in March 2009, as part of the renovations in the park's construction, but seeds from a select few were transferred to a nursery, and were planted in the fall of 2012.
References
2013 establishments in Connecticut
Geography of Stamford, Connecticut
Parks in Fairfield County, Connecticut
Protected areas established in 2013
Tourist attractions in Stamford, Connecticut
|
```c++
/* -*- mode: C++; c-basic-offset: 4; indent-tabs-mode: nil -*- */
// vim: ft=cpp:expandtab:ts=8:sw=4:softtabstop=4:
#ident "$Id$"
/*
COPYING CONDITIONS NOTICE:
This program is free software; you can redistribute it and/or modify
published by the Free Software Foundation, and provided that the
following conditions are met:
* Redistributions of source code must retain this COPYING
CONDITIONS NOTICE, the COPYRIGHT NOTICE (below), the
DISCLAIMER (below), the UNIVERSITY PATENT NOTICE (below), the
PATENT MARKING NOTICE (below), and the PATENT RIGHTS
GRANT (below).
* Redistributions in binary form must reproduce this COPYING
CONDITIONS NOTICE, the COPYRIGHT NOTICE (below), the
DISCLAIMER (below), the UNIVERSITY PATENT NOTICE (below), the
PATENT MARKING NOTICE (below), and the PATENT RIGHTS
GRANT (below) in the documentation and/or other materials
provided with the distribution.
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301, USA.
COPYRIGHT NOTICE:
TokuFT, Tokutek Fractal Tree Indexing Library.
DISCLAIMER:
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 GNU
UNIVERSITY PATENT NOTICE:
The technology is licensed by the Massachusetts Institute of
Technology, Rutgers State University of New Jersey, and the Research
Foundation of State University of New York at Stony Brook under
United States of America Serial No. 11/760379 and to the patents
and/or patent applications resulting from it.
PATENT MARKING NOTICE:
This software is covered by US Patent No. 8,185,551.
This software is covered by US Patent No. 8,489,638.
PATENT RIGHTS GRANT:
"THIS IMPLEMENTATION" means the copyrightable works distributed by
Tokutek as part of the Fractal Tree project.
"PATENT CLAIMS" means the claims of patents that are owned or
licensable by Tokutek, both currently or in the future; and that in
the absence of this license would be infringed by THIS
IMPLEMENTATION or by using or running THIS IMPLEMENTATION.
"PATENT CHALLENGE" shall mean a challenge to the validity,
patentability, enforceability and/or non-infringement of any of the
PATENT CLAIMS or otherwise opposing any of the PATENT CLAIMS.
Tokutek hereby grants to you, for the term and geographical scope of
the PATENT CLAIMS, a non-exclusive, no-charge, royalty-free,
irrevocable (except as stated in this section) patent license to
make, have made, use, offer to sell, sell, import, transfer, and
otherwise run, modify, and propagate the contents of THIS
IMPLEMENTATION, where such license applies only to the PATENT
CLAIMS. This grant does not include claims that would be infringed
only as a consequence of further modifications of THIS
IMPLEMENTATION. If you or your agent or licensee institute or order
or agree to the institution of patent litigation against any entity
(including a cross-claim or counterclaim in a lawsuit) alleging that
THIS IMPLEMENTATION constitutes direct or contributory patent
infringement, or inducement of patent infringement, then any rights
such litigation is filed. If you or your agent or exclusive
licensee institute or order or agree to the institution of a PATENT
CHALLENGE, then Tokutek may terminate any rights granted to you
*/
#ident "The technology is licensed by the Massachusetts Institute of Technology, Rutgers State University of New Jersey, and the Research Foundation of State University of New York at Stony Brook under United States of America Serial No. 11/760379 and to the patents and/or patent applications resulting from it."
// verify thtat we can create the correct tree type after the db is removed
#include <sys/stat.h>
#include "test.h"
const int envflags = DB_INIT_MPOOL|DB_CREATE|DB_THREAD |DB_INIT_LOCK|DB_INIT_LOG|DB_INIT_TXN|DB_PRIVATE;
const char *namea="a.db";
const char *nameb="b.db";
static void run_test (void) {
int r;
toku_os_recursive_delete(TOKU_TEST_FILENAME);
toku_os_mkdir(TOKU_TEST_FILENAME, S_IRWXU+S_IRWXG+S_IRWXO);
DB_ENV *env;
DB *db;
r = db_env_create(&env, 0); CKERR(r);
r = env->open(env, TOKU_TEST_FILENAME, envflags, S_IRWXU+S_IRWXG+S_IRWXO); CKERR(r);
DB_TXN *txn;
r = env->txn_begin(env, NULL, &txn, 0); CKERR(r);
r = db_create(&db, env, 0); CKERR(r);
r = db->open(db, NULL, namea, NULL, DB_BTREE, DB_AUTO_COMMIT|DB_CREATE, 0666); CKERR(r);
// r = db->close(db, 0); CKERR(r);
r = env->txn_checkpoint(env, 0, 0, 0); CKERR(r);
r = txn->commit(txn, 0); CKERR(r);
toku_hard_crash_on_purpose();
}
static void run_recover (void) {
DB_ENV *env;
int r;
r = db_env_create(&env, 0); CKERR(r);
r = env->open(env, TOKU_TEST_FILENAME, envflags + DB_RECOVER, S_IRWXU+S_IRWXG+S_IRWXO); CKERR(r);
DB *db;
r = db_create(&db, env, 0); CKERR(r);
r = db->open(db, NULL, namea, NULL, DB_UNKNOWN, DB_AUTO_COMMIT, 0666); CKERR(r);
r = db->close(db, 0); CKERR(r);
r = env->close(env, 0); CKERR(r);
exit(0);
}
static void run_no_recover (void) {
DB_ENV *env;
int r;
r = db_env_create(&env, 0); CKERR(r);
r = env->open(env, TOKU_TEST_FILENAME, envflags & ~DB_RECOVER, S_IRWXU+S_IRWXG+S_IRWXO); CKERR(r);
r = env->close(env, 0); CKERR(r);
exit(0);
}
const char *cmd;
bool do_test=false, do_recover=false, do_recover_only=false, do_no_recover = false;
static void test_parse_args (int argc, char * const argv[]) {
int resultcode;
cmd = argv[0];
argc--; argv++;
while (argc>0) {
if (strcmp(argv[0], "-v") == 0) {
verbose++;
} else if (strcmp(argv[0],"-q")==0) {
verbose--;
if (verbose<0) verbose=0;
} else if (strcmp(argv[0], "--test")==0) {
do_test=true;
} else if (strcmp(argv[0], "--recover") == 0) {
do_recover=true;
} else if (strcmp(argv[0], "--recover-only") == 0) {
do_recover_only=true;
} else if (strcmp(argv[0], "--no-recover") == 0) {
do_no_recover=true;
} else if (strcmp(argv[0], "-h")==0) {
resultcode=0;
do_usage:
fprintf(stderr, "Usage:\n%s [-v|-q]* [-h] {--test | --recover } \n", cmd);
exit(resultcode);
} else {
fprintf(stderr, "Unknown arg: %s\n", argv[0]);
resultcode=1;
goto do_usage;
}
argc--;
argv++;
}
}
int test_main (int argc, char * const argv[]) {
test_parse_args(argc, argv);
if (do_test) {
run_test();
} else if (do_recover) {
run_recover();
} else if (do_recover_only) {
run_recover();
} else if (do_no_recover) {
run_no_recover();
}
return 0;
}
```
|
Norway competed at the 2019 Summer Universiade in Naples, Italy held from 3 to 14 July 2019. The country won one silver medal and one bronze medal.
Medal summary
Medal by sports
Medalists
References
External links
Official website
Nations at the 2019 Summer Universiade
Summer U
2019
|
Llanddeusant () is a community in the Black Mountain Range of the Brecon Beacons National Park in Carmarthenshire, Wales. It is about 5 miles southeast of Llangadog.
Llanddeusant lies within the Llansadwrn & Llangadog / Myddfai & Llanddeusant ward, which had a population of 2,412 at census 2001. The boundaries were changed and most of the population was shown under the Llangadog community. The remaining population at the 2011 census was 220 only. The name, meaning "church of two saints", is supposed to originate from the fact that Teilo and Saint David are believed to have met there. The 'Old Red Lion Inn' is now a Youth hostel. The community includes the hamlet of Twynllanan.
Setting
The village lies below the prominent Black Mountain Range escarpment and the glacial lake of Llyn y Fan Fach. The lake is the setting of a famous folk tale known as The Lady of the Lake.
Beacons way
A low level alternative of the footpath the Beacons Way runs by Llanddeusant. In the west, the route climbs to Carreg Cennen Castle and Garn Goch. The route formerly finished at the railway station at Llangadog but now stops at the village of Bethlehem .
The community is bordered by the communities of: Quarter Bach; Llangadog; and Myddfai, all being in Carmarthenshire; and by Llywel and Ystradgynlais in Powys.
References
External links
www.geograph.co.uk : photos of Llanddeusant and surrounding area
Communities in Carmarthenshire
|
Lee Anthony Butcher (born 11 October 1988) is an English former professional footballer who last played for Tilbury as a goalkeeper. He started his career as a youth player at Norwich City and Arsenal, before moving to Tottenham Hotspur following his release in 2007. After loan spells with a number of non-League clubs, he joined League One club Leyton Orient on loan on 14 October 2009, and signed for Orient on a permanent basis in May 2010.
Career
Early career
Born in Waltham Forest, Butcher grew up in Chingford. He started his youth career with Norwich City as a schoolboy before joining Arsenal at the age of 10, and aged 15 he was voted the Goalkeeper of the Tournament at the Cannes Football Festival of 2004. He was released from Arsenal in May 2007 and had trials with Leeds United and Wycombe Wanderers. After playing a number of pre-season friendlies for Tottenham Hotspur reserves and under-18s he eventually signed for the club.
Club career
During the 2007–08 season, Butcher made 11 appearances for the Tottenham Hotspur reserve team. In January 2008, he was loaned out to Isthmian League Premier Division club AFC Wimbledon, making his debut against Maidstone United in their 2–1 win on 5 January. He went on to make a total of seven appearances in all competitions. In September 2008, Butcher joined Margate on loan where he made four appearances during September and October. He then joined Grays Athletic in late December 2008, but did not make an appearance for the first team. St Albans City signed Butcher on loan in March 2009, where he made six appearances in the Conference South. Butcher rejoined Grays toward the end of the 2008–09 season, and made his debut in the Conference National for Grays on 18 April in the 2–0 defeat at Altrincham. Butcher made three appearances for Grays before returning to Tottenham at the end of the season.
In July 2009, Butcher signed another one-year contract with Tottenham. He then re-joined Grays Athletic, during the following 2009–10 season, on a one-month loan deal on 1 September, where he made a further five appearances in the Conference National. On 14 October, he signed on loan for League One club Leyton Orient as cover for Glenn Morris after Jamie Jones suffered an injury. Butcher returned to Tottenham on 17 November, having not made a first-team appearance for Leyton Orient.
After the end of the 2009–10 season, he signed for Leyton Orient on a one-year contract following his release from Tottenham in May 2010. He made his League debut as a substitute in the 1–1 draw at Oldham Athletic on 2 October, after Jones again suffered an injury. After making ten appearances in all competitions, he lost his place when Jason Brown was brought in on loan in late November. He remained on the bench until 25 April 2011, when a further Jones injury brought him back into the first team for the trip to Carlisle United. Butcher saved a penalty in the eighth minute, and Orient won 1–0. He returned to the first team at the beginning of the 2011–12 season due to another Jones injury, and saved two penalties in Orient's 4–3 penalty shoot-out victory over Southend United on 9 August. After establishing himself in the first team in Jones' absence, Butcher suffered an anterior cruciate ligament injury in an awkward fall in the 3–1 defeat at home to Scunthorpe United on 18 February 2012, missing the remainder of the season. He never returned to the first team through further injury, and after 38 appearances in all competitions, he was released by Orient on 30 April 2013.
Butcher joined Conference National side Welling United in August 2013 to provide cover for the injured Sam Mott. He later joined Tilbury, making 43 appearances in all competitions, but left in order to concentrate on his main job, working on the London Underground.
References
External links
1988 births
Living people
English men's footballers
Footballers from Chingford
Tottenham Hotspur F.C. players
AFC Wimbledon players
Margate F.C. players
St Albans City F.C. players
Grays Athletic F.C. players
Leyton Orient F.C. players
Welling United F.C. players
Tilbury F.C. players
English Football League players
National League (English football) players
Isthmian League players
Men's association football goalkeepers
|
"Weed the People", officially "Weed the People: A Cannabis Legalization Celebration", was an event held in Portland on July 3, 2015, two days after recreational marijuana became legal in the U.S. state of Oregon. Sponsored by the Portland Mercury and two cannabis companies, the event was attended by an estimated 1,500–2,000 people, who were provided up to seven grams of marijuana for immediate consumption or to take home. Organizers complied with restrictions on recreational sales by distributing free cannabis and required attendees to pay an entry fee. More than 1,300 tickets were sold, but the building's 500-person capacity meant long wait times to enter. Media outlets reported on the historic nature of the event, which was described as a "stoner's paradise" and a celebration of freedom.
Background and planning
"Weed the People: A Cannabis Legalization Celebration", or simply "Weed the People", was held two days after recreational marijuana became legal in Oregon. The Burnside Burn, which was organized by Portland NORML and held on the Burnside Bridge starting at midnight on July 1, 2015, preceded the event. "Weed the People" was sponsored by the local alternative weekly newspaper the Portland Mercury and two cannabis businesses— and Oregon's Cannabis Concierge. It was produced by Connie Wohn, who said enthusiasm and demand were high. The event sold out quickly (by June 24–26), and there was a waiting list with 750 additional interested participants. The Mercury cannabis correspondent Josh Taylor, who organized "Weed the People", said the event "celebrates the throwing off of oppression and the freedom of legalization". Referring to the observance of Independence Day on July 4, he said: "And now, people can watch the fireworks tomorrow while high. They were probably going to do that anyway, but we're just helping them along."
According to Wohn, event organizers were prepared and met with "any agency that could've had any sort of recourse or legal ramification on this event". The Portland Police Bureau "gave it their blessing" and did not have a large presence. Security guards were hired to perform bag searches and enforce a ban on outside alcohol and cannabis consumption. The promotional poster for "Weed the People" had patriotic imagery depicting an eagle carrying a stem of marijuana leaves in one talon and several joints in the other.
Event
The alcohol-free celebration, believed to be the "first formal event with free cannabis giveaways", took place from 2:00–9:00 pm at Metal Craft Fabrication (or MCF Craft Brewing Systems), a former craft brewery and industrial building in the North Portland section of Eliot. Between 1,500 and 2,000 participants were supplied with up to seven grams of marijuana, which they could consume openly at the event or take home. Organizers complied with a temporary limit on recreational sales by distributing free cannabis and had attendees pay a $40 entry fee. Most attendees were from the Portland metropolitan area, but residence in Oregon was not required; some attendees were from as far away as Idaho and Michigan. Inside the venue there were cannabis plants, a lounge (or "chill out area") with seating and music, smoking devices, cannabis and food vendors, and a "Grow Garden" where attendees picked up their free samples; out back was a fenced-in yard with an on-site taco truck. Guests also had the opportunity to meet farmers and producers from local businesses and dispensaries.
"Weed the People" had a few complications: organizers sold 1,336 tickets and were prepared to supply enough product for all attendees, but the building's capacity was 500, resulting in long entry lines. Hot temperatures both inside and outside the building resulted in at least two people fainting and a visit from the local fire department for medical treatment. However, people were reportedly patient as they waited in lines. There were no personal disputes during the event, and there were enough cannabis products for all attendees.
Commentary
Jamie Hale of The Oregonian called the event "historic" and "a veritable stoner's paradise", writing: In a city where recreational marijuana events have struggled just to get off the ground, Weed the People represented an effort that, while it had its issues, was unprecedented ... In cities around the country, carrying around seven grams of cannabis can mean serious jail time. In Portland on Friday, it was a cause for celebration ... It meant freedom to consume a drug people many had already been consuming, it meant freedom from fear of arrest for doing so, it meant the opportunity to smoke, to eat and to vaporize freely—a freedom many in Oregon will be exercising enthusiastically.
Willamette Week Martin Cizmar said the event was described as a "shitshow" on social media, and believed "Weed the People" was a financial success. KATU's Reed Andrews described the event as the "first of its kind" and said it "is testing the limits for what's legal when it comes to marijuana in Oregon". Sam Catherman of The State Column described the event as "a gathering that connected entrepreneurs and enthusiasts who were excited about the burgeoning industry in their state". The Stranger Christopher Frizzelle ended his reporting on the event with, "Happy freedom day, everyone. What a country." Keegan Hamilton of Vice News described the event as a "veritable weed Disneyland" and "a celebration of newfound freedom". He added: "More than just giving Oregon residents and visitors the opportunity to exercise their new legal right to get high, 'Weed the People' illustrated how vast the market is for marijuana and related products, and how strange it is that the drug is now technically legal to possess but illegal to procure for people who haven't received authorization from a doctor."
References
External links
Weed the People: A Cannabis Legalization Celebration! at Bold Type Tickets
Weed the People Portland—A Cannabis Legalization Celebration! at Facebook
Hurry! Get Your Tickets Quick for Weed the People! (June 21, 2015), Portland Mercury
2015 in cannabis
2015 in Portland, Oregon
Cannabis events in the United States
Cannabis in Oregon
Eliot, Portland, Oregon
Events in Portland, Oregon
July 2015 events in the United States
North Portland, Oregon
|
```javascript
// Flags: --expose-internals
'use strict';
require('../common');
const assert = require('assert');
const { validatePort } = require('internal/validators');
for (let n = 0; n <= 0xFFFF; n++) {
validatePort(n);
validatePort(`${n}`);
validatePort(`0x${n.toString(16)}`);
validatePort(`0o${n.toString(8)}`);
validatePort(`0b${n.toString(2)}`);
}
[
-1, 'a', {}, [], false, true,
0xFFFF + 1, Infinity, -Infinity, NaN,
undefined, null, '', ' ', 1.1, '0x',
'-0x1', '-0o1', '-0b1', '0o', '0b'
].forEach((i) => assert.throws(() => validatePort(i), {
code: 'ERR_SOCKET_BAD_PORT'
}));
```
|
```python
import numpy as np
import pytest
from smac.model.abstract_model import AbstractModel
from smac.utils.configspace import convert_configurations_to_array
__license__ = "3-clause BSD"
def get_X_y(cs, n_samples, n_instance_features):
X = convert_configurations_to_array(cs.sample_configuration(n_samples))
if n_instance_features is not None and n_instance_features > 0:
X_inst = np.random.rand(n_samples, n_instance_features)
X = np.hstack((X, X_inst))
y = np.random.rand(n_samples)
return X, y
def _train(X, Y):
return None
def test_no_pca(configspace_small, make_scenario):
n_instances = 100
n_instance_features = 10
n_samples = 5
scenario = make_scenario(
configspace_small,
use_instances=True,
n_instances=n_instances,
n_instance_features=n_instance_features,
)
model = AbstractModel(configspace_small, scenario.instance_features, pca_components=7)
# We just overwrite the function as mock here
model._train = _train
# No PCA
X, y = get_X_y(configspace_small, n_samples, n_instance_features)
model.train(X, y)
assert not model._apply_pca
X, y = get_X_y(configspace_small, n_samples, n_instance_features + 1)
with pytest.raises(ValueError, match="Feature mismatch.*"):
model.train(X, y)
X_test, _ = get_X_y(configspace_small, n_samples, None)
with pytest.raises(NotImplementedError):
model.predict_marginalized(X_test)
X_test, _ = get_X_y(configspace_small, n_samples, 10)
with pytest.raises(ValueError, match="Feature mismatch.*"):
model.predict_marginalized(X_test)
def test_pca(configspace_small, make_scenario):
n_instances = 100
n_instance_features = 10
n_samples = 155
scenario = make_scenario(
configspace_small,
use_instances=True,
n_instances=n_instances,
n_instance_features=n_instance_features,
)
model = AbstractModel(configspace_small, scenario.instance_features, pca_components=7)
# We just overwrite the function as mock here
model._train = _train
# PCA
X, y = get_X_y(configspace_small, n_samples, n_instance_features)
model.train(X, y)
assert model._apply_pca
X, y = get_X_y(configspace_small, n_samples, n_instance_features + 1)
with pytest.raises(ValueError, match="Feature mismatch.*"):
model.train(X, y)
X_test, _ = get_X_y(configspace_small, n_samples, None)
with pytest.raises(NotImplementedError):
model.predict_marginalized(X_test)
X_test, _ = get_X_y(configspace_small, n_samples, 10)
with pytest.raises(ValueError, match="Feature mismatch.*"):
model.predict_marginalized(X_test)
```
|
Herri met de Bles, also known as Henri Blès, Herri de Dinant, Herry de Patinir, and il Civetta (c. 1490 – after 1566), was a Flemish Northern Renaissance and Mannerist landscape painter, native of Bouvignes or Dinant (both in present-day Belgium).
He contributed, along with Joachim Patinir and Lucas Gassel, to a distinct style of Northern Renaissance landscape painting basically originating from Gerard David's works and combining small history or religious scenes into compositions defined by perspective and atmospheric effects. They all painted landscapes seen from a high viewpoint and rocky masses. They did not aim to create a realistic depiction but an atmospheric effect. Herri met de Bles always included a few small figures involved in a religious episode or everyday activities such as mining, agriculture or trade.
Life
The Netherlands Institute for Art History suggests that de Bles was born in Dinant in circa 1510.
Very little is known about the artist. He is believed to be identical to a certain Herry de Patenir who joined Antwerp's Guild of St. Luke in 1533 as a painter. Some speculate he was a nephew of the landscape painter Joachim Patinir, but there is not any kind of historical evidence to support this claim and he may not have trained under him because of their age difference. According to the RKD Art Institute, the only fact that connects the two painters is that they were both born in Dinant, Wallonia, Belgium.
He probably visited Ferrara, Italy as an Italian source mentions it. His work was popular in Italy, where he was known as 'il Civetta' because of the little owl that often appears in his paintings, usually in a hollow tree or in a cavity between some rocks. The 17th-century biographer Karel van Mander regarded this motif as his signature. The name Herri met de Bles translates literally from Dutch as Herri with the blaze and was reportedly given him because of his characteristic white forelock. He may have been the pupil of Lucas Gassel, who was at least 10 years his senior. There are significant similarities between their works about the subject of David and Bathsheba. Besides, they are depicted together (along with Hans Holbein) in a 1764 coloured engraving by Jan l'Admiral with Gassel being in the foreground and de Bles shown in the more obscure lower right corner.
The notname of "Pseudo Bles" was invented to cover a number of Antwerp Mannerist paintings that had previously been attributed to de Bles, after it was recognised that this was wrong. In 1915 by Max Jakob Friedländer in his work Die Antwerpener Manieristen von 1520, made a first attempt to put order in the growing number of works from the Netherlands that were catalogued under the 'name of embarrassment 'pseudo-Herri met de Bles' (usually now "Pseudo Bles").
The renowned Dutch art institute and research center, RKD describes him as still active in Antwerp in 1566, based on recently discovered contemporary documents.
Work
His landscapes are different from Patinir's in that de Bles' work shows more foreground landscapes, a looser composition and greater detail. His choice of colours is generally less rich than that of Patinir. Along with a group of Antwerp-based followers of Hieronymus Bosch that included Jan Mandyn, Pieter Huys, and Jan Wellens de Cock, de Bles brought the tradition of fantastic imagery into northern Mannerism.
Most of his sketches are in German public collections, namely in Berlin and Hamburg, one of them is stored in the Louvre, Paris. Most of his paintings are exhibited in Belgian museums (Namur, Antwerp etc.), besides in the museum of Naples and the Museum of Art History of Vienna. Other works are circulating among private collectors and auctions.
In popular culture
In Richard Powers's novel The Gold Bug Variations (1991), one of the main characters is working on a dissertation whose subject is Herri met de Bles. The painter's obscurity and his peculiar imagery are woven into the motifs of the novel.
In Olga Tokarczuk's novel "Empuzjon" one of the minor characters, a beaux arts student, is working on a PhD. thesis on Herri met de Bles.
Notes
References
Norman E. Muller (Ed.): Herri met de Bles: Studies and Explorations of the World Landscape Tradition. Brepols, Turnhout 1998,
Michel Weemans. "Herri met de Bles's sleeping peddler: an exegetical and anthropomorphic landscape". Art Bulletin, Sept 2006.
Weemans, Michel. "Herri Met de Bles's Way to Calvary: A Silenic Landscape," Art History, 32,2 (2009), 307–331.
External links
Long note on Landscape with the Conversion of Saul on the Road to Damascus, ca. 1545, Oberlin College
Web Gallery of Art: Paintings by Herri met de Bles
1510s births
16th-century deaths
Flemish Renaissance painters
Walloon people
Painters from Antwerp
Court painters
|
Pooja Dey is an Indian actress who works in Bollywood film industry. She has appeared in various projects like Gandii Baat , Dating in the Dark, Maaya 4. Her upcoming project is Oas.
Career
Dey hails from Guwahati, Assam . She has started her acting career with the show Dating in the Dark. After that she has acted in Gandii Baat. Her upcoming web series is Maaya 4.
Filmography
References
External links
Living people
Indian film actresses
Actresses in Hindi television
Year of birth missing (living people)
|
```javascript
import './badge';
import '../icon/icon';
import '../list/list-item';
import '../list/list';
import '../typography/typography';
export default {
title: 'Components/Badge',
argTypes: {
size: { options: ['large', 'small'], control: { type: 'select' } },
verticalAlignment: {
options: ['top', 'bottom'],
control: { type: 'select' },
},
horizontalAlignment: {
options: ['right', 'left'],
control: { type: 'select' },
},
},
args: {
content: 22,
max: 99,
size: 'large',
verticalAlignment: 'top',
horizontalAlignment: 'right',
showZero: true,
hideBadge: false,
},
};
const Template = ({
content,
max,
size,
showZero,
hideBadge,
verticalAlignment,
horizontalAlignment,
}) => {
return `<cv-badge${content || content == 0 ? ` content=${content}` : ''}${
size ? ` size=${size}` : ''
}${max ? ` max=${max}` : ''}${
verticalAlignment ? ` verticalAlignment=${verticalAlignment}` : ''
}${horizontalAlignment ? ` horizontalAlignment=${horizontalAlignment}` : ''}${
showZero ? ' showZero' : ''
}${hideBadge ? ' hideBadge' : ''}>
<cv-icon style="font-size: 36px">chat<cv-icon>
</cv-badge>`;
};
const ListTemplate = () => {
return `
<div style="margin-bottom: 3em;">
<cv-typography scale="headline5">Basic</cv-typography>
<cv-badge content='Hello world'></cv-badge>
</div>
<cv-typography scale="headline5">Used in a list</cv-typography>
<cv-list>
<cv-list-item>
<span style="padding-right: 2em;">Item 1</span>
<cv-badge content=22 max=999></cv-badge>
</cv-list-item>
<cv-list-item>
<span style="padding-right: 2em;">Item 2</span>
<cv-badge content=1000 max=999></cv-badge>
</cv-list-item>
</cv-list>`;
};
export const Large = Template.bind({});
Large.args = {
content: 3,
max: 99,
};
export const LargeWithLimit = Template.bind({});
LargeWithLimit.args = {
content: 9999,
max: 99,
};
export const Small = Template.bind({});
Small.args = {
size: 'small',
};
export const Basic = ListTemplate.bind({});
```
|
```c++
// your_sha256_hash------------
// - Open3D: www.open3d.org -
// your_sha256_hash------------
// your_sha256_hash------------
#include "open3d/visualization/rendering/CameraInteractorLogic.h"
namespace open3d {
namespace visualization {
namespace rendering {
CameraInteractorLogic::CameraInteractorLogic(Camera* c, double min_far_plane)
: RotationInteractorLogic(c, min_far_plane), fov_at_mouse_down_(60.0) {}
void CameraInteractorLogic::SetBoundingBox(
const geometry::AxisAlignedBoundingBox& bounds) {
Super::SetBoundingBox(bounds);
// Initialize parent's matrix_ (in case we do a mouse wheel, which
// doesn't involve a mouse down) and the center of rotation.
SetMouseDownInfo(camera_->GetModelMatrix(),
bounds.GetCenter().cast<float>());
}
void CameraInteractorLogic::Rotate(int dx, int dy) {
Super::Rotate(dx, dy);
camera_->SetModelMatrix(GetMatrix());
}
void CameraInteractorLogic::RotateZ(int dx, int dy) {
Super::RotateZ(dx, dy);
camera_->SetModelMatrix(GetMatrix());
}
void CameraInteractorLogic::RotateFly(int dx, int dy) {
// Fly/first-person shooter rotation is always about the current camera
// matrix, and the camera's position, so we need to update Super's
// matrix information.
Super::SetMouseDownInfo(camera_->GetModelMatrix(), camera_->GetPosition());
Super::Rotate(-dx, -dy);
camera_->SetModelMatrix(GetMatrix());
}
void CameraInteractorLogic::Dolly(float dy, DragType type) {
// Parent's matrix_ may not have been set yet
if (type != DragType::MOUSE) {
SetMouseDownInfo(camera_->GetModelMatrix(), center_of_rotation_);
}
Super::Dolly(dy, type);
}
void CameraInteractorLogic::Dolly(float z_dist, Camera::Transform matrix_in) {
Super::Dolly(z_dist, matrix_in);
auto matrix = GetMatrix();
camera_->SetModelMatrix(matrix);
UpdateCameraFarPlane();
}
void CameraInteractorLogic::Pan(int dx, int dy) {
Super::Pan(dx, dy);
camera_->SetModelMatrix(GetMatrix());
}
void CameraInteractorLogic::RotateLocal(float angle_rad,
const Eigen::Vector3f& axis) {
auto model_matrix = camera_->GetModelMatrix(); // copy
model_matrix.rotate(Eigen::AngleAxis<float>(angle_rad, axis));
camera_->SetModelMatrix(model_matrix);
}
void CameraInteractorLogic::MoveLocal(const Eigen::Vector3f& v) {
auto model_matrix = camera_->GetModelMatrix(); // copy
model_matrix.translate(v);
camera_->SetModelMatrix(model_matrix);
}
void CameraInteractorLogic::Zoom(int dy, DragType drag_type) {
float d_fov = 0.0f; // initialize to make GCC happy
switch (drag_type) {
case DragType::MOUSE:
d_fov = float(-dy) * 0.1f; // deg
break;
case DragType::TWO_FINGER:
d_fov = float(dy) * 0.2f; // deg
break;
case DragType::WHEEL: // actual mouse wheel, same as two-fingers
d_fov = float(dy) * 2.0f; // deg
break;
}
float old_fov = 0.0f;
if (drag_type == DragType::MOUSE) {
old_fov = float(fov_at_mouse_down_);
} else {
old_fov = float(camera_->GetFieldOfView());
}
float new_fov = old_fov + d_fov;
new_fov = std::max(5.0f, new_fov);
new_fov = std::min(90.0f, new_fov);
float to_radians = float(M_PI / 180.0);
float near = float(camera_->GetNear());
Eigen::Vector3f camera_pos, cor;
if (drag_type == DragType::MOUSE) {
camera_pos = matrix_at_mouse_down_.translation();
cor = center_of_rotation_at_mouse_down_;
} else {
camera_pos = camera_->GetPosition();
cor = center_of_rotation_;
}
Eigen::Vector3f to_cor = cor - camera_pos;
float old_dist_from_plane_to_cor = to_cor.norm() - near;
float new_dist_from_plane_to_cor =
(near + old_dist_from_plane_to_cor) *
std::tan(old_fov / 2.0f * to_radians) /
std::tan(new_fov / 2.0f * to_radians) -
near;
if (drag_type == DragType::MOUSE) {
Dolly(-(new_dist_from_plane_to_cor - old_dist_from_plane_to_cor),
matrix_at_mouse_down_);
} else {
Dolly(-(new_dist_from_plane_to_cor - old_dist_from_plane_to_cor),
camera_->GetModelMatrix());
}
float aspect = 1.0f;
if (view_height_ > 0) {
aspect = float(view_width_) / float(view_height_);
}
camera_->SetProjection(new_fov, aspect, camera_->GetNear(),
camera_->GetFar(), camera_->GetFieldOfViewType());
}
void CameraInteractorLogic::StartMouseDrag() {
Super::SetMouseDownInfo(camera_->GetModelMatrix(), center_of_rotation_);
fov_at_mouse_down_ = camera_->GetFieldOfView();
}
void CameraInteractorLogic::ResetMouseDrag() { StartMouseDrag(); }
void CameraInteractorLogic::UpdateMouseDragUI() {}
void CameraInteractorLogic::EndMouseDrag() {}
} // namespace rendering
} // namespace visualization
} // namespace open3d
```
|
Ahmadabad (, also Romanized as Aḩmadābād) is a village in Daran Rural District, in the Central District of Jolfa County, East Azerbaijan Province, Iran. At the 2006 census, its population was 80, in 25 families.
References
Populated places in Jolfa County
|
```smalltalk
//
// Fizzler - CSS Selector Engine for Microsoft .NET Framework
//
// This library is free software; you can redistribute it and/or modify it under
// any later version.
//
// This library is distributed in the hope that it will be useful, but WITHOUT
// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
// details.
//
// along with this library; if not, write to the Free Software Foundation, Inc.,
// 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
//
#endregion
namespace Fizzler
{
#region Imports
using System;
using System.Collections.Generic;
using System.Linq;
#endregion
/// <summary>
/// A selector generator implementation for an arbitrary document/element system.
/// </summary>
public class SelectorGenerator<TElement> : ISelectorGenerator
{
private readonly IEqualityComparer<TElement> _equalityComparer;
private readonly Stack<Selector<TElement>> _selectors;
/// <summary>
/// Initializes a new instance of this object with an instance
/// of <see cref="IElementOps{TElement}"/> and the default equality
/// comparer that is used for determining if two elements are equal.
/// </summary>
public SelectorGenerator(IElementOps<TElement> ops) : this(ops, null) {}
/// <summary>
/// Initializes a new instance of this object with an instance
/// of <see cref="IElementOps{TElement}"/> and an equality comparer
/// used for determining if two elements are equal.
/// </summary>
public SelectorGenerator(IElementOps<TElement> ops, IEqualityComparer<TElement> equalityComparer)
{
if(ops == null) throw new ArgumentNullException("ops");
Ops = ops;
_equalityComparer = equalityComparer ?? EqualityComparer<TElement>.Default;
_selectors = new Stack<Selector<TElement>>();
}
/// <summary>
/// Gets the selector implementation.
/// </summary>
/// <remarks>
/// If the generation is not complete, this property returns the
/// last generated selector.
/// </remarks>
public Selector<TElement> Selector { get; private set; }
/// <summary>
/// Gets the <see cref="IElementOps{TElement}"/> instance that this object
/// was initialized with.
/// </summary>
public IElementOps<TElement> Ops { get; private set; }
/// <summary>
/// Returns the collection of selector implementations representing
/// a group.
/// </summary>
/// <remarks>
/// If the generation is not complete, this method return the
/// selectors generated so far in a group.
/// </remarks>
public IEnumerable<Selector<TElement>> GetSelectors()
{
var selectors = _selectors;
var top = Selector;
return top == null
? selectors.Select(s => s)
: selectors.Concat(Enumerable.Repeat(top, 1));
}
/// <summary>
/// Adds a generated selector.
/// </summary>
protected void Add(Selector<TElement> selector)
{
if(selector == null) throw new ArgumentNullException("selector");
var top = Selector;
Selector = top == null ? selector : (elements => selector(top(elements)));
}
/// <summary>
/// Delimits the initialization of a generation.
/// </summary>
public virtual void OnInit()
{
_selectors.Clear();
Selector = null;
}
/// <summary>
/// Delimits a selector generation in a group of selectors.
/// </summary>
public virtual void OnSelector()
{
if (Selector != null)
_selectors.Push(Selector);
Selector = null;
}
/// <summary>
/// Delimits the closing/conclusion of a generation.
/// </summary>
public virtual void OnClose()
{
var sum = GetSelectors().Aggregate((a, b) => (elements => a(elements).Concat(b(elements))));
var normalize = Ops.Descendant();
Selector = elements => sum(normalize(elements)).Distinct(_equalityComparer);
_selectors.Clear();
}
/// <summary>
/// Generates a <a href="path_to_url#Id-selectors">ID selector</a>,
/// which represents an element instance that has an identifier that
/// matches the identifier in the ID selector.
/// </summary>
public virtual void Id(string id)
{
Add(Ops.Id(id));
}
/// <summary>
/// Generates a <a href="path_to_url#class-html">class selector</a>,
/// which is an alternative <see cref="ISelectorGenerator.AttributeIncludes"/> when
/// representing the <c>class</c> attribute.
/// </summary>
public virtual void Class(string clazz)
{
Add(Ops.Class(clazz));
}
/// <summary>
/// Generates a <a href="path_to_url#type-selectors">type selector</a>,
/// which represents an instance of the element type in the document tree.
/// </summary>
public virtual void Type(NamespacePrefix prefix, string type)
{
Add(Ops.Type(prefix, type));
}
/// <summary>
/// Generates a <a href="path_to_url#universal-selector">universal selector</a>,
/// any single element in the document tree in any namespace
/// (including those without a namespace) if no default namespace
/// has been specified for selectors.
/// </summary>
public virtual void Universal(NamespacePrefix prefix)
{
Add(Ops.Universal(prefix));
}
/// <summary>
/// Generates an <a href="path_to_url#attribute-selectors">attribute selector</a>
/// that represents an element with the given attribute <paramref name="name"/>
/// whatever the values of the attribute.
/// </summary>
public virtual void AttributeExists(NamespacePrefix prefix, string name)
{
Add(Ops.AttributeExists(prefix, name));
}
/// <summary>
/// Generates an <a href="path_to_url#attribute-selectors">attribute selector</a>
/// that represents an element with the given attribute <paramref name="name"/>
/// and whose value is exactly <paramref name="value"/>.
/// </summary>
public virtual void AttributeExact(NamespacePrefix prefix, string name, string value)
{
Add(Ops.AttributeExact(prefix, name, value));
}
/// <summary>
/// Generates an <a href="path_to_url#attribute-selectors">attribute selector</a>
/// that represents an element with the given attribute <paramref name="name"/>
/// and whose value is a whitespace-separated list of words, one of
/// which is exactly <paramref name="value"/>.
/// </summary>
public virtual void AttributeIncludes(NamespacePrefix prefix, string name, string value)
{
Add(Ops.AttributeIncludes(prefix, name, value));
}
/// <summary>
/// Generates an <a href="path_to_url#attribute-selectors">attribute selector</a>
/// that represents an element with the given attribute <paramref name="name"/>,
/// its value either being exactly <paramref name="value"/> or beginning
/// with <paramref name="value"/> immediately followed by "-" (U+002D).
/// </summary>
public virtual void AttributeDashMatch(NamespacePrefix prefix, string name, string value)
{
Add(Ops.AttributeDashMatch(prefix, name, value));
}
/// <summary>
/// Generates an <a href="path_to_url#attribute-selectors">attribute selector</a>
/// that represents an element with the attribute <paramref name="name"/>
/// whose value begins with the prefix <paramref name="value"/>.
/// </summary>
public void AttributePrefixMatch(NamespacePrefix prefix, string name, string value)
{
Add(Ops.AttributePrefixMatch(prefix, name, value));
}
/// <summary>
/// Generates an <a href="path_to_url#attribute-selectors">attribute selector</a>
/// that represents an element with the attribute <paramref name="name"/>
/// whose value ends with the suffix <paramref name="value"/>.
/// </summary>
public void AttributeSuffixMatch(NamespacePrefix prefix, string name, string value)
{
Add(Ops.AttributeSuffixMatch(prefix, name, value));
}
/// <summary>
/// Generates an <a href="path_to_url#attribute-selectors">attribute selector</a>
/// that represents an element with the attribute <paramref name="name"/>
/// whose value contains at least one instance of the substring <paramref name="value"/>.
/// </summary>
public void AttributeSubstring(NamespacePrefix prefix, string name, string value)
{
Add(Ops.AttributeSubstring(prefix, name, value));
}
/// <summary>
/// Generates a <a href="path_to_url#pseudo-classes">pseudo-class selector</a>,
/// which represents an element that is the first child of some other element.
/// </summary>
public virtual void FirstChild()
{
Add(Ops.FirstChild());
}
/// <summary>
/// Generates a <a href="path_to_url#pseudo-classes">pseudo-class selector</a>,
/// which represents an element that is the last child of some other element.
/// </summary>
public virtual void LastChild()
{
Add(Ops.LastChild());
}
/// <summary>
/// Generates a <a href="path_to_url#pseudo-classes">pseudo-class selector</a>,
/// which represents an element that is the N-th child of some other element.
/// </summary>
public virtual void NthChild(int a, int b)
{
Add(Ops.NthChild(a, b));
}
/// <summary>
/// Generates a <a href="path_to_url#pseudo-classes">pseudo-class selector</a>,
/// which represents an element that has a parent element and whose parent
/// element has no other element children.
/// </summary>
public virtual void OnlyChild()
{
Add(Ops.OnlyChild());
}
/// <summary>
/// Generates a <a href="path_to_url#pseudo-classes">pseudo-class selector</a>,
/// which represents an element that has no children at all.
/// </summary>
public virtual void Empty()
{
Add(Ops.Empty());
}
/// <summary>
/// Generates a <a href="path_to_url#combinators">combinator</a>,
/// which represents a childhood relationship between two elements.
/// </summary>
public virtual void Child()
{
Add(Ops.Child());
}
/// <summary>
/// Generates a <a href="path_to_url#combinators">combinator</a>,
/// which represents a relationship between two elements where one element is an
/// arbitrary descendant of some ancestor element.
/// </summary>
public virtual void Descendant()
{
Add(Ops.Descendant());
}
/// <summary>
/// Generates a <a href="path_to_url#combinators">combinator</a>,
/// which represents elements that share the same parent in the document tree and
/// where the first element immediately precedes the second element.
/// </summary>
public virtual void Adjacent()
{
Add(Ops.Adjacent());
}
/// <summary>
/// Generates a <a href="path_to_url#combinators">combinator</a>,
/// which separates two sequences of simple selectors. The elements represented
/// by the two sequences share the same parent in the document tree and the
/// element represented by the first sequence precedes (not necessarily
/// immediately) the element represented by the second one.
/// </summary>
public virtual void GeneralSibling()
{
Add(Ops.GeneralSibling());
}
/// <summary>
/// Generates a <a href="path_to_url#pseudo-classes">pseudo-class selector</a>,
/// which represents an element that is the N-th child from bottom up of some other element.
/// </summary>
public void NthLastChild(int a, int b)
{
Add(Ops.NthLastChild(a, b));
}
}
}
```
|
Stonewall Jackson Elementary School may refer to several schools in the United States:
Stonewall Jackson Elementary School, Bristol, Virginia; see Bristol Virginia Public Schools
Stonewall Jackson Elementary School, Plant City, Florida; see Hillsborough County Public Schools
Mockingbird Elementary School (Dallas), Texas, formerly named Stonewall Jackson Elementary School
See also
Stonewall Jackson School (disambiguation)
|
The Georgetown Center for Liturgy, founded in 1981 by Georgetown University and Holy Trinity Catholic Church, was an education, research, and consultation center dedicated to transforming American Catholic parishes through the liturgical renewal initiated by the Second Vatican Council. The Center for Liturgy offered a range of quality national and regional programs and conducted parish liturgical missions, training days and consultations. The Center is no longer in operation.
History
In 1981 Fr. Timothy Healy, S.J., then president of Georgetown University, and Fr. Al Panuska, S.J., the Provincial of the Maryland Province, recognized the need for specialized centers to assist the American Catholic Church with the implementation of the liturgical reforms initiated by the Second Vatican Council. This prompted Fathers Healy and Panuska to establish The Georgetown Center for Liturgy, Spirituality and the Arts (later known as The Georgetown Center for Liturgy), a unique joint project of Georgetown University and its neighbor, Holy Trinity Catholic Church. Being rooted in both a university and a parish assured that the Center’s work would be supported by the strength of the university’s resources and educational expertise and informed by the actual pastoral experiences of a parish.
Fr. Lawrence J. Madden, S.J., who held a doctorate in liturgical studies from the University of Trier, Germany, was selected to head up the project. Father Madden had been Director of Campus Ministry and a member of the Theology Faculty at Georgetown University for the preceding ten years. Upon becoming Director of the new Center for Liturgy, Father Madden also became an associate pastor of Holy Trinity parish; later he served as pastor. His participation in the life of the parish helped to shape the overall mission of the Center as one concerned not only with the theoretical dimension of liturgy but also with congregational praxis.
Under Madden’s direction, the Center for Liturgy became a nationally known and widely respected education, research, and consultation center whose primary focus was to ensure the quality of Roman Catholic worship in the United States. Madden was also on the governing board of the Catholic Coalition on Preaching. Paul F. X. Corvino served as associate director.
Since the Second Vatican Council, remarkable strides have been made in the renewal of Catholic liturgy, including the use of the vernacular in the liturgy, the involvement of the laity, the greater role of Scripture in Catholic worship, and the composition of new music to enhance the celebration of the reformed rites. On the other hand, the shortage of priests has led to the creation of larger and larger churches, which can house more people for fewer Masses. Madden noted, “It takes a tremendous amount of skill for somebody to lead 1,200 people as opposed to 700 and the feel is very different to the assembly.”
Madden devoted much of his priestly ministry to helping parishes celebrate the liturgy well. His calming influence as Holy Trinity’s pastor in the 1990s is credited with defusing tension (much of it involving liturgical issues) between the Jesuit-run parish and the Washington archdiocese. Father Madden died of a heart attack May 29, 2011 at Georgetown University.
Programs
The staff undertook research projects, published regularly in liturgical and pastoral journals, and offered courses at Georgetown University. Among the programs offers by the Center for Liturgy were:
"Leading from the Heart", a long distance learning program for presiders and preachers that integrated ritual studies, theology and spirituality, and developed performance capacity; the distance learning program included "coaches" to assist the learner in building practical competency in their role.
Study Tours Abroad: The Center conducted annual liturgical study tours led by GCL staff, which explored the intersection between liturgy, art, and architecture. Tour locations included Rome in 2007 and 2008, and Amsterdam and Brussels in 2008.
Conferences
Northeast Liturgical Conference (2003)
Liturgy-Justice Colloquium (2003)
The Joseph Campbell Phenomenon (1991)
Twenty-Five Years Since the Constitution on the Sacred Liturgy (1988)
Form/Reform (1986-2006)
Talks and Retreats on liturgy, spirituality, and parish life.
Advent Celebration: Each December the Georgetown Center for Liturgy hosted an Advent Celebration which included a Eucharistic Celebration and Reception, and the presentation of an annual Award for Outstanding Contributions Made to the Liturgical Life of the American Church.
EnVision Church
EnVisionChurch was the Center’s interactive online resource for liturgy and spirituality. It offered articles on sacred art and architecture, seasonal worship environments, places of spirit, and liturgy. These articles, written by professionals in each field, provide insight and advice for those interested in the intersections between liturgy, theology, spirituality, sacred art and architecture.
In addition to its information resources, EnVisionChurch was also a forum for learning, sharing, networking, and conversation among professionals who assist faith communities with building and/or renovating places of worship and with commissioning artwork; parish leaders, building/renovation committees, parishioners engaged in liturgical ministries (including art and environment committees), and facility/maintenance staff; and diocesan building/renovation and facilities commissions and offices.
It hosted a gallery of images, a library of resources, and a catalog of professionals. Although the Center for Liturgy no longer operates, the Georgetown University Library continues to provide the platform for hosting the "Rev. Paul Cioffi, S.J Images Collection" of approximately 3,000 photographs of early Christian sites and places of worship in Europe and North America.
Georgetown Center for Liturgy staff publications
Sunday Mass: Our Role and Why it Matters - Anne Y. Koester
Liturgy and Justice: To Worship God in Spirit and Truth - Anne Y. Koester, editor
Called To Participate: Theological, Ritual, And Social Perspectives - by Mark Searle, edited by Barbara Searle and Anne Y. Koester
Vision: The Scholarly Contributions of Mark Searle to Liturgical Renewal - Anne Y. Koester and Barbara Searle, editors
Celebrating Marriage: Preparing the Wedding Liturgy -- Workbook for Engaged Couples, Third Edition - Paul Covino, John Buscemi, Dr. Elaine Rendler, Lawrence Madden, S.J.
The Joseph Campbell Phenomenon - Lawrence Madden, S.J.
The Awakening Church - Lawrence J. Madden, S.J., editor
External links
EnVisionChurch
Georgetown University
References
Center for Liturgy
|
Popotan is a 2003 anime series based on the visual novel of the same name produced by the company, Petit Ferret. The story follows three girls, sisters Ai, Mai and Mii, and their maid, Mea, as they travel through time without aging, along with the mansion they live in. One of the sisters occasionally gathers crucial intelligence from conversations with dandelions—referred to as popotan—as they search for the mysterious figure of Shizuku. Popotan is a play on the Japanese word for "dandelions", tanpopo. It was developed by Shaft, directed and storyboarded by Shinichiro Kimura, and written by Jukki Hanada. The characters were designed by Haruka Sakurai and originally created by Akio Watanabe, under the alias of Poyoyon Rock.
Twelve episodes were produced. They originally aired on Tokyo Broadcasting System's satellite station BS-i, from July 18, 2003 through October 3, 2003, and were also made available at the same time on the Bandai Channel. On August 27 and 28, 2003, an event with the first volume Japanese DVD of Popotan was shown Animate Ikebukuro in Japan. The event featured guest appearances by the anime's voice actress for the three sisters.
On June 27, 2003, a teaser DVD with character designs by Haruka Sakurai was released. The DVD, contains video interviews with the anime's voice actors, a CD containing music to the radio drama's, , theme , metallic paint illustrations and a plushie of Unagi. The anime was released on Japanese DVD by Bandai Visual in six discs of two episodes each. The set was released in staggered fashion between September 26, 2003 and February 25, 2004. Each disc also came with a promotional figurine of one of the girls. At the same time, Bandai released DVDs without the figurines at a lower cost. Geneon USA licensed the DVDs for North American release. Between December 7, 2004 and April 26, 2005, three DVDs were produced, each containing four episodes. A final box set was released on August 14, 2007, shortly before Geneon USA's demise. Sentai Filmworks, the licensing arm of ADV Films, announced that it had licensed the anime and would release the complete series in October 2009.
The Popotan anime has had one album and one extended play (EP) released. The album is the original soundtrack by Osamu Tezuka containing the television edited opening theme by Under17 and the closing theme "Suki" by Funta. A joint EP, , was released by Under17 and Funta which contained the unedited versions of both songs as well as a joint song, "Gem Stone", which has also been listed as a theme song for the anime. The opening theme was also released on Under17's greatest hits compilation, .
Episode list
Notes
References
General
Specific
Popotan
Episodes
|
The 1994 Slick 50 500 was the 30th and penultimate stock car race of the 1994 NASCAR Winston Cup Series season, the 13th and penultimate race of the 1994 NASCAR Winston West Series, and the seventh iteration of the event. The race was held on Sunday, October 30, 1994, before an audience of 96,000 in Avondale, Arizona at Phoenix International Raceway, a 1-mile (1.6 km) permanent low-banked tri-oval race track. The race took the scheduled 312 laps to complete. At race's end, Hendrick Motorsports driver Terry Labonte would manage to dominate the late stages of the race to take his 14th career NASCAR Winston Cup Series victory and his third and final victory of the season. To fill out the top three, Roush Racing driver Mark Martin and Morgan–McClure Motorsports driver Sterling Marlin would finish second and third, respectively.
Background
Phoenix International Raceway – also known as PIR – is a one-mile, low-banked tri-oval race track located in Avondale, Arizona. It is named after the nearby metropolitan area of Phoenix. The motorsport track opened in 1964 and currently hosts two NASCAR race weekends annually. PIR has also hosted the IndyCar Series, CART, USAC and the Rolex Sports Car Series. The raceway is currently owned and operated by International Speedway Corporation.
The raceway was originally constructed with a 2.5 mi (4.0 km) road course that ran both inside and outside of the main tri-oval. In 1991 the track was reconfigured with the current 1.51 mi (2.43 km) interior layout. PIR has an estimated grandstand seating capacity of around 67,000. Lights were installed around the track in 2004 following the addition of a second annual NASCAR race weekend.
Entry list
(R) denotes rookie driver.
Qualifying
Qualifying was split into two rounds. The first round was held on Friday, October 28, at 6:00 PM EST. Each driver would have one lap to set a time. During the first round, the top 20 drivers in the round would be guaranteed a starting spot in the race. If a driver was not able to guarantee a spot in the first round, they had the option to scrub their time from the first round and try and run a faster lap time in a second round qualifying run, held on Saturday, October 29, at 4:00 PM EST. As with the first round, each driver would have one lap to set a time. For this specific race, positions 21-40 would be decided on time, and depending on who needed it, a select amount of positions were given to cars who had not otherwise qualified but were high enough in owner's points; which was two for cars in the NASCAR Winston Cup Series and one extra provisional for the NASCAR Winston West Series. If needed, a past champion who did not qualify on either time or provisionals could use a champion's provisional, adding one more spot to the field.
Sterling Marlin, driving for Morgan–McClure Motorsports, would win the pole, setting a time of 27.728 and an average speed of in the first round.
11 drivers would fail to qualify.
Full qualifying results
Race results
Standings after the race
Drivers' Championship standings
Note: Only the first 10 positions are included for the driver standings.
References
Slick 50 500
Slick 50 500
NASCAR races at Phoenix Raceway
October 1994 sports events in the United States
|
Morocco women's national under-17 football team, also nicknamed the Atlas Lionesses is a youth association football team operated under the auspices of Royal Moroccan Football Federation. Its primary role is the development of players in preparation for the senior Morocco women's national football team. In June 2022, The team qualified for the FIFA U-17 Women's World Cup which would be held in India, becoming the first North African side to qualify for the finals.
History
Difficult beginnings
The national team made its official debut in March 2016 during a doubleheader against Ghana in the African U-17 Women's World Cup qualification. Led by Fatima Tagnaout and Sanaâ Mssoudy, who would later become prominent figures in the Morocco women's national football team, Morocco faced defeats in both matches. The first leg ended in a 4-0 loss in Rabat, while the second leg resulted in a 6-0 defeat in Accra. The team also failed to qualify for the subsequent edition of the 2018 FIFA U-17 Women's World Cup after being eliminated by South Africa. Morocco experienced a 5-1 loss in the first leg in Salé, followed by a 1-0 defeat in Pretoria. In their pursuit of qualification for the 2020 World Cup, the national team participated in the African qualifiers. After securing a convincing 7-0 victory in the first leg against Djibouti in Djibouti and another 7-0 win in the second leg in Salé, Morocco advanced. They also triumphed with a 1-0 first-leg win against Botswana in Gaborone, but the return leg was canceled due to the COVID-19 pandemic. Unfortunately, the competition was ultimately canceled, and the qualifiers could not be completed as planned. Consequently, the qualifying tournament was postponed until 2022.
First qualification for a World Cup
On June 4, 2022, the Moroccan national team, led by Patrick Cordoba, achieved a historic milestone by qualifying for the first time in their history for the 2022 FIFA U-17 Women's World Cup. The tournament took place in India from October 11 to 30, 2022. During the qualifying phase, Morocco displayed their strength by eliminating Benin, Niger, and Ghana to secure their spot in the final tournament. In preparation for the World Cup, Morocco engaged in a friendly double-confrontation against Portugal in September 2022. However, the Moroccans faced a heavy defeat in the first match held in Santarém on September 20, 2022, with a score of 8-0. In the second match, played in Rio Maior on September 22, 2022, Portugal claimed a 2-0 victory. Doha El Madani was the sole Moroccan player to find the net during these matches. Prior to the World Cup, Morocco faced Chile in their final match in Goa, resulting in a 3-1 loss, with Iman El Hannachi scoring the only goal for Morocco.
World Cup 2022 in India
Under the guidance of French coach Anthony Rimasson, Morocco made its debut in the World Cup during the 2022 FIFA U-17 Women's World Cup. Their first match took place on October 11, 2022, against Brazil, a team with a strong tournament history. Unfortunately, the match concluded with a 1-0 victory for Brazil. However, the Moroccan team bounced back in their second group stage match on October 14, 2022, securing a remarkable 3-0 win against India. Notably, Doha El Madani made history by becoming the first Moroccan player to score a goal in the U-17 World Cup, converting a penalty. Yasmine Zouhir and Djennah Chérif also contributed goals to the match, marking this victory as a significant milestone for Morocco in the history of the competition. In their final group stage match on October 17, 2022, in Goa, Morocco faced the United States. Despite their best efforts, the "Lioncelles de l'Atlas" were outplayed and suffered a 4-0 defeat.
Fixtures and results
Legend
2022
Current squad
The following players were selected for the 2022 FIFA U-17 Women's World Cup.
Competitive record
FIFA U-17 Women's World Cup record
African U-17 Cup of Nations for Women record
Arab U-17 Women's Cup
See also
Morocco women's national football team
Morocco women's national under-20 football team
Notes
References
under-17
European women's national under-17 association football teams
Arabic women's national under-17 association football teams
|
Amado García Guerrero (June 2, 1931 – June 2, 1961) was one of the conspirators against, and killers of, Dominican dictator Rafael Leónidas Trujillo.
Assassination of Rafael Trujillo
He was a soldier in the Dominican Republic. A member of the Military Aides-de-Camp of Rafael Leonidas Trujillo, he was the person who informed the other conspirators that Trujillo would later leave that night for San Cristóbal. He also was one of the assassins in the ambush on the highway. The story of the revolutionaries and their personal motivations for participating in the assassination of Trujillo, serves to writers as Mario Vargas Llosa, as examples of the experiences with atrocities of the general population suffered during the Trujillo's regime.
The reasons for Amado García's actions against Trujillo were:
Trujillo officially denied García permission to marry the girl he loved, Luisa, because she happened to be sister of René Gil a "dangerous communist rebel" (who searched for refuge in a foreign embassy in Santo Domingo).
Military police forced García to kill a young prisoner, who he later discovered was the brother of his fiancée.
As is described by Vargas Llosa in La Fiesta del Chivo, Amado García Guerrero was a soldier who, due to a capricious test of his loyalty, executed a man with the bandaged eyes. Soon, he was told that the man he just executed was the brother of his ex-fiancée. Later, Salvador Sadhalá tried to console him by saying, "It's a lie, Amadito... It could be any other [man]. He deceived you... Forget about what was said to you. Forget about what you did."
According to Bernard Diederich, the reason for Trujillo's refusal of García's marriage request was that his fiancé's brother had looked for asylum in a foreign embassy in the capital. Later, Amadito received the order to shoot (some say to merely watch the execution of) a victim seated in the jail of the SIM. García followed orders, hoping that it would save himself and the man further torture. Later, García recounted his troubles to Estrella Sadhalá and swore to assassinate Trujillo (Diederich 74).
Following this oath, Amado, youngest of the conspirators, joined his new comrades in a plan to kill Trujillo.
On May 30, 1961, the men regrouped and awaited Trujillo on the side of a highway, where they knew from inside intelligence that the dictator would be passing by on his way to visit his family and he wouldn't have many security surrounding him.
The men were:
Modesto Díaz Quezada,
Luis Manuel Cáceres Michel,
Juan Tomás Diaz,
Manuel de Ovín Filpo (Spaniard immigrant and agronomist technician),
Salvador Estrella Sadhalá (a.k.a. "El Turco"),
Huáscar Antonio Tejeda Pimentel,
Luis Amiama Tió,
Antonio Imbert Barrera,
Antonio de la Maza,
Roberto Pastoriza Neret,
Pedro Livio Cedeño Herrera,
and Amado García Guerrero.
There, on San Cristóbal Highway in Santo Domingo, the men ambushed Trujillo's car and assassinated the dictator.
On June 2, agents of the Servicio de Inteligencia Militar (SIM; the secret police) entered house #59 of Avenue San Martín, (a residence owned by García's relatives) and found Lieutenant Amado García Guerrero in hiding, where he was discovered by a female supporter of Trujillo. After resisting the attacks of the SIM agents, García was mortally wounded and died at the age of 30.
References
Addis, Mary Kathryn. “The Novel of the Dictator: History and Narrative Form.” Diss. U of California, 1984.
Alvarez, Julia. In the Time of the Butterflies. New York: Penguin Group, 1994.
Crassweller, Robert. Trujillo: The Life and Times of a Caribbean Dictator. New York: Macmillan, 1966.
De Besault, Lawrence. President Trujillo: His Work and the Dominican Republic. USA: The Washington Publishing Company, 1936.
Diedrich, Bernard. Trujillo: The Death of the Dictator. New Jersey: Markus Weiner, 2000. Rpt. of The Death of the Goat. 1978.
Espaillat, Arturo. Trujillo: The Last Caesar. Chicago: Henry Regnery Company, 1963.
Galíndez, Jesús de. The Era of Trujillo, Dominican Dictator. 1956. Arizona: University of Arizona Press, 1973.
Hamill, Hugh, editor. Caudillos: Dictators in Spanish America. Oklahoma: U of OK P, 1992.
Nanita, Abelardo. Trujillo: The Biography of a Great Leader. New York, Vantage P, 1957.
Ornes, Germán. Trujillo: Little Caesar of the Caribbean. New York, Thomas Nelson & Sons, 1958.
Rodríguez, Juan. A Personal interview. January 12, 2003.
Rood, Carlton. A Dominican Chronicle. Santo Domingo, DR: Taller Editions, Isabel la Católica 309, 1989
Roorda, Eric. The Dictator Next Door- The Good Neighbor Policy and the Trujillo Regime in the Dominican Republic 1930 - 1945. Durham: Duke UP, 1998.
Tejada, Máximo e Ive. A Personal interview. 12 January 2003.
Vargas Llosa, Mario. The Feast of the Goat. Trans. Edith Grossman. New York: Farrar, Straus and Giroux, 2001
Vega y Pagán, Ernesto. Military Biography of Generalissimo Rafael Leonidas Trujillo Molina. Trans. Ida Espaillat. Ciudad Trujillo, RD: Editorial Atenas, 1956.
Wiarda, Howard. Dictatorship and Development: The Methods of Control in Trujillo’s Dominican Republic. Latin American Monographs Ser. 5 Gainesville: U of Florida P, 1970.
1931 births
1961 deaths
Assassins of presidents
1961 crimes in the Dominican Republic
1961 murders in North America
1960s murders in the Dominican Republic
Dominican Republic military personnel
Dominican Republic assassins
White Dominicans
Deaths by firearm in the Dominican Republic
People shot dead by law enforcement officers
|
```groff
.\" $OpenBSD: tftp-proxy.8,v 1.10 2022/03/31 17:27:32 naddy Exp $
.\"
.\"
.\" 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. The name of the author may not be used to endorse or promote products
.\" derived from this software without specific prior written permission.
.\"
.\" THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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.
.\"
.Dd $Mdocdate: March 31 2022 $
.Dt TFTP-PROXY 8
.Os
.Sh NAME
.Nm tftp-proxy
.Nd Internet Trivial File Transfer Protocol proxy
.Sh SYNOPSIS
.Nm tftp-proxy
.Op Fl 46dv
.Op Fl a Ar address
.Op Fl l Ar address
.Op Fl p Ar port
.Op Fl w Ar transwait
.Sh DESCRIPTION
.Nm
is a proxy for the Internet Trivial File Transfer Protocol.
TFTP connections should be redirected to the proxy using a
.Xr pf 4
rule using the
.Ar divert-to
option, after which the proxy connects to the server on behalf of
the client.
The connection from the proxy to the server needs to be passed by
a rule with divert-reply set.
.Pp
The proxy inserts
.Xr pf 4
pass and/or rdr rules using the
.Ar anchor
facility to allow payload packets between the client and the server.
Once the rules are inserted,
.Nm
forwards the initial request from the client to the server to begin the
transfer.
After
.Ar transwait
seconds, the states are assumed to have been established and the
.Xr pf 4
rules are deleted and the program exits.
Once the transfer between the client and the server is completed, the
states will naturally expire.
.Pp
The options are as follows:
.Bl -tag -width Ds
.It Fl 4
Forces
.Nm
to use IPv4 addresses only.
.It Fl 6
Forces
.Nm
to use IPv6 addresses only.
.It Fl a Ar address
The proxy will use
.Ar address
as the source address for the initial request from the client to the server for
NAT traversal.
Instead of a
.Dq pass in
rule an
.Dq rdr
rule will be generated.
It is possible to have two
.Fl a
options to specify both an IPv4 and an IPv6 address.
.It Fl d
Do not daemonize.
If this option is specified,
.Nm
will run in the foreground and log
the client IP, type of request, and filename to stderr.
.It Fl l Ar address
Listen on the specified address.
By default
.Nm
listens on localhost addresses.
.It Fl p Ar port
Listen on the specified port.
By default
.Nm
listens on port 6969.
.It Fl v
Log the connection and request information to
.Xr syslogd 8 .
.It Fl w Ar transwait
Number of seconds to wait for the data transmission to begin before
removing the
.Xr pf 4
rule.
The default is 2 seconds.
.El
.Sh CONFIGURATION
To make use of the proxy,
.Xr pf.conf 5
needs the following rules.
The anchor is mandatory.
Adjust the rule as needed for your configuration.
.Bd -literal -offset indent
anchor "tftp-proxy/*"
pass in quick on $int_if inet proto udp from $lan to port tftp \e
divert-to 127.0.0.1 port 6969
pass out quick on $ext_if inet proto udp from $lan to port tftp \e
group _tftp_proxy divert-reply
.Ed
.Sh SEE ALSO
.Xr tftp 1 ,
.Xr pf 4 ,
.Xr pf.conf 5 ,
.Xr ftp-proxy 8 ,
.Xr syslogd 8 ,
.Xr tftpd 8
.Sh HISTORY
The current stand-alone implementation first appeared in
.Ox 5.3 .
.Sh AUTHORS
.An David Gwynne Aq Mt dlg@openbsd.org
```
|
```objective-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. */
#ifndef SE_INCL_MODELOBJECT_H
#define SE_INCL_MODELOBJECT_H
#ifdef PRAGMA_ONCE
#pragma once
#endif
#include <Engine/Base/Lists.h>
#include <Engine/Models/Model.h>
#include <Engine/Math/Vector.h>
#include <Engine/Math/Placement.h>
#include <Engine/Graphics/Texture.h>
#include <Engine/Models/Model_internal.h>
class CAttachmentModelObject;
class CRenderModel;
class CModelInfo;
class ENGINE_API CModelObject : public CAnimObject {
private:
ULONG mo_PatchMask; // used to turn on/off texture patches (i.e. blood patches)
INDEX mo_iManualMipLevel;
BOOL mo_AutoMipModeling;
// API version
void RenderModel_View( CRenderModel &rm);
void RenderPatches_View( CRenderModel &rm);
void AddSimpleShadow_View( CRenderModel &rm, const FLOAT fIntensity, const FLOATplane3D &plShadowPlane);
void RenderShadow_View( CRenderModel &rm, const CPlacement3D &plLight,
const FLOAT fFallOff, const FLOAT fHotSpot, const FLOAT fIntensity,
const FLOATplane3D &plShadowPlane);
// software version for drawing model mask
void RenderModel_Mask( CRenderModel &rm);
public:
CTextureObject mo_toTexture; // texture used for model rendering
CTextureObject mo_toReflection; // texture used for reflection
CTextureObject mo_toSpecular; // texture used for specularity
CTextureObject mo_toBump; // texture used for bump
FLOAT3D mo_Stretch; // dynamic stretching vector, (usually 1,1,1)
ULONG mo_ColorMask; // mask telling what parts (colors) are visible
INDEX mo_iLastRenderMipLevel; // last rendered mip model index remembered
COLOR mo_colBlendColor; // dynamic blend color (alpha is applied)
CListHead mo_lhAttachments; // list of currently active attachment models
CModelObject(void); // default constructor
~CModelObject(void); // destructor
// copy from another object of same class
void Copy(CModelObject &moOther);
MEX GetWidth(); // retrieves model's texture width
MEX GetHeight();// retrieves model's texture height
void GetModelInfo(CModelInfo &miInfo); // retrieves full model info
BOOL IsModelVisible(float fMipFactor); // is model visible for given mip factor
INDEX GetMipModel(float fMipFactor); // retrieves current mip model index
BOOL HasShadow(INDEX iModelMip); // test if model has shadow at given mip level
FLOATaabbox3D GetFrameBBox( INDEX iFrameNo); // retrieves bounding box of given frame
BOOL IsAutoMipModeling(); // TRUE if auto mip modeling is on
void AutoMipModelingOn(); // function starts auto mip modeling
void AutoMipModelingOff(); // function stops auto mip modeling
INDEX GetManualMipLevel(void); // retrieves current mip level
void SetManualMipLevel(INDEX iNewMipLevel); // sets given mip-level as current (auto mip modeling off)
void PrevManualMipLevel(); // sets previous mip-level (more precize)
void NextManualMipLevel(); // sets next mip-level (more rough)
void SetMipSwitchFactor(INDEX iMipLevel, float fMipFactor); // sets given mip-level's new switch factor
/* retrieves current frame's bounding box */
void GetCurrentFrameBBox( FLOATaabbox3D &MaxBB);
/* retrieves bounding box of all frames */
void GetAllFramesBBox( FLOATaabbox3D &MaxBB);
FLOAT3D GetCollisionBoxMin(INDEX iCollisionBox);
FLOAT3D GetCollisionBoxMax(INDEX iCollisionBox);
// test it the model has alpha blending
BOOL HasAlpha(void);
// returns HEIGHT_EQ_WIDTH, LENGTH_EQ_WIDTH or LENGTH_EQ_HEIGHT
INDEX GetCollisionBoxDimensionEquality(INDEX iCollisionBox);
// retrieves number of surfaces used in given mip model
INDEX SurfacesCt(INDEX iMipModel);
// retrieves number of polygons in given surface in given mip model
INDEX PolygonsInSurfaceCt(INDEX iMipModel, INDEX iSurface);
COLOR GetSurfaceColor( INDEX iCurrentMip, INDEX iCurrentSurface); // retrieves color of given surface
void SetSurfaceColor( INDEX iCurrentMip, INDEX iSurface, COLOR colNewColorAndAlpha); // changes color of given surface
void GetSurfaceRenderFlags( INDEX iCurrentMip, INDEX iCurrentSurface,
enum SurfaceShadingType &sstShading, enum SurfaceTranslucencyType &sttTranslucency,
ULONG &ulRenderingFlags);
void SetSurfaceRenderFlags( INDEX iCurrentMip, INDEX iCurrentSurface,
enum SurfaceShadingType sstShading, enum SurfaceTranslucencyType sttTranslucency,
ULONG ulRenderingFlags);
INDEX GetClosestPatch( MEX2D mexWanted, MEX2D &mexFound); // returns index and position of closest patch
CTString GetColorName( INDEX iColor); // retrieves name of color with given index
void SetColorName( INDEX iColor, CTString &strNewName); // sets new color name
ULONG GetPatchesMask(); // this function returns current value of patches mask
void SetPatchesMask( ULONG new_patches_mask); // use this function to set new patches combination
void UnpackVertex( CRenderModel &rm, const INDEX iVertex, FLOAT3D &vVertex);
BOOL CreateAttachment( CRenderModel &rmMain, CAttachmentModelObject &amo);
void ResetAttachmentModelPosition( INDEX iAttachedPosition);
CAttachmentModelObject *GetAttachmentModelList( INDEX iAttachedPosition, ...);
CAttachmentModelObject *GetAttachmentModel( INDEX iAttachedPosition);
CAttachmentModelObject *AddAttachmentModel( INDEX iAttachedPosition);
void RemoveAttachmentModel( INDEX iAttachedPosition);
void RemoveAllAttachmentModels(void);
void StretchModel( const FLOAT3D &vStretch);
// stretches model relative to current size
void StretchModelRelative(const FLOAT3D &vStretch);
// stretches the model without stretching its children
void StretchSingleModel(const FLOAT3D &vStretch);
// model rendering
void SetupModelRendering( CRenderModel &rm);
void RenderModel( CRenderModel &rm);
void RenderPatches( CRenderModel &rm);
void AddSimpleShadow( CRenderModel &rm, const FLOAT fIntensity, const FLOATplane3D &plShadowPlane);
void RenderShadow( CRenderModel &rm, const CPlacement3D &plLight,
const FLOAT fFallOff, const FLOAT fHotSpot, const FLOAT fIntensity,
const FLOATplane3D &plShadowPlane);
// Get model vertices in absoulte space
void GetModelVertices( CStaticStackArray<FLOAT3D> &avVertices, FLOATmatrix3D &mRotation,
FLOAT3D &vPosition, FLOAT fNormalOffset, FLOAT fMipFactor);
void GetAttachmentMatrices( CAttachmentModelObject *pamo, FLOATmatrix3D &mRotation, FLOAT3D &vPosition);
void GetAttachmentTransformations( INDEX iAttachment, FLOATmatrix3D &mRotation, FLOAT3D &vPosition, BOOL bDummyAttachment);
void ProjectFrameVertices( CProjection3D *pProjection, INDEX iMipModel);
void ColorizeRegion( CDrawPort *pDP, CProjection3D *projection, PIXaabbox2D box,
INDEX iChoosedColor, BOOL bOnColorMode); // colorizes polygons touching given box
void ColorizePolygon( CDrawPort *pDP, CProjection3D *projection, PIX x1, PIX y1,
INDEX iChoosedColor, BOOL bOnColorMode); // colorizes hitted polygon
void ApplySurfaceToPolygon( CDrawPort *pDP, CProjection3D *projection, PIX x1, PIX y1,
INDEX iSurface, COLOR colSurfaceColor);
void ApplySurfaceToPolygonsInRegion( CDrawPort *pDP, CProjection3D *projection,
PIXaabbox2D box, INDEX iSurface, COLOR colSurfaceColor);
void UnpackVertex( INDEX iFrame, INDEX iVertex, FLOAT3D &vVertex);
CPlacement3D GetAttachmentPlacement(CAttachmentModelObject &amo);
struct ModelPolygon *PolygonHit(CPlacement3D plRay, CPlacement3D plObject,
INDEX iCurrentMip, FLOAT &fHitDistance); // returns ptr to hitted polygon (NULL if none)
struct ModelPolygon *PolygonHitModelData( CModelData *pMD, CPlacement3D plRay,
CPlacement3D plObject, INDEX iCurrentMip, FLOAT &fHitDistance);
void PickPolyColor( CDrawPort *pDP, CProjection3D *projection, PIX x1, PIX y1,
INDEX &iPickedColorNo, BOOL bOnColorMode); // picks color from hitted polygon
INDEX PickPolySurface( CDrawPort *pDP, CProjection3D *projection, PIX x1, PIX y1); // picks surface from hitted polygon
INDEX PickVertexIndex( CDrawPort *pDP, CProjection3D *projection, PIX x1, PIX y1, FLOAT3D &vClosestVertex); // obtains index of closest vertex
void ShowPatch( INDEX iMaskBit);
void HidePatch( INDEX iMaskBit);
void Read_t( CTStream *istrFile); // throw char *
void Write_t( CTStream *ostrFile);// throw char *
// set texture data for main texture in surface of this model
void SetTextureData( CTextureData *ptdNewMainTexture);
CTFileName GetName(void);
void AutoSetTextures(void);
void AutoSetAttachments(void);
// obtain model and set it for this object
void SetData_t(const CTFileName &fnmModel); // throw char *
void SetData(CModelData *pmd);
CModelData *GetData(void);
// synchronize with another model (copy animations/attachments positions etc from there)
void Synchronize(CModelObject &moOther);
// get amount of memory used by this object
SLONG GetUsedMemory(void);
};
class ENGINE_API CAttachmentModelObject {
public:
CListNode amo_lnInMain;
INDEX amo_iAttachedPosition; // indentifier of positions saved in model data
CPlacement3D amo_plRelative; // relative placement used for rendering
CModelObject amo_moModelObject; // model and texture
CRenderModel *amo_prm; // render model structure used in rendering
};
#endif /* include-once check. */
```
|
Lepanthes × stenosepala is a species of orchid native to Central America.
Found in Guatemala, El Salvador and Honduras at elevations around 1600 to 1800 meters as a miniature sized, cool growing epiphyte.
This species is a natural hybrid between L enca-barcenae and L tactiquensis and is intermediate in habit and flowers between the two.
References
External links
stenosepala
Orchids of Central America
Orchid hybrids
|
The 2015 Royal London One-Day Cup tournament was the scheduled limited overs cricket competition for 2015 season of England and Wales first-class counties. It was won by Gloucestershire County Cricket Club, who defeated Surrey by the narrow margin of six runs, despite a hat-trick from Jade Dernbach, in what was described as 'a thrilling finish'. The title was Gloucestershire's first trophy since the 2004 Cheltenham & Gloucester Trophy, when they defeated a Worcestershire side that included 2015 Surrey captain Gareth Batty.
Format
The competition consisted of two groups of nine teams, with the top four teams from each group progress to the quarter-finals. The groups for the 2015 season were drawn and are shown below in their respective groups.
Group stage
Group A
Table
Fixtures
Group B
Table
Fixtures
Knockout stage
Quarter-finals
Semi-finals
Final
See also
ECB 40
References
External links
Official Site
Royal London One-Day Cup
One-Day Cup (England)
Royal London One-Day Cup
|
```python
def B(s):
return s
def C(s):
return s + "see"
def D(s):
return s + "dee"
```
|
Anthepiscopus is a genus of flies belonging to the family Empididae.
The species of this genus are found in Europe and Northern America.
Species:
Anthepiscopus antipodus Bezzi, 1904
Anthepiscopus caelebs Becker, 1891
References
Empididae
|
Tyra Naha (or Tyra Naha-Black, or Tyra Naha Tawawina) represents the 4th generation in a family of well-known Hopi potters. She is a Native American potter from the Hopi Nation, Arizona, Southwest United States) While she is currently not as well known as her famous elders, she is technically nicely proficient. Her work has been featured at shows in Santa Fe and at the Heard Museum, and appears in The Art of the Hopi.
Tyra Naha's daughter, Amber Naha-Black, is also an award-winning potter.
Tyra signs her pots with a feather and a spider glyph. The feather represents her lineage to the Naha family through her grandmother, who signed with a feather glyph. The spider is her clan symbol.
See also
Potter Helen Naha – aka "Feather Woman," her grandmother
References
Additional Resources
Dillingham, Rick. Fourteen Families in Pueblo Pottery. Foreword by J. J. Brody. University of New Mexico Press, (reprint edition) 1994.
Graves, Laura. Thomas Varker Keam, Indian Trader. University of Oklahoma Press, 1998.
External links
Tyra Naha biographical sketch, plus another of her pots.
Living people
Year of birth missing (living people)
Hopi people
Native American potters
American potters
Artists from Arizona
American women ceramists
Native American women artists
Women potters
21st-century American ceramists
21st-century American women artists
21st-century Native American artists
21st-century Native American women
Native American people from Arizona
|
The 1er Régiment de Fusiliers Marins 1er RFM French ( 1er RFM, or first regiment of Fusiliers Marins) was a unit of the Free French Navy during the campaign of Italy, then in the campaign of France.
Creation
On September 24, 1943, the Fusiliers Marins Battalion increased effectifs by integrating volunteers from the naval corps present in North Africa () (particularly radio and mechanic specialists), accordingly being designated as 1er Régiment de fusiliers marins (1er RFM), an armored reconnaissance unit of the 1st Free French Division 1er DFL. Command was entrusted to naval Corvette captain Hubert Amyot d'Inville. The regiment was equipped with U.S. American equipment, notably the M24 Chaffee.
Campaigns
Italy
Following a trained supported phase, the 1er RFM disembarked in Naples at the corps of the 1er DFL, on April 22, 1944. Since May 12, the regiment engaged in intense combats on Garigliano. While bearing the forefront of the division on three axes, the RFM led combats at Montefiascone and Radicofani. The regiment counted 61 killed out of which Amyot d'Inville and 140 wounded.
Provence
At the end of World War II, the regiment was disembarked in Provence, at Cavalaire-sur-Mer, under the command of Corvette captain Pierre de Morsier.
The unit combatted for the liberation of Toulon and Hyères, then reclimbed through the valley of the Rhône, penetrated in Lyon, then reached Autun; the Savary squadron entered following a hard confrontation during which five men were killed and four were wounded. Savary done, in Côte d'Or, the liaison were assumed with units of the 2e DB (Leclerc) which disembarked in Normandy. The RFM pursues the respective advancement in direction of the Vosgues.
Vallée du Rhône
The regiment conducted the juncture with the 1st Spahi Regiment (Normandy landings with the 2e DB) at Châtillon-sur-Seine on September 12. This juncture is considered as one of the junctures between Allied troops of Normandy and those of Provence.
Haute-Saône
On September 27, the tank squadron led the attack on Clairegoutte before apprehending Ronchamp on October 8, then Vescemont, Rougegoutte, Romagny and Rougemont-le-Château the following month. Distinguished particularly in the following operations: Vessel Ensign Bokanowski, Aspirant Vasseur and, alongside the sailors, the men of the 11th Cuir-Vercors () placed under the orders of the 1er RFM.
Battle of the Royan pocket
Following the campaign in the Vosges, the 1re DFL was sent to the Atlantic front to reduce the Royan pocket and Grave cap (), however was it recalled urgently on the eastern front due to a German offensive launched in December 1944 in Alsace.
Alsace
In January 1945, the fusiliers marins distinguished themselves again in Alsace, at Herbsheim and Rossfeld, before pursuing their march towards the Rhin.
Alpes
Retrieved from the Alsace front, the division was assigned to the detachment of the Army of the Alps () in April 1945, in the massif of Authion, where the 1st squadron fought with distinction, enduring the loss in the offensive of five officers out of six and nearly 50% of its forces that were engaged.
Traditions
Ordre de la libération
The mechanic sailor Georges Brières, killed at Giromagny, rests in the Mémorial de la France combattante. Brières represents the sacrifice of all sailors lost for the Liberation of France.
Regimental Colors
The regimental colors, memory and tradition of the 1er Régiment de fusiliers marins are confined to the fusiliers school. With the Naval leadership of the Régiment Blindé de Fusiliers-Marins RBFM of the French Navy which was not part of the Free French Forces FFL, nor part of the Free French Naval Forces FNFL, the Naval leadership of the 1er Régiment de Fusiliers Marins showcased the valor of French arms.
Regiment combat casualties
Between October 1940 and May 1945, the ensemble of the 1er BFM/ 1e RFM endured the loss of 195 men amongst them 12 officers out of which 2 commandants.
Decorations
Awarded to the men of this regiment:
200 croix de guerre,
70 médailles militaires,
32 Légion d'honneur,
31 croix de la Libération.
The regimental colors of the 1er RFM was awarded 5 citations at the orders of the armed forces obtained for 1939-1945 with attribution of the croix de la Libération, the médaille de la Résistance française and la croix de guerre.
In August 1945, the 1er RFM was reassigned at the disposition of Naval authorities.
See also
Brigade de Fusiliers Marins
List of Allied forces in the Normandy Campaign
References
External links
Histoire du 1er RFM sur le site de l'Ordre de la Libération
Marines regiments of France
Military units and formations established in 1943
Military units and formations disestablished in 1945
20th-century regiments of France
Free French Naval Forces
|
Axel Maersk (or Axel Mærsk) is a Danish container ship and part of the fleet of the Maersk Line.
Design
The container ship Axel Maersk was built in 2003 in the ship-yard of the Maersk Line in Odense, Denmark. The flag of Axel Maersk is also in Denmark. Axel Maersk was ordered in 2002 and completed in the beginning of 2003. The MMSI of the ship is 220187000, the IMO number is 9260419 and the call sign is OUUY2. The ship has a length of and a beam of . The deadweight of the ship is 109,000 metric tons with a gross tonnage of 93,496.
The ship has a capacity of more than 9,000 TEUs. She is powered by a HDS Sulzer 12RTA96C engine with a power of which gives a maximum speed of 25.4 knots and cruising speed.
References
Container ships
Merchant ships of Denmark
Ships of the Maersk Line
2003 ships
|
```javascript
#!/usr/bin/env node
'use strict';
const { task } = require('gulp');
const fs = require('fs');
const util = require('util');
const promisifyExec = util.promisify(require('child_process').exec);
var packageJSON = require('./package.json');
/**
* @dev Task to create git tag using version from package.json and pushing this specific tag
*/
task('publishTag', async function () {
const tag = "v" + packageJSON.version
await promisifyExec(`git tag ${tag}; git push origin ${tag}`);
});
/**
* @dev Task to update changelog for latest release
*/
task('updateChangelog', async function () {
const previous_version = process.argv[4];
const next_version = "v" + packageJSON.version;
// Create changes.md with latest release changelog temporarily
await promisifyExec(`github-changes -o ethereum -r remix -a --file changes.md --only-pulls --use-commit-body --only-merges --between-tags ${previous_version} ... ${next_version}`);
const latestChangelog = fs.readFileSync(__dirname + '/changes.md', 'utf8')
const oldChangelog = fs.readFileSync(__dirname + '/CHANGELOG.md', 'utf8')
// Concatenate latest changelog content to the top of old changelog file content
const data = latestChangelog + '\n\n' + oldChangelog
// Delete current changelog file CHANGELOG.md
fs.unlinkSync(__dirname + '/CHANGELOG.md');
// Delete changes.md
fs.unlinkSync(__dirname + '/changes.md');
// Write the concatenated content to CHANGELOG.md (We delete and create file to place the new data on top)
fs.writeFileSync(__dirname + '/CHANGELOG.md', data);
await Promise.resolve();
});
```
|
Tides of Tomorrow is an EP by alternative rock band Cave In, released through Hydra Head Records on October 15, 2002.
Track listing
Chart positions
Personnel
Cave In
Stephen Brodsky – vocals, guitar
Adam McGrath – guitar, bongos
Caleb Scofield – bass, vocals
John-Robert Conners – drums
References
Cave In albums
2002 EPs
Hydra Head Records EPs
|
Throughout the Second Sino-Japanese war (1937–1945), Japanese dissidents and Japanese prisoners of war (POWs) joined the Chinese in the war against the Empire of Japan.
An IJNAF A5M fighter pilot who was shot down on 26 September 1937, had along with other captured Japanese combatants, become convinced to join the Chinese side, and helped the Chinese break Japanese tactical codes and other information that provided a huge intelligence windfall for the newly-established cryptanalyst unit headed by Dr. Chang Chao-hsi.
The education of Japanese captives by the Eighth Route Army began in 1938. In November 1940 the Peasants' and Workers' School was established. It reeducated Japanese POWs who afterwards were involved in propaganda.
Sanzo Nosaka, and Kaji Wataru joined the Chinese resistance. They reeducated Japanese POWs.
Several organizations emerged during the war. The Anti-War League, the Japanese People's Emancipation League and a communist league.
List of Japanese in the Chinese resistance
Teru Hasegawa
Shigeo Tsutsui
Yuki Ikeda
Kazuo Aoyama
See also
Japanese dissidence during the early Shōwa period
References
Work cited
Cheung, Raymond. Osprey Aircraft of the Aces 126: Aces of the Republic of China Air Force. Oxford: Osprey Publishing, 2015. .
Further reading
Xiaoyuan Liu. A Partnership for Disorder: China, the United States, and Their Policies for the Postwar Disposition of the Japanese Empire, 1941-1945.
Japanese Resistance
World War II resistance movements
|
Cephalotes squamosus is a species of arboreal ant of the genus Cephalotes, characterized by an odd shaped head and the ability to "parachute" by steering their fall if they drop off of the tree they're on. Giving their name also as gliding ants.
References
squamosus
|
```smalltalk
using System.Linq.Expressions;
using System.Reflection;
namespace Chloe.Sharding
{
public class GroupQueryProjection
{
public GroupQueryProjection()
{
}
public ConstructorInfo Constructor { get; set; }
public List<Expression> ConstructorArgExpressions { get; set; } = new List<Expression>();
public List<Func<Func<object, object>, IEnumerable<object>, object>> ConstructorArgGetters { get; set; } = new List<Func<Func<object, object>, IEnumerable<object>, object>>();
public List<Expression> MemberExpressions { get; set; } = new List<Expression>();
public List<Action<Func<object, object>, IEnumerable<object>, object>> MemberBinders { get; set; } = new List<Action<Func<object, object>, IEnumerable<object>, object>>();
}
public class GroupKeyEqualityComparer : IEqualityComparer<object>
{
public GroupKeyEqualityComparer(List<Func<object, object>> groupKeyValueGetters)
{
this.GroupKeyValueGetters = groupKeyValueGetters;
}
public List<Func<object, object>> GroupKeyValueGetters { get; set; }
public new bool Equals(object x, object y)
{
foreach (var valueGetter in this.GroupKeyValueGetters)
{
var keyValueX = valueGetter(x);
var keyValueY = valueGetter(y);
bool equal = PublicHelper.AreEqual(keyValueX, keyValueY);
if (!equal)
{
return false;
}
}
return true;
}
public int GetHashCode(object obj)
{
int hash;
unchecked
{
hash = (int)2166136261; //
foreach (var valueGetter in this.GroupKeyValueGetters)
{
var keyValue = valueGetter(obj);
// 16777619
hash = (hash * 16777619) ^ keyValue.GetHashCode();
}
}
return hash;
}
}
}
```
|
```javascript
/*
* All rights reserved.
*
* 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 Google Inc. 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.
*/
/**
* @fileoverview This file contains objects to deal with WebGL
* programs.
*/
tdl.provide('tdl.programs');
tdl.require('tdl.log');
tdl.require('tdl.string');
tdl.require('tdl.webgl');
/**
* A module for programs.
* @namespace
*/
tdl.programs = tdl.programs || {};
/**
* Loads a program from script tags.
* @param {string} vertexShaderId The id of the script tag that contains the
* vertex shader source.
* @param {string} fragmentShaderId The id of the script tag that contains the
* fragment shader source.
* @return {tdl.programs.Program} The created program.
*/
tdl.programs.loadProgramFromScriptTags = function(
vertexShaderId, fragmentShaderId) {
var vertElem = document.getElementById(vertexShaderId);
var fragElem = document.getElementById(fragmentShaderId);
if (!vertElem) {
throw("Can't find vertex program tag: " + vertexShaderId);
}
if (!fragElem) {
throw("Can't find fragment program tag: " + fragmentShaderId);
}
return tdl.programs.loadProgram(
document.getElementById(vertexShaderId).text,
document.getElementById(fragmentShaderId).text);
};
tdl.programs.makeProgramId = function(vertexShader, fragmentShader) {
return vertexShader + fragmentShader;
};
/**
* Loads a program.
* @param {string} vertexShader The vertex shader source.
* @param {string} fragmentShader The fragment shader source.
* @param {!function(error)) opt_asyncCallback. Called with
* undefined if success or string if failure.
* @return {tdl.programs.Program} The created program.
*/
tdl.programs.loadProgram = function(vertexShader, fragmentShader, opt_asyncCallback) {
var id = tdl.programs.makeProgramId(vertexShader, fragmentShader);
tdl.programs.init_();
var program = gl.tdl.programs.programDB[id];
if (program) {
if (opt_asyncCallback) {
setTimeout(function() { opt_asyncCallback(); }, 1);
}
return program;
}
try {
program = new tdl.programs.Program(vertexShader, fragmentShader, opt_asyncCallback);
} catch (e) {
tdl.error(e);
return null;
}
if (!opt_asyncCallback) {
gl.tdl.programs.programDB[id] = program;
}
return program;
};
/**
* A object to manage a WebGLProgram.
* @constructor
* @param {string} vertexShader The vertex shader source.
* @param {string} fragmentShader The fragment shader source.
* @param {!function(error)) opt_asyncCallback. Called with
* undefined if success or string if failure.
*/
tdl.programs.Program = function(vertexShader, fragmentShader, opt_asyncCallback) {
var that = this;
this.programId = tdl.programs.makeProgramId(vertexShader, fragmentShader);
this.asyncCallback = opt_asyncCallback;
var shaderId;
var program;
var vs;
var fs;
/**
* Loads a shader.
* @param {!WebGLContext} gl The WebGLContext to use.
* @param {string} shaderSource The shader source.
* @param {number} shaderType The type of shader.
* @return {!WebGLShader} The created shader.
*/
var loadShader = function(gl, shaderSource, shaderType) {
shaderId = shaderSource + shaderType;
tdl.programs.init_();
var shader = gl.tdl.programs.shaderDB[shaderId];
if (shader) {
return shader;
}
// Create the shader object
var shader = gl.createShader(shaderType);
// Load the shader source
gl.shaderSource(shader, shaderSource);
// Compile the shader
gl.compileShader(shader);
// Check the compile status
if (!that.asyncCallback) {
checkShader(shader);
}
return shader;
}
var checkShader = function(shader) {
var compiled = gl.getShaderParameter(shader, gl.COMPILE_STATUS);
if (!compiled && !gl.isContextLost()) {
// Something went wrong during compilation; get the error
tdl.programs.lastError = gl.getShaderInfoLog(shader);
gl.deleteShader(shader);
throw("*** Error compiling shader :" + tdl.programs.lastError);
}
gl.tdl.programs.shaderDB[shaderId] = shader;
};
/**
* Loads shaders from script tags, creates a program, attaches the shaders and
* links.
* @param {!WebGLContext} gl The WebGLContext to use.
* @param {string} vertexShader The vertex shader.
* @param {string} fragmentShader The fragment shader.
* @return {!WebGLProgram} The created program.
*/
var loadProgram = function(gl, vertexShader, fragmentShader) {
var e;
try {
vs = loadShader(gl, vertexShader, gl.VERTEX_SHADER);
fs = loadShader(gl, fragmentShader, gl.FRAGMENT_SHADER);
program = gl.createProgram();
gl.attachShader(program, vs);
gl.attachShader(program, fs);
linkProgram(gl, program);
} catch (e) {
deleteAll(e);
}
return program;
};
var deleteAll = function(e) {
if (vs) { gl.deleteShader(vs) }
if (fs) { gl.deleteShader(fs) }
if (program) { gl.deleteProgram(program) }
throw e;
};
/**
* Links a WebGL program, throws if there are errors.
* @param {!WebGLContext} gl The WebGLContext to use.
* @param {!WebGLProgram} program The WebGLProgram to link.
*/
var linkProgram = function(gl, program) {
// Link the program
gl.linkProgram(program);
// Check the link status
if (!that.asyncCallback) {
checkProgram(program);
}
};
var checkProgram = function(program) {
var linked = gl.getProgramParameter(program, gl.LINK_STATUS);
if (!linked && !gl.isContextLost()) {
// something went wrong with the link
tdl.programs.lastError = gl.getProgramInfoLog (program);
throw("*** Error in program linking:" + tdl.programs.lastError);
}
};
// Compile shaders
var program = loadProgram(gl, vertexShader, fragmentShader);
if (!program && !gl.isContextLost()) {
throw ("could not compile program");
}
// TODO(gman): remove the need for this.
function flatten(array){
var flat = [];
for (var i = 0, l = array.length; i < l; i++) {
var type = Object.prototype.toString.call(array[i]).split(' ').pop().split(']').shift().toLowerCase();
if (type) { flat = flat.concat(/^(array|collection|arguments|object)$/.test(type) ? flatten(array[i]) : array[i]); }
}
return flat;
}
function createSetters(program) {
// Look up attribs.
var attribs = {
};
// Also make a plain table of the locs.
var attribLocs = {
};
function createAttribSetter(info, index) {
if (info.size != 1) {
throw("arrays of attribs not handled");
}
return function(b) {
gl.bindBuffer(gl.ARRAY_BUFFER, b.buffer());
gl.enableVertexAttribArray(index);
gl.vertexAttribPointer(
index, b.numComponents(), b.type(), b.normalize(), b.stride(), b.offset());
};
}
var numAttribs = gl.getProgramParameter(program, gl.ACTIVE_ATTRIBUTES);
for (var ii = 0; ii < numAttribs; ++ii) {
var info = gl.getActiveAttrib(program, ii);
if (!info) {
break;
}
var name = info.name;
if (tdl.string.endsWith(name, "[0]")) {
name = name.substr(0, name.length - 3);
}
var index = gl.getAttribLocation(program, info.name);
attribs[name] = createAttribSetter(info, index);
attribLocs[name] = index
}
// Look up uniforms
var numUniforms = gl.getProgramParameter(program, gl.ACTIVE_UNIFORMS);
var uniforms = {
};
var textureUnit = 0;
function createUniformSetter(info) {
var loc = gl.getUniformLocation(program, info.name);
var type = info.type;
if (info.size > 1 && tdl.string.endsWith(info.name, "[0]")) {
// It's an array.
if (type == gl.FLOAT)
return function() {
var old;
return function(v) {
if (v !== old) {
old = v;
gl.uniform1fv(loc, v);
}
};
}();
if (type == gl.FLOAT_VEC2)
return function() {
// I hope they don't use -1,-1 as their first draw
var old = new Float32Array([-1, -1]);
return function(v) {
if (v[0] != old[0] || v[1] != old[1]) {
gl.uniform2fv(loc, v);
}
};
}();
if (type == gl.FLOAT_VEC3)
return function() {
// I hope they don't use -1,-1,-1 as their first draw
var old = new Float32Array([-1, -1, -1]);
return function(v) {
if (v[0] != old[0] || v[1] != old[1] || v[2] != old[2]) {
gl.uniform3fv(loc, v);
}
};
}();
if (type == gl.FLOAT_VEC4)
return function(v) { gl.uniform4fv(loc, v); };
if (type == gl.INT)
return function(v) { gl.uniform1iv(loc, v); };
if (type == gl.INT_VEC2)
return function(v) { gl.uniform2iv(loc, v); };
if (type == gl.INT_VEC3)
return function(v) { gl.uniform3iv(loc, v); };
if (type == gl.INT_VEC4)
return function(v) { gl.uniform4iv(loc, v); };
if (type == gl.BOOL)
return function(v) { gl.uniform1iv(loc, v); };
if (type == gl.BOOL_VEC2)
return function(v) { gl.uniform2iv(loc, v); };
if (type == gl.BOOL_VEC3)
return function(v) { gl.uniform3iv(loc, v); };
if (type == gl.BOOL_VEC4)
return function(v) { gl.uniform4iv(loc, v); };
if (type == gl.FLOAT_MAT2)
return function(v) { gl.uniformMatrix2fv(loc, false, v); };
if (type == gl.FLOAT_MAT3)
return function(v) { gl.uniformMatrix3fv(loc, false, v); };
if (type == gl.FLOAT_MAT4)
return function(v) { gl.uniformMatrix4fv(loc, false, v); };
if (type == gl.SAMPLER_2D || type == gl.SAMPLER_CUBE) {
var units = [];
for (var ii = 0; ii < info.size; ++ii) {
units.push(textureUnit++);
}
return function(units) {
return function(v) {
gl.uniform1iv(loc, units);
v.bindToUnit(units);
};
}(units);
}
throw ("unknown type: 0x" + type.toString(16));
} else {
if (type == gl.FLOAT)
return function(v) { gl.uniform1f(loc, v); };
if (type == gl.FLOAT_VEC2)
return function(v) { gl.uniform2fv(loc, v); };
if (type == gl.FLOAT_VEC3)
return function(v) { gl.uniform3fv(loc, v); };
if (type == gl.FLOAT_VEC4)
return function(v) { gl.uniform4fv(loc, v); };
if (type == gl.INT)
return function(v) { gl.uniform1i(loc, v); };
if (type == gl.INT_VEC2)
return function(v) { gl.uniform2iv(loc, v); };
if (type == gl.INT_VEC3)
return function(v) { gl.uniform3iv(loc, v); };
if (type == gl.INT_VEC4)
return function(v) { gl.uniform4iv(loc, v); };
if (type == gl.BOOL)
return function(v) { gl.uniform1i(loc, v); };
if (type == gl.BOOL_VEC2)
return function(v) { gl.uniform2iv(loc, v); };
if (type == gl.BOOL_VEC3)
return function(v) { gl.uniform3iv(loc, v); };
if (type == gl.BOOL_VEC4)
return function(v) { gl.uniform4iv(loc, v); };
if (type == gl.FLOAT_MAT2)
return function(v) { gl.uniformMatrix2fv(loc, false, v); };
if (type == gl.FLOAT_MAT3)
return function(v) { gl.uniformMatrix3fv(loc, false, v); };
if (type == gl.FLOAT_MAT4)
return function(v) { gl.uniformMatrix4fv(loc, false, v); };
if (type == gl.SAMPLER_2D || type == gl.SAMPLER_CUBE) {
return function(unit) {
return function(v) {
gl.uniform1i(loc, unit);
v.bindToUnit(unit);
};
}(textureUnit++);
}
throw ("unknown type: 0x" + type.toString(16));
}
}
var textures = {};
for (var ii = 0; ii < numUniforms; ++ii) {
var info = gl.getActiveUniform(program, ii);
if (!info) {
break;
}
name = info.name;
if (tdl.string.endsWith(name, "[0]")) {
name = name.substr(0, name.length - 3);
}
var setter = createUniformSetter(info);
uniforms[name] = setter;
if (info.type == gl.SAMPLER_2D || info.type == gl.SAMPLER_CUBE) {
textures[name] = setter;
}
}
that.textures = textures;
that.attrib = attribs;
that.attribLoc = attribLocs;
that.uniform = uniforms;
}
createSetters(program);
this.loadNewShaders = function(vertexShaderSource, fragmentShaderSource) {
var program = loadProgram(gl, vertexShaderSource, fragmentShaderSource);
if (!program && !gl.isContextLost()) {
throw ("could not compile program");
}
that.program = program;
createSetters();
};
this.program = program;
this.good = this.asyncCallback ? false : true;
var checkLater = function() {
var e;
try {
checkShader(vs);
checkShader(fs);
checkProgram(program);
} catch (e) {
that.asyncCallback(e.toString());
return;
}
gl.tdl.programs.programDB[that.programId] = this;
that.asyncCallback();
};
if (this.asyncCallback) {
setTimeout(checkLater, 1000);
}
};
tdl.programs.handleContextLost_ = function() {
if (gl.tdl && gl.tdl.programs && gl.tdl.programs.shaderDB) {
delete gl.tdl.programs.shaderDB;
delete gl.tdl.programs.programDB;
}
};
tdl.programs.init_ = function() {
if (!gl.tdl.programs) {
gl.tdl.programs = { };
tdl.webgl.registerContextLostHandler(gl.canvas, tdl.programs.handleContextLost_, true);
}
if (!gl.tdl.programs.shaderDB) {
gl.tdl.programs.shaderDB = { };
gl.tdl.programs.programDB = { };
}
};
tdl.programs.Program.prototype.use = function() {
gl.useProgram(this.program);
};
//function dumpValue(msg, name, value) {
// var str;
// if (value.length) {
// str = value[0].toString();
// for (var ii = 1; ii < value.length; ++ii) {
// str += "," + value[ii];
// }
// } else {
// str = value.toString();
// }
// tdl.log(msg + name + ": " + str);
//}
tdl.programs.Program.prototype.setUniform = function(uniform, value) {
var func = this.uniform[uniform];
if (func) {
//dumpValue("SET UNI:", uniform, value);
func(value);
}
};
```
|
Turbonilla boisselierae is a species of sea snail, a marine gastropod mollusk in the family Pyramidellidae, the pyrams and their allies.
References
External links
Encyclopedia of Life
World Register of Marine Species
boisselierae
Gastropods described in 2010
|
Hedyosmum cumbalense is a species of tree in the Chloranthaceae family. It is native to South America.
References
cumbalense
Trees of Colombia
Trees of Peru
Trees of Ecuador
|
```go
package admin
import (
"errors"
"fmt"
"net/http"
"code.gitea.io/gitea/models"
asymkey_model "code.gitea.io/gitea/models/asymkey"
"code.gitea.io/gitea/models/auth"
"code.gitea.io/gitea/models/db"
user_model "code.gitea.io/gitea/models/user"
"code.gitea.io/gitea/modules/auth/password"
"code.gitea.io/gitea/modules/log"
"code.gitea.io/gitea/modules/optional"
"code.gitea.io/gitea/modules/setting"
api "code.gitea.io/gitea/modules/structs"
"code.gitea.io/gitea/modules/timeutil"
"code.gitea.io/gitea/modules/web"
"code.gitea.io/gitea/routers/api/v1/user"
"code.gitea.io/gitea/routers/api/v1/utils"
asymkey_service "code.gitea.io/gitea/services/asymkey"
"code.gitea.io/gitea/services/context"
"code.gitea.io/gitea/services/convert"
"code.gitea.io/gitea/services/mailer"
user_service "code.gitea.io/gitea/services/user"
)
func parseAuthSource(ctx *context.APIContext, u *user_model.User, sourceID int64) {
if sourceID == 0 {
return
}
source, err := auth.GetSourceByID(ctx, sourceID)
if err != nil {
if auth.IsErrSourceNotExist(err) {
ctx.Error(http.StatusUnprocessableEntity, "", err)
} else {
ctx.Error(http.StatusInternalServerError, "auth.GetSourceByID", err)
}
return
}
u.LoginType = source.Type
u.LoginSource = source.ID
}
// CreateUser create a user
func CreateUser(ctx *context.APIContext) {
// swagger:operation POST /admin/users admin adminCreateUser
// ---
// summary: Create a user
// consumes:
// - application/json
// produces:
// - application/json
// parameters:
// - name: body
// in: body
// schema:
// "$ref": "#/definitions/CreateUserOption"
// responses:
// "201":
// "$ref": "#/responses/User"
// "400":
// "$ref": "#/responses/error"
// "403":
// "$ref": "#/responses/forbidden"
// "422":
// "$ref": "#/responses/validationError"
form := web.GetForm(ctx).(*api.CreateUserOption)
u := &user_model.User{
Name: form.Username,
FullName: form.FullName,
Email: form.Email,
Passwd: form.Password,
MustChangePassword: true,
LoginType: auth.Plain,
LoginName: form.LoginName,
}
if form.MustChangePassword != nil {
u.MustChangePassword = *form.MustChangePassword
}
parseAuthSource(ctx, u, form.SourceID)
if ctx.Written() {
return
}
if u.LoginType == auth.Plain {
if len(form.Password) < setting.MinPasswordLength {
err := errors.New("PasswordIsRequired")
ctx.Error(http.StatusBadRequest, "PasswordIsRequired", err)
return
}
if !password.IsComplexEnough(form.Password) {
err := errors.New("PasswordComplexity")
ctx.Error(http.StatusBadRequest, "PasswordComplexity", err)
return
}
if err := password.IsPwned(ctx, form.Password); err != nil {
if password.IsErrIsPwnedRequest(err) {
log.Error(err.Error())
}
ctx.Error(http.StatusBadRequest, "PasswordPwned", errors.New("PasswordPwned"))
return
}
}
overwriteDefault := &user_model.CreateUserOverwriteOptions{
IsActive: optional.Some(true),
IsRestricted: optional.FromPtr(form.Restricted),
}
if form.Visibility != "" {
visibility := api.VisibilityModes[form.Visibility]
overwriteDefault.Visibility = &visibility
}
// Update the user creation timestamp. This can only be done after the user
// record has been inserted into the database; the insert intself will always
// set the creation timestamp to "now".
if form.Created != nil {
u.CreatedUnix = timeutil.TimeStamp(form.Created.Unix())
u.UpdatedUnix = u.CreatedUnix
}
if err := user_model.AdminCreateUser(ctx, u, overwriteDefault); err != nil {
if user_model.IsErrUserAlreadyExist(err) ||
user_model.IsErrEmailAlreadyUsed(err) ||
db.IsErrNameReserved(err) ||
db.IsErrNameCharsNotAllowed(err) ||
user_model.IsErrEmailCharIsNotSupported(err) ||
user_model.IsErrEmailInvalid(err) ||
db.IsErrNamePatternNotAllowed(err) {
ctx.Error(http.StatusUnprocessableEntity, "", err)
} else {
ctx.Error(http.StatusInternalServerError, "CreateUser", err)
}
return
}
if !user_model.IsEmailDomainAllowed(u.Email) {
ctx.Resp.Header().Add("X-Gitea-Warning", fmt.Sprintf("the domain of user email %s conflicts with EMAIL_DOMAIN_ALLOWLIST or EMAIL_DOMAIN_BLOCKLIST", u.Email))
}
log.Trace("Account created by admin (%s): %s", ctx.Doer.Name, u.Name)
// Send email notification.
if form.SendNotify {
mailer.SendRegisterNotifyMail(u)
}
ctx.JSON(http.StatusCreated, convert.ToUser(ctx, u, ctx.Doer))
}
// EditUser api for modifying a user's information
func EditUser(ctx *context.APIContext) {
// swagger:operation PATCH /admin/users/{username} admin adminEditUser
// ---
// summary: Edit an existing user
// consumes:
// - application/json
// produces:
// - application/json
// parameters:
// - name: username
// in: path
// description: username of user to edit
// type: string
// required: true
// - name: body
// in: body
// schema:
// "$ref": "#/definitions/EditUserOption"
// responses:
// "200":
// "$ref": "#/responses/User"
// "400":
// "$ref": "#/responses/error"
// "403":
// "$ref": "#/responses/forbidden"
// "422":
// "$ref": "#/responses/validationError"
form := web.GetForm(ctx).(*api.EditUserOption)
authOpts := &user_service.UpdateAuthOptions{
LoginSource: optional.FromNonDefault(form.SourceID),
LoginName: optional.Some(form.LoginName),
Password: optional.FromNonDefault(form.Password),
MustChangePassword: optional.FromPtr(form.MustChangePassword),
ProhibitLogin: optional.FromPtr(form.ProhibitLogin),
}
if err := user_service.UpdateAuth(ctx, ctx.ContextUser, authOpts); err != nil {
switch {
case errors.Is(err, password.ErrMinLength):
ctx.Error(http.StatusBadRequest, "PasswordTooShort", fmt.Errorf("password must be at least %d characters", setting.MinPasswordLength))
case errors.Is(err, password.ErrComplexity):
ctx.Error(http.StatusBadRequest, "PasswordComplexity", err)
case errors.Is(err, password.ErrIsPwned), password.IsErrIsPwnedRequest(err):
ctx.Error(http.StatusBadRequest, "PasswordIsPwned", err)
default:
ctx.Error(http.StatusInternalServerError, "UpdateAuth", err)
}
return
}
if form.Email != nil {
if err := user_service.AdminAddOrSetPrimaryEmailAddress(ctx, ctx.ContextUser, *form.Email); err != nil {
switch {
case user_model.IsErrEmailCharIsNotSupported(err), user_model.IsErrEmailInvalid(err):
ctx.Error(http.StatusBadRequest, "EmailInvalid", err)
case user_model.IsErrEmailAlreadyUsed(err):
ctx.Error(http.StatusBadRequest, "EmailUsed", err)
default:
ctx.Error(http.StatusInternalServerError, "AddOrSetPrimaryEmailAddress", err)
}
return
}
if !user_model.IsEmailDomainAllowed(*form.Email) {
ctx.Resp.Header().Add("X-Gitea-Warning", fmt.Sprintf("the domain of user email %s conflicts with EMAIL_DOMAIN_ALLOWLIST or EMAIL_DOMAIN_BLOCKLIST", *form.Email))
}
}
opts := &user_service.UpdateOptions{
FullName: optional.FromPtr(form.FullName),
Website: optional.FromPtr(form.Website),
Location: optional.FromPtr(form.Location),
Description: optional.FromPtr(form.Description),
IsActive: optional.FromPtr(form.Active),
IsAdmin: optional.FromPtr(form.Admin),
Visibility: optional.FromNonDefault(api.VisibilityModes[form.Visibility]),
AllowGitHook: optional.FromPtr(form.AllowGitHook),
AllowImportLocal: optional.FromPtr(form.AllowImportLocal),
MaxRepoCreation: optional.FromPtr(form.MaxRepoCreation),
AllowCreateOrganization: optional.FromPtr(form.AllowCreateOrganization),
IsRestricted: optional.FromPtr(form.Restricted),
}
if err := user_service.UpdateUser(ctx, ctx.ContextUser, opts); err != nil {
if models.IsErrDeleteLastAdminUser(err) {
ctx.Error(http.StatusBadRequest, "LastAdmin", err)
} else {
ctx.Error(http.StatusInternalServerError, "UpdateUser", err)
}
return
}
log.Trace("Account profile updated by admin (%s): %s", ctx.Doer.Name, ctx.ContextUser.Name)
ctx.JSON(http.StatusOK, convert.ToUser(ctx, ctx.ContextUser, ctx.Doer))
}
// DeleteUser api for deleting a user
func DeleteUser(ctx *context.APIContext) {
// swagger:operation DELETE /admin/users/{username} admin adminDeleteUser
// ---
// summary: Delete a user
// produces:
// - application/json
// parameters:
// - name: username
// in: path
// description: username of user to delete
// type: string
// required: true
// - name: purge
// in: query
// description: purge the user from the system completely
// type: boolean
// responses:
// "204":
// "$ref": "#/responses/empty"
// "403":
// "$ref": "#/responses/forbidden"
// "404":
// "$ref": "#/responses/notFound"
// "422":
// "$ref": "#/responses/validationError"
if ctx.ContextUser.IsOrganization() {
ctx.Error(http.StatusUnprocessableEntity, "", fmt.Errorf("%s is an organization not a user", ctx.ContextUser.Name))
return
}
// admin should not delete themself
if ctx.ContextUser.ID == ctx.Doer.ID {
ctx.Error(http.StatusUnprocessableEntity, "", fmt.Errorf("you cannot delete yourself"))
return
}
if err := user_service.DeleteUser(ctx, ctx.ContextUser, ctx.FormBool("purge")); err != nil {
if models.IsErrUserOwnRepos(err) ||
models.IsErrUserHasOrgs(err) ||
models.IsErrUserOwnPackages(err) ||
models.IsErrDeleteLastAdminUser(err) {
ctx.Error(http.StatusUnprocessableEntity, "", err)
} else {
ctx.Error(http.StatusInternalServerError, "DeleteUser", err)
}
return
}
log.Trace("Account deleted by admin(%s): %s", ctx.Doer.Name, ctx.ContextUser.Name)
ctx.Status(http.StatusNoContent)
}
// CreatePublicKey api for creating a public key to a user
func CreatePublicKey(ctx *context.APIContext) {
// swagger:operation POST /admin/users/{username}/keys admin adminCreatePublicKey
// ---
// summary: Add a public key on behalf of a user
// consumes:
// - application/json
// produces:
// - application/json
// parameters:
// - name: username
// in: path
// description: username of the user
// type: string
// required: true
// - name: key
// in: body
// schema:
// "$ref": "#/definitions/CreateKeyOption"
// responses:
// "201":
// "$ref": "#/responses/PublicKey"
// "403":
// "$ref": "#/responses/forbidden"
// "422":
// "$ref": "#/responses/validationError"
form := web.GetForm(ctx).(*api.CreateKeyOption)
user.CreateUserPublicKey(ctx, *form, ctx.ContextUser.ID)
}
// DeleteUserPublicKey api for deleting a user's public key
func DeleteUserPublicKey(ctx *context.APIContext) {
// swagger:operation DELETE /admin/users/{username}/keys/{id} admin adminDeleteUserPublicKey
// ---
// summary: Delete a user's public key
// produces:
// - application/json
// parameters:
// - name: username
// in: path
// description: username of user
// type: string
// required: true
// - name: id
// in: path
// description: id of the key to delete
// type: integer
// format: int64
// required: true
// responses:
// "204":
// "$ref": "#/responses/empty"
// "403":
// "$ref": "#/responses/forbidden"
// "404":
// "$ref": "#/responses/notFound"
if err := asymkey_service.DeletePublicKey(ctx, ctx.ContextUser, ctx.PathParamInt64(":id")); err != nil {
if asymkey_model.IsErrKeyNotExist(err) {
ctx.NotFound()
} else if asymkey_model.IsErrKeyAccessDenied(err) {
ctx.Error(http.StatusForbidden, "", "You do not have access to this key")
} else {
ctx.Error(http.StatusInternalServerError, "DeleteUserPublicKey", err)
}
return
}
log.Trace("Key deleted by admin(%s): %s", ctx.Doer.Name, ctx.ContextUser.Name)
ctx.Status(http.StatusNoContent)
}
// SearchUsers API for getting information of the users according the filter conditions
func SearchUsers(ctx *context.APIContext) {
// swagger:operation GET /admin/users admin adminSearchUsers
// ---
// summary: Search users according filter conditions
// produces:
// - application/json
// parameters:
// - name: source_id
// in: query
// description: ID of the user's login source to search for
// type: integer
// format: int64
// - name: login_name
// in: query
// description: user's login name to search for
// type: string
// - name: page
// in: query
// description: page number of results to return (1-based)
// type: integer
// - name: limit
// in: query
// description: page size of results
// type: integer
// responses:
// "200":
// "$ref": "#/responses/UserList"
// "403":
// "$ref": "#/responses/forbidden"
listOptions := utils.GetListOptions(ctx)
users, maxResults, err := user_model.SearchUsers(ctx, &user_model.SearchUserOptions{
Actor: ctx.Doer,
Type: user_model.UserTypeIndividual,
LoginName: ctx.FormTrim("login_name"),
SourceID: ctx.FormInt64("source_id"),
OrderBy: db.SearchOrderByAlphabetically,
ListOptions: listOptions,
})
if err != nil {
ctx.Error(http.StatusInternalServerError, "SearchUsers", err)
return
}
results := make([]*api.User, len(users))
for i := range users {
results[i] = convert.ToUser(ctx, users[i], ctx.Doer)
}
ctx.SetLinkHeader(int(maxResults), listOptions.PageSize)
ctx.SetTotalCountHeader(maxResults)
ctx.JSON(http.StatusOK, &results)
}
// RenameUser api for renaming a user
func RenameUser(ctx *context.APIContext) {
// swagger:operation POST /admin/users/{username}/rename admin adminRenameUser
// ---
// summary: Rename a user
// produces:
// - application/json
// parameters:
// - name: username
// in: path
// description: existing username of user
// type: string
// required: true
// - name: body
// in: body
// required: true
// schema:
// "$ref": "#/definitions/RenameUserOption"
// responses:
// "204":
// "$ref": "#/responses/empty"
// "403":
// "$ref": "#/responses/forbidden"
// "422":
// "$ref": "#/responses/validationError"
if ctx.ContextUser.IsOrganization() {
ctx.Error(http.StatusUnprocessableEntity, "", fmt.Errorf("%s is an organization not a user", ctx.ContextUser.Name))
return
}
oldName := ctx.ContextUser.Name
newName := web.GetForm(ctx).(*api.RenameUserOption).NewName
// Check if user name has been changed
if err := user_service.RenameUser(ctx, ctx.ContextUser, newName); err != nil {
switch {
case user_model.IsErrUserAlreadyExist(err):
ctx.Error(http.StatusUnprocessableEntity, "", ctx.Tr("form.username_been_taken"))
case db.IsErrNameReserved(err):
ctx.Error(http.StatusUnprocessableEntity, "", ctx.Tr("user.form.name_reserved", newName))
case db.IsErrNamePatternNotAllowed(err):
ctx.Error(http.StatusUnprocessableEntity, "", ctx.Tr("user.form.name_pattern_not_allowed", newName))
case db.IsErrNameCharsNotAllowed(err):
ctx.Error(http.StatusUnprocessableEntity, "", ctx.Tr("user.form.name_chars_not_allowed", newName))
default:
ctx.ServerError("ChangeUserName", err)
}
return
}
log.Trace("User name changed: %s -> %s", oldName, newName)
ctx.Status(http.StatusNoContent)
}
```
|
```objective-c
#ifndef DLIB_DNN_CuDA_DATA_PTR_H_
#define DLIB_DNN_CuDA_DATA_PTR_H_
#ifdef DLIB_USE_CUDA
#include <memory>
#include <vector>
#include "../assert.h"
namespace dlib
{
namespace cuda
{
// your_sha256_hash--------------------
class cuda_data_void_ptr
{
/*!
WHAT THIS OBJECT REPRESENTS
This is a block of memory on a CUDA device.
!*/
public:
cuda_data_void_ptr() = default;
cuda_data_void_ptr(size_t n);
/*!
ensures
- This object will allocate a device memory buffer of n bytes.
- #size() == n
!*/
void* data() { return pdata.get(); }
const void* data() const { return pdata.get(); }
operator void*() { return pdata.get(); }
operator const void*() const { return pdata.get(); }
void reset() { pdata.reset(); }
size_t size() const { return num; }
/*!
ensures
- returns the length of this buffer, in bytes.
!*/
cuda_data_void_ptr operator+ (size_t offset) const
/*!
requires
- offset < size()
ensures
- returns a pointer that is offset by the given amount.
!*/
{
DLIB_CASSERT(offset < num);
cuda_data_void_ptr temp;
temp.num = num-offset;
temp.pdata = std::shared_ptr<void>(pdata, ((char*)pdata.get())+offset);
return temp;
}
private:
size_t num = 0;
std::shared_ptr<void> pdata;
};
inline cuda_data_void_ptr operator+(size_t offset, const cuda_data_void_ptr& rhs) { return rhs+offset; }
// your_sha256_hash--------------------
void memcpy(
void* dest,
const cuda_data_void_ptr& src
);
/*!
requires
- dest == a pointer to at least src.size() bytes on the host machine.
ensures
- copies the GPU data from src into dest.
- This routine is equivalent to performing: memcpy(dest,src,src.size())
!*/
void memcpy(
void* dest,
const cuda_data_void_ptr& src,
const size_t num
);
/*!
requires
- dest == a pointer to at least num bytes on the host machine.
- num <= src.size()
ensures
- copies the GPU data from src into dest. Copies only the first num bytes
of src to dest.
!*/
// your_sha256_hash--------------------
void memcpy(
cuda_data_void_ptr dest,
const void* src
);
/*!
requires
- dest == a pointer to at least src.size() bytes on the host machine.
ensures
- copies the host data from src to the GPU memory buffer dest.
- This routine is equivalent to performing: memcpy(dest,src,dest.size())
!*/
void memcpy(
cuda_data_void_ptr dest,
const void* src,
const size_t num
);
/*!
requires
- dest == a pointer to at least num bytes on the host machine.
- num <= dest.size()
ensures
- copies the host data from src to the GPU memory buffer dest. Copies only
the first num bytes of src to dest.
!*/
// your_sha256_hash--------------------
// your_sha256_hash--------------------
// your_sha256_hash--------------------
template <typename T>
class cuda_data_ptr
{
/*!
WHAT THIS OBJECT REPRESENTS
This is a block of memory on a CUDA device. It is just a type safe
version of cuda_data_void_ptr.
!*/
public:
static_assert(std::is_standard_layout<T>::value, "You can only create basic standard layout types on the GPU");
cuda_data_ptr() = default;
cuda_data_ptr(size_t n) : num(n)
/*!
ensures
- This object will allocate a device memory buffer of n T objects.
- #size() == n
!*/
{
if (n == 0)
return;
pdata = cuda_data_void_ptr(n*sizeof(T));
}
T* data() { return (T*)pdata.data(); }
const T* data() const { return (T*)pdata.data(); }
operator T*() { return (T*)pdata.data(); }
operator const T*() const { return (T*)pdata.data(); }
void reset() { pdata.reset(); }
size_t size() const { return num; }
friend void memcpy(
std::vector<T>& dest,
const cuda_data_ptr& src
)
{
dest.resize(src.size());
if (src.size() != 0)
memcpy(dest.data(), src.pdata);
}
friend void memcpy(
cuda_data_ptr& src,
const std::vector<T>& dest
)
{
if (dest.size() != src.size())
dest = cuda_data_ptr<T>(src.size());
if (src.size() != 0)
memcpy(src.pdata, dest.data());
}
private:
size_t num = 0;
cuda_data_void_ptr pdata;
};
// your_sha256_hash--------------------
class resizable_cuda_buffer
{
/*!
WHAT THIS OBJECT REPRESENTS
This is a block of memory on a CUDA device that will be automatically
resized if requested size is larger than allocated.
!*/
public:
cuda_data_void_ptr get(size_t size)
/*!
ensures
- This object will return the buffer of requested size or larger.
- buffer.size() >= size
- Client code should not hold the returned cuda_data_void_ptr for long
durations, but instead should call get() whenever the buffer is
needed. Doing so ensures that multiple buffers are not kept around
in the event of a resize.
!*/
{
if (buffer.size() < size)
{
buffer.reset();
buffer = cuda_data_void_ptr(size);
}
return buffer;
}
private:
cuda_data_void_ptr buffer;
};
// your_sha256_hash------------------------
std::shared_ptr<resizable_cuda_buffer> device_global_buffer(
);
/*!
ensures
- Returns a pointer to a globally shared CUDA memory buffer on the
currently selected CUDA device. The buffer is also thread local. So
each host thread will get its own buffer. You can use this global buffer
as scratch space for CUDA computations that all take place on the default
stream. Using it in this way ensures that there aren't any race conditions
involving the use of the buffer.
- The global buffer is deallocated once all references to it are
destructed. It will be reallocated as required. So if you want to avoid
these reallocations then hold a copy of the shared_ptr returned by this
function.
!*/
// your_sha256_hash------------------------
}
}
#endif // DLIB_USE_CUDA
#endif // DLIB_DNN_CuDA_DATA_PTR_H_
```
|
Henry Riley Bradbury (20 September 1829 Wingrove Place, Clerkenwell – 2 September 1860) was an English writer on printing.
Works
Bradbury is known for his book The Ferns of Great Britain and Ireland with author Thomas Moore and editor John Lindley published in 1855. It used the innovative technique of nature printing invented by Alois Auer and Andreas Worring in 1852 and improved by Bradbury. The technique consisted of pressing a leafy specimen onto a thin, soft lead plate, leaving an intaglio impression with very fine detail.
Life
He was the oldest son of five children of a printer, William Bradbury (1799–1869) and his wife, Sarah, and brother of William Hardwick Bradbury with whom he went into business in publishing. From 1856 he took an interest in the security aspects of banknote printing, and set up the business Bradbury & Wilkinson.
Bradbury had studied Auer's discovery in Vienna and had patented his own version in London. After being accused of plagiarism by Auer, Bradbury took his own life by drinking acid.
Notes
External links
Images from Nature-Printed British Ferns
George Glazer Gallery
Scientific illustrators
1829 births
1860 deaths
Botanical illustrators
1860s suicides
Suicides by poison
Suicides in the United Kingdom
|
```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.
//
///////////////////////////////////////////////////////////////////////////
import com.code_intelligence.jazzer.api.FuzzedDataProvider;
import com.fasterxml.jackson.core.io.SerializedString;
import com.fasterxml.jackson.dataformat.xml.JacksonXmlModule;
import com.fasterxml.jackson.dataformat.xml.XmlFactory;
import com.fasterxml.jackson.dataformat.xml.XmlMapper;
import com.fasterxml.jackson.dataformat.xml.ser.ToXmlGenerator;
import java.io.ByteArrayOutputStream;
import java.io.IOException;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.EnumSet;
import javax.xml.namespace.QName;
/** This fuzzer targets the methods of the ToXmlGenerator object */
public class ToXmlGeneratorFuzzer {
public static void fuzzerTestOneInput(FuzzedDataProvider data) {
try {
// Retrieve set of ToXmlGenerator.Feature
EnumSet<ToXmlGenerator.Feature> featureSet = EnumSet.allOf(ToXmlGenerator.Feature.class);
// Create and configure XmlMapper
XmlMapper mapper = null;
if (data.consumeBoolean()) {
mapper =
new XmlMapper(
XmlFactory.builder()
.enable(data.pickValue(featureSet))
.disable(data.pickValue(featureSet))
.build());
} else {
mapper = new XmlMapper(new JacksonXmlModule());
}
// Failsafe logic
if (mapper == null) {
return;
}
// Create and configure ToXmlGenerator
ToXmlGenerator generator =
((XmlMapper) mapper).getFactory().createGenerator(new ByteArrayOutputStream());
for (ToXmlGenerator.Feature feature : EnumSet.allOf(ToXmlGenerator.Feature.class)) {
generator.configure(feature, data.consumeBoolean());
}
generator.initGenerator();
generator.setNextName(new QName("OSS-Fuzz"));
generator.writeStartObject();
// Fuzz methods of ToXmlGenerator
String value = null;
switch (data.consumeInt(1, 18)) {
case 1:
generator.writeStringField(
data.consumeString(data.remainingBytes()), data.consumeRemainingAsString());
break;
case 2:
generator.writeFieldName(new SerializedString(data.consumeRemainingAsString()));
break;
case 3:
value = data.consumeRemainingAsString();
generator.writeString(value.toCharArray(), 0, value.length());
break;
case 4:
generator.writeString(new SerializedString(data.consumeRemainingAsString()));
break;
case 5:
generator.writeRawValue(data.consumeRemainingAsString());
break;
case 6:
value = data.consumeRemainingAsString();
generator.writeRawValue(value, 0, value.length());
break;
case 7:
value = data.consumeRemainingAsString();
generator.writeRawValue(value.toCharArray(), 0, value.length());
break;
case 8:
value = data.consumeRemainingAsString();
generator.writeRaw(value, 0, value.length());
break;
case 9:
value = data.consumeRemainingAsString();
generator.writeRaw(value.toCharArray(), 0, value.length());
break;
case 10:
generator.writeBoolean(data.consumeBoolean());
break;
case 11:
generator.writeNull();
break;
case 12:
generator.writeNumber(data.consumeInt());
break;
case 13:
generator.writeNumber(data.consumeLong());
break;
case 14:
generator.writeNumber(data.consumeDouble());
break;
case 15:
generator.writeNumber(data.consumeFloat());
break;
case 16:
generator.writeNumber(new BigDecimal(data.consumeLong()));
break;
case 17:
generator.writeNumber(BigInteger.valueOf(data.consumeLong()));
break;
case 18:
generator.writeNumber(data.consumeRemainingAsString());
break;
}
generator.writeEndObject();
generator.flush();
generator.close();
} catch (IOException | IllegalArgumentException | IllegalStateException e) {
// Known exception
}
}
}
```
|
```xml
/* eslint-disable @typescript-eslint/no-empty-function */
import React from "react"
import { ClientIntroCommand } from "./index"
export default {
title: "Timeline Commands/Client Intro Command",
}
const clientIntroCommand = {
clientId: "",
connectionId: 0,
deltaTime: 0,
important: false,
messageId: 0,
type: "",
payload: { name: "Test?" },
date: new Date("2019-01-01T10:12:23.435"),
}
export const Closed = () => (
<ClientIntroCommand command={clientIntroCommand} isOpen={false} setIsOpen={() => {}} />
)
export const Open = () => (
<ClientIntroCommand command={clientIntroCommand} isOpen setIsOpen={() => {}} />
)
```
|
Peter Pook Chuen Keat, sometimes rendered as Peter C.K. Pook, is a Malaysian pharmacologist. He is Professor of Pharmacology and Deputy Vice-Chancellor (i.e. Vice President) of the International Medical University in Kuala Lumpur.
Biography
From 1983 to 1994, Peter Pook Chuen Keat was research scientist at the University of Bristol where he received a PhD in 1988 for his research on ligand binding and electrophysiological studies of excitatory amino acid receptors in the rat central nervous system, under the guidance of the organic chemist Jeffrey C. Watkins.
He was Reader in Neuropharmacology at the University of Sunderland from 1995 to 1998. He returned to Malaysia to become Professor of Pharmacology at the Universiti Putra Malaysia in 1998. Since 2001 he has been Professor of Pharmacology at the International Medical University, in 2013 he became Vice President of the university. Since 2016 he is Deputy Vice-Chancellor.
References
Year of birth missing (living people)
Living people
Malaysian pharmacologists
Academic staff of the International Medical University
Academics of the University of Bristol
Alumni of the University of Bristol
Malaysian people of Chinese descent
|
Dic Edwards (born 1948) is a British playwright, poet and teacher of creative writing. His writing often touches upon political and social issues, nationalism and democracy.
Early life
Edwards was born in Cardiff. He was educated at Whitchurch High (Grammar), Cardiff, St David's University College, Lampeter, Hughes Hall, Cambridge and the University of Wales at Aberystwyth.
Career
Edwards' early work was produced at the Sherman Theatre, Cardiff. These included At The End of The Bay, Canned Goods and Looking For The World. At the beginning of his career, he was introduced to Edward Bond who became, and still is, a supporter of his work.
Before taking up a residency at Theatr Clwyd in 1989 and producing the play the fourth world, Edwards worked with The Haymarket Theatre in Leicester where his productions were Long To Rain Over Us and Low People.
At this time Edwards began to be published by Oberon Books Ltd., London. Its publishing editor, James Hogan, encouraged The Citizens' Theatre, Glasgow to produce his play Casanova Undone which was followed a year later by Wittgenstein's Daughter. Both were subsequently produced at The White Bear Theatre in London.
In the early 1990s Edwards worked with Mark Dornford May at Broomhill which resulted in the opera The Juniper Tree, written with composer Andrew Toovey and The Beggar's New Clothes, a reworking of The Beggar's Opera, with music by Warren Belshaw. The latter transferred to The Cockpit Theatre, London.
Edwards returned to working in Wales with Sgript Cymru and in 2002 his comedy Franco's Bastard was produced at Chapter Arts Centre. The play revisits Edwards' time as a young student at Lampeter University when he met the Welsh Nationalist activist and leader of the right wing Free Wales Army, Juian Cayo Evans. During a political falling out, the socialist Edwards was attacked by Evans and a fellow member of the FWA, which resulted in a month's stay at Chepstow Hospital where Edwards' head injuries were treated. The play centres on a sometimes scathing and sometimes affectionate account of the charismatic Evans. During the play's premier a group of Welsh Nationalists protested the play by leading walkouts and throwing stink bombs, an event that prompted questions in parliament.
In 2003, Edwards wrote the libretto for Keith Burstein's opera, Manifest Destiny. The opera was performed at The Tricycle Theatre, London as a benefit for the Redgraves' Guantanamo Human Rights Commission and subsequently played at The Edinburgh Festival in 2005. At the same time, in the same season, Cambridge University's ADC produced Edwards' play Astrakhan (Winter).
In 2013, after writing The Opportunist for The University of Michigan, Ann Arbor, Edwards turned away from writing for the theatre, arguing that "British Theatre has become a director's theatre. Directors want an easy life and, in the main, hire only TV writers now."
His play Over Milk Wood, a response to the radio play by Dylan Thomas, has been translated into Catalan as Sobre El Bosc Lacti and published by Arola Editors, Tarragona.
There have been productions of his work at NIDA in Sydney, Australia and That Theatre, Copenhagen, Denmark and a public reading of The Pimp in New York.
For many years, Edwards has worked with Theatre in Education companies most notably Spectacle Theatre and collaborated very successfully with director Steve Davis.
Edwards has recently finished The Vote, a play about the collapse of British democracy. He is working on Nude a play about the Welsh painter Augustus John. He is also working on a collection of short stories with the working title From the Backland.
Edwards founded the Creative Writing program at University of Wales Trinity Saint David, Lampeter, where he was a lecturer until 2019. He is the editor and founder of the literary magazine The Lampeter Review.
Personal life
Edwards is married to Gwenda and has three children and eight grandchildren. He lives in Aberaeron in West Wales.
Selected produced works
Theatre
Late City Echo (1981), Sherman Arena Cardiff
At the End of the Bay (1982), Sherman Arena, Cardiff
Canned Goods (1983), Sherman Arena, Cardiff
Looking for the World (1986), Sherman Main Stage, Cardiff †
Long To Rain Over Us (1987), Haymerket Theatre, Leicester †
low people (1989), Haymarket Theatre, Leicester
the fourth world (1990), Theatr Clwyd †
Regan, 1991, Theatr Powys
Casanova Undone (1992), Citizens Theatre, Glasgow and The White Bear, London †
The Juniper Tree (1992), Opera Libretto, Broomhill Opera, Kent
The Beggar's New Clothes (1992), book and lyrics, Broomhill Opera, Kent and Cockpit Theatre, London
Wittgenstein's Daughter (1993), Citizens Theatre, Glasgow and The White Bear, London †
Utah Blue (1995), The Point, Cardiff †
Lola Brecht (1995), Castaway, UK Tour †
Manifest Destiny (2005), Tricycle Theatre, London, Assembly Rooms, Edinburgh Festival, Opera Close Up, London
Astrakhan (Winter) (2005), Cambridge ADC, Edinburgh Festival †
The Pimp (2006), The White Bear, London †
The Opportunist (2013) Basement Players, University of Michigan, US
† Published by Oberon Books, London
Also published:
The Shakespeare Factory and other plays for children, Seren Books (1998)
Sobre El Bosc Lacti, Arola Editors, Tarragona (2002)
Kid , Argraff, Cardiff (2004)
Solitude, (In Two Immorality Plays) Oberon Books, London (2007)
Poetry
Walt Whitman and Other Poems (2008)
Pieces in The Manhattan Review, Poetry Wales etc.
References
Anglo-Welsh poets
Welsh dramatists and playwrights
Living people
Writers from Cardiff
1953 births
Alumni of the University of Wales, Lampeter
|
```c
--- wordplay.c.orig 1996-03-20 09:34:00.000000000 -0600
+++ wordplay.c 2012-10-03 05:07:15.000000000 -0500
@@ -136,13 +136,14 @@
*/
#include <stdio.h>
+#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#define max(A, B) ((A) > (B) ? (A) : (B))
#define min(A, B) ((A) < (B) ? (A) : (B))
-#define DEFAULT_WORD_FILE "words721.txt"
+#define DEFAULT_WORD_FILE "@PREFIX@/share/wordplay/words721.txt"
#define WORDBLOCKSIZE 4096
#define MAX_WORD_LENGTH 128
#define SAFETY_ZONE MAX_WORD_LENGTH + 1
```
|
Fast Romantics is a Canadian indie rock band based in Toronto, Ontario and originally formed in Calgary, Alberta.
Early beginnings
Fast Romantics formed in 2009 by former members of long-running Calgary band The Mood, initially retaining three of its original members: Matthew Angus, Matthew Kliewer, and Jeffrey Lewis. Upon reforming, the band added Alan Reain on drums and began doing a number of local shows.
The band added and lost many members in the years that followed, releasing two independent records, touring heavily, and eventually reforming in Toronto in 2014.
The Fast Romantics debut, a self-titled LP, was a self-recorded effort released in 2008, and later mixed in Vancouver by Mike Fraser, who has also mixed albums by acts such as Franz Ferdinand, Elvis Costello, and Metallica. In 2008, Fast Romantics was one of the winners of the Xposure Contest hosted by Calgary alternative rock station X92.9/CFEX-FM, and three songs appeared on the resultant compilation CD. The band toured Canada twice in support of that album, and played events such as Virgin Festival.
In September 2009, the band was selected by Spin Magazine and competition co-creator John Varvatos as one of three global finalists in the magazine's "Free the Noise" competition. Taking a detour from their national Canadian tour, the band was flown to New York City to perform at the music club CBGB (now occupied by Varvatos). Guitarist Matthew Kliewer stated: "There were apparently 950 people there. I heard that Dennis Quaid was there, but I couldn't see if he was jumping up and down, checking his watch, or trying to save the planet."
On July 6, 2010, the band independently released the EP Kidcutter. The album was produced by Howard Redekopp, who has also produced Tegan and Sara, The New Pornographers, and Mother Mother. The EP was once again mixed by Mike Fraser.
Songs from the album have appeared on numerous television shows including Shameless, Breaking In, Vampire Diaries, Pretty Little Liars, and One Tree Hill. "Cool Kids" was also featured in the 2013 film As Cool as I Am.
Multiple lineup changers rocked the band during this early phase, and in 2013 the band eventually added two Australian members, Shane O'Keefe and Lauren Heron, at the same time realizing their next full-length album, Afterlife Blues. Again produced by Howard Redekopp, the album's first single was "Funeral Song", which eventually charted on national alternative rock radio. The band toured in Spring 2014 with openers Dear Rouge in support of the album.
In 2014, the band underwent another dramatic loss in members, reduced to its two founding members, primary songwriter Matthew Angus, and original bass player Jeffrey Lewis.
Rebuilding and recent history
Deciding to rebuild the band from scratch with Lewis, Angus added four new members in 2014, beginning with respected Toronto singer/songwriter Kirty as a multi-instrumentalist and singer. The two developed a chemistry quickly and as new songs began to form, Kevin Black (formerly of Toronto-based band Hands & Teeth) was added on guitars and vocals, Nick McKinlay was added on drums, and eventually in 2015, Lisa Lorenz was added on keyboards.
Fast Romantics won Pop Group of the Year at the Sirius XM Indies in May 2014 for "Funeral Song", after which point, Angus began work on writing new material, saying in 2015: "We’ve been writing songs like ‘Julia’ that are super upbeat and poppy, and then there's these other songs that are dark and vibe-y and really rhythmic. And we’re just sort of experimenting with everything. We'll probably come out with dozens and dozens of songs, so until it gets to a point where it's like, yeah, we’ve got an album we want to put forward and this is our sound for the next few years, we’re just going to keep doing that."
The first single released by this new version of Fast Romantics was "Julia" in March, 2015. The song reached the Top 5 on CBC Radio 2 in Canada, and found itself onto radio in America as well. They released a music video featuring Fred Astaire dancing with members of the band, which was eventually short-listed for the Prism Prize, a national prize for Music Videos in Canada.
In June 2016, Fast Romantics won the 2016 SOCAN Songwriting Prize for the song "Julia", which was voted the best song by emerging artists over the past year. The rest of 2016 saw the band touring Canada and the United States while also finalizing work on their next LP with producers Gus Van Go and Werner F, who also produced "Julia".
In January 2017, the band released the first official single from their as-yet untitled new album, a political song called "Why We Fight." Released on the same day as the inauguration of Donald Trump, the video featured clips of American pop culture and protest movements, along with footage Angus found of an actor portraying Abraham Lincoln in a 1956 Greyhound-sponsored propaganda video, who was made to lip sync the lyrics of the song.
That same month, the band recorded a three-song performance of new material for alternative rock radio station Indie 88, stating in an interview portion that this was the band's true "first record" and that everything that came before was "just play-dough."
Shortly after the appearance, in February 2017, the band officially announced that they had signed to Light Organ Records and would be releasing their long-awaited LP on April 28, 2017, titled "American Love." The press release described songs that were originally intended as love songs, but eventually became infused with the political uncertainty and social unrest occurring during the making of the album, a reference to the rise of Donald Trump throughout the 2016 election campaign in the USA. Frontman and lyricist Matthew Angus was quoted as saying: "I was falling pretty hard in love when we started the record. But the songs ended up being paintings of what it felt like to fall in love while the rest of the world went mad. The American election went bizarre and took over the Canadian one, everybody's obsession with social media hit some kind of peak, and suddenly everyone — everywhere — was talking about America. Smartphones were going off like bombs everywhere I went. It started seeping into the songwriting, and now I'm not even sure how to describe it. Is it a collection of love songs about politics or is it a collection of political songs about love?"
Shortly after announcing a release date and record label for "American Love," the band went on whirlwind tour as the opening act for Said the Whale, playing 15 shows in 19 days. That was followed by am American tour in support of Air Traffic Controller.
In 2020, Fast Romantics released the album Pick It Up On August 20, 2020, Fast Romantics gathered a small group of people at The Dakota Tavern in Toronto, and performed a full Pick It Up concert. In July 2021, the filmed concert was posted on YouTube.
Discography
Albums
The Fast Romantics (2009)
Afterlife Blues (2013)
American Love (2017)
Pick It Up (2020)
Happiness + Euphoria (2023)
EPs
Kidcutter (2010)
See also
Music of Canada
Canadian rock
List of bands from Canada
References
External links
Musical groups established in 2008
Canadian indie rock groups
Canadian indie pop groups
Musical groups from Calgary
2008 establishments in Alberta
|
```yaml
{{- /*
*/}}
{{- if .Values.cainjector.serviceAccount.create }}
apiVersion: v1
kind: ServiceAccount
automountServiceAccountToken: {{ .Values.cainjector.serviceAccount.automountServiceAccountToken }}
metadata:
name: {{ template "certmanager.cainjector.serviceAccountName" . }}
{{- $versionLabel := dict "app.kubernetes.io/version" ( include "common.images.version" ( dict "imageRoot" .Values.cainjector.image "chart" .Chart ) ) }}
{{- $labels := include "common.tplvalues.merge" ( dict "values" ( list .Values.commonLabels $versionLabel ) "context" . ) }}
labels: {{- include "common.labels.standard" ( dict "customLabels" $labels "context" $ ) | nindent 4 }}
app.kubernetes.io/component: cainjector
{{- $mergedAnnotations := include "common.tplvalues.merge" ( dict "values" ( list .Values.cainjector.serviceAccount.annotations .Values.commonAnnotations ) "context" . ) }}
{{- if $mergedAnnotations }}
annotations: {{- include "common.tplvalues.render" ( dict "value" $mergedAnnotations "context" $ ) | nindent 4 }}
{{- end }}
namespace: {{ .Release.Namespace | quote }}
{{- end }}
```
|
The Donald and Helen Olsen House, in Berkeley, California, was built in 1954.
It is a Modernist, International-style house designed by architect Donald Olsen. Olsen is a native of Minnesota who studied under Walter Gropius at Harvard and established an architecture practice in Berkeley in 1953.
The house is situated on a slope in the North Berkeley Hills near John Hinkel Park. The structure's main floor was built above ground level to maximize the site's views of San Francisco Bay and the Golden Gate Bridge. However, the view has been obscured over the years by the growth of mature trees on the property. The National Park Service described the house's style as follows: "The house's design is specifically the International style popularized in Europe by architects Ludwig Mies van der Rohe, Walter Gropius, and Le Corbusier. The Olsen House displays the geometries, ethos, strict formalism and rigor that embody this utopian style." The house also includes a mural by artist Claire Falkenstein.
The building was listed on the U.S. National Register of Historic Places on October 1, 2010. The listing was announced as the featured listing in the National Park Service's weekly list of October 8, 2010. In its write-up, the Park Service called Olsen "an important mid-20th-century Bay Area architect."
References
Houses on the National Register of Historic Places in California
Houses in Alameda County, California
National Register of Historic Places in Berkeley, California
Berkeley Landmarks in Berkeley, California
|
A graded shoreline is a stage in the cycle of coastal development characterised by a flat and straight coastline. It is formed under the influence of wind and water from the original bays, islands, peninsulas and promontories. Sand and gravel is carried away and dumped at other locations depending on the direction and strength of sea currents. Typical of graded shorelines are the formation of dunes, wide sandy beaches and sometimes a lagoon or a spit. Where two graded shorelines meet, a headland may form with a sandy reef in the sea beyond it. Parallel to the graded shoreline sandbanks may form as a result of sediments transported away from the shore.
Examples
Long stretches of the southern Baltic Sea coast in the German state of Mecklenburg-Vorpommern, in Poland, Russia, Lithuania and Latvia.
The North Sea coast from Belgium, along the outer edge of the Wadden Sea islands in the Netherlands and Germany, to the west coast and northeast coast of Jutland in Denmark.
On the headland of Jutland near Skagen the two graded shorelines for the constantly changing promontory of Grenen.
On the island of Anholt in the Kattegat, two graded shorelines meet at the eastern bill of Totten. This headland also extends far under the surface of the sea as a reef.
The peninsula of Hel in Poland consists of sediments carried eastwards from the Pomeranian coast, that are deposited in front of the Bay of Danzig.
Sources
German Wikipedia
Whittow, John (1984). Dictionary of Physical Geography. London: Penguin, 1984. .
Geomorphology
Coastal geography
|
```java
package com.abel.bean;
import javax.persistence.Entity;
import javax.persistence.GeneratedValue;
import javax.persistence.Id;
/**
* Created by yangyibo on 2018/6/28.
*/
@Entity
public class Person {
@Id
@GeneratedValue
private Long id;
private String name;
public Person() {
super();
}
public Person(String name) {
super();
this.name = name;
}
public Long getId() {
return id;
}
public void setId(Long id) {
this.id = id;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
}
```
|
Aleksandra Georgievna Chudina (; 6 November 1923 – 28 October 1990) was a Soviet athlete who excelled in field hockey, volleyball, and various track and field events.
Field hockey
Chudina took a wide range of sports and excelled first in field hockey, where she started playing as a defender in 1937 and later changed to a forward. With her team Dynamo Moscow she won several major tournaments at the city and national levels between 1937 and 1947.
Athletics
Chudina then changed to athletics, and had a first international success in 1946, when she finished second in the high jump at the European championships. At the 1952 Summer Olympics she won silver medals in the javelin throw and long jump and a bronze in the high jump. On 22 May 1954, she set a new world record in the high jump at 1.73 meters. The same year she won two European medals in the pentathlon and long jump, but finished only sixth in the high jump.
Volleyball
Between 1947 and 1963 Chudina was also a member, and often the captain, of the Dynamo and national volleyball teams. With the national teams she won world championships in 1952, 1956 and 1960, and European championships in 1949, 1950, 1951 and 1958, finishing second in 1955.
Personal life
Chudina was one of the most popular Soviet sportspersons of the 1950s, and was then used by the Soviet media as an example of superiority of the national sport programs. She was a colorful person who had a coarse low voice, enjoyed alcohol drinking and playing cards in a company, and was a careless car driver. After retiring from competitions (as she was suspected in being an Intersex person) she worked as a sports administrator and was soon forgotten. She had developed tuberculosis and lost one leg due to gangrene. A chain smoker through much of her life, she died of a stomach cancer, aged 66.
References
1923 births
1990 deaths
People from Tula Oblast
Soviet women's volleyball players
Soviet pentathletes
Soviet female javelin throwers
Soviet female high jumpers
Soviet female long jumpers
Olympic athletes for the Soviet Union
Olympic silver medalists for the Soviet Union
Olympic bronze medalists for the Soviet Union
Athletes (track and field) at the 1952 Summer Olympics
European Athletics Championships medalists
Dynamo Sports Club sportspeople
Recipients of the Order of Lenin
Honoured Masters of Sport of the USSR
Deaths from cancer in Russia
Deaths from stomach cancer
Burials in Troyekurovskoye Cemetery
Medalists at the 1952 Summer Olympics
Olympic silver medalists in athletics (track and field)
Olympic bronze medalists in athletics (track and field)
Deaths from cancer in the Soviet Union
|
Jill Adams (22 July 1930 – 13 May 2008) was an English actress, artist and fashion model. She featured or starred in over 25 films during the 1950s and 1960s.
Early life
Jill Adams was born Jill Siggins in London in 1930, the daughter of the silent-screen actress Molly Adair (real name Mary Marguerite Potter). Jill's New Zealand-born father, Arthur James Siggins, had met the Irish-American Adair when she was on location filming The Blue Lagoon (1923). Siggins, a former member of the British South Africa Police and an expert animal handler, worked on the film The Four Feathers (1921), and later wrote a book about the experience, Shooting with Rifle and Camera.
Jill was one of four children. When she was six years old, Jill moved to Wales where she continued her education, after which she worked for four years on a farm. Her ambition was to become an artist, and she moved to London to pursue that career, taking work as a sales assistant, secretary, and window dresser. After working as a window dresser, by 1944 Adams was an assistant artist at Mr & Mrs Jones, a department store, where she was required to attend fashion shows and sketch the clothes. One day a model failed to arrive, and Adams, found to be the perfect size, stepped in, thus beginning her modelling career, which included a flag-hoisting recruitment poster for the Women's Royal Naval Service. During her modelling days she was 'discovered' and began an acting career that spanned two decades.
Film career
The same year, Jill Adams had a part in a late-night stage revue, On with the New, starring Anthony Newley, and she began taking bit roles in movies – dancing with Nigel Patrick in Forbidden Cargo, appearing in The Young Lovers (1954), The Black Knight (1954), Out of the Clouds (1955), the Arthur Askey comedy The Love Match (1955), and in Doctor at Sea (1955) with Dirk Bogarde. She also appeared in episodes of the television series The Vise and Aggie.
Adams had one of her first substantial roles in the sprightly "Quota quickie" movie One Jump Ahead (1955), in a rare villainous portrayal as a murderess who was once an old flame of a reporter (Paul Carpenter) who is usually "one jump ahead" of the police. Adams was one of Rex Harrison's seven wives in the sophisticated comedy The Constant Husband (1955).
Her most notable films were comedies, at which she excelled, such as Doctor at Sea (1955), Value for Money (1955), Private's Progress (1956), Brothers in Law (1957) and The Green Man (1956), in which she starred with Alastair Sim and George Cole. She also did some stage and radio work.
Adams had the leading role in a low budget crime film One Way Out (1955) and a TV series Wideawake (1957). She had roles in episodes of My Pal Bob and Educated Evans.
Adams appeared with Richard Attenborough in The Scamp (1957), and was given star billing in an Australian movie, Dust in the Sun (1958), but it had limited distribution.
In 1960/61 she featured in a television series, The Flying Doctor, based on the real-life activities of the Royal Flying Doctor Service serving the Australian outback, but filmed in Australia.
Her career at this point seemed to lose direction. Death Over My Shoulder (1958) and Crosstrap (1960) had been poor "B" movies, and her roles in Carry On Constable (1960) and Doctor in Distress (1963) were small. The Yellow Teddy Bears (1963) was an exploitation thriller (its US title was Gutter Girls), and her small role in Promise Her Anything (1965), starring Warren Beatty and Leslie Caron, was to be her last.
Personal life
In 1951 she married a young American navy yeoman, Jim Adams, whose surname she adopted professionally, which resulted in the birth of a daughter, Tina.
At the peak of her acting career in 1957, Adams married the well-known BBC TV and radio personality Peter Haigh, and had a second daughter, Peta Louise. In 1971, the whole family moved to the Algarve, in southern Portugal, where they ran a small hotel for several years in the village of Albufeira.
When her second marriage ended, she continued with a restaurant career, accompanied by her partner Mike. Some years later she retired from the business and with her new partner, Alan "Buster" Jones, an accountant, went to live just outside Lisbon. They later moved to Spain, where they enjoyed homes close to Alicante, then Barcelona and eventually in the Costa del Sol.
After Buster died in 1996, she moved back to Portugal, to be with her granddaughter, Emma, and her great-granddaughter, Tania, and began painting again. She had cancer from 2005 until her death in 2008.
Filmography
Film
Forbidden Cargo (1954) as Michael's Dance Partner (uncredited)
The Young Lovers (1954) as Judy (uncredited)
The Black Knight (1954) as Extra (uncredited)
The Love Match (1955) as Clarrie (uncredited)
Out of the Clouds (1955) as Bit Part (uncredited)
One Jump Ahead (1955) as Judy
The Constant Husband (1955) as Joanna
Doctor at Sea (1955) as Jill
Value for Money (1955) as Joy
One Way Out (1955) as Shirley Harcourt
Count of Twelve (1955)
Private's Progress (1956) as Prudence Greenslade
The Green Man (1956) as Ann Vincent
Brothers in Law (1957) as Sally Smith
The Scamp (1957) as Julie Cunningham
Death Over My Shoulder (1958) as Evelyn Connors
Dust in the Sun (1958) as Julie Kirkbridge
Carry On Constable (1960) as WPC Harrison
Crosstrap (1962) as Sally
The Yellow Teddy Bears (1963) as June Wilson
Doctor in Distress (1963) as Genevieve
The Comedy Man (1964) as Jan Kennedy (uncredited)
Promise Her Anything (1965) as Mrs. B.M. von Crispin (final film role)
Television
The Vise (1955) as Wendy Graves
The Adventures of Aggie (1956) as Pam
Educated Evans as Gloria
My Pal Bob (1958) as Jill
The Flying Doctor (1959) as Mary Meredith
No Hiding Place (1963) as Peggy Dawson
References
External links
Obituary in The Times
Obituary in The Independent
1930 births
2008 deaths
English film actresses
Deaths from cancer in Portugal
Actresses from London
20th-century English actresses
English female models
20th-century English painters
21st-century English painters
English restaurateurs
Women restaurateurs
English people of American descent
English people of New Zealand descent
English people of Irish descent
21st-century English women
Models from London
|
The Tillamook County Fair is an annual event that takes place August in the city of Tillamook in Tillamook County, Oregon, United States. The county fair was established in 1891. The fairgrounds have the largest facility in the county for conventions, meetings, receptions, and other gatherings. Fair attendance continues to grow, with attendance topping 70,000 annually.
History
The land for the current fairgrounds was donated in 1921, when a county-wide levy of $1 million was passed for acquisition and building of the site.
The fair went on hiatus in 1917–18, 1942–45.
Pig-N-Ford Races
The Pig-N-Ford Races, first run in 1925, are an auto racing event staged at the fair and have garnered national appeal over time.
The races are held in stripped Model T Fords with stock mechanicals. When the starter pistol fires, the drivers run to the opposite side of the front straight, grab a live pig from a bin, and must then hand-crank their car and drive it one lap. They then stop, kill the engine, get a different pig, and race another lap. The first driver to complete three laps in this manner without losing their pig is the winner.
Some of the cars that first ran in 1925 are still on the track today.
References
External links
Tillamook County Fair (official website)
Pig-N-Ford Races
Auto races in the United States
Fairgrounds in the United States
Tourist attractions in Tillamook County, Oregon
Recurring events established in 1891
Festivals in Oregon
August events
Convention centers in Oregon
Annual fairs
Agriculture in Oregon
Fairs in Oregon
1891 establishments in Oregon
Annual events in Oregon
|
Edlefsen is a surname. Notable people with the surname include:
J. L. Edlefsen (1874–1948), American politician
R. E. Edlefsen (1906–1986), American politician
Steve Edlefsen (born 1985), American baseball player
Tom Edlefsen (born 1941), American tennis player
See also
Ellefsen
|
S79 may refer to:
County Route S79 (Bergen County, New Jersey)
Expressway S79 (Poland)
Green Sea Airport in Horry County, South Carolina, United States
, a submarine of the Israeli Navy
S79 Select Bus Service (New York City bus) serving Staten Island
Savoia-Marchetti S.79, an Italian bomber
|
```java
package org.goshop.users.service;
import com.alibaba.fastjson.JSONObject;
import org.goshop.base.service.SpringBaseTest;
import org.goshop.email.pojo.MailParam;
import org.junit.Test;
import org.springframework.beans.factory.annotation.Autowired;
import org.springframework.jms.core.JmsTemplate;
import org.springframework.jms.core.MessageCreator;
import javax.jms.JMSException;
import static org.junit.Assert.*;
/**
* Created by Administrator on 2016/7/15.
*/
public class MemberServiceImplTest extends SpringBaseTest {
@Autowired
private JmsTemplate activeMqJmsTemplate;
@Test
public void testSendEmailFindPassword() throws Exception {
final MailParam mail = new MailParam();
mail.setTo("pzh_gugu@126.com");
mail.setSubject("");
mail.setContent("");
//eMailService.send(mail);
activeMqJmsTemplate.send(new MessageCreator() {
public javax.jms.Message createMessage(javax.jms.Session session) throws JMSException {
return session.createTextMessage(JSONObject.toJSONString(mail));
}
});
}
}
```
|
```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.ctrip.framework.apollo.portal.component.emailbuilder;
import com.google.common.collect.Lists;
import com.ctrip.framework.apollo.common.constants.ReleaseOperation;
import com.ctrip.framework.apollo.common.constants.ReleaseOperationContext;
import com.ctrip.framework.apollo.common.dto.ReleaseDTO;
import com.ctrip.framework.apollo.common.entity.AppNamespace;
import com.ctrip.framework.apollo.core.enums.ConfigFileFormat;
import com.ctrip.framework.apollo.portal.environment.Env;
import com.ctrip.framework.apollo.portal.component.config.PortalConfig;
import com.ctrip.framework.apollo.portal.constant.RoleType;
import com.ctrip.framework.apollo.portal.entity.bo.Email;
import com.ctrip.framework.apollo.portal.entity.bo.ReleaseHistoryBO;
import com.ctrip.framework.apollo.portal.entity.bo.UserInfo;
import com.ctrip.framework.apollo.portal.entity.vo.Change;
import com.ctrip.framework.apollo.portal.entity.vo.ReleaseCompareResult;
import com.ctrip.framework.apollo.portal.service.AppNamespaceService;
import com.ctrip.framework.apollo.portal.service.ReleaseService;
import com.ctrip.framework.apollo.portal.service.RolePermissionService;
import com.ctrip.framework.apollo.portal.spi.UserService;
import com.ctrip.framework.apollo.portal.util.RoleUtils;
import org.apache.commons.lang3.time.FastDateFormat;
import org.springframework.beans.factory.annotation.Autowired;
import org.springframework.util.CollectionUtils;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.regex.Matcher;
public abstract class ConfigPublishEmailBuilder {
private static final String EMERGENCY_PUBLISH_TAG = "<span style='color:red'>()</span>";
//email content common field placeholder
private static final String EMAIL_CONTENT_FIELD_APPID = "#\\{appId\\}";
private static final String EMAIL_CONTENT_FIELD_ENV = "#\\{env}";
private static final String EMAIL_CONTENT_FIELD_CLUSTER = "#\\{clusterName}";
private static final String EMAIL_CONTENT_FIELD_NAMESPACE = "#\\{namespaceName}";
private static final String EMAIL_CONTENT_FIELD_OPERATOR = "#\\{operator}";
private static final String EMAIL_CONTENT_FIELD_RELEASE_TIME = "#\\{releaseTime}";
private static final String EMAIL_CONTENT_FIELD_RELEASE_ID = "#\\{releaseId}";
private static final String EMAIL_CONTENT_FIELD_RELEASE_HISTORY_ID = "#\\{releaseHistoryId}";
private static final String EMAIL_CONTENT_FIELD_RELEASE_TITLE = "#\\{releaseTitle}";
private static final String EMAIL_CONTENT_FIELD_RELEASE_COMMENT = "#\\{releaseComment}";
private static final String EMAIL_CONTENT_FIELD_APOLLO_SERVER_ADDRESS = "#\\{apollo.portal.address}";
private static final String EMAIL_CONTENT_FIELD_DIFF_CONTENT = "#\\{diffContent}";
private static final String EMAIL_CONTENT_FIELD_EMERGENCY_PUBLISH = "#\\{emergencyPublish}";
private static final String EMAIL_CONTENT_DIFF_MODULE = "#\\{diffModule}";
protected static final String EMAIL_CONTENT_GRAY_RULES_MODULE = "#\\{rulesModule}";
//email content special field placeholder
protected static final String EMAIL_CONTENT_GRAY_RULES_CONTENT = "#\\{rulesContent}";
//set config's value max length to protect email.
protected static final int VALUE_MAX_LENGTH = 100;
protected FastDateFormat dateFormat = FastDateFormat.getInstance("yyyy-MM-dd HH:mm:ss");
@Autowired
private RolePermissionService rolePermissionService;
@Autowired
private ReleaseService releaseService;
@Autowired
private AppNamespaceService appNamespaceService;
@Autowired
private UserService userService;
@Autowired
protected PortalConfig portalConfig;
/**
* email subject
*/
protected abstract String subject();
/**
* email body content
*/
protected abstract String emailContent(Env env, ReleaseHistoryBO releaseHistory);
/**
* email body template framework
*/
protected abstract String getTemplateFramework();
/**
* email body diff module template
*/
protected abstract String getDiffModuleTemplate();
public Email build(Env env, ReleaseHistoryBO releaseHistory) {
Email email = new Email();
email.setSubject(subject());
email.setSenderEmailAddress(portalConfig.emailSender());
email.setRecipients(recipients(releaseHistory.getAppId(), releaseHistory.getNamespaceName(), env.toString()));
String emailBody = emailContent(env, releaseHistory);
//clear not used module
emailBody = emailBody.replaceAll(EMAIL_CONTENT_DIFF_MODULE, "");
emailBody = emailBody.replaceAll(EMAIL_CONTENT_GRAY_RULES_MODULE, "");
email.setBody(emailBody);
return email;
}
protected String renderEmailCommonContent(Env env, ReleaseHistoryBO releaseHistory) {
String template = getTemplateFramework();
String renderResult = renderReleaseBasicInfo(template, env, releaseHistory);
renderResult = renderDiffModule(renderResult, env, releaseHistory);
return renderResult;
}
private String renderReleaseBasicInfo(String template, Env env, ReleaseHistoryBO releaseHistory) {
String renderResult = template;
Map<String, Object> operationContext = releaseHistory.getOperationContext();
boolean isEmergencyPublish = operationContext.containsKey(ReleaseOperationContext.IS_EMERGENCY_PUBLISH) &&
(boolean) operationContext.get(ReleaseOperationContext.IS_EMERGENCY_PUBLISH);
if (isEmergencyPublish) {
renderResult = renderResult.replaceAll(EMAIL_CONTENT_FIELD_EMERGENCY_PUBLISH, Matcher.quoteReplacement(EMERGENCY_PUBLISH_TAG));
} else {
renderResult = renderResult.replaceAll(EMAIL_CONTENT_FIELD_EMERGENCY_PUBLISH, "");
}
renderResult = renderResult.replaceAll(EMAIL_CONTENT_FIELD_APPID, Matcher.quoteReplacement(releaseHistory.getAppId()));
renderResult = renderResult.replaceAll(EMAIL_CONTENT_FIELD_ENV, Matcher.quoteReplacement(env.toString()));
renderResult = renderResult.replaceAll(EMAIL_CONTENT_FIELD_CLUSTER, Matcher.quoteReplacement(releaseHistory.getClusterName()));
renderResult = renderResult.replaceAll(EMAIL_CONTENT_FIELD_NAMESPACE, Matcher.quoteReplacement(releaseHistory.getNamespaceName()));
renderResult = renderResult.replaceAll(EMAIL_CONTENT_FIELD_OPERATOR, Matcher.quoteReplacement(releaseHistory.getOperator()));
renderResult = renderResult.replaceAll(EMAIL_CONTENT_FIELD_RELEASE_TITLE, Matcher.quoteReplacement(releaseHistory.getReleaseTitle()));
renderResult =
renderResult.replaceAll(EMAIL_CONTENT_FIELD_RELEASE_ID, String.valueOf(releaseHistory.getReleaseId()));
renderResult =
renderResult.replaceAll(EMAIL_CONTENT_FIELD_RELEASE_HISTORY_ID, String.valueOf(releaseHistory.getId()));
renderResult = renderResult.replaceAll(EMAIL_CONTENT_FIELD_RELEASE_COMMENT, Matcher.quoteReplacement(releaseHistory.getReleaseComment() == null ? "" : releaseHistory.getReleaseComment()));
renderResult = renderResult.replaceAll(EMAIL_CONTENT_FIELD_APOLLO_SERVER_ADDRESS, getApolloPortalAddress());
return renderResult
.replaceAll(EMAIL_CONTENT_FIELD_RELEASE_TIME, dateFormat.format(releaseHistory.getReleaseTime()));
}
private String renderDiffModule(String bodyTemplate, Env env, ReleaseHistoryBO releaseHistory) {
String appId = releaseHistory.getAppId();
String namespaceName = releaseHistory.getNamespaceName();
AppNamespace appNamespace = appNamespaceService.findByAppIdAndName(appId, namespaceName);
if (appNamespace == null) {
appNamespace = appNamespaceService.findPublicAppNamespace(namespaceName);
}
//don't show diff content if namespace's format is file
if (appNamespace == null ||
!appNamespace.getFormat().equals(ConfigFileFormat.Properties.getValue())) {
return bodyTemplate.replaceAll(EMAIL_CONTENT_DIFF_MODULE, "<br><h4>Apollo</h4>");
}
ReleaseCompareResult result = getReleaseCompareResult(env, releaseHistory);
if (!result.hasContent()) {
return bodyTemplate.replaceAll(EMAIL_CONTENT_DIFF_MODULE, "<br><h4></h4>");
}
List<Change> changes = result.getChanges();
StringBuilder changesHtmlBuilder = new StringBuilder();
for (Change change : changes) {
String key = change.getEntity().getFirstEntity().getKey();
String oldValue = change.getEntity().getFirstEntity().getValue();
String newValue = change.getEntity().getSecondEntity().getValue();
newValue = newValue == null ? "" : newValue;
changesHtmlBuilder.append("<tr>");
changesHtmlBuilder.append("<td width=\"10%\">").append(change.getType().toString()).append("</td>");
changesHtmlBuilder.append("<td width=\"20%\">").append(cutOffString(key)).append("</td>");
changesHtmlBuilder.append("<td width=\"35%\">").append(cutOffString(oldValue)).append("</td>");
changesHtmlBuilder.append("<td width=\"35%\">").append(cutOffString(newValue)).append("</td>");
changesHtmlBuilder.append("</tr>");
}
String diffContent = Matcher.quoteReplacement(changesHtmlBuilder.toString());
String diffModuleTemplate = getDiffModuleTemplate();
String diffModuleRenderResult = diffModuleTemplate.replaceAll(EMAIL_CONTENT_FIELD_DIFF_CONTENT, diffContent);
return bodyTemplate.replaceAll(EMAIL_CONTENT_DIFF_MODULE, diffModuleRenderResult);
}
private ReleaseCompareResult getReleaseCompareResult(Env env, ReleaseHistoryBO releaseHistory) {
if (releaseHistory.getOperation() == ReleaseOperation.GRAY_RELEASE
&& releaseHistory.getPreviousReleaseId() == 0) {
ReleaseDTO masterLatestActiveRelease = releaseService.loadLatestRelease(
releaseHistory.getAppId(), env, releaseHistory.getClusterName(), releaseHistory.getNamespaceName());
ReleaseDTO branchLatestActiveRelease = releaseService.findReleaseById(env, releaseHistory.getReleaseId());
return releaseService.compare(masterLatestActiveRelease, branchLatestActiveRelease);
}
return releaseService.compare(env, releaseHistory.getPreviousReleaseId(), releaseHistory.getReleaseId());
}
private List<String> recipients(String appId, String namespaceName, String env) {
Set<UserInfo> modifyRoleUsers =
rolePermissionService
.queryUsersWithRole(RoleUtils.buildNamespaceRoleName(appId, namespaceName, RoleType.MODIFY_NAMESPACE));
Set<UserInfo> envModifyRoleUsers =
rolePermissionService
.queryUsersWithRole(RoleUtils.buildNamespaceRoleName(appId, namespaceName, RoleType.MODIFY_NAMESPACE, env));
Set<UserInfo> releaseRoleUsers =
rolePermissionService
.queryUsersWithRole(RoleUtils.buildNamespaceRoleName(appId, namespaceName, RoleType.RELEASE_NAMESPACE));
Set<UserInfo> envReleaseRoleUsers =
rolePermissionService
.queryUsersWithRole(RoleUtils.buildNamespaceRoleName(appId, namespaceName, RoleType.RELEASE_NAMESPACE, env));
Set<UserInfo> owners = rolePermissionService.queryUsersWithRole(RoleUtils.buildAppMasterRoleName(appId));
Set<String> userIds = new HashSet<>(modifyRoleUsers.size() + releaseRoleUsers.size() + owners.size());
for (UserInfo userInfo : modifyRoleUsers) {
userIds.add(userInfo.getUserId());
}
for (UserInfo userInfo : envModifyRoleUsers) {
userIds.add(userInfo.getUserId());
}
for (UserInfo userInfo : releaseRoleUsers) {
userIds.add(userInfo.getUserId());
}
for (UserInfo userInfo : envReleaseRoleUsers) {
userIds.add(userInfo.getUserId());
}
for (UserInfo userInfo : owners) {
userIds.add(userInfo.getUserId());
}
List<UserInfo> userInfos = userService.findByUserIds(Lists.newArrayList(userIds));
if (CollectionUtils.isEmpty(userInfos)) {
return Collections.emptyList();
}
List<String> recipients = new ArrayList<>(userInfos.size());
for (UserInfo userInfo : userInfos) {
recipients.add(userInfo.getEmail());
}
return recipients;
}
protected String getApolloPortalAddress() {
return portalConfig.portalAddress();
}
private String cutOffString(String source) {
if (source.length() > VALUE_MAX_LENGTH) {
return source.substring(0, VALUE_MAX_LENGTH) + "...";
}
return source;
}
}
```
|
Tangible symbols are a type of augmentative and alternative communication (AAC) that uses objects or pictures that share a perceptual relationship with the items they represent as symbols. A tangible symbol's relation to the item it represents is perceptually obvious and concrete – the visual or tactile properties of the symbol resemble the intended item. Tangible Symbols can easily be manipulated and are most strongly associated with the sense of touch. These symbols can be used by individuals who are not able to communicate using speech or other abstract symbol systems, such as sign language. However, for those who have the ability to communicate using speech, learning to use tangible symbols does not hinder further developing acquisition of natural speech and/or language development, and may even facilitate it.
Definition
The term tangible symbols was first developed by Charity Rowland and Philip Schweigert, and refers to two-dimensional pictures or three-dimensional objects used as symbols to convey meaning. The items are termed "tangible" because they are concrete items that can be manipulated by the user and communication partner. Symbols can be used individually or combined with other symbols in order to create new messages. Tangible symbols are used as a means of communication for individuals who are unable to understand or communicate using abstract systems, such as speech or sign language.
Properties of tangible symbols include permanency, capacity to be manipulated by both the user and the communication partner, and an obvious relationship between the symbol and the referent. They can represent items, people, activities and/or events, and look or feel similar to what they refer to. For example, a cup can be used as three-dimensional tangible symbol to represent the action: "drink". A photograph of a cup can be used as a two-dimensional tangible symbol to also represent the action: "drink". Two- and three-dimensional symbols are used to fit the cognitive and sensory abilities of the individual, as well as the individual's unique experiences.
Rowland and Schweigert use the term tangible symbols to refer to conceptually tangible items like two-dimensional pictures or three-dimensional objects. However, other authors, such as Beukelman and Mirenda, use the term to exclusively describe three-dimensional physical objects that display concrete properties such as shape or texture.
According to Rowland and Schweigert, "for some individuals, the use of tangible symbols may be used to bridge the gap between gestural communication and the use of formal language systems. For others, tangible symbols may represent an ultimate level of communicative competence."
History
Historically, objects and pictures have frequently been used as communication devices. Many authors have also used picture symbols, such as line drawings and photographs to develop language in individuals with little or no speech and/or cognitive disabilities. Tangible symbols emerged from Van Dijk’s work in the 1960s using objects as symbols to develop language in deaf-blind children. In turn, Van Dijk’s work was based on the concept "symbol formation" developed by Werner and Kaplan (1963), who theorized that "symbol formation" referred to the process of developing language by creating symbols in our minds.
Types of tangible symbols
Rowland and Schweigert propose that tangible symbols can be divided into hierarchical categories, ranging from most concrete to most abstract symbols:
Identical objects are real items that are equal to their referent and are the most concrete type of tangible symbol. An example includes using a toothbrush to represent "brush your teeth". Beukelman and Mirenda includes in this category miniature objects: items that are smaller than what they symbolize, such as having a small toy toilet indicate "toilet".
Partial/associated objects refers to a portion of the object they represent, and therefore are less concrete than identical objects. For example, a shoelace would symbolize "shoes".
Symbols with one or two shared features have a resemblance to their referent, like using a mould of a loaf of bread for "bread". This category is sometimes included in the partial/associated objects category.
Artificial symbols are abstract symbols that do not have a direct resemblance to their referent, such as having a 3D shape (i.e. an apple) that is attached to a cafe door be used as the symbol for "cafe". Beukelman and Mirenda include textured symbols in this category. An example of a textured symbol is using a piece of spandex material to denote "bathing suit".
Three-dimensional symbols may be identical objects, parts of objects, or associated objects. A three-dimensional symbol will share similar features of the focused object, creating a meaningful symbol.
Two-dimensional pictures, such as photographs and line drawings, are the most abstract type of tangible symbols. They are commonly used for both expressive and receptive communication, whereas the three-dimensional symbols are often used for receptive only communication (i.e. to cue the individual for upcoming events).
The type of tangible symbol used is chosen based on the cognitive and sensory abilities of the learner/user. The meaning behind each symbol is not universal, but by using a symbol the individual is familiar with, a meaningful symbol is created. Tangible symbols should be constructed by meaningful and motivating symbols that will provide the individual with the most opportunities to practice using the new system.
Users of tangible symbols
Individuals who can benefit from using tangible symbols include those who may lack the skills to communicate using verbal speech or other various communication systems such as sign language. Users of tangible symbols may include individuals with cognitive disabilities (including developmental delay and intellectual disability), sensory and/or visual impairments (blindness and/or deafblindness), developmental disabilities (such as autism spectrum disorder), and orthopedic impairments. Rowland and Schweigert claim that tangible symbols do not require the use of high demands on the learner’s cognitive abilities, memory, visual perception, and motor abilities because they are:
Iconic and concrete: they have a clear connection what they refer to.
Permanent: the user does not need to recall the object, but simply be able to recognize them.
Manipulable: can be picked up and used by the learner and who s/he is communicating with.
Tactually discriminable: can be identified by touch.
May be indicated through a simple motor response: such as eye gazing, touching, or pointing.
Furthermore, simple behavioral responses can be used with tangible items. For example, learners that are unable to speak can simply point, touch, pick up, or look (in cases of severe motoric impairment) at the object to answer a question or make a request. Finally, three-dimensional objects can be distinguished from one another using touch, and therefore they are suitable for people with visual impairments or blindness.
A study by Rowland and Schweigert found individuals who were already able to communicate using gestures or vocalizations more readily learned to use tangible symbols than those who did not have intentional pre-symbolic communication skills.
Application of tangible symbols
Presentation format depends on the users visual scanning and motoric ability. The tangible symbols can placed in front of the user within reach, placed on a board for visual scanning, or placed in a book for access.
Typically, tangible symbols are custom made and tailored to the individual child. If pre-made sets are used, it is assumed that the symbols are familiar and motivating for the user. It is important to utilize frequently occurring and highly motivating symbols in order to optimize opportunities for use.
Tangible symbol system offers a manual and DVD as well as an online course. For more information on tangible symbol system instructional strategies, please reference: http://designtolearn.com/products/tangible_symbol_systems
Universal tangible symbol system
In 2009, Ellen Trief, Susan M. Bruce, Paul W. Cascella, and Sarah Ivy created a Universal Tangible Symbol System. They began by developing a survey to determine which tangible symbols were already in use, new activities and concepts for which tangible systems are needed, and participant preferences for tangible symbols from a pilot study. Participants included teachers and speech–language pathologists from four New York City schools. Following the survey, an advisory board consisting of directors of the New York City schools, speech-language pathologists, the designer and manufacturer of the symbols, a representative from the Perkins School for the Blind, college professors, and a graduate research assistant reviewed and discussed the results. This resulted in the establishment of the 55 universal tangible symbols seen in the chart below. However, this universal tangible symbol system should not replace a system already established for an individual.
Notes
References
Beukelman, D.R. & Mirenda, P. (2005). Augmentative and Alternative Communication: Supporting Children and Adults with Complex Communication Needs (3rd edition). Baltimore: Brookes.
Rowland, C., & Schweigert, P. (1996). Tangible Symbol Systems (DVD). Portland, OR: Oregon Health & Science University.
Rowland, C., & Schweigert, P. (2000). Tangible Symbol Systems (2nd Ed.). Portland, OR: Oregon Health & Science University.
Stephenson, J., & Linfoot, K. (1996). Pictures as communication symbols for students with severe intellectual disability. Augmentative and Alternative Communication, 12 (4), 244–256.
Trief, E., Cascella, P.W., & Bruce, S.M. (2013). A field study of a standardized tangible symbol system for learners who are visually impaired and have multiple disabilities. Journal of visual impairment & blindness. May–June 2013, 180–191.
Trief, E., Bruce, S.M., Cascella, P.W., & Ivy S. (2009). The development of a universal tangible symbol system. Journal of visual impairment & blindness. July 2009. 425–431.
Rowland, C., & Schweigert, P. (2000). Tangible systems, tangible outcomes. AAC augmentative and alternative communication. 16. pp. 61–78.
Rowland, C., & Schweigert, P. Tangible symbol systems primer. Design to learn website. pp. 1–20.
Symbols
Communication
Speech and language pathology
Blindness equipment
Augmentative and alternative communication
|
Dempster William Woodworth (May 25, 1844 – November 29, 1922) was an American physician, newspaper editor, and politician.
Born in Windham, Portage County, Ohio, Woodworth was educated in the public schools. He went to Hiram College. In 1868, Woodworth moved to Ellsworth, Wisconsin, where he practiced medicine. He served as examining surgeon for United States pensions from 1872 to 1894. Woodworth was the editor and publisher of the Pierce County Examiner newspaper. In 1894, Woodworth was elected to the Wisconsin State Senate and served until 1901. He was a Republican. Woodworth died in St. Luke's Hospital in Saint Paul, Minnesota from cancer.
Notes
External links
1844 births
1922 deaths
People from Windham, Ohio
Hiram College alumni
Editors of Wisconsin newspapers
Physicians from Wisconsin
Republican Party Wisconsin state senators
Dempster
People from Ellsworth, Wisconsin
|
Olive Beaupré Miller (née Olive Kennon Beaupré) (September 11, 1883 – March 25, 1968) was an American writer, publisher and editor of children's literature. She was born in Aurora, Illinois on September 11, 1883, to William S. and Julia (Brady) Beaupré. She received her B.A. from Smith College in 1904.
The Book House for Children
In 1919 Miller established a company, The Book House for Children, to publish popular children’s literature edited by herself to meet her standards:
"First,--To be well equipped for life, to have ideas and the ability to express them, the child needs a broad background of familiarity with the best in literature.
"Second,--His stories and rhymes must be selected with care that he may absorb no distorted view of life and its actual values, but may grow up to be mentally clear about values and emotionally impelled to seek what is truly desirable and worthwhile in human living.
"Third,--The stories and rhymes selected must be graded to the child's understanding at different periods of his growth, graded as to vocabulary, as to subject matter and as to complexity of structure and plot."
The first volume of The Book House series was published in 1920. The series would eventually include twelve volumes.
Later versions of The Book House contained some short stories (such as Little Black Sambo and The Tar Baby) which were thought to be insensitive, and were removed from the Beaupré canon. But as late as 1950 (33rd printing), “Sambo” was still included.
The company was also remarkable for its large female staff at a time when most women did not work outside the home.
Illustrators for The Book House series included Maude and Miska Petersham, Donn Philip Crane, Hilda Hanway, Milo Winter, and Peter Newell.
Other series published by the company, The Book House for Children, included "My Travelship" and "A Picturesque Tale of Progress." The Book House for Children was sold to United Educators in 1954.
Bibliography
My Book House (6 volumes)
Volume 1, In the Nursery (1920)
Volume 2, Up One Pair of Stairs (1920)
Volume 3, Through Fairy Halls (1920)
Volume 4, The Treasure Chest (1920)
Volume 5, From The Tower Window (1921)
Volume 6, The Latch Key (1921)
My Travelship (3 volumes)
Little Pictures of Japan (1925)
Tales Told in Holland (1926)
Nursery Friends From France (1927)
My Book House (7 volumes – red series)
Volume 1, In the Nursery (1925)
Volume 2, Story Time (1925)
Volume 3, Up One Pair of Stairs (1925)
Volume 4, Over the Hills (1925)
Volume 5, Through Fairy Halls (1925)
Volume 6, The Magic Garden (1925)
Volume 7, The Latch Key with Index (1925)
A Picturesque Tale of Progress (1929)
Beginnings 1 and 2
Conquests 1 and 2
New Nations 1 and 2
Explorations 1 and 2
My Book House (12 volumes – 1932, 1937, 1971)
Each of the original thicker volumes were divided and made more picture-book-like and easier for a child to handle. The style of illustration and text were changed as well from the original 1920s edition.
Volume 1, In the Nursery
Volume 2, Story Time
Volume 3, Up One Pair of Stairs
Volume 4, Through the Gate
Volume 5, Over The Hills
Volume 6, Through Fairy Halls
Volume 7, The Magic Garden
Volume 8, Flying Sails
Volume 9, The Treasure Chest
Volume 10, From the Tower Window
Volume 11, In Shining Armor
Volume 12, Halls of Fame
Other publishers
Engines and Brass Bands"Waubonsie Tales (Chicago: Book House, NY: Doubleday, Doran, 1933),
Heroes, Outlaws and Funny Fellows of American Popular Tales, by Miller, illustrated by Richard Bennett (Doubleday, Doran, 1939),
Heroes of the Bible, by Miller, illus. Mariel Wilhoite (NY: Standard Book, 1940), ; later
References
External links
Olive Beaupré Miller papers at the Sophia Smith Collection, Smith College Special Collections
Olive Beaupre Miller at the Winnetka Historical Society
My Book House cover illustrations from Childscapes.com
Fox Valley Arts Hall of Fame 2022 Inductee
1883 births
1968 deaths
American book editors
American book publishers (people)
American women writers
Smith College alumni
People from Aurora, Illinois
|
(Yusufu) Quanti Bomani (born May 26, 1956), is an American jazz musician and multi-instrumentalist, composer, lyricist, and the leader of the band Urban Insight Group. His primary instrument is the saxophone (tenor, soprano, alto, and baritone). He is also a member of Prodigal Posse, an Eastern Caribbean diaspora band in Dominica that performs worldwide. He is the son of son of Luqman Abdul-Malik and Nana Bomani.
Career
Early years
Born and educated in Harlem and Queens bouroughs of New York City, he received his college education in Virginia. He was influenced by his mother to play jazz and later in his life embraced the Afro-Caribbean influence and sound.
Musical influences
Bomani was influenced to play saxophone by British saxophonist Gary Windo in New York. Early in his career, Bomani was a saxophonist with Maurice Miller, playing straight-ahead jazz. In the 1980s he performed with Ahmed Abdul-Malik's East meets West ensemble. He has performed at the World Creole Music Festival and Creole in the Park with Delmance "Ras Mo" Moses and the Mo n' Mo Music Project. Quanti Bomani with Urban Insight Group has performed throughout the U.S. and in international venues. His trip to India in 2005 and to Vietnam influenced his 2011 album Africans on the Rooftop.
Political activism
His song "Candy Bar" criticizes war and its impact on individuals, children, and families. His song "Don't Let Nobody Put the Big Britches on You" is about media deception and war propaganda. The song "We're Falling" decries drug violence and violence used for profit of natural resources. His concerts contain much political commentary. He participated in the 2010 fundraiser sponsored by the California Jazz Foundation to raise money for a musician health care fund. In 2012, he was one of the main acts at the Children's Heart Fund benefit concert at the Old Mill Cultural Center in Dominica with Arturo Tappin and Ronald "Boo" Hinkson.
Music and performing
Bomani released his album View of the World (2005), which was recorded and produced at Bay Bridge Music, an affiliate of Bay Bridge Records. His album debuted at the Paramount Theater (Oakland, California). His subsequent concerts included performances at San Francisco's Great American Music Hall, Yoshi's (jazz club), and Velma's Jazz n' Blues Club.
In 2013, Bomani performed with Michele Henderson at the Jazz n' Creole Festival in Fort Shirley, Cabrits, Dominica after performing together in Rodney Bay during the St. Lucia Jazz Festival.
References
1956 births
Living people
21st-century American male musicians
21st-century American saxophonists
African-American jazz musicians
American jazz composers
American jazz saxophonists
American male saxophonists
American male jazz composers
21st-century African-American musicians
20th-century African-American people
|
```objective-c
/*
* Based on John the Ripper and modified to integrate with aircrack
*
* John the Ripper copyright and license.
*
* John the Ripper password cracker,
*
* This program is free software; you can redistribute it and/or modify
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
*
* permission is hereby granted to link the code of this program, with or
* without modification, with any version of the OpenSSL library and/or any
* version of unRAR, and to distribute such linked combinations. You must
* obey the GNU GPL in all respects for all of the code used other than
* OpenSSL and unRAR. If you modify this program, you may extend this
* exception to your version of the program, but you are not obligated to
* do so. (In other words, you may release your derived work under pure
* GNU GPL version 2 or later as published by the FSF.)
*
* (This exception from the GNU GPL is not required for the core tree of
* John the Ripper, but arguably it is required for -jumbo.)
*
* Relaxed terms for certain components.
*
* In addition or alternatively to the license above, many components are
* available to you under more relaxed terms (most commonly under cut-down
* BSD license) as specified in the corresponding source files.
*
* For more information on John the Ripper licensing please visit:
*
* path_to_url
*
* This header file should be the LAST header file included within every
* .c file within the project. If there are .h files that have actual
* code in them, then this header should be the last include within that
* .h file, and that .h file should be the last one included within the
* .c file.
* ****** NOTE *****
*/
#if !defined (__MEM_DBG_H_)
#define __MEM_DBG_H_
// values to use within the MemDbg_Validate() function.
#define MEMDBG_VALIDATE_MIN 0
#define MEMDBG_VALIDATE_DEEP 1
#define MEMDBG_VALIDATE_DEEPER 2
#define MEMDBG_VALIDATE_DEEPEST 3
#include <stdio.h>
#include <stdlib.h>
#if (!AC_BUILT || HAVE_UNISTD_H) && !_MSC_VER
#include <unistd.h>
#endif
#include <string.h>
#if defined (MEMDBG_ON)
/*
* This software was written by Jim Fougeron jfoug AT cox dot net
* in 2013. No copyright is claimed, and the software is hereby
* placed in the public domain. In case this attempt to disclaim
* copyright and place the software in the public domain is deemed
* and it is hereby released to the general public under the following
* terms:
*
* This software may be modified, redistributed, and used for any
* purpose, in source and binary forms, with or without modification.
*/
/*
* memdbg.h
* Memory management debugging (at runtime)
*
* memdbg contains routines detect, and report memory
* problems, such as double frees, passing bad pointers to
* free, most buffer overwrites. Also, tracking of non-freed
* data, showing memory leaks, can also be shown.
*
* Compilation Options (provided from Makefile CFLAGS)
*
* MEMDBG_ON If this is NOT defined, then memdbg will
* get out of your way, and most normal memory functions
* will be called with no overhead at all.
*/
/* these functions can be called by client code. Normally Memdbg_Used() and
* MemDbg_Display() would be called at program exit. That will dump a list
* of any memory that was not released. The MemDbg_Validate() can be called
* pretty much any time. That function will walk the memory allocation linked
* lists, and sqwack if there are problems, such as overwrites, freed memory that
* has been written to, etc. It would likely be good to call MemDbg_Validate()
* within benchmarking, after every format is tested.
*
* TODO: Add a handle that can be passed to the MemDbg_Used() and MemDbg_Display()
* and a function to get the 'current' state of memory as a handle. Thus, a
* format self test could get a handle BEFORE starting, and then check after, and
* ONLY show leaked memory from the time the handle was obtained, which was at the
* start of the self test. Thus it would only show leaks from that format test.
*
* These functions are NOT thread safe. Do not call them within OMP blocks of code.
* Normally, these would be called at program exit, or within things like format
* self test code, etc, and not within OMP. But this warning is here, so that
* it is known NOT to call within OMP.
*/
extern size_t MemDbg_Used(int show_freed);
extern void MemDbg_Display(FILE *);
extern void MemDbg_Validate(int level);
extern void MemDbg_Validate_msg(int level, const char *pMsg);
extern void MemDbg_Validate_msg2(int level, const char *pMsg, int bShowExData);
/* these functions should almost NEVER be called by any client code. They
* are listed here, because the macros need to know their names. Client code
* should almost ALWAYS call malloc() like normal, vs calling MEMDBG_alloc()
* If MEMDBG_alloc() was called, and MEMDBG_ON was not defined, then this
* function would not be declared here, AND at link time, the function would
* not be found.
* NOTE, these functions should be thread safe in OMP builds (using #pragma omp atomic)
* also note, memory allocation within OMP blocks SHOULD be avoided if possible. It is
* very slow, and the thread safety required makes it even slow. This is not only talking
* about these functions here, BUT malloc/free in general in OMP blocks. AVOID doing that
* at almost all costs, and performance will usually go up.
*/
extern void *MEMDBG_alloc(size_t, char *, int);
extern void *MEMDBG_realloc(const void *, size_t, char *, int);
extern void MEMDBG_free(const void *, char *, int);
extern char *MEMDBG_strdup(const char *, char *, int);
#if !defined(__MEMDBG__)
/* we get here on every file compiled EXCEPT memdbg.c */
#undef malloc
#undef realloc
#undef free
#undef strdup
#undef libc_free
#undef libc_calloc
#undef libc_malloc
#define libc_free(a) do {if(a) MEMDBG_libc_free(a); a=0; } while(0)
#define libc_malloc(a) MEMDBG_libc_alloc(a)
#define libc_calloc(a) MEMDBG_libc_calloc(a)
#define malloc(a) MEMDBG_alloc((a),__FILE__,__LINE__)
#define calloc(a) MEMDBG_calloc((a),__FILE__,__LINE__)
#define realloc(a,b) MEMDBG_realloc((a),(b),__FILE__,__LINE__)
/* this code mimicks JtR's FREE_MEM(a) but does it for any MEMDBG_free(a,F,L) call (a hooked free(a) call) */
#define free(a) do { if (a) MEMDBG_free((a),__FILE__,__LINE__); a=0; } while(0)
#define strdup(a) MEMDBG_strdup((a),__FILE__,__LINE__)
#endif
/* pass the file handle to write to (normally stderr) */
#define MEMDBG_PROGRAM_EXIT_CHECKS(a) do { \
if (MemDbg_Used(0) > 0) MemDbg_Display(a); \
MemDbg_Validate_msg2(MEMDBG_VALIDATE_DEEPEST, "At Program Exit", 1); } while(0)
typedef struct MEMDBG_HANDLE_t {
unsigned id;
unsigned alloc_cnt;
size_t mem_size;
} MEMDBG_HANDLE;
/*
* these functions allow taking a memory snapshot, calling some code, then validating that memory
* is the same after the code. This will help catch memory leaks and other such problems, within
* formats and such. Simply get the snapshot, run self tests (or other), when it exits, check
* the snapshot to make sure nothing leaked.
*/
/* returning a struct (or passing as params it not super efficient but this is done so infrequently that this is not an issue. */
MEMDBG_HANDLE MEMDBG_getSnapshot(int id);
/* will not exit on leaks. Does exit, on memory overwrite corruption. */
void MEMDBG_checkSnapshot(MEMDBG_HANDLE);
/* same as MEMDBG_checkSnapshot() but if exit_on_any_leaks is true, will also exit if leaks found. */
void MEMDBG_checkSnapshot_possible_exit_on_error(MEMDBG_HANDLE, int exit_on_any_leaks);
/*
* the allocations from mem_alloc_tiny() must call this function to flag the memory they allocate
* so it is not flagged as a leak, by these HANDLE snapshot functions. 'tiny' memory is expected
* to leak, until program exit. At that time, any that was not freed, will be shown as leaked.
* THIS function is also thread safe. The other checkSnapshot functions are NOT thread safe.
*/
void MEMDBG_tag_mem_from_alloc_tiny(void *);
#else
/* NOTE, we DO keep one special function here. We make free a little
* smarter. this function gets used, even when we do NOT compile with
* any memory debugging on. This makes free work more like C++ delete,
* in that it is valid to call it on a NULL. Also, it sets the pointer
* to NULL, so that we can call free(x) on x multiple times, without
* causing a crash. NOTE, the multiple frees SHOULD be caught when
* someone builds and runs with MEMDBG_ON. But when it is off, we do
* try to protect the program.
*/
#undef libc_free
#undef libc_calloc
#undef libc_malloc
#define libc_free(a) do {if(a) MEMDBG_libc_free(a); a=0; } while(0)
#define libc_malloc(a) MEMDBG_libc_alloc(a)
#define libc_calloc(a) MEMDBG_libc_calloc(a)
#if !defined(__MEMDBG__)
/* this code mimicks JtR's FREE_MEM(a) but does it for any normal free(a) call */
//extern void MEMDBG_off_free(void *a);
//#define free(a) do { if(a) MEMDBG_off_free(a); a=0; } while(0)
#endif
#define MemDbg_Used(a) 0
#define MemDbg_Display(a)
#define MemDbg_Validate(a)
#define MemDbg_Validate_msg(a,b)
#define MemDbg_Validate_msg2(a,b,c)
#define MEMDBG_PROGRAM_EXIT_CHECKS(a)
#define MEMDBG_tag_mem_from_alloc_tiny(a)
#define MEMDBG_HANDLE int
#define MEMDBG_getSnapshot(a) 0
#define MEMDBG_checkSnapshot(a) if(a) printf(" \b")
#define MEMDBG_checkSnapshot_possible_exit_on_error(a, b) if(a) printf(" \b")
#endif /* MEMDBG_ON */
extern void MEMDBG_libc_free(void *);
extern void *MEMDBG_libc_alloc(size_t size);
extern void *MEMDBG_libc_calloc(size_t size);
#endif /* __MEMDBG_H_ */
```
|
Gary S. Lawson is an American lawyer whose focus is in administrative law, constitutional law, legal history, and jurisprudence. He was a law clerk for Judge Antonin Scalia of the United States Court of Appeals for the District of Columbia from 1985–86 and clerked for Scalia again during his 1986-87 term on the United States Supreme Court. He is currently the Philip S. Beck Professor of Law at Boston University School of Law. He previously taught at the Northwestern University Pritzker School of Law. He is the secretary of the board of directors of the Federalist Society. With Steven G. Calabresi, he has argued that the Mueller Probe was "unlawful."
Selected works
References
Living people
Claremont McKenna College alumni
Yale Law School alumni
Northwestern University Pritzker School of Law faculty
Boston University School of Law faculty
20th-century American lawyers
21st-century American lawyers
1958 births
|
Stachyacanthus is a monotypic genus of flowering plants belonging to the family Acanthaceae. The only species is Stachyacanthus riedelianus.
The species is found in Western Central Brazil.
References
Acanthaceae
Acanthaceae genera
Monotypic Lamiales genera
|
There are 57 species of birds that have been recorded on Niue, of which one has been introduced by humans. Two species are globally threatened. Niue is an island country in the South Pacific, 2,400 kilometres (1,500 mi) northeast of New Zealand.
There are no endemic species surviving today but there are endemic subspecies of the Polynesian triller and Polynesian starling. There are 15 breeding species of which eleven are landbirds and four are seabirds. Studies of fossil birds suggest that Niue's avifauna was formerly more diverse. Birds recorded from subfossil remains predating Polynesian settlement of the island include the Niue night heron (Nycticorax kalavikai), Tongan megapode (Megapodius pritchardii) and the Niue rail (Gallirallus huiatua).
This list's taxonomic treatment (designation and sequence of orders, families and species) and nomenclature (common and scientific names) follow the conventions of The Clements Checklist of Birds of the World, 2022 edition. The family accounts at the beginning of each heading reflect this taxonomy, as do the species counts found in each family account. Introduced and accidental species are included in the total counts for Niue. There are unconfirmed reports of the red-tailed tropicbird (Phaethon rubricauda), Pacific black duck (Anas superciliosa) and sharp-tailed sandpiper (Calidris acuminata) but these are not included in the list.
The following tags have been used to highlight several categories, but not all species fall into one of these categories. Those that do not are commonly occurring native species.
(A) Accidental – a species that rarely or accidentally occurs in Niue
(I) Introduced – a species introduced to Niue as a consequence, direct or indirect, of human actions
Ducks, geese, and waterfowl
Order: AnseriformesFamily: Anatidae
The family Anatidae includes the ducks and most duck-like waterfowl, such as geese and swans. These are adapted for an aquatic existence, with webbed feet, bills that are flattened to a greater or lesser extent, and feathers that are excellent at shedding water due to special oils.
Pacific black duck, Anas superciliosa (A)
Mallard, Anas platyrhynchos (A)
Pheasants, grouse, and allies
Order: GalliformesFamily: Phasianidae
The Phasianidae are a family of terrestrial birds which consists of quails, partridges, snowcocks, francolins, spurfowls, tragopans, monals, pheasants, peafowls and jungle fowls. In general, they are plump (although they vary in size) and have broad, relatively short wings.
Red junglefowl, Gallus gallus (I)
Pigeons and doves
Order: ColumbiformesFamily: Columbidae
Pigeons and doves are stout-bodied birds with short necks and short slender bills with a fleshy cere.
Many-colored fruit dove, Ptilinopus perousii
Crimson-crowned fruit dove, Ptilinopus porphyraceus
Pacific imperial-pigeon, Ducula pacifica
Cuckoos
Order: CuculiformesFamily: Cuculidae
The family Cuculidae includes cuckoos, roadrunners and anis. These birds are of variable size with slender bodies, long tails and strong legs. The Old World cuckoos are brood parasites.
Long-tailed koel, Eudynamys taitensis
Swifts
Order: CaprimulgiformesFamily: Apodidae
Swifts are small birds which spend the majority of their lives flying. These birds have very short legs and never settle voluntarily on the ground, perching instead only on vertical surfaces. Many swifts have long swept-back wings which resemble a crescent or boomerang.
White-rumped swiftlet, Aerodramus spodiopygius
Australian swiftlet, Aerodramus terraereginae
Rails, gallinules, and coots
Order: GruiformesFamily: Rallidae
Rallidae is a large family of small to medium-sized birds which includes the rails, crakes, coots and gallinules. Typically they inhabit dense vegetation in damp environments near lakes, swamps or rivers. In general they are shy and secretive birds, making them difficult to observe. Most species have strong legs and long toes which are well adapted to soft uneven surfaces. They tend to have short, rounded wings and to be weak fliers.
Buff-banded rail, Gallirallus philippensis
Australasian swamphen, Porphyrio melanotus (A)
Spotless crake, Zapornia tabuensis
Plovers and lapwings
Order: CharadriiformesFamily: Charadriidae
The family Charadriidae includes the plovers, dotterels and lapwings. They are small to medium-sized birds with compact bodies, short, thick necks and long, usually pointed, wings. They are found in open country worldwide, mostly in habitats near water.
Pacific golden-plover, Pluvialis fulva
Sandpipers and allies
Order: CharadriiformesFamily: Scolopacidae
Scolopacidae is a large diverse family of small to medium-sized shorebirds including the sandpipers, curlews, godwits, shanks, tattlers, woodcocks, snipes, dowitchers and phalaropes. The majority of these species eat small invertebrates picked out of the mud or soil. Variation in length of legs and bills enables multiple species to feed in the same habitat, particularly on the coast, without direct competition for food.
Bristle-thighed curlew, Numenius tahitiensis (A)
Far Eastern curlew, Numenius madagascariensis (A)
Eurasian curlew, Numenius arquata (A)
Bar-tailed godwit, Limosa lapponica (A)
Ruddy turnstone, Arenaria interpres
Sanderling, Calidris alba
Pectoral sandpiper, Calidris melanotos (A)
Wandering tattler, Tringa incana
Gulls, terns, and skimmers
Order: CharadriiformesFamily: Laridae
Laridae is a family of medium to large seabirds, the gulls, terns, and skimmers. Gulls are typically grey or white, often with black markings on the head or wings. They have stout, longish bills and webbed feet. Terns are a group of generally medium to large seabirds typically with grey or white plumage, often with black markings on the head. Most terns hunt fish by diving but some pick insects off the surface of fresh water. Terns are generally long-lived birds, with several species known to live in excess of 30 years.
Kelp gull, Larus dominicanus (A)
Brown noddy, Anous stolidus
Black noddy, Anous minutus
Blue-gray noddy, Anous ceruleus
White tern, Gygis alba
Black-naped tern, Sterna sumatrana
Great crested tern, Thalasseus bergii
Tropicbirds
Order: PhaethontiformesFamily: Phaethontidae
Tropicbirds are slender white birds of tropical oceans, with exceptionally long central tail feathers. Their heads and long wings have black markings.
White-tailed tropicbird, Phaethon lepturus
Southern storm-petrels
Order: ProcellariiformesFamily: Oceanitidae
The southern storm-petrels are the smallest seabirds, relatives of the petrels, feeding on planktonic crustaceans and small fish picked from the surface, typically while hovering. Their flight is fluttering and sometimes bat-like.
White-bellied storm-petrel, Fregetta grallaria
Polynesian storm-petrel, Nesofregetta fuliginosa
Shearwaters and petrels
Order: ProcellariiformesFamily: Procellariidae
The procellariids are the main group of medium-sized "true petrels", characterised by united nostrils with medium septum and a long outer functional primary.
Southern giant-petrel, Macronectes giganteus (A)
Kermadec petrel, Pterodroma neglecta
Herald petrel, Pterodroma heraldica
Mottled petrel, Pterodroma inexpectata
White-necked petrel, Pterodroma cervicalis
Black-winged petrel, Pterodroma nigripennis
Collared petrel, Pterodroma brevipes
Phoenix petrel, Pterodroma alba
Tahiti petrel, Pseudobulweria rostrata
Wedge-tailed shearwater, Ardenna pacificus
Buller's shearwater, Ardenna bulleri
Sooty shearwater, Ardenna grisea
Short-tailed shearwater, Ardenna tenuirostris
Tropical shearwater, Puffinus bailloni
Frigatebirds
Order: SuliformesFamily: Fregatidae
Frigatebirds are large seabirds usually found over tropical oceans. They are large, black and white or completely black, with long wings and deeply forked tails. The males have coloured inflatable throat pouches. They do not swim or walk and cannot take off from a flat surface. Having the largest wingspan-to-body-weight ratio of any bird, they are essentially aerial, able to stay aloft for more than a week.
Lesser frigatebird, Fregata ariel
Great frigatebird, Fregata minor (A)
Boobies and gannets
Order: SuliformesFamily: Sulidae
The sulids comprise the gannets and boobies. Both groups are medium-large coastal seabirds that plunge-dive for fish.
Masked booby, Sula dactylatra (A)
Brown booby, Sula leucogaster
Herons, egrets, and bitterns
Order: PelecaniformesFamily: Ardeidae
The family Ardeidae contains the bitterns, herons, and egrets. Herons and egrets are medium to large wading birds with long necks and legs. Bitterns tend to be shorter necked and more wary. Members of Ardeidae fly with their necks retracted, unlike other long-necked birds such as storks, ibises and spoonbills.
White-faced heron, Egretta novaehollandiae (A)
Pacific reef-heron, Egretta sacra (A)
Barn-owls
Order: StrigiformesFamily: Tytonidae
Barn-owls are medium to large owls with large heads and characteristic heart-shaped faces. They have long strong legs with powerful talons.
Barn owl, Tyto alba
Old World parrots
Order: PsittaciformesFamily: Psittaculidae
Blue-crowned lorikeet, Vini australis
Cuckooshrikes
Order: PasseriformesFamily: Campephagidae
The cuckooshrikes are small to medium-sized passerine birds. They are predominantly greyish with white and black, although some species are brightly coloured.
Polynesian triller, Lalage maculosa
Bulbuls
Order: PasseriformesFamily: Pycnonotidae
Bulbuls are medium-sized songbirds. Some are colourful with yellow, red or orange vents, cheeks, throats or supercilia, but most are drab, with uniform olive-brown to black plumage. Some species have distinct crests.
Red-vented bulbul, Pycnonotus cafer (A)
Starlings
Order: PasseriformesFamily: Sturnidae
Starlings are small to medium-sized passerine birds. Their flight is strong and direct and they are very gregarious. Their preferred habitat is fairly open country. They eat insects and fruit. Plumage is typically dark with a metallic sheen.
Polynesian starling, Aplonis tabuensis
See also
List of birds
Lists of birds by region
References
Niue
Lists of biota of Niue
|
Aalsum () is a small hamlet in the Dutch province of Groningen. It is located in the municipality of Westerkwartier, about 1.5 km west of Oldehove.
The hamlet was located on a wierde, an artificial dwelling hill. The hill was partially excavated in the 20th century; a bow from the ninth century was found. Plans to reconstruct the hill were canceled.
According to the 19th-century historian A.J. van der Aa, Aalsum had 80 inhabitants in the middle of the 19th century; presumably, this includes the surrounding countryside.
Gallery
References
External links
Populated places in Groningen (province)
Westerkwartier (municipality)
Westerkwartier
|
```xml
import { ThunkAction } from 'redux-thunk';
import { ActionType, PayloadAction } from 'typesafe-actions';
import makeResetableAsyncAction from './makeResetableAsyncAction';
import { IResetableAsyncAction, GetActionCreatorPayload } from './types';
export type IThunkActionWithResetableAsyncAction<
State,
Deps,
T extends IResetableAsyncAction<any, any, any, any>
> = ((
payload: GetActionCreatorPayload<T['request']>
) => ThunkAction<void, State, Deps, ActionType<T>>) &
T;
export default function makeCommunicationThunk<
State,
Deps,
RequestT extends string,
SuccessT extends string,
FailureT extends string,
ResetT extends string
>(
requestType: RequestT,
successType: SuccessT,
failureType: FailureT,
resetType: ResetT
) {
return <
RequestPayload,
SuccessPayload,
FailurePayload,
ResetPayload = undefined
>(
f: (
communicationActionCreators: IResetableAsyncAction<
PayloadAction<RequestT, RequestPayload>,
PayloadAction<SuccessT, SuccessPayload>,
PayloadAction<FailureT, FailurePayload>,
PayloadAction<ResetT, undefined>
>
) => (payload: RequestPayload) => ThunkAction<void, State, Deps, any>
): IThunkActionWithResetableAsyncAction<
State,
Deps,
IResetableAsyncAction<
PayloadAction<RequestT, RequestPayload>,
PayloadAction<SuccessT, SuccessPayload>,
PayloadAction<FailureT, FailurePayload>,
PayloadAction<ResetT, ResetPayload>
>
> => {
const resetableAsyncAction = makeResetableAsyncAction(
requestType,
successType,
failureType,
resetType
)<RequestPayload, SuccessPayload, FailurePayload>();
const res: IThunkActionWithResetableAsyncAction<
State,
Deps,
IResetableAsyncAction<
PayloadAction<RequestT, RequestPayload>,
PayloadAction<SuccessT, SuccessPayload>,
PayloadAction<FailureT, FailurePayload>,
PayloadAction<ResetT, ResetPayload>
>
> = f(resetableAsyncAction as any) as any;
res.request = resetableAsyncAction.request;
res.success = resetableAsyncAction.success;
res.failure = resetableAsyncAction.failure;
res.reset = resetableAsyncAction.reset as any;
return res as any;
};
}
```
|
John "Johnny" Coppin (born 5 April 1946) is an English singer-songwriter, composer, poetry anthologist and broadcaster. He plays guitar and piano and has written and recorded many albums as a solo artist. He has a weekly one-hour show on BBC Radio Gloucestershire entitled, Folk Roots, which he has produced and presented every week since 1996. Coppin has been the Musical Director for the Festival Players since 1992.
Early years
He was born in Woodford, Essex, England. Coppin formed his first band, The Shifters, with cousin Martin Wright on bass, Neil Dunwoody on guitar, and Howard Jones on drums in 1959. Their first public performance was at the United Reformed Church Hall in Woodford Green. Eddie Broadbridge joined band as lead singer and they renamed themselves as Eddie and the Shifters. In 1966, while studying architecture at the Gloucestershire College of Art in Cheltenham, he formed Love to Mother with Al Fenn on guitar, Tom Bennison on bass and Mike Ketskemety on drums.
Decameron
Coppin first came to prominence as one of the founding members of Decameron. The band was originally formed as a duo with Dave Bell (vocals, guitar, bass guitar, percussion) in 1968 and Coppin and Bell wrote most of Decameron's songs throughout their existence. Decameron became a four piece in 1969 with the addition of former Love to Mother bandmate Fenn (vocals, guitar, mandoline) and Geoff March (vocals, cello, fiddle, keyboards) the following year.
When Coppin, Fenn and March graduated from university, Decameron went fully professional and were signed by the Fingimigig Agency run by Jasper Carrott and John Starkey. After much touring, the band recorded their first album Say Hello to the Band in 1973. The same year Dik Cadbury (vocals, bass guitar, 12 string guitar) joined to complete the classic line-up. They also appeared on rare occasions using their alter-egos, The Magnificent Mercury Brothers, playing mostly covers of Beach Boys and Jan and Dean songs, featuring the rich vocal harmonies that Decameron were famous for.
Over the next three years, Decameron released one album per year and toured extensively. Due to a lack of sufficient commercial success the band decided to call it a day, and their final gig was in Southsea on 4 July 1976. Since then they have reformed for occasional one-off reunion gigs, usually with Mick Candler on drums, and recorded a live album, Afterwords, in 2001 in benefit of Coppin's wife, Gillian, who died from ovarian cancer just a few months later.
Solo
Coppin formed his own band in 1977 with Phil Beer (guitar, fiddle, vocals), Steve Hutt (bass, vocals), Candler (drums) and Tony Bennett (guitar, vocals). With these musicians he collaborated with Nigel Mazlyn Jones on his 1976 Ship To Shore and 1979 Sentinel albums. Coppin's first album was a solo effort, Roll On Dreamer (1978).
In December 1978 and between December 1979 and January 1980, Coppin was the musical director for Joseph and the Amazing Technicolor Dreamcoat at the Everyman Theatre in Cheltenham. Anthony Head played Joseph and also made contributions to Coppin's second album, No Going Back, which was a band effort.
After three albums of original songs, Coppin found a rich vein of material when he decided to set poems written by famous Gloucestershire authors to music. His first effort, The Roads Go Down, had been included on his first solo album. Coppin's first full album of Gloucestershire poems set to music, Forest and Vale and High Blue Hill, was premiered at the 1983 Cheltenham Literary Festival. Coppin has chosen poems from writers such as Ivor Gurney, F. W. Harvey, Eva Dobell, and Frank Mansell. Perhaps the most famous poet whose work Coppin has set to music is Laurie Lee, and they collaborated on the album, Edge of Day.
Coppin's subsequent work has included completely original work as well as further albums based on the Gloucestershire theme. Most albums have at least one song where Coppin has taken lyrical content and added his musical interpretation.
His television appearances include his own programme Song of Gloucestershire for the BBC, Stars in a Dark Night for Channel 4, and Music Writers on TV for HTV, while his radio work includes Kaleidoscope for Radio 4, West Country Christmas, the Arts Programme and Folk on Two for Radio 2, as well as many appearances on British local radio shows.
His music for theatre includes Songs on Lonely Roads (the story of composer/poet Ivor Gurney) with David Goodland, The Shrewsbury Theatre Guild's production of Arthur's Plough, as well as writing and directing the music for the Festival Players Theatre Company, and their touring productions of William Shakespeare's works, which culminated in the Three Choirs Festival. He has edited two poetry anthologies: Forest & Vale & High Blue Hill and Between the Severn and the Wye – poems from the border counties of England and Wales. His third book was A Country Christmas, a collections of prose, poetry, carols, songs and folklore.
Coppin's BBC Radio Gloucestershire show, Folk Roots, was the fifth most listened to BBC Local Radio programme broadcast through the internet, with over 5,000 people listening per week.
In 2008, he was elected as Honorary President of Glosfolk, the organisation that promotes traditional music in the county, for his services to folk music over many years.
Albums
Decameron
Say Hello to the Band (1973)
Mammoth Special (1974)
Third Light (1975)
Tomorrow's Pantomime (1976)
Afterwords (2001)
Solo
Roll On Dreamer (1978)
No Going Back (1979)
Get Lucky (1982)
Forest and Vale and High Blue Hill (1983)
Line of Blue (1985)
English Morning (1987)
Edge of Day with Laurie Lee (1989)
The Glorious Glosters (1990)
Songs on Lonely Roads (1990)
Songs and Carols for a West Country Christmas (1991)
Force of the River (1993)
The Gloucestershire Collection (1994)
A Country Christmas (1995)
The Shakespeare Songs (1997)
A Journey – compilation (2001)
Keep the Flame EP with Paul Burgess and Mick Dolan (2004)
The Winding Stair (2005)
Breaking the Silence with Mike Silver (2007)
Borderland (2014)
All on a Winter's Night (2017)
30 Songs – 2 CD compilation (2019)
Midwinter – live album (2020)
River of Dreams (2022)
Singles
The Magnificent Mercury Brothers
"The New Girl in School" / "Why Do Fools Fall in Love?" / "What About Us?" (1975)
Solo
"Believe in You" b/w "Run to Her" (1980)
"We Shall Not Pass" (1980)
"Everybody Knows" (1982)
"Keep the Flame" (digital download, 2011)
Books
Forest and Vale and High Blue Hill (1991)
Between the Severn and the Wye (1993)
A Country Christmas (1997)
Festival Players Productions
Coppin was musical director and wrote the songs and music for these summer touring productions
Merry Wives of Windsor (1992)
Much Ado About Nothing (1994)
A Winter's Tale (1995)
The Merchant of Venice (1996)
As You Like It (1997)
A Midsummer Night's Dream (1998)
Romeo and Juliet (2002)
Comedy of Errors (2003)
Twelfth Night (2004)
A Midsummer Night's Dream (2005)
Hamlet (2006)
As You Like It (2007)
Much Ado About Nothing (2008)
The Merchant of Venice (2009)
The Taming of the Shrew (2011)
Twelfth Night (2012)
Romeo and Juliet (2013)
A Midsummer Night's Dream (2013)
A Comedy of Errors (2014)
Macbeth (2014)
As You Like It (2015)
Hamlet (2016)
The Merry Wives of Windsor (2017)
The Winter's Tale (2018)
Much Ado About Nothing (2019)
References
External links
Johnny Coppin website
Johnny Coppin on BBC Gloucestershire
1946 births
Living people
English folk guitarists
English male guitarists
English pianists
English male singer-songwriters
English singer-songwriters
British male pianists
21st-century British pianists
21st-century British male musicians
|
```objective-c
// All Rights Reserved.
//
// 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.
//
// - Redistribution 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 Sun Microsystems or the names of 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.
// The original source code covered by the above license above has been
// modified significantly by Google Inc.
// A lightweight X64 Assembler.
#ifndef V8_X64_ASSEMBLER_X64_H_
#define V8_X64_ASSEMBLER_X64_H_
#include <deque>
#include "src/assembler.h"
#include "src/compiler.h"
namespace v8 {
namespace internal {
// Utility functions
// CPU Registers.
//
// 1) We would prefer to use an enum, but enum values are assignment-
// compatible with int, which has caused code-generation bugs.
//
// 2) We would prefer to use a class instead of a struct but we don't like
// the register initialization to depend on the particular initialization
// order (which appears to be different on OS X, Linux, and Windows for the
// installed versions of C++ we tried). Using a struct permits C-style
// "initialization". Also, the Register objects cannot be const as this
// forces initialization stubs in MSVC, making us dependent on initialization
// order.
//
// 3) By not using an enum, we are possibly preventing the compiler from
// doing certain constant folds, which may significantly reduce the
// code generated for some assembly instructions (because they boil down
// to a few constants). If this is a problem, we could change the code
// such that we use an enum in optimized mode, and the struct in debug
// mode. This way we get the compile-time error checking in debug mode
// and best performance in optimized code.
//
struct Register {
// The non-allocatable registers are:
// rsp - stack pointer
// rbp - frame pointer
// r10 - fixed scratch register
// r13 - root register
static const int kMaxNumAllocatableRegisters = 12;
static int NumAllocatableRegisters() {
return kMaxNumAllocatableRegisters;
}
static const int kNumRegisters = 16;
static int ToAllocationIndex(Register reg) {
return kAllocationIndexByRegisterCode[reg.code()];
}
static Register FromAllocationIndex(int index) {
DCHECK(index >= 0 && index < kMaxNumAllocatableRegisters);
Register result = { kRegisterCodeByAllocationIndex[index] };
return result;
}
static const char* AllocationIndexToString(int index) {
DCHECK(index >= 0 && index < kMaxNumAllocatableRegisters);
const char* const names[] = {
"rax",
"rbx",
"rdx",
"rcx",
"rsi",
"rdi",
"r8",
"r9",
"r11",
"r12",
"r14",
"r15"
};
return names[index];
}
static Register from_code(int code) {
Register r = { code };
return r;
}
bool is_valid() const { return 0 <= code_ && code_ < kNumRegisters; }
bool is(Register reg) const { return code_ == reg.code_; }
// rax, rbx, rcx and rdx are byte registers, the rest are not.
bool is_byte_register() const { return code_ <= 3; }
int code() const {
DCHECK(is_valid());
return code_;
}
int bit() const {
return 1 << code_;
}
// Return the high bit of the register code as a 0 or 1. Used often
// when constructing the REX prefix byte.
int high_bit() const {
return code_ >> 3;
}
// Return the 3 low bits of the register code. Used when encoding registers
// in modR/M, SIB, and opcode bytes.
int low_bits() const {
return code_ & 0x7;
}
// Unfortunately we can't make this private in a struct when initializing
// by assignment.
int code_;
private:
static const int kRegisterCodeByAllocationIndex[kMaxNumAllocatableRegisters];
static const int kAllocationIndexByRegisterCode[kNumRegisters];
};
const int kRegister_rax_Code = 0;
const int kRegister_rcx_Code = 1;
const int kRegister_rdx_Code = 2;
const int kRegister_rbx_Code = 3;
const int kRegister_rsp_Code = 4;
const int kRegister_rbp_Code = 5;
const int kRegister_rsi_Code = 6;
const int kRegister_rdi_Code = 7;
const int kRegister_r8_Code = 8;
const int kRegister_r9_Code = 9;
const int kRegister_r10_Code = 10;
const int kRegister_r11_Code = 11;
const int kRegister_r12_Code = 12;
const int kRegister_r13_Code = 13;
const int kRegister_r14_Code = 14;
const int kRegister_r15_Code = 15;
const int kRegister_no_reg_Code = -1;
const Register rax = { kRegister_rax_Code };
const Register rcx = { kRegister_rcx_Code };
const Register rdx = { kRegister_rdx_Code };
const Register rbx = { kRegister_rbx_Code };
const Register rsp = { kRegister_rsp_Code };
const Register rbp = { kRegister_rbp_Code };
const Register rsi = { kRegister_rsi_Code };
const Register rdi = { kRegister_rdi_Code };
const Register r8 = { kRegister_r8_Code };
const Register r9 = { kRegister_r9_Code };
const Register r10 = { kRegister_r10_Code };
const Register r11 = { kRegister_r11_Code };
const Register r12 = { kRegister_r12_Code };
const Register r13 = { kRegister_r13_Code };
const Register r14 = { kRegister_r14_Code };
const Register r15 = { kRegister_r15_Code };
const Register no_reg = { kRegister_no_reg_Code };
#ifdef _WIN64
// Windows calling convention
const Register arg_reg_1 = { kRegister_rcx_Code };
const Register arg_reg_2 = { kRegister_rdx_Code };
const Register arg_reg_3 = { kRegister_r8_Code };
const Register arg_reg_4 = { kRegister_r9_Code };
#else
// AMD64 calling convention
const Register arg_reg_1 = { kRegister_rdi_Code };
const Register arg_reg_2 = { kRegister_rsi_Code };
const Register arg_reg_3 = { kRegister_rdx_Code };
const Register arg_reg_4 = { kRegister_rcx_Code };
#endif // _WIN64
struct XMMRegister {
static const int kMaxNumRegisters = 16;
static const int kMaxNumAllocatableRegisters = 15;
static int NumAllocatableRegisters() {
return kMaxNumAllocatableRegisters;
}
// TODO(turbofan): Proper support for float32.
static int NumAllocatableAliasedRegisters() {
return NumAllocatableRegisters();
}
static int ToAllocationIndex(XMMRegister reg) {
DCHECK(reg.code() != 0);
return reg.code() - 1;
}
static XMMRegister FromAllocationIndex(int index) {
DCHECK(0 <= index && index < kMaxNumAllocatableRegisters);
XMMRegister result = { index + 1 };
return result;
}
static const char* AllocationIndexToString(int index) {
DCHECK(index >= 0 && index < kMaxNumAllocatableRegisters);
const char* const names[] = {
"xmm1",
"xmm2",
"xmm3",
"xmm4",
"xmm5",
"xmm6",
"xmm7",
"xmm8",
"xmm9",
"xmm10",
"xmm11",
"xmm12",
"xmm13",
"xmm14",
"xmm15"
};
return names[index];
}
static XMMRegister from_code(int code) {
DCHECK(code >= 0);
DCHECK(code < kMaxNumRegisters);
XMMRegister r = { code };
return r;
}
bool is_valid() const { return 0 <= code_ && code_ < kMaxNumRegisters; }
bool is(XMMRegister reg) const { return code_ == reg.code_; }
int code() const {
DCHECK(is_valid());
return code_;
}
// Return the high bit of the register code as a 0 or 1. Used often
// when constructing the REX prefix byte.
int high_bit() const {
return code_ >> 3;
}
// Return the 3 low bits of the register code. Used when encoding registers
// in modR/M, SIB, and opcode bytes.
int low_bits() const {
return code_ & 0x7;
}
int code_;
};
const XMMRegister xmm0 = { 0 };
const XMMRegister xmm1 = { 1 };
const XMMRegister xmm2 = { 2 };
const XMMRegister xmm3 = { 3 };
const XMMRegister xmm4 = { 4 };
const XMMRegister xmm5 = { 5 };
const XMMRegister xmm6 = { 6 };
const XMMRegister xmm7 = { 7 };
const XMMRegister xmm8 = { 8 };
const XMMRegister xmm9 = { 9 };
const XMMRegister xmm10 = { 10 };
const XMMRegister xmm11 = { 11 };
const XMMRegister xmm12 = { 12 };
const XMMRegister xmm13 = { 13 };
const XMMRegister xmm14 = { 14 };
const XMMRegister xmm15 = { 15 };
typedef XMMRegister DoubleRegister;
enum Condition {
// any value < 0 is considered no_condition
no_condition = -1,
overflow = 0,
no_overflow = 1,
below = 2,
above_equal = 3,
equal = 4,
not_equal = 5,
below_equal = 6,
above = 7,
negative = 8,
positive = 9,
parity_even = 10,
parity_odd = 11,
less = 12,
greater_equal = 13,
less_equal = 14,
greater = 15,
// Fake conditions that are handled by the
// opcodes using them.
always = 16,
never = 17,
// aliases
carry = below,
not_carry = above_equal,
zero = equal,
not_zero = not_equal,
sign = negative,
not_sign = positive,
last_condition = greater
};
// Returns the equivalent of !cc.
// Negation of the default no_condition (-1) results in a non-default
// no_condition value (-2). As long as tests for no_condition check
// for condition < 0, this will work as expected.
inline Condition NegateCondition(Condition cc) {
return static_cast<Condition>(cc ^ 1);
}
// Commute a condition such that {a cond b == b cond' a}.
inline Condition CommuteCondition(Condition cc) {
switch (cc) {
case below:
return above;
case above:
return below;
case above_equal:
return below_equal;
case below_equal:
return above_equal;
case less:
return greater;
case greater:
return less;
case greater_equal:
return less_equal;
case less_equal:
return greater_equal;
default:
return cc;
}
}
enum RoundingMode {
kRoundToNearest = 0x0,
kRoundDown = 0x1,
kRoundUp = 0x2,
kRoundToZero = 0x3
};
// your_sha256_hash-------------
// Machine instruction Immediates
class Immediate BASE_EMBEDDED {
public:
explicit Immediate(int32_t value) : value_(value) {}
explicit Immediate(Smi* value) {
DCHECK(SmiValuesAre31Bits()); // Only available for 31-bit SMI.
value_ = static_cast<int32_t>(reinterpret_cast<intptr_t>(value));
}
private:
int32_t value_;
friend class Assembler;
};
// your_sha256_hash-------------
// Machine instruction Operands
enum ScaleFactor {
times_1 = 0,
times_2 = 1,
times_4 = 2,
times_8 = 3,
times_int_size = times_4,
times_pointer_size = (kPointerSize == 8) ? times_8 : times_4
};
class Operand BASE_EMBEDDED {
public:
// [base + disp/r]
Operand(Register base, int32_t disp);
// [base + index*scale + disp/r]
Operand(Register base,
Register index,
ScaleFactor scale,
int32_t disp);
// [index*scale + disp/r]
Operand(Register index,
ScaleFactor scale,
int32_t disp);
// Offset from existing memory operand.
// Offset is added to existing displacement as 32-bit signed values and
// this must not overflow.
Operand(const Operand& base, int32_t offset);
// [rip + disp/r]
explicit Operand(Label* label);
// Checks whether either base or index register is the given register.
// Does not check the "reg" part of the Operand.
bool AddressUsesRegister(Register reg) const;
// Queries related to the size of the generated instruction.
// Whether the generated instruction will have a REX prefix.
bool requires_rex() const { return rex_ != 0; }
// Size of the ModR/M, SIB and displacement parts of the generated
// instruction.
int operand_size() const { return len_; }
private:
byte rex_;
byte buf_[9];
// The number of bytes of buf_ in use.
byte len_;
// Set the ModR/M byte without an encoded 'reg' register. The
// register is encoded later as part of the emit_operand operation.
// set_modrm can be called before or after set_sib and set_disp*.
inline void set_modrm(int mod, Register rm);
// Set the SIB byte if one is needed. Sets the length to 2 rather than 1.
inline void set_sib(ScaleFactor scale, Register index, Register base);
// Adds operand displacement fields (offsets added to the memory address).
// Needs to be called after set_sib, not before it.
inline void set_disp8(int disp);
inline void set_disp32(int disp);
inline void set_disp64(int64_t disp); // for labels.
friend class Assembler;
};
#define ASSEMBLER_INSTRUCTION_LIST(V) \
V(add) \
V(and) \
V(cmp) \
V(dec) \
V(idiv) \
V(div) \
V(imul) \
V(inc) \
V(lea) \
V(mov) \
V(movzxb) \
V(movzxw) \
V(neg) \
V(not) \
V(or) \
V(repmovs) \
V(sbb) \
V(sub) \
V(test) \
V(xchg) \
V(xor)
// Shift instructions on operands/registers with kPointerSize, kInt32Size and
// kInt64Size.
#define SHIFT_INSTRUCTION_LIST(V) \
V(rol, 0x0) \
V(ror, 0x1) \
V(rcl, 0x2) \
V(rcr, 0x3) \
V(shl, 0x4) \
V(shr, 0x5) \
V(sar, 0x7) \
class Assembler : public AssemblerBase {
private:
// We check before assembling an instruction that there is sufficient
// space to write an instruction and its relocation information.
// The relocation writer's position must be kGap bytes above the end of
// the generated instructions. This leaves enough space for the
// longest possible x64 instruction, 15 bytes, and the longest possible
// relocation information encoding, RelocInfoWriter::kMaxLength == 16.
// (There is a 15 byte limit on x64 instruction length that rules out some
// otherwise valid instructions.)
// This allows for a single, fast space check per instruction.
static const int kGap = 32;
public:
// Create an assembler. Instructions and relocation information are emitted
// into a buffer, with the instructions starting from the beginning and the
// relocation information starting from the end of the buffer. See CodeDesc
// for a detailed comment on the layout (globals.h).
//
// If the provided buffer is NULL, the assembler allocates and grows its own
// buffer, and buffer_size determines the initial buffer size. The buffer is
// owned by the assembler and deallocated upon destruction of the assembler.
//
// If the provided buffer is not NULL, the assembler uses the provided buffer
// for code generation and assumes its size to be buffer_size. If the buffer
// is too small, a fatal error occurs. No deallocation of the buffer is done
// upon destruction of the assembler.
Assembler(Isolate* isolate, void* buffer, int buffer_size);
virtual ~Assembler() { }
// GetCode emits any pending (non-emitted) code and fills the descriptor
// desc. GetCode() is idempotent; it returns the same result if no other
// Assembler functions are invoked in between GetCode() calls.
void GetCode(CodeDesc* desc);
// Read/Modify the code target in the relative branch/call instruction at pc.
// On the x64 architecture, we use relative jumps with a 32-bit displacement
// to jump to other Code objects in the Code space in the heap.
// Jumps to C functions are done indirectly through a 64-bit register holding
// the absolute address of the target.
// These functions convert between absolute Addresses of Code objects and
// the relative displacements stored in the code.
static inline Address target_address_at(Address pc, Address constant_pool);
static inline void set_target_address_at(
Address pc, Address constant_pool, Address target,
ICacheFlushMode icache_flush_mode = FLUSH_ICACHE_IF_NEEDED);
static inline Address target_address_at(Address pc, Code* code) {
Address constant_pool = code ? code->constant_pool() : NULL;
return target_address_at(pc, constant_pool);
}
static inline void set_target_address_at(Address pc,
Code* code,
Address target,
ICacheFlushMode icache_flush_mode =
FLUSH_ICACHE_IF_NEEDED) {
Address constant_pool = code ? code->constant_pool() : NULL;
set_target_address_at(pc, constant_pool, target, icache_flush_mode);
}
// Return the code target address at a call site from the return address
// of that call in the instruction stream.
static inline Address target_address_from_return_address(Address pc);
// Return the code target address of the patch debug break slot
inline static Address break_address_from_return_address(Address pc);
// This sets the branch destination (which is in the instruction on x64).
// This is for calls and branches within generated code.
inline static void deserialization_set_special_target_at(
Address instruction_payload, Code* code, Address target) {
set_target_address_at(instruction_payload, code, target);
}
// This sets the internal reference at the pc.
inline static void deserialization_set_target_internal_reference_at(
Address pc, Address target,
RelocInfo::Mode mode = RelocInfo::INTERNAL_REFERENCE);
static inline RelocInfo::Mode RelocInfoNone() {
if (kPointerSize == kInt64Size) {
return RelocInfo::NONE64;
} else {
DCHECK(kPointerSize == kInt32Size);
return RelocInfo::NONE32;
}
}
inline Handle<Object> code_target_object_handle_at(Address pc);
inline Address runtime_entry_at(Address pc);
// Number of bytes taken up by the branch target in the code.
static const int kSpecialTargetSize = 4; // Use 32-bit displacement.
// Distance between the address of the code target in the call instruction
// and the return address pushed on the stack.
static const int kCallTargetAddressOffset = 4; // Use 32-bit displacement.
// The length of call(kScratchRegister).
static const int kCallScratchRegisterInstructionLength = 3;
// The length of call(Immediate32).
static const int kShortCallInstructionLength = 5;
// The length of movq(kScratchRegister, address).
static const int kMoveAddressIntoScratchRegisterInstructionLength =
2 + kPointerSize;
// The length of movq(kScratchRegister, address) and call(kScratchRegister).
static const int kCallSequenceLength =
kMoveAddressIntoScratchRegisterInstructionLength +
kCallScratchRegisterInstructionLength;
// The js return and debug break slot must be able to contain an indirect
// call sequence, some x64 JS code is padded with int3 to make it large
// enough to hold an instruction when the debugger patches it.
static const int kJSReturnSequenceLength = kCallSequenceLength;
static const int kDebugBreakSlotLength = kCallSequenceLength;
static const int kPatchDebugBreakSlotReturnOffset = kCallTargetAddressOffset;
// Distance between the start of the JS return sequence and where the
// 32-bit displacement of a short call would be. The short call is from
// SetDebugBreakAtIC from debug-x64.cc.
static const int kPatchReturnSequenceAddressOffset =
kJSReturnSequenceLength - kPatchDebugBreakSlotReturnOffset;
// Distance between the start of the JS return sequence and where the
// 32-bit displacement of a short call would be. The short call is from
// SetDebugBreakAtIC from debug-x64.cc.
static const int kPatchDebugBreakSlotAddressOffset =
kDebugBreakSlotLength - kPatchDebugBreakSlotReturnOffset;
static const int kRealPatchReturnSequenceAddressOffset =
kMoveAddressIntoScratchRegisterInstructionLength - kPointerSize;
// One byte opcode for test eax,0xXXXXXXXX.
static const byte kTestEaxByte = 0xA9;
// One byte opcode for test al, 0xXX.
static const byte kTestAlByte = 0xA8;
// One byte opcode for nop.
static const byte kNopByte = 0x90;
// One byte prefix for a short conditional jump.
static const byte kJccShortPrefix = 0x70;
static const byte kJncShortOpcode = kJccShortPrefix | not_carry;
static const byte kJcShortOpcode = kJccShortPrefix | carry;
static const byte kJnzShortOpcode = kJccShortPrefix | not_zero;
static const byte kJzShortOpcode = kJccShortPrefix | zero;
// your_sha256_hash-----------
// Code generation
//
// Function names correspond one-to-one to x64 instruction mnemonics.
// Unless specified otherwise, instructions operate on 64-bit operands.
//
// If we need versions of an assembly instruction that operate on different
// width arguments, we add a single-letter suffix specifying the width.
// This is done for the following instructions: mov, cmp, inc, dec,
// add, sub, and test.
// There are no versions of these instructions without the suffix.
// - Instructions on 8-bit (byte) operands/registers have a trailing 'b'.
// - Instructions on 16-bit (word) operands/registers have a trailing 'w'.
// - Instructions on 32-bit (doubleword) operands/registers use 'l'.
// - Instructions on 64-bit (quadword) operands/registers use 'q'.
// - Instructions on operands/registers with pointer size use 'p'.
STATIC_ASSERT(kPointerSize == kInt64Size || kPointerSize == kInt32Size);
#define DECLARE_INSTRUCTION(instruction) \
template<class P1> \
void instruction##p(P1 p1) { \
emit_##instruction(p1, kPointerSize); \
} \
\
template<class P1> \
void instruction##l(P1 p1) { \
emit_##instruction(p1, kInt32Size); \
} \
\
template<class P1> \
void instruction##q(P1 p1) { \
emit_##instruction(p1, kInt64Size); \
} \
\
template<class P1, class P2> \
void instruction##p(P1 p1, P2 p2) { \
emit_##instruction(p1, p2, kPointerSize); \
} \
\
template<class P1, class P2> \
void instruction##l(P1 p1, P2 p2) { \
emit_##instruction(p1, p2, kInt32Size); \
} \
\
template<class P1, class P2> \
void instruction##q(P1 p1, P2 p2) { \
emit_##instruction(p1, p2, kInt64Size); \
} \
\
template<class P1, class P2, class P3> \
void instruction##p(P1 p1, P2 p2, P3 p3) { \
emit_##instruction(p1, p2, p3, kPointerSize); \
} \
\
template<class P1, class P2, class P3> \
void instruction##l(P1 p1, P2 p2, P3 p3) { \
emit_##instruction(p1, p2, p3, kInt32Size); \
} \
\
template<class P1, class P2, class P3> \
void instruction##q(P1 p1, P2 p2, P3 p3) { \
emit_##instruction(p1, p2, p3, kInt64Size); \
}
ASSEMBLER_INSTRUCTION_LIST(DECLARE_INSTRUCTION)
#undef DECLARE_INSTRUCTION
// Insert the smallest number of nop instructions
// possible to align the pc offset to a multiple
// of m, where m must be a power of 2.
void Align(int m);
// Insert the smallest number of zero bytes possible to align the pc offset
// to a mulitple of m. m must be a power of 2 (>= 2).
void DataAlign(int m);
void Nop(int bytes = 1);
// Aligns code to something that's optimal for a jump target for the platform.
void CodeTargetAlign();
// Stack
void pushfq();
void popfq();
void pushq(Immediate value);
// Push a 32 bit integer, and guarantee that it is actually pushed as a
// 32 bit value, the normal push will optimize the 8 bit case.
void pushq_imm32(int32_t imm32);
void pushq(Register src);
void pushq(const Operand& src);
void popq(Register dst);
void popq(const Operand& dst);
void enter(Immediate size);
void leave();
// Moves
void movb(Register dst, const Operand& src);
void movb(Register dst, Immediate imm);
void movb(const Operand& dst, Register src);
void movb(const Operand& dst, Immediate imm);
// Move the low 16 bits of a 64-bit register value to a 16-bit
// memory location.
void movw(Register dst, const Operand& src);
void movw(const Operand& dst, Register src);
void movw(const Operand& dst, Immediate imm);
// Move the offset of the label location relative to the current
// position (after the move) to the destination.
void movl(const Operand& dst, Label* src);
// Loads a pointer into a register with a relocation mode.
void movp(Register dst, void* ptr, RelocInfo::Mode rmode);
// Loads a 64-bit immediate into a register.
void movq(Register dst, int64_t value);
void movq(Register dst, uint64_t value);
void movsxbl(Register dst, Register src);
void movsxbl(Register dst, const Operand& src);
void movsxbq(Register dst, const Operand& src);
void movsxwl(Register dst, Register src);
void movsxwl(Register dst, const Operand& src);
void movsxwq(Register dst, const Operand& src);
void movsxlq(Register dst, Register src);
void movsxlq(Register dst, const Operand& src);
// Repeated moves.
void repmovsb();
void repmovsw();
void repmovsp() { emit_repmovs(kPointerSize); }
void repmovsl() { emit_repmovs(kInt32Size); }
void repmovsq() { emit_repmovs(kInt64Size); }
// Instruction to load from an immediate 64-bit pointer into RAX.
void load_rax(void* ptr, RelocInfo::Mode rmode);
void load_rax(ExternalReference ext);
// Conditional moves.
void cmovq(Condition cc, Register dst, Register src);
void cmovq(Condition cc, Register dst, const Operand& src);
void cmovl(Condition cc, Register dst, Register src);
void cmovl(Condition cc, Register dst, const Operand& src);
void cmpb(Register dst, Immediate src) {
immediate_arithmetic_op_8(0x7, dst, src);
}
void cmpb_al(Immediate src);
void cmpb(Register dst, Register src) {
arithmetic_op_8(0x3A, dst, src);
}
void cmpb(Register dst, const Operand& src) {
arithmetic_op_8(0x3A, dst, src);
}
void cmpb(const Operand& dst, Register src) {
arithmetic_op_8(0x38, src, dst);
}
void cmpb(const Operand& dst, Immediate src) {
immediate_arithmetic_op_8(0x7, dst, src);
}
void cmpw(const Operand& dst, Immediate src) {
immediate_arithmetic_op_16(0x7, dst, src);
}
void cmpw(Register dst, Immediate src) {
immediate_arithmetic_op_16(0x7, dst, src);
}
void cmpw(Register dst, const Operand& src) {
arithmetic_op_16(0x3B, dst, src);
}
void cmpw(Register dst, Register src) {
arithmetic_op_16(0x3B, dst, src);
}
void cmpw(const Operand& dst, Register src) {
arithmetic_op_16(0x39, src, dst);
}
void andb(Register dst, Immediate src) {
immediate_arithmetic_op_8(0x4, dst, src);
}
void decb(Register dst);
void decb(const Operand& dst);
// Sign-extends rax into rdx:rax.
void cqo();
// Sign-extends eax into edx:eax.
void cdq();
// Multiply eax by src, put the result in edx:eax.
void mull(Register src);
void mull(const Operand& src);
// Multiply rax by src, put the result in rdx:rax.
void mulq(Register src);
#define DECLARE_SHIFT_INSTRUCTION(instruction, subcode) \
void instruction##p(Register dst, Immediate imm8) { \
shift(dst, imm8, subcode, kPointerSize); \
} \
\
void instruction##l(Register dst, Immediate imm8) { \
shift(dst, imm8, subcode, kInt32Size); \
} \
\
void instruction##q(Register dst, Immediate imm8) { \
shift(dst, imm8, subcode, kInt64Size); \
} \
\
void instruction##p(Operand dst, Immediate imm8) { \
shift(dst, imm8, subcode, kPointerSize); \
} \
\
void instruction##l(Operand dst, Immediate imm8) { \
shift(dst, imm8, subcode, kInt32Size); \
} \
\
void instruction##q(Operand dst, Immediate imm8) { \
shift(dst, imm8, subcode, kInt64Size); \
} \
\
void instruction##p_cl(Register dst) { shift(dst, subcode, kPointerSize); } \
\
void instruction##l_cl(Register dst) { shift(dst, subcode, kInt32Size); } \
\
void instruction##q_cl(Register dst) { shift(dst, subcode, kInt64Size); } \
\
void instruction##p_cl(Operand dst) { shift(dst, subcode, kPointerSize); } \
\
void instruction##l_cl(Operand dst) { shift(dst, subcode, kInt32Size); } \
\
void instruction##q_cl(Operand dst) { shift(dst, subcode, kInt64Size); }
SHIFT_INSTRUCTION_LIST(DECLARE_SHIFT_INSTRUCTION)
#undef DECLARE_SHIFT_INSTRUCTION
// Shifts dst:src left by cl bits, affecting only dst.
void shld(Register dst, Register src);
// Shifts src:dst right by cl bits, affecting only dst.
void shrd(Register dst, Register src);
void store_rax(void* dst, RelocInfo::Mode mode);
void store_rax(ExternalReference ref);
void subb(Register dst, Immediate src) {
immediate_arithmetic_op_8(0x5, dst, src);
}
void testb(Register dst, Register src);
void testb(Register reg, Immediate mask);
void testb(const Operand& op, Immediate mask);
void testb(const Operand& op, Register reg);
// Bit operations.
void bt(const Operand& dst, Register src);
void bts(const Operand& dst, Register src);
void bsrl(Register dst, Register src);
void bsrl(Register dst, const Operand& src);
// Miscellaneous
void clc();
void cld();
void cpuid();
void hlt();
void int3();
void nop();
void ret(int imm16);
void ud2();
void setcc(Condition cc, Register reg);
// Label operations & relative jumps (PPUM Appendix D)
//
// Takes a branch opcode (cc) and a label (L) and generates
// either a backward branch or a forward branch and links it
// to the label fixup chain. Usage:
//
// Label L; // unbound label
// j(cc, &L); // forward branch to unbound label
// bind(&L); // bind label to the current pc
// j(cc, &L); // backward branch to bound label
// bind(&L); // illegal: a label may be bound only once
//
// Note: The same Label can be used for forward and backward branches
// but it may be bound only once.
void bind(Label* L); // binds an unbound label L to the current code position
// Calls
// Call near relative 32-bit displacement, relative to next instruction.
void call(Label* L);
void call(Address entry, RelocInfo::Mode rmode);
void call(Handle<Code> target,
RelocInfo::Mode rmode = RelocInfo::CODE_TARGET,
TypeFeedbackId ast_id = TypeFeedbackId::None());
// Calls directly to the given address using a relative offset.
// Should only ever be used in Code objects for calls within the
// same Code object. Should not be used when generating new code (use labels),
// but only when patching existing code.
void call(Address target);
// Call near absolute indirect, address in register
void call(Register adr);
// Jumps
// Jump short or near relative.
// Use a 32-bit signed displacement.
// Unconditional jump to L
void jmp(Label* L, Label::Distance distance = Label::kFar);
void jmp(Address entry, RelocInfo::Mode rmode);
void jmp(Handle<Code> target, RelocInfo::Mode rmode);
// Jump near absolute indirect (r64)
void jmp(Register adr);
void jmp(const Operand& src);
// Conditional jumps
void j(Condition cc,
Label* L,
Label::Distance distance = Label::kFar);
void j(Condition cc, Address entry, RelocInfo::Mode rmode);
void j(Condition cc, Handle<Code> target, RelocInfo::Mode rmode);
// Floating-point operations
void fld(int i);
void fld1();
void fldz();
void fldpi();
void fldln2();
void fld_s(const Operand& adr);
void fld_d(const Operand& adr);
void fstp_s(const Operand& adr);
void fstp_d(const Operand& adr);
void fstp(int index);
void fild_s(const Operand& adr);
void fild_d(const Operand& adr);
void fist_s(const Operand& adr);
void fistp_s(const Operand& adr);
void fistp_d(const Operand& adr);
void fisttp_s(const Operand& adr);
void fisttp_d(const Operand& adr);
void fabs();
void fchs();
void fadd(int i);
void fsub(int i);
void fmul(int i);
void fdiv(int i);
void fisub_s(const Operand& adr);
void faddp(int i = 1);
void fsubp(int i = 1);
void fsubrp(int i = 1);
void fmulp(int i = 1);
void fdivp(int i = 1);
void fprem();
void fprem1();
void fxch(int i = 1);
void fincstp();
void ffree(int i = 0);
void ftst();
void fucomp(int i);
void fucompp();
void fucomi(int i);
void fucomip();
void fcompp();
void fnstsw_ax();
void fwait();
void fnclex();
void fsin();
void fcos();
void fptan();
void fyl2x();
void f2xm1();
void fscale();
void fninit();
void frndint();
void sahf();
// SSE instructions
void addss(XMMRegister dst, XMMRegister src);
void addss(XMMRegister dst, const Operand& src);
void subss(XMMRegister dst, XMMRegister src);
void subss(XMMRegister dst, const Operand& src);
void mulss(XMMRegister dst, XMMRegister src);
void mulss(XMMRegister dst, const Operand& src);
void divss(XMMRegister dst, XMMRegister src);
void divss(XMMRegister dst, const Operand& src);
void maxss(XMMRegister dst, XMMRegister src);
void maxss(XMMRegister dst, const Operand& src);
void minss(XMMRegister dst, XMMRegister src);
void minss(XMMRegister dst, const Operand& src);
void sqrtss(XMMRegister dst, XMMRegister src);
void sqrtss(XMMRegister dst, const Operand& src);
void ucomiss(XMMRegister dst, XMMRegister src);
void ucomiss(XMMRegister dst, const Operand& src);
void movaps(XMMRegister dst, XMMRegister src);
void movss(XMMRegister dst, const Operand& src);
void movss(const Operand& dst, XMMRegister src);
void shufps(XMMRegister dst, XMMRegister src, byte imm8);
void cvttss2si(Register dst, const Operand& src);
void cvttss2si(Register dst, XMMRegister src);
void cvtlsi2ss(XMMRegister dst, Register src);
void andps(XMMRegister dst, XMMRegister src);
void andps(XMMRegister dst, const Operand& src);
void orps(XMMRegister dst, XMMRegister src);
void orps(XMMRegister dst, const Operand& src);
void xorps(XMMRegister dst, XMMRegister src);
void xorps(XMMRegister dst, const Operand& src);
void addps(XMMRegister dst, XMMRegister src);
void addps(XMMRegister dst, const Operand& src);
void subps(XMMRegister dst, XMMRegister src);
void subps(XMMRegister dst, const Operand& src);
void mulps(XMMRegister dst, XMMRegister src);
void mulps(XMMRegister dst, const Operand& src);
void divps(XMMRegister dst, XMMRegister src);
void divps(XMMRegister dst, const Operand& src);
void movmskps(Register dst, XMMRegister src);
// SSE2 instructions
void movd(XMMRegister dst, Register src);
void movd(XMMRegister dst, const Operand& src);
void movd(Register dst, XMMRegister src);
void movq(XMMRegister dst, Register src);
void movq(Register dst, XMMRegister src);
void movq(XMMRegister dst, XMMRegister src);
// Don't use this unless it's important to keep the
// top half of the destination register unchanged.
// Used movaps when moving double values and movq for integer
// values in xmm registers.
void movsd(XMMRegister dst, XMMRegister src);
void movsd(const Operand& dst, XMMRegister src);
void movsd(XMMRegister dst, const Operand& src);
void movdqa(const Operand& dst, XMMRegister src);
void movdqa(XMMRegister dst, const Operand& src);
void movdqu(const Operand& dst, XMMRegister src);
void movdqu(XMMRegister dst, const Operand& src);
void movapd(XMMRegister dst, XMMRegister src);
void psllq(XMMRegister reg, byte imm8);
void psrlq(XMMRegister reg, byte imm8);
void pslld(XMMRegister reg, byte imm8);
void psrld(XMMRegister reg, byte imm8);
void cvttsd2si(Register dst, const Operand& src);
void cvttsd2si(Register dst, XMMRegister src);
void cvttsd2siq(Register dst, XMMRegister src);
void cvttsd2siq(Register dst, const Operand& src);
void cvtlsi2sd(XMMRegister dst, const Operand& src);
void cvtlsi2sd(XMMRegister dst, Register src);
void cvtqsi2sd(XMMRegister dst, const Operand& src);
void cvtqsi2sd(XMMRegister dst, Register src);
void cvtss2sd(XMMRegister dst, XMMRegister src);
void cvtss2sd(XMMRegister dst, const Operand& src);
void cvtsd2ss(XMMRegister dst, XMMRegister src);
void cvtsd2ss(XMMRegister dst, const Operand& src);
void cvtsd2si(Register dst, XMMRegister src);
void cvtsd2siq(Register dst, XMMRegister src);
void addsd(XMMRegister dst, XMMRegister src);
void addsd(XMMRegister dst, const Operand& src);
void subsd(XMMRegister dst, XMMRegister src);
void subsd(XMMRegister dst, const Operand& src);
void mulsd(XMMRegister dst, XMMRegister src);
void mulsd(XMMRegister dst, const Operand& src);
void divsd(XMMRegister dst, XMMRegister src);
void divsd(XMMRegister dst, const Operand& src);
void maxsd(XMMRegister dst, XMMRegister src);
void maxsd(XMMRegister dst, const Operand& src);
void minsd(XMMRegister dst, XMMRegister src);
void minsd(XMMRegister dst, const Operand& src);
void andpd(XMMRegister dst, XMMRegister src);
void orpd(XMMRegister dst, XMMRegister src);
void xorpd(XMMRegister dst, XMMRegister src);
void sqrtsd(XMMRegister dst, XMMRegister src);
void sqrtsd(XMMRegister dst, const Operand& src);
void ucomisd(XMMRegister dst, XMMRegister src);
void ucomisd(XMMRegister dst, const Operand& src);
void cmpltsd(XMMRegister dst, XMMRegister src);
void pcmpeqd(XMMRegister dst, XMMRegister src);
void movmskpd(Register dst, XMMRegister src);
void punpckldq(XMMRegister dst, XMMRegister src);
void punpckhdq(XMMRegister dst, XMMRegister src);
// SSE 4.1 instruction
void extractps(Register dst, XMMRegister src, byte imm8);
void pextrd(Register dst, XMMRegister src, int8_t imm8);
void pinsrd(XMMRegister dst, Register src, int8_t imm8);
void pinsrd(XMMRegister dst, const Operand& src, int8_t imm8);
void roundsd(XMMRegister dst, XMMRegister src, RoundingMode mode);
// AVX instruction
void vfmadd132sd(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
vfmasd(0x99, dst, src1, src2);
}
void vfmadd213sd(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
vfmasd(0xa9, dst, src1, src2);
}
void vfmadd231sd(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
vfmasd(0xb9, dst, src1, src2);
}
void vfmadd132sd(XMMRegister dst, XMMRegister src1, const Operand& src2) {
vfmasd(0x99, dst, src1, src2);
}
void vfmadd213sd(XMMRegister dst, XMMRegister src1, const Operand& src2) {
vfmasd(0xa9, dst, src1, src2);
}
void vfmadd231sd(XMMRegister dst, XMMRegister src1, const Operand& src2) {
vfmasd(0xb9, dst, src1, src2);
}
void vfmsub132sd(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
vfmasd(0x9b, dst, src1, src2);
}
void vfmsub213sd(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
vfmasd(0xab, dst, src1, src2);
}
void vfmsub231sd(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
vfmasd(0xbb, dst, src1, src2);
}
void vfmsub132sd(XMMRegister dst, XMMRegister src1, const Operand& src2) {
vfmasd(0x9b, dst, src1, src2);
}
void vfmsub213sd(XMMRegister dst, XMMRegister src1, const Operand& src2) {
vfmasd(0xab, dst, src1, src2);
}
void vfmsub231sd(XMMRegister dst, XMMRegister src1, const Operand& src2) {
vfmasd(0xbb, dst, src1, src2);
}
void vfnmadd132sd(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
vfmasd(0x9d, dst, src1, src2);
}
void vfnmadd213sd(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
vfmasd(0xad, dst, src1, src2);
}
void vfnmadd231sd(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
vfmasd(0xbd, dst, src1, src2);
}
void vfnmadd132sd(XMMRegister dst, XMMRegister src1, const Operand& src2) {
vfmasd(0x9d, dst, src1, src2);
}
void vfnmadd213sd(XMMRegister dst, XMMRegister src1, const Operand& src2) {
vfmasd(0xad, dst, src1, src2);
}
void vfnmadd231sd(XMMRegister dst, XMMRegister src1, const Operand& src2) {
vfmasd(0xbd, dst, src1, src2);
}
void vfnmsub132sd(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
vfmasd(0x9f, dst, src1, src2);
}
void vfnmsub213sd(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
vfmasd(0xaf, dst, src1, src2);
}
void vfnmsub231sd(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
vfmasd(0xbf, dst, src1, src2);
}
void vfnmsub132sd(XMMRegister dst, XMMRegister src1, const Operand& src2) {
vfmasd(0x9f, dst, src1, src2);
}
void vfnmsub213sd(XMMRegister dst, XMMRegister src1, const Operand& src2) {
vfmasd(0xaf, dst, src1, src2);
}
void vfnmsub231sd(XMMRegister dst, XMMRegister src1, const Operand& src2) {
vfmasd(0xbf, dst, src1, src2);
}
void vfmasd(byte op, XMMRegister dst, XMMRegister src1, XMMRegister src2);
void vfmasd(byte op, XMMRegister dst, XMMRegister src1, const Operand& src2);
void vfmadd132ss(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
vfmass(0x99, dst, src1, src2);
}
void vfmadd213ss(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
vfmass(0xa9, dst, src1, src2);
}
void vfmadd231ss(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
vfmass(0xb9, dst, src1, src2);
}
void vfmadd132ss(XMMRegister dst, XMMRegister src1, const Operand& src2) {
vfmass(0x99, dst, src1, src2);
}
void vfmadd213ss(XMMRegister dst, XMMRegister src1, const Operand& src2) {
vfmass(0xa9, dst, src1, src2);
}
void vfmadd231ss(XMMRegister dst, XMMRegister src1, const Operand& src2) {
vfmass(0xb9, dst, src1, src2);
}
void vfmsub132ss(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
vfmass(0x9b, dst, src1, src2);
}
void vfmsub213ss(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
vfmass(0xab, dst, src1, src2);
}
void vfmsub231ss(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
vfmass(0xbb, dst, src1, src2);
}
void vfmsub132ss(XMMRegister dst, XMMRegister src1, const Operand& src2) {
vfmass(0x9b, dst, src1, src2);
}
void vfmsub213ss(XMMRegister dst, XMMRegister src1, const Operand& src2) {
vfmass(0xab, dst, src1, src2);
}
void vfmsub231ss(XMMRegister dst, XMMRegister src1, const Operand& src2) {
vfmass(0xbb, dst, src1, src2);
}
void vfnmadd132ss(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
vfmass(0x9d, dst, src1, src2);
}
void vfnmadd213ss(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
vfmass(0xad, dst, src1, src2);
}
void vfnmadd231ss(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
vfmass(0xbd, dst, src1, src2);
}
void vfnmadd132ss(XMMRegister dst, XMMRegister src1, const Operand& src2) {
vfmass(0x9d, dst, src1, src2);
}
void vfnmadd213ss(XMMRegister dst, XMMRegister src1, const Operand& src2) {
vfmass(0xad, dst, src1, src2);
}
void vfnmadd231ss(XMMRegister dst, XMMRegister src1, const Operand& src2) {
vfmass(0xbd, dst, src1, src2);
}
void vfnmsub132ss(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
vfmass(0x9f, dst, src1, src2);
}
void vfnmsub213ss(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
vfmass(0xaf, dst, src1, src2);
}
void vfnmsub231ss(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
vfmass(0xbf, dst, src1, src2);
}
void vfnmsub132ss(XMMRegister dst, XMMRegister src1, const Operand& src2) {
vfmass(0x9f, dst, src1, src2);
}
void vfnmsub213ss(XMMRegister dst, XMMRegister src1, const Operand& src2) {
vfmass(0xaf, dst, src1, src2);
}
void vfnmsub231ss(XMMRegister dst, XMMRegister src1, const Operand& src2) {
vfmass(0xbf, dst, src1, src2);
}
void vfmass(byte op, XMMRegister dst, XMMRegister src1, XMMRegister src2);
void vfmass(byte op, XMMRegister dst, XMMRegister src1, const Operand& src2);
void vaddsd(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
vsd(0x58, dst, src1, src2);
}
void vaddsd(XMMRegister dst, XMMRegister src1, const Operand& src2) {
vsd(0x58, dst, src1, src2);
}
void vsubsd(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
vsd(0x5c, dst, src1, src2);
}
void vsubsd(XMMRegister dst, XMMRegister src1, const Operand& src2) {
vsd(0x5c, dst, src1, src2);
}
void vmulsd(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
vsd(0x59, dst, src1, src2);
}
void vmulsd(XMMRegister dst, XMMRegister src1, const Operand& src2) {
vsd(0x59, dst, src1, src2);
}
void vdivsd(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
vsd(0x5e, dst, src1, src2);
}
void vdivsd(XMMRegister dst, XMMRegister src1, const Operand& src2) {
vsd(0x5e, dst, src1, src2);
}
void vmaxsd(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
vsd(0x5f, dst, src1, src2);
}
void vmaxsd(XMMRegister dst, XMMRegister src1, const Operand& src2) {
vsd(0x5f, dst, src1, src2);
}
void vminsd(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
vsd(0x5d, dst, src1, src2);
}
void vminsd(XMMRegister dst, XMMRegister src1, const Operand& src2) {
vsd(0x5d, dst, src1, src2);
}
void vucomisd(XMMRegister dst, XMMRegister src);
void vucomisd(XMMRegister dst, const Operand& src);
void vsd(byte op, XMMRegister dst, XMMRegister src1, XMMRegister src2);
void vsd(byte op, XMMRegister dst, XMMRegister src1, const Operand& src2);
void vaddss(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
vss(0x58, dst, src1, src2);
}
void vaddss(XMMRegister dst, XMMRegister src1, const Operand& src2) {
vss(0x58, dst, src1, src2);
}
void vsubss(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
vss(0x5c, dst, src1, src2);
}
void vsubss(XMMRegister dst, XMMRegister src1, const Operand& src2) {
vss(0x5c, dst, src1, src2);
}
void vmulss(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
vss(0x59, dst, src1, src2);
}
void vmulss(XMMRegister dst, XMMRegister src1, const Operand& src2) {
vss(0x59, dst, src1, src2);
}
void vdivss(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
vss(0x5e, dst, src1, src2);
}
void vdivss(XMMRegister dst, XMMRegister src1, const Operand& src2) {
vss(0x5e, dst, src1, src2);
}
void vmaxss(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
vss(0x5f, dst, src1, src2);
}
void vmaxss(XMMRegister dst, XMMRegister src1, const Operand& src2) {
vss(0x5f, dst, src1, src2);
}
void vminss(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
vss(0x5d, dst, src1, src2);
}
void vminss(XMMRegister dst, XMMRegister src1, const Operand& src2) {
vss(0x5d, dst, src1, src2);
}
void vucomiss(XMMRegister dst, XMMRegister src);
void vucomiss(XMMRegister dst, const Operand& src);
void vss(byte op, XMMRegister dst, XMMRegister src1, XMMRegister src2);
void vss(byte op, XMMRegister dst, XMMRegister src1, const Operand& src2);
// BMI instruction
void andnq(Register dst, Register src1, Register src2) {
bmi1q(0xf2, dst, src1, src2);
}
void andnq(Register dst, Register src1, const Operand& src2) {
bmi1q(0xf2, dst, src1, src2);
}
void andnl(Register dst, Register src1, Register src2) {
bmi1l(0xf2, dst, src1, src2);
}
void andnl(Register dst, Register src1, const Operand& src2) {
bmi1l(0xf2, dst, src1, src2);
}
void bextrq(Register dst, Register src1, Register src2) {
bmi1q(0xf7, dst, src2, src1);
}
void bextrq(Register dst, const Operand& src1, Register src2) {
bmi1q(0xf7, dst, src2, src1);
}
void bextrl(Register dst, Register src1, Register src2) {
bmi1l(0xf7, dst, src2, src1);
}
void bextrl(Register dst, const Operand& src1, Register src2) {
bmi1l(0xf7, dst, src2, src1);
}
void blsiq(Register dst, Register src) {
Register ireg = {3};
bmi1q(0xf3, ireg, dst, src);
}
void blsiq(Register dst, const Operand& src) {
Register ireg = {3};
bmi1q(0xf3, ireg, dst, src);
}
void blsil(Register dst, Register src) {
Register ireg = {3};
bmi1l(0xf3, ireg, dst, src);
}
void blsil(Register dst, const Operand& src) {
Register ireg = {3};
bmi1l(0xf3, ireg, dst, src);
}
void blsmskq(Register dst, Register src) {
Register ireg = {2};
bmi1q(0xf3, ireg, dst, src);
}
void blsmskq(Register dst, const Operand& src) {
Register ireg = {2};
bmi1q(0xf3, ireg, dst, src);
}
void blsmskl(Register dst, Register src) {
Register ireg = {2};
bmi1l(0xf3, ireg, dst, src);
}
void blsmskl(Register dst, const Operand& src) {
Register ireg = {2};
bmi1l(0xf3, ireg, dst, src);
}
void blsrq(Register dst, Register src) {
Register ireg = {1};
bmi1q(0xf3, ireg, dst, src);
}
void blsrq(Register dst, const Operand& src) {
Register ireg = {1};
bmi1q(0xf3, ireg, dst, src);
}
void blsrl(Register dst, Register src) {
Register ireg = {1};
bmi1l(0xf3, ireg, dst, src);
}
void blsrl(Register dst, const Operand& src) {
Register ireg = {1};
bmi1l(0xf3, ireg, dst, src);
}
void tzcntq(Register dst, Register src);
void tzcntq(Register dst, const Operand& src);
void tzcntl(Register dst, Register src);
void tzcntl(Register dst, const Operand& src);
void lzcntq(Register dst, Register src);
void lzcntq(Register dst, const Operand& src);
void lzcntl(Register dst, Register src);
void lzcntl(Register dst, const Operand& src);
void popcntq(Register dst, Register src);
void popcntq(Register dst, const Operand& src);
void popcntl(Register dst, Register src);
void popcntl(Register dst, const Operand& src);
void bzhiq(Register dst, Register src1, Register src2) {
bmi2q(kNone, 0xf5, dst, src2, src1);
}
void bzhiq(Register dst, const Operand& src1, Register src2) {
bmi2q(kNone, 0xf5, dst, src2, src1);
}
void bzhil(Register dst, Register src1, Register src2) {
bmi2l(kNone, 0xf5, dst, src2, src1);
}
void bzhil(Register dst, const Operand& src1, Register src2) {
bmi2l(kNone, 0xf5, dst, src2, src1);
}
void mulxq(Register dst1, Register dst2, Register src) {
bmi2q(kF2, 0xf6, dst1, dst2, src);
}
void mulxq(Register dst1, Register dst2, const Operand& src) {
bmi2q(kF2, 0xf6, dst1, dst2, src);
}
void mulxl(Register dst1, Register dst2, Register src) {
bmi2l(kF2, 0xf6, dst1, dst2, src);
}
void mulxl(Register dst1, Register dst2, const Operand& src) {
bmi2l(kF2, 0xf6, dst1, dst2, src);
}
void pdepq(Register dst, Register src1, Register src2) {
bmi2q(kF2, 0xf5, dst, src1, src2);
}
void pdepq(Register dst, Register src1, const Operand& src2) {
bmi2q(kF2, 0xf5, dst, src1, src2);
}
void pdepl(Register dst, Register src1, Register src2) {
bmi2l(kF2, 0xf5, dst, src1, src2);
}
void pdepl(Register dst, Register src1, const Operand& src2) {
bmi2l(kF2, 0xf5, dst, src1, src2);
}
void pextq(Register dst, Register src1, Register src2) {
bmi2q(kF3, 0xf5, dst, src1, src2);
}
void pextq(Register dst, Register src1, const Operand& src2) {
bmi2q(kF3, 0xf5, dst, src1, src2);
}
void pextl(Register dst, Register src1, Register src2) {
bmi2l(kF3, 0xf5, dst, src1, src2);
}
void pextl(Register dst, Register src1, const Operand& src2) {
bmi2l(kF3, 0xf5, dst, src1, src2);
}
void sarxq(Register dst, Register src1, Register src2) {
bmi2q(kF3, 0xf7, dst, src2, src1);
}
void sarxq(Register dst, const Operand& src1, Register src2) {
bmi2q(kF3, 0xf7, dst, src2, src1);
}
void sarxl(Register dst, Register src1, Register src2) {
bmi2l(kF3, 0xf7, dst, src2, src1);
}
void sarxl(Register dst, const Operand& src1, Register src2) {
bmi2l(kF3, 0xf7, dst, src2, src1);
}
void shlxq(Register dst, Register src1, Register src2) {
bmi2q(k66, 0xf7, dst, src2, src1);
}
void shlxq(Register dst, const Operand& src1, Register src2) {
bmi2q(k66, 0xf7, dst, src2, src1);
}
void shlxl(Register dst, Register src1, Register src2) {
bmi2l(k66, 0xf7, dst, src2, src1);
}
void shlxl(Register dst, const Operand& src1, Register src2) {
bmi2l(k66, 0xf7, dst, src2, src1);
}
void shrxq(Register dst, Register src1, Register src2) {
bmi2q(kF2, 0xf7, dst, src2, src1);
}
void shrxq(Register dst, const Operand& src1, Register src2) {
bmi2q(kF2, 0xf7, dst, src2, src1);
}
void shrxl(Register dst, Register src1, Register src2) {
bmi2l(kF2, 0xf7, dst, src2, src1);
}
void shrxl(Register dst, const Operand& src1, Register src2) {
bmi2l(kF2, 0xf7, dst, src2, src1);
}
void rorxq(Register dst, Register src, byte imm8);
void rorxq(Register dst, const Operand& src, byte imm8);
void rorxl(Register dst, Register src, byte imm8);
void rorxl(Register dst, const Operand& src, byte imm8);
#define PACKED_OP_LIST(V) \
V(and, 0x54) \
V(xor, 0x57)
#define AVX_PACKED_OP_DECLARE(name, opcode) \
void v##name##ps(XMMRegister dst, XMMRegister src1, XMMRegister src2) { \
vps(opcode, dst, src1, src2); \
} \
void v##name##ps(XMMRegister dst, XMMRegister src1, const Operand& src2) { \
vps(opcode, dst, src1, src2); \
} \
void v##name##pd(XMMRegister dst, XMMRegister src1, XMMRegister src2) { \
vpd(opcode, dst, src1, src2); \
} \
void v##name##pd(XMMRegister dst, XMMRegister src1, const Operand& src2) { \
vpd(opcode, dst, src1, src2); \
}
PACKED_OP_LIST(AVX_PACKED_OP_DECLARE);
void vps(byte op, XMMRegister dst, XMMRegister src1, XMMRegister src2);
void vps(byte op, XMMRegister dst, XMMRegister src1, const Operand& src2);
void vpd(byte op, XMMRegister dst, XMMRegister src1, XMMRegister src2);
void vpd(byte op, XMMRegister dst, XMMRegister src1, const Operand& src2);
// Debugging
void Print();
// Check the code size generated from label to here.
int SizeOfCodeGeneratedSince(Label* label) {
return pc_offset() - label->pos();
}
// Mark address of the ExitJSFrame code.
void RecordJSReturn();
// Mark address of a debug break slot.
void RecordDebugBreakSlot();
// Record a comment relocation entry that can be used by a disassembler.
// Use --code-comments to enable.
void RecordComment(const char* msg);
// Record a deoptimization reason that can be used by a log or cpu profiler.
// Use --trace-deopt to enable.
void RecordDeoptReason(const int reason, const SourcePosition position);
void PatchConstantPoolAccessInstruction(int pc_offset, int offset,
ConstantPoolEntry::Access access,
ConstantPoolEntry::Type type) {
// No embedded constant pool support.
UNREACHABLE();
}
// Writes a single word of data in the code stream.
// Used for inline tables, e.g., jump-tables.
void db(uint8_t data);
void dd(uint32_t data);
void dq(uint64_t data);
void dp(uintptr_t data) { dq(data); }
void dq(Label* label);
PositionsRecorder* positions_recorder() { return &positions_recorder_; }
// Check if there is less than kGap bytes available in the buffer.
// If this is the case, we need to grow the buffer before emitting
// an instruction or relocation information.
inline bool buffer_overflow() const {
return pc_ >= reloc_info_writer.pos() - kGap;
}
// Get the number of bytes available in the buffer.
inline int available_space() const {
return static_cast<int>(reloc_info_writer.pos() - pc_);
}
static bool IsNop(Address addr);
// Avoid overflows for displacements etc.
static const int kMaximalBufferSize = 512*MB;
byte byte_at(int pos) { return buffer_[pos]; }
void set_byte_at(int pos, byte value) { buffer_[pos] = value; }
protected:
// Call near indirect
void call(const Operand& operand);
private:
byte* addr_at(int pos) { return buffer_ + pos; }
uint32_t long_at(int pos) {
return *reinterpret_cast<uint32_t*>(addr_at(pos));
}
void long_at_put(int pos, uint32_t x) {
*reinterpret_cast<uint32_t*>(addr_at(pos)) = x;
}
// code emission
void GrowBuffer();
void emit(byte x) { *pc_++ = x; }
inline void emitl(uint32_t x);
inline void emitp(void* x, RelocInfo::Mode rmode);
inline void emitq(uint64_t x);
inline void emitw(uint16_t x);
inline void emit_code_target(Handle<Code> target,
RelocInfo::Mode rmode,
TypeFeedbackId ast_id = TypeFeedbackId::None());
inline void emit_runtime_entry(Address entry, RelocInfo::Mode rmode);
void emit(Immediate x) { emitl(x.value_); }
// Emits a REX prefix that encodes a 64-bit operand size and
// the top bit of both register codes.
// High bit of reg goes to REX.R, high bit of rm_reg goes to REX.B.
// REX.W is set.
inline void emit_rex_64(XMMRegister reg, Register rm_reg);
inline void emit_rex_64(Register reg, XMMRegister rm_reg);
inline void emit_rex_64(Register reg, Register rm_reg);
// Emits a REX prefix that encodes a 64-bit operand size and
// the top bit of the destination, index, and base register codes.
// The high bit of reg is used for REX.R, the high bit of op's base
// register is used for REX.B, and the high bit of op's index register
// is used for REX.X. REX.W is set.
inline void emit_rex_64(Register reg, const Operand& op);
inline void emit_rex_64(XMMRegister reg, const Operand& op);
// Emits a REX prefix that encodes a 64-bit operand size and
// the top bit of the register code.
// The high bit of register is used for REX.B.
// REX.W is set and REX.R and REX.X are clear.
inline void emit_rex_64(Register rm_reg);
// Emits a REX prefix that encodes a 64-bit operand size and
// the top bit of the index and base register codes.
// The high bit of op's base register is used for REX.B, and the high
// bit of op's index register is used for REX.X.
// REX.W is set and REX.R clear.
inline void emit_rex_64(const Operand& op);
// Emit a REX prefix that only sets REX.W to choose a 64-bit operand size.
void emit_rex_64() { emit(0x48); }
// High bit of reg goes to REX.R, high bit of rm_reg goes to REX.B.
// REX.W is clear.
inline void emit_rex_32(Register reg, Register rm_reg);
// The high bit of reg is used for REX.R, the high bit of op's base
// register is used for REX.B, and the high bit of op's index register
// is used for REX.X. REX.W is cleared.
inline void emit_rex_32(Register reg, const Operand& op);
// High bit of rm_reg goes to REX.B.
// REX.W, REX.R and REX.X are clear.
inline void emit_rex_32(Register rm_reg);
// High bit of base goes to REX.B and high bit of index to REX.X.
// REX.W and REX.R are clear.
inline void emit_rex_32(const Operand& op);
// High bit of reg goes to REX.R, high bit of rm_reg goes to REX.B.
// REX.W is cleared. If no REX bits are set, no byte is emitted.
inline void emit_optional_rex_32(Register reg, Register rm_reg);
// The high bit of reg is used for REX.R, the high bit of op's base
// register is used for REX.B, and the high bit of op's index register
// is used for REX.X. REX.W is cleared. If no REX bits are set, nothing
// is emitted.
inline void emit_optional_rex_32(Register reg, const Operand& op);
// As for emit_optional_rex_32(Register, Register), except that
// the registers are XMM registers.
inline void emit_optional_rex_32(XMMRegister reg, XMMRegister base);
// As for emit_optional_rex_32(Register, Register), except that
// one of the registers is an XMM registers.
inline void emit_optional_rex_32(XMMRegister reg, Register base);
// As for emit_optional_rex_32(Register, Register), except that
// one of the registers is an XMM registers.
inline void emit_optional_rex_32(Register reg, XMMRegister base);
// As for emit_optional_rex_32(Register, const Operand&), except that
// the register is an XMM register.
inline void emit_optional_rex_32(XMMRegister reg, const Operand& op);
// Optionally do as emit_rex_32(Register) if the register number has
// the high bit set.
inline void emit_optional_rex_32(Register rm_reg);
inline void emit_optional_rex_32(XMMRegister rm_reg);
// Optionally do as emit_rex_32(const Operand&) if the operand register
// numbers have a high bit set.
inline void emit_optional_rex_32(const Operand& op);
void emit_rex(int size) {
if (size == kInt64Size) {
emit_rex_64();
} else {
DCHECK(size == kInt32Size);
}
}
template<class P1>
void emit_rex(P1 p1, int size) {
if (size == kInt64Size) {
emit_rex_64(p1);
} else {
DCHECK(size == kInt32Size);
emit_optional_rex_32(p1);
}
}
template<class P1, class P2>
void emit_rex(P1 p1, P2 p2, int size) {
if (size == kInt64Size) {
emit_rex_64(p1, p2);
} else {
DCHECK(size == kInt32Size);
emit_optional_rex_32(p1, p2);
}
}
// Emit vex prefix
enum SIMDPrefix { kNone = 0x0, k66 = 0x1, kF3 = 0x2, kF2 = 0x3 };
enum VectorLength { kL128 = 0x0, kL256 = 0x4, kLIG = kL128, kLZ = kL128 };
enum VexW { kW0 = 0x0, kW1 = 0x80, kWIG = kW0 };
enum LeadingOpcode { k0F = 0x1, k0F38 = 0x2, k0F3A = 0x3 };
void emit_vex2_byte0() { emit(0xc5); }
inline void emit_vex2_byte1(XMMRegister reg, XMMRegister v, VectorLength l,
SIMDPrefix pp);
void emit_vex3_byte0() { emit(0xc4); }
inline void emit_vex3_byte1(XMMRegister reg, XMMRegister rm, LeadingOpcode m);
inline void emit_vex3_byte1(XMMRegister reg, const Operand& rm,
LeadingOpcode m);
inline void emit_vex3_byte2(VexW w, XMMRegister v, VectorLength l,
SIMDPrefix pp);
inline void emit_vex_prefix(XMMRegister reg, XMMRegister v, XMMRegister rm,
VectorLength l, SIMDPrefix pp, LeadingOpcode m,
VexW w);
inline void emit_vex_prefix(Register reg, Register v, Register rm,
VectorLength l, SIMDPrefix pp, LeadingOpcode m,
VexW w);
inline void emit_vex_prefix(XMMRegister reg, XMMRegister v, const Operand& rm,
VectorLength l, SIMDPrefix pp, LeadingOpcode m,
VexW w);
inline void emit_vex_prefix(Register reg, Register v, const Operand& rm,
VectorLength l, SIMDPrefix pp, LeadingOpcode m,
VexW w);
// Emit the ModR/M byte, and optionally the SIB byte and
// 1- or 4-byte offset for a memory operand. Also encodes
// the second operand of the operation, a register or operation
// subcode, into the reg field of the ModR/M byte.
void emit_operand(Register reg, const Operand& adr) {
emit_operand(reg.low_bits(), adr);
}
// Emit the ModR/M byte, and optionally the SIB byte and
// 1- or 4-byte offset for a memory operand. Also used to encode
// a three-bit opcode extension into the ModR/M byte.
void emit_operand(int rm, const Operand& adr);
// Emit a ModR/M byte with registers coded in the reg and rm_reg fields.
void emit_modrm(Register reg, Register rm_reg) {
emit(0xC0 | reg.low_bits() << 3 | rm_reg.low_bits());
}
// Emit a ModR/M byte with an operation subcode in the reg field and
// a register in the rm_reg field.
void emit_modrm(int code, Register rm_reg) {
DCHECK(is_uint3(code));
emit(0xC0 | code << 3 | rm_reg.low_bits());
}
// Emit the code-object-relative offset of the label's position
inline void emit_code_relative_offset(Label* label);
// The first argument is the reg field, the second argument is the r/m field.
void emit_sse_operand(XMMRegister dst, XMMRegister src);
void emit_sse_operand(XMMRegister reg, const Operand& adr);
void emit_sse_operand(Register reg, const Operand& adr);
void emit_sse_operand(XMMRegister dst, Register src);
void emit_sse_operand(Register dst, XMMRegister src);
// Emit machine code for one of the operations ADD, ADC, SUB, SBC,
// AND, OR, XOR, or CMP. The encodings of these operations are all
// similar, differing just in the opcode or in the reg field of the
// ModR/M byte.
void arithmetic_op_8(byte opcode, Register reg, Register rm_reg);
void arithmetic_op_8(byte opcode, Register reg, const Operand& rm_reg);
void arithmetic_op_16(byte opcode, Register reg, Register rm_reg);
void arithmetic_op_16(byte opcode, Register reg, const Operand& rm_reg);
// Operate on operands/registers with pointer size, 32-bit or 64-bit size.
void arithmetic_op(byte opcode, Register reg, Register rm_reg, int size);
void arithmetic_op(byte opcode,
Register reg,
const Operand& rm_reg,
int size);
// Operate on a byte in memory or register.
void immediate_arithmetic_op_8(byte subcode,
Register dst,
Immediate src);
void immediate_arithmetic_op_8(byte subcode,
const Operand& dst,
Immediate src);
// Operate on a word in memory or register.
void immediate_arithmetic_op_16(byte subcode,
Register dst,
Immediate src);
void immediate_arithmetic_op_16(byte subcode,
const Operand& dst,
Immediate src);
// Operate on operands/registers with pointer size, 32-bit or 64-bit size.
void immediate_arithmetic_op(byte subcode,
Register dst,
Immediate src,
int size);
void immediate_arithmetic_op(byte subcode,
const Operand& dst,
Immediate src,
int size);
// Emit machine code for a shift operation.
void shift(Operand dst, Immediate shift_amount, int subcode, int size);
void shift(Register dst, Immediate shift_amount, int subcode, int size);
// Shift dst by cl % 64 bits.
void shift(Register dst, int subcode, int size);
void shift(Operand dst, int subcode, int size);
void emit_farith(int b1, int b2, int i);
// labels
// void print(Label* L);
void bind_to(Label* L, int pos);
// record reloc info for current pc_
void RecordRelocInfo(RelocInfo::Mode rmode, intptr_t data = 0);
// Arithmetics
void emit_add(Register dst, Register src, int size) {
arithmetic_op(0x03, dst, src, size);
}
void emit_add(Register dst, Immediate src, int size) {
immediate_arithmetic_op(0x0, dst, src, size);
}
void emit_add(Register dst, const Operand& src, int size) {
arithmetic_op(0x03, dst, src, size);
}
void emit_add(const Operand& dst, Register src, int size) {
arithmetic_op(0x1, src, dst, size);
}
void emit_add(const Operand& dst, Immediate src, int size) {
immediate_arithmetic_op(0x0, dst, src, size);
}
void emit_and(Register dst, Register src, int size) {
arithmetic_op(0x23, dst, src, size);
}
void emit_and(Register dst, const Operand& src, int size) {
arithmetic_op(0x23, dst, src, size);
}
void emit_and(const Operand& dst, Register src, int size) {
arithmetic_op(0x21, src, dst, size);
}
void emit_and(Register dst, Immediate src, int size) {
immediate_arithmetic_op(0x4, dst, src, size);
}
void emit_and(const Operand& dst, Immediate src, int size) {
immediate_arithmetic_op(0x4, dst, src, size);
}
void emit_cmp(Register dst, Register src, int size) {
arithmetic_op(0x3B, dst, src, size);
}
void emit_cmp(Register dst, const Operand& src, int size) {
arithmetic_op(0x3B, dst, src, size);
}
void emit_cmp(const Operand& dst, Register src, int size) {
arithmetic_op(0x39, src, dst, size);
}
void emit_cmp(Register dst, Immediate src, int size) {
immediate_arithmetic_op(0x7, dst, src, size);
}
void emit_cmp(const Operand& dst, Immediate src, int size) {
immediate_arithmetic_op(0x7, dst, src, size);
}
void emit_dec(Register dst, int size);
void emit_dec(const Operand& dst, int size);
// Divide rdx:rax by src. Quotient in rax, remainder in rdx when size is 64.
// Divide edx:eax by lower 32 bits of src. Quotient in eax, remainder in edx
// when size is 32.
void emit_idiv(Register src, int size);
void emit_div(Register src, int size);
// Signed multiply instructions.
// rdx:rax = rax * src when size is 64 or edx:eax = eax * src when size is 32.
void emit_imul(Register src, int size);
void emit_imul(const Operand& src, int size);
void emit_imul(Register dst, Register src, int size);
void emit_imul(Register dst, const Operand& src, int size);
void emit_imul(Register dst, Register src, Immediate imm, int size);
void emit_imul(Register dst, const Operand& src, Immediate imm, int size);
void emit_inc(Register dst, int size);
void emit_inc(const Operand& dst, int size);
void emit_lea(Register dst, const Operand& src, int size);
void emit_mov(Register dst, const Operand& src, int size);
void emit_mov(Register dst, Register src, int size);
void emit_mov(const Operand& dst, Register src, int size);
void emit_mov(Register dst, Immediate value, int size);
void emit_mov(const Operand& dst, Immediate value, int size);
void emit_movzxb(Register dst, const Operand& src, int size);
void emit_movzxb(Register dst, Register src, int size);
void emit_movzxw(Register dst, const Operand& src, int size);
void emit_movzxw(Register dst, Register src, int size);
void emit_neg(Register dst, int size);
void emit_neg(const Operand& dst, int size);
void emit_not(Register dst, int size);
void emit_not(const Operand& dst, int size);
void emit_or(Register dst, Register src, int size) {
arithmetic_op(0x0B, dst, src, size);
}
void emit_or(Register dst, const Operand& src, int size) {
arithmetic_op(0x0B, dst, src, size);
}
void emit_or(const Operand& dst, Register src, int size) {
arithmetic_op(0x9, src, dst, size);
}
void emit_or(Register dst, Immediate src, int size) {
immediate_arithmetic_op(0x1, dst, src, size);
}
void emit_or(const Operand& dst, Immediate src, int size) {
immediate_arithmetic_op(0x1, dst, src, size);
}
void emit_repmovs(int size);
void emit_sbb(Register dst, Register src, int size) {
arithmetic_op(0x1b, dst, src, size);
}
void emit_sub(Register dst, Register src, int size) {
arithmetic_op(0x2B, dst, src, size);
}
void emit_sub(Register dst, Immediate src, int size) {
immediate_arithmetic_op(0x5, dst, src, size);
}
void emit_sub(Register dst, const Operand& src, int size) {
arithmetic_op(0x2B, dst, src, size);
}
void emit_sub(const Operand& dst, Register src, int size) {
arithmetic_op(0x29, src, dst, size);
}
void emit_sub(const Operand& dst, Immediate src, int size) {
immediate_arithmetic_op(0x5, dst, src, size);
}
void emit_test(Register dst, Register src, int size);
void emit_test(Register reg, Immediate mask, int size);
void emit_test(const Operand& op, Register reg, int size);
void emit_test(const Operand& op, Immediate mask, int size);
void emit_test(Register reg, const Operand& op, int size) {
return emit_test(op, reg, size);
}
void emit_xchg(Register dst, Register src, int size);
void emit_xchg(Register dst, const Operand& src, int size);
void emit_xor(Register dst, Register src, int size) {
if (size == kInt64Size && dst.code() == src.code()) {
// 32 bit operations zero the top 32 bits of 64 bit registers. Therefore
// there is no need to make this a 64 bit operation.
arithmetic_op(0x33, dst, src, kInt32Size);
} else {
arithmetic_op(0x33, dst, src, size);
}
}
void emit_xor(Register dst, const Operand& src, int size) {
arithmetic_op(0x33, dst, src, size);
}
void emit_xor(Register dst, Immediate src, int size) {
immediate_arithmetic_op(0x6, dst, src, size);
}
void emit_xor(const Operand& dst, Immediate src, int size) {
immediate_arithmetic_op(0x6, dst, src, size);
}
void emit_xor(const Operand& dst, Register src, int size) {
arithmetic_op(0x31, src, dst, size);
}
// Most BMI instructions are similiar.
void bmi1q(byte op, Register reg, Register vreg, Register rm);
void bmi1q(byte op, Register reg, Register vreg, const Operand& rm);
void bmi1l(byte op, Register reg, Register vreg, Register rm);
void bmi1l(byte op, Register reg, Register vreg, const Operand& rm);
void bmi2q(SIMDPrefix pp, byte op, Register reg, Register vreg, Register rm);
void bmi2q(SIMDPrefix pp, byte op, Register reg, Register vreg,
const Operand& rm);
void bmi2l(SIMDPrefix pp, byte op, Register reg, Register vreg, Register rm);
void bmi2l(SIMDPrefix pp, byte op, Register reg, Register vreg,
const Operand& rm);
friend class CodePatcher;
friend class EnsureSpace;
friend class RegExpMacroAssemblerX64;
// code generation
RelocInfoWriter reloc_info_writer;
// Internal reference positions, required for (potential) patching in
// GrowBuffer(); contains only those internal references whose labels
// are already bound.
std::deque<int> internal_reference_positions_;
List< Handle<Code> > code_targets_;
PositionsRecorder positions_recorder_;
friend class PositionsRecorder;
};
// Helper class that ensures that there is enough space for generating
// instructions and relocation information. The constructor makes
// sure that there is enough space and (in debug mode) the destructor
// checks that we did not generate too much.
class EnsureSpace BASE_EMBEDDED {
public:
explicit EnsureSpace(Assembler* assembler) : assembler_(assembler) {
if (assembler_->buffer_overflow()) assembler_->GrowBuffer();
#ifdef DEBUG
space_before_ = assembler_->available_space();
#endif
}
#ifdef DEBUG
~EnsureSpace() {
int bytes_generated = space_before_ - assembler_->available_space();
DCHECK(bytes_generated < assembler_->kGap);
}
#endif
private:
Assembler* assembler_;
#ifdef DEBUG
int space_before_;
#endif
};
} } // namespace v8::internal
#endif // V8_X64_ASSEMBLER_X64_H_
```
|
Aktisanes is a Nubian king who is mentioned by the Greek historian Hecataeus of Abdera. He is perhaps identical with Menmaatre-Setepenamun Gatisen known from Nubian sources.
Titles
Horus name: Kanakht Merymaat ("Mighty Bull who loves Equity")
Nebty name: Wer-menu-em-per-itef-Amen-en-nepet ("Whose monuments are great in the house of his father Amun in Napata")
Golden horus name: Ir-sankhy-rekhyu ("Who vivifies the rekhit people")
Prenomen: Menmaatre Setepenamun ("Re is one whose equity endures, chosen one of Amun")
Nomen: Gatisen (Aktisanes)
Gatisen had a Ramesside-style titulary. His Horus name Kanakht-merymaat is the same as the Horus name of Ramesses II (and Osorkon II and Shoshenq III). This is a second reason why he is placed by some scholars around 300 BC.
It had been assumed that in the fourth century BC, there was a Ramesside revival in Nubia. Other researchers have pointed out that the reading of the name Gatisen is uncertain. They place the king before 700 BC and assume that there was no Ramesside revival.
Monuments and inscriptions
His longest text is a now lost building inscription copied by the Lepsius expedition in Nuri, but only published in 1977. The text was only partly preserved. It once most likely adorned a door at a temple in Napata. The names of the king are not preserved, most importantly the nomen Gatisen is missing.
The other inscription is to be found on two adjoining blocks, showing the king in front of Amun-Re-Horachte-Atum. The blocks were found at the Jebel Barkal. In this inscription the throne name and the nomen of the king are preserved, but the nomen Gatisen is difficult to read. The same holds true for a doorjamb from the same place providing the full titulary of the king, but with the nomen only partly preserved.
The name Gatisen has been identified with Aktisanes, known from the Greek historian Hecataeus of Abdera. This identification is not certain, especially because the reading of the name as Gatisen is uncertain. Hecataeus describes Aktisanes as an enemy of the Egyptian king Amasis. This seems unlikely as the earlier Nubian kings are well-known. Therefore and for other reasons it is in general assumed that Hecataeus chose the name of a contemporary Nubian king as he composed his more fictional story.
Burial
Aktisanes was buried at Jebel Barkal. He is thought to have been buried in either pyramid 11 or pyramid 14.
See also
Actisanes
List of monarchs of Kush
References
Literature
Laszlo Török, in: Fontes Historiae Nubiorum, Vol. II, Bergen 1996, 511-520,
4th-century BC monarchs of Kush
3rd-century BC monarchs of Kush
|
```java
/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* published by the Free Software Foundation.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
package org.graalvm.visualizer.search.ui;
import java.awt.event.ActionEvent;
import java.awt.event.ActionListener;
import java.util.Collection;
import java.util.List;
import org.graalvm.visualizer.data.InputNode;
import org.graalvm.visualizer.data.services.GraphViewer;
import org.graalvm.visualizer.view.api.DiagramViewer;
import org.openide.awt.ActionID;
import org.openide.awt.ActionRegistration;
import org.openide.util.Lookup;
/**
*
* @author sdedic
*/
@ActionRegistration(displayName = "Select nodes", lazy = true, surviveFocusChange = true)
@ActionID(category = "Diagram", id = "org.graalvm.visualizer.search.selectnodes")
public class SelectNodesAction implements ActionListener {
private final Collection<InputNode> inputNodes;
public SelectNodesAction(List<InputNode> nodes) {
this.inputNodes = nodes;
}
@Override
public void actionPerformed(ActionEvent e) {
DiagramViewer vwr = Lookup.getDefault().lookup(GraphViewer.class).getActiveViewer();
vwr.getSelections().setSelectedNodes(inputNodes);
}
}
```
|
```java
/**
*
*
* A Processing/Java library for high performance GPU-Computing (GLSL).
*
*/
package OpticalFlow.OpticalFlow_Basic;
import com.thomasdiewald.pixelflow.java.DwPixelFlow;
import com.thomasdiewald.pixelflow.java.imageprocessing.DwOpticalFlow;
import processing.core.*;
import processing.opengl.PGraphics2D;
public class OpticalFlow_Basic extends PApplet {
// A GetStarted-example for using Optical Flow in Applications
//
// based on the direction an object is moving (dx, dy, dt), velocity vectors
// are generated as output.
// To simulate a Movie or Webcam capture, this example simply draws some moving
// stuff.
//
// LMB: (default)
// MMB: velocity vectors are display normal to their direction
// RMB: velocity is displayed as pixelshading
int viewport_w = 1280;
int viewport_h = 720;
int viewport_x = 230;
int viewport_y = 0;
DwOpticalFlow opticalflow;
PGraphics2D pg_oflow;
PGraphics2D pg_src;
public void settings() {
size(viewport_w, viewport_h, P2D);
smooth(8);
}
public void setup() {
surface.setLocation(viewport_x, viewport_y);
// main library context
DwPixelFlow context = new DwPixelFlow(this);
context.print();
context.printGL();
// opticalflow
opticalflow = new DwOpticalFlow(context);
// some flow parameters
opticalflow.param.flow_scale = 100;
opticalflow.param.temporal_smoothing = 0.8f;
opticalflow.param.display_mode = 0;
opticalflow.param.grayscale = true;
// render target
pg_oflow = (PGraphics2D) createGraphics(width, height, P2D);
pg_oflow.smooth(8);
// drawing canvas, used as input for the optical flow
pg_src = (PGraphics2D) createGraphics(width, height, P2D);
pg_src.smooth(8);
frameRate(60);
// frameRate(1000);
}
// animated rectangle data
float rs = 80;
float rx = 100;
float ry = 100;
float dx = 3;
float dy = 2.4f;
public void draw() {
// update rectangle position
rx += dx;
ry += dy;
// keep inside viewport
if(rx < rs/2) {rx = rs/2; dx = -dx; }
if(rx > width -rs/2) {rx = width -rs/2; dx = -dx; }
if(ry < rs/2) {ry = rs/2; dy = -dy; }
if(ry > height-rs/2) {ry = height-rs/2; dy = -dy; }
// update input image
pg_src.beginDraw();
pg_src.clear();
pg_src.background(0);
pg_src.rectMode(CENTER);
pg_src.fill(150, 200, 255);
pg_src.rect(rx, ry, rs, rs, rs/3f);
pg_src.fill(200, 150, 255);
pg_src.noStroke();
pg_src.ellipse(mouseX, mouseY, 100, 100);
pg_src.endDraw();
// update Optical Flow
opticalflow.update(pg_src);
// render Optical Flow
pg_oflow.beginDraw();
pg_oflow.clear();
pg_oflow.endDraw();
// opticalflow visualizations
// 1) velocity is displayed as dense, colored shading
if(mousePressed && mouseButton == RIGHT) opticalflow.renderVelocityShading(pg_oflow);
// 2) velocity is displayed as vectors
// display_mode = 0 --> lines, along the velocity direction
// display_mode = 1 --> lines, normal to the velocity direction
opticalflow.param.display_mode = (mousePressed && mouseButton == CENTER) ? 1 : 0;
opticalflow.renderVelocityStreams(pg_oflow, 10);
// display result
background(0);
image(pg_src, 0, 0);
image(pg_oflow, 0, 0);
// info
String txt_fps = String.format(getClass().getName()+ " [size %d/%d] [frame %d] [fps %6.2f]", pg_oflow.width, pg_oflow.height, opticalflow.UPDATE_STEP, frameRate);
surface.setTitle(txt_fps);
}
public static void main(String args[]) {
PApplet.main(new String[] { OpticalFlow_Basic.class.getName() });
}
}
```
|
Aaron Hayden may refer to:
Aaron Hayden (American football) (born 1973), American football running back
Aaron Hayden (footballer) (born 1997), English football defender
|
This is a list of cities and districts of Okinawa Prefecture, Japan:
Cities
Ginowan
Ishigaki
Itoman
Miyakojima (Formerly Hirara, Gusukube, Irabu, Shimoji, Ueno)
Nago
Naha (capital)
Nanjō (Formerly Sashiki, Chinen, Ōzato, and Tamagusuku)
Okinawa
Tomigusuku
Urasoe
Uruma (Formerly Gushikawa, Ishikawa, Katsuren, and Yonashiro)
Districts
Kunigami
Ginoza
Higashi
Ie
Kin
Kunigami
Motobu
Nakijin
On'na
Oogimi
Miyako
Tarama
Nakagami
Chatan
Kadena
Kitanakagusuku
Nakagusuku
Nishihara
Yomitan
Shimajiri
Aguni
Haebaru
Iheya
Izena
Kitadaitou
Kumejima
Minamidaitō
Tokashiki
Tonaki
Yaese (Formerly Gushikami and Kochinda)
Yonabaru
Zamami
Yaeyama
Taketomi
Yonaguni
Cities in Okinawa Prefecture
|
Non-human (also spelled nonhuman) is any entity displaying some, but not enough, human characteristics to be considered a human. The term has been used in a variety of contexts and may refer to objects that have been developed with human intelligence, such as robots or vehicles.
Animal rights and personhood
In the animal rights movement, it is common to distinguish between "human animals" and "non-human animals". Participants in the animal rights movement generally recognize that non-human animals have some similar characteristics to those of human persons. For example, various non-human animals have been shown to register pain, compassion, memory, and some cognitive function. Some animal rights activists argue that the similarities between human and non-human animals justify giving non-human animals rights that human society has afforded to humans, such as the right to self-preservation, and some even wish for all non-human animals or at least those that bear a fully thinking and conscious mind, such as vertebrates and some invertebrates such as cephalopods, to be given a full right of personhood.
The non-human in philosophy
Contemporary philosophers have drawn on the work of Henri Bergson, Gilles Deleuze, Félix Guattari, and Claude Lévi-Strauss (among others) to suggest that the non-human poses epistemological and ontological problems for humanist and post-humanist ethics, and have linked the study of non-humans to materialist and ethological approaches to the study of society and culture.
Artificial intelligence
The term non-human has been used to describe computer programs and robot-like devices that display some human-like characteristics. In both science fiction and in the real world, computer programs and robots have been built to perform tasks that require human-computer interactions in a manner that suggests sentience and compassion. There is increasing interest in the use of robots in nursing homes and to provide elder care. Computer programs have been used for years in schools to provide one-on-one education with children. The Tamagotchi toy required children to provide care, attention, and nourishment to keep it "alive".
See also
Animal
Animal rights by country or territory
Artificial intelligence
Dehumanization
Person
References
External links
Johnson, Jim. "Mixing Humans and Nonhumans Together: The Sociology of a Door-Closer".
Latour, Bruno. "Will Non-humans be Saved? An Argument in Ecotheology".
Personhood
Artificial intelligence
Critical theory
|
```javascript
import { report } from "../tick";
import "./a";
report("c before");
await 0;
report("c after");
```
|
```kotlin
/*
* that can be found in the LICENSE file.
*/
package org.jetbrains.kotlin.backend.konan.lower
import org.jetbrains.kotlin.backend.common.BodyLoweringPass
import org.jetbrains.kotlin.backend.common.ir.Symbols
import org.jetbrains.kotlin.backend.common.lower.at
import org.jetbrains.kotlin.backend.common.lower.createIrBuilder
import org.jetbrains.kotlin.backend.konan.Context
import org.jetbrains.kotlin.backend.konan.KonanConfigKeys
import org.jetbrains.kotlin.ir.builders.IrBuilderWithScope
import org.jetbrains.kotlin.ir.declarations.IrDeclaration
import org.jetbrains.kotlin.ir.declarations.IrDeclarationBase
import org.jetbrains.kotlin.ir.declarations.IrSymbolOwner
import org.jetbrains.kotlin.ir.expressions.IrBody
import org.jetbrains.kotlin.ir.expressions.IrCall
import org.jetbrains.kotlin.ir.expressions.IrExpression
import org.jetbrains.kotlin.ir.expressions.impl.IrCompositeImpl
import org.jetbrains.kotlin.ir.types.isUnit
import org.jetbrains.kotlin.ir.util.file
import org.jetbrains.kotlin.ir.visitors.IrElementTransformer
/**
* This pass runs before inlining and performs the following additional transformations over some operations:
* - Assertion call removal.
* - First phase of typeOf intrinsic lowering.
*/
internal class PreInlineLowering(val context: Context) : BodyLoweringPass {
private val symbols get() = context.ir.symbols
private val asserts = symbols.asserts
private val enableAssertions = context.config.configuration.getBoolean(KonanConfigKeys.ENABLE_ASSERTIONS)
override fun lower(irBody: IrBody, container: IrDeclaration) {
irBody.transformChildren(object : IrElementTransformer<IrBuilderWithScope> {
override fun visitDeclaration(declaration: IrDeclarationBase, data: IrBuilderWithScope) =
super.visitDeclaration(declaration,
data = (declaration as? IrSymbolOwner)?.let { context.createIrBuilder(it.symbol, it.startOffset, it.endOffset) }
?: data
)
override fun visitCall(expression: IrCall, data: IrBuilderWithScope): IrExpression {
expression.transformChildren(this, data)
return when {
!enableAssertions && expression.symbol in asserts -> {
// Replace assert() call with an empty composite if assertions are not enabled.
require(expression.type.isUnit())
IrCompositeImpl(expression.startOffset, expression.endOffset, expression.type)
}
Symbols.isTypeOfIntrinsic(expression.symbol) -> {
with (KTypeGenerator(context, container.file, expression, needExactTypeParameters = true)) {
data.at(expression).irKType(expression.getTypeArgument(0)!!, leaveReifiedForLater = true)
}
}
else -> expression
}
}
}, data = context.createIrBuilder((container as IrSymbolOwner).symbol, irBody.startOffset, irBody.endOffset))
}
}
```
|
Wolf Creek is an unincorporated community in Lewis and Clark County, Montana, United States, along Interstate 15, north of Helena. Its ZIP code is 59648.
In 1887, the Montana Central Railway built its line through the narrow Prickly Pear Canyon, and the town of Wolf Creek, named for the creek, grew to serve the railroad. It later served workers building the Holter Dam from 1908–1910. Interstate 15 split the town in half, nearly obliterating it.
Demographics
Education
Wolf Creek School District #13 has one elementary school providing education for grades K-5.
6-12 students home district is Helena Schools to the south in Lewis and Clark County
Media
The Cascade Courier is a local newspaper. It is printed weekly and is also available online.
In popular culture
In the movie A River Runs Through It, Wolf Creek is the home of Jessie Burns, the love interest of main character Norman Maclean. It was also a filming locale for parts of the movie Thunderbolt and Lightfoot.
In Australia, the Seven Network's reality television series The World's Strictest Parents featured a family from Wolf Creek, Montana.
In the 1970s, Marlboro selected Wolf Creek resident Herf Ingersoll as their "Marlboro Man."
Climate
According to the Köppen Climate Classification system, Wolf Creek has a semi-arid climate, abbreviated "BSk" on climate maps.
References
Unincorporated communities in Lewis and Clark County, Montana
Unincorporated communities in Montana
|
```java
/*
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
/** Nexmark test suite. */
package org.apache.beam.sdk.nexmark;
```
|
Riverleigh is a rural locality in the North Burnett Region, Queensland, Australia. In the , Riverleigh had a population of 80 people.
Geography
The locality is bounded to the north, west and south by the Burnett River. The land is used for farming.
History
Riverleigh State School opened 15 October 1913. It was mothballed on 31 December 2009 and closed on 31 December 2010. The school was located at 289 Coonambula-Eidsvold Road (). The school's website was archived.
A Methodist church opened at Riverleigh in 1921. In 1928, it was decided to relocate the church building to be nearer to the state school, with the church being re-opened in the new location on Sunday 21 October 1928.
The Monto railway line was extended to Mundubbera on 3 February 1914. The next stage to Ceratodus which passed through Riverleigh was opened on 26 April 1924, with Riverleigh being served by:
Lacon railway station ()
Riverleigh railway station ()
Riverleigh Apostolic Church opened on Sunday 27 May 1928 by the Reverend Jacob Dietz. The four-acre site included an earlier church and cemetery.
The last train on the Monto railway line was in 2008 and in 2012 the line was officially closed.
In the , Riverleigh had a population of 80 people.
Education
There are no schools in Riverleigh. The nearest school is Mundubbera State School in neighbouring Mundubbera to the east which offers Prep-10 education. For Years 11-12 education, the nearest school is Eidsvold State School at Eidsvold to the north-west.
References
North Burnett Region
Localities in Queensland
|
Guillermo Martín Farré (born 16 August 1981) is an Argentine football manager and former player who played as a midfielder. He is the current manager of Belgrano.
Career
Farré played club football for Belgrano. He scored a famous goal in the second leg of the club's 2010–11 Primera B Nacional promotion playoff victory over River Plate.
After he retired from playing, Farré became an assistant of Ricardo Zielinski at Estudiantes de La Plata before becoming the manager of former side Belgrano on 19 May 2021. He led Belgrano to the 2022 Primera Nacional title.
Managerial statistics
Honours
Manager
Belgrano
Primera Nacional: 2022
References
External links
1981 births
Living people
Argentine men's footballers
Men's association football midfielders
Argentine Primera División players
Central Córdoba de Rosario footballers
Club Atlético Belgrano footballers
Club Atlético Sarmiento footballers
Club Atlético Mitre footballers
Estudiantes de Río Cuarto footballers
Argentine football managers
Club Atlético Belgrano managers
|
The Order of Free Gardeners is a fraternal society that was founded in Scotland in the middle of the 17th century and later spread to England and Ireland. Like numerous other friendly societies of the time, its principal aim was the sharing of secret knowledge linked to the profession and mutual aid. In the 19th century, its activities of mutual insurance became predominant. By the end of the 20th century, it had become almost entirely extinct, but that can be revised due to some growth in the early 21st century.
In 1849, The Ancient Order of Free Gardeners Scotland formed at Penicuik. In 1956, due to falling attendances in Scotland, the Grand Lodge charter was transferred to Cape Town, South Africa. In September 2005, the Ancient Order returned to Scotland when the Countess of Elgin Lodge no. 105 received its Charter to meet in Dysart, Fife. 2006 sees the return of the Grand Lodge of Free Gardeners Scotland from Cape Town to Scotland.
Although the Free Gardeners have always remained independent of Freemasonry, the history and organisation of the two orders show numerous similarities. Some commentators have pointed to possible mutual influences in the ancient history of the two organisations.
History
The most ancient evidence of the order is a record of the minutes of the Haddington lodge, opened 16 August 1676, which begins with a compilation of fifteen rules called Interjunctions for ye Fraternity of Gardiners of East Lothian.
Scotland was, in the 17th century, subject to civil unrest and intermittent famines. Rich landowners were interested in Renaissance architecture and the design of formal gardens for their vast estates. The first members of the Haddington lodge were not gardeners by profession, but small landowners and farmers who practised gardening for pleasure. Not practising an urban profession, they could not obtain the status of an incorporation (similar to a guild in England) and modelled their organisation on the masons, who had an organisation, additional to and independent of their incorporation: the lodge.
This organisation set up in Haddington could be viewed as a primitive form of trade union. It organised co-operation between members, provided practical training and ethical development, and supported the poor, widows, and orphans. The lodges of gardeners were also the first to organise floral exhibitions, from 1772.
About 1715, a lodge similar to Haddington was founded in Dunfermline, supported by two members of the local aristocracy, the Earl of Moray and the Marquess of Tweeddale. From its origin, it admitted numerous non-gardeners as members. It created a charitable society to benefit the widows, orphans, and poor of the lodge, sponsored a horse race and organised an annual horticultural fair before transforming itself little by little into a mutual aid society. It reached a membership of 212.
The lodges of Haddington and Dunfermline expanded their recruitment area widely without authorising creation of new lodges. It was only in 1796 that three new lodges were created: at Arbroath, Bothwell, and Cumbnathan.
During the 18th century, about twenty other lodges were created, always in Scotland, and on 6 November 1849, they organised a meeting with a view to create a Grand Lodge. Establishments then accelerated, and in 1859, in Edinburgh, the Grand Lodge gathered representatives from more than 100 lodges, including three established in the USA.
At the peak of the movement there were more than 10,000 Free Gardeners for the Lothians alone, belonging to more than 50 lodges.
Encouraged by this success, competing horticultural societies appeared during the 19th century. Unlike the Free Gardeners, they did not have a charitable role, mutual help, or rituals, and they would accept anybody, male or female, who paid their dues.
In the 20th century, the two World Wars called up most of the members. The economic crisis of 1929 weakened their charitable capacities. The social protection laws weakened the attraction of mutual aid, before the National Insurance Act 1946 removed their entire purpose. Even before the Second World War, the number of deaths exceeded the number of admissions to the lodges. In 1939, the minutes of the Haddington lodge were interrupted until 1952, when its eight last members attempted in vain to relaunch it. Despite the recruitment of new members, the Haddington fraternity pronounced its dissolution on 22 February 1953. The Dunfermline lodge lasted until the middle of the 1980s.
These disappearances were part of a wider social change. In 1950 there were around 30,000 Friendly Societies in the UK, while in 2000 there were fewer than 150. In 2000, the research of R. Cooper counted no more than a single lodge (in Bristol) for Great Britain, but mentioned the survival of the Order of Free Gardeners in the Antilles (Caribbean British Order of Free Gardners) and in Australia. In 2002, a conservation society was created in Scotland with aims of research and conservation of the traditions of this Order and some lodges were revived on this occasion.
As of 2013, The Grand United Order of Free Gardeners still operates in Victoria, Australia from the East Kew Masonic Centre. It meets monthly under the auspices of the Victorian Grand Lodge No. 1, and is the only known lodge operating in the southern hemisphere. In the 2020s, Free Gardeners experienced a significant growth spurt, with new lodges being formed in Schwetzingen, Germany, Edmonton, Canada and elsewhere, with a lineage back to the Scottish Grand Lodge (but not directly affiliated with it).
Ritual
Fraternity documents from the end of the 17th century reveal no trace of secret knowledge or rituals. However, the interest rapidly shown by the members of the aristocracy suggests this association did not exclusively deal with mutual assurance.
The oldest known mention of the existence of an initiation secret in this order appears on 28 January 1726, when the fraternity studied an internal complaint that accused one of its members of defaming certain of its officers in saying they could not correctly give its words and signs. In 1772, other documents established that the fraternity of the Free Gardeners had 'Words' and 'Secrets'. An 1848 document mentions a teaching, in the form of 'Signs, Secrets and Grips'. Historians have at their disposal complete rituals of the Apprentice, Companion and Master dating from 1930. Minutes of the lodges show that the ritual of the order progressively developed, from a fairly basic ceremony of transmission of the 'Word' at its very beginnings, to a system of three grades similar to that of Freemasonry at the end of the 19th century.
A conference of 1873 indicates that Free Gardening used the cultivation of soil as the symbol of the nurturing of the spirit in intelligence and virtue and made reference to the Garden of Eden.
The admission ritual of the Free Gardeners' apprentices shows many similarities to that of Freemason apprentices. Adam could thus symbolically be the first Free Gardener. Use is made of the compass and the square, to which is added the pruning knife, presented as 'the simplest tool of gardening', allowing 'pruning the vices and propagating virtues by cuttings'. At the end of this ceremony, the apprentice received the apron of his grade.
The second degree made reference to Noah, the 'second Gardener' and made the Companion symbolically accomplish a voyage that led him towards the Garden of Eden then towards that of Gethsemane.
The third degree made reference to Solomon, the 'third Gardener', and to the symbol of the olive tree.
The aprons are of two types:
Long aprons, reaching the ankle, embroidered with numerous symbols relating to the legends of the order.
Shorter aprons, with a semi-circular bib, strongly resembling the aprons of the Freemasons of Scotland. That of the president is embroidered with the letters P, G, H, E, initials of Pishon, Gihon, Hiddekel (Tigris) and Euphrates (the four rivers of the Garden of Eden) and A, N, S, initials of Adam, Noah and Solomon, to which is added the letter O, probably for 'Olive'.
Generally, the symbolism used by the Free Gardeners seems to have been strongly influenced during the 19th century by that of Freemasonry.
On numerous objects of the order dating from the very beginning of the 20th century, one finds an emblem composed of a square, a compass and a grafting knife. As there is not a trace of this emblem in the earlier documents, it is probable that it had also been inspired lately by that of Freemasonry.
The first members
There is little information on the professions of the members before the end of the 17th century. During this period the Haddington lodge included merchants, tailors and clerks as well as gardeners. All the members of the lodge were originally from the county. On the other hand, the lodge at Dunfermline, former capital of Scotland, prided itself on counting among its members "numerous renowned persons of Edinburgh, as well as East Lothian including the Marquess of Tweeddale, the count of Haddington (Earl of Haddington), Lord William Hay etc".
The first record of the Dunfermline lodge was established in 1716 with the signatures of 214 members. At this time the membership was composed of a majority of gardeners by trade, but also numerous artisans and two members of the local aristocracy. Rapidly, the membership grew and the social level rose—to the point that the professional gardeners no longer formed the majority of new members—but the recruitment remained local. In 1721, 101 new members of all social statuses were admitted into the lodge, from gardeners and butchers to the Duke of Atholl. The following years saw a fairly large number of aristocrats initiated in Free Gardening in the Dunfermline lodge, even while they remain on the edge of the Haddington lodge, which remains mainly active. Most of these people possess famous gardens. Starting from 1736, the date of the creation of the (Masonic) Grand Lodge of Scotland, this tendency ceased and there were no more initiations of aristocrats in the Dunfermline lodge.
Religiously, all the members of this time were Protestants and belonged to the Church of Scotland. Politically, on the other hand, there were all types.
Comparisons with Freemasonry
In the 1720s, Scotland had a profusion of societies, fraternities, and clubs. Freemasonry and the Order of Free Gardeners are merely those that spread the furthest and lasted the longest.
Those two orders present important similarities concerning their organisation and development. Both were born in Scotland in the middle of the 17th century among groups of professional workers who very quickly accepted members from other professions. In both cases, members of the original profession became minorities from the beginning of the 18th century. In both orders also, certain lodges open very rapidly to 'accepted' members and in particular to the local nobility, whereas others, like that of Haddington for the Free Gardeners and that of Edinburgh for the Freemasons, are more reticent.
Almost all known members who belonged to the two orders were Free Gardeners before becoming Freemasons. The largest group of Free Gardeners who later became Freemasons joined the Kilwinning Scots Arms Masonic lodge founded in 1729. There were nine members of the free gardeners Dunfermline lodge. None of them were gardeners by trade; they were aristocrats and soldiers.
Freemasonry expanded rapidly in England and, after creation of the Grand Lodge in London in 1717, across the entire world. On the other hand, the Order of Free Gardeners remained principally Scottish. In both cases, the Scottish lodges seemed to have difficulties grouping together into larger structures called Grand Lodges. In the case of the Order of Free Gardeners, the first Grand Lodge only formed in 1849, and 15 lodges remained independent until the disappearance of the order. In both cases, it is in particular the lodges founded before their Grand Lodge that remain the most reluctant to renounce their independence.
Miscellaneous
Ancient Free Gardeners, an indie-rock band in Melbourne, Australia, takes its name from the Free Gardeners, though the group has no association. The inspiration came from a visit to the Melbourne branch of the Free Gardeners, situated in Elizabeth Street, one block north of the Victoria Market. Whilst the Free Gardeners no longer meet at that location, the building still bears its logo and inscription.
See also
Freemasonry
Friendly Society
Secret society
References
Further reading
Robert L.D. Cooper. The Origin and History of the Order of Free Gardeners, Quatuor Coronati Lodge, No.2076 (2000)
Robert L.D. Cooper. Les francs-jardiniers, Ivoire Clair (ed) (2000)
Robert L. D Cooper. Freemasons, Templars and Gardeners ANZMRC (Melbourne 2005)
The Free Gardeners website at HistoryShelf.org (Consulted 18 March 2007)
W. Gow. A Historical Sketch from the Records of the Ancient Society of Gardeners, Dunfermline (1910)
External links
Ancient Order of Free Gardeners on the Grand Lodge of British Columbia and Yukon website (consulted 13 March 2007).
Website of the Adelphi Bluebell Lodge No. 4 of Free Gardeners in Uddingston, South Lanarkshire, Scotland (consulted 13 March 2007).
Website of the Hanging Gardens of Babylon Lodge No 13 of Free Gardeners of England, London.
Ancient Free Gardeners – web site of the Melbourne, Australia band taking its name from the Order of Free Gardeners.
17th-century establishments in Scotland
Fraternal orders
Organizations established in the 17th century
Secret societies in the United Kingdom
|
```php
<?php
declare(strict_types=1);
namespace Laratrust\Tests\Checkers\User;
class AbilityQueryCheckerTest extends AbilityCheckerTestCase
{
protected function setUp(): void
{
parent::setUp();
$this->app['config']->set('laratrust.checker', 'query');
}
public function testAbilityShouldReturnBoolean()
{
$this->abilityShouldReturnBooleanAssertions();
}
public function testAbilityShouldReturnArray()
{
$this->abilityShouldReturnArrayAssertions();
}
public function testAbilityShouldReturnBoth()
{
$this->abilityShouldReturnBothAssertions();
}
public function testAbilityShouldAcceptStrings()
{
$this->abilityShouldAcceptStringsAssertions();
}
public function testAbilityDefaultOptions()
{
$this->abilityDefaultOptionsAssertions();
}
public function testAbilityShouldThrowInvalidArgumentException()
{
$this->abilityShouldThrowInvalidArgumentExceptionAssertions();
}
}
```
|
```objective-c
#import <Foundation/Foundation.h>
@interface PodsDummy_M13ProgressSuite : NSObject
@end
@implementation PodsDummy_M13ProgressSuite
@end
```
|
```go
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
package ssh
import (
"crypto"
"crypto/rand"
"fmt"
"io"
"math"
"sync"
_ "crypto/sha1"
_ "crypto/sha256"
_ "crypto/sha512"
)
// These are string constants in the SSH protocol.
const (
compressionNone = "none"
serviceUserAuth = "ssh-userauth"
serviceSSH = "ssh-connection"
)
// supportedCiphers specifies the supported ciphers in preference order.
var supportedCiphers = []string{
"aes128-ctr", "aes192-ctr", "aes256-ctr",
"aes128-gcm@openssh.com",
"arcfour256", "arcfour128",
}
// supportedKexAlgos specifies the supported key-exchange algorithms in
// preference order.
var supportedKexAlgos = []string{
kexAlgoCurve25519SHA256,
// P384 and P521 are not constant-time yet, but since we don't
// reuse ephemeral keys, using them for ECDH should be OK.
kexAlgoECDH256, kexAlgoECDH384, kexAlgoECDH521,
kexAlgoDH14SHA1, kexAlgoDH1SHA1,
}
// supportedHostKeyAlgos specifies the supported host-key algorithms (i.e. methods
// of authenticating servers) in preference order.
var supportedHostKeyAlgos = []string{
CertAlgoRSAv01, CertAlgoDSAv01, CertAlgoECDSA256v01,
CertAlgoECDSA384v01, CertAlgoECDSA521v01, CertAlgoED25519v01,
KeyAlgoECDSA256, KeyAlgoECDSA384, KeyAlgoECDSA521,
KeyAlgoRSA, KeyAlgoDSA,
KeyAlgoED25519,
}
// supportedMACs specifies a default set of MAC algorithms in preference order.
// This is based on RFC 4253, section 6.4, but with hmac-md5 variants removed
// because they have reached the end of their useful life.
var supportedMACs = []string{
"hmac-sha2-256-etm@openssh.com", "hmac-sha2-256", "hmac-sha1", "hmac-sha1-96",
}
var supportedCompressions = []string{compressionNone}
// hashFuncs keeps the mapping of supported algorithms to their respective
// hashes needed for signature verification.
var hashFuncs = map[string]crypto.Hash{
KeyAlgoRSA: crypto.SHA1,
KeyAlgoDSA: crypto.SHA1,
KeyAlgoECDSA256: crypto.SHA256,
KeyAlgoECDSA384: crypto.SHA384,
KeyAlgoECDSA521: crypto.SHA512,
CertAlgoRSAv01: crypto.SHA1,
CertAlgoDSAv01: crypto.SHA1,
CertAlgoECDSA256v01: crypto.SHA256,
CertAlgoECDSA384v01: crypto.SHA384,
CertAlgoECDSA521v01: crypto.SHA512,
}
// unexpectedMessageError results when the SSH message that we received didn't
// match what we wanted.
func unexpectedMessageError(expected, got uint8) error {
return fmt.Errorf("ssh: unexpected message type %d (expected %d)", got, expected)
}
// parseError results from a malformed SSH message.
func parseError(tag uint8) error {
return fmt.Errorf("ssh: parse error in message type %d", tag)
}
func findCommon(what string, client []string, server []string) (common string, err error) {
for _, c := range client {
for _, s := range server {
if c == s {
return c, nil
}
}
}
return "", fmt.Errorf("ssh: no common algorithm for %s; client offered: %v, server offered: %v", what, client, server)
}
type directionAlgorithms struct {
Cipher string
MAC string
Compression string
}
// rekeyBytes returns a rekeying intervals in bytes.
func (a *directionAlgorithms) rekeyBytes() int64 {
// According to RFC4344 block ciphers should rekey after
// 2^(BLOCKSIZE/4) blocks. For all AES flavors BLOCKSIZE is
// 128.
switch a.Cipher {
case "aes128-ctr", "aes192-ctr", "aes256-ctr", gcmCipherID, aes128cbcID:
return 16 * (1 << 32)
}
// For others, stick with RFC4253 recommendation to rekey after 1 Gb of data.
return 1 << 30
}
type algorithms struct {
kex string
hostKey string
w directionAlgorithms
r directionAlgorithms
}
func findAgreedAlgorithms(clientKexInit, serverKexInit *kexInitMsg) (algs *algorithms, err error) {
result := &algorithms{}
result.kex, err = findCommon("key exchange", clientKexInit.KexAlgos, serverKexInit.KexAlgos)
if err != nil {
return
}
result.hostKey, err = findCommon("host key", clientKexInit.ServerHostKeyAlgos, serverKexInit.ServerHostKeyAlgos)
if err != nil {
return
}
result.w.Cipher, err = findCommon("client to server cipher", clientKexInit.CiphersClientServer, serverKexInit.CiphersClientServer)
if err != nil {
return
}
result.r.Cipher, err = findCommon("server to client cipher", clientKexInit.CiphersServerClient, serverKexInit.CiphersServerClient)
if err != nil {
return
}
result.w.MAC, err = findCommon("client to server MAC", clientKexInit.MACsClientServer, serverKexInit.MACsClientServer)
if err != nil {
return
}
result.r.MAC, err = findCommon("server to client MAC", clientKexInit.MACsServerClient, serverKexInit.MACsServerClient)
if err != nil {
return
}
result.w.Compression, err = findCommon("client to server compression", clientKexInit.CompressionClientServer, serverKexInit.CompressionClientServer)
if err != nil {
return
}
result.r.Compression, err = findCommon("server to client compression", clientKexInit.CompressionServerClient, serverKexInit.CompressionServerClient)
if err != nil {
return
}
return result, nil
}
// If rekeythreshold is too small, we can't make any progress sending
// stuff.
const minRekeyThreshold uint64 = 256
// Config contains configuration data common to both ServerConfig and
// ClientConfig.
type Config struct {
// Rand provides the source of entropy for cryptographic
// primitives. If Rand is nil, the cryptographic random reader
// in package crypto/rand will be used.
Rand io.Reader
// The maximum number of bytes sent or received after which a
// new key is negotiated. It must be at least 256. If
// unspecified, a size suitable for the chosen cipher is used.
RekeyThreshold uint64
// The allowed key exchanges algorithms. If unspecified then a
// default set of algorithms is used.
KeyExchanges []string
// The allowed cipher algorithms. If unspecified then a sensible
// default is used.
Ciphers []string
// The allowed MAC algorithms. If unspecified then a sensible default
// is used.
MACs []string
}
// SetDefaults sets sensible values for unset fields in config. This is
// exported for testing: Configs passed to SSH functions are copied and have
// default values set automatically.
func (c *Config) SetDefaults() {
if c.Rand == nil {
c.Rand = rand.Reader
}
if c.Ciphers == nil {
c.Ciphers = supportedCiphers
}
var ciphers []string
for _, c := range c.Ciphers {
if cipherModes[c] != nil {
// reject the cipher if we have no cipherModes definition
ciphers = append(ciphers, c)
}
}
c.Ciphers = ciphers
if c.KeyExchanges == nil {
c.KeyExchanges = supportedKexAlgos
}
if c.MACs == nil {
c.MACs = supportedMACs
}
if c.RekeyThreshold == 0 {
// cipher specific default
} else if c.RekeyThreshold < minRekeyThreshold {
c.RekeyThreshold = minRekeyThreshold
} else if c.RekeyThreshold >= math.MaxInt64 {
// Avoid weirdness if somebody uses -1 as a threshold.
c.RekeyThreshold = math.MaxInt64
}
}
// buildDataSignedForAuth returns the data that is signed in order to prove
// possession of a private key. See RFC 4252, section 7.
func buildDataSignedForAuth(sessionID []byte, req userAuthRequestMsg, algo, pubKey []byte) []byte {
data := struct {
Session []byte
Type byte
User string
Service string
Method string
Sign bool
Algo []byte
PubKey []byte
}{
sessionID,
msgUserAuthRequest,
req.User,
req.Service,
req.Method,
true,
algo,
pubKey,
}
return Marshal(data)
}
func appendU16(buf []byte, n uint16) []byte {
return append(buf, byte(n>>8), byte(n))
}
func appendU32(buf []byte, n uint32) []byte {
return append(buf, byte(n>>24), byte(n>>16), byte(n>>8), byte(n))
}
func appendU64(buf []byte, n uint64) []byte {
return append(buf,
byte(n>>56), byte(n>>48), byte(n>>40), byte(n>>32),
byte(n>>24), byte(n>>16), byte(n>>8), byte(n))
}
func appendInt(buf []byte, n int) []byte {
return appendU32(buf, uint32(n))
}
func appendString(buf []byte, s string) []byte {
buf = appendU32(buf, uint32(len(s)))
buf = append(buf, s...)
return buf
}
func appendBool(buf []byte, b bool) []byte {
if b {
return append(buf, 1)
}
return append(buf, 0)
}
// newCond is a helper to hide the fact that there is no usable zero
// value for sync.Cond.
func newCond() *sync.Cond { return sync.NewCond(new(sync.Mutex)) }
// window represents the buffer available to clients
// wishing to write to a channel.
type window struct {
*sync.Cond
win uint32 // RFC 4254 5.2 says the window size can grow to 2^32-1
writeWaiters int
closed bool
}
// add adds win to the amount of window available
// for consumers.
func (w *window) add(win uint32) bool {
// a zero sized window adjust is a noop.
if win == 0 {
return true
}
w.L.Lock()
if w.win+win < win {
w.L.Unlock()
return false
}
w.win += win
// It is unusual that multiple goroutines would be attempting to reserve
// window space, but not guaranteed. Use broadcast to notify all waiters
// that additional window is available.
w.Broadcast()
w.L.Unlock()
return true
}
// close sets the window to closed, so all reservations fail
// immediately.
func (w *window) close() {
w.L.Lock()
w.closed = true
w.Broadcast()
w.L.Unlock()
}
// reserve reserves win from the available window capacity.
// If no capacity remains, reserve will block. reserve may
// return less than requested.
func (w *window) reserve(win uint32) (uint32, error) {
var err error
w.L.Lock()
w.writeWaiters++
w.Broadcast()
for w.win == 0 && !w.closed {
w.Wait()
}
w.writeWaiters--
if w.win < win {
win = w.win
}
w.win -= win
if w.closed {
err = io.EOF
}
w.L.Unlock()
return win, err
}
// waitWriterBlocked waits until some goroutine is blocked for further
// writes. It is used in tests only.
func (w *window) waitWriterBlocked() {
w.Cond.L.Lock()
for w.writeWaiters == 0 {
w.Cond.Wait()
}
w.Cond.L.Unlock()
}
```
|
```java
package com.yahoo.search.yql;
import com.google.common.collect.Sets;
import org.antlr.v4.runtime.Parser;
import org.antlr.v4.runtime.TokenStream;
import org.antlr.v4.runtime.tree.ParseTree;
import java.util.Set;
/**
* Provides semantic helper functions to Parser.
*/
abstract class ParserBase extends Parser {
private static String arrayRuleName = "array";
public ParserBase(TokenStream input) {
super(input);
}
private Set<String> arrayParameters = Sets.newHashSet();
public void registerParameter(String name, String typeName) {
if (typeName.equals(arrayRuleName)) {
arrayParameters.add(name);
}
}
public boolean isArrayParameter(ParseTree nameNode) {
String name = nameNode.getText();
if (name.startsWith("@")) {
name = name.substring(1);
}
return name != null && arrayParameters.contains(name);
}
}
```
|
The Berliner Festspiele (German for Berlin Festivals) in Berlin organise and stage a large number of independent festivals as well as exhibitions and individual events in the fields of music, theatre, performance, dance, literature and visual arts throughout the year. Events are held at the Haus der Berliner Festspiele, a pre-existing theatre devolved to that purpose in 2001, as well as at the Martin-Gropius-Bau and other venues.
The first of these events were the Berliner Festwochen (classical music) and the Berlin International Film Festival, in 1951. They contributed to the cultural life of West Berlin in divided Germany, before being expanded into the Eastern part of the city following Reunification.
Festivals of the Berliner Festspiele include:
MaerzMusik – Festival of Contemporary Issues, in March.
Theatertreffen Berlin, in May.
Musikfest Berlin, in September.
JazzFest Berlin, in early November.
Immersion, all year long.
Treffen junge Szene (Competition for young artists):
Theatertreffen der Jugend, in late May and early June.
Tanztreffen der Jugend, in late September.
Treffen junger Autor*innen, in mid-November.
Treffen Junge Musikszene, in late November.
References
External links
Berliner Festspiele official site
Berliner Festspiele history
Music festivals established in 1951
Organizations established in 1951
Organisations based in Berlin
Theatres in Berlin
Tourist attractions in Berlin
Music festivals in Berlin
Arts centres in Germany
1951 establishments in Germany
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.