text
stringlengths 1
22.8M
|
|---|
```c++
#ifndef BOOST_MPL_LIST_AUX_BEGIN_END_HPP_INCLUDED
#define BOOST_MPL_LIST_AUX_BEGIN_END_HPP_INCLUDED
//
// (See accompanying file LICENSE_1_0.txt or copy at
// path_to_url
//
// See path_to_url for documentation.
// $Id: begin_end.hpp 49267 2008-10-11 06:19:02Z agurtovoy $
// $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $
// $Revision: 49267 $
#include <boost/mpl/begin_end_fwd.hpp>
#include <boost/mpl/list/aux_/iterator.hpp>
#include <boost/mpl/list/aux_/tag.hpp>
#include <boost/mpl/list/aux_/item.hpp>
namespace boost { namespace mpl {
template<>
struct begin_impl< aux::list_tag >
{
template< typename List > struct apply
{
typedef l_iter<typename List::type> type;
};
};
template<>
struct end_impl< aux::list_tag >
{
template< typename > struct apply
{
typedef l_iter<l_end> type;
};
};
}}
#endif // BOOST_MPL_LIST_AUX_BEGIN_END_HPP_INCLUDED
```
|
The Yorkshire Geological Society is a learned, professional and educational charity devoted to the earth sciences, founded in 1837. Its work is centred on the geology of Yorkshire, and the north of England more generally, ranging from Northumbria and Cumbria in the north to Nottinghamshire, Derbyshire and Leicestershire in the south. The Society has around 600 members, the majority living within this region but with significant proportions of UK national and overseas members. It also has working relationships with around 20 Corresponding Societies and other affiliated local geological and conservation societies and organisations, and with many of the universities of the region, as well as with the British Geological Survey, particularly its headquarters at Keyworth, Nottinghamshire. The Society runs a wide-ranging programme of both indoor and field meetings for members, public lectures and conferences in various locations across its region, and coordinates and promotes with the Corresponding Societies a "Yorkshire Geology Month" every May, in cooperation with the Corresponding Societies and other local groups. The Society also publishes on the earth sciences, notably in its biannual Proceedings, published continuously since 1839, and its Circular, published seven times a year. The Society also publishes field guides, conference reports and books from time to time.
History
The Society is the fourth oldest geological society in the United Kingdom, following the Geological Society of London (1807), the Royal Geological Society of Cornwall (1813) and the Edinburgh Geological Society (1834). Reflecting the interests of many of its coal-owner and engineer original members the Society and its Proceedings first published in 1839, the Society originally covered mining and general engineering and technology, and then archaeology also. However, from the earliest days its membership was much wider than just the West Riding, and the Society very quickly gained the active support the leading national geological figures of the day as Honorary Members. With the establishment of the Yorkshire Archaeological and Topographical Society in 1863, the Society gradually ceded its archaeological activities and publishing to the new Society, and 1903 it adopted the present name of Yorkshire Geological Society for both the society and its Proceedings. The Society also organises and coordinates the annual Yorkshire Geology Month, normally held through the month of May each year (though not held in 2020 due to the Coronavirus emergency).
From the late 19th century onwards the Society developed ever-closer links with the emerging earth science departments in the university colleges and universities of Yorkshire and adjacent counties and with the Geological Survey, particularly at its former Leeds and Newcastle offices, and these close links remain today with the British Geological Survey's headquarters at Keyworth, Nottinghamshire. The Society has also developed close relationships with what are today twenty-four "Corresponding Societies" -mainly local geological societies and groups which between then cover most of the north of England and parts of central England, from Cumbria and Northumberland in the north to Leicestershire in the south. The Society's 170-year-old geological library is housed in the Leeds University Library.
Membership
The society has about 600 Ordinary, Affiliate, Student and Life Members. No qualifications are required for membership, and the members have a wide range of backgrounds and interests, including senior earth sciences academics, professionals, researchers and students, lecturers and teachers, members of local geological societies and those with a general interest in geology and the environment. The Society's former more than 100 Institutional Members are now Subscribers to the Geological Society of London's Lyell Collection. The Annual General Meeting of members elects the Officers and Council who also serve as Trustees of the Society as a Registered Charity, and who run the Society between annual general meetings.
Publications
Published continuously since 1839, the biannual Proceedings of the Yorkshire Geological Society publishes original research and review papers in the earth sciences, frequently, though by no means only, with special reference to the geology of the north of England. Since 2011 the digitised Proceedings from 1839 to date have been made available through the Geological Society of London's online Lyell Collection. The Society's illustrated Circular is issued seven times a year and gives full details of the Society's programme of meetings, public lectures and field excursions, and the annual Yorkshire Geology Month. The Circular also carries other news and views about the Society and the geology of the North of England. The Society also publishes occasional special publications, conference reports and field guides, including:Yorkshire Rocks and Landscapes and Northumbrian Rocks and Landscapes''. Both field guides are available for sale and for free of charge downloading from the Society's website http://www.yorksgeolsoc.org.uk. The Society also has active publishing and discussion presences on social media platforms including Facebook, Twitter, YouTube and LinkedIn.
References
Geology societies
Scientific organizations established in 1837
1837 establishments in England
Scientific organisations based in the United Kingdom
Organisations based in Yorkshire
|
```javascript
function singleElementWithInitializer(...{a: b = 0}) {}
```
|
Johnathan "Rudy" Ford (born November 1, 1994) is an American football free safety for the Green Bay Packers of the National Football League (NFL). He played college football at Auburn, and was selected by the Arizona Cardinals in the sixth round of the 2017 NFL Draft. He has also played for the Philadelphia Eagles and Jacksonville Jaguars.
Professional career
Arizona Cardinals
Ford was drafted by the Arizona Cardinals in the sixth round, 208th overall, in the 2017 NFL Draft. On May 14, 2017, the Cardinals signed Ford to a four-year, $2.54 million contract with a signing bonus of $140,181. He played in 10 games his rookie season as a core special teamer before suffering a knee injury. He was placed on injured reserve on December 7, 2017.
Philadelphia Eagles
On August 22, 2019, Ford was traded to the Philadelphia Eagles for defensive tackle Bruce Hector. Ford was placed on injured reserve on November 23, 2019, after suffering an abdomen injury in practice.
On October 8, 2020, Ford was placed on injured reserve after suffering a hamstring injury in Week 4. He was activated on October 31, 2020.
Jacksonville Jaguars
On March 17, 2021, Ford signed a two-year, $4.2 million contract with the Jacksonville Jaguars.
On August 29, 2022, Ford was released by the Jaguars.
Green Bay Packers
On August 31, 2022, Ford was signed by the Green Bay Packers. On March 20, 2023, Ford re-signed with the Packers.
NFL career statistics
Regular season
References
External links
Green Bay Packers bio
Auburn Tigers bio
1994 births
Living people
People from Madison County, Alabama
Players of American football from Alabama
American football safeties
American football cornerbacks
Auburn Tigers football players
Arizona Cardinals players
Philadelphia Eagles players
Jacksonville Jaguars players
Green Bay Packers players
|
A phonovoltaic (pV) cell converts vibrational (phonons) energy into a direct current much like the photovoltaic effect in a photovoltaic (PV) cell converts light (photon) into power. That is, it uses a p-n junction to separate the electrons and holes generated as valence electrons absorb optical phonons more energetic than the band gap, and then collects them in the metallic contacts for use in a circuit. The pV cell is an application of heat transfer physics and competes with other thermal energy harvesting devices like the thermoelectric generator.
While the thermoelectric generator converts heat, a broad spectrum of phonon and electron energy, to electricity, the pV cell converts only a narrow band of phonon energy, i.e., only the most energetic optical phonon modes. A narrow band of excited optical phonons has much less entropy than heat. Thus, the pV cell can exceed the thermoelectric efficiency. However, exciting and harvesting the optical phonon poses a challenge.
Satisfying the laws of thermodynamics
By the first law of thermodynamics, the excitation driving electron generation in both photo- and phonovoltaic cells, i.e., the photon or phonon, must have more energy than the semiconductor band gap. For a PV cell, many materials are available with a band gap () well matched to the solar photon spectrum, like Silicon or Gallium Arsenide. For a pV cell, however, no current semiconducting materials have a band gap smaller than the energy of their most energetic (optical) phonon modes (). Thus, novel materials are required with both energetic optical phonon modes ( meV, e.g., graphene, diamond, or boron nitride) and a small band gap (, e.g., graphene).
By the second law of thermodynamics, the excitation must be "hotter" than the cell for power generation to occur. In a PV, the light comes from an outside source, for example, the sun, which is nearly 6000 kelvins, whereas the PV is around 300 kelvins. Thus, the second law is satisfied and energy conversion is possible. However, the crystal vibrations driving power generation in a pV are intrinsic to the material itself. As such, they can not be imported from an outside source like the sun, but must instead be excited by some other process until they are hotter than the cell. The temperature of the optical phonon population is calculated by comparing the number of optical phonon to the number expected at a given temperature, which comes from the Bose–Einstein statistics.
Non-equilibrium optical phonon population and the nanoscale requirement
There are a number of ways to excite a population of vibrations, i.e., create a hot optical phonon population. For example, if the electron population is excited, using a laser or electric field, they will typically relax by emitting optical phonons. Additionally, a hot molecular gas can impart its vibrations to a crystal when chemisorbed. Regardless of method, the conversion efficiency is limited by the optical phonon temperature achieved as compared to the electron temperature within the device due to Carnot's theorem.
In a nanoscale device, this temperature is approximately equal to the temperature of the device itself. However, in a macroscale device the generated electrons accumulate faster than they are collected. Thus, the electron population is heated up to the optical phonon temperature and further generation is inhibited. The down-conversion is simultaneously inhibited as the acoustic phonon population is heated to the optical phonon temperature. Thus, the large pV cell develops a near-equilibrium state where it is heated. At best, it will act like a thermoelectric generator and exhibit thermoelectric effects. Such a device is called a thermovoltaic, rather than a phonovoltaic.
Entropy generation and efficiency
Entropy generation and inefficiency in a PV cell is the result of photons more energetic than the band gap producing electrons with kinetic energy in addition to the potential energy provided by the band gap. Similarly, optical phonon energy in excess of the band gap generates an entropy flow in the pV cell, rather than electric power. The energy efficiency () is quantified by the ratio of the band gap and optical phonon energy, that is
In addition this typical inefficiency, hot optical phonon populations tend to downconvert into multiple low-energy, acoustic phonon modes (whereas photons typically do not downconvert into low energy infrared waves). This efficiency () is quantified by the tendency of a hot optical phonon to downconvert rather than generate an electron-hole pair, that is
where is the rate of generation and is the rate of downconversion, i.e., the rate at which an optical phonon produces multiple low-energy, acoustic phonons. This provides a second entropy flow reducing the efficiency of a pV cell.
Finally, entropy is generated in both pV and PV cells due to the inefficient separation of the generated electrons and holes. This efficiency () is limited by the Carnot efficiency given by
where is the temperature of the pV cell and is the temperature of the optical phonon population, as dictated by the Bose–Einstein statistics. This efficiency is reduced the smaller the band gap is in comparison to the thermal energy (, where is the Boltzmann constant and is the temperature). Indeed, the p-n junction efficiency is approximately
Thus, the overall efficiency () is
where the temperature independent terms become the material figure of merit (),
If the band gap and optical phonon mode are resonant, and the optical phonon tends to generate electrons, the phonovoltaic cell can approach the Carnot limit as .
The electron-phonon coupling
The electron-phonon coupling is responsible for electron generation in the pV cell. In this phenomenon, the phonon leads to ion motion which perturbs the highest occupied valence state (HOS). This state begins to overlap with the lowest unoccupied conduction state (LUS), and the electron can switch states if energy and momentum are conserved. If it does, an electron-hole pair is generated.
Using a taylor expansion of the change in electron potential, , due to the ionic displacement of a phonon provides a matrix element for use in Fermi's golden rule, and the derivation of a generation rate. This Taylor expansion gives the following matrix element
where is the average atomic mass, and are the frequency and atomic displacement due to a phonon with polarization and momentum , and is the electron wavefunction for an electron with momentum in band i. From Fermi's golden rule
where is the energy of an electron in band i and momentum , is the corresponding electron occupation, and is the phonon occupancy.
The phonon-phonon coupling
Competing with the generation of electrons is the downconversion of optical phonons into multiple acoustic phonons. The coupling arises from the crystal Hamiltonian (H) expanded in terms of the ionic displacement () from the equilibrium position () of atom i in direction in direction, i.e.,
where is the ground-state Hamiltonian, the linear term vanishes (as the ground state is found by minimizing the energy in terms of the ionic position), and and are the second- and third-order force constants between atoms i, j, and k when moved in along coordinate , , and . The second order term is primarily responsible for the phonon dispersion, while the anharmonic (third order and higher) terms are responsible for thermal expansion as well as the phonon up- (multiple low-energy optical phonons combine to form a high-energy phonon) and downconversion (a high-energy phonon splits into multiple low-energy phonons).
Typically, up- and down-conversion is dominated by the third-order interaction. Thus, the perturbation Hamiltonian used in Fermi's golden rule for phonon up- and downconversion is
where is the direction of displacement for atom i due to the phonon. The resulting downconversion rate, from Fermi's golden rule, is
where two phonons are produced with polarization and and momentum and .
The suitability of graphene as a phonovoltaic material
As outlined above, an efficient pV cell requires a material with an optical phonon mode more energetic than the bandgap, which in turn is much more energetic than the thermal energy at the intended operating temperature . Furthermore, the pV cell requires a material wherein a hot optical phonon prefers to produce an electron rather than multiple low energy acoustic phonons ().
Very few materials offer this combination of properties. Indeed, the vast majority of crystals have optical phonon energies limited to below 50 meV, and those with more energetic optical phonons tend to have much more energetic band gaps. In general, a material with a first-row element (periodic table) is required to have a highly energetic optical phonon. However, the high electronegativity of a first-row elements tends to create a very large band gap, as in diamond and the boron nitride allotropes. Graphene is one of the few materials which diverges from this trend, with no bandgap and an exceptionally energetic optical phonon mode near 200 meV. Thus, graphene has been the initial target for development of a phonovoltaic material through the opening and tuning of its bandgap.
Opening and tuning the bandgap of graphene has received substantial attention, and numerous strategies have been suggested and investigated. These include the use of uniaxial strain, electric fields, and chemical doping and functionalization. In general, these mechanisms work by either changing the symmetry of graphene (both Carbon atoms in the unit cell are identical) or hybridization ().
In the first phonovoltaic material investigations, it has been suggested that the latter technique destroys the electron-phonon coupling while the former preserves it. In particular, these investigations predict that hydrogenating graphene, to produce graphane, reduces the electron-phonon coupling so substantially that the material figure of merit vanishes; and that doping graphene with boron nitride maintains the strong electron-phonon coupling in graphene, such that its figure of merit is predicted to reach 0.65 and enable heat harvesting with twice the efficiency of a typical thermoelectric generator.
See also
Energy transfer
Heat transfer
Energy transformation (Energy conversion)
Thermal physics
Thermal science
Thermal engineering
References
Heat transfer
Thermodynamics
Condensed matter physics
|
```c++
// PropVariantUtils.cpp
#include "StdAfx.h"
#include "../Common/IntToString.h"
#include "PropVariantUtils.h"
using namespace NWindows;
static void AddHex(AString &s, UInt32 v)
{
char sz[16];
sz[0] = '0';
sz[1] = 'x';
ConvertUInt32ToHex(v, sz + 2);
s += sz;
}
AString TypePairToString(const CUInt32PCharPair *pairs, unsigned num, UInt32 value)
{
char sz[16];
const char *p = NULL;
for (unsigned i = 0; i < num; i++)
{
const CUInt32PCharPair &pair = pairs[i];
if (pair.Value == value)
p = pair.Name;
}
if (!p)
{
ConvertUInt32ToString(value, sz);
p = sz;
}
return (AString)p;
}
void PairToProp(const CUInt32PCharPair *pairs, unsigned num, UInt32 value, NCOM::CPropVariant &prop)
{
prop = TypePairToString(pairs, num, value);
}
AString TypeToString(const char * const table[], unsigned num, UInt32 value)
{
char sz[16];
const char *p = NULL;
if (value < num)
p = table[value];
if (!p)
{
ConvertUInt32ToString(value, sz);
p = sz;
}
return (AString)p;
}
void TypeToProp(const char * const table[], unsigned num, UInt32 value, NWindows::NCOM::CPropVariant &prop)
{
char sz[16];
const char *p = NULL;
if (value < num)
p = table[value];
if (!p)
{
ConvertUInt32ToString(value, sz);
p = sz;
}
prop = p;
}
AString FlagsToString(const char * const *names, unsigned num, UInt32 flags)
{
AString s;
for (unsigned i = 0; i < num; i++)
{
UInt32 flag = (UInt32)1 << i;
if ((flags & flag) != 0)
{
const char *name = names[i];
if (name && name[0] != 0)
{
s.Add_OptSpaced(name);
flags &= ~flag;
}
}
}
if (flags != 0)
{
s.Add_Space_if_NotEmpty();
AddHex(s, flags);
}
return s;
}
AString FlagsToString(const CUInt32PCharPair *pairs, unsigned num, UInt32 flags)
{
AString s;
for (unsigned i = 0; i < num; i++)
{
const CUInt32PCharPair &p = pairs[i];
UInt32 flag = (UInt32)1 << (unsigned)p.Value;
if ((flags & flag) != 0)
{
if (p.Name[0] != 0)
s.Add_OptSpaced(p.Name);
}
flags &= ~flag;
}
if (flags != 0)
{
s.Add_Space_if_NotEmpty();
AddHex(s, flags);
}
return s;
}
void FlagsToProp(const char * const *names, unsigned num, UInt32 flags, NCOM::CPropVariant &prop)
{
prop = FlagsToString(names, num, flags);
}
void FlagsToProp(const CUInt32PCharPair *pairs, unsigned num, UInt32 flags, NCOM::CPropVariant &prop)
{
prop = FlagsToString(pairs, num, flags);
}
static AString Flags64ToString(const CUInt32PCharPair *pairs, unsigned num, UInt64 flags)
{
AString s;
for (unsigned i = 0; i < num; i++)
{
const CUInt32PCharPair &p = pairs[i];
UInt64 flag = (UInt64)1 << (unsigned)p.Value;
if ((flags & flag) != 0)
{
if (p.Name[0] != 0)
s.Add_OptSpaced(p.Name);
}
flags &= ~flag;
}
if (flags != 0)
{
{
char sz[32];
sz[0] = '0';
sz[1] = 'x';
ConvertUInt64ToHex(flags, sz + 2);
s.Add_OptSpaced(sz);
}
}
return s;
}
void Flags64ToProp(const CUInt32PCharPair *pairs, unsigned num, UInt64 flags, NCOM::CPropVariant &prop)
{
prop = Flags64ToString(pairs, num, flags);
}
```
|
```javascript
module["exports"] = [
"5###-###-###",
"5##.###.###",
"5## ### ###",
"5########"
];
```
|
Sir Mark Howard Potter PC FKC (born 27 August 1937) is a retired English judge who was President of the Family Division and Head of Family Justice for England and Wales from 2005 to 2010.
Now retired, he remains a Fellow of King's College London.
Education
A son of Professor Harold Potter, an academic lawyer, Potter attended The Perse School, Cambridge, and then read law at Gonville and Caius College, Cambridge. He is now an Honorary Fellow of Caius.
Legal career
Potter was called to the bar in 1961 and practised in commercial law in the chambers of Alan Orr QC then at 2, Crown Office Row, later relocated to become Fountain Court Chambers. He took silk in 1980.
From 1988 to 1996 he was a judge of the High Court of Justice, Queen's Bench Division and from 1991 to 1994 he was a Presiding Judge on the Northern Circuit. Potter was appointed a Lord Justice of Appeal in 1996 and became President of the Family Division in April 2005. Throughout his judicial career, Potter sat on various committees overseeing the direction of the Bar. He was Chairman of the Lord Chancellor's Advisory Committee on Legal Education and Conduct (1998–1999) and Chairman of the Legal Services Consultative Panel.
Potter was elected Treasurer of Gray's Inn for the year 2004/05.
Potter retired as a judge of the Court of Appeal, President of the High Court Family Division and President of the Court of Protection in April 2010. He returned to the field of commercial Law as an arbitrator at Fountain Court chambers, with appointments in areas such as insurance, international share purchase agreements including Bermuda form and energy disputes.
Cases and administration
In July 2006, Potter ruled against Celia Kitzinger and Sue Wilkinson, a lesbian couple who had married in Canada, in their case to have their same-sex partnership recognised as marriage under English law.
Potter held that, in withholding from same-sex partnerships the title and status of marriage, Parliament had not interfered with or failed to recognise the right of same-sex couples to respect for their private or family life; nor had it discriminated against same-sex couples in declining to alter the deep-rooted and almost universal recognition of marriage as a union between a man and woman. He granted permission to appeal; but no appeal was brought.
In 2009, following a government consultation on increasing transparency in the family courts system, Potter presided over the implementation of new rules allowing media access to family proceedings, hitherto private and confidential, subject to certain restrictions.
Life
Potter is a Trustee of Somerset House in London, and also of Great Ormond Street Hospital for children. He is married and has two sons.
References
External links
Do the Media Influence the Judiciary? Policy Brief by Sir Mark Potter for the Foundation for Law, Justice and Society, Oxford
Presidents of the Family Division
Living people
1937 births
People educated at The Perse School
Alumni of Gonville and Caius College, Cambridge
British King's Counsel
Fellows of Gonville and Caius College, Cambridge
Fellows of King's College London
Knights Bachelor
Lords Justices of Appeal
Queen's Bench Division judges
20th-century King's Counsel
Members of Gray's Inn
Members of the Privy Council of the United Kingdom
|
Angel Airlines was a private airline with its base at Băneasa Airport (the capital's second airport), Bucharest, Romania. It operated domestically, to main cities in Romania.
History
Angel Airlines was founded in August 2001, first flying from Bucharest to Baia Mare and Iași. It was founded as a result of Romania's rapid economic development, and the growing domestic and short-haul international airline market. The major goal of Angel Airlines was to connect other cities in Romania and the region with Bucharest, the country's business center, and a major economic center in the Eastern and Central Europe region.
The company declared bankruptcy and closed in 2004.
Services
Angel Airlines used to fly to the following destinations from Bucharest:
Arad
Baia Mare
Constanța
Iași
Oradea
Satu Mare
Sibiu
Suceava
Târgu Mureș
Some flights were under codeshare agreements with TAROM, the national carrier. According to Angel's business practise, Angel had two flights on each route, one in the morning and one in the evening, for maximum efficiency.
In August 2002, the airline adopted a new business strategy that was still focused on efficient timing and routes, but also on international and charter flights. The airline was in agreement with a number of Romanian tour operators to provide charter flights to destinations in Turkey, Albania, Bulgaria, Greece, and Italy. The airline also introduced the following international and domestic flights:
Constanța–Istanbul (two flights per week)
Bucharest–Tirana (two flights per week)
Angel Airlines was also planning to introduce flights on the route Bucharest–Tirana–Bari and Bucharest–Craiova–Rimini.
Fleet
The Angel Airlines fleet consisted of two BAe Jetstream 31 aircraft.
External links
Photos on airliners.net
References
Defunct airlines of Romania
Airlines established in 2001
Airlines disestablished in 2004
Romanian companies established in 2001
|
Haemogogus clarki is an arboreal mosquito native to southern Central America and northern South America. It is deep brown in color with conspicuous patterns of silver scales on the scutum and pleuron. The specific epithet honors Dr. Herbert C. Clark, former Director of the Gorgas Memorial Laboratory.
Bionomics
Haemagogus species breed primarily in treeholes and cut or broken bamboo internodes above ground level, but are often found in bromeliads and fallen fruits and occasionally in ground pools and rockholes in tropical rain forest, open deciduous and second growth forests, and coastal mangrove associations. The native range of Haemagogus clarki includes Costa Rica, Guyana, Honduras, Nicaragua, Panama, and Venezuela.
Medical importance
Adult females have been recorded biting humans during daylight hours,
usually attacking the lower body.
The genus Haemagogus plays a primary role in the transmission of sylvan ("jungle") yellow fever in Central and South America; in laboratory transmission experiments, all species of Haemagogus tested have been found capable of harboring the virus or transmitting it by bite.
References
Insects described in 1952
Aedini
|
```shell
#!/usr/bin/env bash
source /app/vagrant/provision/common.sh
#== Import script args ==
timezone=$(echo "$1")
#== Provision script ==
info "Provision-script user: `whoami`"
export DEBIAN_FRONTEND=noninteractive
info "Configure timezone"
timedatectl set-timezone ${timezone} --no-ask-password
info "Prepare root password for MySQL"
debconf-set-selections <<< "mysql-community-server mysql-community-server/root-pass password \"''\""
debconf-set-selections <<< "mysql-community-server mysql-community-server/re-root-pass password \"''\""
echo "Done!"
info "Update OS software"
apt-get update
apt-get upgrade -y
info "Install additional software"
apt-get install -y php7.0-curl php7.0-cli php7.0-intl php7.0-mysqlnd php7.0-gd php7.0-fpm php7.0-mbstring php7.0-xml unzip nginx mysql-server-5.7 php.xdebug
info "Configure MySQL"
sed -i "s/.*bind-address.*/bind-address = 0.0.0.0/" /etc/mysql/mysql.conf.d/mysqld.cnf
mysql -uroot <<< "CREATE USER 'root'@'%' IDENTIFIED BY ''"
mysql -uroot <<< "GRANT ALL PRIVILEGES ON *.* TO 'root'@'%'"
mysql -uroot <<< "DROP USER 'root'@'localhost'"
mysql -uroot <<< "FLUSH PRIVILEGES"
echo "Done!"
info "Configure PHP-FPM"
sed -i 's/user = www-data/user = vagrant/g' /etc/php/7.0/fpm/pool.d/www.conf
sed -i 's/group = www-data/group = vagrant/g' /etc/php/7.0/fpm/pool.d/www.conf
sed -i 's/owner = www-data/owner = vagrant/g' /etc/php/7.0/fpm/pool.d/www.conf
cat << EOF > /etc/php/7.0/mods-available/xdebug.ini
zend_extension=xdebug.so
xdebug.remote_enable=1
xdebug.remote_connect_back=1
xdebug.remote_port=9000
xdebug.remote_autostart=1
EOF
echo "Done!"
info "Configure NGINX"
sed -i 's/user www-data/user vagrant/g' /etc/nginx/nginx.conf
echo "Done!"
info "Enabling site configuration"
ln -s /app/vagrant/nginx/app.conf /etc/nginx/sites-enabled/app.conf
echo "Done!"
info "Initailize databases for MySQL"
mysql -uroot <<< "CREATE DATABASE yii2advanced"
mysql -uroot <<< "CREATE DATABASE yii2advanced_test"
echo "Done!"
info "Install composer"
curl -sS path_to_url | php -- --install-dir=/usr/local/bin --filename=composer
```
|
```xml
import type {
MixedAndXorOrList,
SQLBooleanValue,
SQLExpression,
SQLNumberValue,
SQLStringValue,
} from './types';
import { evalSQLLiteralValue, generateMixedAndXorOrList, getFieldName } from './utils';
const isNullExpr: SQLExpression = {
type: 'IsNullBooleanPrimary',
value: { type: 'Identifier', value: 'f1' },
hasNot: null,
};
const isNotNullExpr: SQLExpression = {
type: 'IsNullBooleanPrimary',
value: { type: 'Identifier', value: 'f1' },
hasNot: 'NOT',
};
const isNullExpr2: SQLExpression = {
type: 'IsNullBooleanPrimary',
value: { type: 'Identifier', value: 'f2' },
hasNot: null,
};
const isNotNullExpr2: SQLExpression = {
type: 'IsNullBooleanPrimary',
value: { type: 'Identifier', value: 'f2' },
hasNot: 'NOT',
};
it('getFieldName', () => {
expect(getFieldName({ type: 'Identifier', value: 'test' })).toBe('test');
expect(getFieldName('test')).toBe('test');
expect(getFieldName('`test`')).toBe('test');
expect(getFieldName('"test"')).toBe('test');
expect(getFieldName('[test]')).toBe('test');
// Check for double- or triple-unwrapping
expect(getFieldName('`[test]`')).toBe('[test]');
expect(getFieldName('[`test`]')).toBe('`test`');
expect(getFieldName('[`"test"`]')).toBe('`"test"`');
});
it('evalSQLLiteralValue', () => {
const value = 'Test';
const sqlStringValue: SQLStringValue = { type: 'String', value };
const sqlStringValueSQ: SQLStringValue = { type: 'String', value: `'${value}'` };
const sqlStringValueDQ: SQLStringValue = { type: 'String', value: `"${value}"` };
expect(evalSQLLiteralValue(sqlStringValue)).toBe(value);
expect(evalSQLLiteralValue(sqlStringValueSQ)).toBe(value);
expect(evalSQLLiteralValue(sqlStringValueDQ)).toBe(value);
const sqlBooleanValue: SQLBooleanValue = { type: 'Boolean', value: 'TRUE' };
expect(evalSQLLiteralValue(sqlBooleanValue)).toBe(true);
const sqlNumberValue: SQLNumberValue = { type: 'Number', value: '1214' };
expect(evalSQLLiteralValue(sqlNumberValue)).toBe(1214);
});
it('simple AND operator', () => {
const expectation: MixedAndXorOrList = {
combinator: 'and',
expressions: [isNullExpr, isNullExpr],
};
expect(
generateMixedAndXorOrList({
type: 'AndExpression',
operator: 'AND',
left: isNullExpr,
right: isNullExpr,
})
).toEqual(expectation);
});
it('simple XOR operator', () => {
const expectation: MixedAndXorOrList = {
combinator: 'xor',
expressions: [isNullExpr, isNullExpr],
};
expect(
generateMixedAndXorOrList({
type: 'XorExpression',
operator: 'XOR',
left: isNullExpr,
right: isNullExpr,
})
).toEqual(expectation);
});
it('simple OR operator', () => {
const expectation: MixedAndXorOrList = {
combinator: 'or',
expressions: [isNullExpr, isNullExpr],
};
expect(
generateMixedAndXorOrList({
type: 'OrExpression',
operator: 'OR',
left: isNullExpr,
right: isNullExpr,
})
).toEqual(expectation);
});
it('chained AND operators', () => {
const expectation: MixedAndXorOrList = {
combinator: 'and',
expressions: [isNullExpr, isNullExpr, isNullExpr, isNullExpr],
};
expect(
generateMixedAndXorOrList({
type: 'AndExpression',
operator: 'AND',
left: {
type: 'AndExpression',
operator: 'AND',
left: {
type: 'AndExpression',
operator: 'AND',
left: isNullExpr,
right: isNullExpr,
},
right: isNullExpr,
},
right: isNullExpr,
})
).toEqual(expectation);
});
it('chained XOR operators', () => {
const expectation: MixedAndXorOrList = {
combinator: 'xor',
expressions: [isNullExpr, isNullExpr, isNullExpr, isNullExpr],
};
expect(
generateMixedAndXorOrList({
type: 'XorExpression',
operator: 'XOR',
left: {
type: 'XorExpression',
operator: 'XOR',
left: {
type: 'XorExpression',
operator: 'XOR',
left: isNullExpr,
right: isNullExpr,
},
right: isNullExpr,
},
right: isNullExpr,
})
).toEqual(expectation);
});
it('chained OR operators', () => {
const expectation: MixedAndXorOrList = {
combinator: 'or',
expressions: [isNullExpr, isNullExpr, isNullExpr, isNullExpr],
};
expect(
generateMixedAndXorOrList({
type: 'OrExpression',
operator: 'OR',
left: {
type: 'OrExpression',
operator: 'OR',
left: {
type: 'OrExpression',
operator: 'OR',
left: isNullExpr,
right: isNullExpr,
},
right: isNullExpr,
},
right: isNullExpr,
})
).toEqual(expectation);
});
describe('complex AND/XOR/OR chains', () => {
it('a AND b OR c', () => {
const expectation: MixedAndXorOrList = {
combinator: 'or',
expressions: [{ combinator: 'and', expressions: [isNullExpr, isNullExpr] }, isNotNullExpr],
};
const testResult = generateMixedAndXorOrList({
type: 'OrExpression',
operator: 'OR',
left: {
type: 'AndExpression',
operator: 'AND',
left: isNullExpr,
right: isNullExpr,
},
right: isNotNullExpr,
});
expect(testResult).toEqual(expectation);
});
it('a OR b AND c', () => {
const expectation: MixedAndXorOrList = {
combinator: 'or',
expressions: [isNotNullExpr, { combinator: 'and', expressions: [isNullExpr, isNotNullExpr] }],
};
const testResult = generateMixedAndXorOrList({
type: 'AndExpression',
operator: 'AND',
left: {
type: 'OrExpression',
operator: 'OR',
left: isNotNullExpr,
right: isNullExpr,
},
right: isNotNullExpr,
});
expect(testResult).toEqual(expectation);
});
it('a AND b XOR c OR d', () => {
const expectation: MixedAndXorOrList = {
combinator: 'or',
expressions: [
{
combinator: 'xor',
expressions: [
{ combinator: 'and', expressions: [isNullExpr, isNotNullExpr] },
isNullExpr,
],
},
isNotNullExpr,
],
};
expect(
generateMixedAndXorOrList({
type: 'OrExpression',
operator: 'OR',
left: {
type: 'XorExpression',
operator: 'XOR',
left: {
type: 'AndExpression',
operator: 'AND',
left: isNullExpr,
right: isNotNullExpr,
},
right: isNullExpr,
},
right: isNotNullExpr,
})
).toEqual(expectation);
});
it('a OR b XOR c AND d', () => {
const expectation: MixedAndXorOrList = {
combinator: 'or',
expressions: [
isNotNullExpr,
{
combinator: 'xor',
expressions: [
isNullExpr,
{ combinator: 'and', expressions: [isNotNullExpr, isNullExpr] },
],
},
],
};
expect(
generateMixedAndXorOrList({
type: 'AndExpression',
operator: 'AND',
left: {
type: 'XorExpression',
operator: 'XOR',
left: {
type: 'OrExpression',
operator: 'OR',
left: isNotNullExpr,
right: isNullExpr,
},
right: isNotNullExpr,
},
right: isNullExpr,
})
).toEqual(expectation);
});
it('a AND b OR c XOR d', () => {
const expectation: MixedAndXorOrList = {
combinator: 'or',
expressions: [
{ combinator: 'and', expressions: [isNullExpr, isNotNullExpr] },
{
combinator: 'xor',
expressions: [isNullExpr2, isNotNullExpr2],
},
],
};
const testResult = generateMixedAndXorOrList({
type: 'XorExpression',
operator: 'XOR',
left: {
type: 'OrExpression',
operator: 'OR',
left: {
type: 'AndExpression',
operator: 'AND',
left: isNullExpr,
right: isNotNullExpr,
},
right: isNullExpr2,
},
right: isNotNullExpr2,
});
expect(testResult).toEqual(expectation);
});
it('a AND b OR c OR d', () => {
const expectation: MixedAndXorOrList = {
combinator: 'or',
expressions: [
{ combinator: 'and', expressions: [isNullExpr, isNotNullExpr] },
isNullExpr2,
isNotNullExpr2,
],
};
const testResult = generateMixedAndXorOrList({
type: 'OrExpression',
operator: 'OR',
left: {
type: 'OrExpression',
operator: 'OR',
left: {
type: 'AndExpression',
operator: 'AND',
left: isNullExpr,
right: isNotNullExpr,
},
right: isNullExpr2,
},
right: isNotNullExpr2,
});
expect(testResult).toEqual(expectation);
});
it('a AND b XOR c XOR d', () => {
const expectation: MixedAndXorOrList = {
combinator: 'xor',
expressions: [
{ combinator: 'and', expressions: [isNullExpr, isNotNullExpr] },
isNullExpr2,
isNotNullExpr2,
],
};
const testResult = generateMixedAndXorOrList({
type: 'XorExpression',
operator: 'XOR',
left: {
type: 'XorExpression',
operator: 'XOR',
left: {
type: 'AndExpression',
operator: 'AND',
left: isNullExpr,
right: isNotNullExpr,
},
right: isNullExpr2,
},
right: isNotNullExpr2,
});
expect(testResult).toEqual(expectation);
});
it('a AND b OR c AND d', () => {
const expectation: MixedAndXorOrList = {
combinator: 'or',
expressions: [
{ combinator: 'and', expressions: [isNullExpr, isNotNullExpr] },
{ combinator: 'and', expressions: [isNullExpr2, isNotNullExpr2] },
],
};
const testResult = generateMixedAndXorOrList({
type: 'AndExpression',
operator: 'AND',
left: {
type: 'OrExpression',
operator: 'OR',
left: {
type: 'AndExpression',
operator: 'AND',
left: isNullExpr,
right: isNotNullExpr,
},
right: isNullExpr2,
},
right: isNotNullExpr2,
});
expect(testResult).toEqual(expectation);
});
});
```
|
```c++
// This source code is licensed under both the GPLv2 (found in the
// (found in the LICENSE.Apache file in the root directory).
//
#ifndef ROCKSDB_LITE
#include "memtable/hash_skiplist_rep.h"
#include <atomic>
#include "rocksdb/memtablerep.h"
#include "util/arena.h"
#include "rocksdb/slice.h"
#include "rocksdb/slice_transform.h"
#include "port/port.h"
#include "util/murmurhash.h"
#include "db/memtable.h"
#include "memtable/skiplist.h"
namespace rocksdb {
namespace {
class HashSkipListRep : public MemTableRep {
public:
HashSkipListRep(const MemTableRep::KeyComparator& compare,
Allocator* allocator, const SliceTransform* transform,
size_t bucket_size, int32_t skiplist_height,
int32_t skiplist_branching_factor);
void Insert(KeyHandle handle) override;
bool Contains(const char* key) const override;
size_t ApproximateMemoryUsage() override;
void Get(const LookupKey& k, void* callback_args,
bool (*callback_func)(void* arg, const char* entry)) override;
~HashSkipListRep() override;
MemTableRep::Iterator* GetIterator(Arena* arena = nullptr) override;
MemTableRep::Iterator* GetDynamicPrefixIterator(
Arena* arena = nullptr) override;
private:
friend class DynamicIterator;
typedef SkipList<const char*, const MemTableRep::KeyComparator&> Bucket;
size_t bucket_size_;
const int32_t skiplist_height_;
const int32_t skiplist_branching_factor_;
// Maps slices (which are transformed user keys) to buckets of keys sharing
// the same transform.
std::atomic<Bucket*>* buckets_;
// The user-supplied transform whose domain is the user keys.
const SliceTransform* transform_;
const MemTableRep::KeyComparator& compare_;
// immutable after construction
Allocator* const allocator_;
inline size_t GetHash(const Slice& slice) const {
return MurmurHash(slice.data(), static_cast<int>(slice.size()), 0) %
bucket_size_;
}
inline Bucket* GetBucket(size_t i) const {
return buckets_[i].load(std::memory_order_acquire);
}
inline Bucket* GetBucket(const Slice& slice) const {
return GetBucket(GetHash(slice));
}
// Get a bucket from buckets_. If the bucket hasn't been initialized yet,
// initialize it before returning.
Bucket* GetInitializedBucket(const Slice& transformed);
class Iterator : public MemTableRep::Iterator {
public:
explicit Iterator(Bucket* list, bool own_list = true,
Arena* arena = nullptr)
: list_(list), iter_(list), own_list_(own_list), arena_(arena) {}
~Iterator() override {
// if we own the list, we should also delete it
if (own_list_) {
assert(list_ != nullptr);
delete list_;
}
}
// Returns true iff the iterator is positioned at a valid node.
bool Valid() const override { return list_ != nullptr && iter_.Valid(); }
// Returns the key at the current position.
// REQUIRES: Valid()
const char* key() const override {
assert(Valid());
return iter_.key();
}
// Advances to the next position.
// REQUIRES: Valid()
void Next() override {
assert(Valid());
iter_.Next();
}
// Advances to the previous position.
// REQUIRES: Valid()
void Prev() override {
assert(Valid());
iter_.Prev();
}
// Advance to the first entry with a key >= target
void Seek(const Slice& internal_key, const char* memtable_key) override {
if (list_ != nullptr) {
const char* encoded_key =
(memtable_key != nullptr) ?
memtable_key : EncodeKey(&tmp_, internal_key);
iter_.Seek(encoded_key);
}
}
// Retreat to the last entry with a key <= target
void SeekForPrev(const Slice& /*internal_key*/,
const char* /*memtable_key*/) override {
// not supported
assert(false);
}
// Position at the first entry in collection.
// Final state of iterator is Valid() iff collection is not empty.
void SeekToFirst() override {
if (list_ != nullptr) {
iter_.SeekToFirst();
}
}
// Position at the last entry in collection.
// Final state of iterator is Valid() iff collection is not empty.
void SeekToLast() override {
if (list_ != nullptr) {
iter_.SeekToLast();
}
}
protected:
void Reset(Bucket* list) {
if (own_list_) {
assert(list_ != nullptr);
delete list_;
}
list_ = list;
iter_.SetList(list);
own_list_ = false;
}
private:
// if list_ is nullptr, we should NEVER call any methods on iter_
// if list_ is nullptr, this Iterator is not Valid()
Bucket* list_;
Bucket::Iterator iter_;
// here we track if we own list_. If we own it, we are also
// responsible for it's cleaning. This is a poor man's std::shared_ptr
bool own_list_;
std::unique_ptr<Arena> arena_;
std::string tmp_; // For passing to EncodeKey
};
class DynamicIterator : public HashSkipListRep::Iterator {
public:
explicit DynamicIterator(const HashSkipListRep& memtable_rep)
: HashSkipListRep::Iterator(nullptr, false),
memtable_rep_(memtable_rep) {}
// Advance to the first entry with a key >= target
void Seek(const Slice& k, const char* memtable_key) override {
auto transformed = memtable_rep_.transform_->Transform(ExtractUserKey(k));
Reset(memtable_rep_.GetBucket(transformed));
HashSkipListRep::Iterator::Seek(k, memtable_key);
}
// Position at the first entry in collection.
// Final state of iterator is Valid() iff collection is not empty.
void SeekToFirst() override {
// Prefix iterator does not support total order.
// We simply set the iterator to invalid state
Reset(nullptr);
}
// Position at the last entry in collection.
// Final state of iterator is Valid() iff collection is not empty.
void SeekToLast() override {
// Prefix iterator does not support total order.
// We simply set the iterator to invalid state
Reset(nullptr);
}
private:
// the underlying memtable
const HashSkipListRep& memtable_rep_;
};
class EmptyIterator : public MemTableRep::Iterator {
// This is used when there wasn't a bucket. It is cheaper than
// instantiating an empty bucket over which to iterate.
public:
EmptyIterator() { }
bool Valid() const override { return false; }
const char* key() const override {
assert(false);
return nullptr;
}
void Next() override {}
void Prev() override {}
void Seek(const Slice& /*internal_key*/,
const char* /*memtable_key*/) override {}
void SeekForPrev(const Slice& /*internal_key*/,
const char* /*memtable_key*/) override {}
void SeekToFirst() override {}
void SeekToLast() override {}
private:
};
};
HashSkipListRep::HashSkipListRep(const MemTableRep::KeyComparator& compare,
Allocator* allocator,
const SliceTransform* transform,
size_t bucket_size, int32_t skiplist_height,
int32_t skiplist_branching_factor)
: MemTableRep(allocator),
bucket_size_(bucket_size),
skiplist_height_(skiplist_height),
skiplist_branching_factor_(skiplist_branching_factor),
transform_(transform),
compare_(compare),
allocator_(allocator) {
auto mem = allocator->AllocateAligned(
sizeof(std::atomic<void*>) * bucket_size);
buckets_ = new (mem) std::atomic<Bucket*>[bucket_size];
for (size_t i = 0; i < bucket_size_; ++i) {
buckets_[i].store(nullptr, std::memory_order_relaxed);
}
}
HashSkipListRep::~HashSkipListRep() {
}
HashSkipListRep::Bucket* HashSkipListRep::GetInitializedBucket(
const Slice& transformed) {
size_t hash = GetHash(transformed);
auto bucket = GetBucket(hash);
if (bucket == nullptr) {
auto addr = allocator_->AllocateAligned(sizeof(Bucket));
bucket = new (addr) Bucket(compare_, allocator_, skiplist_height_,
skiplist_branching_factor_);
buckets_[hash].store(bucket, std::memory_order_release);
}
return bucket;
}
void HashSkipListRep::Insert(KeyHandle handle) {
auto* key = static_cast<char*>(handle);
assert(!Contains(key));
auto transformed = transform_->Transform(UserKey(key));
auto bucket = GetInitializedBucket(transformed);
bucket->Insert(key);
}
bool HashSkipListRep::Contains(const char* key) const {
auto transformed = transform_->Transform(UserKey(key));
auto bucket = GetBucket(transformed);
if (bucket == nullptr) {
return false;
}
return bucket->Contains(key);
}
size_t HashSkipListRep::ApproximateMemoryUsage() {
return 0;
}
void HashSkipListRep::Get(const LookupKey& k, void* callback_args,
bool (*callback_func)(void* arg, const char* entry)) {
auto transformed = transform_->Transform(k.user_key());
auto bucket = GetBucket(transformed);
if (bucket != nullptr) {
Bucket::Iterator iter(bucket);
for (iter.Seek(k.memtable_key().data());
iter.Valid() && callback_func(callback_args, iter.key());
iter.Next()) {
}
}
}
MemTableRep::Iterator* HashSkipListRep::GetIterator(Arena* arena) {
// allocate a new arena of similar size to the one currently in use
Arena* new_arena = new Arena(allocator_->BlockSize());
auto list = new Bucket(compare_, new_arena);
for (size_t i = 0; i < bucket_size_; ++i) {
auto bucket = GetBucket(i);
if (bucket != nullptr) {
Bucket::Iterator itr(bucket);
for (itr.SeekToFirst(); itr.Valid(); itr.Next()) {
list->Insert(itr.key());
}
}
}
if (arena == nullptr) {
return new Iterator(list, true, new_arena);
} else {
auto mem = arena->AllocateAligned(sizeof(Iterator));
return new (mem) Iterator(list, true, new_arena);
}
}
MemTableRep::Iterator* HashSkipListRep::GetDynamicPrefixIterator(Arena* arena) {
if (arena == nullptr) {
return new DynamicIterator(*this);
} else {
auto mem = arena->AllocateAligned(sizeof(DynamicIterator));
return new (mem) DynamicIterator(*this);
}
}
} // anon namespace
MemTableRep* HashSkipListRepFactory::CreateMemTableRep(
const MemTableRep::KeyComparator& compare, Allocator* allocator,
const SliceTransform* transform, Logger* /*logger*/) {
return new HashSkipListRep(compare, allocator, transform, bucket_count_,
skiplist_height_, skiplist_branching_factor_);
}
MemTableRepFactory* NewHashSkipListRepFactory(
size_t bucket_count, int32_t skiplist_height,
int32_t skiplist_branching_factor) {
return new HashSkipListRepFactory(bucket_count, skiplist_height,
skiplist_branching_factor);
}
} // namespace rocksdb
#endif // ROCKSDB_LITE
```
|
```javascript
/**
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
'use strict';
// MODULES //
var bench = require( '@stdlib/bench' );
var pkg = require( './../package.json' ).name;
var Int32Array = require( './../lib' );
// MAIN //
bench( pkg+':forEach', function benchmark( b ) {
var count;
var arr;
var N;
var i;
arr = new Int32Array( 2 );
N = arr.length;
count = 0;
b.tic();
for ( i = 0; i < b.iterations; i++ ) {
arr.forEach( fcn );
if ( count !== N*(i+1) ) {
b.fail( 'unexpected result' );
}
}
b.toc();
if ( count !== N*i ) {
b.fail( 'unexpected result' );
}
b.pass( 'benchmark finished' );
b.end();
function fcn() {
count += 1;
}
});
bench( pkg+'::this_context:forEach', function benchmark( b ) {
var count;
var arr;
var N;
var i;
arr = new Int32Array( 2 );
N = arr.length;
count = 0;
b.tic();
for ( i = 0; i < b.iterations; i++ ) {
arr.forEach( fcn, {} );
if ( count !== N*(i+1) ) {
b.fail( 'unexpected result' );
}
}
b.toc();
if ( count !== N*i ) {
b.fail( 'unexpected result' );
}
b.pass( 'benchmark finished' );
b.end();
function fcn() {
count += 1;
}
});
```
|
Uppsala Kurd FK is a Swedish football club located in Uppsala.
External links
Profile at Uppsala
Profile at Svenskalag
Footnotes
Football clubs in Uppsala County
Association football clubs established in 1947
1947 establishments in Sweden
Sport in Uppsala
|
Tongrinne () is a village of Wallonia and a district of the municipality of Sombreffe, located in the province of Namur, Belgium.
Previously its own municipality, a 1977 fusion of the Belgian municipalities made it an ancienne commune of Sombreffe. Tongrinne is on the banks of the river Ligny.
History
The village and the heights of Tongrene were the location for the left wing of Blücher's Prussian Army during the Battle of Ligny, on 16 June 1815. While the Prussians had held Tongrene, their main force was defeated at Ligny (Napoleon's last ever victory), while the forces of Wellington and Marshal Ney were engaging each other at the Battle of Quatre Bras. Because of the defeat at Ligny, the Prussians were forced to give up Tongrene during the night of the 16/17 June. Two days later, the combined forces of both opponents met at the Battle of Waterloo.
References
External links
Former municipalities of Namur (province)
Battle of Ligny locations
|
This is the discography of acid jazz and funk group the Brand New Heavies.
Albums
Studio albums
Live albums
Compilation albums
Remix albums
Singles
Songs featured on soundtracks
1992: "People Get Ready (Remix)" in Juice
1994: "Close to You" in Prêt-à-Porter
1994: "Higher Learning/Time for Change" in Higher Learning
1996: "World Keeps Spinning" in The Truth About Cats & Dogs
1997: "I Like It" in Love Jones
1998: "More Love" in Sliding Doors
1999: “Midnight at the Oasis” in American Pie
2006: "Jump n' Move" in Happy Feet
Notes
References
Jazz discographies
Funk music discographies
Discographies of British artists
|
```javascript
console.log('included');
```
|
```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 random
import unittest
import numpy as np
from hybrid_parallel_mp_model import (
SimpleDPNet,
SimpleMPNet,
TestDistMPTraining,
parallel_matmul,
set_random_seed,
)
import paddle
import paddle.distributed as dist
from paddle.distributed import fleet
vocab_size = 20
hidden_size = 10
inner_size = 8
output_size = 10
seq_length = 2
batch_size = 4
class SimpleMPMultimodalNet(SimpleMPNet):
def forward(self, x, **kwargs):
x = paddle.to_tensor(x)
x = self.embedding(x)
x = self.linear1(x)
x = self.linear2(x)
x = self.linear3(x)
x = parallel_matmul(x, self.embedding.weight, False)
return x
class SimpleDPMultimodalNet(SimpleDPNet):
def forward(self, x, **kwargs):
x = paddle.to_tensor(x)
x = self.embedding(x)
x = self.linear1(x)
x = self.linear2(x)
x = self.linear3(x)
x = paddle.matmul(x, self.embedding.weight, transpose_y=True)
return x
class TestMPBroadcastObj(TestDistMPTraining):
def build_model_optimizer(self):
hcg = fleet.get_hybrid_communicate_group()
word_size = hcg.get_model_parallel_world_size()
mp_id = hcg.get_model_parallel_rank()
dp_id = hcg.get_data_parallel_rank()
rank_id = dist.get_rank()
set_random_seed(1024, dp_id, rank_id)
np_fc1 = np.random.random_sample((hidden_size, inner_size))
np_fc2 = np.random.random_sample((inner_size, hidden_size))
model_a = SimpleMPMultimodalNet(
vocab_size,
hidden_size,
inner_size,
output_size,
np_fc1,
np_fc2,
mp_id,
)
optimizer_a = self.build_optimizer(model_a)
model_a = fleet.distributed_model(model_a)
optimizer_a = fleet.distributed_optimizer(optimizer_a)
model_b = SimpleDPMultimodalNet(
vocab_size, hidden_size, inner_size, output_size, np_fc1, np_fc2
)
optimizer_b = self.build_optimizer(model_b)
return model_a, optimizer_a, model_b, optimizer_b
def train_batch(self, batch, model, optimizer, is_mp):
img, text = batch
output = model(img, text=text)
loss = output.mean()
loss.backward() # do backward
optimizer.step() # update parameters
optimizer.clear_grad()
return loss
def test_mp_model(self):
(
model_a,
optimizer_a,
model_b,
optimizer_b,
) = self.build_model_optimizer()
for _ in range(5):
img = np.random.randint(
0,
vocab_size,
(
batch_size,
seq_length,
),
)
text = [
random.sample('zyxwvutsrqponmlkjihgfedcba', 5)
for i in range(batch_size)
]
batch = (img, text)
loss_a = self.train_batch(batch, model_a, optimizer_a, True)
loss_b = self.train_batch(batch, model_b, optimizer_b, False)
np.testing.assert_allclose(
loss_a.numpy(), loss_b.numpy(), rtol=1e-6
)
if __name__ == "__main__":
unittest.main()
```
|
Mimoclystia is a genus of moths in the family Geometridae described by Warren in 1901.
Type species: Mimoclystia undulosata Warren, 1901
Species
Some species of this genus are:
Mimoclystia acme (Prout, 1922)
Mimoclystia andringitra Herbulot, 1963
Mimoclystia bambusarum Herbulot, 1988
Mimoclystia bergeri (Gaede, 1915)
Mimoclystia cancellata (Warren, 1899)
Mimoclystia corticearia (Aurivillius, 1910)
Mimoclystia deplanata (de Joannis, 1913)
Mimoclystia dimorpha Herbulot, 1966
Mimoclystia eucesta D. S. Fletcher, 1958
Mimoclystia euthygramma (Prout, 1921)
Mimoclystia explanata (Walker, 1862)
Mimoclystia griveaudi Herbulot, 1970
Mimoclystia lichenarum Herbulot, 1963
Mimoclystia limonias (Prout, 1933)
Mimoclystia mermera (Prout, 1935)
Mimoclystia mimetica (Debauche, 1938)
Mimoclystia pudicata (Walker, 1862)
Mimoclystia rhodopnoa (Prout, 1928)
Mimoclystia tepescens Prout, 1922
Mimoclystia thermochroa (Hampson, 1909)
Mimoclystia thorenaria (Swinhoe, 1904)
Mimoclystia toxeres D. S. Fletcher, 1978
Mimoclystia undulosata Warren, 1901
References
Geometridae
|
Eupithecia hashimotoi is a moth in the family Geometridae. It is found in Taiwan.
References
Moths described in 1988
hashimotoi
Moths of Asia
|
```xml
/*
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
// TypeScript Version: 4.1
/**
* Returns the standard deviation for a Gumbel distribution with location `mu` and scale `beta`.
*
* ## Notes
*
* - If provided `beta <= 0`, the function returns `NaN`.
*
* @param mu - location parameter
* @param beta - scale parameter
* @returns standard deviation
*
* @example
* var y = stdev( 0.0, 1.0 );
* // returns ~1.283
*
* @example
* var y = stdev( 5.0, 2.0 );
* // returns ~2.565
*
* @example
* var y = stdev( NaN, 1.0 );
* // returns NaN
*
* @example
* var y = stdev( 0.0, NaN );
* // returns NaN
*
* @example
* var y = stdev( 0.0, 0.0 );
* // returns NaN
*/
declare function stdev( mu: number, beta: number ): number;
// EXPORTS //
export = stdev;
```
|
Neil William Davey (2 February 1921 – 5 July 2019) was an Australian public servant who oversaw Australia's transition from pounds, shillings and pence to decimal currency. He has been referred to in the media as Australia's "Mr. Decimal".
Early life, education, and military service
Neil William Davey was born in Wangaratta, Victoria, Australia, on 2 February 1921. He left school when he was 14, and went to work as a telegraph messenger. In 1938 he became a telegraphist at the Melbourne Central Telegraph Office.
During the Second World War he enlisted in the Australian Army at Prahran, Victoria, on 27 May 1941. He transferred to the Second Australian Imperial Force on 22 August 1942, and was allotted the service number VX106930. He served with Southern Command Signals, III Corps Signals, and the 8th Telegraph Operating Section. It was with this last unit that he embarked from Brisbane for overseas service on 13 November 1944. He served at Hollandia, and on Morotai, and was promoted to corporal on 17 January 1945. He returned to Australia on 9 April 1946, and was discharged from the Army on 16 April. For his service, he was awarded the 1939–1945 Star, the Pacific Star, the War Medal and the Australia Service Medal.
Davey married Maria Vrachnas on 8 December 1948. The wedding ceremony was conducted in Greek Orthodox tradition, and both would later recall that "they did not understand a word of it". They had two sons together, Nicholas and Stephen. He enrolled in night school at the University of Melbourne, from which he graduated in 1950 with a Bachelor of Commerce (equal 1st class Honours). He completed his Doctor of Philosophy in the Faculty of Economics at the London School of Economics in 1957 under the supervision of Richard Sidney Sayers. His field of study was the history of monetary thought and his PhD dissertation was titled The Decimal Coinage Controversy in England.
Decimal currency work
In an Australian Financial Review article dated 12 February 2016, "How a New Currency Reflected the Confidence of a Nation", Selwyn Cornish, official historian of the Reserve Bank of Australia and honorary associate professor in the Research School of Economics at the Australian National University, stated "Davey was responsible for two critical decisions. Against the advice of some of his superiors in the Treasury, who argued in favour of basing the new currency on the pound (20 shillings), Davey took a contrary view, arguing that 10 shillings be used as the base. With 12 pence to the shilling, and using 10 shillings as the base for the new currency, one cent would be equivalent to 1.2 pence. In contrast, using the pound as the base, a cent would be worth 2.4 pence. Davey regarded this to be too high. It would give rise to higher prices and would probably require the circulation of a half-cent coin. As with the naming of the new currency, common sense prevailed. Davey was also successful in arguing that owners of cash registers and other accounting machines should be subsidised for the cost of converting their machines to the decimal system. This, too, assisted the smooth transfer to the new currency.
On 2 May 1969, Sir Walter D. Scott wrote to Treasurer William McMahon:
In October 2015, Terry Larkin (Principal Private Secretary to the Treasurer Harold Holt 1960 and 1962) stated: "Neil’s superior intellectual and managerial gifts applied to public service at the highest level of government give Neil a lasting place in the economic history of Australia – most notably in the 'nation building' event of Australia’s change to its own, unique decimal currency in February 1966 – and before and afterwards in the direction and expansion of Australia’s overseas economic and financial relations, especially in Asia." On 10 August 2015, the Director General of the National Archives of Australia, David Fricker, referred to Davey's thesis as the "foundation document" upon which the national change to decimal currency was based.
Davey served as Minister (Financial) at the Australian High Commission in London from 1974 to 1979. He then became the Australian Director on the Board of the Asian Development Bank, based in Manila in the Philippines.
Later years and death
Davey retired in February 1984, and was appointed chairman of the Asian Development Fund Committee, a post he held for four years. He was made an Officer of the Order of Australia in the 2016 Queen's Birthday Honours.
Davey died at Calvary Hospital, Canberra, on 5 July 2019. His wife, Maria, had died five days earlier.
References
1921 births
2019 deaths
Australian public servants
Officers of the Order of Australia
People from Wangaratta
University of Melbourne alumni
Alumni of the London School of Economics
Australian Army personnel of World War II
Australian Army soldiers
|
```javascript
import ExpoSQLite from './ExpoSQLiteNext';
import { SQLiteStatement, } from './SQLiteStatement';
/**
* A SQLite database.
*/
export class SQLiteDatabase {
databaseName;
options;
nativeDatabase;
constructor(databaseName, options, nativeDatabase) {
this.databaseName = databaseName;
this.options = options;
this.nativeDatabase = nativeDatabase;
}
/**
* Asynchronous call to return whether the database is currently in a transaction.
*/
isInTransactionAsync() {
return this.nativeDatabase.isInTransactionAsync();
}
/**
* Close the database.
*/
closeAsync() {
return this.nativeDatabase.closeAsync();
}
/**
* Execute all SQL queries in the supplied string.
* > Note: The queries are not escaped for you! Be careful when constructing your queries.
*
* @param source A string containing all the SQL queries.
*/
execAsync(source) {
return this.nativeDatabase.execAsync(source);
}
/**
* [Serialize the database](path_to_url as `Uint8Array`.
*
* @param databaseName The name of the current attached databases. The default value is `main` which is the default database name.
*/
serializeAsync(databaseName = 'main') {
return this.nativeDatabase.serializeAsync(databaseName);
}
/**
* Create a [prepared SQLite statement](path_to_url
*
* @param source A string containing the SQL query.
*/
async prepareAsync(source) {
const nativeStatement = new ExpoSQLite.NativeStatement();
await this.nativeDatabase.prepareAsync(nativeStatement, source);
return new SQLiteStatement(this.nativeDatabase, nativeStatement);
}
/**
* Execute a transaction and automatically commit/rollback based on the `task` result.
*
* > **Note:** This transaction is not exclusive and can be interrupted by other async queries.
* @example
* ```ts
* db.withTransactionAsync(async () => {
* await db.execAsync('UPDATE test SET name = "aaa"');
*
* //
* // We cannot control the order of async/await order, so order of execution is not guaranteed.
* // The following UPDATE query out of transaction may be executed here and break the expectation.
* //
*
* const result = await db.getFirstAsync<{ name: string }>('SELECT name FROM Users');
* expect(result?.name).toBe('aaa');
* });
* db.execAsync('UPDATE test SET name = "bbb"');
* ```
* If you worry about the order of execution, use `withExclusiveTransactionAsync` instead.
*
* @param task An async function to execute within a transaction.
*/
async withTransactionAsync(task) {
try {
await this.execAsync('BEGIN');
await task();
await this.execAsync('COMMIT');
}
catch (e) {
await this.execAsync('ROLLBACK');
throw e;
}
}
/**
* Execute a transaction and automatically commit/rollback based on the `task` result.
*
* The transaction may be exclusive.
* As long as the transaction is converted into a write transaction,
* the other async write queries will abort with `database is locked` error.
*
* @param task An async function to execute within a transaction. Any queries inside the transaction must be executed on the `txn` object.
* The `txn` object has the same interfaces as the [`SQLiteDatabase`](#sqlitedatabase) object. You can use `txn` like a [`SQLiteDatabase`](#sqlitedatabase) object.
*
* @example
* ```ts
* db.withExclusiveTransactionAsync(async (txn) => {
* await txn.execAsync('UPDATE test SET name = "aaa"');
* });
* ```
*/
async withExclusiveTransactionAsync(task) {
const transaction = await Transaction.createAsync(this);
let error;
try {
await transaction.execAsync('BEGIN');
await task(transaction);
await transaction.execAsync('COMMIT');
}
catch (e) {
await transaction.execAsync('ROLLBACK');
error = e;
}
finally {
await transaction.closeAsync();
}
if (error) {
throw error;
}
}
/**
* Synchronous call to return whether the database is currently in a transaction.
*/
isInTransactionSync() {
return this.nativeDatabase.isInTransactionSync();
}
/**
* Close the database.
*/
closeSync() {
return this.nativeDatabase.closeSync();
}
/**
* Execute all SQL queries in the supplied string.
*
* > **Note:** The queries are not escaped for you! Be careful when constructing your queries.
*
* > **Note:** Running heavy tasks with this function can block the JavaScript thread and affect performance.
*
* @param source A string containing all the SQL queries.
*/
execSync(source) {
return this.nativeDatabase.execSync(source);
}
/**
* [Serialize the database](path_to_url as `Uint8Array`.
*
* > **Note:** Running heavy tasks with this function can block the JavaScript thread and affect performance.
*
* @param databaseName The name of the current attached databases. The default value is `main` which is the default database name.
*/
serializeSync(databaseName = 'main') {
return this.nativeDatabase.serializeSync(databaseName);
}
/**
* Create a [prepared SQLite statement](path_to_url
*
* > **Note:** Running heavy tasks with this function can block the JavaScript thread and affect performance.
*
* @param source A string containing the SQL query.
*/
prepareSync(source) {
const nativeStatement = new ExpoSQLite.NativeStatement();
this.nativeDatabase.prepareSync(nativeStatement, source);
return new SQLiteStatement(this.nativeDatabase, nativeStatement);
}
/**
* Execute a transaction and automatically commit/rollback based on the `task` result.
*
* > **Note:** Running heavy tasks with this function can block the JavaScript thread and affect performance.
*
* @param task An async function to execute within a transaction.
*/
withTransactionSync(task) {
try {
this.execSync('BEGIN');
task();
this.execSync('COMMIT');
}
catch (e) {
this.execSync('ROLLBACK');
throw e;
}
}
async runAsync(source, ...params) {
const statement = await this.prepareAsync(source);
let result;
try {
result = await statement.executeAsync(...params);
}
finally {
await statement.finalizeAsync();
}
return result;
}
async getFirstAsync(source, ...params) {
const statement = await this.prepareAsync(source);
let firstRow;
try {
const result = await statement.executeAsync(...params);
firstRow = await result.getFirstAsync();
}
finally {
await statement.finalizeAsync();
}
return firstRow;
}
async *getEachAsync(source, ...params) {
const statement = await this.prepareAsync(source);
try {
const result = await statement.executeAsync(...params);
for await (const row of result) {
yield row;
}
}
finally {
await statement.finalizeAsync();
}
}
async getAllAsync(source, ...params) {
const statement = await this.prepareAsync(source);
let allRows;
try {
const result = await statement.executeAsync(...params);
allRows = await result.getAllAsync();
}
finally {
await statement.finalizeAsync();
}
return allRows;
}
runSync(source, ...params) {
const statement = this.prepareSync(source);
let result;
try {
result = statement.executeSync(...params);
}
finally {
statement.finalizeSync();
}
return result;
}
getFirstSync(source, ...params) {
const statement = this.prepareSync(source);
let firstRow;
try {
const result = statement.executeSync(...params);
firstRow = result.getFirstSync();
}
finally {
statement.finalizeSync();
}
return firstRow;
}
*getEachSync(source, ...params) {
const statement = this.prepareSync(source);
try {
const result = statement.executeSync(...params);
for (const row of result) {
yield row;
}
}
finally {
statement.finalizeSync();
}
}
getAllSync(source, ...params) {
const statement = this.prepareSync(source);
let allRows;
try {
const result = statement.executeSync(...params);
allRows = result.getAllSync();
}
finally {
statement.finalizeSync();
}
return allRows;
}
}
/**
* Open a database.
*
* @param databaseName The name of the database file to open.
* @param options Open options.
*/
export async function openDatabaseAsync(databaseName, options) {
const openOptions = options ?? {};
const nativeDatabase = new ExpoSQLite.NativeDatabase(databaseName, openOptions);
await nativeDatabase.initAsync();
return new SQLiteDatabase(databaseName, openOptions, nativeDatabase);
}
/**
* Open a database.
*
* > **Note:** Running heavy tasks with this function can block the JavaScript thread and affect performance.
*
* @param databaseName The name of the database file to open.
* @param options Open options.
*/
export function openDatabaseSync(databaseName, options) {
const openOptions = options ?? {};
const nativeDatabase = new ExpoSQLite.NativeDatabase(databaseName, openOptions);
nativeDatabase.initSync();
return new SQLiteDatabase(databaseName, openOptions, nativeDatabase);
}
/**
* Given a `Uint8Array` data and [deserialize to memory database](path_to_url
*
* @param serializedData The binary array to deserialize from [`SQLiteDatabase.serializeAsync()`](#serializeasyncdatabasename).
* @param options Open options.
*/
export async function deserializeDatabaseAsync(serializedData, options) {
const openOptions = options ?? {};
const nativeDatabase = new ExpoSQLite.NativeDatabase(':memory:', openOptions, serializedData);
await nativeDatabase.initAsync();
return new SQLiteDatabase(':memory:', openOptions, nativeDatabase);
}
/**
* Given a `Uint8Array` data and [deserialize to memory database](path_to_url
*
* > **Note:** Running heavy tasks with this function can block the JavaScript thread and affect performance.
*
* @param serializedData The binary array to deserialize from [`SQLiteDatabase.serializeSync()`](#serializesyncdatabasename)
* @param options Open options.
*/
export function deserializeDatabaseSync(serializedData, options) {
const openOptions = options ?? {};
const nativeDatabase = new ExpoSQLite.NativeDatabase(':memory:', openOptions, serializedData);
nativeDatabase.initSync();
return new SQLiteDatabase(':memory:', openOptions, nativeDatabase);
}
/**
* Delete a database file.
*
* @param databaseName The name of the database file to delete.
*/
export async function deleteDatabaseAsync(databaseName) {
return await ExpoSQLite.deleteDatabaseAsync(databaseName);
}
/**
* Delete a database file.
*
* > **Note:** Running heavy tasks with this function can block the JavaScript thread and affect performance.
*
* @param databaseName The name of the database file to delete.
*/
export function deleteDatabaseSync(databaseName) {
return ExpoSQLite.deleteDatabaseSync(databaseName);
}
/**
* Add a listener for database changes.
* > Note: to enable this feature, you must set [`enableChangeListener` to `true`](#sqliteopenoptions) when opening the database.
*
* @param listener A function that receives the `databaseName`, `databaseFilePath`, `tableName` and `rowId` of the modified data.
* @returns A `Subscription` object that you can call `remove()` on when you would like to unsubscribe the listener.
*/
export function addDatabaseChangeListener(listener) {
return ExpoSQLite.addListener('onDatabaseChange', listener);
}
/**
* A new connection specific used for [`withExclusiveTransactionAsync`](#withexclusivetransactionasynctask).
* @hidden not going to pull all the database methods to the document.
*/
class Transaction extends SQLiteDatabase {
static async createAsync(db) {
const options = { ...db.options, useNewConnection: true };
const nativeDatabase = new ExpoSQLite.NativeDatabase(db.databaseName, options);
await nativeDatabase.initAsync();
return new Transaction(db.databaseName, options, nativeDatabase);
}
}
//# sourceMappingURL=SQLiteDatabase.js.map
```
|
The Teribe River is a river of Panama.
See also
List of rivers of Panama
References
Rand McNally, The New International Atlas, 1993.
CIA map, 1995.
Rivers of Panama
|
Nebria catenulata is a species of metallic green coloured ground beetle from Nebriinae subfamily that can be found in North Korea and Russia.
Distribution
The species is long, and lives in Buriatia, Amur, Irkutsk, and Khamar-Daban, all which are located in Russia.
References
catenulata
Beetles described in 1820
Beetles of Asia
|
```xml
/**
* @packageDocumentation
* @module nbformat
*/
// Notebook format interfaces
// path_to_url
// path_to_url
import { JSONExt, PartialJSONObject } from '@lumino/coreutils';
/**
* The earliest major version of the notebook format we support.
*/
export const MAJOR_VERSION: number = 4;
/**
* The earliest minor version of the notebook format we support.
*/
export const MINOR_VERSION: number = 4;
/**
* The kernelspec metadata.
*/
export interface IKernelspecMetadata extends PartialJSONObject {
name: string;
display_name: string;
}
/**
* The language info metadata
*/
export interface ILanguageInfoMetadata extends PartialJSONObject {
name: string;
codemirror_mode?: string | PartialJSONObject;
file_extension?: string;
mimetype?: string;
pygments_lexer?: string;
}
/**
* The default metadata for the notebook.
*/
export interface INotebookMetadata extends PartialJSONObject {
kernelspec?: IKernelspecMetadata;
language_info?: ILanguageInfoMetadata;
orig_nbformat?: number;
}
/**
* The notebook content.
*/
export interface INotebookContent extends PartialJSONObject {
metadata: INotebookMetadata;
nbformat_minor: number;
nbformat: number;
cells: ICell[];
}
/**
* A multiline string.
*/
export type MultilineString = string | string[];
/**
* A mime-type keyed dictionary of data.
*/
export interface IMimeBundle extends PartialJSONObject {
[key: string]: MultilineString | PartialJSONObject;
}
/**
* Media attachments (e.g. inline images).
*/
export interface IAttachments {
[key: string]: IMimeBundle | undefined;
}
/**
* The code cell's prompt number. Will be null if the cell has not been run.
*/
export type ExecutionCount = number | null;
/**
* Cell output metadata.
*/
export type OutputMetadata = PartialJSONObject;
/**
* Validate a mime type/value pair.
*
* @param type - The mimetype name.
*
* @param value - The value associated with the type.
*
* @returns Whether the type/value pair are valid.
*/
export function validateMimeValue(
type: string,
value: MultilineString | PartialJSONObject
): boolean {
// Check if "application/json" or "application/foo+json"
const jsonTest = /^application\/.+\+json$/;
const isJSONType = type === 'application/json' || jsonTest.test(type);
const isString = (x: any) => {
return Object.prototype.toString.call(x) === '[object String]';
};
// If it is an array, make sure if is not a JSON type and it is an
// array of strings.
if (Array.isArray(value)) {
if (isJSONType) {
return false;
}
let valid = true;
(value as string[]).forEach(v => {
if (!isString(v)) {
valid = false;
}
});
return valid;
}
// If it is a string, make sure we are not a JSON type.
if (isString(value)) {
return !isJSONType;
}
// It is not a string, make sure it is a JSON type.
if (!isJSONType) {
return false;
}
// It is a JSON type, make sure it is a valid JSON object.
return JSONExt.isObject(value);
}
/**
* A type which describes the type of cell.
*/
export type CellType = 'code' | 'markdown' | 'raw' | string;
/**
* The Jupyter metadata namespace.
*/
export interface IBaseCellJupyterMetadata extends PartialJSONObject {
/**
* Whether the source is hidden.
*/
source_hidden: boolean;
}
/**
* Cell-level metadata.
*/
export interface IBaseCellMetadata extends PartialJSONObject {
/**
* Whether the cell is trusted.
*
* #### Notes
* This is not strictly part of the nbformat spec, but it is added by
* the contents manager.
*
* See path_to_url
*/
trusted: boolean;
/**
* The cell's name. If present, must be a non-empty string.
*/
name: string;
/**
* The Jupyter metadata namespace
*/
jupyter: Partial<IBaseCellJupyterMetadata>;
/**
* The cell's tags. Tags must be unique, and must not contain commas.
*/
tags: string[];
}
/**
* The base cell interface.
*/
export interface IBaseCell extends PartialJSONObject {
/**
* String identifying the type of cell.
*/
cell_type: string;
/**
* Contents of the cell, represented as an array of lines.
*/
source: MultilineString;
/**
* Cell-level metadata.
*/
metadata: Partial<ICellMetadata>;
}
/**
* Metadata for the raw cell.
*/
export interface IRawCellMetadata extends IBaseCellMetadata {
/**
* Raw cell metadata format for nbconvert.
*/
format: string;
}
/**
* A raw cell.
*/
export interface IRawCell extends IBaseCell {
/**
* A string field representing the identifier of this particular cell.
*
* Notebook format 4.4 requires no id field, but format 4.5 requires an id
* field. We need to handle both cases, so we make id optional here.
*/
id?: string;
/**
* String identifying the type of cell.
*/
cell_type: 'raw';
/**
* Cell-level metadata.
*/
metadata: Partial<IRawCellMetadata>;
/**
* Cell attachments.
*/
attachments?: IAttachments;
}
/**
* A markdown cell.
*/
export interface IMarkdownCell extends IBaseCell {
/**
* A string field representing the identifier of this particular cell.
*
* Notebook format 4.4 requires no id field, but format 4.5 requires an id
* field. We need to handle both cases, so we make id optional here.
*/
id?: string;
/**
* String identifying the type of cell.
*/
cell_type: 'markdown';
/**
* Cell attachments.
*/
attachments?: IAttachments;
}
/**
* The Jupyter metadata namespace for code cells.
*/
export interface ICodeCellJupyterMetadata extends IBaseCellJupyterMetadata {
/**
* Whether the outputs are hidden. See path_to_url
*/
outputs_hidden: boolean;
}
/**
* Metadata for a code cell.
*/
export interface ICodeCellMetadata extends IBaseCellMetadata {
/**
* Whether the cell is collapsed/expanded.
*/
collapsed: boolean;
/**
* The Jupyter metadata namespace
*/
jupyter: Partial<ICodeCellJupyterMetadata>;
/**
* Whether the cell's output is scrolled, unscrolled, or autoscrolled.
*/
scrolled: boolean | 'auto';
}
/**
* A code cell.
*/
export interface ICodeCell extends IBaseCell {
/**
* A string field representing the identifier of this particular cell.
*
* Notebook format 4.4 requires no id field, but format 4.5 requires an id
* field. We need to handle both cases, so we make id optional here.
*/
id?: string;
/**
* String identifying the type of cell.
*/
cell_type: 'code';
/**
* Cell-level metadata.
*/
metadata: Partial<ICodeCellMetadata>;
/**
* Execution, display, or stream outputs.
*/
outputs: IOutput[];
/**
* The code cell's prompt number. Will be null if the cell has not been run.
*/
execution_count: ExecutionCount;
}
/**
* An unrecognized cell.
*/
export interface IUnrecognizedCell extends IBaseCell {}
/**
* A cell union type.
*/
export type ICell = IRawCell | IMarkdownCell | ICodeCell | IUnrecognizedCell;
/**
* Test whether a cell is a raw cell.
*/
export function isRaw(cell: ICell): cell is IRawCell {
return cell.cell_type === 'raw';
}
/**
* Test whether a cell is a markdown cell.
*/
export function isMarkdown(cell: ICell): cell is IMarkdownCell {
return cell.cell_type === 'markdown';
}
/**
* Test whether a cell is a code cell.
*/
export function isCode(cell: ICell): cell is ICodeCell {
return cell.cell_type === 'code';
}
/**
* A union metadata type.
*/
export type ICellMetadata =
| IBaseCellMetadata
| IRawCellMetadata
| ICodeCellMetadata;
/**
* The valid output types.
*/
export type OutputType =
| 'execute_result'
| 'display_data'
| 'stream'
| 'error'
| 'update_display_data';
/**
* The base output type.
*/
export interface IBaseOutput extends PartialJSONObject {
/**
* Type of cell output.
*/
output_type: string;
}
/**
* Result of executing a code cell.
*/
export interface IExecuteResult extends IBaseOutput {
/**
* Type of cell output.
*/
output_type: 'execute_result';
/**
* A result's prompt number.
*/
execution_count: ExecutionCount;
/**
* A mime-type keyed dictionary of data.
*/
data: IMimeBundle;
/**
* Cell output metadata.
*/
metadata: OutputMetadata;
}
/**
* Data displayed as a result of code cell execution.
*/
export interface IDisplayData extends IBaseOutput {
/**
* Type of cell output.
*/
output_type: 'display_data';
/**
* A mime-type keyed dictionary of data.
*/
data: IMimeBundle;
/**
* Cell output metadata.
*/
metadata: OutputMetadata;
}
/**
* Data displayed as an update to existing display data.
*/
export interface IDisplayUpdate extends IBaseOutput {
/**
* Type of cell output.
*/
output_type: 'update_display_data';
/**
* A mime-type keyed dictionary of data.
*/
data: IMimeBundle;
/**
* Cell output metadata.
*/
metadata: OutputMetadata;
}
/**
* Stream output from a code cell.
*/
export interface IStream extends IBaseOutput {
/**
* Type of cell output.
*/
output_type: 'stream';
/**
* The name of the stream.
*/
name: StreamType;
/**
* The stream's text output.
*/
text: MultilineString;
}
/**
* An alias for a stream type.
*/
export type StreamType = 'stdout' | 'stderr';
/**
* Output of an error that occurred during code cell execution.
*/
export interface IError extends IBaseOutput {
/**
* Type of cell output.
*/
output_type: 'error';
/**
* The name of the error.
*/
ename: string;
/**
* The value, or message, of the error.
*/
evalue: string;
/**
* The error's traceback.
*/
traceback: string[];
}
/**
* Unrecognized output.
*/
export interface IUnrecognizedOutput extends IBaseOutput {}
/**
* Test whether an output is an execute result.
*/
export function isExecuteResult(output: IOutput): output is IExecuteResult {
return output.output_type === 'execute_result';
}
/**
* Test whether an output is from display data.
*/
export function isDisplayData(output: IOutput): output is IDisplayData {
return output.output_type === 'display_data';
}
/**
* Test whether an output is from updated display data.
*/
export function isDisplayUpdate(output: IOutput): output is IDisplayUpdate {
return output.output_type === 'update_display_data';
}
/**
* Test whether an output is from a stream.
*/
export function isStream(output: IOutput): output is IStream {
return output.output_type === 'stream';
}
/**
* Test whether an output is an error.
*/
export function isError(output: IOutput): output is IError {
return output.output_type === 'error';
}
/**
* An output union type.
*/
export type IOutput =
| IUnrecognizedOutput
| IExecuteResult
| IDisplayData
| IStream
| IError;
```
|
In linguistics, metapragmatics is the study of how the effects and conditions of language use themselves become objects of discourse. The term is commonly associated with the semiotically-informed linguistic anthropology of Michael Silverstein.
Overview
Metapragmatic signalling allows participants to construe what is going on in an interaction. Examples include:
Describing the "correct way" of using language ("I before E except after C."),
Specifying under which conditions a specific kind of communication are, or should be, used ("You should never tell a dirty joke at a funeral."),
Signalling, explicitly or implicitly, the type of social event occurring (explicit: "I promise to be there at 3:00 p.m." implicit: "I will be there at 3:00 p.m.")
Linking speech to another event outside the moment of speaking ("Every day she goes jogging." ).
Discussions of linguistic pragmatics—that is, discussions of what speech does in a particular context—are meta-pragmatic, because they describe the meaning of speech as action. Although it is useful to distinguish semantic (i.e. denotative or referential) meaning (dictionary meaning) from pragmatic meaning, and thus metasemantic discourse (for example, "Mesa means 'table' in Spanish") from metapragmatic utterances (e.g. "Say 'thank you' to your grandmother," or "It is impolite to swear in mixed company"), meta-semantic characterizations of speech are a type of metapragmatic speech. This follows from the assertion that metapragmatic speech characterizes speech function, and denotation or reference are among the many functions of speech. Because metapragmatics describes relations between different discourses it relates crucially to the concepts of intertextuality or interdiscursivity.
In anthropology, describing the rules of use for metapragmatic speech (in the same way that a grammar would describe the rules of use for 'ordinary' or semantic speech) is important because it can aid the understanding and analysis of a culture's language ideology. Silverstein has also described universal limits on metapragmatic awareness that help explain why some linguistic forms seem to be available to their users for conscious comment, while other forms seem to escape awareness despite efforts by a researcher to ask native speakers to repeat them or characterize their use.
Self-referential, or reflexive, metapragmatic statements are indexical. That is, their meaning comes from their temporal contiguity with their referent: themselves. Example: "This is an example sentence."
The anthropologist Aomar Boum uses a related concept of "ethnometapragmatics" to explain the Moroccan concept of showing the "plastic eye" ('ayn mika), which refers to the practice of ignoring something while pretending it is not there.
See also
Metasemantics
Metasyntax
References
Lucy, John A. Reflexive Language: Reported Speech and Metapragmatics. Cambridge: Cambridge University 2004.
Silverstein, Michael. "Shifters, Linguistic Categories, and Cultural Description." Meaning in Anthropology, ed. Keith Basso and Henry A. Selby. Albuquerque: UNM Press, 1976.
Silverstein, Michael. "The Limits of Awareness," in Linguistic Anthropology: A Reader. Edited by A. Duranti, pp. 382–401. Malden: Blackwell, 2001.
Verschueren, Jef. "Notes on the Role of Metapragmatic Awareness in Language Use." Pragmatics 10(4): 439–456.
Semantics
Pragmatics
Semiotics
Anthropology
|
Band-Aid is a brand of adhesive bandages distributed by the consumer health company Kenvue, spun off from Johnson & Johnson in 2023. Invented in 1920, the brand has become a generic term for adhesive bandages in countries such as the United States, Canada, Australia, the Philippines, and others.
History
The Band-Aid was invented in 1920 by a Johnson & Johnson employee, Earle Dickson, in Highland Park, New Jersey, for his wife Josephine, who frequently cut and burned herself while cooking. The prototype allowed her to dress her wounds without assistance. Dickson passed the idea on to his employer, which went on to produce and market the product as the Band-Aid. Dickson had a successful career at Johnson & Johnson, rising to vice president before his retirement in 1957.
The original Band-Aids were handmade and not very popular. By 1924, Johnson & Johnson introduced machine-made Band-Aids and began the sale of sterilized Band-Aids in 1939.
In World War II, millions were shipped overseas, helping popularize the product. Since then, Johnson & Johnson has estimated a sale of over 100 billion Band-Aids worldwide.
In 1951, the first decorative Band-Aids were introduced. They continue to be a commercial success, with such themes as Mickey Mouse, Donald Duck, Superman, Spider-Man, Rocket Power, Rugrats, smiley faces, Barbie, Dora the Explorer, Elmo, and Batman.
In 2022, Band-Aid was named the most trusted brand in the United States, beating the second place brand, Lysol, by more than two points.
Trademark status
Band-Aid has, over time, become a well-known example of a genericized trademark in the United States, Canada and South America, but Johnson & Johnson has registered Band-Aid as a trademark on the Principal Register of the United States Patent and Trademark Office, and the registration is valid and legal. Johnson & Johnson continues to defend the Band-Aid trademark against it being genericized.
See also
Elastoplast, a comparable European brand and genericized trademark
References
External links
Band-Aid Brand Official Website
Band-Aid Brand History
Johnson & Johnson First Aid Website
Products introduced in 1920
First aid
Johnson & Johnson brands
Personal care brands
Brands that became generic
|
```shell
#!/bin/sh
# path_to_url#poll
set -e
insmod poll.ko "$@"
./kernel_modules/poll.out /sys/kernel/debug/lkmc_poll
# TODO capture Ctrl+C and do this automatically.
#rmmod poll
```
|
The Lavochkin La-168 was a jet fighter developed for the USSR. Like the better known Mikoyan MiG-15 which was ultimately selected and went on to become one of the most successful jet fighters of its era, the Lavochkin La-168 was designed in response to a 1946 request for an advanced swept-wing jet fighter capable of transonic performance. It was to use new turbojet based on the Rolls-Royce Nene in competition with the design bureaus of Artem Mikoyan and Mikhail Gurevich, and Aleksandr Yakovlev. A scaled down version of this aircraft would lead to the production of the La-15, which performed well but would be dropped in favor of the MiG-15.
Design and development
Aircraft 168 was preceded by the Lavochkin La-160 jet fighter which was the first to utilize swept wing surfaces first researched by the Germans, but it moved the engine from the nose to behind the pilot. It resembled the Mikoyan MiG-15 and used the same cannon-armament and the Rolls-Royce Nene II engine. Unlike the MiG-15, the La-168 had shoulder mounted wings and a t-tail layout. Due to Lavochkin's decision to wait with La-168 development for the Nene II engine, the MiG-15, first flown with the less powerful Nene I, was available four months earlier, giving it a crucial advantage.
Aircraft 168's first flight was on April 22, 1948, with I. E. Fedorov at the controls. Trials continued until February 19, 1949, when testing of the cannons at high altitude caused the canopy to collapse, resulting in a nearly fatal crash. In the end, the Lavochkin fighter lost out to the competing MiG-15. Another 168 derivative was the La-176, the first Soviet plane to achieve supersonic flight (in a shallow dive) on December 26, 1948.
A scaled down version of this aircraft powered by a Rolls-Royce Derwent, was produced as Aircraft 174, prototype of the production La-15, which although well liked and having superior performance, was more expensive and harder to mass-produce than the MiG-15.
Variants
Aircraft 176 - One Aircraft 168 produced with 45° swept wings and tailplane. Believed to be first Soviet aircraft to exceed Mach 1.0 albeit in a dive. Crashed whilst supersonic when canopy collapsed.
Aircraft 174 - A 0.9 scale version of aircraft 168 which was productionised as the La-15.
Specifications (Aircraft 168)
See also
References
Bibliography
Gordon,Yefim. Lavochkin's Last Jets. Midland Publishing. Hinkley. 2007.
Further reading
Gunston, Bill. The Osprey Encyclopedia of Russian Aircraft 1875–1995. London:Osprey, 1995. .
External links
La-168 at the Russian Aviation Museum
Abandoned military aircraft projects of the Soviet Union
La-168
1940s Soviet fighter aircraft
Single-engined jet aircraft
Shoulder-wing aircraft
Aircraft first flown in 1948
|
```objective-c
#ifndef AVIF_INTERNAL_H
#define AVIF_INTERNAL_H
#include "pxr/imaging/plugin/hioAvif/AVIF/src/avif/avif.h" // IWYU pragma: export
#ifdef __cplusplus
extern "C" {
#endif
// Yes, clamp macros are nasty. Do not use them.
#define AVIF_CLAMP(x, low, high) (((x) < (low)) ? (low) : (((high) < (x)) ? (high) : (x)))
#define AVIF_MIN(a, b) (((a) < (b)) ? (a) : (b))
#define AVIF_MAX(a, b) (((a) > (b)) ? (a) : (b))
// Used for debugging. Define AVIF_BREAK_ON_ERROR to catch the earliest failure during encoding or decoding.
#if defined(AVIF_BREAK_ON_ERROR)
static inline void avifBreakOnError()
{
// Same mechanism as OpenCV's error() function, or replace by a breakpoint.
int * p = NULL;
*p = 0;
}
#else
#define avifBreakOnError()
#endif
// Used by stream related things.
#define AVIF_CHECK(A) \
do { \
if (!(A)) { \
avifBreakOnError(); \
return AVIF_FALSE; \
} \
} while (0)
// Used instead of CHECK if needing to return a specific error on failure, instead of AVIF_FALSE
#define AVIF_CHECKERR(A, ERR) \
do { \
if (!(A)) { \
avifBreakOnError(); \
return ERR; \
} \
} while (0)
// Forward any error to the caller now or continue execution.
#define AVIF_CHECKRES(A) \
do { \
const avifResult result__ = (A); \
if (result__ != AVIF_RESULT_OK) { \
avifBreakOnError(); \
return result__; \
} \
} while (0)
// your_sha256_hash-----------
// URNs and Content-Types
#define AVIF_URN_ALPHA0 "urn:mpeg:mpegB:cicp:systems:auxiliary:alpha"
#define AVIF_URN_ALPHA1 "urn:mpeg:hevc:2015:auxid:1"
#define AVIF_CONTENT_TYPE_XMP "application/rdf+xml"
// your_sha256_hash-----------
// Utils
float avifRoundf(float v);
// H (host) is platform-dependent. Could be little- or big-endian.
// N (network) is big-endian: most- to least-significant bytes.
// C (custom) is little-endian: least- to most-significant bytes.
// Never read N or C values; only access after casting to uint8_t*.
uint16_t avifHTONS(uint16_t s);
uint16_t avifNTOHS(uint16_t s);
uint16_t avifCTOHS(uint16_t s);
uint32_t avifHTONL(uint32_t l);
uint32_t avifNTOHL(uint32_t l);
uint32_t avifCTOHL(uint32_t l);
uint64_t avifHTON64(uint64_t l);
uint64_t avifNTOH64(uint64_t l);
void avifCalcYUVCoefficients(const avifImage * image, float * outR, float * outG, float * outB);
typedef float (*avifTransferFunction)(float);
// Returns a function to map from gamma-encoded values in the [0.0, 1.0] range to linear extended SDR values.
// Extended SDR values are in [0.0, 1.0] for SDR transfer chracteristics (all transfer characteristics except PQ and HLG)
// and can go beyond 1.0 for HDR transfer characteristics:
// - For AVIF_TRANSFER_CHARACTERISTICS_SMPTE2084 (PQ), the linear range is [0.0, 10000/203]
// - For AVIF_TRANSFER_CHARACTERISTICS_HLG, the linear range is [0.0, 1000/203]
avifTransferFunction avifTransferCharacteristicsGetGammaToLinearFunction(avifTransferCharacteristics atc);
// Same as above in the opposite direction. toGamma(toLinear(v)) ~= v.
avifTransferFunction avifTransferCharacteristicsGetLinearToGammaFunction(avifTransferCharacteristics atc);
// Computes the RGB->YUV conversion coefficients kr, kg, kb, such that Y=kr*R+kg*G+kb*B.
void avifColorPrimariesComputeYCoeffs(avifColorPrimaries colorPrimaries, float coeffs[3]);
#define AVIF_ARRAY_DECLARE(TYPENAME, ITEMSTYPE, ITEMSNAME) \
typedef struct TYPENAME \
{ \
ITEMSTYPE * ITEMSNAME; \
uint32_t elementSize; \
uint32_t count; \
uint32_t capacity; \
} TYPENAME
AVIF_NODISCARD avifBool avifArrayCreate(void * arrayStruct, uint32_t elementSize, uint32_t initialCapacity);
AVIF_NODISCARD void * avifArrayPush(void * arrayStruct);
void avifArrayPop(void * arrayStruct);
void avifArrayDestroy(void * arrayStruct);
void avifFractionSimplify(avifFraction * f);
// Makes the fractions have a common denominator.
AVIF_NODISCARD avifBool avifFractionCD(avifFraction * a, avifFraction * b);
AVIF_NODISCARD avifBool avifFractionAdd(avifFraction a, avifFraction b, avifFraction * result);
AVIF_NODISCARD avifBool avifFractionSub(avifFraction a, avifFraction b, avifFraction * result);
// Creates an int32 fraction that is approximately equal to 'v'.
// Returns AVIF_FALSE if 'v' is NaN or abs(v) is > INT32_MAX.
AVIF_NODISCARD avifBool avifDoubleToSignedFraction(double v, int32_t * numerator, uint32_t * denominator);
// Creates a uint32 fraction that is approximately equal to 'v'.
// Returns AVIF_FALSE if 'v' is < 0 or > UINT32_MAX or NaN.
AVIF_NODISCARD avifBool avifDoubleToUnsignedFraction(double v, uint32_t * numerator, uint32_t * denominator);
void avifImageSetDefaults(avifImage * image);
// Copies all fields that do not need to be freed/allocated from srcImage to dstImage.
void avifImageCopyNoAlloc(avifImage * dstImage, const avifImage * srcImage);
// Copies the samples from srcImage to dstImage. dstImage must be allocated.
// srcImage and dstImage must have the same width, height, and depth.
// If the AVIF_PLANES_YUV bit is set in planes, then srcImage and dstImage must have the same yuvFormat and yuvRange.
// Ignores the gainMap field (which exists only if AVIF_ENABLE_EXPERIMENTAL_GAIN_MAP is defined).
void avifImageCopySamples(avifImage * dstImage, const avifImage * srcImage, avifPlanesFlags planes);
typedef struct avifAlphaParams
{
uint32_t width;
uint32_t height;
uint32_t srcDepth;
const uint8_t * srcPlane;
uint32_t srcRowBytes;
uint32_t srcOffsetBytes;
uint32_t srcPixelBytes;
uint32_t dstDepth;
uint8_t * dstPlane;
uint32_t dstRowBytes;
uint32_t dstOffsetBytes;
uint32_t dstPixelBytes;
} avifAlphaParams;
void avifFillAlpha(const avifAlphaParams * params);
void avifReformatAlpha(const avifAlphaParams * params);
typedef enum avifReformatMode
{
AVIF_REFORMAT_MODE_YUV_COEFFICIENTS = 0, // Normal YUV conversion using coefficients
AVIF_REFORMAT_MODE_IDENTITY, // Pack GBR directly into YUV planes (AVIF_MATRIX_COEFFICIENTS_IDENTITY)
AVIF_REFORMAT_MODE_YCGCO, // YUV conversion using AVIF_MATRIX_COEFFICIENTS_YCGCO
#if defined(AVIF_ENABLE_EXPERIMENTAL_YCGCO_R)
AVIF_REFORMAT_MODE_YCGCO_RE, // YUV conversion using AVIF_MATRIX_COEFFICIENTS_YCGCO_RE
AVIF_REFORMAT_MODE_YCGCO_RO, // YUV conversion using AVIF_MATRIX_COEFFICIENTS_YCGCO_RO
#endif
} avifReformatMode;
typedef enum avifAlphaMultiplyMode
{
AVIF_ALPHA_MULTIPLY_MODE_NO_OP = 0,
AVIF_ALPHA_MULTIPLY_MODE_MULTIPLY,
AVIF_ALPHA_MULTIPLY_MODE_UNMULTIPLY
} avifAlphaMultiplyMode;
// Information about an RGB color space.
typedef struct avifRGBColorSpaceInfo
{
uint32_t channelBytes; // Number of bytes per channel.
uint32_t pixelBytes; // Number of bytes per pixel (= channelBytes * num channels).
uint32_t offsetBytesR; // Offset in bytes of the red channel in a pixel.
uint32_t offsetBytesG; // Offset in bytes of the green channel in a pixel.
uint32_t offsetBytesB; // Offset in bytes of the blue channel in a pixel.
uint32_t offsetBytesA; // Offset in bytes of the alpha channel in a pixel.
int maxChannel; // Maximum value for a channel (e.g. 255 for 8 bit).
float maxChannelF; // Same as maxChannel but as a float.
} avifRGBColorSpaceInfo;
avifBool avifGetRGBColorSpaceInfo(const avifRGBImage * rgb, avifRGBColorSpaceInfo * info);
// Information about a YUV color space.
typedef struct avifYUVColorSpaceInfo
{
// YUV coefficients. Y = kr*R + kg*G + kb*B.
float kr;
float kg;
float kb;
uint32_t channelBytes; // Number of bytes per channel.
uint32_t depth; // Bit depth.
avifRange range; // Full or limited range.
int maxChannel; // Maximum value for a channel (e.g. 255 for 8 bit).
float biasY; // Minimum Y value.
float biasUV; // The value of 0.5 for the appropriate bit depth (128 for 8 bit, 512 for 10 bit, 2048 for 12 bit).
float rangeY; // Difference between max and min Y.
float rangeUV; // Difference between max and min UV.
avifPixelFormatInfo formatInfo; // Chroma subsampling information.
avifReformatMode mode; // Appropriate RGB<->YUV conversion mode.
} avifYUVColorSpaceInfo;
avifBool avifGetYUVColorSpaceInfo(const avifImage * image, avifYUVColorSpaceInfo * info);
typedef struct avifReformatState
{
avifRGBColorSpaceInfo rgb;
avifYUVColorSpaceInfo yuv;
} avifReformatState;
// Retrieves the pixel value at position (x, y) expressed as floats in [0, 1]. If the image's format doesn't have alpha,
// rgbaPixel[3] is set to 1.0f.
void avifGetRGBAPixel(const avifRGBImage * src, uint32_t x, uint32_t y, const avifRGBColorSpaceInfo * info, float rgbaPixel[4]);
// Sets the pixel value at position (i, j) from RGBA values expressed as floats in [0, 1]. If the image's format doesn't
// support alpha, rgbaPixel[3] is ignored.
void avifSetRGBAPixel(const avifRGBImage * dst, uint32_t x, uint32_t y, const avifRGBColorSpaceInfo * info, const float rgbaPixel[4]);
// Returns:
// * AVIF_RESULT_OK - Converted successfully with libyuv
// * AVIF_RESULT_NOT_IMPLEMENTED - The fast path for this combination is not implemented with libyuv, use built-in RGB conversion
// * [any other error] - Return error to caller
avifResult avifImageRGBToYUVLibYUV(avifImage * image, const avifRGBImage * rgb);
// Parameters:
// * image - input YUV image
// * rgb - output RGB image
// * reformatAlpha - if set to AVIF_TRUE, the function will attempt to copy the alpha channel to the output RGB image using
// libyuv.
// * alphaReformattedWithLibYUV - Output parameter. If reformatAlpha is set to true and libyuv was able to copy over the alpha
// channel, then this will be set to AVIF_TRUE. Otherwise, this will be set to AVIF_FALSE. The value in this parameter is valid
// only if the return value of the function is AVIF_RESULT_OK or AVIF_RESULT_NOT_IMPLEMENTED.
// Returns:
// * AVIF_RESULT_OK - Converted successfully with libyuv
// * AVIF_RESULT_NOT_IMPLEMENTED - The fast path for this combination is not implemented with libyuv, use built-in YUV conversion
// * [any other error] - Return error to caller
avifResult avifImageYUVToRGBLibYUV(const avifImage * image, avifRGBImage * rgb, avifBool reformatAlpha, avifBool * alphaReformattedWithLibYUV);
// Returns:
// * AVIF_RESULT_OK - Converted successfully with libsharpyuv
// * AVIF_RESULT_NOT_IMPLEMENTED - libsharpyuv is not compiled in, or doesn't support this type of input
// * [any other error] - Return error to caller
avifResult avifImageRGBToYUVLibSharpYUV(avifImage * image, const avifRGBImage * rgb, const avifReformatState * state);
// Returns:
// * AVIF_RESULT_OK - Converted successfully with libyuv.
// * AVIF_RESULT_NOT_IMPLEMENTED - The fast path for this conversion is not implemented with libyuv, use built-in conversion.
// * AVIF_RESULT_INVALID_ARGUMENT - Return error to caller.
avifResult avifRGBImageToF16LibYUV(avifRGBImage * rgb);
// Returns:
// * AVIF_RESULT_OK - (Un)Premultiply successfully with libyuv
// * AVIF_RESULT_NOT_IMPLEMENTED - The fast path for this combination is not implemented with libyuv, use built-in (Un)Premultiply
// * [any other error] - Return error to caller
avifResult avifRGBImagePremultiplyAlphaLibYUV(avifRGBImage * rgb);
avifResult avifRGBImageUnpremultiplyAlphaLibYUV(avifRGBImage * rgb);
AVIF_NODISCARD avifBool avifDimensionsTooLarge(uint32_t width, uint32_t height, uint32_t imageSizeLimit, uint32_t imageDimensionLimit);
// Given the number of encoding threads or decoding threads available and the image dimensions,
// chooses suitable values of *tileRowsLog2 and *tileColsLog2.
//
// Note: Although avifSetTileConfiguration() is only used in src/write.c and could be a static
// function in that file, it is defined as an internal global function so that it can be tested by
// unit tests.
void avifSetTileConfiguration(int threads, uint32_t width, uint32_t height, int * tileRowsLog2, int * tileColsLog2);
// your_sha256_hash-----------
// Scaling
// Scales the YUV/A planes in-place.
AVIF_NODISCARD avifResult avifImageScaleWithLimit(avifImage * image,
uint32_t dstWidth,
uint32_t dstHeight,
uint32_t imageSizeLimit,
uint32_t imageDimensionLimit,
avifDiagnostics * diag);
// your_sha256_hash-----------
// AVIF item category
typedef enum avifItemCategory
{
AVIF_ITEM_COLOR,
AVIF_ITEM_ALPHA,
#if defined(AVIF_ENABLE_EXPERIMENTAL_GAIN_MAP)
AVIF_ITEM_GAIN_MAP,
#endif
AVIF_ITEM_CATEGORY_COUNT
} avifItemCategory;
// your_sha256_hash-----------
#if defined(AVIF_ENABLE_EXPERIMENTAL_AVIR)
// AVIF color_type field meaning in CondensedImageBox
typedef enum avifConiColorType
{
AVIF_CONI_COLOR_TYPE_SRGB = 0,
AVIF_CONI_COLOR_TYPE_NCLX_5BIT = 1,
AVIF_CONI_COLOR_TYPE_NCLX_8BIT = 2,
AVIF_CONI_COLOR_TYPE_ICC = 3
} avifConiColorType;
#endif // AVIF_ENABLE_EXPERIMENTAL_AVIR
// your_sha256_hash-----------
// Grid AVIF images
// Returns false if the tiles in a grid image violate any standards.
// The image contains imageW*imageH pixels. The tiles are of tileW*tileH pixels each.
AVIF_NODISCARD avifBool avifAreGridDimensionsValid(avifPixelFormat yuvFormat,
uint32_t imageW,
uint32_t imageH,
uint32_t tileW,
uint32_t tileH,
avifDiagnostics * diag);
// your_sha256_hash-----------
// Metadata
// Attempts to parse the image->exif payload for Exif orientation and sets image->transformFlags, image->irot and
// image->imir on success. Returns AVIF_RESULT_INVALID_EXIF_PAYLOAD on failure.
avifResult avifImageExtractExifOrientationToIrotImir(avifImage * image);
// your_sha256_hash-----------
// avifCodecDecodeInput
// Legal spatial_id values are [0,1,2,3], so this serves as a sentinel value for "do not filter by spatial_id"
#define AVIF_SPATIAL_ID_UNSET 0xff
typedef struct avifDecodeSample
{
avifROData data;
avifBool ownsData;
avifBool partialData; // if true, data exists but doesn't have all of the sample in it
uint32_t itemID; // if non-zero, data comes from a mergedExtents buffer in an avifDecoderItem, not a file offset
uint64_t offset; // additional offset into data. Can be used to offset into an itemID's payload as well.
size_t size; //
uint8_t spatialID; // If set to a value other than AVIF_SPATIAL_ID_UNSET, output frames from this sample should be
// skipped until the output frame's spatial_id matches this ID.
avifBool sync; // is sync sample (keyframe)
} avifDecodeSample;
AVIF_ARRAY_DECLARE(avifDecodeSampleArray, avifDecodeSample, sample);
typedef struct avifCodecDecodeInput
{
avifDecodeSampleArray samples;
avifBool allLayers; // if true, the underlying codec must decode all layers, not just the best layer
avifItemCategory itemCategory; // category of item being decoded
} avifCodecDecodeInput;
AVIF_NODISCARD avifCodecDecodeInput * avifCodecDecodeInputCreate(void);
void avifCodecDecodeInputDestroy(avifCodecDecodeInput * decodeInput);
// your_sha256_hash-----------
// avifCodecEncodeOutput
typedef struct avifEncodeSample
{
avifRWData data;
avifBool sync; // is sync sample (keyframe)
} avifEncodeSample;
AVIF_ARRAY_DECLARE(avifEncodeSampleArray, avifEncodeSample, sample);
typedef struct avifCodecEncodeOutput
{
avifEncodeSampleArray samples;
} avifCodecEncodeOutput;
AVIF_NODISCARD avifCodecEncodeOutput * avifCodecEncodeOutputCreate(void);
avifResult avifCodecEncodeOutputAddSample(avifCodecEncodeOutput * encodeOutput, const uint8_t * data, size_t len, avifBool sync);
void avifCodecEncodeOutputDestroy(avifCodecEncodeOutput * encodeOutput);
// your_sha256_hash-----------
// avifCodecSpecificOptions (key/value string pairs for advanced tuning)
typedef struct avifCodecSpecificOption
{
char * key; // Must be a simple lowercase alphanumeric string
char * value; // Free-form string to be interpreted by the codec
} avifCodecSpecificOption;
AVIF_ARRAY_DECLARE(avifCodecSpecificOptions, avifCodecSpecificOption, entries);
// Returns NULL if a memory allocation failed.
AVIF_NODISCARD avifCodecSpecificOptions * avifCodecSpecificOptionsCreate(void);
void avifCodecSpecificOptionsClear(avifCodecSpecificOptions * csOptions);
void avifCodecSpecificOptionsDestroy(avifCodecSpecificOptions * csOptions);
avifResult avifCodecSpecificOptionsSet(avifCodecSpecificOptions * csOptions, const char * key, const char * value); // if(value==NULL), key is deleted
// your_sha256_hash-----------
// avifCodecType (underlying video format)
// Alliance for Open Media video formats that can be used in the AVIF image format.
typedef enum avifCodecType
{
AVIF_CODEC_TYPE_UNKNOWN,
AVIF_CODEC_TYPE_AV1,
#if defined(AVIF_CODEC_AVM)
AVIF_CODEC_TYPE_AV2, // Experimental.
#endif
} avifCodecType;
// Returns AVIF_CODEC_TYPE_UNKNOWN unless the chosen codec is available with the requiredFlags.
avifCodecType avifCodecTypeFromChoice(avifCodecChoice choice, avifCodecFlags requiredFlags);
// your_sha256_hash-----------
// avifCodec (abstraction layer to use different codec implementations)
struct avifCodec;
struct avifCodecInternal;
typedef enum avifEncoderChange
{
AVIF_ENCODER_CHANGE_MIN_QUANTIZER = (1u << 0),
AVIF_ENCODER_CHANGE_MAX_QUANTIZER = (1u << 1),
AVIF_ENCODER_CHANGE_MIN_QUANTIZER_ALPHA = (1u << 2),
AVIF_ENCODER_CHANGE_MAX_QUANTIZER_ALPHA = (1u << 3),
AVIF_ENCODER_CHANGE_TILE_ROWS_LOG2 = (1u << 4),
AVIF_ENCODER_CHANGE_TILE_COLS_LOG2 = (1u << 5),
AVIF_ENCODER_CHANGE_QUANTIZER = (1u << 6),
AVIF_ENCODER_CHANGE_QUANTIZER_ALPHA = (1u << 7),
AVIF_ENCODER_CHANGE_SCALING_MODE = (1u << 8),
AVIF_ENCODER_CHANGE_CODEC_SPECIFIC = (1u << 31)
} avifEncoderChange;
typedef uint32_t avifEncoderChanges;
typedef avifBool (*avifCodecGetNextImageFunc)(struct avifCodec * codec,
struct avifDecoder * decoder,
const avifDecodeSample * sample,
avifBool alpha,
avifBool * isLimitedRangeAlpha,
avifImage * image);
// EncodeImage and EncodeFinish are not required to always emit a sample, but when all images are
// encoded and EncodeFinish is called, the number of samples emitted must match the number of submitted frames.
// avifCodecEncodeImageFunc may return AVIF_RESULT_UNKNOWN_ERROR to automatically emit the appropriate
// AVIF_RESULT_ENCODE_COLOR_FAILED or AVIF_RESULT_ENCODE_ALPHA_FAILED depending on the alpha argument.
// avifCodecEncodeImageFunc should use tileRowsLog2 and tileColsLog2 instead of
// encoder->tileRowsLog2, encoder->tileColsLog2, and encoder->autoTiling. The caller of
// avifCodecEncodeImageFunc is responsible for automatic tiling if encoder->autoTiling is set to
// AVIF_TRUE. The actual tiling values are passed to avifCodecEncodeImageFunc as parameters.
// Similarly, avifCodecEncodeImageFunc should use the quantizer parameter instead of
// encoder->quality and encoder->qualityAlpha. If disableLaggedOutput is AVIF_TRUE, then the encoder will emit the output frame
// without any lag (if supported). Note that disableLaggedOutput is only used by the first call to this function (which
// initializes the encoder) and is ignored by the subsequent calls.
//
// Note: The caller of avifCodecEncodeImageFunc always passes encoder->data->tileRowsLog2 and
// encoder->data->tileColsLog2 as the tileRowsLog2 and tileColsLog2 arguments. Because
// encoder->data is of a struct type defined in src/write.c, avifCodecEncodeImageFunc cannot
// dereference encoder->data and has to receive encoder->data->tileRowsLog2 and
// encoder->data->tileColsLog2 via function parameters.
typedef avifResult (*avifCodecEncodeImageFunc)(struct avifCodec * codec,
avifEncoder * encoder,
const avifImage * image,
avifBool alpha,
int tileRowsLog2,
int tileColsLog2,
int quantizer,
avifEncoderChanges encoderChanges,
avifBool disableLaggedOutput,
avifAddImageFlags addImageFlags,
avifCodecEncodeOutput * output);
typedef avifBool (*avifCodecEncodeFinishFunc)(struct avifCodec * codec, avifCodecEncodeOutput * output);
typedef void (*avifCodecDestroyInternalFunc)(struct avifCodec * codec);
typedef struct avifCodec
{
avifCodecSpecificOptions * csOptions; // Contains codec-specific key/value pairs for advanced tuning.
// If a codec uses a value, it must mark it as used.
// This array is NOT owned by avifCodec.
struct avifCodecInternal * internal; // up to each codec to use how it wants
//
avifDiagnostics * diag; // Shallow copy; owned by avifEncoder or avifDecoder
//
uint8_t operatingPoint; // Operating point, defaults to 0.
avifBool allLayers; // if true, the underlying codec must decode all layers, not just the best layer
avifCodecGetNextImageFunc getNextImage;
avifCodecEncodeImageFunc encodeImage;
avifCodecEncodeFinishFunc encodeFinish;
avifCodecDestroyInternalFunc destroyInternal;
} avifCodec;
avifResult avifCodecCreate(avifCodecChoice choice, avifCodecFlags requiredFlags, avifCodec ** codec);
void avifCodecDestroy(avifCodec * codec);
AVIF_NODISCARD avifCodec * avifCodecCreateAOM(void); // requires AVIF_CODEC_AOM (codec_aom.c)
const char * avifCodecVersionAOM(void); // requires AVIF_CODEC_AOM (codec_aom.c)
AVIF_NODISCARD avifCodec * avifCodecCreateDav1d(void); // requires AVIF_CODEC_DAV1D (codec_dav1d.c)
const char * avifCodecVersionDav1d(void); // requires AVIF_CODEC_DAV1D (codec_dav1d.c)
AVIF_NODISCARD avifCodec * avifCodecCreateGav1(void); // requires AVIF_CODEC_LIBGAV1 (codec_libgav1.c)
const char * avifCodecVersionGav1(void); // requires AVIF_CODEC_LIBGAV1 (codec_libgav1.c)
AVIF_NODISCARD avifCodec * avifCodecCreateRav1e(void); // requires AVIF_CODEC_RAV1E (codec_rav1e.c)
const char * avifCodecVersionRav1e(void); // requires AVIF_CODEC_RAV1E (codec_rav1e.c)
AVIF_NODISCARD avifCodec * avifCodecCreateSvt(void); // requires AVIF_CODEC_SVT (codec_svt.c)
const char * avifCodecVersionSvt(void); // requires AVIF_CODEC_SVT (codec_svt.c)
AVIF_NODISCARD avifCodec * avifCodecCreateAVM(void); // requires AVIF_CODEC_AVM (codec_avm.c)
const char * avifCodecVersionAVM(void); // requires AVIF_CODEC_AVM (codec_avm.c)
// your_sha256_hash-----------
// avifDiagnostics
#ifdef __clang__
__attribute__((__format__(__printf__, 2, 3)))
#endif
void avifDiagnosticsPrintf(avifDiagnostics * diag, const char * format, ...);
#if defined(AVIF_ENABLE_COMPLIANCE_WARDEN)
avifResult avifIsCompliant(const uint8_t * data, size_t size);
#endif
// your_sha256_hash-----------
// avifStream
//
// In network byte order (big-endian) unless otherwise specified.
typedef size_t avifBoxMarker;
typedef struct avifBoxHeader
{
// Size of the box in bytes, excluding the box header.
size_t size;
uint8_t type[4];
} avifBoxHeader;
typedef struct avifROStream
{
avifROData * raw;
// Index of the next byte in the raw stream.
size_t offset;
// If 0, byte-aligned functions can be used (avifROStreamRead() etc.).
// Otherwise, it represents the number of bits already used in the last byte
// (located at offset-1).
size_t numUsedBitsInPartialByte;
// Error information, if any.
avifDiagnostics * diag;
const char * diagContext;
} avifROStream;
const uint8_t * avifROStreamCurrent(avifROStream * stream);
void avifROStreamStart(avifROStream * stream, avifROData * raw, avifDiagnostics * diag, const char * diagContext);
size_t avifROStreamOffset(const avifROStream * stream);
void avifROStreamSetOffset(avifROStream * stream, size_t offset);
AVIF_NODISCARD avifBool avifROStreamHasBytesLeft(const avifROStream * stream, size_t byteCount);
size_t avifROStreamRemainingBytes(const avifROStream * stream);
// The following functions require byte alignment.
AVIF_NODISCARD avifBool avifROStreamSkip(avifROStream * stream, size_t byteCount);
AVIF_NODISCARD avifBool avifROStreamRead(avifROStream * stream, uint8_t * data, size_t size);
AVIF_NODISCARD avifBool avifROStreamReadU16(avifROStream * stream, uint16_t * v);
AVIF_NODISCARD avifBool avifROStreamReadU16Endianness(avifROStream * stream, uint16_t * v, avifBool littleEndian);
AVIF_NODISCARD avifBool avifROStreamReadU32(avifROStream * stream, uint32_t * v);
AVIF_NODISCARD avifBool avifROStreamReadU32Endianness(avifROStream * stream, uint32_t * v, avifBool littleEndian);
AVIF_NODISCARD avifBool avifROStreamReadUX8(avifROStream * stream, uint64_t * v, uint64_t factor); // Reads a factor*8 sized uint, saves in v
AVIF_NODISCARD avifBool avifROStreamReadU64(avifROStream * stream, uint64_t * v);
AVIF_NODISCARD avifBool avifROStreamReadString(avifROStream * stream, char * output, size_t outputSize);
AVIF_NODISCARD avifBool avifROStreamReadBoxHeader(avifROStream * stream, avifBoxHeader * header); // This fails if the size reported by the header cannot fit in the stream
AVIF_NODISCARD avifBool avifROStreamReadBoxHeaderPartial(avifROStream * stream, avifBoxHeader * header); // This doesn't require that the full box can fit in the stream
AVIF_NODISCARD avifBool avifROStreamReadVersionAndFlags(avifROStream * stream, uint8_t * version, uint32_t * flags); // version and flags ptrs are both optional
AVIF_NODISCARD avifBool avifROStreamReadAndEnforceVersion(avifROStream * stream, uint8_t enforcedVersion); // currently discards flags
// The following functions can write non-aligned bits.
AVIF_NODISCARD avifBool avifROStreamReadBits8(avifROStream * stream, uint8_t * v, size_t bitCount);
AVIF_NODISCARD avifBool avifROStreamReadBits(avifROStream * stream, uint32_t * v, size_t bitCount);
AVIF_NODISCARD avifBool avifROStreamReadVarInt(avifROStream * stream, uint32_t * v);
typedef struct avifRWStream
{
avifRWData * raw;
// Index of the next byte in the raw stream.
size_t offset;
// If 0, byte-aligned functions can be used (avifRWStreamWrite() etc.).
// Otherwise, it represents the number of bits already used in the last byte
// (located at offset-1).
size_t numUsedBitsInPartialByte;
} avifRWStream;
void avifRWStreamStart(avifRWStream * stream, avifRWData * raw);
size_t avifRWStreamOffset(const avifRWStream * stream);
void avifRWStreamSetOffset(avifRWStream * stream, size_t offset);
void avifRWStreamFinishWrite(avifRWStream * stream);
// The following functions require byte alignment.
avifResult avifRWStreamWrite(avifRWStream * stream, const void * data, size_t size);
avifResult avifRWStreamWriteChars(avifRWStream * stream, const char * chars, size_t size);
avifResult avifRWStreamWriteBox(avifRWStream * stream, const char * type, size_t contentSize, avifBoxMarker * marker);
avifResult avifRWStreamWriteFullBox(avifRWStream * stream, const char * type, size_t contentSize, int version, uint32_t flags, avifBoxMarker * marker);
void avifRWStreamFinishBox(avifRWStream * stream, avifBoxMarker marker);
avifResult avifRWStreamWriteU8(avifRWStream * stream, uint8_t v);
avifResult avifRWStreamWriteU16(avifRWStream * stream, uint16_t v);
avifResult avifRWStreamWriteU32(avifRWStream * stream, uint32_t v);
avifResult avifRWStreamWriteU64(avifRWStream * stream, uint64_t v);
avifResult avifRWStreamWriteZeros(avifRWStream * stream, size_t byteCount);
// The following functions can write non-aligned bits.
avifResult avifRWStreamWriteBits(avifRWStream * stream, uint32_t v, size_t bitCount);
avifResult avifRWStreamWriteVarInt(avifRWStream * stream, uint32_t v);
// This is to make it clear that the box size is currently unknown, and will be determined later (with a call to avifRWStreamFinishBox)
#define AVIF_BOX_SIZE_TBD 0
// Used for both av1C and av2C.
typedef struct avifCodecConfigurationBox
{
// [skipped; is constant] unsigned int (1)marker = 1;
// [skipped; is constant] unsigned int (7)version = 1;
uint8_t seqProfile; // unsigned int (3) seq_profile;
uint8_t seqLevelIdx0; // unsigned int (5) seq_level_idx_0;
uint8_t seqTier0; // unsigned int (1) seq_tier_0;
uint8_t highBitdepth; // unsigned int (1) high_bitdepth;
uint8_t twelveBit; // unsigned int (1) twelve_bit;
uint8_t monochrome; // unsigned int (1) monochrome;
uint8_t chromaSubsamplingX; // unsigned int (1) chroma_subsampling_x;
uint8_t chromaSubsamplingY; // unsigned int (1) chroma_subsampling_y;
uint8_t chromaSamplePosition; // unsigned int (2) chroma_sample_position;
// unsigned int (3)reserved = 0;
// unsigned int (1)initial_presentation_delay_present;
// if (initial_presentation_delay_present) {
// unsigned int (4)initial_presentation_delay_minus_one;
// } else {
// unsigned int (4)reserved = 0;
// }
} avifCodecConfigurationBox;
typedef struct avifSequenceHeader
{
uint8_t reduced_still_picture_header;
uint32_t maxWidth;
uint32_t maxHeight;
uint32_t bitDepth;
avifPixelFormat yuvFormat;
avifChromaSamplePosition chromaSamplePosition;
avifColorPrimaries colorPrimaries;
avifTransferCharacteristics transferCharacteristics;
avifMatrixCoefficients matrixCoefficients;
avifRange range;
avifCodecConfigurationBox av1C; // TODO(yguyon): Rename or add av2C
} avifSequenceHeader;
AVIF_NODISCARD avifBool avifSequenceHeaderParse(avifSequenceHeader * header, const avifROData * sample, avifCodecType codecType);
#if defined(AVIF_ENABLE_EXPERIMENTAL_GAIN_MAP)
// Performs tone mapping on a base image using the provided gain map.
// The HDR headroom is log2 of the ratio of HDR to SDR white brightness of the display to tone map for.
// 'toneMappedImage' should have the 'format', 'depth', and 'isFloat' fields set to the desired values.
// If non NULL, 'clli' will be filled with the light level information of the tone mapped image.
// NOTE: only used in tests for now, might be added to the public API at some point.
struct avifRGBImage;
avifResult avifImageApplyGainMap(const avifImage * baseImage,
const avifGainMap * gainMap,
float hdrHeadroom,
avifTransferCharacteristics outputTransferCharacteristics,
avifRGBImage * toneMappedImage,
avifContentLightLevelInformationBox * clli,
avifDiagnostics * diag);
// Same as above but takes an avifRGBImage as input instead of avifImage.
avifResult avifRGBImageApplyGainMap(const avifRGBImage * baseImage,
avifTransferCharacteristics transferCharacteristics,
const avifGainMap * gainMap,
float hdrHeadroom,
avifTransferCharacteristics outputTransferCharacteristics,
avifRGBImage * toneMappedImage,
avifContentLightLevelInformationBox * clli,
avifDiagnostics * diag);
// Computes a gain map between two images: a base image and an alternate image.
// Both images should have the same width and height, and use the same color
// primaries. TODO(maryla): allow different primaries.
// gainMap->image should be initialized with avifImageCreate(), with the width,
// height, depth and yuvFormat fields set to the desired output values for the
// gain map. All of these fields may differ from the source images.
AVIF_API avifResult avifComputeGainMapRGB(const struct avifRGBImage * baseRgbImage,
avifTransferCharacteristics baseTransferCharacteristics,
const struct avifRGBImage * altRgbImage,
avifTransferCharacteristics altTransferCharacteristics,
avifColorPrimaries colorPrimaries,
avifGainMap * gainMap,
avifDiagnostics * diag);
// Convenience function. Same as above but takes avifImage images as input
// instead of avifRGBImage. Gain map computation is performed in RGB space so
// the images are converted to RGB first.
AVIF_API avifResult avifComputeGainMap(const struct avifImage * baseImage,
const struct avifImage * altImage,
avifGainMap * gainMap,
avifDiagnostics * diag);
#endif // AVIF_ENABLE_EXPERIMENTAL_GAIN_MAP
#define AVIF_INDEFINITE_DURATION64 UINT64_MAX
#define AVIF_INDEFINITE_DURATION32 UINT32_MAX
#ifdef __cplusplus
} // extern "C"
#endif
#endif // ifndef AVIF_INTERNAL_H
```
|
El rosario is a 1944 Mexican romantic drama film directed by Juan José Ortega. The film is based on a novel by Florence L. Barclay. It stars Andrea Palma, Tomás Perrín, and Tana Devodier.
References
External links
1944 films
1944 romantic drama films
Mexican black-and-white films
Mexican romantic drama films
1940s Mexican films
|
Strasburg is a village in Shelby County, Illinois, United States. The population was 531 at the 2020 census.
Geography
According to the 2010 census, Strasburg has a total area of , all land.
Demographics
As of the census of 2000, there were 603 people, 208 households, and 139 families residing in the village. The population density was . There were 222 housing units at an average density of . The racial makeup of the village was 100.00% White. Hispanic or Latino of any race were 0.17% of the population.
There were 208 households, out of which 29.8% had children under the age of 18 living with them, 59.6% were married couples living together, 4.8% had a female householder with no husband present, and 32.7% were non-families. 30.3% of all households were made up of individuals, and 17.3% had someone living alone who was 65 years of age or older. The average household size was 2.40 and the average family size was 3.04.
In the village, the population was spread out, with 19.9% under the age of 18, 5.1% from 18 to 24, 21.6% from 25 to 44, 19.7% from 45 to 64, and 33.7% who were 65 years of age or older. The median age was 49 years. For every 100 females, there were 79.5 males. For every 100 females age 18 and over, there were 76.3 males.
The median income for a household in the village was $40,673, and the median income for a family was $43,750. Males had a median income of $28,750 versus $21,313 for females. The per capita income for the village was $16,102. About 6.0% of families and 6.0% of the population were below the poverty line, including 5.6% of those under age 18 and 9.0% of those age 65 or over.
References
Further reading
- History of the village's first 100 years
External links
Villages in Shelby County, Illinois
Villages in Illinois
|
```python
import pytest
async def test_can_init_bot(red):
assert red is not None
```
|
Charlie Bird Explores is the title of a series of documentary films shot by RTÉ News and Current Affairs chief news correspondent Charlie Bird, in which the reporter sets off to explore some of the most beautiful and remote places in the far corners of the planet Earth and moans about having to do so. The series broadcast over a number of years features Bird's adventures in the Arctic, the Ganges and the Amazon. The documentaries are produced by Crossing the Line Films.
For his Amazon journey, Bird crossed South America from ocean to ocean, tracing the course of the Amazon River, and somewhat annoyingly to many viewers, complained about everything associated with the Amazon along the way. En route he tells the story of this region and how it plays a crucial role in global warming and environmental change. For his Ganges trek, Bird took a path from the sea to the river's source, battling from the Bay of Bengal to the Himalayas along the river. In the Arctic, filmed in 2008, Bird met the Inuit community in Grise Fiord, Nunavut.
References
External links
Charlie Bird Explores at RTÉ Television
Irish documentary television series
RTÉ original programming
|
```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 v1beta1
import (
metav1 "k8s.io/apimachinery/pkg/apis/meta/v1"
"k8s.io/apimachinery/pkg/runtime"
"k8s.io/apimachinery/pkg/runtime/schema"
)
// GroupName is the group name use in this package
const GroupName = "authorization.k8s.io"
// SchemeGroupVersion is group version used to register these objects
var SchemeGroupVersion = schema.GroupVersion{Group: GroupName, Version: "v1beta1"}
// Resource takes an unqualified resource and returns a Group qualified GroupResource
func Resource(resource string) schema.GroupResource {
return SchemeGroupVersion.WithResource(resource).GroupResource()
}
var (
// TODO: move SchemeBuilder with zz_generated.deepcopy.go to k8s.io/api.
// localSchemeBuilder and AddToScheme will stay in k8s.io/kubernetes.
SchemeBuilder runtime.SchemeBuilder
localSchemeBuilder = &SchemeBuilder
AddToScheme = localSchemeBuilder.AddToScheme
)
func init() {
// We only register manually written functions here. The registration of the
// generated functions takes place in the generated files. The separation
// makes the code compile even when the generated files are missing.
localSchemeBuilder.Register(addKnownTypes, addDefaultingFuncs, addConversionFuncs)
}
// Adds the list of known types to api.Scheme.
func addKnownTypes(scheme *runtime.Scheme) error {
scheme.AddKnownTypes(SchemeGroupVersion,
&SelfSubjectAccessReview{},
&SubjectAccessReview{},
&LocalSubjectAccessReview{},
)
metav1.AddToGroupVersion(scheme, SchemeGroupVersion)
return nil
}
```
|
Minino () is a rural locality (a village) in Kubenskoye Rural Settlement, Vologodsky District, Vologda Oblast, Russia. The population was 42 as of 2002.
Geography
The distance to Vologda is 45 km, to Kubenskoye is 17 km. Voronino is the nearest rural locality.
References
Rural localities in Vologodsky District
|
```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 storage
import (
"context"
"errors"
"fmt"
"io"
"net"
"net/http"
"net/url"
"strings"
"cloud.google.com/go/internal"
"cloud.google.com/go/internal/version"
sinternal "cloud.google.com/go/storage/internal"
"github.com/google/uuid"
gax "github.com/googleapis/gax-go/v2"
"google.golang.org/api/googleapi"
"google.golang.org/grpc/codes"
"google.golang.org/grpc/status"
)
var defaultRetry *retryConfig = &retryConfig{}
var xGoogDefaultHeader = fmt.Sprintf("gl-go/%s gccl/%s", version.Go(), sinternal.Version)
// run determines whether a retry is necessary based on the config and
// idempotency information. It then calls the function with or without retries
// as appropriate, using the configured settings.
func run(ctx context.Context, call func() error, retry *retryConfig, isIdempotent bool, setHeader func(string, int)) error {
attempts := 1
invocationID := uuid.New().String()
if retry == nil {
retry = defaultRetry
}
if (retry.policy == RetryIdempotent && !isIdempotent) || retry.policy == RetryNever {
setHeader(invocationID, attempts)
return call()
}
bo := gax.Backoff{}
if retry.backoff != nil {
bo.Multiplier = retry.backoff.Multiplier
bo.Initial = retry.backoff.Initial
bo.Max = retry.backoff.Max
}
var errorFunc func(err error) bool = ShouldRetry
if retry.shouldRetry != nil {
errorFunc = retry.shouldRetry
}
return internal.Retry(ctx, bo, func() (stop bool, err error) {
setHeader(invocationID, attempts)
err = call()
attempts++
return !errorFunc(err), err
})
}
func setRetryHeaderHTTP(req interface{ Header() http.Header }) func(string, int) {
return func(invocationID string, attempts int) {
if req == nil {
return
}
header := req.Header()
// TODO(b/274504690): Consider dropping gccl-invocation-id key since it
// duplicates the X-Goog-Gcs-Idempotency-Token header (added in v1.31.0).
invocationHeader := fmt.Sprintf("gccl-invocation-id/%v gccl-attempt-count/%v", invocationID, attempts)
xGoogHeader := strings.Join([]string{invocationHeader, xGoogDefaultHeader}, " ")
header.Set("x-goog-api-client", xGoogHeader)
// Also use the invocationID for the idempotency token header, which will
// enable idempotent retries for more operations.
header.Set("x-goog-gcs-idempotency-token", invocationID)
}
}
// TODO: Implement method setting header via context for gRPC
func setRetryHeaderGRPC(_ context.Context) func(string, int) {
return func(_ string, _ int) {
return
}
}
// ShouldRetry returns true if an error is retryable, based on best practice
// guidance from GCS. See
// path_to_url#go for more information
// on what errors are considered retryable.
//
// If you would like to customize retryable errors, use the WithErrorFunc to
// supply a RetryOption to your library calls. For example, to retry additional
// errors, you can write a custom func that wraps ShouldRetry and also specifies
// additional errors that should return true.
func ShouldRetry(err error) bool {
if err == nil {
return false
}
if errors.Is(err, io.ErrUnexpectedEOF) {
return true
}
switch e := err.(type) {
case *net.OpError:
if strings.Contains(e.Error(), "use of closed network connection") {
// TODO: check against net.ErrClosed (go 1.16+) instead of string
return true
}
case *googleapi.Error:
// Retry on 408, 429, and 5xx, according to
// path_to_url
return e.Code == 408 || e.Code == 429 || (e.Code >= 500 && e.Code < 600)
case *url.Error:
// Retry socket-level errors ECONNREFUSED and ECONNRESET (from syscall).
// Unfortunately the error type is unexported, so we resort to string
// matching.
retriable := []string{"connection refused", "connection reset"}
for _, s := range retriable {
if strings.Contains(e.Error(), s) {
return true
}
}
case interface{ Temporary() bool }:
if e.Temporary() {
return true
}
}
// UNAVAILABLE, RESOURCE_EXHAUSTED, and INTERNAL codes are all retryable for gRPC.
if st, ok := status.FromError(err); ok {
if code := st.Code(); code == codes.Unavailable || code == codes.ResourceExhausted || code == codes.Internal {
return true
}
}
// Unwrap is only supported in go1.13.x+
if e, ok := err.(interface{ Unwrap() error }); ok {
return ShouldRetry(e.Unwrap())
}
return false
}
```
|
```javascript
(window["webpackJsonp"] = window["webpackJsonp"] || []).push([["react-syntax-highlighter_languages_highlight_pony"],{
/***/ "./node_modules/highlight.js/lib/languages/pony.js":
/*!*********************************************************!*\
!*** ./node_modules/highlight.js/lib/languages/pony.js ***!
\*********************************************************/
/*! no static exports found */
/***/ (function(module, exports) {
module.exports = function(hljs) {
var KEYWORDS = {
keyword:
'actor addressof and as be break class compile_error compile_intrinsic ' +
'consume continue delegate digestof do else elseif embed end error ' +
'for fun if ifdef in interface is isnt lambda let match new not object ' +
'or primitive recover repeat return struct then trait try type until ' +
'use var where while with xor',
meta:
'iso val tag trn box ref',
literal:
'this false true'
};
var TRIPLE_QUOTE_STRING_MODE = {
className: 'string',
begin: '"""', end: '"""',
relevance: 10
};
var QUOTE_STRING_MODE = {
className: 'string',
begin: '"', end: '"',
contains: [hljs.BACKSLASH_ESCAPE]
};
var SINGLE_QUOTE_CHAR_MODE = {
className: 'string',
begin: '\'', end: '\'',
contains: [hljs.BACKSLASH_ESCAPE],
relevance: 0
};
var TYPE_NAME = {
className: 'type',
begin: '\\b_?[A-Z][\\w]*',
relevance: 0
};
var PRIMED_NAME = {
begin: hljs.IDENT_RE + '\'', relevance: 0
};
var NUMBER_MODE = {
className: 'number',
begin: '(-?)(\\b0[xX][a-fA-F0-9]+|\\b0[bB][01]+|(\\b\\d+(_\\d+)?(\\.\\d*)?|\\.\\d+)([eE][-+]?\\d+)?)',
relevance: 0
};
/**
* The `FUNCTION` and `CLASS` modes were intentionally removed to simplify
* highlighting and fix cases like
* ```
* interface Iterator[A: A]
* fun has_next(): Bool
* fun next(): A?
* ```
* where it is valid to have a function head without a body
*/
return {
keywords: KEYWORDS,
contains: [
TYPE_NAME,
TRIPLE_QUOTE_STRING_MODE,
QUOTE_STRING_MODE,
SINGLE_QUOTE_CHAR_MODE,
PRIMED_NAME,
NUMBER_MODE,
hljs.C_LINE_COMMENT_MODE,
hljs.C_BLOCK_COMMENT_MODE
]
};
};
/***/ })
}]);
//# sourceMappingURL=react-syntax-highlighter_languages_highlight_pony.js.map
```
|
```objective-c
/*
*
*/
#include <zephyr/kernel.h>
/* Value of 0 will cause the IP stack to select next free port */
#define MY_PORT 0
#define PEER_PORT 4242
/* Turn off the progress printing so that shell can be used.
* Set to true if you want to see progress output.
*/
#define PRINT_PROGRESS false
#if defined(CONFIG_USERSPACE)
#include <zephyr/app_memory/app_memdomain.h>
extern struct k_mem_partition app_partition;
extern struct k_mem_domain app_domain;
#define APP_BMEM K_APP_BMEM(app_partition)
#define APP_DMEM K_APP_DMEM(app_partition)
#else
#define APP_BMEM
#define APP_DMEM
#endif
#if defined(CONFIG_NET_TC_THREAD_PREEMPTIVE)
#define THREAD_PRIORITY K_PRIO_PREEMPT(8)
#else
#define THREAD_PRIORITY K_PRIO_COOP(CONFIG_NUM_COOP_PRIORITIES - 1)
#endif
#define UDP_STACK_SIZE 2048
struct udp_control {
struct k_poll_signal tx_signal;
struct k_timer tx_timer;
struct k_timer rx_timer;
};
struct data {
const char *proto;
struct {
int sock;
uint32_t expecting;
uint32_t counter;
uint32_t mtu;
struct udp_control *ctrl;
} udp;
struct {
int sock;
uint32_t expecting;
uint32_t received;
uint32_t counter;
} tcp;
};
struct configs {
struct data ipv4;
struct data ipv6;
};
#if !defined(CONFIG_NET_CONFIG_PEER_IPV4_ADDR)
#define CONFIG_NET_CONFIG_PEER_IPV4_ADDR ""
#endif
#if !defined(CONFIG_NET_CONFIG_PEER_IPV6_ADDR)
#define CONFIG_NET_CONFIG_PEER_IPV6_ADDR ""
#endif
extern const char lorem_ipsum[];
extern const int ipsum_len;
extern struct configs conf;
#if defined(CONFIG_NET_UDP)
/* init_udp initializes kernel objects, hence it has to be called from
* supervisor thread.
*/
void init_udp(void);
int start_udp(void);
int process_udp(void);
void stop_udp(void);
#else
static inline void init_udp(void) { }
static inline int start_udp(void) { return 0; }
static inline int process_udp(void) { return 0; }
static inline void stop_udp(void) { }
#endif /* defined(CONFIG_NET_UDP) */
int start_tcp(void);
int process_tcp(void);
void stop_tcp(void);
#if defined(CONFIG_NET_VLAN)
int init_vlan(void);
#else
static inline int init_vlan(void)
{
return 0;
}
#endif
```
|
"The Water That Falls on You from Nowhere" is a 2013 science fiction/magic realism short story by American writer John Chu. It was first published on Tor.com, after being purchased by editor Ann VanderMeer, and subsequently republished in Wilde Stories 2014. As well, Chu has read the story aloud for the StarShipSofa podcast.
Plot summary
Some weeks prior to the beginning of the story, an unexplained phenomenon begins worldwide: whenever a person lies, water falls on that person from nowhere. Phrasing a potential lie as a question does not cause water to fall, while stating an untruth that one believes to be true does. Conversely, profound or universal truths can actually remove moisture from the air.
In the midst of this phenomenon, Matt decides to come out to his traditional Chinese family after his partner, Gus, refuses to marry him until he does.
Reception
"The Water That Falls on You from Nowhere" won the 2014 Hugo Award for Best Short Story. The Guardian called it "deeply personal", while Lambda Literary said it was a "standout". Kirkus Reviews described it as "so beautiful it hurts;" however, the Los Angeles Review of Books described it as "(u)ndoubtedly sweet but also rather sappy."
References
2014 short stories
American short stories
Hugo Award for Best Short Story winning works
Science fiction short stories
LGBT short stories
LGBT literature in the United States
LGBT speculative fiction
2010s LGBT literature
|
Castel Giubileo is the second Zone of Rome in the Ager Romanus, identified as Z. II.
History
The history of the current Castel Giubileo dates back directly to the ancient city of Fidenae which, based on archaeological evidence, was built around the 11th century BC in an extremely important strategic position between Via Salaria and Via Nomentana.
From here, it dominated the commercial routes between Etruria, Sabina and southern Italy, as well as the navigable stretch of the Tiber, where the commercial traffic took place.
The settlement, surrounded by walls, extended its control also to the area of Monte Sacro and was flourishing – above all in consideration of the fertility of the soil (due to the proximity to the river and the presence of volcanic debris or Tuffs) – even before the foundation of Rome.
In 1280 the area belonged to the monastery of St. Cyriacus.
Later, the castle (castrum) was purchased by Pope Boniface VIII, maybe with the proceeds from the 1300 Jubilee; hence the origin of the name Castel Giubileo is commonly assumed. Actually the name derives from that of the Giubilei family from the rione Trevi, to which a certain Buzio di Giubileo belonged still in 1371.
Due to the strategic importance of its location, the condottiero Paolo Orsini attacked and occupied it in 1406. Stories of looting and depredations continued in the following periods, thus decreeding the complete abandonment of the Castle until the end of the 19th century, when it began to be used for agricultural purposes.
The present urban settlement was built after World War II by immigrants coming from many Italian regions, including the first Venetian farmhands, called by Mussolini for the reclamation of the Ager Romanus.
The Castel Giubileo train wreck
On 12 August 1900, at. 11:51 pm, the area was the scene of a serious train wreck, which occurred along the Florence-Rome railway.
A failure to report a train, which had stopped due to a breakdown, caused a rear-end collision with twenty victims and a hundred injured.
The disaster had great resonance at the time, as the crashed train was transporting the foreign delegations who had just attended the funeral of King Umberto I and the subsequent coronation of Victor Emmanuel III.
Among the victims was the Baron Giuseppe Baratelli, Senator of the Kingdom, to whom Alfredo Oriani dedicated his book Ombre di occaso.
Among the other passengers involved in the wreck there was the Duke of Oporto, the Turkish delegation and the representative of the King of Belgium, who suffered the fracture of both legs.
Geography
The zone is located in the northern area of the city, close to and inside the Grande Raccordo Anulare. The territory of Castel Giubileo includes the urban zones 4D Fidene, 4E Serpentara and part of the urban zone 4L Aeroporto dell'Urbe.
The historical village of Castel Giubileo, wedged between the Via Salaria and the river Tiber, is made up of three small, distinct cores, one of which is located on the low hill where the homonymous castle rises.
The two cores at the foot of the hill converge in a larger one in the north, structured according to a sequence of parallel streets between two main roads (Via Grottazzolina and Via Montappone) which can be regarded as the main axes of the settlement. At the western end of this area there are small artisan businesses and some hotels. The commercial area (very modest in size) extends along the axis in the south.
Another housing complex is located close to the bank of the Tiber: here there is a primary school and a nursery.
The shopping center Galleria Porta di Roma, surrounded by Via Casale Redicicoli, on the border with Casal Boccone, was inaugurated in 2007.
Boundaries
Castel Giubileo borders northward with Zona Marcigliana (Z.III), whose boundary is marked by a stretch of the Grande Raccordo Anulare, between Ponte di Castel Giubileo and Via di Settebagni.
Eastward, the zone borders with Zona Casal Boccone (Z. IV), from which is separated by Via di Settebagni (near the Grande Raccordo Anulare), Viale Franco Arcalli, Piazza Giulietta Masina, Via Elsa de' Giorgi, Via Giuseppe De Santis and Via delle Vigne Nuove up to the Viadotto Antonio Segni.
To the south, it borders with Zona Val Melaina (Z. I): the border is marked by Viadotto Antonio Segni up to Via Giacomo Brodolini, then by the latter up to Via Gaetano Martino, by Via Pian di Scò ; from here, as the crow flies, to the river Tiber .
To the west, Castel Giubileo borders with Zona Grottarossa (Z. LVI), from which is separated by the Tiber, up to the Ponte di Castel Giubileo (Grande Raccordo Anulare).
Historical subdivisions
The frazioni of Colle Salario and Villa Spada belong to the territory of Castel Giubileo.
Odonymy
In addition to the odonyms of the area of Fidene (municipalities of Tuscany), Colle Salario (municipalities of Marche), streets and squares are mainly dedicated to actors and directors (particularly in the area of Serpentara) and to opera singers. In the frazione of Villa Spada, there is a group of streets named after religious personalities. Odonyms of the zone can be categorized as follows:
Actors, e.g. Via Ferruccio Amendola, Via Rosina Anselmi, Viale Cesco Baseggio, Viale Carmelo Bene, Largo Lyda Borelli, Via Ernesto Calindri, Via Mario Castellani, Via Adolfo Celi, Viale Gino Cervi, Via Luigi Cimara, Viale Titina De Filippo, Via Elsa De Giorgi, Via Tina Di Lorenzo, Via Franco Fabrizi, Via Franco Franchi, Via Sylva Koscina, Via Alberto Lionello, Piazza Giulietta Masina, Via Maria Melato, Largo Rina Morelli, Via Tina Pica, Via Salvo Randone, Via Stefano Satta Flores, Via Sergio Tofano, Via Gian Maria Volonté;
Directors, e.g. Via Carlo Ludovico Bragaglia, Via Leonardo De Mitri, Via Giuseppe De Santis, Via Fratelli Corbucci (dedicated to brothers Bruno and Sergio Corbucci), Via Alberto Lattuada, Via Nanni Loy, Via Giorgio Moser, Via Elvira Notari, Via Mario Soldati;
Film producers, e.g. Via Giuseppe Amato, Via Goffredo Lombardo;
Opera singers, e.g. Via Matteo Babini, Via Cesare Badiali, Piazza Marianna Benti Bulgarelli, Viale Lina Cavalieri, Via Nazzareno De Angelis, Piazza Fernando De Lucia, Via Bernardo De Muro, Via Mario Del Monaco, Largo Cloe Elmo, Via Erminia Frezzolini, Via Edoardo Garbin, Via Luigi Lablache, Via Gaspare Pacchiarotti, Via Ezio Pinza, Via Tito Schipa, Via Sorelle Tetrazzini (dedicated to the sisters Eva and Luisa Tetrazzini);
Religious figures, e.g. Via San Bernardino da Siena, Via Gaspare Bertoni, Via Maria Elena Bettini, Via Ludovico da Casoria, Via Francesco Antonio Marcucci, Via Annibale Maria di Francia, Via San Massimiliano Kolbe, Via San Pietro Parenzo;
Singers and songwriters, e.g. Via Rino Gaetano, Largo Luigi Tenco;
Towns of Marche, e.g. Largo Borgo Pace, Via Camerata Picena, Via Castelsantangelo sul Nera, Via Comunanza, Via Cupramontana, Via Fiastra, Via Grottazzolina, Via Montappone, Via Monte Giberto, Via Monte Urano, Largo Montedinove, Via Rapagnano, Largo Santa Vittoria in Matenano, Via Serrapetrona;
Towns of Tuscany, e.g. Via Altopascio, Via Barberino di Mugello, Via Cortona, Via Incisa Valdarno, Via Lajatico, Via Pieve a Nievole, Via Quarrata, Via Radicofani, Via Rio nell'Elba, Via Sambuca Pistoiese, Via San Gimignano, Via Sansepolcro, Piazza Stia, Via Vernio;
TV hosts, e.g. Via Corrado Mantoni.
The area is crossed by a viaduct, three sections of which are dedicated to the presidents of the Italian Republic Sandro Pertini, Antonio Segni and Giuseppe Saragat.
Infrastructures and transports
The Fidene railway station, which is located along the Florence–Rome railway, is served by regional trains managed by Trenitalia on the basis of the contract of service stipulated with the Lazio Region.
Between 1906 and 1932 the locality was also served by a stop of the Rome-Civita Castellana tramway, managed by Società Romana per le Ferrovie del Nord (SRFN).
Places of interest
Civil buildings
Castel Giubileo, in Salita di Castel Giubileo. A 14th-century castle.
Casale di Villa Spada, in Via Piteglio. A 19th-century farmhouse.
Ponte di Castel Giubileo, a bridge of the Grande Raccordo Anulare on the river Tiber, opened in 1951.
Religious buildings
Santa Felicita e figli martiri, in Via Don Giustino Maria Russolillo.
Parish church erected on 16 July 1958 according to the decree "Sanctissimus dominus" by Cardinal Vicar Clemente Micara.
Santi Crisante e Daria, in Via Castignano.
Parish church erected on 1 July 1964 according to the decree "Quo pastorali studio" by Cardinal Vicar Clemente Micara.
Sant'Innocenzo I papa e San Guido vescovo, in via Radicofani.
Parish church erected on 1 March 1981 by decree of Cardinal Vicar Ugo Poletti.
Sant'Alberto Magno, in Via delle Vigne Nuove.
Parish church erected on 1 September 1983 according to the decree "Seguendo l'esempio" by Cardinal Vicar Ugo Poletti.
Sant'Ugo, in Viale Lina Cavalieri.
San Giovanni della Croce a Colle Salario, in via Apecchio.
Archaeological sites
Protohistoric house of Fidenae, in Via Quarrata. A house built in the 9th century BC.
Villa of Via Serrapetrona, in Via Serrapetrona. A 2nd-century BC villa.
Villa of Castel Giubileo (site I), in Via Force. A 1st-century BC villa.
Villa of Castel Giubileo (site XV), in Via Piagge and Via Monteciccardo. A 1st-century BC villa.
Villa of Tenuta Serpentara (site 1), in Via dei Colli della Serpentara. A 1st-century BC villa.
Villa of Tenuta Serpentara (site 2), in Via dei Colli della Serpentara. A 1st-century BC villa.
Villa of Via Cesco Baseggio, in Viale Cesco Baseggio. A 1st-century BC villa.
Paleochristian basilica Beati Arcangeli in Septimo, in Salita di Castel Giubileo. A basilica of the imperial age.
Roman cistern of Villa Spada, in Via Maria Elena Bettini. A cistern of the imperial age.
Museums
Museo della carta, della stampa e dell'informazione, in via Salaria.
Nature areas
Parco Carlo Marzano, in Via Virgilio Talli.
Parco delle Betulle, in Viale Lina Cavalieri.
Parco di Largo Labia, in Largo Fausta Labia.
Notes
Bibliography
External links
Zones of Rome
|
Stratis Stratigis (; 17 August 1933 – 16 February 2023) was a Greek lawyer and politician. A member of New Democracy, he served in the Hellenic Parliament from 1985 to 1989.
Stratigis died in Athens on 16 February 2023, at the age of 89.
References
1933 births
2023 deaths
Greek MPs 1985–1989
New Democracy (Greece) politicians
University of Basel alumni
Alumni of the London School of Economics
Politicians from Athens
|
```makefile
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* This Source Code Form is subject to the terms of the Mozilla Public
* file, You can obtain one at path_to_url */
/*
* javascript provider probes
*
* function-entry (filename, classname, funcname)
* function-return (filename, classname, funcname)
* object-create (classname, *object)
* object-finalize (NULL, classname, *object)
* execute-start (filename, lineno)
* execute-done (filename, lineno)
*/
provider javascript {
probe function__entry(const char *, const char *, const char *);
probe function__return(const char *, const char *, const char *);
/* XXX must use unsigned longs here instead of uintptr_t for OS X
(Apple radar: 5194316 & 5565198) */
probe object__create(const char *, unsigned long);
probe object__finalize(const char *, const char *, unsigned long);
probe execute__start(const char *, int);
probe execute__done(const char *, int);
};
/*
#pragma D attributes Unstable/Unstable/Common provider mozilla provider
#pragma D attributes Private/Private/Unknown provider mozilla module
#pragma D attributes Private/Private/Unknown provider mozilla function
#pragma D attributes Unstable/Unstable/Common provider mozilla name
*/
```
|
Death Is This Communion (stylized as Death•Is•This•Communion•) is the fourth studio album by American heavy metal band High on Fire. It was released on September 10, 2007 in Europe and September 18 in the United States. The first pressing includes a bonus DVD featuring in-studio footage of the making of the album. It is the first album to feature Jeff Matz on bass guitar. Frontman Matt Pike noted that the album's lyrics were influenced by David Icke, H. P. Lovecraft, and the Bible.
The album has received generally good reviews, with an average rating of 80 on Metacritic.
It was named the third-best album of the year by Revolver. Total Guitar named it fourth in their "50 Best Guitar Albums of the Year". It came in at number 9 in Metal Hammers best of 2007 list.
Track listing
All tracks written by High on Fire.
Credits
Matt Pike – guitar, vocals
Jeff Matz – bass
Des Kensel – drums
Jack Endino – production, engineering and mixing
Alan Douches – mastering
Arik Roper – album cover
References
2007 albums
Relapse Records albums
High on Fire albums
Albums produced by Jack Endino
|
```ruby
# frozen_string_literal: true
class AddStorageSchemaVersion < ActiveRecord::Migration[5.2]
def change
add_column :preview_cards, :image_storage_schema_version, :integer
safety_assured do
change_table(:accounts, bulk: true) do |t|
t.column :avatar_storage_schema_version, :integer
t.column :header_storage_schema_version, :integer
end
end
add_column :media_attachments, :file_storage_schema_version, :integer
add_column :custom_emojis, :image_storage_schema_version, :integer
end
end
```
|
Abaca bract mosaic virus (ABrMV) is a plant pathogenic virus of the family Potyviridae. Attempts have been made to sequence ABrMV.
The virus is said to be a significant pathogen of the abaca, along with the Abaca bunchy top virus.
Banana bract mosaic virus also infects the abaca, but it is unknown whether the two viruses are related. Another source describes the main viral pathogens of the abaca as the banana bract mosaic virus and the sugarcane mosaic virus, without mentioning this name at all.
References
Viral plant pathogens and diseases
Potyviruses
|
```xml
import i18n from "i18n-js"
import React from "react"
import { StyleProp, Text as RNText, TextProps as RNTextProps, TextStyle } from "react-native"
import { isRTL, translate, TxKeyPath } from "app/i18n"
import { colors, typography } from "app/theme"
type Sizes = keyof typeof $sizeStyles
type Weights = keyof typeof typography.primary
type Presets = keyof typeof $presets
export interface TextProps extends RNTextProps {
/**
* Text which is looked up via i18n.
*/
tx?: TxKeyPath
/**
* The text to display if not using `tx` or nested components.
*/
text?: string
/**
* Optional options to pass to i18n. Useful for interpolation
* as well as explicitly setting locale or translation fallbacks.
*/
txOptions?: i18n.TranslateOptions
/**
* An optional style override useful for padding & margin.
*/
style?: StyleProp<TextStyle>
/**
* One of the different types of text presets.
*/
preset?: Presets
/**
* Text weight modifier.
*/
weight?: Weights
/**
* Text size modifier.
*/
size?: Sizes
/**
* Children components.
*/
children?: React.ReactNode
}
/**
* For your text displaying needs.
* This component is a HOC over the built-in React Native one.
*
* - [Documentation and Examples](path_to_url
*/
export function Text(props: TextProps) {
const { weight, size, tx, txOptions, text, children, style: $styleOverride, ...rest } = props
const i18nText = tx && translate(tx, txOptions)
const content = i18nText || text || children
const preset: Presets = props.preset ?? "default"
const $styles: StyleProp<TextStyle> = [
$rtlStyle,
$presets[preset],
weight && $fontWeightStyles[weight],
size && $sizeStyles[size],
$styleOverride,
]
return (
<RNText {...rest} style={$styles}>
{content}
</RNText>
)
}
const $sizeStyles = {
xxl: { fontSize: 36, lineHeight: 44 } satisfies TextStyle,
xl: { fontSize: 24, lineHeight: 34 } satisfies TextStyle,
lg: { fontSize: 20, lineHeight: 32 } satisfies TextStyle,
md: { fontSize: 18, lineHeight: 26 } satisfies TextStyle,
sm: { fontSize: 16, lineHeight: 24 } satisfies TextStyle,
xs: { fontSize: 14, lineHeight: 21 } satisfies TextStyle,
xxs: { fontSize: 12, lineHeight: 18 } satisfies TextStyle,
}
const $fontWeightStyles = Object.entries(typography.primary).reduce((acc, [weight, fontFamily]) => {
return { ...acc, [weight]: { fontFamily } }
}, {}) as Record<Weights, TextStyle>
const $baseStyle: StyleProp<TextStyle> = [
$sizeStyles.sm,
$fontWeightStyles.normal,
{ color: colors.text },
]
const $presets = {
default: $baseStyle,
bold: [$baseStyle, $fontWeightStyles.bold] as StyleProp<TextStyle>,
heading: [$baseStyle, $sizeStyles.xxl, $fontWeightStyles.bold] as StyleProp<TextStyle>,
subheading: [$baseStyle, $sizeStyles.lg, $fontWeightStyles.medium] as StyleProp<TextStyle>,
formLabel: [$baseStyle, $fontWeightStyles.medium] as StyleProp<TextStyle>,
formHelper: [$baseStyle, $sizeStyles.sm, $fontWeightStyles.normal] as StyleProp<TextStyle>,
}
const $rtlStyle: TextStyle = isRTL ? { writingDirection: "rtl" } : {}
```
|
Tint magazine was a quarterly global zine and independent magazine published in Detroit, Michigan. Its motto "Celebrating Women of Every Color" targeted all women, the magazine typically covered issues from the voices of women of color, and often from a politically left-wing perspective.
Tint began as a multicultural women's webzine, first published in 2004 by then college freshman Margarita L. Barry on the campus of Bowling Green State University in Bowling Green, Ohio. Created as a response to the lack of diverse faces and voices in mainstream women's publications, the first issue of Tint was launched in PDF format online that May. Barry never intended for the magazine to be a campus publication, though a misquote in the university's weekly newspaper, The BG News, hinted otherwise. The print edition of Tint was published twice per year.
Tint has been loosely linked to several subcultures and movements, including Transculturation, DIY Culture, Arts and Crafts Movement, Anarcho-punk, Afro-punk, Zine, Feminism, Black Feminism, Grassroots, and Activism.
Tint featured cover stories on a unique blend of women including actress/vocalist Alisa Reyes, actress/vocalist Persia White, and recording artist Goapele, all celebrities of multiethnic heritages with notable grassroots arts or activism involvement. In addition to celebrity interviews, Tint also featured stories on everyday women.
References
External links
Tint Magazine′s Official Site
Team Tint Yahoo Group
ColoredgURL.com Affiliate Site/Parent Host
African-American magazines
Biannual magazines published in the United States
Fanzines
Fashion magazines published in the United States
Lifestyle magazines published in the United States
Magazines established in 2004
Magazines published in Detroit
Magazines published in Ohio
Political magazines published in the United States
Quarterly magazines published in the United States
Women's magazines published in the United States
|
```shell
#!/bin/sh
set -e
echo "mkdir -p ${CONFIGURATION_BUILD_DIR}/${FRAMEWORKS_FOLDER_PATH}"
mkdir -p "${CONFIGURATION_BUILD_DIR}/${FRAMEWORKS_FOLDER_PATH}"
SWIFT_STDLIB_PATH="${DT_TOOLCHAIN_DIR}/usr/lib/swift/${PLATFORM_NAME}"
install_framework()
{
if [ -r "${BUILT_PRODUCTS_DIR}/$1" ]; then
local source="${BUILT_PRODUCTS_DIR}/$1"
elif [ -r "${BUILT_PRODUCTS_DIR}/$(basename "$1")" ]; then
local source="${BUILT_PRODUCTS_DIR}/$(basename "$1")"
elif [ -r "$1" ]; then
local source="$1"
fi
local destination="${TARGET_BUILD_DIR}/${FRAMEWORKS_FOLDER_PATH}"
if [ -L "${source}" ]; then
echo "Symlinked..."
source="$(readlink "${source}")"
fi
# use filter instead of exclude so missing patterns dont' throw errors
echo "rsync -av --filter \"- CVS/\" --filter \"- .svn/\" --filter \"- .git/\" --filter \"- .hg/\" --filter \"- Headers\" --filter \"- PrivateHeaders\" --filter \"- Modules\" \"${source}\" \"${destination}\""
rsync -av --filter "- CVS/" --filter "- .svn/" --filter "- .git/" --filter "- .hg/" --filter "- Headers" --filter "- PrivateHeaders" --filter "- Modules" "${source}" "${destination}"
local basename
basename="$(basename -s .framework "$1")"
binary="${destination}/${basename}.framework/${basename}"
if ! [ -r "$binary" ]; then
binary="${destination}/${basename}"
fi
# Strip invalid architectures so "fat" simulator / device frameworks work on device
if [[ "$(file "$binary")" == *"dynamically linked shared library"* ]]; then
strip_invalid_archs "$binary"
fi
# Resign the code if required by the build settings to avoid unstable apps
code_sign_if_enabled "${destination}/$(basename "$1")"
# Embed linked Swift runtime libraries. No longer necessary as of Xcode 7.
if [ "${XCODE_VERSION_MAJOR}" -lt 7 ]; then
local swift_runtime_libs
swift_runtime_libs=$(xcrun otool -LX "$binary" | grep --color=never @rpath/libswift | sed -E s/@rpath\\/\(.+dylib\).*/\\1/g | uniq -u && exit ${PIPESTATUS[0]})
for lib in $swift_runtime_libs; do
echo "rsync -auv \"${SWIFT_STDLIB_PATH}/${lib}\" \"${destination}\""
rsync -auv "${SWIFT_STDLIB_PATH}/${lib}" "${destination}"
code_sign_if_enabled "${destination}/${lib}"
done
fi
}
# Signs a framework with the provided identity
code_sign_if_enabled() {
if [ -n "${EXPANDED_CODE_SIGN_IDENTITY}" -a "${CODE_SIGNING_REQUIRED}" != "NO" -a "${CODE_SIGNING_ALLOWED}" != "NO" ]; then
# Use the current code_sign_identitiy
echo "Code Signing $1 with Identity ${EXPANDED_CODE_SIGN_IDENTITY_NAME}"
echo "/usr/bin/codesign --force --sign ${EXPANDED_CODE_SIGN_IDENTITY} ${OTHER_CODE_SIGN_FLAGS} --preserve-metadata=identifier,entitlements \"$1\""
/usr/bin/codesign --force --sign ${EXPANDED_CODE_SIGN_IDENTITY} ${OTHER_CODE_SIGN_FLAGS} --preserve-metadata=identifier,entitlements "$1"
fi
}
# Strip invalid architectures
strip_invalid_archs() {
binary="$1"
# Get architectures for current file
archs="$(lipo -info "$binary" | rev | cut -d ':' -f1 | rev)"
stripped=""
for arch in $archs; do
if ! [[ "${VALID_ARCHS}" == *"$arch"* ]]; then
# Strip non-valid architectures in-place
lipo -remove "$arch" -output "$binary" "$binary" || exit 1
stripped="$stripped $arch"
fi
done
if [[ "$stripped" ]]; then
echo "Stripped $binary of architectures:$stripped"
fi
}
if [[ "$CONFIGURATION" == "Debug" ]]; then
install_framework "$BUILT_PRODUCTS_DIR/Masonry/Masonry.framework"
fi
if [[ "$CONFIGURATION" == "Release" ]]; then
install_framework "$BUILT_PRODUCTS_DIR/Masonry/Masonry.framework"
fi
```
|
Will Clayson (June 24, 1868 – September 28, 1950) was the fifth mayor of Anchorage, Alaska.
Biography
William H. Clayson was born in Port Gamble, Washington Territory to English immigrant parents, Edward Clayson and Annie Mary Quinton. By 1869, the family had settled in a logging camp near Seabeck, Washington Territory, where a sister, Esther, and a brother, Frederick, were born. The family moved to Portland in 1883, where another sister, Charlotte, was born. Will attended Pacific University in Forest Grove, Oregon.
Alaska
In July 1897, just weeks after hearing the news that gold had been discovered in the Klondike, Will's brother Frederick sailed for Skagway, Alaska. He was accompanied by their brother-in-law, Emil Pohl, who had married Esther three years prior. Will followed in September, and helped Frederick to open an outfitting store, F.W. Clayson and Company. Their mother, who had divorced their father some years hence, joined them. Esther followed the next year, having completing post-graduate studies in Chicago.
When Frederick was murdered on the Dawson Trail on Christmas Day, 1899, Will was appointed executor of his estate. He continued to managed the Skagway store.
Will's first marriage, to a woman named Cecilia, produced a son, William, Jr. In 1905, he opened Clayson the Clothier, a clothing store, in Seward, Alaska. In 1909, he moved to Cordova to start another store. Eventually, he was remarried to the Canadian-born Mabel Tuck, and by 1923, he operated a store in Anchorage, Alaska.
Political career and later years
In 1925, Clayson was elected to the Anchorage City Council, and two years later, on April 5, 1927, he was elected to succeed Chris M. Eckmann as Mayor of Anchorage, defeating W.B. Dean 319 to 278. As mayor, Clayson promoted improvements to infrastructure, including water and sewer lines, streets and sidewalks, and the city's docks. It was during Clayson's tenure that the city council approved an ordinance authorizing the construction of the Eklutna Dam by Frank Ivan Reed's Anchorage Light and Power Company. Clayson did not run for a second term.
Clayson became an early investor in Anchorage Air Transport, Inc, which was founded in 1926 to capitalize on growing demand for commercial aviation. It operated flights from the field later known as the Delaney Park Strip.
Clayson moved to Portland in 1929, returning each year to mind his business interests in Alaska. He died in 1950, at the age of 82.
References
1868 births
1950 deaths
Mayors of Anchorage, Alaska
Politicians from Portland, Oregon
People of the Washington Territory
|
In 1968 the Great Transcontinental Electric Car Race was held between student groups at Caltech and MIT.
The Caltech team, led by EV pioneer Wally Rippel, converted a 1958 VW Microbus powered by lead cobalt batteries from Electric Fuel Propulsion Corporation of Detroit. The MIT team converted a 1968 Chevrolet Corvair powered by NiCad batteries. The MIT team raced from Cambridge, Massachusetts, to Pasadena, California, while the Caltech team raced the opposite direction. A network of 54 charging locations was set up along the 3,311-mile route, spaced 21 to 95 miles apart.
The race began on August 26, 1968, and ended on September 4. Although the MIT team reached Pasadena first, they were towed part of the way. After assessing penalty points, Caltech was declared the winner with a corrected time of 210 hours 3 minutes.
References
Electric vehicles in the United States
|
```smalltalk
namespace StardewModdingAPI.Web.Framework.Clients.Nexus
{
/// <summary>The status of a Nexus mod.</summary>
internal enum NexusModStatus
{
/// <summary>The mod is published and valid.</summary>
Ok,
/// <summary>The mod is hidden by the author.</summary>
Hidden,
/// <summary>The mod hasn't been published yet.</summary>
NotPublished,
/// <summary>The mod contains adult content which is hidden for anonymous web users.</summary>
AdultContentForbidden,
/// <summary>The Nexus API returned an unhandled error.</summary>
Other
}
}
```
|
Mark Kennedy (born 7 July 1969), undercover name Mark Stone, is a former London Metropolitan Police officer who, whilst attached to the police service's National Public Order Intelligence Unit, (NPOIU) infiltrated many protest groups between 2003 and 2010 before he was unmasked by political activists as an undercover policeman on 21 October 2010 and his identity was confirmed by the media three days later. During his time under cover he manipulated and deceived several women into having sexual relationships with him with the knowledge of his superiors. An Investigatory Powers Tribunal found his actions to be an "abuse of the highest order" and had "grossly debased, degraded and humiliated" one of his victims.
Career
Kennedy was born in Camberwell, South London, on 7 July 1969, joined the Metropolitan Police around 1994 and served with them until March 2010. He was revealed to be a police infiltrator of protest groups on 21 October 2010.
In January 2011, it was reported that Kennedy was one of the first officers to work as an undercover infiltrator for the National Public Order Intelligence Unit and had spent seven years within the environmental protest movement.
In a Channel 4 interview broadcast on 14 November 2011, Kennedy stated that, in the guise of an environmental activist, he was used by the police forces of 22 countries and was responsible for the closing down of the Youth House community centre in Copenhagen.
Kennedy said he was hired by German police between 2004 and 2009 and allegedly committed two crimes on their behalf, one of which was arson. German MP Andrej Hunko raised questions in the German Bundestag concerning what the German authorities knew about Kennedy's activities amongst the Berlin protest movement. Kennedy had been arrested in Berlin for attempted arson but was never brought to trial. Hunko also asked: "How does the federal government justify the fact that [Mark Kennedy], as part of his operation in Germany, did not only initiate long-term meaningful friendships but also sexual relationships, clearly under false pretenses?" The federal government refused to answer all questions relating to Kennedy.
Kennedy was involved in several environmentalist campaigns in Ireland, such as Shell to Sea. He allegedly encouraged protestors to attack police during the May Day 2004 protests in Dublin.
In February 2010, while still serving as a police officer, he set up Tokra Ltd, a private company at the same address as a security firm that works for the energy company E.ON, the owners of Ratcliffe-on-Soar Power Station. Later in 2010, he set up Black Star High Access Ltd, based in east London.
He manipulated several women into having sexual relationships with him, with the knowledge of his superiors.
Aftermath
Kennedy said in an interview, arranged through his PR agent Max Clifford, that he suffered a version of Stockholm syndrome. According to The Guardian, Kennedy sued the police for ruining his life and failing to "protect" him from "falling in love" with one of the environmental activists whose movement he infiltrated.
In 2011, eight women who say they were deceived into having long-term intimate relationships by five officers, including Kennedy, who had infiltrated social and environmental justice campaigns, began legal action against the Metropolitan Police and the Association of Chief Police Officers (ACPO). A support group, Police Spies Out of Lives, has been set up not just to provide support for these women, but to also call for the Pitchford Undercover Policing Inquiry to investigate "all aspects of the complete disregard shown for human rights" and initiated a petition that it be "transparent, robust and comprehensive". Eventually, at least 12 women received compensation from the police in the High Court of Justice over similar issues, although the police avoided making internal documents about the relationships public.
Investigatory Powers Tribunal trial
Kate Wilson, one of the women who had sued the police in the high court, started a case in 2018 at the Investigatory Powers Tribunal, alleging the police had infringed her human rights in five ways. In court documents, the police admitted that Kennedy's line manager and other officers were aware of the sexual relationship, stating "sexual relationship with [Wilson] was carried out with the acquiescence of his cover officers and line manager". Previously the police had suggested such relationships were not officially sanctioned. The tribunal found that Kennedy had “invaded the core of her private life”, “caused her mental suffering" and that he had “interfered” with her “sexual autonomy” and showed “a profound lack of respect” for her “bodily integrity and human dignity.” It found that his actions were an “abuse of the highest order.” In January 2022 the tribunal found that Kennedy had “grossly debased, degraded and humiliated” his victim and awarded her £229,000 in compensation. The tribunal described Kennedy as a "highly unreliable narrator" and stated "we do not consider we can put any weight on statements and comments he has made".
Ratcliffe power station trial
The case against six activists accused of conspiracy to commit aggravated trespass at Ratcliffe-on-Soar Power Station collapsed following the revelation of Kennedy's activities as an undercover policeman.
Danny Chivers, who was one of the six successful defendants in the case, said Kennedy was not just an observer, but an agent provocateur. "We're not talking about someone sitting at the back of the meeting taking notes - he was in the thick of it."
In a taped conversation obtained by BBC Newsnight and broadcast on 10 January 2011, Kennedy told an activist he was "sorry" and "wanted to make amends". Kennedy admitted he had been a serving police officer at the time of the Ratcliffe arrests, but said he was not one now. He also told the activist "I hate myself so much I betrayed so many people...I owe it to a lot of good people to do something right for a change ... I'm really sorry."
Crown Prosecution Service (CPS) barrister Felicity Gerry was forced to withdraw the case against the activists after Kennedy confessed to the set-up, evidence of which the CPS had withheld from the defence. The CPS also withheld the fact that Kennedy was giving testimony under the false name Mark Stone using a false passport supplied by the police. Secret tapes recorded by Kennedy were also withheld by the CPS. The Guardian reported that "Kennedy's tapes were secret evidence that could have exonerated six activists, known as the "deniers" because they claimed not to have agreed to join the protest" and "evidence gathered by the Guardian now suggests it was the Crown Prosecution Service rather than the police that withheld the tapes". CPS lawyer Ian Cunningham faced dismissal after a report by Sir Christopher Rose criticised Cunningham for failing to ask questions about Kennedy's involvement in the Ratcliffe plot.
Media
Kennedy is one of several now-exposed undercover police officers profiled in the book Undercover: The True Story of Britain's Secret Police (2012). A planned television drama series is based on the story of the undercover officers.
The play Any Means Necessary is based on the infiltration of the Ratcliffe-on-Soar power station protest. It was the staged at Nottingham Playhouse in February 2016.
See also
Covert policing in the United Kingdom
Law enforcement in the United Kingdom
Bob Lambert
References
Living people
1969 births
Metropolitan Police officers
Undercover police agents
|
```xml
import gql from "graphql-tag";
import * as React from "react";
import { ChildProps, graphql } from "react-apollo";
import DumbArticles from "../../components/faq/Articles";
import queries from "../../graphql";
import { IFaqArticle } from "../../types";
type QueryResponse = {
widgetsKnowledgeBaseArticles: IFaqArticle[];
};
const Articles = (props: ChildProps<{}, QueryResponse>) => {
const { data } = props;
if (!data) {
return null;
}
return (
<DumbArticles
loading={data.loading}
articles={data.widgetsKnowledgeBaseArticles || []}
/>
);
};
type Props = {
topicId?: string;
searchString?: string;
articles?: IFaqArticle[];
};
const WithData = graphql<Props, QueryResponse>(
gql(queries.faqSearchArticlesQuery),
{
options: ownProps => ({
fetchPolicy: "network-only",
variables: {
topicId: ownProps.topicId,
searchString: ownProps.searchString
}
})
}
)(Articles);
const WithContext = (props: Props) => {
if (!props.searchString || !props.topicId) {
return (
<DumbArticles
{...props}
loading={false}
articles={props.articles || []}
/>
);
}
return <WithData {...props} />;
};
export default WithContext;
```
|
```java
package android.marshon.likequanmintv.librarys.http.apiservice;
import org.json.JSONArray;
import org.json.JSONObject;
import retrofit2.http.GET;
import rx.Observable;
/**
* Created by marshon on 2016/10/12 0012 10:45
*/
public interface RecommendAPIService {
@GET("json/page/app-data/info.json?v=2.2.4&os=1&ver=4")
Observable<JSONObject> getAppStartInfo();
@GET("json/app/index/category/info-android.json?v=2.2.4&os=1&ver=4")
Observable<JSONArray> getAllCategories();
@GET("json/app/index/recommend/list-android.json?11241742&v=2.2.4&os=1&ver=4")
Observable<JSONObject> getRecommendCategories();
}
```
|
The maritime transportation of spent nuclear fuel and other high-level radioactive wastes requires the use of purpose-built vessels which meet the International Maritime Organization's INF classification standards. These standards were introduced in 1993 and made mandatory in 2001. As of 2020, the list below is limited to active vessels and may not be exhaustive.
References
Nuclear fuel carrier
Nuclear industry
|
```objective-c
/*
* Tencent is pleased to support the open source community by making
* WCDB available.
*
* All rights reserved.
*
*
* 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 <Foundation/Foundation.h>
#import <WCDB/WCTDeclare.h>
/**
Trigger when error occurs
*/
typedef void (^WCTErrorReport)(WCTError *);
/**
Trigger when a transaction or a normal sql ends.
*/
typedef void (^WCTPerformanceTrace)(WCTTag, NSDictionary<NSString *, NSNumber *> *, NSInteger);
/**
Trigger when a SQL is executed.
*/
typedef void (^WCTSQLTrace)(NSString *);
/**
Statistics
*/
@interface WCTStatistics : NSObject
/**
@brief You can register a reporter to monitor all errors.
[WCTStatistics SetGlobalErrorReport:^(WCTError* error) {
NSLog(@"%@", error);
}];
@param report report
@see WCTErrorReport
*/
+ (void)SetGlobalErrorReport:(WCTErrorReport)report;
/**
@brief You can register a tracer to monitor the performance of all SQLs.
It returns
1. The collection of SQLs and the executions count of each SQL.
2. Time consuming in nanoseconds.
3. Tag of database.
Note that:
1. You should register trace before all db operations.
2. Global tracer will be recovered by db tracer.
[WCTStatistics SetGlobalPerformanceTrace:^(WCTTag tag, NSDictionary<NSString*, NSNumber*>* sqls, NSInteger cost) {
NSLog(@"Tag: %d", tag);
[sqls enumerateKeysAndObjectsUsingBlock:^(NSString *sql, NSNumber *count, BOOL *) {
NSLog(@"SQL: %@ Count: %d", sql, count.intValue);
}];
NSLog(@"Total cost %ld nanoseconds", (long)cost);
}];
@warning Tracer may cause wcdb performance degradation, according to your needs to choose whether to open.
@param trace trace
@see WCTPerformanceTrace
@see [WCTDatabase setPerformanceTrace:]
*/
+ (void)SetGlobalPerformanceTrace:(WCTPerformanceTrace)trace;
/**
@brief You can register a tracer to monitor the execution of all SQLs.
It returns a prepared or executed SQL.
Note that you should register trace before all db operations.
[WCTStatistics SetGlobalSQLTrace:^(NSString* sql) {
NSLog(@"SQL: %@", sql);
}];
@warning Tracer may cause wcdb performance degradation, according to your needs to choose whether to open.
@see WCTSQLTrace
@param trace trace
*/
+ (void)SetGlobalSQLTrace:(WCTSQLTrace)trace;
@end
```
|
"Prada" is a single by American rappers 24kGoldn and Lil Tecca, released on October 8, 2021. It was produced by Cxdy, Humblebee, OVRCZ and Taz Taylor.
Background
The artists first performed the song at the Governors Ball Music Festival in September 2021, prior to releasing it on October 8.
In an interview with Hypebeast, 24kGoldn spoke about the collaboration process:
It was very natural, he was working on We Love You Tecca 2 with Internet Money and Taz, they told me pull up come catch a vibe. We ended up banging out two of them, and this is the one I fuck with the most, so I decided to put it out. Tecca had a great verse, he bodied his verse, I did my thing on there like always, and I think it came together really really nice.
Composition
24kGoldn explained the meaning behind the song in the aforementioned interview:
At first glance, it's safe to assume it's about Prada, but really the underlying message is about confidence, growth, and change. They not gonna fuck with you when you down, but they gonna fuck with you when you up, and how I dealt with that, how Tecca dealt with that.
The song mentions getting "guala" and spending it. In the chorus, 24kGoldn sings "Prada, that's on my shoes, that's on my shirt, that's on my collar / I hit it once, ain't hit her back 'cause I'm a baller".
Music video
The music video was directed by John Tashiro and released alongside the single. It takes place in a shopping mall. Dressed exclusively in Prada, the artists are seen pulling stunts, such as leading a group of teenagers on a quad bike, and being chased by the mall's security.
Charts
References
2021 singles
2021 songs
24kGoldn songs
Lil Tecca songs
Song recordings produced by Taz Taylor (record producer)
Songs written by 24kGoldn
Songs written by Lil Tecca
Songs written by Taz Taylor (record producer)
Columbia Records singles
|
Judge Browning may refer to:
James O. Browning (born 1956), judge of the United States District Court for the District of New Mexico
James R. Browning (1918–2012), judge of the United States Court of Appeals for the Ninth Circuit
William Docker Browning (1931–2008), judge of the United States District Court for the District of Arizona
See also
Justice Browning (disambiguation)
|
```html
<html>
<head>
<title>Test page for precache-and-update</title>
<style>
body {
background: #c0392b;
}
</style>
<link rel="stylesheet" href="styles/index.css" />
</head>
<body>
<h1>Workbox Precaching - precache-and-update</h1>
<script src="/infra/testing/comlink/window-interface.js"></script>
</body>
</html>
```
|
Patrick J. Molloy (born 11 March 1961) is an Irish law enforcement officer with Garda Síochána (22601G) and a recipient of the Scott Medal.
Background
Molloy is a native of Renmore, Galway, and joined the force in 1982
Incident in Limerick
Gardai Molloy, Augustine Fox and Patrick D. O'Callaghan were patrolling Sarsfield Barracks housing estate in Limerick in the early hours of 14 July 1996 when they came across a house fire. Molloy and O'Callaghan forced their way inside but "were met with a blast of intense heat and a pall of oily smoke. Garda O'Callaghan, crawling about on all fours, found two terrified children standing in a corner. He and Garda Molloy grabbed a child each and managed to get them past the blazing hallyway and out the front door to safety."
Upon learning that there was still another child in the house, all three Gardaí attempted to reach the upstairs bedroom where the child was located but were driven back. A further attempt was made by Fox, but he was unsuccessful. However the fire brigade arrived at this time and rescued the child.
All three Gardaí needed hospitalisation for smoke and cuts. They were awarded the Scott Medal on 23 July 1998.
See also
Yvonne Burke (Garda)
Brian Connaughton
Joseph Scott
Deaths of Henry Byrne and John Morley (1980)
Death of Jerry McCabe (1996)
References
An Garda Síochána and the Scott Medal, p. 182, Gerard O'Brien, Four Courts Press, 2008.
Police officers from County Galway
Garda Síochána officers
1961 births
Living people
Recipients of the Scott Medal
|
```ruby
#!/usr/bin/env ruby
require 'sqlite3'
require 'csv'
COLUMNS = {
ndb_no: 'int', description: 'varchar(100)', water_g: 'real', kcal: 'real',
protein_g: 'real', lipid_total_g: 'real', ash_g: 'real', carbohydrate_g: 'real',
fiber_td_g: 'real', sugar_g: 'real', calcium_mg: 'real', iron_mg: 'real',
magnesium_mg: 'real', phosphorus_mg: 'real', potassium_mg: 'real',
sodium_mg: 'real', zinc_mg: 'real', copper_mg: 'real', manganese_mg: 'real',
selenium_ug: 'real', vit_c_mg: 'real', thiamin_mg: 'real', riboflavin_mg: 'real',
niacin_mg: 'real', panto_acid_mg: 'real', vit_b6_mg: 'real', folate_tot_ug: 'real',
folic_acid_ug: 'real', food_folate_ug: 'real', folate_dfe_ug: 'real',
choline_tot_mg: 'real', vit_b12_ug: 'real', vit_a_iu: 'real', vit_a_rae: 'real',
retinol_ug: 'real', alpha_carot_ug: 'real', beta_carot_ug: 'real',
beta_crypt_ug: 'real', lycopene_ug: 'real', lut_and_zea_ug: 'real',
vit_e_mg: 'real', vit_d_ug: 'real', vit_d_iu: 'real', vit_k_ug: 'real',
fa_sat_g: 'real', fa_mono_g: 'real', fa_poly_g: 'real', cholestrl_mg: 'real',
gmwt_1: 'real', gmwt_desc1: 'varchar(100)', gmwt_2: 'real', gmwt_desc2: 'varchar(100)',
refuse_pct: 'real'
}
db = SQLite3::Database.new '../usda-nnd.sqlite3'
res = db.execute 'SELECT name FROM sqlite_master WHERE type = "table"'
if res.flatten.include?('entries')
puts 'table `entries` already exists dropping'
db.execute 'DROP TABLE entries'
end
columns = COLUMNS.inject('') do |memo, pair|
name, type = pair
memo += "\n#{name} #{type},"
end.chomp(',')
db.execute <<-SQL
create table entries (
#{columns}
);
SQL
print "\nWorking..."
dir = File.dirname(File.expand_path(__FILE__))
lineno = 1
CSV.foreach(File.join(dir, 'raw-ndb.csv'), {:encoding => 'ISO8859-1'}) do |row|
lineno = $.
next if lineno == 1
print '.' if lineno % 1000 == 0
# Humanize descriptions
row[1] = row[1].capitalize.gsub(/([\,\/])\s*/, '\1 ').gsub(/\s*\&\s*/, ' \1 ')
sql = <<-SQL
INSERT INTO entries (#{COLUMNS.keys.join(', ')})
VALUES (#{(['?'] * COLUMNS.size).join(', ')})
SQL
db.execute sql, row
end
print "done."
print "\n#{lineno} entries imported."
```
|
```scss
@import '~office-ui-fabric-react/dist/sass/References.scss';
.reactSpFx {
.container {
max-width: 700px;
margin: 0px auto;
box-shadow: 0 2px 4px 0 rgba(0, 0, 0, 0.2), 0 25px 50px 0 rgba(0, 0, 0, 0.1);
}
.paginationDiv{
border: 1px solid lightblue;
height: 100px;
padding: 10px 0;
width: 100%;
display: flex;
justify-content: center;
}
.row {
@include ms-Grid-row;
@include ms-fontColor-white;
background-color: $ms-color-themeDark;
padding: 20px;
}
.column {
@include ms-Grid-col;
@include ms-lg10;
@include ms-xl8;
@include ms-xlPush2;
@include ms-lgPush1;
}
.title {
font-size: large;
font-weight: bold;
font-style: normal;
@include ms-font-xl;
@include ms-fontColor-white;
}
.subTitle {
@include ms-font-l;
@include ms-fontColor-white;
}
.description {
@include ms-font-l;
@include ms-fontColor-white;
}
.button {
// Our button
text-decoration: none;
height: 32px;
// Primary Button
min-width: 80px;
background-color: $ms-color-themePrimary;
border-color: $ms-color-themePrimary;
color: $ms-color-white;
// Basic Button
outline: transparent;
position: relative;
font-family: "Segoe UI WestEuropean","Segoe UI",-apple-system,BlinkMacSystemFont,Roboto,"Helvetica Neue",sans-serif;
-webkit-font-smoothing: antialiased;
font-size: $ms-font-size-m;
font-weight: $ms-font-weight-regular;
border-width: 0;
text-align: center;
cursor: pointer;
display: inline-block;
padding: 0 16px;
.label {
font-weight: $ms-font-weight-semibold;
font-size: $ms-font-size-m;
height: 32px;
line-height: 32px;
margin: 0 4px;
vertical-align: top;
display: inline-block;
}
}
}
```
|
Radostków-Kolonia is a settlement in the administrative district of Gmina Mykanów, within Częstochowa County, Silesian Voivodeship, in southern Poland. It lies approximately north of Częstochowa and north of the regional capital Katowice.
References
Villages in Częstochowa County
|
```shell
How to change your most recent commit
Check the status of your files
How to write a git commit message
Intent to add
Dates in git
```
|
James Albert Missouri (May 29, 1917 – July 4, 1989) was an American Negro league pitcher between 1937 and 1940.
A native of Bishopville, South Carolina, Missouri made his Negro leagues debut in 1937 with the Philadelphia Stars. He went on to play for the Stars for three more seasons through 1940. Missouri died in Capitol Heights, Maryland in 1989 at age 72.
References
External links
and Seamheads
1917 births
1989 deaths
Philadelphia Stars players
Baseball pitchers
Baseball players from South Carolina
People from Bishopville, South Carolina
20th-century African-American sportspeople
|
```java
/*
*
* This program and the accompanying materials are made
* which is available at path_to_url
*
*/
package org.eclipse.milo.opcua.sdk.server.identity;
import java.security.cert.X509Certificate;
import java.util.function.Predicate;
import org.eclipse.milo.opcua.sdk.server.Session;
import org.jetbrains.annotations.Nullable;
public class X509IdentityValidator extends AbstractX509IdentityValidator {
private final Predicate<X509Certificate> predicate;
public X509IdentityValidator(Predicate<X509Certificate> predicate) {
this.predicate = predicate;
}
@Nullable
@Override
protected Object authenticateIdentityCertificate(Session session, X509Certificate identityCertificate) {
if (predicate.test(identityCertificate)) {
return identityCertificate;
} else {
return null;
}
}
}
```
|
```swift
import Parchment
import UIKit
struct IconPagingCellViewModel {
let image: UIImage?
let selected: Bool
let tintColor: UIColor
let selectedTintColor: UIColor
init(image: UIImage?, selected: Bool, options: PagingOptions) {
self.image = image
self.selected = selected
tintColor = options.textColor
selectedTintColor = options.selectedTextColor
}
}
class IconPagingCell: PagingCell {
fileprivate var viewModel: IconPagingCellViewModel?
fileprivate lazy var imageView: UIImageView = {
let imageView = UIImageView(frame: .zero)
imageView.contentMode = .scaleAspectFit
return imageView
}()
override init(frame: CGRect) {
super.init(frame: frame)
contentView.addSubview(imageView)
setupConstraints()
}
required init?(coder _: NSCoder) {
fatalError("init(coder:) has not been implemented")
}
override func setPagingItem(_ pagingItem: PagingItem, selected: Bool, options: PagingOptions) {
if let item = pagingItem as? IconItem {
let viewModel = IconPagingCellViewModel(
image: item.image,
selected: selected,
options: options
)
imageView.image = viewModel.image
if viewModel.selected {
imageView.transform = CGAffineTransform(scaleX: 1, y: 1)
imageView.tintColor = viewModel.selectedTintColor
} else {
imageView.transform = CGAffineTransform(scaleX: 0.6, y: 0.6)
imageView.tintColor = viewModel.tintColor
}
self.viewModel = viewModel
}
}
open override func apply(_ layoutAttributes: UICollectionViewLayoutAttributes) {
guard let viewModel = viewModel else { return }
if let attributes = layoutAttributes as? PagingCellLayoutAttributes {
let scale = (0.4 * attributes.progress) + 0.6
imageView.transform = CGAffineTransform(scaleX: scale, y: scale)
imageView.tintColor = UIColor.interpolate(
from: viewModel.tintColor,
to: viewModel.selectedTintColor,
with: attributes.progress
)
}
}
private func setupConstraints() {
imageView.translatesAutoresizingMaskIntoConstraints = false
let topConstraint = NSLayoutConstraint(
item: imageView,
attribute: .top,
relatedBy: .equal,
toItem: contentView,
attribute: .top,
multiplier: 1.0,
constant: 15
)
let bottomConstraint = NSLayoutConstraint(
item: imageView,
attribute: .bottom,
relatedBy: .equal,
toItem: contentView,
attribute: .bottom,
multiplier: 1.0,
constant: -15
)
let leadingConstraint = NSLayoutConstraint(
item: imageView,
attribute: .leading,
relatedBy: .equal,
toItem: contentView,
attribute: .leading,
multiplier: 1.0,
constant: 0
)
let trailingConstraint = NSLayoutConstraint(
item: imageView,
attribute: .trailing,
relatedBy: .equal,
toItem: contentView,
attribute: .trailing,
multiplier: 1.0,
constant: 0
)
contentView.addConstraints([
topConstraint,
bottomConstraint,
leadingConstraint,
trailingConstraint,
])
}
}
```
|
```objective-c
/**
* \class document::ForceLink
* \ingroup base
*
* \brief Class used to include some document functionality that programs that
* needs to get it linked, but doesn't use it can include.
*
* Many codebits include this, but who really depends on it?
*/
#pragma once
namespace document {
class ForceLink {
public:
ForceLink();
};
} // document
```
|
The Beringia upland tundra is a mountainous tundra ecoregion of North America, on the west coast of Alaska.
Location
This ecoregion consists of three separate but similar areas of the Bering Sea coast of Alaska: the hills and mountains of the Seward Peninsula; the Ahklun Mountains in the southwest; and the hilly western half of St. Lawrence Island in the Bering Sea. All these are hilly areas climbing sometimes to steep barren mountain up to 1500m, and which still have a number of cirque glaciers. The climate varies of course from the coast to the icy peaks.
Flora
The slopes are covered with a variety of lichens and other tundra plants, depending on altitude and drainage. The low-lying, wetter areas are similar to the surrounding Beringia lowland tundra ecoregion but the uplands are generally drier and dominated by sedges such as Eriophorum vaginatum and scrub such as the ericas Arctostaphylos alpina, Vaccinium vitis-idaea or Empetrum nigrum or mountain-avens (Dryas octopetala) and dwarf arctic birch (Betula nana). Sheltered valleys will have some spruce or poplar trees Picea glauca and Populus balsamifera. The Seward Peninsula is vulnerable to fire when the lichens dry out in summer
Fauna
Birds of this coast include the rare shorebird bristle-thighed curlew (Numenius tahitiensis) which breeds only in Alaska, spectacled eider (Somateria fischeri), a number of turnstones (Arenaria spp.), and in the river valleys blackpoll warblers (Dendroica striata). The cliffs of the Seward Peninsula and St. Lawrence Island in particular are nesting sites for a variety of seabirds including common murre and thick-billed murre (Uria aalge and Uria lomvia) and tufted puffin (Fratercula cirrhata)
The ecoregion also includes the Walrus Islands in Togiak Bay which as the name would suggest are home to Alaska's largest concentration of walrus in summer.
Threats and preservation
There are small human communities in the region, some mining on the Seward Peninsula and some possible over-hunting of caribou, but these are large blocks of largely unspoilt habitat. Protected areas include Wood-Tikchik State Park, Walrus Islands State Game Sanctuary, Yukon Delta National Wildlife Refuge, and Togiak National Wildlife Refuge.
See also
List of ecoregions in the United States (WWF)
References
Ecoregions of Alaska
Nearctic ecoregions
Tundra ecoregions
|
```html
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>http::param_list::value_type</title>
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
<link rel="home" href="../../../index.html" title="Chapter 1. Boost.Beast">
<link rel="up" href="../boost__beast__http__param_list.html" title="http::param_list">
<link rel="prev" href="param_list/overload2.html" title="http::param_list::param_list (2 of 2 overloads)">
<link rel="next" href="../boost__beast__http__parser.html" title="http::parser">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
<td align="center"><a href="../../../../../../../index.html">Home</a></td>
<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td>
<td align="center"><a href="path_to_url">People</a></td>
<td align="center"><a href="path_to_url">FAQ</a></td>
<td align="center"><a href="../../../../../../../more/index.htm">More</a></td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="param_list/overload2.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../boost__beast__http__param_list.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../boost__beast__http__parser.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="beast.ref.boost__beast__http__param_list.value_type"></a><a class="link" href="value_type.html" title="http::param_list::value_type">http::param_list::value_type</a>
</h5></div></div></div>
<p>
<a class="indexterm" name="idp107233856"></a>
The type of each element in the list.
</p>
<h6>
<a name="beast.ref.boost__beast__http__param_list.value_type.h0"></a>
<span class="phrase"><a name="beast.ref.boost__beast__http__param_list.value_type.synopsis"></a></span><a class="link" href="value_type.html#beast.ref.boost__beast__http__param_list.value_type.synopsis">Synopsis</a>
</h6>
<pre class="programlisting"><span class="keyword">using</span> <span class="identifier">value_type</span> <span class="special">=</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="identifier">string_view</span><span class="special">,</span> <span class="identifier">string_view</span> <span class="special">>;</span>
</pre>
<h6>
<a name="beast.ref.boost__beast__http__param_list.value_type.h1"></a>
<span class="phrase"><a name="beast.ref.boost__beast__http__param_list.value_type.description"></a></span><a class="link" href="value_type.html#beast.ref.boost__beast__http__param_list.value_type.description">Description</a>
</h6>
<p>
The first string in the pair is the name of the parameter, and the second
string in the pair is its value (which may be empty).
</p>
</div>
<table xmlns:rev="path_to_url~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
file LICENSE_1_0.txt or copy at <a href="path_to_url" target="_top">path_to_url
</p>
</div></td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="param_list/overload2.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../boost__beast__http__param_list.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../boost__beast__http__parser.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
```
|
Mississippi Highway 330 (MS 330) is a east-west state highway in the North Central Hills region of northern Mississippi, connecting U.S. Route 51 (US 51) just outside of Tillatoba to MS 32 west of Bruce, Mississippi. It is generally a two-lane road.
Along its way, the highway intersects Interstate 55 (I-55) east of Tillatoba and MS 7 in Coffeeville.
Route description
MS 330 begins in Yalobusha County at an intersection with US 51 on the western outskirts of Tillatoba. It heads east to pass directly through the center of the small town, where it makes an odd sharp left turn before crossing a railroad track, only to leave Tillatoba shortly thereafter at an interchange with I-55 (Exit 220). The highway now winds its way through a hilly, remote, and wooded tract of the Holly Springs National Forest for the next several miles, passing through the Tillatoba Lake Recreation Area (and along the coastline of the lake itself).
MS 330 leaves the National Forest and travels through farmland for a few miles to enter the town of Coffeeville at an intersection with MS 7. It enters town along Depot Street, passing through some neighborhoods before making a left onto Oklahoma Street (Old MS 7). It heads north along Oklahoma Street for a block before making a right onto Main Street and passing through downtown. The highway leaves Coffeeville, after crossing two bridges over two very large creeks, and heads southeast across some hilly woodlands to enter the Skuna River valley at the eastern end of the northern arm of Grenada Lake, where it has an intersection Elam South Road (former MS 335) in the community of Gums. It heads along the northern banks of the river for a couple miles to enter Calhoun County.
MS 330 continues up the Skuna River valley for a few more miles, through farmland, before coming to an end at an intersection with MS 32, just two miles west of Bruce.
The entire length of Mississippi Highway 330 is a rural, two-lane, state highway.
Major intersections
References
External links
330
Transportation in Yalobusha County, Mississippi
Transportation in Calhoun County, Mississippi
|
```yaml
apiVersion: release-notes/v2
kind: bug-fix
area: traffic-management
releaseNotes:
- |
**Fixed** an issue where Remote JWKS URI's without a host port fail to parse into their host and port components.
```
|
```assembly
! crtn.s for solaris 2.0.
! Written By David Vinayak Henkel-Wallace, June 1992
!
! This file is free software; you can redistribute it and/or modify it
! Free Software Foundation; either version 2, or (at your option) any
! later version.
!
! Free Software Foundation gives you unlimited permission to link the
! compiled version of this file with other programs, and to distribute
! those programs without any restriction coming from the use of this
! respects; for example, they cover modification of the file, and
! distribution when not linked into another program.)
!
! This file is distributed in the hope that it will be useful, but
! WITHOUT ANY WARRANTY; without even the implied warranty of
! MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
!
! along with this program; see the file COPYING. If not, write to
! the Free Software Foundation, 59 Temple Place - Suite 330,
! Boston, MA 02111-1307, USA.
!
! As a special exception, if you link this library with files
! compiled with GCC to produce an executable, this does not cause
! This exception does not however invalidate any other reasons why
!
! This file just makes sure that the .fini and .init sections do in
! fact return. Users may put any desired instructions in those sections.
! This file is the last thing linked into any executable.
.file "crtn.s"
.section ".init"
.align 4
ret
restore
.section ".fini"
.align 4
ret
restore
! Th-th-th-that is all folks!
```
|
```objective-c
//
// Created by Gabriel Handford on 3/1/09.
// Created by John Boiles on 10/20/11.
// Modified by Felix Schulze on 2/11/13.
//
// Permission is hereby granted, free of charge, to any person
// obtaining a copy of this software and associated documentation
// files (the "Software"), to deal in the Software without
// restriction, including without limitation the rights to use,
// copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the
// Software is furnished to do so, subject to the following
// conditions:
//
// The above copyright notice and this permission notice shall be
// included in all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
// EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
// OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
// NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
// HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
// WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
// OTHER DEALINGS IN THE SOFTWARE.
//
#import "UIImage+Compare.h"
// This makes debugging much more fun
typedef union {
uint32_t raw;
unsigned char bytes[4];
struct {
char red;
char green;
char blue;
char alpha;
} __attribute__((packed)) pixels;
} FBComparePixel;
@implementation UIImage (Compare)
- (BOOL)fb_compareWithImage:(UIImage *)image
perPixelTolerance:(CGFloat)perPixelTolerance
overallTolerance:(CGFloat)overallTolerance {
CGSize referenceImageSize =
CGSizeMake(CGImageGetWidth(self.CGImage), CGImageGetHeight(self.CGImage));
CGSize imageSize = CGSizeMake(CGImageGetWidth(image.CGImage), CGImageGetHeight(image.CGImage));
NSAssert(CGSizeEqualToSize(referenceImageSize, imageSize), @"Images must be same size.");
// The images have the equal size, so we could use the smallest amount of bytes because of byte
// padding
size_t minBytesPerRow =
MIN(CGImageGetBytesPerRow(self.CGImage), CGImageGetBytesPerRow(image.CGImage));
size_t referenceImageSizeBytes = referenceImageSize.height * minBytesPerRow;
void *referenceImagePixels = calloc(1, referenceImageSizeBytes);
void *imagePixels = calloc(1, referenceImageSizeBytes);
if (!referenceImagePixels || !imagePixels) {
free(referenceImagePixels);
free(imagePixels);
return NO;
}
CGContextRef referenceImageContext = CGBitmapContextCreate(
referenceImagePixels, referenceImageSize.width, referenceImageSize.height,
CGImageGetBitsPerComponent(self.CGImage), minBytesPerRow,
CGImageGetColorSpace(self.CGImage), (CGBitmapInfo)kCGImageAlphaPremultipliedLast);
CGContextRef imageContext = CGBitmapContextCreate(
imagePixels, imageSize.width, imageSize.height, CGImageGetBitsPerComponent(image.CGImage),
minBytesPerRow, CGImageGetColorSpace(image.CGImage),
(CGBitmapInfo)kCGImageAlphaPremultipliedLast);
if (!referenceImageContext || !imageContext) {
CGContextRelease(referenceImageContext);
CGContextRelease(imageContext);
free(referenceImagePixels);
free(imagePixels);
return NO;
}
CGContextDrawImage(referenceImageContext,
CGRectMake(0, 0, referenceImageSize.width, referenceImageSize.height),
self.CGImage);
CGContextDrawImage(imageContext, CGRectMake(0, 0, imageSize.width, imageSize.height),
image.CGImage);
CGContextRelease(referenceImageContext);
CGContextRelease(imageContext);
BOOL imageEqual = YES;
FBComparePixel *p1 = referenceImagePixels;
FBComparePixel *p2 = imagePixels;
// Do a fast compare if we can
if (overallTolerance == 0 && perPixelTolerance == 0) {
imageEqual = (memcmp(referenceImagePixels, imagePixels, referenceImageSizeBytes) == 0);
} else {
const NSUInteger pixelCount = referenceImageSize.width * referenceImageSize.height;
// Go through each pixel in turn and see if it is different
imageEqual = [self _compareAllPixelsWithPerPixelTolerance:perPixelTolerance
overallTolerance:overallTolerance
pixelCount:pixelCount
referencePixels:p1
imagePixels:p2];
}
free(referenceImagePixels);
free(imagePixels);
return imageEqual;
}
- (BOOL)_comparePixelWithPerPixelTolerance:(CGFloat)perPixelTolerance
referencePixel:(FBComparePixel *)referencePixel
imagePixel:(FBComparePixel *)imagePixel {
if (referencePixel->raw == imagePixel->raw) {
return YES;
} else if (perPixelTolerance == 0) {
return NO;
}
CGFloat redPercentDiff =
[self _calculatePercentDifferenceForReferencePixelComponent:referencePixel->pixels.red
imagePixelComponent:imagePixel->pixels.red];
CGFloat greenPercentDiff =
[self _calculatePercentDifferenceForReferencePixelComponent:referencePixel->pixels.green
imagePixelComponent:imagePixel->pixels.green];
CGFloat bluePercentDiff =
[self _calculatePercentDifferenceForReferencePixelComponent:referencePixel->pixels.blue
imagePixelComponent:imagePixel->pixels.blue];
CGFloat alphaPercentDiff =
[self _calculatePercentDifferenceForReferencePixelComponent:referencePixel->pixels.alpha
imagePixelComponent:imagePixel->pixels.alpha];
BOOL anyDifferencesFound =
(redPercentDiff > perPixelTolerance || greenPercentDiff > perPixelTolerance ||
bluePercentDiff > perPixelTolerance || alphaPercentDiff > perPixelTolerance);
return !anyDifferencesFound;
}
- (CGFloat)_calculatePercentDifferenceForReferencePixelComponent:(char)p1
imagePixelComponent:(char)p2 {
NSInteger referencePixelComponent = (unsigned char)p1;
NSInteger imagePixelComponent = (unsigned char)p2;
NSUInteger componentDifference = ABS(referencePixelComponent - imagePixelComponent);
return (CGFloat)componentDifference / 256;
}
- (BOOL)_compareAllPixelsWithPerPixelTolerance:(CGFloat)perPixelTolerance
overallTolerance:(CGFloat)overallTolerance
pixelCount:(NSUInteger)pixelCount
referencePixels:(FBComparePixel *)referencePixel
imagePixels:(FBComparePixel *)imagePixel {
NSUInteger numDiffPixels = 0;
for (NSUInteger n = 0; n < pixelCount; ++n) {
// If this pixel is different, increment the pixel diff count and see
// if we have hit our limit.
BOOL isIdenticalPixel = [self _comparePixelWithPerPixelTolerance:perPixelTolerance
referencePixel:referencePixel
imagePixel:imagePixel];
if (!isIdenticalPixel) {
numDiffPixels++;
CGFloat percent = (CGFloat)numDiffPixels / (CGFloat)pixelCount;
if (percent > overallTolerance) {
return NO;
}
}
referencePixel++;
imagePixel++;
}
return YES;
}
@end
```
|
Get Satisfaction was a customer community software platform for technical support based in San Francisco, California, United States. It was founded on January 31, 2007, by several people, including Lane Becker, Amy Muller, Thor Muller, and Jonathan Grubb. It publicly launched in September 2007. In April 2015, Get Satisfaction was acquired by Sprinklr, a social media management company.
The idea for the service originated from Valleyschwag as a side project. When the Valleyschwag service received over 1,500 subscribers, its customer service requirements increased dramatically. Realizing that customers were actually responding to the issues that other people brought up, the group behind Valleyschwag decided to create the precursor to Get Satisfaction, first named Satisfaction Unlimited, to take advantage of the community's enthusiasm for helping each other. The company describes its product as "people-powered customer service" and "Online Communities. The shortest distance between you and your customer." Get Satisfaction online communities can be a private and/or public place for customers to ask questions, submit an idea or complaint, or give praise. Companies can respond to issues regarding their products or services; official responses are marked as official answers to separate them from other responses. Users can rate responses based on how well they resolve the issue.
Thor Muller explained in an interview with BusinessWeek that the website aims to be simple, noting that most customer-service solutions are too complex. He continues by stating that many are reactive instead of proactive, requiring customers to think as if they were an employee or librarian to find their answers. In contrast, Get Satisfaction approaches the problem by helping companies think more like customers. Muller explained, “We want to create a Switzerland for companies and customers, with specific tools that allow people to get answers to their questions. [...] We want the best answers to rise to the top, and not get buried in online discussion forums.”
The service initially offered paid service plans to companies including Method Products, Timbuk2, Twitter, and Digg. Several more companies later joined the platform, including Time Warner Cable, Verizon, Comcast, Mozilla, Mogo Money, Microsoft Hohm, AMC Theatres, Qantas, Apple Inc., Dell, and Facebook.
The company's CEO was Rahul Sachdev and its CTO was David Rowley. The website, which received an initial round of financing of $1.3 million, received financing from investors that include First Round Capital, O'Reilly Alphatech Ventures, and SoftTechVC. In September 2010, the company announced Series A funding of $6 million from Azure Capital Partners with OATV and First Round Capital participating. In March 2010, Get Satisfaction launched their Facebook application that allowed companies and brands to put their customer community on their Facebook page as a tab.
See also
UserVoice
Issue tracking system
References
External links
Providers of services to on-line companies
Companies based in San Francisco
Internet forum software
American companies established in 2007
Meta Platforms applications
|
```turing
#modern-config-incompatible
#modern-config-incompatible
#require no-eden
$ setconfig experimental.allowfilepeer=True
$ configure dummyssh
$ enable pushrebase amend remotenames
$ setconfig experimental.evolution=obsolete
$ setconfig experimental.narrow-heads=true
$ setconfig visibility.enabled=true
$ setconfig mutation.record=true mutation.enabled=true
$ setconfig pushrebase.trystackpush=true
Set up server repository
$ newserver server
$ setconfig experimental.narrow-heads=false
$ echo 1 > a
$ echo 2 > b
$ hg commit -Aqm base
$ hg bookmark master
Set up client repository
$ cd ..
$ hg clone ssh://user@dummy/server client -q
Add more commits on the server
$ cd server
$ echo 3 > c
$ hg commit -Aqm s1
$ echo 4 > d
$ hg commit -Aqm s2
$ hg bookmark master
Pushrebase some commits from the client
$ cd ../client
$ echo 5 > e
$ hg commit -Aqm c1
$ echo 6 > f
$ hg commit -Aqm c2
$ echo 6a > f
$ hg amend -qm "c2 (amended)"
$ tglogp
@ e52ebff26308 draft 'c2 (amended)'
o b0c40d8745c8 draft 'c1'
o a7d6a32ae4ec public 'base'
$ hg push --to master
pushing rev e52ebff26308 to destination ssh://user@dummy/server bookmark master
searching for changes
adding changesets
adding manifests
adding file changes
updating bookmark master
remote: pushing 2 changesets:
remote: b0c40d8745c8 c1
remote: e52ebff26308 c2 (amended)
remote: 4 new changesets from the server will be downloaded
2 files updated, 0 files merged, 0 files removed, 0 files unresolved
$ tglogp
@ bc165ecd11df public 'c2 (amended)'
o 466bbcaf803c public 'c1'
o 1f850c9f0d59 public 's2'
o 06569a64c141 public 's1'
o a7d6a32ae4ec public 'base'
$ hg debugmutation -r ::tip
* a7d6a32ae4ecf473d6f934e731f1868dda4d3fc9
* 06569a64c14156339463c64337f9cb5dc3a25442
* 1f850c9f0d599261fce148d3d19cdc89d8eb391f
* 466bbcaf803c40b7121013141b842e654ee07f7f pushrebase by test at 1970-01-01T00:00:00 from:
b0c40d8745c83226015263d45e60a0d12722c515
* bc165ecd11df56066a4d73e8294a85ecb255d3cf pushrebase by test at 1970-01-01T00:00:00 from:
e52ebff2630810cbc8bc0e3a8de78cb662f0865f amend by test at 1970-01-01T00:00:00 from:
f558c5855324eea33b5f046b45b85db1fb98bca7
$ cd ../server
$ tglogp
o bc165ecd11df public 'c2 (amended)' master
o 466bbcaf803c public 'c1'
@ 1f850c9f0d59 public 's2'
o 06569a64c141 public 's1'
o a7d6a32ae4ec public 'base'
$ hg debugmutation -r ::tip
* a7d6a32ae4ecf473d6f934e731f1868dda4d3fc9
* 06569a64c14156339463c64337f9cb5dc3a25442
* 1f850c9f0d599261fce148d3d19cdc89d8eb391f
* 466bbcaf803c40b7121013141b842e654ee07f7f pushrebase by test at 1970-01-01T00:00:00 from:
b0c40d8745c83226015263d45e60a0d12722c515
* bc165ecd11df56066a4d73e8294a85ecb255d3cf pushrebase by test at 1970-01-01T00:00:00 from:
e52ebff2630810cbc8bc0e3a8de78cb662f0865f
Test pushing to a server that does not have mutation recording enabled. Synthetic mutation
entries will be contructed from the obsmarkers that pushrebase returns.
$ cd ../server
$ cat >> .hg/hgrc <<EOF
> [mutation]
> record=false
> enabled=false
> EOF
Push an original commit to the server. This doesn't get pushrebased.
$ cd ../client
$ echo 9 > i
$ hg commit -Aqm c3
$ hg push --to master
pushing rev 5cfa12ac15ac to destination ssh://user@dummy/server bookmark master
searching for changes
updating bookmark master
remote: pushing 1 changeset:
remote: 5cfa12ac15ac c3
$ hg debugmutation
* 5cfa12ac15aca3668b5f91e5a7b92aa309b320a9
Add commits on the server to pushrebase over.
$ cd ../server
$ hg up -q master
$ echo 7 > g
$ hg commit -Aqm s3
$ echo 8 > h
$ hg commit -Aqm s4
Add another commit on the client.
$ cd ../client
$ echo 10 > j
$ hg commit -Aqm c4
$ echo 10a > j
$ hg amend -qm "c4 (amended)"
$ tglogp
@ 254a42c0dcef draft 'c4 (amended)'
o 5cfa12ac15ac public 'c3'
o bc165ecd11df public 'c2 (amended)'
o 466bbcaf803c public 'c1'
o 1f850c9f0d59 public 's2'
o 06569a64c141 public 's1'
o a7d6a32ae4ec public 'base'
Push this commit to the server. We should create local mutation information.
$ hg push --to master
pushing rev 254a42c0dcef to destination ssh://user@dummy/server bookmark master
searching for changes
adding changesets
adding manifests
adding file changes
updating bookmark master
remote: pushing 1 changeset:
remote: 254a42c0dcef c4 (amended)
remote: 3 new changesets from the server will be downloaded
2 files updated, 0 files merged, 0 files removed, 0 files unresolved
$ hg debugmutation -r ".~4::."
* bc165ecd11df56066a4d73e8294a85ecb255d3cf pushrebase by test at 1970-01-01T00:00:00 from:
e52ebff2630810cbc8bc0e3a8de78cb662f0865f amend by test at 1970-01-01T00:00:00 from:
f558c5855324eea33b5f046b45b85db1fb98bca7
* 5cfa12ac15aca3668b5f91e5a7b92aa309b320a9
* 34295f2adc0954d129b43d9ad2d785376eacc3b6
* b6dffa66e38820804c5eaf4d2c9477718f537ce3
* 56ff167c1749dc765639745247323a6139cd9514 pushrebase by test at 1970-01-01T00:00:00 from:
254a42c0dcef8381419add47e4f0ff6cd50ea8c7 amend by test at 1970-01-01T00:00:00 from:
3f1b3b3d517fcd3c8cef763476c588fb99343c3d
```
|
```css
Vertical centering fluid blocks
Horizontal centering fluid blocks
Horizontal centering with `margin: 0 auto;`
Vertically center text
Vertical centering with `margin-top`
```
|
```c++
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// path_to_url
#include <libs/vmd/test/test_assert_is_identifier_fail.cxx>
```
|
The Nadahup languages, also known as Makú (Macú) or Vaupés–Japurá, form a small language family in Brazil, Colombia, and Venezuela. The name Makú is pejorative, being derived from an Arawakan word meaning "without speech". Nadahup is an acronym of the constituent languages.
The Nadahup family should not be confused with several other languages which go by the name Makú. There are proposals linking this unclassified language with Nadahup, but also with other languages.
External relationships
Martins (2005: 342–370) groups the Arawakan and Nadahup languages together as part of a proposed Makúan-Arawakan (Nadahup-Arawakan) family, but this proposal has been rejected by Aikhenvald (2006: 237).
Epps and Bolaños (2017) accept the unity of the four Nadahup languages, but do not consider Puinave to be related.
Language contact
Jolkesky (2016) notes that there are lexical similarities with the Arawa, Guahibo, and Tupi language families due to contact. A discussion of lexical and phonological correspondences between the Nadahup (Vaupés-Japurá) and Tupi languages can be found in Jolkesky and Cabral (2011). Nadahup languages also have various loanwords from Tucanoan languages and Nheengatu.
Languages
Nadahup consists of about four languages, based on mutual intelligibility. Nadeb and Kuyawi, Hup and Yahup, and Nukak and Kakwa, however, share 90% of their vocabulary and are mutually intelligible, and so are separate languages only in a sociolinguistic sense. These four branches are not close: Although the family was first suggested in 1906, only 300 cognates have been found, which include pronouns but no other grammatical forms.
Nadëb may be the most divergent; of the other languages, there is disagreement on the placement of Nïkâk. Martins (1999) propose two classifications, pending further research:
Martins, proposal A
Martins, proposal B
However, Epps considers Hup and Yahup to be distinct languages, and maintains that the inclusion of the poorly attested Nukak and Kakwa has not been demonstrated and is in fact highly dubious:
Epps
Jolkesky (2016)
Internal classification by Jolkesky (2016):
(† = extinct)
Puinave-Nadahup
Nadahup
Nadëb
Nadëb do Rio Negro
Nadëb do Roçado
Hup-Dâw
Dâw
Hup
Hupda
Yuhup
Puinave-Kak
Puinave (Wãnsöhöt)
Kak
Kakwa
Nukak
This classification is also repeated in Nikulin (2019).
Typology
Dâw and Hup—especially Hup—have undergone grammatical restructuring under Tucano influence. They have lost prefixes but acquired suffixes from grammaticalized verb roots. They also have heavily monosyllabic roots, as can be seen by the reduction of Portuguese loan words to their stressed syllable, as in Dâw yẽl’ "money", from Portuguese dinheiro. Nadëb and Nïkâk, on the other hand, have polysyllabic roots. Nïkâk allows a single prefix per word, whereas Nadëb, which lies outside the Vaupés language area, is heavily prefixing and polysynthetic: Up to nine prefixes per word (which is highly unusual for the Amazon), with incorporation of nouns, prepositions, and adverbs.
Genetic relations
Rivet (from 1920), Kaufman (1994) and Pozzobon (1997) include Puinave within the family. However, many of the claimed cognate sets are spurious.
Henley, Mattéi-Müller and Reid (1996) present evidence that the Hodï language (also known as Yuwana) is related.
Puinavean forms part of a hypothetical Macro-Puinavean family along with the Arutani–Sape families and the Máku language.
Macro-Puinavean is included in Joseph Greenberg's larger Macro-Tucanoan stock, but this is universally rejected. Another spurious larger grouping is Morris Swadesh's Macro-Makú.
Vocabulary
Loukotka (1968) lists the following basic vocabulary items for the Macú languages.
Proto-language
For a list of selected Proto-Eastern Makú reconstructions by Martins (2005), see the corresponding Portuguese article.
Bibliography
Campbell, Lyle. (1997). American Indian languages: The historical linguistics of Native America. New York: Oxford University Press. .
Greenberg, Joseph H. (1987). Language in the Americas. Stanford: Stanford University Press.
Henley, Paul; Marie-Claude Mattéi-Müller and Howard Reid (1996): "Cultural and linguistic affinities of the foraging people of North Amazonia: a new perspective"; Antropológica 83: 3–37. Caracas.
Kaufman, Terrence. (1990). Language history in South America: What we know and how to know more. In D. L. Payne (Ed.), Amazonian linguistics: Studies in lowland South American languages (pp. 13–67). Austin: University of Texas Press. .
Kaufman, Terrence. (1992) Guta
Kaufman, Terrence. (1994). The native languages of South America. In C. Mosley & R. E. Asher (Eds.), Atlas of the world's languages (pp. 46–76). London: Routledge.
Pozzobon, Jorge (1997). Langue, société et numération chez les Indiens Makú (Haut Rio Negro, Brésil). Journal de la Société de Américanistes de París 83: 159–172. París.
Rivet, Paul and Constant Tastevin 1920: "Affinités du Makú et du Puinave"; Journal de la Société des Américanistes de París, n.s. t XII: 69–82. París.
Rivet, Paul; P. P. Kok and C. Tastevin 1925: "Nouvele contributión a l'étude de la langue Makú; International Journal of American Linguistics, vol. 3, n. 24, p.p. 129–132. New York.
Lexicons
Bolaños, K. (2010). Kakua phonology: first approach. University of Texas at Austin.
Conduff, K. W. (2006). Diccionario situacional del idioma Nukak. Bogotá: Iglesia Cristiana Nuevos Horizontes.
Erickson, T.; Erickson, C. G. (1993). Vocabulario Jupda-Español-Português. Santafé de Bogotá: Asociación Summer Institute of Linguistics.
Maciel, I. (1991). Alguns aspectos fonológicos e morfológicos da língua Máku. Masters dissertation. Brasilia: Universidade de Brasília.
Martins, V. (1999). Dicionário Nadëb Português / Português Nadëb. (Manuscript).
Martins, V. (2005). Reconstrução Fonológica do Protomaku Oriental. Amsterdam: Vrije Universiteit Amsterdam. (Doctoral dissertation).
Ramirez, H. (2006). A Língua dos Hupd'äh do Alto Rio Negro: dicionário e guia de conversação. São Paulo: Associação Saúde Sem Limites.
Migliazza, E. C. (1965). Fonología Makú. Boletim do MPEG. Antropología, 25:1-17.
Mattei-Müller, M. (n.d.). Vocabulario Comparativo Castellano-Kakwa Vaupes-Guaviare-Hodï''. (Manuscript).
References
External links
Hup Vocabulary List (from the World Loanword Database)
Languages of Venezuela
Languages of Brazil
Languages of Colombia
Language families
Macro-Puinavean languages
|
```html
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>generic::stream_protocol::protocol</title>
<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
<link rel="home" href="../../../boost_asio.html" title="Boost.Asio">
<link rel="up" href="../generic__stream_protocol.html" title="generic::stream_protocol">
<link rel="prev" href="operator_eq__eq_.html" title="generic::stream_protocol::operator==">
<link rel="next" href="socket.html" title="generic::stream_protocol::socket">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
<td align="center"><a href="../../../../../index.html">Home</a></td>
<td align="center"><a href="../../../../../libs/libraries.htm">Libraries</a></td>
<td align="center"><a href="path_to_url">People</a></td>
<td align="center"><a href="path_to_url">FAQ</a></td>
<td align="center"><a href="../../../../../more/index.htm">More</a></td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="operator_eq__eq_.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../generic__stream_protocol.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../boost_asio.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="socket.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_asio.reference.generic__stream_protocol.protocol"></a><a class="link" href="protocol.html" title="generic::stream_protocol::protocol">generic::stream_protocol::protocol</a>
</h4></div></div></div>
<p>
<a class="indexterm" name="boost_asio.indexterm.generic__stream_protocol.protocol"></a>
Obtain
an identifier for the protocol.
</p>
<pre class="programlisting">int protocol() const;
</pre>
</div>
<table xmlns:rev="path_to_url~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
file LICENSE_1_0.txt or copy at <a href="path_to_url" target="_top">path_to_url
</p>
</div></td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="operator_eq__eq_.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../generic__stream_protocol.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../boost_asio.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="socket.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
```
|
```smalltalk
#nullable disable
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using DocumentFormat.OpenXml.Office2010.Excel;
namespace ClosedXML.Excel
{
internal interface IXLCFConverterExtension
{
ConditionalFormattingRule Convert(IXLConditionalFormat cf, XLWorkbook.SaveContext context);
}
}
```
|
```javascript
/**
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
'use strict';
// MODULES //
var dispatch = require( '@stdlib/strided/dispatch' );
var unary = require( '@stdlib/strided/base/unary' );
var resolve = require( '@stdlib/strided/base/dtype-resolve-enum' );
var types = require( './types.json' );
var meta = require( './meta.json' );
var data = require( './data.js' );
// VARIABLES //
var fcn = dispatch( unary, types, data, meta.nargs, meta.nin, meta.nout );
// MAIN //
/**
* Computes the reciprocal square root for each element in a strided array `x` and assigns the results to elements in a strided array `y`.
*
* @param {integer} N - number of indexed elements
* @param {*} dtypeX - `x` data type
* @param {Collection} x - input array
* @param {integer} strideX - `x` stride length
* @param {*} dtypeY - `y` data type
* @param {Collection} y - destination array
* @param {integer} strideY - `y` stride length
* @throws {TypeError} first argument must be an integer
* @throws {TypeError} third argument must be an array-like object
* @throws {TypeError} fourth argument must be an integer
* @throws {TypeError} sixth argument must be an array-like object
* @throws {TypeError} seventh argument must be an integer
* @throws {Error} insufficient arguments
* @throws {Error} too many arguments
* @throws {RangeError} third argument has insufficient elements based on the associated stride and the number of indexed elements
* @throws {RangeError} sixth argument has insufficient elements based on the associated stride and the number of indexed elements
* @throws {TypeError} unable to resolve a strided array function supporting the provided array argument data types
* @returns {Collection} `y`
*
* @example
* var Float64Array = require( '@stdlib/array/float64' );
*
* var x = new Float64Array( [ 0.0, 4.0, 9.0, 12.0, 24.0 ] );
* var y = new Float64Array( [ 0.0, 0.0, 0.0, 0.0, 0.0 ] );
*
* rsqrt( x.length, 'float64', x, 1, 'float64', y, 1 );
* // y => <Float64Array>[ Infinity, 0.5, ~0.333, ~0.289, ~0.204 ]
*/
function rsqrt( N, dtypeX, x, strideX, dtypeY, y, strideY ) {
return fcn( N, resolve( dtypeX ), x, strideX, resolve( dtypeY ), y, strideY ); // eslint-disable-line max-len
}
// EXPORTS //
module.exports = rsqrt;
```
|
```javascript
// ------------------------------------
// Airbrake
// ------------------------------------
module.exports = {
init (logger, conf) {
}
}
```
|
The Heart of Wales line () is a railway line running from Craven Arms in Shropshire to Llanelli in southwest Wales. It serves a number of rural centres, including the nineteenth-century spa towns Llandrindod Wells, Llangammarch Wells and Llanwrtyd Wells. At Builth Road, two miles (3.3 km) from the town of Builth Wells, the line crosses the former route of the earlier Mid Wales Railway, which closed in the 1960s.
History
Historically, the line was known as the Central Wales line () and also included routes through Gowerton, where the railway crossed the West Wales lines and ran through Dunvant and Killay then down through the Clyne Valley to Blackpill, and then along the sea wall to Swansea Bay station, (near the former slip bridge) before finally reaching Swansea Victoria railway station. This section, originally built by the Llanelly Railway and Dock Company to compete with the Great Western Railway and break the monopoly they held on Swansea Dock, closed in 1964. Nationalisation of the railways had removed the need for competing routes, and the running down and closure of Swansea North Dock ended the need for freight services on this section. Trains now use the original LR main line to reach the West Wales lines at Llandeilo Junction and thence and (after a reversal) .
North of , the route was opened in stages between 1861 and 1868 by a number of different companies (all backed by the LNWR) – the Knighton Railway, the Central Wales Railway and Central Wales Extension Railway.
The 1963 Beeching Report proposed the entire Central Wales line be closed but this was refused by the MoT except for the Pontarddulais to Swansea Victoria section. As a rural branch line, it survived the Beeching Axe since it carried freight traffic, serving the steelworks at Bynea and industrial areas such as Ammanford and Pontarddulais, linking them with the docks at Llanelli. It also passed through six marginal constituencies. During engineering work, the line is still occasionally used as a diversionary freight route. The basic service over the line since the seventies has remained more or less constant, with four or five trains per day in each direction on weekdays and two or three on Sundays (although the latter ran in summer only until quite recently).
The line is single track throughout (except for a few miles at the southern end shared with the Swansea District line) and has been operated under a Light Railway Order since 1972. There are five passing loops, at , , , and . Unless "Out of Course" working occurs the Llanwrtyd passing loop is used on two of the Monday – Saturday services and the Llandrindod passing loop is in use on the other two and also on the Sunday services. The signalling was modernised in 1986, when a system known as No Signalman Token Remote working was introduced. This is overseen by the signaller at , with the token instruments at the aforementioned five passing loops being operated by the train crew (the surviving signal boxes at each station having been closed as part of the modernisation scheme and the points converted to automatic operation by British Rail).
For more than two years only two of the loops (Llandrindod and Llanwrtyd) were operational as Network Rail were unable to source spare parts for the points mechanisms used at all five: the design used is now obsolete. Parts had to be taken from the three decommissioned loops to keep the other two operational. In 2009 NR stated their intention to install new conventional electric point machines at all five loops and restore the three out-of-service ones to full working order (after being heavily criticised by the chairman of the South Wales branch of Railfuture at the organisation's recent Annual General Meeting) but were unable to give a timescale for this to be carried out as design work on the new equipment was still ongoing. NR began the replacement works for the points after first installing the system on the line to Pembroke Dock, at the Tenby loop, on 7 December 2009 and then making minor alterations in Feb 2010. was the first on the line to be modernised, the rest followed. The £5 million project was completed in October 2010.
In 2014 Network Rail added exit indicators at the trailing end of each loop to aid in the reversing of services: a decision taken so that all moves have an active indication of the status of the motor points.
In 1987 tragedy struck the line near Llandeilo when the Glanrhyd Bridge collapsed following heavy flooding, and an early morning northbound train plunged into the swollen River Towy, killing four people. For a while the future of the line was in doubt (the equally rural Carmarthen-Aberystwyth line had been closed in 1965 following serious flood damage as the cost of repairs was deemed unacceptable) but political forces of all sides rallied to ensure the line's survival.
Route
After leaving the West Wales Line at Llandeilo Junction (east of ), the route is shared with the Swansea District line as far as Morlais Junction (the site of a serious oil train derailment in the summer of 2020) before passing beneath the M4 Motorway & turning northwards towards and Pantyfynnon. The short tunnel before the former station is the oldest surviving example still in use in Wales (dating from 1839), whilst the freight-only branch along the Amman valley to Gwaun-Cae-Gurwen diverges at the latter. North of , it follows the valley of the River Tywi north to Llandeilo (formerly the junction for ) and then Llandovery, crossing the river at Glanrhyd by a replacement single-span bridge built & commissioned in 1988. North of Llandovery the character of the route changes, as it ascends into the Carmarthenshire hills towards the first of the line's two major summits at Sugar Loaf (820 feet (250 m) above sea level) on gradients as steep as 1 in 60. En route, it passes over the 283-yard (259 m) long Cynghordy viaduct across the Afon Bran valley before crossing the county boundary into Powys through the 1001-yd (915 m) summit tunnel beneath the Black Mountain range. A descent at 1 in 70-80 follows to Llanwrtyd Wells along the valley of the River Irfon, from where it continues via Builth Road to Llandrindod Wells - the largest settlement on the line.
From Llandrindod, the line climbs steadily once more, skirting the Radnor Forest as it heads for the remote station at (some 5 miles (8 km) distant from the village it is named after) and another summit near Llangynllo Tunnel, the highest point on the route at 980 feet (299 m) above sea level. There then follows a 4-mile (6.4 km) descent (again at mostly 1 in 60) to , where the line is carried above the village on a 193-yd (176 m) viaduct with ornate castellated turrets at each end. It then heads to Knighton, where the station is in England but the town it serves is in Wales. The last portion of the route then runs through southwest Shropshire along the valleys of the River Teme & River Clun to join the main Shrewsbury to Hereford line at .
Services today
Passenger services
For many years there were four trains per day in each direction on weekdays and two on Sundays. From May 2015 an additional Monday to Friday train pair in each direction was introduced north of Llandrindod and south of Llandovery, ostensibly to improve commuting possibilities, although the consequential changes to existing services substantially lengthened the working day for those travelling to Shrewsbury. Trains are one or two carriages each, with a small team of staff. A buffet trolley service runs occasionally. The Heart of Wales line runs from Llanelli to Craven Arms, however train services normally terminate at and . Two northbound weekday trains travel onwards from Shrewsbury to , bringing the total journey length to , and one starts from Crewe southbound. Most stations are request stops.
From December 2022 a fifth train through train each way has been introduced as well as a later Shrewsbury-Llandrindod round trip and a late Swansea - Llandovery out and return service on weekdays only.
At Craven Arms, the line joins the Welsh Marches line to Church Stretton and Shrewsbury.
Passenger services are operated by Transport for Wales Rail using Class 150 or Class 153 diesel multiple units, although Class 175s have been used on rare occasions. The continued use of Class 153 DMUs has received criticism, notably from Kirsty Williams AM, who says:
The line has also been used for exceptional train movements, including:
Manchester to trains diverted during engineering works between and
has special trains from Cardiff for the Royal Welsh Show which operate via the Swansea District line between and
Charter trains taking in the scenic beauty of the route, such as The Welshman's charter on Saturday 30 April 2011
Freight services
Although no regular scheduled freight services use this line, the route is maintained to W5 standard to accommodate the occasional EWS diversions for Margam and Llanwern traffic when the south Wales route is closed.
Community rail
This is designated as a community rail partnership.
See also
Railways of Shropshire
History of Wales
Royal Welsh Show
Heart of Wales Line Trail
Notes
References
External links
Heart of Wales Line website
Heart of Wales Line Travellers Association website
Arriva Trains Wales: Heart of Wales Line timetable
Glanrhyd Rail Disaster BBC Report
Scenic Rail Britain: Heart of Wales Line page
Video footage of Llandrindod station
Video footage of Knucklas Station
Railway lines in Wales
Railway lines in the West Midlands (region)
Rail transport in Carmarthenshire
Rail transport in Powys
Rail transport in Shropshire
Rail transport in Swansea
Community railway lines in Wales
|
Stylenanda() is a South Korea-based make-up and fashion brand that is owned by L'Oréal.
Stylenanda was founded in 2004 by Nanda, owned by Kim So Hee. It had further expanded internationally and established branches in Hong Kong, China, Singapore, Japan and Thailand.
May 2, 2018 L'Oréal announced the acquisition of 100% of Nanda Co. Ltd. One of its flagship stores is located in Myeong-dong, Seoul in South Korea. Named Pink Hotel, it is a hotel-themed “everything pink” flagship store.
References
External links
https://wwd.com/beauty-industry-news/beauty-features/how-koreas-stylenanda-became-a-fashion-force-1202664216/
South Korean companies established in 2004
Chemical companies established in 2004
Clothing companies established in 2004
Clothing brands of South Korea
|
```c
/* $OpenBSD: strncmp.c,v 1.9 2015/08/31 02:53:57 guenther Exp $ */
/*
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#include <string.h>
#ifdef _TLIBC_USE_INTEL_FAST_STRING_
extern int _intel_fast_strncmp(const char *, const char *, size_t);
#endif
int
strncmp(const char *s1, const char *s2, size_t n)
{
#ifdef _TLIBC_USE_INTEL_FAST_STRING_
return _intel_fast_strncmp(s1, s2, n);
#else
if (n == 0)
return (0);
do {
if (*s1 != *s2++)
return (*(unsigned char *)s1 - *(unsigned char *)--s2);
if (*s1++ == 0)
break;
} while (--n != 0);
return (0);
#endif
}
```
|
```smalltalk
using System.Collections.Generic;
using System.Threading.Tasks;
namespace DotnetSpider.Statistic.Store;
public class InMemoryStatisticStore : IStatisticStore
{
private readonly Dictionary<string, dynamic> _dict =
new();
private static readonly object Locker = new();
public Task EnsureDatabaseAndTableCreatedAsync()
{
return Task.CompletedTask;
}
public Task IncreaseTotalAsync(string id, long count)
{
lock (Locker)
{
var statistics = GetOrCreate(id);
statistics.IncrementTotal(count);
}
return Task.CompletedTask;
}
public Task IncreaseSuccessAsync(string id)
{
lock (Locker)
{
var statistics = GetOrCreate(id);
statistics.IncrementSuccess();
}
return Task.CompletedTask;
}
public Task IncreaseFailureAsync(string id)
{
lock (Locker)
{
var statistics = GetOrCreate(id);
statistics.IncrementFailure();
}
return Task.CompletedTask;
}
public Task StartAsync(string id, string name)
{
lock (Locker)
{
var statistics = GetOrCreate(id);
statistics.SetName(name);
statistics.OnStarted();
}
return Task.CompletedTask;
}
public Task ExitAsync(string id)
{
lock (Locker)
{
var statistics = GetOrCreate(id);
statistics.OnExited();
}
return Task.CompletedTask;
}
public Task RegisterAgentAsync(string agentId, string agentName)
{
lock (Locker)
{
var statistics = GetAgentStatistics(agentId);
statistics.SetName(agentName);
}
return Task.CompletedTask;
}
public Task IncreaseAgentSuccessAsync(string agentId, int elapsedMilliseconds)
{
lock (Locker)
{
var statistics = GetAgentStatistics(agentId);
statistics.IncreaseSuccess();
statistics.IncreaseElapsedMilliseconds(elapsedMilliseconds);
}
return Task.CompletedTask;
}
public Task IncreaseAgentFailureAsync(string agentId, int elapsedMilliseconds)
{
lock (Locker)
{
var statistics = GetAgentStatistics(agentId);
statistics.IncreaseFailure();
statistics.IncreaseElapsedMilliseconds(elapsedMilliseconds);
}
return Task.CompletedTask;
}
// public Task<PagedResult<AgentStatistic>> PagedQueryAgentStatisticAsync(string keyword, int page, int limit)
// {
// throw new NotImplementedException();
// }
//
// public Task<AgentStatistic> GetAgentStatisticAsync(string id)
// {
// lock (Locker)
// {
// return _dict.ContainsKey(id)
// ? Task.FromResult(_dict[id])
// : Task.FromResult<AgentStatistic>(null);
// }
// }
public Task<SpiderStatistic> GetSpiderStatisticAsync(string id)
{
lock (Locker)
{
return _dict.TryGetValue(id, out var value)
? (Task<SpiderStatistic>)Task.FromResult(value)
: Task.FromResult<SpiderStatistic>(null);
}
}
// public Task<PagedResult<SpiderStatistic>> PagedQuerySpiderStatisticAsync(string keyword, int page, int size)
// {
// throw new NotImplementedException();
// }
private SpiderStatistic GetOrCreate(string id)
{
SpiderStatistic statistic;
if (!_dict.TryGetValue(id, out var value))
{
statistic = new SpiderStatistic(id);
_dict.Add(id, statistic);
}
else
{
statistic = value;
}
return statistic;
}
private AgentStatistic GetAgentStatistics(string id)
{
AgentStatistic statistic;
if (!_dict.TryGetValue(id, out var value))
{
statistic = new AgentStatistic(id);
_dict.Add(id, statistic);
}
else
{
statistic = value;
}
return statistic;
}
}
```
|
```xml
/**
*/
import type { Node } from '@nextcloud/files'
import Vue from 'vue'
import SetCustomReminderModal from '../components/SetCustomReminderModal.vue'
const View = Vue.extend(SetCustomReminderModal)
const mount = document.createElement('div')
mount.id = 'set-custom-reminder-modal'
document.body.appendChild(mount)
// Create a new Vue instance and mount it to our modal container
const CustomReminderModal = new View({
name: 'SetCustomReminderModal',
el: mount,
})
export const pickCustomDate = (node: Node): Promise<void> => {
CustomReminderModal.open(node)
// Wait for the modal to close
return new Promise((resolve) => {
CustomReminderModal.$once('close', resolve)
})
}
```
|
Dayron Miguel Sánchez Briceño (born 29 September 2000) is a Costa Rican footballer who plays as a midfielder for AD Guanacasteca.
Club career
Herediano
Sánchez is a product of C.S. Herediano. On 17 December 2017, 17-year old Sánchez got his official debut for Herediano against Pérez Zeledón in the Liga FPD, when he came in as a substitute for William Quirós in the halftime.
Sánchez did not play for the first team of Herediano again and therefore, he was loaned out to La U Universitarios in the summer 2019. However, he wasn't able to break through there neither and therefore, he left the club again at the end of 2019, without making his debut.
AD Guanacasteca
On 6 January 2020 AD Guanacasteca confirmed, that Sánchez had joined the club.
In January 2023, Sánchez moved on a six-months loan deal to A.D. Municipal Liberia.
References
External links
Living people
2000 births
Costa Rican men's footballers
Men's association football midfielders
Liga FPD players
C.S. Herediano footballers
A.D. Municipal Liberia footballers
|
```c++
/*
*/
#include "qrcode/QRDecoder.h"
#include "BitMatrix.h"
#include "BitMatrixIO.h"
#include "DecoderResult.h"
#include "ECI.h"
#include "gtest/gtest.h"
using namespace ZXing;
using namespace ZXing::QRCode;
TEST(RMQRDecoderTest, RMQRCodeR7x43M)
{
const auto bitMatrix = ParseBitMatrix(
"XXXXXXX X X X X X X XXX X X X X X X X X XXX\n"
"X X X XXX XXXXX XXX X X XX X X\n"
"X XXX X X XXX X X X XXXX XXXX X X XXXXXXXX\n"
"X XXX X XX XXXXX XXXXXX X X X X\n"
"X XXX X XX XXX XXXXXXX X X XX X X X\n"
"X X XXXXX XXX XXX XXXXX XXXXXX X X\n"
"XXXXXXX X X X X X X XXX X X X X X X X XXXXX\n",
'X', false);
const auto result = Decode(bitMatrix);
EXPECT_TRUE(result.isValid());
EXPECT_EQ(result.content().text(TextMode::Plain), "ABCDEFG");
}
TEST(RMQRDecoderTest, RMQRCodeR7x43MError6Bits)
{
const auto bitMatrix = ParseBitMatrix(
"XXXXXXX X X X X X X XXX X X X X X X X X XXX\n"
"X X X XXX XXXXX XXX X X XX X X\n"
"X XXX X X XXX X X XXXX XXXX XX X XXXXXXXX\n" // 2
"X XXX X XX XXXXX X XXXXXX X X X X\n" // 3
"X XXX X XX XXX XXXXXXX X X XXX X X X\n" // 5
"X X XXXXX XXX XXX XXXX X XXXXXX X X\n" // 6
"XXXXXXX X X X X X X XXX X X X X X X X XXXXX\n",
'X', false);
const auto result = Decode(bitMatrix);
EXPECT_EQ(Error::Checksum, result.error());
EXPECT_TRUE(result.text().empty());
EXPECT_TRUE(result.content().text(TextMode::Plain).empty());
}
TEST(RMQRDecoderTest, RMQRCodeR7x139H)
{
const auto bitMatrix = ParseBitMatrix(
"XXXXXXX X X X X X X X X X XXX X X X X X X X X X X X X XXX X X X X X X X X X X X X XXX X X X X X X X X X X X X XXX X X X X X X X X X X X XXX\n"
"X X XX XXX X X X X X XX XX X X X XXX XX XXXX XXX XX XX XX X XX X X X XXX X XX XX XX X X XX X XX XXXX X X X\n"
"X XXX X X XXXXX X XXXXX X X XXX XX X XXX X XX XXX XX X XXX X X XXXX X XXXXXXX X XX XXX X X X XXX X XXXXX\n"
"X XXX X XXXX X XX X X XX XX X XX XX X XXX XX X XX X XX X X XX X X XXX X X X X X X X XX X XX XX X X X\n"
"X XXX X XXXX XXXXX X X XXXXXX XX X XXXX X XXXX X XXX XXXX X XXXXXXX XXX XXXXXX X X XX X XXX X XXXXXXXXX X XXXX X X X X X\n"
"X X X XX XX X X XX X X X XXXX X X X XX X XXX X X X X X XXX XX XXX X X XX XXXX XX X X X X XXXXX XXX XX X XX X\n"
"XXXXXXX X X X X X X X X X XXX X X X X X X X X X X X X XXX X X X X X X X X X X X X XXX X X X X X X X X X X X X XXX X X X X X X X X X X XXXXX\n",
'X', false);
const auto result = Decode(bitMatrix);
EXPECT_TRUE(result.isValid());
EXPECT_EQ(result.content().text(TextMode::Plain), "1234567890,ABCDEFGHIJKLMOPQRSTUVW");
}
TEST(RMQRDecoderTest, RMQRCodeR9x59H)
{
const auto bitMatrix = ParseBitMatrix(
"XXXXXXX X X X X X XXX X X X X X X X X XXX X X X X X X X XXX\n"
"X X X XXXXX XXX X X XXXXXXXX X X X X XXXX X X\n"
"X XXX X XX XXX X XXX XXXX X XXXXXXX X XXXXX X X\n"
"X XXX X XXXX X XX X XX XXXX XX XX X X X XXX X \n"
"X XXX X X X XX XXXXXX X X XX X XX X X XXXX XXXXX\n"
"X X X X X X XXX X X X XX X XXXX XX X X X X\n"
"XXXXXXX XXXXX XXXXXX X XX XXX X XXXX X X X XX X X\n"
" XXX XXXX XX XXX X XXXXXXX X XX XXX XX XX X\n"
"XXX X X X X X X X XXX X X X X X X X X XXX X X X X X X XXXXX\n",
'X', false);
const auto result = Decode(bitMatrix);
EXPECT_TRUE(result.isValid());
EXPECT_EQ(result.content().text(TextMode::Plain), "ABCDEFGHIJKLMN");
}
TEST(RMQRDecoderTest, RMQRCodeR9x77M)
{
const auto bitMatrix = ParseBitMatrix(
"XXXXXXX X X X X X X X X XXX X X X X X X X X X X X XXX X X X X X X X X X X XXX\n"
"X X XXX XX XXX XXX XXXX XXX XX X XXXXXXXXX X XXX XXXX X XXXX XX XXX X\n"
"X XXX X X X X XXX X XXXX XX XX X XX XX XXX XXXX X X XX X X XX X\n"
"X XXX X X X XXXXXX X XX XXXX X XXX X XX X XX XX XX X XXX X X XXX XX \n"
"X XXX X XXXX X X XXXX XXXX XX XXX X XX XXXXXX X X XXX XX XXXXX\n"
"X X X X XX XXX X X XX X X XX XXX X X X X X XX XXXXX X\n"
"XXXXXXX X XX XX X XXXX X X X X X XX XXX X XX X XXX XX X X\n"
" X XXXXX XX X XXXXXX XX XXXXX X XX XX XXXXX XXX X\n"
"XXX X X X X X X X X X X XXX X X X X X X X X X X X XXX X X X X X X X X X XXXXX\n",
'X', false);
const auto result = Decode(bitMatrix);
EXPECT_TRUE(result.isValid());
EXPECT_EQ(result.content().text(TextMode::Plain), "__ABCDEFGH__1234567890___ABCDEFGHIJK");
}
TEST(RMQRDecoderTest, RMQRCodeR11x27H)
{
const auto bitMatrix = ParseBitMatrix(
"XXXXXXX X X X X X X X X XXX\n"
"X X XX X X X X\n"
"X XXX X X XX X X XX\n"
"X XXX X XXXX XX X XXXXXX \n"
"X XXX X X X XX XX XXX X\n"
"X X XXX X XX XXXX X \n"
"XXXXXXX X XX X XXXXX\n"
" X X X X X\n"
"XXXX X X X XX XXXXXX X X\n"
"X XX XXXXXX XXX XXXX X X\n"
"XXX X X X X X X X X X XXXXX\n",
'X', false);
const auto result = Decode(bitMatrix);
EXPECT_TRUE(result.isValid());
EXPECT_EQ(result.content().text(TextMode::Plain), "ABCDEF");
}
TEST(RMQRDecoderTest, RMQRCodeR13x27M_ECI)
{
const auto bitMatrix = ParseBitMatrix(
"XXXXXXX X X X X X X X X XXX\n"
"X X XX XX XXX XX X\n"
"X XXX X XX X XX XX XXX X\n"
"X XXX X XX X XX X X XX \n"
"X XXX X XXXXXXX X X XX\n"
"X X XX X XXX XX XX \n"
"XXXXXXX X X X X XXX\n"
" XXX XX X XX XXX \n"
"XXX XX XX X X XX XX XXXXX\n"
" XXX X X X X X X\n"
"X XX X X XX X XX X X X X\n"
"X X X X X X X X X\n"
"XXX X X X X X X X X X XXXXX\n",
'X', false);
const auto result = Decode(bitMatrix);
EXPECT_TRUE(result.isValid());
EXPECT_EQ(result.content().text(TextMode::Plain), "AB12345AB");
EXPECT_TRUE(result.content().hasECI);
EXPECT_EQ(result.content().encodings[0].eci, ECI::Shift_JIS);
EXPECT_EQ(result.content().symbology.toString(), "]Q1");
}
TEST(RMQRDecoderTest, RMQRCodeR15x59H_GS1)
{
const auto bitMatrix = ParseBitMatrix(
"XXXXXXX X X X X X XXX X X X X X X X X XXX X X X X X X X XXX\n"
"X X XXX XXX X XXXXX XX XXX X X X X X X XXX X\n"
"X XXX X XXX XX X XXX XXX X X XXX XXXXX XX XXX XX\n"
"X XXX X X X XX X X XXX X X X XXXXX XX XXX \n"
"X XXX X XX XXX XX X X X XX XX XX XXX XXXX X XXXX\n"
"X X X X X X X XXX XXX XXXX X XXX XX X X \n"
"XXXXXXX X XXX XXXX X XX XXXX X X XX XXX XXXXX X\n"
" X XXX X XXXXX X XX XXXX XX X \n"
"XX XX X X X XXXXX XX X X XX XX X XX X X XX X\n"
" XX XX X XXXXXX XXX XX X X XX XXX X X XXX \n"
"X X XX XXXXXXXXXX XX X X XX XX XX X XXXX XX XXXXXX\n"
" XX X XX X XXX X X X XXX X XXX X X XXX XXXX X\n"
"XXXX X X XX XXX X X X XX XXXXX XX X XX XXX X X\n"
"X X X XX XXX XXXXXXX XXX X XXX XX X X X XX X\n"
"XXX X X X X X X X XXX X X X X X X X X XXX X X X X X X XXXXX\n",
'X', false);
const auto result = Decode(bitMatrix);
EXPECT_TRUE(result.isValid());
EXPECT_TRUE(result.content().type() == ContentType::GS1);
EXPECT_EQ(result.content().text(TextMode::HRI), "(01)09524000059109(21)12345678p901(10)1234567p(17)231120");
}
TEST(RMQRDecoderTest, RMQRCodeR17x99H)
{
const auto bitMatrix = ParseBitMatrix(
"XXXXXXX X X X X X X X XXX X X X X X X X X X X X XXX X X X X X X X X X X X XXX X X X X X X X X X XXX\n"
"X X X XXXXX XXX X X X XX X X XX XXXXX X XX X XX XXX X X XX X X XXX X X XX X X X\n"
"X XXX X X X XXX XXX X XXX XXX X X XX XXXX X X X X XXX XXXXX X X XX X XX X X\n"
"X XXX X XX X XX X X XX X XXXX X XXXXX X X XX X XXX XX X X X X XXXXXX X \n"
"X XXX X X XX X X X X X X X X XXX XX XXXXXX X X XXX X XXXXXX X X X X X X X XX X\n"
"X X XX X X XXXXX XX X XXX X XX X X XXX X XXX XXX X XXXX XX X X X XX XXXX \n"
"XXXXXXX X XX X XX X X XXX XX X XXXX X X XXX X X XX X XXXX XX X X X XX X XXXX\n"
" XX XX XX XX X XX X X X XXX XX X X XXX XXXX XX X X X X XX XX XXX \n"
"XX X XXX X X XXXX XXX XXXXX XXX XXX X X X X X XXX X XX XX X X X X XX X XXX\n"
" X XXXXX X X XXXXX X XX X XX XXXX X X XXXXX X XX X XX X XX X XX XX \n"
"X XX XX X XX XXX XX XXXXXX X XXXXX XX XXXX X X X X XXXX XX X X XXXXXX XX X X\n"
" XXX XX XXX XX XX X X X XX X X X X XX XXX XXXX X XX XXX X X X XXXX XXXXX X XXX \n"
"X X XX X XX XX XX X X XX X X X XX XXXXXXXX X XX XX X X X X X XX X X XXXXXXXXXXX\n"
" X X X XX X X X XX XXXX X XXX X XX X X X X X XXX XXXXX XX X X X XXXXX X X X\n"
"XXXX XX XX X XXXX XXXX X XX X XX XX XX XXXX XXX X X XX XX X XXXX X XXX XX X XX X X\n"
"X XXX XX XXX X X X XXX X XXX X XXXX XX X X XXXXX X XX X X X X X X X X XXXX XXXX X\n"
"XXX X X X X X X X X X XXX X X X X X X X X X X X XXX X X X X X X X X X X X XXX X X X X X X X X XXXXX\n",
'X', false);
const auto result = Decode(bitMatrix);
EXPECT_TRUE(result.isValid());
EXPECT_EQ(result.content().text(TextMode::Plain), your_sha256_hash______");
}
```
|
Algeria competed at the 2022 World Aquatics Championships in Budapest, Hungary from 18 June to 3 July.
Swimming
References
Nations at the 2022 World Aquatics Championships
2022
World Aquatics Championships
|
The Mecklenburg Class G 2, formerly Class VIII, were goods train locomotives with the Grand Duchy of Mecklenburg Friedrich-Franz Railway. They were built for the route between Güstrow and Neubrandenburg with its steep inclines.
The engines had crossed Hall cranks (gekreuzte Hallschen Kurbeln), an outside frame, Gooch valve gear and a steam dome towards the front. The boilers on all the surviving engines were replaced between 1892 and 1897. In 1895 only four were still in the fleet. The last one was withdrawn around the turn of the 20th century.
See also
Grand Duchy of Mecklenburg Friedrich-Franz Railway
List of Mecklenburg locomotives
References
0-6-0 locomotives
G 2
Railway locomotives introduced in 1864
C n2 locomotives
Sächsische Maschinenfabrik locomotives
Freight locomotives
|
Cristian Martins Cabral (born 28 August 1979 in Uruguaiana, Rio Grande do Sul), simply known as Cristian, is a Brazilian footballer who plays as an attacking midfielder.
Career
Early career
Cristian started his professional career on Velo Clube, a club from Rio Claro, São Paulo. During the period of 1999-2004 he got some highlight while playing the Campeonato Paulista, which lately earned him spells in other traditional clubs such as Guarani, Juventus and Ituano.
Playing for Ituano, where he played the Campeonato Brasileiro Serie B, he started to get the spotlights. In 2004, he was then sold to Paraná.
Paraná
Hired by the club, Cristian soon started to highlight himself in the team, where he played the Campeonato Paranaense, Campeonato Brasileiro Serie A and Copa Sudamericana of that year.
Besides of Paraná's only regular season in Serie A, it was in the club where his career was launched on national range. Due to his performance and regularity on that year, he was nominated for Bola de Prata (Silver Ball) award by Placar Magazine as best midfielder.
His good plays soon drew attention of big Brazilian clubs and also from Europe, which disputed his hiring. Until finally in January 2005 he was hired by Palmeiras.
Cristian would return to Paraná in 2008, where he played the Campeonato Paranaense and Campeonato Brasileiro Serie B of that year.
Palmeiras
On Palmeiras, Cristian arrived as a big promise due to his performance on last year. During his spell in the club, he played the Campeonato Paulista in 2005 and 2006; Campeonato Brasileiro Serie A and Copa Libertadores.
The player always had good presentations while playing for the club. However, due to the 1st team concurrence (specially with Juninho Paulista) he ended up not being much used and by the second half of 2006 he went to Coritiba on loan.
Coritiba
Cristian arrived on Coritiba with the mission to return the club to the Serie A of Campeonato Brasileiro, because the club was relegated to Serie B in 2005. The player was one of the most important players in the squad and was constantly criticized by Coritiba fans (sometimes in excess). However, on that year the club ended up in 6th and was not promoted to Serie A again. Cristian did not have his contract renewed and was then repassed on loan to Náutico.
Fortaleza
After a brief spell on Náutico, where he played the Copa do Brasil and was not much used on 1st team, Cristian was repassed on loan to Fortaleza. Just like in past clubs, he was one of the main players of the squad, also with the mission to return the club to the Serie A of Campeonato Brasileiro. Even with good presentations on Serie B, the club was not promoted to Serie A, ending on 5th place.
The player would return in 2009 to play the Serie B. An injury messed up with his second spell on the club and the team had a bad season, ending on 18th place and being relegated to Serie C.
Khazar Lankaran
In 2010, Cristian had his first experience abroad playing for FK Khazar Lankaran from Azerbaijan. At the club, which already had some Brazilian players on the squad, he played the 2009–10 Azerbaijan Premier League and the 2009–10 Azerbaijan Cup. In the Cup, FK Khazar Lankaran finished as runner-up, getting a slot to the 1st qualifying round of 2010–11 UEFA Europa League.
Itumbiara
After returning from Azerbaijan, Cristian had a brief spell on Bragantino, where he played the Campeonato Paulista in 2011. In the same year, he moved to Itumbiara. At the club, he played 3 important competitions for the team: the 2nd Division of Campeonato Goiano, where the club was the runner-up and thus reaching the main division; Campeonato Brasileiro Serie D in 2011, where the club reached the round of 16; and the 1st Division of Campeonato Goiano in 2012, where the club finished in 5th place.
Treze
Cristian arrived on Treze for the Campeonato Brasileiro Serie C of 2012. There he rapidly became the club's playmaker, creating the main plays and doing several assistances for goals. The club finished the competition in 5th place on group stage and did not reach playoffs, but stayed on Serie C for next year.
After a brief spell on Cerâmica, the player returned to the club for the Serie C of 2013. Captain and considered the best player on squad, Cristian led the team during the season which took the club to Quarter Finals, being beaten by Vila Nova and thus losing a slot to access Serie B in 2014.
Honours
Vitória
Campeonato Baiano: 2009
Ituano
Campeonato Paulista: 2014
References
External links
1979 births
Living people
Brazilian men's footballers
Campeonato Brasileiro Série A players
Campeonato Brasileiro Série B players
Campeonato Brasileiro Série C players
Campeonato Brasileiro Série D players
Clube Atlético Juventus players
Paraná Clube players
Sociedade Esportiva Palmeiras players
Coritiba Foot Ball Club players
Clube Náutico Capibaribe players
Fortaleza Esporte Clube players
Clube Atlético Bragantino players
Itumbiara Esporte Clube players
Ituano FC players
Associação Atlética Ponte Preta players
Associação Ferroviária de Esportes players
Brazilian expatriate men's footballers
Brazilian expatriate sportspeople in Azerbaijan
Expatriate men's footballers in Azerbaijan
Men's association football midfielders
People from Uruguaiana
|
```shell
#!/usr/bin/env bash
# vim:ts=4:sts=4:sw=4:et
#
# Author: Hari Sekhon
# Date: 2021-12-03 17:41:23 +0000 (Fri, 03 Dec 2021)
#
# path_to_url
#
#
# If you're using my code you're welcome to connect with me on LinkedIn and optionally send me feedback to help steer this or other code I publish
#
# path_to_url
#
# path_to_url
set -euo pipefail
[ -n "${DEBUG:-}" ] && set -x
srcdir="$(cd "$(dirname "${BASH_SOURCE[0]}")" && pwd)"
# shellcheck disable=SC1090,SC1091
. "$srcdir/lib/utils.sh"
# shellcheck disable=SC2034,SC2154
usage_description="
Adds / updates Bitbucket Pipelines repo-level secured environment variable(s) from args or stdin
If no second argument is given, reads environment variables from standard input, one per line in 'key=value' format or 'export key=value' shell format
Workspace is case insensitive
Repo slug is case sensitive and must be in lowercase
Variable keys are case-sensitive - a change in case will create a new one
Examples:
${0##*/} HariSekhon/devops-bash-tools AWS_ACCESS_KEY_ID=AKIA...
echo AWS_ACCESS_KEY_ID=AKIA... | ${0##*/} HariSekhon/devops-bash-tools
Loads both AWS_ACCESS_KEY_ID and AWS_SECRET_ACCESS_KEY via stdin:
aws_csv_creds.sh credentials_exported.csv | ${0##*/} HariSekhon/devops-bash-tools
"
# used by usage() in lib/utils.sh
# shellcheck disable=SC2034
usage_args="<workspace>/<repo_slug> [<key>=<value> <key2>=<value2> ...]"
help_usage "$@"
min_args 1 "$@"
workspace_repo_slug="$1"
shift || :
existing_env_vars="$("$srcdir/bitbucket_api.sh" "/repositories/$workspace_repo_slug/pipelines_config/variables/" | jq -r '.values[] | [.key, .uuid] | @tsv')"
add_env_var(){
local env_var="$1"
parse_export_key_value "$env_var"
# shellcheck disable=SC2154
if grep -q "^${key}[[:space:]]" <<< "$existing_env_vars"; then
local variable_uuid
variable_uuid="$(awk "/^${key}[[:space:]]/{print \$2}" <<< "$existing_env_vars" | sed 's/{//;s/}//')"
timestamp "updating Bitbucket environment variable '$key' in repo '$workspace_repo_slug'"
"$srcdir/bitbucket_api.sh" "/repositories/$workspace_repo_slug/pipelines_config/variables/%7B${variable_uuid}%7D" -X PUT -d "{\"key\": \"$key\", \"value\": \"$value\", \"secured\": true}"
else
timestamp "adding Bitbucket environment variable '$key' to repo '$workspace_repo_slug'"
"$srcdir/bitbucket_api.sh" "/repositories/$workspace_repo_slug/pipelines_config/variables/" -X POST -d "{\"key\": \"$key\", \"value\": \"$value\", \"secured\": true}"
fi
}
if [ $# -gt 0 ]; then
for arg in "$@"; do
add_env_var "$arg"
done
else
while read -r line; do
add_env_var "$line"
done
fi
```
|
```php
<?php
declare(strict_types=1);
namespace CodelyTv\Shared\Infrastructure\Persistence\Elasticsearch;
use CodelyTv\Shared\Domain\Criteria\Filter;
use CodelyTv\Shared\Domain\Criteria\FilterOperator;
final class ElasticQueryGenerator
{
private const MUST_TYPE = 'must';
private const MUST_NOT_TYPE = 'must_not';
private const TERM_TERM = 'term';
private const TERM_RANGE = 'range';
private const TERM_WILDCARD = 'wildcard';
private static array $mustNotFields = [FilterOperator::NOT_EQUAL, FilterOperator::NOT_CONTAINS];
public function __invoke(array $query, Filter $filter): array
{
$type = $this->typeFor($filter->operator());
$termLevel = $this->termLevelFor($filter->operator());
$valueTemplate = $filter->operator()->isContaining() ? '*%s*' : '%s';
return array_merge_recursive(
$query,
[
$type => [
$termLevel => [
$filter->field()->value() => sprintf($valueTemplate, strtolower($filter->value()->value())),
],
],
]
);
}
private function typeFor(FilterOperator $operator): string
{
return in_array($operator->value, self::$mustNotFields, true) ? self::MUST_NOT_TYPE : self::MUST_TYPE;
}
private function termLevelFor(FilterOperator $operator): string
{
return match ($operator) {
FilterOperator::EQUAL => self::TERM_TERM,
FilterOperator::NOT_EQUAL => '!=',
FilterOperator::GT, FilterOperator::LT => self::TERM_RANGE,
FilterOperator::CONTAINS, FilterOperator::NOT_CONTAINS => self::TERM_WILDCARD,
};
}
}
```
|
João Nuno Silva Cardoso Lucas (25 October 1979 – 26 May 2015) was a Portuguese footballer who played as a defensive midfielder.
He played professionally in his country for Académica and Boavista, amassing Primeira Liga totals of 129 matches and three goals over five seasons. He moved in 2007 to Red Star Belgrade, being forced to retire shortly after at the age of 28 due to heart problems.
Club career
Born in Caldas da Rainha, Leiria District, Lucas began his career at Académica de Coimbra, making his professional debut during the 1999–2000 season (two matches in the second division) and also being loaned twice to amateur clubs, after which he returned to become an important first-team member.
In 2004–05, Lucas signed with Boavista FC, where he consistently performed during three Primeira Liga seasons. On 3 February 2006, he scored his only official goal for the northerners, in a 3–0 league home win against Associação Naval 1º de Maio.
Retirement
In the 2007 summer transfer window, Lucas joined Serbian giants Red Star Belgrade. However, on 17 March 2008, he announced his decision to stop playing football, as the 28-year-old had heart problems and the doctors told him he would risk his life if he continued playing. "This is the most difficult moment of my life but I have to thank everyone at Red Star who stood by me in the past two months", he told in a news conference.
Death
Lucas died on 26 May 2015 at the age of 35 in his home in Porto. He suffered a sudden cardiac death.
References
External links
Srbijafudbal profile
1979 births
People from Caldas da Rainha
2015 deaths
Portuguese men's footballers
Men's association football midfielders
Primeira Liga players
Liga Portugal 2 players
Académica de Coimbra (football) players
S.C. Pombal players
Anadia F.C. players
Boavista F.C. players
Serbian SuperLiga players
Red Star Belgrade footballers
Portuguese expatriate men's footballers
Expatriate men's footballers in Serbia
Portuguese expatriate sportspeople in Serbia
Portugal men's B international footballers
Footballers from Leiria District
|
mg is a monthly business magazine covering the recreational and medical cannabis business, meeting growing demand for news and information as more states legalize marijuana and the industry and its regulations evolve.
The magazine is named after the abbreviation for milligram, the metric used to measure the THC (psychoactive component) and CBD (non-psychoactive component) in cannabis products.
Regular sections include Harvest (news and statistics), Corner Office, Top Shelf (dispensaries), and Products. Monthly features cover cannabis-industry entrepreneurs, industry activists, and special reports on topics including retailing and branding, manufacturing, and packaging. The magazine also provides commentary on legal and social issues impacting the cannabis industry, from contributors like Ricardo Baca, who writes a monthly column.
It was founded by Darren Roberts, CEO of CANN Media Group LLC, in 2015. In October 2018, the publication released its first supplemental issue on "Soil & Nutrients."
References
External links
Official Website
Lifestyle magazines published in the United States
Monthly magazines published in the United States
Cannabis magazines
Cannabis media in the United States
Magazines published in Los Angeles
Magazines established in 2015
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.