text
stringlengths 1
22.8M
|
|---|
```c++
/*
[auto_generated]
boost/numeric/odeint/stepper/detail/adams_bashforth_coefficients.hpp
[begin_description]
Definition of the coefficients for the Adams-Bashforth method.
[end_description]
(See accompanying file LICENSE_1_0.txt or
copy at path_to_url
*/
#ifndef your_sha256_hash_HPP_INCLUDED
#define your_sha256_hash_HPP_INCLUDED
#include <boost/array.hpp>
namespace boost {
namespace numeric {
namespace odeint {
namespace detail {
template< class Value , size_t Steps >
class adams_bashforth_coefficients ;
template< class Value >
class adams_bashforth_coefficients< Value , 1 > : public boost::array< Value , 1 >
{
public:
adams_bashforth_coefficients( void )
: boost::array< Value , 1 >()
{
(*this)[0] = static_cast< Value >( 1 );
}
};
template< class Value >
class adams_bashforth_coefficients< Value , 2 > : public boost::array< Value , 2 >
{
public:
adams_bashforth_coefficients( void )
: boost::array< Value , 2 >()
{
(*this)[0] = static_cast< Value >( 3 ) / static_cast< Value >( 2 );
(*this)[1] = -static_cast< Value >( 1 ) / static_cast< Value >( 2 );
}
};
template< class Value >
class adams_bashforth_coefficients< Value , 3 > : public boost::array< Value , 3 >
{
public:
adams_bashforth_coefficients( void )
: boost::array< Value , 3 >()
{
(*this)[0] = static_cast< Value >( 23 ) / static_cast< Value >( 12 );
(*this)[1] = -static_cast< Value >( 4 ) / static_cast< Value >( 3 );
(*this)[2] = static_cast< Value >( 5 ) / static_cast< Value >( 12 );
}
};
template< class Value >
class adams_bashforth_coefficients< Value , 4 > : public boost::array< Value , 4 >
{
public:
adams_bashforth_coefficients( void )
: boost::array< Value , 4 >()
{
(*this)[0] = static_cast< Value >( 55 ) / static_cast< Value >( 24 );
(*this)[1] = -static_cast< Value >( 59 ) / static_cast< Value >( 24 );
(*this)[2] = static_cast< Value >( 37 ) / static_cast< Value >( 24 );
(*this)[3] = -static_cast< Value >( 3 ) / static_cast< Value >( 8 );
}
};
template< class Value >
class adams_bashforth_coefficients< Value , 5 > : public boost::array< Value , 5 >
{
public:
adams_bashforth_coefficients( void )
: boost::array< Value , 5 >()
{
(*this)[0] = static_cast< Value >( 1901 ) / static_cast< Value >( 720 );
(*this)[1] = -static_cast< Value >( 1387 ) / static_cast< Value >( 360 );
(*this)[2] = static_cast< Value >( 109 ) / static_cast< Value >( 30 );
(*this)[3] = -static_cast< Value >( 637 ) / static_cast< Value >( 360 );
(*this)[4] = static_cast< Value >( 251 ) / static_cast< Value >( 720 );
}
};
template< class Value >
class adams_bashforth_coefficients< Value , 6 > : public boost::array< Value , 6 >
{
public:
adams_bashforth_coefficients( void )
: boost::array< Value , 6 >()
{
(*this)[0] = static_cast< Value >( 4277 ) / static_cast< Value >( 1440 );
(*this)[1] = -static_cast< Value >( 2641 ) / static_cast< Value >( 480 );
(*this)[2] = static_cast< Value >( 4991 ) / static_cast< Value >( 720 );
(*this)[3] = -static_cast< Value >( 3649 ) / static_cast< Value >( 720 );
(*this)[4] = static_cast< Value >( 959 ) / static_cast< Value >( 480 );
(*this)[5] = -static_cast< Value >( 95 ) / static_cast< Value >( 288 );
}
};
template< class Value >
class adams_bashforth_coefficients< Value , 7 > : public boost::array< Value , 7 >
{
public:
adams_bashforth_coefficients( void )
: boost::array< Value , 7 >()
{
(*this)[0] = static_cast< Value >( 198721 ) / static_cast< Value >( 60480 );
(*this)[1] = -static_cast< Value >( 18637 ) / static_cast< Value >( 2520 );
(*this)[2] = static_cast< Value >( 235183 ) / static_cast< Value >( 20160 );
(*this)[3] = -static_cast< Value >( 10754 ) / static_cast< Value >( 945 );
(*this)[4] = static_cast< Value >( 135713 ) / static_cast< Value >( 20160 );
(*this)[5] = -static_cast< Value >( 5603 ) / static_cast< Value >( 2520 );
(*this)[6] = static_cast< Value >( 19087 ) / static_cast< Value >( 60480 );
}
};
template< class Value >
class adams_bashforth_coefficients< Value , 8 > : public boost::array< Value , 8 >
{
public:
adams_bashforth_coefficients( void )
: boost::array< Value , 8 >()
{
(*this)[0] = static_cast< Value >( 16083 ) / static_cast< Value >( 4480 );
(*this)[1] = -static_cast< Value >( 1152169 ) / static_cast< Value >( 120960 );
(*this)[2] = static_cast< Value >( 242653 ) / static_cast< Value >( 13440 );
(*this)[3] = -static_cast< Value >( 296053 ) / static_cast< Value >( 13440 );
(*this)[4] = static_cast< Value >( 2102243 ) / static_cast< Value >( 120960 );
(*this)[5] = -static_cast< Value >( 115747 ) / static_cast< Value >( 13440 );
(*this)[6] = static_cast< Value >( 32863 ) / static_cast< Value >( 13440 );
(*this)[7] = -static_cast< Value >( 5257 ) / static_cast< Value >( 17280 );
}
};
} // detail
} // odeint
} // numeric
} // boost
#endif // your_sha256_hash_HPP_INCLUDED
```
|
```javascript
/*
Use of this source code is governed by an MIT-style
license that can be found in the LICENSE file or at
path_to_url
*/
const del = require('del');
const execa = require('execa');
const fse = require('fs-extra');
const globby = require('globby');
const ol = require('common-tags').oneLine;
const olt = require('common-tags').oneLineTrim;
const tempy = require('tempy');
const upath = require('upath');
const logHelper = require('../infra/utils/log-helper');
const DEMOS_DIR = 'demos/src';
async function publish_glitch() {
const glitchProjects = await globby('*', {cwd: DEMOS_DIR, onlyFiles: false});
if (!process.env.GLITCH_PERSONAL_TOKEN) {
throw new Error(ol`You must set a GLITCH_TOKEN in your environment to
publish to Glitch (you must have owner or editor access for the
demo associated with the token).`);
}
if (!process.env.GLITCH_WORKBOX_SECRET) {
throw new Error(ol`You must set the correct GLITCH_SECRET in your
environment to publish to Workbox Demos on Glitch.`);
}
for (const project of glitchProjects) {
const projectURL = olt`path_to_url{process.env.GLITCH_PERSONAL_TOKEN}
@api.glitch.com/git/${project}`;
const projectPath = tempy.directory();
try {
await execa('git', ['clone', projectURL, projectPath]);
await fse.copy(upath.join(DEMOS_DIR, project), projectPath, {
overwrite: true,
});
await execa('git', ['checkout', '-b', 'glitch'], {cwd: projectPath});
await execa('git', ['add', '-A'], {cwd: projectPath});
await execa('git', ['commit', `-m'Autocommit on ${new Date()}'`], {
cwd: projectPath,
});
await execa(
'git',
['push', 'origin', 'glitch', '-f', '--set-upstream', '--no-verify'],
{cwd: projectPath},
);
const deployURL = new URL(`path_to_url{project}.glitch.me/deploy`);
deployURL.searchParams.set('secret', process.env.GLITCH_WORKBOX_SECRET);
deployURL.searchParams.set(
'repo',
`path_to_url{project}`,
);
await execa('curl', ['-X', 'POST', deployURL.href]);
} catch (error) {
logHelper.error(`'${error}' occurred while processing ${project}.`);
}
await del(projectPath, {force: true});
}
}
module.exports = {
publish_glitch,
};
```
|
```c++
#include <iostream>
#include <tfhe_io.h>
#include <map>
#include <string>
#include <cstdint>
#include <cinttypes>
#include <tfhe_generic_streams.h>
#include <cstdlib>
using namespace std;
/**
* implementation of a property map (backed by a map of strings)
*/
class MapTextModeProperties : public TextModeProperties {
map<string, string> data;
string title;
public:
MapTextModeProperties() {}
virtual const std::string &getTypeTitle() const {
return title;
}
virtual const std::string &getProperty(const std::string &name) const {
return data.at(name);
}
virtual void setTypeTitle(const std::string &title) {
this->title = title;
}
virtual void setProperty(const std::string &name, const std::string &value) {
data[name] = value;
}
virtual double getProperty_double(const std::string &name) const {
return stold(getProperty(name));
}
virtual int64_t getProperty_int64_t(const std::string &name) const {
return stol(getProperty(name));
}
virtual void setProperty_double(const std::string &name, double value) {
char buf[64];
sprintf(buf, "%.8lf", value);
setProperty(name, buf);
}
virtual void setProperty_int64_t(const std::string &name, int64_t value) {
char buf[64];
sprintf(buf, "%10" PRId64, value);
setProperty(name, buf);
}
const map<string, string> &getMap() const {
return data;
}
virtual ~MapTextModeProperties() {}
};
void StdIstream::getLine(string &reps) const { std::getline(in, reps); }
void StdIstream::fread(void *data, size_t bytes) const { in.read((char *) data, bytes); }
bool StdIstream::feof() const { return !((bool) in); }
void CIstream::getLine(string &reps) const {
reps.clear();
for (int32_t c = fgetc(F); c != EOF; c = fgetc(F)) {
if (c == '\r') continue;
if (c == '\n') return;
reps.push_back(c);
}
}
void CIstream::fread(void *data, size_t bytes) const {
size_t read = std::fread(data, 1, bytes, F);
if (read != bytes) abort();
}
bool CIstream::feof() const { return std::feof(F); }
void StdOstream::fputs(const string &s) const { out << s; }
void StdOstream::fwrite(const void *data, size_t bytes) const { out.write((char *) data, bytes); }
void COstream::fputs(const string &s) const {
std::fputs(s.c_str(), F);
}
void COstream::fwrite(const void *data, size_t bytes) const { std::fwrite(data, 1, bytes, F); }
CIstream to_Istream(FILE *F) { return CIstream(F); }
StdIstream to_Istream(std::istream &in) { return StdIstream(in); }
COstream to_Ostream(FILE *F) { return COstream(F); }
StdOstream to_Ostream(std::ostream &out) { return StdOstream(out); }
/**
* This function parses a file, and returns its content as a
* new TextModeProperty instance.
* The instance must be subsequently destroyed with delete_TextModeProperties
*
* The format of the serialized data looks like:
* -----BEGIN LWEPARAMS-----
* alpha_max: 0.30000000
* alpha_min: 0.10000000
* n: 500
* -----END LWEPARAMS-----
*/
TextModeProperties *new_TextModeProperties_fromIstream(const Istream &F) {
MapTextModeProperties *reps = new MapTextModeProperties();
string line;
string endDelimitor;
bool content_started = false;
for (F.getLine(line); !F.feof(); F.getLine(line)) {
int32_t n = line.length();
if (!line.compare(0, 11, "-----BEGIN ") && !line.compare(n - 5, 5, "-----")) {
string titleType = line.substr(11, n - 16);
reps->setTypeTitle(titleType);
endDelimitor = string("-----END ") + titleType + string("-----");
content_started = true;
//cerr << "Object: " << titleType << endl;
continue;
}
if (!content_started) {
cerr << "ignoring: " << line << endl;
continue;
} //ignore anything before body
if (line == endDelimitor) {
//cerr << "EndObject: " << reps->getTypeTitle() << endl;
return reps;
}
size_t pos = line.find(": ");
if (pos == string::npos) {
cerr << "ignoring: " << line << endl;
continue;
}
string name = line.substr(0, pos);
string value = line.substr(pos + 2);
//cerr << "prop: " << name << "->" << value << endl;
reps->setProperty(name, value);
}
//cerr << "error reading text object" << endl;
return NULL;
}
/**
* This serializes a TextModeProperty instance.
*
* The format of the serialized data looks like:
* -----BEGIN LWEPARAMS-----
* alpha_max: 0.30000000
* alpha_min: 0.10000000
* n: 500
* -----END LWEPARAMS-----
*/
void print_TextModeProperties_toOStream(const Ostream &F, const TextModeProperties *properties) {
const MapTextModeProperties *props = (const MapTextModeProperties *) properties;
F.fputs(string("-----BEGIN ") + props->getTypeTitle() + string("-----\n"));
for (auto it: props->getMap()) {
F.fputs(it.first + string(": ") + it.second + "\n");
}
F.fputs(string("-----END ") + props->getTypeTitle() + string("-----\n"));
}
TextModeProperties *new_TextModeProperties_blank() {
return new MapTextModeProperties();
}
void delete_TextModeProperties(TextModeProperties *ptr) {
delete ptr;
}
```
|
Laurent Joly (born 26 July 1976) is a French historian and a specialist of Vichy France and antisemitism.
Life and career
Born in 1976, Joly earned a doctorate in history at the Pantheon-Sorbonne University, following a thesis on "Vichy and the Commissariat-General for Jewish Affairs (1941-1944)". He joined the CNRS in 2006, and was a member of the Research Center for Quantitative History until January 2015.
Joly is now a Research Director at the CNRS. He earned the "prize of the Jewish research book" in 2007.
Works
Xavier Vallat (1891-1972) : du nationalisme chrétien à l'antisémitisme d'État. Grasset, 2001. ().
Darquier de Pellepoix et l'antisémitisme français. Berg international, 2002. ().
Vichy dans la « Solution finale » : histoire du Commissariat général aux questions juives (1941-1944). Grasset, 2006. ()
La France antijuive de 1936 : l'agression de Léon Blum à la Chambre des députés. (with Tal Bruttmann) Éditions des Équateurs, 2006. ()
L'Antisémitisme de bureau : enquête au cœur de la Préfecture de police de Paris et du Commissariat général aux questions juives (1940-1944). Grasset, 2011. ()
Les collabos : treize portraits d'après les archives des services secrets de Vichy, des RG et de l'Épuration. Les Échappés, 2011 ()
Naissance de l'Action française : Maurice Barrès, Charles Maurras et l'extrême droite nationaliste au tournant du XXe siècle. Grasset, 2015. ()
Dénoncer les Juifs sous l'Occupation : Paris, 1940-1944. CNRS Éditions, 2017. ()
L'État contre les juifs : Vichy, les nazis et la persécution antisémite. Grasset, 2018. ()
La falsification de l'Histoire: Eric Zemmour, l'extrême droite, Vichy et les juifs. Grasset, 2022. ()
References
Living people
1976 births
21st-century French historians
Academics and writers on far-right extremism
French National Centre for Scientific Research scientists
University of Paris alumni
Place of birth missing (living people)
Historians of Vichy France
Historians of France
Historians of fascism
Historians of the Holocaust
Research directors of the French National Centre for Scientific Research
|
```smalltalk
namespace Veldrid.MetalBindings
{
public enum MTLSamplerAddressMode
{
ClampToEdge = 0,
MirrorClampToEdge = 1,
Repeat = 2,
MirrorRepeat = 3,
ClampToZero = 4,
ClampToBorderColor = 5,
}
}
```
|
Jet lag is a physiological syndrome.
Jet Lag may also refer to:
Music
Jetlag (band), American band
Jet Lag (Premiata Forneria Marconi album), 1977
Jet Lag (Josiah Wolf album), 2010
Jet Lag (Milosh album)
"Jet Lag" (song), a 2011 song by Simple Plan
"Jet Lag", a 1974 song by Nazareth, from the album Rampant
"Jet Lag", a 2004 song by Joss Stone, from the album Mind Body & Soul
"Jet Lag", a 2008 song by Frank Turner, from the album Love Ire & Song
"Jet Lag", a 2002 song by Brendan Benson, from the album Lapalco
Other
Jet Lag (film), a 2002 film starring Juliette Binoche and Jean Reno
Jet Lag: The Game, a travel competition show
Jetlag Productions, an American animation studio
See also
Cultural jet lag, cultural disconnection syndrome
"Jet Lagged", a 1981 song by Smokie
JETLAG gene, a gene found in some organisms
|
Brazil has a multi-party system since 1979, when the country's military dictatorship disbanded an enforced two-party system and allowed the creation of multiple parties.
Above the broad range of political parties in Brazilian Congress, the Workers' Party (PT), the Brazilian Democratic Movement (MDB), the Liberal Party (PL), the Progressives (PP) and the Brazil Union (UNIÃO) together control the absolute majority of seats in the Senate and Chamber of Deputies. Smaller parties often make alliances with at least one of these five major parties. The number of political parties reached 35 on its apex on 2018. However, an electoral threshold introduced on 2017 has resulted in the culling and merger of many parties, as it cuts access to party subsidies and free party political broadcasts.
Brazilian parties have access to party subsidies in form of the Fundo Partidário () and the Fundo Eleitoral () for elections. And a system of free party political broadcasts during election time known as the horário eleitoral gratuito.
Since 1982, Brazilian political parties have been given an electoral number to make it easier for illiterate people to vote. Initially, it was a one-digit number: 1 for PDS, 2 for PDT, 3 for PT, 4 for PTB, and 5 for PMDB. When it became clear that there was going to be more than nine parties, two-digit numbers were assigned, with the first five parties having a "1" added to their former one-digit number (PDS becoming number 11, PDT 12, PT 13, PTB 14, and PMDB 15). Political parties often change their names; however, they can retain their number.
Active political parties
The 30 political parties registered with the Superior Electoral Court (TSE) are listed below by its number of affiliates.
However, some parties are in the process of incorporation, merger or renaming pending validation by the TSE:
The Brazilian Labour Party (PTB) and Patriota, who are in the midst of merging to form Mais Brasil;
The National Mobilization Party (PMN), who intends to remove the term "Party" from its name and change its name to MOBILIZA.
Notes
Unregistered parties
Parties not registered with the Superior Electoral Court:
Historical parties
Imperial Brazil (1822–1889)
First Republic and Vargas Era (1889–1945)
Fourth Republic (1945–1964)
Bipartisanship in Brazil (1966–1979)
Return of the multiparty system (1979–present)
See also
References
Lists of political parties; categories by country and ideology.
Liberalism in Brazil
Brazil
Political parties
Political parties
Brazil
|
"I Like That" is a single by Canadian music producer Richard Vission and American music producer Static Revenger, starring English singer Luciana. The two producers and the singer co-wrote the song with Nick Clow.
"I Like That" was a chart success in Australia and New Zealand, peaking at number three on the Australian Singles Chart and number 19 on the New Zealand Singles Chart. It is certified double platinum in Australia. The song also found popularity in North America, topping the US Billboard Dance Club Songs chart and peaking at number 86 on the Canadian Hot 100.
Charts
Weekly charts
Year-end charts
Certifications
In popular culture
"I Like That" was featured in Step Up 3D (2010) and The Darkest Hour (2011).
See also
List of number-one dance singles of 2010 (U.S.)
References
2009 singles
Songs written by Luciana Caporaso
Songs written by Nick Clow
|
```c++
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// path_to_url
#include <boost/vmd/seq/to_array.hpp>
#include <boost/vmd/is_empty_array.hpp>
#include <boost/detail/lightweight_test.hpp>
#include <boost/preprocessor/array/elem.hpp>
int main()
{
#if BOOST_PP_VARIADICS
#define A_SEQ (1)(2)(3)(4)
#define AN_EMPTY_SEQ
BOOST_TEST_EQ(BOOST_PP_ARRAY_ELEM(2,BOOST_VMD_SEQ_TO_ARRAY(A_SEQ)),3);
BOOST_TEST(BOOST_VMD_IS_EMPTY_ARRAY(BOOST_VMD_SEQ_TO_ARRAY(AN_EMPTY_SEQ)));
#else
BOOST_ERROR("No variadic macro support");
#endif
return boost::report_errors();
}
```
|
```xml
<?xml version="1.0" encoding="utf-8"?>
<androidx.constraintlayout.widget.ConstraintLayout xmlns:android="path_to_url"
xmlns:app="path_to_url"
android:layout_width="match_parent"
android:layout_height="@dimen/d64_size"
android:background="?attr/background_list">
<androidx.appcompat.widget.AppCompatImageView
android:id="@+id/iv_folder"
android:layout_width="@dimen/d40_size"
android:layout_height="@dimen/d40_size"
android:layout_margin="@dimen/d15_size"
android:scaleType="center"
android:src="@drawable/icon_folder"
app:layout_constraintBottom_toBottomOf="parent"
app:layout_constraintStart_toStartOf="parent"
app:layout_constraintTop_toTopOf="parent"
app:tint="?attr/icon_color" />
<TextView
android:id="@+id/tv_name"
android:layout_width="0dp"
android:layout_height="wrap_content"
android:layout_marginStart="@dimen/d12_size"
android:layout_marginEnd="@dimen/d12_size"
android:layout_marginBottom="2dp"
android:ellipsize="end"
android:gravity="start|center_vertical"
android:lines="1"
android:textColor="?attr/text_color_primary"
android:textSize="@dimen/s14_size"
app:layout_constraintBottom_toTopOf="@id/tv_path"
app:layout_constraintEnd_toStartOf="@id/item_button"
app:layout_constraintStart_toEndOf="@id/iv_folder"
app:layout_constraintTop_toTopOf="parent"
app:layout_constraintVertical_chainStyle="packed" />
<TextView
android:id="@+id/tv_path"
android:layout_width="0dp"
android:layout_height="wrap_content"
android:layout_marginTop="@dimen/d4_size"
android:ellipsize="end"
android:gravity="start|center_vertical"
android:lines="1"
android:textColor="?attr/text_color_secondary"
android:textSize="@dimen/s12_size"
app:layout_constraintBottom_toBottomOf="parent"
app:layout_constraintLeft_toLeftOf="@id/tv_name"
app:layout_constraintRight_toRightOf="@id/tv_name"
app:layout_constraintTop_toBottomOf="@id/tv_name" />
<ImageButton
android:id="@+id/item_button"
android:layout_width="@dimen/d48_size"
android:layout_height="@dimen/d48_size"
android:layout_marginEnd="@dimen/d4_size"
android:background="?attr/background_oval_ripple"
android:src="@drawable/icon_player_more"
app:layout_constraintBottom_toBottomOf="parent"
app:layout_constraintRight_toRightOf="parent"
app:layout_constraintTop_toTopOf="parent" />
</androidx.constraintlayout.widget.ConstraintLayout>
```
|
```sqlpl
CREATE TABLESPACE orait DATAFILE '/u01/app/oracle/oradata/XE/orait.dbf' SIZE 50M EXTENT MANAGEMENT LOCAL AUTOALLOCATE;
CREATE TEMPORARY TABLESPACE oraittmp TEMPFILE '/u01/app/oracle/oradata/XE/oraittmp.dbf' SIZE 20M REUSE EXTENT MANAGEMENT LOCAL UNIFORM SIZE 16M;
CREATE USER orait IDENTIFIED BY orait123 DEFAULT TABLESPACE orait QUOTA 100M ON orait TEMPORARY TABLESPACE oraittmp;
GRANT CREATE SESSION TO orait;
GRANT CREATE TABLE TO orait;
CREATE TABLE orait.test (id NUMBER(3,0) PRIMARY KEY, name VARCHAR2(15));
COMMENT on COLUMN orait.test.name IS 'the name';
```
|
Lord Forbes was launched at Chester in 1803 as a West Indiaman. She soon became an "armed defense ship", but by 1805 had returned to being a West Indiaman. She made two voyages as an "extra" ship for the British East India Company (EIC). She continued trading with India until 1817 when she sustained damage on her way to Bengal. There she was surveyed, condemned and sold.
Career
Lord Forbes was launched in 1803. She appeared in Lloyd's Register for 1803 with Moundson, master, W. Forbes, owner, and trade Liverpool–Madeira.
Following the resumption of war with France in early 1803, concern developed in Britain about Napoleon's planned invasion of the United Kingdom. The British government's response took many forms including the reactivation of Fencible regiments and the Sea Fencibles, a program of the construction of Martello Towers along the coasts of Britain and Ireland, and the commissioning of a number of armed defense ships.
The British East India Company in November voted to underwrite 10,000 tons (bm) of armed transports to protect Great Britain's coasts. The vessels were existing, but not EIC, merchantmen that would receive an upgrade in armament and that would receive a naval officer as captain. One of the vessels was Lord Forbes; the others were Albion, , , Aurora, , Diadem, , Helder, , Lord Nelson, , , , , Sir Alexander Mitchell, , and Triton.
On 21 November 1803 Lord Forbes, of 548 tons (bm) and 20 guns, was reported to have been appointed to the Glasgow station. Around late 1804 or 1805 the Navy returned the armed defense ships to their owners.
Lord Forbes returned to the West Indies trade. On 11 March 1805 the sloop-of-war sprang a leak and foundered in the Atlantic Ocean off the Outer Hebrides while escorting a convoy from Jamaica to London. Lord Forbes and other ships rescued her crew.
On 14 July 1805, Lord Forbes, Lutwick Affleck, master, arrived at Cork from Liverpool. After he left Cork Junos underwriters in London presented Captain Affleck with a bowl inscribed with the major facts of the engagement. The Liverpool Committee of Underwriters presented him with a bill of exchange drawn on London for £120 for the purchase of piece of plate. Affleck, when captain of , of eighteen 6-pounder guns and 44 men, had resisted , of twenty-two 24-pounder and twelve 9-pounder guns, and 390 men in a notable action before surrendering to her.
The Register of Shipping for 1806 showed Lord Forbes with M. Sisk, master, Donaldson, owner, and trade London–Jamaica. Captain Matthias Lisk acquired a letter of marque on 25 November 1805.
On 18 May 1807 Lord Forbes, Sisk, master, had to put back to Port Royal. She had struck the ground while leaving from Port Antonio while sailing to London.
On 9 November 1810 the EIC accepted a tender for Lord Forbes for one voyage at £33 8s per ton. The EIC had Tebbutt measure and survey her. The Register of Shipping for 1811 showed Lord Forbess master changing from M. Sisk to L. Edward, her owner from Donaldson to Card, and her trade from London–Jamaica to London–India. Captain Lewis Owen Edwards's date of appointment was 11 December 1810.
1st EIC voyage (1811–1812): Captain Edwards acquired a letter of marque on 4 May 1811. He sailed from Portsmouth on 21 June 1811, bound for Bengal. Lord Forbes was at Madeira on 2 July. She and the other Indiamen (Minerva, , , and left on 5 July under escort by . Lord Forbes arrived at Calcutta on 6 November. Homeward bound, she was at Saugor on 26 February 1812, reached St Helena on 1 July, and arrived at Long Reach on 18 September.
The EIC accepted on 2 December 1812 a tender for Lord Forbes for a second voyage at a rate of £27 8s per ton.
2nd EIC voyage (1813–1814): Captain Edwards sailed from Portsmouth on 22 May 1813, bound for Bengal. Lord Forbes was at Madeira on 2 June and arrived at Calcutta on 19 November. She was at Saugor on 13 February 1814 and reached Bombay on 25 March. Homeward bound, she was at Tellicherry on 24 April, reached St Helena on 7 July, and arrived at The Downs on 22 September.
The EIC lost its monopoly on the trade between Britain and India in 1814. Thereafter the owners of merchant vessels such as Lord Forbes proceeded to engage in private trade with India under a license from the EIC.
The Register of Shipping for 1816 showed Lord Forbess master changing from Beatson to Wiseman. Lord Forbes, Captain Wiseman, sailed from England on 2 September 1816 bound for Bengal.
Fate
Lord Forbes arrived at Bengal on 22 February 1817 much damaged, having grounded on her way. On 2 April she was in dock undergoing repair. She was condemned and sold in Bengal in May.
Citations
References
1803 ships
Age of Sail merchant ships of England
Maritime incidents in 1805
Ships of the British East India Company
Maritime incidents in 1817
|
```objective-c
/*
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*/
#pragma once
#include "Util.h"
#include <map>
#include <memory>
#include <string>
#include <unordered_map>
class MappedFile;
/**
* [Header]
* uint32_t number of dexes (D)
* uint32_t dex_identifiers_offset
* [DexInfo] [0]
* uint32_t size of FieldOffsets table for this dex
* uint32_t start offset of FieldOffsets table for this dex
* ...
* [DexInfo] [D]
* [FieldOffsets] [0]
* uint16_t[0]
* ...
* uint16_t[F_0]
* ...
* [FieldOffsets] [D]
* uint16_t[0]
* ...
* uint16_t[F_D]
* [DexIdentifier] [0]
* uint32_t length of location (L)
* char[L] non zero terminated string with Canary class name for that dex
* [DexIdentifier] [D]
*/
class QuickData {
UNCOPYABLE(QuickData);
public:
// Read Mode
explicit QuickData(const char* location);
// Write Mode
QuickData() = default;
void add_field_offset(const std::string& dex,
const uint32_t field_idx,
const uint16_t offset);
uint16_t get_field_offset(const std::string& dex,
const uint32_t field_idx) const;
void serialize(const std::shared_ptr<FILE*>& fd);
private:
std::map<std::string, uint32_t> dex_to_field_offset_size;
std::unordered_map<std::string, std::unordered_map<uint32_t, uint16_t>>
dex_to_field_idx_to_offset;
struct Header {
uint32_t dexes_num;
uint32_t dex_identifiers_offset;
};
struct DexInfo {
uint32_t field_offsets_size;
uint32_t field_offsets_off;
};
void load_data(const char* location);
};
```
|
The following is a list of episodes of Wait Wait... Don't Tell Me!, NPR's news panel game, that aired during 2010. All episodes, unless otherwise indicated, are hosted by Peter Sagal with announcer/scorekeeper Carl Kassell, and originated at Chicago's Chase Auditorium. Job titles and backgrounds of the guests reflect their status at the time of their appearance.
January
February
March
April
May
June
July
August
September
October
November
December
References
Wait Wait... Don't Tell Me!
Wait Wait Don't Tell Me
Wait Wait Don't Tell Me
|
is a Japanese former swimmer. He competed in two events at the 1976 Summer Olympics.
References
External links
1959 births
Living people
Japanese male butterfly swimmers
Olympic swimmers for Japan
Swimmers at the 1976 Summer Olympics
Sportspeople from Hiroshima
Asian Games medalists in swimming
Asian Games gold medalists for Japan
Swimmers at the 1978 Asian Games
Medalists at the 1978 Asian Games
20th-century Japanese people
21st-century Japanese people
|
```objective-c
/*
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*/
#pragma once
#include <unordered_map>
#include <vector>
#include "Debug.h"
namespace graph {
/*
* Iterative implementation of a postorder sort.
*/
template <class GraphInterface>
std::vector<typename GraphInterface::NodeId> postorder_sort(
const typename GraphInterface::Graph& graph) {
using NodeId = typename GraphInterface::NodeId;
enum State { UNVISITED, VISITING, VISITED };
NodeId entry = GraphInterface::entry(graph);
std::vector<NodeId> stack{entry};
std::unordered_map<NodeId, State> states{{entry, UNVISITED}};
std::vector<NodeId> postorder;
while (!stack.empty()) {
const auto& curr = stack.back();
auto state_it = states.find(curr);
always_assert(state_it != states.end());
switch (state_it->second) {
case UNVISITED: {
state_it->second = VISITING;
for (auto const& s : GraphInterface::successors(graph, curr)) {
const auto& target = GraphInterface::target(graph, s);
if (!states.count(target)) {
states[target] = UNVISITED;
stack.push_back(target);
}
}
break;
}
case VISITING: {
state_it->second = VISITED;
postorder.push_back(curr);
stack.pop_back();
break;
}
case VISITED: {
not_reached();
}
}
}
return postorder;
}
} // namespace graph
```
|
Takayuki Kobayashi (小林 鷹之, Kobayashi Takayuki, born 29 November 1974) is a Japanese politician who served in the Kishida Cabinet as Minister for Economic Security from 2021 to 2022.
Life and career
Kobayashi was born in Ichikawa, Chiba and educated at Kaisei Academy. He attended the University of Tokyo and got bachelor's degree from the Faculty of Law in 1999. While at the University of Tokyo, he was captain of the Rowing Club. He received a M.P.P. degree from the Harvard Kennedy School in 2001.
He joined the Ministry of Finance in 1999 and worked in the Financial Bureau (:ja:理財局), whose main task was to manage government bonds, fiscal investment and loans, and state property. Keizo Hamada, the governor of Kagawa Prefecture, was Kobayashi's boss at the Bureau.
From 2007 to 2010, he worked as a diplomat at the Embassy of Japan in Washington, D.C.
Political career
Election
In June 2010, he became the head of the Chiba Prefecture Second Constituency branch of the Liberal Democratic Party, and in December 2012, he was first elected to the House of Representatives in the 46th General Election for the House of Representatives, running for the Chiba Second Constituency on the Liberal Democratic Party's official ticket and the New Komeito Party's nomination.
Abe Cabinet
On 5 August 2016, he was appointed Parliamentary Vice-Minister for Defence in Abe Cabinet, and stepped down on 3 August 2017.
He was elected to the House of Representatives in the 48th general election in 2017.
Kishida Cabinet
In the 2021 LDP leadership election, he endorsed Sanae Takaichi. In the run-off election, he supported Fumio Kishida.
He was appointed to the Kishida Cabinet as Minister for Economic security on 4 October 2021.
On 10 August 2022, Kobayashi was dismissed from the Second Kishida Cabinet because of ties to the Unification Church. His dismissal was part of a wider purge by the Kishida administration following the assassination of Shinzo Abe and increasing media scrutiny of LDP officials' close ties with the church.
References
Living people
1974 births
21st-century Japanese politicians
Liberal Democratic Party (Japan) politicians
Ministers of Finance of Japan
Harvard University alumni
Japanese bankers
|
```objective-c
/* $OpenBSD: pckbcvar.h,v 1.17 2023/07/25 10:00:44 miod Exp $ */
/* $NetBSD: pckbcvar.h,v 1.4 2000/06/09 04:58:35 soda Exp $ */
/*
* Matthias Drochner. 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.
*
* 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.
*
*/
#ifndef _DEV_IC_PCKBCVAR_H_
#define _DEV_IC_PCKBCVAR_H_
#include <sys/timeout.h>
#define PCKBCCF_SLOT 0
#define PCKBCCF_SLOT_DEFAULT -1
typedef void *pckbc_tag_t;
typedef int pckbc_slot_t;
#define PCKBC_KBD_SLOT 0
#define PCKBC_AUX_SLOT 1
#define PCKBC_NSLOTS 2
/*
* external representation (pckbc_tag_t),
* needed early for console operation
*/
struct pckbc_internal {
bus_space_tag_t t_iot;
bus_space_handle_t t_ioh_d, t_ioh_c; /* data port, cmd port */
bus_addr_t t_addr;
u_char t_cmdbyte; /* shadow */
int t_flags;
/* need auxwrite command to find aux */
#define PCKBC_NEED_AUXWRITE 0x0001
/* can't translate to XT scancodes, stuck to set #2 */
#define PCKBC_FIXED_SET2 0x0002
/* can't translate to XT scancodes, stuck to set #3 */
#define PCKBC_FIXED_SET3 0x0004
#define PCKBC_CANT_TRANSLATE (PCKBC_FIXED_SET2 | PCKBC_FIXED_SET3)
int t_haveaux; /* controller has an aux port */
struct pckbc_slotdata *t_slotdata[PCKBC_NSLOTS];
struct pckbc_softc *t_sc; /* back pointer */
struct timeout t_cleanup;
struct timeout t_poll;
};
typedef void (*pckbc_inputfcn)(void *, int);
/*
* State per device.
*/
struct pckbc_softc {
struct device sc_dv;
struct pckbc_internal *id;
pckbc_inputfcn inputhandler[PCKBC_NSLOTS];
void *inputarg[PCKBC_NSLOTS];
char *subname[PCKBC_NSLOTS];
};
struct pckbc_attach_args {
pckbc_tag_t pa_tag;
pckbc_slot_t pa_slot;
};
extern const char *pckbc_slot_names[];
extern struct pckbc_internal pckbc_consdata;
extern int pckbc_console_attached;
void pckbc_set_inputhandler(pckbc_tag_t, pckbc_slot_t,
pckbc_inputfcn, void *, char *);
void pckbc_flush(pckbc_tag_t, pckbc_slot_t);
int pckbc_poll_cmd(pckbc_tag_t, pckbc_slot_t, u_char *, int,
int, u_char *, int);
int pckbc_enqueue_cmd(pckbc_tag_t, pckbc_slot_t, u_char *, int,
int, int, u_char *);
int pckbc_send_cmd(bus_space_tag_t, bus_space_handle_t, u_char);
int pckbc_poll_data(pckbc_tag_t, pckbc_slot_t);
int pckbc_poll_data1(bus_space_tag_t, bus_space_handle_t,
bus_space_handle_t, pckbc_slot_t, int);
void pckbc_set_poll(pckbc_tag_t, pckbc_slot_t, int);
int pckbc_xt_translation(pckbc_tag_t, int *);
void pckbc_slot_enable(pckbc_tag_t, pckbc_slot_t, int);
void pckbc_attach(struct pckbc_softc *, int);
int pckbc_cnattach(bus_space_tag_t, bus_addr_t, bus_size_t, int);
int pckbc_is_console(bus_space_tag_t, bus_addr_t);
void pckbc_reset(struct pckbc_softc *);
void pckbc_stop(struct pckbc_softc *);
int pckbcintr(void *);
void pckbc_release_console(void);
/*
* Device configuration flags (cf_flags).
*/
#define PCKBCF_FORCE_KEYBOARD_PRESENT 0x0001
#endif /* _DEV_IC_PCKBCVAR_H_ */
```
|
Gregory Gerard Huntington (born September 22, 1970) is a former American football center in the National Football League for the Washington Redskins, the Jacksonville Jaguars, and the Chicago Bears. He played college football at Penn State University and was drafted in the fifth round of the 1993 NFL Draft.
References
1970 births
Living people
Players of American football from Birmingham, Alabama
American football centers
Penn State Nittany Lions football players
Washington Redskins players
Jacksonville Jaguars players
Chicago Bears players
|
```python
#
#
# 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 unittest
import collective.test_communication_api_base as test_base
class TestReshardPToR(test_base.CommunicationTestDistBase):
def setUp(self):
super().setUp(num_of_devices=2, timeout=120)
self._default_envs = {
"shape": "(10, 20)",
"dtype": "float32",
"seeds": "2023",
}
self._changeable_envs = {
"shard": ["0", "1"],
"backend": ["cpu", "gpu"],
}
def test_reshard_p_to_r(self):
envs_list = test_base.gen_product_envs_list(
self._default_envs, self._changeable_envs
)
for envs in envs_list:
self.run_test_case(
"reshard_p_to_r.py",
user_defined_envs=envs,
)
def test_reshard_p_to_r_cross_mesh(self):
envs_list = test_base.gen_product_envs_list(
self._default_envs, self._changeable_envs
)
for envs in envs_list:
if envs["backend"] != "cpu":
self.run_test_case(
"reshard_p_to_r_cross_mesh.py",
user_defined_envs=envs,
)
if __name__ == "__main__":
unittest.main()
```
|
```java
/*
*
*/
package io.debezium.connector.mongodb.sink;
import java.util.Optional;
import java.util.function.Supplier;
import org.apache.kafka.connect.sink.SinkRecord;
import org.bson.BsonDocument;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;
import com.mongodb.MongoNamespace;
import com.mongodb.client.model.WriteModel;
import io.debezium.connector.mongodb.sink.converters.SinkDocument;
import io.debezium.connector.mongodb.sink.converters.SinkRecordConverter;
import io.debezium.connector.mongodb.sink.eventhandler.relational.RelationalEventHandler;
public class MongoProcessedSinkRecordData {
private static final Logger LOGGER = LoggerFactory.getLogger(MongoProcessedSinkRecordData.class);
private final MongoDbSinkConnectorConfig config;
private final MongoNamespace namespace;
private final SinkRecord sinkRecord;
private final SinkDocument sinkDocument;
private final WriteModel<BsonDocument> writeModel;
private Exception exception;
private final String databaseName;
MongoProcessedSinkRecordData(final SinkRecord sinkRecord, final MongoDbSinkConnectorConfig sinkConfig) {
this.sinkRecord = sinkRecord;
this.databaseName = sinkConfig.getSinkDatabaseName();
this.config = sinkConfig;
this.sinkDocument = new SinkRecordConverter().convert(sinkRecord);
this.namespace = createNamespace();
this.writeModel = createWriteModel();
}
public MongoDbSinkConnectorConfig getConfig() {
return config;
}
public MongoNamespace getNamespace() {
return namespace;
}
public SinkRecord getSinkRecord() {
return sinkRecord;
}
public WriteModel<BsonDocument> getWriteModel() {
return writeModel;
}
public Exception getException() {
return exception;
}
private MongoNamespace createNamespace() {
return tryProcess(
() -> Optional.of(new MongoNamespace(databaseName, config.getTableNamingStrategy().resolveTableName(config, sinkRecord))))
.orElse(null);
}
private WriteModel<BsonDocument> createWriteModel() {
return tryProcess(
() -> new RelationalEventHandler(config).handle(sinkDocument))
.orElse(null);
}
private <T> Optional<T> tryProcess(final Supplier<Optional<T>> supplier) {
try {
return supplier.get();
}
catch (Exception e) {
exception = e;
LOGGER.error("Unable to process record {}", sinkRecord, e);
}
return Optional.empty();
}
}
```
|
Krynytchky (; ) is an urban-type settlement in Kamianske Raion, Dnipropetrovsk Oblast, Ukraine. It hosts the administration of Krynychky settlement hromada, one of the hromadas of Ukraine. Population:
Krynychky is located on both banks of the Mokra Sura River, a right tributary of the Dnieper.
Until 18 July 2020, Krynychky was the administrative center of Krynychky Raion. The raion was abolished in July 2020 as part of the administrative reform of Ukraine, which reduced the number of raions of Dnipropetrovsk Oblast to seven. The area of Krynychky Raion was merged into Kamianske Raion.
Economy
Transportation
Krynychky is on a paved road connecting Kamianske with Svitlohirske. In Svitlohirske, it has access to the M04 highway connecting Dnipro and Kropyvnytskyi.
References
Urban-type settlements in Kamianske Raion
Yekaterinoslav Governorate
|
Blast from Your Past is a compilation album by English rock musician Ringo Starr, released on Apple Records in 1975. It is both Starr's first compilation LP and his final release under his contract with EMI. It was also the last album to be released on the Beatles' Apple label until it was revived in the 1990s.
The album provides an overview of Starr's most successful period as a solo artist. The songs include his RIAA gold-certified singles "It Don't Come Easy", "Photograph" and "You're Sixteen", and other international hits such as "Back Off Boogaloo" and "Only You". The album peaked at number 30 on the US Billboard pop LPs chart but failed to chart in the UK.
Content
Blast from Your Past provides an overview of Starr's musical achievements as a solo artist during the first half of the 1970s. The album compiles eight singles, one B-side, and one album track, all released between 1970 and 1975. All eight of the singles charted on the Billboard Hot 100 in the US; "Photograph" and "You're Sixteen" each hit number 1, while all of them but "Beaucoups of Blues" made the top ten. Five of the songs charted in the United Kingdom, where the non-album single "Back Off Boogaloo" was the highest placed, at number 2. "Early 1970" was the B-side to "It Don't Come Easy", another non-album single, and "I'm the Greatest" was taken from the album Ringo. "Oh My My", "Photograph" and "You're Sixteen" were taken from Ringo also, and "No No Song" and "Only You (And You Alone)" first appeared on Goodnight Vienna.
Release and reception
The album was released in the US on 20 November 1975, and 12 December in the UK. The latter was issued with a red Apple label. The sleeve for the album was designed by Roy Kohara. In the UK, Apple issued "Oh My My", backed with "No No Song", as a single on 9 January 1976, to promote the compilation and also because both of the songs had appeared there only as album tracks. As with John Lennon's recently released Apple compilation, Shaved Fish, the sales of Blast from Your Past were disappointing. The album failed to chart in the UK and peaked at number 30 in the US.
In his review for the NME, Bob Woffinden wrote that few observers would have expected Starr to have amassed enough hit songs for a greatest hits set five years after the Beatles' break-up, given that he had sung and written little during the band's career. Woffinden criticised the brevity of the album, however, and said that, since only four of the tracks had been significant chart successes in the UK, and many of the songs had not been issued as singles there, "why should [Starr] now consider an album of American 45s a going proposition in Britain?" Writing in their book The Beatles: An Illustrated Record, Roy Carr and Tony Tyler also commented on its "short weight" nature, saying: "the tracks total no more than half-an-hour. Both sides together, that is."
Blast from Your Past was reissued in the US by Capitol Records in September 1981, while in the UK it was released by the budget label Music for Pleasure on 25 November 1981. The album was issued on compact disc in the UK on 26 May 1987 and in the US on 18 January 1988.
All the tracks from Blast from Your Past appear on Starr's 2007 career-spanning compilation album Photograph: The Very Best of Ringo Starr.
Track listing
Charts
See also
Shaved Fish
The Best of George Harrison
Wings Greatest
References
Footnotes
Citations
External links
JPGR's Blast from Your Past site
1975 greatest hits albums
Albums produced by Richard Perry
Albums produced by George Harrison
Ringo Starr compilation albums
Apple Records compilation albums
Albums produced by Ringo Starr
Albums recorded at Sunset Sound Recorders
Albums recorded at A&M Studios
Albums recorded at Apple Studios
|
Leticia Ramona Martínez Forcado (born 21 December 1988) is a Paraguayan handball player for San Lorenzo BM and the Paraguay national team.
She was selected to represent Paraguay at the 2017 World Women's Handball Championship.
References
1988 births
Living people
Paraguayan female handball players
20th-century Paraguayan women
21st-century Paraguayan women
|
Matthew Joseph Festa (born March 11, 1993) is an American professional baseball pitcher who is a free agent. He has previously played in Major League Baseball (MLB) for the Seattle Mariners. He has also played for the Italy national baseball team.
Early life
Festa was born in Brooklyn, New York, and raised in the Bulls Head and Great Kills sections of Staten Island, New York. He grew up a fan of the New York Yankees, idolizing Mariano Rivera and Derek Jeter. Festa attended St. Joseph by the Sea High School, graduating in 2011.
College
He enrolled at Dominican College, where he played college baseball for the Dominican Chargers for one year, and transferred to East Stroudsburg University of Pennsylvania, where he played college baseball for the East Stroudsburg Warriors for three years.
Career
The Seattle Mariners selected him in the seventh round, with the 207th overall selection, of the 2016 MLB draft.
In 2016, Festa pitched for the Everett AquaSox of the Low-A Northwest League, posting a 6–2 win–loss record with a 3.73 earned run average (ERA) in 14 games (eight starts). Festa pitched for the Modesto Nuts of the High-A California League in 2017, where he went 4–2 with a 3.23 ERA with 99 strikeouts in innings pitched, and appeared in the league's all-star game. In 2018, the Mariners invited Festa to spring training. He began the regular season with the Arkansas Travelers of the Double-A Texas League, and the Mariners promoted him to the major leagues on July 14. He made his major league debut that day.
Festa made the Mariners' Opening Day roster in 2019. Festa was sent down to the Tacoma Rainiers of the Triple-A Pacific Coast League multiple times during the season, ending his 2019 season with just 20 appearances for Seattle. On February 3, 2020, Festa was designated for assignment and outrighted to Tacoma on February 10. On March 5, Festa underwent Tommy John surgery, ending his 2020 season before it began. He returned to action in August 2021 for Tacoma, and pitched innings of 2.95 ERA ball for the team, also appearing in four rehab games with the High-A Everett AquaSox and AZL Mariners.
The Mariners invited Festa to spring training as a non-roster player in 2022. Starting in the 2022 season, Festa decided to go by his full first name of Matthew instead of his abbreviated name Matt. On April 7, the Mariners selected Festa's contract, adding him to their Opening Day roster. On July 17, Festa earned his first career save, striking out the side in the 10th inning to protect a one-run lead over the Texas Rangers. In 8 appearances for Seattle, he posted a 4.00 ERA with 13 strikeouts in 9.0 innings of work. On August 8, Festa was designated for assignment by the Mariners. He was released by the team the same day.
International career
In November 2022, Festa committed to play for Team Italy in the 2023 World Baseball Classic in Miami. He played for Team Italy manager and hall of famer Mike Piazza.
References
External links
Living people
1993 births
American people of Italian descent
American people of Polish descent
Arizona Complex League Mariners players
Arkansas Travelers players
Dominican Chargers baseball players
East Stroudsburg Warriors baseball players
Everett AquaSox players
Major League Baseball pitchers
Modesto Nuts players
People from Great Kills, Staten Island
Peoria Javelinas players
Seattle Mariners players
Baseball players from Staten Island
St. Joseph by the Sea High School alumni
Tacoma Rainiers players
2023 World Baseball Classic players
|
```javascript
/* @flow */
import EventReporter from '../../src/reporters/event-reporter.js';
import build from './_mock.js';
type Events = Array<Object>;
const getBuff = build(
EventReporter,
(data, reporter: any, events: Events): Events => events,
(reporter: any): Events => {
const events: Events = [];
reporter.emit = (type: string, data: any) => {
events.push({type, data});
};
return events;
},
);
test('EventReporter.finished', async () => {
expect(
await getBuff(r => {
r.footer(false);
}),
).toMatchSnapshot();
});
test('EventReporter.step', async () => {
expect(
await getBuff(r => {
r.step(1, 5, 'foobar');
}),
).toMatchSnapshot();
});
test('EventReporter.log', async () => {
expect(
await getBuff(r => {
r.log('foobar');
}),
).toMatchSnapshot();
});
test('EventReporter.success', async () => {
expect(
await getBuff(r => {
r.success('foobar');
}),
).toMatchSnapshot();
});
test('EventReporter.error', async () => {
expect(
await getBuff(r => {
r.error('foobar');
}),
).toMatchSnapshot();
});
test('EventReporter.info', async () => {
expect(
await getBuff(r => {
r.info('foobar');
}),
).toMatchSnapshot();
});
test('EventReporter.command', async () => {
expect(
await getBuff(r => {
r.command('foobar');
}),
).toMatchSnapshot();
});
test('EventReporter.warn', async () => {
expect(
await getBuff(r => {
r.warn('foobar');
}),
).toMatchSnapshot();
});
```
|
Demirler is a neighbourhood in the municipality and district of Nurdağı, Gaziantep Province, Turkey. Its population is 101 (2022).
References
Neighbourhoods in Nurdağı District
|
Petroleum microbiology is a branch of microbiology that deals with the study of microorganisms that can metabolize or alter crude or refined petroleum products. These microorganisms, also called hydrocarbonoclastic microorganisms, can degrade hydrocarbons and, include a wide distribution of bacteria, methanogenic archaea, and some fungi. Not all hydrocarbonoclasic microbes depend on hydrocarbons to survive, but instead may use petroleum products as alternative carbon and energy sources. Interest in this field is growing due to the increasing use of bioremediation of oil spills.
Applications
Bioremediation
Bioremediation of oil contaminated soils, marine waters and oily sludges in situ is a feasible process as hydrocarbon degrading microorganisms are ubiquitous and are able to degrade most compounds in petroleum oil. In the simplest case, indigenous microbial communities can degrade the petroleum where the spill occurs. In more complicated cases, various methods of adding nutrients, air, or exogenous microorganisms to the contaminated site can be applied. For example, bioreactors involve the application of both natural and additional microorganisms in controlled growth conditions that yields high biodegradation rates and can be used with a wide range of media.
Crude oils are composed of an array of chemical compounds, minor constituents, and trace metals. Making up 50-98% of these petroleum products are hydrocarbons with saturated, unsaturated, or aromatic structures which influence their biodegradability by hydronocarbonclasts. The rate of uptake and biodegradation by these hydrocarbon-oxidizing microbes not only depend on the chemical structure of the substrates, but is limited by biotic and abiotic factors such as temperature, salinity, and nutrient availability in the environment.
Alcanivorax borkumensis
A model microorganism studied for its role in bioremediation of oil-spill sites and hydrocarbon catabolism is the alpha-proteobacteria Alcanivorax, which degrades aliphatic alkanes through various metabolic activities. Alcanivorax borkumensis utilizes linear hydrocarbon chains in petroleum as its primary energy source under aerobic conditions. When further supplied with sufficient limiting nutrients such as nitrogen and phosphor, it grows and produces surfactant glucolipids to help reduce surface water tension and enhance hydrocarbon uptake.[5] For this reason, nitrates and phosphates are often commercially added to oil-spill sites to engage quiescent populations of A. borkumensis, allowing them to quickly outcompete other microbial populations and become the dominant species in the oil-infested environment.
The addition of rate-limiting nutrients promotes the microbe's biodegrading pathways, including upregulation of genes encoding multiple alkane hydroxylases that oxidize various lengths of linear alkanes. These enzymes essentially remove the problematic hydrocarbon constituents of petroleum oil while A. borkumensis simultaneously increases synthesis of anionic glucoproteins, which are used to emulsify hydrocarbons in the environment and increase their bioavailability. The presence of crude oil along with appropriate levels of nitrogen and phosphor catalyzes the removal of petroleum either by mechanisms that enhance the efficiency of substrate uptake or by direct biodegradation of aliphatic chains.
Commercial applications
Two well-known oil spills exemplify large scale marine bioremediation applications:
In 1989, the Exxon Valdez ran aground, spilling 41.6 million liters of crude oil, and launching one of the first major bioremediation efforts for an oil spill. Cleanup of Alaskan shorelines relied in part on fertilizer application to augment bacterial growth.
In 2010, the BP Deepwater Horizon oil spill released 779 million liters of oil into the Gulf of Mexico. This was the largest oil spill of all time and indigenous petroleum microorganisms played a major role in petroleum degradation and cleanup.
Biosurfactants
These are microbial-synthesized surface-active substances that allow for more efficient microbial biodegradation of hydrocarbons in bioremediation processes. There are two ways by which biosurfactants are involved in bioremediation. (1) Increase the surface area of hydrophobic water-insoluble substrates. Growth of microbes on hydrocarbons can be limited by available surface area of the water-oil interface. Emulsifiers produced by microbes can break up oil into smaller droplets, effectively increasing the available surface area. (2) Increase the bioavailability of hydrophobic water-insoluble substrates. Biosurfactants can enhance the availability of bound substrates by desorbing them from surfaces (e.g. soil) or by increasing their apparent solubility. Some biosurfactants have low critical micelle concentrations (CMCs), a property which increases the apparent solubility of hydrocarbons by sequestering hydrophobic molecules into the centres of micelles.
Oil Recovery
Microbial enhanced oil recovery (MEOR) is a technology in which microbial environments are manipulated to enhance oil recovery. Nutrients are injected in situ into porous media and indigenous or added microbes promote growth and/or generate products that mobilize oil into producing wells. Alternatively, oil-mobilizing products can be produced by fermentation and injected into the reservoir. Various products and microorganisms are useful in these applications and each will yield different results. The two general strategies for enhancing oil recovery are altering the surface properties of the interface and using bioclogging to change the flow behavior. Biomass, biosurfactants, biopolymers, solvents, acids, and gases are some of the products that are added to oil reservoirs to enhance recovery.
Other resources for this application:
Biosensors
Microbial biosensors identify and quantify target compounds of interest through interactions with the microbes. For example, bacteria may be used to identify a pollutant by monitoring their response to the specific chemical. The biosensor system may simply use bacterial growth as a pollutant indicator, or rely on genetic assays wherein a reporter gene is induced by the chemical.
Many analytical techniques require expensive treatment of soil samples and/or expensive equipment to detect the presence of pollutants. Bacterial biosensor systems offer the potential for cheap, robust detection systems that are selective and highly sensitive. One developed system uses Pseudomonas fluorescens HK44 to quantitatively assay for naphthalene using bioluminescence.
Challenges
Often in the process of degrading a pollutant, a microbe can create intermediates or byproducts that are also harmful, sometimes even more harmful than the original substrate. For example, some microbes produce hydrogen sulfide as a byproduct in the degradation of certain petroleum hydrocarbons and if those gases are not detoxified before escaping the system, they can be released into the atmosphere.
Biodegradation pathways
The pathways of degradation of different petroleum products vary depending on the substrate and the microorganism (i.e. aerobic/anaerobic). Specific degradation pathways of many hydrocarbon compounds can be found on the University of Minnesota Biocatalysis/Biodegradation Database.
References
Further reading
Microbiology
Petroleum technology
|
Wilhelm Hendrik Franquinet (also known as Willem Hendrik or Guillaume Henri), was a Belgian-born Belgian-French-American painter. Franquinet was born at Maastricht in 1785, was instructed by Herreyns at Antwerp. Franquinet afterwards visited Germany, and was a drawing-master at his native town from 1804 to 1816. In 1816 he settled in Paris, and in 1821 painted the Bacchanal, and in 1822-34 published a Galerie des Peintres, for which J. Chabert wrote the text. He died in New York in 1854.
References
External links
1785 births
1854 deaths
18th-century Flemish painters
19th-century Flemish painters
Artists from Maastricht
|
```xml
import throttle from './throttle';
describe('throttle()', () => {
beforeAll(() => {
jest.useFakeTimers();
});
afterEach(() => {
jest.clearAllTimers();
});
afterAll(() => {
jest.useRealTimers();
});
it('invokes function at most once every wait milliseconds', () => {
const functionToThrottle = jest.fn();
const wait = 1000;
const throttledFunction = throttle(functionToThrottle, wait);
throttledFunction();
expect(functionToThrottle).toHaveBeenCalledTimes(1);
// Call function just before the wait time expires
jest.advanceTimersByTime(wait - 1);
throttledFunction();
expect(functionToThrottle).toHaveBeenCalledTimes(1);
// fast-forward until 1st call should be executed
jest.advanceTimersByTime(1);
expect(functionToThrottle).toHaveBeenCalledTimes(2);
throttledFunction();
expect(functionToThrottle).toHaveBeenCalledTimes(2);
jest.advanceTimersByTime(wait);
expect(functionToThrottle).toHaveBeenCalledTimes(3);
});
});
```
|
```groff
.\" $OpenBSD: ASN1_STRING_length.3,v 1.29 2021/12/14 19:36:18 schwarze Exp $
.\" full merge up to: OpenSSL 24a535ea Sep 22 13:14:20 2020 +0100
.\"
.\" This file is a derived work.
.\"
.\"
.\" Permission to use, copy, modify, and distribute this software for any
.\" purpose with or without fee is hereby granted, provided that the above
.\" copyright notice and this permission notice appear in all copies.
.\"
.\" THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
.\" WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
.\" MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
.\" ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
.\" WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
.\" ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
.\" OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
.\"
.\" The original file was written by Dr. Stephen Henson.
.\" 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. All advertising materials mentioning features or use of this
.\" software must display the following acknowledgment:
.\" "This product includes software developed by the OpenSSL Project
.\" for use in the OpenSSL Toolkit. (path_to_url"
.\"
.\" 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
.\" endorse or promote products derived from this software without
.\" prior written permission. For written permission, please contact
.\" openssl-core@openssl.org.
.\"
.\" 5. Products derived from this software may not be called "OpenSSL"
.\" nor may "OpenSSL" appear in their names without prior written
.\" permission of the OpenSSL Project.
.\"
.\" 6. Redistributions of any form whatsoever must retain the following
.\" acknowledgment:
.\" "This product includes software developed by the OpenSSL Project
.\" for use in the OpenSSL Toolkit (path_to_url"
.\"
.\" THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
.\" EXPRESSED 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 OpenSSL PROJECT OR
.\" ITS 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.
.\"
.Dd $Mdocdate: December 14 2021 $
.Dt ASN1_STRING_LENGTH 3
.Os
.Sh NAME
.Nm ASN1_STRING_cmp ,
.Nm ASN1_OCTET_STRING_cmp ,
.Nm ASN1_STRING_data ,
.Nm ASN1_STRING_dup ,
.Nm ASN1_OCTET_STRING_dup ,
.Nm ASN1_STRING_get0_data ,
.Nm ASN1_STRING_length ,
.Nm ASN1_STRING_length_set ,
.Nm ASN1_STRING_set0 ,
.Nm ASN1_STRING_set ,
.Nm ASN1_OCTET_STRING_set ,
.Nm ASN1_STRING_copy ,
.Nm ASN1_STRING_to_UTF8 ,
.Nm ASN1_STRING_type
.\" deprecated aliases, intentionally undocumented:
.\" M_ASN1_STRING_data, M_ASN1_STRING_length
.Nd ASN1_STRING utility functions
.Sh SYNOPSIS
.In openssl/asn1.h
.Ft int
.Fo ASN1_STRING_cmp
.Fa "const ASN1_STRING *a"
.Fa "const ASN1_STRING *b"
.Fc
.Ft int
.Fo ASN1_OCTET_STRING_cmp
.Fa "const ASN1_OCTET_STRING *a"
.Fa "const ASN1_OCTET_STRING *b"
.Fc
.Ft unsigned char *
.Fo ASN1_STRING_data
.Fa "ASN1_STRING *x"
.Fc
.Ft ASN1_STRING *
.Fo ASN1_STRING_dup
.Fa "const ASN1_STRING *a"
.Fc
.Ft ASN1_OCTET_STRING *
.Fo ASN1_OCTET_STRING_dup
.Fa "const ASN1_OCTET_STRING *a"
.Fc
.Ft const unsigned char *
.Fo ASN1_STRING_get0_data
.Fa "const ASN1_STRING *x"
.Fc
.Ft int
.Fo ASN1_STRING_length
.Fa "const ASN1_STRING *x"
.Fc
.Ft void
.Fo ASN1_STRING_length_set
.Fa "ASN1_STRING *x"
.Fa "int len"
.Fc
.Ft void
.Fo ASN1_STRING_set0
.Fa "ASN1_STRING *str"
.Fa "void *data"
.Fa "int len"
.Fc
.Ft int
.Fo ASN1_STRING_set
.Fa "ASN1_STRING *str"
.Fa "const void *data"
.Fa "int len"
.Fc
.Ft int
.Fo ASN1_OCTET_STRING_set
.Fa "ASN1_OCTET_STRING *str"
.Fa "const unsigned char *data"
.Fa "int len"
.Fc
.Ft int
.Fo ASN1_STRING_copy
.Fa "ASN1_STRING *dst"
.Fa "const ASN1_STRING *src"
.Fc
.Ft int
.Fo ASN1_STRING_to_UTF8
.Fa "unsigned char **out"
.Fa "const ASN1_STRING *in"
.Fc
.Ft int
.Fo ASN1_STRING_type
.Fa "const ASN1_STRING *x"
.Fc
.Sh DESCRIPTION
These functions manipulate
.Vt ASN1_STRING
structures.
.Pp
.Fn ASN1_STRING_cmp
compares the type, the length, and the content of
.Fa a
and
.Fa b .
.Pp
.Fn ASN1_OCTET_STRING_cmp
does exactly the same as
.Fn ASN1_STRING_cmp
without providing any type safety.
.Pp
.Fn ASN1_STRING_data
is similar to
.Fn ASN1_STRING_get0_data
except that the returned value is not constant.
This function is deprecated.
Applications should use
.Fn ASN1_STRING_get0_data
instead.
.Pp
.Fn ASN1_STRING_dup
allocates a new
.Vt ASN1_STRING
object and copies the type, length, data, and flags from
.Fa a
into it.
.Pp
.Fn ASN1_OCTET_STRING_dup
does exactly the same as
.Fn ASN1_STRING_dup
without providing any type safety.
.Pp
.Fn ASN1_STRING_get0_data
returns an internal pointer to the data of
.Fa x .
It should not be freed or modified in any way.
.Pp
.Fn ASN1_STRING_length
returns the length attribute of
.Fa x ,
measured in bytes.
.Pp
.Fn ASN1_STRING_length_set
sets the length attribute of
.Fa x
to
.Fa len .
It may put
.Fa x
into an inconsistent internal state.
.Pp
.Fn ASN1_STRING_set0
frees any data stored in
.Fa str ,
sets the length attribute to
.Fa len
bytes, and sets the data attribute to
.Fa data ,
transferring ownership, without doing any validation.
.Pp
.Fn ASN1_STRING_set
sets the length attribute of
.Fa str
to
.Fa len
and copies that number of bytes from
.Fa data
into
.Fa str ,
overwriting any previous data.
If
.Fa len
is \-1, then
.Fn strlen data
is used instead of
.Fa len .
If
.Fa data
is
.Dv NULL ,
the content of
.Fa str
remains uninitialized; that is not considered an error unless
.Fa len
is negative.
.Pp
.Fn ASN1_OCTET_STRING_set
does exactly the same as
.Fn ASN1_STRING_set
without providing any type safety.
.Pp
.Fn ASN1_STRING_copy
copies the length and data of
.Fa src
into
.Fa dst
using
.Fn ASN1_STRING_set
and changes the type and flags of
.Fa dst
to match the type and flags of
.Fa src .
.Pp
.Fn ASN1_STRING_to_UTF8
converts the string
.Fa in
to UTF-8 format.
The converted data is copied into a newly allocated buffer
.Pf * Fa out .
The buffer
.Pf * Fa out
should be freed using
.Xr free 3 .
.Pp
.Fn ASN1_STRING_type
returns the type of
.Fa x .
If the bit
.Dv V_ASN1_NEG
is set in the return value,
.Fa x
is an ASN.1 INTEGER or ENUMERATED object with a negative value.
.Pp
Almost all ASN.1 types are represented as
.Vt ASN1_STRING
structures.
Other types such as
.Vt ASN1_OCTET_STRING
are simply typedefed to
.Vt ASN1_STRING
and the functions call the
.Vt ASN1_STRING
equivalents.
.Vt ASN1_STRING
is also used for some CHOICE types which consist entirely of primitive
string types such as
.Vt DirectoryString
and
.Vt Time .
.Pp
These functions should
.Em not
be used to examine or modify
.Vt ASN1_INTEGER
or
.Vt ASN1_ENUMERATED
types: the relevant INTEGER or ENUMERATED utility functions should
be used instead.
.Pp
In general it cannot be assumed that the data returned by
.Fn ASN1_STRING_get0_data
and
.Fn ASN1_STRING_data
is NUL terminated, and it may contain embedded NUL characters.
The format of the data depends on the string type:
for example for an
.Vt IA5String
the data contains ASCII characters, for a
.Vt BMPString
two bytes per character in big endian format, and for a
.Vt UTF8String
UTF-8 characters.
.Pp
Similar care should be taken to ensure the data is in the correct format
when calling
.Fn ASN1_STRING_set
or
.Fn ASN1_STRING_set0 .
.Sh RETURN VALUES
.Fn ASN1_STRING_cmp
and
.Fn ASN1_OCTET_STRING_cmp
return 0 if the type, the length, and the content of
.Fa a
and
.Fa b
agree, or a non-zero value otherwise.
In contrast to
.Xr strcmp 3 ,
the sign of the return value does not indicate lexicographical ordering.
.Pp
.Fn ASN1_STRING_data
and
.Fn ASN1_STRING_get0_data
return an internal pointer to the data of
.Fa x .
.Pp
.Fn ASN1_STRING_dup
and
.Fn ASN1_OCTET_STRING_dup
return a pointer to a newly allocated
.Vt ASN1_STRING
structure or
.Dv NULL
if an error occurred.
.Pp
.Fn ASN1_STRING_length
returns a number of bytes.
.Pp
.Fn ASN1_STRING_set ,
.Fn ASN1_OCTET_STRING_set ,
and
.Fn ASN1_STRING_copy
return 1 on success or 0 on failure.
They fail if memory allocation fails.
.Fn ASN1_STRING_set
and
.Fn ASN1_OCTET_STRING_set
also fail if
.Fa data
is
.Dv NULL
and
.Fa len
is \-1 in the same call.
.Fn ASN1_STRING_copy
also fails if
.Fa src
is
.Dv NULL .
.Pp
.Fn ASN1_STRING_to_UTF8
returns the number of bytes in the output buffer
.Pf * Fa out ,
or a negative number if an error occurred.
.Pp
.Fn ASN1_STRING_type
returns an integer constant, for example
.Dv V_ASN1_OCTET_STRING
or
.Dv V_ASN1_NEG_INTEGER .
.Pp
In some cases of failure of
.Fn ASN1_STRING_dup ,
.Fn ASN1_STRING_set ,
and
.Fn ASN1_STRING_to_UTF8 ,
the reason can be determined with
.Xr ERR_get_error 3 .
.Sh SEE ALSO
.Xr ASN1_BIT_STRING_set 3 ,
.Xr ASN1_mbstring_copy 3 ,
.Xr ASN1_PRINTABLE_type 3 ,
.Xr ASN1_STRING_new 3 ,
.Xr ASN1_UNIVERSALSTRING_to_string 3
.Sh HISTORY
.Fn ASN1_STRING_cmp ,
.Fn ASN1_STRING_dup ,
.Fn ASN1_STRING_set ,
and
.Fn ASN1_OCTET_STRING_set
first appeared in SSLeay 0.6.5.
.Fn ASN1_OCTET_STRING_cmp ,
.Fn ASN1_STRING_data ,
.Fn ASN1_OCTET_STRING_dup ,
and
.Fn ASN1_STRING_type
first appeared in SSLeay 0.8.0.
.Fn ASN1_STRING_length
first appeared in SSLeay 0.9.0.
All these functions have been available since
.Ox 2.4 .
.Pp
.Fn ASN1_STRING_length_set
first appeared in OpenSSL 0.9.5 and has been available since
.Ox 2.7 .
.Pp
.Fn ASN1_STRING_to_UTF8
first appeared in OpenSSL 0.9.6 and has been available since
.Ox 2.9 .
.Pp
.Fn ASN1_STRING_set0
first appeared in OpenSSL 0.9.8h and has been available since
.Ox 4.5 .
.Pp
.Fn ASN1_STRING_copy
first appeared in OpenSSL 1.0.0 and has been available since
.Ox 4.9 .
.Pp
.Fn ASN1_STRING_get0_data
first appeared in OpenSSL 1.1.0 and has been available since
.Ox 6.3 .
.Sh BUGS
.Fn ASN1_OCTET_STRING_cmp ,
.Fn ASN1_OCTET_STRING_dup ,
and
.Fn ASN1_OCTET_STRING_set
do not check whether their arguments are really of the type
.Dv V_ASN1_OCTET_STRING .
They may report success even if their arguments are of a wrong type.
Consequently, even in case of success, the return value of
.Fn ASN1_OCTET_STRING_dup
is not guaranteed to be of the type
.Dv V_ASN1_OCTET_STRING
either.
```
|
, there were about 4,200 electric vehicles registered in New Mexico. , 1.7% of new vehicles sold in the state were electric.
Government policy
, the state government does not offer any tax incentives for electric vehicle purchases.
The first electric vehicles were added to the state fleet in 2019.
Charging stations
, there were about 250 public charging stations in New Mexico.
The Infrastructure Investment and Jobs Act, signed into law in November 2021, allocates to charging stations in New Mexico.
Public opinion
A poll conducted in November 2021 by Coltura shows 51% of New Mexico voters in support of requiring all new cars sold in the state to be electric by 2030.
By region
Albuquerque
, there were about 60 public charging stations in Albuquerque.
Santa Fe
, there were about 30 public charging stations in Santa Fe.
References
New Mexico
Road transportation in New Mexico
|
```objective-c
/*
* netlink/route/route.h Routes
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
*
*/
#ifndef NETLINK_ROUTE_H_
#define NETLINK_ROUTE_H_
#include <netlink/netlink.h>
#include <netlink/cache.h>
#include <netlink/addr.h>
#include <netlink/data.h>
#include <netlink/route/nexthop.h>
#include <netlink/route/rtnl.h>
#include <linux/in_route.h>
#ifdef __cplusplus
extern "C" {
#endif
/* flags */
#define ROUTE_CACHE_CONTENT 1
struct rtnl_route;
struct rtnl_rtcacheinfo
{
uint32_t rtci_clntref;
uint32_t rtci_last_use;
uint32_t rtci_expires;
int32_t rtci_error;
uint32_t rtci_used;
uint32_t rtci_id;
uint32_t rtci_ts;
uint32_t rtci_tsage;
};
extern struct nl_object_ops route_obj_ops;
extern struct rtnl_route * rtnl_route_alloc(void);
extern void rtnl_route_put(struct rtnl_route *);
extern int rtnl_route_alloc_cache(struct nl_sock *, int, int,
struct nl_cache **);
extern void rtnl_route_get(struct rtnl_route *);
extern void rtnl_route_put(struct rtnl_route *);
extern int rtnl_route_parse(struct nlmsghdr *, struct rtnl_route **);
extern int rtnl_route_build_msg(struct nl_msg *, struct rtnl_route *);
extern int rtnl_route_build_add_request(struct rtnl_route *, int,
struct nl_msg **);
extern int rtnl_route_add(struct nl_sock *, struct rtnl_route *, int);
extern int rtnl_route_build_del_request(struct rtnl_route *, int,
struct nl_msg **);
extern int rtnl_route_delete(struct nl_sock *, struct rtnl_route *, int);
extern void rtnl_route_set_table(struct rtnl_route *, uint32_t);
extern uint32_t rtnl_route_get_table(struct rtnl_route *);
extern void rtnl_route_set_scope(struct rtnl_route *, uint8_t);
extern uint8_t rtnl_route_get_scope(struct rtnl_route *);
extern void rtnl_route_set_tos(struct rtnl_route *, uint8_t);
extern uint8_t rtnl_route_get_tos(struct rtnl_route *);
extern void rtnl_route_set_protocol(struct rtnl_route *, uint8_t);
extern uint8_t rtnl_route_get_protocol(struct rtnl_route *);
extern void rtnl_route_set_priority(struct rtnl_route *, uint32_t);
extern uint32_t rtnl_route_get_priority(struct rtnl_route *);
extern int rtnl_route_set_family(struct rtnl_route *, uint8_t);
extern uint8_t rtnl_route_get_family(struct rtnl_route *);
extern int rtnl_route_set_type(struct rtnl_route *, uint8_t);
extern uint8_t rtnl_route_get_type(struct rtnl_route *);
extern void rtnl_route_set_flags(struct rtnl_route *, uint32_t);
extern void rtnl_route_unset_flags(struct rtnl_route *, uint32_t);
extern uint32_t rtnl_route_get_flags(struct rtnl_route *);
extern int rtnl_route_set_metric(struct rtnl_route *, int, unsigned int);
extern int rtnl_route_unset_metric(struct rtnl_route *, int);
extern int rtnl_route_get_metric(struct rtnl_route *, int, uint32_t *);
extern int rtnl_route_set_dst(struct rtnl_route *, struct nl_addr *);
extern struct nl_addr *rtnl_route_get_dst(struct rtnl_route *);
extern int rtnl_route_set_src(struct rtnl_route *, struct nl_addr *);
extern struct nl_addr *rtnl_route_get_src(struct rtnl_route *);
extern int rtnl_route_set_pref_src(struct rtnl_route *, struct nl_addr *);
extern struct nl_addr *rtnl_route_get_pref_src(struct rtnl_route *);
extern void rtnl_route_set_iif(struct rtnl_route *, int);
extern int rtnl_route_get_iif(struct rtnl_route *);
extern int rtnl_route_get_src_len(struct rtnl_route *);
extern void rtnl_route_add_nexthop(struct rtnl_route *,
struct rtnl_nexthop *);
extern void rtnl_route_remove_nexthop(struct rtnl_route *,
struct rtnl_nexthop *);
extern struct nl_list_head *rtnl_route_get_nexthops(struct rtnl_route *);
extern int rtnl_route_get_nnexthops(struct rtnl_route *);
extern void rtnl_route_foreach_nexthop(struct rtnl_route *r,
void (*cb)(struct rtnl_nexthop *, void *),
void *arg);
extern struct rtnl_nexthop * rtnl_route_nexthop_n(struct rtnl_route *r, int n);
extern int rtnl_route_guess_scope(struct rtnl_route *);
extern char * rtnl_route_table2str(int, char *, size_t);
extern int rtnl_route_str2table(const char *);
extern int rtnl_route_read_table_names(const char *);
extern char * rtnl_route_proto2str(int, char *, size_t);
extern int rtnl_route_str2proto(const char *);
extern int rtnl_route_read_protocol_names(const char *);
extern char * rtnl_route_metric2str(int, char *, size_t);
extern int rtnl_route_str2metric(const char *);
#ifdef __cplusplus
}
#endif
#endif
```
|
```c
/***
*checkcfg.c - logic and globals to support the Guard security feature
*
*
*Purpose:
* Define the globals and default check routine for the Guard security
* feature.
*
* N.B. Code and data declared by this module must be in the form of
* selectany COMDATs, so that duplicate definitions between the
* CRT and no_cfg_support are permitted for the restricted use
* cases of the no_cfg_support module.
*
*******************************************************************************/
#include <vcruntime_internal.h>
extern PVOID __guard_check_icall_fptr;
typedef
void
(__fastcall *GUARDCF_CHECK_ROUTINE) (
uintptr_t Target
);
#pragma warning(suppress: 4918) // 'y' is not necessarily supported on all architectures
BEGIN_PRAGMA_OPTIMIZE_ENABLE("y", DevDivVSO:162582, "Required to avoid poor codegen--notably on ARM")
extern
__declspec(guard(ignore))
__inline
void
__fastcall
_guard_check_icall (
_In_ uintptr_t Target
)
/*++
Routine Description:
This function performs an ICall check when invoked by the compiler to
check the integrity of a function pointer for Control Flow Guard (/guard).
N.B. This function is only retained for compatibility with pre-17.1 LKG4
compilers that do not directly invoke through the
__guard_check_icall_fptr function pointer.
Arguments:
Target - Supplies the function pointer to check.
Return Value:
None. If the function pointer supplied was invalid, then a fast fail event
or an access violation is raised.
--*/
{
((GUARDCF_CHECK_ROUTINE)__guard_check_icall_fptr)(Target);
return;
}
```
|
Dudley Kingswinford Rugby Football Club is an English rugby union football club based in Kingswinford in the West Midlands. The club currently participate in the fourth tier of English club rugby, National League 2 West, following their promotion from Regional 1 Midlands in 2022–23. The club run seven senior sides, a ladies team and a full range of junior sides.
Early history
The club was founded in May 1920. Known in its early years as the Bean Football Club, the name Dudley Kingswinford was adopted in 1927. After playing at several grounds the club moved to its current premises in 1962.
Ground
Dudley Kingswinford play home games at Heathbrook, located on the western outskirts of Wall Heath, Kingswinford. The ground is most accessible by car with the nearest train station being Stourbridge Town railway station, over 5 miles away. The ground has four full size pitches (1st XV, 2nd XV, 3rd XV and training), along with five pitches for youth rugby (under-9 to under-13).
The ground capacity for the 1st XV pitch is approximately 2,260, with 260 seated in the main stand and an estimated 2,000 standing pitch side including on the grass banks and by the club-house.
Current standings
Dudley Kingswinford were demoted from National League 2 North at the end of the 2013–14 season and played in National League 3 Midlands from 2014–15. Following a further relegation they play in Midlands 1 West and in the 2016–17 season they finished 4th overall. They were promoted back to Midlands Premier at the end of the 2019–20 season.
Honours
1st team:
Staffordshire Cup winners (2): 1967, 1969
North Midlands Cup winners (5): 1977, 1979, 1989, 2000, 2012
NPI Cup finalists: 1999
Midlands Division 1 champions: 1999–00
Midlands Division 1 West champions (2): 2010–11, 2019–20
National League 3 (north v midlands) promotion play-off winner: 2011–12
Regional 1 Midlands winners: 2022–23
2nd team (Dudley Wasps):
Midlands 6 West (South-West) champions: 2006–07
North Midlands Vase winners: 2011
References
External links
Rugby union teams in England
Rugby clubs established in 1922
Sport in the Metropolitan Borough of Dudley
Rugby union in the West Midlands (county)
1922 establishments in England
|
```java
package com.clean.example.core.usecase.job;
@FunctionalInterface
public interface OnSuccess {
void auditSuccess();
}
```
|
```c
/*************************************************************************
> File Name: build_bug_on_invalid.c
> Author: GatieMe
> Mail: gatieme@163.com
> Created Time: Thu 13 Apr 2017 11:26:18 AM CST
************************************************************************/
#include <stdio.h>
#include <stdlib.h>
#include "bug.h"
# define __force __attribute__((force))
#ifndef BUILD_BUG_ON_INVALID
/*
* BUILD_BUG_ON_INVALID() permits the compiler to check the validity of the
* expression but avoids the generation of any code, even if that expression
* has side-effects.
*/
#define BUILD_BUG_ON_INVALID(e) ((void)(sizeof((__force long)(e))))
#endif
#define NUM 12_$
int main(int argc, char *argv[])
{
BUILD_BUG_ON_INVALID(NUM);
return EXIT_SUCCESS;
}
```
|
Elmo Alvin Maul (June 20, 1902 – March 16, 1974) was a professional football player in the National Football League. Maul made his debut in the NFL in 1926 with the Los Angeles Buccaneers. He played only one season in the league.
Notes
External links
1902 births
1974 deaths
American football fullbacks
Players of American football from Fresno County, California
Saint Mary's Gaels football players
Los Angeles Buccaneers players
|
```smalltalk
using Microsoft.EntityFrameworkCore;
using Microsoft.EntityFrameworkCore.TestUtilities;
using Pomelo.EntityFrameworkCore.MySql.FunctionalTests.TestUtilities;
using Xunit;
#nullable enable
namespace Pomelo.EntityFrameworkCore.MySql.FunctionalTests
{
public class ValueConvertersEndToEndMySqlTest
: ValueConvertersEndToEndTestBase<ValueConvertersEndToEndMySqlTest.ValueConvertersEndToEndMySqlFixture>
{
public ValueConvertersEndToEndMySqlTest(ValueConvertersEndToEndMySqlFixture fixture)
: base(fixture)
{
}
// CHECK: Do the UNSIGNED types make sense?
[ConditionalTheory]
[InlineData(nameof(ConvertingEntity.BoolAsChar), "varchar(1)", false)]
[InlineData(nameof(ConvertingEntity.BoolAsNullableChar), "varchar(1)", false)]
[InlineData(nameof(ConvertingEntity.BoolAsString), "varchar(3)", false)]
[InlineData(nameof(ConvertingEntity.BoolAsInt), "int", false)]
[InlineData(nameof(ConvertingEntity.BoolAsNullableString), "varchar(3)", false)]
[InlineData(nameof(ConvertingEntity.BoolAsNullableInt), "int", false)]
[InlineData(nameof(ConvertingEntity.IntAsLong), "bigint", false)]
[InlineData(nameof(ConvertingEntity.IntAsNullableLong), "bigint", false)]
[InlineData(nameof(ConvertingEntity.BytesAsString), "longtext", false)]
[InlineData(nameof(ConvertingEntity.BytesAsNullableString), "longtext", false)]
[InlineData(nameof(ConvertingEntity.CharAsString), "varchar(1)", false)]
[InlineData(nameof(ConvertingEntity.CharAsNullableString), "varchar(1)", false)]
[InlineData(nameof(ConvertingEntity.DateTimeOffsetToBinary), "bigint", false)]
[InlineData(nameof(ConvertingEntity.DateTimeOffsetToNullableBinary), "bigint", false)]
[InlineData(nameof(ConvertingEntity.DateTimeOffsetToString), "varchar(48)", false)]
[InlineData(nameof(ConvertingEntity.DateTimeOffsetToNullableString), "varchar(48)", false)]
[InlineData(nameof(ConvertingEntity.DateTimeToBinary), "bigint", false)]
[InlineData(nameof(ConvertingEntity.DateTimeToNullableBinary), "bigint", false)]
[InlineData(nameof(ConvertingEntity.DateTimeToString), "varchar(48)", false)]
[InlineData(nameof(ConvertingEntity.DateTimeToNullableString), "varchar(48)", false)]
[InlineData(nameof(ConvertingEntity.EnumToString), "longtext", false)]
[InlineData(nameof(ConvertingEntity.EnumToNullableString), "longtext", false)]
[InlineData(nameof(ConvertingEntity.EnumToNumber), "bigint", false)]
[InlineData(nameof(ConvertingEntity.EnumToNullableNumber), "bigint", false)]
[InlineData(nameof(ConvertingEntity.GuidToString), "varchar(36)", false)]
[InlineData(nameof(ConvertingEntity.GuidToNullableString), "varchar(36)", false)]
[InlineData(nameof(ConvertingEntity.GuidToBytes), "varbinary(16)", false)]
[InlineData(nameof(ConvertingEntity.GuidToNullableBytes), "varbinary(16)", false)]
[InlineData(nameof(ConvertingEntity.IPAddressToString), "varchar(45)", false)]
[InlineData(nameof(ConvertingEntity.IPAddressToNullableString), "varchar(45)", false)]
[InlineData(nameof(ConvertingEntity.IPAddressToBytes), "varbinary(16)", false)]
[InlineData(nameof(ConvertingEntity.IPAddressToNullableBytes), "varbinary(16)", false)]
[InlineData(nameof(ConvertingEntity.PhysicalAddressToString), "varchar(20)", false)]
[InlineData(nameof(ConvertingEntity.PhysicalAddressToNullableString), "varchar(20)", false)]
[InlineData(nameof(ConvertingEntity.PhysicalAddressToBytes), "varbinary(8)", false)]
[InlineData(nameof(ConvertingEntity.PhysicalAddressToNullableBytes), "varbinary(8)", false)]
[InlineData(nameof(ConvertingEntity.NumberToString), "varchar(64)", false)]
[InlineData(nameof(ConvertingEntity.NumberToNullableString), "varchar(64)", false)]
[InlineData(nameof(ConvertingEntity.NumberToBytes), "varbinary(1)", false)]
[InlineData(nameof(ConvertingEntity.NumberToNullableBytes), "varbinary(1)", false)]
[InlineData(nameof(ConvertingEntity.StringToBool), "tinyint(1)", false)]
[InlineData(nameof(ConvertingEntity.StringToNullableBool), "tinyint(1)", false)]
[InlineData(nameof(ConvertingEntity.StringToBytes), "longblob", false)]
[InlineData(nameof(ConvertingEntity.StringToNullableBytes), "longblob", false)]
[InlineData(nameof(ConvertingEntity.StringToChar), "varchar(1)", false)]
[InlineData(nameof(ConvertingEntity.StringToNullableChar), "varchar(1)", false)]
[InlineData(nameof(ConvertingEntity.StringToDateTime), "datetime(6)", false)]
[InlineData(nameof(ConvertingEntity.StringToNullableDateTime), "datetime(6)", false)]
// [InlineData(nameof(ConvertingEntity.StringToDateTimeOffset), "datetime(6)", false)]
// [InlineData(nameof(ConvertingEntity.StringToNullableDateTimeOffset), "datetime(6)", false)]
[InlineData(nameof(ConvertingEntity.StringToEnum), "smallint unsigned", false)]
[InlineData(nameof(ConvertingEntity.StringToNullableEnum), "smallint unsigned", false)]
[InlineData(nameof(ConvertingEntity.StringToGuid), "char(36)", false)]
[InlineData(nameof(ConvertingEntity.StringToNullableGuid), "char(36)", false)]
[InlineData(nameof(ConvertingEntity.StringToNumber), "tinyint unsigned", false)]
[InlineData(nameof(ConvertingEntity.StringToNullableNumber), "tinyint unsigned", false)]
[InlineData(nameof(ConvertingEntity.StringToTimeSpan), "time(6)", false)]
[InlineData(nameof(ConvertingEntity.StringToNullableTimeSpan), "time(6)", false)]
[InlineData(nameof(ConvertingEntity.TimeSpanToTicks), "bigint", false)]
[InlineData(nameof(ConvertingEntity.TimeSpanToNullableTicks), "bigint", false)]
[InlineData(nameof(ConvertingEntity.TimeSpanToString), "varchar(48)", false)]
[InlineData(nameof(ConvertingEntity.TimeSpanToNullableString), "varchar(48)", false)]
[InlineData(nameof(ConvertingEntity.UriToString), "longtext", false)]
[InlineData(nameof(ConvertingEntity.UriToNullableString), "longtext", false)]
[InlineData(nameof(ConvertingEntity.NullableCharAsString), "varchar(1)", true)]
[InlineData(nameof(ConvertingEntity.NullableCharAsNullableString), "varchar(1)", true)]
[InlineData(nameof(ConvertingEntity.NullableBoolAsChar), "varchar(1)", true)]
[InlineData(nameof(ConvertingEntity.NullableBoolAsNullableChar), "varchar(1)", true)]
[InlineData(nameof(ConvertingEntity.NullableBoolAsString), "varchar(3)", true)]
[InlineData(nameof(ConvertingEntity.NullableBoolAsNullableString), "varchar(3)", true)]
[InlineData(nameof(ConvertingEntity.NullableBoolAsInt), "int", true)]
[InlineData(nameof(ConvertingEntity.NullableBoolAsNullableInt), "int", true)]
[InlineData(nameof(ConvertingEntity.NullableIntAsLong), "bigint", true)]
[InlineData(nameof(ConvertingEntity.NullableIntAsNullableLong), "bigint", true)]
[InlineData(nameof(ConvertingEntity.NullableBytesAsString), "longtext", true)]
[InlineData(nameof(ConvertingEntity.NullableBytesAsNullableString), "longtext", true)]
[InlineData(nameof(ConvertingEntity.NullableDateTimeOffsetToBinary), "bigint", true)]
[InlineData(nameof(ConvertingEntity.NullableDateTimeOffsetToNullableBinary), "bigint", true)]
[InlineData(nameof(ConvertingEntity.NullableDateTimeOffsetToString), "varchar(48)", true)]
[InlineData(nameof(ConvertingEntity.NullableDateTimeOffsetToNullableString), "varchar(48)", true)]
[InlineData(nameof(ConvertingEntity.NullableDateTimeToBinary), "bigint", true)]
[InlineData(nameof(ConvertingEntity.NullableDateTimeToNullableBinary), "bigint", true)]
[InlineData(nameof(ConvertingEntity.NullableDateTimeToString), "varchar(48)", true)]
[InlineData(nameof(ConvertingEntity.NullableDateTimeToNullableString), "varchar(48)", true)]
[InlineData(nameof(ConvertingEntity.NullableEnumToString), "longtext", true)]
[InlineData(nameof(ConvertingEntity.NullableEnumToNullableString), "longtext", true)]
[InlineData(nameof(ConvertingEntity.NullableEnumToNumber), "bigint", true)]
[InlineData(nameof(ConvertingEntity.NullableEnumToNullableNumber), "bigint", true)]
[InlineData(nameof(ConvertingEntity.NullableGuidToString), "varchar(36)", true)]
[InlineData(nameof(ConvertingEntity.NullableGuidToNullableString), "varchar(36)", true)]
[InlineData(nameof(ConvertingEntity.NullableGuidToBytes), "varbinary(16)", true)]
[InlineData(nameof(ConvertingEntity.NullableGuidToNullableBytes), "varbinary(16)", true)]
[InlineData(nameof(ConvertingEntity.NullableIPAddressToString), "varchar(45)", true)]
[InlineData(nameof(ConvertingEntity.NullableIPAddressToNullableString), "varchar(45)", true)]
[InlineData(nameof(ConvertingEntity.NullableIPAddressToBytes), "varbinary(16)", true)]
[InlineData(nameof(ConvertingEntity.NullableIPAddressToNullableBytes), "varbinary(16)", true)]
[InlineData(nameof(ConvertingEntity.NullablePhysicalAddressToString), "varchar(20)", true)]
[InlineData(nameof(ConvertingEntity.NullablePhysicalAddressToNullableString), "varchar(20)", true)]
[InlineData(nameof(ConvertingEntity.NullablePhysicalAddressToBytes), "varbinary(8)", true)]
[InlineData(nameof(ConvertingEntity.NullablePhysicalAddressToNullableBytes), "varbinary(8)", true)]
[InlineData(nameof(ConvertingEntity.NullableNumberToString), "varchar(64)", true)]
[InlineData(nameof(ConvertingEntity.NullableNumberToNullableString), "varchar(64)", true)]
[InlineData(nameof(ConvertingEntity.NullableNumberToBytes), "varbinary(1)", true)]
[InlineData(nameof(ConvertingEntity.NullableNumberToNullableBytes), "varbinary(1)", true)]
[InlineData(nameof(ConvertingEntity.NullableStringToBool), "tinyint(1)", true)]
[InlineData(nameof(ConvertingEntity.NullableStringToNullableBool), "tinyint(1)", true)]
[InlineData(nameof(ConvertingEntity.NullableStringToBytes), "longblob", true)]
[InlineData(nameof(ConvertingEntity.NullableStringToNullableBytes), "longblob", true)]
[InlineData(nameof(ConvertingEntity.NullableStringToChar), "varchar(1)", true)]
[InlineData(nameof(ConvertingEntity.NullableStringToNullableChar), "varchar(1)", true)]
[InlineData(nameof(ConvertingEntity.NullableStringToDateTime), "datetime(6)", true)]
[InlineData(nameof(ConvertingEntity.NullableStringToNullableDateTime), "datetime(6)", true)]
// [InlineData(nameof(ConvertingEntity.NullableStringToDateTimeOffset), "datetime(6)", true)]
// [InlineData(nameof(ConvertingEntity.NullableStringToNullableDateTimeOffset), "datetime(6)", true)]
[InlineData(nameof(ConvertingEntity.NullableStringToEnum), "smallint unsigned", true)]
[InlineData(nameof(ConvertingEntity.NullableStringToNullableEnum), "smallint unsigned", true)]
[InlineData(nameof(ConvertingEntity.NullableStringToGuid), "char(36)", true)]
[InlineData(nameof(ConvertingEntity.NullableStringToNullableGuid), "char(36)", true)]
[InlineData(nameof(ConvertingEntity.NullableStringToNumber), "tinyint unsigned", true)]
[InlineData(nameof(ConvertingEntity.NullableStringToNullableNumber), "tinyint unsigned", true)]
[InlineData(nameof(ConvertingEntity.NullableStringToTimeSpan), "time(6)", true)]
[InlineData(nameof(ConvertingEntity.NullableStringToNullableTimeSpan), "time(6)", true)]
[InlineData(nameof(ConvertingEntity.NullableTimeSpanToTicks), "bigint", true)]
[InlineData(nameof(ConvertingEntity.NullableTimeSpanToNullableTicks), "bigint", true)]
[InlineData(nameof(ConvertingEntity.NullableTimeSpanToString), "varchar(48)", true)]
[InlineData(nameof(ConvertingEntity.NullableTimeSpanToNullableString), "varchar(48)", true)]
[InlineData(nameof(ConvertingEntity.NullableUriToString), "longtext", true)]
[InlineData(nameof(ConvertingEntity.NullableUriToNullableString), "longtext", true)]
[InlineData(nameof(ConvertingEntity.NullStringToNonNullString), "longtext", false)]
[InlineData(nameof(ConvertingEntity.NonNullStringToNullString), "longtext", true)]
public virtual void Properties_with_conversions_map_to_appropriately_null_columns(
string propertyName,
string databaseType,
bool isNullable)
{
using var context = CreateContext();
var property = context.Model.FindEntityType(typeof(ConvertingEntity))!.FindProperty(propertyName);
Assert.Equal(databaseType, property!.GetColumnType());
Assert.Equal(isNullable, property!.IsNullable);
}
public class ValueConvertersEndToEndMySqlFixture : ValueConvertersEndToEndFixtureBase
{
protected override ITestStoreFactory TestStoreFactory
=> MySqlTestStoreFactory.Instance;
protected override void OnModelCreating(ModelBuilder modelBuilder, DbContext context)
{
base.OnModelCreating(modelBuilder, context);
modelBuilder.Entity<ConvertingEntity>(
b =>
{
// We map DateTimeOffset to MySQL's 'datetime(6)', which doesn't store the time zone.
// Therefore, lossless round-tripping is impossible.
b.Ignore(e => e.StringToDateTimeOffset);
b.Ignore(e => e.StringToNullableDateTimeOffset);
b.Ignore(e => e.NullableStringToDateTimeOffset);
b.Ignore(e => e.NullableStringToNullableDateTimeOffset);
});
}
}
}
}
#nullable restore
```
|
Oregon Route 332 (OR 332) is an Oregon state highway running from the Washington state line near Umapine to OR 11 near Milton-Freewater. OR 332 is known as the Sunnyside-Umapine Highway No. 332 (see Oregon highways and routes). It is approximately eight miles long and runs east–west, entirely within Umatilla County.
OR 332 was established in 2003 as part of Oregon's project to assign route numbers to highways that previously were not assigned.
Route description
OR 332 begins at an intersection with State Line Road on the Washington state line two miles (3 km) north of Umapine and heads south and then east toward Milton-Freewater, passing through Sunnyside. Near Milton-Freewater, OR 332 crosses OR 339 and proceeds east. Approximately one mile north of Milton-Freewater, OR 332 ends at an intersection with OR 11.
History
OR 332 was assigned to the Sunnyside-Umapine Highway in 2003.
Major intersections
References
332
Transportation in Umatilla County, Oregon
|
```xml
<?xml version="1.0" encoding="utf-8"?>
<resources>
<string name="app_name">Simple Calendar</string>
<string name="app_launcher_name">Calendario</string>
<string name="change_view">Cambiar vista</string>
<string name="daily_view">Vista diaria</string>
<string name="weekly_view">Vista semanal</string>
<string name="monthly_view">Vista mensual</string>
<string name="monthly_daily_view">Vista mensual y diaria</string>
<string name="yearly_view">Vista anual</string>
<string name="simple_event_list">Lista de eventos sencilla</string>
<string name="no_upcoming_events">No hay prximos eventos.</string>
<string name="go_to_today">Ir al da de hoy</string>
<string name="go_to_date">Ir a la fecha</string>
<!-- Widget titles -->
<string name="widget_monthly">Calendario mensual</string>
<string name="widget_list">Lista de eventos del calendario</string>
<string name="widget_todays_date">Calendario de hoy</string>
<!-- Event -->
<string name="event">Evento</string>
<string name="edit_event">Editar evento</string>
<string name="new_event">Nuevo evento</string>
<string name="create_new_event">Crear un nuevo evento</string>
<string name="duplicate_event">Duplicar un evento</string>
<string name="title_empty">El ttulo no puede estar vaco</string>
<string name="end_before_start">El evento no puede acabar antes de iniciarse</string>
<string name="event_added">El evento se ha aadido correctamente</string>
<string name="event_updated">El evento se ha actualizado correctamente</string>
<string name="filter_events_by_type">Filtrar eventos por tipo</string>
<string name="please_fill_location">Introduce una ubicacin para mostrar en el mapa</string>
<string name="public_event_notification_text">Hay un evento prximo</string>
<string name="everything_filtered_out">Ha filtrado todos los tipos de cita</string>
<string name="event_color">Event color</string>
<string name="default_calendar_color">Default calendar color</string>
<!-- Tasks -->
<string name="task">Tarea</string>
<string name="tasks">Tareas</string>
<string name="edit_task">Editar tarea</string>
<string name="new_task">Nueva tarea</string>
<string name="create_new_task">Crear una nueva tarea</string>
<string name="duplicate_task">Duplicar tarea</string>
<string name="mark_completed">Marcar como completada</string>
<string name="mark_incomplete">Marcar como no completada</string>
<string name="task_color">Color de la tarea</string>
<!-- Event Repetition -->
<string name="repetition">Repetir</string>
<string name="no_repetition">No repetir</string>
<string name="daily">Diariamente</string>
<string name="weekly">Semanalmente</string>
<string name="monthly">Mensualmente</string>
<string name="yearly">Anualmente</string>
<string name="weeks_raw">semanas</string>
<string name="months_raw">meses</string>
<string name="years_raw">aos</string>
<string name="repeat_till">Repetir hasta</string>
<string name="forever">Siempre</string>
<string name="event_is_repeatable">Este evento se repite</string>
<string name="task_is_repeatable">La tarea se puede repetir</string>
<string name="selection_contains_repetition">La seleccin contiene repeticin de eventos</string>
<string name="delete_one_only">Eliminar solo el evento seleccionado</string>
<string name="delete_future_occurrences">Eliminar el evento y repeticiones futuras</string>
<string name="delete_all_occurrences">Eliminar todos los eventos</string>
<string name="update_one_only">Actualizar solo el evento seleccionado</string>
<string name="update_this_and_future_occurrences">Actualizar este evento y repeticiones futuras</string>
<string name="update_all_occurrences">Actualizar todos los eventos</string>
<string name="repeat_till_date">Repetir hasta la fecha</string>
<string name="stop_repeating_after_x">Repetir un nmero de ocasiones</string>
<string name="repeat_forever">Repetir para siempre</string>
<string name="times">veces</string>
<string name="repeat">Repetir</string>
<string name="repeat_on">Repetir</string>
<string name="selected_days">Los das seleccionados</string>
<string name="the_same_day">El mismo da</string>
<string name="the_last_day">El ltimo da</string>
<string name="repeat_on_the_same_day_monthly">Repetir el mismo da cada mes</string>
<string name="repeat_on_the_last_day_monthly">Repetir el ltimo da del mes</string>
<string name="repeat_on_the_same_day_yearly">Repetir el mismo da cada ao</string>
<string name="repeat_every_m">Repetir cada</string>
<string name="every_m">Cada</string>
<string name="first_m">primero</string>
<string name="second_m">segundo</string>
<string name="third_m">tercero</string>
<string name="fourth_m">cuarto</string>
<string name="fifth_m">quinto</string>
<string name="last_m">ltimo</string>
<!-- alternative versions for some languages, use the same translations if you are not sure what this means -->
<!-- used in repetition, like "Every first Sunday" -->
<string name="repeat_every_f">Repetir cada</string>
<string name="every_f">Cada</string>
<string name="first_f">primera</string>
<string name="second_f">segunda</string>
<string name="third_f">tercera</string>
<string name="fourth_f">cuarta</string>
<string name="fifth_f">quinta</string>
<string name="last_f">ltima</string>
<!-- Birthdays -->
<string name="birthdays">Cumpleaos</string>
<string name="add_birthdays">Aadir cumpleaos de contactos</string>
<string name="no_birthdays">No se han encontrado cumpleaos</string>
<string name="no_new_birthdays">No se han encontrado nuevos cumpleaos</string>
<string name="birthdays_added">Los cumpleaos se han aadido correctamente</string>
<string name="add_birthdays_automatically">Agregar nuevos cumpleaos automticamente</string>
<!-- Anniversaries -->
<string name="anniversaries">Aniversarios</string>
<string name="add_anniversaries">Aadir aniversarios de contactos</string>
<string name="no_anniversaries">No se han encontrado aniversarios</string>
<string name="no_new_anniversaries">No se han encontrado nuevos aniversarios</string>
<string name="anniversaries_added">Los aniversarios se han aadido correctamente</string>
<string name="add_anniversaries_automatically">Agregar nuevos aniversarios automticamente</string>
<!-- Event Reminders -->
<string name="reminder">Recordatorio</string>
<string name="before">antes</string>
<string name="add_another_reminder">Agregar otro recordatorio</string>
<string name="event_reminders">Recordatorios de eventos</string>
<string name="reminders">Recordatorios</string>
<!-- Event attendees -->
<string name="add_another_attendee">Aadir otros asistentes</string>
<string name="my_status">Estado:</string>
<string name="going">Ir</string>
<string name="not_going">No ir</string>
<string name="maybe_going">Quizs</string>
<string name="invited">Invitado</string>
<!-- Time zones -->
<string name="enter_a_country">Introduce un pas o zona horaria</string>
<!-- Export / Import -->
<string name="import_events">Importar eventos</string>
<string name="export_events">Exportar eventos</string>
<string name="import_events_from_ics">Importar eventos desde un archivo .ics</string>
<string name="import_events_from_ics_pro">Importar eventos desde un archivo .ics (Pro)</string>
<string name="export_events_to_ics">Exportar eventos a un archivo .ics</string>
<string name="default_event_type">Tipo de evento predeterminado</string>
<string name="export_past_events_too">Exportar tambin eventos pasados</string>
<string name="export_tasks">Exportar las tareas</string>
<string name="export_past_entries">Exportar entradas expiradas tambin</string>
<string name="include_event_types">Incluir tipos de evento</string>
<string name="filename_without_ics">Nombre del archivo (sin extensin .ics)</string>
<string name="ignore_event_types">Ignorar los tipos de evento del archivo, usar siempre el predeterminado</string>
<!-- Event details -->
<string name="location">Ubicacin</string>
<string name="description">Descripcin</string>
<string name="all_day">Todo el da</string>
<!-- Weekly view -->
<string name="week">Semana</string>
<string name="start_week_with_current_day">Comenzar la semana con el da actual</string>
<!-- Event types -->
<string name="event_types">Tipos de evento</string>
<string name="add_new_type">Agregar un nuevo tipo de evento</string>
<string name="edit_type">Editar un tipo de evento</string>
<string name="type_already_exists">Ya existe un tipo de evento con este nombre</string>
<string name="color">Color</string>
<string name="regular_event">Evento regular</string>
<string name="cannot_delete_default_type">No se puede eliminar el tipo de evento predeterminado</string>
<string name="select_event_type">Selecciona un tipo de evento</string>
<string name="move_events_into_default">Establecer los eventos seleccionados con el tipo de evento predeterminado</string>
<string name="remove_affected_events">Eliminar permanentemente los eventos seleccionados</string>
<string name="unsync_caldav_calendar">Desactiva la sincronizacin para eliminar un calendario CalDAV</string>
<!-- Holidays -->
<string name="holidays">Festivos</string>
<string name="add_holidays">Aadir festivos</string>
<string name="national_holidays">Fiestas nacionales</string>
<string name="religious_holidays">Fiestas regionales</string>
<string name="holidays_imported_successfully">Los das festivos se han importado como eventos tipo \"Festivos\"</string>
<string name="importing_some_holidays_failed">Se ha producido un error al importar eventos</string>
<string name="importing_holidays_failed">Se ha producido un error al importar los das festivos</string>
<!-- Settings -->
<string name="manage_event_types">Gestionar tipos de evento</string>
<string name="start_day_at">Empezar el da a las</string>
<string name="end_day_at">Terminar el da a las</string>
<string name="midnight_spanning">Mostrar los eventos que se prolongan pasada la medianoche en la barra superior</string>
<string name="allow_customizing_day_count">Permitir personalizar el nmero de das</string>
<string name="week_numbers">Mostrar el nmero de semana</string>
<string name="vibrate">Vibrar en recibir notificaciones de recordatorio</string>
<string name="reminder_sound">Sonido de recordatorio</string>
<string name="no_ringtone_picker">No se ha encontrado ninguna aplicacin capaz de establecer el tono de llamada</string>
<string name="no_ringtone_selected">Ninguno</string>
<string name="day_end_before_start">El da no puede terminar antes de que comience</string>
<string name="caldav_sync">Sincronizar CalDAV</string>
<string name="event_lists">Listas de eventos</string>
<string name="display_past_events">Mostrar eventos pasados</string>
<string name="replace_description_with_location">Usar la ubicacin como descripcin del evento</string>
<string name="display_description_or_location">Mostrar descripcin o ubicacin</string>
<string name="delete_all_events">Borrar todos los eventos</string>
<string name="delete_all_events_and_tasks">Borrar todos los eventos y tareas</string>
<string name="delete_all_events_confirmation">Ests seguro de que quieres borrar todos los eventos y tareas\? Esto dejar intactos tus tipos de eventos y otros ajustes.</string>
<string name="show_a_grid">Mostrar cuadrcula</string>
<string name="loop_reminders">Repetir recordatorios hasta ser descartados</string>
<string name="dim_past_events">Atenuar eventos pasados</string>
<string name="dim_completed_tasks">Atenuar tareas completadas</string>
<string name="events">Eventos</string>
<string name="reminder_stream">Tipo de sonido usado en recordatorios</string>
<string name="system_stream">Sistema</string>
<string name="alarm_stream">Alarma</string>
<string name="notification_stream">Notificacin</string>
<string name="ring_stream">Llamada</string>
<string name="use_last_event_reminders">Reusar el ltimo recordatorio para nuevos eventos</string>
<string name="default_reminder_1">Recordatorio 1</string>
<string name="default_reminder_2">Recordatorio 2</string>
<string name="default_reminder_3">Recordatorio 3</string>
<string name="view_to_open_from_widget">Vista por defecto al abrir desde el widget</string>
<string name="last_view">ltima vista</string>
<string name="new_events">Nuevos eventos</string>
<string name="default_start_time">Hora de inicio predeterminada</string>
<string name="next_full_hour">Prxima hora</string>
<string name="current_time">Hora actual</string>
<string name="default_duration">Duracin predeterminada</string>
<string name="last_used_one">Igual que la ltima vez</string>
<string name="other_time">Otro momento</string>
<string name="highlight_weekends">Resaltar los fines de semana en algunas vistas</string>
<string name="highlight_weekends_color">Color de los fines de semana resaltados</string>
<string name="allow_changing_time_zones">Permitir cambiar la zona horaria del evento</string>
<string name="manage_quick_filter_event_types">Administrar tipos de evento de filtro rpido</string>
<string name="allow_creating_tasks">Permitir crear tareas</string>
<!-- CalDAV sync -->
<string name="caldav">CalDAV</string>
<string name="select_caldav_calendars">Seleccionar los calendarios que se van a sincronizar</string>
<string name="manage_synced_calendars">Gestionar los calendarios sincronizados</string>
<string name="store_locally_only">Solo almacenar localmente</string>
<string name="refresh_caldav_calendars">Actualizar los calendarios CalDAV</string>
<string name="refreshing">Actualizando</string>
<string name="refreshing_complete">Se ha completado la actualizacin</string>
<string name="editing_calendar_failed">No se ha podido editar el calendario</string>
<string name="syncing">Sincronizando</string>
<string name="synchronization_completed">Se ha completado la sincronizacin</string>
<string name="select_a_different_caldav_color">Seleccionar un color diferente (se aplica a nivel local)</string>
<string name="insufficient_permissions">No tienes permiso para modificar el calendario seleccionado</string>
<string name="caldav_event_not_found">Evento no encontrado. Habilita la sincronizacin de CalDAV de los calendarios correspondientes en la configuracin.</string>
<string name="no_synchronized_calendars">No se han encontrado calendarios para sincronizar</string>
<string name="status_free">Libre</string>
<string name="status_busy">Ocupado</string>
<string name="fetching_event_failed">Fallo en la obtencin del evento %s</string>
<!-- alternative versions for some languages, use the same translations if you are not sure what this means -->
<!-- used in repetition, like "Every last Sunday" -->
<string name="monday_alt">lunes</string>
<string name="tuesday_alt">martes</string>
<string name="wednesday_alt">mircoles</string>
<string name="thursday_alt">jueves</string>
<string name="friday_alt">viernes</string>
<string name="saturday_alt">sbado</string>
<string name="sunday_alt">domingo</string>
<!-- List widget config example events -->
<string name="sample_title_1">Ejercicio</string>
<string name="sample_description_1">Da de ejercitar piernas</string>
<string name="sample_title_2">Reunin con John</string>
<string name="sample_description_2">En el jardn de Rockstone</string>
<string name="sample_title_3">Biblioteca</string>
<string name="sample_title_4">Comer con Mara</string>
<string name="sample_description_4">En la plaza</string>
<string name="sample_title_5">Hora del caf</string>
<!-- List widget config -->
<string name="show_events_happening">Mostrar los eventos que ocurren:</string>
<string name="within_the_next_one_year">Durante el prximo ao</string>
<string name="today_only">Solo hoy</string>
<string name="within_the_next">Durante el prximo</string>
<plurals name="within_the_next_days">
<item quantity="one">Durante el prximo %d da</item>
<item quantity="many">Durante los prximos %d das</item>
<item quantity="other">Durante los prximos %d das</item>
</plurals>
<plurals name="within_the_next_weeks">
<item quantity="one">Durante la prxima %d semana</item>
<item quantity="many">Durante las prximas %d semanas</item>
<item quantity="other">Durante las prximas %d semanas</item>
</plurals>
<plurals name="within_the_next_months">
<item quantity="one">En el prximo mes %d</item>
<item quantity="many">En los prximos meses %d</item>
<item quantity="other">En los prximos meses %d</item>
</plurals>
<!-- FAQ -->
<string name="faq_1_title">Cmo puedo eliminar los festivos importados a travs del botn \"Aadir festivos\"\?</string>
<string name="faq_1_text">A los eventos creados de esta forma se les asigna el tipo de evento \"Festivos\". En Ajustes -> Gestionar tipos de evento, mantn pulsado el tipo de evento para seleccionarlo y elimnalo pulsando en la papelera.</string>
<string name="faq_2_title">Puedo sincronizar eventos a travs de Google Calendar u otros servicios compatibles con CalDAV\?</string>
<string name="faq_2_title_extra">Quizs incluso pueda compartir los calendarios con otras personas\?</string>
<string name="faq_2_text">S, simplemente activa la opcin \"Sincronizar CalDAV\" en los ajustes de la aplicacin y selecciona los calendarios que quieras sincronizar. Sin embargo, har falta una aplicacin de terceros para sincronizar el dispositivo con los servidores. Si quieres sincronizar un calendario de Google, utiliza la aplicacin de calendario oficial. Para otros calendarios, necesitars una aplicacin de terceros para sincronizarlos, por ejemplo, DAVx5.</string>
<string name="faq_3_title">Veo las notificaciones, pero no suenan. Qu puedo hacer\?</string>
<string name="faq_3_text">Tanto las notificaciones como el sonido de notificacin dependen del sistema en gran parte. Si no suenan las notificaciones, entra en los ajustes de la aplicacin, pulsa en la opcin de \"Tipo de sonido usado en recordatorios\" y cmbialo a una opcin diferente. Si contina fallando, comprueba en las opciones de sonido que la opcin seleccionada no est silenciada.</string>
<string name="faq_4_title">La aplicacin admite zonas horarias\?</string>
<string name="faq_4_text">S. Por defecto todos los eventos se crean en tu zona horaria actual. Si quieres cambiar la zona horaria de un evento, primero activa la opcin de Permitir cambiar la zona horaria en la configuracin de la aplicacin, luego, selecciona la zona horaria en la ventana de Detalles del evento. Es una opcin desactivada por defecto porque la mayora de personas no lo necesitan.</string>
<string name="faq_5_title">Por qu no aparece ninguna notificacin\?</string>
<string name="faq_5_text">Comprueba la batera y las opciones de notificacin, asegrate de que los recordatorios no estn bloqueados y de que se permita la ejecucin de la aplicacin en segundo plano. En esta pgina web <a href=path_to_url encontrars consejos tiles.</string>
<string name="faq_6_title">Cmo puedo modificar o eliminar un tipo de evento\?</string>
<string name="faq_6_text">Puede hacer ambas cosas en la aplicacin Configuracin - Administrar tipos de eventos. Simplemente haga clic en el elemento deseado para cambiar la etiqueta y el color, o seleccione el elemento deseado presionndolo prolongadamente y use la papelera en el men superior para eliminarlo.</string>
<!--
Haven't found some strings? There's more at
path_to_url
-->
</resources>
```
|
```c++
/*
* AndroidCanvas.cpp
*
*/
#include "AndroidCanvas.h"
#include "AndroidApp.h"
#include "AndroidInputEventHandler.h"
#include "../../Core/CoreUtils.h"
#include <LLGL/Platform/NativeHandle.h>
namespace LLGL
{
/*
* Surface class
*/
bool Surface::ProcessEvents()
{
if (android_app* app = AndroidApp::Get().GetState())
{
/* Poll all Android app events */
int ident = 0, events = 0;
android_poll_source* source = nullptr;
while ((ident = ALooper_pollAll(0, nullptr, &events, reinterpret_cast<void**>(&source))) >= 0)
{
/* Process the event */
if (source != nullptr)
source->process(app, source);
/* Check if we are exiting */
if (app->destroyRequested != 0)
return false;
}
return true;
}
return false;
}
/*
* Canvas class
*/
std::unique_ptr<Canvas> Canvas::Create(const CanvasDescriptor& desc)
{
return MakeUnique<AndroidCanvas>(desc);
}
/*
* AndroidCanvas class
*/
AndroidCanvas::AndroidCanvas(const CanvasDescriptor& desc) :
desc_ { desc },
window_ { AndroidApp::Get().GetState()->window }
{
AndroidInputEventHandler::Get().RegisterCanvas(this);
}
AndroidCanvas::~AndroidCanvas()
{
AndroidInputEventHandler::Get().UnregisterCanvas(this);
}
bool AndroidCanvas::GetNativeHandle(void* nativeHandle, std::size_t nativeHandleSize)
{
if (nativeHandle != nullptr && nativeHandleSize == sizeof(NativeHandle))
{
auto* handle = reinterpret_cast<NativeHandle*>(nativeHandle);
handle->window = window_;
return true;
}
return false;
}
Extent2D AndroidCanvas::GetContentSize() const
{
return AndroidApp::GetContentRectSize(AndroidApp::Get().GetState());
}
void AndroidCanvas::SetTitle(const UTF8String& title)
{
//todo...
}
UTF8String AndroidCanvas::GetTitle() const
{
return {}; //todo...
}
void AndroidCanvas::UpdateNativeWindow(android_app* app)
{
window_ = (app != nullptr ? app->window : nullptr);
}
} // /namespace LLGL
// ================================================================================
```
|
```yaml
models:
- columns:
- name: id
tests:
- unique
- not_null
- relationships:
field: id
to: ref('node_0')
name: node_1856
version: 2
```
|
```objective-c
/**
*
*/
#pragma once
#include <stdint.h>
#ifdef __cplusplus
extern "C" {
#endif
/** Group: Configuration Registers */
/** Type of mode register
* TWAI mode register.
*/
typedef union {
struct {
/** reset_mode : R/W; bitpos: [0]; default: 1;
* 1: reset, detection of a set reset mode bit results in aborting the current
* transmission/reception of a message and entering the reset mode. 0: normal, on the
* '1-to-0' transition of the reset mode bit, the TWAI controller returns to the
* operating mode.
*/
uint32_t reset_mode:1;
/** listen_only_mode : R/W; bitpos: [1]; default: 0;
* 1: listen only, in this mode the TWAI controller would give no acknowledge to the
* TWAI-bus, even if a message is received successfully. The error counters are
* stopped at the current value. 0: normal.
*/
uint32_t listen_only_mode:1;
/** self_test_mode : R/W; bitpos: [2]; default: 0;
* 1: self test, in this mode a full node test is possible without any other active
* node on the bus using the self reception request command. The TWAI controller will
* perform a successful transmission, even if there is no acknowledge received. 0:
* normal, an acknowledge is required for successful transmission.
*/
uint32_t self_test_mode:1;
/** acceptance_filter_mode : R/W; bitpos: [3]; default: 0;
* 1:single, the single acceptance filter option is enabled (one filter with the
* length of 32 bit is active). 0:dual, the dual acceptance filter option is enabled
* (two filters, each with the length of 16 bit are active).
*/
uint32_t acceptance_filter_mode:1;
uint32_t reserved_4:28;
};
uint32_t val;
} twai_mode_reg_t;
/** Type of cmd register
* TWAI command register.
*/
typedef union {
struct {
/** tx_request : WO; bitpos: [0]; default: 0;
* 1: present, a message shall be transmitted. 0: absent
*/
uint32_t tx_request:1;
/** abort_tx : WO; bitpos: [1]; default: 0;
* 1: present, if not already in progress, a pending transmission request is
* cancelled. 0: absent
*/
uint32_t abort_tx:1;
/** release_buffer : WO; bitpos: [2]; default: 0;
* 1: released, the receive buffer, representing the message memory space in the
* RXFIFO is released. 0: no action
*/
uint32_t release_buffer:1;
/** clear_data_overrun : WO; bitpos: [3]; default: 0;
* 1: clear, the data overrun status bit is cleared. 0: no action.
*/
uint32_t clear_data_overrun:1;
/** self_rx_request : WO; bitpos: [4]; default: 0;
* 1: present, a message shall be transmitted and received simultaneously. 0: absent.
*/
uint32_t self_rx_request:1;
uint32_t reserved_5:27;
};
uint32_t val;
} twai_cmd_reg_t;
/** Type of bus_timing_0 register
* Bit timing configuration register 0.
*/
typedef union {
struct {
/** baud_presc : R/W; bitpos: [13:0]; default: 0;
* The period of the TWAI system clock is programmable and determines the individual
* bit timing. Software has R/W permission in reset mode and RO permission in
* operation mode.
*/
uint32_t baud_presc:14;
/** sync_jump_width : R/W; bitpos: [15:14]; default: 0;
* The synchronization jump width defines the maximum number of clock cycles a bit
* period may be shortened or lengthened. Software has R/W permission in reset mode
* and RO in operation mode.
*/
uint32_t sync_jump_width:2;
uint32_t reserved_16:16;
};
uint32_t val;
} twai_bus_timing_0_reg_t;
/** Type of bus_timing_1 register
* Bit timing configuration register 1.
*/
typedef union {
struct {
/** time_segment1 : R/W; bitpos: [3:0]; default: 0;
* The number of clock cycles in TSEG1 per bit timing. Software has R/W permission in
* reset mode and RO in operation mode.
*/
uint32_t time_segment1:4;
/** time_segment2 : R/W; bitpos: [6:4]; default: 0;
* The number of clock cycles in TSEG2 per bit timing. Software has R/W permission in
* reset mode and RO in operation mode.
*/
uint32_t time_segment2:3;
/** time_sampling : R/W; bitpos: [7]; default: 0;
* 1: triple, the bus is sampled three times. 0: single, the bus is sampled once.
* Software has R/W permission in reset mode and RO in operation mode.
*/
uint32_t time_sampling:1;
uint32_t reserved_8:24;
};
uint32_t val;
} twai_bus_timing_1_reg_t;
/** Type of err_warning_limit register
* TWAI error threshold configuration register.
*/
typedef union {
struct {
/** err_warning_limit : R/W; bitpos: [7:0]; default: 96;
* The threshold that trigger error warning interrupt when this interrupt is enabled.
* Software has R/W permission in reset mode and RO in operation mode.
*/
uint32_t err_warning_limit:8;
uint32_t reserved_8:24;
};
uint32_t val;
} twai_err_warning_limit_reg_t;
/** Type of clock_divider register
* Clock divider register.
*/
typedef union {
struct {
/** cd : R/W; bitpos: [7:0]; default: 0;
* These bits are used to define the frequency at the external CLKOUT pin.
*/
uint32_t cd:8;
/** clock_off : R/W; bitpos: [8]; default: 0;
* 1: Disable the external CLKOUT pin. 0: Enable the external CLKOUT pin. Software has
* R/W permission in reset mode and RO in operation mode.
*/
uint32_t clock_off:1;
uint32_t reserved_9:23;
};
uint32_t val;
} twai_clock_divider_reg_t;
/** Type of sw_standby_cfg register
* Software configure standby pin directly.
*/
typedef union {
struct {
/** sw_standby_en : R/W; bitpos: [0]; default: 0;
* Enable standby pin.
*/
uint32_t sw_standby_en:1;
/** sw_standby_clr : R/W; bitpos: [1]; default: 1;
* Clear standby pin.
*/
uint32_t sw_standby_clr:1;
uint32_t reserved_2:30;
};
uint32_t val;
} twai_sw_standby_cfg_reg_t;
/** Type of hw_cfg register
* Hardware configure standby pin.
*/
typedef union {
struct {
/** hw_standby_en : R/W; bitpos: [0]; default: 0;
* Enable function that hardware control standby pin.
*/
uint32_t hw_standby_en:1;
uint32_t reserved_1:31;
};
uint32_t val;
} twai_hw_cfg_reg_t;
/** Type of hw_standby_cnt register
* Configure standby counter.
*/
typedef union {
struct {
/** standby_wait_cnt : R/W; bitpos: [31:0]; default: 1;
* Configure the number of cycles before standby becomes high when TWAI_HW_STANDBY_EN
* is enabled.
*/
uint32_t standby_wait_cnt:32;
};
uint32_t val;
} twai_hw_standby_cnt_reg_t;
/** Type of idle_intr_cnt register
* Configure idle interrupt counter.
*/
typedef union {
struct {
/** idle_intr_cnt : R/W; bitpos: [31:0]; default: 1;
* Configure the number of cycles before triggering idle interrupt.
*/
uint32_t idle_intr_cnt:32;
};
uint32_t val;
} twai_idle_intr_cnt_reg_t;
/** Type of eco_cfg register
* ECO configuration register.
*/
typedef union {
struct {
/** rdn_ena : R/W; bitpos: [0]; default: 0;
* Enable eco module.
*/
uint32_t rdn_ena:1;
/** rdn_result : RO; bitpos: [1]; default: 1;
* Output of eco module.
*/
uint32_t rdn_result:1;
uint32_t reserved_2:30;
};
uint32_t val;
} twai_eco_cfg_reg_t;
/** Group: Status Registers */
/** Type of status register
* TWAI status register.
*/
typedef union {
struct {
/** status_receive_buffer : RO; bitpos: [0]; default: 0;
* 1: full, one or more complete messages are available in the RXFIFO. 0: empty, no
* message is available
*/
uint32_t status_receive_buffer:1;
/** status_overrun : RO; bitpos: [1]; default: 0;
* 1: overrun, a message was lost because there was not enough space for that message
* in the RXFIFO. 0: absent, no data overrun has occurred since the last clear data
* overrun command was given
*/
uint32_t status_overrun:1;
/** status_transmit_buffer : RO; bitpos: [2]; default: 0;
* 1: released, the CPU may write a message into the transmit buffer. 0: locked, the
* CPU cannot access the transmit buffer, a message is either waiting for transmission
* or is in the process of being transmitted
*/
uint32_t status_transmit_buffer:1;
/** status_transmission_complete : RO; bitpos: [3]; default: 0;
* 1: complete, last requested transmission has been successfully completed. 0:
* incomplete, previously requested transmission is not yet completed
*/
uint32_t status_transmission_complete:1;
/** status_receive : RO; bitpos: [4]; default: 0;
* 1: receive, the TWAI controller is receiving a message. 0: idle
*/
uint32_t status_receive:1;
/** status_transmit : RO; bitpos: [5]; default: 0;
* 1: transmit, the TWAI controller is transmitting a message. 0: idle
*/
uint32_t status_transmit:1;
/** status_err : RO; bitpos: [6]; default: 0;
* 1: error, at least one of the error counters has reached or exceeded the CPU
* warning limit defined by the Error Warning Limit Register (EWLR). 0: ok, both error
* counters are below the warning limit
*/
uint32_t status_err:1;
/** status_node_bus_off : RO; bitpos: [7]; default: 0;
* 1: bus-off, the TWAI controller is not involved in bus activities. 0: bus-on, the
* TWAI controller is involved in bus activities
*/
uint32_t status_node_bus_off:1;
/** status_miss : RO; bitpos: [8]; default: 0;
* 1: current message is destroyed because of FIFO overflow.
*/
uint32_t status_miss:1;
uint32_t reserved_9:23;
};
uint32_t val;
} twai_status_reg_t;
/** Type of arb_lost_cap register
* TWAI arbiter lost capture register.
*/
typedef union {
struct {
/** arbitration_lost_capture : RO; bitpos: [4:0]; default: 0;
* This register contains information about the bit position of losing arbitration.
*/
uint32_t arbitration_lost_capture:5;
uint32_t reserved_5:27;
};
uint32_t val;
} twai_arb_lost_cap_reg_t;
/** Type of err_code_cap register
* TWAI error info capture register.
*/
typedef union {
struct {
/** err_capture_code_segment : RO; bitpos: [4:0]; default: 0;
* This register contains information about the location of errors on the bus.
*/
uint32_t err_capture_code_segment:5;
/** err_capture_code_direction : RO; bitpos: [5]; default: 0;
* 1: RX, error occurred during reception. 0: TX, error occurred during transmission.
*/
uint32_t err_capture_code_direction:1;
/** err_capture_code_type : RO; bitpos: [7:6]; default: 0;
* 00: bit error. 01: form error. 10:stuff error. 11:other type of error.
*/
uint32_t err_capture_code_type:2;
uint32_t reserved_8:24;
};
uint32_t val;
} twai_err_code_cap_reg_t;
/** Type of rx_err_cnt register
* Rx error counter register.
*/
typedef union {
struct {
/** rx_err_cnt : R/W; bitpos: [7:0]; default: 0;
* The RX error counter register reflects the current value of the transmit error
* counter. Software has R/W permission in reset mode and RO in operation mode.
*/
uint32_t rx_err_cnt:8;
uint32_t reserved_8:24;
};
uint32_t val;
} twai_rx_err_cnt_reg_t;
/** Type of tx_err_cnt register
* Tx error counter register.
*/
typedef union {
struct {
/** tx_err_cnt : R/W; bitpos: [7:0]; default: 0;
* The TX error counter register reflects the current value of the transmit error
* counter. Software has R/W permission in reset mode and RO in operation mode.
*/
uint32_t tx_err_cnt:8;
uint32_t reserved_8:24;
};
uint32_t val;
} twai_tx_err_cnt_reg_t;
/** Type of rx_message_counter register
* Received message counter register.
*/
typedef union {
struct {
/** rx_message_counter : RO; bitpos: [6:0]; default: 0;
* Reflects the number of messages available within the RXFIFO. The value is
* incremented with each receive event and decremented by the release receive buffer
* command.
*/
uint32_t rx_message_counter:7;
uint32_t reserved_7:25;
};
uint32_t val;
} twai_rx_message_counter_reg_t;
/** Group: Interrupt Registers */
/** Type of interrupt register
* Interrupt signals' register.
*/
typedef union {
struct {
/** receive_int_st : RO; bitpos: [0]; default: 0;
* 1: this bit is set while the receive FIFO is not empty and the RIE bit is set
* within the interrupt enable register. 0: reset
*/
uint32_t receive_int_st:1;
/** transmit_int_st : RO; bitpos: [1]; default: 0;
* 1: this bit is set whenever the transmit buffer status changes from '0-to-1'
* (released) and the TIE bit is set within the interrupt enable register. 0: reset
*/
uint32_t transmit_int_st:1;
/** err_warning_int_st : RO; bitpos: [2]; default: 0;
* 1: this bit is set on every change (set and clear) of either the error status or
* bus status bits and the EIE bit is set within the interrupt enable register. 0:
* reset
*/
uint32_t err_warning_int_st:1;
/** data_overrun_int_st : RO; bitpos: [3]; default: 0;
* 1: this bit is set on a '0-to-1' transition of the data overrun status bit and the
* DOIE bit is set within the interrupt enable register. 0: reset
*/
uint32_t data_overrun_int_st:1;
uint32_t reserved_4:1;
/** err_passive_int_st : RO; bitpos: [5]; default: 0;
* 1: this bit is set whenever the TWAI controller has reached the error passive
* status (at least one error counter exceeds the protocol-defined level of 127) or if
* the TWAI controller is in the error passive status and enters the error active
* status again and the EPIE bit is set within the interrupt enable register. 0: reset
*/
uint32_t err_passive_int_st:1;
/** arbitration_lost_int_st : RO; bitpos: [6]; default: 0;
* 1: this bit is set when the TWAI controller lost the arbitration and becomes a
* receiver and the ALIE bit is set within the interrupt enable register. 0: reset
*/
uint32_t arbitration_lost_int_st:1;
/** bus_err_int_st : RO; bitpos: [7]; default: 0;
* 1: this bit is set when the TWAI controller detects an error on the TWAI-bus and
* the BEIE bit is set within the interrupt enable register. 0: reset
*/
uint32_t bus_err_int_st:1;
/** idle_int_st : RO; bitpos: [8]; default: 0;
* 1: this bit is set when the TWAI controller detects state of TWAI become IDLE and
* this interrupt enable bit is set within the interrupt enable register. 0: reset
*/
uint32_t idle_int_st:1;
uint32_t reserved_9:23;
};
uint32_t val;
} twai_interrupt_reg_t;
/** Type of interrupt_enable register
* Interrupt enable register.
*/
typedef union {
struct {
/** ext_receive_int_ena : R/W; bitpos: [0]; default: 0;
* 1: enabled, when the receive buffer status is 'full' the TWAI controller requests
* the respective interrupt. 0: disable
*/
uint32_t ext_receive_int_ena:1;
/** ext_transmit_int_ena : R/W; bitpos: [1]; default: 0;
* 1: enabled, when a message has been successfully transmitted or the transmit buffer
* is accessible again (e.g. after an abort transmission command), the TWAI controller
* requests the respective interrupt. 0: disable
*/
uint32_t ext_transmit_int_ena:1;
/** ext_err_warning_int_ena : R/W; bitpos: [2]; default: 0;
* 1: enabled, if the error or bus status change (see status register. Table 14), the
* TWAI controllerrequests the respective interrupt. 0: disable
*/
uint32_t ext_err_warning_int_ena:1;
/** ext_data_overrun_int_ena : R/W; bitpos: [3]; default: 0;
* 1: enabled, if the data overrun status bit is set (see status register. Table 14),
* the TWAI controllerrequests the respective interrupt. 0: disable
*/
uint32_t ext_data_overrun_int_ena:1;
uint32_t reserved_4:1;
/** err_passive_int_ena : R/W; bitpos: [5]; default: 0;
* 1: enabled, if the error status of the TWAI controller changes from error active to
* error passive or vice versa, the respective interrupt is requested. 0: disable
*/
uint32_t err_passive_int_ena:1;
/** arbitration_lost_int_ena : R/W; bitpos: [6]; default: 0;
* 1: enabled, if the TWAI controller has lost arbitration, the respective interrupt
* is requested. 0: disable
*/
uint32_t arbitration_lost_int_ena:1;
/** bus_err_int_ena : R/W; bitpos: [7]; default: 0;
* 1: enabled, if an bus error has been detected, the TWAI controller requests the
* respective interrupt. 0: disable
*/
uint32_t bus_err_int_ena:1;
/** idle_int_ena : RO; bitpos: [8]; default: 0;
* 1: enabled, if state of TWAI become IDLE, the TWAI controller requests the
* respective interrupt. 0: disable
*/
uint32_t idle_int_ena:1;
uint32_t reserved_9:23;
};
uint32_t val;
} twai_interrupt_enable_reg_t;
/** Group: Data Registers */
/** Type of buffer register
* TX RX Buffer.
*/
typedef union {
struct {
/** byte : R/W; bitpos: [7:0]; default: 0;
* In reset mode, it is acceptance code register 0 with R/W Permission. In operation
* mode, when software initiate write operation, it is tx data register 0 and when
* software initiate read operation, it is rx data register 0.
*/
uint32_t byte:8;
uint32_t reserved_8:24;
};
uint32_t val;
} twai_tx_rx_buffer_reg_t;
typedef struct {
union {
struct {
uint32_t byte: 8; /* ACRx[7:0] Acceptance Code */
uint32_t reserved8: 24; /* Internal Reserved */
};
uint32_t val;
} acr[4];
union {
struct {
uint32_t byte: 8; /* AMRx[7:0] Acceptance Mask */
uint32_t reserved8: 24; /* Internal Reserved */
};
uint32_t val;
} amr[4];
uint32_t reserved_60;
uint32_t reserved_64;
uint32_t reserved_68;
uint32_t reserved_6c;
uint32_t reserved_70;
} acceptance_filter_reg_t;
typedef struct twai_dev_s {
volatile twai_mode_reg_t mode;
volatile twai_cmd_reg_t cmd;
volatile twai_status_reg_t status;
volatile twai_interrupt_reg_t interrupt;
volatile twai_interrupt_enable_reg_t interrupt_enable;
uint32_t reserved_014;
volatile twai_bus_timing_0_reg_t bus_timing_0;
volatile twai_bus_timing_1_reg_t bus_timing_1;
uint32_t reserved_020[3];
volatile twai_arb_lost_cap_reg_t arb_lost_cap;
volatile twai_err_code_cap_reg_t err_code_cap;
volatile twai_err_warning_limit_reg_t err_warning_limit;
volatile twai_rx_err_cnt_reg_t rx_err_cnt;
volatile twai_tx_err_cnt_reg_t tx_err_cnt;
volatile union {
acceptance_filter_reg_t acceptance_filter;
twai_tx_rx_buffer_reg_t tx_rx_buffer[13];
};
volatile twai_rx_message_counter_reg_t rx_message_counter;
uint32_t reserved_078;
volatile twai_clock_divider_reg_t clock_divider;
volatile twai_sw_standby_cfg_reg_t sw_standby_cfg;
volatile twai_hw_cfg_reg_t hw_cfg;
volatile twai_hw_standby_cnt_reg_t hw_standby_cnt;
volatile twai_idle_intr_cnt_reg_t idle_intr_cnt;
volatile twai_eco_cfg_reg_t eco_cfg;
} twai_dev_t;
extern twai_dev_t TWAI0;
extern twai_dev_t TWAI1;
#ifndef __cplusplus
_Static_assert(sizeof(twai_dev_t) == 0x94, "Invalid size of twai_dev_t structure");
#endif
#ifdef __cplusplus
}
#endif
```
|
Troy Township is a township in Crawford County, Pennsylvania, United States. The population was 1,053 at the 2020 census, down from 1,235 at the 2010 census.
Geography
The township is in southeastern Crawford County, bordered to the south by Venango County. It includes the unincorporated hamlet of Troy Center. According to the United States Census Bureau, the township has a total area of , of which is land and , or 0.14%, is water.
Demographics
As of the census of 2000, there were 1,339 people, 471 households, and 384 families residing in the township. The population density was . There were 559 housing units at an average density of 17.7/sq mi (6.8/km). The racial makeup of the township was 98.88% White, 0.30% African American, 0.15% Native American, 0.15% Asian, and 0.52% from two or more races. Hispanic or Latino of any race were 0.90% of the population.
There were 471 households, out of which 39.1% had children under the age of 18 living with them, 69.6% were married couples living together, 6.8% had a female householder with no husband present, and 18.3% were non-families. 15.9% of all households were made up of individuals, and 7.6% had someone living alone who was 65 years of age or older. The average household size was 2.84 and the average family size was 3.15.
In the township the population was spread out, with 29.6% under the age of 18, 6.3% from 18 to 24, 27.6% from 25 to 44, 25.7% from 45 to 64, and 10.8% who were 65 years of age or older. The median age was 36 years. For every 100 females, there were 105.4 males. For every 100 females age 18 and over, there were 98.1 males.
The median income for a household in the township was $32,216, and the median income for a family was $36,635. Males had a median income of $28,929 versus $19,712 for females. The per capita income for the township was $13,505. About 10.3% of families and 15.5% of the population were below the poverty line, including 22.8% of those under age 18 and 5.2% of those age 65 or over.
References
Townships in Crawford County, Pennsylvania
Townships in Pennsylvania
|
The Iadăra is a right tributary of the river Someș in Romania. It discharges into the Someș in Mireșu Mare. Its length is and its basin size is .
References
Rivers of Romania
Rivers of Maramureș County
|
```glsl
Shader "SabreCSG/Plane"
{
Properties
{
_MainTex("Base (RGB)", 2D) = "white" { }
}
SubShader
{
Pass
{
ZWrite Off
Blend SrcAlpha OneMinusSrcAlpha
CGPROGRAM
#pragma vertex vert
#pragma fragment frag
#include "UnityShaderVariables.cginc"
// uniforms
float4 _MainTex_ST;
// vertex shader input data
struct appdata
{
float3 pos : POSITION;
half4 color : COLOR;
float3 uv0 : TEXCOORD0;
};
// vertex-to-fragment interpolators
struct v2f
{
fixed4 color : COLOR0;
float2 uv0 : TEXCOORD0;
float4 pos : SV_POSITION;
};
// vertex shader
v2f vert(appdata IN)
{
v2f o;
half4 color = IN.color;
half3 viewDir = 0.0;
o.color = saturate(color);
// compute texture coordinates
o.uv0 = IN.uv0.xy * _MainTex_ST.xy + _MainTex_ST.zw;
// transform position
o.pos = mul(UNITY_MATRIX_MVP, float4(IN.pos,1));
return o;
}
// textures
sampler2D _MainTex;
// fragment shader
fixed4 frag(v2f IN) : SV_Target
{
fixed4 col;
fixed4 tex, tmp0, tmp1, tmp2;
// SetTexture #0
tex = tex2D(_MainTex, IN.uv0.xy);
col = IN.color * tex;
return col;
}
// texenvs
//! TexEnv0: 01000101 01000101 [_MainTex]
ENDCG
}
}
}
```
|
```xml
<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<strings>
<string id="1000">Allgemein</string>
<string id="1010">Nach einem Neustart neu kalibrieren</string>
<string id="1020">Touchscreen reinigen</string>
<string id="2010">Touchscreen</string>
<string id="2020">Sie knnen jetzt den Touchscreen sicher reinigen.</string>
<string id="2030">Noch %d Sekunden brig.</string>
</strings>
```
|
|}
The Racing Post Novice Chase is a Grade 1 National Hunt chase in Ireland. The race is run at Leopardstown Racecourse in December, over a distance of 2 miles and 1 furlong (3,419 metres) and during its running there are 11 fences to be jumped.
The race is run on 26 December, which is known in Ireland as St Stephen's Day, and is one of the feature races of the course's four-day Christmas Festival.
Prior to 2011 it was titled the Bord Na Mona With Nature Novice Chase. Prior to 2009 it was titled the Durkan New Homes Novice Chase. During the 1990s the race was known as the Dennys Gold Medal Novice Chase.
Records
Leading jockey (3 wins):
Paul Townend - Blackstairmountain (2011), Arvika Ligeonniere (2012), Ferny Hollow (2021)
Leading trainer (9 wins):
Willie Mullins – Missed That (2005), Blackstairmountain (2011), Arvika Ligeonniere (2012), Douvan (2015), Min (2016), Footpad (2017), Franco De Port (2020), Ferny Hollow (2021), Saint Roi (2022)
Winners since 1987
See also
Horse racing in Ireland
List of Irish National Hunt races
References
Racing Post:
, , , , , , , , ,
, , , , , , , , ,
, , , , , , , , ,
, ,
National Hunt races in Ireland
National Hunt chases
Leopardstown Racecourse
|
The First Broad River is a tributary of the Broad River, about 60 mi (95 km) long in western North Carolina in the United States. Via the Broad and Congaree Rivers, it is part of the watershed of the Santee River, which flows to the Atlantic Ocean.
The First Broad River rises on South Mountain in northeastern Rutherford County and initially flows southeastwardly into Cleveland County to the town of Lawndale, where it turns southward. After passing to the west of Shelby, the river joins the Broad River from the north in southern Cleveland County.
See also
List of North Carolina rivers
Second Broad River
References
Rivers of North Carolina
Rivers of Cleveland County, North Carolina
Rivers of Rutherford County, North Carolina
|
Chronic Breakdown a studio album released by the Washington, D.C.-based go-go band the Huck-A-Bucks on December 12, 1995. This was the band's debut album, and consists of twelve tracks including the song "Sexy Girl" which was sampled by hip-hop recording artist Wale for the 2006 single "Breakdown".
Track listing
Personnel
Adapted from AllMusic.
Darryl Arrington – drums
DeCarlos Cunningham – keyboards
Rob "R.J." Folson – keyboards
Sequan Jones – congas, percussion
Lamont Ray – percussion, vocals
Felix Stevenson – drums
Joseph Timms – rapping, vocals
Charles Yancy – percussion, vocals
Roy Battle – engineer, producer
References
1995 debut albums
Huck-A-Bucks albums
|
```go
package migration4
import (
"fmt"
"sync"
)
// rangeItem represents the start and end values of a range.
type rangeItem struct {
start uint64
end uint64
}
// RangeIndexOption describes the signature of a functional option that can be
// used to modify the behaviour of a RangeIndex.
type RangeIndexOption func(*RangeIndex)
// WithSerializeUint64Fn is a functional option that can be used to set the
// function to be used to do the serialization of a uint64 into a byte slice.
func WithSerializeUint64Fn(fn func(uint64) ([]byte, error)) RangeIndexOption {
return func(index *RangeIndex) {
index.serializeUint64 = fn
}
}
// RangeIndex can be used to keep track of which numbers have been added to a
// set. It does so by keeping track of a sorted list of rangeItems. Each
// rangeItem has a start and end value of a range where all values in-between
// have been added to the set. It works well in situations where it is expected
// numbers in the set are not sparse.
type RangeIndex struct {
// set is a sorted list of rangeItem.
set []rangeItem
// mu is used to ensure safe access to set.
mu sync.Mutex
// serializeUint64 is the function that can be used to convert a uint64
// to a byte slice.
serializeUint64 func(uint64) ([]byte, error)
}
// NewRangeIndex constructs a new RangeIndex. An initial set of ranges may be
// passed to the function in the form of a map.
func NewRangeIndex(ranges map[uint64]uint64,
opts ...RangeIndexOption) (*RangeIndex, error) {
index := &RangeIndex{
serializeUint64: defaultSerializeUint64,
set: make([]rangeItem, 0),
}
// Apply any functional options.
for _, o := range opts {
o(index)
}
for s, e := range ranges {
if err := index.addRange(s, e); err != nil {
return nil, err
}
}
return index, nil
}
// addRange can be used to add an entire new range to the set. This method
// should only ever be called by NewRangeIndex to initialise the in-memory
// structure and so the RangeIndex mutex is not held during this method.
func (a *RangeIndex) addRange(start, end uint64) error {
// Check that the given range is valid.
if start > end {
return fmt.Errorf("invalid range. Start height %d is larger "+
"than end height %d", start, end)
}
// min is a helper closure that will return the minimum of two uint64s.
min := func(a, b uint64) uint64 {
if a < b {
return a
}
return b
}
// max is a helper closure that will return the maximum of two uint64s.
max := func(a, b uint64) uint64 {
if a > b {
return a
}
return b
}
// Collect the ranges that fall before and after the new range along
// with the start and end values of the new range.
var before, after []rangeItem
for _, x := range a.set {
// If the new start value can't extend the current ranges end
// value, then the two cannot be merged. The range is added to
// the group of ranges that fall before the new range.
if x.end+1 < start {
before = append(before, x)
continue
}
// If the current ranges start value does not follow on directly
// from the new end value, then the two cannot be merged. The
// range is added to the group of ranges that fall after the new
// range.
if end+1 < x.start {
after = append(after, x)
continue
}
// Otherwise, there is an overlap and so the two can be merged.
start = min(start, x.start)
end = max(end, x.end)
}
// Re-construct the range index set.
a.set = append(append(before, rangeItem{
start: start,
end: end,
}), after...)
return nil
}
// IsInIndex returns true if the given number is in the range set.
func (a *RangeIndex) IsInIndex(n uint64) bool {
a.mu.Lock()
defer a.mu.Unlock()
_, isCovered := a.lowerBoundIndex(n)
return isCovered
}
// NumInSet returns the number of items covered by the range set.
func (a *RangeIndex) NumInSet() uint64 {
a.mu.Lock()
defer a.mu.Unlock()
var numItems uint64
for _, r := range a.set {
numItems += r.end - r.start + 1
}
return numItems
}
// MaxHeight returns the highest number covered in the range.
func (a *RangeIndex) MaxHeight() uint64 {
a.mu.Lock()
defer a.mu.Unlock()
if len(a.set) == 0 {
return 0
}
return a.set[len(a.set)-1].end
}
// GetAllRanges returns a copy of the range set in the form of a map.
func (a *RangeIndex) GetAllRanges() map[uint64]uint64 {
a.mu.Lock()
defer a.mu.Unlock()
cp := make(map[uint64]uint64, len(a.set))
for _, item := range a.set {
cp[item.start] = item.end
}
return cp
}
// lowerBoundIndex returns the index of the RangeIndex that is most appropriate
// for the new value, n. In other words, it returns the index of the rangeItem
// set of the range where the start value is the highest start value in the set
// that is still lower than or equal to the given number, n. The returned
// boolean is true if the given number is already covered in the RangeIndex.
// A returned index of -1 indicates that no lower bound range exists in the set.
// Since the most likely case is that the new number will just extend the
// highest range, a check is first done to see if this is the case which will
// make the methods' computational complexity O(1). Otherwise, a binary search
// is done which brings the computational complexity to O(log N).
func (a *RangeIndex) lowerBoundIndex(n uint64) (int, bool) {
// If the set is empty, then there is no such index and the value
// definitely is not in the set.
if len(a.set) == 0 {
return -1, false
}
// In most cases, the last index item will be the one we want. So just
// do a quick check on that index first to avoid doing the binary
// search.
lastIndex := len(a.set) - 1
lastRange := a.set[lastIndex]
if lastRange.start <= n {
return lastIndex, lastRange.end >= n
}
// Otherwise, do a binary search to find the index of interest.
var (
low = 0
high = len(a.set) - 1
rangeIndex = -1
)
for {
mid := (low + high) / 2
currentRange := a.set[mid]
switch {
case currentRange.start > n:
// If the start of the range is greater than n, we can
// completely cut out that entire part of the array.
high = mid
case currentRange.start < n:
// If the range already includes the given height, we
// can stop searching now.
if currentRange.end >= n {
return mid, true
}
// If the start of the range is smaller than n, we can
// store this as the new best index to return.
rangeIndex = mid
// If low and mid are already equal, then increment low
// by 1. Exit if this means that low is now greater than
// high.
if low == mid {
low = mid + 1
if low > high {
return rangeIndex, false
}
} else {
low = mid
}
continue
default:
// If the height is equal to the start value of the
// current range that mid is pointing to, then the
// height is already covered.
return mid, true
}
// Exit if we have checked all the ranges.
if low == high {
break
}
}
return rangeIndex, false
}
// KVStore is an interface representing a key-value store.
type KVStore interface {
// Put saves the specified key/value pair to the store. Keys that do not
// already exist are added and keys that already exist are overwritten.
Put(key, value []byte) error
// Delete removes the specified key from the bucket. Deleting a key that
// does not exist does not return an error.
Delete(key []byte) error
}
// Add adds a single number to the range set. It first attempts to apply the
// necessary changes to the passed KV store and then only if this succeeds, will
// the changes be applied to the in-memory structure.
func (a *RangeIndex) Add(newHeight uint64, kv KVStore) error {
a.mu.Lock()
defer a.mu.Unlock()
// Compute the changes that will need to be applied to both the sorted
// rangeItem array representation and the key-value store representation
// of the range index.
arrayChanges, kvStoreChanges := a.getChanges(newHeight)
// First attempt to apply the KV store changes. Only if this succeeds
// will we apply the changes to our in-memory range index structure.
err := a.applyKVChanges(kv, kvStoreChanges)
if err != nil {
return err
}
// Since the DB changes were successful, we can now commit the
// changes to our in-memory representation of the range set.
a.applyArrayChanges(arrayChanges)
return nil
}
// applyKVChanges applies the given set of kvChanges to a KV store. It is
// assumed that a transaction is being held on the kv store so that if any
// of the actions of the function fails, the changes will be reverted.
func (a *RangeIndex) applyKVChanges(kv KVStore, changes *kvChanges) error {
// Exit early if there are no changes to apply.
if kv == nil || changes == nil {
return nil
}
// Check if any range pair needs to be deleted.
if changes.deleteKVKey != nil {
del, err := a.serializeUint64(*changes.deleteKVKey)
if err != nil {
return err
}
if err := kv.Delete(del); err != nil {
return err
}
}
start, err := a.serializeUint64(changes.key)
if err != nil {
return err
}
end, err := a.serializeUint64(changes.value)
if err != nil {
return err
}
return kv.Put(start, end)
}
// applyArrayChanges applies the given arrayChanges to the in-memory RangeIndex
// itself. This should only be done once the persisted kv store changes have
// already been applied.
func (a *RangeIndex) applyArrayChanges(changes *arrayChanges) {
if changes == nil {
return
}
if changes.indexToDelete != nil {
a.set = append(
a.set[:*changes.indexToDelete],
a.set[*changes.indexToDelete+1:]...,
)
}
if changes.newIndex != nil {
switch {
case *changes.newIndex == 0:
a.set = append([]rangeItem{{
start: changes.start,
end: changes.end,
}}, a.set...)
case *changes.newIndex == len(a.set):
a.set = append(a.set, rangeItem{
start: changes.start,
end: changes.end,
})
default:
a.set = append(
a.set[:*changes.newIndex+1],
a.set[*changes.newIndex:]...,
)
a.set[*changes.newIndex] = rangeItem{
start: changes.start,
end: changes.end,
}
}
return
}
if changes.indexToEdit != nil {
a.set[*changes.indexToEdit] = rangeItem{
start: changes.start,
end: changes.end,
}
}
}
// arrayChanges encompasses the diff to apply to the sorted rangeItem array
// representation of a range index. Such a diff will either include adding a
// new range or editing an existing range. If an existing range is edited, then
// the diff might also include deleting an index (this will be the case if the
// editing of the one range results in the merge of another range).
type arrayChanges struct {
start uint64
end uint64
// newIndex, if set, is the index of the in-memory range array where a
// new range, [start:end], should be added. newIndex should never be
// set at the same time as indexToEdit or indexToDelete.
newIndex *int
// indexToDelete, if set, is the index of the sorted rangeItem array
// that should be deleted. This should be applied before reading the
// index value of indexToEdit. This should not be set at the same time
// as newIndex.
indexToDelete *int
// indexToEdit is the index of the in-memory range array that should be
// edited. The range at this index will be changed to [start:end]. This
// should only be read after indexToDelete index has been deleted.
indexToEdit *int
}
// kvChanges encompasses the diff to apply to a KV-store representation of a
// range index. A kv-store diff for the addition of a single number to the range
// index will include either a brand new key-value pair or the altering of the
// value of an existing key. Optionally, the diff may also include the deletion
// of an existing key. A deletion will be required if the addition of the new
// number results in the merge of two ranges.
type kvChanges struct {
key uint64
value uint64
// deleteKVKey, if set, is the key of the kv store representation that
// should be deleted.
deleteKVKey *uint64
}
// getChanges will calculate and return the changes that need to be applied to
// both the sorted-rangeItem-array representation and the key-value store
// representation of the range index.
func (a *RangeIndex) getChanges(n uint64) (*arrayChanges, *kvChanges) {
// If the set is empty then a new range item is added.
if len(a.set) == 0 {
// For the array representation, a new range [n:n] is added to
// the first index of the array.
firstIndex := 0
ac := &arrayChanges{
newIndex: &firstIndex,
start: n,
end: n,
}
// For the KV representation, a new [n:n] pair is added.
kvc := &kvChanges{
key: n,
value: n,
}
return ac, kvc
}
// Find the index of the lower bound range to the new number.
indexOfRangeBelow, alreadyCovered := a.lowerBoundIndex(n)
switch {
// The new number is already covered by the range index. No changes are
// required.
case alreadyCovered:
return nil, nil
// No lower bound index exists.
case indexOfRangeBelow < 0:
// Check if the very first range can be merged into this new
// one.
if n+1 == a.set[0].start {
// If so, the two ranges can be merged and so the start
// value of the range is n and the end value is the end
// of the existing first range.
start := n
end := a.set[0].end
// For the array representation, we can just edit the
// first entry of the array
editIndex := 0
ac := &arrayChanges{
indexToEdit: &editIndex,
start: start,
end: end,
}
// For the KV store representation, we add a new kv pair
// and delete the range with the key equal to the start
// value of the range we are merging.
kvKeyToDelete := a.set[0].start
kvc := &kvChanges{
key: start,
value: end,
deleteKVKey: &kvKeyToDelete,
}
return ac, kvc
}
// Otherwise, we add a new index.
// For the array representation, a new range [n:n] is added to
// the first index of the array.
newIndex := 0
ac := &arrayChanges{
newIndex: &newIndex,
start: n,
end: n,
}
// For the KV representation, a new [n:n] pair is added.
kvc := &kvChanges{
key: n,
value: n,
}
return ac, kvc
// A lower range does exist, and it can be extended to include this new
// number.
case a.set[indexOfRangeBelow].end+1 == n:
start := a.set[indexOfRangeBelow].start
end := n
indexToChange := indexOfRangeBelow
// If there are no intervals above this one or if there are, but
// they can't be merged into this one then we just need to edit
// this interval.
if indexOfRangeBelow == len(a.set)-1 ||
a.set[indexOfRangeBelow+1].start != n+1 {
// For the array representation, we just edit the index.
ac := &arrayChanges{
indexToEdit: &indexToChange,
start: start,
end: end,
}
// For the key-value representation, we just overwrite
// the end value at the existing start key.
kvc := &kvChanges{
key: start,
value: end,
}
return ac, kvc
}
// There is a range above this one that we need to merge into
// this one.
delIndex := indexOfRangeBelow + 1
end = a.set[delIndex].end
// For the array representation, we delete the range above this
// one and edit this range to include the end value of the range
// above.
ac := &arrayChanges{
indexToDelete: &delIndex,
indexToEdit: &indexToChange,
start: start,
end: end,
}
// For the kv representation, we tweak the end value of an
// existing key and delete the key of the range we are deleting.
deleteKey := a.set[delIndex].start
kvc := &kvChanges{
key: start,
value: end,
deleteKVKey: &deleteKey,
}
return ac, kvc
// A lower range does exist, but it can't be extended to include this
// new number, and so we need to add a new range after the lower bound
// range.
default:
newIndex := indexOfRangeBelow + 1
// If there are no ranges above this new one or if there are,
// but they can't be merged into this new one, then we can just
// add the new one as is.
if newIndex == len(a.set) || a.set[newIndex].start != n+1 {
ac := &arrayChanges{
newIndex: &newIndex,
start: n,
end: n,
}
kvc := &kvChanges{
key: n,
value: n,
}
return ac, kvc
}
// Else, we merge the above index.
start := n
end := a.set[newIndex].end
toEdit := newIndex
// For the array representation, we edit the range above to
// include the new start value.
ac := &arrayChanges{
indexToEdit: &toEdit,
start: start,
end: end,
}
// For the kv representation, we insert the new start-end key
// value pair and delete the key using the old start value.
delKey := a.set[newIndex].start
kvc := &kvChanges{
key: start,
value: end,
deleteKVKey: &delKey,
}
return ac, kvc
}
}
func defaultSerializeUint64(i uint64) ([]byte, error) {
var b [8]byte
byteOrder.PutUint64(b[:], i)
return b[:], nil
}
```
|
Savenki () is a rural locality (a village) in Gamovskoye Rural Settlement, Permsky District, Perm Krai, Russia. The population was 16 as of 2010.
Geography
Savenki is located 24 km southwest of Perm (the district's administrative centre) by road. Shulgino is the nearest rural locality.
References
Rural localities in Permsky District
|
```html
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<title>spring</title>
</head>
<body>
<canvas id="canvas" width="500" height="500" style="background:#000;"></canvas>
<script src="../js/utils.js"></script>
<script src="../js/ball3d.js"></script>
<script>
window.onload = function(){
var canvas = document.querySelector("#canvas"),
context = canvas.getContext("2d"),
ball = new Ball3d(),
tx = Math.random()*500 - 250,
ty = Math.random()*500 - 250,
tz = Math.random()*500,
spring = 0.1,
friction = 0.94,
fl = 250,
vpX = canvas.width/2,
vpY = canvas.height/2;
window.addEventListener('mousedown', function(e){
tx = Math.random()*500 - 250;
ty = Math.random()*500 - 250;
tz = Math.random()*500;
},false);
(function drawFrame(){
window.requestAnimationFrame(drawFrame, canvas);
context.clearRect(0,0,canvas.width,canvas.height);
var dx = tx - ball.xpos,
dy = ty - ball.ypos,
dz = tz - ball.zpos,
dist = Math.sqrt(dx*dx + dy*dy + dz*dz);
ball.vx += dx*spring;
ball.vy += dy*spring;
ball.vz += dz*spring;
ball.vx *= friction;
ball.vy *= friction;
ball.vz *= friction;
ball.xpos += ball.vx;
ball.ypos += ball.vy;
ball.zpos += ball.vz;
if(ball.zpos > -fl){
var scale = fl/(fl+ball.zpos);
ball.scaleX = ball.scaleY = scale;
ball.x = vpX + ball.xpos*scale;
ball.y = vpY + ball.ypos*scale;
ball.visible = true;
}else{
ball.visible = false;
}
if(ball.visible){
ball.draw(context);
}
}())
}
</script>
</body>
</html>
```
|
The 2013–14 Miami Heat season was the 26th season of the franchise in the National Basketball Association (NBA). They entered the season as three-time defending Eastern Conference champions and as two-time defending NBA champions, having defeated the Oklahoma City Thunder in the 2012 NBA Finals in five games and the San Antonio Spurs in the 2013 NBA Finals in seven games. In defeating the Spurs in 2013, the Heat handed the Spurs their first-ever series loss in the NBA Finals.
The 2013–2014 season was the Heat's fourth and final season playing with the "Big Three" of LeBron James, Dwyane Wade, and Chris Bosh, and ended with a 54–28 record, despite a 43–14 record early in March. It was the lowest record (.659) in the Big Three era (with the exception of the 2011–12 NBA season, which was a shortened season due to a lockout). It was also their sixth season under head coach Erik Spoelstra and Ray Allen's last season in the NBA after 18 years in the league. Although he was a free agent during the 2014–15 and 2015–16 seasons, and despite rumors of a possible return to the league to play for the Milwaukee Bucks, Golden State Warriors, or Boston Celtics, Allen officially announced his retirement on November 1, 2016, and was one of two remaining active players from the 1996 draft, the other being Kobe Bryant, whom announced his retirement the season prior.
The Heat swept the Charlotte Bobcats in the first round and defeated the Brooklyn Nets in five games in the conference semifinals. In a rematch of the previous year's Eastern Conference finals, the Heat defeated the Indiana Pacers in six games (ending the Pacers' season for the third year in a row) to become the first team to win four consecutive Eastern Conference championships since the Boston Celtics did so in the 1984–1987 seasons. Miami's quest for a three-peat ended when the San Antonio Spurs, whom they met in a rematch of the 2013 NBA Finals, won the NBA Finals by a 4–1 margin. Following the season, James left the Heat in free agency to rejoin the Cleveland Cavaliers, whom he previously played for from 2003 to 2010. This would also be the last time the Heat would appear in the Finals until 2020, wherein they lost to the Los Angeles Lakers (led by former Heat player James) 4 games to 2.
Key dates
June 27: The 2013 NBA draft took place at Barclays Center in Brooklyn, New York.
July 1: 2013 NBA free agency began.
March 3: LeBron James had a career-high 61 points against the Charlotte Bobcats. His 61 points were also a franchise-high, breaking Glen Rice's record, who scored 56 points against the Orlando Magic in 1995.
April 28: The Heat completed a sweep over the Charlotte Bobcats in the Eastern Conference first round, advancing to the conference semi-finals.
May 14: The Heat avenged their regular-season sweep loss over the Brooklyn Nets in Game 5 of the Eastern Conference Semi-finals, by a game-saving steal by LeBron James from Joe Johnson. They advanced to the Eastern Conference finals for the fourth consecutive year.
May 30: The Heat defeated the Indiana Pacers in game six of the Eastern Conference finals, to advance to the NBA Finals for the fourth consecutive year.
June 15: Their season ended when they lost to the San Antonio Spurs in Game 5 of the 2014 NBA Finals, 104–87. Their loss also marked the first time that the Heat have been eliminated from title contention since their loss to the Dallas Mavericks in Game 6 of the 2011 NBA Finals.
Draft picks
The Heat did not have a pick in the 2013 NBA draft.
Future draft picks
Credits
2014 or 2015 first-round draft pick from Philadelphia
Philadelphia's first-round pick to Miami protected for selections 1-14 in 2014 or 1-14 in 2015; if Philadelphia has not conveyed a first-round pick to Miami by 2015, then Philadelphia will instead convey its 2015 2nd round pick and 2016 2nd round pick to Miami [Miami-Philadelphia, 6/28/2012]
Debits
2015 first round draft pick to Cleveland
Miami's 1st round pick to Cleveland protected for selections 1-10 in 2015 or 1-10 in 2016 or unprotected in 2017 [Cleveland-Miami, 7/9/2010]
2017 second-round draft pick to Atlanta
Miami's second-round pick to Atlanta protected for selections 31–40 in 2017 or unprotected in 2018 [Atlanta-Miami, 6/27/2013]
Roster
Pre-season
|- style="background:#cfc;"
| 1
| October 7
| Atlanta
|
| Chris Bosh (21)
| Roger Mason, Jr. (6)
| LeBron James (5)
| American Airlines Arena19,600
| 1–0
|- style="background:#cfc;"
| 2
| October 10
| @ Detroit
|
| Chris Bosh (28)
| Bosh, Wade, & Hamilton (4)
| LeBron James (7)
| Palace of Auburn Hills17,219
| 2–0
|- style="background:#cfc;"
| 3
| October 11
| Charlotte
|
| LeBron James (20)
| Udonis Haslem (11)
| Chalmers & Cole (4)
| Sprint Center18,770
| 3–0
|- style="background:#fcc;"
| 4
| October 15
| @ Washington
|
| Wade & Battier (14)
| Chris Bosh (8)
| James, Chalmers, & Cole (4)
| Verizon Center13,678
| 3–1
|- style="background:#fcc;"
| 5
| October 17
| @ Brooklyn
|
| James & Bosh (16)
| Chris Bosh (9)
| James & Chalmers (4)
| Barclays Center17,732
| 3–2
|- style="background:#cfc;"
| 6
| October 19
| San Antonio
|
| Dwyane Wade (25)
| Udonis Haslem (8)
| Dwyane Wade (7)
| American Airlines Arena20,080
| 4–2
|- style="background:#cfc;"
| 7
| October 23
| @ New Orleans
|
| LeBron James (27)
| Chris Bosh (9)
| Bosh & Wade (7)
| New Orleans Arena17,123
| 5–2
|- style="background:#fcc;"
| 8
| October 25
| Brooklyn
|
| Udonis Haslem (16)
| Michael Beasley (6)
| Mario Chalmers (6)
| American Airlines Arena19,600
| 5–3
Regular season
Standings
Game log
|- style="background:#cfc;"
| 1
| October 29
| Chicago
|
| LeBron James (17)
| Chris Andersen (8)
| LeBron James (8)
| American Airlines Arena19,964
| 1–0
|- style="background:#fcc;"
| 2
| October 30
| @ Philadelphia
|
| LeBron James (25)
| Chris Bosh (10)
| LeBron James (13)
| Wells Fargo Center19,523
| 1–1
|- style="background:#fcc;"
| 3
| November 1
| @ Brooklyn
|
| LeBron James (26)
| LeBron James (7)
| LeBron James (6)
| Barclays Center17,732
| 1–2
|- style="background:#cfc;"
| 4
| November 3
| Washington
|
| LeBron James (25)
| Chris Bosh (7)
| Mario Chalmers (8)
| American Airlines Arena19,600
| 2–2
|- style="background:#cfc;"
| 5
| November 5
| @ Toronto
|
| LeBron James (35)
| LeBron James (8)
| LeBron James (8)
| Air Canada Centre18,470
| 3–2
|- style="background:#cfc;"
| 6
| November 7
| L.A. Clippers
|
| Dwyane Wade (29)
| Chris Bosh (6)
| Dwyane Wade (7)
| American Airlines Arena19,600
| 4–2
|- style="background:#fcc;"
| 7
| November 9
| Boston
|
| LeBron James (25)
| LeBron James (8)
| LeBron James (10)
| American Airlines Arena19,710
| 4–3
|- style="background:#cfc;"
| 8
| November 12
| Milwaukee
|
| LeBron James (33)
| Wade & Andersen (7)
| Mario Chalmers (7)
| American Airlines Arena19,600
| 5–3
|- style="background:#cfc;"
| 9
| November 15
| Dallas
|
| LeBron James (39)
| Chris Andersen (7)
| Dwyane Wade (8)
| American Airlines Arena19,772
| 6–3
|- style="background:#cfc;"
| 10
| November 16
| @ Charlotte
|
| LeBron James (30)
| Rashard Lewis (9)
| LeBron James (7)
| Time Warner Cable Arena19,084
| 7–3
|- style="background:#cfc;"
| 11
| November 19
| Atlanta
|
| Chris Bosh (19)
| LeBron James (6)
| Norris Cole (9)
| American Airlines Arena19,600
| 8–3
|- style="background:#cfc;"
| 12
| November 20
| @ Orlando
|
| LeBron James (21)
| Michael Beasley (7)
| Mario Chalmers (8)
| Amway Center17,256
| 9–3
|- style="background:#cfc;"
| 13
| November 23
| Orlando
|
| Dwyane Wade (27)
| LeBron James (9)
| LeBron James (7)
| American Airlines Arena19,647
| 10–3
|- style="background:#cfc;"
| 14
| November 25
| Phoenix
|
| LeBron James (35)
| Chris Andersen (7)
| Dwyane Wade (12)
| American Airlines Arena15,758
| 11–3
|- style="background:#cfc;"
| 15
| November 27
| @ Cleveland
|
| LeBron James (28)
| Michael Beasley (9)
| LeBron James (8)
| Quicken Loans Arena20,562
| 12–3
|- style="background:#cfc;"
| 16
| November 29
| @ Toronto
|
| LeBron James (27)
| Dwyane Wade (7)
| Mario Chalmers (8)
| Air Canada Centre18,290
| 13–3
|- style="background:#cfc;"
| 17
| December 1
| Charlotte
|
| LeBron James (26)
| Chris Bosh (9)
| Mario Chalmers (6)
| American Airlines Arena19,617
| 14–3
|- style="background:#fcc;"
| 18
| December 3
| Detroit
|
| James & Beasley (23)
| Bosh & Lewis (6)
| James & Chalmers (6)
| American Airlines Arena19,741
| 14–4
|- style="background:#fcc;"
| 19
| December 5
| @ Chicago
|
| LeBron James (21)
| Michael Beasley (7)
| Norris Cole (6)
| United Center22,125
| 14–5
|- style="background:#cfc;"
| 20
| December 7
| @ Minnesota
|
| LeBron James (21)
| LeBron James (14)
| LeBron James (8)
| Target Center19,888
| 15–5
|- style="background:#cfc;"
| 21
| December 8
| @ Detroit
|
| LeBron James (24)
| Chris Bosh (9)
| LeBron James (9)
| Palace of Auburn Hills18,034
| 16–5
|- style="background:#fcc;"
| 22
| December 10
| @ Indiana
|
| James & Wade (17)
| LeBron James (14)
| James & Wade (6)
| Bankers Life Fieldhouse18,165
| 16–6
|- style="background:#cfc;"
| 23
| December 14
| Cleveland
|
| LeBron James (25)
| Chris Bosh (12)
| LeBron James (9)
| American Airlines Arena19,656
| 17–6
|- style="background:#cfc;"
| 24
| December 16
| Utah
|
| LeBron James (30)
| LeBron James (9)
| LeBron James (9)
| American Airlines Arena19,600
| 18–6
|- style="background:#cfc;"
| 25
| December 18
| Indiana
|
| Dwyane Wade (32)
| LeBron James (9)
| LeBron James (7)
| American Airlines Arena19,898
| 19–6
|- style="background:#cfc;"
| 26
| December 20
| Sacramento
|
| Chris Bosh (25)
| Chris Bosh (8)
| LeBron James (8)
| American Airlines Arena19,600
| 20–6
|- style="background:#cfc;"
| 27
| December 23
| Atlanta
|
| LeBron James (38)
| Chris Andersen (9)
| LeBron James (6)
| American Airlines Arena20,204
| 21–6
|- style="background:#cfc;"
| 28
| December 25
| @ L.A. Lakers
|
| Bosh & Wade (23)
| Chris Bosh (11)
| Wade & Chalmers (7)
| Staples Center18,997
| 22–6
|- style="background:#fcc;"
| 29
| December 27
| @ Sacramento
|
| LeBron James (33)
| LeBron James (8)
| Mario Chalmers (10)
| Sleep Train Arena17,317
| 22–7
|- style="background:#cfc;"
| 30
| December 28
| @ Portland
|
| Chris Bosh (37)
| Chris Bosh (10)
| Mario Chalmers (9)
| Moda Center20,071
| 23–7
|- style="background:#cfc;"
| 31
| December 30
| @ Denver
|
| LeBron James (26)
| Ray Allen (7)
| LeBron James (10)
| Pepsi Center19,155
| 24–7
|- style="background:#fcc;"
| 32
| January 2
| Golden State
|
| LeBron James (26)
| Mario Chalmers (7)
| James & Wade (5)
| American Airlines Arena20,350
| 24–8
|- style="background:#cfc;"
| 33
| January 4
| @ Orlando
|
| Bosh & Wade (20)
| LeBron James (8)
| LeBron James (8)
| Amway Center18,846
| 25–8
|- style="background:#cfc;"
| 34
| January 5
| Toronto
|
| LeBron James (30)
| Chris Bosh (11)
| LeBron James (5)
| American Airlines Arena20,020
| 26–8
|- style="background:#cfc;"
| 35
| January 7
| New Orleans
|
| LeBron James (32)
| Chris Bosh (9)
| Dwyane Wade (8)
| American Airlines Arena20,097
| 27–8
|- style="background:#fcc;"
| 36
| January 9
| @ New York
|
| LeBron James (32)
| Chris Bosh (9)
| LeBron James (6)
| Madison Square Garden19,812
| 27–9
|- style="background:#fcc;"
| 37
| January 10
| @ Brooklyn
|
| LeBron James (36)
| Chris Bosh (10)
| Norris Cole (7)
| Barclays Center17,732
| 27–10
|- style="background:#fcc;"
| 38
| January 15
| @ Washington
|
| Chris Bosh (26)
| LeBron James (8)
| James & Cole (7)
| Verizon Center20,356
| 27–11
|- style="background:#cfc;"
| 39
| January 17
| @ Philadelphia
|
| Chris Bosh (25)
| LeBron James (8)
| LeBron James (10)
| Wells Fargo Center19,286
| 28–11
|- style="background:#cfc;"
| 40
| January 18
| @ Charlotte
|
| LeBron James (34)
| Udonis Haslem (10)
| LeBron James (6)
| Time Warner Cable Arena19,631
| 29–11
|- style="background:#fcc;"
| 41
| January 20
| @ Atlanta
|
| LeBron James (30)
| Bosh & Allen (7)
| Norris Cole (8)
| Philips Arena19,262
| 29–12
|- style="background:#cfc;"
| 42
| January 21
| Boston
|
| LeBron James (29)
| LeBron James (8)
| Chalmers & Cole (6)
| American Airlines Arena19,619
| 30–12
|- style="background:#cfc;"
| 43
| January 23
| L.A. Lakers
|
| Chris Bosh (31)
| LeBron James (13)
| LeBron James (6)
| American Airlines Arena19,608
| 31–12
|- style="background:#cfc;"
| 44
| January 26
| San Antonio
|
| Chris Bosh (24)
| LeBron James (7)
| Mario Chalmers (7)
| American Airlines Arena19,683
| 32–12
|- style="background:#fcc;"
| 45
| January 29
| Oklahoma City
|
| LeBron James (34)
| Chris Bosh (9)
| Mario Chalmers (8)
| American Airlines Arena19,673
| 32–13
|- style="background:#cfc;"
| 46
| February 1
| @ New York
|
| LeBron James (30)
| Chris Bosh (10)
| LeBron James (7)
| Madison Square Garden19,812
| 33–13
|- style="background:#cfc;"
| 47
| February 3
| Detroit
|
| Dwyane Wade (30)
| Dwyane Wade (10)
| LeBron James (11)
| American Airlines Arena19,802
| 34–13
|- style="background:#cfc;"
| 48
| February 5
| @ L.A. Clippers
|
| LeBron James (31)
| James & Bosh (8)
| LeBron James (12)
| Staples Center19,672
| 35–13
|- style="background:#fcc;"
| 49
| February 8
| @ Utah
|
| Dwyane Wade (19)
| James & Bosh (7)
| Mario Chalmers (7)
| EnergySolutions Arena19,911
| 35–14
|- style="background:#cfc;"
| 50
| February 11
| @ Phoenix
|
| LeBron James (37)
| LeBron James (9)
| James, Cole & Allen (3)
| US Airways Center17,927
| 36–14
|- style="background:#cfc;"
| 51
| February 12
| @ Golden State
|
| LeBron James (36)
| LeBron James (13)
| LeBron James (9)
| Oracle Arena19,596
| 37–14
|- align="center"
|colspan="9" bgcolor="#bbcaff"|All-Star Break
|- style="background:#cfc;"
| 52
| February 18
| @ Dallas
|
| LeBron James (42)
| LeBron James (9)
| Mario Chalmers (9)
| American Airlines Center20,461
| 38–14
|- style="background:#cfc;"
| 53
| February 20
| @ Oklahoma City
|
| LeBron James (33)
| Dwyane Wade (10)
| Bosh & Andersen (8)
| Chesapeake Energy Arena18,203
| 39–14
|- style="background:#cfc;"
| 54
| February 23
| Chicago
|
| Chris Bosh (28)
| Bosh & Wade (10)
| Mario Chalmers (9)
| American Airlines Arena19,848
| 40–14
|- style="background:#cfc;"
| 55
| February 27
| New York
|
| LeBron James (31)
| Bosh & Andersen (7)
| Shane Battier (5)
| American Airlines Arena19,634
| 41–14
|- style="background:#cfc;"
| 56
| March 1
| Orlando
|
| Dwyane Wade (24)
| LeBron James (9)
| LeBron James (7)
| American Airlines Arena19,834
| 42–14
|- style="background:#cfc;"
| 57
| March 3
| Charlotte
|
| LeBron James (61)
| James & Bosh (7)
| Mario Chalmers (7)
| American Airlines Arena19,727
| 43–14
|- style="background:#fcc;"
| 58
| March 4
| @ Houston
|
| Wade & Beasley (24)
| Chris Andersen (7)
| James & Wade (6)
| Toyota Center18,523
| 43–15
|- style="background:#fcc;"
| 59
| March 6
| @ San Antonio
|
| Chris Bosh (24)
| LeBron James (8)
| James & Wade (7)
| AT&T Center18,581
| 43–16
|- style="background:#fcc;"
| 60
| March 9
| @ Chicago
|
| Dwyane Wade (25)
| Chris Andersen (13)
| LeBron James (8)
| United Center22,028
| 43–17
|- style="background:#cfc;"
| 61
| March 10
| Washington
|
| LeBron James (23)
| James & Bosh (7)
| LeBron James (8)
| American Airlines Arena19,657
| 44–17
|- style="background:#fcc;"
| 62
| March 12
| Brooklyn
|
| Chris Bosh (24)
| Mario Chalmers (9)
| LeBron James (7)
| American Airlines Arena19,616
| 44–18
|- style="background:#fcc;"
| 63
| March 14
| Denver
|
| Ray Allen (22)
| Chris Bosh (8)
| James, Chalmers & Wade (6)
| American Airlines Arena19,600
| 44–19
|- style="background:#cfc;"
| 64
| March 16
| Houston
|
| Ray Allen (25)
| Chris Bosh (8)
| Dwyane Wade (7)
| American Airlines Arena19,666
| 45–19
|- style="background:#cfc;"
| 65
| March 18
| @ Cleveland
|
| LeBron James (43)
| Chris Andersen (8)
| Mario Chalmers (9)
| Quicken Loans Arena20,562
| 46–19
|- style="background:#fcc;"
| 66
| March 19
| @ Boston
|
| Dwyane Wade (17)
| Chris Bosh (11)
| Mario Chalmers (11)
| TD Garden18,624
| 46–20
|- style="background:#cfc;"
| 67
| March 21
| Memphis
|
| Ray Allen (18)
| LeBron James (6)
| LeBron James (7)
| American Airlines Arena20,007
| 47–20
|- style="background:#fcc;"
| 68
| March 22
| @ New Orleans
|
| LeBron James (25)
| LeBron James (8)
| LeBron James (9)
| Smoothie King Center18,185
| 47–21
|- style="background:#cfc;"
| 69
| March 24
| Portland
|
| LeBron James (32)
| Chris Andersen (11)
| LeBron James (5)
| American Airlines Arena20,030
| 48–21
|- style="background:#fcc;"
| 70
| March 26
| @ Indiana
|
| LeBron James (38)
| LeBron James (8)
| LeBron James (5)
| Bankers Life Fieldhouse18,165
| 48–22
|- style="background:#cfc;"
| 71
| March 28
| @ Detroit
|
| James & Haslem (17)
| LeBron James (10)
| LeBron James (12)
| Palace of Auburn Hills21,231
| 49-22
|- style="background:#cfc;"
| 72
| March 29
| @ Milwaukee
|
| Chris Bosh (14)
| Chris Andersen (14)
| Douglas & Cole (4)
| BMO Harris Bradley Center17,986
| 50-22
|- style="background:#cfc;"
| 73
| March 31
| Toronto
|
| LeBron James (32)
| James & Andersen (7)
| LeBron James (8)
| American Airlines Arena19,831
| 51-22
|- style="background:#cfc;"
| 74
| April 2
| Milwaukee
|
| LeBron James (17)
| Douglas & Andersen (7)
| LeBron James (8)
| American Airlines Arena19,609
| 52-22
|- style="background:#fcc;"
| 75
| April 4
| Minnesota
|
| LeBron James (34)
| Chris Bosh (9)
| Mario Chalmers (6)
| American Airlines Arena19,661
| 52-23
|- style="background:#cfc;"
| 76
| April 6
| New York
|
| LeBron James (38)
| Udonis Haslem (11)
| LeBron James (6)
| American Airlines Arena19,647
| 53-23
|- style="background:#fcc;"
| 77
| April 8
| Brooklyn
|
| LeBron James (29)
| LeBron James (10)
| LeBron James (6)
| American Airlines Arena19,600
| 53-24
|- style="background:#fcc;"
| 78
| April 9
| @ Memphis
|
| LeBron James (37)
| James & Bosh (6)
| James, Douglas & Cole (5)
| FedExForum18,119
| 53–25
|- style="background:#cfc;"
| 79
| April 11
| Indiana
|
| LeBron James (36)
| Udonis Haslem (9)
| Mario Chalmers (5)
| American Airlines Arena20,300
| 54–25
|- style="background:#fcc;"
| 80
| April 12
| @ Atlanta
|
| LeBron James (27)
| Haslem & James (8)
| LeBron James (5)
| Philips Arena19,287
| 54–26
|- style="background:#fcc;"
| 81
| April 14
| @ Washington
|
| Michael Beasley (18)
| Udonis Haslem (8)
| Norris Cole (7)
| Verizon Center20,356
| 54–27
|- style="background:#fcc;"
| 82
| April 16
| Philadelphia
|
| Dwyane Wade (16)
| Udonis Haslem (10)
| Douglas & Wade (4)
| American Airlines Arena20,350
| 54–28
Playoffs
Game log
|- style="background:#cfc;"
| 1
| April 20
| Charlotte
|
| LeBron James (27)
| Chris Andersen (10)
| Dwyane Wade (5)
| American Airlines Arena19,640
| 1–0
|- style="background:#cfc;"
| 2
| April 23
| Charlotte
|
| LeBron James (32)
| James & Wade (6)
| LeBron James (8)
| American Airlines Arena19,603
| 2–0
|- style="background:#cfc;"
| 3
| April 26
| @ Charlotte
|
| LeBron James (30)
| LeBron James (10)
| James & Wade (6)
| Time Warner Cable Arena19,633
| 3–0
|- style="background:#cfc;"
| 4
| April 28
| @ Charlotte
|
| LeBron James (31)
| Chris Bosh (8)
| LeBron James (9)
| Time Warner Cable Arena19,092
| 4–0
|- style="background:#cfc;"
| 1
| May 6
| Brooklyn
|
| LeBron James (22)
| Chris Bosh (11)
| Dwyane Wade (5)
| American Airlines Arena19,470
| 1–0
|- style="background:#cfc;"
| 2
| May 8
| Brooklyn
|
| LeBron James (22)
| Ray Allen (8)
| Dwyane Wade (7)
| American Airlines Arena19,639
| 2–0
|- style="background:#fcc;"
| 3
| May 10
| @ Brooklyn
|
| LeBron James (28)
| LeBron James (8)
| LeBron James (5)
| Barclays Center17,732
| 2–1
|- style="background:#cfc;"
| 4
| May 12
| @ Brooklyn
|
| LeBron James (49)
| Ray Allen (7)
| Mario Chalmers (7)
| Barclays Center17,732
| 3–1
|- style="background:#cfc;"
| 5
| May 14
| Brooklyn
|
| LeBron James (29)
| LeBron James (9)
| Mario Chalmers (7)
| American Airlines Arena19,615
| 4–1
|- style="background:#fcc;"
| 1
| May 18
| @ Indiana
|
| Dwyane Wade (27)
| LeBron James (10)
| James & Chalmers (5)
| Bankers Life Fieldhouse18,165
| 0–1
|- style="background:#cfc;"
| 2
| May 20
| @ Indiana
|
| Dwyane Wade (23)
| Chris Andersen (12)
| LeBron James (6)
| Bankers Life Fieldhouse18,165
| 1–1
|- style="background:#cfc;"
| 3
| May 24
| Indiana
|
| LeBron James (26)
| Chris Andersen (7)
| LeBron James (7)
| American Airlines Arena20,025
| 2–1
|- style="background:#cfc;"
| 4
| May 26
| Indiana
|
| LeBron James (32)
| LeBron James (10)
| LeBron James (5)
| American Airlines Arena19,874
| 3–1
|- style="background:#fcc;"
| 5
| May 28
| @ Indiana
|
| Chris Bosh (20)
| Chris Bosh (10)
| Dwyane Wade (7)
| Bankers Life Fieldhouse18,165
| 3–2
|- style="background:#cfc;"
| 6
| May 30
| Indiana
|
| Bosh & James (25)
| Chris Andersen (10)
| Wade & James (6)
| American Airlines Arena20,021
| 4–2
|- style="background:#fcc;"
| 1
| June 5
| @ San Antonio
|
| LeBron James (25)
| Chris Bosh (9)
| Norris Cole (5)
| AT&T Center18,581
| 0–1
|- style="background:#cfc;"
| 2
| June 8
| @ San Antonio
|
| LeBron James (35)
| LeBron James (10)
| Chalmers & Wade (4)
| AT&T Center18,581
| 1–1
|- style="background:#fcc;"
| 3
| June 10
| San Antonio
|
| James & Wade (22)
| James & Andersen (5)
| LeBron James (7)
| American Airlines Arena19,900
| 1–2
|- style="background:#fcc;"
| 4
| June 12
| San Antonio
|
| LeBron James (28)
| LeBron James (8)
| Mario Chalmers (5)
| American Airlines Arena19,900
| 1–3
|- style="background:#fcc;"
| 5
| June 15
| @ San Antonio
|
| LeBron James (31)
| LeBron James (10)
| LeBron James (5)
| AT&T Center18,581
| 1–4
Player statistics
Transactions
Overview
Free agents
References
External links
Miami
Miami Heat seasons
Eastern Conference (NBA) championship seasons
Miami Heat
Miami Heat
|
Blue Pool Bay is a small cove near the village of Llangennith in Gower, Wales. The cove is bordered by cliffs, and is accessible via a clifftop path and a steep, unstable path down to the beach. The beach is covered fully at high tide and takes its name from a large, natural rockpool. Rhossili Bay is nearby.
Since the release of a popular Tik Tok video showing the pool, there has been a drastic increase in footfall to the bay. This has resulted in heavy erosion on the path to the beach, as well as heavy littering, fly tipping and graffiti left by the now common crowds at the once little known location.
Description
The Bay is only reachable by footpath or from the neighbouring beach of Broughton Bay to the east.
At the west end of the bay is a natural rock arch, called the Blue Pool Arch or 3 Chimneys. The arch is completely submerged at high tide. The eponymous rockpool is 3 ft (0.9m) deep, and was formed naturally. The pool is completely uncovered at low tide, and separated from the sea by the beach. The pool is engulfed by the sea at high tide and becomes less defined. The beach is mostly sandy and surrounded by rocky cliffs. The beach is reachable by a rough coastal path leading down from the cliffs and from Spaniard Rocks and from Broughton Bay both at low tide. The depth mentioned here differs from the depth mentioned by the reference.
References
External links
GowerUK.com - Blue Pool Bay
Bays of the Gower Peninsula
Natural arches of Wales
|
Tomasz Imieliński (born July 11, 1954, in Toruń, Poland) is a Polish-American computer scientist, most known in the areas of data mining, mobile computing, data extraction, and search engine technology. He is currently a professor of computer science at Rutgers University in New Jersey, United States.
In 2000, he co-founded Connotate Technologies, a web data extraction company based in New Brunswick, NJ. Since 2004 till 2010 he had held multiple positions at Ask.com, from vice president of data solutions intelligence to executive vice president of global search and answers and chief scientist. From 2010 to 2012 he served as VP of data solutions at IAC/Pronto.
Tomasz Imieliński served as chairman of the Computer Science Department at Rutgers University from 1996 to 2003.
He co-founded, with Celina Imielińska and Konrad Imieliński Art Data Laboratories LLC company, and its product, Articker is the largest known database that aggregates dynamic non-price information about the visual artists in the global art market. Articker has been under an exclusive partnership with Phillips auction house.
Education
Tomasz Imieliński graduated with B.E/M.E degree in electrical engineering from Politechnika Gdańska in Gdańsk, Poland, and received his PhD, in 1982, in computer science, from Polish Academy of Sciences, in Poland, under supervision of Witold Lipski.
Career
After receiving his PhD, Tomasz Imieliński joined, for a year, faculty at the McGill University School of Computer Science at McGill University in Montreal. Since 1983, he joined the Computer Science Department at Rutgers University, in New Brunswick. He served as a chairman of the department, from 1996 to 2003. In 2000, he co-founded Connotate Technologies based on his data extraction research developed at Rutgers University. While on leave from Rutgers University, from 2004 to 2010, he had held multiple positions at Ask.com: vice president of data solutions, executive vice president of global search and answers, and chief scientist. Between 2010 and 2012, Tomasz Imieliński served as vice president of data solutions at Pronto. Tomasz Imieliński received numerous awards, such as 2018 The Tadeusz Sendzimir Applied Sciences Award.
Research and recognition
Imieliński-Lipski Algebras
Imieliński's early work on 'Incomplete Information in Relational Databases' produced a fundamental concept that became later known as Imieliński-Lipski Algebras.
Cylindric Algebras
According to Van den Bussche, the first people from database community to recognize the connection between Codd's relational algebra and Tarski's cylindric algebras were Witold Lipski and Tomasz Imieliński, in a talk given at the very first edition of PODS (the ACM Symposium on Principles of Database Systems), in 1982. Their work,"The relational model of data and cylindric algebras"
was later published in 1984.
Association Rule Mining
His joint 1993 paper with Agrawal and Swami, 'Mining Association Rules Between Sets of Items in Large Databases'
started the association rule mining research area, and it is one of the most cited publications in computer science, with over 25,000 citations according to Google Scholar. This paper received the 2003 - 10 year Test of Time ACM SIGMOD award, and is included in the list of important publications in computer science.
Mobile Computing
Imieliński has also been one of the pioneers of mobile computing and for his joint 1992 paper with Badri Nath on 'Querying in highly mobile distributed environments' he received the VLDB Ten Year Award in 2002.
Geocast
He proposed the idea of Geocast which would deliver information to a group of destinations in a network identified by their geographical locations. He proposed applications such as geographic messaging, geographic advertising, delivery of geographically restricted services, and presence discovery of a service or mobile network participant in a limited geographic area.
Patents
Overall, Imieliński has published over 150 papers, his papers have been cited over 44000 times. He is an inventor and co-inventor on multiple patents ranging from search technology to web data extraction as well as multimedia processing, data mining, and mobile computing (e.g. patent on "Method and system for audio access to information in a wide area computer network").
Other Interests
Tomasz Imieliński formed, in 2000, System Crash, an avant-garde rock group which combined heavy sound with philosophical and political lyrics and multimedia projection of videos and sounds of current world, real and virtual. System Crash consisted of three musicians Tomasz Imielinski vocal and guitar, James Jeude (bass) and Tomek Unrat (drums).
Since January 2006, the band had also gone by the name of "The Professor and System Crash", the band title used on their 2006 re-printing of their 2005 CD "War By Remote Control".
Internity, the first show of System Crash, focused on the internet revolution and its philosophical consequences – interplay between the virtual and real world, anthropomorphization of machines, programs and files. All lyrics were written by Tomasz Imieliński. Internity was featured in Knitting Factory, in 2001, and received enthusiastic reviews in Star Ledger and New York Times. System Crash played to sold-out audiences and quickly achieved cult status in the avant-garde music scene of New York City. The group stopped performing around 2007.
References
Other selected publications
External links
Tomasz Imieliński's Personal Web page at Rutgers University
Tomasz Imieliński at Google Scholar
Connotate Technologies, Inc
Null (SQL)
Association rule mining
Relational algebra
Imieliński-Lipski Algebras
Mobile Computing
Geocast
Cylindric algebra
List of important publications in computer science
1954 births
Living people
Polish computer scientists
Rutgers University faculty
Gdańsk University of Technology alumni
Polish emigrants to the United States
People from Toruń
|
```ruby
# frozen_string_literal: true
module Decidim
module Proposals
# A valuation assignment links a proposal and a Valuator user role.
# Valuators will be users in charge of defining the monetary cost of a
# proposal.
class ValuationAssignment < ApplicationRecord
include Decidim::Traceable
include Decidim::Loggable
belongs_to :proposal, foreign_key: "decidim_proposal_id", class_name: "Decidim::Proposals::Proposal",
counter_cache: true
belongs_to :valuator_role, polymorphic: true
def self.log_presenter_class_for(_log)
Decidim::Proposals::AdminLog::ValuationAssignmentPresenter
end
def valuator
valuator_role.user
end
end
end
end
```
|
Anxi may refer to:
Anxi County (), Quanzhou, Fujian
Guazhou County (), formerly Anxi County, in Jiuquan, Gansu
Guazhou Town, formerly Anxi Town (), in what is now Guazhou County
Protectorate General to Pacify the West, a Central-Asian military government established by Tang Dynasty
Arsacid Empire, rendered as Anxi in historical Chinese writings
Anxi., a song from Kelly Lee Owens' self-titled album.
|
is a former Japanese football player.
Playing career
Komata was born in Niigata Prefecture on July 15, 1964. After graduating from Osaka University of Commerce, he joined Yamaha Motors (later Júbilo Iwata) in 1987. He played as regular player as a defensive midfielder from the first season and the club won the championship in 1988. However his opportunity to play decreased in 1990s. In 1996, he moved to his local club Albireo Niigata (later Albirex Niigata) in the Regional Leagues. The club was promoted to the Japan Football League in 1998 and he retired at the end of the 1998 season.
Club statistics
References
External links
Júbilo Iwata
1964 births
Living people
Osaka University of Commerce alumni
Association football people from Niigata Prefecture
Japanese men's footballers
Japan Soccer League players
J1 League players
Japan Football League (1992–1998) players
Júbilo Iwata players
Albirex Niigata players
Men's association football midfielders
|
Katharina Elisabeth Schützenhöfer (born 22 September 1993) is an Austrian professional beach volleyball player who plays as a right-side defender with her partner Lena Plesiutschnig. She won the silver medal at the first ever European Games in 2015. Her first and only FIVB World Tour victory so far, came at a 3-star event in Mersin in 2018. She won a silver medal at the 2011 U19 World Championship and a bronze medal at the 2013 U21 World Championship, both competitions were held in Umag. She is also the 2011 U20 European Champion with Plesiutschnig.
Career podiums
FIVB World Tour
3 medals – (1 gold, 1 silver, 1 bronze)
CEV European Tour
2 medals – (1 silver, 1 bronze)
References
External links
Schützenhöfer / Plesiutschnig Official Site
Katharina Schützenhöfer at the Beach Volleyball Major Series
1993 births
Living people
Austrian beach volleyball players
Beach volleyball defenders
People from Oberwart
Beach volleyball players at the 2015 European Games
European Games medalists in beach volleyball
European Games silver medalists for Austria
Sportspeople from Burgenland
21st-century Austrian women
|
Mount Genecand () is a mountain at the head of Barilari Bay between Lawrie Glacier and Weir Glacier, on the west coast of Graham Land, Antarctica. It was photographed by Hunting Aerosurveys Ltd in 1955–57, and mapped from these photos by the Falkland Islands Dependencies Survey. It was named by the UK Antarctic Place-Names Committee in 1959 for Félix-Valentin Genecand (1878–1957), a Swiss mountaineer who invented the Tricouni nail for climbing boots shortly before World War I.
References
Mountains of Graham Land
Graham Coast
|
```go
package metrics
import (
"github.com/ipfs-cluster/ipfs-cluster/api"
peer "github.com/libp2p/go-libp2p/core/peer"
)
// PeersetFilter removes all metrics not belonging to the given
// peerset
func PeersetFilter(metrics []api.Metric, peerset []peer.ID) []api.Metric {
peerMap := make(map[peer.ID]struct{})
for _, pid := range peerset {
peerMap[pid] = struct{}{}
}
filtered := make([]api.Metric, 0, len(metrics))
for _, metric := range metrics {
_, ok := peerMap[metric.Peer]
if !ok {
continue
}
filtered = append(filtered, metric)
}
return filtered
}
```
|
```go
// of this distribution or at path_to_url
package historyarchive
import (
"fmt"
"strings"
"github.com/stellar/go/support/ordered"
"golang.org/x/exp/slices"
)
const DefaultCheckpointFrequency = uint32(64)
type Range struct {
Low uint32
High uint32
}
type CheckpointManager struct {
checkpointFreq uint32
}
// NewCheckpointManager creates a CheckpointManager based on a checkpoint frequency
// (the number of ledgers between ledger checkpoints). If checkpointFrequency is
// 0 DefaultCheckpointFrequency will be used.
func NewCheckpointManager(checkpointFrequency uint32) CheckpointManager {
if checkpointFrequency == 0 {
checkpointFrequency = DefaultCheckpointFrequency
}
return CheckpointManager{checkpointFrequency}
}
func (c CheckpointManager) GetCheckpointFrequency() uint32 {
return c.checkpointFreq
}
func (c CheckpointManager) IsCheckpoint(i uint32) bool {
return (i+1)%c.checkpointFreq == 0
}
// PrevCheckpoint returns the checkpoint ledger preceding `i`.
func (c CheckpointManager) PrevCheckpoint(i uint32) uint32 {
freq := c.checkpointFreq
if i < freq {
return freq - 1
}
return (((i + 1) / freq) * freq) - 1
}
// NextCheckpoint returns the checkpoint ledger following `i`.
func (c CheckpointManager) NextCheckpoint(i uint32) uint32 {
if i == 0 {
return c.checkpointFreq - 1
}
freq := uint64(c.checkpointFreq)
v := uint64(i)
n := (((v + freq) / freq) * freq) - 1
return uint32(ordered.Min(n, 0xffffffff))
}
// GetCheckPoint gets the checkpoint containing information about the given ledger sequence
func (c CheckpointManager) GetCheckpoint(i uint32) uint32 {
return c.NextCheckpoint(i)
}
// GetCheckpointRange gets the range of the checkpoint containing information for the given ledger sequence
func (c CheckpointManager) GetCheckpointRange(i uint32) Range {
checkpoint := c.GetCheckpoint(i)
low := checkpoint - c.checkpointFreq + 1
if low == 0 {
// ledger 0 does not exist
low++
}
return Range{
Low: low,
High: checkpoint,
}
}
func (c CheckpointManager) MakeRange(low uint32, high uint32) Range {
high = ordered.Max(high, low)
return Range{
Low: c.PrevCheckpoint(low),
High: c.NextCheckpoint(high),
}
}
func (r Range) clamp(other Range, cManager CheckpointManager) Range {
low := ordered.Max(r.Low, other.Low)
high := ordered.Min(r.High, other.High)
return cManager.MakeRange(low, high)
}
func (r Range) String() string {
return fmt.Sprintf("[0x%8.8x, 0x%8.8x]", r.Low, r.High)
}
func (r Range) GenerateCheckpoints(cManager CheckpointManager) chan uint32 {
ch := make(chan uint32)
go func() {
for i := uint64(r.Low); i <= uint64(r.High); i += uint64(cManager.checkpointFreq) {
ch <- uint32(i)
}
close(ch)
}()
return ch
}
func (r Range) SizeInCheckPoints(cManager CheckpointManager) int {
return 1 + (int(r.High-r.Low) / int(cManager.checkpointFreq))
}
func (r Range) collapsedString() string {
if r.Low == r.High {
return fmt.Sprintf("0x%8.8x", r.Low)
}
return fmt.Sprintf("[0x%8.8x-0x%8.8x]", r.Low, r.High)
}
func (r Range) InRange(sequence uint32) bool {
return sequence >= r.Low && sequence <= r.High
}
func (r Range) Size() uint32 {
return 1 + (r.High - r.Low)
}
func fmtRangeList(vs []uint32, cManager CheckpointManager) string {
slices.Sort(vs)
s := make([]string, 0, 10)
var curr *Range
for _, t := range vs {
if curr != nil {
if curr.High+cManager.checkpointFreq == t {
curr.High = t
continue
} else {
s = append(s, curr.collapsedString())
curr = nil
}
}
curr = &Range{Low: t, High: t}
}
if curr != nil {
s = append(s, curr.collapsedString())
}
return strings.Join(s, ", ")
}
```
|
```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\RecommendationsAI;
class GoogleCloudRecommendationengineV1beta1RejoinUserEventsResponse extends \Google\Model
{
/**
* @var string
*/
public $rejoinedUserEventsCount;
/**
* @param string
*/
public function setRejoinedUserEventsCount($rejoinedUserEventsCount)
{
$this->rejoinedUserEventsCount = $rejoinedUserEventsCount;
}
/**
* @return string
*/
public function getRejoinedUserEventsCount()
{
return $this->rejoinedUserEventsCount;
}
}
// Adding a class alias for backwards compatibility with the previous class name.
class_alias(GoogleCloudRecommendationengineV1beta1RejoinUserEventsResponse::class, your_sha256_hashV1beta1RejoinUserEventsResponse');
```
|
Christy Hartburg is an actress and model who appeared in Russ Meyer's Supervixens (1975). She is the actress who adorns the famous poster for that film. She performed on several Bob Hope tours to Vietnam in the late sixties and early seventies.
She also performed under the alias Christina Cummings in several films and TV shows.
References
External links
American film actresses
Year of birth missing (living people)
Living people
21st-century American women
|
```xml
import * as React from 'react';
import { ReactElement, ReactNode } from 'react';
import { Link, useLocation } from 'react-router-dom';
import { Tab as MuiTab, TabProps as MuiTabProps } from '@mui/material';
import clsx from 'clsx';
import { useTranslate, useFormGroup } from 'ra-core';
import { TabbedFormClasses } from './TabbedFormView';
export const FormTabHeader = ({
count,
label,
value,
icon,
className,
onChange,
syncWithLocation,
...rest
}: FormTabHeaderProps): ReactElement => {
const translate = useTranslate();
const location = useLocation();
const formGroup = useFormGroup(value.toString());
const propsForLink = {
component: Link,
to: { ...location, pathname: value },
};
let tabLabel =
typeof label === 'string' ? translate(label, { _: label }) : label;
if (count !== undefined) {
tabLabel = (
<span>
{tabLabel} ({count})
</span>
);
}
return (
<MuiTab
label={tabLabel}
value={value}
icon={icon}
className={clsx('form-tab', className, {
[TabbedFormClasses.errorTabButton]: !formGroup.isValid,
error: !formGroup.isValid,
})}
{...(syncWithLocation ? propsForLink : {})} // to avoid TypeScript screams, see path_to_url#issuecomment-451270521
id={`tabheader-${value}`}
aria-controls={`tabpanel-${value}`}
onChange={onChange}
{...rest}
/>
);
};
interface FormTabHeaderProps extends Omit<MuiTabProps, 'children'> {
className?: string;
count?: ReactNode;
hidden?: boolean;
icon?: ReactElement;
intent?: 'header' | 'content';
label: string | ReactElement;
margin?: 'none' | 'normal' | 'dense';
onChange?: (event: any) => void;
path?: string;
resource?: string;
syncWithLocation?: boolean;
value: string | number;
variant?: 'standard' | 'outlined' | 'filled';
}
```
|
```javascript
/**
* Created by lipeiwei on 16/10/6.
*/
import React, {PropTypes} from 'react';
import {
ListView,
ScrollView,
Text,
Image,
View,
StyleSheet,
TouchableOpacity,
InteractionManager
} from 'react-native';
import BaseComponent from '../base/baseComponent';
import {getEssayDetailInfo} from '../api/reading';
import commonStyle from '../style/commonStyle';
import {parseDate} from '../util/dateUtil';
import monthArray from '../constant/month';
import {connect} from 'react-redux';
import {bindActionCreators} from 'redux';
import {stopPlayMedia, startPlayMedia} from '../actions/media';
import BottomInfo from './bottomInfo';
import {getNavigator} from '../route';
import LoadingManagerView from './loadingManagerView';
import CommentListView from './commentListView';
import CommentType from '../constant/commentType';
const styles = StyleSheet.create({
container: {
flex: 1,
},
rowContainer: {
flexDirection: 'row',
justifyContent: 'space-between',
alignItems: 'center',
padding: 10,
},
avatarImage: {
height: 50,
width: 50,
borderRadius: 25
},
authorInfo: {
marginLeft: 10
},
authorName: {
color: commonStyle.LIGHT_BLUE_COLOR
},
timeText: {
color: commonStyle.TEXT_GRAY_COLOR,
marginTop: 5
},
titleText: {
marginVertical: 10,
color: commonStyle.TEXT_COLOR,
fontSize: 20,
padding: 10,
},
contentText: {
color: commonStyle.TEXT_COLOR,
fontSize: 16,
padding: 10,
},
smallIcon: {
width: 30,
height: 30
},
grayViewContainer: {
paddingHorizontal: 10,
paddingVertical: 10,
backgroundColor: commonStyle.LIGHT_GRAY_COLOR,
flexDirection: 'row',
alignItems: 'center',
justifyContent: 'space-between'
},
lightGrayText: {
color: commonStyle.TEXT_GRAY_COLOR,
fontSize: 14
},
});
class ReadingEssayDetail extends BaseComponent {
constructor(props) {
super(props);
this.fetchData = this.fetchData.bind(this);
this.renderArticleContent = this.renderArticleContent.bind(this);
this.onAvatarImagePress = this.onAvatarImagePress.bind(this);
this.renderMediaButton = this.renderMediaButton.bind(this);
this.onMediaPressed = this.onMediaPressed.bind(this);
this.onSharePressed = this.onSharePressed.bind(this);
this.state = {
detailData: null,
loadingStatus: LoadingManagerView.Loading
};
}
getNavigationBarProps() {
return {
title: '',
hideRightButton: true,
leftButtonImage: require('../image/return.png')
};
}
componentDidMount() {
InteractionManager.runAfterInteractions(this.fetchData);
}
fetchData() {
if (this.props.id){
this.setState({//
loadingStatus: LoadingManagerView.Loading
});
getEssayDetailInfo(this.props.id).then(detailData => {
this.setState({
detailData,
loadingStatus: LoadingManagerView.LoadingSuccess//
});
}).catch(() => {
this.setState({
loadingStatus: LoadingManagerView.LoadingError//
});
});
} else {
console.warn(`the component 'ReadingEssayDetail' should has 'this.props.id'`);
}
}
renderBody() {
const {loadingStatus, detailData} = this.state;
if (loadingStatus === LoadingManagerView.LoadingSuccess) {
return (
<View style={{flex: 1}}>
<CommentListView
renderHeader={this.renderArticleContent}
type={CommentType.ESSAY}
id={parseInt(detailData.content_id)}/>
<BottomInfo
praiseNum={detailData.praisenum}
commentNum={detailData.commentnum}
shareNum={detailData.sharenum}
onSharePressed={this.onSharePressed}/>
</View>
);
}
return (
<LoadingManagerView status={loadingStatus} onFetchData={this.fetchData}/>
);
}
renderArticleContent() {
const {detailData} = this.state;
const date = parseDate(detailData.hp_makettime);
var day = date.getDate();
if (day < 10) {
day = `0${day}`;
}
const dateStr = `${monthArray[date.getMonth()]} ${day}.${date.getFullYear()}`;
return (
<View style={styles.container}>
<View style={styles.rowContainer}>
<View style={{flexDirection: 'row', alignItems: 'center'}}>
<TouchableOpacity onPress={this.onAvatarImagePress}>
<Image style={styles.avatarImage} source={{uri: detailData.author[0].web_url}}/>
</TouchableOpacity>
<View style={styles.authorInfo}>
<Text style={styles.authorName}>{detailData.hp_author}</Text>
<Text style={styles.timeText}>{dateStr}</Text>
</View>
</View>
{this.renderMediaButton()}
</View>
<Text style={styles.titleText}>{detailData.hp_title}</Text>
<Text selectable={true} style={styles.contentText}>{detailData.hp_content}</Text>
<View style={styles.grayViewContainer}>
<Text style={styles.lightGrayText}></Text>
</View>
</View>
);
}
onAvatarImagePress() {
//
}
renderMediaButton() {
const {detailData} = this.state;
if (!detailData.audio) {//
return null;
}
const {
isPlaying,
} = this.props;
return (
<TouchableOpacity onPress={this.onMediaPressed}>
<View style={{flexDirection: 'row', alignItems: 'center'}}>
<Image style={styles.smallIcon} resizeMode="contain"
source={isPlaying ? require('../image/article_pause.png') : require('../image/article_play.png')}/>
<Text>{isPlaying ? '' : ''}</Text>
</View>
</TouchableOpacity>
);
}
onMediaPressed() {
const {detailData} = this.state;
const {isPlaying, id, stopPlayMedia, startPlayMedia} = this.props;
if (isPlaying) {
stopPlayMedia();
} else {
startPlayMedia({
id: id,
url: detailData.audio,
type: 'essay',
musicName: detailData.hp_title,
authorName: detailData.hp_author
});
}
}
onSharePressed() {
const {detailData} = this.state;
getNavigator().push({
name: 'SharePage',
shareData: {
type: 'news',
webpageUrl: detailData.web_url,
thumbImage: 'ic_launcher',
title: `${detailData.hp_title}` ,
description: `/ ${detailData.hp_author} ${detailData.guide_word}`
}
});
}
}
ReadingEssayDetail.propTypes = {
id: PropTypes.number.isRequired,
isPlaying: PropTypes.bool.isRequired,
stopPlayMedia: PropTypes.func.isRequired,
startPlayMedia: PropTypes.func.isRequired
};
const mapStateToProps = (state, props) => {
var media = state.media;
var currentMedia = media.mediaList[media.currentIndex];
return {
isPlaying: media.isPlayingMedia && currentMedia && currentMedia.type === 'essay' && currentMedia.id === props.id
};
};
const mapDispatchToProps = dispatch => {
return {
stopPlayMedia: bindActionCreators(stopPlayMedia, dispatch),
startPlayMedia: bindActionCreators(startPlayMedia, dispatch),
};
};
export default connect(mapStateToProps, mapDispatchToProps)(ReadingEssayDetail);
```
|
```yaml
apiVersion: fission.io/v1
kind: Environment
metadata:
creationTimestamp: null
name: nodend
namespace: default
spec:
terminationGracePeriod: 360
builder: {}
keeparchive: false
poolsize: 0
resources: {}
runtime:
image: fission/node-env
container:
name: nodend
volumeMounts:
- name: cvol
mountPath: /etc/cvoldata
readOnly: true
podspec:
hostname: foo-bar
# A container which will be merged with for pool manager
containers:
- name: nodend
image: fission/node-env
volumeMounts:
- name: funcvol
mountPath: /etc/funcdata
readOnly: true
# A additional container in the pods
- name: yanode
image: fission/node-env
command: ['sh', '-c', 'sleep 36000000000']
# Init container before function
initContainers:
- name: init-node
image: fission/node-env
command: ['sh', '-c', 'cat /etc/infopod/labels']
volumeMounts:
- name: infopod
mountPath: /etc/infopod
readOnly: false
tolerations:
- key: "reservation"
operator: "Equal"
value: "fission"
effect: "NoSchedule"
# Additional volumes
volumes:
- name: infopod
downwardAPI:
items:
- path: "labels"
fieldRef:
fieldPath: metadata.labels
- name: funcvol
downwardAPI:
items:
- path: "labels"
fieldRef:
fieldPath: metadata.labels
- name: cvol
downwardAPI:
items:
- path: "labels"
fieldRef:
fieldPath: metadata.labels
version: 3
```
|
```shell
The `setuid` permission
The `sticky bit` permission
Understanding `umask`
Set file permissions for users
The `setgid` permission
```
|
```smalltalk
namespace Asp.Versioning;
using System.Net.Http;
using System.Net.Http.Formatting;
using System.Net.Http.Headers;
using static System.Net.Http.HttpMethod;
[Trait( "Kind", "Acceptance" )]
#if NETFRAMEWORK
[Trait( "ASP.NET", "Web API" )]
#else
[Trait( "ASP.NET", "Core" )]
#endif
public abstract partial class AcceptanceTest : IDisposable
{
private static readonly HttpMethod Patch = new( "PATCH" );
private readonly Lazy<HttpClient> client;
private bool disposed;
protected AcceptanceTest( HttpServerFixture fixture ) => client = new( fixture.CreateClient );
protected HttpClient Client => client.Value;
public void Dispose()
{
Dispose( true );
GC.SuppressFinalize( this );
}
protected virtual void Dispose( bool disposing )
{
if ( disposed )
{
return;
}
disposed = true;
if ( disposing && client.IsValueCreated )
{
client.Value.Dispose();
}
}
private HttpRequestMessage CreateRequest<TEntity>( string requestUri, TEntity entity, HttpMethod method )
{
AddDefaultAcceptHeaderIfNecessary();
var request = new HttpRequestMessage( method, requestUri );
if ( Equals( entity, default( TEntity ) ) )
{
return request;
}
if ( entity is HttpContent content )
{
request.Content = content;
}
else
{
request.Content = new ObjectContent<TEntity>(
entity,
new JsonMediaTypeFormatter(),
JsonMediaTypeFormatter.DefaultMediaType );
}
return request;
}
private HttpRequestMessage CreateRequest( string requestUri, HttpContent content, HttpMethod method )
{
AddDefaultAcceptHeaderIfNecessary();
return new HttpRequestMessage( method, requestUri ) { Content = content };
}
protected virtual Task<HttpResponseMessage> GetAsync( string requestUri ) => Client.SendAsync( CreateRequest( requestUri, default( object ), Get ) );
protected virtual Task<HttpResponseMessage> PostAsync<TEntity>( string requestUri, TEntity entity ) => Client.SendAsync( CreateRequest( requestUri, entity, Post ) );
protected virtual Task<HttpResponseMessage> PostAsync( string requestUri, HttpContent content ) => Client.SendAsync( CreateRequest( requestUri, content, Post ) );
protected virtual Task<HttpResponseMessage> PutAsync<TEntity>( string requestUri, TEntity entity ) => Client.SendAsync( CreateRequest( requestUri, entity, Put ) );
protected virtual Task<HttpResponseMessage> PutAsync( string requestUri, HttpContent content ) => Client.SendAsync( CreateRequest( requestUri, content, Put ) );
protected virtual Task<HttpResponseMessage> PatchAsync<TEntity>( string requestUri, TEntity entity ) => Client.SendAsync( CreateRequest( requestUri, entity, Patch ) );
protected virtual Task<HttpResponseMessage> PatchAsync( string requestUri, HttpContent content ) => Client.SendAsync( CreateRequest( requestUri, content, Patch ) );
protected virtual Task<HttpResponseMessage> DeleteAsync( string requestUri ) => Client.SendAsync( CreateRequest( requestUri, default( object ), Delete ) );
private void AddDefaultAcceptHeaderIfNecessary()
{
var accept = Client.DefaultRequestHeaders.Accept;
var mediaType = JsonMediaTypeFormatter.DefaultMediaType.MediaType;
var comparer = StringComparer.OrdinalIgnoreCase;
foreach ( var item in accept )
{
if ( comparer.Equals( item.MediaType, mediaType ) )
{
return;
}
}
accept.Add( new MediaTypeWithQualityHeaderValue( mediaType ) );
}
}
```
|
```php
<?php
/*
* This file is part of PhpSpec, A php toolset to drive emergent
* design by specification.
*
* (c) Marcello Duarte <marcello.duarte@gmail.com>
* (c) Konstantin Kudryashov <ever.zet@gmail.com>
*
* For the full copyright and license information, please view the LICENSE
* file that was distributed with this source code.
*/
namespace PhpSpec\Matcher;
use PhpSpec\Formatter\Presenter\PresenterInterface;
use PhpSpec\Exception\Example\FailureException;
class StringRegexMatcher extends BasicMatcher
{
/**
* @var PresenterInterface
*/
private $presenter;
/**
* @param PresenterInterface $presenter
*/
public function __construct(PresenterInterface $presenter)
{
$this->presenter = $presenter;
}
/**
* @param string $name
* @param mixed $subject
* @param array $arguments
*
* @return bool
*/
public function supports($name, $subject, array $arguments)
{
return 'match' === $name
&& is_string($subject)
&& 1 == count($arguments)
;
}
/**
* @param mixed $subject
* @param array $arguments
*
* @return bool
*/
protected function matches($subject, array $arguments)
{
return (Boolean) preg_match($arguments[0], $subject);
}
/**
* @param string $name
* @param mixed $subject
* @param array $arguments
*
* @return FailureException
*/
protected function getFailureException($name, $subject, array $arguments)
{
return new FailureException(sprintf(
'Expected %s to match %s regex, but it does not.',
$this->presenter->presentString($subject),
$this->presenter->presentString($arguments[0])
));
}
/**
* @param string $name
* @param mixed $subject
* @param array $arguments
*
* @return FailureException
*/
protected function getNegativeFailureException($name, $subject, array $arguments)
{
return new FailureException(sprintf(
'Expected %s not to match %s regex, but it does.',
$this->presenter->presentString($subject),
$this->presenter->presentString($arguments[0])
));
}
}
```
|
```c
/*
*
* in the file LICENSE in the source distribution or at
* path_to_url
*/
/*
* Experimental ASN1 BIO. When written through the data is converted to an
* ASN1 string type: default is OCTET STRING. Additional functions can be
* provided to add prefix and suffix data.
*/
#include <string.h>
#include "internal/bio.h"
#include <openssl/asn1.h>
#include "internal/cryptlib.h"
/* Must be large enough for biggest tag+length */
#define DEFAULT_ASN1_BUF_SIZE 20
typedef enum {
ASN1_STATE_START,
ASN1_STATE_PRE_COPY,
ASN1_STATE_HEADER,
ASN1_STATE_HEADER_COPY,
ASN1_STATE_DATA_COPY,
ASN1_STATE_POST_COPY,
ASN1_STATE_DONE
} asn1_bio_state_t;
typedef struct BIO_ASN1_EX_FUNCS_st {
asn1_ps_func *ex_func;
asn1_ps_func *ex_free_func;
} BIO_ASN1_EX_FUNCS;
typedef struct BIO_ASN1_BUF_CTX_t {
/* Internal state */
asn1_bio_state_t state;
/* Internal buffer */
unsigned char *buf;
/* Size of buffer */
int bufsize;
/* Current position in buffer */
int bufpos;
/* Current buffer length */
int buflen;
/* Amount of data to copy */
int copylen;
/* Class and tag to use */
int asn1_class, asn1_tag;
asn1_ps_func *prefix, *prefix_free, *suffix, *suffix_free;
/* Extra buffer for prefix and suffix data */
unsigned char *ex_buf;
int ex_len;
int ex_pos;
void *ex_arg;
} BIO_ASN1_BUF_CTX;
static int asn1_bio_write(BIO *h, const char *buf, int num);
static int asn1_bio_read(BIO *h, char *buf, int size);
static int asn1_bio_puts(BIO *h, const char *str);
static int asn1_bio_gets(BIO *h, char *str, int size);
static long asn1_bio_ctrl(BIO *h, int cmd, long arg1, void *arg2);
static int asn1_bio_new(BIO *h);
static int asn1_bio_free(BIO *data);
static long asn1_bio_callback_ctrl(BIO *h, int cmd, BIO_info_cb *fp);
static int asn1_bio_init(BIO_ASN1_BUF_CTX *ctx, int size);
static int asn1_bio_flush_ex(BIO *b, BIO_ASN1_BUF_CTX *ctx,
asn1_ps_func *cleanup, asn1_bio_state_t next);
static int asn1_bio_setup_ex(BIO *b, BIO_ASN1_BUF_CTX *ctx,
asn1_ps_func *setup,
asn1_bio_state_t ex_state,
asn1_bio_state_t other_state);
static const BIO_METHOD methods_asn1 = {
BIO_TYPE_ASN1,
"asn1",
/* TODO: Convert to new style write function */
bwrite_conv,
asn1_bio_write,
/* TODO: Convert to new style read function */
bread_conv,
asn1_bio_read,
asn1_bio_puts,
asn1_bio_gets,
asn1_bio_ctrl,
asn1_bio_new,
asn1_bio_free,
asn1_bio_callback_ctrl,
};
const BIO_METHOD *BIO_f_asn1(void)
{
return &methods_asn1;
}
static int asn1_bio_new(BIO *b)
{
BIO_ASN1_BUF_CTX *ctx = OPENSSL_zalloc(sizeof(*ctx));
if (ctx == NULL)
return 0;
if (!asn1_bio_init(ctx, DEFAULT_ASN1_BUF_SIZE)) {
OPENSSL_free(ctx);
return 0;
}
BIO_set_data(b, ctx);
BIO_set_init(b, 1);
return 1;
}
static int asn1_bio_init(BIO_ASN1_BUF_CTX *ctx, int size)
{
if ((ctx->buf = OPENSSL_malloc(size)) == NULL) {
ASN1err(ASN1_F_ASN1_BIO_INIT, ERR_R_MALLOC_FAILURE);
return 0;
}
ctx->bufsize = size;
ctx->asn1_class = V_ASN1_UNIVERSAL;
ctx->asn1_tag = V_ASN1_OCTET_STRING;
ctx->state = ASN1_STATE_START;
return 1;
}
static int asn1_bio_free(BIO *b)
{
BIO_ASN1_BUF_CTX *ctx;
if (b == NULL)
return 0;
ctx = BIO_get_data(b);
if (ctx == NULL)
return 0;
OPENSSL_free(ctx->buf);
OPENSSL_free(ctx);
BIO_set_data(b, NULL);
BIO_set_init(b, 0);
return 1;
}
static int asn1_bio_write(BIO *b, const char *in, int inl)
{
BIO_ASN1_BUF_CTX *ctx;
int wrmax, wrlen, ret;
unsigned char *p;
BIO *next;
ctx = BIO_get_data(b);
next = BIO_next(b);
if (in == NULL || inl < 0 || ctx == NULL || next == NULL)
return 0;
wrlen = 0;
ret = -1;
for (;;) {
switch (ctx->state) {
/* Setup prefix data, call it */
case ASN1_STATE_START:
if (!asn1_bio_setup_ex(b, ctx, ctx->prefix,
ASN1_STATE_PRE_COPY, ASN1_STATE_HEADER))
return 0;
break;
/* Copy any pre data first */
case ASN1_STATE_PRE_COPY:
ret = asn1_bio_flush_ex(b, ctx, ctx->prefix_free,
ASN1_STATE_HEADER);
if (ret <= 0)
goto done;
break;
case ASN1_STATE_HEADER:
ctx->buflen = ASN1_object_size(0, inl, ctx->asn1_tag) - inl;
if (!ossl_assert(ctx->buflen <= ctx->bufsize))
return 0;
p = ctx->buf;
ASN1_put_object(&p, 0, inl, ctx->asn1_tag, ctx->asn1_class);
ctx->copylen = inl;
ctx->state = ASN1_STATE_HEADER_COPY;
break;
case ASN1_STATE_HEADER_COPY:
ret = BIO_write(next, ctx->buf + ctx->bufpos, ctx->buflen);
if (ret <= 0)
goto done;
ctx->buflen -= ret;
if (ctx->buflen)
ctx->bufpos += ret;
else {
ctx->bufpos = 0;
ctx->state = ASN1_STATE_DATA_COPY;
}
break;
case ASN1_STATE_DATA_COPY:
if (inl > ctx->copylen)
wrmax = ctx->copylen;
else
wrmax = inl;
ret = BIO_write(next, in, wrmax);
if (ret <= 0)
goto done;
wrlen += ret;
ctx->copylen -= ret;
in += ret;
inl -= ret;
if (ctx->copylen == 0)
ctx->state = ASN1_STATE_HEADER;
if (inl == 0)
goto done;
break;
case ASN1_STATE_POST_COPY:
case ASN1_STATE_DONE:
BIO_clear_retry_flags(b);
return 0;
}
}
done:
BIO_clear_retry_flags(b);
BIO_copy_next_retry(b);
return (wrlen > 0) ? wrlen : ret;
}
static int asn1_bio_flush_ex(BIO *b, BIO_ASN1_BUF_CTX *ctx,
asn1_ps_func *cleanup, asn1_bio_state_t next)
{
int ret;
if (ctx->ex_len <= 0)
return 1;
for (;;) {
ret = BIO_write(BIO_next(b), ctx->ex_buf + ctx->ex_pos, ctx->ex_len);
if (ret <= 0)
break;
ctx->ex_len -= ret;
if (ctx->ex_len > 0)
ctx->ex_pos += ret;
else {
if (cleanup)
cleanup(b, &ctx->ex_buf, &ctx->ex_len, &ctx->ex_arg);
ctx->state = next;
ctx->ex_pos = 0;
break;
}
}
return ret;
}
static int asn1_bio_setup_ex(BIO *b, BIO_ASN1_BUF_CTX *ctx,
asn1_ps_func *setup,
asn1_bio_state_t ex_state,
asn1_bio_state_t other_state)
{
if (setup && !setup(b, &ctx->ex_buf, &ctx->ex_len, &ctx->ex_arg)) {
BIO_clear_retry_flags(b);
return 0;
}
if (ctx->ex_len > 0)
ctx->state = ex_state;
else
ctx->state = other_state;
return 1;
}
static int asn1_bio_read(BIO *b, char *in, int inl)
{
BIO *next = BIO_next(b);
if (next == NULL)
return 0;
return BIO_read(next, in, inl);
}
static int asn1_bio_puts(BIO *b, const char *str)
{
return asn1_bio_write(b, str, strlen(str));
}
static int asn1_bio_gets(BIO *b, char *str, int size)
{
BIO *next = BIO_next(b);
if (next == NULL)
return 0;
return BIO_gets(next, str, size);
}
static long asn1_bio_callback_ctrl(BIO *b, int cmd, BIO_info_cb *fp)
{
BIO *next = BIO_next(b);
if (next == NULL)
return 0;
return BIO_callback_ctrl(next, cmd, fp);
}
static long asn1_bio_ctrl(BIO *b, int cmd, long arg1, void *arg2)
{
BIO_ASN1_BUF_CTX *ctx;
BIO_ASN1_EX_FUNCS *ex_func;
long ret = 1;
BIO *next;
ctx = BIO_get_data(b);
if (ctx == NULL)
return 0;
next = BIO_next(b);
switch (cmd) {
case BIO_C_SET_PREFIX:
ex_func = arg2;
ctx->prefix = ex_func->ex_func;
ctx->prefix_free = ex_func->ex_free_func;
break;
case BIO_C_GET_PREFIX:
ex_func = arg2;
ex_func->ex_func = ctx->prefix;
ex_func->ex_free_func = ctx->prefix_free;
break;
case BIO_C_SET_SUFFIX:
ex_func = arg2;
ctx->suffix = ex_func->ex_func;
ctx->suffix_free = ex_func->ex_free_func;
break;
case BIO_C_GET_SUFFIX:
ex_func = arg2;
ex_func->ex_func = ctx->suffix;
ex_func->ex_free_func = ctx->suffix_free;
break;
case BIO_C_SET_EX_ARG:
ctx->ex_arg = arg2;
break;
case BIO_C_GET_EX_ARG:
*(void **)arg2 = ctx->ex_arg;
break;
case BIO_CTRL_FLUSH:
if (next == NULL)
return 0;
/* Call post function if possible */
if (ctx->state == ASN1_STATE_HEADER) {
if (!asn1_bio_setup_ex(b, ctx, ctx->suffix,
ASN1_STATE_POST_COPY, ASN1_STATE_DONE))
return 0;
}
if (ctx->state == ASN1_STATE_POST_COPY) {
ret = asn1_bio_flush_ex(b, ctx, ctx->suffix_free,
ASN1_STATE_DONE);
if (ret <= 0)
return ret;
}
if (ctx->state == ASN1_STATE_DONE)
return BIO_ctrl(next, cmd, arg1, arg2);
else {
BIO_clear_retry_flags(b);
return 0;
}
default:
if (next == NULL)
return 0;
return BIO_ctrl(next, cmd, arg1, arg2);
}
return ret;
}
static int asn1_bio_set_ex(BIO *b, int cmd,
asn1_ps_func *ex_func, asn1_ps_func *ex_free_func)
{
BIO_ASN1_EX_FUNCS extmp;
extmp.ex_func = ex_func;
extmp.ex_free_func = ex_free_func;
return BIO_ctrl(b, cmd, 0, &extmp);
}
static int asn1_bio_get_ex(BIO *b, int cmd,
asn1_ps_func **ex_func,
asn1_ps_func **ex_free_func)
{
BIO_ASN1_EX_FUNCS extmp;
int ret;
ret = BIO_ctrl(b, cmd, 0, &extmp);
if (ret > 0) {
*ex_func = extmp.ex_func;
*ex_free_func = extmp.ex_free_func;
}
return ret;
}
int BIO_asn1_set_prefix(BIO *b, asn1_ps_func *prefix,
asn1_ps_func *prefix_free)
{
return asn1_bio_set_ex(b, BIO_C_SET_PREFIX, prefix, prefix_free);
}
int BIO_asn1_get_prefix(BIO *b, asn1_ps_func **pprefix,
asn1_ps_func **pprefix_free)
{
return asn1_bio_get_ex(b, BIO_C_GET_PREFIX, pprefix, pprefix_free);
}
int BIO_asn1_set_suffix(BIO *b, asn1_ps_func *suffix,
asn1_ps_func *suffix_free)
{
return asn1_bio_set_ex(b, BIO_C_SET_SUFFIX, suffix, suffix_free);
}
int BIO_asn1_get_suffix(BIO *b, asn1_ps_func **psuffix,
asn1_ps_func **psuffix_free)
{
return asn1_bio_get_ex(b, BIO_C_GET_SUFFIX, psuffix, psuffix_free);
}
```
|
Marie-Guillemine Benoist, born Marie-Guillemine Laville-Leroux (December 18, 1768 – October 8, 1826), was a French neoclassical, historical, and genre painter.
Biography
Benoist was born in Paris, the daughter of a civil servant. Her training as an artist began in 1781 under Élisabeth Vigée Le Brun, and she entered Jacques-Louis David's atelier in 1786 along with her sister Marie-Élisabeth Laville-Leroux.
The poet Charles-Albert Demoustier, who met her in 1784, was inspired by her in creating the character Émilie in his work Lettres à Émilie sur la mythologie (1801).
In 1791, Benoist exhibited for the first time at the Paris Salon, displaying her mythology-inspired picture Psyché faisant ses adieux à sa famille. Another of her paintings of this period, L'Innocence entre la vertu et le vice, is similarly mythological and reveals her feminist interests—in this picture, vice is represented by a man, although it was traditionally represented by a woman. In 1793, she married the lawyer .
Her work, reflecting the influence of Jacques-Louis David, tended increasingly toward history painting by 1795. In 1800, Benoist exhibited Portrait d'une négresse (as of 2019 renamed Portrait of Madeleine) in the Salon. Six years previously, slavery had been abolished, and this image became a symbol for women's emancipation and black people's rights. James Smalls, a professor of Art History at the University of Maryland, declared that "the painting is an anomaly because it presents a black person as the sole aestheticized subject and object of a work of art." The picture was acquired by Louis XVIII for France in 1818.
An important commission for a full-length portrait of Napoléon Bonaparte—Premier Consul Français in this period—was awarded to her in 1803. This portrait was to be sent to the city of Ghent, newly ceded to France by the Treaty of Lunéville in 1801. Other honors came to her; she was awarded a Gold Medal in the Salon of 1804, and received a governmental allowance. During this time she opened an atelier for the artistic training of women.
Her career was harmed by political developments, however, when her husband, the supporter of royalist causes, Comte Benoist, was nominated in the Conseil d'État during the post-1814 Bourbon Restoration. Despite being at the height of her popularity, "she was obliged to abandon painting" and pursuing women's causes, due in part to her devoir de réserve ("tactful withdrawal") in the face of the growing wave of conservatism in European society.
Works
, 1786 (Staatliche Kunsthalle Karlsruhe)
Psyché faisant ses adieux a sa famille (1791)
L'Innocence entre la vertu et le vice
Portrait of Madeleine (previously known as Portrait d’une négresse (1800, Musée du Louvre))
Portrait of Madame Philippe Panon Debassayns de Richmont and Her Son Eugene (1802, Metropolitan Museum of Art)
Portrait de Napoléon (1804, court of Ghent)
Portrait du Maréchal Brune (1805, détruit; une copie se trouve au Musée du Château de Versailles)
Portrait de Pauline Borghèse (1807, Musée du Château de Versailles)
Portrait de Marie-Élise, grande duchesse de Toscane (Pinacoteca Nazionale, Lucca)
Portrait de l’impératrice Marie-Louise (Château de Fontainebleau)
La lecture de la Bible, (1810, musée municipal, Louviers)
La Consultation ou La Diseuse de bonne-aventure, Saintes Musée municipal.
Gallery
See also
:fr:Devoir de réserve dans la fonction publique française
References
Bibliography
Marie-Juliette Ballot, Une élève de David, La Comtesse Benoist, L'Émilie de Demoustier, 1768-1826, Plon, Paris, 1914
Astrid Reuter, Marie-Guilhelmine Benoist, Gestaltungsräume einer Künstlerin um 1800, Lukas Verlag, Berlin, 2002
External links
James Smalls, Slavery is a Woman: "Race," Gender, and Visuality in Marie Benoist's Portrait d'une négresse.
(in English) Paris A. Spies-Gans, "Marie-Guillemine Benoist, Revolutionary Painter," Art Herstory
Marie-Guillemine Benoist dans Artcyclopedia
Online pictures on Artnet
1768 births
1826 deaths
Artists from Paris
French women painters
French genre painters
French portrait painters
French neoclassical painters
Pupils of Jacques-Louis David
Sibling artists
18th-century French painters
18th-century French women artists
19th-century French painters
19th-century painters of historical subjects
19th-century French women artists
|
```xml
import { readFileSync, writeFileSync } from "fs";
import ArrayBufferSlice from "../ArrayBufferSlice.js";
import * as Yay0 from "../Common/Compression/Yay0.js";
import { StringDecoder } from 'string_decoder'
function fetchDataSync(path: string): ArrayBufferSlice {
const b: Buffer = readFileSync(path);
return new ArrayBufferSlice(b.buffer, b.byteOffset, b.byteLength);
}
function main() {
const filename = process.argv[2];
const data = fetchDataSync(filename);
const g = new StringDecoder('ascii').write(Buffer.from(data.arrayBuffer));
let idx = g.indexOf('Yay0'), i = 0;
while (true) {
const nextIdx = g.indexOf('Yay0', idx + 1);
console.log(i, idx, nextIdx);
const slice = data.slice(idx, nextIdx < 0 ? 0 : nextIdx);
const buf = Yay0.decompress(slice);
if (nextIdx < 0)
break;
writeFileSync(`${filename}.Chunk${i++}.bin`, Buffer.from(buf.arrayBuffer));
idx = nextIdx;
}
}
main();
```
|
Frank Grimes (born 1947) is an Irish stage and screen actor.
Grimes was born in Dublin. He achieved his first major success as the young Brendan Behan in the 1967 stage adaptation of Behan's autobiography, Borstal Boy, at the Abbey Theatre. When the production moved to Broadway, Grimes was nominated for a Tony Award for best actor.
In 1970 the Italian director, Franco Zeffirelli, offered Grimes the lead role of Francis of Assisi in his biopic, Brother Sun, Sister Moon. However, director and actor fell out over how the part should be played and Grimes was replaced by Graham Faulkner.
In the early 1970s, Grimes moved to London where he came to the attention of director Lindsay Anderson. Anderson offered him a part in his production of David Storey's play The Farm, the success of which established Grimes' reputation in British theatre.
Grimes' most significant film role to date is the part of Major Fuller in Richard Attenborough's A Bridge Too Far (1977). However, he is probably best known, in his native Ireland at least, for his performance as Father O'Connor in RTÉ's drama series, Strumpet City. In 1981, Grimes received a Jacob's Award "for his detailed and exceptionally convincing portrayal" of the young priest.
Frank Grimes continues to work in television, films and theatre. Recent TV appearances include the recurrent role of Barry Connor in Coronation Street. In 2013 he appeared as Mrs McCarthy's husband in the Father Brown episode "The Mayor and the Magician".
Filmography
References
External links
Frank Grimes at Irish Playography
1947 births
Living people
Irish male stage actors
Irish male film actors
Irish male television actors
Jacob's Award winners
People from Cabra, Dublin
Male actors from County Dublin
|
```yaml
homepage: "path_to_url"
main_repo: "path_to_url"
language: c
vendor_ccs:
- david@adalogics.com
```
|
Glaucostola flavida is a moth of the family Erebidae first described by William Schaus in 1905. It is found in French Guiana, Guyana and Trinidad.
References
Phaegopterina
Moths of South America
Moths described in 1905
|
```javascript
'use strict';
angular.module('app')
.controller('sessionController', [ '$rootScope', '$scope', '$http', '$state',
function($rootScope, $scope, $http, $state) {
$scope.title = '';
$scope.param = { };
$scope.loading = false;
$scope.search = function () {
$scope.loading = true;
$.ajax({
type: 'get',
url : '/session/read/page',
data: $scope.param
}).then(function(result) {
$scope.loading = false;
if (result.code == 200) {
$scope.pageInfo = result;
} else {
$scope.msg = result.msg;
}
$scope.$apply();
});
}
$scope.search();
$scope.clearSearch = function() {
$scope.param.keyword= null;
$scope.search();
}
$scope.disableItem = function(id, account) {
if(account != $rootScope.userInfo.account || confirm('')){
$.ajax({
type: 'DELETE',
url : '/session',
data: {'id': id}
}).then(function(result) {
$scope.loading = false;
if (result.code == 200) {
$state.reload();
} else {
$scope.msg = result.msg;
}
});
}
}
//
$scope.pagination = function (page) {
$scope.param.pageNumber=page;
$scope.search();
};
} ]);
```
|
Argentine Nationalist Action Later named Affirmation of a New Argentina was a nationalist and fascist political party in Argentina.which existed between 1932 and 1936.
History
It was founded in 1932 as Argentine Nationalist Action by Juan P. Ramos, and maintained strong connections with the Argentine Civic Legion and the Argentine Fascist Party. He was financially supported by the German Embassy in Argentina because he was openly anti-Semitic and pro-Nazi and of a character Nationalist, anti-communist, anti-capitalist and fascist.
The Argentine Nationalist Action declared some support for José Félix Uriburu and his government. In 1933 it was renamed Affirmation of a New Argentina, and a short time later it would become the "Labor Nationalism Party", which would be active until 1935, when the Nationalist Youth Alliance allied itself with the Argentine Fascist Party and the Labor Nacionalism Party to form the Córdoba Fascist Forces Front, which was replaced by the Fascist National Union in 1936.
References
Argentine nationalism
Fascism in Argentina
Right-wing parties in Argentina
Fascist parties
|
JProfiler is a commercially licensed Java profiling tool developed by ej-technologies GmbH, targeted at Java EE and Java SE applications.
Reviews
External links
Profilers
|
Gmina Radomyśl Wielki is an urban-rural gmina (administrative district) in Mielec County, Subcarpathian Voivodeship, in south-eastern Poland. Its seat is the town of Radomyśl Wielki, which lies approximately south-west of Mielec and west of the regional capital Rzeszów.
The gmina covers an area of , and as of 2006 its total population is 13,641 (out of which the population of Radomyśl Wielki amounts to 2,912, and the population of the rural part of the gmina is 10,729).
Villages
Apart from the town of Radomyśl Wielki, Gmina Radomyśl Wielki contains the villages and settlements of Dąbie, Dąbrówka Wisłocka, Dulcza Mała, Dulcza Wielka, Janowiec, Partynia, Pień, Podborze, Ruda, Żarówka, Zdziarzec and Zgórsko.
Neighbouring gminas
Gmina Radomyśl Wielki is bordered by the gminas of Czarna, Mielec, Przecław, Radgoszcz, Wadowice Górne and Żyraków.
References
Polish official population figures 2006
Radomysl Wielki
Mielec County
|
```objective-c
#ifndef VOXBLOX_CORE_ESDF_MAP_H_
#define VOXBLOX_CORE_ESDF_MAP_H_
#include <memory>
#include <string>
#include <utility>
#include <glog/logging.h>
#include "voxblox/core/common.h"
#include "voxblox/core/layer.h"
#include "voxblox/core/voxel.h"
#include "voxblox/interpolator/interpolator.h"
#include "voxblox/io/layer_io.h"
namespace voxblox {
/**
* Map holding a Euclidean Signed Distance Field Layer. Contains functions for
* interacting with the layer and getting gradient and distance information.
*/
class EsdfMap {
public:
EIGEN_MAKE_ALIGNED_OPERATOR_NEW
typedef std::shared_ptr<EsdfMap> Ptr;
struct Config {
EIGEN_MAKE_ALIGNED_OPERATOR_NEW
FloatingPoint esdf_voxel_size = 0.2;
size_t esdf_voxels_per_side = 16u;
};
explicit EsdfMap(const Config& config)
: esdf_layer_(new Layer<EsdfVoxel>(config.esdf_voxel_size,
config.esdf_voxels_per_side)),
interpolator_(esdf_layer_.get()) {
block_size_ = config.esdf_voxel_size * config.esdf_voxels_per_side;
}
/// Creates a new EsdfMap based on a COPY of this layer.
explicit EsdfMap(const Layer<EsdfVoxel>& layer)
: EsdfMap(aligned_shared<Layer<EsdfVoxel>>(layer)) {}
/// Creates a new EsdfMap that contains this layer.
explicit EsdfMap(Layer<EsdfVoxel>::Ptr layer)
: esdf_layer_(layer), interpolator_(CHECK_NOTNULL(esdf_layer_.get())) {
block_size_ = layer->block_size();
}
virtual ~EsdfMap() {}
Layer<EsdfVoxel>* getEsdfLayerPtr() { return esdf_layer_.get(); }
const Layer<EsdfVoxel>* getEsdfLayerConstPtr() const {
return esdf_layer_.get();
}
const Layer<EsdfVoxel>& getEsdfLayer() const { return *esdf_layer_; }
FloatingPoint block_size() const { return block_size_; }
FloatingPoint voxel_size() const { return esdf_layer_->voxel_size(); }
/**
* Specific accessor functions for esdf maps.
* Returns true if the point exists in the map AND is observed.
* These accessors use Vector3d and doubles explicitly rather than
* FloatingPoint to have a standard, cast-free interface to planning
* functions.
*/
bool getDistanceAtPosition(const Eigen::Vector3d& position,
double* distance) const;
bool getDistanceAtPosition(const Eigen::Vector3d& position, bool interpolate,
double* distance) const;
bool getDistanceAndGradientAtPosition(const Eigen::Vector3d& position,
double* distance,
Eigen::Vector3d* gradient) const;
bool getDistanceAndGradientAtPosition(const Eigen::Vector3d& position,
bool interpolate, double* distance,
Eigen::Vector3d* gradient) const;
bool isObserved(const Eigen::Vector3d& position) const;
// NOTE(mereweth@jpl.nasa.gov)
// EigenDRef is fully dynamic stride type alias for Numpy array slices
// Use column-major matrices; column-by-column traversal is faster
// Convenience alias borrowed from pybind11
using EigenDStride = Eigen::Stride<Eigen::Dynamic, Eigen::Dynamic>;
template <typename MatrixType>
using EigenDRef = Eigen::Ref<MatrixType, 0, EigenDStride>;
// Convenience functions for querying many points at once from Python
void batchGetDistanceAtPosition(
EigenDRef<const Eigen::Matrix<double, 3, Eigen::Dynamic>>& positions,
Eigen::Ref<Eigen::VectorXd> distances,
Eigen::Ref<Eigen::VectorXi> observed) const;
void batchGetDistanceAndGradientAtPosition(
EigenDRef<const Eigen::Matrix<double, 3, Eigen::Dynamic>>& positions,
Eigen::Ref<Eigen::VectorXd> distances,
EigenDRef<Eigen::Matrix<double, 3, Eigen::Dynamic>>& gradients,
Eigen::Ref<Eigen::VectorXi> observed) const;
void batchIsObserved(
EigenDRef<const Eigen::Matrix<double, 3, Eigen::Dynamic>>& positions,
Eigen::Ref<Eigen::VectorXi> observed) const;
unsigned int coordPlaneSliceGetCount(unsigned int free_plane_index,
double free_plane_val) const;
/**
* Extract all voxels on a slice plane that is parallel to one of the
* axis-aligned planes. free_plane_index specifies the free coordinate
* (zero-based; x, y, z order) free_plane_val specifies the plane intercept
* coordinate along that axis
*/
unsigned int coordPlaneSliceGetDistance(
unsigned int free_plane_index, double free_plane_val,
EigenDRef<Eigen::Matrix<double, 3, Eigen::Dynamic>>& positions,
Eigen::Ref<Eigen::VectorXd> distances, unsigned int max_points) const;
protected:
FloatingPoint block_size_;
// The layers.
Layer<EsdfVoxel>::Ptr esdf_layer_;
// Interpolator for the layer.
Interpolator<EsdfVoxel> interpolator_;
};
} // namespace voxblox
#endif // VOXBLOX_CORE_ESDF_MAP_H_
```
|
```python
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
#
# * Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
# * Redistributions in binary form must reproduce the above
# copyright notice, this list of conditions and the following disclaimer
# in the documentation and/or other materials provided with the
# distribution.
# * Neither the name of Google Inc. nor the names of its
# contributors may be used to endorse or promote products derived from
# this software without specific prior written permission.
#
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
# "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
# A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
# OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
# SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
# LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
# DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
# THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
import sys
import time
import unittest
from webkitpy.layout_tests.port.factory import PortFactory
from webkitpy.layout_tests.port import server_process
from webkitpy.common.system.systemhost import SystemHost
from webkitpy.common.system.systemhost_mock import MockSystemHost
from webkitpy.common.system.outputcapture import OutputCapture
class TrivialMockPort(object):
def __init__(self):
self.host = MockSystemHost()
self.host.executive.kill_process = lambda x: None
self.host.executive.kill_process = lambda x: None
def results_directory(self):
return "/mock-results"
def process_kill_time(self):
return 1
class MockFile(object):
def __init__(self, server_process):
self._server_process = server_process
self.closed = False
def fileno(self):
return 1
def write(self, line):
self._server_process.broken_pipes.append(self)
raise IOError
def close(self):
self.closed = True
class MockProc(object):
def __init__(self, server_process):
self.stdin = MockFile(server_process)
self.stdout = MockFile(server_process)
self.stderr = MockFile(server_process)
self.pid = 1
def poll(self):
return 1
def wait(self):
return 0
class FakeServerProcess(server_process.ServerProcess):
def _start(self):
self._proc = MockProc(self)
self.stdin = self._proc.stdin
self.stdout = self._proc.stdout
self.stderr = self._proc.stderr
self._pid = self._proc.pid
self.broken_pipes = []
class TestServerProcess(unittest.TestCase):
def test_basic(self):
cmd = [sys.executable, '-c', 'import sys; import time; time.sleep(0.02); print "stdout"; sys.stdout.flush(); print >>sys.stderr, "stderr"']
host = SystemHost()
factory = PortFactory(host)
port = factory.get()
now = time.time()
proc = server_process.ServerProcess(port, 'python', cmd)
proc.write('')
self.assertEqual(proc.poll(), None)
self.assertFalse(proc.has_crashed())
# check that doing a read after an expired deadline returns
# nothing immediately.
line = proc.read_stdout_line(now - 1)
self.assertEqual(line, None)
# FIXME: This part appears to be flaky. line should always be non-None.
# FIXME: path_to_url
line = proc.read_stdout_line(now + 1.0)
if line:
self.assertEqual(line.strip(), "stdout")
line = proc.read_stderr_line(now + 1.0)
if line:
self.assertEqual(line.strip(), "stderr")
proc.stop(0)
def test_cleanup(self):
port_obj = TrivialMockPort()
server_process = FakeServerProcess(port_obj=port_obj, name="test", cmd=["test"])
server_process._start()
server_process.stop()
self.assertTrue(server_process.stdin.closed)
self.assertTrue(server_process.stdout.closed)
self.assertTrue(server_process.stderr.closed)
def test_broken_pipe(self):
port_obj = TrivialMockPort()
port_obj.host.platform.os_name = 'win'
server_process = FakeServerProcess(port_obj=port_obj, name="test", cmd=["test"])
server_process.write("should break")
self.assertTrue(server_process.has_crashed())
self.assertIsNotNone(server_process.pid())
self.assertIsNone(server_process._proc)
self.assertEqual(server_process.broken_pipes, [server_process.stdin])
port_obj.host.platform.os_name = 'mac'
server_process = FakeServerProcess(port_obj=port_obj, name="test", cmd=["test"])
server_process.write("should break")
self.assertTrue(server_process.has_crashed())
self.assertIsNone(server_process._proc)
self.assertEqual(server_process.broken_pipes, [server_process.stdin])
class TestQuoteData(unittest.TestCase):
def test_plain(self):
qd = server_process.quote_data
self.assertEqual(qd("foo"), ["foo"])
def test_trailing_spaces(self):
qd = server_process.quote_data
self.assertEqual(qd("foo "),
["foo\x20\x20"])
def test_newlines(self):
qd = server_process.quote_data
self.assertEqual(qd("foo \nbar\n"),
["foo\x20\\n", "bar\\n"])
def test_binary_data(self):
qd = server_process.quote_data
self.assertEqual(qd("\x00\x01ab"),
["\\x00\\x01ab"])
```
|
```c++
//
//
// path_to_url
//
// Unless required by applicable law or agreed to in writing, software
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
#include <gtest/gtest.h>
#include <ray/api.h>
#include "../../runtime/abstract_ray_runtime.h"
#include "../../runtime/object/native_object_store.h"
#include "../../util/process_helper.h"
#include "absl/flags/flag.h"
#include "absl/flags/parse.h"
#include "counter.h"
#include "plus.h"
int cmd_argc = 0;
char **cmd_argv = nullptr;
ABSL_FLAG(bool, external_cluster, false, "");
ABSL_FLAG(std::string, redis_password, "12345678", "");
ABSL_FLAG(int32_t, redis_port, 6379, "");
TEST(RayClusterModeTest, Initialized) {
ray::Init();
EXPECT_TRUE(ray::IsInitialized());
ray::Shutdown();
EXPECT_TRUE(!ray::IsInitialized());
}
TEST(RayClusterModeTest, DefaultActorLifetimeTest) {
ray::RayConfig config;
config.default_actor_lifetime = ray::ActorLifetime::DETACHED;
ray::Init(config, cmd_argc, cmd_argv);
ray::ActorHandle<Counter> parent_actor =
ray::Actor(RAY_FUNC(Counter::FactoryCreate)).Remote();
std::string child_actor_name = "child_actor_name";
parent_actor.Task(&Counter::CreateChildActor).Remote(child_actor_name).Get();
auto child_actor_optional = ray::GetActor<Counter>(child_actor_name);
EXPECT_TRUE(child_actor_optional);
auto child_actor = *child_actor_optional;
EXPECT_EQ(1, *child_actor.Task(&Counter::Plus1).Remote().Get());
parent_actor.Kill();
sleep(4);
EXPECT_EQ(2, *child_actor.Task(&Counter::Plus1).Remote().Get());
ray::Shutdown();
}
struct Person {
std::string name;
int age;
MSGPACK_DEFINE(name, age);
};
TEST(RayClusterModeTest, FullTest) {
ray::RayConfig config;
config.head_args = {
"--num-cpus", "2", "--resources", "{\"resource1\":1,\"resource2\":2}"};
if (absl::GetFlag<bool>(FLAGS_external_cluster)) {
auto port = absl::GetFlag<int32_t>(FLAGS_redis_port);
std::string password = absl::GetFlag<std::string>(FLAGS_redis_password);
std::string local_ip = ray::internal::GetNodeIpAddress();
ray::internal::ProcessHelper::GetInstance().StartRayNode(local_ip, port, password);
config.address = local_ip + ":" + std::to_string(port);
config.redis_password_ = password;
}
ray::Init(config, cmd_argc, cmd_argv);
/// put and get object
auto obj = ray::Put(12345);
auto get_result = *(ray::Get(obj));
EXPECT_EQ(12345, get_result);
EXPECT_EQ(12345, *(ray::Get(obj, 5)));
auto named_obj =
ray::Task(Return1).SetName("named_task").SetResources({{"CPU", 1.0}}).Remote();
EXPECT_EQ(1, *named_obj.Get());
/// common task without args
auto task_obj = ray::Task(Return1).Remote();
int task_result = *(ray::Get(task_obj));
EXPECT_EQ(1, task_result);
/// common task with args
auto task_obj1 = ray::Task(Plus1).Remote(5);
auto task_result1 = *(ray::Get(task_obj1));
EXPECT_EQ(6, task_result1);
ray::ActorHandle<Counter> actor = ray::Actor(RAY_FUNC(Counter::FactoryCreate))
.SetMaxRestarts(1)
.SetName("named_actor")
.Remote();
auto initialized_obj = actor.Task(&Counter::Initialized).Remote();
EXPECT_TRUE(*initialized_obj.Get());
auto named_actor_obj = actor.Task(&Counter::Plus1)
.SetName("named_actor_task")
.SetResources({{"CPU", 1.0}})
.Remote();
EXPECT_EQ(1, *named_actor_obj.Get());
auto named_actor_handle_optional = ray::GetActor<Counter>("named_actor");
EXPECT_TRUE(named_actor_handle_optional);
auto &named_actor_handle = *named_actor_handle_optional;
auto named_actor_obj1 = named_actor_handle.Task(&Counter::Plus1).Remote();
EXPECT_EQ(2, *named_actor_obj1.Get());
EXPECT_FALSE(ray::GetActor<Counter>("not_exist_actor"));
EXPECT_FALSE(
*named_actor_handle.Task(&Counter::CheckRestartInActorCreationTask).Remote().Get());
EXPECT_FALSE(
*named_actor_handle.Task(&Counter::CheckRestartInActorTask).Remote().Get());
named_actor_handle.Kill(false);
std::this_thread::sleep_for(std::chrono::seconds(2));
auto named_actor_obj2 = named_actor_handle.Task(&Counter::Plus1).Remote();
EXPECT_EQ(1, *named_actor_obj2.Get());
EXPECT_TRUE(
*named_actor_handle.Task(&Counter::CheckRestartInActorCreationTask).Remote().Get());
EXPECT_TRUE(*named_actor_handle.Task(&Counter::CheckRestartInActorTask).Remote().Get());
named_actor_handle.Kill();
std::this_thread::sleep_for(std::chrono::seconds(2));
EXPECT_THROW(named_actor_handle.Task(&Counter::Plus1).Remote().Get(),
ray::internal::RayActorException);
EXPECT_FALSE(ray::GetActor<Counter>("named_actor"));
/// actor task without args
auto actor1 = ray::Actor(RAY_FUNC(Counter::FactoryCreate)).Remote();
auto actor_object1 = actor1.Task(&Counter::Plus1).Remote();
int actor_task_result1 = *(ray::Get(actor_object1));
EXPECT_EQ(1, actor_task_result1);
/// actor task with args
auto actor2 = ray::Actor(RAY_FUNC(Counter::FactoryCreate, int)).Remote(1);
auto actor_object2 = actor2.Task(&Counter::Add).Remote(5);
int actor_task_result2 = *(ray::Get(actor_object2));
EXPECT_EQ(6, actor_task_result2);
/// actor task with args which pass by reference
auto actor3 = ray::Actor(RAY_FUNC(Counter::FactoryCreate, int, int)).Remote(6, 0);
auto actor_object3 = actor3.Task(&Counter::Add).Remote(actor_object2);
int actor_task_result3 = *(ray::Get(actor_object3));
EXPECT_EQ(12, actor_task_result3);
/// general function remote callargs passed by value
auto r0 = ray::Task(Return1).Remote();
auto r1 = ray::Task(Plus1).Remote(30);
auto r2 = ray::Task(Plus).Remote(3, 22);
std::vector<ray::ObjectRef<int>> objects = {r0, r1, r2};
auto result = ray::Wait(objects, 3, 5000);
EXPECT_EQ(result.ready.size(), 3);
EXPECT_EQ(result.unready.size(), 0);
auto result_vector = ray::Get(objects);
int result0 = *(result_vector[0]);
int result1 = *(result_vector[1]);
int result2 = *(result_vector[2]);
EXPECT_EQ(result0, 1);
EXPECT_EQ(result1, 31);
EXPECT_EQ(result2, 25);
result_vector = ray::Get(objects, 5);
EXPECT_EQ(*(result_vector[0]), 1);
EXPECT_EQ(*(result_vector[1]), 31);
EXPECT_EQ(*(result_vector[2]), 25);
/// general function remote callargs passed by reference
auto r3 = ray::Task(Return1).Remote();
auto r4 = ray::Task(Plus1).Remote(r3);
auto r5 = ray::Task(Plus).Remote(r4, r3);
auto r6 = ray::Task(Plus).Remote(r4, 10);
int result5 = *(ray::Get(r5));
int result4 = *(ray::Get(r4));
int result6 = *(ray::Get(r6));
int result3 = *(ray::Get(r3));
EXPECT_EQ(result0, 1);
EXPECT_EQ(result3, 1);
EXPECT_EQ(result4, 2);
EXPECT_EQ(result5, 3);
EXPECT_EQ(result6, 12);
/// create actor and actor function remote call with args passed by value
auto actor4 = ray::Actor(RAY_FUNC(Counter::FactoryCreate, int)).Remote(10);
auto r7 = actor4.Task(&Counter::Add).Remote(5);
auto r8 = actor4.Task(&Counter::Add).Remote(1);
auto r9 = actor4.Task(&Counter::Add).Remote(3);
auto r10 = actor4.Task(&Counter::Add).Remote(8);
int result7 = *(ray::Get(r7));
int result8 = *(ray::Get(r8));
int result9 = *(ray::Get(r9));
int result10 = *(ray::Get(r10));
EXPECT_EQ(result7, 15);
EXPECT_EQ(result8, 16);
EXPECT_EQ(result9, 19);
EXPECT_EQ(result10, 27);
/// create actor and task function remote call with args passed by reference
auto actor5 = ray::Actor(RAY_FUNC(Counter::FactoryCreate, int, int)).Remote(r10, 0);
auto r11 = actor5.Task(&Counter::Add).Remote(r0);
auto r12 = actor5.Task(&Counter::Add).Remote(r11);
auto r13 = actor5.Task(&Counter::Add).Remote(r10);
auto r14 = actor5.Task(&Counter::Add).Remote(r13);
auto r15 = ray::Task(Plus).Remote(r0, r11);
auto r16 = ray::Task(Plus1).Remote(r15);
int result12 = *(ray::Get(r12));
int result14 = *(ray::Get(r14));
int result11 = *(ray::Get(r11));
int result13 = *(ray::Get(r13));
int result16 = *(ray::Get(r16));
int result15 = *(ray::Get(r15));
EXPECT_EQ(result11, 28);
EXPECT_EQ(result12, 56);
EXPECT_EQ(result13, 83);
EXPECT_EQ(result14, 166);
EXPECT_EQ(result15, 29);
EXPECT_EQ(result16, 30);
/// Test Put, Get & Remote for large objects
std::array<int, 100000> arr;
auto r17 = ray::Put(arr);
auto r18 = ray::Task(ReturnLargeArray).Remote(r17);
EXPECT_EQ(arr, *(ray::Get(r17)));
EXPECT_EQ(arr, *(ray::Get(r18)));
uint64_t pid = *actor1.Task(&Counter::GetPid).Remote().Get(5);
EXPECT_TRUE(Counter::IsProcessAlive(pid));
auto actor_object4 = actor1.Task(&Counter::Exit).Remote();
std::this_thread::sleep_for(std::chrono::seconds(2));
EXPECT_THROW(actor_object4.Get(), ray::internal::RayActorException);
EXPECT_FALSE(Counter::IsProcessAlive(pid));
}
TEST(RayClusterModeTest, ActorHandleTest) {
auto actor1 = ray::Actor(RAY_FUNC(Counter::FactoryCreate)).Remote();
auto obj1 = actor1.Task(&Counter::Plus1).Remote();
EXPECT_EQ(1, *obj1.Get());
// Test `ActorHandle` type object as parameter.
auto actor2 = ray::Actor(RAY_FUNC(Counter::FactoryCreate)).Remote();
auto obj2 = actor2.Task(&Counter::Plus1ForActor).Remote(actor1);
EXPECT_EQ(2, *obj2.Get());
// Test `ActorHandle` type object as return value.
std::string child_actor_name = "child_actor_name";
auto child_actor =
actor1.Task(&Counter::CreateChildActor).Remote(child_actor_name).Get();
EXPECT_EQ(1, *child_actor->Task(&Counter::Plus1).Remote().Get());
auto named_actor_handle_optional = ray::GetActor<Counter>(child_actor_name);
EXPECT_TRUE(named_actor_handle_optional);
auto &named_actor_handle = *named_actor_handle_optional;
auto named_actor_obj1 = named_actor_handle.Task(&Counter::Plus1).Remote();
EXPECT_EQ(2, *named_actor_obj1.Get());
}
TEST(RayClusterModeTest, PythonInvocationTest) {
ray::ActorHandleXlang py_actor_handle =
ray::Actor(ray::PyActorClass{"test_cross_language_invocation", "Counter"})
.Remote(1);
EXPECT_TRUE(!py_actor_handle.ID().empty());
auto py_actor_ret =
py_actor_handle.Task(ray::PyActorMethod<std::string>{"increase"}).Remote(1);
EXPECT_EQ("2", *py_actor_ret.Get());
auto py_obj =
ray::Task(ray::PyFunction<int>{"test_cross_language_invocation", "py_return_val"})
.Remote();
EXPECT_EQ(42, *py_obj.Get());
auto py_obj1 =
ray::Task(ray::PyFunction<int>{"test_cross_language_invocation", "py_return_input"})
.Remote(42);
EXPECT_EQ(42, *py_obj1.Get());
auto py_obj2 = ray::Task(ray::PyFunction<std::string>{"test_cross_language_invocation",
"py_return_input"})
.Remote("hello");
EXPECT_EQ("hello", *py_obj2.Get());
Person p{"tom", 20};
auto py_obj3 = ray::Task(ray::PyFunction<Person>{"test_cross_language_invocation",
"py_return_input"})
.Remote(p);
auto py_result = *py_obj3.Get();
EXPECT_EQ(p.age, py_result.age);
EXPECT_EQ(p.name, py_result.name);
}
TEST(RayClusterModeTest, MaxConcurrentTest) {
auto actor1 =
ray::Actor(ActorConcurrentCall::FactoryCreate).SetMaxConcurrency(3).Remote();
auto object1 = actor1.Task(&ActorConcurrentCall::CountDown).Remote();
auto object2 = actor1.Task(&ActorConcurrentCall::CountDown).Remote();
auto object3 = actor1.Task(&ActorConcurrentCall::CountDown).Remote();
EXPECT_EQ(*object1.Get(), "ok");
EXPECT_EQ(*object2.Get(), "ok");
EXPECT_EQ(*object3.Get(), "ok");
auto actor2 =
ray::Actor(ActorConcurrentCall::FactoryCreate).SetMaxConcurrency(2).Remote();
auto object2_1 = actor2.Task(&ActorConcurrentCall::CountDown).Remote();
auto object2_2 = actor2.Task(&ActorConcurrentCall::CountDown).Remote();
auto object2_3 = actor2.Task(&ActorConcurrentCall::CountDown).Remote();
EXPECT_THROW(object2_1.Get(2), ray::internal::RayTimeoutException);
EXPECT_THROW(object2_2.Get(2), ray::internal::RayTimeoutException);
EXPECT_THROW(object2_3.Get(2), ray::internal::RayTimeoutException);
}
TEST(RayClusterModeTest, ResourcesManagementTest) {
auto actor1 =
ray::Actor(RAY_FUNC(Counter::FactoryCreate)).SetResources({{"CPU", 1.0}}).Remote();
auto r1 = actor1.Task(&Counter::Plus1).Remote();
EXPECT_EQ(*r1.Get(), 1);
auto actor2 = ray::Actor(RAY_FUNC(Counter::FactoryCreate))
.SetResources({{"CPU", 10000.0}})
.Remote();
auto r2 = actor2.Task(&Counter::Plus1).Remote();
std::vector<ray::ObjectRef<int>> objects{r2};
auto result = ray::Wait(objects, 1, 5000);
EXPECT_EQ(result.ready.size(), 0);
EXPECT_EQ(result.unready.size(), 1);
auto r3 = ray::Task(Return1).SetResource("CPU", 1.0).Remote();
EXPECT_EQ(*r3.Get(), 1);
auto r4 = ray::Task(Return1).SetResource("CPU", 100.0).Remote();
std::vector<ray::ObjectRef<int>> objects1{r4};
auto result2 = ray::Wait(objects1, 1, 5000);
EXPECT_EQ(result2.ready.size(), 0);
EXPECT_EQ(result2.unready.size(), 1);
}
TEST(RayClusterModeTest, ExceptionTest) {
EXPECT_THROW(ray::Task(ThrowTask).Remote().Get(), ray::internal::RayTaskException);
try {
ray::Task(ThrowTask).Remote().Get();
} catch (ray::internal::RayTaskException &e) {
EXPECT_TRUE(std::string(e.what()).find("std::logic_error") != std::string::npos);
}
auto actor1 = ray::Actor(RAY_FUNC(Counter::FactoryCreate, int)).Remote(1);
auto object1 = actor1.Task(&Counter::ExceptionFunc).Remote();
EXPECT_THROW(object1.Get(), ray::internal::RayTaskException);
auto actor2 = ray::Actor(Counter::FactoryCreateException).Remote();
auto object2 = actor2.Task(&Counter::Plus1).Remote();
EXPECT_THROW(object2.Get(), ray::internal::RayActorException);
}
TEST(RayClusterModeTest, GetAllNodeInfoTest) {
const auto &gcs_client =
ray::internal::AbstractRayRuntime::GetInstance()->GetGlobalStateAccessor();
auto all_node_info = gcs_client->GetAllNodeInfo();
EXPECT_EQ(all_node_info.size(), 1);
ray::rpc::GcsNodeInfo node_info;
node_info.ParseFromString(all_node_info[0]);
EXPECT_EQ(node_info.state(),
ray::rpc::GcsNodeInfo_GcsNodeState::GcsNodeInfo_GcsNodeState_ALIVE);
}
bool CheckRefCount(
std::unordered_map<ray::ObjectID, std::pair<size_t, size_t>> expected) {
auto object_store = std::make_unique<ray::internal::NativeObjectStore>();
auto map = object_store->GetAllReferenceCounts();
return expected == map;
}
TEST(RayClusterModeTest, LocalRefrenceTest) {
auto r1 = std::make_unique<ray::ObjectRef<int>>(ray::Task(Return1).Remote());
auto object_id = ray::ObjectID::FromBinary(r1->ID());
EXPECT_TRUE(CheckRefCount({{object_id, std::make_pair(1, 0)}}));
auto r2 = std::make_unique<ray::ObjectRef<int>>(*r1);
EXPECT_TRUE(CheckRefCount({{object_id, std::make_pair(2, 0)}}));
r1.reset();
EXPECT_TRUE(CheckRefCount({{object_id, std::make_pair(1, 0)}}));
r2.reset();
EXPECT_TRUE(CheckRefCount({}));
}
TEST(RayClusterModeTest, DependencyRefrenceTest) {
{
auto r1 = ray::Task(Return1).Remote();
auto object_id = ray::ObjectID::FromBinary(r1.ID());
EXPECT_TRUE(CheckRefCount({{object_id, std::make_pair(1, 0)}}));
auto r2 = ray::Task(Plus1).Remote(r1);
EXPECT_TRUE(
CheckRefCount({{object_id, std::make_pair(1, 1)},
{ray::ObjectID::FromBinary(r2.ID()), std::make_pair(1, 0)}}));
r2.Get();
EXPECT_TRUE(
CheckRefCount({{object_id, std::make_pair(1, 0)},
{ray::ObjectID::FromBinary(r2.ID()), std::make_pair(1, 0)}}));
}
EXPECT_TRUE(CheckRefCount({}));
}
TEST(RayClusterModeTest, GetActorTest) {
ray::ActorHandle<Counter> actor = ray::Actor(RAY_FUNC(Counter::FactoryCreate))
.SetMaxRestarts(1)
.SetName("named_actor")
.Remote();
auto named_actor_obj = actor.Task(&Counter::Plus1).Remote();
EXPECT_EQ(1, *named_actor_obj.Get());
auto named_actor_handle_optional = ray::GetActor<Counter>("named_actor");
EXPECT_TRUE(named_actor_handle_optional);
auto &named_actor_handle = *named_actor_handle_optional;
auto named_actor_obj1 = named_actor_handle.Task(&Counter::Plus1).Remote();
EXPECT_EQ(2, *named_actor_obj1.Get());
EXPECT_FALSE(ray::GetActor<Counter>("not_exist_actor"));
}
ray::PlacementGroup CreateSimplePlacementGroup(const std::string &name) {
std::vector<std::unordered_map<std::string, double>> bundles{{{"CPU", 1}}};
ray::PlacementGroupCreationOptions options{name, bundles, ray::PlacementStrategy::PACK};
return ray::CreatePlacementGroup(options);
}
TEST(RayClusterModeTest, CreateAndRemovePlacementGroup) {
auto first_placement_group = CreateSimplePlacementGroup("first_placement_group");
EXPECT_TRUE(first_placement_group.Wait(10));
EXPECT_THROW(CreateSimplePlacementGroup("first_placement_group"),
ray::internal::RayException);
auto groups = ray::GetAllPlacementGroups();
EXPECT_EQ(groups.size(), 1);
auto placement_group = ray::GetPlacementGroupById(first_placement_group.GetID());
EXPECT_EQ(placement_group.GetID(), first_placement_group.GetID());
auto placement_group1 = ray::GetPlacementGroup("first_placement_group");
EXPECT_EQ(placement_group1.GetID(), first_placement_group.GetID());
ray::RemovePlacementGroup(first_placement_group.GetID());
auto deleted_group = ray::GetPlacementGroupById(first_placement_group.GetID());
EXPECT_EQ(deleted_group.GetState(), ray::PlacementGroupState::REMOVED);
auto not_exist_group = ray::GetPlacementGroup("not_exist_placement_group");
EXPECT_TRUE(not_exist_group.GetID().empty());
ray::RemovePlacementGroup(first_placement_group.GetID());
}
TEST(RayClusterModeTest, CreatePlacementGroupExceedsClusterResource) {
std::vector<std::unordered_map<std::string, double>> bundles{{{"CPU", 10000}}};
ray::PlacementGroupCreationOptions options{
"first_placement_group", bundles, ray::PlacementStrategy::PACK};
auto first_placement_group = ray::CreatePlacementGroup(options);
EXPECT_FALSE(first_placement_group.Wait(3));
ray::RemovePlacementGroup(first_placement_group.GetID());
auto deleted_group = ray::GetPlacementGroupById(first_placement_group.GetID());
EXPECT_EQ(deleted_group.GetState(), ray::PlacementGroupState::REMOVED);
auto not_exist_group = ray::GetPlacementGroup("not_exist_placement_group");
EXPECT_TRUE(not_exist_group.GetID().empty());
}
TEST(RayClusterModeTest, CreateActorWithPlacementGroup) {
auto placement_group = CreateSimplePlacementGroup("first_placement_group");
EXPECT_TRUE(placement_group.Wait(10));
auto actor1 = ray::Actor(RAY_FUNC(Counter::FactoryCreate))
.SetResources({{"CPU", 1.0}})
.SetPlacementGroup(placement_group, 0)
.Remote();
auto r1 = actor1.Task(&Counter::Plus1).Remote();
std::vector<ray::ObjectRef<int>> objects{r1};
auto result = ray::Wait(objects, 1, 5000);
EXPECT_EQ(result.ready.size(), 1);
EXPECT_EQ(result.unready.size(), 0);
auto result_vector = ray::Get(objects);
EXPECT_EQ(*(result_vector[0]), 1);
// Exceeds the resources of PlacementGroup.
auto actor2 = ray::Actor(RAY_FUNC(Counter::FactoryCreate))
.SetResources({{"CPU", 2.0}})
.SetPlacementGroup(placement_group, 0)
.Remote();
auto r2 = actor2.Task(&Counter::Plus1).Remote();
std::vector<ray::ObjectRef<int>> objects2{r2};
auto result2 = ray::Wait(objects2, 1, 5000);
EXPECT_EQ(result2.ready.size(), 0);
EXPECT_EQ(result2.unready.size(), 1);
ray::RemovePlacementGroup(placement_group.GetID());
}
TEST(RayClusterModeTest, TaskWithPlacementGroup) {
auto placement_group = CreateSimplePlacementGroup("first_placement_group");
EXPECT_TRUE(placement_group.Wait(10));
auto r = ray::Task(Return1)
.SetResources({{"CPU", 1.0}})
.SetPlacementGroup(placement_group, 0)
.Remote();
EXPECT_EQ(*r.Get(), 1);
ray::RemovePlacementGroup(placement_group.GetID());
}
TEST(RayClusterModeTest, NamespaceTest) {
if (ray::IsInitialized()) {
ray::Shutdown();
}
ray::Init();
// Create a named actor in namespace `isolated_ns`.
std::string actor_name_in_isolated_ns = "named_actor_in_isolated_ns";
std::string isolated_ns_name = "isolated_ns";
ray::ActorHandle<Counter> actor =
ray::Actor(RAY_FUNC(Counter::FactoryCreate))
.SetName(actor_name_in_isolated_ns, isolated_ns_name)
.Remote();
auto initialized_obj = actor.Task(&Counter::Initialized).Remote();
EXPECT_TRUE(*initialized_obj.Get());
// It is invisible to job default namespace.
auto actor_optional = ray::GetActor<Counter>(actor_name_in_isolated_ns);
EXPECT_TRUE(!actor_optional);
// It is visible to the namespace it belongs.
actor_optional = ray::GetActor<Counter>(actor_name_in_isolated_ns, isolated_ns_name);
EXPECT_TRUE(actor_optional);
// It is invisible to any other namespaces.
actor_optional = ray::GetActor<Counter>(actor_name_in_isolated_ns, "other_ns");
EXPECT_TRUE(!actor_optional);
// Create a named actor in job default namespace.
std::string actor_name_in_default_ns = "actor_name_in_default_ns";
auto actor1 = ray::Actor(RAY_FUNC(Counter::FactoryCreate))
.SetName(actor_name_in_default_ns)
.Remote();
auto initialized_obj1 = actor1.Task(&Counter::Initialized).Remote();
EXPECT_TRUE(*initialized_obj1.Get());
// It is visible to job default namespace.
actor_optional = ray::GetActor<Counter>(actor_name_in_default_ns);
EXPECT_TRUE(actor_optional);
// It is invisible to any other namespaces.
actor_optional = ray::GetActor<Counter>(actor_name_in_default_ns, isolated_ns_name);
EXPECT_TRUE(!actor_optional);
ray::Shutdown();
}
TEST(RayClusterModeTest, GetNamespaceApiTest) {
std::string ns = "test_get_current_namespace";
ray::RayConfig config;
config.ray_namespace = ns;
if (ray::IsInitialized()) {
ray::Shutdown();
}
ray::Init(config, cmd_argc, cmd_argv);
// Get namespace in driver.
EXPECT_EQ(ray::GetNamespace(), ns);
// Get namespace in task.
auto task_ns = ray::Task(GetNamespaceInTask).Remote();
EXPECT_EQ(*task_ns.Get(), ns);
// Get namespace in actor.
auto actor_handle = ray::Actor(RAY_FUNC(Counter::FactoryCreate)).Remote();
auto actor_ns = actor_handle.Task(&Counter::GetNamespaceInActor).Remote();
EXPECT_EQ(*actor_ns.Get(), ns);
ray::Shutdown();
}
class Pip {
public:
std::vector<std::string> packages;
bool pip_check = false;
Pip() = default;
Pip(const std::vector<std::string> &packages, bool pip_check)
: packages(packages), pip_check(pip_check) {}
};
void to_json(json &j, const Pip &pip) {
j = json{{"packages", pip.packages}, {"pip_check", pip.pip_check}};
};
void from_json(const json &j, Pip &pip) {
j.at("packages").get_to(pip.packages);
j.at("pip_check").get_to(pip.pip_check);
};
TEST(RayClusterModeTest, RuntimeEnvApiTest) {
ray::RuntimeEnv runtime_env;
// Set pip
std::vector<std::string> packages = {"requests"};
Pip pip(packages, true);
runtime_env.Set("pip", pip);
// Set working_dir
std::string working_dir = "path_to_url";
runtime_env.Set("working_dir", working_dir);
// Serialize
auto serialized_runtime_env = runtime_env.Serialize();
// Deserialize
auto runtime_env_2 = ray::RuntimeEnv::Deserialize(serialized_runtime_env);
auto pip2 = runtime_env_2.Get<Pip>("pip");
EXPECT_EQ(pip2.packages, pip.packages);
EXPECT_EQ(pip2.pip_check, pip.pip_check);
auto working_dir2 = runtime_env_2.Get<std::string>("working_dir");
EXPECT_EQ(working_dir2, working_dir);
// Construct runtime env with raw json string
ray::RuntimeEnv runtime_env_3;
std::string pip_raw_json_string =
R"({"packages":["requests","tensorflow"],"pip_check":false})";
runtime_env_3.SetJsonStr("pip", pip_raw_json_string);
auto get_json_result = runtime_env_3.GetJsonStr("pip");
EXPECT_EQ(get_json_result, pip_raw_json_string);
}
TEST(RayClusterModeTest, RuntimeEnvApiExceptionTest) {
ray::RuntimeEnv runtime_env;
EXPECT_THROW(runtime_env.Get<std::string>("working_dir"),
ray::internal::RayRuntimeEnvException);
runtime_env.Set("working_dir", "path_to_url");
EXPECT_THROW(runtime_env.Get<Pip>("working_dir"),
ray::internal::RayRuntimeEnvException);
EXPECT_THROW(runtime_env.SetJsonStr("pip", "{123"),
ray::internal::RayRuntimeEnvException);
EXPECT_THROW(runtime_env.GetJsonStr("pip"), ray::internal::RayRuntimeEnvException);
EXPECT_EQ(runtime_env.Empty(), false);
EXPECT_EQ(runtime_env.Remove("working_dir"), true);
// Do nothing when removing a non-existent key.
EXPECT_EQ(runtime_env.Remove("pip"), false);
EXPECT_EQ(runtime_env.Empty(), true);
}
TEST(RayClusterModeTest, RuntimeEnvTaskLevelEnvVarsTest) {
ray::RayConfig config;
ray::Init(config, cmd_argc, cmd_argv);
auto r0 = ray::Task(GetEnvVar).Remote("KEY1");
auto get_result0 = *(ray::Get(r0));
EXPECT_EQ("", get_result0);
auto actor_handle = ray::Actor(RAY_FUNC(Counter::FactoryCreate)).Remote();
auto r1 = actor_handle.Task(&Counter::GetEnvVar).Remote("KEY1");
auto get_result1 = *(ray::Get(r1));
EXPECT_EQ("", get_result1);
ray::RuntimeEnv runtime_env;
std::map<std::string, std::string> env_vars{{"KEY1", "value1"}};
runtime_env.Set("env_vars", env_vars);
auto r2 = ray::Task(GetEnvVar).SetRuntimeEnv(runtime_env).Remote("KEY1");
auto get_result2 = *(ray::Get(r2));
EXPECT_EQ("value1", get_result2);
ray::RuntimeEnv runtime_env2;
std::map<std::string, std::string> env_vars2{{"KEY1", "value2"}};
runtime_env2.Set("env_vars", env_vars2);
auto actor_handle2 =
ray::Actor(RAY_FUNC(Counter::FactoryCreate)).SetRuntimeEnv(runtime_env2).Remote();
auto r3 = actor_handle2.Task(&Counter::GetEnvVar).Remote("KEY1");
auto get_result3 = *(ray::Get(r3));
EXPECT_EQ("value2", get_result3);
ray::Shutdown();
}
TEST(RayClusterModeTest, RuntimeEnvJobLevelEnvVarsTest) {
ray::RayConfig config;
ray::RuntimeEnv runtime_env;
std::map<std::string, std::string> env_vars{{"KEY1", "value1"}};
runtime_env.Set("env_vars", env_vars);
config.runtime_env = runtime_env;
ray::Init(config, cmd_argc, cmd_argv);
auto r0 = ray::Task(GetEnvVar).Remote("KEY1");
auto get_result0 = *(ray::Get(r0));
EXPECT_EQ("value1", get_result0);
auto actor_handle = ray::Actor(RAY_FUNC(Counter::FactoryCreate)).Remote();
auto r1 = actor_handle.Task(&Counter::GetEnvVar).Remote("KEY1");
auto get_result1 = *(ray::Get(r1));
EXPECT_EQ("value1", get_result1);
ray::Shutdown();
}
TEST(RayClusterModeTest, UnsupportObjectRefTest) {
ray::RayConfig config;
ray::Init(config, cmd_argc, cmd_argv);
ray::ActorHandle<Counter> actor = ray::Actor(RAY_FUNC(Counter::FactoryCreate)).Remote();
auto int_ref = ray::Put(1);
EXPECT_THROW(actor.Task(&Counter::GetIntByObjectRef).Remote(int_ref),
std::invalid_argument);
ray::Shutdown();
}
int main(int argc, char **argv) {
absl::ParseCommandLine(argc, argv);
cmd_argc = argc;
cmd_argv = argv;
::testing::InitGoogleTest(&argc, argv);
int ret = RUN_ALL_TESTS();
ray::Shutdown();
if (absl::GetFlag<bool>(FLAGS_external_cluster)) {
ray::internal::ProcessHelper::GetInstance().StopRayNode();
}
return ret;
}
```
|
```c++
#include "floatbucketresultnode.h"
#include <vespa/vespalib/objects/visit.h>
#include <cmath>
namespace search::expression {
IMPLEMENT_RESULTNODE(FloatBucketResultNode, BucketResultNode);
FloatBucketResultNode FloatBucketResultNode::_nullResult;
size_t
FloatBucketResultNode::hash() const
{
size_t tmpHash(0);
memcpy(&tmpHash, &_from, sizeof(tmpHash));
return tmpHash;
}
int
FloatBucketResultNode::onCmp(const Identifiable &b) const
{
double f1(_from);
double f2(static_cast<const FloatBucketResultNode &>(b)._from);
if (std::isnan(f1)) {
return std::isnan(f2) ? 0 : -1;
} else {
if (f1 < f2) {
return -1;
} else if (f1 > f2) {
return 1;
} else {
double t1(_to);
double t2(static_cast<const FloatBucketResultNode &>(b)._to);
if (std::isnan(t2)) {
return 1;
} else {
if (t1 < t2) {
return -1;
} else if (t1 > t2) {
return 1;
}
}
}
}
return 0;
}
int FloatBucketResultNode::contains(const FloatBucketResultNode & b) const
{
double diff(_from - b._from);
if (diff < 0) {
return (_to < b._to) ? -1 : 0;
} else {
return (_to > b._to) ? 1 : 0;
}
}
void
FloatBucketResultNode::visitMembers(vespalib::ObjectVisitor &visitor) const
{
visit(visitor, _fromField, _from);
visit(visitor, _toField, _to);
}
vespalib::Serializer &
FloatBucketResultNode::onSerialize(vespalib::Serializer & os) const
{
return os.put(_from).put(_to);
}
vespalib::Deserializer &
FloatBucketResultNode::onDeserialize(vespalib::Deserializer & is)
{
return is.get(_from).get(_to);
}
}
// this function was added by ../../forcelink.sh
void forcelink_file_searchlib_expression_floatbucketresultnode() {}
```
|
The Service and Reform List (also Service and Reformation List) is an electoral coalition formed to contest the Iraqi Kurdistan legislative election of 2009 by the Kurdistan Islamic Union, the Islamic Group in Kurdistan, the Kurdistan Socialist Party and the Future Party.
References
Electoral lists for Iraqi elections
Kurdish political party alliances
Political party alliances in Iraq
Political parties in Kurdistan Region
Kurdish nationalist political parties
Kurdish political parties in Iraq
|
```javascript
`if/else` shortcut `conditional operator`
Truthiness
Extra function arguments are undefined by default
Detect an error type
Getting the *real* dimensions of an image
```
|
```objective-c
/*
*
* Use of this source code is governed by a BSD-style license
* that can be found in the LICENSE file in the root of the source
* tree. An additional intellectual property rights grant can be found
* in the file PATENTS. All contributing project authors may
* be found in the AUTHORS file in the root of the source tree.
*/
#ifndef MODULES_AUDIO_CODING_NETEQ_TOOLS_FAKE_DECODE_FROM_FILE_H_
#define MODULES_AUDIO_CODING_NETEQ_TOOLS_FAKE_DECODE_FROM_FILE_H_
#include <memory>
#include "absl/types/optional.h"
#include "api/array_view.h"
#include "api/audio_codecs/audio_decoder.h"
#include "modules/audio_coding/neteq/tools/input_audio_file.h"
namespace webrtc {
namespace test {
// Provides an AudioDecoder implementation that delivers audio data from a file.
// The "encoded" input should contain information about what RTP timestamp the
// encoding represents, and how many samples the decoder should produce for that
// encoding. A helper method PrepareEncoded is provided to prepare such
// encodings. If packets are missing, as determined from the timestamps, the
// file reading will skip forward to match the loss.
class FakeDecodeFromFile : public AudioDecoder {
public:
FakeDecodeFromFile(std::unique_ptr<InputAudioFile> input,
int sample_rate_hz,
bool stereo)
: input_(std::move(input)),
sample_rate_hz_(sample_rate_hz),
stereo_(stereo) {}
~FakeDecodeFromFile() = default;
std::vector<ParseResult> ParsePayload(rtc::Buffer&& payload,
uint32_t timestamp) override;
void Reset() override {}
int SampleRateHz() const override { return sample_rate_hz_; }
size_t Channels() const override { return stereo_ ? 2 : 1; }
int DecodeInternal(const uint8_t* encoded,
size_t encoded_len,
int sample_rate_hz,
int16_t* decoded,
SpeechType* speech_type) override;
int PacketDuration(const uint8_t* encoded, size_t encoded_len) const override;
// Helper method. Writes |timestamp|, |samples| and
// |original_payload_size_bytes| to |encoded| in a format that the
// FakeDecodeFromFile decoder will understand. |encoded| must be at least 12
// bytes long.
static void PrepareEncoded(uint32_t timestamp,
size_t samples,
size_t original_payload_size_bytes,
rtc::ArrayView<uint8_t> encoded);
private:
std::unique_ptr<InputAudioFile> input_;
absl::optional<uint32_t> next_timestamp_from_input_;
const int sample_rate_hz_;
const bool stereo_;
size_t last_decoded_length_ = 0;
bool cng_mode_ = false;
};
} // namespace test
} // namespace webrtc
#endif // MODULES_AUDIO_CODING_NETEQ_TOOLS_FAKE_DECODE_FROM_FILE_H_
```
|
```objective-c
/* $OpenBSD: sxipiovar.h,v 1.2 2023/10/13 15:41:25 kettenis Exp $ */
/*
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <sys/gpio.h>
struct sxipio_func {
const char *name;
int mux;
};
struct sxipio_pin {
const char *name;
int port, pin;
struct sxipio_func funcs[10];
};
#define SXIPIO_PORT_A 0
#define SXIPIO_PORT_B 1
#define SXIPIO_PORT_C 2
#define SXIPIO_PORT_D 3
#define SXIPIO_PORT_E 4
#define SXIPIO_PORT_F 5
#define SXIPIO_PORT_G 6
#define SXIPIO_PORT_H 7
#define SXIPIO_PORT_I 8
#define SXIPIO_PORT_L 0
#define SXIPIO_PORT_M 1
#define SXIPIO_PORT_N 2
#define SXIPIO_PIN(port, pin) \
"P" #port #pin, SXIPIO_PORT_ ## port, pin
```
|
Advances in Production Engineering & Management (APEM) is an interdisciplinary refereed journal. It is published quarterly by Production Engineering Institute (PEI), an organisational unit of the Faculty of mechanical engineering at the University of Maribor. The main goal of journal is to present high quality research developments in all areas of production engineering and production management, as well as their applications in industry and services, to a broad audience of academics and practitioners. Like most scientific journals, it can be obtained in print or in electronic form.
Advances in Production Engineering & Management is abstracted and indexed in the world’s leading bibliographic databases, including Web of Science (Science Citation Index Expanded – SCIE, Journal Citation Reports – JCR, and Current Contents – CC), Scopus, Inspec, EBSCO, and ProQuest.
In the Web of Science (THOMSON REUTERS) bibliographic database the journal is included into two categories:
1. Engineering, Manufacturing;
2. Material Science, Multidisciplinary.
The journal Advances in Production Engineering & Management has received its first impact factor calculated by Thomson Reuters in June 2016. The current impact factor is 1.125 (Journal Citation Reports 2016, year 2015).
External links
APEM
Production Engineering Institute (PEI)
Engineering journals
English-language journals
University of Maribor
|
The Stowaway is a 1958 French-Australian film directed by Australian director Lee Robinson and French Lebanese director Ralph Habib. It was shot on location in Tahiti and is one of the few Australian financed movies of the 1950s, although the storyline has nothing to do with Australia.
There are French and English versions of the film. These versions have different credits, mostly in terms of behind the scenes personnel. The French version is known as Le Passager clandestin.
It was the second of three collaborations between Lee Robinson and French producers, the others being Walk into Paradise and the Restless and the Damned.
Synopsis
In Panama, some men arrive on a passenger ship, Major Owens and Mr Buddington. Bugginton is looking for a missing heir Rene Marechal, thought to be near Tahiti. He tracks her to Marechal's former mistress, Colette, who lives with another former Parisian, Gabrielle. There is a reward to find Marechal, so Colette decides to find him as well. Major Owens is also after the missing heir.
Colette decides to use the fact that ship officer, Jean, is infatuated with her to stowaway on Jean's ship to Tahiti. Also on board that boat is Buddington, Major Owens, and a mystery man, Mougins.
On the trip, Major Owens gambles with Buddington and gets the latter considerably in debt. Owens ask Buddington to stop looking for Marechal so that Owens can collect the reward. This is overheard by Mougins who breaks into Buddington's room and kills him in a fight.
Mougins realises Colette was a stowaway. Owens looks for Marechal, as does Mougins. Jean tales Colette to his place on Tahiti. Owens suggests he and Colette team up to find Marechal but she is reluctant as she has genuinely fallen in love with Jean. Colette tries to get rid of Mougins by telling him that Owens has hired a boat off a man called Wong Fu.
Jean gets fifteen days off so he can marry Colette. She tells him she doesn't love him any more. Mougins tells Colette his plan to pretend to be Marechal, with Colette providing verification. Owens discovers his boat has been hired to Mougins.
Mougins murders Owen and goes on the boat with Colette. Jean is told about this and gets on board. Jean is discovered by Mougins and is tied up but Colette discovers him and frees him.
Jean and Mougins fight, with the crew rallying to assist Jean. Mougins falls overboard and is eaten by a shark. Jean and Colette kiss.
Cast
Martine Carol as Colette
Roger Livesey as Major Owens
Carl Heinz Boehm as Jean
Serge Reggiani as Mougins
Arletty as Gabrielle
Reg Lye as Buddington
Maea Flohr
James Condon as ship purser
Doris Fitton as gossipy tourist
John Martin as captain
Yvon Chabana as Max
Frederic Gray
Charley Mauu as Taro
Vahinerii Tauhiro as Vahinerii
Teheiura Poheroa
Germaine Levers
Development
In May 1955 it was announced producer Paul Decharme, best known for Manon and Bluebeard, would make two films a year in the Pacific. The first two would be co productions with Rafferty and Robinson, starting withWalk into Paradise, which would be shot on location in New Guinea, in English and French versions.
The second film would be made in Tahiti with French director Yves Allegret as the principal director and Robinson as director of the English version. This movie would be shot in Cinema-Scope and would hopefully star Gerard Philippe.
"I was told that the Pacific was very wide, and its capital was Sydney so I came here," said Decharne."I also heard that Australians appreciated French films better than any other country outside Europe. La Ronde made more money in Australia than it did in France."
Robinson was attracted to work with French companies because "they were so organised, and they were so strong financially."
At one stage the film was called Vahini Tahiti.
In March 1957 Chips Rafferty announced the lead roles would be played by Françoise Arnoul, best known for Fire in the Blood and French Can Can, and John Forrest, who had been in Dust in the Sun. Neither actor appeared in the final movie. By July 1957 the stars were announced as Martine Carol and Trevor Howard with five Australians, four men and a woman, to appear in the cast. Carol was a French film star who was attempting to move into international movies at the time, just having made Action of the Tiger with Van Johnson.
Lee Rafferty and Chips Robinson contributed money towards the production via sales from Walk into Paradise and funds loaned from Herc McIntyre from the superannuation fund of Universal Picture's Australian branch.
Robinson says the French producer arranged the main cast, but he cast Roger Livesey. "Livesey was on tour in Australia, so we engaged Livesy as one of our actors here." Robinson says "There was no role for Chips" in the film.
Martine Carol stopped off at Brisbane airport on 5 September flying from Paris to Tahiti. She was met by over 300 fans and Chips Rafferty. The Australian film location had left earlier that week.
Production
The film was shot towards the end of 1957 in Tahiti and the Society Islands, with scenes also shot on the ship Caledonin. Robinson says half the crew was Australian and the other half was French. Filming was completed by November.
Dialogue scenes were filmed twice, in English (by Robinson) and French (by Habib). Robinson claimed he didn't like Habib's style of direction.
He was a mad home movies crank and would stand by the camera or even ten feet away from it and be shooting the scene that was his first take. I used to wonder how the hell does he know what is going on there. Often he was on an entirely different angle to the camera. He often seemed more concerned about getting a good scene on his little 16 mm camera. Right from the beginning I found I was in a marvellous position as the second follow-up director because I could see everything that was being done and then rack my brains for some little thing that might spice the scene up a bit.
Noted Sydney theatre actor Doris Fitton had a supporting role.
While making the film in Tahiti, Robinson and his crew then shot an Italian-French co production called Hula Hula. Later they came back to make a pilot for a CBS show Machete and then The Restless and the Damned.
Release
On 23 August 1958 Lee Robinson announced Dust in the Sun and The Stowaway were going to be released by Universal in Australia. Robinson said, "I consider this deal is a relevant comment on recent statements that the Australian film industry is failing for lack of support."
The film was released in France - Robinson said it had a "five major cinema release in Paris" - but only received a limited release in Australia - it had its debut in Dubbo in 1958 and in Sydney and Melbourne in 1960. It was not as successful as Walk into Paradise. Robinson blames this on the impact of television and says the losses he made on the film and Restless and the Damnded contributed to Southern International going broke.
Critical reception
Variety reviewed the film in Paris in September 1958. It reported:
This garishly colored pic was shot in Tahiti. That is its main trump with the easygoing island habits and its scenery. Otherwise, this fairly hackneyed adventure yarn lacks the pace, mounting and acting to make color prints worth while for Yank chances... Ralph Habib’s cliche-ridden direction does not help instill life into this. Miss Carol walks through this listlessly and shows some rounded anatomy at times. Serge Reggiani and Roger Livesey are fine as the fortune hunters.
The Sydney Morning Herald said "Robinson has little dramatic idea of how to handle his people (particularly Reggiani) or his plot. His flat treatment slows the treasure chase to a crawl. Clumsy cutting, and stilted voice-dubbing for the Continental players, are technical faults astonishing in so elaborate a production. The natural beauties of Tahiti... are some consolation." The Age said "the color shots of Tahiti, its lagoons, girls and dances may warm your winter's day. Unfortunately nothing else about the picture will."
References
External links
The Stowaway at Letterbox DVD
The Stowaway at BFI
The Stowaway at National Film and Sound Archive
The Stowaway at Oz Movies
1958 films
English-language French films
1958 adventure films
Films based on Belgian novels
Films based on works by Georges Simenon
Films directed by Lee Robinson
Films directed by Ralph Habib
Films set in French Polynesia
1950s French-language films
French multilingual films
Australian multilingual films
French-Australian culture
1950s multilingual films
|
Final league standings for the 1989 Western Soccer League season.
League standings
North Division
South Division
Playoffs
Bracket
Semifinal 1
Semifinal 2
Final
Points leaders
Honors
MVP: Kasey Keller
Leading goal scorer: Steve Corpening
Leading goalkeeper: Kasey Keller
First Team All League
Goalkeeper: Kasey Keller
Defenders: Marcelo Balboa, John Doyle, Mike Lapper, Cle Kooiman
Midfielders: Dominic Kinnear, John Bain, Chris Henderson
Forwards: Scott Benedetti, Jeff Hooker, Mark Kerlin
Second Team All League
Goalkeeper: Todd Elias
Defenders: Steve Boardman, Troy Dayak, Grant Gibbs, Arturo Velazco
Midfielders: Jim Gabarra, Jerome Watson
Forwards: Steve Corpening, Brent Goulet, Eddie Henderson, Wes Wade
1989 National Professional Soccer Championship
In anticipation of a proposed merger, which eventually took place the following year, the WSL champions faced off against the American Soccer League champions in the 1989 National Pro Soccer Championship on September 9 at Spartan Stadium in San Jose, California. The matched marked the first time since 1984 that an undisputed national champion of professional soccer was crowned in the U.S.
Match report
References
External links
The Year in American Soccer - 1989
1988 Western Soccer Alliance
Western Soccer Alliance seasons
2
nl:Amerikaans voetbalkampioenschap 1989
|
Richard Rudolph (June 11, 1911 – January 31, 2014) was the last surviving victim of "double persecution" in that he was incarcerated for nearly nine years in Nazi prisons and concentration camps and then was imprisoned for a further ten years in the communist German Democratic Republic (East Germany). He was imprisoned in Sachsenhausen, Neuengamme, and Ravensbrück concentration camps and the Salzgitter-Watenstedt Leinde subcamp of Neuengamme in addition to various police, penitentiary and juvenile prisons.
Grounds for his imprisonment and persecution in the Nazi era were his stand as a conscientious objector, for which he barely escaped being executed on several occasions, and his beliefs as a Jehovah's Witness. Jehovah's Witnesses supported neither Nazi racist and militaristic policies nor communist suppression of religion. Rudolph's experiences have been documented in the book Im Zeugenstand: Was wir noch sagen sollten, 100 Fragen—900 Antworten, Interviews mit Holocaust-Überlebenden und NS-Opfern, released in English as Taking the Stand: We Have More to Say, 100 Questions—900 Answers, Interviews with Holocaust Survivors and Victims of Nazi Tyranny, by Bernhard Rammerstorfer, an author and film producer regarding Holocaust subject matter.
References
German Jehovah's Witnesses
Sachsenhausen concentration camp survivors
Neuengamme concentration camp survivors
Ravensbrück concentration camp survivors
Prisoners and detainees of East Germany
1911 births
2014 deaths
Persecution of Jehovah's Witnesses
German centenarians
Men centenarians
|
```shell
Subdirectory checkout
Managing branches
Viewing your tracking branches
What is rebasing?
Move the last commit to a new branch
```
|
```smalltalk
// OutBuffer.cs
namespace SevenZip.Buffer
{
public class OutBuffer
{
byte[] m_Buffer;
uint m_Pos;
uint m_BufferSize;
System.IO.Stream m_Stream;
ulong m_ProcessedSize;
public OutBuffer(uint bufferSize)
{
m_Buffer = new byte[bufferSize];
m_BufferSize = bufferSize;
}
public void SetStream(System.IO.Stream stream) { m_Stream = stream; }
public void FlushStream() { m_Stream.Flush(); }
public void CloseStream() { m_Stream.Close(); }
public void ReleaseStream() { m_Stream = null; }
public void Init()
{
m_ProcessedSize = 0;
m_Pos = 0;
}
public void WriteByte(byte b)
{
m_Buffer[m_Pos++] = b;
if (m_Pos >= m_BufferSize)
FlushData();
}
public void FlushData()
{
if (m_Pos == 0)
return;
m_Stream.Write(m_Buffer, 0, (int)m_Pos);
m_Pos = 0;
}
public ulong GetProcessedSize() { return m_ProcessedSize + m_Pos; }
}
}
```
|
```objective-c
// 2016 and later: Unicode, Inc. and others.
/*
*******************************************************************************
*
* Corporation and others. All Rights Reserved.
*
*******************************************************************************
* file name: normalizer2.h
* encoding: UTF-8
* tab size: 8 (not used)
* indentation:4
*
* created on: 2009nov22
* created by: Markus W. Scherer
*/
#ifndef __NORMALIZER2_H__
#define __NORMALIZER2_H__
/**
* \file
* \brief C++ API: New API for Unicode Normalization.
*/
#include "unicode/utypes.h"
#if !UCONFIG_NO_NORMALIZATION
#include "unicode/stringpiece.h"
#include "unicode/uniset.h"
#include "unicode/unistr.h"
#include "unicode/unorm2.h"
U_NAMESPACE_BEGIN
class ByteSink;
/**
* Unicode normalization functionality for standard Unicode normalization or
* for using custom mapping tables.
* All instances of this class are unmodifiable/immutable.
* Instances returned by getInstance() are singletons that must not be deleted by the caller.
* The Normalizer2 class is not intended for public subclassing.
*
* The primary functions are to produce a normalized string and to detect whether
* a string is already normalized.
* The most commonly used normalization forms are those defined in
* path_to_url
* However, this API supports additional normalization forms for specialized purposes.
* For example, NFKC_Casefold is provided via getInstance("nfkc_cf", COMPOSE)
* and can be used in implementations of UTS #46.
*
* Not only are the standard compose and decompose modes supplied,
* but additional modes are provided as documented in the Mode enum.
*
* Some of the functions in this class identify normalization boundaries.
* At a normalization boundary, the portions of the string
* before it and starting from it do not interact and can be handled independently.
*
* The spanQuickCheckYes() stops at a normalization boundary.
* When the goal is a normalized string, then the text before the boundary
* can be copied, and the remainder can be processed with normalizeSecondAndAppend().
*
* The hasBoundaryBefore(), hasBoundaryAfter() and isInert() functions test whether
* a character is guaranteed to be at a normalization boundary,
* regardless of context.
* This is used for moving from one normalization boundary to the next
* or preceding boundary, and for performing iterative normalization.
*
* Iterative normalization is useful when only a small portion of a
* longer string needs to be processed.
* For example, in ICU, iterative normalization is used by the NormalizationTransliterator
* (to avoid replacing already-normalized text) and ucol_nextSortKeyPart()
* (to process only the substring for which sort key bytes are computed).
*
* The set of normalization boundaries returned by these functions may not be
* complete: There may be more boundaries that could be returned.
* Different functions may return different boundaries.
* @stable ICU 4.4
*/
class U_COMMON_API Normalizer2 : public UObject {
public:
/**
* Destructor.
* @stable ICU 4.4
*/
~Normalizer2();
/**
* Returns a Normalizer2 instance for Unicode NFC normalization.
* Same as getInstance(NULL, "nfc", UNORM2_COMPOSE, errorCode).
* Returns an unmodifiable singleton instance. Do not delete it.
* @param errorCode Standard ICU error code. Its input value must
* pass the U_SUCCESS() test, or else the function returns
* immediately. Check for U_FAILURE() on output or use with
* function chaining. (See User Guide for details.)
* @return the requested Normalizer2, if successful
* @stable ICU 49
*/
static const Normalizer2 *
getNFCInstance(UErrorCode &errorCode);
/**
* Returns a Normalizer2 instance for Unicode NFD normalization.
* Same as getInstance(NULL, "nfc", UNORM2_DECOMPOSE, errorCode).
* Returns an unmodifiable singleton instance. Do not delete it.
* @param errorCode Standard ICU error code. Its input value must
* pass the U_SUCCESS() test, or else the function returns
* immediately. Check for U_FAILURE() on output or use with
* function chaining. (See User Guide for details.)
* @return the requested Normalizer2, if successful
* @stable ICU 49
*/
static const Normalizer2 *
getNFDInstance(UErrorCode &errorCode);
/**
* Returns a Normalizer2 instance for Unicode NFKC normalization.
* Same as getInstance(NULL, "nfkc", UNORM2_COMPOSE, errorCode).
* Returns an unmodifiable singleton instance. Do not delete it.
* @param errorCode Standard ICU error code. Its input value must
* pass the U_SUCCESS() test, or else the function returns
* immediately. Check for U_FAILURE() on output or use with
* function chaining. (See User Guide for details.)
* @return the requested Normalizer2, if successful
* @stable ICU 49
*/
static const Normalizer2 *
getNFKCInstance(UErrorCode &errorCode);
/**
* Returns a Normalizer2 instance for Unicode NFKD normalization.
* Same as getInstance(NULL, "nfkc", UNORM2_DECOMPOSE, errorCode).
* Returns an unmodifiable singleton instance. Do not delete it.
* @param errorCode Standard ICU error code. Its input value must
* pass the U_SUCCESS() test, or else the function returns
* immediately. Check for U_FAILURE() on output or use with
* function chaining. (See User Guide for details.)
* @return the requested Normalizer2, if successful
* @stable ICU 49
*/
static const Normalizer2 *
getNFKDInstance(UErrorCode &errorCode);
/**
* Returns a Normalizer2 instance for Unicode NFKC_Casefold normalization.
* Same as getInstance(NULL, "nfkc_cf", UNORM2_COMPOSE, errorCode).
* Returns an unmodifiable singleton instance. Do not delete it.
* @param errorCode Standard ICU error code. Its input value must
* pass the U_SUCCESS() test, or else the function returns
* immediately. Check for U_FAILURE() on output or use with
* function chaining. (See User Guide for details.)
* @return the requested Normalizer2, if successful
* @stable ICU 49
*/
static const Normalizer2 *
getNFKCCasefoldInstance(UErrorCode &errorCode);
/**
* Returns a Normalizer2 instance which uses the specified data file
* (packageName/name similar to ucnv_openPackage() and ures_open()/ResourceBundle)
* and which composes or decomposes text according to the specified mode.
* Returns an unmodifiable singleton instance. Do not delete it.
*
* Use packageName=NULL for data files that are part of ICU's own data.
* Use name="nfc" and UNORM2_COMPOSE/UNORM2_DECOMPOSE for Unicode standard NFC/NFD.
* Use name="nfkc" and UNORM2_COMPOSE/UNORM2_DECOMPOSE for Unicode standard NFKC/NFKD.
* Use name="nfkc_cf" and UNORM2_COMPOSE for Unicode standard NFKC_CF=NFKC_Casefold.
*
* @param packageName NULL for ICU built-in data, otherwise application data package name
* @param name "nfc" or "nfkc" or "nfkc_cf" or name of custom data file
* @param mode normalization mode (compose or decompose etc.)
* @param errorCode Standard ICU error code. Its input value must
* pass the U_SUCCESS() test, or else the function returns
* immediately. Check for U_FAILURE() on output or use with
* function chaining. (See User Guide for details.)
* @return the requested Normalizer2, if successful
* @stable ICU 4.4
*/
static const Normalizer2 *
getInstance(const char *packageName,
const char *name,
UNormalization2Mode mode,
UErrorCode &errorCode);
/**
* Returns the normalized form of the source string.
* @param src source string
* @param errorCode Standard ICU error code. Its input value must
* pass the U_SUCCESS() test, or else the function returns
* immediately. Check for U_FAILURE() on output or use with
* function chaining. (See User Guide for details.)
* @return normalized src
* @stable ICU 4.4
*/
UnicodeString
normalize(const UnicodeString &src, UErrorCode &errorCode) const {
UnicodeString result;
normalize(src, result, errorCode);
return result;
}
/**
* Writes the normalized form of the source string to the destination string
* (replacing its contents) and returns the destination string.
* The source and destination strings must be different objects.
* @param src source string
* @param dest destination string; its contents is replaced with normalized src
* @param errorCode Standard ICU error code. Its input value must
* pass the U_SUCCESS() test, or else the function returns
* immediately. Check for U_FAILURE() on output or use with
* function chaining. (See User Guide for details.)
* @return dest
* @stable ICU 4.4
*/
virtual UnicodeString &
normalize(const UnicodeString &src,
UnicodeString &dest,
UErrorCode &errorCode) const = 0;
/**
* Normalizes a UTF-8 string and optionally records how source substrings
* relate to changed and unchanged result substrings.
*
* Currently implemented completely only for "compose" modes,
* such as for NFC, NFKC, and NFKC_Casefold
* (UNORM2_COMPOSE and UNORM2_COMPOSE_CONTIGUOUS).
* Otherwise currently converts to & from UTF-16 and does not support edits.
*
* @param options Options bit set, usually 0. See U_OMIT_UNCHANGED_TEXT and U_EDITS_NO_RESET.
* @param src Source UTF-8 string.
* @param sink A ByteSink to which the normalized UTF-8 result string is written.
* sink.Flush() is called at the end.
* @param edits Records edits for index mapping, working with styled text,
* and getting only changes (if any).
* The Edits contents is undefined if any error occurs.
* This function calls edits->reset() first unless
* options includes U_EDITS_NO_RESET. edits can be nullptr.
* @param errorCode Standard ICU error code. Its input value must
* pass the U_SUCCESS() test, or else the function returns
* immediately. Check for U_FAILURE() on output or use with
* function chaining. (See User Guide for details.)
* @draft ICU 60
*/
virtual void
normalizeUTF8(uint32_t options, StringPiece src, ByteSink &sink,
Edits *edits, UErrorCode &errorCode) const;
/**
* Appends the normalized form of the second string to the first string
* (merging them at the boundary) and returns the first string.
* The result is normalized if the first string was normalized.
* The first and second strings must be different objects.
* @param first string, should be normalized
* @param second string, will be normalized
* @param errorCode Standard ICU error code. Its input value must
* pass the U_SUCCESS() test, or else the function returns
* immediately. Check for U_FAILURE() on output or use with
* function chaining. (See User Guide for details.)
* @return first
* @stable ICU 4.4
*/
virtual UnicodeString &
normalizeSecondAndAppend(UnicodeString &first,
const UnicodeString &second,
UErrorCode &errorCode) const = 0;
/**
* Appends the second string to the first string
* (merging them at the boundary) and returns the first string.
* The result is normalized if both the strings were normalized.
* The first and second strings must be different objects.
* @param first string, should be normalized
* @param second string, should be normalized
* @param errorCode Standard ICU error code. Its input value must
* pass the U_SUCCESS() test, or else the function returns
* immediately. Check for U_FAILURE() on output or use with
* function chaining. (See User Guide for details.)
* @return first
* @stable ICU 4.4
*/
virtual UnicodeString &
append(UnicodeString &first,
const UnicodeString &second,
UErrorCode &errorCode) const = 0;
/**
* Gets the decomposition mapping of c.
* Roughly equivalent to normalizing the String form of c
* on a UNORM2_DECOMPOSE Normalizer2 instance, but much faster, and except that this function
* returns FALSE and does not write a string
* if c does not have a decomposition mapping in this instance's data.
* This function is independent of the mode of the Normalizer2.
* @param c code point
* @param decomposition String object which will be set to c's
* decomposition mapping, if there is one.
* @return TRUE if c has a decomposition, otherwise FALSE
* @stable ICU 4.6
*/
virtual UBool
getDecomposition(UChar32 c, UnicodeString &decomposition) const = 0;
/**
* Gets the raw decomposition mapping of c.
*
* This is similar to the getDecomposition() method but returns the
* raw decomposition mapping as specified in UnicodeData.txt or
* (for custom data) in the mapping files processed by the gennorm2 tool.
* By contrast, getDecomposition() returns the processed,
* recursively-decomposed version of this mapping.
*
* When used on a standard NFKC Normalizer2 instance,
* getRawDecomposition() returns the Unicode Decomposition_Mapping (dm) property.
*
* When used on a standard NFC Normalizer2 instance,
* it returns the Decomposition_Mapping only if the Decomposition_Type (dt) is Canonical (Can);
* in this case, the result contains either one or two code points (=1..4 char16_ts).
*
* This function is independent of the mode of the Normalizer2.
* The default implementation returns FALSE.
* @param c code point
* @param decomposition String object which will be set to c's
* raw decomposition mapping, if there is one.
* @return TRUE if c has a decomposition, otherwise FALSE
* @stable ICU 49
*/
virtual UBool
getRawDecomposition(UChar32 c, UnicodeString &decomposition) const;
/**
* Performs pairwise composition of a & b and returns the composite if there is one.
*
* Returns a composite code point c only if c has a two-way mapping to a+b.
* In standard Unicode normalization, this means that
* c has a canonical decomposition to a+b
* and c does not have the Full_Composition_Exclusion property.
*
* This function is independent of the mode of the Normalizer2.
* The default implementation returns a negative value.
* @param a A (normalization starter) code point.
* @param b Another code point.
* @return The non-negative composite code point if there is one; otherwise a negative value.
* @stable ICU 49
*/
virtual UChar32
composePair(UChar32 a, UChar32 b) const;
/**
* Gets the combining class of c.
* The default implementation returns 0
* but all standard implementations return the Unicode Canonical_Combining_Class value.
* @param c code point
* @return c's combining class
* @stable ICU 49
*/
virtual uint8_t
getCombiningClass(UChar32 c) const;
/**
* Tests if the string is normalized.
* Internally, in cases where the quickCheck() method would return "maybe"
* (which is only possible for the two COMPOSE modes) this method
* resolves to "yes" or "no" to provide a definitive result,
* at the cost of doing more work in those cases.
* @param s input string
* @param errorCode Standard ICU error code. Its input value must
* pass the U_SUCCESS() test, or else the function returns
* immediately. Check for U_FAILURE() on output or use with
* function chaining. (See User Guide for details.)
* @return TRUE if s is normalized
* @stable ICU 4.4
*/
virtual UBool
isNormalized(const UnicodeString &s, UErrorCode &errorCode) const = 0;
/**
* Tests if the UTF-8 string is normalized.
* Internally, in cases where the quickCheck() method would return "maybe"
* (which is only possible for the two COMPOSE modes) this method
* resolves to "yes" or "no" to provide a definitive result,
* at the cost of doing more work in those cases.
*
* This works for all normalization modes,
* but it is currently optimized for UTF-8 only for "compose" modes,
* such as for NFC, NFKC, and NFKC_Casefold
* (UNORM2_COMPOSE and UNORM2_COMPOSE_CONTIGUOUS).
* For other modes it currently converts to UTF-16 and calls isNormalized().
*
* @param s UTF-8 input string
* @param errorCode Standard ICU error code. Its input value must
* pass the U_SUCCESS() test, or else the function returns
* immediately. Check for U_FAILURE() on output or use with
* function chaining. (See User Guide for details.)
* @return TRUE if s is normalized
* @draft ICU 60
*/
virtual UBool
isNormalizedUTF8(StringPiece s, UErrorCode &errorCode) const;
/**
* Tests if the string is normalized.
* For the two COMPOSE modes, the result could be "maybe" in cases that
* would take a little more work to resolve definitively.
* Use spanQuickCheckYes() and normalizeSecondAndAppend() for a faster
* combination of quick check + normalization, to avoid
* re-checking the "yes" prefix.
* @param s input string
* @param errorCode Standard ICU error code. Its input value must
* pass the U_SUCCESS() test, or else the function returns
* immediately. Check for U_FAILURE() on output or use with
* function chaining. (See User Guide for details.)
* @return UNormalizationCheckResult
* @stable ICU 4.4
*/
virtual UNormalizationCheckResult
quickCheck(const UnicodeString &s, UErrorCode &errorCode) const = 0;
/**
* Returns the end of the normalized substring of the input string.
* In other words, with <code>end=spanQuickCheckYes(s, ec);</code>
* the substring <code>UnicodeString(s, 0, end)</code>
* will pass the quick check with a "yes" result.
*
* The returned end index is usually one or more characters before the
* "no" or "maybe" character: The end index is at a normalization boundary.
* (See the class documentation for more about normalization boundaries.)
*
* When the goal is a normalized string and most input strings are expected
* to be normalized already, then call this method,
* and if it returns a prefix shorter than the input string,
* copy that prefix and use normalizeSecondAndAppend() for the remainder.
* @param s input string
* @param errorCode Standard ICU error code. Its input value must
* pass the U_SUCCESS() test, or else the function returns
* immediately. Check for U_FAILURE() on output or use with
* function chaining. (See User Guide for details.)
* @return "yes" span end index
* @stable ICU 4.4
*/
virtual int32_t
spanQuickCheckYes(const UnicodeString &s, UErrorCode &errorCode) const = 0;
/**
* Tests if the character always has a normalization boundary before it,
* regardless of context.
* If true, then the character does not normalization-interact with
* preceding characters.
* In other words, a string containing this character can be normalized
* by processing portions before this character and starting from this
* character independently.
* This is used for iterative normalization. See the class documentation for details.
* @param c character to test
* @return TRUE if c has a normalization boundary before it
* @stable ICU 4.4
*/
virtual UBool hasBoundaryBefore(UChar32 c) const = 0;
/**
* Tests if the character always has a normalization boundary after it,
* regardless of context.
* If true, then the character does not normalization-interact with
* following characters.
* In other words, a string containing this character can be normalized
* by processing portions up to this character and after this
* character independently.
* This is used for iterative normalization. See the class documentation for details.
* Note that this operation may be significantly slower than hasBoundaryBefore().
* @param c character to test
* @return TRUE if c has a normalization boundary after it
* @stable ICU 4.4
*/
virtual UBool hasBoundaryAfter(UChar32 c) const = 0;
/**
* Tests if the character is normalization-inert.
* If true, then the character does not change, nor normalization-interact with
* preceding or following characters.
* In other words, a string containing this character can be normalized
* by processing portions before this character and after this
* character independently.
* This is used for iterative normalization. See the class documentation for details.
* Note that this operation may be significantly slower than hasBoundaryBefore().
* @param c character to test
* @return TRUE if c is normalization-inert
* @stable ICU 4.4
*/
virtual UBool isInert(UChar32 c) const = 0;
};
/**
* Normalization filtered by a UnicodeSet.
* Normalizes portions of the text contained in the filter set and leaves
* portions not contained in the filter set unchanged.
* Filtering is done via UnicodeSet::span(..., USET_SPAN_SIMPLE).
* Not-in-the-filter text is treated as "is normalized" and "quick check yes".
* This class implements all of (and only) the Normalizer2 API.
* An instance of this class is unmodifiable/immutable but is constructed and
* must be destructed by the owner.
* @stable ICU 4.4
*/
class U_COMMON_API FilteredNormalizer2 : public Normalizer2 {
public:
/**
* Constructs a filtered normalizer wrapping any Normalizer2 instance
* and a filter set.
* Both are aliased and must not be modified or deleted while this object
* is used.
* The filter set should be frozen; otherwise the performance will suffer greatly.
* @param n2 wrapped Normalizer2 instance
* @param filterSet UnicodeSet which determines the characters to be normalized
* @stable ICU 4.4
*/
FilteredNormalizer2(const Normalizer2 &n2, const UnicodeSet &filterSet) :
norm2(n2), set(filterSet) {}
/**
* Destructor.
* @stable ICU 4.4
*/
~FilteredNormalizer2();
/**
* Writes the normalized form of the source string to the destination string
* (replacing its contents) and returns the destination string.
* The source and destination strings must be different objects.
* @param src source string
* @param dest destination string; its contents is replaced with normalized src
* @param errorCode Standard ICU error code. Its input value must
* pass the U_SUCCESS() test, or else the function returns
* immediately. Check for U_FAILURE() on output or use with
* function chaining. (See User Guide for details.)
* @return dest
* @stable ICU 4.4
*/
virtual UnicodeString &
normalize(const UnicodeString &src,
UnicodeString &dest,
UErrorCode &errorCode) const U_OVERRIDE;
/**
* Normalizes a UTF-8 string and optionally records how source substrings
* relate to changed and unchanged result substrings.
*
* Currently implemented completely only for "compose" modes,
* such as for NFC, NFKC, and NFKC_Casefold
* (UNORM2_COMPOSE and UNORM2_COMPOSE_CONTIGUOUS).
* Otherwise currently converts to & from UTF-16 and does not support edits.
*
* @param options Options bit set, usually 0. See U_OMIT_UNCHANGED_TEXT and U_EDITS_NO_RESET.
* @param src Source UTF-8 string.
* @param sink A ByteSink to which the normalized UTF-8 result string is written.
* sink.Flush() is called at the end.
* @param edits Records edits for index mapping, working with styled text,
* and getting only changes (if any).
* The Edits contents is undefined if any error occurs.
* This function calls edits->reset() first unless
* options includes U_EDITS_NO_RESET. edits can be nullptr.
* @param errorCode Standard ICU error code. Its input value must
* pass the U_SUCCESS() test, or else the function returns
* immediately. Check for U_FAILURE() on output or use with
* function chaining. (See User Guide for details.)
* @draft ICU 60
*/
virtual void
normalizeUTF8(uint32_t options, StringPiece src, ByteSink &sink,
Edits *edits, UErrorCode &errorCode) const U_OVERRIDE;
/**
* Appends the normalized form of the second string to the first string
* (merging them at the boundary) and returns the first string.
* The result is normalized if the first string was normalized.
* The first and second strings must be different objects.
* @param first string, should be normalized
* @param second string, will be normalized
* @param errorCode Standard ICU error code. Its input value must
* pass the U_SUCCESS() test, or else the function returns
* immediately. Check for U_FAILURE() on output or use with
* function chaining. (See User Guide for details.)
* @return first
* @stable ICU 4.4
*/
virtual UnicodeString &
normalizeSecondAndAppend(UnicodeString &first,
const UnicodeString &second,
UErrorCode &errorCode) const U_OVERRIDE;
/**
* Appends the second string to the first string
* (merging them at the boundary) and returns the first string.
* The result is normalized if both the strings were normalized.
* The first and second strings must be different objects.
* @param first string, should be normalized
* @param second string, should be normalized
* @param errorCode Standard ICU error code. Its input value must
* pass the U_SUCCESS() test, or else the function returns
* immediately. Check for U_FAILURE() on output or use with
* function chaining. (See User Guide for details.)
* @return first
* @stable ICU 4.4
*/
virtual UnicodeString &
append(UnicodeString &first,
const UnicodeString &second,
UErrorCode &errorCode) const U_OVERRIDE;
/**
* Gets the decomposition mapping of c.
* For details see the base class documentation.
*
* This function is independent of the mode of the Normalizer2.
* @param c code point
* @param decomposition String object which will be set to c's
* decomposition mapping, if there is one.
* @return TRUE if c has a decomposition, otherwise FALSE
* @stable ICU 4.6
*/
virtual UBool
getDecomposition(UChar32 c, UnicodeString &decomposition) const U_OVERRIDE;
/**
* Gets the raw decomposition mapping of c.
* For details see the base class documentation.
*
* This function is independent of the mode of the Normalizer2.
* @param c code point
* @param decomposition String object which will be set to c's
* raw decomposition mapping, if there is one.
* @return TRUE if c has a decomposition, otherwise FALSE
* @stable ICU 49
*/
virtual UBool
getRawDecomposition(UChar32 c, UnicodeString &decomposition) const U_OVERRIDE;
/**
* Performs pairwise composition of a & b and returns the composite if there is one.
* For details see the base class documentation.
*
* This function is independent of the mode of the Normalizer2.
* @param a A (normalization starter) code point.
* @param b Another code point.
* @return The non-negative composite code point if there is one; otherwise a negative value.
* @stable ICU 49
*/
virtual UChar32
composePair(UChar32 a, UChar32 b) const U_OVERRIDE;
/**
* Gets the combining class of c.
* The default implementation returns 0
* but all standard implementations return the Unicode Canonical_Combining_Class value.
* @param c code point
* @return c's combining class
* @stable ICU 49
*/
virtual uint8_t
getCombiningClass(UChar32 c) const U_OVERRIDE;
/**
* Tests if the string is normalized.
* For details see the Normalizer2 base class documentation.
* @param s input string
* @param errorCode Standard ICU error code. Its input value must
* pass the U_SUCCESS() test, or else the function returns
* immediately. Check for U_FAILURE() on output or use with
* function chaining. (See User Guide for details.)
* @return TRUE if s is normalized
* @stable ICU 4.4
*/
virtual UBool
isNormalized(const UnicodeString &s, UErrorCode &errorCode) const U_OVERRIDE;
/**
* Tests if the UTF-8 string is normalized.
* Internally, in cases where the quickCheck() method would return "maybe"
* (which is only possible for the two COMPOSE modes) this method
* resolves to "yes" or "no" to provide a definitive result,
* at the cost of doing more work in those cases.
*
* This works for all normalization modes,
* but it is currently optimized for UTF-8 only for "compose" modes,
* such as for NFC, NFKC, and NFKC_Casefold
* (UNORM2_COMPOSE and UNORM2_COMPOSE_CONTIGUOUS).
* For other modes it currently converts to UTF-16 and calls isNormalized().
*
* @param s UTF-8 input string
* @param errorCode Standard ICU error code. Its input value must
* pass the U_SUCCESS() test, or else the function returns
* immediately. Check for U_FAILURE() on output or use with
* function chaining. (See User Guide for details.)
* @return TRUE if s is normalized
* @draft ICU 60
*/
virtual UBool
isNormalizedUTF8(StringPiece s, UErrorCode &errorCode) const U_OVERRIDE;
/**
* Tests if the string is normalized.
* For details see the Normalizer2 base class documentation.
* @param s input string
* @param errorCode Standard ICU error code. Its input value must
* pass the U_SUCCESS() test, or else the function returns
* immediately. Check for U_FAILURE() on output or use with
* function chaining. (See User Guide for details.)
* @return UNormalizationCheckResult
* @stable ICU 4.4
*/
virtual UNormalizationCheckResult
quickCheck(const UnicodeString &s, UErrorCode &errorCode) const U_OVERRIDE;
/**
* Returns the end of the normalized substring of the input string.
* For details see the Normalizer2 base class documentation.
* @param s input string
* @param errorCode Standard ICU error code. Its input value must
* pass the U_SUCCESS() test, or else the function returns
* immediately. Check for U_FAILURE() on output or use with
* function chaining. (See User Guide for details.)
* @return "yes" span end index
* @stable ICU 4.4
*/
virtual int32_t
spanQuickCheckYes(const UnicodeString &s, UErrorCode &errorCode) const U_OVERRIDE;
/**
* Tests if the character always has a normalization boundary before it,
* regardless of context.
* For details see the Normalizer2 base class documentation.
* @param c character to test
* @return TRUE if c has a normalization boundary before it
* @stable ICU 4.4
*/
virtual UBool hasBoundaryBefore(UChar32 c) const U_OVERRIDE;
/**
* Tests if the character always has a normalization boundary after it,
* regardless of context.
* For details see the Normalizer2 base class documentation.
* @param c character to test
* @return TRUE if c has a normalization boundary after it
* @stable ICU 4.4
*/
virtual UBool hasBoundaryAfter(UChar32 c) const U_OVERRIDE;
/**
* Tests if the character is normalization-inert.
* For details see the Normalizer2 base class documentation.
* @param c character to test
* @return TRUE if c is normalization-inert
* @stable ICU 4.4
*/
virtual UBool isInert(UChar32 c) const U_OVERRIDE;
private:
UnicodeString &
normalize(const UnicodeString &src,
UnicodeString &dest,
USetSpanCondition spanCondition,
UErrorCode &errorCode) const;
void
normalizeUTF8(uint32_t options, const char *src, int32_t length,
ByteSink &sink, Edits *edits,
USetSpanCondition spanCondition,
UErrorCode &errorCode) const;
UnicodeString &
normalizeSecondAndAppend(UnicodeString &first,
const UnicodeString &second,
UBool doNormalize,
UErrorCode &errorCode) const;
const Normalizer2 &norm2;
const UnicodeSet &set;
};
U_NAMESPACE_END
#endif // !UCONFIG_NO_NORMALIZATION
#endif // __NORMALIZER2_H__
```
|
Shona Clusters Disputes are tribal disputes within five Shona clusters. They are mainly driven by cluster extremist in position of power e.g late former President, Robert Gabriel Mugabe of Zezuru cluster and current President, Emmerson Dambudzo Mnangagwa of Karanga Cluster. These disputes dates back to 1800s, which ultimately resulted in Shona defeats by Ndebele State. They are also evident among the general public like in the stance of dialects. However, Mugabe is largely blamed for reviving the disputes in 1970s.
Manyika-Karanga Struggle
Masipula Sithole mentioned that in 1971 they arranged power share between Manyika, Karanga and Zezuru which aimed to prevent trialbal hostility, however the Zezuru pulled out which led to direct conflict between Manyika and Karanga.
The height of Manyika-Karanga Struggle was evident with the killing of Hebert Chitepo of Manyika cluster in March 1975. In May of 1976, Nabaningi Sithole of Ndau claimed that ZANU structures are propelling tribalism and regionalism. In 1977 Sithole set up his splinter ZANU group to tribal balance into practice, where he chose two from each group including the Ndebele.
Zezuru-Korekore Alliance
This one was an agenda led by Robert Mugabe alongside his Korekore counterparts against Ndau, Manyika and Karanga. However, it met most of its resistance from Karanga.
Karanga-Ndebele Supremacy
References
Extremism
Shona
Politics of Zimbabwe
Politics of Rhodesia
|
Golędzinów may refer to the following places in Poland:
Golędzinów in Gmina Oborniki Śląskie, Trzebnica County in Lower Silesian Voivodeship (SW Poland)
Other places called Golędzinów (listed in Polish Wikipedia)
|
```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 main
import (
"fmt"
"log"
"github.com/dropbox/dbxcli/cmd"
"github.com/dropbox/dropbox-sdk-go-unofficial/v6/dropbox"
"github.com/spf13/cobra"
)
var version = "0.1.0"
// versionCmd represents the version command
var versionCmd = &cobra.Command{
Use: "version",
Short: "Print version information",
Run: func(cmd *cobra.Command, args []string) {
fmt.Println("dbxcli version:", version)
sdkVersion, specVersion := dropbox.Version()
fmt.Println("SDK version:", sdkVersion)
fmt.Println("Spec version:", specVersion)
},
}
func init() {
// Log date, time and file information by default
log.SetFlags(log.Ldate | log.Ltime | log.Lshortfile)
cmd.RootCmd.AddCommand(versionCmd)
}
func main() {
cmd.Execute()
}
```
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.