text stringlengths 1 22.8M |
|---|
In computing, XFixes is an X Window System extension which makes useful additions to the X11 protocol. It was started in 2003 by Keith Packard. It first appeared in the KDrive X server and later in X.Org Server version 6.8.0.
The extension implements a collection of unrelated additions to the protocol. The theme of the collection is small additions to remove important defects in the protocol that can't be worked around using the pure X11 protocol.
The point of implementing these additions in an extension is to leave the core server code, and a server that does not include the XFixes extension, implementing the original pure X11 protocol. However, as the additions are designed in a backward compatible way, there is no practical reason for a server not to implement them. The client and server can always negotiate down to the additions that both understand.
Version history
Version 1 of the extension included Save Set processing changes (to make embedding applications more reliable), selection notification events (add events sent when selection ownership is asserted) and cursor tracking (requests allowing the image to be tracked reliably).
Version 2 of the extension adds region objects and cursor names.
Version 3 allows existing region objects to be enlarged.
Version 4 allows the mouse cursor to be hidden over specific windows.
Version 5 introduces pointer barriers, which allows using easy-to-reach locations (according to Fitts's Law) even in multi-monitor configurations.
Controversy
XFixes was a source of controversy when Packard committed the extension to the XFree86 project hours before the feature freeze window for XFree86 4.3.0 began in December 2002 without prior approval of the XFree86's Core Team (a cathedral-style group that were allowed to commit changes to the project, of which Packard was a member). Packard was stripped of his commit rights as a result (but remained in the project's Core Team until March 2003) and the extension was backed out six weeks later.
References
External links
X Fixes extension (freedesktop.org)
The X Fixes Extension, Latest Official Specifications
X Window extensions |
"When You Fall in Love" is a song written by Steve Earle and John Scott Sherrill, and recorded by American country music artist Johnny Lee. It was released in May 1982 as the third and final single from the album Bet Your Heart on Me. The song reached No. 14 on the Billboard Hot Country Singles & Tracks chart and peaked at No. 46 on the Canadian RPM Country Tracks chart.
Chart performance
References
1982 singles
1981 songs
Johnny Lee (singer) songs
Songs written by John Scott Sherrill
Songs written by Steve Earle
Song recordings produced by Jim Ed Norman
Asylum Records singles |
Buckland in the Moor is a village and civil parish in the Teignbridge district of Devon, England. According to the 2001 census it had a population of 94. The village is in Dartmoor.
According to Elias Tozer (1825–1873) a ritual until recently had been observed in the village of Buckland-in-the-Moor on Midsummer Day in which the youth of the village would sacrifice a sheep on the block of granite and sprinkle themselves with the blood. He could not find what the significance of the ritual was, but says it was thought to have pre-Christian Celtic origins.
The church is made of stone quarried on the moor. The face of the clock spells out "My Dear Mother". The baptismal font is Norman, and decorated with leaves and stars.
Nearby there is a viewpoint called Buckland Beacon where may also be found the 10 Commandment Stones (1282 ft).
In 1927 the Lord of Buckland Manor, Mr Whitley, learnt that parliament had rejected a proposed revision of the Book of Common Prayer using Jesus' Two Commandments instead of Moses' Ten, at Holy Communion.
He celebrated by engaging Mr W A Clements, a stonemason from Exeter, to engrave granite stones in situ on Buckland Beacon with the Ten Commandments. He started work on 15 December 1927 and completed the job on 14 June 1928. Whilst engraving the stones he lived in a cow shed on the site and was supplied each week with a loaf of bread by Mr Whitley.
In later years Mr Clements said, "Day after day I was on my knees chipping away and I wondered if the originator of the Commandments suffered from an aching back and sore knees as I did". A glance at the stones reveals eleven commandments, the eleventh inscribed, "A new commandment I give unto you, that ye love one another. John 13 v34."
References
External links
Villages in Devon |
Aleksei Andreyevich Alekseyev (; born 12 June 1988) is a former Russian professional football player.
Club career
He played 3 seasons in the Russian Football National League for FC Baltika Kaliningrad.
External links
1988 births
Living people
Russian men's footballers
Men's association football forwards
FC Baltika Kaliningrad players
FK Ventspils players
Latvian Higher League players
Russian expatriate men's footballers
Expatriate men's footballers in Latvia
People from Krasnogorsk, Moscow Oblast
Footballers from Moscow Oblast |
Eratoneura ligata is a species of leafhopper in the family Cicadellidae.
References
Further reading
External links
Insects described in 1920
Erythroneurini |
Ululodes arizonensis is a species of owlfly in the tribe Ululodini. It is found in Central America and North America.
References
Further reading
Myrmeleontidae
Articles created by Qbugbot
Insects described in 1907 |
Jeju Air Co., Ltd. (), is the first and largest South Korean low-cost airline. It is also a founding member of the Value Alliance.
History
Established as a joint venture by Aekyung Group and the Jeju Island government on January 25, 2005, Jeju Air became Korea's first low-cost airline. Jeju Air is named after the Jeju Island.
In 2016, it helped found Value Alliance, the world's first pan-regional low-cost carrier (LCC) alliance, comprising eight Asia Pacific LCCs. In 2017, Jeju Air carried over 60 million passengers, with revenue reported of $890mm US operating profits over $80mm US. In 2018, Jeju Air carried 7.3 million international passengers along with 4.7 million domestic passengers. Its domestic traffic has been relatively flat since 2016 as it has focused almost entirely on international expansion.
Jeju Air flight operations were affected by the coronavirus outbreak. In November 2020, there were approximately 3,100 employees at the airline. In August 2021, Jeju Air sold stock, raising $180 million for financing operations.
Destinations
Jeju Air offers scheduled domestic services, as well as international destinations including China, Japan, Russia, the Mariana Islands, and various Southeast Asian countries.
Codeshare agreements
Jeju Air codeshares with the following airlines.
Jetstar
Fleet
Current fleet
, Jeju Air operates an all-Boeing 737 fleet composed of the following aircraft:
Retired fleet
Accidents and Incidents
On August 12, 2007, , Bombardier Dash 8 Q400 (registered HL5256) had performed a runway overshoot at Gimhae International Airport. All 74 passengers and 5 crews survived, but 6 passengers suffered minor injuries. Jeju Air Flight 502 is the first and the only incident of Jeju Air.
References
External links
Official website
Airlines of South Korea
South Korean companies established in 2005
Airlines established in 2005
Companies based in Jeju City
Low-cost carriers
South Korean brands
Value Alliance |
King Ampaw is a Ghanaian filmmaker and actor born in Kukurantumi in the Eastern Region of Ghana. He is known for starring as the second lead role with the late Hollywood actor, Klaus Kinski in Werner Herzog's sensational film Cobra Verde (1987) which he also co-produced. He also co-produced the film (1989) directed by Peter F. Bringmann. He is married with two sons.
Biography
King Ampaw was born on 25 July 1940 in Kukurantumi in the Eastern Region of Ghana. He attended the Academy of Film in Potsdam, Germany in 1965. In 1966 he also enrolled at the Academy of Music and Performing Arts in Vienna, Austria and the Hochschule für Fernsehen und Film München, Germany (HFF Munich) from 1967 to 1972 where he studied with Werner Herzog and Wim Wenders. He graduated as a film director with his first film They Call it Love.
On his return to Ghana, he became a senior director at the Ghana Broadcasting Corporation (GBC) from 1979 to 1982 when he left GBC to form his own film company, Afro movies Ltd. King Ampaw wrote, directed and produced his own films such as Kukurantumi, Road to Accra (1983), Juju (1985) and No Time to Die (2006). Most of his films have been co-funded with his company Afromovies Ltd and international agencies and governments such as No Time to Die which was funded by the European Union and the French Government. His films have been praised internationally and have won numerous awards including the Film Critics Award for Kukurantumi, Road to Accra at FESPACO, the Input Film Award for Juju in Czech Republic and the Talifa Film Festival Award in Spain for No Time to Die.
He was the first Filmmaker to be given an Honorary Award at the Africa Movie Academy Awards (AMAA) in Nigeria. At the 2012 NAFTI Film Lectures, he was honoured for his immense contribution to the film industry and cross-cultural collaborations between Ghana and Germany. He also received another Lifetime Achievement Award in 2013 at the Accra International Film Festival. He is a founding member of FEPACI (African Filmmakers’ Union), FESPACO, the Ghana Academy of Film and Television Arts (GAFTA) and the Directors’ Guild of Ghana (DGG).
King Ampaw is currently working on a film titled "The Son and Sun of Africa", which is about the life of the legendary Pan-Africanist, Kwame Nkrumah which will be his last film, to complete his creative works.
Filmography
They Call it Love (1972)
Kukurantumi, Road to Accra (1983)
Juju (Nana Akoto) (1985)
No Time to Die (2006)
Awards and nomination
In 2007, King Ampaw was awarded "Best Actor award at the 4th African Film Festival of Tarifa in Spain. He presented during the 20th anniversary of the "Pan-African Film and Arts Festival in Georgia, Atlanta, in 2008. He won The Film Critics Award for Kukurantumi at Fespaco in Ouagadougou and Input Film Award for Nana Akoto in Czechoslovakia He is also the winner of Honorary Award at an edition of the Africa Movie Academy Awards (AMAA), in Nigeria. Additionally, he was awarded a Lifetime Achievement Award at the Accra International Film Festival (AIFF) in 2013.
References
1940 births
Living people
Ghanaian male actors
Ghanaian film directors
Ghanaian expatriates in Germany
Ghanaian expatriates in Austria
Ghanaian film producers |
Tukhum (; , Tükhem) is a rural locality (an ulus) in Selenginsky District, Republic of Buryatia, Russia. The population was 20 as of 2010. There are 2 streets.
References
Rural localities in Selenginsky District |
Antonio Mizauld (born in Montluçon in 1510 and died in Paris in 1578) was a French astronomer and physician.
Works
.
References
People from Montluçon
1510 births
1578 deaths
French astrologers
16th-century French astronomers
16th-century French physicians
16th-century astrologers |
Nefteyugansk United Airline Transportation Company is an airline based in Nefteyugansk, Khanty–Mansi Autonomous Okrug, Russia. Its main base is Nefteyugansk Airport.
Code data
ICAO Code: NFT
Callsign: Nefteavia
History
The airline was established and started operations in 1975. It was formerly named Nefteyugansk United Aviation Squadron.
Fleet
The Nefteyugansk Air Enterprise fleet includes the following aircraft (at March 2007):
5 Kamov Ka-32T
12 Mil Mi-8T
8 Mil Mi-17
External links
Nefteyugansk Air Enterprise
References
Airlines of Russia
Former Aeroflot divisions
Airlines established in 1975
Companies based in Khanty-Mansi Autonomous Okrug |
The Department of Supply and Development was an Australian government department that existed between April 1948 and March 1950.
Scope
Information about the department's functions and/or government funding allocation could be found in the Administrative Arrangements Orders, the annual Portfolio Budget Statements and in the department's annual reports.
The department was set up by the Chifley government to control services that were deemed essential to supporting Australia's armed forces. Its creation saw the rearrangement of the Department of Munitions and the Department of Supply and Shipping. The functions of the department included:
research, design and development in relation to war material
the provision or supply of war materiel
the manufacture or assembly of aircraft or parts thereof
arrangements for the establishment or extension of industries for purposes of defence
the acquisition, maintenance and disposal of stocks of goods in connection with defence; and
the arrangement or co-ordination of:
surveys, of Australian industrial capacity and the preparation of plans to ensure the effective operation of industry in time of war, including plans for the decentralization of secondary industries and particularly those relating to defence; and
the investigation and development of Australian sources of supply of goods necessary for the economic security of the Commonwealth in time of war, and, in particular, the investigation and development of additional oil and strategic mineral resources, the production of power alcohol from sugar or other vegetable crops, and the production of oil from coal or shale.
Structure
The department was a Commonwealth Public Service department, staffed by officials who were responsible to the Minister for Supply and Development, initially John Armstrong (until Labor's defeat at the 1949 election) and subsequently Richard Casey.
Abolition
The department was abolished by the Menzies Government in 1950 in a reorganisation planned by Richard Casey.
References
Supply and Development
Ministries established in 1948 |
```html
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "path_to_url">
<!-- NewPage -->
<html lang="en">
<head>
<!-- Generated by javadoc (1.8.0_121) on Mon Mar 27 10:01:25 CEST 2017 -->
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
<title>ActivitiEntityEvent (Flowable - Engine 5.23.0 API)</title>
<meta name="date" content="2017-03-27">
<link rel="stylesheet" type="text/css" href="../../../../../stylesheet.css" title="Style">
<script type="text/javascript" src="../../../../../script.js"></script>
</head>
<body>
<script type="text/javascript"><!--
try {
if (location.href.indexOf('is-external=true') == -1) {
parent.document.title="ActivitiEntityEvent (Flowable - Engine 5.23.0 API)";
}
}
catch(err) {
}
//-->
var methods = {"i0":6};
var tabs = {65535:["t0","All Methods"],2:["t2","Instance Methods"],4:["t3","Abstract Methods"]};
var altColor = "altColor";
var rowColor = "rowColor";
var tableTab = "tableTab";
var activeTableTab = "activeTableTab";
</script>
<noscript>
<div>JavaScript is disabled on your browser.</div>
</noscript>
<!-- ========= START OF TOP NAVBAR ======= -->
<div class="topNav"><a name="navbar.top">
<!-- -->
</a>
<div class="skipNav"><a href="#skip.navbar.top" title="Skip navigation links">Skip navigation links</a></div>
<a name="navbar.top.firstrow">
<!-- -->
</a>
<ul class="navList" title="Navigation">
<li><a href="../../../../../overview-summary.html">Overview</a></li>
<li><a href="package-summary.html">Package</a></li>
<li class="navBarCell1Rev">Class</li>
<li><a href="class-use/ActivitiEntityEvent.html">Use</a></li>
<li><a href="package-tree.html">Tree</a></li>
<li><a href="../../../../../deprecated-list.html">Deprecated</a></li>
<li><a href="../../../../../index-all.html">Index</a></li>
<li><a href="../../../../../help-doc.html">Help</a></li>
</ul>
</div>
<div class="subNav">
<ul class="navList">
<li><a href="../../../../../org/activiti/engine/delegate/event/ActivitiCancelledEvent.html" title="interface in org.activiti.engine.delegate.event"><span class="typeNameLink">Prev Class</span></a></li>
<li><a href="../../../../../org/activiti/engine/delegate/event/ActivitiEntityWithVariablesEvent.html" title="interface in org.activiti.engine.delegate.event"><span class="typeNameLink">Next Class</span></a></li>
</ul>
<ul class="navList">
<li><a href="../../../../../index.html?org/activiti/engine/delegate/event/ActivitiEntityEvent.html" target="_top">Frames</a></li>
<li><a href="ActivitiEntityEvent.html" target="_top">No Frames</a></li>
</ul>
<ul class="navList" id="allclasses_navbar_top">
<li><a href="../../../../../allclasses-noframe.html">All Classes</a></li>
</ul>
<div>
<script type="text/javascript"><!--
allClassesLink = document.getElementById("allclasses_navbar_top");
if(window==top) {
allClassesLink.style.display = "block";
}
else {
allClassesLink.style.display = "none";
}
//-->
</script>
</div>
<div>
<ul class="subNavList">
<li>Summary: </li>
<li>Nested | </li>
<li>Field | </li>
<li>Constr | </li>
<li><a href="#method.summary">Method</a></li>
</ul>
<ul class="subNavList">
<li>Detail: </li>
<li>Field | </li>
<li>Constr | </li>
<li><a href="#method.detail">Method</a></li>
</ul>
</div>
<a name="skip.navbar.top">
<!-- -->
</a></div>
<!-- ========= END OF TOP NAVBAR ========= -->
<!-- ======== START OF CLASS DATA ======== -->
<div class="header">
<div class="subTitle">org.activiti.engine.delegate.event</div>
<h2 title="Interface ActivitiEntityEvent" class="title">Interface ActivitiEntityEvent</h2>
</div>
<div class="contentContainer">
<div class="description">
<ul class="blockList">
<li class="blockList">
<dl>
<dt>All Superinterfaces:</dt>
<dd><a href="../../../../../org/activiti/engine/delegate/event/ActivitiEvent.html" title="interface in org.activiti.engine.delegate.event">ActivitiEvent</a></dd>
</dl>
<dl>
<dt>All Known Subinterfaces:</dt>
<dd><a href="../../../../../org/activiti/engine/delegate/event/ActivitiEntityWithVariablesEvent.html" title="interface in org.activiti.engine.delegate.event">ActivitiEntityWithVariablesEvent</a>, <a href="../../../../../org/activiti/engine/delegate/event/ActivitiProcessStartedEvent.html" title="interface in org.activiti.engine.delegate.event">ActivitiProcessStartedEvent</a></dd>
</dl>
<dl>
<dt>All Known Implementing Classes:</dt>
<dd><a href="../../../../../org/activiti/engine/delegate/event/impl/ActivitiEntityEventImpl.html" title="class in org.activiti.engine.delegate.event.impl">ActivitiEntityEventImpl</a>, <a href="../../../../../org/activiti/engine/delegate/event/impl/ActivitiEntityExceptionEventImpl.html" title="class in org.activiti.engine.delegate.event.impl">ActivitiEntityExceptionEventImpl</a>, <a href="../../../../../org/activiti/engine/delegate/event/impl/ActivitiEntityWithVariablesEventImpl.html" title="class in org.activiti.engine.delegate.event.impl">ActivitiEntityWithVariablesEventImpl</a>, <a href="../../../../../org/activiti/engine/delegate/event/impl/ActivitiProcessStartedEventImpl.html" title="class in org.activiti.engine.delegate.event.impl">ActivitiProcessStartedEventImpl</a></dd>
</dl>
<hr>
<br>
<pre>public interface <span class="typeNameLabel">ActivitiEntityEvent</span>
extends <a href="../../../../../org/activiti/engine/delegate/event/ActivitiEvent.html" title="interface in org.activiti.engine.delegate.event">ActivitiEvent</a></pre>
<div class="block">An <a href="../../../../../org/activiti/engine/delegate/event/ActivitiEvent.html" title="interface in org.activiti.engine.delegate.event"><code>ActivitiEvent</code></a> related to a single entity.</div>
<dl>
<dt><span class="simpleTagLabel">Author:</span></dt>
<dd>Frederik Heremans</dd>
</dl>
</li>
</ul>
</div>
<div class="summary">
<ul class="blockList">
<li class="blockList">
<!-- ========== METHOD SUMMARY =========== -->
<ul class="blockList">
<li class="blockList"><a name="method.summary">
<!-- -->
</a>
<h3>Method Summary</h3>
<table class="memberSummary" border="0" cellpadding="3" cellspacing="0" summary="Method Summary table, listing methods, and an explanation">
<caption><span id="t0" class="activeTableTab"><span>All Methods</span><span class="tabEnd"> </span></span><span id="t2" class="tableTab"><span><a href="javascript:show(2);">Instance Methods</a></span><span class="tabEnd"> </span></span><span id="t3" class="tableTab"><span><a href="javascript:show(4);">Abstract Methods</a></span><span class="tabEnd"> </span></span></caption>
<tr>
<th class="colFirst" scope="col">Modifier and Type</th>
<th class="colLast" scope="col">Method and Description</th>
</tr>
<tr id="i0" class="altColor">
<td class="colFirst"><code><a href="path_to_url" title="class or interface in java.lang">Object</a></code></td>
<td class="colLast"><code><span class="memberNameLink"><a href="../../../../../org/activiti/engine/delegate/event/ActivitiEntityEvent.html#getEntity--">getEntity</a></span>()</code> </td>
</tr>
</table>
<ul class="blockList">
<li class="blockList"><a name="methods.inherited.from.class.org.activiti.engine.delegate.event.ActivitiEvent">
<!-- -->
</a>
<h3>Methods inherited from interface org.activiti.engine.delegate.event.<a href="../../../../../org/activiti/engine/delegate/event/ActivitiEvent.html" title="interface in org.activiti.engine.delegate.event">ActivitiEvent</a></h3>
<code><a href="../../../../../org/activiti/engine/delegate/event/ActivitiEvent.html#getEngineServices--">getEngineServices</a>, <a href="../../../../../org/activiti/engine/delegate/event/ActivitiEvent.html#getExecutionId--">getExecutionId</a>, <a href="../../../../../org/activiti/engine/delegate/event/ActivitiEvent.html#getProcessDefinitionId--">getProcessDefinitionId</a>, <a href="../../../../../org/activiti/engine/delegate/event/ActivitiEvent.html#getProcessInstanceId--">getProcessInstanceId</a>, <a href="../../../../../org/activiti/engine/delegate/event/ActivitiEvent.html#getType--">getType</a></code></li>
</ul>
</li>
</ul>
</li>
</ul>
</div>
<div class="details">
<ul class="blockList">
<li class="blockList">
<!-- ============ METHOD DETAIL ========== -->
<ul class="blockList">
<li class="blockList"><a name="method.detail">
<!-- -->
</a>
<h3>Method Detail</h3>
<a name="getEntity--">
<!-- -->
</a>
<ul class="blockListLast">
<li class="blockList">
<h4>getEntity</h4>
<pre><a href="path_to_url" title="class or interface in java.lang">Object</a> getEntity()</pre>
<dl>
<dt><span class="returnLabel">Returns:</span></dt>
<dd>the entity that is targeted by this event.</dd>
</dl>
</li>
</ul>
</li>
</ul>
</li>
</ul>
</div>
</div>
<!-- ========= END OF CLASS DATA ========= -->
<!-- ======= START OF BOTTOM NAVBAR ====== -->
<div class="bottomNav"><a name="navbar.bottom">
<!-- -->
</a>
<div class="skipNav"><a href="#skip.navbar.bottom" title="Skip navigation links">Skip navigation links</a></div>
<a name="navbar.bottom.firstrow">
<!-- -->
</a>
<ul class="navList" title="Navigation">
<li><a href="../../../../../overview-summary.html">Overview</a></li>
<li><a href="package-summary.html">Package</a></li>
<li class="navBarCell1Rev">Class</li>
<li><a href="class-use/ActivitiEntityEvent.html">Use</a></li>
<li><a href="package-tree.html">Tree</a></li>
<li><a href="../../../../../deprecated-list.html">Deprecated</a></li>
<li><a href="../../../../../index-all.html">Index</a></li>
<li><a href="../../../../../help-doc.html">Help</a></li>
</ul>
</div>
<div class="subNav">
<ul class="navList">
<li><a href="../../../../../org/activiti/engine/delegate/event/ActivitiCancelledEvent.html" title="interface in org.activiti.engine.delegate.event"><span class="typeNameLink">Prev Class</span></a></li>
<li><a href="../../../../../org/activiti/engine/delegate/event/ActivitiEntityWithVariablesEvent.html" title="interface in org.activiti.engine.delegate.event"><span class="typeNameLink">Next Class</span></a></li>
</ul>
<ul class="navList">
<li><a href="../../../../../index.html?org/activiti/engine/delegate/event/ActivitiEntityEvent.html" target="_top">Frames</a></li>
<li><a href="ActivitiEntityEvent.html" target="_top">No Frames</a></li>
</ul>
<ul class="navList" id="allclasses_navbar_bottom">
<li><a href="../../../../../allclasses-noframe.html">All Classes</a></li>
</ul>
<div>
<script type="text/javascript"><!--
allClassesLink = document.getElementById("allclasses_navbar_bottom");
if(window==top) {
allClassesLink.style.display = "block";
}
else {
allClassesLink.style.display = "none";
}
//-->
</script>
</div>
<div>
<ul class="subNavList">
<li>Summary: </li>
<li>Nested | </li>
<li>Field | </li>
<li>Constr | </li>
<li><a href="#method.summary">Method</a></li>
</ul>
<ul class="subNavList">
<li>Detail: </li>
<li>Field | </li>
<li>Constr | </li>
<li><a href="#method.detail">Method</a></li>
</ul>
</div>
<a name="skip.navbar.bottom">
<!-- -->
</a></div>
<!-- ======== END OF BOTTOM NAVBAR ======= -->
</body>
</html>
``` |
The 2021 hunger strike of undocumented migrants in Belgium was a two-month-long hunger strike held by several hundred undocumented migrants in Belgium in protest of the policies of the Belgian government, led by Prime Minister Alexander De Croo and Secretary of State for Asylum and Migration Sammy Mahdi, concerning the COVID-19 pandemic and residency permits.
Background
The Belgian authorities do not have a reliable estimate of the number of undocumented workers residing in Belgium. The estimates range from 50 000 to 250 000 people. The public administration's working assumption is that there are at least 100 000 undocumented migrants in Belgium, many of who work in industries such as restaurants, cleaning, and construction.
When the COVID-19 pandemic hit in early 2020, the Belgium government refused to implement policy changes to protect undocumented migrants, unlike several other European governments, such as temporarily extending unemployment benefits or offering temporary residencies. As a result, many undocumented migrants in the country were forced into extremely precarious situations and charities struggled to provide enough help.
Hunger strike
Throughout the first few months of 2021, a number of protests was held by undocumented migrants concerning their situation. However, the Belgian government refused to implement any policy changes.
On May 23, 476 undocumented migrants began a hunger strike. They gathered at the church of Saint John the Baptist at the Béguinage and at the Université libre de Bruxelles, setting up mattresses with signs displaying each of their jobs and calling for the Belgian government to grant them temporary residency, support to alleviate the impact of the COVID-19 pandemic, and for the establishment of an independent body to oversee residency requests with clear criteria and in a timely manner. The Red Cross provided some medical support for the strikers.
In support of the strike, the We are Belgium too group was founded, launching a petition that gained tens of thousands of signatures. In mid-July, the Belgian artists at the Festival d'Avignon read an open letter of solidarity with the strike. The Democracy in Europe Movement 2025 also released an open letter in support of the strikers, with other 100 signatures from high-profile public figures, stating that "over the last 20 years, European states have collectively and drastically reduced the legal migration pathways to Europe."
Spokeswomen for the strikers, Cécile De Blick and Brenda Odimba, accused the Belgian state of having created an untenable situation in the first place. In successive reforms, the Belgian legislator chipped off the pathways available to undocumented workers living in Belgium and seeking a regularization of their status.
On 20 July 2021, two United Nations officials called for the Belgian government to grant temporary residence permits, with UN special rapporteur on human rights and extreme poverty Olivier De Schutter stating that "the information we have received is alarming and several of the hunger strikers are between life and death." Afterwards, two of the left-wing parties in the governing coalition in Belgium, the Socialist Party and Ecolo threatened to collapse the government if any of the strikers died. The left-wing Vooruit, however, stated that they backed the government's stance.
On 22 July 2021, following further talks with the government, the group ended their hunger strike after two months and the hunger strikers were taken to the hospital. Although it refused to implement any widespread policy changes, the government had promised that the hunger strikers would be able to go to a neutral zone and have their cases for residency evaluated individually. De Croo welcomed the end of the strike, stating that "a government can never accept blackmail."
Alleged betrayal by State Secretary Sammy Mahdi
In November 2021, four representatives of the hunger strikers accused the Belgian Secretary of State of Asylum and Migration Sammy Mahdi of "unprecedented betrayal." The accusation came after the Belgian authorities rejected the requests for residence permits filed by hunger strikers. According to Alexis Deswaef, Marie-Pierre de Buisseret, Mehdi Kassou and Daniel Alliet (the priest at the Beguinage Church) who jointly represented the hunger strikers at the negotiations with the Belgian government in July 2022, the government representatives have made clear promises to accept the requests by the individual hunger strikes to obtain a residence permit in Belgium. The Belgian authorities subsequently rejected the files of hunger strikers that had been discussed in July and agreed in principle for regularisation.
All decisions on the grating of a residence permit to the hunger strikers were adopted within a year from the end of the strike. 90 people received a positive response out of 516 people for whom a demand has been introduced as a follow-up of the hunger strike. About 5 out of 6 applicants were rejected.
References
Hunger strikes
2021 in Belgium
Immigration-related protests |
```xml
import {
type StyleObject,
type FontFaceObject,
type KeyframesObject,
} from "styletron-standard";
import stringify from "json-stable-stringify";
/**
@see: path_to_url
*/
import prettier from "prettier/standalone";
import babelParser from "prettier/parser-babel";
/*
This adds a "deterministic" engine that simply returns a `JSON.stringify`-ed
version of the style object (with aplha-sorted keys).
*/
export default function createRender(kind: string) {
return function render(
obj: StyleObject | FontFaceObject | KeyframesObject | undefined | null,
): string {
if (!obj) {
return "";
}
const prettySortedJSON = prettier.format(stringify(obj), {
/**
even though we are using the json5 parser, it is actually packaged inside the
babel parser in source
@see: path_to_url#L28
*/
parser: "json5",
plugins: [babelParser],
// don't add a semicolon at the end of the declaration
semi: false,
// default/prefer use of `'` for strings when needed
singleQuote: true,
// force newline insertions more often
printWidth: 40,
});
return `${kind}=${prettySortedJSON}`;
};
}
``` |
The BRM P230 was an open-wheel Formula One racing car, designed and developed by Aubrey Woods, and built by British constructor BRM, for the 1979 Aurora AFX F1 1979 British Formula One Championship, but never raced. It was due to be driven by Neil Bettridge, and like its predecessor was going to be powered by a nearly BRM V12 engine, and run on Goodyear tyres. It later became the basis for the unraced BRM Hepworth GB-1 Can-Am car.
References
BRM Formula One cars |
```c++
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
//
// path_to_url
//
// Unless required by applicable law or agreed to in writing,
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
// specific language governing permissions and limitations
#include <boost/scoped_ptr.hpp>
#include "exprs/slot-ref.h"
#include "runtime/mem-pool.h"
#include "runtime/mem-tracker.h"
#include "runtime/test-env.h"
#include "runtime/timestamp-value.inline.h"
#include "runtime/tuple-row.h"
#include "runtime/types.h"
#include "testutil/gtest-util.h"
#include "util/tuple-row-compare.h"
#include "common/names.h"
namespace impala {
class TupleRowCompareTest : public testing::Test {
public:
TupleRowCompareTest() : expr_perm_pool_(&tracker_), expr_results_pool_(&tracker_) {}
protected:
typedef __uint128_t uint128_t;
/// Temporary runtime environment for the TupleRowComperator.
scoped_ptr<TestEnv> test_env_;
RuntimeState* runtime_state_;
RowDescriptor desc_;
ObjectPool pool_;
/// A dummy MemTracker used for exprs and other things we don't need to have limits on.
MemTracker tracker_;
MemPool expr_perm_pool_;
MemPool expr_results_pool_;
scoped_ptr<TupleRowZOrderComparator> comperator_;
vector<ScalarExpr*> ordering_exprs_;
virtual void SetUp() {
test_env_.reset(new TestEnv());
ASSERT_OK(test_env_->Init());
}
virtual void TearDown() {
comperator_->Close(runtime_state_);
ScalarExpr::Close(ordering_exprs_);
runtime_state_ = nullptr;
test_env_.reset();
expr_perm_pool_.FreeAll();
expr_results_pool_.FreeAll();
pool_.Clear();
}
void LoadComperator(int offset) {
TSortInfo* tsort_info = pool_.Add(new TSortInfo);
tsort_info->sorting_order = TSortingOrder::ZORDER;
TupleRowComparatorConfig* config =
pool_.Add(new TupleRowComparatorConfig(*tsort_info, ordering_exprs_));
comperator_.reset(new TupleRowZOrderComparator(*config));
ASSERT_OK(comperator_->Open(&pool_, runtime_state_, &expr_perm_pool_,
&expr_results_pool_));
}
// Only ColumnType should be passed as template parameter.
template <typename... Types>
void LoadComperator(int offset, ColumnType type, Types... types) {
//We are trying to fit into one slot, so the offset has to be < sizeof(int)*8.
DCHECK_LT(offset, sizeof(int) * 8) << "Too many columns added.";
SlotRef* build_expr = pool_.Add(new SlotRef(type, offset, true /* nullable */));
ASSERT_OK(build_expr->Init(desc_, true, nullptr));
ordering_exprs_.push_back(build_expr);
LoadComperator(offset + type.GetSlotSize(), types...);
}
template <typename... Types>
void CreateComperator(Types... types) {
ordering_exprs_.clear();
LoadComperator(1, types...);
}
template <bool IS_FIRST_SLOT_NULL = false, typename... Args>
TupleRow* CreateTupleRow(Args... args) {
// Only one null byte is allocated, so the joint slot size has to be < sizeof(int)*8.
DCHECK_LE(sizeof...(args), 8);
uint8_t* tuple_row_mem = expr_perm_pool_.Allocate(
sizeof(char*) + sizeof(int32_t*) * sizeof...(args));
Tuple* tuple_mem = Tuple::Create(sizeof(char) + GetSize(args...), &expr_perm_pool_);
if (IS_FIRST_SLOT_NULL) tuple_mem->SetNull(NullIndicatorOffset(0, 1));
FillMem(tuple_mem, 1, args...);
TupleRow* row = reinterpret_cast<TupleRow*>(tuple_row_mem);
row->SetTuple(0, tuple_mem);
return row;
}
unsigned GetSize() { return 0; }
template <typename T, typename... Args>
unsigned GetSize(const T & head, const Args &... tail) {
return sizeof(T) + GetSize(tail...);
}
template <typename T>
void FillMem(Tuple* tuple_mem, int idx, T val) {
memcpy(tuple_mem->GetSlot(idx), &val, sizeof(T));
}
template <typename T, typename... Args>
void FillMem(Tuple* tuple_mem, int idx, T val, Args... args) {
// Use memcpy to avoid gcc generating unaligned instructions like movaps
// for int128_t. They will raise SegmentFault when addresses are not
// aligned to 16 bytes.
memcpy(tuple_mem->GetSlot(idx), &val, sizeof(T));
FillMem(tuple_mem, idx + sizeof(T), args...);
}
template <typename T, bool IS_FIRST_SLOT_NULL = false>
int CompareTest(T lval1, T lval2, T rval1, T rval2) {
TupleRow* lhs = CreateTupleRow<IS_FIRST_SLOT_NULL>(lval1, lval2);
TupleRow* rhs = CreateTupleRow(rval1, rval2);
int result = comperator_->Compare(lhs, rhs);
comperator_->Close(runtime_state_);
return result;
}
// With this function, nullable entries can also be tested, by setting the
// template parameter to true. This means that the first slot of the
// left hand side is set to null, which should be equal to the
// smallest possible value when comparing.
template <bool IS_FIRST_SLOT_NULL = false>
int IntIntTest(int32_t lval1, int32_t lval2, int32_t rval1, int32_t rval2) {
CreateComperator(ColumnType(TYPE_INT), ColumnType(TYPE_INT));
return CompareTest<int32_t, IS_FIRST_SLOT_NULL>(lval1, lval2, rval1, rval2);
}
int Int64Int64Test(int64_t lval1, int64_t lval2, int64_t rval1, int64_t rval2) {
CreateComperator(ColumnType(TYPE_BIGINT), ColumnType(TYPE_BIGINT));
return CompareTest<int64_t>(lval1, lval2, rval1, rval2);
}
int Int16Int16Test(int16_t lval1, int16_t lval2, int16_t rval1, int16_t rval2) {
CreateComperator(ColumnType(TYPE_SMALLINT), ColumnType(TYPE_SMALLINT));
return CompareTest<int16_t>(lval1, lval2, rval1, rval2);
}
int Int8Int8Test(int8_t lval1, int8_t lval2, int8_t rval1, int8_t rval2) {
CreateComperator(ColumnType(TYPE_TINYINT), ColumnType(TYPE_TINYINT));
return CompareTest<int8_t>(lval1, lval2, rval1, rval2);
}
int FloatFloatTest(float lval1, float lval2, float rval1, float rval2) {
CreateComperator(ColumnType(TYPE_FLOAT), ColumnType(TYPE_FLOAT));
return CompareTest<float>(lval1, lval2, rval1, rval2);
}
int DoubleDoubleTest(double lval1, double lval2, double rval1, double rval2) {
CreateComperator(ColumnType(TYPE_DOUBLE), ColumnType(TYPE_DOUBLE));
return CompareTest<double>(lval1, lval2, rval1, rval2);
}
int BoolBoolTest(bool lval1, bool lval2, bool rval1, bool rval2) {
CreateComperator(ColumnType(TYPE_BOOLEAN), ColumnType(TYPE_BOOLEAN));
return CompareTest<bool>(lval1, lval2, rval1, rval2);
}
// Char is a special case, so its tuples have to be created differently.
// This function is responsible for only the char test below, therefore
// the tuple will have a fix size of two slots.
TupleRow* CreateCharArrayTupleRow(const char* ptr1, const char* ptr2) {
uint8_t* tuple_row_mem = expr_perm_pool_.Allocate(
sizeof(char*) + sizeof(int32_t*) * 2);
Tuple* tuple_mem =
Tuple::Create(sizeof(char) + strlen(ptr1) + strlen(ptr2), &expr_perm_pool_);
memcpy(tuple_mem->GetSlot(1), ptr1, strlen(ptr1));
memcpy(tuple_mem->GetSlot(1 + strlen(ptr1)), ptr2, strlen(ptr2));
TupleRow* row = reinterpret_cast<TupleRow*>(tuple_row_mem);
row->SetTuple(0, tuple_mem);
return row;
}
int CharCharTest(const char *lval1, const char *lval2, const char *rval1,
const char *rval2) {
DCHECK_EQ(strlen(lval1), strlen(rval1));
DCHECK_EQ(strlen(lval2), strlen(rval2));
CreateComperator(ColumnType::CreateCharType(strlen(lval1)),
ColumnType::CreateCharType(strlen(lval2)));
TupleRow* lhs = CreateCharArrayTupleRow(lval1, lval2);
TupleRow* rhs = CreateCharArrayTupleRow(rval1, rval2);
int result = comperator_->Compare(lhs, rhs);
comperator_->Close(runtime_state_);
return result;
}
int DateDateTest(DateValue lval1, DateValue lval2, DateValue rval1, DateValue rval2) {
CreateComperator(ColumnType(TYPE_DATE), ColumnType(TYPE_DATE));
return CompareTest<DateValue>(lval1, lval2, rval1, rval2);
}
int TimestampTimestampTest(const std::string& lval1, const std::string& lval2,
const std::string& rval1, const std::string& rval2) {
return TimestampTimestampTest(
TimestampValue::ParseSimpleDateFormat(lval1),
TimestampValue::ParseSimpleDateFormat(lval2),
TimestampValue::ParseSimpleDateFormat(rval1),
TimestampValue::ParseSimpleDateFormat(rval2));
}
int TimestampTimestampTest(int64_t lval1, int64_t lval2, int64_t rval1, int64_t rval2) {
return TimestampTimestampTest(TimestampValue::FromDaysSinceUnixEpoch(lval1),
TimestampValue::FromDaysSinceUnixEpoch(lval2),
TimestampValue::FromDaysSinceUnixEpoch(rval1),
TimestampValue::FromDaysSinceUnixEpoch(rval2));
}
int TimestampTimestampTest(TimestampValue lval1, TimestampValue lval2,
TimestampValue rval1, TimestampValue rval2) {
CreateComperator(ColumnType(TYPE_TIMESTAMP), ColumnType(TYPE_TIMESTAMP));
return CompareTest<TimestampValue>(lval1, lval2, rval1, rval2);
}
template<typename DECIMAL_T>
int DecimalDecimalTest(int64_t lval1, int64_t lval2, int64_t rval1, int64_t rval2,
int precision, int scale) {
ColumnType decimal_column = ColumnType::CreateDecimalType(precision, scale);
CreateComperator(decimal_column, decimal_column);
bool overflow = false;
DECIMAL_T l1 = DECIMAL_T::FromInt(precision, scale, lval1, &overflow);
DECIMAL_T l2 = DECIMAL_T::FromInt(precision, scale, lval2, &overflow);
DECIMAL_T r1 = DECIMAL_T::FromInt(precision, scale, rval1, &overflow);
DECIMAL_T r2 = DECIMAL_T::FromInt(precision, scale, rval2, &overflow);
TupleRow* lhs = CreateTupleRow(l1, l2);
TupleRow* rhs = CreateTupleRow(r1, r2);
int result = comperator_->Compare(lhs, rhs);
comperator_->Close(runtime_state_);
return result;
}
// The number of bytes to compare in a string depends on the size of the types present
// in a row. If there are only strings present, only the first 4 bytes will be
// considered. This is decided in TupleRowZOrderComparator::CompareInterpreted, where
// the GetByteSize returns 0 for strings.
int StringString4ByteTest(const std::string& lval1, const std::string& lval2,
const std::string& rval1, const std::string& rval2) {
CreateComperator(ColumnType(TYPE_STRING), ColumnType(TYPE_STRING));
return CompareTest<StringValue>(StringValue(lval1), StringValue(lval2),
StringValue(rval1), StringValue(rval2));
}
// Requires that the comparator has already been created with the two String/Varchar
// columns and a column corresponding to T.
template<typename T>
int GenericStringTest(const std::string& lval1, const std::string& lval2,
const std::string& rval1, const std::string& rval2, T dummyValue) {
TupleRow* lhs = CreateTupleRow(StringValue(lval1), StringValue(lval2), dummyValue);
TupleRow* rhs = CreateTupleRow(StringValue(rval1), StringValue(rval2), dummyValue);
int result = comperator_->Compare(lhs, rhs);
comperator_->Close(runtime_state_);
return result;
}
int StringString8ByteTest(const std::string& lval1, const std::string& lval2,
const std::string& rval1, const std::string& rval2) {
// TYPE_BIGINT will enforce checking the first 8 bytes of the strings.
CreateComperator(
ColumnType(TYPE_STRING), ColumnType(TYPE_STRING), ColumnType(TYPE_BIGINT));
int64_t dummyValue = 0;
return GenericStringTest<int64_t>(lval1, lval2, rval1, rval2, dummyValue);
}
int StringString16ByteTest(const std::string& lval1, const std::string& lval2,
const std::string& rval1, const std::string& rval2) {
// The Decimal16Value column will enforce checking the first 16 bytes of the strings.
int precision = ColumnType::MAX_PRECISION;
int scale = 0;
bool overflow = false;
Decimal16Value dummyValue = Decimal16Value::FromInt(precision, scale, 0, &overflow);
CreateComperator(ColumnType(TYPE_STRING), ColumnType(TYPE_STRING),
ColumnType::CreateDecimalType(precision, scale));
return GenericStringTest<Decimal16Value>(lval1, lval2, rval1, rval2, dummyValue);
}
int VarcharVarchar4ByteTest(const std::string& lval1, const std::string& lval2,
const std::string& rval1, const std::string& rval2) {
CreateComperator(ColumnType::CreateVarcharType(32),
ColumnType::CreateVarcharType(32));
return CompareTest<StringValue>(StringValue(lval1), StringValue(lval2),
StringValue(rval1), StringValue(rval2));
}
int VarcharVarchar8ByteTest(const std::string& lval1, const std::string& lval2,
const std::string& rval1, const std::string& rval2) {
// TYPE_BIGINT will enforce checking the first 8 bytes of the strings.
CreateComperator(ColumnType::CreateVarcharType(32),
ColumnType::CreateVarcharType(32), ColumnType(TYPE_BIGINT));
int64_t dummyValue = 0;
return GenericStringTest<Decimal16Value>(lval1, lval2, rval1, rval2, dummyValue);
}
int VarcharVarchar16ByteTest(const std::string& lval1, const std::string& lval2,
const std::string& rval1, const std::string& rval2) {
// The Decimal16Value column will enforce checking the first 16 bytes of the strings.
int precision = ColumnType::MAX_PRECISION;
int scale = 0;
bool overflow = false;
Decimal16Value dummyValue = Decimal16Value::FromInt(precision, scale, 0, &overflow);
CreateComperator(ColumnType::CreateVarcharType(32),
ColumnType::CreateVarcharType(32),
ColumnType::CreateDecimalType(precision, scale));
return GenericStringTest<Decimal16Value>(lval1, lval2, rval1, rval2, dummyValue);
}
};
// The Z-values used and their order are visualized in the following image:
// path_to_url
TEST_F(TupleRowCompareTest, Int32Test) {
EXPECT_EQ(IntIntTest(0, 0, 0, 0), 0);
EXPECT_EQ(IntIntTest(-5, 3, -5, 3), 0);
EXPECT_EQ(IntIntTest(1, 0, 0, 1), 1);
EXPECT_EQ(IntIntTest(0, 1, 1, 0), -1);
EXPECT_EQ(IntIntTest(1, 0, 0, 1), 1);
EXPECT_EQ(IntIntTest(2, 4, 1, 7), 1);
EXPECT_EQ(IntIntTest(3, 7, 4, 0), -1);
EXPECT_EQ(IntIntTest(6, 4, 5, 7), 1);
EXPECT_EQ(IntIntTest(5, 5, 6, 4), -1);
EXPECT_EQ(IntIntTest(6, 1, 3, 7), 1);
EXPECT_EQ(IntIntTest(INT32_MAX / 2 + 2, 1, 1, INT32_MAX), 1);
EXPECT_EQ(IntIntTest(INT32_MAX / 2, 1, 1, INT32_MAX), -1);
// Some null tests (see details at IntIntTest)
EXPECT_EQ(IntIntTest<true>(1, 1, 1, 1), -1);
EXPECT_EQ(IntIntTest<true>(4242, 1, 1, 1), -1);
EXPECT_EQ(IntIntTest<true>(1, 0, 0, 1), -1);
EXPECT_EQ(IntIntTest<true>(1, 0, INT32_MIN, 0), 0);
}
TEST_F(TupleRowCompareTest, Int64Test) {
EXPECT_EQ(Int64Int64Test(0, 0, 0, 0), 0);
EXPECT_EQ(Int64Int64Test(-5, 3, -5, 3), 0);
EXPECT_EQ(Int64Int64Test(1, 0, 0, 1), 1);
EXPECT_EQ(Int64Int64Test(0, 1, 1, 0), -1);
EXPECT_EQ(Int64Int64Test(1, 0, 0, 1), 1);
EXPECT_EQ(Int64Int64Test(2, 4, 1, 7), 1);
EXPECT_EQ(Int64Int64Test(3, 7, 4, 0), -1);
EXPECT_EQ(Int64Int64Test(6, 4, 5, 7), 1);
EXPECT_EQ(Int64Int64Test(5, 5, 6, 4), -1);
EXPECT_EQ(Int64Int64Test(6, 1, 3, 7), 1);
EXPECT_EQ(Int64Int64Test(INT64_MAX / 2 + 2, 1, 1, INT64_MAX), 1);
EXPECT_EQ(Int64Int64Test(INT64_MAX / 2, 1, 1, INT64_MAX), -1);
}
TEST_F(TupleRowCompareTest, Int16Test) {
EXPECT_EQ(Int16Int16Test(0, 0, 0, 0), 0);
EXPECT_EQ(Int16Int16Test(-5, 3, -5, 3), 0);
EXPECT_EQ(Int16Int16Test(1, 0, 0, 1), 1);
EXPECT_EQ(Int64Int64Test(0, 1, 1, 0), -1);
EXPECT_EQ(Int16Int16Test(1, 0, 0, 1), 1);
EXPECT_EQ(Int16Int16Test(2, 4, 1, 7), 1);
EXPECT_EQ(Int16Int16Test(3, 7, 4, 0), -1);
EXPECT_EQ(Int16Int16Test(6, 4, 5, 7), 1);
EXPECT_EQ(Int16Int16Test(5, 5, 6, 4), -1);
EXPECT_EQ(Int16Int16Test(6, 1, 3, 7), 1);
EXPECT_EQ(Int16Int16Test(INT16_MAX / 2 + 2, 1, 1, INT16_MAX), 1);
EXPECT_EQ(Int16Int16Test(INT16_MAX / 2, 1, 1, INT16_MAX), -1);
}
TEST_F(TupleRowCompareTest, Int8Test) {
EXPECT_EQ(Int8Int8Test(0, 0, 0, 0), 0);
EXPECT_EQ(Int8Int8Test(-5, 3, -5, 3), 0);
EXPECT_EQ(Int8Int8Test(1, 0, 0, 1), 1);
EXPECT_EQ(Int8Int8Test(0, 1, 1, 0), -1);
EXPECT_EQ(Int8Int8Test(1, 0, 0, 1), 1);
EXPECT_EQ(Int8Int8Test(2, 4, 1, 7), 1);
EXPECT_EQ(Int8Int8Test(3, 7, 4, 0), -1);
EXPECT_EQ(Int8Int8Test(6, 4, 5, 7), 1);
EXPECT_EQ(Int8Int8Test(5, 5, 6, 4), -1);
EXPECT_EQ(Int8Int8Test(6, 1, 3, 7), 1);
EXPECT_EQ(Int8Int8Test(INT8_MAX / 2 + 2, 1, 1, INT8_MAX), 1);
EXPECT_EQ(Int8Int8Test(INT8_MAX / 2, 1, 1, INT8_MAX), -1);
}
TEST_F(TupleRowCompareTest, FloatTest) {
EXPECT_EQ(FloatFloatTest(1.0f, 0.0f, 0.0f, 1.0f), 1);
EXPECT_EQ(FloatFloatTest(0.0f, 1.0f, 1.0f, 0.0f), -1);
EXPECT_EQ(FloatFloatTest(4.0f, 3.0f, 3.0f, 4.0f), 1);
EXPECT_EQ(FloatFloatTest(5.0f, 7.0f, 4.0f, 10.0f), -1);
EXPECT_EQ(FloatFloatTest(6.0f, 10.0f, 7.0f, 3.0f), 1);
EXPECT_EQ(FloatFloatTest(9.0f, 7.0f, 8.0f, 10.0f), -1);
EXPECT_EQ(FloatFloatTest(8.0f , 8.0f, 9.0f, 7.0f), 1);
EXPECT_EQ(FloatFloatTest(9.0f, 4.0f, 6.0f, 10.0f), 1);
EXPECT_EQ(FloatFloatTest(-4.0f, -3.0f, -3.0f, -4.0f), -1);
EXPECT_EQ(FloatFloatTest(-5.0f, -7.0f, -4.0f, -10.0f), 1);
EXPECT_EQ(FloatFloatTest(-6.0f, -10.0f, -7.0f, -3.0f), -1);
EXPECT_EQ(FloatFloatTest(-9.0f, -7.0f, -8.0f, -10.0f), 1);
EXPECT_EQ(FloatFloatTest(-8.0f, -8.0f, -9.0f, -7.0f), -1);
EXPECT_EQ(FloatFloatTest(-9.0f, -4.0f, -6.0f, -10.0f), -1);
EXPECT_EQ(FloatFloatTest(FLT_MAX / 2.0f + 2.0f, 1.0f, 1.0f, FLT_MAX), 1);
}
TEST_F(TupleRowCompareTest, DoubleTest) {
EXPECT_EQ(DoubleDoubleTest(1.0, 0.0, 0.0, 1.0f), 1);
EXPECT_EQ(DoubleDoubleTest(0.0, 1.0, 1.0, 0.0f), -1);
EXPECT_EQ(DoubleDoubleTest(4.0, 3.0, 3.0, 4.0), 1);
EXPECT_EQ(DoubleDoubleTest(5.0, 7.0, 4.0, 10.0), -1);
EXPECT_EQ(DoubleDoubleTest(6.0, 10.0, 7.0, 3.0), 1);
EXPECT_EQ(DoubleDoubleTest(9.0, 7.0, 8.0, 10.0), -1);
EXPECT_EQ(DoubleDoubleTest(8.0, 8.0, 9.0, 7.0), 1);
EXPECT_EQ(DoubleDoubleTest(9.0, 4.0, 6.0, 10.0), 1);
EXPECT_EQ(DoubleDoubleTest(-4.0, -3.0, -3.0, -4.0), -1);
EXPECT_EQ(DoubleDoubleTest(-5.0, -7.0, -4.0, -10.0), 1);
EXPECT_EQ(DoubleDoubleTest(-6.0, -10.0, -7.0, -3.0), -1);
EXPECT_EQ(DoubleDoubleTest(-9.0, -7.0, -8.0, -10.0), 1);
EXPECT_EQ(DoubleDoubleTest(-8.0, -8.0, -9.0, -7.0), -1);
EXPECT_EQ(DoubleDoubleTest(-9.0, -4.0, -6.0, -10.0), -1);
EXPECT_EQ(DoubleDoubleTest(DBL_MAX / 2.0 + 2.0, 1.0, 1.0, DBL_MAX), 1);
}
TEST_F(TupleRowCompareTest, BoolTest) {
EXPECT_EQ(BoolBoolTest(true, false, true, false), 0);
EXPECT_EQ(BoolBoolTest(false, true, false, true), 0);
EXPECT_EQ(BoolBoolTest(true, true, true, false), 1);
EXPECT_EQ(BoolBoolTest(false, true, true, true), -1);
EXPECT_EQ(BoolBoolTest(false, true, false, false), 1);
EXPECT_EQ(BoolBoolTest(false, false, false, true), -1);
EXPECT_EQ(BoolBoolTest(true, false, false, false), 1);
}
TEST_F(TupleRowCompareTest, CharTest) {
EXPECT_EQ(CharCharTest("a", "b", "a", "b"), 0);
EXPECT_EQ(CharCharTest("a", "b", "a", "b"), 0);
EXPECT_EQ(CharCharTest("h", "0", "h", "0"), 0);
EXPECT_EQ(CharCharTest("h", "z", "z", "h"), -1);
EXPECT_EQ(CharCharTest("a", "0", "h", "0"), -1);
EXPECT_EQ(CharCharTest("!", "{", "0", "K"), 1);
EXPECT_EQ(CharCharTest("A", "~", "B", "Z"), 1);
EXPECT_EQ(CharCharTest("aaa", "bbb", "aaa", "bbb"), 0);
EXPECT_EQ(CharCharTest("abc", "bbc", "abc", "bbc"), 0);
EXPECT_EQ(CharCharTest("aah", "aa0", "aah", "aa0"), 0);
EXPECT_EQ(CharCharTest("aaa", "aa0", "aah", "aa0"), -1);
EXPECT_EQ(CharCharTest("aah", "aaz", "aaz", "aah"), -1);
EXPECT_EQ(CharCharTest("aa!", "aa{", "aa0", "aaK"), 1);
EXPECT_EQ(CharCharTest("aaA", "aa~", "aaB", "aaZ"), 1);
}
TEST_F(TupleRowCompareTest, DateTest) {
EXPECT_EQ(Int8Int8Test(0, 0, 0, 0), 0);
EXPECT_EQ(Int8Int8Test(-5, 3, -5, 3), 0);
EXPECT_EQ(Int8Int8Test(1, 0, 0, 1), 1);
EXPECT_EQ(Int8Int8Test(0, 1, 1, 0), -1);
EXPECT_EQ(Int8Int8Test(1, 0, 0, 1), 1);
EXPECT_EQ(Int8Int8Test(2, 4, 1, 7), 1);
EXPECT_EQ(Int8Int8Test(3, 7, 4, 0), -1);
EXPECT_EQ(Int8Int8Test(6, 4, 5, 7), 1);
EXPECT_EQ(Int8Int8Test(5, 5, 6, 4), -1);
EXPECT_EQ(Int8Int8Test(6, 1, 3, 7), 1);
EXPECT_EQ(Int8Int8Test(INT8_MAX / 2 + 2, 1, 1, INT8_MAX), 1);
EXPECT_EQ(Int8Int8Test(INT8_MAX / 2, 1, 1, INT8_MAX), -1);
}
TEST_F(TupleRowCompareTest, TimestampTest) {
EXPECT_EQ(TimestampTimestampTest(
"2015-04-09 14:07:46.580465000", "2015-04-09 14:07:46.580465000",
"2015-04-09 14:07:46.580465000", "2015-04-09 14:07:46.580465000"), 0);
EXPECT_EQ(TimestampTimestampTest(
"1415-12-09 10:07:44.314159265", "2015-04-09 14:07:46.580465000",
"1415-12-09 10:07:44.314159265", "2015-04-09 14:07:46.580465000"), 0);
EXPECT_EQ(TimestampTimestampTest(1, 0, 0, 1), 1);
EXPECT_EQ(TimestampTimestampTest(0, 1, 1, 0), -1);
EXPECT_EQ(TimestampTimestampTest(1, 0, 0, 1), 1);
EXPECT_EQ(TimestampTimestampTest(2, 4, 1, 7), 1);
EXPECT_EQ(TimestampTimestampTest(3, 7, 4, 0), -1);
EXPECT_EQ(TimestampTimestampTest(6, 4, 5, 7), 1);
EXPECT_EQ(TimestampTimestampTest(5, 5, 6, 4), -1);
EXPECT_EQ(TimestampTimestampTest(6, 1, 3, 7), 1);
EXPECT_EQ(TimestampTimestampTest(
"1400-01-01 00:00:00.000000000", "9999-12-31 14:07:46.580465000",
"8000-12-09 10:07:44.314159265", "2015-04-09 14:07:46.580465000"), -1);
EXPECT_EQ(TimestampTimestampTest(
"1400-01-01 00:00:00.000000001", "1400-01-01 00:00:00.000000000",
"1400-01-01 00:00:00.000000000", "1400-01-01 00:00:00.000000001"), 1);
EXPECT_EQ(TimestampTimestampTest(
"1400-01-01 00:00:00.000000003", "1400-01-01 00:00:00.000000007",
"1400-01-01 00:00:00.000000004", "1400-01-01 00:00:00.000000000"), -1);
EXPECT_EQ(TimestampTimestampTest(
"1400-01-01 00:00:00.000000006", "1400-01-01 00:00:00.000000004",
"1400-01-01 00:00:00.000000005", "1400-01-01 00:00:00.000000007"), 1);
EXPECT_EQ(TimestampTimestampTest(
"1400-01-01 00:00:00.000000005", "1400-01-01 00:00:00.000000005",
"1400-01-01 00:00:00.000000006", "1400-01-01 00:00:00.000000004"), -1);
EXPECT_EQ(TimestampTimestampTest(
"1400-01-01 23:59:59.999999999", "1400-01-01 00:00:00.000000000",
"1400-01-02 00:00:00.000000000", "1400-01-01 00:00:00.000000000"), -1);
EXPECT_EQ(TimestampTimestampTest(
"3541-11-03 23:59:59.999999999", "3541-11-03 00:00:00.000000000",
"3541-11-04 00:00:00.000000000", "3541-11-03 00:00:00.000000000"), -1);
}
TEST_F(TupleRowCompareTest, DecimalTest) {
EXPECT_EQ(DecimalDecimalTest<Decimal4Value>(1, 1, 1, 1, 4, 2), 0);
EXPECT_EQ(DecimalDecimalTest<Decimal4Value>(-5, 3, -5, 3, 2, 1), 0);
EXPECT_EQ(DecimalDecimalTest<Decimal4Value>(1, 0, 0, 1, 1, 0), 1);
EXPECT_EQ(DecimalDecimalTest<Decimal4Value>(0, 1, 1, 0, 1, 0), -1);
EXPECT_EQ(DecimalDecimalTest<Decimal4Value>(256, 10, 255, 100, 4, 2), 1);
EXPECT_EQ(DecimalDecimalTest<Decimal4Value>(3, 1024, 128, 1023, 9, 1), 1);
EXPECT_EQ(DecimalDecimalTest<Decimal4Value>(1024, 511, 1023, 0, 5, 0), 1);
EXPECT_EQ(DecimalDecimalTest<Decimal4Value>(5550, 0, 5000, 4097, 9, 3), -1);
EXPECT_EQ(DecimalDecimalTest<Decimal8Value>(1, 1, 1, 1, 4, 2), 0);
EXPECT_EQ(DecimalDecimalTest<Decimal8Value>(-5, 3, -5, 3, 2, 1), 0);
EXPECT_EQ(DecimalDecimalTest<Decimal8Value>(1, 0, 0, 1, 1, 0), 1);
EXPECT_EQ(DecimalDecimalTest<Decimal8Value>(0, 1, 1, 0, 1, 0), -1);
EXPECT_EQ(DecimalDecimalTest<Decimal8Value>(256, 10, 255, 100, 18, 0), 1);
EXPECT_EQ(DecimalDecimalTest<Decimal8Value>(3, 1024, 128, 1023, 18, 1), 1);
EXPECT_EQ(DecimalDecimalTest<Decimal8Value>(1024, 511, 1023, 0, 18, 0), 1);
EXPECT_EQ(DecimalDecimalTest<Decimal8Value>(5550, 0, 5000, 4097, 18, 3), -1);
EXPECT_EQ(DecimalDecimalTest<Decimal16Value>(1, 1, 1, 1, 4, 2), 0);
EXPECT_EQ(DecimalDecimalTest<Decimal16Value>(-5, 3, -5, 3, 2, 1), 0);
EXPECT_EQ(DecimalDecimalTest<Decimal16Value>(1, 0, 0, 1, 1, 0), 1);
EXPECT_EQ(DecimalDecimalTest<Decimal16Value>(0, 1, 1, 0, 1, 0), -1);
EXPECT_EQ(DecimalDecimalTest<Decimal16Value>(256, 10, 255, 100,
ColumnType::MAX_PRECISION, 0), 1);
EXPECT_EQ(DecimalDecimalTest<Decimal16Value>(3, 1024, 128, 1023,
ColumnType::MAX_PRECISION, 0), 1);
EXPECT_EQ(DecimalDecimalTest<Decimal16Value>(1024, 511, 1023, 0,
ColumnType::MAX_PRECISION, 0), 1);
EXPECT_EQ(DecimalDecimalTest<Decimal16Value>(5550, 0, 5000, 4097,
ColumnType::MAX_PRECISION, 0), -1);
}
TEST_F(TupleRowCompareTest, AllTypeTest) {
int precision = 9, scale = 0;
bool overflow = false;
CreateComperator(ColumnType(TYPE_TIMESTAMP), ColumnType(TYPE_BOOLEAN),
ColumnType(TYPE_TINYINT), ColumnType(TYPE_BIGINT), ColumnType::CreateCharType(1),
ColumnType(ColumnType::CreateDecimalType(precision, scale)));
TupleRow* lhs = CreateTupleRow(
TimestampValue::ParseSimpleDateFormat("1400-01-01 00:00:00.000000000"),
false, static_cast<int8_t>(0), static_cast<int64_t>(0), '~',
Decimal4Value::FromInt(precision, scale, 0, &overflow));
TupleRow* rhs = CreateTupleRow(
TimestampValue::ParseSimpleDateFormat("1400-01-01 00:00:00.000000000"),
false, static_cast<int8_t>(0), static_cast<int64_t>(0), '~',
Decimal4Value::FromInt(precision, scale, 0, &overflow));
EXPECT_EQ(comperator_->Compare(lhs, rhs), 0);
lhs = CreateTupleRow(
TimestampValue::ParseSimpleDateFormat("1400-01-01 00:00:00.000000002"),
false, static_cast<int8_t>(1), static_cast<int64_t>(1), '~',
Decimal4Value::FromInt(precision, scale, 1, &overflow));
rhs = CreateTupleRow(
TimestampValue::ParseSimpleDateFormat("1400-01-01 00:00:00.000000001"),
false, static_cast<int8_t>(1), static_cast<int64_t>(1), '~',
Decimal4Value::FromInt(precision, scale, 1, &overflow));
EXPECT_EQ(comperator_->Compare(lhs, rhs), 1);
lhs = CreateTupleRow(
TimestampValue::ParseSimpleDateFormat("1400-01-01 00:00:00.000000002"),
false, static_cast<int8_t>(1), static_cast<int64_t>(1), '~',
Decimal4Value::FromInt(precision, scale, 1, &overflow));
rhs = CreateTupleRow(
TimestampValue::ParseSimpleDateFormat("1400-01-01 00:00:00.000000001"),
false, static_cast<int8_t>(42), static_cast<int64_t>(1), '~',
Decimal4Value::FromInt(precision, scale, 1, &overflow));
EXPECT_EQ(comperator_->Compare(lhs, rhs), -1);
// Checking the dominance of types (bigger types should not dominate smaller ones)
lhs = CreateTupleRow(
TimestampValue::ParseSimpleDateFormat("1400-01-01 00:00:00.000000000"),
true, static_cast<int8_t>(0), static_cast<int64_t>(0), '~',
Decimal4Value::FromInt(precision, scale, 0, &overflow));
rhs = CreateTupleRow(
TimestampValue::ParseSimpleDateFormat("1400-01-01 23:59:59.999999999"),
false, static_cast<int8_t>(0), static_cast<int64_t>(0), '~',
Decimal4Value::FromInt(precision, scale, 0, &overflow));
EXPECT_EQ(comperator_->Compare(lhs, rhs), 1);
lhs = CreateTupleRow(
TimestampValue::ParseSimpleDateFormat("1400-01-01 00:00:00.000000000"),
false, static_cast<int8_t>(0), static_cast<int64_t>(1) << 5, '~',
Decimal4Value::FromInt(precision, scale, 0, &overflow));
rhs = CreateTupleRow(
TimestampValue::ParseSimpleDateFormat("1400-01-01 23:59:59.999999999"),
false, static_cast<int8_t>(0), static_cast<int64_t>(0), '~',
Decimal4Value::FromInt(precision, scale, 0, &overflow));
EXPECT_EQ(comperator_->Compare(lhs, rhs), 1);
lhs = CreateTupleRow(
TimestampValue::ParseSimpleDateFormat("1400-01-01 00:00:00.000000000"),
false, static_cast<int8_t>(0), static_cast<int64_t>(1) << 5, '~',
Decimal4Value::FromInt(precision, scale, 0, &overflow));
rhs = CreateTupleRow(
TimestampValue::ParseSimpleDateFormat("1400-01-01 00:00:00.000000000"),
false, static_cast<int8_t>(1), static_cast<int64_t>(0), '~',
Decimal4Value::FromInt(precision, scale, 0, &overflow));
EXPECT_EQ(comperator_->Compare(lhs, rhs), -1);
comperator_->Close(runtime_state_);
}
// Without converting into 128-bit representation, only 64-bit comparison
TEST_F(TupleRowCompareTest, All64TypeTest) {
int precision = 9, scale = 0;
bool overflow = false;
CreateComperator(ColumnType(TYPE_BOOLEAN), ColumnType(TYPE_TINYINT),
ColumnType(TYPE_SMALLINT), ColumnType(TYPE_INT),
ColumnType(TYPE_BIGINT), ColumnType::CreateCharType(1),
ColumnType(ColumnType::CreateDecimalType(precision, scale)));
TupleRow* lhs = CreateTupleRow(
false, static_cast<int8_t>(0), static_cast<int16_t>(0), static_cast<int32_t>(0),
static_cast<int64_t>(0), '~',
Decimal4Value::FromInt(precision, scale, 0, &overflow));
TupleRow* rhs = CreateTupleRow(
false, static_cast<int8_t>(0), static_cast<int16_t>(0), static_cast<int32_t>(0),
static_cast<int64_t>(0), '~',
Decimal4Value::FromInt(precision, scale, 0, &overflow));
EXPECT_EQ(comperator_->Compare(lhs, rhs), 0);
lhs = CreateTupleRow(
false, static_cast<int8_t>(1), static_cast<int16_t>(1), static_cast<int32_t>(1),
static_cast<int64_t>(1), 'z',
Decimal4Value::FromInt(precision, scale, 1, &overflow));
rhs = CreateTupleRow(
false, static_cast<int8_t>(1), static_cast<int16_t>(1), static_cast<int32_t>(1),
static_cast<int64_t>(1), 'a',
Decimal4Value::FromInt(precision, scale, 1, &overflow));
EXPECT_EQ(comperator_->Compare(lhs, rhs), 1);
lhs = CreateTupleRow(
false, static_cast<int8_t>(1), static_cast<int16_t>(1), static_cast<int32_t>(1),
static_cast<int64_t>(1), '~',
Decimal4Value::FromInt(precision, scale, 1, &overflow));
rhs = CreateTupleRow(
false, static_cast<int8_t>(1), static_cast<int16_t>(56), static_cast<int32_t>(1),
static_cast<int64_t>(1), '~',
Decimal4Value::FromInt(precision, scale, 1, &overflow));
EXPECT_EQ(comperator_->Compare(lhs, rhs), -1);
comperator_->Close(runtime_state_);
}
// Without converting into 64-bit representation, only 32-bit comparison
TEST_F(TupleRowCompareTest, All32TypeTest) {
int precision = 9, scale = 0;
bool overflow = false;
CreateComperator(ColumnType(TYPE_BOOLEAN), ColumnType(TYPE_TINYINT),
ColumnType(TYPE_SMALLINT), ColumnType(TYPE_INT), ColumnType::CreateCharType(1),
ColumnType(ColumnType::CreateDecimalType(precision, scale)));
TupleRow* lhs = CreateTupleRow(
false, static_cast<int8_t>(0), static_cast<int16_t>(0), static_cast<int32_t>(0),
'~', Decimal4Value::FromInt(precision, scale, 0, &overflow));
TupleRow* rhs = CreateTupleRow(
false, static_cast<int8_t>(0), static_cast<int16_t>(0), static_cast<int32_t>(0),
'~', Decimal4Value::FromInt(precision, scale, 0, &overflow));
EXPECT_EQ(comperator_->Compare(lhs, rhs), 0);
lhs = CreateTupleRow(
false, static_cast<int8_t>(1), static_cast<int16_t>(1), static_cast<int32_t>(1),
'~', Decimal4Value::FromInt(precision, scale, 312, &overflow));
rhs = CreateTupleRow(
false, static_cast<int8_t>(1), static_cast<int16_t>(1), static_cast<int32_t>(1),
'~', Decimal4Value::FromInt(precision, scale, 1, &overflow));
EXPECT_EQ(comperator_->Compare(lhs, rhs), 1);
lhs = CreateTupleRow(
false, static_cast<int8_t>(1), static_cast<int16_t>(1), static_cast<int32_t>(1),
'~', Decimal4Value::FromInt(precision, scale, 1, &overflow));
rhs = CreateTupleRow(
false, static_cast<int8_t>(1), static_cast<int16_t>(1), static_cast<int32_t>(56),
'~', Decimal4Value::FromInt(precision, scale, 1, &overflow));
EXPECT_EQ(comperator_->Compare(lhs, rhs), -1);
comperator_->Close(runtime_state_);
}
TEST_F(TupleRowCompareTest, StringTest) {
EXPECT_EQ(StringString4ByteTest("hello", "hello", "hello", "hello"), 0);
EXPECT_EQ(StringString4ByteTest(std::string(255, 'a'), std::string(255, 'a'),
std::string(255, 'a'), std::string(255, 'a')), 0);
EXPECT_EQ(StringString4ByteTest(std::string(2550, 'a'), std::string(2550, 'a'),
std::string(2550, 'a'), std::string(2550, 'a')), 0);
EXPECT_EQ(StringString4ByteTest("hello1", "hello2", "hello3", "hello4"), 0);
EXPECT_EQ(StringString4ByteTest("2", "h", "2", "h2"), -1);
EXPECT_EQ(StringString4ByteTest("", "h", "", ""), 1);
EXPECT_EQ(StringString4ByteTest("ab", "cd", "aw", "ca"), -1);
EXPECT_EQ(StringString4ByteTest("ab", "yd", "ac", "ca"), 1);
EXPECT_EQ(StringString4ByteTest("zz", "ydz", "a", "caaa"), 1);
EXPECT_EQ(StringString8ByteTest("hello1", "hello2", "hello3", "hello4"), -1);
EXPECT_EQ(StringString8ByteTest("12345678a", "12345678b",
"12345678c", "12345678d"), 0);
EXPECT_EQ(StringString8ByteTest("aa", "bbbbbbbb", "aa", "bbbbbbba"), 1);
EXPECT_EQ(StringString8ByteTest("2", "h", "2", "h2"), -1);
EXPECT_EQ(StringString8ByteTest("", "h", "", ""), 1);
EXPECT_EQ(StringString8ByteTest("ab", "cd", "aw", "ca"), -1);
EXPECT_EQ(StringString8ByteTest("ab", "yd", "ac", "ca"), 1);
EXPECT_EQ(StringString8ByteTest("zz", "ydz", "a", "caaa"), 1);
EXPECT_EQ(StringString16ByteTest("12345678a", "12345678b",
"12345678c", "12345678d"), -1);
EXPECT_EQ(StringString16ByteTest("1234567812345678a", "1234567812345678b",
"1234567812345678c", "1234567812345678d"), 0);
EXPECT_EQ(StringString16ByteTest("aa", "bbbbbbbb", "aa", "bbbbbbba"), 1);
EXPECT_EQ(StringString16ByteTest("aa", "1234567812345678",
"aa", "1234567812345679"), -1);
EXPECT_EQ(StringString16ByteTest("2", "h", "2", "h2"), -1);
EXPECT_EQ(StringString16ByteTest("", "h", "", ""), 1);
EXPECT_EQ(StringString16ByteTest("ab", "cd", "aw", "ca"), -1);
EXPECT_EQ(StringString16ByteTest("ab", "yd", "ac", "ca"), 1);
EXPECT_EQ(StringString16ByteTest("zz", "ydz", "a", "caaa"), 1);
}
TEST_F(TupleRowCompareTest, VarcharTest) {
EXPECT_EQ(VarcharVarchar4ByteTest("hello", "hello", "hello", "hello"), 0);
EXPECT_EQ(VarcharVarchar4ByteTest("hello", "hello", "hello", "hello"), 0);
EXPECT_EQ(VarcharVarchar4ByteTest(std::string(255, 'a'), std::string(255, 'a'),
std::string(255, 'a'), std::string(255, 'a')), 0);
EXPECT_EQ(VarcharVarchar4ByteTest(std::string(2550, 'a'), std::string(2550, 'a'),
std::string(2550, 'a'), std::string(2550, 'a')), 0);
EXPECT_EQ(VarcharVarchar4ByteTest("hello1", "hello2", "hello3", "hello4"), 0);
EXPECT_EQ(VarcharVarchar4ByteTest("2", "h", "2", "h2"), -1);
EXPECT_EQ(VarcharVarchar4ByteTest("", "h", "", ""), 1);
EXPECT_EQ(VarcharVarchar4ByteTest("ab", "cd", "aw", "ca"), -1);
EXPECT_EQ(VarcharVarchar4ByteTest("ab", "yd", "ac", "ca"), 1);
EXPECT_EQ(VarcharVarchar4ByteTest("zz", "ydz", "a", "caaa"), 1);
EXPECT_EQ(VarcharVarchar8ByteTest("hello1", "hello2", "hello3", "hello4"), -1);
EXPECT_EQ(VarcharVarchar8ByteTest("12345678a", "12345678b",
"12345678c", "12345678d"), 0);
EXPECT_EQ(VarcharVarchar8ByteTest("aa", "bbbbbbbb", "aa", "bbbbbbba"), 1);
EXPECT_EQ(VarcharVarchar8ByteTest("2", "h", "2", "h2"), -1);
EXPECT_EQ(VarcharVarchar8ByteTest("", "h", "", ""), 1);
EXPECT_EQ(VarcharVarchar8ByteTest("ab", "cd", "aw", "ca"), -1);
EXPECT_EQ(VarcharVarchar8ByteTest("ab", "yd", "ac", "ca"), 1);
EXPECT_EQ(VarcharVarchar8ByteTest("zz", "ydz", "a", "caaa"), 1);
EXPECT_EQ(VarcharVarchar16ByteTest("12345678a", "12345678b",
"12345678c", "12345678d"), -1);
EXPECT_EQ(VarcharVarchar16ByteTest("1234567812345678a", "1234567812345678b",
"1234567812345678c", "1234567812345678d"), 0);
EXPECT_EQ(VarcharVarchar16ByteTest("aa", "bbbbbbbb", "aa", "bbbbbbba"), 1);
EXPECT_EQ(VarcharVarchar16ByteTest("aa", "1234567812345678",
"aa", "1234567812345679"), -1);
EXPECT_EQ(VarcharVarchar16ByteTest("2", "h", "2", "h2"), -1);
EXPECT_EQ(VarcharVarchar16ByteTest("", "h", "", ""), 1);
EXPECT_EQ(VarcharVarchar16ByteTest("ab", "cd", "aw", "ca"), -1);
EXPECT_EQ(VarcharVarchar16ByteTest("ab", "yd", "ac", "ca"), 1);
EXPECT_EQ(VarcharVarchar16ByteTest("zz", "ydz", "a", "caaa"), 1);
}
} //namespace impala
``` |
```java
package chapter5.section5;
import edu.princeton.cs.algs4.BinaryStdIn;
import edu.princeton.cs.algs4.BinaryStdOut;
/**
* Created by Rene Argento on 13/04/18.
*/
public class RunLengthEncoding {
private static final int LG_R = 8;
public static void compress() {
char count = 0;
boolean old = false;
while (!BinaryStdIn.isEmpty()) {
boolean bit = BinaryStdIn.readBoolean();
if (bit != old) {
BinaryStdOut.write(count, LG_R);
count = 0;
old = !old;
} else {
if (count == 255) {
BinaryStdOut.write(count, LG_R);
count = 0;
BinaryStdOut.write(count, LG_R);
}
}
count++;
}
BinaryStdOut.write(count);
BinaryStdOut.close();
}
public static void expand() {
boolean bit = false;
while (!BinaryStdIn.isEmpty()) {
char count = BinaryStdIn.readChar();
for (int i = 0; i < count; i++) {
BinaryStdOut.write(bit);
}
bit = !bit;
}
BinaryStdOut.close();
}
public static void main(String[] args) {
if (args[0].equals("-")) {
compress();
} else if (args[0].equals("+")) {
expand();
}
}
}
``` |
```c++
// (See accompanying file LICENSE.md or copy at path_to_url
#include <boost/hana/equal.hpp>
#include <boost/hana/then.hpp>
#include <boost/hana/tuple.hpp>
namespace hana = boost::hana;
struct undefined { };
static_assert(
hana::then(hana::make_tuple(undefined{}, undefined{}), hana::make_tuple(1, 2, 3))
==
hana::make_tuple(
1, 2, 3,
1, 2, 3
)
, "");
int main() { }
``` |
Senator Triplett may refer to:
Constance Triplett (born 1950s), North Dakota State Senate
George Washington Triplett (1809–1894), Kentucky State Senate |
The 1984 All-Ireland Junior Hurling Championship was the 63rd staging of the All-Ireland Junior Championship since its establishment by the Gaelic Athletic Association in 1912.
Cork entered the championship as the defending champions, however, they were beaten by Kilkenny in the All-Ireland semi-final.
The All-Ireland final was played on 5 August 1984 at Semple Stadium in Thurles, between Kilkenny and Galway, in what was their first ever meeting in a final. Kilkenny won the match by 0-13 to 2-05 to claim their fifth championship title overall and a first title since 1956.
Results
All-Ireland Junior Hurling Championship
All-Ireland semi-finals
All-Ireland final
References
Junior
All-Ireland Junior Hurling Championship |
Çamlıca is a leafy district of Üsküdar on the Asian side of Istanbul. It is famous for two hills—Big Çamlıca (Büyük Çamlıca in Turkish, 268m) and Little Çamlıca (Küçük Çamlıca in Turkish, 229m)—offering panoramic views across the Sea of Marmara and the Princes' Islands to the European side of Istanbul and Sarayburnu. Historically, these were renowned beauty spots although by the end of the 20th century modern development had detracted from that beauty, not least when a series of radio and television towers were built on the hills.
Among the artists to leave drawings of the panoramic view from Büyük Çamlıca in its 19th-century heyday was the Usküdar-born artist Hoca Ali Rıza.
Çamlıca can be reached on the M5 Metro line from Üsküdar at Kısıklı and Bulgurlu stations.
Attractions
Büyük Çamlıca Mosque
In 2019 Turkey's largest mosque, the Great Çamlıca Mosque (Büyük Çamlıca Cami in Turkish), opened on Big Çamlıca Hill. It is only the third mosque in Turkey to have six minarets and can be seen from much of the centre of the city.
Çamlıca Tower
In 2021 the 369m-high Çamlıca Tower (Çamlıca Kulesi in Turkish) opened on Little Çamlıca Hill, in an attempt to bring all the radio and television masts together in one structure. It is open to the public and contains a restaurant with spectacular Istanbul city views.
Küçük Çamlıca Wood (Küçük Çamlıca Korusu)
From as early as 1654 in the reign of Sultan Mehmed IV this woodland area near Kısıklı Metro station was landscaped and is now full of mature deciduous and evergreen trees. In 1940 Istanbul Governor Lütfı Kırdar had it turned into a public recreation area, now very popular with picnickers. It now merges seamlessly with Küçük Çamlıca Hill with the Çamlıca Tower looming above it.
Right beside the woodland is the modern Çilehane Cami, built beside a small 17th-century stone building, much restored over the centuries, where a holy man named Aziz Mahmud Hüdayı Efendi once lived with his family in two simple rooms.
Çamlıca Girls High School
In the Acıbadem neighbourhood of Çamlıca stands a crumbling wooden mansion designed by architect Kemaleddin Bey for the Vice-Admiral Ahmed Ratıp Paşa. The pasha never got to live in his mansion because of a scandal over the funding of the Hejaz railway, and in 1938 it was converted to house the local high school for girls. This has since been moved into a modern building, leaving the mansion to its fate.
References
Neighbourhoods of Üsküdar |
```objective-c
#ifndef SELECT_FROM_LIST_DIALOG_H
#define SELECT_FROM_LIST_DIALOG_H
#include <QDialog>
#include <deque>
#include "ui_selectlistdialog.h"
namespace Ui
{
class SelectFromListDialog;
}
class SelectFromListDialog : public QDialog
{
Q_OBJECT
public:
explicit SelectFromListDialog(const std::deque<std::string>& fields,
bool single_selection = true, QWidget* parent = 0);
~SelectFromListDialog();
std::vector<int> getSelectedRowNumber() const;
private slots:
void on_buttonBox_accepted();
void on_listFieldsWidget_currentRowChanged(int currentRow);
void on_listFieldsWidget_doubleClicked(const QModelIndex& index);
void on_pushButtonSelectAll_pressed();
void on_listFieldsWidget_clicked(const QModelIndex& index);
private:
Ui::SelectXAxisDialog* ui;
std::vector<int> _selected_row_number;
bool _single_selection;
};
//-----------------------------------------------
inline SelectFromListDialog::SelectFromListDialog(const std::deque<std::string>& fields,
bool single_selection, QWidget* parent)
: QDialog(parent), ui(new Ui::SelectXAxisDialog), _single_selection(single_selection)
{
auto flags = this->windowFlags();
this->setWindowFlags(flags | Qt::WindowStaysOnTopHint);
ui->setupUi(this);
if (!_single_selection)
{
ui->listFieldsWidget->setSelectionMode(QAbstractItemView::ExtendedSelection);
}
else
{
ui->pushButtonSelectAll->hide();
}
// if there is only one item in the list, select it by default
for (int i = 0; i < fields.size(); i++)
{
auto item = new QListWidgetItem(QString::fromStdString(fields[i]));
ui->listFieldsWidget->addItem(item);
if (fields.size() == 1)
{
item->setSelected(true);
}
}
}
inline SelectFromListDialog::~SelectFromListDialog()
{
delete ui;
}
inline std::vector<int> SelectFromListDialog::getSelectedRowNumber() const
{
return _selected_row_number;
}
inline void SelectFromListDialog::on_listFieldsWidget_clicked(const QModelIndex& index)
{
QModelIndexList indexes = ui->listFieldsWidget->selectionModel()->selectedIndexes();
ui->buttonBox->setEnabled(indexes.empty() == false);
}
inline void SelectFromListDialog::on_buttonBox_accepted()
{
QModelIndexList indexes = ui->listFieldsWidget->selectionModel()->selectedIndexes();
foreach (QModelIndex index, indexes)
{
_selected_row_number.push_back(index.row());
}
}
inline void SelectFromListDialog::on_listFieldsWidget_currentRowChanged(int)
{
QModelIndexList indexes = ui->listFieldsWidget->selectionModel()->selectedIndexes();
ui->buttonBox->setEnabled(indexes.empty() == false);
}
inline void SelectFromListDialog::on_listFieldsWidget_doubleClicked(const QModelIndex&)
{
if (_single_selection)
{
_selected_row_number.push_back(ui->listFieldsWidget->currentRow());
this->accept();
}
}
inline void SelectFromListDialog::on_pushButtonSelectAll_pressed()
{
for (int i = 0; i < ui->listFieldsWidget->count(); i++)
{
_selected_row_number.push_back(i);
}
this->accept();
}
#endif // SELECTXAXISDIALOG_H
``` |
Margaret Anne Ganley Somerville (born 13 April 1942) is a Catholic philosopher and professor of bioethics at University of Notre Dame Australia. She was previously Samuel Gale Professor of Law at McGill University.
Early life and career
Somerville was born in Adelaide, South Australia, and educated at Mercedes College (Springfield, South Australia). She received a A.u.A. (pharm.) from the University of Adelaide in 1963, a Bachelor of Law degree (Hons. I) and the University Medal from the University of Sydney in 1973, and a D.C.L. from McGill University in 1978.
Legal academic career
In 1978, she was appointed assistant professor in the law faculty at McGill. She was appointed an associate professor in 1979 and an associate professor in the faculty of medicine in 1980. In 1984, she became a full professor in both faculties, and in 1989, she was appointed the Samuel Gale Professor of Law. From 1986 to 1996, she was the founding director of the McGill Centre for Medicine, Ethics and Law and was appointed acting director in 1999. She also taught seminars on advanced torts and comparative medical law at McGill. Her archive is held at the McGill University Archives.
In November 2006, she gave the five annual Massey Lectures on CBC Radio in Canada. An expanded version of the lectures was published in Canada, Australia, and the United States in book form as The Ethical Imagination: Journeys of the Human Spirit.
Involvement in same-sex marriage debate
Somerville presented both a brief and an oral presentation to the Canadian House of Commons Standing Committee on Justice and Human Rights opposing the legalisation of same-sex marriage in Canada in 2003.
Honours
Among many honours and awards, in 1990, Somerville was made a Member of the Order of Australia "for service to the law and to bioethics". In 1991, she was made a Fellow of the Royal Society of Canada and in 2022 a fellow of the Royal Society of New South Wales. In 2004 she was chosen by an international jury as the first recipient of UNESCO's Avicenna Prize for Ethics in Science.
She has received honorary degrees from University of Windsor (1992), Macquarie University (1993), St. Francis Xavier University (1996) and the University of Waterloo (2004). Her honorary degree awarded 19 June 2006, at Ryerson University in Toronto was controversial because of her objections to same sex marriage. She has since received honorary degrees from Mount Saint Vincent University in Halifax, Nova Scotia (2009), St. Mark's College, Vancouver (2010) and the Royal Military College of Canada in Kingston, Ontario (2013).
In 2006, Somerville was nominated for membership in the Order of Canada by Carol Finlay, a professor at the Toronto School of Theology. Finlay says Somerville was turned down for the honour because she was "too controversial."
In 2020, Pope Francis named Somerville a Dame of the Order of Saint Gregory the Great for contributions to Bioethics.
Selected bibliography
Do We Care?: Renewing Canada's Commitment to Health (Editor) (1999, )
The Ethical Canary: Science, Society, and the Human Spirit (2000, )
Death Talk: The Case Against Euthanasia and Physician-Assisted Suicide (2001, )
The Ethical Imagination: Journeys of the Human Spirit (2006, )
Bird on an Ethics Wire: Battles about values in the Culture Wars (2015, )
See also
Avicenna Prize
Footnotes
References
1942 births
Living people
University of Notre Dame Australia people
Australian women philosophers
University of Adelaide alumni
Sydney Law School alumni
Canadian legal scholars
Fellows of the Royal Society of Canada
Academic staff of the McGill University Faculty of Law
Members of the Order of Australia
Australian ethicists
Canadian ethicists
20th-century Australian philosophers
Canadian philosophers
Canadian women philosophers
Catholic philosophers
Australian Roman Catholics
Canadian Roman Catholics
McGill University Faculty of Law alumni
Women legal scholars
Recipients of Avicenna Prize
20th-century Australian women |
```xml
/**
* @file Automatically generated by @tsed/barrels.
*/
export * from "./decorators/injectContext.js";
export * from "./domain/ContextLogger.js";
export * from "./domain/DIContext.js";
export * from "./interfaces/AlterRunInContext.js";
export * from "./services/DILogger.js";
export * from "./services/DITest.js";
export * from "./utils/asyncHookContext.js";
export * from "./utils/attachLogger.js";
export * from "./utils/setLoggerConfiguration.js";
export * from "./utils/setLoggerFormat.js";
export * from "./utils/setLoggerLevel.js";
``` |
```objective-c
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef V8_AST_SCOPES_H_
#define V8_AST_SCOPES_H_
#include "src/ast/ast.h"
#include "src/base/compiler-specific.h"
#include "src/base/hashmap.h"
#include "src/globals.h"
#include "src/objects.h"
#include "src/zone/zone.h"
namespace v8 {
namespace internal {
class AstNodeFactory;
class AstValueFactory;
class AstRawString;
class Declaration;
class ParseInfo;
class PreParsedScopeData;
class ProducedPreParsedScopeData;
class SloppyBlockFunctionStatement;
class Statement;
class StringSet;
class VariableProxy;
// A hash map to support fast variable declaration and lookup.
class VariableMap: public ZoneHashMap {
public:
explicit VariableMap(Zone* zone);
Variable* Declare(
Zone* zone, Scope* scope, const AstRawString* name, VariableMode mode,
VariableKind kind = NORMAL_VARIABLE,
InitializationFlag initialization_flag = kCreatedInitialized,
MaybeAssignedFlag maybe_assigned_flag = kNotAssigned,
bool* added = nullptr);
// Records that "name" exists (if not recorded yet) but doesn't create a
// Variable. Useful for preparsing.
Variable* DeclareName(Zone* zone, const AstRawString* name,
VariableMode mode);
Variable* Lookup(const AstRawString* name);
void Remove(Variable* var);
void Add(Zone* zone, Variable* var);
};
// Sloppy block-scoped function declarations to var-bind
class SloppyBlockFunctionMap : public ZoneHashMap {
public:
class Delegate : public ZoneObject {
public:
Delegate(Scope* scope, SloppyBlockFunctionStatement* statement, int index)
: scope_(scope), statement_(statement), next_(nullptr), index_(index) {}
void set_statement(Statement* statement);
void set_next(Delegate* next) { next_ = next; }
Delegate* next() const { return next_; }
Scope* scope() const { return scope_; }
int index() const { return index_; }
private:
Scope* scope_;
SloppyBlockFunctionStatement* statement_;
Delegate* next_;
int index_;
};
explicit SloppyBlockFunctionMap(Zone* zone);
void Declare(Zone* zone, const AstRawString* name, Scope* scope,
SloppyBlockFunctionStatement* statement);
private:
int count_;
};
enum class AnalyzeMode { kRegular, kDebugger };
// Global invariants after AST construction: Each reference (i.e. identifier)
// to a JavaScript variable (including global properties) is represented by a
// VariableProxy node. Immediately after AST construction and before variable
// allocation, most VariableProxy nodes are "unresolved", i.e. not bound to a
// corresponding variable (though some are bound during parse time). Variable
// allocation binds each unresolved VariableProxy to one Variable and assigns
// a location. Note that many VariableProxy nodes may refer to the same Java-
// Script variable.
// JS environments are represented in the parser using Scope, DeclarationScope
// and ModuleScope. DeclarationScope is used for any scope that hosts 'var'
// declarations. This includes script, module, eval, varblock, and function
// scope. ModuleScope further specializes DeclarationScope.
class V8_EXPORT_PRIVATE Scope : public NON_EXPORTED_BASE(ZoneObject) {
public:
// your_sha256_hash-----------
// Construction
Scope(Zone* zone, Scope* outer_scope, ScopeType scope_type);
#ifdef DEBUG
// The scope name is only used for printing/debugging.
void SetScopeName(const AstRawString* scope_name) {
scope_name_ = scope_name;
}
void set_needs_migration() { needs_migration_ = true; }
#endif
// TODO(verwaest): Is this needed on Scope?
int num_parameters() const;
DeclarationScope* AsDeclarationScope();
const DeclarationScope* AsDeclarationScope() const;
ModuleScope* AsModuleScope();
const ModuleScope* AsModuleScope() const;
class Snapshot final BASE_EMBEDDED {
public:
explicit Snapshot(Scope* scope);
~Snapshot();
void Reparent(DeclarationScope* new_parent) const;
private:
Scope* outer_scope_;
Scope* top_inner_scope_;
VariableProxy* top_unresolved_;
ThreadedList<Variable>::Iterator top_local_;
ThreadedList<Declaration>::Iterator top_decl_;
const bool outer_scope_calls_eval_;
};
enum class DeserializationMode { kIncludingVariables, kScopesOnly };
static Scope* DeserializeScopeChain(Zone* zone, ScopeInfo* scope_info,
DeclarationScope* script_scope,
AstValueFactory* ast_value_factory,
DeserializationMode deserialization_mode);
// Checks if the block scope is redundant, i.e. it does not contain any
// block scoped declarations. In that case it is removed from the scope
// tree and its children are reparented.
Scope* FinalizeBlockScope();
bool HasBeenRemoved() const;
// Find the first scope that hasn't been removed.
Scope* GetUnremovedScope();
// Inserts outer_scope into this scope's scope chain (and removes this
// from the current outer_scope_'s inner scope list).
// Assumes outer_scope_ is non-null.
void ReplaceOuterScope(Scope* outer_scope);
Zone* zone() const { return zone_; }
void SetMustUsePreParsedScopeData() {
if (must_use_preparsed_scope_data_) {
return;
}
must_use_preparsed_scope_data_ = true;
if (outer_scope_) {
outer_scope_->SetMustUsePreParsedScopeData();
}
}
bool must_use_preparsed_scope_data() const {
return must_use_preparsed_scope_data_;
}
// your_sha256_hash-----------
// Declarations
// Lookup a variable in this scope. Returns the variable or nullptr if not
// found.
Variable* LookupLocal(const AstRawString* name) {
Variable* result = variables_.Lookup(name);
if (result != nullptr || scope_info_.is_null()) return result;
return LookupInScopeInfo(name);
}
Variable* LookupInScopeInfo(const AstRawString* name);
// Lookup a variable in this scope or outer scopes.
// Returns the variable or nullptr if not found.
Variable* Lookup(const AstRawString* name);
// Declare a local variable in this scope. If the variable has been
// declared before, the previously declared variable is returned.
Variable* DeclareLocal(const AstRawString* name, VariableMode mode,
InitializationFlag init_flag = kCreatedInitialized,
VariableKind kind = NORMAL_VARIABLE,
MaybeAssignedFlag maybe_assigned_flag = kNotAssigned);
Variable* DeclareVariable(Declaration* declaration, VariableMode mode,
InitializationFlag init,
bool* sloppy_mode_block_scope_function_redefinition,
bool* ok);
// The return value is meaningful only if FLAG_preparser_scope_analysis is on.
Variable* DeclareVariableName(const AstRawString* name, VariableMode mode);
void DeclareCatchVariableName(const AstRawString* name);
// Declarations list.
ThreadedList<Declaration>* declarations() { return &decls_; }
ThreadedList<Variable>* locals() { return &locals_; }
// Create a new unresolved variable.
VariableProxy* NewUnresolved(AstNodeFactory* factory,
const AstRawString* name,
int start_pos = kNoSourcePosition,
VariableKind kind = NORMAL_VARIABLE) {
// Note that we must not share the unresolved variables with
// the same name because they may be removed selectively via
// RemoveUnresolved().
DCHECK(!already_resolved_);
DCHECK_EQ(factory->zone(), zone());
VariableProxy* proxy = factory->NewVariableProxy(name, kind, start_pos);
proxy->set_next_unresolved(unresolved_);
unresolved_ = proxy;
return proxy;
}
void AddUnresolved(VariableProxy* proxy);
// Remove a unresolved variable. During parsing, an unresolved variable
// may have been added optimistically, but then only the variable name
// was used (typically for labels). If the variable was not declared, the
// addition introduced a new unresolved variable which may end up being
// allocated globally as a "ghost" variable. RemoveUnresolved removes
// such a variable again if it was added; otherwise this is a no-op.
bool RemoveUnresolved(VariableProxy* var);
// Creates a new temporary variable in this scope's TemporaryScope. The
// name is only used for printing and cannot be used to find the variable.
// In particular, the only way to get hold of the temporary is by keeping the
// Variable* around. The name should not clash with a legitimate variable
// names.
// TODO(verwaest): Move to DeclarationScope?
Variable* NewTemporary(const AstRawString* name);
// your_sha256_hash-----------
// Illegal redeclaration support.
// Check if the scope has conflicting var
// declarations, i.e. a var declaration that has been hoisted from a nested
// scope over a let binding of the same name.
Declaration* CheckConflictingVarDeclarations();
// Check if the scope has a conflicting lexical declaration that has a name in
// the given list. This is used to catch patterns like
// `try{}catch(e){let e;}`,
// which is an error even though the two 'e's are declared in different
// scopes.
Declaration* CheckLexDeclarationsConflictingWith(
const ZoneList<const AstRawString*>& names);
// your_sha256_hash-----------
// Scope-specific info.
// Inform the scope and outer scopes that the corresponding code contains an
// eval call.
void RecordEvalCall() {
scope_calls_eval_ = true;
}
void RecordInnerScopeEvalCall() {
inner_scope_calls_eval_ = true;
for (Scope* scope = outer_scope(); scope != nullptr;
scope = scope->outer_scope()) {
if (scope->inner_scope_calls_eval_) {
return;
}
scope->inner_scope_calls_eval_ = true;
}
}
// Set the language mode flag (unless disabled by a global flag).
void SetLanguageMode(LanguageMode language_mode) {
DCHECK(!is_module_scope() || is_strict(language_mode));
set_language_mode(language_mode);
}
// Inform the scope that the scope may execute declarations nonlinearly.
// Currently, the only nonlinear scope is a switch statement. The name is
// more general in case something else comes up with similar control flow,
// for example the ability to break out of something which does not have
// its own lexical scope.
// The bit does not need to be stored on the ScopeInfo because none of
// the three compilers will perform hole check elimination on a variable
// located in VariableLocation::CONTEXT. So, direct eval and closures
// will not expose holes.
void SetNonlinear() { scope_nonlinear_ = true; }
// Position in the source where this scope begins and ends.
//
// * For the scope of a with statement
// with (obj) stmt
// start position: start position of first token of 'stmt'
// end position: end position of last token of 'stmt'
// * For the scope of a block
// { stmts }
// start position: start position of '{'
// end position: end position of '}'
// * For the scope of a function literal or decalaration
// function fun(a,b) { stmts }
// start position: start position of '('
// end position: end position of '}'
// * For the scope of a catch block
// try { stms } catch(e) { stmts }
// start position: start position of '('
// end position: end position of ')'
// * For the scope of a for-statement
// for (let x ...) stmt
// start position: start position of '('
// end position: end position of last token of 'stmt'
// * For the scope of a switch statement
// switch (tag) { cases }
// start position: start position of '{'
// end position: end position of '}'
int start_position() const { return start_position_; }
void set_start_position(int statement_pos) {
start_position_ = statement_pos;
}
int end_position() const { return end_position_; }
void set_end_position(int statement_pos) {
end_position_ = statement_pos;
}
// Scopes created for desugaring are hidden. I.e. not visible to the debugger.
bool is_hidden() const { return is_hidden_; }
void set_is_hidden() { is_hidden_ = true; }
void ForceContextAllocationForParameters() {
DCHECK(!already_resolved_);
force_context_allocation_for_parameters_ = true;
}
bool has_forced_context_allocation_for_parameters() const {
return force_context_allocation_for_parameters_;
}
// your_sha256_hash-----------
// Predicates.
// Specific scope types.
bool is_eval_scope() const { return scope_type_ == EVAL_SCOPE; }
bool is_function_scope() const { return scope_type_ == FUNCTION_SCOPE; }
bool is_module_scope() const { return scope_type_ == MODULE_SCOPE; }
bool is_script_scope() const { return scope_type_ == SCRIPT_SCOPE; }
bool is_catch_scope() const { return scope_type_ == CATCH_SCOPE; }
bool is_block_scope() const { return scope_type_ == BLOCK_SCOPE; }
bool is_with_scope() const { return scope_type_ == WITH_SCOPE; }
bool is_declaration_scope() const { return is_declaration_scope_; }
bool inner_scope_calls_eval() const { return inner_scope_calls_eval_; }
bool IsAsmModule() const;
// Returns true if this scope or any inner scopes that might be eagerly
// compiled are asm modules.
bool ContainsAsmModule() const;
// Does this scope have the potential to execute declarations non-linearly?
bool is_nonlinear() const { return scope_nonlinear_; }
// Whether this needs to be represented by a runtime context.
bool NeedsContext() const {
// Catch scopes always have heap slots.
DCHECK(!is_catch_scope() || num_heap_slots() > 0);
return num_heap_slots() > 0;
}
// your_sha256_hash-----------
// Accessors.
// The type of this scope.
ScopeType scope_type() const { return scope_type_; }
// The language mode of this scope.
LanguageMode language_mode() const {
return is_strict_ ? LanguageMode::kStrict : LanguageMode::kSloppy;
}
// inner_scope() and sibling() together implement the inner scope list of a
// scope. Inner scope points to the an inner scope of the function, and
// "sibling" points to a next inner scope of the outer scope of this scope.
Scope* inner_scope() const { return inner_scope_; }
Scope* sibling() const { return sibling_; }
// The scope immediately surrounding this scope, or nullptr.
Scope* outer_scope() const { return outer_scope_; }
Variable* catch_variable() const {
DCHECK(is_catch_scope());
DCHECK_EQ(1, num_var());
return static_cast<Variable*>(variables_.Start()->value);
}
bool ShouldBanArguments();
// your_sha256_hash-----------
// Variable allocation.
// Result of variable allocation.
int num_stack_slots() const { return num_stack_slots_; }
int num_heap_slots() const { return num_heap_slots_; }
int StackLocalCount() const;
int ContextLocalCount() const;
// Determine if we can parse a function literal in this scope lazily without
// caring about the unresolved variables within.
bool AllowsLazyParsingWithoutUnresolvedVariables(const Scope* outer) const;
// The number of contexts between this and scope; zero if this == scope.
int ContextChainLength(Scope* scope) const;
// The number of contexts between this and the outermost context that has a
// sloppy eval call. One if this->calls_sloppy_eval().
int ContextChainLengthUntilOutermostSloppyEval() const;
// Find the first function, script, eval or (declaration) block scope. This is
// the scope where var declarations will be hoisted to in the implementation.
DeclarationScope* GetDeclarationScope();
// Find the first non-block declaration scope. This should be either a script,
// function, or eval scope. Same as DeclarationScope(), but skips declaration
// "block" scopes. Used for differentiating associated function objects (i.e.,
// the scope for which a function prologue allocates a context) or declaring
// temporaries.
DeclarationScope* GetClosureScope();
const DeclarationScope* GetClosureScope() const;
// Find the first (non-arrow) function or script scope. This is where
// 'this' is bound, and what determines the function kind.
DeclarationScope* GetReceiverScope();
// Find the innermost outer scope that needs a context.
Scope* GetOuterScopeWithContext();
// Analyze() must have been called once to create the ScopeInfo.
Handle<ScopeInfo> scope_info() const {
DCHECK(!scope_info_.is_null());
return scope_info_;
}
int num_var() const { return variables_.occupancy(); }
// your_sha256_hash-----------
// Debugging.
#ifdef DEBUG
void Print(int n = 0); // n = indentation; n < 0 => don't print recursively
// Check that the scope has positions assigned.
void CheckScopePositions();
// Check that all Scopes in the scope tree use the same Zone.
void CheckZones();
#endif
// Retrieve `IsSimpleParameterList` of current or outer function.
bool HasSimpleParameters();
void set_is_debug_evaluate_scope() { is_debug_evaluate_scope_ = true; }
bool is_debug_evaluate_scope() const { return is_debug_evaluate_scope_; }
bool RemoveInnerScope(Scope* inner_scope) {
DCHECK_NOT_NULL(inner_scope);
if (inner_scope == inner_scope_) {
inner_scope_ = inner_scope_->sibling_;
return true;
}
for (Scope* scope = inner_scope_; scope != nullptr;
scope = scope->sibling_) {
if (scope->sibling_ == inner_scope) {
scope->sibling_ = scope->sibling_->sibling_;
return true;
}
}
return false;
}
protected:
explicit Scope(Zone* zone);
void set_language_mode(LanguageMode language_mode) {
is_strict_ = is_strict(language_mode);
}
private:
Variable* Declare(
Zone* zone, const AstRawString* name, VariableMode mode,
VariableKind kind = NORMAL_VARIABLE,
InitializationFlag initialization_flag = kCreatedInitialized,
MaybeAssignedFlag maybe_assigned_flag = kNotAssigned);
// This method should only be invoked on scopes created during parsing (i.e.,
// not deserialized from a context). Also, since NeedsContext() is only
// returning a valid result after variables are resolved, NeedsScopeInfo()
// should also be invoked after resolution.
bool NeedsScopeInfo() const;
Variable* NewTemporary(const AstRawString* name,
MaybeAssignedFlag maybe_assigned);
// Walk the scope chain to find DeclarationScopes; call
// SavePreParsedScopeDataForDeclarationScope for each.
void SavePreParsedScopeData();
Zone* zone_;
// Scope tree.
Scope* outer_scope_; // the immediately enclosing outer scope, or nullptr
Scope* inner_scope_; // an inner scope of this scope
Scope* sibling_; // a sibling inner scope of the outer scope of this scope.
// The variables declared in this scope:
//
// All user-declared variables (incl. parameters). For script scopes
// variables may be implicitly 'declared' by being used (possibly in
// an inner scope) with no intervening with statements or eval calls.
VariableMap variables_;
// In case of non-scopeinfo-backed scopes, this contains the variables of the
// map above in order of addition.
ThreadedList<Variable> locals_;
// Unresolved variables referred to from this scope. The proxies themselves
// form a linked list of all unresolved proxies.
VariableProxy* unresolved_;
// Declarations.
ThreadedList<Declaration> decls_;
// Serialized scope info support.
Handle<ScopeInfo> scope_info_;
// Debugging support.
#ifdef DEBUG
const AstRawString* scope_name_;
// True if it doesn't need scope resolution (e.g., if the scope was
// constructed based on a serialized scope info or a catch context).
bool already_resolved_;
// True if this scope may contain objects from a temp zone that needs to be
// fixed up.
bool needs_migration_;
#endif
// Source positions.
int start_position_;
int end_position_;
// Computed via AllocateVariables.
int num_stack_slots_;
int num_heap_slots_;
// The scope type.
const ScopeType scope_type_;
// Scope-specific information computed during parsing.
//
// The language mode of this scope.
STATIC_ASSERT(LanguageModeSize == 2);
bool is_strict_ : 1;
// This scope or a nested catch scope or with scope contain an 'eval' call. At
// the 'eval' call site this scope is the declaration scope.
bool scope_calls_eval_ : 1;
// This scope's declarations might not be executed in order (e.g., switch).
bool scope_nonlinear_ : 1;
bool is_hidden_ : 1;
// Temporary workaround that allows masking of 'this' in debug-evalute scopes.
bool is_debug_evaluate_scope_ : 1;
// True if one of the inner scopes or the scope itself calls eval.
bool inner_scope_calls_eval_ : 1;
bool force_context_allocation_ : 1;
bool force_context_allocation_for_parameters_ : 1;
// True if it holds 'var' declarations.
bool is_declaration_scope_ : 1;
bool must_use_preparsed_scope_data_ : 1;
// Create a non-local variable with a given name.
// These variables are looked up dynamically at runtime.
Variable* NonLocal(const AstRawString* name, VariableMode mode);
// Variable resolution.
// Lookup a variable reference given by name recursively starting with this
// scope, and stopping when reaching the outer_scope_end scope. If the code is
// executed because of a call to 'eval', the context parameter should be set
// to the calling context of 'eval'.
Variable* LookupRecursive(ParseInfo* info, VariableProxy* proxy,
Scope* outer_scope_end);
void ResolveTo(ParseInfo* info, VariableProxy* proxy, Variable* var);
V8_WARN_UNUSED_RESULT bool ResolveVariable(ParseInfo* info,
VariableProxy* proxy);
V8_WARN_UNUSED_RESULT bool ResolveVariablesRecursively(ParseInfo* info);
// Finds free variables of this scope. This mutates the unresolved variables
// list along the way, so full resolution cannot be done afterwards.
// If a ParseInfo* is passed, non-free variables will be resolved.
VariableProxy* FetchFreeVariables(DeclarationScope* max_outer_scope,
ParseInfo* info = nullptr,
VariableProxy* stack = nullptr);
// Predicates.
bool MustAllocate(Variable* var);
bool MustAllocateInContext(Variable* var);
// Variable allocation.
void AllocateStackSlot(Variable* var);
void AllocateHeapSlot(Variable* var);
void AllocateNonParameterLocal(Variable* var);
void AllocateDeclaredGlobal(Variable* var);
void AllocateNonParameterLocalsAndDeclaredGlobals();
void AllocateVariablesRecursively();
void AllocateScopeInfosRecursively(Isolate* isolate,
MaybeHandle<ScopeInfo> outer_scope);
void AllocateDebuggerScopeInfos(Isolate* isolate,
MaybeHandle<ScopeInfo> outer_scope);
// Construct a scope based on the scope info.
Scope(Zone* zone, ScopeType type, Handle<ScopeInfo> scope_info);
// Construct a catch scope with a binding for the name.
Scope(Zone* zone, const AstRawString* catch_variable_name,
MaybeAssignedFlag maybe_assigned, Handle<ScopeInfo> scope_info);
void AddInnerScope(Scope* inner_scope) {
inner_scope->sibling_ = inner_scope_;
inner_scope_ = inner_scope;
inner_scope->outer_scope_ = this;
}
void SetDefaults();
friend class DeclarationScope;
friend class ScopeTestHelper;
};
class V8_EXPORT_PRIVATE DeclarationScope : public Scope {
public:
DeclarationScope(Zone* zone, Scope* outer_scope, ScopeType scope_type,
FunctionKind function_kind = kNormalFunction);
DeclarationScope(Zone* zone, ScopeType scope_type,
Handle<ScopeInfo> scope_info);
// Creates a script scope.
DeclarationScope(Zone* zone, AstValueFactory* ast_value_factory);
bool IsDeclaredParameter(const AstRawString* name) {
// If IsSimpleParameterList is false, duplicate parameters are not allowed,
// however `arguments` may be allowed if function is not strict code. Thus,
// the assumptions explained above do not hold.
return params_.Contains(variables_.Lookup(name));
}
FunctionKind function_kind() const { return function_kind_; }
bool is_arrow_scope() const {
return is_function_scope() && IsArrowFunction(function_kind_);
}
// Inform the scope that the corresponding code uses "super".
void RecordSuperPropertyUsage() {
DCHECK(IsConciseMethod(function_kind()) ||
IsAccessorFunction(function_kind()) ||
IsClassConstructor(function_kind()));
scope_uses_super_property_ = true;
}
// Does this scope access "super" property (super.foo).
bool NeedsHomeObject() const {
return scope_uses_super_property_ ||
(inner_scope_calls_eval_ && (IsConciseMethod(function_kind()) ||
IsAccessorFunction(function_kind()) ||
IsClassConstructor(function_kind())));
}
bool calls_sloppy_eval() const {
return scope_calls_eval_ && is_sloppy(language_mode());
}
bool was_lazily_parsed() const { return was_lazily_parsed_; }
#ifdef DEBUG
void set_is_being_lazily_parsed(bool is_being_lazily_parsed) {
is_being_lazily_parsed_ = is_being_lazily_parsed;
}
bool is_being_lazily_parsed() const { return is_being_lazily_parsed_; }
#endif
bool ShouldEagerCompile() const;
void set_should_eager_compile();
void SetScriptScopeInfo(Handle<ScopeInfo> scope_info) {
DCHECK(is_script_scope());
DCHECK(scope_info_.is_null());
scope_info_ = scope_info;
}
bool asm_module() const { return asm_module_; }
void set_asm_module();
bool should_ban_arguments() const {
return IsClassFieldsInitializerFunction(function_kind());
}
void DeclareThis(AstValueFactory* ast_value_factory);
void DeclareArguments(AstValueFactory* ast_value_factory);
void DeclareDefaultFunctionVariables(AstValueFactory* ast_value_factory);
// Declare the function variable for a function literal. This variable
// is in an intermediate scope between this function scope and the the
// outer scope. Only possible for function scopes; at most one variable.
//
// This function needs to be called after all other variables have been
// declared in the scope. It will add a variable for {name} to {variables_};
// either the function variable itself, or a non-local in case the function
// calls sloppy eval.
Variable* DeclareFunctionVar(const AstRawString* name);
// Declare some special internal variables which must be accessible to
// Ignition without ScopeInfo.
Variable* DeclareGeneratorObjectVar(const AstRawString* name);
Variable* DeclarePromiseVar(const AstRawString* name);
// Declare a parameter in this scope. When there are duplicated
// parameters the rightmost one 'wins'. However, the implementation
// expects all parameters to be declared and from left to right.
Variable* DeclareParameter(const AstRawString* name, VariableMode mode,
bool is_optional, bool is_rest, bool* is_duplicate,
AstValueFactory* ast_value_factory, int position);
// Declares that a parameter with the name exists. Creates a Variable and
// returns it if FLAG_preparser_scope_analysis is on.
Variable* DeclareParameterName(const AstRawString* name, bool is_rest,
AstValueFactory* ast_value_factory,
bool declare_local, bool add_parameter);
// Declare an implicit global variable in this scope which must be a
// script scope. The variable was introduced (possibly from an inner
// scope) by a reference to an unresolved variable with no intervening
// with statements or eval calls.
Variable* DeclareDynamicGlobal(const AstRawString* name,
VariableKind variable_kind);
// The variable corresponding to the 'this' value.
Variable* receiver() {
DCHECK(has_this_declaration());
DCHECK_NOT_NULL(receiver_);
return receiver_;
}
// TODO(wingo): Add a GLOBAL_SCOPE scope type which will lexically allocate
// "this" (and no other variable) on the native context. Script scopes then
// will not have a "this" declaration.
bool has_this_declaration() const {
return (is_function_scope() && !is_arrow_scope()) || is_module_scope();
}
// The variable corresponding to the 'new.target' value.
Variable* new_target_var() { return new_target_; }
// The variable holding the function literal for named function
// literals, or nullptr. Only valid for function scopes.
Variable* function_var() const { return function_; }
Variable* generator_object_var() const {
DCHECK(is_function_scope() || is_module_scope());
return GetRareVariable(RareVariable::kGeneratorObject);
}
Variable* promise_var() const {
DCHECK(is_function_scope());
DCHECK(IsAsyncFunction(function_kind_));
if (IsAsyncGeneratorFunction(function_kind_)) return nullptr;
return GetRareVariable(RareVariable::kPromise);
}
// Parameters. The left-most parameter has index 0.
// Only valid for function and module scopes.
Variable* parameter(int index) const {
DCHECK(is_function_scope() || is_module_scope());
return params_[index];
}
// Returns the number of formal parameters, excluding a possible rest
// parameter. Examples:
// function foo(a, b) {} ==> 2
// function foo(a, b, ...c) {} ==> 2
// function foo(a, b, c = 1) {} ==> 3
int num_parameters() const {
return has_rest_ ? params_.length() - 1 : params_.length();
}
// The function's rest parameter (nullptr if there is none).
Variable* rest_parameter() const {
return has_rest_ ? params_[params_.length() - 1] : nullptr;
}
bool has_simple_parameters() const { return has_simple_parameters_; }
// TODO(caitp): manage this state in a better way. PreParser must be able to
// communicate that the scope is non-simple, without allocating any parameters
// as the Parser does. This is necessary to ensure that TC39's proposed early
// error can be reported consistently regardless of whether lazily parsed or
// not.
void SetHasNonSimpleParameters() {
DCHECK(is_function_scope());
has_simple_parameters_ = false;
}
// The local variable 'arguments' if we need to allocate it; nullptr
// otherwise.
Variable* arguments() const {
DCHECK(!is_arrow_scope() || arguments_ == nullptr);
return arguments_;
}
Variable* this_function_var() const {
Variable* this_function = GetRareVariable(RareVariable::kThisFunction);
// This is only used in derived constructors atm.
DCHECK(this_function == nullptr ||
(is_function_scope() && (IsClassConstructor(function_kind()) ||
IsConciseMethod(function_kind()) ||
IsAccessorFunction(function_kind()))));
return this_function;
}
// Adds a local variable in this scope's locals list. This is for adjusting
// the scope of temporaries and do-expression vars when desugaring parameter
// initializers.
void AddLocal(Variable* var);
void DeclareSloppyBlockFunction(
const AstRawString* name, Scope* scope,
SloppyBlockFunctionStatement* statement = nullptr);
// Go through sloppy_block_function_map_ and hoist those (into this scope)
// which should be hoisted.
void HoistSloppyBlockFunctions(AstNodeFactory* factory);
SloppyBlockFunctionMap* sloppy_block_function_map() {
return sloppy_block_function_map_;
}
// Replaces the outer scope with the outer_scope_info in |info| if there is
// one.
void AttachOuterScopeInfo(ParseInfo* info, Isolate* isolate);
// Compute top scope and allocate variables. For lazy compilation the top
// scope only contains the single lazily compiled function, so this
// doesn't re-allocate variables repeatedly.
//
// Returns false if private fields can not be resolved and
// ParseInfo's pending_error_handler will be populated with an
// error. Otherwise, returns true.
V8_WARN_UNUSED_RESULT
static bool Analyze(ParseInfo* info);
// To be called during parsing. Do just enough scope analysis that we can
// discard the Scope contents for lazily compiled functions. In particular,
// this records variables which cannot be resolved inside the Scope (we don't
// yet know what they will resolve to since the outer Scopes are incomplete)
// and recreates them with the correct Zone with ast_node_factory.
void AnalyzePartially(AstNodeFactory* ast_node_factory);
// Allocate ScopeInfos for top scope and any inner scopes that need them.
// Does nothing if ScopeInfo is already allocated.
static void AllocateScopeInfos(ParseInfo* info, Isolate* isolate,
AnalyzeMode mode);
Handle<StringSet> CollectNonLocals(ParseInfo* info,
Handle<StringSet> non_locals);
// Determine if we can use lazy compilation for this scope.
bool AllowsLazyCompilation() const;
// Make sure this closure and all outer closures are eagerly compiled.
void ForceEagerCompilation() {
DCHECK_EQ(this, GetClosureScope());
DeclarationScope* s;
for (s = this; !s->is_script_scope();
s = s->outer_scope()->GetClosureScope()) {
s->force_eager_compilation_ = true;
}
s->force_eager_compilation_ = true;
}
#ifdef DEBUG
void PrintParameters();
#endif
void AllocateLocals();
void AllocateParameterLocals();
void AllocateReceiver();
void ResetAfterPreparsing(AstValueFactory* ast_value_factory, bool aborted);
bool is_skipped_function() const { return is_skipped_function_; }
void set_is_skipped_function(bool is_skipped_function) {
is_skipped_function_ = is_skipped_function;
}
bool has_inferred_function_name() const {
return has_inferred_function_name_;
}
void set_has_inferred_function_name(bool value) {
DCHECK(is_function_scope());
has_inferred_function_name_ = value;
}
// Save data describing the context allocation of the variables in this scope
// and its subscopes (except scopes at the laziness boundary). The data is
// saved in produced_preparsed_scope_data_.
void SavePreParsedScopeDataForDeclarationScope();
void set_produced_preparsed_scope_data(
ProducedPreParsedScopeData* produced_preparsed_scope_data) {
produced_preparsed_scope_data_ = produced_preparsed_scope_data;
}
ProducedPreParsedScopeData* produced_preparsed_scope_data() const {
return produced_preparsed_scope_data_;
}
private:
void AllocateParameter(Variable* var, int index);
// Resolve and fill in the allocation information for all variables
// in this scopes. Must be called *after* all scopes have been
// processed (parsed) to ensure that unresolved variables can be
// resolved properly.
//
// In the case of code compiled and run using 'eval', the context
// parameter is the context in which eval was called. In all other
// cases the context parameter is an empty handle.
//
// Returns false if private fields can not be resolved.
bool AllocateVariables(ParseInfo* info);
void SetDefaults();
// If the scope is a function scope, this is the function kind.
const FunctionKind function_kind_;
bool has_simple_parameters_ : 1;
// This scope contains an "use asm" annotation.
bool asm_module_ : 1;
bool force_eager_compilation_ : 1;
// This function scope has a rest parameter.
bool has_rest_ : 1;
// This scope has a parameter called "arguments".
bool has_arguments_parameter_ : 1;
// This scope uses "super" property ('super.foo').
bool scope_uses_super_property_ : 1;
bool should_eager_compile_ : 1;
// Set to true after we have finished lazy parsing the scope.
bool was_lazily_parsed_ : 1;
#if DEBUG
bool is_being_lazily_parsed_ : 1;
#endif
bool is_skipped_function_ : 1;
bool has_inferred_function_name_ : 1;
// Parameter list in source order.
ZoneList<Variable*> params_;
// Map of function names to lists of functions defined in sloppy blocks
SloppyBlockFunctionMap* sloppy_block_function_map_;
// Convenience variable.
Variable* receiver_;
// Function variable, if any; function scopes only.
Variable* function_;
// new.target variable, function scopes only.
Variable* new_target_;
// Convenience variable; function scopes only.
Variable* arguments_;
// For producing the scope allocation data during preparsing.
ProducedPreParsedScopeData* produced_preparsed_scope_data_;
struct RareData : public ZoneObject {
// Convenience variable; Subclass constructor only
Variable* this_function = nullptr;
// Generator object, if any; generator function scopes and module scopes
// only.
Variable* generator_object = nullptr;
// Promise, if any; async function scopes only.
Variable* promise = nullptr;
};
enum class RareVariable {
kThisFunction = offsetof(RareData, this_function),
kGeneratorObject = offsetof(RareData, generator_object),
kPromise = offsetof(RareData, promise)
};
V8_INLINE RareData* EnsureRareData() {
if (rare_data_ == nullptr) {
rare_data_ = new (zone_) RareData;
}
return rare_data_;
}
V8_INLINE Variable* GetRareVariable(RareVariable id) const {
if (rare_data_ == nullptr) return nullptr;
return *reinterpret_cast<Variable**>(
reinterpret_cast<uint8_t*>(rare_data_) + static_cast<ptrdiff_t>(id));
}
// Set `var` to null if it's non-null and Predicate (Variable*) -> bool
// returns true.
template <typename Predicate>
V8_INLINE void NullifyRareVariableIf(RareVariable id, Predicate predicate) {
if (V8_LIKELY(rare_data_ == nullptr)) return;
Variable** var = reinterpret_cast<Variable**>(
reinterpret_cast<uint8_t*>(rare_data_) + static_cast<ptrdiff_t>(id));
if (*var && predicate(*var)) *var = nullptr;
}
RareData* rare_data_ = nullptr;
};
class ModuleScope final : public DeclarationScope {
public:
ModuleScope(DeclarationScope* script_scope,
AstValueFactory* ast_value_factory);
// Deserialization.
// The generated ModuleDescriptor does not preserve all information. In
// particular, its module_requests map will be empty because we no longer need
// the map after parsing.
ModuleScope(Handle<ScopeInfo> scope_info, AstValueFactory* ast_value_factory);
ModuleDescriptor* module() const {
DCHECK_NOT_NULL(module_descriptor_);
return module_descriptor_;
}
// Set MODULE as VariableLocation for all variables that will live in a
// module's export table.
void AllocateModuleVariables();
private:
ModuleDescriptor* module_descriptor_;
};
} // namespace internal
} // namespace v8
#endif // V8_AST_SCOPES_H_
``` |
Eliane Ekra was Chief of the Ministry of Health and AIDS Control in the Republic of the Ivory Coast from 2013 to 2018.
Ekra is on the board of directors of the MTN Foundation. She was awarded the 2014 Harambee Spain Award for the Promotion and Equality of African Women.
In March 2023, Ekra was appointed president of the regional working group on health risk coverage (GTR-CRM) .
References
Ivorian activists
Living people
Ivorian women in business
Year of birth missing (living people) |
Volterra Cathedral (, or Duomo di Volterra) is a Roman Catholic cathedral in Volterra, Italy, dedicated to the Assumption of the Virgin Mary. It is the seat of the bishop of Volterra.
History
The present church was rebuilt after the earthquake of 1117 that destroyed most of the town, and consecrated by Pope Calixtus II in 1120. Details of the earlier church on the site are not clear, although a church dedicated to Saint Mary is known from the 9th century. This was not the original cathedral, which was dedicated to Saint Peter and located next to the bishop's palace; it was destroyed by the Florentines during a siege in 1472, after which the bishop's seat was transferred to the present cathedral.
Nicola Pisano is said to have been involved in further reconstruction in the mid 13th century. The rustic stone façade was built in Romanesque style using spolia from the Roman theater of Volterra in the portal. The intarsia over the door is attributed to Pisano.
In 1580, bishop Guido Serguidi, with the approval of Ferdinando I de' Medici, Grand Duke of Tuscany, commissioned the decoration of the intricately coffered ceiling of the nave and crossings, designed by Francesco Capriani, carved by Jacopo Pavolini, and gilded by Fulvo della Tuccia. The ceiling has sculpted reliefs of Saints Ugo, Giusto, Pope Linus, Clemente, Attinea, and Greciniana, round a central symbol of the Holy Spirit. The campanile of 1493 replaced an older belltower.
Interior
The elongated nave and interior space form a Latin cross. The nave spans 22 columns decorated with stucco simulating rose-colored granite. Much of the interior was restored in 1842-1843. The stucco capitals were completed in the 16th century by Giovanni Paolo Rossetti and Leonardo Ricciarelli. In the 19th century, the walls of the interior were painted in stripes that suggest typical Tuscan decorative church architecture. The floor has tiles of alternating dark and white marble.
The pulpit has three reliefs depicting the Last Supper, the Annunciation, and the Sacrifice of Isaac, and the lions at the base of the columns are undoubtedly 12th-century works of the Guglielmo school, perhaps carved by the Pisan sculptor Bonamico. Other elements and the alabaster intarsia were added in 1584, when an earlier balustrade was dismantled and the pulpit was reconstructed.
To the left of the entrance is the funeral monument of Francesco Gaetano Incontri, former archbishop of Florence, who died in 1781. The monument was erected in 1840, with a bust by Aristodemo Costoli and decoration by Mariano Falcini. Below the monument are eight marble intarsia panels, originally part of a 12th-century Tuscan balustrade.
The main altar, mainly dating from the 19th century, has a marble ciborium with flanking angels (1471) by Mino da Fiesole. The choir stalls were completed in the 14th century. In the ceiling of the crossing are depictions of God the Father and Stories of the Life of the Virgin (1585) above the choir by Niccolò Circignani.
Chapels
In the first chapel, the Chapel of Saint Ottaviano, the relics of this saint are kept in a marble sarcophagus to the right of the altar, sculpted by Raffaello di Andrea Cioli. It was commissioned in 1522 to thank the saint for his intervention in stopping an epidemic of the plague; the candle holders depicting angels are by Andrea Ferrucci.
To the left is the chapel commissioned by Ludovico Incontri in 1645. Its marble sarcophagus holds the remains of Saint Ugo dei Saladini, a 12th-century bishop of Volterra.
The next chapel is the Chapel of the Madonna dei Chierici, referring to a wooden icon of the Madonna, donated by Jacopo di Ciglio (known as il Barbialla), and carved by Francesco di Valdambrino (early 15th century).
The Chapel of Saint Paul opens off the north transept. This chapel was commissioned by the Inghirami family, built for Admiral Jacob Inghirami, and designed by Alessandro Pieroni. The admiral, in a scene including the Baptistery of Volterra, appears in conversation in the lunette of the Procession to Damascus above the altar. Giovanni Mannozzi (Giovanni di San Giovanni) painted the frescoes of the Life of Saint Paul on the ceiling. On the walls, are paintings of The Mission of St. Paul in Damascus by Matteo Rosselli and the Beheading of St. Paul (1623) by Domenichino. Above the door to the rectory hangs a canvas of The Immaculate Conception with Saints by Cosimo Daddi. Other artists that contributed to the decoration include Gherardo Silvani, Giovanni Caccini, and Francesco Curradi.
Along the north side of the nave is the Chapel of St. Sebastian with a painting by Francesco Cungi of the Martydom of St Sebastian (1587).
The cathedral contains the funeral monument of the humanist bishop of Cavaillon, Mario Maffei, who died in Volterra in 1537. The figure of the prelate dressed in his finery in a sleeping pose on the sarcophagus was executed by Giovanni Angelo Montorsoli, one of Michelangelo's assistants.
The Oratory of the Virgin Mary (Cappella dell'Addolorata) contains a fresco of the Nativity with a Journey of the Magi by Benozzo Gozzoli on the left and an Epiphany on the right. Painted terracotta figures, almost life-size, have recently been attributed to Giovanni della Robbia.
The Chapel of the Holiest Name of Jesus has an architectural 16th-century frame preserving the monogram of Christ donated to Volterra by San Bernardino of Siena encased in a precious silver 18th-century shrine. It also contains an Annunciation (1497) by Fra Bartolomeo della Porta.
The Verani Chapel contains an Immaculate Conception (1586) painted by Niccolò Circignani. The Chapel of the Annunciation contains an Annunciation by Albertinelli in collaboration with Fra Bartolomeo who painted the angel in the canvas in 1497.
The first chapel to the right of the entrance, the Giorgi Chapel, has an altarpiece by Pieter de Witte, depicting the Offering of Volterra to Virgin and Saints (1587) commissioned by Captain Francesco del Bovino of the Giorgi family who appears in the left-hand corner of the painting. The second chapel to the right, the Collaini Chapel, has a Birth of the Virgin (1618) by Francesco Curradi, and the third chapel to the right, the Perissi Chapel, a Presentation in the Temple of the Virgin (1590) by Gianbattista Naldini.
Over the door of the Chapel of San Carlo is a painting of the Crucifixion with the Virgin, Saints John, Anthony Abbot, Francis and Augustine 1611) painted by Curradi. Above the altar is a canvas of the Ecstasy of St Carlo Borromeo before the Virgin by Jacopo Chimenti, and on the side walls Saint Mary Magdalene of Scolaro by Guido Reni and an Immaculate Conception by Francesco Brini.
Off the south transept is the entrance to the Serguidi Chapel (1595), previously the Chapel of the Holiest Sacrament, or Chapel of the Miracles, the design of which is attributed to Vasari. It was decorated in stucco by Leonardo Ricciarelli and painted by Giovanni Balducci. The cost of the decoration was more than ten thousand ducats. Above the altar is a wooden panel of the Resurrection of Lazarus (1592) by Santi di Tito. On the side walls are two paintings on canvas, also by Balducci: Expulsion of the Non-believers from the Temple and Parable of the Loaves and Fishes (1591). Balducci also painted the frescoes on the ceiling and to either side of the altar. Agostino Veracini painted the Patron Saints of Volterra (1741) featured on the walls. The altar has relics of Saints Attinia and Greciana.
The Chapel of the Deposition has a group of five wooden polychrome figures representing the Deposition of Christ executed in 1228 by an unknown Volterran artist.
The rectory stalls are the work of Francesco del Tonghio and Andreoccio di Bartolomeo, while the fine 15th-century intarsia on the bishop’s throne and the chaplain's benches are the work of unknown Tuscan masters.
Sources
City hall entry about the Cathedral
Guida di Volterra, 1903, pages 85–100
Roman Catholic churches in Volterra
12th-century Roman Catholic church buildings in Italy
Roman Catholic cathedrals in Italy
Cathedrals in Tuscany |
The Brúará (, "bridge river") is a river of Iceland. It is fed by springs and discharges at the Rótarsandur area and the Brúará Canyons. It is a right tributary of the Hvítá. The whole river course is designated as a nature protected area. The name comes from a type of natural bridge that overpassed the river near the bishup-seat in Skalholt. According to sources from the bishop a worker of the bishop broke the bridge in 1602 because the seat didn't want dirty wanderers to have it to easy to approach.
References
Rivers of Iceland |
Malcolm Scott Ciencin (September 1, 1962 – August 5, 2014) was an American author of adult and children's fiction. He co-authored several books with his wife Denise Ciencin. He was a New York Times bestselling author who wrote adult and children's fiction and works in a variety of mediums including comic books.
Career
Among his works are novels written for the Dungeons & Dragons role playing game campaign settings. He also wrote books for the Dinotopia series. was a New York Times bestselling novelist of 90+ books from Simon & Schuster, Random House, Scholastic, Harper and many more. He had also written comic books, screenplays, and worked on video games. He created programs for Scholastic Books, designed trading cards, consulted on video games, directed and produced audio programs & TV commercials, and wrote in the medical field about neurosurgery and neurology. He first worked in TV production as a writer, producer and director.
Personal life
Ciencin lived in Sarasota, Florida with his wife (and sometimes co-author) Denise. He died in August 2014 of a blood clot to the brain.
Bibliography
Forgotten Realms
The Avatar Series
Originally published under the pseudonym Richard Awlinson. Ciencin shared the pseudonym with Troy Denning, who wrote part 3 of the Avatar Series "Waterdeep," and James Lowder who edited the trilogy and wrote parts of "Tantras."
Shadowdale, (1989)
Tantras, (1989)
The Harpers
The Night Parade, (1992)
Robert Silverberg's Time Tours
Published under the pseudonym Nick Baron.
Glory's End, (1990)
The Pirate Paradox, (1991) , with Greg Cox
The Wolves of Autumn
The Wolves of Autumn, (1992)
The Lotus and the Rose, (1992)
The Vampire Odyssey
The Vampire Odyssey, (1992)
The Wildlings, (1992)
Parliament of Blood, (1992)
The Nightmare Club
Published under the pseudonym Nick Baron.
The Initiation, (1993)
The Mask, (1993)
Slay Ride, (1993)
Spring Break, (1994)
WildC.A.T.S, Covert Action Teams
Dark Blade Falling, (1995)
Evil Within, (1995)
Dinotopia
Windchaser, (1995)
Lost City, (1996)
Sabertooth Mountain, (1996) , with John Vornholt
Thunderfalls, (1996)
Sky Dance, (1999)
Return to the Lost City, (2000)
The Explorers, (2001)
The Elven Ways
The Ways of Magic, (1996)
Ancient Games, (1997)
Night of Glory, (1998)
The Lurker Files
Faceless, (1996)
Know Fear, (1996)
Nemesis, (1997)
Incarnate, (1997)
Apparition, (1997)
Triad, (1997)
Godzilla
Godzilla, King of the Monsters, (1996)
Godzilla Invades America, (1997)
Godzilla: Journey to Monster Island, (1998)
Godzilla vs. the Space Monster, (1998)
Dinoverse
I Was A Teenage T-Rex, (1999) , originally published as Dinoverse
The Teens Time Forgot, (2000)
Raptor Without A Cause, (2000)
Please Don't Eat the Teacher, (2000)
Beverly Hills Brontosaurus, (2000)
Dinosaurs Ate My Homework, (2000)
Gen¹³
Time and Chance, (2001) , with Jeff Marriotte
Jurassic Park Adventures
Ciencin's Jurassic Park stories are original novels based on the Jurassic Park films rather than directly on Michael Crichton's work.
Jurassic Park Adventures: Survivor, (2001)
Jurassic Park Adventures: Prey, (2001)
Jurassic Park Adventures: Flyers, (2002)
Buffyverse
Sweet Sixteen (Buffy novel), (2001)
Vengeance (Angel novel), (2002) , with Dan Jolley
The Longest Night (Angel novel), (2002) , with Denise Ciencin
Nemesis (Angel novel), (2003) , with Denise Ciencin
Mortal Fear (Buffy novel), (2003) , with Denise Ciencin
Starfleet Corps of Engineers
Some Assembly Required, (2002) , with Greg Brodeur, Dave Galanter, Dan Jolley, Aaron Rosenberg, and Keith R.A. DeCandido
Age of Unreason, (2003)
Breakdowns, (2005) , with Keith R. A. DeCandido, Kevin Dilmore, Heather Jarman, and Dayton Ward
Transformers
Hardwired, (2003)
Kim Possible
Tweeb Trouble, (2004)
EverQuest
The Rogue's Hour, (2004)
Charmed
Luck Be a Lady, (2004)
Light of the World, (2006)
High Spirits, (2007)
Kim Possible: Pick a Villain
Game On!, (2005)
Masters of Mayhem, (2005)
Standalone novels
Virtual Destruction, (1995)
Jurassic Park 3, (2001)
Even Stevens: The Stevens Get Even, (2004)
The Legend of Zorro, (2005)
Comic books and other works
Scott Ciencin also wrote comic books. His credits include
A Winter's Tale - from Captain America: Red, White & Blue with art by Pasqual Ferry from Marvel
Trial by Fire - mini-series with art by Ron Wagner set in R.A. Salvatore's Demonwars universe - from CrossGen
Eye for an Eye - mini-series with art by Greg Tucchini set in R.A. Salvatore's Demonwars universe - from CrossGen
Metropolis S.C.U. - with artist Roger Robinson from D.C.
New Gods: A Shadow Over Eden - from D.C.
New Gods: Acts of God - from D.C.
Star Trek: The Next Generation: The Killing Shadows - mini-series from Wildstorm with art by Bryan Hitch and Andrew Currie
Star Bus: Attack of the Cling-Ons, (2011) , with art by Jeff Crowther
Silent Hill: Dying Inside - mini-series with art by Ben Templesmith and Aadi Salmon from IDW
Silent Hill: Paint it Black - art by Shaun Thomas from IDW
Silent Hill: Among the Damned - art by Shaun Thomas from IDW
Silent Hill: The Grinning Man - art by Nick Stakal from IDW
Silent Hill: Dead/Alive - mini-series with art by Nick Stakal from IDW
Silent Hill: Three Bloody Tales - art by Nick Stakal, and Shaun Thomas from IDW
Original PSP Creation for Sony and Konami
Silent Hill Experience: The Hunger
References
External links
Official website of Scott Ciencin
Fantasticfiction.co.uk - Bibliography
1962 births
2014 deaths
20th-century American male writers
20th-century American novelists
21st-century American male writers
21st-century American novelists
American children's writers
American comics writers
American male novelists
Deaths from blood clot |
"Stay" is a song recorded by Barbadian singer Rihanna for her seventh studio album, Unapologetic (2012). It features guest vocals by Mikky Ekko and was released as the second single from the album on December 13, 2012. "Stay" was co-written by Ekko and Justin Parker. The song's lyrics speak of temptation and the inability to resist true love. Music critics were generally positive in their opinion regarding the balladry and most described it as a standout track on the album.
Upon the release of Unapologetic, "Stay" charted on multiple charts worldwide. Following its release as a single, it reached number one in Bulgaria, Canada, the Czech Republic, Denmark and Israel and the top five in twenty-four countries worldwide including Australia, France, Germany, New Zealand, Norway, Switzerland and the United Kingdom. It peaked at number three on the US Billboard Hot 100, becoming Rihanna's twenty-fourth top ten on the chart, thus surpassing Whitney Houston's tally. Furthermore, it has charted at number one on the US Mainstream Top 40 chart and 16 on the Dance Club Songs chart. The single has sold over 10 million units worldwide.
The song's accompanying music video, directed by Sophie Muller, depicts Rihanna naked in a bathtub filled with cloudy water, while Ekko sings in a separate bathroom. Critics likened the vulnerability and raw emotion in the video to the song itself. Rihanna premiered "Stay" on Saturday Night Live in the United States, while she performed the song in the United Kingdom on the ninth series of The X Factor. Rihanna and Ekko also performed "Stay" at the 2013 Grammy Awards. The track was included on the set list of the majority of her 777 Tour promotional tour dates, in support of the album, while it was included on Rihanna's fifth headlining tour, the Diamonds World Tour in the encore and the opening song of her seventh headlining tour, the Anti World Tour.
Production and release
Rihanna began working on the new sound for her seventh studio album in March 2012, even though she had not yet begun recording. During the production of the album, several musicians and producers were recruited including American singer Mikky Ekko and producer Justin Parker. According to Ekko, the production of the album was massive: "Their pace is insane. They had the studios we were working in booked out for three months, on a cycle. It was like nothing I had ever experienced before." "Stay" was written and produced by Parker, Ekko and Elof Loelv. Initially, when they wrote the song, Ekko didn't like it because of its vulnerability; however, collaborators convinced him to listen to "Stay" again. After another listen, he understood that the song was very important to him, adding that "the track had become so special to me as well, and knowing what the track means to me and what I think it means to her too."
Shortly after Rihanna's management took over the song, Ekko met her in Los Angeles where she told him she already sang the vocals, about which he reacted positively. Rihanna's and Ekko's vocals were recorded at two recording locations by three people: Mike Gaydusek at NightBird Recording Studios and Marcos Tovar and Kuk Harrel at Westlake Recording Studios, both in Los Angeles. Vocal engineering was done by Gaydusek and assisted by Blake Mares and Robert Cohen. Vocal production was completed by Kuk Harrell. It was mixed by Phil Tan at Ninja Club Studios in Atlanta, Georgia. Additional production was performed by Daniella Rivera. "Stay" was sent to French radio on December 13, 2012, as the second single from Unapologetic. It later impacted the United Kingdom on January 7, 2013. In the United States, "Stay" was released to adult contemporary radio stations on January 28, 2013, and to contemporary hit radio and rhythmic contemporary radio the next day, as the third single in the country following "Diamonds" and "Pour It Up". It was released as a CD single in Germany on February 15, 2013.
Composition and lyrics
"Stay" is a pop and R&B ballad that consists of piano and bass guitar instrumentation. It is written in the key of C major, having the chord progression of C-Dm-Am-F. The song has a moderate tempo of 112 beats per minute. Rihanna's vocal range in the song ranges from the low note of A3 to the high note of E5. Greg Kot for the Chicago Tribune described the song as being "stripped-bare". The lyrics revolve around "failing to resist true love", according to Dan Martin for NME, as Rihanna sings "Funny, you're the broken one/ But I'm the only one who needed saving." According to Jocelyn Vena for MTV, Rihanna "punctuates the emotions of the track" on the lyric "It's not much of a life you're living/ It's not just something you take [it's] given." Rihanna also makes a plea to her lover, singing "'Round and around and around and around we go/ Now, tell me now, tell me now, tell me now you know/ Not really sure how to feel about it/ Something in the way you move/ Makes me feel like I can't live without you/ it takes me all the way/ I want you to stay." Lewis Corner for Digital Spy wrote that Rihanna's vocals glow over the simple yet effective piano riffs.
Awards
Critical reception
"Stay" received favorable reviews from music critics. Jon Dolan for Rolling Stone was complimentary of Rihanna's execution of the song, writing that she performs it "within an inch of its life" and "pleads at the piano." Dolan continued to state that it is "stark" and "shadowy" which is "confrontationally honest." Dan Martin for NME described "Stay" as Unapologetics highlight, writing that it is a "gorgeous piano ballad." Martin continued to write that the song "puts a vulnerable spin on the Brown situation, repeating another theme of the album", a reference to her relationship with Chris Brown. Smokey Fontaine for The Huffington Post also praised "Stay", placing emphasis on Rihanna's vocal performance. He wrote that "Three years ago, no one would have paid attention to a beautiful piano-ballad like 'Stay.' Not because of the events we all witnessed, but because of how honest and emotionally-connected her vocals are."
Lewis Corner for Digital Spy awarded "Stay" four out of five stars, commenting that Rihanna "doesn't need all the controversial romp to top the charts." Corner also compared "Stay" to the work of "some of 2012's most successful female balladeers" Emeli Sandé and Lana Del Rey and concluded by stating that Rihanna "never [follows] the pack" but "[airs] her seemingly complex emotions through music's current trend." The song garnered a mixed review from Genevieve Koski for The A.V. Club, writing that the album is "heavy on the sort of milquetoast ballads that have never been Rihanna's specialty" with regard to "Stay" and "What Now". However, Jon Caramanica for The New York Times negatively critiqued the song, writing that it is "dull piano driven song." The reason he gave for it being "dull" was that he felt "Stay", along with "Get It Over With" and "Lost in Paradise", were the "least texturally confrontational" and therefore "by far the least successful."
Chart performance
North America
Following Rihanna and Ekko's performance at the 55th Annual Grammy Awards on February 10, 2013, the song entered the US Digital Songs chart at number 25 for the issue dated February 23, seeing a 289% increase in sales to 67,000 copies sold. It subsequently debuted on the Billboard Hot 100 at number 57, rocketing to number three the week after, following the chart's new policy that allowed YouTube streaming to count towards the single's chart performance. The surge was also due to the large 358% increase of digital downloads to 306,000 sales sold that week, rising to number two on the Digital Songs chart. With the new Hot 100 peak, Rihanna gained her 24th top 10 on the chart, surpassing Whitney Houston's tally of 23. The following week, the song slipped to number seven, selling 213,000 copies while bounding from number 57 to 36 on the Radio Songs chart. In its third total week on the Hot 100, "Stay" rebounded to number five, selling 211,000 downloads and charging from number 36 to 23 on the Radio Songs chart. In its fourth week on the Hot 100, the song again climbed to number four, surging from number 23 to 16 on the Radio Songs chart, and increasing 12% in download sales to 236,000 copies sold. With this, "Stay" passed the one million downloads-sold barrier, becoming Rihanna's 27th title (including featured appearances) to reach the sales milestone. The following week it rose to number 11 on the Radio Songs chart, selling 222,000 digital copies. For the issue dated April 6, "Stay" ascended to number six on the Radio Songs chart, marking Rihanna's 22nd top 10 on the chart. With this, she trails only Mariah Carey (23) for the most top tens in the tally's archives. For the date issued, May 11, 2013, "Stay" topped the Radio Songs chart, marking Rihanna's 11th number one on the chart, thus tying her with Mariah Carey for the most leaders dating to the BDS-based chart's December 1990 inception. With the ascension, the song climbed from six to its previous peak of number three on the Hot 100.
"Stay" first charted in the United States on the Mainstream Top 40 chart at number 34, on the issue dated February 16, 2013. On the issue dated March 30, 2013, the song climbed into the top 10 of the chart at number nine. For the issue dated May 4, 2013, "Stay" rose from number two to one on the Pop Songs chart, tallying her 10th leader. With this, she broke a tie with Katy Perry for the most toppers in the chart's 20-year history. Also notably, "Stay" is only the second piano-and-vocal-only number one to have ruled Pop Songs, following Bruno Mars' "When I Was Your Man". "Stay" debuted on the US Dance Club Songs chart at number 47 for the issue dated March 30, 2013. "Stay" also became Rihanna's third top ten on the Adult Pop Songs chart, charting at number two. Furthermore, it peaked at number five on the Adult Contemporary chart. By July 2013, "Stay" had sold over 3 million digital copies, marking Rihanna's 10th song to pass the three million sales mark. The song became the 10th best-selling song of 2013 in the US, with 3,854,000 copies sold for the year. As of June 2015, the song has sold 4,480,000 copies in the US.
The song entered the Canadian Hot 100 at number 58, for the week dated December 8, 2012. It re-entered the chart for the week of February 23, 2013, at number 37. The following week, it leaped to number three, where it remained for a further week before climbing to number two for the week of March 16, 2013. The following week, "Stay" reached number one, becoming Rihanna's eighth single to top the chart, and second consecutive following "Diamonds". It remained number one for three consecutive weeks.
Europe and Oceania
In the United Kingdom, "Stay" debuted on the UK Hip Hop and R&B Singles Chart at number 16 on November 25, 2012, due to strong digital download sales following the release of Unapologetic. It also entered the UK Singles Chart at number 102 in the same week. Following Rihanna's performance of the song on The X Factor the previous week, "Stay" re-entered the UK Singles Chart at number six on December 22, 2012. The following week it climbed to a new peak of number four. Over the next five weeks, the song fluctuated inside the top ten, again returning to its number four peak on two separate occasions. As of February 2013, "Stay" has sold over 394,000 copies in the UK. "Stay" debuted in Ireland at number 15 for the week ending December 13, 2012. Elsewhere in Europe, the song debuted at number 53 in both France and Switzerland, following the release of the album. After three weeks of charting outside of the top 100, "Stay" returned to its former peak of 53 in France on January 5, 2013. It reached a peak of number two in its twelfth week on the chart. "Stay" also reached number one in Denmark on March 1, 2013, marking Rihanna's fifth number one in the country, and second consecutive following "Diamonds"' charting.
"Stay" entered the singles chart in New Zealand at number 28 on December 24, 2012. The following week it climbed to number 25 and in its third week to a new peak of 16. On January 14, 2013, it climbed into the top ten to number nine, marking Rihanna's 28th top ten single, and fifth consecutive. The song remained at the position for five consecutive weeks, before marking a new peak of number seven in its ninth total week on the chart. The following week, "Stay" climbed to number six, where it returned two weeks later after a drop to number seven. After the song fell again to number seven, it managed a new top five peak of four in its fourteenth week on the chart. The song has been certified double-platinum by the Recording Industry Association of New Zealand for sales of 30,000 copies. In Australia, "Stay" debuted at number 43 for the issue dated January 20, 2013. The following week it climbed to number 28, and into the top 20 to number 12 the week after. In its fourth week, the song made a new peak of number 11. The following week it dropped to 13, but rebounded into the top ten to mark a new peak of number six in its sixth total week on the chart, following the release of the music video. With this, the song became Rihanna's 24th top ten single in the country. The following week, it climbed to number five, managing a higher position than the album's lead single, "Diamonds". In its eighth week on the chart, "Stay" climbed to number four, marking a new peak. It has received a quintuple-platinum certification by the Australian Recording Industry Association for sales of 350,000 copies.
According to the International Federation of the Phonographic Industry, it sold 7.9 million copies worldwide in 2013.
Music video
Background
The music video for "Stay" was directed by Sophie Muller. On February 10, 2013, whilst walking the red carpet of the 55th Annual Grammy Awards, Rihanna held an interview with Ryan Seacrest who officially revealed that the music video would premiere on E! News the following day. Rihanna described the production saying, "The video was really, really simple. I pretty much stayed put in a bathtub, and we shot it really tight, really close. There's Mikky Ekko in the video as well. This is the first time I've ever collaborated with him, so I'm excited about that because he's actually the one who wrote the song and I kinda just fell in love with it so much and in love with the tone of his voice and we wanna keep him a part of it, so you'll see him in the video." The singer added, "It's a very emotional song and it's personal, so you just think about, it's almost like telling a story, and when you tell a story, even to yourself – if you're saying it out loud and expressing how you feel – it needs to be powerful because it needs to be authentic." On February 11, Rihanna leaked an "uncut" version of the video on Twitter prior to the official premiere, featuring the singer performing to the track in one singular take, without Mikky Ekko.
Synopsis
The video opens with a shot of running water. Rihanna is then presented undressing and climbing into a bathtub. Throughout the rest of the video, the singer is presented nude in the tub full of cloudy green water; subtle camera angles protect her modesty. Rihanna is shown wearing little make-up and with long hair tangled and wet over one side of her face. The singer flickers her eyes to the ceiling and puts her head in her hands, showing off long manicured nails and a diamond stud earring. The low-key video also features Mikky Ekko, who performs his parts of the song separately including scenes of him perched on the edge of a different bathtub, gazing into a mirror, in front of an unlit fireplace, and sitting on a grand chair. The video switches between the pair throughout the course of the video until it concludes with a single tear falling from Rihanna's eye as she sinks lower into the bathtub.
Reception
A reviewer of The Huffington Post commented, "The heartfelt ballad, from her latest album Unapologetic, is full of emotion – and the video matches that, as a stripped-down Rihanna soaks in a tub." August Brown of the Los Angeles Times commented on the video saying, "We kind of want to curl up in a hot shower and have a good cry ourselves." They continued saying, "It's kind of an echo of her famous "We Found Love" video, with that clip's quick-cut, drugged-up frenzy of bad romance replaced with solitary, locked-off shots that feel more intimate than exploitative. She looks amazing, but the focus isn't so much her body as the look of constant devastation on her face." Brown summarised the clip as being "appropriately minimalist[ic]" and concluded calling it "a beautiful video that broadens Rihanna's emotional-musical palette." Bené Viera of VH1 commented on the video saying, "Usually the tough girl posturing is a cover-up for a very sensitive soul. Rihanna cut the 'I don't give an eff' attitude for four minutes of makeup-free, teary-eyed, glistening wet, raw emotion in the video for 'Stay.'" Sarah Flanigan of Yahoo! thought the video shows "a softer side of [Rihanna's] personality audiences rarely get to see." She also stated, "There are no gimmicks, no flashy clothes, just a very raw and emotional performance allowing her to tell this love story in her own words." Jenna Hally Rubenstein of MTV labelled the video as "perfectly heartbreaking/emotionally vulnerable" and thought the "baptismal effect" of the video "feels like a seamless transition from Rihanna's 'Diamonds' video." Tamar Anitai also of MTV compared the video to Britney Spears' "Everytime" (2004), writing that both videos "are equal parts stunning and sobering, haunting and harrowing, and both feature impossibly famous singers reflecting upon damaged relationships while inviting us into their well-designed bathrooms as they vulnerably perform their ablutions." Rihanna's "Stay" video was also compared to and said to be inspired by Janet Jackson's "Every Time" video, as well as Britney Spears' "Everytime" video, with one critic noting "Rihanna isn't the first pop star to brood in a bathtub. Janet Jackson and Britney Spears also bared their emotion immersed in water. Janet bared all in a blue lagoon for her 'Every Time' video. A little less glam, Britney's tub scene in her 'Everytime' video proved dark foreshadowing into her troubled world."
Live performances
As part of promotion for the release of Unapologetic on November 19, 2012, Rihanna premiered "Stay" on Saturday Night Live on November 10, 2012. She also performed the album's lead single "Diamonds". Rihanna performed a solo version of "Stay", without guest vocalist Ekko. Rihanna wore a Bob Marley dress and adorned red lipstick. Jocelyn Vena for MTV praised the singer's performance, writing "Rihanna used her touching vocals to prove that not only can she sex up a performance but she can also sing the heck out of one." Erika Ramirez noted that Rihanna "belted out the song."
During the seven days prior to the release of the album, Rihanna embarked on the 777 Tour, a seven-date promotional tour where she performed seven concerts in seven cities in seven countries across North America and Europe. Not included on the set list at the first concert in Mexico City, she performed "Stay" at the second concert in Toronto as part of a medley with "Love the Way You Lie". The solo version of the song was performed the third concert in Stockholm. At the fourth concert in Paris, it was performed as the ninth song out of 13 in between "S&M" and "Where Have You Been", preceded by a snippet of "Take Care". The fifth and sixth concerts were held in Berlin and London, respectively, where Rihanna performed "Stay" both nights in between "S&M" and "Unfaithful". The seventh and final concert was held in New York City, where "Stay" was also performed. Erika Ramirez for Billboard attended all seven concerts as part of the press committee, where she described the audience as being in a "trance" as the singer performed the song.
Rihanna performed "Stay" together with Mikky Ekko at the 2013 Grammy Awards on February 10, 2013. The performance featured the singer standing in front of a "dimly lit set" and was dressed in a long "curve-hugging" dark dress. Mikael Wood of Los Angeles Times positively reviewed the performance and wrote that it was the most memorable moment of the night. Charley Rogulewski of Vibe in a review of the rendition wrote, "Her [Rihanna's] beautiful voice took center stage during the duet, assuring those watching why she was worthy of her six Grammys". A reviewer of Capital FM wrote that Rihanna looked visibly moved by the performance as she showed her "impressive vocals". The solo version of "Stay" is included as part of the set list on Rihanna's fifth headlining concert tour, the "Diamonds World Tour", as the twenty-seventh track and first of the encore. The song served as an opening song on her seventh headlining tour the Anti World Tour. She also performed the song at the 2016 MTV Video Music Awards.
Notable cover versions
A short teaser of American singer Adam Lambert performing a cover of "Stay" was released online on February 11, 2013. The singer revealed via Twitter that it was only a preview in rehearsals and that there was "more to come". The video release came after Lambert praised Rihanna and Ekko's Grammy performance the previous night, saying "best she's ever sounded!! Wow. Full of such beautiful and haunting emotion." The singer later performed a full version of the song, with the album track "Underneath" from his album Trespassing, at his "We Are Glamily" tour in Tokyo.
On February 15, 2013, a video was unveiled of Vin Diesel performing a karaoke-style cover of the song, which he recorded for his partner for Valentine's Day. The recording featured the music video running in the background.
On May 17, 2013, singer Fatin Shidqia performed "Stay" on Grand Final X Factor Indonesia.
On May 18, 2013, Demi Lovato covered the song during their shows in Mansfield, Massachusetts, San Antonio, California, and Los Angeles.
On July 1, 2013, R&B singers RaVaughn and Kiley Dean each released a version of "Stay" on YouTube.
Low performed the song during the Pitchfork Festival 2013 and later released their cover on iTunes, with the proceeds donated to nonprofit organization Rock For Kids.
On September 18, 2018, American musician Cat Power released a cover of the song as the third single from her tenth studio album, Wanderer (2018).
Thirty Seconds to Mars covered the song on BBC's Live Lounge (UK). The very popular cover has amassed 66m views (as of March 2023), on the Live Lounge YouTube channel.
Track listing
CD
"Stay" (featuring Mikky Ekko) – 4:00
"Diamonds" (remix; featuring Kanye West) – 4:48
Credits and personnel
Recording
Recorded at NightBird Recording Studios, West Hollywood, California; Westlake Recording Studios, Los Angeles, California.
Mixed at Ninja Club Studios, Atlanta, Georgia.
Personnel
Lead vocals – Rihanna
Guest vocals – Mikky Ekko (courtesy of RCA Records)
Songwriting and production – Mikky Ekko, Justin Parker, Elof Loelv
Additional production/Landscape – Justin Parker, Elof Loelv
Vocal recording – Mike Gaydusek, Marcus Tovar, Kuk Harrel
Vocal engineering – Mike Gaydusek
Assistant vocal engineer – Blake Mares, Robert Cohen
Piano – Justin Parker
Vocal production – Kuk Harrell
Mixing – Phil Tan
Assistant/additional engineering – Daniella Rivera
Credits adapted from the liner notes of Unapologetic, Def Jam Recordings, SRP Records.
Charts
Weekly charts
Year-end charts
Decade-end charts
Certifications
Release history
See also
List of Canadian Hot 100 number-one singles of 2013
List of number-one hits of 2013 (Denmark)
List of UK top-ten singles in 2013
List of Billboard Mainstream Top 40 number-one songs of 2013
List of Billboard Hot 100 top-ten singles in 2013
References
External links
2010s ballads
2012 songs
2013 singles
Rihanna songs
Contemporary R&B ballads
Music videos directed by Sophie Muller
Number-one singles in Denmark
Number-one singles in Israel
Canadian Hot 100 number-one singles
Songs written by Justin Parker
Songs written by Mikky Ekko
Songs written by Elof Loelv
Song recordings produced by Elof Loelv
Song recordings produced by Kuk Harrell
Songs about loneliness
Male–female vocal duets
Pop ballads
Torch songs
Roc Nation singles
Def Jam Recordings singles |
```python
from rx import Observable
from rx.internal import extensionmethod
@extensionmethod(Observable)
def count(self, predicate=None):
"""Returns an observable sequence containing a value that represents
how many elements in the specified observable sequence satisfy a
condition if provided, else the count of items.
1 - res = source.count()
2 - res = source.count(lambda x: x > 3)
Keyword arguments:
:param types.FunctionType predicate: A function to test each element for a
condition.
:returns: An observable sequence containing a single element with a
number that represents how many elements in the input sequence satisfy
the condition in the predicate function if provided, else the count of
items in the sequence.
:rtype: Observable
"""
if predicate:
return self.filter(predicate).count()
else:
return self.reduce(lambda count, _: count + 1, seed=0)
``` |
Mad Genius is a 2017 American science fiction film written and directed by Royce Gorsuch and starring Chris Mason, Scott Mechlowicz, Spencer Locke and Faran Tahir. It is Gorsuch's feature directorial debut.
Cast
Chris Mason as Mason
Scott Mechlowicz as Finn
Spencer Locke as Sawyer
Faran Tahir as Eden
Release
The film was released on VOD on July 3, 2018.
Reception
Adam Keller of Film Threat awarded the film a 4 out of 10.
References
External links
American science fiction films
2017 science fiction films
2010s English-language films
2010s American films |
```java
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package com.javadeobfuscator.deobfuscator.matcher;
import org.objectweb.asm.tree.AbstractInsnNode;
import java.util.ArrayList;
import java.util.List;
import java.util.function.Function;
public class OpcodeStep implements Step {
private final List<Integer> wantOpcodes;
private Function<AbstractInsnNode, Boolean> function;
public OpcodeStep(Function<AbstractInsnNode, Boolean> function, int... opcodes) {
this.function = function;
this.wantOpcodes = new ArrayList<>();
for (int opcode : opcodes) {
this.wantOpcodes.add(opcode);
}
}
public OpcodeStep(int... opcodes) {
this.wantOpcodes = new ArrayList<>();
for (int opcode : opcodes) {
this.wantOpcodes.add(opcode);
}
}
@Override
public AbstractInsnNode tryMatch(InstructionMatcher matcher, AbstractInsnNode now) {
if (this.wantOpcodes.contains(now.getOpcode()) && (function == null || function.apply(now))) {
return now.getNext();
}
return null;
}
@Override
public String toString() {
return "OpcodeStep{" +
"wantOpcodes=" + wantOpcodes +
'}';
}
}
``` |
Anthony Marvin Yezer is a professor of economics at George Washington University in the Columbian College of Arts and Sciences. He has provided expert testimony for the United States Congress and Federal Trade Commission on sub-prime mortgage lending and trade regulation issues. He is Director of the Center for Economic Research and a Fellow of the Homer Hoyt School of Advanced Studies in Real Estate and Urban Economics. He is also an affiliate of the Institute for International Economic Policy.
Education
Yezer received a B.S. from Dartmouth College, M.S. from London School of Economics and Political Science, and his PhD in Economics & Urban Studies from Massachusetts Institute of Technology. He was Rhodes Scholarship finalist and received a National Collegiate Athletic Association Scholar-Athlete Fellowship.
Work
Yezer's research has merited inclusion in more than a dozen journals, and he serves as principal editor for the American Real Estate and Urban Economics Association monograph series. He served on the National Research Council's Panel on Disaster Needs in the Social Sciences which led to the publication of The Economic Consequences of a Catastrophic Earthquake.
In 2013, Yezer published the textbook, "Economics of Crime and Enforcement". "This text is designed for use in a course on the economics of crime in a variety of settings. Assuming only a previous course in basic microeconomics, this innovative book is strongly linked to the new theoretical and empirical journal literature. Showing the power of microeconomics in action, Yezer covers a wide array of topics. There are chapters on the following topics: benefit-cost and the imprisonment decision, enforcement games, juvenile crime, private enforcement, economics of 3 strikes law, broken windows strategies, police profiling, and crime in developing countries. There are also separate chapters on guns, drugs, and capital punishment."
References
George Washington University faculty
Living people
Year of birth missing (living people)
Massachusetts Institute of Technology alumni |
```python
import tensorflow as tf
import tensorflow.contrib.layers as layers
from rlattack.common.tf_util import noisy_dense
def model(img_in, num_actions, scope, noisy=False, reuse=False, concat_softmax=False):
with tf.variable_scope(scope, reuse=reuse):
out = img_in
with tf.variable_scope("convnet"):
# original architecture
out = layers.convolution2d(
out, num_outputs=32, kernel_size=8, stride=4, activation_fn=tf.nn.relu
)
out = layers.convolution2d(
out, num_outputs=64, kernel_size=4, stride=2, activation_fn=tf.nn.relu
)
out = layers.convolution2d(
out, num_outputs=64, kernel_size=3, stride=1, activation_fn=tf.nn.relu
)
out = layers.flatten(out)
with tf.variable_scope("action_value"):
if noisy:
# Apply noisy network on fully connected layers
# ref: path_to_url
out = noisy_dense(
out, name="noisy_fc1", size=512, activation_fn=tf.nn.relu
)
out = noisy_dense(out, name="noisy_fc2", size=num_actions)
else:
out = layers.fully_connected(
out, num_outputs=512, activation_fn=tf.nn.relu
)
out = layers.fully_connected(
out, num_outputs=num_actions, activation_fn=None
)
# V: Softmax - inspired by deep-rl-attack #
if concat_softmax:
out = tf.nn.softmax(out)
return out
def dueling_model(
img_in, num_actions, scope, noisy=False, reuse=False, concat_softmax=False
):
"""As described in path_to_url"""
with tf.variable_scope(scope, reuse=reuse):
out = img_in
with tf.variable_scope("convnet"):
# original architecture
out = layers.convolution2d(
out, num_outputs=32, kernel_size=8, stride=4, activation_fn=tf.nn.relu
)
out = layers.convolution2d(
out, num_outputs=64, kernel_size=4, stride=2, activation_fn=tf.nn.relu
)
out = layers.convolution2d(
out, num_outputs=64, kernel_size=3, stride=1, activation_fn=tf.nn.relu
)
out = layers.flatten(out)
with tf.variable_scope("state_value"):
if noisy:
# Apply noisy network on fully connected layers
# ref: path_to_url
state_hidden = noisy_dense(
out, name="noisy_fc1", size=512, activation_fn=tf.nn.relu
)
state_score = noisy_dense(state_hidden, name="noisy_fc2", size=1)
else:
state_hidden = layers.fully_connected(
out, num_outputs=512, activation_fn=tf.nn.relu
)
state_score = layers.fully_connected(
state_hidden, num_outputs=1, activation_fn=None
)
with tf.variable_scope("action_value"):
if noisy:
# Apply noisy network on fully connected layers
# ref: path_to_url
actions_hidden = noisy_dense(
out, name="noisy_fc1", size=512, activation_fn=tf.nn.relu
)
action_scores = noisy_dense(
actions_hidden, name="noisy_fc2", size=num_actions
)
else:
actions_hidden = layers.fully_connected(
out, num_outputs=512, activation_fn=tf.nn.relu
)
action_scores = layers.fully_connected(
actions_hidden, num_outputs=num_actions, activation_fn=None
)
action_scores_mean = tf.reduce_mean(action_scores, 1)
action_scores = action_scores - tf.expand_dims(action_scores_mean, 1)
return state_score + action_scores
``` |
Five Easy Pieces, is the first EP album release by composer Michael Vincent Waller. It features a collection of four pieces for piano solo L'anno del Serpente (2013), Ninna Nanna (2013), Per Terry e Morty (2012), Acqua Santa (2013) performed by Japanese pianist Gumi Shibata and Chinese-American pianist Jenny Q. Chai.
References
Contemporary classical compositions |
Parliamentary elections were held in Azerbaijan on 7 November 2010.
Candidates
The registration of candidates ended on 15 October. Although 1,115 candidates filed application to run in the election, only 690 were given the go ahead by the electoral commission.
Conduct
The elections were observed by monitors from the European Parliament, Organization for Security and Co-operation in Europe (OSCE) and the Council of Europe. OSCE stated that the election campaign had been marred by restrictions on media freedom and freedom of assembly. Many opposition candidates were unable to register themselves, thus creating an "uneven playing field", according to the OSCE. The pre-election atmosphere was tense with the media complaining of pressure and intransparent financial transactions of state officials.
The observation mission of the PACE reported that "the whole election process showed progress in reaching Assembly and OSCE standards and commitments" but that "significant progress would still be necessary to reach an overall electoral and democratic consensus".
Many national and foreign experts found no major improvement in the conduct of these elections. No elections after 1992 was fully in accordance with national and international democratic standards. So far Azerbaijan has been convicted twice of election fraud during the 2005 parliamentary elections by the European Court of Human Rights in Strasbourg. In April it was regarding Nemat Aliyev's case, and in September regarding Flora Karimova's.
Prior to the elections, the government amended visa regulations, making it more difficult for election observers and journalists to enter the country.
Results
President Ilham Aliyev's ruling Yeni Azerbaijan Party got a majority of 71 out of 125 seats. Nominally independent candidates, who were aligned with the government, received 38 seats, and 10 small opposition or quasi-opposition parties got the remaining 13 seats. Civic Solidarity retained its 3 seats, and Ana Vaten kept the 2 seats they had in the previous legislature; the Democratic Reforms party, Great Creation, the Movement for National Rebirth, Umid, Civic Unity, Civic Welfare, Adalet (Justice), and the Popular Front of United Azerbaijan, most of which were represented in the previous parliament, won one seat a piece.
For the first time in Azerbaijani history, not a single candidate from the main opposition Azerbaijan Popular Front (AXCP) or Musavat parties was elected. The opposition Musavat decried the election as "illegitimate...[the] events had nothing to do with elections, it was the most shameful kind of election." Ruling president, Aliyev, however, said the election was fair.
Reactions
Western observers and the opposition alleged irregularities. The elections were observed by monitors from the European Parliament, Organization for Security and Co-operation in Europe (OSCE) and the Council of Europe. The OSCE reported that on election day there were cases of ballot-stuffing.
References
Parliamentary elections in Azerbaijan
Azerbaijani
Azerbaijani
2010 in Azerbaijan
Election and referendum articles with incomplete results |
Humilladero is a town and municipality in the province of Málaga, part of the autonomous community of Andalusia in southern Spain. It is located in the comarca of Antequera. The municipality is situated on the border with the province of Seville and 78 kilometers from the city of Málaga and 528 km from Madrid. It has a population of approximately 3,300 residents.
References
Municipalities in the Province of Málaga |
```c++
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "config.h"
#include "web/ExternalPopupMenu.h"
#include "core/HTMLNames.h"
#include "core/frame/FrameHost.h"
#include "core/frame/PinchViewport.h"
#include "core/html/HTMLSelectElement.h"
#include "core/html/forms/PopupMenuClient.h"
#include "core/layout/LayoutMenuList.h"
#include "core/page/Page.h"
#include "core/testing/DummyPageHolder.h"
#include "platform/PopupMenu.h"
#include "platform/testing/URLTestHelpers.h"
#include "public/platform/Platform.h"
#include "public/platform/WebUnitTestSupport.h"
#include "public/web/WebExternalPopupMenu.h"
#include "public/web/WebPopupMenuInfo.h"
#include "public/web/WebSettings.h"
#include "web/WebLocalFrameImpl.h"
#include "web/tests/FrameTestHelpers.h"
#include <gtest/gtest.h>
namespace blink {
const size_t kListSize = 7;
class TestPopupMenuClient : public PopupMenuClient {
public:
TestPopupMenuClient() : m_listSize(0) { }
~TestPopupMenuClient() override { }
void valueChanged(unsigned listIndex, bool fireEvents = true) override { }
void selectionChanged(unsigned listIndex, bool fireEvents = true) override { }
void selectionCleared() override { }
String itemText(unsigned listIndex) const override { return emptyString(); }
String itemToolTip(unsigned listIndex) const override { return emptyString(); }
String itemAccessibilityText(unsigned listIndex) const override { return emptyString(); }
bool itemIsEnabled(unsigned listIndex) const override { return true; }
PopupMenuStyle itemStyle(unsigned listIndex) const override
{
FontDescription fontDescription;
fontDescription.setComputedSize(12.0);
Font font(fontDescription);
font.update(nullptr);
bool displayNone = m_displayNoneIndexSet.find(listIndex) != m_displayNoneIndexSet.end();
return PopupMenuStyle(Color::black, Color::white, font, true, displayNone, Length(), TextDirection(), false);
}
PopupMenuStyle menuStyle() const override { return itemStyle(0); }
LayoutUnit clientPaddingLeft() const override { return 0; }
LayoutUnit clientPaddingRight() const override { return 0; }
int listSize() const override { return m_listSize; }
int selectedIndex() const override { return 0; }
void popupDidHide() override { }
void popupDidCancel() override { }
bool itemIsSeparator(unsigned listIndex) const override { return false;}
bool itemIsLabel(unsigned listIndex) const override { return false; }
bool itemIsSelected(unsigned listIndex) const override { return listIndex == 0;}
void provisionalSelectionChanged(unsigned listIndex) override { }
bool multiple() const override { return false; }
IntRect elementRectRelativeToViewport() const override { return IntRect(); }
Element& ownerElement() const override { return *m_ownerElement; }
const ComputedStyle* computedStyleForItem(Element& element) const override { return nullptr; }
void setListSize(size_t size) { m_listSize = size; }
void setDisplayNoneIndex(unsigned index) { m_displayNoneIndexSet.insert(index); }
void setOwnerElement(PassRefPtrWillBeRawPtr<Element> element) { m_ownerElement = element; }
private:
size_t m_listSize;
std::set<unsigned> m_displayNoneIndexSet;
RefPtrWillBePersistent<Element> m_ownerElement;
};
class ExternalPopupMenuDisplayNoneItemsTest : public testing::Test {
public:
ExternalPopupMenuDisplayNoneItemsTest() { }
protected:
void SetUp() override
{
m_popupMenuClient.setListSize(kListSize);
// Set the 4th an 5th items to have "display: none" property
m_popupMenuClient.setDisplayNoneIndex(3);
m_popupMenuClient.setDisplayNoneIndex(4);
OwnPtr<DummyPageHolder> dummyPageHolder = DummyPageHolder::create(IntSize(800, 600));
m_popupMenuClient.setOwnerElement(HTMLSelectElement::create(dummyPageHolder->document()));
}
TestPopupMenuClient m_popupMenuClient;
};
TEST_F(ExternalPopupMenuDisplayNoneItemsTest, PopupMenuInfoSizeTest)
{
WebPopupMenuInfo info;
ExternalPopupMenu::getPopupMenuInfo(info, m_popupMenuClient);
EXPECT_EQ(5U, info.items.size());
}
TEST_F(ExternalPopupMenuDisplayNoneItemsTest, IndexMappingTest)
{
// 6th indexed item in popupmenu would be the 4th item in ExternalPopupMenu,
// and vice-versa.
EXPECT_EQ(4, ExternalPopupMenu::toExternalPopupMenuItemIndex(6, m_popupMenuClient));
EXPECT_EQ(6, ExternalPopupMenu::toPopupMenuItemIndex(4, m_popupMenuClient));
// Invalid index, methods should return -1.
EXPECT_EQ(-1, ExternalPopupMenu::toExternalPopupMenuItemIndex(8, m_popupMenuClient));
EXPECT_EQ(-1, ExternalPopupMenu::toPopupMenuItemIndex(8, m_popupMenuClient));
}
class ExternalPopupMenuWebFrameClient : public FrameTestHelpers::TestWebFrameClient {
public:
WebExternalPopupMenu* createExternalPopupMenu(const WebPopupMenuInfo&, WebExternalPopupMenuClient*) override
{
return &m_mockWebExternalPopupMenu;
}
WebRect shownBounds() const
{
return m_mockWebExternalPopupMenu.shownBounds();
}
private:
class MockWebExternalPopupMenu : public WebExternalPopupMenu {
void show(const WebRect& bounds) override
{
m_shownBounds = bounds;
}
void close() override { }
public:
WebRect shownBounds() const
{
return m_shownBounds;
}
private:
WebRect m_shownBounds;
};
WebRect m_shownBounds;
MockWebExternalPopupMenu m_mockWebExternalPopupMenu;
};
class ExternalPopupMenuTest : public testing::Test {
public:
ExternalPopupMenuTest() : m_baseURL("path_to_url") { }
protected:
void SetUp() override
{
m_helper.initialize(false, &m_webFrameClient, &m_webViewClient);
webView()->setUseExternalPopupMenus(true);
}
void TearDown() override
{
Platform::current()->unitTestSupport()->unregisterAllMockedURLs();
}
void registerMockedURLLoad(const std::string& fileName)
{
URLTestHelpers::registerMockedURLLoad(URLTestHelpers::toKURL(m_baseURL + fileName), WebString::fromUTF8(fileName.c_str()), WebString::fromUTF8("popup/"), WebString::fromUTF8("text/html"));
}
void loadFrame(const std::string& fileName)
{
FrameTestHelpers::loadFrame(mainFrame(), m_baseURL + fileName);
}
WebViewImpl* webView() const { return m_helper.webViewImpl(); }
const ExternalPopupMenuWebFrameClient& client() const { return m_webFrameClient; }
WebLocalFrameImpl* mainFrame() const { return m_helper.webViewImpl()->mainFrameImpl(); }
private:
std::string m_baseURL;
FrameTestHelpers::TestWebViewClient m_webViewClient;
ExternalPopupMenuWebFrameClient m_webFrameClient;
FrameTestHelpers::WebViewHelper m_helper;
};
TEST_F(ExternalPopupMenuTest, PopupAccountsForPinchViewportOffset)
{
registerMockedURLLoad("select_mid_screen.html");
loadFrame("select_mid_screen.html");
webView()->resize(WebSize(100, 100));
webView()->layout();
HTMLSelectElement* select = toHTMLSelectElement(mainFrame()->frame()->document()->getElementById("select"));
LayoutMenuList* menuList = toLayoutMenuList(select->layoutObject());
ASSERT_TRUE(menuList);
PinchViewport& pinchViewport = webView()->page()->frameHost().pinchViewport();
IntRect rectInDocument = menuList->absoluteBoundingBoxRect();
webView()->setPageScaleFactor(2);
IntPoint scrollDelta(20, 30);
pinchViewport.move(scrollDelta);
menuList->showPopup();
EXPECT_EQ(rectInDocument.x() - scrollDelta.x(), client().shownBounds().x);
EXPECT_EQ(rectInDocument.y() - scrollDelta.y(), client().shownBounds().y);
}
TEST_F(ExternalPopupMenuTest, DidAcceptIndex)
{
registerMockedURLLoad("select.html");
loadFrame("select.html");
HTMLSelectElement* select = toHTMLSelectElement(mainFrame()->frame()->document()->getElementById("select"));
LayoutMenuList* menuList = toLayoutMenuList(select->layoutObject());
ASSERT_TRUE(menuList);
menuList->showPopup();
ASSERT_TRUE(menuList->popupIsVisible());
WebExternalPopupMenuClient* client = static_cast<ExternalPopupMenu*>(menuList->popup());
client->didAcceptIndex(2);
EXPECT_FALSE(menuList->popupIsVisible());
ASSERT_STREQ("2", menuList->text().utf8().data());
EXPECT_EQ(2, select->selectedIndex());
}
TEST_F(ExternalPopupMenuTest, DidAcceptIndices)
{
registerMockedURLLoad("select.html");
loadFrame("select.html");
HTMLSelectElement* select = toHTMLSelectElement(mainFrame()->frame()->document()->getElementById("select"));
LayoutMenuList* menuList = toLayoutMenuList(select->layoutObject());
ASSERT_TRUE(menuList);
menuList->showPopup();
ASSERT_TRUE(menuList->popupIsVisible());
WebExternalPopupMenuClient* client = static_cast<ExternalPopupMenu*>(menuList->popup());
int indices[] = { 2 };
WebVector<int> indicesVector(indices, 1);
client->didAcceptIndices(indicesVector);
EXPECT_FALSE(menuList->popupIsVisible());
EXPECT_STREQ("2", menuList->text().utf8().data());
EXPECT_EQ(2, select->selectedIndex());
}
TEST_F(ExternalPopupMenuTest, DidAcceptIndicesClearSelect)
{
registerMockedURLLoad("select.html");
loadFrame("select.html");
HTMLSelectElement* select = toHTMLSelectElement(mainFrame()->frame()->document()->getElementById("select"));
LayoutMenuList* menuList = toLayoutMenuList(select->layoutObject());
ASSERT_TRUE(menuList);
menuList->showPopup();
ASSERT_TRUE(menuList->popupIsVisible());
WebExternalPopupMenuClient* client = static_cast<ExternalPopupMenu*>(menuList->popup());
WebVector<int> indices;
client->didAcceptIndices(indices);
EXPECT_FALSE(menuList->popupIsVisible());
EXPECT_EQ(-1, select->selectedIndex());
}
} // namespace blink
``` |
```go
package ledger
import (
"errors"
"fmt"
"math/big"
"os"
secp "github.com/decred/dcrd/dcrec/secp256k1/v4"
"github.com/decred/dcrd/dcrec/secp256k1/v4/ecdsa"
"gitlab.com/yawning/secp256k1-voi/secec"
"github.com/cosmos/cosmos-sdk/crypto/hd"
"github.com/cosmos/cosmos-sdk/crypto/keys/secp256k1"
"github.com/cosmos/cosmos-sdk/crypto/types"
)
// options stores the Ledger Options that can be used to customize Ledger usage
var options Options
type (
// discoverLedgerFn defines a Ledger discovery function that returns a
// connected device or an error upon failure. Its allows a method to avoid CGO
// dependencies when Ledger support is potentially not enabled.
discoverLedgerFn func() (SECP256K1, error)
// createPubkeyFn supports returning different public key types that implement
// types.PubKey
createPubkeyFn func([]byte) types.PubKey
// SECP256K1 reflects an interface a Ledger API must implement for SECP256K1
SECP256K1 interface {
Close() error
// GetPublicKeySECP256K1 returns an uncompressed pubkey
GetPublicKeySECP256K1([]uint32) ([]byte, error)
// GetAddressPubKeySECP256K1 returns a compressed pubkey and bech32 address (requires user confirmation)
GetAddressPubKeySECP256K1([]uint32, string) ([]byte, string, error)
// SignSECP256K1 signs a message (requires user confirmation)
// The last byte denotes the SIGN_MODE to be used by Ledger: 0 for
// LEGACY_AMINO_JSON, 1 for TEXTUAL. It corresponds to the P2 value
// in path_to_url
SignSECP256K1([]uint32, []byte, byte) ([]byte, error)
}
// Options hosts customization options to account for differences in Ledger
// signing and usage across chains.
Options struct {
discoverLedger discoverLedgerFn
createPubkey createPubkeyFn
appName string
skipDERConversion bool
}
// PrivKeyLedgerSecp256k1 implements PrivKey, calling the ledger nano we
// cache the PubKey from the first call to use it later.
PrivKeyLedgerSecp256k1 struct {
// CachedPubKey should be private, but we want to encode it via
// go-amino so we can view the address later, even without having the
// ledger attached.
CachedPubKey types.PubKey
Path hd.BIP44Params
}
)
// Initialize the default options values for the Cosmos Ledger
func initOptionsDefault() {
options.createPubkey = func(key []byte) types.PubKey {
return &secp256k1.PubKey{Key: key}
}
options.appName = "Cosmos"
options.skipDERConversion = false
}
// SetDiscoverLedger set the discoverLedger function to use a different Ledger derivation
func SetDiscoverLedger(fn discoverLedgerFn) {
options.discoverLedger = fn
}
// SetCreatePubkey set the createPubkey function to use a different public key
func SetCreatePubkey(fn createPubkeyFn) {
options.createPubkey = fn
}
// SetAppName set the Ledger app name to use a different app name
func SetAppName(appName string) {
options.appName = appName
}
// SetSkipDERConversion set the DER Conversion requirement to true (false by default)
func SetSkipDERConversion() {
options.skipDERConversion = true
}
// NewPrivKeySecp256k1Unsafe will generate a new key and store the public key for later use.
//
// This function is marked as unsafe as it will retrieve a pubkey without user verification.
// It can only be used to verify a pubkey but never to create new accounts/keys. In that case,
// please refer to NewPrivKeySecp256k1
func NewPrivKeySecp256k1Unsafe(path hd.BIP44Params) (types.LedgerPrivKeyAminoJSON, error) {
device, err := getDevice()
if err != nil {
return nil, err
}
defer warnIfErrors(device.Close)
pubKey, err := getPubKeyUnsafe(device, path)
if err != nil {
return nil, err
}
return PrivKeyLedgerSecp256k1{pubKey, path}, nil
}
// NewPrivKeySecp256k1 will generate a new key and store the public key for later use.
// The request will require user confirmation and will show account and index in the device
func NewPrivKeySecp256k1(path hd.BIP44Params, hrp string) (types.LedgerPrivKey, string, error) {
device, err := getDevice()
if err != nil {
return nil, "", fmt.Errorf("failed to retrieve device: %w", err)
}
defer warnIfErrors(device.Close)
pubKey, addr, err := getPubKeyAddrSafe(device, path, hrp)
if err != nil {
return nil, "", fmt.Errorf("failed to recover pubkey: %w", err)
}
return PrivKeyLedgerSecp256k1{pubKey, path}, addr, nil
}
// PubKey returns the cached public key.
func (pkl PrivKeyLedgerSecp256k1) PubKey() types.PubKey {
return pkl.CachedPubKey
}
// Sign returns a secp256k1 signature for the corresponding message using
// SIGN_MODE_TEXTUAL.
func (pkl PrivKeyLedgerSecp256k1) Sign(message []byte) ([]byte, error) {
device, err := getDevice()
if err != nil {
return nil, err
}
defer warnIfErrors(device.Close)
return sign(device, pkl, message, 1)
}
// SignLedgerAminoJSON returns a secp256k1 signature for the corresponding message using
// SIGN_MODE_LEGACY_AMINO_JSON.
func (pkl PrivKeyLedgerSecp256k1) SignLedgerAminoJSON(message []byte) ([]byte, error) {
device, err := getDevice()
if err != nil {
return nil, err
}
defer warnIfErrors(device.Close)
return sign(device, pkl, message, 0)
}
// ShowAddress triggers a ledger device to show the corresponding address.
func ShowAddress(path hd.BIP44Params, expectedPubKey types.PubKey, accountAddressPrefix string) error {
device, err := getDevice()
if err != nil {
return err
}
defer warnIfErrors(device.Close)
pubKey, err := getPubKeyUnsafe(device, path)
if err != nil {
return err
}
if !pubKey.Equals(expectedPubKey) {
return errors.New("the key's pubkey does not match with the one retrieved from Ledger. Check that the HD path and device are the correct ones")
}
pubKey2, _, err := getPubKeyAddrSafe(device, path, accountAddressPrefix)
if err != nil {
return err
}
if !pubKey2.Equals(expectedPubKey) {
return errors.New("the key's pubkey does not match with the one retrieved from Ledger. Check that the HD path and device are the correct ones")
}
return nil
}
// ValidateKey allows us to verify the sanity of a public key after loading it
// from disk.
func (pkl PrivKeyLedgerSecp256k1) ValidateKey() error {
device, err := getDevice()
if err != nil {
return err
}
defer warnIfErrors(device.Close)
return validateKey(device, pkl)
}
// AssertIsPrivKeyInner implements the PrivKey interface. It performs a no-op.
func (pkl *PrivKeyLedgerSecp256k1) AssertIsPrivKeyInner() {}
// Bytes implements the PrivKey interface. It stores the cached public key so
// we can verify the same key when we reconnect to a ledger.
func (pkl PrivKeyLedgerSecp256k1) Bytes() []byte {
return cdc.MustMarshal(pkl)
}
// Equals implements the PrivKey interface. It makes sure two private keys
// refer to the same public key.
func (pkl PrivKeyLedgerSecp256k1) Equals(other types.LedgerPrivKey) bool {
if otherKey, ok := other.(PrivKeyLedgerSecp256k1); ok {
return pkl.CachedPubKey.Equals(otherKey.CachedPubKey)
}
return false
}
func (pkl PrivKeyLedgerSecp256k1) Type() string { return "PrivKeyLedgerSecp256k1" }
// warnIfErrors wraps a function and writes a warning to stderr. This is required
// to avoid ignoring errors when defer is used. Using defer may result in linter warnings.
func warnIfErrors(f func() error) {
if err := f(); err != nil {
_, _ = fmt.Fprint(os.Stderr, "received error when closing ledger connection", err)
}
}
func convertDERtoBER(signatureDER []byte) ([]byte, error) {
sigDER, err := ecdsa.ParseDERSignature(signatureDER)
if err != nil {
return nil, err
}
sigStr := sigDER.Serialize()
// The format of a DER encoded signature is as follows:
// 0x30 <total length> 0x02 <length of R> <R> 0x02 <length of S> <S>
r, s := new(big.Int), new(big.Int)
r.SetBytes(sigStr[4 : 4+sigStr[3]])
s.SetBytes(sigStr[4+sigStr[3]+2:])
sModNScalar := new(secp.ModNScalar)
sModNScalar.SetByteSlice(s.Bytes())
// based on path_to_url#L33-L50
if sModNScalar.IsOverHalfOrder() {
s = new(big.Int).Sub(secp.S256().N, s)
}
sigBytes := make([]byte, 64)
// 0 pad the byte arrays from the left if they aren't big enough.
copy(sigBytes[32-len(r.Bytes()):32], r.Bytes())
copy(sigBytes[64-len(s.Bytes()):64], s.Bytes())
return sigBytes, nil
}
func getDevice() (SECP256K1, error) {
if options.discoverLedger == nil {
return nil, errors.New("no Ledger discovery function defined")
}
device, err := options.discoverLedger()
if err != nil {
return nil, fmt.Errorf("ledger nano S: %w", err)
}
return device, nil
}
func validateKey(device SECP256K1, pkl PrivKeyLedgerSecp256k1) error {
pub, err := getPubKeyUnsafe(device, pkl.Path)
if err != nil {
return err
}
// verify this matches cached address
if !pub.Equals(pkl.CachedPubKey) {
return errors.New("cached key does not match retrieved key")
}
return nil
}
// Sign calls the ledger and stores the PubKey for future use.
//
// Communication is checked on NewPrivKeyLedger and PrivKeyFromBytes, returning
// an error, so this should only trigger if the private key is held in memory
// for a while before use.
//
// Last byte P2 is 0 for LEGACY_AMINO_JSON, and 1 for TEXTUAL.
func sign(device SECP256K1, pkl PrivKeyLedgerSecp256k1, msg []byte, p2 byte) ([]byte, error) {
err := validateKey(device, pkl)
if err != nil {
return nil, err
}
sig, err := device.SignSECP256K1(pkl.Path.DerivationPath(), msg, p2)
if err != nil {
return nil, err
}
if options.skipDERConversion {
return sig, nil
}
return convertDERtoBER(sig)
}
// getPubKeyUnsafe reads the pubkey from a ledger device
//
// This function is marked as unsafe as it will retrieve a pubkey without user verification
// It can only be used to verify a pubkey but never to create new accounts/keys. In that case,
// please refer to getPubKeyAddrSafe
//
// since this involves IO, it may return an error, which is not exposed
// in the PubKey interface, so this function allows better error handling
func getPubKeyUnsafe(device SECP256K1, path hd.BIP44Params) (types.PubKey, error) {
publicKey, err := device.GetPublicKeySECP256K1(path.DerivationPath())
if err != nil {
return nil, fmt.Errorf("please open the %v app on the Ledger device - error: %w", options.appName, err)
}
// re-serialize in the 33-byte compressed format
cmp, err := secec.NewPublicKey(publicKey)
if err != nil {
return nil, fmt.Errorf("error parsing public key: %w", err)
}
compressedPublicKey := make([]byte, secp256k1.PubKeySize)
copy(compressedPublicKey, cmp.CompressedBytes())
return options.createPubkey(compressedPublicKey), nil
}
// getPubKeyAddr reads the pubkey and the address from a ledger device.
// This function is marked as Safe as it will require user confirmation and
// account and index will be shown in the device.
//
// Since this involves IO, it may return an error, which is not exposed
// in the PubKey interface, so this function allows better error handling.
func getPubKeyAddrSafe(device SECP256K1, path hd.BIP44Params, hrp string) (types.PubKey, string, error) {
publicKey, addr, err := device.GetAddressPubKeySECP256K1(path.DerivationPath(), hrp)
if err != nil {
return nil, "", fmt.Errorf("%w: address rejected for path %s", err, path)
}
// re-serialize in the 33-byte compressed format
cmp, err := secec.NewPublicKey(publicKey)
if err != nil {
return nil, "", fmt.Errorf("error parsing public key: %w", err)
}
compressedPublicKey := make([]byte, secp256k1.PubKeySize)
copy(compressedPublicKey, cmp.CompressedBytes())
return options.createPubkey(compressedPublicKey), addr, nil
}
``` |
```php
<?php
use DBA\AccessGroupAgent;
use DBA\Agent;
use DBA\Assignment;
use DBA\Chunk;
use DBA\CrackerBinary;
use DBA\File;
use DBA\FileTask;
use DBA\JoinFilter;
use DBA\OrderFilter;
use DBA\Preprocessor;
use DBA\QueryFilter;
use DBA\Factory;
require_once(dirname(__FILE__) . "/inc/load.php");
if (!Login::getInstance()->isLoggedin()) {
header("Location: index.php?err=4" . time() . "&fw=" . urlencode($_SERVER['PHP_SELF'] . "?" . $_SERVER['QUERY_STRING']));
die();
}
AccessControl::getInstance()->checkPermission(array_merge(DViewControl::TASKS_VIEW_PERM, DAccessControl::RUN_TASK_ACCESS));
Template::loadInstance("tasks/index");
Menu::get()->setActive("tasks_list");
//catch actions here...
if (isset($_POST['action']) && CSRF::check($_POST['csrf'])) {
$taskHandler = new TaskHandler();
$taskHandler->handle($_POST['action']);
if (UI::getNumMessages() == 0) {
Util::refresh();
}
}
//test if auto-reload is enabled
$autorefresh = 0;
if (isset($_COOKIE['autorefresh']) && $_COOKIE['autorefresh'] == '1') {
$autorefresh = 10;
}
if (isset($_POST['toggleautorefresh'])) {
if ($autorefresh != 0) {
$autorefresh = 0;
setcookie("autorefresh", "0", time() - 600);
}
else {
$autorefresh = 10;
setcookie("autorefresh", "1", time() + 3600 * 24);
}
Util::refresh();
}
if ($autorefresh > 0) { //renew cookie
setcookie("autorefresh", "1", time() + 3600 * 24);
}
UI::add('autorefresh', 0);
if (isset($_GET['id']) || !isset($_GET['new'])) {
UI::add('autorefresh', $autorefresh);
UI::add('autorefreshUrl', "");
}
if (isset($_GET['id'])) {
AccessControl::getInstance()->checkPermission(DViewControl::TASKS_VIEW_PERM);
Template::loadInstance("tasks/detail");
$task = Factory::getTaskFactory()->get($_GET['id']);
if ($task == null) {
UI::printError("ERROR", "Invalid task ID!");
}
UI::add('task', $task);
$taskWrapper = Factory::getTaskWrapperFactory()->get($task->getTaskWrapperId());
UI::add('taskWrapper', $taskWrapper);
$fileInfo = Util::getFileInfo($task, AccessUtils::getAccessGroupsOfUser(Login::getInstance()->getUser()));
if ($fileInfo[4]) {
UI::printError("ERROR", "No access to this task!");
}
$hashlist = Factory::getHashlistFactory()->get($taskWrapper->getHashlistId());
if (!AccessUtils::userCanAccessHashlists($hashlist, Login::getInstance()->getUser())) {
UI::printError("ERROR", "No access to this task!");
}
UI::add('hashlist', $hashlist);
$hashtype = Factory::getHashTypeFactory()->get($hashlist->getHashtypeId());
UI::add('hashtype', $hashtype);
$isActive = 0;
$activeChunks = [];
$activeChunksIds = new DataSet();
$qF = new QueryFilter(Chunk::TASK_ID, $task->getId(), "=");
$chunks = Factory::getChunkFactory()->filter([Factory::FILTER => $qF]);
$activeAgents = new DataSet();
$agentsSpeed = new DataSet();
$currentSpeed = 0;
foreach ($chunks as $chunk) {
if (time() - max($chunk->getSolveTime(), $chunk->getDispatchTime()) < SConfig::getInstance()->getVal(DConfig::CHUNK_TIMEOUT) && $chunk->getProgress() < 10000) {
$isActive = 1;
$activeChunks[] = $chunk;
$activeChunksIds->addValue($chunk->getId(), true);
$activeAgents->addValue($chunk->getAgentId(), true);
$agentsSpeed->addValue($chunk->getAgentId(), $chunk->getSpeed());
$currentSpeed += $chunk->getSpeed();
}
else {
$activeChunksIds->addValue($chunk->getId(), false);
}
}
UI::add('isActive', $isActive);
UI::add('currentSpeed', $currentSpeed);
$agentsBench = new DataSet();
$qF = new QueryFilter(Assignment::TASK_ID, $task->getId(), "=");
$assignments = Factory::getAssignmentFactory()->filter([Factory::FILTER => $qF]);
foreach ($assignments as $assignment) {
$agentsBench->addValue($assignment->getAgentId(), $assignment->getBenchmark());
}
$cProgress = 0;
$chunkIntervals = [];
$agentsProgress = new DataSet();
$agentsSpent = new DataSet();
$agentsCracked = new DataSet();
$qF = new QueryFilter(Chunk::TASK_ID, $task->getId(), "=");
$chunks = Factory::getChunkFactory()->filter([Factory::FILTER => $qF]);
foreach ($chunks as $chunk) {
if ($chunk->getDispatchTime() > 0 && $chunk->getSolveTime() > 0) {
$chunkIntervals[] = ["start" => $chunk->getDispatchTime(), "stop" => $chunk->getSolveTime()];
}
$cProgress += $chunk->getCheckpoint() - $chunk->getSkip();
if (!$agentsProgress->getVal($chunk->getAgentId())) {
$agentsProgress->addValue($chunk->getAgentId(), $chunk->getCheckpoint() - $chunk->getSkip());
$agentsCracked->addValue($chunk->getAgentId(), $chunk->getCracked());
$agentsSpent->addValue($chunk->getAgentId(), max($chunk->getSolveTime() - $chunk->getDispatchTime(), 0));
}
else {
$agentsProgress->addValue($chunk->getAgentId(), $agentsProgress->getVal($chunk->getAgentId()) + $chunk->getCheckpoint() - $chunk->getSkip());
$agentsCracked->addValue($chunk->getAgentId(), $agentsCracked->getVal($chunk->getAgentId()) + $chunk->getCracked());
$agentsSpent->addValue($chunk->getAgentId(), $agentsSpent->getVal($chunk->getAgentId()) + max($chunk->getSolveTime() - $chunk->getDispatchTime(), 0));
}
}
UI::add('agentsProgress', $agentsProgress);
UI::add('agentsSpent', $agentsSpent);
UI::add('agentsCracked', $agentsCracked);
UI::add('cProgress', $cProgress);
$timeChunks = $chunks;
usort($timeChunks, "Util::compareChunksTime");
$timeSpent = 0;
$current = 0;
foreach ($timeChunks as $c) {
if ($c->getDispatchTime() > $current) {
$timeSpent += $c->getSolveTime() - $c->getDispatchTime();
$current = $c->getSolveTime();
}
else if ($c->getSolveTime() > $current) {
$timeSpent += $c->getSolveTime() - $current;
$current = $c->getSolveTime();
}
}
UI::add('timeSpent', $timeSpent);
if ($task->getKeyspace() != 0 && ($cProgress / $task->getKeyspace()) != 0) {
UI::add('timeLeft', round($timeSpent / ($cProgress / $task->getKeyspace()) - $timeSpent));
}
else {
UI::add('timeLeft', -1);
}
$qF = new QueryFilter(FileTask::TASK_ID, $task->getId(), "=", Factory::getFileTaskFactory());
$jF = new JoinFilter(Factory::getFileTaskFactory(), FileTask::FILE_ID, File::FILE_ID);
$joinedFiles = Factory::getFileFactory()->filter([Factory::FILTER => $qF, Factory::JOIN => $jF]);
UI::add('attachedFiles', $joinedFiles[Factory::getFileFactory()->getModelName()]);
$jF = new JoinFilter(Factory::getAssignmentFactory(), Assignment::AGENT_ID, Agent::AGENT_ID);
$qF = new QueryFilter(Assignment::TASK_ID, $task->getId(), "=", Factory::getAssignmentFactory());
$joinedAgents = Factory::getAgentFactory()->filter([Factory::FILTER => $qF, Factory::JOIN => $jF]);
$assignedAgents = array();
foreach ($joinedAgents[Factory::getAgentFactory()->getModelName()] as $agent) {
/** @var $agent Agent */
$assignedAgents[] = $agent->getId();
}
UI::add('agents', $joinedAgents[Factory::getAgentFactory()->getModelName()]);
UI::add('activeAgents', $activeAgents);
UI::add('agentsBench', $agentsBench);
UI::add('agentsSpeed', $agentsSpeed);
$assignAgents = array();
$qF = new QueryFilter(AccessGroupAgent::ACCESS_GROUP_ID, $hashlist->getAccessGroupId(), "=");
$jF = new JoinFilter(Factory::getAccessGroupAgentFactory(), AccessGroupAgent::AGENT_ID, Agent::AGENT_ID);
$allAgents = Factory::getAgentFactory()->filter([Factory::FILTER => $qF, Factory::JOIN => $jF])[Factory::getAgentFactory()->getModelName()];
foreach ($allAgents as $agent) {
if (!in_array($agent->getId(), $assignedAgents)) {
$assignAgents[] = $agent;
}
}
UI::add('assignAgents', $assignAgents);
$qF = new QueryFilter(Chunk::TASK_ID, $task->getId(), "=");
UI::add('numChunks', Factory::getChunkFactory()->countFilter([Factory::FILTER => $qF]));
UI::add('showAllAgents', false);
if (isset($_GET['allagents'])) {
UI::add('showAllAgents', true);
$allAgentsSpent = new DataSet();
$allAgents = new DataSet();
$agentObjects = array();
$qF = new QueryFilter(Chunk::TASK_ID, $task->getId(), "=", Factory::getChunkFactory());
$jF = new JoinFilter(Factory::getChunkFactory(), Chunk::AGENT_ID, Agent::AGENT_ID);
$joinedAgents = Factory::getAgentFactory()->filter([Factory::FILTER => $qF, Factory::JOIN => $jF]);
/** @var $agents Agent[] */
$agents = $joinedAgents[Factory::getAgentFactory()->getModelName()];
for ($i = 0; $i < sizeof($agents); $i++) {
/** @var $chunk Chunk */
$chunk = $joinedAgents[Factory::getChunkFactory()->getModelName()][$i];
$agent = $agents[$i];
if ($allAgents->getVal($agent->getId()) == null) {
$allAgents->addValue($agent->getId(), $agent);
$agentObjects[] = $agent;
}
if ($chunk->getSolveTime() > $chunk->getDispatchTime()) {
if ($allAgentsSpent->getVal($agent->getId()) == null) {
$allAgentsSpent->addValue($agent->getId(), $chunk->getSolveTime() - $chunk->getDispatchTime());
}
else {
$allAgentsSpent->addValue($agent->getId(), $allAgentsSpent->getVal($agent->getId()) + $chunk->getSolveTime() - $chunk->getDispatchTime());
}
}
}
UI::add('agentObjects', $agentObjects);
UI::add('allAgentsSpent', $allAgentsSpent);
}
UI::add('activeChunks', $activeChunksIds);
if (isset($_GET['all'])) {
if ($_GET['all'] == 1) {
// show last 100
UI::add('chunkFilter', 1);
$qF = new QueryFilter(Chunk::TASK_ID, $task->getId(), "=");
$oF = new OrderFilter(Chunk::SOLVE_TIME, "DESC LIMIT 100");
UI::add('chunks', Factory::getChunkFactory()->filter([Factory::FILTER => $qF, Factory::ORDER => $oF]));
}
else if ($_GET['all'] == 2) {
UI::add('chunkFilter', 2);
// show all, page by page
if (!isset($_GET['pagesize'])) {
$chunkPageSize = 100;
}
else {
$chunkPageSize = intval($_GET['pagesize']);
}
if (!isset($_GET['page'])) {
$page = 0;
}
else {
$page = intval($_GET['page']);
}
UI::add('page', $page);
$limit = $page * $chunkPageSize;
$oFp = new OrderFilter(Chunk::SOLVE_TIME, "DESC LIMIT $limit, $chunkPageSize", Factory::getChunkFactory());
UI::add('chunksPageTitle', "All chunks (page " . ($page + 1) . ")");
$qF = new QueryFilter(Chunk::TASK_ID, $task->getId(), "=");
$oF = new OrderFilter(Chunk::SOLVE_TIME, "DESC");
$numEntries = Factory::getChunkFactory()->countFilter([Factory::FILTER => $qF]);
UI::add('maxpage', floor($numEntries / $chunkPageSize));
UI::add('chunks', Factory::getChunkFactory()->filter([Factory::FILTER => $qF, Factory::ORDER => [$oF, $oFp]]));
UI::add('activeChunks', $activeChunksIds);
}
else {
// show active only
UI::add('chunkFilter', 0);
UI::add('chunks', $activeChunks);
}
}
else {
// show active only by default
UI::add('chunkFilter', 0);
UI::add('chunks', $activeChunks);
}
if ($task->getUsePreprocessor()) {
try {
UI::add('preprocessor', PreprocessorUtils::getPreprocessor($task->getUsePreprocessor()));
}
catch (HTException $e) {
UI::printError("ERROR", "Failed to load preprocessor!");
}
}
$agents = Factory::getAgentFactory()->filter([]);
$fullAgents = new DataSet();
foreach ($agents as $agent) {
$fullAgents->addValue($agent->getId(), $agent);
}
UI::add('fullAgents', $fullAgents);
UI::add('pageTitle', "Task details for " . $task->getTaskName());
// load graph data
$data = Util::getSpeedDataSet($task->getId(), 50, 0, $task->getStatusTimer());
if (sizeof($data) > 0) {
$xlabels = [];
$rawData = [];
foreach ($data as $key => $val) {
$xlabels[] = date(SConfig::getInstance()->getVal(DConfig::TIME_FORMAT), $key);
$rawData[] = $val;
}
$datasets[0] = [
"label" => "H/s",
"fill" => false,
"lineTension" => 0.2,
"borderColor" => "#008000",
"backgroundColor" => "#008000",
"data" => $rawData
];
UI::add("taskSpeedXLabels", json_encode($xlabels));
UI::add("taskSpeed", json_encode($datasets));
}
UI::add('taskGraph', (sizeof($data) > 0) ? 1 : 0);
}
else if (isset($_GET['new'])) {
AccessControl::getInstance()->checkPermission(array_merge(DAccessControl::RUN_TASK_ACCESS, DAccessControl::CREATE_TASK_ACCESS));
Template::loadInstance("tasks/new");
Menu::get()->setActive("tasks_new");
$orig = 0;
$origTask = null;
$origType = 0;
$hashlistId = 0;
$copy = null;
if (isset($_GET["copy"])) {
AccessControl::getInstance()->checkPermission(DAccessControl::CREATE_TASK_ACCESS); // enforce additional permission for this
//copied from a task
$copy = Factory::getTaskFactory()->get($_GET['copy']);
if ($copy != null) {
$orig = $copy->getId();
$origTask = clone $copy;
$origType = 1;
$hashlistId = Factory::getTaskWrapperFactory()->get($copy->getTaskWrapperId())->getHashlistId();
$copy->setId(0);
$match = array();
if (preg_match('/\(copy([0-9]+)\)/i', $copy->getTaskName(), $match)) {
$name = $copy->getTaskName();
$name = str_replace($match[0], "(copy" . (++$match[1]) . ")", $name);
$copy->setTaskName($name);
}
else {
$copy->setTaskName($copy->getTaskName() . " (copy1)");
}
}
}
else if (isset($_GET["copyPre"])) {
//copied from a task
$copy = Factory::getPretaskFactory()->get($_GET['copyPre']);
if ($copy != null) {
$orig = $copy->getId();
$origTask = $copy;
$origType = 2;
$copy = TaskUtils::getFromPretask($copy);
}
}
if ($copy === null) {
$copy = TaskUtils::getDefault();
}
if (strpos($copy->getAttackCmd(), SConfig::getInstance()->getVal(DConfig::HASHLIST_ALIAS)) === false) {
$copy->setAttackCmd(SConfig::getInstance()->getVal(DConfig::HASHLIST_ALIAS) . " " . $copy->getAttackCmd());
}
UI::add('accessGroups', AccessUtils::getAccessGroupsOfUser(Login::getInstance()->getUser()));
$accessGroupIds = Util::arrayOfIds(UI::get('accessGroups'));
UI::add('orig', $orig);
UI::add('copy', $copy);
UI::add('origType', $origType);
UI::add('hashlistId', $hashlistId);
$lists = array();
$res = HashlistUtils::getHashlists(Login::getInstance()->getUser());
foreach ($res as $list) {
$set = new DataSet();
$set->addValue('id', $list->getId());
$set->addValue('name', $list->getHashlistName());
$lists[] = $set;
}
$res = HashlistUtils::getSuperhashlists(Login::getInstance()->getUser());
foreach ($res as $list) {
$set = new DataSet();
$set->addValue('id', $list->getId());
$set->addValue('name', $list->getHashlistName());
$lists[] = $set;
}
UI::add('lists', $lists);
$oF = new OrderFilter(Preprocessor::NAME, "ASC");
$preprocessors = Factory::getPreprocessorFactory()->filter([Factory::ORDER => $oF]);
UI::add('preprocessors', $preprocessors);
$origFiles = array();
if ($origType == 1) {
$origFiles = Util::arrayOfIds(TaskUtils::getFilesOfTask($origTask));
}
else if ($origType == 2) {
$origFiles = Util::arrayOfIds(TaskUtils::getFilesOfPretask($origTask));
}
$arr = FileUtils::loadFilesByCategory(Login::getInstance()->getUser(), $origFiles);
UI::add('wordlists', $arr[1]);
UI::add('rules', $arr[0]);
UI::add('other', $arr[2]);
$oF = new OrderFilter(CrackerBinary::CRACKER_BINARY_ID, "DESC");
UI::add('binaries', Factory::getCrackerBinaryTypeFactory()->filter([]));
$versions = Factory::getCrackerBinaryFactory()->filter([Factory::ORDER => $oF]);
usort($versions, ["Util", "versionComparisonBinary"]);
UI::add('versions', $versions);
UI::add('pageTitle', "Create Task");
}
else {
AccessControl::getInstance()->checkPermission(DViewControl::TASKS_VIEW_PERM);
UI::add('showArchived', false);
UI::add('pageTitle', "Tasks");
if (isset($_GET['archived']) && $_GET['archived'] == 'true') {
Util::loadTasks(true);
UI::add('showArchived', true);
UI::add('pageTitle', "Archived Tasks");
}
else {
Util::loadTasks(false);
}
}
echo Template::getInstance()->render(UI::getObjects());
``` |
```smalltalk
using UIKit;
namespace SkiaSharp.Tests
{
public class Program
{
static void Main(string[] args)
{
UIApplication.Main(args, null, typeof(AppDelegate));
}
}
}
``` |
USS Natchez was a sloop-of-war in the United States Navy built at the Norfolk Naval Shipyard, Portsmouth, Virginia in 1827. Commanded by Commander George Budd, she departed Hampton Roads on 26 July 1827 for the Caribbean. She patrolled with the West Indies Squadron as a deterrent against a resurgence of piracy until forced to sail north by an outbreak of yellow fever among the crew, returning to New York City on 24 November 1828.
The sloop, Commander William B. Shubrick in command, got underway for the Caribbean on 9 July 1829 and operated in the West Indies and along the Atlantic Coast until she decommissioned at Norfolk, Virginia on 24 August 1831 and was placed in ordinary. Reactivated during the South Carolina nullification crisis, Natchez was recommissioned on 28 December and sailed for Charleston on 2 January 1833, anchoring in Rebellion Roads on the 19th. She moved up to Charleston Battery on 12 March and remained in that important Southern port until tensions were eased when the United States Congress lowered the tariff. She sailed for Hampton Roads on 4 April and, upon arriving Norfolk, was again placed in ordinary.
Natchez returned to the West Indies in 1836 and operated there into 1838. She again cruised in the Caribbean in 1839. She was scrapped at the New York Navy Yard in 1840.
References
External links
Guide to the Journal of the Baltimore, the Ruth, and the USS Natchez, 1826-1828 MS 6 held by Special Collection & Archives , Nimitz Library at the United States Naval Academy
1827 ships
Ships built in Portsmouth, Virginia
Sloops of the United States Navy |
```xml
/* !
*/
import * as React from "react";
import { Tag, Text } from "@blueprintjs/core";
interface IMultiSelectCustomTargetProps {
count: number;
}
export const MultiSelectCustomTarget: React.FC<IMultiSelectCustomTargetProps> = ({ count }) => {
return (
<Tag
large={true}
round={true}
minimal={true}
interactive={true}
intent={"primary"}
className="docs-custom-target"
>
<div className="docs-custom-target-content">
<Text className={"docs-custom-target-text"}>Custom Target</Text>
<Tag intent={"primary"} round={true}>
{count}
</Tag>
</div>
</Tag>
);
};
``` |
Franz Anton, Count of Hohenzollern-Haigerloch (2 December 1657 at Sigmaringen Castle – 14 October 1702 in Friedlingen), was a reigning Count of Hohenzollern-Haigerloch.
Life
Franz Anton was the youngest son of Prince Meinrad I of Hohenzollern-Sigmaringen (1605-1681) from his marriage to Anna Marie (1613-1682), the daughter of Baron Ferdinand of Törring at Seefeld.
He served in the imperial army and reached the rank of Field Marshal-Lieutenant. Under the terms of the family's elevation to the rank of Prince, his eldest brother inherited the principality of Hohenzollern-Sigmaringen and Franz Anton only inherited the County of Hohenzollern-Haigerloch. In 1692, Emperor Leopold I again confirmed that the Princes of Swabina branch of the House of Hohenzollern held the rank of Imperial Princes, he explicitly made an exception for the Haigerloch line.
Franz Anton fell in the Battle of Friedlingen, during the War of the Spanish Succession.
Marriage and issue
Franz Anton married on 5 February 1687 to Anna Maria Eusebia (1670-1716), the daughter of Count Anton Eusebius of Königsegg-Aulendorf. The couple had the following children:
Ferdinand Leopold Anton (1692-1750), clergy and prime minister of Cologne
Anna Maria (1694-1732), married in 1714 to Ludwig Xaver Fugger, Count of Kirchberg and Weissenhorn (1688-1746), a descendent of the Fugger Family.
Maria Franziska (1697-1767), married in 1720 to Count Franz Hugo of Koenigsegg-Rothfels (1698-1772)
Franz Christoph Anton (1699-1767), clergy and prime minister of Cologne
See also
House of Hohenzollern
Footnotes
References
Gustav Schilling: Geschichte des Hauses Hohenzollern in genealogisch fortlaufenden Biographien aller seiner Regenten von den ältesten bis auf die neuesten Zeiten, nach Urkunden und andern authentischen Quellen, Fleischer, Leipzig, 1843, p. 228 ff and 274,p. 228ff online, p. 274 online.
Counts of Hohenzollern-Haigerloch
House of Hohenzollern
1657 births
1702 deaths
17th-century German people |
Jeff Gaither (born 1962 in Louisville, Kentucky) is a graphic artist noted for his many pictures for the music industry.
Gaither has been practicing his particular blend of horror and rock art for over 25 years. He has created art for The Misfits, Guns N' Roses, Look Afraid, The Undead, Biohazard, Insane Clown Posse, Accused and many more bands of all genres. He blames it all on his aunt, who in his youth bought him copies of Famous Monsters of Filmland, and took him to movies like The Exorcist and Night of the Living Dead. Jeff is a visual artist, digital artist, photographer, sculptor.
Major accomplishments and relevant contributions
Created art for an estimated 300+ music CD covers
Created art for 2500+ magazine/fanzine covers
Art appears worldwide on posters, prints, clothing, skateboards, skis, glassware, stickers, magazines, book covers, and more
Art published in Art of Modern Rock: The Poster Explosion, 2004
Notes
External links
Official website for Jeff Gaither
Scare Halloween trick-or-treaters with artist Jeff Gaither's missing screen prank, Louisville, 21 September 2009
1962 births
Living people
Artists from Louisville, Kentucky
American graphic designers |
Japanese resistance can refer to:
Political dissidence in the Empire of Japan
Dissent in the Armed Forces of the Empire of Japan
Japanese in the Chinese resistance to the Empire of Japan
Japanese People's Emancipation League
Japanese People's Anti-war Alliance
League to Raise the Political Consciousness of Japanese Troops
Japanese holdouts, Japanese soldiers who continued fighting after Japan’s surrender in World War II
Volunteer Fighting Corps, planned civil defence units |
```objective-c
// 2016 and later: Unicode, Inc. and others.
/*
*******************************************************************************
*
* Corporation and others. All Rights Reserved.
*
*******************************************************************************
* file name: ucol_swp.h
* encoding: UTF-8
* tab size: 8 (not used)
* indentation:4
*
* created on: 2003sep10
* created by: Markus W. Scherer
*
* Swap collation binaries.
*/
#ifndef __UCOL_SWP_H__
#define __UCOL_SWP_H__
#include "unicode/utypes.h"
#if !UCONFIG_NO_COLLATION
#include "udataswp.h"
/*
* Does the data look like a collation binary?
* @internal
*/
U_INTERNAL UBool U_EXPORT2
ucol_looksLikeCollationBinary(const UDataSwapper *ds,
const void *inData, int32_t length);
/**
* Swap ICU collation data like ucadata.icu. See udataswp.h.
* @internal
*/
U_CAPI int32_t U_EXPORT2
ucol_swap(const UDataSwapper *ds,
const void *inData, int32_t length, void *outData,
UErrorCode *pErrorCode);
/**
* Swap inverse UCA collation data (invuca.icu). See udataswp.h.
* @internal
*/
U_CAPI int32_t U_EXPORT2
ucol_swapInverseUCA(const UDataSwapper *ds,
const void *inData, int32_t length, void *outData,
UErrorCode *pErrorCode);
#endif /* #if !UCONFIG_NO_COLLATION */
#endif
``` |
Eudonia protorthra is a moth in the family Crambidae. It was described by Edward Meyrick in 1885. It is found in Australia, where it has been recorded from New South Wales, Queensland and Victoria.
References
Moths described in 1885
Eudonia |
Mike Downes is a Canadian jazz musician, composer, arranger and educator who specializes on the upright bass, composition and arranging. Downes has appeared on JUNO award-winning and nominated recordings, including his own "Ripple Effect," which won a 2014 JUNO Award for Traditional Jazz Album of the Year, and "Root Structure", which won the 2018 JUNO Award for Jazz Album of the Year:Solo.
Biography
Downes began performing in his native Winnipeg, where he was named "Jazz Musician of the Year" at Silver Heights Collegiate high school. He was chosen as a member of the Canadian All-Star stage band (trombone) in the 1982 MusicFest Canada competition. Following high school he studied at Nova Scotia's St. F.X. University and completed a Bachelor of Music degree at McGill University in Montreal. During this time he began recording and touring internationally as a sideman with Canadian and visiting international artists.
In 1990 Downes moved to Toronto and began frequently performing in jazz clubs such as the Top O' the Senator and the Jazz Bistro, as well as concert venues such as Roy Thomson Hall, Massey Hall, CBC's Glenn Gould Theatre and the O'Keefe Centre. "Forces," his first recording as a leader, was released in 1995 on Polygram. Following that release Jazz Report magazine noted "Bassist Mike Downes is one of Canada's immensely talented young giants."
Downes has since continued to perform worldwide. He has performed with Canadian artists including Molly Johnson, Oliver Jones, PJ Perry, Don Thompson, Seamus Blake, Guido Basso and Pat LaBarbera and with international jazz artists including Pat Metheny, Chris Potter, John Abercrombie, Peter Erskine, Kenny Wheeler, John Taylor, Dave Liebman and others.
Mike was appointed Bass Department Head at Humber College in Toronto in 2000. In 2008 Downes completed a master's degree in music composition at York University in Toronto.
Publications include The Jazz Bass Line Book published by Advance/Schott Music and Jazz and Contemporary Music Theory. He became a Yamaha artist in 2004 and helped in the design of the Yamaha SLB-200 Silent Bass.
Awards and honors
Juno Awards
2009 Jazz Vocal Album of the Year, Lucky, Molly Johnson[3]
2014 Traditional Jazz Album of the Year, Ripple Effect, Mike Downes[1]
2018 Jazz Album of the Year:Solo, Root Structure, Ted Quinlan, Larnell Lewis and Robi Botos
2019 Jazz Album of the Year:Solo, "Old Soul", Robi Botos<ref>
Juno Award nominations
1995 Bill Please, Lorne Lofsky
2001 Dark Divas, Ranee Lee
2003 Another Day, Molly Johnson
2004 Maple Groove, Ranee Lee
2007 Messin' Around, Molly Johnson
2013 Identity, Shirantha Beddage
2015 Because of Billie, Molly Johnson
2016 Legacy Live, Jens Lindemann and Tommy Banks
2017 Momentum, Shirantha Beddage
2019 Meaning to Tell Ya, Molly Johnson
2019 In the Moment, Larnell Lewis
2020 The Chronicles of Fezziwig, Mark Kelso
2020 SymphRonica UpFront, Ron Davis
Montreal Jazz Festival Prix de Jazz winner
1996 Roy Patterson Quartet
2012 Robi Botos Trio[2]
Other
College Innovator of the Year Award, League for Innovation in the Community College, 2000
National Jazz Awards nomination, Jazz Bassist of the Year, 2005, 2006
Humber College Distinguished Faculty Award, 2006, 2009
NISOD Excellence Award, University of Texas at Austin, 2007
2018 Louis Applebaum Composers' Award - Jazz Composition nomination, 2018
Selected discography
As a leader
Forces (Counterpoint, 1995)[1]
The Winds of Change (TopFrog, 2004)
Then (M Music, 2009)
Ripple Effect (Addo, 2013)
In the Current (Addo, 2013)
Root Structure (Addo, 2017)
Mind Mirrors (M Music, 2022)
As a sideman
Vikrama (Knut Haugsoen) – Hands On (Unity, 1989)
Trisha Pope – T (MCA/Duke Street, 1992)
Vikrama – Experience (Unity, 1992)
Roy/Lerner w/Peter Erskine – Quarter to Three (Justin Time, 1992)
Jacek Kochan w/John Abercrombie – Corporate Highlanders (Unit, 1992)
Steve Holt Quartet – Catwalk (Sackville, 1993)
Richard Whiteman Quartet – This is Now (Counterpoint, 1994)
Lorne Lofsky Trio – Bill Please (Jazz Inspiration, 1994)
Richard Whiteman Trio – Grooveyard (Counterpoint, 1996)
Earl MacDonald – Schroeder's Tantrum (Radioland, 1997)
Ranee Lee – Dark Divas (Justin Time, 2000)
Molly Johnson – Another Day (EMI Marquis, 2002)
Bob Brough – A Decade of Favorites (Robert H Brough, 2003)
Ranee Lee – Maple Groove (Justin Time, 2003)
Gap Mangione – Stolen Moments (Josh Music, 2003)
Ted's Warren Commission – First Time Caller (Ted Warren, 2004)
Louise Pitre – Shattered (Universal, 2004)
Molly Johnson – Messin' Around (Universal, 2006)
Dean McNeill – Prairie Fire: Large Jazz Ensemble (Cellar Live, 2007)
Ron Davis – Subarashii Live (Davinor, 2007)
Bill Prouten – Low-down, No-good (Bill Prouten, 2007)
Patrick Boyle – Still No Word (Patrick Boyle, 2008)
Ted's Warren Commission – Songs for Doug (Ted Warren, 2008)
Jasna Jovicevic – Invented Reality (Jasna Jovicevic, 2008)
Molly Johnson – Lucky A440 Entertainment (Universal Music Classics France, 2008)
Ron Davis – My Mother's Father's Song (Minerva Road/Davinor, 2010)
Will Fisher Coastal Quartet – Portage (Will Fisher, 2011)
Molly Johnson – The Molly Johnson Songbook (Universal Music Canada, 2011)
Shirantha Beddage – Identity (Addo, 2012)
Molly Johnson – Because of Billie (Universal, 2014))
Mary Panacci – Her Perfume (Independent, 2014)
Daniela Nardi – Canto (Minerva Road, 2015)
Ron Davis – Pocket SymphRonica (Really, 2015)
Mark Promane – Canadiana Suite (Independent, 2015)
Ben Ball Quartet – 401 Towards London (Independent, 2015)
Jens Lindemann & Tommy Banks – Legacy Live (Independent, 2016)
Ted's Warren Commission – The Great Regina Pizza Debate (Independent, 2016)
Shirantha Beddage – Momentum (Independent, 2016)
Patrick Boyle – After Forgetting (Independent, 2017)
Ron Davis – SymphRonica UpFront (Independent, 2017)
John Pittman – Kinship (Independent, 2017)
Robi Botos – Old Soul (Independent, 2018)
Molly Johnson – Meaning to Tell Ya (Universal Music Canada, 2018)
Larnell Lewis – In the Moment (Independent, 2018)
Ron Davis' Symphronicia – instrumental music Liberation Front (Independent, 2020)
External links
Official Mike Downes website
Humber College Faculty
Yamaha Artist
References
Canadian jazz bass guitarists
Canadian jazz double-bassists
Male double-bassists
Musicians from Winnipeg
Year of birth missing (living people)
Living people
Juno Award for Jazz Album of the Year – Solo winners
Juno Award for Traditional Jazz Album of the Year winners
21st-century double-bassists
21st-century Canadian male musicians
Canadian male jazz musicians |
```xml
import { MutatorClientInterface, SyncServiceInterface } from '@standardnotes/services'
import { ClientDisplayableError } from '@standardnotes/responses'
import { DecryptedItemInterface, FileItem, VaultListingInterface } from '@standardnotes/models'
import { FilesClientInterface } from '@standardnotes/files'
import { ContentType } from '@standardnotes/domain-core'
export class MoveItemsToVault {
constructor(
private mutator: MutatorClientInterface,
private sync: SyncServiceInterface,
private files: FilesClientInterface,
) {}
async execute(dto: {
items: DecryptedItemInterface[]
vault: VaultListingInterface
}): Promise<ClientDisplayableError | void> {
for (const item of dto.items) {
await this.mutator.changeItem(item, (mutator) => {
mutator.key_system_identifier = dto.vault.systemIdentifier
mutator.shared_vault_uuid = dto.vault.isSharedVaultListing() ? dto.vault.sharing.sharedVaultUuid : undefined
})
}
await this.sync.sync()
for (const item of dto.items) {
if (item.content_type !== ContentType.TYPES.File) {
continue
}
if (dto.vault.isSharedVaultListing()) {
await this.files.moveFileToSharedVault(item as FileItem, dto.vault)
} else {
const itemPreviouslyBelongedToSharedVault = item.shared_vault_uuid
if (itemPreviouslyBelongedToSharedVault) {
await this.files.moveFileOutOfSharedVault(item as FileItem)
}
}
}
}
}
``` |
Thomas High School may refer to:
Fort Thomas High School, Fort Thomas, Arizona
Norman Thomas High School, New York City
Thomas High School (West Virginia), a former school in Tucker County Schools, West Virginia
Thomas High School (Oklahoma), Thomas, Oklahoma
Webster Thomas High School, Webster, New York
See also
St. Thomas High School (disambiguation) |
Dalmellington was one of 32 electoral wards of East Ayrshire Council. Originally created in 1974, the ward was initially within Cumnock and Doon Valley District Council before the local government reforms in the 1990s. The ward elected one councillor using the first-past-the-post voting electoral system.
The ward was a Labour stronghold as the party successfully held the seat at every election after gaining it from the Social Democratic Party (SDP) in 1992 until it was abolished.
In 2007, the ward was abolished and replaced by the multi-member Doon Valley ward as council elections moved to a proportional voting system – the single transferable vote – following the implementation of the Local Governance (Scotland) Act 2004.
Boundaries
The Dalmellington ward was created in 1974 by the Formation Electoral Arrangements from the previous Dalmellington South electoral division of Ayr County Council. The ward centered around the town of Dalmellington and took in the southern part of Cumnock and Doon Valley next to its borders with Kyle and Carrick District Council and Stewartry District Council. The boundaries remained largely unchanged following the Initial Statutory Reviews of Electoral Arrangements in 1981. A review in 1986 into the boundaries between the Cumnock and Doon Valley and Kyle and Carrick district councils saw an area to the south of Dalmellington transferred from Kyle and Carrick to Cumnock and Doon Valley which extended the council area to the boundary with Wigtown District Council and included the whole of Loch Doon within Cumnock and Doon Valley. All of the area transferred was included within the Dalmellington ward. Following the Second Statutory Reviews of Electoral Arrangements in 1994, the ward's eastern boundary was moved west to reduce it in area as a result of the 1986 review. After the implementation of the Local Government etc. (Scotland) Act 1994, the boundaries proposed by the second review became the Formation Electoral Arrangements for the newly created East Ayrshire Council – an amalgamation of Cumnock and Doon Valley District Council and Kilmarnock and Loudoun District Council. In 1998, the Third Statutory Reviews of Electoral Arrangements made minor alterations to the wards northern boundary ahead of the 1999 election. In 2007, the ward was abolished as the Local Governance (Scotland) Act 2004 saw proportional representation and new multi-member wards introduced. The vast majority of the area covered by the Dalmellington ward was placed into the new Doon Valley ward and a small area became part of the Cumnock and New Cumnock ward.
Councillors
Election results
2003 election
1999 election
1995 election
1992 election
1988 election
1984 election
1980 election
1977 election
1974 election
References
Wards of East Ayrshire
Dalmellington |
USS Minnetonka was one of eight wooden steam frigates authorized by the United States Navy during the American Civil War to provide a postwar general purpose fleet.
She was launched on 3 July 1867 by the Portsmouth Navy Yard, Kittery, Maine; and sponsored by Miss Margaret Bailey. Renamed USS California on 15 May 1869, she first went to sea on 7 October 1870, and served briefly in the Pacific. However, because she had been constructed of partially seasoned timber due to an unprecedented volume of shipbuilding during the war, her hull deteriorated rapidly and she was sold at Mare Island Navy Yard in May 1875.
See also
List of sloops of war of the United States Navy
References
Steamships of the United States Navy
Ships built in Kittery, Maine
1867 ships |
```html
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Define a Custom Attribute Mapping for a Generator</title>
<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
<link rel="home" href="../../../../index.html" title="Spirit 2.5.4">
<link rel="up" href="../auto.html" title="Create Components from Attributes (Qi and Karma)">
<link rel="prev" href="create_parser.html" title="Define a Custom Attribute Mapping for a Parser">
<link rel="next" href="../../../support.html" title="Supporting Libraries">
</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="create_parser.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../auto.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../../support.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="spirit.advanced.customize.auto.create_generator"></a><a class="link" href="create_generator.html" title="Define a Custom Attribute Mapping for a Generator">Define
a Custom Attribute Mapping for a Generator</a>
</h5></div></div></div>
<h6>
<a name="spirit.advanced.customize.auto.create_generator.h0"></a>
<span class="phrase"><a name="spirit.advanced.customize.auto.create_generator.create_generator"></a></span><a class="link" href="create_generator.html#spirit.advanced.customize.auto.create_generator.create_generator">create_generator</a>
</h6>
<p>
The template <code class="computeroutput"><span class="identifier">create_generator</span></code>
is a type used as an customization point. It is invoked by the <span class="emphasis"><em>Karma</em></span>
<a class="link" href="../../../karma/reference/generate_api/create_generator.html" title="API for Automatic Generator Creation"><code class="computeroutput"><span class="identifier">create_generator</span></code></a> API function
in order to create a custom mapping of the given data type to a generator
expression. This generator expression will be returned from <a class="link" href="../../../karma/reference/generate_api/create_generator.html" title="API for Automatic Generator Creation"><code class="computeroutput"><span class="identifier">create_generator</span></code></a> whenever the
given data type is encountered.
</p>
<h6>
<a name="spirit.advanced.customize.auto.create_generator.h1"></a>
<span class="phrase"><a name="spirit.advanced.customize.auto.create_generator.module_headers"></a></span><a class="link" href="create_generator.html#spirit.advanced.customize.auto.create_generator.module_headers">Module
Headers</a>
</h6>
<pre class="programlisting"><span class="comment">// forwards to <boost/spirit/home/karma/auto.hpp></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">include</span><span class="special">/</span><span class="identifier">karma_auto</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
Also, see <a class="link" href="../../../structure/include.html" title="Include">Include Structure</a>.
</p>
<h6>
<a name="spirit.advanced.customize.auto.create_generator.h2"></a>
<span class="phrase"><a name="spirit.advanced.customize.auto.create_generator.namespace"></a></span><a class="link" href="create_generator.html#spirit.advanced.customize.auto.create_generator.namespace">Namespace</a>
</h6>
<div class="informaltable"><table class="table">
<colgroup><col></colgroup>
<thead><tr><th>
<p>
Name
</p>
</th></tr></thead>
<tbody><tr><td>
<p>
<code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">spirit</span><span class="special">::</span><span class="identifier">traits</span></code>
</p>
</td></tr></tbody>
</table></div>
<h6>
<a name="spirit.advanced.customize.auto.create_generator.h3"></a>
<span class="phrase"><a name="spirit.advanced.customize.auto.create_generator.synopsis"></a></span><a class="link" href="create_generator.html#spirit.advanced.customize.auto.create_generator.synopsis">Synopsis</a>
</h6>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Enable</span><span class="special">></span>
<span class="keyword">struct</span> <span class="identifier">create_generator</span>
<span class="special">{</span>
<span class="keyword">typedef</span> <span class="special"><</span><span class="identifier">unspecified</span><span class="special">></span> <span class="identifier">type</span><span class="special">;</span>
<span class="keyword">static</span> <span class="identifier">type</span> <span class="keyword">const</span><span class="special">&</span> <span class="identifier">call</span><span class="special">();</span>
<span class="special">};</span>
</pre>
<h6>
<a name="spirit.advanced.customize.auto.create_generator.h4"></a>
<span class="phrase"><a name="spirit.advanced.customize.auto.create_generator.template_parameters"></a></span><a class="link" href="create_generator.html#spirit.advanced.customize.auto.create_generator.template_parameters">Template
parameters</a>
</h6>
<div class="informaltable"><table class="table">
<colgroup>
<col>
<col>
<col>
</colgroup>
<thead><tr>
<th>
<p>
Parameter
</p>
</th>
<th>
<p>
Description
</p>
</th>
<th>
<p>
Default
</p>
</th>
</tr></thead>
<tbody>
<tr>
<td>
<p>
<code class="computeroutput"><span class="identifier">T</span></code>
</p>
</td>
<td>
<p>
The type, <code class="computeroutput"><span class="identifier">T</span></code>
for which a custom mapping to a generator should be established.
</p>
</td>
<td>
<p>
none
</p>
</td>
</tr>
<tr>
<td>
<p>
<code class="computeroutput"><span class="identifier">Enable</span></code>
</p>
</td>
<td>
<p>
Helper template parameter usable to selectively enable or disable
certain specializations of <code class="computeroutput"><span class="identifier">create_generator</span></code>
utilizing SFINAE (i.e. <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">enable_if</span></code>
or <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">disable_if</span></code>).
</p>
</td>
<td>
<p>
<code class="computeroutput"><span class="keyword">void</span></code>
</p>
</td>
</tr>
</tbody>
</table></div>
<div class="variablelist">
<p class="title"><b>Notation</b></p>
<dl class="variablelist">
<dt><span class="term"><code class="computeroutput"><span class="identifier">T</span></code></span></dt>
<dd><p>
An arbitrary type.
</p></dd>
</dl>
</div>
<h6>
<a name="spirit.advanced.customize.auto.create_generator.h5"></a>
<span class="phrase"><a name="spirit.advanced.customize.auto.create_generator.expression_semantics"></a></span><a class="link" href="create_generator.html#spirit.advanced.customize.auto.create_generator.expression_semantics">Expression
Semantics</a>
</h6>
<div class="informaltable"><table class="table">
<colgroup>
<col>
<col>
</colgroup>
<thead><tr>
<th>
<p>
Expression
</p>
</th>
<th>
<p>
Semantics
</p>
</th>
</tr></thead>
<tbody>
<tr>
<td>
<p>
<code class="computeroutput"><span class="identifier">create_generator</span><span class="special"><</span><span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span></code>
</p>
</td>
<td>
<p>
Defines the type of the generator expression returned from
<code class="computeroutput"><span class="identifier">call</span></code>.
</p>
</td>
</tr>
<tr>
<td>
<p>
<code class="computeroutput"><span class="identifier">create_generator</span><span class="special"><</span><span class="identifier">T</span><span class="special">>::</span><span class="identifier">call</span><span class="special">()</span></code>
</p>
</td>
<td>
<p>
Returns a generator expression (usually this is a proto::expression)
to be used as the default generator for the given type, <code class="computeroutput"><span class="identifier">T</span></code>.
</p>
</td>
</tr>
</tbody>
</table></div>
<h6>
<a name="spirit.advanced.customize.auto.create_generator.h6"></a>
<span class="phrase"><a name="spirit.advanced.customize.auto.create_generator.predefined_specializations"></a></span><a class="link" href="create_generator.html#spirit.advanced.customize.auto.create_generator.predefined_specializations">Predefined
Specializations</a>
</h6>
<p>
<a href="path_to_url" target="_top">Spirit</a> predefines specializations
of this customization point for several types. All predefined mappings
are listed here: <a class="link" href="../../../karma/reference/auto.html#spirit.karma.reference.auto.additional_requirements">Additional
Attribute Requirements for Generators</a>.
</p>
<div class="note"><table border="0" summary="Note">
<tr>
<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../images/note.png"></td>
<th align="left">Note</th>
</tr>
<tr><td align="left" valign="top"><p>
It is possible to overload the predefined mappings for the listed types
by providing your own specialization of the <code class="computeroutput"><span class="identifier">create_generator</span></code>
customization point for the type to modify.
</p></td></tr>
</table></div>
<h6>
<a name="spirit.advanced.customize.auto.create_generator.h7"></a>
<span class="phrase"><a name="spirit.advanced.customize.auto.create_generator.when_to_implement"></a></span><a class="link" href="create_generator.html#spirit.advanced.customize.auto.create_generator.when_to_implement">When
to implement</a>
</h6>
<p>
The customization point <code class="computeroutput"><span class="identifier">create_generator</span></code>
needs to be implemented for a specific type whenever this type should
be usable with the API function <a class="link" href="../../../karma/reference/generate_api/create_generator.html" title="API for Automatic Generator Creation"><code class="computeroutput"><span class="identifier">create_generator</span></code></a> (which includes
using the <code class="computeroutput"><span class="identifier">karma</span><span class="special">::</span><span class="identifier">auto_</span></code> generator and the special API
functions based on the automatic creation of the matching generator type).
</p>
<h6>
<a name="spirit.advanced.customize.auto.create_generator.h8"></a>
<span class="phrase"><a name="spirit.advanced.customize.auto.create_generator.example"></a></span><a class="link" href="create_generator.html#spirit.advanced.customize.auto.create_generator.example">Example</a>
</h6>
<p>
For an example of how to use the customization point <code class="computeroutput"><span class="identifier">create_generator</span></code>
please see here: <a class="link" href="../../../karma/reference/auto.html#spirit.karma.reference.auto.example">Example
for Using the <code class="computeroutput"><span class="identifier">karma</span><span class="special">::</span><span class="identifier">auto_</span></code> Generator</a>.
</p>
</div>
<table xmlns:rev="path_to_url~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
file LICENSE_1_0.txt or copy at <a href="path_to_url" target="_top">path_to_url
</p>
</div></td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="create_parser.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../auto.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../../support.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
``` |
Erigeron anchana, the Sierra Ancha fleabane, is a rare Arizona species of flowering plant in the family Asteraceae. It has been found only on cliff faces and in rocky areas in central Arizona. The name "anchana" refers to a mountain range called Sierra Ancha in Gila County, Arizona.
Erigeron anchana is a short perennial rarely more than 22 cm (9 inches) tall. The inflorescence generally consists of 1 - 3 flower heads, each head with a ring of 14–36 white ray florets surrounding a disc of yellow disc florets.
References
anchana
Flora of Arizona
Plants described in 1990 |
This Thing Called Love: The Greatest Hits of Alexander O'Neal is a compilation album by American recording artist Alexander O'Neal, released in 1992 by Tabu Records. It includes tracks from three of O'Neal's previous studio albums: Alexander O'Neal (1985), Hearsay (1987) and All True Man (1991).
Track listing
All tracks written by James Harris III and Terry Lewis, except where noted.
Personnel
Track 1 produced by Jellybean Johnson for Flyte Time Productions Inc.
Tracks 2–7 and 9–15 produced by Jimmy Jam and Terry Lewis for Flyte Time Productions Inc.
Track 8 produced by Monte Moir
Charts and certifications
Weekly charts
Certifications
Release history
References
External links
This Thing Called Love: The Greatest Hits of Alexander O'Neal at Discogs
1992 compilation albums
Alexander O'Neal albums
Tabu Records albums
Albums produced by Jimmy Jam and Terry Lewis |
Swapna Dutt Chalasani (born 30 August 1981) is an Indian film producer based in Hyderabad. She is the daughter of C. Ashwini Dutt, a well-known Indian film producer and the founder of Vyjayanthi Movies.
Swapna began her career in filmmaking at the age of 18 as an associate producer of the movie Azad (2000). Soon after her first project, Swapna co-produced movies with her father under his banner Vyjayanthi Movies with her sister Priyanka Dutt. Both Priyanka and Swapna revived Swapna Cinema in 2014. Swapna later produced Mahanati, for which she received a National Award, and later, Sita Ramam.
Early life and family
Swapna Dutt was born in Vijayawada to the most renowned producer's family in Telugu film industry. She is the eldest daughter of C. Ashwini Dutt and Vinaya Kumari. Her father is a well-known Indian film producer in the Telugu film industry and the founder of Vyjayanthi Movies. Swapna has two younger sisters: Priyanka Dutt, who co-produced movies with Swapna and her father, and Sravanthi Dutt, who is a businesswoman in the hospitality sector. On 19 December 2010, Swapna married Prasad Varma. They have a daughter, Navya Vyjayanthi.
Swapna holds an MBA degree from The University of Findlay.
Career
Television
During her business management studies at The University of Findlay, while assisting her father and taking care of the production side of the movies shooting schedules overseas, Swapna realized that she needed to do something more and had to create a path of her own in the media industry. After pursuing her MBA in 2006. she founded Vyjayanthi Televentures Pvt. Ltd. in Hyderabad, which changed the face of the television industry by producing consecutive different programs in popular Telugu channels. On 7 October 2008, the then Chief Minister of Andhra Pradesh, Y. S. Rajasekhara Reddy, launched Local TV - the much publicized small screen venture of Vyjayanthi Televentures. The event was also graced by Tollywood's doyen Akkineni Nageswara Rao.
Local TV is planning its inroads to satellite TV service. The strategy is still being worked out. Nonetheless, the audience will be in for a new avatar of TV viewing experience.
Films
Being born to a film family, Swapna was more interested in behind the camera aspect of Indian movies. She associated her father in film production in the beginning of her career and later co-produced movies with her father under his banner Vyjayanthi Movies. On 2014 Swapna launched Swapna Cinema. Under the banner, Swapna and her sister Priyanka co-produced Yevade Subramanyam, directed by Priyanka's husband Nag Ashwin. Much of the filming took place at the Everest Base Camp, becoming the first Indian film to be shot at the location. The film was both critically and commercially successful in the box office. Swapna later went on to produce the films Mahanati (2018 and Sita Ramam (2022) and has won awards for the former. Swapna is now on the pre-production works of her new untitled movie.
Filmography
Films
Television
Awards
Nandi Award for Best Feature Film - Yevade Subramanyam (2015)
Filmfare Award for Best Film - Telugu - Mahanati (2018)
SIIMA Award for Best Film - Mahanati (2018)
Zee Cine Awards Telugu - Mahanati (2018)
National Film Award for Best Feature Film in Telugu - Mahanati (2018)
References
External links
Businesspeople from Vijayawada
Telugu film producers
Indian women film producers
1981 births
Living people
Film producers from Andhra Pradesh
Businesspeople from Andhra Pradesh
Indian women television producers
Women television producers
Zee Cine Awards Telugu winners |
Crematogaster amita is a species of ant in tribe Crematogastrini. It was described by Forel in 1913.
References
amita
Insects described in 1913 |
The 2016 American Athletic Conference women's soccer tournament is the postseason women's soccer tournament for the American Athletic Conference held from November 2 to 6, 2016. The five match tournament was held at Morrone Stadium, home field of the regular season champion Connecticut Huskies in Storrs, Connecticut. The six team single-elimination tournament consists of three rounds based on seeding from regular season conference play. The Cincinnati Bearcats were the defending tournament champions, after defeating the USF Bulls in a penalty kick shootout in the championship match the previous year.
Bracket
Schedule
First round
Semifinals
Final
References
2016 American Athletic Conference Women's Soccer Championship
American Athletic Conference women's soccer tournament
American Athletic Conference Women's Soccer Tournament
American Athletic Conference Women's Soccer Tournament |
Andre Talbot (born May 3, 1978) is a former professional wide receiver and slotback who played gridiron football in the Canadian Football League. Talbot played his first nine seasons in the CFL with the Toronto Argonauts and his tenth season with the Edmonton Eskimos.
Football career
Talbot played high school football at Monsignor Paul Dwyer Catholic High School in Oshawa. He later played university football at Wilfrid Laurier University where he was a two time All-Canadian and was drafted by the Toronto Argonauts in 2001. On February 10, 2010, Talbot was traded from the Argonauts to the Eskimos along with receiver Brad Smith in exchange for defensive tackle Eric Taylor.
On March 31, 2011, Talbot announced his retirement from the CFL.
Personal life
Talbot was born in Toronto, Ontario. When he was five years old, his family moved to Woodstock, Ontario. Seven years later, Talbot's family moved to Oshawa, Ontario. Talbot also performed as lead singer for a rock band called "The Street Fever".
After his retirement from football, Talbot became a yoga instructor and is currently a co-owner of a yoga studio in Toronto called "Spirit Loft".
References
External links
ProFootballArchives stats page
Official Website
1978 births
Living people
Canadian football wide receivers
Edmonton Elks players
Franco-Ontarian people
Sportspeople from Oshawa
Canadian football people from Toronto
People from Woodstock, Ontario
Sportspeople from Oxford County, Ontario
Players of Canadian football from Ontario
Toronto Argonauts players
Wilfrid Laurier Golden Hawks football players |
USS Acme (MSO-508) was an acquired by the United States Navy for the task of removing mines that had been placed in the water to prevent the safe passage of ships.
Acme was laid down on 16 November 1954 by the Frank L. Sample Shipyard, Boothbay Harbor, Maine; launched on 23 June 1955; sponsored by Mrs. Cornelius M. Sullivan, the wife of Capt. Sullivan who was then serving as chief of staff of the 3rd Naval District; and commissioned on 27 September 1956.
First Far East deployment
Following shakedown along the U.S. East Coast, the ocean minesweeper proceeded, via the Panama Canal, to the west coast. She arrived at Long Beach, California, on 8 December and was assigned to Mine Division 73, Mine Squadron 7. After a short upkeep period, Acme got underway on 4 March 1956 for a deployment to the Far East, During this cruise, she visited Pearl Harbor, Hong Kong, and various ports in Korea, Taiwan, and Japan before returning home on 20 August.
West Coast activities
On 7 October, the vessel entered the Long Beach Naval Shipyard for extensive sound reduction repair work which was completed on 6 March 1958. She next participated in a training program as a unit of Mine Force, Pacific Fleet. In October 1958, she took part in a joint operation with the Royal Canadian Navy off the coast of British Columbia.
The ship began the year 1959 operating in the Long Beach, California area. In April, she began a three-week period of refresher training at San Diego. Next, Acme undertook a mine countermeasures refresher training program at Port Hueneme, California.
Second Far East deployment
On 17 August, she deployed to the Far East with Mine Division 73. Following stops at Pearl Harbor and Midway Island, the minesweeper arrived at Yokosuka, Japan, on 14 September. A fortnight later, she moved to Sasebo and continued to operate in Japanese and Korean waters through mid-December. She visited Fukuoka and Kure, Japan, and Pusan and Chinhae, Korea. She also participated in joint minesweeping operations with the Republic of Korea Navy at Chinhae and with the Japanese Maritime Self-Defense Force at Kure. On 17 December, Acme got underway and proceeded independently to Hong Kong, where she arrived on 22 December and rejoined other sweepers of Mine Division 73. On 30 December, the ship arrived at Subic Bay, Philippines.
After beginning 1960 in an upkeep status at Subic Bay, Acme arrived in Bangkok, Thailand, on 13 January. Following five days of liberty in Bangkok, she got underway with units of the Royal Thai Navy and conducted tactical exercises en route to Sattahip. The exercises were completed on 22 January, and Acme returned to Subic Bay on 29 January. Following a week of voyage repairs, she sailed on 8 February for her home port, Long Beach, and made brief stops at Guam, Midway Island, and Pearl Harbor before reaching California on 13 March.
West Coast activities
The ship participated in a joint United States-Canadian mine-sweeping exercise in the Long Beach area from 18 to 23 April; then began four months of availability. On 15 August, she got underway for Esquimalt, British Columbia, to rendezvous with Canadian naval forces for joint exercises which continued into September. On the 10th, Acme returned to Long Beach and, from 26 October through 6 November, took part in exercises with Canadian units off Camp Pendleton, California. Acme returned to Long Beach on 15 November and remained there through the end of the year, 1960.
The minesweeper began another overhaul on 13 January 1961. Previously, she had been chosen to test special mine countermeasures equipment; and, during this yard period, it was installed. The ship got underway on 29 May, conducted refresher training at San Diego, and returned to Long Beach early in July. For the next two months, technical and operational checks were made on Acme's experimental equipment. From 28 August to 10 September, Acme held type training. On 13 September, the ship got underway to take part in Operation Gray Fox, a mine warfare exercise held along the California coast. She finished this task on 30 September and returned to Long Beach. From 2 to 27 October, Acme was in restricted availability for installation of more equipment and put to sea on 7 November for shakedown. She returned to her home port on 22 November and spent the remainder of the year in an upkeep and leave period.
Experimental equipment operations
Acme spent the year 1962 conducting tests and operational evaluations of her new mine countermeasures equipment which took her to various points along the California coast. This routine was broken by periods of upkeep and drydocking before the vessel ended the year anchored in Long Beach.
The first two months of 1963 saw her continuing experimental work. From 2 to 23 March, she participated in "Operation Steelgate", with Canadian forces off the California coast near Camp Pendleton. After a week of liberty in San Francisco, Acme returned to Long Beach for an overhaul which was followed by three weeks of refresher training out of San Diego. Upon her return to Long Beach on 2 August, Acme took part in an operational evaluation of Seanettle, an underwater electronic system. From mid-September through 10 November, she held type training and returned to Long Beach on the 21st.
Acme got underway for type training on 6 January 1964 and spent most of February assisting in the evaluation of the Seanettle system. From 24 February to 10 March, she conducted mine countermeasures operations off Santa Rosa Island, California and then devoted the next seven weeks to a tender availability. On 27 April, she commenced training operations in the area off Huntington Beach, California, and Santa Catalina Island. Following completion of shakedown, she began alternating mine recovery operations off the California coast with periods of upkeep at Long Beach. The sweeper completed her operations on 7 December and entered a holiday leave and upkeep status.
Acme entered the Long Beach Naval Shipyard on 11 January 1965 for the installation of a new sonar system. She was underway on 8 March and sailed to the naval electronics laboratory at San Diego for tests and evaluations of her newly installed equipment. The ship returned to Long Beach on 27 May and began preparations for major yard work. On 7 June, she arrived at the Harbor Boat Building Company in Long Beach for repairs which lasted until 19 August. Then came two months of exercises. On 22 November, Acme began further evaluation of experimental equipment. In mid-December, she spent one week in mine hunting operations before returning to Long Beach on 20 December.
From mid-January until May 1966, Acme evaluated her mine hunting and surveillance system before sailing north and participating in the Portland Rose Festival in Portland, Oregon, from 8 until 13 June. The minesweeper participated as a unit of Mine Squadron 7 in a mine exercise at Santa Rosa Island from 18 to 28 July. Following a month of restricted availability at Long Beach, she took part in Exercises "Eager Angler" and "Baseline II." During November, the ship conducted type training and closed the year at Long Beach in a leave and upkeep status.
Escorting the SS Queen Mary
During the first four months of 1967, Acme was involved in various minesweeping exercises. On 1 May, she entered the Long Beach Naval Shipyard for a restricted availability during which all of her experimental equipment was removed, thus ending her research and development efforts. The availability concluded on 4 August; but the ship began a regular overhaul on 1 September at San Pedro, California. During this time, a twin 20-millimeter gun was mounted on the vessel's forecastle. She got underway on 9 December and sailed with five other minesweepers to rendezvous with the . They escorted her on her last voyage into the port of Long Beach.
Third Far East tour of duty
Acme held refresher training from 3 to 19 January 1968. On 28 January, she and 13 other minesweepers were alerted to prepare for an emergency deployment in view of the capture of by the North Koreans. By the first week of February, it became apparent that a deployment would not be necessary; and Acme began preparations for mine countermeasures refresher training and an ensuing upkeep period. On 1 April, she sailed for the western Pacific Ocean. Ten days later, she arrived at Pearl Harbor and, after two days of replenishment, got underway with units of Mine Division 94 and to participate in Operation "Barstur." On 14 April, Acme resumed her voyage west and arrived at Yokosuka, Japan, on 4 May. The vessel departed that port on 17 May, bound for Chinhae, Korea, and a joint American-Korean exercise. She returned to Sasebo on 28 May and began preparations for a deployment off the coast of Vietnam. On 6 June, Acme relieved as a barrier patrol ship. She was in turn relieved on 9 July and sailed to Singapore for an availability period. On 30 July, she sailed to Bangkok, Thailand, for a joint exercise with British and Thai naval forces. Upon arrival at Sattahip, Acme developed engineering problems. The vessel was detached from the exercise and sailed to Subic Bay for repairs. She got underway again on 2 September bound for Danang. Upon her arrival there, the engineering problems recurred, and Acme was rerouted to the Philippines. She finished the passage to Subic Bay under tow by and finally reached the American naval base on 15 September.
Acme set sail for the United States on 27 October. En route, she made port calls at Guam, Kwajalein, the Johnston Island, and Pearl Harbor; arrived at Long Beach on 3 December; and spent the rest of the year in leave and upkeep.
Stateside repairs and trials
On 13 January 1969, Acme entered drydock at Terminal Island, California, for correction of difficulties with her controllable pitch propellers. The availability was completed on 20 March, and the minesweeper began sea trials. However, repeated casualties to the propeller system required further repair work before the ship was finally ready to return to duty on 21 April. Various training exercises occupied the ship from late April through July, and mine warfare Exercise "StrikeEx 3–69" kept her busy from 15 to 27 August.
Fourth tour of duty in the Far East
Then, after two months of preparations for a deployment to the Far East, she departed for the western Pacific. She stopped briefly at Pearl Harbor, Johnston Island, and Kwajalein for minor repairs, stores, and fuel, and remained at Guam in upkeep from 2 until 8 December, before proceeding to Subic Bay. The minesweeper steamed on to the Vietnamese coast where, on 19 December 1969, she relieved and assumed "Operation Market Time" patrol duties which lasted through 11 January 1970, the day the ship put into port at Subic Bay.
After a month of leave and upkeep, Acme began her last Market Time patrol on 12 February. She remained off the coast for almost two months before returning to Subic Bay on 6 April. Acme sailed to Keelung, Taiwan, on 25 April and pushed on to Sasebo, Japan, on 4 May. From this port, Acme began her journey back to Long Beach. Pausing briefly at Pearl Harbor, Acme reached her home port on 9 June. Her next action came on 14 August, when Acme took part in Operation "High Desert" off the southern California coast. The minesweeper was back in Long Beach on 21 August.
Decommissioning
On 1 September, Acme reported to the Naval Inactive Ship Facility, Long Beach, for deactivation. She was decommissioned on 6 November 1970, and her name was struck from the Navy list on 15 May 1976. She was sold on 6 January 1977 to Oskco Edwards, of Capistrano Beach, California.
Awards
Acme received two battle stars for her Vietnam service.
References
External links
MSO 508 Acme – Navy Ships
USS Acme (MSO 508) Crew List
Acme-class minesweepers
Ships built in Boothbay Harbor, Maine
1955 ships
Vietnam War mine warfare vessels of the United States |
Jillian van Turnhout (; born 29 March 1968) is an Irish children's rights advocate and served as an independent member of Seanad Éireann from 2011 to 2016.
Politics
Van Turnhout was nominated by the Taoiseach Enda Kenny to the 24th Seanad in May 2011. She stepped down from her role as Chief Executive of the Children's Rights Alliance, and served as Leader of the Independent Group (Taoiseach Nominees), member of the Oireachtas Joint Committee on Health and Children, and Chair of the Oireachtas Children's Future Health Group until the conclusion of the 24th Seanad in April 2016.
Her areas of focus during her tenure included: initiating the ban on the corporal punishment of children; campaigning against the holding of child beauty pageants in Ireland; developing strategies to tackle online child sexual abuse material (CSAM); children in Direct Provision, transgender children; children in conflict with the law, early childhood education and care; protecting children's health from tobacco smoke; childhood obesity; housing and homelessness; neuro-rehabilitation services and end of life care, in addition to alcohol misuse, alcohol related harm and in her opposition to any alcohol industry involvement in public health campaigns, and education space.
Europe
At a European level, she was elected and employed as Secretary General of the European Coordination Bureau (ECB-BEC) from 1993 to 1996 and was based in Brussels, Belgium. In this role, she was one of the co-founders of the European Youth Forum in 1996. Van Turnhout was appointed by the Government to be a member of the European Economic and Social Committee (EESC) from 1998 to 2011. On each of the four occasions that she was appointed, she was nominated by the Community and Voluntary Pillar on behalf of the NYCI and then the Children's Rights Alliance, where she was involved in Social Affairs, External Relations and Communications.
She represented the EESC on the EU-China Round Table for six years, and on the Steering Group of the EU Forum on the Rights of the Child. Between 2006 and 2008, Van Turnhout was elected to the position of Vice President of the EESC – only the second time in the 50-year history of the organisation that an Irish person was part of the Presidency team.
Other work
Van Turnhout is involved with a number of organisations. She is Chair of Early Childhood Ireland; Chair of Children in Hospital Ireland; Vice Chair of European Movement Ireland; former board member of Women for Election; and former Chief Commissioner of the Irish Girl Guides (IGG). Van Turnhout is a former president of the National Youth Council of Ireland (NYCI); former member of the National Youth Work Advisory Committee; former member of the National Children's Advisory Council; former member of the Management Committee of the National Economic and Social Forum (NESF); and a former Council member of Gaisce – The President's Award.
Awards
She was awarded the 'Freedom of Killarney' in County Kerry in September 2010, and in the same year won the Newstalk Women Mean Business Social Entrepreneur of the Year Award for her innovative work in the Children's Rights Alliance. In 2015, Van Turnhout was awarded TV3's Tonight Show Politician of the Year.
She was also named Senator of the Year by Miriam Lord, writer and columnist with The Irish Times, who said “Van Turnhout's work in the area of child protection puts her in a select band of parliamentarians who aren't living reminders of why the Seanad should have been abolished when we had the chance.” In recognition for her work in Europe, Van Turnhout was appointed Honorary President of the Europa Society in University College Cork for 2016–2017.
Personal life
She is married to Michael van Turnhout who works in the private sector and is a member of Fine Gael. He previously served as constituency chairperson for Dublin South and is a former member of their Executive Council.
References
1968 births
Living people
Independent members of Seanad Éireann
Members of the 24th Seanad
21st-century women members of Seanad Éireann
People from Dublin (city)
Nominated members of Seanad Éireann
Alumni of Dublin Institute of Technology |
Baydarlı (also, Baydarly) is a village and municipality in the Qakh Rayon of Azerbaijan. It has a population of 368.
Notable natives
Mammad Mammadov — Hero of the Soviet Union.
References
Populated places in Qakh District |
Note: dates are given using the New Style calendar.
Sir Leonard Holliday (also spelled Hollyday and Halliday) (c. 1550 – 9 January 1612) was a founder of the East India Company, and a Lord Mayor of London.
Life
He was born, perhaps circa 1550, in Rodborough in Gloucestershire, the son of clothmaker William Halliday and his wife Sarah Brydges. At some point, perhaps in the late 1560s, he was sent to London, where he served an apprenticeship in the Worshipful Company of Merchant Taylors, which controlled the men's garment industry in the city.
In May 1578, he married an heiress: Anne, daughter of William Wincoll (or Wincott or Winhold) of Suffolk. They had three children: Rowland (born in 1579 and died in 1580), John (born in 1582 and died in 1610), and Walter (died in 1598).
Business and civic affairs
In 1592, Leonard expanded his business interests by becoming a member of the Levant Company. In 1594, he was one of fourteen members of the Merchant Taylors Company who each pledged money to support an indigent widow through one of the company's charitable schemes.
He entered local government, as an alderman, in 1594, and was also one of the city's sheriffs for 1595–96.
In September 1599, he and 124 other merchants formed 'The Governor and Merchants of the City of London Trading to the East Indies', otherwise known as the East India Company. It was chartered on 31 December 1600. While membership was open to the public (known as 'the generality'), executive control was restricted to the merchant élite, and Leonard was not only one of the original 'committees' (i.e. directors) but also joint treasurer from 1600 until 1602.
The EIC's first two trading expeditions to India were profitable and earned investors a healthy return, as well as supplying the merchants with imported merchandise to re-sell at profit. Leonard invested £1000 – the largest individual stake – in the first voyage.
Leonard was knighted by King James I on 26 July 1603. He was one of 906 men knighted by the new king during the first four months of his reign.
Lord Mayor
Sir Leonard served as Lord Mayor of London from 29 October 1605 to October 1606. His installation was celebrated with a pageant, 'The Triumphs of Reunited Britannia'. A week later, on 5 November 1605, a plot to assassinate the king by blowing up the Houses of Parliament was foiled. As Lord Mayor, Sir Leonard was responsible for maintaining public order during the trial and execution of the conspirators in January 1606. On 2 August 1606, Sir Leonard hosted the king and his brother-in-law, King Christian IV of Denmark during the latter's state visit to England.
The lasting legacy of Sir Leonard's lord mayoralty was the redevelopment of the Moorfields, a swamp just north of the city wall. In the face of great public criticism, he had the area drained and surfaced, and laid out gardens and walks. The workers found it such an unpleasant project that they coined the slang term 'Holidaye worke' to refer to hard labour.
Final years
Sir Leonard was Master of the Merchant Taylors Company for 1605–06, continued as a 'committee' of the East India Company, invested £400 in the company's third voyage and stood unsuccessfully for the EIC governorship (i.e. chairmanship) in 1609.
He died on 9 January 1612, leaving a sizeable estate. In November 1613, his widow married Sir Henry Montagu (later 1st Earl of Manchester). She died in 1619.
Coat of arms
In 1605, Sir Leonard obtained a confirmation of arms and the grant of a crest from the College of Arms. "Confirm" indicates that Sir Leonard was already using the arms, "grant" that the crest was new. The arms were: Sable, three helmets Argent garnished Or, within a bordure engrailed of the second, i.e. a black shield displaying three silver helmets with gold trimming, all within an engrailed silver border. The crest was the upper half of a gold lion, facing the viewer, holding an anchor.
References
External links
Halliday Heraldry
Year of birth uncertain
1550s births
1612 deaths
16th-century English people
Sheriffs of the City of London
17th-century lord mayors of London
Directors of the British East India Company
English knights
People from Rodborough |
František Treybal (24 December 1882 – 5 October 1947 in Prague) was a Czech chess master.
In 1907 he won the 2nd Czech Chess Championship in Brno. In 1907 he also won in Berlin, and tied for 5–6th in Prague (Oldřich Duras won). In 1908, he took 20th in Prague (Duras and Carl Schlechter won). In 1909, he took 4th in Prague (Duras won). In 1910, he tied for 1st–2nd with Ladislav Prokeš in Prague. 1913, he won in Berlin and took 2nd, behind Karel Hromádka, in the 5th Czech Championship in Jungbunzlau (Mladá Boleslav).
After World War I he played in several tournaments in Prague. In 1921, he tied for 1st–2nd with Hromádka. In 1924, he tied for 4–5th (Jan Schulz won). In 1927, he tied for 5–8th (Hromádka won). In 1929, he took 2nd, behind Salo Flohr.
He was an elder brother of Karel Treybal.
References
1882 births
1947 deaths
Czech chess players
Chess players from Austria-Hungary
Czechoslovak chess players |
Will Jason (1910–1970) was an American film and television director. He shot a number of short films for MGM during the early 1940s.
Selected filmography
The Soul of a Monster (1944)
Tahiti Nights (1944)
Eve Knew Her Apples (1945)
Ten Cents a Dance (1945)
Blonde Alibi (1946)
The Dark Horse (1946)
Idea Girl (1946)
Slightly Scandalous (1946)
Sarge Goes to College (1947)
Smart Politics (1948)
Music Man (1948)
Campus Sleuth (1948)
Rusty Leads the Way (1948)
Kazan (1949)
Everybody's Dancin' (1950)
Disc Jockey (1951)
Chain of Circumstance (1951)
Thief of Damascus (1952)
References
Bibliography
Bernard A. Drew. Motion Picture Series and Sequels: A Reference Guide. Routledge, 2013.
External links
1910 births
1970 deaths
American television directors
Film directors from New York City
Mass media people from New York City |
```hcl
variable "instance_type" {}
variable "enable" {
default = false
}
resource "aws_instance" "dependent" {
// The attribute depends on `enable` and `instance_type`
instance_type = var.enable ? var.instance_type : "t2.micro"
}
resource "aws_instance" "independent" {
// instance_type is invalid, but the attribute does not depend on the parent module aruguments
instance_type = "t1.2xlarge"
}
``` |
William John Koski (February 6, 1932 – July 12, 2014) was an American pitcher in Major League Baseball who played for the Pittsburgh Pirates. Listed at 6' 4" (1.93 m), 185 lb. (84 kg), he batted and threw right handed.
Born in Madera, California, Koski was one of the many promising young players whose career was interrupted by army service in Korean War. He starred at Modesto High School and, at age 19, pitched in 13 games for the Pirates during the 1951 season. His statistics were what you would expect from a very young pitcher relying primarily on his blazing fastball. He posted a 0-1 record and a 6.67 earned run average, allowing 23 runs (20 earned) on 26 hits and 28 walks, while striking out seven in 27.0 innings of work.
In his only starting assignment, Koski lasted 4⅓ innings against the New York Giants at Polo Grounds, giving up three earned runs on four hits and six walks, striking out two of the 23 batters he faced. The Giants won, 8–3, as he was credited with the loss.
′′T-Bone′′, as he was nicknamed, started 1952 back in the Minor Leagues, but his stuff impressed Pirates' owner Branch Rickey so much that the visionary executive tried to recall Koski to the big club early in August. Unfortunately, Koski had been drafted into the Army and needed to report for duty on August 21.
Following his discharge in 1954, Koski returned to the minors and pitched until 1957. In a seven-season career, he had a record of 39-48 with a 4.14 ERA in 138 pitching appearances.
After retiring, Koski moved to Modesto, California, where he worked as a draftsman for the Stanislaus County Planning Department. Besides, he stayed involved in amateur baseball as a coach in youth leagues and as the pitching coach at California State University, Stanislaus.
Koski died in 2014 at the age of 82.
Sources
Further reading
Dennis Snelling: A Glimpse of Fame, McFarland & Company, Jefferson N.C., 1993, pp. 5–18
1932 births
2014 deaths
Baseball players from Modesto, California
Brunswick Pirates players
Burlington-Graham Pirates players
Kinston Eagles players
Las Vegas Wranglers (baseball) players
Major League Baseball pitchers
Mayfield Clothiers players
United States Army personnel of the Korean War
Modesto Reds players
New Orleans Pelicans (baseball) players
Sportspeople from Madera, California
Baseball players from Madera County, California
Pittsburgh Pirates players
St. Jean Canadians players |
```c
/**
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
/*
* The following is auto-generated. Do not manually edit. See scripts/loops.js.
*/
#include "stdlib/ndarray/base/unary/s_t_as_i_i.h"
#include "stdlib/ndarray/base/unary/typedefs.h"
#include "stdlib/ndarray/base/unary/macros.h"
#include "stdlib/ndarray/base/unary/dispatch_object.h"
#include "stdlib/ndarray/base/unary/dispatch.h"
#include "stdlib/ndarray/ctor.h"
#include <stdint.h>
/**
* Applies a unary callback to a zero-dimensional input ndarray and assigns results to elements in a zero-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @param fcn callback
* @return status code
*
* @example
* #include "stdlib/ndarray/base/unary/s_t_as_i_i.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_INT8;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_UINT16;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0 };
* uint8_t ybuf[] = { 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 0;
*
* // Define the array shapes:
* int64_t shape[] = {};
*
* // Define the strides:
* int64_t sx[] = { 0 };
* int64_t sy[] = { 0 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Define a callback:
* static int32_t fcn( const int32_t x ) {
* return x;
* }
*
* // Apply the callback:
* int8_t status = stdlib_ndarray_s_t_as_i_i_0d( arrays, (void *)fcn );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_s_t_as_i_i_0d( struct ndarray *arrays[], void *fcn ) {
int8_t v;
int8_t status = stdlib_ndarray_iget_int8( arrays[ 0 ], 0, &v );
if ( status != 0 ) {
return -1;
}
typedef int32_t func_type( const int32_t x );
func_type *f = (func_type *)fcn;
status = stdlib_ndarray_iset_uint16( arrays[ 1 ], 0, (uint16_t)f( (int32_t)v ) );
if ( status != 0 ) {
return -1;
}
return 0;
}
/**
* Applies a unary callback to a one-dimensional input ndarray and assigns results to elements in a one-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @param fcn callback
* @return status code
*
* @example
* #include "stdlib/ndarray/base/unary/s_t_as_i_i.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_INT8;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_UINT16;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 1;
*
* // Define the array shapes:
* int64_t shape[] = { 3 };
*
* // Define the strides:
* int64_t sx[] = { 1 };
* int64_t sy[] = { 2 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Define a callback:
* static int32_t fcn( const int32_t x ) {
* return x;
* }
*
* // Apply the callback:
* int8_t status = stdlib_ndarray_s_t_as_i_i_1d( arrays, (void *)fcn );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_s_t_as_i_i_1d( struct ndarray *arrays[], void *fcn ) {
typedef int32_t func_type( const int32_t x );
func_type *f = (func_type *)fcn;
STDLIB_NDARRAY_UNARY_1D_LOOP_CLBK_ARG_CAST( int8_t, uint16_t, int32_t )
return 0;
}
/**
* Applies a unary callback to a two-dimensional input ndarray and assigns results to elements in a two-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @param fcn callback
* @return status code
*
* @example
* #include "stdlib/ndarray/base/unary/s_t_as_i_i.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_INT8;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_UINT16;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 2;
*
* // Define the array shapes:
* int64_t shape[] = { 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 2, 1 };
* int64_t sy[] = { 4, 2 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Define a callback:
* static int32_t fcn( const int32_t x ) {
* return x;
* }
*
* // Apply the callback:
* int8_t status = stdlib_ndarray_s_t_as_i_i_2d( arrays, (void *)fcn );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_s_t_as_i_i_2d( struct ndarray *arrays[], void *fcn ) {
typedef int32_t func_type( const int32_t x );
func_type *f = (func_type *)fcn;
STDLIB_NDARRAY_UNARY_2D_LOOP_CLBK_ARG_CAST( int8_t, uint16_t, int32_t )
return 0;
}
/**
* Applies a unary callback to a two-dimensional input ndarray and assigns results to elements in a two-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @param fcn callback
* @return status code
*
* @example
* #include "stdlib/ndarray/base/unary/s_t_as_i_i.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_INT8;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_UINT16;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 2;
*
* // Define the array shapes:
* int64_t shape[] = { 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 2, 1 };
* int64_t sy[] = { 4, 2 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Define a callback:
* static int32_t fcn( const int32_t x ) {
* return x;
* }
*
* // Apply the callback:
* int8_t status = stdlib_ndarray_s_t_as_i_i_2d_blocked( arrays, (void *)fcn );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_s_t_as_i_i_2d_blocked( struct ndarray *arrays[], void *fcn ) {
typedef int32_t func_type( const int32_t x );
func_type *f = (func_type *)fcn;
STDLIB_NDARRAY_UNARY_2D_BLOCKED_LOOP_CLBK_ARG_CAST( int8_t, uint16_t, int32_t )
return 0;
}
/**
* Applies a unary callback to a three-dimensional input ndarray and assigns results to elements in a three-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @param fcn callback
* @return status code
*
* @example
* #include "stdlib/ndarray/base/unary/s_t_as_i_i.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_INT8;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_UINT16;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 3;
*
* // Define the array shapes:
* int64_t shape[] = { 2, 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 4, 2, 1 };
* int64_t sy[] = { 8, 4, 2 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Define a callback:
* static int32_t fcn( const int32_t x ) {
* return x;
* }
*
* // Apply the callback:
* int8_t status = stdlib_ndarray_s_t_as_i_i_3d( arrays, (void *)fcn );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_s_t_as_i_i_3d( struct ndarray *arrays[], void *fcn ) {
typedef int32_t func_type( const int32_t x );
func_type *f = (func_type *)fcn;
STDLIB_NDARRAY_UNARY_3D_LOOP_CLBK_ARG_CAST( int8_t, uint16_t, int32_t )
return 0;
}
/**
* Applies a unary callback to a three-dimensional input ndarray and assigns results to elements in a three-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @param fcn callback
* @return status code
*
* @example
* #include "stdlib/ndarray/base/unary/s_t_as_i_i.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_INT8;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_UINT16;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 3;
*
* // Define the array shapes:
* int64_t shape[] = { 2, 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 4, 2, 1 };
* int64_t sy[] = { 8, 4, 2 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Define a callback:
* static int32_t fcn( const int32_t x ) {
* return x;
* }
*
* // Apply the callback:
* int8_t status = stdlib_ndarray_s_t_as_i_i_3d_blocked( arrays, (void *)fcn );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_s_t_as_i_i_3d_blocked( struct ndarray *arrays[], void *fcn ) {
typedef int32_t func_type( const int32_t x );
func_type *f = (func_type *)fcn;
STDLIB_NDARRAY_UNARY_3D_BLOCKED_LOOP_CLBK_ARG_CAST( int8_t, uint16_t, int32_t )
return 0;
}
/**
* Applies a unary callback to a four-dimensional input ndarray and assigns results to elements in a four-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @param fcn callback
* @return status code
*
* @example
* #include "stdlib/ndarray/base/unary/s_t_as_i_i.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_INT8;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_UINT16;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 4;
*
* // Define the array shapes:
* int64_t shape[] = { 1, 2, 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 8, 4, 2, 1 };
* int64_t sy[] = { 16, 8, 4, 2 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Define a callback:
* static int32_t fcn( const int32_t x ) {
* return x;
* }
*
* // Apply the callback:
* int8_t status = stdlib_ndarray_s_t_as_i_i_4d( arrays, (void *)fcn );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_s_t_as_i_i_4d( struct ndarray *arrays[], void *fcn ) {
typedef int32_t func_type( const int32_t x );
func_type *f = (func_type *)fcn;
STDLIB_NDARRAY_UNARY_4D_LOOP_CLBK_ARG_CAST( int8_t, uint16_t, int32_t )
return 0;
}
/**
* Applies a unary callback to a four-dimensional input ndarray and assigns results to elements in a four-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @param fcn callback
* @return status code
*
* @example
* #include "stdlib/ndarray/base/unary/s_t_as_i_i.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_INT8;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_UINT16;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 4;
*
* // Define the array shapes:
* int64_t shape[] = { 1, 2, 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 8, 4, 2, 1 };
* int64_t sy[] = { 16, 8, 4, 2 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Define a callback:
* static int32_t fcn( const int32_t x ) {
* return x;
* }
*
* // Apply the callback:
* int8_t status = stdlib_ndarray_s_t_as_i_i_4d_blocked( arrays, (void *)fcn );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_s_t_as_i_i_4d_blocked( struct ndarray *arrays[], void *fcn ) {
typedef int32_t func_type( const int32_t x );
func_type *f = (func_type *)fcn;
STDLIB_NDARRAY_UNARY_4D_BLOCKED_LOOP_CLBK_ARG_CAST( int8_t, uint16_t, int32_t )
return 0;
}
/**
* Applies a unary callback to a five-dimensional input ndarray and assigns results to elements in a five-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @param fcn callback
* @return status code
*
* @example
* #include "stdlib/ndarray/base/unary/s_t_as_i_i.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_INT8;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_UINT16;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 5;
*
* // Define the array shapes:
* int64_t shape[] = { 1, 1, 2, 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 8, 8, 4, 2, 1 };
* int64_t sy[] = { 16, 16, 8, 4, 2 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Define a callback:
* static int32_t fcn( const int32_t x ) {
* return x;
* }
*
* // Apply the callback:
* int8_t status = stdlib_ndarray_s_t_as_i_i_5d( arrays, (void *)fcn );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_s_t_as_i_i_5d( struct ndarray *arrays[], void *fcn ) {
typedef int32_t func_type( const int32_t x );
func_type *f = (func_type *)fcn;
STDLIB_NDARRAY_UNARY_5D_LOOP_CLBK_ARG_CAST( int8_t, uint16_t, int32_t )
return 0;
}
/**
* Applies a unary callback to a five-dimensional input ndarray and assigns results to elements in a five-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @param fcn callback
* @return status code
*
* @example
* #include "stdlib/ndarray/base/unary/s_t_as_i_i.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_INT8;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_UINT16;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 5;
*
* // Define the array shapes:
* int64_t shape[] = { 1, 1, 2, 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 8, 8, 4, 2, 1 };
* int64_t sy[] = { 16, 16, 8, 4, 2 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Define a callback:
* static int32_t fcn( const int32_t x ) {
* return x;
* }
*
* // Apply the callback:
* int8_t status = stdlib_ndarray_s_t_as_i_i_5d_blocked( arrays, (void *)fcn );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_s_t_as_i_i_5d_blocked( struct ndarray *arrays[], void *fcn ) {
typedef int32_t func_type( const int32_t x );
func_type *f = (func_type *)fcn;
STDLIB_NDARRAY_UNARY_5D_BLOCKED_LOOP_CLBK_ARG_CAST( int8_t, uint16_t, int32_t )
return 0;
}
/**
* Applies a unary callback to a six-dimensional input ndarray and assigns results to elements in a six-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @param fcn callback
* @return status code
*
* @example
* #include "stdlib/ndarray/base/unary/s_t_as_i_i.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_INT8;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_UINT16;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 6;
*
* // Define the array shapes:
* int64_t shape[] = { 1, 1, 1, 2, 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 8, 8, 8, 4, 2, 1 };
* int64_t sy[] = { 16, 16, 16, 8, 4, 2 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Define a callback:
* static int32_t fcn( const int32_t x ) {
* return x;
* }
*
* // Apply the callback:
* int8_t status = stdlib_ndarray_s_t_as_i_i_6d( arrays, (void *)fcn );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_s_t_as_i_i_6d( struct ndarray *arrays[], void *fcn ) {
typedef int32_t func_type( const int32_t x );
func_type *f = (func_type *)fcn;
STDLIB_NDARRAY_UNARY_6D_LOOP_CLBK_ARG_CAST( int8_t, uint16_t, int32_t )
return 0;
}
/**
* Applies a unary callback to a six-dimensional input ndarray and assigns results to elements in a six-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @param fcn callback
* @return status code
*
* @example
* #include "stdlib/ndarray/base/unary/s_t_as_i_i.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_INT8;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_UINT16;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 6;
*
* // Define the array shapes:
* int64_t shape[] = { 1, 1, 1, 2, 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 8, 8, 8, 4, 2, 1 };
* int64_t sy[] = { 16, 16, 16, 8, 4, 2 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Define a callback:
* static int32_t fcn( const int32_t x ) {
* return x;
* }
*
* // Apply the callback:
* int8_t status = stdlib_ndarray_s_t_as_i_i_6d_blocked( arrays, (void *)fcn );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_s_t_as_i_i_6d_blocked( struct ndarray *arrays[], void *fcn ) {
typedef int32_t func_type( const int32_t x );
func_type *f = (func_type *)fcn;
STDLIB_NDARRAY_UNARY_6D_BLOCKED_LOOP_CLBK_ARG_CAST( int8_t, uint16_t, int32_t )
return 0;
}
/**
* Applies a unary callback to a seven-dimensional input ndarray and assigns results to elements in a seven-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @param fcn callback
* @return status code
*
* @example
* #include "stdlib/ndarray/base/unary/s_t_as_i_i.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_INT8;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_UINT16;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 7;
*
* // Define the array shapes:
* int64_t shape[] = { 1, 1, 1, 1, 2, 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 8, 8, 8, 8, 4, 2, 1 };
* int64_t sy[] = { 16, 16, 16, 16, 8, 4, 2 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Define a callback:
* static int32_t fcn( const int32_t x ) {
* return x;
* }
*
* // Apply the callback:
* int8_t status = stdlib_ndarray_s_t_as_i_i_7d( arrays, (void *)fcn );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_s_t_as_i_i_7d( struct ndarray *arrays[], void *fcn ) {
typedef int32_t func_type( const int32_t x );
func_type *f = (func_type *)fcn;
STDLIB_NDARRAY_UNARY_7D_LOOP_CLBK_ARG_CAST( int8_t, uint16_t, int32_t )
return 0;
}
/**
* Applies a unary callback to a seven-dimensional input ndarray and assigns results to elements in a seven-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @param fcn callback
* @return status code
*
* @example
* #include "stdlib/ndarray/base/unary/s_t_as_i_i.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_INT8;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_UINT16;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 7;
*
* // Define the array shapes:
* int64_t shape[] = { 1, 1, 1, 1, 2, 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 8, 8, 8, 8, 4, 2, 1 };
* int64_t sy[] = { 16, 16, 16, 16, 8, 4, 2 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Define a callback:
* static int32_t fcn( const int32_t x ) {
* return x;
* }
*
* // Apply the callback:
* int8_t status = stdlib_ndarray_s_t_as_i_i_7d_blocked( arrays, (void *)fcn );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_s_t_as_i_i_7d_blocked( struct ndarray *arrays[], void *fcn ) {
typedef int32_t func_type( const int32_t x );
func_type *f = (func_type *)fcn;
STDLIB_NDARRAY_UNARY_7D_BLOCKED_LOOP_CLBK_ARG_CAST( int8_t, uint16_t, int32_t )
return 0;
}
/**
* Applies a unary callback to an eight-dimensional input ndarray and assigns results to elements in an eight-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @param fcn callback
* @return status code
*
* @example
* #include "stdlib/ndarray/base/unary/s_t_as_i_i.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_INT8;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_UINT16;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 8;
*
* // Define the array shapes:
* int64_t shape[] = { 1, 1, 1, 1, 1, 2, 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 8, 8, 8, 8, 8, 4, 2, 1 };
* int64_t sy[] = { 16, 16, 16, 16, 16, 8, 4, 2 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Define a callback:
* static int32_t fcn( const int32_t x ) {
* return x;
* }
*
* // Apply the callback:
* int8_t status = stdlib_ndarray_s_t_as_i_i_8d( arrays, (void *)fcn );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_s_t_as_i_i_8d( struct ndarray *arrays[], void *fcn ) {
typedef int32_t func_type( const int32_t x );
func_type *f = (func_type *)fcn;
STDLIB_NDARRAY_UNARY_8D_LOOP_CLBK_ARG_CAST( int8_t, uint16_t, int32_t )
return 0;
}
/**
* Applies a unary callback to an eight-dimensional input ndarray and assigns results to elements in an eight-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @param fcn callback
* @return status code
*
* @example
* #include "stdlib/ndarray/base/unary/s_t_as_i_i.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_INT8;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_UINT16;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 8;
*
* // Define the array shapes:
* int64_t shape[] = { 1, 1, 1, 1, 1, 2, 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 8, 8, 8, 8, 8, 4, 2, 1 };
* int64_t sy[] = { 16, 16, 16, 16, 16, 8, 4, 2 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Define a callback:
* static int32_t fcn( const int32_t x ) {
* return x;
* }
*
* // Apply the callback:
* int8_t status = stdlib_ndarray_s_t_as_i_i_8d_blocked( arrays, (void *)fcn );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_s_t_as_i_i_8d_blocked( struct ndarray *arrays[], void *fcn ) {
typedef int32_t func_type( const int32_t x );
func_type *f = (func_type *)fcn;
STDLIB_NDARRAY_UNARY_8D_BLOCKED_LOOP_CLBK_ARG_CAST( int8_t, uint16_t, int32_t )
return 0;
}
/**
* Applies a unary callback to a nine-dimensional input ndarray and assigns results to elements in a nine-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @param fcn callback
* @return status code
*
* @example
* #include "stdlib/ndarray/base/unary/s_t_as_i_i.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_INT8;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_UINT16;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 9;
*
* // Define the array shapes:
* int64_t shape[] = { 1, 1, 1, 1, 1, 1, 2, 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 8, 8, 8, 8, 8, 8, 4, 2, 1 };
* int64_t sy[] = { 16, 16, 16, 16, 16, 16, 8, 4, 2 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Define a callback:
* static int32_t fcn( const int32_t x ) {
* return x;
* }
*
* // Apply the callback:
* int8_t status = stdlib_ndarray_s_t_as_i_i_9d( arrays, (void *)fcn );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_s_t_as_i_i_9d( struct ndarray *arrays[], void *fcn ) {
typedef int32_t func_type( const int32_t x );
func_type *f = (func_type *)fcn;
STDLIB_NDARRAY_UNARY_9D_LOOP_CLBK_ARG_CAST( int8_t, uint16_t, int32_t )
return 0;
}
/**
* Applies a unary callback to a nine-dimensional input ndarray and assigns results to elements in a nine-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @param fcn callback
* @return status code
*
* @example
* #include "stdlib/ndarray/base/unary/s_t_as_i_i.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_INT8;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_UINT16;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 9;
*
* // Define the array shapes:
* int64_t shape[] = { 1, 1, 1, 1, 1, 1, 2, 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 8, 8, 8, 8, 8, 8, 4, 2, 1 };
* int64_t sy[] = { 16, 16, 16, 16, 16, 16, 8, 4, 2 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Define a callback:
* static int32_t fcn( const int32_t x ) {
* return x;
* }
*
* // Apply the callback:
* int8_t status = stdlib_ndarray_s_t_as_i_i_9d_blocked( arrays, (void *)fcn );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_s_t_as_i_i_9d_blocked( struct ndarray *arrays[], void *fcn ) {
typedef int32_t func_type( const int32_t x );
func_type *f = (func_type *)fcn;
STDLIB_NDARRAY_UNARY_9D_BLOCKED_LOOP_CLBK_ARG_CAST( int8_t, uint16_t, int32_t )
return 0;
}
/**
* Applies a unary callback to a ten-dimensional input ndarray and assigns results to elements in a ten-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @param fcn callback
* @return status code
*
* @example
* #include "stdlib/ndarray/base/unary/s_t_as_i_i.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_INT8;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_UINT16;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 10;
*
* // Define the array shapes:
* int64_t shape[] = { 1, 1, 1, 1, 1, 1, 1, 2, 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 8, 8, 8, 8, 8, 8, 8, 4, 2, 1 };
* int64_t sy[] = { 16, 16, 16, 16, 16, 16, 16, 8, 4, 2 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Define a callback:
* static int32_t fcn( const int32_t x ) {
* return x;
* }
*
* // Apply the callback:
* int8_t status = stdlib_ndarray_s_t_as_i_i_10d( arrays, (void *)fcn );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_s_t_as_i_i_10d( struct ndarray *arrays[], void *fcn ) {
typedef int32_t func_type( const int32_t x );
func_type *f = (func_type *)fcn;
STDLIB_NDARRAY_UNARY_10D_LOOP_CLBK_ARG_CAST( int8_t, uint16_t, int32_t )
return 0;
}
/**
* Applies a unary callback to a ten-dimensional input ndarray and assigns results to elements in a ten-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @param fcn callback
* @return status code
*
* @example
* #include "stdlib/ndarray/base/unary/s_t_as_i_i.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_INT8;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_UINT16;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 10;
*
* // Define the array shapes:
* int64_t shape[] = { 1, 1, 1, 1, 1, 1, 1, 2, 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 8, 8, 8, 8, 8, 8, 8, 4, 2, 1 };
* int64_t sy[] = { 16, 16, 16, 16, 16, 16, 16, 8, 4, 2 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Define a callback:
* static int32_t fcn( const int32_t x ) {
* return x;
* }
*
* // Apply the callback:
* int8_t status = stdlib_ndarray_s_t_as_i_i_10d_blocked( arrays, (void *)fcn );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_s_t_as_i_i_10d_blocked( struct ndarray *arrays[], void *fcn ) {
typedef int32_t func_type( const int32_t x );
func_type *f = (func_type *)fcn;
STDLIB_NDARRAY_UNARY_10D_BLOCKED_LOOP_CLBK_ARG_CAST( int8_t, uint16_t, int32_t )
return 0;
}
/**
* Applies a unary callback to an n-dimensional input ndarray and assigns results to elements in an n-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @param fcn callback
* @return status code
*
* @example
* #include "stdlib/ndarray/base/unary/s_t_as_i_i.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_INT8;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_UINT16;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 3;
*
* // Define the array shapes:
* int64_t shape[] = { 2, 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 4, 2, 1 };
* int64_t sy[] = { 8, 4, 2 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Define a callback:
* static int32_t fcn( const int32_t x ) {
* return x;
* }
*
* // Apply the callback:
* int8_t status = stdlib_ndarray_s_t_as_i_i_nd( arrays, (void *)fcn );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_s_t_as_i_i_nd( struct ndarray *arrays[], void *fcn ) {
typedef int32_t func_type( const int32_t x );
func_type *f = (func_type *)fcn;
STDLIB_NDARRAY_UNARY_ND_LOOP_CLBK_ARG_CAST( int8_t, uint16_t, int32_t )
return 0;
}
// Define a list of unary ndarray functions:
static ndarrayUnaryFcn functions[] = {
stdlib_ndarray_s_t_as_i_i_0d,
stdlib_ndarray_s_t_as_i_i_1d,
stdlib_ndarray_s_t_as_i_i_2d,
stdlib_ndarray_s_t_as_i_i_3d,
stdlib_ndarray_s_t_as_i_i_4d,
stdlib_ndarray_s_t_as_i_i_5d,
stdlib_ndarray_s_t_as_i_i_6d,
stdlib_ndarray_s_t_as_i_i_7d,
stdlib_ndarray_s_t_as_i_i_8d,
stdlib_ndarray_s_t_as_i_i_9d,
stdlib_ndarray_s_t_as_i_i_10d,
stdlib_ndarray_s_t_as_i_i_nd
};
// Define a list of unary ndarray functions implementing loop blocking...
static ndarrayUnaryFcn blocked_functions[] = {
stdlib_ndarray_s_t_as_i_i_2d_blocked,
stdlib_ndarray_s_t_as_i_i_3d_blocked,
stdlib_ndarray_s_t_as_i_i_4d_blocked,
stdlib_ndarray_s_t_as_i_i_5d_blocked,
stdlib_ndarray_s_t_as_i_i_6d_blocked,
stdlib_ndarray_s_t_as_i_i_7d_blocked,
stdlib_ndarray_s_t_as_i_i_8d_blocked,
stdlib_ndarray_s_t_as_i_i_9d_blocked,
stdlib_ndarray_s_t_as_i_i_10d_blocked
};
// Create a unary function dispatch object:
static const struct ndarrayUnaryDispatchObject obj = {
// Array containing unary ndarray functions:
functions,
// Number of unary ndarray functions:
12,
// Array containing unary ndarray functions using loop blocking:
blocked_functions,
// Number of unary ndarray functions using loop blocking:
9
};
/**
* Applies a unary callback to an input ndarray and assigns results to elements in an output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @param fcn callback
* @return status code
*
* @example
* #include "stdlib/ndarray/base/unary/s_t_as_i_i.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_INT8;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_UINT16;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 2;
*
* // Define the array shapes:
* int64_t shape[] = { 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 2, 1 };
* int64_t sy[] = { 4, 2 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Define a callback:
* static int32_t fcn( const int32_t x ) {
* return x;
* }
*
* // Apply the callback:
* int8_t status = stdlib_ndarray_s_t_as_i_i( arrays, (void *)fcn );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_s_t_as_i_i( struct ndarray *arrays[], void *fcn ) {
return stdlib_ndarray_unary_dispatch( &obj, arrays, fcn );
}
``` |
```xml
import React from 'react';
import { render } from '@testing-library/react-native';
import RadioButton from '../../RadioButton';
import { RadioButtonContext } from '../../RadioButton/RadioButtonGroup';
describe('RadioButton', () => {
describe('on default platform', () => {
beforeAll(() => {
jest.mock('react-native', () => {
const RN = jest.requireActual('react-native');
RN.Platform = () => ({
select: (objs: { default: object }) => objs.default,
});
return RN;
});
});
it('renders properly', () => {
const tree = render(<RadioButton value="first" />).toJSON();
expect(tree).toMatchSnapshot();
});
});
describe('on ios platform', () => {
beforeAll(() => {
jest.mock('react-native', () => {
const RN = jest.requireActual('react-native');
RN.Platform = () => ({
select: (objs: { ios: object }) => objs.ios,
});
return RN;
});
});
it('renders properly', () => {
const tree = render(<RadioButton value="first" />).toJSON();
expect(tree).toMatchSnapshot();
});
});
describe('when RadioButton is wrapped by RadioButtonContext.Provider', () => {
it('renders properly', () => {
const tree = render(
<RadioButtonContext.Provider
value={{ value: 'first', onValueChange: () => {} }}
>
<RadioButton value="first" />
</RadioButtonContext.Provider>
).toJSON();
expect(tree).toMatchSnapshot();
});
});
describe('RadioButton with custom testID', () => {
it('renders properly', () => {
const tree = render(
<RadioButton value="first" testID={'custom:testID'} />
).toJSON();
expect(tree).toMatchSnapshot();
});
});
});
``` |
```objective-c
////////////////////////////////////////////////////////////////////////////////////////////////////
//
// Project: Embedded Learning Library (ELL)
// File: TransformationTest.h (model/optimizer_test)
// Authors: Chuck Jacobs
//
////////////////////////////////////////////////////////////////////////////////////////////////////
#pragma once
//
// Transformation class tests
//
void TestTransformations();
void TestTrivialTransformation();
void TestAddMetadataToOutputTransformation();
void TestCombineNodesTransformation();
``` |
Beaver was a steamship originally owned and operated by the Hudson’s Bay Company. She was the first steamship to operate in the Pacific Northwest of North America, and made remote parts of the west coast of Canada accessible for maritime fur trading. At one point she was chartered by the Royal Navy for surveying the coastline of British Columbia. She served off the coast from 1836 until 1888, when she was wrecked.
Service
Beaver served trading posts maintained by the Hudson's Bay Company between the Columbia River and Russian America (Alaska) and played an important role in helping maintain British control in British Columbia during the Fraser Canyon Gold Rush of 1858–59. In 1862 the Royal Navy chartered her to survey and chart the coast of the Colony of British Columbia. She also provided assistance to the Royal Navy at Bute Inlet during the Chilcotin War.
Loss
A consortium that became the British Columbia Towing and Transportation Company in 1874 purchased her, and used her as a towboat until 25 July 1888. On that day an inebriated crew ran her aground on rocks in Burrard Inlet at Prospect Point in Vancouver's Stanley Park. The wreck finally sank in July 1892 when the wake of the passing steamer Yosemite struck it, but only after enterprising locals had stripped much of the wreck for souvenirs. The Vancouver Maritime Museum houses a collection of Beaver remnants including the boiler and two drive shafts for the paddle wheels, one raised in the 1960s and the other returned from a collection in Tacoma, along with the boiler. A plaque commemorates the site of the sinking. Divers surveyed the wreck in the 1960s. However, when the Underwater Archaeological Society of BC did so in the 1990s, they found she had mostly disintegrated due to rot and currents.
See also
List of ships in British Columbia
List of steamboats on the Columbia River
Steamboats of the Columbia River
William Henry McNeill
Image gallery
References
Horner, John B. (1921). Oregon: Her History, Her Great Men, Her Literature. The J.K. Gill Co.: Portland
Pethick, Derek, The SS Beaver, 1974
Victorian-era merchant ships of Canada
Merchant ships of the United States
Shipwrecks of the British Columbia coast
Stanley Park
Paddle steamers of British Columbia
Steamboats of Washington (state)
Sidewheel steamboats of Washington (state)
Maritime incidents in July 1888
Maritime incidents in 1892
Steamboats of the Columbia River
Ships built by the Blackwall Yard
1835 ships
Fur trade
Hudson's Bay Company ships |
```c
/* packet-sbc-ap.c
* Routines for SBc Application Part (SBc-AP) packet dissection
*
* Wireshark - Network traffic analyzer
* By Gerald Combs <gerald@wireshark.org>
*
* This program is free software; you can redistribute it and/or
* as published by the Free Software Foundation; either version 2
*
* 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Ref 3GPP TS 29.168
*/
#include "config.h"
#include <epan/packet.h>
#include <epan/strutil.h>
#include <epan/asn1.h>
#include <epan/sctpppids.h>
#include "packet-ber.h"
#include "packet-per.h"
#include "packet-e212.h"
#define PNAME "SBc Application Part"
#define PSNAME "SBCAP"
#define PFNAME "sbcap"
void proto_register_sbc_ap(void);
void proto_reg_handoff_sbc_ap(void);
/* The registered port number for SBc-AP is 29168.
* The registered payload protocol identifier for SBc-AP is 24.
*/
#define SBC_AP_PORT 29168
static dissector_handle_t sbc_ap_handle=NULL;
#include "packet-sbc-ap-val.h"
/* Initialize the protocol and registered fields */
static int proto_sbc_ap = -1;
#include "packet-sbc-ap-hf.c"
/* Initialize the subtree pointers */
static int ett_sbc_ap = -1;
#include "packet-sbc-ap-ett.c"
enum{
INITIATING_MESSAGE,
SUCCESSFUL_OUTCOME,
UNSUCCESSFUL_OUTCOME
};
/* Global variables */
static guint32 ProcedureCode;
static guint32 ProtocolIE_ID;
static guint32 ProtocolExtensionID;
static int global_sbc_ap_port = SBC_AP_PORT;
/* Dissector tables */
static dissector_table_t sbc_ap_ies_dissector_table;
static dissector_table_t sbc_ap_extension_dissector_table;
static dissector_table_t sbc_ap_proc_imsg_dissector_table;
static dissector_table_t sbc_ap_proc_sout_dissector_table;
static dissector_table_t sbc_ap_proc_uout_dissector_table;
static int dissect_ProtocolIEFieldValue(tvbuff_t *tvb, packet_info *pinfo, proto_tree *tree, void *);
static int dissect_ProtocolExtensionFieldExtensionValue(tvbuff_t *tvb, packet_info *pinfo, proto_tree *tree, void *);
static int dissect_InitiatingMessageValue(tvbuff_t *tvb, packet_info *pinfo, proto_tree *tree, void *);
static int dissect_SuccessfulOutcomeValue(tvbuff_t *tvb, packet_info *pinfo, proto_tree *tree, void *);
static int dissect_UnsuccessfulOutcomeValue(tvbuff_t *tvb, packet_info *pinfo, proto_tree *tree, void *);
#include "packet-sbc-ap-fn.c"
static int dissect_ProtocolIEFieldValue(tvbuff_t *tvb, packet_info *pinfo, proto_tree *tree, void *data _U_)
{
return (dissector_try_uint(sbc_ap_ies_dissector_table, ProtocolIE_ID, tvb, pinfo, tree)) ? tvb_captured_length(tvb) : 0;
}
/* Currently not used
static int dissect_ProtocolIEFieldPairFirstValue(tvbuff_t *tvb, packet_info *pinfo, proto_tree *tree, void *data _U_)
{
return (dissector_try_uint(sbc_ap_ies_p1_dissector_table, ProtocolIE_ID, tvb, pinfo, tree)) ? tvb_captured_length(tvb) : 0;
}
static int dissect_ProtocolIEFieldPairSecondValue(tvbuff_t *tvb, packet_info *pinfo, proto_tree *tree, void *data _U_)
{
return (dissector_try_uint(sbc_ap_ies_p2_dissector_table, ProtocolIE_ID, tvb, pinfo, tree)) ? tvb_captured_length(tvb) : 0;
}
*/
static int dissect_ProtocolExtensionFieldExtensionValue(tvbuff_t *tvb, packet_info *pinfo, proto_tree *tree, void *data _U_)
{
return (dissector_try_uint(sbc_ap_extension_dissector_table, ProtocolExtensionID, tvb, pinfo, tree)) ? tvb_captured_length(tvb) : 0;
}
static int dissect_InitiatingMessageValue(tvbuff_t *tvb, packet_info *pinfo, proto_tree *tree, void *data _U_)
{
return (dissector_try_uint(sbc_ap_proc_imsg_dissector_table, ProcedureCode, tvb, pinfo, tree)) ? tvb_captured_length(tvb) : 0;
}
static int dissect_SuccessfulOutcomeValue(tvbuff_t *tvb, packet_info *pinfo, proto_tree *tree, void *data _U_)
{
return (dissector_try_uint(sbc_ap_proc_sout_dissector_table, ProcedureCode, tvb, pinfo, tree)) ? tvb_captured_length(tvb) : 0;
}
static int dissect_UnsuccessfulOutcomeValue(tvbuff_t *tvb, packet_info *pinfo, proto_tree *tree, void *data _U_)
{
return (dissector_try_uint(sbc_ap_proc_uout_dissector_table, ProcedureCode, tvb, pinfo, tree)) ? tvb_captured_length(tvb) : 0;
}
static int
dissect_sbc_ap(tvbuff_t *tvb, packet_info *pinfo, proto_tree *tree, void* data _U_)
{
proto_item *sbc_ap_item = NULL;
proto_tree *sbc_ap_tree = NULL;
/* make entry in the Protocol column on summary display */
col_set_str(pinfo->cinfo, COL_PROTOCOL, PNAME);
/* create the sbc_ap protocol tree */
if (tree) {
sbc_ap_item = proto_tree_add_item(tree, proto_sbc_ap, tvb, 0, -1, ENC_NA);
sbc_ap_tree = proto_item_add_subtree(sbc_ap_item, ett_sbc_ap);
dissect_SBC_AP_PDU_PDU(tvb, pinfo, sbc_ap_tree, NULL);
}
return tvb_captured_length(tvb);
}
/*--- proto_register_sbc_ap -------------------------------------------*/
void proto_register_sbc_ap(void) {
/* List of fields */
static hf_register_info hf[] = {
#include "packet-sbc-ap-hfarr.c"
};
/* List of subtrees */
static gint *ett[] = {
&ett_sbc_ap,
#include "packet-sbc-ap-ettarr.c"
};
/* Register protocol */
proto_sbc_ap = proto_register_protocol(PNAME, PSNAME, PFNAME);
/* Register fields and subtrees */
proto_register_field_array(proto_sbc_ap, hf, array_length(hf));
proto_register_subtree_array(ett, array_length(ett));
/* Register dissector tables */
sbc_ap_ies_dissector_table = register_dissector_table("sbc_ap.ies", "SBC-AP-PROTOCOL-IES", proto_sbc_ap, FT_UINT32, BASE_DEC);
sbc_ap_extension_dissector_table = register_dissector_table("sbc_ap.extension", "SBC-AP-PROTOCOL-EXTENSION", proto_sbc_ap, FT_UINT32, BASE_DEC);
sbc_ap_proc_imsg_dissector_table = register_dissector_table("sbc_ap.proc.imsg", "SBC-AP-ELEMENTARY-PROCEDURE InitiatingMessage", proto_sbc_ap, FT_UINT32, BASE_DEC);
sbc_ap_proc_sout_dissector_table = register_dissector_table("sbc_ap.proc.sout", "SBC-AP-ELEMENTARY-PROCEDURE SuccessfulOutcome", proto_sbc_ap, FT_UINT32, BASE_DEC);
sbc_ap_proc_uout_dissector_table = register_dissector_table("sbc_ap.proc.uout", "SBC-AP-ELEMENTARY-PROCEDURE UnsuccessfulOutcome", proto_sbc_ap, FT_UINT32, BASE_DEC);
}
/*--- proto_reg_handoff_sbc_ap ---------------------------------------*/
void
proto_reg_handoff_sbc_ap(void)
{
static gboolean inited = FALSE;
static guint SctpPort;
if( !inited ) {
sbc_ap_handle = create_dissector_handle(dissect_sbc_ap, proto_sbc_ap);
dissector_add_uint("sctp.ppi", SBC_AP_PAYLOAD_PROTOCOL_ID, sbc_ap_handle);
inited = TRUE;
#include "packet-sbc-ap-dis-tab.c"
} else {
if (SctpPort != 0) {
dissector_delete_uint("sctp.port", SctpPort, sbc_ap_handle);
}
}
SctpPort = global_sbc_ap_port;
if (SctpPort != 0) {
dissector_add_uint("sctp.port", SctpPort, sbc_ap_handle);
}
}
``` |
```java
package com.fishercoder.solutions.secondthousand;
public class _1034 {
public static class Solution1 {
/**
* My completely original solution.
*/
int[] dirs = new int[]{0, 1, 0, -1, 0};
public int[][] colorBorder(int[][] grid, int row, int col, int color) {
int m = grid.length;
int n = grid[0].length;
boolean[][] visited = new boolean[m][n];
visited[row][col] = true;
//copy the input as the final output so that we keep the input intact during dfs, otherwise, it'll lead to incorrect result like in test case 3
int[][] result = new int[m][n];
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
result[i][j] = grid[i][j];
}
}
return dfs(grid, row, col, color, m, n, grid[row][col], visited, result);
}
private int[][] dfs(int[][] grid, int row, int col, int color, int m, int n, int originalColor, boolean[][] visited, int[][] result) {
if (row == 0 || col == 0 || row == m - 1 || col == n - 1 || neighborDiffColor(row, col, grid, originalColor, m, n)) {
result[row][col] = color;
}
for (int i = 0; i < dirs.length - 1; i++) {
int nextRow = dirs[i] + row;
int nextCol = dirs[i + 1] + col;
if (nextRow >= 0 && nextRow < m && nextCol >= 0 && nextCol < n && grid[nextRow][nextCol] == originalColor && !visited[nextRow][nextCol]) {
visited[nextRow][nextCol] = true;
dfs(grid, nextRow, nextCol, color, m, n, originalColor, visited, result);
}
}
return result;
}
private boolean neighborDiffColor(int row, int col, int[][] grid, int originalColor, int m, int n) {
//if any of the four neighbors has a different color, we consider this cell as a boarding cell as well as it's a boarder to this connected component
for (int i = 0; i < dirs.length - 1; i++) {
int nextRow = row + dirs[i];
int nextCol = col + dirs[i + 1];
if (nextRow >= 0 && nextCol >= 0 && nextRow < m && nextCol < n && grid[nextRow][nextCol] != originalColor) {
return true;
}
}
return false;
}
}
}
``` |
Alexander Crowther is a Canadian actor. He is most noted for his performance as Aaron Warner in the 2020 film Flowers of the Field, for which he received a Vancouver Film Critics Circle Award nomination for Best Actor in a Canadian Film at the Vancouver Film Critics Circle Awards 2020.
He previously had a recurring role as Johan Fehr in the television series Pure, and has had guest appearances in the television series Reign, The Girlfriend Experience, Departure and Frankie Drake Mysteries, and the films Paradise Falls, American Hangman and Georgetown. In January 2020 he starred in a stage production of Ödön von Horváth's Casimir and Caroline for The Howland Company, for which the cast were collectively nominated for Outstanding Performance by an Ensemble at the 2020 Dora Mavor Moore Awards.
References
External links
21st-century Canadian male actors
Canadian male film actors
Canadian male stage actors
Canadian male television actors
Living people
Year of birth missing (living people) |
Fieldton is an unincorporated community in Lamb County, Texas, United States. Fieldton has a post office with the ZIP code 79326.
Geography
Fieldton lies on the high plains of the Llano Estacado in eastern Lamb County at the intersection of Farm to Market roads 37 and 1072, just to the north of Blackwater Draw, a dry tributary of the Double Mountain Fork Brazos River. The community is located northeast of Littlefield, southwest of Olton, and northwest of Lubbock, Texas.
Basic facts
Elevation: 3,579′,
Population: 126 (2000)
See also
Blackwater Draw
Yellow House Canyon
Llano Estacado
West Texas
References
External links
Unincorporated communities in Lamb County, Texas
Unincorporated communities in Texas |
```css
* {
box-sizing: border-box;
}
body {
font-family: 'Work Sans', sans-serif;
font-display: swap;
font-size: 18px;
color: #212121;
background-color: #fff;
text-rendering: optimizeLegibility;
-webkit-font-smoothing: antialiased;
-moz-osx-font-smoothing: grayscale;
}
h1,
h2 {
font-family: 'Varela Round';
}
h1 {
font-size: 4rem;
margin-bottom: 2rem;
}
h2 {
font-size: 2rem;
margin: 2rem 0 1rem 0;
}
a {
text-decoration: none;
}
em {
font-style: italic;
}
.placeholder {
font-family: sans-serif;
text-align: justify;
pointer-events: none;
user-select: none;
max-width: 740px;
margin: 24px auto;
}
.placeholder__word {
color: #eee;
background: #eee;
border-radius: 3px;
letter-spacing: 0.2rem;
font-size: 0.9rem;
}
.header,
.footer {
overflow: hidden;
position: relative;
display: flex;
flex-direction: column;
padding: 92px 24px;
text-align: center;
color: #fff;
background: #00ab6c;
background: linear-gradient(to bottom, #00ab6c 0%, #13cc69 100%);
align-items: center;
justify-content: center;
}
.header::before {
content: '';
position: absolute;
top: calc(100% - 16px);
left: 0;
right: 0;
background-color: rgba(255, 255, 255, 0.3);
height: 92px;
transform: skewY(2deg);
}
.header::after {
content: '';
position: absolute;
top: calc(100% - 16px);
width: 100%;
background-color: rgba(255, 255, 255, 0.5);
height: 92px;
transform: skewY(-4deg);
}
.header__title {
font-size: 4rem;
margin-bottom: 2rem;
}
.header__subtitle {
font-size: 1.4rem;
line-height: 1.5rem;
letter-spacing: -0.02rem;
color: rgba(255, 255, 255, 0.95);
}
.header__info {
font-size: 1rem;
margin: 2rem;
}
.footer__copyright {
margin: 2rem 0;
color: rgba(255, 255, 255, 0.95);
}
.footer a {
color: #fff;
}
.container {
width: 100%;
max-width: 1000px;
margin: 48px auto;
padding: 16px;
}
.container p {
line-height: 1.6;
}
.text-center {
text-align: center;
}
button.button,
.button {
display: inline-block;
margin: 4px;
padding: 16px 32px;
transition: all 0.16s;
font: inherit;
cursor: pointer;
outline: none;
font-weight: bold;
border: none;
border-radius: 32px;
font-size: 1rem;
color: #fff;
background: #00ab6c;
background: linear-gradient(#13cc69 0%, #00ab6c 100%);
box-shadow: 0 2px 6px 0 rgba(0, 171, 108, 0.32);
transition: all 300ms;
}
.button:hover,
button.button:hover {
box-shadow: 0 2px 8px 0 rgba(0, 171, 108, 0.64);
}
.button.button--action {
background: #7c4dff;
background: linear-gradient(#7c4dff 0%, #6200ea 100%);
box-shadow: 0 2px 6px 0 rgba(98, 0, 234, 0.32);
}
.button.button--action:hover {
box-shadow: 0 2px 8px 0 rgba(98, 0, 234, 0.64);
}
.header .button,
.footer .button {
color: #fff;
border: 2px solid #fff;
background: transparent;
}
.header .button:hover,
.footer .button:hover {
color: #00ab6c;
background-color: #fff;
}
img {
max-width: 100%;
height: auto;
}
figure {
margin: 3rem -16px;
text-align: center;
}
figcaption {
font-size: 1rem;
font-weight: 300;
margin: 1rem;
text-align: center;
line-height: 1.5rem;
color: #666;
}
blockquote {
display: block;
padding: 24px;
color: #666;
border-radius: 4px;
background-color: #f7f7f7;
}
blockquote li {
padding-top: 16px;
}
blockquote li::before {
content: ' ';
}
pre {
font-family: Monaco, Consolas, Menlo, monospace;
font-size: 1rem;
padding: 24px;
margin: 2rem 0;
color: #fff;
border-radius: 4px;
background-color: #222;
}
@media (min-width: 1000px) {
.pull-left,
.pull-right {
width: 400px;
margin: 3rem;
}
.pull-right {
float: right;
margin-right: -16px;
}
.pull-left {
float: left;
margin-left: -16px;
}
}
``` |
```javascript
'use strict';
const { EMPTY_BUFFER } = require('./constants');
/**
* Merges an array of buffers into a new buffer.
*
* @param {Buffer[]} list The array of buffers to concat
* @param {Number} totalLength The total length of buffers in the list
* @return {Buffer} The resulting buffer
* @public
*/
function concat(list, totalLength) {
if (list.length === 0) return EMPTY_BUFFER;
if (list.length === 1) return list[0];
const target = Buffer.allocUnsafe(totalLength);
var offset = 0;
for (var i = 0; i < list.length; i++) {
const buf = list[i];
buf.copy(target, offset);
offset += buf.length;
}
return target;
}
/**
* Masks a buffer using the given mask.
*
* @param {Buffer} source The buffer to mask
* @param {Buffer} mask The mask to use
* @param {Buffer} output The buffer where to store the result
* @param {Number} offset The offset at which to start writing
* @param {Number} length The number of bytes to mask.
* @public
*/
function _mask(source, mask, output, offset, length) {
for (var i = 0; i < length; i++) {
output[offset + i] = source[i] ^ mask[i & 3];
}
}
/**
* Unmasks a buffer using the given mask.
*
* @param {Buffer} buffer The buffer to unmask
* @param {Buffer} mask The mask to use
* @public
*/
function _unmask(buffer, mask) {
// Required until path_to_url is resolved.
const length = buffer.length;
for (var i = 0; i < length; i++) {
buffer[i] ^= mask[i & 3];
}
}
/**
* Converts a buffer to an `ArrayBuffer`.
*
* @param {Buffer} buf The buffer to convert
* @return {ArrayBuffer} Converted buffer
* @public
*/
function toArrayBuffer(buf) {
if (buf.byteLength === buf.buffer.byteLength) {
return buf.buffer;
}
return buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);
}
/**
* Converts `data` to a `Buffer`.
*
* @param {*} data The data to convert
* @return {Buffer} The buffer
* @throws {TypeError}
* @public
*/
function toBuffer(data) {
toBuffer.readOnly = true;
if (Buffer.isBuffer(data)) return data;
var buf;
if (data instanceof ArrayBuffer) {
buf = Buffer.from(data);
} else if (ArrayBuffer.isView(data)) {
buf = viewToBuffer(data);
} else {
buf = Buffer.from(data);
toBuffer.readOnly = false;
}
return buf;
}
/**
* Converts an `ArrayBuffer` view into a buffer.
*
* @param {(DataView|TypedArray)} view The view to convert
* @return {Buffer} Converted view
* @private
*/
function viewToBuffer(view) {
const buf = Buffer.from(view.buffer);
if (view.byteLength !== view.buffer.byteLength) {
return buf.slice(view.byteOffset, view.byteOffset + view.byteLength);
}
return buf;
}
try {
const bufferUtil = require('bufferutil');
const bu = bufferUtil.BufferUtil || bufferUtil;
module.exports = {
concat,
mask(source, mask, output, offset, length) {
if (length < 48) _mask(source, mask, output, offset, length);
else bu.mask(source, mask, output, offset, length);
},
toArrayBuffer,
toBuffer,
unmask(buffer, mask) {
if (buffer.length < 32) _unmask(buffer, mask);
else bu.unmask(buffer, mask);
}
};
} catch (e) /* istanbul ignore next */ {
module.exports = {
concat,
mask: _mask,
toArrayBuffer,
toBuffer,
unmask: _unmask
};
}
``` |
```c++
#include <vespa/vespalib/testkit/test_kit.h>
#include <vespa/searchlib/common/indexmetainfo.h>
using search::IndexMetaInfo;
using Snap = IndexMetaInfo::Snapshot;
TEST("indexmetainfo_test") {
{ // load pregenerated file
IndexMetaInfo info(TEST_PATH(""));
EXPECT_TRUE(info.load());
ASSERT_TRUE(info.snapshots().size() == 4);
EXPECT_TRUE(info.snapshots()[0].valid);
EXPECT_TRUE(info.snapshots()[0].syncToken == 50);
EXPECT_TRUE(info.snapshots()[0].dirName == "foo");
EXPECT_TRUE(!info.snapshots()[1].valid);
EXPECT_TRUE(info.snapshots()[1].syncToken == 100);
EXPECT_TRUE(info.snapshots()[1].dirName == "bar");
EXPECT_TRUE(info.snapshots()[2].valid);
EXPECT_TRUE(info.snapshots()[2].syncToken == 200);
EXPECT_TRUE(info.snapshots()[2].dirName == "baz");
EXPECT_TRUE(!info.snapshots()[3].valid);
EXPECT_TRUE(info.snapshots()[3].syncToken == 500);
EXPECT_TRUE(info.snapshots()[3].dirName == "last");
{
Snap s = info.getBestSnapshot();
EXPECT_TRUE(s.valid);
EXPECT_TRUE(s.syncToken == 200);
EXPECT_TRUE(s.dirName == "baz");
}
{
Snap s = info.getSnapshot(100);
EXPECT_TRUE(!s.valid);
EXPECT_TRUE(s.syncToken == 100);
EXPECT_TRUE(s.dirName == "bar");
}
{
Snap s = info.getSnapshot(666);
EXPECT_TRUE(!s.valid);
EXPECT_TRUE(s.syncToken == 0);
EXPECT_TRUE(s.dirName == "");
}
{
EXPECT_TRUE(info.invalidateSnapshot(200));
Snap s = info.getBestSnapshot();
EXPECT_TRUE(s.valid);
EXPECT_TRUE(s.syncToken == 50);
EXPECT_TRUE(s.dirName == "foo");
}
{
EXPECT_TRUE(info.invalidateSnapshot(50));
Snap s = info.getBestSnapshot();
EXPECT_TRUE(!s.valid);
EXPECT_TRUE(s.syncToken == 0);
EXPECT_TRUE(s.dirName == "");
}
{
EXPECT_TRUE(info.validateSnapshot(500));
Snap s = info.getBestSnapshot();
EXPECT_TRUE(s.valid);
EXPECT_TRUE(s.syncToken == 500);
EXPECT_TRUE(s.dirName == "last");
}
{
EXPECT_TRUE(!info.invalidateSnapshot(666));
EXPECT_TRUE(!info.validateSnapshot(666));
}
{
info.clear();
EXPECT_TRUE(info.snapshots().size() == 0);
Snap s = info.getBestSnapshot();
EXPECT_TRUE(!s.valid);
EXPECT_TRUE(s.syncToken == 0);
EXPECT_TRUE(s.dirName == "");
}
}
{ // load file that does not exist
IndexMetaInfo info(".");
EXPECT_TRUE(!info.load("file-not-present.txt"));
}
{ // load files with errors should fail
IndexMetaInfo info(TEST_PATH(""));
EXPECT_TRUE(!info.load("bogus1.txt"));
EXPECT_TRUE(!info.load("bogus2.txt"));
EXPECT_TRUE(!info.load("bogus3.txt"));
EXPECT_TRUE(!info.load("bogus4.txt"));
EXPECT_TRUE(!info.load("bogus5.txt"));
EXPECT_TRUE(!info.load("bogus6.txt"));
EXPECT_TRUE(!info.load("bogus7.txt"));
EXPECT_TRUE(!info.load("bogus8.txt"));
EXPECT_TRUE(!info.load("bogus9.txt"));
EXPECT_TRUE(!info.load("bogus10.txt"));
}
{ // save/load/save/load/save/load test
std::string file("test-save.txt");
IndexMetaInfo a(".");
IndexMetaInfo b(".");
EXPECT_TRUE(a.addSnapshot(Snap(true, 50, "foo")));
EXPECT_TRUE(a.addSnapshot(Snap(false, 100, "bar")));
EXPECT_TRUE(!a.addSnapshot(Snap(false, 100, "bar")));
EXPECT_TRUE(a.save(file));
EXPECT_TRUE(b.load(file));
ASSERT_TRUE(b.snapshots().size() == 2);
EXPECT_TRUE(b.snapshots()[0] == Snap(true, 50, "foo"));
EXPECT_TRUE(b.snapshots()[1] == Snap(false, 100, "bar"));
EXPECT_TRUE(a.save(file));
EXPECT_TRUE(b.load(file));
ASSERT_TRUE(b.snapshots().size() == 2);
EXPECT_TRUE(b.snapshots()[0] == Snap(true, 50, "foo"));
EXPECT_TRUE(b.snapshots()[1] == Snap(false, 100, "bar"));
a.removeSnapshot(100);
EXPECT_TRUE(a.save(file));
EXPECT_TRUE(b.load(file));
ASSERT_TRUE(b.snapshots().size() == 1);
EXPECT_TRUE(b.snapshots()[0] == Snap(true, 50, "foo"));
}
}
TEST_MAIN() { TEST_RUN_ALL(); }
``` |
Waposite Lake is a body of water in the Broadback River watershed in the Eeyou Istchee James Bay (municipality) area in the Nord-du-Québec, in the province of Quebec, in Canada. This lake is part of the territory of Assinica Wildlife Sanctuary and Turgis Township.
Forestry is the main economic activity of the sector. Recreational tourism activities come second.
The nearest forest road is located at south-east of the lake, the road skirting Mount Opémisca from the north; this road joins towards the south the route 113 (connecting Lebel-sur-Quévillon and Chibougamau) and the Canadian National Railway.
The surface of Waposite Lake is usually frozen from early November to mid-May, however, safe ice movement is generally from mid-November to mid-April.
Geography
Toponymy
In the past, this water body was called "Wasawapositeo Lake".
The toponym "Lac Waposite" was formalized on December 5, 1968, by the Commission de toponymie du Québec, when it was created.
Notes and references
See also
Eeyou Istchee James Bay
Lakes of Nord-du-Québec
LWaposite |
Elizaville is an unincorporated community in Clinton Township, Boone County, in the U.S. state of Indiana.
History
A post office was established at Elizaville in 1855, and remained in operation until it was discontinued in 1907. The Elizaville Church was used for a scene in the 1986 film Hoosiers.
Geography
Elizaville is located at .
References
External links
Unincorporated communities in Boone County, Indiana
Unincorporated communities in Indiana |
The 1907–08 Trinity Blue and White's basketball team represented Trinity College (later renamed Duke University) during the 1907-08 men's college basketball season. The head coach was Wilbur Wade Card and the team finished with an overall record of 2–3.
Schedule
|-
References
Duke Blue Devils men's basketball seasons
Duke
1907 in sports in North Carolina
1908 in sports in North Carolina |
Sehnsucht is the tenth album by the German gothic rock duo Lacrimosa, released on 8 May 2009. Singer and producer Tilo Wolff wanted to create an album that was less conceptual and more spontaneous than the previous releases by Lacrimosa. Therefore, Sehnsucht features a great variability of musical expressions like a sarcastic track "Feuer" and the tender song "Call Me With The Voice Of Love". The planned release of a vinyl format album was cancelled shortly before the final release of Sehnsucht.
Reception
In a positive review the German Sonic Seducer magazine lauded the freshness of the songs as well as singer Anne Nurmi's facetted and self-confident vocals, while the Side-Line magazine did not discover much new material in the album and compared the sound of "I Lost My Star in Krasnodar" to Rammstein. However, the author awarded five out of six points. The laut.de online magazine complained about the lack of quality in Wolff's singing and about weak lyrics but at the same time made very positive statements about his skills in arranging classical elements, Hard rock and Metal.
Track listing
Special edition
There is also a "Special edition", released at the same time, with the same tracks but re-recorded with slight variations.
The special version is also the first Lacrimosa album with a full color cover (The Echoes digipak had a sepia cover).
Charts
References
2009 albums
Lacrimosa (band) albums |
Maia Pearl Szalavitz (born March 29, 1965) is an American reporter and author who focuses on science, public policy and addiction treatment.
Early life and education
Maia Szalavitz was born March 29, 1965. She was raised in upstate New York. She graduated from Monroe-Woodbury High School in 1983 and attended Columbia University. She graduated cum laude from Brooklyn College.
Szalavitz was addicted to cocaine and heroin in her late teens and early twenties, an experience that has informed her writing on addiction.
Career
Szalavitz is best known as the author of Help at Any Cost: How the Troubled-Teen Industry Cons Parents and Hurts Kids, a 2006 exposé documenting abuse in the insufficiently regulated troubled teen industry. She has written many other books including Born for Love: Why Empathy is Essential – and Endangered (Morrow, 2010) and The Boy Who Was Raised as a Dog (Basic, 2006), both coauthored with Dr. Bruce D. Perry; and co-authored Recovery Options: The Complete Guide with Dr. Joseph Volpicelli.
Paul Raeburn at Knight Science Journalism at MIT called her "...the best writer I know of on addiction and related issues."
Szalavitz blogs for the Huffington Post and has written for the New York Times, the Washington Post, Newsday, New York magazine, New Scientist, Newsweek, Elle, Salon, Redbook and other major publications. She has also worked in television – first as Associate Producer and then Segment Producer for the PBS Charlie Rose Show, then on several documentaries including a Barbara Walters' AIDS special for ABC, and as Series Researcher and Associate Producer for the PBS documentary series Moyers on Addiction: Close to Home.
Szalavitz is an investigative reporter for Time magazine, and since 2004 has been a senior fellow at George Mason University's media watchdog group Statistical Assessment Service.
In 2009, Szalavitz partnered with Brent W. Jeffs and released Lost Boy, a biography of Jeffs' life in the Fundamentalist Church of Jesus Christ of Latter Day Saints.
In March 2016, her book Unbroken Brain: A Revolutionary New Way of Understanding Addiction was published by St. Martin's Press. Szalavitz was a 2015 Soros Media fellow, which supported her in writing this book.<ref>Maia Szalavitz, Open Society Institute. Retrieved 17 September 2016.</ref>
In 2021 she published a history of the harm reduction movement, Undoing Drugs : the Untold Story of Harm Reduction and the Future of Addiction.
Awards and honors
She has been awarded the American Psychological Association's Division 50 Award for Contributions to the Addictions, the Media Award from the American College of Neuropsychopharmacology and the Drug Policy Alliance's 2005 Edward M. Brecher Award for Achievement.
Books
With Joseph Volpicelli. Recovery Options: The Complete Guide. Wiley, New York, 2000.Help at Any Cost: How the Troubled-Teen Industry Cons Parents and Hurts Kids. Riverhead, New York, 2006.
With Bruce D. Perry. The Boy Who Was Raised As a Dog: and Other Stories From a Child Psychiatrist's Notebook. BasicBooks, New York, 2007.
With Bruce D. Perry. Born for Love: Why empathy is essential -- and endangered. William Morrow, New York, 2011.
With Brent W. Jeffs. Lost Boy. Broadway Books, New York, 2009.Unbroken Brain : A Revolutionary New Way of Understanding Addiction. St. Martin's Press, New York, 2016Undoing Drugs : the Untold Story of Harm Reduction and the Future of Addiction.'' Hachette Go, New York, 2021.
References
External links
'Help At Any Cost'
1965 births
Living people
American non-fiction writers
American women writers
American women journalists
Journalists from New York City
Writers on addiction
Brooklyn College alumni
21st-century American women |
Lara Arruabarrena and Tatjana Maria were the reigning champions, but chose not to participate.
Choi Ji-hee and Han Na-lae won the title, defeating Valentini Grammatikopoulou and Réka Luca Jani in the final, 6–4, 6–4.
Seeds
Draw
Draw
References
Main Draw
Korea Open - Doubles
2021 Doubles |
```javascript
Using the double tilde `~~`
Infinity
Avoid using `with`
Detect an error type
Detect **DO NOT TRACK** status
``` |
```objective-c
//===- MsgPackReader.h - Simple MsgPack reader ------------------*- C++ -*-===//
//
// See path_to_url for license information.
//
//===your_sha256_hash------===//
///
/// \file
/// This is a MessagePack reader.
///
/// See path_to_url for the full
/// standard.
///
/// Typical usage:
/// \code
/// StringRef input = GetInput();
/// msgpack::Reader MPReader(input);
/// msgpack::Object Obj;
///
/// while (MPReader.read(Obj)) {
/// switch (Obj.Kind) {
/// case msgpack::Type::Int:
// // Use Obj.Int
/// break;
/// // ...
/// }
/// }
/// \endcode
///
//===your_sha256_hash------===//
#ifndef LLVM_BINARYFORMAT_MSGPACKREADER_H
#define LLVM_BINARYFORMAT_MSGPACKREADER_H
#include "llvm/Support/Error.h"
#include "llvm/Support/MemoryBufferRef.h"
#include <cstdint>
namespace llvm {
namespace msgpack {
/// MessagePack types as defined in the standard, with the exception of Integer
/// being divided into a signed Int and unsigned UInt variant in order to map
/// directly to C++ types.
///
/// The types map onto corresponding union members of the \c Object struct.
enum class Type : uint8_t {
Int,
UInt,
Nil,
Boolean,
Float,
String,
Binary,
Array,
Map,
Extension,
Empty, // Used by MsgPackDocument to represent an empty node
};
/// Extension types are composed of a user-defined type ID and an uninterpreted
/// sequence of bytes.
struct ExtensionType {
/// User-defined extension type.
int8_t Type;
/// Raw bytes of the extension object.
StringRef Bytes;
};
/// MessagePack object, represented as a tagged union of C++ types.
///
/// All types except \c Type::Nil (which has only one value, and so is
/// completely represented by the \c Kind itself) map to a exactly one union
/// member.
struct Object {
Type Kind;
union {
/// Value for \c Type::Int.
int64_t Int;
/// Value for \c Type::Uint.
uint64_t UInt;
/// Value for \c Type::Boolean.
bool Bool;
/// Value for \c Type::Float.
double Float;
/// Value for \c Type::String and \c Type::Binary.
StringRef Raw;
/// Value for \c Type::Array and \c Type::Map.
size_t Length;
/// Value for \c Type::Extension.
ExtensionType Extension;
};
Object() : Kind(Type::Int), Int(0) {}
};
/// Reads MessagePack objects from memory, one at a time.
class Reader {
public:
/// Construct a reader, keeping a reference to the \p InputBuffer.
Reader(MemoryBufferRef InputBuffer);
/// Construct a reader, keeping a reference to the \p Input.
Reader(StringRef Input);
Reader(const Reader &) = delete;
Reader &operator=(const Reader &) = delete;
/// Read one object from the input buffer, advancing past it.
///
/// The \p Obj is updated with the kind of the object read, and the
/// corresponding union member is updated.
///
/// For the collection objects (Array and Map), only the length is read, and
/// the caller must make and additional \c N calls (in the case of Array) or
/// \c N*2 calls (in the case of Map) to \c Read to retrieve the collection
/// elements.
///
/// \param [out] Obj filled with next object on success.
///
/// \returns true when object successfully read, false when at end of
/// input (and so \p Obj was not updated), otherwise an error.
Expected<bool> read(Object &Obj);
private:
MemoryBufferRef InputBuffer;
StringRef::iterator Current;
StringRef::iterator End;
size_t remainingSpace() {
// The rest of the code maintains the invariant that End >= Current, so
// that this cast is always defined behavior.
return static_cast<size_t>(End - Current);
}
template <class T> Expected<bool> readRaw(Object &Obj);
template <class T> Expected<bool> readInt(Object &Obj);
template <class T> Expected<bool> readUInt(Object &Obj);
template <class T> Expected<bool> readLength(Object &Obj);
template <class T> Expected<bool> readExt(Object &Obj);
Expected<bool> createRaw(Object &Obj, uint32_t Size);
Expected<bool> createExt(Object &Obj, uint32_t Size);
};
} // end namespace msgpack
} // end namespace llvm
#endif // LLVM_BINARYFORMAT_MSGPACKREADER_H
``` |
```smalltalk
using System;
using System.Collections.Generic;
using System.Collections.Specialized;
using System.Linq;
using System.Net;
using System.Text;
namespace LaserGRBL
{
public class Telegram
{
public static void NotifyEvent(string message)
{
if (Settings.GetObject("TelegramNotification.Enabled", false))
NotifyEvent(Tools.Protector.Decrypt(Settings.GetObject("TelegramNotification.Code", ""), ""), message);
}
public static void NotifyEvent(string usercode, string message)
{
if (UrlManager.TelegramHandler is null)
return;
if (UrlManager.TelegramServiceKey is null)
return;
if (string.IsNullOrEmpty(usercode) || usercode.Trim().Length != 10)
return;
usercode = usercode.Trim();
NameValueCollection postData = new NameValueCollection()
{
{ "servicekey", UrlManager.TelegramServiceKey },
{ "id", usercode },
{ "message", message },
{ "guid", UsageStats.GetID() },
};
System.Threading.ThreadPool.QueueUserWorkItem(new System.Threading.WaitCallback(InternalNotifyEvent), postData);
}
private static void InternalNotifyEvent(object data)
{
try
{
NameValueCollection postData = data as NameValueCollection;
using (MyWebClient client = new MyWebClient())
{
// client.UploadValues returns page's source as byte array (byte[]) so it must be transformed into a string
string json = System.Text.Encoding.UTF8.GetString(client.UploadValues(UrlManager.TelegramHandler, postData));
//UsageStatsRV RV = Tools.JSONParser.FromJson<UsageStatsRV>(json);
//mManager.SetMessages(RV.Messages);
//return (RV.Success);
}
}
catch (Exception ex) { }
}
private class MyWebClient : WebClient
{
protected override WebRequest GetWebRequest(Uri uri)
{
WebRequest w = base.GetWebRequest(uri);
w.Timeout = 5000; //milliseconds
return w;
}
}
}
}
``` |
```python
# flake8: noqa: F401
r"""Quantized Reference Modules.
This module is in the process of migration to
`torch/ao/nn/quantized/reference`, and is kept here for
compatibility while the migration process is ongoing.
If you are adding a new entry/functionality, please, add it to the
appropriate file under the `torch/ao/nn/quantized/reference`,
while adding an import statement here.
"""
from torch.ao.nn.quantized.reference.modules.utils import (
_get_weight_qparam_keys,
_quantize_and_dequantize_weight,
_quantize_weight,
_save_weight_qparams,
ReferenceQuantizedModule,
)
``` |
Xinjiangwancheng (), is a Shanghai Metro station located on Line 10 in Yangpu District, Shanghai. Located at the intersection of Songhu Road and Yinhang Road, it is named after the nearby residential community of New Jiangwan City, which was built on the former Jiangwan Airport lands. It opened with the rest of the first phase of Line 10 on April 10, 2010. It served as the northern terminus of the line until 26 December 2020, when phase two of Line 10 opened, extending the line further north to station.
Station layout
The station has three tracks, with four platforms on two islands. The central track is used for short-turn trains which terminate at Xinjiangwancheng station or westbound trains towards Hangzhong Road, while the tracks on either side of the station are used for through trains. Prior to the opening of phase 2 of Line 10, all trains used the central track and the southbound platform.
References
Shanghai Metro stations in Yangpu District
Railway stations in China opened in 2010
Line 10, Shanghai Metro |
```html
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<meta http-equiv="X-UA-Compatible" content="IE=edge"/>
<meta http-equiv="origin-trial"
content="AhQB+uNRI7lww30oPK+0ZcGotIvuoHJL+NkkWOhqDdooY6+xnuiYmZli2SwlH1vkrKdB5WxMpsv5KRc/your_sha256_hashyour_sha256_hashIjoxNzA5ODU1OTk5LCJpc1N1YmRvbWFpbiI6dHJ1ZX0=">
<meta name="viewport" content="width=device-width, initial-scale=1.0"/>
<title>Jessica demo</title>
<link rel="stylesheet" href="./demo.css">
<script src="./vconsole.js"></script>
<script src="./js/jessibuca-pro-demo.js"></script>
<style>
.container-shell:before {
content: "jessibuca pro demo player";
}
</style>
</head>
<body class="page">
<div class="root">
<div class="container-shell">
<div id="container"></div>
<div class="input">
<div>
<span id="mseSupport264" style="color: green;display: none">MSE H264</span>
<span id="mseSupport" style="color: green;display: none">MSE H265</span>
<span id="mseNotSupport264" style="color: red;display: none">MSE H264</span>
<span id="mseNotSupport"
style="color: red;display: none">MSE H265,wasm</span>
</div>
</div>
<div class="input">
<div>
<span id="wcsSupport264" style="color: green;display: none">Webcodecs H264</span>
<span id="wcsSupport" style="color: green;display: none">Webcodecs H265</span>
<span id="wcsNotSupport264"
style="color: red;display: none">Webcodecs H264(https/localhost)</span>
<span id="wcsNotSupport" style="color: red;display: none">Webcodecs H265(https/localhost),wasm</span>
</div>
</div>
<div class="input">
<div>
<span id="wasmSupport" style="color: green;display: none">WASM</span>
<span id="simdSupport" style="color: green;display: none">WASM SIMD</span>
<span id="simdMtSupport" style="color: green;display: none">WASM WASM(SIMD) </span>
<span id="wasmNotSupport" style="color: red;display: none">WASM</span>
<span id="simdNotSupport"
style="color: red;display: none">WASM SIMD,wasm</span>
<span id="simdMtNotSupport" style="color: red;display: none">WASM WASM(SIMD) </span>
</div>
</div>
<div class="input">
<div><input
disabled
type="checkbox"
checked
id="useMSE"
/><span>MediaSource</span>
<input
disabled
type="checkbox"
id="useWCS"
/><span>Webcodec</span>
<input
disabled
type="checkbox"
id="useWASM"
/><span>WASM</span>
<input
disabled
type="checkbox"
id="useSIMD"
/><span>WASM(SIMD)</span>
<input
disabled
type="checkbox"
id="useSIMDMThreading"
onclick="replay()"
/><span>WASM,WASM(SIMD)</span>
</div>
</div>
<div class="input">
<span></span>
<select id="renderDom" onchange="replay()">
<option value="video" selected>video</option>
<option value="canvas">canvas</option>
</select>
<span>canvas</span>
<select disabled id="isUseWebGPU" onchange="replay()">
<option value="webgl" selected>webgl</option>
<option value="webgpu">webgpu</option>
</select>
<span id="supportWebgpu"></span>
</div>
<div class="input">
<div>
<span></span>
<input placeholder="" type="text" id="videoBuffer" style="width: 50px" value="0.2">
<span>()</span>
<input placeholder="" type="text" id="videoBufferDelay" style="width: 50px" value="1">
<button id="replay"></button>
</div>
</div>
<div class="input">
<div>
<input
disabled
onclick="replay()"
type="checkbox"
id="demuxUseWorker"
/><span>(MediaSourceWebcodec)worker</span>
<input
disabled
onclick="replay()"
type="checkbox"
id="mseDecoderUseWorker"
/><span>(MediaSource)worker</span>
</div>
</div>
<div class="input">
<div>
<input
checked
onclick="replay()"
type="checkbox"
id="replayUseLastFrameShow"
/><span>-></span>
<input
onclick="replay()"
type="checkbox"
id="replayShowLoadingIcon"
/><span>->loading</span>
</div>
</div>
<div class="input">
<div>URL</div>
<input
autocomplete="on"
id="playUrl"
value=""
/>
<button id="play"></button>
<button id="pause" style="display: none"></button>
</div>
<div class="input" style="line-height: 30px">
<button id="destroy"></button>
<span class="fps-inner"></span>
</div>
</div>
</div>
<script src="./demo.js"></script>
<script>
var $player = document.getElementById('play');
var $pause = document.getElementById('pause');
var $playHref = document.getElementById('playUrl');
var $container = document.getElementById('container');
var $destroy = document.getElementById('destroy');
var $fps = document.querySelector('.fps-inner');
var $useMSE = document.getElementById('useMSE');
var $useSIMD = document.getElementById('useSIMD');
var $useWASM = document.getElementById('useWASM');
var $useWCS = document.getElementById('useWCS');
var $videoBuffer = document.getElementById('videoBuffer');
var $videoBufferDelay = document.getElementById('videoBufferDelay');
var $replay = document.getElementById('replay');
var $renderDom = document.getElementById('renderDom');
var $isUseWebGPU = document.getElementById('isUseWebGPU');
var $demuxUseWorker = document.getElementById('demuxUseWorker');
var $useSIMDMThreading = document.getElementById('useSIMDMThreading');
var $replayUseLastFrameShow = document.getElementById('replayUseLastFrameShow');
var $replayShowLoadingIcon = document.getElementById('replayShowLoadingIcon');
var $mseDecoderUseWorker = document.getElementById('mseDecoderUseWorker');
var showOperateBtns = true; //
var forceNoOffscreen = true; //
var jessibuca = null;
function create(options) {
options = options || {}
jessibuca = new JessibucaPro({
container: $container,
videoBuffer: Number($videoBuffer.value), //
videoBufferDelay: Number($videoBufferDelay.value), // 1000s
decoder: './js/decoder-pro.js',
isResize: false,
text: "",
loadingText: "",
debug: true,
debugLevel: "debug",
useMSE: $useMSE.checked === true,
decoderErrorAutoWasm: false,
useSIMD: $useSIMD.checked === true,
useWCS: $useWCS.checked === true,
useMThreading: $useSIMDMThreading.checked === true,
showBandwidth: showOperateBtns, //
showPerformance: showOperateBtns, //
operateBtns: {
fullscreen: showOperateBtns,
screenshot: showOperateBtns,
play: showOperateBtns,
audio: showOperateBtns,
ptz: showOperateBtns,
quality: showOperateBtns,
performance: showOperateBtns,
},
timeout: 10,
audioEngine: "worklet",
qualityConfig: ['', '', '', '4K', '8K'],
forceNoOffscreen: forceNoOffscreen,
isNotMute: false,
heartTimeout: 10,
ptzClickType: 'mouseDownAndUp',
ptzZoomShow: true,
ptzMoreArrowShow: true,
ptzApertureShow: true,
ptzFocusShow: true,
useCanvasRender: $renderDom.value === 'canvas',
useWebGPU: $isUseWebGPU.value === 'webgpu',
demuxUseWorker: $demuxUseWorker.checked === true,
controlHtml: '<div> <span style="color: red">test</span></div>',
// audioEngine:"worklet",
// isFlv: true
pauseAndNextPlayUseLastFrameShow: $replayUseLastFrameShow.checked === true,
heartTimeoutReplayUseLastFrameShow: $replayUseLastFrameShow.checked === true,
replayUseLastFrameShow: $replayUseLastFrameShow.checked === true, //
replayShowLoadingIcon: $replayShowLoadingIcon.checked === true,// loading
mseDecoderUseWorker:$mseDecoderUseWorker.checked === true,
},);
jessibuca.on('stats', (stats) => {
// console.log('stats', stats);
$fps.textContent = `FPS: ${stats.fps} DFPS: ${stats.dfps}`
})
jessibuca.on(JessibucaPro.EVENTS.playFailedAndPaused, (error) => {
jessibuca.showErrorMessageTips('' + error);
})
jessibuca.on(JessibucaPro.EVENTS.crashLog,(log)=>{
console.error('crashLog',log)
})
$player.style.display = 'inline-block';
$pause.style.display = 'none';
$destroy.style.display = 'none';
$fps.textContent = '';
}
create();
function play() {
var href = $playHref.value;
if (href) {
jessibuca.play(href);
$player.style.display = 'none';
$pause.style.display = 'inline-block';
$destroy.style.display = 'inline-block';
} else {
jessibuca.showErrorMessageTips('');
}
}
function replay(options) {
if (jessibuca) {
jessibuca.destroy().then(() => {
create(options);
play();
});
} else {
create();
play();
}
}
$replay.addEventListener('click', function () {
replay();
})
$player.addEventListener('click', function () {
play();
}, false)
$pause.addEventListener('click', function () {
$player.style.display = 'inline-block';
$pause.style.display = 'none';
$fps.textContent = '';
jessibuca.pause();
})
$destroy.addEventListener('click', function () {
if (jessibuca) {
jessibuca.destroy().then(() => {
create();
});
} else {
create();
}
})
$useMSE.addEventListener('click', function () {
const checked = $useMSE.checked;
if (checked) {
$useSIMD.checked = false
$useWCS.checked = false
$useWASM.checked = false
}
replay();
})
$useSIMD.addEventListener('click', function () {
const checked = $useSIMD.checked;
if (checked) {
$useMSE.checked = false
$useWCS.checked = false
$useWASM.checked = false
}
replay();
})
$useWCS.addEventListener('click', function () {
const checked = $useWCS.checked;
if (checked) {
$useMSE.checked = false
$useSIMD.checked = false
$useWASM.checked = false
}
replay();
})
$useWASM.addEventListener('click', function () {
const checked = $useWASM.checked;
if (checked) {
$useMSE.checked = false
$useSIMD.checked = false
$useWCS.checked = false
}
replay();
})
</script>
</body>
</html>
``` |
Ned Ryan, is a former Irish sportsperson. He played hurling with his local club Borris–Ileigh in the 1950s and was a member of the Tipperary senior inter-county team that won the Munster Senior Hurling Championship and the All-Ireland in 1950 and 1951.
He started both All-Ireland final's in the number ten position in the half forward line, and scored a goal in the 1951 All Ireland final against Wexford.
References
Year of birth missing
Possibly living people
Tipperary inter-county hurlers
Munster inter-provincial hurlers
Borris-Ileigh hurlers
All-Ireland Senior Hurling Championship winners |
```go
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
// Code generated by generate-protos. DO NOT EDIT.
package fieldnum
// Field numbers for google.protobuf.Timestamp.
const (
Timestamp_Seconds = 1 // optional int64
Timestamp_Nanos = 2 // optional int32
)
``` |
Assia (born November 1, 1973, in Algiers) is an Algerian-born French singer with Kabyle origins. She had great success with her hit singles "Elle est à toi" and "Là-bas".
Biography
At a young age, she spent twelve years at the classical conservatory in Créteil (near Paris), then a few years later obtained a law degree.
From 1998 to 1999, Assia participated in "Une Affaire de famille" with Stomy Bugsy, Passi and Doc Gynéco of the Sector A and the soundtracks of the movies Taxi and Kiss of the Dragon with the song "Ghir Dini".
In 2000, she released her first album entitled Chercheuse d'or (recorded in Paris, Toulouse and Los Angeles). Assia wrote the texts and his brother Khalil signed the music. Her first top single "Elle est à toi" (over 700,000 copies) was written in collaboration with Calbo of Arsenik. The second single is "Là-bas" (music video directed by J.G. Biggs).
In 2002, Assia played in the musical Cindy with Lââm in the lead role.
In 2003, she released a single with Beenie Man, "Street Life".
In 2005, Assia released her second album, Encore et Encore, recorded in Spain, whose second single "Politiquement Correct" was co-written with Diam's.
Discography
Albums
Singles
1 Duet with Doc Gyneco
2 Duet with Julien Clerc
3 Duet with Rohff
4 Duet with Beenie Man
References
External links
Biography of Assia from Radio France Internationale
1973 births
20th-century Algerian women singers
Living people
Musicians from Algiers
Kabyle people
Algerian emigrants to France
French people of Kabyle descent
21st-century French women singers |
```html
(See accompanying file LICENSE_1_0.txt or copy at
path_to_url
-->
<!--
or a copy at path_to_url
Some files are held under additional license.
Please see "path_to_url" for more information.
-->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
"path_to_url">
<html xmlns="path_to_url" lang="en" xml:lang="en">
<head>
<TITLE>Generic Image Library: bit_aligned_pixel_reference</TITLE>
<META HTTP-EQUIV="content-type" CONTENT="text/html;charset=ISO-8859-1"/>
<LINK TYPE="text/css" REL="stylesheet" HREF="adobe_source.css"/>
</head>
<body>
<table border="0" cellspacing="0" cellpadding="0" style='width: 100%; margin: 0; padding: 0'><tr>
<td width="100%" valign="top" style='padding-left: 10px; padding-right: 10px; padding-bottom: 10px'>
<div class="qindex"><a class="qindex" href="index.html">Modules</a>
| <a class="qindex" href="classes.html">Alphabetical List</a>
| <a class="qindex" href="annotated.html">Class List</a>
| <a class="qindex" href="dirs.html">Directories</a>
| <a class="qindex" href="files.html">File List</a>
| <a class="qindex" href="../index.html">GIL Home Page</a>
</div>
<!-- End Header -->
<!-- Generated by Doxygen 1.5.6 -->
<div class="contents">
<h1>bit_aligned_pixel_reference<br>
<small>
[<a class="el" href="g_i_l_0206.html">Models</a>]</small>
</h1><hr><a name="_details"></a><h2>Detailed Description</h2>
A heterogeneous <a class="el" href="g_i_l_0599.html" title="Represents a pixel value (a container of channels). Models: HomogeneousColorBaseValueConcept...">pixel</a> reference used to represent non-byte-aligned pixels. Models <a class="el" href="g_i_l_0346.html" title="Pixel concept - A color base whose elements are channels.">PixelConcept</a>.
<p>
Example: <div class="fragment"><pre class="fragment"><span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> data=0;
<span class="comment">// A mutable reference to a 6-bit BGR pixel in "123" format (1 bit for red, 2 bits for green, 3 bits for blue)</span>
<span class="keyword">typedef</span> <span class="keyword">const</span> bit_aligned_pixel_reference<unsigned char, mpl::vector3_c<int,1,2,3>, rgb_layout_t, <span class="keyword">true</span>> rgb123_ref_t;
<span class="comment">// create the pixel reference at bit offset 2</span>
<span class="comment">// (i.e. red = [2], green = [3,4], blue = [5,6,7] bits)</span>
rgb123_ref_t ref(&data, 2);
<a class="code" href="g_i_l_0106.html#gab1205781ba628ca806c47a51f40f5f6" title="Mutable accessor to the element associated with a given color name.">get_color</a>(ref, red_t()) = 1;
assert(data == 0x04);
<a class="code" href="g_i_l_0106.html#gab1205781ba628ca806c47a51f40f5f6" title="Mutable accessor to the element associated with a given color name.">get_color</a>(ref, green_t()) = 3;
assert(data == 0x1C);
<a class="code" href="g_i_l_0106.html#gab1205781ba628ca806c47a51f40f5f6" title="Mutable accessor to the element associated with a given color name.">get_color</a>(ref, blue_t()) = 7;
assert(data == 0xFC);
</pre></div>
<p>
<table border="0" cellpadding="0" cellspacing="0">
<tr><td></td></tr>
<tr><td colspan="2"><br><h2>Classes</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">struct </td><td class="memItemRight" valign="bottom"><a class="el" href="g_i_l_0403.html">bit_aligned_pixel_reference</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Heterogeneous <a class="el" href="g_i_l_0599.html" title="Represents a pixel value (a container of channels). Models: HomogeneousColorBaseValueConcept...">pixel</a> reference corresponding to non-byte-aligned bit range. Models <a class="el" href="g_i_l_0274.html" title="A color base is a container of color elements (such as channels, channel references...">ColorBaseConcept</a>, <a class="el" href="g_i_l_0346.html" title="Pixel concept - A color base whose elements are channels.">PixelConcept</a>, <a class="el" href="g_i_l_0344.html" title="Concept for all pixel-based GIL constructs, such as pixels, iterators, locators,...">PixelBasedConcept</a>. <a href="g_i_l_0403.html#_details">More...</a><br></td></tr>
</table>
</div>
<hr size="1"><address style="text-align: right;"><small>Generated on Sat May 2 13:50:16 2009 for Generic Image Library by
<a href="path_to_url">
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.6 </small></address>
</body>
</html>
``` |
```c++
#include "asfbx_skin_context.h"
#include "asfbx_context.h"
AsFbxSkinContext::AsFbxSkinContext(AsFbxContext* pContext, FbxNode* pFrameNode)
: pSkin(nullptr)
{
if (pContext != nullptr && pContext->pScene != nullptr)
{
pSkin = FbxSkin::Create(pContext->pScene, "");
}
if (pFrameNode != nullptr)
{
lMeshMatrix = pFrameNode->EvaluateGlobalTransform();
}
}
``` |
Pukeahu National War Memorial Park, also known as Pukeahu Park, is situated in front of the National War Memorial in the suburb of Mt Cook, Wellington, New Zealand. It opened on 18 April 2015 in time for the centenary of the World War I Gallipoli landings, and was one of the New Zealand Government's key projects to commemorate the 100th anniversary of World War I. The hill where the memorial was built was named 'Pukeahu' (from Māori puke ahu, "sacred hill") by the Ngāi Tara iwi (tribe).
In May 2004, Prime Minister Helen Clark said,
A park would further enhance the area which is already being redeveloped with the building of the Tomb of the Unknown Warrior. It will provide a more appropriate setting for New Zealand's memorial to those New Zealanders who gave their lives in times of war. Significant aspects of our heritage and identity were forged in difficult times of conflict...this is illustrated by the growing numbers of people who attend Anzac Day services in New Zealand.
Arras Tunnel
In 2005, the Ministry for Culture and Heritage worked with the New Zealand Transport Agency to acquire land on the northern side of Buckle Street, in front of the National War Memorial, to create a National Memorial Park. In August 2012, the government announced that the Buckle Street section of State Highway 1 would be moved underground to a cut and cover tunnel, allowing the park to extend over the old road area to create a unified memorial precinct.
The one-way tunnel is 130 m long. It opened to traffic on 29 September 2014, with the name of Arras Tunnel. The tunnel was named to honour the wartime efforts of the New Zealand Tunnelling Company in the French town of Arras during the Great War. The tunnel contains 273 decorative red poppies, to remind drivers that they are passing through a significant commemorative space.
Artworks, memorials and sculptures
The park contains memorials from both New Zealand's military allies and historic opponents.
Australian Memorial
The Australian memorial, designed by Australian architects Tonkin Zulaikha Greer, commemorates the significant military relationship between Australia and New Zealand. The memorial consists of fifteen red sandstone columns with various inscriptions and artworks by both Aboriginal and Māori artists. The memorial was opened in April 2015 by Australian Prime Minister Tony Abbott and New Zealand Prime Minister John Key.
Belgian Memorial
The Belgian memorial was designed by Belgian artists Niko Van Stichel and Lut Vandebos. Made of steel, the sculpture combines both a traditional symbol of victory, the laurel wreath, with a memorial wreath as a tribute to those who died in battle. A similar sculpture has been installed in East Flanders, Belgium. Belgian Deputy Prime Minister and Minister for Foreign Affairs, Didier Reynders, attended a site blessing ceremony followed by outgoing Belgian Ambassador Jean-Luc Bodson breaking ground. Mauri stones and soil from Belgium were placed into the ground by Ambassador Mullie at a later September 2017 ceremony, and the sculpture was unveiled in October 2017.
French Memorial
The French Memorial Le Calligramme was unveiled by French Minister for State Geneviève Darrieussecq and Minister of Justice, Courts and Treaty of Waitangi Negotiations Andrew Little in May 2018.
Le Calligramme features an inscription of the words of French soldier Guillaume Apollinaire's 1915 poem Le Chant de l’Honneur (Song of Honour), published in a book titled Calligrammes: Poems of Peace and War 1913-1916. The memorial combines landscaping with two large elements made of local stone and crushed French Combe Brune stone from the Western Front. The memorial was designed by architectural firm Patterson Associates Ltd, with Paul Baragwanath and Suzanne Turley Landscapes, and constructed by Naylor Love.
German Tapestry
In November 2017, the President of Germany, Dr Frank-Walter Steinmeier unveiled a memorial tapestry gifted on behalf of Germany while visiting the National War Memorial. Titled Flandern, the tapestry is based on one of a series of photographs of 14 First World War battlefield sites. The artist, Stephen Schenk, explained that the work was "a reminder of the untold misery and horror, and was created to remember the victims of this inconceivable catastrophe of the twentieth century".
Pacific Islands Memorial
A memorial honouring the service of Pacific Islanders in the world wars and later conflicts was dedicated in March 2021, specifically honouring the service of overseas soldiers and the Coastwatchers. Titled Te Reo Hotunui o te Moana-nui-a-Kiwa (translating to The Deep Sigh of the Pacific), the memorial features a large bronze sculpture of a conch (Chicoreus ramosus) shell with remembrance poppies. Designed by Michel Tuffery, the sculpture was inspired by a conch shell found in a World War I-era tunnel in Arras, France that was inscribed by Private Angene Angene, a Cook Islander who served on the Western Front. The dedication was attended by the prime ministers of New Zealand and the Cook Islands, Jacinda Ardern and Mark Brown. At the dedication, both prime ministers called for increased recognition of the military service of Pacific Islanders.
Turkish Memorial
Unveiled in March 2017, this memorial features a free-standing bronze plaque with words of reconciliation widely attributed to Mustafa Kemal Atatürk cut through it. This allows the viewer to see a Turkish red pine (pinus brutia) descended from the original Lone Pine at Gallipoli, which is planted directly behind the plaque. The memorial was designed by New Zealand artist and Army Gunner Matt Gauldie.
United Kingdom Memorial
In July 2017, the United Kingdom Memorial was unveiled by the UK Secretary of State for Foreign and Commonwealth Affairs, Boris Johnson. The memorial was designed and built by Weta Workshop with input from students at Massey University and the British Wimbledon College of Arts.
The design takes the form of two of the UK and New Zealand's most iconic trees. The trunks of a Royal Oak and a Pōhutakawa intertwine to form one single leafy canopy, where leaves from both trees merge to create sense of shelter – giving the memorial its name: Whakaruruhau. Standing at the plaque, between the branches a silhouette of a single soldier can be seen, representing the union of two countries who stood side by side and those millions who served in times of conflict, resolution and peace.
United States of America Memorial
On 10 December 2018, the U.S. Memorial representing the United States and New Zealand's shared history was unveiled, commissioned by the U.S. Government and the American Battle Monuments Commission. The memorial contains a granite tablet carved in Madison, Wisconsin, with words taken from a radio address delivered on Anzac Day 1943, by the US Secretary of the Navy Frank Knox. It reads:
1918 Influenza Pandemic Memorial Plaque
On 6 November 2019 a memorial plaque for the victims of the 1918 Influenza Pandemic was unveiled at Pukeahu. The pandemic killed around 9000 New Zealanders. The plaque was designed by Neil Pardington and Wraight & Associates, and was unveiled by the Prime Minister and Minister for Arts, Culture and Heritage Jacinda Ardern with historian Geoffrey Rice.
Awards
New Zealand Indigenous and Specialty Timber Award – Resene Timber Design Awards 2015
Public Architecture Award – New Zealand Architecture Awards 2016
George Malcolm Award – New Zealand Institute of Landscape Architects 2017
References
Wellington
Tourist attractions in Wellington City
Monuments and memorials in New Zealand
New Zealand military memorials and cemeteries
World War I memorials in New Zealand
World War II memorials in New Zealand |
The was a Japanese aristocratic kin group. The Ichijō was a branch of the Fujiwara clan, founded by Kujō Michiie's son Ichijō Sanetsune and was one of the Five regent houses, from which the Sesshō and Kampaku were chosen.
Genealogy
Tosa-Ichijō clan
The , a cadet branch of the Ichijō family, was established during the chaos of Ōnin War. In 1475, Ichijō Norifusa, the 9th head of the family, fled from Kyoto to Tosa Province, where one of the fiefdoms the family held by the time; some descendants of Norifusa stayed in Tosa for generations. The family, however, eventually lost control of Tosa during the reign of Ichijō Kanesada since 1575.
The following is the list of the heads of the Tosa-Ichijō clan:
Norifusa (1423-1480)
Fusaie (1475-1539), second son of Norifusa
(1498-1541), eldest son of Norifusa and brother of Fusamichi (11th head)
(1522-1549), son of Fusafuyu
Kanesada (1543-1585), son of Fusamoto
Tadamasa (d. c. 1580), son of Kanesada
(b. c. 1578), son of Tadamasa. His whereabouts was lost in record since 1600, after the fall of the Chōsokabe clan as a result of the Battle of Sekigahara.
In 1902, Ichijō Sanemoto (一条実基, 1901-1972), eldest son of Ichijō Saneteru (25th head of Ichijō) and his second wife, became a baron, in name of revival for the Tosa-Ichijō clan. Baron Ichijō Sanemoto later married a British woman, Tess Snare (1900-1982), in 1928.
Daigo family
The was founded in 1679 by Ichijō Akiyoshi's second son Fuyumoto. The family name was given by Fuyumoto's cousin, Emperor Reigen.
See also
Japanese clans
List of Kuge families
Five Regent Houses
References
External links
Ichijō kamon at Harimaya.com
Japanese clans
Fujiwara clan |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.