text stringlengths 1 22.8M |
|---|
```go
package xgb
import (
"errors"
)
// Cookie is the internal representation of a cookie, where one is generated
// for *every* request sent by XGB.
// 'cookie' is most frequently used by embedding it into a more specific
// kind of cookie, i.e., 'GetInputFocusCookie'.
type Cookie struct {
conn *Conn
Sequence uint16
replyChan chan []byte
errorChan chan error
pingChan chan bool
}
// NewCookie creates a new cookie with the correct channels initialized
// depending upon the values of 'checked' and 'reply'. Together, there are
// four different kinds of cookies. (See more detailed comments in the
// function for more info on those.)
// Note that a sequence number is not set until just before the request
// corresponding to this cookie is sent over the wire.
//
// Unless you're building requests from bytes by hand, this method should
// not be used.
func (c *Conn) NewCookie(checked, reply bool) *Cookie {
cookie := &Cookie{
conn: c,
Sequence: 0, // we add the sequence id just before sending a request
replyChan: nil,
errorChan: nil,
pingChan: nil,
}
// There are four different kinds of cookies:
// Checked requests with replies get a reply channel and an error channel.
// Unchecked requests with replies get a reply channel and a ping channel.
// Checked requests w/o replies get a ping channel and an error channel.
// Unchecked requests w/o replies get no channels.
// The reply channel is used to send reply data.
// The error channel is used to send error data.
// The ping channel is used when one of the 'reply' or 'error' channels
// is missing but the other is present. The ping channel is way to force
// the blocking to stop and basically say "the error has been received
// in the main event loop" (when the ping channel is coupled with a reply
// channel) or "the request you made that has no reply was successful"
// (when the ping channel is coupled with an error channel).
if checked {
cookie.errorChan = make(chan error, 1)
if !reply {
cookie.pingChan = make(chan bool, 1)
}
}
if reply {
cookie.replyChan = make(chan []byte, 1)
if !checked {
cookie.pingChan = make(chan bool, 1)
}
}
return cookie
}
// Reply detects whether this is a checked or unchecked cookie, and calls
// 'replyChecked' or 'replyUnchecked' appropriately.
//
// Unless you're building requests from bytes by hand, this method should
// not be used.
func (c Cookie) Reply() ([]byte, error) {
// checked
if c.errorChan != nil {
return c.replyChecked()
}
return c.replyUnchecked()
}
// replyChecked waits for a response on either the replyChan or errorChan
// channels. If the former arrives, the bytes are returned with a nil error.
// If the latter arrives, no bytes are returned (nil) and the error received
// is returned.
//
// Unless you're building requests from bytes by hand, this method should
// not be used.
func (c Cookie) replyChecked() ([]byte, error) {
if c.replyChan == nil {
return nil, errors.New("Cannot call 'replyChecked' on a cookie that " +
"is not expecting a *reply* or an error.")
}
if c.errorChan == nil {
return nil, errors.New("Cannot call 'replyChecked' on a cookie that " +
"is not expecting a reply or an *error*.")
}
select {
case reply := <-c.replyChan:
return reply, nil
case err := <-c.errorChan:
return nil, err
}
}
// replyUnchecked waits for a response on either the replyChan or pingChan
// channels. If the former arrives, the bytes are returned with a nil error.
// If the latter arrives, no bytes are returned (nil) and a nil error
// is returned. (In the latter case, the corresponding error can be retrieved
// from (Wait|Poll)ForEvent asynchronously.)
// In all honesty, you *probably* don't want to use this method.
//
// Unless you're building requests from bytes by hand, this method should
// not be used.
func (c Cookie) replyUnchecked() ([]byte, error) {
if c.replyChan == nil {
return nil, errors.New("Cannot call 'replyUnchecked' on a cookie " +
"that is not expecting a *reply*.")
}
select {
case reply := <-c.replyChan:
return reply, nil
case <-c.pingChan:
return nil, nil
}
}
// Check is used for checked requests that have no replies. It is a mechanism
// by which to report "success" or "error" in a synchronous fashion. (Therefore,
// unchecked requests without replies cannot use this method.)
// If the request causes an error, it is sent to this cookie's errorChan.
// If the request was successful, there is no response from the server.
// Thus, pingChan is sent a value when the *next* reply is read.
// If no more replies are being processed, we force a round trip request with
// GetInputFocus.
//
// Unless you're building requests from bytes by hand, this method should
// not be used.
func (c Cookie) Check() error {
if c.replyChan != nil {
return errors.New("Cannot call 'Check' on a cookie that is " +
"expecting a *reply*. Use 'Reply' instead.")
}
if c.errorChan == nil {
return errors.New("Cannot call 'Check' on a cookie that is " +
"not expecting a possible *error*.")
}
// First do a quick non-blocking check to see if we've been pinged.
select {
case err := <-c.errorChan:
return err
case <-c.pingChan:
return nil
default:
}
// Now force a round trip and try again, but block this time.
c.conn.Sync()
select {
case err := <-c.errorChan:
return err
case <-c.pingChan:
return nil
}
}
``` |
Solanum anguivi is a plant indigenous to non-arid parts of Africa, and is commonly known as forest bitterberry or African eggplant, although the latter term is most commonly associated with Solanum aethiopicum.
It is a traditional ethnomedicine in India.
References
anguivi |
Dundonald Park is located in the Centretown neighbourhood of Ottawa, Ontario, Canada. It occupies a city block, with Somerset Street West to the north, Bay Street to the west, MacLaren Street to the south, and Lyon Street to the east. It was named after Douglas Cochrane, 12th Earl of Dundonald, who was the last British officer to command the Canadian militia.
In June 2003, the City of Ottawa and in April 2004, the Canadian federal government put up memorial plaques in Dundonald Park commemorating the Soviet defector, Igor Gouzenko. It was from this park that Royal Canadian Mounted Police agents monitored Gouzenko's apartment across the street on the night men from the Soviet embassy came looking for Gouzenko.
Notes
External links
Dundonald Park community group on Facebook
Parks in Ottawa |
```objective-c
/*
*
* This file is part of the open-source SeetaFace engine, which includes three modules:
* SeetaFace Detection, SeetaFace Alignment, and SeetaFace Identification.
*
* This file is part of the SeetaFace Identification module, containing codes implementing the
* face identification method described in the following paper:
*
*
* VIPLFaceNet: An Open Source Deep Face Recognition SDK,
* Xin Liu, Meina Kan, Wanglong Wu, Shiguang Shan, Xilin Chen.
* In Frontiers of Computer Science.
*
*
* Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China.
*
* The codes are mainly developed by Zining Xu(a M.S. supervised by Prof. Shiguang Shan)
*
* As an open-source face recognition engine: you can redistribute SeetaFace source codes
*
* If not, see < path_to_url
*
* Contact Info: you can send an email to SeetaFace@vipl.ict.ac.cn for any problems.
*
* Note: the above information must be kept whenever or wherever the codes are used.
*
*/
#ifndef CONV_NET_H_
#define CONV_NET_H_
#include "net.h"
#include "net_factory.h"
#include <cstdio>
#include <cstdlib>
#include <cstring>
class ConvNet: public Net {
public:
ConvNet(): Net() {}
virtual ~ConvNet() {}
virtual void SetUp();
virtual void Execute();
protected:
int stride_h_;
int stride_w_;
};
#endif //CONV_NET_H_
``` |
Joe Kraemer (born June 21, 1971) is an American composer and conductor of film and television scores. He has worked with director Christopher McQuarrie several times -- The Way of the Gun (2000), Jack Reacher (2012), and Mission: Impossible – Rogue Nation (2015).
Biography
Kraemer was born in Buffalo, New York and raised in Albany, New York. His father and uncle were both musicians, and Kraemer began taking piano lessons at an early age. In high school he befriended an older boy named Scott Storm, who became a professional filmmaker. Kraemer's first film score was for a Super-8 film written and directed by Storm, called Chiming Hour. Kraemer, who also acted in the film, was 15 at the time. Storm later introduced Kraemer to filmmakers Bryan Singer and Christopher McQuarrie.
While attending Berklee College of Music in Boston, Kraemer decided he wanted to be a film composer. Through contacts such as Singer and McQuarrie, he was able to obtain work first as a sound (and occasionally music) editor, before eventually crossing over into television and film composing.
Kraemer's first feature film score was the 2000 film The Way of the Gun, a modern-day western written and directed by Oscar-winner Christopher McQuarrie. The film starred Benicio del Toro, Ryan Phillippe, and James Caan. Though the film performed poorly at the box office, it became something of a cult classic, and some industry insiders began to expect great things from Kraemer.
Over the next few years, Kraemer scored music for the hit TV series Femme Fatales, the docudrama Emerald Cowboy (2003); in 2006 he teamed up with his old classmate Scott Storm for the low-budget crime thriller Ten 'til Noon, which won awards at the film festival level; and in 2008 he scored the direct-to-video thriller Joy Ride 2: Dead Ahead, written by J. J. Abrams.
In 2012, Kraemer got his chance, composing the score for the Tom Cruise action thriller Jack Reacher (directed by McQuarrie). His score was nominated in the Best Original Score - Feature Film category at the 2012 Hollywood Music In Media Awards. His credits also include the 2014 film Dawn Patrol, starring Scott Eastwood.
Kraemer worked with McQuarrie and Cruise again when he scored the fifth film in the Mission: Impossible franchise, Mission: Impossible – Rogue Nation (2015).
Since 2015, Kraemer has been providing music and sound design to a number of audio plays released by Big Finish Productions. These include spin-offs for Doctor Who characters such as Madam Vastra, Missy and Rose Tyler, starring the original actors.
In 2016, Kraemer was commissioned by the Dallas Chamber Symphony to write new music for F.W. Murnau's Sunrise: A Song of Two Humans.
In 2017, Kraemer composed the score for the teen anthology series Creeped Out on CBBC.
Filmography
Film
Television
Audiobooks
Since 2015, Kraemer has been providing music and sound design to a number of audio plays released by Big Finish Productions. At first, these were mainly Doctor Who Monthly Adventures plays, but Kraemer has moved to work mainly on spin-offs from the main range.
Notes
References
External links
Kraemer scores Jack Reacher
Composer Joe Kraemer Delivers Classic Score for ‘Jack Reacher’
Big Finish Productions with Joe Kraemer
1971 births
American classical composers
American film score composers
Living people
American television composers
20th-century American composers
21st-century American composers
Musicians from Buffalo, New York
Musicians from Albany, New York
Berklee College of Music alumni
American male classical composers
American male film score composers
Male television composers
Classical musicians from New York (state)
20th-century American male musicians
21st-century American male musicians |
Tobacco smoking during pregnancy causes many detrimental effects on health and reproduction, in addition to the general health effects of tobacco. A number of studies have shown that tobacco use is a significant factor in miscarriages among pregnant smokers, and that it contributes to a number of other threats to the health of the foetus.
Because of the associated risks, people are advised not to smoke before, during or after pregnancy. If this is not possible, however, reducing the daily number of cigarettes smoked can minimize the risks for both the mother and child. This is especially true for people in developing countries, where breastfeeding is essential for the child's overall nutritional status.
Smoking before pregnancy
Women who are pregnant or planning to become pregnant are advised to stop smoking. It is important to examine these effects because smoking before, during and after pregnancy is not an unusual behavior among the general population and can have detrimental health impacts, especially among both mother and child, as a result. In 2011, approximately 10% of pregnant women in data collected from 24 U.S. states reported smoking during the last three months of their pregnancy.
According to a 1999 meta-analysis published in the American Journal of Preventive Medicine, smoking prior to pregnancy is strongly related to an increased risk of developing an ectopic pregnancy.
Smoking during pregnancy
According to a study conducted in 2008 by the Pregnancy Risk Assessment Monitoring System (PRAMS) that interviewed people in 26 states in the United States, approximately 13% of women reported smoking during the last three months of pregnancy. Of women who smoked during the last three months of pregnancy, 52% reported smoking five or fewer cigarettes per day, 27% reported smoking six to 10 cigarettes per day, and 21% reported smoking 11 or more cigarettes per day.
In the United States, women whose pregnancies were unintended are 30% more likely to smoke during pregnancy than those whose pregnancies were intended.
Effects on ongoing pregnancy
Smoking during pregnancy can lead to a plethora of health risks and damage to both the mother and the fetus.
Women who smoke during pregnancy are about twice as likely to experience the following pregnancy complications:
premature rupture of membranes, which means that the amniotic sac will rupture prematurely, and will induce labour before the baby is fully developed. Although this complication generally has a good prognosis (in Western countries), it causes stress as the premature child may have to stay in the hospital to gain health and strength to be able to sustain life on their own.
placental abruption, wherein there is premature separation of the placenta from the attachment site. The fetus can be put in distress, and can even die. The mother can lose blood and can have a haemorrhage; she may need a blood transfusion.
placenta previa, where in the placenta grows in the lowest part of the uterus and covers all or part of the opening to the cervix. Having placenta previa is an economic stress as well because it requires having a caesarean section delivery, which require a longer recovery period in the hospital. There can also be complications, such as maternal hemorrhage.
According to a 1999 meta-analysis published in the American Journal of Preventive Medicine, smoking during pregnancy is related to a reduced risk of developing pre-eclampsia.
Premature birth
Some studies show that the probability of premature birth is roughly 50% higher for women who smoke during pregnancy, going from around 8% to 11%.
Implications for the umbilical cord
Smoking can also impair the general development of the placenta, which is problematic because it reduces blood flow to the fetus. When the placenta does not develop fully, the umbilical cord which transfers oxygen and nutrients from the mother's blood to the placenta, cannot transfer enough oxygen and nutrients to the fetus, which will not be able to fully grow and develop. These conditions can result in heavy bleeding during delivery that can endanger mother and baby, although cesarean delivery can prevent most deaths.
Pregnancy-induced hypertension
There is limited evidence that smoking reduces the incidence of pregnancy-induced hypertension, but not when the pregnancy is with multiple babies (i.e. it has no effect on twins, triplets, etc.).
Tic disorders
Other effects of maternal smoking during pregnancy include an increased risk for Tourette syndrome and tic disorders. There is a link between chronic tic disorders, which include Tourette syndrome and other disorders like ADHD and OCD. According to a study published in 2016 in the Journal of the American Academy of Child and Adolescent Psychiatry, there is an especially high risk for children to be born with a chronic tic disorder if their mother is a heavy smoker. Heavy smoking can be defined as ten or more cigarettes each day. With this heavy smoking, researchers have found that there is an increase in risk as high as 66% for the child to have a chronic tic disorder. Maternal smoking during pregnancy is also associated with psychiatric disorders such as ADHD. Concerning the increase risk for Tourette syndrome, there is an increased risk when two or more psychiatric disorders are also existent as maternal smoking leads to a higher chance of having a psychiatric disorder.
Cleft palate
Pregnant women who smoke may be at risk of having a child with cleft palate.
Effects of smoking during pregnancy on the child after birth
Low birth weight
Smoking during pregnancy can result in lower birth weight as well as deformities in the fetus. Smoking nearly doubles the risk of low birthweight babies. In 2004, 11.9% of babies born to smokers had low birthweight as compared to only 7.2% of babies born to nonsmokers. More specifically, infants born to smokers weigh on average 200 grams less than infants born to people who do not smoke.
The nicotine in cigarette smoke constricts the blood vessels in the placenta and carbon monoxide, which is poisonous, enters the fetus' bloodstream, replacing some of the valuable oxygen molecules carried by hemoglobin in the red blood cells. Moreover, because the fetus cannot breathe the smoke out, it has to wait for the placenta to clear it. These effects account for the fact that, on average, babies born to smoking mothers are usually born too early and have a low birth weight (less than 2.5 kilograms or 5.5 pounds), making it more likely the baby will become ill or die.
Premature and low birth weight babies face an increased risk of serious health problems as newborns have chronic lifelong disabilities such as cerebral palsy (a set of motor conditions causing physical disabilities), intellectual disabilities and learning problems.
Sudden infant death syndrome
Sudden infant death syndrome (SIDS) is the sudden death of an infant that is unexplainable by the infant's history. The death also remains unexplainable upon autopsy. Infants exposed to smoke, both during pregnancy and after birth, are found to be more at risk of SIDS due to the increased levels of nicotine often found in SIDS cases. Infants exposed to smoke during pregnancy are up to three times more likely to die of SIDS than children born to non-smoking mothers.
Other birth defects
Smoking can also cause other birth defects, reduced head circumference, altered brainstem development, altered lung structure, and cerebral palsy. Recently the U.S. Public Health Service reported that if all pregnant women in the United States stopped smoking, there would be an estimated 11% reduction in stillbirths and a 5% reduction in newborn deaths.
Future obesity
A recent study has proposed that maternal smoking during pregnancy can lead to future teenage obesity. While no significant differences could be found between young teenagers with smoking mothers as compared to young teenagers with nonsmoking mothers, older teenagers with smoking mothers were found to have on average 26% more body fat and 33% more abdominal fat than similar aged teenagers with non-smoking mothers. This increase in body fat may result from the effects of smoking during pregnancy, which is thought to impact fetal genetic programming in relation to obesity. While the exact mechanism for this difference is currently unknown, studies conducted on animals have indicated that nicotine may affect brain functions that deal with eating impulses and energy metabolism. These differences appear to have a significant effect on the maintenance of a healthy, normal weight. As a result of this alteration to brain function, teenage obesity can in turn lead to a variety of health problems including diabetes (a condition in which the affected individual's blood glucose level is too high and the body is unable to regulate it), hypertension (high blood pressure), and cardiovascular disease (any condition related to the heart but most commonly the thickening of arteries due to excess fat build-up).
Quitting during pregnancy
According to a 2010 study published in the European Journal of Pediatrics, the cessation of maternal smoking during any point during pregnancy reduces the risk of negative pregnancy outcomes when compared to smoking throughout the entire nine months of pregnancy, especially if it is done within the first trimester. The study found that expectant mothers who smoke at any time during the first trimester increase the risk that their child will develop birth defects, particularly congenital heart defects than expectant mothers who have never smoked. The study found that the risk posed to the expectant mother's child increases both with the quantity of cigarettes smoked, as well as the length of time during pregnancy during which the mother continues to smoke. This, per the study, renders a more positive outcome for women who cease smoking for the remainder of their pregnancy relative to women who continue to smoke.
There are many resources to help pregnant women quit smoking such as counseling and drug therapies. For non-pregnant smokers, an often-recommended aid to quitting smoking is through the use of nicotine replacement therapy (NRT) in the form of patches, gum, inhalers, lozenges, sprays or sublingual tablets. NRT, however, delivers nicotine to the expectant mother's child in utero. For some pregnant smokers, NRT might still be the most beneficial and helpful solution to quit smoking. Research in the UK has also shown that e-cigarettes could be more effective than nicotine patches, and because of this, could lead to better pregnancy outcomes. It is important that smokers talk to doctor to determine the best course of action on an individual basis.
Smoking after pregnancy
Infants exposed to smoke, both during pregnancy and after birth, are found to be more at risk of sudden infant death syndrome (SIDS).
Breastfeeding
If one does continue to smoke after giving birth, however, it is still more beneficial to breastfeed than to completely avoid this practice altogether. There is evidence that breastfeeding offers protection against many infectious diseases, especially diarrhea. Even in babies exposed to the harmful effects of nicotine through breast milk, the likelihood of acute respiratory illness is significantly diminished when compared to infants whose mothers smoked but were formula fed. Regardless, the benefits of breastfeeding outweigh the risks of nicotine exposure.
Passive smoking
Passive smoking is associated with many risks to children, including, sudden infant death syndrome (SIDS), asthma, lung infections, impaired respiratory function and slowed lung growth, Crohn's disease, learning difficulties and neurobehavioral effects, an increase in tooth decay, and an increased risk of middle ear infections.
Multigenerational effect
A grandmother who smokes during her daughter's pregnancy transmits an increased risk of asthma to her grandchildren, even if the second-generation mother does not smoke. The multigenerational epigenetic effect of nicotine on lung function has already been demonstrated.
See also
Health effects of tobacco
Alcohol and pregnancy
References
External links
CDC - Tobacco Use and Pregnancy - Reproductive Health
Smoking
Health issues in pregnancy
Health effects of tobacco
Drugs and pregnancy |
All Saints Church is a redundant Anglican church in the village of Wordwell, Suffolk, England. It is recorded in the National Heritage List for England as a designated Grade I listed building, and is under the care of the Churches Conservation Trust. It stands in a small community alongside the B1106 road between Bury St Edmunds and Brandon.
History
The church dates from about 1100. During the 14th and 15th centuries new windows were installed to replace the 12th-century lancet windows. A porch was added in about 1500. By 1757 the church was in a "run down" condition, but it had been "put into good order" by 1829. Later in the 19th century a restoration was carried out between 1857 and 1866 by S. S. Teulon. This included work on the west front, the bellcote, the porch, the priest's doorway, the roofs, the pulpit and the reredos.
Architecture
Exterior
All Saints is constructed in flint rubble, with freestone dressings. The roofs are tiled, and the porch is timber. Its plan is simple, consisting of a nave with a south porch, a chancel, and a bellcote at the west end. The church contains Norman features, while the windows added later are in Decorated style. The north and south doorways are Norman with round-headed arches; they are identical in form, and have Saxon influences. The tympanum of the south doorway contains a pair of lions with dog-like features surrounded by foliage. The north doorway is blocked, and its tympanum contains two human figures, one holding a ring. There is a grid-like object between them. It has been suggested that they represent Saint Catherine and her wheel, and Saint Lawrence with a gridiron.
Interior
The chancel arch is also Norman, as is the circular font. The benches date from the 15th century and have carvings. All the bench ends have poppyheads. Some of the benches have additional carvings, including representations of animals. One bench is carved on its back with wild boars, and figures having human faces but animal bodies. The rest of the fittings date from the 1888 restoration.
See also
List of churches preserved by the Churches Conservation Trust in the East of England
References
Grade I listed churches in Suffolk
Church of England church buildings in Suffolk
English churches with Norman architecture
English Gothic architecture in Suffolk
Gothic Revival architecture in Suffolk
Churches completed in 1866
Churches preserved by the Churches Conservation Trust
19th-century Church of England church buildings
1866 establishments in England |
Provotorova () is a rural locality () in Nikolsky Selsoviet Rural Settlement, Oktyabrsky District, Kursk Oblast, Russia. Population:
Geography
The village is located on the Rogozna River (a right tributary of the Seym River), 78 km from the Russia–Ukraine border, 30 km north-west of Kursk, 22 km north-west of the district center – the urban-type settlement Pryamitsyno, at the northern border of the selsoviet center – Stoyanova.
Climate
Provotorova has a warm-summer humid continental climate (Dfb in the Köppen climate classification).
Transport
Provotorova is located 22 km from the federal route Crimea Highway (a part of the European route ), 17.5 km from the road of regional importance (Kursk – Lgov – Rylsk – border with Ukraine), 5.5 km from the road of intermunicipal significance (Dyakonovo – Starkovo – Sokolovka), on the road (38N-073 – Stoyanova), 19 km from the nearest railway halt 433 km (railway line Lgov I — Kursk).
The rural locality is situated 39 km from Kursk Vostochny Airport, 143 km from Belgorod International Airport and 241 km from Voronezh Peter the Great Airport.
References
Notes
Sources
Rural localities in Oktyabrsky District, Kursk Oblast |
```groff
.TH IBCHECKPORTSTATE 8 "May 21, 2007" "OpenIB" "OpenIB Diagnostics"
.SH NAME
ibcheckportstate \- validate IB port for LinkUp and not Active state
.SH SYNOPSIS
.B ibcheckportstate
[\-h] [\-v] [\-N | \-nocolor] [\-G] [\-C ca_name] [\-P ca_port]
[\-t(imeout) timeout_ms] <lid|guid> <port>
.SH DESCRIPTION
.PP
Check connectivity and check the specified port for proper port state
(Active) and port physical state (LinkUp).
Port address is a lid unless -G option is used to specify a GUID address.
.SH OPTIONS
.PP
\-G use GUID address argument. In most cases, it is the Port GUID.
Example:
"0x08f1040023"
.PP
\-v increase the verbosity level
.PP
\-N | \-nocolor use mono rather than color mode
.PP
\-C <ca_name> use the specified ca_name.
.PP
\-P <ca_port> use the specified ca_port.
.PP
\-t <timeout_ms> override the default timeout for the solicited mads.
.SH EXAMPLE
.PP
ibcheckportstate 2 3 # check lid 2 port 3
.SH SEE ALSO
.BR smpquery(8),
.BR ibaddr(8)
.SH AUTHOR
.TP
Hal Rosenstock
.RI < halr@voltaire.com >
``` |
The College of Engineering and Applied Science is the engineering and applied science college of the University of Cincinnati in Cincinnati, Ohio. It is the birthplace of the cooperative education (co-op) program and still holds the largest public mandatory cooperative education program at a public university in the United States. Today, it has a student population of around 4,898 undergraduate and 1,305 graduate students and is recognized annually as one of the top 100 engineering colleges in the US, ranking 83rd in 2020.
History
College of Engineering
The creation of the College of Engineering first began with the appointment of a Professor of Civil Engineering in 1874 and the organization of a Department of Engineering at the University of Cincinnati. Established as a college of the university in 1900, the College of Engineering's first dean was Harry Thomas Cory. In 1923 a six-year cooperative program was added in general engineering which led to dual degrees: a bachelor of engineering and a master of science. The college began offering courses in engineering through its own evening division in 1924 and by 1926 grew to include course work in applied arts. In the 1950s the college began to offer graduate instruction in every department. A joint project with the Engineer’s Council for Professional Development and local industry provided opportunities for engineers to pursue graduate degrees without leaving their jobs. In 1995, new class and research space was created with the opening of the Engineering Research Center, which was designed by architect and UC alum Michael Graves.
College of Applied Science
The College of Applied Science was an applied science college at the University of Cincinnati in Cincinnati, Ohio. Organized as the Ohio Mechanics Institute (OMI) in 1828, it merged with UC in 1969 and was renamed the OMI College of Applied Science in 1978. Formally the school was referred to as the College of Applied Science, CAS offered programs in the engineering technologies and related areas.
The first cooperative education (co-op) program
By 1906, Dean Herman Schneider established the first cooperative education (co-op) program in the United States. The program was established to support Theory with Practice, the belief being that engineers who graduated with both classroom instruction and practical training would be better prepared and have a better foundation to be successful in the practice of engineering. The college allows students to choose either an industry or a research track co-op. The program continues to be the largest mandatory cooperative education program at a public university in the United States and is annually ranked as one of the top 5 programs in the country. Additionally, this program has proven so successful in preparing graduates for their careers that more than 1,000 schools offer forms of it today.
Programs
The College offers programs spread across seven departments. Except for the Department of Engineering Education which focuses on the Freshman curriculum, all Departments offer PhD programs, Masters of Science, Masters of Engineering, and Bachelors Programs.
Aerospace Engineering
Aerospace Engineering
Engineering Mechanics
Fire Science
Biomedical Engineering
Biomedical Engineering
Chemical Engineering and Environmental Engineering
Chemical Engineering
Environmental Engineering
Environmental Science
Civil and Architectural Engineering and Construction Management
Architectural Engineering
Civil Engineering
Construction Management
Electrical Engineering and Computer Science
Computer Engineering
Computer Science
Electrical Engineering
Electrical Engineering Technology
Engineering Education
Cybersecurity Engineering
Engineering Education
Freshman Engineering Programs
Research in Teaching and Learning
Course Development
Learning Center
Mechanical & Materials Engineering
Mechanical Engineering
Mechanical Engineering Technology
Materials Engineering
ACCEND Program
The College of engineering and Applied Science also offers an ACCelerated ENgineering Degree program where students can graduate in 5 years with a bachelor's and master's degree. Students work with their academic adviser during their first year to determine if this program is suitable for them. Several of the programs offer MBA degrees in conjunction with the Lindner College of Business. the program options are listed below:
Aerospace with Aerospace master's, Aerospace with MBA, Chemical with Chemical master's, Chemical with MBA, Chemical with Materials master's, Civil with MBA, Civil with Environmental master's, Energy & Materials with MBA, Mechanical with MBA, Electrical with Computer Eng master's, Electrical with Electrical master's, Mechanical with Mechanical master's
Research Centers & Institutes
Aerosol and Air Quality Research Lab
Advanced Materials Characterization Center
Center of Academic Excellence in Cyber Operations
Center for Global Design & Manufacturing
Center for Medical Device Innovation & Entrepreneurship (MDIEP)
Center for Mobile and Distributed Computing
Center for Intelligent Propulsion and Advanced Life Management of Systems (CIPALMS)
Center for Robotics Research
Center for Surgical Innovation
Cleanroom
Collaboratory for Medical Innovation and Implementation
Digital Design Environments Laboratory (DDEL)
Environmental Analysis Service Center
National Science Foundation Industry University Cooperative Research for Intelligent Maintenance Systems (IMS)
National Science Foundation (NSF) Engineering Research Center for Revolutionizing Metallic Biomaterials
Next Mobility Lab
Ohio Center for Microfluidic Innovation
Radiological Assessment & Measurement Lab
Siemens Simulation Technology Center
Sustainable Solutions Laboratory
UC Simulation Center
Research Labs
Center Hill Research Center
Located at Center Hill Research Center, the Large Scale Test Facility (UCLSTF) is a state-of-art laboratory for testing of large-scale structural projects. The laboratory is served by a 30-ton overhead crane with a 5-ton auxiliary hook, and two 60-gallon per minute pumps. This facility is equipped with computerized controllers capable of controlling an array of sensors to allow testing of large to full-scale structural components and systems. The laboratory has a machine shop for fabrication of specimens, test fixtures, etc. and is equipped to allow testing of full-scale bridge girders and other linear elements up to 100' long, and full-scale buildings up to 2 stories high.
UC Simulation Center
The UC Simulation Center is a collaboration between UC CEAS and Procter & Gamble. Its purpose is to support undergraduate students (coops) and graduate students in doing research for Procter & Gamble. The intent is to not only provide short-term lower-cost simulation to P&G, but also to provide a source of highly trained experts in simulation, making them desirable for employment by Procter & Gamble. The center is also built around the next generation of students, utilizing virtual collaboration to enable flexibility in the working hours for the students.
Rankings
The College of Engineering and Applied Science is regularly ranked as one of the top engineering schools in the country. In the 2011 U.S. News & World Report rankings, the college was ranked 78th in the U.S.
2007 Faculty Scholarly Productivity Index
Environmental Engineering, 6th in the U.S.
Biomedical Sciences, 9th in the U.S.
U.S. News & World Report
Computer Engineering, 77th in the U.S.
Computer Science, 112th in the U.S.
Electrical Engineering, 89th in the U.S.
Environmental Engineering, 20th in the U.S.
Aerospace Engineering, 31st in the U.S.
Industrial Engineering, 37th in the U.S.
Civil Engineering, 48th in the U.S.
Materials Engineering, 50th in the U.S.
Mechanical Engineering, 60th in the U.S.
Facilities
Baldwin Hall was built in 1911 and is the headquarters for administration and academic classrooms. The building reopened in January 2002 after extensive renovations with computing laboratories, electronic classroom, and seminar rooms.
Rhodes Hall was built adjacent to Baldwin Hall to accommodate the expansion that took place in the 1970s. The building provides faculty offices, undergraduate and graduate laboratories, and a 12,000 sq. ft. high bay area. In fall of 2011, construction will begin on the 10,000 sf CEAS Alumni Learning Center in Rhodes Hall which will include labs, research space, and areas for students, professors, and alumni to gather and collaborate.
Mantei Center (formerly Engineering Research Center)
Opened in 1995, this facility houses state-of-the-art research laboratories and offices for graduate students and faculty. It is conveniently located adjacent to the existing engineering complex and was designed to look like a 4-cylinder engine. It was recently renamed to honor distinguished professor Thomas Mantei.
Old Chemistry Building
Used for offices, classrooms, and laboratories. Many engineering departments, and UC colleges, share the space for research, administration, instruction, and program support.
References
External links
University of Cincinnati College of Engineering and Applied Science official site
History of the College of Engineering
University of Cincinnati Simulation Center
Cooperative Engineer, Student & Alumni Publication from 1921 to 1975
Engineering schools and colleges in the United States
Engineering universities and colleges in Ohio
University of Cincinnati
Universities and colleges established in 1874
1874 establishments in Ohio |
Nacer Abdellah (born 3 March 1966 in Sidi Slimane) is a retired Moroccan football player. Abdellah started his career in Belgium with KV Mechelen, and played most of his career for Belgian teams. He also made 24 appearances for the Morocco, and played at the 1994 FIFA World Cup in the matches against Belgium and Saudi Arabia.
Just before the 1994 World Cup in the U.S., a statement of Nacer Abdellah lead to controversy. Abdellah said that his former teammate at Cercle Brugge, the Belgian Josip Weber wouldn't score during the tournament.
References
Cerclemuseum.be
1966 births
Living people
1994 FIFA World Cup players
Belgian Pro League players
CD Ourense footballers
Cercle Brugge K.S.V. players
Expatriate men's footballers in Belgium
Expatriate men's footballers in the Netherlands
Expatriate men's footballers in Spain
FC Den Bosch players
SC Telstar players
Moroccan men's footballers
Moroccan expatriate sportspeople in Belgium
Moroccan expatriate sportspeople in Spain
Moroccan expatriate sportspeople in the Netherlands
Morocco men's international footballers
K.V. Mechelen players
Men's association football defenders
People from Sidi Slimane
KAC Marrakech players
K.F.C. Lommel S.K. players |
Tongyang () is a town of Shuyang County in northwestern Jiangsu province, China, and is directly served by China National Highway 205. The town, which has 47,500 residents now, was also known as Yinping Town before 2000.
Villages
Tongyang town now has 15 villages:
Yinping Neighborhood
Tongdong Neighborhood
Tongbei Village
Tongxi Village
Tongnan Village
Caocun Village
Maling Village
Chaoyang Village
Zhouzhuang Village
Wutan Village
Dazhai Village
Houtun Village
Zhabu Village
Yaozhuang Village
Shanyang Village
References
www.cfguide.com
Township-level divisions of Jiangsu
Suqian |
was a town located in Soo District, Kagoshima Prefecture, Japan. It is also known as Iwagawa.
As of 2003, the town had an estimated population of 12,941 and the density of 88.89 persons per km2. The total area was 145.58 km2.
On July 1, 2005, Ōsumi, along with the towns of Sueyoshi and Takarabe (all from Soo District), was merged to create the city of Soo and no longer exists as an independent municipality.
Festivals
Osumi (Iwagawa) is the home to the Yagorodon Festival that is held in November.
References
Japanese Wikipedia article on Soo District
External links
Official website of Soo
Dissolved municipalities of Kagoshima Prefecture |
In mathematics, even and odd ordinals extend the concept of parity from the natural numbers to the ordinal numbers. They are useful in some transfinite induction proofs.
The literature contains a few equivalent definitions of the parity of an ordinal α:
Every limit ordinal (including 0) is even. The successor of an even ordinal is odd, and vice versa.
Let α = λ + n, where λ is a limit ordinal and n is a natural number. The parity of α is the parity of n.
Let n be the finite term of the Cantor normal form of α. The parity of α is the parity of n.
Let α = ωβ + n, where n is a natural number. The parity of α is the parity of n.
If α = 2β, then α is even. Otherwise α = 2β + 1 and α is odd.
Unlike the case of even integers, one cannot go on to characterize even ordinals as ordinal numbers of the form Ordinal multiplication is not commutative, so in general In fact, the even ordinal cannot be expressed as β + β, and the ordinal number
(ω + 3)2 = (ω + 3) + (ω + 3) = ω + (3 + ω) + 3 = ω + ω + 3 = ω2 + 3
is not even.
A simple application of ordinal parity is the idempotence law for cardinal addition (given the well-ordering theorem). Given an infinite cardinal κ, or generally any limit ordinal κ, κ is order-isomorphic to both its subset of even ordinals and its subset of odd ordinals. Hence one has the cardinal sum
References
Ordinal numbers
Parity (mathematics) |
Perigonia leucopus is a moth of the family Sphingidae. It is known from Brazil.
The forewing upperside similar to Perigonia stulta, but the base and postmedian area are shaded with grey and there is a conspicuous lunate patch on the outer margin. There is a brown marginal band on the hindwing upperside. There is a tornal patch that is paler than the rest of the wing on the hindwing underside.
References
Perigonia
Moths described in 1910 |
```php
<?php
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
*/
namespace Google\Service\CloudTalentSolution;
class ListTenantsResponse extends \Google\Collection
{
protected $collection_key = 'tenants';
protected $metadataType = ResponseMetadata::class;
protected $metadataDataType = '';
/**
* @var string
*/
public $nextPageToken;
protected $tenantsType = Tenant::class;
protected $tenantsDataType = 'array';
/**
* @param ResponseMetadata
*/
public function setMetadata(ResponseMetadata $metadata)
{
$this->metadata = $metadata;
}
/**
* @return ResponseMetadata
*/
public function getMetadata()
{
return $this->metadata;
}
/**
* @param string
*/
public function setNextPageToken($nextPageToken)
{
$this->nextPageToken = $nextPageToken;
}
/**
* @return string
*/
public function getNextPageToken()
{
return $this->nextPageToken;
}
/**
* @param Tenant[]
*/
public function setTenants($tenants)
{
$this->tenants = $tenants;
}
/**
* @return Tenant[]
*/
public function getTenants()
{
return $this->tenants;
}
}
// Adding a class alias for backwards compatibility with the previous class name.
class_alias(ListTenantsResponse::class, 'Google_Service_CloudTalentSolution_ListTenantsResponse');
``` |
James McVeigh (born 2 July 1949) is an English former professional footballer. He played for Wolverhampton Wanderers and Gillingham between 1968 and 1972.
References
External links
Jimmy McVeigh, Post War English & Scottish Football League A - Z Player's Transfer Database
1949 births
Living people
Men's association football defenders
English men's footballers
Gillingham F.C. players
Wolverhampton Wanderers F.C. players
Maidstone United F.C. (1897) players
Canterbury City F.C. players
Ebbsfleet United F.C. players
English Football League players
Place of birth missing (living people) |
United Nations Security Council Resolution 1746, adopted unanimously on March 23, 2007, after reaffirming all resolutions on the situation in Afghanistan, including resolutions 1659 (2006) and 1662 (2006), the Council extended the mandate of the United Nations Assistance Mission in Afghanistan (UNAMA) for an additional period of twelve months, until March 23, 2008.
Resolution
Observations
The preamble of Resolution 1746 reaffirmed the Security Council's commitment to the sovereignty, territorial integrity, independence and unity of Afghanistan and offered support for the implementation of the "Afghanistan Compact" and Afghanistan National Development Strategy.
Meanwhile, the resolution recognised the interconnected nature of the problems in Afghanistan and stressed the mutually reinforcing issues of progress relating to security, governance and development. It was also important to combat narcotic and terrorist threats posed by the Taliban, Al-Qaeda and other groups.
It also reaffirmed the role of the United Nations in Afghanistan, particularly the synergies in the objectives of UNAMA and the International Security Assistance Force (ISAF), in addition to its support for the 2002 Kabul Declaration on Good-Neighbourly Relations.
Acts
The Security Council renewed the mandate of UNAMA for an additional twelve months from the date of the adoption of the current resolution. UNAMA was instructed to promote a more "coherent international engagement" in support of Afghanistan, while its expansion into the provinces was welcomed. The Afghan authorities and international community were urged to implement the "Afghanistan Compact" fully and meet benchmarks.
The resolution welcomed progress in the disarmament, demobilisation and reintegration programme and new strategies relating to justice reform and drugs control with relation to opium. There was a need for Afghan parties to engage in an inclusive political dialogue, and to address corruption.
The Security Council called for respect of human rights and international humanitarian law throughout Afghanistan, calling on UNAMA and the United Nations High Commissioner for Refugees (UNHCR) to assist in the implementation of human rights aspects of the Afghan constitution.
Furthermore, Afghanistan was called upon to co-operate with UNAMA in the course of its mandate, ensuring its safety and freedom of movement. ISAF, including Operation Enduring Freedom, were asked to address the threat of terrorism and extremism posed by Al-Qaeda, the Taliban and other groups in the country. At the same time, the promotion of confidence-building measures was urged between Afghanistan and neighbouring countries.
Finally, the Secretary-General Kofi Annan was directed to report every six months on the situation in Afghanistan.
See also
War in Afghanistan (1978–present)
List of United Nations Security Council Resolutions 1701 to 1800 (2006–2008)
War in Afghanistan (2001–present)
References
External links
Text of the Resolution at undocs.org
1746
2007 in Afghanistan
1746
March 2007 events |
Muhaymin Mustafa (born 10 October 1999) is a Sudanese-Turkish professional basketball player for Galatasaray Ekmas of the Turkish Basketbol Süper Ligi (BSL) and the Basketball Champions League.
Early life
Muhaymin Mustafa was born in North Nicosia to Sudanese parents who moved to Cyprus for higher education. Muhaymin grew up in Kyrenia. He excelled in track and field as well as basketball where he won the national championship in both long jump and high jump events in primary school. He was scouted by Anadolu Efes along with his brother and both of them moved to İstanbul to join Anadolu Efes when Muhaymin was 10.
Professional career
Mustafa made his professional debut with Pertevniyal in Turkish Basketball First League (TBL) during the 2015-2016 season. Pertevniyal's long term agreement as a feeder club to Efes was concluded after that season, resulting Anadolu Efes fielding a B team, Anadolu Efes Gelişim to the Regional League. He moved to this team while playing for the firsts in friendly games occasionally. Mustafa was also named to the training camp roster of Anadolu Efes which was held in Slovenia in 2016.
Mustafa made his Basketbol Süper Ligi (BSL) debut on 8 October 2017, two days before his 18th birthday against Pınar Karşıyaka. He recorded 8 points against Banvit on 25 December 2017 as his personal record in BSL. He made his EuroLeague debut on 29 December 2017 against Brose Bamberg.
On 9 January 2018, Mustafa signed a two-way contract with the TBL team İstanbulspor Beylikdüzü allowing him to play both İstanbulspor and Anadolu Efes in a move intended to maximise his playing time. On 23 February 2018, he received his first start in a EuroLeague game against Zalgiris Kaunas. He started as a small forward, finishing the game with four points and an assist.
Ionikos Nikaias (2020–2022)
Mustafa moved to the Greek Basket League for the 2020-2021 season, averaging 4.9 points, 2.9 rebounds, and 1.2 steals with Ionikos Nikaias. On 12 September 2021 he renewed his contract with the Greek club for another two years. During the 2021-22 campaign, in a total of 20 games, he averaged 8.4 points, 4.6 rebounds and 1.3 assists, playing around 24 minutes per contest.
Galatasaray Ekmas (2022–)
On June 25, 2022, Mustafa signed with Galatasaray Ekmas of the Basketbol Süper Ligi (BSL).
International career
Mustafa has chosen to represent Turkey on the international level. He played for the under 16, under 17 and the under 18 national teams. He received the bronze medal in 2015 FIBA Europe Under-16 Championship and the silver medal in 2016 FIBA Under-17 World Championship. He also represented Turkey in 2017 FIBA Europe Under-18 Championship, finishing in fourth-place. Mustafa was called up to the national B team for their training camp in August 2021.
References
External links
TBLStat.net Profile
EuroLeague Profile
1999 births
Living people
Anadolu Efes S.K. players
Galatasaray S.K. (men's basketball) players
Ionikos Nikaias B.C. players
People from Kyrenia
Shooting guards
Small forwards
Sportspeople from North Nicosia
Tofaş S.K. players
Turkish Cypriot expatriate sportspeople in Turkey
Turkish men's basketball players
Turkish people of Sudanese descent |
Morgan is an unincorporated community in Jackson County, West Virginia, United States.
References
Unincorporated communities in West Virginia
Unincorporated communities in Jackson County, West Virginia |
```c
/*
* VP9 compatible video decoder
*
*
* This file is part of FFmpeg.
*
* FFmpeg is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
*
* FFmpeg is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
*
* You should have received a copy of the GNU Lesser General Public
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include "avcodec.h"
#include "get_bits.h"
#include "internal.h"
#include "profiles.h"
#include "thread.h"
#include "videodsp.h"
#include "vp56.h"
#include "vp9.h"
#include "vp9data.h"
#include "vp9dsp.h"
#include "libavutil/avassert.h"
#include "libavutil/pixdesc.h"
#define VP9_SYNCCODE 0x498342
struct VP9Filter {
uint8_t level[8 * 8];
uint8_t /* bit=col */ mask[2 /* 0=y, 1=uv */][2 /* 0=col, 1=row */]
[8 /* rows */][4 /* 0=16, 1=8, 2=4, 3=inner4 */];
};
typedef struct VP9Block {
uint8_t seg_id, intra, comp, ref[2], mode[4], uvmode, skip;
enum FilterMode filter;
VP56mv mv[4 /* b_idx */][2 /* ref */];
enum BlockSize bs;
enum TxfmMode tx, uvtx;
enum BlockLevel bl;
enum BlockPartition bp;
} VP9Block;
typedef struct VP9Context {
VP9SharedContext s;
VP9DSPContext dsp;
VideoDSPContext vdsp;
GetBitContext gb;
VP56RangeCoder c;
VP56RangeCoder *c_b;
unsigned c_b_size;
VP9Block *b_base, *b;
int pass;
int row, row7, col, col7;
uint8_t *dst[3];
ptrdiff_t y_stride, uv_stride;
uint8_t ss_h, ss_v;
uint8_t last_bpp, bpp, bpp_index, bytesperpixel;
uint8_t last_keyframe;
enum AVPixelFormat pix_fmt, last_fmt;
ThreadFrame next_refs[8];
struct {
uint8_t lim_lut[64];
uint8_t mblim_lut[64];
} filter_lut;
unsigned tile_row_start, tile_row_end, tile_col_start, tile_col_end;
unsigned sb_cols, sb_rows, rows, cols;
struct {
prob_context p;
uint8_t coef[4][2][2][6][6][3];
} prob_ctx[4];
struct {
prob_context p;
uint8_t coef[4][2][2][6][6][11];
} prob;
struct {
unsigned y_mode[4][10];
unsigned uv_mode[10][10];
unsigned filter[4][3];
unsigned mv_mode[7][4];
unsigned intra[4][2];
unsigned comp[5][2];
unsigned single_ref[5][2][2];
unsigned comp_ref[5][2];
unsigned tx32p[2][4];
unsigned tx16p[2][3];
unsigned tx8p[2][2];
unsigned skip[3][2];
unsigned mv_joint[4];
struct {
unsigned sign[2];
unsigned classes[11];
unsigned class0[2];
unsigned bits[10][2];
unsigned class0_fp[2][4];
unsigned fp[4];
unsigned class0_hp[2];
unsigned hp[2];
} mv_comp[2];
unsigned partition[4][4][4];
unsigned coef[4][2][2][6][6][3];
unsigned eob[4][2][2][6][6][2];
} counts;
// contextual (left/above) cache
DECLARE_ALIGNED(16, uint8_t, left_y_nnz_ctx)[16];
DECLARE_ALIGNED(16, uint8_t, left_mode_ctx)[16];
DECLARE_ALIGNED(16, VP56mv, left_mv_ctx)[16][2];
DECLARE_ALIGNED(16, uint8_t, left_uv_nnz_ctx)[2][16];
DECLARE_ALIGNED(8, uint8_t, left_partition_ctx)[8];
DECLARE_ALIGNED(8, uint8_t, left_skip_ctx)[8];
DECLARE_ALIGNED(8, uint8_t, left_txfm_ctx)[8];
DECLARE_ALIGNED(8, uint8_t, left_segpred_ctx)[8];
DECLARE_ALIGNED(8, uint8_t, left_intra_ctx)[8];
DECLARE_ALIGNED(8, uint8_t, left_comp_ctx)[8];
DECLARE_ALIGNED(8, uint8_t, left_ref_ctx)[8];
DECLARE_ALIGNED(8, uint8_t, left_filter_ctx)[8];
uint8_t *above_partition_ctx;
uint8_t *above_mode_ctx;
// FIXME maybe merge some of the below in a flags field?
uint8_t *above_y_nnz_ctx;
uint8_t *above_uv_nnz_ctx[2];
uint8_t *above_skip_ctx; // 1bit
uint8_t *above_txfm_ctx; // 2bit
uint8_t *above_segpred_ctx; // 1bit
uint8_t *above_intra_ctx; // 1bit
uint8_t *above_comp_ctx; // 1bit
uint8_t *above_ref_ctx; // 2bit
uint8_t *above_filter_ctx;
VP56mv (*above_mv_ctx)[2];
// whole-frame cache
uint8_t *intra_pred_data[3];
struct VP9Filter *lflvl;
DECLARE_ALIGNED(32, uint8_t, edge_emu_buffer)[135 * 144 * 2];
// block reconstruction intermediates
int block_alloc_using_2pass;
int16_t *block_base, *block, *uvblock_base[2], *uvblock[2];
uint8_t *eob_base, *uveob_base[2], *eob, *uveob[2];
struct { int x, y; } min_mv, max_mv;
DECLARE_ALIGNED(32, uint8_t, tmp_y)[64 * 64 * 2];
DECLARE_ALIGNED(32, uint8_t, tmp_uv)[2][64 * 64 * 2];
uint16_t mvscale[3][2];
uint8_t mvstep[3][2];
} VP9Context;
static const uint8_t bwh_tab[2][N_BS_SIZES][2] = {
{
{ 16, 16 }, { 16, 8 }, { 8, 16 }, { 8, 8 }, { 8, 4 }, { 4, 8 },
{ 4, 4 }, { 4, 2 }, { 2, 4 }, { 2, 2 }, { 2, 1 }, { 1, 2 }, { 1, 1 },
}, {
{ 8, 8 }, { 8, 4 }, { 4, 8 }, { 4, 4 }, { 4, 2 }, { 2, 4 },
{ 2, 2 }, { 2, 1 }, { 1, 2 }, { 1, 1 }, { 1, 1 }, { 1, 1 }, { 1, 1 },
}
};
static void vp9_unref_frame(AVCodecContext *ctx, VP9Frame *f)
{
ff_thread_release_buffer(ctx, &f->tf);
av_buffer_unref(&f->extradata);
av_buffer_unref(&f->hwaccel_priv_buf);
f->segmentation_map = NULL;
f->hwaccel_picture_private = NULL;
}
static int vp9_alloc_frame(AVCodecContext *ctx, VP9Frame *f)
{
VP9Context *s = ctx->priv_data;
int ret, sz;
if ((ret = ff_thread_get_buffer(ctx, &f->tf, AV_GET_BUFFER_FLAG_REF)) < 0)
return ret;
sz = 64 * s->sb_cols * s->sb_rows;
if (!(f->extradata = av_buffer_allocz(sz * (1 + sizeof(struct VP9mvrefPair))))) {
goto fail;
}
f->segmentation_map = f->extradata->data;
f->mv = (struct VP9mvrefPair *) (f->extradata->data + sz);
if (ctx->hwaccel) {
const AVHWAccel *hwaccel = ctx->hwaccel;
av_assert0(!f->hwaccel_picture_private);
if (hwaccel->frame_priv_data_size) {
f->hwaccel_priv_buf = av_buffer_allocz(hwaccel->frame_priv_data_size);
if (!f->hwaccel_priv_buf)
goto fail;
f->hwaccel_picture_private = f->hwaccel_priv_buf->data;
}
}
return 0;
fail:
vp9_unref_frame(ctx, f);
return AVERROR(ENOMEM);
}
static int vp9_ref_frame(AVCodecContext *ctx, VP9Frame *dst, VP9Frame *src)
{
int res;
if ((res = ff_thread_ref_frame(&dst->tf, &src->tf)) < 0) {
return res;
} else if (!(dst->extradata = av_buffer_ref(src->extradata))) {
goto fail;
}
dst->segmentation_map = src->segmentation_map;
dst->mv = src->mv;
dst->uses_2pass = src->uses_2pass;
if (src->hwaccel_picture_private) {
dst->hwaccel_priv_buf = av_buffer_ref(src->hwaccel_priv_buf);
if (!dst->hwaccel_priv_buf)
goto fail;
dst->hwaccel_picture_private = dst->hwaccel_priv_buf->data;
}
return 0;
fail:
vp9_unref_frame(ctx, dst);
return AVERROR(ENOMEM);
}
static int update_size(AVCodecContext *ctx, int w, int h)
{
#define HWACCEL_MAX (CONFIG_VP9_DXVA2_HWACCEL + CONFIG_VP9_D3D11VA_HWACCEL + CONFIG_VP9_VAAPI_HWACCEL)
enum AVPixelFormat pix_fmts[HWACCEL_MAX + 2], *fmtp = pix_fmts;
VP9Context *s = ctx->priv_data;
uint8_t *p;
int bytesperpixel = s->bytesperpixel, res;
av_assert0(w > 0 && h > 0);
if (s->intra_pred_data[0] && w == ctx->width && h == ctx->height && s->pix_fmt == s->last_fmt)
return 0;
if ((res = ff_set_dimensions(ctx, w, h)) < 0)
return res;
if (s->pix_fmt == AV_PIX_FMT_YUV420P) {
#if CONFIG_VP9_DXVA2_HWACCEL
*fmtp++ = AV_PIX_FMT_DXVA2_VLD;
#endif
#if CONFIG_VP9_D3D11VA_HWACCEL
*fmtp++ = AV_PIX_FMT_D3D11VA_VLD;
#endif
#if CONFIG_VP9_VAAPI_HWACCEL
*fmtp++ = AV_PIX_FMT_VAAPI;
#endif
}
*fmtp++ = s->pix_fmt;
*fmtp = AV_PIX_FMT_NONE;
res = ff_thread_get_format(ctx, pix_fmts);
if (res < 0)
return res;
ctx->pix_fmt = res;
s->last_fmt = s->pix_fmt;
s->sb_cols = (w + 63) >> 6;
s->sb_rows = (h + 63) >> 6;
s->cols = (w + 7) >> 3;
s->rows = (h + 7) >> 3;
#define assign(var, type, n) var = (type) p; p += s->sb_cols * (n) * sizeof(*var)
av_freep(&s->intra_pred_data[0]);
// FIXME we slightly over-allocate here for subsampled chroma, but a little
// bit of padding shouldn't affect performance...
p = av_malloc(s->sb_cols * (128 + 192 * bytesperpixel +
sizeof(*s->lflvl) + 16 * sizeof(*s->above_mv_ctx)));
if (!p)
return AVERROR(ENOMEM);
assign(s->intra_pred_data[0], uint8_t *, 64 * bytesperpixel);
assign(s->intra_pred_data[1], uint8_t *, 64 * bytesperpixel);
assign(s->intra_pred_data[2], uint8_t *, 64 * bytesperpixel);
assign(s->above_y_nnz_ctx, uint8_t *, 16);
assign(s->above_mode_ctx, uint8_t *, 16);
assign(s->above_mv_ctx, VP56mv(*)[2], 16);
assign(s->above_uv_nnz_ctx[0], uint8_t *, 16);
assign(s->above_uv_nnz_ctx[1], uint8_t *, 16);
assign(s->above_partition_ctx, uint8_t *, 8);
assign(s->above_skip_ctx, uint8_t *, 8);
assign(s->above_txfm_ctx, uint8_t *, 8);
assign(s->above_segpred_ctx, uint8_t *, 8);
assign(s->above_intra_ctx, uint8_t *, 8);
assign(s->above_comp_ctx, uint8_t *, 8);
assign(s->above_ref_ctx, uint8_t *, 8);
assign(s->above_filter_ctx, uint8_t *, 8);
assign(s->lflvl, struct VP9Filter *, 1);
#undef assign
// these will be re-allocated a little later
av_freep(&s->b_base);
av_freep(&s->block_base);
if (s->bpp != s->last_bpp) {
ff_vp9dsp_init(&s->dsp, s->bpp, ctx->flags & AV_CODEC_FLAG_BITEXACT);
ff_videodsp_init(&s->vdsp, s->bpp);
s->last_bpp = s->bpp;
}
return 0;
}
static int update_block_buffers(AVCodecContext *ctx)
{
VP9Context *s = ctx->priv_data;
int chroma_blocks, chroma_eobs, bytesperpixel = s->bytesperpixel;
if (s->b_base && s->block_base && s->block_alloc_using_2pass == s->s.frames[CUR_FRAME].uses_2pass)
return 0;
av_free(s->b_base);
av_free(s->block_base);
chroma_blocks = 64 * 64 >> (s->ss_h + s->ss_v);
chroma_eobs = 16 * 16 >> (s->ss_h + s->ss_v);
if (s->s.frames[CUR_FRAME].uses_2pass) {
int sbs = s->sb_cols * s->sb_rows;
s->b_base = av_malloc_array(s->cols * s->rows, sizeof(VP9Block));
s->block_base = av_mallocz(((64 * 64 + 2 * chroma_blocks) * bytesperpixel * sizeof(int16_t) +
16 * 16 + 2 * chroma_eobs) * sbs);
if (!s->b_base || !s->block_base)
return AVERROR(ENOMEM);
s->uvblock_base[0] = s->block_base + sbs * 64 * 64 * bytesperpixel;
s->uvblock_base[1] = s->uvblock_base[0] + sbs * chroma_blocks * bytesperpixel;
s->eob_base = (uint8_t *) (s->uvblock_base[1] + sbs * chroma_blocks * bytesperpixel);
s->uveob_base[0] = s->eob_base + 16 * 16 * sbs;
s->uveob_base[1] = s->uveob_base[0] + chroma_eobs * sbs;
} else {
s->b_base = av_malloc(sizeof(VP9Block));
s->block_base = av_mallocz((64 * 64 + 2 * chroma_blocks) * bytesperpixel * sizeof(int16_t) +
16 * 16 + 2 * chroma_eobs);
if (!s->b_base || !s->block_base)
return AVERROR(ENOMEM);
s->uvblock_base[0] = s->block_base + 64 * 64 * bytesperpixel;
s->uvblock_base[1] = s->uvblock_base[0] + chroma_blocks * bytesperpixel;
s->eob_base = (uint8_t *) (s->uvblock_base[1] + chroma_blocks * bytesperpixel);
s->uveob_base[0] = s->eob_base + 16 * 16;
s->uveob_base[1] = s->uveob_base[0] + chroma_eobs;
}
s->block_alloc_using_2pass = s->s.frames[CUR_FRAME].uses_2pass;
return 0;
}
// for some reason the sign bit is at the end, not the start, of a bit sequence
static av_always_inline int get_sbits_inv(GetBitContext *gb, int n)
{
int v = get_bits(gb, n);
return get_bits1(gb) ? -v : v;
}
static av_always_inline int inv_recenter_nonneg(int v, int m)
{
return v > 2 * m ? v : v & 1 ? m - ((v + 1) >> 1) : m + (v >> 1);
}
// differential forward probability updates
static int update_prob(VP56RangeCoder *c, int p)
{
static const int inv_map_table[255] = {
7, 20, 33, 46, 59, 72, 85, 98, 111, 124, 137, 150, 163, 176,
189, 202, 215, 228, 241, 254, 1, 2, 3, 4, 5, 6, 8, 9,
10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 21, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 34, 35, 36, 37, 38, 39,
40, 41, 42, 43, 44, 45, 47, 48, 49, 50, 51, 52, 53, 54,
55, 56, 57, 58, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69,
70, 71, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84,
86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 99, 100,
101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 112, 113, 114, 115,
116, 117, 118, 119, 120, 121, 122, 123, 125, 126, 127, 128, 129, 130,
131, 132, 133, 134, 135, 136, 138, 139, 140, 141, 142, 143, 144, 145,
146, 147, 148, 149, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160,
161, 162, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175,
177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 190, 191,
192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 203, 204, 205, 206,
207, 208, 209, 210, 211, 212, 213, 214, 216, 217, 218, 219, 220, 221,
222, 223, 224, 225, 226, 227, 229, 230, 231, 232, 233, 234, 235, 236,
237, 238, 239, 240, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251,
252, 253, 253,
};
int d;
/* This code is trying to do a differential probability update. For a
* current probability A in the range [1, 255], the difference to a new
* probability of any value can be expressed differentially as 1-A,255-A
* where some part of this (absolute range) exists both in positive as
* well as the negative part, whereas another part only exists in one
* half. We're trying to code this shared part differentially, i.e.
* times two where the value of the lowest bit specifies the sign, and
* the single part is then coded on top of this. This absolute difference
* then again has a value of [0,254], but a bigger value in this range
* indicates that we're further away from the original value A, so we
* can code this as a VLC code, since higher values are increasingly
* unlikely. The first 20 values in inv_map_table[] allow 'cheap, rough'
* updates vs. the 'fine, exact' updates further down the range, which
* adds one extra dimension to this differential update model. */
if (!vp8_rac_get(c)) {
d = vp8_rac_get_uint(c, 4) + 0;
} else if (!vp8_rac_get(c)) {
d = vp8_rac_get_uint(c, 4) + 16;
} else if (!vp8_rac_get(c)) {
d = vp8_rac_get_uint(c, 5) + 32;
} else {
d = vp8_rac_get_uint(c, 7);
if (d >= 65)
d = (d << 1) - 65 + vp8_rac_get(c);
d += 64;
av_assert2(d < FF_ARRAY_ELEMS(inv_map_table));
}
return p <= 128 ? 1 + inv_recenter_nonneg(inv_map_table[d], p - 1) :
255 - inv_recenter_nonneg(inv_map_table[d], 255 - p);
}
static int read_colorspace_details(AVCodecContext *ctx)
{
static const enum AVColorSpace colorspaces[8] = {
AVCOL_SPC_UNSPECIFIED, AVCOL_SPC_BT470BG, AVCOL_SPC_BT709, AVCOL_SPC_SMPTE170M,
AVCOL_SPC_SMPTE240M, AVCOL_SPC_BT2020_NCL, AVCOL_SPC_RESERVED, AVCOL_SPC_RGB,
};
VP9Context *s = ctx->priv_data;
int bits = ctx->profile <= 1 ? 0 : 1 + get_bits1(&s->gb); // 0:8, 1:10, 2:12
s->bpp_index = bits;
s->bpp = 8 + bits * 2;
s->bytesperpixel = (7 + s->bpp) >> 3;
ctx->colorspace = colorspaces[get_bits(&s->gb, 3)];
if (ctx->colorspace == AVCOL_SPC_RGB) { // RGB = profile 1
static const enum AVPixelFormat pix_fmt_rgb[3] = {
AV_PIX_FMT_GBRP, AV_PIX_FMT_GBRP10, AV_PIX_FMT_GBRP12
};
s->ss_h = s->ss_v = 0;
ctx->color_range = AVCOL_RANGE_JPEG;
s->pix_fmt = pix_fmt_rgb[bits];
if (ctx->profile & 1) {
if (get_bits1(&s->gb)) {
av_log(ctx, AV_LOG_ERROR, "Reserved bit set in RGB\n");
return AVERROR_INVALIDDATA;
}
} else {
av_log(ctx, AV_LOG_ERROR, "RGB not supported in profile %d\n",
ctx->profile);
return AVERROR_INVALIDDATA;
}
} else {
static const enum AVPixelFormat pix_fmt_for_ss[3][2 /* v */][2 /* h */] = {
{ { AV_PIX_FMT_YUV444P, AV_PIX_FMT_YUV422P },
{ AV_PIX_FMT_YUV440P, AV_PIX_FMT_YUV420P } },
{ { AV_PIX_FMT_YUV444P10, AV_PIX_FMT_YUV422P10 },
{ AV_PIX_FMT_YUV440P10, AV_PIX_FMT_YUV420P10 } },
{ { AV_PIX_FMT_YUV444P12, AV_PIX_FMT_YUV422P12 },
{ AV_PIX_FMT_YUV440P12, AV_PIX_FMT_YUV420P12 } }
};
ctx->color_range = get_bits1(&s->gb) ? AVCOL_RANGE_JPEG : AVCOL_RANGE_MPEG;
if (ctx->profile & 1) {
s->ss_h = get_bits1(&s->gb);
s->ss_v = get_bits1(&s->gb);
s->pix_fmt = pix_fmt_for_ss[bits][s->ss_v][s->ss_h];
if (s->pix_fmt == AV_PIX_FMT_YUV420P) {
av_log(ctx, AV_LOG_ERROR, "YUV 4:2:0 not supported in profile %d\n",
ctx->profile);
return AVERROR_INVALIDDATA;
} else if (get_bits1(&s->gb)) {
av_log(ctx, AV_LOG_ERROR, "Profile %d color details reserved bit set\n",
ctx->profile);
return AVERROR_INVALIDDATA;
}
} else {
s->ss_h = s->ss_v = 1;
s->pix_fmt = pix_fmt_for_ss[bits][1][1];
}
}
return 0;
}
static int decode_frame_header(AVCodecContext *ctx,
const uint8_t *data, int size, int *ref)
{
VP9Context *s = ctx->priv_data;
int c, i, j, k, l, m, n, w, h, max, size2, res, sharp;
int last_invisible;
const uint8_t *data2;
/* general header */
if ((res = init_get_bits8(&s->gb, data, size)) < 0) {
av_log(ctx, AV_LOG_ERROR, "Failed to initialize bitstream reader\n");
return res;
}
if (get_bits(&s->gb, 2) != 0x2) { // frame marker
av_log(ctx, AV_LOG_ERROR, "Invalid frame marker\n");
return AVERROR_INVALIDDATA;
}
ctx->profile = get_bits1(&s->gb);
ctx->profile |= get_bits1(&s->gb) << 1;
if (ctx->profile == 3) ctx->profile += get_bits1(&s->gb);
if (ctx->profile > 3) {
av_log(ctx, AV_LOG_ERROR, "Profile %d is not yet supported\n", ctx->profile);
return AVERROR_INVALIDDATA;
}
s->s.h.profile = ctx->profile;
if (get_bits1(&s->gb)) {
*ref = get_bits(&s->gb, 3);
return 0;
}
s->last_keyframe = s->s.h.keyframe;
s->s.h.keyframe = !get_bits1(&s->gb);
last_invisible = s->s.h.invisible;
s->s.h.invisible = !get_bits1(&s->gb);
s->s.h.errorres = get_bits1(&s->gb);
s->s.h.use_last_frame_mvs = !s->s.h.errorres && !last_invisible;
if (s->s.h.keyframe) {
if (get_bits_long(&s->gb, 24) != VP9_SYNCCODE) { // synccode
av_log(ctx, AV_LOG_ERROR, "Invalid sync code\n");
return AVERROR_INVALIDDATA;
}
if ((res = read_colorspace_details(ctx)) < 0)
return res;
// for profile 1, here follows the subsampling bits
s->s.h.refreshrefmask = 0xff;
w = get_bits(&s->gb, 16) + 1;
h = get_bits(&s->gb, 16) + 1;
if (get_bits1(&s->gb)) // display size
skip_bits(&s->gb, 32);
} else {
s->s.h.intraonly = s->s.h.invisible ? get_bits1(&s->gb) : 0;
s->s.h.resetctx = s->s.h.errorres ? 0 : get_bits(&s->gb, 2);
if (s->s.h.intraonly) {
if (get_bits_long(&s->gb, 24) != VP9_SYNCCODE) { // synccode
av_log(ctx, AV_LOG_ERROR, "Invalid sync code\n");
return AVERROR_INVALIDDATA;
}
if (ctx->profile >= 1) {
if ((res = read_colorspace_details(ctx)) < 0)
return res;
} else {
s->ss_h = s->ss_v = 1;
s->bpp = 8;
s->bpp_index = 0;
s->bytesperpixel = 1;
s->pix_fmt = AV_PIX_FMT_YUV420P;
ctx->colorspace = AVCOL_SPC_BT470BG;
ctx->color_range = AVCOL_RANGE_JPEG;
}
s->s.h.refreshrefmask = get_bits(&s->gb, 8);
w = get_bits(&s->gb, 16) + 1;
h = get_bits(&s->gb, 16) + 1;
if (get_bits1(&s->gb)) // display size
skip_bits(&s->gb, 32);
} else {
s->s.h.refreshrefmask = get_bits(&s->gb, 8);
s->s.h.refidx[0] = get_bits(&s->gb, 3);
s->s.h.signbias[0] = get_bits1(&s->gb) && !s->s.h.errorres;
s->s.h.refidx[1] = get_bits(&s->gb, 3);
s->s.h.signbias[1] = get_bits1(&s->gb) && !s->s.h.errorres;
s->s.h.refidx[2] = get_bits(&s->gb, 3);
s->s.h.signbias[2] = get_bits1(&s->gb) && !s->s.h.errorres;
if (!s->s.refs[s->s.h.refidx[0]].f->buf[0] ||
!s->s.refs[s->s.h.refidx[1]].f->buf[0] ||
!s->s.refs[s->s.h.refidx[2]].f->buf[0]) {
av_log(ctx, AV_LOG_ERROR, "Not all references are available\n");
return AVERROR_INVALIDDATA;
}
if (get_bits1(&s->gb)) {
w = s->s.refs[s->s.h.refidx[0]].f->width;
h = s->s.refs[s->s.h.refidx[0]].f->height;
} else if (get_bits1(&s->gb)) {
w = s->s.refs[s->s.h.refidx[1]].f->width;
h = s->s.refs[s->s.h.refidx[1]].f->height;
} else if (get_bits1(&s->gb)) {
w = s->s.refs[s->s.h.refidx[2]].f->width;
h = s->s.refs[s->s.h.refidx[2]].f->height;
} else {
w = get_bits(&s->gb, 16) + 1;
h = get_bits(&s->gb, 16) + 1;
}
// Note that in this code, "CUR_FRAME" is actually before we
// have formally allocated a frame, and thus actually represents
// the _last_ frame
s->s.h.use_last_frame_mvs &= s->s.frames[CUR_FRAME].tf.f->width == w &&
s->s.frames[CUR_FRAME].tf.f->height == h;
if (get_bits1(&s->gb)) // display size
skip_bits(&s->gb, 32);
s->s.h.highprecisionmvs = get_bits1(&s->gb);
s->s.h.filtermode = get_bits1(&s->gb) ? FILTER_SWITCHABLE :
get_bits(&s->gb, 2);
s->s.h.allowcompinter = s->s.h.signbias[0] != s->s.h.signbias[1] ||
s->s.h.signbias[0] != s->s.h.signbias[2];
if (s->s.h.allowcompinter) {
if (s->s.h.signbias[0] == s->s.h.signbias[1]) {
s->s.h.fixcompref = 2;
s->s.h.varcompref[0] = 0;
s->s.h.varcompref[1] = 1;
} else if (s->s.h.signbias[0] == s->s.h.signbias[2]) {
s->s.h.fixcompref = 1;
s->s.h.varcompref[0] = 0;
s->s.h.varcompref[1] = 2;
} else {
s->s.h.fixcompref = 0;
s->s.h.varcompref[0] = 1;
s->s.h.varcompref[1] = 2;
}
}
}
}
s->s.h.refreshctx = s->s.h.errorres ? 0 : get_bits1(&s->gb);
s->s.h.parallelmode = s->s.h.errorres ? 1 : get_bits1(&s->gb);
s->s.h.framectxid = c = get_bits(&s->gb, 2);
/* loopfilter header data */
if (s->s.h.keyframe || s->s.h.errorres || s->s.h.intraonly) {
// reset loopfilter defaults
s->s.h.lf_delta.ref[0] = 1;
s->s.h.lf_delta.ref[1] = 0;
s->s.h.lf_delta.ref[2] = -1;
s->s.h.lf_delta.ref[3] = -1;
s->s.h.lf_delta.mode[0] = 0;
s->s.h.lf_delta.mode[1] = 0;
memset(s->s.h.segmentation.feat, 0, sizeof(s->s.h.segmentation.feat));
}
s->s.h.filter.level = get_bits(&s->gb, 6);
sharp = get_bits(&s->gb, 3);
// if sharpness changed, reinit lim/mblim LUTs. if it didn't change, keep
// the old cache values since they are still valid
if (s->s.h.filter.sharpness != sharp)
memset(s->filter_lut.lim_lut, 0, sizeof(s->filter_lut.lim_lut));
s->s.h.filter.sharpness = sharp;
if ((s->s.h.lf_delta.enabled = get_bits1(&s->gb))) {
if ((s->s.h.lf_delta.updated = get_bits1(&s->gb))) {
for (i = 0; i < 4; i++)
if (get_bits1(&s->gb))
s->s.h.lf_delta.ref[i] = get_sbits_inv(&s->gb, 6);
for (i = 0; i < 2; i++)
if (get_bits1(&s->gb))
s->s.h.lf_delta.mode[i] = get_sbits_inv(&s->gb, 6);
}
}
/* quantization header data */
s->s.h.yac_qi = get_bits(&s->gb, 8);
s->s.h.ydc_qdelta = get_bits1(&s->gb) ? get_sbits_inv(&s->gb, 4) : 0;
s->s.h.uvdc_qdelta = get_bits1(&s->gb) ? get_sbits_inv(&s->gb, 4) : 0;
s->s.h.uvac_qdelta = get_bits1(&s->gb) ? get_sbits_inv(&s->gb, 4) : 0;
s->s.h.lossless = s->s.h.yac_qi == 0 && s->s.h.ydc_qdelta == 0 &&
s->s.h.uvdc_qdelta == 0 && s->s.h.uvac_qdelta == 0;
if (s->s.h.lossless)
ctx->properties |= FF_CODEC_PROPERTY_LOSSLESS;
/* segmentation header info */
if ((s->s.h.segmentation.enabled = get_bits1(&s->gb))) {
if ((s->s.h.segmentation.update_map = get_bits1(&s->gb))) {
for (i = 0; i < 7; i++)
s->s.h.segmentation.prob[i] = get_bits1(&s->gb) ?
get_bits(&s->gb, 8) : 255;
if ((s->s.h.segmentation.temporal = get_bits1(&s->gb))) {
for (i = 0; i < 3; i++)
s->s.h.segmentation.pred_prob[i] = get_bits1(&s->gb) ?
get_bits(&s->gb, 8) : 255;
}
}
if (get_bits1(&s->gb)) {
s->s.h.segmentation.absolute_vals = get_bits1(&s->gb);
for (i = 0; i < 8; i++) {
if ((s->s.h.segmentation.feat[i].q_enabled = get_bits1(&s->gb)))
s->s.h.segmentation.feat[i].q_val = get_sbits_inv(&s->gb, 8);
if ((s->s.h.segmentation.feat[i].lf_enabled = get_bits1(&s->gb)))
s->s.h.segmentation.feat[i].lf_val = get_sbits_inv(&s->gb, 6);
if ((s->s.h.segmentation.feat[i].ref_enabled = get_bits1(&s->gb)))
s->s.h.segmentation.feat[i].ref_val = get_bits(&s->gb, 2);
s->s.h.segmentation.feat[i].skip_enabled = get_bits1(&s->gb);
}
}
}
// set qmul[] based on Y/UV, AC/DC and segmentation Q idx deltas
for (i = 0; i < (s->s.h.segmentation.enabled ? 8 : 1); i++) {
int qyac, qydc, quvac, quvdc, lflvl, sh;
if (s->s.h.segmentation.enabled && s->s.h.segmentation.feat[i].q_enabled) {
if (s->s.h.segmentation.absolute_vals)
qyac = av_clip_uintp2(s->s.h.segmentation.feat[i].q_val, 8);
else
qyac = av_clip_uintp2(s->s.h.yac_qi + s->s.h.segmentation.feat[i].q_val, 8);
} else {
qyac = s->s.h.yac_qi;
}
qydc = av_clip_uintp2(qyac + s->s.h.ydc_qdelta, 8);
quvdc = av_clip_uintp2(qyac + s->s.h.uvdc_qdelta, 8);
quvac = av_clip_uintp2(qyac + s->s.h.uvac_qdelta, 8);
qyac = av_clip_uintp2(qyac, 8);
s->s.h.segmentation.feat[i].qmul[0][0] = vp9_dc_qlookup[s->bpp_index][qydc];
s->s.h.segmentation.feat[i].qmul[0][1] = vp9_ac_qlookup[s->bpp_index][qyac];
s->s.h.segmentation.feat[i].qmul[1][0] = vp9_dc_qlookup[s->bpp_index][quvdc];
s->s.h.segmentation.feat[i].qmul[1][1] = vp9_ac_qlookup[s->bpp_index][quvac];
sh = s->s.h.filter.level >= 32;
if (s->s.h.segmentation.enabled && s->s.h.segmentation.feat[i].lf_enabled) {
if (s->s.h.segmentation.absolute_vals)
lflvl = av_clip_uintp2(s->s.h.segmentation.feat[i].lf_val, 6);
else
lflvl = av_clip_uintp2(s->s.h.filter.level + s->s.h.segmentation.feat[i].lf_val, 6);
} else {
lflvl = s->s.h.filter.level;
}
if (s->s.h.lf_delta.enabled) {
s->s.h.segmentation.feat[i].lflvl[0][0] =
s->s.h.segmentation.feat[i].lflvl[0][1] =
av_clip_uintp2(lflvl + (s->s.h.lf_delta.ref[0] << sh), 6);
for (j = 1; j < 4; j++) {
s->s.h.segmentation.feat[i].lflvl[j][0] =
av_clip_uintp2(lflvl + ((s->s.h.lf_delta.ref[j] +
s->s.h.lf_delta.mode[0]) * (1 << sh)), 6);
s->s.h.segmentation.feat[i].lflvl[j][1] =
av_clip_uintp2(lflvl + ((s->s.h.lf_delta.ref[j] +
s->s.h.lf_delta.mode[1]) * (1 << sh)), 6);
}
} else {
memset(s->s.h.segmentation.feat[i].lflvl, lflvl,
sizeof(s->s.h.segmentation.feat[i].lflvl));
}
}
/* tiling info */
if ((res = update_size(ctx, w, h)) < 0) {
av_log(ctx, AV_LOG_ERROR, "Failed to initialize decoder for %dx%d @ %d\n",
w, h, s->pix_fmt);
return res;
}
for (s->s.h.tiling.log2_tile_cols = 0;
s->sb_cols > (64 << s->s.h.tiling.log2_tile_cols);
s->s.h.tiling.log2_tile_cols++) ;
for (max = 0; (s->sb_cols >> max) >= 4; max++) ;
max = FFMAX(0, max - 1);
while (max > s->s.h.tiling.log2_tile_cols) {
if (get_bits1(&s->gb))
s->s.h.tiling.log2_tile_cols++;
else
break;
}
s->s.h.tiling.log2_tile_rows = decode012(&s->gb);
s->s.h.tiling.tile_rows = 1 << s->s.h.tiling.log2_tile_rows;
if (s->s.h.tiling.tile_cols != (1 << s->s.h.tiling.log2_tile_cols)) {
s->s.h.tiling.tile_cols = 1 << s->s.h.tiling.log2_tile_cols;
s->c_b = av_fast_realloc(s->c_b, &s->c_b_size,
sizeof(VP56RangeCoder) * s->s.h.tiling.tile_cols);
if (!s->c_b) {
av_log(ctx, AV_LOG_ERROR, "Ran out of memory during range coder init\n");
return AVERROR(ENOMEM);
}
}
/* check reference frames */
if (!s->s.h.keyframe && !s->s.h.intraonly) {
for (i = 0; i < 3; i++) {
AVFrame *ref = s->s.refs[s->s.h.refidx[i]].f;
int refw = ref->width, refh = ref->height;
if (ref->format != ctx->pix_fmt) {
av_log(ctx, AV_LOG_ERROR,
"Ref pixfmt (%s) did not match current frame (%s)",
av_get_pix_fmt_name(ref->format),
av_get_pix_fmt_name(ctx->pix_fmt));
return AVERROR_INVALIDDATA;
} else if (refw == w && refh == h) {
s->mvscale[i][0] = s->mvscale[i][1] = 0;
} else {
if (w * 2 < refw || h * 2 < refh || w > 16 * refw || h > 16 * refh) {
av_log(ctx, AV_LOG_ERROR,
"Invalid ref frame dimensions %dx%d for frame size %dx%d\n",
refw, refh, w, h);
return AVERROR_INVALIDDATA;
}
s->mvscale[i][0] = (refw << 14) / w;
s->mvscale[i][1] = (refh << 14) / h;
s->mvstep[i][0] = 16 * s->mvscale[i][0] >> 14;
s->mvstep[i][1] = 16 * s->mvscale[i][1] >> 14;
}
}
}
if (s->s.h.keyframe || s->s.h.errorres || (s->s.h.intraonly && s->s.h.resetctx == 3)) {
s->prob_ctx[0].p = s->prob_ctx[1].p = s->prob_ctx[2].p =
s->prob_ctx[3].p = vp9_default_probs;
memcpy(s->prob_ctx[0].coef, vp9_default_coef_probs,
sizeof(vp9_default_coef_probs));
memcpy(s->prob_ctx[1].coef, vp9_default_coef_probs,
sizeof(vp9_default_coef_probs));
memcpy(s->prob_ctx[2].coef, vp9_default_coef_probs,
sizeof(vp9_default_coef_probs));
memcpy(s->prob_ctx[3].coef, vp9_default_coef_probs,
sizeof(vp9_default_coef_probs));
} else if (s->s.h.intraonly && s->s.h.resetctx == 2) {
s->prob_ctx[c].p = vp9_default_probs;
memcpy(s->prob_ctx[c].coef, vp9_default_coef_probs,
sizeof(vp9_default_coef_probs));
}
// next 16 bits is size of the rest of the header (arith-coded)
s->s.h.compressed_header_size = size2 = get_bits(&s->gb, 16);
s->s.h.uncompressed_header_size = (get_bits_count(&s->gb) + 7) / 8;
data2 = align_get_bits(&s->gb);
if (size2 > size - (data2 - data)) {
av_log(ctx, AV_LOG_ERROR, "Invalid compressed header size\n");
return AVERROR_INVALIDDATA;
}
ff_vp56_init_range_decoder(&s->c, data2, size2);
if (vp56_rac_get_prob_branchy(&s->c, 128)) { // marker bit
av_log(ctx, AV_LOG_ERROR, "Marker bit was set\n");
return AVERROR_INVALIDDATA;
}
if (s->s.h.keyframe || s->s.h.intraonly) {
memset(s->counts.coef, 0, sizeof(s->counts.coef));
memset(s->counts.eob, 0, sizeof(s->counts.eob));
} else {
memset(&s->counts, 0, sizeof(s->counts));
}
// FIXME is it faster to not copy here, but do it down in the fw updates
// as explicit copies if the fw update is missing (and skip the copy upon
// fw update)?
s->prob.p = s->prob_ctx[c].p;
// txfm updates
if (s->s.h.lossless) {
s->s.h.txfmmode = TX_4X4;
} else {
s->s.h.txfmmode = vp8_rac_get_uint(&s->c, 2);
if (s->s.h.txfmmode == 3)
s->s.h.txfmmode += vp8_rac_get(&s->c);
if (s->s.h.txfmmode == TX_SWITCHABLE) {
for (i = 0; i < 2; i++)
if (vp56_rac_get_prob_branchy(&s->c, 252))
s->prob.p.tx8p[i] = update_prob(&s->c, s->prob.p.tx8p[i]);
for (i = 0; i < 2; i++)
for (j = 0; j < 2; j++)
if (vp56_rac_get_prob_branchy(&s->c, 252))
s->prob.p.tx16p[i][j] =
update_prob(&s->c, s->prob.p.tx16p[i][j]);
for (i = 0; i < 2; i++)
for (j = 0; j < 3; j++)
if (vp56_rac_get_prob_branchy(&s->c, 252))
s->prob.p.tx32p[i][j] =
update_prob(&s->c, s->prob.p.tx32p[i][j]);
}
}
// coef updates
for (i = 0; i < 4; i++) {
uint8_t (*ref)[2][6][6][3] = s->prob_ctx[c].coef[i];
if (vp8_rac_get(&s->c)) {
for (j = 0; j < 2; j++)
for (k = 0; k < 2; k++)
for (l = 0; l < 6; l++)
for (m = 0; m < 6; m++) {
uint8_t *p = s->prob.coef[i][j][k][l][m];
uint8_t *r = ref[j][k][l][m];
if (m >= 3 && l == 0) // dc only has 3 pt
break;
for (n = 0; n < 3; n++) {
if (vp56_rac_get_prob_branchy(&s->c, 252)) {
p[n] = update_prob(&s->c, r[n]);
} else {
p[n] = r[n];
}
}
p[3] = 0;
}
} else {
for (j = 0; j < 2; j++)
for (k = 0; k < 2; k++)
for (l = 0; l < 6; l++)
for (m = 0; m < 6; m++) {
uint8_t *p = s->prob.coef[i][j][k][l][m];
uint8_t *r = ref[j][k][l][m];
if (m > 3 && l == 0) // dc only has 3 pt
break;
memcpy(p, r, 3);
p[3] = 0;
}
}
if (s->s.h.txfmmode == i)
break;
}
// mode updates
for (i = 0; i < 3; i++)
if (vp56_rac_get_prob_branchy(&s->c, 252))
s->prob.p.skip[i] = update_prob(&s->c, s->prob.p.skip[i]);
if (!s->s.h.keyframe && !s->s.h.intraonly) {
for (i = 0; i < 7; i++)
for (j = 0; j < 3; j++)
if (vp56_rac_get_prob_branchy(&s->c, 252))
s->prob.p.mv_mode[i][j] =
update_prob(&s->c, s->prob.p.mv_mode[i][j]);
if (s->s.h.filtermode == FILTER_SWITCHABLE)
for (i = 0; i < 4; i++)
for (j = 0; j < 2; j++)
if (vp56_rac_get_prob_branchy(&s->c, 252))
s->prob.p.filter[i][j] =
update_prob(&s->c, s->prob.p.filter[i][j]);
for (i = 0; i < 4; i++)
if (vp56_rac_get_prob_branchy(&s->c, 252))
s->prob.p.intra[i] = update_prob(&s->c, s->prob.p.intra[i]);
if (s->s.h.allowcompinter) {
s->s.h.comppredmode = vp8_rac_get(&s->c);
if (s->s.h.comppredmode)
s->s.h.comppredmode += vp8_rac_get(&s->c);
if (s->s.h.comppredmode == PRED_SWITCHABLE)
for (i = 0; i < 5; i++)
if (vp56_rac_get_prob_branchy(&s->c, 252))
s->prob.p.comp[i] =
update_prob(&s->c, s->prob.p.comp[i]);
} else {
s->s.h.comppredmode = PRED_SINGLEREF;
}
if (s->s.h.comppredmode != PRED_COMPREF) {
for (i = 0; i < 5; i++) {
if (vp56_rac_get_prob_branchy(&s->c, 252))
s->prob.p.single_ref[i][0] =
update_prob(&s->c, s->prob.p.single_ref[i][0]);
if (vp56_rac_get_prob_branchy(&s->c, 252))
s->prob.p.single_ref[i][1] =
update_prob(&s->c, s->prob.p.single_ref[i][1]);
}
}
if (s->s.h.comppredmode != PRED_SINGLEREF) {
for (i = 0; i < 5; i++)
if (vp56_rac_get_prob_branchy(&s->c, 252))
s->prob.p.comp_ref[i] =
update_prob(&s->c, s->prob.p.comp_ref[i]);
}
for (i = 0; i < 4; i++)
for (j = 0; j < 9; j++)
if (vp56_rac_get_prob_branchy(&s->c, 252))
s->prob.p.y_mode[i][j] =
update_prob(&s->c, s->prob.p.y_mode[i][j]);
for (i = 0; i < 4; i++)
for (j = 0; j < 4; j++)
for (k = 0; k < 3; k++)
if (vp56_rac_get_prob_branchy(&s->c, 252))
s->prob.p.partition[3 - i][j][k] =
update_prob(&s->c, s->prob.p.partition[3 - i][j][k]);
// mv fields don't use the update_prob subexp model for some reason
for (i = 0; i < 3; i++)
if (vp56_rac_get_prob_branchy(&s->c, 252))
s->prob.p.mv_joint[i] = (vp8_rac_get_uint(&s->c, 7) << 1) | 1;
for (i = 0; i < 2; i++) {
if (vp56_rac_get_prob_branchy(&s->c, 252))
s->prob.p.mv_comp[i].sign = (vp8_rac_get_uint(&s->c, 7) << 1) | 1;
for (j = 0; j < 10; j++)
if (vp56_rac_get_prob_branchy(&s->c, 252))
s->prob.p.mv_comp[i].classes[j] =
(vp8_rac_get_uint(&s->c, 7) << 1) | 1;
if (vp56_rac_get_prob_branchy(&s->c, 252))
s->prob.p.mv_comp[i].class0 = (vp8_rac_get_uint(&s->c, 7) << 1) | 1;
for (j = 0; j < 10; j++)
if (vp56_rac_get_prob_branchy(&s->c, 252))
s->prob.p.mv_comp[i].bits[j] =
(vp8_rac_get_uint(&s->c, 7) << 1) | 1;
}
for (i = 0; i < 2; i++) {
for (j = 0; j < 2; j++)
for (k = 0; k < 3; k++)
if (vp56_rac_get_prob_branchy(&s->c, 252))
s->prob.p.mv_comp[i].class0_fp[j][k] =
(vp8_rac_get_uint(&s->c, 7) << 1) | 1;
for (j = 0; j < 3; j++)
if (vp56_rac_get_prob_branchy(&s->c, 252))
s->prob.p.mv_comp[i].fp[j] =
(vp8_rac_get_uint(&s->c, 7) << 1) | 1;
}
if (s->s.h.highprecisionmvs) {
for (i = 0; i < 2; i++) {
if (vp56_rac_get_prob_branchy(&s->c, 252))
s->prob.p.mv_comp[i].class0_hp =
(vp8_rac_get_uint(&s->c, 7) << 1) | 1;
if (vp56_rac_get_prob_branchy(&s->c, 252))
s->prob.p.mv_comp[i].hp =
(vp8_rac_get_uint(&s->c, 7) << 1) | 1;
}
}
}
return (data2 - data) + size2;
}
static av_always_inline void clamp_mv(VP56mv *dst, const VP56mv *src,
VP9Context *s)
{
dst->x = av_clip(src->x, s->min_mv.x, s->max_mv.x);
dst->y = av_clip(src->y, s->min_mv.y, s->max_mv.y);
}
static void find_ref_mvs(VP9Context *s,
VP56mv *pmv, int ref, int z, int idx, int sb)
{
static const int8_t mv_ref_blk_off[N_BS_SIZES][8][2] = {
[BS_64x64] = {{ 3, -1 }, { -1, 3 }, { 4, -1 }, { -1, 4 },
{ -1, -1 }, { 0, -1 }, { -1, 0 }, { 6, -1 }},
[BS_64x32] = {{ 0, -1 }, { -1, 0 }, { 4, -1 }, { -1, 2 },
{ -1, -1 }, { 0, -3 }, { -3, 0 }, { 2, -1 }},
[BS_32x64] = {{ -1, 0 }, { 0, -1 }, { -1, 4 }, { 2, -1 },
{ -1, -1 }, { -3, 0 }, { 0, -3 }, { -1, 2 }},
[BS_32x32] = {{ 1, -1 }, { -1, 1 }, { 2, -1 }, { -1, 2 },
{ -1, -1 }, { 0, -3 }, { -3, 0 }, { -3, -3 }},
[BS_32x16] = {{ 0, -1 }, { -1, 0 }, { 2, -1 }, { -1, -1 },
{ -1, 1 }, { 0, -3 }, { -3, 0 }, { -3, -3 }},
[BS_16x32] = {{ -1, 0 }, { 0, -1 }, { -1, 2 }, { -1, -1 },
{ 1, -1 }, { -3, 0 }, { 0, -3 }, { -3, -3 }},
[BS_16x16] = {{ 0, -1 }, { -1, 0 }, { 1, -1 }, { -1, 1 },
{ -1, -1 }, { 0, -3 }, { -3, 0 }, { -3, -3 }},
[BS_16x8] = {{ 0, -1 }, { -1, 0 }, { 1, -1 }, { -1, -1 },
{ 0, -2 }, { -2, 0 }, { -2, -1 }, { -1, -2 }},
[BS_8x16] = {{ -1, 0 }, { 0, -1 }, { -1, 1 }, { -1, -1 },
{ -2, 0 }, { 0, -2 }, { -1, -2 }, { -2, -1 }},
[BS_8x8] = {{ 0, -1 }, { -1, 0 }, { -1, -1 }, { 0, -2 },
{ -2, 0 }, { -1, -2 }, { -2, -1 }, { -2, -2 }},
[BS_8x4] = {{ 0, -1 }, { -1, 0 }, { -1, -1 }, { 0, -2 },
{ -2, 0 }, { -1, -2 }, { -2, -1 }, { -2, -2 }},
[BS_4x8] = {{ 0, -1 }, { -1, 0 }, { -1, -1 }, { 0, -2 },
{ -2, 0 }, { -1, -2 }, { -2, -1 }, { -2, -2 }},
[BS_4x4] = {{ 0, -1 }, { -1, 0 }, { -1, -1 }, { 0, -2 },
{ -2, 0 }, { -1, -2 }, { -2, -1 }, { -2, -2 }},
};
VP9Block *b = s->b;
int row = s->row, col = s->col, row7 = s->row7;
const int8_t (*p)[2] = mv_ref_blk_off[b->bs];
#define INVALID_MV 0x80008000U
uint32_t mem = INVALID_MV, mem_sub8x8 = INVALID_MV;
int i;
#define RETURN_DIRECT_MV(mv) \
do { \
uint32_t m = AV_RN32A(&mv); \
if (!idx) { \
AV_WN32A(pmv, m); \
return; \
} else if (mem == INVALID_MV) { \
mem = m; \
} else if (m != mem) { \
AV_WN32A(pmv, m); \
return; \
} \
} while (0)
if (sb >= 0) {
if (sb == 2 || sb == 1) {
RETURN_DIRECT_MV(b->mv[0][z]);
} else if (sb == 3) {
RETURN_DIRECT_MV(b->mv[2][z]);
RETURN_DIRECT_MV(b->mv[1][z]);
RETURN_DIRECT_MV(b->mv[0][z]);
}
#define RETURN_MV(mv) \
do { \
if (sb > 0) { \
VP56mv tmp; \
uint32_t m; \
av_assert2(idx == 1); \
av_assert2(mem != INVALID_MV); \
if (mem_sub8x8 == INVALID_MV) { \
clamp_mv(&tmp, &mv, s); \
m = AV_RN32A(&tmp); \
if (m != mem) { \
AV_WN32A(pmv, m); \
return; \
} \
mem_sub8x8 = AV_RN32A(&mv); \
} else if (mem_sub8x8 != AV_RN32A(&mv)) { \
clamp_mv(&tmp, &mv, s); \
m = AV_RN32A(&tmp); \
if (m != mem) { \
AV_WN32A(pmv, m); \
} else { \
/* BUG I'm pretty sure this isn't the intention */ \
AV_WN32A(pmv, 0); \
} \
return; \
} \
} else { \
uint32_t m = AV_RN32A(&mv); \
if (!idx) { \
clamp_mv(pmv, &mv, s); \
return; \
} else if (mem == INVALID_MV) { \
mem = m; \
} else if (m != mem) { \
clamp_mv(pmv, &mv, s); \
return; \
} \
} \
} while (0)
if (row > 0) {
struct VP9mvrefPair *mv = &s->s.frames[CUR_FRAME].mv[(row - 1) * s->sb_cols * 8 + col];
if (mv->ref[0] == ref) {
RETURN_MV(s->above_mv_ctx[2 * col + (sb & 1)][0]);
} else if (mv->ref[1] == ref) {
RETURN_MV(s->above_mv_ctx[2 * col + (sb & 1)][1]);
}
}
if (col > s->tile_col_start) {
struct VP9mvrefPair *mv = &s->s.frames[CUR_FRAME].mv[row * s->sb_cols * 8 + col - 1];
if (mv->ref[0] == ref) {
RETURN_MV(s->left_mv_ctx[2 * row7 + (sb >> 1)][0]);
} else if (mv->ref[1] == ref) {
RETURN_MV(s->left_mv_ctx[2 * row7 + (sb >> 1)][1]);
}
}
i = 2;
} else {
i = 0;
}
// previously coded MVs in this neighbourhood, using same reference frame
for (; i < 8; i++) {
int c = p[i][0] + col, r = p[i][1] + row;
if (c >= s->tile_col_start && c < s->cols && r >= 0 && r < s->rows) {
struct VP9mvrefPair *mv = &s->s.frames[CUR_FRAME].mv[r * s->sb_cols * 8 + c];
if (mv->ref[0] == ref) {
RETURN_MV(mv->mv[0]);
} else if (mv->ref[1] == ref) {
RETURN_MV(mv->mv[1]);
}
}
}
// MV at this position in previous frame, using same reference frame
if (s->s.h.use_last_frame_mvs) {
struct VP9mvrefPair *mv = &s->s.frames[REF_FRAME_MVPAIR].mv[row * s->sb_cols * 8 + col];
if (!s->s.frames[REF_FRAME_MVPAIR].uses_2pass)
ff_thread_await_progress(&s->s.frames[REF_FRAME_MVPAIR].tf, row >> 3, 0);
if (mv->ref[0] == ref) {
RETURN_MV(mv->mv[0]);
} else if (mv->ref[1] == ref) {
RETURN_MV(mv->mv[1]);
}
}
#define RETURN_SCALE_MV(mv, scale) \
do { \
if (scale) { \
VP56mv mv_temp = { -mv.x, -mv.y }; \
RETURN_MV(mv_temp); \
} else { \
RETURN_MV(mv); \
} \
} while (0)
// previously coded MVs in this neighbourhood, using different reference frame
for (i = 0; i < 8; i++) {
int c = p[i][0] + col, r = p[i][1] + row;
if (c >= s->tile_col_start && c < s->cols && r >= 0 && r < s->rows) {
struct VP9mvrefPair *mv = &s->s.frames[CUR_FRAME].mv[r * s->sb_cols * 8 + c];
if (mv->ref[0] != ref && mv->ref[0] >= 0) {
RETURN_SCALE_MV(mv->mv[0], s->s.h.signbias[mv->ref[0]] != s->s.h.signbias[ref]);
}
if (mv->ref[1] != ref && mv->ref[1] >= 0 &&
// BUG - libvpx has this condition regardless of whether
// we used the first ref MV and pre-scaling
AV_RN32A(&mv->mv[0]) != AV_RN32A(&mv->mv[1])) {
RETURN_SCALE_MV(mv->mv[1], s->s.h.signbias[mv->ref[1]] != s->s.h.signbias[ref]);
}
}
}
// MV at this position in previous frame, using different reference frame
if (s->s.h.use_last_frame_mvs) {
struct VP9mvrefPair *mv = &s->s.frames[REF_FRAME_MVPAIR].mv[row * s->sb_cols * 8 + col];
// no need to await_progress, because we already did that above
if (mv->ref[0] != ref && mv->ref[0] >= 0) {
RETURN_SCALE_MV(mv->mv[0], s->s.h.signbias[mv->ref[0]] != s->s.h.signbias[ref]);
}
if (mv->ref[1] != ref && mv->ref[1] >= 0 &&
// BUG - libvpx has this condition regardless of whether
// we used the first ref MV and pre-scaling
AV_RN32A(&mv->mv[0]) != AV_RN32A(&mv->mv[1])) {
RETURN_SCALE_MV(mv->mv[1], s->s.h.signbias[mv->ref[1]] != s->s.h.signbias[ref]);
}
}
AV_ZERO32(pmv);
clamp_mv(pmv, pmv, s);
#undef INVALID_MV
#undef RETURN_MV
#undef RETURN_SCALE_MV
}
static av_always_inline int read_mv_component(VP9Context *s, int idx, int hp)
{
int bit, sign = vp56_rac_get_prob(&s->c, s->prob.p.mv_comp[idx].sign);
int n, c = vp8_rac_get_tree(&s->c, vp9_mv_class_tree,
s->prob.p.mv_comp[idx].classes);
s->counts.mv_comp[idx].sign[sign]++;
s->counts.mv_comp[idx].classes[c]++;
if (c) {
int m;
for (n = 0, m = 0; m < c; m++) {
bit = vp56_rac_get_prob(&s->c, s->prob.p.mv_comp[idx].bits[m]);
n |= bit << m;
s->counts.mv_comp[idx].bits[m][bit]++;
}
n <<= 3;
bit = vp8_rac_get_tree(&s->c, vp9_mv_fp_tree, s->prob.p.mv_comp[idx].fp);
n |= bit << 1;
s->counts.mv_comp[idx].fp[bit]++;
if (hp) {
bit = vp56_rac_get_prob(&s->c, s->prob.p.mv_comp[idx].hp);
s->counts.mv_comp[idx].hp[bit]++;
n |= bit;
} else {
n |= 1;
// bug in libvpx - we count for bw entropy purposes even if the
// bit wasn't coded
s->counts.mv_comp[idx].hp[1]++;
}
n += 8 << c;
} else {
n = vp56_rac_get_prob(&s->c, s->prob.p.mv_comp[idx].class0);
s->counts.mv_comp[idx].class0[n]++;
bit = vp8_rac_get_tree(&s->c, vp9_mv_fp_tree,
s->prob.p.mv_comp[idx].class0_fp[n]);
s->counts.mv_comp[idx].class0_fp[n][bit]++;
n = (n << 3) | (bit << 1);
if (hp) {
bit = vp56_rac_get_prob(&s->c, s->prob.p.mv_comp[idx].class0_hp);
s->counts.mv_comp[idx].class0_hp[bit]++;
n |= bit;
} else {
n |= 1;
// bug in libvpx - we count for bw entropy purposes even if the
// bit wasn't coded
s->counts.mv_comp[idx].class0_hp[1]++;
}
}
return sign ? -(n + 1) : (n + 1);
}
static void fill_mv(VP9Context *s,
VP56mv *mv, int mode, int sb)
{
VP9Block *b = s->b;
if (mode == ZEROMV) {
AV_ZERO64(mv);
} else {
int hp;
// FIXME cache this value and reuse for other subblocks
find_ref_mvs(s, &mv[0], b->ref[0], 0, mode == NEARMV,
mode == NEWMV ? -1 : sb);
// FIXME maybe move this code into find_ref_mvs()
if ((mode == NEWMV || sb == -1) &&
!(hp = s->s.h.highprecisionmvs && abs(mv[0].x) < 64 && abs(mv[0].y) < 64)) {
if (mv[0].y & 1) {
if (mv[0].y < 0)
mv[0].y++;
else
mv[0].y--;
}
if (mv[0].x & 1) {
if (mv[0].x < 0)
mv[0].x++;
else
mv[0].x--;
}
}
if (mode == NEWMV) {
enum MVJoint j = vp8_rac_get_tree(&s->c, vp9_mv_joint_tree,
s->prob.p.mv_joint);
s->counts.mv_joint[j]++;
if (j >= MV_JOINT_V)
mv[0].y += read_mv_component(s, 0, hp);
if (j & 1)
mv[0].x += read_mv_component(s, 1, hp);
}
if (b->comp) {
// FIXME cache this value and reuse for other subblocks
find_ref_mvs(s, &mv[1], b->ref[1], 1, mode == NEARMV,
mode == NEWMV ? -1 : sb);
if ((mode == NEWMV || sb == -1) &&
!(hp = s->s.h.highprecisionmvs && abs(mv[1].x) < 64 && abs(mv[1].y) < 64)) {
if (mv[1].y & 1) {
if (mv[1].y < 0)
mv[1].y++;
else
mv[1].y--;
}
if (mv[1].x & 1) {
if (mv[1].x < 0)
mv[1].x++;
else
mv[1].x--;
}
}
if (mode == NEWMV) {
enum MVJoint j = vp8_rac_get_tree(&s->c, vp9_mv_joint_tree,
s->prob.p.mv_joint);
s->counts.mv_joint[j]++;
if (j >= MV_JOINT_V)
mv[1].y += read_mv_component(s, 0, hp);
if (j & 1)
mv[1].x += read_mv_component(s, 1, hp);
}
}
}
}
static av_always_inline void setctx_2d(uint8_t *ptr, int w, int h,
ptrdiff_t stride, int v)
{
switch (w) {
case 1:
do {
*ptr = v;
ptr += stride;
} while (--h);
break;
case 2: {
int v16 = v * 0x0101;
do {
AV_WN16A(ptr, v16);
ptr += stride;
} while (--h);
break;
}
case 4: {
uint32_t v32 = v * 0x01010101;
do {
AV_WN32A(ptr, v32);
ptr += stride;
} while (--h);
break;
}
case 8: {
#if HAVE_FAST_64BIT
uint64_t v64 = v * 0x0101010101010101ULL;
do {
AV_WN64A(ptr, v64);
ptr += stride;
} while (--h);
#else
uint32_t v32 = v * 0x01010101;
do {
AV_WN32A(ptr, v32);
AV_WN32A(ptr + 4, v32);
ptr += stride;
} while (--h);
#endif
break;
}
}
}
static void decode_mode(AVCodecContext *ctx)
{
static const uint8_t left_ctx[N_BS_SIZES] = {
0x0, 0x8, 0x0, 0x8, 0xc, 0x8, 0xc, 0xe, 0xc, 0xe, 0xf, 0xe, 0xf
};
static const uint8_t above_ctx[N_BS_SIZES] = {
0x0, 0x0, 0x8, 0x8, 0x8, 0xc, 0xc, 0xc, 0xe, 0xe, 0xe, 0xf, 0xf
};
static const uint8_t max_tx_for_bl_bp[N_BS_SIZES] = {
TX_32X32, TX_32X32, TX_32X32, TX_32X32, TX_16X16, TX_16X16,
TX_16X16, TX_8X8, TX_8X8, TX_8X8, TX_4X4, TX_4X4, TX_4X4
};
VP9Context *s = ctx->priv_data;
VP9Block *b = s->b;
int row = s->row, col = s->col, row7 = s->row7;
enum TxfmMode max_tx = max_tx_for_bl_bp[b->bs];
int bw4 = bwh_tab[1][b->bs][0], w4 = FFMIN(s->cols - col, bw4);
int bh4 = bwh_tab[1][b->bs][1], h4 = FFMIN(s->rows - row, bh4), y;
int have_a = row > 0, have_l = col > s->tile_col_start;
int vref, filter_id;
if (!s->s.h.segmentation.enabled) {
b->seg_id = 0;
} else if (s->s.h.keyframe || s->s.h.intraonly) {
b->seg_id = !s->s.h.segmentation.update_map ? 0 :
vp8_rac_get_tree(&s->c, vp9_segmentation_tree, s->s.h.segmentation.prob);
} else if (!s->s.h.segmentation.update_map ||
(s->s.h.segmentation.temporal &&
vp56_rac_get_prob_branchy(&s->c,
s->s.h.segmentation.pred_prob[s->above_segpred_ctx[col] +
s->left_segpred_ctx[row7]]))) {
if (!s->s.h.errorres && s->s.frames[REF_FRAME_SEGMAP].segmentation_map) {
int pred = 8, x;
uint8_t *refsegmap = s->s.frames[REF_FRAME_SEGMAP].segmentation_map;
if (!s->s.frames[REF_FRAME_SEGMAP].uses_2pass)
ff_thread_await_progress(&s->s.frames[REF_FRAME_SEGMAP].tf, row >> 3, 0);
for (y = 0; y < h4; y++) {
int idx_base = (y + row) * 8 * s->sb_cols + col;
for (x = 0; x < w4; x++)
pred = FFMIN(pred, refsegmap[idx_base + x]);
}
av_assert1(pred < 8);
b->seg_id = pred;
} else {
b->seg_id = 0;
}
memset(&s->above_segpred_ctx[col], 1, w4);
memset(&s->left_segpred_ctx[row7], 1, h4);
} else {
b->seg_id = vp8_rac_get_tree(&s->c, vp9_segmentation_tree,
s->s.h.segmentation.prob);
memset(&s->above_segpred_ctx[col], 0, w4);
memset(&s->left_segpred_ctx[row7], 0, h4);
}
if (s->s.h.segmentation.enabled &&
(s->s.h.segmentation.update_map || s->s.h.keyframe || s->s.h.intraonly)) {
setctx_2d(&s->s.frames[CUR_FRAME].segmentation_map[row * 8 * s->sb_cols + col],
bw4, bh4, 8 * s->sb_cols, b->seg_id);
}
b->skip = s->s.h.segmentation.enabled &&
s->s.h.segmentation.feat[b->seg_id].skip_enabled;
if (!b->skip) {
int c = s->left_skip_ctx[row7] + s->above_skip_ctx[col];
b->skip = vp56_rac_get_prob(&s->c, s->prob.p.skip[c]);
s->counts.skip[c][b->skip]++;
}
if (s->s.h.keyframe || s->s.h.intraonly) {
b->intra = 1;
} else if (s->s.h.segmentation.enabled && s->s.h.segmentation.feat[b->seg_id].ref_enabled) {
b->intra = !s->s.h.segmentation.feat[b->seg_id].ref_val;
} else {
int c, bit;
if (have_a && have_l) {
c = s->above_intra_ctx[col] + s->left_intra_ctx[row7];
c += (c == 2);
} else {
c = have_a ? 2 * s->above_intra_ctx[col] :
have_l ? 2 * s->left_intra_ctx[row7] : 0;
}
bit = vp56_rac_get_prob(&s->c, s->prob.p.intra[c]);
s->counts.intra[c][bit]++;
b->intra = !bit;
}
if ((b->intra || !b->skip) && s->s.h.txfmmode == TX_SWITCHABLE) {
int c;
if (have_a) {
if (have_l) {
c = (s->above_skip_ctx[col] ? max_tx :
s->above_txfm_ctx[col]) +
(s->left_skip_ctx[row7] ? max_tx :
s->left_txfm_ctx[row7]) > max_tx;
} else {
c = s->above_skip_ctx[col] ? 1 :
(s->above_txfm_ctx[col] * 2 > max_tx);
}
} else if (have_l) {
c = s->left_skip_ctx[row7] ? 1 :
(s->left_txfm_ctx[row7] * 2 > max_tx);
} else {
c = 1;
}
switch (max_tx) {
case TX_32X32:
b->tx = vp56_rac_get_prob(&s->c, s->prob.p.tx32p[c][0]);
if (b->tx) {
b->tx += vp56_rac_get_prob(&s->c, s->prob.p.tx32p[c][1]);
if (b->tx == 2)
b->tx += vp56_rac_get_prob(&s->c, s->prob.p.tx32p[c][2]);
}
s->counts.tx32p[c][b->tx]++;
break;
case TX_16X16:
b->tx = vp56_rac_get_prob(&s->c, s->prob.p.tx16p[c][0]);
if (b->tx)
b->tx += vp56_rac_get_prob(&s->c, s->prob.p.tx16p[c][1]);
s->counts.tx16p[c][b->tx]++;
break;
case TX_8X8:
b->tx = vp56_rac_get_prob(&s->c, s->prob.p.tx8p[c]);
s->counts.tx8p[c][b->tx]++;
break;
case TX_4X4:
b->tx = TX_4X4;
break;
}
} else {
b->tx = FFMIN(max_tx, s->s.h.txfmmode);
}
if (s->s.h.keyframe || s->s.h.intraonly) {
uint8_t *a = &s->above_mode_ctx[col * 2];
uint8_t *l = &s->left_mode_ctx[(row7) << 1];
b->comp = 0;
if (b->bs > BS_8x8) {
// FIXME the memory storage intermediates here aren't really
// necessary, they're just there to make the code slightly
// simpler for now
b->mode[0] = a[0] = vp8_rac_get_tree(&s->c, vp9_intramode_tree,
vp9_default_kf_ymode_probs[a[0]][l[0]]);
if (b->bs != BS_8x4) {
b->mode[1] = vp8_rac_get_tree(&s->c, vp9_intramode_tree,
vp9_default_kf_ymode_probs[a[1]][b->mode[0]]);
l[0] = a[1] = b->mode[1];
} else {
l[0] = a[1] = b->mode[1] = b->mode[0];
}
if (b->bs != BS_4x8) {
b->mode[2] = a[0] = vp8_rac_get_tree(&s->c, vp9_intramode_tree,
vp9_default_kf_ymode_probs[a[0]][l[1]]);
if (b->bs != BS_8x4) {
b->mode[3] = vp8_rac_get_tree(&s->c, vp9_intramode_tree,
vp9_default_kf_ymode_probs[a[1]][b->mode[2]]);
l[1] = a[1] = b->mode[3];
} else {
l[1] = a[1] = b->mode[3] = b->mode[2];
}
} else {
b->mode[2] = b->mode[0];
l[1] = a[1] = b->mode[3] = b->mode[1];
}
} else {
b->mode[0] = vp8_rac_get_tree(&s->c, vp9_intramode_tree,
vp9_default_kf_ymode_probs[*a][*l]);
b->mode[3] = b->mode[2] = b->mode[1] = b->mode[0];
// FIXME this can probably be optimized
memset(a, b->mode[0], bwh_tab[0][b->bs][0]);
memset(l, b->mode[0], bwh_tab[0][b->bs][1]);
}
b->uvmode = vp8_rac_get_tree(&s->c, vp9_intramode_tree,
vp9_default_kf_uvmode_probs[b->mode[3]]);
} else if (b->intra) {
b->comp = 0;
if (b->bs > BS_8x8) {
b->mode[0] = vp8_rac_get_tree(&s->c, vp9_intramode_tree,
s->prob.p.y_mode[0]);
s->counts.y_mode[0][b->mode[0]]++;
if (b->bs != BS_8x4) {
b->mode[1] = vp8_rac_get_tree(&s->c, vp9_intramode_tree,
s->prob.p.y_mode[0]);
s->counts.y_mode[0][b->mode[1]]++;
} else {
b->mode[1] = b->mode[0];
}
if (b->bs != BS_4x8) {
b->mode[2] = vp8_rac_get_tree(&s->c, vp9_intramode_tree,
s->prob.p.y_mode[0]);
s->counts.y_mode[0][b->mode[2]]++;
if (b->bs != BS_8x4) {
b->mode[3] = vp8_rac_get_tree(&s->c, vp9_intramode_tree,
s->prob.p.y_mode[0]);
s->counts.y_mode[0][b->mode[3]]++;
} else {
b->mode[3] = b->mode[2];
}
} else {
b->mode[2] = b->mode[0];
b->mode[3] = b->mode[1];
}
} else {
static const uint8_t size_group[10] = {
3, 3, 3, 3, 2, 2, 2, 1, 1, 1
};
int sz = size_group[b->bs];
b->mode[0] = vp8_rac_get_tree(&s->c, vp9_intramode_tree,
s->prob.p.y_mode[sz]);
b->mode[1] = b->mode[2] = b->mode[3] = b->mode[0];
s->counts.y_mode[sz][b->mode[3]]++;
}
b->uvmode = vp8_rac_get_tree(&s->c, vp9_intramode_tree,
s->prob.p.uv_mode[b->mode[3]]);
s->counts.uv_mode[b->mode[3]][b->uvmode]++;
} else {
static const uint8_t inter_mode_ctx_lut[14][14] = {
{ 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5 },
{ 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5 },
{ 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5 },
{ 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5 },
{ 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5 },
{ 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5 },
{ 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5 },
{ 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5 },
{ 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5 },
{ 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5 },
{ 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 3 },
{ 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 3 },
{ 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 0, 3 },
{ 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 4 },
};
if (s->s.h.segmentation.enabled && s->s.h.segmentation.feat[b->seg_id].ref_enabled) {
av_assert2(s->s.h.segmentation.feat[b->seg_id].ref_val != 0);
b->comp = 0;
b->ref[0] = s->s.h.segmentation.feat[b->seg_id].ref_val - 1;
} else {
// read comp_pred flag
if (s->s.h.comppredmode != PRED_SWITCHABLE) {
b->comp = s->s.h.comppredmode == PRED_COMPREF;
} else {
int c;
// FIXME add intra as ref=0xff (or -1) to make these easier?
if (have_a) {
if (have_l) {
if (s->above_comp_ctx[col] && s->left_comp_ctx[row7]) {
c = 4;
} else if (s->above_comp_ctx[col]) {
c = 2 + (s->left_intra_ctx[row7] ||
s->left_ref_ctx[row7] == s->s.h.fixcompref);
} else if (s->left_comp_ctx[row7]) {
c = 2 + (s->above_intra_ctx[col] ||
s->above_ref_ctx[col] == s->s.h.fixcompref);
} else {
c = (!s->above_intra_ctx[col] &&
s->above_ref_ctx[col] == s->s.h.fixcompref) ^
(!s->left_intra_ctx[row7] &&
s->left_ref_ctx[row & 7] == s->s.h.fixcompref);
}
} else {
c = s->above_comp_ctx[col] ? 3 :
(!s->above_intra_ctx[col] && s->above_ref_ctx[col] == s->s.h.fixcompref);
}
} else if (have_l) {
c = s->left_comp_ctx[row7] ? 3 :
(!s->left_intra_ctx[row7] && s->left_ref_ctx[row7] == s->s.h.fixcompref);
} else {
c = 1;
}
b->comp = vp56_rac_get_prob(&s->c, s->prob.p.comp[c]);
s->counts.comp[c][b->comp]++;
}
// read actual references
// FIXME probably cache a few variables here to prevent repetitive
// memory accesses below
if (b->comp) /* two references */ {
int fix_idx = s->s.h.signbias[s->s.h.fixcompref], var_idx = !fix_idx, c, bit;
b->ref[fix_idx] = s->s.h.fixcompref;
// FIXME can this codeblob be replaced by some sort of LUT?
if (have_a) {
if (have_l) {
if (s->above_intra_ctx[col]) {
if (s->left_intra_ctx[row7]) {
c = 2;
} else {
c = 1 + 2 * (s->left_ref_ctx[row7] != s->s.h.varcompref[1]);
}
} else if (s->left_intra_ctx[row7]) {
c = 1 + 2 * (s->above_ref_ctx[col] != s->s.h.varcompref[1]);
} else {
int refl = s->left_ref_ctx[row7], refa = s->above_ref_ctx[col];
if (refl == refa && refa == s->s.h.varcompref[1]) {
c = 0;
} else if (!s->left_comp_ctx[row7] && !s->above_comp_ctx[col]) {
if ((refa == s->s.h.fixcompref && refl == s->s.h.varcompref[0]) ||
(refl == s->s.h.fixcompref && refa == s->s.h.varcompref[0])) {
c = 4;
} else {
c = (refa == refl) ? 3 : 1;
}
} else if (!s->left_comp_ctx[row7]) {
if (refa == s->s.h.varcompref[1] && refl != s->s.h.varcompref[1]) {
c = 1;
} else {
c = (refl == s->s.h.varcompref[1] &&
refa != s->s.h.varcompref[1]) ? 2 : 4;
}
} else if (!s->above_comp_ctx[col]) {
if (refl == s->s.h.varcompref[1] && refa != s->s.h.varcompref[1]) {
c = 1;
} else {
c = (refa == s->s.h.varcompref[1] &&
refl != s->s.h.varcompref[1]) ? 2 : 4;
}
} else {
c = (refl == refa) ? 4 : 2;
}
}
} else {
if (s->above_intra_ctx[col]) {
c = 2;
} else if (s->above_comp_ctx[col]) {
c = 4 * (s->above_ref_ctx[col] != s->s.h.varcompref[1]);
} else {
c = 3 * (s->above_ref_ctx[col] != s->s.h.varcompref[1]);
}
}
} else if (have_l) {
if (s->left_intra_ctx[row7]) {
c = 2;
} else if (s->left_comp_ctx[row7]) {
c = 4 * (s->left_ref_ctx[row7] != s->s.h.varcompref[1]);
} else {
c = 3 * (s->left_ref_ctx[row7] != s->s.h.varcompref[1]);
}
} else {
c = 2;
}
bit = vp56_rac_get_prob(&s->c, s->prob.p.comp_ref[c]);
b->ref[var_idx] = s->s.h.varcompref[bit];
s->counts.comp_ref[c][bit]++;
} else /* single reference */ {
int bit, c;
if (have_a && !s->above_intra_ctx[col]) {
if (have_l && !s->left_intra_ctx[row7]) {
if (s->left_comp_ctx[row7]) {
if (s->above_comp_ctx[col]) {
c = 1 + (!s->s.h.fixcompref || !s->left_ref_ctx[row7] ||
!s->above_ref_ctx[col]);
} else {
c = (3 * !s->above_ref_ctx[col]) +
(!s->s.h.fixcompref || !s->left_ref_ctx[row7]);
}
} else if (s->above_comp_ctx[col]) {
c = (3 * !s->left_ref_ctx[row7]) +
(!s->s.h.fixcompref || !s->above_ref_ctx[col]);
} else {
c = 2 * !s->left_ref_ctx[row7] + 2 * !s->above_ref_ctx[col];
}
} else if (s->above_intra_ctx[col]) {
c = 2;
} else if (s->above_comp_ctx[col]) {
c = 1 + (!s->s.h.fixcompref || !s->above_ref_ctx[col]);
} else {
c = 4 * (!s->above_ref_ctx[col]);
}
} else if (have_l && !s->left_intra_ctx[row7]) {
if (s->left_intra_ctx[row7]) {
c = 2;
} else if (s->left_comp_ctx[row7]) {
c = 1 + (!s->s.h.fixcompref || !s->left_ref_ctx[row7]);
} else {
c = 4 * (!s->left_ref_ctx[row7]);
}
} else {
c = 2;
}
bit = vp56_rac_get_prob(&s->c, s->prob.p.single_ref[c][0]);
s->counts.single_ref[c][0][bit]++;
if (!bit) {
b->ref[0] = 0;
} else {
// FIXME can this codeblob be replaced by some sort of LUT?
if (have_a) {
if (have_l) {
if (s->left_intra_ctx[row7]) {
if (s->above_intra_ctx[col]) {
c = 2;
} else if (s->above_comp_ctx[col]) {
c = 1 + 2 * (s->s.h.fixcompref == 1 ||
s->above_ref_ctx[col] == 1);
} else if (!s->above_ref_ctx[col]) {
c = 3;
} else {
c = 4 * (s->above_ref_ctx[col] == 1);
}
} else if (s->above_intra_ctx[col]) {
if (s->left_intra_ctx[row7]) {
c = 2;
} else if (s->left_comp_ctx[row7]) {
c = 1 + 2 * (s->s.h.fixcompref == 1 ||
s->left_ref_ctx[row7] == 1);
} else if (!s->left_ref_ctx[row7]) {
c = 3;
} else {
c = 4 * (s->left_ref_ctx[row7] == 1);
}
} else if (s->above_comp_ctx[col]) {
if (s->left_comp_ctx[row7]) {
if (s->left_ref_ctx[row7] == s->above_ref_ctx[col]) {
c = 3 * (s->s.h.fixcompref == 1 ||
s->left_ref_ctx[row7] == 1);
} else {
c = 2;
}
} else if (!s->left_ref_ctx[row7]) {
c = 1 + 2 * (s->s.h.fixcompref == 1 ||
s->above_ref_ctx[col] == 1);
} else {
c = 3 * (s->left_ref_ctx[row7] == 1) +
(s->s.h.fixcompref == 1 || s->above_ref_ctx[col] == 1);
}
} else if (s->left_comp_ctx[row7]) {
if (!s->above_ref_ctx[col]) {
c = 1 + 2 * (s->s.h.fixcompref == 1 ||
s->left_ref_ctx[row7] == 1);
} else {
c = 3 * (s->above_ref_ctx[col] == 1) +
(s->s.h.fixcompref == 1 || s->left_ref_ctx[row7] == 1);
}
} else if (!s->above_ref_ctx[col]) {
if (!s->left_ref_ctx[row7]) {
c = 3;
} else {
c = 4 * (s->left_ref_ctx[row7] == 1);
}
} else if (!s->left_ref_ctx[row7]) {
c = 4 * (s->above_ref_ctx[col] == 1);
} else {
c = 2 * (s->left_ref_ctx[row7] == 1) +
2 * (s->above_ref_ctx[col] == 1);
}
} else {
if (s->above_intra_ctx[col] ||
(!s->above_comp_ctx[col] && !s->above_ref_ctx[col])) {
c = 2;
} else if (s->above_comp_ctx[col]) {
c = 3 * (s->s.h.fixcompref == 1 || s->above_ref_ctx[col] == 1);
} else {
c = 4 * (s->above_ref_ctx[col] == 1);
}
}
} else if (have_l) {
if (s->left_intra_ctx[row7] ||
(!s->left_comp_ctx[row7] && !s->left_ref_ctx[row7])) {
c = 2;
} else if (s->left_comp_ctx[row7]) {
c = 3 * (s->s.h.fixcompref == 1 || s->left_ref_ctx[row7] == 1);
} else {
c = 4 * (s->left_ref_ctx[row7] == 1);
}
} else {
c = 2;
}
bit = vp56_rac_get_prob(&s->c, s->prob.p.single_ref[c][1]);
s->counts.single_ref[c][1][bit]++;
b->ref[0] = 1 + bit;
}
}
}
if (b->bs <= BS_8x8) {
if (s->s.h.segmentation.enabled && s->s.h.segmentation.feat[b->seg_id].skip_enabled) {
b->mode[0] = b->mode[1] = b->mode[2] = b->mode[3] = ZEROMV;
} else {
static const uint8_t off[10] = {
3, 0, 0, 1, 0, 0, 0, 0, 0, 0
};
// FIXME this needs to use the LUT tables from find_ref_mvs
// because not all are -1,0/0,-1
int c = inter_mode_ctx_lut[s->above_mode_ctx[col + off[b->bs]]]
[s->left_mode_ctx[row7 + off[b->bs]]];
b->mode[0] = vp8_rac_get_tree(&s->c, vp9_inter_mode_tree,
s->prob.p.mv_mode[c]);
b->mode[1] = b->mode[2] = b->mode[3] = b->mode[0];
s->counts.mv_mode[c][b->mode[0] - 10]++;
}
}
if (s->s.h.filtermode == FILTER_SWITCHABLE) {
int c;
if (have_a && s->above_mode_ctx[col] >= NEARESTMV) {
if (have_l && s->left_mode_ctx[row7] >= NEARESTMV) {
c = s->above_filter_ctx[col] == s->left_filter_ctx[row7] ?
s->left_filter_ctx[row7] : 3;
} else {
c = s->above_filter_ctx[col];
}
} else if (have_l && s->left_mode_ctx[row7] >= NEARESTMV) {
c = s->left_filter_ctx[row7];
} else {
c = 3;
}
filter_id = vp8_rac_get_tree(&s->c, vp9_filter_tree,
s->prob.p.filter[c]);
s->counts.filter[c][filter_id]++;
b->filter = vp9_filter_lut[filter_id];
} else {
b->filter = s->s.h.filtermode;
}
if (b->bs > BS_8x8) {
int c = inter_mode_ctx_lut[s->above_mode_ctx[col]][s->left_mode_ctx[row7]];
b->mode[0] = vp8_rac_get_tree(&s->c, vp9_inter_mode_tree,
s->prob.p.mv_mode[c]);
s->counts.mv_mode[c][b->mode[0] - 10]++;
fill_mv(s, b->mv[0], b->mode[0], 0);
if (b->bs != BS_8x4) {
b->mode[1] = vp8_rac_get_tree(&s->c, vp9_inter_mode_tree,
s->prob.p.mv_mode[c]);
s->counts.mv_mode[c][b->mode[1] - 10]++;
fill_mv(s, b->mv[1], b->mode[1], 1);
} else {
b->mode[1] = b->mode[0];
AV_COPY32(&b->mv[1][0], &b->mv[0][0]);
AV_COPY32(&b->mv[1][1], &b->mv[0][1]);
}
if (b->bs != BS_4x8) {
b->mode[2] = vp8_rac_get_tree(&s->c, vp9_inter_mode_tree,
s->prob.p.mv_mode[c]);
s->counts.mv_mode[c][b->mode[2] - 10]++;
fill_mv(s, b->mv[2], b->mode[2], 2);
if (b->bs != BS_8x4) {
b->mode[3] = vp8_rac_get_tree(&s->c, vp9_inter_mode_tree,
s->prob.p.mv_mode[c]);
s->counts.mv_mode[c][b->mode[3] - 10]++;
fill_mv(s, b->mv[3], b->mode[3], 3);
} else {
b->mode[3] = b->mode[2];
AV_COPY32(&b->mv[3][0], &b->mv[2][0]);
AV_COPY32(&b->mv[3][1], &b->mv[2][1]);
}
} else {
b->mode[2] = b->mode[0];
AV_COPY32(&b->mv[2][0], &b->mv[0][0]);
AV_COPY32(&b->mv[2][1], &b->mv[0][1]);
b->mode[3] = b->mode[1];
AV_COPY32(&b->mv[3][0], &b->mv[1][0]);
AV_COPY32(&b->mv[3][1], &b->mv[1][1]);
}
} else {
fill_mv(s, b->mv[0], b->mode[0], -1);
AV_COPY32(&b->mv[1][0], &b->mv[0][0]);
AV_COPY32(&b->mv[2][0], &b->mv[0][0]);
AV_COPY32(&b->mv[3][0], &b->mv[0][0]);
AV_COPY32(&b->mv[1][1], &b->mv[0][1]);
AV_COPY32(&b->mv[2][1], &b->mv[0][1]);
AV_COPY32(&b->mv[3][1], &b->mv[0][1]);
}
vref = b->ref[b->comp ? s->s.h.signbias[s->s.h.varcompref[0]] : 0];
}
#if HAVE_FAST_64BIT
#define SPLAT_CTX(var, val, n) \
switch (n) { \
case 1: var = val; break; \
case 2: AV_WN16A(&var, val * 0x0101); break; \
case 4: AV_WN32A(&var, val * 0x01010101); break; \
case 8: AV_WN64A(&var, val * 0x0101010101010101ULL); break; \
case 16: { \
uint64_t v64 = val * 0x0101010101010101ULL; \
AV_WN64A( &var, v64); \
AV_WN64A(&((uint8_t *) &var)[8], v64); \
break; \
} \
}
#else
#define SPLAT_CTX(var, val, n) \
switch (n) { \
case 1: var = val; break; \
case 2: AV_WN16A(&var, val * 0x0101); break; \
case 4: AV_WN32A(&var, val * 0x01010101); break; \
case 8: { \
uint32_t v32 = val * 0x01010101; \
AV_WN32A( &var, v32); \
AV_WN32A(&((uint8_t *) &var)[4], v32); \
break; \
} \
case 16: { \
uint32_t v32 = val * 0x01010101; \
AV_WN32A( &var, v32); \
AV_WN32A(&((uint8_t *) &var)[4], v32); \
AV_WN32A(&((uint8_t *) &var)[8], v32); \
AV_WN32A(&((uint8_t *) &var)[12], v32); \
break; \
} \
}
#endif
switch (bwh_tab[1][b->bs][0]) {
#define SET_CTXS(dir, off, n) \
do { \
SPLAT_CTX(s->dir##_skip_ctx[off], b->skip, n); \
SPLAT_CTX(s->dir##_txfm_ctx[off], b->tx, n); \
SPLAT_CTX(s->dir##_partition_ctx[off], dir##_ctx[b->bs], n); \
if (!s->s.h.keyframe && !s->s.h.intraonly) { \
SPLAT_CTX(s->dir##_intra_ctx[off], b->intra, n); \
SPLAT_CTX(s->dir##_comp_ctx[off], b->comp, n); \
SPLAT_CTX(s->dir##_mode_ctx[off], b->mode[3], n); \
if (!b->intra) { \
SPLAT_CTX(s->dir##_ref_ctx[off], vref, n); \
if (s->s.h.filtermode == FILTER_SWITCHABLE) { \
SPLAT_CTX(s->dir##_filter_ctx[off], filter_id, n); \
} \
} \
} \
} while (0)
case 1: SET_CTXS(above, col, 1); break;
case 2: SET_CTXS(above, col, 2); break;
case 4: SET_CTXS(above, col, 4); break;
case 8: SET_CTXS(above, col, 8); break;
}
switch (bwh_tab[1][b->bs][1]) {
case 1: SET_CTXS(left, row7, 1); break;
case 2: SET_CTXS(left, row7, 2); break;
case 4: SET_CTXS(left, row7, 4); break;
case 8: SET_CTXS(left, row7, 8); break;
}
#undef SPLAT_CTX
#undef SET_CTXS
if (!s->s.h.keyframe && !s->s.h.intraonly) {
if (b->bs > BS_8x8) {
int mv0 = AV_RN32A(&b->mv[3][0]), mv1 = AV_RN32A(&b->mv[3][1]);
AV_COPY32(&s->left_mv_ctx[row7 * 2 + 0][0], &b->mv[1][0]);
AV_COPY32(&s->left_mv_ctx[row7 * 2 + 0][1], &b->mv[1][1]);
AV_WN32A(&s->left_mv_ctx[row7 * 2 + 1][0], mv0);
AV_WN32A(&s->left_mv_ctx[row7 * 2 + 1][1], mv1);
AV_COPY32(&s->above_mv_ctx[col * 2 + 0][0], &b->mv[2][0]);
AV_COPY32(&s->above_mv_ctx[col * 2 + 0][1], &b->mv[2][1]);
AV_WN32A(&s->above_mv_ctx[col * 2 + 1][0], mv0);
AV_WN32A(&s->above_mv_ctx[col * 2 + 1][1], mv1);
} else {
int n, mv0 = AV_RN32A(&b->mv[3][0]), mv1 = AV_RN32A(&b->mv[3][1]);
for (n = 0; n < w4 * 2; n++) {
AV_WN32A(&s->above_mv_ctx[col * 2 + n][0], mv0);
AV_WN32A(&s->above_mv_ctx[col * 2 + n][1], mv1);
}
for (n = 0; n < h4 * 2; n++) {
AV_WN32A(&s->left_mv_ctx[row7 * 2 + n][0], mv0);
AV_WN32A(&s->left_mv_ctx[row7 * 2 + n][1], mv1);
}
}
}
// FIXME kinda ugly
for (y = 0; y < h4; y++) {
int x, o = (row + y) * s->sb_cols * 8 + col;
struct VP9mvrefPair *mv = &s->s.frames[CUR_FRAME].mv[o];
if (b->intra) {
for (x = 0; x < w4; x++) {
mv[x].ref[0] =
mv[x].ref[1] = -1;
}
} else if (b->comp) {
for (x = 0; x < w4; x++) {
mv[x].ref[0] = b->ref[0];
mv[x].ref[1] = b->ref[1];
AV_COPY32(&mv[x].mv[0], &b->mv[3][0]);
AV_COPY32(&mv[x].mv[1], &b->mv[3][1]);
}
} else {
for (x = 0; x < w4; x++) {
mv[x].ref[0] = b->ref[0];
mv[x].ref[1] = -1;
AV_COPY32(&mv[x].mv[0], &b->mv[3][0]);
}
}
}
}
// FIXME merge cnt/eob arguments?
static av_always_inline int
decode_coeffs_b_generic(VP56RangeCoder *c, int16_t *coef, int n_coeffs,
int is_tx32x32, int is8bitsperpixel, int bpp, unsigned (*cnt)[6][3],
unsigned (*eob)[6][2], uint8_t (*p)[6][11],
int nnz, const int16_t *scan, const int16_t (*nb)[2],
const int16_t *band_counts, const int16_t *qmul)
{
int i = 0, band = 0, band_left = band_counts[band];
uint8_t *tp = p[0][nnz];
uint8_t cache[1024];
do {
int val, rc;
val = vp56_rac_get_prob_branchy(c, tp[0]); // eob
eob[band][nnz][val]++;
if (!val)
break;
skip_eob:
if (!vp56_rac_get_prob_branchy(c, tp[1])) { // zero
cnt[band][nnz][0]++;
if (!--band_left)
band_left = band_counts[++band];
cache[scan[i]] = 0;
nnz = (1 + cache[nb[i][0]] + cache[nb[i][1]]) >> 1;
tp = p[band][nnz];
if (++i == n_coeffs)
break; //invalid input; blocks should end with EOB
goto skip_eob;
}
rc = scan[i];
if (!vp56_rac_get_prob_branchy(c, tp[2])) { // one
cnt[band][nnz][1]++;
val = 1;
cache[rc] = 1;
} else {
// fill in p[3-10] (model fill) - only once per frame for each pos
if (!tp[3])
memcpy(&tp[3], vp9_model_pareto8[tp[2]], 8);
cnt[band][nnz][2]++;
if (!vp56_rac_get_prob_branchy(c, tp[3])) { // 2, 3, 4
if (!vp56_rac_get_prob_branchy(c, tp[4])) {
cache[rc] = val = 2;
} else {
val = 3 + vp56_rac_get_prob(c, tp[5]);
cache[rc] = 3;
}
} else if (!vp56_rac_get_prob_branchy(c, tp[6])) { // cat1/2
cache[rc] = 4;
if (!vp56_rac_get_prob_branchy(c, tp[7])) {
val = 5 + vp56_rac_get_prob(c, 159);
} else {
val = 7 + (vp56_rac_get_prob(c, 165) << 1);
val += vp56_rac_get_prob(c, 145);
}
} else { // cat 3-6
cache[rc] = 5;
if (!vp56_rac_get_prob_branchy(c, tp[8])) {
if (!vp56_rac_get_prob_branchy(c, tp[9])) {
val = 11 + (vp56_rac_get_prob(c, 173) << 2);
val += (vp56_rac_get_prob(c, 148) << 1);
val += vp56_rac_get_prob(c, 140);
} else {
val = 19 + (vp56_rac_get_prob(c, 176) << 3);
val += (vp56_rac_get_prob(c, 155) << 2);
val += (vp56_rac_get_prob(c, 140) << 1);
val += vp56_rac_get_prob(c, 135);
}
} else if (!vp56_rac_get_prob_branchy(c, tp[10])) {
val = 35 + (vp56_rac_get_prob(c, 180) << 4);
val += (vp56_rac_get_prob(c, 157) << 3);
val += (vp56_rac_get_prob(c, 141) << 2);
val += (vp56_rac_get_prob(c, 134) << 1);
val += vp56_rac_get_prob(c, 130);
} else {
val = 67;
if (!is8bitsperpixel) {
if (bpp == 12) {
val += vp56_rac_get_prob(c, 255) << 17;
val += vp56_rac_get_prob(c, 255) << 16;
}
val += (vp56_rac_get_prob(c, 255) << 15);
val += (vp56_rac_get_prob(c, 255) << 14);
}
val += (vp56_rac_get_prob(c, 254) << 13);
val += (vp56_rac_get_prob(c, 254) << 12);
val += (vp56_rac_get_prob(c, 254) << 11);
val += (vp56_rac_get_prob(c, 252) << 10);
val += (vp56_rac_get_prob(c, 249) << 9);
val += (vp56_rac_get_prob(c, 243) << 8);
val += (vp56_rac_get_prob(c, 230) << 7);
val += (vp56_rac_get_prob(c, 196) << 6);
val += (vp56_rac_get_prob(c, 177) << 5);
val += (vp56_rac_get_prob(c, 153) << 4);
val += (vp56_rac_get_prob(c, 140) << 3);
val += (vp56_rac_get_prob(c, 133) << 2);
val += (vp56_rac_get_prob(c, 130) << 1);
val += vp56_rac_get_prob(c, 129);
}
}
}
#define STORE_COEF(c, i, v) do { \
if (is8bitsperpixel) { \
c[i] = v; \
} else { \
AV_WN32A(&c[i * 2], v); \
} \
} while (0)
if (!--band_left)
band_left = band_counts[++band];
if (is_tx32x32)
STORE_COEF(coef, rc, ((vp8_rac_get(c) ? -val : val) * qmul[!!i]) / 2);
else
STORE_COEF(coef, rc, (vp8_rac_get(c) ? -val : val) * qmul[!!i]);
nnz = (1 + cache[nb[i][0]] + cache[nb[i][1]]) >> 1;
tp = p[band][nnz];
} while (++i < n_coeffs);
return i;
}
static int decode_coeffs_b_8bpp(VP9Context *s, int16_t *coef, int n_coeffs,
unsigned (*cnt)[6][3], unsigned (*eob)[6][2],
uint8_t (*p)[6][11], int nnz, const int16_t *scan,
const int16_t (*nb)[2], const int16_t *band_counts,
const int16_t *qmul)
{
return decode_coeffs_b_generic(&s->c, coef, n_coeffs, 0, 1, 8, cnt, eob, p,
nnz, scan, nb, band_counts, qmul);
}
static int decode_coeffs_b32_8bpp(VP9Context *s, int16_t *coef, int n_coeffs,
unsigned (*cnt)[6][3], unsigned (*eob)[6][2],
uint8_t (*p)[6][11], int nnz, const int16_t *scan,
const int16_t (*nb)[2], const int16_t *band_counts,
const int16_t *qmul)
{
return decode_coeffs_b_generic(&s->c, coef, n_coeffs, 1, 1, 8, cnt, eob, p,
nnz, scan, nb, band_counts, qmul);
}
static int decode_coeffs_b_16bpp(VP9Context *s, int16_t *coef, int n_coeffs,
unsigned (*cnt)[6][3], unsigned (*eob)[6][2],
uint8_t (*p)[6][11], int nnz, const int16_t *scan,
const int16_t (*nb)[2], const int16_t *band_counts,
const int16_t *qmul)
{
return decode_coeffs_b_generic(&s->c, coef, n_coeffs, 0, 0, s->bpp, cnt, eob, p,
nnz, scan, nb, band_counts, qmul);
}
static int decode_coeffs_b32_16bpp(VP9Context *s, int16_t *coef, int n_coeffs,
unsigned (*cnt)[6][3], unsigned (*eob)[6][2],
uint8_t (*p)[6][11], int nnz, const int16_t *scan,
const int16_t (*nb)[2], const int16_t *band_counts,
const int16_t *qmul)
{
return decode_coeffs_b_generic(&s->c, coef, n_coeffs, 1, 0, s->bpp, cnt, eob, p,
nnz, scan, nb, band_counts, qmul);
}
static av_always_inline int decode_coeffs(AVCodecContext *ctx, int is8bitsperpixel)
{
VP9Context *s = ctx->priv_data;
VP9Block *b = s->b;
int row = s->row, col = s->col;
uint8_t (*p)[6][11] = s->prob.coef[b->tx][0 /* y */][!b->intra];
unsigned (*c)[6][3] = s->counts.coef[b->tx][0 /* y */][!b->intra];
unsigned (*e)[6][2] = s->counts.eob[b->tx][0 /* y */][!b->intra];
int w4 = bwh_tab[1][b->bs][0] << 1, h4 = bwh_tab[1][b->bs][1] << 1;
int end_x = FFMIN(2 * (s->cols - col), w4);
int end_y = FFMIN(2 * (s->rows - row), h4);
int n, pl, x, y, res;
int16_t (*qmul)[2] = s->s.h.segmentation.feat[b->seg_id].qmul;
int tx = 4 * s->s.h.lossless + b->tx;
const int16_t * const *yscans = vp9_scans[tx];
const int16_t (* const *ynbs)[2] = vp9_scans_nb[tx];
const int16_t *uvscan = vp9_scans[b->uvtx][DCT_DCT];
const int16_t (*uvnb)[2] = vp9_scans_nb[b->uvtx][DCT_DCT];
uint8_t *a = &s->above_y_nnz_ctx[col * 2];
uint8_t *l = &s->left_y_nnz_ctx[(row & 7) << 1];
static const int16_t band_counts[4][8] = {
{ 1, 2, 3, 4, 3, 16 - 13 },
{ 1, 2, 3, 4, 11, 64 - 21 },
{ 1, 2, 3, 4, 11, 256 - 21 },
{ 1, 2, 3, 4, 11, 1024 - 21 },
};
const int16_t *y_band_counts = band_counts[b->tx];
const int16_t *uv_band_counts = band_counts[b->uvtx];
int bytesperpixel = is8bitsperpixel ? 1 : 2;
int total_coeff = 0;
#define MERGE(la, end, step, rd) \
for (n = 0; n < end; n += step) \
la[n] = !!rd(&la[n])
#define MERGE_CTX(step, rd) \
do { \
MERGE(l, end_y, step, rd); \
MERGE(a, end_x, step, rd); \
} while (0)
#define DECODE_Y_COEF_LOOP(step, mode_index, v) \
for (n = 0, y = 0; y < end_y; y += step) { \
for (x = 0; x < end_x; x += step, n += step * step) { \
enum TxfmType txtp = vp9_intra_txfm_type[b->mode[mode_index]]; \
res = (is8bitsperpixel ? decode_coeffs_b##v##_8bpp : decode_coeffs_b##v##_16bpp) \
(s, s->block + 16 * n * bytesperpixel, 16 * step * step, \
c, e, p, a[x] + l[y], yscans[txtp], \
ynbs[txtp], y_band_counts, qmul[0]); \
a[x] = l[y] = !!res; \
total_coeff |= !!res; \
if (step >= 4) { \
AV_WN16A(&s->eob[n], res); \
} else { \
s->eob[n] = res; \
} \
} \
}
#define SPLAT(la, end, step, cond) \
if (step == 2) { \
for (n = 1; n < end; n += step) \
la[n] = la[n - 1]; \
} else if (step == 4) { \
if (cond) { \
for (n = 0; n < end; n += step) \
AV_WN32A(&la[n], la[n] * 0x01010101); \
} else { \
for (n = 0; n < end; n += step) \
memset(&la[n + 1], la[n], FFMIN(end - n - 1, 3)); \
} \
} else /* step == 8 */ { \
if (cond) { \
if (HAVE_FAST_64BIT) { \
for (n = 0; n < end; n += step) \
AV_WN64A(&la[n], la[n] * 0x0101010101010101ULL); \
} else { \
for (n = 0; n < end; n += step) { \
uint32_t v32 = la[n] * 0x01010101; \
AV_WN32A(&la[n], v32); \
AV_WN32A(&la[n + 4], v32); \
} \
} \
} else { \
for (n = 0; n < end; n += step) \
memset(&la[n + 1], la[n], FFMIN(end - n - 1, 7)); \
} \
}
#define SPLAT_CTX(step) \
do { \
SPLAT(a, end_x, step, end_x == w4); \
SPLAT(l, end_y, step, end_y == h4); \
} while (0)
/* y tokens */
switch (b->tx) {
case TX_4X4:
DECODE_Y_COEF_LOOP(1, b->bs > BS_8x8 ? n : 0,);
break;
case TX_8X8:
MERGE_CTX(2, AV_RN16A);
DECODE_Y_COEF_LOOP(2, 0,);
SPLAT_CTX(2);
break;
case TX_16X16:
MERGE_CTX(4, AV_RN32A);
DECODE_Y_COEF_LOOP(4, 0,);
SPLAT_CTX(4);
break;
case TX_32X32:
MERGE_CTX(8, AV_RN64A);
DECODE_Y_COEF_LOOP(8, 0, 32);
SPLAT_CTX(8);
break;
}
#define DECODE_UV_COEF_LOOP(step, v) \
for (n = 0, y = 0; y < end_y; y += step) { \
for (x = 0; x < end_x; x += step, n += step * step) { \
res = (is8bitsperpixel ? decode_coeffs_b##v##_8bpp : decode_coeffs_b##v##_16bpp) \
(s, s->uvblock[pl] + 16 * n * bytesperpixel, \
16 * step * step, c, e, p, a[x] + l[y], \
uvscan, uvnb, uv_band_counts, qmul[1]); \
a[x] = l[y] = !!res; \
total_coeff |= !!res; \
if (step >= 4) { \
AV_WN16A(&s->uveob[pl][n], res); \
} else { \
s->uveob[pl][n] = res; \
} \
} \
}
p = s->prob.coef[b->uvtx][1 /* uv */][!b->intra];
c = s->counts.coef[b->uvtx][1 /* uv */][!b->intra];
e = s->counts.eob[b->uvtx][1 /* uv */][!b->intra];
w4 >>= s->ss_h;
end_x >>= s->ss_h;
h4 >>= s->ss_v;
end_y >>= s->ss_v;
for (pl = 0; pl < 2; pl++) {
a = &s->above_uv_nnz_ctx[pl][col << !s->ss_h];
l = &s->left_uv_nnz_ctx[pl][(row & 7) << !s->ss_v];
switch (b->uvtx) {
case TX_4X4:
DECODE_UV_COEF_LOOP(1,);
break;
case TX_8X8:
MERGE_CTX(2, AV_RN16A);
DECODE_UV_COEF_LOOP(2,);
SPLAT_CTX(2);
break;
case TX_16X16:
MERGE_CTX(4, AV_RN32A);
DECODE_UV_COEF_LOOP(4,);
SPLAT_CTX(4);
break;
case TX_32X32:
MERGE_CTX(8, AV_RN64A);
DECODE_UV_COEF_LOOP(8, 32);
SPLAT_CTX(8);
break;
}
}
return total_coeff;
}
static int decode_coeffs_8bpp(AVCodecContext *ctx)
{
return decode_coeffs(ctx, 1);
}
static int decode_coeffs_16bpp(AVCodecContext *ctx)
{
return decode_coeffs(ctx, 0);
}
static av_always_inline int check_intra_mode(VP9Context *s, int mode, uint8_t **a,
uint8_t *dst_edge, ptrdiff_t stride_edge,
uint8_t *dst_inner, ptrdiff_t stride_inner,
uint8_t *l, int col, int x, int w,
int row, int y, enum TxfmMode tx,
int p, int ss_h, int ss_v, int bytesperpixel)
{
int have_top = row > 0 || y > 0;
int have_left = col > s->tile_col_start || x > 0;
int have_right = x < w - 1;
int bpp = s->bpp;
static const uint8_t mode_conv[10][2 /* have_left */][2 /* have_top */] = {
[VERT_PRED] = { { DC_127_PRED, VERT_PRED },
{ DC_127_PRED, VERT_PRED } },
[HOR_PRED] = { { DC_129_PRED, DC_129_PRED },
{ HOR_PRED, HOR_PRED } },
[DC_PRED] = { { DC_128_PRED, TOP_DC_PRED },
{ LEFT_DC_PRED, DC_PRED } },
[DIAG_DOWN_LEFT_PRED] = { { DC_127_PRED, DIAG_DOWN_LEFT_PRED },
{ DC_127_PRED, DIAG_DOWN_LEFT_PRED } },
[DIAG_DOWN_RIGHT_PRED] = { { DIAG_DOWN_RIGHT_PRED, DIAG_DOWN_RIGHT_PRED },
{ DIAG_DOWN_RIGHT_PRED, DIAG_DOWN_RIGHT_PRED } },
[VERT_RIGHT_PRED] = { { VERT_RIGHT_PRED, VERT_RIGHT_PRED },
{ VERT_RIGHT_PRED, VERT_RIGHT_PRED } },
[HOR_DOWN_PRED] = { { HOR_DOWN_PRED, HOR_DOWN_PRED },
{ HOR_DOWN_PRED, HOR_DOWN_PRED } },
[VERT_LEFT_PRED] = { { DC_127_PRED, VERT_LEFT_PRED },
{ DC_127_PRED, VERT_LEFT_PRED } },
[HOR_UP_PRED] = { { DC_129_PRED, DC_129_PRED },
{ HOR_UP_PRED, HOR_UP_PRED } },
[TM_VP8_PRED] = { { DC_129_PRED, VERT_PRED },
{ HOR_PRED, TM_VP8_PRED } },
};
static const struct {
uint8_t needs_left:1;
uint8_t needs_top:1;
uint8_t needs_topleft:1;
uint8_t needs_topright:1;
uint8_t invert_left:1;
} edges[N_INTRA_PRED_MODES] = {
[VERT_PRED] = { .needs_top = 1 },
[HOR_PRED] = { .needs_left = 1 },
[DC_PRED] = { .needs_top = 1, .needs_left = 1 },
[DIAG_DOWN_LEFT_PRED] = { .needs_top = 1, .needs_topright = 1 },
[DIAG_DOWN_RIGHT_PRED] = { .needs_left = 1, .needs_top = 1, .needs_topleft = 1 },
[VERT_RIGHT_PRED] = { .needs_left = 1, .needs_top = 1, .needs_topleft = 1 },
[HOR_DOWN_PRED] = { .needs_left = 1, .needs_top = 1, .needs_topleft = 1 },
[VERT_LEFT_PRED] = { .needs_top = 1, .needs_topright = 1 },
[HOR_UP_PRED] = { .needs_left = 1, .invert_left = 1 },
[TM_VP8_PRED] = { .needs_left = 1, .needs_top = 1, .needs_topleft = 1 },
[LEFT_DC_PRED] = { .needs_left = 1 },
[TOP_DC_PRED] = { .needs_top = 1 },
[DC_128_PRED] = { 0 },
[DC_127_PRED] = { 0 },
[DC_129_PRED] = { 0 }
};
av_assert2(mode >= 0 && mode < 10);
mode = mode_conv[mode][have_left][have_top];
if (edges[mode].needs_top) {
uint8_t *top, *topleft;
int n_px_need = 4 << tx, n_px_have = (((s->cols - col) << !ss_h) - x) * 4;
int n_px_need_tr = 0;
if (tx == TX_4X4 && edges[mode].needs_topright && have_right)
n_px_need_tr = 4;
// if top of sb64-row, use s->intra_pred_data[] instead of
// dst[-stride] for intra prediction (it contains pre- instead of
// post-loopfilter data)
if (have_top) {
top = !(row & 7) && !y ?
s->intra_pred_data[p] + (col * (8 >> ss_h) + x * 4) * bytesperpixel :
y == 0 ? &dst_edge[-stride_edge] : &dst_inner[-stride_inner];
if (have_left)
topleft = !(row & 7) && !y ?
s->intra_pred_data[p] + (col * (8 >> ss_h) + x * 4) * bytesperpixel :
y == 0 || x == 0 ? &dst_edge[-stride_edge] :
&dst_inner[-stride_inner];
}
if (have_top &&
(!edges[mode].needs_topleft || (have_left && top == topleft)) &&
(tx != TX_4X4 || !edges[mode].needs_topright || have_right) &&
n_px_need + n_px_need_tr <= n_px_have) {
*a = top;
} else {
if (have_top) {
if (n_px_need <= n_px_have) {
memcpy(*a, top, n_px_need * bytesperpixel);
} else {
#define memset_bpp(c, i1, v, i2, num) do { \
if (bytesperpixel == 1) { \
memset(&(c)[(i1)], (v)[(i2)], (num)); \
} else { \
int n, val = AV_RN16A(&(v)[(i2) * 2]); \
for (n = 0; n < (num); n++) { \
AV_WN16A(&(c)[((i1) + n) * 2], val); \
} \
} \
} while (0)
memcpy(*a, top, n_px_have * bytesperpixel);
memset_bpp(*a, n_px_have, (*a), n_px_have - 1, n_px_need - n_px_have);
}
} else {
#define memset_val(c, val, num) do { \
if (bytesperpixel == 1) { \
memset((c), (val), (num)); \
} else { \
int n; \
for (n = 0; n < (num); n++) { \
AV_WN16A(&(c)[n * 2], (val)); \
} \
} \
} while (0)
memset_val(*a, (128 << (bpp - 8)) - 1, n_px_need);
}
if (edges[mode].needs_topleft) {
if (have_left && have_top) {
#define assign_bpp(c, i1, v, i2) do { \
if (bytesperpixel == 1) { \
(c)[(i1)] = (v)[(i2)]; \
} else { \
AV_COPY16(&(c)[(i1) * 2], &(v)[(i2) * 2]); \
} \
} while (0)
assign_bpp(*a, -1, topleft, -1);
} else {
#define assign_val(c, i, v) do { \
if (bytesperpixel == 1) { \
(c)[(i)] = (v); \
} else { \
AV_WN16A(&(c)[(i) * 2], (v)); \
} \
} while (0)
assign_val((*a), -1, (128 << (bpp - 8)) + (have_top ? +1 : -1));
}
}
if (tx == TX_4X4 && edges[mode].needs_topright) {
if (have_top && have_right &&
n_px_need + n_px_need_tr <= n_px_have) {
memcpy(&(*a)[4 * bytesperpixel], &top[4 * bytesperpixel], 4 * bytesperpixel);
} else {
memset_bpp(*a, 4, *a, 3, 4);
}
}
}
}
if (edges[mode].needs_left) {
if (have_left) {
int n_px_need = 4 << tx, i, n_px_have = (((s->rows - row) << !ss_v) - y) * 4;
uint8_t *dst = x == 0 ? dst_edge : dst_inner;
ptrdiff_t stride = x == 0 ? stride_edge : stride_inner;
if (edges[mode].invert_left) {
if (n_px_need <= n_px_have) {
for (i = 0; i < n_px_need; i++)
assign_bpp(l, i, &dst[i * stride], -1);
} else {
for (i = 0; i < n_px_have; i++)
assign_bpp(l, i, &dst[i * stride], -1);
memset_bpp(l, n_px_have, l, n_px_have - 1, n_px_need - n_px_have);
}
} else {
if (n_px_need <= n_px_have) {
for (i = 0; i < n_px_need; i++)
assign_bpp(l, n_px_need - 1 - i, &dst[i * stride], -1);
} else {
for (i = 0; i < n_px_have; i++)
assign_bpp(l, n_px_need - 1 - i, &dst[i * stride], -1);
memset_bpp(l, 0, l, n_px_need - n_px_have, n_px_need - n_px_have);
}
}
} else {
memset_val(l, (128 << (bpp - 8)) + 1, 4 << tx);
}
}
return mode;
}
static av_always_inline void intra_recon(AVCodecContext *ctx, ptrdiff_t y_off,
ptrdiff_t uv_off, int bytesperpixel)
{
VP9Context *s = ctx->priv_data;
VP9Block *b = s->b;
int row = s->row, col = s->col;
int w4 = bwh_tab[1][b->bs][0] << 1, step1d = 1 << b->tx, n;
int h4 = bwh_tab[1][b->bs][1] << 1, x, y, step = 1 << (b->tx * 2);
int end_x = FFMIN(2 * (s->cols - col), w4);
int end_y = FFMIN(2 * (s->rows - row), h4);
int tx = 4 * s->s.h.lossless + b->tx, uvtx = b->uvtx + 4 * s->s.h.lossless;
int uvstep1d = 1 << b->uvtx, p;
uint8_t *dst = s->dst[0], *dst_r = s->s.frames[CUR_FRAME].tf.f->data[0] + y_off;
LOCAL_ALIGNED_32(uint8_t, a_buf, [96]);
LOCAL_ALIGNED_32(uint8_t, l, [64]);
for (n = 0, y = 0; y < end_y; y += step1d) {
uint8_t *ptr = dst, *ptr_r = dst_r;
for (x = 0; x < end_x; x += step1d, ptr += 4 * step1d * bytesperpixel,
ptr_r += 4 * step1d * bytesperpixel, n += step) {
int mode = b->mode[b->bs > BS_8x8 && b->tx == TX_4X4 ?
y * 2 + x : 0];
uint8_t *a = &a_buf[32];
enum TxfmType txtp = vp9_intra_txfm_type[mode];
int eob = b->skip ? 0 : b->tx > TX_8X8 ? AV_RN16A(&s->eob[n]) : s->eob[n];
mode = check_intra_mode(s, mode, &a, ptr_r,
s->s.frames[CUR_FRAME].tf.f->linesize[0],
ptr, s->y_stride, l,
col, x, w4, row, y, b->tx, 0, 0, 0, bytesperpixel);
s->dsp.intra_pred[b->tx][mode](ptr, s->y_stride, l, a);
if (eob)
s->dsp.itxfm_add[tx][txtp](ptr, s->y_stride,
s->block + 16 * n * bytesperpixel, eob);
}
dst_r += 4 * step1d * s->s.frames[CUR_FRAME].tf.f->linesize[0];
dst += 4 * step1d * s->y_stride;
}
// U/V
w4 >>= s->ss_h;
end_x >>= s->ss_h;
end_y >>= s->ss_v;
step = 1 << (b->uvtx * 2);
for (p = 0; p < 2; p++) {
dst = s->dst[1 + p];
dst_r = s->s.frames[CUR_FRAME].tf.f->data[1 + p] + uv_off;
for (n = 0, y = 0; y < end_y; y += uvstep1d) {
uint8_t *ptr = dst, *ptr_r = dst_r;
for (x = 0; x < end_x; x += uvstep1d, ptr += 4 * uvstep1d * bytesperpixel,
ptr_r += 4 * uvstep1d * bytesperpixel, n += step) {
int mode = b->uvmode;
uint8_t *a = &a_buf[32];
int eob = b->skip ? 0 : b->uvtx > TX_8X8 ? AV_RN16A(&s->uveob[p][n]) : s->uveob[p][n];
mode = check_intra_mode(s, mode, &a, ptr_r,
s->s.frames[CUR_FRAME].tf.f->linesize[1],
ptr, s->uv_stride, l, col, x, w4, row, y,
b->uvtx, p + 1, s->ss_h, s->ss_v, bytesperpixel);
s->dsp.intra_pred[b->uvtx][mode](ptr, s->uv_stride, l, a);
if (eob)
s->dsp.itxfm_add[uvtx][DCT_DCT](ptr, s->uv_stride,
s->uvblock[p] + 16 * n * bytesperpixel, eob);
}
dst_r += 4 * uvstep1d * s->s.frames[CUR_FRAME].tf.f->linesize[1];
dst += 4 * uvstep1d * s->uv_stride;
}
}
}
static void intra_recon_8bpp(AVCodecContext *ctx, ptrdiff_t y_off, ptrdiff_t uv_off)
{
intra_recon(ctx, y_off, uv_off, 1);
}
static void intra_recon_16bpp(AVCodecContext *ctx, ptrdiff_t y_off, ptrdiff_t uv_off)
{
intra_recon(ctx, y_off, uv_off, 2);
}
static av_always_inline void mc_luma_unscaled(VP9Context *s, vp9_mc_func (*mc)[2],
uint8_t *dst, ptrdiff_t dst_stride,
const uint8_t *ref, ptrdiff_t ref_stride,
ThreadFrame *ref_frame,
ptrdiff_t y, ptrdiff_t x, const VP56mv *mv,
int bw, int bh, int w, int h, int bytesperpixel)
{
int mx = mv->x, my = mv->y, th;
y += my >> 3;
x += mx >> 3;
ref += y * ref_stride + x * bytesperpixel;
mx &= 7;
my &= 7;
// FIXME bilinear filter only needs 0/1 pixels, not 3/4
// we use +7 because the last 7 pixels of each sbrow can be changed in
// the longest loopfilter of the next sbrow
th = (y + bh + 4 * !!my + 7) >> 6;
ff_thread_await_progress(ref_frame, FFMAX(th, 0), 0);
if (x < !!mx * 3 || y < !!my * 3 ||
x + !!mx * 4 > w - bw || y + !!my * 4 > h - bh) {
s->vdsp.emulated_edge_mc(s->edge_emu_buffer,
ref - !!my * 3 * ref_stride - !!mx * 3 * bytesperpixel,
160, ref_stride,
bw + !!mx * 7, bh + !!my * 7,
x - !!mx * 3, y - !!my * 3, w, h);
ref = s->edge_emu_buffer + !!my * 3 * 160 + !!mx * 3 * bytesperpixel;
ref_stride = 160;
}
mc[!!mx][!!my](dst, dst_stride, ref, ref_stride, bh, mx << 1, my << 1);
}
static av_always_inline void mc_chroma_unscaled(VP9Context *s, vp9_mc_func (*mc)[2],
uint8_t *dst_u, uint8_t *dst_v,
ptrdiff_t dst_stride,
const uint8_t *ref_u, ptrdiff_t src_stride_u,
const uint8_t *ref_v, ptrdiff_t src_stride_v,
ThreadFrame *ref_frame,
ptrdiff_t y, ptrdiff_t x, const VP56mv *mv,
int bw, int bh, int w, int h, int bytesperpixel)
{
int mx = mv->x << !s->ss_h, my = mv->y << !s->ss_v, th;
y += my >> 4;
x += mx >> 4;
ref_u += y * src_stride_u + x * bytesperpixel;
ref_v += y * src_stride_v + x * bytesperpixel;
mx &= 15;
my &= 15;
// FIXME bilinear filter only needs 0/1 pixels, not 3/4
// we use +7 because the last 7 pixels of each sbrow can be changed in
// the longest loopfilter of the next sbrow
th = (y + bh + 4 * !!my + 7) >> (6 - s->ss_v);
ff_thread_await_progress(ref_frame, FFMAX(th, 0), 0);
if (x < !!mx * 3 || y < !!my * 3 ||
x + !!mx * 4 > w - bw || y + !!my * 4 > h - bh) {
s->vdsp.emulated_edge_mc(s->edge_emu_buffer,
ref_u - !!my * 3 * src_stride_u - !!mx * 3 * bytesperpixel,
160, src_stride_u,
bw + !!mx * 7, bh + !!my * 7,
x - !!mx * 3, y - !!my * 3, w, h);
ref_u = s->edge_emu_buffer + !!my * 3 * 160 + !!mx * 3 * bytesperpixel;
mc[!!mx][!!my](dst_u, dst_stride, ref_u, 160, bh, mx, my);
s->vdsp.emulated_edge_mc(s->edge_emu_buffer,
ref_v - !!my * 3 * src_stride_v - !!mx * 3 * bytesperpixel,
160, src_stride_v,
bw + !!mx * 7, bh + !!my * 7,
x - !!mx * 3, y - !!my * 3, w, h);
ref_v = s->edge_emu_buffer + !!my * 3 * 160 + !!mx * 3 * bytesperpixel;
mc[!!mx][!!my](dst_v, dst_stride, ref_v, 160, bh, mx, my);
} else {
mc[!!mx][!!my](dst_u, dst_stride, ref_u, src_stride_u, bh, mx, my);
mc[!!mx][!!my](dst_v, dst_stride, ref_v, src_stride_v, bh, mx, my);
}
}
#define mc_luma_dir(s, mc, dst, dst_ls, src, src_ls, tref, row, col, mv, \
px, py, pw, ph, bw, bh, w, h, i) \
mc_luma_unscaled(s, s->dsp.mc, dst, dst_ls, src, src_ls, tref, row, col, \
mv, bw, bh, w, h, bytesperpixel)
#define mc_chroma_dir(s, mc, dstu, dstv, dst_ls, srcu, srcu_ls, srcv, srcv_ls, tref, \
row, col, mv, px, py, pw, ph, bw, bh, w, h, i) \
mc_chroma_unscaled(s, s->dsp.mc, dstu, dstv, dst_ls, srcu, srcu_ls, srcv, srcv_ls, tref, \
row, col, mv, bw, bh, w, h, bytesperpixel)
#define SCALED 0
#define FN(x) x##_8bpp
#define BYTES_PER_PIXEL 1
#include "vp9_mc_template.c"
#undef FN
#undef BYTES_PER_PIXEL
#define FN(x) x##_16bpp
#define BYTES_PER_PIXEL 2
#include "vp9_mc_template.c"
#undef mc_luma_dir
#undef mc_chroma_dir
#undef FN
#undef BYTES_PER_PIXEL
#undef SCALED
static av_always_inline void mc_luma_scaled(VP9Context *s, vp9_scaled_mc_func smc,
vp9_mc_func (*mc)[2],
uint8_t *dst, ptrdiff_t dst_stride,
const uint8_t *ref, ptrdiff_t ref_stride,
ThreadFrame *ref_frame,
ptrdiff_t y, ptrdiff_t x, const VP56mv *in_mv,
int px, int py, int pw, int ph,
int bw, int bh, int w, int h, int bytesperpixel,
const uint16_t *scale, const uint8_t *step)
{
if (s->s.frames[CUR_FRAME].tf.f->width == ref_frame->f->width &&
s->s.frames[CUR_FRAME].tf.f->height == ref_frame->f->height) {
mc_luma_unscaled(s, mc, dst, dst_stride, ref, ref_stride, ref_frame,
y, x, in_mv, bw, bh, w, h, bytesperpixel);
} else {
#define scale_mv(n, dim) (((int64_t)(n) * scale[dim]) >> 14)
int mx, my;
int refbw_m1, refbh_m1;
int th;
VP56mv mv;
mv.x = av_clip(in_mv->x, -(x + pw - px + 4) << 3, (s->cols * 8 - x + px + 3) << 3);
mv.y = av_clip(in_mv->y, -(y + ph - py + 4) << 3, (s->rows * 8 - y + py + 3) << 3);
// BUG libvpx seems to scale the two components separately. This introduces
// rounding errors but we have to reproduce them to be exactly compatible
// with the output from libvpx...
mx = scale_mv(mv.x * 2, 0) + scale_mv(x * 16, 0);
my = scale_mv(mv.y * 2, 1) + scale_mv(y * 16, 1);
y = my >> 4;
x = mx >> 4;
ref += y * ref_stride + x * bytesperpixel;
mx &= 15;
my &= 15;
refbw_m1 = ((bw - 1) * step[0] + mx) >> 4;
refbh_m1 = ((bh - 1) * step[1] + my) >> 4;
// FIXME bilinear filter only needs 0/1 pixels, not 3/4
// we use +7 because the last 7 pixels of each sbrow can be changed in
// the longest loopfilter of the next sbrow
th = (y + refbh_m1 + 4 + 7) >> 6;
ff_thread_await_progress(ref_frame, FFMAX(th, 0), 0);
if (x < 3 || y < 3 || x + 4 >= w - refbw_m1 || y + 4 >= h - refbh_m1) {
s->vdsp.emulated_edge_mc(s->edge_emu_buffer,
ref - 3 * ref_stride - 3 * bytesperpixel,
288, ref_stride,
refbw_m1 + 8, refbh_m1 + 8,
x - 3, y - 3, w, h);
ref = s->edge_emu_buffer + 3 * 288 + 3 * bytesperpixel;
ref_stride = 288;
}
smc(dst, dst_stride, ref, ref_stride, bh, mx, my, step[0], step[1]);
}
}
static av_always_inline void mc_chroma_scaled(VP9Context *s, vp9_scaled_mc_func smc,
vp9_mc_func (*mc)[2],
uint8_t *dst_u, uint8_t *dst_v,
ptrdiff_t dst_stride,
const uint8_t *ref_u, ptrdiff_t src_stride_u,
const uint8_t *ref_v, ptrdiff_t src_stride_v,
ThreadFrame *ref_frame,
ptrdiff_t y, ptrdiff_t x, const VP56mv *in_mv,
int px, int py, int pw, int ph,
int bw, int bh, int w, int h, int bytesperpixel,
const uint16_t *scale, const uint8_t *step)
{
if (s->s.frames[CUR_FRAME].tf.f->width == ref_frame->f->width &&
s->s.frames[CUR_FRAME].tf.f->height == ref_frame->f->height) {
mc_chroma_unscaled(s, mc, dst_u, dst_v, dst_stride, ref_u, src_stride_u,
ref_v, src_stride_v, ref_frame,
y, x, in_mv, bw, bh, w, h, bytesperpixel);
} else {
int mx, my;
int refbw_m1, refbh_m1;
int th;
VP56mv mv;
if (s->ss_h) {
// BUG path_to_url
mv.x = av_clip(in_mv->x, -(x + pw - px + 4) << 4, (s->cols * 4 - x + px + 3) << 4);
mx = scale_mv(mv.x, 0) + (scale_mv(x * 16, 0) & ~15) + (scale_mv(x * 32, 0) & 15);
} else {
mv.x = av_clip(in_mv->x, -(x + pw - px + 4) << 3, (s->cols * 8 - x + px + 3) << 3);
mx = scale_mv(mv.x << 1, 0) + scale_mv(x * 16, 0);
}
if (s->ss_v) {
// BUG path_to_url
mv.y = av_clip(in_mv->y, -(y + ph - py + 4) << 4, (s->rows * 4 - y + py + 3) << 4);
my = scale_mv(mv.y, 1) + (scale_mv(y * 16, 1) & ~15) + (scale_mv(y * 32, 1) & 15);
} else {
mv.y = av_clip(in_mv->y, -(y + ph - py + 4) << 3, (s->rows * 8 - y + py + 3) << 3);
my = scale_mv(mv.y << 1, 1) + scale_mv(y * 16, 1);
}
#undef scale_mv
y = my >> 4;
x = mx >> 4;
ref_u += y * src_stride_u + x * bytesperpixel;
ref_v += y * src_stride_v + x * bytesperpixel;
mx &= 15;
my &= 15;
refbw_m1 = ((bw - 1) * step[0] + mx) >> 4;
refbh_m1 = ((bh - 1) * step[1] + my) >> 4;
// FIXME bilinear filter only needs 0/1 pixels, not 3/4
// we use +7 because the last 7 pixels of each sbrow can be changed in
// the longest loopfilter of the next sbrow
th = (y + refbh_m1 + 4 + 7) >> (6 - s->ss_v);
ff_thread_await_progress(ref_frame, FFMAX(th, 0), 0);
if (x < 3 || y < 3 || x + 4 >= w - refbw_m1 || y + 4 >= h - refbh_m1) {
s->vdsp.emulated_edge_mc(s->edge_emu_buffer,
ref_u - 3 * src_stride_u - 3 * bytesperpixel,
288, src_stride_u,
refbw_m1 + 8, refbh_m1 + 8,
x - 3, y - 3, w, h);
ref_u = s->edge_emu_buffer + 3 * 288 + 3 * bytesperpixel;
smc(dst_u, dst_stride, ref_u, 288, bh, mx, my, step[0], step[1]);
s->vdsp.emulated_edge_mc(s->edge_emu_buffer,
ref_v - 3 * src_stride_v - 3 * bytesperpixel,
288, src_stride_v,
refbw_m1 + 8, refbh_m1 + 8,
x - 3, y - 3, w, h);
ref_v = s->edge_emu_buffer + 3 * 288 + 3 * bytesperpixel;
smc(dst_v, dst_stride, ref_v, 288, bh, mx, my, step[0], step[1]);
} else {
smc(dst_u, dst_stride, ref_u, src_stride_u, bh, mx, my, step[0], step[1]);
smc(dst_v, dst_stride, ref_v, src_stride_v, bh, mx, my, step[0], step[1]);
}
}
}
#define mc_luma_dir(s, mc, dst, dst_ls, src, src_ls, tref, row, col, mv, \
px, py, pw, ph, bw, bh, w, h, i) \
mc_luma_scaled(s, s->dsp.s##mc, s->dsp.mc, dst, dst_ls, src, src_ls, tref, row, col, \
mv, px, py, pw, ph, bw, bh, w, h, bytesperpixel, \
s->mvscale[b->ref[i]], s->mvstep[b->ref[i]])
#define mc_chroma_dir(s, mc, dstu, dstv, dst_ls, srcu, srcu_ls, srcv, srcv_ls, tref, \
row, col, mv, px, py, pw, ph, bw, bh, w, h, i) \
mc_chroma_scaled(s, s->dsp.s##mc, s->dsp.mc, dstu, dstv, dst_ls, srcu, srcu_ls, srcv, srcv_ls, tref, \
row, col, mv, px, py, pw, ph, bw, bh, w, h, bytesperpixel, \
s->mvscale[b->ref[i]], s->mvstep[b->ref[i]])
#define SCALED 1
#define FN(x) x##_scaled_8bpp
#define BYTES_PER_PIXEL 1
#include "vp9_mc_template.c"
#undef FN
#undef BYTES_PER_PIXEL
#define FN(x) x##_scaled_16bpp
#define BYTES_PER_PIXEL 2
#include "vp9_mc_template.c"
#undef mc_luma_dir
#undef mc_chroma_dir
#undef FN
#undef BYTES_PER_PIXEL
#undef SCALED
static av_always_inline void inter_recon(AVCodecContext *ctx, int bytesperpixel)
{
VP9Context *s = ctx->priv_data;
VP9Block *b = s->b;
int row = s->row, col = s->col;
if (s->mvscale[b->ref[0]][0] || (b->comp && s->mvscale[b->ref[1]][0])) {
if (bytesperpixel == 1) {
inter_pred_scaled_8bpp(ctx);
} else {
inter_pred_scaled_16bpp(ctx);
}
} else {
if (bytesperpixel == 1) {
inter_pred_8bpp(ctx);
} else {
inter_pred_16bpp(ctx);
}
}
if (!b->skip) {
/* mostly copied intra_recon() */
int w4 = bwh_tab[1][b->bs][0] << 1, step1d = 1 << b->tx, n;
int h4 = bwh_tab[1][b->bs][1] << 1, x, y, step = 1 << (b->tx * 2);
int end_x = FFMIN(2 * (s->cols - col), w4);
int end_y = FFMIN(2 * (s->rows - row), h4);
int tx = 4 * s->s.h.lossless + b->tx, uvtx = b->uvtx + 4 * s->s.h.lossless;
int uvstep1d = 1 << b->uvtx, p;
uint8_t *dst = s->dst[0];
// y itxfm add
for (n = 0, y = 0; y < end_y; y += step1d) {
uint8_t *ptr = dst;
for (x = 0; x < end_x; x += step1d,
ptr += 4 * step1d * bytesperpixel, n += step) {
int eob = b->tx > TX_8X8 ? AV_RN16A(&s->eob[n]) : s->eob[n];
if (eob)
s->dsp.itxfm_add[tx][DCT_DCT](ptr, s->y_stride,
s->block + 16 * n * bytesperpixel, eob);
}
dst += 4 * s->y_stride * step1d;
}
// uv itxfm add
end_x >>= s->ss_h;
end_y >>= s->ss_v;
step = 1 << (b->uvtx * 2);
for (p = 0; p < 2; p++) {
dst = s->dst[p + 1];
for (n = 0, y = 0; y < end_y; y += uvstep1d) {
uint8_t *ptr = dst;
for (x = 0; x < end_x; x += uvstep1d,
ptr += 4 * uvstep1d * bytesperpixel, n += step) {
int eob = b->uvtx > TX_8X8 ? AV_RN16A(&s->uveob[p][n]) : s->uveob[p][n];
if (eob)
s->dsp.itxfm_add[uvtx][DCT_DCT](ptr, s->uv_stride,
s->uvblock[p] + 16 * n * bytesperpixel, eob);
}
dst += 4 * uvstep1d * s->uv_stride;
}
}
}
}
static void inter_recon_8bpp(AVCodecContext *ctx)
{
inter_recon(ctx, 1);
}
static void inter_recon_16bpp(AVCodecContext *ctx)
{
inter_recon(ctx, 2);
}
static av_always_inline void mask_edges(uint8_t (*mask)[8][4], int ss_h, int ss_v,
int row_and_7, int col_and_7,
int w, int h, int col_end, int row_end,
enum TxfmMode tx, int skip_inter)
{
static const unsigned wide_filter_col_mask[2] = { 0x11, 0x01 };
static const unsigned wide_filter_row_mask[2] = { 0x03, 0x07 };
// FIXME I'm pretty sure all loops can be replaced by a single LUT if
// we make VP9Filter.mask uint64_t (i.e. row/col all single variable)
// and make the LUT 5-indexed (bl, bp, is_uv, tx and row/col), and then
// use row_and_7/col_and_7 as shifts (1*col_and_7+8*row_and_7)
// the intended behaviour of the vp9 loopfilter is to work on 8-pixel
// edges. This means that for UV, we work on two subsampled blocks at
// a time, and we only use the topleft block's mode information to set
// things like block strength. Thus, for any block size smaller than
// 16x16, ignore the odd portion of the block.
if (tx == TX_4X4 && (ss_v | ss_h)) {
if (h == ss_v) {
if (row_and_7 & 1)
return;
if (!row_end)
h += 1;
}
if (w == ss_h) {
if (col_and_7 & 1)
return;
if (!col_end)
w += 1;
}
}
if (tx == TX_4X4 && !skip_inter) {
int t = 1 << col_and_7, m_col = (t << w) - t, y;
// on 32-px edges, use the 8-px wide loopfilter; else, use 4-px wide
int m_row_8 = m_col & wide_filter_col_mask[ss_h], m_row_4 = m_col - m_row_8;
for (y = row_and_7; y < h + row_and_7; y++) {
int col_mask_id = 2 - !(y & wide_filter_row_mask[ss_v]);
mask[0][y][1] |= m_row_8;
mask[0][y][2] |= m_row_4;
// for odd lines, if the odd col is not being filtered,
// skip odd row also:
// .---. <-- a
// | |
// |___| <-- b
// ^ ^
// c d
//
// if a/c are even row/col and b/d are odd, and d is skipped,
// e.g. right edge of size-66x66.webm, then skip b also (bug)
if ((ss_h & ss_v) && (col_end & 1) && (y & 1)) {
mask[1][y][col_mask_id] |= (t << (w - 1)) - t;
} else {
mask[1][y][col_mask_id] |= m_col;
}
if (!ss_h)
mask[0][y][3] |= m_col;
if (!ss_v) {
if (ss_h && (col_end & 1))
mask[1][y][3] |= (t << (w - 1)) - t;
else
mask[1][y][3] |= m_col;
}
}
} else {
int y, t = 1 << col_and_7, m_col = (t << w) - t;
if (!skip_inter) {
int mask_id = (tx == TX_8X8);
static const unsigned masks[4] = { 0xff, 0x55, 0x11, 0x01 };
int l2 = tx + ss_h - 1, step1d;
int m_row = m_col & masks[l2];
// at odd UV col/row edges tx16/tx32 loopfilter edges, force
// 8wd loopfilter to prevent going off the visible edge.
if (ss_h && tx > TX_8X8 && (w ^ (w - 1)) == 1) {
int m_row_16 = ((t << (w - 1)) - t) & masks[l2];
int m_row_8 = m_row - m_row_16;
for (y = row_and_7; y < h + row_and_7; y++) {
mask[0][y][0] |= m_row_16;
mask[0][y][1] |= m_row_8;
}
} else {
for (y = row_and_7; y < h + row_and_7; y++)
mask[0][y][mask_id] |= m_row;
}
l2 = tx + ss_v - 1;
step1d = 1 << l2;
if (ss_v && tx > TX_8X8 && (h ^ (h - 1)) == 1) {
for (y = row_and_7; y < h + row_and_7 - 1; y += step1d)
mask[1][y][0] |= m_col;
if (y - row_and_7 == h - 1)
mask[1][y][1] |= m_col;
} else {
for (y = row_and_7; y < h + row_and_7; y += step1d)
mask[1][y][mask_id] |= m_col;
}
} else if (tx != TX_4X4) {
int mask_id;
mask_id = (tx == TX_8X8) || (h == ss_v);
mask[1][row_and_7][mask_id] |= m_col;
mask_id = (tx == TX_8X8) || (w == ss_h);
for (y = row_and_7; y < h + row_and_7; y++)
mask[0][y][mask_id] |= t;
} else {
int t8 = t & wide_filter_col_mask[ss_h], t4 = t - t8;
for (y = row_and_7; y < h + row_and_7; y++) {
mask[0][y][2] |= t4;
mask[0][y][1] |= t8;
}
mask[1][row_and_7][2 - !(row_and_7 & wide_filter_row_mask[ss_v])] |= m_col;
}
}
}
static void decode_b(AVCodecContext *ctx, int row, int col,
struct VP9Filter *lflvl, ptrdiff_t yoff, ptrdiff_t uvoff,
enum BlockLevel bl, enum BlockPartition bp)
{
VP9Context *s = ctx->priv_data;
VP9Block *b = s->b;
enum BlockSize bs = bl * 3 + bp;
int bytesperpixel = s->bytesperpixel;
int w4 = bwh_tab[1][bs][0], h4 = bwh_tab[1][bs][1], lvl;
int emu[2];
AVFrame *f = s->s.frames[CUR_FRAME].tf.f;
s->row = row;
s->row7 = row & 7;
s->col = col;
s->col7 = col & 7;
s->min_mv.x = -(128 + col * 64);
s->min_mv.y = -(128 + row * 64);
s->max_mv.x = 128 + (s->cols - col - w4) * 64;
s->max_mv.y = 128 + (s->rows - row - h4) * 64;
if (s->pass < 2) {
b->bs = bs;
b->bl = bl;
b->bp = bp;
decode_mode(ctx);
b->uvtx = b->tx - ((s->ss_h && w4 * 2 == (1 << b->tx)) ||
(s->ss_v && h4 * 2 == (1 << b->tx)));
if (!b->skip) {
int has_coeffs;
if (bytesperpixel == 1) {
has_coeffs = decode_coeffs_8bpp(ctx);
} else {
has_coeffs = decode_coeffs_16bpp(ctx);
}
if (!has_coeffs && b->bs <= BS_8x8 && !b->intra) {
b->skip = 1;
memset(&s->above_skip_ctx[col], 1, w4);
memset(&s->left_skip_ctx[s->row7], 1, h4);
}
} else {
int row7 = s->row7;
#define SPLAT_ZERO_CTX(v, n) \
switch (n) { \
case 1: v = 0; break; \
case 2: AV_ZERO16(&v); break; \
case 4: AV_ZERO32(&v); break; \
case 8: AV_ZERO64(&v); break; \
case 16: AV_ZERO128(&v); break; \
}
#define SPLAT_ZERO_YUV(dir, var, off, n, dir2) \
do { \
SPLAT_ZERO_CTX(s->dir##_y_##var[off * 2], n * 2); \
if (s->ss_##dir2) { \
SPLAT_ZERO_CTX(s->dir##_uv_##var[0][off], n); \
SPLAT_ZERO_CTX(s->dir##_uv_##var[1][off], n); \
} else { \
SPLAT_ZERO_CTX(s->dir##_uv_##var[0][off * 2], n * 2); \
SPLAT_ZERO_CTX(s->dir##_uv_##var[1][off * 2], n * 2); \
} \
} while (0)
switch (w4) {
case 1: SPLAT_ZERO_YUV(above, nnz_ctx, col, 1, h); break;
case 2: SPLAT_ZERO_YUV(above, nnz_ctx, col, 2, h); break;
case 4: SPLAT_ZERO_YUV(above, nnz_ctx, col, 4, h); break;
case 8: SPLAT_ZERO_YUV(above, nnz_ctx, col, 8, h); break;
}
switch (h4) {
case 1: SPLAT_ZERO_YUV(left, nnz_ctx, row7, 1, v); break;
case 2: SPLAT_ZERO_YUV(left, nnz_ctx, row7, 2, v); break;
case 4: SPLAT_ZERO_YUV(left, nnz_ctx, row7, 4, v); break;
case 8: SPLAT_ZERO_YUV(left, nnz_ctx, row7, 8, v); break;
}
}
if (s->pass == 1) {
s->b++;
s->block += w4 * h4 * 64 * bytesperpixel;
s->uvblock[0] += w4 * h4 * 64 * bytesperpixel >> (s->ss_h + s->ss_v);
s->uvblock[1] += w4 * h4 * 64 * bytesperpixel >> (s->ss_h + s->ss_v);
s->eob += 4 * w4 * h4;
s->uveob[0] += 4 * w4 * h4 >> (s->ss_h + s->ss_v);
s->uveob[1] += 4 * w4 * h4 >> (s->ss_h + s->ss_v);
return;
}
}
// emulated overhangs if the stride of the target buffer can't hold. This
// makes it possible to support emu-edge and so on even if we have large block
// overhangs
emu[0] = (col + w4) * 8 * bytesperpixel > f->linesize[0] ||
(row + h4) > s->rows;
emu[1] = ((col + w4) * 8 >> s->ss_h) * bytesperpixel > f->linesize[1] ||
(row + h4) > s->rows;
if (emu[0]) {
s->dst[0] = s->tmp_y;
s->y_stride = 128;
} else {
s->dst[0] = f->data[0] + yoff;
s->y_stride = f->linesize[0];
}
if (emu[1]) {
s->dst[1] = s->tmp_uv[0];
s->dst[2] = s->tmp_uv[1];
s->uv_stride = 128;
} else {
s->dst[1] = f->data[1] + uvoff;
s->dst[2] = f->data[2] + uvoff;
s->uv_stride = f->linesize[1];
}
if (b->intra) {
if (s->bpp > 8) {
intra_recon_16bpp(ctx, yoff, uvoff);
} else {
intra_recon_8bpp(ctx, yoff, uvoff);
}
} else {
if (s->bpp > 8) {
inter_recon_16bpp(ctx);
} else {
inter_recon_8bpp(ctx);
}
}
if (emu[0]) {
int w = FFMIN(s->cols - col, w4) * 8, h = FFMIN(s->rows - row, h4) * 8, n, o = 0;
for (n = 0; o < w; n++) {
int bw = 64 >> n;
av_assert2(n <= 4);
if (w & bw) {
s->dsp.mc[n][0][0][0][0](f->data[0] + yoff + o * bytesperpixel, f->linesize[0],
s->tmp_y + o * bytesperpixel, 128, h, 0, 0);
o += bw;
}
}
}
if (emu[1]) {
int w = FFMIN(s->cols - col, w4) * 8 >> s->ss_h;
int h = FFMIN(s->rows - row, h4) * 8 >> s->ss_v, n, o = 0;
for (n = s->ss_h; o < w; n++) {
int bw = 64 >> n;
av_assert2(n <= 4);
if (w & bw) {
s->dsp.mc[n][0][0][0][0](f->data[1] + uvoff + o * bytesperpixel, f->linesize[1],
s->tmp_uv[0] + o * bytesperpixel, 128, h, 0, 0);
s->dsp.mc[n][0][0][0][0](f->data[2] + uvoff + o * bytesperpixel, f->linesize[2],
s->tmp_uv[1] + o * bytesperpixel, 128, h, 0, 0);
o += bw;
}
}
}
// pick filter level and find edges to apply filter to
if (s->s.h.filter.level &&
(lvl = s->s.h.segmentation.feat[b->seg_id].lflvl[b->intra ? 0 : b->ref[0] + 1]
[b->mode[3] != ZEROMV]) > 0) {
int x_end = FFMIN(s->cols - col, w4), y_end = FFMIN(s->rows - row, h4);
int skip_inter = !b->intra && b->skip, col7 = s->col7, row7 = s->row7;
setctx_2d(&lflvl->level[row7 * 8 + col7], w4, h4, 8, lvl);
mask_edges(lflvl->mask[0], 0, 0, row7, col7, x_end, y_end, 0, 0, b->tx, skip_inter);
if (s->ss_h || s->ss_v)
mask_edges(lflvl->mask[1], s->ss_h, s->ss_v, row7, col7, x_end, y_end,
s->cols & 1 && col + w4 >= s->cols ? s->cols & 7 : 0,
s->rows & 1 && row + h4 >= s->rows ? s->rows & 7 : 0,
b->uvtx, skip_inter);
if (!s->filter_lut.lim_lut[lvl]) {
int sharp = s->s.h.filter.sharpness;
int limit = lvl;
if (sharp > 0) {
limit >>= (sharp + 3) >> 2;
limit = FFMIN(limit, 9 - sharp);
}
limit = FFMAX(limit, 1);
s->filter_lut.lim_lut[lvl] = limit;
s->filter_lut.mblim_lut[lvl] = 2 * (lvl + 2) + limit;
}
}
if (s->pass == 2) {
s->b++;
s->block += w4 * h4 * 64 * bytesperpixel;
s->uvblock[0] += w4 * h4 * 64 * bytesperpixel >> (s->ss_v + s->ss_h);
s->uvblock[1] += w4 * h4 * 64 * bytesperpixel >> (s->ss_v + s->ss_h);
s->eob += 4 * w4 * h4;
s->uveob[0] += 4 * w4 * h4 >> (s->ss_v + s->ss_h);
s->uveob[1] += 4 * w4 * h4 >> (s->ss_v + s->ss_h);
}
}
static void decode_sb(AVCodecContext *ctx, int row, int col, struct VP9Filter *lflvl,
ptrdiff_t yoff, ptrdiff_t uvoff, enum BlockLevel bl)
{
VP9Context *s = ctx->priv_data;
int c = ((s->above_partition_ctx[col] >> (3 - bl)) & 1) |
(((s->left_partition_ctx[row & 0x7] >> (3 - bl)) & 1) << 1);
const uint8_t *p = s->s.h.keyframe || s->s.h.intraonly ? vp9_default_kf_partition_probs[bl][c] :
s->prob.p.partition[bl][c];
enum BlockPartition bp;
ptrdiff_t hbs = 4 >> bl;
AVFrame *f = s->s.frames[CUR_FRAME].tf.f;
ptrdiff_t y_stride = f->linesize[0], uv_stride = f->linesize[1];
int bytesperpixel = s->bytesperpixel;
if (bl == BL_8X8) {
bp = vp8_rac_get_tree(&s->c, vp9_partition_tree, p);
decode_b(ctx, row, col, lflvl, yoff, uvoff, bl, bp);
} else if (col + hbs < s->cols) { // FIXME why not <=?
if (row + hbs < s->rows) { // FIXME why not <=?
bp = vp8_rac_get_tree(&s->c, vp9_partition_tree, p);
switch (bp) {
case PARTITION_NONE:
decode_b(ctx, row, col, lflvl, yoff, uvoff, bl, bp);
break;
case PARTITION_H:
decode_b(ctx, row, col, lflvl, yoff, uvoff, bl, bp);
yoff += hbs * 8 * y_stride;
uvoff += hbs * 8 * uv_stride >> s->ss_v;
decode_b(ctx, row + hbs, col, lflvl, yoff, uvoff, bl, bp);
break;
case PARTITION_V:
decode_b(ctx, row, col, lflvl, yoff, uvoff, bl, bp);
yoff += hbs * 8 * bytesperpixel;
uvoff += hbs * 8 * bytesperpixel >> s->ss_h;
decode_b(ctx, row, col + hbs, lflvl, yoff, uvoff, bl, bp);
break;
case PARTITION_SPLIT:
decode_sb(ctx, row, col, lflvl, yoff, uvoff, bl + 1);
decode_sb(ctx, row, col + hbs, lflvl,
yoff + 8 * hbs * bytesperpixel,
uvoff + (8 * hbs * bytesperpixel >> s->ss_h), bl + 1);
yoff += hbs * 8 * y_stride;
uvoff += hbs * 8 * uv_stride >> s->ss_v;
decode_sb(ctx, row + hbs, col, lflvl, yoff, uvoff, bl + 1);
decode_sb(ctx, row + hbs, col + hbs, lflvl,
yoff + 8 * hbs * bytesperpixel,
uvoff + (8 * hbs * bytesperpixel >> s->ss_h), bl + 1);
break;
default:
av_assert0(0);
}
} else if (vp56_rac_get_prob_branchy(&s->c, p[1])) {
bp = PARTITION_SPLIT;
decode_sb(ctx, row, col, lflvl, yoff, uvoff, bl + 1);
decode_sb(ctx, row, col + hbs, lflvl,
yoff + 8 * hbs * bytesperpixel,
uvoff + (8 * hbs * bytesperpixel >> s->ss_h), bl + 1);
} else {
bp = PARTITION_H;
decode_b(ctx, row, col, lflvl, yoff, uvoff, bl, bp);
}
} else if (row + hbs < s->rows) { // FIXME why not <=?
if (vp56_rac_get_prob_branchy(&s->c, p[2])) {
bp = PARTITION_SPLIT;
decode_sb(ctx, row, col, lflvl, yoff, uvoff, bl + 1);
yoff += hbs * 8 * y_stride;
uvoff += hbs * 8 * uv_stride >> s->ss_v;
decode_sb(ctx, row + hbs, col, lflvl, yoff, uvoff, bl + 1);
} else {
bp = PARTITION_V;
decode_b(ctx, row, col, lflvl, yoff, uvoff, bl, bp);
}
} else {
bp = PARTITION_SPLIT;
decode_sb(ctx, row, col, lflvl, yoff, uvoff, bl + 1);
}
s->counts.partition[bl][c][bp]++;
}
static void decode_sb_mem(AVCodecContext *ctx, int row, int col, struct VP9Filter *lflvl,
ptrdiff_t yoff, ptrdiff_t uvoff, enum BlockLevel bl)
{
VP9Context *s = ctx->priv_data;
VP9Block *b = s->b;
ptrdiff_t hbs = 4 >> bl;
AVFrame *f = s->s.frames[CUR_FRAME].tf.f;
ptrdiff_t y_stride = f->linesize[0], uv_stride = f->linesize[1];
int bytesperpixel = s->bytesperpixel;
if (bl == BL_8X8) {
av_assert2(b->bl == BL_8X8);
decode_b(ctx, row, col, lflvl, yoff, uvoff, b->bl, b->bp);
} else if (s->b->bl == bl) {
decode_b(ctx, row, col, lflvl, yoff, uvoff, b->bl, b->bp);
if (b->bp == PARTITION_H && row + hbs < s->rows) {
yoff += hbs * 8 * y_stride;
uvoff += hbs * 8 * uv_stride >> s->ss_v;
decode_b(ctx, row + hbs, col, lflvl, yoff, uvoff, b->bl, b->bp);
} else if (b->bp == PARTITION_V && col + hbs < s->cols) {
yoff += hbs * 8 * bytesperpixel;
uvoff += hbs * 8 * bytesperpixel >> s->ss_h;
decode_b(ctx, row, col + hbs, lflvl, yoff, uvoff, b->bl, b->bp);
}
} else {
decode_sb_mem(ctx, row, col, lflvl, yoff, uvoff, bl + 1);
if (col + hbs < s->cols) { // FIXME why not <=?
if (row + hbs < s->rows) {
decode_sb_mem(ctx, row, col + hbs, lflvl, yoff + 8 * hbs * bytesperpixel,
uvoff + (8 * hbs * bytesperpixel >> s->ss_h), bl + 1);
yoff += hbs * 8 * y_stride;
uvoff += hbs * 8 * uv_stride >> s->ss_v;
decode_sb_mem(ctx, row + hbs, col, lflvl, yoff, uvoff, bl + 1);
decode_sb_mem(ctx, row + hbs, col + hbs, lflvl,
yoff + 8 * hbs * bytesperpixel,
uvoff + (8 * hbs * bytesperpixel >> s->ss_h), bl + 1);
} else {
yoff += hbs * 8 * bytesperpixel;
uvoff += hbs * 8 * bytesperpixel >> s->ss_h;
decode_sb_mem(ctx, row, col + hbs, lflvl, yoff, uvoff, bl + 1);
}
} else if (row + hbs < s->rows) {
yoff += hbs * 8 * y_stride;
uvoff += hbs * 8 * uv_stride >> s->ss_v;
decode_sb_mem(ctx, row + hbs, col, lflvl, yoff, uvoff, bl + 1);
}
}
}
static av_always_inline void filter_plane_cols(VP9Context *s, int col, int ss_h, int ss_v,
uint8_t *lvl, uint8_t (*mask)[4],
uint8_t *dst, ptrdiff_t ls)
{
int y, x, bytesperpixel = s->bytesperpixel;
// filter edges between columns (e.g. block1 | block2)
for (y = 0; y < 8; y += 2 << ss_v, dst += 16 * ls, lvl += 16 << ss_v) {
uint8_t *ptr = dst, *l = lvl, *hmask1 = mask[y], *hmask2 = mask[y + 1 + ss_v];
unsigned hm1 = hmask1[0] | hmask1[1] | hmask1[2], hm13 = hmask1[3];
unsigned hm2 = hmask2[1] | hmask2[2], hm23 = hmask2[3];
unsigned hm = hm1 | hm2 | hm13 | hm23;
for (x = 1; hm & ~(x - 1); x <<= 1, ptr += 8 * bytesperpixel >> ss_h) {
if (col || x > 1) {
if (hm1 & x) {
int L = *l, H = L >> 4;
int E = s->filter_lut.mblim_lut[L], I = s->filter_lut.lim_lut[L];
if (hmask1[0] & x) {
if (hmask2[0] & x) {
av_assert2(l[8 << ss_v] == L);
s->dsp.loop_filter_16[0](ptr, ls, E, I, H);
} else {
s->dsp.loop_filter_8[2][0](ptr, ls, E, I, H);
}
} else if (hm2 & x) {
L = l[8 << ss_v];
H |= (L >> 4) << 8;
E |= s->filter_lut.mblim_lut[L] << 8;
I |= s->filter_lut.lim_lut[L] << 8;
s->dsp.loop_filter_mix2[!!(hmask1[1] & x)]
[!!(hmask2[1] & x)]
[0](ptr, ls, E, I, H);
} else {
s->dsp.loop_filter_8[!!(hmask1[1] & x)]
[0](ptr, ls, E, I, H);
}
} else if (hm2 & x) {
int L = l[8 << ss_v], H = L >> 4;
int E = s->filter_lut.mblim_lut[L], I = s->filter_lut.lim_lut[L];
s->dsp.loop_filter_8[!!(hmask2[1] & x)]
[0](ptr + 8 * ls, ls, E, I, H);
}
}
if (ss_h) {
if (x & 0xAA)
l += 2;
} else {
if (hm13 & x) {
int L = *l, H = L >> 4;
int E = s->filter_lut.mblim_lut[L], I = s->filter_lut.lim_lut[L];
if (hm23 & x) {
L = l[8 << ss_v];
H |= (L >> 4) << 8;
E |= s->filter_lut.mblim_lut[L] << 8;
I |= s->filter_lut.lim_lut[L] << 8;
s->dsp.loop_filter_mix2[0][0][0](ptr + 4 * bytesperpixel, ls, E, I, H);
} else {
s->dsp.loop_filter_8[0][0](ptr + 4 * bytesperpixel, ls, E, I, H);
}
} else if (hm23 & x) {
int L = l[8 << ss_v], H = L >> 4;
int E = s->filter_lut.mblim_lut[L], I = s->filter_lut.lim_lut[L];
s->dsp.loop_filter_8[0][0](ptr + 8 * ls + 4 * bytesperpixel, ls, E, I, H);
}
l++;
}
}
}
}
static av_always_inline void filter_plane_rows(VP9Context *s, int row, int ss_h, int ss_v,
uint8_t *lvl, uint8_t (*mask)[4],
uint8_t *dst, ptrdiff_t ls)
{
int y, x, bytesperpixel = s->bytesperpixel;
// block1
// filter edges between rows (e.g. ------)
// block2
for (y = 0; y < 8; y++, dst += 8 * ls >> ss_v) {
uint8_t *ptr = dst, *l = lvl, *vmask = mask[y];
unsigned vm = vmask[0] | vmask[1] | vmask[2], vm3 = vmask[3];
for (x = 1; vm & ~(x - 1); x <<= (2 << ss_h), ptr += 16 * bytesperpixel, l += 2 << ss_h) {
if (row || y) {
if (vm & x) {
int L = *l, H = L >> 4;
int E = s->filter_lut.mblim_lut[L], I = s->filter_lut.lim_lut[L];
if (vmask[0] & x) {
if (vmask[0] & (x << (1 + ss_h))) {
av_assert2(l[1 + ss_h] == L);
s->dsp.loop_filter_16[1](ptr, ls, E, I, H);
} else {
s->dsp.loop_filter_8[2][1](ptr, ls, E, I, H);
}
} else if (vm & (x << (1 + ss_h))) {
L = l[1 + ss_h];
H |= (L >> 4) << 8;
E |= s->filter_lut.mblim_lut[L] << 8;
I |= s->filter_lut.lim_lut[L] << 8;
s->dsp.loop_filter_mix2[!!(vmask[1] & x)]
[!!(vmask[1] & (x << (1 + ss_h)))]
[1](ptr, ls, E, I, H);
} else {
s->dsp.loop_filter_8[!!(vmask[1] & x)]
[1](ptr, ls, E, I, H);
}
} else if (vm & (x << (1 + ss_h))) {
int L = l[1 + ss_h], H = L >> 4;
int E = s->filter_lut.mblim_lut[L], I = s->filter_lut.lim_lut[L];
s->dsp.loop_filter_8[!!(vmask[1] & (x << (1 + ss_h)))]
[1](ptr + 8 * bytesperpixel, ls, E, I, H);
}
}
if (!ss_v) {
if (vm3 & x) {
int L = *l, H = L >> 4;
int E = s->filter_lut.mblim_lut[L], I = s->filter_lut.lim_lut[L];
if (vm3 & (x << (1 + ss_h))) {
L = l[1 + ss_h];
H |= (L >> 4) << 8;
E |= s->filter_lut.mblim_lut[L] << 8;
I |= s->filter_lut.lim_lut[L] << 8;
s->dsp.loop_filter_mix2[0][0][1](ptr + ls * 4, ls, E, I, H);
} else {
s->dsp.loop_filter_8[0][1](ptr + ls * 4, ls, E, I, H);
}
} else if (vm3 & (x << (1 + ss_h))) {
int L = l[1 + ss_h], H = L >> 4;
int E = s->filter_lut.mblim_lut[L], I = s->filter_lut.lim_lut[L];
s->dsp.loop_filter_8[0][1](ptr + ls * 4 + 8 * bytesperpixel, ls, E, I, H);
}
}
}
if (ss_v) {
if (y & 1)
lvl += 16;
} else {
lvl += 8;
}
}
}
static void loopfilter_sb(AVCodecContext *ctx, struct VP9Filter *lflvl,
int row, int col, ptrdiff_t yoff, ptrdiff_t uvoff)
{
VP9Context *s = ctx->priv_data;
AVFrame *f = s->s.frames[CUR_FRAME].tf.f;
uint8_t *dst = f->data[0] + yoff;
ptrdiff_t ls_y = f->linesize[0], ls_uv = f->linesize[1];
uint8_t (*uv_masks)[8][4] = lflvl->mask[s->ss_h | s->ss_v];
int p;
// FIXME in how far can we interleave the v/h loopfilter calls? E.g.
// if you think of them as acting on a 8x8 block max, we can interleave
// each v/h within the single x loop, but that only works if we work on
// 8 pixel blocks, and we won't always do that (we want at least 16px
// to use SSE2 optimizations, perhaps 32 for AVX2)
filter_plane_cols(s, col, 0, 0, lflvl->level, lflvl->mask[0][0], dst, ls_y);
filter_plane_rows(s, row, 0, 0, lflvl->level, lflvl->mask[0][1], dst, ls_y);
for (p = 0; p < 2; p++) {
dst = f->data[1 + p] + uvoff;
filter_plane_cols(s, col, s->ss_h, s->ss_v, lflvl->level, uv_masks[0], dst, ls_uv);
filter_plane_rows(s, row, s->ss_h, s->ss_v, lflvl->level, uv_masks[1], dst, ls_uv);
}
}
static void set_tile_offset(int *start, int *end, int idx, int log2_n, int n)
{
int sb_start = ( idx * n) >> log2_n;
int sb_end = ((idx + 1) * n) >> log2_n;
*start = FFMIN(sb_start, n) << 3;
*end = FFMIN(sb_end, n) << 3;
}
static av_always_inline void adapt_prob(uint8_t *p, unsigned ct0, unsigned ct1,
int max_count, int update_factor)
{
unsigned ct = ct0 + ct1, p2, p1;
if (!ct)
return;
p1 = *p;
p2 = ((ct0 << 8) + (ct >> 1)) / ct;
p2 = av_clip(p2, 1, 255);
ct = FFMIN(ct, max_count);
update_factor = FASTDIV(update_factor * ct, max_count);
// (p1 * (256 - update_factor) + p2 * update_factor + 128) >> 8
*p = p1 + (((p2 - p1) * update_factor + 128) >> 8);
}
static void adapt_probs(VP9Context *s)
{
int i, j, k, l, m;
prob_context *p = &s->prob_ctx[s->s.h.framectxid].p;
int uf = (s->s.h.keyframe || s->s.h.intraonly || !s->last_keyframe) ? 112 : 128;
// coefficients
for (i = 0; i < 4; i++)
for (j = 0; j < 2; j++)
for (k = 0; k < 2; k++)
for (l = 0; l < 6; l++)
for (m = 0; m < 6; m++) {
uint8_t *pp = s->prob_ctx[s->s.h.framectxid].coef[i][j][k][l][m];
unsigned *e = s->counts.eob[i][j][k][l][m];
unsigned *c = s->counts.coef[i][j][k][l][m];
if (l == 0 && m >= 3) // dc only has 3 pt
break;
adapt_prob(&pp[0], e[0], e[1], 24, uf);
adapt_prob(&pp[1], c[0], c[1] + c[2], 24, uf);
adapt_prob(&pp[2], c[1], c[2], 24, uf);
}
if (s->s.h.keyframe || s->s.h.intraonly) {
memcpy(p->skip, s->prob.p.skip, sizeof(p->skip));
memcpy(p->tx32p, s->prob.p.tx32p, sizeof(p->tx32p));
memcpy(p->tx16p, s->prob.p.tx16p, sizeof(p->tx16p));
memcpy(p->tx8p, s->prob.p.tx8p, sizeof(p->tx8p));
return;
}
// skip flag
for (i = 0; i < 3; i++)
adapt_prob(&p->skip[i], s->counts.skip[i][0], s->counts.skip[i][1], 20, 128);
// intra/inter flag
for (i = 0; i < 4; i++)
adapt_prob(&p->intra[i], s->counts.intra[i][0], s->counts.intra[i][1], 20, 128);
// comppred flag
if (s->s.h.comppredmode == PRED_SWITCHABLE) {
for (i = 0; i < 5; i++)
adapt_prob(&p->comp[i], s->counts.comp[i][0], s->counts.comp[i][1], 20, 128);
}
// reference frames
if (s->s.h.comppredmode != PRED_SINGLEREF) {
for (i = 0; i < 5; i++)
adapt_prob(&p->comp_ref[i], s->counts.comp_ref[i][0],
s->counts.comp_ref[i][1], 20, 128);
}
if (s->s.h.comppredmode != PRED_COMPREF) {
for (i = 0; i < 5; i++) {
uint8_t *pp = p->single_ref[i];
unsigned (*c)[2] = s->counts.single_ref[i];
adapt_prob(&pp[0], c[0][0], c[0][1], 20, 128);
adapt_prob(&pp[1], c[1][0], c[1][1], 20, 128);
}
}
// block partitioning
for (i = 0; i < 4; i++)
for (j = 0; j < 4; j++) {
uint8_t *pp = p->partition[i][j];
unsigned *c = s->counts.partition[i][j];
adapt_prob(&pp[0], c[0], c[1] + c[2] + c[3], 20, 128);
adapt_prob(&pp[1], c[1], c[2] + c[3], 20, 128);
adapt_prob(&pp[2], c[2], c[3], 20, 128);
}
// tx size
if (s->s.h.txfmmode == TX_SWITCHABLE) {
for (i = 0; i < 2; i++) {
unsigned *c16 = s->counts.tx16p[i], *c32 = s->counts.tx32p[i];
adapt_prob(&p->tx8p[i], s->counts.tx8p[i][0], s->counts.tx8p[i][1], 20, 128);
adapt_prob(&p->tx16p[i][0], c16[0], c16[1] + c16[2], 20, 128);
adapt_prob(&p->tx16p[i][1], c16[1], c16[2], 20, 128);
adapt_prob(&p->tx32p[i][0], c32[0], c32[1] + c32[2] + c32[3], 20, 128);
adapt_prob(&p->tx32p[i][1], c32[1], c32[2] + c32[3], 20, 128);
adapt_prob(&p->tx32p[i][2], c32[2], c32[3], 20, 128);
}
}
// interpolation filter
if (s->s.h.filtermode == FILTER_SWITCHABLE) {
for (i = 0; i < 4; i++) {
uint8_t *pp = p->filter[i];
unsigned *c = s->counts.filter[i];
adapt_prob(&pp[0], c[0], c[1] + c[2], 20, 128);
adapt_prob(&pp[1], c[1], c[2], 20, 128);
}
}
// inter modes
for (i = 0; i < 7; i++) {
uint8_t *pp = p->mv_mode[i];
unsigned *c = s->counts.mv_mode[i];
adapt_prob(&pp[0], c[2], c[1] + c[0] + c[3], 20, 128);
adapt_prob(&pp[1], c[0], c[1] + c[3], 20, 128);
adapt_prob(&pp[2], c[1], c[3], 20, 128);
}
// mv joints
{
uint8_t *pp = p->mv_joint;
unsigned *c = s->counts.mv_joint;
adapt_prob(&pp[0], c[0], c[1] + c[2] + c[3], 20, 128);
adapt_prob(&pp[1], c[1], c[2] + c[3], 20, 128);
adapt_prob(&pp[2], c[2], c[3], 20, 128);
}
// mv components
for (i = 0; i < 2; i++) {
uint8_t *pp;
unsigned *c, (*c2)[2], sum;
adapt_prob(&p->mv_comp[i].sign, s->counts.mv_comp[i].sign[0],
s->counts.mv_comp[i].sign[1], 20, 128);
pp = p->mv_comp[i].classes;
c = s->counts.mv_comp[i].classes;
sum = c[1] + c[2] + c[3] + c[4] + c[5] + c[6] + c[7] + c[8] + c[9] + c[10];
adapt_prob(&pp[0], c[0], sum, 20, 128);
sum -= c[1];
adapt_prob(&pp[1], c[1], sum, 20, 128);
sum -= c[2] + c[3];
adapt_prob(&pp[2], c[2] + c[3], sum, 20, 128);
adapt_prob(&pp[3], c[2], c[3], 20, 128);
sum -= c[4] + c[5];
adapt_prob(&pp[4], c[4] + c[5], sum, 20, 128);
adapt_prob(&pp[5], c[4], c[5], 20, 128);
sum -= c[6];
adapt_prob(&pp[6], c[6], sum, 20, 128);
adapt_prob(&pp[7], c[7] + c[8], c[9] + c[10], 20, 128);
adapt_prob(&pp[8], c[7], c[8], 20, 128);
adapt_prob(&pp[9], c[9], c[10], 20, 128);
adapt_prob(&p->mv_comp[i].class0, s->counts.mv_comp[i].class0[0],
s->counts.mv_comp[i].class0[1], 20, 128);
pp = p->mv_comp[i].bits;
c2 = s->counts.mv_comp[i].bits;
for (j = 0; j < 10; j++)
adapt_prob(&pp[j], c2[j][0], c2[j][1], 20, 128);
for (j = 0; j < 2; j++) {
pp = p->mv_comp[i].class0_fp[j];
c = s->counts.mv_comp[i].class0_fp[j];
adapt_prob(&pp[0], c[0], c[1] + c[2] + c[3], 20, 128);
adapt_prob(&pp[1], c[1], c[2] + c[3], 20, 128);
adapt_prob(&pp[2], c[2], c[3], 20, 128);
}
pp = p->mv_comp[i].fp;
c = s->counts.mv_comp[i].fp;
adapt_prob(&pp[0], c[0], c[1] + c[2] + c[3], 20, 128);
adapt_prob(&pp[1], c[1], c[2] + c[3], 20, 128);
adapt_prob(&pp[2], c[2], c[3], 20, 128);
if (s->s.h.highprecisionmvs) {
adapt_prob(&p->mv_comp[i].class0_hp, s->counts.mv_comp[i].class0_hp[0],
s->counts.mv_comp[i].class0_hp[1], 20, 128);
adapt_prob(&p->mv_comp[i].hp, s->counts.mv_comp[i].hp[0],
s->counts.mv_comp[i].hp[1], 20, 128);
}
}
// y intra modes
for (i = 0; i < 4; i++) {
uint8_t *pp = p->y_mode[i];
unsigned *c = s->counts.y_mode[i], sum, s2;
sum = c[0] + c[1] + c[3] + c[4] + c[5] + c[6] + c[7] + c[8] + c[9];
adapt_prob(&pp[0], c[DC_PRED], sum, 20, 128);
sum -= c[TM_VP8_PRED];
adapt_prob(&pp[1], c[TM_VP8_PRED], sum, 20, 128);
sum -= c[VERT_PRED];
adapt_prob(&pp[2], c[VERT_PRED], sum, 20, 128);
s2 = c[HOR_PRED] + c[DIAG_DOWN_RIGHT_PRED] + c[VERT_RIGHT_PRED];
sum -= s2;
adapt_prob(&pp[3], s2, sum, 20, 128);
s2 -= c[HOR_PRED];
adapt_prob(&pp[4], c[HOR_PRED], s2, 20, 128);
adapt_prob(&pp[5], c[DIAG_DOWN_RIGHT_PRED], c[VERT_RIGHT_PRED], 20, 128);
sum -= c[DIAG_DOWN_LEFT_PRED];
adapt_prob(&pp[6], c[DIAG_DOWN_LEFT_PRED], sum, 20, 128);
sum -= c[VERT_LEFT_PRED];
adapt_prob(&pp[7], c[VERT_LEFT_PRED], sum, 20, 128);
adapt_prob(&pp[8], c[HOR_DOWN_PRED], c[HOR_UP_PRED], 20, 128);
}
// uv intra modes
for (i = 0; i < 10; i++) {
uint8_t *pp = p->uv_mode[i];
unsigned *c = s->counts.uv_mode[i], sum, s2;
sum = c[0] + c[1] + c[3] + c[4] + c[5] + c[6] + c[7] + c[8] + c[9];
adapt_prob(&pp[0], c[DC_PRED], sum, 20, 128);
sum -= c[TM_VP8_PRED];
adapt_prob(&pp[1], c[TM_VP8_PRED], sum, 20, 128);
sum -= c[VERT_PRED];
adapt_prob(&pp[2], c[VERT_PRED], sum, 20, 128);
s2 = c[HOR_PRED] + c[DIAG_DOWN_RIGHT_PRED] + c[VERT_RIGHT_PRED];
sum -= s2;
adapt_prob(&pp[3], s2, sum, 20, 128);
s2 -= c[HOR_PRED];
adapt_prob(&pp[4], c[HOR_PRED], s2, 20, 128);
adapt_prob(&pp[5], c[DIAG_DOWN_RIGHT_PRED], c[VERT_RIGHT_PRED], 20, 128);
sum -= c[DIAG_DOWN_LEFT_PRED];
adapt_prob(&pp[6], c[DIAG_DOWN_LEFT_PRED], sum, 20, 128);
sum -= c[VERT_LEFT_PRED];
adapt_prob(&pp[7], c[VERT_LEFT_PRED], sum, 20, 128);
adapt_prob(&pp[8], c[HOR_DOWN_PRED], c[HOR_UP_PRED], 20, 128);
}
}
static void free_buffers(VP9Context *s)
{
av_freep(&s->intra_pred_data[0]);
av_freep(&s->b_base);
av_freep(&s->block_base);
}
static av_cold int vp9_decode_free(AVCodecContext *ctx)
{
VP9Context *s = ctx->priv_data;
int i;
for (i = 0; i < 3; i++) {
if (s->s.frames[i].tf.f->buf[0])
vp9_unref_frame(ctx, &s->s.frames[i]);
av_frame_free(&s->s.frames[i].tf.f);
}
for (i = 0; i < 8; i++) {
if (s->s.refs[i].f->buf[0])
ff_thread_release_buffer(ctx, &s->s.refs[i]);
av_frame_free(&s->s.refs[i].f);
if (s->next_refs[i].f->buf[0])
ff_thread_release_buffer(ctx, &s->next_refs[i]);
av_frame_free(&s->next_refs[i].f);
}
free_buffers(s);
av_freep(&s->c_b);
s->c_b_size = 0;
return 0;
}
static int vp9_decode_frame(AVCodecContext *ctx, void *frame,
int *got_frame, AVPacket *pkt)
{
const uint8_t *data = pkt->data;
int size = pkt->size;
VP9Context *s = ctx->priv_data;
int res, tile_row, tile_col, i, ref, row, col;
int retain_segmap_ref = s->s.frames[REF_FRAME_SEGMAP].segmentation_map &&
(!s->s.h.segmentation.enabled || !s->s.h.segmentation.update_map);
ptrdiff_t yoff, uvoff, ls_y, ls_uv;
AVFrame *f;
int bytesperpixel;
if ((res = decode_frame_header(ctx, data, size, &ref)) < 0) {
return res;
} else if (res == 0) {
if (!s->s.refs[ref].f->buf[0]) {
av_log(ctx, AV_LOG_ERROR, "Requested reference %d not available\n", ref);
return AVERROR_INVALIDDATA;
}
if ((res = av_frame_ref(frame, s->s.refs[ref].f)) < 0)
return res;
((AVFrame *)frame)->pkt_pts = pkt->pts;
((AVFrame *)frame)->pkt_dts = pkt->dts;
for (i = 0; i < 8; i++) {
if (s->next_refs[i].f->buf[0])
ff_thread_release_buffer(ctx, &s->next_refs[i]);
if (s->s.refs[i].f->buf[0] &&
(res = ff_thread_ref_frame(&s->next_refs[i], &s->s.refs[i])) < 0)
return res;
}
*got_frame = 1;
return pkt->size;
}
data += res;
size -= res;
if (!retain_segmap_ref || s->s.h.keyframe || s->s.h.intraonly) {
if (s->s.frames[REF_FRAME_SEGMAP].tf.f->buf[0])
vp9_unref_frame(ctx, &s->s.frames[REF_FRAME_SEGMAP]);
if (!s->s.h.keyframe && !s->s.h.intraonly && !s->s.h.errorres && s->s.frames[CUR_FRAME].tf.f->buf[0] &&
(res = vp9_ref_frame(ctx, &s->s.frames[REF_FRAME_SEGMAP], &s->s.frames[CUR_FRAME])) < 0)
return res;
}
if (s->s.frames[REF_FRAME_MVPAIR].tf.f->buf[0])
vp9_unref_frame(ctx, &s->s.frames[REF_FRAME_MVPAIR]);
if (!s->s.h.intraonly && !s->s.h.keyframe && !s->s.h.errorres && s->s.frames[CUR_FRAME].tf.f->buf[0] &&
(res = vp9_ref_frame(ctx, &s->s.frames[REF_FRAME_MVPAIR], &s->s.frames[CUR_FRAME])) < 0)
return res;
if (s->s.frames[CUR_FRAME].tf.f->buf[0])
vp9_unref_frame(ctx, &s->s.frames[CUR_FRAME]);
if ((res = vp9_alloc_frame(ctx, &s->s.frames[CUR_FRAME])) < 0)
return res;
f = s->s.frames[CUR_FRAME].tf.f;
f->key_frame = s->s.h.keyframe;
f->pict_type = (s->s.h.keyframe || s->s.h.intraonly) ? AV_PICTURE_TYPE_I : AV_PICTURE_TYPE_P;
ls_y = f->linesize[0];
ls_uv =f->linesize[1];
if (s->s.frames[REF_FRAME_SEGMAP].tf.f->buf[0] &&
(s->s.frames[REF_FRAME_MVPAIR].tf.f->width != s->s.frames[CUR_FRAME].tf.f->width ||
s->s.frames[REF_FRAME_MVPAIR].tf.f->height != s->s.frames[CUR_FRAME].tf.f->height)) {
vp9_unref_frame(ctx, &s->s.frames[REF_FRAME_SEGMAP]);
}
// ref frame setup
for (i = 0; i < 8; i++) {
if (s->next_refs[i].f->buf[0])
ff_thread_release_buffer(ctx, &s->next_refs[i]);
if (s->s.h.refreshrefmask & (1 << i)) {
res = ff_thread_ref_frame(&s->next_refs[i], &s->s.frames[CUR_FRAME].tf);
} else if (s->s.refs[i].f->buf[0]) {
res = ff_thread_ref_frame(&s->next_refs[i], &s->s.refs[i]);
}
if (res < 0)
return res;
}
if (ctx->hwaccel) {
res = ctx->hwaccel->start_frame(ctx, NULL, 0);
if (res < 0)
return res;
res = ctx->hwaccel->decode_slice(ctx, pkt->data, pkt->size);
if (res < 0)
return res;
res = ctx->hwaccel->end_frame(ctx);
if (res < 0)
return res;
goto finish;
}
// main tile decode loop
bytesperpixel = s->bytesperpixel;
memset(s->above_partition_ctx, 0, s->cols);
memset(s->above_skip_ctx, 0, s->cols);
if (s->s.h.keyframe || s->s.h.intraonly) {
memset(s->above_mode_ctx, DC_PRED, s->cols * 2);
} else {
memset(s->above_mode_ctx, NEARESTMV, s->cols);
}
memset(s->above_y_nnz_ctx, 0, s->sb_cols * 16);
memset(s->above_uv_nnz_ctx[0], 0, s->sb_cols * 16 >> s->ss_h);
memset(s->above_uv_nnz_ctx[1], 0, s->sb_cols * 16 >> s->ss_h);
memset(s->above_segpred_ctx, 0, s->cols);
s->pass = s->s.frames[CUR_FRAME].uses_2pass =
ctx->active_thread_type == FF_THREAD_FRAME && s->s.h.refreshctx && !s->s.h.parallelmode;
if ((res = update_block_buffers(ctx)) < 0) {
av_log(ctx, AV_LOG_ERROR,
"Failed to allocate block buffers\n");
return res;
}
if (s->s.h.refreshctx && s->s.h.parallelmode) {
int j, k, l, m;
for (i = 0; i < 4; i++) {
for (j = 0; j < 2; j++)
for (k = 0; k < 2; k++)
for (l = 0; l < 6; l++)
for (m = 0; m < 6; m++)
memcpy(s->prob_ctx[s->s.h.framectxid].coef[i][j][k][l][m],
s->prob.coef[i][j][k][l][m], 3);
if (s->s.h.txfmmode == i)
break;
}
s->prob_ctx[s->s.h.framectxid].p = s->prob.p;
ff_thread_finish_setup(ctx);
} else if (!s->s.h.refreshctx) {
ff_thread_finish_setup(ctx);
}
do {
yoff = uvoff = 0;
s->b = s->b_base;
s->block = s->block_base;
s->uvblock[0] = s->uvblock_base[0];
s->uvblock[1] = s->uvblock_base[1];
s->eob = s->eob_base;
s->uveob[0] = s->uveob_base[0];
s->uveob[1] = s->uveob_base[1];
for (tile_row = 0; tile_row < s->s.h.tiling.tile_rows; tile_row++) {
set_tile_offset(&s->tile_row_start, &s->tile_row_end,
tile_row, s->s.h.tiling.log2_tile_rows, s->sb_rows);
if (s->pass != 2) {
for (tile_col = 0; tile_col < s->s.h.tiling.tile_cols; tile_col++) {
int64_t tile_size;
if (tile_col == s->s.h.tiling.tile_cols - 1 &&
tile_row == s->s.h.tiling.tile_rows - 1) {
tile_size = size;
} else {
tile_size = AV_RB32(data);
data += 4;
size -= 4;
}
if (tile_size > size) {
ff_thread_report_progress(&s->s.frames[CUR_FRAME].tf, INT_MAX, 0);
return AVERROR_INVALIDDATA;
}
ff_vp56_init_range_decoder(&s->c_b[tile_col], data, tile_size);
if (vp56_rac_get_prob_branchy(&s->c_b[tile_col], 128)) { // marker bit
ff_thread_report_progress(&s->s.frames[CUR_FRAME].tf, INT_MAX, 0);
return AVERROR_INVALIDDATA;
}
data += tile_size;
size -= tile_size;
}
}
for (row = s->tile_row_start; row < s->tile_row_end;
row += 8, yoff += ls_y * 64, uvoff += ls_uv * 64 >> s->ss_v) {
struct VP9Filter *lflvl_ptr = s->lflvl;
ptrdiff_t yoff2 = yoff, uvoff2 = uvoff;
for (tile_col = 0; tile_col < s->s.h.tiling.tile_cols; tile_col++) {
set_tile_offset(&s->tile_col_start, &s->tile_col_end,
tile_col, s->s.h.tiling.log2_tile_cols, s->sb_cols);
if (s->pass != 2) {
memset(s->left_partition_ctx, 0, 8);
memset(s->left_skip_ctx, 0, 8);
if (s->s.h.keyframe || s->s.h.intraonly) {
memset(s->left_mode_ctx, DC_PRED, 16);
} else {
memset(s->left_mode_ctx, NEARESTMV, 8);
}
memset(s->left_y_nnz_ctx, 0, 16);
memset(s->left_uv_nnz_ctx, 0, 32);
memset(s->left_segpred_ctx, 0, 8);
memcpy(&s->c, &s->c_b[tile_col], sizeof(s->c));
}
for (col = s->tile_col_start;
col < s->tile_col_end;
col += 8, yoff2 += 64 * bytesperpixel,
uvoff2 += 64 * bytesperpixel >> s->ss_h, lflvl_ptr++) {
// FIXME integrate with lf code (i.e. zero after each
// use, similar to invtxfm coefficients, or similar)
if (s->pass != 1) {
memset(lflvl_ptr->mask, 0, sizeof(lflvl_ptr->mask));
}
if (s->pass == 2) {
decode_sb_mem(ctx, row, col, lflvl_ptr,
yoff2, uvoff2, BL_64X64);
} else {
decode_sb(ctx, row, col, lflvl_ptr,
yoff2, uvoff2, BL_64X64);
}
}
if (s->pass != 2) {
memcpy(&s->c_b[tile_col], &s->c, sizeof(s->c));
}
}
if (s->pass == 1) {
continue;
}
// backup pre-loopfilter reconstruction data for intra
// prediction of next row of sb64s
if (row + 8 < s->rows) {
memcpy(s->intra_pred_data[0],
f->data[0] + yoff + 63 * ls_y,
8 * s->cols * bytesperpixel);
memcpy(s->intra_pred_data[1],
f->data[1] + uvoff + ((64 >> s->ss_v) - 1) * ls_uv,
8 * s->cols * bytesperpixel >> s->ss_h);
memcpy(s->intra_pred_data[2],
f->data[2] + uvoff + ((64 >> s->ss_v) - 1) * ls_uv,
8 * s->cols * bytesperpixel >> s->ss_h);
}
// loopfilter one row
if (s->s.h.filter.level) {
yoff2 = yoff;
uvoff2 = uvoff;
lflvl_ptr = s->lflvl;
for (col = 0; col < s->cols;
col += 8, yoff2 += 64 * bytesperpixel,
uvoff2 += 64 * bytesperpixel >> s->ss_h, lflvl_ptr++) {
loopfilter_sb(ctx, lflvl_ptr, row, col, yoff2, uvoff2);
}
}
// FIXME maybe we can make this more finegrained by running the
// loopfilter per-block instead of after each sbrow
// In fact that would also make intra pred left preparation easier?
ff_thread_report_progress(&s->s.frames[CUR_FRAME].tf, row >> 3, 0);
}
}
if (s->pass < 2 && s->s.h.refreshctx && !s->s.h.parallelmode) {
adapt_probs(s);
ff_thread_finish_setup(ctx);
}
} while (s->pass++ == 1);
ff_thread_report_progress(&s->s.frames[CUR_FRAME].tf, INT_MAX, 0);
finish:
// ref frame setup
for (i = 0; i < 8; i++) {
if (s->s.refs[i].f->buf[0])
ff_thread_release_buffer(ctx, &s->s.refs[i]);
if (s->next_refs[i].f->buf[0] &&
(res = ff_thread_ref_frame(&s->s.refs[i], &s->next_refs[i])) < 0)
return res;
}
if (!s->s.h.invisible) {
if ((res = av_frame_ref(frame, s->s.frames[CUR_FRAME].tf.f)) < 0)
return res;
*got_frame = 1;
}
return pkt->size;
}
static void vp9_decode_flush(AVCodecContext *ctx)
{
VP9Context *s = ctx->priv_data;
int i;
for (i = 0; i < 3; i++)
vp9_unref_frame(ctx, &s->s.frames[i]);
for (i = 0; i < 8; i++)
ff_thread_release_buffer(ctx, &s->s.refs[i]);
}
static int init_frames(AVCodecContext *ctx)
{
VP9Context *s = ctx->priv_data;
int i;
for (i = 0; i < 3; i++) {
s->s.frames[i].tf.f = av_frame_alloc();
if (!s->s.frames[i].tf.f) {
vp9_decode_free(ctx);
av_log(ctx, AV_LOG_ERROR, "Failed to allocate frame buffer %d\n", i);
return AVERROR(ENOMEM);
}
}
for (i = 0; i < 8; i++) {
s->s.refs[i].f = av_frame_alloc();
s->next_refs[i].f = av_frame_alloc();
if (!s->s.refs[i].f || !s->next_refs[i].f) {
vp9_decode_free(ctx);
av_log(ctx, AV_LOG_ERROR, "Failed to allocate frame buffer %d\n", i);
return AVERROR(ENOMEM);
}
}
return 0;
}
static av_cold int vp9_decode_init(AVCodecContext *ctx)
{
VP9Context *s = ctx->priv_data;
ctx->internal->allocate_progress = 1;
s->last_bpp = 0;
s->s.h.filter.sharpness = -1;
return init_frames(ctx);
}
#if HAVE_THREADS
static av_cold int vp9_decode_init_thread_copy(AVCodecContext *avctx)
{
return init_frames(avctx);
}
static int vp9_decode_update_thread_context(AVCodecContext *dst, const AVCodecContext *src)
{
int i, res;
VP9Context *s = dst->priv_data, *ssrc = src->priv_data;
// detect size changes in other threads
if (s->intra_pred_data[0] &&
(!ssrc->intra_pred_data[0] || s->cols != ssrc->cols ||
s->rows != ssrc->rows || s->bpp != ssrc->bpp || s->pix_fmt != ssrc->pix_fmt)) {
free_buffers(s);
}
for (i = 0; i < 3; i++) {
if (s->s.frames[i].tf.f->buf[0])
vp9_unref_frame(dst, &s->s.frames[i]);
if (ssrc->s.frames[i].tf.f->buf[0]) {
if ((res = vp9_ref_frame(dst, &s->s.frames[i], &ssrc->s.frames[i])) < 0)
return res;
}
}
for (i = 0; i < 8; i++) {
if (s->s.refs[i].f->buf[0])
ff_thread_release_buffer(dst, &s->s.refs[i]);
if (ssrc->next_refs[i].f->buf[0]) {
if ((res = ff_thread_ref_frame(&s->s.refs[i], &ssrc->next_refs[i])) < 0)
return res;
}
}
s->s.h.invisible = ssrc->s.h.invisible;
s->s.h.keyframe = ssrc->s.h.keyframe;
s->s.h.intraonly = ssrc->s.h.intraonly;
s->ss_v = ssrc->ss_v;
s->ss_h = ssrc->ss_h;
s->s.h.segmentation.enabled = ssrc->s.h.segmentation.enabled;
s->s.h.segmentation.update_map = ssrc->s.h.segmentation.update_map;
s->s.h.segmentation.absolute_vals = ssrc->s.h.segmentation.absolute_vals;
s->bytesperpixel = ssrc->bytesperpixel;
s->bpp = ssrc->bpp;
s->bpp_index = ssrc->bpp_index;
s->pix_fmt = ssrc->pix_fmt;
memcpy(&s->prob_ctx, &ssrc->prob_ctx, sizeof(s->prob_ctx));
memcpy(&s->s.h.lf_delta, &ssrc->s.h.lf_delta, sizeof(s->s.h.lf_delta));
memcpy(&s->s.h.segmentation.feat, &ssrc->s.h.segmentation.feat,
sizeof(s->s.h.segmentation.feat));
return 0;
}
#endif
AVCodec ff_vp9_decoder = {
.name = "vp9",
.long_name = NULL_IF_CONFIG_SMALL("Google VP9"),
.type = AVMEDIA_TYPE_VIDEO,
.id = AV_CODEC_ID_VP9,
.priv_data_size = sizeof(VP9Context),
.init = vp9_decode_init,
.close = vp9_decode_free,
.decode = vp9_decode_frame,
.capabilities = AV_CODEC_CAP_DR1 | AV_CODEC_CAP_FRAME_THREADS,
.flush = vp9_decode_flush,
.init_thread_copy = ONLY_IF_THREADS_ENABLED(vp9_decode_init_thread_copy),
.update_thread_context = ONLY_IF_THREADS_ENABLED(vp9_decode_update_thread_context),
.profiles = NULL_IF_CONFIG_SMALL(ff_vp9_profiles),
};
``` |
```objective-c
/*
*
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* * Neither the name of the <organization> nor the
* names of its contributors may be used to endorse or promote products
* derived from this software without specific prior written permission.
* * The WHITECAT logotype cannot be changed, you can remove it, but you
* cannot change it in any way. The WHITECAT logotype is:
*
* /\ /\
* / \_____/ \
* /_____________\
* W H I T E C A T
*
* * Redistributions in binary form must retain all copyright notices printed
* to any local or remote output device. This include any reference to
* Lua RTOS, whitecatboard.org, Lua, and other copyright notices that may
* appear in the future.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> 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.
*
* Lua RTOS, ADC driver
*
*/
#ifndef ADC_H
#define ADC_H
#include <stdint.h>
#include "driver/adc.h"
#include "esp_adc_cal.h"
#include <drivers/cpu.h>
#include <sys/driver.h>
// Channel handler
typedef uint32_t *adc_channel_h_t;
// ADC channel
typedef struct {
uint8_t unit; ///< ADC unit
uint8_t channel; ///< Channel number
int devid; ///< Device id
uint8_t setup; ///< Channel is setup?
uint8_t resolution; ///< Current resolution
uint16_t max_val; ///< Max value, depends on resolution
int16_t vref; ///< VREF voltage attached in mvolts
int16_t max; ///< Max voltage attached in mvolts
esp_adc_cal_characteristics_t *chars;
} adc_chann_t;
// Adc devices
typedef struct {
const char *name;
driver_error_t *(*setup)(adc_chann_t *);
driver_error_t *(*read)(adc_chann_t *, int *, double *);
} adc_dev_t;
// ADC errors
#define ADC_ERR_INVALID_UNIT (DRIVER_EXCEPTION_BASE(ADC_DRIVER_ID) | 0)
#define ADC_ERR_INVALID_CHANNEL (DRIVER_EXCEPTION_BASE(ADC_DRIVER_ID) | 1)
#define ADC_ERR_INVALID_RESOLUTION (DRIVER_EXCEPTION_BASE(ADC_DRIVER_ID) | 2)
#define ADC_ERR_NOT_ENOUGH_MEMORY (DRIVER_EXCEPTION_BASE(ADC_DRIVER_ID) | 3)
#define ADC_ERR_INVALID_PIN (DRIVER_EXCEPTION_BASE(ADC_DRIVER_ID) | 4)
#define ADC_ERR_MAX_SET_NOT_ALLOWED (DRIVER_EXCEPTION_BASE(ADC_DRIVER_ID) | 5)
#define ADC_ERR_VREF_SET_NOT_ALLOWED (DRIVER_EXCEPTION_BASE(ADC_DRIVER_ID) | 6)
#define ADC_ERR_INVALID_MAX (DRIVER_EXCEPTION_BASE(ADC_DRIVER_ID) | 7)
#define ADC_ERR_CANNOT_CALIBRATE (DRIVER_EXCEPTION_BASE(ADC_DRIVER_ID) | 8)
#define ADC_ERR_CALIBRATION (DRIVER_EXCEPTION_BASE(ADC_DRIVER_ID) | 9)
extern const int adc_errors;
extern const int adc_error_map;
/**
* @brief Setup an adc channel.
*
* @param unit ADC unit identifier.
* @param channel ADC channel number of the ADC unit.
* @param devid Device id. This is used for SIP & I2C external ADC devices for identify the device in
* the bus. For example in SPI devid contains the CS GPIO, and in I2C contains the device
* address.
* @param vref Voltage reference in mVolts. 0 = default.
* @param max Max voltage attached to ADC channel in mVolts. 0 = default.
* @param resolution Bits of resolution.
* @param h A pointer to the channel handler. This handler is used later for refer to the channel.
*
* @return
* - NULL success
* - Pointer to driver_error_t if some error occurs. Error can be an operation error or a lock error.
*/
driver_error_t *adc_setup(int8_t unit, int8_t channel, int16_t devid, int16_t vref, int16_t max, uint8_t resolution, adc_channel_h_t *h);
/**
* @brief Read from an adc channel.
*
* @param h A pointer to a channel handler.
* @param raw A pointer to an int variable that holds the raw value from the ADC.
* @param mvolts A pointer to a double variable that holds the raw value from the ADC converted to mVolts.
*
* @return
* - NULL success
* - Pointer to driver_error_t if some error occurs. Error can be an operation error or a lock error.
*/
driver_error_t *adc_read(adc_channel_h_t *h, int *raw, double *mvols);
/**
* @brief Read from an adc channel taking some samples and doing the average.
*
* @param h A pointer to a channel handler.
* @param samples Number of samples.
* @param raw A pointer to a double variable that holds the average raw value from the ADC.
* @param mvolts A pointer to a double variable that holds the average raw value from the ADC converted to mVolts.
*
* @return
* - NULL success
* - Pointer to driver_error_t if some error occurs. Error can be an operation error or a lock error.
*/
driver_error_t *adc_read_avg(adc_channel_h_t *h, int samples, double *avgr, double *avgm);
/**
* @brief Get the ADC channel from a channel handler.
*
* @param h A pointer to a channel handler.
* @param chan A pointer to the channel.
*
* @return
* - NULL success
* - Pointer to driver_error_t if some error occurs. Error can be an operation error or a lock error.
*/
driver_error_t *adc_get_channel(adc_channel_h_t *h, adc_chann_t **chan);
#endif /* ADC_H */
``` |
Leucopogon tamariscinus is a species of flowering plant in the heath family Ericaceae and is endemic to the south of Western Australia. It is an erect shrub with egg-shaped or lance-shaped leaves and white, tube-shaped flowers arranged in dense spikes on the ends of branches.
Description
Leucopogon tamariscinus is an erect, sparsely-branched shrub that typically grows to high and has wand-like branches. The leaves are egg-shaped or lance-shaped, long, and almost stem-clasping. The flowers are borne on the ends of branches in many-flowered, cylindrical spikes long. There are small, leaf-like bracts and broad bracteoles less than half as long as the sepals. The sepals are less than long, and the petals are white, long and joined at the base forming a tube with lobes about the same length as the petal tube. Flowering mainly occurs from July to December.
Taxonomy
Leucopogon tamariscinus was first formally described in 1810 by Robert Brown in his Prodromus Florae Novae Hollandiae et Insulae Van Diemen. The specific epithet (tamariscinus) means "Tamarix-like".
Distribution and habitat
This leucopogon grows on sandplains and on laterite ridges in the Avon Wheatbelt, Esperance Plains, Jarrah Forest and Mallee bioregions of southern Western Australia.
Conservation status
Leucopogon tamariscinus is listed as "not threatened" by the Government of Western Australia Department of Biodiversity, Conservation and Attractions.
References
tamariscinus
Ericales of Australia
Endemic flora of Southwest Australia
Plants described in 1810
Taxa named by Robert Brown (botanist, born 1773) |
Monkey Life is a TV series based on the work of the largest monkey and ape rescue centre/sanctuary in the world: Monkey World in Dorset, United Kingdom. The series is a follow-on from the original ITV series Monkey Business, and shows the day-to-day work and troubles of the staff.
Series overview
The series follows the work of the staff at Monkey World, who have rescued primates being mistreated in laboratories, being kept as exotic pets, or used as photographers' props etc. The sanctuary, which was originally a small and derelict pig farm, is now home to over 250 primates from 21 different species and has animals rescued from 18 countries.
The TV series is now in its fifteenth series and is filmed by Primate Planet Productions Ltd., who are based on-site and accompany Dr. Alison Cronin and her staff on all international and UK rescues, documenting the team's work in their ongoing mission to stop the illegal smuggling of primates from the wild. The Primate Planet Productions crew helps to document the rescue and re-homing of primates at Monkey World, and continues to follow their stories as the primates settle into their new home along with other animals of their kind.
Monkey Life – Series 1–15 (294 half-hour episodes) so far
Series 15 (2022): Primate Planet Productions produced 20 half-hour episodes for Sky. Narrated by Ralf Little. This series aired on Sky Nature
Series 14 (2021): Primate Planet Productions produced 20 half-hour episodes for Sky. Narrated by Ralf Little. This series aired on Sky Nature.
Series 13 (2020): Primate Planet Productions produced 20 half-hour episodes for Sky. Narrated by Ralf Little. This series aired on Sky Nature.
Series 12 (2019): Primate Planet Productions produced 20 half-hour episodes for Sky. Narrated by Ralf Little, this series is broadcast on Pick.
Series 11 (2018): Primate Planet Productions produced 20 half-hour episodes for Sky. Narrated by Ralf Little, this series is broadcast on Pick.
Series 10 (2018): Primate Planet Productions produced 20 half-hour episodes for Sky. Narrated by Ralf Little, this series is broadcast on Pick.
Series 9 (2016): Primate Planet Productions produced 20 half-hour episodes for Sky. Narrated by Ralf Little, this series is broadcast on Pick.
Series 8 (2015): Primate Planet Productions produced 20 half-hour episodes for Sky. Narrated by Ralf Little, this series is broadcast on Pick.
Series 7 (2013): Primate Planet Productions produced 20 half-hour episodes for Discovery Networks. Narrated by Ralf Little, this series is broadcast on Animal Planet and other channels worldwide.
Series 6 (2012): Primate Planet Productions produced 20 half-hour episodes for Discovery Networks. Narrated by Ralf Little, this series is broadcast on Animal Planet and other channels worldwide.
Series 5 (2011): Primate Planet Productions produced 20 half-hour episodes for Discovery Networks. Narrated by Ralf Little, this series is broadcast on Animal Planet and other channels worldwide, as well as Channel 5 in Ireland and the UK.
Series 4 (2010): Primate Planet Productions produced 20 half-hour episodes. Narrated by Ralf Little, this series is broadcast on Nat Geo WILD worldwide, as well as on Channel 5 in Ireland and the UK.
Series 3 (2009): Primate Planet Productions produced 20 half-hour episodes in Association with Athena Films. Narrated by Ralf Little, this series was shown on Channel 5 in Ireland and the UK, as well as on Animal Planet worldwide.
Series 2 (2008): Primate Planet Productions produced 20 half-hour episodes in Association with Athena Films. Narrated by Ralf Little, this series was shown on Channel 5 in Ireland and the UK, as well as on Animal Planet worldwide. This series was also made available on Hulu in the USA.
Series 1 (2007): Primate Planet Productions produced 14 half-hour episodes in association with Athena Films. Narrated by Andy Serkis, (the voice of Gollum in Lord of the Rings), this series was shown on Channel 5 in the UK, as well as on Animal Planet worldwide. This was the only series to feature Jim Cronin, a co-founder of Monkey World, as he died on 17 March 2007 from cancer.
Merchandise
DVDs
Monkey Life series 1–11 have been released on DVD and are available worldwide. Series 1-3, and series 4-6 are available as 3 series sets, while series 1-11 are all available individually. They are all presented in stereo sound, widescreen video and are region-free.
Monkey Life on Demand
In 2014, Primate Planet Productions launched the series on Vimeo VOD. Monkey Life series 1–10 are available on VIMEO VOD in many countries around the world.
Monkey Business
Monkey Business, the series that preceded Monkey Life, was first produced by Tigress and then Meridian Broadcasting. Nine series were produced and it was broadcast on the local ITV Meridian TV channel in the UK and also on Animal Planet worldwide. A final 3-part TV series called 10 Years of Monkey Business summarised the work of Monkey World over the previous 10 years. Monkey Business was narrated by Chris Serle.
Jim Cronin
The late Jim Cronin founded Monkey World Ape Rescue Centre in 1987, and brought Jeremy Keeling on board as animal director, while Jim made it his mission to grow the rescue operation, design & build new facilities and educate visitors about the park's purpose & vision. During his life Cronin established himself as an international expert in the rescue and rehabilitation of abused primates, as well as the enforcement of international treaties aimed at protecting primates from illegal trade, exploitation and abuse.
Cronin died on 17 March 2007. In his memory, the Jim Cronin Memorial Fund has been established to continue Cronin's legacy, supporting primate conservation and welfare around the world. Assisted by Jeremy Keeling and the rest of the team at Monkey World, Jim's wife Alison Cronin continues Jim's work.
References
External links
Monkey Life at five.tv
2010s British television series
2007 British television series debuts
Animal Planet original programming
Channel 5 documentary series
Television series about monkeys
Television shows set in Dorset |
```php
<?php
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
*/
namespace Google\Service\CloudRetail;
class your_sha256_hashig extends \Google\Model
{
/**
* @var string
*/
public $contextProductsType;
/**
* @param string
*/
public function setContextProductsType($contextProductsType)
{
$this->contextProductsType = $contextProductsType;
}
/**
* @return string
*/
public function getContextProductsType()
{
return $this->contextProductsType;
}
}
// Adding a class alias for backwards compatibility with the previous class name.
class_alias(your_sha256_hashig::class, your_sha256_hashyBoughtTogetherFeaturesConfig');
``` |
Camille D'Arcy (1879 – September 26, 1916) was a stage and silent film actress in the early years of the movie business up to 1916, a relatively large woman she played matron or character roles in silent films. During her short movie career all of her film appearances were with the Essanay Company out of Chicago. In private life she was married to Dr. Loren Wilder. In the fall of 1916 she went swimming in Lake Michigan, caught an infection and died at age 37 in Chicago.
Filmography
Third Hand High (1915)*short
The Strength of the Weak (1915)*short
The Fable of the Galumptious Girl (1915)*short
The Snow-Burner (1915)*short
The White Sister (1915)
(1915)*short
(1915)*short
(1915)*short
The Circular Path (1915)*short
The Reaping (1915)*short
The Fable of the Escape of Arthur and the Salvation of Herbert (1915)*short
The Fable of the Low Down Expert on the Subject of Babies (1915)*short
A Daughter of the City (1915)
Captain Jinks of the Horse Marines (1916)
Beyond the Law (1916)*short
Putting it Over (1916)*short
The Grouch (1916)*short
The Prince Chap (1916)
The Pacifist (1916)*short
References
External links
1870s births
1916 deaths
American silent film actresses
20th-century American actresses
Deaths from infectious disease |
Sagnier is a surname. Notable people with the surname include:
Enric Sagnier (1858–1931), Spanish architect
Eugenio Trías Sagnier (1942–2013), Spanish philosopher
Ludivine Sagnier (born 1979), French actress and model
Sagnier, French umbrella maker in the 19th century |
Cesar Acuña Peralta (born 11 August 1952) is a Peruvian politician and entrepreneur in the field of education. A controversial figure in Peruvian politics, he is the founder and leader of the Alliance for Progress party, which has achieved recognition for being the first party of provincial origin to gain electoral popularity at national level since its foundation in 2001.
Born into poverty to a family of twelve brothers in Cajamarca in 1952, Acuña pursued his higher studies at the National University of Trujillo, where he graduated as a chemical engineer. Simultaneously, he started in the education business by founding a prep-college
academy, which would ultimately evolve into César Vallejo University, founded in 1991. In the years to come, he pursued graduate studies in education at the University of Lima, the University of Los Andes, and the Complutense University of Madrid; at the same time, he founded two more colleges, founding a multi-million dollar private college consortium with campuses throughout Peru, which he currently owns.
Acuña gained political recognition when in October 2006 was elected Mayor of Trujillo, ending a forty-four year uninterrupted tenure of the Peruvian Aprista Party in the northern city. He was successfully reelected in 2010. Four years later, he was elected Governor of La Libertad, this time defeating the same party at regional level. Ten months after being sworn in, he resigned as governor and started a full-scale presidential campaign for the 2016 general election. Considered a potential run-off nominee against frontrunner Keiko Fujimori, he was eventually disqualified by the electoral authorities after alleged vote-buying in a campaign trail. Throughout the campaign, he faced accusations regarding plagiarism in two of his graduate thesis', and of illegally self-appropriating a published work on education policy under his name, which authorship belonged to an associated educator.
Since his failed 2016 presidential bid, Acuña was considered a potential candidate for the 2021 general election. Although he did not expresse interest on matter between 2016 and 2020, he formally announced his run in the election in late October 2020. He ultimately placed seventh with 6% of the popular vote in a heavily atomized election, managing to win La Libertad Region only, although his party achieved congressional representation throughout the country.
Early life and education
César Acuña Peralta was born on August 11, 1952, in the Peruvian hamlet of Ayaque, Tacabamba District, Chota Province, Cajamarca Region. He is the third of twelve brothers. His parents were Héctor Acuña Cabrera and Clementina Peralta Alvarado, people dedicated to agricultural work. His parents had no formal education (only the father attended primary school). Acuña and his 11 siblings completed their primary and secondary studies at the Tacabamba National School for Boys and Girls.
When he was 18 years old, he traveled to Trujillo and enrolled in the School of Engineering at the National University of Trujillo in 1972, graduating at the age of 23 with a bachelor's degree in chemical engineering. To cover his college expenses, he had to sell cañazo (strong liquor) that he obtained from the then Casa Grande sugar plantation. As a student, he founded the Prep-College Engineering Academy in 1980, thus beginning his career as an entrepreneur in education. This academy was located on Carrión Avenue.
On November 12, 1991, Law 25350 was enacted, which created César Vallejo University. The college would expand throughout the country with campuses in Chiclayo, Piura, Chimbote, Tarapoto, Lima, Huaraz and Moyobamba. In 1996 he founded the Club Deportivo Universidad César Vallejo, which represents Cesar Vallejo University in Peruvian professional football, and the regional television network UCV Satelital. In 2001 he established the Señor de Sipán University in Chiclayo, and three years later the Harvard College of Piura. Finally, in 2007, he founded the Autonomous University of Peru in the populous district of Villa El Salvador in Lima. Acuña would earn much of his wealth from his for-profit universities.
During the 1990s, Acuña attained a master's degree in College Management at the University of Los Andes (Colombia), a master's degree in Education Administration at the University of Lima, a Ph.D. in Education at the Complutense University of Madrid (Spain), and Post-Ph.D. in Communication, Education and Culture at the Saint Thomas Aquinas University (Colombia).
Political career
Fujimori government
Acuña first ran for a seat in the lower house of the Peruvian Congress at the 1990 general election with the United Left from La Libertad constituency. Although not elected, he started working towards founding his own political party.
At the 2000 general election, he was elected to Congress as an independent within the National Solidarity Party. Upon taking office, he quit the National Solidarity parliamentary caucus and former an independent bloc. According to the Institute of Legal Defense (IDL), the journalist Christopher Acosta reported that Acuña allegedly worked with Vladimiro Montesinos of the National Intelligence Service (SIN) in an effort to be paid for supporting the Fujimori government, with the IDL writing that former secretary of Montesinos, Matilde Pinchi Pinchi, saw the two together. According to Pinchi Pinchi, IDL and RPP reported, Acuña also requested a position as a minister in exchange for supporting Fujimori, declining the payment of $10,000 USD. Acuña would deny the allegations.
During his tenure, he was a member of the Sub-Commission on the Corruption Video, Kouri-Montesinos case, a member of the Investigative Sub-Commission on the Comptroller General of the Republic, Carmen Higaonna, and a member of the Investigative Sub-Commission on the Indignation Video, case Gamarra. His term would be shortened to one-year following Alberto Fujimori's downfall and the convoking of new general elections for April 2001.
Founding of party
At the 2001 general election, Acuña was invited by Lourdes Flores to run for reelection with the National Unity coalition. At the time, he was in the final stages of starting his own political party. He was ultimately elected representing La Libertad constituency.
On December 8, 2001, in Trujillo, Acuña founded the Alliance for Progress, his own political party. Following this event, he quit the National Unity parliamentary caucus and formed an independent bloc once again. Throughout his full term in Congress, he led numerous bills regarding education business regulations, and was a member of the investigative committee's on corruption in the Fujimori regime.
At the 2006 general election, Acuña invited fellow congressman Natale Amprimo to run for President of Peru with the Alliance for Progress nomination, and himself as his first running mate (which allowed him to run simultaneously for reelection to Congress). Although he attained the highest vote count in his constituency, the nationwide results were 2.3% of the popular vote, failing to pass the new electoral threshold. The presidential ticket itself attained 0.4% of the popular vote, placing tenth.
Mayorship of Trujillo and Regional Governorship of La Libertad (2007–2015)
Following the 2006 general election's poor results, Alliance for Progress lost its party registration in the National Jury of Elections alongside the rest of the parties that failed to pass the threshold. That same year, Acuña made his first mayoral bid in Trujillo. Considered as a underdog throughout the entire campaign, his victory proved a major blow for the Peruvian Aprista Party, as the city is widely recognized as the Aprista party's birthplace and stronghold in the Peruvian north. He attained 56.5% of the popular vote. President of Peru and leader of the Peruvian Aprista Party, Alan García, lamented his party's defeat in Trujillo, being quoted by the press saying: "I cried on Sunday night because I never thought that Haya de la Torre's cradle and grave could be lost. It is a stab in the heart, I say it as a son. At some point I will recover Trujillo even if I have to be a candidate for mayor personally. Many good people from Trujillo have punished the disorders and the pride of some people there...".
Acuña ran for mayoral reelection in 2010, defeating once again the Peruvian Aprista Party nominee, Daniel Salaverry, with 43.9% of the popular vote. After 7 years in office, he formally resigned to the mayorship in order to run for Governor of La Libertad in the 2014 regional elections. The region had been governed by José Murgia since 2007, and remained the last Aprista governorship at national level. Acuña ultimately won the election with 43.6% of the popular vote, defeating Murgia.
Upon taking office in January 2015, Acuña led diverse infrastructure programs throughout the region, and constantly clashed with the new mayor of Trujillo, a former police colonel Elidio Espinoza, an independent who defeated Alliance for Progress the year prior.
2016 Presidential nomination
Acuña started to gain traction at national level polls in mid-2015. Considered a potential candidate for the presidency at the 2016 general election, he initiated an exploratory committee in September 2015. After 10 months in office, he resigned as governor, and started a full-scale presidential bid with his Alliance for Progress.
Following his announcement, he started to gain momentum in the polls. In November 2015, he placed third for the first time, behind frontrunner Keiko Fujimori and Pedro Pablo Kuczynski, and above Alan García. His popular support was largely viewed by the media as a rejection towards the traditional political class. Upon registering his ticket, Acuña announced as running mates former Minister of Women and Social Development, Anel Townsend, and congressman Humberto Lay. Following this event, he announced the composition of the Alliance for the Progress of Peru coalition, which included his party, National Restoration, and We Are Peru.
His campaign was marked by controversy. During the month of January, he was accused of plagiarism in both his master's and Ph.D. thesis, at the University of Lima and the Complutense University of Madrid, respectively. Although he denied the allegations, the universities opened investigations against him. Amidst the scandal, he was also accused of plagiarizing an entire work titled Educative Policy, written by a professor of his, Otoniel Alvarado. Acuña claimed that both authors had agreed on releasing the work together on separate authorships, but Alvarado denied any agreement of sort, and proceeded to publicly denounce him for plagiarism. Acuña later commented on the issue by declaring to the press that he had not committed plagiarism, and that "it was just copying". Upon the numerous accusations against his persona, Francisco Miró Quesada Rada resigned as president of César Vallejo University. Acuña replaced him by naming former Prime Minister of Peru, Beatriz Merino, as the new president of his university.
Disqualification
Following the previous events, Acuña was accused of attempted vote-buying during a campaign trail, as he offered money to a disabled young man for his future medical operation. Describing his gesture as "humanitarian aid", the Electoral National Jury proceeded to open an investigation. He was subsequently barred from the election, alongside another front-runner candidate, Julio Guzmán, for irregularities in the nomination procedure. Although his campaign team presented extensive appeals to the barring, it was ultimately not overruled His last poll appearance placed him fourth. Analysts viewed his barring from the election with Guzmán as a leverage for other candidates, mainly Pedro Pablo Kuczynski, who managed to earn second place and qualify for the run-off against front-runner Keiko Fujimori. Kuczynski, a former ally of Acuña, was subsequently elected president in the run-off.
Post-2016 presidential bid
Although his presidential nomination was barred from the 2016 election, Alliance for Progress obtained 9.2% of the popular vote at parliamentary level, gaining 9 out of 130 seats in the Peruvian Congress. Following the constitutional dissolution of Congress on September 30, 2019, by president Martín Vizcarra, his party obtained 8.0% of the popular vote and 22 out of 130 seats at the 2020 snap parliamentary election.
2021 presidential campaign
Acuña has remained skeptical of running for the presidency in the 2021 general election, but keeps polling as potential nominee due to the strong popularity his party has achieved since the 2020 snap-election. He was disqualified on 8 January 2021, due to incomplete information regarding the presidential nominee's income in registration form. However, following an appeal, he was reinstated on 22 January 2021. He ultimately placed seventh with 6% of the popular vote in a heavily atomized election, managing to win La Libertad Region only, although his party achieved congressional representation throughout the country.
Political position
According to the Council on Hemispheric Affairs, Acuña supports right-wing politics and promoted international investment in Peru. Following Pedro Castillo's success in the first round of 2021 elections, Acuña began a campaign tour promoting Fujimorism and Keiko Fujimori titled "Crusade for Peru"creating an alliance with her and stating to supporters at a rally "I forget acts of corruption of Fujimorism" while also condemning left-wing politics. Acuña also supported the release of Alberto Fujimori from prison, citing Fujimori's age and health.
Controversies
During the 2011 general election campaign, he was sanctioned five times for violating electoral neutrality in favor of his son and presidential candidate, Pedro Pablo Kuczynski, in his position of Mayor of Trujilo.
In September 2011, the Prosecutor's Office ordered an experts opinion to the accounts of the universities of César Acuña for alleged money laundering, in response to the complaint made by his own wife, Carmen Rosa Núnez Campos.
In June 2012, the National Office of Electoral Processes (ONPE) fined Alliance for Progress with more than 9 million soles for having received contributions ten times greater than the allowed limit from César Vallejo University.
In May 2013, a video was released in which Acuña proposed to members of his party to "buy votes" to achieve his reelection as mayor of Trujillo, allegedly using public funds. Acuña admitted that he "bought votes" to achieve his reelection and that it does not seem like a bad thing to him, but denied that it was with public funds. That same month, another audio revealed that Acuña used resources from the Municipality's Treasury to improve his image as mayor of Trujillo.
In January 2016, at the start of his presidential campaign, he was accused of committing plagiarism in his Ph.D. thesis dissertation at the Complutense University of Madrid. In June 2017, the university released a statement declaring that the dissertation would not be annulled after investigations concluded there was no plagiarism. At the same time, he was accused of also committing plagiarism in his master's thesis at the University of Lima. Nine months later, the university verified that Acuña committed plagiarism in four modalities for his Master's thesis in Educational Administration: literal copy without mentioning the source; mentioning of a source and apparent paraphrase, but the literal copy of the texts; mentioning of a source and combination of paraphrase with literal copy; and taking ideas from another author without mentioning the source. Acuña publicly denied the allegations.
In November 2018, Acuña testified before the prosecution on the case of money laundering, the investigations are still open, the president of the Alliance for Progress party, indicated that the transfers are legal before judicial authorities.
In 2021, César Acuña is investigated for money laundering. The acquisition of a property in the Soto de La Moraleja urbanisation in Madrid (Spain), valued at one million 200 thousand euros, is the reason for which he is being investigated.
In January 2022, a judge found Christopher Acosta, his book's publisher and the director of the publisher guilty of defamation for their book "Plata Como Cancha," investigating allegations of Acuña participating in vote buying, embezzlement and plagiarism, with the judge arguing that certain allegations lacked sufficient sources and fined the entities $100,000, with the funds being awarded to Acuña.
See also
Alliance for Progress
References
1952 births
Alliance for Progress (Peru) politicians
Living people
Mayors of Trujillo, Peru
Candidates for President of Peru
National Unity (Peru) politicians
National Solidarity Party (Peru) politicians
Members of the Congress of the Republic of Peru |
Malleability of intelligence describes the processes by which intelligence can increase or decrease over time and is not static. These changes may come as a result of genetics, pharmacological factors, psychological factors, behavior, or environmental conditions. Malleable intelligence may refer to changes in cognitive skills, memory, reasoning, or muscle memory related motor skills.
In general, the majority of changes in human intelligence occur at either the onset of development, during the critical period, or during old age (see neuroplasticity).
Charles Spearman, who coined the general intelligence factor "g", described intelligence as one's ability to adapt to his environment with a set of useful skills including reasoning and understanding patterns and relationships. He believed individuals highly developed in one intellectual ability tended to be highly developed at other intellectual abilities. A more intelligent individual was thought to be able to more easily "accommodate" experiences into existing cognitive structures to develop structures more compatible with environmental stimuli.
In general, intelligence is thought to be attributed to both genetic and environmental factors, but the extent to which each plays a key role is highly disputed. Studies of identical and non-identical twins raised separately and together show a strong correlation between child IQ and socio-economic level of the parents. Children raised in lower-class families tend to score lower on intelligence tests when compared to children raised in both middle and upper-class families. However, there is no difference in intelligence scores between children raised in middle versus upper-class families.
Definitions
Intelligence: a very general capability that, among other things, involves the ability to reason, plan, solve problems, think abstractly, comprehend complex ideas, learn quickly and learn from experience.
Critical period: a restricted developmental period during which the nervous system is particularly sensitive to the effects of experience.
Neuroscience basis
The biological basis of intelligence is founded in the degree of connectivity of neurons in the brain and the varying amounts of white and grey matter. Studies show that intelligence is positively correlated with total cerebral volume. While it is true that the number of neurons in the brain actually decreases throughout development, as neural connections grow and the pathways become more efficient, the supporting structures in the brain increase. This increase in supporting tissues, which include myelination, blood vessels, and glial cells, leads to an increase in overall brain size. When brain circumference and IQ were compared in 9 year olds, a positive correlation was found between the two. An increase of 2.87 IQ points occurred for each standard deviation increase in brain circumference.
Importance of critical period
The brain grows rapidly for the first five years of human development. At age five, the human brain is 90% of its total size. Then the brain finishes growing gradually until mid to late twenties. From start to finish, the brain increases in size by over 300% from birth. The critical period, defined as the beginning years of brain development, is essential to intellectual development, as the brain optimizes the overproduction of synapses present at birth. During the critical period, the neuronal pathways are refined based on which synapses are active and receiving transmission. It is a "use it or lose it" phenomenon.
Neural plasticity
Neural plasticity refers to any change in the structure of the neural network that forms the central nervous system. Neural plasticity is the neuronal basis for changes in how the mind works, including learning, the formation of memory, and changes in intelligence. One well-studied form of plasticity is Long-Term Potentiation (LTP). It refers to a change in neural connectivity as a result of high activation on both sides of a synaptic cleft. This change in neural connectivity allows information to be more easily processed, as the neural connection associated with that information becomes stronger through LTP. Other forms of plasticity involve the growth of new neurons, the growth of new connections between neurons, and the selective elimination of such connection, called "dendritic pruning".
Genetic factors of intelligence
Humans have varying degrees of neuroplasticity due to their genetic makeups, which affects their ability to adapt to conditions in their environments and effectively learn from experiences. The degree to which intelligence test scores can be linked to genetic heritability increases with age. There is presently no explanation for this puzzling result, but flaws in the testing methods are suspected. A study of Dutch twins concludes that intelligence of 5 year olds is 26% heritable, while the test scores of 12-year-olds is 64% heritable. Structurally, genetic influences explain 77–88% of the variance in the thickness of the mid-sagittal area of the corpus callosum, the volume of the caudate nucleus, and the volumes of the parietal and temporal lobes.
Pharmacological influence
Numerous pharmacological developments have been made to help organize neural circuitry for patients with learning disorders. The cholinergic and glutamatergic systems in the brain serve an important role in learning, memory, and the developmental organization of neuronal circuitry. These systems help to capitalize on the critical period and organize synaptic transmission. Autism and other learning disabilities have been targeted with drugs focusing on cholinergic and glutamatergic transmission. These drugs increase the amount of acetylcholine present in the brain by increasing the production of acetylcholine precursors, as well as inhibiting acetylcholine degradation by cholinesterases. By focusing on heightening the activity of this system, the brain's responsiveness to activity-dependent plasticity is improved. Specifically, glutamatergic drugs may reduce the threshold for LTP, promote more normal dendritic spine morphology, and retain a greater number of useful synaptic connections. Cholinergic drugs may reconnect the basal forebrain with the cortex and hippocampus, connections that are often disrupted in patients with learning disorders.
Psychological factors
Psychological factors and preconceived notions about intelligence can be as influential on intelligence as genetic makeup. Children with early chronic stress show impaired corticolimbic connectivity in development. Early chronic stress is defined as inconsistent or inadequate care-giving and disruption to early rearing environment. These children showed decreased cognitive function, especially in fluid cognition, or the ability to effectively utilize working memory. The lack of connectivity between the limbic system and the prefrontal cortex can be blamed for this deficiency.
Behavioral factors
In the study of malleable intelligence, behavioral factors are often the most intriguing because these are factors humans can seek to control. There are numerous behavioral factors that affect intellectual development and neural plasticity. The key is plasticity, which is caused by experience-driven electrical activation of neurons. This experience-driven activation causes axons to sprout new branches and develop new presynaptic terminals. These new branches often lead to greater mental processing in different areas.
Taking advantage of the critical period
As previously discussed, the critical period is a time of neural pruning and great intellectual development.
See also
References
External links
The Entity Theory of Intelligence – Parenting Science
Raising Our I.Q. – NY Times
Neuroscience
Intelligence
Cognitive science |
```python
# -*- coding: utf-8 -*-
import io
import os
import random
from app.base.configs import tp_cfg
from wheezy.captcha.image import background
from wheezy.captcha.image import captcha
from wheezy.captcha.image import curve
from wheezy.captcha.image import noise
from wheezy.captcha.image import offset
from wheezy.captcha.image import rotate
from wheezy.captcha.image import smooth
from wheezy.captcha.image import text
from wheezy.captcha.image import warp
# _captcha_chars = 'AaCDdEeFfHJjKkLMmNnPpQRTtVvWwXxYy34679'
_captcha_chars = 'AaCDdEeFfHJKkLMmNnPpRTtVvWwXYy2379'
def _random_color_font():
colors = ['#152cea', '#0b7700', '#5431d4', '#0e78ca']
return random.choice(colors)
def _random_color_line():
colors = ['#ce3714', '#de35bc']
return random.choice(colors)
def tp_captcha_generate_image(h):
if h >= 32:
captcha_image_t = captcha(
width=136,
height=36,
drawings=[
background(color='#eeeeee'),
curve(color='#bbbbbb', width=6, number=12),
curve(color=_random_color_line, width=2, number=30),
curve(color='#cccccc', width=7, number=13),
curve(color='#dddddd', width=8, number=14),
text(fonts=[
os.path.join(tp_cfg().res_path, 'fonts', '001.ttf')
],
font_sizes=(h-5, h-2, h, h+2),
color=_random_color_font,
squeeze_factor=1.05,
drawings=[
warp(dx_factor=0.03, dy_factor=0.03),
rotate(angle=20),
offset()
]),
smooth(),
])
else:
captcha_image_t = captcha(
width=int(h*3)+8,
height=h,
drawings=[
background(color='#eeeeee'),
noise(number=40, color='#dddddd', level=3),
smooth(),
text(fonts=[
os.path.join(tp_cfg().res_path, 'fonts', '001.ttf')
],
font_sizes=(h-3, h-2, h-1, h),
color=_random_color_font,
squeeze_factor=0.95,
drawings=[
warp(dx_factor=0.03, dy_factor=0.03),
rotate(angle=15),
offset()
]),
smooth(),
])
chars_t = random.sample(_captcha_chars, 4)
image = captcha_image_t(chars_t)
out = io.BytesIO()
image.save(out, "jpeg", quality=80)
return ''.join(chars_t), out.getvalue()
def tp_captcha_generate_image_v1(h):
if h >= 32:
captcha_image_t = captcha(
width=136,
height=36,
drawings=[
background(color='#eeeeee'),
# curve(color='#4388d5', width=1, number=10),
curve(color='#4388d5', width=1, number=10),
curve(color='#af6fff', width=3, number=16),
noise(number=80, color='#eeeeee', level=3),
smooth(),
text(fonts=[
os.path.join(tp_cfg().res_path, 'fonts', '001.ttf')
],
# font_sizes=(28, 34, 36, 32),
font_sizes=(h-4, h-2, h, h+1),
color='#63a8f5',
# squeeze_factor=1.2,
squeeze_factor=0.9,
drawings=[
# warp(dx_factor=0.05, dy_factor=0.05),
warp(dx_factor=0.03, dy_factor=0.03),
rotate(angle=20),
offset()
]),
curve(color='#af6fff', width=3, number=16),
noise(number=20, color='#eeeeee', level=2),
smooth(),
])
else:
captcha_image_t = captcha(
width=int(h*3)+8,
height=h,
drawings=[
background(color='#eeeeee'),
# curve(color='#4388d5', width=1, number=10),
curve(color='#4388d5', width=1, number=10),
curve(color='#af6fff', width=3, number=16),
noise(number=40, color='#eeeeee', level=2),
smooth(),
text(fonts=[
os.path.join(tp_cfg().res_path, 'fonts', '001.ttf')
],
# font_sizes=(28, 34, 36, 32),
font_sizes=(h-2, h-1, h, h+1),
color='#63a8f5',
# squeeze_factor=1.2,
squeeze_factor=0.9,
drawings=[
# warp(dx_factor=0.05, dy_factor=0.05),
warp(dx_factor=0.03, dy_factor=0.03),
rotate(angle=20),
offset()
]),
curve(color='#4388d5', width=1, number=8),
noise(number=10, color='#eeeeee', level=1),
# smooth(),
])
chars_t = random.sample(_captcha_chars, 4)
image = captcha_image_t(chars_t)
out = io.BytesIO()
image.save(out, "jpeg", quality=100)
return ''.join(chars_t), out.getvalue()
``` |
10 złotych may refer to:
10 złotych note, Poland
10 złotych coin, Poland |
The 2010–11 Algerian Ligue Professionnelle 1 was the 49th season of the Algerian Ligue Professionnelle 1 since its establishment in 1962. A total of 16 teams contested the league, with MC Alger as the defending champions. The league started on September 24, 2010. and ended on July 8, 2011.
On June 21, 2011, ASO Chlef were officially crowned champions after second-placed CR Belouizdad lost to USM El Harrach. In doing so, they won their first Algerian league title in the club's history. At the bottom, USM Annaba, CA Bordj Bou Arréridj and USM Blida were relegated to the Algerian Ligue Professionnelle 2.
Overview
At the start of the season, the name of the league was changed to Ligue Professionnelle 1 from Algerian Championnat National to reflect the professionalization of the league.
Promotion and relegation
Teams promoted from 2009–10 Algerian Championnat National 2
MC Saïda
Teams relegated to 2010–11 Algerian Ligue Professionnelle 2
CA Batna
MSP Batna
NA Hussein Dey
Team summaries
Stadiums
Personnel and kits
Note: Flags indicate national team as has been defined under FIFA eligibility rules. Players and Managers may hold more than one non-FIFA nationality.
Managerial changes
League table
Results
Season statistics
Top scorers
See also
2010–11 Algerian Ligue Professionnelle 2
2010–11 Algerian Cup
References
External links
Awards at YouTube
Algerian Ligue Professionnelle 1 seasons
Algeria
1 |
```ruby
# frozen_string_literal: true
class UnfilterNotificationsWorker
include Sidekiq::Worker
include Redisable
# Earlier versions of the feature passed a `notification_request` ID
# If `to_account_id` is passed, the first argument is an account ID
# TODO for after 4.3.0: drop the single-argument case
def perform(notification_request_or_account_id, from_account_id = nil)
if from_account_id.present?
@notification_request = nil
@from_account = Account.find_by(id: from_account_id)
@recipient = Account.find_by(id: notification_request_or_account_id)
else
@notification_request = NotificationRequest.find_by(id: notification_request_or_account_id)
@from_account = @notification_request&.from_account
@recipient = @notification_request&.account
end
return if @from_account.nil? || @recipient.nil?
push_to_conversations!
unfilter_notifications!
remove_request!
decrement_worker_count!
end
private
def push_to_conversations!
notifications_with_private_mentions.reorder(nil).find_each(order: :desc) { |notification| AccountConversation.add_status(@recipient, notification.target_status) }
end
def unfilter_notifications!
filtered_notifications.in_batches.update_all(filtered: false)
end
def remove_request!
@notification_request&.destroy!
end
def filtered_notifications
Notification.where(account: @recipient, from_account: @from_account, filtered: true)
end
def notifications_with_private_mentions
filtered_notifications.where(type: :mention).joins(mention: :status).merge(Status.where(visibility: :direct)).includes(mention: :status)
end
def decrement_worker_count!
value = redis.decr("notification_unfilter_jobs:#{@recipient.id}")
push_streaming_event! if value <= 0 && subscribed_to_streaming_api?
end
def push_streaming_event!
redis.publish("timeline:#{@recipient.id}:notifications", Oj.dump(event: :notifications_merged, payload: '1'))
end
def subscribed_to_streaming_api?
redis.exists?("subscribed:timeline:#{@recipient.id}") || redis.exists?("subscribed:timeline:#{@recipient.id}:notifications")
end
end
``` |
Aquatic timing systems are designed to automate the process of timing, judging, and scoring in competitive swimming and other aquatic sports, including diving, water polo, and synchronized swimming. These systems are also used in the training of athletes, and many add-on products have been developed to assist with this process. Some aquatic timing systems manufacturers include Colorado Time Systems, Swiss Timing (Omega), Daktronics and Seiko.
History
Prior to the 1950s, competitive swimmers relied on the sound of a starting pistol to start their races and mechanical stopwatches to record their times at the end of a race. A limitation of analog timekeeping was the technology's inability to reliably record times accurately below one tenth (0.1) of a second. In 1967, the Omega company of Switzerland developed the first electronic timing system for swimming that attempted to coordinate the physical the recorded time. This new system placed contact pads (known as Touchpad) in each lane of the pool, calibrated in such a fashion that the incidental water movement of the competitors or wave action did not trigger the pad sensors; the pad was only activated by the touch of the swimmer at the end of the race.
Meet Manager Programs
Meet Managers are programs created to automate the process of generating results and can be either downloadable or web applications. They are normally sold to clubs and can also be connected to the timing system to obtain timing information automatically. Some meet manager developers include Active Hy-Tek, Geologix, SwimTopia, NBC Sports and Bigmidia.
See also
Fully automatic time
Scoreboards
References
Sports equipment
Sports officiating technology
Timekeeping |
Rover is the third extended play by South Korean singer Kai, released on March 13, 2023, by SM Entertainment. The EP contains six tracks including the lead single of the same name. The physical album is available in five versions (two "Photobook" versions, one "Sleeve" version, one "Digipack" version, and one "SMini" version).
Background and release
In February 2023, SM confirmed that Kai plans to release a new solo album. On February 17, SM announced that his new EP, Rover, would be released on March 13.
The music video for "Rover" was inspired by two movies: Billy Elliot (2000) and Catch Me If You Can (2002).
A promotional video entitled "FILM : KAI #Rover" for the EP was released on Exo official YouTube channel on March 20, featuring performances for each of the EP's b-sides.
Composition
The lead single "Rover" is a dancehall song featuring heavy bass, marimba, bells and various percussions. The lyrics sing of throwing off the restraints of others' viewpoints and living freely as a 'wanderer'. "Black Mirror" is an R&B hip hop song with lyrics that question the lifestyle of modern humans reliant on the stimulating, provocative content on social media. "Bomba" is a dance genre song with reggaeton beats. "Slidin'" is an R&B soul genre song that features elegant arpeggio synth sounds and rhythmical drums. The lyrics compare falling in love at first sight with someone that you run into by chance to one's clothes becoming wet from a sudden downpour. "Say You Love Me" is a hip-hop R&B song accompanied by drums and 808 bass. The lyrics make use of candid, straightforward expressions to depict one's desire for the other to confirm their interest in an honest manner. "Sinner" is a pop genre song with piano and synthesizer as accompaniments. The lyrics express the desire to remain trapped in an exhausting type of love where both exhilaration and pain coexist.
Commercial performance
The album debuted at #1 on the Circle Weekly Album Chart (March 12–18) while the lead single Rover topped the Circle Weekly Download Chart in the same week. The album topped the iTunes Top Albums chart in 40 regions, including Brazil, Mexico, Argentina, and Chile. Additionally, the lead single Rover debuted at #12 on the Billboard World Digital Song Sales.
Track listing
Credits
Credits adapted from EP's liner notes.
Studio
SM Starlight Studio – recording , mixing , engineered for mix , digital editing
SM Yellow Tail Studio – recording , digital editing, engineered for mix
SM Big Shot Studio – recording , mixing , engineered for mix , digital editing
Doobdoob Studio – recording, digital editing
Sound Pool Studio – recording
Embassy Studio – recording
SM Blue Ocean Studio – mixing
SM Blue Cup Studio – mixing
SM Lvyin Studio – mixing, engineered for mix
SM Ssam Studio – engineered for mix
SM Concert Hall Studio – mixing
821 Sound Mastering – mastering
Personnel
SM Entertainment – executive producer
Lee Sung-soo – production director, executive supervisor
Tak Young-jun – executive supervisor
Yoo Young-jin – music and sound supervisor
Kai – vocals , background vocals
Park Tae-won – lyrics
Mia (153/Joombas) – lyrics
Lee Yeon-ji (PNP) – lyrics
RGB (Lalala Studio) – lyrics
Kim Su-min (Artiffect) – lyrics
Danke (Lalala Studio) – lyrics
Hwang Yu-bin (Verygoods) – lyrics
Cristian Tarcea – composition, arrangement
Dara – composition
Valentina Nikova – composition
YNGA – composition
Young Chance – composition , vocal directing , background vocals
Gabriel Brandes – composition
Imlay – arrangement
John "Jbl8ze" Eley – composition, arrangement
Jordan Dollar – composition, arrangement
Castle – composition, arrangement
Talay Riley – composition, arrangement
Steve "Tave" Octave – composition
Sam Klempner – composition, arrangement
Michael Matosic – composition
Jake Torrey – composition
Vinny "Vinnyforgood" Verdi – composition, arrangement
Michael "Trupopgod" Jiminez – composition, arrangement
Miguel Jiminez – composition
Dominique Logan – composition
Darius Logan – composition
Koen van de Wardtcomposition, arrangement
Ruben Pol – composition, arrangement
Chancellor – vocal directing , background vocals, recording
Rick Bridges – vocal directing
Kim Yeon-seo – vocal directing
Bob Matthews – keyboard
Jeong Yu-ra – recording , mixing , engineered for mix , digital editing
Noh Min-ji – recording , digital editing, engineered for mix
Lee Min-gyu – recording , mixing , engineered for mix , digital editing
Eugene Kwon – recording, digital editing
Jung Ho-jin – recording
Kim Cheol-sun – mixing
Jung Eui-seok – mixing
Lee Ji-hong – mixing, engineered for mix
Kang Eun-ji – engineered for mix
Nam Koong-jin – mixing
Lee Yong-jin – digital editing
Woo Min-jeong – digital editing
Kwon Nam-woo – mastering
Charts
Weekly charts
Monthly charts
Sales
Release history
References
2023 EPs
Kai (entertainer, born 1994) EPs
Korean-language EPs
SM Entertainment EPs |
Caverswall Road railway station is a heritage railway station on the Foxfield Railway in Staffordshire. It serves as the centre of the railway's operations. Since the Foxfield Railway is a former industrial railway, there were no passenger stations on the line originally.
The Foxfield Light Railway Society
The society was formed in 1967 to preserve any railway artifacts irrespective of their origins and to operate them on the line that originally connected the former Foxfield Colliery in Dilhorne, Staffordshire, with the Stoke on Trent to Derby line of the former North Staffordshire Railway at Blythe Bridge.
The Society became a Company, Limited by Guarantee in 1972. It was granted Charitable Status by the Inland Revenue at that time. It has no Shareholders and each Full Member has a liability limited to £5.
From January 2009 it has been registered with the Charity Commissioners as a Registered Charity in its own right and as a former constitution.
In 1995 after 28 years of operation, the Company was awarded a Light Railway Order SI1995 No 1236 under the Light Railways Act 1896. This gave it Statuary Powers as defined in the Instrument to build and operate a railway and buildings. Before this time it had simply taken over the "grandfather rights" of its former owners. An important reference in the Order is to the Railway Clauses Consolidation Act of 1845. This empower the company to erect such buildings and structures as necessary for the operation of its line, without having to seek planning permission from the local authority.
The Company has operated on a volunteer basis since 1967, but some paid staff also work.
History of the line
The line is standard gauge (1435mm) and was originally constructed in 1893, with left-over materials from the North Staffordshire Railway, over part of a route intended to join the market town of Cheadle (North Staffordshire) and its collieries with the North Staffordshire Stoke to Derby line at Blythe Bridge. This line was never completed over the current route and the Foxfield Colliery Company built the line itself over private land. Historically it appears that some of the line near the colliery was laid on the path of a former plateway or tramway.
The line crosses two public roads, one using an under bridge, the other on the level. It was these crossings which ultimately defined that the LRO would be required in order to comply with the Transport and Works Act, 1992.
The characteristic features that set this line apart from others are its many steep gradients and sharp curves. These are unique amongst heritage lines and it is these features which also provide it with unique operational difficulties and skill needs. Gradients on the line range from 1:950 to 1:19 making it one of the steepest heritage railways in the country.
Heritage railway stations in Staffordshire
Railway stations built for UK heritage railways |
```ruby
# frozen_string_literal: true
require_relative "shared_examples"
RSpec.describe UnpackStrategy::Jar, :needs_unzip do
let(:path) { TEST_FIXTURE_DIR/"test.jar" }
include_examples "UnpackStrategy::detect"
include_examples "#extract", children: ["test.jar"]
end
``` |
Membrane contact sites (MCS) are close appositions between two organelles. Ultrastructural studies typically reveal an intermembrane distance in the order of the size of a single protein, as small as 10 nm or wider, with no clear upper limit. These zones of apposition are highly conserved in evolution. These sites are thought to be important to facilitate signalling, and they promote the passage of small molecules, including ions, lipids and (discovered later) reactive oxygen species. MCS are important in the function of the endoplasmic reticulum (ER), since this is the major site of lipid synthesis within cells. The ER makes close contact with many organelles, including mitochondria, Golgi, endosomes, lysosomes, peroxisomes, chloroplasts and the plasma membrane. Both mitochondria and sorting endosomes undergo major rearrangements leading to fission where they contact the ER. Sites of close apposition can also form between most of these organelles most pairwise combinations. First mentions of these contact sites can be found in papers published in the late 1950s mainly visualized using electron microscopy (EM) techniques. Copeland and Dalton described them as “highly specialized tubular form of endoplasmic reticulum in association with the mitochondria and apparently in turn, with the vascular border of the cell”.
Plasma membrane - endoplasmic reticulum contact sites
MCSs between ER and PM exist in different cell types from neurons to muscle cells, from Homo sapiens to Saccharomyces cerevisiae. Some studies showed that more than 1000 contact sites are present in every yeast cell and the distance between the lipid bilayer ranges from 10 to 25 nm (the order of the size of a single protein). PM-ER contact sites have been linked to the main functions of MCS: lipid synthesis, lipid trafficking, and calcium homeostasis. A set of molecular tools (e.g., LiMETER and MAPPER) have been developed to label and manipulate the formation of ER-PM junctions in living cells.
Lipid biosynthesis
The uneven distribution of sterols among the membranes of the cell organelles, depends largely on non-vesicular route of transfer. For instance, in the ER, where they are synthetised, they account for about the 5%, but they are far more concentrated in the PM, where they account for more than 30% of lipid content.
Because lipids are insoluble in water (for example sterols <100 nM), and the spontaneous interbilayer and transbilayer lipid movement has halftime ranging from 1-2 h up to 103 h, it is generally accepted that the lipid trafficking must be mediated by lipid transfer proteins (LTPs) alongside the vesicular trafficking, which is not a major route for sterols. Several families of LTPs have been identified: they can carry the lipid molecule shielding its lipophilic chains from the aqueous ambient of the cytosol.
OSBP is the most extensively studied member of the oxysterol-binding protein (OSBP) related proteins family (ORP). It was first described as the cytoplasmic receptor for 25-hydroxycholesterol, and after more than 20 years it was shown that it's a cholesterol regulated protein in complex with ERK. Now, after the description of the structural basis for sterol sensing and transport, ORP protein family members are known to be essential for sterol signalling and sterol transport functions. Their peculiar structure is characterized by a conserved β-barrel sterol-binding fold with additional domains that can target multiple organelle membranes.
In yeast, Osh4 is an OSBP homologue the crystal structure of which, obtained in both the sterol-bound and unbound states, showed a soluble β-barrel protein with a hydrophilic external surface and a hydrophobic pocket that can carry a single sterol molecule. Seven OSBP homologues (OSH proteins) have been identified in Saccharomyces cerevisiae, in which their role has been suggested to be more relevant to sterol organization in the PM, rather than sterol trafficking from ER. Furthermore, Stefan et al. showed that OSH proteins control PI4P metabolism via the Sac1 Phosphatidylinositol (PI) 4-phosphatase. They also proposed a mechanism for Sac1 regulation: high Phosphatidylinositol 4-phosphate (PI4P) levels on the plasma membrane recruit Osh3 at PM-ER contact sites through its pleckstrin homology (PH) domain; Osh3 is now active and can interact with the ER-resident VAP proteins Scs2/Scs22 through its FFAT motif (two phenylalanines on an acidic tract), ultimately activating ER-localized Sac1 to reduce PI levels.
The VAMP-associated proteins (VAPs) are highly conserved integral ER membrane proteins involved in different cellular functions. They localize to the ER, and their ability to interact with multiple lipid-transfer, lipid-binding or lipid-sensing proteins containing the FFAT motif, suggests that VAPs have a role in lipid transport at the MCSs. Scs2 interacts with Osh1, Osh2 and Osh3. Different VAPs may be the partners at contact sites between different organelles.
Calcium homeostasis
PM-ER contact sites have a well known role in the control of calcium dynamics. The major intracellular pool of calcium is the ER and its release may be triggered by different stimuli. In excitable cells the coupling between PM depolarization and the release from the intracellular pools is essential to generate the Ca2+ signalling. In muscle cells, at the triad, junctophilin, an integral ER membrane protein, is involved in ER-PM contact stabilization by interacting with PIPs in the PM. In these contact sites, voltage-gated Ca2+ channels (VGCCs) activate closely apposed ryanodine receptors expressed on the ER to trigger calcium release during excitation-contraction coupling.
However, calcium levels need to be tightly controlled in all cell types. Non-excitable cells regulate calcium influx through PM calcium channels by sensing luminal ER calcium levels (the Calcium Release Activated Channels). ORAI1 is a molecular component of the CRAC, and it interacts with STIM1 an ER protein. STIM1 can rapidly translocate to a PM-ER contact site after depletion of the ER stores.
Mitochondria - endoplasmic reticulum contact sites
Contact sites between the outer mitochondrial membrane and the ER is present in many organisms. About 100 of these contact sites exist between the ER and mitochondria per yeast cell. The fraction of ER that co-purifies with mitochondria, the so-called Mitochondria-associated endoplasmic reticulum membrane (MAM) has been extensively studied during the last decade. In the "MAM hypothesis" it has been proposed that at the centre of the pathogenesis of Alzheimer's disease resides the disorder of ER-mitochondrial contact sites rather than Amyloid plaques or Neurofibrillary tangles.
Lipid biosynthesis
The presence of enzymes involved in phospholipid biosynthesis in MAM fraction is known since the 1970s, and the synthesis of some phospholipid is completed in both organelles. For instance, the biosynthetic pathway of phosphatidylcholine involves different steps some on the ER and some on the inner mitochondrial membrane. Connerth et al. identified Ups1 as a yeast LTP that can shuttle phosphatidic acid (PA) between mitochondrial membranes: they showed that effective lipid transfer required the interaction of Ups1 with Mdm35 to convert phosphatidic acid into cardiolipin in the inner membrane. Furthermore, they suggested the existence of a regulatory feedback mechanism that limits the accumulation of cardiolipin in mitochondria: high cardiolipin concentrations have the final results to inhibit its synthesis and the mitochondrial import of PA. Another study by Lahiri et al. has demonstrated that loss of contacts between the ER and mitochondria results in severe reduction in mitochondrial biosynthesis of phosphatidylethanolamine (PE) due to reduction in transport of phosphatidylserine (PS), which is the precursor for PE synthesis.
See also
Secretory pathway
Lipid metabolism
Lipid bilayer fusion
References
Membrane biology
Cell anatomy |
SS Arratoon Apcar was an iron-hulled steamship built in 1861 for the Apcar Line. She ran ashore on Fowey Rocks off the coast of Florida on 17 February 1878, was abandoned 3 days later, and broke apart. Today the wreck is a good location for scuba diving.
Construction and service
SS Arratoon Apcar was built in Renfrew, Scotland by James Henderson and Son.
The ship was powered by a 250 hp steam engine, with an iron hull. She was long, wide and measured .
She was launched on 27 June 1861.
She was named after the founder of Apcar and Company of Bombay, India, for whom she was built.
In 1872 the Apcar family purchased a considerably larger ship that they also called Arratoon Apcar, selling the older ship to H.F. Swan Company.
Wreck
SS Arratoon Apcar was en route from Havana, Cuba to Liverpool, England when she ran aground on 17 February 1878 on Fowey Rocks,
due to a miscalculation by Captain Pottinger.
The reef had already claimed other ships.
Several workmen were camped on a platform on the new screw pilings of the Fowey Rocks Light that they were building on the rocks.
They were almost hit by the ship, which was stopped by the rocks only away.
The crew of the ship spent three days trying to pump her out before abandoning her and heading for the shore in their lifeboats.
The captain and his complete crew of 24 men were picked up by the Tappahannock.
Foul weather pushed the ship onto the reef, pounding her on the rocks.
The ship broke up and was a total loss by 12 March 1878.
Mistaken identity
The wreck now tentatively identified as the Arratoon Apcar was known for many years as the Arakanapka, and is so called in books and on various dive-related web sites.
Today
The wreck now lies in of water near the Fowey Rocks.
The lower hull and irons beams of the ship are still visible, encrusted with coral, and there are some remains of other parts of the ship.
There are many fish, and with shallow water the location provides an excellent site for snorkeling or diving.
However, the shallow waters near the reef may create strong surges that could damage a boat.
The Arratoon Apcar is one of five historic wrecks in the Biscayne National Park "Shipwreck Trail".
References
Citations
Sources
Ships built on the River Clyde
1861 ships
Shipwrecks of the Florida coast
Wreck diving sites in the United States
Biscayne National Park
Maritime incidents in February 1878 |
Ormaniçi can refer to the following villages in Turkey:
Ormaniçi, Adıyaman
Ormaniçi, Sındırgı |
In England, Wales and Northern Ireland, school governors are the overseers of a school. In state schools, they have three main functions:
Giving the school a clear vision, ethos and strategic direction
Holding the headteacher to account for the educational performance of the school and its pupils
Overseeing the financial performance of the school and making sure its money is well spent.
They are the largest volunteer force in the country.
State schools
Composition
In England, Wales and Northern Ireland, every state school has a governing body, consisting of specified numbers of various categories of governors depending on the type and size of school. Governors are unpaid, but they may be reimbursed for expenses for such as the care of dependants or relatives and travel costs. Under section 50 of the Employment Rights Act 1996, employers must give anyone in their employment who serves as a governor reasonable time off their employ to carry out their governor duties. Employers can decide whether this time off is given with or without pay.
Generally, the following categories are applicable:
Parent governors: parents of children at the school;
Staff governors: members of the school staff;
Authority governors (previously known as LEA governors): nominated by the local education authority;
Co-opted governors (previously known as community governors): members of the local community (appointed by the rest of the governing body);
Foundation, partnership and sponsor governors: representatives of any sponsoring bodies.
The proportions vary between differing types of school, but as an example, in community schools, which are usually owned by the LEA, the regulations prescribe that parent governors should be at least one-third of the governors, staff governors at least two places, but no more than one-third, including the headteacher; LEA governors 20% and community governors at least 20%. Church schools will typically include a representative of the church in addition to the above categories. The minimum number of governors is nine, the maximum is twenty (although sponsor governors are additional to these numbers). Governors are appointed for a maximum of four years, this term is renewable.
The headteacher of each school is ex officio a staff governor, but can decline to take up the position. Should they decide not to become a member of the governing body, their place is left vacant.
Staff governors (other than the head teacher) are elected by the school staff and must be paid to work at the school, directly by the school (that is, not under an external contract such as catering or cleaning). At least one staff governor must be a teacher, and if there are three or more staff governors, at least one must be a member of the support staff. If no member of the appropriate category stands for election, the vacant place can be filled by an elected person from the other category (i.e. if no teachers wish to become governors, all staff governors may be support staff, and vice versa).
Parent governors can either be elected by parents of children at the school, or if insufficient numbers are elected, can be appointed by the governing body to fill any remaining vacancies. Such appointees need not be parents of children currently attending the school – if no suitable candidates are found, they may be parents of former pupils, or of any child of school age. Parents so appointed can be removed from their positions by a majority vote of the governing body.
Associate members may be appointed by the governing body as members of committees, and may include pupils, school staff, or anyone else who the governing body feel could contribute to its work. Their voting rights are decided by the governing body, and are also limited by law to exclude matters concerning the budget, admissions, pupil discipline and the election or appointment of governors. Associate members are not governors and are not included in the school's instrument of government.
By law, governing bodies meet at least three times every year, as a full governing body, where the ongoing business of committees, the governing body and the school are discussed, reported on and where decisions are taken by a majority vote. Most of the work of governors, however, is done at committee level.
Chair
The governing body is led by the chair, elected by the governing body from within its membership, though anyone who works at the school cannot stand for the office. Since 1 September 2003, the term of office for the chair can be set to more than one year.
The chair is supported in their work by one or more vice chairs, who may be delegated certain tasks or responsibilities. Certain tasks, including signing-off the school budget, can only be done by the chair. The process for election of chair and vice-chair and their term of office should be laid down in the governing body's standing orders.
The full governing body can remove the chair or any vice chairs by a majority vote of no confidence.
Clerk
The governors are supported in their work by a clerk to the governing body. In many schools this role is combined with that of bursar or administrative officer, although they may also be employed solely in a clerking role. In some areas clerking services may be provided by the local education authority. The clerk is remunerated for their work.
The clerk is usually considered an integral part of the governing body, giving advice whilst not entitled to vote. Their role is primarily one of providing advice and interpretation on the regulatory and administrative framework in which governors work, preparing and distributing minutes and agendas, keeping records and dealing with correspondence.
Responsibilities
The headteacher of the school is responsible for day-to-day management of the school. The role of the governing body is to provide strategic management, and to act as a "critical friend", supporting the work of the headteacher and other staff.
Schools generally have a delegated budget to cover salaries, running costs, maintenance and equipment; the governing body is responsible for managing this budget. They can decide how many and what types of staff to employ, which equipment to upgrade or replace and what the priorities are for implementing new strategies and initiatives.
Governors must appoint the headteacher, and may be involved in the appointment of other staff.
Governors also have a role in monitoring the school's progress, and in setting annual targets for the school's performance and for the headteacher (and ensuring that the headteacher sets targets for other staff).
Governors must review school exclusions in certain circumstances, and have the power to reinstate an excluded pupil or reduce the term of the exclusion (although not to increase it).
Foundation schools, voluntary aided schools and academies act as their own admissions authorities. In such schools, the governing body sets the admissions policy, makes admissions decisions and defends admissions appeals.
Committees
Most governing bodies use a committee structure to undertake their monitoring and evaluation roles. Membership and terms of reference of committees must be determined annually. Finance, staffing, admissions, health and safety, curriculum and premises committees are very common. Other areas covered by committees may include marketing, discipline and management. Many governing bodies form working groups to tackle specific problems.
Since 1 September 2003, particular committees can be given delegated powers to make decisions about the school that do not then require any approval by the full governing body
Training
Governors and clerks can be offered training and support either by the local authority, by central government or by other organisations.
Support organisations
There are a number of organisations, websites and resources that support governors and governing bodies in England and Wales.
The Key for School Governors is a subscription service which provides up-to-the-minute intelligence and resources to support governing boards. In addition to e-learning and online tools like Compliance Tracker, The Key offers free online governor induction in partnership with Governors for Schools and Lloyd's Banking Group.
The National Governors' Association is a representative body for school governors in England. The NGA is an independent charity. Governors can join the NGA as individuals, as members of a governing body, or through their local governors' association.
Governor Wales is the voice of governors of schools in Wales. Governor Wales is funded by the Welsh Government.
Governors for Schools is a government funded charity tasked with recruiting governors for governing bodies in England. Governors for Schools also receives support from business organisations. The Governors for Schools service is free to local education authorities, volunteers, employers and schools. In 2012, Governors for Schools began a partnership with the University of Manchester to ensure local schools have access to skilled governors.
GovernorLine offers free, confidential advice, information and support to school governors, clerks and individuals involved directly in the governance of maintained schools in England. GovernorLine is a free service delivered by an organisation called WorkLife Support, under contract to the UK government.
GovernorNet.co.uk was a UK government website with information for school governors. It was closed by the Department for Education in April 2011, with a recommendation to governors to use the variety of forums that are available including UK Governors and TES Connect.
Independent schools
Private schools, and public schools in particular, generally have governing bodies, although by their very nature, such schools usually decide on their own requirements for their composition.
Research
A study published in 1995 examined whether school governors were bodies of 'active citizens' providing opportunities for democratic participation in the governance of schools, or unpaid volunteers doing the bidding of the state. It also found that the composition and functioning of governing bodies was shaped by the social divisions of class, race and gender.
See also
School board
References
External links
Education in the United Kingdom
Education and training occupations
Governor, school |
```python
# Owner(s): ["oncall: distributed"]
import torch
from torch.distributed.checkpoint._nested_dict import (
flatten_state_dict,
unflatten_state_dict,
)
from torch.testing._internal.common_utils import run_tests, TestCase
class TestFlattening(TestCase):
def test_flattening_round_trip(self) -> None:
state_dict = {
"key0": 1,
"key1": [1, 2],
"key2": {"1": 2, "2": 3},
"key3": torch.tensor([1]),
"key4": [[torch.tensor(2), "x"], [1, 2, 3], {"key6": [44]}],
}
flatten_dict, mapping = flatten_state_dict(state_dict)
"""
flatten_dict:
{
'key0': 1,
'key1': [1, 2],
'key2': {'1': 2, '2': 3},
'key3': tensor([1]),
'key4.0.0': tensor(2),
'key4.0.1': 'x',
'key4.1': [1, 2, 3],
'key4.2': {'key6': [44]}
}
"""
restored = unflatten_state_dict(flatten_dict, mapping)
self.assertEqual(state_dict, restored)
def test_mapping(self) -> None:
state_dict = {
"k0": [1],
"k2": [torch.tensor([1]), 99, [{"k3": torch.tensor(1)}]],
"k3": ["x", 99, [{"k3": "y"}]],
}
flatten_dict, mapping = flatten_state_dict(state_dict)
"""
flatten_dict:
{'k0': [1], 'k2.0': tensor([1]), 'k2.1': 99, 'k2.2.0.k3': tensor(1), 'k3': ['x', 99, [{'k3': 'y'}]]}
mapping:
{'k0': ('k0',), 'k2.0': ('k2', 0), 'k2.1': ('k2', 1), 'k2.2.0.k3': ('k2', 2, 0, 'k3'), 'k3': ('k3',)}
"""
self.assertEqual(("k0",), mapping["k0"])
self.assertEqual(("k2", 0), mapping["k2.0"])
self.assertEqual(("k2", 1), mapping["k2.1"])
self.assertEqual(("k2", 2, 0, "k3"), mapping["k2.2.0.k3"])
self.assertEqual(("k3", 0), mapping["k3.0"])
self.assertEqual(("k3", 1), mapping["k3.1"])
self.assertEqual(("k3", 2, 0, "k3"), mapping["k3.2.0.k3"])
if __name__ == "__main__":
run_tests()
``` |
Anomocala is a monotypic moth genus of the family Noctuidae. Its only species, Anomocala hopkinsi, is known from Samoa. Both the genus and the species were first described by Tams in 1935.
References
Catocalinae
Noctuoidea genera
Monotypic moth genera |
Animal World (Spanish original title: Mundo animal, 1952) is a collection of short stories written by Antonio di Benedetto, with hallucinatory animal transformations by the internationally acknowledged Argentine master.
Summary
Written in conversational and even intentionally awkward language, they present a confused and troubled narrator, who, tormented by mysterious gnawings of guilt, becomes involved in some obscure way with an animal or whole group of animals. They invade his soul, drive him to rage or deliver him from his obsession. Often the story hinges on a pun, a distorted folktale, or an illogical association. While not spectacular in itself, each story adds to the preceding to create a growing sense of doom. Thus story by story the reader becomes ensnared in a horrifying, hallucinatory realm of associations.
Editions
Translated from Spanish by H. E. Francis, with an Afterword by Jorge García-Gómez. Grand Terrace, CA: Xenos Books. (paper), 138 p. [With cover art by Peter Zokosky.]
References
Argentine short story collections
1952 short story collections |
Mason Anthony Holgate (born 22 October 1996) is an English professional footballer who plays as a centre-back for EFL Championship club Southampton, on loan from club Everton. Born in England, Holgate is eligible to play for Jamaica through family heritage.
Club career
Barnsley
Holgate was born in Doncaster, South Yorkshire and joined Barnsley at the age of nine.
Having progressed through the club's academy and reserve team, Holgate signed his first professional contract, keeping him at Barnsley until 2016. He made his League One debut for Barnsley on 2 December 2014, playing the full ninety minutes of a 1–1 draw with Doncaster Rovers at Oakwell. Following this, the club were determined to negotiate a longer-term contract for Holgate. After inclusion in the first team, Holgate scored his first Barnsley goal, in a 5–0 win over Rochdale in the last game of the season.
Following a successful debut season at Barnsley, Holgate was named 2014–15 Young Player of the Year. In addition to this award, press speculation linked Holgate with a number of Premier League clubs; in July 2015, he went on trial at Manchester United.
Everton
On 13 August 2015, Holgate signed a five-year deal to join Premier League side Everton for a reported fee of £2 million. On 13 August 2016, a year after he signed for the club, Holgate made his Premier League debut in the 1–1 draw with Tottenham Hotspur. After Séamus Coleman suffered a broken leg in a World Cup qualifier match in March 2017, which caused him to be missing for nearly a year, Holgate was selected by Ronald Koeman as a replacement at the right back position for the latter part of the season.
On 29 October 2019, Holgate scored his first goal for the club in a 2–0 victory against Watford in the EFL Cup after he nodded in a cross by Theo Walcott.
Following the arrival of Carlo Ancelotti, Holgate established himself as a regular centre back at Everton, although he was deployed as a defensive midfielder on some occasions. During the 2019–20 season, he made 32 appearances for the Toffees in all competition, including 27 in the league.
Holgate was injured in a pre-season game with Preston North End, which kept him out of action for two months. He was named as captain for a home game against Leeds United on 28 November 2020, a game which Everton went on to lose 1–0. On 16 December 2020, he scored his first Premier League goal in a 2–0 away win against Leicester City.
West Bromwich Albion (loan)
On 31 December 2018, Holgate joined Championship side West Bromwich Albion on loan until the end of the season.
Southampton (loan)
On 25 August 2023, Holgate joined Championship side Southampton on a season-long loan. He made his debut for the club on 2 September 2023 in a 5–0 defeat to Sunderland.
International career
Holgate is of Jamaican descent through his grandparents, and is eligible to represent both England and Jamaica internationally. Holgate was the starting right-back for England under-21 during the 2017 UEFA European Under-21 Championship in June 2017.
Holgate said in an interview with The Voice in March 2020 that he would be open to representing the Jamaica national team, though he had not put much thought into his international future. However, he also said in an interview to Sky Sports the same month that he wanted to be called up to England, stating: "Everybody wants to play for England. When you're a kid, that's the ultimate, but it's down to me to decide that through playing well for Everton".
Despite being born in England and his previous England caps, in March 2021 it was reported that Holgate would be called up to the Jamaica national team, as part of a plot by the Jamaican Football Federation to purposely call up a number of English players in order to improve the nation's chances of qualifying for the 2022 World Cup. JFF president Michael Ricketts said that Holgate was applying for a Jamaican passport in order to play for the side. However, he was not one of the six England-born players called up to Jamaica for the first time for the match against the United States on 25 March 2021.
Career statistics
Club
References
External links
Profile at the Everton F.C. website
1996 births
Living people
Footballers from Doncaster
English men's footballers
England men's youth international footballers
England men's under-21 international footballers
Men's association football defenders
Barnsley F.C. players
Everton F.C. players
Southampton F.C. players
English Football League players
Premier League players
English people of Jamaican descent
West Bromwich Albion F.C. players |
Alice Bellvadore Sams Turner (or Sams-Turner; also known as Alice B. S. Turner; March 13/18, 1859 – July 10, 1915) was an American physician, who also taught school, and was a frequent contributor to the public press. She graduated with the Class of 1884 from the Keokuk College of Physicians and Surgeons as an allopathic doctor. Turner practised medicine in Colfax, Iowa, from March, 1884. She was a member of the Iowa State Medical Society; Iowa Public Health Association, having been the first woman admitted to membership, in 1890, of the State Library Association; Colfax Public Library Association, secretary four years, 1893–97; Chautauqua Literary and Scientific Circle; Woman's Christian Temperance Union; Woman's Relief Corps; Rathbone Sisters; and was health officer of Colfax, 1886–87.
Early life and education
Alice Bellvadore Sams was born near Mingo, Iowa, Turner was the daughter of John and Evaline (Humphreys) Sams, the former the son of Edmund and Sarah Sams, and her mother was the daughter of Moses and Rebecca (Boyd) Humphreys. Both her grandfathers served in the war of 1812 with the Tennessee troops. John Sams was born in Sullivan County, Tennessee, in 1813 and there he spent his boyhood, moving to Logan County, Illinois, in 1833, when that country was practically a wilderness. From there he came to Jasper County, Iowa, in 1853 and again began life as a pioneer. He first married Mary Vandevender, who was born in Virginia in 1834 and her death occurred in 1851, leaving three children, David E.. Margaret and Sarah. In 1852, while a resident of Logan County, Illinois, he married Evaline (Humphreys) Hilton, who was born May 10, 1824, in eastern Tennessee. To this marriage, four children were born: Alfred, Emily, Alice, and Francis M. John Sams, born January 8, 1813, was a successful farmer, in fact, for many years he was one of the leading agriculturists of the county, being the owner of about there. He was influential in the affairs of his community, serving as township trustee and school director. He was an active Democrat. His death occurred on April 9, 1891, his widow surviving until August 19, 1902.
Her paternal grandparents, Moses and Rebecca (Boyd) Humphreys, were natives of Carter County, Tennessee, and in an early day, they moved to Logan County, Illinois, where they lived until 1853, when they came to Jasper County. Iowa, thus starting life twice under pioneer conditions, and here they spent the rest of their lives.
Turner grew up and received her common school training in her home community, where she also assisted in household duties until 1873. Her preparatory education was obtained at Lincoln (Illinois) University; Simpson College, Indianola, Iowa; and Mitchell Seminary, Mitchellville, Iowa. From 1873 until 1878, she was alternately engaged as teacher and pupil, teaching in school in Jasper and Shelby counties.
Career
On October 21, 1878, she married Lewis C. S. Turner (d. May 18, 1915). He was struggling to make a career in the field of education. The first year after their marriage, they were engaged in teaching, and the next year they became students again. Her husband gave instruction in penmanship and drawing, which paid for their books and tuition. Turner, besides her school work, superintended and did a great portion of the work herself for boarders among their classmates, thus helping further to defray expenses. In 1880, in their last year's classes, the school building where they were studying, in Mitchellville, Iowa, was sold for a State industrial institution, and they had to relinquish their goals.
In 1880, she began to study medicine under J. J. M. Angear, M.D. She took three courses of lectures at the College of Physicians and Surgeons in Keokuk, Iowa. There, in addition to their school work, the husband and wife held the positions of steward and matron of the hospital for one year. In October, 1881, a daughter was born to them. Turner entered her class when her infant was a month old, and was graduated in February, 1884, with high ranking.
Both having graduated with medical degrees, they went to Colfax, Iowa in 1884, where they enjoyed a large and lucrative practice, with the exception of two years, from 1898 to 1900, inclusive, spent in Chicago. Besides their general practice, they established an infirmary for the cure of inebriety, the Turner Rest Home and Sanitarium.
Turner was an honorary member of the Jasper County Medical Society and a member of the State Society of Iowa Medical Women. She identified with everything that stood for the betterment of humanity, and was a woman of keen intellect and high literary attainments. She was the first woman admitted to membership in the Iowa Health and Protective Association, and was the first woman in Iowa to serve in the capacity of health officer which place she occupied during 1886 and 1887.
Turner was one of the founders of the Colfax Free Public Library. She served on the board of trustees for a number of years and had been president of the board for the last twelve years of her life. Interested in all that pertains to society and state, she maintained a regular clipping bureau and especially in connection with the life and history of Colfax and vicinity.
Turner was a frequent contributor to the public press. She also read many papers before literary and medical societies. Turner read a paper on “Physical Culture,” before the teachers' institute, February 21, 1885; “Hygiene of Bathing,” Chautauqua assembly, June 24, 1890; “Climacteric Period,” “Epileptic Mania,” “The Tongue in Health and Disease,” and “Mineral Acids,” before the Jasper County Medical Society, 1887–89.
Personal life
On July 24, 1874, Turner began keeping a diary, a daily record of transpiring events of interest through most of the rest of her life, and she induced her son and daughter to begin keeping a daily journal. These children were Vera (born October 2, 1881); and Carroll John Turner (born March 28, 1893). She died at her home in Colfax, July 10, 1915, from carcinoma of the breast.
Selected works
In memoriam : John Sams (1813-1891), Susan Evaline Sams (1824-1902)., 1902
Notes
References
Attribution
External links
1859 births
1915 deaths
19th-century American physicians
19th-century American non-fiction writers
19th-century American women writers
20th-century American physicians
20th-century American non-fiction writers
20th-century American women writers
20th-century American women physicians
19th-century American women physicians
People from Jasper County, Iowa
Physicians from Iowa
American magazine editors
Women magazine editors
Medical journal editors
Deaths from cancer in Iowa
Woman's Christian Temperance Union people
American women non-fiction writers
Wikipedia articles incorporating text from A Woman of the Century |
Gorgia Delves, known professionally and performs under the stage moniker of Georgia State Line, is an Australian singer and songwriter. Georgia State Line released their debut studio album In Colour in September 2021.
Early life
Gorgia Delves was born and raised in Bendigo, Victoria, and sang in Catholic school choirs by day and performed in the local pub music scene by night. Delves later moved to Melbourne and formed a band.
Career
2016–2017: Career beginnings and Heaven Knowns
Delves and bandmate Patrick Wilson met while studying music at a university in Melbourne in 2014, forming both a romantic and professional relationship. In 2016, Delves and Wilson recruited an unofficial band to perform her songs.
In 2017, Georgia State Line released their debut single "Older Than I Am" which gained a four-star review from triple j Unearthed's Dave Ruby Howe. This was followed by the single "Heaven Knows" and an EP of the same name, which was released in July 2017.
2018–present: In Colour
Several singles were released between 2018 and 2020. In September 2021, Georgia State Line released their debut studio album In Colour. The album was recorded by James Cecil in the Macedon Ranges and documents Delves' journey. Delves said "These songs really embody what it means to move through the pains and joy of inevitable change." In a 4 out of 5 star review, Cat Woods from NME said "In Colour is a fresh, Australian take on a time-honoured sound that harks back to the blues-and-rootsy Americana of the '50s and '60s."
The album was nominated for Best Country Album at the 2022 ARIA Music Awards.
Discography
Albums
Extended plays
Awards and nominations
ARIA Music Awards
The ARIA Music Awards is an annual awards ceremony that recognises excellence, innovation, and achievement across all genres of Australian music. They commenced in 1987.
!
|-
| 2022
| In Colour
| ARIA Award for Best Country Album
|
|
|-
Music Victoria Awards
The Music Victoria Awards, are an annual awards night celebrating Victorian music. They commenced in 2005.
!
|-
| 2021
| Georgia State Line
| Best Country Act
|
|
|-
| 2022
| Georgia State Line
| Best Country Work
|
|
|-
External links
References
Year of birth missing (living people)
21st-century Australian musicians
Living people
Musicians from Melbourne |
```c++
//
//
// path_to_url
//
// Unless required by applicable law or agreed to in writing, software
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
#include "ray/core_worker/lease_policy.h"
namespace ray {
namespace core {
std::pair<rpc::Address, bool> LocalityAwareLeasePolicy::GetBestNodeForTask(
const TaskSpecification &spec) {
if (spec.GetMessage().scheduling_strategy().scheduling_strategy_case() ==
rpc::SchedulingStrategy::SchedulingStrategyCase::kSpreadSchedulingStrategy) {
// The explicit spread scheduling strategy
// has higher priority than locality aware scheduling.
return std::make_pair(fallback_rpc_address_, false);
}
if (spec.IsNodeAffinitySchedulingStrategy()) {
// The explicit node affinity scheduling strategy
// has higher priority than locality aware scheduling.
if (auto addr = node_addr_factory_(spec.GetNodeAffinitySchedulingStrategyNodeId())) {
return std::make_pair(addr.value(), false);
}
return std::make_pair(fallback_rpc_address_, false);
}
// Pick node based on locality.
if (auto node_id = GetBestNodeIdForTask(spec)) {
if (auto addr = node_addr_factory_(node_id.value())) {
return std::make_pair(addr.value(), true);
}
}
return std::make_pair(fallback_rpc_address_, false);
}
/// Criteria for "best" node: The node with the most object bytes (from object_ids) local.
absl::optional<NodeID> LocalityAwareLeasePolicy::GetBestNodeIdForTask(
const TaskSpecification &spec) {
const auto object_ids = spec.GetDependencyIds();
// Number of object bytes (from object_ids) that a given node has local.
absl::flat_hash_map<NodeID, uint64_t> bytes_local_table;
uint64_t max_bytes = 0;
absl::optional<NodeID> max_bytes_node;
// Finds the node with the maximum number of object bytes local.
for (const ObjectID &object_id : object_ids) {
if (auto locality_data = locality_data_provider_->GetLocalityData(object_id)) {
for (const NodeID &node_id : locality_data->nodes_containing_object) {
auto &bytes = bytes_local_table[node_id];
bytes += locality_data->object_size;
// Update max, if needed.
if (bytes > max_bytes) {
max_bytes = bytes;
max_bytes_node = node_id;
}
}
} else {
RAY_LOG(WARNING) << "No locality data available for object " << object_id
<< ", won't be included in locality cost";
}
}
return max_bytes_node;
}
std::pair<rpc::Address, bool> LocalLeasePolicy::GetBestNodeForTask(
const TaskSpecification &spec) {
// Always return the local node.
return std::make_pair(local_node_rpc_address_, false);
}
} // namespace core
} // namespace ray
``` |
Casanay () is a town in the Sucre State, Venezuela. It is the shire town of the Andrés Eloy Blanco Municipality, Sucre.
External links
Casanay portal
Populated places in Sucre (state) |
Eugen Kamber (18 September 1924 – 1 March 1991) was a Swiss cyclist. He competed in the team pursuit event at the 1948 Summer Olympics.
References
External links
1924 births
1991 deaths
Swiss male cyclists
Olympic cyclists for Switzerland
Cyclists at the 1948 Summer Olympics
People from Solothurn
Sportspeople from the canton of Solothurn
Tour de Suisse stage winners |
Kham Karabad-e Galleh Tavak (, also Romanized as Kham Kārābād-e Galleh Tavak; also known as Kham Kārābād) is a village in Qaleh-ye Khvajeh Rural District, in the Central District of Andika County, Khuzestan Province, Iran. In the 2006 census, its recorded population was 202, including 39 families.
References
Populated places in Andika County |
The Port of Mokpo() is a port in South Korea, located in the city of Mokpo, South Jeolla Province.
References
Mokpo |
Cynthia Preston, sometimes credited as Cyndy Preston (born May 18, 1968), is a Canadian actress.
Life and career
Preston was born in Toronto, Ontario. She made her screen debut in the 1986 television film Miles to Go... playing Jill Clayburgh' daughter. She appeared in a number of Canadian television dramas the following years, include Night Heat, Diamonds, The Hitchhiker, and Street Legal. She played the female leading roles in horror films Pin (1988), (1988), and Prom Night III: The Last Kiss (1989).
Preston starred in the 1994 award-winning comedy-drama film Whale Music opposite Maury Chaykin. In 1999, she starred in the Showtime science fiction series Total Recall 2070 alongside Michael Easton. The series was canceled after single season of 22 episodes. She guest-starred on The X-Files, Andromeda, CSI: Crime Scene Investigation, Two and a Half Men, Bones, Flashpoint and Hannibal. From 2002 to 2005, she played Faith Rosco in the American daytime soap opera General Hospital.
Preston appeared in the 2013 supernatural horror film Carrie directed by Kimberly Peirce. She starred in a more than ten Lifetime television movies, including The Love of Her Life (2008), Dead at 17 (2008), A Sister's Secret (2009), The Wife He Met Online (2012), A Nanny's Revenge (2012), The Secret Sex Life of a Single Mom (2014), Stalked by a Reality Star (2018), and The Cheerleader Escort (2019).
Filmography
References
External links
Biography of Cynthia Preston
Canadian film actresses
Canadian soap opera actresses
Canadian television actresses
Canadian voice actresses
Living people
20th-century Canadian actresses
21st-century Canadian actresses
1968 births
Canadian expatriates in the United States |
```c
/*
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES WITH
* REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
* AND FITNESS. IN NO EVENT SHALL ISC BE LIABLE FOR ANY SPECIAL, DIRECT,
* INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
* LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE
* OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
* PERFORMANCE OF THIS SOFTWARE.
*/
/* $Id: a_1.c,v 1.13 2020/09/14 08:40:43 florian Exp $ */
/* by Bjorn.Victor@it.uu.se, 2005-05-07 */
/* Based on generic/soa_6.c and generic/mx_15.c */
#ifndef RDATA_CH_3_A_1_C
#define RDATA_CH_3_A_1_C
static inline isc_result_t
totext_ch_a(ARGS_TOTEXT) {
isc_region_t region;
dns_name_t name;
dns_name_t prefix;
int sub;
char buf[sizeof("0177777")];
uint16_t addr;
REQUIRE(rdata->type == dns_rdatatype_a);
REQUIRE(rdata->rdclass == dns_rdataclass_ch); /* 3 */
REQUIRE(rdata->length != 0);
dns_name_init(&name, NULL);
dns_name_init(&prefix, NULL);
dns_rdata_toregion(rdata, ®ion);
dns_name_fromregion(&name, ®ion);
isc_region_consume(®ion, name_length(&name));
addr = uint16_fromregion(®ion);
sub = name_prefix(&name, tctx->origin, &prefix);
RETERR(dns_name_totext(&prefix, sub, target));
snprintf(buf, sizeof(buf), "%o", addr); /* note octal */
RETERR(isc_str_tobuffer(" ", target));
return (isc_str_tobuffer(buf, target));
}
static inline isc_result_t
fromwire_ch_a(ARGS_FROMWIRE) {
isc_region_t sregion;
isc_region_t tregion;
dns_name_t name;
REQUIRE(type == dns_rdatatype_a);
REQUIRE(rdclass == dns_rdataclass_ch);
UNUSED(type);
UNUSED(rdclass);
dns_decompress_setmethods(dctx, DNS_COMPRESS_GLOBAL14);
dns_name_init(&name, NULL);
RETERR(dns_name_fromwire(&name, source, dctx, options, target));
isc_buffer_activeregion(source, &sregion);
isc_buffer_availableregion(target, &tregion);
if (sregion.length < 2)
return (ISC_R_UNEXPECTEDEND);
if (tregion.length < 2)
return (ISC_R_NOSPACE);
memmove(tregion.base, sregion.base, 2);
isc_buffer_forward(source, 2);
isc_buffer_add(target, 2);
return (ISC_R_SUCCESS);
}
static inline isc_result_t
towire_ch_a(ARGS_TOWIRE) {
dns_name_t name;
dns_offsets_t offsets;
isc_region_t sregion;
isc_region_t tregion;
REQUIRE(rdata->type == dns_rdatatype_a);
REQUIRE(rdata->rdclass == dns_rdataclass_ch);
REQUIRE(rdata->length != 0);
dns_compress_setmethods(cctx, DNS_COMPRESS_GLOBAL14);
dns_name_init(&name, offsets);
dns_rdata_toregion(rdata, &sregion);
dns_name_fromregion(&name, &sregion);
isc_region_consume(&sregion, name_length(&name));
RETERR(dns_name_towire(&name, cctx, target));
isc_buffer_availableregion(target, &tregion);
if (tregion.length < 2)
return (ISC_R_NOSPACE);
memmove(tregion.base, sregion.base, 2);
isc_buffer_add(target, 2);
return (ISC_R_SUCCESS);
}
#endif /* RDATA_CH_3_A_1_C */
``` |
Poylu is a village and municipality in the Samukh Rayon of Azerbaijan. It has a population of 568.
References
Populated places in Samukh District |
```objective-c
#ifndef STRINGLIB_UNICODEDEFS_H
#define STRINGLIB_UNICODEDEFS_H
/* this is sort of a hack. there's at least one place (formatting
floats) where some stringlib code takes a different path if it's
compiled as unicode. */
#define STRINGLIB_IS_UNICODE 1
#define STRINGLIB_OBJECT PyUnicodeObject
#define STRINGLIB_CHAR Py_UNICODE
#define STRINGLIB_TYPE_NAME "unicode"
#define STRINGLIB_PARSE_CODE "U"
#define STRINGLIB_EMPTY unicode_empty
#define STRINGLIB_ISSPACE Py_UNICODE_ISSPACE
#define STRINGLIB_ISLINEBREAK BLOOM_LINEBREAK
#define STRINGLIB_ISDECIMAL Py_UNICODE_ISDECIMAL
#define STRINGLIB_TODECIMAL Py_UNICODE_TODECIMAL
#define STRINGLIB_TOUPPER Py_UNICODE_TOUPPER
#define STRINGLIB_TOLOWER Py_UNICODE_TOLOWER
#define STRINGLIB_FILL Py_UNICODE_FILL
#define STRINGLIB_STR PyUnicode_AS_UNICODE
#define STRINGLIB_LEN PyUnicode_GET_SIZE
#define STRINGLIB_NEW PyUnicode_FromUnicode
#define STRINGLIB_RESIZE PyUnicode_Resize
#define STRINGLIB_CHECK PyUnicode_Check
#define STRINGLIB_CHECK_EXACT PyUnicode_CheckExact
#define STRINGLIB_GROUPING _PyUnicode_InsertThousandsGrouping
#if PY_VERSION_HEX < 0x03000000
#define STRINGLIB_TOSTR PyObject_Unicode
#else
#define STRINGLIB_TOSTR PyObject_Str
#endif
#define STRINGLIB_WANT_CONTAINS_OBJ 1
#endif /* !STRINGLIB_UNICODEDEFS_H */
``` |
Salla Sportive Bathore is a purpose-built basketball arena built in 2013 in Bathore, Tirana, Albania. It is the home of BC Kamza Basket and is owned by the Kamëz Municipality.
History
The first game at the arena was held on 22 March 2013 between BC Kamza Basket and BC Teuta Durrës, where tickets were free in order to sell out all 400 seats.
References
Indoor arenas in Albania
Basketball venues in Albania
Indoor track and field venues
Buildings and structures in Kamëz |
```go
package main
import (
"context"
"fmt"
"os"
"path/filepath"
abci "github.com/cometbft/cometbft/api/cometbft/abci/v1"
"github.com/hashicorp/go-plugin"
streamingabci "cosmossdk.io/store/streaming/abci"
store "cosmossdk.io/store/types"
)
// FilePlugin is the implementation of the baseapp.ABCIListener interface
// For Go plugins this is all that is required to process data sent over gRPC.
type FilePlugin struct {
BlockHeight int64
}
func (a *FilePlugin) writeToFile(file string, data []byte) error {
home, err := os.UserHomeDir()
if err != nil {
return err
}
filename := fmt.Sprintf("%s/%s.txt", home, file)
f, err := os.OpenFile(filepath.Clean(filename), os.O_APPEND|os.O_CREATE|os.O_WRONLY, 0o600)
if err != nil {
return err
}
if _, err := f.Write(data); err != nil {
f.Close() // ignore error; Write error takes precedence
return err
}
if err := f.Close(); err != nil {
return err
}
return nil
}
func (a *FilePlugin) ListenFinalizeBlock(ctx context.Context, req abci.FinalizeBlockRequest, res abci.FinalizeBlockResponse) error {
d1 := []byte(fmt.Sprintf("%d:::%v\n", a.BlockHeight, req))
d2 := []byte(fmt.Sprintf("%d:::%v\n", a.BlockHeight, req))
if err := a.writeToFile("finalize-block-req", d1); err != nil {
return err
}
if err := a.writeToFile("finalize-block-res", d2); err != nil {
return err
}
return nil
}
func (a *FilePlugin) ListenCommit(ctx context.Context, res abci.CommitResponse, changeSet []*store.StoreKVPair) error {
fmt.Printf("listen-commit: block_height=%d data=%v", res.RetainHeight, changeSet)
d1 := []byte(fmt.Sprintf("%d:::%v\n", a.BlockHeight, res))
d2 := []byte(fmt.Sprintf("%d:::%v\n", a.BlockHeight, changeSet))
if err := a.writeToFile("commit-res", d1); err != nil {
return err
}
if err := a.writeToFile("state-change", d2); err != nil {
return err
}
return nil
}
func main() {
plugin.Serve(&plugin.ServeConfig{
HandshakeConfig: streamingabci.Handshake,
Plugins: map[string]plugin.Plugin{
"abci": &streamingabci.ListenerGRPCPlugin{Impl: &FilePlugin{}},
},
// A non-nil value here enables gRPC serving for this streaming...
GRPCServer: plugin.DefaultGRPCServer,
})
}
``` |
```java
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package com.google.android.material.theme;
import android.content.Context;
import androidx.appcompat.app.AppCompatViewInflater;
import androidx.appcompat.widget.AppCompatAutoCompleteTextView;
import androidx.appcompat.widget.AppCompatButton;
import androidx.appcompat.widget.AppCompatCheckBox;
import androidx.appcompat.widget.AppCompatRadioButton;
import androidx.appcompat.widget.AppCompatTextView;
import android.util.AttributeSet;
import androidx.annotation.NonNull;
import androidx.annotation.Nullable;
import com.google.android.material.button.MaterialButton;
import com.google.android.material.checkbox.MaterialCheckBox;
import com.google.android.material.radiobutton.MaterialRadioButton;
import com.google.android.material.textfield.MaterialAutoCompleteTextView;
import com.google.android.material.textview.MaterialTextView;
/**
* An extension of {@link AppCompatViewInflater} that replaces some framework widgets with Material
* Components ones at inflation time, provided a Material Components theme is in use.
*/
public class MaterialComponentsViewInflater extends AppCompatViewInflater {
@NonNull
@Override
protected AppCompatButton createButton(@NonNull Context context, @NonNull AttributeSet attrs) {
return new MaterialButton(context, attrs);
}
@NonNull
@Override
protected AppCompatCheckBox createCheckBox(Context context, AttributeSet attrs) {
return new MaterialCheckBox(context, attrs);
}
@NonNull
@Override
protected AppCompatRadioButton createRadioButton(Context context, AttributeSet attrs) {
return new MaterialRadioButton(context, attrs);
}
@NonNull
@Override
protected AppCompatTextView createTextView(Context context, AttributeSet attrs) {
return new MaterialTextView(context, attrs);
}
@NonNull
@Override
protected AppCompatAutoCompleteTextView createAutoCompleteTextView(
@NonNull Context context, @Nullable AttributeSet attrs) {
return new MaterialAutoCompleteTextView(context, attrs);
}
}
``` |
Tore is a volcano located in the northern part of the island of Bougainville, Papua New Guinea. Violent Pleistocene eruptions produced two ignimbrite fans stretching west to the coast, and a 6 km by 9 km caldera. A post-caldera lava cone on the caldera's southern rim is the source of lava flows. Well-preserved features suggests a recent date for this cone and a nearby ash cone.
See also
List of volcanoes in Papua New Guinea
References
Mountains of Papua New Guinea
Volcanoes of Bougainville Island |
```smalltalk
using System.Net;
namespace DSharpPlus.Net;
/// <summary>
/// Represents a response sent by the remote HTTP party.
/// </summary>
public record struct RestResponse
{
/// <summary>
/// Gets the response code sent by the remote party.
/// </summary>
public HttpStatusCode? ResponseCode { get; internal set; }
/// <summary>
/// Gets the contents of the response sent by the remote party.
/// </summary>
public string? Response { get; internal set; }
}
``` |
In enzymology, a cystathionine gamma-synthase () is an enzyme that catalyzes the formation of cystathionine from cysteine and an activated derivative of homoserine, e.g.:
O4-succinyl-L-homoserine + L-cysteine L-cystathionine + succinate
In microorganisms, the activated substrate of this enzyme is O4-succinyl-L-homoserine or O4-acetyl-L-homoserine. Cystathionine gamma-synthase from plants uses L-homoserine phosphate instead.
This enzyme belongs to the family of transferases, specifically those transferring aryl or alkyl groups other than methyl groups. The systematic name of this enzyme class is O4-succinyl-L-homoserine:L-cysteine S-(3-amino-3-carboxypropyl)transferase. Other names in common use include O-succinyl-L-homoserine succinate-lyase (adding cysteine), O-succinylhomoserine (thiol)-lyase, homoserine O-transsuccinylase, O-succinylhomoserine synthase, O-succinylhomoserine synthetase, cystathionine synthase, cystathionine synthetase, homoserine transsuccinylase, 4-O-succinyl-L-homoserine:L-cysteine, and S-(3-amino-3-carboxypropyl)transferase. This enzyme participates in 4 metabolic pathways: methionine metabolism, cysteine metabolism, selenoamino acid metabolism, and sulfur metabolism. It employs one cofactor, pyridoxal phosphate.
References
EC 2.5.1
Pyridoxal phosphate enzymes
Enzymes of unknown structure |
```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.
*/
/* eslint-disable no-underscore-dangle */
'use strict';
// MODULES //
var logger = require( 'debug' );
var isString = require( '@stdlib/assert/is-string' ).isPrimitive;
var isPlainObject = require( '@stdlib/assert/is-plain-object' );
var hasOwnProp = require( '@stdlib/assert/has-own-property' );
var objectKeys = require( '@stdlib/utils/keys' );
var format = require( '@stdlib/string/format' );
var TUTORIALS = require( './../repl_docs.js' ).tutorial;
// VARIABLES //
var debug = logger( 'repl:command:tutorial' );
var HELP_TEXT;
// FUNCTIONS //
/**
* Returns tutorial help text.
*
* @private
* @returns {string} tutorial help text
*/
function help() {
var names;
var o;
var i;
if ( HELP_TEXT ) {
return HELP_TEXT;
}
names = objectKeys( TUTORIALS );
HELP_TEXT = '\n';
for ( i = 0; i < names.length; i++ ) {
o = TUTORIALS[ names[ i ] ];
HELP_TEXT += names[ i ] + '\n';
HELP_TEXT += ' ';
if ( o.desc ) {
HELP_TEXT += TUTORIALS[ names[ i ] ].desc;
} else {
HELP_TEXT += '(no description available)';
}
HELP_TEXT += '\n\n';
}
return HELP_TEXT;
}
// MAIN //
/**
* Returns a callback to be invoked upon calling the `tutorial` command.
*
* @private
* @param {REPL} repl - REPL instance
* @returns {Function} callback
*/
function command( repl ) {
return onCommand;
/**
* Starts a tutorial if provided a recognized tutorial name; otherwise, returns the list of available tutorials.
*
* @private
* @param {string} [name] - tutorial name
* @param {Options} [options] - tutorial options
* @param {string} [options.borderTop='*'] - top border character sequence
* @param {string} [options.borderBottom='*'] - bottom border character sequence
* @param {string} [options.borderLeft='* '] - left border character sequence
* @param {string} [options.borderRight=' *'] - right border character sequence
* @param {(boolean|string)} [options.counter='progress'] - slide counter
* @param {string} [options.workspace] - REPL workspace name
* @param {boolean} [options.autoClear=true] - boolean indicating whether to automatically clear the screen before writing a rendered slide to the REPL
* @returns {(NonNegativeInteger|void)} tutorial presentation identifier
*/
function onCommand( name, options ) {
var opts;
var err;
if ( arguments.length === 0 ) {
repl._ostream.write( help() );
return;
}
if ( !isString( name ) ) {
err = new TypeError( format( 'invalid argument. First argument must be a string. Value: `%s`.', name ) );
debug( 'Error: %s', err.message );
repl._ostream.write( 'Error: '+err.message+'\n' );
return;
}
if ( !hasOwnProp( TUTORIALS, name ) ) {
err = new Error( format( 'invalid argument. Unrecognized tutorial name. Value: `%s`.', name ) );
debug( 'Error: %s', err.message );
repl._ostream.write( 'Error: '+err.message+'\n' );
return;
}
debug( 'Tutorial: %s', name );
// Define default options:
opts = {
'borderTop': '*',
'borderBottom': '*',
'borderLeft': '* ',
'borderRight': ' *',
'autoClear': true,
'counter': 'progress',
'workspace': 'tutorial-'+name+'-'+(repl._internal.presentation.counter+1 )
};
// Handle user-provided options...
if ( arguments.length > 1 ) {
if ( !isPlainObject( options ) ) {
err = new TypeError( format( 'invalid argument. Options argument must be an object. Value: `%s`.', options ) );
debug( 'Error: %s', err.message );
repl._ostream.write( 'Error: '+err.message+'\n' );
return;
}
// Punt option validation to the presentation API...
if ( hasOwnProp( options, 'borderTop' ) ) {
opts.borderTop = options.borderTop;
}
if ( hasOwnProp( options, 'borderBottom' ) ) {
opts.borderBottom = options.borderBottom;
}
if ( hasOwnProp( options, 'borderLeft' ) ) {
opts.borderLeft = options.borderLeft;
}
if ( hasOwnProp( options, 'borderRight' ) ) {
opts.borderRight = options.borderRight;
}
if ( hasOwnProp( options, 'counter' ) ) {
opts.counter = options.counter;
}
if ( hasOwnProp( options, 'autoClear' ) ) {
opts.autoClear = options.autoClear;
}
if ( hasOwnProp( options, 'workspace' ) ) {
opts.workspace = options.workspace;
}
}
debug( 'Options: %s', JSON.stringify( opts ) );
debug( 'Starting tutorial...' );
return repl._context.presentationStart( TUTORIALS[ name ].text, opts );
}
}
// EXPORTS //
module.exports = command;
``` |
Rugby union in Montenegro is a minor but growing sport. The game has only recently been developed in the country since its independence in 2006. The governing body is the Montenegrin Rugby Union which was accepted as a member of Rugby Europe (previously FIRA-AER) at the 2014 convention held in Split, Croatia. It is not yet affiliated with World Rugby but is applying for membership.
History
Traditionally, international rugby matches were played as FR Yugoslavia until 2003, and then as Serbia and Montenegro from 2003 to 2006.
In 2011, the Porto Montenegro company started playing organised touch rugby games. Participation numbers grew and the players progressed to rugby sevens. By 2013 there were four rugby clubs in Montenegro. This was started by Beckett Tucker, Oliver Corlette and Malcolm Blaxall and coached by Milos Kucancanin, Rambo Morrison Tavana Faaletino, David Lowe and Marty Lusty A regional league began in 2014 and fixtures were also arranged with other teams around the former Yugoslavian countries.
Rugby has competition from other popular sports such as water polo, soccer, handball and mixed martial arts in Montenegro. Due to the small population of the country, the country is often competing against nations who have a larger population and larger player pool. The biggest rivalry in Montenegro is currently between the clubs Podgorica and Nikšić.
An official international sevens squad was named and sent to Greece for the ENC Division B competition in 2014 this was the first time an official national rugby team was sent by Montenegro.
The sport of rugby union really kicked off with the annual European Nation's Cup tournament in 2015 where the first official national side played their first match against Estonia in Bar, Montenegro. This was Montenegro first stint as an independent nation competing in rugby union and the first time the country played at home. The match ended as a win for Montenegro. The following match was a final against Slovakia and ended in defeat.
Montenegro hosted the ENC 3 competition on 15 to 21 May 2017. (Attended by Bulgaria and Slovakia to make it a three way tournament) The tournament ended with a loss to Slovakia and a win to Bulgaria which are World Rugby ranked opposition.
Montenegro played Turkey and Bulgaria in ENC 3 2018, with one game being at home and one being away. Montenegro lost to Bulgaria at home convincingly and put on a strong showing in Turkey narrowly losing buy a few points. At the sevens Montenegro put on a good showing but were unlucky not to win many games.
In the 2019 season Montenegro failed to take part in the ENC 3 against Turkey and Estonia but did well to secure a 12th place finish (out of 16 teams) at the sevens conference 1 held in Belgrade for 2019 and remain in the conference. As well two kids rugby programs were started in Podgorica and in Tivat. Which is a positive sign for the future that kids will be playing rugby earlier. As well positive news that rugby sevens will be making its debut at the GSSE in 2023 which is a stepping stone forward for smaller nations rugby programs.
Clubs
As of 2022, the following clubs participate actively rugby in Montenegro:
Inactive/defunct clubs
RK Budućnost
RK Krstaši
RK Lovćen
The club's above are currently inactive due to the failure to partake in regular matches this season.
National team
Montenegro's national teams are known as the Wolves (Vukovi). The country's first international rugby sevens matches were played in 2014 at the ENC Division B championship in Greece. The first match was against the favorites Switzerland, with the game ending with a final score of 15-36 to Switzerland. The team managed to win the bowl and get Montenegro's first achievement in rugby sevens. After a poor 2015 season where the team finished second to last the 2016 team had plenty to make up for. With that the team finished in the cup final with Malta and achieved promotion into Conference 1.
The Montenegro national 15-a-side team first played in April 2015 when the country hosted the European Nations Cup Division 3 Competition. On 10 April 2015 The Wolves played the first international match in the country's history, winning a thrilling encounter 29–27 against Estonia in Bar. In the Final Montenegro lost 31–3 against Slovakia in Budva.
Since then the team played in the second leg of that tournament by travelling up to Estonia to play the hosts Estonia. Estonia won, ending Montenegro's hope for promotion. The team defeated Belarus for their biggest ever victory in an international competition
For women's rugby it started off by an invitation to the Rugby Europe Division B tournament after the withdrawal of one of the teams in the tournament. They competed against favourites Denmark for their first match and lost heavily and were unlucky to not get a win in their debut tournament. The women's side got their first win against Bosnia and Herzegovina with the side finishing 12th of 16 teams. This was the first real result for the women's team.
Montenegro Men's XV played a 15's international test against Gibraltar. It was a poor performance from the men's side as they were heavily defeated 55-7. National caps were awarded.
In the 2017 ENC hosted by Montenegro the team lost the first match against Slovakia and won the following against Bulgaria. Each team had a victory and even though Montenegro had scored the most tries and had a better points difference Slovakia had gotten promotion through due to changes in Rugby Europe's tie breaker rules earlier in the year.
Montenegro sevens competed in Rugby Europe rugby sevens conference 1 in 2017 with a poor set of results due to external factors. With losses in all group matches and small margins in their playoff matches to stay in the conference, it ended a disappointing year for rugby in Montenegro.
In the 2018 season the national team played and lost their fixtures against Bulgaria and Turkey respectively.
Currently after the recent re-structuring in rugby europe the national team are playing in the south division 2 conference alongside Serbia, Bosnia and Turkey.
See also
Montenegro national rugby union team
List of National Team Players
Montenegro national rugby sevens team
Montenegrin Rugby Union
References |
```css
/* cyrillic-ext */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 100;
src: local('Roboto Thin Italic'), local('Roboto-ThinItalic'), url(path_to_url format('woff2');
unicode-range: U+0460-052F, U+1C80-1C88, U+20B4, U+2DE0-2DFF, U+A640-A69F, U+FE2E-FE2F;
}
/* cyrillic */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 100;
src: local('Roboto Thin Italic'), local('Roboto-ThinItalic'), url(path_to_url format('woff2');
unicode-range: U+0400-045F, U+0490-0491, U+04B0-04B1, U+2116;
}
/* greek-ext */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 100;
src: local('Roboto Thin Italic'), local('Roboto-ThinItalic'), url(path_to_url format('woff2');
unicode-range: U+1F00-1FFF;
}
/* greek */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 100;
src: local('Roboto Thin Italic'), local('Roboto-ThinItalic'), url(path_to_url format('woff2');
unicode-range: U+0370-03FF;
}
/* vietnamese */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 100;
src: local('Roboto Thin Italic'), local('Roboto-ThinItalic'), url(path_to_url format('woff2');
unicode-range: U+0102-0103, U+0110-0111, U+1EA0-1EF9, U+20AB;
}
/* latin-ext */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 100;
src: local('Roboto Thin Italic'), local('Roboto-ThinItalic'), url(path_to_url format('woff2');
unicode-range: U+0100-024F, U+0259, U+1E00-1EFF, U+2020, U+20A0-20AB, U+20AD-20CF, U+2113, U+2C60-2C7F, U+A720-A7FF;
}
/* latin */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 100;
src: local('Roboto Thin Italic'), local('Roboto-ThinItalic'), url(path_to_url format('woff2');
unicode-range: U+0000-00FF, U+0131, U+0152-0153, U+02BB-02BC, U+02C6, U+02DA, U+02DC, U+2000-206F, U+2074, U+20AC, U+2122, U+2191, U+2193, U+2212, U+2215, U+FEFF, U+FFFD;
}
/* cyrillic-ext */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 300;
src: local('Roboto Light Italic'), local('Roboto-LightItalic'), url(path_to_url format('woff2');
unicode-range: U+0460-052F, U+1C80-1C88, U+20B4, U+2DE0-2DFF, U+A640-A69F, U+FE2E-FE2F;
}
/* cyrillic */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 300;
src: local('Roboto Light Italic'), local('Roboto-LightItalic'), url(path_to_url format('woff2');
unicode-range: U+0400-045F, U+0490-0491, U+04B0-04B1, U+2116;
}
/* greek-ext */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 300;
src: local('Roboto Light Italic'), local('Roboto-LightItalic'), url(path_to_url format('woff2');
unicode-range: U+1F00-1FFF;
}
/* greek */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 300;
src: local('Roboto Light Italic'), local('Roboto-LightItalic'), url(path_to_url format('woff2');
unicode-range: U+0370-03FF;
}
/* vietnamese */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 300;
src: local('Roboto Light Italic'), local('Roboto-LightItalic'), url(path_to_url format('woff2');
unicode-range: U+0102-0103, U+0110-0111, U+1EA0-1EF9, U+20AB;
}
/* latin-ext */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 300;
src: local('Roboto Light Italic'), local('Roboto-LightItalic'), url(path_to_url format('woff2');
unicode-range: U+0100-024F, U+0259, U+1E00-1EFF, U+2020, U+20A0-20AB, U+20AD-20CF, U+2113, U+2C60-2C7F, U+A720-A7FF;
}
/* latin */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 300;
src: local('Roboto Light Italic'), local('Roboto-LightItalic'), url(path_to_url format('woff2');
unicode-range: U+0000-00FF, U+0131, U+0152-0153, U+02BB-02BC, U+02C6, U+02DA, U+02DC, U+2000-206F, U+2074, U+20AC, U+2122, U+2191, U+2193, U+2212, U+2215, U+FEFF, U+FFFD;
}
/* cyrillic-ext */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 400;
src: local('Roboto Italic'), local('Roboto-Italic'), url(path_to_url format('woff2');
unicode-range: U+0460-052F, U+1C80-1C88, U+20B4, U+2DE0-2DFF, U+A640-A69F, U+FE2E-FE2F;
}
/* cyrillic */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 400;
src: local('Roboto Italic'), local('Roboto-Italic'), url(path_to_url format('woff2');
unicode-range: U+0400-045F, U+0490-0491, U+04B0-04B1, U+2116;
}
/* greek-ext */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 400;
src: local('Roboto Italic'), local('Roboto-Italic'), url(path_to_url format('woff2');
unicode-range: U+1F00-1FFF;
}
/* greek */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 400;
src: local('Roboto Italic'), local('Roboto-Italic'), url(path_to_url format('woff2');
unicode-range: U+0370-03FF;
}
/* vietnamese */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 400;
src: local('Roboto Italic'), local('Roboto-Italic'), url(path_to_url format('woff2');
unicode-range: U+0102-0103, U+0110-0111, U+1EA0-1EF9, U+20AB;
}
/* latin-ext */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 400;
src: local('Roboto Italic'), local('Roboto-Italic'), url(path_to_url format('woff2');
unicode-range: U+0100-024F, U+0259, U+1E00-1EFF, U+2020, U+20A0-20AB, U+20AD-20CF, U+2113, U+2C60-2C7F, U+A720-A7FF;
}
/* latin */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 400;
src: local('Roboto Italic'), local('Roboto-Italic'), url(path_to_url format('woff2');
unicode-range: U+0000-00FF, U+0131, U+0152-0153, U+02BB-02BC, U+02C6, U+02DA, U+02DC, U+2000-206F, U+2074, U+20AC, U+2122, U+2191, U+2193, U+2212, U+2215, U+FEFF, U+FFFD;
}
/* cyrillic-ext */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 500;
src: local('Roboto Medium Italic'), local('Roboto-MediumItalic'), url(path_to_url format('woff2');
unicode-range: U+0460-052F, U+1C80-1C88, U+20B4, U+2DE0-2DFF, U+A640-A69F, U+FE2E-FE2F;
}
/* cyrillic */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 500;
src: local('Roboto Medium Italic'), local('Roboto-MediumItalic'), url(path_to_url format('woff2');
unicode-range: U+0400-045F, U+0490-0491, U+04B0-04B1, U+2116;
}
/* greek-ext */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 500;
src: local('Roboto Medium Italic'), local('Roboto-MediumItalic'), url(path_to_url format('woff2');
unicode-range: U+1F00-1FFF;
}
/* greek */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 500;
src: local('Roboto Medium Italic'), local('Roboto-MediumItalic'), url(path_to_url format('woff2');
unicode-range: U+0370-03FF;
}
/* vietnamese */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 500;
src: local('Roboto Medium Italic'), local('Roboto-MediumItalic'), url(path_to_url format('woff2');
unicode-range: U+0102-0103, U+0110-0111, U+1EA0-1EF9, U+20AB;
}
/* latin-ext */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 500;
src: local('Roboto Medium Italic'), local('Roboto-MediumItalic'), url(path_to_url format('woff2');
unicode-range: U+0100-024F, U+0259, U+1E00-1EFF, U+2020, U+20A0-20AB, U+20AD-20CF, U+2113, U+2C60-2C7F, U+A720-A7FF;
}
/* latin */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 500;
src: local('Roboto Medium Italic'), local('Roboto-MediumItalic'), url(path_to_url format('woff2');
unicode-range: U+0000-00FF, U+0131, U+0152-0153, U+02BB-02BC, U+02C6, U+02DA, U+02DC, U+2000-206F, U+2074, U+20AC, U+2122, U+2191, U+2193, U+2212, U+2215, U+FEFF, U+FFFD;
}
/* cyrillic-ext */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 700;
src: local('Roboto Bold Italic'), local('Roboto-BoldItalic'), url(path_to_url format('woff2');
unicode-range: U+0460-052F, U+1C80-1C88, U+20B4, U+2DE0-2DFF, U+A640-A69F, U+FE2E-FE2F;
}
/* cyrillic */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 700;
src: local('Roboto Bold Italic'), local('Roboto-BoldItalic'), url(path_to_url format('woff2');
unicode-range: U+0400-045F, U+0490-0491, U+04B0-04B1, U+2116;
}
/* greek-ext */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 700;
src: local('Roboto Bold Italic'), local('Roboto-BoldItalic'), url(path_to_url format('woff2');
unicode-range: U+1F00-1FFF;
}
/* greek */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 700;
src: local('Roboto Bold Italic'), local('Roboto-BoldItalic'), url(path_to_url format('woff2');
unicode-range: U+0370-03FF;
}
/* vietnamese */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 700;
src: local('Roboto Bold Italic'), local('Roboto-BoldItalic'), url(path_to_url format('woff2');
unicode-range: U+0102-0103, U+0110-0111, U+1EA0-1EF9, U+20AB;
}
/* latin-ext */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 700;
src: local('Roboto Bold Italic'), local('Roboto-BoldItalic'), url(path_to_url format('woff2');
unicode-range: U+0100-024F, U+0259, U+1E00-1EFF, U+2020, U+20A0-20AB, U+20AD-20CF, U+2113, U+2C60-2C7F, U+A720-A7FF;
}
/* latin */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 700;
src: local('Roboto Bold Italic'), local('Roboto-BoldItalic'), url(path_to_url format('woff2');
unicode-range: U+0000-00FF, U+0131, U+0152-0153, U+02BB-02BC, U+02C6, U+02DA, U+02DC, U+2000-206F, U+2074, U+20AC, U+2122, U+2191, U+2193, U+2212, U+2215, U+FEFF, U+FFFD;
}
/* cyrillic-ext */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 900;
src: local('Roboto Black Italic'), local('Roboto-BlackItalic'), url(path_to_url format('woff2');
unicode-range: U+0460-052F, U+1C80-1C88, U+20B4, U+2DE0-2DFF, U+A640-A69F, U+FE2E-FE2F;
}
/* cyrillic */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 900;
src: local('Roboto Black Italic'), local('Roboto-BlackItalic'), url(path_to_url format('woff2');
unicode-range: U+0400-045F, U+0490-0491, U+04B0-04B1, U+2116;
}
/* greek-ext */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 900;
src: local('Roboto Black Italic'), local('Roboto-BlackItalic'), url(path_to_url format('woff2');
unicode-range: U+1F00-1FFF;
}
/* greek */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 900;
src: local('Roboto Black Italic'), local('Roboto-BlackItalic'), url(path_to_url format('woff2');
unicode-range: U+0370-03FF;
}
/* vietnamese */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 900;
src: local('Roboto Black Italic'), local('Roboto-BlackItalic'), url(path_to_url format('woff2');
unicode-range: U+0102-0103, U+0110-0111, U+1EA0-1EF9, U+20AB;
}
/* latin-ext */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 900;
src: local('Roboto Black Italic'), local('Roboto-BlackItalic'), url(path_to_url format('woff2');
unicode-range: U+0100-024F, U+0259, U+1E00-1EFF, U+2020, U+20A0-20AB, U+20AD-20CF, U+2113, U+2C60-2C7F, U+A720-A7FF;
}
/* latin */
@font-face {
font-family: 'Roboto';
font-style: italic;
font-weight: 900;
src: local('Roboto Black Italic'), local('Roboto-BlackItalic'), url(path_to_url format('woff2');
unicode-range: U+0000-00FF, U+0131, U+0152-0153, U+02BB-02BC, U+02C6, U+02DA, U+02DC, U+2000-206F, U+2074, U+20AC, U+2122, U+2191, U+2193, U+2212, U+2215, U+FEFF, U+FFFD;
}
/* cyrillic-ext */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 100;
src: local('Roboto Thin'), local('Roboto-Thin'), url(path_to_url format('woff2');
unicode-range: U+0460-052F, U+1C80-1C88, U+20B4, U+2DE0-2DFF, U+A640-A69F, U+FE2E-FE2F;
}
/* cyrillic */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 100;
src: local('Roboto Thin'), local('Roboto-Thin'), url(path_to_url format('woff2');
unicode-range: U+0400-045F, U+0490-0491, U+04B0-04B1, U+2116;
}
/* greek-ext */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 100;
src: local('Roboto Thin'), local('Roboto-Thin'), url(path_to_url format('woff2');
unicode-range: U+1F00-1FFF;
}
/* greek */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 100;
src: local('Roboto Thin'), local('Roboto-Thin'), url(path_to_url format('woff2');
unicode-range: U+0370-03FF;
}
/* vietnamese */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 100;
src: local('Roboto Thin'), local('Roboto-Thin'), url(path_to_url format('woff2');
unicode-range: U+0102-0103, U+0110-0111, U+1EA0-1EF9, U+20AB;
}
/* latin-ext */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 100;
src: local('Roboto Thin'), local('Roboto-Thin'), url(path_to_url format('woff2');
unicode-range: U+0100-024F, U+0259, U+1E00-1EFF, U+2020, U+20A0-20AB, U+20AD-20CF, U+2113, U+2C60-2C7F, U+A720-A7FF;
}
/* latin */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 100;
src: local('Roboto Thin'), local('Roboto-Thin'), url(path_to_url format('woff2');
unicode-range: U+0000-00FF, U+0131, U+0152-0153, U+02BB-02BC, U+02C6, U+02DA, U+02DC, U+2000-206F, U+2074, U+20AC, U+2122, U+2191, U+2193, U+2212, U+2215, U+FEFF, U+FFFD;
}
/* cyrillic-ext */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 300;
src: local('Roboto Light'), local('Roboto-Light'), url(path_to_url format('woff2');
unicode-range: U+0460-052F, U+1C80-1C88, U+20B4, U+2DE0-2DFF, U+A640-A69F, U+FE2E-FE2F;
}
/* cyrillic */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 300;
src: local('Roboto Light'), local('Roboto-Light'), url(path_to_url format('woff2');
unicode-range: U+0400-045F, U+0490-0491, U+04B0-04B1, U+2116;
}
/* greek-ext */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 300;
src: local('Roboto Light'), local('Roboto-Light'), url(path_to_url format('woff2');
unicode-range: U+1F00-1FFF;
}
/* greek */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 300;
src: local('Roboto Light'), local('Roboto-Light'), url(path_to_url format('woff2');
unicode-range: U+0370-03FF;
}
/* vietnamese */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 300;
src: local('Roboto Light'), local('Roboto-Light'), url(path_to_url format('woff2');
unicode-range: U+0102-0103, U+0110-0111, U+1EA0-1EF9, U+20AB;
}
/* latin-ext */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 300;
src: local('Roboto Light'), local('Roboto-Light'), url(path_to_url format('woff2');
unicode-range: U+0100-024F, U+0259, U+1E00-1EFF, U+2020, U+20A0-20AB, U+20AD-20CF, U+2113, U+2C60-2C7F, U+A720-A7FF;
}
/* latin */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 300;
src: local('Roboto Light'), local('Roboto-Light'), url(path_to_url format('woff2');
unicode-range: U+0000-00FF, U+0131, U+0152-0153, U+02BB-02BC, U+02C6, U+02DA, U+02DC, U+2000-206F, U+2074, U+20AC, U+2122, U+2191, U+2193, U+2212, U+2215, U+FEFF, U+FFFD;
}
/* cyrillic-ext */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 400;
src: local('Roboto'), local('Roboto-Regular'), url(path_to_url format('woff2');
unicode-range: U+0460-052F, U+1C80-1C88, U+20B4, U+2DE0-2DFF, U+A640-A69F, U+FE2E-FE2F;
}
/* cyrillic */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 400;
src: local('Roboto'), local('Roboto-Regular'), url(path_to_url format('woff2');
unicode-range: U+0400-045F, U+0490-0491, U+04B0-04B1, U+2116;
}
/* greek-ext */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 400;
src: local('Roboto'), local('Roboto-Regular'), url(path_to_url format('woff2');
unicode-range: U+1F00-1FFF;
}
/* greek */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 400;
src: local('Roboto'), local('Roboto-Regular'), url(path_to_url format('woff2');
unicode-range: U+0370-03FF;
}
/* vietnamese */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 400;
src: local('Roboto'), local('Roboto-Regular'), url(path_to_url format('woff2');
unicode-range: U+0102-0103, U+0110-0111, U+1EA0-1EF9, U+20AB;
}
/* latin-ext */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 400;
src: local('Roboto'), local('Roboto-Regular'), url(path_to_url format('woff2');
unicode-range: U+0100-024F, U+0259, U+1E00-1EFF, U+2020, U+20A0-20AB, U+20AD-20CF, U+2113, U+2C60-2C7F, U+A720-A7FF;
}
/* latin */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 400;
src: local('Roboto'), local('Roboto-Regular'), url(path_to_url format('woff2');
unicode-range: U+0000-00FF, U+0131, U+0152-0153, U+02BB-02BC, U+02C6, U+02DA, U+02DC, U+2000-206F, U+2074, U+20AC, U+2122, U+2191, U+2193, U+2212, U+2215, U+FEFF, U+FFFD;
}
/* cyrillic-ext */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 500;
src: local('Roboto Medium'), local('Roboto-Medium'), url(path_to_url format('woff2');
unicode-range: U+0460-052F, U+1C80-1C88, U+20B4, U+2DE0-2DFF, U+A640-A69F, U+FE2E-FE2F;
}
/* cyrillic */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 500;
src: local('Roboto Medium'), local('Roboto-Medium'), url(path_to_url format('woff2');
unicode-range: U+0400-045F, U+0490-0491, U+04B0-04B1, U+2116;
}
/* greek-ext */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 500;
src: local('Roboto Medium'), local('Roboto-Medium'), url(path_to_url format('woff2');
unicode-range: U+1F00-1FFF;
}
/* greek */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 500;
src: local('Roboto Medium'), local('Roboto-Medium'), url(path_to_url format('woff2');
unicode-range: U+0370-03FF;
}
/* vietnamese */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 500;
src: local('Roboto Medium'), local('Roboto-Medium'), url(path_to_url format('woff2');
unicode-range: U+0102-0103, U+0110-0111, U+1EA0-1EF9, U+20AB;
}
/* latin-ext */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 500;
src: local('Roboto Medium'), local('Roboto-Medium'), url(path_to_url format('woff2');
unicode-range: U+0100-024F, U+0259, U+1E00-1EFF, U+2020, U+20A0-20AB, U+20AD-20CF, U+2113, U+2C60-2C7F, U+A720-A7FF;
}
/* latin */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 500;
src: local('Roboto Medium'), local('Roboto-Medium'), url(path_to_url format('woff2');
unicode-range: U+0000-00FF, U+0131, U+0152-0153, U+02BB-02BC, U+02C6, U+02DA, U+02DC, U+2000-206F, U+2074, U+20AC, U+2122, U+2191, U+2193, U+2212, U+2215, U+FEFF, U+FFFD;
}
/* cyrillic-ext */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 700;
src: local('Roboto Bold'), local('Roboto-Bold'), url(path_to_url format('woff2');
unicode-range: U+0460-052F, U+1C80-1C88, U+20B4, U+2DE0-2DFF, U+A640-A69F, U+FE2E-FE2F;
}
/* cyrillic */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 700;
src: local('Roboto Bold'), local('Roboto-Bold'), url(path_to_url format('woff2');
unicode-range: U+0400-045F, U+0490-0491, U+04B0-04B1, U+2116;
}
/* greek-ext */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 700;
src: local('Roboto Bold'), local('Roboto-Bold'), url(path_to_url format('woff2');
unicode-range: U+1F00-1FFF;
}
/* greek */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 700;
src: local('Roboto Bold'), local('Roboto-Bold'), url(path_to_url format('woff2');
unicode-range: U+0370-03FF;
}
/* vietnamese */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 700;
src: local('Roboto Bold'), local('Roboto-Bold'), url(path_to_url format('woff2');
unicode-range: U+0102-0103, U+0110-0111, U+1EA0-1EF9, U+20AB;
}
/* latin-ext */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 700;
src: local('Roboto Bold'), local('Roboto-Bold'), url(path_to_url format('woff2');
unicode-range: U+0100-024F, U+0259, U+1E00-1EFF, U+2020, U+20A0-20AB, U+20AD-20CF, U+2113, U+2C60-2C7F, U+A720-A7FF;
}
/* latin */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 700;
src: local('Roboto Bold'), local('Roboto-Bold'), url(path_to_url format('woff2');
unicode-range: U+0000-00FF, U+0131, U+0152-0153, U+02BB-02BC, U+02C6, U+02DA, U+02DC, U+2000-206F, U+2074, U+20AC, U+2122, U+2191, U+2193, U+2212, U+2215, U+FEFF, U+FFFD;
}
/* cyrillic-ext */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 900;
src: local('Roboto Black'), local('Roboto-Black'), url(path_to_url format('woff2');
unicode-range: U+0460-052F, U+1C80-1C88, U+20B4, U+2DE0-2DFF, U+A640-A69F, U+FE2E-FE2F;
}
/* cyrillic */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 900;
src: local('Roboto Black'), local('Roboto-Black'), url(path_to_url format('woff2');
unicode-range: U+0400-045F, U+0490-0491, U+04B0-04B1, U+2116;
}
/* greek-ext */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 900;
src: local('Roboto Black'), local('Roboto-Black'), url(path_to_url format('woff2');
unicode-range: U+1F00-1FFF;
}
/* greek */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 900;
src: local('Roboto Black'), local('Roboto-Black'), url(path_to_url format('woff2');
unicode-range: U+0370-03FF;
}
/* vietnamese */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 900;
src: local('Roboto Black'), local('Roboto-Black'), url(path_to_url format('woff2');
unicode-range: U+0102-0103, U+0110-0111, U+1EA0-1EF9, U+20AB;
}
/* latin-ext */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 900;
src: local('Roboto Black'), local('Roboto-Black'), url(path_to_url format('woff2');
unicode-range: U+0100-024F, U+0259, U+1E00-1EFF, U+2020, U+20A0-20AB, U+20AD-20CF, U+2113, U+2C60-2C7F, U+A720-A7FF;
}
/* latin */
@font-face {
font-family: 'Roboto';
font-style: normal;
font-weight: 900;
src: local('Roboto Black'), local('Roboto-Black'), url(path_to_url format('woff2');
unicode-range: U+0000-00FF, U+0131, U+0152-0153, U+02BB-02BC, U+02C6, U+02DA, U+02DC, U+2000-206F, U+2074, U+20AC, U+2122, U+2191, U+2193, U+2212, U+2215, U+FEFF, U+FFFD;
}
``` |
A keyboard computer is a computer which contains all of the regular components of a personal computer, except for a screen, in the same housing as the keyboard. The power supply is typically external and connects to the computer via an adapter cable. The motherboard is specially designed to fit inside, and the device is larger than most standard keyboards. Additional peripheral components such as a monitor are connected to the computer via external ports. Usually a minimum of storage devices, if any, is built in.
Most home computers of the late 1970s and during the 1980s were keyboard computers, the ZX Spectrum and most models of the Atari ST, Xiao Bawang, Commodore 64. and Amiga being prime examples. While this form factor went out of style around 1990 in favour for more standard PC setups, some notable x86 keyboard computers have been built, like the Olivetti Prodest PC1 in 1988 and the Schneider EuroPC Series between 1988 and 1995.
Newer developments include the Commodore 64 WebIt by Tulip, the Asus Eee Keyboard, which uses Intel Atom processors and solid state hard drives, and the (never-released) Commodore Invictus PC. In November 2020, Raspberry Pi Foundation announced Raspberry Pi 400, a modified version of their previous Raspberry Pi 4 housed entirely within a keyboard, with "quad-core 64-bit processor, 4GB of RAM, wireless networking, dual-display output, and 4K video playback, as well as a 40-pin GPIO header".
References
Classes of computers |
Jennifer D. Benally was a state representative from Arizona, representing the 7th district. A member of the Democratic Party, Benally was first elected to the Arizona House of Representatives in 2015. Benally did not seek reelection in 2016.
Early life and education
Benally is Zuni Edgewater Clan born for Tangle Root Clan. Benally was born in Albuquerque, New Mexico but moved to Arizona in 1957. She earned her degree from Northern Arizona University and served as a Navajo Nation police officer from 1982 to 1990. Benally become a Tuba City Prosecutor in 1992. After six years as a prosecutor, Benally became a district court judge for the Navajo Nation.
Elections
2014 Benally and Albert Hale defeated Joshua Lavar Butler in the Democratic primary. Hale and Benally were unopposed in the general election.
Personal life
Benally and her husband, Kent, together have 10 children and 14 grandchildren.
See also
List of Native American jurists
References
External links
Ballotpedia page
House Page
Vote Smart
Living people
21st-century American politicians
21st-century American women politicians
21st-century Native Americans
Democratic Party members of the Arizona House of Representatives
Native American state legislators in Arizona
Native American women in politics
Navajo judges
Northern Arizona University alumni
People from Coconino County, Arizona
Women state legislators in Arizona
Year of birth missing (living people)
21st-century Native American women |
Peder Laale or Peder Lolle was a 14th-century Danish scholar, known for his collection of proverbs Petri Laale Parabulæ, which was first published in 1506. Not much is known about his identity, but textual clues suggest that he may have been a magistrate or judge, or perhaps a priest. He may be identical with the deacon of Odense by name of Peder Nielsen Låle (in Latin Petrus Nicolai alias dictus Lalo) who traveled as a messenger from the Papal nuntius in Denmark and Sweden to the Curia in Avignon in the 1330s, and who later took up a post at the bishopric in Ribe. The theory that Deacon Peder Nielsen Låle is also the author of the proverbs is supported by traits suggestive of French influence in the proverbs, as well as the dates from which they are known. The earliest fragments known are from 1450 suggesting that they must have been well known for a period before that, placing their author's likely life time in the 14th century. The proverbs are considered a treasure of medieval Danish literature.
In 1506 professors at the University of Copenhagen published the full collection Peder Laale's Parabolae in print for the first time.
The almost 1200 proverbs in the Peder Laale collection are assumed to have been used in the teaching of Latin, and each proverb is given in Latin and Medieval Danish. The proverbs come from various sources both from medieval sources in Latin and other European languages, from the preface to the Codex Holmiensis as well as from the oral tradition of the time.
See also
Peder Syv
References
External links
Online Facsimile version of Parabolae at the Royal Danish Library
Danish philologists
Danish folklorists
14th-century Danish people
14th-century Danish clergy |
Sydenham Teast (1755–1813) was a Quaker merchant, fur-trader, shipbuilder and shipowner based in Bristol, England, during the 18th and 19th centuries.
Life and career
Teast was a shipowner involved in whaling. He had at least eight South Sea whalers between 1786 and 1801. He was also involved in the ivory and timber trade between England and Africa. He constructed Redcliffe Parade in the 1770s, and was also involved in the slave trade, refitting the slaver Hector in 1776. Towards the end of the eighteenth century, Teast became a significant figure in Bristol's trade with Africa. He was not heavily invested in the slave trade.
Teast built two drydocks at Wapping on the Avon in 1755, and a further two at Canon's Marsh on the mouth of the River Frome in 1790. On 9 September 1782, the company launched , a fifth-rate 32-gun frigate, the only warship the yard ever built.
Ships built by Teast's in Bristol include:
, merchant vessel
Lion (1744), 220 ton, 32-gun privateer.
Hermione (1782), 716 ton, 32-gun fifth-rate frigate.
, merchant vessel
He held interests in a few other ships that traded on the coast of West Africa including, African Queen, Brothers. , , , and Sydenham.
Teast's Docks lasted until 1832 at Canon's Marsh, and 1841 at Wapping, where the housing and flats of Merchant's Wharf now occupy the site.
He married Eleanor Buckle in 1796 and Mary Irvin in 1802.
Citations
References
Defunct shipbuilding companies of the United Kingdom
1755 births
1813 deaths
British people in whaling |
Khost is a town and union council of Harnai District in the Balochistan province of Pakistan. It is located at 30°13'24N 67°34'38E and has an altitude of 1229m (4035ft).
References
Populated places in Sibi District
Union councils of Balochistan, Pakistan |
The Kaliningrad question ( or ; or ; or ; ) is a political question concerning the status of Kaliningrad Oblast as an exclave of Russia, and its isolation from the rest of the Baltic region following the 2004 enlargement of the European Union.
In Western media, the region is often discussed in relation to the deployment of missile systems, initially as a response to the deployment of missile defense systems in Poland and the Czech Republic. Russia views the region as a vital element of its ability to project power in the Baltic region.
A fringe position also considers the return of the province to Germany from the Russian Federation, or its independence from both. The former question is mostly hypothetical, as the German government has stated that it has no claim to it and has formally renounced in international law any right to any lands east of the Oder by ratifying the Treaty on the Final Settlement with Respect to Germany.
History
Kaliningrad, or Königsberg, had been a part of the Teutonic Order, Duchy of Prussia (for some time a Polish vassal), Kingdom of Prussia, and the German Empire for 684 years before the Second World War. The lands of Prussia were originally inhabited by Baltic tribes, the Old Prussians, with their language becoming extinct by the 18th century.
The incorporation of the Königsberg area of East Prussia to Russia became a stated war aim of the Soviet Union at the Tehran Conference in December 1943. In 1945, at the end of World War II, the city was captured by the Soviet Union (see Battle of Königsberg). As agreed by the Allies at the Potsdam Conference, northern East Prussia, including Königsberg, was given to the USSR. Specifically, it became an exclave of the Russian Soviet Federative Socialist Republic, separated from the rest of the Republic by the Lithuanian and Byelorussian SSRs. The southern parts of East Prussia were transferred to Poland. In 1946, the name of the city of Königsberg was changed to Kaliningrad.
In October 1945, only about 5,000 Soviet civilians lived in the territory. Between October 1947 and October 1948, about 100,000 Germans were forcibly moved to Germany. About 400,000 Soviet civilians arrived by 1948. Some moved voluntarily, but as the number of willing settlers proved insufficient, collective farms were given quotas of how many people they had to send to Kaliningrad. Often they sent the least socially desirable individuals, such as alcoholics or the uneducated.
In the 1950s, Nikita Khrushchev suggested that the Lithuanian SSR should annex Kaliningrad Oblast. The offer was refused by the Lithuanian Communist Party leader Antanas Sniečkus, who did not wish to alter the ethnic composition of his republic. In the late Soviet era, rumors spread that the Oblast might be converted into a homeland for Soviet Germans.
Kaliningrad Oblast remained part of the Soviet Union until its dissolution in 1991, and since then has been an exclave of the Russian Federation. After the Soviet collapse, some descendants of the expellees and refugees traveled to the city to examine their roots. According to the 2010 Russian Census, 7,349 ethnic Germans live in the Oblast, making up 0.8% of the population.
In Germany, the status of Kaliningrad (Königsberg) was a mainstream political issue until the 1960s, when the shifting political discourse increasingly associated similar views with right-wing revisionism.
According to a Der Spiegel article published in 2010, in 1990 the West German government received a message from the Soviet general Geli Batenin, offering to return Kaliningrad. The offer was never seriously considered by the Bonn government, who saw reunification with the East as its priority. However, this story was later denied by Mikhail Gorbachev.
In 2001, the EU was alleged to be in talks with Russia to arrange an association agreement with the Kaliningrad Oblast, at a time when Russia could not repay £22 billion debt owed to Berlin, which may have given Germany some influence over the territory. Claims of "buying back" Kaliningrad (Königsberg) or other "secret deals" were repudiated by both sides.
Another rumor about a debt-related deal, published by the Russian weekly Nash Continent, alleged that Putin and Edmund Stoiber had agreed on the gradual return of Kaliningrad in return for waiving the country's $50 billion debt to Germany.
After annexation of Crimea by the Russian Federation in 2014, some newspapers proposed that Kaliningrad Oblast should be returned to West. On 28 April 2014, The Baltic Times proposed that the West should take back Kaliningrad from Russia in exchange. This proposal was
quoted by several scholary articles.
Regardless of the reality, Russia's annexation of Crimea opened doors to claim Kaliningrad by others.
A few months after the 2022 Russian invasion of Ukraine, Lithuania started implementing EU sanctions, which blocked about 50% of the goods being imported into Kaliningrad by rail, not including food, medicine, or passenger travel. Russia protested the sanctions and announced it would increase shipments by sea.
Support for independence
Since the early 1990s there has been a proposal for independence of the Kaliningrad Oblast from Russia and the formation of a "fourth Baltic state" by some of the local people. The Baltic Republican Party was founded on 1 December 1993 with the aim of founding an autonomous Baltic Republic.
Support for irredentism
Inesis Feldmanis, head of the Faculty of History and Philosophy at the University of Latvia, has been quoted saying that the Soviet Union's annexation of Kaliningrad is "an error in history".
The Freistaat Preußen Movement, one of the most active offshoots of the Reichsbürger movement, considers the Russian (and German) government as illegitimate and see themselves as the rightful rulers of the region. As of 2017, the movement is split into two competing factions, one based in Königsfeld, Rhineland-Palatinate and the other in Bonn.
In Lithuania
Some political groups in Lithuania claim parts of Kaliningrad Oblast between the Pregel and Nemunas rivers (an area known as Lithuania Minor), but they have little influence. Linas Balsys, a deputy in the Lithuanian parliament, has argued that the status of the exclave should be discussed at international levels.
In 1994, the former Lithuanian head of state Vytautas Landsbergis called for the separation and "decolonization" of Kaliningrad from Russia. In December 1997, the Lithuanian parliament member Romualdas Ozolas expressed his view that Kaliningrad should become an independent republic.
After the annexation of Crimea in 2014, the political analyst Laurynas Kasčiūnas called for a revisiting of the Potsdam Agreement. He claims that residents of Kaliningrad would support a referendum to separate from Russia. The notion of a Lithuanian claim has been brushed off by Russian media, even the liberal Novaya Gazeta newspaper dismissing it as a "geopolitical fantasy".
In Poland
More than in the form of Polish irredentism over the Kaliningrad Oblast, a Polish annexation of the region has been more mentioned by Russian media, which has accused the Polish authorities of preparing to incorporate the region. These accusations stemmed from online comments made by readers of an article published on the Polish newspaper Gazeta Wyborcza: while the article itself did not mention any Polish alleged annexation desire, the comments suggested that the Kaliningrad Oblast should belong to Poland. Pro-Kremlin media such as Pravda.ru misleadingly reported this as an attempt by the Polish government to annex the region. Stanisław Żaryn, spokesperson for the Polish Minister Coordinator for Special Services, dismissed the allegation as "fake news".
German resettlement attempts
In the 1990s, organisations with ties to far-right politics in Germany began to collect money to purchase land in Kaliningrad Oblast, to enable ethnic Germans to settle there. In particular, Gesellschaft für Siedlungsförderung in Trakehnen attempted to establish a settlement in Yasnaya Polyana, known in German as Trakehnen. A separate group, affiliated to convicted terrorist Manfred Roeder collected donations to build housing for ethnic Germans in the village of Olkhovatka, east of Kaliningrad.
At Yasnaya Polyana/Trakehnen, fundraising by the organization Aktion Deutsches Königsberg financed the construction of a German-language school and housing in the neighboring village of Amtshagen. Several dilapidated houses were bought and renovated; tractors, trucks, building materials and machinery were imported into the village. The relatively high salaries attracted newcomers, and the ethnic German population rose to about 400 inhabitants. Most of the settlers were Russian Germans from the Caucasus and Kazakhstan, rather than returnees, or their descendants. Some of the Russian Germans were reportedly unable to speak German and/or had been rejected as immigrants to Germany, due to insufficient evidence of substantial German ancestry. The construction of a second settlement in the outskirts of Trakehnen, named Agnes-Miegel-Siedlung, began in 1998.
Relations between the local Russian administration and the Trakehnen project were initially cordial, but the activities of the group were suppressed by the Russian government after being publicized by German media. Dietmar Munier, the initiator of the project, was banned from traveling to Kaliningrad Oblast. In 2006, he sold his stake in the association to one Alexander Mantai, who turned it into a for-profit concern and evicted the original settlers. The association was liquidated in 2015 for violating the Russian law on NGOs.
Official positions
Although negotiations in 2001 were instigated around a possible Russian trade deal with the EU, that would have put the exclave within Germany's economic sphere of influence, the current German government has indicated no interest in recovering Kaliningrad Oblast. The governments of Poland and Lithuania similarly recognize Kaliningrad as part of Russia, as does the European Union. Germany formally waived all territorial claims to the former East Prussia as part of the Two Plus Four Agreement that led to German reunification. In July 2005, the German Chancellor Gerhard Schröder declared that "in its heart [the city] will always be called Königsberg", but stated that Germany did not have any territorial claim to it. According to Ulrich Speck, the prospect of returning Kaliningrad to Germany lacks support in Germany, even among fringe nationalist groups. In 2004, the German politician Jürgen Klimke asked the German federal government about its view on the establishment of a Lithuanian-Russian-Polish euroregion, to be named "Prussia". The initiator denied any revanchist connotations to the proposal.
After the collapse of the Soviet Union, Russia's claim to Kaliningrad was not contested by any government, though some groups in Lithuania called for the annexation of the province, or parts of it.
Poland has made no claim to Kaliningrad, and is seen as being unlikely to do so, as it was a beneficiary of the Potsdam Agreement, which also decided the status of Kaliningrad.
See also
Prussia
Prussian nationalism
Restriction of transit with the Kaliningrad Oblast
Karelian question
Kuril Islands dispute
Landsmannschaft Ostpreußen, organization for East Prussian refugees/expellees
Suwałki Gap
Královec Region, a satirical Czech annexation of Kaliningrad
Notes
References
Germany–Russia relations
Lithuania–Russia relations
German irredentism
Lithuanian irredentism
Politics of Kaliningrad Oblast
Political controversies
National questions |
Milton John Helmick (1885–1954) was Attorney General of New Mexico from 1923 to 1925, a judge in Albuquerque from 1925 to 1934, and the judge of the United States Court for China from 1934 to 1943.
Early life
Milton John Helmick was a native of Colorado. Helmick attended Stanford University and then took a law degree from the University of Denver in 1910.
Career
Milton John Helmick served as Attorney General of New Mexico from 1923 to 1925 and from 1925 to 1934 as judge for the 2nd District of Albuquerque.
In 1934, Helmick was appointed to a 10-year term as the Judge for the United States Court for China in Shanghai, China replacing Milton D. Purdy.
On December 8, 1941, Japanese troops occupied the United States consulate in Shanghai where the court was based. Helmick was interned for about half a year before being repatriated to America. His appointment as judge formally came to an end in May 1943 after the Treaty for Relinquishment of Extraterritorial Rights in China was ratified.
Helmick returned to China in 1944 to study the new Chinese legal system to prepare for dealing with the system after the defeat of Japan. Helmick then worked for the Standard Vacuum Oil Company in Shanghai from 1945 to 1951.
In 1953, Helmick was appointed Judge of the United States Consular Court for Casablanca and Tangiers where he tried one of the few cases of piracy against an American citizen in the 20th Century.
Retirement and death
Helmick retired in January 1954 and died in San Francisco in October 1954 at the age of 69.
Further reading
, Vol. 1: ; Vol. 2: ; Vol. 3:
References
1954 deaths
Judges of the United States Court for China
New Mexico Attorneys General
20th-century American judges
Stanford University alumni
University of Denver alumni
1885 births
United States district court judges appointed by Franklin D. Roosevelt |
The Mount Shasta Wilderness is a federally designated wilderness area located east of Mount Shasta City in northern California. The US Congress passed the 1984 California Wilderness Act that set aside the Mount Shasta Wilderness. The US Forest Service is the managing agency as the wilderness is within the Shasta-Trinity National Forest. The area is named for and is dominated by the Mount Shasta volcano which reaches a traditionally quoted height of above sea level, but official sources give values ranging from from one USGS project, to via the NOAA. Mount Shasta is one of only two peaks in the state over outside the Sierra Nevada Mountain Range. The other summit is White Mountain Peak in the Great Basin of east-central California.
The Wintun Glacier is located on Mount Shasta and is the lowest-elevation glacier in the state, lying at elevation and extending to the summit.
The smaller volcanic cone of Shastina (12,270 ft) lies one mile (1.6 km) west of Mount Shasta and was formed after the ice-age glaciers melted.
The wilderness protects both pristine forests and areas that were intensively logged and roaded
in the past. Although less than half of the mountain remains roadless, Mount Shasta Wilderness is still the premier destination for a variety of activities from mountaineering, day-hiking, and backpacking to cross-country skiing, snowshoeing and ski mountaineering. It is valued for the many scenic, geologic and recreational attributes including glaciers, lava flows, hot springs, waterfalls and forests of Shasta red fir, sugar pine and other conifers.
Recreation
Being a high, solitary and very large mountain with a base diameter of , Mount Shasta can create its own weather patterns which hikers must be aware of. Also, falling rocks are a major danger above timberline. The best time of year for hiking Mount Shasta is June and July, when routes are still snow-covered. Although there is no designated trail to the summit, many cross-country routes ascend to the mountaintop and all require experience in traversing ice and snow.
There are ten trailheads giving access to the wilderness and several short trails leading up the slopes of Mount Shasta with the so-called Shasta Summit Trail (or Avalanche Gulch) being the most popular. This trail, although the "easiest" of the routes, still requires the use of ice axe and crampons. There are four major glaciers and three smaller glaciers radiating from the summit in addition to lava flows on the northern flank composed of andesite and basalt.
A parking permit is required as well as a free wilderness permit and, if attempting a hike above , a Summit Pass for each climber must be purchased. Human waste must be packed out, and all principles of Leave No Trace etiquette employed. Some restrictions include no dogs in the wilderness, a limit of 10 people in a group and no wood campfires.
Flora and fauna
Forested areas include pure stands of red fir as well as mixed conifer forests of white fir, Douglas-fir, sugar pine, incense cedar and at higher elevations, western white pine. The lava flows on the northeast flank have mountain mahogany and juniper. Underbrush consists of pinemat manzanita, greenleaf manzanita, tanoak, chinquapin, and snowbrush. From to timberline are krummholz forms of whitebark pine.
Wildlife include the ubiquitous black bear, coyote, ground squirrel, deer, golden eagles, prairie falcons and red-tail hawks.
Common wildflowers are Shasta lily, miner's lettuce, showy phlox and mountain violet among others.
Notable rare plants in the Mount Shasta Wilderness and surrounding area include Mt. Shasta arnica (Arnica viscosa), Siskiyou Indian paintbrush (Castilleja miniata ssp. elata) and Shasta owl's clover (Orthocarpus pachystachyus). The Siskiyou Indian paintbrush is hemiparasitic, meaning that the plant obtains water and nutrients from the roots of other plants, then manufactures food by photosynthesis. The Shasta owl's clover (Orthocarpus pachystachyus) of the family Scrophulariaceae is critically imperiled and was believed to be extinct. First described in 1848 by Harvard University botanist Asa Gray, the plant was not collected again until 1913. Known only from two reports from the Shasta Valley of northern California, it could not be relocated despite repeated searches of the moist meadows and vernal pools where it was thought originally to have been found. In May, 1996, botanist Dean Taylor of the University of California, Berkeley, rediscovered the evasive plant on the higher, drier ground of a sagebrush-covered hillside. But even in this habitat the wildflower appears to be extraordinarily rare. Taylor was able to find only eight individual plants of the owl’s-clover.
Sierra Club camp
The Sierra Club maintains a private parcel called Horse Camp within the wilderness.
It is used as a base camp for summit attempts, and offers a shelter called the Shasta Alpine Lodge, dedicated in 1923 and built from surrounding volcanic rock and Shasta red fir wood. Horse Camp is staffed during the climbing season from May to September, has a seasonal spring for water and is a traditional destination of many elementary school trips from Siskiyou County schools.
Also at Horse Camp is the half-mile-long Olberman Causeway, a stone walkway built in the 1920s by the first caretaker, Mac Olberman from rocks of the surrounding area.
References and notes
Adkinson, Ron Wild Northern California. The Globe Pequot Press, 2001
External links
Photo Gallery
Mt. Shasta Wilderness - Shasta-Trinity National Forest
USFS PDF document on access to the wilderness.
Mount Shasta
Protected areas of Siskiyou County, California
Wilderness areas of California
Shasta-Trinity National Forest
1984 establishments in California
Protected areas established in 1984 |
Leith Hospital was situated on Mill Lane in Leith, Edinburgh, and was a general hospital with adult medical and surgical wards, paediatric medical and surgical wards, a casualty department and a wide range of out-patient services. It closed in 1987.
History
Origins
The King James Hospital, in the Kirkgate, which was named after King James VI, who awarded a charter to the hospital, was founded in 1614. The hospital was demolished in 1822, although part of the wall can still be seen today, forming the boundary between the Kirkgate and south Leith Kirkyard.
In the late 18th century the Human Society, which promotes lifesaving intervention, established a presence in Leith, at first in Burgess Close and Bernard Street and then in Broad Wynd. In 1816, a dispensary was opened, also in Broad Wynd, at number 17, a few doors along from the Humane Society room. Founded by Dr. Andrew Duncan (1744–1828), the dispensary consisted of a consulting room, a small laboratory and a single bed. In 1825, the Humane Society and the dispensary combined, to form the Leith Dispensary and Humane Society. In 1837, the Leith Dispensary and Humane Society extended their activities by moving to a large house in Quality Street, now (Maritime Street), in what effectively became a Casualty Hospital.
By the 1840s, Leith was an independent burgh of some 40,000 people and pressure increased to establish and fund a new hospital. A public meeting in 1846 was called, it was agreed that the new institution would be called "The Leith Hospital"; a committee was formed and £115 was collected in subscriptions. Donations made towards the hospital included £1,000 from the estate of John Stewart of Laverockbank, but it was several years before agreement could be reached about the best site and for work to start. In 1850, the year before the opening of the new hospital, the Dispensary had dealt with 2,699 patients, the Casualty Hospital had treated 245 patients and the Humane Society seven patients.
The new building was planned by a committee which included the provost, baillies, local ministers, businessmen and doctors. A plot of land was purchased at the upper end of Sheriff Brae in 1849. The new hospital was built facing Mill Lane and was a two-storey building, with fever patients housed on the upper floor and the Humane Society, dispensary and casualty on the ground floor. The hospital opened to patients in 1851.
The early years
Much of the funding required to maintain the hospital was raised within the local Leith community. The new hospital incorporated the functions of the Casualty Hospital and the Dispensary. The first consulting physician to the hospital was James Scarth Combe (1796–1883), best known for his 1822 description of pernicious anaemia some years before that of Thomas Addison (1739–1860) whose name remains associated with the condition. In 1875 an extension to the hospital was built in King Street to meet increasing demand for its services. Another early physician was Dr John Coldstream (1806–1863).
In 1866, the hospital appointed its first district nurse, Mrs. Brown “to carry out faithfully the doctors’ orders, to instruct the relations or friends of the patient in the art of good nursing and to inculcate, and if necessary enforce, attention to cleanliness”. The hospital paid for her to attend a nursing course at King's College, London. Popular and hardworking she made 13,000 home visits in 1877 alone.
In 1874, the hospital appointed its first qualified Lady Superintendent of Nursing.
Two further extensions were added to the hospital in 1873 and 1888. In 1903 to mark Queen Victoria’s jubilee a new major extension, the surgical block, was opened on King Street facing the nurses’ home which had been built on the opposite side of the street. The two buildings were connected by tunnel running under King Street.
Teaching for medical students
Following the establishment by Sophia Jex-Blake (1840–1912) of the Edinburgh School of Medicine for Women, in 1887 the Hospital Directors gave Jex Blake permission to allow her female medical students to attend Leith Hospital for comprehensive clinical teaching. The arrangement began well.
In 1888, however, an incident in the hospital would lead to the demise of Jex-Blake’s School of Medicine for Women. Jex-Blake had a strict rule that students must leave the hospital by 5pm. In breach of this rule, four students stayed on to follow a case after hours. Jex-Blake dismissed two, Ina and Grace Cadell. Both successfully sued Jex-Blake and the school for wrongful dismissal.
The lawsuit was widely publicised. Together with wider opposition to medical education for women at the time, this put further pressure on Jex-Blake. The Edinburgh School of Medicine for Women closed in 1898.
The 20th century
At the start of the 20th century, Leith was a modern busy hospital, at last able to meet the health needs of the community which it served. The pressure on beds was further relieved by the opening of the East Pilton Fever Hospital in 1896.
In 1906 the first output of fully qualified physicians from Edinburgh University arrived and of these both Jessie Gellatly and Agnes Marshall Cowan joined the staff of Leith Hospital.
In 1908 the South Leith poorhouse moved to Seafield where it later became the Eastern General Hospital. The vacated site which fronted onto Great Junction Street was bought by the hospital in 1911 in the hope that it might be used for future expansion.
The Leith community was devastated by the death of many of its young men on their way to fight in the First World War. The Quintshill Rail Disaster in May 1915 resulted in 226 fatalities of whom 214 were soldiers of the 7th Battalion (Leith’s Own) Royal Scots on their way to Gallipoli. This remains Britain's worst rail disaster. A school of nursing was established and recognised by the general nursing Council in 1923.
As communities raised funds for war memorials, the Leith community decided that their war memorial should take the form of the children's wing for Leith Hospital. Fundraising started in 1919. Many individual benefactors supported the hospital by endowing beds, in memory of relatives killed in action in the First World War. The new building, which was designed by George Simpson, opened in January 1927. The new children's wing had a royal visit from the Duke and Duchess of Kent in May 1935. The hospital joined the National Health Service in 1948.
Closure
Leith Hospital closed in 1987, with the buildings converted to residential units. Local protests, including a petition to keep the hospital open, were unsuccessful. The building was sold for £1.6 million. Seventeen years later, the Leith Community Treatment Centre opened in Junction Place, offering a reduced range of services.
In October 2011, the Edinburgh-based Citadel Arts Group published Leith Hospital Recalled, a collection of memories from 50 contributors who were treated in or worked at the hospital. The project was funded by the Leith Benevolent Trust. A play based on the stories in the book, Leith's Hidden Treasure, was produced by the same group in 2012. Written by Laure C Paterson, the play was performed as part of the Leith Hospital Project, at the 2012 Leith Festival.
Notable staff
Notable staff included:
Thomas Addison
Edwin Bramwell
John Coldstream
James Scarth Combe
Thomas Latta
Andrew Russell Murray
A. A. Scot Skirving
Thomas Williamson
Sir David Wilkie
As one of the first hospitals to allow the teaching of women medical students on its wards, Leith was also one of the first to appoint female house surgeons and house physicians. The first female house physician was Dr Marion Ritchie, appointed in 1890, followed by Dr Agnes MacLaren the following year. Dr Mabel Ross was house physician in 1904 and Jessie Gellatly and Agnes Marshall Cowan were appointed in 1906.
References
1614 establishments in Scotland
1987 disestablishments in Scotland
Hospitals in Edinburgh
Monuments and memorials in Edinburgh
Listed hospital buildings in Scotland
Listed monuments and memorials in Scotland
Defunct hospitals in Scotland
Buildings and structures in Leith |
The following is an alphabetical list of articles related to the Republic of Chile.
0–9
.cl – Internet country code top-level domain for Chile
:1575 Valdivia earthquake
:1730 Valparaíso earthquake
:1835 Concepción earthquake
:1868 Arica earthquake
:1920 South American Championship
:1925 Chilean coup d'état
:1926 South American Championship
:1941 South American Championship
:1945 South American Championship
:1949 Tierra del Fuego earthquake
:1952 Ireland rugby union tour of South America
:1954 France rugby union tour of Argentina
:1955 South American Championship
:1960 Valdivia earthquake
:1962 FIFA World Cup
:1962 FIFA World Cup qualification
:1962 FIFA World Cup squads
:1973 Chilean coup d'état
:1985 Algarrobo earthquake
:1987 FIFA World Youth Championship
:1991 Copa América
:1992 Galvarino
:1997 South American Under-17 Football Championship
:19th World Scout Jamboree
:2000 World Junior Championships in Athletics
:2006 student protests in Chile
:2006–2007 Chilean corruption scandals
:2007 Aysén Fjord earthquake
:2007 Movistar Open
:2009 Dakar Rally
:2009 flu pandemic in Chile
:2009 Movistar Open
:2009 Movistar Open – Doubles
:2009 Movistar Open – Singles
:2010 American Men's Handball Championship
:2010 Chile earthquake
2010 Drake Passage earthquake
:2010 Movistar Open – Doubles
:2010 Movistar Open – Singles
:2010 Pichilemu earthquake
A
ABC nations
Abdón Cifuentes
Abel-Nicolas Bergasse du Petit-Thouars
Abelardo Castro
Abortion in Chile
Abraham Oyanedel
ABSA - Aerolinhas Brasileiras
Academic grading in Chile
Acción Emprendedora
Achibueno
Aconcagua River
Acotango
Acuy Island
Adán Vergara
Adelardo Rodríguez
Adjacent countries:
Administradora de Fondos de Pensiones-Provida
Administrative divisions of Chile
Adolf Scherer
Adolfo Ibáñez University
Adolfo Pedernera
Adolfo Zaldívar
Adriana Delpiano
Aero Cardal
Aerovías DAP
Aextoxicon
Agrarian Labor Party
Aguardiente
Agustín Eyzaguirre
Agustín Gamarra
Agustín Ross
Architecture of Agustín Ross in Pichilemu:
Agustín Ross Balcony
Agustín Ross Cultural Center
Agustín Ross Hotel
Agustín Ross Park
Ahu Tongariki
Aisén Fjord
Aisén Province
Aisén Region
Aku-Aku
Alacalufe people
Alacalufes National Reserve
Alameda del Libertador Bernardo O'Higgins
Alan Hodgkinson
Alan Peacock
Albert Brülls
Alberto Achacaz Walakial
Alberto Bachelet
Alberto Baeza Flores
Alberto Blest Gana
Alberto de Agostini National Park
Alberto Fuguet
Alberto Guerrero
Alberto Hurtado
Alberto Hurtado University
Alberto Larraguibel
Alejandrina Cox incident
Alejandro Amenábar
Alejandro Escalona
Alejandro Jadresic
Alejandro Jodorowsky
Alejandro Selkirk Island
Alejandro Silva (musician)
Alejandro Zambra
Alerce Andino National Park
Alerce Costero Natural Monument
Alerce, Chile
Alessandri family
Alexander Witt
Alexis Sánchez (mononymous footballer "Alexis")
Alférez (rank)
Alfonso Leng
Alfonso Ugarte
Alfredo Di Stéfano
Alfredo Stroessner
Alianza Americana Anticomunista
Alianza Anticomunista Argentina
Alicanto
Alicia Kirchner
Allende family
Allende stamps
Alliance for Chile
Allipén River
Almirante class destroyer
Almirante Condell
Almirante Condell 3
Almirante Lynch
Almirante Lynch 3
Almirante Lynch class destroyer (1912)
Alonso de Ercilla y Zúñiga
Alonso de Ribera
Alonso de Sotomayor
Alonso García de Ramón
Alpaca
Alpine Air Express Chile
Altair Gomes de Figueiredo
Altiplano
Alto Biobío National Reserve
Alto de la Alianza
Alto Hospicio
Altos de Lircay National Reserve
Álvaro Fillol
Álvaro Guevara
Amalia Glacier
Ambrosio O'Higgins, 1st Marquis of Osorno
Ambrosio O'Higgins, Marquis of Osorno
Americas
South America
South Pacific Ocean
Islands of Chile
Isla Grande de Tierra del Fuego
Estrecho de Magallanes (Strait of Magellan
Mar de Hoces (Drake Passage)
Américo
Ana González Olea
Anacleto Angelini
Ancoa
Ancud
Andacollo
Andean cat
Andean condor
Andean tinamou
Andes
Andrej Kvašňák
Andrés Avelino Cáceres
Andrés Bello
Andrés de Santa Cruz
Andrés Morales
Andrés Neubauer
Andrés Pascal Allende
Andrés Wood
Andrés Zaldívar
Andrónico Luksic
Ángel Parra (singer-songwriter)
Ángel Parra Jr.
Angol
Aníbal Pinto
Aníbal Rodríguez
Anita Lizana
Anselmo Raguileo Lincopil
Antarctic flora
Antarctic Treaty System
Antártica
Antártica Chilena Province
Anticuchos
Antillanca
Antillanca ski resort
Antofagasta
Antofagasta PLC
Antofagasta Province
Antofagasta Region
Antofagasta, Chile
Antonio Carbajal
Antonio Luis Jiménez
Antonio Pareja
Antonio Prieto
Antonio Prieto (actor)
Antonio Rattín
Antonio Roma
Antonio Samoré
Antonio Skármeta
Apostolic Vicariate of Aysén
Arab Chileans
Araucanía Region
Araucanization
Araucaria
Araucaria araucana
Arauco Province
Arauco War
Archdiocese of Antofagasta
Archdiocese of Concepción, Chile (created as Diócesis de La Santísima Concepción)
Archdiocese of La Serena
Archdiocese of Puerto Montt
Archdiocese of Santiago de Chile
Archipiélago de Juan Fernández National Park
Archives of Terror
Arena Santiago
Argentina–Chile relations
Arica
Arica and Parinacota Region
Arica Province
Arica, Chile
Arica-Parinacota Region
Ariel Dorfman
Army of the Andes
Arriba en la Cordillera
Arts Faculty, Universidad de Chile
Arturo Alessandri
Arturo Frei
Arturo Godoy
Arturo Merino Benítez
Arturo Merino Benítez International Airport
Arturo Prat
Arturo Prat University
Arturo Valenzuela
ARTV (Chile)
Asado
Asociación de Guías y Scouts de Chile
Asociación Nacional de Fútbol Profesional
Astronomy in Chile
Atacama
Atacama border dispute
Atacama Department
Atacama Desert
Atacama Giant
Atacama Large Millimeter Array
Atacama Pathfinder Experiment
Atacama Region
Atacama Submillimeter Telescope Experiment
Atlas of Chile
Aucán Huilcamán
Audax Club Sportivo Italiano
Audax Italiano
Augusto Pinochet
Augusto Pinochet's arrest and trial
Australia–Chile Free Trade Agreement
Australian rules football in Chile
Austrocedrus
Austrochilidae
Austronesian people
Ayacucho Quechua
Aymara language
Aymara people
Aymoré Moreira
Azapa Valley
B
Bahá'í House of Worship
Bahia Wulaia
Baker River (Chile)
Ballet Azul
Balmaceda, Chile
Baltazar de Cordes
Baltimore Crisis
Banco Central de Chile
Banco de Chile
BAP Atahualpa
BAP Manco Cápac
Barrio Bellavista
Barrio Puerto
Barrio Suecia
Barros Jarpa
Barros Luco
Bartolomé Blanche
Bartolomé Blumenthal
Base General Bernardo O'Higgins Riquelme
Base Presidente Eduardo Frei Montalva
Basilisco Chilote
Basque Chilean
Basta (album)
Batallón de Inteligencia 601
Battle of Abtao
Battle of Angamos
Battle of Arica
Battle of Callao
Battle of Cancha Rayada
Battle of Chacabuco
Battle of Chipana
Battle of Huamachuco
Battle of Iquique
Battle of Maipú
Battle of Papudo
Battle of Pisagua
Battle of Punta Gruesa
Battle of Rancagua
Battle of San Francisco
Battle of San Juan and Chorrillos
Battle of Santiago
Battle of Tarapacá
Battle of the Maule
Battle of Topáter
Battle of Tucapel
Battle of Yungay
Batuco
Beagle Channel
Beagle Channel Arbitration
Beagle Channel cartography since 1881
Beagle conflict
Beatriz Allende
Beatriz Marinello
Beer in Chile
Benedicto Villablanca
Benjamín Vicuña Mackenna
Benjamín Vicuña MacKenna
Berberis buxifolia
Berberis darwinii
Berberis microphylla
Berberis negeriana
Bernardo Leighton
Bernardo O'Higgins
Bernardo O'Higgins National Park
Bertha Puga Martínez
Beto Cuevas
Biblioteca Nacional de Chile
Biblioteca Nacional del Perú
Biobío
Biobío Province
Biobío Region
Biobío River
Biotren
Birmingham Solar Oscillations Network
Black-necked swan
Bobby Charlton
Bobby Moore
Bobby Robson
Boldo
Bolivia–Chile relations
Bombardment of Callao
Boris Weisfeiler
Bosque de Fray Jorge National Park
Boundary treaty of 1881 between Chile and Argentina
Brazil–Chile relations
British Chilean
Brüggen Glacier
Brunswick Peninsula
Bryan Douglas
Bucalemu
Budi Lake
Buenos Aires/General Carrera Lake
Buin, Chile
Burnt Alive Case
C
C.D. Huachipato
C.D. La Serena
C.D. O'Higgins
C.D. Palestino
C.D. Universidad de Concepción
C.F. Universidad de Chile
Cabo de Hornos Biosphere Reserve
Cabo de Hornos National Park
Cabo de Hornos, Chile
Cabrero
Caburgua Lake
Cachapoal Province
Cajón del Maipo
Calama, Chile
Calbuco
Calbuco (volcano)
Calbuco Department
Caldera, Chile
Calera de Tango
Caleuche
Calfucurá
Calle 7 (TVN)
Calle-Calle River
Camahueto
Camarones (Chile)
Camerón
Cami Lake
Camilo Henríquez
Camilo Mori
Camilo Valenzuela
Camiña
Campeonato Nacional de Rodeo
Canada–Chile Free Trade Agreement
Canada–Chile relations
Canal 13 (Chile)
Canal del Fútbol (Chile)
Candelaria Perez
Candelaria Pérez
Canela, Chile
Cañal Bajo Carlos Hott Siebert Airport
Cañete, Chile
Cape Froward
Cape Horn
Cape Horn Biosphere Reserve
Capital of Chile: Santiago
Capitan O'Brien class submarine (1928)
Capitán Pastene
Capitán Prat Province
Captain Arturo Prat Base
Captaincy General of Chile
Capture of Valdivia
Carabineros de Chile
Carahue
Caravan of Death
Cardenal Antonio Samoré Pass
Cardenal Caro Province
Carlos Altamirano
Carlos Campos Sánchez
Carlos Camus
Carlos Cardoen
Carlos Catasse
Carlos Conca
Carlos Dávila
Carlos Frödden
Carlos González Cruchaga
Carlos Ibáñez del Campo
Carlos José Castilho
Carlos Kaiser
Carlos Keller
Carlos Labrín
Carlos Lorca
Carlos Lucas
Carlos Pezoa Véliz
Carlos Pinto (journalist)
Carlos Prats
Carlos Reinoso
Carlos Sotomayor
Carlos Tejas
Carlos Torres (astronomer)
Carlos Villanueva (footballer)
Carmen Gloria Quintana
Carmen Weber
Carménère
Carolina Aguilera
Carolina Tohá
Carrán-Los Venados
Carrera family
Carretera Austral
Carriel Sur International Airport
Casa de Isla Negra
Casablanca, Chile
Casimiro Marcó del Pont
Caso Degollados
Castaño (bakery)
Casto Méndez Núñez
Castro, Chile
Catalina de Erauso
Categories:
:Category:Chile
:Category:Buildings and structures in Chile
:Category:Chile stubs
:Category:Chilean culture
:Category:Chilean people
:Category:Chile-related lists
:Category:Communications in Chile
:Category:Economy of Chile
:Category:Education in Chile
:Category:Environment of Chile
:Category:Geography of Chile
:Category:Government of Chile
:Category:Health in Chile
:Category:History of Chile
:Category:Images of Chile
:Category:Law of Chile
:Category:Military of Chile
:Category:Politics of Chile
:Category:Science and technology in Chile
:Category:Society of Chile
:Category:Sport in Chile
:Category:Transport in Chile
:Category:Transportation in Chile
commons:Category:Chile
Catholic University of the Holy Conception
Catholic University of the Maule
Catholic University of the North
Caupolican
Caupolicán
Cauquenes
Cauquenes Province
Cauquenes River
Cautín Province
Cautín River
Cazuela
CDtv
Cecilia Amenábar
Cecilia Bolocco
Cementerio General de Chile
Cementerio General de Santiago
Central Andean dry puna
Central Autónoma de Trabajadores
Central Bank of Chile
Centro Cultural Palacio de La Moneda
Cerrillos (municipality)
Cerrillos, Chile
Cerro Armazones
Cerro Azul (Chile volcano)
Cerro Bayo Complex
Cerro Castillo National Reserve
Cerro Castillo, Chile
Cerro Chaltén
Cerro Cosapilla
Cerro Escorial
Cerro Minchincha
Cerro Navia
Cerro Pantoja
Cerro Paranal
Cerro San Cristóbal
Cerro Santa Lucía
Cerro Solo
Cerro Sombrero, Chile
Cerro Tololo Inter-American Observatory
Cerro Torre
César Barros (fencer)
César Mendoza
Cesare Maldini
Cetacean Conservation Center
Ceviche
Chacabuco
Chacabuco Province
Chacao Channel
Chacao Channel bridge
Chacarero
Chaitén
Chaitén Volcano
Challenger de Providencia – Copa Cachantún
Chamanto
Chamber of Deputies of Chile
Chancaca
Chan-Chan
Chanco cheese
Chanco, Chile
Chañaral
Chañaral Island
Chañaral Province
Charles Horman
Charles W. Cole
Charlotte Lewis
Charqui
Charquicán
Chépica
Chicago Boys
Chicha
Chicharrón
Children's rights in Chile
Chile
Chile – United States Free Trade Agreement
Chile – United States relations
Chile Antarctic Geopolitics
Chile at the 1896 Summer Olympics
Chile at the 1912 Summer Olympics
Chile at the 1920 Summer Olympics
Chile at the 1924 Summer Olympics
Chile at the 1928 Summer Olympics
Chile at the 1936 Summer Olympics
Chile at the 1948 Summer Olympics
Chile at the 1948 Winter Olympics
Chile at the 1952 Summer Olympics
Chile at the 1952 Winter Olympics
Chile at the 1956 Summer Olympics
Chile at the 1956 Winter Olympics
Chile at the 1960 Summer Olympics
Chile at the 1960 Winter Olympics
Chile at the 1964 Summer Olympics
Chile at the 1964 Winter Olympics
Chile at the 1968 Summer Olympics
Chile at the 1968 Winter Olympics
Chile at the 1972 Summer Olympics
Chile at the 1976 Summer Olympics
Chile at the 1976 Winter Olympics
Chile at the 1984 Summer Olympics
Chile at the 1984 Winter Olympics
Chile at the 1988 Summer Olympics
Chile at the 1988 Winter Olympics
Chile at the 1992 Summer Olympics
Chile at the 1992 Winter Olympics
Chile at the 1994 Winter Olympics
Chile at the 1996 Summer Olympics
Chile at the 1998 Winter Olympics
Chile at the 2000 Summer Olympics
Chile at the 2002 Winter Olympics
Chile at the 2004 Summer Olympics
Chile at the 2006 Winter Olympics
Chile at the 2006 Winter Paralympics
Chile at the Olympics
Chile Chico
Chile Davis Cup team
Chile Democrático
Chile helps Chile
Chile Highway 5
Chile national basketball team
Chile national cricket team
Chile national football team
Chile national futsal team
Chile men's national handball team
Chile national rugby union team
Chile national rugby sevens team
Chile national under-17 football team
Chile national under-20 football team
Chile Open (golf)
Chile Open (tennis)
Chile Rise
Chile Student Strike of 2006
Chile under Allende
Chile under Pinochet
Chile women's national field hockey team
Chile women's national handball team
Chilean Air Force
Chilean American
Chilean angelshark
Chilean Army
Chilean Australian
Chilean battleship Almirante Latorre
Chilean Blob
Chilean Central Valley
Chilean Chess Championship
1891 Chilean Civil War
Chilean Civil War of 1829
Chilean Coast Range
Chilean Communist Party (Proletarian Action)
1980 Chilean constitutional referendum
Chilean Council of State
Chilean coup d'état, List of
Chilean coup of 1973
Chilean cuisine
Chilean Cycling Federation
Chilean Declaration of Independence
Chilean destroyer Aldea (1928)
Chilean destroyer Almirante Condell
Chilean destroyer Almirante Lynch (1912)
Chilean destroyer Hyatt (1928)
Chilean destroyer Ministro Portales
Chilean destroyer Ministro Portales (DD-17)
Chilean dolphin
Chilean dolphin
Chilean escudo
Chilean flamingo
Chilean Football Federation
Chilean football league system
Chilean Fox Terrier
Chilean frigate Almirante Condell (PFG-06)
Chilean frigate Almirante Lynch (PFG-07)
Chilean frigate Blanco Encalada (1875)
Chilean grape scare
Chilean horse
Chilean icebreaker Contraalmirante Oscar Viel Toro
Chilean Independence
Chilean Matorral
2008 Chilean municipal election
Chilean mythology
Chilean National History Museum
Chilean National Plebiscite, 1980
Chilean nationality law
Chilean nationalization of copper
Chilean Navy
1961 Chilean parliamentary election
1965 Chilean parliamentary election
1969 Chilean parliamentary election
1973 Chilean parliamentary election
2005 Chilean parliamentary election
2009 Chilean parliamentary election
Chilean people
Chilean peso
1989 Chilean political reform referendum
Chilean political scandals
1826 Chilean presidential election
1827 Chilean presidential election
1829 Chilean presidential election
1831 Chilean presidential election
1836 Chilean presidential election
1841 Chilean presidential election
1846 Chilean presidential election
1851 Chilean presidential election
1856 Chilean presidential election
1861 Chilean presidential election
1866 Chilean presidential election
1871 Chilean presidential election
1876 Chilean presidential election
1881 Chilean presidential election
1886 Chilean presidential election
July 1891 Chilean presidential election
October 1891 Chilean presidential election
1896 Chilean presidential election
1901 Chilean presidential election
1906 Chilean presidential election
1910 Chilean presidential election
1915 Chilean presidential election
1920 Chilean presidential election
1925 Chilean presidential election
1927 Chilean presidential election
1931 Chilean presidential election
1932 Chilean presidential election
1938 Chilean presidential election
1942 Chilean presidential election
1946 Chilean presidential election
1952 Chilean presidential election
1958 Chilean presidential election
1964 Chilean presidential election
1970 Chilean presidential election
1989 Chilean presidential election
1993 Chilean presidential election
1999–2000 Chilean presidential election
1999–2000 Chilean presidential election
2005–06 Chilean presidential election
2005–06 Chilean presidential election
2009–10 Chilean presidential election
2009–10 Chilean presidential election
Chilean Primera División
Chilean Quechua
Chilean recluse
Chilean Resistance
Chilean Revolution of 1829
Chilean rock
Chilean rodeo
Chilean rose tarantula
Chilean salad
Chilean school uniform
Chilean Sea
Chilean ship Almirante Latorre
Chilean ship Blanco Encalada
Chilean ship Cochrane
Chilean Sign Language
Chilean skua
Chilean Spanish
Chilean tinamou
Chilean Traditional Universities
Chilean transition to democracy
Chilean War of Independence
Chilean wine
Chilean-Greek relations
Chilean–Peruvian maritime dispute of 2006–2007
Chile–Finland relations
Chile–India relations
Chile–Peru relations
ChilePuede
Chile–Turkey relations
Chilevisión
Chili Gulch
Chillán
Chiloé Archipelago
Chiloé Island
Chiloé National Park
Chiloé Province
Chilöe wigeon
Chilotan architecture
Chilote mythology
Chilote Spanish
Chimbarongo
Chincha Islands War
Chinese people in Chile
Choapa Province
Choco Panda
Chon languages
Chonchi
Chonchón
Chonos Archipelago
Choripán
Chorus giganteus
Christ the Redeemer of the Andes
Christian Castañeda
Christian Democrat Party of Chile
Christian Left Party (Chile)
Christina Montt
Chungará Lake
Chupalla
Chuquicamata
Churches of Chiloé
Churrasco
Churro
City of the Caesars
Civil Code (Chile)
Clandestine in Chile
Clara Solovera
Clarence Acuña
Claudia Acuña
Cláudio Andrés Maldonado
Claudio Arrau
Claudio Barrientos
Claudio Bravo (painter)
Claudio Bravo (footballer)
Claudio Bunster
Claudio Huepe
Claudio Maldonado
Claudio Naranjo
Claudio Narea
Claudio Parra
Claudio Valenzuela
Clemente de Lantaño
Climate of Chile
Clodomiro Almeyda
Club de Deportes Antofagasta
Club de Deportes La Serena
Club de Deportes Puerto Montt
Club de Deportes Santiago Morning
Club de Deportes Santiago Wanderers
Club de Deportes Temuco
Club Deportes Cobresal
Club Deportivo Ferroviario Almirante Arturo Fernández Vial
Club Deportivo Huachipato
Club Deportivo O'Higgins
Club Deportivo Palestino
Club Deportivo Universidad Católica
Club Deportivo Universidad de Concepción
Club Social de Deportes Rangers
Club Social de Deportes Rangers de Talca
Coalition (Chile)
Coalition for Change
Coalition of Parties for Democracy
Cobquecura
Cobreloa
Cochamó
Cochrane, Chile
Codegua
Codelco
Codpa
Coi Coi-Vilu
Coihaique
Coihaique Province
Coihue
Coínco
Colbún
Colbún Lake
Colchagua Province
Colchane
Colegio de la Preciosa Sangre de Pichilemu
Colegio del Verbo Divino
Colico Lake
Colina, Chile
Collipulli
Colo Colo (mythology)
Colo-Colo
Colo-Colo season 2007
Colo Colo season 2008
Colo-Colo season 2009
Colo-Colo season 2010
Colocolo (tribal chief)
Colombina Parra
Colonia Dignidad
Coltauco
Combarbalá
Communes of Chile
Communications in Chile
Communist Left (Chile)
Communist Party of Chile
Compañía Chilena de Televisión
Concepción Province, Chile
Concepción, Chile
Concert of Parties for Democracy
Concha y Toro
Concha y Toro Winery
Conchalí
Concholepas concholepas
Condorito
Confidence-building measures in South America
Conguillío Lake
Conguillío National Park
Cono Sur Vineyards & Winery
Conservative Party (Chile)
Constitución, Chile
Constitution of Chile
Contulmo
Coordination of United Revolutionary Organizations
Copahue
Copec
Copesa
Copiapó
Copiapó Province
Copiapó River
Copihue
Coquimbo
Coquimbo Region
Coquimbo Unido
Corcovado National Park (Chile)
Cordillera Darwin
Cordillera de Mahuidanchi
Cordillera de Nahuelbuta
Cordillera de Talinay
Cordillera del Paine
Cordillera Province, Chile
Cordón del Azufre
CORFO
Coronel, Chile
Corporación Deportiva Everton de Viña del Mar
Corral Bay
Corral Bay Forts
Corral, Chile
Corvo (knife)
Coscoroba swan
Cosmic Background Imager
Costanera Center
Covadonga (ship)
Coyhaique
Coyhaique Province
Crescente Errázuriz
Cristian Álvarez
Cristián Castañeda
Cristián de la Fuente
Cristo Redentor Tunnel
Crossing of the Andes
Crudos
Cruz del Tercer Milenio
CSAV
Cucalón (comic strip)
Cueca
Cueva del Milodón Natural Monument
Cuisine of Chile
Culpeo
Culture of Chile
Curacautín
Curaco de Vélez
Curanipe
Curanto
Curarrehue
Curepto
Curicó
Curicó Province
Curtis Warren Kamman
Cyrus Vance
Cyttaria espinosae
D
Dagoberto Godoy
Dalcahue
Daniela Castillo
Darwin Sound
Darwin's fox
Dassault Mirage 5
David Arellano
David H. Popper
David Moya
David Pizarro
David Rosenmann-Taub
Dawson Island
Day of the Youth Combatant
De la Laguna River
Deal or No Deal (Chile)
Decipherment of rongorongo
Degu
Del Toro Lake
Delfina Guzmán
Democratic Alliance (Chile)
Demographics of Chile
Deportes Antofagasta
Deportes Puerto Montt
Deportes Valdivia
Derek Kevan
Desventuradas Islands
Diablada
Diaguita
Diamela Eltit
Diana Bolocco
Dichato
Dickson Lake
Diego Barros Arana
Diego de Almagro
Diego Portales
Diego Portales University
Diego Ramírez Islands
Dimitar Yakimov
DINA
Diocese of Arica
Diocese of Chillán
Diocese of Copiapó
Diocese of Iquique
Diocese of La Santísima Concepción
Diocese of La Santísima Concepción, Chile
Diocese of Linares
Diocese of Los Ángeles
Diocese of Melipilla
Diocese of Osorno
Diocese of Punta Arenas
Diocese of Rancagua
Diocese of San Bernardo, Chile
Diocese of San Carlos de Ancud
Diocese of San Felipe, Chile
Diocese of Talca
Diocese of Temuco (disambiguation)
Diocese of Valdivia
Diocese of Valparaíso (disambiguation)
Diocese of Villarrica
Dirección de los Servicios de Inteligencia y Prevención
Direct negotiations between Chile and Argentina in 1977–1978
Direct negotiations between Chile and Argentina in 1977-78
Dirty War
Disaster of Curalaba
Disaster of Rancagua
Distribución y Servicio
División Mayor del Básquetbol de Chile
Djalma Santos
Domingo Eyzaguirre
Domingo Ortiz de Rosas
Domingo Ortíz de Rosas, 1st Marquis of Poblaciones
Domingo Santa María
Don Francisco (television host)
Don Howe
Doñihue
Dragoslav Šekularac
Drake Passage
Dražan Jerković
Drimys
Dulce de membrillo
Dutch Chilean
Dutch colonization of the Americas
E
Easter Island
Ecologist Party (Chile)
Economic history of Chile
Economy of Chile
Ed Koch
Edmundo Searle
Eduardo Abaroa
Eduardo Alquinta
Eduardo Barrios
Eduardo Bonvallet
Eduardo Carrasco
Eduardo Frei Montalva
Eduardo Frei Ruiz-Tagle
Eduardo Gatti
Eduardo Lobos
Eduardo Parra
Eduardo Parra Pizarro
Education in Chile
Edward M. Korry
Efrain Díaz
El Bosque (municipality, Chile)
El Bosque, Chile
El Derecho de Vivir en Paz (album)
El Diario Austral de Valdivia
El Loa Province
El Manzano (prison)
El Mercurio
El Monte, Chile
El Morado Natural Monument
El Naveghable
El pueblo unido jamás será vencido
El Salvador mine
El Salvador, Chile
El Siglo
El Tamarugal Province
El Tatio
El Teniente
El Tepual Airport
El Toqui mine
El Yali National Reserve
Elections in Chile
Electoral divisions of Chile
Elegant crested tinamou
Elevenses
Elías Figueroa
Elicura Chihuailaf
Eliodoro Yáñez
Eliseo Salazar
Elqui Province
Elqui River
Ely Tacchella
Embassy of Chile, Ottawa
Embothrium
Emiliano Figueroa
Empanada
Empedrado, Chile
Empedrado, Talca
Emperor penguin
Empresas Copec
ENAER Pantera
English Chilean
English Opens Doors
Enrico Albertosi
Enrique Balmaceda
Enrique Cood
Entel (Chile)
Entel PCS
Erasmo Escala
Eric Goles
Erik Bongcam-Rudloff
Escondida
Esmeralda (BE-43)
Estación Central
Estación Central railway station
Estación Mapocho
Estadio Bicentenario de La Florida
Estadio Carlos Dittborn
Estadio de Hanga Roa
Estadio El Cobre
Estadio El Teniente
Estadio Fiscal
Estadio Fiscal de Talca
Estadio Francisco Sánchez Rumoroso
Estadio La Portada
Estadio Las Higueras
Estadio Monumental David Arellano
Estadio Municipal de Calama
Estadio Municipal de Concepción
Estadio Municipal de La Florida
Estadio Municipal Francisco Sánchez Rumoroso
Estadio Nacional de Chile
Estadio Playa Ancha
Estadio Regional Chiledeportes
Estadio Regional de Antofagasta
Estadio Regional de Chinquihue
Estadio San Carlos de Apoquindo
Estadio Santa Laura
Estadio Santiago Bueras
Estadio Sausalito
Estadio Víctor Jara
Estero Calbuco
Etc...TV
Eucryphia
Eugenia Errázuriz
Eulogio Martínez
European Extremely Large Telescope
European Southern Observatory
Everton de Viña del Mar
Ex Congreso Nacional
Extreme points of Chile
F
Fabián Estay
Fagnano Lake
Fahrenheit (Chilean band)
Faja Maisan
Falabella
False Cape Horn
Falso Azufre
FAMAE FD-200
Fatherland and Liberty
Faustino Asprilla
Federación de Fútbol de Chile
Federico Errázuriz Echaurren
Federico Errázuriz Zañartu
Federico Santa María
Federico Santa María Technical University
Felipe Barral Momberg
Felipe Seymour
Ferenc Puskás
Fernando Cornejo (footballer, born 1969)
Fernando Errázuriz Aldunate
Fernando Flores
Fernando González
Fernando Krahn
Fernando Matthei
Fernando Solis
Fernando Solís
Ferrocarril de Antofagasta a Bolivia
Fiestas Patrias (Chile)
Fitzroya
Flag of Chile
Flórián Albert
Floribella
Flying steamer duck
Fog collection
Football in Chile
Forced disappearance
Foreign relations of Chile
Fort Bulnes
Fortín Mapocho
Francisco Antonio Encina
Francisco Antonio García Carrasco
Francisco Antonio Pinto
Francisco Bolognesi
Francisco Coloane
Francisco de Aguirre
Francisco de Aguirre (conquistador)
Francisco de la Lastra
Francisco de Meneses Brito
Francisco de Villagra
Francisco Gento
Francisco Hudson
Francisco Ibáñez de Peralta
Francisco Javier Errázuriz Talavera
Francisco Javier Errázuriz Ossa
Francisco Javier Errázuriz Talavera
Francisco Laso de la Vega
Francisco López de Zúñiga
Francisco López de Zúñiga, 2nd Marquis of Baides
Francisco Maldonado da Silva
Francisco Marcó del Pont
Francisco Nef
Francisco Ramón Vicuña
Francisco Rojas
Francisco Ruiz-Tagle
Francisco Varela
Francoaceae
FRAP (Chile)
Frei family
French Chilean
Frutillar
Fuegians
Fundación Chile
Futaleufú River
Futrono
G
Gabino Gaínza
Gabriel Cano de Aponte
Gabriel Donoso
Gabriel González Videla
Gabriel Guerra-Mondragón
Gabriel Parra
Gabriel Salazar
Gabriela Mistral
Gabriela Mistral University
Galvarino
García Hurtado de Mendoza, 5th Marquis of Cañete
García Hurtado de Mendoza, Marquis of Cañete
Garrincha
Gaucho
Gay rights in Chile
Gemini Observatory
General Bernardo O'Higgins Airport
General Carrera Lake
General Carrera Province
General Lagos
Geoffroy's cat
Geography of Chile
Geology of Chile
George Eastham
George Robledo
George W. Landau
Georgi Asparuhov
Geothermal power in Chile
German Casas
Germán Casas
German Chilean
Germán Riesco
Gerry Hitchens
Gert Weil
Giacomo Bulgarelli
Gianni Rivera
Giant Magellan Telescope
Gilmar
Giovanni Ferrari
Giovanni Trapattoni
Gladys Marín
Gomortega
Gondwana (Chilean band)
Gonzalo Jara
Gonzalo Lira
Gonzalo Rojas
Gordon Banks
Government Juntas of Chile
Government Junta of Chile (1810)
Government Junta of Chile (1823)
Government Junta of Chile (1829)
Government Junta of Chile (1891)
Government Junta of Chile (1924)
Government Junta of Chile (1925)
Government Junta of Chile (1932)
Government Junta of Chile (1973)
Government Junta of Chile (August 1811)
Government Junta of Chile (December 1811)
Government Junta of Chile (November 1811)
Gracias a la Vida (charity song)
Graneros
Great Chilean earthquake
Greater Iquique
Greater Valparaíso
Greeks in Chile
Green Party of Chile
Green-backed firecrown
Gregorio Billikopf
Grey Lake
Grey River (Chile)
Grupo Montparnasse
Guafo Island
Guanaco
Guanaqueros
Guaraculén
Guayaneco Archipelago
Guillermo "Willy" Oddó
Guitarrón chileno
Gulf of Ancud
Gulf of Corcovado
Gulf of Penas
Gustavo Becerra-Schmidt
Gustavo Leigh
Gyula Grosics
H
Haig's tuco-tuco
Halcones
Hallulla
Hanga Roa
Hans Gildemeister
Hans Schäfer
Hans Tilkowski
Hardy Peninsula
Health care in Chile
Hector Tapia
Héctor Tapia
Heinz Schneiter
Helenio Herrera
Helio Gallardo
Helmut Haller
Helvecia Viera
Henry Kissinger
Heraldo Muñoz
Herbert Erhardt
Herminia Arrate
Hermite Islands
Hermogenes Valdebenito
Hernán Neira
Héroes (Chilean miniseries)
Hetroertzen
Hiking in Chile
Hil Hernández
Hilarión Daza
Hilderaldo Bellini
Himno Nacional de Chile
Hipodromo Chile
Hispanic
Hispanidad
Hispanophone
History of Chile
History of Chile during the Parliamentary Era (1891–1925)
History of Easter Island
HMS Antrim (D18)
HMS Glamorgan (D19)
HMS Grafton (F80)
HMS Norfolk (F230)
HMS Sheffield (F96)
Holland 602 type submarine
Honorino Landa
Horacio Salinas
Horacio Troche
Horatio Sanz
Hornopirén National Park
Hornos Island
Horst Szymaniak
Hortensia Bussi
Hospital Carlos Van Buren
Hospital del Tórax
Hoste Island
Hotel Hanga Roa
Hotu Matu'a
Hualaihué
Hualañé
Huara
Huáscar (ship)
Huasco Province
Huasco, Chile
Huaso
Huaso (horse)
Huechuraba
Huemul (zoology)
Huerquehue National Park
Huerta del Maule
Huillac Ñusca
Huillice language
Huilliche
Huilliche language
Huinay
Human rights in Chile
Human trafficking in Chile
Humanist Party (Chile)
Humanitarian response to the 2010 Chile earthquake
Humberstone and Santa Laura Saltpeter Works
Humberto Maschio
Humberto Maturana
Humberto Nilo
Humboldt penguin
Humita
Hungarians in Chile
I
Ibero-America
Ibero-American Summit
Iglesia de la Matriz
Ignacio Carrera Pinto
Ignacy Domeyko
Igor Chislenko
Ildefonso Islands
Illapel
Illapu
Imbunche
Immigration to Chile
In Patagonia
Incahuasi
Independencia, Chile
Independent Democrat Union
Independent Liberal Party (Chile)
Indigenous peoples in Chile
Inés de Suárez
Inés Suárez
Informe especial
Ingrid Antonijevic
Instituto Antártico Chileno
Instituto Nacional
Instituto O'Higgins, Rancagua
Intermediate Depression
International Organization for Standardization (ISO)
ISO 3166-1 alpha-2 country code for Chile: CL
ISO 3166-1 alpha-3 country code for Chile: CHL
ISO 3166-2:CL region codes for Chile
International rankings of Chile
Internet in Chile
Inti-Illimani
Invunche
Iquique
Iquique Province
Irruputuncu
Isabel Allende
Isabel Allende (politician)
Isabel Parra
Isidoro Dubournais
Isla Chañaral
Isla Grande de Tierra del Fuego
Isla Magdalena National Park
Isla Navarino
Isla Salas y Gómez
Islam in Chile
Islands of Chile
Islotes de Puñihuil Natural Monument
Israel Polack
Isthmus of Ofqui
Italian Chilean
Itata River
Iván Morovic
Iván Zamorano
J
Jacqueline van Rysselberghe
Jaime Collyer
Jaime Fillol
Jaime Guzmán
James D. Theberge
James's flamingo
Jan Lála
Ján Popluhár
Japanese Chilean
Javier Margas
Javiera Carrera
Javiera Parra
Jerónimo Méndez
Jéssica Eterovic
Jimmy Armfield
Jimmy Greaves
Joaquín Larraín Gandarillas
Joaquín Lavín
Joaquín Peiró
Joaquín Toesca
Joel Roberts Poinsett
John Connelly (footballer, born 1938)
John Dinges
John O'Leary (ambassador)
John Thomas North
John Williams Wilson
Johnnathan Tafra
Johnny Haynes
Jonnathan Tafra
Jorge Alessandri
Jorge Edwards
Jorge Garcia
Jorge Garretón
Jorge González von Marées
Jorge Medina Estévez
Jorge Montt
Jorge Peña Hen
Jorge Quinteros
Jorge Quinteros (mountaineer)
Jorge Rafael Videla
Jorge Urrutia
Jorge Valdivia
José A. Santos
José Alejandro Bernales
José Altafini
José Antonio Pareja
Jose Antonio Vidaurre
José Antonio Vidaurre
José Arraño Acevedo
José Ballivián
José Bohr
José de Garro
José de la Riva Agüero
José de San Martín
José de Santiago Concha
José Donoso
José Ely de Miranda
José Fernando de Abascal y Sousa
José Ignacio Zenteno
José Joaquín Pérez
José Joaquín Prieto
José López Rega
José Luis Sierra
José Luis Villanueva
José Macia
José Manuel Balmaceda
José Manuel Pareja
José María Vélaz
José Miguel Carrera
José Miguel Contreras
José Miguel Infante
José Miguel Insulza
José Pedro Fuenzalida
José Piñera
José Rafael Balmaceda
José Santamaría
José Tadeo Mancheño
José Tohá
José Tomás Ovalle
José Toribio Medina
José Toribio Merino
José Zalaquett
Josef Jelínek
Josef Kadraba
Josef Masopust
Josip Skoblar
Jozef Adamec
Jozef Bomba
Juan Andrés de Ustariz
Juan Antonio Pezet
Juan Antonio Ríos
Juan Carlos Carbonell
Juan Carlos Latorre
Juan Carlos Lorenzo
Juan Claudio González
Juan Downey
Juan Emilio Cheyre
Juan Esteban Montero
Juan Fernández Islands
Juan Francisco Salazar
Juan Guzmán Tapia
Juan Ignacio Molina
Juan José Latorre
Juan José Torres
Juan Jufré
Juan Luis Sanfuentes
Juan Mackenna
Juan Maino
Juan Manuel Pareja
Juan Martinez de Rozas
Juan Martínez de Rozas
Juan Orrego-Salas
Juan Pablo II Bridge
Juan Quiroga (footballer, born 1973)
Juan Somavía
Juan Subercaseaux
Juan Williams Rebolledo
Juan Zanelli
Juana Rosa Aguirre
Juanita Parra
Judiciary of Chile
Julio Canessa
Julio Moreno (fencer)
Juntas de Abastecimientos y Precios
Juntos PODEMOS Más
Juvencio Valle
K
Kakauhua language
Kalimotxo
Kalku
Katalalixar National Reserve
Kawésqar language
Kelp goose
Kenneth Maxwell
Kiltro
King penguin
Kingdom of Araucania and Patagonia
Klaus Junge
Klaus von Storch
Kodkod
Kuchen
Kudai
L
La Araucana
La Calera, Chile
La Campana National Park
La Campana-Peñuelas
La Cisterna
La Cuarta
La Dehesa
La Estrella, Chile
La Florida, Chile
La Granja, Chile
La Ley (band)
La Moneda Palace
La Nación (Chile)
La Negra Antofagasta
La Pintana
La Población
La Portada
La Prensa de Curicó
La Red (Chilean television)
La Reina
La Segunda
La Serena, Chile
La Silla Observatory
La Tercera
La Unión, Chile
Ladeco
Ladislao Cabrera
Ladislav Novák
Lady P
Lago Jeinimeni National Reserve
Lago Ranco, Chile
Laguna Blanca, Chile
Laguna del Laja
Laguna del Laja National Park
Laguna San Rafael National Park
Laguna Verde (lake of Chile)
Laguna Verde, Chile
Lahuen Ñadi Natural Monument
Laja Falls
Laja River (Chile)
Lajos Baróti
Lajos Tichy
Lake Ballivián
Lake Chungará
Lake Huechulafquen
Lake Llanquihue
Lake Villarrica
Lampa, Chile
LAN Cargo
LAN Chile Cargo
LAN Express
Lanco, Chile
Languages of Chile
Lanin
Lanín
Laraquete
Lardizabala
Large Synoptic Survey Telescope
Las Cabras
Las Campanas Observatory
Las Chinchillas National Reserve
Las Condes
Las Marías Airport
Las películas de mi vida
Las Últimas Noticias
Las Vicuñas National Reserve
Lascar Volcano
Lastarria
LATAM Airlines
LATAM Airlines destinations
LATAM Ecuador
LATAM Perú
Latin America
Latin American involvement in international peacekeeping
Lauca
Lauca National Park
Laura Rodríguez
Lautaro (toqui)
Lautaro, Chile
Lautaro (volcano)
Law of Chile
Legend of Trentren Vilu and Caicai Vilu
Lemuy Island
Lenga beech
Leonardo Farkas
Leonel Sánchez
Leonor Oyarzún
Leonor Varela
Leopoldo O'Donnell, 1st Duke of Tetuan
Lesbos in love
Lev Yashin
LGBT rights in Chile
Liberal Alliance (1891)
Liberal Democratic Party (Chile)
Liberal Party (Chile, 1849–1966)
Liberal Party (Chile, 2007–)
Liberal Party of Chile
Liberal–Conservative Fusion
Liberal-Conservative Fusion (Chile)
Liberalism and radicalism in Chile
Licán Ray
Licancabur
Licantén
Líder
Liga Chilena de Fútbol: Primera División
Limarí Province
Linares Province
Linares, Chile
Point Lengua de Vaca
Liquiñe-Ofqui Fault
Lists related to Chile:
List of diplomatic missions of Chile
List of Ambassadors from New Zealand to Chile
List of Biosphere Reserves in Chile
List of Chilean artists
List of Chilean chess champions
List of Chilean companies
List of Chilean flags
List of Chilean freeways
List of Chilean Jews
List of Chilean magazines
List of Chilean newspapers
List of Chilean submissions for the Academy Award for Best Foreign Language Film
List of Chilean television channels
List of Chileans
List of Chile-related topics
List of cities in Chile
List of diplomatic missions in Chile
List of earthquakes in Chile
List of expressways in Chile
List of football clubs in Chile
List of Government Juntas of Chile
List of highways in Chile
List of hospitals in Chile
List of islands of Chile
List of lakes in Chile
List of Mapudungun placenames
List of mountains in Chile
List of national parks of Chile
List of people on stamps of Chile
List of political parties in Chile
List of rivers of Chile
List of town tramway systems in Chile
List of towns in Chile
List of universities in Chile
List of Valparaíso metro stations
List of volcanoes in Chile
Timeline of Chilean history
Topic outline of Chile
Litueche
Lizardo Montero Flores
Llaima
Llano de Chajnantor Observatory
Llanquihue Lake
Llanquihue Province
Llanquihue, Chile
Llullaillaco
Llullaillaco National Park
Lo Barnechea
Lo Espejo
Lo Prado
Loa River
Locro
Lolol
Loncoche
Loncomilla River
Longaniza
Longaví
Longaví River
Long-nosed shrew opossum
Lonko
Lonquimay
Lope García de Castro
Lorenzo Buffon
Lorenzo de Arrau
Los Álamos
Los Andes Province, Chile
Los Andes, Chile
Los Ángeles
Los de Abajo
Los de Ramón
Los Flamencos National Reserve
Los Jaivas
Los Lagos Region
Los Lagos, Chile
Los Miserables (band)
Los Pingüinos Natural Monument
Los Prisioneros
Los Ríos Region
Los Ruiles National Reserve
Los Tetas
Los Tres
Los Twisters
Los Vilos
Lota Schwager
Lota, Chile
Lucho Gatica
Lucía Hiriart
Lucía Hiriart de Pinochet
Lucybell
Luis Advis
Luis Altamirano
Luis Antonio Jiménez
Luis Carrera
Luis Corvalán
Luís Cubilla
Luis Eyzaguirre
Luis Gatica
Luis José de Orbegoso
Luis Merlo de la Fuente
Luis Musrri
Luis Otero Mujica
Luis Posada Carriles
Luis Sepúlveda
Luis Suárez Miramontes
Luisa Durán
Luma apiculata
Luma chequen
M
Macaroni penguin
Machalí
Machi (shaman)
Machuca
Macul
Máfil
Magallanes and Antartica Chilena Region
Magallanes Province
Magallanes and Antartica Chilena Region
Magdalena Island, Aisén Region
Magdalena Island, Magallanes Region
Magdalena Petit
Magellan Telescopes
Magellanic penguin
Magellanic subpolar forests
Maihue Lake
Maipo (volcano)
Maipo Province
Maipo River
Maipú (municipality)
Maipú, Chile
Maitland Plan
Makemake (mythology)
Malalcahuello-Nalcas
Malleco Province
Malleco River
Malleco Viaduct
Malloa
Manfred Max-Neef
Manifiesto (Víctor Jara album)
Manjar
Manjar blanco
Manuel Antonio Caro
Manuel Baquedano
Manuel Barañao
Manuel Blanco Encalada
Manuel Bulnes
Manuel Contreras
Manuel de Amat y Juniet
Manuel Ignacio de Vivanco
Manuel Jacques
Manuel Montt
Manuel Negrete (human rights victim)
Manuel Negrete (shooting)
Manuel Neira
Manuel Ortiz de Zárate
Manuel Pellegrini
Manuel Plaza
Manuel Recabarren
Manuel Rodríguez Erdoiza
Manuel Rodríguez Patriotic Front
Manuel Rojas (footballer)
Manutara
Mapocho River
Mapuche
Mapuche conflict
Mapuche religion
Mapudungun
Maquehue Airport
Marcelo Ramírez
Marcelo Ríos
Marcelo Salas
Marcelo Vega
March 2010 Chile blackout
Marchihue
Marco Bechis
Marcos González
Marga Marga Province
Margot Loyola
María Elena
María José Urzúa
María Luisa Bombal
Mariana de Aguirre
Mariano Bustamante
Mariano Ignacio Prado
Mariano Melgarejo
Mariano Osorio
Marie Ann Salas
Marinelli Glacier
Mario Benavides Soto
Mario Cáceres
Mario David (footballer)
Mario Esteban Berrios
Mario Mutis
Mario Salgado
Mario Soto (footballer, born 1933)
Mario Soto (footballer, born 1950)
Mário Zagallo
Mark González
Marlene Ahrens
Marmaduque Grove
Marmolejo
Marta Larraechea
Marta Pizarro Véliz
Martín Almada
Martín García Óñez de Loyola
Martin Gusinde
Martín Ruiz de Gamboa
Martín Vargas
Massacre of Seguro Obrero
Matanzas, Chile
Mataquito River
Mataveri International Airport
Mate (beverage)
Mateo de Toro y Zambrano
Mateo de Toro Zambrano, 1st Count of la Conquista
Mathias Klotz
Matias Brain
Matías Fernández
Matilde Urrutia
Maui Gayme
Maule Region
Maule River
Maule, Chile
Maullín
Maurice Norman
Mauricio Aros
Mauricio Pinilla
Mauricio Rosenmann Taub
Mauro Ramos
Máximo Carvajal
Medialuna
Medialuna de Osorno
Medialuna Monumental de Rancagua
Mejillones
Melado River
Melchor Bravo de Saravia
Melchor de Concha y Toro
Melipeuco
Melipilla
Melipilla Province
Melitón Carvajal
Memo Aguirre
Mercedes Fontecilla
Metropolitan University of Educational Sciences
Metropolitan University of Technology
Metrotrén
Michael Townley
Michelle Bachelet
Michimalonco
Miguel Arteche
Miguel Enríquez
Miguel Enríquez Espinosa
Miguel Grau Seminario
Miguel Iglesias
Miguel Littin
Miguel Littín
Miguel Piñera
Miguel Ramírez
Miguel Serrano
Mijal Nathalie Sapoznik
Milan Galić
Military Bishopric of Chile
Military of Chile
Millalelmo
Milovan Mirosevic
Milton Friedman
Mining in Chile
Ministry General Secretariat of Government (Chile)
Ministry General Secretariat of the Presidency (Chile)
Ministry of Economy, Development and Tourism
Ministry of Education (Chile)
Ministry of Foreign Affairs (Chile)
Ministry of National Defense (Chile)
Ministry of the Interior (Chile)
Miracle of Chile
Miss Chile
Miss World Chile
Missing (1982 film)
Mitraria
Moai
Mocha (island)
Mocha Island
Mocho-Choshuenco National Reserve
Moisés Villarroel
Molina, Chile
Monito del monte
Monna Bell
Monte Fitz Roy
Monte Patria
Monte San Lorenzo
Monte San Valentin
Monte Verde
Montemar Institute of Marine Biology
Montoneros
Montt family
Monturaqui crater
Moraleda Channel
Morandé 80
Mostazal
Mote con huesillo
Motu Nui
Mount Darwin (Andes)
Mount Hudson
Mount Tarn
Movistar Arena
Mulchén
Multivia
Municipalities of Chile
Murta con membrillo
Murtado
Music of Chile
Music of Easter Island
Myrceugenia
N
Nacimiento, Chile
Nahuelbuta National Park
Nancagua
NANTEN2 Observatory
Narciso Campero
Nathaniel Davis
National Alliance of Independents
National Anthem of Chile
National Congress of Chile
National Council of Culture and the Arts
National Library of Peru
National Monuments of Chile
National Party (Chile)
National Party (Chile, 1857–1933)
National Party (Chile, 1966–1973)
National Prize of Art of Chile
National Renewal (Chile)
National Socialist Movement of Chile
National Women's Service
Natural regions of Chile
Naval de Talcahuano
Navarino Island
Navidad, Chile
Navimag
Nelly Richard
Nelson Acosta
Nelson Parraguez
Nelson Tapia
Neltume, Chile
Nemoroso Riquelme
Néstor Kirchner
Nevado de Longaví
Nevado San Francisco
Nevado Tres Cruces
Nevado Tres Cruces National Park
Nevados de Payachata
Nevados de Quimsachata
Ngen
Nguruvilu
Nicanor Parra
Nicolás Córdova
Nicolás de Piérola
Nicolás Eyzaguirre
Nicolás Massú
Nicolás Millán
Nicolás Peric
Nicolasa Valdés
Nicole
Nicole Perrot
Nido de Aguilas
Niebla
Niebla, Chile
Nilahue River
Nílton Santos
Nirivilo
Nirivilo, Chile
No Quiero Escuchar Tu Voz
Nolana
Nordenskjöld Lake
Norte Chico, Chile
Norte Grande
Norte Grande insurrection
Northern Patagonian Ice Field
Nothofagus
Nothofagus antarctica
Nothofagus dombeyi
Nueva canción
Nueva Extremadura
Nueva Imperial
Nueva Toltén
Ñiquén
Ñuble Province
Ñuñoa
Ñusta Huillac
O
Obesity in Chile
Occupation of Araucanía
Occupation of Lima
O'Higgins (Chilean frigate)
O'Higgins Glacier
O'Higgins Park
O'Higgins Region
O'Higgins/San Martín Lake
Ojos del Caburgua
Ojos del Salado
Olca
Olivar
Ollagüe
Ollagüe, Chile
Omar Sivori
Ona language
Operation Colombo
Operation Condor
Operation Toucan (KGB)
Operation TOUCAN (KGB)
Óptima Televisión
Order of the Merit of Chile
Orelie-Antoine de Tounens
Orelie-Antoine I of Araucania and Patagonia
Orlando Bosch
Orlando Letelier
Oscar Cristi
Oscar Hahn
Óscar Hahn
Oscar Lopez
Oscar Novoa
Osorno (volcano)
Osorno Province
Osorno, Chile
Osvaldo Andrade
Osvaldo Nunez
Osvaldo Romo
Otto Reich
Ovalle
P
Pablo Neruda
Pacific Ocean
Pacific Ring of Fire
Pacific Station
Paila marina
Paillaco
Palafito
Palena Province
Palena/General Vintter Lake
Palestinian community in Chile
Pali-Aike National Park
Pali-Aike Volcanic Field
Palmilla
Pampa del Tamarugal National Reserve
Pampas cat
Pampas fox
Pan de Azúcar National Park
Pan-American Highway (South America)
Panguipulli
Panguipulli Lake
Panhispanism
Panquehue (cheese)
Papa rellena
Papal mediation in the Beagle conflict
Papelucho
Paranal Mountain
Paranal Observatory
Paredones
Parinacota Volcano
Parinacota Province
Parinacota, Chile
Parque Arauco S.A.
Parra family
Parral, Chile
Party for Democracy
Paruma
Pascua Lama
Pascua River
Paso Internacional Los Libertadores
Patagon
Patagonia
Patagonian Desert
Patagonian Ice Sheet
Patagonian weasel
Patria Vieja
Patricia Demick
Patricia Verdugo
Patricio Almonacid
Patricio Aylwin
Patricio Contreras
Patricio Galaz
Patricio Lynch
Patricio Manns
Patricio Yáñez
Paul Capdeville
Paul Delano
Paul E. Simons
Paul Schäfer
Paulina Mladinic
Pebre
Pedro Aguirre Cerda
Pedro Aguirre Cerda (municipality)
Pedro Aguirre Cerda, Chile
Pedro Araya (footballer)
Pedro Araya Toro
Pedro de Oña
Pedro de Valdivia
Pedro de Valdivia Bridge
Pedro de Villagra
Pedro Diez Canseco
Pedro Emiliano Muñoz
Pedro Lagos
Pedro Lastra
Pedro Lemebel
Pedro Lucio Cuadra
Pedro Montt
Pedro Opazo
Pedro Reyes (footballer)
Pehoe Lake
Pelarco
Pelarco, Chile
Pelé
Pelluhue
Pelluhue, Chile
Pelotón (reality show)
Pelotón VIP
Pencahue
Pencahue, Chile
Penco
Penco, Chile
Peñalolén
People's Revolutionary Party (Chile)
Peralillo
Perquenco
Perquilauquén
Perquilauquén River
Peru–Bolivian Confederation
Peru–Chile Trench
Peter Kornbluh
Peter Swan (footballer born 1936)
Petorca Province
Peuchen
Peumo
Pica, Chile
Picadillo
Picarones
Picarquín, Chile
Pichanga (food)
Pichidangui
Pichidegua
Pichilemu
Picton, Lennox and Nueva
Picunche
Piedra Roja
Pilgerodendron
Pilolcura
Pincoya
Pingüino de Humboldt National Reserve
Pirihueico Lake
Pisagua
Pisagua, Chile
Pisco
Pisco Elqui
Pisco Sour
Pitrufquén
Placilla
Planchón-Peteroa
Playa Ancha University of Educational Sciences
Plaza de la Ciudadanía
Podocarpus nubigenus
Pokémon (subculture)
Politics of Chile
Pomerape
Pongo en tus manos abiertas
Pongo En Tus Manos Abiertas (album)
Pontifical Catholic University of Chile
Pontifical Catholic University of Valparaíso
Popular Socialist Vanguard
Popular Unitary Action Movement
Popular Unity
Porotos con rienda
Portal:Chile
Portillo, Chile
Porvenir, Chile
Postal codes in Chile
Pozo Almonte
President of Chile
Presidente Carlos Ibáñez del Campo International Airport
Presidente Ríos Lake
Pretendiendo
Primavera, Chile
Primera División Chilena 2007
Prince of Wales Country Club
Priwall (barque)
Professor Julio Escudero Base
Progressive Union of the Centrist Center
Project Cybersyn
Project FUBELT
Prostitution in Chile
Providencia (municipality, Chile)
Providencia, Chile
Province of Los Andes, Chile
Provinces of Chile
Provincial Osorno
Prumnopitys andina
Public holidays in Chile
Puchuncaví
Pucón
Pudahuel
Pudú
Puelche
Puelo River
Puente Alto
Puerto Aisén
Puerto Chacabuco
Puerto Cisnes
Puerto del Hambre
Puerto Edén
Puerto Montt
Puerto Natales
Puerto Navarino
Puerto Octay
Puerto Toro
Puerto Varas
Puerto Williams
Pukará de Quitor
Pular (volcano)
Pumalín Park
Pumanque
Puna de Atacama dispute
Puna tinamou
Punitaqui
Punta Arenas
Punta de Lobos
Punucapa
Puqueldón
Purapel River
Purén
Purranque
Putagán
Putagán River
Putagán, Chile
Putre
Puyehue Lake
Puyehue National Park
Puyehue, Chile
Puyehue-Cordón Caulle
Q
Que Cante la Vida
Quechua
Queilén
Quellón
Quemchi
Queulat National Park
Queule
Quilapayún
Quilicura
Quilicura, Chile
Quillota
Quillota Province
Quilpué
Quiltro
Quinamávida, Chile
Quinta de Tilcoco
Quinta Normal
Quinta Normal, Chile
Quirihue
Quiroga (surname)
R
Radal Siete Tazas National Reserve
Radical Democracy Party (Chile)
Radical Party (Chile)
Radio Atardecer
Radio Club de Chile
Radio Cooperativa
Radomiro Tomic
Radomiro Tomić (mine)
Rafael Fernández (fencer)
Rafael Maroto
Rafael Olarra
Ramón Barros Luco
Ramón Cardemil
Ramón Castilla
Ramón Freire
Ramón María Narváez y Campos, 1st Duke of Valencia
Ramón Vinay
Rancagua
Ranco Lake
Ranco Province
Ránquil
Ranquil River
Raoul Ruiz
Rapa Nui (film)
Rapa Nui language
Rapa Nui National Park
Rapanui
Rari, Chile
Rauco
Raul de Ramon
Raúl Ruiz (director)
Raúl Silva Henríquez
Ray Wilson (English footballer)
Recognition of same-sex unions in Chile
Recoleta (municipality)
Recoleta, Chile
Red Televisiva Megavisión
Regionalist Action Party of Chile
Regions of Chile
Reinaldo Navia
Reloncaví Sound
Renaico
Renata Ruiz
Renca
René Ríos Boettiger
René Schneider
Rengo, Chile
Reñaca Beach
Republic of Chile
Republic of North Peru
Republic of South Peru
Requínoa
Retiro, Chile
Rettig Report
Revolutionary Communist Party (Chile)
Revolutionary Left Movement (Chile)
Ricardo Acuña
Ricardo Baeza-Yates
Ricardo Francisco Rojas
Ricardo Lagos
Ricardo Romero (fencer)
Richard Báez
Riesco
Riesco Island
Riñihue Lake
Río Bueno, Chile
Río Claro
Río Claro, Chile
Río Cruces Bridge
Río Grande, Tierra del Fuego
Río Hurtado
Río Negro, Chile
Río Verde, Chile
River Melado
River Purapel
River Putagán
Robert Souper
Robert White (ambassador)
Robert Winthrop Simpson
Roberto Bolaño
Roberto Castillo
Roberto Matta
Roberto Rojas
Roberto Souper
Roberto Viaux
Robinson Crusoe Island
Robledo
Rodolfo Amando Philippi
Rodolfo Parada
Rodolfo Stange
Rodrigo Barrera
Rodrigo Cadiz
Rodrigo de Quiroga
Rodrigo Meléndez
Rodrigo Rojas DeNegri
Rodrigo Ruiz
Rodrigo Tello
Rodrigo Valenzuela
Rodrigo Vargas
Roger Hunt
Rojasfilms
Rolf Wüthrich
Roman Catholic Archdiocese of Puerto Montt
Roman Catholic Diocese of Linares
Roman Catholic Diocese of Orsono
Roman Catholic Diocese of Punta Arenas
Roman Catholic Diocese of Rancagua
Roman Catholic Diocese of San Carlos de Ancud
Roman Catholic Diocese of Talca
Roman Catholicism in Chile
Romeral
Ron Flowers
Ron Springett
Ronald Fuentes
Rongorongo
Roque Sáenz Peña
Rosa Markmann
Rosita Serrano
Roto
Route 203-CH
Route 215-CH
Royal Audiencia of Concepción
Royal Audiencia of Santiago
Royal Governor of Chile
Rugby union in Chile
Rupanco Lake
Russians in Chile
S
S. Cofré
Saavedra, Chile
Sábado Gigante
Sagrada Familia, Chile
Sailors' mutiny
Sala y Gómez
Salamanca, Chile
Salar de Atacama
Salar de Surire Natural Monument
Salto Grande (waterfall)
Salvador Allende
San Antonio Province
San Antonio, Chile
San Bernardo, Chile
San Carlos, Chile
San Clemente, Chile
San Fabián
San Fabián de Alico
San Felipe de Aconcagua Province
San Felipe, Chile
San Fernando, Chile
San Gregorio, Chile
San Javier, Chile
San Joaquín
San José (volcano)
San José de la Mariquina
San Juan Bautista, Chile
San Miguel (municipality)
San Miguel, Chile
San Nicolás, Chile
San Pablo, Chile
San Pedro (Chile volcano)
San Pedro de Atacama
San Quintín Glacier
San Rafael Glacier
San Rafael Lagoon
San Rafael, Chile
San Ramón, Chile
San Rosendo
San Sebastián de la Cruz fort
San Vicente de Tagua Tagua
Sanhattan
Santa Clara (Juan Fernández Islands)
Santa Cruz Department, Chile
Santa Cruz, Chile
Santa Inés
Santa Inés Island
Santa Lucía Hill
Santa María School massacre
Santiago (commune)
Santiago Chile Temple
Santiago College
Santiago Manuel de Alday y Aspée
Santiago meteorite
Santiago Metro
Santiago Metropolitan Region
Santiago Morning
Santiago Province, Chile
Santiago Stock Exchange
Santiago Vera-Rivera
Santiago Wanderers
Santiago – Capital of Chile
Santo Domingo, Chile
Santos Chavez
Saraveca language
Sarmiento Lake
Saul Landau
Saxegothaea
Schneider Doctrine
Schooner Virjen de Covadonga
Scorpion scandal
Scottish Chilean
Scouting and Guiding in Chile
Sebastián González
Sebastián Keitel
Sebastián Pardo
Sebastián Piñera
Sebastián Rozental
Sechura fox
Seguro Obrero massacre
Selknam
Senate of Chile
Sepp Herberger
Serena libre
Sergio Badilla Castillo
Sergio Livingstone
Sergio Ortega (composer)
Sergio Valech
Sergio Villalobos
Serrano class destroyer
Serrano River
Seven Lakes (Chile)
Severino Reija
Sewell, Chile
Sex and Pornography Day
Short-eared dog
Sierra Gorda, Chile
Sierra Nevada (stratovolcano)
Sierra Nevada de Lagunas Bravas
Sierra Velluda
Sierra Vicuña Mackenna
Silvio Marzolini
Simpson River
SISMI
Sky Airline
Slit throats case
Soap bark tree
SOAR telescope
Social Democrat Radical Party
Socialist Party of Chile
Socialist Republic of Chile
Socialist Workers Party (Chile)
Socialist Youth (Chile)
Sociedad Química y Minera de Chile
Socompa
Sodium nitrate
Sol y Lluvia
Solanum crispum
Soledad Alvear
Sonia Tschorne
Sopaipilla
South America
1932 South American Basketball Championship
1934 South American Basketball Championship
1937 South American Basketball Championship
1942 South American Basketball Championship
1943 South American Basketball Championship
1953 South American Basketball Championship
South American gray fox
South American sea lion
South Pacific Ocean
South Temperate Zone
Southern Andean Volcano Observatory
Southern Chile
Southern Cone
Southern Hemisphere
Southern Patagonian Ice Field
Southern pudú
Southern University of Chile
Spanish colonization of the Americas
Spanish conquest of Chile
Spanish conquest of the Inca Empire
Spanish language
Sport in Chile
Stan Anderson
Stefano Delle Chiaie
Stoppani Glacier
Strait of Magellan
Strategy of tension
Supreme Court of Chile
Surfing in Chile
Svatopluk Pluskal
Swiss Chilean
T
South Temperate Zone
Tacna
Tacna-Arica compromise
Tacna–Arica compromise
Tacnazo insurrection
Taitao Peninsula
Talagante Province
Talca
Talca Province
Talcahuano
Taltal
Tangata manu
Tanquetazo
Tarapacá Region
Teatro Municipal (Santiago)
Ted Robledo
Tehuelche
Telecanal
Telecommunications in Chile
Telephone numbers in Chile
Television in Chile
Televisión Nacional de Chile
Temuco
Temuco Catholic University
Ten Ten-Vilu
Tennis tournaments in Chile
Teno
Teresa of Los Andes
Termas de Chillan
Territorial Prelature of Calama
Territorial Prelature of Illapel
Terror archives
Tetragonia
Thais chocolata
The Clinic
The Earthquake in Chile
The Grange School, Santiago
The House of the Spirits
The House of the Spirits (film)
The Obscene Bird of Night
The Road to Maipú
Themo Lobos
Thomas Cochrane, 10th Earl of Dundonald
Tierra del Fuego
Tierra del Fuego Province (Argentina)
Tierra del Fuego Province, Chile
Tiltil
Timaukel
Time in Chile
Timeline of Chilean history
Timeline of relief efforts after the 2010 Chile earthquake
Timeline of Valdivian history
Titanium La Portada
Tito Beltrán
Tocopilla
Tocopilla Province
Todd Temkin
Todos los Santos Lake
Tolhuaca National Park
Toltén
Tom Araya
Tomas Barraza
Tomás Goyoaga
Tomás Hirsch
Tomás Marín de Poveda
Tomás Marín de Poveda, 1st Marquis of Cañada Hermosa
Tomé
Tongoy
Tonka Tomicic
Topic outline of Chile
Toqui
Toro Submarino
Torre Entel
Torrent duck
Torres del Paine National Park
Torres del Paine, Chile
Tortilla de rescoldo
Tourism in Chile
Tranque Puclaro
Tranqui Island
Transantiago
Trans-Pacific Strategic Economic Partnership
Transport in Chile
Transportation in Chile
Trauco
Treaty of Ancón
Treaty of Peace and Friendship of 1984 between Chile and Argentina
Treaty of Tlatelolco
Trial of the Juntas
Tronador
Tropic of Capricorn
Tropics
Tsesungún dialect
Tsesungun language
Tucapel River
Tulor
Tupungatito
Tupungato
TV Chile
TV Senado
TVN (Chile)
TVU
Tyndall Glacier (Chile)
U
UCV TV
Ugni
Última Esperanza Province
Última Esperanza Sound
Unidad Anti-Terrorista
Unidad de Fomento
Unidad Popular
Unión Española
United Liberal Party (Chile)
United Nations
United Provinces of South America
United States intervention in Chile
Universidad Adolfo Ibáñez
Universidad Alberto Hurtado
Universidad Arturo Prat
Universidad Austral de Chile
Universidad Catolica (football club)
Universidad Católica de la Santísima Concepción
Universidad Católica de Temuco
Universidad Católica del Maule
Universidad Católica del Norte
Universidad de Antofagasta
Universidad de Artes, Ciencias y Comunicación
Universidad de Atacama
Universidad de Chile (football club)
Universidad de Chile (university)
Universidad de Concepción
Universidad de La Frontera
Universidad de La Serena
Universidad de las Américas (Chile)
Universidad de los Andes (Chile)
Universidad de Los Lagos
Universidad de Magallanes
Universidad de Playa Ancha de Ciencias de la Educación
Universidad de Talca
Universidad de Tarapacá
Universidad de Valparaíso
Universidad del Bío-Bío
Universidad del Pacifico (Chile)
Universidad Diego Portales
Universidad Gabriela Mistral
Universidad Metropolitana de Ciencias de la Educación
Universidad San Sebastián
Universidad Técnica Federico Santa María
Universidad Tecnológica de Santiago
Universidad Tecnológica Metropolitana
University for the Arts, Sciences, and Communication
University of Antofagasta
University of Atacama
University of Chile
University of Concepción
University of La Frontera
University of La Serena
University of Los Lagos
University of Magallanes
University of Santiago, Chile
University of Talca
University of Tarapacá
University of the Andes, Chile
University of the Bío-Bío
University of Valparaíso
US-Chile Free Trade Agreement
Uspallata Pass
Uwe Seeler
V
Václav Mašek
Valdir Pereira
Valdivia
Valdivia National Reserve
Valdivia Province
Valdivia River
Valdivian Coastal Range
Valdivian Fort System
Valdivian temperate rain forests
Valech Report
Valentin Ivanov
Valentina Vargas
Valeria Ortega
Valle de la Luna (Chile)
Valle Nevado
Vallenar
Valparaíso
Valparaíso bombardment
Valparaíso Province
Valparaíso Region
Vampire bat
Vavá
Veronica Planella
Very Large Telescope
Via X
Vicar (comics)
Vicente Huidobro
Vicente Pérez Rosales National Park
Viceroyalty of Peru
Vichuquén
Víctor Domingo Silva
Víctor Jara
Víctor Jara (album)
Víctor Olea Alegría
Vicuña
Viedma Lake
Vigatec (Chile)
Vigilante (band)
Viktor Ponedelnik
Viliam Schrojf
Villa Alegre, Chile
Villa Baviera
Villa Grimaldi
Villa Las Estrellas
Villa O'Higgins
Villa Tehuelches
Villarrica (volcano)
Villarrica Lake
Villarrica National Park
Villarrica, Chile
Viña del Mar
Viña del Mar International Song Festival
Violeta Parra
Virgilio Paz Romero
Visa policy of Chile
Visa requirements for Chilean citizens
Visviri
Vitacura
Vittorio Corbo
Viviana Díaz
Vizcachas Mountains
Volcán Isluga National Park
Volcán Osorno
Volcanism of Chile
Volodia Teitelboim
VTR Chile
VTR Globalcom
Vuelta Ciclista de Chile
Vuelta Ciclista Por Un Chile Lider
W
Wallatiri
Walter Winterbottom
War of the Confederation
War of the Pacific
Water privatization in Chile
Water supply and sanitation in Chile
Water trading
Wellington Island
Welsh Chilean
Western Hemisphere
Western Hemisphere Institute for Security Cooperation
WikiLosRios
Wikipedia:WikiProject Topic outline/Drafts/Topic outline of Chile
Williamson-Balfour Company
Willy Topp
Willys FAMAE Corvo
Wisetrack
Witches of Chiloé
Workers' United Center of Chile
Wulff Castle
X
Ximena Huilipán
Y
Yaghan language
Yanteles
Yareta
Yate (volcano)
Yelcho Lake
Yerbas Buenas
Yoya Martínez
Yumbel
Yungay, Chile
Z
Zapaleri
Zona Austral
Zona Central, Chile
Zona Latina
Zona Sur
Zózimo
See also
List of international rankings
Lists of country-related topics
Topic outline of Chile
Topic outline of geography
Topic outline of South America
United Nations
External links
Chile |
Love and God (also known as "Kais Aur Laila") is a 1986 Indian Hindi-language film which was the final film produced and directed by K. Asif. This film was his first and only directorial venture to be made completely in color. Through this film, the director wanted to convey the legendary love story of Laila Majnu, starring Nimmi as Laila and Sanjeev Kumar as Qais a.k.a. Majnu. Starting production in 1963, the film had a long and troubled history and was released over 23 years later in 1986.
Plot
The movie was based on the famous Arabic love story of Laila and Kais. Kais-E-Emir (Sanjeev Kumar) is the son of Emir-E-Yemen. Laila (Nimmi) is the daughter of Emir-E-Basra. Kais and Laila love each other since childhood. As a child, Kais was so intoxicated in his love for Laila that when his teacher asked the students to practice the word Allah in their books, Kais kept on writing the word Laila instead of Allah. Allah is the Arabic word for god. The teacher became angry and hit Kais on his palms with a stick. At the same time, Laila began to bleed from her palms. The teacher believed that this was a miracle, which proved that Laila and Kais were meant to be with each other. The lovers want to get married, but their families have hated each other since many generations. Laila and Kais meet each other in the desert on a regular basis. The people gossip about their love and Laila's name is tarnished. Her father forbids her from leaving the house. Laila's house is surrounded by armed guards and she cannot venture out to meet Kais. Kais sends a messenger pigeon to Laila. His letter tied to the pigeon's leg discloses that he is on his way to meet her at her house. Laila's father reads the message and becomes furious to see the audacity of Kais. He orders his guards to kill Kais if he ventures into their territory. Laila scared for the safety of Kais sends her maid Nauheed to forewarn Kais of the impending danger. Laila's father Emir-E-Basra goes to the house of Kais and threatens his father that if his son Kais dares to venture into his territory, he will be killed by the guards of Basra. Kais's mother sends their Abyssinian slave to rescue Kais. Kais is grievously wounded by the guards. Kais is brought home where his wounds are tended. Laila's father decides to relocate to a new city away from Kais. After a number of days, Kais's health improves and he leaves his home in search of Laila. He wanders across the deserts and practically loses his sanity. People start calling him "Majnu", meaning—a crazy obsessed lover. Laila's father forces her to marry Ibn-e-Salaam. Laila refuses to allow her husband to come near her. Laila is distraught to be separated from Kais. She is comforted by Gazala, who advises her to visit a nearby dargah. It is said that if a devotee prays earnestly, the prayers would be fulfilled. A Dargah (Persian: درگاه dargâh or درگه dargah) is a Sufi Islamic shrine built over the grave of a revered religious figure, often a Sufi saint or dervish. Eventually, Laila visits the dargah where she prays with great fervor. She sees an extremely tired, sick and dying Kais outside the dargah. She embraces him and they die in each other's arms.
Cast
Sanjeev Kumar as Kais-E-Emir / Majnu
Nimmi as Laila
Simi Garewal as Ghazala
Pran as Shehzada Ibn-E-Salaam
Amjad Khan as Kais' Servant
Nazima as Nahid
Agha as Adam
Jayant as Emir-E-Basra
Nazir Hussain as Emir-E-Yemen
Murad as Peer-O-Mursheed
Achala Sachdev as Laila's Mother
Lalita Pawar as Kais' Mother
Randhir as Moulavi
Production
The film had a long and troubled production history with shooting starting in 1963 with Guru Dutt as Kais and Nimmi as Laila. However Guru Dutt's sudden death in 1964 left the film incomplete and it was shelved. Then, Asif recast Sanjeev Kumar as Kais and resumed production of the film in 1970. Unfortunately, the director K. Asif died on 9 March 1971 at the age of 48/49 and the film was once again left incomplete. Fifteen years later, Asif's senior widow Akhtar Asif decided to release the incomplete film with the help of producer-director-distributor K. C. Bokadia. In a few months, they managed to salvage some usable portions of the incomplete film from three different studios and pieced them together. This cut-paste incomplete version was finally released on 27 May 1986. By the time of the film's release, several of the film's cast members had died, including its leading actor Sanjeev Kumar, who died in 1985. The songs were composed by music director Naushad Ali, Dialogues by Wajahat Mirza and the lyrics were written by lyricist Khumar Barabankvi.
Soundtrack
References
Raju Bharatan (1 August 2013). "Preface". Naushadnama: The Life and Music of Naushad. Hay House, Inc. pp. 48–. . Retrieved 26 January 2015. https://books.google.com/books?id=mg09BAAAQBAJ&dq=love+and+god+1986&pg=PT89
External links
Films directed by K. Asif
1986 films
1980s Urdu-language films
Films scored by Naushad
1980s Hindi-language films
Urdu-language Indian films |
Demirkan is a Turkish surname. Notable people with the surname include:
Demir Demirkan (born 1972), Turkish musician and composer
Renan Demirkan (born 1955), Turkish-German writer and actress
Turkish-language surnames |
Geoffrey Ronald (Geoff) Craige (born 20 May 1943) is an Australian politician. He was a Liberal Party member of the Victorian Legislative Council from 1988 to 2002, representing Central Highlands Province. He served as Minister for Roads and Ports in the second term of the Kennett government.
Craige was born at Port Lincoln in South Australia, and was educated at Port Lincoln High School. He served in the Royal Australian Navy from 1961 to 1980, becoming a chief petty officer in the navy's medical branch. He then served as an organiser for the Federated Clerks' Union from 1980 to 1984, and was director of industrial relations for the Victorian Farmers Federation from 1984 until his election to parliament in 1988.
Craige was elected to the Legislative Council at the 1988 state election, succeeding retiring MP Jock Granter in the safe Liberal seat of Central Highlands Province. He was appointed parliamentary secretary to the Minister for Public Transport when the Liberal Party won office under Jeff Kennett in 1992. Craige was promoted to Minister for Roads and Ports in 1996, serving until the defeat of the Liberal government at the 1999 election. He unsuccessfully nominated for the position of Liberal deputy leader in the Legislative Council following the 1999 election loss, losing to Bill Forwood. He subsequently served as Shadow Minister for Manufacturing and Regional Business and Shadow Minister for Ports, before standing down from the shadow ministry in June 2000. He retired at the 2002 election.
After politics, Craige was a founder of fishing lobby group VRFish, worked for the Bus Association of Victoria, and served on the board of the Port of Hastings Development Authority.
References
1943 births
Liberal Party of Australia members of the Parliament of Victoria
Living people
Members of the Victorian Legislative Council
21st-century Australian politicians
People from Port Lincoln
Ministers for Roads and Road Safety (Victoria) |
```java
package io.jpress.module.page.model;
import io.jboot.db.annotation.Table;
import io.jpress.commons.utils.CommonsUtils;
import io.jpress.commons.utils.JsoupUtils;
import io.jpress.model.User;
import io.jpress.module.page.model.base.BaseSinglePageComment;
import java.util.HashMap;
import java.util.Map;
/**
* Generated by JPress.
*/
@Table(tableName = "single_page_comment", primaryKey = "id")
public class SinglePageComment extends BaseSinglePageComment<SinglePageComment> {
private static final long serialVersionUID = 1L;
public static final String STATUS_NORMAL = "normal"; //
public static final String STATUS_UNAUDITED = "unaudited"; //
public static final String STATUS_TRASH = "trash"; //
private static final Map<String, String> statusStrings = new HashMap<>();
static {
statusStrings.put(STATUS_NORMAL, "");
statusStrings.put(STATUS_UNAUDITED, "");
statusStrings.put(STATUS_TRASH, "");
}
public boolean isNormal() {
return STATUS_NORMAL.equals(getStatus());
}
public boolean isUnaudited() {
return STATUS_UNAUDITED.equals(getStatus());
}
public boolean isTrash() {
return STATUS_TRASH.equals(getStatus());
}
public String getStatusString() {
String string = statusStrings.get(getStatus());
return string == null ? "" : string;
}
@Override
public String getAuthor() {
User user = get("user");
return user != null ? user.getNickname() : super.getAuthor();
}
public String getText() {
return JsoupUtils.getText(getContent());
}
@Override
public boolean save() {
CommonsUtils.escapeModel(this, "content");
JsoupUtils.clean(this, "content");
return super.save();
}
@Override
public boolean update() {
CommonsUtils.escapeModel(this, "content");
JsoupUtils.clean(this, "content");
return super.update();
}
}
``` |
Global Traffic Network is a traffic reporting service that provides reports to radio and television stations across Australia, Canada, Brazil and the United Kingdom. The company was formed in 2005 by principals from Westwood One and Metro Networks, both of which provide direct traffic and news programming to their affiliate stations in the U.S.
Global Traffic Network also has five subsidiaries, Canadian Traffic Network, Australian Traffic Network, Global Traffic Network UK, United States Traffic Network and the Brazilian Traffic Network.
Global Traffic Network was established to be a worldwide aviation company providing helicopter traffic and news reports on the radio and television. It is the leading vendor for radio traffic reports in Canada and Australia.
Global Traffic Network is also attempting to expand its market reach in the televised media through its Australian subsidiary. Combined with the radio affiliates, Global is the dominant ENG helicopter vendor in Australia.
Global Traffic’s media reach, as a helicopter company, is the largest in the world, an idea first hatched by vendors of Metro Networks in 1999.
History
Global Traffic Network was incorporated in Delaware in May 2005 by William L. Yde, III, who had sold a traffic company to billionaire David I Saperstein, the former CEO of Metro Networks, in 1996.
Yde, who had been living in Las Vegas, Nevada assembled a management group from within Metro Networks and Westwood One, including Shane Coppola, Westwood’s CEO, and Gary Worobow, who was Westwood One’s general counsel.
Yde united four helicopter traffic companies that had been operating in Australia, Canada and Europe. Those four helicopter companies are now subsidiaries of the parent, Global Traffic Network.
Although Global Traffic Network was originally established to serve only the Canadian provinces, Australia and Europe, the company signed advertising and broadcast management agreements with Westwood One and Metro Networks in November 2005, essentially making Global Traffic Network the aviation arm of Westwood and Metro.
Global Traffic Network now owns dozens of Robinson R44 helicopters to service affiliate contracts in the US, Canada, Australia and Europe, according to the 2007 Rotor Roster, a helicopter industry publication that reports annually on the ownership and registration of rotorcraft.
In December 2016 Global Traffic Network acquired the assets of Radiate Media, a US provider of traffic reports to American radio and television stations. Radiate Media was renamed US Traffic Network (USTN).
Capitalization and investment
In November 2005, Metro Networks, which is a subsidiary of Westwood One, extended a $2-million dollar loan to Global Traffic Network in order to help capitalize the company, according to financial records filed by Global Traffic Network with the U.S. Securities and Exchange Commission (SEC.
Global Traffic Network then began the process of an initial public offering, and in March 2006 the company went public on the NASDAQ Exchange under the stock symbol GNET. Only three months later, Westwood One bought 1,540,000 shares of GNET on behalf of Metro Networks, essentially giving the companies a 10 percent ownership stake in Global Traffic Network.
Management
Global Traffic Network is operated by some of the same principals who once ran Metro Networks, and later were in charge of Westwood One. Among the field of executives are William Yde, III, who serves as Chairman and CEO of Global Traffic Network, Gary Worobow, former General Counsel and director of Metro Networks and former General Counsel of Westwood One, who serves as Executive Vice President, Business and Legal Affairs. Scott Cody, who also was with Metro Networks and Westwood One, is the chief financial officer for Global Traffic Network, as well, and was among the first executives to move from Westwood to Global Traffic Network in 2005.
Network offices
Global Traffic Network operates in Australia, Canada, Brazil, the United States and the United Kingdom.
Their Canadian broadcast centers are located in Toronto and Hamilton, Ontario. Calgary and Edmonton, Alberta. Montreal, Quebec. Vancouver, British Columbia and Winnipeg, Manitoba.
Their Australian broadcast centres are located in all major Australian capital cities. Sydney, Melbourne, Brisbane, Adelaide and Perth.
Their US headquarters is in Malvern, Pennsylvania. The main sales office is located in Chicago, Illinois along with an operations center. Another major hub is located in Dallas, Texas.
Future
While the company originally intended to operate only in Canada, sales and broadcast agreements with its investment companies, Westwood and Metro, have given Global a substantial penetration into the U.S. radio market, according to Hoovers Business .
In April 2009, Mobile Traffic Network, a wholly owned subsidiary of Global Traffic Network was formed to create a new proprietary and mobile alerting system capable of sending 'hands-free' audio alerts to all mobile phones based on subscriber location and traffic incident zone determination and will be distributed FREE to consumer as an ad-supported application.
References
External links
Global Traffic Network
Mobile Traffic Network
Apisphere
Global Traffic Network UK
The Australian Traffic Network
The Canadian Traffic Network
Securities and Exchange Commission
Westwood Purchase of GNET Stock
Hoover’s Business
American radio networks
Mass media companies of the United Kingdom
Mass media companies established in 2005 |
William McGuire was an American judge, one of the first three judges in the Mississippi Territory. He arrived in Mississippi in the fall of 1799, appointed as chief justice, to assist governor Winthrop Sargent as one of three judges who were to write up the set of laws for the new territory. However, McGuire went back to his home in Virginia after only a couple of weeks or months. After his return from Mississippi he practiced law, and was appointed superintendent at the Harpers Ferry Armory. He died in 1820, from effects of a wound he received at age 16, when he was wounded in the Battle of Eutaw Springs, 1781.
Biography
William Edward McGuire was born into a supposedly ancient family originally from North Central Ireland dating back to the 13th century. Edward McGuire (the "founder" of the US family branch), born 1720, arrived in Frederick County, Virginia, sometime before 1747, the year he was given a land grant. His son William was born in 1765, likewise in Frederick County. He was a cadet in the Continental Army in 1778. He was promoted to ensign in 1780, and later became lieutenant of the First Virginia Artillery. He was wounded in the Battle of Eutaw Springs, 1781; this wound was to trouble him his entire life, and he died of it in 1820. After independence he studied law at the College of William & Mary. He was active in politics as a legislator in Richmond from 1796 to 1799, until he was appoints first chief justice for the Mississippi Territory.
Career in Mississippi
The Mississippi Organic Act of 1798 authorized president John Adams to appoint a governor and three judges for the Mississippi Territory. Governor Winthrop Sargent was to be assisted in setting up the laws for Mississippi with the assistance of judges Peter Bryan Bruin (untrained in law and likely an alcoholic), Daniel Tilton, and William McGuire, who were described as "representing varying degrees of incompetence". McGuire was nominated on 26 June 1798 as chief justice for the territory, and was confirmed in June 1798. He was a man from Virginia and the only one of the three who was an actual lawyer, arrived in the territory after February 28, 1799, when the first law was passed without him; governor Sargent was anxiously awaiting him early in 1799, because of McGuire's actual expertise with the law (in contrast to himself and the other two judges). However, he stayed only a few weeks or months and left in September 1799, signed but a few of the laws, and then went back to Virginia, claiming he couldn't live on the salary in Mississippi.
After Mississippi
McGuire seems to have resigned his position in 1801. On his return to Winchester, Virginia, he practiced law until 1816, when he became superintendent for the Harpers Ferry Armory, an appointed position. He died there, in 1820, as a result of the wound he had received in 1781.
References
18th-century American lawyers
College of William & Mary alumni
Mississippi Territory judges |
François Le Peru (8 February 1940 – 13 January 2023), known by the pen name Fañch Peru, was a French teacher and writer of the Breton language.
Biography
Le Peru worked as a teacher in Tréguier for many years, where he was a member of the Cercle Culturel Ernest Renan. He wrote articles in numerous Breton-language newspapers and magazines, such as Brud, , and . As a member of the Breton Democratic Union, he served as mayor of Berhet from 1983 to 2001.
Fañch Peru died on 13 January 2023, at the age of 82.
Works
Ur c'huzhiad avaloù douss-trenk (1985)
Teñzor run ar gov (1988)
Glizarc'hant (1988)
Bugel ar c'hoad (1989)
An Traoniennoù glas (1993)
Enezenn an eñvor (1994)
Etrezek an aber sall (1995)
60 pennad e brezhoneg bev (1996)
Kernigelled ar goanv (1997)
Hentoù ar C'hornog (1998)
Eñvorennoù Melen ki bihan rodellek (1999)
Va enezenn din-me (2000)
Eus an aod vev d'ar c'hoad don (2002)
Gwaskado (2004)
Gwenodennoù hon hunvreoù (2007)
Kanfarded Milin ar Wern (2008)
Ur vuhez kazh (2010)
Kan ar stivell (2012)
Bigorned-sukr ha bara mel (2014)
Ar C'hizeller hag ar Vorganez (2016)
E Seizh avel ar bed (2021)
References
1940 births
2023 deaths
French educators
French writers
Mayors of places in Brittany
Breton Democratic Union politicians
People from Côtes-d'Armor
20th-century French politicians
21st-century French politicians
20th-century French writers
21st-century French writers |
George Clinton Pratt (November 1811January 1, 1895) was an American farmer, Democratic politician, and Wisconsin pioneer. He was a member of the Wisconsin Senate, representing Waukesha County during the 1862 and 1863 sessions.
Biography
George C. Pratt was born in Cheshire County, New Hampshire, in November 1811. He was raised on his family's farm, but his father died when George was about 10 years old. In his teen years, he apprenticed as a saddler and harness-maker in Vermont, then worked as a journeyman for two years in Boston, before settling at Woodstock, Vermont, until 1840.
In 1838, he made his first trip to the Wisconsin Territory, following his younger brother, Alexander, who had settled there in 1836. During his visit he invested with his brother to purchase several hundred acres of land in what is now the city of Waukesha, Wisconsin. Returning to Vermont, Pratt planned to permanently move to Wisconsin, but was delayed after he was appointed to a three-year term as deputy sheriff.
He finally brought his family to settle their land in the Wisconsin Territory in 1843. He joined his brother in the village of Milwaukee, and soon accompanied him to Waukesha (then called "Prairieville"), where they had previously purchased several hundred acres. After arriving, they purchased even more land from adjoining lots, built a second house on the property, and began farming. Within two years, they had over 300 acres cultivated and a large stock of horses, cattle, and sheep. In Wisconsin, farming was Pratt's principal employment for the next 26 years and was active in the Waukesha County Agricultural Society.
The Pratt brothers were some of the leading voices for creating a separate county from their area, and succeeded when the territorial legislature established Waukesha County from what had been the western half of Milwaukee County. Beginning shortly after the establishment of Waukesha County, Pratt and his brother held a long string of local offices.
In 1861, Pratt was the Democratic nominee for Wisconsin Senate in the 11th Senate district, which then comprised just Waukesha County. He defeated Republican Isaac Lain in the general election and went on to serve in the 1862 and 1863 legislative sessions. Pratt was renominated in 1863, but was defeated in the general election by Republican William Blair.
In 1866, Pratt was one of the founders of the Waukesha County Manufacturing Company, which produced woolen goods at a factory that ran on water power. The same year he was a co-founder of the North Prairie Petroleum Company—an unsuccessful attempt to drill for oil in the area of Genesee, Wisconsin. Later in life, he worked as a railroad purchasing agent doing business in Iowa and Missouri.
In his later years, he lost his sight but maintained otherwise good health until late 1894. He died at his home in Waukesha on January 1, 1895.
Personal life and family
George C. Pratt was a son of John Pratt Jr. and his wife Nancy ( Knapp), who had come to New Hampshire from Massachusetts in 1805. John Pratt was a prominent farmer and cattle dealer in New Hampshire.
Pratt's younger brother, Alexander Foster Pratt, was one of the earliest American settlers of Waukesha, Wisconsin, and was described in the History of Waukesha County as one of the most influential Democrats in the early years of the state.
George Pratt married Mary A. Smith of New Haven, Vermont, on New Year's Day, 1839. Mary was the only child of New Haven physician Dr. Horatio A. Smith. They had at least four children.
References
1811 births
1895 deaths
People from Cheshire County, New Hampshire
People from Woodstock, Vermont
People from Waukesha, Wisconsin
Democratic Party Wisconsin state senators
19th-century American politicians
Wisconsin pioneers |
Barbara J. Owen (born January 25, 1933) is an American organist and organ scholar.
Born in Utica, New York, Owen attended Westminster Choir College, studying organ and receiving a bachelor's degree in music in 1955; from Boston University in 1962 she received her master's degree, in musicology. Among her instructors were Edward Broadhead, Alexander McCurdy, and George Faxon. In 1975 and 1977 she took summer classes at the North German Organ Academy; in 1985 she attended a similar course at the Academy of Italian Organ Music. In 1982 she received the Choir Master certificate from the American Guild of Organists. Owen began her performing career at a variety of churches in Connecticut and Massachusetts soon after graduating from Westminster; in 1963 she took a position in Newburyport, Massachusetts, becoming Music Director of the First Religious Society Unitarian Church. There she remained until retirement in 2002, in which year she took up an appointment at St. Anne's Episcopal Church in Lowell, Massachusetts, remaining there until 2007. Concurrently with these posts, in 1985 she became librarian of the Organ Library of the American Guild of Organists at Boston University. She has held numerous other positions for the Guild as well, serving as dean and councilor for several of its regions as well as councilor and president of the Organ Historical Society; she was named an advisory member of the board of the Instituto de Organos Historicos de Oaxaca in 2005, and in 1990 became a trustee of Methuen Memorial Music Hall. Owen retired from her librarianship in 2012, receiving the title of "Librarian Emerita" for her service.
For much of her career Owen has focused her efforts on the study and promotion of American music, having been encouraged in her early efforts by E. Power Biggs. Her scholarship in the field of organ music has led her to receive numerous prizes, sch as a fellowship from the National Endowment for the Humanities (1974-75); the Westminster Choir College Alumni Citation of Merit (1988); the Organ Historical Society Distinguished Service Award (1988); the American Musical Instrument Society Curt Sachs Award (1994); and the AGO Organ Library Max Miller Book Award (2009); in 2014 her leadership in the American Guild of Organists garnered her that organization's Edward A. Hansen Leadership Award. In 2005 the Organ Historical Society published a festschrift in her honor, Literae Organi: Essays in Honor of Barbara Owen.
A collection of nineteenth-century hymnals donated by Owen is owned by the School of Theology Library at Boston University. Owen herself has versified or written a number of hymn texts as well.
References
1933 births
Living people
American classical organists
20th-century organists
20th-century American musicians
20th-century American women musicians
21st-century organists
21st-century American musicians
21st-century American women musicians
Women organists
American women librarians
Music librarians
American librarians
Musicians from Utica, New York
Classical musicians from New York (state)
Westminster Choir College alumni
Boston University alumni |
Nicola Belmonte (born 15 April 1987) is a former Italian professional footballer. He preferred to play as a right back, but could also play as a centre back.
Career
Bari
Siena
In July 2008, he was signed by A.C. Siena in co-ownership deal, for €1.2 million, However, after just played one league match for Siena in 2008–09 Serie A, Belmonte returned to A.S. Bari on loan. In the first season he played a few games, as the team had Leonardo Bonucci and Andrea Ranocchia as centre-backs.
In September 2010, he extended his contract with Bari from 2013 to 2015. In ca. 2010 his contract with Siena also extended to 30 June 2014. He was the centre-back of the team along with Marco Rossi, but sometimes moved to right back when Andrea Masiello was unavailable. The coach also tested Andrea Raggi as starting rightback at the start of season, made Belmonte as sub and A.Masiello moved to centre-back. Despite the arrival of Kamil Glik in mid-season, Glik injury made Belmonte's role unaffected. He also missed a few games since 24 January due to injury. He was replaced in the first half on 6 March, his first match since injury.
On 23 June 2011, he returned to Siena for a second spell at the club. Bari and Siena made a pure player swap, which Belmonte (€1.25 million), Pedro Kamata (€500,000) and Filippo Carobbio (€500,00) moved to Siena outright, and Abdelkader Ghezzal moved to Bari outright (€2.25 million).
On 10 August 2012, he was suspended for 6 months due to involvement in 2011 Italian football scandal; the ban later reduced to 4 months by Tribunale Nazionale di Arbitrato per lo Sport of CONI.
Udinese
On 17 June 2014, Belmonte was signed by Udinese Calcio on a free transfer.
Catania
On 8 January 2015, Belmonte was signed by Calcio Catania.
Perugia
On 27 July 2015, Belmonte was signed by Perugia.
Robur Siena
On 14 September 2018, he returned for the third time to Siena, signing a three-year contract. On 24 May 2019, he had to announce his retirement from playing due to persistent medical problems with his knee.
References
External links
Living people
1987 births
Sportspeople from Cosenza
Footballers from the Province of Cosenza
Italian men's footballers
Men's association football defenders
Serie A players
Serie B players
Serie C players
SSC Bari players
AS Melfi players
ACR Siena 1904 players
Udinese Calcio players
Catania FC players
AC Perugia Calcio players |
Red God (15 February 1954 – 8 February 1979) was a Thoroughbred race horse foaled in Kentucky who competed in England and the United States but who is best known as the sire of Blushing Groom who prominent turfman Edward L. Bowen calls one of the great international sires of the 20th century.
Racing career
At age two, Red God won the Richmond Stakes at Goodwood Racecourse and was second in the Champagne Stakes at Doncaster Racecourse after which he was brought back to the United States with plans to enter him in the American Triple Crown series. He won his American debut but was injured and out of racing for the rest of 1957. He returned to the track in 1958, with his best result a win in the Roseben Handicap at Belmont Park.
Stud record
Retired from racing, in 1960 Red God was sent to stand at Loughtown Stud in County Kildare, Ireland. Here he sired 10 stakes winners for 13 stakes wins with over £1 million in earnings.
References
Bowen, Edward L. Legacies of the Turf (2003) Eclipse Press
1954 racehorse births
1979 racehorse deaths
Racehorses bred in Kentucky
Racehorses trained in the United Kingdom
Racehorses trained in the United States
Thoroughbred family 8-c |
```javascript
exports.up = knex => {
return knex.schema
// =====================================
// MODEL TABLES
// =====================================
// ASSETS ------------------------------
.createTable('assets', table => {
table.increments('id').primary()
table.string('filename').notNullable()
table.string('basename').notNullable()
table.string('ext').notNullable()
table.enum('kind', ['binary', 'image']).notNullable().defaultTo('binary')
table.string('mime').notNullable().defaultTo('application/octet-stream')
table.integer('fileSize').unsigned().comment('In kilobytes')
table.json('metadata')
table.string('createdAt').notNullable()
table.string('updatedAt').notNullable()
table.integer('folderId').unsigned().references('id').inTable('assetFolders')
table.integer('authorId').unsigned().references('id').inTable('users')
})
// ASSET FOLDERS -----------------------
.createTable('assetFolders', table => {
table.increments('id').primary()
table.string('name').notNullable()
table.string('slug').notNullable()
table.integer('parentId').unsigned().references('id').inTable('assetFolders')
})
// AUTHENTICATION ----------------------
.createTable('authentication', table => {
table.string('key').notNullable().primary()
table.boolean('isEnabled').notNullable().defaultTo(false)
table.json('config').notNullable()
table.boolean('selfRegistration').notNullable().defaultTo(false)
table.json('domainWhitelist').notNullable()
table.json('autoEnrollGroups').notNullable()
})
// COMMENTS ----------------------------
.createTable('comments', table => {
table.increments('id').primary()
table.text('content').notNullable()
table.string('createdAt').notNullable()
table.string('updatedAt').notNullable()
table.integer('pageId').unsigned().references('id').inTable('pages')
table.integer('authorId').unsigned().references('id').inTable('users')
})
// EDITORS -----------------------------
.createTable('editors', table => {
table.string('key').notNullable().primary()
table.boolean('isEnabled').notNullable().defaultTo(false)
table.json('config').notNullable()
})
// GROUPS ------------------------------
.createTable('groups', table => {
table.increments('id').primary()
table.string('name').notNullable()
table.json('permissions').notNullable()
table.json('pageRules').notNullable()
table.boolean('isSystem').notNullable().defaultTo(false)
table.string('createdAt').notNullable()
table.string('updatedAt').notNullable()
})
// LOCALES -----------------------------
.createTable('locales', table => {
table.string('code', 5).notNullable().primary()
table.json('strings')
table.boolean('isRTL').notNullable().defaultTo(false)
table.string('name').notNullable()
table.string('nativeName').notNullable()
table.string('createdAt').notNullable()
table.string('updatedAt').notNullable()
})
// LOGGING ----------------------------
.createTable('loggers', table => {
table.string('key').notNullable().primary()
table.boolean('isEnabled').notNullable().defaultTo(false)
table.string('level').notNullable().defaultTo('warn')
table.json('config')
})
// NAVIGATION ----------------------------
.createTable('navigation', table => {
table.string('key').notNullable().primary()
table.json('config')
})
// PAGE HISTORY ------------------------
.createTable('pageHistory', table => {
table.increments('id').primary()
table.string('path').notNullable()
table.string('hash').notNullable()
table.string('title').notNullable()
table.string('description')
table.boolean('isPrivate').notNullable().defaultTo(false)
table.boolean('isPublished').notNullable().defaultTo(false)
table.string('publishStartDate')
table.string('publishEndDate')
table.text('content')
table.string('contentType').notNullable()
table.string('createdAt').notNullable()
table.integer('pageId').unsigned().references('id').inTable('pages')
table.string('editorKey').references('key').inTable('editors')
table.string('localeCode', 5).references('code').inTable('locales')
table.integer('authorId').unsigned().references('id').inTable('users')
})
// PAGES -------------------------------
.createTable('pages', table => {
table.increments('id').primary()
table.string('path').notNullable()
table.string('hash').notNullable()
table.string('title').notNullable()
table.string('description')
table.boolean('isPrivate').notNullable().defaultTo(false)
table.boolean('isPublished').notNullable().defaultTo(false)
table.string('privateNS')
table.string('publishStartDate')
table.string('publishEndDate')
table.text('content')
table.text('render')
table.json('toc')
table.string('contentType').notNullable()
table.string('createdAt').notNullable()
table.string('updatedAt').notNullable()
table.string('editorKey').references('key').inTable('editors')
table.string('localeCode', 5).references('code').inTable('locales')
table.integer('authorId').unsigned().references('id').inTable('users')
table.integer('creatorId').unsigned().references('id').inTable('users')
})
// PAGE TREE ---------------------------
.createTable('pageTree', table => {
table.increments('id').primary()
table.string('path').notNullable()
table.integer('depth').unsigned().notNullable()
table.string('title').notNullable()
table.boolean('isPrivate').notNullable().defaultTo(false)
table.boolean('isFolder').notNullable().defaultTo(false)
table.string('privateNS')
table.integer('parent').unsigned().references('id').inTable('pageTree')
table.integer('pageId').unsigned().references('id').inTable('pages')
table.string('localeCode', 5).references('code').inTable('locales')
})
// RENDERERS ---------------------------
.createTable('renderers', table => {
table.string('key').notNullable().primary()
table.boolean('isEnabled').notNullable().defaultTo(false)
table.json('config')
})
// SEARCH ------------------------------
.createTable('searchEngines', table => {
table.string('key').notNullable().primary()
table.boolean('isEnabled').notNullable().defaultTo(false)
table.json('config')
})
// SETTINGS ----------------------------
.createTable('settings', table => {
table.string('key').notNullable().primary()
table.json('value')
table.string('updatedAt').notNullable()
})
// STORAGE -----------------------------
.createTable('storage', table => {
table.string('key').notNullable().primary()
table.boolean('isEnabled').notNullable().defaultTo(false)
table.string('mode', ['sync', 'push', 'pull']).notNullable().defaultTo('push')
table.json('config')
})
// TAGS --------------------------------
.createTable('tags', table => {
table.increments('id').primary()
table.string('tag').notNullable().unique()
table.string('title')
table.string('createdAt').notNullable()
table.string('updatedAt').notNullable()
})
// USER KEYS ---------------------------
.createTable('userKeys', table => {
table.increments('id').primary()
table.string('kind').notNullable()
table.string('token').notNullable()
table.string('createdAt').notNullable()
table.string('validUntil').notNullable()
table.integer('userId').unsigned().references('id').inTable('users')
})
// USERS -------------------------------
.createTable('users', table => {
table.increments('id').primary()
table.string('email').notNullable()
table.string('name').notNullable()
table.string('providerId')
table.string('password')
table.boolean('tfaIsActive').notNullable().defaultTo(false)
table.string('tfaSecret')
table.string('jobTitle').defaultTo('')
table.string('location').defaultTo('')
table.string('pictureUrl')
table.string('timezone').notNullable().defaultTo('America/New_York')
table.boolean('isSystem').notNullable().defaultTo(false)
table.boolean('isActive').notNullable().defaultTo(false)
table.boolean('isVerified').notNullable().defaultTo(false)
table.string('createdAt').notNullable()
table.string('updatedAt').notNullable()
table.string('providerKey').references('key').inTable('authentication').notNullable().defaultTo('local')
table.string('localeCode', 5).references('code').inTable('locales').notNullable().defaultTo('en')
table.string('defaultEditor').references('key').inTable('editors').notNullable().defaultTo('markdown')
})
// =====================================
// RELATION TABLES
// =====================================
// PAGE HISTORY TAGS ---------------------------
.createTable('pageHistoryTags', table => {
table.increments('id').primary()
table.integer('pageId').unsigned().references('id').inTable('pageHistory').onDelete('CASCADE')
table.integer('tagId').unsigned().references('id').inTable('tags').onDelete('CASCADE')
})
// PAGE TAGS ---------------------------
.createTable('pageTags', table => {
table.increments('id').primary()
table.integer('pageId').unsigned().references('id').inTable('pages').onDelete('CASCADE')
table.integer('tagId').unsigned().references('id').inTable('tags').onDelete('CASCADE')
})
// USER GROUPS -------------------------
.createTable('userGroups', table => {
table.increments('id').primary()
table.integer('userId').unsigned().references('id').inTable('users').onDelete('CASCADE')
table.integer('groupId').unsigned().references('id').inTable('groups').onDelete('CASCADE')
})
// =====================================
// REFERENCES
// =====================================
.table('users', table => {
table.unique(['providerKey', 'email'])
})
}
exports.down = knex => {
return knex.schema
.dropTableIfExists('userGroups')
.dropTableIfExists('pageHistoryTags')
.dropTableIfExists('pageHistory')
.dropTableIfExists('pageTags')
.dropTableIfExists('assets')
.dropTableIfExists('assetFolders')
.dropTableIfExists('comments')
.dropTableIfExists('editors')
.dropTableIfExists('groups')
.dropTableIfExists('locales')
.dropTableIfExists('navigation')
.dropTableIfExists('pages')
.dropTableIfExists('renderers')
.dropTableIfExists('settings')
.dropTableIfExists('storage')
.dropTableIfExists('tags')
.dropTableIfExists('userKeys')
.dropTableIfExists('users')
}
``` |
Crewe Gresty Lane TMD (officially Gresty Bridge TMD) is a traction maintenance depot in Crewe, Cheshire, England. The depot is situated on the southern side of the line to Shrewsbury.
History
The site was originally used by the Great Western Railway, and opened around 1905 as a wagon works. The present depot was opened by Direct Rail Services (DRS) in 2007.
Present
The depot is used for servicing the DRS fleet of diesel locomotives, including Classes 37, 47 and 66.
References
Sources
Railway depots in England
Buildings and structures in Crewe
Rail transport in Cheshire |
```smalltalk
/*
This file is part of the iText (R) project.
Authors: Apryse Software.
This program is offered under a commercial and under the AGPL license.
For commercial licensing, contact us at path_to_url For AGPL licensing, see below.
AGPL licensing:
This program is free software: you can redistribute it and/or modify
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
along with this program. If not, see <path_to_url
*/
using System;
using System.Xml;
namespace iText.Kernel.Utils.Objectpathitems {
/// <summary>
/// Direct path item (see
/// <see cref="ObjectPath"/>
/// , which describes transition to the
/// <see cref="iText.Kernel.Pdf.PdfArray"/>
/// element which is now a currently comparing direct object.
/// </summary>
public sealed class ArrayPathItem : LocalPathItem {
private readonly int index;
/// <summary>
/// Creates an instance of the
/// <see cref="ArrayPathItem"/>.
/// </summary>
/// <param name="index">
/// the index which defines element of the
/// <see cref="iText.Kernel.Pdf.PdfArray"/>
/// to which
/// the transition was performed.
/// </param>
public ArrayPathItem(int index)
: base() {
this.index = index;
}
public override String ToString() {
return "Array index: " + index;
}
public override int GetHashCode() {
return index;
}
public override bool Equals(Object obj) {
return obj != null && obj.GetType() == GetType() && index == ((iText.Kernel.Utils.Objectpathitems.ArrayPathItem
)obj).index;
}
/// <summary>
/// The index which defines element of the
/// <see cref="iText.Kernel.Pdf.PdfArray"/>
/// to which the transition was performed.
/// </summary>
/// <remarks>
/// The index which defines element of the
/// <see cref="iText.Kernel.Pdf.PdfArray"/>
/// to which the transition was performed.
/// See
/// <see cref="ArrayPathItem"/>
/// for more info.
/// </remarks>
/// <returns>the index which defines element of the array to which the transition was performed</returns>
public int GetIndex() {
return index;
}
protected internal override XmlNode ToXmlNode(XmlDocument document) {
XmlElement element = document.CreateElement("arrayIndex");
element.AppendChild(document.CreateTextNode(index.ToString()));
return element;
}
}
}
``` |
```c++
#include "application.h"
#include <QFileOpenEvent>
#include <QDebug>
using namespace vnotex;
Application::Application(int &p_argc, char **p_argv)
: QApplication(p_argc, p_argv)
{
}
bool Application::event(QEvent *p_event)
{
// On macOS, we need this to open file from Finder.
if (p_event->type() == QEvent::FileOpen) {
QFileOpenEvent *openEvent = static_cast<QFileOpenEvent *>(p_event);
qDebug() << "request to open file" << openEvent->file();
emit openFileRequested(openEvent->file());
}
return QApplication::event(p_event);
}
``` |
Calico Rock High School is an accredited public high school located in the rural community of Calico Rock, Arkansas, United States. The school provides comprehensive secondary education for more than 175 students each year in grades 7 through 12. It is one of four public high schools in Izard County, Arkansas and the only high school administered by the Calico Rock School District.
Academics
Calico Rock High School is accredited by the Arkansas Department of Education (ADE). The assumed course of study follows the Smart Core curriculum developed by the ADE. Students complete regular (core and elective) and career focus coursework and exams and may take Advanced Placement (AP) courses and exams with the opportunity to receive college credit.
Athletics
The Calico Rock High School mascot and athletic emblem is the Pirate with orange and black serving as the school colors.
For 2012–14, the Calico Rock Pirates compete in interscholastic activities within the 1A Classification from the 1A 2 North Conference (and 3A Region 1 East Conference for basketball), as administered by the Arkansas Activities Association. The Pirates participate in golf (boys/girls), cross country (boys/girls), basketball (boys/girls), baseball, and softball.
References
External links
Public high schools in Arkansas
Schools in Izard County, Arkansas |
Craonnelle is a commune in the Aisne department in Hauts-de-France in northern France.
Population
See also
Communes of the Aisne department
References
Communes of Aisne
Aisne communes articles needing translation from French Wikipedia |
Xinju Tian is the oldest mother to conceive naturally. She got pregnant at 67 and gave birth on October 25, 2019, via caesarean section. Tian and her husband Huang Weiping, 68, named their daughter Tianci, meaning "heaven sent" in Mandarin Chinese.
The couple's son and daughter, both in their mid 40's, have children of their own in college and secondary school were unsupportive of their mother, along with many other doctors working at Tian's former workplace, Zaozhuang Maternity and Child Health Care Hospital, where she worked as a paediatrician.
References
Senescence
Old age
Living people
Chinese people
Human pregnancy
Year of birth missing (living people) |
A Chilean passport () is an identity document issued to citizens of Chile to facilitate international travel. Chilean passports are valid for worldwide travel and facilitate the access to consular services whilst abroad. They are issued by the Registro Civil e Identificación.
Citizens of Chile do not need a passport when traveling to Argentina, Bolivia, Brazil, Colombia, Ecuador, Paraguay, Peru and Uruguay. For these countries, they may use just their National ID cards called Cédula de Identidad.
Chilean passports are valid for a period of 10 years (since 1 February 2020) from the date of issue, and the validity may not be extended. Since the introduction of machine-readable passports, family passports are no longer issued.
Since September 2013, new biometric passports are being issued. The redesign was part of a program organized by the Ministry of Justice, where Chileans chose the passport's graphic identity and symbols through an online poll in 2012.
Application process
All passports are issued exclusively by the Registro Civil e Identificación. Within Chile, passport applications are made in person at most offices of the Registro Civil e Identificación. For applicants outside Chile, applications are accepted by all Consulate Generals. A photograph and fingerprints of the applicant are taken on site, as well as a fingerprint of the right thumb if the applicant also requires an Identity Card, Cédula de Identidad.
Passports applications in Chile have a turn-around time of 7 labour days (but usually is not more than 3 labour days from photo capture to delivery) and must be picked up at the office where the application was made, unless the applicant requires the passport to be delivered for pick-up in Santiago or in another different office. The expected time of delivery for passport applications made outside Chile is of about 6 weeks, unless the applicant requires an expedite service for an additional cost (subject to availability).
Physical description
2013–present edition
New regular biometric passports issued since September 2013 are burgundy red colored. The words República de Chile are above the coat of arms with the word Pasaporte and Passport below, followed by the biometric passport symbol. Both the letters and coat of arms are color gold. The standard passport has 32 pages, while the extended version has 64 for an additional fee. The data page contains a microchip with the biometric information of the holder. It features images of the Andes, the Andean Condor and the national flag. The passport is in Spanish and English.
1992–2013 edition (still valid, until expiration dates in each passport)
Regular passports are deep navy blue. The words República de Chile are above the Chilean Coat of Arms, with the word Pasaporte below. The color of the coat of arms and the letters is copper. The standard passport contains 32 pages, but it can be issued with 64 pages for an additional fee. The data page is located in the back cover, therefore leaving all 32 pages for stamps and visas. The data page has several security features, such as the digitalized photograph and signature of the bearer, as coat of arms visible under ultraviolet light and a Moai printed with optically variable ink over the upper-left corner of the bearer's photograph.
Since 2003, only machine-readable passports with a digitalized photo of the passport holder are issued. The information page is written in Spanish and English.
Photograph
Type of Document (P for Passport, D for Diplomatic and O for Official)
Country Code (CHL)
Passport Number (same as RUN number (National ID) until 2013)
Surname
Given Names
Nationality (Chilena)
Booklet Number
Date of Birth
Issuing Authority (Registro Civil e Identificación)
Gender
Place of Birth (Name of city if born in Chile. For those born outside Chile, name of the city and the country)
Issuing date
Expiration date
Signature
The information page ends with the machine-readable zone.
Fees
Passport applications for a passport outside Chile are similarly priced but paid in the local currency. The price is informed to the applicant by the consular office at the time of application and a US$3 consular fee is added. e.g.
These costs may vary in accordance with rises determined annually by the Civil Registry & Identification Service.
Biometric passport
The Registro Civil e Identificación and the Ministry of Justice of Chile awarded the contract to manufacture new Chilean biometric passports and ID cards to France-based Morpho S.A.S (now IDEMIA) on 20 January 2012. The new passport and ID card system was introduced to the general public on 2 September 2013. All documents issued from this date on will be biometric, and all non-biometric documents will be valid until their date of expiration.
Gallery of Chilean passports
Visa requirements
Chilean citizens had visa-free or visa on arrival access to 174 countries and territories, ranking the Chilean passport 16th overall (tied with Monaco) in terms of travel freedom, the third strongest in the Americas (after the passports of the United States and Canada), and the strongest in Latin America, according to the Henley Passport Index. The passports of Chile, Brunei and South Korea are the only ones to provide visa-free access to all G8 countries.
References
Ministerio de Relaciones Exteriores de Chile - Recomendacion para Chilenos que viajan al extranjero
Chile
Foreign relations of Chile
Government of Chile |
```cmake
#
# The Zephyr package helper script provides a generic script mode interface
# to the Zephyr CMake package and module structure.
#
# The purpose of this script is to provide a single entry for running any Zephyr
# build tool that is executed during CMake configure time without creating a
# complete build system.
#
# It does so by loading the Zephyr CMake modules specified with the 'MODULES'
# argument.
#
# This script executes the given module identical to Zephyr CMake configure time.
# The application source directory must be specified using
# '-S <path-to-sample>'
#
# The build directory will default to current working directory but can be
# controlled with: '-B <path-to-build>'
#
# For example, if you were invoking CMake for 'hello_world' sample as:
# $ cmake -DBOARD=<board> -B build -S samples/hello_world
#
# you can invoke only dts module (and dependencies) as:
# $ cmake -DBOARD=<board> -B build -S samples/hello_world \
# -DMODULES=dts -P <ZEPHYR_BASE>/cmake/package_helper.cmake
#
# It is also possible to pass additional build settings.
# If you invoke CMake for 'hello_world' as:
#
# $ cmake -DBOARD=<board> -B build -S samples/hello_world -DEXTRA_CONF_FILE=foo.conf
#
# you just add the same argument to the helper like:
# $ cmake -DBOARD=<board> -B build -S samples/hello_world -DEXTRA_CONF_FILE=foo.conf \
# -DMODULES=dts -P <ZEPHYR_BASE>/cmake/package_helper.cmake
#
# Note: the samples CMakeLists.txt file is not processed by package helper, so
# any 'set(<var> <value>)' specified before 'find_package(Zephyr)' must be
# manually applied, for example if the CMakeLists.txt contains:
# set(EXTRA_CONF_FILE foo.conf)
# find_package(Zephyr REQUIRED HINTS $ENV{ZEPHYR_BASE})
# the 'foo.conf' must be specified using '-DEXTRA_CONF_FILE=foo.conf'
cmake_minimum_required(VERSION 3.20.5)
# add_custom_target and set_target_properties are not supported in script mode.
# However, several Zephyr CMake modules create custom target for user convenience
# like menuconfig, boards, shields, etc.
# As we are not generating a build system with this tool, only running part of
# the modules, then we simply override those functions to allow running those
# modules.
function(add_custom_target)
# This silence the error: 'add_custom_target command is not scriptable'
endfunction()
function(set_target_properties)
# This silence the error: 'set_target_properties command is not scriptable'
endfunction()
# Find last `-B` and `-S` instances.
foreach(i RANGE ${CMAKE_ARGC})
if(CMAKE_ARGV${i} MATCHES "^-B(.*)")
set(argB ${CMAKE_MATCH_1})
set(argB_index ${i})
elseif()
elseif(CMAKE_ARGV${i} MATCHES "^-S(.*)")
set(argS_index ${i})
set(argS ${CMAKE_MATCH_1})
endif()
endforeach()
if(DEFINED argB_index)
if(DEFINED argB)
set(CMAKE_BINARY_DIR ${argB})
else()
# value of -B follows in next index
math(EXPR argB_value_index "${argB_index} + 1")
set(CMAKE_BINARY_DIR ${CMAKE_ARGV${argB_value_index}})
endif()
endif()
if(DEFINED argS_index)
if(DEFINED argS)
set(APPLICATION_SOURCE_DIR ${argS})
else()
# value of -S follows in next index
math(EXPR argS_value_index "${argS_index} + 1")
set(APPLICATION_SOURCE_DIR ${CMAKE_ARGV${argS_value_index}})
endif()
endif()
if(NOT DEFINED APPLICATION_SOURCE_DIR)
message(FATAL_ERROR
"Source directory not defined, please use '-S <path-to-source>' to the "
"application for which this tool shall run.\n"
"For example: -S ${ZEPHYR_BASE}/samples/hello_world"
)
endif()
if(DEFINED APPLICATION_SOURCE_DIR)
cmake_path(ABSOLUTE_PATH APPLICATION_SOURCE_DIR NORMALIZE)
endif()
cmake_path(ABSOLUTE_PATH CMAKE_BINARY_DIR NORMALIZE)
set(CMAKE_CURRENT_BINARY_DIR ${CMAKE_BINARY_DIR})
if(NOT DEFINED MODULES)
message(FATAL_ERROR
"No MODULES defined, please invoke package helper with minimum one module"
" to execute in script mode."
)
endif()
# Loading Zephyr CMake extension commands, which allows us to overload Zephyr
# scoping rules.
find_package(Zephyr REQUIRED HINTS $ENV{ZEPHYR_BASE} COMPONENTS extensions)
# Zephyr scoping creates custom targets for handling of properties.
# However, custom targets cannot be used in CMake script mode.
# Therefore disable zephyr_set(... SCOPE ...) in package helper as it is not needed.
function(zephyr_set variable)
# This silence the error: zephyr_set(... SCOPE <scope>) doesn't exists.
endfunction()
string(REPLACE ";" "," MODULES "${MODULES}")
find_package(Zephyr REQUIRED HINTS $ENV{ZEPHYR_BASE} COMPONENTS zephyr_default:${MODULES})
``` |
Robert J. Starks (born October 14, 1945) is an American politician. He served as a Republican member for the 34th, 36th and 118th district of the Florida House of Representatives.
Starks was born in Tampa, Florida, and attended the University of South Florida, where he earned a bachelor's degree in business administration. In 1986, Starks was elected for the 118th district of the Florida House of Representatives, succeeding Dexter Lehtinen. He served until 1988, when he was succeeded by Tom Easterly. In 1990 he was elected for the 36th district, succeeding Tom Drage. Starks was succeeded by Kim Shepard for the 36th district in 1992, when he was elected for the 34th district, succeeding Frank Stone and serving until 2000 when he was succeeded by David J. Mealor.
References
1945 births
Living people
Politicians from Tampa, Florida
Republican Party members of the Florida House of Representatives
20th-century American politicians
University of South Florida alumni |
```yaml
# Common fields for ACPI informed based devices
properties:
acpi-hid:
type: string
description: Used to supply OSPM with the devices PNP ID or ACPI ID.
A node is consder as acpi based or not based on whether this property
is present or not.
acpi-uid:
type: string
description: |
Provides OSPM with a logical device ID that does not change
across reboots. This object is optional, but is required when the device
has no other way to report a persistent unique device ID. The _UID must be
unique across all devices with either a common _HID or _CID.
acpi-comp-id:
type: string-array
description: Used to supply OSPM with a devices Plug and Play-Compatible Device ID
``` |
Sir Christopher Forster (c.1590 – c.1660) was an Anglo-Irish merchant who served several terms as Lord Mayor of Dublin.
In 1621 Forster was Sheriff of Dublin City, having become an alderman of the city. He served as Lord Mayor of Dublin in 1629–30, 1635–7, and 1638–9. In 1642, his name appears among those Dublin aldermen who were commissioned by Charles I of England to disarm Roman Catholics in the city during the Irish Confederate Wars. He was the Master of the Dublin Guild of Merchants from 1647 to 1649.
References
Year of birth uncertain
Year of death uncertain
17th-century Anglo-Irish people
High Sheriffs of Dublin City
Irish knights
Irish merchants
Lord Mayors of Dublin
People of the Irish Confederate Wars |
Myristica trianthera is a species of plant in the family Myristicaceae. It is endemic to West Papua (Indonesia).
References
trianthera
Endemic flora of Western New Guinea
Vulnerable plants
Taxonomy articles created by Polbot |
Bleicherode () is a town in the district of Nordhausen, in Thuringia, Germany. It is situated on the river Wipper, 17 km southwest of Nordhausen. On 1 December 2007, the former municipality Obergebra was incorporated by Bleicherode. The former municipalities Etzelsrode, Friedrichsthal, Kleinbodungen, Kraja, Hainrode, Nohra, Wipperdorf and Wolkramshausen were merged into Bleicherode in January 2019. Every Tuesday and Thursday, there is a market held at the Zierbrunnenplatz in the town.
Historically, Bleicherode belonged to the Prussian province of Saxony between 1700 and 1945.
One of Bleicherode's most famous natives is the cartographer August Heinrich Petermann.
Notable persons
August Heinrich Petermann (1822–1878), German cartographer
Adalbert Merx (1838–1909), German theologian
Hans Beyth (1901–1947), German-Jewish banker and Zionist (leader of Youth Aliyah, 1945–47)
See also
Gerson von Bleichröder (1822–1893), German-Jewish banker, Chief banker of Otto von Bismarck
References
Nordhausen (district) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.