text
stringlengths 1
22.8M
|
|---|
```smalltalk
using System.Collections.Generic;
using System.Diagnostics;
using Microsoft.CodeAnalysis;
using Microsoft.CodeAnalysis.CSharp;
using Microsoft.CodeAnalysis.CSharp.Syntax;
using Microsoft.CodeAnalysis.Text;
namespace Roslynator.CSharp.Syntax;
/// <summary>
/// Provides information about a region.
/// </summary>
[DebuggerDisplay("{DebuggerDisplay,nq}")]
public readonly struct RegionInfo
{
private RegionInfo(RegionDirectiveTriviaSyntax directive, EndRegionDirectiveTriviaSyntax endDirective)
{
Directive = directive;
EndDirective = endDirective;
}
/// <summary>
/// #region directive.
/// </summary>
public RegionDirectiveTriviaSyntax Directive { get; }
/// <summary>
/// #endregion directive.
/// </summary>
public EndRegionDirectiveTriviaSyntax EndDirective { get; }
/// <summary>
/// Determines whether this struct was initialized with an actual syntax.
/// </summary>
public bool Success
{
get { return Directive is not null; }
}
/// <summary>
/// The absolute span of this region, not including its leading and trailing trivia.
/// </summary>
public TextSpan Span
{
get
{
return (Success)
? TextSpan.FromBounds(Directive.SpanStart, EndDirective.Span.End)
: default;
}
}
/// <summary>
/// The absolute span of this region, including its leading and trailing trivia.
/// </summary>
public TextSpan FullSpan
{
get
{
return (Success)
? TextSpan.FromBounds(Directive.FullSpan.Start, EndDirective.FullSpan.End)
: default;
}
}
/// <summary>
/// Determines whether this region is empty, i.e. contains only white-space.
/// </summary>
public bool IsEmpty
{
get
{
if (!Success)
return false;
SyntaxTrivia trivia = Directive.ParentTrivia;
return trivia.TryGetContainingList(out SyntaxTriviaList list)
&& object.ReferenceEquals(EndDirective, FindEndRegionDirective(list, list.IndexOf(trivia)));
}
}
[DebuggerBrowsable(DebuggerBrowsableState.Never)]
private string DebuggerDisplay
{
get { return SyntaxInfoHelpers.ToDebugString(Success, this, Directive); }
}
private static EndRegionDirectiveTriviaSyntax? FindEndRegionDirective(SyntaxTriviaList list, int index)
{
for (int i = index + 1; i < list.Count; i++)
{
SyntaxTrivia trivia = list[i];
switch (trivia.Kind())
{
case SyntaxKind.WhitespaceTrivia:
case SyntaxKind.EndOfLineTrivia:
{
continue;
}
case SyntaxKind.EndRegionDirectiveTrivia:
{
if (trivia.HasStructure)
return (EndRegionDirectiveTriviaSyntax)trivia.GetStructure()!;
return null;
}
default:
{
return null;
}
}
}
return null;
}
internal static RegionInfo Create(SyntaxNode node)
{
switch (node?.Kind())
{
case SyntaxKind.RegionDirectiveTrivia:
return Create((RegionDirectiveTriviaSyntax)node);
case SyntaxKind.EndRegionDirectiveTrivia:
return Create((EndRegionDirectiveTriviaSyntax)node);
}
return default;
}
internal static RegionInfo Create(RegionDirectiveTriviaSyntax regionDirective)
{
if (regionDirective is null)
return default;
List<DirectiveTriviaSyntax> list = regionDirective.GetRelatedDirectives();
if (list.Count != 2)
return default;
if (list[1].Kind() != SyntaxKind.EndRegionDirectiveTrivia)
return default;
return new RegionInfo(regionDirective, (EndRegionDirectiveTriviaSyntax)list[1]);
}
internal static RegionInfo Create(EndRegionDirectiveTriviaSyntax endRegionDirective)
{
if (endRegionDirective is null)
return default;
List<DirectiveTriviaSyntax> list = endRegionDirective.GetRelatedDirectives();
if (list.Count != 2)
return default;
if (list[0].Kind() != SyntaxKind.RegionDirectiveTrivia)
return default;
return new RegionInfo((RegionDirectiveTriviaSyntax)list[0], endRegionDirective);
}
}
```
|
```c
/* GLib testing framework examples and tests
*
* This work is provided "as is"; redistribution and modification
* in whole or in part, in any medium, physical or electronic is
* permitted without restriction.
*
* This work 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.
*
* In no event shall the authors or contributors be liable for any
* direct, indirect, incidental, special, exemplary, or consequential
* damages (including, but not limited to, procurement of substitute
* goods or services; loss of use, data, or profits; or business
* interruption) however caused and on any theory of liability, whether
* in contract, strict liability, or tort (including negligence or
* otherwise) arising in any way out of the use of this software, even
* if advised of the possibility of such damage.
*/
#include <glib/glib.h>
#include <gio/gio.h>
#include <stdlib.h>
#include <string.h>
#define NUM_TRIALS 250000
struct {
const char *order;
int expected, seen;
} ordering[] = {
/* There are 32 legitimate orderings; the result always has to start
* with either "fe" (usually) or "ef" (rarely). For the remaining
* letters, "cbda" is the most likely, with various other orders
* possible, down to "adbc" being the most improbable. However,
* almost all "fe" orderings are more likely than almost any "ef"
* orderings. The complete probability ordering, from most-likely
* to least-likely is something roughly like:
*/
{ "fecbda", 0.2468 * NUM_TRIALS, 0},
{ "febcda", 0.1885 * NUM_TRIALS, 0},
{ "fecdba", 0.1346 * NUM_TRIALS, 0},
{ "fedcba", 0.0830 * NUM_TRIALS, 0},
{ "febdca", 0.0706 * NUM_TRIALS, 0},
{ "fedbca", 0.0571 * NUM_TRIALS, 0},
{ "fecbad", 0.0496 * NUM_TRIALS, 0},
{ "febcad", 0.0374 * NUM_TRIALS, 0},
{ "fecabd", 0.0185 * NUM_TRIALS, 0},
{ "fecdab", 0.0136 * NUM_TRIALS, 0},
{ "fecadb", 0.0110 * NUM_TRIALS, 0},
{ "febacd", 0.0108 * NUM_TRIALS, 0},
{ "feacbd", 0.0096 * NUM_TRIALS, 0},
{ "fedcab", 0.0083 * NUM_TRIALS, 0},
{ "feabcd", 0.0073 * NUM_TRIALS, 0},
{ "feacdb", 0.0058 * NUM_TRIALS, 0},
{ "efcbda", 0.0049 * NUM_TRIALS, 0},
{ "febdac", 0.0048 * NUM_TRIALS, 0},
{ "febadc", 0.0043 * NUM_TRIALS, 0},
{ "fedbac", 0.0038 * NUM_TRIALS, 0},
{ "efbcda", 0.0038 * NUM_TRIALS, 0},
{ "feadcb", 0.0036 * NUM_TRIALS, 0},
{ "fedacb", 0.0035 * NUM_TRIALS, 0},
{ "feabdc", 0.0029 * NUM_TRIALS, 0},
{ "feadbc", 0.0026 * NUM_TRIALS, 0},
{ "fedabc", 0.0026 * NUM_TRIALS, 0},
{ "efcdba", 0.0026 * NUM_TRIALS, 0},
{ "efdcba", 0.0017 * NUM_TRIALS, 0},
{ "efbdca", 0.0014 * NUM_TRIALS, 0},
{ "efdbca", 0.0011 * NUM_TRIALS, 0},
{ "efcbad", 0.0010 * NUM_TRIALS, 0},
{ "efbcad", 0.0008 * NUM_TRIALS, 0},
{ "efcabd", 0.0004 * NUM_TRIALS, 0},
{ "efcdab", 0.0003 * NUM_TRIALS, 0},
{ "efcadb", 0.0002 * NUM_TRIALS, 0},
{ "efbacd", 0.0002 * NUM_TRIALS, 0},
{ "efacbd", 0.0002 * NUM_TRIALS, 0},
{ "efdcab", 0.0002 * NUM_TRIALS, 0},
{ "efabcd", 0.0002 * NUM_TRIALS, 0},
{ "efacdb", 0.0001 * NUM_TRIALS, 0},
{ "efbdac", 0.0001 * NUM_TRIALS, 0},
{ "efadcb", 0.0001 * NUM_TRIALS, 0},
{ "efdbac", 0.0001 * NUM_TRIALS, 0},
{ "efbadc", 0.0001 * NUM_TRIALS, 0},
{ "efdacb", 0.0001 * NUM_TRIALS, 0},
{ "efabdc", 0.0001 * NUM_TRIALS, 0},
{ "efadbc", 0.00005 * NUM_TRIALS, 0},
{ "efdabc", 0.00005 * NUM_TRIALS, 0}
};
#define NUM_ORDERINGS G_N_ELEMENTS (ordering)
static void
test_srv_target_ordering (void)
{
GList *targets, *sorted, *t;
char result[7], *p;
int i;
guint o;
targets = NULL;
/* name, port, priority, weight */
targets = g_list_append (targets, g_srv_target_new ("a", 0, 2, 0));
targets = g_list_append (targets, g_srv_target_new ("b", 0, 2, 10));
targets = g_list_append (targets, g_srv_target_new ("c", 0, 2, 15));
targets = g_list_append (targets, g_srv_target_new ("d", 0, 2, 5));
targets = g_list_append (targets, g_srv_target_new ("e", 0, 1, 0));
targets = g_list_append (targets, g_srv_target_new ("f", 0, 1, 50));
for (i = 0; i < NUM_TRIALS; i++)
{
g_random_set_seed (i);
sorted = g_srv_target_list_sort (g_list_copy (targets));
for (t = sorted, p = result; t; t = t->next)
*(p++) = *g_srv_target_get_hostname (t->data);
*p = '\0';
g_list_free (sorted);
for (o = 0; o < NUM_ORDERINGS; o++)
{
if (!strcmp (result, ordering[o].order))
{
ordering[o].seen++;
break;
}
}
/* Assert that @result matched one of the valid orderings */
if (o == NUM_ORDERINGS)
{
char *msg = g_strdup_printf ("result '%s' is invalid", result);
g_assertion_message (G_LOG_DOMAIN, __FILE__, __LINE__, G_STRFUNC, msg);
}
}
/* Assert that each ordering appeared roughly the expected
* number of times.
*/
for (o = 0; o < NUM_ORDERINGS; o++)
{
g_assert_cmpint (ordering[o].seen, >, ordering[o].expected / 2);
g_assert_cmpint (ordering[o].seen, <, ordering[o].expected * 2);
}
g_resolver_free_targets (targets);
}
int
main (int argc, char **argv)
{
g_test_init (&argc, &argv, NULL);
g_test_add_func ("/srvtarget/srv-target-ordering", test_srv_target_ordering);
return g_test_run();
}
```
|
This is a list of artists from, or associated with Portugal. Artists are listed in alphabetical order by last name.
A
Jorge Afonso (c. 1470-1540)
Nadir Afonso (1920-2013)
Filipe Alarcão (born 1963), designer
Francisco Keil do Amaral (1910-1975)
Helena Almeida (1934-2018)
Sofia Areal (born 1960)
B
Carlos Botelho (1899-1982)
Manuel Botelho (born 1950)
João de Brito (born 1958), Portuguese-American artist, oil painter and sculptor
C
Pedro Calapez (born 1953)
Fernando Calhau (1948-2002)
Nuno de Campos (1969-)
Manuel Carmo (1958-2015)
António Carneiro (1872-1930)
João Carqueijeiro (1954-), plastic artist
Nicolau Chanterene (1485-1555) French sculptor and architect who worked mainly in Portugal and Spain
Eduardo Teixeira Coelho (1919-2005) comic book artist
Evelina Coelho (1945–2013), painter
José Dias Coelho (1923-1961)
Jorge Colaço (1868-1942)
João Cutileiro (born 1937), sculptor especially of women's torsos in marble
D
António Dacosta (1914-1990)
Francisco Coelho Maduro Dias (1904-1986), painter and sculptor
Carlos Domingomes (born 1980)
Juno Doran (born 1966)
E
Mário Eloy (1900-1951)
F
Garcia Fernandes (died c. 1565)
Vasco Fernandes (1474-1541)
Cristóvão de Figueiredo (1449-1539)
G
Luis Geraldes (born 1957)
Nuno Gonçalves (fl. 1450-1471)
H
Hazul, graffiti artist
Francisco Henriques (died 1518)
João Hogan (1914-1988)
Francisco de Holanda (1517-1585), Renaissance humanist and painter
J
Josefa de Óbidos (ca. 1630-1684)
Ana Jotta (born 1946)
K
Alfredo Keil (1850-1907)
Kim Prisu (born 1962)
L
Fernando Lanhas (1923-2012)
António Teixeira Lopes, (1866-1942), sculptor
Cristóvão Lopes (c. 1516-1594)
Gregório Lopes (1489-1549)
Cristobal López (c. 1516-1594)
Miguel Ângelo Lupi (1826-1883)
M
António Macedo - realist painter (1954)
Joaquim Machado de Castro - sculptor, writer, teacher (1731-1822)
Diogo Machado (born 1980) - illustrator & street artist
José Malhoa (1855-1933)
Abel Manta (1928-1982)
João Abel Manta (1928-1982)
João Marques de Oliveira (1853-1927)
Henrique Medina (1901-1988)
Albuquerque Mendes (born 1953)
Jorge Melício (born 1957)
N
José de Almada Negreiros (1893–1970)
Sá Nogueira (1921–2002)
O
P
Abigail de Paiva Cruz (1883-1944)
António Palolo (1946-2000)
Artur Pastor (1922-1999), photographer
António Pedro (1909-1966)
Manuel Pereira da Silva (1920-2003), sculptor
Álvaro Perdigão (1910-1994)
Columbano Bordalo Pinheiro (1857-1929)
Rafael Bordalo Pinheiro, (1846-1905), known for illustrations, caricatures, sculpture and ceramics designs, and is considered the first Portuguese comics creator
Júlio Pomar (1926-2018)
Henrique Pousão (1859-1884)
Pedro Portugal (born 1963)
Kim Prisu (born 1962)
R
Paula Rego (1935-2022)
Maria Inês Ribeiro da Fonseca (1926-1995)
Rigo 23 (born 1966)
José Rodrigues (1828-1887)
Carlos Roque - Portuguese comics artist (1936-2006)
S
José María Sá Lemos (1892–1971), sculptor
Abel Salazar (1889-1946)
Bartolomeu Cid dos Santos (1931-2008), artist and professor who specialized in the plastic arts with an emphasis on engravings
Julião Sarmento (1948–2021)
Domingos Sequeira (1768-1837)
António Carvalho de Silva Porto (1850-1893)
João Artur da Silva (1928-)
António Soares dos Reis (1847-1889), sculptor
Amadeo de Souza Cardoso (1887-1918)
Aurélia de Souza (1865-1922)
Sofia Martins de Sousa (1870-1960)
T
Toonman (born 1975)
Pedro Tudela (born 1962)
V
Joana Vasconcelos (born 1971)
Mário Cesariny de Vasconcelos (1923-2006)
Marcelino Vespeira (1925-2002)
Eduardo Viana (1881-1967)
Vieira Portuense (1765-1805)
Maria Helena Vieira da Silva (1907-1992)
Portuguese artists
Artists
|
Jeffrey Winton Underhill (1927–10 May 1978) was an Australian writer and journalist. He worked in advertising before turning to writing.
Career
He was a regular writer on the Friday night edition of In Melbourne Tonight hosted by Noel Ferrier, who wrote in his memoirs that Underhill "possessed one of the most original talents for script writing I have ever encountered and I was extraordinarily luck to have him on the team. He wrote the entire show - no small effort on a weekly basis."
Select credits
The Bunyip and the Satellite (1957) - stage musical - lyrics
The Ballad of Angel's Alley (1958) – stage musical, first performed at the New Theatre, Melbourne in December 1958
Night of the Ding-Dong (1961) - writer
Alice in Wonderland (1962 film) - writer
In Melbourne Tonight (1962) – writer
The Noel Ferrier Show (1964) – TV writer
A Small Wonder (1966) – TV play
A Time for Love - "Noises in Another Room" (1972) - TV play
References
Notes
External links
Jeff Underhill at IMDb
Australian screenwriters
1927 births
1978 deaths
20th-century Australian screenwriters
|
```smalltalk
using System;
using Volo.Abp.Domain.Entities;
namespace Volo.Abp.Auditing.App.Entities;
public class AppEntityWithSoftDelete : AggregateRoot<Guid>, IHasDeletionTime
{
public AppEntityWithSoftDelete(Guid id, string name)
: base(id)
{
Name = name;
}
public string Name { get; set; }
public bool IsDeleted { get; set; }
public DateTime? DeletionTime { get; set; }
}
```
|
P. J. Garvey (1971 – 24 August 2021) was an Irish hurler and Gaelic footballer. At club level he played with Hospital-Herbertstown and Ballybricken-Bohermore and was also a member of the Limerick senior teams as a dual player.
Career
Garvey played the majority of his adult hurling and Gaelic football with the Hospital-Herbertstown club. He first appeared on the inter-county scene during a two-year stint with the Limerick minor team before progressing onto the under-21 side. Garvey played for the Limerick intermediate hurling team as well as the senior team during the 1992-93 National Hurling League. As a Gaelic footballer he lined out with the Limerick senior team that came close to beating Kerry in the 1991 Munster final. Garvey also enjoyed success as manager of the Mungret/St. Paul's club.
Death
Garvey died suddenly on 24 August 2021.
Honours
Mungret/St. Paul's
Limerick Junior A Hurling League: 2021
Limerick City Junior A Hurling League: 2021
References
1971 births
2021 deaths
Dual players
Hospital-Herbertstown hurlers
Limerick inter-county hurlers
Limerick inter-county Gaelic footballers
Hurling managers
|
```shell
Bash history reverse search
Aliasing ssh connections
Clear the terminal instantly
Get to know your commands with `type`
`else` statements using the `||` operator
```
|
Mile-a-Minute Romeo is a 1923 American silent Western film directed by Lambert Hillyer and written by Robert N. Lee. It is based on the 1922 novel Gun Gentlemen by Max Brand. The film stars Tom Mix, Betty Jewel, J. Gordon Russell, James Mason, Duke R. Lee and James Quinn. The film was released on November 18, 1923, by Fox Film Corporation.
Cast
Tom Mix as Lucky Bill
Betty Jewel as Molly
J. Gordon Russell as Landry
James Mason as Morgan
Duke R. Lee as Sheriff
James Quinn as Coroner
Charles K. French as Sheriff
Tony the Horse as Tony the Horse
References
External links
1923 films
1923 Western (genre) films
Fox Film films
Films directed by Lambert Hillyer
American black-and-white films
Silent American Western (genre) films
1920s English-language films
1920s American films
|
```xml
<Project Sdk="Microsoft.Build.NoTargets/3.7.0">
<PropertyGroup>
<TargetFramework>$(SdkTargetFramework)</TargetFramework>
<GenerateRuntimeConfigurationFiles>true</GenerateRuntimeConfigurationFiles>
<CopyBuildOutputToPublishDirectory>false</CopyBuildOutputToPublishDirectory>
<ProduceReferenceAssembly>false</ProduceReferenceAssembly>
<NativeVersionFile>$(ArtifactsObjDir)sdk_version.h</NativeVersionFile>
</PropertyGroup>
<ItemGroup>
<PackageReference Include="Microsoft.Signed.Wix" GeneratePathProperty="true" />
</ItemGroup>
<ItemGroup>
<!-- See: path_to_url#referencing-native-assets-with-nativeprojectreference -->
<NativeProjectReference Include="CMakeLists.txt" CMakeProject="finalizer.nativeproj" BuildNative="true" />
</ItemGroup>
<Target Name="GenerateSdkVersionFile" BeforeTargets="CoreCompile" DependsOnTargets="GenerateNativeVersionFile" />
<!-- This target needs to run before the native project reference is built. -->
<Target Name="CopyWixSdk" AfterTargets="Restore" BeforeTargets="Build">
<ItemGroup>
<WixLib Include="$(WixSdkPath)vs2017\lib\**\*.*" />
<WixInclude Include="$(WixSdkPath)inc\**\*.*" />
</ItemGroup>
<!-- Copy all the lib files for x86, x64, and arm64. -->
<Copy SourceFiles="@(WixLib)" DestinationFiles="@(WixLib->'$(ArtifactsDir)WixSdk\lib\%(RecursiveDir)%(Filename)%(Extension)')" SkipUnchangedFiles="true" />
<Copy SourceFiles="@(WixInclude)" DestinationFolder="$(ArtifactsDir)WixSdk\inc" SkipUnchangedFiles="true" />
</Target>
<!-- This imports the CMake SDK and because BuildNative is true, it builds the native project. -->
<!-- See: path_to_url#referencing-native-assets-with-nativeprojectreference -->
<Import Project="ProjectReference.targets" Sdk="Microsoft.DotNet.CMake.Sdk" Condition="'$(OS)' == 'Windows_NT' And ('$(Architecture)' == 'x86' Or '$(Architecture)' == 'x64' Or '$(Architecture)' == 'arm64')" />
</Project>
```
|
The Diocese of Ariano Irpino-Lacedonia () is a Latin diocese of the Catholic Church. It is a suffragan of the Archdiocese of Benevento.
In 1986 the Diocese of Ariano and the Diocese of Lacedonia merged to form the current diocese of Ariano Irpino-Lacedonia, which comprises twenty towns in the province of Avellino, three in that of Benevento, and one in the province of Foggia. There are 43 parishes in the diocese.
History
Ariano (currently Ariano Irpino), a medieval town built on three hills along the Apennines, occupies an ancient site of the Samnite tribe of the Hirpini.
Beneventum, at the beginning of the fourth century, had a bishop, and the Gospel may have reached Ariano from that city. The Bishop of Beneventum was one of the nineteen prelates who were present at the Synod of Rome, held in the year 313.
Ariano was an episcopal city from the tenth century and perhaps before that time. It is first mentioned in the Bull "Cum Certum Sit" of Pope John XIII of 26 May 979, which promoted the diocese of Beneventum to metropolitan rank, and named Ariano as a suffragan see.
It is clear that the diocese existed at the beginning of the 11th century. In a document of October 1016, the Archpriest Petrus acts in the capacity of "rector episcopii sancte sedis Arianensis, in a suit "una cum Cicinus clericus atvocatorem predicto episcopio." It is not clear whether Petrus is acting on behalf of an unnamed bishop, or is acting during a vacancy in the episcopacy.
The first known bishop was Bonifacius (attested 1039).
In 1070, Bishop Meinardus erected in his cathedral a marble baptistery on the walls of which verses were inscribed, recording the date and the bishop's name. Bishop Meinardus of Ariano attended the provincial synod summoned by Archbishop Milo of Benevento in March 1075.
The bishops of Ariano also held the fief and the title of Barons of S. Eleuterio, certainly by 1307, and perhaps as a gift of the emperor Frederick II (d. 1250).
The city of Ariano was completely ruined by the great earthquakes of December 1456. The dead numbered between 600 and 2200, depending on reports. Bishop Orso Leone (1449–1456) had a metrical inscription placed in the episcopal palace, numbering the dead at a thousand. The town was rebuilt by 1470.
The diocese was severely affected by a plague in 1528, bringing about the deaths of around 5,000 persons. The loss of life was so heavy that, taking into account also the losses from earthquakes, it was necessary to close five parishes.
The diocesan seminary was founded in 1564, by Bishop Donato Laurenti (1563–1584). Bishop Giacinto della Calce, O.Theat. (1697–1715) rebuilt the diocesan seminary, which had been ruined in the earthquakes of 1688 and 1694. It was again destroyed by the earthquake of 1732, and rebuilt by Bishop Filippo Tipaldi (1717–1748) in 1735.
In November 1732, another great earthquake struck Ariano, which was again totally destroyed. The number of dead, however, was only c. 160, since it was harvest time and the largest part of the population was in the fields. With the churches ruined, the bishop had a temporary church constructed of wood and plaster in the main square, so that religious services could be held.
In 1697, the city of Ariano had a population of some 5,000 individuals; in the city were ten parishes and two collegiate churches. In 1748, the city of Ariano had a population estimated at 10,000. In the city were twelve parishes, of which three were collegiate churches, each with a number of canons. There were five houses of religious men, and one of women. The diocese also had twelve "loca". The population of the entire diocese was reckoned at 54,000 souls.
After Napoleon
Following the extinction of the Napoleonic Kingdom of Italy, the Congress of Vienna authorized the restoration of the Papal States and the Kingdom of Naples. Since the French occupation had seen the abolition of many Church institutions in the Kingdom, as well as the confiscation of most Church property and resources, it was imperative that Pope Pius VII and King Ferdinand IV reach agreement on restoration and restitution.
A concordat was finally signed on 16 February 1818, and ratified by Pius VII on 25 February 1818. Ferdinand issued the concordat as a law on 21 March 1818. The re-erection of the dioceses of the kingdom and the ecclesiastical provinces took more than three years. The right of the king to nominate the candidate for a vacant bishopric was recognized, as in the Concordat of 1741, subject to papal confirmation (preconisation). On 27 June 1818, Pius VII issued the bull De Ulteriore, in which he reestablished the metropolitan archbishopric of Benevento, with ten suffragan dioceses, including the diocese of Ariano.
The case of Bishop Caputo
Fra Michele Maria Caputo was a Dominican friar, born at Nardo, in the heel of the boot of Italy. He served his year as a novice in Trani, where he also obtained a degree in theology. He taught humanities at Nardo, and then philosophy and theology to students in his Order. He was repeatedly elected Prior of his convent in Taranto, and in 1845 became Provincial of the Dominican province of Puglia. In 1852 he became a master of theology.
On 12 June 1852, he was nominated Bishop of Oppido Maritima, and was confirmed by Pope Pius IX on 27 September 1852. He made his formal entry into the diocese on 20 February 1851, and immediately began a program of reform of the clergy. He also undertook a reform of the staff of the diocesan seminary, replacing dead wood with priests who were in touch with modern philosophy and theology. He was a supporter of the pope's claims to universal spiritual authority, and he warmly endorsed the new doctrine of the Immaculate Conception (1854). He established in his diocese a "Monte di pieta," a sort of controlled pawn brokerage, and a "Monte frumentario," a sort of agricultural bank. When he began to look closely into the episcopal income and the finances of the diocese, he discovered many cases of misappropriation of goods and properties. He undertook a series of lawsuits, intending to recover everything which had slipped from the hands of his predectessors. His successes, especially in the civil courts brought him resentment and opposition in many quarters. Retaliation against the bishop took the form accusations lodged with higher religious and civil authorities, in particular, that he was often absent from Oppido, in the village of Piminoro, where he maintained an illicit relationship with his housekeeper. The Pope responded to the pressure by transferring Bishop Caputo, with the consent of King Ferdinand II of the Two Sicilies, to the diocese of Ariano, on 27 September 1858; Caputo was appointed Administrator of Oppido.
The successes of the Piedmontese armies, and the incorporation of most of the Papal Statess into the Kingdom of Sardinia, as well as the successes of Giuseppe Garibaldi in Sicily, stimulated spontaneous uprisings in many cities of the Kingdom of Naples. When supporters of Garibaldi, led by General Turr, approached Ariano, a conservative peasant uprising resulted in the murders of some thirty liberals. Bishop Caputo's brother Giuseppe was arrested by the General, causing the bishop to flee to Naples.
On 7 September 1860, Garibaldi and his forces entered Naples. On 20 September 1860, the Giornale officiale di Napoli published Caputo's official adherence to the new regime in Naples, which he had signed two days earlier. On December 20, 1860, Bishop Caputo issued a pastoral letter, criticizing the closed-mindedness of seminary instruction, and invited the clergy to welcome Vittorio Emanuele, whom they proclaimed their King and who, having placed himself at the head of the nation, devoted himself to the liberation of his people. On 28 February 1861, the papal Congregation of the Council issued a formal warning to the bishop, ordering him to leave the office of Cappellano Maiore, which he was holding on a temporary basis. On 9 July 1861, he was named Cappellano Maggiore by King Victor Emmanuele II, giving him jurisdiction over royal churches and chapels as well as army chaplains, independent of the authority of the archbishop of Naples. On 17 September 1861, Caputo was excommunicated by the Pope.
Around 1860, with permission of the Minister of the Interior of Tuscany, Baron Ricasoli, associations of liberal priests were authorized. The papal government, however, sensing the danger in organizations outside of their control, had the bishops suppress them, under threat of excommunication. In January 1861, when the archbishop of Naples was in exile, priests and laypeople in southern Italy formed a new association, the "Clerico-Liberal-Italian Association" (Adunanza clerico-liberale italiana), which, in the summer of 1862, claimed a membership of more than 4,000 persons. On 21 December 1861, Bishop Caputo became its Honorary President. The first point in the association's manifesto was that the pope should renounce his temporal pretensions.
Bishop Caputo died on 6 September 1862, unreconciled with the pope. His funeral took place at S. Franceco di Paola in Naples. The diocese of Ariano was without a bishop for the next nine years.
Diocesan Reorganization
Following the Second Vatican Council, and in accordance with the norms laid out in the council's decree, Christus Dominus chapter 40, Pope Paul VI ordered a reorganization of the ecclesiastical provinces in southern Italy. Pope Paul VI ordered consultations among the members of the Congregation of Bishops in the Vatican Curia, the Italian Bishops Conference, and the various dioceses concerned.
On 18 February 1984, the Vatican and the Italian State signed a new and revised concordat. Based on the revisions, a set of Normae was issued on 15 November 1984, which was accompanied in the next year, on 3 June 1985, by enabling legislation. According to the agreement, the practice of having one bishop govern two separate dioceses at the same time, aeque personaliter, was abolished. The Vatican continued consultations which had begun under Pope John XXIII for the merging of small dioceses, especially those with personnel and financial problems, into one combined diocese.
On 30 September 1986, Pope John Paul II ordered that the dioceses of Ariano and Laquedonia be merged into one diocese with one bishop, with the Latin title Dioecesis Arianensis Hirpina-Laquedoniensis. The seat of the diocese was to be in Ariano, and the cathedral of Ariano was to serve as the cathedral of the merged diocese. The cathedral in Laquedonia was to become a co-cathedral, and its cathedral Chapter was to be a Capitulum Concathedralis. There was to be only one diocesan Tribunal, in Ariano, and likewise one seminary, one College of Consultors, and one Priests' Council. The territory of the new diocese was to include the territory of the suppressed diocese of Laquedonia. The new diocese was to be a suffragan of the archdiocese of Benevento.
Chapter and cathedral
The cathedral of Ariano was dedicated to the Taking Up of the Body of the Virgin Mary into Heaven sub titulo Deiparae Virginis Assumptae. It contained the remains of Bishop Otto Frangipani, the patron of the city of Ariano. Special rituals are performed in the city on 13 March, the bishop's feast day. In 1512, Bishop Diomede Carafa reconsecrated the restored cathedral, and rededicated the restored episcopal palace.
The cathedral was administered by a corporate body called the Chapter, which consisted, in 1721, of five dignities (the Archdeacon, the Archpriest, the Primicerius Major, the Primicerius Minor, and the Treasurer) and fifteen canons. The office of archdeacon was a benefice that was reserved to the pope; the candidate was nominated by the Kings of Naples, and approved by the pope. Bishop Johannes (attested 1349–1356) increased the number of canons to twenty. Pope Alexander IV mentions in a document of 16 October 1255, that Bishop Jacobus had been Cantor of the cathedral before being elected bishop by the Chapter. In 1451, Bishop Orso Leone (1449–1456) created the office of Sacrista Major. In 1613, Bishop Ottavio Ridolfi (1612–1623) declared that when the next two canonries should become vacant, they should be assigned prebends and the should become the Canon Penitentiarius and the Canon Theologus, in accordance with the decree of the Council of Trent. In 1619, Paolo Emilio Riccio became the first Canon Penitentiary; and in 1622, Giovan Lorenzo Fiamengo became the first Canon Theologus. In 1748, there were five dignities and twenty canons.
Collegiate churches
In addition to the cathedral, the city of Ariano also had three collegiate churches, each of which was also a parish church. The Collegiate Church of S. Michele Arcangelo was presided over by the bishop, who was its abbot; he governed through an appointed Vicar Curate. The college of canons originally numbered five, but three were added later. The date of the foundation of the church is not known. It originally had a nave and two aisles, but due to the earthquake of 1732, it was restored by Bishop Tipaldi (1717–1748) with only the nave. The Collegiate Church of S. Pietro was governed by an abbot, along with five canons, to which were added two more in 1711, thanks to the generosity of cathedral Canon Orazio Memmoli. The Collegiate Church of S. Giovanni della Valle had originally been only a parish church. It was made a collegiate church in 1715, headed by a Provost (who had spiritual responsibility, and therefore had to be a priest) and six canons. After the earthquake of 1732, it was rebuilt on a somewhat larger scale than before.
Synods
A diocesan synod was an irregularly held, but important, meeting of the bishop of a diocese, his clergy, and other interested parties. Its purpose was (1) to proclaim generally the various decrees already issued by the bishop; (2) to discuss and ratify measures on which the bishop chose to consult with his clergy; (3) to publish statutes and decrees of the diocesan synod, of the provincial synod, and of the Holy See.
Bishop Alfonso Herrera, O.S.A. (1585–1602) held a diocesan synod in 1594, in which limits were imposed on regular clergy to hear confessions, and only with written permission of the parish priest. Arrangements were also made for financing the diocesan seminary, through the suppression of the parish of Ssmo. Salvatore and the assignation of some sixteen benefices in various churches.
Bishop Juan Bonilla, O. Carm. (1689–1696) attended the provincial synod, summoned by Cardinal Vinzenzo Maria Orsini, Archbishop of Benevento, held on 11–14 April 1693.
On 12 May 1668, Bishop Emmanuele Brancaccio, O.S.B. (1667–1686) presided over a diocesan synod held in the cathedral of Ariano.
Bishop Francesco Capezzuti (1838–1855) held a diocesan synod in the cathedral of Ariano on 14–16 May 1843.
Bishops of Ariano
to 1500
...
Bonifacius (attested 1039)
...
Meinardus (attested 1069–1080)
Ursus (attested 1087 or 1102)
...
Sarulo (1091–1096)
Gerardus (attested 1098)
...
Riccardus (attested 1122-1134)
Paganus (attested 1136)
...
Willelmus (attested 1164)
Bartholmaeus (attested 1179)
...
Rao (attested 1297–after 1301)
Rostagnus (attested 1309–1320)
Laurentius, O.Min. (1320– ? )
Robertus (c.1342–1349?)
Johannes (attested 1349–1356)
Tommaso (1356–1363)
Dionysius, O.E.S.A. (1364–1372)
Simon (1372–1373)
Dominicus, O.Carm. (1373– ? )
Geraldinus (1382–1390)
Lucas, O.S.B. (1390–1400) Roman Obedience
Donatus (1400–1406) Roman Obedience
Angelo de Raimo (1406–1432) Roman Obedience
Angelo Grassi (1433–1449)
Orso Leone (1449–1456)
Giacomo Porfida (1463–1480 Died)
Nicola Ippoliti (1480–1481 Appointed, Archbishop of Rossano)
Paolo Bracchi (1481–1497 Died)
1500 to 1986
Nicola Ippoliti (1498–1511 Died)
Diomede Carafa (1511–1560 Died)
Ottaviano Preconio, O.F.M. Conv. (1561–1562)
Donato Laurenti (1563–1584 Died)
Alfonso Herrera (bishop), O.S.A. (1585–1602 Died)
Vittorino Mansi, O.S.B. (1602–1611 Died)
Ottavio Ridolfi (1612–1623 Appointed, Bishop of Agrigento)
Paolo Cajatia (1624–1638 Died)
Andrés Aguado de Valdés, O.S.A. (1642–1645 Died)
Alessandro Rossi (1650–1656 Died)
Luis Morales (bishop), O.S.A. (1659–1667 Appointed, Bishop of Tropea)
Emmanuele Brancaccio, O.S.B. (1667–1686 Died)
Juan Bonilla (bishop), O. Carm. (1689–1696)
Giacinto della Calce, C.R. (1697–1715)
Filippo Tipaldi (1717–1748 Died)
Isidoro Sánchez de Luna, O.S.B. (1748–1754)
Domenico Saverio Pulci-Doria (1754–1777)
Lorenzo Potenza (1778–1792)
Giovanni Saverio Pirelli (1792–1803)
Sede vacante (1803–1818)
Domenico Russo (1818–1837)
Francesco Capezzuti (1838–1855)
Concezio Pasquini (1857–1858)
Michele Caputo, O.P. (1858–1862)
Sede vacante (1862–1871)
Luigi Maria Aguilar, B. (1871–1875)
Salvatore Maria Nisio, Sch. P. (1875–1876 Resigned)
Francesco Trotta (1876–1888)
Andrea d’Agostino, C.M. (1888–1913)
Giovanni Onorato Carcaterra, O.F.M. (1914–1915 Resigned)
Cosimo Agostino (1915–1918)
Giuseppe Lojacono (1918–1939 Resigned)
Gioacchino Pedicini (1939–1949 Appointed, Bishop of Avellino)
Pasquale Venezia (1951–1967 Appointed, Bishop of Avellino)
Agapito Simeoni (1974–1976 Died)
Nicola Agnozzi, O.F.M. Conv. (1976–1988 Retired)
Bishops of Ariano Irpino-Lacedonia
United on 30 September 1986 with the Diocese of Lacedonia
Antonio Forte, O.F.M. (1988–1993 Appointed, Bishop of Avellino)
Eduardo Davino (1993–1997 Appointed, Bishop of Palestrina)
Gennaro Pascarella (1998–2004 Appointed, Coadjutor Bishop of Pozzuoli)
Giovanni D'Alise (2004–2014 Appointed, Bishop of Caserta)
Sergio Melillo (23 May 2015 – )
See also
Roman Catholic Diocese of Lacedonia
Catholic Church in Italy
List of Catholic dioceses in Italy
Notes and references
Bibliography
Episcopal lists
Studies
Barberius, Fabius, Fabii Barberii ... Catalogus episcoporum Ariani sub Hispaniarum Regis nominatione vsq; ad præsens nostrum æuum anno 1635. . Neapoli: Typis F. Sauij, 1635.
Barberio, F. (2006). Catalogus episcoporum Ariani. Ariane 2006.
Esposito, L. (2016). "Ariano sacra nei suoi antichi documenti." . In: Quei maleteddi Normanni. Studi offerti a Errico Cuozzo. ed. Jean-Marie Martin, Rosanna Alaggio. Napoli: Centro Europei die Studi Normanni 2016.
Flammia, Nicola (1893). Storia della città di Ariano dalla sua origine sino all'anno 1893. Ariano di Puglia: Tipografia Marino, 1893.
Kamp, Norbert (1973). Kirche und Monarchie im staufischen Königreich Sizilien: Prosopographische Grundlegung ; Bistümer und Bischöfe des Königreichs 1194-1266. 1. . Münster: W. Fink, 1973. (pp. 223 ff.)
Kehr, Paul Fridolin (1962). Regesta pontificum Romanorum. Italia pontificia, Vol.IX: Samnium—Apulia—Lucania. ed. Walter Holtzmann. Berlin: Weidemann. pp. 137–139.
Massa, Paola (2014). "Vivere «secundum Langnobardorum legem» ad Ariano Irpino tra X e XII secolo." . In: Scrineum Rivista 11 (Firenze: Firenze UP 2014), pp. 1–124.
Mattei-Cerasoli, L. (1918), "Di alcuni vescovi poco noti," , in: Archivio storico per le provincie Napolitane XLIII (n.s. IV 1918), pp. 363–382.
Schiavo, Norma (2018). La chiesa di Ariano nel Medioevo e i suoi Santi Patroni. . Mnamon, 2018.
Vitale, Tommaso (1794). Storia della regia città di Ariano e sua diocesi. .Roma: Salomoni 1794.
External links
Catholic Encyclopedia (old edition)
Ariano
Ariano
Diocese
|
Lingua: An International Review of General Linguistics is a peer-reviewed academic journal covering general linguistics that was established in 1949. It is published by Elsevier and the editor-in-chief is Marta Dynel (University of Lodz).
History
In October 2015 the editors and editorial board resigned en masse to protest their inability to come to an agreement with Elsevier regarding fair pricing models for open access publishing. They subsequently started a new journal, Glossa, whereas Elsevier continued Lingua under new leadership.
Abstracting and indexing
The journal is abstracted and indexed in:
According to the Journal Citation Reports, the journal has a 2021 impact factor of 0.916.
References
External links
Linguistics journals
Elsevier academic journals
Academic journals established in 1949
English-language journals
Journals published between 13 and 25 times per year
Hybrid open access journals
|
```html
<html>
<body>
The inspection checks core API calls and reports calls with constant result (e.g. when operating on the same argument
where it supposed to be two different arguments).
</body>
</html>
```
|
```java
/**
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package io.pravega.test.system.framework.metronome.model.v1;
import io.pravega.test.system.framework.metronome.ModelUtils;
import lombok.Getter;
import lombok.Setter;
import java.util.List;
@Getter
@Setter
public class ActiveRun {
private String id;
private String jobId;
private String status;
private String createdAt;
private String completedAt;
private List<Task> tasks;
@Override
public String toString() {
return ModelUtils.toString(this);
}
}
```
|
```java
package com.base.adapter;
import android.content.Context;
import android.content.res.TypedArray;
import android.support.annotation.LayoutRes;
import android.support.v4.widget.SwipeRefreshLayout;
import android.support.v7.widget.DefaultItemAnimator;
import android.support.v7.widget.LinearLayoutManager;
import android.support.v7.widget.RecyclerView;
import android.util.AttributeSet;
import android.view.View;
import android.widget.FrameLayout;
import android.widget.LinearLayout;
import com.app.annotation.aspect.DbRealm;
import com.ui.main.R;
import java.util.List;
@SuppressWarnings("unchecked")
public class TRecyclerView<M> extends FrameLayout implements AdapterPresenter.IAdapterView {
private SwipeRefreshLayout swipeRefresh;
private RecyclerView recyclerview;
private LinearLayout ll_emptyView;
private LinearLayoutManager mLayoutManager;
public CoreAdapter<M> mCommAdapter;
private AdapterPresenter<M> mCoreAdapterPresenter;
private boolean isHasHeadView = false, isHasFootView = false, isEmpty = false, isReverse = false, needHint = false;
private int headType, footType;
public TRecyclerView(Context context) {
super(context);
init(context, null);
}
public TRecyclerView(Context context, boolean needHint) {
super(context);
this.needHint = needHint;
init(context, null);
}
public TRecyclerView(Context context, AttributeSet attrs) {
super(context, attrs);
init(context, attrs);
}
public TRecyclerView(Context context, AttributeSet attrs, int defStyle) {
super(context, attrs, defStyle);
init(context, attrs);
}
public AdapterPresenter getPresenter() {
return mCoreAdapterPresenter;
}
public void init(Context context, AttributeSet attrs) {
TypedArray ta = getContext().obtainStyledAttributes(attrs, R.styleable.TRecyclerView);
headType = ta.getResourceId(R.styleable.TRecyclerView_headType, 0);
int itemType = ta.getResourceId(R.styleable.TRecyclerView_itemType, 0);
footType = ta.getResourceId(R.styleable.TRecyclerView_footType, 0);
isReverse = ta.getBoolean(R.styleable.TRecyclerView_isReverse, false);
if (!needHint) needHint = ta.getBoolean(R.styleable.TRecyclerView_needHint, false);
boolean isRefreshable = ta.getBoolean(R.styleable.TRecyclerView_isRefreshable, true);
ta.recycle();
View layout = inflate(context, R.layout.layout_list_recyclerview, this);
swipeRefresh = (SwipeRefreshLayout) layout.findViewById(R.id.swiperefresh);
recyclerview = (RecyclerView) layout.findViewById(R.id.recyclerview);
ll_emptyView = (LinearLayout) layout.findViewById(R.id.ll_emptyview);
mCoreAdapterPresenter = new AdapterPresenter<>(this);
swipeRefresh.setColorSchemeResources(android.R.color.holo_blue_bright);
swipeRefresh.setOnRefreshListener(this::reFetch);
recyclerview.setHasFixedSize(true);
mLayoutManager = new LinearLayoutManager(context);
recyclerview.setLayoutManager(mLayoutManager);
recyclerview.setItemAnimator(new DefaultItemAnimator());
mCommAdapter = new CoreAdapter<>(needHint);
recyclerview.setAdapter(mCommAdapter);
recyclerview.addOnScrollListener(new RecyclerView.OnScrollListener() {
int lastVisibleItem;
@Override
public void onScrollStateChanged(RecyclerView recyclerView, int newState) {
super.onScrollStateChanged(recyclerView, newState);
if (recyclerview.getAdapter() != null
&& newState == RecyclerView.SCROLL_STATE_IDLE
&& lastVisibleItem + 1 == recyclerview.getAdapter()
.getItemCount() && mCommAdapter.isHasMore)
mCoreAdapterPresenter.fetch();
}
@Override
public void onScrolled(RecyclerView recyclerView, int arg0, int arg1) {
super.onScrolled(recyclerView, arg0, arg1);
lastVisibleItem = mLayoutManager.findLastVisibleItemPosition();
}
});
ll_emptyView.setOnClickListener((view -> {
isEmpty = false;
ll_emptyView.setVisibility(View.GONE);
swipeRefresh.setVisibility(View.VISIBLE);
reFetch();
}));
if (itemType != 0) setViewType(itemType);
swipeRefresh.setEnabled(isRefreshable);
if (isReverse) {
mLayoutManager.setStackFromEnd(true);//
mLayoutManager.setReverseLayout(true);//
recyclerview.setLayoutManager(mLayoutManager);
}
}
public TRecyclerView<M> setTypeSelector(TypeSelector mTypeSelector) {
this.mCommAdapter.setTypeSelector(mTypeSelector);
return this;
}
public TRecyclerView<M> setFootData(Object data) {
isHasFootView = footType != 0;
this.mCommAdapter.addFooterViewType(footType, data);
return this;
}
public TRecyclerView<M> setHeadData(Object data) {
isHasHeadView = headType != 0;
this.mCommAdapter.addHeadViewType(headType, data);
return this;
}
public void setViewType(@LayoutRes int type) {
this.mCommAdapter.setViewType(type);
}
public TRecyclerView<M> setData(List<M> data) {
reSetEmpty();
mCommAdapter.setBeans(data, 1);
return this;
}
public void reFetch() {
mCoreAdapterPresenter.setBegin(0);
swipeRefresh.setRefreshing(true);
mCoreAdapterPresenter.fetch();
}
@Override
public void setEmpty() {
if ((!isHasHeadView || isReverse && !isHasFootView) && !isEmpty) {
isEmpty = true;
ll_emptyView.setVisibility(View.VISIBLE);
swipeRefresh.setVisibility(View.GONE);
}
}
@DbRealm
public void setNetData(List data, int begin) {
swipeRefresh.setRefreshing(false);
mCommAdapter.setBeans(data, begin);
if ((begin == 1) && (data == null || data.size() == 0))
setEmpty();
else if (isReverse)
recyclerview.scrollToPosition(mCommAdapter.getItemCount() - data.size() - 2);
}
@Override
public void setDBData(List data) {
swipeRefresh.setRefreshing(false);
mCommAdapter.setBeans(data, -1);
if ((data == null || data.size() == 0))
setEmpty();
else if (isReverse)
recyclerview.scrollToPosition(mCommAdapter.getItemCount() - data.size() - 2);
}
@Override
public void reSetEmpty() {
if (isEmpty) {
ll_emptyView.setVisibility(View.GONE);
swipeRefresh.setVisibility(View.VISIBLE);
}
}
}
```
|
```html
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="utf-8">
<meta http-equiv="x-ua-compatible" content="ie=edge">
<meta name="viewport" content="width=device-width, initial-scale=1">
<title>Chromatic dispersion - Ray Optics Simulation</title>
<meta property="og:title" content="Chromatic dispersion - Ray Optics Simulation">
<meta property="og:type" content="website">
<meta property="og:url" content="path_to_url">
<meta property="og:image" content="path_to_url">
<meta property="og:description" content="A free, open-source web app for creating and simulating 2D geometric optical scenes.">
<meta property="og:locale" content="en">
<link rel="canonical" href="path_to_url">
<link rel="alternate" href="path_to_url" hreflang="en">
<link rel="alternate" href="path_to_url" hreflang="pl">
<link rel="alternate" href="path_to_url" hreflang="zh-CN">
<link rel="alternate" href="path_to_url" hreflang="zh-TW">
<link rel="stylesheet" href="../thirdparty/bootstrap-3.3.7/bootstrap.min.css">
<link rel="stylesheet" href="gallery.css">
<link rel="icon" href="../icon128.png" type="image/png">
</head>
<body>
<div class="navbar navbar-fixed-top container" style="background-color:white;max-height:90px;overflow:hidden">
<a href="path_to_url" class="navbar-left brand">
<img src="../icon128.png" alt="" style="width:18pt;height:18pt">
Ray Optics Simulation
</a>
<div class="navbar-right">
<span class="navul">
<a href="path_to_url">Home</a>
<a href="path_to_url" class="active">Gallery</a>
<a href="path_to_url">About</a>
</span>
<span class="github-button-container">
<a class="github-button" href="path_to_url" data-show-count="true" aria-label="Star ricktu288/ray-optics on GitHub">Star</a>
</span>
</div>
</div>
<div class="container">
<center>
<h1><b><span>Chromatic dispersion</span></b></h1>
<p>
Contributor: Yi-Ting Tu
</p>
<div class="description">
<p>This simulation demonstrates chromatic dispersion using a white-colored beam and a triangular prism. Here the white color is formed by mixing red, orange, yellow, green, cyan, blue, and violet colors.</p>
</div>
<p>
<a href="path_to_url#chromatic-dispersion" target="_blank" class="btn btn-success btn-lg">Open in Simulator</a>
</p>
<img src="chromatic-dispersion.png" alt="Chromatic dispersion" style="width:100%">
</center>
<div style="float: right; padding-top: 10px;">
<div class="dropup">
<button class="btn btn-default dropdown-toggle" type="button" data-toggle="dropdown">
<span id="language">Language: English</span>
<span class="caret"></span></button>
<ul class="dropdown-menu">
<li><a href="path_to_url">English</a></li><li><a href="path_to_url">polski</a></li><li><a href="path_to_url"></a></li><li><a href="path_to_url"></a></li>
</ul>
</div>
</div>
</div>
</div>
<script src="../thirdparty/jquery.min.js"></script>
<script src="../thirdparty/bootstrap-3.3.7/bootstrap.min.js"></script>
<script async defer src="path_to_url"></script>
<script src="path_to_url"></script>
<script id="MathJax-script" async src="path_to_url"></script>
</body>
</html>
```
|
```go
// Unless explicitly stated otherwise all files in this repository are licensed
// This product includes software developed at Datadog (path_to_url
//go:build linux_bpf
//nolint:revive // TODO(NET) Fix revive linter
package connection
import (
"io"
"unsafe"
"github.com/cilium/ebpf"
"github.com/davecgh/go-spew/spew"
manager "github.com/DataDog/ebpf-manager"
ddebpf "github.com/DataDog/datadog-agent/pkg/network/ebpf"
"github.com/DataDog/datadog-agent/pkg/network/ebpf/probes"
"github.com/DataDog/datadog-agent/pkg/network/tracer/offsetguess"
"github.com/DataDog/datadog-agent/pkg/util/log"
)
//nolint:revive // TODO(NET) Fix revive linter
func dumpMapsHandler(w io.Writer, manager *manager.Manager, mapName string, currentMap *ebpf.Map) {
switch mapName {
case "connectsock_ipv6": // maps/connectsock_ipv6 (BPF_MAP_TYPE_HASH), key C.__u64, value uintptr // C.void*
io.WriteString(w, "Map: '"+mapName+"', key: 'C.__u64', value: 'uintptr // C.void*'\n")
iter := currentMap.Iterate()
var key uint64
var value uintptr // C.void*
for iter.Next(unsafe.Pointer(&key), unsafe.Pointer(&value)) {
spew.Fdump(w, key, value)
}
case probes.TracerStatusMap: // maps/tracer_status (BPF_MAP_TYPE_HASH), key C.__u64, value tracerStatus
io.WriteString(w, "Map: '"+mapName+"', key: 'C.__u64', value: 'tracerStatus'\n")
iter := currentMap.Iterate()
var key uint64
var value offsetguess.TracerStatus
for iter.Next(unsafe.Pointer(&key), unsafe.Pointer(&value)) {
spew.Fdump(w, key, value)
}
case probes.ConntrackStatusMap: // maps/conntrack_status (BPF_MAP_TYPE_HASH), key C.__u64, value conntrackStatus
io.WriteString(w, "Map: '"+mapName+"', key: 'C.__u64', value: 'conntrackStatus'\n")
iter := currentMap.Iterate()
var key uint64
var value offsetguess.ConntrackStatus
for iter.Next(unsafe.Pointer(&key), unsafe.Pointer(&value)) {
spew.Fdump(w, key, value)
}
case probes.ConntrackMap: // maps/conntrack (BPF_MAP_TYPE_HASH), key ConnTuple, value ConnTuple
io.WriteString(w, "Map: '"+mapName+"', key: 'ConnTuple', value: 'ConnTuple'\n")
iter := currentMap.Iterate()
var key ddebpf.ConnTuple
var value ddebpf.ConnTuple
for iter.Next(unsafe.Pointer(&key), unsafe.Pointer(&value)) {
spew.Fdump(w, key, value)
}
case probes.ConntrackTelemetryMap: // maps/conntrack_telemetry (BPF_MAP_TYPE_ARRAY), key C.u32, value conntrackTelemetry
io.WriteString(w, "Map: '"+mapName+"', key: 'C.u32', value: 'conntrackTelemetry'\n")
var zero uint64
telemetry := &ddebpf.ConntrackTelemetry{}
if err := currentMap.Lookup(unsafe.Pointer(&zero), unsafe.Pointer(telemetry)); err != nil {
log.Tracef("error retrieving the contrack telemetry struct: %s", err)
}
spew.Fdump(w, telemetry)
case probes.ConnMap: // maps/conn_stats (BPF_MAP_TYPE_HASH), key ConnTuple, value ConnStatsWithTimestamp
io.WriteString(w, "Map: '"+mapName+"', key: 'ConnTuple', value: 'ConnStatsWithTimestamp'\n")
iter := currentMap.Iterate()
var key ddebpf.ConnTuple
var value ddebpf.ConnStats
for iter.Next(unsafe.Pointer(&key), unsafe.Pointer(&value)) {
spew.Fdump(w, key, value)
}
case probes.TCPStatsMap: // maps/tcp_stats (BPF_MAP_TYPE_HASH), key ConnTuple, value TCPStats
io.WriteString(w, "Map: '"+mapName+"', key: 'ConnTuple', value: 'TCPStats'\n")
iter := currentMap.Iterate()
var key ddebpf.ConnTuple
var value ddebpf.TCPStats
for iter.Next(unsafe.Pointer(&key), unsafe.Pointer(&value)) {
spew.Fdump(w, key, value)
}
case probes.ConnCloseBatchMap: // maps/conn_close_batch (BPF_MAP_TYPE_HASH), key C.__u32, value batch
io.WriteString(w, "Map: '"+mapName+"', key: 'C.__u32', value: 'batch'\n")
iter := currentMap.Iterate()
var key uint32
var value ddebpf.Batch
for iter.Next(unsafe.Pointer(&key), unsafe.Pointer(&value)) {
spew.Fdump(w, key, value)
}
case "udp_recv_sock": // maps/udp_recv_sock (BPF_MAP_TYPE_HASH), key C.__u64, value C.udp_recv_sock_t
io.WriteString(w, "Map: '"+mapName+"', key: 'C.__u64', value: 'C.udp_recv_sock_t'\n")
iter := currentMap.Iterate()
var key uint64
var value ddebpf.UDPRecvSock
for iter.Next(unsafe.Pointer(&key), unsafe.Pointer(&value)) {
spew.Fdump(w, key, value)
}
case "udpv6_recv_sock": // maps/udpv6_recv_sock (BPF_MAP_TYPE_HASH), key C.__u64, value C.udp_recv_sock_t
io.WriteString(w, "Map: '"+mapName+"', key: 'C.__u64', value: 'C.udp_recv_sock_t'\n")
iter := currentMap.Iterate()
var key uint64
var value ddebpf.UDPRecvSock
for iter.Next(unsafe.Pointer(&key), unsafe.Pointer(&value)) {
spew.Fdump(w, key, value)
}
case probes.PortBindingsMap: // maps/port_bindings (BPF_MAP_TYPE_HASH), key portBindingTuple, value C.__u8
io.WriteString(w, "Map: '"+mapName+"', key: 'portBindingTuple', value: 'C.__u8'\n")
iter := currentMap.Iterate()
var key ddebpf.PortBinding
var value uint8
for iter.Next(unsafe.Pointer(&key), unsafe.Pointer(&value)) {
spew.Fdump(w, key, value)
}
case probes.UDPPortBindingsMap: // maps/udp_port_bindings (BPF_MAP_TYPE_HASH), key portBindingTuple, value C.__u8
io.WriteString(w, "Map: '"+mapName+"', key: 'portBindingTuple', value: 'C.__u8'\n")
iter := currentMap.Iterate()
var key ddebpf.PortBinding
var value uint8
for iter.Next(unsafe.Pointer(&key), unsafe.Pointer(&value)) {
spew.Fdump(w, key, value)
}
case "pending_bind": // maps/pending_bind (BPF_MAP_TYPE_HASH), key C.__u64, value C.bind_syscall_args_t
io.WriteString(w, "Map: '"+mapName+"', key: 'C.__u64', value: 'C.bind_syscall_args_t'\n")
iter := currentMap.Iterate()
var key uint64
var value ddebpf.BindSyscallArgs
for iter.Next(unsafe.Pointer(&key), unsafe.Pointer(&value)) {
spew.Fdump(w, key, value)
}
case probes.TelemetryMap: // maps/telemetry (BPF_MAP_TYPE_ARRAY), key C.u32, value kernelTelemetry
io.WriteString(w, "Map: '"+mapName+"', key: 'C.u32', value: 'kernelTelemetry'\n")
var zero uint64
telemetry := &ddebpf.Telemetry{}
if err := currentMap.Lookup(unsafe.Pointer(&zero), unsafe.Pointer(telemetry)); err != nil {
// This can happen if we haven't initialized the telemetry object yet
// so let's just use a trace log
log.Tracef("error retrieving the telemetry struct: %s", err)
}
spew.Fdump(w, telemetry)
}
}
```
|
The Arhopalini are a rather small tribe of butterflies in the family Lycaenidae.
Genera
As not all Theclinae have been assigned to tribes, the following list of genera is preliminary:
Apporasa
Arhopala
Flos
Keraunogramma
Mahathala
Mota
Ogyris
Semanga
Surendra
Thaduka
Zinaspa
References
Theclinae
Butterfly tribes
|
West Virginia Route 99 is an east–west state highway in southern West Virginia. The western terminus of the route is at West Virginia Route 85 northeast of Kopperston in the rural southeast corner of Boone County. The eastern terminus is at West Virginia Route 3 in Glen Daniel.
The section of WV 99 west of Bolt was constructed after 1968. Most of this stretch, approximately the westernmost , is built in a nearly continuous series of cuts in the side of Guyandotte Mountain.
Major intersections
References
099
Transportation in Boone County, West Virginia
Transportation in Raleigh County, West Virginia
Transportation in Wyoming County, West Virginia
|
```xml
/*
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
import iterHacoversin = require( './index' );
/**
* Returns an iterator protocol-compliant object.
*
* @returns iterator protocol-compliant object
*/
function iterator() {
return {
'next': next
};
}
/**
* Implements the iterator protocol `next` method.
*
* @returns iterator protocol-compliant object
*/
function next() {
return {
'value': true,
'done': false
};
}
// TESTS //
// The function returns an iterator...
{
iterHacoversin( iterator() ); // $ExpectType Iterator
}
// The compiler throws an error if the function is provided a first argument which is not an iterator protocol-compliant object...
{
iterHacoversin( '5' ); // $ExpectError
iterHacoversin( 5 ); // $ExpectError
iterHacoversin( true ); // $ExpectError
iterHacoversin( false ); // $ExpectError
iterHacoversin( null ); // $ExpectError
iterHacoversin( undefined ); // $ExpectError
iterHacoversin( [] ); // $ExpectError
iterHacoversin( {} ); // $ExpectError
iterHacoversin( ( x: number ): number => x ); // $ExpectError
}
// The compiler throws an error if the function is provided insufficient arguments...
{
iterHacoversin(); // $ExpectError
}
```
|
```html
<!-- begin header.html -->
<!--
The OpenGL Extension Wrangler Library
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* The name of the author may be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
THE POSSIBILITY OF SUCH DAMAGE.
-->
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "path_to_url">
<html>
<head>
<title>GLEW: The OpenGL Extension Wrangler Library</title>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<link href="glew.css" type="text/css" rel="stylesheet">
</head>
<body bgcolor="#fff0d0">
<table border="0" width="100%" cellpadding="12" cellspacing="8" style="height:100%">
<tr>
<td bgcolor="#ffffff" align="left" valign="top" width="200">
<table border="0" width="100%" cellpadding="0" cellspacing="0" align="left">
<tr>
<td valign="top">
<table border="0" width="100%" cellpadding="0" cellspacing="0" align="left">
<tr><td align="center"><i>Latest Release: <a href="path_to_url">2.1.0</a></i></td></tr>
<tr><td align="center"><br></td></tr>
<tr><td align="center"><img src="./glew.png" alt="GLEW Logo" width="97" height="75"></td></tr>
<tr><td align="center"><br></td></tr>
<tr><td align="center">
<table border="0" cellpadding="0" cellspacing="0" align="center">
<tr><td align="center"><a href="index.html">Download</a></td></tr>
<tr><td align="center"><a href="basic.html">Usage</a></td></tr>
<tr><td align="center"><a href="build.html">Building</a></td></tr>
<tr><td align="center"><a href="install.html">Installation</a></td></tr>
<tr><td align="center"><a href="advanced.html">Source Generation</a></td></tr>
<tr><td align="center">Change Log</td></tr>
<tr><td align="center"><br></tr>
<tr><td align="center"><a href="path_to_url">GitHub</a></td></tr>
<tr><td align="center"><a href="path_to_url">Issues</a></td></tr>
<tr><td align="center"><a href="path_to_url">Pull Requests</a></td></tr>
<tr><td align="center"><a href="path_to_url#authors">Authors</a></td></tr>
<tr><td align="center"><a href="path_to_url#copyright-and-licensing">Licensing</a></td></tr>
<tr><td align="center"><br></tr>
<tr><td align="center"><a href="path_to_url">SourceForge Page</a></td></tr>
</table>
<tr><td align="center"><br></tr>
</table>
</td>
</tr>
<tr>
<td valign="bottom">
<table border="0" width="100%" cellpadding="5" cellspacing="0" align="left">
<tr><td align="center"><i>Last Update: 07-31-17</i></td></tr>
<tr><td align="center">
<a href="path_to_url"><img src="./ogl_sm.jpg" width="68" height="35" border="0" alt="OpenGL Logo"></a><br/>
<a href="path_to_url"><img src="github.png" width="70" height="29" border="0" alt="GitHub Logo"></a><br/>
<a href="path_to_url"><img src="travis.png" width="114" height="25" border="0" alt="Travis Logo"></a><br/>
<a href="path_to_url"><img src="path_to_url" width="88" height="31" border="0" alt="SourceForge Logo"></a>
</td>
</tr>
</table>
</td>
</tr>
</table>
</td>
<td bgcolor="#ffffff" align="left" valign="top">
<h1>The OpenGL Extension Wrangler Library</h1>
<!-- end header.html -->
<h2>Change Log</h2>
<hr align="center">
<ul class="none">
<li><b>2.1.0</b> [07-31-17]
<ul>
<li> Enhancements:
<ul>
<li> OpenGL 4.6 support added
<li> Improved Mac OSX build support
<li> Improved cmake build support
</ul>
</ul>
<ul>
<li> Bug fixes:
<ul>
<li> Resovled crash when glXGetCurrentDisplay() is NULL
<li> CMake: only install PDB files with MSVC
<li> wglGetProcAddress crash with NOGDI defined
<li> Mac: using -Os rather than -O2
</ul>
</ul>
<ul>
<li> New extensions:
<ul>
<li> GL_AMD_gpu_shader_half_float
<li> GL_AMD_shader_ballot
<li> GL_ARB_gl_spirv
<li> GL_EGL_KHR_context_flush_control
<li> GL_INTEL_conservative_rasterization
<li> GL_MESA_shader_integer_functions
<li> GL_NVX_blend_equation_advanced_multi_draw_buffers
<li> GL_NV_gpu_multicast
<li> EGL_ARM_implicit_external_sync
<li> EGL_EXT_gl_colorspace_bt2020_linear
<li> EGL_EXT_gl_colorspace_bt2020_pq
<li> EGL_EXT_gl_colorspace_scrgb_linear
<li> EGL_EXT_image_dma_buf_import_modifiers
<li> EGL_EXT_pixel_format_float
<li> EGL_EXT_surface_SMPTE2086_metadata
<li> EGL_KHR_context_flush_control
<li> EGL_KHR_no_config_context
<li> EGL_KHR_stream_attrib
<li> EGL_MESA_platform_surfaceless
<li> EGL_NV_stream_cross_display
<li> EGL_NV_stream_cross_object
<li> EGL_NV_stream_cross_partition
<li> EGL_NV_stream_cross_process
<li> EGL_NV_stream_cross_system
<li> EGL_NV_stream_fifo_next
<li> EGL_NV_stream_fifo_synchronous
<li> EGL_NV_stream_frame_limits
<li> EGL_NV_stream_remote
<li> EGL_NV_stream_reset
<li> EGL_NV_stream_socket
<li> EGL_NV_stream_socket_inet
<li> EGL_NV_stream_socket_unix
<li> WGL_EXT_colorspace
</ul>
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>2.0.0</b> [07-24-16]
<ul>
<li> Enhancements:
<ul>
<li> Forward context support added
<li> OSMesa support added
<li> EGL support added
<li> MX support discontinued
<li> Improved cmake build support
</ul>
</ul>
<ul>
<li> New extensions:
<ul>
<li> GL_AMD_shader_explicit_vertex_parameter
<li> GL_ARB_gl_spirv
<li> GL_EGL_NV_robustness_video_memory_purge
<li> GL_EXT_window_rectangles
<li> GL_INTEL_conservative_rasterization
<li> GL_KHR_texture_compression_astc_sliced_3d
<li> GL_MESA_shader_integer_functions
<li> GL_NVX_blend_equation_advanced_multi_draw_buffers
<li> GL_NVX_linked_gpu_multicast
<li> GL_NV_clip_space_w_scaling
<li> GL_NV_command_list
<li> GL_NV_conservative_raster_pre_snap_triangles
<li> GL_NV_draw_vulkan_image
<li> GL_NV_gpu_multicast
<li> GL_NV_robustness_video_memory_purge
<li> GL_NV_shader_atomic_float64
<li> GL_NV_stereo_view_rendering
<li> GL_NV_viewport_swizzle
<li> GLX_EXT_libglvnd
<li> GLX_NV_robustness_video_memory_purge
</ul>
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.13.0</b> [08-10-15]
<ul>
<li> Enhancements:
<ul>
<li> glxewInit, wglewInit
<li> glewinfo adds support for -version, -profile core|compatibility and -flag debug|forward parameters
<li> Improved cmake build support
</ul>
</ul>
<ul>
<li> New extensions:
<ul>
<li> GL_ARB_ES3_2_compatibility
<li> GL_ARB_fragment_shader_interlock
<li> GL_ARB_gpu_shader_int64
<li> GL_ARB_parallel_shader_compile
<li> GL_ARB_post_depth_coverage
<li> GL_ARB_sample_locations
<li> GL_ARB_shader_atomic_counter_ops
<li> GL_ARB_shader_ballot
<li> GL_ARB_shader_clock
<li> GL_ARB_shader_viewport_layer_array
<li> GL_ARB_sparse_texture2
<li> GL_ARB_sparse_texture_clamp
<li> GL_ARB_texture_filter_minmax
<li> GL_INTEL_framebuffer_CMAA
<li> GL_KHR_no_error
<li> GL_NV_conservative_raster_dilate
<li> GL_OVR_multiview
<li> GL_OVR_multiview2
</ul>
<li> <a href="path_to_url">Bug fixes</a>
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.12.0</b> [01-26-15]
<ul>
<li> New extensions:
<ul>
<li> GL_EXT_polygon_offset_clamp
<li> GL_EXT_post_depth_coverage
<li> GL_EXT_raster_multisample
<li> GL_EXT_sparse_texture2
<li> GL_EXT_texture_filter_minmax
<li> GL_NV_conservative_raster
<li> GL_NV_fill_rectangle
<li> GL_NV_fragment_coverage_to_color
<li> GL_NV_fragment_shader_interlock
<li> GL_NV_framebuffer_mixed_samples
<li> GL_NV_geometry_shader_passthrough
<li> GL_NV_internalformat_sample_query
<li> GL_NV_sample_locations
<li> GL_NV_sample_mask_override_coverage
<li> GL_NV_shader_atomic_fp16_vector
<li> GL_NV_uniform_buffer_unified_memory
<li> GL_NV_viewport_array2
</ul>
<li> <a href="path_to_url">Bug fixes</a>
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.11.0</b> [08-11-14]
<ul>
<li> New features:
<ul>
<li> Support for OpenGL 4.5
</ul>
<li> New extensions:
<ul>
<li> GL_AMD_gcn_shader
<li> GL_AMD_gpu_shader_int64
<li> GL_AMD_occlusion_query_event
<li> GL_AMD_shader_atomic_counter_ops
<li> GL_AMD_shader_stencil_value_export
<li> GL_AMD_transform_feedback4
<li> GL_ARB_ES3_1_compatibility
<li> GL_ARB_clip_control
<li> GL_ARB_conditional_render_inverted
<li> GL_ARB_cull_distance
<li> GL_ARB_derivative_control
<li> GL_ARB_direct_state_access
<li> GL_ARB_get_texture_sub_image
<li> GL_ARB_pipeline_statistics_query
<li> GL_ARB_shader_texture_image_samples
<li> GL_ARB_sparse_buffer
<li> GL_ARB_texture_barrier
<li> GL_ARB_transform_feedback_overflow_query
<li> GL_EXT_debug_label
<li> GL_EXT_shader_image_load_formatted
<li> GL_EXT_shader_integer_mix
<li> GL_INTEL_fragment_shader_ordering
<li> GL_INTEL_performance_query
<li> GL_KHR_blend_equation_advanced
<li> GL_KHR_blend_equation_advanced_coherent
<li> GL_KHR_context_flush_control
<li> GL_KHR_robust_buffer_access_behavior
<li> GL_KHR_robustness
<li> GL_KHR_texture_compression_astc_hdr
<li> GL_NV_bindless_multi_draw_indirect_count
<li> GL_NV_shader_atomic_int64
<li> GL_NV_shader_thread_group
<li> GL_NV_shader_thread_shuffle
<li> GL_REGAL_proc_address
<li> GLX_ARB_context_flush_control
<li> GLX_EXT_stereo_tree
<li> GLX_MESA_query_renderer
<li> GLX_NV_copy_buffer
<li> GLX_NV_delay_before_swap
<li> WGL_ARB_context_flush_control
<li> WGL_NV_delay_before_swap
</ul>
<li> <a href="path_to_url">Bug fixes</a>
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.10.0</b> [07-22-13]
<ul>
<li> New features:
<ul>
<li> Support for OpenGL 4.4
</ul>
<li> New extensions:
<ul>
<li> GL_AMD_interleaved_elements
<li> GL_AMD_shader_trinary_minmax
<li> GL_AMD_sparse_texture
<li> GL_ANGLE_depth_texture
<li> GL_ANGLE_framebuffer_blit
<li> GL_ANGLE_framebuffer_multisample
<li> GL_ANGLE_instanced_arrays
<li> GL_ANGLE_pack_reverse_row_order
<li> GL_ANGLE_program_binary
<li> GL_ANGLE_texture_compression_dxt1
<li> GL_ANGLE_texture_compression_dxt3
<li> GL_ANGLE_texture_compression_dxt5
<li> GL_ANGLE_texture_usage
<li> GL_ANGLE_timer_query
<li> GL_ANGLE_translated_shader_source
<li> GL_ARB_bindless_texture
<li> GL_ARB_buffer_storage
<li> GL_ARB_clear_texture
<li> GL_ARB_compute_variable_group_size
<li> GL_ARB_enhanced_layouts
<li> GL_ARB_indirect_parameters
<li> GL_ARB_multi_bind
<li> GL_ARB_query_buffer_object
<li> GL_ARB_seamless_cubemap_per_texture
<li> GL_ARB_shader_draw_parameters
<li> GL_ARB_shader_group_vote
<li> GL_ARB_sparse_texture
<li> GL_ARB_texture_mirror_clamp_to_edge
<li> GL_ARB_texture_stencil8
<li> GL_ARB_vertex_type_10f_11f_11f_rev
<li> GL_INTEL_map_texture
<li> GL_NVX_conditional_render
<li> GL_NV_bindless_multi_draw_indirect
<li> GL_NV_blend_equation_advanced
<li> GL_NV_compute_program5
<li> GL_NV_deep_texture3D
<li> GL_NV_draw_texture
<li> GL_NV_shader_atomic_counters
<li> GL_NV_shader_storage_buffer_object
<li> GL_REGAL_ES1_0_compatibility
<li> GL_REGAL_ES1_1_compatibility
<li> GL_REGAL_enable
<li> GLX_EXT_buffer_age
<li> WGL_ARB_robustness_application_isolation
<li> WGL_ARB_robustness_share_group_isolation
</ul>
<li> <a href="path_to_url">Bug fixes</a>
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.9.0</b> [08-06-12]
<ul>
<li> New features:
<ul>
<li> Support for OpenGL 4.3 -
<a href="path_to_url">specification</a>,
<a href="path_to_url">overview</a>.
</ul>
<li> New extensions:
<ul>
<li> GL_ARB_ES3_compatibility
<li> GL_ARB_clear_buffer_object
<li> GL_ARB_compute_shader
<li> GL_ARB_copy_image
<li> GL_ARB_explicit_uniform_location
<li> GL_ARB_fragment_layer_viewport
<li> GL_ARB_framebuffer_no_attachments
<li> GL_ARB_internalformat_query2
<li> GL_ARB_multi_draw_indirect
<li> GL_ARB_program_interface_query
<li> GL_ARB_robust_buffer_access_behavior
<li> GL_ARB_robustness_application_isolation
<li> GL_ARB_robustness_share_group_isolation
<li> GL_ARB_shader_image_size
<li> GL_ARB_shader_storage_buffer_object
<li> GL_ARB_stencil_texturing
<li> GL_ARB_texture_buffer_range
<li> GL_ARB_texture_query_levels
<li> GL_ARB_texture_storage_multisample
<li> GL_ARB_texture_view
<li> GL_ARB_vertex_attrib_binding
<li> GL_EXT_debug_marker
<li> GL_KHR_debug
<li> GL_REGAL_error_string
<li> GL_REGAL_extension_query
<li> GL_REGAL_log
<li> GLX_ARB_robustness_application_isolation
<li> GLX_ARB_robustness_share_group_isolation
<li> GLX_EXT_create_context_es_profile
<li> WGL_EXT_create_context_es_profile
</ul>
<li> Bug fixes:
<ul>
<li> Not using GLU library for Makefile builds.
</ul>
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.8.0</b> [07-17-12]
<ul>
<li> New extensions:
<ul>
<li> GL_AMD_pinned_memory
<li> GL_AMD_query_buffer_object
<li> GL_AMD_stencil_operation_extended
<li> GL_AMD_vertex_shader_layer
<li> GL_AMD_vertex_shader_viewport_index
<li> GL_NV_bindless_texture
<li> GL_NV_shader_atomic_float
<li> GLX_EXT_swap_control_tear
<li> WGL_EXT_swap_control_tear
<li> WGL_NV_DX_interop2
</ul>
<li> Bug fixes:
<ul>
<li> MS Visual Studio 2010 projects added
<li> GLX_NV_video_out replaces GLX_NV_video_output
<li> ANSI C prototype for glewInit
<li> Improved CentOS build support
<li> Improved GL_ARB_gpu_shader_fp64 support
<li> ARB_texture_compression_bptc and ARB_copy_buffer constants
<li> Linux needs to define GLEW_STATIC for static library builds
<li> Custom code generation problem resolved
<li> GLEWAPIENTRY added to glew.h for calling convention customization
<li> Correction for glPathStencilDepthOffsetNV
<li> Resolve OSX gcc warnings
<li> Added build support for NetBSD
</ul>
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.7.0</b> [08-26-11]
<ul>
<li> New features:
<ul>
<li> Support for OpenGL 4.2
</ul>
<li> New extensions:
<ul>
<li> GL_AMD_multi_draw_indirect
<li> GL_ARB_base_instance
<li> GL_ARB_compressed_texture_pixel_storage
<li> GL_ARB_conservative_depth
<li> GL_ARB_internalformat_query
<li> GL_ARB_map_buffer_alignment
<li> GL_ARB_shader_atomic_counters
<li> GL_ARB_shader_image_load_store
<li> GL_ARB_shading_language_420pack
<li> GL_ARB_shading_language_packing
<li> GL_ARB_texture_storage
<li> GL_ARB_transform_feedback_instanced
<li> GL_EXT_framebuffer_multisample_blit_scaled
<li> GL_NV_path_rendering
<li> GL_NV_path_rendering
<li> GLX_MESA_swap_control
</ul>
<li> Bug fixes:
<ul>
<li> const qualifiers for GL 1.4 MultiDrawArrays, MultiDrawElements
<li> Add glGetGraphicsResetStatusARB to GL_ARB_robustness
<li> Remove EXT suffix from GL_KTX_buffer_region entry points
<li> Solaris needs inttypes.h
<li> Add ERROR_INVALID_VERSION_ARB and ERROR_INVALID_PROFILE_ARB to WGL_ARB_create_context
<li> Add GLX_MESA_swap_control
<li> Set -install_name for OSX
<li> Add 64-bit darwin build option (SYSTEM=darwin_x86-64)
<li> Add GL_NV_path_rendering
</ul>
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.6.0</b> [04-27-11]
<ul>
<li> New extensions:
<ul>
<li> GL_AMD_blend_minmax_factor
<li> GL_AMD_sample_positions
<li> GL_EXT_x11_sync_object
<li> GL_NV_texture_multisample
<li> GL_NV_video_capture
<li> GLX_NV_video_capture
<li> WGL_NV_DX_interop
<li> WGL_NV_video_capture
</ul>
<li> Bug fixes:
<ul>
<li> Define GLEW_NO_GLU for no glu dependency.
<li> mx suffix for GLEW MX libraries, build both libraries by default.
<li> Cygwin build improvements
<li> Soname of GLEWmx shared libraries
<li> Query GL extension string only once
<li> GLX_OML_sync_control no longer requires C99
<li> glDraw*InstancedARB moved from GL_ARB_draw_instanced to GL_ARB_instanced_arrays
<li> glFramebufferTextureLayerEXT moved from GL_EXT_geometry_shader4 to GL_EXT_texture_array
<li> Fixes for BSD build
</ul>
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.5.8</b> [01-31-11]
<ul>
<li> New extensions:
<ul>
<li> GL_AMD_depth_clamp_separate
<li> GL_EXT_texture_sRGB_decode
</ul>
<li> Bug fixes:
<ul>
<li> Borland C++ fix for __int64
<li> GL_DOUBLE_MATNxM enumerants for OpenGL 4.0
<li> Correction to glGetTransformFeedbackVarying
<li> Correction to glSecondaryColorPointer
<li> Corrections to glGetVertexAttribPointerv and glGetShaderSource
<li> Switched code repository from svn to git
</ul>
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.5.7</b> [11-03-10]
<ul>
<li> New extension:
<ul>
<li> GL_NVX_gpu_memory_info
</ul>
<li> Bug fixes:
<ul>
<li> Improved mingw32 build support
<li> Improved cygwin build support
<li> glGetPointervEXT fix
<li> Add GLEW_VERSION_1_2_1
</ul>
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.5.6</b> [09-07-10]
<ul>
<li> New features:
<ul>
<li> Support for OpenGL 4.1
</ul>
<li> New extensions:
<ul>
<li> GL_ARB_ES2_compatibility
<li> GL_ARB_cl_event
<li> GL_ARB_debug_output
<li> GL_ARB_get_program_binary
<li> GL_ARB_robustness
<li> GL_ARB_separate_shader_objects
<li> GL_ARB_shader_precision
<li> GL_ARB_shader_stencil_export
<li> GL_ARB_vertex_attrib_64bit
<li> GL_ARB_viewport_array
<li> GLX_ARB_create_context_robustness
<li> GLX_EXT_create_context_es2_profile
<li> WGL_ARB_create_context_robustness
<li> WGL_EXT_create_context_es2_profile
</ul>
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.5.5</b> [07-13-10]
<ul>
<li> New extensions:
<ul>
<li> GL_AMD_debug_output
<li> GL_AMD_name_gen_delete
<li> GL_AMD_transform_feedback3_lines_triangles
<li> GL_NV_multisample_coverage
<li> GL_NV_vdpau_interop
<li> GLX_AMD_gpu_association
<li> GLX_NV_multisample_coverage
<li> WGL_NV_multisample_coverage
</ul>
<li> Bug fixes:
<ul>
<li> Compilation issue with GLX_SGI_video_sync
<li> OpenGL 4.0 double-precision uniform functions added
<li> Constness of glPointParameterfvARB and glPointParameterfvEXT
<li> Added glVertexAttribDivisor
<li> Compilation issue with Nvidia GLX headers
</ul>
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.5.4</b> [04-21-10]
<ul>
<li> New features:
<ul>
<li> Support for OpenGL 3.3
<li> Support for OpenGL 4.0
</ul>
<li> New extensions:
<ul>
<li> GL_AMD_conservative_depth
<li> GL_ARB_blend_func_extended
<li> GL_ARB_draw_indirect
<li> GL_ARB_explicit_attrib_location
<li> GL_ARB_gpu_shader5
<li> GL_ARB_gpu_shader_fp64
<li> GL_ARB_occlusion_query2
<li> GL_ARB_sampler_objects
<li> GL_ARB_shader_bit_encoding
<li> GL_ARB_shader_subroutine
<li> GL_ARB_shading_language_include
<li> GL_ARB_tessellation_shader
<li> GL_ARB_texture_buffer_object_rgb32
<li> GL_ARB_texture_compression_bptc
<li> GL_ARB_texture_rgb10_a2ui
<li> GL_ARB_texture_swizzle
<li> GL_ARB_timer_query
<li> GL_ARB_transform_feedback2
<li> GL_ARB_transform_feedback3
<li> GL_ARB_vertex_type_2_10_10_10_rev
<li> GL_EXT_shader_image_load_store
<li> GL_EXT_vertex_attrib_64bit
<li> GL_NV_gpu_program5
<li> GL_NV_gpu_program_fp64
<li> GL_NV_gpu_shader5
<li> GL_NV_tessellation_program5
<li> GL_NV_vertex_attrib_integer_64bit
<li> GLX_ARB_vertex_buffer_object
</ul>
<li> Bug fixes:
<ul>
<li> Parameter constness fix for glPointParameteriv and glPointParameterfv
</ul>
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.5.3</b> [02-28-10]
<ul>
<li> New extensions:
<ul>
<li> GLX_INTEL_swap_event
<li> GL_AMD_seamless_cubemap_per_texture
<li> GL_AMD_shader_stencil_export
</ul>
<li> Bug fixes:
<ul>
<li> Correct version detection for GL 3.1 and 3.2
<li> Missing 3.1 enumerants
<li> Add glew.pc
</ul>
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.5.2</b> [12-31-09]
<ul>
<li> New features:
<ul>
<li> Support for OpenGL 3.1
<li> Support for OpenGL 3.2
</ul>
<li> New extensions:
<ul>
<li> GL_AMD_draw_buffers_blend
<li> GL_AMD_performance_monitor
<li> GL_AMD_texture_texture4
<li> GL_AMD_vertex_shader_tessellator
<li> GL_APPLE_aux_depth_stencil
<li> GL_APPLE_object_purgeable
<li> GL_APPLE_rgb_422
<li> GL_APPLE_row_bytes
<li> GL_APPLE_vertex_program_evaluators
<li> GL_ARB_compatibility
<li> GL_ARB_copy_buffer
<li> GL_ARB_depth_clamp
<li> GL_ARB_draw_buffers_blend
<li> GL_ARB_draw_elements_base_vertex
<li> GL_ARB_fragment_coord_conventions
<li> GL_ARB_provoking_vertex
<li> GL_ARB_sample_shading
<li> GL_ARB_seamless_cube_map
<li> GL_ARB_shader_texture_lod
<li> GL_ARB_sync
<li> GL_ARB_texture_cube_map_array
<li> GL_ARB_texture_gather
<li> GL_ARB_texture_multisample
<li> GL_ARB_texture_query_lod
<li> GL_ARB_uniform_buffer_object
<li> GL_ARB_vertex_array_bgra
<li> GL_ATI_meminfo
<li> GL_EXT_provoking_vertex
<li> GL_EXT_separate_shader_objects
<li> GL_EXT_texture_snorm
<li> GL_NV_copy_image
<li> GL_NV_parameter_buffer_object2
<li> GL_NV_shader_buffer_load
<li> GL_NV_texture_barrier
<li> GL_NV_transform_feedback2
<li> GL_NV_vertex_buffer_unified_memory
<li> WGL_AMD_gpu_association
<li> WGL_ARB_create_context_profile
<li> WGL_NV_copy_image
<li> GLX_ARB_create_context_profile
<li> GLX_EXT_swap_control
<li> GLX_NV_copy_image
</ul>
<li> Bug fixes:
<ul>
<li> DOS line endings for windows .zip archives only.
<li> glTransformFeedbackVaryings arguments.
<li> Resource leak in glewinfo and visualinfo tools.
<li> WIN32_LEAN_AND_MEAN preprocessor pollution.
<li> Fixed version detection for GLEW_VERSION_2_1 and GLEW_VERSION_3_0.
<li> MesaGLUT glut.h GLAPIENTRY dependency.
<li> glFramebufferTextureLayer correction.
<li> OSX compiler warnings resolved.
<li> Cygwin linking to opengl32 by default, rather than X11 OpenGL.
<li> SnowLeopard (OSX 10.6) gl.h detection.
<li> Use $(STRIP) consistently.
</ul>
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.5.1</b> [11-03-08]
<ul>
<li> New features:
<ul>
<li> Support for OpenGL 3.0
</ul>
<li> New extensions:
<ul>
<li> GL_ARB_depth_buffer_float
<li> GL_ARB_draw_instance,
<li> GL_ARB_framebuffer_object
<li> GL_ARB_framebuffer_sRGB
<li> GL_ARB_geometry_shader4
<li> GL_ARB_half_float_pixel
<li> GL_ARB_half_float_vertex
<li> GL_ARB_instanced_arrays
<li> GL_ARB_map_buffer_range
<li> GL_ARB_texture_buffer_object
<li> GL_ARB_texture_compression_rgtc
<li> GL_ARB_vertex_array_object
<li> GL_EXT_direct_state_access
<li> GL_EXT_texture_swizzle
<li> GL_EXT_transform_feedback
<li> GL_EXT_vertex_array_bgra
<li> GL_NV_conditional_render
<li> GL_NV_explicit_multisample
<li> GL_NV_present_video
<li> GL_SGIS_point_line_texgen
<li> GL_SGIX_convolution_accuracy
<li> WGL_ARB_create_context
<li> WGL_ARB_framebuffer_sRGB
<li> WGL_NV_present_video
<li> WGL_NV_swap_group
<li> WGL_NV_video_output
<li> GLX_ARB_create_context
<li> GLX_ARB_framebuffer_sRGB
<li> GLX_NV_present_video
<li> GLX_NV_swap_group
<li> GLX_NV_video_output
</ul>
<li> Bug fixes:
<ul>
<li> Licensing issues with documentation
<li> Problems with long long and _MSC_VER on MINGW
<li> Incorrect parameter for glGetUniformLocation
<li> glewGetExtension fails on last entry
<li> Incomplete GL_NV_texture_shader tokens
<li> Scripting problems on Cygwin
<li> Incorrect definition for GLint on OS X
</ul>
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.5.0</b> [12-27-07]
<ul>
<li> New features:
<ul>
<li> Licensing change (BSD, Mesa 3-D, Khronos)
<li> Switch to using registry on <a href="path_to_url">www.opengl.org</a>
<li> Support for major and minor version strings
</ul>
<li> New extensions:
<ul>
<li> GL_APPLE_flush_buffer_range
<li> GL_GREMEDY_frame_terminator
<li> GLX_EXT_texture_from_pixmap
</ul>
<li> Bug fixes:
<ul>
<li> Incorrent 64-bit type definitions
<li> Do not strip static library on install
<li> Missing tokens in GL_ATI_fragment_shader and WGL_{ARB,EXT}_make_current_read
<li> Missing tokens in GL_VERSION_2_1
<li> Missing functions in GL_VERSION_1_4
<li> Incorrect parameter type for glXCopyContext
</ul>
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.4.0</b> [04-27-07]
<ul>
<li> New features:
<ul>
<li> Extension variables are declared const to avoid possible
corruption of their values
</ul>
<li> New extensions:
<ul>
<li> GL_NV_depth_range_unclamped
</ul>
<li> Bug fixes:
<ul>
<li> Incorrect tokens in GL_NV_transform_feedback and GL_NV_framebuffer_multisample_coverage
<li> Incorrect function names in GL_EXT_gpu_program_parameters
<li> Missing tokens in GL_EXT_framebuffer_multisample
<li> GLEW_MX initialization problem for WGL_{ARB,EXT}_extensions_string
</ul>
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.3.6</b> [03-04-07]
<ul>
<li> New extensions:
<ul>
<li> GL_ATI_shader_texture_lod
<li> GL_EXT_gpu_program_parameters
<li> GL_NV_geometry_shader4
<li> WGL_NV_gpu_affinity
<li> GLX_SGIX_hyperpipe
</ul>
<li> Bug fixes:
<ul>
<li> Missing include guards in glxew.h
<li> Makefile and install problems for Cygwin builds
<li> Install problem for Linux AMD64 builds
<li> Incorrent token in GL_ATI_texture_compression_3dc
<li> Missing tokens from GL_ATIX_point_sprites
</ul>
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.3.5</b> [11-21-06]
<ul>
<li> New features:
<ul>
<li> Support for core OpenGL 2.1
<li> Debug support for glewIsSupported
</ul>
<li> New extensions:
<ul>
<li> GL_EXT_bindable_uniform
<li> GL_EXT_draw_buffers2
<li> GL_EXT_draw_instanced
<li> GL_EXT_framebuffer_sRGB
<li> GL_EXT_geometry_shader4
<li> GL_EXT_gpu_shader4
<li> GL_EXT_packed_float
<li> GL_EXT_texture_array
<li> GL_EXT_texture_buffer_object
<li> GL_EXT_texture_compression_latc
<li> GL_EXT_texture_compression_rgtc
<li> GL_EXT_texture_integer
<li> GL_EXT_texture_shared_exponent
<li> GL_EXT_timer_query
<li> GL_NV_depth_buffer_float
<li> GL_NV_fragment_program4
<li> GL_NV_framebuffer_multisample_coverage
<li> GL_NV_geometry_program4
<li> GL_NV_gpu_program4
<li> GL_NV_parameter_buffer_object
<li> GL_NV_transform_feedback
<li> GL_NV_vertex_program4
<li> GL_OES_byte_coordinates
<li> GL_OES_compressed_paletted_texture
<li> GL_OES_read_format
<li> GL_OES_single_precision
<li> WGL_EXT_pixel_format_packed_float
<li> WGL_EXT_framebuffer_sRGB
<li> GLX_EXT_fbconfig_packed_float
<li> GLX_EXT_framebuffer_sRGB
</ul>
<li> Bug fixes:
<ul>
<li> Wrong GLXContext definition on Solaris
<li> Makefile problem for parallel builds
</ul>
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.3.4</b> [03-04-06]
<ul>
<li> New extensions:
<ul>
<li> GL_EXT_framebuffer_blit
<li> GL_EXT_framebuffer_multisample
<li> GL_EXT_packed_depth_stencil
<li> GL_MESAX_texture_stack
<li> WGL_3DL_stereo_control
</ul>
</ul>
<ul>
<li> Bug fixes:
<ul>
<li> glBlendEquation missing from GL_ARB_imaging
<li> Wrong APIENTRY definition for Cygwin
<li> Incorrect OS X OpenGL types
<li> Unix 64-bit installation patch
</ul>
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.3.3</b> [05-16-05]
<ul>
<li> New feature:
<ul>
<li> Code generation option to split source into multiple files
</ul>
</ul>
<ul>
<li> Bug fixes:
<ul>
<li> OpenGL 2.0 core initialization problems
<li> Wrong value for token GL_SHADER_TYPE
<li> Missing tokens in GL_ATI_fragment_shader
<li> Missing entry points in GL_ARB_transpose_matrix
</ul>
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.3.2</b> [03-16-05]
<ul>
<li> New extension:
<ul>
<li> GL_APPLE_pixel_buffer
</ul>
<li> Bug fixes:
<ul>
<li> Missing OpenGL 2.0 entry points
<li> Missing tokens in GL_SGIX_shadow
<li> MinGW makefile problem
<li> Check for incorrect OpenGL version string on SiS hardware
<li> Documentation update to meet the HTML 4.01 Transitional specification
</ul>
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.3.1</b> [02-02-05]
<ul>
<li> New features:
<ul>
<li> Consistent Unix and Windows versioning
</ul>
<li> New extensions:
<ul>
<li> GL_EXT_framebuffer_object
<li> GL_ARB_pixel_buffer_object
</ul>
<li> Bug fixes:
<ul>
<li> Missing OpenGL 2.0 tokens
<li> Incorrect typedefs (GLhandleARB and GLhalf)
<li> Borland compiler problems
</ul>
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.3.0</b> [01-04-05]
<ul>
<li> New features:
<ul>
<li> Support for core OpenGL 2.0
<li> <tt>glewIsSupported</tt> provides efficient string-based extension checks
<li> Custom code generation from a list of extensions
<li> Makefile changes
</ul>
<li> New extensions:
<ul>
<li> WGL_ATI_render_texture_rectangle
</ul>
<li> Bug fixes:
<ul>
<li> Incorrect function signature in OpenGL 1.5 core
</ul>
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.2.5</b> [12-06-04]
<ul>
<li> New extensions:
<ul>
<li>GL_ATI_texture_compression_3dc
<li>GL_EXT_Cg_shader
<li>GL_EXT_draw_range_elements
<li>GL_KTX_buffer_region
</ul>
<li> Bug fixes:
<ul>
<li> OpenGL version detection bug
<li> Problems with wxWindows and MinGW compilation
<li> <tt>visualinfo</tt> compilation problem with GLEW_MX specified
<li> Wrong token name in OpenGL 1.5 core
</ul>
<li> Support for FreeBSD
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.2.4</b> [09-06-04]
<ul>
<li> Added ARB_draw_buffers and ARB_texture_rectangle
<li> Fixed bug in ARB_shader_objects
<li> Replaced <tt>wglinfo</tt> with <tt>visualinfo</tt>
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.2.3</b> [06-10-04]
<ul>
<li> Added GL_NV_fragment_program2, GL_NV_fragment_program_option, GL_NV_vertex_program2_option, GL_NV_vertex_program3
<li> Bug fix in GL_ARB_vertex_blend
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.2.2</b> [05-08-04]
<ul>
<li> Added GL_EXT_pixel_buffer_object, removed GL_NV_element_array
<li> Fixed GLEW_MX problems
<li> Bug fix in GL_EXT_texture_rectangle and <tt>wglinfo</tt>
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.2.1</b> [03-18-04]
<ul>
<li> Bug fix in OpenGL version query (early release of 1.2.0 contained this bug)
<li> Bug fix in GL_ARB_shader_objects and temporary bug fix in GL_ARB_vertex_shader
<li> Added flags on GDI support and multisampling to <tt>wglinfo</tt>
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.2.0</b> [02-19-04]
<ul>
<li> Added full OpenGL 1.5 support
<li> Added support for multiple rendering contexts with different capabilities
<li> Added command line flags to <tt>glewinfo</tt> for selecting displays and visuals
<li> Added GLX_SGIS_multisample, GLX_SUN_video_resize, and GL_SUN_read_video_pixels
<li> Added MinGW/MSYS support
<li> Bug fixes in GL_ARB_shader_objects and the OS X build
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.1.4</b> [12-15-03]
<ul>
<li> Added GL_APPLE_float_pixels, GL_APPLE_texture_range,
GL_EXT_texture_cube_map, GL_EXT_texture_edge_clamp,
GLX_ATI_pixel_format_float, and GLX_ATI_render_texture
<li> Bug fixes in GL_ATI_map_object_buffer and GL_ATI_fragment_shader
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.1.3</b> [10-28-03]
<ul>
<li> Added Solaris and Darwin support
<li> Added GL_ARB_fragment_shader, GL_ARB_shader_objects, and GL_ARB_vertex_shader
<li> Fixed bug in GL_WIN_swap_hint
<li> Removed <tt>glewinfo</tt>'s dependency on <tt>GLUT</tt>
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.1.2</b> [09-15-03]
<ul>
<li> Removed dependency on WGL_{ARB,EXT}_extensions_string to make GLEW run on Matrox cards
<li> Added glewGetString for querying the GLEW version string
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.1.1</b> [08-11-03]
<ul>
<li> Added GLX_NV_float_buffer, GL_ARB_shading_language_100, and GL_ARB_texture_non_power_of_two
<li> Fixed bug in GL_ARB_vertex_buffer_object
<li> Minor updates in documentation
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.1.0</b> [07-08-03]
<ul>
<li> Added automatic code generation
<li> Added almost every extension in the registry
<li> Added separate namespace
<li> Added Irix support
<li> Updated documentation
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.0.7</b> [06-29-03]
<ul>
<li> Added GL_EXT_depth_bounds_test
<li> Fixed typos
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.0.6</b> [05-05-03]
<ul>
<li> Added ARB_vertex_buffer_object and NV_half_float
<li> Updated <tt>wglinfo</tt>
<li> Temporary Linux bug fixes (problems with SDL and MESA)
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.0.5</b> [02-17-03]
<ul>
<li> Bug fixes
<li> Added <tt>wglinfo</tt>
<li> Updated documentation
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.0.4</b> [02-02-03]
<ul>
<li> Added NV_texture_expand_normal
<li> Added mingw support
<li> Updated documentation
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.0.3</b> [01-09-03]
<ul>
<li> Cleaned up ATI extensions
<li> Changed function prototypes to match glext.h
<li> Added EXT_texture3D
<li> Fixed typos in ATI_vertex_attrib_array_object and ATI_draw_buffers
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.0.2</b> [12-21-02]
<ul>
<li> Added list of supported extensions to documentation
<li> Added NV_half_float and NV_texgen_emboss
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.0.1</b> [12-17-02]
<ul>
<li> Bug fixes
<li> Added glewGetExtension
</ul>
</ul>
<hr align="center">
<ul class="none">
<li><b>1.0.0</b> [12-12-02]
<ul>
<li> Initial release
</ul>
</ul>
<hr align="center">
<!-- begin footer.html -->
</td></tr></table></body>
<!-- end footer.html -->
```
|
Anchialus Glacier (, ) is the 8.5 km long and 3.4 km wide glacier in Sostra Heights on the east side of northern Sentinel Range in Ellsworth Mountains, Antarctica. It is situated north of lower Embree Glacier, east of Sabazios Glacier, south of lower Newcomer Glacier and northwest of Vit Ice Piedmont. The glacier drains the northeast slopes of Mount Malone and the west slopes of Bracken Peak, flows northwards and joins Newcomer Glacier east of Mount Lanning.
The glacier is named after the ancient town of Anchialus in Southeastern Bulgaria.
Location
Anchialus Glacier is centred at . US mapping in 1961.
See also
List of glaciers in the Antarctic
Glaciology
Maps
Newcomer Glacier. Scale 1:250 000 topographic map. Reston, Virginia: US Geological Survey, 1961.
Antarctic Digital Database (ADD). Scale 1:250000 topographic map of Antarctica. Scientific Committee on Antarctic Research (SCAR). Since 1993, regularly updated.
References
Anchialus Glacier SCAR Composite Gazetteer of Antarctica
Bulgarian Antarctic Gazetteer. Antarctic Place-names Commission. (details in Bulgarian, basic data in English)
External links
Anchialus Glacier. Copernix satellite image
Glaciers of Ellsworth Land
Bulgaria and the Antarctic
|
The 2010–11 NOJHL season is the 33rd season of the Northern Ontario Junior Hockey League (NOJHL). The eight teams of the East and West Divisions will play 50-game schedules.
Come February, the top teams of each division will play down for the Copeland-McNamara Trophy, the NOJHL championship. The winner of the Copeland-McNamara Trophy will compete in the Central Canadian Junior "A" championship, the Dudley Hewitt Cup. If successful against the winners of the Ontario Junior Hockey League and Superior International Junior Hockey League, the champion would then move on to play in the Canadian Junior Hockey League championship, the 2011 Royal Bank Cup.
Changes
No major changes.
Current Standings
Note: GP = Games played; W = Wins; L = Losses; OTL = Overtime losses; SL = Shootout losses; GF = Goals for; GA = Goals against; PTS = Points; x = clinched playoff berth; y = clinched division title; z = clinched conference title
Standings listed on official league website.
2010-11 Copeland-McNamara Trophy Playoffs
Playoff results are listed on the official league website.
Dudley Hewitt Cup Championship
Hosted by the Huntsville Otters in Huntsville, Ontario. The Soo Eagles finished in third place.
Round Robin
Huntsville Otters (OJHL) 6 - Soo Eagles 4
Wellington Dukes (OJHL) 7 - Soo Eagles 1
Soo Eagles 2 - Wisconsin Wilderness (SIJHL) 1 in quadruple overtime
Semi-final
Wellington Dukes (OJHL) 3 - Soo Eagles 2 in quadruple overtime
Scoring leaders
Note: GP = Games played; G = Goals; A = Assists; Pts = Points; PIM = Penalty minutes
Leading goaltenders
Note: GP = Games played; Mins = Minutes played; W = Wins; L = Losses: OTL = Overtime losses; SL = Shootout losses; GA = Goals Allowed; SO = Shutouts; GAA = Goals against average
Award winners
Player of the Year: Brett Campbell (Blind River Beavers)
Best Defenceman: Joel Gagnon (Sudbury Jr. Wolves)
Most Improved Player: Darnell Koosees (North Bay Trappers)
Mitch Tetreault Memorial Trophy (Top Defensive Forward): Jake Wright (Soo Thunderbirds)
NOJHL Award (Top Goaltender): Michael Doan, Remo Febbraro (Soo Thunderbirds)
Wayne Chase Memorial Award (Best GAA): Michael Doan (Soo Thunderbirds)
Jimmy Conners Memorial Trophy (Scoring Champion): Andre Leclair (Temiscaming Royals)
Carlo Cattarello Trophy (Most Valuable Player): Jerry Petingalo (Soo Thunderbirds)
John Grignon Trophy (Top Rookie): Erik Robichaud (Abitibi Eskimos)
Onaping Falls Huskies Trophy (Most Gentlemanly): Joshua Clancy (Abitibi Eskimos)
Best Team Player: Brett Campbell (Blind River Beavers)
Scholastic Player of the Year: Geoff Gieni (Soo Thunderbirds)
Playoffs Most Valuable Player: Jake Paterson (Soo Eagles)
Mirl "Red" McCarthy Memorial Trophy (Top Coach): Bruno Bragagnolo (Soo Eagles)
Joe Drago Trophy (Top Executive): Chris Dawson (North Bay Trappers)
See also
2011 Royal Bank Cup
Dudley Hewitt Cup
List of NOHA Junior A seasons
Ontario Junior Hockey League
Superior International Junior Hockey League
Greater Ontario Junior Hockey League
References
External links
Official website of the Northern Ontario Junior Hockey League
Official website of the Canadian Junior Hockey League
NOJHL
Northern Ontario Junior Hockey League seasons
|
```java
/*
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package org.apache.carbondata.processing.loading.sort.unsafe;
import java.io.DataOutputStream;
import java.io.IOException;
import org.apache.carbondata.core.memory.IntPointerBuffer;
import org.apache.carbondata.core.memory.MemoryBlock;
import org.apache.carbondata.core.memory.MemoryException;
import org.apache.carbondata.core.memory.UnsafeMemoryManager;
import org.apache.carbondata.core.memory.UnsafeSortMemoryManager;
import org.apache.carbondata.core.util.ReUsableByteArrayDataOutputStream;
import org.apache.carbondata.processing.loading.row.IntermediateSortTempRow;
import org.apache.carbondata.processing.loading.sort.SortStepRowHandler;
import org.apache.carbondata.processing.sort.SortTempRowUpdater;
import org.apache.carbondata.processing.sort.sortdata.TableFieldStat;
/**
* It can keep the data of prescribed size data in offheap/onheap memory and returns it when needed
*/
public class UnsafeCarbonRowPage {
private IntPointerBuffer buffer;
private int lastSize;
private long sizeToBeUsed;
private MemoryBlock dataBlock;
private MemoryManagerType managerType;
private String taskId;
private TableFieldStat tableFieldStat;
private SortStepRowHandler sortStepRowHandler;
private boolean convertNoSortFields;
private SortTempRowUpdater sortTempRowUpdater;
private boolean isSaveToDisk;
private int[] changedDataFieldOrder;
public UnsafeCarbonRowPage(TableFieldStat tableFieldStat, MemoryBlock memoryBlock,
String taskId, boolean isSaveToDisk) {
this.tableFieldStat = tableFieldStat;
this.sortStepRowHandler = new SortStepRowHandler(tableFieldStat);
this.taskId = taskId;
buffer = new IntPointerBuffer(this.taskId);
this.dataBlock = memoryBlock;
// TODO Only using 98% of space for safe side.May be we can have different logic.
sizeToBeUsed = dataBlock.size() - (dataBlock.size() * 5) / 100;
this.managerType = MemoryManagerType.UNSAFE_MEMORY_MANAGER;
this.sortTempRowUpdater = tableFieldStat.getSortTempRowUpdater();
this.isSaveToDisk = isSaveToDisk;
this.changedDataFieldOrder = tableFieldStat.getChangedDataFieldOrder();
}
public int addRow(Object[] row,
ReUsableByteArrayDataOutputStream reUsableByteArrayDataOutputStream)
throws MemoryException, IOException {
int size = addRow(getConvertedRow(row), dataBlock
.getBaseOffset() + lastSize, reUsableByteArrayDataOutputStream);
buffer.set(lastSize);
lastSize = lastSize + size;
return size;
}
private Object[] getConvertedRow(Object[] row) {
if (changedDataFieldOrder != null && changedDataFieldOrder.length == row.length) {
Object[] convertedRow = new Object[row.length];
for (int i = 0; i < row.length; i++) {
convertedRow[i] = row[changedDataFieldOrder[i]];
}
return convertedRow;
}
return row;
}
/**
* add raw row as intermidiate sort temp row to page
*
* @param row
* @param address
* @return
*/
private int addRow(Object[] row, long address,
ReUsableByteArrayDataOutputStream reUsableByteArrayDataOutputStream)
throws MemoryException, IOException {
return sortStepRowHandler
.writeRawRowAsIntermediateSortTempRowToUnsafeMemory(row, dataBlock.getBaseObject(), address,
reUsableByteArrayDataOutputStream, dataBlock.size() - lastSize, dataBlock.size());
}
/**
* get one row from memory address
* @param address address
* @return one row
*/
public IntermediateSortTempRow getRow(long address) {
if (convertNoSortFields) {
IntermediateSortTempRow intermediateSortTempRow = sortStepRowHandler
.readRowFromMemoryWithNoSortFieldConvert(dataBlock.getBaseObject(), address);
this.sortTempRowUpdater.updateSortTempRow(intermediateSortTempRow);
return intermediateSortTempRow;
} else {
return sortStepRowHandler
.readFromMemoryWithoutNoSortFieldConvert(dataBlock.getBaseObject(), address);
}
}
/**
* write a row to stream
* @param address address of a row
* @param stream stream
* @throws IOException
*/
public void writeRow(long address, DataOutputStream stream) throws IOException, MemoryException {
sortStepRowHandler.writeIntermediateSortTempRowFromUnsafeMemoryToStream(
dataBlock.getBaseObject(), address, stream, dataBlock.size() - lastSize, dataBlock.size());
}
public void freeMemory() {
switch (managerType) {
case UNSAFE_MEMORY_MANAGER:
UnsafeMemoryManager.INSTANCE.freeMemory(taskId, dataBlock);
break;
default:
UnsafeSortMemoryManager.INSTANCE.freeMemory(taskId, dataBlock);
buffer.freeMemory();
}
}
public IntPointerBuffer getBuffer() {
return buffer;
}
public int getUsedSize() {
return lastSize;
}
public boolean canAdd() {
return lastSize < sizeToBeUsed;
}
public MemoryBlock getDataBlock() {
return dataBlock;
}
public TableFieldStat getTableFieldStat() {
return tableFieldStat;
}
public void setNewDataBlock(MemoryBlock newMemoryBlock) {
this.dataBlock = newMemoryBlock;
this.managerType = MemoryManagerType.UNSAFE_SORT_MEMORY_MANAGER;
}
public enum MemoryManagerType {
UNSAFE_MEMORY_MANAGER, UNSAFE_SORT_MEMORY_MANAGER
}
public void setReadConvertedNoSortField() {
this.convertNoSortFields = true;
}
public void makeCanAddFail() {
this.lastSize = (int) sizeToBeUsed;
}
public boolean isSaveToDisk() {
return this.isSaveToDisk;
}
}
```
|
Monte Moir (born September 10, 1958) is an American songwriter, producer and musician best known as the keyboardist of Morris Day's band The Time and songwriter of many notable American artists.
Biography
Monte Moir is the original and current keyboardist for The Time, as well as a songwriter and producer for Janet Jackson, Alexander O'Neal, Gladys Knight, as well as the duo Deja (Curt Jones & Starleana Young). He is also credited for working with Prince, Vanity 6, Deniece Williams, Thelma Houston, Steven Dante, Lolly Pop, Precious Wilson and various other artists.
Some of his greatest writing successes were writing the first side of Alexander O'Neal's solo debut – including "If You Were Here Tonight" and "The Pleasure Principle' by Janet Jackson. Patti Austin and Thelma Houston are other notable artists he wrote classics for as part of Jimmy Jam and Terry Lewis's 'The Secret'. Monte is something of a cult writing figure in the world of soulful music. "In My Life" by Ruby Turner as well as Steven Dante's "It's Only Love" are key examples of his songwriting.
He left The Time soon after Jam and Lewis were released by Prince, following conflicting writing interests with The SOS Band and failing to make a concert. However, he rejoined The Time for their Pandemonium album and Prince's film Graffiti Bridge, in the late 1980s when the original Time members reunited.
Moir continues to compose his own material and produce for various artists. He was credited on Rihanna's 2016 Billboard number one hit "Work" and most recently surfaced at the 2020 Grammy Award Salute To Prince.
References
External links
MySpace site
All Music – Credits
Discography on Discogs
American funk keyboardists
Living people
American rhythm and blues musicians
The Original 7ven members
Musicians from Minneapolis
1958 births
|
The following is a partial list of unnumbered trans-Neptunian objects for principal designations assigned within 1999. As of April 2022, it contains a total of 94 bodies. For more information see the description on the main page. Also see list for the previous and next year.
1999
References
Lists of trans-Neptunian objects
|
was a Japanese politician of the Democratic Party of Japan. He was Minister of Agriculture.
He lost his seat in the 16 December 2012 general election.
Kano was born in Yamagata. He graduated from Gakushuin University.
After period of illness, Michihiko Kano died on 21 October 2021 in a hospital in Yamagata City; he was 79.
References
1942 births
2021 deaths
Ministers of Agriculture, Forestry and Fisheries of Japan
Democratic Party of Japan politicians
Politicians from Yamagata Prefecture
Gakushuin University alumni
21st-century Japanese politicians
People from Yamagata (city)
|
```go
/*
path_to_url
Unless required by applicable law or agreed to in writing, software
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
// Code generated by client-gen. DO NOT EDIT.
package fake
import (
"context"
v1beta1 "k8s.io/api/certificates/v1beta1"
v1 "k8s.io/apimachinery/pkg/apis/meta/v1"
labels "k8s.io/apimachinery/pkg/labels"
schema "k8s.io/apimachinery/pkg/runtime/schema"
types "k8s.io/apimachinery/pkg/types"
watch "k8s.io/apimachinery/pkg/watch"
testing "k8s.io/client-go/testing"
)
// FakeCertificateSigningRequests implements CertificateSigningRequestInterface
type FakeCertificateSigningRequests struct {
Fake *FakeCertificatesV1beta1
}
var certificatesigningrequestsResource = schema.GroupVersionResource{Group: "certificates.k8s.io", Version: "v1beta1", Resource: "certificatesigningrequests"}
var certificatesigningrequestsKind = schema.GroupVersionKind{Group: "certificates.k8s.io", Version: "v1beta1", Kind: "CertificateSigningRequest"}
// Get takes name of the certificateSigningRequest, and returns the corresponding certificateSigningRequest object, and an error if there is any.
func (c *FakeCertificateSigningRequests) Get(ctx context.Context, name string, options v1.GetOptions) (result *v1beta1.CertificateSigningRequest, err error) {
obj, err := c.Fake.
Invokes(testing.NewRootGetAction(certificatesigningrequestsResource, name), &v1beta1.CertificateSigningRequest{})
if obj == nil {
return nil, err
}
return obj.(*v1beta1.CertificateSigningRequest), err
}
// List takes label and field selectors, and returns the list of CertificateSigningRequests that match those selectors.
func (c *FakeCertificateSigningRequests) List(ctx context.Context, opts v1.ListOptions) (result *v1beta1.CertificateSigningRequestList, err error) {
obj, err := c.Fake.
Invokes(testing.NewRootListAction(certificatesigningrequestsResource, certificatesigningrequestsKind, opts), &v1beta1.CertificateSigningRequestList{})
if obj == nil {
return nil, err
}
label, _, _ := testing.ExtractFromListOptions(opts)
if label == nil {
label = labels.Everything()
}
list := &v1beta1.CertificateSigningRequestList{ListMeta: obj.(*v1beta1.CertificateSigningRequestList).ListMeta}
for _, item := range obj.(*v1beta1.CertificateSigningRequestList).Items {
if label.Matches(labels.Set(item.Labels)) {
list.Items = append(list.Items, item)
}
}
return list, err
}
// Watch returns a watch.Interface that watches the requested certificateSigningRequests.
func (c *FakeCertificateSigningRequests) Watch(ctx context.Context, opts v1.ListOptions) (watch.Interface, error) {
return c.Fake.
InvokesWatch(testing.NewRootWatchAction(certificatesigningrequestsResource, opts))
}
// Create takes the representation of a certificateSigningRequest and creates it. Returns the server's representation of the certificateSigningRequest, and an error, if there is any.
func (c *FakeCertificateSigningRequests) Create(ctx context.Context, certificateSigningRequest *v1beta1.CertificateSigningRequest, opts v1.CreateOptions) (result *v1beta1.CertificateSigningRequest, err error) {
obj, err := c.Fake.
Invokes(testing.NewRootCreateAction(certificatesigningrequestsResource, certificateSigningRequest), &v1beta1.CertificateSigningRequest{})
if obj == nil {
return nil, err
}
return obj.(*v1beta1.CertificateSigningRequest), err
}
// Update takes the representation of a certificateSigningRequest and updates it. Returns the server's representation of the certificateSigningRequest, and an error, if there is any.
func (c *FakeCertificateSigningRequests) Update(ctx context.Context, certificateSigningRequest *v1beta1.CertificateSigningRequest, opts v1.UpdateOptions) (result *v1beta1.CertificateSigningRequest, err error) {
obj, err := c.Fake.
Invokes(testing.NewRootUpdateAction(certificatesigningrequestsResource, certificateSigningRequest), &v1beta1.CertificateSigningRequest{})
if obj == nil {
return nil, err
}
return obj.(*v1beta1.CertificateSigningRequest), err
}
// UpdateStatus was generated because the type contains a Status member.
// Add a +genclient:noStatus comment above the type to avoid generating UpdateStatus().
func (c *FakeCertificateSigningRequests) UpdateStatus(ctx context.Context, certificateSigningRequest *v1beta1.CertificateSigningRequest, opts v1.UpdateOptions) (*v1beta1.CertificateSigningRequest, error) {
obj, err := c.Fake.
Invokes(testing.NewRootUpdateSubresourceAction(certificatesigningrequestsResource, "status", certificateSigningRequest), &v1beta1.CertificateSigningRequest{})
if obj == nil {
return nil, err
}
return obj.(*v1beta1.CertificateSigningRequest), err
}
// Delete takes name of the certificateSigningRequest and deletes it. Returns an error if one occurs.
func (c *FakeCertificateSigningRequests) Delete(ctx context.Context, name string, opts v1.DeleteOptions) error {
_, err := c.Fake.
Invokes(testing.NewRootDeleteAction(certificatesigningrequestsResource, name), &v1beta1.CertificateSigningRequest{})
return err
}
// DeleteCollection deletes a collection of objects.
func (c *FakeCertificateSigningRequests) DeleteCollection(ctx context.Context, opts v1.DeleteOptions, listOpts v1.ListOptions) error {
action := testing.NewRootDeleteCollectionAction(certificatesigningrequestsResource, listOpts)
_, err := c.Fake.Invokes(action, &v1beta1.CertificateSigningRequestList{})
return err
}
// Patch applies the patch and returns the patched certificateSigningRequest.
func (c *FakeCertificateSigningRequests) Patch(ctx context.Context, name string, pt types.PatchType, data []byte, opts v1.PatchOptions, subresources ...string) (result *v1beta1.CertificateSigningRequest, err error) {
obj, err := c.Fake.
Invokes(testing.NewRootPatchSubresourceAction(certificatesigningrequestsResource, name, pt, data, subresources...), &v1beta1.CertificateSigningRequest{})
if obj == nil {
return nil, err
}
return obj.(*v1beta1.CertificateSigningRequest), err
}
```
|
```html
<html>
<head>
<title>NVIDIA(R) PhysX(R) SDK 3.4 API Reference: PxPhysXCommonConfig.h File Reference</title>
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
<LINK HREF="NVIDIA.css" REL="stylesheet" TYPE="text/css">
</head>
<body bgcolor="#FFFFFF">
<div id="header">
<hr class="first">
<img alt="" src="images/PhysXlogo.png" align="middle"> <br>
<center>
<a class="qindex" href="main.html">Main Page</a>
<a class="qindex" href="hierarchy.html">Class Hierarchy</a>
<a class="qindex" href="annotated.html">Compound List</a>
<a class="qindex" href="functions.html">Compound Members</a>
</center>
<hr class="second">
</div>
<!-- Generated by Doxygen 1.5.8 -->
<div class="contents">
<h1>PxPhysXCommonConfig.h File Reference</h1><code>#include "<a class="el" href="Px_8h-source.html">foundation/Px.h</a>"</code><br>
<p>
<div class="dynheader">
Include dependency graph for PxPhysXCommonConfig.h:</div>
<div class="dynsection">
<p><center><img src="PxPhysXCommonConfig_8h__incl.png" border="0" usemap="#PxPhysXCommonConfig.h_map" alt=""></center>
<map name="PxPhysXCommonConfig.h_map">
<area shape="rect" href="Px_8h.html" title="foundation/Px.h" alt="foundation/Px.h" coords="320,85,419,107"><area shape="rect" href="PxSimpleTypes_8h.html" title="foundation/PxSimpleTypes.h" alt="foundation/PxSimpleTypes.h" coords="144,155,320,176"><area shape="rect" href="PxPreprocessor_8h.html" title="foundation/PxPreprocessor.h" alt="foundation/PxPreprocessor.h" coords="7,224,183,245"></map>
</div>
<p>
<div class="dynheader">
This graph shows which files directly or indirectly include this file:</div>
<div class="dynsection">
<p><center><img src="PxPhysXCommonConfig_8h__dep__incl.png" border="0" usemap="#PxPhysXCommonConfig.hdep_map" alt=""></center>
<map name="PxPhysXCommonConfig.hdep_map">
<area shape="rect" href="PxPhysXConfig_8h.html" title="PxPhysXConfig.h" alt="PxPhysXConfig.h" coords="1112,139,1221,160"><area shape="rect" href="PxPhysicsAPI_8h.html" title="PxPhysicsAPI.h" alt="PxPhysicsAPI.h" coords="1659,485,1757,507"><area shape="rect" href="PxGeometryQuery_8h.html" title="PxGeometryQuery.h" alt="PxGeometryQuery.h" coords="1644,277,1772,299"><area shape="rect" href="PxMeshQuery_8h.html" title="PxMeshQuery.h" alt="PxMeshQuery.h" coords="1847,277,1948,299"><area shape="rect" href="PxTriangleMeshExt_8h.html" title="PxTriangleMeshExt.h" alt="PxTriangleMeshExt.h" coords="1793,208,1927,229"><area shape="rect" href="PxConvexMeshExt_8h.html" title="PxConvexMeshExt.h" alt="PxConvexMeshExt.h" coords="1951,208,2081,229"><area shape="rect" href="PxBroadPhaseExt_8h.html" title="PxBroadPhaseExt.h" alt="PxBroadPhaseExt.h" coords="2105,208,2231,229"><area shape="rect" href="PxSerialFramework_8h.html" title="PxSerialFramework.h" alt="PxSerialFramework.h" coords="2089,416,2223,437"><area shape="rect" href="PxGeometry_8h.html" title="PxGeometry.h" alt="PxGeometry.h" coords="255,208,348,229"><area shape="rect" href="PxGeometryHelpers_8h.html" title="PxGeometryHelpers.h" alt="PxGeometryHelpers.h" coords="276,277,415,299"><area shape="rect" href="PxRenderBuffer_8h.html" title="PxRenderBuffer.h" alt="PxRenderBuffer.h" coords="2220,347,2332,368"><area shape="rect" href="PxTolerancesScale_8h.html" title="PxTolerancesScale.h" alt="PxTolerancesScale.h" coords="2304,139,2435,160"><area shape="rect" href="PxCooking_8h.html" title="PxCooking.h" alt="PxCooking.h" coords="2407,208,2489,229"><area shape="rect" href="PxTypeInfo_8h.html" title="PxTypeInfo.h" alt="PxTypeInfo.h" coords="2480,416,2565,437"><area shape="rect" href="PxHeightFieldDesc_8h.html" title="PxHeightFieldDesc.h" alt="PxHeightFieldDesc.h" coords="2559,347,2687,368"><area shape="rect" href="PxHeightFieldSample_8h.html" title="PxHeightFieldSample.h" alt="PxHeightFieldSample.h" coords="2640,416,2784,437"><area shape="rect" href="PxMeshScale_8h.html" title="PxMeshScale.h" alt="PxMeshScale.h" coords="2761,347,2863,368"><area shape="rect" href="PxSimpleTriangleMesh_8h.html" title="PxSimpleTriangleMesh.h" alt="PxSimpleTriangleMesh.h" coords="3357,139,3515,160"><area shape="rect" href="PxClothMeshDesc_8h.html" title="PxClothMeshDesc.h" alt="PxClothMeshDesc.h" coords="3437,208,3565,229"><area shape="rect" href="PxClothFabricCooker_8h.html" title="PxClothFabricCooker.h" alt="PxClothFabricCooker.h" coords="3307,277,3448,299"><area shape="rect" href="PxClothMeshQuadifier_8h.html" title="PxClothMeshQuadifier.h" alt="PxClothMeshQuadifier.h" coords="3472,277,3621,299"><area shape="rect" href="PxClothTetherCooker_8h.html" title="PxClothTetherCooker.h" alt="PxClothTetherCooker.h" coords="3645,277,3792,299"><area shape="rect" href="PxTriangle_8h.html" title="PxTriangle.h" alt="PxTriangle.h" coords="2859,416,2941,437"><area shape="rect" href="PxTriangleMesh_8h.html" title="PxTriangleMesh.h" alt="PxTriangleMesh.h" coords="2509,139,2624,160"><area shape="rect" href="PxDefaultStreams_8h.html" title="PxDefaultStreams.h" alt="PxDefaultStreams.h" coords="2937,347,3063,368"><area shape="rect" href="PxSimpleFactory_8h.html" title="PxSimpleFactory.h" alt="PxSimpleFactory.h" coords="3016,416,3131,437"><area shape="rect" href="PxSmoothNormals_8h.html" title="PxSmoothNormals.h" alt="PxSmoothNormals.h" coords="3003,139,3131,160"><area shape="rect" href="PxBinaryConverter_8h.html" title="PxBinaryConverter.h" alt="PxBinaryConverter.h" coords="3155,139,3283,160"><area shape="rect" href="PxDefaultAllocator_8h.html" title="PxDefaultAllocator.h" alt="PxDefaultAllocator.h" coords="3691,139,3813,160"><area shape="rect" href="PxDefaultCpuDispatcher_8h.html" title="PxDefaultCpuDispatcher.h" alt="PxDefaultCpuDispatcher.h" coords="3837,139,3997,160"><area shape="rect" href="PxRaycastCCD_8h.html" title="PxRaycastCCD.h" alt="PxRaycastCCD.h" coords="4021,139,4131,160"><area shape="rect" href="PxActor_8h.html" title="PxActor.h" alt="PxActor.h" coords="1761,347,1823,368"><area shape="rect" href="PxAggregate_8h.html" title="PxAggregate.h" alt="PxAggregate.h" coords="916,416,1009,437"><area shape="rect" href="PxArticulation_8h.html" title="PxArticulation.h" alt="PxArticulation.h" coords="963,347,1059,368"><area shape="rect" href="PxArticulationJoint_8h.html" title="PxArticulationJoint.h" alt="PxArticulationJoint.h" coords="1009,208,1129,229"><area shape="rect" href="PxArticulationLink_8h.html" title="PxArticulationLink.h" alt="PxArticulationLink.h" coords="1060,277,1177,299"><area shape="rect" href="PxShape_8h.html" title="PxShape.h" alt="PxShape.h" coords="697,347,769,368"><area shape="rect" href="PxBatchQuery_8h.html" title="PxBatchQuery.h" alt="PxBatchQuery.h" coords="1252,416,1353,437"><area shape="rect" href="PxContactModifyCallback_8h.html" title="PxContactModifyCallback.h" alt="PxContactModifyCallback.h" coords="729,416,892,437"><area shape="rect" href="PxBatchQueryDesc_8h.html" title="PxBatchQueryDesc.h" alt="PxBatchQueryDesc.h" coords="1340,347,1468,368"><area shape="rect" href="PxFiltering_8h.html" title="PxFiltering.h" alt="PxFiltering.h" coords="1255,208,1335,229"><area shape="rect" href="PxQueryFiltering_8h.html" title="PxQueryFiltering.h" alt="PxQueryFiltering.h" coords="1353,277,1468,299"><area shape="rect" href="PxQueryReport_8h.html" title="PxQueryReport.h" alt="PxQueryReport.h" coords="1511,208,1617,229"><area shape="rect" href="PxBroadPhase_8h.html" title="PxBroadPhase.h" alt="PxBroadPhase.h" coords="524,208,631,229"><area shape="rect" href="PxConstraint_8h.html" title="PxConstraint.h" alt="PxConstraint.h" coords="57,277,151,299"><area shape="rect" href="PxConstraintDesc_8h.html" title="PxConstraintDesc.h" alt="PxConstraintDesc.h" coords="108,208,231,229"><area shape="rect" href="PxDeletionListener_8h.html" title="PxDeletionListener.h" alt="PxDeletionListener.h" coords="407,416,535,437"><area shape="rect" href="PxImmediateMode_8h.html" title="PxImmediateMode.h" alt="PxImmediateMode.h" coords="655,208,783,229"><area shape="rect" href="PxLockedData_8h.html" title="PxLockedData.h" alt="PxLockedData.h" coords="552,347,653,368"></map>
</div>
<p>
<a href="PxPhysXCommonConfig_8h-source.html">Go to the source code of this file.</a><table border="0" cellpadding="0" cellspacing="0">
<tr><td></td></tr>
<tr><td colspan="2"><br><h2>Defines</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__common.html#g4636d12a5a01930fa258136f3f93366f">PX_PHYSX_CORE_API</a></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__common.html#gbe7c1438b281afb1d13fdc127cc84e68">PX_PHYSX_GPU_API</a></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="group__common.html#g87ae1d60bdf83754e2fe5065aab40ec4">PX_PHYSX_COMMON_API</a></td></tr>
<tr><td colspan="2"><br><h2>Typedefs</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef <a class="el" href="group__foundation.html#gcce5749db3dcfb916e98c253374264ed">PxU32</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="group__common.html#g19403877bf7ce42d7240e4e4c758c016">PxTriangleID</a></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef PxU16 </td><td class="memItemRight" valign="bottom"><a class="el" href="group__common.html#gc816bc62a68a52f01bf21f963295e822">PxMaterialTableIndex</a></td></tr>
</table>
</div>
<hr style="width: 100%; height: 2px;"><br>
</body>
</html>
```
|
Kipper (born Mark Eldridge) is a British Grammy Award-winning guitarist, keyboardist and record producer, known mostly from his collaborations with Gary Numan and Sting. Kipper had his own band, One Nation. After releasing two albums with One Nation he joined the Gary Numan band playing guitar.
After realizing his own music was going in a similar direction as Kipper's previous work, Numan asked him to co-produce his 1992 LP Machine and Soul. The album was a mix of funk, rock and dance pop featuring guitar playing from Kipper. Kipper also contributed to Numan's 1994 album Sacrifice although to a much lesser extent.
Years later, Kipper helped produce and played keyboards on two of Sting's studio albums Brand New Day and Sacred Love. Both albums have been critically acclaimed and feature a modern fusion of jazz, rock, and electronic and sounds.
Discography
Strong Enough (One Nation) (1990)
Big Life, Big Tears (One Nation) (1991)
Machine and Soul (Gary Numan) (1992)
Dream Corrosion (Gary Numan) (1993)
Sacrifice (Gary Numan) (1994)
Dark Light (Gary Numan) (1995)
Brand New Day (Sting) (1999)
...All This Time (Sting) (2001)
Night Sessions (Chris Botti) (2001)
Sacred Love (Sting) (2003)
Inside the Songs of Sacred Love (Sting) (2004)
On My Way Here (Clay Aiken) (2008)
This is Different (for Bang & Olufsen) (2008)
Love Eternally (Ewing) (2012)
External links
Kipper official website
Kipper at myspace
Grammy awards winner
Year of birth missing (living people)
Living people
British male guitarists
British rock keyboardists
British jazz keyboardists
British record producers
|
1990
Shawkat Ali (literature)
Abdul Ghani Hazari (journalism)
Lutful Haider Chowdhury (education)
Devdas Chakraborty (fine arts)
Rahija Khanam Jhunu (dance)
Khoda Box Shai (vocal music)
1991
Ahmed Sharif (education)
Kabir Chowdhury (literature)
A.F. Salahuddin Ahmed (education)
A.M. Harun-ar-Rashid (science)
Foyez Ahmad (literature)
Sanjida Khatun (literature)
Aminul Huq
Kazi Abdul Baset (fine arts)
1992
Dewan Mohammad Azraf (literature)
Mobashwer Ali (literature)
Emajuddin Ahamed (education)
Khan Mohammad Salek (education)
Gias Kamal Chowdhury (journalism)
Ataus Samad (journalism)
Shahnaz Rahmatullah (music)
Amjad Hossain (drama)
Hashem Khan (fine arts)
1993
Moniruddin Yusuf (literature)
Rabeya Khatun (literature)
Mofazzal Haider Chaudhuri (education)
Riaz Uddin Ahmed (journalism)
Mohammad Asafuddowla (music)
Fazlul Huq (musician) (music)
Dilara Zaman (acting)
Rafiqun Nabi (fine arts)
Jewel Aich (magic arts)
1994
Sarder Jayenuddin (literature)
Humayun Ahmed (literature)
Ali Monsur (drama)
Abu Taher (fine arts)
Nina Hamid (vocal music)
Shahadat Hossain Khan (instrumental music)
Mohammad Noman (education)
Hasanuzzaman Khan (journalism)
1995
Ahmed Rafiq (literature)
Rawshan Jamil (dance)
Mustafa Zaman Abbasi (music)
Rathindranath Roy (music)
Abdul Karim (education)
Iajuddin Ahmed (education)
Nizamuddin Ahmad (journalism)
Shykh Seraj (journalism)
1996
Hasnat Abdul Hye (literature)
Rahat Khan (literature)
A K M Firoz Alam (music)
Muhammad Abdul Hye (education)
Sirajul Islam Chowdhury (education)
Mohammad Kamruzzaman (journalism)
Mohammad Shahjahan (education)
1997
Abu Ishaque (literature)
Novera Ahmed (sculpture)
Nitun Kundu (sculpture)
Debu Bhattacharya (music)
Runu Biswas (dance)
Razia Khan (education)
Serajul Huq (education)
Shabnam Mustari (music)
Santosh Gupta (journalism)
Monajatuddin (journalism)
Momtazuddin Ahmed (drama)
1998
Ranesh Das Gupta (literature)
Akhtaruzzaman Ilias (literature)
Rokanuzzaman Khan (journalism)
Abul Kashem Sandwip (journalism)
Ferdousi Mazumder (drama)
Mahbuba Rahman (music)
1999
Hasan Azizul Huq (literature)
Syed Hasan Imam (film)
Subhash Dutta (film)
Ali Zaker (drama)
Monirul Islam (fine arts)
Husna Banu Khanam (music)
Fakir Alamgir (music)
A B M Musa (journalism)
K G Mustafa (journalism)
Altamas Ahmed (dance)
References
Civil awards and decorations of Bangladesh
Recipients of the Ekushey Padak
|
```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 org.thingsboard.server.dao.service.validator;
import org.junit.jupiter.api.BeforeEach;
import org.junit.jupiter.api.Test;
import org.springframework.boot.test.context.SpringBootTest;
import org.springframework.boot.test.mock.mockito.MockBean;
import org.springframework.boot.test.mock.mockito.SpyBean;
import org.thingsboard.server.common.data.alarm.Alarm;
import org.thingsboard.server.common.data.alarm.AlarmSeverity;
import org.thingsboard.server.common.data.id.TenantId;
import org.thingsboard.server.dao.tenant.TenantService;
import java.util.UUID;
import static org.mockito.BDDMockito.willReturn;
import static org.mockito.Mockito.verify;
@SpringBootTest(classes = AlarmDataValidator.class)
class AlarmDataValidatorTest {
@MockBean
TenantService tenantService;
@SpyBean
AlarmDataValidator validator;
TenantId tenantId = TenantId.fromUUID(UUID.fromString("9ef79cdf-37a8-4119-b682-2e7ed4e018da"));
@BeforeEach
void setUp() {
willReturn(true).given(tenantService).tenantExists(tenantId);
}
@Test
void testValidateNameInvocation() {
Alarm alarm = new Alarm();
alarm.setType("overheating");
alarm.setOriginator(tenantId);
alarm.setSeverity(AlarmSeverity.CRITICAL);
alarm.setCleared(false);
alarm.setAcknowledged(false);
alarm.setTenantId(tenantId);
validator.validateDataImpl(tenantId, alarm);
verify(validator).validateString("Alarm type", alarm.getType());
}
}
```
|
Tithonia rotundifolia, the red sunflower or Mexican sunflower, is a plant in the family Asteraceae, which is native to the warmer and moister parts of North America.
Range
It occurs in Florida, Louisiana, Mexico, Central America and the West Indies. Outside its native region it is sometimes grown as an ornamental and has become naturalized in some of these locales. In Africa it has been recorded up to an altitude of 1,580 m above sea level.
Description
Plants are perennial in the native habitat, up to 4 m tall with orange or red flowers. In USDA zones cooler than Zone 10 it is an annual. The flowers are used by many insects as a nectar source including migrating monarch butterflies. Leaves, despite the epithet, are deltoid to lanceolate, occasionally lobed.
Synonyms
Tithonia rotundifolia (Mill.) S.F. Blake, Contr. Gray Herb. 52: 41. 1917.
Tagetes rotundifolia Miller, Gard. Dict. ed. 8, Tagetes no. 4. 1768.
Helianthus speciosus Hook., Bot. Mag. 61: t. 3295. 1834.
Tithonia speciosa (Hook.) Griseb., Cat. pl. Cub. 155. 1866.
Tithonia vilmoriniana Pamp.Tithonia vilmoriniana Pamp.</ref>
References
Heliantheae
Flora of Mexico
Garden plants of Central America
Flora of Florida
Flora of Louisiana
Flora of Central America
Flora of Cuba
Flora without expected TNC conservation status
|
Different Kind Of Women know often as 'DKW' is a British Talk show that has been broadcast on My Channel since 6 September 2014. The programme focuses on a panel of female presenters, who interview special guests, discuss their lives and topical issues that often effect women today.
The panel comprises women from various professions in the entertainment and journalism industries.
About the series
DKW airs on My Channel, Sunday afternoons from 4-5 PM. The show gives viewers a light-hearted and informative view on a diverse array of subjects and topics that affect women every day. The show aims to inspire women and to empower them to be unique. Many topics and issues are covered in each show. Topics range from love and romance to careers, health, family and self-motivation. The show is often repeated on Thursday Mornings and Saturday afternoons.
Presenters
The show is presented by a set team of women each week. With guest presenters and regulars. Each show would often see a main presenter alongside 3-4 other female co-hosts.
International variations
In the UK, Loose Women debuted in 1999.
In the United States, The View debuted in 1997. The Talk debuted in 2010, and The Real in 2013.
In Germany, Frauenzimmer aired between 26 October 2009 and 20 November 2009. The show was cancelled due to poor ratings.
In Australia, The Circle first aired in 2010 and has a similar format. The show, which also features cookery and makeover segments, is a popular daytime show on Network Ten.
In France, Le Grand 8 has been aired since October 2012 on weekdays from 12.10 to 13.25 on D8 free digital terrestrial channel, part of Canal + group. The host, Laurence Ferrari, former presenter of TF1 8 pm newscast, and four panellists discuss on topics such as politics, health, trends, business and culture.
In Ireland, Midday first aired in 2008 on TV3. Midday has been described as an Irish Loose Women but a TV3 representative said "We're not going to be like Loose Women though, they seem to do a lot of men bashing and talking about their sex lives, we certainly won't be doing that"In Mexico, Netas Divinas first aired in 2012. It is among the few variations of the programme to be aired in other countries, having aired in other Latin American countries as well as on Galavision in the United States.
In Canada, The Social'' first aired in 2013 on CTV Television Network.
References
External links
2014 British television series debuts
2010s British television talk shows
British television talk shows
English-language television shows
|
```python
from prowler.providers.aws.lib.policy_condition_parser.policy_condition_parser import (
is_condition_block_restrictive,
is_condition_block_restrictive_organization,
)
TRUSTED_AWS_ACCOUNT_NUMBER = "123456789012"
NON_TRUSTED_AWS_ACCOUNT_NUMBER = "111222333444"
TRUSTED_ORGANIZATION_ID = "o-123456789012"
NON_TRUSTED_ORGANIZATION_ID = "o-111222333444"
ALL_ORGS = "*"
class Test_policy_condition_parser:
# Test lowercase context key name --> aws
def test_condition_parser_string_equals_aws_SourceAccount_list(self):
condition_statement = {
"StringEquals": {"aws:SourceAccount": [TRUSTED_AWS_ACCOUNT_NUMBER]}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hashalid(self):
condition_statement = {
"StringEquals": {
"aws:SourceAccount": [
TRUSTED_AWS_ACCOUNT_NUMBER,
NON_TRUSTED_AWS_ACCOUNT_NUMBER,
]
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_equals_aws_SourceAccount_str(self):
condition_statement = {
"StringEquals": {"aws:SourceAccount": TRUSTED_AWS_ACCOUNT_NUMBER}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hashlid(self):
condition_statement = {
"StringEquals": {"aws:SourceAccount": NON_TRUSTED_AWS_ACCOUNT_NUMBER}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_like_aws_SourceAccount_list(self):
condition_statement = {
"StringLike": {"aws:SourceAccount": [TRUSTED_AWS_ACCOUNT_NUMBER]}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hashid(self):
condition_statement = {
"StringLike": {
"aws:SourceAccount": [
TRUSTED_AWS_ACCOUNT_NUMBER,
NON_TRUSTED_AWS_ACCOUNT_NUMBER,
]
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_like_aws_SourceAccount_str(self):
condition_statement = {
"StringLike": {"aws:SourceAccount": TRUSTED_AWS_ACCOUNT_NUMBER}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hashd(self):
condition_statement = {
"StringLike": {"aws:SourceAccount": NON_TRUSTED_AWS_ACCOUNT_NUMBER}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_equals_aws_SourceOwner_str(self):
condition_statement = {
"StringEquals": {"aws:SourceOwner": TRUSTED_AWS_ACCOUNT_NUMBER}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hashd(self):
condition_statement = {
"StringEquals": {"aws:SourceOwner": NON_TRUSTED_AWS_ACCOUNT_NUMBER}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_equals_aws_SourceOwner_list(self):
condition_statement = {
"StringEquals": {"aws:SourceOwner": [TRUSTED_AWS_ACCOUNT_NUMBER]}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hashid(self):
condition_statement = {
"StringEquals": {
"aws:SourceOwner": [
TRUSTED_AWS_ACCOUNT_NUMBER,
NON_TRUSTED_AWS_ACCOUNT_NUMBER,
]
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_like_aws_SourceOwner_list(self):
condition_statement = {
"StringLike": {"aws:SourceOwner": [TRUSTED_AWS_ACCOUNT_NUMBER]}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hash(self):
condition_statement = {
"StringLike": {
"aws:SourceOwner": [
TRUSTED_AWS_ACCOUNT_NUMBER,
NON_TRUSTED_AWS_ACCOUNT_NUMBER,
]
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_like_aws_SourceOwner_str(self):
condition_statement = {
"StringLike": {"aws:SourceOwner": TRUSTED_AWS_ACCOUNT_NUMBER}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_like_aws_SourceOwner_str_not_valid(self):
condition_statement = {
"StringLike": {"aws:SourceOwner": NON_TRUSTED_AWS_ACCOUNT_NUMBER}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_equals_s3_ResourceAccount_list(self):
condition_statement = {
"StringEquals": {"s3:ResourceAccount": [TRUSTED_AWS_ACCOUNT_NUMBER]}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hashvalid(self):
condition_statement = {
"StringEquals": {
"s3:ResourceAccount": [
TRUSTED_AWS_ACCOUNT_NUMBER,
NON_TRUSTED_AWS_ACCOUNT_NUMBER,
]
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_equals_s3_ResourceAccount_str(self):
condition_statement = {
"StringEquals": {"s3:ResourceAccount": TRUSTED_AWS_ACCOUNT_NUMBER}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hashalid(self):
condition_statement = {
"StringEquals": {"s3:ResourceAccount": NON_TRUSTED_AWS_ACCOUNT_NUMBER}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_equals_aws_PrincipalAccount_list(self):
condition_statement = {
"StringEquals": {"aws:PrincipalAccount": [TRUSTED_AWS_ACCOUNT_NUMBER]}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hasht_valid(self):
condition_statement = {
"StringEquals": {
"aws:PrincipalAccount": [
TRUSTED_AWS_ACCOUNT_NUMBER,
NON_TRUSTED_AWS_ACCOUNT_NUMBER,
]
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_equals_aws_PrincipalAccount_str(self):
condition_statement = {
"StringEquals": {"aws:PrincipalAccount": TRUSTED_AWS_ACCOUNT_NUMBER}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hash_valid(self):
condition_statement = {
"StringEquals": {"aws:PrincipalAccount": NON_TRUSTED_AWS_ACCOUNT_NUMBER}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_equals_aws_SourceArn_str(self):
condition_statement = {
"StringEquals": {
"aws:SourceArn": f"arn:aws:cloudtrail:*:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/*"
}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_equals_aws_SourceArn_str_not_valid(self):
condition_statement = {
"StringEquals": {
"aws:SourceArn": f"arn:aws:cloudtrail:*:{NON_TRUSTED_AWS_ACCOUNT_NUMBER}:trail/*"
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_like_aws_PrincipalAccount_list(self):
condition_statement = {
"StringLike": {"aws:PrincipalAccount": [TRUSTED_AWS_ACCOUNT_NUMBER]}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hashvalid(self):
condition_statement = {
"StringLike": {
"aws:PrincipalAccount": [
TRUSTED_AWS_ACCOUNT_NUMBER,
NON_TRUSTED_AWS_ACCOUNT_NUMBER,
]
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_like_aws_PrincipalAccount_str(self):
condition_statement = {
"StringLike": {"aws:PrincipalAccount": TRUSTED_AWS_ACCOUNT_NUMBER}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hashalid(self):
condition_statement = {
"StringLike": {"aws:PrincipalAccount": NON_TRUSTED_AWS_ACCOUNT_NUMBER}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_arn_like_aws_SourceArn_list(self):
condition_statement = {
"ArnLike": {
"aws:SourceArn": [
f"arn:aws:cloudtrail:*:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/*"
]
}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_arn_like_aws_SourceArn_list_not_valid(self):
condition_statement = {
"ArnLike": {
"aws:SourceArn": [
f"arn:aws:cloudtrail:*:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/*",
f"arn:aws:cloudtrail:*:{NON_TRUSTED_AWS_ACCOUNT_NUMBER}:trail/*",
]
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_arn_like_aws_SourceArn_str(self):
condition_statement = {
"ArnLike": {
"aws:SourceArn": f"arn:aws:cloudtrail:*:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/*"
}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_arn_like_aws_SourceArn_str_not_valid(self):
condition_statement = {
"ArnLike": {
"aws:SourceArn": f"arn:aws:cloudtrail:*:{NON_TRUSTED_AWS_ACCOUNT_NUMBER}:trail/*"
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_arn_like_aws_PrincipalArn_list(self):
condition_statement = {
"ArnLike": {
"aws:PrincipalArn": [
f"arn:aws:cloudtrail:*:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/*"
]
}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_arn_like_aws_PrincipalArn_list_not_valid(self):
condition_statement = {
"ArnLike": {
"aws:PrincipalArn": [
f"arn:aws:cloudtrail:*:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/*",
f"arn:aws:cloudtrail:*:{NON_TRUSTED_AWS_ACCOUNT_NUMBER}:trail/*",
]
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_arn_like_aws_PrincipalArn_str(self):
condition_statement = {
"ArnLike": {
"aws:PrincipalArn": f"arn:aws:cloudtrail:*:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/*"
}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_arn_like_aws_PrincipalArn_str_not_valid(self):
condition_statement = {
"ArnLike": {
"aws:PrincipalArn": f"arn:aws:cloudtrail:*:{NON_TRUSTED_AWS_ACCOUNT_NUMBER}:trail/*"
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_arn_equals_aws_SourceArn_list(self):
condition_statement = {
"ArnEquals": {
"aws:SourceArn": [
f"arn:aws:cloudtrail:eu-west-1:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test"
]
}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_arn_equals_aws_SourceArn_list_not_valid(self):
condition_statement = {
"ArnEquals": {
"aws:SourceArn": [
f"arn:aws:cloudtrail:eu-west-1:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test",
f"arn:aws:cloudtrail:eu-west-1:{NON_TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test",
]
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_arn_equals_aws_SourceArn_str(self):
condition_statement = {
"ArnEquals": {
"aws:SourceArn": f"arn:aws:cloudtrail:eu-west-1:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test"
}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_arn_equals_aws_SourceArn_str_not_valid(self):
condition_statement = {
"ArnEquals": {
"aws:SourceArn": f"arn:aws:cloudtrail:eu-west-1:{NON_TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test"
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_arn_equals_aws_PrincipalArn_list(self):
condition_statement = {
"ArnEquals": {
"aws:PrincipalArn": [
f"arn:aws:cloudtrail:eu-west-1:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test"
]
}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hash(self):
condition_statement = {
"ArnEquals": {
"aws:PrincipalArn": [
f"arn:aws:cloudtrail:eu-west-1:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test",
f"arn:aws:cloudtrail:eu-west-1:{NON_TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test",
]
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_arn_equals_aws_PrincipalArn_str(self):
condition_statement = {
"ArnEquals": {
"aws:PrincipalArn": f"arn:aws:cloudtrail:eu-west-1:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test"
}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_arn_equals_aws_PrincipalArn_str_not_valid(self):
condition_statement = {
"ArnEquals": {
"aws:PrincipalArn": f"arn:aws:cloudtrail:eu-west-1:{NON_TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test"
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_like_aws_SourceArn_list(self):
condition_statement = {
"StringLike": {
"aws:SourceArn": [
f"arn:aws:cloudtrail:eu-west-1:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test"
]
}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_like_aws_SourceArn_list_not_valid(self):
condition_statement = {
"StringLike": {
"aws:SourceArn": [
f"arn:aws:cloudtrail:eu-west-1:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test",
f"arn:aws:cloudtrail:eu-west-1:{NON_TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test",
]
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_like_aws_SourceArn_str(self):
condition_statement = {
"StringLike": {
"aws:SourceArn": f"arn:aws:cloudtrail:eu-west-1:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test"
}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_like_aws_SourceArn_str_not_valid(self):
condition_statement = {
"StringLike": {
"aws:SourceArn": f"arn:aws:cloudtrail:eu-west-1:{NON_TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test"
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_like_aws_PrincipalArn_list(self):
condition_statement = {
"StringLike": {
"aws:PrincipalArn": [
f"arn:aws:cloudtrail:eu-west-1:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test"
]
}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hashd(self):
condition_statement = {
"StringLike": {
"aws:PrincipalArn": [
f"arn:aws:cloudtrail:eu-west-1:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test",
f"arn:aws:cloudtrail:eu-west-1:{NON_TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test",
]
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_like_aws_PrincipalArn_str(self):
condition_statement = {
"StringLike": {
"aws:PrincipalArn": f"arn:aws:cloudtrail:eu-west-1:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test"
}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hash(self):
condition_statement = {
"StringLike": {
"aws:PrincipalArn": f"arn:aws:cloudtrail:eu-west-1:{NON_TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test"
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_equals_aws_ResourceAccount_list(self):
condition_statement = {
"StringEquals": {"aws:ResourceAccount": [TRUSTED_AWS_ACCOUNT_NUMBER]}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hash_valid(self):
condition_statement = {
"StringEquals": {
"aws:ResourceAccount": [
TRUSTED_AWS_ACCOUNT_NUMBER,
NON_TRUSTED_AWS_ACCOUNT_NUMBER,
]
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_equals_aws_ResourceAccount_str(self):
condition_statement = {
"StringEquals": {"aws:ResourceAccount": TRUSTED_AWS_ACCOUNT_NUMBER}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hashvalid(self):
condition_statement = {
"StringEquals": {"aws:ResourceAccount": NON_TRUSTED_AWS_ACCOUNT_NUMBER}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_like_aws_ResourceAccount_list(self):
condition_statement = {
"StringLike": {"aws:ResourceAccount": [TRUSTED_AWS_ACCOUNT_NUMBER]}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hashalid(self):
condition_statement = {
"StringLike": {
"aws:ResourceAccount": [
TRUSTED_AWS_ACCOUNT_NUMBER,
NON_TRUSTED_AWS_ACCOUNT_NUMBER,
]
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_like_aws_ResourceAccount_str(self):
condition_statement = {
"StringLike": {"aws:ResourceAccount": TRUSTED_AWS_ACCOUNT_NUMBER}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hashlid(self):
condition_statement = {
"StringLike": {"aws:ResourceAccount": NON_TRUSTED_AWS_ACCOUNT_NUMBER}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
# Test uppercase context key name --> AWS
def test_condition_parser_string_equals_AWS_SourceAccount_list(self):
condition_statement = {
"StringEquals": {"AWS:SourceAccount": [TRUSTED_AWS_ACCOUNT_NUMBER]}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hashalid(self):
condition_statement = {
"StringEquals": {
"AWS:SourceAccount": [
TRUSTED_AWS_ACCOUNT_NUMBER,
NON_TRUSTED_AWS_ACCOUNT_NUMBER,
]
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_equals_AWS_SourceAccount_str(self):
condition_statement = {
"StringEquals": {"AWS:SourceAccount": TRUSTED_AWS_ACCOUNT_NUMBER}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hashlid(self):
condition_statement = {
"StringEquals": {"AWS:SourceAccount": NON_TRUSTED_AWS_ACCOUNT_NUMBER}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_like_AWS_SourceAccount_list(self):
condition_statement = {
"StringLike": {"AWS:SourceAccount": [TRUSTED_AWS_ACCOUNT_NUMBER]}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hashid(self):
condition_statement = {
"StringLike": {
"AWS:SourceAccount": [
TRUSTED_AWS_ACCOUNT_NUMBER,
NON_TRUSTED_AWS_ACCOUNT_NUMBER,
]
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_like_AWS_SourceAccount_str(self):
condition_statement = {
"StringLike": {"AWS:SourceAccount": TRUSTED_AWS_ACCOUNT_NUMBER}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hashd(self):
condition_statement = {
"StringLike": {"AWS:SourceAccount": NON_TRUSTED_AWS_ACCOUNT_NUMBER}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_equals_AWS_SourceOwner_str(self):
condition_statement = {
"StringEquals": {"AWS:SourceOwner": TRUSTED_AWS_ACCOUNT_NUMBER}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hashd(self):
condition_statement = {
"StringEquals": {"AWS:SourceOwner": NON_TRUSTED_AWS_ACCOUNT_NUMBER}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_equals_AWS_SourceOwner_list(self):
condition_statement = {
"StringEquals": {"AWS:SourceOwner": [TRUSTED_AWS_ACCOUNT_NUMBER]}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hashid(self):
condition_statement = {
"StringEquals": {
"AWS:SourceOwner": [
TRUSTED_AWS_ACCOUNT_NUMBER,
NON_TRUSTED_AWS_ACCOUNT_NUMBER,
]
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_like_AWS_SourceOwner_list(self):
condition_statement = {
"StringLike": {"AWS:SourceOwner": [TRUSTED_AWS_ACCOUNT_NUMBER]}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hash(self):
condition_statement = {
"StringLike": {
"AWS:SourceOwner": [
TRUSTED_AWS_ACCOUNT_NUMBER,
NON_TRUSTED_AWS_ACCOUNT_NUMBER,
]
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_like_AWS_SourceOwner_str(self):
condition_statement = {
"StringLike": {"AWS:SourceOwner": TRUSTED_AWS_ACCOUNT_NUMBER}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_like_AWS_SourceOwner_str_not_valid(self):
condition_statement = {
"StringLike": {"AWS:SourceOwner": NON_TRUSTED_AWS_ACCOUNT_NUMBER}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_equals_S3_ResourceAccount_list(self):
condition_statement = {
"StringEquals": {"S3:ResourceAccount": [TRUSTED_AWS_ACCOUNT_NUMBER]}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hashvalid(self):
condition_statement = {
"StringEquals": {
"S3:ResourceAccount": [
TRUSTED_AWS_ACCOUNT_NUMBER,
NON_TRUSTED_AWS_ACCOUNT_NUMBER,
]
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_equals_S3_ResourceAccount_str(self):
condition_statement = {
"StringEquals": {"S3:ResourceAccount": TRUSTED_AWS_ACCOUNT_NUMBER}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hashalid(self):
condition_statement = {
"StringEquals": {"S3:ResourceAccount": NON_TRUSTED_AWS_ACCOUNT_NUMBER}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_equals_AWS_PrincipalAccount_list(self):
condition_statement = {
"StringEquals": {"AWS:PrincipalAccount": [TRUSTED_AWS_ACCOUNT_NUMBER]}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hasht_valid(self):
condition_statement = {
"StringEquals": {
"AWS:PrincipalAccount": [
TRUSTED_AWS_ACCOUNT_NUMBER,
NON_TRUSTED_AWS_ACCOUNT_NUMBER,
]
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_equals_AWS_PrincipalAccount_str(self):
condition_statement = {
"StringEquals": {"AWS:PrincipalAccount": TRUSTED_AWS_ACCOUNT_NUMBER}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hash_valid(self):
condition_statement = {
"StringEquals": {"AWS:PrincipalAccount": NON_TRUSTED_AWS_ACCOUNT_NUMBER}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_like_AWS_PrincipalAccount_list(self):
condition_statement = {
"StringLike": {"AWS:PrincipalAccount": [TRUSTED_AWS_ACCOUNT_NUMBER]}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hashvalid(self):
condition_statement = {
"StringLike": {
"AWS:PrincipalAccount": [
TRUSTED_AWS_ACCOUNT_NUMBER,
NON_TRUSTED_AWS_ACCOUNT_NUMBER,
]
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_like_AWS_PrincipalAccount_str(self):
condition_statement = {
"StringLike": {"AWS:PrincipalAccount": TRUSTED_AWS_ACCOUNT_NUMBER}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hashalid(self):
condition_statement = {
"StringLike": {"AWS:PrincipalAccount": NON_TRUSTED_AWS_ACCOUNT_NUMBER}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_arn_like_AWS_SourceArn_list(self):
condition_statement = {
"ArnLike": {
"AWS:SourceArn": [
f"arn:aws:cloudtrail:*:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/*"
]
}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_arn_like_AWS_SourceArn_list_not_valid(self):
condition_statement = {
"ArnLike": {
"AWS:SourceArn": [
f"arn:aws:cloudtrail:*:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/*",
f"arn:aws:cloudtrail:*:{NON_TRUSTED_AWS_ACCOUNT_NUMBER}:trail/*",
]
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_arn_like_AWS_SourceArn_str(self):
condition_statement = {
"ArnLike": {
"AWS:SourceArn": f"arn:aws:cloudtrail:*:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/*"
}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_arn_like_AWS_SourceArn_str_not_valid(self):
condition_statement = {
"ArnLike": {
"AWS:SourceArn": f"arn:aws:cloudtrail:*:{NON_TRUSTED_AWS_ACCOUNT_NUMBER}:trail/*"
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_arn_like_AWS_PrincipalArn_list(self):
condition_statement = {
"ArnLike": {
"AWS:PrincipalArn": [
f"arn:aws:cloudtrail:*:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/*"
]
}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_arn_like_AWS_PrincipalArn_list_not_valid(self):
condition_statement = {
"ArnLike": {
"AWS:PrincipalArn": [
f"arn:aws:cloudtrail:*:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/*",
f"arn:aws:cloudtrail:*:{NON_TRUSTED_AWS_ACCOUNT_NUMBER}:trail/*",
]
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_arn_like_AWS_PrincipalArn_str(self):
condition_statement = {
"ArnLike": {
"AWS:PrincipalArn": f"arn:aws:cloudtrail:*:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/*"
}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_arn_like_AWS_PrincipalArn_str_not_valid(self):
condition_statement = {
"ArnLike": {
"AWS:PrincipalArn": f"arn:aws:cloudtrail:*:{NON_TRUSTED_AWS_ACCOUNT_NUMBER}:trail/*"
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_arn_equals_AWS_SourceArn_list(self):
condition_statement = {
"ArnEquals": {
"AWS:SourceArn": [
f"arn:aws:cloudtrail:eu-west-1:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test"
]
}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_arn_equals_AWS_SourceArn_list_not_valid(self):
condition_statement = {
"ArnEquals": {
"AWS:SourceArn": [
f"arn:aws:cloudtrail:eu-west-1:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test",
f"arn:aws:cloudtrail:eu-west-1:{NON_TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test",
]
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_arn_equals_AWS_SourceArn_str(self):
condition_statement = {
"ArnEquals": {
"AWS:SourceArn": f"arn:aws:cloudtrail:eu-west-1:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test"
}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_arn_equals_AWS_SourceArn_str_not_valid(self):
condition_statement = {
"ArnEquals": {
"AWS:SourceArn": f"arn:aws:cloudtrail:eu-west-1:{NON_TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test"
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_arn_equals_AWS_PrincipalArn_list(self):
condition_statement = {
"ArnEquals": {
"AWS:PrincipalArn": [
f"arn:aws:cloudtrail:eu-west-1:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test"
]
}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hash(self):
condition_statement = {
"ArnEquals": {
"AWS:PrincipalArn": [
f"arn:aws:cloudtrail:eu-west-1:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test",
f"arn:aws:cloudtrail:eu-west-1:{NON_TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test",
]
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_arn_equals_AWS_PrincipalArn_str(self):
condition_statement = {
"ArnEquals": {
"AWS:PrincipalArn": f"arn:aws:cloudtrail:eu-west-1:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test"
}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_arn_equals_AWS_PrincipalArn_str_not_valid(self):
condition_statement = {
"ArnEquals": {
"AWS:PrincipalArn": f"arn:aws:cloudtrail:eu-west-1:{NON_TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test"
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_like_AWS_SourceArn_list(self):
condition_statement = {
"StringLike": {
"AWS:SourceArn": [
f"arn:aws:cloudtrail:eu-west-1:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test"
]
}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_like_AWS_SourceArn_list_not_valid(self):
condition_statement = {
"StringLike": {
"AWS:SourceArn": [
f"arn:aws:cloudtrail:eu-west-1:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test",
f"arn:aws:cloudtrail:eu-west-1:{NON_TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test",
]
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_like_AWS_SourceArn_str(self):
condition_statement = {
"StringLike": {
"AWS:SourceArn": f"arn:aws:cloudtrail:eu-west-1:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test"
}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_like_AWS_SourceArn_str_not_valid(self):
condition_statement = {
"StringLike": {
"AWS:SourceArn": f"arn:aws:cloudtrail:eu-west-1:{NON_TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test"
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_like_AWS_PrincipalArn_list(self):
condition_statement = {
"StringLike": {
"AWS:PrincipalArn": [
f"arn:aws:cloudtrail:eu-west-1:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test"
]
}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hashd(self):
condition_statement = {
"StringLike": {
"AWS:PrincipalArn": [
f"arn:aws:cloudtrail:eu-west-1:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test",
f"arn:aws:cloudtrail:eu-west-1:{NON_TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test",
]
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_like_AWS_PrincipalArn_str(self):
condition_statement = {
"StringLike": {
"AWS:PrincipalArn": f"arn:aws:cloudtrail:eu-west-1:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test"
}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hash(self):
condition_statement = {
"StringLike": {
"AWS:PrincipalArn": f"arn:aws:cloudtrail:eu-west-1:{NON_TRUSTED_AWS_ACCOUNT_NUMBER}:trail/test"
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_equals_AWS_ResourceAccount_list(self):
condition_statement = {
"StringEquals": {"AWS:ResourceAccount": [TRUSTED_AWS_ACCOUNT_NUMBER]}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hash_valid(self):
condition_statement = {
"StringEquals": {
"AWS:ResourceAccount": [
TRUSTED_AWS_ACCOUNT_NUMBER,
NON_TRUSTED_AWS_ACCOUNT_NUMBER,
]
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_equals_AWS_ResourceAccount_str(self):
condition_statement = {
"StringEquals": {"AWS:ResourceAccount": TRUSTED_AWS_ACCOUNT_NUMBER}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hashvalid(self):
condition_statement = {
"StringEquals": {"AWS:ResourceAccount": NON_TRUSTED_AWS_ACCOUNT_NUMBER}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_like_AWS_ResourceAccount_list(self):
condition_statement = {
"StringLike": {"AWS:ResourceAccount": [TRUSTED_AWS_ACCOUNT_NUMBER]}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hashalid(self):
condition_statement = {
"StringLike": {
"AWS:ResourceAccount": [
TRUSTED_AWS_ACCOUNT_NUMBER,
NON_TRUSTED_AWS_ACCOUNT_NUMBER,
]
}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_string_like_AWS_ResourceAccount_str(self):
condition_statement = {
"StringLike": {"AWS:ResourceAccount": TRUSTED_AWS_ACCOUNT_NUMBER}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def your_sha256_hashlid(self):
condition_statement = {
"StringLike": {"AWS:ResourceAccount": NON_TRUSTED_AWS_ACCOUNT_NUMBER}
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_two_lists_unrestrictive(self):
condition_statement = {
"StringLike": {
"AWS:ResourceAccount": [
TRUSTED_AWS_ACCOUNT_NUMBER,
NON_TRUSTED_AWS_ACCOUNT_NUMBER,
]
},
"ArnLike": {
"AWS:SourceArn": [
f"arn:aws:cloudtrail:*:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/*",
f"arn:aws:cloudtrail:*:{NON_TRUSTED_AWS_ACCOUNT_NUMBER}:trail/*",
]
},
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_two_lists_both_restrictive(self):
condition_statement = {
"StringLike": {
"AWS:ResourceAccount": [
TRUSTED_AWS_ACCOUNT_NUMBER,
]
},
"ArnLike": {
"AWS:SourceArn": [
f"arn:aws:cloudtrail:*:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/*",
]
},
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_two_lists_first_restrictive(self):
condition_statement = {
"StringLike": {
"AWS:ResourceAccount": [
TRUSTED_AWS_ACCOUNT_NUMBER,
]
},
"ArnLike": {
"AWS:SourceArn": [
f"arn:aws:cloudtrail:*:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/*",
f"arn:aws:cloudtrail:*:{NON_TRUSTED_AWS_ACCOUNT_NUMBER}:trail/*",
]
},
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_two_lists_second_restrictive(self):
condition_statement = {
"StringLike": {
"AWS:ResourceAccount": [
TRUSTED_AWS_ACCOUNT_NUMBER,
NON_TRUSTED_AWS_ACCOUNT_NUMBER,
]
},
"ArnLike": {
"AWS:SourceArn": [
f"arn:aws:cloudtrail:*:{TRUSTED_AWS_ACCOUNT_NUMBER}:trail/*",
]
},
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER
)
def test_condition_parser_allowing_cross_account_with_invalid_block(self):
condition_statement = {
"StringLike": {
"s3:prefix": [
"home/",
]
},
}
assert not is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER, True
)
def test_condition_parser_string_equals_vpc(self):
condition_statement = {"StringEquals": {"aws:SourceVpc": "vpc-123456"}}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER, True
)
def test_condition_parser_string_equals_vpc_list(self):
condition_statement = {"StringEquals": {"aws:sourcevpc": ["vpc-123456"]}}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER, True
)
def test_condition_parser_string_equals_vpc_list_not_valid(self):
condition_statement = {
"StringEquals": {"aws:SourceVpc": ["vpc-123456", "vpc-654321"]}
}
assert is_condition_block_restrictive(
condition_statement, TRUSTED_AWS_ACCOUNT_NUMBER, True
)
def test_condition_parser_string_equals_aws_PrincipalOrgID_list(self):
condition_statement = {
"StringEquals": {"aws:PrincipalOrgID": [TRUSTED_ORGANIZATION_ID]}
}
assert is_condition_block_restrictive_organization(condition_statement)
def your_sha256_hashiple_items(
self,
):
condition_statement = {
"StringEquals": {
"aws:PrincipalOrgID": [
TRUSTED_ORGANIZATION_ID,
NON_TRUSTED_ORGANIZATION_ID,
]
}
}
assert is_condition_block_restrictive_organization(condition_statement)
def test_condition_parser_string_equals_aws_PrincipalOrgID_str(self):
condition_statement = {
"StringEquals": {"aws:PrincipalOrgID": TRUSTED_ORGANIZATION_ID}
}
assert is_condition_block_restrictive_organization(condition_statement)
def your_sha256_hashtems(
self,
):
condition_statement = {
"StringEquals": {
"aws:PrincipalOrgID": [
TRUSTED_ORGANIZATION_ID,
ALL_ORGS,
]
}
}
assert not is_condition_block_restrictive_organization(condition_statement)
def test_condition_parser_string_equals_aws_All_Orgs_str(self):
condition_statement = {"StringEquals": {"aws:PrincipalOrgID": ALL_ORGS}}
assert not is_condition_block_restrictive_organization(condition_statement)
```
|
was a Japanese reporter, anarchist and critic born in Tokyo. He was the son of the artist and activist Eitarō Takenaka. Expelled from the Russian language department of the Tokyo University of Foreign Studies, he went on to write about various subjects in the worlds of politics and culture under the pseudonyms "Yumeno Kyōtarō," "Kenka Takenaka" and "Hankotsu-no-Reporter" (literally: "Rebellious Reporter") among others. He also wrote several books on Japanese film history. In his final years he continued his journalistic activities, despite suffering from and ultimately dying of cancer.
References
1930 births
1991 deaths
People from Shinjuku
People from Tokyo
Japanese anarchists
Japanese film critics
Japanese journalists
Mystery Writers of Japan Award winners
20th-century journalists
|
Her-Age is a global online platform for buying and selling authenticated second-hand luxury items. The name "Her-Age" comes from "heritage."
History
Her-Age launched online in September 2021 by Alba Figueras, Alessandro Berna, and Ataman Ersan with a private collection of 500 vintage and pre-owned designer pieces.
In September 2022, the company partnered with Milano-based vintage fashion retailer L’Armadio di Laura. They introduced their collection which combined eco-sustainable purchases and pieces from Gianfranco Ferré, Hermès, Chanel, and Vivienne Westwood.
In October 2022 in Milan, Alba Figueras collaborated with Il Ponte, an Italian auction house, to share a collection of 33 pieces curated from different parts of the world.
In 2023, it partnered with Cavalli e Nastri to present a selection of vintage luxury garments during Spring/Summer 2024 Milan Homme Fashion Week. Cavalli e Nastri and Her-Age launched Vintageland, an event through which vintage lovers and experts can come together.
Activities
Her-Age is a platform for buying and selling authenticated second-hand luxury items, filtered by age or fashion era. The company manages authentication, pricing, and delivery, sourcing from suppliers, professional sellers, and small vintage stores. The company also became the first to offer customers the chance to own the NFTs of the items. It features items from 313 brands.
Alessandro Berna, Her-Age's CEO, is Franco Mattioli's grandson, who was the founder and CEO of the Italian brand Gianfranco Ferré, Ataman Ersan is CMO, and Alba Figueras De La Parte is COO.
References
Retail companies established in 2021
Internet properties established in 2021
Online marketplaces
Retail companies of Italy
|
Joseph ibn Migash or Joseph ben Meir HaLevi ibn Migash or Yosef Ibn Meir Ha-Levi Ibn Megas or José ben Meir ibn Megas (early 1077 – c. 1141) () was a Rabbi, Posek, and Rosh Yeshiva in Lucena (actually Spain). He is also known as Ri Migash (), the Hebrew acronym for "Rabbi Joseph Migash".
Biography
Joseph ibn Migash was probably born in Seville (though Steinschneider believes it was Granada). He moved to Lucena at the age of 12 to study under the renowned Talmudist Isaac Alfasi. He studied under Alfasi at Lucena for fourteen years. Shortly before his death (1103), Alfasi ordained Ibn Migash as a rabbi, and - passing over his own son - also appointed him, then 26, to be his successor as Rosh Yeshiva (seminary head). Joseph ibn Migash held this position for 38 years.
Rabbi Abraham ben David, in his work Sefer ha-Kabbalah (Book of Tradition), mentions Joseph ibn Migash, a grandfather who had the same name, as being a contemporary of Samuel haNagid, and that during the dispute between the supporters of Bulukkin and the supporters of Badis, the Berber ruler of Granada, Joseph ibn Migash had sided with Bulukkin in this dispute and fled to Askilia, to avoid punishment.
It is clear that Migash was a great scholar: Maimonides in the introduction to his Mishnah commentary says "the Talmudic learning of this man amazes every one who understands his words and the depth of his speculative spirit; so that it might almost be said of him that his equal has never existed." Judah ha-Levi eulogizes him in six poems which are full of his praise. Joseph ibn Migash's best known student is probably Maimon, the father and teacher of Maimonides. In Maimonides' Introduction to his Mishnah commentary, he heaps lavish praises upon Rabbi Joseph ibn Migash (Halevi), saying of him: “I have collected what I stumbled across from the glosses of my father, of blessed memory, as well as others under the name of our Rabbi Joseph Halevi, of blessed memory; and as the Lord lives, the understanding of that man in the Talmud is astounding, as anyone [can see] who observes his words and the depth of his comprehension, until I can say of him that 'there has never been any king like unto him before him''' (cf. 2 Kings 23:25) in his method [of elucidation]. I have also collected all of the legal matters (Heb. halachot) that I found that belonged to him in his commentaries, themselves.”There is a tradition that Maimonides himself was a pupil of Joseph ibn Migash. This probably arose from the frequent references in Maimonides' works to him as an authority. It is unlikely that he was literally taught by him, as Maimonides was 3 years old at the time of Joseph ibn Migash's death.
However, Maimonides' grandson published a pamphlet with the approval of his grandfather, in which it is described that Maimonides ran away from home in his youth, met Joseph ibn Migash, and studied under him for several years.
Works
Joseph ibn Migash authored over 200 responsa, She'elot u-Teshuvot Ri Migash - originally in Judeo-Arabic - many of which are quoted in Bezalel Ashkenazi's Shittah Mekubetzet. Five of Ibn Migash's responsa survived in Yemen, and were published by Rabbi Yosef Qafih in 1973. He specified Chananel Ben Chushiel and Alfasi as his authorities, but disagreed with Alfasi in about thirty some odd places related to Halacha.
He also authored a Talmudic commentary - ḥiddushim (novellae) on tractates Baba Batra (link here) and Shevuot (included in Joseph Samuel Modiano's Uryan Telitai'', Salonica 1795) - which is quoted by various Rishonim. His other works have been lost.
References
External links
Ibn Migas, Joseph (Jehosef) Ben Meïr Ha-Levi, jewishencyclopedia.com
Uryan Telitai
1077 births
1141 deaths
12th-century rabbis in al-Andalus
People from Seville
Rosh yeshivas
Authors of books on Jewish law
11th-century Jews from al-Andalus
|
```xml
<resources>
<!-- margin. -->
<dimen name="large_margin">20dp</dimen>
<dimen name="normal_margin">16dp</dimen>
<dimen name="little_margin">8dp</dimen>
<!-- elevator. -->
<dimen name="touch_rise_z">10dp</dimen>
<!-- image. -->
<dimen name="current_weather_icon_container_size">128dp</dimen>
<dimen name="current_weather_icon_size">80dp</dimen>
<dimen name="standard_weather_icon_container_size">88dp</dimen>
<dimen name="little_weather_icon_container_size">74dp</dimen>
<dimen name="standard_weather_icon_size">56dp</dimen>
<dimen name="little_weather_icon_size">42dp</dimen>
<dimen name="material_icon_size">24dp</dimen>
<!-- view. -->
<dimen name="material3_card_list_item_corner_radius">16dp</dimen>
<dimen name="material3_card_list_item_inner_radius">12dp</dimen>
<dimen name="material3_widget_corner_radius">16dp</dimen>
<dimen name="material3_widget_inner_radius">12dp</dimen>
<dimen name="spinner_drop_width">150dp</dimen>
<dimen name="share_view_height">260dp</dimen>
<dimen name="progress_view_size">36dp</dimen>
<dimen name="trend_item_width">56dp</dimen>
<dimen name="daily_trend_item_height">298dp</dimen>
<dimen name="hourly_trend_item_height">256dp</dimen>
<dimen name="action_bar_height">64dp</dimen>
<!-- text. -->
<dimen name="main_title_text_size">96sp</dimen>
<dimen name="design_title_text_size">48sp</dimen>
<dimen name="large_title_text_size">20sp</dimen>
<dimen name="title_text_size">16sp</dimen>
<dimen name="content_text_size">14sp</dimen>
<dimen name="subtitle_text_size">12sp</dimen>
<!-- widget. -->
<dimen name="widget_grid_1">40dp</dimen>
<dimen name="widget_grid_2">110dp</dimen>
<dimen name="widget_grid_3">180dp</dimen>
<dimen name="widget_grid_4">250dp</dimen>
<dimen name="widget_current_weather_icon_size">@dimen/standard_weather_icon_size</dimen> <!-- 56dp. -->
<dimen name="widget_standard_weather_icon_size">48dp</dimen>
<dimen name="widget_little_weather_icon_size">36dp</dimen>
<dimen name="widget_mini_weather_icon_size">24dp</dimen>
<dimen name="widget_design_title_text_size">30sp</dimen>
<dimen name="widget_large_title_text_size">@dimen/large_title_text_size</dimen> <!-- 20sp. -->
<dimen name="widget_title_text_size">@dimen/title_text_size</dimen> <!-- 16sp. -->
<dimen name="widget_subtitle_text_size">@dimen/subtitle_text_size</dimen> <!-- 12sp. -->
<dimen name="widget_content_text_size">@dimen/content_text_size</dimen> <!-- 14sp. -->
<dimen name="widget_time_text_size">10sp</dimen>
<dimen name="widget_aa_text_size">14dp</dimen>
</resources>
```
|
The FC Porto Museum, officially known as FC Porto Museum by BMG () for sponsorship reasons, is a museum located in Porto, dedicated to the history of the Portuguese association football club FC Porto. It was inaugurated on 28 September 2013, on occasion of the club's 120th anniversary, and opened its doors to the general public on 26 October.
Conceived and constructed by Sibina Partners (Barcelona) and MUSE (London), the museum occupies an area of almost under the east stand of the Estádio do Dragão. It contains 27 thematic areas with a strong interactive and technologic component, which showcase the club's historical events, matches, titles, managers and players, not only in football but in other sections, including handball, basketball and roller hockey. The central and dominant space features the club's large collection of domestic football silverware as well as its seven international trophies.
The museum also includes an auditorium, a club store, a coffeehouse, and spaces for educational services and temporary exhibitions. The Valquíria Dragão (Dragon Valkyrie), an exclusive work by Portuguese artist Joana Vasconcelos, which incorporates club textiles and trophies, welcomes visitors at the museum's entrance.
References
External links
Museum
Association football museums and halls of fame
Sports museums in Portugal
Museums in Porto
Museums established in 2013
Museum
Sport in Porto
|
Rhizocarpon is a genus of crustose, saxicolous (or sometimes lichenicolous), lichens in the family Rhizocarpaceae. The genus is common in arctic-alpine environments, but also occurs throughout temperate, subtropical, and even tropical regions. They are commonly known as map lichens because of the prothallus forming border-like bands between colonies in some species, like the common map lichen (Rhizocarpon geographicum).
Taxonomy and phylogeny
Together with three small genera (Catolechia, Poeltinula and Epilichen), Rhizocarpon constitutes the family Rhizocarpaceae. Historically, ca 389 names have been used. However, many species concepts are ill-defined, many names have been synonymized and new species are regularly being described, so true number of species is not entirely clear as of now, but is estimated to be around 200. In molecular work, the genus has also been shown to be paraphyletic, with closely related genera being nested within Rhizocarpon.
Common traits
With so many species in a morphologically diverse genus it is difficult to say something general about morphology and anatomy and there will inevitably be some exceptions. However, they do share some key traits. They are all crustose and mostly saxicolous (rock-living), with some being lichenicolous (lichen parasites) on other saxicolous lichens. They are all lecideoid, meaning they have apothecia without a thallus margin containing algae.
Ascus and ascospores
The genus has a distinct type of ascus, the Rhizocarpon-type, which is bitunicate with the inner ascus-wall being slightly apically thickened. Ascospores are considered important characters for determining species within the genus. They are either 2-celled (1-septate) or multi-celled (muriform) and are either hyaline or pigmented (green or brown), often with a characteristic halo () visible when viewed in a microscope. Asci contain eight, two or rarely one spore.
Species
, Species Fungorum (in the Catalogue of Life) accepts 75 species of Rhizopogon.
Rhizocarpon advenulum
Rhizocarpon alpicola
Rhizocarpon amphibium
Rhizocarpon anaperum
Rhizocarpon austroalpinum – Australia
Rhizocarpon austroamphibium – Australia
Rhizocarpon badioatrum
Rhizocarpon bicolor – Australia
Rhizocarpon caeruleoalbum
Rhizocarpon caesium – Europe
Rhizocarpon chioneum
Rhizocarpon cinereonigrum
Rhizocarpon cinereovirens
Rhizocarpon clausum
Rhizocarpon cleptophilum – Greenland
Rhizocarpon copelandii
Rhizocarpon dahlii
Rhizocarpon dimelaenae
Rhizocarpon diploschistinum
Rhizocarpon disporum
Rhizocarpon distinctum
Rhizocarpon eupetraeoides
Rhizocarpon exiguum – Australia
Rhizocarpon expallescens
Rhizocarpon ferax
Rhizocarpon flavomedullosum – Australia
Rhizocarpon furfurosum
Rhizocarpon geminatum
Rhizocarpon geographicum
Rhizocarpon grande
Rhizocarpon haidense
Rhizocarpon hochstetteri
Rhizocarpon inarense
Rhizocarpon infernulum
Rhizocarpon intermediellum
Rhizocarpon jemtlandicum
Rhizocarpon johnstonii
Rhizocarpon kerguelense
Rhizocarpon lavatum
Rhizocarpon lecanorinum
Rhizocarpon lusitanicum
Rhizocarpon malvinae – Falkland Islands
Rhizocarpon mawsonii
Rhizocarpon ochrolechiae
Rhizocarpon oederi
Rhizocarpon oxydatum – New Zealand
Rhizocarpon pallidum
Rhizocarpon petraeum
Rhizocarpon polycarpum
Rhizocarpon postumum
Rhizocarpon purpurascens – New Zealand
Rhizocarpon quinonum – Alaska
Rhizocarpon reductum
Rhizocarpon richardii
Rhizocarpon ridescens
Rhizocarpon roridulum
Rhizocarpon saurinum
Rhizocarpon simillimum
Rhizocarpon sipmanianum
Rhizocarpon smaragdulum – Siberia
Rhizocarpon subareolatum – Greenland
Rhizocarpon subgeminatum
Rhizocarpon sublavatum – Europe
Rhizocarpon submodestum
Rhizocarpon subpostumum
Rhizocarpon sulphurosum
Rhizocarpon sunchonense – South Korea
Rhizocarpon superficiale
Rhizocarpon tephromelae
Rhizocarpon timdalii – Europe; North America
Rhizocarpon tinei
Rhizocarpon torquatum /
Rhizocarpon transiens
Rhizocarpon tungurahuae
Rhizocarpon umbilicatum
Rhizocarpon umense
Rhizocarpon vigilans – Australia
Rhizocarpon viridiatrum
Rhizocarpon vulcani – Japan
Gallery
References
Rhizocarpaceae
Lichen genera
Lecanoromycetes genera
Taxa named by Augustin Pyramus de Candolle
Taxa described in 1805
|
Simona Brown (born 6 April 1994) is a British actress best known for her lead role in Behind Her Eyes.
Early life
Simona Brown grew up in Peckham, London, and is of Jamaican heritage. She studied musical theatre at the BRIT School in Croydon and studied acting at the Identity School of Acting in London.
Career
Brown has appeared in TV miniseries including as Gaia in The Casual Vacancy and as Grace in The Night Manager. She had a recurring role as Faith in HIM and as Roz in the 2016 British-American series Guilt. Her other TV roles include the 2016 remake of Roots and Murdered by My Boyfriend. She plays the main character Tess in the 2018 Channel 4/Netflix series Kiss Me First.
In August 2019, it was announced Brown had been cast in the role of Louise on the Netflix psychological thriller miniseries, Behind Her Eyes.
Filmography
Film
Television
References
External links
Living people
Black British actresses
English television actresses
21st-century English actresses
English people of Jamaican descent
1994 births
People from Peckham
Actresses from London
|
```yaml
---
#
#
# 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.
#
- hosts: localhost
connection: local
gather_facts: false
tasks:
- name: Load environment specific vars
include_vars:
file: "{{ lookup('env', 'PWD') }}/ansible/vars.yml"
- name: Load environment specific vault
include_vars:
file: "{{ lookup('env', 'PWD') }}/ansible/vault"
no_log: true
- name: Get TO Cookie
uri:
url: "{{ to_url }}/api/{{ to_api_version }}/user/login"
method: POST
body: '{ "u":"{{ tm_traffic_ops_username }}", "p":"{{ tmonitor_passwd }}" }'
headers:
Content-Type: "application/x-www-form-urlencoded"
validate_certs: no
follow_redirects: all
return_content: yes
timeout: 120
body_format: json
register: mojo_token
no_log: true
- name: Get All Servers
uri:
url: "{{ to_url }}/api/{{ to_api_version }}/servers"
method: GET
validate_certs: no
follow_redirects: all
return_content: yes
body_format: json
status_code: 200,400
timeout: 120
headers:
Cookie: "{{ mojo_token.set_cookie | default(omit) }}"
register: get_all_servers
- name: Get a list of InfluxDB servers
set_fact:
servers_map: "{{ get_all_servers.json | to_json | from_json | json_query(server_query) }}"
influxdb_profiles: "{{ get_all_servers.json | to_json | from_json | json_query(profile_query) | unique | sort }}"
vars:
server_query: 'response[?contains(profile,`INFLUXDB`) == `true` && contains(profile,`RELAY`) == `false`].{profile: profile, fqdn: join(`.`,[hostName,domainName])}'
profile_query: 'response[?contains(profile,`INFLUXDB`) == `true` && contains(profile,`RELAY`) == `false`].profile'
- hosts: influxrelay
gather_facts: yes
become: yes
tasks:
- name: Load environment specific vars
include_vars:
file: "{{ lookup('env', 'PWD') }}/ansible/vars.yml"
- name: Load environment specific vault
include_vars:
file: "{{ lookup('env', 'PWD') }}/ansible/vault"
no_log: true
- name: Convert TO data to InfluxDB Relay configuration
set_fact:
influxdb_relay_data: "{% set base_port = 9085 %}[{% for p in hostvars['localhost'].influxdb_profiles %}{%- set outer_loop = loop -%}{'type':'http','conf_object':{'name': '{{ p }}', 'bindaddr': '0.0.0.0:{{ base_port + loop.index }}', 'output': [ {% for s in hostvars['localhost'].servers_map if s.profile == p %}{ 'name': '{{(s.fqdn.split('.'))[0]}}', 'location': 'http://{{s.fqdn}}:8086/write' }{% endfor %} ] } }{%- if not outer_loop.last %},{% endif -%}{% endfor %}]"
- name: Deploy influxdb-relay
import_role:
name: influxdb_relay
vars:
install_influxdb_relay: true
influxdb_relay_conf: "{{ influxdb_relay_data }}"
```
|
Dead Hands Dig Deep is a 2016 documentary film and the directorial debut of Jai Love. The film follows a now thirty-eight-year-old Edwin Borsheim, vocalist of the band Kettle Cadaver as he reflects on his dark past.
Plot
Thirty-eight-year-old Edwin Borsheim of the band Kettle Cadaver was once known for his bizarre stage antics and brutal self-mutilation. Now, years after the band's demise, Borsheim has fallen into complete seclusion on his acre of land in which he is surrounded by many of the horrible things he has created. As Edwin spirals further into a hole of drug abuse and self-destruction, those closest to Borsheim dissect his mental complexes as he himself reflects on his dark past. Although Borsheim finds himself trapped in his own home, he just may be saved by human interaction.
Development
The film was shot in Temecula, California and produced by Lonesome Pictures. Prior to the production of the film, there was an extensive search for Edwin. Although his residence had been confirmed, there were different variables that stood in the way of actual contact. At the time, Borsheim had no phone or email and his property was guarded by his watch-dogs which made it virtually impossible to come in contact with him. After resigning the idea of making the film, Borsheim's relatives activated a phone for him and put the filmmakers in contact. The film began production months after they started their search.
On the first day of principle shooting, Edwin began directing violent threats at the film crew. Borsheim made it clear, that until the production of the film, nobody had entered his house in over a year. He'd been completely alone there. When first in talks with Borsheim over the phone, the filmmakers began receiving pictures from Borsheim portraying a variety of disturbing imagery. As production continued, other members of the crew began to receive similar pictures. Due to the hostility that both Edwin and his brother Danny held for their mother, both refused to see her for the film. After much pleading from the producers, Danny escorted the crew to see his mother to interview her for the documentary. Multiple times during post-production, Edwin went off the grid. His phone was de-activated many times and he was on and off of his property. Borsheim's property was meant to be seized due to not paying property tax, and began making it clear that he planned to kill anyone who tried to take his property away and commit suicide once he came back into contact with the producers. Eventually, his family intervened and paid his property tax.
When the film was completed Edwin revealed to the crew that he had planned to murder them all, but he couldn't bring himself to do it. He called this attempt at infamy ‘Kettle Cadaver 3’ and ended up welding his gun cabinet shut as a result of the failed execution.
Edwin called making the film therapeutic and often stayed in contact with the crew post-production. Edwin attended a special screening of the film at the ArcLight cinema in Hollywood. Edwin died by suicide on June 20, 2017.
Reception
The film has received positive reviews from The Hollywood Reporter calling it 'a haunting study of depravity', Indiewire, and Roger Ebert. The film has also screened at several film festivals including Slamdance Film Festival, Fantasia International Film Festival, Lausanne Underground Film and Music Festival, Sidewalk Moving Picture Festival and Sydney Underground Film Festival.
Release
The documentary premiered at the 2016 Slamdance Film Festival in Park City, Utah and was purchased by Slamdance Studios, who sold onto Hulu as well as Monster Pictures who handled a special edition DVD. The film was released theatrically and on VOD in November, 2017.
References
External links
Documentary films about heavy metal music and musicians
2016 films
2010s English-language films
|
```c
/*
*
* This file is part of System Informer.
*
* Authors:
*
* wj32 2010-2016
* dmex 2017-2022
*
*/
/*
* This file contains a program-specific settings system. All possible
* settings are defined at program startup and added to a hashtable.
* The values of these settings can then be read in from a XML file or
* saved to a XML file at any time. Settings which are not recognized
* are added to a list of "ignored settings"; this is necessary to
* support plugin settings, as we don't want their settings to get
* deleted whenever the plugins are disabled.
*
* The get/set functions are very strict. If the wrong function is used
* (the get-integer-setting function is used on a string setting) or
* the setting does not exist, an exception will be raised.
*/
#include <ph.h>
#include <guisup.h>
#include <settings.h>
#include <json.h>
BOOLEAN NTAPI PhpSettingsHashtableEqualFunction(
_In_ PVOID Entry1,
_In_ PVOID Entry2
);
ULONG NTAPI PhpSettingsHashtableHashFunction(
_In_ PVOID Entry
);
PPH_HASHTABLE PhSettingsHashtable;
PH_QUEUED_LOCK PhSettingsLock = PH_QUEUED_LOCK_INIT;
PPH_LIST PhIgnoredSettings;
VOID PhSettingsInitialization(
VOID
)
{
PhSettingsHashtable = PhCreateHashtable(
sizeof(PH_SETTING),
PhpSettingsHashtableEqualFunction,
PhpSettingsHashtableHashFunction,
512
);
PhIgnoredSettings = PhCreateList(4);
}
BOOLEAN NTAPI PhpSettingsHashtableEqualFunction(
_In_ PVOID Entry1,
_In_ PVOID Entry2
)
{
PPH_SETTING setting1 = (PPH_SETTING)Entry1;
PPH_SETTING setting2 = (PPH_SETTING)Entry2;
return PhEqualStringRef(&setting1->Name, &setting2->Name, FALSE);
}
ULONG NTAPI PhpSettingsHashtableHashFunction(
_In_ PVOID Entry
)
{
PPH_SETTING setting = (PPH_SETTING)Entry;
return PhHashStringRefEx(&setting->Name, FALSE, PH_STRING_HASH_X65599);
}
PPH_STRING PhSettingToString(
_In_ PH_SETTING_TYPE Type,
_In_ PPH_SETTING Setting
)
{
switch (Type)
{
case StringSettingType:
{
if (!Setting->u.Pointer)
return PhReferenceEmptyString();
PhReferenceObject(Setting->u.Pointer);
return (PPH_STRING)Setting->u.Pointer;
}
case IntegerSettingType:
{
PH_FORMAT format[1];
// %x
PhInitFormatX(&format[0], Setting->u.Integer);
return PhFormat(format, RTL_NUMBER_OF(format), 0);
}
case IntegerPairSettingType:
{
PPH_INTEGER_PAIR integerPair = &Setting->u.IntegerPair;
PH_FORMAT format[3];
// %ld,%ld
PhInitFormatD(&format[0], integerPair->X);
PhInitFormatC(&format[1], L',');
PhInitFormatD(&format[2], integerPair->Y);
return PhFormat(format, RTL_NUMBER_OF(format), 0);
}
case ScalableIntegerPairSettingType:
{
PPH_SCALABLE_INTEGER_PAIR scalableIntegerPair = Setting->u.Pointer;
PH_FORMAT format[6];
if (!scalableIntegerPair)
return PhReferenceEmptyString();
// @%lu|%ld,%ld
PhInitFormatC(&format[0], L'@');
PhInitFormatU(&format[1], scalableIntegerPair->Scale);
PhInitFormatC(&format[2], L'|');
PhInitFormatD(&format[3], scalableIntegerPair->X);
PhInitFormatC(&format[4], L',');
PhInitFormatD(&format[5], scalableIntegerPair->Y);
return PhFormat(format, RTL_NUMBER_OF(format), 0);
}
}
return PhReferenceEmptyString();
}
BOOLEAN PhSettingFromString(
_In_ PH_SETTING_TYPE Type,
_In_ PPH_STRINGREF StringRef,
_In_opt_ PPH_STRING String,
_In_ LONG dpiValue,
_Inout_ PPH_SETTING Setting
)
{
switch (Type)
{
case StringSettingType:
{
if (String)
{
PhSetReference(&Setting->u.Pointer, String);
}
else
{
Setting->u.Pointer = PhCreateString2(StringRef);
}
return TRUE;
}
case IntegerSettingType:
{
ULONG64 integer;
if (PhStringToInteger64(StringRef, 16, &integer))
{
Setting->u.Integer = (ULONG)integer;
return TRUE;
}
else
{
return FALSE;
}
}
case IntegerPairSettingType:
{
LONG64 x;
LONG64 y;
PH_STRINGREF xString;
PH_STRINGREF yString;
if (!PhSplitStringRefAtChar(StringRef, L',', &xString, &yString))
return FALSE;
if (PhStringToInteger64(&xString, 10, &x) && PhStringToInteger64(&yString, 10, &y))
{
Setting->u.IntegerPair.X = (LONG)x;
Setting->u.IntegerPair.Y = (LONG)y;
return TRUE;
}
else
{
return FALSE;
}
}
case ScalableIntegerPairSettingType:
{
ULONG64 scale;
LONG64 x;
LONG64 y;
PH_STRINGREF stringRef;
PH_STRINGREF firstPart;
PH_STRINGREF secondPart;
PPH_SCALABLE_INTEGER_PAIR scalableIntegerPair;
stringRef = *StringRef;
if (stringRef.Length != 0 && stringRef.Buffer[0] == L'@')
{
PhSkipStringRef(&stringRef, sizeof(WCHAR));
if (!PhSplitStringRefAtChar(&stringRef, L'|', &firstPart, &stringRef))
return FALSE;
if (!PhStringToInteger64(&firstPart, 10, &scale))
return FALSE;
}
else
{
scale = dpiValue;
}
if (!PhSplitStringRefAtChar(&stringRef, L',', &firstPart, &secondPart))
return FALSE;
if (PhStringToInteger64(&firstPart, 10, &x) && PhStringToInteger64(&secondPart, 10, &y))
{
scalableIntegerPair = PhAllocate(sizeof(PH_SCALABLE_INTEGER_PAIR));
scalableIntegerPair->X = (LONG)x;
scalableIntegerPair->Y = (LONG)y;
scalableIntegerPair->Scale = (ULONG)scale;
Setting->u.Pointer = scalableIntegerPair;
return TRUE;
}
else
{
return FALSE;
}
}
}
return FALSE;
}
static VOID PhpFreeSettingValue(
_In_ PH_SETTING_TYPE Type,
_In_ PPH_SETTING Setting
)
{
switch (Type)
{
case StringSettingType:
PhClearReference(&Setting->u.Pointer);
break;
case ScalableIntegerPairSettingType:
PhFree(Setting->u.Pointer);
Setting->u.Pointer = NULL;
break;
}
}
static PVOID PhpLookupSetting(
_In_ PPH_STRINGREF Name
)
{
PH_SETTING lookupSetting;
PPH_SETTING setting;
lookupSetting.Name = *Name;
setting = (PPH_SETTING)PhFindEntryHashtable(
PhSettingsHashtable,
&lookupSetting
);
return setting;
}
VOID PhEnumSettings(
_In_ PPH_SETTINGS_ENUM_CALLBACK Callback,
_In_ PVOID Context
)
{
PH_HASHTABLE_ENUM_CONTEXT enumContext;
PPH_SETTING setting;
PhAcquireQueuedLockExclusive(&PhSettingsLock);
PhBeginEnumHashtable(PhSettingsHashtable, &enumContext);
while (setting = PhNextEnumHashtable(&enumContext))
{
if (!Callback(setting, Context))
break;
}
PhReleaseQueuedLockExclusive(&PhSettingsLock);
}
_May_raise_ ULONG PhGetIntegerStringRefSetting(
_In_ PPH_STRINGREF Name
)
{
PPH_SETTING setting;
ULONG value;
PhAcquireQueuedLockShared(&PhSettingsLock);
setting = PhpLookupSetting(Name);
if (setting && setting->Type == IntegerSettingType)
{
value = setting->u.Integer;
}
else
{
setting = NULL;
}
PhReleaseQueuedLockShared(&PhSettingsLock);
if (!setting)
PhRaiseStatus(STATUS_NOT_FOUND);
return value;
}
_May_raise_ PH_INTEGER_PAIR PhGetIntegerPairStringRefSetting(
_In_ PPH_STRINGREF Name
)
{
PPH_SETTING setting;
PH_INTEGER_PAIR value;
PhAcquireQueuedLockShared(&PhSettingsLock);
setting = PhpLookupSetting(Name);
if (setting && setting->Type == IntegerPairSettingType)
{
value = setting->u.IntegerPair;
}
else
{
setting = NULL;
}
PhReleaseQueuedLockShared(&PhSettingsLock);
if (!setting)
PhRaiseStatus(STATUS_NOT_FOUND);
return value;
}
_May_raise_ PH_SCALABLE_INTEGER_PAIR PhGetScalableIntegerPairStringRefSetting(
_In_ PPH_STRINGREF Name,
_In_ BOOLEAN ScaleToCurrent,
_In_ LONG dpiValue
)
{
PPH_SETTING setting;
PH_SCALABLE_INTEGER_PAIR value;
PhAcquireQueuedLockShared(&PhSettingsLock);
setting = PhpLookupSetting(Name);
if (setting && setting->Type == ScalableIntegerPairSettingType)
{
value = *(PPH_SCALABLE_INTEGER_PAIR)setting->u.Pointer;
}
else
{
setting = NULL;
}
PhReleaseQueuedLockShared(&PhSettingsLock);
if (!setting)
PhRaiseStatus(STATUS_NOT_FOUND);
if (ScaleToCurrent)
{
if (value.Scale != dpiValue && value.Scale != 0)
{
value.X = PhMultiplyDivideSigned(value.X, dpiValue, value.Scale);
value.Y = PhMultiplyDivideSigned(value.Y, dpiValue, value.Scale);
value.Scale = dpiValue;
}
}
return value;
}
_May_raise_ PPH_STRING PhGetStringRefSetting(
_In_ PPH_STRINGREF Name
)
{
PPH_SETTING setting;
PPH_STRING value;
PhAcquireQueuedLockShared(&PhSettingsLock);
setting = PhpLookupSetting(Name);
if (setting && setting->Type == StringSettingType)
{
if (setting->u.Pointer)
{
PhSetReference(&value, setting->u.Pointer);
}
else
{
// Set to NULL, create an empty string
// outside of the lock.
value = NULL;
}
}
else
{
setting = NULL;
}
PhReleaseQueuedLockShared(&PhSettingsLock);
if (!setting)
PhRaiseStatus(STATUS_NOT_FOUND);
if (!value)
value = PhReferenceEmptyString();
return value;
}
_May_raise_ BOOLEAN PhGetBinarySetting(
_In_ PWSTR Name,
_Out_ PVOID Buffer
)
{
PPH_STRING setting;
BOOLEAN result;
setting = PhGetStringSetting(Name);
result = PhHexStringToBuffer(&setting->sr, (PUCHAR)Buffer);
PhDereferenceObject(setting);
return result;
}
_May_raise_ VOID PhSetIntegerStringRefSetting(
_In_ PPH_STRINGREF Name,
_In_ ULONG Value
)
{
PPH_SETTING setting;
PhAcquireQueuedLockExclusive(&PhSettingsLock);
setting = PhpLookupSetting(Name);
if (setting && setting->Type == IntegerSettingType)
{
setting->u.Integer = Value;
}
PhReleaseQueuedLockExclusive(&PhSettingsLock);
if (!setting)
PhRaiseStatus(STATUS_NOT_FOUND);
}
_May_raise_ VOID PhSetIntegerPairStringRefSetting(
_In_ PPH_STRINGREF Name,
_In_ PH_INTEGER_PAIR Value
)
{
PPH_SETTING setting;
PhAcquireQueuedLockExclusive(&PhSettingsLock);
setting = PhpLookupSetting(Name);
if (setting && setting->Type == IntegerPairSettingType)
{
setting->u.IntegerPair = Value;
}
PhReleaseQueuedLockExclusive(&PhSettingsLock);
if (!setting)
PhRaiseStatus(STATUS_NOT_FOUND);
}
_May_raise_ VOID PhSetScalableIntegerPairStringRefSetting(
_In_ PPH_STRINGREF Name,
_In_ PH_SCALABLE_INTEGER_PAIR Value
)
{
PPH_SETTING setting;
PhAcquireQueuedLockExclusive(&PhSettingsLock);
setting = PhpLookupSetting(Name);
if (setting && setting->Type == ScalableIntegerPairSettingType)
{
PhpFreeSettingValue(ScalableIntegerPairSettingType, setting);
setting->u.Pointer = PhAllocateCopy(&Value, sizeof(PH_SCALABLE_INTEGER_PAIR));
}
PhReleaseQueuedLockExclusive(&PhSettingsLock);
if (!setting)
PhRaiseStatus(STATUS_NOT_FOUND);
}
_May_raise_ VOID PhSetScalableIntegerPairStringRefSetting2(
_In_ PPH_STRINGREF Name,
_In_ PH_INTEGER_PAIR Value,
_In_ LONG dpiValue
)
{
PH_SCALABLE_INTEGER_PAIR scalableIntegerPair;
scalableIntegerPair.Pair = Value;
scalableIntegerPair.Scale = dpiValue;
PhSetScalableIntegerPairStringRefSetting(Name, scalableIntegerPair);
}
_May_raise_ VOID PhSetStringRefSetting(
_In_ PPH_STRINGREF Name,
_In_ PPH_STRINGREF Value
)
{
PPH_SETTING setting;
PhAcquireQueuedLockExclusive(&PhSettingsLock);
setting = PhpLookupSetting(Name);
if (setting && setting->Type == StringSettingType)
{
PhpFreeSettingValue(StringSettingType, setting);
setting->u.Pointer = PhCreateString2(Value);
}
PhReleaseQueuedLockExclusive(&PhSettingsLock);
if (!setting)
PhRaiseStatus(STATUS_NOT_FOUND);
}
VOID PhpFreeIgnoredSetting(
_In_ PPH_SETTING Setting
)
{
PhFree(Setting->Name.Buffer);
PhDereferenceObject(Setting->u.Pointer);
PhFree(Setting);
}
VOID PhpClearIgnoredSettings(
VOID
)
{
ULONG i;
PhAcquireQueuedLockExclusive(&PhSettingsLock);
for (i = 0; i < PhIgnoredSettings->Count; i++)
{
PhpFreeIgnoredSetting(PhIgnoredSettings->Items[i]);
}
PhClearList(PhIgnoredSettings);
PhReleaseQueuedLockExclusive(&PhSettingsLock);
}
VOID PhClearIgnoredSettings(
VOID
)
{
PhpClearIgnoredSettings();
}
ULONG PhCountIgnoredSettings(
VOID
)
{
ULONG count;
PhAcquireQueuedLockShared(&PhSettingsLock);
count = PhIgnoredSettings->Count;
PhReleaseQueuedLockShared(&PhSettingsLock);
return count;
}
VOID PhConvertIgnoredSettings(
VOID
)
{
PPH_SETTING ignoredSetting;
PPH_SETTING setting;
ULONG i;
PhAcquireQueuedLockExclusive(&PhSettingsLock);
for (i = 0; i < PhIgnoredSettings->Count; i++)
{
ignoredSetting = PhIgnoredSettings->Items[i];
setting = PhpLookupSetting(&ignoredSetting->Name);
if (setting)
{
PhpFreeSettingValue(setting->Type, setting);
if (!PhSettingFromString(
setting->Type,
&((PPH_STRING)ignoredSetting->u.Pointer)->sr,
ignoredSetting->u.Pointer,
PhSystemDpi,
setting
))
{
PhSettingFromString(
setting->Type,
&setting->DefaultValue,
NULL,
PhSystemDpi,
setting
);
}
PhpFreeIgnoredSetting(ignoredSetting);
PhRemoveItemList(PhIgnoredSettings, i);
i--;
}
}
PhReleaseQueuedLockExclusive(&PhSettingsLock);
}
NTSTATUS PhLoadSettings(
_In_ PPH_STRINGREF FileName
)
{
NTSTATUS status;
PVOID topNode;
PVOID currentNode;
PPH_SETTING setting;
PPH_STRING settingName;
PPH_STRING settingValue;
PhpClearIgnoredSettings();
if (!NT_SUCCESS(status = PhLoadXmlObjectFromFile(FileName, &topNode)))
return status;
if (!topNode) // Return corrupt status and reset the settings.
return STATUS_FILE_CORRUPT_ERROR;
currentNode = PhGetXmlNodeFirstChild(topNode);
while (currentNode)
{
if (settingName = PhGetXmlNodeAttributeText(currentNode, "name"))
{
settingValue = PhGetXmlNodeOpaqueText(currentNode);
PhAcquireQueuedLockExclusive(&PhSettingsLock);
{
setting = PhpLookupSetting(&settingName->sr);
if (setting)
{
PhpFreeSettingValue(setting->Type, setting);
if (!PhSettingFromString(
setting->Type,
&settingValue->sr,
settingValue,
PhSystemDpi,
setting
))
{
PhSettingFromString(
setting->Type,
&setting->DefaultValue,
NULL,
PhSystemDpi,
setting
);
}
}
else
{
setting = PhAllocate(sizeof(PH_SETTING));
setting->Name.Buffer = PhAllocateCopy(settingName->Buffer, settingName->Length + sizeof(WCHAR));
setting->Name.Length = settingName->Length;
PhReferenceObject(settingValue);
setting->u.Pointer = settingValue;
PhAddItemList(PhIgnoredSettings, setting);
}
}
PhReleaseQueuedLockExclusive(&PhSettingsLock);
PhDereferenceObject(settingValue);
PhDereferenceObject(settingName);
}
currentNode = PhGetXmlNodeNextChild(currentNode);
}
PhFreeXmlObject(topNode);
return STATUS_SUCCESS;
}
PSTR PhpSettingsSaveCallback(
_In_ PVOID node,
_In_ INT position
)
{
#define MXML_WS_AFTER_OPEN 1
#define MXML_WS_AFTER_CLOSE 3
PSTR elementName;
if (!(elementName = PhGetXmlNodeElementText(node)))
return NULL;
if (PhEqualBytesZ(elementName, "setting", TRUE))
{
if (position == MXML_WS_AFTER_CLOSE)
return "\r\n";
}
else if (PhEqualBytesZ(elementName, "settings", TRUE))
{
if (position == MXML_WS_AFTER_OPEN)
return "\r\n";
}
return NULL;
}
PVOID PhpCreateSettingElement(
_Inout_ PVOID ParentNode,
_In_ PPH_STRINGREF SettingName,
_In_ PPH_STRINGREF SettingValue
)
{
PVOID settingNode;
PPH_BYTES settingNameUtf8;
PPH_BYTES settingValueUtf8;
// Create the setting element.
settingNode = PhCreateXmlNode(ParentNode, "setting");
settingNameUtf8 = PhConvertUtf16ToUtf8Ex(SettingName->Buffer, SettingName->Length);
PhSetXmlNodeAttributeText(settingNode, "name", settingNameUtf8->Buffer);
PhDereferenceObject(settingNameUtf8);
// Set the value.
settingValueUtf8 = PhConvertUtf16ToUtf8Ex(SettingValue->Buffer, SettingValue->Length);
PhCreateXmlOpaqueNode(settingNode, settingValueUtf8->Buffer);
PhDereferenceObject(settingValueUtf8);
return settingNode;
}
NTSTATUS PhSaveSettings(
_In_ PPH_STRINGREF FileName
)
{
NTSTATUS status;
PVOID topNode;
PH_HASHTABLE_ENUM_CONTEXT enumContext;
PPH_SETTING setting;
topNode = PhCreateXmlNode(NULL, "settings");
PhAcquireQueuedLockShared(&PhSettingsLock);
PhBeginEnumHashtable(PhSettingsHashtable, &enumContext);
while (setting = PhNextEnumHashtable(&enumContext))
{
PPH_STRING settingValue;
settingValue = PhSettingToString(setting->Type, setting);
PhpCreateSettingElement(topNode, &setting->Name, &settingValue->sr);
PhDereferenceObject(settingValue);
}
// Write the ignored settings.
for (ULONG i = 0; i < PhIgnoredSettings->Count; i++)
{
PPH_STRING settingValue;
setting = PhIgnoredSettings->Items[i];
settingValue = setting->u.Pointer;
PhpCreateSettingElement(topNode, &setting->Name, &settingValue->sr);
}
PhReleaseQueuedLockShared(&PhSettingsLock);
status = PhSaveXmlObjectToFile(
FileName,
topNode,
PhpSettingsSaveCallback
);
PhFreeXmlObject(topNode);
return status;
}
VOID PhResetSettings(
_In_ HWND hwnd
)
{
PH_HASHTABLE_ENUM_CONTEXT enumContext;
PPH_SETTING setting;
LONG dpiValue;
dpiValue = PhGetWindowDpi(hwnd);
PhAcquireQueuedLockExclusive(&PhSettingsLock);
PhBeginEnumHashtable(PhSettingsHashtable, &enumContext);
while (setting = PhNextEnumHashtable(&enumContext))
{
PhpFreeSettingValue(setting->Type, setting);
PhSettingFromString(setting->Type, &setting->DefaultValue, NULL, dpiValue, setting);
}
PhReleaseQueuedLockExclusive(&PhSettingsLock);
}
VOID PhAddSetting(
_In_ PH_SETTING_TYPE Type,
_In_ PPH_STRINGREF Name,
_In_ PPH_STRINGREF DefaultValue
)
{
PH_SETTING setting;
setting.Type = Type;
setting.Name = *Name;
setting.DefaultValue = *DefaultValue;
memset(&setting.u, 0, sizeof(setting.u));
PhSettingFromString(Type, &setting.DefaultValue, NULL, PhSystemDpi, &setting);
PhAddEntryHashtable(PhSettingsHashtable, &setting);
}
VOID PhAddSettings(
_In_ PPH_SETTING_CREATE Settings,
_In_ ULONG NumberOfSettings
)
{
ULONG i;
PhAcquireQueuedLockExclusive(&PhSettingsLock);
for (i = 0; i < NumberOfSettings; i++)
{
PH_STRINGREF name;
PH_STRINGREF defaultValue;
PhInitializeStringRefLongHint(&name, Settings[i].Name);
PhInitializeStringRefLongHint(&defaultValue, Settings[i].DefaultValue);
PhAddSetting(Settings[i].Type, &name, &defaultValue);
}
PhReleaseQueuedLockExclusive(&PhSettingsLock);
}
PPH_SETTING PhGetSetting(
_In_ PPH_STRINGREF Name
)
{
PPH_SETTING setting;
PhAcquireQueuedLockShared(&PhSettingsLock);
setting = PhpLookupSetting(Name);
PhReleaseQueuedLockShared(&PhSettingsLock);
return setting;
}
VOID PhLoadWindowPlacementFromSetting(
_In_opt_ PWSTR PositionSettingName,
_In_opt_ PWSTR SizeSettingName,
_In_ HWND WindowHandle
)
{
if (PositionSettingName && SizeSettingName)
{
PH_RECTANGLE windowRectangle = { 0 };
LONG dpi;
RECT rect;
RECT rectForAdjust;
windowRectangle.Position = PhGetIntegerPairSetting(PositionSettingName);
rect = PhRectangleToRect(windowRectangle);
dpi = PhGetMonitorDpi(&rect);
windowRectangle.Size = PhGetScalableIntegerPairSetting(SizeSettingName, TRUE, dpi).Pair;
PhAdjustRectangleToWorkingArea(NULL, &windowRectangle);
// Let the window adjust for the minimum size if needed.
rectForAdjust = PhRectangleToRect(windowRectangle);
SendMessage(WindowHandle, WM_SIZING, WMSZ_BOTTOMRIGHT, (LPARAM)&rectForAdjust);
windowRectangle = PhRectToRectangle(rectForAdjust);
MoveWindow(WindowHandle, windowRectangle.Left, windowRectangle.Top,
windowRectangle.Width, windowRectangle.Height, FALSE);
}
else
{
PH_RECTANGLE windowRectangle;
PH_INTEGER_PAIR position;
PH_INTEGER_PAIR size;
ULONG flags;
LONG dpi;
flags = SWP_NOACTIVATE | SWP_NOMOVE | SWP_NOREDRAW | SWP_NOSIZE | SWP_NOZORDER;
if (PositionSettingName)
{
position = PhGetIntegerPairSetting(PositionSettingName);
flags &= ~SWP_NOMOVE;
}
else
{
position.X = 0;
position.Y = 0;
}
if (SizeSettingName)
{
dpi = PhGetWindowDpi(WindowHandle);
size = PhGetScalableIntegerPairSetting(SizeSettingName, TRUE, dpi).Pair;
flags &= ~SWP_NOSIZE;
}
else
{
RECT windowRect;
// Make sure the window doesn't get positioned on disconnected monitors. (dmex)
//size.X = 16;
//size.Y = 16;
GetWindowRect(WindowHandle, &windowRect);
size.X = windowRect.right - windowRect.left;
size.Y = windowRect.bottom - windowRect.top;
}
// Make sure the window doesn't get positioned on disconnected monitors. (dmex)
windowRectangle.Position = position;
windowRectangle.Size = size;
PhAdjustRectangleToWorkingArea(NULL, &windowRectangle);
SetWindowPos(WindowHandle, NULL, windowRectangle.Left, windowRectangle.Top, size.X, size.Y, flags);
}
}
VOID PhSaveWindowPlacementToSetting(
_In_opt_ PWSTR PositionSettingName,
_In_opt_ PWSTR SizeSettingName,
_In_ HWND WindowHandle
)
{
WINDOWPLACEMENT placement = { sizeof(placement) };
PH_RECTANGLE windowRectangle;
MONITORINFO monitorInfo = { sizeof(MONITORINFO) };
RECT rect;
LONG dpi;
GetWindowPlacement(WindowHandle, &placement);
windowRectangle = PhRectToRectangle(placement.rcNormalPosition);
// The rectangle is in workspace coordinates. Convert the values back to screen coordinates.
if (GetMonitorInfo(MonitorFromRect(&placement.rcNormalPosition, MONITOR_DEFAULTTOPRIMARY), &monitorInfo))
{
windowRectangle.Left += monitorInfo.rcWork.left - monitorInfo.rcMonitor.left;
windowRectangle.Top += monitorInfo.rcWork.top - monitorInfo.rcMonitor.top;
}
rect = PhRectangleToRect(windowRectangle);
dpi = PhGetMonitorDpi(&rect); // PhGetWindowDpi(WindowHandle);
if (PositionSettingName)
PhSetIntegerPairSetting(PositionSettingName, windowRectangle.Position);
if (SizeSettingName)
PhSetScalableIntegerPairSetting2(SizeSettingName, windowRectangle.Size, dpi);
}
BOOLEAN PhLoadListViewColumnSettings(
_In_ HWND ListViewHandle,
_In_ PPH_STRING Settings
)
{
#define ORDER_LIMIT 50
PH_STRINGREF remainingPart;
ULONG columnIndex;
ULONG orderArray[ORDER_LIMIT]; // HACK, but reasonable limit
ULONG maxOrder;
ULONG scale;
LONG dpi;
#ifdef DEBUG
HWND headerHandle = ListView_GetHeader(ListViewHandle);
assert(Header_GetItemCount(headerHandle) < ORDER_LIMIT);
#endif
if (PhIsNullOrEmptyString(Settings))
return FALSE;
dpi = PhGetWindowDpi(ListViewHandle);
remainingPart = Settings->sr;
columnIndex = 0;
memset(orderArray, 0, sizeof(orderArray));
maxOrder = 0;
if (remainingPart.Length != 0 && remainingPart.Buffer[0] == L'@')
{
PH_STRINGREF scalePart;
ULONG64 integer;
PhSkipStringRef(&remainingPart, sizeof(WCHAR));
PhSplitStringRefAtChar(&remainingPart, L'|', &scalePart, &remainingPart);
if (scalePart.Length == 0 || !PhStringToInteger64(&scalePart, 10, &integer))
return FALSE;
scale = (ULONG)integer;
}
else
{
scale = dpi;
}
while (remainingPart.Length != 0)
{
PH_STRINGREF columnPart;
PH_STRINGREF orderPart;
PH_STRINGREF widthPart;
ULONG64 integer;
ULONG order;
LONG width;
LVCOLUMN lvColumn;
PhSplitStringRefAtChar(&remainingPart, L'|', &columnPart, &remainingPart);
if (columnPart.Length == 0)
return FALSE;
PhSplitStringRefAtChar(&columnPart, L',', &orderPart, &widthPart);
if (orderPart.Length == 0 || widthPart.Length == 0)
return FALSE;
// Order
if (!PhStringToInteger64(&orderPart, 10, &integer))
return FALSE;
order = (ULONG)integer;
if (order < ORDER_LIMIT)
{
orderArray[order] = columnIndex;
if (maxOrder < order + 1)
maxOrder = order + 1;
}
// Width
if (!PhStringToInteger64(&widthPart, 10, &integer))
return FALSE;
width = (LONG)integer;
if (scale != dpi && scale != 0)
width = PhMultiplyDivideSigned(width, dpi, scale);
lvColumn.mask = LVCF_WIDTH;
lvColumn.cx = width;
ListView_SetColumn(ListViewHandle, columnIndex, &lvColumn);
columnIndex++;
}
ListView_SetColumnOrderArray(ListViewHandle, maxOrder, orderArray);
return TRUE;
}
PPH_STRING PhSaveListViewColumnSettings(
_In_ HWND ListViewHandle
)
{
PH_STRING_BUILDER stringBuilder;
ULONG i = 0;
LVCOLUMN lvColumn;
LONG dpiValue;
PhInitializeStringBuilder(&stringBuilder, 20);
dpiValue = PhGetWindowDpi(ListViewHandle);
{
PH_FORMAT format[3];
SIZE_T returnLength;
WCHAR buffer[PH_INT64_STR_LEN_1];
// @%lu|
PhInitFormatC(&format[0], L'@');
PhInitFormatU(&format[1], dpiValue);
PhInitFormatC(&format[2], L'|');
if (PhFormatToBuffer(format, RTL_NUMBER_OF(format), buffer, sizeof(buffer), &returnLength))
{
PhAppendStringBuilderEx(&stringBuilder, buffer, returnLength - sizeof(UNICODE_NULL));
}
else
{
PhAppendFormatStringBuilder(&stringBuilder, L"@%lu|", dpiValue);
}
}
lvColumn.mask = LVCF_WIDTH | LVCF_ORDER;
while (ListView_GetColumn(ListViewHandle, i, &lvColumn))
{
PH_FORMAT format[4];
SIZE_T returnLength;
WCHAR buffer[PH_INT64_STR_LEN_1];
// %u,%u|
PhInitFormatU(&format[0], lvColumn.iOrder);
PhInitFormatC(&format[1], L',');
PhInitFormatU(&format[2], lvColumn.cx);
PhInitFormatC(&format[3], L'|');
if (PhFormatToBuffer(format, RTL_NUMBER_OF(format), buffer, sizeof(buffer), &returnLength))
{
PhAppendStringBuilderEx(&stringBuilder, buffer, returnLength - sizeof(UNICODE_NULL));
}
else
{
PhAppendFormatStringBuilder(
&stringBuilder,
L"%u,%u|",
lvColumn.iOrder,
lvColumn.cx
);
}
i++;
}
if (stringBuilder.String->Length != 0)
PhRemoveEndStringBuilder(&stringBuilder, 1);
return PhFinalStringBuilderString(&stringBuilder);
}
VOID PhLoadListViewColumnsFromSetting(
_In_ PWSTR Name,
_In_ HWND ListViewHandle
)
{
PPH_STRING string;
string = PhGetStringSetting(Name);
PhLoadListViewColumnSettings(ListViewHandle, string);
PhDereferenceObject(string);
}
VOID PhSaveListViewColumnsToSetting(
_In_ PWSTR Name,
_In_ HWND ListViewHandle
)
{
PPH_STRING string;
string = PhSaveListViewColumnSettings(ListViewHandle);
PhSetStringSetting2(Name, &string->sr);
PhDereferenceObject(string);
}
VOID PhLoadListViewSortColumnsFromSetting(
_In_ PWSTR Name,
_In_ HWND ListViewHandle
)
{
PPH_STRING string;
ULONG sortColumn = 0;
PH_SORT_ORDER sortOrder = AscendingSortOrder;
PH_STRINGREF remainingPart;
string = PhGetStringSetting(Name);
if (PhIsNullOrEmptyString(string))
return;
remainingPart = string->sr;
if (remainingPart.Length != 0)
{
PH_STRINGREF columnPart;
PH_STRINGREF orderPart;
ULONG64 integer;
if (!PhSplitStringRefAtChar(&remainingPart, L',', &columnPart, &orderPart))
return;
if (!PhStringToInteger64(&columnPart, 10, &integer))
return;
sortColumn = (ULONG)integer;
if (!PhStringToInteger64(&orderPart, 10, &integer))
return;
sortOrder = (ULONG)integer;
}
ExtendedListView_SetSort(ListViewHandle, sortColumn, sortOrder);
PhDereferenceObject(string);
}
VOID PhSaveListViewSortColumnsToSetting(
_In_ PWSTR Name,
_In_ HWND ListViewHandle
)
{
PPH_STRING string;
ULONG sortColumn = 0;
PH_SORT_ORDER sortOrder = AscendingSortOrder;
if (ExtendedListView_GetSort(ListViewHandle, &sortColumn, &sortOrder))
{
PH_FORMAT format[3];
// %lu,%lu
PhInitFormatU(&format[0], sortColumn);
PhInitFormatC(&format[1], L',');
PhInitFormatU(&format[2], sortOrder);
string = PhFormat(format, RTL_NUMBER_OF(format), 0);
}
else
{
string = PhCreateString(L"0,0");
}
PhSetStringSetting2(Name, &string->sr);
PhDereferenceObject(string);
}
VOID PhLoadListViewGroupStatesFromSetting(
_In_ PWSTR Name,
_In_ HWND ListViewHandle
)
{
ULONG64 countInteger;
PPH_STRING settingsString;
PH_STRINGREF remaining;
PH_STRINGREF part;
settingsString = PhaGetStringSetting(Name);
remaining = settingsString->sr;
if (remaining.Length == 0)
return;
if (!PhSplitStringRefAtChar(&remaining, L'|', &part, &remaining))
return;
if (!PhStringToInteger64(&part, 10, &countInteger))
return;
for (INT index = 0; index < (INT)countInteger; index++)
{
ULONG64 groupId;
ULONG64 stateMask;
PH_STRINGREF groupIdPart;
PH_STRINGREF stateMaskPart;
if (remaining.Length == 0)
break;
PhSplitStringRefAtChar(&remaining, L'|', &groupIdPart, &remaining);
if (groupIdPart.Length == 0)
break;
PhSplitStringRefAtChar(&remaining, L'|', &stateMaskPart, &remaining);
if (stateMaskPart.Length == 0)
break;
if (!PhStringToInteger64(&groupIdPart, 10, &groupId))
break;
if (!PhStringToInteger64(&stateMaskPart, 10, &stateMask))
break;
ListView_SetGroupState(
ListViewHandle,
(INT)groupId,
LVGS_NORMAL | LVGS_COLLAPSED,
(UINT)stateMask
);
}
}
VOID PhSaveListViewGroupStatesToSetting(
_In_ PWSTR Name,
_In_ HWND ListViewHandle
)
{
INT index;
INT count;
PPH_STRING settingsString;
PH_STRING_BUILDER stringBuilder;
PhInitializeStringBuilder(&stringBuilder, 100);
count = (INT)ListView_GetGroupCount(ListViewHandle);
PhAppendFormatStringBuilder(
&stringBuilder,
L"%d|",
count
);
for (index = 0; index < count; index++)
{
LVGROUP group;
memset(&group, 0, sizeof(LVGROUP));
group.cbSize = sizeof(LVGROUP);
group.mask = LVGF_GROUPID | LVGF_STATE;
group.stateMask = LVGS_NORMAL | LVGS_COLLAPSED;
if (ListView_GetGroupInfoByIndex(ListViewHandle, index, &group) == -1)
continue;
PhAppendFormatStringBuilder(
&stringBuilder,
L"%d|%u|",
group.iGroupId,
group.state
);
}
if (stringBuilder.String->Length != 0)
PhRemoveEndStringBuilder(&stringBuilder, 1);
settingsString = PH_AUTO(PhFinalStringBuilderString(&stringBuilder));
PhSetStringSetting2(Name, &settingsString->sr);
}
VOID PhLoadCustomColorList(
_In_ PWSTR Name,
_In_ PULONG CustomColorList,
_In_ ULONG CustomColorCount
)
{
PPH_STRING settingsString;
PH_STRINGREF remaining;
PH_STRINGREF part;
if (CustomColorCount != 16)
return;
settingsString = PhGetStringSetting(Name);
if (PhIsNullOrEmptyString(settingsString))
goto CleanupExit;
remaining = PhGetStringRef(settingsString);
for (ULONG i = 0; i < CustomColorCount; i++)
{
ULONG64 integer = 0;
if (remaining.Length == 0)
break;
PhSplitStringRefAtChar(&remaining, L',', &part, &remaining);
if (PhStringToInteger64(&part, 10, &integer))
{
CustomColorList[i] = (COLORREF)integer;
}
}
CleanupExit:
PhClearReference(&settingsString);
}
VOID PhSaveCustomColorList(
_In_ PWSTR Name,
_In_ PULONG CustomColorList,
_In_ ULONG CustomColorCount
)
{
PH_STRING_BUILDER stringBuilder;
if (CustomColorCount != 16)
return;
PhInitializeStringBuilder(&stringBuilder, 100);
for (ULONG i = 0; i < CustomColorCount; i++)
{
PH_FORMAT format[2];
SIZE_T returnLength;
WCHAR formatBuffer[0x100];
PhInitFormatU(&format[0], CustomColorList[i]);
PhInitFormatC(&format[1], L',');
if (PhFormatToBuffer(
format,
RTL_NUMBER_OF(format),
formatBuffer,
sizeof(formatBuffer),
&returnLength
))
{
PhAppendStringBuilderEx(&stringBuilder, formatBuffer, returnLength - sizeof(UNICODE_NULL));
}
else
{
PhAppendFormatStringBuilder(&stringBuilder, L"%lu,", CustomColorList[i]);
}
}
if (stringBuilder.String->Length != 0)
PhRemoveEndStringBuilder(&stringBuilder, 1);
PhSetStringSetting2(Name, &stringBuilder.String->sr);
PhDeleteStringBuilder(&stringBuilder);
}
```
|
The human palatine tonsils (PT) are covered by stratified squamous epithelium that extends into deep and partly branched tonsillar crypts, of which there are about 10 to 30. The crypts greatly increase the contact surface between environmental influences and lymphoid tissue. In an average adult palatine tonsil the estimated epithelial surface area of the crypts is 295 cm2, in addition to the 45 cm2 of epithelium covering the oropharyngeal surface.
The crypts extend through the full thickness of the tonsil reaching almost to its hemicapsule. In healthy tonsils the openings of the crypts are fissure-like, and the walls of the lumina are in apposition. A computerized three-dimensional reconstruction of the palatine tonsil crypt system showed that in the centre of the palatine tonsil are tightly packed ramified crypts that join with each other, while on the periphery there is a rather simple and sparse arrangement.
The crypt system is not merely a group of invaginations of the tonsillar epithelium but a highly complicated network of canals with special types of epithelium and with various structures surrounding the canals, such as blood and lymphatic vessels and germinal centers.
Macrophages and other white blood cells concentrate by the tonsillar crypts as well, in response to the microorganisms attracted to the crypts. Accordingly, the tonsillar crypts serve a forward sentry role for the immune system, by providing early exposure of immune system cells to infectious organisms which may be introduced into the body via food or other ingested matter.
However, the tonsillar crypts often provide such an inviting environment to bacteria that bacterial colonies may form solidified "plugs" or "stones" within the crypts. In particular, sufferers of chronic sinusitis or post-nasal drip frequently suffer from these overgrowths of bacteria in the tonsillar crypts. These small whitish plugs, termed "tonsilloliths" and sometimes known as "tonsil stones," have a foul smell and can contribute to bad breath; furthermore, they can obstruct the normal flow of pus from the crypts, and may irritate the throat (people with tonsil stones may complain of the feeling that something is stuck in their throat).
Lingual tonsils in humans also have long crypts but, unlike the crypts in the palatine tonsils, they're unbranched.
The small folds in adenoids are sometimes described as crypts.
References
Lymphatics of the head and neck
Tonsil
|
Antipodia dactyliota is a species of butterfly of the family Hesperiidae. It is found in Western Australia.
The wingspan is about 30 mm.
The larvae feed on Gahnia lanigera.
Subspecies
Antipodia dactyliota anaces
Antipodia dactyliota anapus
Antipodia dactyliota nila
External links
Australian Caterpillars
Trapezitinae
Butterflies described in 1888
Butterflies of Australia
Taxa named by Edward Meyrick
|
```c++
// (See accompanying file LICENSE_1_0.txt or copy at
// path_to_url
#ifndef CATCH_SESSION_HPP_INCLUDED
#define CATCH_SESSION_HPP_INCLUDED
#include <catch2/internal/catch_commandline.hpp>
#include <catch2/internal/catch_noncopyable.hpp>
#include <catch2/catch_config.hpp>
#include <catch2/internal/catch_unique_ptr.hpp>
#include <catch2/internal/catch_config_wchar.hpp>
namespace Catch {
class Session : Detail::NonCopyable {
public:
Session();
~Session();
void showHelp() const;
void libIdentify();
int applyCommandLine( int argc, char const * const * argv );
#if defined(CATCH_CONFIG_WCHAR) && defined(_WIN32) && defined(UNICODE)
int applyCommandLine( int argc, wchar_t const * const * argv );
#endif
void useConfigData( ConfigData const& configData );
template<typename CharT>
int run(int argc, CharT const * const argv[]) {
if (m_startupExceptions)
return 1;
int returnCode = applyCommandLine(argc, argv);
if (returnCode == 0)
returnCode = run();
return returnCode;
}
int run();
Clara::Parser const& cli() const;
void cli( Clara::Parser const& newParser );
ConfigData& configData();
Config& config();
private:
int runInternal();
Clara::Parser m_cli;
ConfigData m_configData;
Detail::unique_ptr<Config> m_config;
bool m_startupExceptions = false;
};
} // end namespace Catch
#endif // CATCH_SESSION_HPP_INCLUDED
```
|
```html
<!DOCTYPE html>
<html lang="en">
<head>
<title>SpringAnimation Struct Reference</title>
<link rel="stylesheet" type="text/css" href="../css/jazzy.css" />
<link rel="stylesheet" type="text/css" href="../css/highlight.css" />
<meta charset='utf-8'>
<script src="../js/jquery.min.js" defer></script>
<script src="../js/jazzy.js" defer></script>
</head>
<body>
<a name="//apple_ref/swift/Struct/SpringAnimation" class="dashAnchor"></a>
<a title="SpringAnimation Struct Reference"></a>
<header>
<div class="content-wrapper">
<p><a href="../index.html">Spruce Docs</a> (100% documented)</p>
<p class="header-right"><a href="path_to_url"><img src="../img/gh.png"/>View on GitHub</a></p>
</div>
</header>
<div class="content-wrapper">
<p id="breadcrumbs">
<a href="../index.html">Spruce Reference</a>
<img id="carat" src="../img/carat.png" />
SpringAnimation Struct Reference
</p>
</div>
<div class="content-wrapper">
<nav class="sidebar">
<ul class="nav-groups">
<li class="nav-group-name">
<a href="../Classes.html">Classes</a>
<ul class="nav-group-tasks">
<li class="nav-group-task">
<a href="../Classes/Button.html">Button</a>
</li>
<li class="nav-group-task">
<a href="../Classes/ViewController.html">ViewController</a>
</li>
</ul>
</li>
<li class="nav-group-name">
<a href="../Enums.html">Enums</a>
<ul class="nav-group-tasks">
<li class="nav-group-task">
<a href="../Enums/Angle.html">Angle</a>
</li>
<li class="nav-group-task">
<a href="../Enums/Corner.html">Corner</a>
</li>
<li class="nav-group-task">
<a href="../Enums/Direction.html">Direction</a>
</li>
<li class="nav-group-task">
<a href="../Enums/Distance.html">Distance</a>
</li>
<li class="nav-group-task">
<a href="../Enums/Position.html">Position</a>
</li>
<li class="nav-group-task">
<a href="../Enums/Scale.html">Scale</a>
</li>
<li class="nav-group-task">
<a href="../Enums/SlideDirection.html">SlideDirection</a>
</li>
<li class="nav-group-task">
<a href="../Enums/StockAnimation.html">StockAnimation</a>
</li>
<li class="nav-group-task">
<a href="../Enums/Weight.html">Weight</a>
</li>
</ul>
</li>
<li class="nav-group-name">
<a href="../Extensions.html">Extensions</a>
<ul class="nav-group-tasks">
<li class="nav-group-task">
<a href="../Extensions/CGPoint.html">CGPoint</a>
</li>
<li class="nav-group-task">
<a href="../Extensions/UIView.html">UIView</a>
</li>
</ul>
</li>
<li class="nav-group-name">
<a href="../Protocols.html">Protocols</a>
<ul class="nav-group-tasks">
<li class="nav-group-task">
<a href="../Protocols/Animation.html">Animation</a>
</li>
<li class="nav-group-task">
<a href="../Protocols/CornerSortFunction.html">CornerSortFunction</a>
</li>
<li class="nav-group-task">
<a href="../Protocols/DirectionSortFunction.html">DirectionSortFunction</a>
</li>
<li class="nav-group-task">
<a href="../Protocols/DistanceSortFunction.html">DistanceSortFunction</a>
</li>
<li class="nav-group-task">
<a href="../Protocols/PositionSortFunction.html">PositionSortFunction</a>
</li>
<li class="nav-group-task">
<a href="../Protocols/SortFunction.html">SortFunction</a>
</li>
<li class="nav-group-task">
<a href="../Protocols/View.html">View</a>
</li>
<li class="nav-group-task">
<a href="../Protocols/WeightSortFunction.html">WeightSortFunction</a>
</li>
</ul>
</li>
<li class="nav-group-name">
<a href="../Structs.html">Structs</a>
<ul class="nav-group-tasks">
<li class="nav-group-task">
<a href="../Structs/ContinuousSortFunction.html">ContinuousSortFunction</a>
</li>
<li class="nav-group-task">
<a href="../Structs/ContinuousWeightedSortFunction.html">ContinuousWeightedSortFunction</a>
</li>
<li class="nav-group-task">
<a href="../Structs/CorneredSortFunction.html">CorneredSortFunction</a>
</li>
<li class="nav-group-task">
<a href="../Structs/DefaultSortFunction.html">DefaultSortFunction</a>
</li>
<li class="nav-group-task">
<a href="../Structs/InlineSortFunction.html">InlineSortFunction</a>
</li>
<li class="nav-group-task">
<a href="../Structs/LinearSortFunction.html">LinearSortFunction</a>
</li>
<li class="nav-group-task">
<a href="../Structs/RadialSortFunction.html">RadialSortFunction</a>
</li>
<li class="nav-group-task">
<a href="../Structs/RandomSortFunction.html">RandomSortFunction</a>
</li>
<li class="nav-group-task">
<a href="../Structs/SpringAnimation.html">SpringAnimation</a>
</li>
<li class="nav-group-task">
<a href="../Structs/Spruce.html">Spruce</a>
</li>
<li class="nav-group-task">
<a href="../Structs/SprucePoint.html">SprucePoint</a>
</li>
<li class="nav-group-task">
<a href="../Structs/SpruceUIView.html">SpruceUIView</a>
</li>
<li class="nav-group-task">
<a href="../Structs/StandardAnimation.html">StandardAnimation</a>
</li>
<li class="nav-group-task">
<a href="../Structs.html#/s:V6Spruce9TimedView">TimedView</a>
</li>
</ul>
</li>
</ul>
</nav>
<article class="main-content">
<section>
<section class="section">
<h1>SpringAnimation</h1>
<div class="declaration">
<div class="language">
<pre class="highlight"><code><span class="kd">public</span> <span class="kd">struct</span> <span class="kt">SpringAnimation</span><span class="p">:</span> <span class="kt"><a href="../Protocols/Animation.html">Animation</a></span></code></pre>
</div>
</div>
<p>A wrapper around the spring <code>UIViewAnimation</code> block with options publicly accessible. See, <a href="apple-reference-documentation://hsEaMPVO1d">UIViewAnimation</a> for more
- Note: <code>animationOptions</code> defaults to <code>[]</code>. If you do not update this value before calling the animate method than the changes will not be reflected.
- Note: <code>damping</code> defaults to 0.5 and <code>initialVelocity</code> defaults to 0.7</p>
</section>
<section class="section task-group-section">
<div class="task-group">
<ul>
<li class="item">
<div>
<code>
<a name="/s:vP6Spruce9Animation14changeFunctionGSqFCSo6UIViewT__"></a>
<a name="//apple_ref/swift/Property/changeFunction" class="dashAnchor"></a>
<a class="token" href="#/s:vP6Spruce9Animation14changeFunctionGSqFCSo6UIViewT__">changeFunction</a>
</code>
</div>
<div class="height-container">
<div class="pointer-container"></div>
<section class="section">
<div class="pointer"></div>
<div class="abstract">
<p>A wrapper around the spring <code>UIViewAnimation</code> block with options publicly accessible. See, <a href="apple-reference-documentation://hsEaMPVO1d">UIViewAnimation</a> for more
- Note: <code><a href="../Structs/SpringAnimation.html#/s:your_sha256_hashOptions">animationOptions</a></code> defaults to <code>[]</code>. If you do not update this value before calling the animate method than the changes will not be reflected.
- Note: <code><a href="../Structs/SpringAnimation.html#/s:vV6Spruce15SpringAnimation7dampingV12CoreGraphics7CGFloat">damping</a></code> defaults to 0.5 and <code><a href="../Structs/SpringAnimation.html#/s:your_sha256_hashat">initialVelocity</a></code> defaults to 0.7</p>
</div>
<div class="declaration">
<h4>Declaration</h4>
<div class="language">
<p class="aside-title">Swift</p>
<pre class="highlight"><code><span class="kd">public</span> <span class="k">var</span> <span class="nv">changeFunction</span><span class="p">:</span> <span class="kt">ChangeFunction</span><span class="p">?</span></code></pre>
</div>
</div>
</section>
</div>
</li>
<li class="item">
<div>
<code>
<a name="/s:vV6Spruce15SpringAnimation8durationSd"></a>
<a name="//apple_ref/swift/Property/duration" class="dashAnchor"></a>
<a class="token" href="#/s:vV6Spruce15SpringAnimation8durationSd">duration</a>
</code>
</div>
<div class="height-container">
<div class="pointer-container"></div>
<section class="section">
<div class="pointer"></div>
<div class="abstract">
<p>Undocumented</p>
</div>
<div class="declaration">
<h4>Declaration</h4>
<div class="language">
<p class="aside-title">Swift</p>
<pre class="highlight"><code><span class="kd">public</span> <span class="kd">struct</span> <span class="kt">SpringAnimation</span><span class="p">:</span> <span class="kt"><a href="../Protocols/Animation.html">Animation</a></span></code></pre>
</div>
</div>
</section>
</div>
</li>
<li class="item">
<div>
<code>
<a name="/s:your_sha256_hashOptions"></a>
<a name="//apple_ref/swift/Property/animationOptions" class="dashAnchor"></a>
<a class="token" href="#/s:your_sha256_hashOptions">animationOptions</a>
</code>
</div>
<div class="height-container">
<div class="pointer-container"></div>
<section class="section">
<div class="pointer"></div>
<div class="abstract">
<p>A mask of options indicating how you want to perform the animations</p>
</div>
<div class="declaration">
<h4>Declaration</h4>
<div class="language">
<p class="aside-title">Swift</p>
<pre class="highlight"><code><span class="kd">public</span> <span class="k">var</span> <span class="nv">animationOptions</span><span class="p">:</span> <span class="kt">UIViewAnimationOptions</span> <span class="o">=</span> <span class="p">[]</span></code></pre>
</div>
</div>
</section>
</div>
</li>
<li class="item">
<div>
<code>
<a name="/s:vV6Spruce15SpringAnimation7dampingV12CoreGraphics7CGFloat"></a>
<a name="//apple_ref/swift/Property/damping" class="dashAnchor"></a>
<a class="token" href="#/s:vV6Spruce15SpringAnimation7dampingV12CoreGraphics7CGFloat">damping</a>
</code>
</div>
<div class="height-container">
<div class="pointer-container"></div>
<section class="section">
<div class="pointer"></div>
<div class="abstract">
<p>Undocumented</p>
</div>
<div class="declaration">
<h4>Declaration</h4>
<div class="language">
<p class="aside-title">Swift</p>
<pre class="highlight"><code><span class="kd">public</span> <span class="kd">struct</span> <span class="kt">SpringAnimation</span><span class="p">:</span> <span class="kt"><a href="../Protocols/Animation.html">Animation</a></span></code></pre>
</div>
</div>
</section>
</div>
</li>
<li class="item">
<div>
<code>
<a name="/s:your_sha256_hashat"></a>
<a name="//apple_ref/swift/Property/initialVelocity" class="dashAnchor"></a>
<a class="token" href="#/s:your_sha256_hashat">initialVelocity</a>
</code>
</div>
<div class="height-container">
<div class="pointer-container"></div>
<section class="section">
<div class="pointer"></div>
<div class="abstract">
<p>Undocumented</p>
</div>
<div class="declaration">
<h4>Declaration</h4>
<div class="language">
<p class="aside-title">Swift</p>
<pre class="highlight"><code><span class="kd">public</span> <span class="kd">struct</span> <span class="kt">SpringAnimation</span><span class="p">:</span> <span class="kt"><a href="../Protocols/Animation.html">Animation</a></span></code></pre>
</div>
</div>
</section>
</div>
</li>
<li class="item">
<div>
<code>
<a name="/s:FV6Spruce15SpringAnimationcFT8durationSd_S0_"></a>
<a name="//apple_ref/swift/Method/init(duration:)" class="dashAnchor"></a>
<a class="token" href="#/s:FV6Spruce15SpringAnimationcFT8durationSd_S0_">init(duration:)</a>
</code>
</div>
<div class="height-container">
<div class="pointer-container"></div>
<section class="section">
<div class="pointer"></div>
<div class="abstract">
<p>Undocumented</p>
</div>
<div class="declaration">
<h4>Declaration</h4>
<div class="language">
<p class="aside-title">Swift</p>
<pre class="highlight"><code><span class="kd">public</span> <span class="kd">struct</span> <span class="kt">SpringAnimation</span><span class="p">:</span> <span class="kt"><a href="../Protocols/Animation.html">Animation</a></span></code></pre>
</div>
</div>
</section>
</div>
</li>
<li class="item">
<div>
<code>
<a name="/s:your_sha256_hash_"></a>
<a name="//apple_ref/swift/Method/init(duration:changes:)" class="dashAnchor"></a>
<a class="token" href="#/s:your_sha256_hash_">init(duration:changes:)</a>
</code>
</div>
<div class="height-container">
<div class="pointer-container"></div>
<section class="section">
<div class="pointer"></div>
<div class="abstract">
<p>Undocumented</p>
</div>
<div class="declaration">
<h4>Declaration</h4>
<div class="language">
<p class="aside-title">Swift</p>
<pre class="highlight"><code><span class="kd">public</span> <span class="kd">struct</span> <span class="kt">SpringAnimation</span><span class="p">:</span> <span class="kt"><a href="../Protocols/Animation.html">Animation</a></span></code></pre>
</div>
</div>
</section>
</div>
</li>
<li class="item">
<div>
<code>
<a name="/s:your_sha256_hashGSqFSbT___T_"></a>
<a name="//apple_ref/swift/Method/animate(delay:view:completion:)" class="dashAnchor"></a>
<a class="token" href="#/s:your_sha256_hashGSqFSbT___T_">animate(delay:view:completion:)</a>
</code>
</div>
<div class="height-container">
<div class="pointer-container"></div>
<section class="section">
<div class="pointer"></div>
<div class="abstract">
<p>A mask of options indicating how you want to perform the animations</p>
</div>
<div class="declaration">
<h4>Declaration</h4>
<div class="language">
<p class="aside-title">Swift</p>
<pre class="highlight"><code><span class="kd">public</span> <span class="kd">func</span> <span class="nf">animate</span><span class="p">(</span><span class="nv">delay</span><span class="p">:</span> <span class="kt">TimeInterval</span><span class="p">,</span> <span class="nv">view</span><span class="p">:</span> <span class="kt">UIView</span><span class="p">,</span> <span class="nv">completion</span><span class="p">:</span> <span class="kt">CompletionHandler</span><span class="p">?)</span></code></pre>
</div>
</div>
<div>
<h4>Parameters</h4>
<table class="graybox">
<tbody>
<tr>
<td>
<code>
<em>delay</em>
</code>
</td>
<td>
<div>
<p>the time interval that this animation should wait to start from the moment this method is called</p>
</div>
</td>
</tr>
<tr>
<td>
<code>
<em>view</em>
</code>
</td>
<td>
<div>
<p>the view to animate</p>
</div>
</td>
</tr>
<tr>
<td>
<code>
<em>completion</em>
</code>
</td>
<td>
<div>
<p>a closure that is called upon the animation completing. A <code>Bool</code> is passed into the closure letting you know if the animation has completed.</p>
</div>
</td>
</tr>
</tbody>
</table>
</div>
</section>
</div>
</li>
</ul>
</div>
</section>
</section>
<section id="footer">
<p>© 2017 <a class="link" href="path_to_url" target="_blank" rel="external">WillowTree</a>. All rights reserved. (Last updated: 2017-03-10)</p>
<p>Generated by <a class="link" href="path_to_url" target="_blank" rel="external">jazzy v0.7.4</a>, a <a class="link" href="path_to_url" target="_blank" rel="external">Realm</a> project.</p>
</section>
</article>
</div>
</body>
</div>
</html>
```
|
Doo-wop (also spelled doowop and doo wop) is a genre of rhythm and blues music that originated in African-American communities during the 1940s, mainly in the large cities of the United States, including New York, Philadelphia, Pittsburgh, Chicago, Baltimore, Newark, Detroit, Washington, D.C., and Los Angeles. It features vocal group harmony that carries an engaging melodic line to a simple beat with little or no instrumentation. Lyrics are simple, usually about love, sung by a lead vocal over background vocals, and often featuring, in the bridge, a melodramatically heartfelt recitative addressed to the beloved. Harmonic singing of nonsense syllables (such as "doo-wop") is a common characteristic of these songs. Gaining popularity in the 1950s, doo-wop was "artistically and commercially viable" until the early 1960s, but continued to influence performers in other genres.
Origins
Doo-wop has complex musical, social, and commercial origins.
Musical precedents
Doo-wop's style is a mixture of precedents in composition, orchestration, and vocals that figured in American popular music created by songwriters and vocal groups, both black and white, from the 1930s to the 1940s.
Such composers as Rodgers and Hart (in their 1934 song "Blue Moon"), and Hoagy Carmichael and Frank Loesser (in their 1938 "Heart and Soul") used a I–vi–ii–V-loop chord progression in those hit songs; composers of doo-wop songs varied this slightly but significantly to the chord progression I–vi–IV–V, so influential that it is sometimes referred to as the '50s progression. This characteristic harmonic layout was combined with the AABA chorus form typical for Tin Pan Alley songs.
Hit songs by black groups such as The Ink Spots ("If I Didn't Care", one of the best selling singles worldwide of all time, and "Address Unknown") and The Mills Brothers ("Paper Doll", "You Always Hurt the One You Love" and "Glow Worm") were generally slow songs in swing time with simple instrumentation. Doo-wop street singers generally performed without instrumentation, but made their musical style distinctive, whether using fast or slow tempos, by keeping time with a swing-like off-beat, while using the "doo-wop" syllables as a substitute for drums and a bass vocalist as a substitute for a bass instrument.
Doo-wop's characteristic vocal style was influenced by groups such as the Mills Brothers, whose close four-part harmony derived from the vocal harmonies of the earlier barbershop quartet.
The Four Knights' "Take Me Right Back to the Track" (1945), the Cats and the Fiddle's song "I Miss You So" (1939), and the Triangle Quartette's even earlier record "Doodlin' Back" (1929) prefigured doo-wop's rhythm and blues sound long before doo-wop became popular.
Elements of doo-wop vocal style
In their book entitled "The Complete Book of Doo-Wop", co-authors Gribin and Schiff (who also wrote “Doo-Wop, the Forgotten Third of Rock 'n' Roll“), identify 5 features of doo-wop music: 1) it is vocal music made by groups; 2) it features a wide range of vocal parts, "usually from bass to falsetto"; 3) it includes nonsense syllables; 4) there is a simple beat and low key instrumentals; and 5) it has simple words and music. While these features provide a helpful guide, they need not all be present in a given song for aficionados to consider it doo-wop, and the list does not include the aforementioned typical doo-wop chord progressions. Bill Kenny, lead singer of the Ink Spots, is often credited with introducing the "top and bottom" vocal arrangement featuring a high tenor singing the intro and a bass spoken chorus. The Mills Brothers, who were famous in part because in their vocals they sometimes mimicked instruments, were an additional influence on street vocal harmony groups, who, singing a cappella arrangements, used wordless onomatopoeia to mimic musical instruments. For instance, "Count Every Star" by the Ravens (1950) includes vocalizations imitating the "doomph, doomph" plucking of a double bass. The Orioles helped develop the doo-wop sound with their hits "It's Too Soon to Know" (1948) and "Crying in the Chapel" (1953).
Origin of the name
Although the musical style originated in the late 1940s and was very popular in the 1950s, the term "doo-wop" itself did not appear in print until 1961, when it was used in reference to the Marcels' song, "Blue Moon", in The Chicago Defender, just as the style's vogue was nearing its end. Though the name was attributed to radio disc jockey Gus Gossert, he did not accept credit, stating that "doo-wop" was already in use in California to categorize the music.
"Doo-wop" is itself a nonsense expression. In the Delta Rhythm Boys' 1945 recording, "Just A-Sittin' And A-Rockin", it is heard in the backing vocal. It is heard later in the Clovers' 1953 release "Good Lovin'" (Atlantic Records 1000), and in the chorus of Carlyle Dundee & the Dundees' 1954 song "Never" (Space Records 201). The first hit record with "doo-wop" being harmonized in the refrain was the Turbans' 1955 hit, "When You Dance" (Herald Records H-458). The Rainbows embellished the phrase as "do wop de wadda" in their 1955 "Mary Lee" (on Red Robin Records; also a Washington, D.C. regional hit on Pilgrim 703); and in their 1956 national hit, "In the Still of the Night", the Five Satins sang across the bridge with a plaintive "doo-wop, doo-wah".
Development
The vocal harmony group tradition that developed in the United States post-World War II was the most popular form of rhythm and blues music among black teenagers, especially those living in the large urban centers of the eastern coast, in Chicago, and in Detroit. Among the first groups to perform songs in the vocal harmony group tradition were the Orioles, the Five Keys, and the Spaniels; they specialized in romantic ballads that appealed to the sexual fantasies of teenagers in the late 1940s and early 1950s. The nonsense string of syllables, "doo doo doo doo-wop", from which the name of the genre was later derived, is used repeatedly in the song "Just A Sittin' And A Rockin", recorded by the Delta Rhythm Boys in December 1945. By the mid-1950s, vocal harmony groups had transformed the smooth delivery of ballads into a performance style incorporating the nonsense phrase as vocalized by the bass singers, who provided rhythmic movement for a cappella songs. Soon, other doo-wop groups entered the pop charts, particularly in 1955, which saw such cross-over doo-wop hits as "Sincerely" by the Moonglows, "Earth Angel" by the Penguins, the Cadillacs' "Gloria", the Heartbeats' "A Thousand Miles Away", Shep & the Limelites' "Daddy's Home", the Flamingos' "I Only Have Eyes for You", and the Jive Five's "My True Story".
Teenagers who could not afford musical instruments formed groups that sang songs a cappella, performing at high school dances and other social occasions. They rehearsed on street corners and apartment stoops, as well as under bridges, in high school washrooms, and in hallways and other places with echoes: these were the only spaces with suitable acoustics available to them. Thus they developed a form of group harmony based in the harmonies and emotive phrasing of black spirituals and gospel music. Doo-wop music allowed these youths not only a means of entertaining themselves and others, but also a way of expressing their values and worldviews in a repressive white-dominated society, often through the use of innuendo and hidden messages in the lyrics.
Particularly productive doo-wop groups were formed by young Italian-American men who, like their black counterparts, lived in rough neighborhoods (e.g., the Bronx and Brooklyn), learned their basic musical craft singing in church, and would gain experience in the new style by singing on street corners. New York was the capital of Italian doo-wop, and all its boroughs were home to groups that made successful records.
By the late 1950s and early 1960s, many Italian-American groups had national hits: Dion and the Belmonts scored with "I Wonder Why", "Teenager in Love", and "Where or When"; the Capris made their name in 1960 with "There's a Moon Out Tonight"; Randy & the Rainbows, who charted with their Top #10 1963 single "Denise". Other Italian-American doo-wop groups were the Earls, the Chimes, the Elegants, the Mystics, the Duprees, Johnny Maestro & the Crests, and the Regents.
Some doo-wop groups were racially mixed. Puerto Rican Herman Santiago, originally slated to be the lead singer of the Teenagers, wrote the lyrics and the music for a song to be called "Why Do Birds Sing So Gay?", but whether because he was ill or because producer George Goldner thought that newcomer Frankie Lymon's voice would be better in the lead, Santiago's original version was not recorded. To suit his tenor voice Lymon made a few alterations to the melody, and consequently the Teenagers recorded the song known as "Why Do Fools Fall in Love?". Racially integrated groups with both black and white performers included the Del-Vikings, who had major hits in 1957 with "Come Go With Me" and "Whispering Bells", the Crests, whose "16 Candles" appeared in 1958, and the Impalas, whose "Sorry (I Ran All the Way Home)" was a hit in 1959. Chico Torres was a member of the Crests, whose lead singer, Johhny Mastrangelo, would later gain fame under the name Johnny Maestro.
Female doo-wop singers were much less common than males in the early days of doo-wop. Lillian Leach, lead singer of the Mellows from 1953 to 1958, helped pave the way for other women in doo-wop, soul and R&B. Margo Sylvia was the lead singer for the Tune Weavers.
Baltimore
Like other urban centers in the US during the late 1940s and early 1950s, Baltimore developed its own vocal group tradition. The city produced rhythm and blues innovators such as the Cardinals, the Orioles, and the Swallows. The Royal Theatre in Baltimore and the Howard in Washington, D.C. were among the most prestigious venues for black performers on the so-called "Chitlin Circuit", which served as a school of the performing arts for blacks who had migrated from the deep South, and even more so for their offspring. In the late 1940s, the Orioles rose from the streets and made a profound impression on young chitlin' circuit audiences in Baltimore. The group, formed in 1947, sang simple ballads in rhythm and blues harmony, with the standard arrangement of a high tenor singing over the chords of the blended mid-range voices and a strong bass voice. Their lead singer, Sonny Til, had a soft, high-pitched tenor, and like the rest of the group, was still a teenager at the time. His style reflected the optimism of young black Americans in the postmigration era. The sound they helped develop, later called '"doo-wop", eventually became a "sonic bridge" to reach a white teen audience.
In 1948, Jubilee Records signed the Orioles to a contract, following which they appeared on Arthur Godfrey's Talent Scout radio show. The song they performed, "It's Too Soon to Know", often cited as the first doo-wop song, went to number 1 on Billboards "Race Records" chart, and number 13 on the pop charts, a crossover first for a black group. This was followed in 1953 by "Crying in the Chapel", their biggest hit, which went to number 1 on the R&B chart and number 11 on the pop chart. The Orioles were perhaps the first of the many doo-wop groups who named themselves after birds.
The sexual innuendo in the Orioles' songs was less disguised than in the vocal group music of the swing era. Their stage choreography was also more sexually explicit, and their songs were simpler and more emotionally direct. This new approach to sex in their performances did not target the white teen audience at first—when the Orioles took the stage, they were appealing directly to a young black audience, with Sonny Til using his entire body to convey the emotion in the lyrics of their songs. He became a teen sex symbol for black girls, who reacted by screaming and throwing pieces of clothing onto the stage when he sang. Other young male vocalists of the era took note and adjusted their own acts accordingly. The Orioles were soon displaced by newer groups who imitated these pioneers as a model for success.
The Swallows began in the late 1940s as a group of Baltimore teenagers calling themselves the Oakaleers. One of the members lived across the street from Sonny Til, who went on to lead the Orioles, and their success inspired the Oakaleers to rename themselves the Swallows. Their song "Will You Be Mine", released in 1951, reached number 9 on the US Billboard R&B chart. In 1952, the Swallows released "Beside You", their second national hit, which peaked at number 10 on the R&B chart.
Some Baltimore doo-wop groups were connected with street gangs, and a few members were active in both scenes, such as Johnny Page of the Marylanders. As in all the major urban centers of the US, many of the teen gangs had their own street corner vocal groups in which they took great pride and which they supported fiercely. Competitive music and dance was a part of African American street culture, and with the success of some local groups, competition increased, leading to territorial rivalries among performers. Pennsylvania Avenue served as a boundary between East and West Baltimore, with the East producing the Swallows and the Cardinals and the Blentones, while the West was home to the Orioles and the Four Buddies.
Baltimore vocal groups gathered at neighborhood record stores, where they practiced the latest hits in hopes that the store owners' connections with record companies and distributors might land them an audition. A King Records talent scout discovered the Swallows as they were rehearsing in Goldstick's record store. Sam Azrael's Super Music Store and Shaw's shoeshine parlor were also favored hangouts for Baltimore vocal groups; Jerry Wexler and Ahmet Ertegun auditioned the Cardinals at Azrael's. Some groups cut demos at local studios and played them for recording producers, with the aim of getting signed to a record deal.
Chicago
The city of Chicago was outranked as a recording center in the United States only by New York City in the early years of the music recording industry. During the late 1940s and early 1950s, independent record labels gained control of the black record market from the major companies, and Chicago rose as one of the main centers for rhythm and blues music. This music was a vital source for the youth music called rock 'n' roll. In the mid-1950s, a number of rhythm and blues acts performing in the vocal ensemble style later known as doo-wop began to cross over from the R&B charts to mainstream rock 'n' roll. The Chicago record companies took note of this trend and scouted for vocal groups from the city that they could sign to their labels. The record labels, record distributors, and nightclub owners of Chicago all had a part in developing the vocal potential of the doo-wop groups, but Chicago doo-wop was "created and nourished" on the street corners of the city's lower-class neighborhoods.
The Chicago doo-wop groups, like those in New York, started singing on street corners and practiced their harmonies in tiled bathrooms, hallways, and subways, but because they came originally from the deep South, the home of gospel and blues music, their doo-wop sound was more influenced by gospel and blues.
Vee-Jay Records and Chess Records were the main labels recording doo-wop groups in Chicago. Vee-Jay signed the Dells, the El Dorados, the Magnificents, and the Spaniels, all of whom achieved national chart hits in the mid-1950s. Chess signed the Moonglows, who had the most commercial success (seven Top 40 R&B hits, six of those Top Ten) of the 1950s doo-wop groups, and the Flamingos, who had national hits as well.
Detroit
In 1945, Joe Von Battle opened Joe's Record Shop at 3530 Hastings Street in Detroit; the store had the largest selection of rhythm and blues records in the city, according to a 1954 Billboard business survey. Battle, a migrant from Macon, Georgia, established his shop as the first black-owned business in the area, which remained primarily Jewish up to the late 1940s. Young aspiring performers would gather there in hopes of being discovered by the leading independent record company owners who courted Battle to promote and sell records, as well as to find new talent at his shop and studio. Battle's record labels included JVB, Von, Battle, Gone, and Viceroy; he also had subsidiary arrangements with labels such as King and Deluxe. He supplied Syd Nathan with many blues and doo-wop masters recorded in his primitive back-of-the-store studio from 1948 to 1954. As the pivotal recording mogul in the Detroit area, Battle was an important player in the independent label network.
Jack and Devora Brown, a Jewish couple, founded Fortune Records in 1946 and recorded a variety of eccentric artists and sounds; in the mid-1950s they became champions of Detroit rhythm and blues, including the music of local doo-wop groups. Fortune's premier act was the Diablos, featuring the soaring tenor of lead vocalist Nolan Strong, a native of Alabama. The group's most notable hit was "The Wind". Strong, like other R&B and doo-wop tenors of the time, was profoundly influenced by Clyde McPhatter, lead singer of the Dominoes and later of the Drifters. Strong himself made a lasting impression on the young Smokey Robinson, who went out of his way to attend Diablo shows.
In late 1957, seventeen-year-old Robinson, fronting a Detroit vocal harmony group called the Matadors, met the producer Berry Gordy, who was beginning to take up new styles, including doo-wop. Gordy wanted to promote a black style of music that would appeal to both the black and white markets, performed by black musicians with roots in gospel, R&B, or doo-wop. He sought artists who understood that the music had to be updated to appeal to a broader audience and attain greater commercial success. Early recordings by Gordy's Tamla Records, founded several months before he established the Motown Record Corporation in January 1959, were of either blues or doo-wop performances.
"Bad Girl", a 1959 doo-wop single by Robinson's group, the Miracles, was the first single released (and the only one released by this group) on the Motown label—all previous singles from the company (and all those following from the group) were released on the Tamla label. Issued locally on the Motown Records label, it was licensed to and released nationally by Chess Records because the fledgling Motown Record Corporation did not, at that time, have national distribution. "Bad Girl" was the group's first national chart hit, reaching #93 on the Billboard Hot 100. Written by Miracles lead singer Smokey Robinson and Motown Records' president Berry Gordy, "Bad Girl" was the first of several of the Miracles' songs performed in the doo-wop style during the late 1950s.
Los Angeles
Doo-wop groups also formed on the west coast of the United States, especially in California, where the scene was centered in Los Angeles. Independent record labels owned by black entrepreneurs such as Dootsie Williams and John Dolphin recorded these groups, most of which had formed in high schools. One such group, the Penguins, included Cleveland "Cleve" Duncan and Dexter Tisby, former classmates at Fremont High School in the Watts neighborhood of Los Angeles. They, along with Bruce Tate and Curtis Williams, recorded the song "Earth Angel" (produced by Dootsie Williams), which rose to number one on the R&B charts in 1954.
Most of the Los Angeles doo-wop groups came out of the Fremont, Belmont, and Jefferson high schools. All of them were influenced by the Robins, a successful R&B group of the late 1940s and the 1950s who formed in San Francisco, or by other groups including the Flairs, the Flamingos (not the Chicago group) and the Hollywood Flames. Many other Los Angeles doo-wop groups of the time were recorded by Dootsie Williams' Dootone Records and by John Dolphin's Central Avenue record store, Dolphin's of Hollywood. These included the Calvanes, the Crescendos, the Cuff Linx, the Cubans, the Dootones, the Jaguars, the Jewels, the Meadowlarks, the Silks, the Squires, the Titans, and the Up-Fronts. A few groups, such as the Platters and Rex Middleton's Hi-Fis, had crossover success.
The Jaguars, from Fremont High School, was one of the first interracial vocal groups; it consisted of two African Americans, a Mexican American, and a Polish-Italian American. Doo-wop was popular with California Mexican Americans, who were attracted in the 1950s to its a capella vocals; the romantic style of the doo-wop groups appealed to them, as it was reminiscent of the traditional ballads and harmonies of Mexican folk music.
In 1960, Art Laboe released one of the first oldies compilations, Memories of El Monte, on his record label, Original Sound. The record was a collection of classic doo-wop songs by bands that used to play at the dances Laboe organized at Legion Stadium in El Monte, California, beginning in 1955. It included songs by local bands such as the Heartbeats and the Medallions. Laboe had become a celebrity in the Los Angeles area as a disc jockey for radio station KPOP, playing doo-wop and rhythm and blues broadcast from the parking lot of Scriverner's Drive-In on Sunset Boulevard.
In 1962, Frank Zappa, with his friend Ray Collins, wrote the doo-wop song "Memories of El Monte". This was one of the first songs written by Zappa, who had been listening to Laboe's compilation of doo-wop singles. Zappa took the song to Laboe, who recruited the lead vocalist of the Penguins, Cleve Duncan, for a new iteration of the group, recorded it, and released it as a single on his record label.
New York City
Early doo-wop music, dating from the late 1940s and early 1950s, was especially popular in the Northeast industrial corridor from New York to Philadelphia, and New York City was the world capital of doo-wop. There, African American groups such as the Ravens, the Drifters, the Dominoes, the Charts, and the so-called "bird groups", such as the Crows, the Sparrows, the Larks, and the Wrens, melded rhythm and blues with the gospel music they had grown up singing in church. Street singing was almost always a cappella; instrumental accompaniment was added when the songs were recorded. The large numbers of blacks who had migrated to New York City as part of the Great Migration came mostly from Georgia, Florida, and the Carolinas. In the 1940s black youths in the city began to sing the rhythm and blues styling that came to be known as doo-wop. Many of these groups were found in Harlem.
Blacks were forced by legal and social segregation, as well as by the constraints of the built environment, to live in certain parts of New York City of the early 1950s. They identified with their own wards, street blocks and streets. Being effectively locked out of mainstream white society increased their social cohesion and encouraged creativity within the context of African American culture. Young singers formed groups and rehearsed their songs in public spaces: on street corners, apartment stoops, and subway platforms, in bowling alleys, school bathrooms, and pool halls, as well as at playgrounds and under bridges.
Bobby Robinson, a native of South Carolina, was an independent record producer and songwriter in Harlem who helped popularize doo-wop music in the 1950s. He got into the music business in 1946 when he opened "Bobby's Record Shop" (later "Bobby's Happy House") on the corner of 125th Street and Eighth Avenue, near the Apollo Theater, a noted venue for African-American performers. The Apollo held talent contests in which audience members indicated their favorites with applause. These were a major outlet for doo-wop performers to be discovered by record company talent scouts. In 1951, Robinson started Robin Records, which later became Red Robin Records, and began recording doo-wop; he recorded the Ravens, the Mello-Moods, and many other doo-wop vocal groups. He used the tiny shop to launch a series of record labels which released many hits in the US. Robinson founded or co-founded Red Robin Records, Whirlin' Disc Records, Fury Records, Everlast Records, Fire Records and Enjoy Records.
Arthur Godfrey's long-running (1946–1958) morning radio show on CBS, Talent Scouts, was a New York venue from which some doo-wop groups gained national exposure. In 1948, the Orioles, then known as the Vibra-Nairs, went to the city with Deborah Chessler, their manager and main songwriter, and appeared on the show. They won only third place, but Godfrey invited them back twice. Chessler leveraged a few demo recordings the group had cut, along with the recent radio exposure, to interest a distributor in marketing the group on an independent label. They cut six sides, one of which was a doo-wop ballad written by Chessler called "It's Too Soon to Know". It reached no. 1 on Billboard's national Most-Played Juke Box Race Records chart, and, in a first for a doo-wop song, the record crossed over to the mainstream pop chart, where it reached no. 13.
The Du Droppers formed in Harlem in 1952. Members of the band were experienced gospel singers in ensembles dating to the 1940s, and were one of the oldest groups to record during the era. Among the Du Droppers' most enduring songs are "I Wanna Know" and "I Found Out (What You Do When You Go Round There)", which both reached number three on the Billboard R&B charts in 1953.
Frankie Lymon, lead vocalist of the Teenagers, was the first black teen idol who appealed to both black and white audiences. He was born in Harlem, where he began singing doo-wop songs with his friends on the streets. He joined a group, the Premiers, and helped members Herman Santiago and Jimmy Merchant rewrite a song they had composed to create "Why Do Fools Fall In Love", which won the group an audition with Gee Records. Santiago was too sick to sing lead on the day of the audition, consequently Lymon sang the lead on "Why Do Fools Fall in Love" instead, and the group was signed as the Teenagers with Lymon as lead singer. The song quickly charted as the number one R&B song in the United States and reached number six on the pop chart in 1956, becoming the number one pop hit in the United Kingdom as well.
The Willows, an influential street corner group from Harlem, were a model for many of the New York City doo-wop acts that rose after them. Their biggest hit was "Church Bells May Ring", featuring Neil Sedaka, then a member of the Linc-Tones, on chimes. It reached number 11 on the US R&B chart in 1956.
Although they never had a national chart hit, the Solitaires, best known for their 1957 hit single "Walking Along", were one of the most popular vocal groups in New York in the late 1950s.
The heyday of the girl group era began in 1957 with the success of two teen groups from the Bronx, the Chantels and the Bobbettes. The six girls in the Bobettes, aged eleven to fifteen, wrote and recorded "Mr. Lee", a novelty tune about a schoolteacher that was a national hit. The Chantels were the second African-American girl group to enjoy nationwide success in the US. The group was established in the early 1950s by five students, all of them born in the Bronx, who attended the Catholic St. Anthony of Padua School in the Bronx, where they were trained to sing Gregorian Chants. Their first recording was "He's Gone" (1958), which made them the first pop rock girl group to chart. Their second single, "Maybe" hit the charts, No. 15 on Billboards Hot 100.
In 1960, the Chiffons began as a trio of schoolmates at James Monroe High School in the Bronx. Judy Craig, fourteen years old, was the lead singer, singing with Patricia Bennett and Barbara Lee, both thirteen. In 1962, the girls met songwriter Ronnie Mack at the after-school center; Mack suggested they add Sylvia Peterson, who had sung with Little Jimmy & the Tops, to the group. The group was named the Chiffons when recording and releasing their first single, "He's So Fine". Written by Mack, it was released on the Laurie Records label in 1963. "He's So Fine" hit No. 1 in the US, selling over one million copies.
Public School 99, which sponsored evening talent shows, and Morris High School were centers of musical creativity in the Bronx during the doo-wop era. Arthur Crier, a leading figure in the doo-wop scene in the Morrissania neighborhood, was born in Harlem and raised in the Bronx; his mother was from North Carolina. Crier was a founding member of a doo-wop group called the Five Chimes, one of several different groups with that name, and sang bass with the Halos and the Mellows. Many years later he observed that there was a shift in the music sung on the streets from gospel to secular rhythm and blues between 1950 and 1952.
New York was also the capital of Italian doo-wop, and all its boroughs were home to groups that made successful records. The Crests were from the Lower East Side in Manhattan; Dion and the Belmonts, the Regents, and Nino and the Ebb Tides were from the Bronx; the Elegants from Staten Island; the Capris from Queens; the Mystics, the Neons, the Classics, and Vito & the Salutations from Brooklyn.
Although Italians were a much smaller proportion of the Bronx's population in the 1950s than Jews and the Irish, only they had significant influence as rock 'n' roll singers. Young people of other ethnicities were listening to rock 'n' roll, but it was Italian Americans who established themselves in performing and recording the music. While relationships between Italian Americans and African Americans in the Bronx were sometimes fraught, there were many instances of collaboration between them.
Italian Americans kept African Americans out of their neighborhoods with racial boundary policing and fought against them in turf wars and gang battles, yet they adopted the popular music of African Americans, treated it as their own, and were an appreciative audience for black doo-wop groups. Similarities in language idioms, masculine norms, and public comportment made it possible for African American and Italian American young men to mingle easily when societal expectations did not interfere. These cultural commonalities allowed Italian Americans to appreciate the singing of black doo-woppers in deterritorialized spaces, whether on the radio, on records, at live concerts, or in street performances. Dozens of neighborhood Italian groups formed, some of which recorded songs at Cousins Records, a record shop turned label, on Fordham Road. Italian American groups from the Bronx released a steady stream of doo-wop songs, including "Teenager In Love" and "I Wonder Why" by Dion and the Belmonts, and "Barbara Ann" by the Regents. Johnny Maestro, the Italian American lead singer of the interracial Bronx group the Crests, was the lead on the hit "Sixteen Candles". Maestro said that he became interested in R&B vocal group harmony listening to the Flamingos, the Harptones, and the Moonglows on Alan Freed's radio show on WINS in New York. Freed's various radio and stage shows had a crucial role in creating a market for Italian doo-wop.
Philadelphia
Young black singers in Philadelphia helped create the doo-wop vocal harmony style developing in the major cities of the US during the 1950s. Early doo-wop groups in the city included the Castelles, the Silhouettes, the Turbans, and Lee Andrews & the Hearts. They were recorded by small independent rhythm and blues record labels, and occasionally by more established labels in New York. Most of these groups had limited success, scoring only one or two hit songs on the R&B charts. They had frequent personnel changes and often moved from label to label hoping to achieve another hit.
The migration of blacks to Philadelphia from the southern states of the US, especially South Carolina and Virginia, had a profound effect not only on the city's demographics, but on its music and culture as well. During the Great Migration, the black population of Philadelphia increased to 250,000 by 1940. Hundreds of thousands of southern African Americans migrated to the metropolitan area, bringing their secular and religious folk music with them. After World War II, the black population of the metro grew to about 530,000 by 1960.
Black doo-wop groups had a major role in the evolution of rhythm and blues in early 1950s Philadelphia. Groups like the Castelles and the Turbans helped develop the music with their tight harmonies, lush ballads, and distinctive falsettos. Many of these vocal groups got together in secondary schools such as West Philadelphia High School, and performed at neighborhood recreation centers and teen dances. The Turbans, Philadelphia's first nationally charting R&B group, formed in 1953 when they were in their teens. They signed with Herald Records and recorded "Let Me Show You (Around My Heart)" with its B side, "When We Dance", in 1955. "When We Dance" became a national hit,
rising to no. 3 on the R&B charts and reaching the Top 40 on the pop charts.
The Silhouettes' crossover hit "Get a Job", released in 1957, reached number one on the pop and R&B charts in February 1958, while Lee Andrews & the Hearts had hits in 1957 and 1958 with "Teardrops", "Long Lonely Nights", and "Try the Impossible".
Kae Williams, a Philadelphia deejay, record label owner and producer, managed the doo-wop groups Lee Andrews & the Hearts, the Sensations, who sold nearly a million records in 1961 with the song Let Me In, and the Silhouettes, who had a number 1 hit in 1958 with "Get a Job". After the nationally distributed Ember label acquired the rights to "Get a Job", Dick Clark began to play it on American Bandstand, and subsequently it sold over a million copies, topping the Billboard R&B singles chart and pop singles chart.
Although American Bandstand'''s programming came to rely on the musical creations of black performers, the show marginalized black teens with exclusionary admissions policies until it moved to Los Angeles in 1964. Featuring young whites dancing to music popularized by local deejays Georgie Woods and Mitch Thomas, with steps created by their black teenage listeners, Bandstand presented to its national audience an image of youth culture that erased the presence of black teenagers in Philadelphia's youth music scene.
Broadcast from a warehouse on 46th and Market Street in West Philadelphia, most of American Bandstands young dancers were Italian Americans who attended a nearby Catholic high school in South Philadelphia. Like the rest of the entertainment industry, American Bandstand camouflaged the intrinsic blackness of the music in response to a national moral panic over rock 'n' roll's popularity with white teenagers, and the show's Italian American dancers and performers were deethnicized as "nice white kids", their Italian American youth identity submerged in whiteness.
Dick Clark kept track of the national music scene through promoters and popular disc jockeys. In Philadelphia, he listened to Hy Lit, the lone white deejay at WHAT, and African American disc jockeys Georgie Woods and Douglas "Jocko" Henderson on WDAS. These were Philadelphia's two major black radio stations; they were black-oriented, but white-owned.
The program director of WHAT, Charlie O'Donnell, hired Lit, who was Jewish, to deejay on the station in 1955, and Lit's career was launched. From there he went to WRCV and then around 1956 to WIBG, where over 70 percent of the radio audience in the listening area tuned in to his 6–10 p.m. program.
Cameo Records and Parkway Records were major record labels based in Philadelphia from 1956 (Cameo) and 1958 (Parkway) to 1967 that released doo-wop records. In 1957, small Philadelphia record label XYZ had recorded "Silhouettes", a song by local group the Rays, which Cameo picked up for national distribution. It eventually reached number 3 on both the R&B Best Sellers chart and Billboard Top 100, and also reached the top five on both the sales and airplay charts. It was the group's only top 40 hit.
Several white Philadelphia doo-wop groups also had chart-toppers; the Capris had a regional hit with "God Only Knows" in 1954. In 1958, Danny & the Juniors had a number-one hit with "At the Hop" and their song "Rock and Roll Is Here to Stay" reached the top twenty. In 1961, the Dovells reached the number two spot with "The Bristol Stomp", about teenagers in Bristol, Pennsylvania who were dancing a new step called "The Stomp".
Jerry Blavat, a half-Jewish, half-Italian, popular deejay on Philadelphia radio, built his career hosting dances and live shows and gained a devoted local following.
He soon had his own independent radio show, on which he introduced many doo-wop acts in the 1960s to a wide audience, including the Four Seasons, an Italian American group from Newark, New Jersey.
Jamaica
The history of modern Jamaican music is relatively short. A sudden shift in its style began in the early 1950s with the importing of American rhythm and blues records to the island and the new availability of affordable transistor radios. Listeners whose tastes had been neglected by the lone Jamaican station at the time, RJR (Real Jamaican Radio), tuned into the R&B music being broadcast on the powerful nighttime signals of American AM radio stations, especially WLAC in Nashville, WNOE in New Orleans, and WINZ in Miami. On these stations Jamaicans could hear the likes of Fats Domino and doo-wop vocal groups.
Jamaicans who worked as migrant agricultural workers in the southern US returned with R&B records, which sparked an active dance scene in Kingston. In the late 1940s and early 1950s, many working-class Jamaicans who could not afford radios attended sound system dances, large outdoor dances featuring a deejay (selector) and his selection of records. Enterprising deejays used mobile sound systems to create impromptu street parties. These developments were the principal means by which new American R&B records were introduced to a mass Jamaican audience.
The opening by Ken Khouri of Federal Studios, Jamaica's first recording facility, in 1954, marked the beginning of a prolific recording industry and a thriving rhythm and blues scene in Jamaica. In 1957, American performers including Rosco Gordon and the Platters performed in Kingston. In late August 1957, the doo-wop group Lewis Lymon and the Teenchords arrived in Kingston as part of the "Rock-a-rama" rhythm and blues troupe for two days of shows at the Carib Theatre.
The Four Coins, a Greek American doo-wop group from Pittsburgh, did a show in Kingston in 1958.
Like their American exemplars, many Jamaican vocalists began their careers by practicing harmonies in groups on street corners, before moving on to the talent contest circuit that was the proving ground for new talent in the days before the rise of the first sound systems.
In 1959, while he was a student at Kingston College, Dobby Dobson wrote the doo-wop song "Cry a Little Cry" in honor of his shapely biology teacher, and recruited a group of his schoolmates to back him on a recording of the song under the name Dobby Dobson and the Deltas on the Tip-Top label. It climbed to number one on the RJR charts, where it spent some six weeks.
The harmonizing of the American doo-wop groups the Drifters and the Impressions served as a vocal model for a newly formed (1963) group, the Wailers, in which Bob Marley sang lead while Bunny Wailer sang high harmony and Peter Tosh sang low harmony. The Wailers recorded an homage to doo-wop in 1965 with their version of Dion and the Belmonts' "A Teenager in Love". Bunny Wailer cited Frankie Lymon and the Teenagers, the Platters, and the Drifters as early influences on the group. The Wailers covered Harvey and the Moonglows' 1958 doo-wop hit, "Ten Commandments of Love", on their debut album, Wailing Wailers, released in late 1965. The same year, the Wailers cut the doo-wop song "Lonesome Feelings", with "There She Goes" on the B-side, as a single produced by Coxsone Dodd.
Doo-wop and racial relations
The synthesis of music styles that evolved into what is now called rhythm and blues, previously labeled "race music" by the record companies, found a broad youth audience in the postwar years and helped to catalyze changes in racial relations in American society. By 1948, RCA Victor was marketing black music under the name "Blues and Rhythm". In 1949, Jerry Wexler, a reporter for Billboard magazine at the time, reversed the words and coined the name "Rhythm and Blues" to replace the term "Race Music" for the magazine's black music chart.
One style of rhythm and blues was mostly vocal, with instrumental backing that ranged from a full orchestra to none. It was most often performed by a group, frequently a quartet, as in the black gospel tradition; utilizing close harmonies, this style was nearly always performed in a slow to medium tempo. The lead voice, usually one in the upper register, often sang over the driving, wordless chords of the other singers or interacted with them in a call-and-response exchange. Vocal harmony groups such as the Ink Spots embodied this style, the direct antecedent of doo-wop, which rose from inner city street corners in the mid-1950s and ranked high on the popular music charts between 1955 and 1959.
Black and white young people both wanted to see popular doo-wop acts perform, and racially mixed groups of youths would stand on inner city street corners and sing doo-wop songs a capella. This angered white supremacists, who considered rhythm and blues and rock and roll a danger to America's youth.
The development of rhythm and blues coincided with the issue of racial segregation becoming more socially contentious in American society, while the black leadership increasingly challenged the old social order. The white power structure in American society and some executives in the corporately controlled entertainment industry saw rhythm and blues, rooted in black culture, as obscene, and considered it a threat to white youth, among whom the genre was becoming increasingly popular.
Jewish influence in doo-wop
Jewish composers, musicians, and promoters had a prominent role in the transition to doo-wop and rock 'n' roll from jazz and swing in American popular music of the 1950s, while Jewish businessmen founded many of the labels that recorded rhythm and blues during the height of the vocal group era.
In the decade from 1944 to 1955, many of the most influential record companies specializing in "race" musicor "rhythm and blues", as it later came to be knownwere owned or co-owned by Jews. It was the small independent record companies that recorded, marketed, and distributed doo-wop music. For example, Jack and Devora Brown, a white Jewish couple in Detroit, founded Fortune Records in 1946, and recorded a variety of eccentric artists and sounds; in the mid-1950s they became champions of Detroit rhythm and blues, including the music of local doo-wop groups.
A few other Jewish women were in the recording business, such as Florence Greenberg, who started the Scepter label in 1959, and signed the African American girl group, the Shirelles. The songwriting team of Goffin and King, who worked for Don Kirshner's Aldon music at 1650 Broadway (near the famed Brill Building at 1619), offered Greenberg a song, "Will You Love Me Tomorrow?", which was recorded by the Shirelles and rose to number 1 on the Billboard Hot 100 chart in 1961. During the early 1960s, Scepter was the most successful independent record label.
Deborah Chessler, a young Jewish sales clerk interested in black music, became the manager and songwriter for the Baltimore doo-wop group the Orioles. They recorded her song "It's Too Soon to Know" and it reached no. 1 on Billboards race records charts in November 1948.
Some record company owners such as Herman Lubinsky had a reputation for exploiting black artists. Lubinsky, who founded Savoy Records in 1942, produced and recorded the Carnations, the Debutantes, the Falcons, the Jive Bombers, the Robins, and many others. Although his entrepreneurial approach to the music business and his role as a middleman between black artists and white audiences created opportunities for unrecorded groups to pursue wider exposure, he was reviled by many of the black musicians he dealt with. Historians Robert Cherry and Jennifer Griffith maintain that regardless of Lubinsky's personal shortcomings, the evidence that he treated African American artists worse in his business dealings than other independent label owners did is unconvincing. They contend that in the extremely competitive independent record company business during the postwar era, the practices of Jewish record owners generally were more a reflection of changing economic realities in the industry than of their personal attitudes.
New York rockers Lou Reed, Joey and Tommy Ramone, and Chris Stein were doo-wop fans, as were many other Jewish punks and proto-punks. Reed recorded his first lead vocals in 1962 on two doo-wop songs, "Merry Go Round" and "Your Love", which were not released at the time. A few years later, Reed worked as a staff songwriter writing bubblegum and doo-wop songs in the assembly-line operation at Pickwick Records in New York.
Doo-wop influence on punk and proto-punk rockers
The R&B and doo-wop music that informed early rock 'n' roll was racially appropriated in the 1970s just as blues-based rock had been in the 1950s and 1960s. Generic terms such as "Brill Building music" obscure the roles of the black producers, writers, and groups like the Marvelettes and the Supremes, who were performing similar music and creating hits for the Motown label, but were categorized as soul. According to ethnomusicologist Evan Rapport, before 1958 more than ninety percent of doo-wop performers were African-American, but the situation changed as large numbers of white groups began to enter the performance arena.
This music was embraced by punk rockers in the 1970s, as part of a larger societal trend among white people in the US of romanticizing it as music that belonged to a simpler (in their eyes) time of racial harmony before the social upheaval of the 1960s. White Americans had a nostalgic fascination with the 1950s and early 1960s that entered mainstream culture beginning in 1969 when Gus Gossert started to broadcast early rock and roll and doo-wop songs on New York's WCBS-FM radio station. This trend reached its peak in racially segregated commercial productions such as American Graffiti, Happy Days, and Grease, which was double-billed with the Ramones' B-movie feature Rock 'n' Roll High School in 1979.
Early punk rock adaptations of the 12-bar aab pattern associated with California surf or beach music, done within eight-, sixteen-, and twenty-four bar forms, were made by bands such as the Ramones, either as covers or as original compositions. Employing stylistic conventions of 1950s and 1960s doowop and rock and roll to signify the period referenced, some punk bands used call-and-response background vocals and doo-wop style vocables in songs, with subject matter following the example set by rock and roll and doo-wop groups of that era: teenage romance, cars, and dancing. Early punk rockers sometimes portrayed these nostalgic 1950s tropes with irony and sarcasm according to their own lived experiences, but they still indulged the fantasies evoked by the images.
By 1963 and 1964, proto-punk rocker Lou Reed was working the college circuit, leading bands that played covers of three-chord hits by pop groups and "anything from New York with a classic doo-wop feel and a street attitude".
Jonathan Richman, founder of the influential proto-punk band the Modern Lovers, cut the album Rockin' and Romance (1985) with acoustic guitar and doo-wop harmonies. His song "Down in Bermuda" for example, was directly influenced by "Down in Cuba" by the Royal Holidays. His album Modern Lovers 88 (1987), with doo-wop stylings and Bo Diddley rhythms, was recorded in acoustic trio format.
Popularity
Doo-wop groups achieved 1951 R&B chart hits with songs such as "Sixty Minute Man" by Billy Ward and His Dominoes, "Where Are You?" by the Mello-Moods, "The Glory of Love" by the Five Keys, and "Shouldn't I Know" by the Cardinals.
Doo-wop groups played a significant role in ushering in the rock and roll era when two big rhythm and blues hits by vocal harmony groups, "Gee" by the Crows, and "Sh-Boom" by the Chords, crossed over onto the pop music charts in 1954. "Sh-Boom" is considered to have been the first rhythm-and-blues record to break into the top ten on the Billboard charts, reaching #5; a few months later, a white group from Canada, the Crew Cuts, released their cover of the song, which reached #1 and remained there for nine weeks. This was followed by several other white artists covering doo-wop songs performed by black artists, all of which scored higher on the Billboard charts than did the originals. These include "Hearts of Stone" by the Fontaine Sisters (# 1), "At My Front Door" by Pat Boone (# 7), "Sincerely" by the McGuire Sisters (# 1), and "Little Darlin'" by the Diamonds (# 2). Music historian Billy Vera points out that these recordings are not considered to be doo-wop.
"Only You" was released in June 1955 by pop group the Platters. That same year the Platters had a number one pop chart hit with "The Great Pretender", released on 3 November. In 1956, Frankie Lymon and the Teenagers appeared on the Frankie Laine show in New York, which was televised nationally, performing their hit "Why Do Fools Fall in Love?". Frankie Laine referred to it as "rock and roll"; Lymon's extreme youth appealed to a young and enthusiastic audience. His string of hits included: "I Promise to Remember", "The ABC's of Love" and "I'm Not a Juvenile Delinquent".
Up tempo doo-wop groups such as the Monotones", the Silhouettes, and the Marcels had hits that charted on Billboard. All-white doo-wop groups would appear and also produce hits: The Mello-Kings in 1957 with "Tonight, Tonight", the Diamonds in 1957 with the chart-topping cover song "Little Darlin'" (original song by an African American group), the Skyliners in 1959 with "Since I Don't Have You", the Tokens in 1961 with "The Lion Sleeps Tonight".
The peak of doo-wop might have been in the late 1950s; in the early 1960s the most notable hits were Dion's "Runaround Sue", "The Wanderer", "Lovers Who Wander" and "Ruby Baby" and the Marcels' "Blue Moon". There was a revival of the nonsense syllable form of doo-wop in the early 1960s, with popular records by the Marcels, the Rivingtons, and Vito & the Salutations. The genre reached the self-referential stage, with songs about the singers ("Mr. Bass Man" by Johnny Cymbal) and the songwriters ("Who Put the Bomp?" by Barry Mann), in 1961.
Doo-wop's influence
Other pop R&B groups, including the Coasters, the Drifters, the Midnighters, and the Platters, helped link the doo-wop style to the mainstream, and to the future sound of soul music. The style's influence is heard in the music of the Miracles, particularly in their early hits such as "Got A Job" (an answer song to "Get a Job"), "Bad Girl", "Who's Loving You", "(You Can) Depend on Me", and "Ooo Baby Baby". Doo-wop was a precursor to many of the African-American musical styles seen today. Having evolved from pop, jazz and blues, doo-wop influenced many of the major rock and roll groups that defined the latter decades of the 20th century, and laid the foundation for many later musical innovations.
Doo-wop's influence continued in soul, pop, and rock groups of the 1960s, including the Four Seasons, girl groups, and vocal surf music performers such as the Beach Boys. In the Beach Boys' case, doo-wop influence is evident in the chord progression used on part of their early hit "Surfer Girl". The Beach Boys later acknowledged their debt to doo-wop by covering the Regents' 1961 #7 hit, "Barbara Ann" with their #2 cover of the song in 1966. In 1984, Billy Joel released "The Longest Time", a clear tribute to doo-wop music.
Revivals
Although the ultimate longevity of doo-wop has been disputed, at various times in the 1970s–1990s the genre saw revivals, with artists being concentrated in urban areas, mainly in New York City, Chicago, Philadelphia, Newark, and Los Angeles. Revival television shows and boxed CD sets such as the "Doo Wop Box" set 1–3 have rekindled interest in the music, the artists, and their stories.Cruising with Ruben & the Jets, released in late 1968, is a concept album of doo-wop music recorded by Frank Zappa and the Mothers of Invention performing as a fictitious Chicano doo-wop band called Ruben & the Jets. In collaboration with Zappa, singer Ruben Guevara went on to start a real band called Ruben and the Jets. An early notable revival of "pure" doo-wop occurred when Sha Na Na appeared at the Woodstock Festival. Soul group the Trammps recorded "Zing! Went the Strings of My Heart" in 1972.
Over the years other groups have had doo-wop or doo-wop-influenced hits, such as Robert John's 1972 version of "The Lion Sleeps Tonight", Darts successful revival of the doo-wop standards "Daddy Cool" and "Come Back My Love" in the late 1970s, Toby Beau's 1978 hit "My Angel Baby", and Billy Joel's 1984 hit "The Longest Time". Soul and funk bands such as Zapp released the single ("Doo Wa Ditty (Blow That Thing)/A Touch of Jazz (Playin' Kinda Ruff Part II)"). The last doo-wop record to reach the top ten on the U.S. pop charts was "It's Alright" by Huey Lewis and the News, a doo-wop adaptation of the Impressions' 1963 Top 5 smash hit. It reached number 7 on the U.S. Billboard Adult contemporary chart in June 1993. Much of the album had a doo-wop flavor. Another song from the By the Way sessions to feature a doo-wop influence was a cover of "Teenager In Love", originally recorded by Dion and the Belmonts. The genre would see another resurgence in popularity in 2018, with the release of the album "Love in the Wind" by Brooklyn-based band, the Sha La Das, produced by Thomas Brenneck for the Daptone Record label.
Doo-wop is popular among barbershoppers and collegiate a cappella groups due to its easy adaptation to an all-vocal form. Doo-wop experienced a resurgence in popularity at the turn of the 21st century with the airing of PBS's doo-wop concert programs: Doo Wop 50, Doo Wop 51, and Rock, Rhythm, and Doo Wop. These programs brought back, live on stage, some of the better known doo-wop groups of the past. In addition to the Earth Angels, doo-wop acts in vogue in the second decade of the 2000s range from the Four Quarters to Street Corner Renaissance.
Bruno Mars and Meghan Trainor are two examples of current artists who incorporate doo-wop music into their records and live performances. Mars says he has "a special place in [his] heart for old-school music".
The formation of the hip-hop scene beginning in the late 1970s strongly parallels the rise of the doo-wop scene of the 1950s, particularly mirroring it in the emergence of the urban street culture of the 1990s. According to Bobby Robinson, a well-known producer of the period:
Doo-wop originally started out as the black teenage expression of the '50s and rap emerged as the black teenage ghetto expression of the '70s. Same identical thing that started it – the doowop groups down the street, in hallways, in alleys and on the corner. They'd gather anywhere and, you know, doo-wop doowah da dadada. You'd hear it everywhere. So the same thing started with rap groups around '76 or so. All of a sudden, everywhere you turned you'd hear kids rapping. In the summertime, they'd have these little parties in the park. They used to go out and play at night and kids would be out there dancing. All of a sudden, all you could hear was, hip hop hit the top don't stop. It's kids – to a great extent mixed-up and confused – reaching out to express themselves. They were forcefully trying to express themselves and they made up in fantasy what they missed in reality.
See also
List of doo-wop musicians
Scat singing
Vocalese
50s progression, also known as the "Doo-wop" progression
Boogie
References
Further reading
Baptista, Todd R. (1996). Group Harmony: Behind the Rhythm and Blues. New Bedford, Massachusetts: TRB Enterprises. .
Baptista, Todd R. (2000). Group Harmony: Echoes of the Rhythm and Blues Era. New Bedford, Massachusetts: TRB Enterprises. .
Cummings, Tony (1975). The Sound of Philadelphia. London: Eyre Methuen.
Engel, Ed (1977). White and Still All Right. Scarsdale, New York: Crackerjack Press.
Gribin, Anthony J., and Matthew M. Shiff (1992). Doo-Wop: The Forgotten Third of Rock 'n Roll. Iola, Wisconsin: Krause Publications.
Keyes, Johnny (1987). Du-Wop. Chicago: Vesti Press.
Lepri, Paul (1977). The New Haven Sound 1946–1976. New Haven, Connecticut: [self published].
McCutcheon, Lynn Ellis (1971). Rhythm and Blues. Arlington, Virginia.
Warner, Jay (1992). The Da Capo Book of American Singing Groups.'' New York: Da Capo Press.
Rhythm and blues music genres
Pop music genres
African-American music
African-American cultural history
Italian-American culture
1950s in music
1960s in music
|
Firuzbahram (, also Romanized as Fīrūzbahrām and Fīrūz Bahrām) is a village in Firuzbahram Rural District, Chahardangeh District, Eslamshahr County, Tehran Province, Iran. At the 2006 census, its population was 1,841, in 487 families.
References
Populated places in Eslamshahr County
|
"Emotions" is the first single released from Twista's third album, Adrenaline Rush. After several unsuccessful singles from his previous albums, "Emotions" was Twista's first charting single, making it to both the R&B and Rap charts, while just narrowly missing the Billboard Hot 100, instead peaking at #1 Bubbling Under Hot 100 Singles (#101 on the US charts).
Charts
1997 singles
Twista songs
Songs written by Twista
1997 songs
Atlantic Records singles
|
```objective-c
/*
===========================================================================
This file is part of Quake III Arena source code.
Quake III Arena source code is free software; you can redistribute it
or (at your option) any later version.
Quake III Arena source code 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 Quake III Arena source code; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
===========================================================================
*/
/*****************************************************************************
* name: l_memory.h
*
* desc: memory management
*
* $Archive: /source/code/botlib/l_memory.h $
*
*****************************************************************************/
//#define MEMDEBUG
#ifdef MEMDEBUG
#define GetMemory(size) GetMemoryDebug(size, #size, __FILE__, __LINE__);
#define GetClearedMemory(size) GetClearedMemoryDebug(size, #size, __FILE__, __LINE__);
//allocate a memory block of the given size
void *GetMemoryDebug(unsigned long size, char *label, char *file, int line);
//allocate a memory block of the given size and clear it
void *GetClearedMemoryDebug(unsigned long size, char *label, char *file, int line);
//
#define GetHunkMemory(size) GetHunkMemoryDebug(size, #size, __FILE__, __LINE__);
#define GetClearedHunkMemory(size) GetClearedHunkMemoryDebug(size, #size, __FILE__, __LINE__);
//allocate a memory block of the given size
void *GetHunkMemoryDebug(unsigned long size, char *label, char *file, int line);
//allocate a memory block of the given size and clear it
void *GetClearedHunkMemoryDebug(unsigned long size, char *label, char *file, int line);
#else
//allocate a memory block of the given size
void *GetMemory(unsigned long size);
//allocate a memory block of the given size and clear it
void *GetClearedMemory(unsigned long size);
//
#ifdef BSPC
#define GetHunkMemory GetMemory
#define GetClearedHunkMemory GetClearedMemory
#else
//allocate a memory block of the given size
void *GetHunkMemory(unsigned long size);
//allocate a memory block of the given size and clear it
void *GetClearedHunkMemory(unsigned long size);
#endif
#endif
//free the given memory block
void FreeMemory(void *ptr);
//returns the amount available memory
int AvailableMemory(void);
//prints the total used memory size
void PrintUsedMemorySize(void);
//print all memory blocks with label
void PrintMemoryLabels(void);
//returns the size of the memory block in bytes
int MemoryByteSize(void *ptr);
//free all allocated memory
void DumpMemory(void);
```
|
Betaeus is a genus of shrimp in the family Alpheidae, containing the following species:
Betaeus australis Stimpson, 1860
Betaeus emarginatus (H. Milne-Edwards, 1837)
Betaeus ensenadensis Glassell, 1938
Betaeus gelasinifer Nomura & Komai, 2000
Betaeus gracilis Hart, 1964
Betaeus granulimanus Yokoya, 1927
Betaeus harfordi (Kingsley, 1878)
Betaeus harrimani Rathbun, 1904
Betaeus jucundus Barnard, 1947
Betaeus lilianae Boschi, 1966
Betaeus longidactylus Lockington, 1877
Betaeus macginitieae Hart, 1964
Betaeus pingi Yu, 1930
Betaeus setosus Hart, 1964
Betaeus truncatus Dana, 1852
References
Alpheidae
Decapod genera
Taxa named by James Dwight Dana
|
Rotter's lymph nodes are small interpectoral lymph nodes located between the pectoralis major and pectoralis minor muscles. They receive lymphatic fluid from the muscles and the mammary gland, and deliver lymphatic fluid to the axillary lymphatic plexus. These lymph nodes are susceptible to breast cancer, as the cancer sometimes spreads (metastasizes) to the interpectoral lymph nodes. It signifies retrograde spread of tumour. Rotter's lymph nodes are named after German surgeon Josef Rotter (1857-1924), who described them in the late 19th century.
See also
Lymphatic system
External links
Anatomy Review: Lymphatic System by Dr. A. Obeidat
Breast Cancer in Interpectoral Lymph Nodes
OnLine Medical Dictionary
Lymphatics of the torso
|
The Ranchi - Chopan Express is an express train belonging to South Eastern Railway zone that runs between Ranchi Junction and Chopan in India. It is currently being operated with 18613/18614 train numbers on tri-weekly basis.
Service
The 18613/Ranchi - Chopan Express has an average speed of 47 km/h and covers 476 km in 10h 5m. The 18614/Chopan - Ranchi Express has an average speed of 42 km/h and covers 476 km in 11h 25m.
Route and halts
The important halts of the train are:
Coach composite
The train has standard ICF rakes with a max speed of 110 kmph. The train consists of 12 coaches :
10 General Unreserved
2 Seating cum Luggage Rake
Traction
Both trains are hauled by a Tatanagar Loco Shed based WAG-5 electric locomotive from Ranchi to Chopan.
Notes
See also
Ranchi Junction railway station
Chopan railway station
References
External links
18613/Ranchi - Chopan Express
18614/Chopan - Ranchi Express
Transport in Ranchi
Express trains in India
Rail transport in Jharkhand
Rail transport in Uttar Pradesh
Railway services introduced in 2009
|
```smalltalk
using UnityEngine;
using System.Collections;
public class UIStyleComponent : MonoBehaviour
{
public string m_styleID = "";
public string m_languageID = "";
}
```
|
```rust
use std::collections::HashMap;
use std::io::{self, Read, Write};
use std::ops::Range;
use common::{BinarySerializable, CountingWriter, HasLen, VInt};
use crate::directory::{FileSlice, TerminatingWrite, WritePtr};
use crate::schema::Field;
use crate::space_usage::{FieldUsage, PerFieldSpaceUsage};
#[derive(Eq, PartialEq, Hash, Copy, Ord, PartialOrd, Clone, Debug)]
pub struct FileAddr {
field: Field,
idx: usize,
}
impl FileAddr {
fn new(field: Field, idx: usize) -> FileAddr {
FileAddr { field, idx }
}
}
impl BinarySerializable for FileAddr {
fn serialize<W: Write + ?Sized>(&self, writer: &mut W) -> io::Result<()> {
self.field.serialize(writer)?;
VInt(self.idx as u64).serialize(writer)?;
Ok(())
}
fn deserialize<R: Read>(reader: &mut R) -> io::Result<Self> {
let field = Field::deserialize(reader)?;
let idx = VInt::deserialize(reader)?.0 as usize;
Ok(FileAddr { field, idx })
}
}
/// A `CompositeWrite` is used to write a `CompositeFile`.
pub struct CompositeWrite<W = WritePtr> {
write: CountingWriter<W>,
offsets: Vec<(FileAddr, u64)>,
}
impl<W: TerminatingWrite + Write> CompositeWrite<W> {
/// Crate a new API writer that writes a composite file
/// in a given write.
pub fn wrap(w: W) -> CompositeWrite<W> {
CompositeWrite {
write: CountingWriter::wrap(w),
offsets: Vec::new(),
}
}
/// Start writing a new field.
pub fn for_field(&mut self, field: Field) -> &mut CountingWriter<W> {
self.for_field_with_idx(field, 0)
}
/// Start writing a new field.
pub fn for_field_with_idx(&mut self, field: Field, idx: usize) -> &mut CountingWriter<W> {
let offset = self.write.written_bytes();
let file_addr = FileAddr::new(field, idx);
assert!(!self.offsets.iter().any(|el| el.0 == file_addr));
self.offsets.push((file_addr, offset));
&mut self.write
}
/// Close the composite file
///
/// An index of the different field offsets
/// will be written as a footer.
pub fn close(mut self) -> io::Result<()> {
let footer_offset = self.write.written_bytes();
VInt(self.offsets.len() as u64).serialize(&mut self.write)?;
let mut prev_offset = 0;
for (file_addr, offset) in self.offsets {
VInt(offset - prev_offset).serialize(&mut self.write)?;
file_addr.serialize(&mut self.write)?;
prev_offset = offset;
}
let footer_len = (self.write.written_bytes() - footer_offset) as u32;
footer_len.serialize(&mut self.write)?;
self.write.terminate()
}
}
/// A composite file is an abstraction to store a
/// file partitioned by field.
///
/// The file needs to be written field by field.
/// A footer describes the start and stop offsets
/// for each field.
#[derive(Clone)]
pub struct CompositeFile {
data: FileSlice,
offsets_index: HashMap<FileAddr, Range<usize>>,
}
impl std::fmt::Debug for CompositeFile {
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
f.debug_struct("CompositeFile")
.field("offsets_index", &self.offsets_index)
.finish()
}
}
impl CompositeFile {
/// Opens a composite file stored in a given
/// `FileSlice`.
pub fn open(data: &FileSlice) -> io::Result<CompositeFile> {
let end = data.len();
let footer_len_data = data.slice_from(end - 4).read_bytes()?;
let footer_len = u32::deserialize(&mut footer_len_data.as_slice())? as usize;
let footer_start = end - 4 - footer_len;
let footer_data = data
.slice(footer_start..footer_start + footer_len)
.read_bytes()?;
let mut footer_buffer = footer_data.as_slice();
let num_fields = VInt::deserialize(&mut footer_buffer)?.0 as usize;
let mut file_addrs = vec![];
let mut offsets = vec![];
let mut field_index = HashMap::new();
let mut offset = 0;
for _ in 0..num_fields {
offset += VInt::deserialize(&mut footer_buffer)?.0 as usize;
let file_addr = FileAddr::deserialize(&mut footer_buffer)?;
offsets.push(offset);
file_addrs.push(file_addr);
}
offsets.push(footer_start);
for i in 0..num_fields {
let file_addr = file_addrs[i];
let start_offset = offsets[i];
let end_offset = offsets[i + 1];
field_index.insert(file_addr, start_offset..end_offset);
}
Ok(CompositeFile {
data: data.slice_to(footer_start),
offsets_index: field_index,
})
}
/// Returns a composite file that stores
/// no fields.
pub fn empty() -> CompositeFile {
CompositeFile {
offsets_index: HashMap::new(),
data: FileSlice::empty(),
}
}
/// Returns the `FileSlice` associated with
/// a given `Field` and stored in a `CompositeFile`.
pub fn open_read(&self, field: Field) -> Option<FileSlice> {
self.open_read_with_idx(field, 0)
}
/// Returns the `FileSlice` associated with
/// a given `Field` and stored in a `CompositeFile`.
pub fn open_read_with_idx(&self, field: Field, idx: usize) -> Option<FileSlice> {
self.offsets_index
.get(&FileAddr { field, idx })
.map(|byte_range| self.data.slice(byte_range.clone()))
}
pub fn space_usage(&self) -> PerFieldSpaceUsage {
let mut fields = Vec::new();
for (&field_addr, byte_range) in &self.offsets_index {
let mut field_usage = FieldUsage::empty(field_addr.field);
field_usage.add_field_idx(field_addr.idx, byte_range.len().into());
fields.push(field_usage);
}
PerFieldSpaceUsage::new(fields)
}
}
#[cfg(test)]
mod test {
use std::io::Write;
use std::path::Path;
use common::{BinarySerializable, VInt};
use super::{CompositeFile, CompositeWrite};
use crate::directory::{Directory, RamDirectory};
use crate::schema::Field;
#[test]
fn test_composite_file() -> crate::Result<()> {
let path = Path::new("test_path");
let directory = RamDirectory::create();
{
let w = directory.open_write(path).unwrap();
let mut composite_write = CompositeWrite::wrap(w);
let mut write_0 = composite_write.for_field(Field::from_field_id(0u32));
VInt(32431123u64).serialize(&mut write_0)?;
write_0.flush()?;
let mut write_4 = composite_write.for_field(Field::from_field_id(4u32));
VInt(2).serialize(&mut write_4)?;
write_4.flush()?;
composite_write.close()?;
}
{
let r = directory.open_read(path)?;
let composite_file = CompositeFile::open(&r)?;
{
let file0 = composite_file
.open_read(Field::from_field_id(0u32))
.unwrap()
.read_bytes()?;
let mut file0_buf = file0.as_slice();
let payload_0 = VInt::deserialize(&mut file0_buf)?.0;
assert_eq!(file0_buf.len(), 0);
assert_eq!(payload_0, 32431123u64);
}
{
let file4 = composite_file
.open_read(Field::from_field_id(4u32))
.unwrap()
.read_bytes()?;
let mut file4_buf = file4.as_slice();
let payload_4 = VInt::deserialize(&mut file4_buf)?.0;
assert_eq!(file4_buf.len(), 0);
assert_eq!(payload_4, 2u64);
}
}
Ok(())
}
#[test]
fn test_composite_file_bug() -> crate::Result<()> {
let path = Path::new("test_path");
let directory = RamDirectory::create();
{
let w = directory.open_write(path).unwrap();
let mut composite_write = CompositeWrite::wrap(w);
let mut write = composite_write.for_field_with_idx(Field::from_field_id(1u32), 0);
VInt(32431123u64).serialize(&mut write)?;
write.flush()?;
let write = composite_write.for_field_with_idx(Field::from_field_id(1u32), 1);
write.flush()?;
let mut write = composite_write.for_field_with_idx(Field::from_field_id(0u32), 0);
VInt(1_000_000).serialize(&mut write)?;
write.flush()?;
composite_write.close()?;
}
{
let r = directory.open_read(path)?;
let composite_file = CompositeFile::open(&r)?;
{
let file = composite_file
.open_read_with_idx(Field::from_field_id(1u32), 0)
.unwrap()
.read_bytes()?;
let mut file0_buf = file.as_slice();
let payload_0 = VInt::deserialize(&mut file0_buf)?.0;
assert_eq!(file0_buf.len(), 0);
assert_eq!(payload_0, 32431123u64);
}
{
let file = composite_file
.open_read_with_idx(Field::from_field_id(1u32), 1)
.unwrap()
.read_bytes()?;
let file = file.as_slice();
assert_eq!(file.len(), 0);
}
{
let file = composite_file
.open_read_with_idx(Field::from_field_id(0u32), 0)
.unwrap()
.read_bytes()?;
let file = file.as_slice();
assert_eq!(file.len(), 3);
}
}
Ok(())
}
}
```
|
The canton of Mitry-Mory is a French administrative division, located in the arrondissement of Meaux, in the Seine-et-Marne département (Île-de-France région).
Demographics
Composition
At the French canton reorganisation which came into effect in March 2015, the canton was expanded from 13 to 19 communes:
Compans
Dammartin-en-Goële
Juilly
Longperrier
Marchémoret
Mauregard
Le Mesnil-Amelot
Mitry-Mory
Montgé-en-Goële
Moussy-le-Neuf
Moussy-le-Vieux
Nantouillet
Othis
Rouvres
Saint-Mard
Saint-Pathus
Thieux
Villeneuve-sous-Dammartin
Vinantes
See also
Cantons of the Seine-et-Marne department
Communes of the Seine-et-Marne department
References
Mitry Mory
|
Lisa Dixon is a professor of psychiatry at the Columbia University Irving Medical Center and the Director of the Division of Behavioral Health Services and Policy Research within the Department of Psychiatry. Her research focuses on improving the quality of care for individuals diagnosed with serious mental illnesses. She directs the Center for Practice Innovations (CPI) at the New York State Psychiatric Institute, where she oversees the implementation of evidence-based practices for individuals with serious mental illnesses for the New York State Office of Mental Health. She leads OnTrackNY, a statewide treatment program for adolescents and young adults experiencing their first episode of psychosis.
Dixon is also a professor of Psychiatry at the University of Maryland School of Medicine, where her primary research interests have focused on persons with severe mental illnesses who have co-morbid medical and substance use disorders, homelessness, and other vulnerabilities as well as on services to family members. Previously, she was the Director of the Division of Health Services Research within the Department of Psychiatry at Maryland and Director of Education and Residency Training at Maryland.
In 2002, she joined the Veterans Affairs Capital Health Care Network and is currently the Director of Health Services Research and Education Resource Development.
Dixon received her bachelor's degree in Economics from Harvard in 1980 and her medical degree from Weill Medical College of Cornell University in 1985. After completing her residency at the Payne Whitney Psychiatric Clinic in 1989, she completed a research fellowship at the Maryland Psychiatric Research Center. She later earned a Masters in Public Health from Johns Hopkins University.
Dixon has collaborated with the National Alliance on Mental Illness (NAMI) to establish the effectiveness of NAMI's Family to Family education program. In 2017, she became the editor-in-chief of Psychiatric Services, a journal of the American Psychiatric Association.
Areas of Expertise
Bipolar Disorder, Psychopharmacology, Mood Disorders, Obsessives Compulsive Disorder (OCD)
Awards
She is a recipient of NAMI's Scientific Research Award, NAMI NYC Metro's Volunteer of the Year Award and NAMI-NYS's Dr. Lewis Opler Memorial Award acknowledging her dedicated support for the organization.
References
Living people
Harvard College alumni
Johns Hopkins Bloomberg School of Public Health alumni
Weill Cornell Medical College alumni
University of Maryland, Baltimore alumni
Year of birth missing (living people)
American women psychiatrists
Columbia University faculty
21st-century American women
New York State Psychiatric Institute people
|
```java
Overloading Methods in Java
Connecting to FTP using Java
Distinction between `public` and `private` methods
Use `DecimalFormat` class to format numbers
Supply `toString()` in all classes
```
|
Kaleidoscope is an album by saxophonist Sonny Stitt compiling tracks recorded in 1950-52 and released on the Prestige label in 1957. The 1991 CD reissue added four bonus tracks to the original LP.
Reception
The Allmusic review stated "Deftly handling the alto, tenor, and baritone saxophone, bebop giant Sonny Stitt is heard to perfection here on a variety of early-'50s dates. Stitt not only shows off his patented speed throughout, but he goes a long way in dispelling criticisms of him being all fire and no grace".
Track listing
All compositions by Sonny Stitt and Bill Massey except as indicated
"Stitt's It" - 2:35
"Cool Mambo" - 2:40
"Blue Mambo" - 2:25
"Sonny Sounds" - 2:29
"Ain't Misbehavin'" (Harry Brooks, Andy Razaf, Fats Waller) - 3:02
"Later" (Sonny Stitt) - 3:00
"P.S. I Love You" (Gordon Jenkins, Johnny Mercer) - 3:00
"This Can't Be Love" (Lorenz Hart, Richard Rodgers) - 2:47
"Imagination" (Johnny Burke, Jimmy Van Heusen) - 3:24
"Cherokee" (Ray Noble) - 2:33
"Can't We Be Friends" (Paul James, Kay Swift) - 2:41
"Liza (All the Clouds'll Roll Away)" (George Gershwin, Ira Gershwin, Gus Kahn) - 2:45
"To Think You've Chosen Me" (Bennie Benjamin, George David Weiss) - 3:11 Bonus track on CD reissue
"After You've Gone" (Henry Creamer, Turner Layton) - 2:25 Bonus track on CD reissue
"Our Very Own" (Jack Elliott, Victor Young) - 3:05 Bonus track on CD reissue
"'S Wonderful" (George Gershwin, Ira Gershwin) - 2:24 Bonus track on CD reissue
Recorded in New York City on February 17, 1950 (tracks 5 & 6), October 8, 1950 (tracks 13-16), December 15, 1950 (tracks 9 & 10), January 31, 1951 (tracks 11 & 12), February 1, 1951 (tracks 7 & 8) and February 25, 1952 (tracks 1-4)
Personnel
Sonny Stitt - tenor saxophone (tracks 1-6 & 13-16), baritone saxophone (tracks 7-8), alto saxophone (tracks 9-12)
John Hunt (tracks 1-4), Bill Massey (tracks 1-4 & 13-16), Joe Newman (tracks 1-4) - trumpet
Matthew Gee - trombone (tracks 13-16)
Gene Ammons - baritone saxophone (tracks 13-16)
Charlie Bateman (tracks 7, 8, 11 & 12), Kenny Drew (tracks 5 & 6), John Houston (tracks 1-4), Junior Mance (tracks 9-16) - piano
Tommy Potter (tracks 5 & 6), Ernie Shepherd (tracks 1-4), Gene Wright (tracks 7-16) - bass
Art Blakey (tracks 5, 6, 9 & 10), Wes Landers (tracks 13-16), Teddy Stewart (tracks 7, 8, 11 & 12), Shadow Wilson (tracks 1-4) - drums
Humberto Molares - congas (tracks 1-4)
Larry Townsend - vocals (tracks 13-16)
References
1957 compilation albums
Prestige Records compilation albums
Sonny Stitt compilation albums
Albums produced by Bob Weinstock
|
```php
<?php
/*
* This file is part of the PHPUnit_MockObject package.
*
* (c) Sebastian Bergmann <sebastian@phpunit.de>
*
* For the full copyright and license information, please view the LICENSE
* file that was distributed with this source code.
*/
/**
*
*
* @since Class available since Release 3.0.0
*/
class Framework_MockObjectTest extends PHPUnit_Framework_TestCase
{
public function testMockedMethodIsNeverCalled()
{
$mock = $this->getMock('AnInterface');
$mock->expects($this->never())
->method('doSomething');
}
public function testMockedMethodIsNeverCalledWithParameter()
{
$mock = $this->getMock('SomeClass');
$mock->expects($this->never())
->method('doSomething')
->with('someArg');
}
public function testMockedMethodIsNotCalledWhenExpectsAnyWithParameter()
{
$mock = $this->getMock('SomeClass');
$mock->expects($this->any())
->method('doSomethingElse')
->with('someArg');
}
public function your_sha256_hashter()
{
$mock = $this->getMock('SomeClass');
$mock->method('doSomethingElse')
->with('someArg');
}
public function testMockedMethodIsCalledAtLeastOnce()
{
$mock = $this->getMock('AnInterface');
$mock->expects($this->atLeastOnce())
->method('doSomething');
$mock->doSomething();
}
public function testMockedMethodIsCalledAtLeastOnce2()
{
$mock = $this->getMock('AnInterface');
$mock->expects($this->atLeastOnce())
->method('doSomething');
$mock->doSomething();
$mock->doSomething();
}
public function testMockedMethodIsCalledAtLeastTwice()
{
$mock = $this->getMock('AnInterface');
$mock->expects($this->atLeast(2))
->method('doSomething');
$mock->doSomething();
$mock->doSomething();
}
public function testMockedMethodIsCalledAtLeastTwice2()
{
$mock = $this->getMock('AnInterface');
$mock->expects($this->atLeast(2))
->method('doSomething');
$mock->doSomething();
$mock->doSomething();
$mock->doSomething();
}
public function testMockedMethodIsCalledAtMostTwice()
{
$mock = $this->getMock('AnInterface');
$mock->expects($this->atMost(2))
->method('doSomething');
$mock->doSomething();
$mock->doSomething();
}
public function testMockedMethodIsCalledAtMosttTwice2()
{
$mock = $this->getMock('AnInterface');
$mock->expects($this->atMost(2))
->method('doSomething');
$mock->doSomething();
}
public function testMockedMethodIsCalledOnce()
{
$mock = $this->getMock('AnInterface');
$mock->expects($this->once())
->method('doSomething');
$mock->doSomething();
}
public function testMockedMethodIsCalledOnceWithParameter()
{
$mock = $this->getMock('SomeClass');
$mock->expects($this->once())
->method('doSomethingElse')
->with($this->equalTo('something'));
$mock->doSomethingElse('something');
}
public function testMockedMethodIsCalledExactly()
{
$mock = $this->getMock('AnInterface');
$mock->expects($this->exactly(2))
->method('doSomething');
$mock->doSomething();
$mock->doSomething();
}
public function testStubbedException()
{
$mock = $this->getMock('AnInterface');
$mock->expects($this->any())
->method('doSomething')
->will($this->throwException(new Exception));
try {
$mock->doSomething();
} catch (Exception $e) {
return;
}
$this->fail();
}
public function testStubbedWillThrowException()
{
$mock = $this->getMock('AnInterface');
$mock->expects($this->any())
->method('doSomething')
->willThrowException(new Exception);
try {
$mock->doSomething();
} catch (Exception $e) {
return;
}
$this->fail();
}
public function testStubbedReturnValue()
{
$mock = $this->getMock('AnInterface');
$mock->expects($this->any())
->method('doSomething')
->will($this->returnValue('something'));
$this->assertEquals('something', $mock->doSomething());
$mock = $this->getMock('AnInterface');
$mock->expects($this->any())
->method('doSomething')
->willReturn('something');
$this->assertEquals('something', $mock->doSomething());
}
public function testStubbedReturnValueMap()
{
$map = array(
array('a', 'b', 'c', 'd'),
array('e', 'f', 'g', 'h')
);
$mock = $this->getMock('AnInterface');
$mock->expects($this->any())
->method('doSomething')
->will($this->returnValueMap($map));
$this->assertEquals('d', $mock->doSomething('a', 'b', 'c'));
$this->assertEquals('h', $mock->doSomething('e', 'f', 'g'));
$this->assertEquals(null, $mock->doSomething('foo', 'bar'));
$mock = $this->getMock('AnInterface');
$mock->expects($this->any())
->method('doSomething')
->willReturnMap($map);
$this->assertEquals('d', $mock->doSomething('a', 'b', 'c'));
$this->assertEquals('h', $mock->doSomething('e', 'f', 'g'));
$this->assertEquals(null, $mock->doSomething('foo', 'bar'));
}
public function testStubbedReturnArgument()
{
$mock = $this->getMock('AnInterface');
$mock->expects($this->any())
->method('doSomething')
->will($this->returnArgument(1));
$this->assertEquals('b', $mock->doSomething('a', 'b'));
$mock = $this->getMock('AnInterface');
$mock->expects($this->any())
->method('doSomething')
->willReturnArgument(1);
$this->assertEquals('b', $mock->doSomething('a', 'b'));
}
public function testFunctionCallback()
{
$mock = $this->getMock('SomeClass', array('doSomething'), array(), '', false);
$mock->expects($this->once())
->method('doSomething')
->will($this->returnCallback('functionCallback'));
$this->assertEquals('pass', $mock->doSomething('foo', 'bar'));
$mock = $this->getMock('SomeClass', array('doSomething'), array(), '', false);
$mock->expects($this->once())
->method('doSomething')
->willReturnCallback('functionCallback');
$this->assertEquals('pass', $mock->doSomething('foo', 'bar'));
}
public function testStubbedReturnSelf()
{
$mock = $this->getMock('AnInterface');
$mock->expects($this->any())
->method('doSomething')
->will($this->returnSelf());
$this->assertEquals($mock, $mock->doSomething());
$mock = $this->getMock('AnInterface');
$mock->expects($this->any())
->method('doSomething')
->willReturnSelf();
$this->assertEquals($mock, $mock->doSomething());
}
public function testStubbedReturnOnConsecutiveCalls()
{
$mock = $this->getMock('AnInterface');
$mock->expects($this->any())
->method('doSomething')
->will($this->onConsecutiveCalls('a', 'b', 'c'));
$this->assertEquals('a', $mock->doSomething());
$this->assertEquals('b', $mock->doSomething());
$this->assertEquals('c', $mock->doSomething());
$mock = $this->getMock('AnInterface');
$mock->expects($this->any())
->method('doSomething')
->willReturnOnConsecutiveCalls('a', 'b', 'c');
$this->assertEquals('a', $mock->doSomething());
$this->assertEquals('b', $mock->doSomething());
$this->assertEquals('c', $mock->doSomething());
}
public function testStaticMethodCallback()
{
$mock = $this->getMock('SomeClass', array('doSomething'), array(), '', false);
$mock->expects($this->once())
->method('doSomething')
->will($this->returnCallback(array('MethodCallback', 'staticCallback')));
$this->assertEquals('pass', $mock->doSomething('foo', 'bar'));
}
public function testPublicMethodCallback()
{
$mock = $this->getMock('SomeClass', array('doSomething'), array(), '', false);
$mock->expects($this->once())
->method('doSomething')
->will($this->returnCallback(array(new MethodCallback, 'nonStaticCallback')));
$this->assertEquals('pass', $mock->doSomething('foo', 'bar'));
}
public function testMockClassOnlyGeneratedOnce()
{
$mock1 = $this->getMock('AnInterface');
$mock2 = $this->getMock('AnInterface');
$this->assertEquals(get_class($mock1), get_class($mock2));
}
public function testMockClassDifferentForPartialMocks()
{
$mock1 = $this->getMock('PartialMockTestClass');
$mock2 = $this->getMock('PartialMockTestClass', array('doSomething'));
$mock3 = $this->getMock('PartialMockTestClass', array('doSomething'));
$mock4 = $this->getMock('PartialMockTestClass', array('doAnotherThing'));
$mock5 = $this->getMock('PartialMockTestClass', array('doAnotherThing'));
$this->assertNotEquals(get_class($mock1), get_class($mock2));
$this->assertNotEquals(get_class($mock1), get_class($mock3));
$this->assertNotEquals(get_class($mock1), get_class($mock4));
$this->assertNotEquals(get_class($mock1), get_class($mock5));
$this->assertEquals(get_class($mock2), get_class($mock3));
$this->assertNotEquals(get_class($mock2), get_class($mock4));
$this->assertNotEquals(get_class($mock2), get_class($mock5));
$this->assertEquals(get_class($mock4), get_class($mock5));
}
public function testMockClassStoreOverrulable()
{
$mock1 = $this->getMock('PartialMockTestClass');
$mock2 = $this->getMock('PartialMockTestClass', array(), array(), 'MyMockClassNameForPartialMockTestClass1');
$mock3 = $this->getMock('PartialMockTestClass');
$mock4 = $this->getMock('PartialMockTestClass', array('doSomething'), array(), 'AnotherMockClassNameForPartialMockTestClass');
$mock5 = $this->getMock('PartialMockTestClass', array(), array(), 'MyMockClassNameForPartialMockTestClass2');
$this->assertNotEquals(get_class($mock1), get_class($mock2));
$this->assertEquals(get_class($mock1), get_class($mock3));
$this->assertNotEquals(get_class($mock1), get_class($mock4));
$this->assertNotEquals(get_class($mock2), get_class($mock3));
$this->assertNotEquals(get_class($mock2), get_class($mock4));
$this->assertNotEquals(get_class($mock2), get_class($mock5));
$this->assertNotEquals(get_class($mock3), get_class($mock4));
$this->assertNotEquals(get_class($mock3), get_class($mock5));
$this->assertNotEquals(get_class($mock4), get_class($mock5));
}
/**
* @covers PHPUnit_Framework_MockObject_Generator::getMock
*/
public function testGetMockWithFixedClassNameCanProduceTheSameMockTwice()
{
$mock = $this->getMockBuilder('StdClass')->setMockClassName('FixedName')->getMock();
$mock = $this->getMockBuilder('StdClass')->setMockClassName('FixedName')->getMock();
$this->assertInstanceOf('StdClass', $mock);
}
public function testOriginalConstructorSettingConsidered()
{
$mock1 = $this->getMock('PartialMockTestClass');
$mock2 = $this->getMock('PartialMockTestClass', array(), array(), '', false);
$this->assertTrue($mock1->constructorCalled);
$this->assertFalse($mock2->constructorCalled);
}
public function testOriginalCloneSettingConsidered()
{
$mock1 = $this->getMock('PartialMockTestClass');
$mock2 = $this->getMock('PartialMockTestClass', array(), array(), '', true, false);
$this->assertNotEquals(get_class($mock1), get_class($mock2));
}
public function testGetMockForAbstractClass()
{
$mock = $this->getMock('AbstractMockTestClass');
$mock->expects($this->never())
->method('doSomething');
}
public function traversableProvider()
{
return array(
array('Traversable'),
array('\Traversable'),
array('TraversableMockTestInterface'),
array(array('Traversable')),
array(array('Iterator','Traversable')),
array(array('\Iterator','\Traversable'))
);
}
/**
* @dataProvider traversableProvider
*/
public function testGetMockForTraversable($type)
{
$mock = $this->getMock($type);
$this->assertInstanceOf('Traversable', $mock);
}
public function testMultipleInterfacesCanBeMockedInSingleObject()
{
$mock = $this->getMock(array('AnInterface', 'AnotherInterface'));
$this->assertInstanceOf('AnInterface', $mock);
$this->assertInstanceOf('AnotherInterface', $mock);
}
/**
* @requires PHP 5.4.0
*/
public function testGetMockForTrait()
{
$mock = $this->getMockForTrait('AbstractTrait');
$mock->expects($this->never())->method('doSomething');
$parent = get_parent_class($mock);
$traits = class_uses($parent, false);
$this->assertContains('AbstractTrait', $traits);
}
public function testClonedMockObjectShouldStillEqualTheOriginal()
{
$a = $this->getMock('stdClass');
$b = clone $a;
$this->assertEquals($a, $b);
}
public function testMockObjectsConstructedIndepentantlyShouldBeEqual()
{
$a = $this->getMock('stdClass');
$b = $this->getMock('stdClass');
$this->assertEquals($a, $b);
}
public function testMockObjectsConstructedIndepentantlyShouldNotBeTheSame()
{
$a = $this->getMock('stdClass');
$b = $this->getMock('stdClass');
$this->assertNotSame($a, $b);
}
public function testClonedMockObjectCanBeUsedInPlaceOfOriginalOne()
{
$x = $this->getMock('stdClass');
$y = clone $x;
$mock = $this->getMock('stdClass', array('foo'));
$mock->expects($this->once())->method('foo')->with($this->equalTo($x));
$mock->foo($y);
}
public function testClonedMockObjectIsNotIdenticalToOriginalOne()
{
$x = $this->getMock('stdClass');
$y = clone $x;
$mock = $this->getMock('stdClass', array('foo'));
$mock->expects($this->once())->method('foo')->with($this->logicalNot($this->identicalTo($x)));
$mock->foo($y);
}
public function testObjectMethodCallWithArgumentCloningEnabled()
{
$expectedObject = new StdClass;
$mock = $this->getMockBuilder('SomeClass')
->setMethods(array('doSomethingElse'))
->enableArgumentCloning()
->getMock();
$actualArguments = array();
$mock->expects($this->any())
->method('doSomethingElse')
->will($this->returnCallback(function () use (&$actualArguments) {
$actualArguments = func_get_args();
}));
$mock->doSomethingElse($expectedObject);
$this->assertEquals(1, count($actualArguments));
$this->assertEquals($expectedObject, $actualArguments[0]);
$this->assertNotSame($expectedObject, $actualArguments[0]);
}
public function testObjectMethodCallWithArgumentCloningDisabled()
{
$expectedObject = new StdClass;
$mock = $this->getMockBuilder('SomeClass')
->setMethods(array('doSomethingElse'))
->disableArgumentCloning()
->getMock();
$actualArguments = array();
$mock->expects($this->any())
->method('doSomethingElse')
->will($this->returnCallback(function () use (&$actualArguments) {
$actualArguments = func_get_args();
}));
$mock->doSomethingElse($expectedObject);
$this->assertEquals(1, count($actualArguments));
$this->assertSame($expectedObject, $actualArguments[0]);
}
public function testArgumentCloningOptionGeneratesUniqueMock()
{
$mockWithCloning = $this->getMockBuilder('SomeClass')
->setMethods(array('doSomethingElse'))
->enableArgumentCloning()
->getMock();
$mockWithoutCloning = $this->getMockBuilder('SomeClass')
->setMethods(array('doSomethingElse'))
->disableArgumentCloning()
->getMock();
$this->assertNotEquals($mockWithCloning, $mockWithoutCloning);
}
public function testVerificationOfMethodNameFailsWithoutParameters()
{
$mock = $this->getMock('SomeClass', array('right', 'wrong'), array(), '', true, true, true);
$mock->expects($this->once())
->method('right');
$mock->wrong();
try {
$mock->__phpunit_verify();
$this->fail('Expected exception');
} catch (PHPUnit_Framework_ExpectationFailedException $e) {
$this->assertSame(
"Expectation failed for method name is equal to <string:right> when invoked 1 time(s).\n"
. "Method was expected to be called 1 times, actually called 0 times.\n",
$e->getMessage()
);
}
$this->resetMockObjects();
}
public function testVerificationOfMethodNameFailsWithParameters()
{
$mock = $this->getMock('SomeClass', array('right', 'wrong'), array(), '', true, true, true);
$mock->expects($this->once())
->method('right');
$mock->wrong();
try {
$mock->__phpunit_verify();
$this->fail('Expected exception');
} catch (PHPUnit_Framework_ExpectationFailedException $e) {
$this->assertSame(
"Expectation failed for method name is equal to <string:right> when invoked 1 time(s).\n"
. "Method was expected to be called 1 times, actually called 0 times.\n",
$e->getMessage()
);
}
$this->resetMockObjects();
}
public function testVerificationOfMethodNameFailsWithWrongParameters()
{
$mock = $this->getMock('SomeClass', array('right', 'wrong'), array(), '', true, true, true);
$mock->expects($this->once())
->method('right')
->with(array('first', 'second'));
try {
$mock->right(array('second'));
} catch (PHPUnit_Framework_ExpectationFailedException $e) {
$this->assertSame(
"Expectation failed for method name is equal to <string:right> when invoked 1 time(s)\n"
. "Parameter 0 for invocation SomeClass::right(Array (...)) does not match expected value.\n"
. "Failed asserting that two arrays are equal.",
$e->getMessage()
);
}
try {
$mock->__phpunit_verify();
$this->fail('Expected exception');
} catch (PHPUnit_Framework_ExpectationFailedException $e) {
$this->assertSame(
"Expectation failed for method name is equal to <string:right> when invoked 1 time(s).\n"
. "Parameter 0 for invocation SomeClass::right(Array (...)) does not match expected value.\n"
. "Failed asserting that two arrays are equal.\n"
. "--- Expected\n"
. "+++ Actual\n"
. "@@ @@\n"
. " Array (\n"
. "- 0 => 'first'\n"
. "- 1 => 'second'\n"
. "+ 0 => 'second'\n"
. " )\n",
$e->getMessage()
);
}
$this->resetMockObjects();
}
public function testVerificationOfNeverFailsWithEmptyParameters()
{
$mock = $this->getMock('SomeClass', array('right', 'wrong'), array(), '', true, true, true);
$mock->expects($this->never())
->method('right')
->with();
try {
$mock->right();
$this->fail('Expected exception');
} catch (PHPUnit_Framework_ExpectationFailedException $e) {
$this->assertSame(
'SomeClass::right() was not expected to be called.',
$e->getMessage()
);
}
$this->resetMockObjects();
}
public function testVerificationOfNeverFailsWithAnyParameters()
{
$mock = $this->getMock('SomeClass', array('right', 'wrong'), array(), '', true, true, true);
$mock->expects($this->never())
->method('right')
->withAnyParameters();
try {
$mock->right();
$this->fail('Expected exception');
} catch (PHPUnit_Framework_ExpectationFailedException $e) {
$this->assertSame(
'SomeClass::right() was not expected to be called.',
$e->getMessage()
);
}
$this->resetMockObjects();
}
/**
* @ticket 199
*/
public function testWithAnythingInsteadOfWithAnyParameters()
{
$mock = $this->getMock('SomeClass', array('right'), array(), '', true, true, true);
$mock->expects($this->once())
->method('right')
->with($this->anything());
try {
$mock->right();
$this->fail('Expected exception');
} catch (PHPUnit_Framework_ExpectationFailedException $e) {
$this->assertSame(
"Expectation failed for method name is equal to <string:right> when invoked 1 time(s)\n" .
"Parameter count for invocation SomeClass::right() is too low.\n" .
"To allow 0 or more parameters with any value, omit ->with() or use ->withAnyParameters() instead.",
$e->getMessage()
);
}
$this->resetMockObjects();
}
/**
* See path_to_url
*/
public function testMockArgumentsPassedByReference()
{
$foo = $this->getMockBuilder('MethodCallbackByReference')
->setMethods(array('bar'))
->disableOriginalConstructor()
->disableArgumentCloning()
->getMock();
$foo->expects($this->any())
->method('bar')
->will($this->returnCallback(array($foo, 'callback')));
$a = $b = $c = 0;
$foo->bar($a, $b, $c);
$this->assertEquals(1, $b);
}
/**
* See path_to_url
*/
public function testMockArgumentsPassedByReference2()
{
$foo = $this->getMockBuilder('MethodCallbackByReference')
->disableOriginalConstructor()
->disableArgumentCloning()
->getMock();
$foo->expects($this->any())
->method('bar')
->will($this->returnCallback(
function (&$a, &$b, $c) {
$b = 1;
}
));
$a = $b = $c = 0;
$foo->bar($a, $b, $c);
$this->assertEquals(1, $b);
}
/**
* path_to_url
*/
public function testMockArgumentsPassedByReference3()
{
$foo = $this->getMockBuilder('MethodCallbackByReference')
->setMethods(array('bar'))
->disableOriginalConstructor()
->disableArgumentCloning()
->getMock();
$a = new stdClass();
$b = $c = 0;
$foo->expects($this->any())
->method('bar')
->with($a, $b, $c)
->will($this->returnCallback(array($foo, 'callback')));
$foo->bar($a, $b, $c);
}
/**
* path_to_url
*/
public function testMockArgumentsPassedByReference4()
{
$foo = $this->getMockBuilder('MethodCallbackByReference')
->setMethods(array('bar'))
->disableOriginalConstructor()
->disableArgumentCloning()
->getMock();
$a = new stdClass();
$b = $c = 0;
$foo->expects($this->any())
->method('bar')
->with($this->isInstanceOf("stdClass"), $b, $c)
->will($this->returnCallback(array($foo, 'callback')));
$foo->bar($a, $b, $c);
}
/**
* @requires extension soap
*/
public function testCreateMockFromWsdl()
{
$mock = $this->getMockFromWsdl(__DIR__ . '/_fixture/GoogleSearch.wsdl', 'WsdlMock');
$this->assertStringStartsWith(
'Mock_WsdlMock_',
get_class($mock)
);
}
/**
* @requires extension soap
*/
public function testCreateNamespacedMockFromWsdl()
{
$mock = $this->getMockFromWsdl(__DIR__ . '/_fixture/GoogleSearch.wsdl', 'My\\Space\\WsdlMock');
$this->assertStringStartsWith(
'Mock_WsdlMock_',
get_class($mock)
);
}
/**
* @requires extension soap
*/
public function testCreateTwoMocksOfOneWsdlFile()
{
$mock = $this->getMockFromWsdl(__DIR__ . '/_fixture/GoogleSearch.wsdl');
$mock = $this->getMockFromWsdl(__DIR__ . '/_fixture/GoogleSearch.wsdl');
}
/**
* @see path_to_url
* @ticket 156
*/
public function testInterfaceWithStaticMethodCanBeStubbed()
{
$this->assertInstanceOf(
'InterfaceWithStaticMethod',
$this->getMock('InterfaceWithStaticMethod')
);
}
/**
* @expectedException PHPUnit_Framework_MockObject_BadMethodCallException
*/
public function testInvokingStubbedStaticMethodRaisesException()
{
$mock = $this->getMock('ClassWithStaticMethod');
$mock->staticMethod();
}
/**
* @see path_to_url
* @ticket 171
*/
public function your_sha256_hashokingTheConstructor()
{
$this->assertInstanceOf(
'ClassThatImplementsSerializable',
$this->getMockBuilder('ClassThatImplementsSerializable')
->disableOriginalConstructor()
->getMock()
);
}
private function resetMockObjects()
{
$refl = new ReflectionObject($this);
$refl = $refl->getParentClass();
$prop = $refl->getProperty('mockObjects');
$prop->setAccessible(true);
$prop->setValue($this, array());
}
}
```
|
```python
from typing import Any, Tuple
import queue
from ray.rllib.utils.annotations import OldAPIStack
@OldAPIStack
class MinibatchBuffer:
"""Ring buffer of recent data batches for minibatch SGD.
This is for use with AsyncSamplesOptimizer.
"""
def __init__(
self,
inqueue: queue.Queue,
size: int,
timeout: float,
num_passes: int,
init_num_passes: int = 1,
):
"""Initialize a minibatch buffer.
Args:
inqueue (queue.Queue): Queue to populate the internal ring buffer
from.
size: Max number of data items to buffer.
timeout: Queue timeout
num_passes: Max num times each data item should be emitted.
init_num_passes: Initial passes for each data item.
Maxiumum number of passes per item are increased to num_passes over
time.
"""
self.inqueue = inqueue
self.size = size
self.timeout = timeout
self.max_initial_ttl = num_passes
self.cur_initial_ttl = init_num_passes
self.buffers = [None] * size
self.ttl = [0] * size
self.idx = 0
def get(self) -> Tuple[Any, bool]:
"""Get a new batch from the internal ring buffer.
Returns:
buf: Data item saved from inqueue.
released: True if the item is now removed from the ring buffer.
"""
if self.ttl[self.idx] <= 0:
self.buffers[self.idx] = self.inqueue.get(timeout=self.timeout)
self.ttl[self.idx] = self.cur_initial_ttl
if self.cur_initial_ttl < self.max_initial_ttl:
self.cur_initial_ttl += 1
buf = self.buffers[self.idx]
self.ttl[self.idx] -= 1
released = self.ttl[self.idx] <= 0
if released:
self.buffers[self.idx] = None
self.idx = (self.idx + 1) % len(self.buffers)
return buf, released
```
|
```objective-c
/****************************************************************************
* VCGLib o o *
* Visual and Computer Graphics Library o o *
* _ O _ *
* Visual Computing Lab /\/| *
* ISTI - Italian National Research Council | *
* \ *
* All rights reserved. *
* *
* This program is free software; you can redistribute it and/or modify *
* (at your option) any later version. *
* *
* This program is distributed in the hope that it will be useful, *
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
* for more details. *
* *
****************************************************************************/
/*
OCC = Optional Component Compact
compare with OCF(Optional Component Fast)
*/
#ifndef __VCG_FACE_PLUS_COMPONENT_OCC
#define __VCG_FACE_PLUS_COMPONENT_OCC
#include <vcg/simplex/face/component.h>
#include <vcg/container/vector_occ.h>
#include <vcg/space/plane3.h>
namespace vcg {
namespace face {
///*-------------------------- WedgeTexCoordOcc ----------------------------------------*/
template <class A, class T> class WedgeTexCoordOcc: public T {
public:
typedef A WedgeTexCoordType;
typedef typename T::FaceType FaceType;
WedgeTexCoordType &WT(const int&i) {return CAT< vector_occ<FaceType>,WedgeTexCoordType>::Instance()->Get((FaceType*)this);}
static bool HasWedgeTexCoord() { return true; }
static bool HasWedgeTexCoordOcc() { return true; }
};
template <class T> class WedgeTexCoordfOcc: public WedgeTexCoordOcc<TexCoord2<float,1>, T> {};
///*-------------------------- FACEINFO ----------------------------------------*/
template <class A, class T> class InfoOccBase: public T {
public:
typedef A InfoType;
typedef typename T::FaceType FaceType;
InfoType &N() {return CAT< vector_occ<FaceType>,InfoType>::Instance()->Get((FaceType*)this);}
static bool HasInfo() { return true; }
static bool HasInfoOcc() { return true; }
};
template <class T> class InfoOcc: public InfoOccBase<int, T> {};
///*-------------------------- NORMAL ----------------------------------------*/
template <class A, class T> class NormalOcc: public T {
public:
typedef A NormalType;
typedef typename T::FaceType FaceType;
NormalType &N() {return CAT< vector_occ<FaceType>,NormalType>::Instance()->Get((FaceType*)this);}
static bool HasFaceNormal() { return true; }
static bool HasFaceNormalOcc() { return true; }
};
template <class T> class Normal3sOcc: public NormalOcc<vcg::Point3s, T> {};
template <class T> class Normal3fOcc: public NormalOcc<vcg::Point3f, T> {};
template <class T> class Normal3dOcc: public NormalOcc<vcg::Point3d, T> {};
///*-------------------------- MARK ----------------------------------------*/
template <class T> class MarkOcc: public T {
public:
typedef int MarkType;
typedef typename T::FaceType FaceType;
int &IMark() {return CAT< vector_occ<FaceType>,MarkType>::Instance()->Get((MarkType*)this);}
static bool HasFaceMark() { return true; }
static bool HasFaceMarkOcc() { return true; }
inline void InitIMark() { IMark() = 0; }
};
///*-------------------------- COLOR ----------------------------------------*/
template <class A, class T> class ColorOcc: public T {
public:
typedef A ColorType;
typedef typename T::FaceType FaceType;
ColorType &C() { return CAT< vector_occ<FaceType>,ColorType>::Instance()->Get((FaceType*)this); }
static bool HasFaceColor() { return true; }
static bool HasfaceColorOcc() { return true; }
};
template <class T> class Color4bOcc: public ColorOcc<vcg::Color4b, T> {};
/*----------------------------- VFADJ ---------------------------------------*/
// questo tipo serve per tenere tutte le informazioni sull'adiacenza dentro una
// singola classe
template <class FP>
struct VFAdjTypeSup {
FP _vfp[3];
char _vfi[3];
};
template <class A, class T> class VFAdjOccBase: public T {
public:
// typedef A VFAdjType;
typedef VFAdjTypeSup<typename T::VertexPointer> VFAdjType;
typedef typename T::FaceType FaceType;
typedef typename T::FacePointer FacePointer;
FacePointer &VFp(const int j) {
return (CAT< vector_occ<FaceType>,VFAdjTypeSup<FacePointer> >::Instance()->Get((FaceType*)this))._vfp[j];}
FacePointer cVFp(const int j) const {
return (CAT< vector_occ<FaceType>,VFAdjTypeSup<FacePointer> >::Instance()->Get((FaceType*)this))._vfp[j];}
char &VFi(const int j) { return (CAT< vector_occ<FaceType>,VFAdjTypeSup<FacePointer> >::Instance()->Get((FaceType*)this))._vfi[j];}
static bool HasVFAdjacency() { return true; }
static bool HasVFAdjacencyOcc() { return true; }
};
template <class T> class VFAdjOcc : public VFAdjOccBase<VFAdjTypeSup<typename T::FacePointer>,T>{};
/*----------------------------- FFADJ -----------------------------------*/
// questo tipo serve per tenere tutte le informazioni sull'adiacenza dentro una
// singola classe
template <class FP>
struct FFAdjTypeSup {
FP _ffp[3];
char _ffi[3];
};
template <class A, class T> class FFAdjOccBase: public T {
public:
// typedef A FFAdjType;
typedef FFAdjTypeSup<typename T::FacePointer> FFAdjType;
typedef typename T::FaceType FaceType;
typedef typename T::FacePointer FacePointer;
FacePointer &FFp(const int j) {
return (CAT< vector_occ<FaceType>,FFAdjTypeSup<FacePointer> >::Instance()->Get((FaceType*)this))._ffp[j];}
FacePointer const FFp(const int j) const {
return (CAT< vector_occ<FaceType>,FFAdjTypeSup<FacePointer> >::Instance()->Get((FaceType*)this))._ffp[j];}
FacePointer const cFFp(const int j) const {
return (CAT< vector_occ<FaceType>,FFAdjTypeSup<FacePointer> >::Instance()->Get((FaceType*)this))._ffp[j];}
char &FFi(const int j) {
return (CAT< vector_occ<FaceType>,FFAdjTypeSup<FacePointer> >::Instance()->Get((FaceType*)this))._ffi[j];}
char cFFi(const int j) const{
return (CAT< vector_occ<FaceType>,FFAdjTypeSup<FacePointer> >::Instance()->Get((FaceType*)this ))._ffi[j];
}
static bool HasFFAdjacency() { return true; }
static bool HasFFAdjacencyOcc() { return true; }
};
template <class T> class FFAdjOcc : public FFAdjOccBase<FFAdjTypeSup<typename T::FacePointer>,T>{};
template <class T> class VertexRefOcc: public T {
public:
typedef typename T::VertexType VertexType;
typedef typename T::FaceType FaceType;
typedef typename T::CoordType CoordType;
inline typename T::VertexType * & V( const int j ) { assert(j>=0 && j<3);
return (CAT< vector_occ<FaceType>,VertexRef<T> >::Instance()->Get((FaceType*)this)).V(j); }
inline typename T::VertexType * const & V( const int j ) const { assert(j>=0 && j<3);
return (CAT< vector_occ<FaceType>,VertexRef<T> >::Instance()->Get((FaceType*)this)).V(j); }
inline typename T::VertexType * const cV( const int j ) const { assert(j>=0 && j<3);
return (CAT< vector_occ<FaceType>,VertexRef<T> >::Instance()->Get((FaceType*)this)).V(j); }
// Shortcut per accedere ai punti delle facce
inline typename T::CoordType & P( const int j ) { assert(j>=0 && j<3); return V(j)->P(); }
inline const typename T::CoordType & P( const int j ) const { assert(j>=0 && j<3); return V(j)->cP(); }
inline const typename T::CoordType &cP( const int j ) const { assert(j>=0 && j<3); return V(j)->cP(); }
/** Return the pointer to the ((j+1)%3)-th vertex of the face.
@param j Index of the face vertex.
*/
inline VertexType * & V0( const int j ) { return V(j);}
inline VertexType * & V1( const int j ) { return V((j+1)%3);}
inline VertexType * & V2( const int j ) { return V((j+2)%3);}
inline const VertexType * const & V0( const int j ) const { return V(j);}
inline const VertexType * const & V1( const int j ) const { return V((j+1)%3);}
inline const VertexType * const & V2( const int j ) const { return V((j+2)%3);}
inline const VertexType * const & cV0( const int j ) const { return cV(j);}
inline const VertexType * const & cV1( const int j ) const { return cV((j+1)%3);}
inline const VertexType * const & cV2( const int j ) const { return cV((j+2)%3);}
/// Shortcut per accedere ai punti delle facce
inline CoordType & P0( const int j ) { return V(j)->P();}
inline CoordType & P1( const int j ) { return V((j+1)%3)->P();}
inline CoordType & P2( const int j ) { return V((j+2)%3)->P();}
inline const CoordType & P0( const int j ) const { return V(j)->P();}
inline const CoordType & P1( const int j ) const { return V((j+1)%3)->P();}
inline const CoordType & P2( const int j ) const { return V((j+2)%3)->P();}
inline const CoordType & cP0( const int j ) const { return cV(j)->P();}
inline const CoordType & cP1( const int j ) const { return cV((j+1)%3)->P();}
inline const CoordType & cP2( const int j ) const { return cV((j+2)%3)->P();}
static bool HasVertexRef() { return true; }
};
} // end namespace face
template < class, class, class > class TriMesh;
namespace tri
{
/* template < class VertContainerType, class FaceType >
bool HasVFAdjacency (const TriMesh < VertContainerType , vector_occ< FaceType > > & m)
{
if( FaceType::HasVFAdjacencyOcc()) return m.face.IsEnabledAttribute< typename FaceType::VFAdjType >();
else return FaceType::HasVFAdjacency();
}
template < class VertContainerType, class FaceType >
bool HasFFAdjacency (const TriMesh < VertContainerType , vector_occ< FaceType > > & m)
{
if(FaceType::HasFFAdjacencyOcc()) return m.face.IsEnabledAttribute<typename FaceType::FFAdjType >();
else return FaceType::HasFFAdjacency();
}
template < class VertContainerType, class FaceType >
bool HasPerWedgeTexCoord (const TriMesh < VertContainerType , vector_occ< FaceType > > & m)
{
if(FaceType::HasWedgeTexCoordOcc()) return m.face.IsEnabledAttribute<typename FaceType::WedgeTexCoordType >();
else return FaceType::HasWedgeTexCoord();
}
template < class VertContainerType, class FaceType >
bool HasPerFaceColor (const TriMesh < VertContainerType , vector_occ< FaceType > > & m)
{
if(FaceType::HasFaceColorOcc()) return m.face.IsEnabledAttribute<typename FaceType::ColorType>();
else return FaceType::HasFaceColor();
}
template < class VertContainerType, class FaceType >
bool HasPerFaceMark (const TriMesh < VertContainerType , vector_occ< FaceType > > & m)
{
if(FaceType::HasFaceMarkOcc()) return m.face.IsEnabledAttribute<typename FaceType::MarkType>();
else return FaceType::HasFaceMark();
}
*/
}; // end namesace tri
}// end namespace vcg
#endif
```
|
```python
# Author: Meir Kriheli
# Id: $Id: he.py 7119 2011-09-02 13:00:23Z milde $
# New language mappings are welcome. Before doing a new translation, please
# read <path_to_url Two files must be
# translated for each language: one in docutils/languages, the other in
# docutils/parsers/rst/languages.
"""
English-language mappings for language-dependent features of
reStructuredText.
"""
__docformat__ = 'reStructuredText'
directives = {
# language-dependent: fixed
u'\u05ea\u05e9\u05d5\u05de\u05ea \u05dc\u05d1': 'attention',
u'\u05d6\u05d4\u05d9\u05e8\u05d5\u05ea': 'caution',
u'code (translation required)': 'code',
u'\u05e1\u05db\u05e0\u05d4': 'danger',
u'\u05e9\u05d2\u05d9\u05d0\u05d4' : 'error',
u'\u05e8\u05de\u05d6': 'hint',
u'\u05d7\u05e9\u05d5\u05d1': 'important',
u'\u05d4\u05e2\u05e8\u05d4': 'note',
u'\u05d8\u05d9\u05e4': 'tip',
u'\u05d0\u05d6\u05d4\u05e8\u05d4': 'warning',
'admonition': 'admonition',
'sidebar': 'sidebar',
'topic': 'topic',
'line-block': 'line-block',
'parsed-literal': 'parsed-literal',
'rubric': 'rubric',
'epigraph': 'epigraph',
'highlights': 'highlights',
'pull-quote': 'pull-quote',
'compound': 'compound',
'container': 'container',
#'questions': 'questions',
'table': 'table',
'csv-table': 'csv-table',
'list-table': 'list-table',
#'qa': 'questions',
#'faq': 'questions',
'meta': 'meta',
'math (translation required)': 'math',
#'imagemap': 'imagemap',
u'\u05ea\u05de\u05d5\u05e0\u05d4': 'image',
'figure': 'figure',
'include': 'include',
'raw': 'raw',
'replace': 'replace',
'unicode': 'unicode',
'date': 'date',
u'\u05e1\u05d2\u05e0\u05d5\u05df': 'class',
'role': 'role',
'default-role': 'default-role',
'title': 'title',
u'\u05ea\u05d5\u05db\u05df': 'contents',
'sectnum': 'sectnum',
'section-numbering': 'sectnum',
'header': 'header',
'footer': 'footer',
#'footnotes': 'footnotes',
#'citations': 'citations',
'target-notes': 'target-notes',
'restructuredtext-test-directive': 'restructuredtext-test-directive'}
"""English name to registered (in directives/__init__.py) directive name
mapping."""
roles = {
# language-dependent: fixed
'abbreviation': 'abbreviation',
'ab': 'abbreviation',
'acronym': 'acronym',
'ac': 'acronym',
u'code (translation required)': 'code',
'index': 'index',
'i': 'index',
u'\u05ea\u05d7\u05ea\u05d9': 'subscript',
'sub': 'subscript',
u'\u05e2\u05d9\u05dc\u05d9': 'superscript',
'sup': 'superscript',
'title-reference': 'title-reference',
'title': 'title-reference',
't': 'title-reference',
'pep-reference': 'pep-reference',
'pep': 'pep-reference',
'rfc-reference': 'rfc-reference',
'rfc': 'rfc-reference',
'emphasis': 'emphasis',
'strong': 'strong',
'literal': 'literal',
'math (translation required)': 'math',
'named-reference': 'named-reference',
'anonymous-reference': 'anonymous-reference',
'footnote-reference': 'footnote-reference',
'citation-reference': 'citation-reference',
'substitution-reference': 'substitution-reference',
'target': 'target',
'uri-reference': 'uri-reference',
'uri': 'uri-reference',
'url': 'uri-reference',
'raw': 'raw',}
"""Mapping of English role names to canonical role names for interpreted text.
"""
```
|
Hamza Younés (; born 16 April 1986) is a Tunisian professional footballer who plays as a striker.
After starting out at Sfaxien in his native country, Younés went on to compete in Romania, Bulgaria, Iran, Greece, Turkey and Qatar. Internationally, he amassed eleven caps for Tunisia between 2014 and 2017.
Club career
In August 2011, a few hours before the transfer deadline, Younés was brought to Étoile du Sahel, in an attempt to replace Ahmed Akaïchi. He later signed a three-year contract with the team. On 14 November 2011, Younés left Étoile.
In February 2012, after Hamza's unsuccessful transfer to Astra Giurgiu because of contractual misunderstandings, he scored a move to fellow Liga 1 team Petrolul Ploieşti. He made an immediate impact with the team, scoring 12 times in his first six months with the "Yellow Wolves". In the 2012–13 Liga 1 season he played 28 games and scored 13 goals, he also won the Romanian Cup playing in 4 games.
On 28 January 2014, Younés signed with Bulgarian club Botev Plovdiv on a three-year deal for an undisclosed fee. On his debut that took place on 23 February, he scored twice in the 2–2 draw with Ludogorets Razgrad, putting in a MOTM performance and was subsequently recognized as the best performer of the round.
In August 2014, Younés put pen to paper on a contract with Ludogorets Razgrad. He scored his first goal for the club in the 3–1 win over his former club, Botev Plovdiv, in the Bulgarian Supercup final. Younés made his debut in UEFA Champions League group stages in the 2–1 loss to Liverpool, providing an assist for Daniel Abalo's equalizer.
He joined Persian Gulf Pro League club Tractor SC in summer of 2015. On 30 July 2015, Younés made his debut for Tractor SC against Naft Tehran. He scored his first goal on 20 September 2015 in a 1–0 Hazfi Cup victory against Saba Qom.
On 4 July 2016, Younés signed with Greek Superleague club Xanthi on a year deal for an undisclosed fee. He finished the season as the second top scorer of the league after the Swedish striker Marcus Berg.
Aris
On 20 July 2018, after a year playing with BB Erzurumspor and Al Ahli, Younés has agreed to return to Greek Super League and sign contract until the summer of 2020 with Aris. On 2 September 2018, the Tunisian striker received a high cross from Manolis Tzanakakis and tapped it in with his chest, thus scoring his first goal for the season and opening the score in a 2–0 home win against AEL. On 17 September 2018, he opened the score with a penalty in a 2–0 home win against Levadiakos. On 30 September 2018, he scored in a 2-0 home win against Asteras Tripoli, successfully converting a penalty won by Mateo García. On 25 November 2018, Hamza Younés scored twice in added time as an astonishing finish matchday clash against OFI ended in a superb 2-1 win for the Salonica club at the Theodoros Vardinogiannis Stadium. One week later, he opened the scored with a penalty kick in an eventual 1-1 home draw against Panathinaikos.
On 18 March 2019, Hamza came in as a substitute and scored in an emphatic 5-0 home win against Apollon Smyrnis, returning to goals after three-and-a-half months. On 22 April 2019, his goal helped the team to a 2-1 away win against Panetolikos. On 5 May 2019, in the last matchday of the season, he was the undisputed MVP of an astounding 7-2 home win against Xanthi, scoring 1 goal and providing his teammates with 2 assists.
Petrolul Ploiești
On 9 September 2019 Younés signed a contract with Petrolul Ploiești.
International career
On 28 May 2014, he made his debut for Tunisia, playing in the last 4 minutes of a 1–0 friendly win against South Korea. His second cap came in a 0–1 friendly loss to Belgium.
Personal life
Hamza married a Romanian woman in Ploiești in 2016, with whom he has a child.
Career statistics
Club
International
Honours
CS Sfaxien
Tunisian Cup: 2008–09
CAF Confederation Cup: 2007, 2008
North African Cup Winners Cup: 2009
Petrolul Ploiești
Cupa României: 2012–13
Ludogorets Razgrad
Bulgarian A Group : 2014–15
Bulgarian Supercup: 2014
References
External links
1986 births
Living people
Tunisian men's footballers
Men's association football forwards
CS Sfaxien players
Étoile Sportive du Sahel players
FC Petrolul Ploiești players
Botev Plovdiv players
PFC Ludogorets Razgrad players
Tractor S.C. players
Al Ahli SC (Doha) players
Aris Thessaloniki F.C. players
Xanthi F.C. players
Athlitiki Enosi Larissa F.C. players
Liga I players
Liga II players
Qatar Stars League players
Persian Gulf Pro League players
Super League Greece players
TFF First League players
2011 African Nations Championship players
People from Monastir Governorate
2015 Africa Cup of Nations players
Tunisian expatriate men's footballers
Expatriate men's footballers in Romania
Tunisian expatriate sportspeople in Romania
Expatriate men's footballers in Belgium
Tunisian expatriate sportspeople in Belgium
Expatriate men's footballers in Bulgaria
Tunisian expatriate sportspeople in Bulgaria
Expatriate men's footballers in Iran
Tunisian expatriate sportspeople in Iran
Expatriate men's footballers in Greece
Tunisian expatriate sportspeople in Greece
Expatriate men's footballers in Turkey
Tunisia men's international footballers
Tunisia men's A' international footballers
|
Paju () is a 2009 South Korean film. It tells the tale of a teenage schoolgirl (Seo Woo) and her complex relationship with her older sister’s husband (Lee Sun-kyun). Set in the city where it takes its name from – a longtime military area and now a developing city located close to the North/South Korean border – its narrative deals with guilt, mystery, love and redemption, as well as the psychological layers of its characters. The film also offers a glimpse into South Korean society and the struggles some residents of Paju face.
In 2010 Paju became the first ever Korean film to open the International Film Festival Rotterdam and to compete at the Tribeca Film Festival.
Plot
Twenty-something Eun-mo listens to a taxi driver drone on as she rides down a foggy highway. The story then cycles back eight years earlier, when a lustful Joong-shik accidentally causes a woman to neglect her baby with disastrous consequences. Suffering from guilt, Joong-shik goes on the lam and holes up in the titular city of Paju, an underdeveloped and desolate city just north of Seoul and near the North Korean border. Teaching religious classes to the town's schoolgirls, Joong-shik captures the heart of local house owner Eun-soo, despite the protestations of her pubescent younger sister and Joong-shik's student Eun-mo.
Back in the present day, Joong-shik is now the ringleader of a political protest group whose interests run from obstructing the city's plans of gentrification to strengthening relations with North Koreans. Squatting in Paju's derelict apartments, the group is under siege from an unidentified property developer who has engaged goons to bulldoze the buildings. With only the briefest of hints as to what has transpired, Eun-soo is nowhere to be seen and Joong-shik and Eun-mo are clearly at odds. While believing her brother-in-law killed her sister for insurance money, Eun-mo finds herself falling in love with him, the sole guardian and grownup in the lonely girl's life. Narrative flashes back twice more to sparingly fill in the gaps on their shifting lives.
Cast
Lee Sun-kyun as Kim Joong-shik
Seo Woo as Choi Eun-mo
Shim Yi-young as Choi Eun-soo (Eun-mo's sister and Joong-shik's wife)
Kim Bo-kyung as Jung Ja-young
Kim Ye-ri as Mi-ae (Eun-mo's friend)
Lee Dae-yeon as Pastor (Joong-shik's cousin)
Lee Geung-young as gangster boss
Son Kang-kuk as gangster
Lee Mi-do
Jung Man-sik as anti-demolition member
Oh Dae-hwan as insurance examiner
Lee Bong-kyu as tenant on 1st floor
Production
This is Park Chan-ok's long-awaited follow-up to her critically praised 2002 debut Jealousy Is My Middle Name.
Park had found it difficult to secure funding for her sophomore film amidst Korean cinema's currently declining investment environment, and though her screenplay won the Kodak Award and received () worth of negative film from the Pusan Promotion Plan in 2005, it would eventually take almost seven years to complete Paju. Park said, "I stopped (filming) because I could not make any more modifications to it. I wanted to talk about emotions shared by two people who are similarly alone. More than a love affair between a man and a woman, the relationship between Joong-shik and Eun-mo is more of compassion that those in agony are likely to develop for each other."
Park said Paju is the perfect backdrop for this mysterious and gripping story. "When I think of Paju, I always view it as a mysterious place because it was always foggy whenever I visited there and it also sits right next to the border area dividing the two Koreas. I wanted to portray that mysterious feeling in the film."
Critical reception
Paju played to highly impressed reviews in its debut in the 14th Busan International Film Festival. The PIFF jury awarded it the NETPAC Award, describing it as "a fine example of passionate, high-quality filmmaking."
Screen International said of director Park, "This should help to cement Park's reputation as one of [South] Korea's most talented arthouse directors" while Variety praised the film's handling of elements of melodrama, action and mystery, saying they "make it function like a Bergmanesque thriller." The Hollywood Reporter wrote that "Seo delivers one of the most believable depictions of conflicted female emotion as has ever been put on film in Korea." Koreanfilm.org called it "without question one of the best Korean films of 2009."
In 2020, the film was ranked by The Guardian number 14 among the classics of modern South Korean cinema.
Film festivals
2009 Pusan International Film Festival
2010 International Film Festival Rotterdam
2010 Göteborg International Film Festival
2010 Deauville Asian Film Festival
2010 Trondheim International Film Festival
2010 Las Palmas de Gran Canaria International Film Festival
2010 International Women's Film Festival in Seoul
2010 CPH:PIX
2010 Tribeca Film Festival
2010 Barcelona Asian Film Festival
2010 Moscow International Film Festival
2010 Filmfest München
2010 Karlovy Vary International Film Festival
2010 Durban International Film Festival
2010 Melbourne International Film Festival
2010 Aichi International Women's Film Festival
2010 Haifa International Film Festival
2010 Oslo International Film Festival
2010 London Korean Film Festival
Awards and nominations
References
External links
Paju at Naver
Paju at M-Line Distribution
2000s Korean-language films
South Korean drama films
2009 drama films
2009 films
Myung Films films
Films directed by Park Chan-ok
2000s South Korean films
|
```java
Template methods in abstract classes
Utility classes and `static` methods
Keeping fields `private`
The `abstract` keyword
Double Brace Initialization
```
|
```python
from concurrent.futures import ThreadPoolExecutor
from datetime import datetime, timedelta
import json
from ModestMaps.Core import Coordinate
from notebook.base.handlers import IPythonHandler
from tornado import concurrent, ioloop
from tornado import gen
from tornado import web
from .utils import serialize_config, serialize_layer
class KTileAsyncClient(object):
__instance = None
def __new__(cls, *args, **kwargs):
if cls.__instance is None:
cls.__instance = super(
KTileAsyncClient, cls).__new__(cls, *args, **kwargs)
return cls.__instance
def __init__(self):
self.executor = ThreadPoolExecutor(max_workers=4)
self.io_loop = ioloop.IOLoop.current()
@concurrent.run_on_executor
def getTileResponse(self, layer, coord, extension):
return layer.getTileResponse(coord, extension)
class KtileHandler(IPythonHandler):
def check_xsrf_cookie(self):
# TODO: Find a way to correctly communicate XSRF secret to
# the kernel so ingest requests can be property authenticated
pass
def initialize(self, ktile_config_manager):
self.ktile_config_manager = ktile_config_manager
try:
if self.request.headers["Content-Type"].lower().startswith(
"application/json"):
try:
body = self.request.body.decode('utf-8')
except AttributeError:
body = self.request.body
self.request.json = json.loads(body)
except Exception:
self.request.json = None
def post(self, kernel_id):
# Note: needs paramater validation
kwargs = {} if self.request.json is None else self.request.json
self.ktile_config_manager.add_config(kernel_id, **kwargs)
self.log.info("Created config for {}".format(kernel_id))
self.finish()
def delete(self, kernel_id):
try:
del self.ktile_config_manager[kernel_id]
except KeyError:
raise web.HTTPError(404, u'Kernel %s not found' % kernel_id)
def get(self, kernel_id, **kwargs):
try:
config = self.ktile_config_manager[kernel_id]
except KeyError:
raise web.HTTPError(404, u'Kernel %s not found' % kernel_id)
self.finish(serialize_config(config))
class KtileLayerHandler(IPythonHandler):
def check_xsrf_cookie(self):
# TODO: Find a way to correctly communicate XSRF secret to
# the kernel so ingest requests can be property authenticated
pass
def initialize(self, ktile_config_manager):
self.ktile_config_manager = ktile_config_manager
def prepare(self):
try:
if self.request.headers["Content-Type"].lower().startswith(
"application/json"):
try:
body = self.request.body.decode('utf-8')
except AttributeError:
body = self.request.body
self.request.json = json.loads(body)
except Exception:
self.request.json = None
def post(self, kernel_id, layer_name):
# Note: needs paramater validation
try:
self.ktile_config_manager.add_layer(
kernel_id, layer_name, self.request.json)
self.finish()
except Exception:
import sys
import traceback
t, v, tb = sys.exc_info()
self.log.error(''.join(traceback.format_exception(t, v, tb)))
self.clear()
self.set_status(500)
self.finish({'error': traceback.format_exception(t, v, tb)})
def get(self, kernel_id, layer_name, **kwargs):
try:
config = self.ktile_config_manager[kernel_id]
except KeyError:
raise web.HTTPError(400, u'Kernel %s not found' % kernel_id)
try:
layer = config.layers[layer_name]
except KeyError:
raise web.HTTPError(404, u'Layer %s not found' % layer_name)
self.finish(serialize_layer(layer))
class KtileTileHandler(IPythonHandler):
def initialize(self, ktile_config_manager):
self.client = KTileAsyncClient()
self.ktile_config_manager = ktile_config_manager
@gen.coroutine
def get(self, kernel_id, layer_name, x, y, z, extension, **kwargs):
config = self.ktile_config_manager[kernel_id]
layer = config.layers[layer_name]
coord = Coordinate(int(y), int(x), int(z))
# To run synchronously:
# status_code, headers, content = layer.getTileResponse(
# coord, extension)
status_code, headers, content = yield self.client.getTileResponse(
layer, coord, extension)
if layer.max_cache_age is not None:
expires = datetime.utcnow() + timedelta(
seconds=layer.max_cache_age)
headers['Expires'] = expires.strftime('%a %d %b %Y %H:%M:%S GMT')
headers['Cache-Control'] = 'public, max-age=%d' \
% layer.max_cache_age
else:
headers['Cache-Control'] = 'no-cache, no-store, must-revalidate'
headers['Pragma'] = 'no-cache'
headers['Expires'] = '0'
# Force allow cross origin access
headers["Access-Control-Allow-Origin"] = "*"
# Fill tornado handler properties with ktile code/header/content
for k, v in headers.items():
self.set_header(k, v)
self.set_status(status_code)
self.write(content)
```
|
James T. Higgins (born 3 February 1926) is an Irish former professional footballer who played as a centre forward. He was born in Dublin and played with Home Farm, and then for Dundalk in the League of Ireland, before transferring to Birmingham City in England in 1949. In a four-year spell at Birmingham he played 50 league games and scored 12 goals before returning to play with Dundalk again in 1953.
Higgins played just once for the Republic of Ireland national football team, appearing in a 1–0 friendly defeat to Argentina in Dalymount Park on 13 May 1951.
References
1926 births
Possibly living people
Association footballers from County Dublin
Republic of Ireland men's association footballers
Ireland (FAI) men's international footballers
League of Ireland players
Home Farm F.C. players
Dundalk F.C. players
Birmingham City F.C. players
English Football League players
Men's association football forwards
|
```c++
// Use, modification and distribution are subject to the
// LICENSE_1_0.txt or copy at path_to_url
//
// This file is machine generated, do not edit by hand
// Polynomial evaluation using second order Horners rule
#ifndef BOOST_MATH_TOOLS_RAT_EVAL_18_HPP
#define BOOST_MATH_TOOLS_RAT_EVAL_18_HPP
namespace boost{ namespace math{ namespace tools{ namespace detail{
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T*, const U*, const V&, const mpl::int_<0>*) BOOST_MATH_NOEXCEPT(V)
{
return static_cast<V>(0);
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V&, const mpl::int_<1>*) BOOST_MATH_NOEXCEPT(V)
{
return static_cast<V>(a[0]) / static_cast<V>(b[0]);
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const mpl::int_<2>*) BOOST_MATH_NOEXCEPT(V)
{
return static_cast<V>((a[1] * x + a[0]) / (b[1] * x + b[0]));
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const mpl::int_<3>*) BOOST_MATH_NOEXCEPT(V)
{
return static_cast<V>(((a[2] * x + a[1]) * x + a[0]) / ((b[2] * x + b[1]) * x + b[0]));
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const mpl::int_<4>*) BOOST_MATH_NOEXCEPT(V)
{
return static_cast<V>((((a[3] * x + a[2]) * x + a[1]) * x + a[0]) / (((b[3] * x + b[2]) * x + b[1]) * x + b[0]));
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const mpl::int_<5>*) BOOST_MATH_NOEXCEPT(V)
{
if(x <= 1)
{
V x2 = x * x;
V t[4];
t[0] = a[4] * x2 + a[2];
t[1] = a[3] * x2 + a[1];
t[2] = b[4] * x2 + b[2];
t[3] = b[3] * x2 + b[1];
t[0] *= x2;
t[2] *= x2;
t[0] += static_cast<V>(a[0]);
t[2] += static_cast<V>(b[0]);
t[1] *= x;
t[3] *= x;
return (t[0] + t[1]) / (t[2] + t[3]);
}
else
{
V z = 1 / x;
V z2 = 1 / (x * x);
V t[4];
t[0] = a[0] * z2 + a[2];
t[1] = a[1] * z2 + a[3];
t[2] = b[0] * z2 + b[2];
t[3] = b[1] * z2 + b[3];
t[0] *= z2;
t[2] *= z2;
t[0] += static_cast<V>(a[4]);
t[2] += static_cast<V>(b[4]);
t[1] *= z;
t[3] *= z;
return (t[0] + t[1]) / (t[2] + t[3]);
}
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const mpl::int_<6>*) BOOST_MATH_NOEXCEPT(V)
{
if(x <= 1)
{
V x2 = x * x;
V t[4];
t[0] = a[5] * x2 + a[3];
t[1] = a[4] * x2 + a[2];
t[2] = b[5] * x2 + b[3];
t[3] = b[4] * x2 + b[2];
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[1]);
t[1] += static_cast<V>(a[0]);
t[2] += static_cast<V>(b[1]);
t[3] += static_cast<V>(b[0]);
t[0] *= x;
t[2] *= x;
return (t[0] + t[1]) / (t[2] + t[3]);
}
else
{
V z = 1 / x;
V z2 = 1 / (x * x);
V t[4];
t[0] = a[0] * z2 + a[2];
t[1] = a[1] * z2 + a[3];
t[2] = b[0] * z2 + b[2];
t[3] = b[1] * z2 + b[3];
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[5]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[5]);
t[0] *= z;
t[2] *= z;
return (t[0] + t[1]) / (t[2] + t[3]);
}
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const mpl::int_<7>*) BOOST_MATH_NOEXCEPT(V)
{
if(x <= 1)
{
V x2 = x * x;
V t[4];
t[0] = a[6] * x2 + a[4];
t[1] = a[5] * x2 + a[3];
t[2] = b[6] * x2 + b[4];
t[3] = b[5] * x2 + b[3];
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[2]);
t[1] += static_cast<V>(a[1]);
t[2] += static_cast<V>(b[2]);
t[3] += static_cast<V>(b[1]);
t[0] *= x2;
t[2] *= x2;
t[0] += static_cast<V>(a[0]);
t[2] += static_cast<V>(b[0]);
t[1] *= x;
t[3] *= x;
return (t[0] + t[1]) / (t[2] + t[3]);
}
else
{
V z = 1 / x;
V z2 = 1 / (x * x);
V t[4];
t[0] = a[0] * z2 + a[2];
t[1] = a[1] * z2 + a[3];
t[2] = b[0] * z2 + b[2];
t[3] = b[1] * z2 + b[3];
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[5]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[5]);
t[0] *= z2;
t[2] *= z2;
t[0] += static_cast<V>(a[6]);
t[2] += static_cast<V>(b[6]);
t[1] *= z;
t[3] *= z;
return (t[0] + t[1]) / (t[2] + t[3]);
}
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const mpl::int_<8>*) BOOST_MATH_NOEXCEPT(V)
{
if(x <= 1)
{
V x2 = x * x;
V t[4];
t[0] = a[7] * x2 + a[5];
t[1] = a[6] * x2 + a[4];
t[2] = b[7] * x2 + b[5];
t[3] = b[6] * x2 + b[4];
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[3]);
t[1] += static_cast<V>(a[2]);
t[2] += static_cast<V>(b[3]);
t[3] += static_cast<V>(b[2]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[1]);
t[1] += static_cast<V>(a[0]);
t[2] += static_cast<V>(b[1]);
t[3] += static_cast<V>(b[0]);
t[0] *= x;
t[2] *= x;
return (t[0] + t[1]) / (t[2] + t[3]);
}
else
{
V z = 1 / x;
V z2 = 1 / (x * x);
V t[4];
t[0] = a[0] * z2 + a[2];
t[1] = a[1] * z2 + a[3];
t[2] = b[0] * z2 + b[2];
t[3] = b[1] * z2 + b[3];
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[5]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[5]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[6]);
t[1] += static_cast<V>(a[7]);
t[2] += static_cast<V>(b[6]);
t[3] += static_cast<V>(b[7]);
t[0] *= z;
t[2] *= z;
return (t[0] + t[1]) / (t[2] + t[3]);
}
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const mpl::int_<9>*) BOOST_MATH_NOEXCEPT(V)
{
if(x <= 1)
{
V x2 = x * x;
V t[4];
t[0] = a[8] * x2 + a[6];
t[1] = a[7] * x2 + a[5];
t[2] = b[8] * x2 + b[6];
t[3] = b[7] * x2 + b[5];
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[3]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[3]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[2]);
t[1] += static_cast<V>(a[1]);
t[2] += static_cast<V>(b[2]);
t[3] += static_cast<V>(b[1]);
t[0] *= x2;
t[2] *= x2;
t[0] += static_cast<V>(a[0]);
t[2] += static_cast<V>(b[0]);
t[1] *= x;
t[3] *= x;
return (t[0] + t[1]) / (t[2] + t[3]);
}
else
{
V z = 1 / x;
V z2 = 1 / (x * x);
V t[4];
t[0] = a[0] * z2 + a[2];
t[1] = a[1] * z2 + a[3];
t[2] = b[0] * z2 + b[2];
t[3] = b[1] * z2 + b[3];
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[5]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[5]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[6]);
t[1] += static_cast<V>(a[7]);
t[2] += static_cast<V>(b[6]);
t[3] += static_cast<V>(b[7]);
t[0] *= z2;
t[2] *= z2;
t[0] += static_cast<V>(a[8]);
t[2] += static_cast<V>(b[8]);
t[1] *= z;
t[3] *= z;
return (t[0] + t[1]) / (t[2] + t[3]);
}
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const mpl::int_<10>*) BOOST_MATH_NOEXCEPT(V)
{
if(x <= 1)
{
V x2 = x * x;
V t[4];
t[0] = a[9] * x2 + a[7];
t[1] = a[8] * x2 + a[6];
t[2] = b[9] * x2 + b[7];
t[3] = b[8] * x2 + b[6];
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[5]);
t[1] += static_cast<V>(a[4]);
t[2] += static_cast<V>(b[5]);
t[3] += static_cast<V>(b[4]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[3]);
t[1] += static_cast<V>(a[2]);
t[2] += static_cast<V>(b[3]);
t[3] += static_cast<V>(b[2]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[1]);
t[1] += static_cast<V>(a[0]);
t[2] += static_cast<V>(b[1]);
t[3] += static_cast<V>(b[0]);
t[0] *= x;
t[2] *= x;
return (t[0] + t[1]) / (t[2] + t[3]);
}
else
{
V z = 1 / x;
V z2 = 1 / (x * x);
V t[4];
t[0] = a[0] * z2 + a[2];
t[1] = a[1] * z2 + a[3];
t[2] = b[0] * z2 + b[2];
t[3] = b[1] * z2 + b[3];
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[5]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[5]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[6]);
t[1] += static_cast<V>(a[7]);
t[2] += static_cast<V>(b[6]);
t[3] += static_cast<V>(b[7]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[8]);
t[1] += static_cast<V>(a[9]);
t[2] += static_cast<V>(b[8]);
t[3] += static_cast<V>(b[9]);
t[0] *= z;
t[2] *= z;
return (t[0] + t[1]) / (t[2] + t[3]);
}
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const mpl::int_<11>*) BOOST_MATH_NOEXCEPT(V)
{
if(x <= 1)
{
V x2 = x * x;
V t[4];
t[0] = a[10] * x2 + a[8];
t[1] = a[9] * x2 + a[7];
t[2] = b[10] * x2 + b[8];
t[3] = b[9] * x2 + b[7];
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[6]);
t[1] += static_cast<V>(a[5]);
t[2] += static_cast<V>(b[6]);
t[3] += static_cast<V>(b[5]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[3]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[3]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[2]);
t[1] += static_cast<V>(a[1]);
t[2] += static_cast<V>(b[2]);
t[3] += static_cast<V>(b[1]);
t[0] *= x2;
t[2] *= x2;
t[0] += static_cast<V>(a[0]);
t[2] += static_cast<V>(b[0]);
t[1] *= x;
t[3] *= x;
return (t[0] + t[1]) / (t[2] + t[3]);
}
else
{
V z = 1 / x;
V z2 = 1 / (x * x);
V t[4];
t[0] = a[0] * z2 + a[2];
t[1] = a[1] * z2 + a[3];
t[2] = b[0] * z2 + b[2];
t[3] = b[1] * z2 + b[3];
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[5]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[5]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[6]);
t[1] += static_cast<V>(a[7]);
t[2] += static_cast<V>(b[6]);
t[3] += static_cast<V>(b[7]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[8]);
t[1] += static_cast<V>(a[9]);
t[2] += static_cast<V>(b[8]);
t[3] += static_cast<V>(b[9]);
t[0] *= z2;
t[2] *= z2;
t[0] += static_cast<V>(a[10]);
t[2] += static_cast<V>(b[10]);
t[1] *= z;
t[3] *= z;
return (t[0] + t[1]) / (t[2] + t[3]);
}
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const mpl::int_<12>*) BOOST_MATH_NOEXCEPT(V)
{
if(x <= 1)
{
V x2 = x * x;
V t[4];
t[0] = a[11] * x2 + a[9];
t[1] = a[10] * x2 + a[8];
t[2] = b[11] * x2 + b[9];
t[3] = b[10] * x2 + b[8];
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[7]);
t[1] += static_cast<V>(a[6]);
t[2] += static_cast<V>(b[7]);
t[3] += static_cast<V>(b[6]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[5]);
t[1] += static_cast<V>(a[4]);
t[2] += static_cast<V>(b[5]);
t[3] += static_cast<V>(b[4]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[3]);
t[1] += static_cast<V>(a[2]);
t[2] += static_cast<V>(b[3]);
t[3] += static_cast<V>(b[2]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[1]);
t[1] += static_cast<V>(a[0]);
t[2] += static_cast<V>(b[1]);
t[3] += static_cast<V>(b[0]);
t[0] *= x;
t[2] *= x;
return (t[0] + t[1]) / (t[2] + t[3]);
}
else
{
V z = 1 / x;
V z2 = 1 / (x * x);
V t[4];
t[0] = a[0] * z2 + a[2];
t[1] = a[1] * z2 + a[3];
t[2] = b[0] * z2 + b[2];
t[3] = b[1] * z2 + b[3];
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[5]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[5]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[6]);
t[1] += static_cast<V>(a[7]);
t[2] += static_cast<V>(b[6]);
t[3] += static_cast<V>(b[7]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[8]);
t[1] += static_cast<V>(a[9]);
t[2] += static_cast<V>(b[8]);
t[3] += static_cast<V>(b[9]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[10]);
t[1] += static_cast<V>(a[11]);
t[2] += static_cast<V>(b[10]);
t[3] += static_cast<V>(b[11]);
t[0] *= z;
t[2] *= z;
return (t[0] + t[1]) / (t[2] + t[3]);
}
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const mpl::int_<13>*) BOOST_MATH_NOEXCEPT(V)
{
if(x <= 1)
{
V x2 = x * x;
V t[4];
t[0] = a[12] * x2 + a[10];
t[1] = a[11] * x2 + a[9];
t[2] = b[12] * x2 + b[10];
t[3] = b[11] * x2 + b[9];
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[8]);
t[1] += static_cast<V>(a[7]);
t[2] += static_cast<V>(b[8]);
t[3] += static_cast<V>(b[7]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[6]);
t[1] += static_cast<V>(a[5]);
t[2] += static_cast<V>(b[6]);
t[3] += static_cast<V>(b[5]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[3]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[3]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[2]);
t[1] += static_cast<V>(a[1]);
t[2] += static_cast<V>(b[2]);
t[3] += static_cast<V>(b[1]);
t[0] *= x2;
t[2] *= x2;
t[0] += static_cast<V>(a[0]);
t[2] += static_cast<V>(b[0]);
t[1] *= x;
t[3] *= x;
return (t[0] + t[1]) / (t[2] + t[3]);
}
else
{
V z = 1 / x;
V z2 = 1 / (x * x);
V t[4];
t[0] = a[0] * z2 + a[2];
t[1] = a[1] * z2 + a[3];
t[2] = b[0] * z2 + b[2];
t[3] = b[1] * z2 + b[3];
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[5]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[5]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[6]);
t[1] += static_cast<V>(a[7]);
t[2] += static_cast<V>(b[6]);
t[3] += static_cast<V>(b[7]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[8]);
t[1] += static_cast<V>(a[9]);
t[2] += static_cast<V>(b[8]);
t[3] += static_cast<V>(b[9]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[10]);
t[1] += static_cast<V>(a[11]);
t[2] += static_cast<V>(b[10]);
t[3] += static_cast<V>(b[11]);
t[0] *= z2;
t[2] *= z2;
t[0] += static_cast<V>(a[12]);
t[2] += static_cast<V>(b[12]);
t[1] *= z;
t[3] *= z;
return (t[0] + t[1]) / (t[2] + t[3]);
}
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const mpl::int_<14>*) BOOST_MATH_NOEXCEPT(V)
{
if(x <= 1)
{
V x2 = x * x;
V t[4];
t[0] = a[13] * x2 + a[11];
t[1] = a[12] * x2 + a[10];
t[2] = b[13] * x2 + b[11];
t[3] = b[12] * x2 + b[10];
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[9]);
t[1] += static_cast<V>(a[8]);
t[2] += static_cast<V>(b[9]);
t[3] += static_cast<V>(b[8]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[7]);
t[1] += static_cast<V>(a[6]);
t[2] += static_cast<V>(b[7]);
t[3] += static_cast<V>(b[6]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[5]);
t[1] += static_cast<V>(a[4]);
t[2] += static_cast<V>(b[5]);
t[3] += static_cast<V>(b[4]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[3]);
t[1] += static_cast<V>(a[2]);
t[2] += static_cast<V>(b[3]);
t[3] += static_cast<V>(b[2]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[1]);
t[1] += static_cast<V>(a[0]);
t[2] += static_cast<V>(b[1]);
t[3] += static_cast<V>(b[0]);
t[0] *= x;
t[2] *= x;
return (t[0] + t[1]) / (t[2] + t[3]);
}
else
{
V z = 1 / x;
V z2 = 1 / (x * x);
V t[4];
t[0] = a[0] * z2 + a[2];
t[1] = a[1] * z2 + a[3];
t[2] = b[0] * z2 + b[2];
t[3] = b[1] * z2 + b[3];
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[5]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[5]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[6]);
t[1] += static_cast<V>(a[7]);
t[2] += static_cast<V>(b[6]);
t[3] += static_cast<V>(b[7]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[8]);
t[1] += static_cast<V>(a[9]);
t[2] += static_cast<V>(b[8]);
t[3] += static_cast<V>(b[9]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[10]);
t[1] += static_cast<V>(a[11]);
t[2] += static_cast<V>(b[10]);
t[3] += static_cast<V>(b[11]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[12]);
t[1] += static_cast<V>(a[13]);
t[2] += static_cast<V>(b[12]);
t[3] += static_cast<V>(b[13]);
t[0] *= z;
t[2] *= z;
return (t[0] + t[1]) / (t[2] + t[3]);
}
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const mpl::int_<15>*) BOOST_MATH_NOEXCEPT(V)
{
if(x <= 1)
{
V x2 = x * x;
V t[4];
t[0] = a[14] * x2 + a[12];
t[1] = a[13] * x2 + a[11];
t[2] = b[14] * x2 + b[12];
t[3] = b[13] * x2 + b[11];
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[10]);
t[1] += static_cast<V>(a[9]);
t[2] += static_cast<V>(b[10]);
t[3] += static_cast<V>(b[9]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[8]);
t[1] += static_cast<V>(a[7]);
t[2] += static_cast<V>(b[8]);
t[3] += static_cast<V>(b[7]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[6]);
t[1] += static_cast<V>(a[5]);
t[2] += static_cast<V>(b[6]);
t[3] += static_cast<V>(b[5]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[3]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[3]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[2]);
t[1] += static_cast<V>(a[1]);
t[2] += static_cast<V>(b[2]);
t[3] += static_cast<V>(b[1]);
t[0] *= x2;
t[2] *= x2;
t[0] += static_cast<V>(a[0]);
t[2] += static_cast<V>(b[0]);
t[1] *= x;
t[3] *= x;
return (t[0] + t[1]) / (t[2] + t[3]);
}
else
{
V z = 1 / x;
V z2 = 1 / (x * x);
V t[4];
t[0] = a[0] * z2 + a[2];
t[1] = a[1] * z2 + a[3];
t[2] = b[0] * z2 + b[2];
t[3] = b[1] * z2 + b[3];
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[5]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[5]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[6]);
t[1] += static_cast<V>(a[7]);
t[2] += static_cast<V>(b[6]);
t[3] += static_cast<V>(b[7]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[8]);
t[1] += static_cast<V>(a[9]);
t[2] += static_cast<V>(b[8]);
t[3] += static_cast<V>(b[9]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[10]);
t[1] += static_cast<V>(a[11]);
t[2] += static_cast<V>(b[10]);
t[3] += static_cast<V>(b[11]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[12]);
t[1] += static_cast<V>(a[13]);
t[2] += static_cast<V>(b[12]);
t[3] += static_cast<V>(b[13]);
t[0] *= z2;
t[2] *= z2;
t[0] += static_cast<V>(a[14]);
t[2] += static_cast<V>(b[14]);
t[1] *= z;
t[3] *= z;
return (t[0] + t[1]) / (t[2] + t[3]);
}
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const mpl::int_<16>*) BOOST_MATH_NOEXCEPT(V)
{
if(x <= 1)
{
V x2 = x * x;
V t[4];
t[0] = a[15] * x2 + a[13];
t[1] = a[14] * x2 + a[12];
t[2] = b[15] * x2 + b[13];
t[3] = b[14] * x2 + b[12];
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[11]);
t[1] += static_cast<V>(a[10]);
t[2] += static_cast<V>(b[11]);
t[3] += static_cast<V>(b[10]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[9]);
t[1] += static_cast<V>(a[8]);
t[2] += static_cast<V>(b[9]);
t[3] += static_cast<V>(b[8]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[7]);
t[1] += static_cast<V>(a[6]);
t[2] += static_cast<V>(b[7]);
t[3] += static_cast<V>(b[6]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[5]);
t[1] += static_cast<V>(a[4]);
t[2] += static_cast<V>(b[5]);
t[3] += static_cast<V>(b[4]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[3]);
t[1] += static_cast<V>(a[2]);
t[2] += static_cast<V>(b[3]);
t[3] += static_cast<V>(b[2]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[1]);
t[1] += static_cast<V>(a[0]);
t[2] += static_cast<V>(b[1]);
t[3] += static_cast<V>(b[0]);
t[0] *= x;
t[2] *= x;
return (t[0] + t[1]) / (t[2] + t[3]);
}
else
{
V z = 1 / x;
V z2 = 1 / (x * x);
V t[4];
t[0] = a[0] * z2 + a[2];
t[1] = a[1] * z2 + a[3];
t[2] = b[0] * z2 + b[2];
t[3] = b[1] * z2 + b[3];
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[5]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[5]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[6]);
t[1] += static_cast<V>(a[7]);
t[2] += static_cast<V>(b[6]);
t[3] += static_cast<V>(b[7]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[8]);
t[1] += static_cast<V>(a[9]);
t[2] += static_cast<V>(b[8]);
t[3] += static_cast<V>(b[9]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[10]);
t[1] += static_cast<V>(a[11]);
t[2] += static_cast<V>(b[10]);
t[3] += static_cast<V>(b[11]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[12]);
t[1] += static_cast<V>(a[13]);
t[2] += static_cast<V>(b[12]);
t[3] += static_cast<V>(b[13]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[14]);
t[1] += static_cast<V>(a[15]);
t[2] += static_cast<V>(b[14]);
t[3] += static_cast<V>(b[15]);
t[0] *= z;
t[2] *= z;
return (t[0] + t[1]) / (t[2] + t[3]);
}
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const mpl::int_<17>*) BOOST_MATH_NOEXCEPT(V)
{
if(x <= 1)
{
V x2 = x * x;
V t[4];
t[0] = a[16] * x2 + a[14];
t[1] = a[15] * x2 + a[13];
t[2] = b[16] * x2 + b[14];
t[3] = b[15] * x2 + b[13];
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[12]);
t[1] += static_cast<V>(a[11]);
t[2] += static_cast<V>(b[12]);
t[3] += static_cast<V>(b[11]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[10]);
t[1] += static_cast<V>(a[9]);
t[2] += static_cast<V>(b[10]);
t[3] += static_cast<V>(b[9]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[8]);
t[1] += static_cast<V>(a[7]);
t[2] += static_cast<V>(b[8]);
t[3] += static_cast<V>(b[7]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[6]);
t[1] += static_cast<V>(a[5]);
t[2] += static_cast<V>(b[6]);
t[3] += static_cast<V>(b[5]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[3]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[3]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[2]);
t[1] += static_cast<V>(a[1]);
t[2] += static_cast<V>(b[2]);
t[3] += static_cast<V>(b[1]);
t[0] *= x2;
t[2] *= x2;
t[0] += static_cast<V>(a[0]);
t[2] += static_cast<V>(b[0]);
t[1] *= x;
t[3] *= x;
return (t[0] + t[1]) / (t[2] + t[3]);
}
else
{
V z = 1 / x;
V z2 = 1 / (x * x);
V t[4];
t[0] = a[0] * z2 + a[2];
t[1] = a[1] * z2 + a[3];
t[2] = b[0] * z2 + b[2];
t[3] = b[1] * z2 + b[3];
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[5]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[5]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[6]);
t[1] += static_cast<V>(a[7]);
t[2] += static_cast<V>(b[6]);
t[3] += static_cast<V>(b[7]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[8]);
t[1] += static_cast<V>(a[9]);
t[2] += static_cast<V>(b[8]);
t[3] += static_cast<V>(b[9]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[10]);
t[1] += static_cast<V>(a[11]);
t[2] += static_cast<V>(b[10]);
t[3] += static_cast<V>(b[11]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[12]);
t[1] += static_cast<V>(a[13]);
t[2] += static_cast<V>(b[12]);
t[3] += static_cast<V>(b[13]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[14]);
t[1] += static_cast<V>(a[15]);
t[2] += static_cast<V>(b[14]);
t[3] += static_cast<V>(b[15]);
t[0] *= z2;
t[2] *= z2;
t[0] += static_cast<V>(a[16]);
t[2] += static_cast<V>(b[16]);
t[1] *= z;
t[3] *= z;
return (t[0] + t[1]) / (t[2] + t[3]);
}
}
template <class T, class U, class V>
inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const mpl::int_<18>*) BOOST_MATH_NOEXCEPT(V)
{
if(x <= 1)
{
V x2 = x * x;
V t[4];
t[0] = a[17] * x2 + a[15];
t[1] = a[16] * x2 + a[14];
t[2] = b[17] * x2 + b[15];
t[3] = b[16] * x2 + b[14];
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[13]);
t[1] += static_cast<V>(a[12]);
t[2] += static_cast<V>(b[13]);
t[3] += static_cast<V>(b[12]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[11]);
t[1] += static_cast<V>(a[10]);
t[2] += static_cast<V>(b[11]);
t[3] += static_cast<V>(b[10]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[9]);
t[1] += static_cast<V>(a[8]);
t[2] += static_cast<V>(b[9]);
t[3] += static_cast<V>(b[8]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[7]);
t[1] += static_cast<V>(a[6]);
t[2] += static_cast<V>(b[7]);
t[3] += static_cast<V>(b[6]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[5]);
t[1] += static_cast<V>(a[4]);
t[2] += static_cast<V>(b[5]);
t[3] += static_cast<V>(b[4]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[3]);
t[1] += static_cast<V>(a[2]);
t[2] += static_cast<V>(b[3]);
t[3] += static_cast<V>(b[2]);
t[0] *= x2;
t[1] *= x2;
t[2] *= x2;
t[3] *= x2;
t[0] += static_cast<V>(a[1]);
t[1] += static_cast<V>(a[0]);
t[2] += static_cast<V>(b[1]);
t[3] += static_cast<V>(b[0]);
t[0] *= x;
t[2] *= x;
return (t[0] + t[1]) / (t[2] + t[3]);
}
else
{
V z = 1 / x;
V z2 = 1 / (x * x);
V t[4];
t[0] = a[0] * z2 + a[2];
t[1] = a[1] * z2 + a[3];
t[2] = b[0] * z2 + b[2];
t[3] = b[1] * z2 + b[3];
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[4]);
t[1] += static_cast<V>(a[5]);
t[2] += static_cast<V>(b[4]);
t[3] += static_cast<V>(b[5]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[6]);
t[1] += static_cast<V>(a[7]);
t[2] += static_cast<V>(b[6]);
t[3] += static_cast<V>(b[7]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[8]);
t[1] += static_cast<V>(a[9]);
t[2] += static_cast<V>(b[8]);
t[3] += static_cast<V>(b[9]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[10]);
t[1] += static_cast<V>(a[11]);
t[2] += static_cast<V>(b[10]);
t[3] += static_cast<V>(b[11]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[12]);
t[1] += static_cast<V>(a[13]);
t[2] += static_cast<V>(b[12]);
t[3] += static_cast<V>(b[13]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[14]);
t[1] += static_cast<V>(a[15]);
t[2] += static_cast<V>(b[14]);
t[3] += static_cast<V>(b[15]);
t[0] *= z2;
t[1] *= z2;
t[2] *= z2;
t[3] *= z2;
t[0] += static_cast<V>(a[16]);
t[1] += static_cast<V>(a[17]);
t[2] += static_cast<V>(b[16]);
t[3] += static_cast<V>(b[17]);
t[0] *= z;
t[2] *= z;
return (t[0] + t[1]) / (t[2] + t[3]);
}
}
}}}} // namespaces
#endif // include guard
```
|
```forth
*> \brief \b ZPOT01
*
* =========== DOCUMENTATION ===========
*
* Online html documentation available at
* path_to_url
*
* Definition:
* ===========
*
* SUBROUTINE ZPOT01( UPLO, N, A, LDA, AFAC, LDAFAC, RWORK, RESID )
*
* .. Scalar Arguments ..
* CHARACTER UPLO
* INTEGER LDA, LDAFAC, N
* DOUBLE PRECISION RESID
* ..
* .. Array Arguments ..
* DOUBLE PRECISION RWORK( * )
* COMPLEX*16 A( LDA, * ), AFAC( LDAFAC, * )
* ..
*
*
*> \par Purpose:
* =============
*>
*> \verbatim
*>
*> ZPOT01 reconstructs a Hermitian positive definite matrix A from
*> its L*L' or U'*U factorization and computes the residual
*> norm( L*L' - A ) / ( N * norm(A) * EPS ) or
*> norm( U'*U - A ) / ( N * norm(A) * EPS ),
*> where EPS is the machine epsilon, L' is the conjugate transpose of L,
*> and U' is the conjugate transpose of U.
*> \endverbatim
*
* Arguments:
* ==========
*
*> \param[in] UPLO
*> \verbatim
*> UPLO is CHARACTER*1
*> Specifies whether the upper or lower triangular part of the
*> Hermitian matrix A is stored:
*> = 'U': Upper triangular
*> = 'L': Lower triangular
*> \endverbatim
*>
*> \param[in] N
*> \verbatim
*> N is INTEGER
*> The number of rows and columns of the matrix A. N >= 0.
*> \endverbatim
*>
*> \param[in] A
*> \verbatim
*> A is COMPLEX*16 array, dimension (LDA,N)
*> The original Hermitian matrix A.
*> \endverbatim
*>
*> \param[in] LDA
*> \verbatim
*> LDA is INTEGER
*> The leading dimension of the array A. LDA >= max(1,N)
*> \endverbatim
*>
*> \param[in,out] AFAC
*> \verbatim
*> AFAC is COMPLEX*16 array, dimension (LDAFAC,N)
*> On entry, the factor L or U from the L * L**H or U**H * U
*> factorization of A.
*> Overwritten with the reconstructed matrix, and then with
*> the difference L * L**H - A (or U**H * U - A).
*> \endverbatim
*>
*> \param[in] LDAFAC
*> \verbatim
*> LDAFAC is INTEGER
*> The leading dimension of the array AFAC. LDAFAC >= max(1,N).
*> \endverbatim
*>
*> \param[out] RWORK
*> \verbatim
*> RWORK is DOUBLE PRECISION array, dimension (N)
*> \endverbatim
*>
*> \param[out] RESID
*> \verbatim
*> RESID is DOUBLE PRECISION
*> If UPLO = 'L', norm(L * L**H - A) / ( N * norm(A) * EPS )
*> If UPLO = 'U', norm(U**H * U - A) / ( N * norm(A) * EPS )
*> \endverbatim
*
* Authors:
* ========
*
*> \author Univ. of Tennessee
*> \author Univ. of California Berkeley
*> \author Univ. of Colorado Denver
*> \author NAG Ltd.
*
*> \ingroup complex16_lin
*
* =====================================================================
SUBROUTINE ZPOT01( UPLO, N, A, LDA, AFAC, LDAFAC, RWORK, RESID )
*
* -- LAPACK test routine --
* -- LAPACK is a software package provided by Univ. of Tennessee, --
* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
*
* .. Scalar Arguments ..
CHARACTER UPLO
INTEGER LDA, LDAFAC, N
DOUBLE PRECISION RESID
* ..
* .. Array Arguments ..
DOUBLE PRECISION RWORK( * )
COMPLEX*16 A( LDA, * ), AFAC( LDAFAC, * )
* ..
*
* =====================================================================
*
* .. Parameters ..
DOUBLE PRECISION ZERO, ONE
PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 )
* ..
* .. Local Scalars ..
INTEGER I, J, K
DOUBLE PRECISION ANORM, EPS, TR
COMPLEX*16 TC
* ..
* .. External Functions ..
LOGICAL LSAME
DOUBLE PRECISION DLAMCH, ZLANHE
COMPLEX*16 ZDOTC
EXTERNAL LSAME, DLAMCH, ZLANHE, ZDOTC
* ..
* .. External Subroutines ..
EXTERNAL ZHER, ZSCAL, ZTRMV
* ..
* .. Intrinsic Functions ..
INTRINSIC DBLE, DIMAG
* ..
* .. Executable Statements ..
*
* Quick exit if N = 0.
*
IF( N.LE.0 ) THEN
RESID = ZERO
RETURN
END IF
*
* Exit with RESID = 1/EPS if ANORM = 0.
*
EPS = DLAMCH( 'Epsilon' )
ANORM = ZLANHE( '1', UPLO, N, A, LDA, RWORK )
IF( ANORM.LE.ZERO ) THEN
RESID = ONE / EPS
RETURN
END IF
*
* Check the imaginary parts of the diagonal elements and return with
* an error code if any are nonzero.
*
DO 10 J = 1, N
IF( DIMAG( AFAC( J, J ) ).NE.ZERO ) THEN
RESID = ONE / EPS
RETURN
END IF
10 CONTINUE
*
* Compute the product U**H * U, overwriting U.
*
IF( LSAME( UPLO, 'U' ) ) THEN
DO 20 K = N, 1, -1
*
* Compute the (K,K) element of the result.
*
TR = DBLE( ZDOTC( K, AFAC( 1, K ), 1, AFAC( 1, K ), 1 ) )
AFAC( K, K ) = TR
*
* Compute the rest of column K.
*
CALL ZTRMV( 'Upper', 'Conjugate', 'Non-unit', K-1, AFAC,
$ LDAFAC, AFAC( 1, K ), 1 )
*
20 CONTINUE
*
* Compute the product L * L**H, overwriting L.
*
ELSE
DO 30 K = N, 1, -1
*
* Add a multiple of column K of the factor L to each of
* columns K+1 through N.
*
IF( K+1.LE.N )
$ CALL ZHER( 'Lower', N-K, ONE, AFAC( K+1, K ), 1,
$ AFAC( K+1, K+1 ), LDAFAC )
*
* Scale column K by the diagonal element.
*
TC = AFAC( K, K )
CALL ZSCAL( N-K+1, TC, AFAC( K, K ), 1 )
*
30 CONTINUE
END IF
*
* Compute the difference L * L**H - A (or U**H * U - A).
*
IF( LSAME( UPLO, 'U' ) ) THEN
DO 50 J = 1, N
DO 40 I = 1, J - 1
AFAC( I, J ) = AFAC( I, J ) - A( I, J )
40 CONTINUE
AFAC( J, J ) = AFAC( J, J ) - DBLE( A( J, J ) )
50 CONTINUE
ELSE
DO 70 J = 1, N
AFAC( J, J ) = AFAC( J, J ) - DBLE( A( J, J ) )
DO 60 I = J + 1, N
AFAC( I, J ) = AFAC( I, J ) - A( I, J )
60 CONTINUE
70 CONTINUE
END IF
*
* Compute norm(L*U - A) / ( N * norm(A) * EPS )
*
RESID = ZLANHE( '1', UPLO, N, AFAC, LDAFAC, RWORK )
*
RESID = ( ( RESID / DBLE( N ) ) / ANORM ) / EPS
*
RETURN
*
* End of ZPOT01
*
END
```
|
```go
package api
import (
"testing"
)
func TestTaintString(t *testing.T) {
taint := Taint{
Key: "key",
Value: "val",
Effect: "NoSchedule",
}
expected := "key=val:NoSchedule"
actual := taint.String()
if actual != expected {
t.Errorf("Expected taint string to be '%s', but was '%s", expected, actual)
}
}
func TestTaintValidate(t *testing.T) {
testCases := []struct {
key string
effect string
isValid bool
}{
// Empty key
{
key: "",
effect: "",
isValid: false,
},
// Invalid effect
{
key: "dedicated",
effect: "UnknownEffect",
isValid: false,
},
// Valid taint
{
key: "dedicated",
effect: "NoSchedule",
isValid: true,
},
}
for _, testCase := range testCases {
taint := Taint{
Key: testCase.key,
Value: "",
Effect: testCase.effect,
}
err := taint.Validate()
if testCase.isValid && err != nil {
t.Errorf("Expected taint to be valid, but got error: %v", err)
}
if !testCase.isValid && err == nil {
t.Errorf("Expected taint to be invalid, but it was not")
}
}
}
func TestTaintsString(t *testing.T) {
taints := Taints([]Taint{
{
Key: "key-1",
Value: "val",
Effect: "NoSchedule",
},
{
Key: "key-2",
Value: "val",
Effect: "NoSchedule",
},
})
expected := "key-1=val:NoSchedule,key-2=val:NoSchedule"
actual := taints.String()
if actual != expected {
t.Errorf("Expected taints string to be '%s', but was '%s", expected, actual)
}
}
func TestTaintsValidate(t *testing.T) {
testCases := []struct {
taints Taints
isValid bool
}{
// Unspecified key
{
taints: Taints{
{
Key: "",
Effect: "NoSchedule",
},
},
isValid: false,
},
// Duplicate key/effect pair
{
taints: Taints{
{
Key: "dedicated",
Effect: "NoSchedule",
},
{
Key: "dedicated",
Effect: "NoSchedule",
},
},
isValid: false,
},
// Valid
{
taints: Taints{
{
Key: "dedicated",
Effect: "NoSchedule",
},
{
Key: "dedicated",
Effect: "NoExecute",
},
},
isValid: true,
},
}
for _, testCase := range testCases {
err := testCase.taints.Validate()
if testCase.isValid && err != nil {
t.Errorf("Expected taint to be valid, but got error: %v", err)
}
if !testCase.isValid && err == nil {
t.Errorf("Expected taint to be invalid, but it was not")
}
}
}
```
|
The 2017 All Japan High School Soccer Tournament (All Japan JFA 96th High School Soccer Tournament (Japanese: 第96回全国高等学校サッカー選手権大会) marked the 96th edition of the referred annually contested cup for High Schools over Japan.
Calendar
Source:
Venues
The tournament was played in four prefectures and nine stadiums, with six (two for each prefecture) located in Chiba, Kanagawa, and Tokyo Prefectures, and three located in Saitama. They are:
Tokyo – Ajinomoto Field Nishigaoka, and Komazawa Olympic Park Stadium
Saitama – Saitama Stadium 2002, Urawa Komaba Stadium and NACK5 Stadium Omiya
Kanagawa – NHK Spring Mitsuzawa Football Stadium and Kawasaki Todoroki Stadium
Chiba – Fukuda Denshi Arena and ZA Oripri Stadium
Participating clubs
In parentheses: the amount of times each team qualified for the All Japan High School Tournament (appearance in the 2017 edition included)
Schedule
First round
Second round
Round of 16
Quarter-finals
Semi-finals
Final
References
2017 in Japanese football
All Japan High School Soccer Tournament
|
Artesian may refer to:
Someone from the County of Artois
Artesian aquifer, a source of water
Artesian Builds, a former computer building company
Artesian, South Dakota, United States
Great Artesian Basin, Australia
The Artesian Hotel, a casino and spa in Sulphur, Oklahoma
296819 Artesian, an asteroid
|
```objective-c
//
//
// path_to_url
//
// Unless required by applicable law or agreed to in writing, software
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
#pragma once
#include "paddle/common/errors.h"
#include "paddle/fluid/framework/framework.pb.h"
#include "paddle/fluid/imperative/layout_autotune.h"
#include "paddle/fluid/imperative/tracer.h"
#include "paddle/fluid/imperative/var_helper.h"
#include "paddle/phi/core/enforce.h"
#include "paddle/phi/core/tensor_utils.h"
namespace paddle {
namespace imperative {
template <typename VarType>
void SetOutDataLayout(std::shared_ptr<VarType> var,
const phi::DataLayout layout) {
if (var != nullptr && var->Var().IsInitialized()) {
paddle::imperative::SetDataLayout(var, layout);
// set out_tensor's layout
if (var->MutableVar()->IsInitialized()) {
paddle::framework::Variable* tmp_var = var->MutableVar();
auto* out = tmp_var->GetMutable<phi::DenseTensor>();
auto meta = phi::DenseTensorUtils::GetMutableMeta(
static_cast<phi::DenseTensor*>(out));
meta->layout = layout;
}
}
}
template <typename VarType>
std::shared_ptr<VarType> TraceTransposeOp(
const std::shared_ptr<VarType>& var,
const DataLayout layout,
const std::shared_ptr<paddle::imperative::Tracer>& tracer) {
std::vector<int> axis;
if (layout == DataLayout::NHWC) {
axis = {0, 2, 3, 1};
} else if (layout == DataLayout::NCHW) {
axis = {0, 3, 1, 2};
} else {
axis = {0, 1, 2, 3};
}
paddle::imperative::NameVarMap<VarType> ins = {{"X", {var}}};
auto out =
std::shared_ptr<VarType>(new VarType(tracer->GenerateUniqueName()));
auto x_shape =
std::shared_ptr<VarType>(new VarType(tracer->GenerateUniqueName()));
paddle::imperative::NameVarMap<VarType> outs = {{"Out", {out}},
{"XShape", {x_shape}}};
paddle::framework::AttributeMap attrs = {{"axis", axis}};
tracer->TraceOp("transpose2", ins, outs, std::move(attrs));
paddle::imperative::SetDataLayout(out, layout);
VLOG(4) << "Transpose " << paddle::imperative::GetNameFromVar(var) << "["
<< common::DataLayoutToString(paddle::imperative::GetDataLayout(var))
<< "]"
<< " to " << paddle::imperative::GetNameFromVar(out) << "["
<< common::DataLayoutToString(paddle::imperative::GetDataLayout(out))
<< "]";
return out;
}
template <typename VarType>
class LayoutTransformer {
public:
explicit LayoutTransformer(const std::string& type) : type_(type) {}
virtual ~LayoutTransformer() {}
LayoutTransformer(const LayoutTransformer&) = delete;
LayoutTransformer& operator=(const LayoutTransformer&) = delete;
virtual paddle::imperative::NameVarMap<VarType> Apply(
const paddle::imperative::NameVarMap<VarType>& ins,
const paddle::imperative::NameVarMap<VarType>& outs,
paddle::framework::AttributeMap* attrs,
const std::shared_ptr<paddle::imperative::Tracer>& tracer) {
VLOG(3) << "Optimize Layout agnostic op: " << type_;
auto in_layout = DataLayout::UNDEFINED;
for (auto& pair : ins) {
for (auto& var : pair.second) {
// Once the any input is desired layout, we set in_layout is desired
// layout.
if (in_layout == DataLayout::UNDEFINED) {
in_layout = paddle::imperative::GetDataLayout(var);
}
if (var != nullptr && (paddle::imperative::GetDataLayout(var) ==
LayoutAutoTune::Instance().GetDesiredLayout())) {
in_layout = LayoutAutoTune::Instance().GetDesiredLayout();
break;
}
}
}
VLOG(3) << "Optimize Layout agnostic op: " << type_ << " "
<< common::DataLayoutToString(in_layout);
if (in_layout != DataLayout::UNDEFINED) {
SetVarsLayout(outs, in_layout);
}
return ins;
}
// Set inputs, outputs and attributes to be optimized for the transposer.
// Those may respectively be a subset of the corresponding original argument
// of the operator.
void SetArguments(const std::vector<std::string>& ins,
const std::vector<std::string>& outs,
const std::vector<std::string>& attrs) {
ins_ = ins;
outs_ = outs;
attrs_ = attrs;
}
// Set the variables's layout to the specified layout.
// If outs_ is not specified, it means all outputs of the operator
// will be considered. Otherwise, it only set layout for the specified output.
void SetVarsLayout(const paddle::imperative::NameVarMap<VarType>& outs,
DataLayout layout) const {
bool not_in_out = true;
if (!outs_.empty()) {
for (auto& name : outs_) {
if (outs.find(name) != outs.end()) {
auto out_vars = outs.at(name);
for (auto& var : out_vars) {
if (var != nullptr) {
paddle::imperative::SetOutDataLayout(var, layout);
}
}
not_in_out = false;
}
}
}
if (not_in_out) {
for (auto& pair : outs) {
for (auto& var : pair.second) {
if (var != nullptr) {
paddle::imperative::SetOutDataLayout(var, layout);
}
}
}
}
}
const std::vector<std::string>& Inputs() const { return ins_; }
const std::vector<std::string>& Outputs() const { return outs_; }
const std::vector<std::string>& Attributes() const { return attrs_; }
const std::string& Type() { return type_; }
protected:
std::string type_{};
std::vector<std::string> ins_{};
std::vector<std::string> outs_{};
std::vector<std::string> attrs_{};
};
/*
* Both functionality and performance are affected by data layout.
* Such as operators with data_format attribute.
*/
template <typename VarType>
class HeavilyLayoutSensitiveOpTransformer : public LayoutTransformer<VarType> {
public:
explicit HeavilyLayoutSensitiveOpTransformer(const std::string& type)
: LayoutTransformer<VarType>(type) {}
paddle::imperative::NameVarMap<VarType> Apply(
const paddle::imperative::NameVarMap<VarType>& ins,
const paddle::imperative::NameVarMap<VarType>& outs,
paddle::framework::AttributeMap* attrs,
const std::shared_ptr<paddle::imperative::Tracer>& tracer) {
VLOG(3) << "Optimize heavily layout sensitive op " << this->Type();
paddle::imperative::NameVarMap<VarType> new_ins(ins);
// Step 1: Adjust the data_layout attr to the desired layout
auto desired_layout = LayoutAutoTune::Instance().GetDesiredLayout();
std::string desired_layout_str = common::DataLayoutToString(
LayoutAutoTune::Instance().GetDesiredLayout());
if (attrs->find("data_format") != attrs->end() &&
PADDLE_GET_CONST(std::string, (*attrs)["data_format"]) !=
desired_layout_str) {
VLOG(4) << "Origin layout attr: "
<< PADDLE_GET_CONST(std::string, (*attrs)["data_format"])
<< ", Desired layout attr: " << desired_layout_str;
(*attrs)["data_format"] = desired_layout_str;
} else if (attrs->find("data_layout") != attrs->end() &&
PADDLE_GET_CONST(std::string, (*attrs)["data_layout"]) !=
desired_layout_str) {
VLOG(4) << "Origin layout attr: "
<< PADDLE_GET_CONST(std::string, (*attrs)["data_layout"])
<< ", Desired layout attr: " << desired_layout_str;
(*attrs)["data_layout"] = desired_layout_str;
}
// Step 2: Transpose the specified input for Op and set the transposed var's
// layout.
for (auto& name : this->Inputs()) {
if (new_ins.find(name) != new_ins.end()) {
auto& in_vars = new_ins[name];
for (auto& var : in_vars) {
if (var != nullptr &&
paddle::imperative::GetDataLayout(var) != desired_layout) {
var = TraceTransposeOp(var, desired_layout, tracer);
}
}
}
}
// Step 3: Set the Op's layout sensitive outs var.
this->SetVarsLayout(outs, desired_layout);
return new_ins;
}
};
/*
* The functionality may be affected layout transformation before them.
* Such as operators with axis attribute.
*/
template <typename VarType>
class LightlyLayoutSensitiveOpTransformer : public LayoutTransformer<VarType> {
public:
explicit LightlyLayoutSensitiveOpTransformer(const std::string& type)
: LayoutTransformer<VarType>(type) {}
paddle::imperative::NameVarMap<VarType> Apply(
const paddle::imperative::NameVarMap<VarType>& ins,
const paddle::imperative::NameVarMap<VarType>& outs,
paddle::framework::AttributeMap* attrs,
const std::shared_ptr<paddle::imperative::Tracer>& tracer) {
VLOG(3) << "Optimize lightly layout sensitive op " << this->Type();
paddle::imperative::NameVarMap<VarType> new_ins(ins);
// If input's layout is not tuned, transformation is unnecessary.
// If input's layout is already tuned, it will be transformed back to NCHW.
// TODO(zhangting): The op of this type should be adapted to the previous
// operator output data layout. Currently only a few operators are
// supported, and transposers need to be carefully designed to ensure that
// they do not cause exceptions.
auto desired_layout = LayoutAutoTune::Instance().GetDesiredLayout();
for (auto& pair : new_ins) {
for (auto& var : pair.second) {
if (var != nullptr) {
VLOG(3) << "Tune the layout from "
<< common::DataLayoutToString(
paddle::imperative::GetDataLayout(var))
<< " to "
<< common::DataLayoutToString(
LayoutAutoTune::Instance().GetDesiredLayout());
}
if (var != nullptr &&
paddle::imperative::GetDataLayout(var) == desired_layout &&
desired_layout == DataLayout::NHWC) {
// Set layout to UNDEFINED so that TransposeOpTransformer do
// NHWC->NCHW transformation.
var = TraceTransposeOp(var, DataLayout::UNDEFINED, tracer);
}
}
}
return new_ins;
}
};
template <typename VarType>
class ElementwiseOpTransformer
: public LightlyLayoutSensitiveOpTransformer<VarType> {
public:
explicit ElementwiseOpTransformer(const std::string& type)
: LightlyLayoutSensitiveOpTransformer<VarType>(type) {}
paddle::imperative::NameVarMap<VarType> Apply(
const paddle::imperative::NameVarMap<VarType>& ins,
const paddle::imperative::NameVarMap<VarType>& outs,
paddle::framework::AttributeMap* attrs,
const std::shared_ptr<paddle::imperative::Tracer>& tracer) {
// [Why we need the this?]
// The Elementwise Ops has a axis attr, it is to support broadcast.
// When bias_attr of Conv is not false, the elementwise_add will be
// appended, and the axis will be set to the channel dimension.
// If the axis is set to the channel dimension, the attr transformation
// is necessary. Otherwise, it will fall back to the
// LayoutTransformer::Apply.
auto& in1_vars = ins.at("X")[0];
auto& in2_vars = ins.at("Y")[0];
auto in_layout = paddle::imperative::GetDataLayout(in1_vars);
// for conv's bias
if (attrs->find("axis") != attrs->end() &&
PADDLE_GET_CONST(int, (*attrs)["axis"]) != -1) {
if (in_layout == DataLayout::NHWC) {
(*attrs)["axis"] = 3;
} else if (in_layout == DataLayout::NCHW) {
(*attrs)["axis"] = 1;
}
this->SetVarsLayout(outs, in_layout);
return ins;
} else {
auto in2_layout = paddle::imperative::GetDataLayout(in2_vars);
if (in_layout == in2_layout) {
this->SetVarsLayout(outs, in_layout);
return ins;
}
return LightlyLayoutSensitiveOpTransformer<VarType>::Apply(
ins, outs, attrs, tracer);
}
}
};
template <typename VarType>
class TransposeOpTransformer
: public LightlyLayoutSensitiveOpTransformer<VarType> {
public:
explicit TransposeOpTransformer(const std::string& type)
: LightlyLayoutSensitiveOpTransformer<VarType>(type) {}
paddle::imperative::NameVarMap<VarType> Apply(
const paddle::imperative::NameVarMap<VarType>& ins,
const paddle::imperative::NameVarMap<VarType>& outs,
paddle::framework::AttributeMap* attrs,
const std::shared_ptr<paddle::imperative::Tracer>& tracer) {
VLOG(3) << "Optimize lightly layout sensitive op " << this->Type();
// When the input layout is the desired format, it means that there
// is a transpose layer in the network, it is better to transpose
// the result to the original format.
// Instead of actually inserting a transpose Op, we fuse the inserted
// transpose Op with the current transpose Op by transforming 'axis' attr.
auto& in_var = ins.at("X")[0];
auto var_layout = paddle::imperative::GetDataLayout(in_var);
auto desired_layout = LayoutAutoTune::Instance().GetDesiredLayout();
if (var_layout == desired_layout && desired_layout == DataLayout::NHWC) {
auto axis = PADDLE_GET_CONST(std::vector<int>, (*attrs)["axis"]);
// NHWC->NCHW, permutation will be set as follows.
std::vector<int> perm = {0, 3, 1, 2};
// fuse the transpose Ops by transforming axis.
std::vector<int> fusion_axis = {
perm[axis[0]], perm[axis[1]], perm[axis[2]], perm[axis[3]]};
(*attrs)["axis"] = fusion_axis;
}
return ins;
}
};
template <typename VarType>
class FlattenOpTransformer
: public LightlyLayoutSensitiveOpTransformer<VarType> {
public:
explicit FlattenOpTransformer(const std::string& type)
: LightlyLayoutSensitiveOpTransformer<VarType>(type) {}
paddle::imperative::NameVarMap<VarType> Apply(
const paddle::imperative::NameVarMap<VarType>& ins,
const paddle::imperative::NameVarMap<VarType>& outs,
paddle::framework::AttributeMap* attrs,
const std::shared_ptr<paddle::imperative::Tracer>& tracer) {
VLOG(3) << "Optimize lightly layout sensitive op " << this->Type();
// Flatten the C, H, W dimensions will not affect functionality.
// So transformation is unnecessary. But in other cases, it needs to
// fall back to the LightlyLayoutSensitiveOpTransformer.
auto start_axis = PADDLE_GET_CONST(int, (*attrs)["start_axis"]);
auto stop_axis = PADDLE_GET_CONST(int, (*attrs)["stop_axis"]);
if (paddle::imperative::GetDataLayout(ins.at("X")[0]) ==
LayoutAutoTune::Instance().GetDesiredLayout() &&
start_axis == 1 && stop_axis == 3) {
return ins;
} else {
return LightlyLayoutSensitiveOpTransformer<VarType>::Apply(
ins, outs, attrs, tracer);
}
}
};
template <typename VarType>
class ArgmaxOpTransformer
: public LightlyLayoutSensitiveOpTransformer<VarType> {
public:
explicit ArgmaxOpTransformer(const std::string& type)
: LightlyLayoutSensitiveOpTransformer<VarType>(type) {}
paddle::imperative::NameVarMap<VarType> Apply(
const paddle::imperative::NameVarMap<VarType>& ins,
const paddle::imperative::NameVarMap<VarType>& outs,
paddle::framework::AttributeMap* attrs,
const std::shared_ptr<paddle::imperative::Tracer>& tracer) {
VLOG(3) << "Optimize lightly layout sensitive op " << this->Type();
auto& in_var = ins.at("X")[0];
auto var_layout = paddle::imperative::GetDataLayout(in_var);
bool keep_dims = PADDLE_GET_CONST(bool, (*attrs)["keepdims"]);
if (keep_dims) {
if (var_layout != DataLayout::UNDEFINED) {
std::vector<int> perm_nhwc = {0, 3, 1, 2};
std::vector<int> perm_nchw = {0, 2, 3, 1};
auto perm = var_layout == DataLayout::NHWC ? perm_nhwc : perm_nchw;
switch (AttrTypeID((*attrs)["axis"])) {
case paddle::framework::proto::AttrType::INT: {
auto axis = PADDLE_GET_CONST(int, (*attrs)["axis"]);
(*attrs)["axis"] = static_cast<int>(perm[axis]);
break;
}
case paddle::framework::proto::AttrType::LONG: {
auto axis = PADDLE_GET_CONST(int64_t, (*attrs)["axis"]);
(*attrs)["axis"] = static_cast<int64_t>(perm[axis]);
break;
}
default:
VLOG(4) << "The data_type of axis is Error, axis must be int or "
"int64, bug got "
<< (AttrTypeID((*attrs)["axis"]));
}
}
this->SetVarsLayout(outs, var_layout);
return ins;
}
return LightlyLayoutSensitiveOpTransformer<VarType>::Apply(
ins, outs, attrs, tracer);
}
};
template <typename VarType>
class ConcatOpTransformer
: public LightlyLayoutSensitiveOpTransformer<VarType> {
public:
explicit ConcatOpTransformer(const std::string& type)
: LightlyLayoutSensitiveOpTransformer<VarType>(type) {}
paddle::imperative::NameVarMap<VarType> Apply(
const paddle::imperative::NameVarMap<VarType>& ins,
const paddle::imperative::NameVarMap<VarType>& outs,
paddle::framework::AttributeMap* attrs,
const std::shared_ptr<paddle::imperative::Tracer>& tracer) {
VLOG(3) << "Optimize lightly layout sensitive op " << this->Type();
auto& in_var = ins.at("X")[0];
auto var_layout = paddle::imperative::GetDataLayout(in_var);
bool need_transpose = false;
for (auto& pair : ins) {
for (auto& var : pair.second) {
if (var != nullptr &&
(paddle::imperative::GetDataLayout(var) != var_layout)) {
need_transpose = true;
break;
}
}
}
if (need_transpose) {
return LightlyLayoutSensitiveOpTransformer<VarType>::Apply(
ins, outs, attrs, tracer);
}
if (var_layout != DataLayout::UNDEFINED) {
std::vector<int> perm_nhwc = {0, 3, 1, 2};
std::vector<int> perm_nchw = {0, 2, 3, 1};
auto perm = var_layout == DataLayout::NHWC ? perm_nhwc : perm_nchw;
auto axis = PADDLE_GET_CONST(int, (*attrs)["axis"]);
(*attrs)["axis"] = static_cast<int>(perm[axis]);
}
auto axis = PADDLE_GET_CONST(int, (*attrs)["axis"]);
VLOG(3) << "Optimize lightly layout sensitive op axis" << axis;
this->SetVarsLayout(outs, var_layout);
return ins;
}
};
} // namespace imperative
} // namespace paddle
```
|
```shell
Using aliases for git commands
Make your log output pretty
Search by commit message keyword
Use `short` status to make output more compact
Ignore files in git
```
|
The Black Lash is a 1952 American western film produced and directed by Ron Ormond and starring Lash LaRue and Al "Fuzzy" St. John. It was the eleventh of LaRue's films for Ormond's Western Adventures Productions Inc. The film was the fifth to be released by Howco, Ron Ormond's new film company composed of Ormond and drive-in movie owners Joy N. Houck and J. Francis White, and Ormond's second film as director. The screenplay is credited to Ormond's wife June Carr and his infant (born 1950) son Timothy. The film is composed mostly of footage from previous Ormond LaRue Westerns with the majority of scenes taken from Frontier Revenge (1948) with Ray Bennett repeating his role as the released Duce Rago, making the film a sequel to that film.
Premise
Fuzzy finds himself separated from Lash who is posing as one of the Dalton Gang with undercover range detective Lem Woodruff. Fuzzy teams up with the pair to find themselves facing Duce Rago who has only served 6 months of a life sentence. In addition to taking on Duce's gang they set their sights on the justice system that let Duce loose.
Cast
Lash La Rue as Marshal Lash LaRue
Al St. John as Fuzzy Q. Jones
Ray Bennett as Deuce Rago
Peggy Stewart as Joan Delysa
Kermit Maynard as Lem Woodruff
Byron Keith as Bill Leonard
John L. Cason as Cord
Clarke Stevens as Johnson
Roy Butler as Mayor Redfield
Larry Barton as The Judge
Cliff Taylor as Bartender
Bud Osborne as Telegrepher
References
External links
1952 films
American Western (genre) films
1952 Western (genre) films
American black-and-white films
1950s English-language films
Films directed by Ron Ormond
1950s American films
|
This is a list of naval vessels sunk or otherwise severely damaged with loss of life during the Second World War.
See also
List of maritime disasters
List of maritime disasters in the 18th century
List of maritime disasters in the 19th century
List of maritime disasters in the 20th century
List of maritime disasters in World War I
List of maritime disasters in the 21st century
Shipwreck
Lists of shipwrecks
List of disasters
List of accidents and disasters by death toll
List by death toll of ships sunk by submarines
List of RORO vessel accidents
References
Lists of shipwrecks
World War II naval ships
World War II naval-related lists
|
```html
<html lang="en">
<head>
<title>Vector Extensions - Using the GNU Compiler Collection (GCC)</title>
<meta http-equiv="Content-Type" content="text/html">
<meta name="description" content="Using the GNU Compiler Collection (GCC)">
<meta name="generator" content="makeinfo 4.8">
<link title="Top" rel="start" href="index.html#Top">
<link rel="up" href="C-Extensions.html#C-Extensions" title="C Extensions">
<link rel="prev" href="Return-Address.html#Return-Address" title="Return Address">
<link rel="next" href="Offsetof.html#Offsetof" title="Offsetof">
<link href="path_to_url" rel="generator-home" title="Texinfo Homepage">
<!--
Permission is granted to copy, distribute and/or modify this document
any later version published by the Free Software Foundation; with the
Invariant Sections being ``Funding Free Software'', the Front-Cover
Texts being (a) (see below), and with the Back-Cover Texts being (b)
(see below). A copy of the license is included in the section entitled
(a) The FSF's Front-Cover Text is:
A GNU Manual
(b) The FSF's Back-Cover Text is:
You have freedom to copy and modify this GNU Manual, like GNU
software. Copies published by the Free Software Foundation raise
funds for GNU development.-->
<meta http-equiv="Content-Style-Type" content="text/css">
<style type="text/css"><!--
pre.display { font-family:inherit }
pre.format { font-family:inherit }
pre.smalldisplay { font-family:inherit; font-size:smaller }
pre.smallformat { font-family:inherit; font-size:smaller }
pre.smallexample { font-size:smaller }
pre.smalllisp { font-size:smaller }
span.sc { font-variant:small-caps }
span.roman { font-family:serif; font-weight:normal; }
span.sansserif { font-family:sans-serif; font-weight:normal; }
--></style>
</head>
<body>
<div class="node">
<p>
<a name="Vector-Extensions"></a>
Next: <a rel="next" accesskey="n" href="Offsetof.html#Offsetof">Offsetof</a>,
Previous: <a rel="previous" accesskey="p" href="Return-Address.html#Return-Address">Return Address</a>,
Up: <a rel="up" accesskey="u" href="C-Extensions.html#C-Extensions">C Extensions</a>
<hr>
</div>
<h3 class="section">6.48 Using Vector Instructions through Built-in Functions</h3>
<p>On some targets, the instruction set contains SIMD vector instructions which
operate on multiple values contained in one large register at the same time.
For example, on the x86 the MMX, 3DNow! and SSE extensions can be used
this way.
<p>The first step in using these extensions is to provide the necessary data
types. This should be done using an appropriate <code>typedef</code>:
<pre class="smallexample"> typedef int v4si __attribute__ ((vector_size (16)));
</pre>
<p class="noindent">The <code>int</code> type specifies the base type, while the attribute specifies
the vector size for the variable, measured in bytes. For example, the
declaration above causes the compiler to set the mode for the <code>v4si</code>
type to be 16 bytes wide and divided into <code>int</code> sized units. For
a 32-bit <code>int</code> this means a vector of 4 units of 4 bytes, and the
corresponding mode of <code>foo</code> is <acronym>V4SI</acronym>.
<p>The <code>vector_size</code> attribute is only applicable to integral and
float scalars, although arrays, pointers, and function return values
are allowed in conjunction with this construct. Only sizes that are
a power of two are currently allowed.
<p>All the basic integer types can be used as base types, both as signed
and as unsigned: <code>char</code>, <code>short</code>, <code>int</code>, <code>long</code>,
<code>long long</code>. In addition, <code>float</code> and <code>double</code> can be
used to build floating-point vector types.
<p>Specifying a combination that is not valid for the current architecture
causes GCC to synthesize the instructions using a narrower mode.
For example, if you specify a variable of type <code>V4SI</code> and your
architecture does not allow for this specific SIMD type, GCC
produces code that uses 4 <code>SIs</code>.
<p>The types defined in this manner can be used with a subset of normal C
operations. Currently, GCC allows using the following operators
on these types: <code>+, -, *, /, unary minus, ^, |, &, ~, %</code>.
<p>The operations behave like C++ <code>valarrays</code>. Addition is defined as
the addition of the corresponding elements of the operands. For
example, in the code below, each of the 4 elements in <var>a</var> is
added to the corresponding 4 elements in <var>b</var> and the resulting
vector is stored in <var>c</var>.
<pre class="smallexample"> typedef int v4si __attribute__ ((vector_size (16)));
v4si a, b, c;
c = a + b;
</pre>
<p>Subtraction, multiplication, division, and the logical operations
operate in a similar manner. Likewise, the result of using the unary
minus or complement operators on a vector type is a vector whose
elements are the negative or complemented values of the corresponding
elements in the operand.
<p>It is possible to use shifting operators <code><<</code>, <code>>></code> on
integer-type vectors. The operation is defined as following: <code>{a0,
a1, ..., an} >> {b0, b1, ..., bn} == {a0 >> b0, a1 >> b1,
..., an >> bn}</code>. Vector operands must have the same number of
elements.
<p>For convenience, it is allowed to use a binary vector operation
where one operand is a scalar. In that case the compiler transforms
the scalar operand into a vector where each element is the scalar from
the operation. The transformation happens only if the scalar could be
safely converted to the vector-element type.
Consider the following code.
<pre class="smallexample"> typedef int v4si __attribute__ ((vector_size (16)));
v4si a, b, c;
long l;
a = b + 1; /* a = b + {1,1,1,1}; */
a = 2 * b; /* a = {2,2,2,2} * b; */
a = l + a; /* Error, cannot convert long to int. */
</pre>
<p>Vectors can be subscripted as if the vector were an array with
the same number of elements and base type. Out of bound accesses
invoke undefined behavior at run time. Warnings for out of bound
accesses for vector subscription can be enabled with
<samp><span class="option">-Warray-bounds</span></samp>.
<p>Vector comparison is supported with standard comparison
operators: <code>==, !=, <, <=, >, >=</code>. Comparison operands can be
vector expressions of integer-type or real-type. Comparison between
integer-type vectors and real-type vectors are not supported. The
result of the comparison is a vector of the same width and number of
elements as the comparison operands with a signed integral element
type.
<p>Vectors are compared element-wise producing 0 when comparison is false
and -1 (constant of the appropriate type where all bits are set)
otherwise. Consider the following example.
<pre class="smallexample"> typedef int v4si __attribute__ ((vector_size (16)));
v4si a = {1,2,3,4};
v4si b = {3,2,1,4};
v4si c;
c = a > b; /* The result would be {0, 0,-1, 0} */
c = a == b; /* The result would be {0,-1, 0,-1} */
</pre>
<p>In C++, the ternary operator <code>?:</code> is available. <code>a?b:c</code>, where
<code>b</code> and <code>c</code> are vectors of the same type and <code>a</code> is an
integer vector with the same number of elements of the same size as <code>b</code>
and <code>c</code>, computes all three arguments and creates a vector
<code>{a[0]?b[0]:c[0], a[1]?b[1]:c[1], ...}</code>. Note that unlike in
OpenCL, <code>a</code> is thus interpreted as <code>a != 0</code> and not <code>a < 0</code>.
As in the case of binary operations, this syntax is also accepted when
one of <code>b</code> or <code>c</code> is a scalar that is then transformed into a
vector. If both <code>b</code> and <code>c</code> are scalars and the type of
<code>true?b:c</code> has the same size as the element type of <code>a</code>, then
<code>b</code> and <code>c</code> are converted to a vector type whose elements have
this type and with the same number of elements as <code>a</code>.
<p>In C++, the logic operators <code>!, &&, ||</code> are available for vectors.
<code>!v</code> is equivalent to <code>v == 0</code>, <code>a && b</code> is equivalent to
<code>a!=0 & b!=0</code> and <code>a || b</code> is equivalent to <code>a!=0 | b!=0</code>.
For mixed operations between a scalar <code>s</code> and a vector <code>v</code>,
<code>s && v</code> is equivalent to <code>s?v!=0:0</code> (the evaluation is
short-circuit) and <code>v && s</code> is equivalent to <code>v!=0 & (s?-1:0)</code>.
<p>Vector shuffling is available using functions
<code>__builtin_shuffle (vec, mask)</code> and
<code>__builtin_shuffle (vec0, vec1, mask)</code>.
Both functions construct a permutation of elements from one or two
vectors and return a vector of the same type as the input vector(s).
The <var>mask</var> is an integral vector with the same width (<var>W</var>)
and element count (<var>N</var>) as the output vector.
<p>The elements of the input vectors are numbered in memory ordering of
<var>vec0</var> beginning at 0 and <var>vec1</var> beginning at <var>N</var>. The
elements of <var>mask</var> are considered modulo <var>N</var> in the single-operand
case and modulo 2*<var>N</var> in the two-operand case.
<p>Consider the following example,
<pre class="smallexample"> typedef int v4si __attribute__ ((vector_size (16)));
v4si a = {1,2,3,4};
v4si b = {5,6,7,8};
v4si mask1 = {0,1,1,3};
v4si mask2 = {0,4,2,5};
v4si res;
res = __builtin_shuffle (a, mask1); /* res is {1,2,2,4} */
res = __builtin_shuffle (a, b, mask2); /* res is {1,5,3,6} */
</pre>
<p>Note that <code>__builtin_shuffle</code> is intentionally semantically
compatible with the OpenCL <code>shuffle</code> and <code>shuffle2</code> functions.
<p>You can declare variables and use them in function calls and returns, as
well as in assignments and some casts. You can specify a vector type as
a return type for a function. Vector types can also be used as function
arguments. It is possible to cast from one vector type to another,
provided they are of the same size (in fact, you can also cast vectors
to and from other datatypes of the same size).
<p>You cannot operate between vectors of different lengths or different
signedness without a cast.
</body></html>
```
|
Defending champion William Blumberg and his partner Steve Johnson defeated Raven Klaasen and Marcelo Melo in the final, 6–4, 7–5 to win the men's doubles tennis title at the 2022 Hall of Fame Open.
Blumburg and Jack Sock were the reigning champions, but Sock did not participate.
Seeds
Draw
Draw
References
External links
Main draw
Hall of Fame Open - Doubles
2022 Doubles
|
Renier of St Laurent (died 1188) was a twelfth-century Benedictine monk of St Laurent Abbey, Liège. He is known as a writer of theological and exegetical works, controversial and historical works, and numerous biographical and hagiographical works. Works by him are in Patrologia Latina and Monumenta Germaniae Historica.
The Triumphale Bulonicum is a chronicle and commemorates the siege of Bouillon Castle by Albero, prince-bishop of Liège, 17 August to 22 September 1141. It is based on eye-witness accounts.
References
Hubert Silvestre, Notes sur la "Vita Evracli" de Renier de Saint-Laurent. Contribution à l'histoire littéraire du XIIe siècle Liégeois, Revue d'histoire ecclésiastique, XLIV (1949), pp. 29–86
Hubert Silvestre, Renier de St.-Laurent et le déclin des écoles liégeoises au XIIe siècle, Miscellanea Tornacensia. Mélanges d'archéologie et d'hist. Congrès de Tournai 1949 (Bruxelles 1951), pp. 112–123
David Foote, Taming monastic advocates and redeeming bishops: the Triumphale and episcopal vitae of Reiner of St. Lawrence, Revue d'histoire ecclésiastique 91 (1996)
Article "Reiner von Lüttich", col. 1165 in Die deutsche Literatur des Mittelalters: Verfasserlexikon (2006), by Wolfgang Stammler, Karl Langosch, Kurt Ruh
Notes
External links
PDF
1188 deaths
Belgian Benedictines
Chroniclers from the Holy Roman Empire
12th-century historians from the Holy Roman Empire
Year of birth unknown
12th-century writers in Latin
|
The Assiti Shards series is a fictional universe invented by American author Eric Flint. It is a shared universe concerning several alternate history worlds, related to a prime timeline. The defining characteristic of the fictional universe is the existence of the "Assiti Shards effect", and the impact that strikes by Assiti Shards have on characters in the stories. The series is rather large and expansive, having started publication in 2000, and , consisting of 15 print books, and 21 e-magazine anthologies, in two different published timelines of the same multiverse (only one work is in the second timeline).
Assiti Shard
The Assiti Shards work by displacing bits of the world into other times and places, exchanging it with that which was there. These "shards", according to the fictional universe backstory, are waste byproduct of artworks created by the sophisticated and curious alien race known as the Assiti. The various stories involve shards striking the Earth and timeshifting characters into different periods and places.
Multiverse
Ring of Fire
The first literary work in this fictional universe was 1632 (pub. 2000) by Eric Flint. This work led to a series of works that branched off this, into the Ring of Fire series (aka 1632 series). Most of the works in this fictional universe fall within this particular timeline. This timeline involves the displacement and exchange of the late 1990s mining town of Grantville, West Virginia with a piece of 1630s early modern southern Germany (in Thuringia).
Although 1632 was written as a stand-alone novel in 2000, Flint had planned several other universes using the Assiti Shards story premise. However, the sensation and interest engendered by the 1632 novel's publication subsequently caused the other works to be delayed while the 1632 series was developed.
This timeline was opened up to third-party authors, and open submissions. These are collected and published as the Grantville Gazettes, an online anthology magazine, focused solely on the Ring of Fire timeline. It is similar to Analog Science Fiction Science Fact, in that it publishes fiction and nonfiction. In this case, the nonfiction relates to the Ring of Fire timeline. The best stories, some commissioned, are collected into the Ring of Fire print anthology series.
Many of the major novels in the series are collaborations between Eric Flint and other authors. The series is considered broad and expansive.
Time Spike series
A second timeline was introduced by Eric Flint when he released the novel Time Spike with co-author Marilyn Kosmatka in 2008. This timeline involves several different periods in the history of Middle America, starting with a maximum security prison in the 2000s, along with Amerinds on the Trail of Tears, Spanish Conquistadors, a city of the Mound Builders, and some Paleoindians—all displaced into the Cretaceous period age of dinosaurs. The Assiti Shard in this universe took pieces from different geologic time periods from the Devonian period through the present and jumble them together in an affected area while placing this mixture on a Cretaceous earth.
Time Spike novel
The first work in the series, the 2008 novel Time Spike (), was written by Eric Flint and Marilyn Kosmatka. The main thread of the novel is about state maximum-security prison located in economically depressed downstate Illinois from the first decade of the 21st century being transported to a Cretaceous Earth during the middle of an evening shift change so that the prison would (theoretically be) twice the normal number of prison staff available at the prison at any given time but before regular administrators, such as the warden and other section heads, show up. A secondary thread covers 19th century Cherokees being forcible escorted by U.S. Army troops from their homes in Georgia to their exile in would later become Oklahoma along the Trail of Tears. A tertiary thread is about the scientists who were left behind on the original 21st century Earth who are analyzing the cause behind the Assiti Shards displacements and their fight against an American government who is trying to keep the event at the prison (and the previous displacement at Grantville) secret from the general public for unknown purposes.
Time Spike: The Mysterious Mesa
For over a decade from volume 39 in 2012 to volume 99 in 2022 of The Grantville Gazette, Garrett W. Vance had been writing an ongoing serial in the Time Spike universe that included Time Spike: The Good Samaritan and the Hanged Man, Time Spike: Evening in Cahokia, Time Spike: The Mysterious Mesa, and Time Spike: First Cavalry of the Cretaceous. Vance's stories were reissued as a single volume novel titled Time Spike: The Mysterious Mesa in 2018 (), and was followed by a second volume titled Time Spike: The First Cavalry of the Cretaceous in 2022 (), both published by Eric Flint's Ring of Fire Press. To date, these two books are the only other major works that is written in the Time Spike universe.
The story concerns the adventures of cavalry scout Nate Tucker of the newly formed Republic of Texas serving as a soldier in the United States Army Cavalry who was escorting the Cherokee during the Trail of Tears incident. Tucker befriends a Spaniard formerly serving in Hernando de Soto's 16th century expedition across North America. The two men encounter pre-Columbian Native Americans from different time periods ranging from the Neolithic to the Mississippian culture period.
It is not clear if Vance will be able to continue this series after the immediate closure of both The Grantville Gazette and the Ring of Fire Press that had occurred after Eric Flint's death in 2022.
Dove's Time Spike short stories
From 2012 to 2017, author David W. Dove wrote three unrelated short stories in the Time Spike universe that were published in volumes 39, 41, and 74 of the Grantville Gazette.
Queen of the Seas series
This book series involved the transport of the 21st century cruise ship Queen of the Seas to the 4th century BCE Mediterranean and how 21st century technology affects the successors to Alexander the Great's vast empire.
The Alexander Inheritance
This novel by Eric Flint with Paula Goodlett and Gorg Huff was released by Baen in July 2017 (). The cause of the displacement was described as "An Assiti Shard transposes a modern cruise liner into the Mediterranean just after the death of Alexander the Great." The passengers and crew include a historian, a Norwegian cruise ship captain, a French first officer for navigation who was a competitive pistol marksman while previously serving in the French Navy, and an American congressman, who are thrown back in time during the period of the Diadochi, when one of world's largest empires was being split apart by civil war.
The Macedonian Hazard
The Macedonian Hazard, the second novel in the Queen of the Seas series was released in January 2021 (). The book picks up where The Alexander Inheritance had left off with when Olympias, Alexander's mother, shows up at the ship.
The Sicilian Coil
The Sicilian Coil is the third novel set in the Queen of The Seas series released in September 2021 (). This side-line novel, which does not directly involve the main characters, is published by Ring of Fire Press. This novel covers events in the region of Sicily and the Italian Peninsula that coincide with the events in the novel The Macedonian Hazard, from the viewpoints of characters who have left the Queen of the Seas to work with Rome and other cities in the region providing technical knowledge and radio communication links.
Other time threads
The Crossing
The Crossing () is a 2022 novel by Kevin Ikenberry set in the Assiti Shards milieu about a time displaced 2008 ROTC squad sent back to the 1776 Battle of Trenton.
In a secondary thread, the scientists who were fighting the American governmental cover-up that was introduced in Time Spike continue on with their work analyzing and predicting the time displacements while the government continue to spread more mis-information to the general public.
An Angel Called Peterbilt
In July 2023, Baen Books and Simon & Schuster announced the February 2024 release of the new novel by Eric Flint, Gorg Huff and Paula Goodlett called An Angel Called Peterbilt () that is an expansion of the unfinished novella that Flint was working on called An Angel Named Peterbilt at the time of his death in July 2022.
See also
The Emberverse series
Nantucket series
A Time Odyssey
List of books published by Ring of Fire Press
References
External links
BAEN Free e-library
1632.org
"Virginia's Grid" of Up-time Characters
Slush Pile
Baen's Bar, center of the Assiti Shard collaboration
Book series introduced in 2000
Fictional universes
Parallel universes in fiction
|
Gillygooly is a small village and townland west of Omagh in County Tyrone, Northern Ireland. In the 2001 Census it had a population of 72 people. It lies within the Omagh District Council area. The earliest reference to the townland of Gillygooly is the anglicisation Killagauland from c1655, which may be .
See also
List of villages in Northern Ireland
References
NI Neighbourhood Information System
Villages in County Tyrone
Townlands of County Tyrone
|
```html
<html lang="en">
<head>
<title>File Framework - GNU Compiler Collection (GCC) Internals</title>
<meta http-equiv="Content-Type" content="text/html">
<meta name="description" content="GNU Compiler Collection (GCC) Internals">
<meta name="generator" content="makeinfo 4.8">
<link title="Top" rel="start" href="index.html#Top">
<link rel="up" href="Assembler-Format.html#Assembler-Format" title="Assembler Format">
<link rel="next" href="Data-Output.html#Data-Output" title="Data Output">
<link href="path_to_url" rel="generator-home" title="Texinfo Homepage">
<!--
Permission is granted to copy, distribute and/or modify this document
any later version published by the Free Software Foundation; with the
Invariant Sections being ``Funding Free Software'', the Front-Cover
Texts being (a) (see below), and with the Back-Cover Texts being (b)
(see below). A copy of the license is included in the section entitled
(a) The FSF's Front-Cover Text is:
A GNU Manual
(b) The FSF's Back-Cover Text is:
You have freedom to copy and modify this GNU Manual, like GNU
software. Copies published by the Free Software Foundation raise
funds for GNU development.-->
<meta http-equiv="Content-Style-Type" content="text/css">
<style type="text/css"><!--
pre.display { font-family:inherit }
pre.format { font-family:inherit }
pre.smalldisplay { font-family:inherit; font-size:smaller }
pre.smallformat { font-family:inherit; font-size:smaller }
pre.smallexample { font-size:smaller }
pre.smalllisp { font-size:smaller }
span.sc { font-variant:small-caps }
span.roman { font-family:serif; font-weight:normal; }
span.sansserif { font-family:sans-serif; font-weight:normal; }
--></style>
</head>
<body>
<div class="node">
<p>
<a name="File-Framework"></a>
Next: <a rel="next" accesskey="n" href="Data-Output.html#Data-Output">Data Output</a>,
Up: <a rel="up" accesskey="u" href="Assembler-Format.html#Assembler-Format">Assembler Format</a>
<hr>
</div>
<h4 class="subsection">17.20.1 The Overall Framework of an Assembler File</h4>
<p><a name="index-assembler-format-4555"></a><a name="index-output-of-assembler-code-4556"></a>
<!-- prevent bad page break with this line -->
This describes the overall framework of an assembly file.
<p><a name="index-default_005ffile_005fstart-4557"></a>
<div class="defun">
— Target Hook: void <b>TARGET_ASM_FILE_START</b> (<var>void</var>)<var><a name="index-TARGET_005fASM_005fFILE_005fSTART-4558"></a></var><br>
<blockquote><p>Output to <code>asm_out_file</code> any text which the assembler expects to
find at the beginning of a file. The default behavior is controlled
by two flags, documented below. Unless your target's assembler is
quite unusual, if you override the default, you should call
<code>default_file_start</code> at some point in your target hook. This
lets other target files rely on these variables.
</p></blockquote></div>
<div class="defun">
— Target Hook: bool <b>TARGET_ASM_FILE_START_APP_OFF</b><var><a name="index-TARGET_005fASM_005fFILE_005fSTART_005fAPP_005fOFF-4559"></a></var><br>
<blockquote><p>If this flag is true, the text of the macro <code>ASM_APP_OFF</code> will be
printed as the very first line in the assembly file, unless
<samp><span class="option">-fverbose-asm</span></samp> is in effect. (If that macro has been defined
to the empty string, this variable has no effect.) With the normal
definition of <code>ASM_APP_OFF</code>, the effect is to notify the GNU
assembler that it need not bother stripping comments or extra
whitespace from its input. This allows it to work a bit faster.
<p>The default is false. You should not set it to true unless you have
verified that your port does not generate any extra whitespace or
comments that will cause GAS to issue errors in NO_APP mode.
</p></blockquote></div>
<div class="defun">
— Target Hook: bool <b>TARGET_ASM_FILE_START_FILE_DIRECTIVE</b><var><a name=your_sha256_hash560"></a></var><br>
<blockquote><p>If this flag is true, <code>output_file_directive</code> will be called
for the primary source file, immediately after printing
<code>ASM_APP_OFF</code> (if that is enabled). Most ELF assemblers expect
this to be done. The default is false.
</p></blockquote></div>
<div class="defun">
— Target Hook: void <b>TARGET_ASM_FILE_END</b> (<var>void</var>)<var><a name="index-TARGET_005fASM_005fFILE_005fEND-4561"></a></var><br>
<blockquote><p>Output to <code>asm_out_file</code> any text which the assembler expects
to find at the end of a file. The default is to output nothing.
</p></blockquote></div>
<div class="defun">
— Function: void <b>file_end_indicate_exec_stack</b> ()<var><a name="index-file_005fend_005findicate_005fexec_005fstack-4562"></a></var><br>
<blockquote><p>Some systems use a common convention, the `<samp><span class="samp">.note.GNU-stack</span></samp>'
special section, to indicate whether or not an object file relies on
the stack being executable. If your system uses this convention, you
should define <code>TARGET_ASM_FILE_END</code> to this function. If you
need to do other things in that hook, have your hook function call
this function.
</p></blockquote></div>
<div class="defun">
— Target Hook: void <b>TARGET_ASM_LTO_START</b> (<var>void</var>)<var><a name="index-TARGET_005fASM_005fLTO_005fSTART-4563"></a></var><br>
<blockquote><p>Output to <code>asm_out_file</code> any text which the assembler expects
to find at the start of an LTO section. The default is to output
nothing.
</p></blockquote></div>
<div class="defun">
— Target Hook: void <b>TARGET_ASM_LTO_END</b> (<var>void</var>)<var><a name="index-TARGET_005fASM_005fLTO_005fEND-4564"></a></var><br>
<blockquote><p>Output to <code>asm_out_file</code> any text which the assembler expects
to find at the end of an LTO section. The default is to output
nothing.
</p></blockquote></div>
<div class="defun">
— Target Hook: void <b>TARGET_ASM_CODE_END</b> (<var>void</var>)<var><a name="index-TARGET_005fASM_005fCODE_005fEND-4565"></a></var><br>
<blockquote><p>Output to <code>asm_out_file</code> any text which is needed before emitting
unwind info and debug info at the end of a file. Some targets emit
here PIC setup thunks that cannot be emitted at the end of file,
because they couldn't have unwind info then. The default is to output
nothing.
</p></blockquote></div>
<div class="defun">
— Macro: <b>ASM_COMMENT_START</b><var><a name="index-ASM_005fCOMMENT_005fSTART-4566"></a></var><br>
<blockquote><p>A C string constant describing how to begin a comment in the target
assembler language. The compiler assumes that the comment will end at
the end of the line.
</p></blockquote></div>
<div class="defun">
— Macro: <b>ASM_APP_ON</b><var><a name="index-ASM_005fAPP_005fON-4567"></a></var><br>
<blockquote><p>A C string constant for text to be output before each <code>asm</code>
statement or group of consecutive ones. Normally this is
<code>"#APP"</code>, which is a comment that has no effect on most
assemblers but tells the GNU assembler that it must check the lines
that follow for all valid assembler constructs.
</p></blockquote></div>
<div class="defun">
— Macro: <b>ASM_APP_OFF</b><var><a name="index-ASM_005fAPP_005fOFF-4568"></a></var><br>
<blockquote><p>A C string constant for text to be output after each <code>asm</code>
statement or group of consecutive ones. Normally this is
<code>"#NO_APP"</code>, which tells the GNU assembler to resume making the
time-saving assumptions that are valid for ordinary compiler output.
</p></blockquote></div>
<div class="defun">
— Macro: <b>ASM_OUTPUT_SOURCE_FILENAME</b> (<var>stream, name</var>)<var><a name="index-ASM_005fOUTPUT_005fSOURCE_005fFILENAME-4569"></a></var><br>
<blockquote><p>A C statement to output COFF information or DWARF debugging information
which indicates that filename <var>name</var> is the current source file to
the stdio stream <var>stream</var>.
<p>This macro need not be defined if the standard form of output
for the file format in use is appropriate.
</p></blockquote></div>
<div class="defun">
— Target Hook: void <b>TARGET_ASM_OUTPUT_SOURCE_FILENAME</b> (<var>FILE *file, const char *name</var>)<var><a name="index-TARGET_005fASM_005fOUTPUT_005fSOURCE_005fFILENAME-4570"></a></var><br>
<blockquote><p>Output COFF information or DWARF debugging information which indicates that filename <var>name</var> is the current source file to the stdio stream <var>file</var>.
<p>This target hook need not be defined if the standard form of output for the file format in use is appropriate.
</p></blockquote></div>
<div class="defun">
— Target Hook: void <b>TARGET_ASM_OUTPUT_IDENT</b> (<var>const char *name</var>)<var><a name="index-TARGET_005fASM_005fOUTPUT_005fIDENT-4571"></a></var><br>
<blockquote><p>Output a string based on <var>name</var>, suitable for the `<samp><span class="samp">#ident</span></samp>' directive, or the equivalent directive or pragma in non-C-family languages. If this hook is not defined, nothing is output for the `<samp><span class="samp">#ident</span></samp>' directive.
</p></blockquote></div>
<div class="defun">
— Macro: <b>OUTPUT_QUOTED_STRING</b> (<var>stream, string</var>)<var><a name="index-OUTPUT_005fQUOTED_005fSTRING-4572"></a></var><br>
<blockquote><p>A C statement to output the string <var>string</var> to the stdio stream
<var>stream</var>. If you do not call the function <code>output_quoted_string</code>
in your config files, GCC will only call it to output filenames to
the assembler source. So you can use it to canonicalize the format
of the filename using this macro.
</p></blockquote></div>
<div class="defun">
— Target Hook: void <b>TARGET_ASM_NAMED_SECTION</b> (<var>const char *name, unsigned int flags, tree decl</var>)<var><a name="index-TARGET_005fASM_005fNAMED_005fSECTION-4573"></a></var><br>
<blockquote><p>Output assembly directives to switch to section <var>name</var>. The section
should have attributes as specified by <var>flags</var>, which is a bit mask
of the <code>SECTION_*</code> flags defined in <samp><span class="file">output.h</span></samp>. If <var>decl</var>
is non-NULL, it is the <code>VAR_DECL</code> or <code>FUNCTION_DECL</code> with which
this section is associated.
</p></blockquote></div>
<div class="defun">
— Target Hook: section * <b>TARGET_ASM_FUNCTION_SECTION</b> (<var>tree decl, enum node_frequency freq, bool startup, bool exit</var>)<var><a name="index-TARGET_005fASM_005fFUNCTION_005fSECTION-4574"></a></var><br>
<blockquote><p>Return preferred text (sub)section for function <var>decl</var>.
Main purpose of this function is to separate cold, normal and hot
functions. <var>startup</var> is true when function is known to be used only
at startup (from static constructors or it is <code>main()</code>).
<var>exit</var> is true when function is known to be used only at exit
(from static destructors).
Return NULL if function should go to default text section.
</p></blockquote></div>
<div class="defun">
— Target Hook: void <b>TARGET_ASM_FUNCTION_SWITCHED_TEXT_SECTIONS</b> (<var>FILE *file, tree decl, bool new_is_cold</var>)<var><a name=your_sha256_hashIONS-4575"></a></var><br>
<blockquote><p>Used by the target to emit any assembler directives or additional labels needed when a function is partitioned between different sections. Output should be written to <var>file</var>. The function decl is available as <var>decl</var> and the new section is `cold' if <var>new_is_cold</var> is <code>true</code>.
</p></blockquote></div>
<div class="defun">
— Common Target Hook: bool <b>TARGET_HAVE_NAMED_SECTIONS</b><var><a name="index-TARGET_005fHAVE_005fNAMED_005fSECTIONS-4576"></a></var><br>
<blockquote><p>This flag is true if the target supports <code>TARGET_ASM_NAMED_SECTION</code>.
It must not be modified by command-line option processing.
</p></blockquote></div>
<p><a name="TARGET_005fHAVE_005fSWITCHABLE_005fBSS_005fSECTIONS"></a>
<div class="defun">
— Target Hook: bool <b>TARGET_HAVE_SWITCHABLE_BSS_SECTIONS</b><var><a name="index-TARGET_005fHAVE_005fSWITCHABLE_005fBSS_005fSECTIONS-4577"></a></var><br>
<blockquote><p>This flag is true if we can create zeroed data by switching to a BSS
section and then using <code>ASM_OUTPUT_SKIP</code> to allocate the space.
This is true on most ELF targets.
</p></blockquote></div>
<div class="defun">
— Target Hook: unsigned int <b>TARGET_SECTION_TYPE_FLAGS</b> (<var>tree decl, const char *name, int reloc</var>)<var><a name="index-TARGET_005fSECTION_005fTYPE_005fFLAGS-4578"></a></var><br>
<blockquote><p>Choose a set of section attributes for use by <code>TARGET_ASM_NAMED_SECTION</code>
based on a variable or function decl, a section name, and whether or not the
declaration's initializer may contain runtime relocations. <var>decl</var> may be
null, in which case read-write data should be assumed.
<p>The default version of this function handles choosing code vs data,
read-only vs read-write data, and <code>flag_pic</code>. You should only
need to override this if your target has special flags that might be
set via <code>__attribute__</code>.
</p></blockquote></div>
<div class="defun">
— Target Hook: int <b>TARGET_ASM_RECORD_GCC_SWITCHES</b> (<var>print_switch_type type, const char *text</var>)<var><a name="index-TARGET_005fASM_005fRECORD_005fGCC_005fSWITCHES-4579"></a></var><br>
<blockquote><p>Provides the target with the ability to record the gcc command line
switches that have been passed to the compiler, and options that are
enabled. The <var>type</var> argument specifies what is being recorded.
It can take the following values:
<dl>
<dt><code>SWITCH_TYPE_PASSED</code><dd><var>text</var> is a command line switch that has been set by the user.
<br><dt><code>SWITCH_TYPE_ENABLED</code><dd><var>text</var> is an option which has been enabled. This might be as a
direct result of a command line switch, or because it is enabled by
default or because it has been enabled as a side effect of a different
command line switch. For example, the <samp><span class="option">-O2</span></samp> switch enables
various different individual optimization passes.
<br><dt><code>SWITCH_TYPE_DESCRIPTIVE</code><dd><var>text</var> is either NULL or some descriptive text which should be
ignored. If <var>text</var> is NULL then it is being used to warn the
target hook that either recording is starting or ending. The first
time <var>type</var> is SWITCH_TYPE_DESCRIPTIVE and <var>text</var> is NULL, the
warning is for start up and the second time the warning is for
wind down. This feature is to allow the target hook to make any
necessary preparations before it starts to record switches and to
perform any necessary tidying up after it has finished recording
switches.
<br><dt><code>SWITCH_TYPE_LINE_START</code><dd>This option can be ignored by this target hook.
<br><dt><code>SWITCH_TYPE_LINE_END</code><dd>This option can be ignored by this target hook.
</dl>
<p>The hook's return value must be zero. Other return values may be
supported in the future.
<p>By default this hook is set to NULL, but an example implementation is
provided for ELF based targets. Called <var>elf_record_gcc_switches</var>,
it records the switches as ASCII text inside a new, string mergeable
section in the assembler output file. The name of the new section is
provided by the <code>TARGET_ASM_RECORD_GCC_SWITCHES_SECTION</code> target
hook.
</p></blockquote></div>
<div class="defun">
— Target Hook: const char * <b>TARGET_ASM_RECORD_GCC_SWITCHES_SECTION</b><var><a name=your_sha256_hash-4580"></a></var><br>
<blockquote><p>This is the name of the section that will be created by the example
ELF implementation of the <code>TARGET_ASM_RECORD_GCC_SWITCHES</code> target
hook.
</p></blockquote></div>
</body></html>
```
|
```objective-c
//
// LFVideoCapture.m
// LFLiveKit
//
// Created by LaiFeng on 16/5/20.
//
#import "LFVideoCapture.h"
#import "LFGPUImageBeautyFilter.h"
#import "LFGPUImageEmptyFilter.h"
#if __has_include(<GPUImage/GPUImage.h>)
#import <GPUImage/GPUImage.h>
#elif __has_include("GPUImage/GPUImage.h")
#import "GPUImage/GPUImage.h"
#else
#import "GPUImage.h"
#endif
@interface LFVideoCapture ()
@property (nonatomic, strong) GPUImageVideoCamera *videoCamera;
@property (nonatomic, strong) LFGPUImageBeautyFilter *beautyFilter;
@property (nonatomic, strong) GPUImageOutput<GPUImageInput> *filter;
@property (nonatomic, strong) GPUImageCropFilter *cropfilter;
@property (nonatomic, strong) GPUImageOutput<GPUImageInput> *output;
@property (nonatomic, strong) GPUImageView *gpuImageView;
@property (nonatomic, strong) LFLiveVideoConfiguration *configuration;
@property (nonatomic, strong) GPUImageAlphaBlendFilter *blendFilter;
@property (nonatomic, strong) GPUImageUIElement *uiElementInput;
@property (nonatomic, strong) UIView *waterMarkContentView;
@property (nonatomic, strong) GPUImageMovieWriter *movieWriter;
@end
@implementation LFVideoCapture
@synthesize torch = _torch;
@synthesize beautyLevel = _beautyLevel;
@synthesize brightLevel = _brightLevel;
@synthesize zoomScale = _zoomScale;
#pragma mark -- LifeCycle
- (instancetype)initWithVideoConfiguration:(LFLiveVideoConfiguration *)configuration {
if (self = [super init]) {
_configuration = configuration;
[[NSNotificationCenter defaultCenter] addObserver:self selector:@selector(willEnterBackground:) name:UIApplicationWillResignActiveNotification object:nil];
[[NSNotificationCenter defaultCenter] addObserver:self selector:@selector(willEnterForeground:) name:UIApplicationDidBecomeActiveNotification object:nil];
[[NSNotificationCenter defaultCenter] addObserver:self selector:@selector(statusBarChanged:) name:UIApplicationWillChangeStatusBarOrientationNotification object:nil];
self.beautyFace = YES;
self.beautyLevel = 0.5;
self.brightLevel = 0.5;
self.zoomScale = 1.0;
self.mirror = YES;
}
return self;
}
- (void)dealloc {
[UIApplication sharedApplication].idleTimerDisabled = NO;
[[NSNotificationCenter defaultCenter] removeObserver:self];
[_videoCamera stopCameraCapture];
if(_gpuImageView){
[_gpuImageView removeFromSuperview];
_gpuImageView = nil;
}
}
#pragma mark -- Setter Getter
- (GPUImageVideoCamera *)videoCamera{
if(!_videoCamera){
_videoCamera = [[GPUImageVideoCamera alloc] initWithSessionPreset:_configuration.avSessionPreset cameraPosition:AVCaptureDevicePositionFront];
_videoCamera.outputImageOrientation = _configuration.outputImageOrientation;
_videoCamera.horizontallyMirrorFrontFacingCamera = NO;
_videoCamera.horizontallyMirrorRearFacingCamera = NO;
_videoCamera.frameRate = (int32_t)_configuration.videoFrameRate;
}
return _videoCamera;
}
- (void)setRunning:(BOOL)running {
if (_running == running) return;
_running = running;
if (!_running) {
[UIApplication sharedApplication].idleTimerDisabled = NO;
[self.videoCamera stopCameraCapture];
if(self.saveLocalVideo) [self.movieWriter finishRecording];
} else {
[UIApplication sharedApplication].idleTimerDisabled = YES;
[self reloadFilter];
[self.videoCamera startCameraCapture];
if(self.saveLocalVideo) [self.movieWriter startRecording];
}
}
- (void)setPreView:(UIView *)preView {
if (self.gpuImageView.superview) [self.gpuImageView removeFromSuperview];
[preView insertSubview:self.gpuImageView atIndex:0];
self.gpuImageView.frame = CGRectMake(0, 0, preView.frame.size.width, preView.frame.size.height);
}
- (UIView *)preView {
return self.gpuImageView.superview;
}
- (void)setCaptureDevicePosition:(AVCaptureDevicePosition)captureDevicePosition {
if(captureDevicePosition == self.videoCamera.cameraPosition) return;
[self.videoCamera rotateCamera];
self.videoCamera.frameRate = (int32_t)_configuration.videoFrameRate;
[self reloadMirror];
}
- (AVCaptureDevicePosition)captureDevicePosition {
return [self.videoCamera cameraPosition];
}
- (void)setVideoFrameRate:(NSInteger)videoFrameRate {
if (videoFrameRate <= 0) return;
if (videoFrameRate == self.videoCamera.frameRate) return;
self.videoCamera.frameRate = (uint32_t)videoFrameRate;
}
- (NSInteger)videoFrameRate {
return self.videoCamera.frameRate;
}
- (void)setTorch:(BOOL)torch {
BOOL ret;
if (!self.videoCamera.captureSession) return;
AVCaptureSession *session = (AVCaptureSession *)self.videoCamera.captureSession;
[session beginConfiguration];
if (self.videoCamera.inputCamera) {
if (self.videoCamera.inputCamera.torchAvailable) {
NSError *err = nil;
if ([self.videoCamera.inputCamera lockForConfiguration:&err]) {
[self.videoCamera.inputCamera setTorchMode:(torch ? AVCaptureTorchModeOn : AVCaptureTorchModeOff) ];
[self.videoCamera.inputCamera unlockForConfiguration];
ret = (self.videoCamera.inputCamera.torchMode == AVCaptureTorchModeOn);
} else {
NSLog(@"Error while locking device for torch: %@", err);
ret = false;
}
} else {
NSLog(@"Torch not available in current camera input");
}
}
[session commitConfiguration];
_torch = ret;
}
- (BOOL)torch {
return self.videoCamera.inputCamera.torchMode;
}
- (void)setMirror:(BOOL)mirror {
_mirror = mirror;
}
- (void)setBeautyFace:(BOOL)beautyFace{
_beautyFace = beautyFace;
[self reloadFilter];
}
- (void)setBeautyLevel:(CGFloat)beautyLevel {
_beautyLevel = beautyLevel;
if (self.beautyFilter) {
[self.beautyFilter setBeautyLevel:_beautyLevel];
}
}
- (CGFloat)beautyLevel {
return _beautyLevel;
}
- (void)setBrightLevel:(CGFloat)brightLevel {
_brightLevel = brightLevel;
if (self.beautyFilter) {
[self.beautyFilter setBrightLevel:brightLevel];
}
}
- (CGFloat)brightLevel {
return _brightLevel;
}
- (void)setZoomScale:(CGFloat)zoomScale {
if (self.videoCamera && self.videoCamera.inputCamera) {
AVCaptureDevice *device = (AVCaptureDevice *)self.videoCamera.inputCamera;
if ([device lockForConfiguration:nil]) {
device.videoZoomFactor = zoomScale;
[device unlockForConfiguration];
_zoomScale = zoomScale;
}
}
}
- (CGFloat)zoomScale {
return _zoomScale;
}
- (void)setWarterMarkView:(UIView *)warterMarkView{
if(_warterMarkView && _warterMarkView.superview){
[_warterMarkView removeFromSuperview];
_warterMarkView = nil;
}
_warterMarkView = warterMarkView;
self.blendFilter.mix = warterMarkView.alpha;
[self.waterMarkContentView addSubview:_warterMarkView];
[self reloadFilter];
}
- (GPUImageUIElement *)uiElementInput{
if(!_uiElementInput){
_uiElementInput = [[GPUImageUIElement alloc] initWithView:self.waterMarkContentView];
}
return _uiElementInput;
}
- (GPUImageAlphaBlendFilter *)blendFilter{
if(!_blendFilter){
_blendFilter = [[GPUImageAlphaBlendFilter alloc] init];
_blendFilter.mix = 1.0;
[_blendFilter disableSecondFrameCheck];
}
return _blendFilter;
}
- (UIView *)waterMarkContentView{
if(!_waterMarkContentView){
_waterMarkContentView = [UIView new];
_waterMarkContentView.frame = CGRectMake(0, 0, self.configuration.videoSize.width, self.configuration.videoSize.height);
_waterMarkContentView.autoresizingMask = UIViewAutoresizingFlexibleWidth | UIViewAutoresizingFlexibleHeight;
}
return _waterMarkContentView;
}
- (GPUImageView *)gpuImageView{
if(!_gpuImageView){
_gpuImageView = [[GPUImageView alloc] initWithFrame:[UIScreen mainScreen].bounds];
[_gpuImageView setFillMode:kGPUImageFillModePreserveAspectRatioAndFill];
[_gpuImageView setAutoresizingMask:UIViewAutoresizingFlexibleWidth | UIViewAutoresizingFlexibleHeight];
}
return _gpuImageView;
}
-(UIImage *)currentImage{
if(_filter){
[_filter useNextFrameForImageCapture];
return _filter.imageFromCurrentFramebuffer;
}
return nil;
}
- (GPUImageMovieWriter*)movieWriter{
if(!_movieWriter){
_movieWriter = [[GPUImageMovieWriter alloc] initWithMovieURL:self.saveLocalVideoPath size:self.configuration.videoSize];
_movieWriter.encodingLiveVideo = YES;
_movieWriter.shouldPassthroughAudio = YES;
self.videoCamera.audioEncodingTarget = self.movieWriter;
}
return _movieWriter;
}
#pragma mark -- Custom Method
- (void)processVideo:(GPUImageOutput *)output {
__weak typeof(self) _self = self;
@autoreleasepool {
GPUImageFramebuffer *imageFramebuffer = output.framebufferForOutput;
CVPixelBufferRef pixelBuffer = [imageFramebuffer pixelBuffer];
if (pixelBuffer && _self.delegate && [_self.delegate respondsToSelector:@selector(captureOutput:pixelBuffer:)]) {
[_self.delegate captureOutput:_self pixelBuffer:pixelBuffer];
}
}
}
- (void)reloadFilter{
[self.filter removeAllTargets];
[self.blendFilter removeAllTargets];
[self.uiElementInput removeAllTargets];
[self.videoCamera removeAllTargets];
[self.output removeAllTargets];
[self.cropfilter removeAllTargets];
if (self.beautyFace) {
self.output = [[LFGPUImageEmptyFilter alloc] init];
self.filter = [[LFGPUImageBeautyFilter alloc] init];
self.beautyFilter = (LFGPUImageBeautyFilter*)self.filter;
} else {
self.output = [[LFGPUImageEmptyFilter alloc] init];
self.filter = [[LFGPUImageEmptyFilter alloc] init];
self.beautyFilter = nil;
}
///<
[self reloadMirror];
//< 480*640 4:3 16:9
if([self.configuration.avSessionPreset isEqualToString:AVCaptureSessionPreset640x480]){
CGRect cropRect = self.configuration.landscape ? CGRectMake(0, 0.125, 1, 0.75) : CGRectMake(0.125, 0, 0.75, 1);
self.cropfilter = [[GPUImageCropFilter alloc] initWithCropRegion:cropRect];
[self.videoCamera addTarget:self.cropfilter];
[self.cropfilter addTarget:self.filter];
}else{
[self.videoCamera addTarget:self.filter];
}
//<
if(self.warterMarkView){
[self.filter addTarget:self.blendFilter];
[self.uiElementInput addTarget:self.blendFilter];
[self.blendFilter addTarget:self.gpuImageView];
if(self.saveLocalVideo) [self.blendFilter addTarget:self.movieWriter];
[self.filter addTarget:self.output];
[self.uiElementInput update];
}else{
[self.filter addTarget:self.output];
[self.output addTarget:self.gpuImageView];
if(self.saveLocalVideo) [self.output addTarget:self.movieWriter];
}
[self.filter forceProcessingAtSize:self.configuration.videoSize];
[self.output forceProcessingAtSize:self.configuration.videoSize];
[self.blendFilter forceProcessingAtSize:self.configuration.videoSize];
[self.uiElementInput forceProcessingAtSize:self.configuration.videoSize];
//<
__weak typeof(self) _self = self;
[self.output setFrameProcessingCompletionBlock:^(GPUImageOutput *output, CMTime time) {
[_self processVideo:output];
}];
}
- (void)reloadMirror{
if(self.mirror && self.captureDevicePosition == AVCaptureDevicePositionFront){
self.videoCamera.horizontallyMirrorFrontFacingCamera = YES;
}else{
self.videoCamera.horizontallyMirrorFrontFacingCamera = NO;
}
}
#pragma mark Notification
- (void)willEnterBackground:(NSNotification *)notification {
[UIApplication sharedApplication].idleTimerDisabled = NO;
[self.videoCamera pauseCameraCapture];
runSynchronouslyOnVideoProcessingQueue(^{
glFinish();
});
}
- (void)willEnterForeground:(NSNotification *)notification {
[self.videoCamera resumeCameraCapture];
[UIApplication sharedApplication].idleTimerDisabled = YES;
}
- (void)statusBarChanged:(NSNotification *)notification {
NSLog(@"UIApplicationWillChangeStatusBarOrientationNotification. UserInfo: %@", notification.userInfo);
UIInterfaceOrientation statusBar = [[UIApplication sharedApplication] statusBarOrientation];
if(self.configuration.autorotate){
if (self.configuration.landscape) {
if (statusBar == UIInterfaceOrientationLandscapeLeft) {
self.videoCamera.outputImageOrientation = UIInterfaceOrientationLandscapeRight;
} else if (statusBar == UIInterfaceOrientationLandscapeRight) {
self.videoCamera.outputImageOrientation = UIInterfaceOrientationLandscapeLeft;
}
} else {
if (statusBar == UIInterfaceOrientationPortrait) {
self.videoCamera.outputImageOrientation = UIInterfaceOrientationPortraitUpsideDown;
} else if (statusBar == UIInterfaceOrientationPortraitUpsideDown) {
self.videoCamera.outputImageOrientation = UIInterfaceOrientationPortrait;
}
}
}
}
@end
```
|
```smalltalk
using System.Buffers;
namespace SixLabors.ImageSharp.Memory;
/// <summary>
/// A custom <see cref="IMemoryOwner{T}"/> that can wrap <see cref="IMemoryOwner{T}"/> of <see cref="byte"/> instances
/// and cast them to be <see cref="IMemoryOwner{T}"/> for any arbitrary unmanaged <typeparamref name="T"/> value type.
/// </summary>
/// <typeparam name="T">The value type to use when casting the wrapped <see cref="IMemoryOwner{T}"/> instance.</typeparam>
internal sealed class ByteMemoryOwner<T> : IMemoryOwner<T>
where T : unmanaged
{
private readonly IMemoryOwner<byte> memoryOwner;
private readonly ByteMemoryManager<T> memoryManager;
private bool disposedValue;
/// <summary>
/// Initializes a new instance of the <see cref="ByteMemoryOwner{T}"/> class.
/// </summary>
/// <param name="memoryOwner">The <see cref="IMemoryOwner{T}"/> of <see cref="byte"/> instance to wrap.</param>
public ByteMemoryOwner(IMemoryOwner<byte> memoryOwner)
{
this.memoryOwner = memoryOwner;
this.memoryManager = new ByteMemoryManager<T>(memoryOwner.Memory);
}
/// <inheritdoc/>
public Memory<T> Memory => this.memoryManager.Memory;
private void Dispose(bool disposing)
{
if (!this.disposedValue)
{
if (disposing)
{
this.memoryOwner.Dispose();
}
this.disposedValue = true;
}
}
/// <inheritdoc/>
public void Dispose()
{
// Do not change this code. Put cleanup code in 'Dispose(bool disposing)' method
this.Dispose(disposing: true);
}
}
```
|
```java
package com.dianping.zebra.filter.wall;
import java.security.NoSuchAlgorithmException;
import com.dianping.zebra.util.StringUtils;
import junit.framework.Assert;
import org.junit.Test;
public class SqlFlowIdGenerator {
@Test
public void test() throws NoSuchAlgorithmException {
String token = String.format("/*%s*/%s", "dianpingm3-m1-write", "SwitchsInfo.getAllSwitchsInfo");
String resultId = StringUtils.md5(token).substring(0, 8);
Assert.assertEquals("f14b190b", resultId);
}
}
```
|
Joseph Lalor (1811 – 18 August 1886) was a pioneering Irish mental health administrator and a reforming superintendent of the Richmond District Asylum for 29 years (1857–1886).
Early life
Joseph was born in 1811 at Cascade House, Freshford, County Kilkenny, the fourth and youngest son of Richard Lalor (c. 1760 – 1823), a prominent local landholder, and Mary Carroll. Joseph's older brother Richard Lalor (c. 1790 – 1846) of Cascade, a local magistrate and landholder, was involved in the meetings associated with the Tithe War of the 1830s alongside his first cousin Patrick "Patt" Lalor (1781–1856) of Tenakill later a nationalist MP for Queen's County. Joseph Lalor was reported as attending a meeting in favour of the Repeal Movement in 1830 at Freshford with his brothers William and Florence in 1830 and as contributing to 'Repeal Rent' to support the campaign in the 1840s. Other cousins were Alice Lalor (1768–1846) of Ballyragget, founder of the Order of Visitation Sisters in the United States. and Peter Lalor, the revolutionary Australian political leader. Joseph's brother, Richard J Lalor, served a term in the New York State Assembly (1860–62) and was editor of the Irish American newspaper.
Medical career
Joseph Lalor graduated from Trinity College Dublin in 1830 and with a MD from the University of Glasgow in 1839. He practised as a physician in Kilkenny, and held appointments in the City of Kilkenny Dispensary and Cholera Hospital and Workhouse, before he was appointed as the first resident physician of the Kilkenny District Asylum (1852–57). As McKeogh (p. 11) reports: “By any standards, he was a remarkably humane and enlightened man who can be justly hailed as one of the great pioneers of Irish psychiatry.” A strong supporter of ‘active employment or energetic muscular motion ... combined with amusements which have a soothing or cheering influence over the mind, with very good effect.’ Lalor also avoided mechanical restraints or seclusion as ‘treatments’ arguing: “Mild, moral treatment and not coercion has been found most conducive to the easy and successful management of the insane; and it is at the same time that which is dictated by those feelings of humanity which should direct our conduct towards our fellow beings, being so afflicted as the insane”.
In 1857, Lalor was appointed the Resident Medical Superintendent of the Richmond District Lunatic Asylum in Dublin, Ireland's largest with over 600 inmates (rising to over 1100 by 1885). He held this position for the next 29 years and came to be regarded as one of the most enlightened asylum superintendents in Europe, and Richmond became widely known for its enlightened methods of treatment. Early reforms included measures to arouse, animate and educate the inmates, although Lalor is best known for his strong belief in education and training, including the employment school teachers within the Asylum. Lalor described his approach in an 1878 article follows: "I consider that education and training are most valuable agents in the treatment of the insane of all classes, whether simply lunatics, or idiots and imbeciles, or criminal lunatics, and that it expresses in name and substance what has long been known in reference to lunatics in general as to their moral treatment ... .starting with the proposition that education and training form the basis of the moral treatment of all classes of the insane." Reading, singing and therapy were much cultivated, while object and picture lessons were given. Along with the schools, converts were given every fortnight, furnishings improved, and inmates encouraged to eat together. The leading British psychiatrist Dr Daniel Hack Tuke, in a review of the asylum services in Britain and Ireland, described Lalor as a "credit to Ireland" and wrote that his system of employment and training patients was more efficient than anything he had seen elsewhere.
On his retirement from Richmond in 1886, an article in the Irish Times (5/8/1886) paid the following tribute:
“The retirement of Joseph Lalor Esq MD from the position of Resident Medical Superintendent of the Richmond Lunatic Asylum is an event of considerable importance ... In Richmond, he has full scope for his undoubted genius and for the human projects which he both conceived and put into execution with a decision of character and a perseverance absolutely necessary in one holding his position ... The fame of Dr Lalor’s mode of treatment spread to all Irish asylums, to England , to the United States and even to Germany; superintendents of asylums came to the Richmond Asylum to see for themselves, and the records of their visits go to prove that Dr Lalor was universally regarded as a humane and courageous administrator, and a benefactor of his kind.”
The 1886 death of the “excellent and kind hearted Dr Lalor” was noted in the British Journal of Psychiatry: “It may in short be said that Dr Lalors administration was a great success and no one could visit the institution without being struck with the general comfort of the patients ... while the man himself could not fail to impress with his wonderful good nature, found of spirits and good humour, and the complete devotion of his mind to the interests of his patients.”
Later life
Joseph Lalor inherited a 439-acre property at Clintstown, 6 km east of Freshford co Kilkenny, which he held throughout his life. He was a foundation member of the Kilkenny Archaeological Society and the Statistical and Social Inquiry Society of Ireland. In 1861, he became the 7th president (and first Irish president) of the British Association of Medical Officers of Asylums and Hospitals for the Insane. He died 18 August 1886 at his son Richard's residence in Sligo aged 75.
Joseph married (1) Mary MacEnery (died c. 1838), (2) Mary Redmond (died before 1860), and (3) (c. 1862) to Ann Bridget Duckett (born c, 1837), and had at least seven children.
References
1811 births
1886 deaths
Irish psychiatrists
Irish healthcare managers
Members of Kilkenny Archaeological Society
People from Freshford, County Kilkenny
Alumni of Trinity College Dublin
Medical doctors from County Kilkenny
Alumni of the University of Glasgow
19th-century Irish medical doctors
|
Get Dexter (known as Crafton & Xunk in its country of origin, France), is a graphic adventure game, originally released for the Amstrad CPC in 1986. It was programmed by Remi Herbulot, with graphics by Michel Rho, and was published in France by ERE Informatique and by PSS in Britain. An Atari ST version was released in 1987. The game is played out in isometric area with a futuristic sci-fi plot with puzzle solving.
A sequel, Get Dexter 2, was released in 1988.
Plot
In 2912 a war rages on Earth and is escalating out of control. If the Central Galactic Control Computer on Earth is destroyed then all life on the planets will perish with it. The council of Sages give Dexter, an android expert in dangerous missions, and Scooter his trusty Podocephalus, the mission to infiltrate the computer centre and copy the memory in order that Galactic life can continue.
References
External links
Get Dexter at T.A.C.G.R. (The Amstrad Computer Games Resource
1986 video games
Amstrad CPC games
Atari ST games
Europe-exclusive video games
Video games developed in France
Personal Software Services games
Video games set in the 30th century
Single-player video games
|
Robert Trevors is a Canadian politician who was elected to the Legislative Assembly of New Brunswick in the 2010 provincial election. He represented the electoral district of Miramichi Centre as a member of the Progressive Conservatives until the 2014 election, when he was defeated by Bill Fraser in the redistributed riding of Miramichi.
References
Progressive Conservative Party of New Brunswick MLAs
Living people
Members of the Executive Council of New Brunswick
People from Miramichi, New Brunswick
21st-century Canadian politicians
Year of birth missing (living people)
|
```smalltalk
// ***********************************************************************
//
// Permission is hereby granted, free of charge, to any person obtaining
// a copy of this software and associated documentation files (the
// "Software"), to deal in the Software without restriction, including
// without limitation the rights to use, copy, modify, merge, publish,
// distribute, sublicense, and/or sell copies of the Software, and to
// permit persons to whom the Software is furnished to do so, subject to
// the following conditions:
//
// The above copyright notice and this permission notice shall be
// included in all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
// EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
// NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
// LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
// OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
// ***********************************************************************
using System;
using System.Reflection;
using System.Text;
namespace NUnit.Framework.Internal
{
/// <summary>
/// MethodHelper provides static methods for working with methods.
/// </summary>
public class MethodHelper
{
/// <summary>
/// Gets the display name for a method as used by NUnit.
/// </summary>
/// <param name="method">The method for which a display name is needed.</param>
/// <param name="arglist">The arguments provided.</param>
/// <returns>The display name for the method</returns>
public static string GetDisplayName(MethodInfo method, object[] arglist)
{
StringBuilder sb = new StringBuilder(method.Name);
#if CLR_2_0 || CLR_4_0
if (method.IsGenericMethod)
{
sb.Append("<");
int cnt = 0;
foreach (Type t in method.GetGenericArguments())
{
if (cnt++ > 0) sb.Append(",");
sb.Append(t.Name);
}
sb.Append(">");
}
#endif
if (arglist != null)
{
sb.Append("(");
for (int i = 0; i < arglist.Length; i++)
{
if (i > 0) sb.Append(",");
sb.Append(GetDisplayString(arglist[i]));
}
sb.Append(")");
}
return sb.ToString();
}
private static string GetDisplayString(object arg)
{
string display = arg == null
? "null"
: Convert.ToString(arg, System.Globalization.CultureInfo.InvariantCulture);
if (arg is double)
{
double d = (double)arg;
if (double.IsNaN(d))
display = "double.NaN";
else if (double.IsPositiveInfinity(d))
display = "double.PositiveInfinity";
else if (double.IsNegativeInfinity(d))
display = "double.NegativeInfinity";
else if (d == double.MaxValue)
display = "double.MaxValue";
else if (d == double.MinValue)
display = "double.MinValue";
else
{
if (display.IndexOf('.') == -1)
display += ".0";
display += "d";
}
}
else if (arg is float)
{
float f = (float)arg;
if (float.IsNaN(f))
display = "float.NaN";
else if (float.IsPositiveInfinity(f))
display = "float.PositiveInfinity";
else if (float.IsNegativeInfinity(f))
display = "float.NegativeInfinity";
else if (f == float.MaxValue)
display = "float.MaxValue";
else if (f == float.MinValue)
display = "float.MinValue";
else
{
if (display.IndexOf('.') == -1)
display += ".0";
display += "f";
}
}
else if (arg is decimal)
{
decimal d = (decimal)arg;
if (d == decimal.MinValue)
display = "decimal.MinValue";
else if (d == decimal.MaxValue)
display = "decimal.MaxValue";
else
display += "m";
}
else if (arg is long)
{
long l = (long)arg;
if (l == long.MinValue)
display = "long.MinValue";
else if (l == long.MinValue)
display = "long.MaxValue";
else
display += "L";
}
else if (arg is ulong)
{
ulong ul = (ulong)arg;
if (ul == ulong.MinValue)
display = "ulong.MinValue";
else if (ul == ulong.MinValue)
display = "ulong.MaxValue";
else
display += "UL";
}
else if (arg is string)
{
StringBuilder sb = new StringBuilder();
sb.Append("\"");
foreach (char c in (string)arg)
sb.Append(EscapeControlChar(c));
sb.Append("\"");
display = sb.ToString();
}
else if (arg is char)
{
display = "\'" + EscapeControlChar((char)arg) + "\'";
}
else if (arg is int)
{
int ival = (int)arg;
if (ival == int.MaxValue)
display = "int.MaxValue";
else if (ival == int.MinValue)
display = "int.MinValue";
}
return display;
}
private static string EscapeControlChar(char c)
{
switch (c)
{
case '\'':
return "\\\'";
case '\"':
return "\\\"";
case '\\':
return "\\\\";
case '\0':
return "\\0";
case '\a':
return "\\a";
case '\b':
return "\\b";
case '\f':
return "\\f";
case '\n':
return "\\n";
case '\r':
return "\\r";
case '\t':
return "\\t";
case '\v':
return "\\v";
case '\x0085':
case '\x2028':
case '\x2029':
return string.Format("\\x{0:X4}", (int)c);
default:
return c.ToString();
}
}
#if NET_4_5
/// <summary>
/// Returns true if the method specified by the argument
/// is an async method.
/// </summary>
public static bool IsAsyncMethod(MethodInfo method)
{
return method.IsDefined(typeof(System.Runtime.CompilerServices.AsyncStateMachineAttribute));
}
#endif
}
}
```
|
is a 2012 Japanese animated action fantasy film based on the Pretty Cure franchise created by Izumi Todo. The film is directed by Junji Shimizu, written by Yoshimi Narita, and produced by Toei Animation. The film was released in Japan on March 17, 2012.
Marking the fourth entry to the Pretty Cure All Stars crossover film series, and the first installment to the New Stage trilogy, the Smile PreCure! team joins the previous Pretty Cure teams as they encounter Fusion once again, while befriending a girl named Ayumi.
Plot
In Yokohama, Fusion reappears once again and threatens the city with calamity. Then, the Pretty Cures assemble and defeats Fusion again, scattering its parts around the city. Meanwhile, a girl named Ayumi Sakagami, who admires the Pretty Cures and witnesses the battle against Fusion, is having trouble making friends at her new school. On her way back home, Ayumi meets a small creature, and decides to name it "Fū-chan". Meanwhile, the fairies: Tart, Chiffon, Chypre, Coffret, Potpurri, Hummy and Candy gather for a meeting, and notices that Fusion's scattered parts are looking to recombine, so they all go and ask their respective Pretty Cure teams to search for the fragments to prevent its return.
While searching for the fragments, Miyuki encounters the Suite PreCure teams: Hibiki, Kanade, Ellen and Ako, whom all transforms and fight the fragments. Meanwhile, Ayumi notices that people around here are disappearing, and Fū-chan admits he did this for Ayumi in case anyone makes Ayumi suffer. Then, the Smile PreCure! teams assemble and fights Fū-chan, but shocked as he's absorbing their attacks. As the Suite team arrives to assist them, Ayumi stops them from hurting him. The Cures reveal to her that Fū-chan is a fragment of Fusion, and Fū-chan runs away as he tries to make Ayumi's wish granted while destroying the city.
While accompanied by Smile and Suite teams, as well as HeartCatch PreCure! and Fresh Pretty Cure teams, Ayumi is caught by Fusion's familiars, which in her heart's response to Fū-chan, she transforms into Cure Echo. Using the power of the Miracle Lights and aided by latter Pretty Cure teams: Futari wa Pretty Cure Max Heart, Futari wa Pretty Cure Splash Star, and Yes! PreCure 5 GoGo!, Echo rekindles her friendship with Fū-chan. As the remaining Fusion fragments gets ready to attack Ayumi, Fū-chan sacrifices himself to give the Smile team the powers to defeat the evil side. Afterwards, Ayumi grows more confident and starts making friends with her classmates.
Voice cast
Smile PreCure! cast
Misato Fukuen as Miyuki Hoshizora/Cure Happy
Asami Tano as Akane Hino/Cure Sunny
Hisako Kanemoto as Yayoi Kise/Cure Peace
Marina Inoue as Nao Midorikawa/Cure March
Chinami Nishimura as Reika Aoki/Cure Beauty
Ikue Ōtani as Candy
Suite PreCure cast
Ami Koshimizu as Hibiki Hojo/Cure Melody
Fumiko Orikasa as Kanade Minamino/Cure Rhythm
Megumi Toyoguchi as Siren/Ellen Kurokawa/Cure Beat
Rumi Okubo as Ako Shirabe/Cure Muse
Kotono Mitsuishi as Hummy
HeartCatch PreCure! cast
Nana Mizuki as Tsubomi Hanasaki/Cure Blossom
Fumie Mizusawa as Erika Kurumi/Cure Marine
Houko Kuwashima as Itsuki Miyoudouin/Cure Sunshine
Aya Hisakawa as Yuri Tsukikage/Cure Moonlight
Taeko Kawata as Chypre
Motoko Kumai as Coffret
Kokoro Kikuchi as Potpurri
Fresh Pretty Cure! cast
Kanae Oki as Love Momozono/Cure Peach
Eri Kitamura as Miki Aono/Cure Berry
Akiko Nakagawa as Inori Yamabuki/Cure Pine
Yuka Komatsu as Setsuna Higashi/Cure Passion
Taiki Matsuno as Tart
Satomi Kōrogi as Chiffon
Film characters
Mamiko Noto as Ayumi Sakagami/Cure Echo
Tamao Akae as Ayumi's mother
Takehito Koyasu as Fusion
Sea Kumada as Fuu-chan
Production
On November 2011, it was announced that new Pretty Cure All Stars was in development, featuring the villain Fusion from the very first film. Pretty Cure episode director Junji Shimizu will act as a director, and Yes! PreCure 5 GoGo! head writer Yoshimi Narita will provide the screenplay, while Mitsuru Aoyama will return from Pretty Cure All Stars DX trilogy to design the characters and provide the animation direction for the film, and music composer Yasuharu Takanashi. A Yokohama city tie-in campaign was announced on February 2012 by its city mayor, Fumiko Hayashi.
Release
The film was released in theaters in Japan on March 17, 2012.
Reception
Box office
The film ranked number 5 out of top 10 in the Japanese box office in its fourth weekend.
References
External links
2010s Japanese films
2012 anime films
2012 films
Pretty Cure films
Animated films based on animated series
Toei Animation films
Japanese magical girl films
Crossover anime and manga
Films scored by Yasuharu Takanashi
Animated films set in Yokohama
|
In classical and late antiquity wreaths or crowns (; ) usually made of vegetation or precious metals were worn on ceremonial occasions and were awarded for various achievements. The symbolism of these different types of wreaths depended on their composition; different crowns were worn and awarded for different purposes. Such wreaths or crowns were represented in classical architecture, in ancient Greek art and sculpture, and in Roman art and sculpture. As well as being awarded for merit and military conduct, they were worn by orators, priests performing sacrifices, by the chorus in ancient Greek drama, and by attendees of a symposium.
From Archaic Greece until late antiquity, wreaths were the prizes competed for at the Panhellenic Games – the Olympic, Pythian, Nemean, and Isthmian Games – the "crown games", each with a different vegetation crown awarded. In the military of ancient Rome, wreaths were among the traditional Roman military decorations; as a result of the revival in ancient artistic and literary models in the Renaissance they are frequently encountered in Western art and heraldry.
Wreaths of leaves from laurel, olive, oak, myrtle, and celery were particularly symbolically significant, with the laurel wreath the victor's crown at the Pythian Games and at a Roman triumph, and the olive wreath the prize at the Olympic Games. Symposiasts wore crowns of roses, while maenads and other followers of Dionysus wore wreaths of ivy or of vine leaves. The highest martial distinction possible in the Roman state was a wreath of grass. In Classical Greece, gold crowns were commonly sent – and recorded in inscriptions – as tribute to the renowned shrines of Delos and Athens by members of the Delian League. Until Late Antiquity, gold crowns became a tribute demanded by the Roman Empire from cities under its rule. In such cases, an actual crown was frequently never made and the nominal value was often paid in silver.
Function
As can be inferred from Apuleius's The Golden Ass and Aristophanes's Plutus, to wear a wreath was a sign of distinction, and an assault on a wreath's wearer was considered especially blameworthy. According to Tertullian's De corona, the wearing of wreaths was an ancient practice. Indeed, it was rare for religious rites and cult practices to omit the wearing of wreaths. Priests wore wreaths for the performance of sacrifices, as did other participants in the ceremony and the sacrificial victim. Similarly, altars, statues, and religious buildings and accoutrements could all be wreathed. Wreaths were sacred objects, and removing one and disposing of it could not be done casually or without due reverence, neither could an unauthorized person wear one without committing sacrilege.
Different wreaths were worn, depending on the god or goddess to be propitiated. Laurel wreaths were appropriate Apollo and his father Zeus (Jupiter), as well as for Aphrodite (Venus). The mother-and-daughter fertility goddesses Demeter and Persephone (Ceres and Proserpina) were honoured with crowns of ears of corn. The cult of Dionysus (Bacchus) was associated with wreaths of ivy and vines.
Besides sacrificial rituals, festival rites of marriage, birth, and death all involved wreaths. As in Catullus's Poem 61 and Apuleius's The Golden Ass, couples to be married were both wreathed on the occasion. To mark the occasion of a new birth, the household would hang a wreath of olive or wool on the door. As part of ancient funerary practice, the death were wreathed, funerary urns were wreathed, and wreaths were lain on and within tombs. Euripides's The Trojan Women, Athenaeus's Deipnosophistae, and Pliny's Natural History all include references to the dead as wreathed, while Pliny even mentions a raven, celebrated talking as a talking bird, being awarded wreaths at its lavish funeral. Funerary monuments might be painted with wreaths as well as hung with them, and from the Hellenistic period, wreaths awarded to the deceased during a lifetime could be carved on the monument marking the grave.
According to the Deipnosophistae, it was the god Dionysus that introduced the practice of wearing wreaths at symposia; he had worn an ivy wreath to ward off the ill-effects of drinking wine. Wreaths of roses, violets, or myrtle leaves were also appropriate to be worn by symposiasts. The vessels from which wine was distributed to the attendees were themselves wreathed. According to Petronius's Satyricon, even the hands and feet of symposiasts might be wreathed. A wreath might be left as a token of love on the door of the object of one's affections on the night-time ritual procession that followed (a komos), as in the Palatine Anthology and in the work of Theocritus.
Wreaths were also worn in preparation for war; artistic representations might show both victors and vanquished wearing wreaths. According to Herodotus's Histories, the Spartans wreathed themselves in preparation for battle. Wreaths as the prize of victory in athletic competitions were comparable to the awarding wreaths for military accomplishments, as at a Roman triumph. From the Hellenistic period onwards, wreaths had become a prestigious and established awards for merit and virtue in the polis.
Greek and Hellenistic gold funerary crowns; these are the main type to survive
Crown Games
Every four years the wild olive tree Olea oleaster () growing at Olympia provided the branches to fashion the crowns which were awarded at the ancient Olympic Games in honour of Zeus (Jupiter). At the Pythian Games at Delphi, also held every four years, the bay laurel Laurus nobilis – sacred to Apollo – was used for the crowns awarded. At Nemea, a crown of wild celery was awarded to the victor at the Nemean Games, held every two years in honour of Heracles (Hercules) and Zeus. In honour of Poseidon (Neptune), every two years at Isthmia on the Isthmus of Corinth a crown of pine was awarded at the Isthmian Games, though according to Pliny the Elder's encyclopaedic Natural History, the prize was originally a wreath of celery, as at Nemea. At the Panathenaic Games instituted during Classical Greece, the prize was a crown of olive.
Rome
Laurel wreaths from the bay laurel tree Laurus nobilis were worn by triumphatores – victorious generals celebrating a Roman triumph. Generals awarded a lesser celebration ritual, the ovation () wore wreaths of myrtle (Myrtus communis).
Wreaths () were awarded as military awards and decorations. In the Roman Republic, the nature of the feat determined the nature of the wreath awarded. It was a custom for soldiers rescued from a siege to present a wreath made of grass ( or ) to the commander of the relieving force. This award was extremely rare, and Pliny the Elder enumerated only eight times occasions that had warranted the honour, ending with the emperor Augustus. The oak leaf civic crown () was awarded to Romans who had saved the life of another citizen in battle. The award was open to soldiers in the Roman army of all ranks, unlike most other wreaths, which were awarded to commanders and officers only in the Roman imperial period of the Roman Empire.
A gold wreath () was also awarded for gallant military conduct. In the Roman navy, the naval crown (, , or ) was a wreath awarded for feats in naval battles. In an assault on a fortified position, a mural crown () was awarded to the first man onto the walls of the enemy fortification.
Crowns became essential parts of the regalia of the Roman emperors during the Roman imperial period. The laurel wreaths of a triumphator were often worn by imperial portraits, as were radiate crowns.
According to Pliny the Elder, the Arval Brethren, an ancient Roman priesthood, were accustomed to wear a wreath of grain sheaves.
Crowns and wreaths were associated by early Christians with Roman paganism and Hellenistic religion. The 2nd and 3rd century Latin theologian Tertullian opposed the wearing of wreaths in his work . This opposition had little effect, and Christian martyrs were lauded as having won "martyrs' crowns".
Roman coins
Late Antiquity
Radiate crowns were associated with the sun, and the 3rd-century Roman emperors issued coins – antoniniani – with the imperial portrait wearing a radiate crown. Soon after the Christianization of the Roman Empire in the reign of Constantine the Great (), the radiate crown disappeared from official use. Constantine began the practice of wearing a diadem on coinage, hitherto avoided by the Romans and a symbol of the kingdoms of the Hellenistic period. Thereafter, the laurel wreath was usually the crown of a caesar, a junior imperial rank, while the diadem was worn by an augustus. Imperial diadems could be plain bands, or adorned with pearls or with rosettes. Emperors were frequently shown crowned by Victory or another protective deity on their coinage and medallions, and later this function was performed by the hand of God ().
A coronation linked with an individual's accession to imperial rank is first attested in the 4th century; the Roman army participated in the ceremonies, as well as the Roman Senate or the Byzantine Senate. After the imperial capital settled at Constantinople in the reign of Arcadius (), the urban population also played a particular role.
After the fall of the western Roman empire during the late 5th century, crowns in the post-Roman west, as in the eastern Roman empire, crowns were more elaborate than previously, constructed from beaten gold and ornamented with precious stones. Some were also endowed with relics, making them reliquaries.
From the 7th century Visigothic Kingdom survive the many gold votive crowns of the Treasure of Guarrazar, among which is the crown of the Visigothic king Recceswinth (). These crowns were never to be worn, and were votive offerings. The oldest royal crown to survive is likely the Iron Crown of Lombardy, whose present form dates from the 8th or 9th centuries.
See also
Radiate crown
References
Crowns (headgear)
Hellenistic art
Iconography
Ancient Roman jewellery
Ancient Roman culture
Ancient Greek culture
Military awards and decorations of ancient Rome
Headgear
|
```html
<!DOCTYPE html>
<html xmlns="path_to_url"><head><title>Flatten_Sig (owl-base.Owl_computation_engine_sig.Flatten_Sig)</title><meta charset="utf-8"/><link rel="stylesheet" href="../../../odoc.support/odoc.css"/><meta name="generator" content="odoc 2.4.2"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../odoc.support/highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body class="odoc"><nav class="odoc-nav"><a href="../index.html">Up</a> <a href="../../index.html">owl-base</a> » <a href="../index.html">Owl_computation_engine_sig</a> » Flatten_Sig</nav><header class="odoc-preamble"><h1>Module type <code><span>Owl_computation_engine_sig.Flatten_Sig</span></code></h1></header><div class="odoc-content"><div class="odoc-include"><details open="open"><summary class="spec include"><code><span><span class="keyword">include</span> <a href="../../Owl_types_computation_engine/module-type-Sig/index.html">Owl_types_computation_engine.Sig</a></span></code></summary><div class="odoc-spec"><div class="spec module anchored" id="module-Graph"><a href="#module-Graph" class="anchor"></a><code><span><span class="keyword">module</span> <a href="Graph/index.html">Graph</a></span><span> : <a href="../../Owl_computation_graph_sig/module-type-Sig/index.html">Owl_computation_graph_sig.Sig</a></span></code></div></div><h6 id="core-evaluation-functions-of-the-engine"><a href="#core-evaluation-functions-of-the-engine" class="anchor"></a>Core evaluation functions of the engine</h6><div class="odoc-spec"><div class="spec value anchored" id="val-eval_arr"><a href="#val-eval_arr" class="anchor"></a><code><span><span class="keyword">val</span> eval_arr : <span><span><a href="Graph/Optimiser/Operator/Symbol/Shape/Type/index.html#type-arr">Graph.Optimiser.Operator.Symbol.Shape.Type.arr</a> array</span> <span class="arrow">-></span></span> unit</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-eval_elt"><a href="#val-eval_elt" class="anchor"></a><code><span><span class="keyword">val</span> eval_elt : <span><span><a href="Graph/Optimiser/Operator/Symbol/Shape/Type/index.html#type-elt">Graph.Optimiser.Operator.Symbol.Shape.Type.elt</a> array</span> <span class="arrow">-></span></span> unit</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-eval_graph"><a href="#val-eval_graph" class="anchor"></a><code><span><span class="keyword">val</span> eval_graph : <span><a href="Graph/index.html#type-graph">Graph.graph</a> <span class="arrow">-></span></span> unit</span></code></div><div class="spec-doc"><p>TODO</p></div></div></details></div><div class="odoc-include"><details open="open"><summary class="spec include"><code><span><span class="keyword">include</span> <a href="../../Owl_computation_graph_sig/module-type-Sig/index.html">Owl_computation_graph_sig.Sig</a></span></code></summary><div class="odoc-spec"><div class="spec module anchored" id="module-Optimiser"><a href="#module-Optimiser" class="anchor"></a><code><span><span class="keyword">module</span> <a href="Optimiser/index.html">Optimiser</a></span><span> : <a href="../../Owl_computation_optimiser_sig/module-type-Sig/index.html">Owl_computation_optimiser_sig.Sig</a></span></code></div></div><h6 id="type-definition"><a href="#type-definition" class="anchor"></a>Type definition</h6><div class="odoc-spec"><div class="spec type anchored" id="type-graph"><a href="#type-graph" class="anchor"></a><code><span><span class="keyword">type</span> graph</span></code></div><div class="spec-doc"><p>TODO</p></div></div><h6 id="core-functions"><a href="#core-functions" class="anchor"></a>Core functions</h6><div class="odoc-spec"><div class="spec value anchored" id="val-shape_or_value"><a href="#val-shape_or_value" class="anchor"></a><code><span><span class="keyword">val</span> shape_or_value : <span><a href="Optimiser/Operator/Symbol/Shape/Type/index.html#type-t">Optimiser.Operator.Symbol.Shape.Type.t</a> <span class="arrow">-></span></span> string</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-graph_to_dot"><a href="#val-graph_to_dot" class="anchor"></a><code><span><span class="keyword">val</span> graph_to_dot : <span><a href="#type-graph">graph</a> <span class="arrow">-></span></span> string</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-graph_to_trace"><a href="#val-graph_to_trace" class="anchor"></a><code><span><span class="keyword">val</span> graph_to_trace : <span><a href="#type-graph">graph</a> <span class="arrow">-></span></span> string</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-save_graph"><a href="#val-save_graph" class="anchor"></a><code><span><span class="keyword">val</span> save_graph : <span><span class="type-var">'a</span> <span class="arrow">-></span></span> <span>string <span class="arrow">-></span></span> unit</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-load_graph"><a href="#val-load_graph" class="anchor"></a><code><span><span class="keyword">val</span> load_graph : <span>string <span class="arrow">-></span></span> <span class="type-var">'a</span> * <span class="type-var">'b</span></span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-collect_rvs"><a href="#val-collect_rvs" class="anchor"></a><code><span><span class="keyword">val</span> collect_rvs :
<span><span><span><a href="Optimiser/Operator/Symbol/Shape/Type/index.html#type-attr">Optimiser.Operator.Symbol.Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> array</span> <span class="arrow">-></span></span>
<span><span><a href="Optimiser/Operator/Symbol/Shape/Type/index.html#type-attr">Optimiser.Operator.Symbol.Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> array</span></span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-invalidate_rvs"><a href="#val-invalidate_rvs" class="anchor"></a><code><span><span class="keyword">val</span> invalidate_rvs : <span><a href="#type-graph">graph</a> <span class="arrow">-></span></span> unit</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-make_graph"><a href="#val-make_graph" class="anchor"></a><code><span><span class="keyword">val</span> make_graph :
<span><span class="label">input</span>:<span><span><a href="Optimiser/Operator/Symbol/Shape/Type/index.html#type-attr">Optimiser.Operator.Symbol.Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> array</span> <span class="arrow">-></span></span>
<span><span class="label">output</span>:<span><span><a href="Optimiser/Operator/Symbol/Shape/Type/index.html#type-attr">Optimiser.Operator.Symbol.Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> array</span> <span class="arrow">-></span></span>
<span>string <span class="arrow">-></span></span>
<a href="#type-graph">graph</a></span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-get_inputs"><a href="#val-get_inputs" class="anchor"></a><code><span><span class="keyword">val</span> get_inputs :
<span><a href="#type-graph">graph</a> <span class="arrow">-></span></span>
<span><span><a href="Optimiser/Operator/Symbol/Shape/Type/index.html#type-attr">Optimiser.Operator.Symbol.Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> array</span></span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-get_outputs"><a href="#val-get_outputs" class="anchor"></a><code><span><span class="keyword">val</span> get_outputs :
<span><a href="#type-graph">graph</a> <span class="arrow">-></span></span>
<span><span><a href="Optimiser/Operator/Symbol/Shape/Type/index.html#type-attr">Optimiser.Operator.Symbol.Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> array</span></span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-get_node_arr_val"><a href="#val-get_node_arr_val" class="anchor"></a><code><span><span class="keyword">val</span> get_node_arr_val :
<span><span><a href="Optimiser/Operator/Symbol/Shape/Type/index.html#type-attr">Optimiser.Operator.Symbol.Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span>
<a href="Optimiser/Operator/Symbol/Shape/Type/Device/A/index.html#type-arr">Optimiser.Operator.Symbol.Shape.Type.Device.A.arr</a></span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-get_node_elt_val"><a href="#val-get_node_elt_val" class="anchor"></a><code><span><span class="keyword">val</span> get_node_elt_val :
<span><span><a href="Optimiser/Operator/Symbol/Shape/Type/index.html#type-attr">Optimiser.Operator.Symbol.Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span>
<a href="Optimiser/Operator/Symbol/Shape/Type/Device/A/index.html#type-elt">Optimiser.Operator.Symbol.Shape.Type.Device.A.elt</a></span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-set_node_arr_val"><a href="#val-set_node_arr_val" class="anchor"></a><code><span><span class="keyword">val</span> set_node_arr_val :
<span><span><a href="Optimiser/Operator/Symbol/Shape/Type/index.html#type-attr">Optimiser.Operator.Symbol.Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span>
<span><a href="Optimiser/Operator/Symbol/Shape/Type/Device/index.html#type-value">Optimiser.Operator.Symbol.Shape.Type.Device.value</a> <span class="arrow">-></span></span>
unit</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-set_node_elt_val"><a href="#val-set_node_elt_val" class="anchor"></a><code><span><span class="keyword">val</span> set_node_elt_val :
<span><span><a href="Optimiser/Operator/Symbol/Shape/Type/index.html#type-attr">Optimiser.Operator.Symbol.Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span>
<span><a href="Optimiser/Operator/Symbol/Shape/Type/Device/index.html#type-value">Optimiser.Operator.Symbol.Shape.Type.Device.value</a> <span class="arrow">-></span></span>
unit</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-is_iopair_safe"><a href="#val-is_iopair_safe" class="anchor"></a><code><span><span class="keyword">val</span> is_iopair_safe : <span><span><span class="type-var">'a</span> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span> <span><span><span class="type-var">'a</span> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span> bool</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-make_iopair"><a href="#val-make_iopair" class="anchor"></a><code><span><span class="keyword">val</span> make_iopair :
<span><a href="#type-graph">graph</a> <span class="arrow">-></span></span>
<span><span><span><a href="Optimiser/Operator/Symbol/Shape/Type/index.html#type-attr">Optimiser.Operator.Symbol.Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> array</span> <span class="arrow">-></span></span>
<span><span><span><a href="Optimiser/Operator/Symbol/Shape/Type/index.html#type-attr">Optimiser.Operator.Symbol.Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> array</span> <span class="arrow">-></span></span>
unit</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-update_iopair"><a href="#val-update_iopair" class="anchor"></a><code><span><span class="keyword">val</span> update_iopair : <span><a href="#type-graph">graph</a> <span class="arrow">-></span></span> unit</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-remove_unused_iopair"><a href="#val-remove_unused_iopair" class="anchor"></a><code><span><span class="keyword">val</span> remove_unused_iopair :
<span><span><span><span class="type-var">'a</span> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> array</span> <span class="arrow">-></span></span>
<span><span><span class="type-var">'b</span> array</span> <span class="arrow">-></span></span>
<span><span><span class="type-var">'a</span> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> array</span> * <span><span class="type-var">'b</span> array</span></span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-init_inputs"><a href="#val-init_inputs" class="anchor"></a><code><span><span class="keyword">val</span> init_inputs :
<span><span>(<span><span><a href="Optimiser/Operator/Symbol/Shape/Type/index.html#type-attr">Optimiser.Operator.Symbol.Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span>
<a href="Optimiser/Operator/Symbol/Shape/Type/Device/index.html#type-value">Optimiser.Operator.Symbol.Shape.Type.Device.value</a>)</span> <span class="arrow">-></span></span>
<span><a href="#type-graph">graph</a> <span class="arrow">-></span></span>
unit</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-optimise"><a href="#val-optimise" class="anchor"></a><code><span><span class="keyword">val</span> optimise : <span><a href="#type-graph">graph</a> <span class="arrow">-></span></span> unit</span></code></div><div class="spec-doc"><p>TODO</p></div></div></details></div><div class="odoc-include"><details open="open"><summary class="spec include"><code><span><span class="keyword">include</span> <a href="../../Owl_computation_optimiser_sig/module-type-Sig/index.html">Owl_computation_optimiser_sig.Sig</a></span></code></summary><div class="odoc-spec"><div class="spec module anchored" id="module-Operator"><a href="#module-Operator" class="anchor"></a><code><span><span class="keyword">module</span> <a href="Operator/index.html">Operator</a></span><span> : <a href="../../Owl_computation_operator_sig/module-type-Sig/index.html">Owl_computation_operator_sig.Sig</a></span></code></div></div><h6 id="core-functions_2"><a href="#core-functions_2" class="anchor"></a>Core functions</h6><div class="odoc-spec"><div class="spec value anchored" id="val-estimate_complexity"><a href="#val-estimate_complexity" class="anchor"></a><code><span><span class="keyword">val</span> estimate_complexity : <span><span><span><span class="type-var">'a</span> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> array</span> <span class="arrow">-></span></span> int * int</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-optimise_nodes"><a href="#val-optimise_nodes" class="anchor"></a><code><span><span class="keyword">val</span> optimise_nodes :
<span><span><span><a href="Operator/Symbol/Shape/Type/index.html#type-attr">Operator.Symbol.Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> array</span> <span class="arrow">-></span></span>
unit</span></code></div><div class="spec-doc"><p>TODO</p></div></div></details></div><div class="odoc-include"><details open="open"><summary class="spec include"><code><span><span class="keyword">include</span> <a href="../../Owl_computation_operator_sig/module-type-Sig/index.html">Owl_computation_operator_sig.Sig</a></span></code></summary><div class="odoc-spec"><div class="spec module anchored" id="module-Symbol"><a href="#module-Symbol" class="anchor"></a><code><span><span class="keyword">module</span> <a href="Symbol/index.html">Symbol</a></span><span> : <a href="../../Owl_computation_symbol_sig/module-type-Sig/index.html">Owl_computation_symbol_sig.Sig</a></span></code></div></div><h6 id="vectorised-functions"><a href="#vectorised-functions" class="anchor"></a>Vectorised functions</h6><div class="odoc-spec"><div class="spec value anchored" id="val-noop"><a href="#val-noop" class="anchor"></a><code><span><span class="keyword">val</span> noop : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>noop arr</code> performs no operation on the array <code>arr</code> and returns it as is. This can be useful as a placeholder function. Returns the input array <code>arr</code>.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-empty"><a href="#val-empty" class="anchor"></a><code><span><span class="keyword">val</span> empty : <span><span>int array</span> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>empty shape</code> creates an uninitialized array with the specified <code>shape</code>. The contents of the array are undefined. Returns a new array with the given shape.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-zeros"><a href="#val-zeros" class="anchor"></a><code><span><span class="keyword">val</span> zeros : <span><span>int array</span> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>zeros shape</code> creates an array with the specified <code>shape</code>, filled with zeros. Returns a new array with all elements initialized to zero.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-ones"><a href="#val-ones" class="anchor"></a><code><span><span class="keyword">val</span> ones : <span><span>int array</span> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>ones shape</code> creates an array with the specified <code>shape</code>, filled with ones. Returns a new array with all elements initialized to one.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-create"><a href="#val-create" class="anchor"></a><code><span><span class="keyword">val</span> create : <span><span>int array</span> <span class="arrow">-></span></span> <span><a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>create shape value</code> creates an array with the specified <code>shape</code>, filled with the given <code>value</code>. Returns a new array with all elements initialized to <code>value</code>.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-sequential"><a href="#val-sequential" class="anchor"></a><code><span><span class="keyword">val</span> sequential :
<span><span class="optlabel">?a</span>:<a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span>
<span><span class="optlabel">?step</span>:<a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>sequential ?a ?step shape</code> creates an array with the specified <code>shape</code>, filled with a sequence of values starting from <code>a</code> with a step of <code>step</code>. If <code>a</code> is not provided, the sequence starts from 0. If <code>step</code> is not provided, the step size is 1. Returns a new array with sequential values.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-uniform"><a href="#val-uniform" class="anchor"></a><code><span><span class="keyword">val</span> uniform :
<span><span class="optlabel">?a</span>:<a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span>
<span><span class="optlabel">?b</span>:<a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>uniform ?a ?b shape</code> creates an array with the specified <code>shape</code>, filled with random values drawn from a uniform distribution over [a, b\). If <code>a</code> and <code>b</code> are not provided, the default range is [0, 1\) . Returns a new array with uniform random values.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-gaussian"><a href="#val-gaussian" class="anchor"></a><code><span><span class="keyword">val</span> gaussian :
<span><span class="optlabel">?mu</span>:<a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span>
<span><span class="optlabel">?sigma</span>:<a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>gaussian ?mu ?sigma shape</code> creates an array with the specified <code>shape</code>, filled with random values drawn from a Gaussian distribution with mean <code>mu</code> and standard deviation <code>sigma</code>. If <code>mu</code> is not provided, the default mean is 0. If <code>sigma</code> is not provided, the default standard deviation is 1. Returns a new array with Gaussian random values.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-bernoulli"><a href="#val-bernoulli" class="anchor"></a><code><span><span class="keyword">val</span> bernoulli : <span><span class="optlabel">?p</span>:<a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span> <span><span>int array</span> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>bernoulli ?p shape</code> creates an array with the specified <code>shape</code>, filled with random values drawn from a Bernoulli distribution with probability <code>p</code> of being 1. If <code>p</code> is not provided, the default probability is 0.5. Returns a new array with Bernoulli random values.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-init"><a href="#val-init" class="anchor"></a><code><span><span class="keyword">val</span> init : <span><span>int array</span> <span class="arrow">-></span></span> <span><span>(<span>int <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a>)</span> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>init shape f</code> creates an array with the specified <code>shape</code>, where each element is initialized using the function <code>f</code>. The function <code>f</code> takes the linear index of the element as input. Returns a new array with elements initialized by the function <code>f</code>.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-init_nd"><a href="#val-init_nd" class="anchor"></a><code><span><span class="keyword">val</span> init_nd :
<span><span>int array</span> <span class="arrow">-></span></span>
<span><span>(<span><span>int array</span> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a>)</span> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>init_nd shape f</code> creates an array with the specified <code>shape</code>, where each element is initialized using the function <code>f</code>. The function <code>f</code> takes the multidimensional index of the element as input. Returns a new array with elements initialized by the function <code>f</code>.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-shape"><a href="#val-shape" class="anchor"></a><code><span><span class="keyword">val</span> shape : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <span>int array</span></span></code></div><div class="spec-doc"><p><code>shape arr</code> returns the shape of the array <code>arr</code> as an array of integers, each representing the size of the corresponding dimension.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-numel"><a href="#val-numel" class="anchor"></a><code><span><span class="keyword">val</span> numel : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> int</span></code></div><div class="spec-doc"><p><code>numel arr</code> returns the total number of elements in the array <code>arr</code>.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-get"><a href="#val-get" class="anchor"></a><code><span><span class="keyword">val</span> get : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <span><span>int array</span> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a></span></code></div><div class="spec-doc"><p><code>get arr index</code> retrieves the element at the specified multidimensional <code>index</code> in the array <code>arr</code>. Returns the value of the element at the given index.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-set"><a href="#val-set" class="anchor"></a><code><span><span class="keyword">val</span> set : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <span><span>int array</span> <span class="arrow">-></span></span> <span><a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span> unit</span></code></div><div class="spec-doc"><p><code>set arr index value</code> sets the element at the specified multidimensional <code>index</code> in the array <code>arr</code> to the given <code>value</code>.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-get_slice"><a href="#val-get_slice" class="anchor"></a><code><span><span class="keyword">val</span> get_slice : <span><span><span>int list</span> list</span> <span class="arrow">-></span></span> <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>get_slice slices arr</code> extracts a slice from the array <code>arr</code> according to the list of <code>slices</code>. Each element in <code>slices</code> specifies the range for the corresponding dimension. Returns a new array with the extracted slice.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-set_slice"><a href="#val-set_slice" class="anchor"></a><code><span><span class="keyword">val</span> set_slice :
<span><span><span>int list</span> list</span> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
unit</span></code></div><div class="spec-doc"><p><code>set_slice slices src dest</code> sets the slice in <code>dest</code> defined by <code>slices</code> with the values from the source array <code>src</code>.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-get_fancy"><a href="#val-get_fancy" class="anchor"></a><code><span><span class="keyword">val</span> get_fancy :
<span><span><a href="../../Owl_types/index.html#type-index">Owl_types.index</a> list</span> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>get_fancy indices arr</code> extracts elements from the array <code>arr</code> according to the list of <code>indices</code>. Each element in <code>indices</code> specifies an advanced indexing method. Returns a new array with the extracted elements.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-set_fancy"><a href="#val-set_fancy" class="anchor"></a><code><span><span class="keyword">val</span> set_fancy :
<span><span><a href="../../Owl_types/index.html#type-index">Owl_types.index</a> list</span> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
unit</span></code></div><div class="spec-doc"><p><code>set_fancy indices src dest</code> sets the elements in <code>dest</code> defined by <code>indices</code> with the values from the source array <code>src</code>.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-copy"><a href="#val-copy" class="anchor"></a><code><span><span class="keyword">val</span> copy : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>copy arr</code> creates a deep copy of the array <code>arr</code>. Returns a new array that is a copy of <code>arr</code>.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-copy_"><a href="#val-copy_" class="anchor"></a><code><span><span class="keyword">val</span> copy_ : <span><span class="label">out</span>:<span class="type-var">'a</span> <span class="arrow">-></span></span> <span><span class="type-var">'b</span> <span class="arrow">-></span></span> <span class="type-var">'c</span></span></code></div><div class="spec-doc"><p><code>copy_ ~out src</code> copies the contents of the array <code>src</code> into the pre-allocated array <code>out</code>.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-reset"><a href="#val-reset" class="anchor"></a><code><span><span class="keyword">val</span> reset : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> unit</span></code></div><div class="spec-doc"><p><code>reset arr</code> sets all elements of the array <code>arr</code> to zero.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-reshape"><a href="#val-reshape" class="anchor"></a><code><span><span class="keyword">val</span> reshape : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <span><span>int array</span> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>reshape arr shape</code> reshapes the array <code>arr</code> into the new <code>shape</code>. The total number of elements must remain the same. Returns a new array with the specified shape.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-reverse"><a href="#val-reverse" class="anchor"></a><code><span><span class="keyword">val</span> reverse : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>reverse arr</code> reverses the elements of the array <code>arr</code> along each dimension. Returns a new array with the elements reversed.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-tile"><a href="#val-tile" class="anchor"></a><code><span><span class="keyword">val</span> tile : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <span><span>int array</span> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>tile arr reps</code> replicates the array <code>arr</code> according to the number of repetitions specified in <code>reps</code> for each dimension. Returns a new array with the tiled data.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-repeat"><a href="#val-repeat" class="anchor"></a><code><span><span class="keyword">val</span> repeat : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <span><span>int array</span> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>repeat arr reps</code> repeats the elements of the array <code>arr</code> according to the number of repetitions specified in <code>reps</code> for each dimension. Returns a new array with the repeated data.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-pad"><a href="#val-pad" class="anchor"></a><code><span><span class="keyword">val</span> pad :
<span><span class="optlabel">?v</span>:<a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span>
<span><span><span>int list</span> list</span> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>pad ?v padding arr</code> pads the array <code>arr</code> with the value <code>v</code> according to the <code>padding</code> specification for each dimension. If <code>v</code> is not provided, the default padding value is zero. Returns a new array with the padded data.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-expand"><a href="#val-expand" class="anchor"></a><code><span><span class="keyword">val</span> expand : <span><span class="optlabel">?hi</span>:bool <span class="arrow">-></span></span> <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <span>int <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>expand ?hi arr n</code> expands the dimensions of the array <code>arr</code> by inserting a new dimension of size <code>n</code>. If <code>hi</code> is true, the new dimension is added at the beginning; otherwise, it is added at the end. Returns a new array with the expanded dimensions.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-squeeze"><a href="#val-squeeze" class="anchor"></a><code><span><span class="keyword">val</span> squeeze : <span><span class="optlabel">?axis</span>:<span>int array</span> <span class="arrow">-></span></span> <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>squeeze ?axis arr</code> removes single-dimensional entries from the shape of the array <code>arr</code>. If <code>axis</code> is provided, only the specified dimensions are removed. Returns a new array with the squeezed shape.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-concatenate"><a href="#val-concatenate" class="anchor"></a><code><span><span class="keyword">val</span> concatenate :
<span><span class="optlabel">?axis</span>:int <span class="arrow">-></span></span>
<span><span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> array</span> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>concatenate ?axis arrays</code> concatenates a sequence of arrays along the specified <code>axis</code>. If <code>axis</code> is not provided, the arrays are concatenated along the first axis. Returns a new array with the concatenated data.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-stack"><a href="#val-stack" class="anchor"></a><code><span><span class="keyword">val</span> stack : <span><span class="optlabel">?axis</span>:int <span class="arrow">-></span></span> <span><span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> array</span> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>stack ?axis arrays</code> stacks a sequence of arrays along a new dimension at the specified <code>axis</code>. If <code>axis</code> is not provided, the arrays are stacked along the first axis. Returns a new array with the stacked data.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-concat"><a href="#val-concat" class="anchor"></a><code><span><span class="keyword">val</span> concat :
<span><span class="label">axis</span>:int <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>concat ~axis a b</code> concatenates the arrays <code>a</code> and <code>b</code> along the specified <code>axis</code>. Returns a new array with the concatenated data.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-split"><a href="#val-split" class="anchor"></a><code><span><span class="keyword">val</span> split : <span><span class="optlabel">?axis</span>:int <span class="arrow">-></span></span> <span><span class="type-var">'a</span> <span class="arrow">-></span></span> <span><span class="type-var">'b</span> <span class="arrow">-></span></span> <span class="type-var">'c</span></span></code></div><div class="spec-doc"><p><code>split ?axis src num_or_sections</code> splits the array <code>src</code> into multiple sub-arrays along the specified <code>axis</code>.</p><ul><li><code>num_or_sections</code> specifies the number of equal-sized sub-arrays or the indices where to split. Returns an array of sub-arrays.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-draw"><a href="#val-draw" class="anchor"></a><code><span><span class="keyword">val</span> draw :
<span><span class="optlabel">?axis</span>:int <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span>int <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> * <span><span class="type-var">'a</span> array</span></span></code></div><div class="spec-doc"><p><code>draw ?axis arr n</code> randomly draws <code>n</code> samples from the array <code>arr</code> along the specified <code>axis</code>. Returns a tuple containing the sampled array and an array of indices from which the samples were drawn.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-map"><a href="#val-map" class="anchor"></a><code><span><span class="keyword">val</span> map :
<span><span>(<span><a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a>)</span> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>map f arr</code> applies the function <code>f</code> to each element of the array <code>arr</code>. Returns a new array with the results of applying <code>f</code>.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-fold"><a href="#val-fold" class="anchor"></a><code><span><span class="keyword">val</span> fold :
<span><span class="optlabel">?axis</span>:int <span class="arrow">-></span></span>
<span><span>(<span><a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span> <span><a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a>)</span> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>fold ?axis f init arr</code> reduces the array <code>arr</code> along the specified <code>axis</code> using the function <code>f</code> and an initial value <code>init</code>. If <code>axis</code> is not provided, the reduction is performed on all elements. Returns a new array with the reduced values.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-scan"><a href="#val-scan" class="anchor"></a><code><span><span class="keyword">val</span> scan :
<span><span class="optlabel">?axis</span>:int <span class="arrow">-></span></span>
<span><span>(<span><a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span> <span><a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a>)</span> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>scan ?axis f arr</code> performs a cumulative reduction of the array <code>arr</code> along the specified <code>axis</code> using the function <code>f</code>. Returns a new array with the cumulative results.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-one_hot"><a href="#val-one_hot" class="anchor"></a><code><span><span class="keyword">val</span> one_hot : <span>int <span class="arrow">-></span></span> <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>one_hot depth arr</code> converts the array <code>arr</code> into a one-hot encoded array with a specified <code>depth</code>. Returns a new array with one-hot encoding.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-delay"><a href="#val-delay" class="anchor"></a><code><span><span class="keyword">val</span> delay :
<span><span>(<span><a href="Symbol/Shape/Type/Device/A/index.html#type-arr">Symbol.Shape.Type.Device.A.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/Device/A/index.html#type-arr">Symbol.Shape.Type.Device.A.arr</a>)</span> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>delay f x</code> returns <code>f x</code>. It allows to use a function that is not tracked by the computation graph and delay its evaluation. The output must have the same shape as the input.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-delay_array"><a href="#val-delay_array" class="anchor"></a><code><span><span class="keyword">val</span> delay_array :
<span><span>int array</span> <span class="arrow">-></span></span>
<span><span>(<span><span><a href="Symbol/Shape/Type/Device/A/index.html#type-arr">Symbol.Shape.Type.Device.A.arr</a> array</span> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/Device/A/index.html#type-arr">Symbol.Shape.Type.Device.A.arr</a>)</span> <span class="arrow">-></span></span>
<span><span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> array</span> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>delay_array out_shape f x</code> works in the same way as <code>delay</code> but is applied on an array of ndarrays. Needs the shape of the output as an argument.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-lazy_print"><a href="#val-lazy_print" class="anchor"></a><code><span><span class="keyword">val</span> lazy_print :
<span><span class="optlabel">?max_row</span>:int <span class="arrow">-></span></span>
<span><span class="optlabel">?max_col</span>:int <span class="arrow">-></span></span>
<span><span class="optlabel">?header</span>:bool <span class="arrow">-></span></span>
<span><span class="optlabel">?fmt</span>:<span>(<span><a href="Symbol/Shape/Type/Device/A/index.html#type-elt">Symbol.Shape.Type.Device.A.elt</a> <span class="arrow">-></span></span> string)</span> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>lazy_print x</code> prints the output of <code>x</code> when it is evaluated. Is implemented as an identity node. For information about the optional parameters, refer to the <code>print</code> function of the <code>Ndarray</code> module.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-print"><a href="#val-print" class="anchor"></a><code><span><span class="keyword">val</span> print : <span><span class="optlabel">?max_row</span>:<span class="type-var">'a</span> <span class="arrow">-></span></span> <span><span class="optlabel">?max_col</span>:<span class="type-var">'b</span> <span class="arrow">-></span></span> <span><span class="optlabel">?header</span>:<span class="type-var">'c</span> <span class="arrow">-></span></span> <span><span class="optlabel">?fmt</span>:<span class="type-var">'d</span> <span class="arrow">-></span></span> <span><span class="type-var">'e</span> <span class="arrow">-></span></span> unit</span></code></div><div class="spec-doc"><p><code>print ?max_row ?max_col ?header ?fmt data</code> prints a representation of the given <code>data</code>.</p><ul><li><code>max_row</code> is an optional parameter specifying the maximum number of rows to print.</li><li><code>max_col</code> is an optional parameter specifying the maximum number of columns to print.</li><li><code>header</code> is an optional parameter to include a header in the output.</li><li><code>fmt</code> is an optional parameter to specify the format of the output.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-abs"><a href="#val-abs" class="anchor"></a><code><span><span class="keyword">val</span> abs : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>abs arr</code> computes the absolute value of each element in the array <code>arr</code>. Returns a new array with the absolute values.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-neg"><a href="#val-neg" class="anchor"></a><code><span><span class="keyword">val</span> neg : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>neg arr</code> negates each element in the array <code>arr</code>. Returns a new array with each element negated.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-floor"><a href="#val-floor" class="anchor"></a><code><span><span class="keyword">val</span> floor : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>floor arr</code> applies the floor function to each element in the array <code>arr</code>. Returns a new array with the floor of each element.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-ceil"><a href="#val-ceil" class="anchor"></a><code><span><span class="keyword">val</span> ceil : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>ceil arr</code> applies the ceiling function to each element in the array <code>arr</code>. Returns a new array with the ceiling of each element.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-round"><a href="#val-round" class="anchor"></a><code><span><span class="keyword">val</span> round : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>round arr</code> rounds each element in the array <code>arr</code> to the nearest integer. Returns a new array with each element rounded to the nearest integer.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-sqr"><a href="#val-sqr" class="anchor"></a><code><span><span class="keyword">val</span> sqr : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>sqr arr</code> computes the square of each element in the array <code>arr</code>. Returns a new array with the square of each element.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-sqrt"><a href="#val-sqrt" class="anchor"></a><code><span><span class="keyword">val</span> sqrt : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>sqrt arr</code> computes the square root of each element in the array <code>arr</code>. Returns a new array with the square roots of the elements.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-log"><a href="#val-log" class="anchor"></a><code><span><span class="keyword">val</span> log : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>log arr</code> computes the natural logarithm of each element in the array <code>arr</code>. Returns a new array with the natural logarithms of the elements.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-log2"><a href="#val-log2" class="anchor"></a><code><span><span class="keyword">val</span> log2 : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>log2 arr</code> computes the base-2 logarithm of each element in the array <code>arr</code>. Returns a new array with the base-2 logarithms of the elements.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-log10"><a href="#val-log10" class="anchor"></a><code><span><span class="keyword">val</span> log10 : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>log10 arr</code> computes the base-10 logarithm of each element in the array <code>arr</code>. Returns a new array with the base-10 logarithms of the elements.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-exp"><a href="#val-exp" class="anchor"></a><code><span><span class="keyword">val</span> exp : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>exp arr</code> computes the exponential function of each element in the array <code>arr</code>. Returns a new array with the exponentials of the elements.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-sin"><a href="#val-sin" class="anchor"></a><code><span><span class="keyword">val</span> sin : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>sin arr</code> computes the sine of each element in the array <code>arr</code>. Returns a new array with the sines of the elements.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-cos"><a href="#val-cos" class="anchor"></a><code><span><span class="keyword">val</span> cos : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>cos arr</code> computes the cosine of each element in the array <code>arr</code>. Returns a new array with the cosines of the elements.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-tan"><a href="#val-tan" class="anchor"></a><code><span><span class="keyword">val</span> tan : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>tan arr</code> computes the tangent of each element in the array <code>arr</code>. Returns a new array with the tangents of the elements.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-sinh"><a href="#val-sinh" class="anchor"></a><code><span><span class="keyword">val</span> sinh : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>sinh arr</code> computes the hyperbolic sine of each element in the array <code>arr</code>. Returns a new array with the hyperbolic sines of the elements.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-cosh"><a href="#val-cosh" class="anchor"></a><code><span><span class="keyword">val</span> cosh : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>cosh arr</code> computes the hyperbolic cosine of each element in the array <code>arr</code>. Returns a new array with the hyperbolic cosines of the elements.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-tanh"><a href="#val-tanh" class="anchor"></a><code><span><span class="keyword">val</span> tanh : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>tanh arr</code> computes the hyperbolic tangent of each element in the array <code>arr</code>. Returns a new array with the hyperbolic tangents of the elements.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-asin"><a href="#val-asin" class="anchor"></a><code><span><span class="keyword">val</span> asin : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>asin arr</code> computes the arcsine of each element in the array <code>arr</code>. Returns a new array with the arcsines of the elements.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-acos"><a href="#val-acos" class="anchor"></a><code><span><span class="keyword">val</span> acos : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>acos arr</code> computes the arccosine of each element in the array <code>arr</code>. Returns a new array with the arccosines of the elements.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-atan"><a href="#val-atan" class="anchor"></a><code><span><span class="keyword">val</span> atan : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>atan arr</code> computes the arctangent of each element in the array <code>arr</code>. Returns a new array with the arctangents of the elements.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-asinh"><a href="#val-asinh" class="anchor"></a><code><span><span class="keyword">val</span> asinh : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>asinh arr</code> computes the inverse hyperbolic sine of each element in the array <code>arr</code>. Returns a new array with the inverse hyperbolic sines of the elements.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-acosh"><a href="#val-acosh" class="anchor"></a><code><span><span class="keyword">val</span> acosh : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>acosh arr</code> computes the inverse hyperbolic cosine of each element in the array <code>arr</code>. Returns a new array with the inverse hyperbolic cosines of the elements.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-atanh"><a href="#val-atanh" class="anchor"></a><code><span><span class="keyword">val</span> atanh : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>atanh arr</code> computes the inverse hyperbolic tangent of each element in the array <code>arr</code>. Returns a new array with the inverse hyperbolic tangents of the elements.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-min"><a href="#val-min" class="anchor"></a><code><span><span class="keyword">val</span> min :
<span><span class="optlabel">?axis</span>:int <span class="arrow">-></span></span>
<span><span class="optlabel">?keep_dims</span>:bool <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>min ?axis ?keep_dims arr</code> computes the minimum value along the specified axis of the array <code>arr</code>.</p><ul><li><code>axis</code> specifies the axis along which to compute the minimum.</li><li><code>keep_dims</code> specifies whether to keep the reduced dimensions. Returns a new array with the minimum values.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-max"><a href="#val-max" class="anchor"></a><code><span><span class="keyword">val</span> max :
<span><span class="optlabel">?axis</span>:int <span class="arrow">-></span></span>
<span><span class="optlabel">?keep_dims</span>:bool <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>max ?axis ?keep_dims arr</code> computes the maximum value along the specified axis of the array <code>arr</code>.</p><ul><li><code>axis</code> specifies the axis along which to compute the maximum.</li><li><code>keep_dims</code> specifies whether to keep the reduced dimensions. Returns a new array with the maximum values.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-sum"><a href="#val-sum" class="anchor"></a><code><span><span class="keyword">val</span> sum :
<span><span class="optlabel">?axis</span>:int <span class="arrow">-></span></span>
<span><span class="optlabel">?keep_dims</span>:bool <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>sum ?axis ?keep_dims arr</code> computes the sum of elements along the specified axis of the array <code>arr</code>.</p><ul><li><code>axis</code> specifies the axis along which to compute the sum.</li><li><code>keep_dims</code> specifies whether to keep the reduced dimensions. Returns a new array with the sum of elements.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-sum_reduce"><a href="#val-sum_reduce" class="anchor"></a><code><span><span class="keyword">val</span> sum_reduce :
<span><span class="optlabel">?axis</span>:<span>int array</span> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>sum_reduce ?axis arr</code> computes the sum of elements along the specified axes of the array <code>arr</code>.</p><ul><li><code>axis</code> specifies the axes along which to compute the sum. Returns a new array with the sum of elements.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-signum"><a href="#val-signum" class="anchor"></a><code><span><span class="keyword">val</span> signum : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>signum arr</code> computes the signum function of each element in the array <code>arr</code>. Returns a new array where each element is -1, 0, or 1, depending on the sign of the corresponding element in <code>arr</code>.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-sigmoid"><a href="#val-sigmoid" class="anchor"></a><code><span><span class="keyword">val</span> sigmoid : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>sigmoid arr</code> computes the sigmoid function of each element in the array <code>arr</code>. Returns a new array with the sigmoid values.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-relu"><a href="#val-relu" class="anchor"></a><code><span><span class="keyword">val</span> relu : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>relu arr</code> applies the Rectified Linear Unit (ReLU) function to each element in the array <code>arr</code>. Returns a new array where each element is the maximum of 0 and the corresponding element in <code>arr</code>.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-dawsn"><a href="#val-dawsn" class="anchor"></a><code><span><span class="keyword">val</span> dawsn : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>dawsn arr</code> computes Dawson's function of each element in the array <code>arr</code>. Returns a new array with Dawson's function values.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-min'"><a href="#val-min'" class="anchor"></a><code><span><span class="keyword">val</span> min' : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a></span></code></div><div class="spec-doc"><p><code>min' arr</code> computes the minimum value in the array <code>arr</code>. Returns the minimum value as an element.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-max'"><a href="#val-max'" class="anchor"></a><code><span><span class="keyword">val</span> max' : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a></span></code></div><div class="spec-doc"><p><code>max' arr</code> computes the maximum value in the array <code>arr</code>. Returns the maximum value as an element.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-sum'"><a href="#val-sum'" class="anchor"></a><code><span><span class="keyword">val</span> sum' : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a></span></code></div><div class="spec-doc"><p><code>sum' arr</code> computes the sum of all elements in the array <code>arr</code>. Returns the sum as an element.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-log_sum_exp'"><a href="#val-log_sum_exp'" class="anchor"></a><code><span><span class="keyword">val</span> log_sum_exp' : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a></span></code></div><div class="spec-doc"><p><code>log_sum_exp' arr</code> computes the log-sum-exp of all elements in the array <code>arr</code>. Returns the log-sum-exp as an element.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-log_sum_exp"><a href="#val-log_sum_exp" class="anchor"></a><code><span><span class="keyword">val</span> log_sum_exp :
<span><span class="optlabel">?axis</span>:int <span class="arrow">-></span></span>
<span><span class="optlabel">?keep_dims</span>:bool <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>log_sum_exp ?axis ?keep_dims arr</code> computes the log of the sum of exponentials of elements along the specified <code>axis</code> of the array <code>arr</code>.</p><ul><li><code>axis</code> specifies the axis along which to compute the log-sum-exp. If not specified, computes over all elements.</li><li><code>keep_dims</code> if true, retains reduced dimensions with size 1. Returns a new array with the log-sum-exp values.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-l1norm'"><a href="#val-l1norm'" class="anchor"></a><code><span><span class="keyword">val</span> l1norm' : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a></span></code></div><div class="spec-doc"><p><code>l1norm' arr</code> computes the L1 norm (sum of absolute values) of all elements in the array <code>arr</code>. Returns the L1 norm as an element.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-l2norm'"><a href="#val-l2norm'" class="anchor"></a><code><span><span class="keyword">val</span> l2norm' : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a></span></code></div><div class="spec-doc"><p><code>l2norm' arr</code> computes the L2 norm (Euclidean norm) of all elements in the array <code>arr</code>. Returns the L2 norm as an element.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-l2norm_sqr'"><a href="#val-l2norm_sqr'" class="anchor"></a><code><span><span class="keyword">val</span> l2norm_sqr' : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a></span></code></div><div class="spec-doc"><p><code>l2norm_sqr' arr</code> computes the squared L2 norm (sum of squared values) of all elements in the array <code>arr</code>. Returns the squared L2 norm as an element.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-clip_by_value"><a href="#val-clip_by_value" class="anchor"></a><code><span><span class="keyword">val</span> clip_by_value :
<span><span class="optlabel">?amin</span>:<a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span>
<span><span class="optlabel">?amax</span>:<a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>clip_by_value ?amin ?amax arr</code> clips the values in the array <code>arr</code> to the range <code>amin, amax</code>.</p><ul><li><code>amin</code> specifies the minimum value to clip to.</li><li><code>amax</code> specifies the maximum value to clip to. Returns a new array with the values clipped to the specified range.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-clip_by_l2norm"><a href="#val-clip_by_l2norm" class="anchor"></a><code><span><span class="keyword">val</span> clip_by_l2norm :
<span><a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>clip_by_l2norm max_norm arr</code> clips the values in the array <code>arr</code> so that the L2 norm does not exceed <code>max_norm</code>. Returns a new array with the values clipped by the specified L2 norm.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-pow"><a href="#val-pow" class="anchor"></a><code><span><span class="keyword">val</span> pow :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>pow base exp</code> computes each element of the array <code>base</code> raised to the power of the corresponding element in <code>exp</code>. Returns a new array with the power values.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-scalar_pow"><a href="#val-scalar_pow" class="anchor"></a><code><span><span class="keyword">val</span> scalar_pow :
<span><a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>scalar_pow scalar arr</code> raises the scalar value <code>scalar</code> to the power of each element in the array <code>arr</code>. Returns a new array with the power values.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-pow_scalar"><a href="#val-pow_scalar" class="anchor"></a><code><span><span class="keyword">val</span> pow_scalar :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>pow_scalar arr scalar</code> raises each element in the array <code>arr</code> to the power of the scalar value <code>scalar</code>. Returns a new array with the power values.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-atan2"><a href="#val-atan2" class="anchor"></a><code><span><span class="keyword">val</span> atan2 :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>atan2 y x</code> computes the element-wise arctangent of <code>y</code> / <code>x</code>, using the signs of the elements to determine the correct quadrant. Returns a new array with the arctangent values.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-scalar_atan2"><a href="#val-scalar_atan2" class="anchor"></a><code><span><span class="keyword">val</span> scalar_atan2 :
<span><a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>scalar_atan2 scalar arr</code> computes the element-wise arctangent of <code>scalar</code> / each element in the array <code>arr</code>. Returns a new array with the arctangent values.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-atan2_scalar"><a href="#val-atan2_scalar" class="anchor"></a><code><span><span class="keyword">val</span> atan2_scalar :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>atan2_scalar arr scalar</code> computes the element-wise arctangent of each element in the array <code>arr</code> / <code>scalar</code>. Returns a new array with the arctangent values.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-hypot"><a href="#val-hypot" class="anchor"></a><code><span><span class="keyword">val</span> hypot :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>hypot x y</code> computes the hypotenuse (sqrt(x^2 + y^2)) for each element in the arrays <code>x</code> and <code>y</code>. Returns a new array with the hypotenuse values.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-min2"><a href="#val-min2" class="anchor"></a><code><span><span class="keyword">val</span> min2 :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>min2 a b</code> computes the element-wise minimum of arrays <code>a</code> and <code>b</code>. Returns a new array with the minimum values.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-max2"><a href="#val-max2" class="anchor"></a><code><span><span class="keyword">val</span> max2 :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>max2 a b</code> computes the element-wise maximum of arrays <code>a</code> and <code>b</code>. Returns a new array with the maximum values.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-add"><a href="#val-add" class="anchor"></a><code><span><span class="keyword">val</span> add :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>add a b</code> computes the element-wise addition of arrays <code>a</code> and <code>b</code>. Returns a new array with the sum of elements.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-sub"><a href="#val-sub" class="anchor"></a><code><span><span class="keyword">val</span> sub :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>sub a b</code> computes the element-wise subtraction of arrays <code>a</code> and <code>b</code>. Returns a new array with the difference of elements.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-mul"><a href="#val-mul" class="anchor"></a><code><span><span class="keyword">val</span> mul :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>mul a b</code> computes the element-wise multiplication of arrays <code>a</code> and <code>b</code>. Returns a new array with the product of elements.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-div"><a href="#val-div" class="anchor"></a><code><span><span class="keyword">val</span> div :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>div a b</code> computes the element-wise division of arrays <code>a</code> and <code>b</code>. Returns a new array with the quotient of elements.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-add_scalar"><a href="#val-add_scalar" class="anchor"></a><code><span><span class="keyword">val</span> add_scalar :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>add_scalar arr scalar</code> adds the scalar value <code>scalar</code> to each element in the array <code>arr</code>. Returns a new array with the resulting values.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-sub_scalar"><a href="#val-sub_scalar" class="anchor"></a><code><span><span class="keyword">val</span> sub_scalar :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>sub_scalar arr scalar</code> subtracts the scalar value <code>scalar</code> from each element in the array <code>arr</code>. Returns a new array with the resulting values.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-mul_scalar"><a href="#val-mul_scalar" class="anchor"></a><code><span><span class="keyword">val</span> mul_scalar :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>mul_scalar arr scalar</code> multiplies each element in the array <code>arr</code> by the scalar value <code>scalar</code>. Returns a new array with the resulting values.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-div_scalar"><a href="#val-div_scalar" class="anchor"></a><code><span><span class="keyword">val</span> div_scalar :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>div_scalar arr scalar</code> divides each element in the array <code>arr</code> by the scalar value <code>scalar</code>. Returns a new array with the resulting values.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-scalar_add"><a href="#val-scalar_add" class="anchor"></a><code><span><span class="keyword">val</span> scalar_add :
<span><a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>scalar_add scalar arr</code> adds the scalar value <code>scalar</code> to each element in the array <code>arr</code>. Returns a new array with the resulting values.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-scalar_sub"><a href="#val-scalar_sub" class="anchor"></a><code><span><span class="keyword">val</span> scalar_sub :
<span><a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>scalar_sub scalar arr</code> subtracts each element in the array <code>arr</code> from the scalar value <code>scalar</code>. Returns a new array with the resulting values.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-scalar_mul"><a href="#val-scalar_mul" class="anchor"></a><code><span><span class="keyword">val</span> scalar_mul :
<span><a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>scalar_mul scalar arr</code> multiplies each element in the array <code>arr</code> by the scalar value <code>scalar</code>. Returns a new array with the resulting values.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-scalar_div"><a href="#val-scalar_div" class="anchor"></a><code><span><span class="keyword">val</span> scalar_div :
<span><a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>scalar_div scalar arr</code> divides the scalar value <code>scalar</code> by each element in the array <code>arr</code>. Returns a new array with the resulting values.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-fma"><a href="#val-fma" class="anchor"></a><code><span><span class="keyword">val</span> fma :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>fma a b c</code> computes the fused multiply-add operation, multiplying arrays <code>a</code> and <code>b</code>, then adding array <code>c</code>. Returns a new array with the resulting values.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-elt_equal"><a href="#val-elt_equal" class="anchor"></a><code><span><span class="keyword">val</span> elt_equal :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>elt_equal a b</code> performs element-wise equality comparison between arrays <code>a</code> and <code>b</code>. Returns a new array where each element is <code>true</code> if the corresponding elements in <code>a</code> and <code>b</code> are equal, and <code>false</code> otherwise.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-elt_not_equal"><a href="#val-elt_not_equal" class="anchor"></a><code><span><span class="keyword">val</span> elt_not_equal :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>elt_not_equal a b</code> performs element-wise inequality comparison between arrays <code>a</code> and <code>b</code>. Returns a new array where each element is <code>true</code> if the corresponding elements in <code>a</code> and <code>b</code> are not equal, and <code>false</code> otherwise.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-elt_less"><a href="#val-elt_less" class="anchor"></a><code><span><span class="keyword">val</span> elt_less :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>elt_less a b</code> performs element-wise less-than comparison between arrays <code>a</code> and <code>b</code>. Returns a new array where each element is <code>true</code> if the corresponding element in <code>a</code> is less than that in <code>b</code>, and <code>false</code> otherwise.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-elt_greater"><a href="#val-elt_greater" class="anchor"></a><code><span><span class="keyword">val</span> elt_greater :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>elt_greater a b</code> performs element-wise greater-than comparison between arrays <code>a</code> and <code>b</code>. Returns a new array where each element is <code>true</code> if the corresponding element in <code>a</code> is greater than that in <code>b</code>, and <code>false</code> otherwise.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-elt_less_equal"><a href="#val-elt_less_equal" class="anchor"></a><code><span><span class="keyword">val</span> elt_less_equal :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>elt_less_equal a b</code> performs element-wise less-than-or-equal-to comparison between arrays <code>a</code> and <code>b</code>. Returns a new array where each element is <code>true</code> if the corresponding element in <code>a</code> is less than or equal to that in <code>b</code>, and <code>false</code> otherwise.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-elt_greater_equal"><a href="#val-elt_greater_equal" class="anchor"></a><code><span><span class="keyword">val</span> elt_greater_equal :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>elt_greater_equal a b</code> performs element-wise greater-than-or-equal-to comparison between arrays <code>a</code> and <code>b</code>. Returns a new array where each element is <code>true</code> if the corresponding element in <code>a</code> is greater than or equal to that in <code>b</code>, and <code>false</code> otherwise.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-elt_equal_scalar"><a href="#val-elt_equal_scalar" class="anchor"></a><code><span><span class="keyword">val</span> elt_equal_scalar :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>elt_equal_scalar arr scalar</code> performs element-wise equality comparison between each element in the array <code>arr</code> and the scalar value <code>scalar</code>. Returns a new array where each element is <code>true</code> if it equals <code>scalar</code>, and <code>false</code> otherwise.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-elt_not_equal_scalar"><a href="#val-elt_not_equal_scalar" class="anchor"></a><code><span><span class="keyword">val</span> elt_not_equal_scalar :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>elt_not_equal_scalar arr scalar</code> performs element-wise inequality comparison between each element in the array <code>arr</code> and the scalar value <code>scalar</code>. Returns a new array where each element is <code>true</code> if it does not equal <code>scalar</code>, and <code>false</code> otherwise.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-elt_less_scalar"><a href="#val-elt_less_scalar" class="anchor"></a><code><span><span class="keyword">val</span> elt_less_scalar :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>elt_less_scalar arr scalar</code> performs element-wise less-than comparison between each element in the array <code>arr</code> and the scalar value <code>scalar</code>. Returns a new array where each element is <code>true</code> if it is less than <code>scalar</code>, and <code>false</code> otherwise.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-elt_greater_scalar"><a href="#val-elt_greater_scalar" class="anchor"></a><code><span><span class="keyword">val</span> elt_greater_scalar :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>elt_greater_scalar arr scalar</code> performs element-wise greater-than comparison between each element in the array <code>arr</code> and the scalar value <code>scalar</code>. Returns a new array where each element is <code>true</code> if it is greater than <code>scalar</code>, and <code>false</code> otherwise.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-elt_less_equal_scalar"><a href="#val-elt_less_equal_scalar" class="anchor"></a><code><span><span class="keyword">val</span> elt_less_equal_scalar :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>elt_less_equal_scalar arr scalar</code> performs element-wise less-than-or-equal-to comparison between each element in the array <code>arr</code> and the scalar value <code>scalar</code>. Returns a new array where each element is <code>true</code> if it is less than or equal to <code>scalar</code>, and <code>false</code> otherwise.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-elt_greater_equal_scalar"><a href="#val-elt_greater_equal_scalar" class="anchor"></a><code><span><span class="keyword">val</span> elt_greater_equal_scalar :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>elt_greater_equal_scalar arr scalar</code> performs element-wise greater-than-or-equal-to comparison between each element in the array <code>arr</code> and the scalar value <code>scalar</code>. Returns a new array where each element is <code>true</code> if it is greater than or equal to <code>scalar</code>, and <code>false</code> otherwise.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-conv1d"><a href="#val-conv1d" class="anchor"></a><code><span><span class="keyword">val</span> conv1d :
<span><span class="optlabel">?padding</span>:<a href="../../Owl_types/index.html#type-padding">Owl_types.padding</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>conv1d ?padding input kernel strides</code> performs a 1-dimensional convolution on the <code>input</code> array using the specified <code>kernel</code>.</p><ul><li><code>padding</code> specifies the padding strategy (default is "valid").</li><li><code>strides</code> specifies the stride length. Returns a new array with the result of the convolution.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-conv2d"><a href="#val-conv2d" class="anchor"></a><code><span><span class="keyword">val</span> conv2d :
<span><span class="optlabel">?padding</span>:<a href="../../Owl_types/index.html#type-padding">Owl_types.padding</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>conv2d ?padding input kernel strides</code> performs a 2-dimensional convolution on the <code>input</code> array using the specified <code>kernel</code>.</p><ul><li><code>padding</code> specifies the padding strategy (default is "valid").</li><li><code>strides</code> specifies the stride length. Returns a new array with the result of the convolution.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-conv3d"><a href="#val-conv3d" class="anchor"></a><code><span><span class="keyword">val</span> conv3d :
<span><span class="optlabel">?padding</span>:<a href="../../Owl_types/index.html#type-padding">Owl_types.padding</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>conv3d ?padding input kernel strides</code> performs a 3-dimensional convolution on the <code>input</code> array using the specified <code>kernel</code>.</p><ul><li><code>padding</code> specifies the padding strategy (default is "valid").</li><li><code>strides</code> specifies the stride length. Returns a new array with the result of the convolution.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-transpose_conv1d"><a href="#val-transpose_conv1d" class="anchor"></a><code><span><span class="keyword">val</span> transpose_conv1d :
<span><span class="optlabel">?padding</span>:<a href="../../Owl_types/index.html#type-padding">Owl_types.padding</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>transpose_conv1d ?padding input kernel strides</code> performs a 1-dimensional transposed convolution (also known as deconvolution) on the <code>input</code> array using the specified <code>kernel</code>.</p><ul><li><code>padding</code> specifies the padding strategy (default is "valid").</li><li><code>strides</code> specifies the stride length. Returns a new array with the result of the transposed convolution.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-transpose_conv2d"><a href="#val-transpose_conv2d" class="anchor"></a><code><span><span class="keyword">val</span> transpose_conv2d :
<span><span class="optlabel">?padding</span>:<a href="../../Owl_types/index.html#type-padding">Owl_types.padding</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>transpose_conv2d ?padding input kernel strides</code> performs a 2-dimensional transposed convolution (also known as deconvolution) on the <code>input</code> array using the specified <code>kernel</code>.</p><ul><li><code>padding</code> specifies the padding strategy (default is "valid").</li><li><code>strides</code> specifies the stride length. Returns a new array with the result of the transposed convolution.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-transpose_conv3d"><a href="#val-transpose_conv3d" class="anchor"></a><code><span><span class="keyword">val</span> transpose_conv3d :
<span><span class="optlabel">?padding</span>:<a href="../../Owl_types/index.html#type-padding">Owl_types.padding</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>transpose_conv3d ?padding input kernel strides</code> performs a 3-dimensional transposed convolution (also known as deconvolution) on the <code>input</code> array using the specified <code>kernel</code>.</p><ul><li><code>padding</code> specifies the padding strategy (default is "valid").</li><li><code>strides</code> specifies the stride length. Returns a new array with the result of the transposed convolution.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-dilated_conv1d"><a href="#val-dilated_conv1d" class="anchor"></a><code><span><span class="keyword">val</span> dilated_conv1d :
<span><span class="optlabel">?padding</span>:<a href="../../Owl_types/index.html#type-padding">Owl_types.padding</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>dilated_conv1d ?padding input kernel strides dilations</code> performs a 1-dimensional dilated convolution on the <code>input</code> array using the specified <code>kernel</code>.</p><ul><li><code>padding</code> specifies the padding strategy (default is "valid").</li><li><code>strides</code> specifies the stride length.</li><li><code>dilations</code> specifies the dilation rate. Returns a new array with the result of the dilated convolution.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-dilated_conv2d"><a href="#val-dilated_conv2d" class="anchor"></a><code><span><span class="keyword">val</span> dilated_conv2d :
<span><span class="optlabel">?padding</span>:<a href="../../Owl_types/index.html#type-padding">Owl_types.padding</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>dilated_conv2d ?padding input kernel strides dilations</code> performs a 2-dimensional dilated convolution on the <code>input</code> array using the specified <code>kernel</code>.</p><ul><li><code>padding</code> specifies the padding strategy (default is "valid").</li><li><code>strides</code> specifies the stride length.</li><li><code>dilations</code> specifies the dilation rate. Returns a new array with the result of the dilated convolution.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-dilated_conv3d"><a href="#val-dilated_conv3d" class="anchor"></a><code><span><span class="keyword">val</span> dilated_conv3d :
<span><span class="optlabel">?padding</span>:<a href="../../Owl_types/index.html#type-padding">Owl_types.padding</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>dilated_conv3d ?padding input kernel strides dilations</code> performs a 3-dimensional dilated convolution on the <code>input</code> array using the specified <code>kernel</code>.</p><ul><li><code>padding</code> specifies the padding strategy (default is "valid").</li><li><code>strides</code> specifies the stride length.</li><li><code>dilations</code> specifies the dilation rate. Returns a new array with the result of the dilated convolution.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-max_pool1d"><a href="#val-max_pool1d" class="anchor"></a><code><span><span class="keyword">val</span> max_pool1d :
<span><span class="optlabel">?padding</span>:<a href="../../Owl_types/index.html#type-padding">Owl_types.padding</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>max_pool1d ?padding input pool_size strides</code> applies a 1-dimensional max pooling operation on the <code>input</code> array.</p><ul><li><code>padding</code> specifies the padding strategy (default is "valid").</li><li><code>pool_size</code> specifies the size of the pooling window.</li><li><code>strides</code> specifies the stride length. Returns a new array with the result of the max pooling.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-max_pool2d"><a href="#val-max_pool2d" class="anchor"></a><code><span><span class="keyword">val</span> max_pool2d :
<span><span class="optlabel">?padding</span>:<a href="../../Owl_types/index.html#type-padding">Owl_types.padding</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>max_pool2d ?padding input pool_size strides</code> applies a 2-dimensional max pooling operation on the <code>input</code> array.</p><ul><li><code>padding</code> specifies the padding strategy (default is "valid").</li><li><code>pool_size</code> specifies the size of the pooling window.</li><li><code>strides</code> specifies the stride length. Returns a new array with the result of the max pooling.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-max_pool3d"><a href="#val-max_pool3d" class="anchor"></a><code><span><span class="keyword">val</span> max_pool3d :
<span><span class="optlabel">?padding</span>:<a href="../../Owl_types/index.html#type-padding">Owl_types.padding</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>max_pool3d ?padding input pool_size strides</code> applies a 3-dimensional max pooling operation on the <code>input</code> array.</p><ul><li><code>padding</code> specifies the padding strategy (default is "valid").</li><li><code>pool_size</code> specifies the size of the pooling window.</li><li><code>strides</code> specifies the stride length. Returns a new array with the result of the max pooling.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-avg_pool1d"><a href="#val-avg_pool1d" class="anchor"></a><code><span><span class="keyword">val</span> avg_pool1d :
<span><span class="optlabel">?padding</span>:<a href="../../Owl_types/index.html#type-padding">Owl_types.padding</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>avg_pool1d ?padding input pool_size strides</code> applies a 1-dimensional average pooling operation on the <code>input</code> array.</p><ul><li><code>padding</code> specifies the padding strategy (default is "valid").</li><li><code>pool_size</code> specifies the size of the pooling window.</li><li><code>strides</code> specifies the stride length. Returns a new array with the result of the average pooling.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-avg_pool2d"><a href="#val-avg_pool2d" class="anchor"></a><code><span><span class="keyword">val</span> avg_pool2d :
<span><span class="optlabel">?padding</span>:<a href="../../Owl_types/index.html#type-padding">Owl_types.padding</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>avg_pool2d ?padding input pool_size strides</code> applies a 2-dimensional average pooling operation on the <code>input</code> array.</p><ul><li><code>padding</code> specifies the padding strategy (default is "valid").</li><li><code>pool_size</code> specifies the size of the pooling window.</li><li><code>strides</code> specifies the stride length. Returns a new array with the result of the average pooling.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-avg_pool3d"><a href="#val-avg_pool3d" class="anchor"></a><code><span><span class="keyword">val</span> avg_pool3d :
<span><span class="optlabel">?padding</span>:<a href="../../Owl_types/index.html#type-padding">Owl_types.padding</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>avg_pool3d ?padding input pool_size strides</code> applies a 3-dimensional average pooling operation on the <code>input</code> array.</p><ul><li><code>padding</code> specifies the padding strategy (default is "valid").</li><li><code>pool_size</code> specifies the size of the pooling window.</li><li><code>strides</code> specifies the stride length. Returns a new array with the result of the average pooling.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-upsampling2d"><a href="#val-upsampling2d" class="anchor"></a><code><span><span class="keyword">val</span> upsampling2d : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <span><span>int array</span> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>upsampling2d input size</code> performs a 2-dimensional upsampling on the <code>input</code> array.</p><ul><li><code>size</code> specifies the upsampling factors for each dimension. Returns a new array with the upsampled data.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-conv1d_backward_input"><a href="#val-conv1d_backward_input" class="anchor"></a><code><span><span class="keyword">val</span> conv1d_backward_input :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>conv1d_backward_input input kernel strides grad_output</code> computes the gradient of the loss with respect to the 1-dimensional <code>input</code> array.</p><ul><li><code>input</code> is the original input array.</li><li><code>kernel</code> is the convolutional kernel used during the forward pass.</li><li><code>strides</code> specifies the stride length.</li><li><code>grad_output</code> is the gradient of the loss with respect to the output of the convolutional layer. Returns a new array with the gradients of the input.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-conv1d_backward_kernel"><a href="#val-conv1d_backward_kernel" class="anchor"></a><code><span><span class="keyword">val</span> conv1d_backward_kernel :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>conv1d_backward_kernel input kernel strides grad_output</code> computes the gradient of the loss with respect to the 1-dimensional convolutional <code>kernel</code>.</p><ul><li><code>input</code> is the original input array.</li><li><code>kernel</code> is the convolutional kernel used during the forward pass.</li><li><code>strides</code> specifies the stride length.</li><li><code>grad_output</code> is the gradient of the loss with respect to the output of the convolutional layer. Returns a new array with the gradients of the kernel.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-conv2d_backward_input"><a href="#val-conv2d_backward_input" class="anchor"></a><code><span><span class="keyword">val</span> conv2d_backward_input :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>conv2d_backward_input input kernel strides grad_output</code> computes the gradient of the loss with respect to the 2-dimensional <code>input</code> array.</p><ul><li><code>input</code> is the original input array.</li><li><code>kernel</code> is the convolutional kernel used during the forward pass.</li><li><code>strides</code> specifies the stride length.</li><li><code>grad_output</code> is the gradient of the loss with respect to the output of the convolutional layer. Returns a new array with the gradients of the input.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-conv2d_backward_kernel"><a href="#val-conv2d_backward_kernel" class="anchor"></a><code><span><span class="keyword">val</span> conv2d_backward_kernel :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>conv2d_backward_kernel input kernel strides grad_output</code> computes the gradient of the loss with respect to the 2-dimensional convolutional <code>kernel</code>.</p><ul><li><code>input</code> is the original input array.</li><li><code>kernel</code> is the convolutional kernel used during the forward pass.</li><li><code>strides</code> specifies the stride length.</li><li><code>grad_output</code> is the gradient of the loss with respect to the output of the convolutional layer. Returns a new array with the gradients of the kernel.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-conv3d_backward_input"><a href="#val-conv3d_backward_input" class="anchor"></a><code><span><span class="keyword">val</span> conv3d_backward_input :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>conv3d_backward_input input kernel strides grad_output</code> computes the gradient of the loss with respect to the 3-dimensional <code>input</code> array.</p><ul><li><code>input</code> is the original input array.</li><li><code>kernel</code> is the convolutional kernel used during the forward pass.</li><li><code>strides</code> specifies the stride length.</li><li><code>grad_output</code> is the gradient of the loss with respect to the output of the convolutional layer. Returns a new array with the gradients of the input.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-conv3d_backward_kernel"><a href="#val-conv3d_backward_kernel" class="anchor"></a><code><span><span class="keyword">val</span> conv3d_backward_kernel :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>conv3d_backward_kernel input kernel strides grad_output</code> computes the gradient of the loss with respect to the 3-dimensional convolutional <code>kernel</code>.</p><ul><li><code>input</code> is the original input array.</li><li><code>kernel</code> is the convolutional kernel used during the forward pass.</li><li><code>strides</code> specifies the stride length.</li><li><code>grad_output</code> is the gradient of the loss with respect to the output of the convolutional layer. Returns a new array with the gradients of the kernel.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-transpose_conv1d_backward_input"><a href="#val-transpose_conv1d_backward_input" class="anchor"></a><code><span><span class="keyword">val</span> transpose_conv1d_backward_input :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>transpose_conv1d_backward_input input kernel strides grad_output</code> computes the gradient of the loss with respect to the 1-dimensional <code>input</code> array for the transposed convolution operation.</p><ul><li><code>input</code> is the original input array.</li><li><code>kernel</code> is the transposed convolutional kernel used during the forward pass.</li><li><code>strides</code> specifies the stride length.</li><li><code>grad_output</code> is the gradient of the loss with respect to the output of the transposed convolutional layer. Returns a new array with the gradients of the input.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-transpose_conv1d_backward_kernel"><a href="#val-transpose_conv1d_backward_kernel" class="anchor"></a><code><span><span class="keyword">val</span> transpose_conv1d_backward_kernel :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>transpose_conv1d_backward_kernel input kernel strides grad_output</code> computes the gradient of the loss with respect to the 1-dimensional transposed convolutional <code>kernel</code>.</p><ul><li><code>input</code> is the original input array.</li><li><code>kernel</code> is the transposed convolutional kernel used during the forward pass.</li><li><code>strides</code> specifies the stride length.</li><li><code>grad_output</code> is the gradient of the loss with respect to the output of the transposed convolutional layer. Returns a new array with the gradients of the kernel.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-transpose_conv2d_backward_input"><a href="#val-transpose_conv2d_backward_input" class="anchor"></a><code><span><span class="keyword">val</span> transpose_conv2d_backward_input :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>transpose_conv2d_backward_input input kernel strides grad_output</code> computes the gradient of the loss with respect to the 2-dimensional <code>input</code> array for the transposed convolution operation.</p><ul><li><code>input</code> is the original input array.</li><li><code>kernel</code> is the transposed convolutional kernel used during the forward pass.</li><li><code>strides</code> specifies the stride length.</li><li><code>grad_output</code> is the gradient of the loss with respect to the output of the transposed convolutional layer. Returns a new array with the gradients of the input.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-transpose_conv2d_backward_kernel"><a href="#val-transpose_conv2d_backward_kernel" class="anchor"></a><code><span><span class="keyword">val</span> transpose_conv2d_backward_kernel :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>transpose_conv2d_backward_kernel input kernel strides grad_output</code> computes the gradient of the loss with respect to the 2-dimensional transposed convolutional <code>kernel</code>.</p><ul><li><code>input</code> is the original input array.</li><li><code>kernel</code> is the transposed convolutional kernel used during the forward pass.</li><li><code>strides</code> specifies the stride length.</li><li><code>grad_output</code> is the gradient of the loss with respect to the output of the transposed convolutional layer. Returns a new array with the gradients of the kernel.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-transpose_conv3d_backward_input"><a href="#val-transpose_conv3d_backward_input" class="anchor"></a><code><span><span class="keyword">val</span> transpose_conv3d_backward_input :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>transpose_conv3d_backward_input input kernel strides grad_output</code> computes the gradient of the loss with respect to the 3-dimensional <code>input</code> array for the transposed convolution operation.</p><ul><li><code>input</code> is the original input array.</li><li><code>kernel</code> is the transposed convolutional kernel used during the forward pass.</li><li><code>strides</code> specifies the stride length.</li><li><code>grad_output</code> is the gradient of the loss with respect to the output of the transposed convolutional layer. Returns a new array with the gradients of the input.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-transpose_conv3d_backward_kernel"><a href="#val-transpose_conv3d_backward_kernel" class="anchor"></a><code><span><span class="keyword">val</span> transpose_conv3d_backward_kernel :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>transpose_conv3d_backward_kernel input kernel strides grad_output</code> computes the gradient of the loss with respect to the 3-dimensional transposed convolutional <code>kernel</code>.</p><ul><li><code>input</code> is the original input array.</li><li><code>kernel</code> is the transposed convolutional kernel used during the forward pass.</li><li><code>strides</code> specifies the stride length.</li><li><code>grad_output</code> is the gradient of the loss with respect to the output of the transposed convolutional layer. Returns a new array with the gradients of the kernel.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-dilated_conv1d_backward_input"><a href="#val-dilated_conv1d_backward_input" class="anchor"></a><code><span><span class="keyword">val</span> dilated_conv1d_backward_input :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>dilated_conv1d_backward_input input kernel strides dilations grad_output</code> computes the gradient of the loss with respect to the 1-dimensional <code>input</code> array for the dilated convolution operation.</p><ul><li><code>input</code> is the original input array.</li><li><code>kernel</code> is the dilated convolutional kernel used during the forward pass.</li><li><code>strides</code> specifies the stride length.</li><li><code>dilations</code> specifies the dilation rate.</li><li><code>grad_output</code> is the gradient of the loss with respect to the output of the dilated convolutional layer. Returns a new array with the gradients of the input.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-dilated_conv1d_backward_kernel"><a href="#val-dilated_conv1d_backward_kernel" class="anchor"></a><code><span><span class="keyword">val</span> dilated_conv1d_backward_kernel :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>dilated_conv1d_backward_kernel input kernel strides dilations grad_output</code> computes the gradient of the loss with respect to the 1-dimensional dilated convolutional <code>kernel</code>.</p><ul><li><code>input</code> is the original input array.</li><li><code>kernel</code> is the dilated convolutional kernel used during the forward pass.</li><li><code>strides</code> specifies the stride length.</li><li><code>dilations</code> specifies the dilation rate.</li><li><code>grad_output</code> is the gradient of the loss with respect to the output of the dilated convolutional layer. Returns a new array with the gradients of the kernel.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-dilated_conv2d_backward_input"><a href="#val-dilated_conv2d_backward_input" class="anchor"></a><code><span><span class="keyword">val</span> dilated_conv2d_backward_input :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>dilated_conv2d_backward_input input kernel strides dilations grad_output</code> computes the gradient of the loss with respect to the 2-dimensional <code>input</code> array for the dilated convolution operation.</p><ul><li><code>input</code> is the original input array.</li><li><code>kernel</code> is the dilated convolutional kernel used during the forward pass.</li><li><code>strides</code> specifies the stride length.</li><li><code>dilations</code> specifies the dilation rate.</li><li><code>grad_output</code> is the gradient of the loss with respect to the output of the dilated convolutional layer. Returns a new array with the gradients of the input.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-dilated_conv2d_backward_kernel"><a href="#val-dilated_conv2d_backward_kernel" class="anchor"></a><code><span><span class="keyword">val</span> dilated_conv2d_backward_kernel :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>dilated_conv2d_backward_kernel input kernel strides dilations grad_output</code> computes the gradient of the loss with respect to the 2-dimensional dilated convolutional <code>kernel</code>.</p><ul><li><code>input</code> is the original input array.</li><li><code>kernel</code> is the dilated convolutional kernel used during the forward pass.</li><li><code>strides</code> specifies the stride length.</li><li><code>dilations</code> specifies the dilation rate.</li><li><code>grad_output</code> is the gradient of the loss with respect to the output of the dilated convolutional layer. Returns a new array with the gradients of the kernel.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-dilated_conv3d_backward_input"><a href="#val-dilated_conv3d_backward_input" class="anchor"></a><code><span><span class="keyword">val</span> dilated_conv3d_backward_input :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>dilated_conv3d_backward_input input kernel strides dilations grad_output</code> computes the gradient of the loss with respect to the 3-dimensional <code>input</code> array for the dilated convolution operation.</p><ul><li><code>input</code> is the original input array.</li><li><code>kernel</code> is the dilated convolutional kernel used during the forward pass.</li><li><code>strides</code> specifies the stride length.</li><li><code>dilations</code> specifies the dilation rate.</li><li><code>grad_output</code> is the gradient of the loss with respect to the output of the dilated convolutional layer. Returns a new array with the gradients of the input.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-dilated_conv3d_backward_kernel"><a href="#val-dilated_conv3d_backward_kernel" class="anchor"></a><code><span><span class="keyword">val</span> dilated_conv3d_backward_kernel :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>dilated_conv3d_backward_kernel input kernel strides dilations grad_output</code> computes the gradient of the loss with respect to the 3-dimensional dilated convolutional <code>kernel</code>.</p><ul><li><code>input</code> is the original input array.</li><li><code>kernel</code> is the dilated convolutional kernel used during the forward pass.</li><li><code>strides</code> specifies the stride length.</li><li><code>dilations</code> specifies the dilation rate.</li><li><code>grad_output</code> is the gradient of the loss with respect to the output of the dilated convolutional layer. Returns a new array with the gradients of the kernel.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-max_pool1d_backward"><a href="#val-max_pool1d_backward" class="anchor"></a><code><span><span class="keyword">val</span> max_pool1d_backward :
<span><a href="../../Owl_types/index.html#type-padding">Owl_types.padding</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>max_pool1d_backward padding input pool_size strides grad_output</code> computes the gradient of the loss with respect to the 1-dimensional <code>input</code> array after max pooling.</p><ul><li><code>padding</code> specifies the padding strategy used during the forward pass.</li><li><code>input</code> is the original input array.</li><li><code>pool_size</code> specifies the size of the pooling window.</li><li><code>strides</code> specifies the stride length.</li><li><code>grad_output</code> is the gradient of the loss with respect to the output of the max pooling layer. Returns a new array with the gradients of the input.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-max_pool2d_backward"><a href="#val-max_pool2d_backward" class="anchor"></a><code><span><span class="keyword">val</span> max_pool2d_backward :
<span><a href="../../Owl_types/index.html#type-padding">Owl_types.padding</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>max_pool2d_backward padding input pool_size strides grad_output</code> computes the gradient of the loss with respect to the 2-dimensional <code>input</code> array after max pooling.</p><ul><li><code>padding</code> specifies the padding strategy used during the forward pass.</li><li><code>input</code> is the original input array.</li><li><code>pool_size</code> specifies the size of the pooling window.</li><li><code>strides</code> specifies the stride length.</li><li><code>grad_output</code> is the gradient of the loss with respect to the output of the max pooling layer. Returns a new array with the gradients of the input.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-max_pool3d_backward"><a href="#val-max_pool3d_backward" class="anchor"></a><code><span><span class="keyword">val</span> max_pool3d_backward :
<span><a href="../../Owl_types/index.html#type-padding">Owl_types.padding</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>max_pool3d_backward padding input pool_size strides grad_output</code> computes the gradient of the loss with respect to the 3-dimensional <code>input</code> array after max pooling.</p><ul><li><code>padding</code> specifies the padding strategy used during the forward pass.</li><li><code>input</code> is the original input array.</li><li><code>pool_size</code> specifies the size of the pooling window.</li><li><code>strides</code> specifies the stride length.</li><li><code>grad_output</code> is the gradient of the loss with respect to the output of the max pooling layer. Returns a new array with the gradients of the input.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-avg_pool1d_backward"><a href="#val-avg_pool1d_backward" class="anchor"></a><code><span><span class="keyword">val</span> avg_pool1d_backward :
<span><a href="../../Owl_types/index.html#type-padding">Owl_types.padding</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>avg_pool1d_backward padding input pool_size strides grad_output</code> computes the gradient of the loss with respect to the 1-dimensional <code>input</code> array after average pooling.</p><ul><li><code>padding</code> specifies the padding strategy used during the forward pass.</li><li><code>input</code> is the original input array.</li><li><code>pool_size</code> specifies the size of the pooling window.</li><li><code>strides</code> specifies the stride length.</li><li><code>grad_output</code> is the gradient of the loss with respect to the output of the average pooling layer. Returns a new array with the gradients of the input.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-avg_pool2d_backward"><a href="#val-avg_pool2d_backward" class="anchor"></a><code><span><span class="keyword">val</span> avg_pool2d_backward :
<span><a href="../../Owl_types/index.html#type-padding">Owl_types.padding</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>avg_pool2d_backward padding input pool_size strides grad_output</code> computes the gradient of the loss with respect to the 2-dimensional <code>input</code> array after average pooling.</p><ul><li><code>padding</code> specifies the padding strategy used during the forward pass.</li><li><code>input</code> is the original input array.</li><li><code>pool_size</code> specifies the size of the pooling window.</li><li><code>strides</code> specifies the stride length.</li><li><code>grad_output</code> is the gradient of the loss with respect to the output of the average pooling layer. Returns a new array with the gradients of the input.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-avg_pool3d_backward"><a href="#val-avg_pool3d_backward" class="anchor"></a><code><span><span class="keyword">val</span> avg_pool3d_backward :
<span><a href="../../Owl_types/index.html#type-padding">Owl_types.padding</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>avg_pool3d_backward padding input pool_size strides grad_output</code> computes the gradient of the loss with respect to the 3-dimensional <code>input</code> array after average pooling.</p><ul><li><code>padding</code> specifies the padding strategy used during the forward pass.</li><li><code>input</code> is the original input array.</li><li><code>pool_size</code> specifies the size of the pooling window.</li><li><code>strides</code> specifies the stride length.</li><li><code>grad_output</code> is the gradient of the loss with respect to the output of the average pooling layer. Returns a new array with the gradients of the input.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-upsampling2d_backward"><a href="#val-upsampling2d_backward" class="anchor"></a><code><span><span class="keyword">val</span> upsampling2d_backward :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>upsampling2d_backward input size grad_output</code> computes the gradient of the loss with respect to the <code>input</code> array after 2-dimensional upsampling.</p><ul><li><code>input</code> is the original input array.</li><li><code>size</code> specifies the upsampling factors for each dimension.</li><li><code>grad_output</code> is the gradient of the loss with respect to the output of the upsampling layer. Returns a new array with the gradients of the input.</li></ul></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-row_num"><a href="#val-row_num" class="anchor"></a><code><span><span class="keyword">val</span> row_num : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> int</span></code></div><div class="spec-doc"><p><code>row_num arr</code> returns the number of rows in the array <code>arr</code>.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-col_num"><a href="#val-col_num" class="anchor"></a><code><span><span class="keyword">val</span> col_num : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> int</span></code></div><div class="spec-doc"><p><code>col_num arr</code> returns the number of columns in the array <code>arr</code>.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-row"><a href="#val-row" class="anchor"></a><code><span><span class="keyword">val</span> row : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <span><span class="type-var">'a</span> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>row arr idx</code> extracts the row at index <code>idx</code> from the array <code>arr</code>. Returns a new array containing the specified row.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-rows"><a href="#val-rows" class="anchor"></a><code><span><span class="keyword">val</span> rows : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <span><span>int array</span> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>rows arr indices</code> extracts multiple rows specified by <code>indices</code> from the array <code>arr</code>. Returns a new array containing the selected rows.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-copy_row_to"><a href="#val-copy_row_to" class="anchor"></a><code><span><span class="keyword">val</span> copy_row_to : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <span><span class="type-var">'a</span> <span class="arrow">-></span></span> <span><span class="type-var">'b</span> <span class="arrow">-></span></span> unit</span></code></div><div class="spec-doc"><p><code>copy_row_to src src_idx dest_idx</code> copies the row at index <code>src_idx</code> in the array <code>src</code> to the row at index <code>dest_idx</code>.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-copy_col_to"><a href="#val-copy_col_to" class="anchor"></a><code><span><span class="keyword">val</span> copy_col_to : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <span><span class="type-var">'a</span> <span class="arrow">-></span></span> <span><span class="type-var">'b</span> <span class="arrow">-></span></span> unit</span></code></div><div class="spec-doc"><p><code>copy_col_to src src_idx dest_idx</code> copies the column at index <code>src_idx</code> in the array <code>src</code> to the column at index <code>dest_idx</code>.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-diag"><a href="#val-diag" class="anchor"></a><code><span><span class="keyword">val</span> diag : <span><span class="optlabel">?k</span>:int <span class="arrow">-></span></span> <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>diag ?k arr</code> extracts the k-th diagonal from the array <code>arr</code>. If <code>k</code> is not provided, the main diagonal is extracted. Returns a new array containing the diagonal elements.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-trace"><a href="#val-trace" class="anchor"></a><code><span><span class="keyword">val</span> trace : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a></span></code></div><div class="spec-doc"><p><code>trace arr</code> computes the sum of the elements on the main diagonal of the array <code>arr</code>. Returns the trace as an element.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-dot"><a href="#val-dot" class="anchor"></a><code><span><span class="keyword">val</span> dot :
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>dot a b</code> computes the dot product of the arrays <code>a</code> and <code>b</code>. Returns a new array with the result of the dot product.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-transpose"><a href="#val-transpose" class="anchor"></a><code><span><span class="keyword">val</span> transpose :
<span><span class="optlabel">?axis</span>:<span>int array</span> <span class="arrow">-></span></span>
<span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>transpose ?axis arr</code> transposes the array <code>arr</code>. If <code>axis</code> is provided, the transpose is performed according to the specified axes. Returns a new array with the transposed data.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-to_rows"><a href="#val-to_rows" class="anchor"></a><code><span><span class="keyword">val</span> to_rows : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <span><span class="type-var">'a</span> array</span></span></code></div><div class="spec-doc"><p><code>to_rows arr</code> converts the array <code>arr</code> into an array of row vectors. Returns an array where each element is a row from the original array.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-of_rows"><a href="#val-of_rows" class="anchor"></a><code><span><span class="keyword">val</span> of_rows : <span><span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> array</span> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>of_rows rows</code> creates an array by stacking the row vectors in <code>rows</code>. Returns a new array constructed from the row vectors.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-to_cols"><a href="#val-to_cols" class="anchor"></a><code><span><span class="keyword">val</span> to_cols : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <span><span class="type-var">'a</span> array</span></span></code></div><div class="spec-doc"><p><code>to_cols arr</code> converts the array <code>arr</code> into an array of column vectors. Returns an array where each element is a column from the original array.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-of_cols"><a href="#val-of_cols" class="anchor"></a><code><span><span class="keyword">val</span> of_cols : <span><span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> array</span> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>of_cols cols</code> creates an array by stacking the column vectors in <code>cols</code>. Returns a new array constructed from the column vectors.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-of_array"><a href="#val-of_array" class="anchor"></a><code><span><span class="keyword">val</span> of_array :
<span><span><a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> array</span> <span class="arrow">-></span></span>
<span><span>int array</span> <span class="arrow">-></span></span>
<a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>of_array data shape</code> creates an array from a flat array <code>data</code> with the specified <code>shape</code>. Returns a new array with the data arranged according to the shape.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-of_arrays"><a href="#val-of_arrays" class="anchor"></a><code><span><span class="keyword">val</span> of_arrays : <span><span><span><a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> array</span> array</span> <span class="arrow">-></span></span> <a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a></span></code></div><div class="spec-doc"><p><code>of_arrays data</code> creates an array from a 2D array <code>data</code>, where each sub-array represents a row. Returns a new array with the data from the 2D array.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-to_arrays"><a href="#val-to_arrays" class="anchor"></a><code><span><span class="keyword">val</span> to_arrays : <span><a href="Symbol/Shape/Type/index.html#type-arr">Symbol.Shape.Type.arr</a> <span class="arrow">-></span></span> <span><span><a href="Symbol/Shape/Type/index.html#type-elt">Symbol.Shape.Type.elt</a> array</span> array</span></span></code></div><div class="spec-doc"><p><code>to_arrays arr</code> converts the array <code>arr</code> into a 2D array where each sub-array represents a row. Returns a 2D array with the data from the original array.</p></div></div><h6 id="scalar-functions"><a href="#scalar-functions" class="anchor"></a>Scalar functions</h6><div class="odoc-spec"><div class="spec module anchored" id="module-Scalar"><a href="#module-Scalar" class="anchor"></a><code><span><span class="keyword">module</span> <a href="Scalar/index.html">Scalar</a></span><span> : <span class="keyword">sig</span> ... <span class="keyword">end</span></span></code></div></div><div class="odoc-spec"><div class="spec module anchored" id="module-Mat"><a href="#module-Mat" class="anchor"></a><code><span><span class="keyword">module</span> <a href="Mat/index.html">Mat</a></span><span> : <span class="keyword">sig</span> ... <span class="keyword">end</span></span></code></div></div><div class="odoc-spec"><div class="spec module anchored" id="module-Linalg"><a href="#module-Linalg" class="anchor"></a><code><span><span class="keyword">module</span> <a href="Linalg/index.html">Linalg</a></span><span> : <span class="keyword">sig</span> ... <span class="keyword">end</span></span></code></div></div></details></div><div class="odoc-include"><details open="open"><summary class="spec include"><code><span><span class="keyword">include</span> <a href="../../Owl_computation_symbol_sig/module-type-Sig/index.html">Owl_computation_symbol_sig.Sig</a></span></code></summary><div class="odoc-spec"><div class="spec module anchored" id="module-Shape"><a href="#module-Shape" class="anchor"></a><code><span><span class="keyword">module</span> <a href="Shape/index.html">Shape</a></span><span> : <a href="../../Owl_computation_shape_sig/module-type-Sig/index.html">Owl_computation_shape_sig.Sig</a></span></code></div></div><h6 id="core-functions_3"><a href="#core-functions_3" class="anchor"></a>Core functions</h6><div class="odoc-spec"><div class="spec value anchored" id="val-op_to_str"><a href="#val-op_to_str" class="anchor"></a><code><span><span class="keyword">val</span> op_to_str : <span><a href="Shape/Type/index.html#type-op">Shape.Type.op</a> <span class="arrow">-></span></span> string</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-is_random_variable"><a href="#val-is_random_variable" class="anchor"></a><code><span><span class="keyword">val</span> is_random_variable : <span><a href="Shape/Type/index.html#type-op">Shape.Type.op</a> <span class="arrow">-></span></span> bool</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-refnum"><a href="#val-refnum" class="anchor"></a><code><span><span class="keyword">val</span> refnum : <span><span><span class="type-var">'a</span> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span> int</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-node_shape"><a href="#val-node_shape" class="anchor"></a><code><span><span class="keyword">val</span> node_shape : <span><span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span> <span>int array</span></span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-node_numel"><a href="#val-node_numel" class="anchor"></a><code><span><span class="keyword">val</span> node_numel : <span><span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span> int</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-is_shape_unknown"><a href="#val-is_shape_unknown" class="anchor"></a><code><span><span class="keyword">val</span> is_shape_unknown : <span><span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span> bool</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-infer_shape_graph"><a href="#val-infer_shape_graph" class="anchor"></a><code><span><span class="keyword">val</span> infer_shape_graph : <span><span><span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> array</span> <span class="arrow">-></span></span> unit</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-shape_to_str"><a href="#val-shape_to_str" class="anchor"></a><code><span><span class="keyword">val</span> shape_to_str : <span><span><span><span>int array</span> option</span> array</span> <span class="arrow">-></span></span> string</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-node_to_str"><a href="#val-node_to_str" class="anchor"></a><code><span><span class="keyword">val</span> node_to_str : <span><span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span> string</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-node_to_arr"><a href="#val-node_to_arr" class="anchor"></a><code><span><span class="keyword">val</span> node_to_arr : <span><a href="Shape/Type/index.html#type-t">Shape.Type.t</a> <span class="arrow">-></span></span> <a href="Shape/Type/index.html#type-arr">Shape.Type.arr</a></span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-arr_to_node"><a href="#val-arr_to_node" class="anchor"></a><code><span><span class="keyword">val</span> arr_to_node : <span><a href="Shape/Type/index.html#type-arr">Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Shape/Type/index.html#type-t">Shape.Type.t</a></span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-node_to_elt"><a href="#val-node_to_elt" class="anchor"></a><code><span><span class="keyword">val</span> node_to_elt : <span><a href="Shape/Type/index.html#type-t">Shape.Type.t</a> <span class="arrow">-></span></span> <a href="Shape/Type/index.html#type-elt">Shape.Type.elt</a></span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-elt_to_node"><a href="#val-elt_to_node" class="anchor"></a><code><span><span class="keyword">val</span> elt_to_node : <span><a href="Shape/Type/index.html#type-elt">Shape.Type.elt</a> <span class="arrow">-></span></span> <a href="Shape/Type/index.html#type-t">Shape.Type.t</a></span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-make_node"><a href="#val-make_node" class="anchor"></a><code><span><span class="keyword">val</span> make_node :
<span><span class="optlabel">?name</span>:string <span class="arrow">-></span></span>
<span><span class="optlabel">?value</span>:<span><a href="Shape/Type/Device/index.html#type-value">Shape.Type.Device.value</a> array</span> <span class="arrow">-></span></span>
<span><span class="optlabel">?shape</span>:<span><span><span>int array</span> option</span> array</span> <span class="arrow">-></span></span>
<span><span class="optlabel">?freeze</span>:bool <span class="arrow">-></span></span>
<span><span class="optlabel">?reuse</span>:bool <span class="arrow">-></span></span>
<span><span class="optlabel">?state</span>:<a href="Shape/Type/index.html#type-state">Shape.Type.state</a> <span class="arrow">-></span></span>
<span><a href="Shape/Type/index.html#type-op">Shape.Type.op</a> <span class="arrow">-></span></span>
<span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span></span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-make_then_connect"><a href="#val-make_then_connect" class="anchor"></a><code><span><span class="keyword">val</span> make_then_connect :
<span><span class="optlabel">?shape</span>:<span><span><span>int array</span> option</span> array</span> <span class="arrow">-></span></span>
<span><a href="Shape/Type/index.html#type-op">Shape.Type.op</a> <span class="arrow">-></span></span>
<span><span><span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> array</span> <span class="arrow">-></span></span>
<span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span></span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-var_arr"><a href="#val-var_arr" class="anchor"></a><code><span><span class="keyword">val</span> var_arr : <span><span class="optlabel">?shape</span>:<span>int array</span> <span class="arrow">-></span></span> <span>string <span class="arrow">-></span></span> <a href="Shape/Type/index.html#type-arr">Shape.Type.arr</a></span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-var_elt"><a href="#val-var_elt" class="anchor"></a><code><span><span class="keyword">val</span> var_elt : <span>string <span class="arrow">-></span></span> <a href="Shape/Type/index.html#type-elt">Shape.Type.elt</a></span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-const_arr"><a href="#val-const_arr" class="anchor"></a><code><span><span class="keyword">val</span> const_arr : <span>string <span class="arrow">-></span></span> <span><a href="Shape/Type/Device/A/index.html#type-arr">Shape.Type.Device.A.arr</a> <span class="arrow">-></span></span> <a href="Shape/Type/index.html#type-arr">Shape.Type.arr</a></span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-const_elt"><a href="#val-const_elt" class="anchor"></a><code><span><span class="keyword">val</span> const_elt : <span>string <span class="arrow">-></span></span> <span><a href="Shape/Type/Device/A/index.html#type-elt">Shape.Type.Device.A.elt</a> <span class="arrow">-></span></span> <a href="Shape/Type/index.html#type-elt">Shape.Type.elt</a></span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-new_block_id"><a href="#val-new_block_id" class="anchor"></a><code><span><span class="keyword">val</span> new_block_id : <span>unit <span class="arrow">-></span></span> int</span></code></div><div class="spec-doc"><p><code>new_block_id ()</code> returns an unused block id.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-make_empty_block"><a href="#val-make_empty_block" class="anchor"></a><code><span><span class="keyword">val</span> make_empty_block : <span><span class="optlabel">?block_id</span>:int <span class="arrow">-></span></span> <span>int <span class="arrow">-></span></span> <a href="Shape/Type/index.html#type-block">Shape.Type.block</a></span></code></div><div class="spec-doc"><p><code>make_empty_block s</code> returns an empty block of memory of size <code>s</code>.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-make_value_block"><a href="#val-make_value_block" class="anchor"></a><code><span><span class="keyword">val</span> make_value_block :
<span><a href="Shape/Type/Device/index.html#type-value">Shape.Type.Device.value</a> <span class="arrow">-></span></span>
<span><span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span>
unit</span></code></div><div class="spec-doc"><p><code>make_value_block value node</code> creates a block of memory initialised with <code>value</code> and links the new block to <code>node</code>.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-get_block"><a href="#val-get_block" class="anchor"></a><code><span><span class="keyword">val</span> get_block : <span><span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span> <span><a href="Shape/Type/index.html#type-block">Shape.Type.block</a> array</span></span></code></div><div class="spec-doc"><p><code>get_block node</code> returns the memory block allocated to <code>node</code>. If no block is allocated, throws an exception.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-add_node_to_block"><a href="#val-add_node_to_block" class="anchor"></a><code><span><span class="keyword">val</span> add_node_to_block :
<span><span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span>
<span><a href="Shape/Type/index.html#type-block">Shape.Type.block</a> <span class="arrow">-></span></span>
unit</span></code></div><div class="spec-doc"><p>Link a node to a reusable block and initialises its memory on the memory of the block.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-get_active_node"><a href="#val-get_active_node" class="anchor"></a><code><span><span class="keyword">val</span> get_active_node : <span><a href="Shape/Type/index.html#type-block">Shape.Type.block</a> <span class="arrow">-></span></span> <span><span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> option</span></span></code></div><div class="spec-doc"><p>Return the node that is currently using the memory of the block.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-set_active_node"><a href="#val-set_active_node" class="anchor"></a><code><span><span class="keyword">val</span> set_active_node :
<span><a href="Shape/Type/index.html#type-block">Shape.Type.block</a> <span class="arrow">-></span></span>
<span><span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span>
unit</span></code></div><div class="spec-doc"><p>Update the node that is currently using the block of memory.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-get_block_id"><a href="#val-get_block_id" class="anchor"></a><code><span><span class="keyword">val</span> get_block_id : <span><span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span> int</span></code></div><div class="spec-doc"><p><code>get_block_id node</code> returns the id of the block assigned to <code>node</code>. If <code>node</code> has not been assigned yet, returns <code>-1</code>.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-set_value"><a href="#val-set_value" class="anchor"></a><code><span><span class="keyword">val</span> set_value :
<span><span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span>
<span><span><a href="Shape/Type/Device/index.html#type-value">Shape.Type.Device.value</a> array</span> <span class="arrow">-></span></span>
unit</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-get_value"><a href="#val-get_value" class="anchor"></a><code><span><span class="keyword">val</span> get_value : <span><span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span> <span><a href="Shape/Type/Device/index.html#type-value">Shape.Type.Device.value</a> array</span></span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-set_operator"><a href="#val-set_operator" class="anchor"></a><code><span><span class="keyword">val</span> set_operator : <span><span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span> <span><a href="Shape/Type/index.html#type-op">Shape.Type.op</a> <span class="arrow">-></span></span> unit</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-get_operator"><a href="#val-get_operator" class="anchor"></a><code><span><span class="keyword">val</span> get_operator : <span><span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span> <a href="Shape/Type/index.html#type-op">Shape.Type.op</a></span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-set_reuse"><a href="#val-set_reuse" class="anchor"></a><code><span><span class="keyword">val</span> set_reuse : <span><span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span> <span>bool <span class="arrow">-></span></span> unit</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-get_reuse"><a href="#val-get_reuse" class="anchor"></a><code><span><span class="keyword">val</span> get_reuse : <span><span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span> bool</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-is_shared"><a href="#val-is_shared" class="anchor"></a><code><span><span class="keyword">val</span> is_shared : <span><span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span> bool</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-get_shared_nodes"><a href="#val-get_shared_nodes" class="anchor"></a><code><span><span class="keyword">val</span> get_shared_nodes :
<span><span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span>
<span><span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> array</span></span></code></div><div class="spec-doc"><p><code>get_shared_nodes node</code> returns the nodes sharing the same block of memory as <code>node</code>.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-is_var"><a href="#val-is_var" class="anchor"></a><code><span><span class="keyword">val</span> is_var : <span><span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span> bool</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-is_const"><a href="#val-is_const" class="anchor"></a><code><span><span class="keyword">val</span> is_const : <span><span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span> bool</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-is_node_arr"><a href="#val-is_node_arr" class="anchor"></a><code><span><span class="keyword">val</span> is_node_arr : <span><span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span> bool</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-is_node_elt"><a href="#val-is_node_elt" class="anchor"></a><code><span><span class="keyword">val</span> is_node_elt : <span><span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span> bool</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-is_assigned"><a href="#val-is_assigned" class="anchor"></a><code><span><span class="keyword">val</span> is_assigned : <span><span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span> bool</span></code></div><div class="spec-doc"><p><code>is_assigned node</code> checks if a block of memory has been assigned to <code>node</code>.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-check_assigned"><a href="#val-check_assigned" class="anchor"></a><code><span><span class="keyword">val</span> check_assigned : <span><span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span> unit</span></code></div><div class="spec-doc"><p><code>check_assigned node</code> throws an exception if <code>node</code> has not been assigned to a block.</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-is_valid"><a href="#val-is_valid" class="anchor"></a><code><span><span class="keyword">val</span> is_valid : <span><span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span> bool</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-validate"><a href="#val-validate" class="anchor"></a><code><span><span class="keyword">val</span> validate : <span><span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span> unit</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-invalidate"><a href="#val-invalidate" class="anchor"></a><code><span><span class="keyword">val</span> invalidate : <span><span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span> unit</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-invalidate_graph"><a href="#val-invalidate_graph" class="anchor"></a><code><span><span class="keyword">val</span> invalidate_graph : <span><span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span> unit</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-is_freeze"><a href="#val-is_freeze" class="anchor"></a><code><span><span class="keyword">val</span> is_freeze : <span><span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span> bool</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-freeze"><a href="#val-freeze" class="anchor"></a><code><span><span class="keyword">val</span> freeze : <span><span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> <span class="arrow">-></span></span> unit</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-freeze_descendants"><a href="#val-freeze_descendants" class="anchor"></a><code><span><span class="keyword">val</span> freeze_descendants : <span><span><span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> array</span> <span class="arrow">-></span></span> unit</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-freeze_ancestors"><a href="#val-freeze_ancestors" class="anchor"></a><code><span><span class="keyword">val</span> freeze_ancestors : <span><span><span><a href="Shape/Type/index.html#type-attr">Shape.Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> array</span> <span class="arrow">-></span></span> unit</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-pack_arr"><a href="#val-pack_arr" class="anchor"></a><code><span><span class="keyword">val</span> pack_arr : <span><a href="Shape/Type/Device/A/index.html#type-arr">Shape.Type.Device.A.arr</a> <span class="arrow">-></span></span> <a href="Shape/Type/index.html#type-arr">Shape.Type.arr</a></span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-unpack_arr"><a href="#val-unpack_arr" class="anchor"></a><code><span><span class="keyword">val</span> unpack_arr : <span><a href="Shape/Type/index.html#type-arr">Shape.Type.arr</a> <span class="arrow">-></span></span> <a href="Shape/Type/Device/A/index.html#type-arr">Shape.Type.Device.A.arr</a></span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-pack_elt"><a href="#val-pack_elt" class="anchor"></a><code><span><span class="keyword">val</span> pack_elt : <span><a href="Shape/Type/Device/A/index.html#type-elt">Shape.Type.Device.A.elt</a> <span class="arrow">-></span></span> <a href="Shape/Type/index.html#type-elt">Shape.Type.elt</a></span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-unpack_elt"><a href="#val-unpack_elt" class="anchor"></a><code><span><span class="keyword">val</span> unpack_elt : <span><a href="Shape/Type/index.html#type-elt">Shape.Type.elt</a> <span class="arrow">-></span></span> <a href="Shape/Type/Device/A/index.html#type-elt">Shape.Type.Device.A.elt</a></span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-unsafe_assign_arr"><a href="#val-unsafe_assign_arr" class="anchor"></a><code><span><span class="keyword">val</span> unsafe_assign_arr : <span><a href="Shape/Type/index.html#type-arr">Shape.Type.arr</a> <span class="arrow">-></span></span> <span><a href="Shape/Type/Device/A/index.html#type-arr">Shape.Type.Device.A.arr</a> <span class="arrow">-></span></span> unit</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-assign_arr"><a href="#val-assign_arr" class="anchor"></a><code><span><span class="keyword">val</span> assign_arr : <span><a href="Shape/Type/index.html#type-arr">Shape.Type.arr</a> <span class="arrow">-></span></span> <span><a href="Shape/Type/Device/A/index.html#type-arr">Shape.Type.Device.A.arr</a> <span class="arrow">-></span></span> unit</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-assign_elt"><a href="#val-assign_elt" class="anchor"></a><code><span><span class="keyword">val</span> assign_elt : <span><a href="Shape/Type/index.html#type-elt">Shape.Type.elt</a> <span class="arrow">-></span></span> <span><a href="Shape/Type/Device/A/index.html#type-elt">Shape.Type.Device.A.elt</a> <span class="arrow">-></span></span> unit</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-float_to_elt"><a href="#val-float_to_elt" class="anchor"></a><code><span><span class="keyword">val</span> float_to_elt : <span>float <span class="arrow">-></span></span> <a href="Shape/Type/index.html#type-elt">Shape.Type.elt</a></span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-elt_to_float"><a href="#val-elt_to_float" class="anchor"></a><code><span><span class="keyword">val</span> elt_to_float : <span><a href="Shape/Type/index.html#type-elt">Shape.Type.elt</a> <span class="arrow">-></span></span> float</span></code></div><div class="spec-doc"><p>TODO</p></div></div></details></div><div class="odoc-include"><details open="open"><summary class="spec include"><code><span><span class="keyword">include</span> <a href="../../Owl_computation_shape_sig/module-type-Sig/index.html">Owl_computation_shape_sig.Sig</a></span></code></summary><div class="odoc-spec"><div class="spec module anchored" id="module-Type"><a href="#module-Type" class="anchor"></a><code><span><span class="keyword">module</span> <a href="Type/index.html">Type</a></span><span> : <a href="../../Owl_computation_type_sig/module-type-Sig/index.html">Owl_computation_type_sig.Sig</a></span></code></div></div><h6 id="core-functions_4"><a href="#core-functions_4" class="anchor"></a>Core functions</h6><div class="odoc-spec"><div class="spec value anchored" id="val-infer_shape"><a href="#val-infer_shape" class="anchor"></a><code><span><span class="keyword">val</span> infer_shape :
<span><a href="Type/index.html#type-op">Type.op</a> <span class="arrow">-></span></span>
<span><span><span><a href="Type/index.html#type-attr">Type.attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span> array</span> <span class="arrow">-></span></span>
<span><span><span>int array</span> option</span> array</span></span></code></div><div class="spec-doc"><p>TODO</p></div></div></details></div><div class="odoc-include"><details open="open"><summary class="spec include"><code><span><span class="keyword">include</span> <a href="../../Owl_computation_type_sig/module-type-Sig/index.html">Owl_computation_type_sig.Sig</a></span></code></summary><div class="odoc-spec"><div class="spec module anchored" id="module-Device"><a href="#module-Device" class="anchor"></a><code><span><span class="keyword">module</span> <a href="Device/index.html">Device</a></span><span> : <a href="../../Owl_types_computation_device/module-type-Sig/index.html">Owl_types_computation_device.Sig</a></span></code></div></div><h6 id="type-definition_2"><a href="#type-definition_2" class="anchor"></a>Type definition</h6><div class="odoc-spec"><div class="spec type anchored" id="type-state"><a href="#type-state" class="anchor"></a><code><span><span class="keyword">type</span> state</span><span> = </span></code><ol><li id="type-state.Valid" class="def variant constructor anchored"><a href="#type-state.Valid" class="anchor"></a><code><span>| </span><span><span class="constructor">Valid</span></span></code></li><li id="type-state.Invalid" class="def variant constructor anchored"><a href="#type-state.Invalid" class="anchor"></a><code><span>| </span><span><span class="constructor">Invalid</span></span></code><div class="def-doc"><span class="comment-delim">(*</span><p>TODO</p><span class="comment-delim">*)</span></div></li></ol></div></div><div class="odoc-spec"><div class="spec type anchored" id="type-t"><a href="#type-t" class="anchor"></a><code><span><span class="keyword">type</span> t</span><span> = <span><a href="#type-attr">attr</a> <a href="../../Owl_graph/index.html#type-node">Owl_graph.node</a></span></span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec type anchored" id="type-block"><a href="#type-block" class="anchor"></a><code><span><span class="keyword">and</span> block</span><span> = </span><span>{</span></code><ol><li id="type-block.size" class="def record field anchored"><a href="#type-block.size" class="anchor"></a><code><span>size : int;</span></code></li><li id="type-block.block_id" class="def record field anchored"><a href="#type-block.block_id" class="anchor"></a><code><span>block_id : int;</span></code></li><li id="type-block.active" class="def record field anchored"><a href="#type-block.active" class="anchor"></a><code><span><span class="keyword">mutable</span> active : <span><a href="#type-t">t</a> option</span>;</span></code></li><li id="type-block.memory" class="def record field anchored"><a href="#type-block.memory" class="anchor"></a><code><span><span class="keyword">mutable</span> memory : <a href="Device/index.html#type-value">Device.value</a>;</span></code></li><li id="type-block.nodes" class="def record field anchored"><a href="#type-block.nodes" class="anchor"></a><code><span><span class="keyword">mutable</span> nodes : <span><a href="#type-t">t</a> list</span>;</span></code></li></ol><code><span>}</span></code></div><div class="spec-doc"><p><code>block</code> type keeps a reference to a block of memory and to the nodes sharing that block.</p></div></div><div class="odoc-spec"><div class="spec type anchored" id="type-attr"><a href="#type-attr" class="anchor"></a><code><span><span class="keyword">and</span> attr</span><span> = </span><span>{</span></code><ol><li id="type-attr.op" class="def record field anchored"><a href="#type-attr.op" class="anchor"></a><code><span><span class="keyword">mutable</span> op : <a href="#type-op">op</a>;</span></code></li><li id="type-attr.freeze" class="def record field anchored"><a href="#type-attr.freeze" class="anchor"></a><code><span><span class="keyword">mutable</span> freeze : bool;</span></code></li><li id="type-attr.reuse" class="def record field anchored"><a href="#type-attr.reuse" class="anchor"></a><code><span><span class="keyword">mutable</span> reuse : bool;</span></code></li><li id="type-attr.state" class="def record field anchored"><a href="#type-attr.state" class="anchor"></a><code><span><span class="keyword">mutable</span> state : <a href="#type-state">state</a>;</span></code></li><li id="type-attr.shape" class="def record field anchored"><a href="#type-attr.shape" class="anchor"></a><code><span><span class="keyword">mutable</span> shape : <span><span><span>int array</span> option</span> array</span>;</span></code></li><li id="type-attr.value" class="def record field anchored"><a href="#type-attr.value" class="anchor"></a><code><span><span class="keyword">mutable</span> value : <span><a href="Device/index.html#type-value">Device.value</a> array</span>;</span></code></li><li id="type-attr.block" class="def record field anchored"><a href="#type-attr.block" class="anchor"></a><code><span><span class="keyword">mutable</span> block : <span><span><a href="#type-block">block</a> array</span> option</span>;</span></code></li></ol><code><span>}</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec type anchored" id="type-arr"><a href="#type-arr" class="anchor"></a><code><span><span class="keyword">and</span> arr</span><span> = </span></code><ol><li id="type-arr.Arr" class="def variant constructor anchored"><a href="#type-arr.Arr" class="anchor"></a><code><span>| </span><span><span class="constructor">Arr</span> <span class="keyword">of</span> <a href="#type-t">t</a></span></code></li></ol></div></div><div class="odoc-spec"><div class="spec type anchored" id="type-elt"><a href="#type-elt" class="anchor"></a><code><span><span class="keyword">and</span> elt</span><span> = </span></code><ol><li id="type-elt.Elt" class="def variant constructor anchored"><a href="#type-elt.Elt" class="anchor"></a><code><span>| </span><span><span class="constructor">Elt</span> <span class="keyword">of</span> <a href="#type-t">t</a></span></code></li></ol></div></div><div class="odoc-spec"><div class="spec type anchored" id="type-op"><a href="#type-op" class="anchor"></a><code><span><span class="keyword">and</span> op</span><span> = </span></code><ol><li id="type-op.Noop" class="def variant constructor anchored"><a href="#type-op.Noop" class="anchor"></a><code><span>| </span><span><span class="constructor">Noop</span></span></code></li><li id="type-op.Var" class="def variant constructor anchored"><a href="#type-op.Var" class="anchor"></a><code><span>| </span><span><span class="constructor">Var</span></span></code></li><li id="type-op.Const" class="def variant constructor anchored"><a href="#type-op.Const" class="anchor"></a><code><span>| </span><span><span class="constructor">Const</span></span></code></li><li id="type-op.Empty" class="def variant constructor anchored"><a href="#type-op.Empty" class="anchor"></a><code><span>| </span><span><span class="constructor">Empty</span> <span class="keyword">of</span> <span>int array</span></span></code></li><li id="type-op.Zeros" class="def variant constructor anchored"><a href="#type-op.Zeros" class="anchor"></a><code><span>| </span><span><span class="constructor">Zeros</span> <span class="keyword">of</span> <span>int array</span></span></code></li><li id="type-op.Ones" class="def variant constructor anchored"><a href="#type-op.Ones" class="anchor"></a><code><span>| </span><span><span class="constructor">Ones</span> <span class="keyword">of</span> <span>int array</span></span></code></li><li id="type-op.Create" class="def variant constructor anchored"><a href="#type-op.Create" class="anchor"></a><code><span>| </span><span><span class="constructor">Create</span> <span class="keyword">of</span> <span>int array</span></span></code></li><li id="type-op.Sequential" class="def variant constructor anchored"><a href="#type-op.Sequential" class="anchor"></a><code><span>| </span><span><span class="constructor">Sequential</span> <span class="keyword">of</span> <span>int array</span></span></code></li><li id="type-op.Uniform" class="def variant constructor anchored"><a href="#type-op.Uniform" class="anchor"></a><code><span>| </span><span><span class="constructor">Uniform</span> <span class="keyword">of</span> <span>int array</span></span></code></li><li id="type-op.Gaussian" class="def variant constructor anchored"><a href="#type-op.Gaussian" class="anchor"></a><code><span>| </span><span><span class="constructor">Gaussian</span> <span class="keyword">of</span> <span>int array</span></span></code></li><li id="type-op.Bernoulli" class="def variant constructor anchored"><a href="#type-op.Bernoulli" class="anchor"></a><code><span>| </span><span><span class="constructor">Bernoulli</span> <span class="keyword">of</span> <span>int array</span></span></code></li><li id="type-op.Init" class="def variant constructor anchored"><a href="#type-op.Init" class="anchor"></a><code><span>| </span><span><span class="constructor">Init</span> <span class="keyword">of</span> <span>int array</span> * <span>int <span class="arrow">-></span></span> <a href="#type-elt">elt</a></span></code></li><li id="type-op.Get" class="def variant constructor anchored"><a href="#type-op.Get" class="anchor"></a><code><span>| </span><span><span class="constructor">Get</span> <span class="keyword">of</span> <span>int array</span></span></code></li><li id="type-op.Set" class="def variant constructor anchored"><a href="#type-op.Set" class="anchor"></a><code><span>| </span><span><span class="constructor">Set</span> <span class="keyword">of</span> <span>int array</span></span></code></li><li id="type-op.GetSlice" class="def variant constructor anchored"><a href="#type-op.GetSlice" class="anchor"></a><code><span>| </span><span><span class="constructor">GetSlice</span> <span class="keyword">of</span> <span><span>int list</span> list</span></span></code></li><li id="type-op.SetSlice" class="def variant constructor anchored"><a href="#type-op.SetSlice" class="anchor"></a><code><span>| </span><span><span class="constructor">SetSlice</span> <span class="keyword">of</span> <span><span>int list</span> list</span></span></code></li><li id="type-op.GetFancy" class="def variant constructor anchored"><a href="#type-op.GetFancy" class="anchor"></a><code><span>| </span><span><span class="constructor">GetFancy</span> <span class="keyword">of</span> <span><a href="../../Owl_types_common/index.html#type-index">Owl_types_common.index</a> list</span></span></code></li><li id="type-op.SetFancy" class="def variant constructor anchored"><a href="#type-op.SetFancy" class="anchor"></a><code><span>| </span><span><span class="constructor">SetFancy</span> <span class="keyword">of</span> <span><a href="../../Owl_types_common/index.html#type-index">Owl_types_common.index</a> list</span></span></code></li><li id="type-op.Copy" class="def variant constructor anchored"><a href="#type-op.Copy" class="anchor"></a><code><span>| </span><span><span class="constructor">Copy</span></span></code></li><li id="type-op.Reset" class="def variant constructor anchored"><a href="#type-op.Reset" class="anchor"></a><code><span>| </span><span><span class="constructor">Reset</span></span></code></li><li id="type-op.Reshape" class="def variant constructor anchored"><a href="#type-op.Reshape" class="anchor"></a><code><span>| </span><span><span class="constructor">Reshape</span> <span class="keyword">of</span> <span>int array</span></span></code></li><li id="type-op.Reverse" class="def variant constructor anchored"><a href="#type-op.Reverse" class="anchor"></a><code><span>| </span><span><span class="constructor">Reverse</span></span></code></li><li id="type-op.Tile" class="def variant constructor anchored"><a href="#type-op.Tile" class="anchor"></a><code><span>| </span><span><span class="constructor">Tile</span> <span class="keyword">of</span> <span>int array</span></span></code></li><li id="type-op.Repeat" class="def variant constructor anchored"><a href="#type-op.Repeat" class="anchor"></a><code><span>| </span><span><span class="constructor">Repeat</span> <span class="keyword">of</span> <span>int array</span></span></code></li><li id="type-op.Pad" class="def variant constructor anchored"><a href="#type-op.Pad" class="anchor"></a><code><span>| </span><span><span class="constructor">Pad</span> <span class="keyword">of</span> <a href="#type-elt">elt</a> * <span><span>int list</span> list</span></span></code></li><li id="type-op.Concatenate" class="def variant constructor anchored"><a href="#type-op.Concatenate" class="anchor"></a><code><span>| </span><span><span class="constructor">Concatenate</span> <span class="keyword">of</span> int</span></code></li><li id="type-op.Stack" class="def variant constructor anchored"><a href="#type-op.Stack" class="anchor"></a><code><span>| </span><span><span class="constructor">Stack</span> <span class="keyword">of</span> int</span></code></li><li id="type-op.Split" class="def variant constructor anchored"><a href="#type-op.Split" class="anchor"></a><code><span>| </span><span><span class="constructor">Split</span> <span class="keyword">of</span> int * <span>int array</span></span></code></li><li id="type-op.Draw" class="def variant constructor anchored"><a href="#type-op.Draw" class="anchor"></a><code><span>| </span><span><span class="constructor">Draw</span> <span class="keyword">of</span> int * int</span></code></li><li id="type-op.Map" class="def variant constructor anchored"><a href="#type-op.Map" class="anchor"></a><code><span>| </span><span><span class="constructor">Map</span> <span class="keyword">of</span> <span><a href="#type-elt">elt</a> <span class="arrow">-></span></span> <a href="#type-elt">elt</a></span></code></li><li id="type-op.Fold" class="def variant constructor anchored"><a href="#type-op.Fold" class="anchor"></a><code><span>| </span><span><span class="constructor">Fold</span> <span class="keyword">of</span> int * <span><a href="#type-elt">elt</a> <span class="arrow">-></span></span> <span><a href="#type-elt">elt</a> <span class="arrow">-></span></span> <a href="#type-elt">elt</a></span></code></li><li id="type-op.Scan" class="def variant constructor anchored"><a href="#type-op.Scan" class="anchor"></a><code><span>| </span><span><span class="constructor">Scan</span> <span class="keyword">of</span> int * <span><a href="#type-elt">elt</a> <span class="arrow">-></span></span> <span><a href="#type-elt">elt</a> <span class="arrow">-></span></span> <a href="#type-elt">elt</a></span></code></li><li id="type-op.OneHot" class="def variant constructor anchored"><a href="#type-op.OneHot" class="anchor"></a><code><span>| </span><span><span class="constructor">OneHot</span> <span class="keyword">of</span> int</span></code></li><li id="type-op.OfArray" class="def variant constructor anchored"><a href="#type-op.OfArray" class="anchor"></a><code><span>| </span><span><span class="constructor">OfArray</span> <span class="keyword">of</span> <span>int array</span></span></code></li><li id="type-op.Delay" class="def variant constructor anchored"><a href="#type-op.Delay" class="anchor"></a><code><span>| </span><span><span class="constructor">Delay</span> <span class="keyword">of</span> <span><a href="Device/A/index.html#type-arr">Device.A.arr</a> <span class="arrow">-></span></span> <a href="Device/A/index.html#type-arr">Device.A.arr</a></span></code></li><li id="type-op.DelayArray" class="def variant constructor anchored"><a href="#type-op.DelayArray" class="anchor"></a><code><span>| </span><span><span class="constructor">DelayArray</span> <span class="keyword">of</span> <span>int array</span> * <span><span><a href="Device/A/index.html#type-arr">Device.A.arr</a> array</span> <span class="arrow">-></span></span> <a href="Device/A/index.html#type-arr">Device.A.arr</a></span></code></li><li id="type-op.LazyPrint" class="def variant constructor anchored"><a href="#type-op.LazyPrint" class="anchor"></a><code><span>| </span><span><span class="constructor">LazyPrint</span> <span class="keyword">of</span> <span>int option</span>
* <span>int option</span>
* <span>bool option</span>
* <span><span>(<span><a href="Device/A/index.html#type-elt">Device.A.elt</a> <span class="arrow">-></span></span> string)</span> option</span></span></code></li><li id="type-op.Abs" class="def variant constructor anchored"><a href="#type-op.Abs" class="anchor"></a><code><span>| </span><span><span class="constructor">Abs</span></span></code></li><li id="type-op.Neg" class="def variant constructor anchored"><a href="#type-op.Neg" class="anchor"></a><code><span>| </span><span><span class="constructor">Neg</span></span></code></li><li id="type-op.Floor" class="def variant constructor anchored"><a href="#type-op.Floor" class="anchor"></a><code><span>| </span><span><span class="constructor">Floor</span></span></code></li><li id="type-op.Ceil" class="def variant constructor anchored"><a href="#type-op.Ceil" class="anchor"></a><code><span>| </span><span><span class="constructor">Ceil</span></span></code></li><li id="type-op.Round" class="def variant constructor anchored"><a href="#type-op.Round" class="anchor"></a><code><span>| </span><span><span class="constructor">Round</span></span></code></li><li id="type-op.Sqr" class="def variant constructor anchored"><a href="#type-op.Sqr" class="anchor"></a><code><span>| </span><span><span class="constructor">Sqr</span></span></code></li><li id="type-op.Sqrt" class="def variant constructor anchored"><a href="#type-op.Sqrt" class="anchor"></a><code><span>| </span><span><span class="constructor">Sqrt</span></span></code></li><li id="type-op.Log" class="def variant constructor anchored"><a href="#type-op.Log" class="anchor"></a><code><span>| </span><span><span class="constructor">Log</span></span></code></li><li id="type-op.Log2" class="def variant constructor anchored"><a href="#type-op.Log2" class="anchor"></a><code><span>| </span><span><span class="constructor">Log2</span></span></code></li><li id="type-op.Log10" class="def variant constructor anchored"><a href="#type-op.Log10" class="anchor"></a><code><span>| </span><span><span class="constructor">Log10</span></span></code></li><li id="type-op.Exp" class="def variant constructor anchored"><a href="#type-op.Exp" class="anchor"></a><code><span>| </span><span><span class="constructor">Exp</span></span></code></li><li id="type-op.Sin" class="def variant constructor anchored"><a href="#type-op.Sin" class="anchor"></a><code><span>| </span><span><span class="constructor">Sin</span></span></code></li><li id="type-op.Cos" class="def variant constructor anchored"><a href="#type-op.Cos" class="anchor"></a><code><span>| </span><span><span class="constructor">Cos</span></span></code></li><li id="type-op.Tan" class="def variant constructor anchored"><a href="#type-op.Tan" class="anchor"></a><code><span>| </span><span><span class="constructor">Tan</span></span></code></li><li id="type-op.Sinh" class="def variant constructor anchored"><a href="#type-op.Sinh" class="anchor"></a><code><span>| </span><span><span class="constructor">Sinh</span></span></code></li><li id="type-op.Cosh" class="def variant constructor anchored"><a href="#type-op.Cosh" class="anchor"></a><code><span>| </span><span><span class="constructor">Cosh</span></span></code></li><li id="type-op.Tanh" class="def variant constructor anchored"><a href="#type-op.Tanh" class="anchor"></a><code><span>| </span><span><span class="constructor">Tanh</span></span></code></li><li id="type-op.Asin" class="def variant constructor anchored"><a href="#type-op.Asin" class="anchor"></a><code><span>| </span><span><span class="constructor">Asin</span></span></code></li><li id="type-op.Acos" class="def variant constructor anchored"><a href="#type-op.Acos" class="anchor"></a><code><span>| </span><span><span class="constructor">Acos</span></span></code></li><li id="type-op.Atan" class="def variant constructor anchored"><a href="#type-op.Atan" class="anchor"></a><code><span>| </span><span><span class="constructor">Atan</span></span></code></li><li id="type-op.Asinh" class="def variant constructor anchored"><a href="#type-op.Asinh" class="anchor"></a><code><span>| </span><span><span class="constructor">Asinh</span></span></code></li><li id="type-op.Acosh" class="def variant constructor anchored"><a href="#type-op.Acosh" class="anchor"></a><code><span>| </span><span><span class="constructor">Acosh</span></span></code></li><li id="type-op.Atanh" class="def variant constructor anchored"><a href="#type-op.Atanh" class="anchor"></a><code><span>| </span><span><span class="constructor">Atanh</span></span></code></li><li id="type-op.Min" class="def variant constructor anchored"><a href="#type-op.Min" class="anchor"></a><code><span>| </span><span><span class="constructor">Min</span> <span class="keyword">of</span> bool * int</span></code></li><li id="type-op.Max" class="def variant constructor anchored"><a href="#type-op.Max" class="anchor"></a><code><span>| </span><span><span class="constructor">Max</span> <span class="keyword">of</span> bool * int</span></code></li><li id="type-op.Sum" class="def variant constructor anchored"><a href="#type-op.Sum" class="anchor"></a><code><span>| </span><span><span class="constructor">Sum</span> <span class="keyword">of</span> bool * int</span></code></li><li id="type-op.SumReduce" class="def variant constructor anchored"><a href="#type-op.SumReduce" class="anchor"></a><code><span>| </span><span><span class="constructor">SumReduce</span> <span class="keyword">of</span> <span>int array</span></span></code></li><li id="type-op.Signum" class="def variant constructor anchored"><a href="#type-op.Signum" class="anchor"></a><code><span>| </span><span><span class="constructor">Signum</span></span></code></li><li id="type-op.Sigmoid" class="def variant constructor anchored"><a href="#type-op.Sigmoid" class="anchor"></a><code><span>| </span><span><span class="constructor">Sigmoid</span></span></code></li><li id="type-op.Relu" class="def variant constructor anchored"><a href="#type-op.Relu" class="anchor"></a><code><span>| </span><span><span class="constructor">Relu</span></span></code></li><li id="type-op.Dawsn" class="def variant constructor anchored"><a href="#type-op.Dawsn" class="anchor"></a><code><span>| </span><span><span class="constructor">Dawsn</span></span></code></li><li id="type-op.Min'" class="def variant constructor anchored"><a href="#type-op.Min'" class="anchor"></a><code><span>| </span><span><span class="constructor">Min'</span></span></code></li><li id="type-op.Max'" class="def variant constructor anchored"><a href="#type-op.Max'" class="anchor"></a><code><span>| </span><span><span class="constructor">Max'</span></span></code></li><li id="type-op.Sum'" class="def variant constructor anchored"><a href="#type-op.Sum'" class="anchor"></a><code><span>| </span><span><span class="constructor">Sum'</span></span></code></li><li id="type-op.LogSumExp'" class="def variant constructor anchored"><a href="#type-op.LogSumExp'" class="anchor"></a><code><span>| </span><span><span class="constructor">LogSumExp'</span></span></code></li><li id="type-op.LogSumExp" class="def variant constructor anchored"><a href="#type-op.LogSumExp" class="anchor"></a><code><span>| </span><span><span class="constructor">LogSumExp</span> <span class="keyword">of</span> bool * int</span></code></li><li id="type-op.L1norm'" class="def variant constructor anchored"><a href="#type-op.L1norm'" class="anchor"></a><code><span>| </span><span><span class="constructor">L1norm'</span></span></code></li><li id="type-op.L2norm'" class="def variant constructor anchored"><a href="#type-op.L2norm'" class="anchor"></a><code><span>| </span><span><span class="constructor">L2norm'</span></span></code></li><li id="type-op.L2NormSqr'" class="def variant constructor anchored"><a href="#type-op.L2NormSqr'" class="anchor"></a><code><span>| </span><span><span class="constructor">L2NormSqr'</span></span></code></li><li id="type-op.ClipByValue" class="def variant constructor anchored"><a href="#type-op.ClipByValue" class="anchor"></a><code><span>| </span><span><span class="constructor">ClipByValue</span></span></code></li><li id="type-op.ClipByL2norm" class="def variant constructor anchored"><a href="#type-op.ClipByL2norm" class="anchor"></a><code><span>| </span><span><span class="constructor">ClipByL2norm</span></span></code></li><li id="type-op.Pow" class="def variant constructor anchored"><a href="#type-op.Pow" class="anchor"></a><code><span>| </span><span><span class="constructor">Pow</span></span></code></li><li id="type-op.ScalarPow" class="def variant constructor anchored"><a href="#type-op.ScalarPow" class="anchor"></a><code><span>| </span><span><span class="constructor">ScalarPow</span></span></code></li><li id="type-op.PowScalar" class="def variant constructor anchored"><a href="#type-op.PowScalar" class="anchor"></a><code><span>| </span><span><span class="constructor">PowScalar</span></span></code></li><li id="type-op.Atan2" class="def variant constructor anchored"><a href="#type-op.Atan2" class="anchor"></a><code><span>| </span><span><span class="constructor">Atan2</span></span></code></li><li id="type-op.ScalarAtan2" class="def variant constructor anchored"><a href="#type-op.ScalarAtan2" class="anchor"></a><code><span>| </span><span><span class="constructor">ScalarAtan2</span></span></code></li><li id="type-op.Atan2Scalar" class="def variant constructor anchored"><a href="#type-op.Atan2Scalar" class="anchor"></a><code><span>| </span><span><span class="constructor">Atan2Scalar</span></span></code></li><li id="type-op.Hypot" class="def variant constructor anchored"><a href="#type-op.Hypot" class="anchor"></a><code><span>| </span><span><span class="constructor">Hypot</span></span></code></li><li id="type-op.Min2" class="def variant constructor anchored"><a href="#type-op.Min2" class="anchor"></a><code><span>| </span><span><span class="constructor">Min2</span></span></code></li><li id="type-op.Max2" class="def variant constructor anchored"><a href="#type-op.Max2" class="anchor"></a><code><span>| </span><span><span class="constructor">Max2</span></span></code></li><li id="type-op.Add" class="def variant constructor anchored"><a href="#type-op.Add" class="anchor"></a><code><span>| </span><span><span class="constructor">Add</span></span></code></li><li id="type-op.Sub" class="def variant constructor anchored"><a href="#type-op.Sub" class="anchor"></a><code><span>| </span><span><span class="constructor">Sub</span></span></code></li><li id="type-op.Mul" class="def variant constructor anchored"><a href="#type-op.Mul" class="anchor"></a><code><span>| </span><span><span class="constructor">Mul</span></span></code></li><li id="type-op.Div" class="def variant constructor anchored"><a href="#type-op.Div" class="anchor"></a><code><span>| </span><span><span class="constructor">Div</span></span></code></li><li id="type-op.AddScalar" class="def variant constructor anchored"><a href="#type-op.AddScalar" class="anchor"></a><code><span>| </span><span><span class="constructor">AddScalar</span></span></code></li><li id="type-op.SubScalar" class="def variant constructor anchored"><a href="#type-op.SubScalar" class="anchor"></a><code><span>| </span><span><span class="constructor">SubScalar</span></span></code></li><li id="type-op.MulScalar" class="def variant constructor anchored"><a href="#type-op.MulScalar" class="anchor"></a><code><span>| </span><span><span class="constructor">MulScalar</span></span></code></li><li id="type-op.DivScalar" class="def variant constructor anchored"><a href="#type-op.DivScalar" class="anchor"></a><code><span>| </span><span><span class="constructor">DivScalar</span></span></code></li><li id="type-op.ScalarAdd" class="def variant constructor anchored"><a href="#type-op.ScalarAdd" class="anchor"></a><code><span>| </span><span><span class="constructor">ScalarAdd</span></span></code></li><li id="type-op.ScalarSub" class="def variant constructor anchored"><a href="#type-op.ScalarSub" class="anchor"></a><code><span>| </span><span><span class="constructor">ScalarSub</span></span></code></li><li id="type-op.ScalarMul" class="def variant constructor anchored"><a href="#type-op.ScalarMul" class="anchor"></a><code><span>| </span><span><span class="constructor">ScalarMul</span></span></code></li><li id="type-op.ScalarDiv" class="def variant constructor anchored"><a href="#type-op.ScalarDiv" class="anchor"></a><code><span>| </span><span><span class="constructor">ScalarDiv</span></span></code></li><li id="type-op.FMA" class="def variant constructor anchored"><a href="#type-op.FMA" class="anchor"></a><code><span>| </span><span><span class="constructor">FMA</span></span></code></li><li id="type-op.EltEqual" class="def variant constructor anchored"><a href="#type-op.EltEqual" class="anchor"></a><code><span>| </span><span><span class="constructor">EltEqual</span></span></code></li><li id="type-op.EltNotEqual" class="def variant constructor anchored"><a href="#type-op.EltNotEqual" class="anchor"></a><code><span>| </span><span><span class="constructor">EltNotEqual</span></span></code></li><li id="type-op.EltLess" class="def variant constructor anchored"><a href="#type-op.EltLess" class="anchor"></a><code><span>| </span><span><span class="constructor">EltLess</span></span></code></li><li id="type-op.EltGreater" class="def variant constructor anchored"><a href="#type-op.EltGreater" class="anchor"></a><code><span>| </span><span><span class="constructor">EltGreater</span></span></code></li><li id="type-op.EltLessEqual" class="def variant constructor anchored"><a href="#type-op.EltLessEqual" class="anchor"></a><code><span>| </span><span><span class="constructor">EltLessEqual</span></span></code></li><li id="type-op.EltGreaterEqual" class="def variant constructor anchored"><a href="#type-op.EltGreaterEqual" class="anchor"></a><code><span>| </span><span><span class="constructor">EltGreaterEqual</span></span></code></li><li id="type-op.EltEqualScalar" class="def variant constructor anchored"><a href="#type-op.EltEqualScalar" class="anchor"></a><code><span>| </span><span><span class="constructor">EltEqualScalar</span></span></code></li><li id="type-op.EltNotEqualScalar" class="def variant constructor anchored"><a href="#type-op.EltNotEqualScalar" class="anchor"></a><code><span>| </span><span><span class="constructor">EltNotEqualScalar</span></span></code></li><li id="type-op.EltLessScalar" class="def variant constructor anchored"><a href="#type-op.EltLessScalar" class="anchor"></a><code><span>| </span><span><span class="constructor">EltLessScalar</span></span></code></li><li id="type-op.EltGreaterScalar" class="def variant constructor anchored"><a href="#type-op.EltGreaterScalar" class="anchor"></a><code><span>| </span><span><span class="constructor">EltGreaterScalar</span></span></code></li><li id="type-op.EltLessEqualScalar" class="def variant constructor anchored"><a href="#type-op.EltLessEqualScalar" class="anchor"></a><code><span>| </span><span><span class="constructor">EltLessEqualScalar</span></span></code></li><li id="type-op.EltGreaterEqualScalar" class="def variant constructor anchored"><a href="#type-op.EltGreaterEqualScalar" class="anchor"></a><code><span>| </span><span><span class="constructor">EltGreaterEqualScalar</span></span></code></li><li id="type-op.Conv1d" class="def variant constructor anchored"><a href="#type-op.Conv1d" class="anchor"></a><code><span>| </span><span><span class="constructor">Conv1d</span> <span class="keyword">of</span> <a href="../../Owl_types_common/index.html#type-padding">Owl_types_common.padding</a> * <span>int array</span></span></code></li><li id="type-op.Conv2d" class="def variant constructor anchored"><a href="#type-op.Conv2d" class="anchor"></a><code><span>| </span><span><span class="constructor">Conv2d</span> <span class="keyword">of</span> <a href="../../Owl_types_common/index.html#type-padding">Owl_types_common.padding</a> * <span>int array</span></span></code></li><li id="type-op.Conv3d" class="def variant constructor anchored"><a href="#type-op.Conv3d" class="anchor"></a><code><span>| </span><span><span class="constructor">Conv3d</span> <span class="keyword">of</span> <a href="../../Owl_types_common/index.html#type-padding">Owl_types_common.padding</a> * <span>int array</span></span></code></li><li id="type-op.TransposeConv1d" class="def variant constructor anchored"><a href="#type-op.TransposeConv1d" class="anchor"></a><code><span>| </span><span><span class="constructor">TransposeConv1d</span> <span class="keyword">of</span> <a href="../../Owl_types_common/index.html#type-padding">Owl_types_common.padding</a> * <span>int array</span></span></code></li><li id="type-op.TransposeConv2d" class="def variant constructor anchored"><a href="#type-op.TransposeConv2d" class="anchor"></a><code><span>| </span><span><span class="constructor">TransposeConv2d</span> <span class="keyword">of</span> <a href="../../Owl_types_common/index.html#type-padding">Owl_types_common.padding</a> * <span>int array</span></span></code></li><li id="type-op.TransposeConv3d" class="def variant constructor anchored"><a href="#type-op.TransposeConv3d" class="anchor"></a><code><span>| </span><span><span class="constructor">TransposeConv3d</span> <span class="keyword">of</span> <a href="../../Owl_types_common/index.html#type-padding">Owl_types_common.padding</a> * <span>int array</span></span></code></li><li id="type-op.DilatedConv1d" class="def variant constructor anchored"><a href="#type-op.DilatedConv1d" class="anchor"></a><code><span>| </span><span><span class="constructor">DilatedConv1d</span> <span class="keyword">of</span> <a href="../../Owl_types_common/index.html#type-padding">Owl_types_common.padding</a> * <span>int array</span> * <span>int array</span></span></code></li><li id="type-op.DilatedConv2d" class="def variant constructor anchored"><a href="#type-op.DilatedConv2d" class="anchor"></a><code><span>| </span><span><span class="constructor">DilatedConv2d</span> <span class="keyword">of</span> <a href="../../Owl_types_common/index.html#type-padding">Owl_types_common.padding</a> * <span>int array</span> * <span>int array</span></span></code></li><li id="type-op.DilatedConv3d" class="def variant constructor anchored"><a href="#type-op.DilatedConv3d" class="anchor"></a><code><span>| </span><span><span class="constructor">DilatedConv3d</span> <span class="keyword">of</span> <a href="../../Owl_types_common/index.html#type-padding">Owl_types_common.padding</a> * <span>int array</span> * <span>int array</span></span></code></li><li id="type-op.MaxPool1d" class="def variant constructor anchored"><a href="#type-op.MaxPool1d" class="anchor"></a><code><span>| </span><span><span class="constructor">MaxPool1d</span> <span class="keyword">of</span> <a href="../../Owl_types_common/index.html#type-padding">Owl_types_common.padding</a> * <span>int array</span> * <span>int array</span></span></code></li><li id="type-op.MaxPool2d" class="def variant constructor anchored"><a href="#type-op.MaxPool2d" class="anchor"></a><code><span>| </span><span><span class="constructor">MaxPool2d</span> <span class="keyword">of</span> <a href="../../Owl_types_common/index.html#type-padding">Owl_types_common.padding</a> * <span>int array</span> * <span>int array</span></span></code></li><li id="type-op.MaxPool3d" class="def variant constructor anchored"><a href="#type-op.MaxPool3d" class="anchor"></a><code><span>| </span><span><span class="constructor">MaxPool3d</span> <span class="keyword">of</span> <a href="../../Owl_types_common/index.html#type-padding">Owl_types_common.padding</a> * <span>int array</span> * <span>int array</span></span></code></li><li id="type-op.AvgPool1d" class="def variant constructor anchored"><a href="#type-op.AvgPool1d" class="anchor"></a><code><span>| </span><span><span class="constructor">AvgPool1d</span> <span class="keyword">of</span> <a href="../../Owl_types_common/index.html#type-padding">Owl_types_common.padding</a> * <span>int array</span> * <span>int array</span></span></code></li><li id="type-op.AvgPool2d" class="def variant constructor anchored"><a href="#type-op.AvgPool2d" class="anchor"></a><code><span>| </span><span><span class="constructor">AvgPool2d</span> <span class="keyword">of</span> <a href="../../Owl_types_common/index.html#type-padding">Owl_types_common.padding</a> * <span>int array</span> * <span>int array</span></span></code></li><li id="type-op.AvgPool3d" class="def variant constructor anchored"><a href="#type-op.AvgPool3d" class="anchor"></a><code><span>| </span><span><span class="constructor">AvgPool3d</span> <span class="keyword">of</span> <a href="../../Owl_types_common/index.html#type-padding">Owl_types_common.padding</a> * <span>int array</span> * <span>int array</span></span></code></li><li id="type-op.UpSampling2d" class="def variant constructor anchored"><a href="#type-op.UpSampling2d" class="anchor"></a><code><span>| </span><span><span class="constructor">UpSampling2d</span> <span class="keyword">of</span> <span>int array</span></span></code></li><li id="type-op.Conv1dBackwardInput" class="def variant constructor anchored"><a href="#type-op.Conv1dBackwardInput" class="anchor"></a><code><span>| </span><span><span class="constructor">Conv1dBackwardInput</span> <span class="keyword">of</span> <span>int array</span></span></code></li><li id="type-op.Conv1dBackwardKernel" class="def variant constructor anchored"><a href="#type-op.Conv1dBackwardKernel" class="anchor"></a><code><span>| </span><span><span class="constructor">Conv1dBackwardKernel</span> <span class="keyword">of</span> <span>int array</span></span></code></li><li id="type-op.Conv2dBackwardInput" class="def variant constructor anchored"><a href="#type-op.Conv2dBackwardInput" class="anchor"></a><code><span>| </span><span><span class="constructor">Conv2dBackwardInput</span> <span class="keyword">of</span> <span>int array</span></span></code></li><li id="type-op.Conv2dBackwardKernel" class="def variant constructor anchored"><a href="#type-op.Conv2dBackwardKernel" class="anchor"></a><code><span>| </span><span><span class="constructor">Conv2dBackwardKernel</span> <span class="keyword">of</span> <span>int array</span></span></code></li><li id="type-op.Conv3dBackwardInput" class="def variant constructor anchored"><a href="#type-op.Conv3dBackwardInput" class="anchor"></a><code><span>| </span><span><span class="constructor">Conv3dBackwardInput</span> <span class="keyword">of</span> <span>int array</span></span></code></li><li id="type-op.Conv3dBackwardKernel" class="def variant constructor anchored"><a href="#type-op.Conv3dBackwardKernel" class="anchor"></a><code><span>| </span><span><span class="constructor">Conv3dBackwardKernel</span> <span class="keyword">of</span> <span>int array</span></span></code></li><li id="type-op.TransposeConv1dBackwardInput" class="def variant constructor anchored"><a href="#type-op.TransposeConv1dBackwardInput" class="anchor"></a><code><span>| </span><span><span class="constructor">TransposeConv1dBackwardInput</span> <span class="keyword">of</span> <span>int array</span></span></code></li><li id="type-op.TransposeConv1dBackwardKernel" class="def variant constructor anchored"><a href="#type-op.TransposeConv1dBackwardKernel" class="anchor"></a><code><span>| </span><span><span class="constructor">TransposeConv1dBackwardKernel</span> <span class="keyword">of</span> <span>int array</span></span></code></li><li id="type-op.TransposeConv2dBackwardInput" class="def variant constructor anchored"><a href="#type-op.TransposeConv2dBackwardInput" class="anchor"></a><code><span>| </span><span><span class="constructor">TransposeConv2dBackwardInput</span> <span class="keyword">of</span> <span>int array</span></span></code></li><li id="type-op.TransposeConv2dBackwardKernel" class="def variant constructor anchored"><a href="#type-op.TransposeConv2dBackwardKernel" class="anchor"></a><code><span>| </span><span><span class="constructor">TransposeConv2dBackwardKernel</span> <span class="keyword">of</span> <span>int array</span></span></code></li><li id="type-op.TransposeConv3dBackwardInput" class="def variant constructor anchored"><a href="#type-op.TransposeConv3dBackwardInput" class="anchor"></a><code><span>| </span><span><span class="constructor">TransposeConv3dBackwardInput</span> <span class="keyword">of</span> <span>int array</span></span></code></li><li id="type-op.TransposeConv3dBackwardKernel" class="def variant constructor anchored"><a href="#type-op.TransposeConv3dBackwardKernel" class="anchor"></a><code><span>| </span><span><span class="constructor">TransposeConv3dBackwardKernel</span> <span class="keyword">of</span> <span>int array</span></span></code></li><li id="type-op.DilatedConv1dBackwardInput" class="def variant constructor anchored"><a href="#type-op.DilatedConv1dBackwardInput" class="anchor"></a><code><span>| </span><span><span class="constructor">DilatedConv1dBackwardInput</span> <span class="keyword">of</span> <span>int array</span> * <span>int array</span></span></code></li><li id="type-op.DilatedConv1dBackwardKernel" class="def variant constructor anchored"><a href="#type-op.DilatedConv1dBackwardKernel" class="anchor"></a><code><span>| </span><span><span class="constructor">DilatedConv1dBackwardKernel</span> <span class="keyword">of</span> <span>int array</span> * <span>int array</span></span></code></li><li id="type-op.DilatedConv2dBackwardInput" class="def variant constructor anchored"><a href="#type-op.DilatedConv2dBackwardInput" class="anchor"></a><code><span>| </span><span><span class="constructor">DilatedConv2dBackwardInput</span> <span class="keyword">of</span> <span>int array</span> * <span>int array</span></span></code></li><li id="type-op.DilatedConv2dBackwardKernel" class="def variant constructor anchored"><a href="#type-op.DilatedConv2dBackwardKernel" class="anchor"></a><code><span>| </span><span><span class="constructor">DilatedConv2dBackwardKernel</span> <span class="keyword">of</span> <span>int array</span> * <span>int array</span></span></code></li><li id="type-op.DilatedConv3dBackwardInput" class="def variant constructor anchored"><a href="#type-op.DilatedConv3dBackwardInput" class="anchor"></a><code><span>| </span><span><span class="constructor">DilatedConv3dBackwardInput</span> <span class="keyword">of</span> <span>int array</span> * <span>int array</span></span></code></li><li id="type-op.DilatedConv3dBackwardKernel" class="def variant constructor anchored"><a href="#type-op.DilatedConv3dBackwardKernel" class="anchor"></a><code><span>| </span><span><span class="constructor">DilatedConv3dBackwardKernel</span> <span class="keyword">of</span> <span>int array</span> * <span>int array</span></span></code></li><li id="type-op.MaxPool1dBackward" class="def variant constructor anchored"><a href="#type-op.MaxPool1dBackward" class="anchor"></a><code><span>| </span><span><span class="constructor">MaxPool1dBackward</span> <span class="keyword">of</span> <a href="../../Owl_types_common/index.html#type-padding">Owl_types_common.padding</a> * <span>int array</span> * <span>int array</span></span></code></li><li id="type-op.MaxPool2dBackward" class="def variant constructor anchored"><a href="#type-op.MaxPool2dBackward" class="anchor"></a><code><span>| </span><span><span class="constructor">MaxPool2dBackward</span> <span class="keyword">of</span> <a href="../../Owl_types_common/index.html#type-padding">Owl_types_common.padding</a> * <span>int array</span> * <span>int array</span></span></code></li><li id="type-op.MaxPool3dBackward" class="def variant constructor anchored"><a href="#type-op.MaxPool3dBackward" class="anchor"></a><code><span>| </span><span><span class="constructor">MaxPool3dBackward</span> <span class="keyword">of</span> <a href="../../Owl_types_common/index.html#type-padding">Owl_types_common.padding</a> * <span>int array</span> * <span>int array</span></span></code></li><li id="type-op.AvgPool1dBackward" class="def variant constructor anchored"><a href="#type-op.AvgPool1dBackward" class="anchor"></a><code><span>| </span><span><span class="constructor">AvgPool1dBackward</span> <span class="keyword">of</span> <a href="../../Owl_types_common/index.html#type-padding">Owl_types_common.padding</a> * <span>int array</span> * <span>int array</span></span></code></li><li id="type-op.AvgPool2dBackward" class="def variant constructor anchored"><a href="#type-op.AvgPool2dBackward" class="anchor"></a><code><span>| </span><span><span class="constructor">AvgPool2dBackward</span> <span class="keyword">of</span> <a href="../../Owl_types_common/index.html#type-padding">Owl_types_common.padding</a> * <span>int array</span> * <span>int array</span></span></code></li><li id="type-op.AvgPool3dBackward" class="def variant constructor anchored"><a href="#type-op.AvgPool3dBackward" class="anchor"></a><code><span>| </span><span><span class="constructor">AvgPool3dBackward</span> <span class="keyword">of</span> <a href="../../Owl_types_common/index.html#type-padding">Owl_types_common.padding</a> * <span>int array</span> * <span>int array</span></span></code></li><li id="type-op.UpSampling2dBackward" class="def variant constructor anchored"><a href="#type-op.UpSampling2dBackward" class="anchor"></a><code><span>| </span><span><span class="constructor">UpSampling2dBackward</span> <span class="keyword">of</span> <span>int array</span></span></code></li><li id="type-op.RowNum" class="def variant constructor anchored"><a href="#type-op.RowNum" class="anchor"></a><code><span>| </span><span><span class="constructor">RowNum</span></span></code></li><li id="type-op.ColNum" class="def variant constructor anchored"><a href="#type-op.ColNum" class="anchor"></a><code><span>| </span><span><span class="constructor">ColNum</span></span></code></li><li id="type-op.Row" class="def variant constructor anchored"><a href="#type-op.Row" class="anchor"></a><code><span>| </span><span><span class="constructor">Row</span></span></code></li><li id="type-op.Rows" class="def variant constructor anchored"><a href="#type-op.Rows" class="anchor"></a><code><span>| </span><span><span class="constructor">Rows</span> <span class="keyword">of</span> <span>int array</span></span></code></li><li id="type-op.CopyRowTo" class="def variant constructor anchored"><a href="#type-op.CopyRowTo" class="anchor"></a><code><span>| </span><span><span class="constructor">CopyRowTo</span></span></code></li><li id="type-op.CopyColTo" class="def variant constructor anchored"><a href="#type-op.CopyColTo" class="anchor"></a><code><span>| </span><span><span class="constructor">CopyColTo</span></span></code></li><li id="type-op.Dot" class="def variant constructor anchored"><a href="#type-op.Dot" class="anchor"></a><code><span>| </span><span><span class="constructor">Dot</span> <span class="keyword">of</span> bool * bool * <a href="#type-elt">elt</a> * <a href="#type-elt">elt</a></span></code></li><li id="type-op.Inv" class="def variant constructor anchored"><a href="#type-op.Inv" class="anchor"></a><code><span>| </span><span><span class="constructor">Inv</span></span></code></li><li id="type-op.Trace" class="def variant constructor anchored"><a href="#type-op.Trace" class="anchor"></a><code><span>| </span><span><span class="constructor">Trace</span></span></code></li><li id="type-op.Transpose" class="def variant constructor anchored"><a href="#type-op.Transpose" class="anchor"></a><code><span>| </span><span><span class="constructor">Transpose</span> <span class="keyword">of</span> <span>int array</span></span></code></li><li id="type-op.ToRows" class="def variant constructor anchored"><a href="#type-op.ToRows" class="anchor"></a><code><span>| </span><span><span class="constructor">ToRows</span></span></code></li><li id="type-op.OfRows" class="def variant constructor anchored"><a href="#type-op.OfRows" class="anchor"></a><code><span>| </span><span><span class="constructor">OfRows</span></span></code></li><li id="type-op.Scalar_Add" class="def variant constructor anchored"><a href="#type-op.Scalar_Add" class="anchor"></a><code><span>| </span><span><span class="constructor">Scalar_Add</span></span></code></li><li id="type-op.Scalar_Sub" class="def variant constructor anchored"><a href="#type-op.Scalar_Sub" class="anchor"></a><code><span>| </span><span><span class="constructor">Scalar_Sub</span></span></code></li><li id="type-op.Scalar_Mul" class="def variant constructor anchored"><a href="#type-op.Scalar_Mul" class="anchor"></a><code><span>| </span><span><span class="constructor">Scalar_Mul</span></span></code></li><li id="type-op.Scalar_Div" class="def variant constructor anchored"><a href="#type-op.Scalar_Div" class="anchor"></a><code><span>| </span><span><span class="constructor">Scalar_Div</span></span></code></li><li id="type-op.Scalar_Pow" class="def variant constructor anchored"><a href="#type-op.Scalar_Pow" class="anchor"></a><code><span>| </span><span><span class="constructor">Scalar_Pow</span></span></code></li><li id="type-op.Scalar_Atan2" class="def variant constructor anchored"><a href="#type-op.Scalar_Atan2" class="anchor"></a><code><span>| </span><span><span class="constructor">Scalar_Atan2</span></span></code></li><li id="type-op.Scalar_Abs" class="def variant constructor anchored"><a href="#type-op.Scalar_Abs" class="anchor"></a><code><span>| </span><span><span class="constructor">Scalar_Abs</span></span></code></li><li id="type-op.Scalar_Neg" class="def variant constructor anchored"><a href="#type-op.Scalar_Neg" class="anchor"></a><code><span>| </span><span><span class="constructor">Scalar_Neg</span></span></code></li><li id="type-op.Scalar_Sqr" class="def variant constructor anchored"><a href="#type-op.Scalar_Sqr" class="anchor"></a><code><span>| </span><span><span class="constructor">Scalar_Sqr</span></span></code></li><li id="type-op.Scalar_Sqrt" class="def variant constructor anchored"><a href="#type-op.Scalar_Sqrt" class="anchor"></a><code><span>| </span><span><span class="constructor">Scalar_Sqrt</span></span></code></li><li id="type-op.Scalar_Exp" class="def variant constructor anchored"><a href="#type-op.Scalar_Exp" class="anchor"></a><code><span>| </span><span><span class="constructor">Scalar_Exp</span></span></code></li><li id="type-op.Scalar_Log" class="def variant constructor anchored"><a href="#type-op.Scalar_Log" class="anchor"></a><code><span>| </span><span><span class="constructor">Scalar_Log</span></span></code></li><li id="type-op.Scalar_Log2" class="def variant constructor anchored"><a href="#type-op.Scalar_Log2" class="anchor"></a><code><span>| </span><span><span class="constructor">Scalar_Log2</span></span></code></li><li id="type-op.Scalar_Log10" class="def variant constructor anchored"><a href="#type-op.Scalar_Log10" class="anchor"></a><code><span>| </span><span><span class="constructor">Scalar_Log10</span></span></code></li><li id="type-op.Scalar_Signum" class="def variant constructor anchored"><a href="#type-op.Scalar_Signum" class="anchor"></a><code><span>| </span><span><span class="constructor">Scalar_Signum</span></span></code></li><li id="type-op.Scalar_Floor" class="def variant constructor anchored"><a href="#type-op.Scalar_Floor" class="anchor"></a><code><span>| </span><span><span class="constructor">Scalar_Floor</span></span></code></li><li id="type-op.Scalar_Ceil" class="def variant constructor anchored"><a href="#type-op.Scalar_Ceil" class="anchor"></a><code><span>| </span><span><span class="constructor">Scalar_Ceil</span></span></code></li><li id="type-op.Scalar_Round" class="def variant constructor anchored"><a href="#type-op.Scalar_Round" class="anchor"></a><code><span>| </span><span><span class="constructor">Scalar_Round</span></span></code></li><li id="type-op.Scalar_Sin" class="def variant constructor anchored"><a href="#type-op.Scalar_Sin" class="anchor"></a><code><span>| </span><span><span class="constructor">Scalar_Sin</span></span></code></li><li id="type-op.Scalar_Cos" class="def variant constructor anchored"><a href="#type-op.Scalar_Cos" class="anchor"></a><code><span>| </span><span><span class="constructor">Scalar_Cos</span></span></code></li><li id="type-op.Scalar_Tan" class="def variant constructor anchored"><a href="#type-op.Scalar_Tan" class="anchor"></a><code><span>| </span><span><span class="constructor">Scalar_Tan</span></span></code></li><li id="type-op.Scalar_Sinh" class="def variant constructor anchored"><a href="#type-op.Scalar_Sinh" class="anchor"></a><code><span>| </span><span><span class="constructor">Scalar_Sinh</span></span></code></li><li id="type-op.Scalar_Cosh" class="def variant constructor anchored"><a href="#type-op.Scalar_Cosh" class="anchor"></a><code><span>| </span><span><span class="constructor">Scalar_Cosh</span></span></code></li><li id="type-op.Scalar_Tanh" class="def variant constructor anchored"><a href="#type-op.Scalar_Tanh" class="anchor"></a><code><span>| </span><span><span class="constructor">Scalar_Tanh</span></span></code></li><li id="type-op.Scalar_Asin" class="def variant constructor anchored"><a href="#type-op.Scalar_Asin" class="anchor"></a><code><span>| </span><span><span class="constructor">Scalar_Asin</span></span></code></li><li id="type-op.Scalar_Acos" class="def variant constructor anchored"><a href="#type-op.Scalar_Acos" class="anchor"></a><code><span>| </span><span><span class="constructor">Scalar_Acos</span></span></code></li><li id="type-op.Scalar_Atan" class="def variant constructor anchored"><a href="#type-op.Scalar_Atan" class="anchor"></a><code><span>| </span><span><span class="constructor">Scalar_Atan</span></span></code></li><li id="type-op.Scalar_Asinh" class="def variant constructor anchored"><a href="#type-op.Scalar_Asinh" class="anchor"></a><code><span>| </span><span><span class="constructor">Scalar_Asinh</span></span></code></li><li id="type-op.Scalar_Acosh" class="def variant constructor anchored"><a href="#type-op.Scalar_Acosh" class="anchor"></a><code><span>| </span><span><span class="constructor">Scalar_Acosh</span></span></code></li><li id="type-op.Scalar_Atanh" class="def variant constructor anchored"><a href="#type-op.Scalar_Atanh" class="anchor"></a><code><span>| </span><span><span class="constructor">Scalar_Atanh</span></span></code></li><li id="type-op.Scalar_Relu" class="def variant constructor anchored"><a href="#type-op.Scalar_Relu" class="anchor"></a><code><span>| </span><span><span class="constructor">Scalar_Relu</span></span></code></li><li id="type-op.Scalar_Dawsn" class="def variant constructor anchored"><a href="#type-op.Scalar_Dawsn" class="anchor"></a><code><span>| </span><span><span class="constructor">Scalar_Dawsn</span></span></code></li><li id="type-op.Scalar_Sigmoid" class="def variant constructor anchored"><a href="#type-op.Scalar_Sigmoid" class="anchor"></a><code><span>| </span><span><span class="constructor">Scalar_Sigmoid</span></span></code></li><li id="type-op.Fused_Adagrad" class="def variant constructor anchored"><a href="#type-op.Fused_Adagrad" class="anchor"></a><code><span>| </span><span><span class="constructor">Fused_Adagrad</span> <span class="keyword">of</span> float * float</span></code><div class="def-doc"><span class="comment-delim">(*</span><p>TODO</p><span class="comment-delim">*)</span></div></li></ol></div></div></details></div><div class="odoc-include"><details open="open"><summary class="spec include"><code><span><span class="keyword">include</span> <a href="../../Owl_types_computation_device/module-type-Sig/index.html">Owl_types_computation_device.Sig</a></span></code></summary><div class="odoc-spec"><div class="spec module anchored" id="module-A"><a href="#module-A" class="anchor"></a><code><span><span class="keyword">module</span> <a href="A/index.html">A</a></span><span> : <a href="../../Owl_types_ndarray_mutable/module-type-Sig/index.html">Owl_types_ndarray_mutable.Sig</a></span></code></div></div><h6 id="type-definition_3"><a href="#type-definition_3" class="anchor"></a>Type definition</h6><div class="odoc-spec"><div class="spec type anchored" id="type-device"><a href="#type-device" class="anchor"></a><code><span><span class="keyword">type</span> device</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec type anchored" id="type-value"><a href="#type-value" class="anchor"></a><code><span><span class="keyword">type</span> value</span></code></div><div class="spec-doc"><p>TODO</p></div></div><h6 id="core-functions_5"><a href="#core-functions_5" class="anchor"></a>Core functions</h6><div class="odoc-spec"><div class="spec value anchored" id="val-make_device"><a href="#val-make_device" class="anchor"></a><code><span><span class="keyword">val</span> make_device : <span>unit <span class="arrow">-></span></span> <a href="#type-device">device</a></span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-arr_to_value"><a href="#val-arr_to_value" class="anchor"></a><code><span><span class="keyword">val</span> arr_to_value : <span><a href="A/index.html#type-arr">A.arr</a> <span class="arrow">-></span></span> <a href="#type-value">value</a></span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-value_to_arr"><a href="#val-value_to_arr" class="anchor"></a><code><span><span class="keyword">val</span> value_to_arr : <span><a href="#type-value">value</a> <span class="arrow">-></span></span> <a href="A/index.html#type-arr">A.arr</a></span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-elt_to_value"><a href="#val-elt_to_value" class="anchor"></a><code><span><span class="keyword">val</span> elt_to_value : <span><a href="A/index.html#type-elt">A.elt</a> <span class="arrow">-></span></span> <a href="#type-value">value</a></span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-value_to_elt"><a href="#val-value_to_elt" class="anchor"></a><code><span><span class="keyword">val</span> value_to_elt : <span><a href="#type-value">value</a> <span class="arrow">-></span></span> <a href="A/index.html#type-elt">A.elt</a></span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-value_to_float"><a href="#val-value_to_float" class="anchor"></a><code><span><span class="keyword">val</span> value_to_float : <span><a href="#type-value">value</a> <span class="arrow">-></span></span> float</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-is_arr"><a href="#val-is_arr" class="anchor"></a><code><span><span class="keyword">val</span> is_arr : <span><a href="#type-value">value</a> <span class="arrow">-></span></span> bool</span></code></div><div class="spec-doc"><p>TODO</p></div></div><div class="odoc-spec"><div class="spec value anchored" id="val-is_elt"><a href="#val-is_elt" class="anchor"></a><code><span><span class="keyword">val</span> is_elt : <span><a href="#type-value">value</a> <span class="arrow">-></span></span> bool</span></code></div><div class="spec-doc"><p>TODO</p></div></div></details></div><div class="odoc-spec"><div class="spec value anchored" id="val-number"><a href="#val-number" class="anchor"></a><code><span><span class="keyword">val</span> number : <a href="../../Owl_types_common/index.html#type-number">Owl_types_common.number</a></span></code></div></div></div></body></html>
```
|
Gennaro Sanfelice (1622 – 19 February 1694) was a Roman Catholic prelate who served as Archbishop of Cosenza (1661–1694).
Biography
Gennaro Sanfelice was born in Naples, Italy in 1622. On 21 November 1661, he was appointed during the papacy of Pope Alexander VII as Archbishop of Cosenza. On 30 November 1661, he was consecrated bishop by Giulio Cesare Sacchetti, Cardinal-Bishop of Sabina, with Ottaviano Carafa, Titular Archbishop of Patrae, and Emilio Bonaventura Altieri, Bishop of Camerino, serving as co-consecrators. He served as Archbishop of Cosenza until his death on 19 February 1694.
References
External links and additional sources
(for Chronology of Bishops)
(for Chronology of Bishops)
17th-century Italian Roman Catholic archbishops
Bishops appointed by Pope Alexander VII
Clergy from Naples
1622 births
1694 deaths
|
Trihedral Neolithic is a name given by archaeologists to a style (or industry) of striking spheroid and trihedral flint tools from the archaeological site of Joub Jannine II in the Beqaa Valley, Lebanon. The style appears to represent a highly specialized Neolithic industry. Little comment has been made of this industry.
References
Archaeological cultures of West Asia
Neolithic cultures of Asia
Archaeological cultures in Lebanon
Lithics
|
Tragosoma harrisii is a species of long-horned beetle in the family Cerambycidae.
References
Further reading
External links
Prioninae
Beetles described in 1851
|
Star Channel (formerly SuomiTV and later Fox) is a Finnish entertainment TV channel owned and operated by The Walt Disney Company through its local subsidiary The Walt Disney Company Nordic AB, filial i Finland (formerly Family Channel Oy, Fox International Channels Oy and Fox Networks Group Oy). The channel was acquired by FNG Nordic (then known as FIC Nordic) in January 2012, and then relaunched as its current incarnation on 16 April that year.
Star Channel is freely available in Finland both over-the-air and through cable, as it bases its funding on television advertisements. It is FNG Nordic's first channel that does not operate on subscriber fees.
As the channel was licensed as generalist channel, it was required to broadcast certain television programmes. As of 2018, Fox fulfilled such requirements by simulcasting Sky News (which was a fellow 21st Century Fox business until November 2018) overnight, and showing programmes aimed at children in mornings under Fox Kids programming block. Such requirements were later lifted.
Fox Networks Group Oy also operates the Finnish version of National Geographic television channel.
The channel provided a free catch up service through its online platform FOXplay until 2019.
Effective 1 January 2019, Sanoma Media Finland took over media sales representation of Fox Networks Group channels in Finland, which includes this channel.
On October 26, 2022, The Walt Disney Company Nordic & Baltic announced that Fox would be renamed as Star Channel on 6 January 2023.
Past programming
News
SuomiTV had its own news department, but it was later phased out.
Until 2019, Fox simulcast Sky News during overnight hours.
Fox Kids
This is the only outlet to revive the Fox Kids name, which was phased out most of the world. Initially, it utilised the Fox Kids' global logo and on-screen branding from early 2000s, but it was later replaced by another logo and look. After Disney's acquisition of 21st Century Fox, Fox Kids is managed by Disney Channels Worldwide.
The block offered foreign television programs aimed at a young audience dubbed into the Finnish language. The block aired for the last time on 6 January 2019.
References
External links
http://www.foxplay.fi (Archived)
Finland
Television channels in Finland
Television channels and stations established in 2012
|
Ali Karimi (born 1978) is an Iranian footballer who won Asian Footballer of the Year in 2004.
Ali Karimi may also refer to:
Ali Karimi (footballer, born 1982), Iranian football striker who played for Saipa, Tractor Sazi, and Shahrdari Tabriz
Ali Karimi (footballer, born 1994), Iranian international footballer who plays for Sepahan, Dinamo Zagreb, and Esteghlal
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.