text stringlengths 1 22.8M |
|---|
```c++
// This source code is licensed under the BSD-style license found in the
// LICENSE file in the root directory of this source tree. An additional grant
// of patent rights can be found in the PATENTS file in the same directory.
#ifndef ROCKSDB_LITE
#include "db/compacted_db_impl.h"
#include "db/db_impl.h"
#include "db/version_set.h"
#include "table/get_context.h"
namespace rocksdb {
extern void MarkKeyMayExist(void* arg);
extern bool SaveValue(void* arg, const ParsedInternalKey& parsed_key,
const Slice& v, bool hit_and_return);
CompactedDBImpl::CompactedDBImpl(
const DBOptions& options, const std::string& dbname)
: DBImpl(options, dbname) {
}
CompactedDBImpl::~CompactedDBImpl() {
}
size_t CompactedDBImpl::FindFile(const Slice& key) {
size_t left = 0;
size_t right = files_.num_files - 1;
while (left < right) {
size_t mid = (left + right) >> 1;
const FdWithKeyRange& f = files_.files[mid];
if (user_comparator_->Compare(ExtractUserKey(f.largest_key), key) < 0) {
// Key at "mid.largest" is < "target". Therefore all
// files at or before "mid" are uninteresting.
left = mid + 1;
} else {
// Key at "mid.largest" is >= "target". Therefore all files
// after "mid" are uninteresting.
right = mid;
}
}
return right;
}
Status CompactedDBImpl::Get(const ReadOptions& options, ColumnFamilyHandle*,
const Slice& key, PinnableSlice* value) {
GetContext get_context(user_comparator_, nullptr, nullptr, nullptr,
GetContext::kNotFound, key, value, nullptr, nullptr,
nullptr, nullptr);
LookupKey lkey(key, kMaxSequenceNumber);
files_.files[FindFile(key)].fd.table_reader->Get(
options, lkey.internal_key(), &get_context);
if (get_context.State() == GetContext::kFound) {
return Status::OK();
}
return Status::NotFound();
}
std::vector<Status> CompactedDBImpl::MultiGet(const ReadOptions& options,
const std::vector<ColumnFamilyHandle*>&,
const std::vector<Slice>& keys, std::vector<std::string>* values) {
autovector<TableReader*, 16> reader_list;
for (const auto& key : keys) {
const FdWithKeyRange& f = files_.files[FindFile(key)];
if (user_comparator_->Compare(key, ExtractUserKey(f.smallest_key)) < 0) {
reader_list.push_back(nullptr);
} else {
LookupKey lkey(key, kMaxSequenceNumber);
f.fd.table_reader->Prepare(lkey.internal_key());
reader_list.push_back(f.fd.table_reader);
}
}
std::vector<Status> statuses(keys.size(), Status::NotFound());
values->resize(keys.size());
int idx = 0;
for (auto* r : reader_list) {
if (r != nullptr) {
PinnableSlice pinnable_val;
std::string& value = (*values)[idx];
GetContext get_context(user_comparator_, nullptr, nullptr, nullptr,
GetContext::kNotFound, keys[idx], &pinnable_val,
nullptr, nullptr, nullptr, nullptr);
LookupKey lkey(keys[idx], kMaxSequenceNumber);
r->Get(options, lkey.internal_key(), &get_context);
value.assign(pinnable_val.data(), pinnable_val.size());
if (get_context.State() == GetContext::kFound) {
statuses[idx] = Status::OK();
}
}
++idx;
}
return statuses;
}
Status CompactedDBImpl::Init(const Options& options) {
mutex_.Lock();
ColumnFamilyDescriptor cf(kDefaultColumnFamilyName,
ColumnFamilyOptions(options));
Status s = Recover({cf}, true /* read only */, false, true);
if (s.ok()) {
cfd_ = reinterpret_cast<ColumnFamilyHandleImpl*>(
DefaultColumnFamily())->cfd();
delete cfd_->InstallSuperVersion(new SuperVersion(), &mutex_);
}
mutex_.Unlock();
if (!s.ok()) {
return s;
}
NewThreadStatusCfInfo(cfd_);
version_ = cfd_->GetSuperVersion()->current;
user_comparator_ = cfd_->user_comparator();
auto* vstorage = version_->storage_info();
if (vstorage->num_non_empty_levels() == 0) {
return Status::NotSupported("no file exists");
}
const LevelFilesBrief& l0 = vstorage->LevelFilesBrief(0);
// L0 should not have files
if (l0.num_files > 1) {
return Status::NotSupported("L0 contain more than 1 file");
}
if (l0.num_files == 1) {
if (vstorage->num_non_empty_levels() > 1) {
return Status::NotSupported("Both L0 and other level contain files");
}
files_ = l0;
return Status::OK();
}
for (int i = 1; i < vstorage->num_non_empty_levels() - 1; ++i) {
if (vstorage->LevelFilesBrief(i).num_files > 0) {
return Status::NotSupported("Other levels also contain files");
}
}
int level = vstorage->num_non_empty_levels() - 1;
if (vstorage->LevelFilesBrief(level).num_files > 0) {
files_ = vstorage->LevelFilesBrief(level);
return Status::OK();
}
return Status::NotSupported("no file exists");
}
Status CompactedDBImpl::Open(const Options& options,
const std::string& dbname, DB** dbptr) {
*dbptr = nullptr;
if (options.max_open_files != -1) {
return Status::InvalidArgument("require max_open_files = -1");
}
if (options.merge_operator.get() != nullptr) {
return Status::InvalidArgument("merge operator is not supported");
}
DBOptions db_options(options);
std::unique_ptr<CompactedDBImpl> db(new CompactedDBImpl(db_options, dbname));
Status s = db->Init(options);
if (s.ok()) {
ROCKS_LOG_INFO(db->immutable_db_options_.info_log,
"Opened the db as fully compacted mode");
LogFlush(db->immutable_db_options_.info_log);
*dbptr = db.release();
}
return s;
}
} // namespace rocksdb
#endif // ROCKSDB_LITE
``` |
Ng Chiu Fan (born 4 August 1962) is a Hong Kong judoka. He competed in the men's middleweight event at the 1988 Summer Olympics.
References
External links
1962 births
Living people
Hong Kong male judoka
Olympic judoka for Hong Kong
Judoka at the 1988 Summer Olympics
Place of birth missing (living people) |
```tex
%
%
%
% v 1.9.1
%
% %
% General
% %
\definecolor{white}{RGB}{255, 255, 255}
\definecolor{black}{RGB}{0, 0, 0}
% Gray
% %
\definecolor{gray-0}{RGB}{248, 249, 250}
\definecolor{gray-1}{RGB}{241, 243, 245}
\definecolor{gray-2}{RGB}{233, 236, 239}
\definecolor{gray-3}{RGB}{222, 226, 230}
\definecolor{gray-4}{RGB}{206, 212, 218}
\definecolor{gray-5}{RGB}{173, 181, 189}
\definecolor{gray-6}{RGB}{134, 142, 150}
\definecolor{gray-7}{RGB}{73, 80, 87}
\definecolor{gray-8}{RGB}{52, 58, 64}
\definecolor{gray-9}{RGB}{33, 37, 41}
% Red
% %
\definecolor{red-0}{RGB}{255, 245, 245}
\definecolor{red-1}{RGB}{255, 227, 227}
\definecolor{red-2}{RGB}{255, 201, 201}
\definecolor{red-3}{RGB}{255, 168, 168}
\definecolor{red-4}{RGB}{255, 135, 135}
\definecolor{red-5}{RGB}{255, 107, 107}
\definecolor{red-6}{RGB}{250, 82, 82}
\definecolor{red-7}{RGB}{240, 62, 62}
\definecolor{red-8}{RGB}{224, 49, 49}
\definecolor{red-9}{RGB}{201, 42, 42}
% Pink
% %
\definecolor{pink-0}{RGB}{255, 240, 246}
\definecolor{pink-1}{RGB}{255, 222, 235}
\definecolor{pink-2}{RGB}{252, 194, 215}
\definecolor{pink-3}{RGB}{250, 162, 193}
\definecolor{pink-4}{RGB}{247, 131, 172}
\definecolor{pink-5}{RGB}{240, 101, 149}
\definecolor{pink-6}{RGB}{230, 73, 128}
\definecolor{pink-7}{RGB}{214, 51, 108}
\definecolor{pink-8}{RGB}{194, 37, 92}
\definecolor{pink-9}{RGB}{166, 30, 77}
% Grape
% %
\definecolor{grape-0}{RGB}{248, 240, 252}
\definecolor{grape-1}{RGB}{243, 217, 250}
\definecolor{grape-2}{RGB}{238, 190, 250}
\definecolor{grape-3}{RGB}{229, 153, 247}
\definecolor{grape-4}{RGB}{218, 119, 242}
\definecolor{grape-5}{RGB}{204, 93, 232}
\definecolor{grape-6}{RGB}{190, 75, 219}
\definecolor{grape-7}{RGB}{174, 62, 201}
\definecolor{grape-8}{RGB}{156, 54, 181}
\definecolor{grape-9}{RGB}{134, 46, 156}
% Violet
% %
\definecolor{violet-0}{RGB}{243, 240, 255}
\definecolor{violet-1}{RGB}{229, 219, 255}
\definecolor{violet-2}{RGB}{208, 191, 255}
\definecolor{violet-3}{RGB}{177, 151, 252}
\definecolor{violet-4}{RGB}{151, 117, 250}
\definecolor{violet-5}{RGB}{132, 94, 247}
\definecolor{violet-6}{RGB}{121, 80, 242}
\definecolor{violet-7}{RGB}{112, 72, 232}
\definecolor{violet-8}{RGB}{103, 65, 217}
\definecolor{violet-9}{RGB}{95, 61, 196}
% Indigo
% %
\definecolor{indigo-0}{RGB}{237, 242, 255}
\definecolor{indigo-1}{RGB}{219, 228, 255}
\definecolor{indigo-2}{RGB}{186, 200, 255}
\definecolor{indigo-3}{RGB}{145, 167, 255}
\definecolor{indigo-4}{RGB}{116, 143, 252}
\definecolor{indigo-5}{RGB}{92, 124, 250}
\definecolor{indigo-6}{RGB}{76, 110, 245}
\definecolor{indigo-7}{RGB}{66, 99, 235}
\definecolor{indigo-8}{RGB}{59, 91, 219}
\definecolor{indigo-9}{RGB}{54, 79, 199}
% Blue
% %
\definecolor{blue-0}{RGB}{231, 245, 255}
\definecolor{blue-1}{RGB}{208, 235, 255}
\definecolor{blue-2}{RGB}{165, 216, 255}
\definecolor{blue-3}{RGB}{116, 192, 252}
\definecolor{blue-4}{RGB}{77, 171, 247}
\definecolor{blue-5}{RGB}{51, 154, 240}
\definecolor{blue-6}{RGB}{34, 139, 230}
\definecolor{blue-7}{RGB}{28, 126, 214}
\definecolor{blue-8}{RGB}{25, 113, 194}
\definecolor{blue-9}{RGB}{24, 100, 171}
% Cyan
% %
\definecolor{cyan-0}{RGB}{227, 250, 252}
\definecolor{cyan-1}{RGB}{197, 246, 250}
\definecolor{cyan-2}{RGB}{153, 233, 242}
\definecolor{cyan-3}{RGB}{102, 217, 232}
\definecolor{cyan-4}{RGB}{59, 201, 219}
\definecolor{cyan-5}{RGB}{34, 184, 207}
\definecolor{cyan-6}{RGB}{21, 170, 191}
\definecolor{cyan-7}{RGB}{16, 152, 173}
\definecolor{cyan-8}{RGB}{12, 133, 153}
\definecolor{cyan-9}{RGB}{11, 114, 133}
% Teal
% %
\definecolor{teal-0}{RGB}{230, 252, 245}
\definecolor{teal-1}{RGB}{195, 250, 232}
\definecolor{teal-2}{RGB}{150, 242, 215}
\definecolor{teal-3}{RGB}{99, 230, 190}
\definecolor{teal-4}{RGB}{56, 217, 169}
\definecolor{teal-5}{RGB}{32, 201, 151}
\definecolor{teal-6}{RGB}{18, 184, 134}
\definecolor{teal-7}{RGB}{12, 166, 120}
\definecolor{teal-8}{RGB}{9, 146, 104}
\definecolor{teal-9}{RGB}{8, 127, 91}
% Green
% %
\definecolor{green-0}{RGB}{235, 251, 238}
\definecolor{green-1}{RGB}{211, 249, 216}
\definecolor{green-2}{RGB}{178, 242, 187}
\definecolor{green-3}{RGB}{140, 233, 154}
\definecolor{green-4}{RGB}{105, 219, 124}
\definecolor{green-5}{RGB}{81, 207, 102}
\definecolor{green-6}{RGB}{64, 192, 87}
\definecolor{green-7}{RGB}{55, 178, 77}
\definecolor{green-8}{RGB}{47, 158, 68}
\definecolor{green-9}{RGB}{43, 138, 62}
% Lime
% %
\definecolor{lime-0}{RGB}{244, 252, 227}
\definecolor{lime-1}{RGB}{233, 250, 200}
\definecolor{lime-2}{RGB}{216, 245, 162}
\definecolor{lime-3}{RGB}{192, 235, 117}
\definecolor{lime-4}{RGB}{169, 227, 75}
\definecolor{lime-5}{RGB}{148, 216, 45}
\definecolor{lime-6}{RGB}{130, 201, 30}
\definecolor{lime-7}{RGB}{116, 184, 22}
\definecolor{lime-8}{RGB}{102, 168, 15}
\definecolor{lime-9}{RGB}{92, 148, 13}
% Yellow
% %
\definecolor{yellow-0}{RGB}{255, 249, 219}
\definecolor{yellow-1}{RGB}{255, 243, 191}
\definecolor{yellow-2}{RGB}{255, 236, 153}
\definecolor{yellow-3}{RGB}{255, 224, 102}
\definecolor{yellow-4}{RGB}{255, 212, 59}
\definecolor{yellow-5}{RGB}{252, 196, 25}
\definecolor{yellow-6}{RGB}{250, 176, 5}
\definecolor{yellow-7}{RGB}{245, 159, 0}
\definecolor{yellow-8}{RGB}{240, 140, 0}
\definecolor{yellow-9}{RGB}{230, 119, 0}
% Orange
% %
\definecolor{orange-0}{RGB}{255, 244, 230}
\definecolor{orange-1}{RGB}{255, 232, 204}
\definecolor{orange-2}{RGB}{255, 216, 168}
\definecolor{orange-3}{RGB}{255, 192, 120}
\definecolor{orange-4}{RGB}{255, 169, 77}
\definecolor{orange-5}{RGB}{255, 146, 43}
\definecolor{orange-6}{RGB}{253, 126, 20}
\definecolor{orange-7}{RGB}{247, 103, 7}
\definecolor{orange-8}{RGB}{232, 89, 12}
\definecolor{orange-9}{RGB}{217, 72, 15}
``` |
Shopping is a 2013 New Zealand coming-of-age film written and directed by Mark Albiston and Louis Sutherland. It stars Kevin Paulo as a mixed race Samoan New Zealander who falls in with a group of shoplifters led by an Eastern-European immigrant played by Jacek Koman. It premiered at the Sundance Film Festival in January 2013 and was released in New Zealand on 30 May 2013.
Plot
On the Kāpiti Coast in 1981, mixed-race teenager Willie and his younger brother, Solomon, spend increasing amounts of time away from their violent father and religious mother. Willie draws the appreciation of professional thief Bennie after unintentionally aiding one of his robberies. Drawn to the camaraderie of Bennie's gang, Willie must decide whether to follow them as they move on or stay behind to care for Solomon.
Cast
Kevin Paulo as Willie
Julian Dennison as Solomon
Jacek Koman as Bennie
Alistair Browning as Terry, Willie's father
Laura Petersen as Nicky, Bennie's daughter
Maureen Fepuleai as Willie's mother
Byron Coll as Lindsay
Matthias Luafutu as Red
Production
The film was inspired by real life events for writer-directors Albiston and Sutherland, who grew up together. It is their feature film debut, after having collaborated in short films. Shopping followed Boy, another New Zealand coming-of-age film about a boy of Polynesian descent, but Albiston said Boy was more of an inspiration in that it showed there was a market for such stories than creatively. Sutherland, who was working on the script at the time of Boys release, did not watch it. Casting for Shopping was difficult; Sutherland said they toured many colleges to find their lead but eventually stumbled upon Paulo at a restaurant. Dennison was cast after extensive auditions, and Petersen, a drama student at the time, was discovered at a local college. During production, the two directors would split jobs, which they later described as a poor use of their collaborative skills. They said they were often told they were doing things improperly; at first, they found this unnerving but eventually found it exciting "because we know we're working unconventionally".
Release
Shopping premiered at the Sundance Film Festival in January 2013. Madman Entertainment released it in New Zealand on 30 May 2013, and it grossed $US82,756.
Reception
The New Zealand Herald rated it 4/5 stars and called it "an affecting, memorable movie that is sure to figure in local best-of-year lists" despite minor issues in plotting. The Dominion Post rated it 4/5 stars and wrote that it "looks great and has great performances". The Manawatu Standard instead criticized the film's lack of plotting in favor of cinematography, rating it 1/5 stars. American trade publications Variety and The Hollywood Reporter, commenting on the film's uncompromising authenticity, both said that outsiders may find it different to understand or relate to. Variety called it "a rough-hewn but confident first feature" that takes too much influence from the filmmakers' background in short films, and The Hollywood Reporter wrote that the film "sacrifice[s] clarity and character involvement" for its intentionally rough aesthetic. Screen Daily similarly wrote that the film makes no concessions to outsiders but is "a labour of love" that film festival audiences will enjoy.
References
External links
Shopping Kapiti's big new film, a write-up at The Dominion Post
2013 films
2010s coming-of-age drama films
New Zealand coming-of-age drama films
Films set in 1981
Films set in New Zealand
Films shot in New Zealand
2013 drama films
2010s English-language films |
Robin Hill may refer to:
People
Robin Hill (biochemist) (18991991), British plant biochemist
Robin Hill, 8th Marquess of Downshire (19292003), Irish peer
Robin Hill (Australian artist) (born 1932), Australian artist
Robin Hill (American artist) (born 1955), American visual artist
Places
Robin Hill, New South Wales, Australia
Robin Hill Country Park, Downend, Isle of Wight, UK
Robin Hill Cemetery, Marlborough, Massachusetts, USA
Hill, Robin |
Into the Silence is an album by Israeli trumpeter and composer Avishai Cohen recorded in France in 2015 and released on the ECM label the following year.
Reception
The AllMusic review by Matt Collar notes "In some ways, Cohen's move toward a more classical, ambient sound makes sense, as he is recording material specifically with the ECM stylistic tradition in mind. Sadly, Cohen also composed these songs in the wake of his father's death, and the trumpeter's grief seems to permeate everything on Into the Silence ... with Cohen leading his band through ambient soundscapes that, much like one's emotions after the death of a loved one, are supple and sad one minute, and sharp and tangled the next".
In The Guardian, John Fordham wrote "The breadth of jazz references will make this irresistible for fans, but it’s beautiful contemporary music for just about anyone". In JazzTimes, Bill Beuttler wrote "Cohen assembled a new quintet for the project, and the music is more composed and introspective-the title track, in particular ... the five of them sound like they’ve been playing together forever".
All About Jazz reviewer Mark Sullivan stated "I have to wonder whether knowing the background of the inspiration for this music colors the perception of it—it seems unlikely that a listener encountering these tracks blind would guess what they were "about." It's beautiful music regardless, and clearly has a unity earned by the consistent spirit in the composing as well as the spontaneous approach that the group took to this performance".
Track listing
All compositions by Avishai Cohen
"Life and Death" – 9:18
"Dream Like a Child" – 15:30
"Into the Silence" – 12:12
"Quiescence" – 5:10
"Behind the Broken Glass" – 8:12
"Life and Death (Epilogue)" – 2:43
Personnel
Avishai Cohen – trumpet
Bill McHenry – tenor saxophone
Yonathan Avishai – piano
Eric Revis – double bass
Nasheet Waits – drums
References
2016 albums
Avishai Cohen (trumpeter) albums
ECM Records albums
Albums produced by Manfred Eicher |
Jeremy Hutchinson may refer to:
Jeremy Hutchinson, Baron Hutchinson of Lullington (1915–2017), British life peer
Jeremy Hutchinson (politician) (born 1974), United States politician |
Olle Lycksell (born August 24, 1999) is a Swedish professional ice hockey forward currently playing for Lehigh Valley Phantoms of the American Hockey League (AHL) as a prospect to the Philadelphia Flyers of the National Hockey League (NHL). Lycksell was drafted in the sixth round of the 2017 NHL Entry Draft, 168th overall, by the Flyers.
Playing career
Lycksell played as a youth within hometown club, IK Oskarshamn, making his professional debut in the HockeyAllsvenskan in the 2015–16 season, before moving to continue his development with top tier club, Linköping HC.
Lycksell continued his junior career with Linköping HC, making his full SHL debut during the 2017–18 season, appearing in 26 games for 5 goals and 7 points.
Following his sixth season within Linköping HC, having appeared in his first full SHL season in 2019–20, and collecting a career high 9 goals and 21 points in 51 games, Lycksell left the club out of contract and signed a two-year contract with Färjestad BK on 2 April 2020.
In his first season with Färjestad in 2020–21, Lycksell matched his previous season output in posting 9 goals and 21 points through 46 regular season games. He added 3 points in six post-season games. On 6 May 2021, he was signed by the Philadelphia Flyers to a two-year, entry-level contract.
Career statistics
References
External links
1999 births
Living people
Färjestad BK players
IK Oskarshamn players
Lehigh Valley Phantoms players
Linköping HC players
People from Oskarshamn Municipality
Philadelphia Flyers draft picks
Philadelphia Flyers players
Swedish ice hockey right wingers
Växjö Lakers players
Sportspeople from Kalmar County |
```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 io.camunda.zeebe.model.bpmn.impl.instance;
import io.camunda.zeebe.model.bpmn.instance.BpmnModelElementInstanceTest;
import java.util.Collection;
/**
* @author Sebastian Menski
*/
public class TargetTest extends BpmnModelElementInstanceTest {
@Override
public TypeAssumption getTypeAssumption() {
return new TypeAssumption(false);
}
@Override
public Collection<ChildElementAssumption> getChildElementAssumptions() {
return null;
}
@Override
public Collection<AttributeAssumption> getAttributesAssumptions() {
return null;
}
}
``` |
The L.A. Mass Choir is an American gospel choir from Los Angeles. The group released several commercially successful albums in the late 1980s and 1990s, and was nominated for Stellar Awards and Gospel Music Excellence Awards. It was started by Tony Wilkins and Donald Taylor. Donald Taylor directed the choir.
Discography
Live! Give Him the Glory (1988) U.S. Gospel #3
Can't Hold Back (1989) U.S. Gospel #2
Hell (1990)
Come As You Are (1992) U.S. Gospel #7
I Shall Not Be Defeated (1994) U.S. Gospel #6
Unconditional Love (1995) U.S. Gospel #31
Back to the Drawing Board (1998) U.S. Gospel #32
References
External links
L.A. Mass Website
Choirs in California
American gospel musical groups
Musical groups from Los Angeles |
Elizabeth Ongoro is a Kenyan politician. She belongs to Orange Democratic Movement and was elected to represent the Kasarani Constituency in the 10th Parliamentof the National Assembly of Kenya from the 2007 Kenyan parliamentary election to the 2013 Kenyan parliamentary election.
References
External links
Kasarani Constituency
Living people
Year of birth missing (living people)
Orange Democratic Movement politicians
Members of the National Assembly (Kenya)
21st-century Kenyan women politicians
21st-century Kenyan politicians |
Oedipus Judaicus by William Drummond was first published in 1811 in a limited edition of 200 copies. The book was originally intended for use in a scholastic setting in an attempt to protect Drummond's political career from ridicule.
The work is a commentary on a supposed astrological allegory in the Old Testament of the Bible, patterned after the Oedipus Aegyptiacus of Kircher. In the book, Drummond seeks possible sources of the Biblical writings, from the Temple of Denderah to parallels with the Roman gods, dealing primarily with the 49th chapter of Genesis and the book of Joshua to draw his conclusions.
The book was reprinted in 1866 and again in 1986, and is again in print.
External articles and references
The Oedipus Judaicus. Entire text at Google Books
1811 non-fiction books
Religious studies books
Astrological texts
Books about the Bible |
```python
import json
def processKinesis(event, *args):
print("!processKinesis", json.dumps(event))
``` |
```java
/*
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
*
* 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 org.apache.shardingsphere.infra.spi.type.typed;
import org.apache.shardingsphere.infra.spi.exception.ServiceProviderNotFoundException;
import org.apache.shardingsphere.infra.spi.type.typed.fixture.TypedSPIFixture;
import org.apache.shardingsphere.infra.spi.type.typed.fixture.impl.TypedSPIFixtureImpl;
import org.apache.shardingsphere.test.util.PropertiesBuilder;
import org.apache.shardingsphere.test.util.PropertiesBuilder.Property;
import org.junit.jupiter.api.Test;
import java.util.Properties;
import static org.hamcrest.CoreMatchers.instanceOf;
import static org.hamcrest.CoreMatchers.is;
import static org.hamcrest.MatcherAssert.assertThat;
import static org.junit.jupiter.api.Assertions.assertNotNull;
import static org.junit.jupiter.api.Assertions.assertThrows;
import static org.junit.jupiter.api.Assertions.assertTrue;
class TypedSPILoaderTest {
@Test
void assertFindServiceWithoutProperties() {
assertTrue(TypedSPILoader.findService(TypedSPIFixture.class, "TYPED.FIXTURE").isPresent());
}
@Test
void assertFindServiceWithProperties() {
assertTrue(TypedSPILoader.findService(TypedSPIFixture.class, "TYPED.FIXTURE", new Properties()).isPresent());
}
@Test
void assertGetServiceWithoutProperties() {
assertThat(TypedSPILoader.getService(TypedSPIFixture.class, "TYPED.FIXTURE"), instanceOf(TypedSPIFixtureImpl.class));
}
@Test
void assertGetServiceWithProperties() {
assertThat(((TypedSPIFixtureImpl) TypedSPILoader.getService(TypedSPIFixture.class, "TYPED.FIXTURE", PropertiesBuilder.build(new Property("key", "1")))).getValue(), is("1"));
}
@Test
void assertGetServiceWithAlias() {
assertNotNull(TypedSPILoader.getService(TypedSPIFixture.class, "TYPED.ALIAS"));
}
@Test
void assertGetServiceWhenTypeIsNotExist() {
assertThrows(ServiceProviderNotFoundException.class, () -> TypedSPILoader.getService(TypedSPIFixture.class, "NOT_EXISTED"));
}
}
``` |
Buffalo Dreams is a 2005 American Western television film directed by David Jackson on Disney Channel Original Movie.
Plot
Set against the backdrop of New Mexico, the film follows a boy, Josh Townsend, who moves because of his father's job and becomes involved with a group of teens attempting to preserve the buffalo and Navajo traditions. Along the way he makes friends and learns important lessons about life. The movie teaches about a few Navajo traditions. Josh eventually enters a race against his rival and proves to be the better of the two; however, he quits the race after seeing the buffalo herd stampeding. Josh quickly gathers his friends to save the town, and while his rival refuses to help, his friends do. Together, they herd the buffalo away from the town and back onto their preserve. During the process, Josh's friend Thomas Blackhorse falls in front of a buffalo, but is saved by his sister who finally speaks for the first time in years to help calm the buffalo. Josh and his friends are hailed as heroes by the town and in recognition of his bravery, Josh is made an honorary member of the Navajo tribe with the name Rides With the Wind. He and Thomas, who he had trouble getting along with before, make a pact to keep the buffalo safe together.
Production
The film was shot in 2004 on location in Utah.
Cast
Reiley McClendon as Josh Townsend
Simon R. Baker as Thomas Blackhorse
Graham Greene as John Blackhorse
Tessa Vonn as Scout Blackhorse
Max Van Ville as Moon
Chris Hunter as Kyle
Adrienne Bailon as Domino
Geraldine Keams as Abuela Rose
Christopher Robin Miller as Virgil
George Newbern as Dr. Nick Townsend
Seth Packard as Wylie
Jane Sibbett as Blaine Townsend
Justin Stern as Luke
Chris White as J.G.
Awards
In 2006 the film was nominated for the Directors Guild of America Award for Outstanding Directing – Children's Programs for David S. Jackson and for Best Performance in a TV Movie, Miniseries or Special - Supporting Young Actress for Tessa Vonn at the 27th Young Artist Awards.
References
External links
2005 television films
2000s English-language films
2000s teen drama films
American teen drama films
Disney Channel Original Movie films
Films about Native Americans
Films scored by Ramin Djawadi
Films set in New Mexico
Films shot in Utah
American Western (genre) television films
Films directed by David Jackson (director)
2005 films
American drama television films
2000s American films |
Chale is a village in Mulshi taluka of Pune District in the Indian state of Maharashtra. It is surrounded by the Four Talukas of Karjat, Talegaon Dabhade, Mawal and Khalapur. The Districts closest to the village are Raigad district, Thane district, Mumbai City district and the Mumbai Suburban district. The nearest railway stations to the village are Vadgaon, Begdewadi, Lonavala, Talegaon and Kamshet.
References
External links
Villages in Mulshi taluka
Villages in Pune, Maharashtra
List of villages in Mulshi Tehsil
Villages in Mulshi taluka |
Chakravakam is a 1974 Indian Malayalam film, directed by Thoppil Bhasi. The film stars Prem Nazir, Kaviyoor Ponnamma, KPAC Lalitha and Adoor Bhasi in the lead roles. The film has musical score by Shankar–Ganesh.
Cast
Prem Nazir as Raghavan
Kaviyoor Ponnamma as Soshamma
KPAC Lalitha as Branti Paru
Adoor Bhasi as Sankaran
Mani
Shanthi
T. S. Muthaiah as Devassia's father
Baby Shanthi
Indira
Mohanan
Oduvil Unnikrishnan as Mammad
Paravoor Bharathan as Devassia
Sujatha as Devaki
Sumithra as Padmini
Treesa
Soundtrack
The music was composed by Shankar–Ganesh and the lyrics were written by Vayalar Ramavarma.
References
External links
1974 films
1970s Malayalam-language films
Films scored by Shankar–Ganesh
Films directed by Thoppil Bhasi |
The 2009 East Asian Games (), officially known as the V East Asian Games, was an international multi-sport event that hosted by Hong Kong, China, between 5 December and 13 December 2009. A total of 2,377 athletes from 9 East Asian national competed in 262 events in 22 sports. It was the biggest sporting event ever held in the territory.
Organisation
Bid
In 2003 Hong Kong, Chinese Taipei and Mongolia entered the bidding process as potential host cities for the 5th East Asian games. Mongolia subsequently withdrew. On 3 November 2003 at a meeting in Macau, Hong Kong was selected as the host.
June 2004 saw the formation of the Preparatory Committee for the Hong Kong East Asian Games, chaired by Timothy Fok, president of Sports Federation and Olympic Committee of Hong Kong.
Costs
On 13 January 2006 the Legislative Council had approved the government spending of HK$123 million for the games. The total expenditure for the games is estimated to be HK$240 million. The estimated total revenue is also HK$240 million, including HK$123 million government funding, HK$43 million from ticket and merchandise sales and HK$74 million from cash sponsorship.
Venues
Kowloon Park Swimming Pool: Aquatics (Swimming, Diving)
Tseung Kwan O Sports Ground: Athletics, Bodybuilding, Cycling (Indoor Cycling)
Queen Elizabeth Stadium: Badminton, Table-tennis
Hong Kong Coliseum: Basketball, Volleyball
Western Park Sports Centre: Basketball, Wushu (Taolu, Sanshou)
Hong Kong International Trade & Exhibition Centre: Bowling, Cue Sports, DanceSport
Gin Drinker's Bay, Kwai Chung: Cycling (BMX)
Public Roads in the New Territories: Cycling (Road Cycling)
Hong Kong Stadium: Football, Rugby Sevens
Siu Sai Wan Sports Ground: Football
King's Park Hockey Ground: Hockey
Shek Kip Mei Park Sports Centre: Judo, Taekwondo
Shatin Rowing Centre: Rowing
South China AA Sports Complex: Shooting
Hong Kong Squash Centre: Squash
Aberdeen Tennis and Squash Centre: Squash
Hong Kong Park Sports Centre: Squash
Victoria Park Tennis Centre: Tennis
Lai Chi Kok Park Sports Centre: Weightlifting
Stanley Main Beach Water Sports Centre: Windsurfing
Emblem
During the 2005 East Asian Games in Macau, a competition was held to determine the logo for the 5th East Asian Games. On 11 July 2005 a fireworks emblem, designed by Clement Yick Tat-wa, was selected. The design makes reference to the five Olympic rings, and the sparkling fireworks symbolise the energy of athletes striving to fulfill their potential and to achieve sporting excellence.
Slogan
A slogan contest was held at the Asian Games in 2006 and the winning suggestion was "Be the Legend" (); fitting well with the ideals of athletes reaching their potential and achieving legendary victories. This slogan was submitted by secondary school student Choi Sau-chu (蔡秀珠). The event song is You are the Legend ().
Mascot
"Dony" () and "Ami" (), carrying the motifs of a flaming torch and the Lion Rock, were the mascots of the Games.
Stamps
A set of "Heartwarming Stamps" were released in March and another set was available in August while commemorative stamps were issued on the opening day of the event, 5 December.
Countdowns
One year
The 1 year countdown to the 2009 East Asian games began with Hong Kong Chief executive Donald Tsang inaugurating a special countdown clock in Hong Kong Cultural Centre on 5 December 2008. The ceremony was also attended by chairman of the East Asian Games planning committee Timothy Fok and heads of delegations of the nine countries. The countdown clock is based on the Mascot "Dony". The Cantonese version of the theme song You are the Legend was also performed for the first time by 30 Hong Kong singers including Alan Tam. Representatives of the Hong Kong 18 district councils were also present. For the 300-day countdown, 24 athletes were invited to sing the theme song at the Alan Tam Hacken Lee concert.
200 days
A flower show was opened to the public on 13 May at Victoria Park. The show lasted 10 days featuring 60,000 pots of themed flower. Around 200 organizations from 20 countries participated in the show. The new Tseung Kwan O Sports Ground was opened on 19 May to celebrate the 200 days count down. A relay race was held between the HK police, HK immigration department, Leisure and Cultural department, HK Fire service, Customs and Exercise department, Hong Kong University of Science and Technology and Sai Kung District sports association. There was a dragon and lion dance performance and a tree planting ceremony. A cheerleading competition was also held.
Torch relay
A torch relay was held on August 29 as part of the 100-day Countdown. The relay held the theme "Light the way to the EAG". The torch is a curvy cylinder with a square top and round bottom. It resembles the horn of an ox as 2009 is the year of the Ox. They create the patterns of "Lucky Clouds" to put forward the concept of yin and yang. This also convey the message that Hong Kong is a place where the Chinese and Western cultures meet.
Calendar
In the following calendar for the 2009 East Asian Games, each blue box represents an event competition, such as a qualification round, on that day. The yellow boxes represent days during which medal-awarding finals for a sport were held.
Games
Opening ceremony
State Councilor Liu Yandong graced the official opening ceremony on December 5, which featured an extensive firework display and a large scale music and dance performance at Hong Kong Cultural Centre section of Victoria Harbour. IOC President Jacques Rogge and some IOC members also attended the ceremony. Donald Tsang, Chief Executive of Hong Kong, in his speech said in part: "Through sport, we will celebrate the cultural diversity, friendship and indomitable spirit of our region. Hong Kong extends the hand of friendship to all our guests and visitors." Following this, the torch was brought into Victoria Harbour and the cauldron was lit, signalling the climax of the opening ceremony.
Sports
2009 East Asian Games featured 262 events in 22 sports (including 16 Olympics sports), a new record of East Asian Games history.
Swimming (40)
Diving (10)
†
†
Road Cycling (3)
BMX (2)
Indoor Cycling (5)
†
†
†
†
Taolu (12)
Sanshou (7)
NB: † = Non-Olympic sports
Closing ceremony
The closing ceremony took place on 13 December at Kowloon Hong Kong Coliseum. After the country entrances, the event featured a host of performance art section on stage and the transfer of the East Asian Games flag to the host of the next host Tianjin. Three sections including Color, Flower and Ocean were on display along with a host of international popstars.
Medal table
A total of 262 gold medals are presented in East Asian Games. The following table shows the Final Medal Tally of regions:
Participation
All of the 9 East Asian Games Association (EAGA) that existed as of 2009 participated in the 2009 East Asian Games. China had the largest team, with 474 athletes.
References
External links
Official Site
East Asian Games
E
E
Multi-sport events in Hong Kong
East Asian Games |
Keshabpur () is an upazila of Jessore District in the Division of Khulna, Bangladesh.
Geography
Keshabpur is located at . It has 37,513 individual households and a total area of 258.53 km2. The distance from Jessore City is 32 km.
Keshabpur Upazila of Jessore district has an area of 258.53 km2 and is bounded by Manirampur Upazila to the north,Kapotaksha River, Tala and Dumuria Upazila to the south, Dumuria Upazila to the east, and Kalaroa Upazila and Kapotaksha River to the west. The main rivers are Harihar, Kapotaksha River and Buribhdra.
Demographics
According to the 2011 Bangladesh census, Keshabpur had a population of 253,291. Males constituted 50.00% of the population and females 50.00%. Muslims formed 82.08% of the population, Hindus 17.73%, Christians 0.09% and others 0.10%. Kesabpur had a literacy rate of 55.23% for the population 7 years and above.
According to the 1991 Bangladesh census, Keshabpur had a population of 200,229. Males constituted 51.16% of the population, and females 48.84%. This Upazila's population aged 18 or over was 103,794. Keshabpur has an average literacy rate of 55.5% (in those aged seven and above), while the national average is 68.4%.
Points of interest
Sagardari is a village in the Keshabpur Upazila, built on the bank of the Kopotakho River, where the poet Michael Madhusudan Dutt was born on 25 January 1824. Tourists from all over the world visit "Modhu Palli" and "Modhu Mela", a fair in memory of Modhusudan's Birthday, which is held every year.
Archaeological heritage and relics include remnants of the Bharatvhainabazar Rajbari (দেউলটি গুপ্ত যুগের খ্রিষ্টীয় ২য় শতকে নির্মিত হয়েছে বলে অনুমান করা হয় ), the residence of Nawab Mir Jumla (17th century), the residence of poet Madhusudan Dutt at Sagardari, and remnants of an ancient fort at village Bidhyanandikathi.
There is a memorial to the War of Liberation.
Keshabpur Press Club established in 1978
The Home of Dhiraj Bhattacharya. He was born in a Zamindar family in Panjia village, near Jessore, in British India. His father's name was Lalit Mohan Bhattacharya. He entered Mitra Institution, Kolkata and passed matriculation in 1923. He joined the Ashutosh College to study literature but could not finish his studies. He joined the police service before becoming an actor.
Administration
Keshabpur Police Station was turned into an upazila in 1983.
Keshabpur Upazila is divided into Keshabpur Municipality and eleven union parishads:
Trimohoni
Sagardari
Majidpur
Bidyanandakati
Mongolkot
Keshabpur
Pajia
Sufalakati
Gaurighona
Satbaria and
Hasanpur
The union parishads are subdivided into 142 mauzas and 135 villages.
Keshabpur Municipality is subdivided into 9 wards and 14 mahallas.
The area of the town is 18.46 km2. The town has a population of 26,229, male 13,141, female 13,088. Population density is 1121 per km2. The literacy rate within the town is 32.9%.
Education
Educational institutions: college 5, high school 32, madrasa 97, government primary school 70, non-government primary school 85. Noted educational institutions:
Govt. Keshabpur College
Keshabpur Govt. Pilot School & College
Haji Abdul Motaleb Womens College, Keshabpur
Keshabpur Girl's Pilot School
Sagardari Michael Madhusadan Institution
Sagardari A. S. K. Abu Sharab Sadik vocational and Commerce College
A. S K Abu Sharab Sadik Govt Technical School, Sagardari
Sagardari Alim Madrasa
Mehepur Dakil Madrasa
Meherpur govt primary school
Gobindapur Govt primary school
M. M. Gobindapur High School
Panjia High School
Panjia Degree College
Biddyanandkati Rasbihari Institution
Narayanpur High School
Batikhula Dakil Madrasha
Batikhula Primary School
Mongolkote High School
Shikarpur Secondary High School.
References
External links
Upazila Administration
Upazilas of Jessore District
Jashore District
Khulna Division |
```xml
import { ReactElement } from 'react';
import { FeatureList, HeroGradient, IFeatureListProps } from '@theguild/components';
import flask from '../../public/assets/flask.svg';
import graphql from '../../public/assets/graphql.svg';
import needle from '../../public/assets/needle.svg';
const FEATURE_LIST: IFeatureListProps['items'] = [
{
title: 'GraphQL-First Philosophy',
description:
'Use the GraphQL schema definition language to generate a schema with full support for resolvers, interfaces, unions, and custom scalars.',
image: {
src: graphql,
alt: '',
loading: 'eager',
placeholder: 'empty',
},
link: {
children: 'Learn more',
href: '/docs/introduction#the-graphql-first-philosophy',
},
},
{
title: 'Mock Your GraphQL API',
description:
'With GraphQL Tools, you can mock your GraphQL API with fine-grained per-type mocking for fast prototyping without any datasources.',
image: {
src: flask,
alt: '',
loading: 'eager',
placeholder: 'empty',
},
link: {
children: 'Learn more',
href: '/docs/mocking',
},
},
{
title: 'Stitch Multiple Schemas',
description:
'Automatically stitch multiple schemas together into one larger API in a simple, fast and powerful way.',
image: {
src: needle,
alt: '',
loading: 'eager',
placeholder: 'empty',
},
link: {
children: 'Learn more',
href: 'path_to_url
},
},
];
export function IndexPage(): ReactElement {
return (
<>
<HeroGradient
title="A Set of Utilities for Faster Development of GraphQL Schemas"
description="GraphQL Tools is a set of NPM packages and an opinionated structure for how to build a GraphQL schema and resolvers in JavaScript, following the GraphQL-first development workflow."
link={{
children: 'Get Started',
title: 'Learn more about GraphQL Tools',
href: '/docs/introduction',
}}
colors={['#000246', '#184BE6']}
/>
<FeatureList items={FEATURE_LIST} className="[&_h3]:mt-6" />
</>
);
}
``` |
Bangladesh–Kazakhstan relations refer to the bilateral relations between Bangladesh and Kazakhstan. The Bangladeshi President Iajuddin Ahmed said that the two countries enjoy cordial diplomatic relations and are working towards strengthen it further. Both the countries are members of Organisation of Islamic Cooperation. Neither country has a resident ambassador. In 2009, Kazakhstan announced it intended to open a consulate in Dhaka.
High level visits
Former foreign minister of Bangladesh Dipu Moni paid a visit to Nur-Sultan in 2012.
Economic cooperation
Both Bangladesh and Kazakhstan are keen to expand the bilateral trade and have been undertaking various measures in this regard. Bangladeshi products including jute, jute goods, tea, medicine and garments have been identified as products with high potential in Kazakhstani market. In 2008, the two countries formed joint economic commission to increase the economic activities between the two countries. In 2012, Bangladesh was granted duty-free access to Kazakhstan's market. In 2013, a high level business delegation from Bangladesh, led by former commerce secretary Mahbub Ahmed, paid a visit to Kazakhstan to explore ways for increasing bilateral trade.
References
Kazakhstan
Bilateral relations of Kazakhstan |
Sabalia fulleborni is a moth in the family Brahmaeidae (older classifications placed it in Lemoniidae). It was described by Ferdinand Karsch in 1900.
References
Brahmaeidae
Moths described in 1900 |
Wierzawice is a village in the administrative district of Gmina Leżajsk, within Leżajsk County, Subcarpathian Voivodeship, in south-eastern Poland. It lies approximately south-east of Leżajsk and north-east of the regional capital Rzeszów.
References
Wierzawice |
Philip Horne (born 1957) is a teacher and literary critic specializing in 19th century literature, particularly Henry James and Charles Dickens. Educated at King's College School and Cambridge University, he is currently Professor of English at University College London.
Horne has authored or edited a number of book about Henry James. In 1990 he published Henry James and Revision: The New York Edition, a careful study of the extensive revisions James made in his novels and tales for the many-volumed but ill-fated New York Edition (1907-1909). He published a related article, Henry James at Work: The Question of Our Texts, as part of the 1998 collection of essays, The Cambridge Companion to Henry James edited by Jonathan Freedman. Horne generally favors the late revisions that James made in his fiction, and in his Cambridge Companion essay he emphasizes the importance for the critic of complete acquaintance with the various texts of a James novel or tale:
The serious critic of a fiction by James not only needs to know about its main recent critics, I would argue, but also its early critical history, its critical reception, and James' own remarks about it in the Prefaces and letters. As I have suggested, James's revisions and adaptations can be seen as part of the critical dossier.
Horne has edited two editions of James' works: A London Life and The Reverberator (1989) and The Tragic Muse (1995). Not surprisingly he used the New York Edition texts for all these works, and he included extensive textual notes. Horne has also published an epistolary biography of James, Henry James: A Life in Letters (1999). The book used 296 of James' letters as the framework for a biography that concentrated on the novelist's professional career. Approximately half the letters were previously unpublished. As usual, Horne wrote thorough textual notes on the letters.
Horne published an edition of Oliver Twist in 2003, and has written on such varied topics as telephones and literature, zombies and consumer culture, and the texts of Emily Dickinson. His research interests include the films of Alfred Hitchcock and Martin Scorsese, and publishing history.
References
A London Life and The Reverberator by Henry James, edited by Philip Horne, Oxford University Press 1989
The Tragic Muse by Henry James, edited by Philip Horne, Penguin Classics 1995
The Cambridge Companion to Henry James edited by Jonathan Freedman, Cambridge University Press 1998
Henry James: A Life in Letters edited by Philip Horne, Viking Adult 1999
External links
Philip Horne's page at the University College London web site
Henry James and the Masks of Life by Philip Horne
Philip Horne discusses British film director Thorold Dickinson
Philip Horne's review of David Lodge's novel about Henry James, Author, Author
Philip Horne's interview with Ruth Prawer Jhabvala on the film version of The Golden Bowl
English literary critics
People educated at King's College School, London
Living people
Alumni of the University of Cambridge
Academics of University College London
1957 births |
```java
/*
* 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, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package org.apache.beam.runners.twister2;
import com.fasterxml.jackson.annotation.JsonIgnore;
import edu.iu.dsc.tws.tset.env.TSetEnvironment;
import org.apache.beam.sdk.options.Default;
import org.apache.beam.sdk.options.Description;
import org.apache.beam.sdk.options.FileStagingOptions;
import org.apache.beam.sdk.options.PipelineOptions;
import org.apache.beam.sdk.options.StreamingOptions;
/** Twister2PipelineOptions. */
public interface Twister2PipelineOptions
extends PipelineOptions, StreamingOptions, FileStagingOptions {
@Description("set parallelism for Twister2 processor")
@Default.Integer(1)
int getParallelism();
void setParallelism(int parallelism);
@Description("Twister2 TSetEnvironment")
@JsonIgnore
TSetEnvironment getTSetEnvironment();
void setTSetEnvironment(TSetEnvironment environment);
@Description("Twister2 cluster type, supported types: standalone, nomad, kubernetes, mesos")
@Default.String("standalone")
String getClusterType();
void setClusterType(String name);
@Description("Job file zip")
String getJobFileZip();
void setJobFileZip(String pathToZip);
@Description("Job type, jar or java_zip")
@Default.String("java_zip")
String getJobType();
void setJobType(String jobType);
@Description("Twister2 home directory")
String getTwister2Home();
void setTwister2Home(String twister2Home);
@Description("CPU's per worker")
@Default.Integer(2)
int getWorkerCPUs();
void setWorkerCPUs(int workerCPUs);
@Description("RAM allocated per worker")
@Default.Integer(2048)
int getRamMegaBytes();
void setRamMegaBytes(int ramMegaBytes);
}
``` |
All of the 55 Councillor seats for Suffolk Coastal were up for election on Thursday 3 May 2007. This was held on the same day as other local council elections across England.
Overall election result
References
Suffolk Coastal District Council elections |
Anna () is a South Korean web series, written and directed by Lee Joo-young, and starring Bae Suzy in the title role, along with Jung Eun-chae, Kim Jun-han, and Park Ye-young. It premiered on Coupang Play, on June 24, 2022.
Synopsis
The series tells the story of a woman who lives a completely different life starting with a small lie.
Cast
Main
Bae Suzy as Lee Yumi / Lee Anna
Kim Soo-in as 14-year-old Yumi
Choi So-yul as 6-year-old Yumi
A woman who loses her true identity and starts living a new, unpredictable life under a new name because of a minor lie that she made up.
Jung Eun-chae as Lee Hyeon-ju
Yumi's former boss. Born in to wealthy family, she runs a gallery owned by her father where Yumi was a terminal employee.
Kim Jun-han as Choi Ji-hoon
Yumi's husband. An ambitious, goal-oriented man. He is the CEO of a promising venture company, his own business he started at a young age.
Park Ye-young as Ji-won
Yumi's only confidante. A senior in the editorial department of a university school magazine.
Supporting
Kim Jung-young as Hong-joo
Yumi's deaf mother.
Choi Yong-jin as Lee Sang-ho
Yumi's father, a tailor.
Heo Hyeong-gyu as Kang Jae-ho
A college student Yumi dated while she was pretending to be a college student.
Woo Ji-hyun as Seon-woo
An employee at a restaurant owned by Hyeon-ju.
Kim Soo-jin as Chief Kim
An employee at Hyeon-ju's company who took care of Yumi.
Oh Man-seok as Mr. Lee
Hyeon-ju's father and owner of the gallery where Yumi worked.
Baek Ji-won as Hyeon-ju's mother
The director of the gallery where Yumi worked.
Yoon Ji-min as Professor Yoon
Hong Hee-won as Secretary Jung
Chu Kwi-jung as Jae-Ho's mother
Jang Ha-eun as Narae, student at Yale University.
Lee Je-yeon as Music teacher
Park Soo-yeon as Secretary Cho Yu-mi
Production
Filming of the series began on October 15, 2021 and concluded on March 23, 2022.
Controversy
On August 2, 2022, director Lee Joo-young accused Coupang Play for making major edits to the series without her consent. Though the final version of the series submitted by Lee was consisted of 8 episodes (45–61 minutes per episode), the series which premiered on July 24 consisted of 6 episodes (45–63 minutes per episode). Lee had requested to remove her name in the credits for director and screenplay, but that was ignored.
In a statement a day later, Coupang Play explained that they found that the director's editing was significantly different from what was initially agreed with them but when they requested multiple times to edit according to what was agreed, director refused it. Hence Coupang Play edited the work to match the original production intent, with the consent of the producer and in accordance with the rights stipulated in the contract. However, director Lee's side stated that she neither received request for corrections nor has she refused to do so. Further more, both Lee and editor Kim Jung-hoon claimed that they never received any opinions regarding editing from Coupang Play.
Previously on July 8, Coupang Play had announced to release a extended version of the series in August. Amidst the controversy, it was revealed to be the director’s cut which consists of 8 episodes. It was released on August 12.
Accolades
References
External links
Anna at Daum
Korean-language television shows
2022 web series debuts
2022 web series endings
South Korean drama web series
South Korean web series
South Korean pre-produced television series
Television shows based on South Korean novels
Psychological thriller television series
South Korean thriller television series |
```go
// All rights reserved.
package pull
import (
"bufio"
"context"
"fmt"
"io"
"os"
"path/filepath"
"strings"
"code.gitea.io/gitea/models"
git_model "code.gitea.io/gitea/models/git"
issues_model "code.gitea.io/gitea/models/issues"
"code.gitea.io/gitea/models/unit"
"code.gitea.io/gitea/modules/container"
"code.gitea.io/gitea/modules/git"
"code.gitea.io/gitea/modules/gitrepo"
"code.gitea.io/gitea/modules/graceful"
"code.gitea.io/gitea/modules/log"
"code.gitea.io/gitea/modules/process"
"code.gitea.io/gitea/modules/setting"
"code.gitea.io/gitea/modules/util"
"github.com/gobwas/glob"
)
// DownloadDiffOrPatch will write the patch for the pr to the writer
func DownloadDiffOrPatch(ctx context.Context, pr *issues_model.PullRequest, w io.Writer, patch, binary bool) error {
if err := pr.LoadBaseRepo(ctx); err != nil {
log.Error("Unable to load base repository ID %d for pr #%d [%d]", pr.BaseRepoID, pr.Index, pr.ID)
return err
}
gitRepo, closer, err := gitrepo.RepositoryFromContextOrOpen(ctx, pr.BaseRepo)
if err != nil {
return fmt.Errorf("OpenRepository: %w", err)
}
defer closer.Close()
if err := gitRepo.GetDiffOrPatch(pr.MergeBase, pr.GetGitRefName(), w, patch, binary); err != nil {
log.Error("Unable to get patch file from %s to %s in %s Error: %v", pr.MergeBase, pr.HeadBranch, pr.BaseRepo.FullName(), err)
return fmt.Errorf("Unable to get patch file from %s to %s in %s Error: %w", pr.MergeBase, pr.HeadBranch, pr.BaseRepo.FullName(), err)
}
return nil
}
var patchErrorSuffices = []string{
": already exists in index",
": patch does not apply",
": already exists in working directory",
"unrecognized input",
": No such file or directory",
": does not exist in index",
}
// TestPatch will test whether a simple patch will apply
func TestPatch(pr *issues_model.PullRequest) error {
ctx, _, finished := process.GetManager().AddContext(graceful.GetManager().HammerContext(), fmt.Sprintf("TestPatch: %s", pr))
defer finished()
prCtx, cancel, err := createTemporaryRepoForPR(ctx, pr)
if err != nil {
if !git_model.IsErrBranchNotExist(err) {
log.Error("CreateTemporaryRepoForPR %-v: %v", pr, err)
}
return err
}
defer cancel()
return testPatch(ctx, prCtx, pr)
}
func testPatch(ctx context.Context, prCtx *prContext, pr *issues_model.PullRequest) error {
gitRepo, err := git.OpenRepository(ctx, prCtx.tmpBasePath)
if err != nil {
return fmt.Errorf("OpenRepository: %w", err)
}
defer gitRepo.Close()
// 1. update merge base
pr.MergeBase, _, err = git.NewCommand(ctx, "merge-base", "--", "base", "tracking").RunStdString(&git.RunOpts{Dir: prCtx.tmpBasePath})
if err != nil {
var err2 error
pr.MergeBase, err2 = gitRepo.GetRefCommitID(git.BranchPrefix + "base")
if err2 != nil {
return fmt.Errorf("GetMergeBase: %v and can't find commit ID for base: %w", err, err2)
}
}
pr.MergeBase = strings.TrimSpace(pr.MergeBase)
if pr.HeadCommitID, err = gitRepo.GetRefCommitID(git.BranchPrefix + "tracking"); err != nil {
return fmt.Errorf("GetBranchCommitID: can't find commit ID for head: %w", err)
}
if pr.HeadCommitID == pr.MergeBase {
pr.Status = issues_model.PullRequestStatusAncestor
return nil
}
// 2. Check for conflicts
if conflicts, err := checkConflicts(ctx, pr, gitRepo, prCtx.tmpBasePath); err != nil || conflicts || pr.Status == issues_model.PullRequestStatusEmpty {
return err
}
// 3. Check for protected files changes
if err = checkPullFilesProtection(ctx, pr, gitRepo); err != nil {
return fmt.Errorf("pr.CheckPullFilesProtection(): %v", err)
}
if len(pr.ChangedProtectedFiles) > 0 {
log.Trace("Found %d protected files changed", len(pr.ChangedProtectedFiles))
}
pr.Status = issues_model.PullRequestStatusMergeable
return nil
}
type errMergeConflict struct {
filename string
}
func (e *errMergeConflict) Error() string {
return fmt.Sprintf("conflict detected at: %s", e.filename)
}
func attemptMerge(ctx context.Context, file *unmergedFile, tmpBasePath string, filesToRemove *[]string, filesToAdd *[]git.IndexObjectInfo) error {
log.Trace("Attempt to merge:\n%v", file)
switch {
case file.stage1 != nil && (file.stage2 == nil || file.stage3 == nil):
// 1. Deleted in one or both:
//
// Conflict <==> the stage1 !SameAs to the undeleted one
if (file.stage2 != nil && !file.stage1.SameAs(file.stage2)) || (file.stage3 != nil && !file.stage1.SameAs(file.stage3)) {
// Conflict!
return &errMergeConflict{file.stage1.path}
}
// Not a genuine conflict and we can simply remove the file from the index
*filesToRemove = append(*filesToRemove, file.stage1.path)
return nil
case file.stage1 == nil && file.stage2 != nil && (file.stage3 == nil || file.stage2.SameAs(file.stage3)):
// 2. Added in ours but not in theirs or identical in both
//
// Not a genuine conflict just add to the index
*filesToAdd = append(*filesToAdd, git.IndexObjectInfo{Mode: file.stage2.mode, Object: git.MustIDFromString(file.stage2.sha), Filename: file.stage2.path})
return nil
case file.stage1 == nil && file.stage2 != nil && file.stage3 != nil && file.stage2.sha == file.stage3.sha && file.stage2.mode != file.stage3.mode:
// 3. Added in both with the same sha but the modes are different
//
// Conflict! (Not sure that this can actually happen but we should handle)
return &errMergeConflict{file.stage2.path}
case file.stage1 == nil && file.stage2 == nil && file.stage3 != nil:
// 4. Added in theirs but not ours:
//
// Not a genuine conflict just add to the index
*filesToAdd = append(*filesToAdd, git.IndexObjectInfo{Mode: file.stage3.mode, Object: git.MustIDFromString(file.stage3.sha), Filename: file.stage3.path})
return nil
case file.stage1 == nil:
// 5. Created by new in both
//
// Conflict!
return &errMergeConflict{file.stage2.path}
case file.stage2 != nil && file.stage3 != nil:
// 5. Modified in both - we should try to merge in the changes but first:
//
if file.stage2.mode == "120000" || file.stage3.mode == "120000" {
// 5a. Conflicting symbolic link change
return &errMergeConflict{file.stage2.path}
}
if file.stage2.mode == "160000" || file.stage3.mode == "160000" {
// 5b. Conflicting submodule change
return &errMergeConflict{file.stage2.path}
}
if file.stage2.mode != file.stage3.mode {
// 5c. Conflicting mode change
return &errMergeConflict{file.stage2.path}
}
// Need to get the objects from the object db to attempt to merge
root, _, err := git.NewCommand(ctx, "unpack-file").AddDynamicArguments(file.stage1.sha).RunStdString(&git.RunOpts{Dir: tmpBasePath})
if err != nil {
return fmt.Errorf("unable to get root object: %s at path: %s for merging. Error: %w", file.stage1.sha, file.stage1.path, err)
}
root = strings.TrimSpace(root)
defer func() {
_ = util.Remove(filepath.Join(tmpBasePath, root))
}()
base, _, err := git.NewCommand(ctx, "unpack-file").AddDynamicArguments(file.stage2.sha).RunStdString(&git.RunOpts{Dir: tmpBasePath})
if err != nil {
return fmt.Errorf("unable to get base object: %s at path: %s for merging. Error: %w", file.stage2.sha, file.stage2.path, err)
}
base = strings.TrimSpace(filepath.Join(tmpBasePath, base))
defer func() {
_ = util.Remove(base)
}()
head, _, err := git.NewCommand(ctx, "unpack-file").AddDynamicArguments(file.stage3.sha).RunStdString(&git.RunOpts{Dir: tmpBasePath})
if err != nil {
return fmt.Errorf("unable to get head object:%s at path: %s for merging. Error: %w", file.stage3.sha, file.stage3.path, err)
}
head = strings.TrimSpace(head)
defer func() {
_ = util.Remove(filepath.Join(tmpBasePath, head))
}()
// now git merge-file annoyingly takes a different order to the merge-tree ...
_, _, conflictErr := git.NewCommand(ctx, "merge-file").AddDynamicArguments(base, root, head).RunStdString(&git.RunOpts{Dir: tmpBasePath})
if conflictErr != nil {
return &errMergeConflict{file.stage2.path}
}
// base now contains the merged data
hash, _, err := git.NewCommand(ctx, "hash-object", "-w", "--path").AddDynamicArguments(file.stage2.path, base).RunStdString(&git.RunOpts{Dir: tmpBasePath})
if err != nil {
return err
}
hash = strings.TrimSpace(hash)
*filesToAdd = append(*filesToAdd, git.IndexObjectInfo{Mode: file.stage2.mode, Object: git.MustIDFromString(hash), Filename: file.stage2.path})
return nil
default:
if file.stage1 != nil {
return &errMergeConflict{file.stage1.path}
} else if file.stage2 != nil {
return &errMergeConflict{file.stage2.path}
} else if file.stage3 != nil {
return &errMergeConflict{file.stage3.path}
}
}
return nil
}
// AttemptThreeWayMerge will attempt to three way merge using git read-tree and then follow the git merge-one-file algorithm to attempt to resolve basic conflicts
func AttemptThreeWayMerge(ctx context.Context, gitPath string, gitRepo *git.Repository, base, ours, theirs, description string) (bool, []string, error) {
ctx, cancel := context.WithCancel(ctx)
defer cancel()
// First we use read-tree to do a simple three-way merge
if _, _, err := git.NewCommand(ctx, "read-tree", "-m").AddDynamicArguments(base, ours, theirs).RunStdString(&git.RunOpts{Dir: gitPath}); err != nil {
log.Error("Unable to run read-tree -m! Error: %v", err)
return false, nil, fmt.Errorf("unable to run read-tree -m! Error: %w", err)
}
var filesToRemove []string
var filesToAdd []git.IndexObjectInfo
// Then we use git ls-files -u to list the unmerged files and collate the triples in unmergedfiles
unmerged := make(chan *unmergedFile)
go unmergedFiles(ctx, gitPath, unmerged)
defer func() {
cancel()
for range unmerged {
// empty the unmerged channel
}
}()
numberOfConflicts := 0
conflict := false
conflictedFiles := make([]string, 0, 5)
for file := range unmerged {
if file == nil {
break
}
if file.err != nil {
cancel()
return false, nil, file.err
}
// OK now we have the unmerged file triplet attempt to merge it
if err := attemptMerge(ctx, file, gitPath, &filesToRemove, &filesToAdd); err != nil {
if conflictErr, ok := err.(*errMergeConflict); ok {
log.Trace("Conflict: %s in %s", conflictErr.filename, description)
conflict = true
if numberOfConflicts < 10 {
conflictedFiles = append(conflictedFiles, conflictErr.filename)
}
numberOfConflicts++
continue
}
return false, nil, err
}
}
// Add and remove files in one command, as this is slow with many files otherwise
if err := gitRepo.RemoveFilesFromIndex(filesToRemove...); err != nil {
return false, nil, err
}
if err := gitRepo.AddObjectsToIndex(filesToAdd...); err != nil {
return false, nil, err
}
return conflict, conflictedFiles, nil
}
func checkConflicts(ctx context.Context, pr *issues_model.PullRequest, gitRepo *git.Repository, tmpBasePath string) (bool, error) {
// 1. checkConflicts resets the conflict status - therefore - reset the conflict status
pr.ConflictedFiles = nil
// 2. AttemptThreeWayMerge first - this is much quicker than plain patch to base
description := fmt.Sprintf("PR[%d] %s/%s#%d", pr.ID, pr.BaseRepo.OwnerName, pr.BaseRepo.Name, pr.Index)
conflict, conflictFiles, err := AttemptThreeWayMerge(ctx,
tmpBasePath, gitRepo, pr.MergeBase, "base", "tracking", description)
if err != nil {
return false, err
}
if !conflict {
// No conflicts detected so we need to check if the patch is empty...
// a. Write the newly merged tree and check the new tree-hash
var treeHash string
treeHash, _, err = git.NewCommand(ctx, "write-tree").RunStdString(&git.RunOpts{Dir: tmpBasePath})
if err != nil {
lsfiles, _, _ := git.NewCommand(ctx, "ls-files", "-u").RunStdString(&git.RunOpts{Dir: tmpBasePath})
return false, fmt.Errorf("unable to write unconflicted tree: %w\n`git ls-files -u`:\n%s", err, lsfiles)
}
treeHash = strings.TrimSpace(treeHash)
baseTree, err := gitRepo.GetTree("base")
if err != nil {
return false, err
}
// b. compare the new tree-hash with the base tree hash
if treeHash == baseTree.ID.String() {
log.Debug("PullRequest[%d]: Patch is empty - ignoring", pr.ID)
pr.Status = issues_model.PullRequestStatusEmpty
}
return false, nil
}
// 3. OK the three-way merge method has detected conflicts
// 3a. Are still testing with GitApply? If not set the conflict status and move on
if !setting.Repository.PullRequest.TestConflictingPatchesWithGitApply {
pr.Status = issues_model.PullRequestStatusConflict
pr.ConflictedFiles = conflictFiles
log.Trace("Found %d files conflicted: %v", len(pr.ConflictedFiles), pr.ConflictedFiles)
return true, nil
}
// 3b. Create a plain patch from head to base
tmpPatchFile, err := os.CreateTemp("", "patch")
if err != nil {
log.Error("Unable to create temporary patch file! Error: %v", err)
return false, fmt.Errorf("unable to create temporary patch file! Error: %w", err)
}
defer func() {
_ = util.Remove(tmpPatchFile.Name())
}()
if err := gitRepo.GetDiffBinary(pr.MergeBase, "tracking", tmpPatchFile); err != nil {
tmpPatchFile.Close()
log.Error("Unable to get patch file from %s to %s in %s Error: %v", pr.MergeBase, pr.HeadBranch, pr.BaseRepo.FullName(), err)
return false, fmt.Errorf("unable to get patch file from %s to %s in %s Error: %w", pr.MergeBase, pr.HeadBranch, pr.BaseRepo.FullName(), err)
}
stat, err := tmpPatchFile.Stat()
if err != nil {
tmpPatchFile.Close()
return false, fmt.Errorf("unable to stat patch file: %w", err)
}
patchPath := tmpPatchFile.Name()
tmpPatchFile.Close()
// 3c. if the size of that patch is 0 - there can be no conflicts!
if stat.Size() == 0 {
log.Debug("PullRequest[%d]: Patch is empty - ignoring", pr.ID)
pr.Status = issues_model.PullRequestStatusEmpty
return false, nil
}
log.Trace("PullRequest[%d].testPatch (patchPath): %s", pr.ID, patchPath)
// 4. Read the base branch in to the index of the temporary repository
_, _, err = git.NewCommand(gitRepo.Ctx, "read-tree", "base").RunStdString(&git.RunOpts{Dir: tmpBasePath})
if err != nil {
return false, fmt.Errorf("git read-tree %s: %w", pr.BaseBranch, err)
}
// 5. Now get the pull request configuration to check if we need to ignore whitespace
prUnit, err := pr.BaseRepo.GetUnit(ctx, unit.TypePullRequests)
if err != nil {
return false, err
}
prConfig := prUnit.PullRequestsConfig()
// 6. Prepare the arguments to apply the patch against the index
cmdApply := git.NewCommand(gitRepo.Ctx, "apply", "--check", "--cached")
if prConfig.IgnoreWhitespaceConflicts {
cmdApply.AddArguments("--ignore-whitespace")
}
is3way := false
if git.DefaultFeatures().CheckVersionAtLeast("2.32.0") {
cmdApply.AddArguments("--3way")
is3way = true
}
cmdApply.AddDynamicArguments(patchPath)
// 7. Prep the pipe:
// - Here we could do the equivalent of:
// `git apply --check --cached patch_file > conflicts`
// Then iterate through the conflicts. However, that means storing all the conflicts
// in memory - which is very wasteful.
// - alternatively we can do the equivalent of:
// `git apply --check ... | grep ...`
// meaning we don't store all of the conflicts unnecessarily.
stderrReader, stderrWriter, err := os.Pipe()
if err != nil {
log.Error("Unable to open stderr pipe: %v", err)
return false, fmt.Errorf("unable to open stderr pipe: %w", err)
}
defer func() {
_ = stderrReader.Close()
_ = stderrWriter.Close()
}()
// 8. Run the check command
conflict = false
err = cmdApply.Run(&git.RunOpts{
Dir: tmpBasePath,
Stderr: stderrWriter,
PipelineFunc: func(ctx context.Context, cancel context.CancelFunc) error {
// Close the writer end of the pipe to begin processing
_ = stderrWriter.Close()
defer func() {
// Close the reader on return to terminate the git command if necessary
_ = stderrReader.Close()
}()
const prefix = "error: patch failed:"
const errorPrefix = "error: "
const threewayFailed = "Failed to perform three-way merge..."
const appliedPatchPrefix = "Applied patch to '"
const withConflicts = "' with conflicts."
conflicts := make(container.Set[string])
// Now scan the output from the command
scanner := bufio.NewScanner(stderrReader)
for scanner.Scan() {
line := scanner.Text()
log.Trace("PullRequest[%d].testPatch: stderr: %s", pr.ID, line)
if strings.HasPrefix(line, prefix) {
conflict = true
filepath := strings.TrimSpace(strings.Split(line[len(prefix):], ":")[0])
conflicts.Add(filepath)
} else if is3way && line == threewayFailed {
conflict = true
} else if strings.HasPrefix(line, errorPrefix) {
conflict = true
for _, suffix := range patchErrorSuffices {
if strings.HasSuffix(line, suffix) {
filepath := strings.TrimSpace(strings.TrimSuffix(line[len(errorPrefix):], suffix))
if filepath != "" {
conflicts.Add(filepath)
}
break
}
}
} else if is3way && strings.HasPrefix(line, appliedPatchPrefix) && strings.HasSuffix(line, withConflicts) {
conflict = true
filepath := strings.TrimPrefix(strings.TrimSuffix(line, withConflicts), appliedPatchPrefix)
if filepath != "" {
conflicts.Add(filepath)
}
}
// only list 10 conflicted files
if len(conflicts) >= 10 {
break
}
}
if len(conflicts) > 0 {
pr.ConflictedFiles = make([]string, 0, len(conflicts))
for key := range conflicts {
pr.ConflictedFiles = append(pr.ConflictedFiles, key)
}
}
return nil
},
})
// 9. Check if the found conflictedfiles is non-zero, "err" could be non-nil, so we should ignore it if we found conflicts.
// Note: `"err" could be non-nil` is due that if enable 3-way merge, it doesn't return any error on found conflicts.
if len(pr.ConflictedFiles) > 0 {
if conflict {
pr.Status = issues_model.PullRequestStatusConflict
log.Trace("Found %d files conflicted: %v", len(pr.ConflictedFiles), pr.ConflictedFiles)
return true, nil
}
} else if err != nil {
return false, fmt.Errorf("git apply --check: %w", err)
}
return false, nil
}
// CheckFileProtection check file Protection
func CheckFileProtection(repo *git.Repository, branchName, oldCommitID, newCommitID string, patterns []glob.Glob, limit int, env []string) ([]string, error) {
if len(patterns) == 0 {
return nil, nil
}
affectedFiles, err := git.GetAffectedFiles(repo, branchName, oldCommitID, newCommitID, env)
if err != nil {
return nil, err
}
changedProtectedFiles := make([]string, 0, limit)
for _, affectedFile := range affectedFiles {
lpath := strings.ToLower(affectedFile)
for _, pat := range patterns {
if pat.Match(lpath) {
changedProtectedFiles = append(changedProtectedFiles, lpath)
break
}
}
if len(changedProtectedFiles) >= limit {
break
}
}
if len(changedProtectedFiles) > 0 {
err = models.ErrFilePathProtected{
Path: changedProtectedFiles[0],
}
}
return changedProtectedFiles, err
}
// CheckUnprotectedFiles check if the commit only touches unprotected files
func CheckUnprotectedFiles(repo *git.Repository, branchName, oldCommitID, newCommitID string, patterns []glob.Glob, env []string) (bool, error) {
if len(patterns) == 0 {
return false, nil
}
affectedFiles, err := git.GetAffectedFiles(repo, branchName, oldCommitID, newCommitID, env)
if err != nil {
return false, err
}
for _, affectedFile := range affectedFiles {
lpath := strings.ToLower(affectedFile)
unprotected := false
for _, pat := range patterns {
if pat.Match(lpath) {
unprotected = true
break
}
}
if !unprotected {
return false, nil
}
}
return true, nil
}
// checkPullFilesProtection check if pr changed protected files and save results
func checkPullFilesProtection(ctx context.Context, pr *issues_model.PullRequest, gitRepo *git.Repository) error {
if pr.Status == issues_model.PullRequestStatusEmpty {
pr.ChangedProtectedFiles = nil
return nil
}
pb, err := git_model.GetFirstMatchProtectedBranchRule(ctx, pr.BaseRepoID, pr.BaseBranch)
if err != nil {
return err
}
if pb == nil {
pr.ChangedProtectedFiles = nil
return nil
}
pr.ChangedProtectedFiles, err = CheckFileProtection(gitRepo, pr.HeadBranch, pr.MergeBase, "tracking", pb.GetProtectedFilePatterns(), 10, os.Environ())
if err != nil && !models.IsErrFilePathProtected(err) {
return err
}
return nil
}
``` |
```c++
/*
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*/
#include "Model.h"
#include "AnonymousClassMergingPass.h"
#include "ClassMerging.h"
#include "ConfigFiles.h"
#include "ConfigUtils.h"
#include "InterDexGrouping.h"
#include "MergingStrategies.h"
#include "ModelSpecGenerator.h"
#include "PassManager.h"
namespace class_merging {
void AnonymousClassMergingPass::bind_config() {
std::vector<std::string> excl_names;
bind("exclude",
{},
excl_names,
"Do not merge the classes or its implementors");
utils::load_types_and_prefixes(excl_names, m_merging_spec.exclude_types,
m_merging_spec.exclude_prefixes);
bind("include_primary_dex", false, m_merging_spec.include_primary_dex);
bind("global_min_count",
500,
m_global_min_count,
"Ignore interface or class hierarchies with less than "
"global_min_count implementors or subclasses");
bind("min_count",
2,
m_min_count,
"Minimum mergeable class count per merging group");
bind("max_count",
50,
m_max_count,
"Maximum mergeable class count per merging group");
bind("use_stable_shape_names", false, m_merging_spec.use_stable_shape_names);
std::string interdex_grouping;
bind("interdex_grouping", "non-ordered-set", interdex_grouping);
// Inferring_mode is "class-loads" by default.
m_merging_spec.interdex_config.init_type(interdex_grouping);
}
void AnonymousClassMergingPass::run_pass(DexStoresVector& stores,
ConfigFiles& conf,
PassManager& mgr) {
// Fill the merging configurations.
m_merging_spec.name = "Anonymous Classes";
m_merging_spec.class_name_prefix = "Anon";
m_merging_spec.strategy = strategy::BY_REFS;
if (conf.force_single_dex() ||
(!stores.empty() && stores[0].num_dexes() == 1)) {
m_merging_spec.include_primary_dex = true;
}
m_merging_spec.dedup_fill_in_stack_trace = false;
m_merging_spec.min_count = m_min_count;
if (m_max_count > 0) {
m_merging_spec.max_count = m_max_count;
}
auto scope = build_class_scope(stores);
TypeSystem type_system(scope);
find_all_mergeables_and_roots(type_system, scope, m_global_min_count, mgr,
&m_merging_spec);
if (!m_merging_spec.roots.empty()) {
class_merging::merge_model(scope, conf, mgr, stores, m_merging_spec);
post_dexen_changes(scope, stores);
} else {
TRACE(CLMG, 2, "No enough anonymous classes to merge");
}
}
static AnonymousClassMergingPass s_pass;
} // namespace class_merging
``` |
Teunis Mulder may refer to:
Teun Mulder (born 1981), Dutch track cyclist
Tony Mulder (born 1955), Dutch-born Australian politician
See also
Mulder (surname) |
```scss
$avatar-base-size: 30;
.initials {
font-weight: bold;
font-size: ceil(calc($avatar-base-size / 2 - 2))+px;
}
$avatarSizes: "xs" .75, "sm" 1.25, "md" 1.5, "lg" 2;
@each $avatarSizeName, $avatarBaseSize in $avatarSizes {
.avatar-#{$avatarSizeName} {
width: ceil(calc($avatar-base-size * $avatarBaseSize))+px;
height: ceil(calc($avatar-base-size * $avatarBaseSize))+px;
.initials {
font-size: ceil(calc($avatar-base-size * $avatarBaseSize / 2 - 2))+px;
}
}
}
.widget-user-image {
border-radius: 50%;
border: 3px solid #fff;
.avatar {
width: ceil(calc($avatar-base-size * 2.75))+px;
height: ceil(calc($avatar-base-size * 2.75))+px;
.initials {
font-size: ceil(calc($avatar-base-size * 2.75 / 2 - 2))+px;
}
}
}
/* Detail tables like my teams (Dashboard) or */
table.dataTable.table > tbody > tr > td {
&.avatars {
.avatar {
margin: 1px;
}
}
}
/* decreases the margin between avatars, see path_to_url */
.avatar-list-stacked .avatar {
margin-right: calc(var(--tblr-avatar-size)*-.2)!important;
}
``` |
Kamakou () is a shield volcano on the island of Molokai, at . It is part of the extinct East Molokai shield volcano, which comprises the east side of the island.
Kamakou is located within the Molokai Forest Reserve, estimated to contain more than 250 rare native Hawaiian plants, many of which exist only in this part of the world. Rare birds can also be found, with two examples being the olomaʻo (Molokai thrush) and kākāwahie (Molokai creeper). Monthly tours are held by The Nature Conservancy.
See also
List of mountain peaks of the United States
List of volcanoes of the United States
List of mountain peaks of Hawaii
List of Ultras of Oceania
List of Ultras of the United States
Hawaii hotspot
Evolution of Hawaiian volcanoes
Hawaiian–Emperor seamount chain
References
Volcanoes of Maui Nui
Mountains of Hawaii
Landforms of Molokai
Pleistocene volcanoes
Pleistocene Oceania
Cenozoic Hawaii |
Wat Nawamintararachutis () is a working Thai Theravada Buddhist temple or "wat" in Raynham, Massachusetts, which is about 45 minutes south of Boston, Massachusetts, USA. It is one of only a handful of Thai Buddhist temples in the United States with actual Thai Buddhist monks in residence. Constructed on previously occupied by a farm, it opened its doors to the public in June 2014. It is one of two Thai temples in Massachusetts; the other one is Wat Boston Buddha Vararam.
History
The ground breaking ceremony for the temple took place on 5–6 May 2011. Construction was scheduled to start late June – July 2011. The 110,000 square-foot temple was opened to the public in June 2014.
Description
The temple was designed by architect Been Z. Wang and features limestone from Jerusalem, concrete panels from Canada, Italian roofing tiles from Italy, and statues and light ornaments from Thailand. The temple can hold 700 people in the main worship space, and includes community rooms and lodging for monks and visitors, and a museum dedicated to King Bhumibol Adulyadej. A 4,000 lb statue of Buddha was placed in the building after completion.
The temple was named Wat Nawamin in honour of King Rama IX of Thailand, who was born on 5 December 1927 near Boston, in Cambridge, Massachusetts, USA (at the Mount Auburn Hospital). At the time, the king's father lived in Brookline, Massachusetts and was a medical student at Harvard Medical School.
The temple is considered to be the largest Thai Buddhist meditation center outside Thailand.
See also
Abhayagiri Buddhist Monastery, Redwood Valley, California
San Fran Dhammaram Temple, San Francisco
Vajiradhammapadip Temple, Centereach and Mount Vernon in New York
Wat Boston Buddha Vararam, Bedford, Massachusetts
Wat Buddhananachat of Austin, Del Valle, Texas
Wat Buddhasamakeevanaram, Bossier City, Louisiana
Wat Buddhanusorn, Fremont, California
Wat Carolina Buddhajakra Vanaram, Bolivia, North Carolina
Wat Florida Dhammaram, Kissimmee, Florida
Wat Mettāvarānaṁ, Valley Center, California
Wat Mongkolratanaram, Berkeley, California
Wat Mongkolratanaram, Tampa, Florida
Wat Pasantidhamma, Carrollton, Virginia
Buddhism in the United States
References
External links
Opening ceremonies photo album
Official blog
Official Website
Asian-American culture in Massachusetts
Buddhist temples in Massachusetts
Thai-American culture
Thai Theravada Buddhist temples and monasteries
Overseas Thai Buddhist temples
Buildings and structures in Bristol County, Massachusetts
Raynham, Massachusetts |
This is a list of notable residents and people who have origins in the Padma Division region of Bangladesh; consisting of the districts of Faridpur, Rajbari, Madaripur, Gopalgonj and Shariatpur. This list also includes British Bangladeshis, Bangladeshi Americans, Bangladeshi Canadians, and other non-resident Bengalis who have origins in Greater Faridpur. The people may also be known as Faridpuri.
Activism and cause célèbres
Abala Bose, social worker
Chittapriya Ray Chaudhuri, revolutionary
Chittaranjan Das, freedom fighter, political activist and lawyer
Durga Mohan Das, social reformer for women rights
Dwarkanath Ganguly, women's rights social reformer
Jyotirmayee Gangopadhyay, feminist and educationist
Harichand Thakur, social worker for untouchable castes
Manoranjan Bhattacharya, Indian independence activist
Panchanan Chakraborty, Indian independence activist
Pulin Behari Das, revolutionary and founder of the Dhaka Anushilan Samiti
Sayera Khatun, housewife and mother of Sheikh Mujibur Rahman
Siraj Sikder, revolutionary
Sheikh Fazilatunnesa Mujib, wife of Sheikh Mujibur Rahman
Sheikh Russel, son of Sheikh Mujibur Rahman
Ruby Ghaznavi, handicraft revivalist
Art and design
Bijan Choudhury, painter
Faruque Alam, civil engineer, wood technologist and former chairman of Bangladesh Inland Water Transport Corporation
Fazlur Rahman Khan, architect that is dubbed the Einstein of Structural Engineering
Himanish Goswami, cartoonist
Jogen Chowdhury, painter
Kalidas Karmakar, artist and specialist of viscosity printing
Kazi Anowar Hossain, painter
Monsur Ul Karim, painter
Sarbari Roy Choudhury, artist
Shamim Sikder, sculptor
Business and industry
Chowdhury Moyezuddin Biwshash, zamindar and merchant
Fakhruddin Ahmed, former governor of the Bangladesh Bank
Kazi Zafarullah, industrialist and politician
Khuda Buksh, life insurance salesman and humanitarian
Parveen Haque Sikder, director of National Bank Limited
Sheikh Fazle Fahim, global trade leader
Wahiduzzaman, director of the State Bank of Pakistan and founder of Zaman Industrial Corporation
Education and sciences
Abdullah Baqui, public health scientist
Amalendu De, professor of history at Jadavpur University
Farzana Islam, vice-chancellor of Jahangirnagar University
Gopal Chandra Bhattacharya, entomologist and naturalist
Jagadish Chandra Bose, inventor of the crescograph and father of radio science and Bengali science fiction. A Moon crater is named after him.
Kadambini Ganguly, first Indian female practitioner of western medicine
Kamrun Nesa Nilu, physician and health advisor to the Government of Bangladesh
Kazi Shahidullah, former vice-chancellor at the National University, Bangladesh
Maqsudul Alam, life scientist best known for genome sequencing
Mokarram Hussain Khundker, professor of chemistry at Dhaka University and a founder of the Bangladesh Academy of Sciences
Nawab Abdul Latif, educator and social worker
Prasanta Chandra Mahalanobis, anthropometrist, statistician and introducer of the Mahalanobis distance
Qazi Abu Yusuf, physician and politician
Qazi Motahar Hossain, scientist, author and teacher
R. C. Majumdar, history professor and former Sheriff of Kolkata
Sarala Roy, educationist
Shariff Enamul Kabir, former vice-chancellor of Jahangirnagar University
Sufia Ahmed, first female National Professor
Zohra Begum Kazi, first female physician of Bengal
Entertainment
Bijon Bhattacharya, theatre and film actor
Kazi Abdul Wadud, dramatist
Mohammad Asaduzzaman, chairman of the University Grants Commission
Mrinal Sen, filmmaker
Nargis Akhter, film director, screenwriter and producer
Nurul Momen, pioneer of Bengali drama
Phani Majumdar, Indian film director
Premankur Atorthy, filmmaker, novelist and journalist
Riaz, Bangladeshi film actor
Rubaiyat Hossain, film director
Shakib Khan, Dhallywood film actor
Tareque Masud, film director, producer and screenwriter
Music
Firoza Begum, Nazrul Geeti singer
Fakir Alamgir, folk and pop singer
Geeta Dutt, singer
Sagar Sen, Rabindra Sangeet singer
Families
Nawabs of Padamdi, descended from Syed Shah Pahlwan
Sheikhs of Tungipara, descended from Sheikh Awwal of Baghdad
Zamindars of Haturia, descended from Shaykh Muhammad Ashuq Mridha
Legal and police
A. B. M. Khairul Haque, 19th Chief Justice of Bangladesh
A. K. M. Shahidul Haque, 27th Inspector General of Bangladesh Police
Asmat Ali Khan, advocate and social worker
Golam Wahed Choudhury, political scientist and diplomat
Habibur Rahman, Deputy Inspector General of Bangladesh Police
KM Sobhan, justice, diplomat and activist
M. Azizul Haq, former inspector-general of Bangladesh Police
Mosharraf Hossain, lawyer and politician
Muhammad Ibrahim, judge and 8th vice-chancellor of Dhaka University
Noor-E-Alam Chowdhury Liton, chief whip of Jatiya Sangsad
Satish Ranjan Das, lawyer and former Advocate-General of Bengal
Sheikh Lutfar Rahman, civil court record-keeping officer
Sigma Huda, human rights activist, lawyer and United Nations special rapporteur
Sudhi Ranjan Das, fifth Chief Justice of India
Literature and journalism
Abu Ishaque, novelist
Abul Hasan, poet and journalist
Ajit Kumar Chakravarty, litterateur and translator
Alaol, medieval Bengali poet
ANM Bazlur Rashid, litterateur and educationist
Atul Prasad Sen, educationist, lyricist and litterateur
Gautam Das, print journalist and bureau chief for Samakal
Habibullah Siraji, poet
Humayun Kabir, educationist, politician and philosopher.
Jasimuddin, poet and folklorist
Mir Mosharraf Hossain, novelist, playwright and essayist
Mohammad A. Quayum, editor, critic and translator
Narendranath Mitra, short-story writer
Nassakh, Urdu poet, literary critic and magistrate
Ram Thakur, Hindu journalist
Rowshan Ali Chowdhury, journalist, writer, poet and politician
Sufi Motahar Hossein, poet
Sukanta Bhattacharya, poet and playwright
Sunil Gangopadhyay, poet and novelist
Yakub Ali Chowdhury, essayist and journalist
Military
Abu Mayeen Ashfakus Samad, former Bangladesh Army officer
ATM Amin, former general of the Bangladesh Army
Mohabbat Jan Chowdhury, former major general of the Bangladesh Army
Atiqur Rahman, Bangladesh's 4th Chief of Army Staff
Khondkar Nazmul Huda, war veteran
Mohammad Nizamuddin Ahmed, former Chief of Bangladeshi Naval Staff
Munshi Abdur Rouf, military officer
Mustafizur Rahman, Bangladesh's 8th Chief of Army Staff
Shafiqur Rahman, former Chief of General Staff (Bangladesh Army)
Sheikh Fazlul Haque Mani, founder of the Mujib Bahini and the Jubo League
Sheikh Jamal, former lieutenant of the Bangladesh Army
Suranjan Das, Indian pilot
Syed Mir Ali Imam Al Mamun, former Bangladesh Army officer
Politics and government
Bangladesh
Abul Hasanat Abdullah, MP for Barisal-1
Abul Kalam Azad, Jamaat-e-Islami politician
Abul Khair Chowdhury, former MP of Madaripur-1
Abdul Quader Molla, Jamaat-e-Islami politician
Abdur Rab Serniabat, former Minister of Water Resources
Abdur Razzaq, former Minister of Water Resources
Abdus Sobhan Golap, MP for Madaripur-3
Abidur Reza Khan, former MP for Faridpur-18
AFM Bahauddin Nasim, former MP for Madaripur-3
Akhteruzzaman Babul, politician for Jatiya Party (Ershad)
Akkas Ali Miah, former MP for Rajbari-1
AKM Aszad, politician
AKM Enamul Haque Shamim, MP for Shariatpur-2 and Deputy Minister of Water Resources
Ali Ahsan Mohammad Mojaheed, former secretary-general of Bangladesh Jamaat-e-Islami
Ali Newaz Mahmud Khaiyam, former MP
B. M. Muzammel Haque, former MP for Shariatpur-1
Chowdhury Akmal Ibne Yusuf, former Bangladesh Nationalist Party politician
Chowdhury Kamal Ibne Yusuf, former Minister of Food
Farid Ahmed, former independent MP of Gopalganj-2
Faruk Khan, former Minister of Civil Aviation and Tourism
Ganesh Chandra Haldar, former MP for Madaripur-3
Helen Zerin Khan, member of the Jatiya Sangsad Reserved Seats
Iqbal Hossain Apu, MP for Shariatpur-2
Ilias Ahmed Chowdhury, former MP of Madaripur-1
Jahanara Begum, politician
Kazi Abdur Rashid, former MP of Gopalganj-1
Kazi Keramat Ali, former Minister for Technical and Madrasa Education
Khandaker Mosharraf Hossain, former Minister of Local Government, Rural Development and Co-operatives
K.M. Hemayet Ullah Auranga, former MP for Shariatpur-1
KM Obaidur Rahman, former politician for Awami League
Lutfar Rahman Farooq, politician
Master Majibur Rahman, former MP for Shariatpur-1
Md. Abdul Wajed Chowdhury, politician
Md. Zillul Hakim, former MP for Rajbari-2
M. H. Khan Monjur, former MP of Gopalganj-1
Mujibur Rahman Chowdhury, MP for Faridpur-4
Naheed Ezaher Khan, member of the Jatiya Sangsad Reserved Seats
Nahim Razzaq, MP for Shariatpur-3
Nasirul Haque Sabu, former MP for Rajbari-2
Nilufer Zafarullah, member of the Jatiya Sangsad Reserved Seats
Phani Bhushan Majumder, former Minister of Information
Qazi Mahabub Ahmed, former MP for Madaripur-2
Rushema Begum, member of the Jatiya Sangsad Reserved Seats
Salma Chowdhury, MP
Sardar AKM Nasiruddin, former MP for Shariatpur-1
Sarwar Jahan Mia, former MNA politician
Sarwar Jan Chowdhury, former MP of Gopalganj-1
Serniabat Sadiq Abdullah, the Mayor of Barisal
Shajahan Khan, former Bangladeshi Minister of Shipping
Sharfuzzaman Jahangir, former MP of Gopalganj-1
Shawkat Ali, deputy speaker of the Jatiya Sangsad
Sheikh Abu Naser, former MP
Sheikh Fazle Noor Taposh, 2nd Mayor of South Dhaka
Sheikh Hasina, 10th Prime Minister of Bangladesh
Sheikh Helal Uddin, Awami League politician
Sheikh Md Abdullah, former Minister of Religious Affairs
Sheikh Mujibur Rahman, first President of Bangladesh
Sheikh Rehana, politician
Sheikh Salahuddin Jewel, MP for Khulna-2
Sheikh Selim, member of the Awami League standing committee
Sheikh Shahidul Islam, secretary general of the Jatiya Party (Manju)
Sheikh Tonmoy, MP for Bagerhat-2
Sirajul Islam Bhuiyan, former MP for Madaripur-2
Syed Abul Hossain, Awami League politician
Syeda Sajeda Chowdhury, deputy leader of the Jatiya Sangsad
T. M. Giasuddin Ahmed, former MP for Shariatpur-2
Other
Ambica Charan Mazumdar, former president of the Indian National Congress
Buddhadeb Bhattacharjee, former Chief Minister of West Bengal
Chowdhury Abd-Allah Zaheeruddin, former Minister of Health, Labour and Social Welfare for Pakistan
Farida Anwar, Labour Party politician in the United Kingdom
Fayakuzzaman, member of the 3rd National Assembly of Pakistan
Kedar Ray, 16th-century Baro-Bhuiyan chieftain and zamindar
Maulvi Tamizuddin Khan, former Speaker of the Constituent Assembly of Pakistan
Sudha Roy, Indian communist trade unionist
Yusuf Ali Chowdhury, Muslim League politician
Religion and spirituality
Abdul Haque Faridi, educator and author
Dudu Miyan, 2nd leader of the Faraizi Movement
Haji Shariatullah, anti-British revolutionary, founder of the Faraizi Movement
Shamsul Haque Faridpuri, educationist and social reformer
Sports
Aminul Islam, all-rounder cricketer
Gostha Pal, footballer and first captain of the India national team
Mabia Akhter, weightlifter
Sheikh Kamal, founder of Abahani and aide-de-camp of Mukti Bahini
Shohely Akhter, cricketer
References
External links
Greater Faridpur
Greater Faridpur |
Dic Edwards (born 1948) is a British playwright, poet and teacher of creative writing. His writing often touches upon political and social issues, nationalism and democracy.
Early life
Edwards was born in Cardiff. He was educated at Whitchurch High (Grammar), Cardiff, St David's University College, Lampeter, Hughes Hall, Cambridge and the University of Wales at Aberystwyth.
Career
Edwards' early work was produced at the Sherman Theatre, Cardiff. These included At The End of The Bay, Canned Goods and Looking For The World. At the beginning of his career, he was introduced to Edward Bond who became, and still is, a supporter of his work.
Before taking up a residency at Theatr Clwyd in 1989 and producing the play the fourth world, Edwards worked with The Haymarket Theatre in Leicester where his productions were Long To Rain Over Us and Low People.
At this time Edwards began to be published by Oberon Books Ltd., London. Its publishing editor, James Hogan, encouraged The Citizens' Theatre, Glasgow to produce his play Casanova Undone which was followed a year later by Wittgenstein's Daughter. Both were subsequently produced at The White Bear Theatre in London.
In the early 1990s Edwards worked with Mark Dornford May at Broomhill which resulted in the opera The Juniper Tree, written with composer Andrew Toovey and The Beggar's New Clothes, a reworking of The Beggar's Opera, with music by Warren Belshaw. The latter transferred to The Cockpit Theatre, London.
Edwards returned to working in Wales with Sgript Cymru and in 2002 his comedy Franco's Bastard was produced at Chapter Arts Centre. The play revisits Edwards' time as a young student at Lampeter University when he met the Welsh Nationalist activist and leader of the right wing Free Wales Army, Juian Cayo Evans. During a political falling out, the socialist Edwards was attacked by Evans and a fellow member of the FWA, which resulted in a month's stay at Chepstow Hospital where Edwards' head injuries were treated. The play centres on a sometimes scathing and sometimes affectionate account of the charismatic Evans. During the play's premier a group of Welsh Nationalists protested the play by leading walkouts and throwing stink bombs, an event that prompted questions in parliament.
In 2003, Edwards wrote the libretto for Keith Burstein's opera, Manifest Destiny. The opera was performed at The Tricycle Theatre, London as a benefit for the Redgraves' Guantanamo Human Rights Commission and subsequently played at The Edinburgh Festival in 2005. At the same time, in the same season, Cambridge University's ADC produced Edwards' play Astrakhan (Winter).
In 2013, after writing The Opportunist for The University of Michigan, Ann Arbor, Edwards turned away from writing for the theatre, arguing that "British Theatre has become a director's theatre. Directors want an easy life and, in the main, hire only TV writers now."
His play Over Milk Wood, a response to the radio play by Dylan Thomas, has been translated into Catalan as Sobre El Bosc Lacti and published by Arola Editors, Tarragona.
There have been productions of his work at NIDA in Sydney, Australia and That Theatre, Copenhagen, Denmark and a public reading of The Pimp in New York.
For many years, Edwards has worked with Theatre in Education companies most notably Spectacle Theatre and collaborated very successfully with director Steve Davis.
Edwards has recently finished The Vote, a play about the collapse of British democracy. He is working on Nude a play about the Welsh painter Augustus John. He is also working on a collection of short stories with the working title From the Backland.
Edwards founded the Creative Writing program at University of Wales Trinity Saint David, Lampeter, where he was a lecturer until 2019. He is the editor and founder of the literary magazine The Lampeter Review.
Personal life
Edwards is married to Gwenda and has three children and eight grandchildren. He lives in Aberaeron in West Wales.
Selected produced works
Theatre
Late City Echo (1981), Sherman Arena Cardiff
At the End of the Bay (1982), Sherman Arena, Cardiff
Canned Goods (1983), Sherman Arena, Cardiff
Looking for the World (1986), Sherman Main Stage, Cardiff †
Long To Rain Over Us (1987), Haymerket Theatre, Leicester †
low people (1989), Haymarket Theatre, Leicester
the fourth world (1990), Theatr Clwyd †
Regan, 1991, Theatr Powys
Casanova Undone (1992), Citizens Theatre, Glasgow and The White Bear, London †
The Juniper Tree (1992), Opera Libretto, Broomhill Opera, Kent
The Beggar's New Clothes (1992), book and lyrics, Broomhill Opera, Kent and Cockpit Theatre, London
Wittgenstein's Daughter (1993), Citizens Theatre, Glasgow and The White Bear, London †
Utah Blue (1995), The Point, Cardiff †
Lola Brecht (1995), Castaway, UK Tour †
Manifest Destiny (2005), Tricycle Theatre, London, Assembly Rooms, Edinburgh Festival, Opera Close Up, London
Astrakhan (Winter) (2005), Cambridge ADC, Edinburgh Festival †
The Pimp (2006), The White Bear, London †
The Opportunist (2013) Basement Players, University of Michigan, US
† Published by Oberon Books, London
Also published:
The Shakespeare Factory and other plays for children, Seren Books (1998)
Sobre El Bosc Lacti, Arola Editors, Tarragona (2002)
Kid , Argraff, Cardiff (2004)
Solitude, (In Two Immorality Plays) Oberon Books, London (2007)
Poetry
Walt Whitman and Other Poems (2008)
Pieces in The Manhattan Review, Poetry Wales etc.
References
Anglo-Welsh poets
Welsh dramatists and playwrights
Living people
Writers from Cardiff
1953 births
Alumni of the University of Wales, Lampeter |
Wang Lei (born July 11, 1988) is a Chinese pair skater. With Wang Xuehan, he is a bronze medalist at three Grand Prix events – 2014 Trophée Éric Bompard, 2014 Cup of China, and 2016 NHK Trophy – and the 2016 Chinese national champion. With earlier partner Zhang Yue, he is a two-time ISU Junior Grand Prix Final medalist, having won silver in 2008 and bronze in 2009.
Personal life
Wang Lei was born on July 11, 1988, in Harbin, Heilongjiang, China.
Career
Single skating
Wang started skating in 1993 after a sports club visited his kindergarten in order to recruit new members. He made his international debut competing as a single skater on the junior level. He finished 7th at two ISU Junior Grand Prix events.
Partnership with Zhang
Wang teamed up with Zhang Yue in 2006. In the 2007–08 season, the pair won two bronze medals on the Junior Grand Prix (JGP) circuit and qualified to their first JGP Final. They made their senior Grand Prix debut at the 2007 Cup of China before placing 8th at the JGP Final in Gdańsk, Poland. Following the retroactive disqualification of gold medalists Vera Bazarova / Yuri Larionov due to a positive doping sample from Larionov, Zhang/Wang moved up to 7th place. They concluded their season at the 2008 World Junior Championships in Sofia, Bulgaria. Ranked 4th in the short and 7th in the free, they finished 7th overall which, combined with Dong Huibo / Wu Yiming's bronze medal result, allowed China to send three pairs to the 2009 event.
In the 2008–09 JGP series, Zhang/Wang won a bronze medal in Belarus and finished 5th in Mexico. They were awarded the silver medal at the JGP Final in Goyang, South Korea. At the 2009 World Junior Championships in Sofia, the pair placed 7th in the short, 8th in the free, and 8th overall. At the 2009 World Championships in Los Angeles, they ranked 14th in the short, 16th in the free, and 16th overall.
Zhang/Wang won silver medals at their 2009–10 JGP assignments, in Belarus and Germany, and qualified to the JGP Final in Tokyo, where they took the bronze medal. They finished 6th at the 2010 Four Continents Championships in Jeonju.
The pair won the bronze medal at the 2011 Winter Universiade in Erzurum, Turkey. They placed 9th at the 2011 Four Continents in Taipei, 13th at the 2011 Worlds in Moscow, and 9th at the 2012 Four Continents in Colorado Springs, Colorado. Their partnership ended in 2012.
Partnership with Wang Xuehan
Wang's partnership with Wang Xuehan began in 2012. The pair won the bronze medal at the 2013 Chinese Championships.
Making their Grand Prix debut, the Wangs placed fourth at the 2013 Cup of China. They finished fourth at the 2014 Chinese Championships.
The following season, the Wangs were awarded bronze at both of their Grand Prix events – 2014 Cup of China and 2014 Trophée Éric Bompard. They took the silver medal at the 2015 Chinese Championships.
In the 2015–16 season, the pair placed fifth at the 2015 Skate America and fourth at the 2015 Cup of China. They were selected to compete at their first ISU Championship – the 2016 Worlds in Boston. Ranked 15th in the short program and 14th in the free skate, they finished 15th overall.
They were fourth at the 2016 Cup of China and won the bronze medal at the 2016 NHK Trophy. Due to injury, they did not compete again until the 2018-19 Chinese National Games, where they placed second.
In September 2020, it was announced that Wang and Wang had split and that he was paired with Yu Xiaoyu, although they never competed together internationally.
Partnership with Peng
Xiaoyu and Wang never competed together. In April, it was announced that Yu had retired. In June 2023, it was announced that he was paired with Peng Cheng.
Peng/Wang made their competitive debut with a gold medal win at the Shanghai Trophy.
Programs
With Wang Xuehan
With Zhang Yue
Single skating
Competitive highlights
GP: Grand Prix; Junior Grand Prix
Pairs with Peng
Pairs with Wang Xuehan
Pairs with Zhang Yue
Men's singles
Detailed Results
Current personal best scores are highlighted in bold.
With Peng
With Wang
References
External links
Tracings.net profile
1988 births
Living people
Chinese male pair skaters
Figure skaters from Harbin
Universiade medalists in figure skating
Universiade bronze medalists for China
Competitors at the 2011 Winter Universiade |
ImaginAsian Entertainment, Inc was a multimedia company founded by Michael Hong and Augustine Hong and a group of investors that recognized the emerging importance of "all-things Asian." Based in New York City, its main attraction was a television network, iaTV, which premiered in 2004 and which focused on entertainment featuring Korean, Japanese, and South-East Asian content. The channel competed in certain markets with AZN Television until April 2008, when the competing network ceased broadcasting. ImaginAsian itself ceased operations in 2011, selling its channel slot to CJ E&M for broadcast of the world feed of Mnet.
They also operated The ImaginAsian, a renovated movie theater located in Midtown Manhattan that shows only first-run and classic East Asian films, as well as several film festivals per year. The company renovated a second former movie theater in Los Angeles that opened in December 2007, the former Linda Lea Theater, which originally showed Japanese films and served the Little Tokyo area before shuttering in the 1980s.
In addition, past divisions of the company consisted of iaLink, ImaginAsian Entertainment's monthly on-line magazine, which at one point had over ten million subscribers, ImaginAsian Pictures and Home Entertainment, a film and DVD distribution division that released several DVDs of East Asian films and iaTV original shows, and the successful theatrical and DVD release of the Vietnamese American film Journey from the Fall, and iaRadio, a block of radio programming both streamed on-line as well as made available on certain terrestrial stations.
List of corporate affiliates
ImaginAsian Entertainment (IAEI) is the corporate parent
ImaginAsianTV (iaTV) is the television network
ImaginAsian Radio (iaRadio) is a streaming online radio
iaLink is an online e-zine
The ImaginAsian Theater, a movie theater in New York City which is now owned by Phoenix Theatres
ImaginAsian Pictures is for the creation, distribution, and promotion of films
ImaginAsian Home Entertainment is the DVD and home video division
The ImaginAsian Center is the film/event theatre in the Gallery Row area of Los Angeles, California, which opened on December 1, 2007. The Los Angeles center seems to have stopped operations in October 2008, though its web site (https://web.archive.org/web/20090105222531/http://www.theimaginasian.com/la) is still up.
Shows aired on ImaginAsian
Television programs
Eastern Animation
Japanese
Korean
List of over-the-air TV channels and cable providers
Cable/satellite providers
New York, New York – Time Warner Cable Channel 560
Hudson Valley, New York – Time Warner Cable Channel 560
Los Angeles, California – Time Warner Cable Channel 157
Charter Communications Channel 143
Champion Broadband Channel 196 (Arcadia, Monrovia and Pasadena)
San Francisco, California – Comcast Channel 28
Princeton, New Jersey – Patriot Media Channel 149
Houston, Texas – Comcast Channel 241
TVMax Channel 109
Fision Channel 349
Dallas, Texas – Time Warner Cable Channel 342
Fairfax County, Virginia – Cox Communications Channel 465
Hawaii – Oceanic Time Warner Cable Channel 134
Broadcast television stations
Edison, New Jersey – WDVB-CA (Formerly W36AS) Channel 39 (Middlesex, Monmouth, Essex and Union Counties)
See also
List of United States over-the-air television networks
Television networks in the United States
Defunct television networks in the United States
Asian-American television
Mass media companies established in 2004
Companies disestablished in 2011
Television channels and stations established in 2004
Television channels and stations disestablished in 2011
Companies based in New York City |
Robert Markowitz (born February 7, 1935, in Irvington, New Jersey) is an American film and television director. He directed episodes of Serpico (1976), Delvecchio (1976-1977), and Amazing Stories (1986), and a number of television films that include A Dangerous Life (1988), Too Young to Die? (1990), Decoration Day (1990), Because Mommy Works (1994), Twilight Zone: Rod Serling's Lost Classics (1994) The Tuskegee Airmen (1995), The Great Gatsby (2000), The Big Heist (2001), The Pilot's Wife (2002), and Word of Honor (2003).
His last directing credit was the TNT television film Avenger (2006), starring Sam Elliott and Timothy Hutton.
Partial filmography
The Storyteller (1977) – Made for TV – ABC
Too Young to Die? (1990) – Made for TV – NBC
Decoration Day (1990) – Made for TV – NBC
The Tuskegee Airmen (1995) – Made for TV – HBO
The Great Gatsby (2000) – Made for TV – A&E Networks/BBC
The Pilot's Wife (2002) – Made for TV – CBS
Word of Honor (2003) – Made for TV – TNT
Avenger (2006) – Made for TV – TNT
References
External links
1935 births
American television directors
Living people
People from Irvington, New Jersey
Film directors from New Jersey |
```rust
use super::*;
#[test]
fn pointy_brace() {
html_opts!(
[render.unsafe_],
concat!(
"URI autolink: <path_to_url",
"\n",
"Email autolink: <bill@microsoft.com>\n",
"\n",
"* Inline <em>tag</em> **ha**.\n",
"* Inline <!-- comment --> **ha**.\n",
"* Inline <? processing instruction ?> **ha**.\n",
"* Inline <!DECLARATION OKAY> **ha**.\n",
"* Inline <![CDATA[ok]ha **ha** ]]> **ha**.\n"
),
concat!(
"<p>URI autolink: <a \
href=\"path_to_url">path_to_url",
"<p>Email autolink: <a \
href=\"mailto:bill@microsoft.com\">bill@microsoft.com</a></p>\n",
"<ul>\n",
"<li>Inline <em>tag</em> <strong>ha</strong>.</li>\n",
"<li>Inline <!-- comment --> <strong>ha</strong>.</li>\n",
"<li>Inline <? processing instruction ?> <strong>ha</strong>.</li>\n",
"<li>Inline <!DECLARATION OKAY> <strong>ha</strong>.</li>\n",
"<li>Inline <![CDATA[ok]ha **ha** ]]> <strong>ha</strong>.</li>\n",
"</ul>\n"
),
);
}
#[test]
fn no_control_characters_in_reference_links() {
html(
"[A]:\u{1b}\n\nX [A] Y\n",
"<p>[A]:\u{1b}</p>\n<p>X [A] Y</p>\n",
)
}
#[test]
fn link_entity_regression() {
html(
"[link](javascript:alert('XSS'))",
"<p><a href=\"&#x6A&#x61&#x76&#x61&#x73&#x63&#x72&#x69&#x70&#x74&#x3A&#x61&#x6C&#x65&#x72&#x74&#x28&#x27&#x58&#x53&#x53&#x27&#x29\">link</a></p>\n",
);
}
#[test]
fn regression_back_to_back_ranges() {
html(
"**bold*****bold+italic***",
"<p><strong>bold</strong><em><strong>bold+italic</strong></em></p>\n",
);
}
#[test]
fn no_panic_on_empty_bookended_atx_headers() {
html("# #", "<h1></h1>\n");
}
#[test]
fn no_stack_smash_html() {
let s: String = ">".repeat(150_000);
let arena = Arena::new();
let root = parse_document(&arena, &s, &Options::default());
let mut output = vec![];
html::format_document(root, &Options::default(), &mut output).unwrap()
}
#[test]
fn no_stack_smash_cm() {
let s: String = ">".repeat(150_000);
let arena = Arena::new();
let root = parse_document(&arena, &s, &Options::default());
let mut output = vec![];
cm::format_document(root, &Options::default(), &mut output).unwrap()
}
#[test]
fn cm_autolink_regression() {
// Testing that the cm renderer handles this case without crashing
html("<a+c:dd>", "<p><a href=\"a+c:dd\">a+c:dd</a></p>\n");
}
#[test]
fn regression_424() {
html(
"*text* [link](#section)",
"<p><em>text</em> <a href=\"#section\">link</a></p>\n",
);
}
#[test]
fn example_61() {
html(
r##"
`Foo
----
`
<a title="a lot
---
of dashes"/>
"##,
r##"<h2>`Foo</h2>
<p>`</p>
<h2><a title="a lot</h2>
<p>of dashes"/></p>
"##,
);
}
#[test]
fn nul_at_eof() {
html("foo\0", "<p>foo\u{fffd}</p>\n");
html("foo\0ba", "<p>foo\u{fffd}ba</p>\n");
html("foo\0ba\0", "<p>foo\u{fffd}ba\u{fffd}</p>\n");
}
#[test]
fn sourcepos_para() {
html_opts!(
[render.sourcepos],
"abc\ndef\n\nghi\n",
"<p data-sourcepos=\"1:1-2:3\">abc\ndef</p>\n<p data-sourcepos=\"4:1-4:3\">ghi</p>\n",
);
}
#[test]
#[cfg(feature = "shortcodes")]
fn gemoji() {
html_opts!([extension.shortcodes], ":x:", "<p></p>\n");
}
``` |
The Atlantic Forest climbing mouse (Rhipidomys mastacalis) is an arboreal rodent species in the family Cricetidae from South America. It is found in the Atlantic Forest of southeastern Brazil at elevations from sea level to 1500 m. It utilizes the ground more than the understory in isolated forests (highland marshes) however this utilization changes in certain areas of the Atlantic Forest where it prefers to use the vegetation canopy. Its karyotype is 2n = 44, FN = 74–80.
It is sometimes also referred to as the long-tailed climbing mouse. Rhipidomys macrurus is similarly sometimes commonly known as the "long-tailed rhipidomys", while rodents of genus Vandeleuria are also commonly known as long-tailed climbing mice.
References
Rhipidomys
Endemic fauna of Brazil
Mammals of Brazil
Fauna of the Atlantic Forest
Rodents of South America
Mammals described in 1841 |
The Spuyten Duyvil Bridge is a railroad swing bridge that spans the Spuyten Duyvil Creek between Manhattan and the Bronx, in New York City. The bridge is located at the northern tip of Manhattan where the Spuyten Duyvil Creek meets the Hudson River, approximately to the west of the Henry Hudson Bridge.
The Spuyten Duyvil Bridge was built to carry two tracks but now carries only a single track on the eastern side of the span. It is part of the West Side Line, and is used by Amtrak trains traveling along the Empire Connection. The span is used by approximately 30 trains a day and is opened over 1,000 times per year, primarily during the summer months for Circle Line Sightseeing Cruises and recreational vessels.
History
A wooden railroad drawbridge across the Spuyten Duyvil was first constructed by the New York & Hudson River Railroad in 1849. The railroad continued southward along the West Side Line to St. John's Park Terminal in Lower Manhattan and carried both freight and passenger service. The Hudson River Railroad merged with the New York & Harlem Railroad in 1869, creating the New York Central & Hudson River Railroad, and most trains started bypassing the bridge, instead going to Grand Central Terminal in Midtown Manhattan. An iron bridge replaced the wooden span by 1895.
The current steel bridge was designed by Robert Giles and constructed in 1900. The piers rest on pile foundations in the riverbed. The bridge consists of three fixed sections as well as a swing section, which could swivel nearly 65 degrees and leave a of clearance on each side. The swing span weighed 200 tons and had enough space to fit two tracks.
By 1935, there were 70 trains a day using the Spuyten Duyvil Bridge, but after World War II, usage declined. In 1963, the steam motor that powered the swing span was replaced with an electric motor. The bridge was slightly damaged three years later, when the swing span was struck by a boat, leaving it stuck in the open position for two weeks. Trains stopped running across the Spuyten Duyvil Bridge in 1982 and the following year the bridge was damaged by a vessel and was left unable to close.
The bridge was rehabilitated in the late 1980s. Amtrak's Empire Service began using the Spuyten Duyvil Bridge on April 7, 1991, following the completion of the Empire Connection. This involved the conversion of the abandoned West Side Line to accommodate passenger service and connect with Pennsylvania Station. Until then, Amtrak trains traveling between New York and Albany had utilized Grand Central Terminal.
In June 2018, Amtrak used the Left Coast Lifter, one of the world's largest floating cranes, to lift the of the bridge's spans and move them to a barge in order to make fixes to electrical and mechanical components necessitated by damage due to Hurricane Sandy and years of malfunctions and corrosion. During the repairs, trains which had originated in Penn Station and used the bridge originated instead from Grand Central Terminal, bypassing the bridge. The trains returned to their regular routing to Penn Station on September 4.
Incidents
On the evening of February 16, 2004, an 80-year-old woman mistakenly drove her car onto the bridge from the Bronx side of the river and was hit by a Penn Station-bound Amtrak train. The passenger train carried the automobile for a distance of along the tracks. She survived with only minor injuries.
During the early morning hours of October 24, 2010, a fire broke out on the bridge, suspending train service until later that evening.
A boat ran into the bridge at around 4:20pm on May 29, 2016, causing major delays on the Empire Corridor, as the bridge was required to be inspected before trains could use it again. No injuries were reported in the incident.
Gallery
References
Notes
External links
History of the Spuyten Duyvil Bridge
1899 establishments in New York City
Bridges completed in 1899
Bridges in Manhattan
Bridges in the Bronx
Bridges over the Harlem River
Inwood, Manhattan
New York Central Railroad bridges
Railroad bridges in New York City
Spuyten Duyvil, Bronx
Steel bridges in the United States
Swing bridges in the United States
West Side Line |
```java
/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* published by the Free Software Foundation. Oracle designates this
* particular file as subject to the "Classpath" exception as provided
* by Oracle in the LICENSE file that accompanied this code.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
package jdk.graal.compiler.core.aarch64;
import org.graalvm.collections.EconomicMap;
import org.graalvm.collections.Equivalence;
import jdk.graal.compiler.asm.aarch64.AArch64Assembler;
import jdk.graal.compiler.asm.aarch64.AArch64Assembler.ExtendType;
import jdk.graal.compiler.asm.aarch64.AArch64MacroAssembler;
import jdk.graal.compiler.core.common.LIRKind;
import jdk.graal.compiler.core.common.NumUtil;
import jdk.graal.compiler.core.common.calc.CanonicalCondition;
import jdk.graal.compiler.core.common.calc.FloatConvert;
import jdk.graal.compiler.core.gen.NodeMatchRules;
import jdk.graal.compiler.core.match.ComplexMatchResult;
import jdk.graal.compiler.core.match.MatchRule;
import jdk.graal.compiler.core.match.MatchableNode;
import jdk.graal.compiler.debug.Assertions;
import jdk.graal.compiler.debug.GraalError;
import jdk.graal.compiler.lir.LIRFrameState;
import jdk.graal.compiler.lir.LabelRef;
import jdk.graal.compiler.lir.Variable;
import jdk.graal.compiler.lir.aarch64.AArch64ArithmeticOp;
import jdk.graal.compiler.lir.aarch64.AArch64BitFieldOp;
import jdk.graal.compiler.lir.aarch64.AArch64BitFieldOp.BitFieldOpCode;
import jdk.graal.compiler.lir.aarch64.AArch64ControlFlow;
import jdk.graal.compiler.lir.gen.LIRGeneratorTool;
import jdk.graal.compiler.nodes.ConstantNode;
import jdk.graal.compiler.nodes.DeoptimizingNode;
import jdk.graal.compiler.nodes.FixedNode;
import jdk.graal.compiler.nodes.IfNode;
import jdk.graal.compiler.nodes.NodeView;
import jdk.graal.compiler.nodes.ValueNode;
import jdk.graal.compiler.nodes.calc.AddNode;
import jdk.graal.compiler.nodes.calc.AndNode;
import jdk.graal.compiler.nodes.calc.BinaryNode;
import jdk.graal.compiler.nodes.calc.FloatConvertNode;
import jdk.graal.compiler.nodes.calc.IntegerConvertNode;
import jdk.graal.compiler.nodes.calc.IntegerLessThanNode;
import jdk.graal.compiler.nodes.calc.LeftShiftNode;
import jdk.graal.compiler.nodes.calc.MulNode;
import jdk.graal.compiler.nodes.calc.NotNode;
import jdk.graal.compiler.nodes.calc.OrNode;
import jdk.graal.compiler.nodes.calc.RightShiftNode;
import jdk.graal.compiler.nodes.calc.ShiftNode;
import jdk.graal.compiler.nodes.calc.SignExtendNode;
import jdk.graal.compiler.nodes.calc.SubNode;
import jdk.graal.compiler.nodes.calc.UnaryNode;
import jdk.graal.compiler.nodes.calc.UnsignedRightShiftNode;
import jdk.graal.compiler.nodes.calc.XorNode;
import jdk.graal.compiler.nodes.calc.ZeroExtendNode;
import jdk.graal.compiler.nodes.memory.MemoryAccess;
import jdk.vm.ci.aarch64.AArch64;
import jdk.vm.ci.aarch64.AArch64Kind;
import jdk.vm.ci.code.CodeUtil;
import jdk.vm.ci.meta.AllocatableValue;
import jdk.vm.ci.meta.JavaConstant;
import jdk.vm.ci.meta.JavaKind;
import jdk.vm.ci.meta.Value;
@MatchableNode(nodeClass = AArch64PointerAddNode.class, inputs = {"base", "offset"})
public class AArch64NodeMatchRules extends NodeMatchRules {
private static final EconomicMap<Class<? extends BinaryNode>, AArch64ArithmeticOp> binaryOpMap;
private static final EconomicMap<Class<? extends BinaryNode>, AArch64BitFieldOp.BitFieldOpCode> bitFieldOpMap;
private static final EconomicMap<Class<? extends BinaryNode>, AArch64MacroAssembler.ShiftType> shiftTypeMap;
private static final EconomicMap<Class<? extends BinaryNode>, AArch64ArithmeticOp> logicalNotOpMap;
static {
binaryOpMap = EconomicMap.create(Equivalence.IDENTITY, 9);
binaryOpMap.put(AddNode.class, AArch64ArithmeticOp.ADD);
binaryOpMap.put(SubNode.class, AArch64ArithmeticOp.SUB);
binaryOpMap.put(MulNode.class, AArch64ArithmeticOp.MUL);
binaryOpMap.put(AndNode.class, AArch64ArithmeticOp.AND);
binaryOpMap.put(OrNode.class, AArch64ArithmeticOp.OR);
binaryOpMap.put(XorNode.class, AArch64ArithmeticOp.XOR);
binaryOpMap.put(LeftShiftNode.class, AArch64ArithmeticOp.LSL);
binaryOpMap.put(RightShiftNode.class, AArch64ArithmeticOp.ASR);
binaryOpMap.put(UnsignedRightShiftNode.class, AArch64ArithmeticOp.LSR);
bitFieldOpMap = EconomicMap.create(Equivalence.IDENTITY, 2);
bitFieldOpMap.put(UnsignedRightShiftNode.class, BitFieldOpCode.UBFX);
bitFieldOpMap.put(LeftShiftNode.class, BitFieldOpCode.UBFIZ);
logicalNotOpMap = EconomicMap.create(Equivalence.IDENTITY, 3);
logicalNotOpMap.put(AndNode.class, AArch64ArithmeticOp.BIC);
logicalNotOpMap.put(OrNode.class, AArch64ArithmeticOp.ORN);
logicalNotOpMap.put(XorNode.class, AArch64ArithmeticOp.EON);
shiftTypeMap = EconomicMap.create(Equivalence.IDENTITY, 3);
shiftTypeMap.put(LeftShiftNode.class, AArch64MacroAssembler.ShiftType.LSL);
shiftTypeMap.put(RightShiftNode.class, AArch64MacroAssembler.ShiftType.ASR);
shiftTypeMap.put(UnsignedRightShiftNode.class, AArch64MacroAssembler.ShiftType.LSR);
}
public AArch64NodeMatchRules(LIRGeneratorTool gen) {
super(gen);
}
/**
* Checks whether all arguments are numeric integers.
*/
protected boolean isNumericInteger(ValueNode... values) {
for (ValueNode value : values) {
if (!value.getStackKind().isNumericInteger()) {
return false;
}
}
return true;
}
/**
* Checks whether all arguments are numeric floats.
*/
protected boolean isNumericFloat(ValueNode... values) {
for (ValueNode value : values) {
if (!value.getStackKind().isNumericFloat()) {
return false;
}
}
return true;
}
protected LIRFrameState getState(MemoryAccess access) {
if (access instanceof DeoptimizingNode) {
return state((DeoptimizingNode) access);
}
return null;
}
protected AArch64Kind getMemoryKind(MemoryAccess access) {
return (AArch64Kind) gen.getLIRKind(((ValueNode) access).stamp(NodeView.DEFAULT)).getPlatformKind();
}
private static boolean isSupportedExtendedAddSubShift(IntegerConvertNode<?> node, int clampedShiftAmt) {
assert NumUtil.assertNonNegativeInt(clampedShiftAmt);
if (clampedShiftAmt <= 4) {
switch (node.getInputBits()) {
case Byte.SIZE:
case Short.SIZE:
case Integer.SIZE:
case Long.SIZE:
return true;
}
}
return false;
}
private static ExtendType getZeroExtendType(int fromBits) {
switch (fromBits) {
case Byte.SIZE:
return ExtendType.UXTB;
case Short.SIZE:
return ExtendType.UXTH;
case Integer.SIZE:
return ExtendType.UXTW;
case Long.SIZE:
return ExtendType.UXTX;
default:
GraalError.shouldNotReachHere("extended from " + fromBits + "bits is not supported!"); // ExcludeFromJacocoGeneratedReport
return null;
}
}
private static ExtendType getSignExtendType(int fromBits) {
switch (fromBits) {
case Byte.SIZE:
return ExtendType.SXTB;
case Short.SIZE:
return ExtendType.SXTH;
case Integer.SIZE:
return ExtendType.SXTW;
case Long.SIZE:
return ExtendType.SXTX;
default:
GraalError.shouldNotReachHere("extended from " + fromBits + "bits is not supported!"); // ExcludeFromJacocoGeneratedReport
return null;
}
}
private AllocatableValue moveSp(AllocatableValue value) {
return getLIRGeneratorTool().moveSp(value);
}
/**
* Clamp shift amounts into range 0 <= shiftamt < size according to JLS.
*/
private static int getClampedShiftAmt(ShiftNode<?> op) {
int clampMask = op.getShiftAmountMask();
assert clampMask == 63 || clampMask == 31 : clampMask;
return op.getY().asJavaConstant().asInt() & clampMask;
}
protected ComplexMatchResult emitBinaryShift(AArch64ArithmeticOp op, ValueNode value, ShiftNode<?> shift) {
AArch64MacroAssembler.ShiftType shiftType = shiftTypeMap.get(shift.getClass());
assert shiftType != null;
assert isNumericInteger(value, shift.getX());
return builder -> {
Value a = operand(value);
Value b = operand(shift.getX());
Variable result = gen.newVariable(LIRKind.combine(a, b));
AllocatableValue x = moveSp(gen.asAllocatable(a));
AllocatableValue y = moveSp(gen.asAllocatable(b));
int shiftAmount = getClampedShiftAmt(shift);
gen.append(new AArch64ArithmeticOp.BinaryShiftOp(op, result, x, y, shiftType, shiftAmount));
return result;
};
}
private ComplexMatchResult emitBitTestAndBranch(FixedNode trueSuccessor, FixedNode falseSuccessor,
ValueNode value, double trueProbability, int nbits) {
return builder -> {
LabelRef trueDestination = getLIRBlock(trueSuccessor);
LabelRef falseDestination = getLIRBlock(falseSuccessor);
AllocatableValue src = moveSp(gen.asAllocatable(operand(value)));
gen.append(new AArch64ControlFlow.BitTestAndBranchOp(trueDestination, falseDestination, src,
trueProbability, nbits));
return null;
};
}
/**
* Helper used by emitBitFieldInsert and emitBitFieldExtract.
*/
private ComplexMatchResult emitBitFieldHelper(JavaKind kind, AArch64BitFieldOp.BitFieldOpCode op, ValueNode value, int lsb, int width) {
assert isNumericInteger(value);
assert lsb + width <= kind.getBitCount() : lsb + " " + kind;
return builder -> {
Value a = operand(value);
LIRKind resultKind = LIRKind.fromJavaKind(gen.target().arch, kind);
Variable result = gen.newVariable(resultKind);
AllocatableValue src = moveSp(gen.asAllocatable(a));
gen.append(new AArch64BitFieldOp(op, result, src, lsb, width));
return result;
};
}
/**
* Copy (width) bits from the least significant bits of the source register to bit position lsb
* of the destination register.
*
* @param kind expected final size of the bitfield operation
* @param op The type of bitfield operation
* @param value The value to extract bits from
* @param lsb (least significant bit) the starting index of where the value is moved to
* @param width The number of bits to extract from value.
*/
private ComplexMatchResult emitBitFieldInsert(JavaKind kind, AArch64BitFieldOp.BitFieldOpCode op, ValueNode value, int lsb, int width) {
assert op == BitFieldOpCode.SBFIZ || op == BitFieldOpCode.UBFIZ : op;
return emitBitFieldHelper(kind, op, value, lsb, width);
}
/**
* Copy (width) bits from the lsb bit position of the source register to the bottom of the
* destination register.
*
* @param kind expected final size of the bitfield operation
* @param op The type of bitfield operation
* @param value The value to extract bits from
* @param lsb (least significant bit) the starting index of where the value copied from
* @param width The number of bits to extract from value.
*/
private ComplexMatchResult emitBitFieldExtract(JavaKind kind, AArch64BitFieldOp.BitFieldOpCode op, ValueNode value, int lsb, int width) {
assert op == BitFieldOpCode.SBFX || op == BitFieldOpCode.UBFX : op;
return emitBitFieldHelper(kind, op, value, lsb, width);
}
private ComplexMatchResult emitExtendedAddSubShift(BinaryNode op, ValueNode x, ValueNode y, ExtendType extType, int shiftAmt) {
assert op instanceof AddNode || op instanceof SubNode : op;
return builder -> {
AllocatableValue src1 = gen.asAllocatable(operand(x));
AllocatableValue src2 = moveSp(gen.asAllocatable(operand(y)));
Variable result = gen.newVariable(LIRKind.combine(operand(x), operand(y)));
AArch64ArithmeticOp arithmeticOp = op instanceof AddNode ? AArch64ArithmeticOp.ADD : AArch64ArithmeticOp.SUB;
gen.append(new AArch64ArithmeticOp.ExtendedAddSubShiftOp(arithmeticOp, result, src1, src2, extType, shiftAmt));
return result;
};
}
/**
* Goal: Use AArch64's add/sub (extended register) instructions to fold away extend and shift of
* left operand.
*/
@MatchRule("(Add=op x (LeftShift=lshift (SignExtend=ext y) Constant))")
@MatchRule("(Sub=op x (LeftShift=lshift (SignExtend=ext y) Constant))")
@MatchRule("(Add=op x (LeftShift=lshift (ZeroExtend=ext y) Constant))")
@MatchRule("(Sub=op x (LeftShift=lshift (ZeroExtend=ext y) Constant))")
public ComplexMatchResult mergeSignExtendByShiftIntoAddSub(BinaryNode op, LeftShiftNode lshift, ValueNode ext, ValueNode x, ValueNode y) {
assert isNumericInteger(lshift);
int shiftAmt = getClampedShiftAmt(lshift);
if (!isSupportedExtendedAddSubShift((IntegerConvertNode<?>) ext, shiftAmt)) {
return null;
}
ExtendType extType;
if (ext instanceof SignExtendNode) {
extType = getSignExtendType(((SignExtendNode) ext).getInputBits());
} else {
extType = getZeroExtendType(((ZeroExtendNode) ext).getInputBits());
}
return emitExtendedAddSubShift(op, x, y, extType, shiftAmt);
}
/**
* Goal: Use AArch64's add/sub (extended register) instructions to fold away the and operation
* (into a zero extend) and shift of left operand.
*/
@MatchRule("(Add=op x (LeftShift=lshift (And y Constant=constant) Constant))")
@MatchRule("(Sub=op x (LeftShift=lshift (And y Constant=constant) Constant))")
public ComplexMatchResult mergeShiftDowncastIntoAddSub(BinaryNode op, LeftShiftNode lshift, ConstantNode constant, ValueNode x, ValueNode y) {
assert isNumericInteger(lshift, constant);
int shiftAmt = getClampedShiftAmt(lshift);
if (shiftAmt > 4) {
return null;
}
long mask = constant.asJavaConstant().asLong() & CodeUtil.mask(op.getStackKind().getBitCount());
if (mask != 0xFFL && mask != 0xFFFFL && mask != 0xFFFFFFFFL) {
return null;
}
int numBits = 64 - Long.numberOfLeadingZeros(mask);
return emitExtendedAddSubShift(op, x, y, getZeroExtendType(numBits), shiftAmt);
}
/**
* Goal: Switch ((x << amt) >> amt) into a sign extend and fold into AArch64 add/sub
* (extended register) instruction.
*/
@MatchRule("(Add=op x (RightShift=signExt (LeftShift y Constant=shiftConst) Constant=shiftConst))")
@MatchRule("(Sub=op x (RightShift=signExt (LeftShift y Constant=shiftConst) Constant=shiftConst))")
public ComplexMatchResult mergePairShiftIntoAddSub(BinaryNode op, RightShiftNode signExt, ValueNode x, ValueNode y) {
int signExtendAmt = getClampedShiftAmt(signExt);
int opSize = op.getStackKind().getBitCount();
assert opSize == 32 || opSize == 64 : opSize;
int remainingBits = opSize - signExtendAmt;
if (remainingBits != 8 && remainingBits != 16 && remainingBits != 32) {
return null;
}
return emitExtendedAddSubShift(op, x, y, getSignExtendType(remainingBits), 0);
}
/**
* Goal: Fold ((x << amt) >> amt) << [0,4] into AArch64 add/sub (extended register)
* instruction with a sign extend and a shift.
*/
@MatchRule("(Add=op x (LeftShift=outerShift (RightShift=signExt (LeftShift y Constant=shiftConst) Constant=shiftConst) Constant))")
@MatchRule("(Sub=op x (LeftShift=outerShift (RightShift=signExt (LeftShift y Constant=shiftConst) Constant=shiftConst) Constant))")
public ComplexMatchResult mergeShiftedPairShiftIntoAddSub(BinaryNode op, LeftShiftNode outerShift, RightShiftNode signExt, ValueNode x, ValueNode y) {
int shiftAmt = getClampedShiftAmt(outerShift);
if (shiftAmt > 4) {
return null;
}
int signExtendAmt = getClampedShiftAmt(signExt);
int opSize = op.getStackKind().getBitCount();
assert opSize == 32 || opSize == 64 : opSize;
int remainingBits = opSize - signExtendAmt;
if (remainingBits != 8 && remainingBits != 16 && remainingBits != 32) {
return null;
}
return emitExtendedAddSubShift(op, x, y, getSignExtendType(remainingBits), shiftAmt);
}
/**
* Goal: Fold zero extend and (optional) shift into AArch64 add/sub (extended register)
* instruction.
*/
@MatchRule("(AArch64PointerAdd=addP base ZeroExtend)")
@MatchRule("(AArch64PointerAdd=addP base (LeftShift ZeroExtend Constant))")
public ComplexMatchResult extendedPointerAddShift(AArch64PointerAddNode addP) {
ValueNode offset = addP.getOffset();
ZeroExtendNode zeroExtend;
int shiftAmt;
if (offset instanceof ZeroExtendNode) {
zeroExtend = (ZeroExtendNode) offset;
shiftAmt = 0;
} else {
LeftShiftNode shift = (LeftShiftNode) offset;
zeroExtend = (ZeroExtendNode) shift.getX();
shiftAmt = getClampedShiftAmt(shift);
}
if (!isSupportedExtendedAddSubShift(zeroExtend, shiftAmt)) {
return null;
}
int fromBits = zeroExtend.getInputBits();
int toBits = zeroExtend.getResultBits();
if (toBits != 64) {
return null;
}
assert fromBits <= toBits : fromBits + " " + toBits;
ExtendType extendType = getZeroExtendType(fromBits);
ValueNode base = addP.getBase();
return builder -> {
AllocatableValue x = gen.asAllocatable(operand(base));
AllocatableValue y = moveSp(gen.asAllocatable(operand(zeroExtend.getValue())));
AllocatableValue baseReference = LIRKind.derivedBaseFromValue(x);
LIRKind kind = LIRKind.combineDerived(gen.getLIRKind(addP.stamp(NodeView.DEFAULT)),
baseReference, null);
Variable result = gen.newVariable(kind);
gen.append(new AArch64ArithmeticOp.ExtendedAddSubShiftOp(AArch64ArithmeticOp.ADD, result, x, y,
extendType, shiftAmt));
return result;
};
}
/**
* This method determines, if possible, how to use AArch64's bit unsigned field insert/extract
* (UBFIZ/UBFX) instructions to copy over desired bits in the presence of the pattern [(X >>> #)
* & MASK] or [(X & MASK) << #] (with some zero extensions maybe sprinkled in).
*
* The main idea is that the mask and shift will force many bits to be zeroed and this
* information can be leveraged to extract the meaningful bits.
*/
private ComplexMatchResult unsignedBitFieldHelper(JavaKind finalOpKind, BinaryNode shift, ValueNode value, ConstantNode maskNode, int andOpSize) {
long mask = maskNode.asJavaConstant().asLong() & CodeUtil.mask(andOpSize);
if (!CodeUtil.isPowerOf2(mask + 1)) {
/* MaskNode isn't a mask: initial assumption doesn't hold true */
return null;
}
int maskSize = 64 - Long.numberOfLeadingZeros(mask);
int shiftSize = shift.getStackKind().getBitCount();
int shiftAmt = getClampedShiftAmt((ShiftNode<?>) shift);
/*
* The width of the insert/extract will be the bits which are not shifted out and/or not
* part of the mask.
*/
int width = Math.min(maskSize, shiftSize - shiftAmt);
if (width == finalOpKind.getBitCount()) {
assert maskSize == finalOpKind.getBitCount() && shiftAmt == 0 : maskSize + " " + finalOpKind;
// original value is unaffected
return builder -> operand(value);
} else if (shift instanceof UnsignedRightShiftNode) {
// this is an extract
return emitBitFieldExtract(finalOpKind, BitFieldOpCode.UBFX, value, shiftAmt, width);
} else {
// is a left shift - means this is an insert
return emitBitFieldInsert(finalOpKind, BitFieldOpCode.UBFIZ, value, shiftAmt, width);
}
}
/**
* Goal: Use AArch64's bit unsigned field insert/extract (UBFIZ/UBFX) instructions to copy over
* desired bits.
*/
@MatchRule("(And (UnsignedRightShift=shift value Constant) Constant=a)")
@MatchRule("(LeftShift=shift (And value Constant=a) Constant)")
public ComplexMatchResult unsignedBitField(BinaryNode shift, ValueNode value, ConstantNode a) {
return unsignedBitFieldHelper(shift.getStackKind(), shift, value, a, shift.getStackKind().getBitCount());
}
/**
* Goal: Use AArch64's bit unsigned field insert/extract (UBFIZ/UBFX) instructions to copy over
* desired bits.
*/
@MatchRule("(LeftShift=shift (ZeroExtend=extend (And value Constant=a)) Constant)")
@MatchRule("(ZeroExtend=extend (And (UnsignedRightShift=shift value Constant) Constant=a))")
@MatchRule("(ZeroExtend=extend (LeftShift=shift (And value Constant=a) Constant))")
public ComplexMatchResult unsignedExtBitField(ZeroExtendNode extend, BinaryNode shift, ValueNode value, ConstantNode a) {
return unsignedBitFieldHelper(extend.getStackKind(), shift, value, a, extend.getInputBits());
}
/**
* Goal: Use AArch64's signed bitfield insert in zeros (sbfiz) instruction to extract desired
* bits while folding away sign extend.
*/
@MatchRule("(LeftShift=shift (SignExtend value) Constant)")
public ComplexMatchResult signedBitField(LeftShiftNode shift, ValueNode value) {
assert isNumericInteger(shift);
SignExtendNode extend = (SignExtendNode) shift.getX();
int inputBits = extend.getInputBits();
int resultBits = extend.getResultBits();
JavaKind kind = shift.getStackKind();
assert kind.getBitCount() == resultBits : Assertions.errorMessage(shift, value, kind);
int lsb = getClampedShiftAmt(shift);
/*
* Get the min value of the inputBits and post-shift bits (resultBits - lsb) as the bitfield
* width. Note if (resultBits-lsb) is smaller than inputBits, the in reality no sign
* extension takes place.
*/
int width = Math.min(inputBits, resultBits - lsb);
assert width >= 1 && width <= resultBits - lsb : width + " " + resultBits;
return emitBitFieldInsert(kind, BitFieldOpCode.SBFIZ, value, lsb, width);
}
/**
* Goal: Use AArch64's bit field insert/extract instructions to copy over desired bits.
*/
@MatchRule("(RightShift=rshift (LeftShift=lshift value Constant) Constant)")
@MatchRule("(UnsignedRightShift=rshift (LeftShift=lshift value Constant) Constant)")
public ComplexMatchResult bitFieldMove(BinaryNode rshift, LeftShiftNode lshift, ValueNode value) {
assert isNumericInteger(rshift);
JavaKind opKind = rshift.getStackKind();
int opSize = opKind.getBitCount();
int lshiftAmt = getClampedShiftAmt(lshift);
int rshiftAmt = getClampedShiftAmt((ShiftNode<?>) rshift);
/*
* Get the width of the bitField. It will be in the range 1 to 32(64).
*
* Get the final width of the extract. Because the left and right shift go in opposite
* directions, the number of meaningful bits after performing a (x << #) >>(>) # is
* dependent on the maximum of the two shifts.
*/
int width = opSize - Math.max(lshiftAmt, rshiftAmt);
assert width > 1 || width <= opSize : width + " " + opSize;
if (width == opSize) {
// this means that no shifting was performed: can directly return value
return builder -> operand(value);
}
/*
* Use bitfield insert (SBFIZ/UBFIZ) if left shift number is larger than right shift number,
* otherwise use bitfield extract (SBFX/UBFX).
*
* If lshiftAmt > rshiftAmt, this means that the destination value will have some of its
* bottom bits cleared, whereas if lshiftAmt <= rshiftAmt, then the destination value will
* have bits starting from index 0 copied from the input.
*/
if (lshiftAmt > rshiftAmt) {
int lsb = lshiftAmt - rshiftAmt;
BitFieldOpCode op = rshift instanceof RightShiftNode ? BitFieldOpCode.SBFIZ : BitFieldOpCode.UBFIZ;
return emitBitFieldInsert(opKind, op, value, lsb, width);
} else {
// is a bit field extract
int lsb = rshiftAmt - lshiftAmt;
BitFieldOpCode op = rshift instanceof RightShiftNode ? BitFieldOpCode.SBFX : BitFieldOpCode.UBFX;
return emitBitFieldExtract(opKind, op, value, lsb, width);
}
}
/**
* Goal: Use AArch64's ror instruction for rotations.
*/
@MatchRule("(Or=op (LeftShift=x src Constant) (UnsignedRightShift=y src Constant))")
@MatchRule("(Or=op (UnsignedRightShift=x src Constant) (LeftShift=y src Constant))")
@MatchRule("(Add=op (LeftShift=x src Constant) (UnsignedRightShift=y src Constant))")
@MatchRule("(Add=op (UnsignedRightShift=x src Constant) (LeftShift=y src Constant))")
public ComplexMatchResult rotationConstant(ValueNode op, ValueNode x, ValueNode y, ValueNode src) {
assert isNumericInteger(src);
assert src.getStackKind() == op.getStackKind() && op.getStackKind() == x.getStackKind() : src + " " + op + " " + x;
int shiftAmt1 = getClampedShiftAmt((ShiftNode<?>) x);
int shiftAmt2 = getClampedShiftAmt((ShiftNode<?>) y);
if (shiftAmt1 + shiftAmt2 == 0 && op instanceof OrNode) {
assert shiftAmt1 == 0 && shiftAmt2 == 0 : shiftAmt1 + " " + shiftAmt2;
/* No shift performed: for or operation, this is equivalent to original value */
return builder -> operand(src);
} else if (src.getStackKind().getBitCount() == shiftAmt1 + shiftAmt2) {
/* Shifts are equivalent to a rotate. */
return builder -> {
AllocatableValue a = moveSp(gen.asAllocatable(operand(src)));
/* Extract the right shift amount */
JavaConstant b = JavaConstant.forInt(x instanceof LeftShiftNode ? shiftAmt2 : shiftAmt1);
Variable result = gen.newVariable(LIRKind.combine(a));
getArithmeticLIRGenerator().emitBinaryConst(result, AArch64ArithmeticOp.ROR, a, b);
return result;
};
}
return null;
}
/**
* Goal: Use AArch64's ror instruction for rotations.
*/
@MatchRule("(Or (LeftShift=x src shiftAmount) (UnsignedRightShift src (Sub=y Constant shiftAmount)))")
@MatchRule("(Or (UnsignedRightShift=x src shiftAmount) (LeftShift src (Sub=y Constant shiftAmount)))")
@MatchRule("(Or (LeftShift=x src (Negate shiftAmount)) (UnsignedRightShift src (Add=y Constant shiftAmount)))")
@MatchRule("(Or (UnsignedRightShift=x src (Negate shiftAmount)) (LeftShift src (Add=y Constant shiftAmount)))")
@MatchRule("(Or (LeftShift=x src shiftAmount) (UnsignedRightShift src (Negate=y shiftAmount)))")
@MatchRule("(Or (UnsignedRightShift=x src shiftAmount) (LeftShift src (Negate=y shiftAmount)))")
public ComplexMatchResult rotationExpander(ValueNode src, ValueNode shiftAmount, ValueNode x, ValueNode y) {
assert isNumericInteger(src);
assert shiftAmount.getStackKind().getBitCount() == 32 : Assertions.errorMessage(shiftAmount);
if (y instanceof SubNode || y instanceof AddNode) {
BinaryNode binary = (BinaryNode) y;
ConstantNode delta = (ConstantNode) (binary.getX() != shiftAmount ? binary.getX() : binary.getY());
/*
* For this pattern to match a right rotate, then the "clamped" delta (i.e. the value of
* delta within a shift) must be 0.
*/
int opSize = src.getStackKind().getBitCount();
assert opSize == 32 || opSize == 64 : opSize;
long clampedDelta = delta.asJavaConstant().asInt() & (opSize - 1);
if (clampedDelta != 0) {
return null;
}
}
return builder -> {
Value a = operand(src);
Value b;
if (y instanceof AddNode) {
b = x instanceof LeftShiftNode ? operand(shiftAmount) : getArithmeticLIRGenerator().emitNegate(operand(shiftAmount), false);
} else {
b = x instanceof LeftShiftNode ? getArithmeticLIRGenerator().emitNegate(operand(shiftAmount), false) : operand(shiftAmount);
}
return getArithmeticLIRGenerator().emitBinary(LIRKind.combine(a, b), AArch64ArithmeticOp.ROR, false, a, b);
};
}
/**
* Goal: Use AArch64 binary shift add/sub ops to fold shift.
*/
@MatchRule("(Add=binary a (LeftShift=shift b Constant))")
@MatchRule("(Add=binary a (RightShift=shift b Constant))")
@MatchRule("(Add=binary a (UnsignedRightShift=shift b Constant))")
@MatchRule("(Sub=binary a (LeftShift=shift b Constant))")
@MatchRule("(Sub=binary a (RightShift=shift b Constant))")
@MatchRule("(Sub=binary a (UnsignedRightShift=shift b Constant))")
public ComplexMatchResult addSubShift(BinaryNode binary, ValueNode a, BinaryNode shift) {
AArch64ArithmeticOp op = binaryOpMap.get(binary.getClass());
assert op != null;
return emitBinaryShift(op, a, (ShiftNode<?>) shift);
}
/**
* Goal: Use AArch64 binary shift logic ops to fold shift.
*/
@MatchRule("(And=binary a (LeftShift=shift b Constant))")
@MatchRule("(And=binary a (RightShift=shift b Constant))")
@MatchRule("(And=binary a (UnsignedRightShift=shift b Constant))")
@MatchRule("(Or=binary a (LeftShift=shift b Constant))")
@MatchRule("(Or=binary a (RightShift=shift b Constant))")
@MatchRule("(Or=binary a (UnsignedRightShift=shift b Constant))")
@MatchRule("(Xor=binary a (LeftShift=shift b Constant))")
@MatchRule("(Xor=binary a (RightShift=shift b Constant))")
@MatchRule("(Xor=binary a (UnsignedRightShift=shift b Constant))")
@MatchRule("(And=binary a (Not (LeftShift=shift b Constant)))")
@MatchRule("(And=binary a (Not (RightShift=shift b Constant)))")
@MatchRule("(And=binary a (Not (UnsignedRightShift=shift b Constant)))")
@MatchRule("(Or=binary a (Not (LeftShift=shift b Constant)))")
@MatchRule("(Or=binary a (Not (RightShift=shift b Constant)))")
@MatchRule("(Or=binary a (Not (UnsignedRightShift=shift b Constant)))")
@MatchRule("(Xor=binary a (Not (LeftShift=shift b Constant)))")
@MatchRule("(Xor=binary a (Not (RightShift=shift b Constant)))")
@MatchRule("(Xor=binary a (Not (UnsignedRightShift=shift b Constant)))")
public ComplexMatchResult logicShift(BinaryNode binary, ValueNode a, BinaryNode shift) {
AArch64ArithmeticOp op;
ValueNode operand = binary.getX() == a ? binary.getY() : binary.getX();
if (operand instanceof NotNode) {
op = logicalNotOpMap.get(binary.getClass());
} else {
op = binaryOpMap.get(binary.getClass());
}
assert op != null;
return emitBinaryShift(op, a, (ShiftNode<?>) shift);
}
/**
* Goal: fold shift into negate operation using AArch64's sub (shifted register) instruction.
*/
@MatchRule("(Negate (UnsignedRightShift=shift a Constant=b))")
@MatchRule("(Negate (RightShift=shift a Constant=b))")
@MatchRule("(Negate (LeftShift=shift a Constant=b))")
public ComplexMatchResult negShift(BinaryNode shift, ValueNode a, ConstantNode b) {
assert isNumericInteger(a, b);
int shiftAmt = getClampedShiftAmt((ShiftNode<?>) shift);
AArch64Assembler.ShiftType shiftType = shiftTypeMap.get(shift.getClass());
return builder -> {
AllocatableValue src = moveSp(gen.asAllocatable(operand(a)));
LIRKind kind = LIRKind.combine(operand(a));
Variable result = gen.newVariable(kind);
gen.append(new AArch64ArithmeticOp.BinaryShiftOp(AArch64ArithmeticOp.SUB, result, AArch64.zr.asValue(kind), src, shiftType, shiftAmt));
return result;
};
}
/**
* Goal: use AArch64's and not (bic) & or not (orn) instructions.
*/
@MatchRule("(And=logic value1 (Not=not value2))")
@MatchRule("(Or=logic value1 (Not=not value2))")
public final ComplexMatchResult bitwiseLogicNot(BinaryNode logic, NotNode not) {
assert isNumericInteger(logic);
AArch64ArithmeticOp op = logicalNotOpMap.get(logic.getClass());
assert op != null;
ValueNode src1 = logic.getX() == not ? logic.getY() : logic.getX();
ValueNode src2 = not.getValue();
return builder -> {
Value a = operand(src1);
Value b = operand(src2);
LIRKind resultKind = LIRKind.combine(a, b);
return getArithmeticLIRGenerator().emitBinary(resultKind, op, false, a, b);
};
}
/**
* Goal: Use AArch64's bitwise exclusive or not (eon) instruction.
*
* Note that !(A^B) == (!A)^B == A^(!B).
*/
@MatchRule("(Not (Xor value1 value2))")
@MatchRule("(Xor value1 (Not value2))")
@MatchRule("(Xor (Not value1) value2)")
public ComplexMatchResult bitwiseNotXor(ValueNode value1, ValueNode value2) {
return builder -> {
Value a = operand(value1);
Value b = operand(value2);
LIRKind resultKind = LIRKind.combine(a, b);
return getArithmeticLIRGenerator().emitBinary(resultKind, AArch64ArithmeticOp.EON, true, a, b);
};
}
/**
* Checks whether this multiply operation which can fold in a sign extend operation . This can
* happen if:
*
* <ul>
* <li>The multiply result is of type long</li>
* <li>Both inputs are sign extended from 32 bits to 64 bits</li>
* </ul>
*/
private static boolean isI2LMultiply(MulNode mul, SignExtendNode x, SignExtendNode y) {
if (mul.getStackKind() == JavaKind.Long) {
assert x.getResultBits() == Long.SIZE && y.getResultBits() == Long.SIZE : x + " " + y;
return x.getInputBits() == Integer.SIZE && y.getInputBits() == Integer.SIZE;
}
return false;
}
/**
* Goal: use AArch64's (i32,i32) -> i64 multiply instructions to fold away sign extensions.
*/
@MatchRule("(Add=binary (Mul=mul (SignExtend a) (SignExtend b)) c)")
@MatchRule("(Sub=binary c (Mul=mul (SignExtend a) (SignExtend b)))")
public ComplexMatchResult signedMultiplyAddSubLong(BinaryNode binary, MulNode mul, ValueNode a, ValueNode b, ValueNode c) {
assert isNumericInteger(binary, mul, a, b, c);
if (isI2LMultiply(mul, (SignExtendNode) mul.getX(), (SignExtendNode) mul.getY())) {
if (binary instanceof AddNode) {
return builder -> getArithmeticLIRGenerator().emitIntegerMAdd(operand(a), operand(b), operand(c), true);
}
return builder -> getArithmeticLIRGenerator().emitIntegerMSub(operand(a), operand(b), operand(c), true);
} else {
return null;
}
}
/**
* Goal: use AArch64's (i32,i32) -> i64 multiply instructions to fold away sign extensions.
*/
@MatchRule("(Negate (Mul=mul (SignExtend=ext1 a) (SignExtend=ext2 b)))")
@MatchRule("(Mul=mul (Negate (SignExtend=ext1 a)) (SignExtend=ext2 b))")
public ComplexMatchResult signedMultiplyNegLong(MulNode mul, SignExtendNode ext1, SignExtendNode ext2, ValueNode a, ValueNode b) {
assert isNumericInteger(mul, ext1, ext2, a, b);
if (isI2LMultiply(mul, ext1, ext2)) {
LIRKind resultKind = LIRKind.fromJavaKind(gen.target().arch, JavaKind.Long);
return builder -> getArithmeticLIRGenerator().emitBinary(
resultKind, AArch64ArithmeticOp.SMNEGL, true, operand(a), operand(b));
} else {
return null;
}
}
/**
* Goal: use AArch64's (i32,i32) -> i64 multiply instructions to fold away sign extensions.
*/
@MatchRule("(Mul=mul (SignExtend a) (SignExtend b))")
public ComplexMatchResult signedMultiplyLong(MulNode mul, ValueNode a, ValueNode b) {
assert isNumericInteger(mul, a, b);
if (isI2LMultiply(mul, (SignExtendNode) mul.getX(), (SignExtendNode) mul.getY())) {
LIRKind resultKind = LIRKind.fromJavaKind(gen.target().arch, JavaKind.Long);
return builder -> getArithmeticLIRGenerator().emitBinary(
resultKind, AArch64ArithmeticOp.SMULL, true, operand(a), operand(b));
} else {
return null;
}
}
/**
* Goal: Use AArch64's add/sub (extended register) instructions to fold in and operand.
*/
@MatchRule("(Add=op x (And y Constant=constant))")
@MatchRule("(Sub=op x (And y Constant=constant))")
public ComplexMatchResult mergeDowncastIntoAddSub(BinaryNode op, ValueNode x, ValueNode y, ConstantNode constant) {
assert isNumericInteger(constant);
long mask = constant.asJavaConstant().asLong() & CodeUtil.mask(op.getStackKind().getBitCount());
if (mask != 0xFFL && mask != 0xFFFFL && mask != 0xFFFFFFFFL) {
return null;
}
int numBits = 64 - Long.numberOfLeadingZeros(mask);
return emitExtendedAddSubShift(op, x, y, getZeroExtendType(numBits), 0);
}
/**
* Goal: Use AArch64's add/sub (extended register) instruction.
*/
@MatchRule("(Add=op x (SignExtend=ext y))")
@MatchRule("(Sub=op x (SignExtend=ext y))")
@MatchRule("(Add=op x (ZeroExtend=ext y))")
@MatchRule("(Sub=op x (ZeroExtend=ext y))")
public ComplexMatchResult mergeSignExtendIntoAddSub(BinaryNode op, UnaryNode ext, ValueNode x, ValueNode y) {
if (!isSupportedExtendedAddSubShift((IntegerConvertNode<?>) ext, 0)) {
return null;
}
ExtendType extType;
if (ext instanceof SignExtendNode) {
extType = getSignExtendType(((SignExtendNode) ext).getInputBits());
} else {
extType = getZeroExtendType(((ZeroExtendNode) ext).getInputBits());
}
return emitExtendedAddSubShift(op, x, y, extType, 0);
}
/**
* Goal: Use AArch64's multiple-negate (mneg) instruction.
*/
@MatchRule("(Mul (Negate a) b)")
@MatchRule("(Negate (Mul a b))")
public final ComplexMatchResult multiplyNegate(ValueNode a, ValueNode b) {
if (isNumericInteger(a, b)) {
return builder -> getArithmeticLIRGenerator().emitMNeg(operand(a), operand(b));
}
return null;
}
/**
* Goal: Use AArch64's multiply-add (madd) and multiply-subtract (msub) instructions.
*/
@MatchRule("(Add=binary (Mul a b) c)")
@MatchRule("(Sub=binary c (Mul a b))")
public final ComplexMatchResult multiplyAddSub(BinaryNode binary, ValueNode a, ValueNode b, ValueNode c) {
if (!(isNumericInteger(a, b, c))) {
return null;
}
if (binary instanceof AddNode) {
return builder -> getArithmeticLIRGenerator().emitIntegerMAdd(operand(a), operand(b), operand(c), false);
}
return builder -> getArithmeticLIRGenerator().emitIntegerMSub(operand(a), operand(b), operand(c), false);
}
/**
* Goal: Transform ((x & (1 << n)) == 0) -> (tbz/tbnz n label).
*/
@MatchRule("(If (IntegerTest value Constant=a))")
public ComplexMatchResult testBitAndBranch(IfNode root, ValueNode value, ConstantNode a) {
if (isNumericInteger(value)) {
long constant = a.asJavaConstant().asLong();
if (Long.bitCount(constant) == 1) {
return emitBitTestAndBranch(root.trueSuccessor(), root.falseSuccessor(), value,
root.getTrueSuccessorProbability(), Long.numberOfTrailingZeros(constant));
}
}
return null;
}
/**
* Goal: Transform (if x < 0) -> (tbz x, sizeOfBits(x) - 1, label).
*/
@MatchRule("(If (IntegerLessThan=lessNode x Constant=y))")
public ComplexMatchResult checkNegativeAndBranch(IfNode root, IntegerLessThanNode lessNode, ValueNode x, ConstantNode y) {
assert isNumericInteger(x);
if (y.isJavaConstant() && (0 == y.asJavaConstant().asLong()) && lessNode.condition().equals(CanonicalCondition.LT)) {
return emitBitTestAndBranch(root.falseSuccessor(), root.trueSuccessor(), x,
1.0 - root.getTrueSuccessorProbability(), x.getStackKind().getBitCount() - 1);
}
return null;
}
/**
* Goal: Use directly AArch64's single-precision fsqrt op.
*/
@MatchRule("(FloatConvert=a (Sqrt (FloatConvert=b c)))")
public final ComplexMatchResult floatSqrt(FloatConvertNode a, FloatConvertNode b, ValueNode c) {
if (isNumericFloat(a, c)) {
if (a.getFloatConvert() == FloatConvert.D2F && b.getFloatConvert() == FloatConvert.F2D) {
return builder -> getArithmeticLIRGenerator().emitMathSqrt(operand(c));
}
}
return null;
}
@MatchRule("(Conditional (IntegerBelow x y) Constant=cm1 (Conditional (IntegerEquals x y) Constant=c0 Constant=c1))")
public ComplexMatchResult normalizedIntegerCompare(ValueNode x, ValueNode y, ConstantNode cm1, ConstantNode c0, ConstantNode c1) {
if (cm1.getStackKind() == JavaKind.Int && cm1.asJavaConstant().asInt() == -1 && c0.getStackKind() == JavaKind.Int && c0.asJavaConstant().asInt() == 0 && c1.getStackKind() == JavaKind.Int &&
c1.asJavaConstant().asInt() == 1) {
LIRKind compareKind = gen.getLIRKind(x.stamp(NodeView.DEFAULT));
return builder -> getArithmeticLIRGenerator().emitNormalizedUnsignedCompare(compareKind, operand(x), operand(y));
}
return null;
}
@Override
public AArch64LIRGenerator getLIRGeneratorTool() {
return (AArch64LIRGenerator) gen;
}
protected AArch64ArithmeticLIRGenerator getArithmeticLIRGenerator() {
return (AArch64ArithmeticLIRGenerator) getLIRGeneratorTool().getArithmetic();
}
}
``` |
```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 cmd
import (
"regexp"
"testing"
"github.com/minishift/minishift/cmd/testing/cli"
"github.com/stretchr/testify/assert"
)
func Test_version_output_has_correct_format(t *testing.T) {
tee := cli.CreateTee(t, false)
runPrintVersion(nil, nil)
tee.Close()
versionString := tee.StdoutBuffer.String()
versionRegExp := "minishift v[0-9]+\\.[0-9]+\\.[0-9]+\\+[a-z0-9]{7,8}\n"
assert.Regexp(t, regexp.MustCompile(versionRegExp), versionString)
}
``` |
Hydrobius melaenus is a species of water scavenger beetle in the family Hydrophilidae. It is found in North America.
References
Further reading
Hydrophilinae
Articles created by Qbugbot
Beetles described in 1824 |
```sqlpl
-- Script: Get-TempTableColumns.sql
-- Author: Scott Sutherland
-- Description: Return a list of all temp table types.
-- Include table variables, local temp tables, and global temp tables.
SELECT 'tempdb' as 'Database_Name',
SCHEMA_NAME(t1.schema_id) AS 'Schema_Name',
t1.name AS 'Table_Name',
t2.name AS 'Column_Name',
t3.name AS 'Column_Type',
CASE
WHEN (SELECT CASE WHEN LEN(t1.name) - LEN(REPLACE(t1.name,'#','')) > 1 THEN 1 ELSE 0 END) = 1 THEN 'GlobalTempTable'
WHEN t1.name LIKE '%[_]%' AND (SELECT CASE WHEN LEN(t1.name) - LEN(REPLACE(t1.name,'#','')) = 1 THEN 1 ELSE 0 END) = 1 THEN 'LocalTempTable'
WHEN t1.name NOT LIKE '%[_]%' AND (SELECT CASE WHEN LEN(t1.name) - LEN(REPLACE(t1.name,'#','')) = 1 THEN 1 ELSE 0 END) = 1 THEN 'TableVariable'
ELSE NULL
END AS Table_Type,
t1.is_ms_shipped,
t1.is_published,
t1.is_schema_published,
t1.create_date,
t1.modify_date
FROM [tempdb].[sys].[objects] AS t1
JOIN [tempdb].[sys].[columns] AS t2 ON t1.OBJECT_ID = t2.OBJECT_ID
JOIN sys.types AS t3 ON t2.system_type_id = t3.system_type_id
WHERE t1.name LIKE '#%'
``` |
The following is a list of awards and nominations received by American actor, rapper, and film producer Will Smith throughout his career.
As a rapper Smith won four Grammy Awards for Best Rap Performance for "Parents Just Don't Understand" (1989), Best Rap Performance by a Duo or Group for "Summertime" (1992), and Best Rap Solo Performance for both "Men In Black" (1998), and "Gettin' Jiggy wit It" (1999).
He received the Academy Award, BAFTA Award, Golden Globe Award, Screen Actors Guild Award for his role as Richard Williams in King Richard (2021). He received single nominations for both the Emmy Award and Tony Award for producing Cobra Kai (2021) and Fela! (2009) respectively.
Major associations
Academy Awards
BAFTA Awards
Emmy Awards
Grammy Awards
Golden Globe Awards
Screen Actors Guild Awards
Tony Awards
Music
American Music Awards
!Pop rock
|-
|rowspan=4|1999
|rowspan=2|Will Smith
|Favorite Pop/Rock Male Artist
|
|rowspan=7|
|-
|Favorite Soul/R&B Male Artist
|rowspan=6
|-
|rowspan=2|Big Willie Style
|Favorite Pop/Rock Album
|-
|Favorite Soul/R&B Album
|-
|rowspan=2|2000
|"Wild Wild West"
|Favorite Soundtrack
|-
|rowspan=2|Will Smith
|rowspan=2|Favorite Pop/Rock Male Artist
|-
|2005
|-
|}
MTV Video Music Awards
|-
| rowspan=2|
| rowspan=2|"Parents Just Don't Understand" (with DJ Jazzy Jeff)
| Best Rap Video
|
|-
| Best Direction in a Video
| rowspan=4
|-
| rowspan=2|
| rowspan=2|"Summertime"
|Best Rap Video
|-
|Best Direction in a Video
|-
| rowspan=4|
| rowspan=4|"Men in Black"
| Best Male Video
|-
| Best Video from a Film
|rowspan=1
|-
| Best Choreography in a Video
| rowspan=2
|-
| Best Special Effects in a Video
|-
| rowspan=6|
| "Just the Two of Us"
| Best Male Video
|
|-
| rowspan=5|"Gettin' Jiggy wit It"
| Video of the Year
|
|-
| Best Rap Video
|
|-
| Best Dance Video
| rowspan=6
|-
| Best Choreography in a Video
|-
| Viewer's Choice
|-
| rowspan=6|
| rowspan=3|"Wild Wild West"
| Video of the Year
|-
| Best Video from a Film
|-
| Best Choreography in a Video
|-
| rowspan=3|"Miami"
| Best Male Video
|
|-
| Best Special Effects in a Video
| rowspan=4
|-
| Best Cinematography in a Video
|-
| rowspan=2|
| rowspan=2|"Black Suits Comin' (Nod Ya Head)"
| Best Video from a Film
|-
| Best Special Effects in a Video
|}
NRJ Music Awards
|-
| 1999
| Himself
| International Male Artist of the Year
|
Soul Train Music Awards
World Music Awards
Film and television
César Awards
Critics' Choice Awards
References
Lists of awards received by American actor
Lists of awards received by American musician |
Frederick Goodall (17 September 1822 – 29 July 1904) was a British artist.
Life
Frederick Goodall was born in London in 1822, the second son of steel line engraver Edward Goodall (1795–1870). He received his education at the Wellington Road Academy.
Goodall's first commission, for Isambard Brunel, was six watercolour paintings of the Thames Tunnel. Four of these were exhibited at the Royal Academy when Frederick was 16. His first oil won a Society of Arts silver medal. He exhibited work at the Royal Academy 27 times between 1838 and 1859. He was elected an Associate of the Royal Academy (ARA) in 1852 and a full Royal Academician (RA) in 1863.
Goodall visited Egypt twice; in 1858 and again in 1870, both times travelling and camping with Bedouin tribesmen. On his first visit to Egypt, he shared a house and studio with artist, Carl Haag and the pair often sketched together, both in the streets and outside Cairo, especially in the area around the Pyramids. On his second visit in 1870, he lived at Saqqara, near the Pyramids with the aim of directly observing Bedouin lifestyles. After his return to England, Goodall painted many variations of the same Eastern themes. In order to provide authentic detail to his paintings, Goodall brought back sheep and goats from Egypt. The Egyptian theme was prominent in his work, with 170 paintings being exhibited at the Royal Academy over 46 years.
Goodall's work received high praise and acclaim from critics and artists alike and he earned a fortune from his paintings.
He had a home built, Grims Dyke, Harrow Weald, (1870-2), designed by Norman Shaw, where he would entertain guests such as the Prince of Wales (later Edward VII).
Family
Goodall married Anne Thomson (26 Dec 1822 - 11 Aug 1869), daughter of the engraver James Thomson, in 1846. Among their five children were artists Frederick Trevelyan and Howard Goodall. Frederick Trevelyan was the more successful in a very short career, dying following a pistol accident at the age of 24. Following the death of Anne, who is buried in Highgate Cemetery in 1869, Goodall married artist Alice May Tarry in 1872. they had two children.
Frederick Goodall's brother, Edward Angelo Goodall (1819–1908) was also a highly gifted artist who exhibited at the RA from 1846 to 1853. A specialist in watercolours, he was invited to join the Royal Watercolour Society in 1856 and exhibited 328 pictures at its exhibitions. It was Edward who had the distressing task of arranging the sale of his brother's pictures and effects when he was declared bankrupt in 1902. His other brother Walter Goodall, and sister Eliza Goodall, were also artists.
Death
Although hugely wealthy at the height of his career, his income dwindled during his final years and when he died in 1904 he was bankrupt. He was buried in a family vault (no.16876) on the western side of Highgate Cemetery.
Gallery
See also
Edward Goodall
Edward Angelo Goodall
Walter Goodall (painter)
Notes
References
Frederick Goodall, The Reminiscences of Frederick Goodall R.A.. London and Newcastle upon Tyne: Walter Scott Publishing Co. Ltd, 1902.
N. G. Slarke, Frederick Goodall, R.A.. Oundle, 1981
John Ramm, 'Artist Adventurer', 'Antique Dealer & Collectors Guide, December 1997, Vol51, No. 5
External links
1822 births
1904 deaths
Burials at Highgate Cemetery
19th-century English painters
20th-century English painters
Artists' Rifles soldiers
English male painters
English watercolourists
Orientalist painters
Painters from London
Royal Academicians
20th-century English male artists
19th-century English male artists |
William Knott was an association football player who represented New Zealand, playing in New Zealand's first ever official international.
Knott scored in New Zealand's inaugural A-international fixture, with Ted Cook scoring a brace as New Zealand beat Australia 3–1 on 17 June 1922. It was his only appearance in official internationals.
References
Year of birth missing
Year of death missing
New Zealand men's association footballers
New Zealand men's international footballers
Men's association football players not categorized by position |
Jerry Baker is well known and recognizable as a veteran sports announcer in Indiana. He is best known as the voice of the Indiana High School Athletic Association (IHSAA) Basketball State Championships on television having served as the anchor announcer for nearly 30 years. He is the former voice of the Indiana Pacers and currently is a reporter for the Indy Racing League (IRL), and the Brickyard 400. He has long held the position as the turn 1 announcer on the Indianapolis Motor Speedway Radio Network during the airing of the Indianapolis 500. Baker, most recently, was the play-by-play announcer for HomeTown Sports and News (HTSN) on Friday nights on WRTV digital side channel 6.2 and Hometown Sports Indiana.
Baker is a member of the Indiana Basketball Hall of Fame, inducted as a contributor (broadcaster). He is a native of Sullivan, Indiana and holds a degree in Broadcasting from Indiana State University. He and his wife Ramona, are residents of Indianapolis, Indiana.
During his duties on the IMS Radio Network, Baker has on occasion, used his wife Ramona as his spotter/assistant.
On October 5, 2017, Jerry was announced as the PA announcer for the Indiana Pacers
Notes
External links
Indiana Basketball Hall of Fame
Year of birth missing (living people)
Living people
Indiana State University alumni
Indiana Pacers announcers
Television anchors from Indianapolis
Motorsport announcers
National Basketball Association broadcasters
People from Sullivan, Indiana
High school basketball announcers in the United States
Indianapolis Colts announcers
People from Indianapolis
National Football League announcers
American Basketball Association announcers |
Christian Duguay (born March 30, 1956) is a Canadian film director.
Career
Duguay graduated from the Film Production program of Concordia University, in 1979. That year, his film Piece Interrompue Pour Piano Sauvage, together with Harold Trépanier, took the Best Cinematography award at the 11th Canadian Student Film Festival.
He began his professional career as a cameraman and jack-of-all-trades, working in documentaries, commercials and music videos. He became known as an expert with the Steadicam and shot many movies of the week in the United States. He is best known for directing the action films Screamers (1995) starring Peter Weller and Roy Dupuis and The Art of War (2000) starring Wesley Snipes and Michael Biehn. He directed the 1994 CBS/CBC drama, Million Dollar Babies, starring Beau Bridges based on the Dionne Quintuplets. In May 2003, he directed the Emmy nominated miniseries Hitler: The Rise of Evil, which aired on the CBC, and in 2009 a television mini-series about Saint Augustine of Hippo. He followed this with a two-part mini-series released 2010 about Pope Pius XII and the occupation of Rome by the Nazis during World War II.
Personal life
Duguay was married to Liliana Komorowska, who appeared in many of his films, including Scanners III: The Takeover, Screamers, and The Art of War. He has four children, Orlando, Sebastien, Natalia, and Victoria.
Filmography
Scanners II: The New Order (1991)
Live Wire (1992)
Scanners III: The Takeover (1992)
Snowbound: The Jim and Jennifer Stolpa Story (1994) (TV)
Million Dollar Babies (1994) (TV)
Screamers (1995)
The Assignment (1997)
Joan of Arc (1999) (TV)
The Art of War (2000)
Extreme Ops (2002)
Hitler: The Rise of Evil (2003) (TV)
Human Trafficking (2005) (TV)
Lies My Mother Told Me (2005) (TV)
Boot Camp (2007)
Coco Chanel (2008) (TV)
Restless Heart: The Confessions of Saint Augustine (2010) (TV)
Pope Paul XII (2010)
Cenerentola (2011) (TV)
Anna Karenina (2013)
Jappeloup (2013)
Belle & Sebastian: The Adventure Continues (2015)
A Bag of Marbles (2017)
Awards and nominations
2006, Directors Guild of Canada Craft Award (Outstanding Direction - Television Movie/Mini-Series) for Human Trafficking (2005) (TV)
2006, Gemini Award (Best Dramatic Mini-Series) for Human Trafficking (2005) (TV)
2006, nominated for a Gemini Award (Best Direction in a Dramatic Program or Mini-Series) for Lies My Mother Told Me (2005) (TV)
2003, nominated for an Emmy Award (Outstanding Miniseries) for Hitler: The Rise of Evil (2003) (TV)
1999, nominated for an Emmy Award (Outstanding Directing for a Miniseries or a Movie) for Joan of Arc (1999) (TV)
1996, Gemini Award (Best Direction in a Dramatic Program or Mini-Series) for Million Dollar Babies (1994) (TV)
References
External links
Homepage CDFilms Christian Duguay
1956 births
Canadian television directors
Canadian people of French descent
Film directors from Montreal
Horror film directors
Living people |
Pierre Lacroix may refer to:
Pierre Lacroix (theologian), French 18th century theologian
Pierre Lacroix (rugby union) (1935–2019), French rugby union player for SU Agen Lot-et-Garonne
Pierre Lacroix (ice hockey, born 1948), former NHL General Manager and team president
Pierre Lacroix (ice hockey, born 1959), retired Canadian ice hockey player |
Hillside, a private school in Addis Ababa, Ethiopia, offers preschool, primary, secondary and higher education. It meets in 3 different locations in order to keep teacher student ratio low.
In August 2016, Hillside hosted a "Cosmic Ray Workshop", a teacher-training workshop sponsored by QuarkNet.
As of September 2020, the school was closed by the Ethiopian government as part of COVID-19 measures. Registration and entrance exams were conducted observing social distancing precautions.
References
Schools in Addis Ababa
Elementary and primary schools in Ethiopia
Secondary schools in Ethiopia |
In the Book of Genesis, Jehovah-jireh or Yahweh Yireh was the location of the binding of Isaac, where Yahweh told Abraham to offer his son Isaac as a burnt offering. Abraham named the place after God provided a ram to sacrifice in place of Isaac.
Translations
In the Masoretic Text, the name is (yhwh yirʾeh). The first word of the phrase is the Tetragrammaton (), YHWH, the most common name of God in the Hebrew Bible, which is usually given the pronunciation Yahweh in scholarly works. Jehovah is a Christian anglicized vocalization of this name using the vowels of the Tetragrammaton according to the Masoretic text. Following a Jewish tradition of not pronouncing God's proper name, YHWH is generally translated in English bibles as "the " or "" in capital letters, just as in Jewish worship it is traditionally not pronounced but the word Adonai or Elohim ("God") is used instead.
The early Septuagint translation into Greek gives the meaning as "The Lord hath seen." One Latin version of the Christian Bible rendered the name in Latin as Dominus videt ("The sees"). The King James Version follows this meaning, as quoted above.
Jewish translations of the verse into English include,
However, some modern translations, including the NIV, render it "the will provide", amplifying the literal meaning along the lines of "the will see to it", and referring to Abraham's earlier words in , "God himself will provide the lamb".
Interpretation
Some Jewish commentators see the name as alluding to the future importance of the place as the site of Solomon's Temple. The Targumim do not regard "Jehovah-jireh" as a proper name.
Considering the passive construction of Abraham's words in verse 14, "In the mount of the it shall be seen", Calvin comments that it teaches "that God not only looks upon those who are his, but also makes his help manifest to them..." John Wesley and Matthew Henry go further, suggesting that "perhaps it may refer to God manifest in the flesh."
Other modern usage
John Newton translates "Jehovah-jireh" as "The Lord will provide" in his hymn, "When Troubles Assail."
It is also the title of a William Cowper hymn.
Jehovah Jireh is the title of an 1867 book by William Plumer.
"Jehovah Jireh" is the title of several modern songs, including one by Don Moen included on his 1986 debut album Give Thanks; various others have covered it, including thrash metal band Deliverance on their 1989 self-titled debut album.
Chandra Currelley performed another song with the same title in the 2006 play What's Done in the Dark.
R&B singer Frank Ocean also uses the name "Jehovah Jireh" in his debut album/mixtape Nostalgia, Ultra in the song is titled 'We All Try".
Organizations bearing the name include Jehovah Jireh Children's Homes in Kenya, founded by Manasses Kuria, and churches such as Jehovah Jireh Samoan Assembly of God in Victorville, California, United States.
Maverick City Music and Elevation Worship released a song called "Jireh" in 2021.
See also
Jehovah-nissi
Jehovah-shammah
Notable people
Jireh Swift Billings, son of Franklin S. Billings, Jr.
References
Hebrew words and phrases in the Hebrew Bible
Torah places |
```smalltalk
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace Xamarin.Forms.Controls
{
public class ActionSheetGallery : ContentPage
{
public ActionSheetGallery()
{
AutomationId = "ActionSheetPage";
var extras = new string[] {
"Extra One",
"Extra Two",
"Extra Three",
"Extra Four",
"Extra Five",
"Extra Six",
"Extra Seven",
"Extra Eight",
"Extra Nine",
"Extra Ten",
"Extra Eleven",
};
Content = new ScrollView
{
Content = new StackLayout
{
Spacing = 0,
Children = {
MakeActionSheetButton (this, "ActionSheet Cancel", null, "Cancel", null),
MakeActionSheetButton (this, "ActionSheet Cancel Extras", null, "Cancel", null, extras),
MakeActionSheetButton (this, "ActionSheet Cancel Destruction", null, "Cancel", "Destruction"),
MakeActionSheetButton (this, "ActionSheet Cancel Destruction Extras", null, "Cancel", "Destruction", extras),
MakeActionSheetButton (this, "ActionSheet Destruction", null, null, "Destruction"),
MakeActionSheetButton (this, "ActionSheet Destruction Extras", null, null, "Destruction", extras),
MakeActionSheetButton (this, "ActionSheet Extras", null, null, null, extras),
MakeActionSheetButton (this, "ActionSheet Title", "Title", null, null),
MakeActionSheetButton (this, "ActionSheet Title Cancel", "Title", "Cancel", null),
MakeActionSheetButton (this, "ActionSheet Title Cancel Extras", "Title", "Cancel", null, extras),
MakeActionSheetButton (this, "ActionSheet Title Cancel Destruction", "Title", "Cancel", "Destruction"),
MakeActionSheetButton (this, "ActionSheet Title Cancel Destruction Extras", "Title", "Cancel", "Destruction", extras),
MakeActionSheetButton (this, "ActionSheet Title Destruction", "Title", null, "Destruction"),
MakeActionSheetButton (this, "ActionSheet Title Destruction Extras", "Title", null, "Destruction", extras),
MakeActionSheetButton (this, "ActionSheet Title Extras", "Title", null, null, extras),
}
}
};
}
static Button MakeActionSheetButton(Page page, string buttonText, string title, string cancel, string destruction, params string[] extras)
{
var actionSheetButton = new Button
{
Text = buttonText
};
actionSheetButton.Clicked += async (sender, e) => await page.DisplayActionSheet(title, cancel, destruction, extras);
return actionSheetButton;
}
}
}
``` |
George Elmer Murk (April 16, 1894 – March 24, 1971) was an American firefighter, businessman, and politician.
Murk was born in Minneapolis, Minnesota. He went to the Minneapolis public schools and the Minneapolis Business College. He lived in Minneapolis with his wife and family. Murk was a firefighter with the Minneapolis Fire Department from 1917 to 1939. Murk was also involved with the Minneapolis Musicians Association from 1934 to 1961. Murk served in the Minnesota House of Representatives from 1945 to 1954 and from 1957 to 1962. He died in Minneapolis, Minnesota.
References
1894 births
1971 deaths
Businesspeople from Minneapolis
Politicians from Minneapolis
20th-century American firefighters
Members of the Minnesota House of Representatives |
The Journal of Nursing Education is a monthly peer-reviewed nursing journal. It was established in 1962 and is abstracted and indexed in MEDLINE.
History
The Journal of Nursing Education began as a quarterly journal published by McGraw-Hill. The first editor-in-chief was Alice Bicknell, although she was supplanted by a small editorial board in the journal's second year. This editorial board continued their oversight until 1981, at which time SLACK Incorporated became the journal's publisher and assigned Margaret Carnine as its editor. , the editor-in-chief is Amy J. Barton, PhD, and the associate editor is Teri A. Murray, PhD.
In 2002, the journal increased from nine issues per year to 12.
Editors-in-chief
The following persons have been or are editor-in-chief of the Journal of Nursing Education:
Alice Bicknell (1962)
Editorial board (1963–1980)
Margaret Carnine (1981–1982)
Rheba de Tornyay (1983–1990)
Christine A. Tanner (1991–2012)
Janis P. Bellack (2012–2018)
Amy J. Barton (2018–present)
See also
List of nursing journals
References
External links
General nursing journals
Monthly journals
English-language journals
Academic journals established in 1962 |
The 1967 British Open Championship was held at the Lansdowne Club in London from 12–21 December 1966. Jonah Barrington won the title defeating Aftab Jawaid in the final to become the first British winner since 1938.
Seeds
Draw and results
First round
Second round
Main draw
+ Shafik withdrew after breaking his hand in practice.
Third Place
Muhammad Yasin beat Ibrahim Amin 9-1 9-6 10-9
References
Men's British Open Championship
Men's British Open Squash Championship
Men's British Open Squash Championship
Men's British Open Squash Championship
Squash competitions in London |
```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\Aiplatform\Resource;
use Google\Service\Aiplatform\GoogleCloudAiplatformV1BatchImportEvaluatedAnnotationsRequest;
use Google\Service\Aiplatform\GoogleCloudAiplatformV1BatchImportEvaluatedAnnotationsResponse;
use Google\Service\Aiplatform\GoogleCloudAiplatformV1ListModelEvaluationSlicesResponse;
use Google\Service\Aiplatform\GoogleCloudAiplatformV1ModelEvaluationSlice;
/**
* The "slices" collection of methods.
* Typical usage is:
* <code>
* $aiplatformService = new Google\Service\Aiplatform(...);
* $slices = $aiplatformService->projects_locations_models_evaluations_slices;
* </code>
*/
class ProjectsLocationsModelsEvaluationsSlices extends \Google\Service\Resource
{
/**
* Imports a list of externally generated EvaluatedAnnotations.
* (slices.batchImport)
*
* @param string $parent Required. The name of the parent ModelEvaluationSlice
* resource. Format: `projects/{project}/locations/{location}/models/{model}/eva
* luations/{evaluation}/slices/{slice}`
* @param GoogleCloudAiplatformV1BatchImportEvaluatedAnnotationsRequest $postBody
* @param array $optParams Optional parameters.
* @return GoogleCloudAiplatformV1BatchImportEvaluatedAnnotationsResponse
* @throws \Google\Service\Exception
*/
public function batchImport($parent, GoogleCloudAiplatformV1BatchImportEvaluatedAnnotationsRequest $postBody, $optParams = [])
{
$params = ['parent' => $parent, 'postBody' => $postBody];
$params = array_merge($params, $optParams);
return $this->call('batchImport', [$params], GoogleCloudAiplatformV1BatchImportEvaluatedAnnotationsResponse::class);
}
/**
* Gets a ModelEvaluationSlice. (slices.get)
*
* @param string $name Required. The name of the ModelEvaluationSlice resource.
* Format: `projects/{project}/locations/{location}/models/{model}/evaluations/{
* evaluation}/slices/{slice}`
* @param array $optParams Optional parameters.
* @return GoogleCloudAiplatformV1ModelEvaluationSlice
* @throws \Google\Service\Exception
*/
public function get($name, $optParams = [])
{
$params = ['name' => $name];
$params = array_merge($params, $optParams);
return $this->call('get', [$params], GoogleCloudAiplatformV1ModelEvaluationSlice::class);
}
/**
* Lists ModelEvaluationSlices in a ModelEvaluation.
* (slices.listProjectsLocationsModelsEvaluationsSlices)
*
* @param string $parent Required. The resource name of the ModelEvaluation to
* list the ModelEvaluationSlices from. Format: `projects/{project}/locations/{l
* ocation}/models/{model}/evaluations/{evaluation}`
* @param array $optParams Optional parameters.
*
* @opt_param string filter The standard list filter. * `slice.dimension` - for
* =.
* @opt_param int pageSize The standard list page size.
* @opt_param string pageToken The standard list page token. Typically obtained
* via ListModelEvaluationSlicesResponse.next_page_token of the previous
* ModelService.ListModelEvaluationSlices call.
* @opt_param string readMask Mask specifying which fields to read.
* @return GoogleCloudAiplatformV1ListModelEvaluationSlicesResponse
* @throws \Google\Service\Exception
*/
public function listProjectsLocationsModelsEvaluationsSlices($parent, $optParams = [])
{
$params = ['parent' => $parent];
$params = array_merge($params, $optParams);
return $this->call('list', [$params], GoogleCloudAiplatformV1ListModelEvaluationSlicesResponse::class);
}
}
// Adding a class alias for backwards compatibility with the previous class name.
class_alias(ProjectsLocationsModelsEvaluationsSlices::class, your_sha256_hashtionsSlices');
``` |
```rust
use crate::atom_table::*;
use crate::forms::*;
use crate::instructions::*;
use crate::iterators::*;
use crate::machine::loader::*;
use crate::machine::machine_errors::CompilationError;
use crate::machine::preprocessor::*;
use crate::parser::ast::*;
use crate::parser::dashu::Rational;
use crate::variable_records::*;
use dashu::Integer;
use indexmap::{IndexMap, IndexSet};
use std::cell::Cell;
use std::cmp::Ordering;
use std::collections::VecDeque;
use std::hash::{Hash, Hasher};
use std::ops::{Deref, DerefMut};
#[derive(Debug, Clone)] //, PartialOrd, PartialEq, Eq, Hash)]
pub struct BranchNumber {
branch_num: Rational,
delta: Rational,
}
impl Default for BranchNumber {
fn default() -> Self {
Self {
branch_num: Rational::from(1u64 << 63),
delta: Rational::from(1),
}
}
}
impl PartialEq<BranchNumber> for BranchNumber {
#[inline]
fn eq(&self, rhs: &BranchNumber) -> bool {
self.branch_num == rhs.branch_num
}
}
impl Eq for BranchNumber {}
impl Hash for BranchNumber {
#[inline(always)]
fn hash<H: Hasher>(&self, hasher: &mut H) {
self.branch_num.hash(hasher)
}
}
impl PartialOrd<BranchNumber> for BranchNumber {
#[inline]
fn partial_cmp(&self, rhs: &BranchNumber) -> Option<Ordering> {
self.branch_num.partial_cmp(&rhs.branch_num)
}
}
impl BranchNumber {
fn split(&self) -> BranchNumber {
BranchNumber {
branch_num: self.branch_num.clone() + &self.delta / Rational::from(2),
delta: &self.delta / Rational::from(4),
}
}
fn incr_by_delta(&self) -> BranchNumber {
BranchNumber {
branch_num: self.branch_num.clone() + &self.delta,
delta: self.delta.clone(),
}
}
fn halve_delta(&self) -> BranchNumber {
BranchNumber {
branch_num: self.branch_num.clone(),
delta: &self.delta / Rational::from(2),
}
}
}
#[derive(Debug, Clone, PartialEq, Eq, Hash)]
pub struct VarInfo {
var_ptr: VarPtr,
chunk_type: ChunkType,
classify_info: ClassifyInfo,
lvl: Level,
}
#[derive(Debug, Clone, PartialEq, Eq, Hash)]
pub struct ChunkInfo {
chunk_num: usize,
term_loc: GenContext,
// pointer to incidence, term occurrence arity.
vars: Vec<VarInfo>,
}
#[derive(Debug)]
pub struct BranchArm {
pub arm_terms: Vec<QueryTerm>,
}
#[derive(Debug, Clone, PartialEq, Eq, Hash)]
pub struct BranchInfo {
branch_num: BranchNumber,
chunks: Vec<ChunkInfo>,
}
impl BranchInfo {
fn new(branch_num: BranchNumber) -> Self {
Self {
branch_num,
chunks: vec![],
}
}
}
type BranchMapInt = IndexMap<VarPtr, Vec<BranchInfo>>;
#[derive(Debug, Clone)]
pub struct BranchMap(BranchMapInt);
impl Deref for BranchMap {
type Target = BranchMapInt;
#[inline(always)]
fn deref(&self) -> &BranchMapInt {
&self.0
}
}
impl DerefMut for BranchMap {
#[inline(always)]
fn deref_mut(&mut self) -> &mut BranchMapInt {
&mut self.0
}
}
type RootSet = IndexSet<BranchNumber>;
#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
pub struct ClassifyInfo {
arg_c: usize,
arity: usize,
}
enum TraversalState {
// construct a QueryTerm::Branch with number of disjuncts, reset
// the chunk type to that of the chunk preceding the disjunct and the chunk_num.
BuildDisjunct(usize),
// add the last disjunct to a QueryTerm::Branch, continuing from
// where it leaves off.
BuildFinalDisjunct(usize),
Fail,
GetCutPoint { var_num: usize, prev_b: bool },
Cut { var_num: usize, is_global: bool },
CutPrev(usize),
ResetCallPolicy(CallPolicy),
Term(Term),
OverrideGlobalCutVar(usize),
ResetGlobalCutVarOverride(Option<usize>),
RemoveBranchNum, // pop the current_branch_num and from the root set.
AddBranchNum(BranchNumber), // set current_branch_num, add it to the root set
RepBranchNum(BranchNumber), // replace current_branch_num and the latest in the root set
}
#[derive(Debug)]
pub struct VariableClassifier {
call_policy: CallPolicy,
current_branch_num: BranchNumber,
current_chunk_num: usize,
current_chunk_type: ChunkType,
branch_map: BranchMap,
var_num: usize,
root_set: RootSet,
global_cut_var_num: Option<usize>,
global_cut_var_num_override: Option<usize>,
}
#[derive(Debug, Default)]
pub struct VarData {
pub records: VariableRecords,
pub global_cut_var_num: Option<usize>,
pub allocates: bool,
}
impl VarData {
fn emit_initial_get_level(&mut self, build_stack: &mut ChunkedTermVec) {
let global_cut_var_num = if let &Some(global_cut_var_num) = &self.global_cut_var_num {
match &self.records[global_cut_var_num].allocation {
VarAlloc::Perm(..) => Some(global_cut_var_num),
VarAlloc::Temp { term_loc, .. } if term_loc.chunk_num() > 0 => {
Some(global_cut_var_num)
}
_ => None,
}
} else {
None
};
if let Some(global_cut_var_num) = global_cut_var_num {
let term = QueryTerm::GetLevel(global_cut_var_num);
self.records[global_cut_var_num].allocation =
VarAlloc::Perm(0, PermVarAllocation::Pending);
match build_stack.front_mut() {
Some(ChunkedTerms::Branch(_)) => {
build_stack.push_front(ChunkedTerms::Chunk(VecDeque::from(vec![term])));
}
Some(ChunkedTerms::Chunk(chunk)) => {
chunk.push_front(term);
}
None => {
unreachable!()
}
}
}
}
}
pub type ClassifyFactResult = (Term, VarData);
pub type ClassifyRuleResult = (Term, ChunkedTermVec, VarData);
fn merge_branch_seq(branches: impl Iterator<Item = BranchInfo>) -> BranchInfo {
let mut branch_info = BranchInfo::new(BranchNumber::default());
for mut branch in branches {
branch_info.branch_num = branch.branch_num;
branch_info.chunks.append(&mut branch.chunks);
}
branch_info.branch_num.delta = branch_info.branch_num.delta * Integer::from(2);
branch_info.branch_num.branch_num -= &branch_info.branch_num.delta;
branch_info
}
fn flatten_into_disjunct(build_stack: &mut ChunkedTermVec, preceding_len: usize) {
let branch_vec = build_stack.drain(preceding_len + 1..).collect();
if let ChunkedTerms::Branch(ref mut disjuncts) = &mut build_stack[preceding_len] {
disjuncts.push(branch_vec);
} else {
unreachable!();
}
}
impl VariableClassifier {
pub fn new(call_policy: CallPolicy) -> Self {
Self {
call_policy,
current_branch_num: BranchNumber::default(),
current_chunk_num: 0,
current_chunk_type: ChunkType::Head,
branch_map: BranchMap(BranchMapInt::new()),
root_set: RootSet::new(),
var_num: 0,
global_cut_var_num: None,
global_cut_var_num_override: None,
}
}
pub fn classify_fact(mut self, term: Term) -> Result<ClassifyFactResult, CompilationError> {
self.classify_head_variables(&term)?;
Ok((
term,
self.branch_map.separate_and_classify_variables(
self.var_num,
self.global_cut_var_num,
self.current_chunk_num,
),
))
}
pub fn classify_rule<'a, LS: LoadState<'a>>(
mut self,
loader: &mut Loader<'a, LS>,
head: Term,
body: Term,
) -> Result<ClassifyRuleResult, CompilationError> {
self.classify_head_variables(&head)?;
self.root_set.insert(self.current_branch_num.clone());
let mut query_terms = self.classify_body_variables(loader, body)?;
self.merge_branches();
let mut var_data = self.branch_map.separate_and_classify_variables(
self.var_num,
self.global_cut_var_num,
self.current_chunk_num,
);
var_data.emit_initial_get_level(&mut query_terms);
Ok((head, query_terms, var_data))
}
fn merge_branches(&mut self) {
for branches in self.branch_map.values_mut() {
let mut old_branches = std::mem::take(branches);
while let Some(last_branch_num) = old_branches.last().map(|bi| &bi.branch_num) {
let mut old_branches_len = old_branches.len();
for (rev_idx, bi) in old_branches.iter().rev().enumerate() {
if &bi.branch_num > last_branch_num {
old_branches_len = old_branches.len() - rev_idx;
}
}
let iter = old_branches.drain(old_branches_len - 1..);
branches.push(merge_branch_seq(iter));
}
branches.reverse();
}
}
fn try_set_chunk_at_inlined_boundary(&mut self) -> bool {
if self.current_chunk_type.is_last() {
self.current_chunk_type = ChunkType::Mid;
self.current_chunk_num += 1;
true
} else {
false
}
}
fn try_set_chunk_at_call_boundary(&mut self) -> bool {
if self.current_chunk_type.is_last() {
self.current_chunk_num += 1;
true
} else {
self.current_chunk_type = ChunkType::Last;
false
}
}
fn probe_body_term(&mut self, arg_c: usize, arity: usize, term: &Term) {
let classify_info = ClassifyInfo { arg_c, arity };
// second arg is true to iterate the root, which may be a variable
for term_ref in breadth_first_iter(term, RootIterationPolicy::Iterated) {
if let TermRef::Var(lvl, _, var_ptr) = term_ref {
// root terms are shallow here (since we're iterating a
// body term) so take the child level.
let lvl = lvl.child_level();
self.probe_body_var(VarInfo {
var_ptr,
lvl,
classify_info,
chunk_type: self.current_chunk_type,
});
}
}
}
fn probe_body_var(&mut self, var_info: VarInfo) {
let term_loc = self
.current_chunk_type
.to_gen_context(self.current_chunk_num);
let branch_info_v = self.branch_map.entry(var_info.var_ptr.clone()).or_default();
let needs_new_branch = if let Some(last_bi) = branch_info_v.last() {
!self.root_set.contains(&last_bi.branch_num)
} else {
true
};
if needs_new_branch {
branch_info_v.push(BranchInfo::new(self.current_branch_num.clone()));
}
let branch_info = branch_info_v.last_mut().unwrap();
let needs_new_chunk = if let Some(last_ci) = branch_info.chunks.last() {
last_ci.chunk_num != self.current_chunk_num
} else {
true
};
if needs_new_chunk {
branch_info.chunks.push(ChunkInfo {
chunk_num: self.current_chunk_num,
term_loc,
vars: vec![],
});
}
let chunk_info = branch_info.chunks.last_mut().unwrap();
chunk_info.vars.push(var_info);
}
fn probe_in_situ_var(&mut self, var_num: usize) {
let classify_info = ClassifyInfo { arg_c: 1, arity: 1 };
let var_info = VarInfo {
var_ptr: VarPtr::from(Var::InSitu(var_num)),
classify_info,
chunk_type: self.current_chunk_type,
lvl: Level::Shallow,
};
self.probe_body_var(var_info);
}
fn classify_head_variables(&mut self, term: &Term) -> Result<(), CompilationError> {
match term {
Term::Clause(..) | Term::Literal(_, Literal::Atom(_)) => {}
_ => return Err(CompilationError::InvalidRuleHead),
}
let mut classify_info = ClassifyInfo {
arg_c: 1,
arity: term.arity(),
};
if let Term::Clause(_, _, terms) = term {
for term in terms.iter() {
for term_ref in breadth_first_iter(term, RootIterationPolicy::Iterated) {
if let TermRef::Var(lvl, _, var_ptr) = term_ref {
// a body term, so we need the child level here.
let lvl = lvl.child_level();
// the body of the if let here is an inlined
// "probe_head_var". note the difference between it
// and "probe_body_var".
let branch_info_v = self.branch_map.entry(var_ptr.clone()).or_default();
let needs_new_branch = branch_info_v.is_empty();
if needs_new_branch {
branch_info_v.push(BranchInfo::new(self.current_branch_num.clone()));
}
let branch_info = branch_info_v.last_mut().unwrap();
let needs_new_chunk = branch_info.chunks.is_empty();
if needs_new_chunk {
branch_info.chunks.push(ChunkInfo {
chunk_num: self.current_chunk_num,
term_loc: GenContext::Head,
vars: vec![],
});
}
let chunk_info = branch_info.chunks.last_mut().unwrap();
let var_info = VarInfo {
var_ptr,
classify_info,
chunk_type: self.current_chunk_type,
lvl,
};
chunk_info.vars.push(var_info);
}
}
classify_info.arg_c += 1;
}
}
Ok(())
}
fn classify_body_variables<'a, LS: LoadState<'a>>(
&mut self,
loader: &mut Loader<'a, LS>,
term: Term,
) -> Result<ChunkedTermVec, CompilationError> {
let mut state_stack = vec![TraversalState::Term(term)];
let mut build_stack = ChunkedTermVec::new();
self.current_chunk_type = ChunkType::Mid;
while let Some(traversal_st) = state_stack.pop() {
match traversal_st {
TraversalState::AddBranchNum(branch_num) => {
self.root_set.insert(branch_num.clone());
self.current_branch_num = branch_num;
}
TraversalState::RemoveBranchNum => {
self.root_set.pop();
}
TraversalState::RepBranchNum(branch_num) => {
self.root_set.pop();
self.root_set.insert(branch_num.clone());
self.current_branch_num = branch_num;
}
TraversalState::ResetCallPolicy(call_policy) => {
self.call_policy = call_policy;
}
TraversalState::BuildDisjunct(preceding_len) => {
flatten_into_disjunct(&mut build_stack, preceding_len);
self.current_chunk_type = ChunkType::Mid;
self.current_chunk_num += 1;
}
TraversalState::BuildFinalDisjunct(preceding_len) => {
flatten_into_disjunct(&mut build_stack, preceding_len);
self.current_chunk_type = ChunkType::Mid;
self.current_chunk_num += 1;
}
TraversalState::GetCutPoint { var_num, prev_b } => {
if self.try_set_chunk_at_inlined_boundary() {
build_stack.add_chunk();
}
self.probe_in_situ_var(var_num);
build_stack.push_chunk_term(QueryTerm::GetCutPoint { var_num, prev_b });
}
TraversalState::OverrideGlobalCutVar(var_num) => {
self.global_cut_var_num_override = Some(var_num);
}
TraversalState::ResetGlobalCutVarOverride(old_override) => {
self.global_cut_var_num_override = old_override;
}
TraversalState::Cut { var_num, is_global } => {
if self.try_set_chunk_at_inlined_boundary() {
build_stack.add_chunk();
}
self.probe_in_situ_var(var_num);
build_stack.push_chunk_term(if is_global {
QueryTerm::GlobalCut(var_num)
} else {
QueryTerm::LocalCut {
var_num,
cut_prev: false,
}
});
}
TraversalState::CutPrev(var_num) => {
if self.try_set_chunk_at_inlined_boundary() {
build_stack.add_chunk();
}
self.probe_in_situ_var(var_num);
build_stack.push_chunk_term(QueryTerm::LocalCut {
var_num,
cut_prev: true,
});
}
TraversalState::Fail => {
build_stack.push_chunk_term(QueryTerm::Fail);
}
TraversalState::Term(term) => {
// return true iff new chunk should be added.
let update_chunk_data = |classifier: &mut Self, predicate_name, arity| {
if ClauseType::is_inlined(predicate_name, arity) {
classifier.try_set_chunk_at_inlined_boundary()
} else {
classifier.try_set_chunk_at_call_boundary()
}
};
let mut add_chunk = |classifier: &mut Self, name: Atom, terms: Vec<Term>| {
if update_chunk_data(classifier, name, terms.len()) {
build_stack.add_chunk();
}
for (arg_c, term) in terms.iter().enumerate() {
classifier.probe_body_term(arg_c + 1, terms.len(), term);
}
build_stack.push_chunk_term(clause_to_query_term(
loader,
name,
terms,
classifier.call_policy,
));
};
match term {
Term::Clause(
_,
name @ (atom!("->") | atom!(";") | atom!(",")),
mut terms,
) if terms.len() == 3 => {
if let Some(last_arg) = terms.last() {
if let Term::Literal(_, Literal::CodeIndex(_)) = last_arg {
terms.pop();
state_stack.push(TraversalState::Term(Term::Clause(
Cell::default(),
name,
terms,
)));
} else {
add_chunk(self, name, terms);
}
}
}
Term::Clause(_, atom!(","), mut terms) if terms.len() == 2 => {
let tail = terms.pop().unwrap();
let head = terms.pop().unwrap();
let iter = unfold_by_str(tail, atom!(","))
.into_iter()
.rev()
.chain(std::iter::once(head))
.map(TraversalState::Term);
state_stack.extend(iter);
}
Term::Clause(_, atom!(";"), mut terms) if terms.len() == 2 => {
let tail = terms.pop().unwrap();
let head = terms.pop().unwrap();
let first_branch_num = self.current_branch_num.split();
let branches: Vec<_> = std::iter::once(head)
.chain(unfold_by_str(tail, atom!(";")).into_iter())
.collect();
let mut branch_numbers = vec![first_branch_num];
for idx in 1..branches.len() {
let succ_branch_number = branch_numbers[idx - 1].incr_by_delta();
branch_numbers.push(if idx + 1 < branches.len() {
succ_branch_number.split()
} else {
succ_branch_number
});
}
let build_stack_len = build_stack.len();
build_stack.reserve_branch(branches.len());
state_stack.push(TraversalState::RepBranchNum(
self.current_branch_num.halve_delta(),
));
let iter = branches.into_iter().zip(branch_numbers.into_iter());
let final_disjunct_loc = state_stack.len();
for (term, branch_num) in iter.rev() {
state_stack.push(TraversalState::BuildDisjunct(build_stack_len));
state_stack.push(TraversalState::RemoveBranchNum);
state_stack.push(TraversalState::Term(term));
state_stack.push(TraversalState::AddBranchNum(branch_num));
}
if let TraversalState::BuildDisjunct(build_stack_len) =
state_stack[final_disjunct_loc]
{
state_stack[final_disjunct_loc] =
TraversalState::BuildFinalDisjunct(build_stack_len);
}
self.current_chunk_type = ChunkType::Mid;
self.current_chunk_num += 1;
}
Term::Clause(_, atom!("->"), mut terms) if terms.len() == 2 => {
let then_term = terms.pop().unwrap();
let if_term = terms.pop().unwrap();
let prev_b = if matches!(
state_stack.last(),
Some(TraversalState::RemoveBranchNum)
) {
// check if the second-to-last element
// is a regular BuildDisjunct, as we
// don't want to add GetPrevLevel in
// case of a TrustMe.
match state_stack.iter().rev().nth(1) {
Some(&TraversalState::BuildDisjunct(preceding_len)) => {
preceding_len + 1 == build_stack.len()
}
_ => false,
}
} else {
false
};
state_stack.push(TraversalState::Term(then_term));
state_stack.push(TraversalState::Cut {
var_num: self.var_num,
is_global: false,
});
state_stack.push(TraversalState::Term(if_term));
state_stack.push(TraversalState::GetCutPoint {
var_num: self.var_num,
prev_b,
});
self.var_num += 1;
}
Term::Clause(_, atom!("\\+"), mut terms) if terms.len() == 1 => {
let not_term = terms.pop().unwrap();
let build_stack_len = build_stack.len();
build_stack.reserve_branch(2);
state_stack.push(TraversalState::BuildFinalDisjunct(build_stack_len));
state_stack.push(TraversalState::Term(Term::Clause(
Cell::default(),
atom!("$succeed"),
vec![],
)));
state_stack.push(TraversalState::BuildDisjunct(build_stack_len));
state_stack.push(TraversalState::Fail);
state_stack.push(TraversalState::CutPrev(self.var_num));
state_stack.push(TraversalState::ResetGlobalCutVarOverride(
self.global_cut_var_num_override,
));
state_stack.push(TraversalState::Term(not_term));
state_stack.push(TraversalState::OverrideGlobalCutVar(self.var_num));
state_stack.push(TraversalState::GetCutPoint {
var_num: self.var_num,
prev_b: false,
});
self.current_chunk_type = ChunkType::Mid;
self.current_chunk_num += 1;
self.var_num += 1;
}
Term::Clause(_, atom!(":"), mut terms) if terms.len() == 2 => {
let predicate_name = terms.pop().unwrap();
let module_name = terms.pop().unwrap();
match (module_name, predicate_name) {
(
Term::Literal(_, Literal::Atom(module_name)),
Term::Literal(_, Literal::Atom(predicate_name)),
) => {
if update_chunk_data(self, predicate_name, 0) {
build_stack.add_chunk();
}
build_stack.push_chunk_term(qualified_clause_to_query_term(
loader,
module_name,
predicate_name,
vec![],
self.call_policy,
));
}
(
Term::Literal(_, Literal::Atom(module_name)),
Term::Clause(_, name, terms),
) => {
if update_chunk_data(self, name, terms.len()) {
build_stack.add_chunk();
}
for (arg_c, term) in terms.iter().enumerate() {
self.probe_body_term(arg_c + 1, terms.len(), term);
}
build_stack.push_chunk_term(qualified_clause_to_query_term(
loader,
module_name,
name,
terms,
self.call_policy,
));
}
(module_name, predicate_name) => {
if update_chunk_data(self, atom!("call"), 2) {
build_stack.add_chunk();
}
self.probe_body_term(1, 0, &module_name);
self.probe_body_term(2, 0, &predicate_name);
terms.push(module_name);
terms.push(predicate_name);
build_stack.push_chunk_term(clause_to_query_term(
loader,
atom!("call"),
vec![Term::Clause(Cell::default(), atom!(":"), terms)],
self.call_policy,
));
}
}
}
Term::Clause(_, atom!("$call_with_inference_counting"), mut terms)
if terms.len() == 1 =>
{
state_stack.push(TraversalState::ResetCallPolicy(self.call_policy));
state_stack.push(TraversalState::Term(terms.pop().unwrap()));
self.call_policy = CallPolicy::Counted;
}
Term::Clause(_, name, terms) => {
add_chunk(self, name, terms);
}
var @ Term::Var(..) => {
if update_chunk_data(self, atom!("call"), 1) {
build_stack.add_chunk();
}
self.probe_body_term(1, 1, &var);
build_stack.push_chunk_term(clause_to_query_term(
loader,
atom!("call"),
vec![var],
self.call_policy,
));
}
Term::Literal(_, Literal::Atom(atom!("!")) | Literal::Char('!')) => {
let (var_num, is_global) =
if let Some(var_num) = self.global_cut_var_num_override {
(var_num, false)
} else if let Some(var_num) = self.global_cut_var_num {
(var_num, true)
} else {
let var_num = self.var_num;
self.global_cut_var_num = Some(var_num);
self.var_num += 1;
(var_num, true)
};
self.probe_in_situ_var(var_num);
state_stack.push(TraversalState::Cut { var_num, is_global });
}
Term::Literal(_, Literal::Atom(name)) => {
if update_chunk_data(self, name, 0) {
build_stack.add_chunk();
}
build_stack.push_chunk_term(clause_to_query_term(
loader,
name,
vec![],
self.call_policy,
));
}
_ => {
return Err(CompilationError::InadmissibleQueryTerm);
}
}
}
}
}
Ok(build_stack)
}
}
impl BranchMap {
pub fn separate_and_classify_variables(
&mut self,
var_num: usize,
global_cut_var_num: Option<usize>,
current_chunk_num: usize,
) -> VarData {
let mut var_data = VarData {
records: VariableRecords::new(var_num),
global_cut_var_num,
allocates: current_chunk_num > 0,
};
for (var, branches) in self.iter_mut() {
let (mut var_num, var_num_incr) = if let Var::InSitu(var_num) = *var.borrow() {
(var_num, false)
} else {
(var_data.records.len(), true)
};
for branch in branches.iter_mut() {
if var_num_incr {
var_num = var_data.records.len();
var_data.records.push(VariableRecord::default());
}
if branch.chunks.len() <= 1 {
// true iff var is a temporary variable.
debug_assert_eq!(branch.chunks.len(), 1);
let chunk = &mut branch.chunks[0];
let mut temp_var_data = TempVarData::new();
for var_info in chunk.vars.iter_mut() {
if var_info.lvl == Level::Shallow {
let term_loc = var_info.chunk_type.to_gen_context(chunk.chunk_num);
temp_var_data
.use_set
.insert((term_loc, var_info.classify_info.arg_c));
}
}
var_data.records[var_num].allocation = VarAlloc::Temp {
term_loc: chunk.term_loc,
temp_reg: 0,
temp_var_data,
safety: VarSafetyStatus::Needed,
to_perm_var_num: None,
};
} // else VarAlloc is already a Perm variant, as it's the default.
for chunk in branch.chunks.iter_mut() {
var_data.records[var_num].num_occurrences += chunk.vars.len();
for var_info in chunk.vars.iter_mut() {
var_info.var_ptr.set(Var::Generated(var_num));
}
}
}
}
var_data.records.populate_restricting_sets();
var_data
}
}
``` |
```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 <algorithm>
#include "sc_data_format.hpp"
#include <compiler/ir/graph/graph.hpp>
#include <compiler/ir/graph/utils.hpp>
#include <compiler/ir/transform/constant_fold.hpp>
#include <compiler/ir/transform/simple_licm.hpp>
#include <runtime/dynamic_dispatch/ops/impl_type.hpp>
#include <util/reflection.hpp>
#include <util/utils.hpp>
namespace dnnl {
namespace impl {
namespace graph {
namespace gc {
sc_data_format_kind_t::sc_data_format_kind_t(
const std::vector<int> &storage_args) {
COMPILE_ASSERT(storage_args.size() <= sc_data_format_kind_t::MAX_DIMS,
"storage size should be less than MAX_DIMS");
uint64_t res = set_ith_int(
0xffffffffffffffff, sc_data_format_kind_t::MAX_DIMS, 0);
for (size_t i = 0; i < storage_args.size(); ++i) {
res = set_ith_int(res, i, storage_args[i]);
}
storage_ = res;
}
sc_data_format_kind_t sc_data_format_kind_t::get_plain_by_dims(size_t ndims) {
COMPILE_ASSERT(ndims <= sc_data_format_kind_t::MAX_DIMS,
"storage size should be less than MAX_DIMS");
uint64_t res = set_ith_int(
0xffffffffffffffff, sc_data_format_kind_t::MAX_DIMS, 0);
for (size_t i = 0; i < ndims; ++i) {
res = set_ith_int(res, i, i);
}
return sc_data_format_kind_t(res);
}
sc_data_format_kind_t sc_data_format_kind_t::get_2dblocking_by_dims(
size_t ndims, bool is_weight, bool is_vnni_format) {
COMPILE_ASSERT(ndims <= sc_data_format_kind_t::MAX_DIMS,
"storage size should be less than MAX_DIMS");
uint64_t res = set_ith_int(
0xffffffffffffffff, sc_data_format_kind_t::MAX_DIMS, 0);
for (size_t i = 0; i < ndims; ++i) {
res = set_ith_int(res, i, i);
}
if (ndims == 1) {
res = set_ith_int(res, ndims, ndims - 1);
} else {
// the first blocking
res = set_ith_int(res, ndims, ndims - 2);
// the second blocking
res = set_ith_int(res, ndims + 1, ndims - 1);
if (is_weight) {
res = set_ith_int(res, ndims - 2, ndims - 1);
res = set_ith_int(res, ndims - 1, ndims - 2);
}
}
if (is_vnni_format) {
assert(ndims >= 2);
// the third blocking
res = set_ith_int(res, ndims + 2, ndims - 2);
}
return sc_data_format_kind_t(res);
}
int sc_data_format_kind_t::ndims() const {
for (int i = 0; i < MAX_DIMS; i++) {
if (get(i) == UNDEF_DIM) { return i; }
}
return -1;
}
std::vector<int> sc_data_format_kind_t::collect_blocking_index(int axis) const {
std::vector<int> index;
int cur_idx = 0;
int blocking_count[MAX_DIMS] = {0};
for (int i = 0; i < MAX_DIMS; i++) {
auto cur_axis = get(i);
if (cur_axis == UNDEF_DIM) { return index; }
blocking_count[cur_axis]++;
if (blocking_count[cur_axis] > 1) {
if (cur_axis == axis) { index.push_back(cur_idx); }
cur_idx++;
}
}
return index;
}
std::vector<std::vector<int>>
sc_data_format_kind_t::collect_p2b_mapping() const {
std::vector<std::vector<int>> dist(norig_dims(), std::vector<int> {});
for (int i = 0; i < MAX_DIMS; i++) {
auto orig_axis = get(i);
if (orig_axis == UNDEF_DIM) { return dist; }
dist[orig_axis].emplace_back(i);
}
return dist;
}
void sc_data_format_kind_t::collect_dim_count(
int out[sc_data_format_kind_t::MAX_DIMS]) const {
for (int i = 0; i < MAX_DIMS; i++) {
int orig_idx = get(i);
if (orig_idx != UNDEF_DIM) {
++out[orig_idx];
} else {
break;
}
}
}
int sc_data_format_kind_t::norig_dims() const {
int ret = -1;
for (int i = 0; i < MAX_DIMS; i++) {
int orig_idx = get(i);
if (orig_idx != UNDEF_DIM) {
ret = std::max(orig_idx, ret);
} else {
break;
}
}
return ret + 1;
}
bool sc_data_format_t::is_convertible(const sc_data_format_t &other) const {
if (format_code_ == format_kinds::any
|| other.format_code_ == format_kinds::any) {
return true;
}
return format_code_.norig_dims() == other.format_code_.norig_dims();
}
bool sc_data_format_kind_t::is_channel_last() const {
int i = 0;
for (; i < MAX_DIMS - 1; i++) {
if (get(i + 1) == UNDEF_DIM) {
break;
} else if ((i == 0 && get(i) != 0) || (i != 0 && get(i) != i + 1)) {
return false;
}
}
if (!i) return false;
return get(i) == 1;
}
bool sc_data_format_kind_t::is_plain() const {
int i = 0;
for (; i < MAX_DIMS; i++) {
if (get(i) == UNDEF_DIM) {
break;
} else if (get(i) != i) {
return false;
}
}
if (!i) return false;
return true;
}
bool sc_data_format_kind_t::is_blocking() const {
int out[sc_data_format_kind_t::MAX_DIMS] = {0};
collect_dim_count(out);
for (int i = 0; i < MAX_DIMS; i++) {
if (out[i] > 1) {
return true;
} else if (out[i] == 0) {
return false;
}
}
return false;
}
sc_data_format_kind_t sc_data_format_kind_t::to_plain() const {
std::vector<int> storage(this->norig_dims());
for (int i = 0; i < this->norig_dims(); i++) {
storage[i] = i;
}
return sc_data_format_kind_t(storage);
}
sc_data_format_kind_t sc_data_format_kind_t::to_channel_last() const {
int ndims = this->norig_dims();
std::vector<int> storage(ndims);
for (int i = 1; i < ndims; i++) {
storage[i] = i + 1;
}
storage[0] = 0;
storage[ndims - 1] = 1;
return sc_data_format_kind_t(storage);
}
bool sc_data_format_t::is_blocking() const {
return format_code_.is_blocking();
}
bool sc_data_format_t::is_channel_last() const {
return format_code_.is_channel_last();
}
bool sc_data_format_t::is_plain() const {
return format_code_ != format_kinds::any && format_code_.is_plain();
}
bool sc_data_format_t::is_any() const {
return format_code_ == format_kinds::any;
}
sc_data_format_t sc_data_format_t::to_plain() const {
return sc_data_format_t(format_code_.to_plain());
}
sc_data_format_t sc_data_format_t::to_channel_last() const {
return sc_data_format_t(format_code_.to_channel_last());
}
sc_format_category sc_data_format_t::get_format_category() const {
if (format_code_ == format_kinds::any)
return sc_format_category::any;
else if (format_code_.is_blocking())
return sc_format_category::blocked;
else
return sc_format_category::non_blocking;
}
void sc_data_format_t::to_string(std::ostream &os) const {
os << *this << "\n";
}
runtime::dispatch_key sc_data_format_t::to_runtime() const {
COMPILE_ASSERT(format_code_.ndims() < runtime::dispatch_key::meta::MAX_DIMS,
"Cannot convert this sc_data_format_t to runtime dispatch_key");
COMPILE_ASSERT(blocks_[0] < 256 && blocks_[1] < 256,
"The blocks are too large for runtime dispatch_key");
return runtime::dispatch_key(static_cast<uint64_t>(format_code_),
blocks_[0], blocks_[1], impl_kind_t::normal,
format_code_.is_plain());
}
std::ostream &operator<<(std::ostream &os, const sc_data_format_t &in) {
if (in.is_any()) { return os << "any"; }
int out[sc_data_format_kind_t::MAX_DIMS] = {0};
int num_blocking = 0;
for (int i = 0; i < sc_data_format_kind_t::MAX_DIMS; i++) {
int orig_idx = in.format_code_.get(i);
if (orig_idx != sc_data_format_kind_t::UNDEF_DIM) {
out[orig_idx]++;
char axis_name_base;
// if the axis is blocking
if (out[orig_idx] > 1) {
// get the blocking number from in.blocks_
COMPILE_ASSERT((size_t)num_blocking < in.blocks_.size(),
"Too many blocking dims");
os << in.blocks_[num_blocking];
num_blocking++;
axis_name_base = 'a';
} else {
axis_name_base = 'A';
}
os << char(axis_name_base + orig_idx);
} else {
break;
}
}
return os;
}
static bool is_fixed_blocks(const std::array<int, 4> &blocks, int number) {
for (int i = 0; i < number; i++) {
if (blocks[i] < 0) { return false; }
}
return true;
}
static void get_block_nums_for_axises(const sc_data_format_t &format,
int blocking_num[sc_data_format_kind_t::MAX_DIMS]) {
// index: index in the plain dims, value: number of currently met axies in
// the format
int orig_num_blocking[sc_data_format_kind_t::MAX_DIMS] = {0};
size_t cur_blocking = 0;
for (int i = 0; i < sc_data_format_kind_t::MAX_DIMS; i++) {
int orig_idx = format.format_code_.get(i);
if (orig_idx != sc_data_format_kind_t::UNDEF_DIM) {
orig_num_blocking[orig_idx]++;
if (orig_num_blocking[orig_idx] > 1) {
// get the blocking number from in.blocks_
COMPILE_ASSERT(cur_blocking < format.blocks_.size(),
"Too many blocking dims");
blocking_num[i] = format.blocks_[cur_blocking];
cur_blocking++;
} else {
// blocking_num[i]=0;
}
} else {
break;
}
}
}
std::unordered_map<int, std::vector<int>>
sc_data_format_t::get_blocked_axis() const {
std::unordered_map<int, std::vector<int>> blocked_axis;
int out[sc_data_format_kind_t::MAX_DIMS] = {0};
int block_pos = 0;
for (int i = 0; i < sc_data_format_kind_t::MAX_DIMS; i++) {
int orig_idx = format_code_.get(i);
if (orig_idx != sc_data_format_kind_t::UNDEF_DIM) {
++out[orig_idx];
if (out[orig_idx] > 1) {
blocked_axis[orig_idx].push_back(blocks_[block_pos++]);
}
} else {
break;
}
}
return blocked_axis;
}
void get_blocking_shapes_impl(const sc_dims &plain_shapes,
const sc_data_format_t &format, size_t base_out_dim,
size_t num_format_dims, size_t num_out_dims,
const std::function<void(int, int)> &callback) {
COMPILE_ASSERT(plain_shapes.size() <= sc_data_format_kind_t::MAX_DIMS,
"Too many dims in plain shapes");
// index: index in the format, value: the blocking number collected from
// format.blocks_. e.g. for NCHW16c, blocking_num=[0,0,0,0,16,...]
int blocking_num[sc_data_format_kind_t::MAX_DIMS] = {0};
get_block_nums_for_axises(format, blocking_num);
// calculate the real shapes
// For example, KCRS16c8k4c, format code = [0,1,2,3,1,0,1], where plain dims
// is KCRS=[a,b,c,d]
// 1. for each axis in the target format, get the original axis. e.g. for C
// axis, the original axis is 1.
// 2. get the blocking/original shape of the axis. e.g. for C axis in
// KCRS16c8k4c, it is the first axis of C, so the original shape on the axis
// is b. For the first blocking axis of "16c", its blocking number is 16.
// 3. finalize the shape of the current axis. It should be
// (original_shape/next_blocking_number). e.g. for C axis in KCRS16c8k4c,
// original shape=b, next blocking number=16, so the shape of C axis is
// ceil(b/16). for "16c" axis in KCRS16c8k4c, original shape=16, next
// blocking number=4, so the shape of "16c" axis is ceil(16/4)=4.
for (auto out_idx = base_out_dim; out_idx < num_out_dims; out_idx++) {
auto idx_in_format = out_idx - base_out_dim;
int orig_axis = format.format_code_.get(idx_in_format);
assert((size_t)orig_axis < plain_shapes.size());
// find original shape from plain_shapes or blocking_num
int new_shape;
if (blocking_num[idx_in_format] != 0) {
new_shape = blocking_num[idx_in_format];
} else {
new_shape = plain_shapes.at(orig_axis + base_out_dim);
}
// get next_blocking_number
int next_blocking_number = 1;
for (size_t i = idx_in_format + 1; i < num_format_dims; i++) {
// find next axis in format with same axis name
if (orig_axis == format.format_code_.get(i)) {
next_blocking_number = blocking_num[i];
break;
}
}
callback(new_shape, next_blocking_number);
}
}
sc_dims sc_data_format_t::get_blocking_shapes(
const sc_dims &plain_shapes, const sc_data_format_t &format) {
if (plain_shapes.empty()) { return sc_dims(); }
// todo: should be is_plain()
if (format.format_code_ == format_kinds::any) { return plain_shapes; }
sc_dims ret;
size_t base_out_dim = 0;
size_t num_plain_dims = format.format_code_.norig_dims();
size_t num_format_dims = format.format_code_.ndims();
size_t num_out_dims = num_format_dims;
ret.reserve(num_out_dims);
COMPILE_ASSERT(plain_shapes.size() == num_plain_dims,
"Wrong number of dimensions for format: "
<< format
<< ", plain shape = " << utils::print_vector(plain_shapes));
auto callback = [&](int new_shape, int next_blocking_number) {
if (is_dynamic_dim(new_shape) || is_dynamic_dim(next_blocking_number)) {
ret.push_back(dimensions::dynamic_any);
} else {
ret.push_back(
utils::divide_and_ceil(new_shape, next_blocking_number));
}
};
get_blocking_shapes_impl(plain_shapes, format, base_out_dim,
num_format_dims, num_out_dims, callback);
return ret;
}
static size_t throw_if_negative(int dim) {
if (dim < 0) { throw std::runtime_error("Bad format"); }
return dim;
}
std::vector<expr> get_blocking_shapes_expr(sc_graph_t &g,
const sc_dims &plain_shapes, const sc_data_format_t &format) {
if (plain_shapes.empty()) { return std::vector<expr>(); }
// todo: should be is_plain()
if (format.format_code_ == format_kinds::any) {
return g.dims_to_expr(plain_shapes);
}
std::vector<expr> ret;
size_t base_out_dim = 0;
size_t num_plain_dims = throw_if_negative(format.format_code_.norig_dims());
size_t num_format_dims = throw_if_negative(format.format_code_.ndims());
size_t num_out_dims = num_format_dims;
ret.reserve(num_out_dims);
COMPILE_ASSERT(plain_shapes.size() == num_plain_dims,
"Wrong number of dimensions for format: "
<< format
<< ", plain shape = " << utils::print_vector(plain_shapes));
auto callback = [&](int new_shape, int next_blocking_number) {
auto dim = next_blocking_number == 1
? g.dim_to_expr(new_shape)
: divide_and_ceil(g.dim_to_expr(new_shape),
g.dim_to_expr(next_blocking_number));
dim->attr().set(attr_key::const_attr, true);
ret.push_back(dim);
};
get_blocking_shapes_impl(plain_shapes, format, base_out_dim,
num_format_dims, num_out_dims, callback);
return ret;
}
sc_dims sc_data_format_t::get_padded_plain_shapes(
const sc_dims &real_shapes, const sc_data_format_t &format) {
if (real_shapes.empty()) { return sc_dims(); }
if (format.format_code_ == format_kinds::any) { return real_shapes; }
sc_dims ret;
size_t base_out_dim = 0;
size_t num_plain_dims = format.format_code_.norig_dims();
size_t num_format_dims = format.format_code_.ndims();
size_t num_out_dims = num_plain_dims;
ret.reserve(num_out_dims);
COMPILE_ASSERT(real_shapes.size() == num_format_dims,
"Wrong number of dimensions for format: "
<< format
<< ", real shape = " << utils::print_vector(real_shapes));
if (!is_fixed_blocks(format.blocks_, 4)) {
return sc_dims(num_out_dims, -1);
}
COMPILE_ASSERT(real_shapes.size() <= sc_data_format_kind_t::MAX_DIMS,
"Too many dims in plain shapes");
for (auto out_idx = base_out_dim; out_idx < num_out_dims; out_idx++) {
auto orig_axis = out_idx - base_out_dim;
int shape = 1;
for (size_t i = 0; i < num_format_dims; i++) {
if ((int)orig_axis == format.format_code_.get(i)) {
if (is_dynamic_dim(real_shapes.at(base_out_dim + i))) {
shape = dimensions::dynamic_any;
break;
}
shape *= real_shapes.at(base_out_dim + i);
}
}
// shape is the product of all axises with the same name
ret.push_back(shape);
}
return ret;
}
sc_dims sc_data_format_t::get_reordered_shapes(const sc_dims &input_shapes,
const sc_data_format_t &input_format,
const sc_data_format_t &output_format) {
COMPILE_ASSERT(input_format.is_convertible(output_format),
"Can not convert input format "
<< input_format << " to output format " << output_format);
sc_dims plain_shapes = get_padded_plain_shapes(input_shapes, input_format);
return get_blocking_shapes(plain_shapes, output_format);
}
int sc_data_format_t::get_blocks_size() const {
int i = 0;
for (; i < static_cast<int>(blocks_.size()); i++) {
if (blocks_[i] == 0) { return i; }
}
return i;
}
bool sc_data_format_t::is_same_format_kind(
const sc_data_format_t &input_format) const {
return this->format_code_ == input_format.format_code_;
}
bool sc_data_format_cmper_t::operator()(
const sc_data_format_t &fmt0, const sc_data_format_t &fmt1) const {
if (fmt0.format_code_ != fmt1.format_code_) {
return fmt0.format_code_ < fmt1.format_code_;
}
if (fmt0.blocks_ != fmt1.blocks_) {
for (int i = 0; i < 4; i++) {
if (fmt0.blocks_[i] != fmt1.blocks_[i]) {
return fmt0.blocks_[i] < fmt1.blocks_[i];
}
}
}
// equal
return false;
}
bool is_dynamic_blocking(
const sc_dims &shapes, const sc_data_format_t &format) {
auto &code = format.format_code_;
for (size_t i = 0; i < shapes.size(); i++) {
if (is_dynamic_dim(shapes[i])
&& !code.collect_blocking_index(i).empty()) {
return true;
}
}
return false;
}
// clang-format off
SC_CLASS(sc_data_format_t)
SC_FIELD(format_code_)
SC_FIELD(blocks_)
SC_CLASS_END()
SC_CLASS(sc_data_format_kind_t)
SC_FIELD(storage_)
SC_CLASS_END()
// clang-format on
template struct reflection::type_registry<
std::vector<std::vector<sc_data_format_t>>>;
} // namespace gc
} // namespace graph
} // namespace impl
} // namespace dnnl
namespace std {
std::size_t hash<dnnl::impl::graph::gc::sc_data_format_t>::operator()(
const dnnl::impl::graph::gc::sc_data_format_t &k) const {
namespace gc = dnnl::impl::graph::gc;
size_t hash_ = 0;
gc::hash_combine(hash_, (uint64_t)k.format_code_);
gc::hash_combine(hash_, get<0>(k.blocks_));
gc::hash_combine(hash_, get<1>(k.blocks_));
gc::hash_combine(hash_, get<2>(k.blocks_));
gc::hash_combine(hash_, get<3>(k.blocks_));
return hash_;
}
} // namespace std
``` |
Sir George Mackenzie of Rosehaugh (1636 – May 8, 1691) was a Scottish lawyer, Lord Advocate, essayist and legal writer. He was nicknamed Bloody Mackenzie.
Early life
Mackenzie, who was born in Dundee, was the son of Sir Simon Mackenzie of Lochslin (died c. 1666) and Elizabeth Bruce, daughter of the Reverend Peter Bruce, minister of St Leonard's, and Principal of St Leonard's Hall in the University of St Andrews. He was a grandson of Kenneth, Lord Mackenzie of Kintail and a nephew of George Mackenzie, 2nd Earl of Seaforth.
He was educated at the King's College, University of Aberdeen (which he entered in 1650), the University of St Andrews, and the University of Bourges in France.
Career
Mackenzie was elected to the Faculty of Advocates in 1659, and spoke in defence at the trial of Archibald Campbell, Marquis of Argyll in 1661. He acted as justice-depute from 1661 to 1663, a post that involved him in extensive witch trials.
Mackenzie was knighted, and was a member of the Scottish Parliament for the County of Ross from 1669 to 1674. In 1677 he became Lord Advocate, and a member of the Privy Council of Scotland.
As Lord Advocate he was the minister responsible for the persecuting policy of Charles II in Scotland against the Presbyterian Covenanters. After the Battle of Bothwell Bridge in 1679 Mackenzie imprisoned 1,200 Covenanters in a field next to Greyfriars Kirkyard. Some were executed, and hundreds died of maltreatment. His treatment of Covenanters gained him the nickname "Bluidy Mackenzie". It has been argued that both he and Claverhouse kept to the letter of the law. It is unclear whether or not the epithet "Bluidy" is contemporary; it appears in The Heart of Midlothian (1818), given to Davie Deans. The language of blood prevails in the published testimony of Marion Harvey, hanged in 1681, who calls her blood onto Mackenzie: ""that excommunicate tyrant, George Mackenzie, the advocate", among others.
Mackenzie resigned for a short time in 1686, before taking up office again in 1688 and serving as shire commissioner for Forfarshire from 1688 to his death. He opposed the dethronement of James II, and to escape the consequences he retired from public life.
Last years
For most of his middle life Mackenzie lived in a mansion on Rosehaugh Close (later called Melrose Close) off the Royal Mile and only a short distance from the Scottish Parliament and Law Courts.
Mackenzie retired at the Glorious Revolution to Oxford. In London on 9 March 1690 he dined with William Lloyd and John Evelyn, two literary opponents from the past. He died at Westminster on 8 May 1691 and is buried in Greyfriars Kirkyard in Edinburgh, his mausoleum being designed by James Smith.
Works
In private life Mackenzie was a cultivated and learned gentleman with literary tendencies. He published in 1660 Aretina, which has been called the first Scottish novel. He is remembered as the author of various graceful essays. A contemporary antiquarian, Alexander Nisbet, calls him "learned" and "renowned".
Mackenzie wrote legal, political, and antiquarian books, including:
The Science of Heraldry, Treated as a Part of the Civil Law of Nations: Wherein Reasons are Given for its Principles, and Etymologies of its Harder Terms (1680);
Institutions of the Law of Scotland (1684);
Jus Regium: Or the Just and Solid Foundations of Monarchy in General, and More Especially of the Monarchy of Scotland: Maintain'd Against Buchannan, Naphtali, Dolman, Milton, &c. (1684), a major royalist tract;
A Vindication of the Government in Scotland (1691);
Antiquity of the Royal Line of Scotland (1686);
Memoirs of the Affairs of Scotland from the Restoration of Charles II (1821).
Mackenzie took part in the Midlothian trials for witchcraft in 1661, and defended the alleged witch Maevia. He later wrote at length of his experience with witchcraft trials. He did not endorse the sceptical position, but stated that witches were fewer than common belief made out. He attributed confessions to the use of torture.
His Laws and Customs of Scotland in Matters Criminal (1678) was the first textbook of Scottish criminal law. In it Mackenzie defended the use of judicial torture in Scotland as legal. He said it was seldom used. In the aftermath of the Rye House Plot Charles II authorised the use of torture against William Spence, secretary to Archibald, Earl of Agyll, who was moved to Scotland. The Scottish privy council was reluctant, but eventually went beyond Scottish law in torturing Spence. Mackenzie visited William Carstares in prison in London, caught up in the same investigation, to warn him of the consequences of stubborn behaviour under questioning.
Other works were:
Religio Stoici (1663);
A Moral Essay preferring Solitude to Public Employment (1665);
Moral Gallantry (1667); and
The Moral History of Frugality (1691).
Legacy
Mackenzie was the founder of the Advocates Library in Edinburgh. His inaugural oration there is dated 15 March 1689, so just before his departure south; but the evidence is that the oration was written some years before, and the library itself was operational from the early 1680s. The initiative followed Mackenzie's appointment as Dean of the Faculty of Advocates, in 1682.
In Fiction
George Mackenzie of Rosehaugh features as a character in John Galt's novel Ringan Gilhaize, or The Covenanters (1823).
Family
In 1662 Mackenzie married Elizabeth Dickson, daughter of John Dickson, Lord Hartree, a Senator of the College of Justice. They had:
John (died young)
Simon (died young)
George (died young)
Agnes, who married James Stuart, later 1st Earl of Bute
Elizabeth, who married first Sir Archibald Cockburn of Langton and secondly the Sir James Mackenzie, Lord Royston
His first wife died not later than 1667-1668 and in 1670 he married secondly Margaret, daughter of Haliburton of Pitcur. They had a son and two daughters:
George, who married but died, without male issue, before his father
Anne, who married Sir William Dick of Prestonfield
Elizabeth, who married Sir John Stuart of Grandtully
References
Patrick Cadell and Ann Matheson, editors (1989), For the Encouragement of Learning: Scotland's National Library 1689–1989, Edinburgh, HMSO.
(also: available at )
Notes
Further reading
Attribution
External links
Mackenzie, George, of Rosehaugh
Mackenzie, George, of Rosehaugh
People educated at the High School of Dundee
Alumni of the University of Aberdeen
Alumni of the University of St Andrews
Principals of the University of St Andrews
University of Bourges
Mackenzie, George, of Rosehaugh
Mackenzie, George, of Rosehaugh
Mackenzie, George, of Rosehaugh
Mackenzie, George, of Rosehaugh
Mackenzie, George, of Rosehaugh
Mackenzie, George, of Rosehaugh
Mackenzie, George, of Rosehaugh
Mackenzie, George, of Rosehaugh
Mackenzie, George, of Rosehaugh
Mackenzie, George, of Rosehaugh
Mackenzie, George, of Rosehaugh
George
Members of the Parliament of Scotland 1669–1674
Members of the Convention of the Estates of Scotland 1689
Members of the Parliament of Scotland 1689–1702
Lord Advocates
Writers from Dundee |
Washim (Vatsagulma) is a city and a Municipal Council in Washim district in the Indian state of Maharashtra. Washim is the district headquarters of Washim district.
Etymology
Washim was known earlier as Vatsagulma and it was the seat of power of the Vakataka dynasty. Sarvasena the Second son of Pravarsena I was the founder of Vatsagulma or Washim of today. His fourth-generation, Harishena was one of the main patrons of the Ajanta Caves World Heritage Site. The house of Vakataka & their last generations were Hindus but also supported Buddhism and supported all Buddhist arts.
History
Washim is the same place where great Vatsa rishi performed penance and were many Gods came to bless him as a result of which it came to be known as Vatsagulma in Sanskrit. Its mention as Vatsagulma is traced in Padma. In the Treta Yuga, the second age, this land was a part of the Dandakaranya or Dandaka jungle, and the rishi Vatsa had his ashram hermitage at this place.
Around 3 C.E., Washim's name was Vatsagulm.
In 1939, historical artifact was found, it revealed some unknown historic fact about this city, the artifact was a plate, named as Washim plate. According to the inscription, Sarvasenana, the founded Vatsagulm family brach-dynasty of Vakatak dynasty. He made Vatsagulma capital of his kingdom. After Vakatak king Pravarsen I, his kingdom was got divided into 3 parts, one of it was Vatsagulm. In the course of time, the place became a great centre of learning and culture. It was, however, known as a holy place long before it became the capital of Sarvasena who flourished in the period circa C.E. 330–355. He was followed by Vindhyashakti II. A reference to Washim is found in Kavyamimansa by Rajashekhara, the celebrated poet and dramatist of the Yayavara brahmana family of Maharashtra who flourished from 875 to 925 CE. He has mentioned therein Vatsagulma as situated in Vidarbha region. But even earlier references to Vatsagulma or Vatsa-gulma are found in Mahabharata and Kamasutra, which in their present form are assignable to a period before the age of the Vakatakas. The Karpuramunjari, a play written by Rajashekhara and staged at Kanauj under the patronage of the Gurjara-Pratiharas also mentions it as situated in the Dakshinapatha (Deccan). Vachchhoma (Vatsagulma) was the name of the Prakrit style current in Vidarbha. Vashima is derived from Vachchhoma the Prakrit name of Vatsagulma. The Sanskrit treatise Vatsagulmyamahatmya also gives traditional information about this town.
Medieval History
During the middle of the 18th century, Washim was a famous centre of cloth production along with Balapur. It is clearly brought out by one of the articles of the treaty of Kanakpur entered into between Janoji Bhonsle and the Peshwa Madhavrao I after the battle between the two in 1769. The article states that the Bhosle's should send annually to the Peshva cloth manufactured at Washim and Balapur worth Rs. 5,000. Mint was also in existence at Washim. The town was looted by the Pindaris in 1809 along with some other places in Berar region.
When in 1768–69, the Peshva attacked the Bhosle, his army had come from Aurangabad through the pass to Washim from which place it moved forward on its expedition. Afterward, it was decided that the Peshva Madhavrav and Janoji Bhosle should meet at Washim and accordingly the terms of the treaty were finalized there and the treaty was signed at Kanakpur. The temple of Balaji at Washim was constructed by Bhavani Kaloo who was the Divan of Sabaji Bhosle.
However, before the establishment of the Vakataka rule with Washim as their capital, the place was an important center from the religious point of view and it even now contains many old temples and tirthas which are revered by the people.
Demographics
India census, Washim had a population of 78,387. Males constitute 52% of the population and females 48%. Washim has an average literacy rate of 70%, higher than the national average of 59.5%: male literacy is 76%, and female literacy is 62%. In Washim, 15% of the population is under 6 years of age.
Civic administration
The municipal council was established at Washim in 1869 and is now governed under the Maharashtra Municipalities Act, 1965. It covers, according to the Census of 1961, an area of 42.16 square km. The municipal council is composed of 18 members with two seats each being reserved for the scheduled castes and women.
With a view to providing various facilities to the town's people, the municipality conducts primary schools and a high school and maintains a dispensary. The underground drainage system is present in the town. Also, there are stone-lined gutters and sewage. The meeting hall of the municipality is used by the town's people as a town hall. Protected piped water is supplied to the town, but wells and Ek Burji Dam form the main source of water supply.
Places of interest
The antiquity of the town has given rise to a number of objects and places of interest in the town. The chief among them is Padmatirtha, Balaji temple, Rama temple, Madhyameshvara temple, Godeshvara temple, two Jain temples and Narayana Maharaja Temple. The Vatsagulmamahatmya mentions that the town contains 108 holy tanks and tirthas. A few of them can still be identified in the town.
Kondeshwar Mandir, Kondala Zamare is one of the most famous Shiva Temple, located at Kondala Zamare ( from Washim). Kondeshwar mandir has a rich history and is surrounded by beautiful hills. Mythology detects- Ram, Sita, and Laxman has visited the temple during 'Vanwas', there is a place where there are 'Ram-Sita Paduka' resides. Besides religious importance, Kondeshwar temple is famous for a Kund (A pond about 60 feet deep) that attracts visitors as they can enjoy joyful swimming. Kondeshwar is quite crowded during 'Shravan month' and 'Mahashivratri' as devotees across the state visit the temple.
Padmatirth Washim is known to have had 108 tirthas, holy places or sacred springs, associated with different gods and rishis. The Padmatirtha is one of the chief tirthas created by Vishnu. The reference to this tirtha has already occurred in the story connected with the origin of the name of the town, it is situated in the northern quarters of the town. The sides are built up in cut stones. Now the tirtha comprises two kundas, a reservoir for rainwater harvesting, one to the north and the other to the south. Recently one Shri Rama-Narayan Toshnival has constructed a small but artistic temple dedicated to Mahadeva in the centre of the kund used formerly by those who entered the tirtha for swimming as their resting place it is a cement concrete construction. An east-west bridge has been put across the tirtha to facilitate the entrance to the temple in the middle of the reservoir. It is said that the colour of the shalunka, base of lingam also called parashakti, placed in the temple changes thrice in a day i. e., once in the morning, then in the afternoon and last in the evening. According to the British raj era Land and Revenue Settlement report of 1871, the tank used to supply all the drinking water required by the town but it has since lost its purity and taste. The people use the tirtha for the immersion of bones and ashes of the dead whose last rites are performed on its bank. the tirtha is also used for swimming purposes.
Balaji Mandir The temple of Balaji is a considerably old temple in the town and was constructed by Bhavani Kaloo who rose to be the divan of Sabaji Bhosle and Janoji Bhosle (king of Nagpur kingdom). He constructed the temple in 1779 AD when he was the Subhedar at the thana of Karanja. The shrine is much revered. The images in the temple of Vyankateshvar Balaji are said to have been buried during Aurangzeb's reign to save them from destruction. All trace of them was lost, but in about 1760 a horseman happened casually to turn up a little earth with his stick and perceived a finger of an image. Images of Brahma, Vishnu, Mahadeva, Parvati, Devi, Ganapati, and Naga were taken out. At that time Bhavani Kaloo, who had been patwari of the village Khadi Dhanini in Mangrul tahsil but had become the Divan (or according to some accounts, a general) of the Bhosale Rajas, was at Bashini. He set up the present temple, a fine building standing in a large paved quadrangle, with a well-built veranda for pilgrims to stay, a bhandara for Brahmans to take food and various offices. The work took 12 years but was finished, according to an inscription on a pillar in front, in 1700 Shaka (1776 CE). The Dev Talav or Balaji Talav, a large square tank with stone-built sides, strongly and handsomely finished, and with a Jalakridasthana platform, resting-place for swimmers in the middle of the water body was made at the same time. The chief image is of black stone and sparkles with ornaments; a fine view of the town is to be obtained from the top of the temple gateway, though the staircase is rather abrupt. A dome plated with gold has recently been constructed over the inner chamber of the temple. According to the old Gazetteer 'large jagirs and inaams were given for the support of the temple, the present revenue being Rs. 11,000 from those sources and Rs. 3,000 from kangi offerings. A big fair is held in honor of Balaji, in Ashvina month (September–October). About 12,000 to 15,000 people assemble at the time of the fair.
Balaji Talav The Deo talav also known as Balaji talav, a large square tank with stone-built sides, strongly and handsomely finished and with a jalakridasthana, resting place for swimmers in the middle, was laid out at the time of the construction of Balaji mandir in 1770 CE. The temple is flanked on one side by the temple of Vyankateshvar Balaji and on the other by that of Ramchandra. The tree plantations by the tile side of the tank have now thoroughly disappeared. During the Ganapati festival, the immersion of the idols takes place in this tank and as a result, this tank is getting silted gradually. However, the tank still stands in good condition.
Rama Mandir On the other side of the Deo talav is a temple dedicated to Ramchandra, a large enclosed building but not, by any means as fine as the temple of Balaji. it contains images of Lakshmana, Sita, Maruti and Radha-Krishna besides that of Ramchandra. It is said to have been built by one Bhagvandas Maharaj Bairagi about 250 years ago. In front of the temple, has recently been constructed a two-storeyed dharmashala. It is used by the bairagis who visit the temple. Marriage and such other religious functions also take place in this Dharamshala. Ramanavami is celebrated at this temple with great pomp.
Daridrya Harana Tirtha The Daridrya-Harana Tirtha is said to have been created by Shri Dattatreya. Well built as the tank seems to have been formerly, the steps on only one side are noticeable now. By the side of the tank is a large banyan tree. One anecdote about the tirtha says that king Dashratha of Ayodhya, the father of Rama, killed Shravan by mistake by sitting over this tree.
Madhyameshvar Mandir was constructed about 5 to 7 years ago. After entering a big audience hall there is an inner chamber where is placed a shalunka of Shiva. At the time of the construction of the temple, some images and inscriptions were excavated at the site. The temple is said to have been constructed at a place where according to the belief of astronomers passes the equator and hence the temple is known as the Madhyameshvara temple.
Narayana Maharaja Temple has recently been constructed over the samadhi of Narayan Maharaj who stayed at Washim. The image of Narayan Maharaj has been placed over the samadhi. One has to go a few steps below the ground level to reach this shrine. From there another staircase leads to the altar where is placed the image of Shri Dattatreya. The whole construction is of white marble. The temple owns some adjacent land. The audience hall is under construction. Every year a small fair attended by the local populace is held on Datta Jayanti.
Gondeshvara Temple To the west of the town is the temple of Gondeshvara, much in a dilapidated condition. In the temple, are three images viz., those of Vishnu, his sister, and Lakshmi. By the side of the temple is ample garden land making the whole panorama of the temple extremely beautiful.
Shringi Rishi To the southeast direction, on the way to Pusad, there is a small town called Ansing which is the corrupt name of Ekshring Shringi Rishi. He was the one who performed Putrakameshti yagnya or the holy pyre for Dasharatha and his wives Kaushalya, Kaikeyi and Sumitra. Then they begot Ram, Lakshman, Bharat and Shatrughna. His temple is located in the far east of town.
Transport
Road
Washim is connected by State Highways to all the important cities of Maharashtra. Important Roads include Washim-Mangrul Pir-Karanja-Ner-Yavatmal, Washim-Karanja-Amravati-Nagpur, Washim-Malegaon-Akola, Washim-Risod-Lonar-Sindhkhed Raja-Jalna-Aurangabad-Ahmednagar-Pune-Mumbai, Washim-Kanergaon Naka-Hingoli-Nanded and Washim-Ansing-Pusad.
In future Maharashtra's Nagpur or Chandrapur to Pune expressway if propose can be pass via Yavatmal, washim, Lonar, Paithan, Ahmednagar. Mumbai-Nagpur Samrudhhi Mahamarg
Rail
Washim is a railway station on Purna-Khandwa section of South Central Railway (SCR). It was in the Hyderabad division of SCR and now is in the Nanded division after bifurcation of the Hyderabad division. Washim was connected to the Broad Gauge Railway Network in 2008 when tracks were extended from Purna to Akola.
17639/17640 Kachiguda Akola express can be accessed by the passengers arriving from Nagpur or Mumbai route while Hyderabad and Nanded can be accessed from the south. Weekly, Bi-weekly, Special, Daily, Intercity trains connecting to major stations like Delhi, Mumbai, Pune, Tirupati, Agra, Mathura, Amritsar, Chandigarh, Ambala, Ludhiana, Shri Ganganagar, Jaipur, Ajmer, Kota, Hyderabad, Nangaldam (Himachal Pradesh) Aurangabad, Nagpur, Indore, Yeshwantpur (Bangalore), Nashik, Nanded, Amravati, Bhopal, Khandwa, etc. from Washim. Washim has 3 platforms.
Hospital
Reynold Memorial Hospital Washim Reynolds Memorial Hospital and Affiliated Clinics (RMH) in Washim is a registered society and charitable trust operating under the Societies Registration Act 1860 (Registration No: MAH 391 Akola (PTR No: F487 Akola). As a healthcare organization, RMH is committed to serving the community and providing ethical healthcare services.
During these challenging times of the COVID-19 pandemic, RMH stands in solidarity with all those affected by the disease worldwide. Acknowledging the grim reports and the impact of the virus, RMH prayerfully plans its response to the situation, recognizing that God remains sovereign. The organization aims to play its part in serving and supporting individuals in need.
RMH's primary objective is to improve access to proper nursing care, especially in rural areas where the health scenario is challenging due to various factors. The organization believes in sensitizing and empowering the rural poor about better health practices. In addition to the regular services provided at the hospital, RMH extends its medical services through community medical camps. These camps aim to address the essential health needs of the local population, bringing necessary healthcare services to their doorsteps.
As a registered society and charitable trust, RMH welcomes partnerships and support from individuals and organizations during this critical time. By working together, we can make a positive impact on the lives of those in need. For more information on how to contribute or collaborate with RMH
References
Cities and towns in Washim district
Former capital cities in India
Vidarbha |
Kamalnayan Bajaj (23 January 1915 – 1 May 1972) was an Indian businessman and politician.
Biography
Early life and education
He was the elder son of Jamnalal Bajaj. He was born on 23 January 1915. He consolidated the Bajaj Group after inheriting it from his uncle in 1954. He completed his education from Cambridge University in England.
Business career
He diversified the interests of the Bajaj Group into the manufacture of scooters; three-wheelers; and cement, alloy casting and electrical equipment.
Kamalnayan Bajaj had three children, Rahul Bajaj, Suman Jain and Shishir Bajaj. Rahul Bajaj is his elder son.
Political career
He was elected to Lok Sabha three times from Wardha (Lok Sabha constituency) from 1957 to 1971. He lost in 1971 after he had joined the Congress (O) in 1969 with his friend Morarji Desai.
Death
He died at the age of 57 on 1 May 1972.
References
Bajaj Group
1915 births
1972 deaths
India MPs 1957–1962
India MPs 1962–1967
India MPs 1967–1970
Lok Sabha members from Maharashtra
People from Wardha
Kamalnayan
Indian National Congress politicians from Maharashtra |
```objective-c
/*
*
* 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, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#ifndef __PJSIP_SIP_TRANSPORT_H__
#define __PJSIP_SIP_TRANSPORT_H__
/**
* @file sip_transport.h
* @brief SIP Transport
*/
#include <pjsip/sip_msg.h>
#include <pjsip/sip_parser.h>
#include <pjsip/sip_resolve.h>
#include <pj/sock.h>
#include <pj/list.h>
#include <pj/ioqueue.h>
#include <pj/timer.h>
PJ_BEGIN_DECL
/**
* @defgroup PJSIP_TRANSPORT Transport
* @ingroup PJSIP_CORE
* @brief This is the transport framework.
*
* The transport framework is fully extensible. Please see
* <A HREF="/docs.htm">PJSIP Developer's Guide</A> PDF
* document for more information.
*
* Application MUST register at least one transport to PJSIP before any
* messages can be sent or received. Please see @ref PJSIP_TRANSPORT_UDP
* on how to create/register UDP transport to the transport framework.
*
* @{
*/
/*****************************************************************************
*
* GENERAL TRANSPORT (NAMES, TYPES, ETC.)
*
*****************************************************************************/
/*
* Forward declaration for transport factory (since it is referenced by
* the transport factory itself).
*/
typedef struct pjsip_tpfactory pjsip_tpfactory;
/**
* Flags for SIP transports.
*/
enum pjsip_transport_flags_e
{
PJSIP_TRANSPORT_RELIABLE = 1, /**< Transport is reliable. */
PJSIP_TRANSPORT_SECURE = 2, /**< Transport is secure. */
PJSIP_TRANSPORT_DATAGRAM = 4 /**< Datagram based transport.
(it's also assumed to be
connectionless) */
};
/**
* Check if transport tp is reliable.
*/
#define PJSIP_TRANSPORT_IS_RELIABLE(tp) \
((tp)->flag & PJSIP_TRANSPORT_RELIABLE)
/**
* Check if transport tp is secure.
*/
#define PJSIP_TRANSPORT_IS_SECURE(tp) \
((tp)->flag & PJSIP_TRANSPORT_SECURE)
/**
* Register new transport type to PJSIP. The PJSIP transport framework
* contains the info for some standard transports, as declared by
* #pjsip_transport_type_e. Application may use non-standard transport
* with PJSIP, but before it does so, it must register the information
* about the new transport type to PJSIP by calling this function.
*
* @param tp_flag The flags describing characteristics of this
* transport type.
* @param tp_name Transport type name.
* @param def_port Default port to be used for the transport.
* @param p_tp_type On successful registration, it will be filled with
* the registered type. This argument is optional.
*
* @return PJ_SUCCESS if registration is successful, or
* PJSIP_ETYPEEXISTS if the same transport type has
* already been registered.
*/
PJ_DECL(pj_status_t) pjsip_transport_register_type(unsigned tp_flag,
const char *tp_name,
int def_port,
int *p_tp_type);
/**
* Get the transport type from the transport name.
*
* @param name Transport name, such as "TCP", or "UDP".
*
* @return The transport type, or PJSIP_TRANSPORT_UNSPECIFIED if
* the name is not recognized as the name of supported
* transport.
*/
PJ_DECL(pjsip_transport_type_e)
pjsip_transport_get_type_from_name(const pj_str_t *name);
/**
* Get the first transport type that has the specified flags.
*
* @param flag The transport flag.
*
* @return Transport type.
*/
PJ_DECL(pjsip_transport_type_e)
pjsip_transport_get_type_from_flag(unsigned flag);
/**
* Get the socket address family of a given transport type.
*
* @param type Transport type.
*
* @return Transport type.
*/
PJ_DECL(int) pjsip_transport_type_get_af(pjsip_transport_type_e type);
/**
* Get transport flag from type.
*
* @param type Transport type.
*
* @return Transport flags.
*/
PJ_DECL(unsigned)
pjsip_transport_get_flag_from_type( pjsip_transport_type_e type );
/**
* Get the default SIP port number for the specified type.
*
* @param type Transport type.
*
* @return The port number, which is the default SIP port number for
* the specified type.
*/
PJ_DECL(int)
pjsip_transport_get_default_port_for_type(pjsip_transport_type_e type);
/**
* Get transport type name.
*
* @param t Transport type.
*
* @return Transport name.
*/
PJ_DECL(const char*) pjsip_transport_get_type_name(pjsip_transport_type_e t);
/**
* Get longer description for the specified transport type.
*
* @param t Transport type.
*
* @return Transport description.
*/
PJ_DECL(const char*) pjsip_transport_get_type_desc(pjsip_transport_type_e t);
/*****************************************************************************
*
* TRANSPORT SELECTOR.
*
*****************************************************************************/
/**
* This structure describes the type of data in pjsip_tpselector.
*/
typedef enum pjsip_tpselector_type
{
/** Transport is not specified. */
PJSIP_TPSELECTOR_NONE,
/** Use the specific transport to send request. */
PJSIP_TPSELECTOR_TRANSPORT,
/** Use the specific listener to send request. */
PJSIP_TPSELECTOR_LISTENER,
/** Use the IP version criteria to send request. */
PJSIP_TPSELECTOR_IP_VER,
} pjsip_tpselector_type;
/**
* This enumerator describes the IP version criteria for pjsip_tpselector.
*/
typedef enum pjsip_tpselector_ip_ver
{
/** IPv4 only. */
PJSIP_TPSELECTOR_USE_IPV4_ONLY,
/**
* No preference. IP version used will depend on the order of addresses
* returned by pjsip_resolver.
*/
PJSIP_TPSELECTOR_NO_PREFERENCE,
/** IPv4 is preferred. */
PJSIP_TPSELECTOR_PREFER_IPV4,
/** IPv6 is preferred. */
PJSIP_TPSELECTOR_PREFER_IPV6,
/** IPv6 only. */
PJSIP_TPSELECTOR_USE_IPV6_ONLY
} pjsip_tpselector_ip_ver;
/**
* This structure describes the transport/listener preference to be used
* when sending outgoing requests.
*
* Normally transport will be selected automatically according to rules about
* sending requests. But some applications (such as proxies or B2BUAs) may
* want to explicitly use specific transport to send requests, for example
* when they want to make sure that outgoing request should go from a specific
* network interface.
*
* The pjsip_tpselector structure is used for that purpose, i.e. to allow
* application specificly request that a particular transport/listener
* should be used to send request. This structure is used when calling
* pjsip_tsx_set_transport() and pjsip_dlg_set_transport().
*
* If application disables connection reuse and wants to force creating
* a new transport, it needs to consider the following couple of things:
* - If it still wants to reuse an existing transport (if any), it
* needs to keep a reference to that transport and specifically set
* the transport to be used for sending requests.
* - Delete those existing transports manually when no longer needed.
*/
typedef struct pjsip_tpselector
{
/** The type of data in the union */
pjsip_tpselector_type type;
/**
* Whether to disable reuse of an existing connection.
* This setting will be ignored if (type == PJSIP_TPSELECTOR_TRANSPORT)
* and transport in the union below is set.
*/
pj_bool_t disable_connection_reuse;
/**
* Union representing the transport/listener/IP version criteria
* to be used.
*/
union {
pjsip_transport *transport;
pjsip_tpfactory *listener;
pjsip_tpselector_ip_ver ip_ver;
void *ptr;
} u;
} pjsip_tpselector;
/**
* Add transport/listener reference in the selector to prevent the specified
* transport/listener from being destroyed while application still has
* reference to it.
*
* @param sel The transport selector.
*/
PJ_DECL(void) pjsip_tpselector_add_ref(pjsip_tpselector *sel);
/**
* Decrement transport/listener reference in the selector.
* @param sel The transport selector
*/
PJ_DECL(void) pjsip_tpselector_dec_ref(pjsip_tpselector *sel);
/*****************************************************************************
*
* RECEIVE DATA BUFFER.
*
*****************************************************************************/
/**
* A customized ioqueue async operation key which is used by transport
* to locate rdata when a pending read operation completes.
*/
typedef struct pjsip_rx_data_op_key
{
pj_ioqueue_op_key_t op_key; /**< ioqueue op_key. */
pjsip_rx_data *rdata; /**< rdata associated with this */
} pjsip_rx_data_op_key;
/**
* Incoming message buffer.
* This structure keep all the information regarding the received message. This
* buffer lifetime is only very short, normally after the transaction has been
* called, this buffer will be deleted/recycled. So care must be taken when
* allocating storage from the pool of this buffer.
*/
struct pjsip_rx_data
{
/**
* tp_info is part of rdata that remains static for the duration of the
* buffer. It is initialized when the buffer was created by transport.
*/
struct
{
/** Memory pool for this buffer. */
pj_pool_t *pool;
/** The transport object which received this packet. */
pjsip_transport *transport;
/** Other transport specific data to be attached to this buffer. */
void *tp_data;
/** Ioqueue key. */
pjsip_rx_data_op_key op_key;
} tp_info;
/**
* pkt_info is initialized by transport when it receives an incoming
* packet.
*/
struct
{
/** Time when the message was received. */
pj_time_val timestamp;
/** Pointer to the original packet. */
char packet[PJSIP_MAX_PKT_LEN];
/** Zero termination for the packet. */
pj_uint32_t zero;
/** The length of the packet received. */
pj_ssize_t len;
/** The source address from which the packet was received. */
pj_sockaddr src_addr;
/** The length of the source address. */
int src_addr_len;
/** The IP source address string (NULL terminated). */
char src_name[PJ_INET6_ADDRSTRLEN];
/** The IP source port number. */
int src_port;
} pkt_info;
/**
* msg_info is initialized by transport mgr (tpmgr) before this buffer
* is passed to endpoint.
*/
struct
{
/** Start of msg buffer. */
char *msg_buf;
/** Length fo message. */
int len;
/** The parsed message, if any. */
pjsip_msg *msg;
/** Short description about the message.
* Application should use #pjsip_rx_data_get_info() instead.
*/
char *info;
/** The Call-ID header as found in the message. */
pjsip_cid_hdr *cid;
/** The From header as found in the message. */
pjsip_from_hdr *from;
/** The To header as found in the message. */
pjsip_to_hdr *to;
/** The topmost Via header as found in the message. */
pjsip_via_hdr *via;
/** The CSeq header as found in the message. */
pjsip_cseq_hdr *cseq;
/** Max forwards header. */
pjsip_max_fwd_hdr *max_fwd;
/** The first route header. */
pjsip_route_hdr *route;
/** The first record-route header. */
pjsip_rr_hdr *record_route;
/** Content-type header. */
pjsip_ctype_hdr *ctype;
/** Content-length header. */
pjsip_clen_hdr *clen;
/** "Require" header containing aggregates of all Require
* headers found in the message, or NULL.
*/
pjsip_require_hdr *require;
/** "Supported" header containing aggregates of all Supported
* headers found in the message, or NULL.
*/
pjsip_supported_hdr *supported;
/** The list of error generated by the parser when parsing
this message.
*/
pjsip_parser_err_report parse_err;
} msg_info;
/**
* endpt_info is initialized by endpoint after this buffer reaches
* endpoint.
*/
struct
{
/**
* Data attached by modules to this message.
*/
void *mod_data[PJSIP_MAX_MODULE];
} endpt_info;
};
/**
* Get printable information about the message in the rdata.
*
* @param rdata The receive data buffer.
*
* @return Printable information.
*/
PJ_DECL(char*) pjsip_rx_data_get_info(pjsip_rx_data *rdata);
/**
* Clone pjsip_rx_data. This will duplicate the contents of
* pjsip_rx_data and add reference count to the transport.
* Once application has finished using the cloned pjsip_rx_data,
* it must release it by calling #pjsip_rx_data_free_cloned().
*
* By default (if flags is set to zero), this function copies the
* transport pointer in \a tp_info, duplicates the \a pkt_info,
* perform deep clone of the \a msg_info parts of the rdata, and
* fills the \a endpt_info (i.e. the \a mod_data) with zeros.
*
* @param src The source to be cloned.
* @param flags Optional flags. Must be zero for now.
* @param p_rdata Pointer to receive the cloned rdata.
*
* @return PJ_SUCCESS on success or the appropriate error.
*/
PJ_DECL(pj_status_t) pjsip_rx_data_clone(const pjsip_rx_data *src,
unsigned flags,
pjsip_rx_data **p_rdata);
/**
* Free cloned pjsip_rx_data. This function must be and must only
* be called for a cloned pjsip_rx_data. Specifically, it must NOT
* be called for the original pjsip_rx_data that is returned by
* transports.
*
* This function will free the memory used by the pjsip_rx_data and
* decrement the transport reference counter.
*
* @param rdata The receive data buffer.
*
* @return PJ_SUCCESS on success or the appropriate error.
*/
PJ_DECL(pj_status_t) pjsip_rx_data_free_cloned(pjsip_rx_data *rdata);
/*****************************************************************************
*
* TRANSMIT DATA BUFFER MANIPULATION.
*
*****************************************************************************/
/** Customized ioqueue async operation key, used by transport to keep
* callback parameters.
*/
typedef struct pjsip_tx_data_op_key
{
/** ioqueue pending operation key. */
pj_ioqueue_op_key_t key;
/** Transmit data associated with this key. */
pjsip_tx_data *tdata;
/** Arbitrary token (attached by transport) */
void *token;
/** Callback to be called when pending transmit operation has
completed.
*/
void (*callback)(pjsip_transport*,void*,pj_ssize_t);
} pjsip_tx_data_op_key;
/**
* Data structure for sending outgoing message. Application normally creates
* this buffer by calling #pjsip_endpt_create_tdata.
*
* The lifetime of this buffer is controlled by the reference counter in this
* structure, which is manipulated by calling #pjsip_tx_data_add_ref and
* #pjsip_tx_data_dec_ref. When the reference counter has reached zero, then
* this buffer will be destroyed.
*
* A transaction object normally will add reference counter to this buffer
* when application calls #pjsip_tsx_send_msg, because it needs to keep the
* message for retransmission. The transaction will release the reference
* counter once its state has reached final state.
*/
struct pjsip_tx_data
{
/** This is for transmission queue; it's managed by transports. */
PJ_DECL_LIST_MEMBER(struct pjsip_tx_data);
/** Memory pool for this buffer. */
pj_pool_t *pool;
/** A name to identify this buffer. */
char obj_name[PJ_MAX_OBJ_NAME];
/** Short information describing this buffer and the message in it.
* Application should use #pjsip_tx_data_get_info() instead of
* directly accessing this member.
*/
char *info;
/** For response message, this contains the reference to timestamp when
* the original request message was received. The value of this field
* is set when application creates response message to a request by
* calling #pjsip_endpt_create_response.
*/
pj_time_val rx_timestamp;
/** The transport manager for this buffer. */
pjsip_tpmgr *mgr;
/** Ioqueue asynchronous operation key. */
pjsip_tx_data_op_key op_key;
/** Lock object. */
pj_lock_t *lock;
/** The message in this buffer. */
pjsip_msg *msg;
/** Strict route header saved by #pjsip_process_route_set(), to be
* restored by #pjsip_restore_strict_route_set().
*/
pjsip_route_hdr *saved_strict_route;
/** Buffer to the printed text representation of the message. When the
* content of this buffer is set, then the transport will send the content
* of this buffer instead of re-printing the message structure. If the
* message structure has changed, then application must invalidate this
* buffer by calling #pjsip_tx_data_invalidate_msg.
*/
pjsip_buffer buf;
/** Reference counter. */
pj_atomic_t *ref_cnt;
/** Being processed by transport? */
int is_pending;
/** Transport manager internal. */
void *token;
/** Callback to be called when this tx_data has been transmitted. */
void (*cb)(void*, pjsip_tx_data*, pj_ssize_t);
/** Destination information, to be used to determine the network address
* of the message. For a request, this information is initialized when
* the request is sent with #pjsip_endpt_send_request_stateless() and
* network address is resolved. For CANCEL request, this information
* will be copied from the original INVITE to make sure that the CANCEL
* request goes to the same physical network address as the INVITE
* request.
*/
struct
{
/** Server name.
*/
pj_str_t name;
/** Server addresses resolved.
*/
pjsip_server_addresses addr;
/** Current server address being tried.
*/
unsigned cur_addr;
} dest_info;
/** Transport information, only valid during on_tx_request() and
* on_tx_response() callback.
*/
struct
{
pjsip_transport *transport; /**< Transport being used. */
pj_sockaddr dst_addr; /**< Destination address. */
int dst_addr_len; /**< Length of address. */
char dst_name[PJ_INET6_ADDRSTRLEN]; /**< Destination address. */
int dst_port; /**< Destination port. */
} tp_info;
/**
* Transport selector, to specify which transport to be used.
* The value here must be set with pjsip_tx_data_set_transport(),
* to allow reference counter to be set properly.
*/
pjsip_tpselector tp_sel;
/**
* Special flag to indicate that this transmit data is a request that has
* been updated with proper authentication response and is ready to be
* sent for retry.
*/
pj_bool_t auth_retry;
/**
* Arbitrary data attached by PJSIP modules.
*/
void *mod_data[PJSIP_MAX_MODULE];
/**
* If via_addr is set, it will be used as the "sent-by" field of the
* Via header for outgoing requests as long as the request uses via_tp
* transport. Normally application should not use or access these fields.
*/
pjsip_host_port via_addr; /**< Via address. */
const void *via_tp; /**< Via transport. */
};
/**
* Create a new, blank transmit buffer. The reference count is initialized
* to zero.
*
* @param mgr The transport manager.
* @param tdata Pointer to receive transmit data.
*
* @return PJ_SUCCESS, or the appropriate error code.
*
* @see pjsip_endpt_create_tdata
*/
PJ_DECL(pj_status_t) pjsip_tx_data_create( pjsip_tpmgr *mgr,
pjsip_tx_data **tdata );
/**
* Add reference counter to the transmit buffer. The reference counter controls
* the life time of the buffer, ie. when the counter reaches zero, then it
* will be destroyed.
*
* @param tdata The transmit buffer.
*/
PJ_DECL(void) pjsip_tx_data_add_ref( pjsip_tx_data *tdata );
/**
* Decrement reference counter of the transmit buffer.
* When the transmit buffer is no longer used, it will be destroyed and
* caller is informed with PJSIP_EBUFDESTROYED return status.
*
* @param tdata The transmit buffer data.
* @return This function will always succeeded eventhough the return
* status is non-zero. A status PJSIP_EBUFDESTROYED will be
* returned to inform that buffer is destroyed.
*/
PJ_DECL(pj_status_t) pjsip_tx_data_dec_ref( pjsip_tx_data *tdata );
/**
* Print the SIP message to transmit data buffer's internal buffer. This
* may allocate memory for the buffer, if the buffer has not been allocated
* yet, and encode the SIP message to that buffer.
*
* @param tdata The transmit buffer.
*
* @return PJ_SUCCESS on success of the appropriate error code.
*/
PJ_DECL(pj_status_t) pjsip_tx_data_encode(pjsip_tx_data *tdata);
/**
* Check if transmit data buffer contains a valid message.
*
* @param tdata The transmit buffer.
* @return Non-zero (PJ_TRUE) if buffer contains a valid message.
*/
PJ_DECL(pj_bool_t) pjsip_tx_data_is_valid( pjsip_tx_data *tdata );
/**
* Invalidate the print buffer to force message to be re-printed. Call
* when the message has changed after it has been printed to buffer. The
* message is printed to buffer normally by transport when it is about to be
* sent to the wire. Subsequent sending of the message will not cause
* the message to be re-printed, unless application invalidates the buffer
* by calling this function.
*
* @param tdata The transmit buffer.
*/
PJ_DECL(void) pjsip_tx_data_invalidate_msg( pjsip_tx_data *tdata );
/**
* Get short printable info about the transmit data. This will normally return
* short information about the message.
*
* @param tdata The transmit buffer.
*
* @return Null terminated info string.
*/
PJ_DECL(char*) pjsip_tx_data_get_info( pjsip_tx_data *tdata );
/**
* Set the explicit transport to be used when sending this transmit data.
* Application should not need to call this function, but rather use
* pjsip_tsx_set_transport() and pjsip_dlg_set_transport() instead (which
* will call this function).
*
* @param tdata The transmit buffer.
* @param sel Transport selector.
*
* @return PJ_SUCCESS on success.
*/
PJ_DECL(pj_status_t) pjsip_tx_data_set_transport(pjsip_tx_data *tdata,
const pjsip_tpselector *sel);
/**
* Clone pjsip_tx_data. This will duplicate the message contents of
* pjsip_tx_data (pjsip_tx_data.msg) and add reference count to the tdata.
* Once application has finished using the cloned pjsip_tx_data,
* it must release it by calling #pjsip_tx_data_dec_ref().
* Currently, this will only clone response message.
*
* @param src The source to be cloned.
* @param flags Optional flags. Must be zero for now.
* @param p_rdata Pointer to receive the cloned tdata.
*
* @return PJ_SUCCESS on success or the appropriate error.
*/
PJ_DECL(pj_status_t) pjsip_tx_data_clone(const pjsip_tx_data *src,
unsigned flags,
pjsip_tx_data **p_rdata);
/*****************************************************************************
*
* TRANSPORT
*
*****************************************************************************/
/**
* Type of callback to receive transport operation status.
*/
typedef void (*pjsip_transport_callback)(pjsip_transport *tp, void *token,
pj_ssize_t sent_bytes);
/**
* This structure describes transport key to be registered to hash table.
*/
typedef struct pjsip_transport_key
{
/**
* Transport type.
*/
long type;
/**
* Destination address.
*/
pj_sockaddr rem_addr;
} pjsip_transport_key;
/**
* Enumeration of transport direction types.
*/
typedef enum pjsip_transport_dir
{
PJSIP_TP_DIR_NONE, /**< Direction not set, normally used by
connectionless transports such as
UDP transport. */
PJSIP_TP_DIR_OUTGOING, /**< Outgoing connection or client mode,
this is only for connection-oriented
transports. */
PJSIP_TP_DIR_INCOMING, /**< Incoming connection or server mode,
this is only for connection-oriented
transports. */
} pjsip_transport_dir;
/**
* This structure represent the "public" interface of a SIP transport.
* Applications normally extend this structure to include transport
* specific members.
*/
struct pjsip_transport
{
char obj_name[PJ_MAX_OBJ_NAME]; /**< Name. */
pj_pool_t *pool; /**< Pool used by transport. */
pj_atomic_t *ref_cnt; /**< Reference counter. */
pj_lock_t *lock; /**< Lock object. */
pj_grp_lock_t *grp_lock; /**< Group lock for sync with
ioqueue and timer. */
pj_bool_t tracing; /**< Tracing enabled? */
pj_bool_t is_shutdown; /**< Being shutdown? */
pj_bool_t is_destroying; /**< Destroy in progress? */
/** Key for indexing this transport in hash table. */
pjsip_transport_key key;
char *type_name; /**< Type name. */
unsigned flag; /**< #pjsip_transport_flags_e */
char *info; /**< Transport info/description.*/
int addr_len; /**< Length of addresses. */
pj_sockaddr local_addr; /**< Bound address. */
pjsip_host_port local_name; /**< Published name (eg. STUN). */
pjsip_host_port remote_name; /**< Remote address name. */
pjsip_transport_dir dir; /**< Connection direction. */
pjsip_endpoint *endpt; /**< Endpoint instance. */
pjsip_tpmgr *tpmgr; /**< Transport manager. */
pjsip_tpfactory *factory; /**< Factory instance. Note: it
may be invalid/shutdown. */
pj_timer_entry idle_timer; /**< Timer when ref cnt is zero.*/
pj_timestamp last_recv_ts; /**< Last time receiving data. */
pj_size_t last_recv_len; /**< Last received data length. */
void *data; /**< Internal transport data. */
unsigned initial_timeout;/**< Initial timeout interval
to be applied to incoming
TCP/TLS transports when no
valid data received after
a successful connection. */
/**
* Function to be called by transport manager to send SIP message.
*
* @param transport The transport to send the message.
* @param packet The buffer to send.
* @param length The length of the buffer to send.
* @param op_key Completion token, which will be supplied to
* caller when pending send operation completes.
* @param rem_addr The remote destination address.
* @param addr_len Size of remote address.
* @param callback If supplied, the callback will be called
* once a pending transmission has completed. If
* the function completes immediately (i.e. return
* code is not PJ_EPENDING), the callback will not
* be called.
*
* @return Should return PJ_SUCCESS only if data has been
* succesfully queued to operating system for
* transmission. Otherwise it may return PJ_EPENDING
* if the underlying transport can not send the
* data immediately and will send it later, which in
* this case caller doesn't have to do anything
* except wait the calback to be called, if it
* supplies one.
* Other return values indicate the error code.
*/
pj_status_t (*send_msg)(pjsip_transport *transport,
pjsip_tx_data *tdata,
const pj_sockaddr_t *rem_addr,
int addr_len,
void *token,
pjsip_transport_callback callback);
/**
* Instruct the transport to initiate graceful shutdown procedure.
* After all objects release their reference to this transport,
* the transport will be deleted.
*
* Note that application MUST use #pjsip_transport_shutdown() instead.
*
* @param transport The transport.
*
* @return PJ_SUCCESS on success.
*/
pj_status_t (*do_shutdown)(pjsip_transport *transport);
/**
* Forcefully destroy this transport regardless whether there are
* objects that currently use this transport. This function should only
* be called by transport manager or other internal objects (such as the
* transport itself) who know what they're doing. Application should use
* #pjsip_transport_shutdown() instead.
*
* @param transport The transport.
*
* @return PJ_SUCCESS on success.
*/
pj_status_t (*destroy)(pjsip_transport *transport);
/*
* Application may extend this structure..
*/
};
/**
* Register a transport instance to the transport manager. This function
* is normally called by the transport instance when it is created
* by application.
*
* @param mgr The transport manager.
* @param tp The new transport to be registered.
*
* @return PJ_SUCCESS on success.
*/
PJ_DECL(pj_status_t) pjsip_transport_register( pjsip_tpmgr *mgr,
pjsip_transport *tp );
/**
* Start graceful shutdown procedure for this transport. After graceful
* shutdown has been initiated, no new reference can be obtained for
* the transport. However, existing objects that currently uses the
* transport may still use this transport to send and receive packets.
*
* After all objects release their reference to this transport,
* the transport will be destroyed immediately.
*
* @param tp The transport.
*
* @return PJ_SUCCESS on success.
*/
PJ_DECL(pj_status_t) pjsip_transport_shutdown(pjsip_transport *tp);
/**
* Start shutdown procedure for this transport. If \a force is false,
* the API is the same as #pjsip_transport_shutdown(), while
* if \a force is true, existing transport users will immediately
* receive PJSIP_TP_STATE_DISCONNECTED notification and should not
* use the transport anymore. In either case, transport will
* only be destroyed after all objects release their references.
*
* @param tp The transport.
* @param force Force transport to immediately send
* disconnection state notification.
*
* @return PJ_SUCCESS on success.
*/
PJ_DECL(pj_status_t) pjsip_transport_shutdown2(pjsip_transport *tp,
pj_bool_t force);
/**
* Destroy a transport when there is no object currently uses the transport.
* This function is normally called internally by transport manager or the
* transport itself. Application should use #pjsip_transport_shutdown()
* instead.
*
* @param tp The transport instance.
*
* @return PJ_SUCCESS on success or the appropriate error code.
* Some of possible errors are PJSIP_EBUSY if the
* transport's reference counter is not zero.
*/
PJ_DECL(pj_status_t) pjsip_transport_destroy( pjsip_transport *tp);
/**
* Add reference counter to the specified transport. Any objects that wishes
* to keep the reference of the transport MUST increment the transport's
* reference counter to prevent it from being destroyed.
*
* @param tp The transport instance.
*
* @return PJ_SUCCESS on success or the appropriate error code.
*/
PJ_DECL(pj_status_t) pjsip_transport_add_ref( pjsip_transport *tp );
/**
* Decrement reference counter of the specified transport. When an object no
* longer want to keep the reference to the transport, it must decrement the
* reference counter. When the reference counter of the transport reaches
* zero, the transport manager will start the idle timer to destroy the
* transport if no objects acquire the reference counter during the idle
* interval.
*
* @param tp The transport instance.
*
* @return PJ_SUCCESS on success.
*/
PJ_DECL(pj_status_t) pjsip_transport_dec_ref( pjsip_transport *tp );
/**
* This function is called by transport instances to report an incoming
* packet to the transport manager. The transport manager then would try to
* parse all SIP messages in the packet, and for each parsed SIP message, it
* would report the message to the SIP endpoint (#pjsip_endpoint).
*
* @param mgr The transport manager instance.
* @param rdata The receive data buffer containing the packet. The
* transport MUST fully initialize tp_info and pkt_info
* member of the rdata.
*
* @return The number of bytes successfully processed from the
* packet. If the transport is datagram oriented, the
* value will be equal to the size of the packet. For
* stream oriented transport (e.g. TCP, TLS), the value
* returned may be less than the packet size, if
* partial message is received. The transport then MUST
* keep the remainder part and report it again to
* this function once more data/packet is received.
*/
PJ_DECL(pj_ssize_t) pjsip_tpmgr_receive_packet(pjsip_tpmgr *mgr,
pjsip_rx_data *rdata);
/*****************************************************************************
*
* TRANSPORT FACTORY
*
*****************************************************************************/
/**
* A transport factory is normally used for connection oriented transports
* (such as TCP or TLS) to create instances of transports. It registers
* a new transport type to the transport manager, and the transport manager
* would ask the factory to create a transport instance when it received
* command from application to send a SIP message using the specified
* transport type.
*/
struct pjsip_tpfactory
{
/** This list is managed by transport manager. */
PJ_DECL_LIST_MEMBER(struct pjsip_tpfactory);
char obj_name[PJ_MAX_OBJ_NAME]; /**< Name. */
pj_pool_t *pool; /**< Owned memory pool. */
pj_lock_t *lock; /**< Lock object. */
pjsip_transport_type_e type; /**< Transport type. */
char *type_name; /**< Type string name. */
unsigned flag; /**< Transport flag. */
char *info; /**< Transport info/description.*/
pj_sockaddr local_addr; /**< Bound address. */
pjsip_host_port addr_name; /**< Published name. */
/**
* Create new outbound connection suitable for sending SIP message
* to specified remote address.
* Note that the factory is responsible for both creating the
* transport and registering it to the transport manager.
*/
pj_status_t (*create_transport)(pjsip_tpfactory *factory,
pjsip_tpmgr *mgr,
pjsip_endpoint *endpt,
const pj_sockaddr *rem_addr,
int addr_len,
pjsip_transport **transport);
/**
* Create new outbound connection suitable for sending SIP message
* to specified remote address by also considering outgoing SIP
* message data.
* Note that the factory is responsible for both creating the
* transport and registering it to the transport manager.
*/
pj_status_t (*create_transport2)(pjsip_tpfactory *factory,
pjsip_tpmgr *mgr,
pjsip_endpoint *endpt,
const pj_sockaddr *rem_addr,
int addr_len,
pjsip_tx_data *tdata,
pjsip_transport **transport);
/**
* Destroy the listener.
*/
pj_status_t (*destroy)(pjsip_tpfactory *factory);
/*
* Application may extend this structure..
*/
};
/**
* Register a transport factory.
*
* @param mgr The transport manager.
* @param tpf Transport factory.
*
* @return PJ_SUCCESS if listener was successfully created.
*/
PJ_DECL(pj_status_t) pjsip_tpmgr_register_tpfactory(pjsip_tpmgr *mgr,
pjsip_tpfactory *tpf);
/**
* Unregister factory.
*
* @param mgr The transport manager.
* @param tpf Transport factory.
*
* @return PJ_SUCCESS is sucessfully unregistered.
*/
PJ_DECL(pj_status_t) pjsip_tpmgr_unregister_tpfactory(pjsip_tpmgr *mgr,
pjsip_tpfactory *tpf);
/*****************************************************************************
*
* TRANSPORT MANAGER
*
*****************************************************************************/
/**
* Type of callback to be called when transport manager receives incoming
* SIP message.
*
* @param ep Endpoint.
* @param status Receiption status.
* @param rd Received packet.
*/
typedef void (*pjsip_rx_callback)(pjsip_endpoint *ep, pj_status_t status,
pjsip_rx_data *rd);
/**
* Type of callback to be called before transport manager is about
* to transmit SIP message.
*
* @param ep Endpoint.
* @param td Transmit data.
*/
typedef pj_status_t (*pjsip_tx_callback)(pjsip_endpoint *ep, pjsip_tx_data*td);
/**
* Create a transport manager. Normally application doesn't need to call
* this function directly, since a transport manager will be created and
* destroyed automatically by the SIP endpoint.
*
* @param pool Pool.
* @param endpt Endpoint instance.
* @param rx_cb Callback to receive incoming message.
* @param tx_cb Callback to be called before transport manager is sending
* outgoing message.
* @param p_mgr Pointer to receive the new transport manager.
*
* @return PJ_SUCCESS or the appropriate error code on error.
*/
PJ_DECL(pj_status_t) pjsip_tpmgr_create( pj_pool_t *pool,
pjsip_endpoint * endpt,
pjsip_rx_callback rx_cb,
pjsip_tx_callback tx_cb,
pjsip_tpmgr **p_mgr);
/**
* Find out the appropriate local address info (IP address and port) to
* advertise in Contact header based on the remote address to be
* contacted. The local address info would be the address name of the
* transport or listener which will be used to send the request.
*
* In this implementation, it will only select the transport based on
* the transport type in the request.
*
* @see pjsip_tpmgr_find_local_addr2()
*
* @param tpmgr The transport manager.
* @param pool Pool to allocate memory for the IP address.
* @param type Destination address to contact.
* @param sel Optional pointer to prefered transport, if any.
* @param ip_addr Pointer to receive the IP address.
* @param port Pointer to receive the port number.
*
* @return PJ_SUCCESS, or the appropriate error code.
*/
PJ_DECL(pj_status_t) pjsip_tpmgr_find_local_addr( pjsip_tpmgr *tpmgr,
pj_pool_t *pool,
pjsip_transport_type_e type,
const pjsip_tpselector *sel,
pj_str_t *ip_addr,
int *port);
/**
* Parameter for pjsip_tpmgr_find_local_addr2() function.
*/
typedef struct pjsip_tpmgr_fla2_param
{
/**
* Specify transport type to use. This must be set.
*/
pjsip_transport_type_e tp_type;
/**
* Optional pointer to preferred transport, if any.
*/
const pjsip_tpselector *tp_sel;
/**
* Destination host, if known. The destination host is needed
* if \a local_if field below is set.
*/
pj_str_t dst_host;
/**
* Specify if the function should return which local interface
* to use for the specified destination in \a dst_host. By definition,
* the returned address will always be local interface address.
*/
pj_bool_t local_if;
/**
* The returned address.
*/
pj_str_t ret_addr;
/**
* The returned port.
*/
pj_uint16_t ret_port;
/**
* Returned pointer to the transport. Only set if local_if is set.
*/
const void *ret_tp;
} pjsip_tpmgr_fla2_param;
/**
* Initialize with default values.
*
* @param prm The parameter to be initialized.
*/
PJ_DECL(void) pjsip_tpmgr_fla2_param_default(pjsip_tpmgr_fla2_param *prm);
/**
* Find out the appropriate local address info (IP address and port) to
* advertise in Contact or Via header header based on the remote address
* to be contacted. The local address info would be the address name of the
* transport or listener which will be used to send the request.
*
* @see pjsip_tpmgr_find_local_addr()
*
* @param tpmgr The transport manager.
* @param pool Pool to allocate memory for the IP address.
* @param prm Function input and output parameters.
*
* @return PJ_SUCCESS, or the appropriate error code.
*/
PJ_DECL(pj_status_t) pjsip_tpmgr_find_local_addr2(pjsip_tpmgr *tpmgr,
pj_pool_t *pool,
pjsip_tpmgr_fla2_param *prm);
/**
* Return number of transports currently registered to the transport
* manager.
*
* @param mgr The transport manager.
*
* @return Number of transports.
*/
PJ_DECL(unsigned) pjsip_tpmgr_get_transport_count(pjsip_tpmgr *mgr);
/**
* Destroy a transport manager. Normally application doesn't need to call
* this function directly, since a transport manager will be created and
* destroyed automatically by the SIP endpoint.
*
* @param mgr The transport manager.
*
* @return PJ_SUCCESS on success.
*/
PJ_DECL(pj_status_t) pjsip_tpmgr_destroy(pjsip_tpmgr *mgr);
/**
* Dump transport info and status to log.
*
* @param mgr The transport manager.
*/
PJ_DECL(void) pjsip_tpmgr_dump_transports(pjsip_tpmgr *mgr);
/**
* Parameter for pjsip_tpmgr_shutdown_all() function.
*/
typedef struct pjsip_tpmgr_shutdown_param
{
/**
* Specify whether disconnection state notification should be sent
* immediately, see pjsip_transport_shutdown2() for more info.
*
* Default: PJ_TRUE.
*/
pj_bool_t force;
/**
* Specify whether UDP transports should also be shutdown.
*
* Default: PJ_TRUE.
*/
pj_bool_t include_udp;
} pjsip_tpmgr_shutdown_param;
/**
* Initialize transports shutdown parameter with default values.
*
* @param prm The parameter to be initialized.
*/
PJ_DECL(void) pjsip_tpmgr_shutdown_param_default(
pjsip_tpmgr_shutdown_param *prm);
/**
* Shutdown all transports. This basically invokes pjsip_transport_shutdown2()
* on all transports.
*
* @param mgr The transport manager.
* @param param The function parameters.
*
* @return PJ_SUCCESS on success.
*/
PJ_DECL(pj_status_t) pjsip_tpmgr_shutdown_all(
pjsip_tpmgr *mgr,
const pjsip_tpmgr_shutdown_param *param);
/*****************************************************************************
*
* PUBLIC API
*
*****************************************************************************/
/**
* Find transport to be used to send message to remote destination. If no
* suitable transport is found, a new one will be created.
*
* This is an internal function since normally application doesn't have access
* to transport manager. Application should use pjsip_endpt_acquire_transport()
* instead.
*
* @param mgr The transport manager instance.
* @param type The type of transport to be acquired.
* @param remote The remote address to send message to.
* @param addr_len Length of the remote address.
* @param sel Optional pointer to transport selector instance which is
* used to find explicit transport, if required.
* @param tp Pointer to receive the transport instance, if one is found.
*
* @return PJ_SUCCESS on success, or the appropriate error code.
*/
PJ_DECL(pj_status_t) pjsip_tpmgr_acquire_transport(pjsip_tpmgr *mgr,
pjsip_transport_type_e type,
const pj_sockaddr_t *remote,
int addr_len,
const pjsip_tpselector *sel,
pjsip_transport **tp);
/**
* Find suitable transport for sending SIP message to specified remote
* destination by also considering the outgoing SIP message. If no suitable
* transport is found, a new one will be created.
*
* This is an internal function since normally application doesn't have access
* to transport manager. Application should use pjsip_endpt_acquire_transport2()
* instead.
*
* @param mgr The transport manager instance.
* @param type The type of transport to be acquired.
* @param remote The remote address to send message to.
* @param addr_len Length of the remote address.
* @param sel Optional pointer to transport selector instance which is
* used to find explicit transport, if required.
* @param tdata Optional pointer to data to be sent.
* @param tp Pointer to receive the transport instance, if one is found.
*
* @return PJ_SUCCESS on success, or the appropriate error code.
*/
PJ_DECL(pj_status_t) pjsip_tpmgr_acquire_transport2(pjsip_tpmgr *mgr,
pjsip_transport_type_e type,
const pj_sockaddr_t *remote,
int addr_len,
const pjsip_tpselector *sel,
pjsip_tx_data *tdata,
pjsip_transport **tp);
/**
* Type of callback to receive notification when message or raw data
* has been sent.
*
* @param token The token that was given when calling the function
* to send message or raw data.
* @param tdata The transmit buffer used to send the message.
* @param bytes_sent Number of bytes sent. On success, the value will be
* positive number indicating the number of bytes sent.
* On failure, the value will be a negative number of
* the error code (i.e. bytes_sent = -status).
*/
typedef void (*pjsip_tp_send_callback)(void *token, pjsip_tx_data *tdata,
pj_ssize_t bytes_sent);
/**
* This is a low-level function to send a SIP message using the specified
* transport to the specified destination.
*
* @param tr The SIP transport to be used.
* @param tdata Transmit data buffer containing SIP message.
* @param addr Destination address.
* @param addr_len Length of destination address.
* @param token Arbitrary token to be returned back to callback.
* @param cb Optional callback to be called to notify caller about
* the completion status of the pending send operation.
*
* @return If the message has been sent successfully, this function
* will return PJ_SUCCESS and the callback will not be
* called. If message cannot be sent immediately, this
* function will return PJ_EPENDING, and application will
* be notified later about the completion via the callback.
* Any statuses other than PJ_SUCCESS or PJ_EPENDING
* indicates immediate failure, and in this case the
* callback will not be called.
*/
PJ_DECL(pj_status_t) pjsip_transport_send( pjsip_transport *tr,
pjsip_tx_data *tdata,
const pj_sockaddr_t *addr,
int addr_len,
void *token,
pjsip_tp_send_callback cb);
/**
* This is a low-level function to send raw data to a destination.
*
* See also #pjsip_endpt_send_raw() and #pjsip_endpt_send_raw_to_uri().
*
* @param mgr Transport manager.
* @param tp_type Transport type.
* @param sel Optional pointer to transport selector instance if
* application wants to use a specific transport instance
* rather then letting transport manager finds the suitable
* transport.
* @param tdata Optional transmit data buffer to be used. If this value
* is NULL, this function will create one internally. If
* tdata is specified, this function will decrement the
* reference counter upon completion.
* @param raw_data The data to be sent.
* @param data_len The length of the data.
* @param addr Destination address.
* @param addr_len Length of destination address.
* @param token Arbitrary token to be returned back to callback.
* @param cb Optional callback to be called to notify caller about
* the completion status of the pending send operation.
*
* @return If the message has been sent successfully, this function
* will return PJ_SUCCESS and the callback will not be
* called. If message cannot be sent immediately, this
* function will return PJ_EPENDING, and application will
* be notified later about the completion via the callback.
* Any statuses other than PJ_SUCCESS or PJ_EPENDING
* indicates immediate failure, and in this case the
* callback will not be called.
*/
PJ_DECL(pj_status_t) pjsip_tpmgr_send_raw(pjsip_tpmgr *mgr,
pjsip_transport_type_e tp_type,
const pjsip_tpselector *sel,
pjsip_tx_data *tdata,
const void *raw_data,
pj_size_t data_len,
const pj_sockaddr_t *addr,
int addr_len,
void *token,
pjsip_tp_send_callback cb);
/**
* Enumeration of transport state types.
*/
typedef enum pjsip_transport_state
{
PJSIP_TP_STATE_CONNECTED, /**< Transport connected, applicable only
to connection-oriented transports
such as TCP and TLS. */
PJSIP_TP_STATE_DISCONNECTED, /**< Transport disconnected, applicable
only to connection-oriented
transports such as TCP and TLS. */
PJSIP_TP_STATE_SHUTDOWN, /**< Transport shutdown, either
due to TCP/TLS disconnect error
from the network, or when shutdown
is initiated by PJSIP itself. */
PJSIP_TP_STATE_DESTROY, /**< Transport destroy, when transport
is about to be destroyed. */
} pjsip_transport_state;
/**
* Definition of transport state listener key.
*/
typedef void pjsip_tp_state_listener_key;
/**
* Structure of transport state info passed by #pjsip_tp_state_callback.
*/
typedef struct pjsip_transport_state_info {
/**
* The last error code related to the transport state.
*/
pj_status_t status;
/**
* Optional extended info, the content is specific for each transport type.
*/
void *ext_info;
/**
* Optional user data. In global transport state notification, this will
* always be NULL.
*/
void *user_data;
} pjsip_transport_state_info;
/**
* Type of callback to receive transport state notifications, such as
* transport connected/disconnected. Application may shutdown the transport
* in this callback.
*
* @param tp The transport instance.
* @param state The transport state.
* @param info The transport state info.
*/
typedef void (*pjsip_tp_state_callback)(
pjsip_transport *tp,
pjsip_transport_state state,
const pjsip_transport_state_info *info);
/**
* Set callback of global transport state notification. The caller will be
* notified whenever the state of any transport is changed. The type of events
* are defined in #pjsip_transport_state.
*
* Note that this function will override the existing callback, if any, so
* application is recommended to keep the old callback and manually forward
* the notification to the old callback, otherwise other component that
* concerns about the transport state will no longer receive transport state
* events.
*
* @param mgr Transport manager.
* @param cb Callback to be called to notify caller about transport
* state changing.
*
* @return PJ_SUCCESS on success, or the appropriate error code.
*/
PJ_DECL(pj_status_t) pjsip_tpmgr_set_state_cb(pjsip_tpmgr *mgr,
pjsip_tp_state_callback cb);
/**
* Get the callback of global transport state notification.
*
* @param mgr Transport manager.
*
* @return The transport state callback or NULL if it is not set.
*/
PJ_DECL(pjsip_tp_state_callback) pjsip_tpmgr_get_state_cb(
const pjsip_tpmgr *mgr);
/**
* Add a listener to the specified transport for transport state notification.
*
* @param tp The transport.
* @param cb Callback to be called to notify listener about transport
* state changing.
* @param user_data The user data.
* @param key Output key, used to remove this listener.
*
* @return PJ_SUCCESS on success, or the appropriate error code.
*/
PJ_DECL(pj_status_t) pjsip_transport_add_state_listener (
pjsip_transport *tp,
pjsip_tp_state_callback cb,
void *user_data,
pjsip_tp_state_listener_key **key);
/**
* Remove a listener from the specified transport for transport state
* notification.
*
* @param tp The transport.
* @param key The listener key.
* @param user_data The user data, for validation purpose.
*
* @return PJ_SUCCESS on success, or the appropriate error code.
*/
PJ_DECL(pj_status_t) pjsip_transport_remove_state_listener (
pjsip_transport *tp,
pjsip_tp_state_listener_key *key,
const void *user_data);
/**
* Structure of dropped received data.
*/
typedef struct pjsip_tp_dropped_data
{
/**
* The transport receiving the data.
*/
pjsip_transport *tp;
/**
* The data.
*/
void *data;
/**
* The data length.
* If the status field below indicates an invalid SIP message
* (PJSIP_EINVALIDMSG) and application detects a SIP message
* at position p, it can pass the data back to PJSIP to be processed
* by setting the len to p. This can be useful for apps which
* wishes to use the same transport for SIP signalling and non-SIP
* purposes (such as SIP outbound using STUN message).
*/
pj_size_t len;
/**
* The status or reason of drop. For example, a leading newlines (common
* keep-alive packet) will be dropped with status PJ_EIGNORED, an invalid
* SIP message will have status PJSIP_EINVALIDMSG, a SIP message overflow
* will have status PJSIP_ERXOVERFLOW.
*/
pj_status_t status;
} pjsip_tp_dropped_data;
/**
* Type of callback to data dropping notifications.
*
* @param data The dropped data.
*/
typedef void (*pjsip_tp_on_rx_dropped_cb)(pjsip_tp_dropped_data *data);
/**
* Set callback of data dropping. The caller will be notified whenever any
* received data is dropped (due to leading newlines or keep-alive packet or
* invalid SIP message). This callback can be useful for application,
* for example, to implement custom keep-alive mechanism or connection
* availability detection.
*
* @param mgr Transport manager.
* @param cb The callback function, set to NULL to reset the callback.
*
* @return PJ_SUCCESS on success, or the appropriate error code.
*/
PJ_DECL(pj_status_t) pjsip_tpmgr_set_drop_data_cb(pjsip_tpmgr *mgr,
pjsip_tp_on_rx_dropped_cb cb);
/**
* Structure of received data that will be passed to data received
* notification callback.
*/
typedef struct pjsip_tp_rx_data
{
/**
* The transport receiving the data.
*/
pjsip_transport *tp;
/**
* The data.
*/
void *data;
/**
* The data length.
* If application wishes to discard some data of len p, it can pass
* the remaining data back to PJSIP to be processed by setting the len
* to (len - p).
* If application wants to shutdown the transport from within the
* callback (for example after if finds out that the data is
* suspicious/garbage), app must set the len to zero to prevent
* further processing of the data.
*/
pj_size_t len;
} pjsip_tp_rx_data;
/**
* Type of callback to data received notifications.
*
* @param data The received data.
*/
typedef pj_status_t (*pjsip_tp_on_rx_data_cb)(pjsip_tp_rx_data *data);
/**
* Set callback to be called whenever any data is received by a stream
* oriented transport. This can be useful for application to do its own
* verification, filtering, or logging of potential malicious activities.
*
* @param mgr Transport manager.
* @param cb The callback function, set to NULL to reset the callback.
*
* @return PJ_SUCCESS on success, or the appropriate error code.
*/
PJ_DECL(pj_status_t) pjsip_tpmgr_set_recv_data_cb(pjsip_tpmgr *mgr,
pjsip_tp_on_rx_data_cb cb);
/**
* @}
*/
PJ_END_DECL
#endif /* __PJSIP_SIP_TRANSPORT_H__ */
``` |
This is a list of species in the agaric genus Tricholoma. , Index Fungorum lists 379 species in the genus.
A B C D E F G H I J K L M N O P Q R S T U V U W X Y Z
A
Tricholoma abietinum Velen. 1920 – Europe
Tricholoma acerbum (Bull.) Quél. 1872
Tricholoma acicularum Velen. 1947
Tricholoma acutistramineum Corner 1994 – Singapore
Tricholoma aeruginascens Corner 1994
Tricholoma aestivum Velen. 1920 – Europe
Tricholoma aestuans (Fr.) Gillet 1874
Tricholoma albatum Velen. 1920 – Europe
Tricholoma albidulum N.Ayala, G.Moreno & Esteve-Rav. 1997
Tricholoma albidum Bon 1984
Tricholoma albobrunneum (Pers.) P.Kumm. 1871
Tricholoma alboconicum (J.E.Lange) Clémençon 1983
Tricholoma alboluteum Velen. 1920 – Europe
Tricholoma albosquamulatum Beeli 1927
Tricholoma album (Schaeff.) P.Kumm. 1871
Tricholoma altaicum Singer 1943
Tricholoma amplum (Pers.) Rea 1922
Tricholoma anatolicum H.H. Doğan & Intini, 2015
Tricholoma andinum E. Horak 1964
Tricholoma apium Jul. Schäff. 1925
Tricholoma argenteum Ovrebo 1989
Tricholoma argyraceum (Bull.) Gillet 1874
Tricholoma argyropotamicum Speg. 1899
Tricholoma arvernense Bon 1976 – Europe
Tricholoma atro-olivaceum Rick 1939
Tricholoma atrodiscum Ovrebo 1989
Tricholoma atroscriptum Corner 1994
Tricholoma atrosquamosum Sacc. 1887
Tricholoma atroviolaceum A.H.Sm. 1944 – North America
Tricholoma aurantiipes Hongo 1991
Tricholoma aurantio-olivaceum A.H.Sm. 1944 – North America
Tricholoma aurantium (Schaeff.) Ricken 1914
Tricholoma austrocolossum Grgur. 2002
Tricholoma azalearum (Murrill) Murrill 1942
B
Tricholoma bakamatsutake Hongo 1974
Tricholoma baldratianum Sacc. 1916
Tricholoma bambusarum Corner 1994
Tricholoma basirubens (Bon) A.Riva & Bon 1988
Tricholoma batschii Gulden 1969
Tricholoma betilonganum Corner 1994
Tricholoma bezdeki Velen. 1920 – Europe
Tricholoma bisontinum Rolland 1902
Tricholoma bonii Basso & Candusso 1997
Tricholoma boreosulphurescens Mort. Chr. & Heilm.-Claus., 2017
Tricholoma borgsjoeënse Jacobsson & Muskos 2006 – Fennoscandia
Tricholoma borneomurinum Corner 1994
Tricholoma bresadolanum Clémençon 1977
Tricholoma brunneicirrus Corner 1994
Tricholoma brunneosquamosa Beeli 1927
Tricholoma bryogenum Mort. Chr., Heilm.-Claus. & Vauras, 2017
Tricholoma bubalinum (G.Stev.) E.Horak 1971
Tricholoma bufonium (Pers.) Gillet 1874
Tricholoma bulliardii Velen. 1939 – Europe
Tricholoma busuense Corner 1994
Tricholoma buzae Dennis 1970
C
Tricholoma caligatum (Viv.) Ricken 1914
Tricholoma carbonicum Velen. 1920 – Europe
Tricholoma carneoflavidum (Kalchbr.) McAlpine 1895
Tricholoma cartilagineum (Bull.) Quél. 1872
Tricholoma catulus E.H.L.Krause 1928
Tricholoma cavipes Corner 1994
Tricholoma cedretorum (Bon) A.Riva 2000
Tricholoma cedrorum Maire 1914
Tricholoma ceriniceps Pegler 1983
Tricholoma cheilolaminum Ovrebo & Tylutki 1975
Tricholoma chrysophyllum A.Riva, C.E.Hermos. & Jul.Sánchez 1998
Tricholoma cifuentesii Courtec. 1985
Tricholoma cingulatum (Almfelt ex Fr.) Jacobashch 1890
Tricholoma cinnamomeum (Murrill) Murrill 1914
Tricholoma clavipes Riedl 1976
Tricholoma clavocystis Musumeci & Contu 2008 – Europe
Tricholoma coffeaceum Velen. 1920 – Europe
Tricholoma collybiiformis Velen. 1920 – Europe
Tricholoma colossus (Fr.) Quél. 1872
Tricholoma columbetta (Fr.) P.Kumm. 1871
Tricholoma concolor (Delile ex De Seynes) P.-A.Moreau, Bellanger & Courtec. 2011
Tricholoma confragipes Iwade 1944
Tricholoma cookeanum Bertault & Malençon 1975
Tricholoma cordae Velen. 1920 – Europe
Tricholoma cortinatellum Singer 1954
Tricholoma cortinatum Singer 1952
Tricholoma crenulatum Horniček 1977
Tricholoma crepidotoides Corner 1994
Tricholoma crucigerum (St.-Amans) Sacc. & Trotter 191
Tricholoma cuneifoloides (Fr.) P.Kumm. 1871
Tricholoma cutifractum Corner 1994
Tricholoma cyclophilum (Lasch) Sacc. & Trotter 1912
Tricholoma czuicum (Singer) Singer, 1951
D
Tricholoma dermolomoides Corner 1994
Tricholoma diabolicum Rick 1926
Tricholoma diemii Singer 1954
Tricholoma distantifoliaceum E.Ludw. & H.Willer 2012
Tricholoma distinguendum S.Lundell 1942
Tricholoma dulciolens Kytöv. 1989
Tricholoma duriusculum R.Schulz 1927
Tricholoma durum Velen. 1939 – Europe
E
Tricholoma edentulum Velen. 1920 – Europe
Tricholoma elegans G.Stev. 1964 – New Zealand
Tricholoma elvirae Singer 1969
Tricholoma eosinobasis Babos, Bohus & Vasas 1991
Tricholoma equestre (L.) P.Kumm. 1871
Tricholoma evenosum (Sacc.) Rea 1932
Tricholoma ezcarayense C.E.Hermos. & Jul.Sánchez 1994
F
Tricholoma fagineum Velen. 1925
Tricholoma fagnani Singer 1952
Tricholoma farinolens E.Horak 1964
Tricholoma ferrugineimelleum Corner 1994
Tricholoma fiherensis L.M.Dufour & H.Poiss. 1927
Tricholoma filamentosum (Alessio) Alessio 1988
Tricholoma fissilifolium Corner 1994
Tricholoma flammulaecolor Beeli 1927
Tricholoma flavifolium Velen. 1920 – Europe
Tricholoma focale (Fr.) Ricken 1914
Tricholoma foliicola Har.Takah. 2001
Tricholoma forteflavescens Reschke, Popa, Zhu L. Yang & G. Kost, 2018
Tricholoma fracticum (Britzelm.) Kreisel 1984
Tricholoma fractipes Velen. 1920 – Europe
Tricholoma frondosae Kalamees & Shchukin 2001
Tricholoma fuegianum Courtec. 1985
Tricholoma fuliginea Beeli 1927
Tricholoma fulvimarginatum Ovrebo & Halling 1986
Tricholoma fulvocastaneum Hongo 1960
Tricholoma fulvum (DC.) Bigeard & H.Guill. 1909
Tricholoma fumidellum (Peck) Sacc. 1887
Tricholoma furcatifolium Corner 1994
Tricholoma fuscinanum Corner 1994
Tricholoma fusipes E.Horak 1964
Tricholoma fusisporum Singer 1943
G
Tricholoma gallaecicum (Blanco-Dios) Blanco-Dios, 2009
Tricholoma gausapatum (Fr.) Quél. 1872
Tricholoma glareosum Velen. 1927
Tricholoma glatfelteri (Murrill) Murrill 1914
Tricholoma goliath (Fr.) S.Lundell & Nannf. 1942
Tricholoma goossensiae Beeli 1933
Tricholoma graminicola Velen. 1920 – Europe
Tricholoma grande Peck 1891
Tricholoma granulosum Lebedeva 1949
Tricholoma griseipileatum Corner 1994
Tricholoma griseoviolaceum Shanks 1996 – United States
Tricholoma groanense Viola 1959
Tricholoma grossulariodorum E.Horak 1964
Tricholoma guldeniae Mort.Chr. 2009
H
Tricholoma hathorae Velen. 1939 – Europe
Tricholoma hebeloma (Peck) Sacc. 1887
Tricholoma hebelomoides E.Horak 1964
Tricholoma hemisulphureum (Kühner) A. Riva ex Boffelli, 2016
Tricholoma henningsii Sacc. & Trotter 1912
Tricholoma hirtellum Peck 1907
Tricholoma holici Velen. 1920 – Europe
Tricholoma horakii Raithelh. 1972
Tricholoma hortorum Velen. 1925
Tricholoma humosum (Quél.) S.Imai 1938
Tricholoma huronense A.H. Sm., 1942
Tricholoma hygrophanum Velen. 1939 – Europe
I
Tricholoma ilkkae Mort. Chr., Heilm.-Claus., Ryman & N. Bergius, 2017
Tricholoma imbricatum (Fr.) P.Kumm. 1871
Tricholoma impudicum Velen. 1947
Tricholoma inamoenum (Fr.) Gillet 1874
Tricholoma inocyboides Corner 1994
Tricholoma insigne Ovrebo 1989
Tricholoma intermedium Peck 1888
Tricholoma iputingaense Bat. & A.F.Vital 1958
J
Tricholoma jalapense (Murrill) Sacc. & Trotter 1925
Tricholoma jamaicensis (Murrill) Sacc. & Trotter 1925
Tricholoma joachimii Bon & A.Riva 1985
Tricholoma josserandii Bon 1975
K
Tricholoma khakicolor Corner 1994
L
Tricholoma laricicola Velen. 1939 – Europe
Tricholoma lascivum (Fr.) Gillet 1874
Tricholoma latifolium Speg. 1898
Tricholoma lavendulophyllum F.Q.Yu 2006
Tricholoma leoninum Velen. 1939 – Europe
Tricholoma leucophyllum Ovrebo & Tylutki 1975
Tricholoma leucoterreum Mariotto & Turetta 1996
Tricholoma lilacinocinereum Métrod ex Bon 1990
Tricholoma lobatum Velen. 1939 – Europe
Tricholoma losii Kavina 1926
Tricholoma luridum (Schaeff.) P.Kumm. 1871
Tricholoma luteomaculosum A.H. Sm., 1942
M
Tricholoma maculatipus Hongo 1962
Tricholoma magellanicum (Speg.) Sacc. 1891
Tricholoma magnivelare (Peck) Redhead 1984
Tricholoma manzanitae T.J.Baroni & Ovrebo 1983
Tricholoma marasmiforme Velen. 1939 – Europe
Tricholoma margarita (Murrill) Murrill 1940
Tricholoma marquettense Ovrebo 1986
Tricholoma matsutake (S.Ito & S.Imai) Singer 1943
Tricholoma mauritianum Peerally & Sutra 1973
Tricholoma megaphyllum Boud. 1910
Tricholoma melleum Reschke, Popa, Zhu L. Yang & G. Kost, 2018
Tricholoma mensula Corner 1994
Tricholoma meridianum A.Pearson 1950
Tricholoma mesoamericanum Justo & Cifuentes, 2017
Tricholoma michiganense A.H. Sm., 1942
Tricholoma microcarpoides Corner 1994
Tricholoma minutissimum Corner 1994
Tricholoma minutum Corner 1994
Tricholoma mnichovicense Velen. 1947
Tricholoma montis-fraseri Corner 1994
Tricholoma moseri Singer 1989
Tricholoma moserianum Bon 1990
Tricholoma mostnyae Singer 1969
Tricholoma multifolium (Murrill) Murrill 1914
Tricholoma multipunctum (Peck) Sacc. 1887
Tricholoma muricatum Shanks 1996 – United States
Tricholoma murrillianum Singer 1942 – North America
Tricholoma muscarioides Reschke, Popa, Zhu L. Yang & G. Kost, 2018
Tricholoma muscarium Kawam. ex Hongo 1959
Tricholoma muscorum Velen. 1947
Tricholoma mutabile Shanks 1996 – United States
N
Tricholoma naranjanum Dennis 1951
Tricholoma nigripes Velen. 1920 – Europe
Tricholoma nigrum Shanks & Ovrebo 1996 – North America
Tricholoma nobile Peck 1889
O
Tricholoma oblongisporum Bissett 1992
Tricholoma obscurum Velen. 1920 – Europe
Tricholoma ochraceorobustum E.Horak 1964
Tricholoma odorimutabile Corner 1994
Tricholoma olens Velen. 1939 – Europe
Tricholoma olgae Velen. 1920 – Europe
Tricholoma olidum Velen. 1920 – Europe
Tricholoma olivaceobrunneum Ovrebo 1986
Tricholoma olivaceoflavum (Murrill) Sacc. & Trotter 1925
Tricholoma olivaceoluteolum Reschke, Popa, Zhu L. Yang & G. Kost, 2018
Tricholoma olivaceotinctum Heilm.-Claus. & Mort. Chr. 2009
Tricholoma olivaceum Reschke, Popa, Zhu L. Yang & G. Kost, 2018
Tricholoma oliveum Farl. & Burt, 1929
Tricholoma opiparum (Fr.) Bigeard & H. Guill. 1909
Tricholoma orirubens Quél. 1872
Tricholoma orlosii Pilát 1950
P
Tricholoma palustre A.H.Sm. 1942
Tricholoma pampeanum Speg. 1898
Tricholoma panicolor Corner 1994
Tricholoma pannonicum Bohus, 1960
Tricholoma pardalotum Herink & Kotl. 1967
Tricholoma pardinum (Pers.) Quél. 1873
Tricholoma parvisporum Corner 1994
Tricholoma pascuum Velen. 1939 – Europe
Tricholoma patagonicum Singer 1954
Tricholoma penangense Corner 1994
Tricholoma permelleum Corner 1994
Tricholoma persicinum (Fr.) Quél. 1872
Tricholoma pessundatum (Fr.) Quél. 1872
Tricholoma phoeniceum (Sacc.) Singer 1943
Tricholoma piceum Velen. 1947
Tricholoma pilatii Velen. 1925
Tricholoma plagiotum (Kalchbr.) McAlpine 1895
Tricholoma populinum J.E.Lange 1933
Tricholoma porta-dalveyi Corner 1994
Tricholoma portentosum (Fr.) Quél. 1873
Tricholoma praetervisum Velen. 1939 – Europe
Tricholoma pratense Pegler & R.W.Rayner 1969
Tricholoma preslii Velen. 1920 – Europe
Tricholoma primulibrunneum Corner 1994
Tricholoma psammopus (Kalchbr.) Quél. 1875
Tricholoma pseudoargyraceum Velen. 1925
Tricholoma pseudoimbricatum J.E.Lange & Terk. 1944
Tricholoma pseudolimacium Velen. 1920 – Europe
Tricholoma pseudonictitans Bon 1983
Tricholoma pseudoputidum Velen. 1939 – Europe
Tricholoma pseudorussula (Speg.) Sacc. 1891
Tricholoma pseudosaponaceum Hásek 1959
Tricholoma pullum Ovrebo 1989
Tricholoma pulverulentipes (Murrill) Sacc. & Trotter 1925
Tricholoma purpureiflavum Corner 1994
Tricholoma pusillisporum Speg. 1922
Tricholoma pygmaeum Velen. 1920 – Europe
Q
Tricholoma quercetorum Contu 2004
Tricholoma quercicola (Murrill) Murrill 1949
R
Tricholoma radicans Hongo 1968 – Japan
Tricholoma radotinense Peck 1903
Tricholoma ramentaceum (Bull.) Ricken 1915
Tricholoma rauli Garrido 1988
Tricholoma rhizophoreti Corner 1994
Tricholoma rigidovelatum Raithelh. 1991
Tricholoma rimosoides Dennis 1951
Tricholoma robiniae Velen. 1925
Tricholoma robustum (Alb. & Schwein.) Ricken 1915
Tricholoma romagnesii Singer 1943
Tricholoma roseoacerbum A.Riva 1984 – Europe, North America
Tricholoma rostratum Velen. 1920 – Europe
Tricholoma rubescens Velen. 1920 – Europe
Tricholoma rufenum P.Donati 1994
Tricholoma rufulum R.Heim 1934
Tricholoma rugulicinctum Corner 1994
S
Tricholoma sanguinescens Velen. 1925
Tricholoma saponaceum (Fr.) P.Kumm. 1871
Tricholoma scabrum L.M.Dufour 1913
Tricholoma scalpturatum (Fr.) Quél. 1872
Tricholoma schustleri Velen. 1920 – Europe
Tricholoma sciodes (Pers.) C.Martín 1919
Tricholoma sejunctum (Sowerby) Quél. 1872
Tricholoma sericeum Rick 1920
Tricholoma sienna (Peck) Sacc. 1887
Tricholoma silvaticum Peck 1889
Tricholoma singaporense Corner 1994
Tricholoma sinoacerbum T.H. Li, Hosen & Ting Li, 2015
Tricholoma sinopardinum Zhu L. Yang, X.X. Ding, G. Kost & Rexer, 2017
Tricholoma sinoportentosum Zhu L. Yang, Reschke, Popa & G. Kost, 2018
Tricholoma smithii Ovrebo & K.W. Hughes, 2018
Tricholoma solitarium (Alessio) Contu 2009
Tricholoma sparsifolium Velen. 1925
Tricholoma sphagnicola Hruby 1930
Tricholoma spongiosum Petch 1917
Tricholoma stanekii Pilát 1953
Tricholoma stans (Fr.) Sacc. 1887
Tricholoma stiparophyllum (N.Lund) P.Karst. 1879
Tricholoma stipitirufescens Corner 1994
Tricholoma striatifolium (Peck) Sacc. 1887
Tricholoma striatum (Schaeff.) Quél. 1872
Tricholoma subamarum Herp. 1912
Tricholoma subannulatum (Peck) Zeller 1922
Tricholoma subargillaceum (Murrill) Sacc. & Trotter 1925
Tricholoma subaureum Ovrebo 1986
Tricholoma subcinerascens Rick 1939
Tricholoma subcinereiforme (Murrill) Sacc. & Trotter 1925
Tricholoma subclytocybe Velen. 1925
Tricholoma subcuneifolium Corner 1994
Tricholoma subfuscum Velen. 1920 – Europe
Tricholoma subglobisporum Bon 1976 – Europe
Tricholoma subimbricatum Velen. 1920 – Europe
Tricholoma sublatum Murrill 1942
Tricholoma subluteum Peck, 1904
Tricholoma subniveum Velen. 1925
Tricholoma subresplendens (Murrill) Murrill, 1914
Tricholoma subsulphureum (Britzelm.) Sacc. & Traverso 1911
Tricholoma subumbrinum A.H.Sm. 1944 – North America
Tricholoma sudum (Fr.) Quél. 1873
Tricholoma sulcatum Velen. 1920 – Europe
Tricholoma sulphurellum Rick 1919
Tricholoma sulphurescens Bres. 1905
Tricholoma sulphureum (Bull.) P.Kumm. 1871
T
Tricholoma tanzanianum Pegler 1977
Tricholoma tenacifolium Corner 1994
Tricholoma tenue P.W.Graff 1914
Tricholoma terreum (Schaeff.) P.Kumm. 1871
Tricholoma testaceum G.Stev. 1964 – New Zealand
Tricholoma thalliophilum Rob.Henry 1956
Tricholoma tigrinum (Schaeff.) Gillet 1874
Tricholoma transmutans (Peck) Sacc., 1887
Tricholoma tridentinum Singer 1943
Tricholoma triste (Scop.) Quél. 1872
Tricholoma tristiforme Kauffman 1921
Tricholoma tucumanense Speg. 1919
Tricholoma tumidum (Pers.) Ricken 1915
Tricholoma turbinipes (Kalchbr.) McAlpine 1895
U
Tricholoma uliginosum Velen. 1920 – Europe
Tricholoma ulvinenii Kalamees 2001
Tricholoma umbonatum Clémençon & Bon 1985
Tricholoma umbraticum Corner 1994
Tricholoma unifactum Peck 1906
Tricholoma urbicum Ferrarese & Zaffalon 2008
Tricholoma uropus Corner 1994
Tricholoma ustale (Fr.) P.Kumm. 1871
Tricholoma ustaloides Romagn. 1954
V
Tricholoma vaccinoides Pilát 1971
Tricholoma vaccinum (Schaeff.) P.Kumm. 1871
Tricholoma vacini Velen. 1939 – Europe
Tricholoma venenatum G.F. Atk., 1908
Tricholoma vernale Velen. 1920 – Europe
Tricholoma vernaticum Shanks 1996 – United States
Tricholoma versicolor Velen. 1920 – Europe
Tricholoma vestipes Velen. 1920 – Europe
Tricholoma villosiparvum Corner 1994
Tricholoma vinaceogriseum P.D.Orton 1987
Tricholoma violaceibrunneum Corner 1994
Tricholoma virgatum (Fr.) P.Kumm. 1871
Tricholoma viridifucatum Bon 1976 – Europe
Tricholoma viridilutescens M.M.Moser 1978
Tricholoma viridiolivaceum G.Stev. 1964 – New Zealand
W
Tricholoma weizianum Reichert & Aviz.-Hersh. 1959
Z
Tricholoma zangii Z.M.Cao, Y.J.Yao & Pegler 2003 – China
Tricholoma zelleri (D.E.Stuntz & A.H.Sm.) Ovrebo & Tylutki 1975
Tricholoma zonatum Velen. 1939 – Europe
Tricholoma zvarae Velen. 1922
References
General references
Tricholoma |
William Henry Hodgkins (June 9, 1840 – September 24, 1905) was an American politician who served in the Massachusetts State Senate, as a member and President of the Somerville, Massachusetts, Common Council and as the eighth Mayor of Somerville, Massachusetts.
See also
119th Massachusetts General Court (1898)
Notes
External links
1840 births
1905 deaths
Republican Party Massachusetts state senators
People of Massachusetts in the American Civil War
Mayors of Somerville, Massachusetts
Massachusetts city council members
19th-century American politicians |
Queen Seondeok () is a 2009 South Korean historical drama produced by MBC and Time Box Production for the former's 48th founding anniversary, starring Lee Yo-won, Go Hyun-jung, Uhm Tae-woong, Kim Nam-gil, and Park Ye-jin. It chronicles the life of Queen Seondeok of Silla. It aired on MBC from 25 May to 22 December 2009 on Mondays and Tuesdays at 21:55 for 62 episodes.
The viewership ratings for the show topped TV charts almost every week during its run, peaking at 43.6 percent. It swept the 2009 MBC Drama Awards; actress Go Hyun-jung's performance and subsequent grand prize win received near-universal acclaim.
Synopsis
The series begins at the end of King Jinheung's reign and continues until the end of Queen Seondeok's reign. Deokman was born as one of the twin daughters of King Jinpyeong and Queen Maya, but due to a prophecy, King Jinpyeong had to send his daughter away from the palace with the help of his clumsy but loyal servant Seohwa, in order to save Queen Maya from being ousted by Mishil, whose ambition was to become Queen. Seohwa raised Deokman as if she were her own, but a turn of events eventually led Deokman into finding out her real identity - only to be abandoned once again by her family in order to save the throne from Mishil's hand, with the exception of her twin sister Cheonmyeon, who ended up losing her life while trying to help Deokman escape. Out of hatred, Deokman set out to take back what was taken from her and avenge her sister by bringing Mishil down and becoming the first female king of Silla with the help of her trusted friend, Yushin, and troubled rogue Bidam who she loved, and ultimately led a rebellion near the end of her reign because of a misunderstanding.
Cast
Main
Lee Yo-won as Princess Deokman, later Queen Seondeok
Nam Ji-hyun as young Deokman
A charismatic, yet solitary ruler: She was known as the first female ruler in Korean history. Deokman was born as the twin sister of Princess Cheonmyong and had a close brush with death as a baby due to the attempted assassination by Mi-shil, who had ambitions for the throne. A loyal servant named So-hwa rescued her by fleeing the kingdom with her. She loves to be around people, but after becoming a queen, she lost the liberty to trust them as sincerely and innocently as she once did. As ruling queen, she is deeply lonely and filled with despair. Yet she must hide her true feelings and stand on her own to be reborn as a true king.
Go Hyun-jung as Lady Mishil
Uee as young Mishil
Archenemy of Queen Seondeok: A Royal concubine who will stop at nothing in order to achieve her dream of becoming a Queen. She rose to power as a result of her relationships with prominent rulers and officials. She was concubine to three successive Silla kings: King Jinheung, King Jinji, and King Jinpyeong. She was the wife of Lord Sejong (the prime minister), the lover of General Seolwon and the mother of Bidam.
Park Ye-jin as Princess Cheonmyeong
Shin Se-kyung as young Cheonmyeong
Kim Yoo-jung as 10-year-old Cheonmyeong
Princess Cheonmyeong was Princess Deokman's twin sister, as the firstborn daughter, King Jinpyeong choose her to stay in the palace in the belief that she was the destined child who will bring Mishil down someday. She grew up fearing Mishil which led to her living a life out of politics. She fell in love and married King Jinji's son Kim Yongsu but one day, Kim Yongsu was nominated as a possible candidate for the throne but had to prove himself worthy of it which in the end caused him his death. Believing that Mishil had her hand on his death, she set out gathering allies in order to bring Mishil down one day. She was the first person to find out about Deokman's real identity and did everything she can in order to help her sister which costs her life.
Uhm Tae-woong as Kim Yushin
Lee Hyun-woo as young Kim Yushin
The invincible warrior forever remembered by history: With a grand vision of unifying the three kingdoms under Silla's rule, he aligns himself with Princess Deokman who puts her complete trust on him. He became an invincible warrior, admired by all in the capital. He earns a well-deserved place in history, the very thing that Bidam desires.
Kim Nam-gil as Bidam
Park Ji-bin as young Bidam
The glorious downfall of a tragic hero: Bidam inherits the life of Mishil, and their story comes to an end. The tragedy of his mother's life comes full circle and he becomes the wretched hero of the same fate. Ultimately he gains nothing he desires - not a place in history, Silla nor Deokman - and ends up forgotten by history, recorded only as the instigator of a mutiny. He is loved then hated, he gains power only to lose it, he earns the trust of people and then loses that trust. He will crash and burn, and his end will be tragic and glorious.
Supporting
Yoo Seung-ho as Kim Chunchu (later King Taejong Muyeol)
Jung Yoon-seok as young Kim Chunchu
Ruler of the next age and ruler of the Three Kingdoms: This series began with Misil's age, continues through Deokman's age and will end at the start of Chunchu's age. This precocious genius will find his own footing alongside Deokman, Yusin, and Bidam, and gain power in his own way. Ultimately he will be the one to uphold the dream that began with the late King Jijeung and unify the Three Kingdoms.
Lee Seung-hyo as Kim Alcheon
Ho Hyo-hoon as young Kim Alcheon
He is most well known as Deokman's staunch supporter and bodyguard. He was initially cold and looked down on Kim Yushin and the Yonghwa Hyangdo. Deokman earns his respect during the war with Baekje, and then his loyalty later on. He is Yushin's war comrade and close friend. Along with Yushin, he is with Deokman until her final days.
Jung Ho-bin as Gukseon Munno
The 8th leader of Hwarang warriors and the Gukseon. Along with Mishil, Seolwon, and Sadaham, they were the people who King Jinheung trusted the most during his era. He helps rescue young Princess Deokman from the palace to protect the royal house. He also took care of Bidam, per the request of King Jinji. He is later killed by Yeomjeong while compiling the Geographical Survey of the Three Kingdoms after Yeomjeong learns that he planned to give the books to Yushin.
Jo Min-ki as King Jinpyeong
Baek Jong-min as young Jinpyeong
Kang San as child Jinpyeong
Deokman and Cheonmyeong's father. He was a weak king. He was placed on the throne after Mishil dethroned King Jinji.
Yoon Yoo-sun as Queen Maya
Park Soo-jin as young Maya
King Jinpyeong's wife, mother of Deokman and Cheonmyeong. She is extremely devoted to her husband. In her early days, Mishil tried to murder Maya after Maya witnessed the Hwarang putting makeup on their faces. Mishil then tried to take Maya's place as queen, however, Munno saved Maya, and her twins, from falling to her death.
Seo Young-hee as Sohwa
Maidservant to Jinpyeong and Maya, foster mother of Deokman. She brought Deokman to the desert and raised her there until Chilsuk found them. She "died" once in the desert trying to save Deokman. She dies a second time in an attempt to protect Deokman also.
Im Ye-jin as Lady Manmyeong
Jinpyeong's older sister; Kim Yushin's mother, and Kim Seohyeon's wife. She had eloped with Kim Seohyeon in her younger days. Her princess status was not restored until the Queen Mother had forgiven her.
Jung Sung-mo as Kim Seo-hyun
Manmyeong's husband; Kim Yushin's father. He is of Gaya descent and on the hwabaek council.
Park Jung-chul as Kim Yong-su
King Jinji's eldest son; Princess Cheonmyeong's husband. He was originally named heir after Princess Cheonmyeong's three younger siblings die (because of the prophecy), and he goes out to war to prove himself. However, he is killed because of Mishil.
In Gyo-jin as Kim Yong-chun
King Jinji's 2nd son, a government minister; Princess Cheonmyeong's ally and confidante. He was a pungwolju (prior to Hojae) and later served on the hwabaek council. He remains loyal to the royal house and becomes Deokman's ally later on.
Shin Goo as Eulje
Senior government minister, friend to King Jinpyeong. He does everything he can to protect the royal house, even if it meant trying to kill Deokman. He is later stripped of his titles by King Jinpyeong.
Jung Woong-in as Misaeng
Mishil's younger brother; the 10th leader of Hwarang warriors. He was also a father to over 100 children.
Dokgo Young-jae as Sejong
Mishil's husband, the Prime Minister and 6th leader of Hwarang warriors
Jeon No-min as Seolwon
Mishil's lover, the Minister of Defense and 7th leader of Hwarang warriors.
Kim Jung-hyun as Hajong
Mishil and Sejong's son, a government minister and the 11th leader of Hwarang warriors
Baek Do-bin as Bojong
Kwak Jung-wook as young Bojong
Mishil and Seolwon's son, a Hwarang commander
Song Ok-sook as Seori
Chief mudang of Shilla, an old friend of Mishil and Misaeng
Ahn Gil-kang as Chilsook
Formerly a Hwarang, agent of Mishil. He was given the task to find the lost twin. 15 years later, he found Deokman in the desert.
Lee Moon-sik as Jookbang
A con artist who rips off the young Deokman and later joins Yu Shin's Hwarang
Ryu Dam as Godo
A con artist who rips off the young Deokman and later joins Yu Shin's Hwarang)
Kang Sung-pil as Santak
Seokpum's, and later Bidam's, aide-de-camp
Joo Sang-wook as Wolya
Last prince of Gaya and the leader of the Bokya. He was adopted by Kim Seohyeon, and then replaced Yushin as Yonghwa Hyangdo's leader. Yushin earns Wolya's loyalty after letting the Gaya refugees stay on the Kim family's private land.
Jung Ho-keun as Seolji
Kayan commander; he is loyal to Wolya.
Choi Won-young as General Gyebaek
Jun Young-bin as Gok Sa-heun
Jung Hyung-min as young Gok Sa-heun
Park Young-seo as Daepung
Lee Suk-min as young Daepung
Go Yoon-hoo as Hojae
The 14th leader of Hwarang warriors (pungwolju), later a council member of the hwabaek.
Hong Kyung-in as Seokpum
Noh Young-hak as young Seokpum
Commander of a Hwarang loyal to Misil. He comes from a poor family, but Misil gives him his elevated status--this is why he is so loyal to Misil.
Kang Ji-hoo as Imjong
Kim Seok as young Imjong
Commander of a Hwarang loyal to Kim Yong-choon
Seo Dong-won as Deokchung
Lee Do-hyun as young Deokchung
Jang Hee-woong as Bakui
Seo Sang-won as young Bakui
Lee Sang-hyun as Piltan
Kim Tae-jin as young Piltan
Kim Dong-hee as Wangyoon
Choi Woo-sung as young Wangyoon
Ryu Sang-wook as Dae Nam-bo
Kim Sang-bin as young Dae Nam-bo
The most prominent of Misaeng's sons, a Hwarang commander
Choi Sung-jo as Seonyeol
Oh Eun-suk as young Seonyeol
Kim Dong-soo as Hyeopseong
Moon Ji-yoon as Siyeol
Shin Tae-hoon as young Siyeol
Jung Hye-sun as Lady Man-ho
Jinpyeong and Manmyeong's mother
Park Eun-bin as Boryang
Bojong's daughter; Kim Chunchu's wife
Qri as Youngmo
Hajong's daughter; Kim Yushin's wife
Mametkulovs Mansur as Katan
Roman, possibly Jewish, trader who teaches Latin to the young Deokman
Seo Kang as Yangkil
O Yeong-su as Wolcheon abbot
Mahbub Alam as Tibetan man (토번인)
Cameos
Lee Soon-jae as King Jinheung (ep 1)
Im Ho as King Jinji (ep 1)
Park Jae-jung as Sadaham (ep 13)
Mishil's first love
Ratings
In the table below, the blue numbers represent the lowest ratings and the red numbers represent the highest ratings.
Filming location
It was filmed on location at MBC Dramia in Cheoin-gu, Yongin, Gyeonggi Province. Other historical dramas such as Dong Yi, Moon Embracing the Sun and Jumong were also filmed there.
It was filmed at the Shilla Millennium Park in Gyeongju.
Artistic license
The series adopted significant artistic license regarding the portrayal of historical events in order to accommodate the dramatic storyline. Notably, the reign of King Jinpyeong was compressed by over two decades such that in the series, Queen Seondeok was born within a year of his coronation (her actual date of birth is unknown). Accordingly, the preceding King Jinheung's reign was extended by a similar period, with him being depicted as an elderly man at his death. This allowed for Mishil and other prominent figures during Jinheung's reign to be involved in events concerning the Queen during her time as Royal Princess, even though there is no evidence to suggest what sort of interaction the two had if any. Artistic license was used to imagine her as being of a similar age to Kim Yushin and Bidam, though again, it is not clear historically if this was the case. Another major change was in the date of her death: Bidam's execution and Kim Alcheon's appointment to his post were ordered by Jindeok of Silla, ten days after Queen Seondeok's death. Queen Jindeok is not mentioned in the series. More subtly, the real Seondeok likely never left Silla (stories concerning her childhood in the palace survive) and did not know Latin.
Plagiarism controversy
On 31 December 2009, Kim Ji-young, an obscure playwright and representative of Great Works Ltd., a culture content company, filed a plagiarism lawsuit against MBC and screenwriters Kim Young-hyun and Park Sang-yeon, saying they ripped off her script for Seondeok, Queen of Mugunghwa, an unperformed musical she said she wrote in 2005. Kim argued that the development of the story and conflict between characters were similar to her play, including discord between two major female characters, Seondeok and Mishil; a romance between Deokman and General Kim Yushin; and the story of the young Deokman wandering through a desert. The MBC drama contains all of these plot twists, which are not based on history but which Kim says she invented. Kim said she shared some of her scripts with the Korea Creative Content Agency to attract investment in the musical, and believed that's how the content was leaked. Kim asked for in compensation and an injunction banning the broadcast of the soap opera. The injunction was turned down and Queen Seondeok ran from May to December 2009, but the copyright infringement case continued.
The MBC network and the series' writers maintained they did not know of the existence of Kim's play. MBC had copyrighted its script in May 2008. After Kim requested for an assessment by experts, the Seoul Southern District Court asked Seoul National University's Center for Law & Technology to investigate. In a process called a "script autopsy," the center first identifies similar content in the two scripts. At that point, university historians confirm historical facts regarding the characters and plot, and differentiates them from literary creations. Afterward, the center makes an appraisal based on copyright laws, then the court makes the final adjudication. In February 2011, the SNU Center for Law & Technology confirmed the plagiarism.
In December 2012, the High Court ruled in favor of plaintiff Kim Ji-young that Queen Seondeok was a work of plagiarism, and fined MBC (). In its ruling, the court stated that though the characters and the details were in fact different, "the overall plot was the same" and it is "most probable that the network relied on the script and plot of the musical to produce their drama." Furthermore, any additional reruns on cable TV and internet, and the making of DVD and related books were banned.
Awards and nomination
Notes
References
External links
The Great Queen Seondeok All Episodes Subtitled In English In HD
Queen Seondeok official MBC website
The Great Queen Seondeok at MBC Global Media
MBC TV television dramas
2009 South Korean television series debuts
2009 South Korean television series endings
Korean-language television shows
Queen Seondeok of Silla
South Korean historical television series
Television series set in Silla
Television shows written by Kim Young-hyun
Television shows involved in plagiarism controversies |
Jaya Suprana, (née Phoa Kok Tjiang) is an Indonesian pianist, composer, conductor, writer, cartoonist, and television presenter.
Jaya Suprana was born in Denpasar, Bali as a Chinese descendant, but grew up within Javanese culture. He studied music at Musikhochschule Münster and Folkwang-Hochschule Essen, West Germany, between 1967 and 1976, and since then has given piano recitals worldwide, as well as composing his own music. He also presents his own national weekly talkshow called the Jaya Suprana Show. His daily writings have appeared in the daily newspapers Kompas, Suara Pembaruan, Sinar Harapan, on-line media such as RMOL, Askara, SMSI and books published by Elex Media Komputindo.
He also established the Indonesian Museum of Records (MURI), Rotary-Suprana Orphanage, Centre for Kelirumologi Study, and together with Aylawati Sarwono founded the Jaya Suprana School of Performing Arts which has performed wayang orang at the Sydney Opera House and Unesco Paris also recital master class series with young Indonesian talented musician on international stages and in 2011 organised the Indonesia Pusaka International Piano Competition with participants from 12 countries and the gala concert at the presidential palace in Bogor attended by the president and first lady of Republic Indonesia. In 2014, Jaya Suprana performed his piano recital in the Carnegie Hall, New York, USA and organized the first Indonesian International Philosophy Symposium in the Ministry of Education and Culture of Indonesia in Jakarta.
Suprana received a PhD degree in philosophy and social sciences from the unaccredited Pacific Western University. He is also the Chairman of his family-run medicinal herbs producing firm, PT Jamu Cap Jago, in the Central Java capital of Semarang.
He tours with his group Kwartet Punakawan
References
External links
(id) Jaya Suprana, Si Multitalent Pencetus Kelirumologi
Jaya Suprana to bring peace in recital
Indonesian museum of records website
PT Jamu Jago website
JAYA SUPRANA Blogspot
Wikipedia Bahasa Indonesia
1949 births
Living people
Indonesian people of Chinese descent
Indonesian businesspeople
Indonesian composers
Indonesian pianists
People from Denpasar
21st-century pianists |
```smalltalk
using System.Reflection;
namespace UnityEditor.ShaderGraph
{
[Title("Math", "Trigonometry", "Arcsine")]
public class ArcsineNode : CodeFunctionNode
{
public ArcsineNode()
{
name = "Arcsine";
}
public override string documentationURL
{
get { return "path_to_url"; }
}
protected override MethodInfo GetFunctionToConvert()
{
return GetType().GetMethod("Unity_Arcsine", BindingFlags.Static | BindingFlags.NonPublic);
}
static string Unity_Arcsine(
[Slot(0, Binding.None)] DynamicDimensionVector In,
[Slot(1, Binding.None)] out DynamicDimensionVector Out)
{
return
@"
{
Out = asin(In);
}
";
}
}
}
``` |
```smalltalk
// Xavalon. All rights reserved.
using System;
namespace Xavalon.XamlStyler.Extension.Windows.Extensions
{
public static class StringExtensions
{
public static bool IsNullOrEmpty(this string self)
{
return String.IsNullOrEmpty(self);
}
public static bool IsNullOrWhiteSpace(this string self)
{
return String.IsNullOrWhiteSpace(self);
}
}
}
``` |
```ruby
# frozen_string_literal: true
require_relative "../base"
require_relative "../events/event"
module Fusuma
module Plugin
module Detectors
# Inherite this base
class Detector < Base
def initialize(*args)
super
@tag = self.class.tag
@type = self.class.type
end
attr_reader :tag
attr_reader :type
# @return [Array<String>]
def sources
@sources ||= self.class.const_get(:SOURCES)
end
# Always watch buffers and detect them or not
# @return [TrueClass,FalseClass]
def watch?
false
end
# @param _buffers [Array<Buffer>]
# @return [Event] if event is detected
# @return [NilClass] if event is NOT detected
def detect(_buffers)
raise NotImplementedError, "override #{self.class.name}##{__method__}"
# create_event(record:)
end
# @param record [Events::Records::Record]
# @return [Events::Event]
def create_event(record:)
@last_time = Time.now
Events::Event.new(time: @last_time, tag: tag, record: record)
end
def last_time
@last_time ||= Time.now
end
def first_time?
@last_time.nil?
end
class << self
def tag
name.split("Detectors::").last.underscore
end
def type(tag_name = tag)
tag_name.gsub("_detector", "")
end
end
end
end
end
end
``` |
```html
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>windows::overlapped_handle::assign (1 of 2 overloads)</title>
<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
<link rel="home" href="../../../../boost_asio.html" title="Boost.Asio">
<link rel="up" href="../assign.html" title="windows::overlapped_handle::assign">
<link rel="prev" href="../assign.html" title="windows::overlapped_handle::assign">
<link rel="next" href="overload2.html" title="windows::overlapped_handle::assign (2 of 2 overloads)">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center"><a href="../../../../../../index.html">Home</a></td>
<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td>
<td align="center"><a href="path_to_url">People</a></td>
<td align="center"><a href="path_to_url">FAQ</a></td>
<td align="center"><a href="../../../../../../more/index.htm">More</a></td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="../assign.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../assign.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../boost_asio.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="overload2.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_asio.reference.windows__overlapped_handle.assign.overload1"></a><a class="link" href="overload1.html" title="windows::overlapped_handle::assign (1 of 2 overloads)">windows::overlapped_handle::assign
(1 of 2 overloads)</a>
</h5></div></div></div>
<p>
Assign an existing native handle to the handle.
</p>
<pre class="programlisting">void assign(
const native_handle_type & handle);
</pre>
</div>
<table xmlns:rev="path_to_url~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
file LICENSE_1_0.txt or copy at <a href="path_to_url" target="_top">path_to_url
</p>
</div></td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="../assign.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../assign.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../boost_asio.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="overload2.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
``` |
```xml
declare const _default: import("react").ComponentType<any>;
export default _default;
//# sourceMappingURL=NativeVideoView.d.ts.map
``` |
Oberamt (, plural ) was the designation of an administrative unit in the German state of Württemberg, introduced in 1758 instead of Amt. Literally translated, the term means Upper, Senior, Higher or Superior Office. It was in use until 1934, after the Nazi seizure of power, when the were renamed Kreise with the Kreisordnung of Württemberg and their number was considerably reduced by mergers in 1938.
History
Duchy
The subdivision of the Duchy of Württemberg (until 1495 county) into public administration called reflected in its diversity the gradual growth of the territory. In addition to the secular offices, which made up the largest part of the state, there were monastic, rentier and chamber offices. Usually, a secular office consisted of the eponymous town and the surrounding villages as or , but the districts differed considerably in area and population, and complicated borderlines with many exclaves marked the map. Some larger offices, such as the Amt Urach, were divided into several (“sub-offices”). For clarification, the offices themselves were called Oberamt from 1758 on, without structural reforms being connected with this renaming. The ducal civil servant, who was traditionally called Vogt (about equal to “bailiff”) and who managed the administrative affairs at the official level, held the title from 1759. From that day on, “all and every secondary title with the bailiff′s word was to cease immediately and only the Oberamtmann′s name was to be valid.” He was responsible for the implementation of government measures in his bailiwick, for example by publishing new laws, receiving complaints from subjects and forwarding them to the appropriate higher authorities. He also warned persons who only slightly violated laws. In the , representatives of the official town and places of office discussed common matters. For example, it was decided here how the road construction in the district was to be financed. The official assembly also elected its representatives for the so-called "Landschaft".
Kingdom
After the areas that had been assigned to the House of Württemberg as a result of the upheavals of the Napoleonic era since 1803 were initially administered separately as "Neuwürttemberg", the organisational edict of 1806 - Württemberg had in the meantime risen to become the Kingdom of Württemberg - initiated the creation of uniform structures. In the following years the declaration of intent
"An expedient division and merger of the senior and staff offices will be made gradually.
and the whole country, regardless of historical and denominational circumstances, will be newly divided into approximately equal senior offices, the number of which was reduced to 64 by 1810 and to 63 by 1819 with the abolition of the Albeck senior office. A special role was played by the Residence City Stuttgart, where the fulfilled the corresponding tasks.
The higher offices were subordinate to the Ministry of the Interior and were responsible for all essential areas of state administration, only the financial system was in the hands of the Kameralämter since 1806. Since 1814 every senior office received a public health officer under the title (senior physician). According to the understanding of the state at that time, administration and jurisdiction were not separate, rather the senior civil servant presided over the High Court in personal union. Municipal self-governance and the right to a say of the estates, which had already been temporarily restricted under Duke Carl Eugen, was suspended by King Friedrich.
King Wilhelm I. took over the government in 1816 and immediately began comprehensive reforms, which led to the constitution of 1819 and thus changed Württemberg from an absolute to a constitutional Monarchy. The edicts issued on 31 December 1818 regulated various aspects of the restored local self-government:
The sheriff's offices became Selbstverwaltungskörper.
The municipalities of an together formed the , a territorial authority with its own parliament () and its own assets ().
This resulted in a double function of the senior civil servant, who was not only a civil servant as before, but also functioned as organ of the official authority.
Administration and justice were separated from each other at the level.
Chapter V of the Constitution contained detailed information on the administrative structure and rights of municipalities and official bodies. In particular, § 64 provided that limits could only be changed by law, i.e. with the consent of parliament. This possibility was only used very sparingly; only in 1842 were major changes made, affecting around thirty municipalities. A bill introduced by the government in 1911 to simplify administration in the sense of cost savings provided for only 42 , but was rejected by the Chamber of Deputies.
People's state
In 1919, renewed consideration was given to reducing the number of and restoring the uniformity lost due to the different population trends. After the Landtag had agreed to the abolition of the Cannstatt on 1 October 1923, the government attempted to dissolve the of Blaubeuren, Brackenheim, Neresheim, Spaichingen, Sulz, Weinsberg and Welzheim on 1 April 1924 by emergency decree, covered by an enabling act. The protests caused by this led to the resignation of the government, the emergency decree was withdrawn and subsequently only the Weinsberg was abolished (on 1 April 1926).
Nazi dictatorship
In 1933, the organs of local self-government were dissolved. After the Oberamtmann had already been titled Landrat since 1928, following the Prussian style, the Kreisordnung of 1934 replaced the names Oberamt by Kreis and Amtskörperschaft by Kreisverband, but did not yet include a change of boundaries. Only with the administrative district reform of 1938 were 27 of the remaining 61 districts abolished.
Descriptions of the local authorities
From 1824 to 1886, all the were statistically processed and their history, communities, population figures and the characteristics of their inhabitants were elaborately described in print.
The mainly catholic “new Württemberg” areas, e.g. in Oberschwaben, as described from the point of view of the Württemberg bureaucracy in evangelically influenced Stuttgart, often bear certain characteristics. Quote from the description of Oberamt Ravensburg, p. 29: “The character of the inhabitants is generally praised more than in other neighbouring districts, it is described as simple and trusting”.
The Oberamt descriptions have become sought-after and expensively paid collector's items; therefore all volumes were reprinted in the 1970s. Most of these reprints meanwhile are out of print again. All of them are now available in digital form, see Wikisource.
Today's traces of the boundaries
In the former Württemberg region of contemporary Baden-Württemberg, often the courts are located in the former Oberamt cities.
The ecclesiastical administrative structures of the Evangelical-Lutheran Church in Württemberg also largely reflect the former higher offices. In most of the former cities of the Oberamt cities there is still the seat of a deanery, whose area of responsibility is the same as the former Oberamt. Deviations from this mainly occur in the predominantly Catholic areas and wherever new deaneries were established due to an increase in church members, such as in Ditzingen or Bernhausen.
List of the Württemberg (1811 to 1934)
References
Literature
Walter Grube: Vogteien, Ämter, Landkreise in Baden-Württemberg. Stuttgart 1975,
Historischer Atlas von Baden-Württemberg, Karten VII,4 und VII,5 mit Beiwort. Stuttgart 1976
Weblinks
Württemberg |
```php
<?php
/*
* This file is part of the Symfony package.
*
* (c) Fabien Potencier <fabien@symfony.com>
*
* For the full copyright and license information, please view the LICENSE
* file that was distributed with this source code.
*/
namespace Symfony\Component\Console\Formatter;
use Symfony\Component\Console\Exception\InvalidArgumentException;
use Symfony\Contracts\Service\ResetInterface;
/**
* @author Jean-Franois Simon <contact@jfsimon.fr>
*/
class OutputFormatterStyleStack implements ResetInterface
{
/**
* @var OutputFormatterStyleInterface[]
*/
private $styles;
private $emptyStyle;
public function __construct(?OutputFormatterStyleInterface $emptyStyle = null)
{
$this->emptyStyle = $emptyStyle ?? new OutputFormatterStyle();
$this->reset();
}
/**
* Resets stack (ie. empty internal arrays).
*/
public function reset()
{
$this->styles = [];
}
/**
* Pushes a style in the stack.
*/
public function push(OutputFormatterStyleInterface $style)
{
$this->styles[] = $style;
}
/**
* Pops a style from the stack.
*
* @return OutputFormatterStyleInterface
*
* @throws InvalidArgumentException When style tags incorrectly nested
*/
public function pop(?OutputFormatterStyleInterface $style = null)
{
if (empty($this->styles)) {
return $this->emptyStyle;
}
if (null === $style) {
return array_pop($this->styles);
}
foreach (array_reverse($this->styles, true) as $index => $stackedStyle) {
if ($style->apply('') === $stackedStyle->apply('')) {
$this->styles = \array_slice($this->styles, 0, $index);
return $stackedStyle;
}
}
throw new InvalidArgumentException('Incorrectly nested style tag found.');
}
/**
* Computes current style with stacks top codes.
*
* @return OutputFormatterStyle
*/
public function getCurrent()
{
if (empty($this->styles)) {
return $this->emptyStyle;
}
return $this->styles[\count($this->styles) - 1];
}
/**
* @return $this
*/
public function setEmptyStyle(OutputFormatterStyleInterface $emptyStyle)
{
$this->emptyStyle = $emptyStyle;
return $this;
}
/**
* @return OutputFormatterStyleInterface
*/
public function getEmptyStyle()
{
return $this->emptyStyle;
}
}
``` |
Aita Gasparin (born 9 February 1994 in Samedan) is a Swiss biathlete. She competed at the Biathlon World Championships 2013, and at the 2014 Winter Olympics in Sochi, in the individual contest.
She is the sister of fellow biathletes Selina Gasparin and Elisa Gasparin.
References
External links
1994 births
Living people
Biathletes at the 2014 Winter Olympics
Biathletes at the 2018 Winter Olympics
Swiss female biathletes
Olympic biathletes for Switzerland
Biathletes at the 2012 Winter Youth Olympics
People from Maloja District
Sportspeople from Graubünden |
Aldyr Garcia Schlee (Jaguarão (RS), November 22, 1934 – Pelotas (RS), November 15, 2018) was a Brazilian writer, journalist, translator, illustrator, and professor.
Biography
Schlee had two main areas of expertise: Brazilian – Uruguayan international relations and the literature of Uruguay and of Brazil, with further specialty in works produced by authors from the state of Rio Grande do Sul.
He wrote various short stories and his work has been included in a number of anthologies.
Some of his books first appeared in Spanish and were published in Uruguay. Personally fluent to the highest levels both in Portuguese and Spanish, he also grew up with and around his family who spoke German, historically a strong regional language (see Riograndenser Hunsrückisch) and the second most widely spoken language in the state of Rio Grande do Sul.
In 1953 Schlee designed the world-famous Brazil national football team jersey Camisa Canarinho. Schlee died on November 15, 2018, a week before his 84th birthday, and on the eve of a Brazil vs. Uruguay friendly match in London.
Prizes received
Schlee twice received the prestigious Bienal Nestlé de Literatura Brasileira literary prize; and he also granted the Prêmio Açorianos de Literatura prize, five times.
Witness to regional language repression by the State during World War II
In a 2011 interview Schlee said that during World War II he personally witnessed German-Brazilian farmers in a chain gang, arrested because they had been caught speaking their native language when the Brazilian Vargas government had summarily prohibited anyone from speaking it; the author explained how it shocked him and caused a lifelong impression on him, to see those men being paraded single file through the city of Santa Cruz do Sul where he lived at that time.
Bibliography
2014: "Memórias de o que já não será", ed. Ardotempo
2013: "Contos da Vida Difícil", ed. Ardotempo
2010: "Don Frutos", ed. Ardotempo
2009: "Glossário de Simões Lopes Neto" – São Paulo
2009: "Os limites do impossível – os contos gardelianos", ed. Ardotempo, Porto Alegre
2007: "Contos gauchescos e Lendas do Sul", de JSLN, edição crítica com estabelecimento da linguagem. IEL/Unisinos.
2000: "Contos de Verdades", contos (ed. Mercado Aberto)
1998: "Linha Divisória" (contos, ed. Melhoramentos)
1997: "Contos de Futebol" (contos, ed. Mercado Aberto)
1991: "El dia en que el papa fue a Melo" (contos, ed. de la Banda Oriental) (republished in Portuguese as "O Dia em que o Papa foi a Melo", ed. Mercado Aberto, 1999)
1984: "Uma Terra Só" (contos, ed. Melhoramentos)
1983: "Contos de Sempre" (contos, ed. Mercado Aberto)
Anthologies
2003: "Melhores Contos do Rio Grande do Sul" (contos, ed. IEL)
1999: "Para Ler os Gaúchos" (contos, ed. Novo Século)
1996: "Nós os Teuto-gaúchos" (ensaios, ed. da Universidade/UFRGS)
1994: "Nós os Gaúchos 2" (ensaios, ed. da Universidade/UFRGS)
1988: "Autores Gaúchos 20: Aldyr Garcia Schlee" (antologia, ed. IEL)
1977: "Histórias Ordinárias" (contos, ed. Documento)
Translations from Spanish to Portuguese
1990 Para Sempre Uruguai (Antologia de contos). Tradução de Sérgio Faraco e Aldyr Garcia Schlee. Porto Alegre: Instituto Estadual do Livro.
1996 Sarmiento, Domingo Faustino. Facundo: civilização e barbárie no pampa argentino. Tradução, notas e estudo crítico de Aldyr Garcia Schlee. Porto Alegre: Editora da Universidade Federal do Rio Grande do Sul / Editora da Universidade Católica do Rio Grande do Sul.
1997 Acevedo Díaz, Eduardo. Pátria Uruguaia. Antologia. Seleção, tradução e notas de Aldyr Garcia Schlee. Porto Alegre: Instituto Estadual do Livro.
1997 Güiraldes, Ricardo. Don Segundo Sombra. Tradução de Augusto Meyer, revisão da tradução por Aldyr Garcia Schlee. Porto Alegre: LP&M.
Translations from Portuguese to Spanish
1991 Lopes Neto, João Simões. La salamanca del Jarau. Porto Alegre: IEL-IGEL.
2000 Martins, Cyro. Campo afora/Campo afuera. Edição bilíngue português/espanhol. Tradução para o espanhol de Aldyr Garcia Schlee. Porto Alegre, IEL/CELPCYRO.
References
External links
IstoÉ Gente online
1934 births
2018 deaths
Brazilian people of German descent
Brazilian male short story writers
Brazilian translators
Brazil national football team
People from Jaguarão
Portuguese–Spanish translators
Spanish–Portuguese translators
20th-century Brazilian short story writers
20th-century Brazilian male writers
21st-century Brazilian short story writers
21st-century Brazilian male writers
20th-century translators
Recipients of the Order of Cultural Merit (Brazil) |
Arne Leonhard Nilsen (21 July 1893 – 5 April 1957) was a Norwegian politician.
He was born in Kristiansand to merchant Nikolai Emil Nilsen and Anne Lovise Aarrestad. He was elected representative to the Storting for the period 1954–1957 for the Conservative Party.
References
1893 births
1957 deaths
Politicians from Kristiansand
Conservative Party (Norway) politicians
Members of the Storting |
Notting Hill Genesis (NHG) is a housing association formed in April 2018 by the merger of Notting Hill Housing and Genesis Housing Association. Notting Hill Genesis’ primary purpose is to work in the community to provide decent and affordable homes for lower-income households.
It is one of the largest housing associations in South East England. It owns around 55,000 properties in London and a further 9,000 in the home counties and East Anglia, housing about 170,000 people.
History
Notting Hill Housing Trust
Notting Hill Housing (NHH) was a social enterprise and registered charity providing affordable housing for Londoners. In 1963, Bruce Kenrick moved to Notting Hill and was shocked at the poor quality of housing that people were forced to live in. He began a fundraising drive, with the aim to raise enough money to buy one home to house several homeless families. As Michael White has written: "Its first fundraiser was a stall on the Portobello Road market which raised £24. But Kenrick, a man of charismatic energy, which alternated with bouts of sometimes severe depression, learned quickly. Backed by clerical allies such Donald Mason, Geoffrey Ainger and Ken Bartlett, and concerned local people such as Sidney Miller and Pansy Jeffrey, the Trust's first advert – placed in The Guardian – raised £20,000. It was unprecedented." Notting Hill Housing Trust was born, and in its first year it bought five houses and housed 57 people. Within five years, it became a large presence in west London, housing nearly 1,000 people.
John Coward, who joined the Trust in 1965, was the first employee and then the first Chief Executive. When he started, it had five properties; when he retired 21 years later, it was managing almost 8,000. The Trust raised funds from the public to buy dilapidated properties at auction. By renovating these houses to provide decent, affordable rented housing, it meant that some poor residents were not pushed out of the area.
Over the years it has taken over various smaller housing associations, including three in 2009: Presentation, Croydon Peoples and Pathway, which took its housing stock to 25,000.
Housing associations finance acquisitions and major repairs by borrowing, secured on their housing properties. In 2012 NHH borrowed £250 million by a bond issue at a record low interest rate for the sector of 3.78 per cent.
In 2013 NHH commemorated its 50th anniversary with a series of events and activities which involved former and current staff, residents, supporters and sector colleagues.
On 28 April 2014 an agreement was signed with Southwark Council confirming NHH as the development partner for the regeneration of the Aylesbury Estate. The agreement commits the partnership to delivering a master plan for 3,500 new homes; 50% of these will be affordable homes, of which 75% will be for social rent and 25% for shared ownership or equity. A minimum of 30% across all tenures will have three bedrooms or more. Construction of the new homes will start in 2016, with the entire regeneration project expected to be finished in 2032.
On 20 July 2017 it was announced that Notting Hill Housing have agreed a merger in principle with Genesis Housing Association The merger was completed on 4 April 2018 to form Notting Hill Genesis.
Genesis Housing Association
Genesis Housing Association, known until May 2011 as Genesis Housing Group Ltd, was one of the largest developer housing associations in London. It was formed through the amalgamation of Paddington Churches Housing Association, Pathmeads and Springboard housing associations. In 2017 they announced they will be merging with Notting Hill Housing to form Notting Hill Genesis. The merger was completed in April 2018.
Genesis Housing Association managed around 33,000 homes across London and the south east, providing services to tens of thousands of people. It was formed by a merger in May 2011 of PCHA, Pathmeads and Springboard housing associations. They had for some years been managed as a corporate group, Genesis Housing Group. The group also includes Genesis Community, a charitable foundation, and Genesishomes which provides shared ownership properties.
PCHA was founded over 40 years earlier as Paddington Churches Housing Association, and managed more than 11,500 homes.
Pathmeads was formed in 2001 as a rescue vehicle for West Hampstead Housing Association, which had overextended its temporary housing operation. In 2011 it had over 21,000 managed homes.
Springboard provided management services to around 6,000 homes and another rescued association, St Matthew Housing. Eastwards Trust was also a subsidiary of Springboard.
Management
Neil Hadden was appointed as Chief Executive in 2009. He succeeded Mr Anu Vedi CBE, who had led the group for ten years, through its growth from 10,000 to over 38,000 homes.
The current Chairman of the Board of Trustees is Dipesh Shah OBE, who has had a diverse executive career in the energy sector. He replaced Charles Gurassa in 2017.
Properties managed
, stock owned and managed totals 32,139. The highest proportions of stock were based in the London boroughs of Barnet, Brent, Camden and the City of Westminster.
Finances
From 2005 to 2007, Genesis spent £200 million on its land bank for new developments. As the late-2000s financial crisis developed, Genesis wrote off around £6 million from asset values in its balance sheet each year from 2008 to 2010, but in 2011 this entry in its accounts increased to £20 million – a third of the total impairment booked by all housing associations in the year.
Genesis strengthened its financial position by raising its first own-name bond issue for £200 million in 2010. It rationalised its asset holdings, selling its 40% interest in a portfolio of 1,650 properties in central London to Grainger plc for £15m in 2011.
In August 2015 Genesis controversially announced that it would no longer be building homes for social rent and would now bring the rents of its existing stock into line with affordable and market rental rates as they become vacant.
Awards
Genesis won the top prize for social housing at the Daily Telegraph British Homes Awards 2011 for the first phase of new homes at Woodberry Down.
Developments
Genesis owned a site in Chelmsford, Essex, formerly the Central Campus of Anglia Ruskin University. The group purchased it from Countryside Properties in 2007. The developer had obtained planning permission for 700 homes in 2003. Genesis prepared a revised plan in 2011 for about 600 homes, along with new shops and offices. Some of the old buildings are to be retained including Anne Knight House, the 1823 listed former Quaker meeting house.
Genesis worked with Hackney Borough Council on the redevelopment of Woodberry Down, one of the largest urban regeneration projects in the UK.
Genesis was the lead housing association developer on Grahame Park, a large-scale regeneration project in Colindale, North-West London, in partnership with Barnet London Borough Council and Countryside Properties. The scheme is one of the largest self-funded projects in Europe and will see the construction of around 3000 new homes, as well as shops, gardens, community and health facilities, new parks, and a civic hub.
In December 2016, it was confirmed that Genesis would be a partner on the Oaklands development, the first major scheme to be delivered as part of the regeneration of Old Oak Common in London. They aimed to deliver a £175m mixed-use residential development of over 600 homes, working with Queens Park Rangers football club.
References
External links
Notting Hill Housing
Genesis Housing Association
Genesis Homes (shared ownership)
Housingnet profile of Genesis Housing Group
2018 establishments in England
Housing associations based in England
Housing organisations based in London |
Ryan Vierra (born August 23, 1968) is a world champion Highland Games competitor. Ryan is a 5-time winner of the World Highland Games Championships, he is also an 11 time US National Champion. Ryan has set 346 Games records, 4 World records, 10 North American & American records and 6 World Championship records.
Professional Records
16 lbs Open Stone
17 lbs Open Stone .
22 lbs Braemar Stone .
26 lbs Braemar Stone .
16 lbs Hammer Throw .
22 lbs Hammer Throw .
28 lbs for Distance 93 ft.
56 lbs for Distance 49.2 ft.
16 lbs Sheaf Toss .
20 lbs Sheaf Toss .
56 lbs Weight for Height 16.0 st.(18.0 1 sp)
Caber Toss ( 23' × l30lbs) 12:00×2
Strongman Events
Donanun Stones for time 21.4 sec
98 lbs Stone for distance .
125 lbs Stone for distance .
Flint Stone (Press Overhead) 374 lbs.
Personal Records
Power Clean: 385
Power Snatch: 245 pounds (Stopped going heavy in 1992)
Jerk: 374lbs
Squat: 640 pounds (for a double -just knee raps and a belt)
Jump Shrugs: 600×2
Deadlift: 535 pounds (Stopped after High School, 1986)
Bench Press: 410 pounds
Career Wins
1st place - 254
2nd place - 60
3rd place - 19
4th place - 6
5th place - 4
7th place - 1
References
American strength athletes
1968 births
Living people |
```php
<?php
namespace classes\exceptions_002;
class A extends \Exception
{}
class B extends \Exception
{}
try
{
throw new B;
}
catch (A|B|C $ex)
{
echo "A|B|C hit\n";
}
finally
{
echo "finally\n";
}
echo "Done.";
``` |
```prolog
# !!!!!!! DO NOT EDIT THIS FILE !!!!!!!
# This file is machine-generated by lib/unicore/mktables from the Unicode
# database, Version 15.0.0. Any changes made here will be lost!
# !!!!!!! INTERNAL PERL USE ONLY !!!!!!!
# This file is for internal use by core Perl only. The format and even the
# name or existence of this file are subject to change without notice. Don't
# use it directly. Use Unicode::UCD to access the Unicode character data
# base.
return <<'END';
V12
46
47
8216
8218
8228
8229
65106
65107
65287
65288
65294
65295
END
``` |
Gmina Charsznica is a rural gmina (administrative district) in Miechów County, Lesser Poland Voivodeship, in southern Poland. Its seat is the village of Charsznica, which lies approximately north-west of Miechów and north of the regional capital Kraków.
The gmina covers an area of , and as of 2006 its total population is 7,796.
Villages
Gmina Charsznica contains the villages and settlements of Charsznica, Chodów, Ciszowice, Dąbrowiec, Jelcza, Marcinkowice, Podlesice, Pogwizdów, Swojczany, Szarkówka, Tczyca, Uniejów-Kolonia, Uniejów-Parcela, Uniejów-Rędziny, Wierzbie and Witowice.
Neighbouring gminas
Gmina Charsznica is bordered by the gminas of Gołcza, Kozłów, Książ Wielki, Miechów, Wolbrom and Żarnowiec.
References
Polish official population figures 2006
Charsznica
Miechów County |
Beriah Gwynfe Evans (12 February 1848 – 4 November 1927) was a journalist, Congregationalist, dramatist, Liberal politician and Welsh Nationalist.
Early life
Born at Nant-y-glo, near Ebbw Vale in Monmouthshire, Evans was educated at the Beaufort British School and became a teacher at Gwynfe and Llangadog, Carmarthenshire. However, his ambition was to become a journalist.
Teacher and playwright
As a playwright, Evans helped to introduce a sceptical Nonconformity to contemporary drama with a patriotic play, Owain Glyndŵr, performed at the Llanberis Eisteddfod of 1879. Evans was heavily involved in Welsh language literature and publishing, as a member of the Gorsedd.
Journalist
In 1880, Evans established the monthly magazine Cyfail yr Aelwyd, and in 1887 gave up teaching for a career in journalism, joining the staff of the South Wales Daily News in Cardiff. Concurrently he edited the Welsh section of the Cardiff Times and South Wales Weekly News. In 1892, he moved to Caernarfon as Managing Editor of the Welsh National Press Co., publishers of Y Genedl Gymreig, The North Wales Observer and other papers. In 1917 he became editor of the Congregationalist weekly Y Tyst.
Beriah Evans was an ally of David Lloyd George and others present at the Newport meeting of 16 January 1896. As Secretary of Cymru Fydd from 1895, Evans was in the vanguard of its offensive across Wales. Lloyd George spoke against a motion to make Evans's post at Newport merely unpaid and honorary, "and curiously enough we carried that." Once Lloyd George had swung the meeting against the resolution, the decision was made to exclude him from any discussion on the second motion, that of four sub-federations. The Cardiff Cymru Fydd society became known as "Beriah's baumkin". He then turned his hand to writing novels and produced a fine biography of Lloyd George. In his final years, he joined the infant Plaid Cymru. Evans, as a Liberal Imperialist, broke with Lloyd George over the Boer War.
Works
The Life Romance of Lloyd George (1915)
Owain Glyndŵr (play) (1880)
Dafydd Davis (novel) (1898)
Map y rhyfel yng ngwledydd y Beibl yn dangos safle a symudiadau y gwahanol fyddinoedd yn eu perthynas a theiliau hanesyddol y Beibl (map) (1916)
References
R. Tudur Jones, Congregationalism in Wales
Dictionary of Welsh Biography
National Library of Wales, D. A. Thomas Papers
National Library of Wales, William George Papers
National Library of Wales, Sir John Herbert Lewis Papers
1848 births
1927 deaths
Welsh journalists
Welsh-language writers
People from Ebbw Vale
Welsh dramatists and playwrights
Liberal Party (UK) politicians
Plaid Cymru politicians
Bards of the Gorsedd
People from Caernarfon |
```python
#
#
# path_to_url
#
# Unless required by applicable law or agreed to in writing, software
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
"""Test Transformer model."""
from absl import logging
from absl.testing import parameterized
import numpy as np
import tensorflow as tf, tf_keras
from tensorflow.python.distribute import combinations
from tensorflow.python.distribute import strategy_combinations
from official.nlp.modeling.layers import attention
from official.nlp.modeling.models import seq2seq_transformer
class Seq2SeqTransformerTest(tf.test.TestCase, parameterized.TestCase):
def _build_model(
self,
padded_decode,
decode_max_length,
embedding_width,
self_attention_cls=None,
cross_attention_cls=None,
):
num_layers = 1
num_attention_heads = 2
intermediate_size = 32
vocab_size = 100
encdec_kwargs = dict(
num_layers=num_layers,
num_attention_heads=num_attention_heads,
intermediate_size=intermediate_size,
activation="relu",
dropout_rate=0.01,
attention_dropout_rate=0.01,
use_bias=False,
norm_first=True,
norm_epsilon=1e-6,
intermediate_dropout=0.01)
encoder_layer = seq2seq_transformer.TransformerEncoder(**encdec_kwargs)
decoder_layer = seq2seq_transformer.TransformerDecoder(
**encdec_kwargs,
self_attention_cls=self_attention_cls,
cross_attention_cls=cross_attention_cls
)
return seq2seq_transformer.Seq2SeqTransformer(
vocab_size=vocab_size,
embedding_width=embedding_width,
dropout_rate=0.01,
padded_decode=padded_decode,
decode_max_length=decode_max_length,
beam_size=4,
alpha=0.6,
encoder_layer=encoder_layer,
decoder_layer=decoder_layer)
@combinations.generate(
combinations.combine(
distribution=[
strategy_combinations.default_strategy,
strategy_combinations.cloud_tpu_strategy,
],
embed=[True, False],
is_training=[True, False],
custom_self_attention=[False, True],
custom_cross_attention=[False, True],
mode="eager"))
def test_create_model_with_ds(
self,
distribution,
embed,
is_training,
custom_self_attention,
custom_cross_attention,
):
self_attention_called = False
cross_attention_called = False
class SelfAttention(attention.CachedAttention):
"""Dummy implementation of custom attention."""
def __call__(
self, *args, **kwargs
):
nonlocal self_attention_called
self_attention_called = True
return super().__call__(*args, **kwargs)
class CrossAttention:
"""Dummy implementation of custom attention."""
def __init__(self, *args, **kwargs):
pass
def __call__(self, query, value, attention_mask, **kwargs):
nonlocal cross_attention_called
cross_attention_called = True
return query
with distribution.scope():
padded_decode = isinstance(
distribution,
(tf.distribute.TPUStrategy, tf.distribute.experimental.TPUStrategy))
decode_max_length = 10
batch_size = 4
embedding_width = 16
model = self._build_model(
padded_decode,
decode_max_length,
embedding_width,
self_attention_cls=SelfAttention if custom_self_attention else None,
cross_attention_cls=CrossAttention
if custom_cross_attention
else None,
)
@tf.function
def step(inputs):
def _step_fn(inputs):
return model(inputs)
outputs = distribution.run(_step_fn, args=(inputs,))
return tf.nest.map_structure(distribution.experimental_local_results,
outputs)
if embed:
fake_inputs = dict(
embedded_inputs=np.zeros(
(batch_size, decode_max_length, embedding_width),
dtype=np.float32),
input_masks=np.ones((batch_size, decode_max_length), dtype=bool))
else:
fake_inputs = dict(
inputs=np.zeros((batch_size, decode_max_length), dtype=np.int32))
if is_training:
fake_inputs["targets"] = np.zeros((batch_size, 8), dtype=np.int32)
local_outputs = step(fake_inputs)
logging.info("local_outputs=%s", local_outputs)
self.assertEqual(local_outputs[0].shape, (4, 8, 100))
else:
local_outputs = step(fake_inputs)
logging.info("local_outputs=%s", local_outputs)
self.assertEqual(local_outputs["outputs"][0].shape, (4, 10))
self.assertEqual(self_attention_called, custom_self_attention)
self.assertEqual(cross_attention_called, custom_cross_attention)
@parameterized.parameters(True, False)
def test_create_savedmodel(self, padded_decode):
decode_max_length = 10
embedding_width = 16
model = self._build_model(
padded_decode, decode_max_length, embedding_width)
class SaveModule(tf.Module):
def __init__(self, model):
super(SaveModule, self).__init__()
self.model = model
@tf.function
def serve(self, inputs):
return self.model.call(dict(inputs=inputs))
@tf.function
def embedded_serve(self, embedded_inputs, input_masks):
return self.model.call(
dict(embedded_inputs=embedded_inputs, input_masks=input_masks))
save_module = SaveModule(model)
if padded_decode:
tensor_shape = (4, decode_max_length)
embedded_tensor_shape = (4, decode_max_length, embedding_width)
else:
tensor_shape = (None, None)
embedded_tensor_shape = (None, None, embedding_width)
signatures = dict(
serving_default=save_module.serve.get_concrete_function(
tf.TensorSpec(shape=tensor_shape, dtype=tf.int32, name="inputs")),
embedded_serving=save_module.embedded_serve.get_concrete_function(
tf.TensorSpec(
shape=embedded_tensor_shape, dtype=tf.float32,
name="embedded_inputs"),
tf.TensorSpec(
shape=tensor_shape, dtype=tf.bool, name="input_masks"),
))
tf.saved_model.save(save_module, self.get_temp_dir(), signatures=signatures)
if __name__ == "__main__":
tf.test.main()
``` |
The 1985 Individual Long Track World Championship was the 15th edition of the FIM speedway Individual Long Track World Championship. The event was held on 15 September 1985 at the Korskro Motor Centre in Esbjerg in Denmark.
The world title was won by Simon Wigg of England.
Final Classification
E = eliminated (no further ride)
f = fell
ef = engine failure
x = excluded
References
1985
Speedway competitions in Denmark
Motor
Motor |
Choi Sung-Hwan () is a South Korean football defender, who plays for Gyeongnam FC in K League Challenge. His previous club was Daegu FC, Suwon Samsung Bluewings, Ulsan Hyundai and Gwangju FC.
External links
1981 births
Living people
Men's association football defenders
South Korean men's footballers
Daegu FC players
Suwon Samsung Bluewings players
Ulsan Hyundai FC players
Gwangju FC players
Gyeongnam FC players
K League 1 players
K League 2 players
Footballers from Seoul |
```makefile
################################################################################
#
# sg3_utils
#
################################################################################
SG3_UTILS_VERSION = 1.40
SG3_UTILS_SOURCE = sg3_utils-$(SG3_UTILS_VERSION).tar.xz
SG3_UTILS_SITE = path_to_url
SG3_UTILS_LICENSE = BSD-3c
# utils progs are GPLv2+ licenced
ifeq ($(BR2_PACKAGE_SG3_UTILS_PROGS),y)
SG3_UTILS_LICENSE += GPLv2+
endif
SG3_UTILS_LICENSE_FILES = COPYING BSD_LICENSE
# install the libsgutils2 library
SG3_UTILS_INSTALL_STAGING = YES
ifeq ($(BR2_PACKAGE_SG3_UTILS_PROGS),)
define SG3_UTILS_REMOVE_PROGS
for prog in \
compare_and_write copy_results dd decode_sense \
emc_trespass format get_config \
get_lba_status ident inq logs luns map26 \
map sgm_dd modes opcodes sgp_dd persist prevent \
raw rbuf rdac read readcap read_block_limits \
read_buffer read_long reassign referrals \
rep_zones requests reset reset_wp rmsn rtpg safte sanitize \
sat_identify sat_phy_event sat_read_gplog sat_set_features \
scan senddiag ses ses_microcode start stpg sync test_rwbuf \
turs unmap verify vpd write_buffer write_long \
write_same write_verify wr_mode xcopy; do \
$(RM) $(TARGET_DIR)/usr/bin/sg_$${prog} ; \
done
for prog in \
logging_level mandat readcap ready satl start stop \
temperature; do \
$(RM) $(TARGET_DIR)/usr/bin/scsi_$${prog} ; \
done
for prog in \
sginfo sgm_dd sgp_dd; do \
$(RM) $(TARGET_DIR)/usr/bin/$${prog}; \
done
endef
SG3_UTILS_POST_INSTALL_TARGET_HOOKS += SG3_UTILS_REMOVE_PROGS
endif
$(eval $(autotools-package))
``` |
Nkosana is an African given name. Notable people with the name include:
Nkosana Makate (born 1977), South African businessman
Nkosana Mpofu (born 1990), Zimbabwean first-class cricketer
Nkosana Mhlanga (born 1998), South African-born famous sneaker designer
African given names |
Himrod Junction is a railroad junction located in the town of Himrod, New York. It currently is where the Finger Lakes Railway accesses Norfolk Southerns's Corning Secondary line. Finger Lakes Railway uses trackage rights over Norfolk Southern's Corning Secondary from Geneva to Himrod Junction to access its branch line which spans from Penn Yan in the north to Watkins Glen, New York in the south.
Railroad Activity in Himrod
Norfolk Southern's Corning Secondary
Norfolk Southern runs a local, round-trip freight train, symboled H06, from Corning to Geneva to interchange with FGLK Sunday through Thursday. This train usually runs in the early/late evening hours.
Finger Lakes Railway Penn Yan To Watkins Glen Branch line
Southwest of Himrod Junction, FGLK has a small yard in which staging and run-arounds for the local to Watkins Glen or Penn Yan is made. GW2 (Geneva, NY to Watkins Glen NY, round trip) serves the branch line on an as needed basis. GW2 will run to Penn Yan if needed. Runs to Watkins Glen are more regular than runs to Penn Yan.
References
Rail junctions in the United States
Geography of Yates County, New York
Norfolk Southern Railway |
```c++
/*
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*/
#include "Purity.h"
#include <algorithm>
#include <iterator>
#include <sstream>
#include <vector>
#include <sparta/WeakTopologicalOrdering.h>
#include "ConfigFiles.h"
#include "ControlFlow.h"
#include "DexClass.h"
#include "EditableCfgAdapter.h"
#include "IRInstruction.h"
#include "Resolver.h"
#include "Show.h"
#include "StlUtil.h"
#include "Timer.h"
#include "Trace.h"
#include "Walkers.h"
#include "WorkQueue.h"
namespace {
constexpr double kWtoOrderingThreshold = 50.0;
} // namespace
std::ostream& operator<<(std::ostream& o, const CseLocation& l) {
switch (l.special_location) {
case CseSpecialLocations::GENERAL_MEMORY_BARRIER:
o << "*";
break;
case CseSpecialLocations::ARRAY_COMPONENT_TYPE_INT:
o << "(int[])[.]";
break;
case CseSpecialLocations::ARRAY_COMPONENT_TYPE_BYTE:
o << "(byte[])[.]";
break;
case CseSpecialLocations::ARRAY_COMPONENT_TYPE_CHAR:
o << "(char[])[.]";
break;
case CseSpecialLocations::ARRAY_COMPONENT_TYPE_WIDE:
o << "(long|double[])[.]";
break;
case CseSpecialLocations::ARRAY_COMPONENT_TYPE_SHORT:
o << "(short[])[.]";
break;
case CseSpecialLocations::ARRAY_COMPONENT_TYPE_OBJECT:
o << "(Object[])[.]";
break;
case CseSpecialLocations::ARRAY_COMPONENT_TYPE_BOOLEAN:
o << "(boolean[])[.]";
break;
default:
o << SHOW(l.field);
break;
}
return o;
}
std::ostream& operator<<(std::ostream& o, const CseUnorderedLocationSet& ls) {
o << "{";
bool first = true;
for (const auto& l : ls) {
if (first) {
first = false;
} else {
o << ", ";
}
o << l;
}
o << "}";
return o;
}
CseLocation get_field_location(IROpcode opcode, const DexField* field) {
always_assert(opcode::is_an_ifield_op(opcode) ||
opcode::is_an_sfield_op(opcode));
if (field != nullptr && !is_volatile(field)) {
return CseLocation(field);
}
return CseLocation(CseSpecialLocations::GENERAL_MEMORY_BARRIER);
}
CseLocation get_field_location(IROpcode opcode, const DexFieldRef* field_ref) {
always_assert(opcode::is_an_ifield_op(opcode) ||
opcode::is_an_sfield_op(opcode));
DexField* field = resolve_field(field_ref, opcode::is_an_sfield_op(opcode)
? FieldSearch::Static
: FieldSearch::Instance);
return get_field_location(opcode, field);
}
CseLocation get_read_array_location(IROpcode opcode) {
switch (opcode) {
case OPCODE_AGET:
return CseLocation(CseSpecialLocations::ARRAY_COMPONENT_TYPE_INT);
case OPCODE_AGET_BYTE:
return CseLocation(CseSpecialLocations::ARRAY_COMPONENT_TYPE_BYTE);
case OPCODE_AGET_CHAR:
return CseLocation(CseSpecialLocations::ARRAY_COMPONENT_TYPE_CHAR);
case OPCODE_AGET_WIDE:
return CseLocation(CseSpecialLocations::ARRAY_COMPONENT_TYPE_WIDE);
case OPCODE_AGET_SHORT:
return CseLocation(CseSpecialLocations::ARRAY_COMPONENT_TYPE_SHORT);
case OPCODE_AGET_OBJECT:
return CseLocation(CseSpecialLocations::ARRAY_COMPONENT_TYPE_OBJECT);
case OPCODE_AGET_BOOLEAN:
return CseLocation(CseSpecialLocations::ARRAY_COMPONENT_TYPE_BOOLEAN);
default:
not_reached();
}
}
CseLocation get_read_location(const IRInstruction* insn) {
if (opcode::is_an_aget(insn->opcode())) {
return get_read_array_location(insn->opcode());
} else if (opcode::is_an_iget(insn->opcode()) ||
opcode::is_an_sget(insn->opcode())) {
return get_field_location(insn->opcode(), insn->get_field());
} else {
return CseLocation(CseSpecialLocations::GENERAL_MEMORY_BARRIER);
}
}
static const std::string_view pure_method_names[] = {
"Ljava/lang/Boolean;.booleanValue:()Z",
"Ljava/lang/Boolean;.equals:(Ljava/lang/Object;)Z",
"Ljava/lang/Boolean;.getBoolean:(Ljava/lang/String;)Z",
"Ljava/lang/Boolean;.hashCode:()I",
"Ljava/lang/Boolean;.toString:()Ljava/lang/String;",
"Ljava/lang/Boolean;.toString:(Z)Ljava/lang/String;",
"Ljava/lang/Boolean;.valueOf:(Z)Ljava/lang/Boolean;",
"Ljava/lang/Boolean;.valueOf:(Ljava/lang/String;)Ljava/lang/Boolean;",
"Ljava/lang/Byte;.byteValue:()B",
"Ljava/lang/Byte;.equals:(Ljava/lang/Object;)Z",
"Ljava/lang/Byte;.toString:()Ljava/lang/String;",
"Ljava/lang/Byte;.toString:(B)Ljava/lang/String;",
"Ljava/lang/Byte;.valueOf:(B)Ljava/lang/Byte;",
"Ljava/lang/Character;.valueOf:(C)Ljava/lang/Character;",
"Ljava/lang/Character;.charValue:()C",
"Ljava/lang/Class;.getName:()Ljava/lang/String;",
"Ljava/lang/Class;.getSimpleName:()Ljava/lang/String;",
"Ljava/lang/Double;.compare:(DD)I",
"Ljava/lang/Double;.doubleValue:()D",
"Ljava/lang/Double;.doubleToLongBits:(D)J",
"Ljava/lang/Double;.doubleToRawLongBits:(D)J",
"Ljava/lang/Double;.floatValue:()F",
"Ljava/lang/Double;.hashCode:()I",
"Ljava/lang/Double;.intValue:()I",
"Ljava/lang/Double;.isInfinite:(D)Z",
"Ljava/lang/Double;.isNaN:(D)Z",
"Ljava/lang/Double;.longBitsToDouble:(J)D",
"Ljava/lang/Double;.longValue:()J",
"Ljava/lang/Double;.toString:(D)Ljava/lang/String;",
"Ljava/lang/Double;.valueOf:(D)Ljava/lang/Double;",
"Ljava/lang/Enum;.equals:(Ljava/lang/Object;)Z",
"Ljava/lang/Enum;.name:()Ljava/lang/String;",
"Ljava/lang/Enum;.ordinal:()I",
"Ljava/lang/Enum;.toString:()Ljava/lang/String;",
"Ljava/lang/Float;.doubleValue:()D",
"Ljava/lang/Float;.floatToRawIntBits:(F)I",
"Ljava/lang/Float;.floatValue:()F",
"Ljava/lang/Float;.compare:(FF)I",
"Ljava/lang/Float;.equals:(Ljava/lang/Object;)Z",
"Ljava/lang/Float;.hashCode:()I",
"Ljava/lang/Float;.intBitsToFloat:(I)F",
"Ljava/lang/Float;.intValue:()I",
"Ljava/lang/Float;.floatToIntBits:(F)I",
"Ljava/lang/Float;.isInfinite:(F)Z",
"Ljava/lang/Float;.isNaN:(F)Z",
"Ljava/lang/Float;.valueOf:(F)Ljava/lang/Float;",
"Ljava/lang/Float;.toString:(F)Ljava/lang/String;",
"Ljava/lang/Integer;.bitCount:(I)I",
"Ljava/lang/Integer;.byteValue:()B",
"Ljava/lang/Integer;.compareTo:(Ljava/lang/Integer;)I",
"Ljava/lang/Integer;.doubleValue:()D",
"Ljava/lang/Integer;.equals:(Ljava/lang/Object;)Z",
"Ljava/lang/Integer;.hashCode:()I",
"Ljava/lang/Integer;.highestOneBit:(I)I",
"Ljava/lang/Integer;.intValue:()I",
"Ljava/lang/Integer;.longValue:()J",
"Ljava/lang/Integer;.lowestOneBit:(I)I",
"Ljava/lang/Integer;.numberOfLeadingZeros:(I)I",
"Ljava/lang/Integer;.numberOfTrailingZeros:(I)I",
"Ljava/lang/Integer;.shortValue:()S",
"Ljava/lang/Integer;.signum:(I)I",
"Ljava/lang/Integer;.toBinaryString:(I)Ljava/lang/String;",
"Ljava/lang/Integer;.toHexString:(I)Ljava/lang/String;",
"Ljava/lang/Integer;.toString:()Ljava/lang/String;",
"Ljava/lang/Integer;.toString:(I)Ljava/lang/String;",
"Ljava/lang/Integer;.toString:(II)Ljava/lang/String;",
"Ljava/lang/Integer;.valueOf:(I)Ljava/lang/Integer;",
"Ljava/lang/Long;.bitCount:(J)I",
"Ljava/lang/Long;.compareTo:(Ljava/lang/Long;)I",
"Ljava/lang/Long;.doubleValue:()D",
"Ljava/lang/Long;.equals:(Ljava/lang/Object;)Z",
"Ljava/lang/Long;.hashCode:()I",
"Ljava/lang/Long;.intValue:()I",
"Ljava/lang/Long;.highestOneBit:(J)J",
"Ljava/lang/Long;.longValue:()J",
"Ljava/lang/Long;.numberOfTrailingZeros:(J)I",
"Ljava/lang/Long;.signum:(J)I",
"Ljava/lang/Long;.toBinaryString:(J)Ljava/lang/String;",
"Ljava/lang/Long;.toHexString:(J)Ljava/lang/String;",
"Ljava/lang/Long;.toString:()Ljava/lang/String;",
"Ljava/lang/Long;.toString:(J)Ljava/lang/String;",
"Ljava/lang/Long;.valueOf:(J)Ljava/lang/Long;",
"Ljava/lang/Math;.IEEEremainder:(DD)D",
"Ljava/lang/Math;.abs:(J)J",
"Ljava/lang/Math;.abs:(I)I",
"Ljava/lang/Math;.abs:(F)F",
"Ljava/lang/Math;.abs:(D)D",
"Ljava/lang/Math;.acos:(D)D",
"Ljava/lang/Math;.asin:(D)D",
"Ljava/lang/Math;.atan:(D)D",
"Ljava/lang/Math;.atan2:(DD)D",
"Ljava/lang/Math;.cbrt:(D)D",
"Ljava/lang/Math;.ceil:(D)D",
"Ljava/lang/Math;.copySign:(FF)F",
"Ljava/lang/Math;.copySign:(DD)D",
"Ljava/lang/Math;.cos:(D)D",
"Ljava/lang/Math;.cosh:(D)D",
"Ljava/lang/Math;.exp:(D)D",
"Ljava/lang/Math;.expm1:(D)D",
"Ljava/lang/Math;.floor:(D)D",
"Ljava/lang/Math;.floorDiv:(II)I",
"Ljava/lang/Math;.floorDiv:(JJ)J",
"Ljava/lang/Math;.floorMod:(JJ)J",
"Ljava/lang/Math;.floorMod:(II)I",
"Ljava/lang/Math;.getExponent:(D)I",
"Ljava/lang/Math;.getExponent:(F)I",
"Ljava/lang/Math;.hypot:(DD)D",
"Ljava/lang/Math;.log:(D)D",
"Ljava/lang/Math;.log10:(D)D",
"Ljava/lang/Math;.log1p:(D)D",
"Ljava/lang/Math;.max:(II)I",
"Ljava/lang/Math;.max:(JJ)J",
"Ljava/lang/Math;.max:(FF)F",
"Ljava/lang/Math;.max:(DD)D",
"Ljava/lang/Math;.min:(FF)F",
"Ljava/lang/Math;.min:(DD)D",
"Ljava/lang/Math;.min:(II)I",
"Ljava/lang/Math;.min:(JJ)J",
"Ljava/lang/Math;.nextAfter:(DD)D",
"Ljava/lang/Math;.nextAfter:(FD)F",
"Ljava/lang/Math;.nextDown:(D)D",
"Ljava/lang/Math;.nextDown:(F)F",
"Ljava/lang/Math;.nextUp:(F)F",
"Ljava/lang/Math;.nextUp:(D)D",
"Ljava/lang/Math;.pow:(DD)D",
"Ljava/lang/Math;.random:()D",
"Ljava/lang/Math;.rint:(D)D",
"Ljava/lang/Math;.round:(D)J",
"Ljava/lang/Math;.round:(F)I",
"Ljava/lang/Math;.scalb:(FI)F",
"Ljava/lang/Math;.scalb:(DI)D",
"Ljava/lang/Math;.signum:(D)D",
"Ljava/lang/Math;.signum:(F)F",
"Ljava/lang/Math;.sin:(D)D",
"Ljava/lang/Math;.sinh:(D)D",
"Ljava/lang/Math;.sqrt:(D)D",
"Ljava/lang/Math;.tan:(D)D",
"Ljava/lang/Math;.tanh:(D)D",
"Ljava/lang/Math;.toDegrees:(D)D",
"Ljava/lang/Math;.toRadians:(D)D",
"Ljava/lang/Math;.ulp:(D)D",
"Ljava/lang/Math;.ulp:(F)F",
"Ljava/lang/Object;.getClass:()Ljava/lang/Class;",
"Ljava/lang/Short;.equals:(Ljava/lang/Object;)Z",
"Ljava/lang/Short;.shortValue:()S",
"Ljava/lang/Short;.toString:(S)Ljava/lang/String;",
"Ljava/lang/Short;.valueOf:(S)Ljava/lang/Short;",
"Ljava/lang/String;.compareTo:(Ljava/lang/String;)I",
"Ljava/lang/String;.compareToIgnoreCase:(Ljava/lang/String;)I",
"Ljava/lang/String;.concat:(Ljava/lang/String;)Ljava/lang/String;",
"Ljava/lang/String;.endsWith:(Ljava/lang/String;)Z",
"Ljava/lang/String;.equals:(Ljava/lang/Object;)Z",
"Ljava/lang/String;.equalsIgnoreCase:(Ljava/lang/String;)Z",
"Ljava/lang/String;.hashCode:()I",
"Ljava/lang/String;.indexOf:(I)I",
"Ljava/lang/String;.isEmpty:()Z",
"Ljava/lang/String;.indexOf:(Ljava/lang/String;)I",
"Ljava/lang/String;.indexOf:(II)I",
"Ljava/lang/String;.indexOf:(Ljava/lang/String;I)I",
"Ljava/lang/String;.lastIndexOf:(I)I",
"Ljava/lang/String;.lastIndexOf:(II)I",
"Ljava/lang/String;.lastIndexOf:(Ljava/lang/String;)I",
"Ljava/lang/String;.lastIndexOf:(Ljava/lang/String;I)I",
"Ljava/lang/String;.length:()I",
"Ljava/lang/String;.replace:(CC)Ljava/lang/String;",
"Ljava/lang/String;.startsWith:(Ljava/lang/String;)Z",
"Ljava/lang/String;.startsWith:(Ljava/lang/String;I)Z",
"Ljava/lang/String;.toLowerCase:()Ljava/lang/String;",
"Ljava/lang/String;.toLowerCase:(Ljava/util/Locale;)Ljava/lang/String;",
"Ljava/lang/String;.toString:()Ljava/lang/String;",
"Ljava/lang/String;.toUpperCase:()Ljava/lang/String;",
"Ljava/lang/String;.toUpperCase:(Ljava/util/Locale;)Ljava/lang/String;",
"Ljava/lang/String;.trim:()Ljava/lang/String;",
"Ljava/lang/String;.valueOf:(C)Ljava/lang/String;",
"Ljava/lang/String;.valueOf:(D)Ljava/lang/String;",
"Ljava/lang/String;.valueOf:(F)Ljava/lang/String;",
"Ljava/lang/String;.valueOf:(I)Ljava/lang/String;",
"Ljava/lang/String;.valueOf:(J)Ljava/lang/String;",
"Ljava/lang/String;.valueOf:(Z)Ljava/lang/String;",
"Ljava/lang/System;.identityHashCode:(Ljava/lang/Object;)I",
"Ljava/lang/Thread;.currentThread:()Ljava/lang/Thread;",
};
std::unordered_set<DexMethodRef*> get_pure_methods() {
std::unordered_set<DexMethodRef*> pure_methods;
for (auto const pure_method_name : pure_method_names) {
auto method_ref = DexMethod::get_method(pure_method_name);
if (method_ref == nullptr) {
TRACE(CSE, 1, "[get_pure_methods]: Could not find pure method %s",
str_copy(pure_method_name).c_str());
continue;
}
pure_methods.insert(method_ref);
}
return pure_methods;
}
std::unordered_set<DexMethod*> get_immutable_getters(const Scope& scope) {
std::unordered_set<DexMethod*> pure_methods;
walk::methods(scope, [&](DexMethod* method) {
if (method->rstate.immutable_getter()) {
pure_methods.insert(method);
}
});
return pure_methods;
}
namespace {
MethodOverrideAction get_base_or_overriding_method_action_impl(
const DexMethod* method,
const std::unordered_set<const DexMethod*>* methods_to_ignore,
bool ignore_methods_with_assumenosideeffects) {
if (method == nullptr || method::is_clinit(method) ||
method->rstate.no_optimizations()) {
return MethodOverrideAction::UNKNOWN;
}
if ((method->is_virtual() && is_interface(type_class(method->get_class()))) &&
(root(method) || !can_rename(method))) {
// We cannot rule out that there are dynamically added classes, created via
// Proxy.newProxyInstance, that override this method.
// So we assume the worst.
return MethodOverrideAction::UNKNOWN;
}
if (methods_to_ignore && methods_to_ignore->count(method)) {
return MethodOverrideAction::EXCLUDE;
}
if (ignore_methods_with_assumenosideeffects && assumenosideeffects(method)) {
return MethodOverrideAction::EXCLUDE;
}
if (method->is_external() || is_native(method)) {
return MethodOverrideAction::UNKNOWN;
}
if (is_abstract(method)) {
return MethodOverrideAction::EXCLUDE;
}
return MethodOverrideAction::INCLUDE;
}
} // namespace
MethodOverrideAction get_base_or_overriding_method_action(
const DexMethod* method,
const std::unordered_set<const DexMethod*>* methods_to_ignore,
bool ignore_methods_with_assumenosideeffects) {
return get_base_or_overriding_method_action_impl(
method, methods_to_ignore, ignore_methods_with_assumenosideeffects);
}
namespace {
template <typename HandlerFunc>
bool process_base_and_overriding_methods_impl(
const method_override_graph::Graph* method_override_graph,
const DexMethod* method,
const std::unordered_set<const DexMethod*>* methods_to_ignore,
bool ignore_methods_with_assumenosideeffects,
const HandlerFunc& handler_func) {
auto action = get_base_or_overriding_method_action_impl(
method, methods_to_ignore, ignore_methods_with_assumenosideeffects);
if (action == MethodOverrideAction::UNKNOWN ||
(action == MethodOverrideAction::INCLUDE &&
!handler_func(const_cast<DexMethod*>(method)))) {
return false;
}
// When the method isn't virtual, there are no overriden methods to consider.
if (!method->is_virtual()) {
return true;
}
// But even if there are overriden methods, don't look further when the
// method is to be ignored.
if (methods_to_ignore && methods_to_ignore->count(method)) {
return true;
}
if (ignore_methods_with_assumenosideeffects && assumenosideeffects(method)) {
return true;
}
// When we don't have a method-override graph, let's be conservative and give
// up.
if (!method_override_graph) {
return false;
}
// Okay, let's process all overridden methods just like the base method.
return method_override_graph::all_overriding_methods(
*method_override_graph, method, [&](const DexMethod* overriding_method) {
action = get_base_or_overriding_method_action(
overriding_method, methods_to_ignore,
ignore_methods_with_assumenosideeffects);
if (action == MethodOverrideAction::UNKNOWN ||
(action == MethodOverrideAction::INCLUDE &&
!handler_func(const_cast<DexMethod*>(overriding_method)))) {
return false;
}
return true;
});
return true;
}
} // namespace
bool process_base_and_overriding_methods(
const method_override_graph::Graph* method_override_graph,
const DexMethod* method,
const std::unordered_set<const DexMethod*>* methods_to_ignore,
bool ignore_methods_with_assumenosideeffects,
const std::function<bool(DexMethod*)>& handler_func) {
return process_base_and_overriding_methods_impl(
method_override_graph,
method,
methods_to_ignore,
ignore_methods_with_assumenosideeffects,
handler_func);
}
namespace {
AccumulatingTimer s_wto_timer("compute_locations_closure_wto");
class WtoOrdering {
static constexpr const DexMethod* WTO_ROOT = nullptr;
struct FirstIterationData {
std::vector<const DexMethod*> root_cache;
std::unordered_map<const DexMethod*, std::vector<const DexMethod*>>&
inverse_dependencies;
const std::vector<const DexMethod*> empty{};
const std::vector<const DexMethod*>& get(const DexMethod* m) {
if (m == WTO_ROOT) {
// Pre-initialized and pre-sorted
return root_cache;
}
auto it = inverse_dependencies.find(m);
if (it != inverse_dependencies.end()) {
// Pre-sorted
return it->second;
}
return empty;
}
};
static FirstIterationData create_first_iteration_data(
std::unordered_map<const DexMethod*, std::vector<const DexMethod*>>&
inverse_dependencies,
const std::unordered_set<const DexMethod*>& impacted_methods) {
std::vector<const DexMethod*> wto_nodes{WTO_ROOT};
wto_nodes.reserve(wto_nodes.size() + impacted_methods.size());
wto_nodes.insert(wto_nodes.end(), impacted_methods.begin(),
impacted_methods.end());
// In the first iteration, besides computing the sorted root successors, we
// also sort all inverse_dependencies entries in-place. They represent the
// full successor vectors.
std::vector<const DexMethod*> root_cache;
workqueue_run<const DexMethod*>(
[&inverse_dependencies, &root_cache,
&impacted_methods](const DexMethod* m) {
if (m == WTO_ROOT) {
root_cache = get_sorted_impacted_methods(impacted_methods);
return;
}
auto it = inverse_dependencies.find(m);
if (it != inverse_dependencies.end()) {
auto& entries = it->second;
entries.shrink_to_fit();
std::sort(entries.begin(), entries.end(), compare_dexmethods);
}
},
wto_nodes);
return {std::move(root_cache), inverse_dependencies};
}
struct OtherIterationData {
InsertOnlyConcurrentMap<const DexMethod*, std::vector<const DexMethod*>>
concurrent_cache;
const std::vector<const DexMethod*>& get(const DexMethod* const& m) {
return concurrent_cache.at_unsafe(m);
}
};
static OtherIterationData create_other_iteration_data(
std::unordered_map<const DexMethod*, std::vector<const DexMethod*>>&
inverse_dependencies,
const std::unordered_set<const DexMethod*>& impacted_methods) {
std::vector<const DexMethod*> wto_nodes{WTO_ROOT};
wto_nodes.reserve(wto_nodes.size() + impacted_methods.size());
wto_nodes.insert(wto_nodes.end(), impacted_methods.begin(),
impacted_methods.end());
// In subsequent iteration, besides computing the sorted root successors
// again, we also filter all previously sorted inverse_dependencies entries.
InsertOnlyConcurrentMap<const DexMethod*, std::vector<const DexMethod*>>
concurrent_cache;
workqueue_run<const DexMethod*>(
[&impacted_methods, &concurrent_cache,
&inverse_dependencies](const DexMethod* m) {
std::vector<const DexMethod*> successors;
if (m == WTO_ROOT) {
// Re-initialize and re-sort
successors = get_sorted_impacted_methods(impacted_methods);
}
auto it = inverse_dependencies.find(m);
if (it != inverse_dependencies.end()) {
// Note that we are filtering on an already pre-sorted vector
for (auto n : it->second) {
if (impacted_methods.count(n)) {
successors.push_back(n);
}
}
}
auto [_, emplaced] =
concurrent_cache.emplace(m, std::move(successors));
always_assert(emplaced);
},
wto_nodes);
return {std::move(concurrent_cache)};
}
static std::vector<const DexMethod*> get_sorted_impacted_methods(
const std::unordered_set<const DexMethod*>& impacted_methods) {
std::vector<const DexMethod*> successors;
successors.reserve(impacted_methods.size());
successors.insert(successors.end(), impacted_methods.begin(),
impacted_methods.end());
std::sort(successors.begin(), successors.end(), compare_dexmethods);
return successors;
}
static std::vector<const DexMethod*> sort_by_inverse_deps(
const std::unordered_set<const DexMethod*>& impacted_methods,
const std::unordered_map<const DexMethod*, std::vector<const DexMethod*>>&
inverse_dependencies) {
// First translate to pair to avoid repeated map lookups.
std::vector<std::pair<const DexMethod*, size_t>> sorted_by_inv_deps;
sorted_by_inv_deps.reserve(impacted_methods.size());
std::transform(impacted_methods.begin(), impacted_methods.end(),
std::back_inserter(sorted_by_inv_deps),
[&inverse_dependencies](auto* m) {
auto it = inverse_dependencies.find(m);
return std::make_pair(m, it != inverse_dependencies.end()
? it->second.size()
: 0);
});
std::sort(sorted_by_inv_deps.begin(), sorted_by_inv_deps.end(),
[](const std::pair<const DexMethod*, size_t>& lhs,
const std::pair<const DexMethod*, size_t>& rhs) {
if (lhs.second != rhs.second) {
return lhs.second > rhs.second;
}
return compare_dexmethods(lhs.first, rhs.first);
});
std::vector<const DexMethod*> res;
res.reserve(impacted_methods.size());
std::transform(sorted_by_inv_deps.begin(), sorted_by_inv_deps.end(),
std::back_inserter(res),
[](const auto& p) { return p.first; });
return res;
}
// We saw big slowdowns when there are too many components, possibly
// driven by the fact there is a lot of dependencies.
template <typename SuccFn>
static void run_wto(const SuccFn& succ_fn,
std::vector<const DexMethod*>& ordered_impacted_methods) {
sparta::WeakTopologicalOrdering<const DexMethod*> wto(WTO_ROOT, succ_fn);
wto.visit_depth_first([&ordered_impacted_methods](const DexMethod* m) {
if (m) {
ordered_impacted_methods.push_back(m);
}
});
}
static bool should_use_wto(
const std::unordered_set<const DexMethod*>& impacted_methods,
const std::unordered_map<const DexMethod*, std::vector<const DexMethod*>>&
inverse_dependencies) {
size_t impacted_methods_size = impacted_methods.size();
size_t inv_dep_sum{0}, inv_dep_max{0};
for (auto& entry : inverse_dependencies) {
inv_dep_sum += entry.second.size();
inv_dep_max = std::max(inv_dep_max, entry.second.size());
}
auto inv_dep_avg = ((double)inv_dep_sum) / inverse_dependencies.size();
// Purity is too low-level for nice configuration switches. Think
// about it.
TRACE(CSE, 4,
"UseWto: impacted methods = %zu inverse_deps_max = %zu "
"inverse_deps avg = %.2f",
impacted_methods_size, inv_dep_max, inv_dep_avg);
return inv_dep_avg < kWtoOrderingThreshold;
}
public:
static std::vector<const DexMethod*> order_impacted_methods(
const std::unordered_set<const DexMethod*>& impacted_methods,
std::unordered_map<const DexMethod*, std::vector<const DexMethod*>>&
inverse_dependencies,
size_t iterations) {
Timer prepare_wto{"Prepare Ordering"};
auto wto_timer_scope = s_wto_timer.scope();
std::vector<const DexMethod*> ordered_impacted_methods;
// To avoid std::function overhead we have to split here.
if (iterations == 1 &&
should_use_wto(impacted_methods, inverse_dependencies)) {
auto first_data =
create_first_iteration_data(inverse_dependencies, impacted_methods);
run_wto(
[&first_data](
const DexMethod* m) -> const std::vector<const DexMethod*>& {
return first_data.get(m);
},
ordered_impacted_methods);
} else if (iterations == 1) {
// Simple sorting for determinism.
ordered_impacted_methods =
sort_by_inverse_deps(impacted_methods, inverse_dependencies);
} else {
auto other_data =
create_other_iteration_data(inverse_dependencies, impacted_methods);
run_wto(
[&other_data](
const DexMethod* m) -> const std::vector<const DexMethod*>& {
return other_data.get(m);
},
ordered_impacted_methods);
}
return ordered_impacted_methods;
}
};
template <typename InitFuncT>
size_t compute_locations_closure_impl(
const Scope& scope,
const method_override_graph::Graph* method_override_graph,
const InitFuncT& init_func,
std::unordered_map<const DexMethod*, CseUnorderedLocationSet>* result) {
// 1. Let's initialize known method read locations and dependencies by
// scanning method bodies
InsertOnlyConcurrentMap<const DexMethod*, LocationsAndDependencies>
method_lads;
{
Timer t{"Initialize LADS"};
walk::parallel::methods(scope, [&](DexMethod* method) {
auto lads = init_func(method);
if (lads) {
method_lads.emplace(method, std::move(*lads));
}
});
}
// 2. Compute inverse dependencies so that we know what needs to be recomputed
// during the fixpoint computation, and determine set of methods that are
// initially "impacted" in the sense that they have dependencies.
std::unordered_map<const DexMethod*, std::vector<const DexMethod*>>
inverse_dependencies;
std::unordered_set<const DexMethod*> impacted_methods;
{
Timer t{"Compute inverse dependencies"};
for (auto&& [method, lads] : method_lads) {
if (!lads.dependencies.empty()) {
for (auto d : lads.dependencies) {
inverse_dependencies[d].push_back(method);
}
impacted_methods.insert(method);
}
}
}
// 3. Let's try to (semantically) inline locations, computing a fixed
// point. Methods for which information is directly or indirectly absent
// are equivalent to a general memory barrier, and are systematically
// pruned.
// TODO: Instead of custom fixpoint computation using WTO, consider using the
// MonotonicFixpointIterator, operating on a callgraph, capture the
// dependencies, and have the Locations as the abstract domain.
size_t iterations = 0;
while (!impacted_methods.empty()) {
iterations++;
Timer t{std::string("Iteration ") + std::to_string(iterations)};
// We order the impacted methods in a deterministic way that's likely
// helping to reduce the number of needed iterations.
auto ordered_impacted_methods = WtoOrdering::order_impacted_methods(
impacted_methods, inverse_dependencies, iterations);
impacted_methods.clear();
std::vector<const DexMethod*> changed_methods;
for (const DexMethod* method : ordered_impacted_methods) {
auto& lads = method_lads.at_unsafe(method);
bool unknown = false;
size_t lads_locations_size = lads.locations.size();
for (const DexMethod* d : lads.dependencies) {
if (d == method) {
continue;
}
auto it = method_lads.find(d);
if (it == method_lads.end()) {
unknown = true;
break;
}
const auto& other_locations = it->second.locations;
lads.locations.insert(other_locations.begin(), other_locations.end());
}
if (unknown || lads_locations_size < lads.locations.size()) {
// something changed
changed_methods.push_back(method);
if (unknown) {
method_lads.erase_unsafe(method);
}
}
}
// Given set of changed methods, determine set of dependents for which
// we need to re-run the analysis in another iteration.
for (auto changed_method : changed_methods) {
auto it = inverse_dependencies.find(changed_method);
if (it == inverse_dependencies.end()) {
continue;
}
// remove inverse dependency entries as appropriate
auto& entries = it->second;
std20::erase_if(entries,
[&](auto* m) { return !method_lads.count_unsafe(m); });
if (entries.empty()) {
// remove inverse dependency
inverse_dependencies.erase(changed_method);
} else {
// add inverse dependencies entries to impacted methods
impacted_methods.insert(entries.begin(), entries.end());
}
}
}
// For all methods which have a known set of locations at this point,
// persist that information
for (auto&& [method, lads] : method_lads) {
result->emplace(method, std::move(lads.locations));
}
return iterations;
}
} // namespace
size_t compute_locations_closure(
const Scope& scope,
const method_override_graph::Graph* method_override_graph,
const std::function<boost::optional<LocationsAndDependencies>(DexMethod*)>&
init_func,
std::unordered_map<const DexMethod*, CseUnorderedLocationSet>* result) {
return compute_locations_closure_impl(scope, method_override_graph, init_func,
result);
}
// Helper function that invokes compute_locations_closure, providing initial
// set of locations indicating whether a function only reads locations (and
// doesn't write). Via additional flags it can be selected whether...
// - [ignore_methods_with_assumenosideeffects] to ignore invoked methods that
// are marked with assumenosideeffects
// - [for_conditional_purity] instructions that rule out conditional purity
// should cause methods to be treated like methods with unknown behavior; in
// particular, this rules out instructions that create new object instances,
// as those may leak, and thus multiple invocations of such a method could
// never be reduced by CSE.
// - [compute_locations] the actual locations that are being read are computed
// and returned; if false, then an empty set indicates that a particular
// function only reads (some unknown set of) locations.
static size_t analyze_read_locations(
const Scope& scope,
const method_override_graph::Graph* method_override_graph,
const method::ClInitHasNoSideEffectsPredicate& clinit_has_no_side_effects,
const std::unordered_set<DexMethodRef*>& pure_methods,
bool ignore_methods_with_assumenosideeffects,
bool for_conditional_purity,
bool compute_locations,
std::unordered_map<const DexMethod*, CseUnorderedLocationSet>* result) {
std::unordered_set<const DexMethod*> pure_methods_closure;
{
Timer t{"Pure methods closure"};
for (auto pure_method_ref : pure_methods) {
auto pure_method = pure_method_ref->as_def();
if (pure_method == nullptr) {
continue;
}
pure_methods_closure.insert(pure_method);
if (pure_method->is_virtual() && method_override_graph) {
const auto overriding_methods =
method_override_graph::get_overriding_methods(
*method_override_graph, pure_method);
pure_methods_closure.insert(overriding_methods.begin(),
overriding_methods.end());
}
}
}
return compute_locations_closure_impl(
scope, method_override_graph,
[&](DexMethod* method) -> boost::optional<LocationsAndDependencies> {
auto action = get_base_or_overriding_method_action_impl(
method, &pure_methods_closure,
ignore_methods_with_assumenosideeffects);
if (action == MethodOverrideAction::UNKNOWN) {
return boost::none;
}
LocationsAndDependencies lads;
if (!process_base_and_overriding_methods_impl(
method_override_graph, method, &pure_methods_closure,
ignore_methods_with_assumenosideeffects,
[&](DexMethod* other_method) {
if (other_method != method) {
lads.dependencies.insert(other_method);
}
return true;
})) {
return boost::none;
}
if (action == MethodOverrideAction::EXCLUDE) {
return lads;
}
bool unknown = false;
editable_cfg_adapter::iterate_with_iterator(
method->get_code(), [&](const IRList::iterator& it) {
auto insn = it->insn;
auto opcode = insn->opcode();
switch (opcode) {
case OPCODE_MONITOR_ENTER:
case OPCODE_MONITOR_EXIT:
case OPCODE_FILL_ARRAY_DATA:
case OPCODE_THROW:
unknown = true;
break;
case IOPCODE_INIT_CLASS:
unknown = true;
break;
case OPCODE_NEW_INSTANCE:
if (for_conditional_purity ||
!clinit_has_no_side_effects(insn->get_type())) {
unknown = true;
}
break;
case OPCODE_NEW_ARRAY:
case OPCODE_FILLED_NEW_ARRAY:
if (for_conditional_purity) {
unknown = true;
}
break;
case OPCODE_INVOKE_SUPER:
// TODO: Support properly.
unknown = true;
break;
default:
if (opcode::is_an_aput(opcode) || opcode::is_an_iput(opcode) ||
opcode::is_an_sput(opcode)) {
unknown = true;
} else if (opcode::is_an_aget(opcode) ||
opcode::is_an_iget(opcode) ||
opcode::is_an_sget(opcode)) {
auto location = get_read_location(insn);
if (location ==
CseLocation(
CseSpecialLocations::GENERAL_MEMORY_BARRIER)) {
unknown = true;
} else {
if (opcode::is_an_sget(opcode) &&
(!clinit_has_no_side_effects(
location.get_field()->get_class()))) {
unknown = true;
} else if (compute_locations) {
lads.locations.insert(location);
}
}
} else if (opcode::is_an_invoke(opcode)) {
auto invoke_method = resolve_method(
insn->get_method(), opcode_to_search(opcode), method);
if ((invoke_method && opcode::is_invoke_static(opcode) &&
(!clinit_has_no_side_effects(
invoke_method->get_class()))) ||
!process_base_and_overriding_methods_impl(
method_override_graph, invoke_method,
&pure_methods_closure,
ignore_methods_with_assumenosideeffects,
[&](DexMethod* other_method) {
if (other_method != method) {
lads.dependencies.insert(other_method);
}
return true;
})) {
unknown = true;
}
}
break;
}
return unknown ? editable_cfg_adapter::LOOP_BREAK
: editable_cfg_adapter::LOOP_CONTINUE;
});
if (unknown) {
return boost::none;
}
return lads;
},
result);
}
size_t compute_conditionally_pure_methods(
const Scope& scope,
const method_override_graph::Graph* method_override_graph,
const method::ClInitHasNoSideEffectsPredicate& clinit_has_no_side_effects,
const std::unordered_set<DexMethodRef*>& pure_methods,
std::unordered_map<const DexMethod*, CseUnorderedLocationSet>* result) {
Timer t("compute_conditionally_pure_methods");
auto iterations = analyze_read_locations(
scope, method_override_graph, clinit_has_no_side_effects, pure_methods,
/* ignore_methods_with_assumenosideeffects */ false,
/* for_conditional_purity */ true,
/* compute_locations */ true, result);
for (auto& p : *result) {
TRACE(CSE, 4, "[CSE] conditionally pure method %s: %s", SHOW(p.first),
SHOW(&p.second));
}
return iterations;
}
size_t compute_no_side_effects_methods(
const Scope& scope,
const method_override_graph::Graph* method_override_graph,
const method::ClInitHasNoSideEffectsPredicate& clinit_has_no_side_effects,
const std::unordered_set<DexMethodRef*>& pure_methods,
std::unordered_set<const DexMethod*>* result) {
Timer t("compute_no_side_effects_methods");
std::unordered_map<const DexMethod*, CseUnorderedLocationSet>
method_locations;
auto iterations = analyze_read_locations(
scope, method_override_graph, clinit_has_no_side_effects, pure_methods,
/* ignore_methods_with_assumenosideeffects */ true,
/* for_conditional_purity */ false,
/* compute_locations */ false, &method_locations);
for (auto& p : method_locations) {
TRACE(CSE, 4, "[CSE] no side effects method %s", SHOW(p.first));
result->insert(p.first);
}
return iterations;
}
bool has_implementor(const method_override_graph::Graph* method_override_graph,
const DexMethod* method) {
// For methods of an annotation interface, a synthetic trivial implementation
// is generated by the runtime.
if (is_annotation(type_class(method->get_class()))) {
return true;
}
bool found_implementor = false;
auto res = process_base_and_overriding_methods_impl(
method_override_graph, method, /* methods_to_ignore */ nullptr,
/* ignore_methods_with_assumenosideeffects */ false, [&](DexMethod*) {
found_implementor = true;
return true;
});
return !res || found_implementor;
}
``` |
Alexander Benson (1872 - November 8, 1947) was an American diplomat.
Biography
He was born in 1872. Having served as Secretary of Legation to Bolivia, he was appointed Second Secretary of the Embassy of the United States at St. Petersburg, Russia in 1911. In 1913, as Second Secretary, he was put in charge of the Embassy of the United States in Rome. He died on November 9, 1947.
References
1872 births
1947 deaths
American diplomats |
```smalltalk
using System.Collections.Generic;
using Volo.Abp;
namespace Volo.CmsKit.Web.Icons;
public static class IconDictionaryHelper
{
public static string GetLocalizedIcon(
Dictionary<string, LocalizableIconDictionary> dictionary,
string name,
string cultureName = null)
{
var icon = dictionary.GetOrDefault(name);
if (icon == null)
{
throw new AbpException($"No icon defined for the item with name '{name}'");
}
return icon.GetLocalizedIconOrDefault(cultureName);
}
}
``` |
"Living in a Tree" () is the title name from a Chinese writing question in Zhejiang Province's National College Entrance Examination paper in the year of 2020. It became popular because of an essay written by a high school student. The content of the essay included a lot of rarely-used Chinese characters and quotes by famous people. The grading team gave such an essay the highest score, 60/60, even though the first grader gave it a 39/60, and the second and third graders gave it 55/60.
A journal editing group hosted by Zhejiang International Studies University published that essay along with a comment from the leader of the grading team, Chen Jianxin, through their official WeChat account on August 2, 2020, but the WeChat post was soon being deleted.
Fan Yiying of Sixth Tone wrote that the contents included "abstruse European philosophy, from Nietzsche and MacIntyre to Heidegger and Wittgenstein".
When users on social media in that country learned about the paper, according to Fan, the conversation became "heated". After the publication the Zhejiang Education Examinations Authority began investigating one of the graders for having a conflict of interest in also writing test preparation guides.
Content
Notefoot
References
External links
Education in China
WeChat
Sina Weibo controversies |
Stroet is a village in the Dutch province of North Holland. It is a part of the municipality of Schagen, and lies about 11 km north of Heerhugowaard.
The village was first mentioned in 1343 as Stroeden, and means "soggy area with shrubbery". Stroet used to have a wind mill, but it was demolished in the early 20th century.
References
Schagen
Populated places in North Holland |
LeDock is a proprietary, flexible molecular docking software designed for the purpose of docking ligands with target proteins. It is available for Linux, macOS, and Windows.
It can be ran as a standalone program or entirely from Jupyter notebook. It supports only the Tripos Mol2 file format - which is a file format commonly used in computational chemistry and molecular modeling.
Introduction
Methodology: LeDock utilizes a simulated annealing and genetic algorithm approach for facilitating the docking process of ligands with protein targets. The software employs a knowledge-based scoring scheme that is derived from extensive prospective virtual screening campaigns. It is categorized as using a flexible docking method.
Performance
Performance: In a comprehensive study involving 2002 protein-ligand complexes, LeDock demonstrated a notable level of accuracy in predicting molecular poses. Moreover, the Linux version offers command line tools to run high-throughput virtual screening of different large molecular libraries in the cloud.
In a computational study screening for inhibitors of Mycobacterium tuberculosis DNA gyrase B, LeDock demonstrated better performance than AutoDock Vina at reproducing experimental binding affinity data. When benchmarked on a set of 140 known gyrase inhibitors, the predicted binding energies from LeDock docking experiments showed a significantly higher correlation to experimental inhibition constant (pKi) values compared to Vina. Docking software efficacy varies by target site, so running experimental benchmarks when choosing a docking software is advised.
A 2017 review evaluated the accuracy of different docking software on a diverse set of protein-ligand complexes. LeDock was able to effectively sample ligand conformational space and identify near-native binding poses for a significant proportion of the test cases. Its flexible docking protocol was pointed out as a key factor for accurate docking.
See also
Drug design
Macromolecular docking
Molecular mechanics
Molecular modelling
Protein structure
Protein design
Software for molecular mechanics modeling
List of protein-ligand docking software
Molecular design software
Lead Finder
Virtual screening
Scoring functions for docking
References
External links
Official website
Medicinal chemistry
Drug discovery
Molecular modelling software |
```objective-c
#ifndef _DYNAMIC_NEEDLEMANWUNSCH_
#define _DYNAMIC_NEEDLEMANWUNSCH_
#include "Eigen/Core"
#include <vector>
#include <iostream>
#include "basics.h"
#ifdef _MSC_VER
#include <float.h> // for _isnan() on VC++
#define isnan(x) _isnan(x) // VC++ uses _isnan() instead of isnan()
//#else
//#include <math.h> // for isnan() everywhere else
#endif
namespace DynamicProg{
/*!
Global alignment
cmp: must define an eval function
*/
template <typename Scalar, class DataType, template <typename, class> class Cmp >
class NeedlemanWunsch{
private:
Cmp<Scalar, DataType> _cmp;
Scalar _gapPenalty;
Scalar _confidence;
public:
typedef typename Eigen::Matrix<DynamicStep<Scalar>, Eigen::Dynamic, Eigen::Dynamic> StepMatrix;
public:
inline NeedlemanWunsch(): _gapPenalty(-1), _confidence(0) {}
inline DynamicStep<Scalar> eval (const DataType& v1,
const DataType& v2,
unsigned int x,
unsigned int y,
const StepMatrix& matrix, double multiplier) const;
inline Scalar eval_couples (const DataType& v1,
const DataType& v2,
unsigned int x,
unsigned int y,
const StepMatrix& matrix, double multiplier) const;
inline void setConfidence(double conf);
inline void setGapPenalty(Scalar gapPenalty) {_gapPenalty = gapPenalty;}
inline Scalar confidence() const { return _confidence;}
}; //class NeedlemanWunsch
template <typename Scalar, class DataType, template <typename, class> class Cmp >
DynamicStep<Scalar>
NeedlemanWunsch<Scalar, DataType, Cmp >::eval( const DataType& v1,
const DataType& v2,
unsigned int x,
unsigned int y,
const StepMatrix& matrix, double multiplier) const{
//std::cout << "here" << std::endl;
DynamicStep<Scalar>nei[3]; // will contain top, left and topleft
nei[2] = DynamicStep<Scalar> (matrix(x-1, y-1).value + _cmp.eval(v1, v2),
DynamicRelation::TopLeft);
return nei[2];
}
template <typename Scalar, class DataType, template <typename, class> class Cmp >
Scalar
NeedlemanWunsch<Scalar, DataType, Cmp >::eval_couples( const DataType& v1,
const DataType& v2,
unsigned int x,
unsigned int y,
const StepMatrix& /*matrix*/, double multiplier) const{
return _cmp.eval(v1, v2);
}
template <typename Scalar, class DataType, template <typename, class> class Cmp >
void
NeedlemanWunsch<Scalar, DataType, Cmp >::setConfidence(double conf)
{
_confidence = conf;
}
} // namespace DynamicProg
#endif // _DYNAMIC_PATH
``` |
This is the order of battle for the Battle of Villers-Bocage, a World War II battle on 13 June 1944 between British and German forces in Normandy, France as part of Operation Perch.
British order of battle
The 22nd Armoured Brigade group, was made up of Corps and Divisional troops from XXX Corps and the 7th Armoured Division as well as elements of the divisional 22nd Armoured Brigade and 131st (Queens) Infantry Brigade.
The Brigade group was placed under the command of the 22nd Armoured Brigade commanding officer, Brigadier W. R. N. "Looney" Hinde.
XXX Corps - Lieutenant-General G. C. Bucknall
7th Armoured Division - Major-General G. W. E. J. Erskine
22nd Armoured Brigade group (Brigadier W. R. N. Hinde)
1st Battalion Rifle Brigade
A Company (minus Scout platoon), C and I Companies
Support Company, one AT Section attached to each rifle company
1/5th Battalion Queen's Royal Regiment (West Surrey)
A, B, C and D Companies
1/7th Battalion Queen's Royal Regiment (West Surrey)
A, B, C and D Companies
4th County of London Yeomanry (Sharpshooters) (Cromwell, Sherman Firefly and M5 Stuart tanks)
Headquarters Troop
Reconnaissance Troop
A, B and C Squadrons
5th Regiment, Royal Horse Artillery (Sexton self-propelled gun)
C, G and K Batteries
5th Royal Tank Regiment (Cromwell, Firefly and M5 Stuarts)
A, B and C Squadrons
8th (King's Royal Irish) Hussars (Cromwell)
Headquarters Troop
A and B Squadrons
11th Hussars (Prince Albert's Own) (Daimler Armoured Car)
Headquarters Troop
C Squadron
65th (Norfolk Yeomanry) Anti-Tank Regiment, Royal Artillery
260th Anti Tank Battery (M10 3in SP Gun )
German order of battle
I SS Panzer Corps - SS-Oberst-Gruppenführer (General) Josef Dietrich
Panzer-Lehr-Division - Generalleutnant (Major-general) Fritz Bayerlein
Panzer Lehr Regiment 130 (Panzer IV)
SS Heavy Panzer Battalion 101 (Schwere SS-Panzer-Abteilung 101) (SS-Obersturmbannführer Heinz von Westernhagen)
1st Panzerkompanie (Tiger I) Rolf Möbius
2nd Panzerkompanie (Tiger I) Michael Wittmann
4th Escort Company
XLVII Panzer Corps - General der Panzertruppen (lieutenant-general) Hans Freiherr von Funck
2nd Panzer Division (elements) - Major-General Heinrich Freiherr von Lüttwitz
See also
List of orders of battle
Notes and references
Notes
Citations
Bibliography
External links
World War II orders of battle
Military history of Normandy
Battle for Caen
Villers-Bocage
Battles of World War II involving Germany |
San Jorge Island is the second largest island in the Isabel Province, Solomon Islands.
Geography
The terrain elevation above sea level has been estimated at about 159 metres, but SRTM data shows a maximum elevation of about 470 metres.
The island lies at the southern end of Santa Isabel Island and borders Thousand Ships Bay. San Jorge has an area of and has less than 1000 inhabitants living in four villages. The island possesses substantial nickel ore deposites, and international mining companies consider developing mining projects. Also, peridotites associated with pyroxenites, with rare olivine and spinel, are exposed on the island.
History
The first recorded sighting by Europeans was by the Spanish expedition of Álvaro de Mendaña on 21 April 1568. More precisely the sighting was due to a local voyage done by a small boat, in the accounts the brigantine Santiago, commanded by Maestre de Campo Pedro Ortega Valencia and having Hernán Gallego as pilot. They were who charted it with its present-day name, San Jorge, and also who named the narrow channel separating San Jorge from Santa Isabel Island as the Ortega channel after the commander of the expedition.
References
Islands of the Solomon Islands |
First Baptist Church is a Baptist in Toronto, Ontario, affiliated with Canadian Baptists of Ontario and Quebec. It is both the first Baptist congregation in Toronto and the oldest black institution in the city. Formed by fugitive enslaved persons, the church played a large role in the abolitionist movement, including hosting lectures against slavery and offering aid to fugitives.
In its long history, the church's location has changed multiple times. Today it holds service at 101 Huron Street.
History
The church was formed by 12 fugitive enslaved persons in 1826, under the leadership of Elder Washington Christian. Reverend Christian was a former enslaved individual who established multiple Baptist churches in Canada.
It had not been possible to attend existing white churches because the fugitives were required to have a letter from their old church and to pay their old slave masters for the money lost due to their escape.
At first, services were held outside or in the homes of members of the church. Reverend Christian rented a masonic temple in 1827. Although some white congregants attended the black church's services, a church for white members was established in 1829.
There were reportedly 66 members of the First Baptist Church in 1837. In the same year, a visitor noted that half the congregation was white, half was black.
In 1841, the congregation moved to its first permanent location after being gifted land by the family of Squires McCutcheon to build a church at Queen Street and Victoria Street. Soon after, white members left for a different Baptist church. In 1843, Elder Washington Christian went to Jamaica for two years, returning with enough raised funds to pay off the new church's mortgage. The location was known as "First Coloured Calvinistic Baptist Church" or "Queen Street Coloured Baptist Church."
In 1905, it relocated to University Avenue and Edward Street, at which point it was known as "University Avenue Baptist Church".The name "First Baptist Church" began being used in the 1940s.
The church relocated to its current address at Huron Street and D'Arcy Street in 1955. The previous property was sold to Shell Oil Company and the building was demolished.
In 2000, baptized membership was approximately 140 and about the same number attended Sunday church services.
Locations
References
External links
Baptist churches in Toronto
Black Canadian culture in Toronto
19th-century Baptist churches
20th-century Baptist churches
Demolished buildings and structures in Toronto
Religious organizations established in 1826
1826 establishments in Upper Canada
20th-century churches in Canada
19th-century churches in Canada |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.