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
}
}
```
|
```php
<?php
/**
*/
namespace OCA\DAV\Tests\unit\Connector\Sabre;
use OCA\DAV\Connector\Sabre\FakeLockerPlugin;
use Sabre\DAV\INode;
use Sabre\DAV\PropFind;
use Sabre\DAV\Server;
use Sabre\HTTP\RequestInterface;
use Sabre\HTTP\Response;
use Sabre\HTTP\ResponseInterface;
use Test\TestCase;
/**
* Class FakeLockerPluginTest
*
* @package OCA\DAV\Tests\unit\Connector\Sabre
*/
class FakeLockerPluginTest extends TestCase {
/** @var FakeLockerPlugin */
private $fakeLockerPlugin;
protected function setUp(): void {
parent::setUp();
$this->fakeLockerPlugin = new FakeLockerPlugin();
}
public function testInitialize(): void {
/** @var Server $server */
$server = $this->getMockBuilder(Server::class)
->disableOriginalConstructor()
->getMock();
$server
->expects($this->exactly(4))
->method('on')
->withConsecutive(
['method:LOCK', [$this->fakeLockerPlugin, 'fakeLockProvider'], 1],
['method:UNLOCK', [$this->fakeLockerPlugin, 'fakeUnlockProvider'], 1],
['propFind', [$this->fakeLockerPlugin, 'propFind']],
['validateTokens', [$this->fakeLockerPlugin, 'validateTokens']],
);
$this->fakeLockerPlugin->initialize($server);
}
public function testGetHTTPMethods(): void {
$expected = [
'LOCK',
'UNLOCK',
];
$this->assertSame($expected, $this->fakeLockerPlugin->getHTTPMethods('Test'));
}
public function testGetFeatures(): void {
$expected = [
2,
];
$this->assertSame($expected, $this->fakeLockerPlugin->getFeatures());
}
public function testPropFind(): void {
$propFind = $this->getMockBuilder(PropFind::class)
->disableOriginalConstructor()
->getMock();
$node = $this->getMockBuilder(INode::class)
->disableOriginalConstructor()
->getMock();
$propFind->expects($this->exactly(2))
->method('handle')
->withConsecutive(
['{DAV:}supportedlock'],
['{DAV:}lockdiscovery'],
);
$this->fakeLockerPlugin->propFind($propFind, $node);
}
public function tokenDataProvider() {
return [
[
[
[
'tokens' => [
[
'token' => 'aToken',
'validToken' => false,
],
[],
[
'token' => 'opaquelocktoken:asdf',
'validToken' => false,
]
],
]
],
[
[
'tokens' => [
[
'token' => 'aToken',
'validToken' => false,
],
[],
[
'token' => 'opaquelocktoken:asdf',
'validToken' => true,
]
],
]
],
]
];
}
/**
* @dataProvider tokenDataProvider
* @param array $input
* @param array $expected
*/
public function testValidateTokens(array $input, array $expected): void {
$request = $this->getMockBuilder(RequestInterface::class)
->disableOriginalConstructor()
->getMock();
$this->fakeLockerPlugin->validateTokens($request, $input);
$this->assertSame($expected, $input);
}
public function testFakeLockProvider(): void {
$request = $this->getMockBuilder(RequestInterface::class)
->disableOriginalConstructor()
->getMock();
$response = new Response();
$server = $this->getMockBuilder(Server::class)
->getMock();
$this->fakeLockerPlugin->initialize($server);
$request->expects($this->exactly(2))
->method('getPath')
->willReturn('MyPath');
$this->assertSame(false, $this->fakeLockerPlugin->fakeLockProvider($request, $response));
$expectedXml = '<?xml version="1.0" encoding="utf-8"?><d:prop xmlns:d="DAV:" xmlns:s="path_to_url"><d:lockdiscovery><d:activelock><d:lockscope><d:exclusive/></d:lockscope><d:locktype><d:write/></d:locktype><d:lockroot><d:href>MyPath</d:href></d:lockroot><d:depth>infinity</d:depth><d:timeout>Second-1800</d:timeout><d:locktoken><d:href>opaquelocktoken:fe4f7f2437b151fbcb4e9f5c8118c6b1</d:href></d:locktoken></d:activelock></d:lockdiscovery></d:prop>';
$this->assertXmlStringEqualsXmlString($expectedXml, $response->getBody());
}
public function testFakeUnlockProvider(): void {
$request = $this->getMockBuilder(RequestInterface::class)
->disableOriginalConstructor()
->getMock();
$response = $this->getMockBuilder(ResponseInterface::class)
->disableOriginalConstructor()
->getMock();
$response->expects($this->once())
->method('setStatus')
->with('204');
$response->expects($this->once())
->method('setHeader')
->with('Content-Length', '0');
$this->assertSame(false, $this->fakeLockerPlugin->fakeUnlockProvider($request, $response));
}
}
```
|
Live in San Francisco '16 is a live album by Australian psychedelic rock band King Gizzard & the Lizard Wizard. The album was released on double vinyl and digital via Bandcamp on 20 November 2020. An accompanying concert film was also released, which premiered on Vimeo on 18 November 2020, and was later released on YouTube.
Information
The album features a set by the band performed at The Independent on May 25, 2016, in San Francisco, California, US.
Track listing
All songs written by Stu Mackenzie. Vinyl releases have tracks 1–5 on Side A, tracks 6–10 on Side B, tracks 11-12 on Side C and track 13 on Side D.
Personnel
Michael Cavanagh – drums
Cook Craig – guitar, synthesizer
Ambrose Kenny-Smith – harmonica, vocals, organ
Stu Mackenzie – vocals, guitar, flute, mixing, producer
Eric Moore – drums
Lucas Harwood - bass
Joey Walker – guitar, vocals
Additional personnel
Terry Yerves – live recording
Marco Martin – live recording
John Karr – live recording
Jason Galea – layout editor
Joesph Carra - mastering
Ben Butcher - photography
Jamie Wdziekonski - photography
Charts
References
2020 live albums
King Gizzard & the Lizard Wizard live albums
ATO Records live albums
|
```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_
```
|
```yaml
#
# or more contributor license agreements. See the NOTICE file
# distributed with this work for additional information
# regarding copyright ownership. The ASF licenses this file
#
# path_to_url
#
# Unless required by applicable law or agreed to in writing,
# "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
# specific language governing permissions and limitations
#
version: v1
plugins:
- name: go
out: backend/internal
opt: paths=source_relative
- name: go-grpc
out: backend/internal
opt:
- paths=source_relative
- require_unimplemented_servers=false
- name: dart
out: frontend/playground_components/lib/src
opt: grpc
- plugin: buf.build/protocolbuffers/python
out: infrastructure
opt:
- pyi_out=infrastructure
- plugin: buf.build/grpc/python
out: infrastructure
# Tour of Beam stubs
- name: go
out: ../learning/tour-of-beam/backend/playground_api
opt: paths=source_relative
- name: go-grpc
out: ../learning/tour-of-beam/backend/playground_api
opt:
- paths=source_relative
- require_unimplemented_servers=false
```
|
```go
//
//
// path_to_url
//
// Unless required by applicable law or agreed to in writing, software
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
package securityhub
import (
"context"
"github.com/goharbor/harbor/src/lib/q"
"github.com/goharbor/harbor/src/pkg/scan/dao/scan"
"github.com/goharbor/harbor/src/pkg/securityhub/dao"
"github.com/goharbor/harbor/src/pkg/securityhub/model"
)
var (
// Mgr is the global security manager
Mgr = NewManager()
)
// Manager is used to manage the security manager.
type Manager interface {
// Summary returns the summary of the scan cve reports.
Summary(ctx context.Context, scannerUUID string, projectID int64, query *q.Query) (*model.Summary, error)
// DangerousArtifacts returns the most dangerous artifact for the given scanner.
DangerousArtifacts(ctx context.Context, scannerUUID string, projectID int64, query *q.Query) ([]*model.DangerousArtifact, error)
// TotalArtifactsCount return the count of artifacts.
TotalArtifactsCount(ctx context.Context, projectID int64) (int64, error)
// ScannedArtifactsCount return the count of scanned artifacts.
ScannedArtifactsCount(ctx context.Context, scannerUUID string, projectID int64, query *q.Query) (int64, error)
// DangerousCVEs returns the most dangerous CVEs for the given scanner.
DangerousCVEs(ctx context.Context, scannerUUID string, projectID int64, query *q.Query) ([]*scan.VulnerabilityRecord, error)
// TotalVuls return the count of vulnerabilities
TotalVuls(ctx context.Context, scannerUUID string, projectID int64, tuneCount bool, query *q.Query) (int64, error)
// ListVuls returns vulnerabilities list
ListVuls(ctx context.Context, scannerUUID string, projectID int64, query *q.Query) ([]*model.VulnerabilityItem, error)
}
// NewManager news security manager.
func NewManager() Manager {
return &securityManager{
dao: dao.New(),
}
}
// securityManager is a default implementation of security manager.
type securityManager struct {
dao dao.SecurityHubDao
}
func (s *securityManager) TotalArtifactsCount(ctx context.Context, projectID int64) (int64, error) {
return s.dao.TotalArtifactsCount(ctx, projectID)
}
func (s *securityManager) Summary(ctx context.Context, scannerUUID string, projectID int64, query *q.Query) (*model.Summary, error) {
return s.dao.Summary(ctx, scannerUUID, projectID, query)
}
func (s *securityManager) DangerousArtifacts(ctx context.Context, scannerUUID string, projectID int64, query *q.Query) ([]*model.DangerousArtifact, error) {
return s.dao.DangerousArtifacts(ctx, scannerUUID, projectID, query)
}
func (s *securityManager) ScannedArtifactsCount(ctx context.Context, scannerUUID string, projectID int64, query *q.Query) (int64, error) {
return s.dao.ScannedArtifactsCount(ctx, scannerUUID, projectID, query)
}
func (s *securityManager) DangerousCVEs(ctx context.Context, scannerUUID string, projectID int64, query *q.Query) ([]*scan.VulnerabilityRecord, error) {
return s.dao.DangerousCVEs(ctx, scannerUUID, projectID, query)
}
func (s *securityManager) TotalVuls(ctx context.Context, scannerUUID string, projectID int64, tuneCount bool, query *q.Query) (int64, error) {
return s.dao.CountVulnerabilities(ctx, scannerUUID, projectID, tuneCount, query)
}
func (s *securityManager) ListVuls(ctx context.Context, scannerUUID string, projectID int64, query *q.Query) ([]*model.VulnerabilityItem, error) {
return s.dao.ListVulnerabilities(ctx, scannerUUID, projectID, query)
}
```
|
```smalltalk
using Microsoft.AspNetCore.Builder;
namespace Ocelot.Middleware
{
public delegate Task OcelotMiddlewareConfigurationDelegate(IApplicationBuilder builder);
}
```
|
```python
from .arma import ARIMA
from .arimax import ARIMAX
from .nnar import NNAR
```
|
```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 >
```
|
Tata Neu is a multi-purpose super-app, developed in India by the Tata Group. It is the country's first super-app. The app was launched to coincide with the start of a 2022 Indian Premier League match.
Tata Neu was launched on 7 April 2022, during which the servers were overloaded. Sales numbers missed the million targets set by Tata Digital. Reports stated that Tata Digital received as much as billion in funding from Tata Group for the Tata Neu app and additional investments. By May ending the app had nearly 11 million downloads, however the app was bugged with constant glitches and slow response time leading to a reduction in customer usage.
As the reports of high number of bugs and sluggish user experienced continued, reports emerged that Tata Neu CTO had resigned within 4 months and the app faced backlash over data sharing of customer info between companies. In January 2023, Mukesh Bansal the President of Tata Digital and head of operations for Tata Neu stepped down from Tata Neu with Pratik Pal, the CEO of Tata Digital, looking after all the business decisions at the firm. Soon, additional reports emerged that Tata Neu is set to miss the first year GMV by as much as 50%. Internal projections showed the company projecting GMV by March 2023 at billion vs expected billion (which was scaled down from billion).
The Tata Neu app, which was revamped in time for the 2023 Indian Premier League (IPL) season, saw a significant increase in downloads and membership following the tournament.The Tata Group's sponsorship of the IPL and the heavy promotion of the Neu app during the matches likely played a role in this growth. Post the revamp, Neu’s rating on the Google Play store has improved from 3.8 to 4.2.
References
E-commerce in India
Mobile payments in India
Indian brands
Online payments
Payment service providers
Super-apps
Mobile payments
Tata Group
|
The tellum or reverse mullet (also referred to as a frullet) is a hairstyle similar to the mullet. "Tellum" is "mullet" spelled backwards. While a mullet is short in the front and long in the back, the opposite is true for a tellum. The hair is longer in the front (usually straight cheek-chin length hair), and is short/buzzed in the back. The back is often spiky as well. It is not uncommon that the back layers of hair are dyed a different color than the front, or that there are drastically different colored streaks (highlights/lowlights) running through the front of the hair.
Fashion history
In the late 1970s, the first interpretation of the tellum was the devilock, made famous by The Misfits. The Misfits style has the devilock centered on the eyes and gelled in place.
In the late 1980s this style of hair was very popular among emo subculture, which later transformed into the "emo hairstyle". Thus, the tellum is often associated with the "emo style" and is frequently, but not always, worn by those who "emo".
In the early 1990s Edward Furlong's hairstyle in Terminator 2: Judgment Day gave rise to a new wave of tellums worn by teenagers.
In 2007 when Kate Gosselin emerged into the reality television world, she and her tellum, which resembles a bob hairstyle in the front and is cropped short in the back, quickly became a favorite among fans of the popular reality series, Jon and Kate Plus 8. Appropriately named, "The Kate", was a hotly debated hairstyle in 2009. Although Gosselin and the media hoped to sway the public into finding the hairstyle appealing, most rejected "The Kate" for its bold appearance and impracticality.
Cultural impact
Although "The Kate" did not make it as a mainstream hairstyle, famous R&B singer Cassie Ventura was spotted at a music event in New York flaunting this bold hairstyle in 2010.
References
External links
Tellum variations
Hairstyles
|
Silene sennenii is a species of plant in the family Caryophyllaceae. It is endemic to Spain. Its natural habitat is Mediterranean Matorral shrubland vegetation. It is threatened by habitat loss.
References
sennenii
Endemic flora of Spain
Endemic flora of the Iberian Peninsula
Matorral shrubland
Endangered plants
Taxonomy articles created by Polbot
Plants described in 1905
|
Devil Came to Me is the second studio album by Spanish rock band Dover. It was released on 21 April 1997 under Subterfuge Records.
Devil Came to Me was recorded and mixed in 20 days in February 1997, at Infinity Estudios in Madrid, with Daniel Alcover, and it cost 80 000 pesetas (at current exchange rates, €480). Dover was disclosed with this record and made the leap to fame. The cover was designed by the drummer of the band, Jesús Antúnez, graphic designer.
On 25 September 1997 they won their first gold record for the 50,000 copies sold of the album and subsequently were certified four times platinum to achieve a volume of more than 500,000 albums sold. Following the success of the album, Dover won the Ondas award for best Spanish group revelation on 13 November in Barcelona.
The album's title track was used both in a collection of songs from revealing bands of the moment, under the name of Pepsi The Next Generation (1998), and the announcement of a US brand drinks, Radical Fruit Company, which involved a big push to publicize the group.
15th anniversary reissue
To commemorate the album's 15th anniversary, Octubre Records reissued the album with the name "Dover Came to Me", in several different versions and formats on 18 June 2013. These included:
Deluxe Boxset (2CD+1DVD) - Remastered version of the album plus bonus tracks, 20 live tracks from Sala El Sol (Madrid) in March 2013, 12 bonus videos and interviews.
Standard Digital Edition - Remastered version of the album, plus 20 live tracks from Sala El Sol (Madrid).
Deluxe Digital Edition (iTunes) - Remastered version of the album, plus 20 live tracks from Sala El Sol (Madrid), 3 live tracks (1997), 7 live tracks (2013) and 2 bonus videos.
Streaming Digital Edition - 20 live tracks from Sala El Sol (Madrid).
Track listing
Lyrics and music by Amparo Llanos and Cristina Llanos.
Personnel
Dover
Cristina Llanos – vocals and guitar
Amparo Llanos – guitar
Álvaro Gómez – bass guitar
Jesús Antúnez – drums, illustration
Technical personnel
Daniel Alcover – recording, mixing, mastering
Additional personnel
María Jesús Velasco – photography
Charts and certifications
Chart positions
15th anniversary edition
Certifications
Release history
References
External links
1997 albums
Dover (band) albums
|
Jørgen Wichfeld (born Jørgen Wichmand, 1 July 1729 – 19 December 1797) was a Danish landowner, industrialist and deputy district judge from Lolland-Falster who was ennobled by letters patent on 23 July 1777. He owned Engestofte on Lolland, Ulriksdal, and from 1774 to 1787 also Nordfeld on Møn.
Biography
Jørgen Wichmand was born at Engestofte in the island of Lolland as the oldest of two sons of Bertel Wichmand (1677–1732) and Bodil Cathrine Wichmand née From (died 1760). His father was a wealthy merchant from Nykøbing Falster who had acquired the estate on which his son was born in 1727.
Wichmand took over Engestofte after his mother's death in 1760. He expanded his holdings by acquiring Ulriksdal in 1766 and also bought Nordfeld on Møn at auction in 1774 but sold it again in 1787. He obtained a royal license to open a starch and cosmetic powder factory at Engestofte in 1770.
Wichmand and his brother Thomas Frederik Wichmand were ennobled by letters patent with the name Wichfeld on 23 July 1777.
He was a deputy district judge at Lolland-Falsters landsting in 1769–1787 and was appointed to etatsråd in 1779.
Legacy
Wichfeld never married and had no children. On 8 November 1799, he left his two estates to his nephew Henning Wichfeld with an obligation to turn them into a (family foundation).
References
Danish nobility
18th-century Danish landowners
Danish industrialists
18th-century Danish businesspeople
1729 births
1797 deaths
People from Guldborgsund Municipality
Jørgen
|
Cras is a commune in the Isère department in southeastern France.
Population
See also
Communes of the Isère department
References
Communes of Isère
Isère communes articles needing translation from French Wikipedia
|
```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');
```
|
Martyn Thomas (born 24 April 1987) is a Welsh rugby union player. He plays in the full back position.
He went to UWIC from 2005 to 2008. He studied Sports Development during this period before joining the Scarlets regional team and subsequently Newport Gwent Dragons.
Thomas signed an extended contract with Newport Gwent Dragons in January 2010.
Thomas joined Gloucester Rugby on a one-year contract, option for a further season, starting at the 2012/13 season.
Following a stint in France, Thomas signed for Coventry. He made his debut on the bench for Coventry's game against Richmond on 31 January as they look to attain promotion back into the RFU Championship.
On 27 February 2015, Thomas made his return to the Aviva Premiership as he signed for Wasps until the end of the 2014–15 season.
On 24 April 2015, Thomas signed a permanent deal with London Welsh in the RFU Championship from the 2015–16 season.
References
External links
Newport Gwent Dragons profile
Information from Welsh Rugby Union
Gloucester Rugby Profile
1987 births
Rugby union players from Carmarthen
Welsh rugby union players
Scarlets players
Dragons RFC players
Gloucester Rugby players
Living people
Rugby union players from Gloucestershire
Rugby union fullbacks
|
```ruby
class Config < ApplicationRecord
# This class exists to take advantage of Rolify for limiting authorization
# on internal reports.
# NOTE: It is not backed by a database table and should not be expected to
# function like a traditional Rails model
resourcify
end
```
|
Doravarisatram mandal is one of the 34 mandals in Tirupati district in the Indian state of Andhra Pradesh. It is a part of Sullurupeta revenue division.
History
Doravarisatram mandal used to be a part of Nellore district under Gudur revenue division. On 25 June 2013, it was made part of the newly-formed Naidupeta revenue division. On 4 April 2022, the Government of Andhra Pradesh reorganized the districts in the state and the madal was made part of the Tirupati district under Sullurupeta revenue division, both newly-formed.
Biodiversity
Doravarisatram mandal has brackish water ecosystem. Every year, terrestrial and aquatic birds migrate to Pulicat Lake area for a temporary stay. The ecosystem covers an area of including parts of the mandal along with Chittamur, Sullurpeta, Tada and Vakadu mandals. The terrestrial birds include painted storks, large egrets, little egrets, grey pelicans, grey herons; water birds include northern pintails, black-winged stilts, northern shovelers, common teal, seagulls, terns, sandpipers, and common coots.
Demographics
, Doravarisatram mandal had a total population of 35,971 with 18,120 male population and 17,851 female population with a density of , all living in rural areas. Scheduled Castes and Scheduled Tribes made up 14,520 and 4,191 of the population respectively. It had a sex ratio of 985. It had a literacy rate of 62.43% with 70.08% among males and 54.69% among females.
Administration
The mandal is administrated as part of Sullurupeta revenue division. As of 2011 census, It comprises the following 45 villages:
Note: Damaraya Khandrika, K. D. Khandrika, Suragunta Tagelu and Vengamambapuram are uninhabited
Politics
Chillakur mandal is a part of Sullurpeta Assembly constituency and Tirupati Lok Sabha constituency. , Chillakur mandal had 23,414 eligible voters with 11,491 male voters and 11,923 female voters.
References
Mandals in Tirupati district
|
Thomas Brerwood (died c. 1544) was Archdeacon of Barnstaple from 1528 to 1544.
He was a fellow of All Souls' College, Oxford in 1511, B.C.L. in 1511/12 and D.C.L. in 1527
He was canon of St. Paul's cathedral from 1518 to 1524, archdeacon of Barnstaple from 1528 to 1544, rector of St. Ewe from 1536 and chancellor to the Bishop of Exeter.
His will was dated 22 May 1544 and proved in March 1545.
References
Archdeacons of Barnstaple
1540s deaths
Year of birth unknown
Year of death uncertain
|
```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 */
```
|
The 1966 Syracuse Orangemen football team represented Syracuse University in the 1966 NCAA University Division football season. The Orangemen were led by 18th-year head coach Ben Schwartzwalder and played their home games at Archbold Stadium in Syracuse, New York. After losing their first two games of the season, Syracuse won the next eight games, finishing the regular season with a record of 8–2 and ranked 16th in the Coaches Poll. They were invited to the 1966 Gator Bowl, where they lost to Tennessee.
Schedule
References
Syracuse
Syracuse Orange football seasons
Lambert-Meadowlands Trophy seasons
Syracuse Orangemen football
|
Merchant Archive Ltd. is a British fashion label and the store was founded in London by Sophie Merchant in 2007.
History
The first store was located at 320 Kilburn Road in the Queen's Park located partly in the city of Westminster and essentially stocked vintage clothing and furniture. Merchant slowly introduced contemporary fashion designer labels in the store.
In 2011 the store moved to Notting Hill at Kensington Park Road. which was a beautiful, peaceful place. Even though the place was unusual it was nice.
In 2012 Merchant designed her first capsule collection of womenswear under the label Merchant Archive.
In 2014 the company launched an online store as well as a first complete collection of womens wear.
In 2014 the Notting Hill store became a separate brand.
References
External links
Clothing brands of the United Kingdom
Clothing companies based in London
Clothing companies of England
Clothing retailers of England
|
```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');
```
|
The women's shot put event at the 2020 Summer Olympics took place on 30 July and 1 August 2021 at the Japan National Stadium. Approximately 35 athletes are expected to compete; the exact number will depend on how many nations use universality places to enter athletes in addition to the 32 qualifying through distance or ranking (2 universality places were used in 2016).
Summary
On the first throw of the final Raven Saunders dropped a 19.65m, which proved sufficient to nail down silver. As the fifth thrower, Gong Lijao's 19.95m would prove to be better than anyone else could muster. The only other thrower over 19 metres in the first round was Auriol Dongmo with 19.29m. In the second round, two time Olympic Champion, in her fifth Olympics, Valerie Adams tossed 19.49m to move into third and the medal order had been decided. Adams threw her best in the third round with a 19.62m, followed shortly by Gong improving to 19.98m. In the fourth round, Dongmo made her best effort 19.57m, but not enough to pass Adams. In the fifth round, Saunders threw her best 19.79m, but on the next throw, Gong hit 20.53 to extend her lead. Saunders made one more effort in the final round, her shot landing well beyond the 20 meter tape shortly after her foot landed over the toe board making it a foul. Relaxed as the winner, Gong followed with her best effort, to take gold.
Background
This will be the 19th appearance of the event, having appeared at every Summer Olympics since 1948.
Qualification
A National Olympic Committee (NOC) could enter up to 3 qualified athletes in the women's shot put event if all athletes meet the entry standard or qualify by ranking during the qualifying period. (The limit of 3 has been in place since the 1930 Olympic Congress.) The qualifying standard is 18.50 metres. This standard was "set for the sole purpose of qualifying athletes with exceptional performances unable to qualify through the IAAF World Rankings pathway." The world rankings, based on the average of the best five results for the athlete over the qualifying period and weighted by the importance of the meet, will then be used to qualify athletes until the cap of 32 is reached.
The qualifying period was originally from 1 May 2019 to 29 June 2020. Due to the COVID-19 pandemic, the period was suspended from 6 April 2020 to 30 November 2020, with the end date extended to 29 June 2021. The world rankings period start date was also changed from 1 May 2019 to 30 June 2020; athletes who had met the qualifying standard during that time were still qualified, but those using world rankings would not be able to count performances during that time. The qualifying time standards could be obtained in various meets during the given period that have the approval of the IAAF. Both outdoor and indoor meets are eligible. The most recent Area Championships may be counted in the ranking, even if not during the qualifying period.
NOCs can also use their universality place—each NOC can enter one female athlete regardless of time if they had no female athletes meeting the entry standard for an athletics event—in the shot put.
Competition format
The 2020 competition will continue to use the two-round format with divided final introduced in 1936. The qualifying round gives each competitor three throws to achieve a qualifying distance (not yet set; 2016 used 18.40 metres); if fewer than 12 women do so, the top 12 will advance. The final provides each thrower with three throws; the top eight throwers receive an additional three throws for a total of six, with the best to count (qualifying round throws are not considered for the final).
Records
Prior to this competition, the existing world, Olympic, and area records are as follows.
Schedule
All times are Japan Standard Time (UTC+9)
The women's shot put will take place over two separate days.
Results
Qualifying
Qualification Rules: Qualifying performance 18.80 (Q) or at least 12 best performers (q) advance to the Final.
Final
References
Women's shot put
2020
Women's events at the 2020 Summer Olympics
Olympics
|
Lines Written a Few Miles above Tintern Abbey is a poem by William Wordsworth. The title, Lines Written (or Composed) a Few Miles above Tintern Abbey, on Revisiting the Banks of the Wye during a Tour, July 13, 1798, is often abbreviated simply to Tintern Abbey, although that building does not appear within the poem. It was written by Wordsworth after a walking tour with his sister in this section of the Welsh Borders. The description of his encounters with the countryside on the banks of the River Wye grows into an outline of his general philosophy. There has been considerable debate about why evidence of the human presence in the landscape has been downplayed and in what way the poem fits within the 18th-century loco-descriptive genre.
Background
The poem has its roots in Wordsworth's personal history. He had previously visited the area as a troubled twenty-three-year-old in August 1793. Since then he had matured and his seminal poetical relationship with Samuel Taylor Coleridge had begun. Wordsworth claimed to have composed the poem entirely in his head, beginning it upon leaving Tintern and not jotting down so much as a line until he reached Bristol, by which time it had just reached mental completion. Although the Lyrical Ballads upon which the two friends had been working was by then already in publication, he was so pleased with what he had just written that he had it inserted at the eleventh hour as the concluding poem. Scholars generally agree that it is apt, for the poem represents the climax of Wordsworth's first great period of creative output and prefigures much of the distinctively Wordsworthian verse that was to follow.
The poem is written in tightly structured decasyllabic blank verse and comprises verse paragraphs rather than stanzas. Categorising the poem is difficult, as it contains some elements of the ode and of the dramatic monologue. In the second edition of Lyrical Ballads, Wordsworth noted:
"I have not ventured to call this Poem an Ode but it was written with a hope that in the transitions, and the impassioned music of the versification, would be found the principle requisites of that species of composition."
The apostrophe at its beginning is reminiscent of the 18th century landscape-poem, but it is now agreed that the best designation of the work would be the conversation poem, which is an organic development of the loco-descriptive. The silent listener in this case is Wordsworth's sister Dorothy, who is addressed in the poem's final section. Transcending the nature poetry written before that date, it employs a much more intellectual and philosophical engagement with the subject that verges on pantheism.
Outline of themes
The poem's tripartite division encompasses a contextual scene-setting, a developing theorisation of the significance of his experience of the landscape, and a final confirmatory address to the implied listener.
Lines 1–49
Revisiting the natural beauty of the Wye after five years fills the poet with a sense of "tranquil restoration". He recognises in the landscape something which had been so internalised as to become the basis for out of the body experience.
Lines 49–111
In "thoughtless youth" the poet had rushed enthusiastically about the landscape and it is only now that he realises the power such scenery has continued to have upon him, even when not physically present there. He identifies in it "a sense sublime/ Of something far more deeply interfused,/ Whose dwelling is the light of setting suns" (lines 95–97) and the immanence of "A motion and a spirit, that impels/ All thinking things, all objects of all thought,/ And rolls through all things" (lines 100–103). With this insight he finds in nature "The anchor of my purest thoughts, the nurse,/ The guide, the guardian of my heart, and soul/ Of all my moral being" (lines 108–111).
Lines 111–159
The third movement of the poem is addressed to his sister Dorothy, "my dearest Friend,/ My dear, dear Friend," as a sharer in this vision and in the conviction that "all which we behold is full of blessings". It is this that will continue to create a lasting bond between them.
Literary and aesthetic context
Having internalised the landscape, Wordsworth claimed now "to see into the life of things" (line 50) and, so enabled, to hear "oftentimes/ The still sad music of humanity" (92-3), but recent critics have used close readings of the poem to question such assertions. For example, Marjorie Levinson views him "as managing to see into the life of things only 'by narrowing and skewing his field of vision' and by excluding 'certain conflictual sights and meanings. Part of her contention was that he had suppressed mention of the heavy industrial activity in the area, although it has since been argued that the "wreaths of smoke", playfully interpreted by Wordsworth as possible evidence "of some Hermit’s cave" upslope, in fact acknowledges the presence of the local ironworks, or of charcoal burning, or of a paper works.
Another contribution to the debate has been Crystal Lake's study of other poems written after a visit to Tintern Abbey, particularly those from about the same time as Wordsworth's. Noting not just the absence of direct engagement on his part with "the still sad music of humanity" in its present industrial manifestation, but also of its past evidence in the ruins of the abbey itself, she concludes that this "confirms Marjorie Levinson‘s well-known argument that the local politics of the Monmouthshire landscape require erasure if Wordsworth's poem is to advance its aesthetic agenda."
The poems concerned include the following:
1745. Rev. Dr. Sneyd Davies, Epistle IV "Describing a Voyage to Tintern Abbey, in Monmouthshire, from Whitminster in Gloucestershire"
About 1790. Rev. Duncomb Davis, "Poetical description of Tintern Abbey"
1790s. Edmund Gardner, "Sonnet written in Tintern Abbey"
1796. Edward Jerningham, "Tintern Abbey"
About 1800. Rev. Luke Booker, "Original sonnet composed on leaving Tintern Abbey and proceeding with a party of friends down the River Wye to Chepstow"
As the boat carrying Sneyd Davies neared Tintern Abbey, he noted the presence of "naked quarries" before passing to the ruins, bathed in evening light and blending into the natural surroundings to give a sense of "pleasurable sadness". The poem by Davies more or less sets the emotional tone for the poems to come and brackets past and present human traces far more directly than does Wordsworth. His fellow clergyman Duncomb Davis, being from the area, goes into more detail. After a historical deviation, he returns to the present, where
… now no bell calls monks to morning prayer,
Daws only chant their early matins there,
Black forges smoke, and noisy hammers beat
Where sooty Cyclops puffing, drink and sweat,
following this with a description of the smelting process and a reflection that the present is more virtuous than the past. He anticipates Wordsworth by drawing a moral lesson from the scene, in his case noting the ivy-swathed ruin and exhorting,
Fix deep the bright exemplar in thy heart:
To friendship’s sacred call with joy attend,
Cling, like the ivy, round a falling friend.
Similar reflections appear in the two contemporary sonnets. For Edmund Gardner, "Man’s but a temple of a shorter date", while Luke Booker, embarking at sunset, hopes to sail as peacefully to the "eternal Ocean" at death. The action of Wordsworth's poem therefore takes place in an already established moral landscape. Its retrospective mood draws on a particularly 18th century emotional sensibility also found in Edward Jerningham's description of the ruins, with their natural adornments of moss and 'flow'rets', and reflected in J. M. W. Turner's watercolour of them. Wordsworth's preference in his poem is for the broader picture rather than human detail, but otherwise it fits seamlessly within its contemporary literary and aesthetic context.
References
Bibliography
Durrant, Geoffrey. William Wordsworth (Cambridge: Cambridge University Press, 1969)
External links
Wordsworth biography and works
Online Text of Poem
Poetry by William Wordsworth
1798 poems
|
Paul Gow (born 10 November 1970) is an Australian professional golfer.
Gow was born in Sydney, Australia. He turned professional in 1993.
Gow has won three times on the Nationwide Tour, once in 1997, once in 2000, and once in 2006. He has never won on the PGA Tour, but he did come close when he lost in a playoff to Jeff Sluman at the 2001 B.C. Open.
Gow is 0-for-3 in playoffs on the Nationwide Tour, all of which were lost during the 2004 season, in which he finished 11th on the final money list.
Professional wins (4)
PGA Tour of Australasia wins (1)
Nationwide Tour wins (3)
Nationwide Tour playoff record (0–3)
Playoff record
PGA Tour playoff record (0–1)
Results in major championships
CUT = missed the half-way cut
Note: Gow only played in the U.S. Open.
Team appearances
Amateur
Australian Men's Interstate Teams Matches (representing New South Wales): 1989 (winners), 1990 (winners), 1991 (winners), 1992 (winners), 1993
Professional
World Cup (representing Australia): 1999
See also
2000 Buy.com Tour graduates
2004 Nationwide Tour graduates
2006 PGA Tour Qualifying School graduates
External links
Australian male golfers
PGA Tour golfers
PGA Tour of Australasia golfers
Korn Ferry Tour graduates
Golfers from Sydney
1970 births
Living people
Sportsmen from New South Wales
|
Bonus points are group tournament points awarded in rugby union tournaments in addition to the standard points for winning or drawing a match. Bonus points were implemented in order to encourage attacking play throughout a match, to discourage repetitive goal-kicking, and to reward teams for "coming close" in losing efforts.
Standard system
The most common point system is:
4 points for winning a match
2 points for drawing a match
0 points for losing a match
1 losing bonus point for losing by 7 points (or fewer)
1 try bonus point for scoring (at least) 4 tries, regardless of the outcome.
In this system, winning teams get 4 or 5 points; drawing teams 2 or 3 points; and losing teams between 0 and 2 points:
Variant systems
France
The French professional league, Ligue Nationale de Rugby (LNR), uses a similar system in its two competitions, the Top 14 and Rugby Pro D2. After trialling the system in 2007–08, LNR adopted the new system permanently after that season.
The French system awards points in this manner:
4 points for a win.
2 points for a draw.
1 "bonus" point for winning while scoring the equivalent of at least 3 more tries than the opponent (15 points).
1 "bonus" point for losing by no more than a specified margin. Through the 2013–14 season, the margin was 7 points; starting in 2014–15, the margin was reduced to 5.
This system prevents a losing team from picking up two bonus points in the same match, as is possible under the normal system. It also means that neither team earns a bonus point in a drawn match.
Australian NRC (2014–2016)
For its first three seasons from 2014 to 2016, the National Rugby Championship of Australia used a system somewhat similar to that of France:
4 points for a win.
2 points for a draw.
1 "bonus" point for winning while scoring at least 3 more tries than the opponent.
1 "bonus" point for losing by no more than 8 points (the value of a converted try under the law variations used during those seasons).
In 2017 the NRC (including a team in Fiji) reverted to the standard scoring values of five points for a try, two for a conversion and three for a penalty or drop goal. The bonus point system therefore fell into line with the SANZAAR system widely adopted in that year.
SANZAAR
In 2016, Super Rugby in the SANZAAR countries of Argentina, Australia, New Zealand and South Africa, also with a team in Japan, switched from the standard system to the original French system, i.e.
4 points for a win.
2 points for a draw.
1 "bonus" point for scoring at least 3 more tries than the opponent.
1 "bonus" point for losing by no more than 7 points (the value of a converted try).
SANZAAR extended this change to The Rugby Championship, contested by the men's national teams of its four member countries, in 2017.
Six Nations
The 2017 Six Nations Championship used the standard bonus points system on a trial basis, with the added feature that a team winning the Grand Slam would earn three extra bonus points to ensure that a grand slam winning team is guaranteed to win the tournament. Six Nations tournaments also award a bonus point to any team that scores four tries or more, regardless of the outcome, meaning that a losing team can score up to two points if they score four tries and lose by seven points or less.
Tables
Bonus points are typically listed in the group standings table, as for example the BP column in 2015 Rugby World Cup Pool B:
More detailed tables may list losing-bonus points and tries-bonus points separately, as respectively the LB and TB columns in the 2015–16 European Rugby Champions Cup Pool 2 table:
Details
This format was created for New Zealand's domestic competition, the National Provincial Championship, in 1995 and subsequently adopted in the inaugural Super 12 in 1996. It was first used at the Rugby World Cup in 2003, and has been the staple for international and club competition since.
Other forms of rugby
Rugby sevens, while still under the rugby union banner, does not use this system, and instead gives points for wins and draws. Sevens is a faster, more try-friendly game with a shorter time limit and a tendency to have runaway results. Sevens competitions are also usually one or two day affairs with an emphasis on the final bracket. All of this means there is little reason in using the bonus point system for the seven-a-side game.
Rugby league has tried out similar bonus point systems in some competitions, but most competitions only give points for wins and draws. However, from 2007 season through to 2014, the Championship and League 1 (the two levels below Super League), primarily in England but also featuring teams in France and Wales during this time frame, gave 3 points for a win, 2 for a draw, and 1 for a loss by 12 points or fewer (this amounts to two converted tries in rugby league, which gives four points for a try instead of the five points awarded in union). This changed in the 2015 season when the points system was brought into line with that of Super League, thereby standardising the system across Britain's three professional Rugby League divisions, abandoning the bonus points system.
Notes and references
Bonus points
|
```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()
```
|
City News Bureau of Chicago (CNB), or City Press (1890–2005), was a news bureau that served as one of the first cooperative news agencies in the United States. It was founded in 1890 by the newspapers of Chicago to provide a common source of local and breaking news and also used by them as a training ground for new reporters, described variously as "journalism's school of hard knocks" or "the reporter's boot camp." Hundreds of reporters "graduated" from the City News Bureau into newspaper dailies—both local and national—or other avenues of writing.
Operations
The City News Bureau had reporters in all important news sites, courthouses, Chicago City Hall, the County Building, Criminal Courts, as well as having as many as ten police reporters on duty. It operated around the clock and all year round. The reporters, though young, worked in competition with some of the best reporters in the country, working on the same stories as all the others, questioning politicians and police, and fighting for scoops.
They covered every single death reported to the coroner's office, every important meeting, every news conference, every court case that had once been a news story, even if the trial wasn't newsworthy.
The training was rigorous. The reporters were all amateurs when they came to work, but the rewrite men were professionals, accustomed to teaching in a hard school. Turnover was rapid at CNB as reporters eagerly sought newspaper jobs as soon as they felt they had paid their dues in CNB trenches.
One graduate was Kurt Vonnegut. He described his work there in the late 1940s in terms that could have been used by almost any other City Press reporter of any era:
"I'm very proud I worked there. It was like being a soldier."
"Well, the Chicago City News Bureau was a tripwire for all the newspapers in town when I was there, and there were five papers, I think. We were out all the time around the clock and every time we came across a really juicy murder or scandal or whatever, they’d send the big time reporters and photographers, otherwise they’d run our stories. So that’s what I was doing, and I was going to university at the same time."
A legendary story held that a young reporter who called in a story of the slaying of an infant was sent back to get the answer to the question, "What color were the dead baby's eyes?" Certainly, all the young reporters were sent back to get more information so that they would learn to get it in the first place. Another watchword: "If your mother tells you she loves you, check it out with two independent sources" or "If your mother says she loves you, check it out."
The City News Bureau had special operations for covering elections in Chicago and Cook County, providing regular updates precinct by precinct years before such coverage was common. A similar service reported on the scores of most high-school games in Chicago, but otherwise there was no sports coverage.
The film Call Northside 777, in which James Stewart plays a reporter whose articles free an innocent man from prison, was based on a story that originated at the City News Bureau.
The City News Bureau broke the story of the St. Valentine's Day Massacre in 1929, but, for once, didn't quite believe its reporter, Walter Spirko, and sent the following bulletin:
Six men are reported to have been seriously injured . . .
Spirko continued as a Chicago reporter for many years, breaking a story of thieving policemen known as the Summerdale police scandal.
The City News Bureau didn't always confine its scoops to local stories. One momentous non-local event originated on a quiet Sunday in 1941, when a reporter at the Damen Avenue police station on the city's near-northwest side was slowly twisting a dial on the desk sergeant's short wave radio when he heard toe static-punctuated voice of an amateur radio operator telling another "ham" that "bombs are falling all over Honolulu." The eavesdropping reporter could hear explosions in the background of the radio transmission. He phoned what he had heard to his city editor, who immediately sent bulletins to the CNB's four major newspapers and the member of the Associated Press. It caught the AP by surprise and within seconds the report was on news wires worldwide. CNB was the first to break the news of Japan's Attack on Pearl Harbor.
Playwright Charles MacArthur, co-author of the play The Front Page, was a City Press reporter; several of the characters in the play were based on City Press personalities, notably the skittish assistant managing editor Larry Mulay.
Other well-known alumni: syndicated columnist and Politico editor Roger Simon, reclusive media mogul Fred Eychaner, environmental journalist William Allen, investigative reporter Seymour Hersh, The New York Times columnist David Brooks (author of Bobos in Paradise), pop artist Claes Oldenburg, public-television personality John Callaway, editor Russell Freeburg, consumer advocate David Horowitz, Pulitzer Prize-winning columnist Mike Royko, Pulitzer Prize-winning editorial cartoonist Herbert Lawrence Block (commonly known as Herblock), and Jack Star, later to become senior editor of Look (American magazine) and perennial freelance writer for Chicago Magazine.
Clarence John Boettiger, son-in-law of Franklin Delano Roosevelt, became a Chicago Tribune police reporter after working for the City News Bureau to begin his career. Elizabeth Austin of the bureau later became a speechwriter for one Illinois governor and communications director for another. Tom Quinn, who worked for City News in 1964 while a student at Northwestern, later managed Jerry Brown's first campaign for governor of California, became chairman of California's Air Resources Board and the state's Environmental Secretary, and served as chairman for two of Los Angeles Mayor Tom Bradley's campaigns.
Other mainstays of City News Bureau's staff included Arnold Dornfeld, Melvyn Douglas, Susan Kuczka, Paul Zimbrakos, Milton Golin, Bernard Judge. Isaac Gershman served as managing editor from 1931-1964.
The City News Bureau had three teletype wires, one for the Chicago dailies, one for radio and television stations, and one for press releases. In addition, it owned a pneumatic tube system that ran under Chicago streets connecting all the Chicago dailies, including those that no longer existed. The office kept a speaker system tuned live 24 hours to the coded Chicago police radio dispatcher frequency, announcing addresses to which City News Bureau reporters were sent.
As Chicago went down to only two daily newspapers, the City News Bureau slowly faded and was reduced to a minor operation. It was still widely used by both papers, the Chicago Tribune and Chicago Sun-Times, until the Sun-Times decided to pull out of the joint ownership agreement it had inherited from the City News Bureau's original owners, for which the Sun-Times was a successor paper. The PR Newswire, which was part of City News, was sold; the Sun-Times decided it cost too much to keep City News running, and it was closed after its last dispatch February 28, 1999. Electronic news media—both radio and television—both used City News throughout the 1990s, until the Sun-Times, owned by Conrad Black's Hollinger International, decided to pull out. (After Black was indicted in 2005 on charges of looting Hollinger, some speculated his desire to squeeze cash out of the company's properties helped hasten the demise of the original City News.)
The New City News Service, owned by the Tribune, opened soon thereafter, and soon changed its name to the City News Service. Though smaller, it was run by Paul Zimbrakos, a 40-plus year employee of the old CNB, and the bureau's last editor. Sun-Times management had thought they would be able to create a new, cheaper wire service, staffed with few people. When that venture—called Alliance News—failed, for a while the Sun-Times used the part-time help of Medill News Service, staffed by unpaid journalism students from the Medill School of Journalism. The Sun-Times, however, was barred from receiving the New City News Service wire because of its being in competition with the Tribune.
Though the Tribune had been hailed by former City Newsers as a savior of CNB, on December 1, 2005, the Tribune informed the 19 employees of City News Service that their jobs were being eliminated as part of cost-cutting measures going on throughout the Tribune Company. (See Associated Press and other news stories of December 1 & December 2, 2005.) Tribune editors and executives reasoned that CNS was providing the Tribune's competitors' Web sites with news that the paper itself should have exclusively, the better to compete in an age of Internet news distribution.
The City News Service closed at the end of 2005, and was swallowed into a smaller Tribune Internet news operation.
City News lives on, in spirit, at least, at the Sun-Times. In February 2006, the Sun-Times worked to fill the void felt at the city's TV and radio stations by the demise of the old City News by starting its own 24-hour newswire, the STNG Wire. The key to the operation, staffed by veterans of both the original and the Tribune-run City News, is the Daybook, the invaluable daily listing of press conferences, court activity and other events throughout the Chicago metropolitan area, which is shared with subscribers and the Sun Times News Group family. The STNG wire also covers the blood and guts news—the fires, murders, shootings, stabbings, automobile accidents—that City News was known for, 24 hours a day, seven days a week.
Former City News Editor Paul Zimbrakos continues to teach young journalists through his City News Bureau course at Loyola University Chicago. Here is the course description from the Loyola School of Communication website:
"In fall 2009 the School of Communication started offering students access to a Chicago news gathering institution the City News Bureau. For over 100 years Chicago hosted one of the best news bureaus in the country. Young reporters learned at The City New Bureau of Chicago how the city worked and how they could best cover the city. We are re-launching that bureau in the form of a course this fall. It will be taught by two remarkable journalism veterans. Paul Zimbrakos was the Managing Editor of the bureau for a number of years before it closed its doors and tutored many of the best journalists in the country. Jack Smith was the former CBS Bureau Chief in Chicago and Washington DC. Together they will make this class a rich learning lab and help students discover how best to cover a city and its inner-workings."
Zimbrakos passed away May 31, 2022, according to CBS News Chicago.
References
Further reading
Dornfeld, Arnold; Behind the Front Page: The Story of the City News Bureau of Chicago (1983)
External links
Reminiscences of CNB gathered by the Headline Club of Chicago
Chronology of Kurt Vonnegut
A reminiscence of CNB in the 1990s. The murder mentioned was at the Jarvis "L' Stop on the Chicago Transit Authority's Howard/Red Line.
Claes Oldenburg biography on the Guggenheim Museum Website.
AP story on City News Service closing.
City News Bureau Records at the Newberry Library
News agencies based in the United States
|
Nyeanella is a genus of moths of the family Noctuidae.
References
Natural History Museum Lepidoptera genus database
Noctuidae
|
```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
```
|
was a railway station located in Noto, Hōsu District, Ishikawa Prefecture, Japan. This station was abandoned on April 1, 2005.
Line
Noto Railway
Noto Line
Adjacent stations
External links
Tsukumowan-Ogi Station page at notor.info
Railway stations in Ishikawa Prefecture
Defunct railway stations in Japan
Railway stations closed in 2005
Railway stations in Japan opened in 1963
|
Green Island in Ottawa, Ontario, Canada, is an island at the junction of the Rideau River, just off Sussex Drive in Ottawa at the Rideau Falls at the confluence with the Ottawa River. It is situated near the neighbourhood of New Edinburgh.
To the west of the island is the National Research Council, and Global Affairs Canada (formerly Foreign Affairs, Trade and Development Canada); to the east is 24 Sussex Drive and the embassy of France. On either side of the falls are facilities for a hydroelectric power plant.
Down the Rideau river are the ruins of a rail bridge that once led to Ottawa's Union Station.
Commemorations
Green Island has several commemorations including:
the Mackenzie-Papineau Monument to Canadian veterans of the Spanish Civil War,
the Ottawa Memorial was erected in the form of a huge bronze globe by the Commonwealth War Graves Commission and Public Works Canada. The memorial was unveiled by Her Majesty Queen Elizabeth II on July 1, 1959. The Ottawa Memorial commemorates approximately 800 men and women who were in active service or in training with the Commonwealth air forces in Canada, the Caribbean and the United States, who died during the Second World War. They have no known grave, or were buried at remote crash sites that are considered to be inaccessible.
the National Artillery Monument was unveiled by Major-General Georges P. Vanier on September 21, 1959, in Major's Hill Park. The Monument was moved to Green Island in 1997 as part of the National Capital Commission’s restructuring plan. On 24 May 1998, the monument was rededicated on Green Island. On November 11 of each year, a memorial service is held at National Artillery Monument immediately following the national ceremony at the Cenotaph. A wreath is laid by the Colonel Commandant or the Director of Artillery on behalf of The Royal Regiment of Canadian Artillery.
A sculpture of Lieutenant Colonel John McCrae by Ruth Abernethy was erected in 2015 with his dress as an artillery officer and his medical bag nearby, as he writes In Flanders Fields. The statue shows the destruction of the battlefield and, at his feet, the poppies which are a symbol of Remembrance of World War I and all armed conflict since.
Ottawa City Hall (1958–2001)
Green Island was the location of Old City Hall, of the old city of Ottawa, before the amalgamation of the region in 2001. After considering 36 different locations, Green Island was confirmed as the new location of Ottawa City Hall on January 31, 1956. The official sod-turning ceremony was held on September 16, 1956. Construction was completed in 1958. City Council held its first meeting at the new location on July 21, 1958. Princess Margaret officially opened the stone and glass building, which featured a marble spiral staircase leading to the second floor, on August 2, 1958. This building remained Ottawa’s City Hall until municipal amalgamation came into effect on January 1, 2001. The building of an expensive addition to the city hall (designed by Moshe Safdie), the architect of the National Gallery of Canada shortly before the building was decommissioned was a source of controversy in the city.
References
Landforms of Ottawa
River islands of Ontario
|
Warden is a village in Northumberland, England about west of Hexham.
The North and South Tyne meet near the village of Warden. There is a pleasant walk from the Boat Inn [later renamed to Boatside Inn] along the bank of the South Tyne to the meeting of the waters. The Boat Inn was formerly the place of a ferry until the toll bridge was built across the river. The toll house still stands, but the old bridge was replaced in 1904 by a County structure. The Newcastle and Carlisle Railway crosses the river by a strongly built iron bridge. Warden is dominated by the old motte, now tree covered, and higher still are the earthworks of a prehistoric fort. The church boasts one of the slender Anglo-Danish towers which are a feature of the Tyne valley. The churchyard appears oval in shape, which reinforces the notion of the great age of these Tyne parish centres. A carved stone stands close to the tower, but nothing more is claimed for it than being a 'market cross'. As, however, there is no record of a market here, inherently unlikely because of the proximity of Hexham market, a better case for its origin may be as one of the boundary crosses marking the sanctuary limits or 'frith' of St Wilfrid's church at Hexham. The socket of one such cross survived near the road at Acomb.
From Warden one can see eastwards among the trees which rise on the northern slope of the valley the spire of the Church of St John Lee on high ground at Acomb. It commemorates the hermitage of St John of Beverley, sometime bishop of Hexham (689-705). The present church is no older than 1818-85.
From High Warden, on the hillside, a path leads to a large fortified British camp crowning the hill, which gives a fine outlook over the surrounding country.
Governance
Warden is in the parliamentary constituency of Hexham.
Economy
Warden is situated on a triangle of land between the two Tynes. It had a water mill on the North Tyne and a paper mill on the South Tyne, which started in 1763 and still exists. A century ago a visitor described how the rags were converted into beautiful white paper. The mill employed 63 hands.
Religious sites
The church at Warden is dedicated to St Michael, and has an Anglo Saxon tower dating back to the eleventh century, and built of Roman stone. Indications are that there was a church earlier than the tower, and in the post Conquest period, another church was added to the tower. The tower arch is built of Roman material, probably from Chesters Roman Fort. Transepts were added in the thirteenth century making the church cruciform in shape. There were alterations in the eighteenth century, and the chancel was rebuilt in 1889. In the chancel is a Norman grave-cover that is the best of its kind in the county. Its shape and tile decoration symbolise a house of the dead.
There are a number of incised grave covers in the porch, and a Roman altar that has been carved with Saxon knot-work. It has been split and reversed, possibly "to empty out the devils." An 18th century horsing-stool stands at the church-gate.
Three of the bells in the church were cast in 1878 by the Newcastle firm of Cox and Sons.
There is also a Methodist church built in 1851. In appearance it resembles a barn rather than an ecclesiastical edifice.
References
External links
GENUKI (Accessed: 28 November 2008)
Villages in Northumberland
|
```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
```
|
```yaml
commonfields:
id: CSCountDevicesForIOC
version: -1
name: CSCountDevicesForIOC
script: >-
res = []
t = []
for v in argToList(demisto.args()['value']):
e = demisto.executeCommand("cs-device-count-ioc", {"type": demisto.args()['type'], "value": v})[0]
if isError(e):
if not '404 (Not Found)' in e['Contents']: # Skip 404 errors - it just means the IOC wasn't found
res += [e]
else:
myData = demisto.get(e, 'Contents.resources')
if myData:
myData = [{k: formatCell(row[k]) for k in row} for row in myData]
t += myData
if t:
res.append({'ContentsFormat': formats['table'], 'Type': entryTypes['note'], 'Contents': t} )
else:
res.append('No results.')
demisto.results(res)
type: python
subtype: python2
tags:
- crowdstrike
comment: Deprecated. List the number devices that match each IOC in query - limited to sha256, sha1, md5 and domain types
system: true
deprecated: true
args:
- name: type
required: true
default: true
description: One of sha256, sha1, md5, domain
- name: value
required: true
description: The IOC to find
scripttarget: 0
dependson:
must:
- cs-device-count-ioc
timeout: 0s
fromversion: 5.0.0
dockerimage: demisto/python:2.7.18.20958
```
|
Abdulrahman bin Jassim bin Muhammed Al Thani (1871–1930) was the sixth son of Sheikh Jassim bin Mohammed Al Thani, the previous Emir and the founder of modern Qatar. In 1898 his father Jassim bin Mohammed Al Thani selected him to become the governor of the Al Wakrah area.
Governorship of Al Wakrah
Sheikh Abdulrahman bin Jassim Al Thani was appointed as Mudir of Al Wakrah by the Ottomans in place of Yusuf Bey in 1903. This elicited protests by the British government, who refused the Ottoman's rights to appoint any administrative official in Qatar.
From December 1907, there were a series of disputes between governor Abdulrahman bin Jassim and the Al-Buainain tribe. The Al-Buainain tribe had objected to paying the annual boat tax, and in reprisal, he fined the tribe 10,000 Qatari riyals and expelled 6 of the tribe's leaders. As retribution, one of the tribe leader's sons attempted to shoot him. His attempt was foiled, and he was imprisoned; however he was later procured forgiveness and released in return for the payment of the tax.
Sons
Sheikh Saud
Sheikh Mohammed
Sheikh Khalid
Sheikh Mubarak
Sheikh Hassan
Sheikh Ghanim
References
External links
Althani tree
1871 births
1930 deaths
Abdulrahman
Mayors of places in Qatar
Sons of monarchs
|
Mawugbe Atsu (born 20 August 1986) is a Togolese footballer. He currently plays for Maranatha F.C.
International career
Atsu earned his first call up for his country on 6 September 2009 for the World Cup Qualifying Match against Morocco national football team, who gave his debut for Togo.
References
External links
1986 births
Living people
Togolese men's footballers
Togo men's international footballers
Maranatha FC players
2013 Africa Cup of Nations players
Men's association football goalkeepers
21st-century Togolese people
|
```javascript
module( "plugins.justify" );
test( '', function() {
var editor = te.obj[0];
var range = te.obj[1];
var body = editor.body;
editor.setContent( '<p><em>hello1</em></p>' );
setTimeout(function(){
range.setStart( body.firstChild.firstChild.firstChild, 3 ).collapse( true ).select();
editor.execCommand( 'justify', 'center' );
equal( body.firstChild.style['textAlign'], 'center', 'p' );
start();
},50);
stop();
} );
test( '', function() {
var editor = te.obj[0];
var range = te.obj[1];
var body = editor.body;
editor.setContent( '<p><em>hello1</em></p><p><span style="color:red">hello2</span>hello3</p>' );
setTimeout(function(){
range.selectNode( body.firstChild.firstChild.firstChild ).select();
editor.execCommand( 'justify', 'center' );
equal( body.firstChild.style['textAlign'], 'center', 'p' );
range.setStart( body.firstChild, 0 ).setEnd( body.lastChild, 1 ).select();
editor.execCommand( 'justify', 'right' );
equal( body.firstChild.style['textAlign'], 'right', 'p' );
equal( body.lastChild.style['textAlign'], 'right', 'p' );
range.setStart( body.firstChild.firstChild.firstChild, 3 ).collapse( true ).select();
editor.execCommand( 'justify', 'center' );
equal( body.firstChild.style['textAlign'], 'center', 'p' );
start();
},50);
stop();
} );
//test( '-json', function() {
// var editor = te.obj[0];
// var range = te.obj[1];
// editor.setContent( '<table><tbody><tr><td></td><td><p>hello</p></td></tr></tbody></table>' );
// setTimeout(function(){
// var tds = editor.body.getElementsByTagName( 'td' );
// range.setStart( tds[1].firstChild, 0 ).collapse( true ).select();
// editor.execCommand( 'justify', 'right' );
// equal( tds[1].firstChild.style['textAlign'], 'right', 'p' );
// equal( editor.queryCommandValue( 'justify' ), 'right', 'querycommand value' );
// start();
// },50);
// stop();
//} );
test( 'startContainerbody', function() {
var editor = te.obj[0];
var range = te.obj[1];
editor.setContent( '<p><em>tell</em></p>' );
setTimeout(function(){
range.setStart( editor.body, 0 ).collapse( true ).select();
editor.execCommand( 'justify', 'right' );
equal( editor.queryCommandValue( 'justify' ), 'right', 'startContainer body' );
equal( editor.queryCommandValue( 'justify' ), 'right', 'querycommand value' );
/*json*/
range.setStart( editor.body, 0 ).collapse( true ).select();
editor.execCommand( 'justify', {'text-align':'left'} );
equal( editor.queryCommandValue( 'justify' ), 'left', 'startContainer body--json' );
start();
},50);
stop();
} );
test( '2', function() {
var editor = te.obj[0];
var range = te.obj[1];
editor.setContent( '<p ><em>tell</em></p>' );
setTimeout(function(){
range.setStart( editor.body.firstChild.firstChild, 0 ).collapse( 1 ).select();
editor.execCommand( 'justify', 'right' );
equal( editor.queryCommandValue( 'justify' ), 'right', 'querycommand value' );
range.setStart( editor.body.firstChild.firstChild, 0 ).collapse( 1 ).select();
editor.execCommand( 'justify', 'center' );
equal( editor.queryCommandValue( 'justify' ), 'center', 'querycommand value' );
start();
},50);
stop();
} );
```
|
```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()
```
|
"Sparks" is the third single recorded by Barbados-based pop group Cover Drive. The song was released on 29 April 2012 as a digital download in the United Kingdom, taken from their debut album Bajan Style.
Music video
A music video to accompany the release of "Sparks" was first released on YouTube on 16 March 2012 at a total length of three minutes and three seconds.
Critical reception
Lewis Corner of Digital Spy gave the song a positive review stating:
"It's just another night, the boys are getting hype/ But baby in my head, I'm there with you instead," T-Ray bluntly confesses over a clap-happy beat and smooth synths, before Amanda on a wibbly-lipped chorus that will grab your ears and refuse to let go. With a hook more seductive than a heartthrob vampire, we suspect Cover Drive will have the public under their charms once again. .
Track listing
Chart performance
Weekly charts
Year-end charts
Release history
References
2012 singles
Cover Drive songs
Polydor Records singles
Pop ballads
Songs written by Wayne Hector
Songs written by Steve Mac
Song recordings produced by Steve Mac
2011 songs
|
Operation Pig Bristle was an unusual transport task conducted by the Royal Australian Air Force (RAAF) in May 1946. The operation was ordered by the Australian Government in response to a national shortage of paint brushes, which was hindering housebuilding efforts. No. 38 Squadron of the RAAF was given the task of flying 25 tonnes of pig bristles from Chongqing in China to Hong Kong, from where the bristles were shipped to Australia. The operation took place during the Chinese Civil War, with Chongqing cut off and at risk of capture by Communist forces. The squadron completed this task over a two-week period without loss.
Background
Following World War II, the Australian Commonwealth and state governments launched a joint Commonwealth Housing Scheme to address a national shortage of accommodation. This scheme, and private sector housebuilding activities, was delayed by a shortage of materials, including pig bristles needed to manufacture paint brushes.
At the time, the only available source of pig bristles was China. In 1946, the company Jardine Matheson acquired of bristles for the British government and a further for Australia from remote locations in China near the border with Tibet. These stocks were transported to Chongqing, the capital of the Kuomintang government, and Jardine Matheson eventually gained permission to export them to Australia and Britain. This supply of bristles would be sufficient to meet Australia's needs for several months.
As the Chinese Civil War was raging at the time and Communist forces were attacking river boats travelling from Chongqing, it was judged necessary to transport the pig bristles from the city by air. The Kuomintang government agreed to allow RAAF and Royal Air Force aircraft to fly return flights between Hong Kong and Chongqing between 1 and 14 May only. After arriving in Hong Kong, the bristles would be shipped to Australia by sea. Both the Kuomintang government and the Communist forces were concerned about the presence of foreigners in China, and the Australian aircrew were warned that they would be imprisoned if they landed anywhere other than Chongqing or an emergency airstrip at Canton.
Operation
The RAAF's No. 38 Squadron was selected to transport Australia's share of the bristles. This squadron was equipped with Douglas Dakota aircraft, and was responsible at the time for conducting regular flights from Australia to Japan carrying personnel and supplies for the Australian element of the British Commonwealth Occupation Force. A detachment of three Dakotas led by No. 38 Squadron's commanding officer, Squadron Leader John Balfe, was sent from Australia to Hong Kong in preparation for the task. As flying conditions were expected to be difficult, each of these aircraft was manned by two highly experienced pilots as well as another airman who performed the duties of navigator, radio operator and flight engineer.
The flights from Hong Kong to Chongqing began in early May 1946. At this time Chongqing had been isolated by Communist forces, and foreign embassies were being evacuated from the city ahead of its expected occupation by the Communists. No navigation aids were available to guide the Australian aircraft, and their crews had to use inaccurate road maps for navigation during the trips between Chongqing and Hong Kong. The RAAF aircrew found the flights between Hong Kong and Chongqing to be challenging as a result of mountains around the Chinese city, as well as the expected lack of accurate weather forecasts and navigation aids. As the Australian legation was evacuated from Chongqing in early May, the RAAF aircrew slept at the British embassy when they needed to overnight in the city. The detachment was successful in flying out the pig bristles within the two weeks available, with eight return flights being made to Chongqing. In his memoirs Balfe attributed this success to "reasonable weather and everyone's enthusiasm". After completing their task, the three Dakotas left Hong Kong bound for Australia on 14 May.
Delivery
Some of the pig bristles were rushed to Australia on board No. 38 Squadron aircraft, and the remainder were transported from Hong Kong by sea. On 29 May it was reported that the shortage of pig bristles had been overcome. One of the pilots involved in Operation Pig Bristle received the Air Force Cross in the 1948 New Years Honours in recognition of his role in the operation. RAAF official historian Alan Stephens wrote in 1995 that "John Balfe's brief but thrilling account of his team's exotic adventure should be mandatory reading in every RAAF air transport crew room".
References
Citations
Works consulted
History of the Royal Australian Air Force
Pig Bristle
Australia–China relations
Construction industry of Australia
|
Change is a village development committee in the Himalayas of Taplejung District in the Province No. 1 of north-eastern Nepal. At the time of the 2011 Nepal census it had a population of 4034 people living in 861 individual households.
This Village Development Committee (now changed to Gaun Palika, गाँऊ पालिका) is mainly inhabited by Limbu and Mongolian ethnic groups, more specifically Angbuhang, an indigenous tribe. This VDC produces cash crops like oranges, cardamom and tobacco. West/south to North/east orientation of land and south facing slope has provided opportunity to get more sunny hours. Change has the hiking route (now being introduced as a rhododendron hiking trail) Taplejung-Gorja-Basantapur, which passes from the middle along its length.
References
External links
UN map of the municipalities of Taplejung District
Populated places in Taplejung District
|
```batchfile
@echo off
echo Hello from the CMD script!
pause
```
|
Defending champion Joachim Gérard defeated Gordon Reid in the final, 4–6, 6–4, 6–4 to win the men's wheelchair tennis title at the 2016 Wheelchair Tennis Masters.
Seeds
Stéphane Houdet (semifinals, fourth place)
Gordon Reid (final)
Joachim Gérard (champion)
Gustavo Fernández (round robin)
Nicolas Peifer (round robin)
Stefan Olsson (semifinals, third place)
Alfie Hewett (round robin)
Maikel Scheffers (round robin)
Draw
Finals
Group A
Group B
References
External links
Men's singles draw
Masters, 2016
|
```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
```
|
```c
/*
*
*/
#define DT_DRV_COMPAT microchip_mcp9808
#include <errno.h>
#include <zephyr/kernel.h>
#include <zephyr/drivers/i2c.h>
#include <zephyr/init.h>
#include <zephyr/sys/byteorder.h>
#include <zephyr/sys/__assert.h>
#include <zephyr/logging/log.h>
#include "mcp9808.h"
LOG_MODULE_REGISTER(MCP9808, CONFIG_SENSOR_LOG_LEVEL);
int mcp9808_reg_read(const struct device *dev, uint8_t reg, uint16_t *val)
{
const struct mcp9808_config *cfg = dev->config;
int rc = i2c_write_read_dt(&cfg->i2c, ®, sizeof(reg), val,
sizeof(*val));
if (rc == 0) {
*val = sys_be16_to_cpu(*val);
}
return rc;
}
int mcp9808_reg_write_16bit(const struct device *dev, uint8_t reg,
uint16_t val)
{
const struct mcp9808_config *cfg = dev->config;
uint8_t buf[3];
buf[0] = reg;
sys_put_be16(val, &buf[1]);
return i2c_write_dt(&cfg->i2c, buf, sizeof(buf));
}
int mcp9808_reg_write_8bit(const struct device *dev, uint8_t reg,
uint8_t val)
{
const struct mcp9808_config *cfg = dev->config;
uint8_t buf[2] = {
reg,
val,
};
return i2c_write_dt(&cfg->i2c, buf, sizeof(buf));
}
static int mcp9808_set_temperature_resolution(const struct device *dev,
uint8_t resolution)
{
return mcp9808_reg_write_8bit(dev, MCP9808_REG_RESOLUTION, resolution);
}
static int mcp9808_sample_fetch(const struct device *dev,
enum sensor_channel chan)
{
struct mcp9808_data *data = dev->data;
__ASSERT_NO_MSG(chan == SENSOR_CHAN_ALL || chan == SENSOR_CHAN_AMBIENT_TEMP);
return mcp9808_reg_read(dev, MCP9808_REG_TEMP_AMB, &data->reg_val);
}
static int mcp9808_channel_get(const struct device *dev,
enum sensor_channel chan,
struct sensor_value *val)
{
const struct mcp9808_data *data = dev->data;
int temp = mcp9808_temp_signed_from_reg(data->reg_val);
__ASSERT_NO_MSG(chan == SENSOR_CHAN_AMBIENT_TEMP);
if (chan != SENSOR_CHAN_AMBIENT_TEMP) {
return -ENOTSUP;
}
val->val1 = temp / MCP9808_TEMP_SCALE_CEL;
temp -= val->val1 * MCP9808_TEMP_SCALE_CEL;
val->val2 = (temp * 1000000) / MCP9808_TEMP_SCALE_CEL;
return 0;
}
static const struct sensor_driver_api mcp9808_api_funcs = {
.sample_fetch = mcp9808_sample_fetch,
.channel_get = mcp9808_channel_get,
#ifdef CONFIG_MCP9808_TRIGGER
.attr_set = mcp9808_attr_set,
.trigger_set = mcp9808_trigger_set,
#endif /* CONFIG_MCP9808_TRIGGER */
};
int mcp9808_init(const struct device *dev)
{
const struct mcp9808_config *cfg = dev->config;
int rc = 0;
if (!device_is_ready(cfg->i2c.bus)) {
LOG_ERR("Bus device is not ready");
return -ENODEV;
}
rc = mcp9808_set_temperature_resolution(dev, cfg->resolution);
if (rc) {
LOG_ERR("Could not set the resolution of mcp9808 module");
return rc;
}
#ifdef CONFIG_MCP9808_TRIGGER
if (cfg->int_gpio.port) {
rc = mcp9808_setup_interrupt(dev);
}
#endif /* CONFIG_MCP9808_TRIGGER */
return rc;
}
#define MCP9808_DEFINE(inst) \
static struct mcp9808_data mcp9808_data_##inst; \
\
static const struct mcp9808_config mcp9808_config_##inst = { \
.i2c = I2C_DT_SPEC_INST_GET(inst), \
.resolution = DT_INST_PROP(inst, resolution), \
IF_ENABLED(CONFIG_MCP9808_TRIGGER, \
(.int_gpio = GPIO_DT_SPEC_INST_GET_OR(inst, int_gpios, { 0 }),)) \
}; \
\
SENSOR_DEVICE_DT_INST_DEFINE(inst, mcp9808_init, NULL, \
&mcp9808_data_##inst, &mcp9808_config_##inst, POST_KERNEL, \
CONFIG_SENSOR_INIT_PRIORITY, &mcp9808_api_funcs); \
DT_INST_FOREACH_STATUS_OKAY(MCP9808_DEFINE)
```
|
The Blohm & Voss P 203 was a design project for a heavy fighter during World War II. Capable of filling the roles of night fighter, light bomber and ground-attack, it had mixed propulsion, having both piston engine driven propellers and jet engines.
Design
The P 203 was conceived by Blohm & Voss as a multi-role fighter-bomber, using mixed powerplants in an otherwise conventional layout. At that time jet engines could provide a high maximum speed but were unreliable and suffered poor thrust at low speeds, on the other hand conventional propellers provided good thrust at low-to-medium speeds but struggled as speeds increased. By using both kinds of powerplant, excellent performance across the whole speed range could be achieved. The P 203 was to carry two of each.
The fuselage was of broadly conventional layout, having a two-crew cabin at the front, a bomb bay underneath the centre and a conventional tail with remote rear gun barbette.
The mid-mounted wing was straight and of two different, untapered sections. The inboard sections had a deep chord front to back and were thick enough to house the main landing gear. They ended at wing-mounted nacelles which housed the powerplants. BMW 801J radial piston engines at the front drove twin propellers in the ordinary manner, while slung below and behind each of these and faired into the nacelle was a jet engine. Three versions were studied, each having a different type of jet engine; the P 203.01 had Heinkel-Hirth HeS 011A engines, the P 203.02 a Junkers Jumo variant and the P 203.03 a BMW type. Outboard of the nacelles were thinner and shallower, lower-drag outer wing sections.
Besides the tail barbette, additional armament was housed in the nose.
Also unusual for the era was a tricycle undercarriage arrangement, with a nosewheel retracting up beneath the cabin.
Specification (P 203.01)
References
Notes
Bibliography
Cowin, Hugh W.; “Blohm und Voss Projects of World War II,” Part I, Air Pictorial, October 1963, pp. 312-316.
Masters, David; German Jet Genesis, Jane's, 1982, p. 30.
Pohlmann, Hermann. 'Chronik Eines Flugzeugwerkes 1932-1945 (German), 2nd impression, Motorbuch, 1982 (1st edn. 1979), pp. 180-181. .
P 203
Abandoned military aircraft projects of Germany
|
```shell
Using tags for version control
What is stored in a commit?
What is a checksum?
Recover lost code
Perform a dry run
```
|
Love Flight (; Love Flight – ) is a 2015 Thai television series starring Puttichai Kasetsin (Push) and Ungsumalynn Sirapatsakmetha (Pattie).
Directed by Ekkasit Trakulkasemsuk and produced by GMMTV, the series premiered on GMM 25 on 10 October 2015, airing on Saturdays at 18:30 ICT. The series concluded on 31 October 2015.
Cast and characters
Below are the cast of the series:
Main
Puttichai Kasetsin (Push) as Neumake / Make
Ungsumalynn Sirapatsakmetha (Pattie) as Plaifah / Fah
Supporting
Korapat Kirdpan (Nanon) as Ah Pat
Kejmanee Wattanasin as Savitree
Daweerit Chullasapya (Pae)
Warapun Nguitragool as Pongsri
Suporn Sangkaphibal as a grandmother
Sutthipha Kongnawdee (Noon) as Phraeo
References
External links
Love Flight on GMM 25 website
GMMTV
Television series by GMMTV
Thai romance television series
Thai drama television series
2015 Thai television series debuts
2015 Thai television series endings
GMM 25 original programming
|
```smalltalk
// The .NET Foundation licenses this file to you under the MIT license.
namespace Microsoft.NET.TestFramework.Assertions
{
public static partial class FileInfoExtensions
{
private class FileInfoLock : IDisposable
{
private FileStream _fileStream;
public FileInfoLock(FileInfo fileInfo)
{
_fileStream = fileInfo.Open(FileMode.Open, FileAccess.ReadWrite, FileShare.None);
}
public void Dispose()
{
_fileStream.Dispose();
}
}
}
}
```
|
```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 */
```
|
Daniel Bramme (born 3 October 1984) is a Swedish film producer and businessman.
Early life and career
Born in Haninge, Stockholm, Daniel started working with film after graduating from Stockholms Filmskola (Stockholm Film school). Early in his career he mainly worked on music videos in Europe and Scandinavia, later in his career and after working at Swedish Trade Council (Business Sweden) he moved on to being more involved in feature films as a film executive. Daniel is known for working as a bridge between the film industry in the U.S. and Scandinavia, focusing on financing and distribution. In addition to his career as a film executive, he consults for numerous production companies and talks about film politics. Daniel is also known for writing and talking about gender equality in the film industry as well as being involved with animal welfare organizations and recently working with virtual reality and augmented reality productions.
References
External links
1984 births
Living people
Swedish film producers
People from Haninge Municipality
|
```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 */
```
|
The Jordan Brand Classic is a high school All-Star basketball game played annually in April. The game's rosters feature the best and most highly recruited high school boys in the senior class including alumni such as Chris Paul, Carmelo Anthony, Blake Griffin, Kyrie Irving, LeBron James, Kevin Durant, Anthony Davis, Jayson Tatum, and Zion Williamson.
The game takes its name from the chief organizer, Jordan Brand, a division of Nike named after Michael Jordan. The 22 players are routinely selected from the top 100 players as ranked by numerous scouting services.
Jordan Brand previously sponsored the Capital Classic in the Washington, D.C. area, from 2002 to 2004, when it was known as the Jordan Brand Capital Classic. After Michael Jordan was unable to move the game to New York, he started the Jordan Brand Classic.
History
2013
Julius Randle (Dallas, TX/Kentucky) earned co-Most Valuable Player honors as he finished with 19 points and seven rebounds at the 12th annual Jordan Brand Classic. Sharing the co-MVP honors was Jabari Parker (Chicago, IL/Duke), who had 16 points and seven rebounds. The Jordan Brand Classic not only features future stars on the court, but many prominent celebrities such as Michael Jordan, Mark Wahlberg, CC Sabathia, Carmelo Anthony, Amar'e Stoudemire, Fabolous and J. R. Smith were in attendance. In addition to the post-game performance by Drake, the X-Factor Drumline wowed fans during the International Game halftime and Saxophonist Mike Phillips and violinist Lee England, Jr. performed together during the National Game halftime show. Other standouts in the game included Nigel Williams-Goss (Henderson, NV/Washington), who had 17 points for the West team and Andrew Wiggins (Huntington, VA/Kansas) who had 19 points for the East. The event concluded a week of activities around Brooklyn and New York City, including a special movie screening with director Spike Lee at the Brooklyn Academy of Music, an awards dinner at ThreeSixity and a tour of the Gleason's Boxing Gym with Team Jordan athlete Andre Ward.
2012
Shabazz Muhammad (UCLA) earned co-Most Valuable Player honors tonight as he showcased his talents on the National stage, leading the West All-Americans with 20 points and four rebounds. Muhammad was joined by co-MVP Rodney Purvis (UCONN) who shined in his home state of North Carolina leading the East All-Americans with 22 points and three steals. Other statistical standouts included Alex Poythress (Kentucky) with 16 points, Archie Goodwin (Kentucky) with 14 points and four assists, Kaleb Tarczewski (Arizona) with 14 points and 10 rebounds and Tony Parker (UCLA) with 12 rebounds. Sponsored by Jordan Brand, a division of NIKE, Inc., the event was once again attended by some of sport and entertainment's celebrities, including a post game performance by rapper Fabolous. The North Carolina A&T University marching band was featured at halftime and violinist Lee England Jr. performed the National Anthem.
2011
Kentucky-bound Anthony Davis earned co-Most Valuable Player honors tonight, as he finished with 29 points and 11 rebounds and 4 blocks for the West All-Americans who lost to the East All-Americans 113–109 at the 10th anniversary Jordan Brand Classic presented by Foot Locker. Davis was joined by co-MVP James Michael McAdoo (UNC) who had 26 points, 14 rebounds for the East All-Americans. Other statistical standouts in the game included Austin Rivers (Duke) with 16 points, Tony Wroten (Washington) with 10 assists, Bradley Beal (Florida) with 8 rebounds and Khem Birch (Pittsburgh) with 5 blocks. Sponsored by Jordan Brand, a division of NIKE, Inc., the event was attended by celebrities, including North Carolina native J. Cole headlining the post-game performance. In addition, beat maker AraabMuzik was featured at halftime and singer Anthony Hamilton performed the National Anthem.
2010
North Carolina-bound Harrison Barnes earned co-Most Valuable Player honors as he finished with 20 points and 15 rebounds to lead the White Jerseys to the 129–125 victory over the Black Jerseys at the 2010 Jordan Brand Classic at Madison Square Garden in New York City. Harrison Barnes was joined by co-MVP Kyrie Irving (Duke) who had 22 points, seven assists and four rebounds for the Black Jerseys. Other statistical standouts included Josh Selby (Kansas) with 21 points, Cory Joseph (Texas) with seven assists, Tristan Thompson (Texas) with 13 rebounds and Jared Sullinger (Ohio State) with four blocks. A highlight of the evening was college announcements in front of the Madison Square Garden crowd and national ESPN television audience from Josh Selby, who committed to Kansas and New York City native Doron Lamb, who announced that he will be attending Kentucky in the fall. The Jordan Brand Classic saw the participation of various musicians and sports personalities including Chris Paul, Jadakiss, DJ Clue, Mario, MC Lyte,
Lee England, DJ Clark Kent, Skyzoo and Alex Thomas. Multi-platinum recording artist and actor Common headlined the halftime musical performance while R&B artist and songwriter Marsha Ambrosius performed the National Anthem.
2009
Georgia Tech-bound Derrick Favors earned co-Most Valuable Player honors as he finished with 21 points and five rebounds to lead the Black Jerseys to the 110–103 victory over the White Jerseys. Favors was joined by co-MVP Renardo Sidney (Mississippi State) who had 15 points, seven rebounds and two blocks. Other statistical standouts included Wally Judge (Kansas State) with 18 points, John Wall (Kentucky) with six assists, Daniel Orton (Kentucky) with nine rebounds and John Henson (North Carolina) with four blocks. Michael Jordan, CC Sabathia, Spike Lee, Fat Joe, Vince Carter and Kevin Durant attended the game, among others. Grammy nominee recording artist Akon, performed during halftime of the All-American game.
2008
Brandon Jennings (Italy) earned co-Most Valuable Player honors tonight as he finished with 10 points and 14 assists to lead the Blue Jerseys to the 124–114 victory over the White Jerseys in the 2008 Jordan Brand Classic. Jennings was joined by co-MVP Tyreke Evans (Memphis) who had 23 points, seven rebounds and four assists. Jennings’ 14 assists broke the event record previously held by Corey Fisher while his teammates Scotty Hopson (Tennessee) and DeMar DeRozan (USC) contributed 21 and 17 points respectively. The White Jerseys saw solid contributions from Devin Ebanks (West Virginia), who had 20 points and four rebounds and Samardo Samuels (Louisville) who tallied 16 points and five boards. The game saw the attendance of various celebrities, among which Vince Carter, Rudy Gay, Kevin Durant, Ron Harper, Mýa and Michael Jordan. Boyz II Men opened the event singing the national anthem.
2007
Corey Fisher (Villanova) tallied 10 assists to set a new record for the Jordan Brand All-American Classic, presented by Foot Locker and Boost Mobile, as he led his Yellow Jerseys to the 127–119 victory at Madison Square Garden. The Yellow Jerseys also got contributions from Eric Gordon (Indiana), Kyle Singler (Duke) and Austin Freeman (Georgetown) who each had 16 points a piece. Jeff Robinson (Memphis) led the Yellow Jerseys with 17 points. Donté Greene (Syracuse), who also won the dunk contest earlier in the week, led the Royal Jerseys with 20 points to share the MVP award with Fisher. The Royal Jerseys had solid performances from Patrick Patterson (Kentucky) who recorded 12 points and 12 rebounds along with Jerryd Bayless who poured in 17 points and dished out three assists. This year's event was the first high school all-star game to be televised in High Definition, with a live national broadcast on ESPN2.
2006
For the second consecutive year the Jordan Classic was played in New York City at the Madison Square Garden. 10,000 plus people were in attendance. Georgia Tech-bound Thaddeus Young earned co-Most Valuable Player honors as he finished with 28 points and 13 rebounds to lead the White Jerseys to the 108–95 victory over the Black Jerseys. Young was joined by co-MVP Kevin Durant (Texas) who had 16 points, seven rebounds and three blocks. The event was attended by Michael Jordan, LL Cool J, Warren Sapp, Floyd Mayweather, Ahmad Rashad, Al Harrington, Rudy Gay, Fabolous, and Vince Carter. Atlanta-based rapper T.I., who starred in the movie ‘ATL’ and had the No.1 album ‘King’, performed prior to the All-American game. Young helped the White Jerseys take a seven-point first-half lead in a game that was close from the start. His 28 points was the second-highest all-time scoring total behind 34 points from LeBron James in 2003 and Young's 13 rebounds were the fourth-highest mark in game history as well. Another standout performer for the White Jerseys was Sherron Collins (Kansas) with 14 points and six assists. For the Black Jerseys, Durant was joined by the Syracuse recruit tandem of Paul Harris and Mike Jones who each chipped in 16 points. Brandan Wright (North Carolina), Wayne Ellington (North Carolina), Edgar Sosa (Louisville) and DeShawn Sims (Michigan) also each finished in double-figures.
2005
A new home was chosen for the Jordan All-American Classic as the event took center stage at Madison Square Garden in New York City before a crowd that included the likes of Michael Jordan, Spike Lee, Terrell Owens, Vince Carter and a special performance by Fat Joe. In the last year before the NBA restricted players from leaving directly for the NBA, a quarter of the 2005 Jordan All-Americans went from this game directly to the professional ranks. One of those NBA draft picks, Andray Blatche (Washington Wizards), finished off his high school career with a Co-MVP performance of 26 points on 12–17 shooting with 16 rebounds to lead the White Jerseys. Sharing the award was Tyler Hansbrough (North Carolina) who helped his Gray Jerseys to a last-minute 127–126 win with 24 points and nine rebounds. Joining Blatche making the leap to the NBA included C.J. Miles (Utah Jazz), Louis Williams (Philadelphia 76ers), Andrew Bynum (LA Lakers), and Martell Webster (Portland Trail Blazers).
2004
This was the last year that Jordan Brand was the title sponsor of the Capital Classic. The Black Jerseys won with the contribution of the year's No. 1 NBA Draft pick as they defeated the White Jerseys by a score of 107–96 at the Comcast Center on the campus of the University of Maryland. The Black Jerseys, which took the lead at the beginning of the game and never looked back, were led by Dwight Howard (Los Angeles Lakers) of Southwest Atlanta Christian Academy. He was voted the game's MVP with 18 points, 15 rebounds and six blocks. Dorell Wright (Miami Heat) had 24 points and seven rebounds for the White Jerseys in a losing cause. Complementing Howard's dominating performance were Malik Hairston (San Antonio Spurs) who chipped in 23 points and Robert Vaden (Indiana) who added 21 points to lead the Black Jerseys to the win. Al Jefferson (Charlotte Hornets) had 17 points and 10 rebounds and Rajon Rondo (Chicago Bulls) scored 12 points and recorded five assists in the losing effort for the White Jerseys. The Class of 2004 included a number of others who starred during the 2006 NCAA season including National Champion Corey Brewer (Florida), Jordan Farmar (UCLA), Daniel Gibson (Texas), LaMarcus Aldridge (Texas) and Rudy Gay (Connecticut).
2003
The 2003 Jordan Brand Capital Classic was played in front of a sold-out crowd of 18,424 fans at the MCI Center in Washington, DC. The game gave a glimpse at many future NBA players from the start, but the second half belonged to Co-MVP Shannon Brown (Los Angeles Lakers) as he led the Silver Jerseys with 27 points and eight assists. His teammate Chris Paul (Los Angeles Clippers) added 18 points and five assists to go along with a solid defensive effort. Co-MVP LeBron James (Cleveland Cavaliers) finished the game with 34 points and 12 rebounds for the Black Jerseys. Linas Kleiza (Europe) scored 16 points and had 10 rebounds and Kris Humphries (Boston Celtics) contributed 12 points and 12 rebounds to pace the Black Jerseys. The Silver Jerseys outscored their opponents by nine in the second half to prevail 107–102. The event also included musical performances by Bow Wow and Ludacris.
2002
The 2002 Jordan Capital Classic was played at Washington, D.C.'s MCI Center with many players who went on to play in the NBA. The White Jerseys, led by coach Steve Smith of Oak Hill Academy, had Co-MVP's Sean May (Sacramento Kings) and Amar'e Stoudemire (Phoenix Suns) contribute 49 points and 27 rebounds to their victory. In fact, nine of the 12 White Team players scored in double-figures, including Rashad McCants (Minnesota Timberwolves) who went 10-13 from the field for 23 points. For the Red Team, fans saw former Oak Hill teammates Carmelo Anthony (New York Knicks) and Justin Gray (Wake Forest) score 27 and 17 points respectively. Over the next four years, this class would include representation on three National Champions (Anthony, McCants, May and Denham Brown) and numerous NBA lottery picks.
Game results
Alumni
Click Here for a complete listing of Jordan Brand Classic alumni up to 2014.
Year-by-year rosters
2002
RED
Hassan Adams
Carmelo Anthony
Kelenna Azubuike
Dee Brown
Greg Brunner
Justin Gray
Alexander Johnson
Jimmy McKinney
Shavlik Randolph
JJ Redick
Chris Rodgers
Aaron Spears
Bracey Wright
WHITE
Denham Brown
Evan Burns
Travis Garrison
John Gilchrist
Jeff Horner
Andre Iguodala
Jarrett Jack
Sean May
Rashad McCants
Amar'e Stoudemire
Michael Thompson
Kennedy Winston
2003
BLACK
Shagari Alleyne
Gary Ervin
Brandon Foust
Kris Humphries
LeBron James
Linas Kleiza
Drew Lavender
Rodrick Stewart
Von Wafer
SILVER
Shannon Brown
Jermareo Davidson
Ndudi Ebi
J. R. Giddens
Dion Harris
Ekene Ibekwe
Taurean "Tack" Minor
Chris Paul
Courtney Sims
2004
BLACK
Ra'Sean Dickey
Jordan Farmar
Daniel Gibson
Malik Hairston
Dwight Howard
Brian Johnson
Russell Robinson
Isaiah Swann
Robert Vaden
D. J. White
WHITE
LaMarcus Aldridge
Corey Brewer
Joe Crawford
Rudy Gay
Al Jefferson
Sasha Kaun
A. J. Price
Jason Rich
Rajon Rondo
Dorell Wright
2005
GRAY
Andrew Bynum
Devan Downey
Levance Fields
Tyler Hansbrough
C. J. Miles
Kevin Rogers
Magnum Rolle
Lou Williams
Shawne Williams
Julian Wright
WHITE
Andray Blatche
Eric Boateng
Jon Brockman
Keith Brumbaugh
Lewis Clinch
Micah Downs
Richard Hendrix
Emanuel "Tiki" Mayben
Mike Mercer
Martell Webster
2006
BLACK
Demond Carter
Kevin Durant
Paul Harris
Mike Jones
Ty Lawson
Vernon Macklin
Obi Muonelo
Greg Oden
DaJuan Summers
Brandan Wright
Brian Zoubek
WHITE
Sherron Collins
Duke Crews
Wayne Ellington
Spencer Hawes
Curtis Kelly
Jon Kreft
Jon Scheyer
DeShawn Sims
Edgar Sosa
Thaddeus Young
2007
ROYAL
Jerryd Bayless
Donté Greene
Jeffrey Jordan
Kosta Koufos
Kalin Lucas
O. J. Mayo
Patrick Patterson
Chandler Parsons
Durrell Summers
Chris Wright (b. 1989)
YELLOW
Corey Fisher
Austin Freeman
Eric Gordon
Blake Griffin
Gary Johnson
Jai Lucas
Jeff Robinson
Derrick Rose
Kyle Singler
Chris Wright (b. 1988)
2008
AWAY
William Buford
DeMar DeRozan
Drew Gordon
JaMychal Green
Jrue Holiday
Scotty Hopson
Brandon Jennings
Malcolm Lee
Greg Monroe
B. J. Mullens
Wesley Witherspoon
HOME
Al-Farouq Aminu
Ed Davis
Michael Dunigan
Devin Ebanks
Tyreke Evans
Delvon Roe
Samardo Samuels
Iman Shumpert
Kemba Walker
Willie Warren
Tony Woods
2009
BLACK
Kenny Boynton
Avery Bradley
Dominic Cheek
DeMarcus Cousins
Derrick Favors
Abdul Gaddy
Jordan Hamilton
John Henson
Lamont Jones
Alex Oriakhi
Durand Scott
WHITE
Tiny Gallon
Xavier Henry
Marcus Jordan
Wally Judge
Tommy Mason-Griffin
Daniel Orton
Renardo Sidney
John Wall
Royce White
Jamil Wilson
Mouphtaou Yarou
2010
BLUE
Harrison Barnes
Will Barton
Tobias Harris
Terrence Jones
Cory Joseph
Doron Lamb
Kendall Marshall
Josh Selby
Joshua Smith
Tristan Thompson
RED
Reggie Bullock
Kyrie Irving
Perry Jones
Jelan Kendrick
Brandon Knight
C. J. Leslie
Roscoe Smith
Jared Sullinger
Deshaun Thomas
Dion Waiters
2011
BLACK
Bradley Beal
Jabari Brown
Kentavious Caldwell-Pope
Anthony Davis
Myck Kabongo
Johnny O'Bryant
Sir'Dominic Pointer
Otto Porter
Adonis Thomas
Kyle Wiltjer
Tony Wroten
WHITE
Khem Birch
Michael Carter-Williams
Rakeem Christmas
Michael Gbinije
Michael Gilchrist
P. J. Hairston
James Michael McAdoo
Austin Rivers
Shannon Scott
Marquis Teague
2012
EAST
Kyle Anderson
Kris Dunn
Jerami Grant
Gary Harris
Brice Johnson
Ricky Ledo
Nerlens Noel
Tony Parker
Rodney Purvis
Kaleb Tarczewski
JP Tokoto
WEST
Steven Adams
Brandon Ashley
Isaiah Austin
Anthony Bennett
Archie Goodwin
Danuel House
Grant Jerrett
Shabazz Muhammad
Marcus Paige
Alex Poythress
Rasheed Sulaimon
2013
EAST
Tyler Ennis
Aaron Harrison
Andrew Harrison
Kuran Iverson
Rondae Jefferson
Kennedy Meeks
Bobby Portis
Julius Randle
Wayne Selden
Chris Walker
Andrew Wiggins
WEST
Joel Embiid
Aaron Gordon
Kasey Hill
Dakari Johnson
Matt Jones
Marcus Lee
Jabari Parker
Noah Vonleh
Troy Williams
Nigel Williams-Goss
James Young
2014
EAST
Grayson Allen
Joel Berry II
James Blackmon Jr.
Justin Jackson
Tyus Jones
Trey Lyles
Jahlil Okafor
Kelly Oubre
L. J. Peak
Karl-Anthony Towns
Reid Travis
Rashad Vaughn
Isaiah Whitehead
WEST
Shaqquan Aaron
Cliff Alexander
Devin Booker
Kameron Chatman
Daniel Hamilton
Stanley Johnson
Chris McCullough
Emmanuel Mudiay
Theo Pinson
D'Angelo Russell
Myles Turner
Tyler Ulis
Justise Winslow
2015
Source
EAST
Isaiah Briscoe
Jaylen Brown
Jalen Brunson
Thomas Bryant
Jalen Coleman
Eric Davis
Cheick Diallo
Henry Ellenson
Luke Kennard
Skal Labissière
Charles Matthews
Malachi Richardson
Caleb Swanigan
WEST
Dwayne Bacon
Malik Beasley
Antonio Blakeney
Deyonta Davis
Tyler Davis
Tyler Dorsey
Austin Grandstaff
Dedric Lawson
Malik Newman
Ivan Rabb
Ben Simmons
Allonzo Trier
Stephen Zimmerman
2016
Source
EAST
Bam Adebayo
Udoka Azubuike
Tony Bradley
Bruce Brown
De'Aaron Fox
Markelle Fultz
Harry Giles
Alterique Gilbert
Jonathan Isaac
V. J. King
Jayson Tatum
WEST
Miles Bridges
Marques Bolden
Amir Coffey
Wenyen Gabriel
Frank Jackson
Andrew Jones
Malik Monk
Shamorie Ponds
Omari Spellman
Cassius Winston
2017
Source
EAST
Brian Bowen
Wendell Carter Jr.
Trevon Duval
Jalek Felton
Quade Green
Jaren Jackson Jr.
Brandon McCoy
John Petty Jr.
Michael Porter Jr.
Mitchell Robinson
Jarred Vanderbilt
Tremont Waters
WEST
Deandre Ayton
Mo Bamba
Troy Brown Jr.
Matt Coleman III
Kevin Knox II
Billy Preston
Collin Sexton
Nick Richards
Gary Trent Jr.
P. J. Washington
Lonnie Walker
Trae Young
2018
Source
EAST
RJ Barrett
Jalen Carey
Ayo Dosunmu
Quentin Grimes
Tre Jones
Romeo Langford
Andrew Nembhard
Cam Reddish
Anfernee Simons
Jalen Smith
Cole Swider
Emmitt Williams
Zion Williamson
WEST
Darius Bazley
Bol Bol
Darius Garland
Tyler Herro
Jaylen Hoard
Keldon Johnson
Louis King
Nassir Little
Shareef O'Neal
Will Richardson
Simisola Shittu
Javonte Smart
Coby White
2019
Source
BLACK
Cole Anthony
Armando Bacot
Vernon Carey Jr.
Anthony Edwards
Boogie Ellis
Alonzo Gaffney
Trayce Jackson-Davis
Wendell Moore Jr.
Jahmi'us Ramsey
C. J. Walker
Rocket Watts
Romeo Weems
Patrick Williams
WHITE
Keion Brooks Jr.
D. J. Jeffries
Jalen Lecque
Tre Mann
Nico Mannion
Tyrese Maxey
Jaden McDaniels
Cassius Stanley
Isaiah Stewart
Trendon Watford
Kahlil Whitney
Samuell Williamson
James Wiseman
2020
Source
AWAY
Scottie Barnes
Brandon Boston Jr.
Josh Christopher
Sharife Cooper
Cade Cunningham
R. J. Davis
Hunter Dickinson
Andre Jackson
Isaiah Jackson
Caleb Love
Adam Miller
Day'Ron Sharpe
Jalen Suggs
Isaiah Todd
HOME
Jabri Abdur-Rahim
Devin Askew
Jaemyn Brakefield
Nimari Burnett
Terrence Clarke
Jalen Green
Jalen Johnson
Evan Mobley
Micah Peavy
Jeremy Roach
DJ Steward
Cameron Thomas
Mark Williams
Ziaire Williams
2021
Source
Patrick Baldwin Jr.
Paolo Banchero
Tamar Bates
Charles Bediako
Nathan Bittle
Malaki Branham
Kendall Brown
Kobe Bufkin
Kennedy Chandler
Max Christie
Daimion Collins
JD Davison
Moussa Diabaté
Michael Foster Jr.
AJ Griffin
Jaden Hardy
Nolan Hickman
Chet Holmgren
Bryce Hopkins
Caleb Houstan
Trevor Keels
Langston Love
Bryce McGowens
Aminu Mohammed
Efton Reid
Hunter Sallis
Jabari Smith Jr.
TyTy Washington
Peyton Watson
Benny Williams
2022
Source
AWAY
Amari Bailey
Jaden Bradley
Jalen Hood-Schifino
Jett Howard
Vincent Iwuchukwu
Dior Johnson
Dereck Lively II
Dillon Mitchell
Julian Phillips
Malik Reneau
JJ Starling
Dariq Whitehead
Cam Whitmore
HOME
Adem Bona
Skyy Clark
Kam Craft
Kyle Filipowski
Keyonte George
Chris Livingston
Brandon Miller
Tarris Reed
Ty Rodgers
Nick Smith Jr.
Cason Wallace
Jordan Walsh
Kel'el Ware
MVP Awards
References
External links
Jordan Brand Classic website
Official website
List of Alumni
Recurring sporting events established in 2002
2002 establishments in Washington, D.C.
|
```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);
}
}
```
|
```php
<?php
/*
*
* File ini bagian dari:
*
* OpenSID
*
* Sistem informasi desa sumber terbuka untuk memajukan desa
*
* Aplikasi dan source code ini dirilis berdasarkan lisensi GPL V3
*
* Hak Cipta 2009 - 2015 Combine Resource Institution (path_to_url
* Hak Cipta 2016 - 2024 Perkumpulan Desa Digital Terbuka (path_to_url
*
* Dengan ini diberikan izin, secara gratis, kepada siapa pun yang mendapatkan salinan
* dari perangkat lunak ini dan file dokumentasi terkait ("Aplikasi Ini"), untuk diperlakukan
* tanpa batasan, termasuk hak untuk menggunakan, menyalin, mengubah dan/atau mendistribusikan,
* asal tunduk pada syarat berikut:
*
* Pemberitahuan hak cipta di atas dan pemberitahuan izin ini harus disertakan dalam
* setiap salinan atau bagian penting Aplikasi Ini. Barang siapa yang menghapus atau menghilangkan
* pemberitahuan ini melanggar ketentuan lisensi Aplikasi Ini.
*
* PERANGKAT LUNAK INI DISEDIAKAN "SEBAGAIMANA ADANYA", TANPA JAMINAN APA PUN, BAIK TERSURAT MAUPUN
* TERSIRAT. PENULIS ATAU PEMEGANG HAK CIPTA SAMA SEKALI TIDAK BERTANGGUNG JAWAB ATAS KLAIM, KERUSAKAN ATAU
* KEWAJIBAN APAPUN ATAS PENGGUNAAN ATAU LAINNYA TERKAIT APLIKASI INI.
*
* @package OpenSID
* @author Tim Pengembang OpenDesa
* @copyright Hak Cipta 2009 - 2015 Combine Resource Institution (path_to_url
* @copyright Hak Cipta 2016 - 2024 Perkumpulan Desa Digital Terbuka (path_to_url
* @license path_to_url GPL V3
* @link path_to_url
*
*/
use Illuminate\Database\Migrations\Migration;
use Illuminate\Database\Schema\Blueprint;
use Illuminate\Support\Facades\Schema;
return new class () extends Migration {
/**
* Run the migrations.
*
* @return void
*/
public function up()
{
Schema::table('tweb_wil_clusterdesa', static function (Blueprint $table) {
$table->foreign(['config_id'], 'tweb_wil_clusterdesa_config_fk')->references(['id'])->on('config')->onUpdate('CASCADE')->onDelete('CASCADE');
});
}
/**
* Reverse the migrations.
*
* @return void
*/
public function down()
{
Schema::table('tweb_wil_clusterdesa', static function (Blueprint $table) {
$table->dropForeign('tweb_wil_clusterdesa_config_fk');
});
}
};
```
|
```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; }
}
```
|
```c++
// This file was automatically generated on Thu Jun 19 16:26:16 2008
// by libs/config/tools/generate.cpp
// Use, modification and distribution are subject to the
// LICENSE_1_0.txt or copy at path_to_url
// See path_to_url for the most recent version.//
// Revision $Id$
//
// Test file for macro BOOST_NO_CXX11_CONSTEXPR
// This file should not compile, if it does then
// BOOST_NO_CXX11_CONSTEXPR should not be defined.
// See file boost_no_constexpr.ipp for details
// Must not have BOOST_ASSERT_CONFIG set; it defeats
// the objective of this file:
#ifdef BOOST_ASSERT_CONFIG
# undef BOOST_ASSERT_CONFIG
#endif
#include <boost/config.hpp>
#include "test.hpp"
#ifdef BOOST_NO_CXX11_CONSTEXPR
#include "boost_no_constexpr.ipp"
#else
#error "this file should not compile"
#endif
int main( int, char *[] )
{
return boost_no_cxx11_constexpr::test();
}
```
|
```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;
```
|
```javascript
/**
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
'use strict';
// MODULES //
var setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );
var snansumpw = require( './snansumpw.native.js' );
var ndarray = require( './ndarray.native.js' );
// MAIN //
setReadOnly( snansumpw, 'ndarray', ndarray );
// EXPORTS //
module.exports = snansumpw;
```
|
```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;
}
```
|
The Crocodile Hunter: Collision Course is a 2002 adventure comedy film based on the nature documentary television series The Crocodile Hunter. It stars Steve Irwin and his wife Terri Irwin and was directed by frequent Irwin collaborator John Stainton. The film was released in between the fourth and fifth seasons of the series. Collision Course follows Steve and Terri who attempt to save a crocodile from "poachers" not knowing that the two men are actually American Central Intelligence Agency (CIA) agents who are after them because the crocodile in the Irwins' possession has unwittingly swallowed an important satellite tracking beacon.
The film was theatrically released on July 12, 2002 in the U.S. by Metro-Goldwyn-Mayer and internationally by 20th Century Fox. The film earned $33.4 million on a $12 million budget.
Plot
In outer space, a United States-owned satellite blows up and one of the last remaining pieces, a beacon, is sent hurtling towards Earth. The beacon lands in Australia, only to be swallowed by a large crocodile. At the CIA, Agent Buckwhiler and Deputy Director Reynolds reveal that, in the wrong hands, the beacon can change the axis of power in the world, so they send two agents, Robert Wheeler and Vaughn Archer, down to Australia to retrieve the beacon. Department Director Ansell also secretly hires an operative of his own, Jo Buckley, to go and retrieve the beacon before Wheeler and Archer, so Ansell can take Reynolds' job.
In Australia, the crocodile that swallowed the beacon lives in a river next to the house of Brozzie Drewitt, a violent cattle station owner who is planning to kill the beast for preying on her cattle. Because of this, the Department of Fauna and Fisheries send one of its workers, Sam Flynn, to Brozzie's house. Sam attempts to convince Brozzie to hire some professionals to relocate the animal instead, since killing it would be illegal. Despite Flynn's suggestion, Brozzie attempts to kill the crocodile later that night, only to fail.
Meanwhile, the Crocodile Hunter Steve Irwin and his wife Terri are filming an episode of their TV show when they are hired by Flynn to relocate the crocodile that has been bothering Brozzie. After some difficulty, Steve manages to catch the crocodile and successfully gets it in his boat. Wheeler and Archer are nearby using GPS technology to track the beacon. When the two agents see Steve and Terri in their boat with the crocodile (and therefore the beacon) on board, they assume that the Irwins have found the beacon. They inform the CIA, who assume that the Irwins plan to use the beacon to pay for a multimillion-dollar expansion to Australia Zoo. Steve and Terri board up the crocodile in a crate and put it in the back of the truck to drive to a new river system. Wheeler and Archer follow them from behind in a Land Rover, and when Wheeler hops on the top of the Irwins' truck, Steve believes them to be poachers who want to steal the crocodile. Steve climbs up on the roof and, after a brief fistfight, manages to knock Wheeler off the truck.
When the Irwins reach the Thomson River, Steve opens the crocodile's crate and discovers that the beast has defecated. In the poop, Steve sees a shiny metal object (the beacon) which he mistakes to be an improperly discarded children's spinning top toy. Steve and Terri successfully release the crocodile in the river, but Wheeler and Archer show up again in a boat, determined to get the beacon. Jo Buckley shows up in an ultralight and throws sticks of dynamite down on Wheeler and Archer's boat, destroying it and knocking the two agents in the river. Steve believes that he and Terri are caught up in the middle of a "poacher war" and, not wanting the dynamite to hurt the newly relocated crocodile, gets a rope out of the boat and lassoes the aircraft, causing it to crash in the river, though Buckley survives. She swims to shore to inform Ansell via a phone call that she failed to retrieve the beacon. Ansell informs Buckley that he is on the run from the CIA and the police for hiring her for the mission. He is found by police and is arrested for his crimes, ending the phone call.
Due to Wheeler and Archer's failure to retrieve the beacon, the CIA decides that it is time for drastic measures, so they call up American President George W. Bush in the White House to request permission to use military helicopters to find the Irwins and get the beacon. In Australia, Steve is ending his show and playing with the beacon, when the military helicopters arrive.
In the epilogue, Steve explains that he returned the beacon to the CIA without hassle, but remains oblivious to its significance. Brozzie becomes a volunteer for the Department of Fauna and Fisheries, while the CIA punish Wheeler and Archer for their failure by sending them to work at the Irwins' zoo as volunteers. All parties involved have trouble adapting to their new environments, but Steve assures the audience that he will help them.
Cast
Steve Irwin as Himself
Terri Irwin as Herself
Bindi Irwin as Herself (at the end credits as a baby.)
Sui (Steve and Terri's Statffordshire Bull Terrier) as Herself
Magda Szubanski as Brozzie Drewitt
David Wenham as Sam Flynn
Aden Young as Ron Buckwhiler
Steve Bastoni as Deputy Director Reynolds
Lachy Hulme as Robert Wheeler
Kenneth Ransom as Vaughn Archer
Steve Vidler as Department Director Ansell
Kate Beahan as Jo Buckley
Robert Coleby as Dr. Weinberger
Timothy Bottoms as U.S. President George W. Bush
Production
Due to the series' immense popularity, director/producer Stainton had developed an idea for a feature-length Crocodile Hunter film in 1999 while shooting a documentary in Africa. He wanted to make a good film, but, at the same time, make it easy for Steve who was not used to acting, believing that Irwin should only play himself. It was Stainton's idea to film Steve and Terri doing a traditional nature documentary in the Australian Outback and film these scenes in a 1:85 screen ratio. In fact, nothing for the "documentary" scenes were ever scripted, and when the actors (from the scripted dramatic scenes that use a 2:40 screen ratio) entered the Irwins' world for a few brief scenes, Steve (who did not know anything about the script or plot) was informed by Stainton what was about to happen so Irwin could prepare and ad-lib as much as he wanted or needed. Cheyenne Enterprises, a film and television production company owned by Bruce Willis and producer Arnold Rifkin showed interest in producing and helping finance the project. MGM then showed interest in distributing the film worldwide and principal photography began in November 2001, after having filmed the non-scripted documentary segments for well over a year. The Irwins came across hundreds of animals for the filming of the documentary scenes, but only a few, the kangaroo, the perentie, the bird eating spider, and two snakes made it into the film. The animals they encountered were re-written into the script by Holly Goldberg-Sloan for the dramatic scenes when Wheeler and Archer encounter the Irwins' truck.
The film is also known for its "special shoot" teaser trailer, set in the MGM logo, with Steve interacting with Leo the Lion, MGM's mascot.
Film aspect ratios
Collision Course was shot in two film aspect ratios, 1.85:1 for the scenes with Steve and Terri and 2.35:1 for the plot about the Australian farmer and the CIA and their efforts to find the tracking drone. In theaters and on DVD, the 1.85:1 image appears with pillar boxing, a format usually reserved for 1.33:1 ratio content appearing within 1.85:1 or 2.35:1 frames. On the Fullscreen versions, the windowboxing (mostly in the scenes with Steve and Terri and the finale) is not present due to the fullscreen process cropping the widescreen image to the 1.33:1 ratio, causing the windowboxing borders not to be shown, even when shown on a widescreen television if the image is stretched as per fullscreen programs usually are.
Reception
Critical reaction
The film holds a 53% approval rating on Rotten Tomatoes, based on 88 reviews. The site's consensus states: "Aside from the unnecessary plot about a downed US spy satellite, there's not much difference between the movie and the TV show." Roger Ebert gave the film three out of four stars, stating "You see a couple of likable people journeying through the outback, encountering dangerous critters and getting too close for comfort, while lecturing us on their habits and dangers and almost being killed by them." Robert K. Elder of the Chicago Tribune said, "Irwin and his director never come up with an adequate reason why we should pay money for what we can get on television for free." Audiences polled by CinemaScore gave the film an average grade of "B+" on an A+ to F scale.
Box office
The film made $28.4 million at the American box office, with a worldwide gross of $33.4 million, which against the production budget of $12 million, makes the film a considerable box office success.
Accolades
Home media
The Crocodile Hunter: Collision Course was released to VHS and DVD in the United States on December 17, 2002. A soundtrack album was released at a similar time. The movie's soundtrack would later appear on The Crocodile Hunter coin-operated kiddie ride, manufactured by Kiddy Rides Australia, as background audio. The film was released on Blu-Ray Disc on April 25, 2023.
Soundtrack
See also
The Crocodile Hunter
References
External links
2002 films
2002 action comedy films
2002 directorial debut films
2000s spy comedy films
2000s adventure comedy films
Australian action films
Australian comedy films
Self-reflexive films
Films based on television series
Cultural depictions of George W. Bush
Films about crocodilians
Fiction about government
Films about the Central Intelligence Agency
Films set in the United States
Films set in Queensland
Films shot in Australia
20th Century Fox films
Metro-Goldwyn-Mayer films
Animal Logic films
Steve Irwin
2000s English-language films
|
Paremhat 23 - Coptic Calendar - Paremhat 25
The twenty-fourth day of the Coptic month of Paremhat, the seventh month of the Coptic year. In common years, this day corresponds to March 20, of the Julian Calendar, and April 2, of the Gregorian Calendar. This day falls in the Coptic Season of Shemu, the season of the Harvest.
Commemorations
Saints
The departure of Pope Macarius I, the 59th Patriarch of the See of Saint Mark
Other commemorations
The apparition of the Virgin Saint Mary on her Church in Zeitoun
References
Days of the Coptic calendar
|
John Spilsbury (/I.P.A. spɪlsbəri/ 1739 – 3 April 1769) was a British cartographer and engraver. He is credited as the inventor of the jigsaw puzzle. Spilsbury created them for educational purposes, and called them "Dissected Maps".
Life and works
John Spilsbury was the second of three sons of Thomas Spilsbury; the engraver Jonathan Spilsbury was his elder brother, and the two have sometimes been confused. He served as an apprentice to Thomas Jefferys, the Royal Geographer to King George III.
Spilsbury created the first puzzle in 1766 as an educational tool to teach geography. He affixed a world map to wood and carved each country out to create the first puzzle. Sensing a business opportunity, he created puzzles on eight themes - the World, Europe, Asia, Africa, America, England and Wales, Ireland, and Scotland.
Spilsbury married Sarah May of Newmarket, Suffolk in 1761. After his death she ran his business for a period, then married Harry Ashby who had been apprentice to Spilsbury, and who continued to sell puzzles.
References
External links
John Spilsbury at the National Portrait Gallery
Jigsaw puzzle, 1766
1739 births
1769 deaths
18th-century engravers
British engravers
British inventors
English cartographers
Puzzle designers
18th-century cartographers
|
Lineostethus is a genus of stink bugs in the family Pentatomidae. There are at least four described species in Lineostethus.
Species
These four species belong to the genus Lineostethus:
Lineostethus clypealis
Lineostethus clypeatus (Stål, 1862)
Lineostethus marginellus (Stål, 1872)
Lineostethus tenebricornis (Ruckes, 1957)
References
Further reading
Pentatomidae
Articles created by Qbugbot
|
Girl in White Cotton is the debut novel by Avni Doshi, an American writer of Indian origin. Doshi wrote the novel over the course of seven years. It tells the story of a troubled mother-daughter relationship in Pune, India. The novel was first published in India in August 2019. It was published in the United Kingdom under the title Burnt Sugar in July 2020.
The novel was shortlisted for the 2020 Booker Prize.
Background
The novel was written by Doshi over the course of seven years. In 2012, while working as a curator and art writer in Mumbai, Doshi wrote her first draft of the novel in order to meet the deadline for the Tibor Jones South Asia prize for an unpublished manuscript. She won the prize in a unanimous decision by its five judges. She began writing the novel in Pune. Doshi credits a moment while in her grandmother's flat in Pune when a distortion in a mirror warped her reflection, and she saw two different people in her face. The same day, she wrote what would later become the first fragment of the novel. Doshi has said, "The images in my mind were vivid. A mother and a daughter, a woman with a split reflection, a drawing partially erased." She continued her writing of the novel in Mumbai, the United States and the United Arab Emirates, where she started and completed the final draft. Doshi struggled to complete the novel, writing eight different drafts over seven years. The drafts varied drastically and were written with different points of view and voices. Doshi described the process as a "dark and difficult journey" of fighting self-doubt. The novel was partially inspired by her mother's familial connection to the Osho ashram in Pune, created in 1976 by the guru Bhagwan Shree Rajneesh. However, Doshi has stressed that the novel is not autobiographical and that the relationship at its centre is not based on her relationship with her own mother. Doshi was also partly inspired by Sheila Heti's autobiographical novel Motherhood (2018).
Synopsis
In Pune, Antara must care for her ageing mother Tara who is experiencing memory loss from what is suspected to be the early onset of Alzheimer's disease. Tara lived a rebellious and careless life, abandoning her marriage to join an ashram and pursure a romance with a guru. Antara was neglected and abused by her mother as a child. Antara reckons with the contempt she holds for her mother as she is forced to care for her.
"I would be lying if I said my mother's misery has never given me pleasure" is the opening sentence of the novel.
Themes
Doshi described "obsession, memory and the boundaries of the self" as being the novel's main themes. Particularly, how memory is "co-authored" by the people who collectively remember specific stories and continue to restate and rearrange them, altering each other's memories in the process. The theme of the fallibility of memory was partly inspired by Doshi's own grandmother who was diagnosed with Alzheimer's disease while she was writing the novel. Her mother felt she was "going mad" while being with her grandmother. The concept of how caretakers often "question their own hold on reality" influenced Doshi's writing. Doshi admits a parallel between Antara's preoccupation with Alzheimer's and her own, saying, "She makes sense of the disease through drawing it, and I made sense of it through writing this novel."
Publication
The novel was first published under the title Girl in White Cotton in India in 2019. It was acquired by editor Rahul Soni and published in hardcover format by Fourth Estate, an imprint of HarperCollins India, on 25 August 2019. Doshi received offers from three publishers immediately after her literary agent presented the novel for sale. Shortly after its publication, the novel was recommended by Vogue India and was praised by several writers, including Fatima Bhutto, Elizabeth Gilbert, Olivia Sudjic, Tishani Doshi, Janice Pariat, Diksha Basu and Sharlene Teo. On 13 September 2019, British publisher Hamish Hamilton announced it had bought the world English volume, audio and serial rights to the novel and would publish it in summer 2020. On 30 July 2020, the novel was published under the title Burnt Sugar in paperback format in the United Kingdom by Hamish Hamilton. An audiobook narrated by Vineeta Rishi was released by Penguin the same day. Doshi was also interviewed the same day on BBC Radio 4's Front Row programme to coincide the novel's UK publication. The novel was published in the United States by The Overlook Press on 26 January 2021, also under the title Burnt Sugar.
Reception
The novel's opening sentence was singled out and praised by many critics for its strength and for being memorable.
Saudamini Jain of Hindustan Times praised Doshi's characterization in the novel, writing, "Their feelings and resentments — even in alien situations — are uncannily identifiable." Esha Datanwala of Scroll.in gave the novel a rave review, praising its narrative structure and Doshi for knowing "exactly how to make her characters human, how to describe Pune and Bombay to elicit nostalgia, how to cut through the frivolity of modern writers and say exactly what is appropriate." Rohan Manoj of The Hindu agreed, praising Doshi's "crisp prose" and her "powers of observation" regarding human relationships and the "physical reality" of both Pune and Mumbai. Paromita Chakrabarti of The Indian Express called it a "hard, unflinching look at familial bonds and how they damn us and unravel us." Urvashi Bahuguna of India Today praised the novel for revealing "the limited power afforded to women and the price they pay for acting in their own interest."
Francesca Carington of The Daily Telegraph gave the novel a perfect 5 out of 5 stars rating, praising Doshi's "feverish prose" and calling it a "corrosive, compulsive debut." In his review for The Times, John Self called it "a good debut, but by declaring it one of the year's very best novels, the Booker judges might have given it as much a burden as an accolade." Alex Peake-Tomkinson of The Times Literary Supplement praised the rapid changes in tone of Doshi's prose for enlivening the novel but largely criticized it for capitulating to an "urge to shock", calling the novel "needlessly depressing" at times. Elle Hunt of The Guardian called it "an unsettling, sinewy debut, startling in its venom and disarming in its humour from the very first sentence".
Accolades
The novel was shortlisted for the 2020 Booker Prize. Judges of the prize called the novel an "utterly compelling read" that "examines a complex and unusual mother-daughter relationship with honest, unflinching realism – sometimes emotionally wrenching but also cathartic, written with poignancy and memorability."
It was longlisted for the 2019 Tata Literature Live! First Book Award for Fiction.
Adaptations
On November 5, 2021, Variety reported that Indian filmmaker Deepa Mehta, known for her Elements trilogy, would direct a film adaptation of the novel, with Ben Silverman's Propagate Content producing the film. The novel will be adapted by Carmen Nasr.
A theatre adaptation is also in development by The Lot Productions, who acquired the theatre rights and plan the play to premiere in London during their 2023 season.
References
2019 American novels
2019 Indian novels
First-person narrative novels
Fourth Estate books
Literature by Asian-American women
Novels set in Maharashtra
Pune in fiction
|
Alternativa Popular Canaria (APC, ) is a Canarian nationalist leftist party founded in 2002, and part of the Movimiento de Liberación Nacional Canario (MLNC). Its creation was spurred by the youth organisation Azarug and several municipal parties, as well as members of various leftist nationalist parties.
ASAVA, a municipal party which stood for Valsequillo in Gran Canaria, and the leftist independence party Unidad del Pueblo, while not members of APC, have collaborated with that party in certain matters.
History
In the municipal elections of 2003, APC gained a council seat in the municipality of Santa Úrsula (Tenerife). In La Orotava they ran as Iniciativa por La Orotava (IPO) along with Los Verdes de Canarias, obtaining five council seats. In the European Parliament elections of June 2004, APC backed Europa de los Pueblos. The party held its second National Assembly 25–26 June 2005, and its third on 16 September 2006. In 2006 a split within the party in Tenerife produced the offshoot Canarian Nationalist Alternative.
APT participated in the 2007 Canarian Parliament elections, in coalition with the Alternativa Ciudadana 25 de Mayo, but failed to gain any seats. In the 2007 Spanish municipal elections they lost their seat in Santa Úrsula (the local branch having split from the party) but won three seats in La Orotava.
The Cabildo of Tenerife, as well as the municipalities of Santa Cruz de Tenerife, San Cristobal de La Laguna, Granadilla de Abona, Buenavista del Norte and Tacoronte, supported Alternativa Sí Se Puede por Tenerife, a political option into which APC was integrated. In the 2009 European Parliament elections, the APC backed Iniciativa Internacionalista, an extreme-left Spanish coalition.
In its fourth National Assembly, APC decided not to stand in any further elections, remaining instead within the Alternativa Sí Se Puede por Tenerife. Since APC does not condemn the past violent policies of MPAIAC, it is viewed by local rightist parties as one of the groups that seek to minimize terrorism in the Canary Islands.
See also
Canarian nationalism
MPAIAC
References
External links
Socialist parties in Spain
Political parties in the Canary Islands
Regionalist parties in Spain
Canarian nationalist parties
Left-wing nationalist parties
Political parties established in 2002
2002 establishments in Spain
|
Walhain ( ) is an unincorporated community in Kewaunee County, Wisconsin, United States, within the town of Luxemburg. The community is located at the intersection of Walhain Road and Wisconsin Highway 54 about 2 miles west of Luxemburg. It is located at 44.545 latitude and -87.754 longitude at an elevation of above sea level.
The community was named by Florian Streyckman, who settled there in the 1856 and came from Walhain, a municipality in Belgium.
References
Unincorporated communities in Kewaunee County, Wisconsin
Unincorporated communities in Wisconsin
|
The 2019 Indiana Hoosiers baseball team were a college baseball team that represented Indiana University in the 2019 NCAA Division I baseball season. The Hoosiers are members of the Big Ten Conference (B1G) and play their home games at Bart Kaufman Field in Bloomington, Indiana. They were led by first-year head coach Jeff Mercer.
Previous season
The Hoosiers finished the 2018 NCAA Division I baseball season 40–19 overall (14–9 conference) and fifth place in conference standings. Following the conclusion of the regular season, the Hoosiers were selected to play in the 2018 NCAA tournament, beginning in the Austin Regional. The Hoosiers would eventually lose in the final round of the Austin Regional to Texas by a score of 2–3.
MLB draft
The following Hoosiers on the 2018 roster were selected in the 2018 Major League Baseball draft:
* indicates draftee had no more college eligibility
Preseason
On June 25, 2018, Mississippi State confirmed that it had hired Chris Lemonis as their new head baseball coach, formally ending Lemonis' tenure with the Hoosiers. Lemonis compiled a 141–91–2 overall record, 55–37-1 conference record and three NCAA tournament appearances, while head coach of the Hoosiers.
On July 2, 2018, Indiana University Athletics announced the hiring of former Wright State head coach Jeff Mercer, to the head coaching position for the Hoosiers.
On July 18, 2018, Mercer made a notable acquisition to the Hoosiers' coaching staff with the hiring of former-MLB third baseman Scott Rolen as Director of Player Development.
Season projections
Coming off of an NCAA Regional appearance in 2018, the 2019 Hoosiers were projected to finish fourth in conference play by B1G coaches; however, other media outlets predicted the Hoosiers would finish as high as first in the B1G. The Hoosiers were ranked or received votes for rankings in two of the six major preseason polls and rankings. Indiana was ranked #37 in the NCBWA poll and received votes for ranking by Collegiate Baseball.
Roster
Schedule
! style="" | Regular season
|- valign="top"
|- align="center" bgcolor="#bbbbbb"
| || February 15 || at || || FedExPark • Memphis, Tennessee, || Postponed || –
| -|| –
|- align="center" bgcolor="#ccffcc"
| 1 || || at Memphis || || FedExPark • Memphis, Tennessee || 6–1 || 1–0
|374|| –
|- align="center" bgcolor="#ffcccc"
| 2 || || at Memphis || || FedExPark • Memphis, Tennessee || 3–6 || 1–1
|391|| –
|- align="center" bgcolor="#ccffcc"
| 3 || February 17 || at Memphis || || FedExPark • Memphis, Tennessee || 6–0 || 2–1
|407|| –
|- align="center" bgcolor="#ffcccc"
| 4 || February 22 || at Tennessee || || Lindsey Nelson Stadium • Knoxville, Tennessee, || 1–5 || 2–2
|1,068|| –
|- align="center" bgcolor="#ffcccc"
| 5 || February 23 || at Tennessee || || Lindsey Nelson Stadium • Knoxville, Tennessee || 0–11 || 2–3
|981|| –
|- align="center" bgcolor="#ffcccc"
| 6 || February 24 || at Tennessee || || Lindsey Nelson Stadium • Knoxville, Tennessee || 3–5 || 2–4
|1,767|| –
|- align="center" bgcolor="#ccffcc"
| 7 || February 26 || || || Bart Kaufman Field • Bloomington, Indiana || 7–1 || 3–4
|1,171|| –
|- align="center" bgcolor="#ccffcc"
| 8 || February 27 || || || Bart Kaufman Field • Bloomington, Indiana || 9–3 || 4–4
|1,087|| –
|-
|- align="center" bgcolor="#bbbbbb"
| || March 1 || vs || || Conway, South Carolina(Coastal Carolina Tournament) || Postponed || –
| || –
|- align="center" bgcolor="#ccffcc"
| 9 || || vs || || Conway, South Carolina(Coastal Carolina Tournament) || 6–4 || 5–4
|205|| –
|- align="center" bgcolor="#ccffcc"
| 10 || || vs Connecticut || || Conway, South Carolina(Coastal Carolina Tournament) || 9–6 || 6–4
|275|| –
|- align="center" bgcolor="#ffcccc"
| 11 || March 3 || vs No. 11 Coastal Carolina || || Conway, South Carolina(Coastal Carolina Tournament) || 5–6 || 6–5
|1,613|| –
|- align="center" bgcolor="#bbbbbb"
| 12 || March 5 || Indiana State || || Bart Kaufman Field • Bloomington, Indiana || Postponed || –
| || –
|- align="center" bgcolor="#ccffcc"
| 13 || March 8 || vs No. 29 || || T-Mobile Park • Seattle, Washington(Safeco Field Tournament)|| 1–0 || 7–5
|1,250|| –
|- align="center" bgcolor="#ffcccc"
| 14 || March 9 || vs No. 3 Oregon State || || T-Mobile Park • Seattle, Washington(Safeco Field Tournament)|| 3–8 || 7–6
|3,000|| –
|- align="center" bgcolor="#ffcccc"
| 15 || March 10 || vs || || T-Mobile Park • Seattle, Washington(Safeco Field Tournament)|| 3–5 || 7–7
|750|| –
|- align="center" bgcolor="#ffcccc"
| 16 || March 13 || at || || Marge Schott Stadium • Cincinnati, Ohio, || 5–7 || 7–8
|1,063|| –
|- align="center" bgcolor="#ccffcc"
| 17 || March 15 || || || Bart Kaufman Field • Bloomington, Indiana || 18–6 || 8–8
|1,291|| –
|- align="center" bgcolor="#ccffcc"
| 18 || || Canisius || || Bart Kaufman Field • Bloomington, Indiana || 5–2 || 9–8
|1,501|| –
|- align="center" bgcolor="#ccffcc"
| 19 || || Canisius || || Bart Kaufman Field • Bloomington, Indiana || 16–5 || 10–8
|1,501|| –
|- align="center" bgcolor="#ccffcc"
| 20 || March 17 || Canisius || || Bart Kaufman Field • Bloomington, Indiana || 12–1 || 11–8
|1,395|| –
|- align="center" bgcolor="#ccffcc"
| 21 || March 19 || at Indiana State || || Bob Warn Field at Sycamore Stadium • Terre Haute, Indiana || 15–14 || 12–8
|1,108|| –
|- align="center" bgcolor="#ccffcc"
| 22 || March 22 || || || Bart Kaufman Field • Bloomington, Indiana || 3–2 || 13–8
|1,942|| 1–0
|- align="center" bgcolor="#ccffcc"
| 23 || March 23 || Iowa || || Bart Kaufman Field • Bloomington, Indiana || 13–1 || 14–8
|2,271|| 2–0
|- align="center" bgcolor="#ccffcc"
| 24 || March 24 || Iowa || || Bart Kaufman Field • Bloomington, Indiana || 7–1 || 15–8
|1,366|| 3–0
|- align="center" bgcolor="#ffcccc"
| 25 || March 27 || || || Bart Kaufman Field • Bloomington, Indiana || 8–9 || 15–9
|1,827|| 3–0
|- align="center" bgcolor="#ffcccc"
| 26 || March 29 || at Maryland || || Shipley Field • College Park, Maryland || 0–2 || 15–10
|571|| 3–1
|- align="center" bgcolor="#ccffcc"
| 27 || March 30 || at Maryland || || Shipley Field • College Park, Maryland || 20–5 || 16–10
|899|| 4–1
|- align="center" bgcolor="#ccffcc"
| 28 || March 31 || at Maryland || || Shipley Field • College Park, Maryland || 19–4 || 17–10
|534|| 5–1
|-
|- align="center" bgcolor="#ffcccc"
| 29 || April 3 || || || Bart Kaufman Field • Bloomington, Indiana || 4–15 || 17–11
|1,528|| 5–1
|- align="center" bgcolor="#ffcccc"
| 30 || April 5 || || || Bart Kaufman Field • Bloomington, Indiana || 0–3 || 17–12
|1,784|| 5–2
|- align="center" bgcolor="#ccffcc"
| 31 || || Penn State || || Bart Kaufman Field • Bloomington, Indiana || 5–3 || 18–12
|2,969|| 6–2
|- align="center" bgcolor="#ccffcc"
| 32 || || Penn State || || Bart Kaufman Field • Bloomington, Indiana || 3–2 || 19–12
|2,969|| 7–2
|- align="center" bgcolor="#ccffcc"
| 33 || April 10 || Purdue || || Bart Kaufman Field • Bloomington, Indiana || 7–6 || 20–12
|2,664|| 7–2
|- align="center" bgcolor="#ccffcc"
| 34 || April 12 || at || || Charles H. Braun Stadium • Evansville, Indiana || 5–0 || 21–12
|1,367|| 7–2
|- align="center" bgcolor="#ccffcc"
| 35 || || Evansville || || Bart Kaufman Field • Bloomington, Indiana || 5–1 || 22–12
|1,921|| 7–2
|- align="center" bgcolor="#ccffcc"
| 36 || || Evansville || || Bart Kaufman Field • Bloomington, Indiana || 9–3 || 23–12
|1,921|| 7–2
|- align="center" bgcolor="#ccffcc"
| 37 || April 14 || Evansville || || Bart Kaufman Field • Bloomington, Indiana || 6–5 || 24–12
|2,197|| 7–2
|- align="center" bgcolor="#ccffcc"
| 38 || April 16 || || || Bart Kaufman Field • Bloomington, Indiana || 14–3 || 25–12
|1,960|| 7–2
|- align="center" bgcolor="#ccffcc"
| 39 || April 19 || at || || Drayton McLane Baseball Stadium at John H. Kobs Field • East Lansing, Michigan, || 13–4 || 26–12
|1,416|| 8–2
|- align="center" bgcolor="#ffcccc"
| 40 || April 20 || at Michigan State || || Drayton McLane Baseball Stadium at John H. Kobs Field • East Lansing, Michigan || 3–5 || 26–13
|1,836|| 8–3
|- align="center" bgcolor="#ccffcc"
| 41 || April 21 || at Michigan State || || Drayton McLane Baseball Stadium at John H. Kobs Field • East Lansing, Michigan || 11–2 || 27–13
|1,836|| 9–3
|- align="center" bgcolor="#ccffcc"
| 42 || April 23 || vs Ball State|| No. 24 || Victory Field • Indianapolis, Indiana || 9–3 || 28–13
|2,441|| 9–3
|- align="center" bgcolor="#ffcccc"
| 43 || April 26 || || No. 24 || Bart Kaufman Field • Bloomington, Indiana || 3–7 || 28–14
|2,386|| 9–4
|- align="center" bgcolor="#ccffcc"
| 44 || April 27 || Minnesota || No. 24 || Bart Kaufman Field • Bloomington, Indiana || 7–6 || 29–14
|1,888|| 10–4
|- align="center" bgcolor="#ccffcc"
| 45 || April 28 || Minnesota || No. 24 || Bart Kaufman Field • Bloomington, Indiana || 7–1 || 30–14
|2,096|| 11–4
|-
|- align="center" bgcolor="#ffcccc"
| 46 || May 3 || at || No. 23 || Illinois Field • Champaign, Illinois, || 0–4 || 30–15
|2,379|| 11–5
|- align="center" bgcolor="#ffcccc"
| 47 || May 4 || at Illinois || No. 23 || Illinois Field • Champaign, Illinois || 1–3 || 30–16
|2,779|| 11–6
|- align="center" bgcolor="#ccffcc"
| 48 || May 5 || at Illinois || No. 23 || Illinois Field • Champaign, Illinois || 9–2 || 31–16
|2,118|| 12–6
|- align="center" bgcolor="#ffcccc"
| 49 || May 7 || at Kentucky || No. 25 || Cliff Hagan Stadium • Lexington, Kentucky, || 2–5 || 31–17
|3,162|| 12–6
|- align="center" bgcolor="#ccffcc"
| 50 || May 10 || at Michigan || No. 25 || Ray Fisher Stadium • Ann Arbor, Michigan, || 10–4 || 32–17
|1,418|| 13–6
|- align="center" bgcolor="#ccffcc"
| 51 || May 11 || at Michigan || No. 25 || Ray Fisher Stadium • Ann Arbor, Michigan || 10–8 || 33–17
|1,540|| 14–6
|- align="center" bgcolor="#ffcccc"
| 52 || May 12 || at Michigan || No. 25 || Ray Fisher Stadium • Ann Arbor, Michigan || 5–6 || 33–18
|945|| 14–7
|- align="center" bgcolor="#ffcccc"
| 53 || May 14 || Louisville || No. 21 || Bart Kaufman Field • Bloomington, Indiana || 7–8 || 33–19
|2,622|| 14–7
|- align="center" bgcolor="#ccffcc"
| 54 || May 16 || || No. 21 || Bart Kaufman Field • Bloomington, Indiana || 7–5 || 34–19
|1,829|| 15–7
|- align="center" bgcolor="#ccffcc"
| 55 || May 17 || Rutgers || No. 21 || Bart Kaufman Field • Bloomington, Indiana || 11–4 || 35–19
|2,690|| 16–7
|- align="center" bgcolor="#ccffcc"
| 56 || May 18 || Rutgers || No. 21 || Bart Kaufman Field • Bloomington, Indiana || 13–3 || 36–19
|2,673|| 17–7
|-
|-
! style="" | Post-season
|-
|- align="center" bgcolor="#ffcccc"
| 57 || May 22 || Iowa || TD Ameritrade Park • Omaha, Nebraska, || 2–4 || 36–20 || 17–7
|- align="center" bgcolor="#ffcccc"
| 58 || May 23 || Minnesota || TD Ameritrade Park • Omaha, Nebraska || 4–9 || 36–21 || 17–7
|-
|- align="center" bgcolor="#ffcccc"
| 59 || May 31 || Illinois State || Jim Patterson Stadium • Louisville, Kentucky, || 7–8
|1,227|| 36–22
|- align="center" bgcolor="#ccffcc"
| 60 || June 1 || || Jim Patterson Stadium • Louisville, Kentucky || 9–5
|758|| 37–22
|- align="center" bgcolor="#ffcccc"
| 60 || June 2 || Louisville || Jim Patterson Stadium • Louisville, Kentucky || 7–9
|2,339|| 37–23
|-
|-
| style="font-size:88%" | "#" represents ranking. All rankings from Collegiate Baseball on the date of the contest."()" represents postseason seeding in the Big 10 Tournament or NCAA Regional, respectively.
|-
| Schedule Source
Louisville Regional
Ranking movements
Awards and honors
Pre-season awards / Watch list
Regular season awards / Watch lists
Conference awards
Award watch lists
Listed in the order that they were released
See also
2019 Big Ten Conference baseball tournament
2019 NCAA Division I baseball tournament
References
Indiana
Indiana Hoosiers baseball seasons
Indiana
Indiana
Big Ten Conference baseball champion seasons
|
Gymnopilus pratensis is a species of mushroom in the family Hymenogastraceae.
See also
List of Gymnopilus species
External links
Gymnopilus pratensis at Index Fungorum
pratensis
|
Brain Age: Train Your Brain in Minutes a Day!, known as Dr. Kawashima's Brain Training: How Old Is Your Brain? in PAL regions, is an edutainment puzzle video game. It was developed and published by Nintendo for the Nintendo DS. Nintendo has stated that it is an entertainment product inspired by Tohoku University professor Ryuta Kawashima's work in the neurosciences.
It was first released in Japan, and later released in North America, Europe, Australia, and South Korea. It was followed by a sequel titled Brain Age 2: More Training in Minutes a Day!, and was later followed by two redesigns and Brain Age Express for the Nintendo DSi's DSiWare service which uses popular puzzles from these titles as well as several new puzzles, and Brain Age: Concentration Training for Nintendo 3DS. The latest installment in the series, Dr Kawashima's Brain Training for Nintendo Switch, for the Nintendo Switch, was first released in Japan on December 27, 2019.
Brain Age features a variety of puzzles, including Stroop tests, mathematical questions, and Sudoku puzzles, all designed to help keep certain parts of the brain active. It was included in the Touch! Generations series of video games, a series which features games for a more casual gaming audience. Brain Age uses the touch screen and microphone for many puzzles. It has received both commercial and critical success, selling 19.01 million copies worldwide (as of September 30, 2015) and has received multiple awards for its quality and innovation. There has been controversy over the game's scientific effectiveness. The game was later released on the Nintendo eShop for the Wii U in Japan in mid-2014.
Gameplay
Brain Age is designed to be played a little each day, similar to the Nintendogs titles and Animal Crossing: Wild World. The Nintendo DS is held on its side, with the touch screen on the right for right-handed people and the left for left-handed people. The game is entirely touch and voice-controlled – the player either writes the answer to the puzzle on the touch screen or speaks it into the microphone. Before the player can begin a Brain Age session, they must input information. First, players must confirm the date and select which hand they write with. The player then inputs their name and date of birth.
At the end of all Brain Age Check puzzles, Training puzzles, Quick Play puzzles, and Sudoku puzzles, the player is shown how quickly they completed it, the player's speed (according to metaphors such as "bicycle speed" and "jet speed", the highest being "rocket speed"), and a tip for either improving the player's brain or a game-related tip. If the player's time or score in Brain Age Check or Training is high enough, it will appear on one or both of the Top Three. The Top Three shown is the player's own top three attempts at a puzzle, while they can also compare the top three with those of other saved players. The player's score is only counted on their first attempt at a puzzle each day.
The player is also awarded stamps for each day they complete the puzzles. When enough is accumulated, the game unlocks certain features such as more puzzles in Training mode, Hard versions of these puzzles, and the ability to customize the player's own stamps.
While the player is navigating the menus outside of the puzzles, Professor Kawashima appears to prompt and encourage the user. Brain Age allows up to four players to save profiles on one DS game card, and these players can interact with each other in several different ways. There are five modes of play – Brain Age Check, Training, Quick Play, Download, and Sudoku.
When starting a session, Kawashima may ask the player to participate in a Picture-Drawing Quiz, which requires the player to draw a person, place, or thing by memory using the touch screen. After the player has done all three, the game will compare their drawing to an example created by the game developers, along with advice of what to emphasize on below its image. If more than one player profile is saved on the game card, images for the day can be compared to those of other players.
Kawashima may also ask the player to participate in a Memory Quiz, which requires the player to recall a recent event, such as what the player ate or the most interesting thing seen on television the day before. Several days later, it will ask for the answer originally provided, and will then compare the answer given several days ago and the answer given on the current day to test the player's recollection skills. The player is not scored on their ability to remember. The purpose of these tasks is to help the player improve their recollection.
Brain Age Check
The game includes four modes: Brain Age Check, Training, Quick Play, and Sudoku. The Brain Age Check gives the player three puzzle minigames to complete. The first is usually a Stroop test, although the player can choose to skip the Stroop test if they are not in a quiet environment or is otherwise unable to speak into the microphone. At the end of the Brain Age Check, the game reports on the player's "brain age", a theoretical assessment of the age of the player's brain. The higher the brain age, the worse the player performed. The best possible score is 20 and the worst 80, according with Kawashima's theory that the brain stops developing at 20. The player may replay the Brain Age Check, but the brain age is registered per day only.
Once the player confirms whether or not they can speak into the microphone, Professor Kawashima will describe the first puzzle. If the player answered that they can speak, the game begins with a Stroop test; if the player cannot use the microphone, the game picks a random puzzle from the following: Calculations X 20, Word Memory, Connect Maze, and Number Cruncher.
During the Stroop Test, the game will display one of four words and colors: blue, black, yellow, and red. One of these words mentioned will appear on screen, in a random color which may not match the color denoted by the word. The player is instructed to say the color of the word, rather than the word itself (e.g., if the word Yellow appears in blue letters, the correct answer is "blue" according to the Stroop effect for details).
In Speed Counting, which requires speaking but does not use the microphone, the player counts up from one to 120 as fast as they can without slurring the names of numbers.
Word Memory gives the player a list of 30 four-lettered words. The player is given two minutes to study the list and memorize as many words as possible. After the time is up, the player must write down as many words as they can in three minutes. To spell words that were not on the list won't make the player lose marks but the system won't recognize them. On the contrary, spelling an on-list word will count as memorized and even the test will notify the players if they already wrote this word in case they rewrite it.
Connect Maze gives players a randomly created group of circles, with letters and numbers in them. The player must follow the pattern A-1-B-2 until reaching M-13 as quickly as possible.
Calculations × 20 presents the player with 20 simple calculation equations that includes addition, subtraction, and multiplication. On the top screen are the problems which scroll up as answered whether right or wrong, while the touch screen is used to write out the answer. This test is also available in the training section.
Number Cruncher mental agility game that displays several numbers, which vary in their appearance and on-screen behavior and above it is a question, such as "how many numbers are blue?" or "how many numbers are moving?", which the player must answer as quickly as possible.
Training
The Training mode allows the player to play a variety of training programs, with all but one of them being exclusive to the Training mode. Once the player completes at least one program, Kawashima awards them with a stamp, which he places on the current date. If the player completes at least three programs, the stamp will expand in size. After accumulating a certain number of stamps, Kawashima will award the player with a new program, difficulty mode, or additional feature under the Options menu. Each program can be played as many times as the player likes, although only the first play-through of the day will count in the graph for that puzzle.
Minigames
There are nine training programs in Training mode:
Calculations × 20, which is the same as the one found in the Brain Age Check. Mental agility exercise with a total of simple calculation 20 questions that includes addition, subtraction, and multiplication.
Calculations × 100, which is the same as Calculations × 20, although with 100 questions instead of 20. There is a hard mode that includes simple division.
Reading Aloud, which gives the player an excerpt from a classic story such as The Legend of Sleepy Hollow or Little Women, and tasks the player with reading the story aloud or mute to see how quickly they can do it. The player progresses through the excerpt by pushing Next, until they reach the end of the excerpt. If the player pushes Next too quickly, this will be found as cheating, and the program will count the activity as undone.
Low to High: The game instructs to remember several numbers in boxes; those boxes appear with no numbers but at the count of 3, numbers appear only one second. Once gone, the players have to remember the numbers from the lowest to the highest and click the correct box, while failing to order the numbers will count as mistake. Depending on if the player gets right or wrong the number of boxes increase or decrease, meaning that the game has an adaptive difficulty between at least 4 boxes to a maximum of 16.
Syllable Count shows several phrases, one after the other, on the top screen, and the player must write the number of syllables in each phrase on the touch screen.
Head Count features a random number of people on the top screen (e.g. 4). After a few seconds to allow the player to count the number of people, a house falls over them. The player must watch the screen carefully, as the people inside will leave the house and more people will enter the house. This will eventually cease, and the game asks the player to write down how many people are currently in the house. The puzzle gets more difficult as the player progresses in it. There is also a hard mode in which people also come in and out of the chimney.
Triangle Math: A kind of calculations (most of the time addition or subtraction, but sometimes may include sign rules such as -(-3)= 3) in tier format just like Pascal's triangle that the player must solve. This exercise also features a hard mode with an additional tier.
Time Lapse displays two analogue clocks (e.g. one at 2:45 and one at 7:30), and requires the player to calculate the difference in time between those clocks, in that case answer would be 4h 45min.
Voice Calculation, which is similar to the Calculations puzzles. However, this puzzle requires the player to speak the correct answer loud just like the Stroop Test.
Quick Play
Quick Play can be played by anyone, whether they have a saved file or not. Quick Play allows the player to play three modes – Quick Brain Age Check, Quick Training, and Quick Sudoku, all only providing the player with one of the easy puzzles in each of these modes to try. Quick Brain Age Check only allows the player to play the stroop test. In Quick Training, the game only allows the player to play Calculations × 20. In Quick Sudoku, which is only available for North America, Europe and South Korea, the player may only play the easiest Sudoku puzzle available. At the end of each session, the player's brain age or time will be assessed, and Kawashima will give a preview of the full game.
Download
A player with a copy of Brain Age can send certain game data to other Nintendo DS consoles using the DS Download Play feature. They may either download Quick Play mode to this player's Nintendo DS, or Calculations × 30, a variation of the other Calculation puzzles which can be played by up to sixteen people. This mode is not supported in the Wii U Virtual Console version.
Sudoku
Included in the North America, Europe, Australia and Korea versions of this game is a Sudoku mode, which features more than 100 puzzles across three different modes – Beginner, Intermediate, and Advanced. Sudoku involves a 9×9 grid with numbers in every square. Some of these numbers are visible, while others are not. The objective is to fill in the hidden numbers using the visible numbers as hints. Each row, column, and 3×3 grid has nine squares in it, and each must contain each number in the range from 1 to 9.
Scientific effectiveness
Many neurologists recommend the game for prevention of dementia or Alzheimer's disease. Nintendo of America has refused to support any scientific claims to the benefits of the game, stressing that they are in the entertainment business.
One study involved 600 Scottish students with one group of students who played twenty minutes of "Brain Age" before class daily for nine weeks and a control group that studied regularly. The students were tested at the beginning and end of the study. In the end, the group that played Brain Age improved test scores by 50%. The time to complete the tests in the Brain Age group dropped by five minutes, and this improvement doubled that of the control group.
Another study involving 67 ten-year-olds found no evidence to support claims that Brain Age improves cognitive function better than other means of training one's brain. However, the game states that the best indications of brain age are when the user is at least twenty years of age. Professor of cognitive psychology Alain Lieury at the University of Rennes, France said: "The Nintendo DS is a technological jewel. As a game it's fine. But it is charlatanism to claim that it is a scientific test". Helping children with homework, reading, playing Scrabble or Sudoku, or watching documentaries, matched or beat the benefits of Brain Age. The children were split into four groups. The first two completed a seven-week memory course on a Nintendo DS, the third did puzzles with pencils and paper, and the fourth went to school as normal. Researchers found that children playing Brain Age failed to show any significant improvement in memory tests. They did do 19% better in mathematics but so did the pencil-and-paper group, and the fourth group did 18% better. In memorization, the pencil-and-paper group had a 33% improvement, while the Brain Age group performed 17% worse. In logic tests, the Brain Age group had a 10% improvement as did the pencil-and-paper group. The children who had no training improved 20%.
It has also been stated that the same effects of "keeping the brain sharp" can be achieved by either playing Sudoku, Tetris or talking with friends.
A study conducted between March and August 2010 in Sendai city, Miyagi prefecture, Japan, assessed the impact of the brain training game on the elderly, using a double blinded intervention. Results showed that playing Brain Age for 4 weeks could lead to improved cognitive functions (executive functions and processing speed) in the elderly.
Development
Nintendo was looking for something new to develop that would appeal to both traditional and casual gamers. In one of the meetings, the Chief Financial Officer of Nintendo's Japanese division suggested reviewing a published book titled Train Your Brain: 60 Days to a Better Brain, which was enjoying a great deal of success in Japan. Satoru Iwata, the president of Nintendo, arranged for a meeting with Professor Ryuta Kawashima, the author of the book.
As both Iwata and Professor Kawashima were too busy to meet under normal circumstances, they both agreed to meet for an hour during the Nintendo DS launch. The original meeting became a brainstorming session that lasted for three hours, in which Professor Kawashima explained the basics of his studies. Iwata assigned a team of nine developers to develop the game and to have it ready in 90 days for demonstration.
Brain Age's sound director was Masami Yone, while the music was composed by Minako Hamano and Akito Nakatsuka, both having composed music for Nintendo games as early as 1993 and 1987 respectively. The main menu song from this game was later used in Super Smash Bros. Brawl.
Reception
The initial reaction from retailers was that of concern about the new title's ability to sell. The most important retailers in Japan were given the game for 15 minutes to test it out. In the end, Nintendo secured nearly 70,000 orders for the first shipment, an amount above most expectations. In comparison, the sequel had over 850,000 orders placed before its launch.
Brain Age met with positive sales figures. The game debuted selling around 43,000 copies in May 2005, considered a good number for an educational title. Although most titles only stay in the Japanese weekly top ten list of games for a couple of weeks, Brain Age managed to stay, as of January 2006, between the most sold games for 34 weeks (except three weeks). As of June 11, 2006, Brain Age has sold 2,322,970 copies in Japan alone. It was the 94th best-selling game in Japan in 2008, selling 140,992 copies, with total lifetime sales of 3,750,890. During its first three weeks on sale in North America, Brain Age sold 120,000 copies, becoming the fifteenth title in the top U.S. video game charts during the month of May in terms of units sold. In Europe, Brain Age received critical acclaim, becoming number 1 in the Nintendo DS sales chart, and number 4 in the all-platforms chart on debut, and selling more than 500,000 units in just over two months. As of January 22, 2007, Brain Age has sold over 2 million copies in Europe. As of October 30, 2007, Brain Age has sold over one million copies in the United Kingdom. It was the 10th best-selling Nintendo DS game of December 2008 in the United States. As of September 30, 2015, Brain Age has worldwide sales of 19.01 million.
The game was received with generally positive reviews in the Western market, though some criticized the game for poor voice and handwriting recognition at times. The game's design earned it Edge magazine's EIEF06 Edge Award for innovation. In 2007, during the 10th Annual Interactive Achievement Awards, the Academy of Interactive Arts & Sciences awarded Brain Age with "Handheld Game of the Year", along with nominations for "Family Game of the Year", "Outstanding Innovation in Gaming", and "Outstanding Achievement in Game Design". The game has also been featured in numerous media apparitions including newspapers and television in different countries, including the United States (Time magazine and Discovery Channel) and Australia (featured in Seven News). Wired included the game in its list of "The 15 Most Influential Games of the Decade" at No. 5, due to how it "bucked the dominant trends" and "ushered in the era of games that are (supposedly) good for you, like Wii Fit".
International release
The positive sales figures and overall reception in Japan led to Brain Age being released in various countries around the world. In the North American market, the game is known as Brain Age: Train Your Brain in Minutes a Day and was released on April 17, 2006, and included 108 Sudoku puzzles of different levels of difficulty. Nintendo gave out copies of the North American version of Brain Age at the 2006 Game Developers Conference. They also shipped free retail versions to special members of the Nintendo NSider Forums. Both groups received their copies before the official release date. It has also been given away to certain retailers with the purchase of a Nintendo DS Lite.
The game was released as Dr Kawashima's Brain Training: How Old Is Your Brain? in the UK and Ireland. Like the American version, this version also features Sudoku. All 3 parts are saved on one cartridge. In the UK, its initial television commercials featured Chris Tarrant. Nicole Kidman, Ronan Keating, and Patrick Stewart feature in current European commercials for the Brain Age series.
Nintendo Australia featured an ad campaign that coincided with its Australian release. During the period of June 15 to July 17, 2006, Nintendo Australia stated that for every copy of Brain Age purchased, Nintendo would donate $1.00 to Alzheimer's Australia.
The game was one of the launch titles for the DS Lite in South Korea, along with English Training: Have Fun Improving Your Skills!. It was released on January 18, 2007.
See also
Brain Age 2: More Training in Minutes a Day!
Big Brain Academy and Big Brain Academy: Wii Degree
Brain Boost
Brain Challenge
Minna de Kitaeru Zenno Training
Touch! Generations
Neurodegeneration
Brain fitness
Notes
References
Further reading
Interview with the localization team at 1Up.com and Game Informer
Mail interview with professor Ryūta Kawashima
External links
Brain Age website for North America
Brain Training website for UK
2005 video games
Brain Age
Brain training video games
Nintendo DS games
Puzzle video games
Touch! Generations
Video games developed in Japan
Video games scored by Akito Nakatsuka
Virtual Console games for Wii U
Casual games
Sudoku video games
Japan Game Awards' Game of the Year winners
British Academy Games Award for Technical Achievement winners
Multiplayer and single-player video games
|
Abraham Holland (died 18 February 1626) was an English poet. He was the son of the translator, Philemon Holland, and the brother of the printer, Henry Holland. His best known work is the Naumachia, a poem on the Battle of Lepanto in 1571.
Early life and education
Abraham Holland was one of the ten children of the translator Philemon Holland and his wife, Anne Bott (1555–1627), the daughter of William Bott (alias Peyton) of Perry Hall, Handsworth, Staffordshire. Holland was a grandson of the Marian exile, John Holland (died 1578), rector of Great Dunmow, Essex. Holland had six brothers and three sisters, including the printer Henry Holland, the print publisher Compton Holland (died 1622), William Holland (1592–1632), a surgeon whose treatise on gout, Gutta Podagrica, was published posthumously in 1633, and Elizabeth Holland, who married a London merchant, William Angell.
Holland was educated like his father at Trinity College, Cambridge, graduating BA in 1617.
Career
Holland's first published work was a Latin elegy on John Harington, 2nd Baron Harington of Exton, who had died on 27 February 1614. The elegy was included in Heroologia Anglica, a two-volume illustrated work in folio printed in 1620 by Holland's brother, Henry Holland.
In 1622 Holland published in quarto a long poem describing the 1571 Battle of Lepanto entitled Naumachia; or, Holland's sea-fight. The volume contained commendatory verses by Michael Drayton, among others, and was dedicated to George Gordon, then Earl of Enzie, son and heir to George Gordon, 1st Marquess of Huntly, and a favourite of King James, who had him educated with his own sons, Prince Henry and Prince Charles. According to Cummings, the poem is written in 'the overblown manner associated with Lucan'.
Another poem by Holland, the satirical A continued just inquisition against paper persecutors, was appended to A Scourge for Paper-Persecutors (1625). The latter was a reprint by Holland's brother, Henry, of John Davies of Hereford's Scourge of Folly of 1611.
Death and legacy
Holland died of the plague on 18 February 1626, perhaps at Chelsea, where he appears to have lived for a time. Following his death his brother Henry published a collection of his poems, entitling it Hollandi Posthuma. Included in it were an elegy on King James, an elegy on Henry de Vere, 18th Earl of Oxford, a lengthy poem on the 1625 plague in London, an epistle to his father, Philemon Holland, who was in ill health at the time, as well as various epistles, translations of the Psalms in verse, and his own epitaph. The collection was described as having been delivered to Henry on the day of Abraham Holland's death.
Some of Holland's poems were reprinted in the years following his death. The Naumachia was reprinted in some copies of the Posthuma, and in some copies of his father Philemon Holland's translation of Xenophon's Cyropaedia printed in 1632. Holland's 1625 poem on the plague from the Posthuma, under a new title, London Looke-Backe, was appended to Salomon's Pest-House or Towre-Royall...By I. D. (1630).
Ashmole MS 36–7 f. 157 contains a poem by Holland addressed 'To my honest father, Mr. Michael Drayton, and my new, yet loved friend, Mr. Will. Browne'.
Notes
References
External links
Naumachia; or, Holland's sea-fight (London: Printed by T. P. for T. Law and W. Garrat, 1622), British Library copy Retrieved 17 March 2013
A continued just inquisition against paper persecutors. By A. H. (1625) British Library copy Retrieved 17 March 2013
Hollandi Post-huma; a funerall elegie of King James with a congratulatory salve to King Charles. An elegie of ... Henry Earle of Oxford. A description of the late ... plague: and divers other ... poemes. (Unto these Post-humes is added: Naumachia, or a poeticall description of the ... Battaile of Lepanto ... revised, etc.) (Catabrigiae: Impensis Henrici Holland, 1626) British Library copy Retrieved 17 March 2013
Heroologia Anglica hoc est clarissimorum et doctissimorum. aliqout (sic) Anglorum, qui floruerunt ab anno Cristi. M.D. vsque ad presentem annum M.D.C.XX viuae effigies vitae et elogia: duobus tomis. Authore. H.H. Anglo-Britanno: impensis Crispini, British Library copy Retrieved 17 March 2013
Totaro, Rebecca Totaro, The Plague Epic in Early Modern England: Heroic Measures 1603-1721, (Farnham, Surrey: Ashgate Publishing, 2012) Retrieved 17 March 2013
1626 deaths
Writers from Coventry
Alumni of Trinity College, Cambridge
17th-century deaths from plague (disease)
Date of birth unknown
17th-century English poets
17th-century English male writers
English male poets
|
Salix serissaefolia is a putative species of willow native to central Japan. It is known as コゴメヤナギ in Japanese. It was described by Kimura in Bot. Mag. Tokyo 40: 639 (1926). H.Ohashi synonymized it as Salix jessoesis subsp. serissaefolia (Kimura) H. Ohashi, comb. nov., in A Systematic Enumeration of Japanese Salix (Salicaceae), Hiroyoshi OHASHI 植物研究雑誌 J. Jpn. Bot. 75: 1-4 1 (2000). Note the typographical error for Salix jessoensis. Salix jessoensis is a synonym of Salix pierotii, as is Salix serissifolia. Note the spelling difference between Salix serissaefolia and Salix serissifolia.
It is a deciduous tree, reaching a height of 10–25 m.
References
serissaefolia
|
Scytale may refer to:
Scytale, an encryption tool used to perform a transposition cipher.
Scytale (Dune), a fictional character in the Dune universe created by Frank Herbert.
A taxonomic synonym for Agkistrodon, a genus of venomous pitvipers found in North America from the United States as far south as northern Costa Rica.
|
```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();
}
}
```
|
```objective-c
#ifndef HEADER_CURL_FILEINFO_H
#define HEADER_CURL_FILEINFO_H
/***************************************************************************
* _ _ ____ _
* Project ___| | | | _ \| |
* / __| | | | |_) | |
* | (__| |_| | _ <| |___
* \___|\___/|_| \_\_____|
*
*
* This software is licensed as described in the file COPYING, which
* you should have received as part of this distribution. The terms
* are also available at path_to_url
*
* You may opt to use, copy, modify, merge, publish, distribute and/or sell
* copies of the Software, and permit persons to whom the Software is
* furnished to do so, under the terms of the COPYING file.
*
* This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
* KIND, either express or implied.
*
***************************************************************************/
#include <curl/curl.h>
#include "llist.h"
struct fileinfo {
struct curl_fileinfo info;
struct curl_llist_element list;
};
struct fileinfo *Curl_fileinfo_alloc(void);
void Curl_fileinfo_cleanup(struct fileinfo *finfo);
#endif /* HEADER_CURL_FILEINFO_H */
```
|
Spiezio is a surname. Notable people with the surname include:
Ed Spiezio (born 1941), American baseball player
Scott Spiezio (born 1972), American baseball player
|
```objective-c
/*
Simple DirectMedia Layer
This software is provided 'as-is', without any express or implied
warranty. In no event will the authors be held liable for any damages
arising from the use of this software.
Permission is granted to anyone to use this software for any purpose,
including commercial applications, and to alter it and redistribute it
freely, subject to the following restrictions:
1. The origin of this software must not be misrepresented; you must not
claim that you wrote the original software. If you use this software
in a product, an acknowledgment in the product documentation would be
appreciated but is not required.
2. Altered source versions must be plainly marked as such, and must not be
misrepresented as being the original software.
3. This notice may not be removed or altered from any source distribution.
*/
#include "../SDL_internal.h"
#ifndef _SDL_shape_internals_h
#define _SDL_shape_internals_h
#include "SDL_rect.h"
#include "SDL_shape.h"
#include "SDL_surface.h"
#include "begin_code.h"
/* Set up for C function definitions, even when using C++ */
#ifdef __cplusplus
/* *INDENT-OFF* */
extern "C" {
/* *INDENT-ON* */
#endif
typedef struct {
struct SDL_ShapeTree *upleft,*upright,*downleft,*downright;
} SDL_QuadTreeChildren;
typedef union {
SDL_QuadTreeChildren children;
SDL_Rect shape;
} SDL_ShapeUnion;
typedef enum { QuadShape,TransparentShape,OpaqueShape } SDL_ShapeKind;
typedef struct {
SDL_ShapeKind kind;
SDL_ShapeUnion data;
} SDL_ShapeTree;
typedef void(*SDL_TraversalFunction)(SDL_ShapeTree*,void*);
extern void SDL_CalculateShapeBitmap(SDL_WindowShapeMode mode,SDL_Surface *shape,Uint8* bitmap,Uint8 ppb);
extern SDL_ShapeTree* SDL_CalculateShapeTree(SDL_WindowShapeMode mode,SDL_Surface* shape);
extern void SDL_TraverseShapeTree(SDL_ShapeTree *tree,SDL_TraversalFunction function,void* closure);
extern void SDL_FreeShapeTree(SDL_ShapeTree** shape_tree);
/* Ends C function definitions when using C++ */
#ifdef __cplusplus
/* *INDENT-OFF* */
}
/* *INDENT-ON* */
#endif
#include "close_code.h"
#endif
```
|
Urszula Kołaczkowska (4 October 1911 - 29 December 2009) was a Polish fine artist who specialized in hand weaving and textile arts.
Biography
She was the daughter of Zofia née Słonczyńska (1872–1953) and Edward Kołaczkowski (born on 18 November 1849 in Suchodoły, died on 12 August 1933 in Lublin), a landowner, citizen of Lublin city, member of the Lublin City Council and Mayor of Lublin in 1915.
In 1915, Zofia moved with her daughter to Zakopane, where she provided Urszula with her early education at home. Urszula later attended Ładysław of Gielniowo High School, a private school situated on Nowotarska St. in Zakopane, from 1924 to 1931.
Between 1931 and 1937, Kołaczkowska studied history at the University of Warsaw. Her master's thesis was on “Territorial Development of Warsaw around the Lubomirski Embankment”, written under the supervision of professor Stanisław Arnold, and in October 1937, she was awarded a master's degree in history. While studying history, she started a course at the School for Journalists in Warsaw, where she earned a diploma after presenting her thesis "The French press during the Great Revolution". Between 1938 and 1939, Kołaczkowska worked as a head of the sports column at Bluszcz (Ivy), a weekly magazine for women. She spent the Second World War and the occupation in Zakopane. Between 1947 and 1948, she attended Podhale State Industrial School for Females in Zakopane, where she learned to weave. She completed her studies with a master's exam in the art of weaving and wall-hanging art in June 1948.
In 1952, Kołaczkowska was admitted to the Association of Polish Artists and Designers. In the same year she had her first exhibition at the first Country-Wide Exhibition of Interior Design and Decorative Art at the Zachęta Art Gallery in Warsaw during May, June and July. Between 1952 and 2004, her works were shown at several dozen national and international exhibitions. In 1960, Kołaczkowska had her first individual exhibition at the Tatra Museum in Zakopane.
Artistic activity
Kołaczkowska was principally a hand weaver who used various material (wool, sisal, flax, hemp, nylon, steel, wood, etc.) and her own, original weaving techniques. Throughout her creative life, she introduced new forms and themes inspired by a mix of Polish and biblical influences: mountains, nature, architecture, fiction, everyday life, history and the ancient times, etc. Her art was not limited to weaving, but also extended into drawing and painting and eventually on to glass and collages. Her works were well praised and held in high esteem. She was awarded, among others, the Nowy Sącz Governor award in 1991 and the Agnieszka Stankiewicz Award in 1998.
Kołaczkowska remained active, working and creating, until old age. Her works can be found among numerous public collections (i.e. the National Museum, Warsaw, Central Museum of Textiles, Łódź, The Tatra Museum in Zakopane, Craft Museum in Krosno) as well as private ones, both in Poland and abroad. Kołaczkowska authored the book ‘500 Questions about the History of Art’ (Warsaw) issued in Polish in 1962, with several later editions. She also dabbled in writing fiction, resulting in a crime novel „Symphonic Etude” [Polish „Etiuda Symfoniczna”] written in the 1960s but published only in 2011. She returned to writing at the end of her life, leaving behind an unfinished crime novel manuscript.
Until well into her elderly age, she was a keen hiker and cross-country skier. She remained a celebrity in Zakopane, not only among the artistic circles. Short and slightly built, she was full of life and humour. The last years of Kołaczkowska's life were recorded by the photographer Anna Łodziak. In 2006, her pictures were presented in the Municipal Art Gallery in Zakopane (former Art Exhibitions Bureau Gallery). Urszula Kołaczkowska was laid to rest next to her mother in a new cemetery on Nowotarska St. in Zakopane.
Bibliography
Archiwum Uniwersytetu Warszawskiego w Warszawie, Album Studentów nr 37657.
Urszula Kołaczkowska. ’’500 zagadek z historii sztuki’’, Ed. Wydawnictwo: Wiedza Powszechna, 1962 and later editions.
Tadeusz Z. Epsztein. ’’Historia mojej rodziny’’, in:’’Społeczeństwo polskie XVIII i XIX wieku’’, red. J. Leskiewiczowa, t. IX, Warszawa 1991, p. 261-346.
M. Gutowski.’’Gobeliny i rysunki Kołaczkowskiej’’, in: „Dziennik Polski” from 31.10 to 1.11.1965 r., p. 5.
„Gazeta Wyborcza” (dodatek „Gazeta Stołeczna”) z 20–21.07.1996, s. 16.
Urszula Kołaczkowska.’’Kuchnia i okolice: tkanina’’, exhibition catalogue at Galeria Kordegarda Warszawa, Krakowskie Przedmieście 15/17, Warszawa 2000, July–August 2000.
„Gazeta Krakowska”, 6.04.2000, p. 5.
G. Mróz,’’Tkane obrazy’’, in: „Tygodnik Podhalański”, 16.04.2000, p. 13.
’’Urszula Kołaczkowska: tkanina’’: April–May 2003 [exhibition at Centralne Muzeum Włókiennictwa], Łódź 2003.
Urszula Kołaczkowska, ’’Etiuda symfoniczna’’, Ed. Wydawnictwo Cursor, Warszawa 2011,
Tadeusz Epsztein,’’Wrona Zakopiańska’’. Ed. Wydawnictwo Adam, Warszawa, 2012
J. Flach,’’Kobieta renesansu’’, in: "Tygodnik Podhalański", 6.06.2012, p. 32
’’Urszula Kołaczkowska - Tkanina, Tapestry’’. Municipal Art Gallery, Zakopane, 2012.
References
External links
Urszula Kołaczkowska - Tkanina, Tapestry
Museums
Urszula Kolaczkowska at Municipal Art Gallery, Zakopane
Works
ARTNET
MUTUALART
DESA
See also
List of Polish artists
1911 births
2009 deaths
20th-century Polish women artists
21st-century Polish women artists
21st-century Polish artists
20th-century women textile artists
20th-century textile artists
21st-century women textile artists
21st-century textile artists
Artists from Lublin
|
```shell
#!/bin/bash
i=0; for file in `ls`; do mkdir output/${i}; echo "unzip $file -d output/${i}";unzip -P abc $file -d output/${i} > /dev/null; ((i++)); done
i=0; for file in `ls`; do mkdir output/${i}; echo "${i} unrar x $file output/${i}";unrar x $file output/${i} > /dev/null; ((i++)); done
```
|
Percy Frobisher Pilbeam is a fictional character in the works of P. G. Wodehouse. A journalist turned detective, he is a rather weak and unpleasant man, generally disliked by all. He appears in several novels, but is perhaps best known for his involvement with the denizens of Blandings Castle, in Summer Lightning (1929) and Heavy Weather (1933).
Character
Pilbeam is a rather slimy-looking man, with shiny black hair in a marcelled wave, eyes a little too close together, pimples and a shabby-looking moustache (which is occasionally described as "fungoid"). He has a tendency to dress in rather loud check suits, and a taste for pretty girls. He has an efficient and practical mind, full of pep and vigour.
A member of the "Junior Constitutional Club", and an F.R.Z.S., Pilbeam is also a keen motorcyclist. His taste for girls is clear in his approval of Miss "Flick" Sheridan, and his adoration and pursuit of Sue Brown (which enrages Ronnie Fish to the extent of running amok and destroying a restaurant).
Pilbeam has a paralysing fear of pigs, having read once that a pig, on finding a stranger in its sty, will go for him like a tiger and tear him to ribbons. He has a fondness for champagne, a drink he finds highly useful in priming himself for tense meetings with the nobility.
Appearances
Bill the Conqueror (1924) - in which Lord Tilbury first employs him as a snoop
Sam the Sudden (1925) (U.S. title: Sam in the Suburbs) - in which he is mentioned only in passing
Summer Lightning (1929) (US title: Fish Preferred) - in which he visits Blandings Castle
Heavy Weather (1933) - in which he is still at Blandings
Something Fishy (1957) (US title: The Butler Did It) - in which his agency is again employed
Frozen Assets (US title: Biffen's Millions) (1964)- in which he is re-employed by Lord Tilbury.
Career
Pilbeam is introduced in Bill the Conqueror, at which time he is deputy to Roderick Pyke as editor of Society Spice, but considered a far more capable and trustworthy man by Roderick's father, Lord Tilbury, head of the Mammoth Publishing Company. Tilbury trusts Pilbeam with many a delicate task, and is rarely disappointed by the young man's work.
After Roderick leaves his father's employ, Pilbeam takes over as head of Society Spice, in which position we hear of him in passing in Sam the Sudden. He spends some three years there, during which he incurs the wrath of Galahad Threepwood. He leaves his job, much to Lord Tilbury's indignation, to found the Argus Detective Agency, which he runs from offices in an alley off Beeston Street, in South-West London, telegraphic address "Pilgus Piccy".
He was hired, in the early days of the organisation, to retrieve some compromising letters for Sir Gregory Parsloe-Parsloe, a task he achieved by impersonating a man come to read the gas meter and breaking into a safe. We hear about this later, in Summer Lightning, when Parsloe-Parsloe hires him once more to steal Galahad Threepwood's scandalous book of reminiscences, just after Lord Emsworth has called him in to investigate the disappearance of his prize pig, Empress of Blandings, and Millicent Threepwood has had him tail her fiancé Hugo Carmody.
His time at Blandings Castle is somewhat tense, with Carmody, Galahad and Ronnie Fish holding grudges against him, and he feels entirely out of place and uncomfortable amongst the well-bred, well-dressed Threepwood family and their friends. However, he remains there into the events of Heavy Weather, when he is once again asked to steal Galahad's book by Parsloe-Parsloe. For a time he has hopes of making a large sum of money from the book, but his hopes are dashed; however, he does get well rewarded, when he agrees to employ Monty Bodkin in his detective agency.
He reappears in Something Fishy, published some 24 years later.
Television
In a 1995 adaptation of Heavy Weather, made by the BBC and partners and broadcast in the United States by PBS, Pilbeam was played by David Bamber.
External links
Percy Pilbeam page at the Thrilling Detective Web Site
P. G. Wodehouse characters
Literary characters introduced in 1924
|
Damrau is a surname. Notable people with the surname include:
Diana Damrau (born 1971), German opera singer
Harry Damrau (1890–1957), American baseball player
|
```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')
}
```
|
The Agnew Hunter Bahnson House is a historic house located at Winston-Salem, Forsyth County, North Carolina.
Description and history
It was designed by architect Willard C. Northup and built in 1920. It is a large two-story, asymmetrical, stuccoed English Cottage style dwelling with a Colonial Revival interior. It has a cross-gable roof with a hipped roof over a long wing. It was built by Agnew Hunter Bahnson, one of Winston-Salem's most prominent industrialists.
It was listed on the National Register of Historic Places on April 12, 2001.
References
Houses on the National Register of Historic Places in North Carolina
Colonial Revival architecture in North Carolina
Houses completed in 1920
Houses in Winston-Salem, North Carolina
National Register of Historic Places in Winston-Salem, North Carolina
|
```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);
}
```
|
Acxiom may refer to:
LiveRamp, a company founded in 1969 that traded as Acxiom Corporation from 1988 to 2018
Acxiom, a division and brand of Interpublic Group of Companies, spun out from LiveRamp in 2018
Acxiom may also refer to:
The Hymn of Acxiom, a musical recording on the Vienna Teng album Aims
|
```python
import functools
import logging
import operator
import traceback
import warnings
from copy import deepcopy
from importlib.metadata import version
import numpy as np
import pymc as pm
import pytensor.tensor as pt
import xarray as xr
from pymc.backends.arviz import coords_and_dims_for_inferencedata, find_observations
from pymc.util import get_default_varnames
from pytensor.tensor.special import softmax
from bambi.backend.inference_methods import inference_methods
from bambi.backend.links import cloglog, identity, inverse_squared, logit, probit, arctan_2
from bambi.backend.model_components import (
ConstantComponent,
DistributionalComponent,
ResponseComponent,
)
from bambi.utils import get_aliased_name
_log = logging.getLogger("bambi")
__version__ = version("bambi")
class PyMCModel:
"""PyMC model-fitting backend."""
INVLINKS = {
"cloglog": cloglog,
"identity": identity,
"inverse_squared": inverse_squared,
"inverse": pt.reciprocal,
"log": pt.exp,
"logit": logit,
"probit": probit,
"tan_2": arctan_2,
"softmax": functools.partial(softmax, axis=-1),
}
def __init__(self):
self.name = pm.__name__
self.version = pm.__version__
self.vi_approx = None
self.fit = False
self.model = None
self.spec = None
self.components = {}
self.response_component = None
self.bayeux_methods = inference_methods.names["bayeux"]
self.pymc_methods = inference_methods.names["pymc"]
def build(self, spec):
"""Compile the PyMC model from an abstract model specification.
Parameters
----------
spec : bambi.Model
A Bambi `Model` instance containing the abstract specification of the model to compile.
"""
self.model = pm.Model()
self.components = {}
for name, values in spec.response_component.term.coords.items():
if name not in self.model.coords:
self.model.add_coords({name: values})
with self.model:
# Add constant components
for name, component in spec.constant_components.items():
self.components[name] = ConstantComponent(component)
self.components[name].build(self, spec)
# Add distributional components
for name, component in spec.distributional_components.items():
self.components[name] = DistributionalComponent(component)
self.components[name].build(self, spec)
# Add response
self.response_component = ResponseComponent(spec.response_component)
self.response_component.build(self, spec)
# Add potentials
self.build_potentials(spec)
self.spec = spec
def run(
self,
draws=1000,
tune=1000,
discard_tuned_samples=True,
omit_offsets=True,
include_response_params=False,
inference_method="mcmc",
init="auto",
n_init=50000,
chains=None,
cores=None,
random_seed=None,
**kwargs,
):
"""Run PyMC sampler."""
inference_method = inference_method.lower()
if inference_method == "nuts_numpyro":
inference_method = "numpyro_nuts"
warnings.warn(
"'nuts_numpyro' has been replaced by 'numpyro_nuts' and will be "
"removed in a future release",
category=FutureWarning,
)
elif inference_method == "nuts_blackjax":
inference_method = "blackjax_nuts"
warnings.warn(
"'nuts_blackjax' has been replaced by 'blackjax_nuts' and will "
"be removed in a future release",
category=FutureWarning,
)
# NOTE: Methods return different types of objects (idata, approximation, and dictionary)
if inference_method in (self.pymc_methods["mcmc"] + self.bayeux_methods["mcmc"]):
result = self._run_mcmc(
draws,
tune,
discard_tuned_samples,
omit_offsets,
include_response_params,
init,
n_init,
chains,
cores,
random_seed,
inference_method,
**kwargs,
)
elif inference_method in self.pymc_methods["vi"]:
result = self._run_vi(**kwargs)
elif inference_method == "laplace":
result = self._run_laplace(draws, omit_offsets, include_response_params)
else:
raise NotImplementedError(f"'{inference_method}' method has not been implemented")
self.fit = True
return result
def build_potentials(self, spec):
"""Add potentials to the PyMC model.
Potentials are arbitrary quantities that are added to the model log likelihood.
See 'Factor Potentials' in
path_to_url
Parameters
----------
spec : bambi.Model
The model.
"""
if spec.potentials is not None:
count = 0
for variable, constraint in spec.potentials:
if isinstance(variable, (list, tuple)):
lambda_args = [self.model[var] for var in variable]
potential = constraint(*lambda_args)
else:
potential = constraint(self.model[variable])
pm.Potential(f"pot_{count}", potential)
count += 1
def _run_mcmc(
self,
draws=1000,
tune=1000,
discard_tuned_samples=True,
omit_offsets=True,
include_response_params=False,
init="auto",
n_init=50000,
chains=None,
cores=None,
random_seed=None,
sampler_backend="mcmc",
**kwargs,
):
if sampler_backend in self.pymc_methods["mcmc"]:
# Don't include the parameters of the likelihood, which are deterministics.
# They can take lot of space in the trace and increase RAM requirements.
vars_to_sample = get_default_varnames(
self.model.unobserved_value_vars, include_transformed=False
)
vars_to_sample = [variable.name for variable in vars_to_sample]
for name, variable in self.model.named_vars.items():
is_likelihood_param = name in self.spec.family.likelihood.params
is_deterministic = variable in self.model.deterministics
if is_likelihood_param and is_deterministic:
vars_to_sample.remove(name)
with self.model:
try:
idata = pm.sample(
draws=draws,
tune=tune,
discard_tuned_samples=discard_tuned_samples,
init=init,
n_init=n_init,
chains=chains,
cores=cores,
random_seed=random_seed,
var_names=vars_to_sample,
**kwargs,
)
except (RuntimeError, ValueError):
if (
"ValueError: Mass matrix contains" in traceback.format_exc()
and init == "auto"
):
_log.info(
"\nThe default initialization using init='auto' has failed, trying to "
"recover by switching to init='adapt_diag'",
)
idata = pm.sample(
draws=draws,
tune=tune,
discard_tuned_samples=discard_tuned_samples,
init="adapt_diag",
n_init=n_init,
chains=chains,
cores=cores,
random_seed=random_seed,
var_names=vars_to_sample,
**kwargs,
)
else:
raise
idata_from = "pymc"
elif sampler_backend in self.bayeux_methods["mcmc"]:
import bayeux as bx # pylint: disable=import-outside-toplevel
import jax # pylint: disable=import-outside-toplevel
# Set the seed for reproducibility if provided
if random_seed is not None:
if not isinstance(random_seed, int):
random_seed = random_seed[0]
np.random.seed(random_seed)
jax_seed = jax.random.PRNGKey(np.random.randint(2**32 - 1))
bx_model = bx.Model.from_pymc(self.model)
bx_sampler = operator.attrgetter(sampler_backend)(
bx_model.mcmc # pylint: disable=no-member
)
idata = bx_sampler(seed=jax_seed, **kwargs)
idata_from = "bayeux"
else:
raise ValueError(
f"sampler_backend value {sampler_backend} is not valid. Please choose one of"
f" {self.pymc_methods['mcmc'] + self.bayeux_methods['mcmc']}"
)
idata = self._clean_results(idata, omit_offsets, include_response_params, idata_from)
return idata
def _clean_results(self, idata, omit_offsets, include_response_params, idata_from):
# Before doing anything, make sure we compute deterministics.
# But, don't include those determinisics for parameters of the likelihood.
if idata_from == "bayeux":
# Create the dataset from scratch to guarantee dim names, coord names, and values
# are the ones we expect and we don't create any issues downstream.
idata.posterior = create_posterior_bayeux(idata.posterior, self.model)
# Create the dataset for the "observed_data" group because it does not come with bayeux
idata.add_groups({"observed_data": create_observed_data_bayeux(self.model)})
idata.observed_data.attrs = idata.posterior.attrs
var_names = [
v.name
for v in self.model.deterministics
if v.name not in self.spec.family.likelihood.params
]
idata.posterior = pm.compute_deterministics(
idata.posterior,
var_names=var_names,
model=self.model,
merge_dataset=True,
progressbar=False,
)
for group in idata.groups():
getattr(idata, group).attrs["modeling_interface"] = "bambi"
getattr(idata, group).attrs["modeling_interface_version"] = __version__
if omit_offsets:
offset_vars = [var for var in idata.posterior.data_vars if var.endswith("_offset")]
idata.posterior = idata.posterior.drop_vars(offset_vars)
dims_original = list(self.model.coords)
# Don't select dims that are in the model but unused in the posterior
dims_original = [dim for dim in dims_original if dim in idata.posterior.dims]
# This does not add any new coordinate, it just changes the order so the ones
# ending in "__factor_dim" are placed after the others.
dims_group = [dim for dim in dims_original if dim.endswith("__factor_dim")]
# Keep the original order in dims_original
dims_original_set = set(dims_original) - set(dims_group)
dims_original = [dim for dim in dims_original if dim in dims_original_set]
dims_new = ["chain", "draw"] + dims_original + dims_group
# Drop unused dimensions before transposing
dims_to_drop = [dim for dim in idata.posterior.dims if dim not in dims_new]
idata.posterior = idata.posterior.drop_dims(dims_to_drop).transpose(*dims_new)
# Compute the actual intercept in all distributional components that have an intercept
for pymc_component in self.distributional_components.values():
bambi_component = pymc_component.component
if (
bambi_component.intercept_term
and bambi_component.common_terms
and self.spec.center_predictors
):
chain_n = len(idata.posterior["chain"])
draw_n = len(idata.posterior["draw"])
shape, dims = (chain_n, draw_n), ("chain", "draw")
X = pymc_component.design_matrix_without_intercept
common_terms = []
for term in bambi_component.common_terms.values():
common_terms.append(get_aliased_name(term))
response_coords = self.spec.response_component.term.coords
if response_coords:
# Grab the first object in a dictionary
levels = list(response_coords.values())[0]
shape += (len(levels),)
dims += tuple(response_coords)
posterior = idata.posterior.stack(samples=dims)
coefs = np.vstack([np.atleast_2d(posterior[name].values) for name in common_terms])
name = get_aliased_name(bambi_component.intercept_term)
center_factor = np.dot(X.mean(0), coefs).reshape(shape)
idata.posterior[name] = idata.posterior[name] - center_factor
if include_response_params:
self.spec.predict(idata)
return idata
def _run_vi(self, **kwargs):
with self.model:
self.vi_approx = pm.fit(**kwargs)
return self.vi_approx
def _run_laplace(self, draws, omit_offsets, include_response_params):
"""Fit a model using a Laplace approximation.
Mainly for pedagogical use, provides reasonable results for approximately
Gaussian posteriors. The approximation can be very poor for some models
like hierarchical ones. Use `mcmc`, `vi`, or JAX based MCMC methods
for better approximations.
Parameters
----------
draws : int
The number of samples to draw from the posterior distribution.
omit_offsets : bool
Omits offset terms in the `InferenceData` object returned when the model includes
group specific effects.
include_response_params : bool
Compute the posterior of the mean response.
Returns
-------
An ArviZ's InferenceData object.
"""
with self.model:
maps = pm.find_MAP()
n_maps = deepcopy(maps)
# Remove deterministics for parent parameters
n_maps = {
key: value
for key, value in n_maps.items()
if key not in self.spec.family.likelihood.params
}
for m in maps:
if pm.util.is_transformed_name(m):
n_maps.pop(pm.util.get_untransformed_name(m))
hessian = pm.find_hessian(n_maps)
if np.linalg.det(hessian) == 0:
raise np.linalg.LinAlgError("Singular matrix. Use mcmc or vi method")
cov = np.linalg.inv(hessian)
modes = np.concatenate([np.atleast_1d(v) for v in n_maps.values()])
samples = np.random.multivariate_normal(modes, cov, size=draws)
idata = _posterior_samples_to_idata(samples, self.model)
idata = self._clean_results(idata, omit_offsets, include_response_params, idata_from="pymc")
return idata
@property
def constant_components(self):
return {k: v for k, v in self.components.items() if isinstance(v, ConstantComponent)}
@property
def distributional_components(self):
return {k: v for k, v in self.components.items() if isinstance(v, DistributionalComponent)}
def _posterior_samples_to_idata(samples, model):
"""Create InferenceData from samples.
Parameters
----------
samples : array
Posterior samples
model : PyMC model
Returns
-------
An ArviZ's InferenceData object.
"""
initial_point = model.initial_point()
variables = model.value_vars
var_info = {}
for name, value in initial_point.items():
var_info[name] = (value.shape, value.size)
length_pos = len(samples)
varnames = [v.name for v in variables]
with model:
strace = pm.backends.ndarray.NDArray(name=model.name) # pylint:disable=no-member
strace.setup(length_pos, 0)
for i in range(length_pos):
value = []
size = 0
for varname in varnames:
shape, new_size = var_info[varname]
var_samples = samples[i][size : size + new_size]
value.append(var_samples.reshape(shape))
size += new_size
strace.record(point=dict(zip(varnames, value)))
idata = pm.to_inference_data(pm.backends.base.MultiTrace([strace]), model=model)
return idata
def create_posterior_bayeux(posterior, pm_model):
# This function is used to create a xr.Dataset that holds the posterior draws when doing
# inference via bayeux.
# bayeux does not keep any information about coords and dims, but Bambi may rely on that in
# the future, so we need them.
# It's not only painful to modify dims and coords of an existing xarray object, but it's also
# impossible sometimes. For that reason, it's simply better to create a Dataset from scratch.
# Query the mapping between variables and dims from the PyMC model
vars_to_dims = pm_model.named_vars_to_dims
# Get the variable names in the posterior Dataset
data_vars_names = list(posterior.data_vars)
# Query the coords as passed to the PyMC model
coords = pm_model.coords.copy()
# Add 'chain' and 'draw'
coords["chain"] = np.array(posterior["chain"])
coords["draw"] = np.array(posterior["draw"])
# Get the dims for each data var
data_vars_dims = {}
for data_var_name in data_vars_names:
if data_var_name in vars_to_dims:
data_vars_dims[data_var_name] = ["chain", "draw"] + list(vars_to_dims[data_var_name])
else:
data_vars_dims[data_var_name] = ["chain", "draw"]
# Create dictionary with data var dims and values (as required by xr.Dataset)
# path_to_url
data_vars_values = {}
for data_var_name, data_var_dims in data_vars_dims.items():
data_vars_values[data_var_name] = (data_var_dims, posterior[data_var_name].to_numpy())
# Get coords
dims_in_use = set(dim for dims in data_vars_dims.values() for dim in dims)
coords_in_use = {coord_name: np.array(coords[coord_name]) for coord_name in dims_in_use}
return xr.Dataset(data_vars=data_vars_values, coords=coords_in_use, attrs=posterior.attrs)
def create_observed_data_bayeux(pm_model):
# Query observation dict from PyMC
observations = find_observations(pm_model)
# Query coords and dims from PyMC
coords, dims = coords_and_dims_for_inferencedata(pm_model)
# Out of all dims, keep those associated with observations
dims = {name: dims[name] for name in observations}
# Create a flat list of dim names
dim_names = []
for dim_name in dims.values():
dim_names.extend(dim_name)
# Out of all coords, keep those associated with observations
coords = {name: coords[name] for name in dim_names}
# Create dictionary with data var dims and values (as required by xr.Dataset)
# path_to_url
data_vars_values = {}
for name, values in observations.items():
data_vars_values[name] = (dims[name], values)
return xr.Dataset(data_vars=data_vars_values, coords=coords)
```
|
```css
html{background:#f1f1f1}a{color:#0073aa}a:active,a:focus,a:hover{color:#0096dd}#media-upload a.del-link:hover,.subsubsub a.current:hover,.subsubsub a:hover,div.dashboard-widget-submit input:hover{color:#0096dd}input[type=checkbox]:checked:before{color:#dd823b}input[type=radio]:checked:before{background:#dd823b}.wp-core-ui input[type=reset]:active,.wp-core-ui input[type=reset]:hover{color:#0096dd}.wp-core-ui .button-primary{background:#dd823b;border-color:#c36922 #ad5d1e #ad5d1e;color:#fff;-webkit-box-shadow:0 1px 0 #ad5d1e;box-shadow:0 1px 0 #ad5d1e;text-shadow:0 -1px 1px #ad5d1e,-1px 0 1px #ad5d1e,0 1px 1px #ad5d1e,1px 0 1px #ad5d1e}.wp-core-ui .button-primary:focus,.wp-core-ui .button-primary:hover{background:#df8a48;border-color:#ad5d1e;color:#fff;-webkit-box-shadow:0 1px 0 #ad5d1e;box-shadow:0 1px 0 #ad5d1e}.wp-core-ui .button-primary:focus{-webkit-box-shadow:inset 0 1px 0 #c36922,0 0 2px 1px #33b3db;box-shadow:inset 0 1px 0 #c36922,0 0 2px 1px #33b3db}.wp-core-ui .button-primary:active{background:#c36922;border-color:#ad5d1e;-webkit-box-shadow:inset 0 2px 0 #ad5d1e;box-shadow:inset 0 2px 0 #ad5d1e}.wp-core-ui .button-primary.button-primary-disabled,.wp-core-ui .button-primary.disabled,.wp-core-ui .button-primary:disabled,.wp-core-ui .button-primary[disabled]{color:#d1cbc7!important;background:#cc6d23!important;border-color:#ad5d1e!important;text-shadow:none!important}.wp-core-ui .button-primary.button-hero{-webkit-box-shadow:0 2px 0 #ad5d1e!important;box-shadow:0 2px 0 #ad5d1e!important}.wp-core-ui .button-primary.button-hero:active{-webkit-box-shadow:inset 0 3px 0 #ad5d1e!important;box-shadow:inset 0 3px 0 #ad5d1e!important}.wp-core-ui .wp-ui-primary{color:#fff;background-color:#cf4944}.wp-core-ui .wp-ui-text-primary{color:#cf4944}.wp-core-ui .wp-ui-highlight{color:#fff;background-color:#dd823b}.wp-core-ui .wp-ui-text-highlight{color:#dd823b}.wp-core-ui .wp-ui-notification{color:#fff;background-color:#ccaf0b}.wp-core-ui .wp-ui-text-notification{color:#ccaf0b}.wp-core-ui .wp-ui-text-icon{color:#f3f1f1}.tablenav .tablenav-pages a:focus,.tablenav .tablenav-pages a:hover,.wrap .add-new-h2:hover,.wrap .page-title-action:hover{color:#fff;background-color:#cf4944}.view-switch a.current:before{color:#cf4944}.view-switch a:hover:before{color:#ccaf0b}#adminmenu,#adminmenuback,#adminmenuwrap{background:#cf4944}#adminmenu a{color:#fff}#adminmenu div.wp-menu-image:before{color:#f3f1f1}#adminmenu a:hover,#adminmenu li.menu-top:hover,#adminmenu li.opensub>a.menu-top,#adminmenu li>a.menu-top:focus{color:#fff;background-color:#dd823b}#adminmenu li.menu-top:hover div.wp-menu-image:before,#adminmenu li.opensub>a.menu-top div.wp-menu-image:before{color:#fff}.about-wrap h2 .nav-tab-active,.nav-tab-active,.nav-tab-active:hover{background-color:#f1f1f1;border-bottom-color:#f1f1f1}#adminmenu .wp-has-current-submenu .wp-submenu,#adminmenu .wp-has-current-submenu.opensub .wp-submenu,#adminmenu .wp-submenu,#adminmenu a.wp-has-current-submenu:focus+.wp-submenu,.folded #adminmenu .wp-has-current-submenu .wp-submenu{background:#be3631}#adminmenu li.wp-has-submenu.wp-not-current-submenu.opensub:hover:after{border-left-color:#be3631}#adminmenu .wp-submenu .wp-submenu-head{color:#f1c8c7}#adminmenu .wp-has-current-submenu .wp-submenu a,#adminmenu .wp-has-current-submenu.opensub .wp-submenu a,#adminmenu .wp-submenu a,#adminmenu a.wp-has-current-submenu:focus+.wp-submenu a,.folded #adminmenu .wp-has-current-submenu .wp-submenu a{color:#f1c8c7}#adminmenu .wp-has-current-submenu .wp-submenu a:focus,#adminmenu .wp-has-current-submenu .wp-submenu a:hover,#adminmenu .wp-has-current-submenu.opensub .wp-submenu a:focus,#adminmenu .wp-has-current-submenu.opensub .wp-submenu a:hover,#adminmenu .wp-submenu a:focus,#adminmenu .wp-submenu a:hover,#adminmenu a.wp-has-current-submenu:focus+.wp-submenu a:focus,#adminmenu a.wp-has-current-submenu:focus+.wp-submenu a:hover,.folded #adminmenu .wp-has-current-submenu .wp-submenu a:focus,.folded #adminmenu .wp-has-current-submenu .wp-submenu a:hover{color:#f7e3d3}#adminmenu .wp-has-current-submenu.opensub .wp-submenu li.current a,#adminmenu .wp-submenu li.current a,#adminmenu a.wp-has-current-submenu:focus+.wp-submenu li.current a{color:#fff}#adminmenu .wp-has-current-submenu.opensub .wp-submenu li.current a:focus,#adminmenu .wp-has-current-submenu.opensub .wp-submenu li.current a:hover,#adminmenu .wp-submenu li.current a:focus,#adminmenu .wp-submenu li.current a:hover,#adminmenu a.wp-has-current-submenu:focus+.wp-submenu li.current a:focus,#adminmenu a.wp-has-current-submenu:focus+.wp-submenu li.current a:hover{color:#f7e3d3}ul#adminmenu a.wp-has-current-submenu:after,ul#adminmenu>li.current>a.current:after{border-left-color:#f1f1f1}#adminmenu li.current a.menu-top,#adminmenu li.wp-has-current-submenu .wp-submenu .wp-submenu-head,#adminmenu li.wp-has-current-submenu a.wp-has-current-submenu,.folded #adminmenu li.current.menu-top{color:#fff;background:#dd823b}#adminmenu a.current:hover div.wp-menu-image:before,#adminmenu li a:focus div.wp-menu-image:before,#adminmenu li.opensub div.wp-menu-image:before,#adminmenu li.wp-has-current-submenu a:focus div.wp-menu-image:before,#adminmenu li.wp-has-current-submenu div.wp-menu-image:before,#adminmenu li.wp-has-current-submenu.opensub div.wp-menu-image:before,#adminmenu li:hover div.wp-menu-image:before,.ie8 #adminmenu li.opensub div.wp-menu-image:before{color:#fff}#adminmenu .awaiting-mod,#adminmenu .update-plugins{color:#fff;background:#ccaf0b}#adminmenu li a.wp-has-current-submenu .update-plugins,#adminmenu li.current a .awaiting-mod,#adminmenu li.menu-top:hover>a .update-plugins,#adminmenu li:hover a .awaiting-mod{color:#fff;background:#be3631}#collapse-menu{color:#f3f1f1}#collapse-menu:hover{color:#fff}#collapse-button div:after{color:#f3f1f1}#collapse-menu:hover #collapse-button div:after{color:#fff}#wpadminbar{color:#fff;background:#cf4944}#wpadminbar .ab-item,#wpadminbar a.ab-item,#wpadminbar>#wp-toolbar span.ab-label,#wpadminbar>#wp-toolbar span.noticon{color:#fff}#wpadminbar .ab-icon,#wpadminbar .ab-icon:before,#wpadminbar .ab-item:after,#wpadminbar .ab-item:before{color:#f3f1f1}#wpadminbar .ab-top-menu>li.menupop.hover>.ab-item,#wpadminbar.nojq .quicklinks .ab-top-menu>li>.ab-item:focus,#wpadminbar.nojs .ab-top-menu>li.menupop:hover>.ab-item,#wpadminbar:not(.mobile) .ab-top-menu>li:hover>.ab-item,#wpadminbar:not(.mobile) .ab-top-menu>li>.ab-item:focus{color:#f7e3d3;background:#be3631}#wpadminbar:not(.mobile)>#wp-toolbar a:focus span.ab-label,#wpadminbar:not(.mobile)>#wp-toolbar li.hover span.ab-label,#wpadminbar:not(.mobile)>#wp-toolbar li:hover span.ab-label{color:#f7e3d3}#wpadminbar:not(.mobile) li:hover #adminbarsearch:before,#wpadminbar:not(.mobile) li:hover .ab-icon:before,#wpadminbar:not(.mobile) li:hover .ab-item:after,#wpadminbar:not(.mobile) li:hover .ab-item:before{color:#fff}#wpadminbar .menupop .ab-sub-wrapper{background:#be3631}#wpadminbar .quicklinks .menupop ul.ab-sub-secondary,#wpadminbar .quicklinks .menupop ul.ab-sub-secondary .ab-submenu{background:#cf6b67}#wpadminbar .ab-submenu .ab-item,#wpadminbar .quicklinks .menupop ul li a,#wpadminbar .quicklinks .menupop.hover ul li a,#wpadminbar.nojs .quicklinks .menupop:hover ul li a{color:#f1c8c7}#wpadminbar .menupop .menupop>.ab-item:before,#wpadminbar .quicklinks li .blavatar{color:#f3f1f1}#wpadminbar .quicklinks .ab-sub-wrapper .menupop.hover>a,#wpadminbar .quicklinks .menupop ul li a:focus,#wpadminbar .quicklinks .menupop ul li a:focus strong,#wpadminbar .quicklinks .menupop ul li a:hover,#wpadminbar .quicklinks .menupop ul li a:hover strong,#wpadminbar .quicklinks .menupop.hover ul li a:focus,#wpadminbar .quicklinks .menupop.hover ul li a:hover,#wpadminbar li #adminbarsearch.adminbar-focused:before,#wpadminbar li .ab-item:focus:before,#wpadminbar li a:focus .ab-icon:before,#wpadminbar li.hover .ab-icon:before,#wpadminbar li.hover .ab-item:before,#wpadminbar li:hover #adminbarsearch:before,#wpadminbar li:hover .ab-icon:before,#wpadminbar li:hover .ab-item:before,#wpadminbar.nojs .quicklinks .menupop:hover ul li a:focus,#wpadminbar.nojs .quicklinks .menupop:hover ul li a:hover{color:#f7e3d3}#wpadminbar .menupop .menupop>.ab-item:hover:before,#wpadminbar .quicklinks .ab-sub-wrapper .menupop.hover>a .blavatar,#wpadminbar .quicklinks li a:focus .blavatar,#wpadminbar .quicklinks li a:hover .blavatar,#wpadminbar.mobile .quicklinks .ab-icon:before,#wpadminbar.mobile .quicklinks .ab-item:before{color:#f7e3d3}#wpadminbar.mobile .quicklinks .hover .ab-icon:before,#wpadminbar.mobile .quicklinks .hover .ab-item:before{color:#f3f1f1}#wpadminbar #adminbarsearch:before{color:#f3f1f1}#wpadminbar>#wp-toolbar>#wp-admin-bar-top-secondary>#wp-admin-bar-search #adminbarsearch input.adminbar-input:focus{color:#fff;background:#d66560}#wpadminbar #adminbarsearch .adminbar-input::-webkit-input-placeholder{color:#fff;opacity:.7}#wpadminbar #adminbarsearch .adminbar-input:-moz-placeholder{color:#fff;opacity:.7}#wpadminbar #adminbarsearch .adminbar-input::-moz-placeholder{color:#fff;opacity:.7}#wpadminbar #adminbarsearch .adminbar-input:-ms-input-placeholder{color:#fff;opacity:.7}#wpadminbar .quicklinks li#wp-admin-bar-my-account.with-avatar>a img{border-color:#d66560;background-color:#d66560}#wpadminbar #wp-admin-bar-user-info .display-name{color:#fff}#wpadminbar #wp-admin-bar-user-info a:hover .display-name{color:#f7e3d3}#wpadminbar #wp-admin-bar-user-info .username{color:#f1c8c7}.wp-pointer .wp-pointer-content h3{background-color:#dd823b;border-color:#d97426}.wp-pointer .wp-pointer-content h3:before{color:#dd823b}.wp-pointer.wp-pointer-top .wp-pointer-arrow,.wp-pointer.wp-pointer-top .wp-pointer-arrow-inner,.wp-pointer.wp-pointer-undefined .wp-pointer-arrow,.wp-pointer.wp-pointer-undefined .wp-pointer-arrow-inner{border-bottom-color:#dd823b}.media-item .bar,.media-progress-bar div{background-color:#dd823b}.details.attachment{-webkit-box-shadow:inset 0 0 0 3px #fff,inset 0 0 0 7px #dd823b;box-shadow:inset 0 0 0 3px #fff,inset 0 0 0 7px #dd823b}.attachment.details .check{background-color:#dd823b;-webkit-box-shadow:0 0 0 1px #fff,0 0 0 2px #dd823b;box-shadow:0 0 0 1px #fff,0 0 0 2px #dd823b}.media-selection .attachment.selection.details .thumbnail{-webkit-box-shadow:0 0 0 1px #fff,0 0 0 3px #dd823b;box-shadow:0 0 0 1px #fff,0 0 0 3px #dd823b}.theme-browser .theme.active .theme-name,.theme-browser .theme.add-new-theme a:focus:after,.theme-browser .theme.add-new-theme a:hover:after{background:#dd823b}.theme-browser .theme.add-new-theme a:focus span:after,.theme-browser .theme.add-new-theme a:hover span:after{color:#dd823b}.theme-filter.current,.theme-section.current{border-bottom-color:#cf4944}body.more-filters-opened .more-filters{color:#fff;background-color:#cf4944}#customize-theme-controls .widget-area-select .selected,.widgets-chooser li.widgets-chooser-selected{background-color:#dd823b;color:#fff}body.more-filters-opened .more-filters:before{color:#fff}body.more-filters-opened .more-filters:focus,body.more-filters-opened .more-filters:hover{background-color:#dd823b;color:#fff}body.more-filters-opened .more-filters:focus:before,body.more-filters-opened .more-filters:hover:before{color:#fff}.widgets-chooser li.widgets-chooser-selected:before,.widgets-chooser li.widgets-chooser-selected:focus:before{color:#fff}div#wp-responsive-toggle a:before{color:#f3f1f1}.wp-responsive-open div#wp-responsive-toggle a{border-color:transparent;background:#dd823b}.wp-responsive-open #wpadminbar #wp-admin-bar-menu-toggle a{background:#be3631}.wp-responsive-open #wpadminbar #wp-admin-bar-menu-toggle .ab-icon:before{color:#f3f1f1}.mce-container.mce-menu .mce-menu-item-normal.mce-active,.mce-container.mce-menu .mce-menu-item-preview.mce-active,.mce-container.mce-menu .mce-menu-item.mce-selected,.mce-container.mce-menu .mce-menu-item:focus,.mce-container.mce-menu .mce-menu-item:hover{background:#dd823b}
```
|
```javascript
/**
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
'use strict';
/**
* Creates a CustomError class constructor. Note that we use function generation so that tests may be run in browsers not supporting ES2015 classes. This function may be loaded in non-ES2015 environments, but should only be invoked when ES2015 classes are supported.
*
* @private
* @param {string} ctor - error constructor name
* @returns {Function} constructor
*/
function createClass( ctor ) {
var str = '';
if ( !ctor ) {
ctor = 'Error';
}
str += '(function create() {';
str += 'class CustomError extends '+ctor+' {';
str += 'constructor( msg ) {';
str += 'super( msg );';
str += '}';
str += '}';
str += 'return CustomError;';
str += '})()';
return eval( str ); // eslint-disable-line no-eval
}
// EXPORTS //
module.exports = createClass;
```
|
```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})
```
|
Tessellana is a genus of bush crickets in the tribe Platycleidini and genus group Platycleis, erected by Zeuner in 1941. Species can be found throughout mainland Europe, the Middle East and North Africa.
Species
The Orthoptera Species File lists:
Tessellana carinata Berland & Chopard, 1922
Tessellana lagrecai Messina, 1979
Tessellana nigrosignata Costa, 1863
Tessellana orina Burr, 1899
Tessellana tessellata (Charpentier, 1825) - type species (as Locusta tessellata Charpentier = T. t. tessellata, one of 2 subspecies)
Tessellana veyseli Koçak, 1984
References
External links
Orthoptera of Europe
Ensifera genera
Tettigoniidae
|
```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
```
|
Igor Rotenberg () is a Russian billionaire businessman, and the oldest son and heir to Arkady Rotenberg, Russian billionaire businessman and co-owner with brother Boris Rotenberg, of the SGM (Stroygazmontazh) group. The Rotenbergs are closely associated with Vladimir Putin. In October 2018, Igor Rotenberg's wealth was estimated to be $1.1 billion. Igor Rotenberg has been under United States sanctions since 6 April 2018.
Igor is the majority shareholder in Gazprom Drilling.
Early life and education
Igor Rotenberg was born on 9 September 1974 in Leningrad to Arkady Rotenberg. In 2002, he graduated from the Higher School of Privatization and Entrepreneurship () in Pushkino, Moscow, and received his PhD in Law in 2005 in Kaliningrad at the Kaliningrad Law Institute of the Ministry of Internal Affairs of Russia of the St. Petersburg University of the Ministry of Internal Affairs of Russia.
Career
From 2002 to 2003, he was the Deputy Head of the Department of Property of the Fuel and Energy Complex in the Ministry of Property of Russia which later became Federal Agency for State Property Management in 2004.
From 2003 to 2004, he was the Head of the Department of Transport and Telecommunications Property for the Property of Russia.
From 2004 to 2005, he was the Vice-President of Russian Railways OJSC and acted as the Head of the Department of Property Management and Organizational Structures.
Since 2006, he is the owner and the chairman of the board of directors of the Moscow-based NPV Engineering Group.
Since 2008, he is the Vice-President of the design bureau CB "Northern Sea Route" ().
Since 2010, he is the chairman of the board of directors of Mosenergo Heat and Power Company.
Since 2011, he is the chairman of the board of directors of Gazprom Burenie LLC (Burgaz).
In 2015, Arkady Rotenberg sold his son Igor Rotenberg a number of assets including up to 79% of Gazprom Drilling (Bureniye), 28% of the road construction company Mostotrest, and 33.3% of Jersey-based TPS Real Estate Holdings Ltd. Alexander Ponomarenko and Aleksandr Skorobogatko own 66.6% of TPC Real Estates Holdings.
It was reported that Arkady Rotenberg made this move after being placed on the U.S. sanctions list.
In 2015, OJCS TPS Real Estate () is one of the largest commercial real estate developers in Russia that manages several shopping centers in Russia and Ukraine. It is 100% owned by TPS Real Estate Holding Ltd. It owns the Krasnodar Gallery (), Sochi's Moremoll (), and Kiev's Ocean Plaza (). It is building the Novosibirsk Gallery () and Moscow's Slavyansky Boulevard metro station and Polezhayevskaya metro station. At the end of 2016, TPS Real Estate managed 12 shopping center with a total area of over 2 million square meters.
In 2016, Igor Rotenberg was at the center of a controversy surrounding Platon (), a company he half-owns, and alleged discrepancies in its contracts with the federal road agency, Rosavtodor. Operated by RT Invest, the Platon toll system electronically tracks and charges tolls to trucks over 12 tons on Russian Federal roads. With a 25% ownership by Rotenberg and using satellite tracking data, ScanEx (), a subsidiary of RT Invest, is developing an electronic map of the of Russian federal roads in order to track vehicles for payment to Platon. Approved on 29 September 2014 by Roman Starovoyt (), who is the head of Rosavtodor, and Alexander Sovetnikov (), who is the director of RT – Invest Transport Systems (RTITS) (), Rotenberg, through his companies, is guaranteed to receive from the state budget a very large portion of the 10.6 billion rubles indexed to inflation each year without VAT (4.98 billion rubles paid semi-annually) from 15 November 2015, to 29 September 2027, which is paid to the Planton & RT Invest partnership. After this was revealed, a large strike across Russia by truck drivers occurred on Russian federal highways beginning November 2015. On 28 November 2015, Anton Nosik alleged that the state would be missing large sums of money from the Avtodor GC () tolls between the 15th km (Businovskaya intersection on the Moscow Ring Road) to the 58th km (Solnechnogorsk) along M11, which had been applied as maintenance fees not only to truck drivers but to all drivers and were not to be paid until the M11 project was completed, but were being charged to all motorists beginning on 23 November 2015. He alleged that the missing money from the budgeted funds for the construction of the M11 as well as both the future moneys from Avtodor GC and the PLATON systems had been diverted to the Rotenburgs' pockets through real estate money laundering investments in Miami. Instead of the expected total revenues from Platon of 20 to 40 billion rubles, the actual revenues were 25% or less than those figures.
On 29 March 2018, Igor sold his 33.3% stake in TPS Real Estate Holdings for $1 billion to his sister Liliya Rotenberg ().
Sanctions
On 6 April 2018, Igor Rotenberg and his NPV Engineering Group were placed under United States sanctions.
On 22nd February 2022, Igor Rotenberg was placed under sanctions by the UK government as part of the 2021-2022 Russo-Ukrainian crisis.
Wealth
In October 2018, Igor Rotenberg had an estimated wealth of $1.1 billion by Forbes.
Personal life
He is married, and has three children.
Notes
References
1974 births
Living people
Russian businesspeople in the oil industry
Russian Jews
Russian billionaires
Russian individuals subject to United Kingdom sanctions
Russian individuals subject to the U.S. Department of the Treasury sanctions
|
Roti Bunz is an Indonesian bakery, bistro, and coffeehouse chain based in Malang, East Java, Indonesia. The company was founded in 2012 by Yudi Haryanto.
History
In 2012, Roti Bunz was established as Roti Bunz Bakery & Cafe. In 2014, its outlets have implemented franchise system until now. At the end of 2015, this outlet was renamed Roti Bunz Bistro.
Products
The menu concept promoted by Roti Bunz is a menu concept that serves bakery, coffees and mainstream bistro foods. The main menu that is relied on is bread bun which has filling and given toppings. The cafe menu is represented by coffee, tea and chocolate. Other foods and beverages menu such as noodles, rice bowls, and milkshakes are also on Roti Bunz.
Awards
List of awards received by Roti Bunz:
Top Quality Product Excellent Award Winner TOP 50 Leader
Indonesia Top Business Innovation Award
Anugerah Wirausaha Indonesia
See also
List of coffeehouse chains
References
External links
Roti Bunz official website
Food and drink companies of Indonesia
Restaurants established in 2012
Indonesian brands
2012 establishments in Indonesia
Companies based in Malang
Malang
|
The women's points race at the 2010 Dutch National Track Championships in Apeldoorn took place at Omnisport Apeldoorn on December 28, 2010. 17 athletes participated in the contest.
Kirsten Wild won the gold medal, Amy Pieters took silver and Ellen van Dijk won the bronze.
Competition format
There were no qualification rounds for this discipline. Consequently, the event was run direct to the final.
Results
Results from wielerpunt.com.
References
Women's points
Dutch National Track Championships – Women's points race
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.