text
stringlengths 1
22.8M
|
|---|
```objective-c
#pragma once
#include <string>
#include "envoy/stats/scope.h"
#include "envoy/stats/stats_macros.h"
namespace Envoy {
namespace Extensions {
namespace NetworkFilters {
namespace DubboProxy {
/**
* All dubbo filter stats. @see stats_macros.h
*/
#define ALL_DUBBO_FILTER_STATS(COUNTER, GAUGE, HISTOGRAM) \
COUNTER(cx_destroy_local_with_active_rq) \
COUNTER(cx_destroy_remote_with_active_rq) \
COUNTER(local_response_business_exception) \
COUNTER(local_response_error) \
COUNTER(local_response_success) \
COUNTER(request) \
COUNTER(request_decoding_error) \
COUNTER(request_decoding_success) \
COUNTER(request_event) \
COUNTER(request_oneway) \
COUNTER(request_twoway) \
COUNTER(response) \
COUNTER(response_business_exception) \
COUNTER(response_decoding_error) \
COUNTER(response_decoding_success) \
COUNTER(response_error) \
COUNTER(response_error_caused_connection_close) \
COUNTER(response_success) \
GAUGE(request_active, Accumulate) \
HISTOGRAM(request_time_ms, Milliseconds)
/**
* Struct definition for all dubbo proxy stats. @see stats_macros.h
*/
struct DubboFilterStats {
ALL_DUBBO_FILTER_STATS(GENERATE_COUNTER_STRUCT, GENERATE_GAUGE_STRUCT, GENERATE_HISTOGRAM_STRUCT)
static DubboFilterStats generateStats(const std::string& prefix, Stats::Scope& scope) {
return DubboFilterStats{ALL_DUBBO_FILTER_STATS(POOL_COUNTER_PREFIX(scope, prefix),
POOL_GAUGE_PREFIX(scope, prefix),
POOL_HISTOGRAM_PREFIX(scope, prefix))};
}
};
} // namespace DubboProxy
} // namespace NetworkFilters
} // namespace Extensions
} // namespace Envoy
```
|
Nicoline Christine Hambro (née Harbitz; 1 January 1861 – 9 May 1926) was a Norwegian politician and proponent for women's rights. She was born in Bergen; the daughter of Niels Andreas Harbitz and Elisabeth Christine Harbitz. She married educator Edvard Isak Hambro in 1880, and was the mother of politician C. J. Hambro and educator Elise Hambro. She took actively part in the administration of several contemporary political and social issues, such as welfare undertakings for female sailors and seamstresses, female police, homes for prostitutes, and pauperism. She was also a member of the Bergen City Council. She served as president of the Norwegian National Women's Council from 1916 to 1922. In 1919 she translated a collection of the adventurous stories about Baron Munchausen into Norwegian language.
References
Norwegian women's rights activists
1861 births
1926 deaths
Norwegian feminists
Norwegian translators
Politicians from Bergen
20th-century Norwegian politicians
20th-century Norwegian women politicians
Norwegian Association for Women's Rights people
|
Hakeem Muata Oluseyi (born James Edward Plummer, Jr.; March 13, 1967) is an American astrophysicist, cosmologist, inventor, educator, science communicator, author, actor, veteran, and humanitarian.
Early life and education
Oluseyi was born James Edward Plummer, Jr. in New Orleans, Louisiana. After his parents divorced when he was four years old, he and his mother moved to a different state along the southern border of the US every year. He lived in some of the country's toughest neighborhoods including the 9th Ward of New Orleans; Watts, Los Angeles, California; Inglewood, California; South Park, Houston, Texas; and Third Ward, Houston, Texas before settling in rural Mississippi a month before Oluseyi turned 13 years old. He completed middle school and high school in the East Jasper School District graduating as his high school's valedictorian in 1985. Oluseyi served in the U.S. Navy from 1984 to 1986. He credits the Navy with teaching him algebra.
After leaving the Navy with an honorable discharge due to a skin condition from which he had suffered since he was a child, Oluseyi enrolled in Tougaloo College where he earned Bachelor of Science degrees in physics and mathematics. In 1991, he became a graduate student at Stanford University.
He earned an M.S. degree in physics in 1995. He changed his name to Hakeem ("wise" in Arabic) Muata ("he who speaks the truth" in Swahili) Oluseyi ("God has done this" in Yoruba) in 1996.
Oluseyi earned his Ph.D. degree in physics from Stanford in 1999 under the mentorship of Arthur B. C. Walker Jr., from whom he learned experimental space research. Under Walker's tutelage, Oluseyi helped to design, build, calibrate, and launch the Multi-Spectral Solar Telescope Array (MSSTA), which pioneered normal incidence extreme ultraviolet and soft x-ray imaging of the Sun's transition region and corona. Oluseyi is a member of Kappa Alpha Psi.
Career
From 1999 to 2001 he worked on semiconductor research at Applied Materials.
From 2001 to 2004 he was a research fellow at Lawrence Berkeley National Laboratory, working on the Dark Energy Camera and Vera C. Rubin Observatory.
From 2007 to 2019, he was on the faculty of the Florida Institute of Technology in the departments of Physics and Space Sciences. His academic rank was distinguished research professor.
From 2016 to 2019. he was stationed at NASA Headquarters in Washington DC where he was the Space Sciences education manager for NASA's Science Mission Directorate via the Intergovernmental Personnel Act Mobility Program. Oluseyi was named a Visiting Robinson Professor at George Mason University in 2021, a distinction by which the university recognizes outstanding faculty.
In 2021, he published an autobiography titled: A Quantum Life: My Unlikely Journey from the Street to the Stars co-authored with Joshua Horwitz. As of 2022, Oluseyi is the president of the National Society of Black Physicists.
His best known scientific contributions are research on the transfer of mass and energy through the Sun's atmosphere; the development of space-borne observatories for studying astrophysical plasmas and dark energy; and the development of transformative technologies in ultraviolet optics, detectors, computer chips, and ion propulsion.
In 2021, Oluseyi carried out an investigation into the role that former NASA administrator James Webb played in the Lavender Scare of the 1950s and 1960s, after a number of scientists and journalists had raised concerns about the naming of NASA's new space telescope after him. Contrary to the claims of Webb's critics, Oluseyi found there was no evidence that Webb was implicated. His finding was later confirmed by a full report carried out by NASA itself.
In popular culture
Oluseyi appears as a commentator and scientific authority on Science Channel television shows including How the Universe Works, Outrageous Acts of Science, Curiosity, NASA's Unexplained Files, Space's Deepest Secrets, and Strip the Cosmos,. He also appeared as a 'bakineering' (baking and engineering) judge on Netflix's Baking Impossible.
He appeared on the National Geographic Channel show Evacuate Earth.
He contributed science articles to the news media, including The Washington Post. He lent his voice and scientific expertise to the award-winning science education video game ExoTrex: A Space Science Adventure Game in collaboration with Dig-It! Games.
He co-authored the children's popular science book Discovery Spaceopedia: The Complete Guide to Everything Space.
Family
Oluseyi met his wife, Jessica, at Tougaloo College. They have a daughter and a son. Oluseyi has a son from an earlier relationship.
References
Living people
American astrophysicists
Tougaloo College alumni
Stanford University alumni
Florida Institute of Technology faculty
United States Navy sailors
1967 births
Scientists from New Orleans
20th-century American astronomers
20th-century African-American scientists
21st-century American astronomers
21st-century African-American scientists
African-American United States Navy personnel
|
Angela Kunoth (born 22 June 1963) is a German mathematician specializing in the numerical analysis of partial differential equations. She is a professor of mathematics at the University of Cologne, and the editor-in-chief of SIAM Journal on Numerical Analysis.
Education and career
Kunoth studied mathematics at Bielefeld University beginning in 1982, and earned a diploma there in 1990. After visiting the University of South Carolina as a Fulbright Scholar, she completed a doctorate (Dr. rer. nat.) at the Free University of Berlin in 1994. Her dissertation, Multilevel Preconditioning, was supervised by Wolfgang Dahmen.
After research positions at SINTEF in Norway, at the Weierstrass Institute in Berlin, at Texas A&M University, and at RWTH Aachen University, she became an associate professor at the University of Bonn in 1999, and earned a habilitation through RWTH Aachen in 2000 with the habilitation thesis Wavelet Methods for Minimization Problems Involving Elliptic Partial Differential Equations. She moved to Paderborn University as a full professor and chair of complex systems in 2007, and at Paderborn served as director of the mathematical institute and vice-dean of the faculty for electrotechnics from 2010 to 2012. She moved again to the University of Cologne as professor and chair for applied mathematics in 2013.
Kunoth was elected to the 2023 Class of SIAM Fellows.
Book
Kunoth is the author of the monograph Wavelet Methods — Elliptic Boundary Value Problems and Control Problems (Springer, 2001), a book version of her habilitation thesis.
References
External links
Home page
1963 births
Living people
20th-century German mathematicians
German women mathematicians
Bielefeld University alumni
Free University of Berlin alumni
Academic staff of the University of Bonn
Academic staff of Paderborn University
Academic staff of the University of Cologne
20th-century German women
|
```yaml
name: sample_tests
description: Sample tests used as test data for the Flutter IntelliJ plugin.
version: 0.0.1
environment:
sdk: '>=3.0.0-0.0.dev <4.0.0'
dev_dependencies:
lints: ^2.0.0
meta: any
test: ^1.17.0
```
|
```go
/*
path_to_url
Unless required by applicable law or agreed to in writing, software
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package exec
import (
"reflect"
"testing"
)
func TestWithTee(t *testing.T) {
tests := []struct {
cmd string
args []string
logfile string
expected []string
}{
{
cmd: "ls",
args: []string{"-l", "-a"},
logfile: "/var/log/ls.log",
expected: []string{
"/bin/sh",
"-c",
"mkfifo /tmp/pipe; (tee -a /var/log/ls.log < /tmp/pipe & ) ; exec ls -l -a > /tmp/pipe 2>&1",
},
},
}
for _, test := range tests {
result := WithTee(test.cmd, test.args, test.logfile)
if !reflect.DeepEqual(result, test.expected) {
t.Errorf("Actual result %v, expected %v", result, test.expected)
}
}
}
```
|
```css
`currentColor` improves code reusability
The difference between `visibility:hidden` and `display:none`
Use pseudo-classes to describe a special state of an element
`:required` and `:optional` pseudo classes
Debug with `*` selector
```
|
```c++
m_ComboImageList.Create(16, 16, ILC_COLOR, 2, 2);
```
|
Holly Newman (born 1974 in Lytham St Annes), is an English actress who played Lorraine Brownlow in Coronation Street. She has also appeared in Dalziel and Pascoe, Crossroads, Holby City, and Kiss Me Kate.
References
External links
IMDb profile
1974 births
Living people
English television actresses
English soap opera actresses
People from Lytham St Annes
Actresses from Lancashire
|
This is a list of Indonesia's national electoral districts in accordance with Law No. 7 of 2017 and Government Regulation in Lieu of Law No.1/2022, and regions included within them.
Members of the People's Representative Council () are elected from multi-member electoral districts (/Dapil). In total, there are 84 districts across Indonesia's 38 provinces. Individual districts are named after their provinces and, if the province has multiple districts, assigned a roman numeral indicating its number in the province. The upcoming 2024 general election will use the 84 electoral districts where 580 members of the People's Representative Council would be elected.
All electoral districts are located entirely within one province and includes regencies and cities within their boundaries, without any regency or city being part of multiple districts. Between 3 and 10 representatives are allocated to each district.
West Java and East Java are tied for the province with the most electoral districts, with 11 each, followed by Central Java with 10. 22 of the country's 38 provinces are individual electoral districts.
Selection of elected representatives in 2024 will follow a Webster/Sainte-Laguë method.
2022 changes
Formation of new provinces South Papua, Central Papua, Highland Papua, and Southwest Papua urged the need of representatives representing the provinces. West Papua electoral district split into the West Papua and Southwest Papua electoral districts, while Papua electoral district split into South Papua, Central Papua, Highland Papua, and Papua electoral districts in accordance with Article 243 of the Government Regulation in Lieu of Law No.1/2022.
Nusantara not to be split from the East Kalimantan electoral district in accordance with Article 568A of the Government Regulation in Lieu of Law No.1/2022, so East Kalimantan representatives at People's Representative Council may represent East Kalimantan and Nusantara areas in 2024 general election. Additionally, explanatory clause of the Article 568A of the Government Regulation in Lieu of Law No.1/2022, East Kalimantan Provincial Representative Council, Kutai Kartanegara Regional Representative Council, and North Penajam Paser Regional Representative Council will no longer have jurisdiction and have no representative rights over Nusantara upon the Presidential Decree on Capital Relocation from Jakarta to Nusantara signed. The decree will be issued in 2024.
List
Note: italics indicate a provincial capital.
Sumatra
Aceh I (7 seats)
Regencies: Simeulue, Aceh Singkil, Aceh Selatan, Aceh Tenggara, Aceh Barat, Aceh Besar, Pidie, Aceh Barat Daya, Aceh Jaya, Gayo Lues, Nagan Raya, Pidie Jaya
Cities: Banda Aceh, Sabang, Subulussalam
Aceh II (6 seats)
Regencies: Aceh Timur, Aceh Tengah, Bireuen, Aceh Utara, Aceh Tamiang, Bener Meriah
Cities: Langsa, Lhokseumawe
North Sumatra I (10 seats)
Regencies: Deli Serdang, Serdang Bedagai
Cities: Tebingtinggi, Medan
North Sumatra II (10 seats)
Regencies: Nias, Mandailing Natal, Tapanuli Selatan, Tapanuli Tengah, Tapanuli Utara, Toba Samosir, Labuhan Batu, Nias Selatan, Humbang Hasundutan, Samosir, Labuhan Batu Selatan, Labuhan Batu Utara, Nias Utara, Nias Barat, Padang Lawas Utara, Padang Lawas
Cities: Sibolga, Padangsidempuan, Gunungsitoli
North Sumatra III (10 seats)
Regencies: Asahan, Simalungun, Dairi, Karo, Langkat, Pakpak Bharat, Batubara
Cities: Tanjungbalai, Pematangsiantar, Binjai
West Sumatra I (8 seats)
Regencies: Mentawai Islands, Pesisir Selatan, Solok, Sijunjung, Tanah Datar, Solok Selatan, Dharmasraya
Cities: Padang Panjang, Padang, Solok, Sawahlunto
West Sumatra II (6 seats)
Regencies:Padang Pariaman, Agam, Lima Puluh Kota, Pasaman, Pasaman Barat
Cities: Bukittinggi, Pariaman, Payakumbuh
Riau I (7 seats)
Regencies: Siak, Bengkalis, Kepulauan Meranti, Rokan Hilir, Rokan Hulu
Cities: Pekanbaru, Dumai
Riau II (6 seats)
Regencies: Kuantan Singingi, Indragiri Hulu, Indragiri Hilir, Pelalawan, Kampar
Jambi (8 seats)
All regencies and cities
South Sumatra I (8 seats)
Regencies: Musi Rawas, Musi Banyuasin, Banyuasin
Cities: Palembang, Lubuklinggau
South Sumatra II (9 seats)
Regencies: Ogan Komering Ulu, Ogan Komering Ilir, Muara Enim, Lahat, Ogan Komering Ulu Selatan, Ogan Komering Ulu Timur, Ogan Ilir, Empat Lawang, Penukal Abab Lematang Ilir
Cities: Pagar Alam, Prabumulih
Bengkulu (4 seats)
All regencies and cities
Lampung I (10 seats)
Regencies: Tanggamus, Lampung Selatan, Pesawaran, Pringsewu, Lampung Barat, Pesisir Barat
Cities: Bandar Lampung, Metro
Lampung II (10 seats)
Regencies: Lampung Timur, Lampung Tengah, Lampung Utara, Way Kanan, Tulangbawang, Mesuji, Tulang Bawang Barat
Bangka Belitung Islands (3 seats)
All regencies and cities
Riau Islands (4 seats)
All regencies and cities
Java
Banten I (6 seats)
Regencies: Pandeglang, Lebak
Banten II (6 seats)
Regencies: Serang
Cities: Cilegon, Serang
Banten III (10 seats)
Regencies: Tangerang
Cities: Tangerang, South Tangerang
Jakarta I (6 seats)
Cities: East Jakarta
Jakarta II (7 seats)
Cities: Central Jakarta, South Jakarta, overseas voters
Jakarta III (8 seats)
Regencies: Thousand Islands
Cities: North Jakarta, West Jakarta
West Java I (7 seats)
Cities: Bandung, Cimahi
West Java II (10 seats)
Regencies: Bandung, West Bandung
West Java III (9 seats)
Regencies: Cianjur
Cities: Bogor
West Java IV (6 seats)
Regencies: Sukabumi
Cities: Sukabumi
West Java V (9 seats)
Regencies: Bogor
West Java VI (6 seats)
Cities: Bekasi, Depok
West Java VII (10 seats)
Regencies: Bekasi, Karawang, Purwakarta
West Java VIII (9 seats)
Regencies: Cirebon, Indramayu
Cities: Cirebon
West Java IX (8 seats)
Regencies: Subang, Sumedang, Majalengka
West Java X (7 seats)
Regencies: Ciamis, Kuningan, Pangandaran
Cities: Banjar
West Java XI (10 seats)
Regencies: Garut, Tasikmalaya
Cities: Tasikmalaya
Central Java I (8 seats)
Regencies: Semarang, Kendal
Cities: Semarang, Salatiga
Central Java II (7 seats)
Regencies: Kudus, Demak, Jepara
Central Java III (9 seats)
Regencies: Grobogan, Blora, Rembang, Pati
Central Java IV (7 seats)
Regencies: Wonogiri, Karanganyar, Sragen
Central Java V (8 seats)
Regencies: Boyolali, Klaten, Sukoharjo
Cities: Surakarta
Central Java VI (8 seats)
Regencies: Purworejo, Wonosobo, Magelang, Temanggung
Cities: Magelang
Central Java VII (7 seats)
Regencies: Purbalingga, Banjarnegara, Kebumen
Central Java VIII (8 seats)
Regencies: Cilacap, Banyumas
Central Java IX (8 seats)
Regencies: Brebes, Tegal
Cities: Tegal
Central Java X (7 seats)
Regencies: Batang, Pekalongan, Pemalang
Cities: Pekalongan
Yogyakarta S.R. (8 seats)
All cities and regencies
East Java I (10 seats)
Regencies: Sidoarjo
Cities: Surabaya
East Java II (7 seats)
Regencies: Probolinggo, Pasuruan
Cities: Probolinggo, Pasuruan
East Java III (7 seats)
Regencies: Banyuwangi, Bondowoso, Situbondo
East Java IV (8 seats)
Regencies: Lumajang, Jember
East Java V (8 seats)
Regencies: Malang
Cities: Batu, Malang
East Java VI (9 seats)
Regencies: Blitar, Kediri, Tulungagung
Cities: Blitar, Kediri
East Java VII (8 seats)
Regencies: Pacitan, Ponorogo, Trenggalek, Magetan, Ngawi
East Java VIII (10 seats)
Regencies: Mojokerto, Jombang, Nganjuk, Madiun
Cities: Madiun, Mojokerto
East Java IX (6 seats)
Regencies: Bojonegoro, Tuban
East Java X (6 seats)
Regencies: Gresik, Lamongan
East Java XI (8 seats)
Regencies: Bangkalan, Pamekasan, Sampang, Sumenep
Lesser Sunda Islands
Bali (9 seats)
All regencies and cities
West Nusa Tenggara I (3 seats)
Regencies: West Sumbawa, Sumbawa, Dompu, Bima
Cities: Bima
West Nusa Tenggara II (8 seats)
Regencies: West Lombok, North Lombok, East Lombok, Central Lombok
Cities: Mataram
East Nusa Tenggara I (6 seats)
Regencies: Alor, Lembata, Flores Timur, Sikka, Ende, Ngada, Manggarai, Manggarai Barat, Nagekeo, Manggarai Timur
East Nusa Tenggara II (7 seats)
Regencies: Sumba Barat, Sumba Timur, Kupang, Timor Tengah Selatan, Timor Tengah Utara, Belu, Malaka, Rote Ndao, Sumba Tengah, Sumba Barat Daya, Sabu Raijua
Cities: Kupang
Kalimantan
West Kalimantan I (8 seats)
Regencies: Sambas, Bengkayang, Landak, Pontianak, Ketapang, Kayong Utara, Kubu Raya
Cities: Pontianak, Singkawang
West Kalimantan II (4 seats)
Regencies: Sanggau, Sintang, Kapuas Hulu, Sekadau, Melawi
Central Kalimantan (6 seats)
All regencies and cities
South Kalimantan I (6 seats)
Regencies: Banjar, Barito Kuala, Tapin, Hulu Sungai Selatan, Hulu Sungai Tengah, Hulu Sungai Utara, Tabalong, Balangan
South Kalimantan II (5 seats)
Regencies: Tanah Laut, Kota Baru, Tanah Bumbu
Cities: Banjarmasin, Banjarbaru
East Kalimantan (8 seats)
All regencies and cities
North Kalimantan (3 seats)
All regencies and cities
Sulawesi
South Sulawesi I (8 seats)
Regencies: Bantaeng, Jeneponto, Takalar, Gowa, Selayar Islands
Cities: Makassar
South Sulawesi II (9 seats)
Regencies: Bulukumba, Sinjai, Maros, Pangkajene and Islands, Barru, Bone, Soppeng, Wajo
Cities: Parepare
South Sulawesi III (7 seats)
Regencies: Sidenreng Rappang, Pinrang, Enrekang, Luwu, Tana Toraja, Luwu Utara, Luwu Timur, Toraja Utara
Cities: Palopo
West Sulawesi (4 seats)
All regencies and cities
Southeast Sulawesi (6 seats)
All regencies and cities
Central Sulawesi (7 seats)
All regencies and cities
Gorontalo (3 seats)
All regencies and cities
North Sulawesi (6 seats)
All regencies and cities
Maluku and Papua
Maluku (4 seats)
All regencies and cities
North Maluku (3 seats)
All regencies and cities
Papua (3 seats)
Regencies: Yapen Islands, Biak Numfor, Sarmi, Keerom, Waropen, Supiori, Mamberamo Raya, Jayapura Regency
Cities: Jayapura
South Papua (3 seats)
Regencies: Boven Digoel, Mappi, Asmat
Cities: Merauke
Central Papua (3 seats)
Regencies: Puncak Jaya, Paniai, Mimika, Puncak, Dogiyai, Intan Jaya, Deiyai, Nabire Regency
Cities: Nabire
Highland Papua (3 seats)
Regencies: Jayawijaya, Pegunungan Bintang, Yahukimo, Tolikara, Mamberamo Tengah, Yalimo, Lanny Jaya, Nduga
Cities: Wamena
West Papua (3 seats)
Regencies: Fakfak, Teluk Bintuni, Teluk Wondama, Kaimana, South Manokwari, Pegunungan Arfak
Cities: Manokwari
Southwest Papua (3 seats)
Regencies: Sorong Regency, South Sorong, Raja Ampat, Tambrauw, Maybrat
Cities: Sorong
Source: Law No. 7/2017 which amended by Government Regulation in Lieu of Law No. 1/2022 and
Regulation of General Elections Commission No. 6/2023
References
Indonesia
Electoral districts
|
Buhle "Bush" Mxunyelwa (born 25 June 1986) is a South African professional rugby union player currently playing with the . His regular position is tighthead prop.
Career
Youth
Mxunyelwa played for the side in the 2005, 2006 and 2007 Under-21 Provincial Championships.
Border Bulldogs
Mxunyelwa made his senior debut during the 2008 Vodacom Cup season, coming on as a substitute in their 5–15 opening day defeat to . The following week, he was promoted to the starting line-up for their match against the in Welkom. He made a total of seven appearances during the competition and also broke into their Currie Cup side for the 2008 Currie Cup First Division competition. His Currie Cup debut came against the in East London and he made a total of seven appearances in the competition, including one start against the .
Mxunyelwa made a further five appearances during the 2009 Vodacom Cup competition – scoring his first senior try in the Bulldogs' match against the in Wellington, Western Cape – and, after playing for an East Cape XV in a compulsory friendly match against the , played in all ten matches of the ' 2009 Currie Cup First Division season, starting nine of them.
Western Province / Maties
In 2010, Mxunyelwa moved to the Western Cape. He played in six of the matches during the 2010 Varsity Cup competition, helping them win the competition for the third year in a row, but not being involved in the latter stages of the competition. Instead, he represented in the 2010 Vodacom Cup competition, starting in six of their matches.
Mxunyelwa was also included in Western Province's squad for the 2010 Currie Cup Premier Division season. He made two appearances; his first appearance in the Premier Division of the Currie Cup came during their match against in Kimberley and he also played in their match against the in Durban.
Mxunyelwa started in six of the ' seven matches during the 2011 Varsity Cup, but failed to feature for Western Province at provincial level.
Leopards
Mxunyelwa moved to Potchefstroom to join the prior to the 2011 Currie Cup Premier Division season. He made his debut for the Leopards during their match against the in what would turn out to be his only Currie Cup appearance for the Leopards. He made a total of eight appearances for them during the 2012 and 2013 Vodacom Cup competitions and also represented club side Rustenburg Impala in the 2013 SARU Community Cup competition, making three appearances.
Ireland
Mxunyelwa then went to Ireland, where he played for Dublin-based AIL side Wanderers during the 2013–2014 season.
Return to Border Bulldogs
Mxunyelwa returned to South Africa in 2014 and rejoined former side for the 2014 Currie Cup qualification campaign. He was immediately involved, starting their first match of the tournament, a 52–5 loss to .
References
1986 births
Living people
Border Bulldogs players
Leopards (rugby union) players
Rugby union players from East London, South Africa
Rugby union props
South African rugby union players
Stellenbosch University alumni
University of Fort Hare alumni
Wanderers F.C. (rugby union) players
Western Province (rugby union) players
|
```c
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to
* deal in the Software without restriction, including without limitation the
* rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
* sell copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
* IN THE SOFTWARE.
*/
#include "uv.h"
#include "task.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define CHECK_HANDLE(handle) \
ASSERT((uv_udp_t*)(handle) == &server || (uv_udp_t*)(handle) == &client)
static uv_udp_t server;
static uv_udp_t client;
static int sv_send_cb_called;
static int close_cb_called;
static void close_cb(uv_handle_t* handle) {
CHECK_HANDLE(handle);
close_cb_called++;
}
static void sv_send_cb(uv_udp_send_t* req, int status) {
ASSERT(req != NULL);
ASSERT(status == 0);
CHECK_HANDLE(req->handle);
sv_send_cb_called++;
uv_close((uv_handle_t*) req->handle, close_cb);
}
TEST_IMPL(udp_multicast_interface6) {
int r;
uv_udp_send_t req;
uv_buf_t buf;
struct sockaddr_in6 addr;
struct sockaddr_in6 baddr;
if (!can_ipv6())
RETURN_SKIP("IPv6 not supported");
ASSERT(0 == uv_ip6_addr("::1", TEST_PORT, &addr));
r = uv_udp_init(uv_default_loop(), &server);
ASSERT(r == 0);
ASSERT(0 == uv_ip6_addr("::", 0, &baddr));
r = uv_udp_bind(&server, (const struct sockaddr*)&baddr, 0);
ASSERT(r == 0);
#if defined(__APPLE__) || defined(__FreeBSD__) || defined(__FreeBSD_kernel__)
r = uv_udp_set_multicast_interface(&server, "::1%lo0");
#else
r = uv_udp_set_multicast_interface(&server, NULL);
#endif
ASSERT(r == 0);
/* server sends "PING" */
buf = uv_buf_init("PING", 4);
r = uv_udp_send(&req,
&server,
&buf,
1,
(const struct sockaddr*)&addr,
sv_send_cb);
ASSERT(r == 0);
ASSERT(close_cb_called == 0);
ASSERT(sv_send_cb_called == 0);
/* run the loop till all events are processed */
uv_run(uv_default_loop(), UV_RUN_DEFAULT);
ASSERT(sv_send_cb_called == 1);
ASSERT(close_cb_called == 1);
MAKE_VALGRIND_HAPPY();
return 0;
}
```
|
```objective-c
#pragma once
#ifndef TTIO_PNG_INCLUDED
#define TTIO_PNG_INCLUDED
#include "tiio.h"
//#include "timage_io.h"
#include "tproperty.h"
#include <QCoreApplication>
//===========================================================================
namespace Tiio {
//===========================================================================
class PngWriterProperties final : public TPropertyGroup {
Q_DECLARE_TR_FUNCTIONS(PngWriterProperties)
public:
// TEnumProperty m_pixelSize;
TBoolProperty m_matte;
PngWriterProperties();
void updateTranslation() override;
};
//===========================================================================
Tiio::Reader *makePngReader();
Tiio::Writer *makePngWriter();
} // namespace
#endif
```
|
```c++
// This file is part of libigl, a simple c++ geometry processing library.
//
//
// v. 2.0. If a copy of the MPL was not distributed with this file, You can
// obtain one at path_to_url
#include "parula.h"
#include "colormap.h"
template <typename T>
IGL_INLINE void igl::parula(const T x, T * rgb)
{
igl::colormap(igl::COLOR_MAP_TYPE_PARULA,x, rgb);
}
template <typename T>
IGL_INLINE void igl::parula(const T f, T & r, T & g, T & b)
{
igl::colormap(igl::COLOR_MAP_TYPE_PARULA, f, r, g, b);
}
template <typename DerivedZ, typename DerivedC>
IGL_INLINE void igl::parula(
const Eigen::MatrixBase<DerivedZ> & Z,
const bool normalize,
Eigen::PlainObjectBase<DerivedC> & C)
{
igl::colormap(igl::COLOR_MAP_TYPE_PARULA, Z, normalize, C);
}
template <typename DerivedZ, typename DerivedC>
IGL_INLINE void igl::parula(
const Eigen::MatrixBase<DerivedZ> & Z,
const double min_z,
const double max_z,
Eigen::PlainObjectBase<DerivedC> & C)
{
igl::colormap(igl::COLOR_MAP_TYPE_PARULA, Z, min_z, max_z, C);
}
#ifdef IGL_STATIC_LIBRARY
// Explicit template instantiation
// generated by autoexplicit.sh
template void igl::parula<Eigen::Matrix<int, -1, 1, 0, -1, 1>, Eigen::Matrix<double, -1, -1, 0, -1, -1> >(Eigen::MatrixBase<Eigen::Matrix<int, -1, 1, 0, -1, 1> > const&, double, double, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 0, -1, -1> >&);
// generated by autoexplicit.sh
template void igl::parula<Eigen::Array<int, -1, 1, 0, -1, 1>, Eigen::Matrix<double, -1, -1, 0, -1, -1> >(Eigen::MatrixBase<Eigen::Array<int, -1, 1, 0, -1, 1> > const&, bool, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 0, -1, -1> >&);
template void igl::parula<double>(double, double*);
template void igl::parula<double>(double, double&, double&, double&);
template void igl::parula<Eigen::Matrix<double, -1, 1, 0, -1, 1>, Eigen::Matrix<double, -1, -1, 0, -1, -1> >(Eigen::MatrixBase<Eigen::Matrix<double, -1, 1, 0, -1, 1> > const&, bool, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 0, -1, -1> >&);
template void igl::parula<Eigen::Matrix<double, -1, -1, 0, -1, -1>, Eigen::Matrix<double, -1, -1, 0, -1, -1> >(Eigen::MatrixBase<Eigen::Matrix<double, -1, -1, 0, -1, -1> > const&, bool, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 0, -1, -1> >&);
template void igl::parula<Eigen::Matrix<double, -1, -1, 0, -1, -1>, Eigen::Matrix<double, -1, -1, 0, -1, -1> >(Eigen::MatrixBase<Eigen::Matrix<double, -1, -1, 0, -1, -1> > const&, double, double, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 0, -1, -1> >&);
#endif
```
|
Michel Van den Bergh (born 25 July 1960) is a Belgian mathematician and professor at the Vrije Universiteit Brussel and does research at Hasselt University. His research interest is on the fundamental relationship between algebra and geometry. In 2003, he was awarded the Francqui Prize on Exact Sciences.
Van den Bergh obtained his Ph.D. in mathematics from the University of Antwerp in 1985, with thesis Algebraic Elements in Finite Dimensional Division Algebras written under the direction of Fred Van Oystaeyen and Jan Maria Hendrik Van Geel.
References
External links
Publications of Michel Van den Bergh
1960 births
Living people
Belgian mathematicians
Academic staff of Vrije Universiteit Brussel
University of Antwerp alumni
Algebraists
Geometers
|
```c++
/*
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include "SkCanvas.h"
#include "SkDrawLooper.h"
#include "SkTypes.h"
#include "Test.h"
/*
* Subclass of looper that just draws once, with an offset in X.
*/
class TestLooper : public SkDrawLooper {
public:
SkDrawLooper::Context* createContext(SkCanvas*, void* storage) const override {
return SkNEW_PLACEMENT(storage, TestDrawLooperContext);
}
size_t contextSize() const override { return sizeof(TestDrawLooperContext); }
#ifndef SK_IGNORE_TO_STRING
void toString(SkString* str) const override {
str->append("TestLooper:");
}
#endif
SK_DECLARE_PUBLIC_FLATTENABLE_DESERIALIZATION_PROCS(TestLooper);
private:
class TestDrawLooperContext : public SkDrawLooper::Context {
public:
TestDrawLooperContext() : fOnce(true) {}
virtual ~TestDrawLooperContext() {}
bool next(SkCanvas* canvas, SkPaint*) override {
if (fOnce) {
fOnce = false;
canvas->translate(SkIntToScalar(10), 0);
return true;
}
return false;
}
private:
bool fOnce;
};
};
SkFlattenable* TestLooper::CreateProc(SkReadBuffer&) { return SkNEW(TestLooper); }
static void test_drawBitmap(skiatest::Reporter* reporter) {
SkBitmap src;
src.allocN32Pixels(10, 10);
src.eraseColor(SK_ColorWHITE);
SkBitmap dst;
dst.allocN32Pixels(10, 10);
dst.eraseColor(SK_ColorTRANSPARENT);
SkCanvas canvas(dst);
SkPaint paint;
// we are initially transparent
REPORTER_ASSERT(reporter, 0 == *dst.getAddr32(5, 5));
// we see the bitmap drawn
canvas.drawBitmap(src, 0, 0, &paint);
REPORTER_ASSERT(reporter, 0xFFFFFFFF == *dst.getAddr32(5, 5));
// reverify we are clear again
dst.eraseColor(SK_ColorTRANSPARENT);
REPORTER_ASSERT(reporter, 0 == *dst.getAddr32(5, 5));
// if the bitmap is clipped out, we don't draw it
canvas.drawBitmap(src, SkIntToScalar(-10), 0, &paint);
REPORTER_ASSERT(reporter, 0 == *dst.getAddr32(5, 5));
// now install our looper, which will draw, since it internally translates
// to the left. The test is to ensure that canvas' quickReject machinary
// allows us through, even though sans-looper we would look like we should
// be clipped out.
paint.setLooper(new TestLooper)->unref();
canvas.drawBitmap(src, SkIntToScalar(-10), 0, &paint);
REPORTER_ASSERT(reporter, 0xFFFFFFFF == *dst.getAddr32(5, 5));
}
static void test_layers(skiatest::Reporter* reporter) {
SkCanvas canvas(100, 100);
SkRect r = SkRect::MakeWH(10, 10);
REPORTER_ASSERT(reporter, false == canvas.quickReject(r));
r.offset(300, 300);
REPORTER_ASSERT(reporter, true == canvas.quickReject(r));
// Test that saveLayer updates quickReject
SkRect bounds = SkRect::MakeLTRB(50, 50, 70, 70);
canvas.saveLayer(&bounds, NULL);
REPORTER_ASSERT(reporter, true == canvas.quickReject(SkRect::MakeWH(10, 10)));
REPORTER_ASSERT(reporter, false == canvas.quickReject(SkRect::MakeWH(60, 60)));
}
DEF_TEST(QuickReject, reporter) {
test_drawBitmap(reporter);
test_layers(reporter);
}
```
|
Akkur, Haveri is a village in the southern state of Karnataka, India. It is located in the Haveri taluk of Haveri district in Karnataka.
See also
Haveri
Districts of Karnataka
References
External links
HAVERI DISTRICT
Villages in Haveri district
|
```javascript
Hoisting
Anonymous functions
Function call method
Move cursor at the end of text input
Check if a document is done loading
```
|
William Raymond Engeln (September 9, 1898 – April 17, 1968) was a professional baseball umpire who worked in the National League from 1952 to 1956. Engeln was the right field umpire in the 1953 Major League Baseball All-Star Game. In his career, he umpired 749 major league games.
Early life and career
Engeln was born in St. Louis, Missouri and served as a bat boy for the St. Louis Browns when he was young. As an umpire, he spent sixteen seasons (1936 through 1951) in the Pacific Coast League before being promoted to the majors. In 1945, Engeln was surrounded by angry fans after a ninth-inning third strike in a game between the Portland Beavers and Seattle Rainiers. He was attacked by two women who were then led away by police.
Notable games
Engeln also officiated on July 31, 1954, when Joe Adcock hit four home runs in one game. He was behind the plate a day later when Adcock was hit in the head by a Clem Labine pitch. The pitch precipitated a near-physical confrontation between Jackie Robinson and Lew Burdette as Adcock was carried off the field by stretcher.
Death
Engeln died in Palo Alto, California on April 17, 1968.
References
External links
Umpire Card
Bill Engeln at SABR (Baseball BioProject)
1898 births
1968 deaths
Major League Baseball umpires
Sportspeople from Missouri
|
Hope Hampton (Mae Elizabeth Hampton; February 19, 1897 – January 23, 1982) was an American silent motion picture actress and producer, who was noted for her seemingly effortless incarnation of siren and flapper types in silent-picture roles during the 1920s. She also at one time was an aspiring opera singer.
Early life
Texas-born, Philadelphia-bred beauty contest winner Hampton was discovered by U.S. silent cinema pioneer Jules Brulatour while working as an extra for director Maurice Tourneur. She made her screen debut in 1920's A Modern Salome, and went on to feature prominently in several Brulatour-financed films. Her last starring role was in The Road to Reno (1938) with Randolph Scott and Glenda Farrell. In 1923, Hampton wed her manager Brulatour, and they remained married until his death in 1946.
Later life
Hampton was trained as an opera singer by voice teacher Estelle Liebling, the teacher of Beverly Sills. After retiring from motion pictures at the dawn of sound, she turned to opera and made her debut with the Philadelphia Opera in Manon. The idea that she ever toured with the Metropolitan Opera is belied by a look at the company's online archives. She returned to the screen in The Road to Reno (1938), a film directed by her husband. Later she was known as The Duchess of Park Avenue, a leading member of New York's social set.
In 1978, she was crowned Queen of the Beaux Arts Ball. She presided with King Arthur Tracy.
She died of a heart attack at the age of 84.
Personal life
Hampton and Brulatour took a honeymoon trip to Egypt, there a Sheikh offered Brulatour £10,000 British pounds to buy his wife. Brulatour smiled at the Sheikh and told him that Mrs. Brulatour's jewels were worth more than that.
Brulatour also gave Hope Hampton a 5-story home on Park Avenue (built in 1885 and redesigned in 1921 by Emery Roth), which became Tour Hope Hampton and was listed for $9 million in 2016.
Complete filmography
References
External links
Hope Hampton: Broadway Photographs(Univ. of South Carolina)
1897 births
1982 deaths
American film actresses
American silent film actresses
Actresses from Texas
20th-century American actresses
American women film producers
|
Narrative poetry is a form of poetry that tells a story, often using the voices of both a narrator and characters; the entire story is usually written in metered verse. Narrative poems do not need to rhyme. The poems that make up this genre may be short or long, and the story it relates to may be complex. It is normally dramatic, with various characters. Narrative poems include all epic poetry, and the various types of "lay", most ballads, and some idylls, as well as many poems not falling into a distinct type.
Some narrative poetry takes the form of a novel in verse. An example of this is The Ring and the Book by Robert Browning. In terms of narrative poetry, romance is a narrative poem that tells a story of chivalry. Examples include the Romance of the Rose or Tennyson's Idylls of the King. Although those examples use medieval and Arthurian materials, romances may also tell stories from classical mythology. Sometimes, these short narratives are collected into interrelated groups, as with Chaucer's The Canterbury Tales. So sagas include both incidental poetry and the biographies of poets.
Oral tradition
The oral tradition is the predecessor of essentially all other modern forms of communication. For thousands of years, cultures passed on their history through oral tradition from generation to generation. Historically, much of poetry has its source in an oral tradition: in more recent times the Scots and English ballads, the tales of Robin Hood poems all were originally intended for recitation, rather than reading. In many cultures, there remains a lively tradition of the recitation of traditional tales in verse format. It has been suggested that some of the distinctive features that distinguish poetry from prose, such as metre, alliteration, and kennings, at one time served as memory aids that allowed the bards who recited traditional tales to reconstruct them from memory.
A narrative poem usually tells a story using a poetic theme. Epics are very vital to narrative poems, although it is thought those narrative poems were created to explain oral traditions. The focus of narrative poetry is often the pros and cons of life.
List of narrative poems
All epic poems, verse romances and verse novels can also be thought of as extended narrative poems. Other notable examples of narrative poems include:
The anonymous Homeric Hymns to Demeter, Apollo, Aphrodite, Hermes, Dionysus, and Pan
Metamorphoses by Ovid
The anonymous Poetic Edda
Piers Plowman by William Langland
The Book of the Duchess and The Canterbury Tales by Geoffrey Chaucer
The Assembly of Gods (anonymous)
The Morall Fabillis of Esope the Phrygian by Robert Henryson
Tam Lin (anonymous)
Hero and Leander by Christopher Marlowe
The Rape of Lucrece, Venus and Adonis, The Lover's Complaint, The Phoenix and the Turtle by William Shakespeare
Hudibras by Samuel Butler
The Dunciad and The Rape of the Lock by Alexander Pope
Halloween (poem) by Robert Burns
The Rime of the Ancient Mariner by Samuel Taylor Coleridge
Childe Harold's Pilgrimage and Lara, A Tale by Lord Byron
The Eve of St. Agnes and Lamia by John Keats
The Prisoner of the Caucasus by Alexander Pushkin
Lays of Ancient Rome by Thomas Babington Macaulay
Paul Revere's Ride, The Courtship of Miles Standish and The Wreck of the Hesperus by Henry Wadsworth Longfellow
The Battle of Marathon: A Poem by Elizabeth Barrett Browning
The Raven by Edgar Allan Poe
Snow-Bound by John Greenleaf Whittier
Idylls of the King, and many other works by Alfred, Lord Tennyson
The Fakeer of Jungheera by Henry Louis Vivian Derozio
Childe Roland to the Dark Tower Came and Red Cotton Night-Cap Country by Robert Browning
Sohrab and Rustum by Matthew Arnold
Terje Vigen by Henrik Ibsen
The Hunting of the Snark and The Walrus and the Carpenter by Lewis Carroll
Eros and Psyche by Robert Bridges
Luceafărul by Mihai Eminescu
The Highwayman by Alfred Noyes
The Legend of Sigurd and Gudrun by J.R.R. Tolkien
The Road Not Taken by Robert Frost
The Wild Party and The Set-Up by Joseph Moncure March
Dymer and The Queen of Drum by C.S. Lewis
The Ship's Cat by Richard Adams
Lost in Translation by James Merrill
Prentice Alvin and the No-Good Plow by Orson Scott Card
References
External links
Narratology
yi:דיכטונג#פאעמע
|
```c++
// __ _____ _____ _____
// __| | __| | | | JSON for Modern C++
// | | |__ | | | | | | version 3.11.2
// |_____|_____|_____|_|___| path_to_url
//
#pragma once
#include <cstddef> // ptrdiff_t
#include <limits> // numeric_limits
#include <nlohmann/detail/macro_scope.hpp>
NLOHMANN_JSON_NAMESPACE_BEGIN
namespace detail
{
/*
@brief an iterator for primitive JSON types
This class models an iterator for primitive JSON types (boolean, number,
string). It's only purpose is to allow the iterator/const_iterator classes
to "iterate" over primitive values. Internally, the iterator is modeled by
a `difference_type` variable. Value begin_value (`0`) models the begin,
end_value (`1`) models past the end.
*/
class primitive_iterator_t
{
private:
using difference_type = std::ptrdiff_t;
static constexpr difference_type begin_value = 0;
static constexpr difference_type end_value = begin_value + 1;
JSON_PRIVATE_UNLESS_TESTED:
/// iterator as signed integer type
difference_type m_it = (std::numeric_limits<std::ptrdiff_t>::min)();
public:
constexpr difference_type get_value() const noexcept
{
return m_it;
}
/// set iterator to a defined beginning
void set_begin() noexcept
{
m_it = begin_value;
}
/// set iterator to a defined past the end
void set_end() noexcept
{
m_it = end_value;
}
/// return whether the iterator can be dereferenced
constexpr bool is_begin() const noexcept
{
return m_it == begin_value;
}
/// return whether the iterator is at end
constexpr bool is_end() const noexcept
{
return m_it == end_value;
}
friend constexpr bool operator==(primitive_iterator_t lhs, primitive_iterator_t rhs) noexcept
{
return lhs.m_it == rhs.m_it;
}
friend constexpr bool operator<(primitive_iterator_t lhs, primitive_iterator_t rhs) noexcept
{
return lhs.m_it < rhs.m_it;
}
primitive_iterator_t operator+(difference_type n) noexcept
{
auto result = *this;
result += n;
return result;
}
friend constexpr difference_type operator-(primitive_iterator_t lhs, primitive_iterator_t rhs) noexcept
{
return lhs.m_it - rhs.m_it;
}
primitive_iterator_t& operator++() noexcept
{
++m_it;
return *this;
}
primitive_iterator_t operator++(int)& noexcept // NOLINT(cert-dcl21-cpp)
{
auto result = *this;
++m_it;
return result;
}
primitive_iterator_t& operator--() noexcept
{
--m_it;
return *this;
}
primitive_iterator_t operator--(int)& noexcept // NOLINT(cert-dcl21-cpp)
{
auto result = *this;
--m_it;
return result;
}
primitive_iterator_t& operator+=(difference_type n) noexcept
{
m_it += n;
return *this;
}
primitive_iterator_t& operator-=(difference_type n) noexcept
{
m_it -= n;
return *this;
}
};
} // namespace detail
NLOHMANN_JSON_NAMESPACE_END
```
|
La Clua is a locality located in the municipality of Artesa de Segre, in Province of Lleida province, Catalonia, Spain. As of 2020, it has a population of 17.
Geography
La Clua is located 69km northeast of Lleida.
References
Populated places in the Province of Lleida
|
The () is a Gymnasium in Neuss, North Rhine-Westphalia, Germany.
The eponym is Alexander von Humboldt (1769–1859). The school has approximately 100 teachers and 950 students.
External links
Official website of
Schools in North Rhine-Westphalia
Neuss
Gymnasiums in Germany
Educational institutions established in 1966
1966 establishments in West Germany
|
```java
/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* published by the Free Software Foundation. Oracle designates this
* particular file as subject to the "Classpath" exception as provided
* by Oracle in the LICENSE file that accompanied this code.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
package org.graalvm.visualvm.api.caching;
/**
* Generic key/value persistor
* Supports retrieving a value by the given key and storing a value with the given key
* @author Jaroslav Bachorik
*/
public interface Persistor<K, V> {
/**
* Retrieves {@linkplain Entry} for the given key
* @param key The key to retrieve {@linkplain Entry} instance
* @return Returns the retrieved {@linkplain Entry} instance or NULL
*/
Entry<V> retrieve(K key);
/**
* Stores the {@linkplain Entry} together with its key
* @param key The key to be used
* @param value The value to be used
*/
void store(K key, Entry<V> value);
/**
* The default (NULL-value) instance
*/
final public static Persistor DEFAULT = new Persistor() {
@Override
public Entry retrieve(Object key) {
// do nothing
return null;
}
@Override
public void store(Object key, Entry value) {
// do nothing
}
};
}
```
|
Brass Hat (foaled May 22, 2001 in Kentucky) is an American Thoroughbred racehorse.
Background
Brass Hat is out of the mare Brassy and sired by Prized, winner of the 1989 Breeders' Cup Turf and a son of the highly successful sire Kris S.
Bred and raced by Fred F. Bradley of Frankfort, Kentucky, Brass Hat is trained by his son William "Buff" Bradley.
Racing career
After a successful three-year-old season in 2004, Brass Hat won once in two starts in 2005. In 2006 he won two of four starts. He set a new Gulfstream Park track record of 1:47.79 for 9 furlongs in the Grade I Donn Handicap. He finished second to Electrocutionist in the March 25th Dubai World Cup but was disqualified after a post-race test revealed trace amounts of the banned drug methyl prednisolone acetate. While owner Fred Bradley did not dispute the positive test, he asserted that the therapeutic medication given the horse 28 days prior to the World Cup was well within the guidelines put out by the Emirates Racing Association. The disqualification was upheld on appeal. In mid summer, Brass Hat suffered a sesamoid fracture that kept him out of racing for several months.
Returning to the track in 2007, Brass Hat set another track record at Churchill Downs, winning an 8.5 furlong race in 1:41.27. He then finished eighth in the Whitney Handicap and sixth in the Woodward Stakes at Saratoga Race Course but returned to winning form in September when he captured the Massachusetts Handicap.
He then finished eighth in the 2007 Fayette Stakes and second Clark Handicap.
Returning to the track in 2008, the then seven-year-old gelding brought in a strong performance in the grade 1 Donn Handicap, a race that he had won two years before, finishing fourth. Then he headed to Fairgrounds, to race in the New Orleans Handicap, where he once again finished fourth.
He also finished third in the Fifth Third Elkhorn Stakes, fourth in the Louisville Handicap, fifth in the Stephen Foster Handicap to two time Horse of the Year Curlin, eighth in the Dust Commander Stakes, and just recently, fifth in the grade 2 Muniz Handicap.
On May 23, 2009, after going winless since September 2007, Brass Hat took the Louisville Handicap under Calvin Borel (winner of 2009's Kentucky Derby, Kentucky Oaks and Preakness Stakes). With this win, the 8-year-old gelding nears the two million mark in earnings. And then at the age of 9, on October 21, 2010, he took the Sycamore Stakes taking him over 2 million dollars.
References
Brass Hat's pedigree and partial racing stats
Brass Hat's official website
June 27, 2006 Bloodhorse.com article titled Emirates Appeals Panel Upholds Brass Hat Disqualification
2001 racehorse births
Racehorses bred in Kentucky
Racehorses trained in the United States
Thoroughbred family 8-c
|
Letícia Persiles (; born 2 January 1983) is a Brazilian actress and singer who played the lead role in the telenovela Amor Eterno Amor.
Biography
Born in Rio de Janeiro, Letícia Persiles has a son with her husband, the director Luiz Fernando Carvalho, who she met for the first time during the filming of the 2008 miniseries Capitu.
Career
Acting career
She played the teenage Capitu in the Rede Globo miniseries Capitu, based on the book Dom Casmurro, by Brazilian writer Machado de Assis. Letícia Persiles played the lead role in the 2012 telenovela Amor Eterno Amor as the journalist Miriam Allende, who is the main romantic interest of the character played by Gabriel Braga Nunes. Letícia Persiles replaced Carol Castro, who was originally cast to play the lead role of the telenovela. She plays Alinne Moraes best friend, Anita, in the 2015 telenovela Além do Tempo.
Singing career
Letícia Persiles is the vocalist of the band Manacá.
Filmography
Television
Cinema
References
External links
1983 births
Living people
Singers from Rio de Janeiro (city)
Brazilian television actresses
Actresses from Rio de Janeiro (city)
21st-century Brazilian singers
21st-century Brazilian women singers
|
```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.netflix.metacat.main.configs;
import org.springframework.boot.autoconfigure.condition.ConditionalOnProperty;
import org.springframework.cache.annotation.EnableCaching;
import org.springframework.context.annotation.Configuration;
/**
* Spring configuration for cache.
*
* @author amajumdar
* @since 1.2.0
*/
@Configuration
@ConditionalOnProperty(value = "metacat.cache.enabled", havingValue = "true")
@EnableCaching
public class CacheConfig {
}
```
|
A Guide to Berlin may refer to:
A Guide to Berlin (short story), a 1925 short story by Vladimir Nabokov
A Guide to Berlin (novel), a 2015 novel by Gail Jones
|
The Tyler metropolitan area, or Greater Tyler area centered on the city of Tyler, Texas, is one of the largest Texan metropolitan areas in East Texas. It had a combined population of 216,080 according to the 2010 U.S. census, and 233,479 in 2020. The Tyler metropolitan area encompasses all of Smith County.
Geography
According to the U.S. Census Bureau, the county has a total area of , of which are land and (3.0%) are covered by water.
The county infrastructure includes some of two-lane county roads, 70% of which were rated "bad" or "poor" in 2004. The county commissioners court appointed a new county engineer in 2005 and initiated an aggressive reconstruction campaign. After the election of 2006, this reconstruction campaign was cut back by the court. During this period, a controversial pay increase for commissioners and the county judge was passed by a 3–2 vote. After heated protests from the public, the pay rates were eventually rolled back and new legislation was proposed in the state legislature to prohibit commissioners and county judges from authorizing raises for themselves during their first term of office.
Major highways
Interstate 20
U.S. Highway 69
U.S. Highway 80
U.S. Highway 271
State Highway 31
State Highway 57
State Highway 64
State Highway 110
State Highway 135
State Highway 155
Loop 49
Loop 323
Communities
Cities
Arp
Hideaway
New Chapel Hill
Noonday
Overton (partially in Rusk County)
Tyler (principal city)
Troup (partially in Cherokee County)
Whitehouse
Towns
Bullard (partially in Cherokee County)
Lindale
Winona
Unincorporated communities
Bascom
Carroll
Chapel Hill
Copeland
Elberta
Flint
Garden Valley
Gresham
Jamestown
Midway
Mount Sylvan
New Hope
Owentown
Pine Springs
Red Springs
Shady Grove
Starrville
Swan
Teaselville
Thedford
Demographics
Note: the US Census treats Hispanic/Latino as an ethnic category. This table excludes Latinos from the racial categories and assigns them to a separate category. Hispanics/Latinos can be of any race.
According to the 2010 U.S. census, 209,714 people and 76,427 households were residing in the metropolitan. By the 2020 census, there were 233,479 people residing in the metropolitan area. According to the 2021 American Community Survey, its population increased to 237,186. In 2010, the population density was . The 87,309 housing units averaged 91.9 per mi2.
The racial and ethnic makeup of the area in 2010 was 70.1% White, 17.9% African American, 0.5% Native American, 1.2% Asian, and 2.0% persons reporting two or more races. About 17.2% of the population was Hispanic or Latino of any race. Per 2021 ACS estimates, its racial makeup was 58% White, 17% Black or African American, 2% Asian American, 2% multiracial, and 21% Hispanic or Latino of any race.
In 2010, the median income for a household in the metropolis was $46,139. The per capita income was $25,374. About 15.4% of families and 13.80% of the population were below the poverty line. In 2021, its median income was $63,115 for a household; there was a per capita income of $31,682. An estimated 12.5% of the metropolitan population lived at or below the poverty line.
As of 2010, the age distribution was 26.60% under the age of 18, 9.80% from 18 to 24, 27.40% from 25 to 44, 22.10% from 45 to 64, and 14.10% who were 65 or older. The median age was 36 years. For every 100 females, there were 92.10 males. For every 100 females age 18 and over, there were 87.90 males. In 2021, Greater Tyler's median age was 37.4, and 51% was female.
Religiously and spiritually, Greater Tyler is predominantly Christian as part of the Bible Belt. In 2020, the Association of Religion Data Archives determined Baptists, non/inter-denominational Protestants, and Roman Catholics constituted the largest share of Christendom for the metropolitan statistical area. Among the Baptists, the Southern Baptist Convention was the largest single denomination with 55,663 members spread throughout 94 churches; non/inter-denominational Protestants numbered 22,788 in 76 churches, and Roman Catholics of the Tyler Diocese numbered 22,428 throughout 8 churches. Altogether, the American Baptist Associates, National Baptists of America, National Baptists, National Missionary Baptists, Progressive National Baptists, and Southern Baptists had 60,025 members.
Outside of the predominantly Baptist, ecumenical, and Roman Catholic communities, the same 2020 study tabulated 11,161 Methodists divided among the African Methodist Episcopal, Christian Methodist Episcopal, and United Methodist churches. There were 4,800 members of the Churches of Christ, and Pentecostalism reflected a substantial metropolitan population with 3,330 members of the Church of God in Christ, and 2,647 of the Assemblies of God USA.
In non-Christian religious communities, Greater Tylerites were had a minor influence from Conservative and Reform Jews numbering 254. The Association of Religion Data Archives estimated there were approximately 782 Muslims. According to a separate study by Sperling's BestPlaces in 2020, 0.4% of the total metropolitan population adhered to Islam, making it the largest non-Christian religion, but one of the smallest metropolitan Islamic populations in Texas.
Economy
In addition to the city's role in the rose-growing industry, Tyler city-proper is the headquarters for Brookshire Grocery Company, which operates Brookshire's, Fresh, Super 1 Foods, and Spring Market supermarkets in the Ark-La-Tex and parts of Dallas–Fort Worth. The company's main distribution center is in south Tyler, while SouthWest Foods, a subsidiary that processes dairy products, is just northeast of the city.
The city and metropolitan area also has a growing manufacturing sector including: Tyler Pipe, a subsidiary of McWane Inc. that produces soil and utility pipe products; Trane Technologies Inc., formerly a unit of American Standard Companies, which manufactures air conditioners and heat pumps (this plant was originally built in 1955 by General Electric); Delek Refining, an Israeli-owned oil refinery formerly La Gloria Oil and Gas Co (a Crown Central Petroleum subsidiary); PCSFerguson, an operating company of Dover Corporation that specializes in equipment for the measurement and production of natural gas using the plunger lift method; DYNAenergetics Tyler Distribution Center, part of DYNAenergetics USA, which manufactures perforating equipment and explosives for the oil and gas industry; and Vesuvius USA, a manufacturer of refractory ceramics used in the steel industry.
Beyond manufacturing and grocery markets, Tyler is the headquarters for Cavender's, Southside Bank, and Synthesizers.com. Other corporations with major presence within the metropolitan statistical area include AT&T, T-Mobile US, Cricket Wireless and Metro by T-Mobile, Chase Bank, BBVA, Best Buy, and Walmart. Tyler is also home to the Caldwell Zoo and Broadway Square Mall.
According to the city's 2012–2013 Comprehensive Annual Financial Report, the city of Tyler's top ten employers were:
Sports
College and university teams
University of Texas at Tyler Patriots (NCAA Division II)
Texas College Steers (HBCU)
Tyler Junior College Apaches (NJCAA)
Baseball teams
Tyler Elbertas (1912)
Tyler Trojans (1924–1929, 1931, 1935–1940, 1946–1950)
Tyler Sports (1932)
Tyler Governors (1933–1934)
Tyler East Texans (1950–1953)
Tyler Tigers (1954–1955)
Tyler Wildcatters (1994–1997)
Tyler Roughnecks (2001)
Football
East Texas Twisters (2004)
Road races
Fresh 15 Road Race (Annual)
Soccer
Tyler FC (2016–Present)
Disc golf
Tyler features fifteen disc golf courses and seven leagues, and the surrounding area features a total of thirty-six courses and seventeen leagues. For these reasons, users of the disc golf app UDisc ranked Tyler as the third best disc golf destination in Texas and second best in the United States.
Education
The metropolitan area's higher education institutions include the University of Texas at Tyler and the University of Texas Health Center at Tyler, both part of the University of Texas System, as well as Tyler Junior College and Texas College.
Media
Currently, 18 media outlets and one newspaper are located in Tyler, as well as many more in the surrounding areas.
Newspaper
Tyler Morning Telegraph
Television
Radio
AM stations
FM stations
Transportation
The most common form of transportation is the motor vehicle. Tyler is a nexus of several major highways. Interstate 20 runs along the north edge of the city going east and west, U.S. Highway 69 runs north–south through the center of town and State Highway 64 runs east–west through the city. Tyler also has access to U.S. Highway 271, State Highway 31, State Highway 155, and State Highway 110. Loop 323 was established in 1957 and encircles the city, which has continued to grow outside of this loop. Loop 49 is a limited access "outer loop" around the city and currently runs from State Highway 110 south of Tyler to US 69 northwest of Tyler near Lindale. Loop 124 is in length.
Public transportation
Tyler Transit provides customers with public transportation service within the City of Tyler. The buses run daily, excluding Sundays and holidays. Tyler Transit offers customers the option to purchase tickets, tokens, or passes at the Tyler Transit office, at 210 E. Oakwood Street inside the Cotton Belt Railroad Depot at the main transfer point. The City of Tyler paratransit service is a shared-ride, public transportation service. Requests for service must be made the day before the service is needed. Trips can be scheduled up to 14 days in advance. ADA compliant paratransit service is provided to all origins and destinations within the service area defined as the city limits of Tyler. Greyhound Lines bus service is available through a downtown terminal.
Air
Tyler Pounds Regional Airport offers service to and from Dallas–Fort Worth International Airport via American Eagle, providing service with Embraer ERJ-135 and ERJ-145 regional jets. General Aviation services are provided by two fixed-base operators, Johnson Aviation and the Jet Center of Tyler.
Train
Tyler was the hub for a series of short-line railroads which later evolved into the St. Louis Southwestern Railway, better known as "The Cotton Belt Route," with the city last being a stop on the unnamed successor to the Morning Star between St. Louis and Dallas. This line later became part of the Southern Pacific Railroad, which itself merged with the Union Pacific Railroad, which continues to serve the city today with freight traffic. No passenger train service to Tyler has occurred since April 1956, but Amtrak's Texas Eagle runs through the city of Mineola, a short distance north of Tyler.
Walkability
A 2014 study by Walk Score ranked Tyler with a walkability score of 32 (out of 100) with some amenities within walking distance.
References
Tyler, Texas
Smith County, Texas
History of Tyler, Texas
|
```objective-c
#pragma once
#include "envoy/access_log/access_log_config.h"
#include "source/extensions/common/wasm/remote_async_datasource.h"
namespace Envoy {
namespace Extensions {
namespace AccessLoggers {
namespace Wasm {
/**
* Config registration for the file access log. @see AccessLogInstanceFactory.
*/
class WasmAccessLogFactory : public AccessLog::AccessLogInstanceFactory,
Logger::Loggable<Logger::Id::wasm> {
public:
AccessLog::InstanceSharedPtr
createAccessLogInstance(const Protobuf::Message& config, AccessLog::FilterPtr&& filter,
Server::Configuration::FactoryContext& context) override;
ProtobufTypes::MessagePtr createEmptyConfigProto() override;
std::string name() const override;
private:
absl::flat_hash_map<std::string, std::string> convertJsonFormatToMap(ProtobufWkt::Struct config);
RemoteAsyncDataProviderPtr remote_data_provider_;
};
} // namespace Wasm
} // namespace AccessLoggers
} // namespace Extensions
} // namespace Envoy
```
|
```python
# mypy: allow-untyped-defs
import argparse
import os
from enum import Enum
from typing import cast, Dict, List, Optional, Union
import torch
import torch.distributed as dist
from torch.distributed._shard._utils import narrow_tensor_by_index
from torch.distributed.checkpoint import FileSystemReader, FileSystemWriter
from torch.distributed.checkpoint._nested_dict import flatten_state_dict
from torch.distributed.checkpoint.default_planner import (
_EmptyStateDictLoadPlanner,
DefaultLoadPlanner,
)
from torch.distributed.checkpoint.metadata import (
Metadata,
STATE_DICT_TYPE,
STORAGE_TYPES,
TensorProperties,
TensorStorageMetadata,
)
from torch.distributed.checkpoint.planner import LoadItemType, LoadPlan, LoadPlanner
from torch.distributed.checkpoint.planner_helpers import _create_chunk_list
from torch.distributed.checkpoint.state_dict_loader import _load_state_dict
from torch.distributed.checkpoint.state_dict_saver import _save_state_dict
from torch.distributed.checkpoint.storage import StorageReader
from torch.futures import Future
__all__ = [
"dcp_to_torch_save",
"torch_save_to_dcp",
"BroadcastingTorchSaveReader",
"DynamicMetaLoadPlanner",
]
class BroadcastingTorchSaveReader(StorageReader):
"""
StorageReader for reading a Torch Save file. This reader will read the entire checkpoint
on the coordinator rank, and then broadcast and shard each tensor to all ranks.
. N.B. Intended to be used with DynamicMetaLoadPlanner
.. warning::
Current implementation only supports loading Tensors.
>>> # xdoctest: +SKIP("undefined vars")
>>> sd = {"mode": model}
>>> dcp.load(
>>> sd,
>>> storage_reader=BroadcastingTorchSaveReader(),
>>> planner=DynamicMetaLoadPlanner(),
>>> checkpoint_id="path_to_model.pt"
>>> )
"""
def __init__(
self,
checkpoint_id: Optional[Union[str, os.PathLike]] = None,
coordinator_rank: int = 0,
) -> None:
self.checkpoint_id = checkpoint_id
self.coordinator_rank = coordinator_rank
def read_metadata(self) -> Metadata:
"""Extends the default StorageReader to support building the metadata file"""
# Metadata is built in planner.set_up_planner, since we are not actually reading metadata from
# the disk
return Metadata(state_dict_metadata={})
def read_data(self, plan: LoadPlan, planner: LoadPlanner) -> Future[None]:
"""
Reads torch save data on the coordinator rank, and broadcast afterwards
this incurrs a communication cost, but avoids having to load
the entire checkpoint on each rank, hopefully preventing OOM issues
"""
planner = cast(DefaultLoadPlanner, planner)
# data is read in on the coordinator rank, and broadcast afterwards
# this incurrs a communication cost, but it avoids having to load
# the entire checkpoint on each rank, hopefully preventing OOM issues
# TODO: read on each host, instead of only the coordinator
if self.is_coordinator:
assert self.checkpoint_id is not None
torch_state_dict = torch.load(
self.checkpoint_id, map_location="cpu", weights_only=False
)
if planner.flatten_state_dict:
torch_state_dict, _ = flatten_state_dict(torch_state_dict)
else:
torch_state_dict = None
for req in plan.items:
if req.type == LoadItemType.BYTE_IO:
raise RuntimeError(
f"Non-tensor value identified at {req.storage_index.fqn}. "
f"At this time {type(self).__name__} only supports loading Tensors."
)
# Broadcast the tensor from the coordinator rank
if self.is_coordinator:
pg_device = dist.distributed_c10d._get_pg_default_device()
tensor = torch_state_dict[req.storage_index.fqn].to(pg_device)
else:
tensor = torch.empty_like(planner.state_dict[req.storage_index.fqn])
dist.broadcast(tensor, src=self.coordinator_rank, async_op=False)
tensor = narrow_tensor_by_index(tensor, req.storage_offsets, req.lengths)
target_tensor = planner.resolve_tensor(req).detach()
assert target_tensor.size() == tensor.size(), (
f"req {req.storage_index} mismatch sizes, "
f"{target_tensor.size()} vs {tensor.size()}"
)
target_tensor.copy_(tensor)
planner.commit_tensor(req, target_tensor)
fut: Future = Future()
fut.set_result(None)
return fut
def set_up_storage_reader(self, metadata: Metadata, is_coordinator: bool) -> None:
"""Implementation of the StorageReader method"""
self.is_coordinator = is_coordinator
if self.is_coordinator:
assert dist.get_rank() == self.coordinator_rank
assert self.checkpoint_id is not None
def prepare_local_plan(self, plan: LoadPlan) -> LoadPlan:
"""Implementation of the StorageReader method"""
return plan
def prepare_global_plan(self, global_plan: List[LoadPlan]) -> List[LoadPlan]:
"""Implementation of the StorageReader method"""
return global_plan
def reset(self, checkpoint_id: Union[str, os.PathLike, None] = None) -> None:
"""Implementation of the StorageReader method"""
self.checkpoint_id = checkpoint_id
@classmethod
def validate_checkpoint_id(cls, checkpoint_id: Union[str, os.PathLike]) -> bool:
"""Implementation of the StorageReader method"""
return os.path.isfile(checkpoint_id)
class DynamicMetaLoadPlanner(DefaultLoadPlanner):
"""
Extension of DefaultLoadPlanner, which creates a new Metadata object based on the passed in state dict,
avoiding the need to read metadata from disk. This is useful when reading formats which don't have a
metadata file, like Torch Save files.
. N.B. Intended to be used with BroadcastingTorchSaveReader
.. warning::
Current implementation only supports loading Tensors.
>>> # xdoctest: +SKIP("undefined vars")
>>> sd = {"mode": model}
>>> dcp.load(
>>> sd,
>>> storage_reader=BroadcastingTorchSaveReader(),
>>> planner=DynamicMetaLoadPlanner(),
>>> checkpoint_id="path_to_model.pt"
>>> )
"""
def set_up_planner(
self,
state_dict: STATE_DICT_TYPE,
metadata: Optional[Metadata] = None,
is_coordinator: bool = False,
) -> None:
"""Setups of the planner, extnding default behavior by creating the Metadata object from the state dict"""
super().set_up_planner(state_dict, metadata, is_coordinator)
state_dict_metadata: Dict[str, STORAGE_TYPES] = {}
for key, tensor in self.state_dict.items():
if not torch.is_tensor(tensor):
raise RuntimeError(
f"Non-tensor value identified at {key}. "
f"At this time {type(self).__name__} only supports loading Tensors."
)
state_dict_metadata[key] = TensorStorageMetadata(
TensorProperties(dtype=tensor.dtype),
tensor.size(),
_create_chunk_list(tensor),
)
self.metadata = Metadata(state_dict_metadata=state_dict_metadata)
def dcp_to_torch_save(
dcp_checkpoint_dir: Union[str, os.PathLike],
torch_save_path: Union[str, os.PathLike],
):
"""
Given a directory containing a DCP checkpoint, this function will convert it into a
Torch save file.
Args:
dcp_checkpoint_dir: Directory containing the DCP checkpoint.
torch_save_path: Filename to store the converted Torch save file.
.. warning::
To avoid OOM, it's recommended to only run this function on a single rank.
"""
sd: STATE_DICT_TYPE = {}
_load_state_dict(
sd,
storage_reader=FileSystemReader(dcp_checkpoint_dir),
planner=_EmptyStateDictLoadPlanner(),
no_dist=True,
)
torch.save(sd, torch_save_path)
def torch_save_to_dcp(
torch_save_path: Union[str, os.PathLike],
dcp_checkpoint_dir: Union[str, os.PathLike],
):
"""
Given the location of a torch save file, converts it into a DCP checkpoint.
Args:
torch_save_path: Filename of the Torch save file.
dcp_checkpoint_dir: Directory to store the DCP checkpoint.
.. warning::
To avoid OOM, it's recommended to only run this function on a single rank.
"""
state_dict = torch.load(torch_save_path, weights_only=False)
# we don't need stateful behavior here because the expectation is anything loaded by
# torch.load would not contain stateful objects.
_save_state_dict(
state_dict, storage_writer=FileSystemWriter(dcp_checkpoint_dir), no_dist=True
)
if __name__ == "__main__":
class FormatMode(Enum):
TORCH_TO_DCP = "torch_to_dcp"
DCP_TO_TORCH = "dcp_to_torch"
# Parse command-line arguments
parser = argparse.ArgumentParser()
parser.add_argument(
"mode",
type=str,
help="Conversion mode",
choices=[m.value for m in FormatMode],
default=FormatMode.TORCH_TO_DCP,
)
parser.add_argument("src", type=str, help="Path to the source model")
parser.add_argument("dst", type=str, help="Path to the destination model")
args = parser.parse_args()
print(
f"Converting checkpoint from {args.src} to {args.dst} using method: '{args.mode}'"
)
checkpoint_missing_warning = (
f"No checkpoint found at {args.src}. Skipping conversion."
)
if args.mode == FormatMode.TORCH_TO_DCP.value:
if os.path.isfile(args.src):
torch_save_to_dcp(args.src, args.dst)
else:
print(checkpoint_missing_warning)
elif args.mode == FormatMode.DCP_TO_TORCH.value:
if os.path.isdir(args.src):
dcp_to_torch_save(args.src, args.dst)
else:
print(checkpoint_missing_warning)
else:
raise ValueError(f"Unknown conversion mode: {args.mode}")
```
|
Ithaca War Memorial and Park is a heritage-listed memorial and park at Enoggera Terrace, Paddington, Queensland, Australia. The memorial was designed and built by Arthur Henry Thurlow between 1921 and 1925. The park was built and designed by Alexander Jolly. It is also known as Alexander Jolly Park. It was added to the Queensland Heritage Register on 21 October 1992.
History
The Ithaca War Memorial and Park was created c.1922 by a committee on behalf of the citizens of the Town of Ithaca. The monument was designed and executed by Brisbane monumental masonry firm Arthur Henry Thurlow, under the supervision of R Black, the Ithaca town engineer. The park was laid out by Ithaca Town Council landscape gardener, Alexander Jolly.
The monument
The Ithaca Town Council first considered the creation of a memorial to the fallen as early as October 1915. In February 1916, the mayor W. R. Warmington unveiled an honour board listing the names of those from Ithaca who had volunteered for war service. Although unveiled at the Picture Palace in Enoggera Terrace, Red Hill, the intention was that the honour board would be permanently located in the Ithaca Town Council Chambers. At the time of its unveiling, the honour board contained over 400 names (of an estimated 700) as the council was dependent on relatives and friends sending in the names of those serving. By January 1917, the honour board was housed in the Council Chambers and had over 600 names. However, by later that year, there was a strong desire to have a more public acknowledgement of those served. In October 1917, there was a proposal by the Ithaca Parks Committee to plant an avenue of trees from Milton Road to Nash Street, while in November 1917 a meeting of citizens formed a committee to come up with a public memorial proposal. However, plans were abandoned in January 1918 when the Queensland Government's War Committee would not issue a permit to collect funds for the war memorials while war needs still went unmet.
However, after the Armistice on 11 November 1918, the desire for a memorial to the Ithaca fallen resurfaced. A week after the Armistice, the Town Council again considered planting trees with each one to individually commemorate a resident who had died in military service. However, by late 1919, funds were being raised for the memorial with the Ithaca Town Council committing to contribute 20% of the funds raised by residents, but the precise form of the memorial was yet to be determined despite numerous public meetings. Fundraising via donations, fetes, concerts and other activities continued until in June 1921 the Council decided that the funds (by then ) were sufficient to consider designs of the memorial. The Returned Sailors and Soldiers Imperial League of Australia proposed a memorial hall, suggesting it would be of greater community benefit than a monument, but the town council was concerned about ongoing maintenance cost of a hall. In July 1921, a decision had been made to commission a monument which would be located on Cook's Hill and would have the names of the fallen engraved upon it.
The Ithaca War Memorial was finally unveiled on 25 February 1922 by Sir Matthew Nathan, Governor of Queensland. The final cost of was raised by the local community. The stone memorial honours the 130 local men who died on active service during the First World War.
There were many different types of war memorials erected in Queensland, however, clock towers were comparatively rare. The memorial at Ithaca is the earliest of this type of memorial, and is the only one of its type in Brisbane. The clock was manufactured by the well-known Synchronome Electric Company of Brisbane, initially driven by a master clock in the adjacent Ithaca Fire Station.
The park
The park is situated on a parcel of land sandwiched between Enoggera and Latrobe Terraces on Cooks Hill. It was, and remains crown land designated for road purposes, but by 1922 the cutting along Latrobe Terrace negated future road use. The road survives only in the asphalted walkway beside the park, linking Enoggera and Latrobe Terraces.
In the first decade of the 20th century, Ithaca experienced a housing and population boom largely attributable to the expansion of the tramways through the area. Subsequently, in the 1910s the Ithaca Town Council embarked on a programme of civic improvements which included the formation and metalling of roads; tree planting; and the establishment of numerous embankment gardens, small reserves and street gardens.
Because of the hilly terrain, many of the new streets were divided, leaving embankments which the Ithaca Town Council considered were cheaper to plant and beautify than to cut down. This innovation in Brisbane civic landscaping led to the Council receiving numerous requests from other councils, interstate as well as Queensland, for photographs and plans of Ithaca street improvements. The War Memorial Park is one of the few areas from this period to have survived. Only small sections of the Waterworks Road rockeries remain, and most of the Cook's Hill garden was destroyed when the Paddington Tramways Substation was erected in 1929–30.
At the time of unveiling the hill top on which the memorial is located was bare, permitting the memorial to be a dominant landmark. Now that trees have become established, the landmark qualities of the memorial itself have diminished somewhat. However, the setting and location still forms a landmark within the streetscape.
The landscaping of the park was carried out by Alexander Jolly, Ithaca Town Council landscape gardener (and father of the first Mayor of Greater Brisbane, William Jolly). Son of a Scottish farmer, and a horticultural enthusiast, Jolly had arrived in Brisbane in 1879, aged 22 years. He was head gardener on Alexander Stewart's Glen Lyon estate at Ashgrove for at least seven years before he went to work for the Ithaca Town Council.
Jolly was a self-educated man, whose lifetime of gardening experience transformed the Ithaca townscape in the period c.1915–25. Other landscaping works by Jolly included the rockeries along Musgrave and Waterworks Roads and the landscaping of Cook's Hill. After his death in March 1925, the memorial park was renamed the Alexander Jolly Park, "in memory of one of the most esteemed men in the district", and as a "unique tribute . . . to the pick and shovel".
The Alexander Jolly Park, now known as Ithaca Memorial Park, has been maintained by the Brisbane City Council since 1925.
Significance of war memorials in Australia
Australia, and Queensland in particular, had few civic monuments before the First World War. The memorials erected in its wake became our first national monuments, recording the devastating impact of the war on a young nation. Australia lost 60,000 from a population of about 4 million, representing one in five of those who served. No previous or subsequent war has made such an impact on the nation.
Even before the end of the war, memorials became a spontaneous and highly visible expression of national grief. To those who erected them, they were as sacred as grave sites, substitute graves for the Australians whose bodies lay in battlefield cemeteries in Europe and the Middle East. British policy decreed that the Empire war dead were to be buried where they fell. The word "cenotaph", commonly applied to war memorials at the time, literally means "empty tomb".
Australian war memorials are distinctive in that they commemorate not only the dead. Australians were proud that their first great national army, unlike other belligerent armies, was composed entirely of volunteers, men worthy of honour whether or not they made the supreme sacrifice. Many memorials honour all who served from a locality, not just the dead, providing valuable evidence of community involvement in the war. Such evidence is not readily obtainable from military records, or from state or national listings, where names are categorised alphabetically or by military unit.
Australian war memorials are also valuable evidence of imperial and national loyalties, at the time, not seen as conflicting; the skills of local stonemasons, metalworkers and architects; and of popular taste. In Queensland, the soldier statue was the popular choice of memorial, whereas the obelisk predominated in the southern states, possibly a reflection of Queensland's larger working-class population and a lesser involvement of architects.
Many of the First World War monuments have been updated to record local involvement in later conflicts, and some have fallen victim to unsympathetic re-location and repair.
Description
Ithaca Memorial Park is located on a south sloping site on the side of a ridge, fronting Enoggera Terrace to the north and with a steep embankment to Latrobe Terrace below to the south. A bitumen path leads down at the eastern side boundary to Latrobe Terrace below. Another asphalt path, at a lesser gradient, sweeps up around the southwestern side of the memorial to Enoggera Terrace. The site includes two mature ficus trees on the western side and a planted embankment down to Latrobe Terrace.
The First World War Memorial comprises a pedestal and column surmounted by a clock with a face on all four sides. It sits on a square concrete platform and is surrounded by dry stone retaining walls and a concrete path. Steps lead to the memorial from each of the four sides forming a cross in plan, with the overall geometry softened by planting, retaining walls and the steep slope of the site.
The sandstone memorial sits on a smooth faced base step which is surmounted by a larger step of sandstone blocks with tapered sides. On the front face of this is a marble plaque. The pedestal comprises a recessed square pillar with engaged columns at each corner. Each face bears a recessed marble plate with the leaded names of the 130 men who died. The columns have Composite order capitals and bases and support a large entablature. The frieze has relief carved festoons on each face and has a small dentil course under the cornice which is composed of cyma recta and cyma reversa mouldings.
The entablature is surmounted by a square pillar on a slightly larger square base. Each face bears a semi circular recess with the word "Ithaca" carved in relief and pateras on each side. Above this is the pillar itself. Each face has a recessed panel with moulding and on the side facing Enoggera Terrace are two relief carved flags with the inscription "Honour the Brave" below. The pillar is surmounted by the clock which comprises a clock face on each side with hood moulds over each face. The top of the memorial is rounded and crowned by a sandstone sphere.
Heritage listing
Ithaca War Memorial and Park was listed on the Queensland Heritage Register on 21 October 1992 having satisfied the following criteria.
The place is important in demonstrating the evolution or pattern of Queensland's history.
War Memorials are important in demonstrating the pattern of Queensland's history as they are representative of a recurrent theme that involved most communities throughout the state. They provide evidence of an era of widespread Australian patriotism and nationalism, particularly during and following the First World War.
The place demonstrates rare, uncommon or endangered aspects of Queensland's cultural heritage.
It is rare as the earliest example of the clock tower type of memorial.
The place is important in demonstrating the principal characteristics of a particular class of cultural places.
The monuments manifest a unique documentary record and are demonstrative of popular taste in the inter-war period.
Erected , the memorial at Ithaca demonstrates the principal characteristics of a commemorative structure erected as an enduring record of a major historical event. This is achieved through the use of appropriate materials and design elements.
The place is important because of its aesthetic significance.
The aesthetic qualities and landmark value of the memorial in its purpose-designed setting contributes to the Paddington townscape.
The place has a strong or special association with a particular community or cultural group for social, cultural or spiritual reasons.
It has a strong and continuing association with the community as evidence of the impact of a major historic event and as a focal point for remembrance of that event. The park also has special associations with landscape gardener Alexander Jolly as one of the few remaining examples of his work, and with monumental masonry firm A H Thurlow.
References
Attribution
External links
Queensland Heritage Register
Paddington, Queensland
World War I memorials in Queensland
Articles incorporating text from the Queensland Heritage Register
|
```objective-c
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
//
// path_to_url
//
// Unless required by applicable law or agreed to in writing,
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
// specific language governing permissions and limitations
#pragma once
#include "arrow/sparse_tensor.h" // IWYU pragma: export
#include <memory>
namespace arrow {
namespace internal {
struct SparseTensorConverterMixin {
static bool IsNonZero(const uint8_t val) { return val != 0; }
static void AssignIndex(uint8_t* indices, int64_t val, const int elsize);
static int64_t GetIndexValue(const uint8_t* value_ptr, const int elsize);
};
Status MakeSparseCOOTensorFromTensor(const Tensor& tensor,
const std::shared_ptr<DataType>& index_value_type,
MemoryPool* pool,
std::shared_ptr<SparseIndex>* out_sparse_index,
std::shared_ptr<Buffer>* out_data);
Status MakeSparseCSXMatrixFromTensor(SparseMatrixCompressedAxis axis,
const Tensor& tensor,
const std::shared_ptr<DataType>& index_value_type,
MemoryPool* pool,
std::shared_ptr<SparseIndex>* out_sparse_index,
std::shared_ptr<Buffer>* out_data);
Status MakeSparseCSFTensorFromTensor(const Tensor& tensor,
const std::shared_ptr<DataType>& index_value_type,
MemoryPool* pool,
std::shared_ptr<SparseIndex>* out_sparse_index,
std::shared_ptr<Buffer>* out_data);
Result<std::shared_ptr<Tensor>> MakeTensorFromSparseCOOTensor(
MemoryPool* pool, const SparseCOOTensor* sparse_tensor);
Result<std::shared_ptr<Tensor>> MakeTensorFromSparseCSRMatrix(
MemoryPool* pool, const SparseCSRMatrix* sparse_tensor);
Result<std::shared_ptr<Tensor>> MakeTensorFromSparseCSCMatrix(
MemoryPool* pool, const SparseCSCMatrix* sparse_tensor);
Result<std::shared_ptr<Tensor>> MakeTensorFromSparseCSFTensor(
MemoryPool* pool, const SparseCSFTensor* sparse_tensor);
} // namespace internal
} // namespace arrow
```
|
```php
<?php
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
*/
namespace Google\Service\CloudRun;
class GoogleCloudRunOpV2VersionToPath extends \Google\Model
{
/**
* @var int
*/
public $mode;
/**
* @var string
*/
public $path;
/**
* @var string
*/
public $version;
/**
* @param int
*/
public function setMode($mode)
{
$this->mode = $mode;
}
/**
* @return int
*/
public function getMode()
{
return $this->mode;
}
/**
* @param string
*/
public function setPath($path)
{
$this->path = $path;
}
/**
* @return string
*/
public function getPath()
{
return $this->path;
}
/**
* @param string
*/
public function setVersion($version)
{
$this->version = $version;
}
/**
* @return string
*/
public function getVersion()
{
return $this->version;
}
}
// Adding a class alias for backwards compatibility with the previous class name.
class_alias(GoogleCloudRunOpV2VersionToPath::class, 'Google_Service_CloudRun_GoogleCloudRunOpV2VersionToPath');
```
|
```java
/*
* one or more contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright ownership.
*/
package io.camunda.zeebe.broker.exporter.repo;
import io.camunda.zeebe.broker.Loggers;
import io.camunda.zeebe.broker.exporter.context.ExporterContext;
import io.camunda.zeebe.broker.system.configuration.ExporterCfg;
import io.camunda.zeebe.exporter.api.Exporter;
import io.camunda.zeebe.util.jar.ExternalJarLoadException;
import io.camunda.zeebe.util.jar.ExternalJarRepository;
import io.camunda.zeebe.util.jar.ThreadContextUtil;
import io.micrometer.core.instrument.simple.SimpleMeterRegistry;
import java.time.InstantSource;
import java.util.Collections;
import java.util.HashMap;
import java.util.Map;
import org.slf4j.Logger;
public final class ExporterRepository {
private static final Logger LOG = Loggers.EXPORTER_LOGGER;
private static final int NULL_PARTITION_ID = Integer.MIN_VALUE;
private final ExternalJarRepository jarRepository;
private final Map<String, ExporterDescriptor> exporters;
public ExporterRepository() {
this(new HashMap<>(), new ExternalJarRepository());
}
public ExporterRepository(
final Map<String, ExporterDescriptor> exporters, final ExternalJarRepository jarRepository) {
this.exporters = exporters;
this.jarRepository = jarRepository;
}
public Map<String, ExporterDescriptor> getExporters() {
return Collections.unmodifiableMap(exporters);
}
public ExporterDescriptor load(final String id, final Class<? extends Exporter> exporterClass)
throws ExporterLoadException {
return load(id, exporterClass, null);
}
public ExporterDescriptor load(
final String id,
final Class<? extends Exporter> exporterClass,
final Map<String, Object> args)
throws ExporterLoadException {
ExporterDescriptor descriptor = exporters.get(id);
if (descriptor == null) {
descriptor = new ExporterDescriptor(id, exporterClass, args);
validate(descriptor);
exporters.put(id, descriptor);
}
return descriptor;
}
public ExporterDescriptor load(final String id, final ExporterCfg config)
throws ExporterLoadException, ExternalJarLoadException {
final ClassLoader classLoader;
final Class<? extends Exporter> exporterClass;
if (exporters.containsKey(id)) {
return exporters.get(id);
}
if (!config.isExternal()) {
classLoader = getClass().getClassLoader();
} else {
classLoader = jarRepository.load(config.getJarPath());
}
try {
final Class<?> specifiedClass = classLoader.loadClass(config.getClassName());
exporterClass = specifiedClass.asSubclass(Exporter.class);
} catch (final ClassNotFoundException | ClassCastException e) {
throw new ExporterLoadException(id, "cannot load specified class", e);
}
return load(id, exporterClass, config.getArgs());
}
private void validate(final ExporterDescriptor descriptor) throws ExporterLoadException {
try {
final Exporter instance = descriptor.newInstance();
final ExporterContext context =
new ExporterContext(
LOG,
descriptor.getConfiguration(),
NULL_PARTITION_ID,
new SimpleMeterRegistry(),
InstantSource.system());
ThreadContextUtil.runCheckedWithClassLoader(
() -> instance.configure(context), instance.getClass().getClassLoader());
} catch (final Exception ex) {
throw new ExporterLoadException(descriptor.getId(), "failed validation", ex);
}
}
}
```
|
```go
/*
path_to_url
Unless required by applicable law or agreed to in writing, software
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
// Code generated by client-gen. DO NOT EDIT.
package v1alpha1
import (
"context"
json "encoding/json"
"fmt"
"time"
v1alpha1 "k8s.io/api/admissionregistration/v1alpha1"
v1 "k8s.io/apimachinery/pkg/apis/meta/v1"
types "k8s.io/apimachinery/pkg/types"
watch "k8s.io/apimachinery/pkg/watch"
admissionregistrationv1alpha1 "k8s.io/client-go/applyconfigurations/admissionregistration/v1alpha1"
scheme "k8s.io/client-go/kubernetes/scheme"
rest "k8s.io/client-go/rest"
)
// ValidatingAdmissionPoliciesGetter has a method to return a ValidatingAdmissionPolicyInterface.
// A group's client should implement this interface.
type ValidatingAdmissionPoliciesGetter interface {
ValidatingAdmissionPolicies() ValidatingAdmissionPolicyInterface
}
// ValidatingAdmissionPolicyInterface has methods to work with ValidatingAdmissionPolicy resources.
type ValidatingAdmissionPolicyInterface interface {
Create(ctx context.Context, validatingAdmissionPolicy *v1alpha1.ValidatingAdmissionPolicy, opts v1.CreateOptions) (*v1alpha1.ValidatingAdmissionPolicy, error)
Update(ctx context.Context, validatingAdmissionPolicy *v1alpha1.ValidatingAdmissionPolicy, opts v1.UpdateOptions) (*v1alpha1.ValidatingAdmissionPolicy, error)
UpdateStatus(ctx context.Context, validatingAdmissionPolicy *v1alpha1.ValidatingAdmissionPolicy, opts v1.UpdateOptions) (*v1alpha1.ValidatingAdmissionPolicy, error)
Delete(ctx context.Context, name string, opts v1.DeleteOptions) error
DeleteCollection(ctx context.Context, opts v1.DeleteOptions, listOpts v1.ListOptions) error
Get(ctx context.Context, name string, opts v1.GetOptions) (*v1alpha1.ValidatingAdmissionPolicy, error)
List(ctx context.Context, opts v1.ListOptions) (*v1alpha1.ValidatingAdmissionPolicyList, error)
Watch(ctx context.Context, opts v1.ListOptions) (watch.Interface, error)
Patch(ctx context.Context, name string, pt types.PatchType, data []byte, opts v1.PatchOptions, subresources ...string) (result *v1alpha1.ValidatingAdmissionPolicy, err error)
Apply(ctx context.Context, validatingAdmissionPolicy *admissionregistrationv1alpha1.ValidatingAdmissionPolicyApplyConfiguration, opts v1.ApplyOptions) (result *v1alpha1.ValidatingAdmissionPolicy, err error)
ApplyStatus(ctx context.Context, validatingAdmissionPolicy *admissionregistrationv1alpha1.ValidatingAdmissionPolicyApplyConfiguration, opts v1.ApplyOptions) (result *v1alpha1.ValidatingAdmissionPolicy, err error)
ValidatingAdmissionPolicyExpansion
}
// validatingAdmissionPolicies implements ValidatingAdmissionPolicyInterface
type validatingAdmissionPolicies struct {
client rest.Interface
}
// newValidatingAdmissionPolicies returns a ValidatingAdmissionPolicies
func newValidatingAdmissionPolicies(c *AdmissionregistrationV1alpha1Client) *validatingAdmissionPolicies {
return &validatingAdmissionPolicies{
client: c.RESTClient(),
}
}
// Get takes name of the validatingAdmissionPolicy, and returns the corresponding validatingAdmissionPolicy object, and an error if there is any.
func (c *validatingAdmissionPolicies) Get(ctx context.Context, name string, options v1.GetOptions) (result *v1alpha1.ValidatingAdmissionPolicy, err error) {
result = &v1alpha1.ValidatingAdmissionPolicy{}
err = c.client.Get().
Resource("validatingadmissionpolicies").
Name(name).
VersionedParams(&options, scheme.ParameterCodec).
Do(ctx).
Into(result)
return
}
// List takes label and field selectors, and returns the list of ValidatingAdmissionPolicies that match those selectors.
func (c *validatingAdmissionPolicies) List(ctx context.Context, opts v1.ListOptions) (result *v1alpha1.ValidatingAdmissionPolicyList, err error) {
var timeout time.Duration
if opts.TimeoutSeconds != nil {
timeout = time.Duration(*opts.TimeoutSeconds) * time.Second
}
result = &v1alpha1.ValidatingAdmissionPolicyList{}
err = c.client.Get().
Resource("validatingadmissionpolicies").
VersionedParams(&opts, scheme.ParameterCodec).
Timeout(timeout).
Do(ctx).
Into(result)
return
}
// Watch returns a watch.Interface that watches the requested validatingAdmissionPolicies.
func (c *validatingAdmissionPolicies) Watch(ctx context.Context, opts v1.ListOptions) (watch.Interface, error) {
var timeout time.Duration
if opts.TimeoutSeconds != nil {
timeout = time.Duration(*opts.TimeoutSeconds) * time.Second
}
opts.Watch = true
return c.client.Get().
Resource("validatingadmissionpolicies").
VersionedParams(&opts, scheme.ParameterCodec).
Timeout(timeout).
Watch(ctx)
}
// Create takes the representation of a validatingAdmissionPolicy and creates it. Returns the server's representation of the validatingAdmissionPolicy, and an error, if there is any.
func (c *validatingAdmissionPolicies) Create(ctx context.Context, validatingAdmissionPolicy *v1alpha1.ValidatingAdmissionPolicy, opts v1.CreateOptions) (result *v1alpha1.ValidatingAdmissionPolicy, err error) {
result = &v1alpha1.ValidatingAdmissionPolicy{}
err = c.client.Post().
Resource("validatingadmissionpolicies").
VersionedParams(&opts, scheme.ParameterCodec).
Body(validatingAdmissionPolicy).
Do(ctx).
Into(result)
return
}
// Update takes the representation of a validatingAdmissionPolicy and updates it. Returns the server's representation of the validatingAdmissionPolicy, and an error, if there is any.
func (c *validatingAdmissionPolicies) Update(ctx context.Context, validatingAdmissionPolicy *v1alpha1.ValidatingAdmissionPolicy, opts v1.UpdateOptions) (result *v1alpha1.ValidatingAdmissionPolicy, err error) {
result = &v1alpha1.ValidatingAdmissionPolicy{}
err = c.client.Put().
Resource("validatingadmissionpolicies").
Name(validatingAdmissionPolicy.Name).
VersionedParams(&opts, scheme.ParameterCodec).
Body(validatingAdmissionPolicy).
Do(ctx).
Into(result)
return
}
// UpdateStatus was generated because the type contains a Status member.
// Add a +genclient:noStatus comment above the type to avoid generating UpdateStatus().
func (c *validatingAdmissionPolicies) UpdateStatus(ctx context.Context, validatingAdmissionPolicy *v1alpha1.ValidatingAdmissionPolicy, opts v1.UpdateOptions) (result *v1alpha1.ValidatingAdmissionPolicy, err error) {
result = &v1alpha1.ValidatingAdmissionPolicy{}
err = c.client.Put().
Resource("validatingadmissionpolicies").
Name(validatingAdmissionPolicy.Name).
SubResource("status").
VersionedParams(&opts, scheme.ParameterCodec).
Body(validatingAdmissionPolicy).
Do(ctx).
Into(result)
return
}
// Delete takes name of the validatingAdmissionPolicy and deletes it. Returns an error if one occurs.
func (c *validatingAdmissionPolicies) Delete(ctx context.Context, name string, opts v1.DeleteOptions) error {
return c.client.Delete().
Resource("validatingadmissionpolicies").
Name(name).
Body(&opts).
Do(ctx).
Error()
}
// DeleteCollection deletes a collection of objects.
func (c *validatingAdmissionPolicies) DeleteCollection(ctx context.Context, opts v1.DeleteOptions, listOpts v1.ListOptions) error {
var timeout time.Duration
if listOpts.TimeoutSeconds != nil {
timeout = time.Duration(*listOpts.TimeoutSeconds) * time.Second
}
return c.client.Delete().
Resource("validatingadmissionpolicies").
VersionedParams(&listOpts, scheme.ParameterCodec).
Timeout(timeout).
Body(&opts).
Do(ctx).
Error()
}
// Patch applies the patch and returns the patched validatingAdmissionPolicy.
func (c *validatingAdmissionPolicies) Patch(ctx context.Context, name string, pt types.PatchType, data []byte, opts v1.PatchOptions, subresources ...string) (result *v1alpha1.ValidatingAdmissionPolicy, err error) {
result = &v1alpha1.ValidatingAdmissionPolicy{}
err = c.client.Patch(pt).
Resource("validatingadmissionpolicies").
Name(name).
SubResource(subresources...).
VersionedParams(&opts, scheme.ParameterCodec).
Body(data).
Do(ctx).
Into(result)
return
}
// Apply takes the given apply declarative configuration, applies it and returns the applied validatingAdmissionPolicy.
func (c *validatingAdmissionPolicies) Apply(ctx context.Context, validatingAdmissionPolicy *admissionregistrationv1alpha1.ValidatingAdmissionPolicyApplyConfiguration, opts v1.ApplyOptions) (result *v1alpha1.ValidatingAdmissionPolicy, err error) {
if validatingAdmissionPolicy == nil {
return nil, fmt.Errorf("validatingAdmissionPolicy provided to Apply must not be nil")
}
patchOpts := opts.ToPatchOptions()
data, err := json.Marshal(validatingAdmissionPolicy)
if err != nil {
return nil, err
}
name := validatingAdmissionPolicy.Name
if name == nil {
return nil, fmt.Errorf("validatingAdmissionPolicy.Name must be provided to Apply")
}
result = &v1alpha1.ValidatingAdmissionPolicy{}
err = c.client.Patch(types.ApplyPatchType).
Resource("validatingadmissionpolicies").
Name(*name).
VersionedParams(&patchOpts, scheme.ParameterCodec).
Body(data).
Do(ctx).
Into(result)
return
}
// ApplyStatus was generated because the type contains a Status member.
// Add a +genclient:noStatus comment above the type to avoid generating ApplyStatus().
func (c *validatingAdmissionPolicies) ApplyStatus(ctx context.Context, validatingAdmissionPolicy *admissionregistrationv1alpha1.ValidatingAdmissionPolicyApplyConfiguration, opts v1.ApplyOptions) (result *v1alpha1.ValidatingAdmissionPolicy, err error) {
if validatingAdmissionPolicy == nil {
return nil, fmt.Errorf("validatingAdmissionPolicy provided to Apply must not be nil")
}
patchOpts := opts.ToPatchOptions()
data, err := json.Marshal(validatingAdmissionPolicy)
if err != nil {
return nil, err
}
name := validatingAdmissionPolicy.Name
if name == nil {
return nil, fmt.Errorf("validatingAdmissionPolicy.Name must be provided to Apply")
}
result = &v1alpha1.ValidatingAdmissionPolicy{}
err = c.client.Patch(types.ApplyPatchType).
Resource("validatingadmissionpolicies").
Name(*name).
SubResource("status").
VersionedParams(&patchOpts, scheme.ParameterCodec).
Body(data).
Do(ctx).
Into(result)
return
}
```
|
```c
/* $OpenBSD: qsort.c,v 1.18 2017/05/30 14:54:09 millert Exp $ */
/*-
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University 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 REGENTS 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 REGENTS 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.
*/
#include <sys/types.h>
#include <stdlib.h>
static __inline char *med3(char *, char *, char *, int (*)(const void *, const void *));
static __inline void swapfunc(char *, char *, size_t, int);
#define min(a, b) (a) < (b) ? a : b
/*
* Qsort routine from Bentley & McIlroy's "Engineering a Sort Function".
*
* This version differs from Bentley & McIlroy in the following ways:
* 1. The partition value is swapped into a[0] instead of being
* stored out of line.
*
* 2. The swap function can swap 32-bit aligned elements on 64-bit
* platforms instead of swapping them as byte-aligned.
*
* 3. It uses David Musser's introsort algorithm to fall back to
* heapsort(3) when the recursion depth reaches 2*lg(n + 1).
* This avoids quicksort's quadratic behavior for pathological
* input without appreciably changing the average run time.
*
* 4. Tail recursion is eliminated when sorting the larger of two
* subpartitions to save stack space.
*/
#define SWAPTYPE_BYTEV 1
#define SWAPTYPE_INTV 2
#define SWAPTYPE_LONGV 3
#define SWAPTYPE_INT 4
#define SWAPTYPE_LONG 5
#define TYPE_ALIGNED(TYPE, a, es) \
(((char *)a - (char *)0) % sizeof(TYPE) == 0 && es % sizeof(TYPE) == 0)
#define swapcode(TYPE, parmi, parmj, n) { \
size_t i = (n) / sizeof (TYPE); \
TYPE *pi = (TYPE *) (parmi); \
TYPE *pj = (TYPE *) (parmj); \
do { \
TYPE t = *pi; \
*pi++ = *pj; \
*pj++ = t; \
} while (--i > 0); \
}
static __inline void
swapfunc(char *a, char *b, size_t n, int swaptype)
{
switch (swaptype) {
case SWAPTYPE_INT:
case SWAPTYPE_INTV:
swapcode(int, a, b, n);
break;
case SWAPTYPE_LONG:
case SWAPTYPE_LONGV:
swapcode(long, a, b, n);
break;
default:
swapcode(char, a, b, n);
break;
}
}
#define swap(a, b) do { \
switch (swaptype) { \
case SWAPTYPE_INT: { \
int t = *(int *)(a); \
*(int *)(a) = *(int *)(b); \
*(int *)(b) = t; \
break; \
} \
case SWAPTYPE_LONG: { \
long t = *(long *)(a); \
*(long *)(a) = *(long *)(b); \
*(long *)(b) = t; \
break; \
} \
default: \
swapfunc(a, b, es, swaptype); \
} \
} while (0)
#define vecswap(a, b, n) if ((n) > 0) swapfunc(a, b, n, swaptype)
static __inline char *
med3(char *a, char *b, char *c, int (*cmp)(const void *, const void *))
{
return cmp(a, b) < 0 ?
(cmp(b, c) < 0 ? b : (cmp(a, c) < 0 ? c : a ))
:(cmp(b, c) > 0 ? b : (cmp(a, c) < 0 ? a : c ));
}
static void
introsort(char *a, size_t n, size_t es, size_t maxdepth, int swaptype,
int (*cmp)(const void *, const void *))
{
char *pa, *pb, *pc, *pd, *pl, *pm, *pn;
int cmp_result;
size_t r, s;
loop: if (n < 7) {
for (pm = a + es; pm < a + n * es; pm += es)
for (pl = pm; pl > a && cmp(pl - es, pl) > 0;
pl -= es)
swap(pl, pl - es);
return;
}
if (maxdepth == 0) {
if (heapsort(a, n, es, cmp) == 0)
return;
}
maxdepth--;
pm = a + (n / 2) * es;
if (n > 7) {
pl = a;
pn = a + (n - 1) * es;
if (n > 40) {
s = (n / 8) * es;
pl = med3(pl, pl + s, pl + 2 * s, cmp);
pm = med3(pm - s, pm, pm + s, cmp);
pn = med3(pn - 2 * s, pn - s, pn, cmp);
}
pm = med3(pl, pm, pn, cmp);
}
swap(a, pm);
pa = pb = a + es;
pc = pd = a + (n - 1) * es;
for (;;) {
while (pb <= pc && (cmp_result = cmp(pb, a)) <= 0) {
if (cmp_result == 0) {
swap(pa, pb);
pa += es;
}
pb += es;
}
while (pb <= pc && (cmp_result = cmp(pc, a)) >= 0) {
if (cmp_result == 0) {
swap(pc, pd);
pd -= es;
}
pc -= es;
}
if (pb > pc)
break;
swap(pb, pc);
pb += es;
pc -= es;
}
pn = a + n * es;
r = min(pa - a, pb - pa);
vecswap(a, pb - r, r);
r = min(pd - pc, pn - pd - es);
vecswap(pb, pn - r, r);
/*
* To save stack space we sort the smaller side of the partition first
* using recursion and eliminate tail recursion for the larger side.
*/
r = pb - pa;
s = pd - pc;
if (r < s) {
/* Recurse for 1st side, iterate for 2nd side. */
if (s > es) {
if (r > es) {
introsort(a, r / es, es, maxdepth,
swaptype, cmp);
}
a = pn - s;
n = s / es;
goto loop;
}
} else {
/* Recurse for 2nd side, iterate for 1st side. */
if (r > es) {
if (s > es) {
introsort(pn - s, s / es, es, maxdepth,
swaptype, cmp);
}
n = r / es;
goto loop;
}
}
}
void
qsort(void *a, size_t n, size_t es, int (*cmp)(const void *, const void *))
{
size_t i, maxdepth = 0;
int swaptype;
/* Approximate 2*ceil(lg(n + 1)) */
for (i = n; i > 0; i >>= 1)
maxdepth++;
maxdepth *= 2;
if (TYPE_ALIGNED(long, a, es))
swaptype = es == sizeof(long) ? SWAPTYPE_LONG : SWAPTYPE_LONGV;
else if (sizeof(int) != sizeof(long) && TYPE_ALIGNED(int, a, es))
swaptype = es == sizeof(int) ? SWAPTYPE_INT : SWAPTYPE_INTV;
else
swaptype = SWAPTYPE_BYTEV;
introsort(a, n, es, maxdepth, swaptype, cmp);
}
DEF_STRONG(qsort);
```
|
Functional analytic psychotherapy (FAP) is a psychotherapeutic approach based on clinical behavior analysis (CBA) that focuses on the therapeutic relationship as a means to maximize client change. Specifically, FAP suggests that in-session contingent responding to client target behaviors leads to significant therapeutic improvements.
FAP was first conceptualized in the 1980s by psychologists Robert Kohlenberg and Mavis Tsai who, after noticing a clinically significant association between client outcomes and the quality of the therapeutic relationship, set out to develop a theoretical and psychodynamic model of behavioral psychotherapy based on these concepts. Behavioral principles (e.g., reinforcement, generalization) form the basis of FAP. (See below.)
FAP is an idiographic (as opposed to nomothetic) approach to psychotherapy. This means that FAP therapists focus on the function of a client's behavior instead of the form. The aim is to change a broad class of behaviors that might look different on the surface but all serve the same function. It is idiographic in that the client and therapist work together to form a unique clinical formulation of the client's therapeutic goals, rather than one therapeutic target for every client who enters therapy.
Basics
FAP posits that client behaviors that occur in their out-of-session interpersonal relationships (i.e. in the "real world") will, if clients are given a therapeutic relationship of sufficiently high quality, occur in the therapy session as well. Based on these in-session behaviors, FAP therapists, in collaboration with their client, develop a case formulation that includes classes of behaviors (based on their function not their form) that the client wishes to increase and decrease.
In-session occurrence of a client's problematic behavior is called clinically relevant behavior 1 (CRB1). In-session occurrence of improvements is called clinically relevant behavior 2 (CRB2). The goal of FAP therapy is to decrease the frequency of CRB1s and increase the frequency of CRB2s.
The FAP therapist evokes (i.e. sets the context for) CRB1s and in response gradually shapes CRB2s.
The five rules
"The five rules" operationalize the FAP therapist's behavior with respect to this goal. It is important to note that the five rules are not rules in the traditional sense of the word, but instead a set of guidelines for the FAP therapist.
Rule 1: Watch for CRBs – Therapists focus their attention on the occurrence of CRBs that are in-session problems (CRB1s) and improvements (CRB2s).
Rule 2: Evoke CRBs – Therapists set a context which evoke the client's CRBs.
Rule 3: Reinforce CRB2s naturally – Therapists reinforce the occurrence of CRB2s (in-session improvements), increasing the probability that these behaviors will occur more frequently.
Rule 4: Observe therapist impact in relation to client CRBs – Therapists assess the degree to which they actually reinforced behavioral improvements by noting the client's behavior subsequent behavior after Rule 3. This is similar to the behavior analytic concept of performing a functional analysis.
Rule 5: Provide functional interpretations and generalize – Therapists work with the client to generalize in-session behavioral improvements to the client's out-of-session relationships. This can include, but is not limited to, providing homework assignments.
The ACL model
Researchers at the Center for the Science of Social Connection at the University of Washington are developing a model of social connection that they believe is relevant to FAP. This model – called the ACL model – delineates behaviors relevant to social connection based on decades of scientific research.
Awareness (A) behaviors include paying attention to your own and the other's needs and values within an interpersonal relationship.
Courage (C) behaviors include experiencing emotion in the presence of another person, asking for what you need, and sharing deep, vulnerable experiences with another person in the service of improving the relationship.
Love (L) behaviors involve responding to another's courage behaviors with attunement to what that person needs in the moment. These include providing safety and acceptance in response to a client's vulnerability.
FAP has the potential to target awareness, courage, and love behaviors as they occur in session as described by the five rules above. More research is needed to confirm the utility of the ACL model.
Research support
Radical behaviorism and the field of clinical behavior analysis have strong scientific support. Additionally, researchers have conducted a number of case studies, component process analyses, a study with non-randomized design on FAP-enhanced cognitive therapy for depression, and a randomized controlled trial on FAP-enhanced acceptance and commitment therapy for smoking cessation.
Third generation behavior therapy
FAP belongs to a group of therapies referred to as third-generation behavior therapies (or third-wave behavior therapies) that includes dialectical behavior therapy (DBT), acceptance and commitment therapy (ACT), behavioral activation (BA), and integrative behavioral couples therapy (IBCT).
Criticism
FAP has been criticized for "being ahead of the data", i.e. having not enough empirical support to justify its widespread use. Challenges encountered by FAP researchers are widely discussed
There is also criticism of using the ACL model as it detracts from the idiographic nature of FAP.
Professional organizations
Association for Contextual Behavioral Science (ACBS) – Founded in 2005 (incorporated in 2006), the Association for Contextual Behavioral Science (ACBS) is dedicated to the advancement of functional contextual cognitive and behavioral science and practice so as to alleviate human suffering and advance human well-being.
The Association for Behavior Analysis International (ABAI) has a special interest group for practitioner issues, behavioral counseling, and clinical behavior analysis. ABAI has larger special interest groups for behavioral medicine. ABAI serves as the core intellectual home for behavior analysts.
The Association for Behavioral and Cognitive Therapies (ABCT) also has an interest group in behavior analysis, which focuses on clinical behavior analysis. In addition, the Association for Behavioral and Cognitive Therapies has a special interest group in addictions.
Doctoral level behavior analysts who are psychologists belong to the American Psychological Association's Division 25 (behavior analysis). APA offers a diplomate in behavioral psychology.
The World Association for Behavior Analysis offers a certification for clinical behavior analysis which covers functional analytic psychotherapy.
References
External links
Kohlenberg & Tsai's FAP website
Center for the Science of Social Connection
Cognitive behavioral therapy
Behaviorism
|
```html
<p bitTypography="body1">
{{ "enterVerificationCodeEmail" | i18n: twoFactorEmail }}
</p>
<bit-form-field>
<bit-label>{{ "verificationCode" | i18n }}</bit-label>
<input
bitInput
type="text"
appAutofocus
appInputVerbatim
[(ngModel)]="tokenValue"
(input)="token.emit(tokenValue)"
/>
<bit-hint>
<a bitLink href="#" appStopClick (click)="sendEmail(true)">
{{ "sendVerificationCodeEmailAgain" | i18n }}
</a></bit-hint
>
</bit-form-field>
```
|
Piso is an unincorporated community located in Pike County, Kentucky, United States. Their post office has been closed. The community was named by Bud Williamson after viewing an advertisement for medicine in an almanac.
References
Unincorporated communities in Pike County, Kentucky
Unincorporated communities in Kentucky
|
Macromia urania is a species of dragonfly in the family Macromiidae found in China, Hong Kong, Japan, Taiwan, and Vietnam. Its natural habitat is rivers, where it is threatened by habitat loss.
References
Macromiidae
Insects described in 1916
Taxonomy articles created by Polbot
|
, also known as Ritual, is a 2000 Japanese art film written and directed by Hideaki Anno. The film is Anno's second live-action feature. The screenplay is an adaption of Ayako Fujitani's novella Tōhimu, which was inspired by an emotionally difficult time in Los Angeles working on her father Steven Seagal's 1998 film The Patriot.
The film tells the story of a director (Shunji Iwai) who meets an odd young woman (Fujitani). Taking place over a period of 33 days, the plot involves these two characters trying to work their way out of a collective emotional funk. Michael Ordona of the Los Angeles Times reported the film had "dark themes of mental illness and suicidal ideation". Shiki-Jitsu won an award for Best Artistic Contribution at the 13th International Film Festival in Tokyo.
Story
The film follows a young Director returning to his home city of Ube in Yamaguchi Prefecture, and an eccentric young Woman he meets, whose quirks include saying "tomorrow is my birthday" every day and wearing very unusual clothing.
But as the days go by, it appears that the Woman has little touch with reality and is constantly escaping into a fantasy world, while the Director himself is a former anime director who is seeking to do a "real film" and embrace reality. The two eventually fall in love.
In the end, the Director confronts the Woman with her mother, allowing the Woman to make the first steps into the real world. The films ends with the Girl circling December 7 as her real birthday and the words "beyond the 33rd day: unknown".
Release
The film was produced by Studio Kajino, an offshoot of Studio Ghibli, run by its former president Toshio Suzuki who served on the film as executive producer. It was given a première at the Tokyo Photography Museum in Ebisu Garden Place on December 7, 2000.
The movie was later released on VHS and DVD by Buena Vista Home Entertainment Japan July 24, 2003 as part of the "Ghibli Cinematic Library" series. On July 1, 2020, the movie was released to Video on demand by King Records.
References
External links
Tokyo Movie Report 26
Shiki-Jitsu page on Hideaki Anno - Life After Evangelion
Japanese drama films
2000 films
Films directed by Hideaki Anno
Films with screenplays by Hideaki Anno
2000s Japanese-language films
|
Larry Philip Buttrose (born 16 December 1952) is an Australian writer, journalist and academic. He is the ghostwriter of the Saroo Brierley memoir A Long Way Home (adapted for the screen as the major international feature film Lion).
Personal life
Buttrose was born in Adelaide, South Australia. At the age of 17 he co-founded the poetry magazine Dharma (later titled Real Poetry) with his then partner Donna Maegraith and friend Stephen Measday. While at university he trained as a journalist with the Australian Broadcasting Commission, and after graduating he worked as a freelance journalist. He gained his PhD from the University of Adelaide in 2011. He now lives in Sydney with his wife and two children.
Career
Buttrose published his first collection of poems, One Steps Across The Rainbow in 1974, at the age of 21. His first major collection, The Leichhardt Heater Journey (1982), was the first title in the long-running Friendly Street Poets series. He also co-edited the Number 3 Friendly Street anthology with Peter Goldsworthy. Angus & Robertson published Buttrose's first book of travel writing, The King Neptune Day & Night Club in 1992, and the critically acclaimed best-seller Cafe Royale (later retitled The Blue Man) followed in 1997. In 2004, he collaborated on the memoir by Michael Hutchence's brother Rhett, Total Xcess, and other books followed, including Tales of the Popes (2009) and the satirical graphic novel Finding the Shelf Within (2009).
He has also written extensively for the stage, his produced works including Pallas (1987), Kurtz (1991), the co-written musical Hot Shoe Shuffle (1992) and Complaints (1996). The ABC has produced two plays for radio, Santo (1986) and Complaints (1993).
He has contributed journalism to Roadrunner (Australian music magazine) and Rolling Stone, and opinion to various newspapers.
His best known book is A Long Way Home, the Saroo Brierley memoir, which he ghost-wrote in 2012. He researched and wrote the book between September and December of that year, including research trips to Hobart to interview Saroo and his family, and a month-long journey to India with Saroo. There he met Saroo's Indian family, and travelled with Saroo on a rail journey across India, retracing for the first time the journey that Saroo took two and a half decades before as a young child, that ended him in Calcutta (now Kolkata). Buttrose completed the book in his Kolkata hotel room.
He has also taught writing and media at various Australian universities. He holds a PhD in creative writing from Adelaide University (2011).
Cabaret and comedy
In 1982 Buttrose joined Len Lindon's innovative comedy cabaret group Quietly Confident. The group moved to Sydney later that year, establishing itself in Surry Hills. They performed at many of the city's leading venues, including Kinselas, the Tivoli, Stranded and Art Unit. They released a single, Republic of Australia, and in 1983 performed a self-devised play, Scenario X, about the sacking of the Whitlam government, at the Nimrod Theatre. The group broke up that year, but in late 1983 Buttrose co-founded The Gap cabaret venue at the Sydney Trade Union Club with his then partner comedian Mandy Salomon, and their business partner, Judy Barnsley.
The Gap ran from 1983 to 1987, and helped launch the careers of a host of performers, including Salomon herself (with whom Buttrose collaborated in a creative partnership), Gretel Killeen and Julie McCrossin. Buttrose, Salomon and Barnsley also co-produced the Characters! series at The Gap and at the Sydney Theatre Company's Wharf Theatre, showcasing Australia's new generation of women comics, including Wendy Harmer, Mary-Anne Fahey, Gretel Killeen, Sue Ingleton, Angela Moore, Melanie Salomon, Victoria Roberts and Penny Biggins, poet Pam Brown, Sarah Miller (Told by an Idiot) and hosted by Mandy Salomon.
In 1986 Buttrose was approached by Mark Morgan of the Harold Park Hotel to start a weekly comedy night, called Comics in the Park. It quickly gained a following from audiences, and a number of Australia's leading comedians did their first performances there, including Bob Downe (whom Buttrose later managed), Flacco, Jimeoin, Kitty Flanagan, and the Umbilical Brothers. Others who performed there included Robin Williams, Vince Sorrenti, Austen Tayshus, George Smilovici, Steve Abbott, and Funny Stories.
Other interests
Buttrose plays squash and badminton, and in 2006 co-founded The Carringtonians, a long-running weekly drinks get-together for Blue Mountains writers and others, at the historic Carrington Hotel in Katoomba.
Books
Novels
The Maze of the Muse (1998)
Sweet Sentence (2001)
Humour and graphic novel
Finding The Shelf Within (2009)
Travel
The King Neptune Day & Night Club (1992)
Cafe Royale (1997)/The Blue Man (1999)
Poetry
One Steps Across The Rainbow (1974)
Random Leaves (1978)
The King Neptune Day & Night Club (1982)
Learning Italian (1986)
Non-fiction
Total Xcess (editor/collaborator, 2004)
People Who Changed the Modern World (2005)
Powerful & Influential People (2006)
Dead Famous: Deaths of the Famous and Famous Deaths (2007)
Tales of the Popes (2009)
Speeches of War and Peace (2009, Concise edition 2010)
Theatre
Scenario X (co-creator, 1983)
111 Foveaux (co-creator/director 1983)
Opera Opera! (co-creator/director 1985)
Rubble (co-creator/director 1987)
Pallas (1987)
Kurtz (1991)
Hot Shoe Shuffle (co-written with Kathryn Riding, 1992)
Complaints (1996)
Radio plays
Santo (1986)
Complaints (1993)
Film
Ozymandias (music film clip, director/producer/narrator, 1986)
Movietone Memories (1988)
Gino (feature co-written with Vince Sorrenti, 1993)
Sources
Ozymandias poetry-music film clip https://www.youtube.com/watch?v=jIfNpityBTQ
Interview with Judyth Piazza, SOP radio networks US http://thesop.org/story/art/2009/12/28/judyth-piazza-chats-with-larry-buttrose-author-of-tales-of-the-popes.php
Interview with ABC's Carol Duncan on Paul Keating's famous Redfern Speech https://web.archive.org/web/20120424013830/http://blogs.abc.net.au/nsw/2010/08/paul-keatings-redfern-speech-larry-buttrose.html?site=newcastle&program=newcastle_afternoons
Book extract from The Blue Man published in The Independent https://www.independent.co.uk/arts-entertainment/travel-songs-of-bitter-experience-1093712.html
Ockham's Razor on Science and Religion http://www.abc.net.au/rn/ockhamsrazor/stories/2009/2675731.htm
Ockham's Razor, critique of Postmodern Theory http://www.abc.net.au/rn/ockhamsrazor/stories/2006/1785351.htm
Opinion piece in The Australian on the international crisis of capitalism http://www.theaustralian.com.au/news/economic-abyss-awaits/story-e6frg7b6-1111118084331
Reflections upon surviving a brutal Catholic education, published in the Sydney Morning Herald http://www.smh.com.au/news/world/surviving-an-unholy-school-war/2008/05/16/1210765174220.html
Griffith Review – Profile on Larry Buttrose http://www.griffithreview.com/contributors/larry-buttrose
Larry Buttrose – Personal blog http://larrybuttrose.blogspot.com/
Guide to the Papers of Larry Buttrose at The University of New South Wales – http://lib.unsw.adfa.edu.au/speccoll/finding_aids/buttrose_larry.html
References
Writers from New South Wales
Writers from Adelaide
1952 births
Living people
|
NAACP Legal Defense & Educational Fund, Inc. v. Trump, No. 1:17-cv-05427-ALC (S.D.N.Y. 2017), was a lawsuit filed in the United States District Court for the Southern District of New York. The plaintiffs, the NAACP Legal Defense Fund, The Ordinary People Society, and a coalition of civil rights groups alleged that the defendants, President Donald Trump, the Vice President Michael Pence, and Kris Kobach were in violation of the Fifth and Fifteenth Amendments and the Federal Advisory Committee Act by establishing the Presidential Advisory Commission on Election Integrity (PEIC) for the purpose of intentionally discriminating against Black and Latino voters in violation of the Fifth and Fifteenth Amendments to the Constitution and the Federal Advisory Committee Act.
Background
Kris Kobach was the Secretary of State of Kansas from 2011 to 2019. On November 20, 2016, President Trump asked Kobach to co-chair a commission to investigate possible voting irregularities in the 2016 presidential election. Kobach was a defendant in parallel lawsuits filed by the Electronic Privacy Information Center and the ACLU.
On June 28, 2017, the Commission requested voter records from each of the states and the District of Columbia. Forty-four states rejected the request to deliver voter records
On July 10, 2017, the Commission postponed its request of the states.
The United States Department of Justice represented Trump.
According to the text of the complaint, the suit asked for a permanent injunction halting the operation of the Presidential Advisory Commission on Election Integrity.
Specific allegations
The President has neither constitutional nor statutory authority to create a new executive organ for the purpose of launching an investigation that targets individual or groups of voters.
President Trump has not appointed a commission for the purpose of consulting with fair-and-balanced advisors; rather, he has appointed a commission stacked with biased members to undertake an investigation into unfounded allegations of voter fraud, even though Congress has specifically delegated the authority to ensure the accuracy of voter rolls to the Election Assistance Commission and state election officials, not the President.
Violations of the Fifth and Fifteenth Amendments and Unauthorized Presidential Action
Procedural history
A second amended complaint was filed on October 20, 2017. The government moved to dismiss the case in November 2017. After the government disbanded the commission on January 3, 2018, the case was dismissed on February 28, 2018, at the NAACP Legal Defense Fund's request.
See also
List of lawsuits involving Donald Trump
ACLU v. Trump and Pence
Federal Advisory Committee Act
Presidential Advisory Commission on Election Integrity
References
Donald Trump litigation
United States District Court for the Southern District of New York cases
|
Sir John Norman Toothill CBE (11 November 1908 – 5 July 1986) was an English electrical engineer who rose to be Managing Director of Ferranti.
He was the author of the ground-breaking Toothill Report of 1961 and was one of the creators of the modern Scottish electronics industry.
Life
He was born on 11 November 1908 at 13 Trafford Road in Leicester, the only son of John Harold Toothill, an engineer's fitter, and his wife, Helena Gibbins.
Educated at Beaminster Grammar School in Dorset, Toothill left school at the age of seventeen to be apprenticed to Tilling Stevens Ltd, a company in Maidstone which made buses. From there he moved on to Hoffman Manufacturing and then to Harris Lebus, a furniture manufacturer. In 1935 he was appointed as chief cost accountant to Ferranti, which was then a company making electrical instruments, and in 1942 became manager of its new works in Edinburgh. He remained as general manager of Ferranti Scotland until 1968, promoting the company's development into precision engineering and playing a large part in the creation of a Scottish electronics industry. He remained a director of Ferranti until 1975 and in the 1970s and 1980s was also a director of R. W. Toothill Limited, W. A. Baxter & Sons Limited, Fochabers, Moray. He was chairman of AI Welders of Inverness and of Highland Hydrocarbons from 1979 until his death.
In 1947 Toothill was chosen as chairman of the Research Committee of the Scottish Council for Development and Industry, and later chaired its Finance Committee. In 1956 he became a director of Ferranti. He was appointed to an Inquiry into the Scottish Economy, and in 1961 his Toothill Report on the Scottish Economy was published, recommending new investment in the country's less prosperous areas. In the 1964 New Year Honours he was knighted.
Honours
Commander of the Order of the British Empire, 1955
Companion, Institution of Electrical Engineers
Honorary Companion, Royal Aeronautical Society
Knighthood, 1964
Honorary LLD, University of Aberdeen, 1966
Honorary DSc, Heriot-Watt University, 1968
Honorary DSc, Cranfield Institute of Technology, 1970
Notes
1908 births
1986 deaths
Commanders of the Order of the British Empire
English knights
People educated at Beaminster Grammar School
20th-century English businesspeople
|
Psychoanalytic conceptions of language refers to the intersection of psychoanalytic theory with linguistics and psycholinguistics. Language has been an integral component of the psychoanalytic framework since its inception.
Language is relevant to psychoanalysis in two key respects. First, it is important with respect to the supposed therapeutic process, serving as the principal means by which unconscious mental processes are given expression through the verbal exchange between analyst and patient, e.g. free association, dream analysis, transference-countertransference dynamics. Secondly, psychoanalytic theory is linked in many ways to linguistic phenomena, such as parapraxes. According to Sigmund Freud the essential difference between modes of thought characterized by primary (irrational, governed by the id) as opposed to secondary (logical, governed by the ego and external reality) thought processes is one of preverbal vs. verbal ways of conceptualizing the world.
Freud's ideas on language
In 1940 Sigmund Freud wrote "...the function of speech brings material in the ego into a firm connection with the residues of visual, but more particularly of auditory, perceptions."
Aphasia, thing- and word-presentations
One of Freud's earliest papers, On Aphasia (1891), was concerned with speech disorders of neurological mechanisms of which had been investigated earlier in the century by Paul Broca and Carl Wernicke. Freud was skeptical of Wernicke's findings, citing a paucity of clinical observation as his reason. Although he conceded the fact that language is linked to neurological processes, Freud repudiated a model of localization of brain function, according to which specific regions of the brain are responsible for certain cognitive functions. In contrast to most of his contemporaries, Freud rejected the notion that in most cases pathological phenomena are manifestations of physiological dysfunctions (Lanteri-Laura, 2005a).
In the same paper, Freud (1891) distinguishes between word-presentations, the mental images of words, and thing-presentations, the representations of actual objects. Word-presentations involve the linking of a conscious idea to a verbal stimulus, are associated with the secondary processes, and are oriented towards reality. Thing-presentations are essentially pre- or nonverbal images of objects, are associated with the primary processes, and are not necessarily connected with reality (Rycroft, 1995; Gibeault, 2005a, 2005b; Lanteri-Laura, 2005b). The influence of the external world on the ego is apparent here in that mental processes and word-presentations become connected only gradually as the ego differentiates from the id as a result of contact with the environment (Rycroft, 1995; Freud, 1923). The idea of thing vs. word-presentations is also evident in Freud's hypotheses concerning schizophrenia (Rycroft, 1995; Freud, 1894, 1896). It is suggested that, as a defense against intrapsychic conflict, schizophrenics divest thing-presentations of significance and come to treat word-presentations as actual things (cf. mental functioning in Piaget's preoperational stage of cognitive development).
Psychoanalysis and psycholinguistics
Over the past half century, there have been efforts by psychoanalysts and cognitive psychologists to bridge the gap between their two respective disciplines. Rizzuto (2002) has discussed the nature of the verbal exchange between analyst and patient in the context of Roman Jakobson's (1976, 1990) typology of the six functions of "the speech event": (1) referential, involving contextual information; (2) poetic, referring to the construction of the form of the message; (3) emotive, or the speaker's emotional influence vis-a-vis the receiver; (4) conative, or the speaker's orientation toward the receiver; (5) phatic, or the attempt to establish and maintain contact between speaker and receiver (e.g., "Can you hear me?"); and (6) metalingual, or the application of language to itself (e.g.,"What do you mean with that word?"). Rizzuto (2002) suggests that by paying an equal amount of attention to each of the six functions of the speech act, the analyst can obtain a more comprehensive picture of the patient's affective life. Conversely, by focusing on one function at a time, the analyst can ascertain the patient's different ways of mitigating anxiety or coping with stress.
In a symposium paper on psychoanalysis and linguistics, Harris (1995) offers a variety of reasons why the mutual exchange of ideas between the two disciplines is an important enterprise. The theoretical shift in psychoanalysis from libidinal (of the Libido) development and drive states to object relations and attachment, first initiated around the middle of the twentieth century, is now incorporating more and more elements of cognitive science and psycholinguistics. The framework of intersubjectivity and model of the therapeutic alliance as a reciprocal exchange constructed by both analyst and patient call for a modification to both theory and practice, the ultimate aim of which is to think of the analytic process more in terms of interpersonal relations and "complex language worlds" (p. 616). Furthermore, over the past twenty years infancy research has greatly informed psychoanalytic theory, and the concepts of symbolism and mental representation have influenced both frameworks. According to Harris (1995), the processes involved in the transition from nonverbal to verbal ways of thinking about and experiencing the world, first investigated in infancy research, have pointed to the relevance of language with respect to psychoanalytic thinking. A closer interdisciplinary relationship between psychoanalysis and linguistics could potentially bolster the former's status as a research paradigm at the intersection of hermeneutics and natural science, a reformulation that some analysts have suggested (Strenger, 1991).
The new journal Language and Psychoanalysis is just devoted to research in the intersection between psychoanalysis and linguistics.
References
A. de Mijolla (2005). "Anna O., case of." In: A. de Mijolla (Ed.), International dictionary of psychoanalysis, vol. 1 (pp. 87–89). Farmington Hills, MI: Thomson Gale.
Ephratt Michal, 2004, "The pig’s grunt: Grice’s cooperation principle and psychoanalytic transference discourse", Semiotica, Vol. 149(1/4), pp. 161–198.
Freud, S. (1891). On aphasia. E. Stengel (Trans.). International Universities Press, 1953.
Freud, S. (1894). The defense neuro-psychoses. In P. Rieff (Ed.), Early psychoanalytic writings(pp. 67–82). New York: Collier Books, 1963.
Freud, S., & Breuer, J. (1895). Studies on hysteria. New York: Basic Books, 2000.
Freud, S. (1896). Further remarks on the defense neuro-psychoses. In P. Rieff (Ed.), Early psychoanalytic writings (pp. 151–174). New York: Collier Books, 1963.
Freud, S. (1901). The psychopathology of everyday life. W.W. Norton & Co., 1971.
Freud, S. (1905). Jokes and their relation to the unconscious. W.W. Norton & Co., 1960.
Freud, S. (1915). The unconscious. In P. Rieff (Ed.), General psychological theory: Papers on metapsychology (pp. 116–150). New York: Simon & Schuster, 1991.
Freud, S. (1923). The ego and the id. New York: W.W. Norton & Co., 1960.
Freud, S. (1940). An outline of psychoanalysis. W.W. Norton & Co., 1969.
Gibeault, A. (2005a). Thing-presentation. In A. de Mijolla (Ed.), International dictionary of psychoanalysis, vol. 3 (pp. 1741–1743). Farmington Hills, MI: Thomson Gale.
Gibeault, A. (2005b). Word-presentation. In A. de Mijolla (Ed.), International dictionary of psychoanalysis, vol. 3 (pp. 1873–1875). Farmington Hills, MI: Thomson Gale.
Harris, A. (1995). Symposium on psychoanalysis and linguistics: Part 1. Psychoanalytic Dialogues, 5, 615–618.
Jakobson, R. (1976). Selected writings, vol. 7: Metalanguage as a linguistic problem. Hawthorne, NY: Mouton.
Jakobson, R. (1990). The speech event and the function of language. In L. R. Waugh & M. Monville-Burston (Eds.), On language. Cambridge, MA and London: Harvard University Press.
Lanteri-Laura, G. (2005a). Aphasia. In A. de Mijolla (Ed.), International dictionary of psychoanalysis, vol. 1 (pp. 106–107). Farmington Hills, MI: Thomson Gale.
Lanteri-Laura, G. (2005b). Language and disturbances of language. In A. de Mijolla (Ed.), International dictionary of psychoanalysis, vol. 2 (pp. 942–943). Farmington Hills, MI: Thomson Gale.
Rizzuto, A. (2002). Speech events, language development and the clinical situation. International Journal of Psycho-Analysis, 83, 1325–1343.
Rycroft, C. (1995). A critical dictionary of psychoanalysis. London: Penguin Books.
Strenger, C. (1991). Between hermeneutics and science. New York: International Universities Press.
Note
2. http://criminalisticassociation.org/Dokumenti/KTIP_12_20201219201241.pdf#page=8 (SCAN revisited through linguistic psychoanalysis)
Psychoanalysis
Psycholinguistics
Humour
|
```php
<?php
declare(strict_types=1);
/**
* Passbolt ~ Open source password manager for teams
*
* For full copyright and license information, please see the LICENSE.txt
* Redistributions of files must retain the above copyright notice.
*
* @link path_to_url Passbolt(tm)
* @since 3.0.0
*/
namespace App\Test\Factory;
use Cake\Chronos\Chronos;
use CakephpFixtureFactories\Factory\BaseFactory as CakephpBaseFactory;
use Faker\Generator;
/**
* ProfileFactory
*
* @method \App\Model\Entity\Profile|\App\Model\Entity\Profile[] persist()
* @method \App\Model\Entity\Profile getEntity()
* @method \App\Model\Entity\Profile[] getEntities()
* @method static \App\Model\Entity\Profile get($primaryKey, array $options = [])
*/
class ProfileFactory extends CakephpBaseFactory
{
/**
* Defines the Table Registry used to generate entities with
*
* @return string
*/
protected function getRootTableRegistryName(): string
{
return 'Profiles';
}
/**
* Defines the factory's default values. This is useful for
* not nullable fields. You may use methods of the present factory here too.
*
* @return void
*/
protected function setDefaultTemplate(): void
{
$this->setDefaultData(function (Generator $faker) {
return [
'first_name' => $faker->firstNameFemale(),
'last_name' => $faker->lastName(),
'user_id' => $faker->uuid(),
'created' => Chronos::now()->subDays($faker->randomNumber(4)),
'modified' => Chronos::now()->subDays($faker->randomNumber(4)),
];
});
}
}
```
|
```objective-c
/*
* C99-compatible strtod() implementation
*
* This file is part of FFmpeg.
*
* FFmpeg is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
*
* FFmpeg 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
*
* You should have received a copy of the GNU Lesser General Public
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#ifndef COMPAT_STRTOD_H
#define COMPAT_STRTOD_H
#include <stdlib.h>
extern double avpriv_strtod(const char *nptr, char **endptr);
#endif /* COMPAT_STRTOD_H */
```
|
```ruby
# OpenGraphTag is NOT registered in the Registry; rather, it is a fallback
class OpenGraphTag < LiquidTagBase
PARTIAL = "liquids/open_graph".freeze
attr_accessor :page
def initialize(_tag_name, url, _parse_context)
super
@url = url
@page = OpenGraph.new url
@url_domain = URI.parse(url).host.delete_prefix("www.")
end
def render(_context)
ApplicationController.render(
partial: PARTIAL,
locals: {
page: @page,
url: @url,
url_domain: @url_domain
},
)
end
end
```
|
```xml
<Project Sdk="Microsoft.NET.Sdk">
<PropertyGroup>
<TargetFramework>net8.0-tvos</TargetFramework>
<RootNamespace Condition="'$(name)' != '$(name{-VALUE-FORMS-}safe_namespace)'">tvOSApp1</RootNamespace>
<OutputType>Exe</OutputType>
<Nullable>enable</Nullable>
<ImplicitUsings>true</ImplicitUsings>
<SupportedOSPlatformVersion>minOSVersion</SupportedOSPlatformVersion>
</PropertyGroup>
</Project>
```
|
This is a list of wooden toys and games. A wooden toy is a toy constructed primarily from wood and wood products. Additional components made from other materials are also sometimes used.
Wooden toys
Akabeko
Ball-in-a-maze puzzle
Bauernroulette
Bead maze
Bird of Happiness
Burr puzzle
Channapatna toys
Chatter Telephone
Chinese yo-yo
Cup-and-ball
Dalecarlian horse
Dreidel
Etikoppaka toys – traditional wooden toys with lacquer colours made in Etikoppaka, AP, India. Some of the toy styles include Lord Ganesha toys, cannon toys and bullock carts. They are prepared using poniki wood.
Froebel gifts
Gee-haw whammy diddle
Hobby horse
Hoop rolling
Jacob's ladder
Jig doll
Jigsaw puzzle
Jumping jack
Kapla
Kendama
KEVA Planks
Klotski
Kondapalli Toys
Lincoln Logs
Le Toy Van
Matador
Matryoshka doll
Mechanical puzzle – some are constructed from wood and wood products
Nirmal toys and craft
Peg wooden doll
Pinewood derby
Puppets
Pyramid puzzle
Rattleback
Reifendrehen
Rocking horse
Roly-poly toy
Snapper Puzzle
Soma cube
Tender Leaf Toys
Tinkertoy
Top
Toy block
Trompo
Unit block
Whittle Shortline
Wood car racing
Wooden toy train
Yo-yo – some yo-yos are made using wood
See also
List of toys
Wooden toymaking in the Ore Mountains
References
External links
Wooden toys
Lists of toys
|
Lieutenant Colonel Qazi Altaf Hussain (1920–1999) served in the British Indian Army later taking up a place in the Army of Pakistan. He advanced to various positions of leadership during his military career, serving as lieutenant colonel of the 11 Frontier Force Regiment, commandant of the Zhob Militia in Quetta, Pakistan, and commander of a regiment in the Indo-Pakistani War of 1965. He was forced to retire as a lieutenant colonel, instead of advancing to general, as a result of his short-tempered, frank and outspoken nature.
Early life
Hussain was born into a family whose lineage included a famous Qadi. He was born in Naushera, Soon Valley as the eldest son of Khan Sahib Qazi Zafar Hussain and the grandson of Qazi Mian Muhammad Amjad. He was the great-great-grandson of Qazi Kalim Ullah, another famous Muslim qadi, and jurist of Naushera in the time of the Mughal emperors. He belonged to the Awan tribe.
After graduating from Government High School in Naushera, Hussain studied at Government College in Faisalabad, Government College Lahore; and later Aligarh Muslim University, from which he graduated.
In 1943, Quaid-i-Azam Muhammed Ali Jinnah came to Faisalabad and held a political rally of the All-India Muslim League in the Dhobi Ghat Grounds, where over 2 million people were in attendance. Hussain's father, Khan Sahib Qazi Zafar Hussain, arranged a cavalry of Muslim students for the political rally.
Army career
Hussain was commissioned as a 2nd lieutenant in the British Indian Army in 1945 and soon joined the 11th Frontier Force Regiment. He served in World War II and under Sir Olaf Caroe, who administered the North-West Frontier Province in a time of political crisis.
In 1947, after the creation of Pakistan, he joined the Pakistani Army. He served as the 873rd ranking senior officer. During his service as an infantry officer in the Frontier Force Regiment, Hussain held various positions, including captain, major and was eventually promoted to lieutenant colonel. He also served in the Indo-Pakistani War of 1965.
Hussain was appointed commandant of Zhob Militia, one of South Asia's oldest military forces, established in 1890 in Quetta.
Later days
Hussain continued to pursue intellectual activities long after his retirement, remaining active well into his seventies. He was an admirer of Sir John Bagot Glubb, and considered him to be one of the finest historians of Islam in the English language. He also admired Sir Syed Ahmed Khan and Ghulam Ahmed Pervez, and (much to the horror of his religious family, tribe, and the people of his area) he followed and preached their religious views.
After his retirement, he continued to look after family land, and a stud farm at Hazel Pur, Renala Khurd. The farm had been established by his father. After Pakistani President General Muhammad Zia-ul-Haq declared a martial law government in 1977, government forces confiscated Hussain's stud farm. This was in retaliation for Hussain's advocacy against the injustice of the Military Government and the effects of Okara's large military farms on the area's small landowners and peasants.
Hussain died in 1999.
See also
Frontier Force Regiment
Pakistan Army
Lieutenant Colonel
Robert Groves Sandeman
Sir Olaf Caroe
Pakistan
Awan (Pakistan)
Aligarh Muslim University
Zhob
Lieutenant-General Sir John Bagot Glubb Pasha
Sir Syed Ahmed Khan
Ghulam Ahmed Pervez
All-India Muslim League
Muhammad Ali Jinnah
References
Frontier Force Regiment officers
British Indian Army officers
Government College University, Lahore alumni
Aligarh Muslim University alumni
Military personnel of the Indo-Pakistani War of 1965
Indian Army personnel of World War II
1920 births
1999 deaths
|
A statue of the Scottish politician Donald Dewar stands on Buchanan Street in Glasgow city centre. The statue was unveiled on 7 May 2002 by the Prime Minister of the United Kingdom, Tony Blair. It was sculpted by Kenny Mackay. The statue is 9 feet in height. Dewar is depicted wearing spectacles and his "characteristic stoop and crumpled suit".
The statue was unveiled on 7 May 2002 by the Prime Minister of the United Kingdom, Tony Blair in front of a crowd of several hundred people.
At the unveiling of the statue Blair said that Dewar's " ... compassion, his fundamental decency and his deep sense of social justice defined his entire approach as a politician" and described him as a "transforming moderate". The former leader of Scottish Labour, Wendy Alexander, said that the statue was " ... magnificent, the setting and the angle of it ...It's wonderful but it's not what he was when he was at his most exhausted".
The statue was taken down in October 2005 to be cleaned, and was re-erected on high plinth in December in an effort to protect it from vandalism.
References
2002 establishments in Scotland
2002 sculptures
Bronze sculptures in Scotland
Statues of politicians
Monuments and memorials in Glasgow
Outdoor sculptures in Scotland
Sculptures of men in the United Kingdom
|
```go
package rsaauth
import (
"github.com/aws/amazon-ssm-agent/agent/appconfig"
"github.com/aws/amazon-ssm-agent/agent/log"
"github.com/aws/amazon-ssm-agent/agent/ssm/authtokenrequest"
"github.com/aws/amazon-ssm-agent/agent/ssm/util"
"github.com/aws/aws-sdk-go/aws"
"github.com/aws/aws-sdk-go/aws/client"
"github.com/aws/aws-sdk-go/aws/credentials"
"github.com/aws/aws-sdk-go/aws/request"
"github.com/aws/aws-sdk-go/aws/session"
"github.com/aws/aws-sdk-go/service/ssm"
)
type IRsaClientDeps interface {
NewStaticCredentials(id string, secret string, token string) *credentials.Credentials
NewSession(config *aws.Config) (*session.Session, error)
AwsConfig(log log.T, appConfig appconfig.SsmagentConfig, service string, region string) *aws.Config
NewSsmSdk(p client.ConfigProvider, cfgs ...*aws.Config) *ssm.SSM
NewAuthTokenClient(sdk *ssm.SSM) authtokenrequest.IClient
MakeAddToUserAgentHandler(name string, version string, extra ...string) func(*request.Request)
NewCredentials(provider credentials.Provider) *credentials.Credentials
}
type rsaClientDeps struct{}
var deps IRsaClientDeps = &rsaClientDeps{}
func (r *rsaClientDeps) NewStaticCredentials(id string, secret string, token string) *credentials.Credentials {
return credentials.NewStaticCredentials(id, secret, token)
}
func (r *rsaClientDeps) NewSession(config *aws.Config) (*session.Session, error) {
return session.NewSession(config)
}
func (r *rsaClientDeps) AwsConfig(log log.T, appConfig appconfig.SsmagentConfig, service string, region string) *aws.Config {
return util.AwsConfig(log, appConfig, service, region)
}
func (r *rsaClientDeps) NewSsmSdk(p client.ConfigProvider, cfgs ...*aws.Config) *ssm.SSM {
return ssm.New(p, cfgs...)
}
func (r *rsaClientDeps) NewAuthTokenClient(sdk *ssm.SSM) authtokenrequest.IClient {
return authtokenrequest.NewClient(sdk)
}
func (r *rsaClientDeps) MakeAddToUserAgentHandler(name string, version string, extra ...string) func(*request.Request) {
return request.MakeAddToUserAgentHandler(name, version, extra...)
}
func (r *rsaClientDeps) NewCredentials(provider credentials.Provider) *credentials.Credentials {
return credentials.NewCredentials(provider)
}
```
|
Granlund is a surname. Notable people with the surname include:
Albin Granlund (born 1989), Finnish footballer
Barbara Granlund (born 1928), American politician
Kerstin Granlund (born 1951), Swedish comedian and actress
Marie Granlund (born 1962), Swedish politician
Markus Granlund (born 1993), Finnish ice hockey player
Mattias Granlund (born 1992), Swedish ice hockey player
Mikael Granlund (born 1992), Finnish ice hockey player
Nils Granlund (1890–1957), American show producer, entertainment industry entrepreneur and radio industry pioneer
Odd Granlund (1910–1982), Norwegian broadcaster
Paul Granlund (1925–2003), American sculptor
Petra Granlund (born 1987), Swedish swimmer
Sverre Granlund (1918–1943), Norwegian soldier
Trond Granlund (born 1950), Norwegian singer and musician
|
The RBY Mk 1 is a light armoured reconnaissance vehicle that was produced by the RAMTA Division of Israel Aircraft Industries. RBY is an anglicized acronym for "Rechev Ben-Yaacov". "Rechev" is Hebrew for "vehicle" and "Ben-Yaacov" is the last name of the creator of the vehicle, Yitzchak Ben-Yaacov (1919-2011).
In Israel, the vehicle is known as the "Rabi", a pronunciation of the acronym. It was replaced in Israeli service by the RAMTA RAM 2000 family of vehicles, though it continues to be used and upgraded by foreign users.
The RBY Mk 1 is no longer marketed to new customers. It was known to be sold at $60,000.
History
RAMTA created the RBY MK 1 in order to get them sold to countries that wanted to get vehicles that are on a tight budget from the 1970s. By 1979, RAMTA has switched production from the RBY MK 1 to the RAM vehicles.
Design
The RBY Mk 1 with a variety of potential applications in mind, including reconnaissance, commando operations, internal security, and long range patrols.
Considerable design effort was put into making the vehicle mine resistant - the wheels and axles were placed as far forward and backward as possible to maximize the distance of any detonation away from the crew and passengers, the bumpers were made of fiberglass so they would disintegrate in an explosion and minimize hazardous debris, the thickest armour was incorporated into the floor, and the floor and hull were shaped to channel explosions away from the vehicle. Other than modified Guatemalan versions, the RBY Mk 1 had no doors (crew entered through the open-topped passenger compartment) to ensure that the hull had no weak points.
The weight of the vehicle was kept light enough to make it transportable by heavy lift helicopters, such as the Sikorsky CH-53 Sea Stallion.
While the RBY Mk 1 featured no integral armament, provisions were made for up to five machine guns by placing pintle mounts at various points around the vehicle.
Passenger seating was provided with two back-to-back rows of three outward-facing seats. This allowed the passengers to maintain a full 360 degree field of view and operate any mounted machine guns.
Guatemalan upgrades
In the mid-to-late 1990s, the Guatemalan Army began testing an upgraded and modified RBY MK 1. The new RBY MK 1 featured a new, more powerful diesel engine, a kevlar roof for what had been the open cargo/passenger box, and access doors on either side of the vehicle for the now-enclosed rear compartment. The roof incorporated a ring mount for a machine gun.
Variants
Recoilless rifle version
A modified version of the RBY Mk 1 was produced which featured a 106mm recoilless rifle, 16 rounds of ammunition and crew positions in place of the normal passenger seating.
Anti-tank version
RBY Mk 1 with TOW missile launcher and two 7.62mm machine guns.
Anti-aircraft version
Armed with dual 20mm light anti-aircraft guns and 360 rounds of ammo.
APC version
Vehicle with three 7.62mm machine guns on turrets.
Mortar version
Vehicle with compartment for a mortar.
RAM MK3
Operators
Current
- armed with TCM-20 anti-aircraft gun
: 10
: 8 RBY Mk 1 Recce and 8 RBY Mk 1 AT. The Honduran Army used them on 29 April 1983 after Salvadoran rebels of the Farabundo Martí National Liberation Front crossed the border.
: 10
: 10 - armed with TCM-20 AA guns and locally repowered
Former
South Lebanon Army
See also
"Combat Reconnaissance/Patrol Vehicle" with rear engine:
Fennek
D-442 FÚG
ABC-79M
BRDM-2
Textron Tactical Armoured Patrol Vehicle
Others:
RG-31 Nyala - A more modern mine protected vehicle
MRAP - A family of vehicles designed to survive mine attacks and improvised explosive devices
References
Bibliography
Reconnaissance vehicles
Armoured cars of Israel
Armoured personnel carriers of Israel
Reconnaissance vehicles of the Cold War
Military vehicles introduced in the 1970s
|
```groovy
package com.dexvis.dex.task.input
import java.util.jar.JarFile
import javafx.collections.FXCollections
import javafx.collections.ObservableList
import javafx.event.ActionEvent
import javafx.geometry.Orientation
import javafx.scene.Node
import javafx.scene.control.Button
import javafx.scene.control.CheckBox
import javafx.scene.control.ListView
import javafx.scene.control.SplitPane
import javafx.scene.input.KeyCode
import javafx.stage.FileChooser
import org.apache.bcel.classfile.ConstantClass
import org.apache.bcel.classfile.ConstantUtf8
import org.apache.bcel.classfile.JavaClass
import org.apache.bcel.util.ClassPath
import org.apache.bcel.util.SyntheticRepository
import org.simpleframework.xml.Element
import org.simpleframework.xml.ElementList
import org.simpleframework.xml.Root
import org.tbee.javafx.scene.layout.MigPane
import com.dexvis.dex.exception.DexException
import com.dexvis.dex.wf.DexTask
import com.dexvis.dex.wf.DexTaskState
import com.dexvis.javafx.scene.control.ModalDialog
import com.dexvis.javafx.scene.control.NodeFactory
@Root
class JarInspector extends DexTask {
@Element(name="selfref", required=false)
private CheckBox selfRefCB
@Element(name="undefined", required=false)
private CheckBox undefinedCB
@ElementList(name = "jarData", inline = true, required = false)
private ObservableList<String> jarData = FXCollections
.observableArrayList()
private MigPane configPane = null
private ListView<String> jarListView = new ListView<String>(jarData)
public JarInspector() {
super("Input", "Jar Inspector", "input/JarInspector.html")
getMetaData().setTaskExecutionUpdatesUI(false)
}
public DexTaskState execute(DexTaskState state) throws DexException {
println "Running: $name"
try {
// Create the header
state.dexData.header = ["JAR", "DEFINING_JAR", "DEPENDENCY"]
state.dexData.data = []
// Create the classpath and repository.
ClassPath cp = new ClassPath(jarData.join(System.getProperty("path.separator")))
SyntheticRepository repo = SyntheticRepository.getInstance(cp)
// A map containing: class -> [ jar1, jar2, ...] of jars which contain this class.
def classMap = [:]
// A map containing: dependency -> jarMap where jarMap contains entries like: [ jarClass : jarClass ]
def depMap = [:]
jarData.each
{ jarPath ->
updateMessage("Reading jar: '${jarPath}'");
def jarMatch = ( jarPath =~ /([^\\\/]+)\.jar/)
def jarClass = jarMatch[0][0]
// Open the current jar file.
JarFile jarFile = new JarFile(new File(jarPath))
// Process each jar in the classpath
jarFile?.entries().each
{ classFile ->
// Translate com/some/classfile/class into com.some.classfile.class
def clazz = (classFile =~ /\//).replaceAll(".")
// Process class files only
if (clazz.endsWith(".class"))
{
// Remove .class suffix.
clazz = (clazz =~ /\.class$/).replaceFirst("")
try
{
// Attempt loading the class file through the synthetic repository
JavaClass javaClass = repo.loadClass(clazz)
// Append this class to the list of jars containing this class.
if (classMap.containsKey(clazz))
{
classMap.put(clazz, classMap.get(clazz) << jarClass)
}
// Else store this jar as containing this class.
else
{
classMap.put(clazz, [jarClass])
}
// Read the constants pool for this class:
javaClass?.getConstantPool()?.getConstantPool().each
{ c ->
// Process constant classes only.
if (c instanceof ConstantClass)
{
ConstantClass cc = (ConstantClass) c
// Get the name index.
ConstantUtf8 nameIndex = (ConstantUtf8) javaClass.getConstantPool().getConstant(cc.getNameIndex())
// Capture the name and translate from "/" delimited to "." delimited.
def m = (nameIndex.toString() =~ /\"(.*)\"/)
String dep = (m[0][1] =~ /\//).replaceAll(".")
// If this dependency has already been defined, get the map and store this entry into it.
if (depMap.containsKey(dep))
{
def jarMap = depMap.get(dep)
if (!jarMap.containsKey(jarClass))
{
jarMap.put(jarClass, jarClass)
}
}
else
{
def jarMap = [jarClass : jarClass ]
depMap.put(dep, jarMap)
}
}
}
}
catch (Exception ex)
{
//ex.printStackTrace()
}
}
}
}
// Iterate over dependencies
depMap.each
{ // key = class, value = A map of jars
depItem ->
depItem.value?.each
{ // key = jar, value = jar
jarItem ->
def depJar = jarItem.value.toString()
//println "${depJar} calls ${depItem.key}"
if (classMap.containsKey(depItem.key))
{
//println "DEFINED IN: ${classMap.get(depItem.key)}"
classMap.get(depItem.key).each
{ classDef ->
//println "IS $depJar DEFINED IN: $classDef"
if (selfRefCB.isSelected() || depJar != classDef)
{
state.dexData.data << [depJar, classDef, depItem.key.toString()]
}
}
}
else
{
if (undefinedCB.isSelected())
{
state.dexData.data << [depJar, "UNDEFINED", depItem.key.toString()]
}}
}
}
}
catch(Exception ex)
{
StringWriter sw = new StringWriter()
ex.printStackTrace(new PrintWriter(sw))
ModalDialog dialog = new ModalDialog(stage, "Error", sw.toString(), "Ok")
ex.printStackTrace()
}
return state
}
public Node getConfig()
{
if (configPane == null)
{
jarListView = new ListView<String>(jarData)
jarListView.setItems(jarData)
configPane = new MigPane("", "[grow]", "[grow]")
configPane.setStyle("-fx-background-color: white;")
MigPane jarConfigPane = new MigPane("", "[][grow]", "[][][][][]")
Button browseButton = new Button("Browse")
selfRefCB = new CheckBox("Include Self References:")
selfRefCB.setSelected(false)
undefinedCB = new CheckBox("Include Undefined:")
undefinedCB.setSelected(false)
jarConfigPane.add(NodeFactory.createTitle("JAR Inspector Configuration"), "grow,span")
jarConfigPane.add(selfRefCB, "span")
jarConfigPane.add(undefinedCB, "span")
jarConfigPane.add(browseButton, "span")
SplitPane hSplitPane = new SplitPane()
hSplitPane.setOrientation(Orientation.HORIZONTAL)
hSplitPane.getItems().addAll(jarConfigPane, jarListView)
hSplitPane.setDividerPositions(0.20)
configPane.add(hSplitPane, "span, grow")
browseButton.setOnAction({ action -> open(action)})
jarListView.setOnKeyPressed({ evt ->
if (evt.getCode().equals(KeyCode.DELETE)) {
//System.out.println("DELETING...")
int removeIndex = jarListView.getSelectionModel().getSelectedIndex();
if (removeIndex >= 0)
{
jarData.remove(removeIndex)
}
}
else {
System.out.println("Ignoring keypress")
}
})
}
return configPane
}
public void open(ActionEvent evt)
{
try
{
FileChooser fc = new FileChooser()
fc.setTitle("Load Jars")
String userDir = System.getProperty("user.dir")
File startDir = new File(new File("lib").getCanonicalPath())
fc.setInitialDirectory(startDir)
List<File> loadFiles = fc.showOpenMultipleDialog(null)
for (File file : loadFiles)
{
String filePath = file.getAbsolutePath()
if (userDir != null && userDir.length() > 0 && filePath.startsWith(userDir)) {
// Including the file separator.
filePath = filePath.substring(userDir.length() + File.separator.length());
}
jarData.add(filePath)
}
}
catch(Exception ex)
{
ex.printStackTrace()
}
}
}
```
|
```kotlin
package de.westnordost.streetcomplete.util
import android.content.res.Configuration
import android.content.res.Resources
import android.os.Build
import android.os.LocaleList
import androidx.core.os.ConfigurationCompat
import androidx.core.os.LocaleListCompat
import de.westnordost.streetcomplete.data.preferences.Preferences
import de.westnordost.streetcomplete.util.ktx.addedToFront
import java.util.Locale
/** Get the override-locale selected in this app or null if there is no override */
fun getSelectedLocale(prefs: Preferences): Locale? {
val languageTag = prefs.language ?: ""
return if (languageTag.isEmpty()) null else Locale.forLanguageTag(languageTag)
}
/** Get the locale selected in this app (if any) appended by the system locales */
fun getSelectedLocales(prefs: Preferences): LocaleListCompat {
val locale = getSelectedLocale(prefs)
val systemLocales = getSystemLocales()
return if (locale == null) systemLocales else systemLocales.addedToFront(locale)
}
/** Set locales of this configuration */
fun Configuration.setLocales(locales: LocaleListCompat) {
if (Build.VERSION.SDK_INT >= Build.VERSION_CODES.N) {
setLocales(locales.unwrap() as LocaleList)
} else {
setLocale(if (locales.isEmpty) null else locales[0])
}
}
/** Set default Java locale(s). locales must not be empty */
fun setDefaultLocales(locales: LocaleListCompat) {
if (Build.VERSION.SDK_INT >= Build.VERSION_CODES.N) {
LocaleList.setDefault(locales.unwrap() as LocaleList)
} else {
Locale.setDefault(locales[0])
}
}
/** Get Android system locale(s) */
fun getSystemLocales(): LocaleListCompat =
ConfigurationCompat.getLocales(Resources.getSystem().configuration)
```
|
```c
/* $OpenBSD: splay-test.c,v 1.4 2008/04/13 00:22:17 djm Exp $ */
/*
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. 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.
*/
#include <sys/types.h>
#include <sys/tree.h>
#include <unistd.h>
#include <stdio.h>
#include <err.h>
#include <stdlib.h>
struct node {
SPLAY_ENTRY(node) node;
int key;
};
SPLAY_HEAD(tree, node) root;
static int
compare(struct node *a, struct node *b)
{
if (a->key < b->key) return (-1);
else if (a->key > b->key) return (1);
return (0);
}
SPLAY_PROTOTYPE(tree, node, node, compare);
SPLAY_GENERATE(tree, node, node, compare);
#define ITER 150
#define MIN 5
#define MAX 5000
int
main(int argc, char **argv)
{
struct node *tmp, *ins;
int i, max, min;
SPLAY_INIT(&root);
for (i = 0; i < ITER; i++) {
tmp = malloc(sizeof(struct node));
if (tmp == NULL) err(1, "malloc");
do {
tmp->key = arc4random_uniform(MAX-MIN);
tmp->key += MIN;
} while (SPLAY_FIND(tree, &root, tmp) != NULL);
if (i == 0)
max = min = tmp->key;
else {
if (tmp->key > max)
max = tmp->key;
if (tmp->key < min)
min = tmp->key;
}
if (SPLAY_INSERT(tree, &root, tmp) != NULL)
errx(1, "SPLAY_INSERT failed");
}
ins = SPLAY_MIN(tree, &root);
if (ins->key != min)
errx(1, "min does not match");
tmp = ins;
ins = SPLAY_MAX(tree, &root);
if (ins->key != max)
errx(1, "max does not match");
if (SPLAY_REMOVE(tree, &root, tmp) != tmp)
errx(1, "SPLAY_REMOVE failed");
for (i = 0; i < ITER - 1; i++) {
tmp = SPLAY_ROOT(&root);
if (tmp == NULL)
errx(1, "SPLAY_ROOT error");
if (SPLAY_REMOVE(tree, &root, tmp) != tmp)
errx(1, "SPLAY_REMOVE error");
free(tmp);
}
exit(0);
}
```
|
```glsl
module TypeChecker
open Ast
open Getters
open AstUtils
open Printer
open System.Collections.Generic
let GetClass name decls =
match decls |> List.tryFind (function Interface(n,_,_) when n = name -> true | _ -> false) with
| Some(cl) -> cl
| None -> Interface(name,[],[])
let GetModel name decls =
match decls |> List.tryFind (function DataModel(n,_,_,_,_) when n = name -> true | _ -> false) with
| Some(m) -> m
| None -> DataModel(name,[],[],[],BoolLiteral(true))
let GetCode name decls =
match decls |> List.tryFind (function Code(n,_) when n = name -> true | _ -> false) with
| Some(c) -> c
| None -> Code(name,[])
let IsUserType prog tpo =
match tpo with
| Some(tp) ->
let tpname = match tp with
| NamedType(tname,_) -> tname
| InstantiatedType(tname, _) -> tname
| _ -> ""
match prog with
| Program(components) -> components |> List.filter (function Component(Interface(name,_,_),_,_) when name = tpname -> true
| _ -> false) |> List.isEmpty |> not
| None -> false
let TypeCheck prog =
match prog with
| SProgram(decls) ->
let componentNames = decls |> List.choose (function Interface(name,_,_) -> Some(name) | _ -> None)
let clist = componentNames |> List.map (fun name -> Component(GetClass name decls, GetModel name decls, GetCode name decls))
Some(Program(clist))
let MethodArgChecker prog meth varName =
let ins = GetMethodInArgs meth
let outs = GetMethodOutArgs meth
ins @ outs |> List.choose (fun var -> if GetVarName var = varName then GetVarType var |> FindComponentForTypeOpt prog else None) |> Utils.ListToOption
// TODO: implement this
let rec InferType prog thisComp checkLocalFunc expr =
let __FindVar comp fldName =
let var = FindVar comp fldName |> Utils.ExtractOption
let c = FindComponentForType prog (Utils.ExtractOption (GetVarType var)) |> Utils.ExtractOption
Some(c)
try
match expr with
| ObjLiteral("this") -> Some(thisComp)
| ObjLiteral("null") -> None
| IdLiteral(id) -> __FindVar thisComp id
| VarLiteral(id) -> checkLocalFunc id
| Dot(discr, fldName) ->
match InferType prog thisComp checkLocalFunc discr with
| Some(comp) -> __FindVar comp fldName
| None -> None
| _ -> None
with
| ex -> None
```
|
Monroe County Airport is a county-owned public-use airport located three nautical miles (6 km) south of the central business district of Monroeville, in Monroe County, Alabama, United States. According to the FAA's National Plan of Integrated Airport Systems for 2009–2013, it is categorized as a general aviation facility.
Facilities and aircraft
Monroe County Airport covers an area of at an elevation of 419 feet (128 m) above mean sea level. It has one runway designated 3/21 with an asphalt surface measuring 6,028 by 100 feet (1,837 x 30 m).
For the 12-month period ending July 14, 2009, the airport had 20,100 aircraft operations, an average of 55 per day: 95% general aviation and 5% military. At that time there were 16 aircraft based at this airport: 75% single-engine, 13% multi-engine, 6% jet and 6% helicopter.
References
External links
Aerial image as of 4 March 1997 from USGS The National Map
Airfield photos for MVC from Civil Air Patrol
Airports in Alabama
County airports in the United States
Transportation in Monroe County, Alabama
Buildings and structures in Monroe County, Alabama
|
```javascript
console.log('B')
```
|
Peter Faulhammer (died May 2019) also known as Martillo Vago, is a former member of Sash!. Martillo Vago is a transliteration of Faulhammer's last name.
Martillo Vago's hits include "Por què no" and "Que es la vida". Under the name Peter Faulhammer, he is featured alongside Rodriguez in Sash!'s international hit "Adelante" where he is credited with his name Peter Faulhammer.
He inspired another group called Ovni Vago with expected release "Por qué no podéis", which is a metaphor of the desire of the fans.
Discography
Singles
Featured in
References
External links
Official Website
German electronic musicians
German male singers
Year of birth missing (living people)
Living people
|
Bayev is a surname. Notable people with the surname include:
Nikolai Bayev (1875–1952), Armenian architect
Denis Bayev (born 1983), Ukrainian hockey player
Khassan Baiev (born 1963), Chechen doctor and author
Pavel Baev (born 1957), Russian-Norwegian researcher
|
Ruhpolding is the municipality with the biggest area of the Traunstein district in southeastern Bavaria, Germany. It is situated in the south of the Chiemgau region in the Alps and next to the Austrian border.
Ruhpolding has a biathlon track. It hosted the 1979, 1985, 1996 and 2012 Biathlon World Championships. It also has a ski jumping hill, Große Zirmbergschanze, where one World Cup event has taken place, in the 1992–93 season.
The economy is based on tourism and sports. In the year 2007 the Mountainbike 24h Race World Championships took place in the Chiemgau Arena. Other sports which are possible for tourists and residents are golf, mountainbiking, shooting, hiking, fly fishing and skiing.
History
The name "Ruhpolding" originates from the Bavarian word Rupoltingin and means "the people of the strong famous one". The town is mentioned as Ruhpoldingen for the first time in 1193.
It was connected to the railway in 1895. Since 1948, Ruhpolding has been a famous spa and tourist resort, especially for winter sports. The accommodation figures were 600,000 overnight stays per year in the mid-1950s, which increased to 1,122,732 overnight stays per year in 1991.
People
Ferdinand Max Bredt German Orientalist painter.
Andreas Wellinger, Olympic champion in ski jumping
Georg von Hertling, the German Chancellor from 1917 to 1918, died here
Vanessa Hinz, German biathlete
Wolfgang Pichler, Biathlon Coach
Ilse Braun sister of Eva and Gretl Braun.
Mayors
?–1893: Anton Pointner
1893–1906: Mathias Huber (BBB)
1906–1919: Georg Eisenberger (BBB)
1919–1933: Bartholomäus Schmucker
1933 until the end of war: Anton Kreidl, Josef Wallner, Karl Huber
1945 and 1946: Alois Rappl, Valentin Plenk, Fritz Grübl
1946–1966: Josef Mayer (CSU)
1966–1970: Leonhard Schmucker (CSU)
1970–1972: Anton Stengel (UW)
1972–1978: Franz Schneider (SPD)
1978–1996: Herbert Ohl (CSU)
1996–2002: Gerhard Hallweger (SPD)
2002–2008: Andreas Hallweger (CSU)
2008–2020: Claus Pichler (SPD)
since 2020: Justus Pfeifer (CSU)
References
External links
Village of Ruhpolding
Traunstein (district)
Ski areas and resorts in Germany
|
```python
from botbuilder.core import (
ActivityHandler,
ConversationState,
TurnContext,
UserState,
MessageFactory,
)
from botbuilder.schema import ChannelAccount
from data_models import CustomState
class EchoBot(ActivityHandler):
def __init__(self, conversation_state: ConversationState, user_state: UserState):
if conversation_state is None:
raise TypeError(
"[EchoBot]: Missing parameter. conversation_state is required but None was given"
)
if user_state is None:
raise TypeError(
"[EchoBot]: Missing parameter. user_state is required but None was given"
)
self.conversation_state = conversation_state
self.user_state = user_state
self.conversation_state_accessor = self.conversation_state.create_property(
"CustomState"
)
self.user_state_accessor = self.user_state.create_property("CustomState")
async def on_turn(self, turn_context: TurnContext):
await super().on_turn(turn_context)
await self.conversation_state.save_changes(turn_context)
await self.user_state.save_changes(turn_context)
async def on_members_added_activity(
self, members_added: [ChannelAccount], turn_context: TurnContext
):
for member in members_added:
if member.id != turn_context.activity.recipient.id:
await turn_context.send_activity("Hello and welcome!")
async def on_message_activity(self, turn_context: TurnContext):
# Get the state properties from the turn context.
user_data = await self.user_state_accessor.get(turn_context, CustomState)
conversation_data = await self.conversation_state_accessor.get(
turn_context, CustomState
)
await turn_context.send_activity(
MessageFactory.text(
f"Echo: {turn_context.activity.text}, "
f"conversation state: {conversation_data.value}, "
f"user state: {user_data.value}"
)
)
user_data.value = user_data.value + 1
conversation_data.value = conversation_data.value + 1
```
|
```objective-c
//
// This program is free software; you can redistribute it and/or modify
// published by the Free Software Foundation.
#pragma once
#include "app/app_brushes.h"
#include "base/signal.h"
#include "doc/pixel_format.h"
#include <memory>
#include <string>
#include <vector>
namespace doc {
class Layer;
}
namespace ui {
class UISystem;
}
namespace app {
class AppOptions;
class ContextBar;
class Document;
class DocumentExporter;
class INotificationDelegate;
class InputChain;
class LegacyModules;
class LoggerModule;
class MainWindow;
class Preferences;
class RecentFiles;
class Timeline;
class Workspace;
namespace tools {
class ActiveToolManager;
class Tool;
class ToolBox;
}
using namespace doc;
class App {
public:
App();
~App();
static App* instance() { return m_instance; }
// Returns true if Aseprite is running with GUI available.
bool isGui() const { return m_isGui; }
// Returns true if the application is running in portable mode.
bool isPortable();
// Runs the Aseprite application. In GUI mode it's the top-level
// window, in console/scripting it just runs the specified
// scripts.
void initialize(const AppOptions& options);
void run();
tools::ToolBox* toolBox() const;
tools::Tool* activeTool() const;
tools::ActiveToolManager* activeToolManager() const;
RecentFiles* recentFiles() const;
MainWindow* mainWindow() const { return m_mainWindow.get(); }
Workspace* workspace() const;
ContextBar* contextBar() const;
Timeline* timeline() const;
Preferences& preferences() const;
AppBrushes& brushes() {
ASSERT(m_brushes.get());
return *m_brushes;
}
void showNotification(INotificationDelegate* del);
void updateDisplayTitleBar();
InputChain& inputChain();
// App Signals
base::Signal0<void> Exit;
base::Signal0<void> PaletteChange;
private:
typedef std::vector<std::string> FileList;
class CoreModules;
class Modules;
static App* m_instance;
std::unique_ptr<ui::UISystem> m_uiSystem;
std::unique_ptr<CoreModules> m_coreModules;
std::unique_ptr<Modules> m_modules;
std::unique_ptr<LegacyModules> m_legacy;
bool m_isGui;
bool m_isShell;
std::unique_ptr<MainWindow> m_mainWindow;
FileList m_files;
std::unique_ptr<DocumentExporter> m_exporter;
std::unique_ptr<AppBrushes> m_brushes;
};
void app_refresh_screen();
void app_rebuild_documents_tabs();
PixelFormat app_get_current_pixel_format();
void app_default_statusbar_message();
int app_get_color_to_clear_layer(doc::Layer* layer);
} // namespace app
```
|
```xml
import * as path from 'path';
import { fusebox, pluginLess, pluginSass, sparky } from '../../src';
class Context {
isProduction;
runServer;
getConfig() {
return fusebox({
entry: 'src/index.tsx',
target: 'browser',
webIndex: {
embedIndexedBundles: true,
template: 'src/index.html',
},
stylesheet: {
autoImport: [{ file: 'src/resources/resources.scss' }],
paths: [path.join(__dirname, 'src/config')],
},
cache: true,
plugins: [pluginSass('mod.scss', { asModule: {} })],
hmr: true,
watcher: true,
devServer: true,
});
}
}
const { exec, rm, task } = sparky<Context>(Context);
task('default', async ctx => {
rm('./dist');
ctx.runServer = true;
const fuse = ctx.getConfig();
await fuse.runDev({ uglify: true, bundles: { app: 'app.js' } });
});
task('preview', async ctx => {
ctx.runServer = true;
ctx.isProduction = true;
const fuse = ctx.getConfig();
await fuse.runProd({ uglify: false, bundles: { app: 'app.js' } });
});
task('dist', async ctx => {
ctx.runServer = false;
ctx.isProduction = true;
const fuse = ctx.getConfig();
await fuse.runProd({ uglify: false });
});
```
|
"That's What Cowboys Do" is a song by American country music singer Garth Brooks. It was released on June 29, 2021, as the fifth single from Brooks' fourteenth studio album Fun. Brooks co-wrote the song with John Martin and Mitch Rossell.
Background
In an interview, Brooks said: "It was written for the boys from Midland. 'Cause I thought they would kill it. We sat down and wrote something for them, because they do a lot of George Strait-feeling stuff."
Content
The song was described by CMT as a story about "timeless tale of love, heartbreak and the rodeo" and a rodeo cowboy who "falls for, then leaves, their love interest". Chris Parton of Sounds like Nashville felt that the "pure-country ballad" song features "a gentle sway and a timeless theme. Brooks plays a cowboy who can't be tamed, drifting from one rodeo arena and one bed to the next."
Critical reception
Katie Maloney of Outsider commented that the song has "90s country vibes". Robyn Collins of Taste of Country described it as "a traditional country tune that features slide guitars and fiddles so classic that listeners can almost see boot-wearing couples making their way around the dance floor.
In November 2022, the song was honored as one of the Most Performed Country Songs of 2021 at the 60th Annual ASCAP Country Music Awards.
Charts
Weekly charts
Year-end charts
References
2021 singles
2021 songs
Garth Brooks songs
Songs written by Garth Brooks
|
```css
CSS Specificity
Determine the opacity of background-colors using the RGBA declaration
Difference between `initial` and `inherit`
Use pseudo-elements to style specific parts of an element
Select items using negative `nth-child`
```
|
Litewki is a settlement in the administrative district of Gmina Dzierzgoń, within Sztum County, Pomeranian Voivodeship, in northern Poland.
Before 1772 the area was part of Kingdom of Poland, and in 1772–1945 it belonged to Prussia and Germany. For the history of the region, see History of Pomerania.
References
Litewki
|
Perry Bay () is an open ice-filled bay about 12 nautical miles (22 km) wide, indenting the coast between Freeman Point and a stubby peninsula terminating in Cape Keltie. Delineated from air photos taken by U.S. Navy Operation Highjump (1946–47). Named by Advisory Committee on Antarctic Names (US-ACAN) for Lieutenant O.H. Perry on the sloop Peacock of the United States Exploring Expedition (1838–42) under Wilkes.
References
Bays of Wilkes Land
|
```objective-c
/* This header is deprecated as of NumPy 1.7 */
#ifndef OLD_DEFINES_H
#define OLD_DEFINES_H
#if defined(NPY_NO_DEPRECATED_API) && NPY_NO_DEPRECATED_API >= NPY_1_7_API_VERSION
#error The header "old_defines.h" is deprecated as of NumPy 1.7.
#endif
#define NDARRAY_VERSION NPY_VERSION
#define PyArray_MIN_BUFSIZE NPY_MIN_BUFSIZE
#define PyArray_MAX_BUFSIZE NPY_MAX_BUFSIZE
#define PyArray_BUFSIZE NPY_BUFSIZE
#define PyArray_PRIORITY NPY_PRIORITY
#define PyArray_SUBTYPE_PRIORITY NPY_PRIORITY
#define PyArray_NUM_FLOATTYPE NPY_NUM_FLOATTYPE
#define NPY_MAX PyArray_MAX
#define NPY_MIN PyArray_MIN
#define PyArray_TYPES NPY_TYPES
#define PyArray_BOOL NPY_BOOL
#define PyArray_BYTE NPY_BYTE
#define PyArray_UBYTE NPY_UBYTE
#define PyArray_SHORT NPY_SHORT
#define PyArray_USHORT NPY_USHORT
#define PyArray_INT NPY_INT
#define PyArray_UINT NPY_UINT
#define PyArray_LONG NPY_LONG
#define PyArray_ULONG NPY_ULONG
#define PyArray_LONGLONG NPY_LONGLONG
#define PyArray_ULONGLONG NPY_ULONGLONG
#define PyArray_HALF NPY_HALF
#define PyArray_FLOAT NPY_FLOAT
#define PyArray_DOUBLE NPY_DOUBLE
#define PyArray_LONGDOUBLE NPY_LONGDOUBLE
#define PyArray_CFLOAT NPY_CFLOAT
#define PyArray_CDOUBLE NPY_CDOUBLE
#define PyArray_CLONGDOUBLE NPY_CLONGDOUBLE
#define PyArray_OBJECT NPY_OBJECT
#define PyArray_STRING NPY_STRING
#define PyArray_UNICODE NPY_UNICODE
#define PyArray_VOID NPY_VOID
#define PyArray_DATETIME NPY_DATETIME
#define PyArray_TIMEDELTA NPY_TIMEDELTA
#define PyArray_NTYPES NPY_NTYPES
#define PyArray_NOTYPE NPY_NOTYPE
#define PyArray_CHAR NPY_CHAR
#define PyArray_USERDEF NPY_USERDEF
#define PyArray_NUMUSERTYPES NPY_NUMUSERTYPES
#define PyArray_INTP NPY_INTP
#define PyArray_UINTP NPY_UINTP
#define PyArray_INT8 NPY_INT8
#define PyArray_UINT8 NPY_UINT8
#define PyArray_INT16 NPY_INT16
#define PyArray_UINT16 NPY_UINT16
#define PyArray_INT32 NPY_INT32
#define PyArray_UINT32 NPY_UINT32
#ifdef NPY_INT64
#define PyArray_INT64 NPY_INT64
#define PyArray_UINT64 NPY_UINT64
#endif
#ifdef NPY_INT128
#define PyArray_INT128 NPY_INT128
#define PyArray_UINT128 NPY_UINT128
#endif
#ifdef NPY_FLOAT16
#define PyArray_FLOAT16 NPY_FLOAT16
#define PyArray_COMPLEX32 NPY_COMPLEX32
#endif
#ifdef NPY_FLOAT80
#define PyArray_FLOAT80 NPY_FLOAT80
#define PyArray_COMPLEX160 NPY_COMPLEX160
#endif
#ifdef NPY_FLOAT96
#define PyArray_FLOAT96 NPY_FLOAT96
#define PyArray_COMPLEX192 NPY_COMPLEX192
#endif
#ifdef NPY_FLOAT128
#define PyArray_FLOAT128 NPY_FLOAT128
#define PyArray_COMPLEX256 NPY_COMPLEX256
#endif
#define PyArray_FLOAT32 NPY_FLOAT32
#define PyArray_COMPLEX64 NPY_COMPLEX64
#define PyArray_FLOAT64 NPY_FLOAT64
#define PyArray_COMPLEX128 NPY_COMPLEX128
#define PyArray_TYPECHAR NPY_TYPECHAR
#define PyArray_BOOLLTR NPY_BOOLLTR
#define PyArray_BYTELTR NPY_BYTELTR
#define PyArray_UBYTELTR NPY_UBYTELTR
#define PyArray_SHORTLTR NPY_SHORTLTR
#define PyArray_USHORTLTR NPY_USHORTLTR
#define PyArray_INTLTR NPY_INTLTR
#define PyArray_UINTLTR NPY_UINTLTR
#define PyArray_LONGLTR NPY_LONGLTR
#define PyArray_ULONGLTR NPY_ULONGLTR
#define PyArray_LONGLONGLTR NPY_LONGLONGLTR
#define PyArray_ULONGLONGLTR NPY_ULONGLONGLTR
#define PyArray_HALFLTR NPY_HALFLTR
#define PyArray_FLOATLTR NPY_FLOATLTR
#define PyArray_DOUBLELTR NPY_DOUBLELTR
#define PyArray_LONGDOUBLELTR NPY_LONGDOUBLELTR
#define PyArray_CFLOATLTR NPY_CFLOATLTR
#define PyArray_CDOUBLELTR NPY_CDOUBLELTR
#define PyArray_CLONGDOUBLELTR NPY_CLONGDOUBLELTR
#define PyArray_OBJECTLTR NPY_OBJECTLTR
#define PyArray_STRINGLTR NPY_STRINGLTR
#define PyArray_STRINGLTR2 NPY_STRINGLTR2
#define PyArray_UNICODELTR NPY_UNICODELTR
#define PyArray_VOIDLTR NPY_VOIDLTR
#define PyArray_DATETIMELTR NPY_DATETIMELTR
#define PyArray_TIMEDELTALTR NPY_TIMEDELTALTR
#define PyArray_CHARLTR NPY_CHARLTR
#define PyArray_INTPLTR NPY_INTPLTR
#define PyArray_UINTPLTR NPY_UINTPLTR
#define PyArray_GENBOOLLTR NPY_GENBOOLLTR
#define PyArray_SIGNEDLTR NPY_SIGNEDLTR
#define PyArray_UNSIGNEDLTR NPY_UNSIGNEDLTR
#define PyArray_FLOATINGLTR NPY_FLOATINGLTR
#define PyArray_COMPLEXLTR NPY_COMPLEXLTR
#define PyArray_QUICKSORT NPY_QUICKSORT
#define PyArray_HEAPSORT NPY_HEAPSORT
#define PyArray_MERGESORT NPY_MERGESORT
#define PyArray_SORTKIND NPY_SORTKIND
#define PyArray_NSORTS NPY_NSORTS
#define PyArray_NOSCALAR NPY_NOSCALAR
#define PyArray_BOOL_SCALAR NPY_BOOL_SCALAR
#define PyArray_INTPOS_SCALAR NPY_INTPOS_SCALAR
#define PyArray_INTNEG_SCALAR NPY_INTNEG_SCALAR
#define PyArray_FLOAT_SCALAR NPY_FLOAT_SCALAR
#define PyArray_COMPLEX_SCALAR NPY_COMPLEX_SCALAR
#define PyArray_OBJECT_SCALAR NPY_OBJECT_SCALAR
#define PyArray_SCALARKIND NPY_SCALARKIND
#define PyArray_NSCALARKINDS NPY_NSCALARKINDS
#define PyArray_ANYORDER NPY_ANYORDER
#define PyArray_CORDER NPY_CORDER
#define PyArray_FORTRANORDER NPY_FORTRANORDER
#define PyArray_ORDER NPY_ORDER
#define PyDescr_ISBOOL PyDataType_ISBOOL
#define PyDescr_ISUNSIGNED PyDataType_ISUNSIGNED
#define PyDescr_ISSIGNED PyDataType_ISSIGNED
#define PyDescr_ISINTEGER PyDataType_ISINTEGER
#define PyDescr_ISFLOAT PyDataType_ISFLOAT
#define PyDescr_ISNUMBER PyDataType_ISNUMBER
#define PyDescr_ISSTRING PyDataType_ISSTRING
#define PyDescr_ISCOMPLEX PyDataType_ISCOMPLEX
#define PyDescr_ISPYTHON PyDataType_ISPYTHON
#define PyDescr_ISFLEXIBLE PyDataType_ISFLEXIBLE
#define PyDescr_ISUSERDEF PyDataType_ISUSERDEF
#define PyDescr_ISEXTENDED PyDataType_ISEXTENDED
#define PyDescr_ISOBJECT PyDataType_ISOBJECT
#define PyDescr_HASFIELDS PyDataType_HASFIELDS
#define PyArray_LITTLE NPY_LITTLE
#define PyArray_BIG NPY_BIG
#define PyArray_NATIVE NPY_NATIVE
#define PyArray_SWAP NPY_SWAP
#define PyArray_IGNORE NPY_IGNORE
#define PyArray_NATBYTE NPY_NATBYTE
#define PyArray_OPPBYTE NPY_OPPBYTE
#define PyArray_MAX_ELSIZE NPY_MAX_ELSIZE
#define PyArray_USE_PYMEM NPY_USE_PYMEM
#define PyArray_RemoveLargest PyArray_RemoveSmallest
#define PyArray_UCS4 npy_ucs4
#endif
```
|
Łęg Rokietnicki is a river of Poland, a left tributary of the San near Jarosław.
Rivers of Poland
Rivers of Podkarpackie Voivodeship
|
```css
`currentColor` improves code reusability
`calc()` for simpler maths
Determine the opacity of background-colors using the RGBA declaration
Disable resizable property of `textarea`
Multiple borders with pseudo elements
```
|
The Mangalica (also Mangalitsa or Mangalitza) is a Hungarian breed of domestic pig. It was developed in the mid-19th century by crossbreeding breeds from the nearby Romanian Salonta (Hungarian: Nagyszalonta, colloquially Szalonta) and Hungarian Bakony with the European wild boar and the Serbian Šumadija breed. The Mangalica pig grows a thick, curly coat of hair. The only other pig breed noted for having a long coat is the extinct Lincolnshire Curly Coat pig of England.
History
The blonde Mangalica variety was developed from older, hardy types of Hungarian pig (Bakonyi and Szalontai) crossed with the European wild boar and a Serbian breed (and later others like Alföldi) in Austria-Hungary (1833). That year, Prince of Serbia Miloš Obrenović sent 12 pigs of the autochthonous Serbian Šumadinka breed, ten sows and two boars. Pigs originally grown at the prince's Topčider farm near Belgrade were used to create the Syrmian black lasa breed, also known as the black mangalica. The prince sent the animals to the Archduke Joseph, Palatine of Hungary, on whose estate the new breed was to be created.
The new, quick-growing, "fat-type" hog did not require any special care, which caused it to become very popular in Hungary. In 1927, the National Society of Fat-Type Hog Breeders (Mangalicatenyésztők Országos Egyesülete) was established, with the objective of improving the breed. Mangalica was the most prominent swine breed in the region until 1950 (30,000 of them were in Hungary in 1943). Since then, the popularity as well as the population of Mangalica has been decreasing, with the rising availability of food from farther away and refrigeration. In 1991, there were fewer than 200 remaining Mangalica in Hungary. Monte Nevado, a Spanish company began the breeding and recovery of Mangalica, and they were awarded with the Middle Cross of Hungary in 2016. Nowadays, the keeping of Mangalica has become a popular hobby. Slightly over 7,000 Mangalica sows in Hungary are producing around 60,000 piglets a year.
Apart from Hungary, the Mangalica is present in Austria, Canada, the Czech Republic, Germany, The Netherlands, Romania, Serbia, Slovakia, Slovenia, Switzerland and the United States. In Serbia, the breed (which is called mangulica in Serbian) almost completely died out in the 1980s. In 1998, Mangalica were introduced into the Zasavica wetlands. They are left to roam free in a reservation, becoming partially feral, with cases of breeding with wild boars known. By the early 2010s, their number had grown to 1,000 in Zasavica and in populations kept in the individual farms in the Syrmia and Mačva regions. As both autochthonous Serbian breeds of domestic pig, Šiška and Mangalica's predecessor Šumadinka, have died out, Mangalica are considered the only surviving autochthonous breed in Serbia. In March 2006, seventeen of the pigs were exported from Austria to the United Kingdom, where they are registered with the British Pig Association, and a Mangalica population is part of an environmental project in Dorset, England. In 2007, some were exported to the United States.
The Romanian Native or Bazna breed was created in 1872 by cross-breeding Mangalitsa and Berkshire stock.
Husbandry
The Mangalica produces too little lean meat, so it has been gradually replaced by modern domestic breeds. It is usually fed with a mix of wild pasture, supplemented with potatoes and pumpkins produced on the farm.
The primary product made from this pig is sausage, usually packed in the pig's duodenum. The minced meat is seasoned with salt, pepper, sweet paprika, and other spices. It is then eaten in slices with pickled vegetables. The pork is also served braised with sauerkraut, potatoes, and stuffed peppers as a side dish. Farmers also produce smoked hams. The fresh meat tastes strong and juicy; the suckling pigs are much preferred for their good fresh meat qualities.
In Hungary, most Mangalica pigs are raised purely or semi-intensively.
Slaughter weight (for meat production) is generally achieved beyond 12 months of age.
Meat from the Mangalica can be easily found in Hungary, as Hungarian farmers produce about 60,000 animals each year.
Varieties
There are three existing varieties of Mangalitsa, differing only in colour: "blonde", "swallow-bellied", and "red". The "blonde" Mangalica is blonde, the "swallow-bellied" (originally produced by crossing the Blonde Mangalica with the extinct Black Mangalica) has a blonde lower-portion of its body while the upper-portion of its body is black, and the "red" (produced by crossing the Blonde Mangalica with the Szalonta breed) is ginger-coloured.
Other varieties (including "black", "wolf", and "baris") have become extinct as pure-bred forms, though their reconstruction from selective breeding of mixed varieties is being debated in Hungary.
References
Pig breeds
Pig breeds originating in Hungary
|
Tô de Bem com a Vida () is the seventeenth studio album by Brazilian recording artist Xuxa Meneghel. It was released on October 5, 1996 by Som Livre.
Like Sexto Sentido (1994) and Luz no Meu Caminho (1995), Tô de Bem com a Vida was designed with the aim of appealing to both children and teenagers, as the Xuxa audience continued to follow their work. The album has as its main bet the Axé. The rhythms and culture of Brazil are very present in the album in tracks like "Quadrilha Da Xuxa", representing the June Festival and "Vaqueiro Vai Buscar Meu Boi", which portrays folklore.
Tô de Bem com a Vida was the first album by a Brazilian artist to be released simultaneously on TV, radio and internet. It was later certified platinum by Pro-Música Brasil (PMB).
Production and songs
In a climate of celebration due to the 10 years of Rede Globo, Xuxa wanted a happy album that reflected his current state of mind and this was the main inspiration of the album that counts on only two slow songs. The highlight of the album is the mix of Brazilian rhythms and themes. Axé came as the biggest bet with songs like "Tô De Bem Com A Vida" and "Xuxaxé", in addition to "Carnaxuxa" that portrays how is the carnival in the different corners of Brazil.
Still in the Culture of Brazil issue, was composed "A Caravela De Cabral", who talks about the history of the discovery of Brazil and "Vaqueiro Vai Buscar Meu Boi", which brings a bit of folklore to the album. "Ai, Ai, Ai" was originally composed for the singer Falcão. When Zé Henrique (songwriter) showed the song to the manager of Xuxa at the time, Marlene Mattos, she decided that the presenter would record the song for the album, arguing that the singer was irreverent and would marry the proposal of the album.
The track "Brincar De Rimar" is a re-recording of Fofão, but with the letter altered. In the passage that quotes the character, his name is replaced by that of Xuxa. The song "Amiga", composition in homage to Marlene Mattos, was recorded without the manager knew. The music video was also recorded as a surprise to the manager. The album was entirely produced by Michael Sullivan.
Release and reception
Tô de Bem com a Vida It was released by Som Livre on October 5, 1996, in CD, cassette and LP being the last released in this format. Tô de Bem com a Vida, was later certified platinum by Pro-Música Brasil (PMB) after selling 250,000 within the country.
Promotion
Tô de Bem com a Vida was well publicized in Xuxa Park, as well as the homonymous music that was sung several times in the program and in the frame Xuxa Hits. In addition to singing some of the songs in his attraction, Xuxa participated twice in Domingão do Faustão, the first on September 29 and the second on October 6 where he was honored in the framework of the program Confidential Archive.
Some of the songs won music videos on the specials of Children's Day and Christmas of 1996, these were: "Tô De Bem Com A Vida", "Xuxaxé", "Lá Vai A Loura", "Brincar De Rimar", "Ai, Ai, Ai" and "A Chuva". The "Amiga" video was only shown in 1998 in one of the editions of Xuxa 12 years.
In November 1996, Xuxa began the tour of the album by Brazil that extends until December 1997. The show that happened through several cities, was attended by more than 500 thousand people.
Track listing
Personnel
Produced: Michael Sullivan
Art Direction: Aramis Barros
Recording Technician: Mario Jorge and Sergio Rocha
Mixing: Som Livre
Technical Mixer: Sergio 'Gordo' Guimarães
Recorded in the studios: Som Livre
Production Assistant: Duda Nogueira
Studio Coordination: Helio de Freitas
Mastering: Som Livre - Sergio Seabra
Recording Assistants: Everaldo, Claudio Oliveira, Julio Carneiro, Ivan Carvalho and Mauro
Certifications
References
External links
Tô de Bem com a Vida at Discogs
1996 albums
Xuxa albums
Som Livre albums
Portuguese-language albums
|
```smalltalk
using System;
using System.Numerics;
namespace Algorithms.Numeric;
/// <summary>
/// path_to_url
/// The MillerRabin primality test or RabinMiller primality test is a probabilistic primality test:
/// an algorithm which determines whether a given number is likely to be prime,
/// similar to the Fermat primality test and the SolovayStrassen primality test.
/// It is of historical significance in the search for a polynomial-time deterministic primality test.
/// Its probabilistic variant remains widely used in practice, as one of the simplest and fastest tests known.
/// </summary>
public static class MillerRabinPrimalityChecker
{
/// <summary>
/// Run the probabilistic primality test.
/// </summary>
/// <param name="n">Number to check.</param>
/// <param name="rounds">Number of rounds, the parameter determines the accuracy of the test, recommended value is Log2(n).</param>
/// <param name="seed">Seed for random number generator.</param>
/// <returns>True if is a highly likely prime number; False otherwise.</returns>
/// <exception cref="ArgumentException">Error: number should be more than 3.</exception>
public static bool IsProbablyPrimeNumber(BigInteger n, BigInteger rounds, int? seed = null)
{
Random rand = seed is null
? new()
: new(seed.Value);
return IsProbablyPrimeNumber(n, rounds, rand);
}
private static bool IsProbablyPrimeNumber(BigInteger n, BigInteger rounds, Random rand)
{
if (n <= 3)
{
throw new ArgumentException($"{nameof(n)} should be more than 3");
}
// Input #1: n > 3, an odd integer to be tested for primality
// Input #2: k, the number of rounds of testing to perform, recommended k = Log2(n)
// Output: false = composite
// true = probably prime
// write n as 2rd + 1 with d odd(by factoring out powers of 2 from n 1)
BigInteger r = 0;
BigInteger d = n - 1;
while (d % 2 == 0)
{
r++;
d /= 2;
}
// as there is no native random function for BigInteger we suppose a random int number is sufficient
int nMaxValue = (n > int.MaxValue) ? int.MaxValue : (int)n;
BigInteger a = rand.Next(2, nMaxValue - 2); // ; pick a random integer a in the range[2, n 2]
while (rounds > 0)
{
rounds--;
var x = BigInteger.ModPow(a, d, n);
if (x == 1 || x == (n - 1))
{
continue;
}
BigInteger tempr = r - 1;
while (tempr > 0 && (x != n - 1))
{
tempr--;
x = BigInteger.ModPow(x, 2, n);
}
if (x == n - 1)
{
continue;
}
return false;
}
return true;
}
}
```
|
```c
/*
*
* This file is part of FFmpeg.
*
* FFmpeg is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
*
* FFmpeg 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
*
* You should have received a copy of the GNU Lesser General Public
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include "frame_thread_encoder.h"
#include "libavutil/fifo.h"
#include "libavutil/avassert.h"
#include "libavutil/imgutils.h"
#include "libavutil/thread.h"
#include "avcodec.h"
#include "internal.h"
#include "thread.h"
#define MAX_THREADS 64
#define BUFFER_SIZE (2*MAX_THREADS)
typedef struct{
void *indata;
void *outdata;
int64_t return_code;
unsigned index;
} Task;
typedef struct{
AVCodecContext *parent_avctx;
pthread_mutex_t buffer_mutex;
AVFifoBuffer *task_fifo;
pthread_mutex_t task_fifo_mutex;
pthread_cond_t task_fifo_cond;
Task finished_tasks[BUFFER_SIZE];
pthread_mutex_t finished_task_mutex;
pthread_cond_t finished_task_cond;
unsigned task_index;
unsigned finished_task_index;
pthread_t worker[MAX_THREADS];
int exit;
} ThreadContext;
static void * attribute_align_arg worker(void *v){
AVCodecContext *avctx = v;
ThreadContext *c = avctx->internal->frame_thread_encoder;
AVPacket *pkt = NULL;
while(!c->exit){
int got_packet, ret;
AVFrame *frame;
Task task;
if(!pkt) pkt= av_mallocz(sizeof(*pkt));
if(!pkt) continue;
av_init_packet(pkt);
pthread_mutex_lock(&c->task_fifo_mutex);
while (av_fifo_size(c->task_fifo) <= 0 || c->exit) {
if(c->exit){
pthread_mutex_unlock(&c->task_fifo_mutex);
goto end;
}
pthread_cond_wait(&c->task_fifo_cond, &c->task_fifo_mutex);
}
av_fifo_generic_read(c->task_fifo, &task, sizeof(task), NULL);
pthread_mutex_unlock(&c->task_fifo_mutex);
frame = task.indata;
ret = avcodec_encode_video2(avctx, pkt, frame, &got_packet);
pthread_mutex_lock(&c->buffer_mutex);
av_frame_unref(frame);
pthread_mutex_unlock(&c->buffer_mutex);
av_frame_free(&frame);
if(got_packet) {
av_dup_packet(pkt);
} else {
pkt->data = NULL;
pkt->size = 0;
}
pthread_mutex_lock(&c->finished_task_mutex);
c->finished_tasks[task.index].outdata = pkt; pkt = NULL;
c->finished_tasks[task.index].return_code = ret;
pthread_cond_signal(&c->finished_task_cond);
pthread_mutex_unlock(&c->finished_task_mutex);
}
end:
av_free(pkt);
pthread_mutex_lock(&c->buffer_mutex);
avcodec_close(avctx);
pthread_mutex_unlock(&c->buffer_mutex);
av_freep(&avctx);
return NULL;
}
int ff_frame_thread_encoder_init(AVCodecContext *avctx, AVDictionary *options){
int i=0;
ThreadContext *c;
if( !(avctx->thread_type & FF_THREAD_FRAME)
|| !(avctx->codec->capabilities & AV_CODEC_CAP_INTRA_ONLY))
return 0;
if( !avctx->thread_count
&& avctx->codec_id == AV_CODEC_ID_MJPEG
&& !(avctx->flags & AV_CODEC_FLAG_QSCALE)) {
av_log(avctx, AV_LOG_DEBUG,
"Forcing thread count to 1 for MJPEG encoding, use -thread_type slice "
"or a constant quantizer if you want to use multiple cpu cores\n");
avctx->thread_count = 1;
}
if( avctx->thread_count > 1
&& avctx->codec_id == AV_CODEC_ID_MJPEG
&& !(avctx->flags & AV_CODEC_FLAG_QSCALE))
av_log(avctx, AV_LOG_WARNING,
"MJPEG CBR encoding works badly with frame multi-threading, consider "
"using -threads 1, -thread_type slice or a constant quantizer.\n");
if (avctx->codec_id == AV_CODEC_ID_HUFFYUV ||
avctx->codec_id == AV_CODEC_ID_FFVHUFF) {
int warn = 0;
if (avctx->flags & AV_CODEC_FLAG_PASS1)
warn = 1;
else if(avctx->context_model > 0) {
AVDictionaryEntry *t = av_dict_get(options, "non_deterministic",
NULL, AV_DICT_MATCH_CASE);
warn = !t || !t->value || !atoi(t->value) ? 1 : 0;
}
// huffyuv does not support these with multiple frame threads currently
if (warn) {
av_log(avctx, AV_LOG_WARNING,
"Forcing thread count to 1 for huffyuv encoding with first pass or context 1\n");
avctx->thread_count = 1;
}
}
if(!avctx->thread_count) {
avctx->thread_count = av_cpu_count();
avctx->thread_count = FFMIN(avctx->thread_count, MAX_THREADS);
}
if(avctx->thread_count <= 1)
return 0;
if(avctx->thread_count > MAX_THREADS)
return AVERROR(EINVAL);
av_assert0(!avctx->internal->frame_thread_encoder);
c = avctx->internal->frame_thread_encoder = av_mallocz(sizeof(ThreadContext));
if(!c)
return AVERROR(ENOMEM);
c->parent_avctx = avctx;
c->task_fifo = av_fifo_alloc_array(BUFFER_SIZE, sizeof(Task));
if(!c->task_fifo)
goto fail;
pthread_mutex_init(&c->task_fifo_mutex, NULL);
pthread_mutex_init(&c->finished_task_mutex, NULL);
pthread_mutex_init(&c->buffer_mutex, NULL);
pthread_cond_init(&c->task_fifo_cond, NULL);
pthread_cond_init(&c->finished_task_cond, NULL);
for(i=0; i<avctx->thread_count ; i++){
AVDictionary *tmp = NULL;
void *tmpv;
AVCodecContext *thread_avctx = avcodec_alloc_context3(avctx->codec);
if(!thread_avctx)
goto fail;
tmpv = thread_avctx->priv_data;
*thread_avctx = *avctx;
thread_avctx->priv_data = tmpv;
thread_avctx->internal = NULL;
memcpy(thread_avctx->priv_data, avctx->priv_data, avctx->codec->priv_data_size);
thread_avctx->thread_count = 1;
thread_avctx->active_thread_type &= ~FF_THREAD_FRAME;
av_dict_copy(&tmp, options, 0);
av_dict_set(&tmp, "threads", "1", 0);
if(avcodec_open2(thread_avctx, avctx->codec, &tmp) < 0) {
av_dict_free(&tmp);
goto fail;
}
av_dict_free(&tmp);
av_assert0(!thread_avctx->internal->frame_thread_encoder);
thread_avctx->internal->frame_thread_encoder = c;
if(pthread_create(&c->worker[i], NULL, worker, thread_avctx)) {
goto fail;
}
}
avctx->active_thread_type = FF_THREAD_FRAME;
return 0;
fail:
avctx->thread_count = i;
av_log(avctx, AV_LOG_ERROR, "ff_frame_thread_encoder_init failed\n");
ff_frame_thread_encoder_free(avctx);
return -1;
}
void ff_frame_thread_encoder_free(AVCodecContext *avctx){
int i;
ThreadContext *c= avctx->internal->frame_thread_encoder;
pthread_mutex_lock(&c->task_fifo_mutex);
c->exit = 1;
pthread_cond_broadcast(&c->task_fifo_cond);
pthread_mutex_unlock(&c->task_fifo_mutex);
for (i=0; i<avctx->thread_count; i++) {
pthread_join(c->worker[i], NULL);
}
pthread_mutex_destroy(&c->task_fifo_mutex);
pthread_mutex_destroy(&c->finished_task_mutex);
pthread_mutex_destroy(&c->buffer_mutex);
pthread_cond_destroy(&c->task_fifo_cond);
pthread_cond_destroy(&c->finished_task_cond);
av_fifo_freep(&c->task_fifo);
av_freep(&avctx->internal->frame_thread_encoder);
}
int ff_thread_video_encode_frame(AVCodecContext *avctx, AVPacket *pkt, const AVFrame *frame, int *got_packet_ptr){
ThreadContext *c = avctx->internal->frame_thread_encoder;
Task task;
int ret;
av_assert1(!*got_packet_ptr);
if(frame){
AVFrame *new = av_frame_alloc();
if(!new)
return AVERROR(ENOMEM);
ret = av_frame_ref(new, frame);
if(ret < 0) {
av_frame_free(&new);
return ret;
}
task.index = c->task_index;
task.indata = (void*)new;
pthread_mutex_lock(&c->task_fifo_mutex);
av_fifo_generic_write(c->task_fifo, &task, sizeof(task), NULL);
pthread_cond_signal(&c->task_fifo_cond);
pthread_mutex_unlock(&c->task_fifo_mutex);
c->task_index = (c->task_index+1) % BUFFER_SIZE;
if(!c->finished_tasks[c->finished_task_index].outdata && (c->task_index - c->finished_task_index) % BUFFER_SIZE <= avctx->thread_count)
return 0;
}
if(c->task_index == c->finished_task_index)
return 0;
pthread_mutex_lock(&c->finished_task_mutex);
while (!c->finished_tasks[c->finished_task_index].outdata) {
pthread_cond_wait(&c->finished_task_cond, &c->finished_task_mutex);
}
task = c->finished_tasks[c->finished_task_index];
*pkt = *(AVPacket*)(task.outdata);
if(pkt->data)
*got_packet_ptr = 1;
av_freep(&c->finished_tasks[c->finished_task_index].outdata);
c->finished_task_index = (c->finished_task_index+1) % BUFFER_SIZE;
pthread_mutex_unlock(&c->finished_task_mutex);
return task.return_code;
}
```
|
```c
/* $OpenBSD: disk.c,v 1.20 2023/01/16 07:29:35 deraadt Exp $ */
/* $NetBSD: disk.c,v 1.6 1997/04/06 08:40:33 cgd Exp $ */
/*
* The Regents of the University of California. All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* Van Jacobson of Lawrence Berkeley Laboratory and Ralph Campbell.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University 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 REGENTS 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 REGENTS 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.
*
* @(#)rz.c 8.1 (Berkeley) 6/10/93
*/
#include <lib/libsa/stand.h>
#include <sys/param.h>
#include <sys/disklabel.h>
#include <machine/rpb.h>
#include <machine/prom.h>
#include "disk.h"
struct disk_softc {
int sc_fd; /* PROM channel number */
int sc_ctlr; /* controller number */
int sc_unit; /* disk unit number */
int sc_part; /* disk partition number */
struct disklabel sc_label; /* disk label for this disk */
};
int
diskstrategy(void *devdata, int rw, daddr_t bn, size_t reqcnt, void *addrvoid,
size_t *cnt)
{
char *addr = addrvoid;
struct disk_softc *sc;
struct partition *pp;
prom_return_t ret;
int s;
if ((reqcnt & 0xffffff) != reqcnt ||
reqcnt == 0)
asm("call_pal 0");
twiddle();
/* Partial-block transfers not handled. */
if (reqcnt & (DEV_BSIZE - 1)) {
*cnt = 0;
return (EINVAL);
}
sc = (struct disk_softc *)devdata;
pp = &sc->sc_label.d_partitions[sc->sc_part];
if (rw == F_READ)
ret.bits = prom_read(sc->sc_fd, reqcnt, addr, bn + pp->p_offset);
else
ret.bits = prom_write(sc->sc_fd, reqcnt, addr, bn + pp->p_offset);
if (ret.u.status)
return (EIO);
if (cnt)
*cnt = ret.u.retval;
return (0);
}
int
diskopen(struct open_file *f, int ctlr, int unit, int part)
{
struct disklabel *lp;
prom_return_t ret;
size_t cnt;
int devlen, i;
char *msg, buf[DEV_BSIZE], devname[32];
struct disk_softc *sc;
if (unit >= 16 || part >= MAXPARTITIONS)
return (ENXIO);
/*
* XXX
* We don't know what device names look like yet,
* so we can't change them.
*/
ret.bits = prom_getenv(PROM_E_BOOTED_DEV, devname, sizeof(devname));
devlen = ret.u.retval;
ret.bits = prom_open((u_int64_t)devname, devlen);
if (ret.u.status == 2)
return (ENXIO);
if (ret.u.status == 3)
return (EIO);
sc = alloc(sizeof(struct disk_softc));
bzero(sc, sizeof(struct disk_softc));
f->f_devdata = (void *)sc;
sc->sc_fd = ret.u.retval;
sc->sc_ctlr = ctlr;
sc->sc_unit = unit;
sc->sc_part = part;
/* Try to read disk label and partition table information. */
lp = &sc->sc_label;
lp->d_secsize = DEV_BSIZE;
lp->d_secpercyl = 1;
lp->d_npartitions = MAXPARTITIONS;
DL_SETPOFFSET(&lp->d_partitions[part], 0);
DL_SETPSIZE(&lp->d_partitions[part], 0x7fffffff);
i = diskstrategy(sc, F_READ,
LABELSECTOR, DEV_BSIZE, buf, &cnt);
if (i || cnt != DEV_BSIZE) {
printf("disk%d: error reading disk label\n", unit);
goto bad;
} else if (((struct disklabel *)(buf + LABELOFFSET))->d_magic !=
DISKMAGIC) {
/* No label at all. Fake all partitions as whole disk. */
for (i = 0; i < MAXPARTITIONS; i++) {
DL_SETPOFFSET(&lp->d_partitions[part], 0);
DL_SETPSIZE(&lp->d_partitions[part], 0x7fffffff);
}
} else {
msg = getdisklabel(buf + LABELOFFSET, lp);
if (msg) {
printf("disk%d: %s\n", unit, msg);
goto bad;
}
}
if (part >= lp->d_npartitions ||
DL_GETPSIZE(&lp->d_partitions[part]) == 0) {
bad: free(sc, sizeof(struct disk_softc));
return (ENXIO);
}
return (0);
}
int
diskclose(struct open_file *f)
{
struct disk_softc *sc;
sc = f->f_devdata;
(void)prom_close(sc->sc_fd);
free(sc, sizeof(struct disk_softc));
f->f_devdata = NULL;
return (0);
}
```
|
Shanika is a given name. Notable people with the name include:
Shanika Bruce (born 1995), Barbadian cricketer
Shanika Karunasekera, engineer
Shanika Minor (born 1991), American criminal
Shanika Roberts-Odle, Barbadian politician
Shanika Warren-Markland, British actress
Feminine given names
|
```html
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<HTML>
<HEAD>
<TITLE>Lua 5.4 Reference Manual - contents</TITLE>
<LINK REL="stylesheet" TYPE="text/css" HREF="lua.css">
<LINK REL="stylesheet" TYPE="text/css" HREF="index.css">
<META HTTP-EQUIV="content-type" CONTENT="text/html; charset=iso-8859-1">
</HEAD>
<BODY>
<H1>
<A HREF="path_to_url"><IMG SRC="logo.gif" ALT="Lua"></A>
Lua 5.4 Reference Manual
</H1>
<P>
The reference manual is the official definition of the Lua language.
<BR>
For a complete introduction to Lua programming, see the book
<A HREF="path_to_url">Programming in Lua</A>.
<DIV CLASS="menubar">
<A HREF="manual.html">start</A>
·
<A HREF="#contents">contents</A>
·
<A HREF="#index">index</A>
·
<A HREF="path_to_url">other versions</A>
</DIV>
<P>
<SMALL>
Freely available under the terms of the
<A HREF="path_to_url">Lua license</A>.
</SMALL>
<H2><A NAME="contents">Contents</A></H2>
<UL CLASS="contents menubar">
<LI><A HREF="manual.html">1 – Introduction</A>
<P>
<LI><A HREF="manual.html#2">2 – Basic Concepts</A>
<UL>
<LI><A HREF="manual.html#2.1">2.1 – Values and Types</A>
<LI><A HREF="manual.html#2.2">2.2 – Environments and the Global Environment</A>
<LI><A HREF="manual.html#2.3">2.3 – Error Handling</A>
<LI><A HREF="manual.html#2.4">2.4 – Metatables and Metamethods</A>
<LI><A HREF="manual.html#2.5">2.5 – Garbage Collection</A>
<UL>
<LI><A HREF="manual.html#2.5.1">2.5.1 – Incremental Garbage Collection</A>
<LI><A HREF="manual.html#2.5.2">2.5.2 – Generational Garbage Collection</A>
<LI><A HREF="manual.html#2.5.3">2.5.3 – Garbage-Collection Metamethods</A>
<LI><A HREF="manual.html#2.5.4">2.5.4 – Weak Tables</A>
</UL>
<LI><A HREF="manual.html#2.6">2.6 – Coroutines</A>
</UL>
<P>
<LI><A HREF="manual.html#3">3 – The Language</A>
<UL>
<LI><A HREF="manual.html#3.1">3.1 – Lexical Conventions</A>
<LI><A HREF="manual.html#3.2">3.2 – Variables</A>
<LI><A HREF="manual.html#3.3">3.3 – Statements</A>
<UL>
<LI><A HREF="manual.html#3.3.1">3.3.1 – Blocks</A>
<LI><A HREF="manual.html#3.3.2">3.3.2 – Chunks</A>
<LI><A HREF="manual.html#3.3.3">3.3.3 – Assignment</A>
<LI><A HREF="manual.html#3.3.4">3.3.4 – Control Structures</A>
<LI><A HREF="manual.html#3.3.5">3.3.5 – For Statement</A>
<LI><A HREF="manual.html#3.3.6">3.3.6 – Function Calls as Statements</A>
<LI><A HREF="manual.html#3.3.7">3.3.7 – Local Declarations</A>
<LI><A HREF="manual.html#3.3.8">3.3.8 – To-be-closed Variables</A>
</UL>
<LI><A HREF="manual.html#3.4">3.4 – Expressions</A>
<UL>
<LI><A HREF="manual.html#3.4.1">3.4.1 – Arithmetic Operators</A>
<LI><A HREF="manual.html#3.4.2">3.4.2 – Bitwise Operators</A>
<LI><A HREF="manual.html#3.4.3">3.4.3 – Coercions and Conversions</A>
<LI><A HREF="manual.html#3.4.4">3.4.4 – Relational Operators</A>
<LI><A HREF="manual.html#3.4.5">3.4.5 – Logical Operators</A>
<LI><A HREF="manual.html#3.4.6">3.4.6 – Concatenation</A>
<LI><A HREF="manual.html#3.4.7">3.4.7 – The Length Operator</A>
<LI><A HREF="manual.html#3.4.8">3.4.8 – Precedence</A>
<LI><A HREF="manual.html#3.4.9">3.4.9 – Table Constructors</A>
<LI><A HREF="manual.html#3.4.10">3.4.10 – Function Calls</A>
<LI><A HREF="manual.html#3.4.11">3.4.11 – Function Definitions</A>
</UL>
<LI><A HREF="manual.html#3.5">3.5 – Visibility Rules</A>
</UL>
<P>
<LI><A HREF="manual.html#4">4 – The Application Program Interface</A>
<UL>
<LI><A HREF="manual.html#4.1">4.1 – The Stack</A>
<UL>
<LI><A HREF="manual.html#4.1.1">4.1.1 – Stack Size</A>
<LI><A HREF="manual.html#4.1.2">4.1.2 – Valid and Acceptable Indices</A>
<LI><A HREF="manual.html#4.1.3">4.1.3 – Pointers to strings</A>
</UL>
<LI><A HREF="manual.html#4.2">4.2 – C Closures</A>
<LI><A HREF="manual.html#4.3">4.3 – Registry</A>
<LI><A HREF="manual.html#4.4">4.4 – Error Handling in C</A>
<UL>
<LI><A HREF="manual.html#4.4.1">4.4.1 – Status Codes</A>
</UL>
<LI><A HREF="manual.html#4.5">4.5 – Handling Yields in C</A>
<LI><A HREF="manual.html#4.6">4.6 – Functions and Types</A>
<LI><A HREF="manual.html#4.7">4.7 – The Debug Interface</A>
</UL>
<P>
<LI><A HREF="manual.html#5">5 – The Auxiliary Library</A>
<UL>
<LI><A HREF="manual.html#5.1">5.1 – Functions and Types</A>
</UL>
<P>
<LI><A HREF="manual.html#6">6 – The Standard Libraries</A>
<UL>
<LI><A HREF="manual.html#6.1">6.1 – Basic Functions</A>
<LI><A HREF="manual.html#6.2">6.2 – Coroutine Manipulation</A>
<LI><A HREF="manual.html#6.3">6.3 – Modules</A>
<LI><A HREF="manual.html#6.4">6.4 – String Manipulation</A>
<UL>
<LI><A HREF="manual.html#6.4.1">6.4.1 – Patterns</A>
<LI><A HREF="manual.html#6.4.2">6.4.2 – Format Strings for Pack and Unpack</A>
</UL>
<LI><A HREF="manual.html#6.5">6.5 – UTF-8 Support</A>
<LI><A HREF="manual.html#6.6">6.6 – Table Manipulation</A>
<LI><A HREF="manual.html#6.7">6.7 – Mathematical Functions</A>
<LI><A HREF="manual.html#6.8">6.8 – Input and Output Facilities</A>
<LI><A HREF="manual.html#6.9">6.9 – Operating System Facilities</A>
<LI><A HREF="manual.html#6.10">6.10 – The Debug Library</A>
</UL>
<P>
<LI><A HREF="manual.html#7">7 – Lua Standalone</A>
<P>
<LI><A HREF="manual.html#8">8 – Incompatibilities with the Previous Version</A>
<UL>
<LI><A HREF="manual.html#8.1">8.1 – Incompatibilities in the Language</A>
<LI><A HREF="manual.html#8.2">8.2 – Incompatibilities in the Libraries</A>
<LI><A HREF="manual.html#8.3">8.3 – Incompatibilities in the API</A>
</UL>
<P>
<LI><A HREF="manual.html#9">9 – The Complete Syntax of Lua</A>
</UL>
<H2><A NAME="index">Index</A></H2>
<TABLE CLASS="menubar" WIDTH="100%">
<TR>
<TD>
<H3><A NAME="functions">Lua functions</A></H3>
<P>
<A HREF="manual.html#6.1">basic</A><BR>
<A HREF="manual.html#pdf-_G">_G</A><BR>
<A HREF="manual.html#pdf-_VERSION">_VERSION</A><BR>
<A HREF="manual.html#pdf-assert">assert</A><BR>
<A HREF="manual.html#pdf-collectgarbage">collectgarbage</A><BR>
<A HREF="manual.html#pdf-dofile">dofile</A><BR>
<A HREF="manual.html#pdf-error">error</A><BR>
<A HREF="manual.html#pdf-getmetatable">getmetatable</A><BR>
<A HREF="manual.html#pdf-ipairs">ipairs</A><BR>
<A HREF="manual.html#pdf-load">load</A><BR>
<A HREF="manual.html#pdf-loadfile">loadfile</A><BR>
<A HREF="manual.html#pdf-next">next</A><BR>
<A HREF="manual.html#pdf-pairs">pairs</A><BR>
<A HREF="manual.html#pdf-pcall">pcall</A><BR>
<A HREF="manual.html#pdf-print">print</A><BR>
<A HREF="manual.html#pdf-rawequal">rawequal</A><BR>
<A HREF="manual.html#pdf-rawget">rawget</A><BR>
<A HREF="manual.html#pdf-rawlen">rawlen</A><BR>
<A HREF="manual.html#pdf-rawset">rawset</A><BR>
<A HREF="manual.html#pdf-require">require</A><BR>
<A HREF="manual.html#pdf-select">select</A><BR>
<A HREF="manual.html#pdf-setmetatable">setmetatable</A><BR>
<A HREF="manual.html#pdf-tonumber">tonumber</A><BR>
<A HREF="manual.html#pdf-tostring">tostring</A><BR>
<A HREF="manual.html#pdf-type">type</A><BR>
<A HREF="manual.html#pdf-warn">warn</A><BR>
<A HREF="manual.html#pdf-xpcall">xpcall</A><BR>
<P>
<A HREF="manual.html#6.2">coroutine</A><BR>
<A HREF="manual.html#pdf-coroutine.close">coroutine.close</A><BR>
<A HREF="manual.html#pdf-coroutine.create">coroutine.create</A><BR>
<A HREF="manual.html#pdf-coroutine.isyieldable">coroutine.isyieldable</A><BR>
<A HREF="manual.html#pdf-coroutine.resume">coroutine.resume</A><BR>
<A HREF="manual.html#pdf-coroutine.running">coroutine.running</A><BR>
<A HREF="manual.html#pdf-coroutine.status">coroutine.status</A><BR>
<A HREF="manual.html#pdf-coroutine.wrap">coroutine.wrap</A><BR>
<A HREF="manual.html#pdf-coroutine.yield">coroutine.yield</A><BR>
<P>
<A HREF="manual.html#6.10">debug</A><BR>
<A HREF="manual.html#pdf-debug.debug">debug.debug</A><BR>
<A HREF="manual.html#pdf-debug.gethook">debug.gethook</A><BR>
<A HREF="manual.html#pdf-debug.getinfo">debug.getinfo</A><BR>
<A HREF="manual.html#pdf-debug.getlocal">debug.getlocal</A><BR>
<A HREF="manual.html#pdf-debug.getmetatable">debug.getmetatable</A><BR>
<A HREF="manual.html#pdf-debug.getregistry">debug.getregistry</A><BR>
<A HREF="manual.html#pdf-debug.getupvalue">debug.getupvalue</A><BR>
<A HREF="manual.html#pdf-debug.getuservalue">debug.getuservalue</A><BR>
<A HREF="manual.html#pdf-debug.sethook">debug.sethook</A><BR>
<A HREF="manual.html#pdf-debug.setlocal">debug.setlocal</A><BR>
<A HREF="manual.html#pdf-debug.setmetatable">debug.setmetatable</A><BR>
<A HREF="manual.html#pdf-debug.setupvalue">debug.setupvalue</A><BR>
<A HREF="manual.html#pdf-debug.setuservalue">debug.setuservalue</A><BR>
<A HREF="manual.html#pdf-debug.traceback">debug.traceback</A><BR>
<A HREF="manual.html#pdf-debug.upvalueid">debug.upvalueid</A><BR>
<A HREF="manual.html#pdf-debug.upvaluejoin">debug.upvaluejoin</A><BR>
<P>
<A HREF="manual.html#6.8">io</A><BR>
<A HREF="manual.html#pdf-io.close">io.close</A><BR>
<A HREF="manual.html#pdf-io.flush">io.flush</A><BR>
<A HREF="manual.html#pdf-io.input">io.input</A><BR>
<A HREF="manual.html#pdf-io.lines">io.lines</A><BR>
<A HREF="manual.html#pdf-io.open">io.open</A><BR>
<A HREF="manual.html#pdf-io.output">io.output</A><BR>
<A HREF="manual.html#pdf-io.popen">io.popen</A><BR>
<A HREF="manual.html#pdf-io.read">io.read</A><BR>
<A HREF="manual.html#pdf-io.stderr">io.stderr</A><BR>
<A HREF="manual.html#pdf-io.stdin">io.stdin</A><BR>
<A HREF="manual.html#pdf-io.stdout">io.stdout</A><BR>
<A HREF="manual.html#pdf-io.tmpfile">io.tmpfile</A><BR>
<A HREF="manual.html#pdf-io.type">io.type</A><BR>
<A HREF="manual.html#pdf-io.write">io.write</A><BR>
<A HREF="manual.html#pdf-file:close">file:close</A><BR>
<A HREF="manual.html#pdf-file:flush">file:flush</A><BR>
<A HREF="manual.html#pdf-file:lines">file:lines</A><BR>
<A HREF="manual.html#pdf-file:read">file:read</A><BR>
<A HREF="manual.html#pdf-file:seek">file:seek</A><BR>
<A HREF="manual.html#pdf-file:setvbuf">file:setvbuf</A><BR>
<A HREF="manual.html#pdf-file:write">file:write</A><BR>
</TD>
<TD>
<H3> </H3>
<P>
<A HREF="manual.html#6.7">math</A><BR>
<A HREF="manual.html#pdf-math.abs">math.abs</A><BR>
<A HREF="manual.html#pdf-math.acos">math.acos</A><BR>
<A HREF="manual.html#pdf-math.asin">math.asin</A><BR>
<A HREF="manual.html#pdf-math.atan">math.atan</A><BR>
<A HREF="manual.html#pdf-math.ceil">math.ceil</A><BR>
<A HREF="manual.html#pdf-math.cos">math.cos</A><BR>
<A HREF="manual.html#pdf-math.deg">math.deg</A><BR>
<A HREF="manual.html#pdf-math.exp">math.exp</A><BR>
<A HREF="manual.html#pdf-math.floor">math.floor</A><BR>
<A HREF="manual.html#pdf-math.fmod">math.fmod</A><BR>
<A HREF="manual.html#pdf-math.huge">math.huge</A><BR>
<A HREF="manual.html#pdf-math.log">math.log</A><BR>
<A HREF="manual.html#pdf-math.max">math.max</A><BR>
<A HREF="manual.html#pdf-math.maxinteger">math.maxinteger</A><BR>
<A HREF="manual.html#pdf-math.min">math.min</A><BR>
<A HREF="manual.html#pdf-math.mininteger">math.mininteger</A><BR>
<A HREF="manual.html#pdf-math.modf">math.modf</A><BR>
<A HREF="manual.html#pdf-math.pi">math.pi</A><BR>
<A HREF="manual.html#pdf-math.rad">math.rad</A><BR>
<A HREF="manual.html#pdf-math.random">math.random</A><BR>
<A HREF="manual.html#pdf-math.randomseed">math.randomseed</A><BR>
<A HREF="manual.html#pdf-math.sin">math.sin</A><BR>
<A HREF="manual.html#pdf-math.sqrt">math.sqrt</A><BR>
<A HREF="manual.html#pdf-math.tan">math.tan</A><BR>
<A HREF="manual.html#pdf-math.tointeger">math.tointeger</A><BR>
<A HREF="manual.html#pdf-math.type">math.type</A><BR>
<A HREF="manual.html#pdf-math.ult">math.ult</A><BR>
<P>
<A HREF="manual.html#6.9">os</A><BR>
<A HREF="manual.html#pdf-os.clock">os.clock</A><BR>
<A HREF="manual.html#pdf-os.date">os.date</A><BR>
<A HREF="manual.html#pdf-os.difftime">os.difftime</A><BR>
<A HREF="manual.html#pdf-os.execute">os.execute</A><BR>
<A HREF="manual.html#pdf-os.exit">os.exit</A><BR>
<A HREF="manual.html#pdf-os.getenv">os.getenv</A><BR>
<A HREF="manual.html#pdf-os.remove">os.remove</A><BR>
<A HREF="manual.html#pdf-os.rename">os.rename</A><BR>
<A HREF="manual.html#pdf-os.setlocale">os.setlocale</A><BR>
<A HREF="manual.html#pdf-os.time">os.time</A><BR>
<A HREF="manual.html#pdf-os.tmpname">os.tmpname</A><BR>
<P>
<A HREF="manual.html#6.3">package</A><BR>
<A HREF="manual.html#pdf-package.config">package.config</A><BR>
<A HREF="manual.html#pdf-package.cpath">package.cpath</A><BR>
<A HREF="manual.html#pdf-package.loaded">package.loaded</A><BR>
<A HREF="manual.html#pdf-package.loadlib">package.loadlib</A><BR>
<A HREF="manual.html#pdf-package.path">package.path</A><BR>
<A HREF="manual.html#pdf-package.preload">package.preload</A><BR>
<A HREF="manual.html#pdf-package.searchers">package.searchers</A><BR>
<A HREF="manual.html#pdf-package.searchpath">package.searchpath</A><BR>
<P>
<A HREF="manual.html#6.4">string</A><BR>
<A HREF="manual.html#pdf-string.byte">string.byte</A><BR>
<A HREF="manual.html#pdf-string.char">string.char</A><BR>
<A HREF="manual.html#pdf-string.dump">string.dump</A><BR>
<A HREF="manual.html#pdf-string.find">string.find</A><BR>
<A HREF="manual.html#pdf-string.format">string.format</A><BR>
<A HREF="manual.html#pdf-string.gmatch">string.gmatch</A><BR>
<A HREF="manual.html#pdf-string.gsub">string.gsub</A><BR>
<A HREF="manual.html#pdf-string.len">string.len</A><BR>
<A HREF="manual.html#pdf-string.lower">string.lower</A><BR>
<A HREF="manual.html#pdf-string.match">string.match</A><BR>
<A HREF="manual.html#pdf-string.pack">string.pack</A><BR>
<A HREF="manual.html#pdf-string.packsize">string.packsize</A><BR>
<A HREF="manual.html#pdf-string.rep">string.rep</A><BR>
<A HREF="manual.html#pdf-string.reverse">string.reverse</A><BR>
<A HREF="manual.html#pdf-string.sub">string.sub</A><BR>
<A HREF="manual.html#pdf-string.unpack">string.unpack</A><BR>
<A HREF="manual.html#pdf-string.upper">string.upper</A><BR>
<P>
<A HREF="manual.html#6.6">table</A><BR>
<A HREF="manual.html#pdf-table.concat">table.concat</A><BR>
<A HREF="manual.html#pdf-table.insert">table.insert</A><BR>
<A HREF="manual.html#pdf-table.move">table.move</A><BR>
<A HREF="manual.html#pdf-table.pack">table.pack</A><BR>
<A HREF="manual.html#pdf-table.remove">table.remove</A><BR>
<A HREF="manual.html#pdf-table.sort">table.sort</A><BR>
<A HREF="manual.html#pdf-table.unpack">table.unpack</A><BR>
<P>
<A HREF="manual.html#6.5">utf8</A><BR>
<A HREF="manual.html#pdf-utf8.char">utf8.char</A><BR>
<A HREF="manual.html#pdf-utf8.charpattern">utf8.charpattern</A><BR>
<A HREF="manual.html#pdf-utf8.codepoint">utf8.codepoint</A><BR>
<A HREF="manual.html#pdf-utf8.codes">utf8.codes</A><BR>
<A HREF="manual.html#pdf-utf8.len">utf8.len</A><BR>
<A HREF="manual.html#pdf-utf8.offset">utf8.offset</A><BR>
<H3><A NAME="metamethods">metamethods</A></H3>
<P>
<A HREF="manual.html#2.4">__add</A><BR>
<A HREF="manual.html#2.4">__band</A><BR>
<A HREF="manual.html#2.4">__bnot</A><BR>
<A HREF="manual.html#2.4">__bor</A><BR>
<A HREF="manual.html#2.4">__bxor</A><BR>
<A HREF="manual.html#2.4">__call</A><BR>
<A HREF="manual.html#3.3.8">__close</A><BR>
<A HREF="manual.html#2.4">__concat</A><BR>
<A HREF="manual.html#2.4">__div</A><BR>
<A HREF="manual.html#2.4">__eq</A><BR>
<A HREF="manual.html#2.5.3">__gc</A><BR>
<A HREF="manual.html#2.4">__idiv</A><BR>
<A HREF="manual.html#2.4">__index</A><BR>
<A HREF="manual.html#2.4">__le</A><BR>
<A HREF="manual.html#2.4">__len</A><BR>
<A HREF="manual.html#2.4">__lt</A><BR>
<A HREF="manual.html#pdf-getmetatable">__metatable</A><BR>
<A HREF="manual.html#2.4">__mod</A><BR>
<A HREF="manual.html#2.5.4">__mode</A><BR>
<A HREF="manual.html#2.4">__mul</A><BR>
<A HREF="manual.html#luaL_newmetatable">__name</A><BR>
<A HREF="manual.html#2.4">__newindex</A><BR>
<A HREF="manual.html#pdf-pairs">__pairs</A><BR>
<A HREF="manual.html#2.4">__pow</A><BR>
<A HREF="manual.html#2.4">__shl</A><BR>
<A HREF="manual.html#2.4">__shr</A><BR>
<A HREF="manual.html#2.4">__sub</A><BR>
<A HREF="manual.html#pdf-tostring">__tostring</A><BR>
<A HREF="manual.html#2.4">__unm</A><BR>
<H3><A NAME="env">environment<BR>variables</A></H3>
<P>
<A HREF="manual.html#pdf-LUA_CPATH">LUA_CPATH</A><BR>
<A HREF="manual.html#pdf-LUA_CPATH_5_4">LUA_CPATH_5_4</A><BR>
<A HREF="manual.html#pdf-LUA_INIT">LUA_INIT</A><BR>
<A HREF="manual.html#pdf-LUA_INIT_5_4">LUA_INIT_5_4</A><BR>
<A HREF="manual.html#pdf-LUA_PATH">LUA_PATH</A><BR>
<A HREF="manual.html#pdf-LUA_PATH_5_4">LUA_PATH_5_4</A><BR>
</TD>
<TD>
<H3><A NAME="api">C API</A></H3>
<P>
<A HREF="manual.html#lua_Alloc">lua_Alloc</A><BR>
<A HREF="manual.html#lua_CFunction">lua_CFunction</A><BR>
<A HREF="manual.html#lua_Debug">lua_Debug</A><BR>
<A HREF="manual.html#lua_Hook">lua_Hook</A><BR>
<A HREF="manual.html#lua_Integer">lua_Integer</A><BR>
<A HREF="manual.html#lua_KContext">lua_KContext</A><BR>
<A HREF="manual.html#lua_KFunction">lua_KFunction</A><BR>
<A HREF="manual.html#lua_Number">lua_Number</A><BR>
<A HREF="manual.html#lua_Reader">lua_Reader</A><BR>
<A HREF="manual.html#lua_State">lua_State</A><BR>
<A HREF="manual.html#lua_Unsigned">lua_Unsigned</A><BR>
<A HREF="manual.html#lua_WarnFunction">lua_WarnFunction</A><BR>
<A HREF="manual.html#lua_Writer">lua_Writer</A><BR>
<P>
<A HREF="manual.html#lua_absindex">lua_absindex</A><BR>
<A HREF="manual.html#lua_arith">lua_arith</A><BR>
<A HREF="manual.html#lua_atpanic">lua_atpanic</A><BR>
<A HREF="manual.html#lua_call">lua_call</A><BR>
<A HREF="manual.html#lua_callk">lua_callk</A><BR>
<A HREF="manual.html#lua_checkstack">lua_checkstack</A><BR>
<A HREF="manual.html#lua_close">lua_close</A><BR>
<A HREF="manual.html#lua_closeslot">lua_closeslot</A><BR>
<A HREF="manual.html#lua_compare">lua_compare</A><BR>
<A HREF="manual.html#lua_concat">lua_concat</A><BR>
<A HREF="manual.html#lua_copy">lua_copy</A><BR>
<A HREF="manual.html#lua_createtable">lua_createtable</A><BR>
<A HREF="manual.html#lua_dump">lua_dump</A><BR>
<A HREF="manual.html#lua_error">lua_error</A><BR>
<A HREF="manual.html#lua_gc">lua_gc</A><BR>
<A HREF="manual.html#lua_getallocf">lua_getallocf</A><BR>
<A HREF="manual.html#lua_getextraspace">lua_getextraspace</A><BR>
<A HREF="manual.html#lua_getfield">lua_getfield</A><BR>
<A HREF="manual.html#lua_getglobal">lua_getglobal</A><BR>
<A HREF="manual.html#lua_gethook">lua_gethook</A><BR>
<A HREF="manual.html#lua_gethookcount">lua_gethookcount</A><BR>
<A HREF="manual.html#lua_gethookmask">lua_gethookmask</A><BR>
<A HREF="manual.html#lua_geti">lua_geti</A><BR>
<A HREF="manual.html#lua_getinfo">lua_getinfo</A><BR>
<A HREF="manual.html#lua_getiuservalue">lua_getiuservalue</A><BR>
<A HREF="manual.html#lua_getlocal">lua_getlocal</A><BR>
<A HREF="manual.html#lua_getmetatable">lua_getmetatable</A><BR>
<A HREF="manual.html#lua_getstack">lua_getstack</A><BR>
<A HREF="manual.html#lua_gettable">lua_gettable</A><BR>
<A HREF="manual.html#lua_gettop">lua_gettop</A><BR>
<A HREF="manual.html#lua_getupvalue">lua_getupvalue</A><BR>
<A HREF="manual.html#lua_insert">lua_insert</A><BR>
<A HREF="manual.html#lua_isboolean">lua_isboolean</A><BR>
<A HREF="manual.html#lua_iscfunction">lua_iscfunction</A><BR>
<A HREF="manual.html#lua_isfunction">lua_isfunction</A><BR>
<A HREF="manual.html#lua_isinteger">lua_isinteger</A><BR>
<A HREF="manual.html#lua_islightuserdata">lua_islightuserdata</A><BR>
<A HREF="manual.html#lua_isnil">lua_isnil</A><BR>
<A HREF="manual.html#lua_isnone">lua_isnone</A><BR>
<A HREF="manual.html#lua_isnoneornil">lua_isnoneornil</A><BR>
<A HREF="manual.html#lua_isnumber">lua_isnumber</A><BR>
<A HREF="manual.html#lua_isstring">lua_isstring</A><BR>
<A HREF="manual.html#lua_istable">lua_istable</A><BR>
<A HREF="manual.html#lua_isthread">lua_isthread</A><BR>
<A HREF="manual.html#lua_isuserdata">lua_isuserdata</A><BR>
<A HREF="manual.html#lua_isyieldable">lua_isyieldable</A><BR>
<A HREF="manual.html#lua_len">lua_len</A><BR>
<A HREF="manual.html#lua_load">lua_load</A><BR>
<A HREF="manual.html#lua_newstate">lua_newstate</A><BR>
<A HREF="manual.html#lua_newtable">lua_newtable</A><BR>
<A HREF="manual.html#lua_newthread">lua_newthread</A><BR>
<A HREF="manual.html#lua_newuserdatauv">lua_newuserdatauv</A><BR>
<A HREF="manual.html#lua_next">lua_next</A><BR>
<A HREF="manual.html#lua_numbertointeger">lua_numbertointeger</A><BR>
<A HREF="manual.html#lua_pcall">lua_pcall</A><BR>
<A HREF="manual.html#lua_pcallk">lua_pcallk</A><BR>
<A HREF="manual.html#lua_pop">lua_pop</A><BR>
<A HREF="manual.html#lua_pushboolean">lua_pushboolean</A><BR>
<A HREF="manual.html#lua_pushcclosure">lua_pushcclosure</A><BR>
<A HREF="manual.html#lua_pushcfunction">lua_pushcfunction</A><BR>
<A HREF="manual.html#lua_pushfstring">lua_pushfstring</A><BR>
<A HREF="manual.html#lua_pushglobaltable">lua_pushglobaltable</A><BR>
<A HREF="manual.html#lua_pushinteger">lua_pushinteger</A><BR>
<A HREF="manual.html#lua_pushlightuserdata">lua_pushlightuserdata</A><BR>
<A HREF="manual.html#lua_pushliteral">lua_pushliteral</A><BR>
<A HREF="manual.html#lua_pushlstring">lua_pushlstring</A><BR>
<A HREF="manual.html#lua_pushnil">lua_pushnil</A><BR>
<A HREF="manual.html#lua_pushnumber">lua_pushnumber</A><BR>
<A HREF="manual.html#lua_pushstring">lua_pushstring</A><BR>
<A HREF="manual.html#lua_pushthread">lua_pushthread</A><BR>
<A HREF="manual.html#lua_pushvalue">lua_pushvalue</A><BR>
<A HREF="manual.html#lua_pushvfstring">lua_pushvfstring</A><BR>
<A HREF="manual.html#lua_rawequal">lua_rawequal</A><BR>
<A HREF="manual.html#lua_rawget">lua_rawget</A><BR>
<A HREF="manual.html#lua_rawgeti">lua_rawgeti</A><BR>
<A HREF="manual.html#lua_rawgetp">lua_rawgetp</A><BR>
<A HREF="manual.html#lua_rawlen">lua_rawlen</A><BR>
<A HREF="manual.html#lua_rawset">lua_rawset</A><BR>
<A HREF="manual.html#lua_rawseti">lua_rawseti</A><BR>
<A HREF="manual.html#lua_rawsetp">lua_rawsetp</A><BR>
<A HREF="manual.html#lua_register">lua_register</A><BR>
<A HREF="manual.html#lua_remove">lua_remove</A><BR>
<A HREF="manual.html#lua_replace">lua_replace</A><BR>
<A HREF="manual.html#lua_resetthread">lua_resetthread</A><BR>
<A HREF="manual.html#lua_resume">lua_resume</A><BR>
<A HREF="manual.html#lua_rotate">lua_rotate</A><BR>
<A HREF="manual.html#lua_setallocf">lua_setallocf</A><BR>
<A HREF="manual.html#lua_setfield">lua_setfield</A><BR>
<A HREF="manual.html#lua_setglobal">lua_setglobal</A><BR>
<A HREF="manual.html#lua_sethook">lua_sethook</A><BR>
<A HREF="manual.html#lua_seti">lua_seti</A><BR>
<A HREF="manual.html#lua_setiuservalue">lua_setiuservalue</A><BR>
<A HREF="manual.html#lua_setlocal">lua_setlocal</A><BR>
<A HREF="manual.html#lua_setmetatable">lua_setmetatable</A><BR>
<A HREF="manual.html#lua_settable">lua_settable</A><BR>
<A HREF="manual.html#lua_settop">lua_settop</A><BR>
<A HREF="manual.html#lua_setupvalue">lua_setupvalue</A><BR>
<A HREF="manual.html#lua_setwarnf">lua_setwarnf</A><BR>
<A HREF="manual.html#lua_status">lua_status</A><BR>
<A HREF="manual.html#lua_stringtonumber">lua_stringtonumber</A><BR>
<A HREF="manual.html#lua_toboolean">lua_toboolean</A><BR>
<A HREF="manual.html#lua_tocfunction">lua_tocfunction</A><BR>
<A HREF="manual.html#lua_toclose">lua_toclose</A><BR>
<A HREF="manual.html#lua_tointeger">lua_tointeger</A><BR>
<A HREF="manual.html#lua_tointegerx">lua_tointegerx</A><BR>
<A HREF="manual.html#lua_tolstring">lua_tolstring</A><BR>
<A HREF="manual.html#lua_tonumber">lua_tonumber</A><BR>
<A HREF="manual.html#lua_tonumberx">lua_tonumberx</A><BR>
<A HREF="manual.html#lua_topointer">lua_topointer</A><BR>
<A HREF="manual.html#lua_tostring">lua_tostring</A><BR>
<A HREF="manual.html#lua_tothread">lua_tothread</A><BR>
<A HREF="manual.html#lua_touserdata">lua_touserdata</A><BR>
<A HREF="manual.html#lua_type">lua_type</A><BR>
<A HREF="manual.html#lua_typename">lua_typename</A><BR>
<A HREF="manual.html#lua_upvalueid">lua_upvalueid</A><BR>
<A HREF="manual.html#lua_upvalueindex">lua_upvalueindex</A><BR>
<A HREF="manual.html#lua_upvaluejoin">lua_upvaluejoin</A><BR>
<A HREF="manual.html#lua_version">lua_version</A><BR>
<A HREF="manual.html#lua_warning">lua_warning</A><BR>
<A HREF="manual.html#lua_xmove">lua_xmove</A><BR>
<A HREF="manual.html#lua_yield">lua_yield</A><BR>
<A HREF="manual.html#lua_yieldk">lua_yieldk</A><BR>
</TD>
<TD>
<H3><A NAME="auxlib">auxiliary library</A></H3>
<P>
<A HREF="manual.html#luaL_Buffer">luaL_Buffer</A><BR>
<A HREF="manual.html#luaL_Reg">luaL_Reg</A><BR>
<A HREF="manual.html#luaL_Stream">luaL_Stream</A><BR>
<P>
<A HREF="manual.html#luaL_addchar">luaL_addchar</A><BR>
<A HREF="manual.html#luaL_addgsub">luaL_addgsub</A><BR>
<A HREF="manual.html#luaL_addlstring">luaL_addlstring</A><BR>
<A HREF="manual.html#luaL_addsize">luaL_addsize</A><BR>
<A HREF="manual.html#luaL_addstring">luaL_addstring</A><BR>
<A HREF="manual.html#luaL_addvalue">luaL_addvalue</A><BR>
<A HREF="manual.html#luaL_argcheck">luaL_argcheck</A><BR>
<A HREF="manual.html#luaL_argerror">luaL_argerror</A><BR>
<A HREF="manual.html#luaL_argexpected">luaL_argexpected</A><BR>
<A HREF="manual.html#luaL_buffaddr">luaL_buffaddr</A><BR>
<A HREF="manual.html#luaL_buffinit">luaL_buffinit</A><BR>
<A HREF="manual.html#luaL_buffinitsize">luaL_buffinitsize</A><BR>
<A HREF="manual.html#luaL_bufflen">luaL_bufflen</A><BR>
<A HREF="manual.html#luaL_buffsub">luaL_buffsub</A><BR>
<A HREF="manual.html#luaL_callmeta">luaL_callmeta</A><BR>
<A HREF="manual.html#luaL_checkany">luaL_checkany</A><BR>
<A HREF="manual.html#luaL_checkinteger">luaL_checkinteger</A><BR>
<A HREF="manual.html#luaL_checklstring">luaL_checklstring</A><BR>
<A HREF="manual.html#luaL_checknumber">luaL_checknumber</A><BR>
<A HREF="manual.html#luaL_checkoption">luaL_checkoption</A><BR>
<A HREF="manual.html#luaL_checkstack">luaL_checkstack</A><BR>
<A HREF="manual.html#luaL_checkstring">luaL_checkstring</A><BR>
<A HREF="manual.html#luaL_checktype">luaL_checktype</A><BR>
<A HREF="manual.html#luaL_checkudata">luaL_checkudata</A><BR>
<A HREF="manual.html#luaL_checkversion">luaL_checkversion</A><BR>
<A HREF="manual.html#luaL_dofile">luaL_dofile</A><BR>
<A HREF="manual.html#luaL_dostring">luaL_dostring</A><BR>
<A HREF="manual.html#luaL_error">luaL_error</A><BR>
<A HREF="manual.html#luaL_execresult">luaL_execresult</A><BR>
<A HREF="manual.html#luaL_fileresult">luaL_fileresult</A><BR>
<A HREF="manual.html#luaL_getmetafield">luaL_getmetafield</A><BR>
<A HREF="manual.html#luaL_getmetatable">luaL_getmetatable</A><BR>
<A HREF="manual.html#luaL_getsubtable">luaL_getsubtable</A><BR>
<A HREF="manual.html#luaL_gsub">luaL_gsub</A><BR>
<A HREF="manual.html#luaL_len">luaL_len</A><BR>
<A HREF="manual.html#luaL_loadbuffer">luaL_loadbuffer</A><BR>
<A HREF="manual.html#luaL_loadbufferx">luaL_loadbufferx</A><BR>
<A HREF="manual.html#luaL_loadfile">luaL_loadfile</A><BR>
<A HREF="manual.html#luaL_loadfilex">luaL_loadfilex</A><BR>
<A HREF="manual.html#luaL_loadstring">luaL_loadstring</A><BR>
<A HREF="manual.html#luaL_newlib">luaL_newlib</A><BR>
<A HREF="manual.html#luaL_newlibtable">luaL_newlibtable</A><BR>
<A HREF="manual.html#luaL_newmetatable">luaL_newmetatable</A><BR>
<A HREF="manual.html#luaL_newstate">luaL_newstate</A><BR>
<A HREF="manual.html#luaL_openlibs">luaL_openlibs</A><BR>
<A HREF="manual.html#luaL_opt">luaL_opt</A><BR>
<A HREF="manual.html#luaL_optinteger">luaL_optinteger</A><BR>
<A HREF="manual.html#luaL_optlstring">luaL_optlstring</A><BR>
<A HREF="manual.html#luaL_optnumber">luaL_optnumber</A><BR>
<A HREF="manual.html#luaL_optstring">luaL_optstring</A><BR>
<A HREF="manual.html#luaL_prepbuffer">luaL_prepbuffer</A><BR>
<A HREF="manual.html#luaL_prepbuffsize">luaL_prepbuffsize</A><BR>
<A HREF="manual.html#luaL_pushfail">luaL_pushfail</A><BR>
<A HREF="manual.html#luaL_pushresult">luaL_pushresult</A><BR>
<A HREF="manual.html#luaL_pushresultsize">luaL_pushresultsize</A><BR>
<A HREF="manual.html#luaL_ref">luaL_ref</A><BR>
<A HREF="manual.html#luaL_requiref">luaL_requiref</A><BR>
<A HREF="manual.html#luaL_setfuncs">luaL_setfuncs</A><BR>
<A HREF="manual.html#luaL_setmetatable">luaL_setmetatable</A><BR>
<A HREF="manual.html#luaL_testudata">luaL_testudata</A><BR>
<A HREF="manual.html#luaL_tolstring">luaL_tolstring</A><BR>
<A HREF="manual.html#luaL_traceback">luaL_traceback</A><BR>
<A HREF="manual.html#luaL_typeerror">luaL_typeerror</A><BR>
<A HREF="manual.html#luaL_typename">luaL_typename</A><BR>
<A HREF="manual.html#luaL_unref">luaL_unref</A><BR>
<A HREF="manual.html#luaL_where">luaL_where</A><BR>
<H3><A NAME="library">standard library</A></H3>
<P>
<A HREF="manual.html#pdf-luaopen_base">luaopen_base</A><BR>
<A HREF="manual.html#pdf-luaopen_coroutine">luaopen_coroutine</A><BR>
<A HREF="manual.html#pdf-luaopen_debug">luaopen_debug</A><BR>
<A HREF="manual.html#pdf-luaopen_io">luaopen_io</A><BR>
<A HREF="manual.html#pdf-luaopen_math">luaopen_math</A><BR>
<A HREF="manual.html#pdf-luaopen_os">luaopen_os</A><BR>
<A HREF="manual.html#pdf-luaopen_package">luaopen_package</A><BR>
<A HREF="manual.html#pdf-luaopen_string">luaopen_string</A><BR>
<A HREF="manual.html#pdf-luaopen_table">luaopen_table</A><BR>
<A HREF="manual.html#pdf-luaopen_utf8">luaopen_utf8</A><BR>
<H3><A NAME="constants">constants</A></H3>
<P>
<A HREF="manual.html#pdf-LUA_ERRERR">LUA_ERRERR</A><BR>
<A HREF="manual.html#pdf-LUA_ERRFILE">LUA_ERRFILE</A><BR>
<A HREF="manual.html#pdf-LUA_ERRMEM">LUA_ERRMEM</A><BR>
<A HREF="manual.html#pdf-LUA_ERRRUN">LUA_ERRRUN</A><BR>
<A HREF="manual.html#pdf-LUA_ERRSYNTAX">LUA_ERRSYNTAX</A><BR>
<A HREF="manual.html#pdf-LUA_HOOKCALL">LUA_HOOKCALL</A><BR>
<A HREF="manual.html#pdf-LUA_HOOKCOUNT">LUA_HOOKCOUNT</A><BR>
<A HREF="manual.html#pdf-LUA_HOOKLINE">LUA_HOOKLINE</A><BR>
<A HREF="manual.html#pdf-LUA_HOOKRET">LUA_HOOKRET</A><BR>
<A HREF="manual.html#pdf-LUA_HOOKTAILCALL">LUA_HOOKTAILCALL</A><BR>
<A HREF="manual.html#pdf-LUAL_BUFFERSIZE">LUAL_BUFFERSIZE</A><BR>
<A HREF="manual.html#pdf-LUA_MASKCALL">LUA_MASKCALL</A><BR>
<A HREF="manual.html#pdf-LUA_MASKCOUNT">LUA_MASKCOUNT</A><BR>
<A HREF="manual.html#pdf-LUA_MASKLINE">LUA_MASKLINE</A><BR>
<A HREF="manual.html#pdf-LUA_MASKRET">LUA_MASKRET</A><BR>
<A HREF="manual.html#pdf-LUA_MAXINTEGER">LUA_MAXINTEGER</A><BR>
<A HREF="manual.html#pdf-LUA_MININTEGER">LUA_MININTEGER</A><BR>
<A HREF="manual.html#pdf-LUA_MINSTACK">LUA_MINSTACK</A><BR>
<A HREF="manual.html#pdf-LUA_MULTRET">LUA_MULTRET</A><BR>
<A HREF="manual.html#pdf-LUA_NOREF">LUA_NOREF</A><BR>
<A HREF="manual.html#pdf-LUA_OK">LUA_OK</A><BR>
<A HREF="manual.html#pdf-LUA_OPADD">LUA_OPADD</A><BR>
<A HREF="manual.html#pdf-LUA_OPBAND">LUA_OPBAND</A><BR>
<A HREF="manual.html#pdf-LUA_OPBNOT">LUA_OPBNOT</A><BR>
<A HREF="manual.html#pdf-LUA_OPBOR">LUA_OPBOR</A><BR>
<A HREF="manual.html#pdf-LUA_OPBXOR">LUA_OPBXOR</A><BR>
<A HREF="manual.html#pdf-LUA_OPDIV">LUA_OPDIV</A><BR>
<A HREF="manual.html#pdf-LUA_OPEQ">LUA_OPEQ</A><BR>
<A HREF="manual.html#pdf-LUA_OPIDIV">LUA_OPIDIV</A><BR>
<A HREF="manual.html#pdf-LUA_OPLE">LUA_OPLE</A><BR>
<A HREF="manual.html#pdf-LUA_OPLT">LUA_OPLT</A><BR>
<A HREF="manual.html#pdf-LUA_OPMOD">LUA_OPMOD</A><BR>
<A HREF="manual.html#pdf-LUA_OPMUL">LUA_OPMUL</A><BR>
<A HREF="manual.html#pdf-LUA_OPPOW">LUA_OPPOW</A><BR>
<A HREF="manual.html#pdf-LUA_OPSHL">LUA_OPSHL</A><BR>
<A HREF="manual.html#pdf-LUA_OPSHR">LUA_OPSHR</A><BR>
<A HREF="manual.html#pdf-LUA_OPSUB">LUA_OPSUB</A><BR>
<A HREF="manual.html#pdf-LUA_OPUNM">LUA_OPUNM</A><BR>
<A HREF="manual.html#pdf-LUA_REFNIL">LUA_REFNIL</A><BR>
<A HREF="manual.html#pdf-LUA_REGISTRYINDEX">LUA_REGISTRYINDEX</A><BR>
<A HREF="manual.html#pdf-LUA_RIDX_GLOBALS">LUA_RIDX_GLOBALS</A><BR>
<A HREF="manual.html#pdf-LUA_RIDX_MAINTHREAD">LUA_RIDX_MAINTHREAD</A><BR>
<A HREF="manual.html#pdf-LUA_TBOOLEAN">LUA_TBOOLEAN</A><BR>
<A HREF="manual.html#pdf-LUA_TFUNCTION">LUA_TFUNCTION</A><BR>
<A HREF="manual.html#pdf-LUA_TLIGHTUSERDATA">LUA_TLIGHTUSERDATA</A><BR>
<A HREF="manual.html#pdf-LUA_TNIL">LUA_TNIL</A><BR>
<A HREF="manual.html#pdf-LUA_TNONE">LUA_TNONE</A><BR>
<A HREF="manual.html#pdf-LUA_TNUMBER">LUA_TNUMBER</A><BR>
<A HREF="manual.html#pdf-LUA_TSTRING">LUA_TSTRING</A><BR>
<A HREF="manual.html#pdf-LUA_TTABLE">LUA_TTABLE</A><BR>
<A HREF="manual.html#pdf-LUA_TTHREAD">LUA_TTHREAD</A><BR>
<A HREF="manual.html#pdf-LUA_TUSERDATA">LUA_TUSERDATA</A><BR>
<A HREF="manual.html#pdf-LUA_USE_APICHECK">LUA_USE_APICHECK</A><BR>
<A HREF="manual.html#pdf-LUA_YIELD">LUA_YIELD</A><BR>
</TD>
</TR>
</TABLE>
<P CLASS="footer">
Last update:
Wed Mar 3 13:04:44 UTC 2021
</P>
<!--
Last change: revised for Lua 5.4.3
-->
</BODY>
</HTML>
```
|
```objective-c
// This is an open source non-commercial project. Dear PVS-Studio, please check it.
// PVS-Studio Static Code Analyzer for C, C++ and C#: path_to_url
// ******************************************************************
// *
// * This file is part of the Cxbx project.
// *
// * Cxbx and Cxbe are free software; you can redistribute them
// * and/or modify them under the terms of the GNU General Public
// * version 2 of the license, or (at your option) any later version.
// *
// * This program is distributed in the hope that it will be useful,
// * but WITHOUT ANY WARRANTY; without even the implied warranty of
// * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// *
// * along with this program; see the file COPYING.
// * If not, write to the Free Software Foundation, Inc.,
// * 59 Temple Place - Suite 330, Bostom, MA 02111-1307, USA.
// *
// * (c) 2018 Luke Usher <luke.usher@outlook.com>
// *
// * All rights reserved
// *
// ******************************************************************
#ifndef _APU_H_
#define _APU_H_
#include "../PCIDevice.h"
class APUDevice : public PCIDevice {
public:
using PCIDevice::PCIDevice;
// PCI Functions
void Init();
void Reset();
uint32_t IORead(int barIndex, uint32_t addr, unsigned size = sizeof(uint8_t));
void IOWrite(int barIndex, uint32_t addr, uint32_t data, unsigned size = sizeof(uint8_t));
uint32_t MMIORead(int barIndex, uint32_t addr, unsigned size);
void MMIOWrite(int barIndex, uint32_t addr, uint32_t value, unsigned size);
private:
uint32_t GPRead(uint32_t addr, unsigned size);
void GPWrite(uint32_t addr, uint32_t value, unsigned size);
uint32_t EPRead(uint32_t addr, unsigned size);
void EPWrite(uint32_t addr, uint32_t value, unsigned size);
uint32_t VPRead(uint32_t addr, unsigned size);
void VPWrite(uint32_t addr, uint32_t value, unsigned size);
};
#endif
```
|
```python
def binomial_coefficient(n: int, r: int) -> int:
"""
Find binomial coefficient using Pascal's triangle.
Calculate C(n, r) using Pascal's triangle.
:param n: The total number of items.
:param r: The number of items to choose.
:return: The binomial coefficient C(n, r).
>>> binomial_coefficient(10, 5)
252
>>> binomial_coefficient(10, 0)
1
>>> binomial_coefficient(0, 10)
1
>>> binomial_coefficient(10, 10)
1
>>> binomial_coefficient(5, 2)
10
>>> binomial_coefficient(5, 6)
0
>>> binomial_coefficient(3, 5)
0
>>> binomial_coefficient(-2, 3)
Traceback (most recent call last):
...
ValueError: n and r must be non-negative integers
>>> binomial_coefficient(5, -1)
Traceback (most recent call last):
...
ValueError: n and r must be non-negative integers
>>> binomial_coefficient(10.1, 5)
Traceback (most recent call last):
...
TypeError: 'float' object cannot be interpreted as an integer
>>> binomial_coefficient(10, 5.1)
Traceback (most recent call last):
...
TypeError: 'float' object cannot be interpreted as an integer
"""
if n < 0 or r < 0:
raise ValueError("n and r must be non-negative integers")
if 0 in (n, r):
return 1
c = [0 for i in range(r + 1)]
# nc0 = 1
c[0] = 1
for i in range(1, n + 1):
# to compute current row from previous row.
j = min(i, r)
while j > 0:
c[j] += c[j - 1]
j -= 1
return c[r]
if __name__ == "__main__":
from doctest import testmod
testmod()
print(binomial_coefficient(n=10, r=5))
```
|
```go
package credentials
import (
"errors"
"strings"
)
const (
// ErrCredentialsNotFound standardizes the not found error, so every helper returns
// the same message and docker can handle it properly.
errCredentialsNotFoundMessage = "credentials not found in native keychain"
// ErrCredentialsMissingServerURL and ErrCredentialsMissingUsername standardize
// invalid credentials or credentials management operations
errCredentialsMissingServerURLMessage = "no credentials server URL"
errCredentialsMissingUsernameMessage = "no credentials username"
)
// errCredentialsNotFound represents an error
// raised when credentials are not in the store.
type errCredentialsNotFound struct{}
// Error returns the standard error message
// for when the credentials are not in the store.
func (errCredentialsNotFound) Error() string {
return errCredentialsNotFoundMessage
}
// NotFound implements the [ErrNotFound][errdefs.ErrNotFound] interface.
//
// [errdefs.ErrNotFound]: path_to_url#ErrNotFound
func (errCredentialsNotFound) NotFound() {}
// NewErrCredentialsNotFound creates a new error
// for when the credentials are not in the store.
func NewErrCredentialsNotFound() error {
return errCredentialsNotFound{}
}
// IsErrCredentialsNotFound returns true if the error
// was caused by not having a set of credentials in a store.
func IsErrCredentialsNotFound(err error) bool {
var target errCredentialsNotFound
return errors.As(err, &target)
}
// IsErrCredentialsNotFoundMessage returns true if the error
// was caused by not having a set of credentials in a store.
//
// This function helps to check messages returned by an
// external program via its standard output.
func IsErrCredentialsNotFoundMessage(err string) bool {
return strings.TrimSpace(err) == errCredentialsNotFoundMessage
}
// errCredentialsMissingServerURL represents an error raised
// when the credentials object has no server URL or when no
// server URL is provided to a credentials operation requiring
// one.
type errCredentialsMissingServerURL struct{}
func (errCredentialsMissingServerURL) Error() string {
return errCredentialsMissingServerURLMessage
}
// InvalidParameter implements the [ErrInvalidParameter][errdefs.ErrInvalidParameter]
// interface.
//
// [errdefs.ErrInvalidParameter]: path_to_url#ErrInvalidParameter
func (errCredentialsMissingServerURL) InvalidParameter() {}
// errCredentialsMissingUsername represents an error raised
// when the credentials object has no username or when no
// username is provided to a credentials operation requiring
// one.
type errCredentialsMissingUsername struct{}
func (errCredentialsMissingUsername) Error() string {
return errCredentialsMissingUsernameMessage
}
// InvalidParameter implements the [ErrInvalidParameter][errdefs.ErrInvalidParameter]
// interface.
//
// [errdefs.ErrInvalidParameter]: path_to_url#ErrInvalidParameter
func (errCredentialsMissingUsername) InvalidParameter() {}
// NewErrCredentialsMissingServerURL creates a new error for
// errCredentialsMissingServerURL.
func NewErrCredentialsMissingServerURL() error {
return errCredentialsMissingServerURL{}
}
// NewErrCredentialsMissingUsername creates a new error for
// errCredentialsMissingUsername.
func NewErrCredentialsMissingUsername() error {
return errCredentialsMissingUsername{}
}
// IsCredentialsMissingServerURL returns true if the error
// was an errCredentialsMissingServerURL.
func IsCredentialsMissingServerURL(err error) bool {
var target errCredentialsMissingServerURL
return errors.As(err, &target)
}
// IsCredentialsMissingServerURLMessage checks for an
// errCredentialsMissingServerURL in the error message.
func IsCredentialsMissingServerURLMessage(err string) bool {
return strings.TrimSpace(err) == errCredentialsMissingServerURLMessage
}
// IsCredentialsMissingUsername returns true if the error
// was an errCredentialsMissingUsername.
func IsCredentialsMissingUsername(err error) bool {
var target errCredentialsMissingUsername
return errors.As(err, &target)
}
// IsCredentialsMissingUsernameMessage checks for an
// errCredentialsMissingUsername in the error message.
func IsCredentialsMissingUsernameMessage(err string) bool {
return strings.TrimSpace(err) == errCredentialsMissingUsernameMessage
}
```
|
The Theater Center (known as The Snapple Theater Center until 2016) is a multi-theater entertainment complex located on the corner of 50th Street and Broadway in New York City.
History
The complex was built by actress and producer Catherine Russell in partnership with Snapple, marking Off-Broadway's first such corporate sponsorship. It opened as the Snapple Theater Center on May 22, 2006, with Wendy Kaufman, "the Snapple Lady," ceremonially lighting the marquee. Long-running play Perfect Crime (starring Russell) transferred to the Theater Center upon the facility's opening, and a revival of The Fantasticks was mounted that summer. In 2007, the space in which The Fantasticks was performed was named in honor of actor Jerry Orbach, who starred as El Gallo in that show's original production in 1960. In 2012, the other space was named for producer Anne L. Bernstein. The Fantasticks closed in 2017, by which time "Snapple" had been dropped from the building's name. Various other productions came to the Jerry Orbach thereafter. In 2021, Perfect Crime was the first live stage production in New York City to receive approval from Actors' Equity to resume performances after theatres were shuttered due to the COVID-19 pandemic. In January, 2022, thieves stole copper pipes from the building, disabling the plumbing and heating and necessitating the cancellation of twelve performances of Perfect Crime. , Perfect Crime continues its run in the space.
Facilities
It is a state of the art entertainment center consisting of two theaters with a total seating capacity of 398, rehearsal studios, contemporary lobbies, WiFi, two bars with cabaret-style seating and two merchandise stands. There are two stages, the Anne L. Bernstein Theater and the Jerry Orbach Theater.
References
External links
Theatres in Manhattan
Off-Broadway theaters
Theatres completed in 2006
Keurig Dr Pepper
Midtown Manhattan
|
Callitriche truncata, the short leaved water starwort, is a species of plant in the family Plantaginaceae. They have a self-supporting growth form and simple, broad leaves. Individuals can grow to 10 cm tall.
Sources
References
truncata
Flora of Malta
|
```go
/*
path_to_url
Unless required by applicable law or agreed to in writing, software
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package v1
// This file contains a collection of methods that can be used from go-restful to
// generate Swagger API documentation for its models. Please read this PR for more
// information on the implementation: path_to_url
//
// TODOs are ignored from the parser (e.g. TODO(andronat):... || TODO:...) if and only if
// they are on one line! For multiple line or blocks that you want to ignore use ---.
// Any context after a --- is ignored.
//
// Those methods can be generated by using hack/update-generated-swagger-docs.sh
// AUTO-GENERATED FUNCTIONS START HERE
var map_Job = map[string]string{
"": "Job represents the configuration of a single job.",
"metadata": "Standard object's metadata. More info: path_to_url#metadata",
"spec": "Spec is a structure defining the expected behavior of a job. More info: path_to_url#spec-and-status",
"status": "Status is a structure describing current status of a job. More info: path_to_url#spec-and-status",
}
func (Job) SwaggerDoc() map[string]string {
return map_Job
}
var map_JobCondition = map[string]string{
"": "JobCondition describes current state of a job.",
"type": "Type of job condition, Complete or Failed.",
"status": "Status of the condition, one of True, False, Unknown.",
"lastProbeTime": "Last time the condition was checked.",
"lastTransitionTime": "Last time the condition transit from one status to another.",
"reason": "(brief) reason for the condition's last transition.",
"message": "Human readable message indicating details about last transition.",
}
func (JobCondition) SwaggerDoc() map[string]string {
return map_JobCondition
}
var map_JobList = map[string]string{
"": "JobList is a collection of jobs.",
"metadata": "Standard list metadata More info: path_to_url#metadata",
"items": "Items is the list of Job.",
}
func (JobList) SwaggerDoc() map[string]string {
return map_JobList
}
var map_JobSpec = map[string]string{
"": "JobSpec describes how the job execution will look like.",
"parallelism": "Parallelism specifies the maximum desired number of pods the job should run at any given time. The actual number of pods running in steady state will be less than this number when ((.spec.completions - .status.successful) < .spec.parallelism), i.e. when the work left to do is less than max parallelism. More info: path_to_url",
"completions": "Completions specifies the desired number of successfully finished pods the job should be run with. Setting to nil means that the success of any pod signals the success of all pods, and allows parallelism to have any positive value. Setting to 1 means that parallelism is limited to 1 and the success of that pod signals the success of the job. More info: path_to_url",
"activeDeadlineSeconds": "Optional duration in seconds relative to the startTime that the job may be active before the system tries to terminate it; value must be positive integer",
"selector": "Selector is a label query over pods that should match the pod count. Normally, the system sets this field for you. More info: path_to_url#label-selectors",
"manualSelector": "ManualSelector controls generation of pod labels and pod selectors. Leave `manualSelector` unset unless you are certain what you are doing. When false or unset, the system pick labels unique to this job and appends those labels to the pod template. When true, the user is responsible for picking unique labels and specifying the selector. Failure to pick a unique label may cause this and other jobs to not function correctly. However, You may see `manualSelector=true` in jobs that were created with the old `extensions/v1beta1` API. More info: path_to_url",
"template": "Template is the object that describes the pod that will be created when executing a job. More info: path_to_url",
}
func (JobSpec) SwaggerDoc() map[string]string {
return map_JobSpec
}
var map_JobStatus = map[string]string{
"": "JobStatus represents the current state of a Job.",
"conditions": "Conditions represent the latest available observations of an object's current state. More info: path_to_url",
"startTime": "StartTime represents time when the job was acknowledged by the Job Manager. It is not guaranteed to be set in happens-before order across separate operations. It is represented in RFC3339 form and is in UTC.",
"completionTime": "CompletionTime represents time when the job was completed. It is not guaranteed to be set in happens-before order across separate operations. It is represented in RFC3339 form and is in UTC.",
"active": "Active is the number of actively running pods.",
"succeeded": "Succeeded is the number of pods which reached Phase Succeeded.",
"failed": "Failed is the number of pods which reached Phase Failed.",
}
func (JobStatus) SwaggerDoc() map[string]string {
return map_JobStatus
}
var map_LabelSelector = map[string]string{
"": "A label selector is a label query over a set of resources. The result of matchLabels and matchExpressions are ANDed. An empty label selector matches all objects. A null label selector matches no objects.",
"matchLabels": "matchLabels is a map of {key,value} pairs. A single {key,value} in the matchLabels map is equivalent to an element of matchExpressions, whose key field is \"key\", the operator is \"In\", and the values array contains only \"value\". The requirements are ANDed.",
"matchExpressions": "matchExpressions is a list of label selector requirements. The requirements are ANDed.",
}
func (LabelSelector) SwaggerDoc() map[string]string {
return map_LabelSelector
}
var map_LabelSelectorRequirement = map[string]string{
"": "A label selector requirement is a selector that contains values, a key, and an operator that relates the key and values.",
"key": "key is the label key that the selector applies to.",
"operator": "operator represents a key's relationship to a set of values. Valid operators ard In, NotIn, Exists and DoesNotExist.",
"values": "values is an array of string values. If the operator is In or NotIn, the values array must be non-empty. If the operator is Exists or DoesNotExist, the values array must be empty. This array is replaced during a strategic merge patch.",
}
func (LabelSelectorRequirement) SwaggerDoc() map[string]string {
return map_LabelSelectorRequirement
}
// AUTO-GENERATED FUNCTIONS END HERE
```
|
Mark Anthony Williams (born May 17, 1971) is a former professional American football player who played linebacker for three seasons for the Green Bay Packers, the Jacksonville Jaguars, the St. Louis Rams, and the Tampa Bay Buccaneers. He played for four teams in his career. He started for the Jacksonville Jaguars in 1995; starting 12 games before being injured.
References
1971 births
Living people
People from Camp Springs, Maryland
Players of American football from Prince George's County, Maryland
American football linebackers
Green Bay Packers players
Jacksonville Jaguars players
St. Louis Rams players
Ohio State Buckeyes football players
Tampa Bay Buccaneers players
|
```javascript
3e+
```
|
Zharki () is a rural locality (a village) in Golovinskoye Rural Settlement, Sudogodsky District, Vladimir Oblast, Russia. The population was 11 as of 2010.
Geography
Zharki is located on the Vanchuga River, 27 km southwest of Sudogda (the district's administrative centre) by road. Buchkovo is the nearest rural locality.
References
Rural localities in Sudogodsky District
|
Vogel Award may refer to:
The Australian/Vogel Literary Award, for Australian writers under the age of 35
The Sir Julius Vogel Award, for New Zealand science fiction, fantasy, and horror
|
El Cuero is the eponymous debut studio album by Norwegian rock group El Cuero, released on 15 August 2007.
Track listing
All music and lyrics by Brynjar Takle Ohr unless stated otherwise.
Is This Over - 6:58 (Brynjar & Håvard Takle Ohr)
I Hate Myself (For Loving You) - 3:50 (Øyvind Blomstrøm & Brynjar Takle Ohr)
My Roving Eye - 3:58
When I Slip Away - 5:05
Did I Know You - 12:22
Did You See Them - 4:16
Hate Will Get Us Nowhere - 3:34
If You'll Follow - 5:07
Ain't It Hard - 4:20
Little Bird - 7:25
Personnel
El Cuero
Brynjar Takle Ohr - lead vocals, guitars, piano on "When The Lights Go Out"
Tommy Reite - bass guitar
Håvard Takle Ohr - drums, backing vocals
Øyvind Blomstrøm - lead guitars, pedal steel, piano and backing vocals
Additional musicians
Ingrid Olava - vocals on "I Hate Myself (For Loving You)"
Inge Svegge - hammond organ
References
Album liner notes and booklet.
El Cuero albums
2007 albums
|
```c
/*
*
* Public domain.
*/
#include <libgen.h>
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <errno.h>
#include <err.h>
int
main(void)
{
char path[2 * PATH_MAX];
char dname[128];
const char *dir = "junk";
const char *fname = "/file.name.ext";
char *str;
int i;
/* Test normal functioning */
strlcpy(path, "/", sizeof(path));
strlcpy(dname, "/", sizeof(dname));
strlcat(path, dir, sizeof(path));
strlcat(dname, dir, sizeof(dname));
strlcat(path, fname, sizeof(path));
str = dirname(path);
if (strcmp(str, dname) != 0)
errx(1, "0: dirname(%s) = %s != %s", path, str, dname);
/*
* There are four states that require special handling:
*
* 1) path is NULL
* 2) path is the empty string
* 3) path is composed entirely of slashes
* 4) the resulting name is larger than PATH_MAX
*
* The first two cases require that a pointer
* to the string "." be returned.
*
* The third case requires that a pointer
* to the string "/" be returned.
*
* The final case requires that NULL be returned
* and errno * be set to ENAMETOOLONG.
*/
/* Case 1 */
str = dirname(NULL);
if (strcmp(str, ".") != 0)
errx(1, "1: dirname(NULL) = %s != .", str);
/* Case 2 */
strlcpy(path, "", sizeof(path));
str = dirname(path);
if (strcmp(str, ".") != 0)
errx(1, "2: dirname(%s) = %s != .", path, str);
/* Case 3 */
for (i = 0; i < PATH_MAX - 1; i++)
strlcat(path, "/", sizeof(path)); /* path cleared above */
str = dirname(path);
if (strcmp(str, "/") != 0)
errx(1, "3: dirname(%s) = %s != /", path, str);
/* Case 4 */
strlcpy(path, "/", sizeof(path)); /* reset path */
for (i = 0; i <= PATH_MAX; i += strlen(dir))
strlcat(path, dir, sizeof(path));
strlcat(path, fname, sizeof(path));
str = dirname(path);
if (str != NULL)
errx(1, "4: dirname(%s) = %s != NULL", path, str);
if (errno != ENAMETOOLONG)
errx(1, "4: dirname(%s) sets errno to %d", path, errno);
return (0);
}
```
|
```xml
/*
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
import iterFresnelc = require( './index' );
/**
* Returns an iterator protocol-compliant object.
*
* @returns iterator protocol-compliant object
*/
function iterator() {
return {
'next': next
};
}
/**
* Implements the iterator protocol `next` method.
*
* @returns iterator protocol-compliant object
*/
function next() {
return {
'value': true,
'done': false
};
}
// TESTS //
// The function returns an iterator...
{
iterFresnelc( iterator() ); // $ExpectType Iterator
}
// The compiler throws an error if the function is provided a first argument which is not an iterator protocol-compliant object...
{
iterFresnelc( '5' ); // $ExpectError
iterFresnelc( 5 ); // $ExpectError
iterFresnelc( true ); // $ExpectError
iterFresnelc( false ); // $ExpectError
iterFresnelc( null ); // $ExpectError
iterFresnelc( undefined ); // $ExpectError
iterFresnelc( [] ); // $ExpectError
iterFresnelc( {} ); // $ExpectError
iterFresnelc( ( x: number ): number => x ); // $ExpectError
}
// The compiler throws an error if the function is provided insufficient arguments...
{
iterFresnelc(); // $ExpectError
}
```
|
```html
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<meta http-equiv="X-UA-Compatible" content="IE=edge">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
</head>
<body>
<h1>I have a script that redirects</h1>
<script src="/simple-script.js?redirect=%2Funused-javascript.js%3Fgzip%3D1"></script>
<script>
Array.prototype.findIndex = function() {};
</script>
</body>
</html>
```
|
Thomas Somers-Cocks (5 February 1815 – 30 August 1899) was a British Conservative Party politician and a banker. He was a founding member of the Canterbury Association.
Early life
Cocks was born at Thames Bank, Marlow, Buckinghamshire. His parents were Thomas Somers-Cocks (b.1769), a banker of Thames Bank, and Agneta Pole-Carew, 5th daughter of Sir Reginald Pole-Carew and sister of William Pole-Carew. Lord Somers as head of the family was chosen as his godfather. His father's oldest sister, Mrs Vernon, became his godmother. He received his education at Christ Church, Oxford, but did not obtain a degree.
Cocks became engaged to Sarah Louisa Wynne just before he turned 27. They married on 24 May 1842. She was the daughter of Charles Griffith-Wynne and the sister of Charlotte Griffith Wynne, who married John Robert Godley.
They had three children: Thomas Somers Vernon (1850–1932), Alfred Heneage (1851 – ca 1930/31) and Alice Agneta (1853–1899).
Canterbury Association
He attended the inaugural meeting of the Canterbury Association on 27 Mar 1848, joined the management committee and became the banker for the group.
Politics
Somers-Cocks was elected at the 1847 general election as the Member of Parliament (MP) for borough of Reigate in Surrey. He was re-elected in 1852,
and held the seat until he stood down at the 1857 general election.
Death and commemoration
His wife died in the 1894 influenza epidemic. Cocks died on 30 August 1899 at Thames Bank, Great Marlow. Somers Place in the Christchurch (New Zealand) suburb of Spreydon is named after him. Mount Somers / Te Kiekie, a mountain in the foothills of the Southern Alps, was named after him. Subsequently, the name Mount Somers was used for a nearby village and a railway branch line.
Notes
References
External links
Family tree
1815 births
1899 deaths
Members of the Canterbury Association
Conservative Party (UK) MPs for English constituencies
UK MPs 1847–1852
UK MPs 1852–1857
Alumni of Christ Church, Oxford
People from Marlow, Buckinghamshire
|
```yaml
wallet:
relays:
- - host: relays.cardano-testnet.iohkdev.io
valency: 1
fallbacks: 7
```
|
```javascript
(function (factory) {
if (typeof define === 'function' && define.amd) {
define(['jquery'], factory);
} else if (typeof module === 'object' && typeof module.exports === 'object') {
factory(require('jquery'));
} else {
factory(jQuery);
}
}(function (jQuery) {
// Urdu
jQuery.timeago.settings.strings = {
prefixAgo: null,
prefixFromNow: null,
suffixAgo: "",
suffixFromNow: " ",
seconds: " ",
minute: " ",
minutes: "%d ",
hour: " ",
hours: " %d ",
day: " ",
days: "%d ",
month: " ",
months: "%d ",
year: " ",
years: "%d ",
wordSeparator: " ",
numbers: []
};
}));
```
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.