text stringlengths 1 22.8M |
|---|
Leucopogon amplectens is a species of flowering plant in the family Ericaceae and is endemic to the south-west of Western Australia. It is an erect shrub that typically grows to a height of and has tube-shaped, white flowers from April to June.
It was first formally described in 1921 by Carl Hansen Ostenfeld in the journal Biologiske meddelelser, Kongelige Danske Videnskabernes Selskab from specimens collected near Tammin. The specific epithet (amplectens) means "embracing", referring to the leaves.
Leucopogon amplectens grows in sandy soils in the Avon Wheatbelt and Mallee bioregions of south-western Western Australia and is listed as "Priority Two" by the Western Australian Government Department of Biodiversity, Conservation and Attractions, meaning that it is poorly known and from only one or a few locations.
References
amplectens
Ericales of Australia
Flora of Western Australia
Plants described in 1921
Taxa named by Carl Hansen Ostenfeld |
Linda annamensis is a species of beetle in the family Cerambycidae. It was described by Stephan von Breuning in 1954.
Subspecies
Linda annamensis annamensis Breuning, 1954
Linda annamensis yunnanensis Breuning, 1960
References
annamensis
Beetles described in 1954 |
Blackjack Creek (also known as Black Jack Branch) is a stream in Johnson County in the U.S. state of Missouri. It is a tributary of the Blackwater River.
Blackjack Creek was named for the blackjack oak trees lining its course.
See also
List of rivers of Missouri
References
Rivers of Johnson County, Missouri
Rivers of Missouri |
Zhushikou station () is an interchange station on Line 7 and Line 8 of the Beijing Subway.
The Line 7 station was opened on December 28, 2014. The Line 8 station was opened on December 30, 2018. This station served as the temporary northern terminus of the south section of line 8 until December 31, 2021, when both north and south sections of Line 8 were connected.
Station Layout
Both the line 7 and 8 stations have underground island platforms. The line 7 platforms are located a level under the line 8 platforms.
Exits
There are six exits, lettered A, C, D, E, F, and G. Exit D is accessible.
Gallery
References
Railway stations in China opened in 2014
Beijing Subway stations in Dongcheng District
Beijing Subway stations in Xicheng District |
```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; }
}
``` |
William Kerwin (April 17, 1927 – October 27, 1989) was an American actor and filmmaker. He was most well known for his character roles in the films of Herschell Gordon Lewis.
Career
Kerwin enjoyed some success on the stage and screen before being discovered by Herschell Gordon Lewis through the promotional short Carving Magic. His first feature film with Lewis was Living Venus, and he went on to star in some of the director’s best known works such as Blood Feast. In addition to playing principal roles, Kerwin served variously as the assistant director, makeup technician, gaffer, key grip and prop man for Lewis’ films. Kerwin was thus often involved in creating the gory practical effects that would become Lewis’ trademark.
Whether working with Lewis or other directors, Kerwin was closely associated with the exploitation film movement. In particular, he was known for work in nudist films and splatter films.
Throughout his career, Kerwin often performed under pseudonyms such as Thomas Wood in order to appear in non-union productions. He was registered with the Screen Actors Guild under the name Willam Kerwin.
Personal life
Kerwin’s first marriage was to actress Hanna Hertelendy from 1953 to 1958. Kerwin had one daughter from his marriage to Hertelendy, costume designer Barbara Kerwin.
In 1964, Kerwin married Connie Mason, who he met while filming Blood Feast. The couple had two daughters, Denise and Kim, and remained married until Kerwin's death in 1989.
Kerwin was the brother of director Harry Kerwin and appeared in several of his films throughout the 1970s including God's Bloody Acre, Barracuda and Tomcats.
All three of Kerwin’s daughters pursued film careers for at least a decade. Half-sisters Barbara and Kim Kerwin had bit roles in Herschell Gordon Lewis’ The Gruesome Twosome as children; William Kerwin himself did not appear in this movie. Both girls also collaborated with their uncle Harry Kerwin; Barbara had a small role in Sweet Bird of Aquarius while Kim acted in Cheering Section. Denise, William Kerwin’s youngest daughter, is the only of the three to never work with Lewis or Harry Kerwin during her acting career.
Filmography
Film
Television
References
1927 births
1989 deaths
20th-century American male actors
American male film actors
American male television actors
American male stage actors |
```shell
Bash history reverse search
Aliasing ssh connections
Clear the terminal instantly
Get to know your commands with `type`
`else` statements using the `||` operator
``` |
The Loves of Käthe Keller (German: Die Liebschaften der Kaethe Keller) is a 1919 German silent drama film directed by Carl Froelich and starring Irmgard Bern, Paul Hartmann and Reinhold Schünzel.
The film's sets were designed by the art director Hans Sohnle.
Cast
Irmgard Bern as Käthe Keller
Paul Hartmann as Franz Petrow
Reinhold Schünzel as Erbprinz Ottokar
Adolf Klein as Forstmeister Petrow,
Margarete Kupfer as Frau Keller, Kätes Mutter
Leopold von Ledebur as Fürst Isensee
Paul Kaufmann
Oskar Marion
Margarete Schön
References
External links
1919 films
Films of the Weimar Republic
German silent feature films
Films directed by Carl Froelich
1919 drama films
German black-and-white films
Films based on German novels
Silent German drama films
1910s German films |
America's Town Meeting of the Air was a public affairs discussion broadcast on radio from May 30, 1935, to July 1, 1956, mainly on the NBC Blue Network and its successor, ABC Radio. One of radio's first talk shows, it began as a six-week experiment, and NBC itself did not expect much from it.
Broadcast live from New York City's Town Hall, America's Town Meeting of the Air debuted on Thursday May 30, 1935, and only 18 of NBC's affiliates carried it. The topic for that first show was "Which Way America: Fascism, Communism, Socialism or Democracy?” The moderator was George V. Denny, Jr., executive director of the League for Political Education, which produced the program. Denny moderated the program from 1935 to 1952 and had a major role in choosing weekly topics. Denny and the League wanted to create a program that would replicate the Town Meetings that were held in the early days of the United States.
Current events and issues
The show's introduction tried to evoke the old town meetings, as the voice of the mythical town crier announced, “Town meeting tonight! Come to the old Town Hall and talk it over!” Denny and the League believed that a radio town meeting could enhance the public's interest in current events. Denny worried that an uninformed public was bad for democracy; and he believed society had become so polarized that the average person didn't listen to other points of view.
His goal was to create a new kind of educational program, one that would be entertaining as well as mentally challenging, while exposing listeners to various perspectives on the issues of the day. Explaining the rationale behind a radio town meeting, Denny wrote that it was "... a device which is designed to attract [the average American's] attention and stimulate his interest in the complex economic, social and political problems which he must have a hand in solving."
Audience participation
On paper, America's Town Meeting looked like a typical panel discussion, with high-profile celebrity guests, who were experts on a particular current issue. For example, on a December 19, 1935, show about Social Security, one of the panelists was U.S. Secretary of Labor Frances Perkins, who explained and defended the new government program. (What she said about it can be heard here.)
But while many shows had well-known experts, few had the kind of audience participation that this one did. They cheered or applauded when they liked what a speaker said, and they hissed or booed when they felt the speaker was wrong. They also heckled: part of the format of the show was to allow members of the audience to ask questions, and while the rule was the question had to be brief—about 25-30 words maximum, with no insults or name-calling, that didn't stop people from using sarcasm, or strongly disagreeing with what a guest had said.
Even the listeners at home could take part: while at first there was no easy way to get callers on the air, by 1936, NBC engineers had designed a method for letting listeners call in from remote locations where they had gathered to listen to the show.
Educational uses
The show succeeded beyond NBC's expectations, and the six-week trial became permanent. As Denny had hoped, listeners not only enjoyed hearing famous newsmakers engaging in discussion but they also enjoyed hearing members of the audience challenging these newsmakers. It wasn't long before Denny was receiving fan mail: His first broadcast received about 3,000 letters, much to his surprise.
By the 1937–8 season, mail averaged between 2,000 and 4,000 letters a week, an amazing number for an educational program. It also inspired listeners to form "listener clubs," where members would listen as a group and then discuss the topic themselves.
America's Town Meeting became so popular in the public discourse that during the late 1930s and into the early 40s, Denny wrote a monthly column for Current History magazine, in which he gave summaries of the major points made by some of his Town Meeting guests, and then gave readers news quizzes. And educators found it so useful that Denny and NBC put program listings and what the speakers had said into booklet form, which was disseminated to public school civics teachers.
Guests
Over the years, America's Town Meeting became known for its interesting guests, many of whom were important newsmakers. Denny did not shy away from controversy: his panelists included Socialist presidential candidate Norman Thomas, American Communist Party leader Earl Browder, and civil libertarian Morris Ernst.
But there were also guests from the world of literature (author Pearl Buck, poets Carl Sandburg and Langston Hughes) and a number of famous scientists, politicians, journalists, and public intellectuals.
Topics
The topics were meant to inspire discussion, and Denny tried to select subjects that would get people talking long after the show was over. Among them were discussions about whether America truly had freedom of the press (and whether censorship was sometimes necessary); whether the United States should enter World War II or remain neutral; and why the United States public schools weren't doing a better job.
But during World War II, Denny repeatedly encountered what he had most sought to avoid: angry audience members who didn't want to listen to other viewpoints and who wanted to criticize, rather than debate. Worse still, some audience members expressed isolationist and anti-Semitic views. Denny struggled to maintain the show's openness and objectivity, but it became increasingly difficult to do so.
Decline
The 1930s were definitely the heyday of America's Town Meeting, although it remained on the air throughout the 1940s and sometimes still inspired the kinds of passionate discussions Denny had hoped for. But Town Meeting underwent a number of time changes during the 1940s. Some were the result of changes at NBC — the network that had been called the NBC Blue Network was sold in 1943, and it first became known as the "Blue Network," and then was renamed the American Broadcasting Company in late 1945. (Some advertisements and promotions for "Town Meeting," however, would still refer to the show as "a Blue Network program" or originating on "ABC's Blue Network" as late as 1949.)
Some of the programs on the new network were shifted around, and not only did Town Meeting get a new timeslot—it was moved from 9:30pm to 8:30pm—but by 1944, it even got a sponsor—Reader's Digest. At times, the show was 60 minutes, sometimes 45 minutes and sometimes only a half-hour. And when television came along, interest in Denny's radio program gradually faded. By 1952, he had been replaced as moderator, and the show was finally canceled on July 1, 1956.
Denny, who continued to believe in educational media, joined an organization that planned international seminars, and he hoped to create an international version of Town Meeting. He died of a cerebral hemorrhage on November 11, 1959, at the age of 60.
Awards and honors
ABC Radio and George V. Denny, Jr. were given a 1945 Peabody Award for Outstanding Educational Program for America's Town Meeting of the Air.
In 2009, the National Recording Preservation Board selected the May 8, 1941, episode of America's Town Meeting of the Air ("Should Our Ships Convoy Materials to England?" with guests Reinhold Niebuhr and John Flynn) for inclusion in the holdings of the National Archives' audiovisual collection.
Works cited
Denny, George V. Jr. "Radio Builds Democracy." Journal of Educational Sociology, vol. 14, #6, February 1941, pp. 370–377.
Dunning, John. On the Air: The Encyclopedia of Old-Time Radio, Oxford, 1998.
"George V. Denny, Radio Host, Dead." New York Times, November 12, 1959, p. 35.
Hilmes, Michele, editor. "NBC: America's Network." University of California Press, 2007.
Overstreet, Harry A. and Bonaro W. Overstreet. Town Meeting Comes to Town. Harper and Brothers, 1938.
Sparling, Earl. "Town Meeting's On the Air Again." Forum and Century, October 1939, pp. 164–8.
References
Listen to
America's Town Meeting of the Air (Internet Archive)
America's Town Meeting of the Air (New York Public Radio)
Library of Congress essay on its selection for the National Recording Registry.
American talk radio programs
NBC Blue Network radio programs
ABC radio programs
1930s American radio programs
1940s American radio programs
1950s American radio programs
United States National Recording Registry recordings |
Maria II Zaccaria Asanina (14th century – after 1404) was a Princess of Achaea.
She was daughter of Centurione I Zaccaria, Lord of Veligosti–Damala and Chalandritsa and his Byzantine wife Helene Asanina, sister of the Byzantine Empress Irene Asanina. Through her mother Maria descended from the imperial families of the Palaiologoi, Komnenoi, Angeloi. She married Pedro de San Superano the leader of the Navarrese Company from the year 1386 and the de facto ruler of Morea until 1402. After Pedro's death, Maria ruled the Principality as Princess in her own right for 2 years until her children coming to age.
Once she assumed power Maria appointed her overly ambitious nephew Centurione II Zaccaria -son of her brother Andronikos- as her bailee, a choice that ended up being the undoing of her reign. In the past Pedro had promised to the King of Naples Ladislaus 3.000 ducats in exchange for the title of the ruler of Morea, an amount of coins that he never paid. Ladislaus renewed his demands by asking Maria to bestow him the ducats immediately, something that also Maria didn't favored. Centurione acted secretly and dispatched a trusted person in Naples to inform Ladislaus that Maria and her children couldn't grant him the money but he himself was eager to pay them as long as he was recognized the only ruler of the Principality. Ladislaus accepted the unexpected offer of Centurione and declared the fall of Maria and her offsprings from the throne of Achaea.
In order to justify his decision, he argued that Maria and her children demonstrated a punishable audacity by not renewing the feudal oath of the Princes of Achaea to Naples. After her fall, Maria disappears from the historical record. During her brief reign, based on her epistolography it seems Maria was residing at the city of Patras, where we see her holding discussions with Venice about the appointment of a Venetian prelate.
References
Sources
14th-century births
15th-century deaths
Maria
Maria
Maria
14th-century women
15th-century women rulers
14th-century people from the Principality of Achaea
15th-century people from the Principality of Achaea |
Rodrigue N'Doram (born 25 November 1987) is a Chadian international footballer who currently plays for Foullah Edifice FC. He made his debut for Chad on 6 June 2015 in the 2–1 win against Guinea. He has spent the majority of his playing career in France, representing Carquefou and Cholet amongst others.
He is the son of former Chad international footballer Japhet N'Doram.
References
1987 births
Living people
Footballers from N'Djamena
Chadian men's footballers
Chad men's international footballers
USJA Carquefou players
SO Cholet players
Men's association football midfielders |
```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);
}
}
``` |
National Highway 251, commonly called NH 251 is a national highway in India. It is a spur road of National Highway 51. NH-251 traverses the state of Gujarat and the union territory of Dadra and Nagar Haveli and Daman and Diu in India.
Route
Gujarat
Una
Dadra and Nagar Haveli and Daman and Diu
Ghoghla, Diu
Gujarat
Kesaria
Junctions
Terminal near Una.
Terminal near Kesaria.
See also
List of National Highways in India
List of National Highways in India by state
References
External links
on OpenStreetMap
National Highways in Gujarat
National Highways in Dadra and Nagar Haveli and Daman and Diu
National highways in India |
Crossway (previously known by its parent ministry Good News Publishers) is a not-for-profit evangelical Christian publishing ministry headquartered in Wheaton, Illinois. Clyde and Muriel Dennis founded Good News Publishers in 1938, working out of their home in Minneapolis, Minnesota.
Crossway is best known for publishing evangelical Christian books, along with the English Standard Version (ESV) translation of the Bible. Mark Ward, editor of Bible Study Magazine, has praised Crossway for its continuous commitment to technological innovation in publishing the ESV online.
Crossway
In late 1978, Good News Publishers began expanding its reach by establishing Crossway, a publishing division. Beginning under the leadership of Lane T. Dennis—Clyde and Muriel's son—Crossway claims that it has published more than 1,500 titles, including books "by Francis A. Schaeffer, Martyn Lloyd-Jones, John Piper, John MacArthur, Paul David Tripp, Jen Wilkin, J. I. Packer, Chuck Colson, Frank Peretti, Max Lucado, Joni Eareckson Tada, and D. A. Carson."
ESV Bible translation
In 2001, Crossway published the ESV translation of the Bible. The ESV translation committee describes the ESV as a translation that is "essentially literal", following a "word-for-word" philosophy.
According to Crossway, the publishing team behind the ESV "has included more than a hundred people."
In 2008, Crossway published the ESV Study Bible.
In 2016, Crossway made headlines after announcing that the ESV text would be "unchanged forever, in perpetuity" as a "permanent text" edition. After public discourse about the policy, Crossway announced that it would reverse the decision.
Notes
References
External links
Book publishing companies based in Illinois
Evangelical Christian publishing companies
Publishing companies established in 1938
Publishing companies established in 1978
Religious tract publishing companies
Wheaton, Illinois |
Lisa Eder (born 12 August 2001) is an Austrian ski jumper.
Career
On August 9, 2015, she started in the Alpencup for the first time. When she jumped the small Vogtlandschanzen in Klingenthal, she took 18th place. She celebrated her first victory in the Alpencup on August 11, 2016, on the Pöhlbachschanze in Pöhla. On August 18, 2017, she was allowed to start in the Continental Cup for the first time and finished 15th on the Fichtelbergschanzen in Oberwiesenthal. At the Continental Cup on the Tveitanbakken in Notodden on December 15, 2017, she narrowly missed her first podium finish in fourth place.
For the World Cup on the Miyanomori Ski Jump Stadium in Sapporo and on the Zaō Hill in Zaō, she was nominated for the first time for World Cup jumping. While she still failed to qualify in Sapporo, she finished 36th in Zaō on January 19, 2018, missing her first World Cup points. On January 20, 2018, she took sixth place in the team competition together with Chiara Hölzl, Claudia Purker and Jacqueline Seifriedsberger. She also took part in the Junior World Championships in Kandersteg. In the individual from the Lötschberg Hill she took 24th place and seventh place together with Marita Kramer, Sophie Mair and Claudia Purker. On March 24, 2018, she achieved her best World Cup result to date with eleventh place on the Audi Arena Oberstdorf in Oberstdorf.
At the 2019 Junior Championships in Lahti, Finland, she won the bronze medal with the Austrian junior team, which also included Marita Kramer, Lisa Hirner and Claudia Purker, while finishing fourth in the mixed team and tenth in the singles. On February 9, 2019, together with her teammates Jacqueline Seifriedsberger, Chiara Hölzl and Eva Pinkelnig, she reached the podium of a World Cup competition for the first time in the team competition on the Logarska dolina in Ljubno, Slovenia. On February 8 and 9, 2020, she finished eighth and seventh in Hinzenbach, her first two places in the top ten in an individual World Cup.
At the Olympic Winter Games in Beijing, she took fifth place with the Austrian mixed team. In the individual competition, she was eighth.
She is a member of SK Saalfelden-Salzburg.
Results
World Cup
Standings
Grand Prix
Standings
References
External links
2001 births
Living people
Austrian female ski jumpers
Olympic ski jumpers for Austria
Ski jumpers at the 2022 Winter Olympics
21st-century Austrian women |
Benevento Calcio Youth Sector () comprises the under-19 team and the academy of Italian professional football club Benevento Calcio. The under-19 squad competes in Group B of the Campionato Primavera 2.
Primavera
Current squad
Non-playing staff (under-19 squad)
Director:
Head Coach: Nicola Romaniello
Fitness Coach: Manuel Addona
Goalkeeping Coach: Antonio Gemma
Team Doctor: Luca Milano
Physiotherapist:
Under-17 squad
Non-playing staff (under-17 squad)
Director:
Head Coach: Pasquale Bovienzo
Fitness Coach: Alfredo Genco
Goalkeeping Coach: Pietro Parascandolo
Team Doctor: Luca Milano
Physiotherapist: Pasquale Di Mauro
References
External links
Benevento Calcio
Football academies in Italy |
Vijaya Kumari Ganti is a former member of the 13th Lok Sabha from Amalapuram, Andhra Pradesh. She is the widow of Lok Sabha speaker G.M.C. Balayogi and won the by-election (2002) conducted after his death.
Career
The sudden death of Amalapuram MP and Lok Sabha Speaker Ganti Mohana Chandra Balayogi necessitated a by-election for the reserved constituency. Before fielding Balayogi's widow Ganti for the seat, senior members of the Telugu Desam Party (TDP) were considering her nomination to the Rajya Sabha. Ganti herself, being in a state of shock, was reluctant to contest the election and Balyogi's family wanted his sister to succeed him.
The Indian National Congress (INC) didn't contest the by-election and TDP had thought Ganti would win unopposed. Even a legislator of Bharatiya Janata Party was present when she filed her nomination. Only Bahujan Samaj Party and Republican Party of India placed their candidates against her and both forfeited their security deposit. She won by a margin of 3,13,660 votes.
Ganti took her oath of office on the first day of the 2002 monsoon session of the Lok Sabha. For the next general election TDP made Dunna Janardhana Rao its official candidate instead of her.
The spouses of the speakers of Lok Sabha are provided a house in New Delhi. Ganti, however, faced trouble in getting a house allocated.
Personal life
Vijaya Kumari married G.M.C. Balayogi on 16 April 1982. Together they had one son and three daughters. Balayogi died in a helicopter accident on 3 March 2002.
References
Living people
Telugu Desam Party politicians
Women members of the Lok Sabha
India MPs 1999–2004
Lok Sabha members from Andhra Pradesh
Year of birth missing (living people)
20th-century Indian women
20th-century Indian people
21st-century Indian women politicians |
```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 -->
``` |
Jiroft Dam (Persian: سد جیرفت) is a hydroelectric dam in Iran with an installed electricity generating capability of 85 MWh situated in Kerman Province.
The fifth concrete dam built in the country, it was begun in 1975 and completed in 1992 (6 Daymah 1370 in Persian calendar). It is located on Halil River (Halilrood) 40 km upstream of Jiroft (North-East of the city) in the narrow valley of Narab.
Its reservoir capacity is around 410 million cubic metres up to the normal level (1185 metres above sea level). The maximum height of the dam is 134 m and the crest length is 277 m. The dam in its first water year of operation (1992) survived an extraordinary flood (1 February 1993) with the peak discharge of 5035 cubic metres per second. The flood had a return period of 800 to 1000 years. The heavy rains of this year caused the dam was filled of water much sooner than the planned water storing duration. The spillways and other hydrodynamic outlets of the dam can manage to discharge up to 6500 cubic meters per seconds (the design flood with return period of 10000 years).
The reservoir is planned to irrigate 14200 hectares of the downstream lands.
See also
List of power stations in Iran
List of dams and reservoirs in Iran
Dams in Iran
References
Hydroelectric power stations in Iran
Dams completed in 1993 |
Pentadecylic acid, also known as pentadecanoic acid or C15:0 is an odd-chain saturated fatty acid. Its molecular formula is . It is a colorless solid.
A laboratory preparation involves permanganate oxidation of 1-hexadecene ().
Pentadecylic acid is found primarily in dairy fat, as well as in ruminant meat and some types of fish and plants. It is one of the most common odd-chain fatty acids, although it is rare in nature, comprising 1.2% of milk fat from cows.
Because the butterfat in cow milk is its major dietary source,
it may be used as a biomarker for butterfat consumption. Pentadecylic acid also occurs in hydrogenated mutton fat.
In reviews of preliminary dietary research, higher circulating concentrations of pentadecyclic acid were associated with a lower risk of developing type 2 diabetes and cardiovascular disease.
See also
List of saturated fatty acids
List of carboxylic acids
Margaric acid
References
External links
Safety data
Fatty acids
Alkanoic acids |
```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;
}
}
``` |
The Relay Building, originally known as One Commercial Street, is a 21-storey residential block in Whitechapel at the junction of Whitechapel High Street and Commercial Street, London E1. Despite the building's former name, the main entrance is in Whitechapel High Street, and the postal address is 114 Whitechapel High Street.
The building opened in 2014. The developer was Redrow; and the architects were Sigma Seifert. The contractor was John Sisk & Son, a member of the Sisk Group. Construction had been suspended in 2008, but with the recovery in the London housing market, the development was purchased by Redrow. As well as 207 apartments, there is 110,000 sq ft of offices over six floors, retail space on the ground floor and car parking in the basement. The ground floor incorporates one of the western entrances to Aldgate East tube station.
Design
The developer Redrow described the building as "like a blade of light, its glass fin protruding dramatically to add a sculptural quality to Redrow London's first flagship development". Building Design, however, commented: "First flagship development? Please God let it also be their last. No one who can liken this incoherent hulk of ill-fitting glass sheets to a blade of light deserves to build again in such a sensitive location." In July 2014, the building was nominated for the Carbuncle Cup, awarded for "the ugliest building in the United Kingdom completed in the last 12 months".
The International Property Awards, on the other hand, honoured the building as "Best Residential High-Rise Development UK, 2013–14".
The entrance lobby is notable for incorporating a section of a London Underground C Stock train, used as a seating area. It displays "Aldgate East" as its destination. The unit bears the number 5721, which was the number of one of the final C Stock units to run on the Underground before they were withdrawn from service in 2014, but this is not its original number: the genuine 5721 is preserved at the London Transport Museum's Acton depot.
Houblon Apartments and the "poor door"
The Relay Building includes, in compliance with planning legislation, an element of "affordable housing". This part of the development has its own name, "Houblon Apartments"; and a separate entrance, at one side of the building in Tyne Street. In July 2014, an investigation by The Guardian newspaper – commenting particularly on One Commercial Street – noted a growing trend for new housing developments in London to include separate, segregated entrances of this kind, known as "poor doors".
In November 2014, Vice reported that, "for the past 20 weeks, every Wednesday between 6PM and 7PM, a group of locals from the anarchist action group Class War have stood outside the slick glass carbuncle with a banner promising to 'devastate the avenues where the wealthy live' – a nod to a 1915 quote from firebrand Chicago anarchist Lucy Parsons." After 18 weeks, the developer Redrow disposed of the freehold of the building. A week later, a director of the new owners, Hondo Enterprises, agreed to meet with Class War, and they declared a temporary truce.
2022 fire incident
On 7 March 2022, a fire broke out on the 17th floor, with glass panels and other debris falling to the streets below. The London Fire Brigade was called at 3:53pm GMT and fifteen fire engines and more than 125 firefighters were sent to put out the blaze, using the tallest ladder in Europe.
References
Residential skyscrapers in London
Whitechapel
Buildings and structures in Whitechapel
Skyscrapers in the London Borough of Tower Hamlets
Commercial Street, London |
The De Luca Bossa clan is a Neapolitan Camorra clan operating in the eastern suburbs of Naples, and more specifically in the area of Ponticelli and in the municipality of Cercola.
History
The clan was founded by Antonio De Luca Bossa, known as ‘O sicco, in the 1990s. Antonio is the son of Umberto De Luca Bossa, who was a trusted member of the Nuova Camorra Organizzata and died from natural causes in 2008 after 18 years in jail.
In the late 1980s ‘O sicco started his criminal career as a ferocious killer for the once powerful Sarno clan. At the age of 17, he was arrested, accused of involvement in a massacre led by the Sarnos in which six people died, four of them by mistake. In the early 90s, Antonio became a trusted member of the Sarno clan, however, he decided to create his own clan, which ended in a bloody war between the then newly created clan and the Sarnos for the control of the territory. The war reached its peak, when, in 1998, ‘O sicco made the first attack with a car bomb in the Camorra's history, killing Luigi Amitrano, the nephew of the boss Vincenzo Sarno, the real target of the ambush. Eventually, Antonio De Luca Bossa was arrested and sentenced to life in prison.
In the 2000s, thanks to the relationship between Teresa De Luca Bossa, mother of Antonio, with Giuseppe Marfella, boss of the Marfella clan, based in Pianura, the forces of the two clans united in fighting the Lago clan. The reorganization in the clan takes place, adding the interest in regaining control over Ponticelli, taking advantage of fall of the Sarno clan, thanks to the large number of arrests and most of their bosses becoming pentiti. However, this time did not last long, in 2010 Teresa De Luca Bossa was arrested and the clan gradually lost control of the territory, disputed by rival clans, such as the D'Amico clan (called Fraulella) and the De Micco clan (called Bodo). In the years when Teresa De Luca Bossa was in command, the clan also made an alliance with the powerful Secondigliano Alliance.
Anna De Luca Bossa, sister of Antonio, is married to Ciro Minichini, a member of a criminal group also based in Ponticelli. They had a son, Antonio Minichini, who was killed in 2013 in the middle of the war between the De Luca Bossa and the De Micco clans. In September 2019, Anna was accused of involvement in the murder of Raffaele Cepparulo, leader of a small criminal group, and Ciro Colonna, an innocent victim. She was sentenced to life imprisonment. In the same trial, Michele Minichini, who was considered one of the leaders of the new era of the organization was also sentenced to life in prison. Minichini was known to have a good relationship with Ciro Rinaldi, boss of the Rinaldi clan, also based in the eastern part of Naples, making an alliance between the two clans.
Leadership
Antonio De Luca Bossa — Serving a life sentence.
Teresa De Luca Bossa — Arrested.
Anna De Luca Bossa — Serving a life sentence.
Umberto De Luca Bossa (son of the boss 'O Sicco) — Allegedly the current leader of the organization.
Emmanuel De Luca Bossa (son of the boss 'O Sicco) — Released in 2020.
Michele Minichini, known as 'a tigre — Serving a life sentence.
Activities
Pasquale Brunese, a drug trafficker working for the clan was arrested in Valencia, Spain, in 2015, after seven years hiding from the Italian police. In Spain, Brunese owned a restaurant and was living with a false name.
On October 31, 2019, Salvatore Ricciardi, considered an affiliate of the clan, was arrested by the Carabinieri on charges of having imposed the racket on a pizzeria in Cercola. According to investigators, Ricciardi is the "bagman" of the clan, designated to collect the racket money.
According to investigations, the leaders of the clan usually do numerous parties in the Ponticelli area, always inviting singers to live performances, one of their favorite singers is the neomelodic Anthony Ilardo, who is known for his relations with members of the Camorra.
On December 29, 2019, two "loan sharks" of the clan were arrested in Cercola, according to the investigations, in some cases they would impose usurious rates up to 720%.
Present day
According to the reports of the DIA, by 2019, after a time of strong decline, the De Luca Bossa clan is believed to be gaining power again in the eastern area of Naples, thanks to the merger with emergent groups, in particular with the Minichini. In fact, according to investigations, the group is now considered the most powerful clan in Ponticelli and in much of the Vesuvian area.
On August 27, 2019, the Court of Naples issued an order for custody in prison for Emmanuel De Luca Bossa, the youngest son of 'O sicco. Emmanuel was already under house arrest for robbery and was found in possession of a gun during a recent search warrant.
In September 2019, Umberto De Luca Bossa, son of 'O sicco, was released from prison, after more than two years in jail, accused of illegal gun possession.
Also in September 2019, Tommaso Schisa, member of the Schisa's faction of the clan, became pentito. Schisa is said to have an important role in the alliance between the De Luca Bossa clan and the Rinaldi clan.
In February 2020, Emmanuel De Luca Bossa, was released from jail.
Since Umberto De Luca Bossa became new the leader of the organization, after his release from jail in 2019, was noticed the increase of the continuous and pressing extortion requests, exercised with threatening and even violent methods in the areas under the influence of the clan.
See also
Camorra
List of Camorra clans
Ponticelli
Rinaldi clan
References
1990s establishments in Italy
Camorra clans |
Bernd Windhausen (22 September 1941 – 4 November 2014) was a German professional footballer who played as a forward.
References
External links
1941 births
2014 deaths
German men's footballers
Men's association football forwards
Bundesliga players
Borussia Fulda players
SpVgg Greuther Fürth players
1. FC Kaiserslautern players
SV Werder Bremen players
West German men's footballers
People from Duderstadt
Footballers from Lower Saxony |
```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
}
``` |
Saint-Lupicin () is a former commune in the Jura department in the Bourgogne-Franche-Comté region in eastern France. On 1 January 2017, it was merged into the new commune Coteaux du Lizon.
Population
See also
Communes of the Jura department
References
Former communes of Jura (department) |
Liudmyla Babak (; born 1 April 1997 in Enerhodar, Zaporizhzhia Oblast, Ukraine) is a Ukrainian sprint and marathon canoer. She is a three-time bronze medalist of the European Championships, with her first medal coming from the 2018 Europeans.
Babak specialises in canoe marathon competitions. She is World and European champion.
References
External links
Ukrainian female canoeists
Living people
1997 births
Sportspeople from Zaporizhzhia Oblast
21st-century Ukrainian women |
Murray Smith (14 June 1940 – 28 December 2003) was a British television writer and producer. He was associated with many British films and TV shows, including the ITV series The XYY Man, Strangers and Bulman, all featuring actor Don Henderson in the role of George Bulman. Smith also wrote scripts for such series as The Sweeney, Minder, and Dempsey and Makepeace, and also wrote several novels.
He also wrote five screenplays for British exploitation director Pete Walker. These included Die Screaming, Marianne and The Comeback.
Filmography
Television
References
External links
1940 births
2003 deaths
British male television writers
British television producers
20th-century screenwriters |
```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());
}
}
``` |
Kloneus is a genus of moths in the family Sphingidae, containing only one species, Kloneus babayaga, which is known from Nicaragua but probably ranges from Mexico to Costa Rica.
Adults are similar to Pachylia ficus but can be distinguished by the strongly crenulated outer forewing margin, the very large discal spot on the forewing upperside and the inconspicuous median band on the hindwing upperside. The lower three-quarters of the hindwing upperside are pale brown with a slightly darker median band. The marginal band is dark brown, with a very narrow dark brown postmedian line running along just basal to its inner edge.
Adults are probably on wing year round.
References
Dilophonotini
Monotypic moth genera
Moths of North America
Moths of South America |
Ebru Umar (; ; born 20 May 1970) is a Dutch columnist of Turkish descent. Under the influence of Theo van Gogh, she gave up a career in management and became a columnist, first for van Gogh's website and, after he was assassinated, as his successor as a regular columnist of Metro. She writes for a number of Dutch magazines and has published four books, often on the topics of feminism and criticism of Islam.
Biography
Umar is the child of Turkish parents who came to the Netherlands in 1970. Her father is a retired anatomic pathologist, her mother an ophthalmologist. She grew up in Rotterdam and attended the Gymnasium Erasmianum.
After studying management and working for a while as a manager, she began writing, under the influence of Theo van Gogh, and wrote columns for his website (van Gogh was her "friend and mentor"), and soon began writing for a number of other Dutch newspapers. In 2005 she took over van Gogh's column in Metro. Umar is also the author of four books, and writes a weekly column for the Dutch women's weekly magazine Libelle (in addition to doing interviews and panel discussions for the magazine) and for the Dutch feminist magazine Opzij. Umar, an atheist, has a reputation for outspokenness, a characteristic her parents say she has had from an early age.
In 2006 she was beaten outside her apartment in Amsterdam by two attackers.
Arrest in Turkey
On April 23, 2016, Umar was arrested in her holiday apartment in the Turkish town of Kuşadası, which she has said was for posting tweets that were critical of Turkish president Erdoğan. She was then released but not allowed to leave Turkey. On April 24, 2016, her home in Amsterdam was burglarized and vandalized.
Bibliography
Burka & Blahniks (2004)
Vier over 8 (2005)
Geen talent voor de liefde (2005), diary-style reminiscences
Turkse verleidingen (2008), a collection of travel stories set in Turkey
References
External links
Ebru Umar on Libelle
1970 births
Living people
Critics of multiculturalism
Dutch atheists
Dutch bloggers
Dutch women bloggers
Dutch columnists
Dutch women columnists
Dutch critics of Islam
Dutch opinion journalists
Dutch former Muslims
Dutch people of Turkish descent
Dutch political writers
Dutch political commentators
Dutch republicans
Dutch people imprisoned abroad
Free speech activists
Freedom of expression in Turkey
Censorship in Turkey
Dutch women critics
Writers from The Hague
Journalists imprisoned in Turkey
Former Muslim critics of Islam |
```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)
``` |
Shout (noun and verb) in English, Australian English and New Zealand English, refers to an act of spontaneous giving.
Its primary use is in pub culture, where one person in a group elects to pay for a round of drinks for that group.
It may be that person's polite way of leaving the group to go elsewhere.
By extension, it can refer to paying for another person's purchase; something they have chosen or will choose for themselves, as distinct from a gift or present.
Typical constructions are:
"My shout", perhaps to expedite a minor transaction, as when paying for a shared meal.
"I'll shout you to the pictures"; "I'll shout you a new dress"
"He shouted her to a slap-up meal"
Historically, the term "shout" was used by Rolf Boldrewood in A Colonial Reformer (1877), Henry Lawson in his poem "The Glass on the Bar" (1890), Jack Moses in Beyond the City Gates (1923) and Dal Stivens in The Courtship of Uncle Henry (1946).
References
Australian English |
Whole-life cost is the total cost of ownership over the life of an asset. The concept is also known as life-cycle cost (LCC) or lifetime cost, and is commonly referred to as "cradle to grave" or "womb to tomb" costs. Costs considered include the financial cost which is relatively simple to calculate and also the environmental and social costs which are more difficult to quantify and assign numerical values. Typical areas of expenditure which are included in calculating the whole-life cost include planning, design, construction and acquisition, operations, maintenance, renewal and rehabilitation, depreciation and cost of finance and replacement or disposal.
Financial
Whole-life cost analysis is often used for option evaluation when procuring new assets and for decision-making to minimize whole-life costs throughout the life of an asset. It is also applied to comparisons of actual costs for similar asset types and as feedback into future design and acquisition decisions.
The primary benefit is that costs which occur after an asset has been constructed or acquired, such as maintenance, operation, disposal, become an important consideration in decision-making. Previously, the focus has been on the up-front capital costs of creation or acquisition, and organisations may have failed to take account of the longer-term costs of an asset. It also allows an analysis of business function interrelationships. Low development costs may lead to high maintenance or customer service costs in the future. When making this calculation, the depreciation cost on the capital expense should not be included.
Environmental and social
The use of environmental costs in a whole-life analysis allows a true comparison options, especially where both are quoted as "good" for the environment. For a major project such as the construction of a nuclear power station it is possible to calculate the environmental impact of making the concrete containment, the water required for refining the copper for the power plants and all the other components. Only by undertaking such an analysis is it possible to determine whether one solution carries a lower or higher environmental cost than another.
Almost all major projects have some social impact. This may be the compulsory re-location of people living on land about to be submerged under a reservoir or a threat to the livelihood of small traders from the development of a hypermarket nearby.
Whole-life cost topics
Project appraisal
Whole-life costing is a key component in the economic appraisal associated with evaluating asset acquisition proposals. An economic appraisal is generally a broader based assessment, considering benefits and indirect or intangible costs as well as direct costs.
In this way, the whole-life costs and benefits of each option are considered and usually converted using discount rates into net present value costs and benefits. This results in a benefit cost ratio for each option, usually compared to the "do-nothing" counterfactual. Typically the highest benefit-cost ratio option is chosen as the preferred option.
Historically, asset investments have been based on expedient design and lowest cost construction. If such investment has been made without proper analysis of the standard of service required and the maintenance and intervention options available, the initial saving may result in increased expenditure throughout the asset's life.
By using whole-life costs, this avoids issues with decisions being made based on the short-term costs of design and construction. Often the longer-term maintenance and operation costs can be a significant proportion of the whole-life cost.
Asset management
During the life of the asset, decisions about how to maintain and operate the asset need to be taken in context with the effect these activities might have on the residual life of the asset. If by investing 10% more per annum in maintenance costs the asset life can be doubled, this might be a worthwhile investment.
Other issues which influence the lifecycle costs of an asset include:
site conditions,
historic performance of assets or materials,
effective monitoring techniques,
appropriate intervention strategies.
Although the general approach to determining whole-life costs is common to most types of asset, each asset will have specific issues to be considered and the detail of the assessment needs to be tailored to the importance and value of the asset. High cost assets (and asset systems) will likely have more detail, as will critical assets and asset systems.
Maintenance expenditure can account for many times the initial cost of the asset. Although an asset may be constructed with a design life of 30 years, in reality it will possibly perform well beyond this design life. For assets like these a balanced view between maintenance strategies and renewal/rehabilitation is required. The appropriateness of the maintenance strategy must be questioned, the point of intervention for renewal must be challenged. The process requires proactive assessment which must be based on the performance expected of the asset, the consequences and probabilities of failures occurring, and the level of expenditure in maintenance to keep the service available and to avert disaster.
IT industry usage
Whole-life cost is often referred to as "total cost of ownership (TCO)" when applied to IT hardware and software acquisitions. Use of the term "TCO" appears to have been popularised by Gartner Group in 1987 but its roots are considerably older, dating at least to the first quarter of the twentieth century.
It has since been developed as a concept with a number of different methodologies and software tools. A TCO assessment ideally offers a final statement reflecting not only the cost of purchase but all aspects in the further use and maintenance of the equipment, device, or system considered. This includes the costs of training support personnel and the users of the system, costs associated with failure or outage (planned and unplanned), diminished performance incidents (i.e. if users are kept waiting), costs of security breaches (in loss of reputation and recovery costs), costs of disaster preparedness and recovery, floor space, electricity, development expenses, testing infrastructure and expenses, quality assurance, boot image control, marginal incremental growth, decommissioning, e-waste handling, and more. When incorporated in any financial benefit analysis (e.g., ROI, IRR, EVA, ROIT, RJE) TCO provides a cost basis for determining the economic value of that investment.
Understanding and familiarity with the term TCO has been somewhat facilitated as a result of various comparisons between the TCO of open source and proprietary software. Because the software cost of open source software is often zero, TCO has been used as a means to justify the up-front licensing costs of proprietary software. Studies which attempt to establish the TCO and provide comparisons have as a result been the subject of many discussions regarding the accuracy or perceived bias in the comparison.
Automobile industry, finances
Total cost of ownership is also common in the automobile industry. In this context, the TCO denotes the cost of owning a vehicle from the purchase, through its maintenance, and finally its sale as a used car. Comparative TCO studies between various models help consumers choose a car to fit their needs and budget.
TCO can and often does vary dramatically against TCA (total cost of acquisition), although TCO is far more relevant in determining the viability of any capital investment, especially with modern credit markets and financing. TCO also directly relates to a business's total costs across all projects and processes and, thus, its profitability. Some instances of "TCO" appear to refer to "total cost of operation", but this may be a subset of the total cost of ownership if it excludes maintenance and support costs.
See also
Benefits Realisation Management
Infrastructure
Asset management
Life Cycle Thinking
Design life
Durability
Maintainability
Planned obsolescence
Repairability
Product life
Source reduction
Throwaway society
References
Further reading
Riggs, James L., (1982), Engineering economics. McGraw-Hill, New York, 2nd edition, 1982.
Norris, G. A. (2001): Integrating Life Cycle Cost Analysis and LCA, in: The International Journal of Life Cycle Assessment, Jg. 6, H. 2, p. 118–120.
Schaltegger, S. & Burritt, R. (2000): Contemporary Environmental Accounting. Issues, Concepts and Practice. Sheffield: Greenleaf Publ.
Kicherer, A.; Schaltegger, S.; Tschochohei, H. & Ferreira Pozo, B.: Eco-Efficiency. Combining Life Cycle Assessment and Life Cycle Costs via Normalization, International Journal of LCA, 2007, Vol 12, No 7, 537–543.
External links
Whole-life cost forum
Whole-life costing for sustainable drainage
article: "What is whole life cost analysis?"
Role of depreciation
Cost Structure and Life Cycle Cost (LCC) for Military Systems – Papers presented at the RTO Studies, Analysis and Simulation Panel (SAS) Symposium held in Paris, France, 24–25 October 2001
Brand management
Costs
Infrastructure investment
Product management |
Colayrac-Saint-Cirq (; ) is a commune in the Lot-et-Garonne department in south-western France.
Twin towns
Colayrac-Saint-Cirq is twinned with:
San Fior, Italy
See also
Communes of the Lot-et-Garonne department
References
Colayracsaintcirq |
Rihards Pīks (born December 31, 1941 in Riga) is a Latvian politician and Member of the European Parliament for the People's Party; part of the European People's Party. He served as the Foreign Minister of Latvia from 2004 to 2009.
References
1941 births
Living people
Politicians from Riga
Latvian Farmers' Union politicians
People's Party (Latvia) politicians
For Latvia's Development politicians
Ministers of Culture of Latvia
Ministers of Foreign Affairs of Latvia
Deputies of the 7th Saeima
Deputies of the 8th Saeima
People's Party (Latvia) MEPs
MEPs for Latvia 2004–2009 |
Amir Mohammad Golzadeh (born May 9, 2003, in Isfahan) is a volleyball player from Iran. He is now a member of Iran men's national under-21 volleyball team. He won the third place in the 2021 World Under-19 Championship with Iran's Under-19 National Team and won the Championship in the Volleyball Men's U21 World Championship in Bahrain in 2023 with Iran's Under-21 National Volleyball Team. He was recognized as the most valuable player in this tournament.
References
2003 births
Living people
Iranian men's volleyball players |
In mathematics, a Ramanujan prime is a prime number that satisfies a result proven by Srinivasa Ramanujan relating to the prime-counting function.
Origins and definition
In 1919, Ramanujan published a new proof of Bertrand's postulate which, as he notes, was first proved by Chebyshev. At the end of the two-page published paper, Ramanujan derived a generalized result, and that is:
where is the prime-counting function, equal to the number of primes less than or equal to x.
The converse of this result is the definition of Ramanujan primes:
The nth Ramanujan prime is the least integer Rn for which for all x ≥ Rn. In other words: Ramanujan primes are the least integers Rn for which there are at least n primes between x and x/2 for all x ≥ Rn.
The first five Ramanujan primes are thus 2, 11, 17, 29, and 41.
Note that the integer Rn is necessarily a prime number: and, hence, must increase by obtaining another prime at x = Rn. Since can increase by at most 1,
Bounds and an asymptotic formula
For all , the bounds
hold. If , then also
where pn is the nth prime number.
As n tends to infinity, Rn is asymptotic to the 2nth prime, i.e.,
Rn ~ p2n (n → ∞).
All these results were proved by Sondow (2009), except for the upper bound Rn < p3n which was conjectured by him and proved by Laishram (2010). The bound was improved by Sondow, Nicholson, and Noe (2011) to
which is the optimal form of Rn ≤ c·p3n since it is an equality for n = 5.
References
Srinivasa Ramanujan
Classes of prime numbers |
Zohreh (Persian: زهره, Arabic:الزهرة) is a Persian female given name which means "Venus".
People
Zohreh Akhyani
Zohreh Jooya
Zohreh Lajevardi
Zohreh Mojabi
Zohreh Sefati
Zohreh Tabatabai
Zohreh Tabibzadeh-Nouri
See also
Zohreh, a proposed state-owned communications satellite that was not built.
Zahreh, a city in and the capital of Cham Khalaf-e Isa District, in Hendijan County, Khuzestan Province, Iran, also sometimes romanized Zohreh
References
Persian feminine given names
Feminine given names |
```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 }}"
``` |
Adriano Augusto da Silva (born 15 October 1933) is a Portuguese sailor. He competed in the Flying Dutchman event at the 1968 Summer Olympics.
Notes
References
External links
1933 births
Living people
Portuguese male sailors (sport)
Olympic sailors for Portugal
Sailors at the 1968 Summer Olympics – Flying Dutchman |
```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);
}
``` |
Heliophanus ramosus is a jumping spider species in the genus Heliophanus. It was first described by Wanda Wesołowska in 1986 and lives in Algeria, Portugal and Spain.
References
Spiders described in 1986
Fauna of Algeria
Fauna of Portugal
Fauna of Spain
Spiders of Europe
Salticidae
Spiders of Africa
Taxa named by Wanda Wesołowska |
Australia Zoo is a zoo in the Australian state of Queensland on the Sunshine Coast near Beerwah/Glass House Mountains. It is a member of the Zoo and Aquarium Association (ZAA), and is owned by Terri Irwin, the widow of Steve Irwin, whose wildlife documentary series The Crocodile Hunter and his family's new show Crikey! It's the Irwins made the zoo a popular tourist attraction.
Australia Zoo was opened by Bob and Lyn Irwin on 3 June 1970 under the name Beerwah Reptile and Fauna Park. Their son Steve had helped his parents since childhood to care for crocodiles and reptiles and to maintain the growing number of animals in the zoo. In 1982 the park was renamed the Queensland Reptile and Fauna Park and the area was doubled with the purchase of another . Steve and Terri changed the name of their now growing wildlife park to Australia Zoo. As filming generated extra funds, Steve and Terri put all money raised from filming and merchandise into conservation and building new exhibits. Following Steve's accidental death from a stingray, Terri became the new owner of the zoo.
Australia Zoo won the Australian Tourism Awards for 2003–2004 in the category Major Tourist Attraction. In 2004, the Australian Animal Hospital was opened next to the zoo to help with animal care and rehabilitation. In 2010, Australia Zoo won Gold in the Queensland Tourism Awards for Major Tourist Attraction and in 2019, they won the RACQ People's Choice Award – Experience & Services. Visitors will see a wide variety of birds, mammals, and reptiles, and can view crocodile feedings, and have hands-on animal encounters.
History
1970–1992
Australia Zoo was opened by Bob and Lyn Irwin on 3 June 1970 under the name Beerwah Reptile Park. Bob is a world-renowned herpetologist, who is regarded as a pioneer in the keeping and breeding of reptiles, while Lyn was one of the first to care for and rehabilitate sick and injured wildlife in southeast Queensland. Bob and Lyn passed on their love and respect for wildlife to their three children: Joy, Steve, and Mandy. Steve had helped Bob and Lyn since childhood to care for crocodiles and reptiles and to maintain the growing number of animals in the zoo. In 1982, the park was renamed the Queensland Reptile and Fauna Park and the area was doubled with the purchase of another . In 1987, the Crocodile Environmental Park was opened in an effort to aid saltwater crocodile protection. By the 1990s the Crocodile Environmental Park had become very popular and was seen as unique for its display of crocodile feeding within the park. The area was mainly used to house adult saltwater crocodiles that had been captured and relocated from the wild.
1992–2006
The 1990s brought many changes: Bob and Lyn retired and moved to Rosedale, Queensland, while Steve and Terri changed the name of their now growing wildlife park to Australia Zoo. As filming generated extra funds, Steve and Terri put all money raised from filming and merchandise into conservation and building new exhibits. Their philosophy was that the zoo animals came first, the zoo team came second, and the zoo visitors came third. The zoo also expanded with the creation of a management team and hiring around 50 staff. Australia Zoo won the Australian Tourism Awards for 2003–2004 in the category Major Tourist Attraction. In 2004, the Australian Animal Hospital was opened next to the zoo to help with animal care and rehabilitation. The facility was built in an old avocado packing shed, and was dedicated to Lyn. The facility had a single operating room, and with a staff of 20 full-time workers and 80 volunteers, it cared for up to 6,000 animals per year. Steve Irwin died in 2006, the same year Australia Zoo Retail won the Tourism Retailing Award from Qantas Australian Tourism Awards.
2007–present
In 2007, the zoo and the Government of Queensland made a land deal involving giving a parcel of land from the Beerwah State Forest to Australia Zoo in return for land near Peachester State Forest which was transferred to the government for forestry. The swap permitted the development of an open-range safari attraction, allowing the zoo to expand to a world-class standard. In 2008, a new $5 million animal hospital, claimed to be the largest wildlife hospital in the world, opened next to the packing shed. The new facility is built of mud brick and hay. It contains two operating theaters with viewing areas for student veterinarians, two treatment rooms, intensive care units for mammals, birds, and reptiles, a X-ray room, and public areas including a drop-off area, pharmacy, nursery, and waiting room. A conference room in the building will be rented out to help generate operating funds.
On 15 March 2008 the Brisbane-based newspaper, The Sunday Mail, claimed there are plans to sell Australia Zoo to Animal Planet and create a $100-million Disney-style wildlife theme park. Terri has publicly announced that she has no plans to sell the zoo, but is looking to expand the park. Despite rumours that she intended to return to the United States, Terri denied the claims and became an Australian citizen on 20 November 2009.
During the 2019–20 Australian bushfire season, the Wildlife Hospital associated with the zoo treated its 90,000th injured animal.
Management
The Australia Zoo business is owned by Australia Zoo Pty Ltd, but the land on which the zoo is located, and most of the surrounding area, is owned by Silverback Properties Pty Ltd.
Animals
Australia Zoo contains a wide range of birds, mammals and reptiles.
Birds
Australian king parrot
Bar-shouldered dove
Black-necked stork
Blue-and-yellow macaw
Brahminy kite
Brolga
Bush stone-curlew
Chestnut-breasted mannikin
Eastern whipbird
Eclectus parrot
Emu
Galah
Glossy ibis
Gouldian finch
Great cormorant
Green-winged macaw
Helmeted guineafowl
Little pied cormorant
Magpie goose
Noisy pitta
Pacific emerald dove
Pied imperial pigeon
Radjah shelduck
Rainbow lorikeet
Red-browed finch
Red-collared lorikeet
Red-tailed black cockatoo
Rose-crowned fruit dove
Sacred kingfisher
Scarlet macaw
Southern cassowary
Sulphur-crested cockatoo
Wedge-tailed eagle
Whistling kite
White-headed pigeon
Wonga pigeon
Yellow-tailed black cockatoo
Frogs (Amphibians)
Blue poison dart frog
Dyeing poison dart frog
White-lipped tree frog
Mammals
Asian small-clawed otter
Binturong
Black-flanked rock wallaby
Brush-tailed rock wallaby
Cheetah
Common wombat
Dingo
Eastern grey kangaroo
Giraffe
Koala
Meerkat
Plains zebra
Quokka
Red kangaroo
Red panda
Red-necked wallaby
Ring-tailed lemur
Short-beaked echidna
Southern hairy-nosed wombat
Southern white rhinoceros
Sumatran elephant
Sumatran tiger
Swamp wallaby
Tasmanian devil
Reptiles
Aldabra giant tortoise
American alligator
Black-headed python
Boyd's forest dragon
Broad-shelled turtle
Burmese python
Coastal taipan
Common blue-tongued skink
Common death adder
Corn snake
Cunningham's skink
Eastern brown snake
Eastern diamondback rattlesnake
Eastern shingleback
Eastern water dragon
Elongated tortoise
Fijian crested iguana
Freshwater crocodile
Gila monster
Green anaconda
Indian star tortoise
Inland bearded dragon
Inland taipan
King brown snake
King cobra
Komodo dragon
Krefft's turtle
Land mullet
Mertens' water monitor
Murray River turtle
Radiated tortoise
Red-bellied black snake
Rhinoceros iguana
Saltwater crocodile
Saw-shelled turtle
Scrub python
Tiger snake
Woma python
Yakka skink
Exhibits
The Crocoseum
The 'Mount Franklin Crocoseum' stadium at the zoo has a seating capacity of 5,000. It is used mostly for animal shows. At the time of its construction, it was the first in the world where snake, bird and crocodile shows were conducted. Australia Zoo calls this the 'Australia Zoo Wildlife Warriors Show'. This is also where the zoo presents concerts, such as the Summer Down Under series.
Africa
On 17 September 2011, the zoo opened its African Safari exhibit, a multi-species replica of the Serengeti ecosystem, showcasing giraffes, plains zebra and southern white rhinos' interacting as they would in the wild. Also on display are cheetahs, but not in the area where the other animals are. There is also an exhibit for meerkats next to the big savanna who share their exhibit with wandering helmeted guineafowls. This area of the zoo includes Queensland bottle trees reflecting the native African baobab tree and mock kopjes as seen in southern Africa.
Tiger Temple
Opened in April 2005, this exhibit houses Sumatran tigers (and previously also Bengal tigers). The exhibit was built to resemble the Angkor Wat temple in Cambodia. It is enclosed on two sides by glass, and includes an underwater viewing area.
Elephantasia
Elephantasia is a Asian themed exhibit that opened in 2006 and is the largest elephant enclosure in Australia. It includes a wading pool with a fountain, and tropical gardens with shaded areas for the zoo's elephants. In October 2019 Australia Zoo imported four female Sumatran elephants. The elephants are on display in Elephantasia as of December 2021.
Rainforest Aviary
The Rainforest Aviary is an outdoor walk-through aviary housing about 150 birds, most of which are native to Australia. Adjacent to the Rainforest Aviary is the Birds of Prey aviary, which holds various species of raptors and other predatory birds. Following the birth of Bindi Irwin's daughter the Rainforest Aviary was renamed Grace's Bird Garden.
Bindi's Island
Opened beside the Africa exhibit in December 2014 and named after Steve's daughter, Bindi's Island is a three-story "treehouse" built around a replica fig tree. It offers panoramic views of Australia Zoo, including the adjacent lemur island.
Robert's Reptile House
The zoo's indoor reptile exhibits which showcase twenty different species of reptiles (and three species of frogs) in sixteen different terrariums.
Other Exhibits
Further exhibit zones include Crocodile Environmental Park, Roo Heaven, Wetlands and others.
Other facilities
Crikey! Cafe
Visitors can eat at the open air upper story "Crikey! Cafe" (which seats up to 1,500), at the Dingo Diner, or at several food vending stands around the zoo.
Transport
To get around the zoo, visitors can take Steve's Safari Shuttle, a 'modified trailered bus' that operates on a bitumen (asphalt) roadway circuit. Visitors can also hire a caddie with guide to drive around the zoo for the day.
Playgrounds
The zoo includes multiple shaded playgrounds as well as a jumping pillow and water splash park.
Activities
There are 4 walk-through enclosures that visitors can enter and feed kangaroos, wallabies, and koalas, and there is often an opportunity to pet a koala when staff are in the exhibit.
The zoo also offers a roving animal team that walks around the grounds throughout the day with various animals such as alligators, birds, snakes, and lizards. Visitors may have their photo taken with the animals and can purchase professional copies from the zoo's photo lab.
In April 2019 Australia Zoo announced $8 million project 'Camp Crocodile'. The wildlife camping experience is expected to lure over 39,000 visitors to the Sunshine Coast each year.
Animal rescue and rehabilitation
Wildlife Warriors
Wildlife Warriors runs a rescue operation and care station for any native wildlife which may be injured in accidents outside the zoo.
This effort is now supported by the Australia Zoo Wildlife Hospital next to the zoo, which can care for up to 10,000 animals per year, with two operating theaters, two treatment rooms, intensive care units for mammals, birds, and reptiles, and an X-ray room, and was designed by WD Architects. The hospital is named in honor of Steve Irwin's mother Lynn Irwin, who died in a car accident in 2000.
Other zoo properties
Steve Irwin Wildlife Reserve
This property was acquired with the assistance of the Australian government as part of the National Reserve System Programme. It is located on the Cape York Peninsula in Queensland, and contains spring fed wetlands that provide a water source to threatened habitat and the Wenlock River.
Iron Bark Station (Blackbutt)
Australia Zoo purchased the Iron Bark Station located at Blackbutt, Queensland in 1994. It is part of the great dividing Range, where the East coast meets the dry West. An additional was purchased in 1994 to save a dwindling koala population, with fewer than 12 koalas left in the area. Management immediately commenced reforestation, including 44,000 eucalypt trees for koalas. In 1998, another was purchased. In 1999, a release facility was established to rehabilitate native marsupials the area. Another was purchased in 1999 with funds from the Lynn Irwin Memorial fund (now Wildlife Warriors Worldwide), and another was added in 2002. In 2007, Bob Irwin became full-time manager of the station.
Mourachan (St. George)
This conservation area was developed to protect endangered species, such as the woma python and yakka skink. It consists of 117,174 acres, in which various habitat types have been created, by Australia Zoo and the Australia Zoo Wildlife Warriors.
It is a place where endangered species can reestablish populations, and as of 2015, Terri purchased an additional 33,000 acres of land to expand this conservation habitat.
See also
Steve Irwin
Terri Irwin
Bindi Irwin
Robert Irwin
Wildlife Warriors
References
External links
1970 establishments in Australia
Zoos established in 1970
Zoos in Queensland
Tourist attractions on the Sunshine Coast, Queensland
Parks in Queensland
Buildings and structures on the Sunshine Coast, Queensland
Steve Irwin |
J. Kurt Barling (born November 1961) is a British professor of journalism at Middlesex University. He previously worked as a journalist for the BBC for 25 years and before that as a lecturer at the London School of Economics. In 1997 he won the CRE's Reporter of the Year award. He is also an author and has been an independent film producer.
Biography
Kurt Barling was born in 1961, of mixed Anglo-Irish and African heritage, in north London, where he attended comprehensive school. He gained a BA (Hons) First Class degree in Politics & Modern Languages from City of London Polytechnic, before winning scholarships to do postgraduate work at the London School of Economics and the Paris Institute of Political Studies (Sciences Po Paris), earning an MSc in Government and a PhD in International Relations, and going on to lecture in LSE's International Relations Department.
Barling was motivated to become a journalist after observing the 1985 Broadwater Farm riots at first hand. In 1989, he joined the BBC, where over the following 25 years he worked on a wide range of prestigious news and current affairs programmes, on both television and radio, including Newsnight, Today, The Money Programme and Black Britain. He covered many stories internationally and has made dozens of documentaries. From 1997 to 2000, he was a BBC News Correspondent, left briefly in 2000 before returning year as a freelancer with BBC London, and from 2001 to 2014 was the Special Correspondent for BBC London News, writing a weekly online column for seven years known latterly as the blog "Barling's London". Barling was one of the BBC's longest-serving ethnic minority journalists. He has also worked as an independent film producer.
Among numerous awards Barling has received for his journalism, film-making and writing, in 1997 he won the Commission for Racial Equality (CRE) "Reporter of the Year" award, as well as several other industry awards.
Since 2012 he has been teaching and researching in the School of Media and Performing Arts at Middlesex University, becoming Professor of Journalism in November 2013.
In 2016 Barling edited and wrote an introduction to the book Finsternis in Deutschland, a translation of E. Amy Buller’s Darkness over Germany, originally published in English in 1943 during World War II. A copy of the book was presented to the Queen, who had met Buller in 1944 after the book's first publication.
Awards
1995: Winner, Bradford & Bingley Personal Finance Awards (Money Check, BBC Radio 5 Live).
1996: Winner, Golden Pen Personal Finance Awards, (Money Box, BBC Radio 4).
1997: Winner, CRE, RIMA (Race in the Media Award), TV Reporter of the Year (BBC News).
1998: Winner, CRE, RIMA, TV Reporter of the Year (Black Britain). Commended, Radio Reporter of the Year (BBC News).
2001: Nominations for Sports Documentary of the Year: Royal Television Society RTS), EMMAs.
2002: Reporter of the Year Nominations: Royal Television Society (London), EMMAs.
2003: Winner, CRE, RIMA, TV Reporter of the Year (BBC London News).
2004: Nomination Reporter of the Year, Royal Television Society (London).
2005: Winner, CRE, RIMA, Best Film Documentary. Nomination, CRE, RIMA TV Reporter of the Year.
2006: Winner, RIMA, Television News. Finalist, One World Media Awards. Shortlisted, RTS London, Reporter of the Year.
Selected publications
Barling, Kurt, & Reda Hassaine (2014), Abu Hamza Guilty: The fight against radical Islam, London: Redshank Books.
Barling, Kurt (2015), The R word: Racism. Provocations. London: Biteback Publishing.
Barling, K. (ed. and introduction), Buller, E. A., Finsternis in Deutschland (trans. from Darkness over Germany, 1934), Munchen: Sandmann Verlag, 2016
References
External links
Amit Singh, "Kurt Barling Interview: 'The BBC Is The Medium Of The Elites, Consented, 11 February 2015.
21st-century British male writers
1961 births
Academics of Middlesex University
Alumni of the London School of Economics
BBC people
Black British academics
Black British writers
British documentary film producers
British male journalists
Living people
Sciences Po alumni
Writers from London |
Brunia cucullata is a moth of the family Erebidae. It was described by Frederic Moore in 1878. It is found on the Andamans.
References
Lithosiina
Moths described in 1878 |
Metaphysics is the second album by Duncan Avoid.
Track listing
"Awakening" – 2:03
"Auditory Arms" – 3:36
"Parallel Grounds" – 4:07
"Systemic Ressentiment" – 5:24
"Lucid [Down the Rabbit Hole]" – 5:31
"Attention Deficit Disorder" – 7:51
"Consciousness Creeping" – 3:08
"S.H.I.F.I." – 5:36
"Convergence" – 3:44
"Auditory Arms – 4:25 (remixed by C-Drik)
"Cartesian Doubt" – 1:50
"Convergence" – 4:21 (remixed by Subskan)
"Plastone Ground" – 2:28 (remixed by Kotra)
"Rue de la Fée Verte" – 3:42
Recognition
Metaphysics received widespread critical acclaim upon its initial release, and was named greatest album of the year by Xanopticon at Igloo Magazine.
References
2004 albums |
Aggi Ásgerð Ásgeirsdóttir (born 1966) is a Faroese artist. She was born in Tórshavn, Faroe Islands. She was educated in Denmark and then moved back to the Faroe Islands, to the small village Vágur in Suðuroy, which is the southernmost island. In the summer 2009 Aggi move to Tórshavn or to Argir, now part of the municipality of Tórshavn. While Aggi was living in Suðuroy, her art was her main occupation, and also mentored Ruth Smith Art Museum in Vágur, she was the chairman of the association "Skálin við Skálá", which owns the museum. Aggi often showed the museum for tourists while she was living in Vágur.
Faroese Art on board Smyril - the Suðuroy Ferry
In 2005 the old ferry Smyril, which sails daily between Tórshavn and Suðuroy, was replaced by a new ferry with the same name. It was decided, that the ship should also be kind of art museum showing some of young Faroese art. Aggi Ásgerð Ásgeirsdóttir was one of the younger Faroese artists who were chosen to decorate Smyril with their art. Aggi made a collection of eight art works which she gave the title "Carpe Diem".
Faroese Art in The School Centre in Suðuroy
In 2009 a new school building was built in Suðuroy, between the villages Hov and Porkeri. There are two schools in the building: The High School of Suðuroy and the Health School of the Faroe Islands. Three people were chosen to decorate the school building; and Aggi Ásgerð Ásgeirsdóttir was one of them. The school has decorated a large wall in the schools cafeteria with paintings.
References
Further reading
Myndlist.net About the book "Levende kunst - 49 nulevende færøske kunstnere" by Inger Smærup Sørensen. The book has an article about Aggi Ásgerð Ásgeirsdóttir.
External links
The Ruth Smith Art Museum in Vágur
Det Fynske Kunstakademi - The Funen Art Academy
1966 births
Living people
People from Tórshavn
Faroese painters
Faroese women painters
21st-century women artists |
The Bundesstraße 528 is a short federal highway in Germany. It is located entirely within the state of North Rhine-Westphalia.
Route
The Bundesstraße 528 forms the southern bypass of Kamp-Lintfort, which had already been foreseen in the federal traffic route plan for quite some time. The construction work has been completed. The first part of the B 528 between the L 476 "Friedrich-Heinrich-Allee" and the motorway junction Kamp-Lintfort (A 57 / A 42) was released for traffic on 19 December 2006. The second section between the L 476 and the B 510 in the west of Kamp-Lintfort is currently under construction.
At the moment, the addition of a direct exit to the logistics center "logport IV", which is to be built by logport ruhr GmbH, is imminent. The railway connection there will be kept and will be used as a connection to the areas of the Duisburg Harbor (logport I to III).
References
Roads in North Rhine-Westphalia
528 |
Arindam Bhattacharya (born 11 December 1989) is an Indian professional footballer who plays as a goalkeeper for I-League club Inter Kashi.
Club career
Bhattacharya played football for Surya Sen Sporting Club in Khardah, he then joined SAI senior team in 2006 where he stayed for 2 years before joining Churchill Brothers.
Bhattacharya joined the Tata Football Academy and was selected for the India under-19 after his performance in the Subroto Cup. After a short spell with the Sports Authority of India, Bhattacharya joined Churchill Brothers, with whom he won the Hero I-League in 2008-09. He moved to Mohun Bagan in the 2012–13 season only to return to Churchill Brothers and win the Federation Cup in 2014. Bhattacharya then joined FC Pune City from 2014 to 2017 before switching to Mumbai City for the 2017–18 season. Bhattacharya made his debut for FC Pune City against Kerala Blasters on 30 October 2014 at the home stadium Shree Shiv Chhatrapati Sports Complex in Pune.
For the 2015 I-League season, he joined Bharat FC. In 2018 Bhattacharya joined Kolkata based club and two time Indian Super League winners ATK. and immediately established himself as the first choice goalkeeper, playing every game that season. In 2020, Arindam Bhattacharya kept 10 clean sheets and was awarded the Golden Gloves. In October 2020, Bhattacharya extended his contract with ATK Mohun Bagan till 2022.
In September 2021, after mutually terminating the contract with ATK Mohun Bagan, Arindam joined East Bengal on a free transfer.
In late June 2022, it was officially announced that Bhattacharya will head to Spain for a month-long training stint with Tercera División (Group 9) side Marbella FC, as part of his preparations ahead of the 2022–23 Indian Super League season.
In 23 August 2022, Arindam joined NorthEast United on a free transfer.
International career
Seeing his performance in Subroto Cup, Stephen Constantine called Bhattacharya up for the Indian U-19 team. His first matches where against Sri Lanka and Myanmar. He made his debut for India U23 team on 5 December 2009 against Afghanistan in Dhaka in the 2009 SAFF Championship.
Career statistics
Club
Honours
India U23
SAFF Championship: 2009
References
External links
Profile (archived) at Goal.com
Profile at the-aiff.com
1989 births
Living people
Indian men's footballers
Footballers from Kolkata
Churchill Brothers FC Goa players
FC Pune City players
Bharat FC players
Sporting Clube de Goa players
I-League players
Indian Super League players
Bengali sportspeople
India men's youth international footballers
India men's international footballers
Men's association football goalkeepers
Bengaluru FC players
ATK (football club) players
Mohun Bagan SG players
Mumbai City FC players
NorthEast United FC players |
John Ferguson (died 22 April 1902) was an Anglican priest who served as Dean of Moray, Ross and Caithness 1886–1902.
Biography
Ferguson was educated at Trinity College, Glenalmond and Aberdeen University, where he received an MA in 1848. He became deacon, and served for three years as Curate of St Mary, Montrose. In 1853 he was ordained as priest, and appointed Rector of Holy Trinity, Elgin, which he held for nearly 50 years. He was appointed chaplain to the Earl of Fife in 1856, synod clerk in 1874, and diocesan inspector in 1878. From 1881 to 1885 he was examining chaplain to Bishop Eden of Moray, and the following year he was appointed to the same position for his successor Bishop Kelly. In 1886, he became Dean of the United Diocese of Moray, Ross, and Caithness, a post he held until his death.
He died at the Deanery, Elgin, on 22 April 1902.
Notes
Alumni of the University of Aberdeen
Scottish Episcopalian clergy
Deans of Moray, Ross and Caithness
1902 deaths
Year of birth missing |
Scorton is a village and civil parish in the Richmondshire district of North Yorkshire, England. It is approximately north-west of the county town of Northallerton.
History
The village is mentioned in Domesday Book as "Scortone" in the lands of Count Alan of Brittany, who was tenant-in-chief during the Norman invasion. Before the invasion the manor was granted to Thorfin of Ravensworth but subsequently granted in 1086 to Bodin, brother of Bardulf. The manor was thereafter split into two parts, the larger granted to the Fitz Hugh family and the smaller to the Fitz Alans. The descent of the larger part of the manor followed that of the manor of Kirkby Ravensworth until 1512 when it came into the Fiennes family, who were entitled as Baron Dacre. In 1600 the manor was left to Charles Tankard and Christopher Jeynes, who had sold it to Leonard Wastell by 1616. Towards the end of the 18th century the manor passed to the Earl of Tyrconnel and followed that family's descent.
The name is derived from a combination of the Old Norse word skor, meaning a rift in the rock, and the Old English suffix tūn, meaning farm or settlement. Put together they mean ravine farm.
Scorton was home to the now closed Scorton Grammar School, 1720–1991. Most of the buildings and grounds have been converted into houses. Scorton has a raised village green, one of only two in England. It is said that the green was built in the early 18th century by John Noble, the first headmaster of Scorton Grammar School. There was also a hospital, St John of God, built in 1880 in the grounds of the former convent of St Clare. It is now a nursing home, Abbey Care Village.
Between 1939 and 1945 the village was home to RAF Scorton, which served as a satellite of RAF Catterick. Many squadrons flew from Scorton during the Second World War including No. 56 Squadron RAF who flew Spitfires and others who flew Beaufighters. The aerodrome has now been extensively quarried away.
Scorton was once served by the Eryholme-Richmond branch line but it was closed in 1969. The station building is now a house and much of the line between Scorton railway station and Catterick Bridge has been destroyed by quarrying.
Governance
The village is in the Richmond UK Parliament constituency. It is also in the Catterick Bridge electoral division of North Yorkshire County Council and the Brompton-on-Swale and Scorton ward of Richmondshire District Council.
Geography
The village is at the northern end of the B6271 from Northallerton where the B1263 from Richmond joins it. Scorton Beck, a tributary of the River Swale, flows south on the east side of the village. The nearest settlements are Bolton-on-Swale to the south, Catterick to the south west and Brompton-on-Swale to the west.
Demography
2001 census
The 2001 UK census showed that the population was 48.6% male and 51.4% female. The religious constituency was 84% Christian and the rest stating no religion or not stating at all. The ethnic make-up was 97.6% White British, 1.7% White other and 0.7% White Irish. There were 367 dwellings.
2011 census
The 2011 UK census showed that the population was still 48.6% male and 51.4% female. The religious constituency was 76.8% Christian, 0.2% Buddhist, 0.1% Muslim, 0.4% Hindu, 0.1% Jewish and the rest stating no religion or not stating at all. The ethnic make-up was 96.7% White British, 1.3% White Other, 0.8% Mixed Ethnic, 0.8% British Asian and 0.1% British Black. There were 403 dwellings.
Community and culture
Scorton once had four public houses. The Royal and St Cuthbert's Inn have been closed and converted into houses. The Heifer and the Farmers’ Arms survive. There are several small businesses including a village shop incorporating a post office. Education for Years 1-6 is provided at Bolton-on-Swale St Mary's Church of England (VA) Primary School.
The village is home to the Ancient Scorton Silver Arrow contest, an archery competition founded in the village in 1673 which returns to Scorton only when a resident wins as last happened in 2008. Scorton is also known for the annual Scorton Feast held around 15 August each year, which celebrated its 750th anniversary in 2006.
Religion
Scorton Methodist Church, on the village green, was built in 1908 and formed part of the Richmond Circuit but is now on the North Yorkshire Dales Circuit. St Mary's Church in Bolton-on-Swale is the nearest Church of England place of worship and St Joseph and St Francis Xavier Church in Richmond is the nearest Roman Catholic Church.
See also
Forest, North Yorkshire
References
External links
Villages in North Yorkshire
Civil parishes in North Yorkshire |
Friedrich Wilhelm Retz (born 29 March 1845 in Neuenstadt; died 16 June 1923 in Yokohama) was a German entrepreneur and watchmaker in the early days of Meiji Era in Japan and honorary consul for Holland, Norway and Sweden.
Friedrich Wilhelm Retz was one of the most important European personalities during the Meiji Era in Japan.
Career overview
Friedrich Wilhelm Retz arrived in Japan in October 1872 and worked for the Swiss watchmaking company Schwartz & Co. based in Yokohama and owned by watchmaker Eulogius Schwartz.
After just two years, Retz founded his own company (1874) under the name "F.Retz & Co.", also based in Yokohama.
Retz began importing watches from Swiss manufactures and retailing them in Japan. The business developed well due to high demand and when his former employer Schwartz gave up his business in 1876, Retz took over his business operation in Yokohama.
In 1881, he began expanding his operations into different trading businesses renaming his company "Retz, Gröhser & Co".
Amongst other deals, he became the general representative of the 'Actien beer brewery Coburg' for Japan. His brother Carl Ludwig Retz managed the brewery in Coburg as a master brewer.
Another venture in which Retz invested was the steam shipping business, acting as an agent for the Austro-Hungarian Lloyds steam shipping company. With this partnership he pursued the goal of being able to establish himself in the field of overseas export-import business between Swiss-Hungary-Austria and Japan.
In 1891 he bought Fritz Denni's watch factory in La Caux-de-Fonds (Neuchâtel), Switzerland and opened a new business branch of his company in Kobe in 1895. He put the management of the business area in the hands of his nephew Wilhelm Retz (son of his brother Wilhelm).
In the 1920s, Friedrich Wilhelm Retz fell ill and died on 16 June 1923 in Yokohama after a serious illness. He was buried in the Yokohama Foreigners Cemetery.
Family
Friedrich Wilhelm Retz married Adelheid née Vanek in 1854, from Budapest (Hungary), who also lived in Yokohama and with whom he had four children: Adele Marie (born in 1875), Luise (born in 1876), Friedrich Wilhelm Karl (born in 1891) and Paula Sophie (born in 1882), all of whom were born in Yokohama.
Shortly after the birth of their fourth child, Adelheid Retz, or Adele as she was called, the family traveled to Germany in 1883 but would ultimately return to Yokohama in 1892. His daughter Paula Sophie (1882–1964) married Richard Schmidt-Scharff (1871–1954), a businessman in Japan, in 1905.
Honors
In 1890, Friedrich Wilhelm Retz was appointed knight of the Imperial Austrian Order of Franz Joseph.
Books
Nana Miyata: Dr. Hans Kühne, deutscher Konsul in Yokohama 1908–1914 und die OAG. Mitteilungen der OAG Nr. 6/2018;
Biografische Daten über Friedrich Retz, OAG, in: Archiv der OAG Nr. 1600;
Biografie über Friedrich Wilhelm Retz, Meiji-Projekt, in: http://www.meiji-portraits.de/meiji_portraits_r.html#20090527093450609_1_2_2_44_1
References
1845 births
1923 deaths
German businesspeople
German diplomats
German watchmakers (people)
F
F
F |
Filzmoos is a town within the district of St. Johann im Pongau in the state of Salzburg, Austria. Its main income comes through tourism: skiing in winter and hiking in summer. The town is approximately 1 km above sea level.
Location
Filzmoos sits below the Gosaukamm mountain range, with the nearest major peak being the Bischofsmütze (Bishop's Mitre), so named due to the shape of its double summit. The mountain itself is a popular objective for climbers. Northeast of the town is the Dachstein massif.
Gallery
Notable people
Brigitte Totschnig, former Austrian alpine skier, was born in the town.
Michaela Kirchgasser, former world slalom skiing silver medalist grew up in Filzmoos and still lives there.
References
External links
Filzmoos website (summer)
Filzmoos website (winter)
Cities and towns in St. Johann im Pongau District
Ski areas and resorts in Austria |
```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(())
}
}
``` |
Paul Malakwen Kosgei (born 22 April 1978, in Marakwet) is a Kenyan long-distance and marathon runner. He first came to prominence in athletics by taking the World Junior Record of 3000m steeple in 1997, and later with consecutive medals at the IAAF World Cross Country Championships from 1998 to 2000.
In 1999 he started his technical collaboration with the Italian Coach Renato Canova, that changed his event, looking at longer distances.
He made his debut at the IAAF World Half Marathon Championships in 2002 and became the surprise world champion for the event. Later that year he became the African champion on the track in the 10,000 metres and also won silver medals at the 2002 Commonwealth Games and 2002 IAAF World Cup.
He focused on entirely on road running after 2002 and he broke the world record for the 25 km distance, running 1:12:45 in May 2004. His personal best over the half marathon (59:07 minutes), with which he won the 2006 Berlin Half Marathon, ranks him within the top ten fastest ever over the distance. He began to focus on marathon running and won his first race at the Maratona d'Italia in 2010 with a course record and personal best time of 2:09.00.
From 2009 there was a passage of coach, from Renato Canova to Gabriele Nicola, who is a student of the former coach.
Career
Junior world record and first medals
Kosgei started his international career as a cross country runner and a steeplechaser. He came to prominence as a junior athlete in 1997 when he took the junior bronze medal at the 1997 IAAF World Cross Country Championships, and he also reached the 1997 IAAF Grand Prix Final for the 3000 metres steeplechase. He established his pedigree by setting a world junior record for the event.
He emerged as a senior the following year, taking the bronze in the short race at the 1998 IAAF World Cross Country Championships and helping Kenya to the team gold medal. He also led Kenya to a team victory at the IAAF World Road Relay Championships in Manaus in April. He was the fourth fastest athlete in the world that year in the steeplechase. He also began taking part in road running competitions and won the 10 km BOclassic race at the end of the year. He improved to the silver medal position at the 1999 IAAF World Cross Country Championships, finishing behind Paul Tergat to help Kenya to a consecutive team win. He represented his country on the track at the 1999 World Championships in Athletics in Seville, where he was seventh in the men's steeplechase. He closed his track season with a fifth-place finish at the 1999 IAAF Grand Prix Final.
African and World Champion
From 2000 onwards he later began concentrating on long-distance running and dropped his steeplechase speciality. He set a 10 km best of 27:40 to win the Parelloop race in Brunssum that year. He also took a third consecutive cross country medal at the 2000 IAAF World Cross Country Championships, continuing the streak of Kenya team victories with his bronze medal performance. He took road circuit wins in Europe at the Giro Podistico Internazionale di Pettinengo, winning the 9.5 km race in 27:03, and also at the Giro al Sas 10K in Trento. He ran for Kenya in the long race at the 2001 IAAF World Cross Country Championships but could not match his short course form and finished in fifth place. The greater distances also did not bring him medals at the 2001 World Championships in Athletics as he finished seventh in the 10,000 metres final. He was the winner of the 2001 Giro Media Blenio 10K race in Dongio, recording a time of 28:13.4.
The 2002 marked a significant breakthrough for Kosgei in both track and road running. In May, he led the Kenyan team to victory at the 2002 IAAF World Half Marathon Championships with a time of 1:00:39. He edged out Jaouad Gharib to win the race on his first attempt at the half marathon distance. His first time success did not make him an immediate convert, however: "I have changed my focus from the steeplechase to the 10,000 metres ... Maybe in two or three years I will start to think about running the marathon". Kosgei became the Kenyan champion over 10,000 m that summer, and his next test came at the 2002 Commonwealth Games in Manchester, England. He was entered into the 10,000 m race and was second behind his Kenyan compatriot Wilberforce Talel – Kosgei's finishing time of 27:45.46 was seven hundredths of a second behind Talel, who broke the Games record for the event.
He went unbeaten over the distance at the 2002 African Championships in Athletics the following month, beating John Cheruiyot Korir to the continental title. As African champion, he was selected to represent the continental at the 2002 IAAF World Cup. He took the 5000 metres silver medal behind the reigning European champion Alberto García (who was banned in 2003 for taking EPO). Among Kosgei's other honours that year was a silver medal from the World Military Track and Field Championships.
Road running world record
After a relatively quiet 2003, Kosgei again came to the fore by setting a world record for the 25 km road distance, winning the BIG 25 Berlin race in 1:12:45 on 9 May 2004 (a record which stood until 2010 when it was beaten by Samuel Kosgei at the same race).
Kosgei won the Berlin Half Marathon in 2006, setting a half marathon personal best of 59:07 minutes as well as bettering his marks over 15 km and 20 km along the way. He competed at the 2007 Hamburg Marathon and Amsterdam Marathon, finishing 14th and 10th, respectively. Kosgei was one of four men under an hour at the Rotterdam Half Marathon in 2008 and his time of 59:37 brought him fourth place. He took three consecutive wins at the Amatrice-Configno road race from 2008 to 2010, building upon his first win in 2003. He posted a personal record of 2:09:12 hours at the 2008 Paris Marathon, where he finished eighth.
He scored his first victory over the marathon distance at the Maratona d'Italia in October 2010, where he set a new course record of 2:09:00.
Personal life
Kosgei is married and has two children. He is currently coached by Italian Gabriele Nicola.
International competitions
References
External links
1978 births
Living people
People from Elgeyo-Marakwet County
Kenyan male long-distance runners
Kenyan male steeplechase runners
Kenyan male marathon runners
Commonwealth Games medallists in athletics
Commonwealth Games silver medallists for Kenya
Athletes (track and field) at the 2002 Commonwealth Games
World Athletics Half Marathon Championships winners
World Athletics Championships athletes for Kenya
World record setters in athletics (track and field)
Kenyan male cross country runners
Medallists at the 2002 Commonwealth Games |
Coronel Fabriciano is a municipality in the state of Minas Gerais in the Southeast region of Brazil. It is located in the region of Vale do Rio Doce and is situated 200 km from the state capital. The municipal population was estimated in 2020 by IBGE in 110,290 inhabitants. The area is ( of urban area).
The municipality was emancipated from Antônio Dias in 1948 and its name is a tribute to Lieutenant colonel Fabriciano Felisberto Carvalho de Brito. The town was situated in the Vale do Aço (Steel Valley) metropolitan area, between the largest steel industries of Minas Gerais state; Usiminas, in Ipatinga, and the Aperam South America, in Timóteo. These industries were situated in Fabriciano at they time they were constructed, and were essential to the development of the city. However, these facilities are located within the area of Ipatinga and Timóteo respectively, which were emancipated from Coronel Fabricano, and incorporated proper in 1964.
Coronel Fabriciano is located in the Serra dos Cocais, home of many natural attractions of the city like the "Pedra Dois Irmãos" (Two Brothers stone), the "Pedra do Caladão" (Silent stone), the "Cachoeira do Escorregador" (slide waterfalls), the "Trilhas da Mamucha" (Mamucha trails), and other waterfalls and trails. Outdoor sports are popular such as hiking, trekking, mountain biking, parachute jumping, and 4x4 offroading. The city also features historical monuments like the "Catedral de São Sebastião" (Saint Sebastian Cathedral), the "Colégio Angélica" (Angélica College) and the "Monumento Terra Mãe" (motherland monument).
The Human Development Index (HDI) is 0.755, classified as high by the United Nations Development Programme (UNDP).
History
With the inauguration of the Calado Station, they began to be lifted up the first homes, very poor and basic. Only in 1928 was built, with the exception of the train station, the first house covered with ceramic and floored.
By the Law State no. 843, of November 17 of 1926, the district was created, settling the May 7 of 1927 in the then patrimony of Santo Antônio, that passed to Melo Viana to be called, having been named his/her first peace judge the citizen Manoel Camilo of Fonseca, that gave ownership to his/her first peace clerk, Mr. João the Baptist Pereira. The first registrations civil facts were: the twins' baptism Duraci of Distaneta, daughters of the couple Antônio Viana and the marriage of the Sírio Maron Abibi with Geralda Honrata of Souza. On March 1 of 1930, it was accomplished in the new district the first election
The first name of the place when virgin forest, was Barra, for finding located in the confluence of the ribeirão Caladão, starting to denominate Calado (Quiet), with the inauguration of the Rail Station. Almost time, Raul Soares was denominated, returning the Calado (Quiet) name again. In August 1938, it was baptized with Coronel Fabriciano Fabriciano name, in honor to colonel Fabriciano Felisberto of I Break, for occasion of his/her centennial from birth. Ten years later, the municipal district was created being dismembered of Antônio Dias.
On December 27 of 1948, after a long process gone through the procedure in the Legislative Assembly of the State, governor Milton Campos signs the Law no. 336, creating the municipal district of Coronel Fabriciano. The official installation felt in the day January 1 of 1949, in session presided by the peace judge José Anastácio Franco. It assumed as manager Dr. Antônio Gonçalves Gravatá, with the different objective of to organize the municipal administration and to give him/it to the official mayor, elect for the population. It is like this, the March 15 of 1949, they take ownership then the mayor Dr. Rubem Siqueira Maia, vice-mayor Colonel Silvino Pereira, aldermen Nicanor Ataíde, Lauro Pereira, Ary Barros, José Anatólio Barbosa, Wenceslau Martins Araújo, Sebastião Mendes Araújo, José Paula Viana, Raimundo Martins Fraga and José Wilson Camargo.
In spite of the emancipation and December 27 of 1948, an agreement was signed with the local parish, in which the birthday of the city is commemorated on January 20, day of the patron of the city, São Sebastião.
Geography
Statistics
Elevation: 240 m
Climate: Sub-tropical
Average annual temperature: 22 °C
Latitude South 19°31'07"
Longitude West: 42°37'44
Subdivisions
Main streets and avenues
Most of the city's main avenues (Avenidas) and streets (Ruas) are named after important people. Some of them are in blue below, linked to their Wikipedia article.
Avenida Julita Pires Bretas
Avenida José de Magalhães Pinto
Avenida Geraldo Inácio
Avenida Tancredo de Almeida Neves
Avenida Rubens Siqueira Maia
Rua Maria Matos
Rua Pedro Nolasco
Rua Moacir Birro
Rua Marechal Floriano
Rua São Sebastião
Rua Argemiro José Ribeiro
Rua Padre Américo Magalhães
Districts
Senador Melo Viana
Coronel Fabriciano (sede)
Neighborhoods
Distances from other cities (KM)
Belo Horizonte: 198
Rio de Janeiro: 560
São Paulo: 765
Vitória: 420
Brasília: 936
Ipatinga: 13
Timóteo: 6
Governador Valadares: 118
Sete Lagoas: 273
Economy
The city is between Ipatinga and Timóteo, that base the largest and more modern siderurgic industries of Minas Gerais: Usiminas and Arcelor Mittal Timóteo, respectively. Coronel Fabriciano, those cities and several others, are in the Metropolitan Area of Vale do Aço, where Fabriciano is the second largest city, and has the third GDP.
Trading, services, eucalyptus monoculture, small and medium industries are the main activities in Coronel Fabriciano.
Commercial
According to official statistics of the city hall (http://www.fabriciano.mg.gov.br), the commercial activities include 3.561 registered establishments, of the most varied branches. The section of services involves 3.275 names registered, with prominence for the branch of Hostelry: there are about 1.800 accommodations, and 400 of them are framed in the categories "three" or "four stars."
Agriculture
Eucalyptus, from rural areas, is used by Cenibra, a Brazilian-Japanese cellulose factory in Belo Oriente. It is also used by local charcoal factories.
Industry
Several factories are based in the city, many of then in the Industrial District.
Sports
Extreme
The mountains of Serra dos Cocais in Fabriciano is usually used for extreme sports. Motorcycles and bikes are often used. But it's also common to make slow rides by foot or by horse in these calm mountains and see the waterfalls.
Auto racing
The city's Jeep Club, Jipe Clube Vale do Aço, often organize jeep travels and competitions. In 2008, Fabriciano hosted the 3rd race of the state's 4x4 Regularity rally Championship.
Football
The city main professional football club is Social that plays the state's first division
Images
See also
List of municipalities in Minas Gerais
Rubem Siqueira Maia
Saint Sebastian Cathedral
Saint Sebastian Parish
Catholic University Center of Eastern Minas Gerais (Unileste)
References
External links
Fabriciano.mg.gov.br
IBGE.gov.br
1949 establishments in Brazil
Populated places established in 1949
Municipalities in Minas Gerais |
```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
``` |
Jiading Xincheng () is a station on Line 11 of the Shanghai Metro. It was opened on December 31, 2009.
The station has one side platform and one island platform with three tracks. The side platform is for trains bound for North Jiading and Huaqiao on a single track; the island platform serves trains headed for Disney Resort on two tracks.
References
Line 11, Shanghai Metro
Shanghai Metro stations in Jiading District
Railway stations in China opened in 2009 |
White Day: A Labyrinth Named School, known on mobile platforms internationally as The School : White Day or The School - White Day, is a 2015 survival horror video game developed by ROI Games (also known as Sonnori) and Gachyon Soft. A remake of the 2001 game of the same name, it was initially released for Android on November 2015 in Korea, and iOS on the following month. A port for Microsoft Windows and PlayStation 4 was released in August 2017, published by ROI Games in Korea, PQube in North America and Europe, and Arc System Works in Japan. It is the second remake of White Day, with the first being a 2009 2D adventure-horror game utilizing still images for mobile phones titled White Day Mobile, which was released only in South Korea by Ntreev Soft, who shares the copyright of this game.
Set in South Korea in 2001, players control Lee Hui-min, a new transfer student at a local high school who sneaks into the institution after hours to prepare a White Day surprise for his crush, Han So-young. Upon entry, Hui-min becomes trapped and begins to encounter the supernatural. With the assistance of other students, Hui-min traverses the building, hiding from foes and using item micro-management to solve puzzles to progress through the school, in an attempt to leave the building before dawn.
Gameplay
White Day: A Labyrinth Named School is a survival horror video game played from the first-person perspective. Players explore the school collecting items to solve puzzles and advance the story, much in the vein of a classic adventure game. Micro-management of items is key, as the player has limited item slots and some objects may be important for progression despite not being used for hours from the collection point. As the game offers non-linear progression, various documents can be found throughout the school offering additional backstory and hints on how to advance. Likewise, the player can receive text messages through their cell phone which offers clues on plot progression. Holding certain objects in specific sections of the game can trigger unique events and encounters, such as fights with ghosts that otherwise would not have been prompted. Puzzle solutions, such as combinations for locked safes, are randomized on each playthrough. This encompasses a large portion of the gameplay; searching for items and solving puzzles.
There are no weapons in the game, and thus the protagonist is unable to engage enemies in combat. Therefore, the player must hide from opponents, in a bid to stay alive. If damaged, healing items must be used to restore health, as the game does not feature health regeneration. If health is depleted completely, the player must return to a prior save. Saving can only be accomplished at bulletin boards scattered throughout the school with the use of felt-tip pens, which are limited and must be found around the academy, akin to ink ribbons from the original Resident Evil. Though other characters throughout the title are fully voiced, the protagonist is never heard, and instead communicates with other persons through the use of player-input dialogue options. Depending on what is said, conversations and in-game scenarios may change. The title features eight different endings, and the end result achieved is dictated by these decisions made during conversations with story characters. Similarly, the difficulty selected when starting a new playthrough affects gameplay. Easier difficulties offer more items, progression hints and less paranormal encounters, whilst the harder ones include fewer items and hints, more difficult encounters, exclusive enemies and more frequent scares. On hard and above for example, the player's phone has no signal, thus eliminating the aforementioned text message clues.
Synopsis
In East Asia, an observation known as White Day falls one month after Valentine's Day. In the region, women present men with chocolate on Valentine's Day, usually as an expression of affection, a reverse of the Western tradition which has boys offering gifts to girls. One month following Valentine's Day, on March 14, the men return the favour to the girls that gifted them chocolates, which is known as white day. The game takes place on the eve of White Day in 2001 and in South Korea, it follows protagonist Lee Hui-min, a newly transferred student who sneaks into his new high school, Yeondu High School, to leave his crush, Han So-young, some sweets and return her diary, which he found earlier that day on the school grounds. Upon entering the building, he becomes trapped inside the facility and encounters other students, including So-young. In his attempt to escape the school, Hui-min is tormented by ghosts and possessed human staff members of the school, and begins to uncover the dark past of the institution, learning about several paranormal events that occurred between 1998 and present day.
Most of the story throughout the game is revealed in collectible documents found throughout the school, and the plot varies depending on which choices the player makes throughout the adventure.
Development and release
The game's development began in March 2014, at that time a port of the original White Day for Android and iOS titled White Day: In Your Hands, with the port being handled by Korean developers Sonnori and Gachyon Soft. This port would have more accurately represented the original game from the 2009 mobile version, titled White Day Mobile, which replaced most of the 2001 game with 2D still images due to hardware limitations. However, as development continued, the team's additions to the original game, which included new story segments, improved graphics and cut content from the 2001 build led to the project being re-revealed as a remake in January 2015, with development being switched over to a new studio, ROI Games. Lee Won-Sool, the former CEO of Sonnori, who developed the original title, returned as director and producer of the remake.
On November 19 of that year, the completed Android game was released to the T-Store, Korea's equivalent to the Google Play Store, with the iOS version coming in the following weeks. A few months later, an English language version was made available for international markets, under the name The School: White Day. English language voice actors include Erica Schroeder, Sarah Natochenny, Jason Griffith, Tom Wayland and Kate Bristol, who collectively have played roles in the Sonic the Hedgehog and Pokémon franchises. All mobile versions were self-published by ROI Games.
At a November 2015 SCEK press conference in South Korea, it was announced that White Day would be releasing domestically on PlayStation 4 for the then upcoming PlayStation VR. However, on May 10, 2016, at SCEK's PlayStation Developer Conference 2016, the developers announced that it would be difficult to fit existing scenarios into VR play, so they announced a new VR title with changed scenarios, titled White Day: Swan Song. On April 18, 2016 a Steam Greenlight posting confirmed the existence of a PC version. Seven months later, during the annual South Korean trade show G-Star, it was announced that White Day would be releasing on PlayStation 4 as well as PC with new information about a new female character called Yoo Ji-Min and a new ending collection, with the release date being set for March 14, 2017. The release date would later be postponed in order for the game to have simultaneous worldwide release.
A year would go by without a release, however on May 3, 2017, it was announced via a post on the European PlayStation Blog that the title would be receiving an international publication in August, 2017, with British publisher PQube handling the translation and distribution in North America and Europe. Additionally, it was confirmed the game would remain a PlayStation-console exclusive. These new versions would feature improved graphics and audio, reworked mechanics, additional languages and the inclusion of the previously announced new story segments through character, Yoo Ji-min. PQube initially announced that the game would release across both platforms on August 1 in North America and August 4 in Europe, however a three-week delay to the worldwide Steam release caused the PlayStation version to be pushed back to August 22 in North America and August 25 in Europe, in a bid to have the two versions release simultaneously. The North American release was later pushed back a further week for undisclosed reasons. In Japan, a localization of the original mobile version was released on March 11, 2017. The PlayStation 4 edition was revealed to be published by Arc System Works, of Blazblue and Guilty Gear fame. As a nod to this, pre-orders in the region includes access to costumes from the Blazblue series. Unlike in other territories, the Japanese version has characters renamed and designed with Japanese names and school uniforms, in order to have the title replicate a Japanese setting.
Physical copies for the PlayStation 4 were made available through various online retailers in the United Kingdom, while limited to Amazon.com and videogamesplus.ca in the United States and Canada, respectively. Those who pre-ordered the title in Canada and the British retailer GAME received a complementary soundtrack CD. White Day launched at a budgeted price of £29.99 in the UK, USD$29.99 in the United States, CAD$39.99 in Canada, ¥4800 in Japan and ₩32000 in South Korea.
As of September 3, 2017, two patches have been released for the PlayStation 4 and Windows version of the game. These updates corrected balancing issues with the in-game janitors (which most critics had cited as too difficult) and various other technical fixes. An enhanced version with over 30 costumes originally released as downloadable content was released for Nintendo Switch, PlayStation 5 and Xbox Series X/S on September 8, 2022.
Reception
White Day: A Labyrinth Named School received mixed reviews from critics on PlayStation 4 according to aggregate review website Metacritic. Praise was generally given to the setting, puzzles, and horror aspects. Reviewers also favourably compared the title to classic horror games from the PlayStation 2 era. Conversely, criticism was given to the difficulty and frequency of the janitors and ghosts that appeared throughout the game, which critics said were too overpowered and hindered exploration (the former of which later received a patch that reduced difficulty). The cryptic nature of certain boss battles was also cited as an issue.
Cory Arnold of Destructoid, in a review of the PlayStation 4 version, praised the title's sound direction and clever puzzles, as well as the ghost encounters, calling them the best part of the adventure. However, Arnold echoed many other critics in his criticism of the janitors' difficulty level, while also knocking the character interactions and overall story. He concluded his review by scoring the game a 6.5/10.
Notes
References
External links
(Mobile version)
(Publisher – PQube)
Official Facebook Page (in Korean)
Developer's Official account
2015 video games
Action-adventure games
Android (operating system) games
Arc System Works games
Video games about ghosts
High school-themed video games
2010s horror video games
IOS games
Nintendo Switch games
PlayStation 4 games
PlayStation 5 games
Single-player video games
Windows games
Video game remakes
Video games developed in South Korea
Video games set in 2001
Video games set in Korea
Video games set in South Korea
Xbox Series X and Series S games
PQube games |
The Eakin Mill Covered Bridge (also known as the "McLaughlin Bridge" or the "Geer's Mill Bridge") is a historic covered bridge in Vinton County, Ohio, United States. Located southeast of the county seat of McArthur, this bridge carries Mound Hill Road near the community of Arbaugh.
Built in 1870, the Eakin Mill Bridge was constructed across the Big Raccoon Creek by the McArthur contracting firm of Gilman and Ward. Like many other covered bridges built in Ohio during the late nineteenth century, the Eakin Mill Bridge features the king post truss design; unlike most others, this bridge was built with multiple king posts, enabling it to be significantly stronger than the average bridge that was built with a single king post. This sturdiness was necessitated by the Eakin Mill, a busy gristmill along the Big Raccoon; many other covered bridges spanned the stream, but the frequent mill traffic forced the builders to use an extraordinarily strong design. Gilman and Ward built their bridge on stone piers and roofed it with metal; like many other covered bridges, its walls are weatherboarded.
With the developments of modern truck transportation, the Eakin Mill Covered Bridge became less well suited to daily operation. Many trucks crossed the bridge while carrying loads heavier than they were permitted to carry, and the bridge sustained significant structural damage; accordingly, it was closed and replaced. Nevertheless, the bridge remains in its original location, and it has been designated a historic site. In 1976, the Eakin Mill Covered Bridge was listed on the National Register of Historic Places, qualifying both because of its historically significant engineering and because of its place in Ohio's history.
References
Covered bridges on the National Register of Historic Places in Ohio
Buildings and structures in Vinton County, Ohio
National Register of Historic Places in Vinton County, Ohio
Bridges completed in 1870
Transportation in Vinton County, Ohio
Tourist attractions in Vinton County, Ohio
Road bridges on the National Register of Historic Places in Ohio
Wooden bridges in Ohio |
```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
``` |
Fatherland is the third solo album by Bloc Party frontman Kele Okereke. The album was released on 6 October 2017 and was his first solo album released under his full name instead of the professional name of Kele. It also produced by the band's bassist Justin Harris.
Background
The album was a departure from the alternative dance and electro house style of his previous two albums and instead opted for a folk sound inspired by Joni Mitchell, Nick Drake and Elliott Smith. The album focuses on Kele's experiences being a father despite being a gay man as well as reconnecting with his Nigerian heritage. The album features duets from Olly Alexander from synth-pop band Years & Years and Corinne Bailey Rae on the songs "Grounds for Resentment" and "Versions of Us." Kele embarked on his first solo acoustic tour in support of the album in May 2017 in which he played a mixture of the album, previous solo songs and acoustic renditions of Bloc Party songs.
Critical reception
Fatherland received "generally favourable reviews" from critics; at Metacritic which assigns a normalised rating out of 100 to reviews from mainstream critics, the album received an average score of 66 based on 10 reviews. Critics praised Okereke's honest and personal lyrics as well as usage of "tenor sax, soft electric piano and clarinets." Neil Young from AllMusic described the album as "forlorn and delicate" and as remaining "mostly sullen and occasionally sharp in its content, but the instrumentation helps lift the songs from the gloom." He also praised Okereke's restraint and maturation as a songwriter. Leander Hobbs from The Line of Best Fit described the duets with Olly Alexander and Corinne Bailey Rae as showing "that Okereke understands how to add greater texture and contrast to his shaky vocals without resorting to the autotuned experiments of his early career." However, others were critical of the album, with The Observer describing "Okereke's shaky voice" as making the album "far slighter than it might have been." Paste magazine said it was a shame "that what lies behind dozens of layers of metaphorical shrouds, isn’t a bit more poetic and interesting."
Track listing
Personnel
Credits adapted from Discogs.
Kele Okereke – lead vocals, lead guitar, songwriting
Additional musicians
Olly Alexander – co-lead vocals and songwriting on "Grounds for Resentment"
Corinne Bailey Rae – co-lead vocals and songwriting on "Versions of Us"
Bruce Withycombe – brass
Megan Diana McGeorge – brass
Paul Brainard – brass
Scott Van Schoick – brass
Willie Matheis – brass
Collette Alexander – cello
Sean Flynn – guitar
Production
Justin Harris – production
Jeff Stuart Saltzman – mixing
Nigel Walton – mastering
Design
Kele Okereke – photography
Rachael Wright – photography
David Drake – photography, art direction, design, layout
References
Kele Okereke albums
BMG Rights Management albums
2017 albums |
The Kunekune () is a small breed of domestic pig from New Zealand. Kunekune are hairy with a rotund build, and may bear wattles hanging from their lower jaws. Their colour ranges from black and white, to ginger, cream, gold-tip, black, brown, and tricoloured. They have a docile, friendly nature, and can successfully be kept as pets.
History
The breed is believed to have descended from an Asian domestic breed introduced to New Zealand in the early 19th century by whalers or traders. They differ markedly from the feral pig of European origin known in New Zealand as a "Captain Cooker". The native Māori people of New Zealand adopted Kunekune; kunekune is a Māori word meaning "fat and round".
By the 1980s, only an estimated 50 purebred Kunekune remained. Michael Willis and John Simister, wildlife park owners, started a breeding recovery programme, which encouraged other recovery efforts. , the breed no longer faces extinction, with breed societies in both New Zealand and the United Kingdom. In 1993, two were imported into the United States from the UK.
Behaviour
In 2017, a report of Science Daily said the Kunekune has remarkable social learning with "astonishingly good memory".
The Kunekune can sustain itself by feeding on nothing other than grass.
Appearance
The Kunekune is covered in hair which can be long or short, and straight or curly. Hair colours include black, brown, ginger, gold, cream, and spotted combinations. It has a medium to short, slightly upturned snout, often black, and either semilopped or pricked ears. It has a short, round body with short legs and may have two wattles (called piri piri) under its chin. The Kunekune stands about tall. An adult Kunekune can weigh between , males being considerably heavier than females.
As pets
Kunekune can be kept as pets in New Zealand and are a recognised breed of miniature pig.
Kunekune cannot be imported into Australia, as Australia does not allow the import of live pigs for biosecurity reasons. However, breeders have created an alternative Australian breed: the Australian miniature pig.
Kunekune can also be kept as pets in Austria, Belgium, Canada, Denmark, France, Germany, Ireland, the Netherlands, Portugal, Switzerland the United Kingdom and the United States.
References
External links
The British Kunekune Pig Society
Mammals of New Zealand
Pig breeds originating in New Zealand |
Our Lady of Suyapa (Spanish: Nuestra Señora de Suyapa), also known as the Virgin of Suyapa (Spanish: Virgen de Suyapa), is a title of the Virgin Mary, mother of Jesus Christ. An 18th-century cedar wood statue (6 cm/2.3 in) of the Virgin is perhaps Honduras' most popular religious image, and the focus of an extensive pilgrimage.
The statue is kept in the Basílica de Suyapa in Suyapa, a suburb of the capital Tegucigalpa, and toured through various other parts of Honduras each year in early February. Many thousands of people from all over Central America make pilgrimages to visit the statue on her name day, February 3, a commemoration of the day she was found in 1747. The statue has been stolen and then recovered on two occasions. Our Lady of Suyapa is the Patroness of Honduras.
Discovery
There are several different versions of how the statue of the Virgin of Suyapa was discovered.
Many Hondurans believe the statue was miraculously discovered in late January or early February 1747 by a labourer, Alejandro Colindres. Colindres and an 8-year-old boy had been sent by Colindres's mother to clear some cornfields on Piligüin mountain, northeast of Tegucigalpa. On the way back, they were overtaken by nightfall and decided to sleep outside. During the night, Colindres was awakened by a sharp pain in his side, and discovered that he was sleeping on something. Later versions of the story claim that without looking at the object, Colindres threw it as far away as he could, only to find it underneath him as he lay down again. This detail, however, is not present in early versions of the story. The next morning, Colindres discovered that he had been sleeping on a tiny statue of the Blessed Virgin Mary, which he took home with him and set up on the family altar in his mother's house. There it remained for the next 20 years.
By 1777, a chapel was constructed for the statue. The first shrine of our Lady of Suyapa was blessed in 1780. The first notable attested miracle occurred in 1796.
The statue has been stolen twice. In 1986 it was stolen and stripped of its gold, silver, and jewels, and left in the men's room of the restaurant La Terrraza de Don Pepe in Tegucigalpa.
Description
La Morenita (the Dear Dark One) is carved in cedar wood, and measures less than 2.5 inches in size. It is believed that the carving is very old, and possibly done as a devotional item by an unknown, amateur artist. She has an oval face and straight, shoulder length hair. Her hands are joined in prayer and she wears a light pink robe. The statue is covered by a dark cloak trimmed with golden stars and adorned with valuable jewels.
Veneration
In 1925, Pope Pius XI declared her Patroness of Honduras under the title Our Lady of Suyapa, and selected February 3 as her feast day. In 1954, a large Basilica was built next to the chapel. The statue of the Virgin spends most of her time in the chapel, but every year before the celebration of her festival, the statue is moved into the larger church to accommodate the crowds.
The statue is considered to have miraculous powers. The swift ending of the Football War between Honduras and El Salvador is attributed to the statue. Many of the Honduran soldiers involved reported visions of the Virgin, which calmed their fears during the fighting. In 1969 The Virgin of Suyapa was declared Captain General of the Armed Forces of Honduras.
The statue of the Virgin of Suyapa has a group of lay caretakers, all male, known as the Orden de los Caballeros de Suyapa, founded in the 20th century. They are responsible for caring for the image, and the small chapel. They escort the statue whenever it leaves the chapel to travel around Honduras, as it often does every February.
See also
Religion in Honduras
References
Sources
Barceló Morey, Jose. 2000. La Inmaculada Concepción de María en Honduras: La Inmaculada Concepción de Suyapa, Patrona de Honduras. San Pedro Sula: Editorial/Librería Coello
Valladares B., Juan R. 1946. La Virgen de Suyapa (historia documentada). Tegucigalpa: Tallereres Tipo-Lito.
External links
Official Catholic church site Spanish
Virgin of Suyapa visits Honduran suburb devastated by massacre
Article in Spanish on sources of the story
Patron saints
Honduran culture
Latin American folklore |
```java
Template methods in abstract classes
Utility classes and `static` methods
Keeping fields `private`
The `abstract` keyword
Double Brace Initialization
``` |
Chris Whitmire (born February 2, 1968) is an American politician who served in the North Carolina House of Representatives representing the 113th district (including constituents in Henderson, Polk, and Transylvania counties) from 2013 to 2017. A retired Colonel in the US Air Force, Whitmire also previously served on the Transylvania County Board of Education.
Electoral history
2014
2012
Committee assignments
2015-2016 Session
Agriculture
Appropriations
Appropriations - Education (Vice Chair)
Education - K-12
Homeland Security, Military, and Veterans Affairs, Chairman
Regulatory Reform
State Personnel
2013-2014 Session
Agriculture
Appropriations
Education
Homeland Security, Military, and Veterans Affairs
Commerce and Job Development
Public Utilities
References
1968 births
Living people
People from Transylvania County, North Carolina
United States Air Force Academy alumni
Columbia University alumni
Republican Party members of the North Carolina House of Representatives
21st-century American politicians |
Sigrid Metz-Göckel (born 1940) is a German sociologist, political scientist and social psychologist who specializes in women's and gender studies as well as in educational research and didactics. She is a professor emerita at the Technical University of Dortmund. In the late 1970s, Metz-Göckel pioneered women's studies in Germany which became an established university course in Dortmund in 1971.
Early life and education
Born on 18 August 1940 in Klein Peterwitz, Upper Silesia, Sigrid Metz-Göckel is the daughter of Franz-Josef Schneider, a schoolteacher, and his wife Helene who raised her three small children after their father died as a soldier in the Second World War. After matriculating from the Sophienschule in Hanover, Metz-Göckel read economics at the University of Mainz before studying sociology the Goethe University Frankfurt, graduating in 1966. In 1972, she completed doctoral studies in social psychology and political science at the University of Giessen, earning a Ph.D. with a dissertation titled Hochschuldidaktik zwischen Theorie und Praxis (University Didactics between Theory and Practice). Thereafter she was a research assistant at the University of Giessen and at Frankfurt's Battelle-Institut. She furthered her education with research trips to the Jagiellonian University in Kraków, Wellesley College, Massachusetts, and the University of California, Berkeley.
Career
While still in Giessen, Metz-Göckel began to take an interest in women, attending a seminar on the new women's movement in the mid-1970s. When she moved to Dortmund, she came into contact with Frauenaktion Dortmund (Dortmund Women's Movement) and organized a successful seminar together with women students. She went on to establish a number of women's groups and began looking at women scientists.
In 1976, she received a professorship at the Tecnnical University of Dortmund where she established a didactic centre focusing on women's and gender studies, heading it until 2005. In 1979, she initiated a further education course on Frauenstudien (women's studies), making it an official course of study at the university in 1981 and contributing as scientific director until 2002.
In the 1980s, together with the sociologist Ursula Müller, she conducted a study on men titled Der Mann. Eine repräsentative Untersuchung über die Lebenssituation und das Frauenbild 20- bis 50-jähriger Männer (Man: A representative study of the situation in life and the image of women among 20- to 50-year-old men), focusing on the emancipation of men and how they viewed women.
Awards
In 1998, Metz-Göckel was honoured with the Cross of the Order of Merit of the Federal Republic of Germany.
References
1940 births
Living people
People from Racibórz County
People from Dortmund
Gender studies academics
German sociologists
German women sociologists
German political scientists
Academic staff of the Technical University of Dortmund
Recipients of the Cross of the Order of Merit of the Federal Republic of Germany |
```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
``` |
Sue Grace (born January 31, 1958) is a former member of the Arizona House of Representatives and the Arizona State Senate. She served in the house from January 1991 through January 1997, and then in the Senate from January 1997 through January 2001.
References
1958 births
Living people
Politicians from Milwaukee
Politicians from Phoenix, Arizona
Women state legislators in Arizona
Republican Party members of the Arizona House of Representatives
Republican Party Arizona state senators
21st-century American women politicians
21st-century American politicians |
Cuervo is Spanish surname literally meaning raven. Notable people with the surname include:
Alma Cuervo (born 1951), American actress
Cayetana Guillén Cuervo (born 1969) Spanish actress and TV presenter
Dark Cuervo, aka Jaime Ignacio Tirado Correa (born 1974), Mexican wrestler
Eduardo Cuervo (born 1977), Mexican actor
Fernando Guillén Cuervo, (born 1963) Spanish actor, film director and scriptwriter
Gemma Cuervo, (born 1936) Spanish actress
Rufino José Cuervo, a Colombian writer, linguist and philologist
See also
El Cuervo (disambiguation)
Corvo (disambiguation)
Corvus (disambiguation)
Surnames from nicknames |
Cognitive styles analysis (CSA) was developed by Richard J. Riding and is the most frequently used computerized measure of cognitive styles. Although CSA is not well known in North American institutions, it is quite popular among European universities and organizations.
state:
"A number of different labels have been given to cognitive styles and, according to Riding, many of these are but different conceptions of the same dimensions . Riding and Cheema surveyed the various (about 30) labels and, after reviewing the descriptions, correlations, methods of assessment, and effect on behavior, concluded that the styles may be grouped into two principal groups: the Wholist-Analytic and the Verbal-Imagery dimensions. It is argued that these dimensions of cognitive style are very fundamental because they develop early in life and are pervasive given their effect on social behavior, decision making, and learning."
Unlike many other cognitive style measures, CSA has been the subject of much empirical investigation. Three experiments reported by showed the reliability of CSA to be low. Considering the theoretical strength of CSA, and unsuccessful earlier attempts to create a more reliable parallel form of it , a revised version was made to improve its validity and reliability.
Notes
References
.
.
.
.
Cognition |
```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
``` |
Evgeny Mozer (; born May 18, 1993) is a Russian professional ice hockey forward. He is currently an unrestricted free agent who most recently played for Avtomobilist Yekaterinburg in the Kontinental Hockey League (KHL).
Mozer made his KHL debut playing with Avangard Omsk during the 2012–13 KHL season. He played a season on loan in the Czech Extraliga with HC Dynamo Pardubice before returning to the KHL.
References
External links
1993 births
Living people
Avangard Omsk players
Avtomobilist Yekaterinburg players
HC Dynamo Moscow players
Omskie Yastreby players
HC Dynamo Pardubice players
Russian ice hockey forwards
Sportspeople from Omsk
Torpedo Nizhny Novgorod players
Yermak Angarsk players
Russian expatriate sportspeople in the Czech Republic
HC Neftekhimik Nizhnekamsk players
Russian expatriate ice hockey people
Expatriate ice hockey players in the Czech Republic |
Gino Infantino (born 19 May 2003) is an Argentine professional footballer who plays as a right midfielder or attacking midfielder for Serie A club Fiorentina.
Club career
Infantino spent his early years with Villa del Parque. He soon moved to Renato Cesarini, remaining for six years; a period that saw him have a trial with Real Madrid. Aged eleven, Infantino joined ADIUR. After four years, which included a trial with Villarreal, the attacking midfielder headed to Rosario Central in 2018. He made his first-team breakthrough in mid-2020, initially featuring in the club's pre-season campaign under manager Kily González. Infantino was then an unused substitute for Copa de la Liga Profesional matches with Godoy Cruz and River Plate, prior to making his senior debut on 13 November against Banfield.
International career
Infantino represented Argentina at various youth levels. In August 2017, he was selected to train with the U15s. January 2019 saw a call-up for the U16s.
Personal life
Born in Argentina, Infantino is of Italian descent.
Career statistics
.
Notes
References
External links
2003 births
Living people
Footballers from Rosario, Santa Fe
Argentine sportspeople of Italian descent
Argentine men's footballers
Men's association football midfielders
Argentine Primera División players
Serie A players
Rosario Central footballers
ACF Fiorentina players
Argentina men's youth international footballers
Argentine expatriate men's footballers
Expatriate men's footballers in Italy |
Bertens is a surname. Notable people with the surname include:
Christel Bertens (born 1983), Dutch bobsledder and track and field athlete
Huub Bertens (born 1960), Dutch bridge player
Kiki Bertens (born 1991), Dutch tennis player
See also
Bertāns
Mertens |
Enoch Olusesan Showunmi (born 21 April 1982) is a former professional footballer who played as a striker. Born in England, he played for Nigeria at international level and won two caps for the team.
Career
Luton Town
Showunmi joined Luton Town in early September 2003 following a successful trial spell with the club that saw him feature regularly during the 2003–04 pre-season against such teams as AFC Wimbledon. At the time of his signature Luton had a small squad due to the administrative receivership that they were under, which prevented them signing new players. Regular midfielder and captain Kevin Nicholls received an injury that was to prevent him playing for three months, and Luton were able to use this injury to seek dispensation from the Football League to sign Showunmi.
Showunmi's debut came against Plymouth Argyle in September 2003, and his first goal arrived in a Football League Trophy win against Rushden & Diamonds in November. Late in the season he scored a hat-trick in a home match against Brentford. In total he scored seven goals in 28 appearances during the 2003–04 season, which culminated with his international debut for the Nigerian national football team as a 71st-minute substitute in a 3–0 victory against the Republic of Ireland at The Valley on 30 May 2004.
He was also a substitute in Nigeria's following 2–0 victory against Jamaica.
Luton's promotion season in 2004–05 saw Showunmi regularly used as a "super-sub" to score six goals in 38 matches, only seven of which he started, including a late winner against AFC Bournemouth after Luton had played most of the game with only 10 men.
In 2005–06 Showunmi often played in midfield, with moderate success, due to injuries to many midfield players at the club.
Bristol City
Before the 2006–07 season, Showunmi moved to Bristol City on a Bosman transfer. He had a good start to the season, scoring in three consecutive games. However, he featured sporadically for the rest of the season due to injuries and good form from other City strikers. Despite not being a first team regular he finished the season as Bristol City's second top scorer, behind Phil Jevons, with 13 goals in all competitions.
Showunmi faced strong competition for his first team place at the start of the 2007–08 season, especially after fellow strikers Lee Trundle and Darren Byfield signed for the club, and Steve Brooker also being in contention after returning to fitness. On 23 January 2008 he started discussing personal terms with League One team Leeds United, after Leeds and Bristol City agreed terms for a permanent deal to take Showunmi to Elland Road. However, Showunmi snubbed a move to the Yorkshire club and stayed at Ashton Gate to fight for his place in the team.
However, on 31 January, he completed a move to Championship side Sheffield Wednesday on an emergency loan until 1 March. This was later extended for another month, but at the start of April Showunmi decided to return to Ashton Gate in order to aid with the club's promotion push.
On 8 April the FA announced that it had charged Showunmi with "engaging the services of an individual, who was not a licensed agent or entitled to act in such a capacity, to represent him in contract negotiations with Luton Town in or around February 2004 and between November 2005 and January 2006", an allegation which involved both Bristol City and Charles Collymore. The FA subsequently fined Showunmi £2,000 and Bristol City £15,000, whilst the allegations against Collymore were found not to have been proved.
He was released by City at the end of the 2007–08 season along with fellow striker Darren Byfield, midfielder Alex Russell and defenders Martin Slocombe and Tamás Vaskó.
Leeds United
Showunmi then signed for Leeds United. He scored on his debut for the club in a league match against Scunthorpe United. After this successful start to his Leeds career most of his goals for the season came in cup games, scoring twice in the League Cup against Crystal Palace and Hartlepool and once in the Football League Trophy against Rotherham United. His second and final league goal for the club came in a 2–1 defeat at Tranmere Rovers on 6 December 2008. Showunmi's last appearance of the season came after featuring as a substitute in a 3–1 defeat to MK Dons the day before manager Gary McAllister's departure. Showunmi did not feature in any more games that season after suffering a serious blood clot in his lung. Leeds managed to reach the playoff semi-finals in Showunmi's absence.
After recovering from injury, the following season Showunmi fell out of favour under new manager Simon Grayson. It wasn't until the start of the 2009/10 season that Showunmi played for Leeds again. Despite being used sparingly he managed to score his sixth and final goal for the club in a League Cup tie with Darlington. He was later released, having scored 5 goals in 7 starts for the Yorkshire side.
Falkirk
On 14 January 2010 Scottish Premier League team Falkirk signed Showunmi. He made his debut against Celtic. He scored his first goal in 18 matches with an acrobatic volley against Aberdeen on 20 February 2010. It helped Falkirk win the match 3–1. He was released at the end of the season after Falkirk's relegation.
Tranmere Rovers
On 27 July 2010 he signed for Tranmere Rovers. He scored his first goal for Tranmere on 24 August 2010 against Swansea City in the League Cup with a neat finish from a tight angle. He then scored his second goal for the club, his first for them in the Football League, four days later in 2–2 draw against Dagenham & Redbridge. At the end of his first season, Enoch received the Player of The Season Award, after finishing as the club's top scorer with 13 goals. In the summer of 2011, Showunmi was subject to 3 bids made by Notts County – £75k, £100k and £125k, all of which were rejected.
He was released at the end of the 2011–12 season.
Notts County
Showunmi signed with Notts County on 12 June 2012 on a free transfer, scoring his first goal in a 2–1 away victory over Scunthorpe United on 4 September 2012 in the first round of the Football League Trophy. He scored his first league goal for the club on 22 January 2013. Showunmi left the club at the end of the 2013–14 season when his contract expired.
Torquay United (loan)
On 28 February 2014, Showunmi joined League Two side Torquay United on a one-month loan.
Plymouth Argyle (loan)
On 27 March 2014, Showunmi joined League Two side Plymouth Argyle on loan for the remainder of the 2013–14 season.
Wealdstone
On 26 September 2014, Showunmi signed for Conference South side Wealdstone. Showunmni then joined Canvey Island on loan on 1 December 2014 in order to get more game time.
In late 2016, Showunmi announced his retirement from football on his official Facebook profile.
International career
Showunmi has played twice for Nigeria, with both appearances coming in 2004.
Honours
Club
Luton Town
Football League One Champions: 2004–05
Bristol City
Football League One Runners up: 2006–07
International
Nigeria
Unity Cup
References
External links
1982 births
Living people
Footballers from Kilburn, London
Citizens of Nigeria through descent
Black British sportsmen
English sportspeople of Nigerian descent
English people of Yoruba descent
English men's footballers
Nigerian men's footballers
Yoruba sportspeople
Nigeria men's international footballers
Men's association football forwards
Luton Town F.C. players
Bristol City F.C. players
Sheffield Wednesday F.C. players
Leeds United F.C. players
Falkirk F.C. players
Tranmere Rovers F.C. players
Notts County F.C. players
Torquay United F.C. players
Plymouth Argyle F.C. players
Wealdstone F.C. players
Canvey Island F.C. players
Chalfont St Peter A.F.C. players
English Football League players
National League (English football) players
Isthmian League players
Southern Football League players
Alumni of London South Bank University |
中西區 may refer to:
Central and Western District (), district in Hong Kong
West Central District (), district in Tainan City |
Ninja Theory Limited is a first-party British video game development studio based in Cambridge, England. Notable games it has developed include Kung Fu Chaos, Heavenly Sword, Enslaved: Odyssey to the West, DmC: Devil May Cry and Hellblade: Senua's Sacrifice.
Founded by Tameem Antoniades, Nina Kristensen and Mike Ball in March 2000, the company operated under the name Just Add Monsters. It was acquired by Argonaut Games soon after its founding and released Kung Fu Chaos for the original Xbox console. The company purchased itself from administrators after Argonaut Games was liquidated but suffered from financial troubles. Sony Computer Entertainment saved the team from bankruptcy by funding the development of Heavenly Sword, which was an expensive project. The game's poor sales resulted in Ninja Theory losing all their in-house technologies because of contractual agreements with Sony. The team then moved on to develop Enslaved: Odyssey to the West, an underperforming project in collaboration with writer Alex Garland, and DmC: Devil May Cry, a well-received title whose design was highly controversial, resulting in the team receiving death threats.
The team began diversifying its portfolio of games and taking on contract work for publishers after finishing the development of DmC. It also entrusted a small team to develop their first self-published title, Hellblade: Senua's Sacrifice. The team developed a business model they called "Independent AAA", where the game would have a small budget while retaining high production values. Exploring the theme of psychosis, the game was a commercial and critical success. In June 2018, it was officially announced that Ninja Theory had entered into an agreement to be acquired by Microsoft and became part of Microsoft Studios (now known as Xbox Game Studios). Several new projects, including virtual reality games, are under development.
History
Just Add Monsters (2000–2004)
Tameem Antoniades, Nina Kristensen and Mike Ball founded Just Add Monsters in March 2000 in Cambridge, England, with . At the time, the company had three staff but no money, equipment, or technology. Antoniades had ideas for a kung fu game and brainstormed them for a hack and slash multiplayer game called Kung Fu Chaos in his bedroom. As the team settled on the idea, they began actively looking for investment from major video game publishers, but none of them showed any interest in funding the game. Instead, they offered to buy the small company. As the team began to run out of money, they agreed to be acquired by Argonaut Games in September 2000.
With Argonaut's support and funding, the team was able to move into a proper office, hire 17 more staff and buy the technologies needed to make a video game. The development team assembled a gameplay demo of Kung Fu Chaos and presented it to Microsoft Games Studios. They were willing to provide funding for the game's development in order to have a strong line-up for their then-upcoming console, the Xbox. The publishing team at Microsoft was described as "helpful", assisting the team in refining the game during its production. Yet Microsoft failed to market the game properly. For example, no advertisements were prepared for the launch. While the game was critically praised, Kung Fu Chaos sales were hugely disappointing, and the game was a financial failure for the firm. At the time, Antoniades was disappointed and shocked that Microsoft would "send [the game] out to die," but understood Microsoft's decision to put their resources into other more profitable projects.
Before the release of Kung Fu Chaos, the team were already actively developing a sequel titled Kung Fu Chaos 2. The team used feedback from Kung Fu Chaos players to make the sequel a more mature game. While the team expected the publishing relationship with Microsoft would continue, they declined to fund the sequel since the first game was not warmly welcomed by its audience. As Microsoft retained the intellectual property (IP) rights to Kung Fu Chaos, and the team did not have sufficient resources to start from scratch, and could not use the Xbox code they had programmed, the company ceased development of Kung Fu Chaos 2. Instead, they began working on a new IP, Kung Fu Story, which was also themed around kung fu and Chinese martial arts.
While developing Kung Fu Story, the team closely monitored the games market and realised that both the audience and publishers wanted games based on realism with high production values rather than those that have highly stylised visuals. Recognizing that Kung Fu Story would not fare well with the audience, the team decided to greatly expand the game's scope to satisfy players' demands. The team renamed the game Heavenly Sword, and assembled a demo using personal computers in an effort to guess the possible capabilities of the unannounced seventh generation of video game consoles. Publishers were interested in funding the game, but they were reluctant to do so due to Argonaut's financial troubles, of which the team at Just Add Monsters was unaware. In October 2004, Argonaut entered administration. The team remortgaged their apartments and Argonaut's CEO, Jez San provided investment to help the team to buy Just Add Monsters from the administrators. In November 2004, the team reestablished themselves as Ninja Theory, and the development of Heavenly Sword continued. Kristensen became the head of development, Antoniades led the design department, while Ball became the leader of the technology team. San joined as a member of the firm's board of directors.
Heavenly Sword, Enslaved and DmC (2004–2013)
After the company was reestablished, it had very limited capital and could only sustain its operations for three months. At the time, the company employed more than 50 people. The team continued to present Heavenly Sword to various publishers, but their responses were unenthusiastic. Publishers questioned the team's ability to make a technology-intensive game because of their relatively small size. With few options remaining, the team signed a deal with Sony Computer Entertainment in May 2005. This saved the company from bankruptcy at the cost of IP and technology rights. The title would now become a PlayStation 3 exclusive. According to Antoniades, negotiating the deal with Sony was "soul-destroyingly difficult".
Fueled by the ambition to be "a top studio in the world", Ninja Theory had lofty goals for Heavenly Sword. With an estimated budget of $10 million to $20 million, Ninja Theory had a plan to develop the title into a multimedia franchise, ranging from a PlayStation Portable version to a film based on the game's story. The team also invested a lot in performance capture, working with Weta Digital and Andy Serkis, who became the title's "dramatic director". The company employed more than 100 people to work on the game, which took four-and-a-half years to develop. Sony actively interfered with the game's development, diminishing the team's creative freedom. It pressured them to produce a game that "fit in more with what a standard action-adventure video game should be". Many features were removed from the game during the final production stages to meet project deadlines. The game received generally positive reviews from critics when it was released in September 2007, and subsequently gained a cult following. However, sales did not meet expectations, and the title did not break even.
Ninja Theory then began working on a sequel, but they had employed so many people to work on the title it did not fit with the "cost-analysis model of AAA production". Once the team engaged in the development of the sequel, it would become their only project; the company could not seek other opportunities. Not wanting to dissolve the entire team to work on the sequel, Ninja Theory decided to leave Heavenly Sword and all the technologies built for it to Sony and seek external funding from another publisher for their next project. According to Antoniades, it was a "heart-breaking moment".
While researching Heavenly Swords wuxia theme Antoniades read Journey to the West, which inspired the company's next game, Enslaved: Odyssey to the West. However, the team wanted to try something new, thus many of the fantasy and wuxia elements were shifted to sci-fi. Without their own technology, the team used Epic Games' Unreal Engine. Because Heavenly Sword had been unprofitable, Ninja Theory needed to present the new game to publishers as fast as possible since they did not have much reserve cash. Initially, they signed a deal with Green Screen, which dissolved a month later. Namco Bandai Games agreed to publish the game. Using only two-thirds of the budget of Heavenly Sword, the team hired Alex Garland to write the game's story. Antoniades found Garland "intimidating" to work with, though Garland found the team "friendly". Garland often argued with Antoniades over the inclusion of boss fights, and became involved with the game's design. Andy Serkis returned to do motion capture, and Nitin Sawhney, composer for Heavenly Sword, returned to write Enslaveds music.
Enslaved was positively reviewed by critics when it was released in October 2010. However, like previous Ninja Theory projects, the market responded unenthusiastically, and it was a commercial failure. While Ninja Theory developed a piece of single-player downloadable content (DLC), titled Pigsy's Perfect 10, the multiplayer DLC that was in development was cancelled after the lukewarm reception.
Immediately after the completion of Enslaved: Odyssey to the West, publisher Capcom chose Ninja Theory to develop the next entry in the Devil May Cry series, as it was impressed by the company's past work, especially on Heavenly Sword. Capcom intentionally selected a western developer so that they could "add western flair to a traditionally Japanese-styled game", and granted the company plenty of creative freedom. Hideaki Itsuno supervised the entire project. The team came up with a new design for series' protagonist Dante, which generated backlash and some criticism. Some fans sent Ninja Theory death threats, of which some were sent in the form of comics and death metal songs. Antoniades responded to fan displeasure over the redesign by saying that "The essence of Devil May Cry is all about 'cool'" and that the design from the PS2 era "isn't cool anymore." Despite being a controversial project, DmC: Devil May Cry received critical acclaim when it was released in January 2013. It was a commercial success for Ninja Theory. The title reached the top of the United Kingdom, United States, European and Japanese retail software sales charts. For the first time, the team received royalties from a project. Heavenly Sword, Enslaved: Odyssey to the West and DmC: Devil May Cry collectively sold approximately 4.5 million units.
Independent AAA (2013–2018)
With the introduction of the eighth generation of video game consoles, Ninja Theory predicted there would be a rise in development costs, and publishers would become even more conservative when funding projects. As a result, the team decided to diversify its portfolio of games and split into smaller teams, working on various projects. The company collaborated with Chillingo to release a free-to-play mobile game named Fightback. According to Antoniades, Fightback was a learning experience for the studio as they explored the "games as a service" models, mobile technology, touch screen controls and realised the competitive nature of the mobile games market.
The company began experimenting with smaller titles, unsuccessfully pitching them to publishers. They pitched a horror game to Garland. Publishers asked for the addition of melee combat and then informed the team that neither horror nor melee combat was popular in the games market. Ninja Theory and Garland pitched another four-player cooperative gameplay experience set in the real world featuring real characters, but publishers insisted that sci-fi or fantasy elements be added to it so the game would sell. The company also experimented with a multiplayer-based melee-combat game. Publishers were reluctant to fund it as the project did not have a single-player component, the team was inexperienced and an action melee game was unlikely to be profitable.
In early 2013, the company tried to develop a game that suited publishers' requirements, while also remaining creative. The project, known as Razor, is a multiplayer game that mixes gunplay and melee combat. It features an extensive story and a boss that would have thousands of players fighting for months. It also has mobile control integration and missions that are procedurally generated. Publishers were initially keen on signing the project, but a game of a similar nature, Destiny from Bungie was announced, and most publishers opted not to compete with it directly. The team then partnered with a publisher to develop a project based on the Razor assets, but both sides terminated their agreement as the publisher interfered with Ninja Theory's creative freedom. The company partnered with Disney Interactive from 2014 to 2015, providing additional development and combat elements for Disney Infinity: Marvel Super Heroes and Disney Infinity 3.0. This helped sustain the company's operations.
The failure of Razor, and questions from Garland about why the gaming development scene did not have many independent projects similar to the independent film industry prompted the team to begin to evaluate the idea of "independent AAA", where the team would own the intellectual property and publish the game themselves without mainstream game publishers. The game would still have high production values but would be sold at a lower price. The team firmly believed that there was "a middle ground between the low budget pure indie development and AAA [projects]". The team opted not to use Kickstarter having decided to fund it themselves. This led to the creation of Hellblade: Senua's Sacrifice, which had a team of only 15 people working on it. Since the game had a small budget, the studio did not promote the game heavily with advertisements instead creating numerous developer diaries for players who were interested in it. The team collaborated with several technology companies like 3Lateral, Cubic Motion and Xsens to help with motion capture, which allowed the actors to preview their performance while acting. In September 2016, Ninja Theory announced their Senua Studio division, which would work on real-time virtual character technology. As the game explored mental illness and psychosis, the company consulted professional neuroscientists and obtained financial backing from the Wellcome Trust. After a three-year development cycle Hellblade was a critical success when it launched in August 2017, with praise for its depiction of mental illnesses. The game was also a commercial success, becoming profitable within three months of its release, generating more than $13 million with sales of more than 500,000 units. The game was nominated for nine awards and won five at the 14th British Academy Games Awards. Antoniades considered the critical acclaim validation that the independent AAA business model worked.
The company has several titles in development, both traditional and virtual reality projects. As for the future, Antoniades shared: "We've got other projects on the go, led by different team members who have their own personal slant on what they want to do, and they're not serious subjects, they are much more fun, traditional games if you like."
Acquisition by Microsoft (2018–present)
On 10 June 2018, during E3 2018, Microsoft announced that they had entered into an agreement to acquire Ninja Theory alongside three other studios as part of Microsoft Studios. Studio creative director Tameem Antoniades said that they opted for the acquisition as "We want to be free from the AAA machine and make games focused on the experience, not around monetization", and would allow them to continue building smaller, risky games with creative independence. For Microsoft, Ninja Theory was seen as a studio that would produce good content that fits with the Xbox Game Pass subscription service, according to head of Microsoft Studios Matt Booty.
In October 2019, Ninja Theory announced the establishment of a research and development effort dealing with mental health, dubbed The Insight Project. The Insight Project builds upon and continues the co-operation between Ninja Theory and Paul Fletcher, a University of Cambridge psychiatrist and professor of health neuroscience who had consulted the studio on Hellblade. With The Insight Project, Ninja Theory plans to build smaller games to "help people identify and control negative emotions". At The Game Awards 2019, Ninja Theory announced Senua's Saga: Hellblade II for Xbox Series X.
The studio teased a new experimental game, Project: Mara in January 2020. Antoniades said that Project: Mara "will be a real-world and grounded representation of true mental terror" and "will be based heavily on research, interviews, and firsthand accounts to recreate the horrors of the mind as accurately and believably as possible."
Games developed
Notes
References
External links
2000 establishments in England
2018 mergers and acquisitions
British companies established in 2000
British subsidiaries of foreign companies
Companies based in Cambridge
First-party video game developers
Microsoft subsidiaries
Video game companies established in 2000
Video game companies of the United Kingdom
Video game development companies
Xbox Game Studios |
Velagadurru, is a village in West Godavari district of Andhra Pradesh, India.
References
External links
Velagadurru
Villages in West Godavari district |
The 1900 New Mexico A&M Aggies football team was an American football team that represented New Mexico College of Agriculture and Mechanical Arts (now known as New Mexico State University) as an independent during the 1900 college football season. In their first and only year under head coach William A. Sutherland, the Aggies compiled a 3–3–1 record and outscored opponents by a total of 49 to 27.
Schedule
References
New Mexico AandM
New Mexico State Aggies football seasons
New Mexico AandM Aggies football |
Marco Cappai (born 13 November 1993 in Carbonia, Sardinia), known by his stage name Madh, meaning "my advice doesn't help", is an Italian singer, rapper and songwriter. He rose to fame in 2014, at the eighth season of the Italian edition of X Factor. His debut single, "Sayonara", was performed for the first time during the semi-finals of the competition. Also included in the extended play with the same name, the single reached the second spot of the Italian Singles Chart, and it was certified platinum by the Federation of the Italian Music Industry. In 2018 he deleted all of his content on Instagram and went on hiatus.
Early life
Marco Cappai was born on 13 November 1993 in Carbonia, a comune in the former province of Carbonia-Iglesias (now province of South Sardinia), in Sardinia, Italy, where he also spent childhood.
Music career
2011–2014
In 2011, Madh began creating songs with his brother. In 2012, he met some music publishers and record producers, and decided to found an independent label, the SEMS Music. He started self-producing video clips and uploading them on YouTube and on other various platforms. At the start of his musical career, he performed in clubs, bars and disco clubs in Sardinia. He won the first prize of a traditional Sardinian contest "Corrida Sulcis".
2014: The X Factor
In June 2014 in Rome, Madh auditioned as a solo candidate for the eighth season of the Italian edition of The X Factor. In front of Italian judges Fedez, Mika, Morgan and Victoria Cabello, he performed the alternative song version Mad World of Gary Jules; in "bootcamp", he performed Enjoy the silence (Depeche Mode). In July 2014 in Milan, at "homevisit" with the song Exodus (MIA), he qualifying for the "Men Under 24" category, captained by Fedez. From 23 October 2014 to 11 December 2014, during the "live show" in Milan, Madh performed: Take Care (Drake), No Church in the Wild (Jay Z, Kanye West ft. Frank Ocean), Dancing on My Own (Robyn), Same Love (Macklemore & Ryan Lewis ft. Mary Lambert), Disparate Youth (Santigold), Ready or Not (Fugees), Lights (Ellie Goulding), Flyover (Asian Dub Foundation), Heartbeat (Nneka).
Musical style and influences
His passion and love for music have been influenced by the Eastern culture and philosophy. Five of the most important songs of his life are: "Love Is A Losing Game" and "You Know I'm No Good" (Amy Winehouse), "Redemption Song" (Bob Marley), "Ready Or Not" (Fugees), Exodus (MIA).
Discography
Studio albums
EPs
Singles
Album appearances
Music videos
References
External links
Madh at Allmusic
1993 births
Italian rappers
Living people
X Factor (Italian TV series) contestants
People from the Province of South Sardinia
English-language singers from Italy
21st-century Italian male singers |
Garden ~Summer Edit~ is FLOW's eighth single. It is a recut single from the original B-Side in their album Golden Coast. It reached #50 on the Oricon charts in its first week and charted for 2 weeks. *
Track listing
References
Flow (band) songs
2005 singles
Ki/oon Music singles
2005 songs
Song articles with missing songwriters |
```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);
}
}
``` |
Camp Liberty is a former United States military installation in Baghdad, Iraq. The installation was used from 2012 to September 2016 to house members of the People's Mujahedin of Iran (PMOI, also called MEK), who had been forcibly evicted from Camp Ashraf.
History
U.S. Army base
Camp Liberty first came into existence during the 2003 U.S. invasion of Iraq as Camp Victory North, and was renamed (its Arabic translation is "Mukhayam Al-Nasr") in mid-September 2004 to its later name of Camp Liberty (in Arabic "Mukhayam Al Hurriya"). Other camps that made up the Victory Base Complex include Camp Victory (formerly known as Camp Victory South), Camp Striker, Logistics Base Seitz, and Camp Slayer. The renaming was part of an effort to give U.S. facilities around Baghdad friendlier connotations, and an attempt to resolve the issue of constantly changing facility names.
During the Iraq War, following the American invasion, the base was a large Coalition military installation located northeast of the Baghdad International Airport (BIAP), becoming part of the U.S. military's Victory Base Complex (VBC). Camp Liberty was twice the size of Camp Bondsteel in Kosovo, and one of the largest U.S. overseas posts built since the Vietnam War.
Camp Liberty killings
On 11 May 2009, an American soldier, U.S. Army Sergeant John M. Russell, opened fire on his fellow service members within the camp at a counseling clinic center, killing five before being subdued and taken into custody.
Forcible eviction of PMOI residents from Camp Ashraf to Camp Liberty
Under strong pressure by the Iraqi government, whose declared will is to expel the People's Mujahedin of Iran (PMOI/MEK) from Iraq, but who was aided as well by the United Nations Assistance Mission for Iraq (UNAMI) under the pretext to preserve their security, nearly all of the 3,400 MEK residents of Camp Ashraf were forcibly moved to Camp Liberty in 2012. This helped partly to convince the United States removing the MEK from its list of designated terrorist groups. 166 of the MEK members are wanted for committing acts of terrorism inside Iran and the Iranian government is seeking their extradition.
The Working Group on Arbitrary Detention of the UN Human Rights Council has categorized, in his Opinion of May 2012, the status of the MEK residents in Camp Liberty/Camp Hurriya as Arbitrary detention and called the Iraqi government for the "immediate release and lifting of all restraints upon the free movements of these persons". It reiterated and extended this vote in his Opinion of August 2012, additionally considering it "appropriate to refer the allegations concerning conditions in Camp Ashraf and Camp Liberty to the relevant human rights mechanisms for appropriate action".
2013 rocket attacks
A rocket and mortar attack left at least eight dead and nearly 100 wounded occurred at Camp Hurriya on 9 February 2013. Iranian residents of Camp Liberty and their representatives and lawyers appealed to the UN Secretary-General and U.S. officials to let them return to Ashraf, which they say is 80 times larger than Liberty and has concrete buildings and shelters that offer more protection. They argue that this move is all the more imperative because according to the UN Refugee Agency and the US embassy in Baghdad, resettlement will take anywhere from three to 10 years. So, the residents would be at risk of further attacks and the move to Ashraf would not hinder their resettlement. The United States has been working with the UN High Commissioner for Refugees (UNHCR) on the resettlement project.
On 20 April 2013, 20 explosions hit Camp Liberty/Camp Hurriya. Its residents accuse the Iraqi government of failing to offer adequate protection or medical care.
A deadly rocket attack occurred on 26 December 2013, killing four Iranian dissidents and wounding about seventy. This was the last of a total of four rocket attacks to Camp Liberty in 2013. The destructive power of 26 December attack was particularly high, as in addition to previously used rockets, missiles hit the camp with had about 10 times explosive power. Iraqi authorities have repeatedly denied involvement in attacks on the group. However, in a rare claim of responsibility for attacks on the MEK, Wathiq al-Batat, commander of the al-Mukhtar Army militia, admitted his group had fired rockets at the camp. This army is a relatively new Shi'ite militia, which has said it is supported and funded by Iran. Batat is a former leader of the more well-known Kata'ib Hezbollah militia.
The UNHCR called on the government of Iraq to urgently scale up security measures in the camp to ensure the safety and security of its residents. UNHCR urgently reiterated the need to find solutions for the camp's residents, and appealed to countries to find places for 1,400 persons from Camp Liberty that had been submitted for relocation since 2011, stating that only 311 residents were secured to third countries so far.
October 2015 attack
The National Council of Resistance of Iran informed and warned on activities in Iraq by Iranian Quds Force, led by Qasem Soleimani, aimed to massacre Camp Liberty residents via a joint operation with Iraqi forces. In August 2014, the Iraqi government started to block food, fuel and water supplies. Former UNAMI chief Ad Melkert, who, in fall 2009, had strived to find a mediated solution for residents to remain protected in their original home city Camp Ashraf, appealed to UNAMI to hold the Iraqi government accountable for creating the descent conditions in Liberty and for blockading the delivery of daily life essentials. In October 2014, the Committee on Political Affairs and Democracy of the Parliamentary Assembly of the Council of Europe reiterated its concern over the situation, namely over a recent statement of the Iraqi Minister of Justice, in which he said that if Iran asked for the extradition of the residents of Camp Liberty, Iraq would deliver them.
In December 2014, UNHCR informed that it has been working since February 2012 to identify "individuals with international protection needs" and to find solutions outside Iraq for the remaining population of still 2,746 individuals.
On 30 January 2015, 100 Members of the Parliamentary Assembly of the Council of Europe in a written declaration urged Europe, USA, and UN that "Camp Liberty, home to Iranian exiles in Iraq, be recognized as refugee camp under supervision of UNHCR and specially medical and fuel siege be ended."
On the evening of 29 October 2015, another heavy rocket attack killed more than 20 residents in the camp. As with regard to many past attacks to Camp Liberty and Camp Ashraf, evidence points to Iran paramilitary forces being the perpetrators. UNHCR strongly condemned the attacks and stated that the residents are entitled to protection against expulsion or forced movement to any place where their lives or freedom would be threatened, and informed that it has supported the relocation of more than 900 residents to safe third countries since 2011; as however, approximately 2,160 people still remain, UNHCR renewed its calls upon governments of other countries to find ways to offer long-term solutions. The European Iraqi Freedom Association (EIFA), led by Struan Stevenson, Chairman of the European Parliament's Delegation for Relations with Iraq from 2009 to 2014, who was deeply involved in diplomacy aiming to safeguard the lives and human rights of the residents of Camp Ashraf, stated that to avoid further bloodshed just condemning the atrocity is not enough. EIFA urged the US to provide air cover for Camp Liberty, the UN to "stop any further obfuscation and officially recognise Camp Liberty as a refugee camp under its direct supervision and protection" and asked that the "international assistance to Iraq must be suspended forthwith until the security of the Camp Liberty residents is assured".
Relocation to Albania
UNHCR announced that, by the end of 2015, it has relocated more than one third of the residents, about 1100 persons, to third countries, affirming that this has been achieved with the cooperation and flexibility of the residents, in particular their commitment to meeting the bulk of the travel costs and living expenses; it also mentioned Albania's exceptional contribution who has received more than three-quarters of the relocated residents, and however renewed its appeal for help to all countries in light of the potential for more attacks to the still remaining 1970 persons. As a result of the efforts made by the National Council of Resistance of Iran in conjunction with an international political network, and the UNHCR, the relocation process was successfully concluded in September 2016 when the last remaining refugees left the camp for Albania.
Bibliography
See also
Iraq War order of battle 2009 for United States military in Iraq
Victory Fuel Point fuel thefts
Camp Ashraf
2013 Camp Ashraf massacre
List of United States Military installations in Iraq
References
External links
Latest News Coverage on Camps Ashraf and Liberty (National Council of Resistance of Iran)
Liberty
Installations used by the People's Mojahedin Organization of Iran
Refugee camps in Iraq |
Antoni Scholtens Folkers (born 1960) is a Dutch architect, urbanist and researcher. Folkers studied at the Faculty of Architecture and Urban Planning at Delft University of Technology where he also received his Ph.D. in 2011. His doctoral dissertation was later published as the book Modern Architecture in Africa. Folkers is one of the founding partners of the research and educational platforms ArchiAfrika and African Architecture Matters.
Life and career
Antoni Folkers was born on 5 June 1960 in Delft, Netherlands. He commenced his education in Art and Art History at John Carroll University, Cleveland United States and Utrecht University in 1979. Folkers went on to study architecture and urban planning at TU Delft. During his years at the university, Folkers worked as a trainee at the office of the German architect Georg Lippsmeier – founder and owner of the L+P architects and the Institute for Tropical Building. An important turning-point in his early career as an architect and urban planner was his traineeship during the years 1984–1985 at the Direction Générale de l’Urbanisme et de la Topographie in Ouagadougou, Burkina Faso where he participated, among others, in the Wagadogo-Nossin District redevelopment and re-settlement project under the guidance of the Dutch urban planner Coen Beeker.
After graduating from TU Delft, Folkers went on to work at the L+P architects' office in 1987 in Dar es Salaam, a city which also became his base for the next 25 years. In 1991 Folkers started an architectural partnership with Belinda van Buiten named as FBW after the British structural engineer Geoff Wilks joined the partnership in 1993. The company was divided in 2000 into FBW Group with its HQ in Uganda and Manchester and FBW Architects in the Netherlands. In years 1994 to 2014 Folkers collaborated closely with a project team including Belinda van Buiten, Thierry van Baggem and Saskia van Haren. Folkers continues to work in the Netherlands together with van Buiten as FBW Architects and as an independent architect and consultant in Africa.
Architecture and urban planning
Folkers’ work in the Netherlands focuses primarily on projects of socio-cultural nature and health care. Notable projects realized in the Netherlands are visitor centres in nature reserves, temporary shelter for homeless people Omnizorg in Apeldoorn and the restoration of Jongerius Villa in Utrecht. In Africa, Folkers’ works on projects primarily in Tanzania, Uganda, and Zanzibar. Notable architectural and urban projects are the Msasani Slipway complex in Dar es Salaam, Michenzani Green Corridors Plan and Mtoni Palace conservation project in Zanzibar.
ArchiAfrika and African Architecture Matters
In 2001 Folkers founded together with Berend van der Lans, Belinda van Buiten, Janneke Bierman and Joep Mol the NGO ArchiAfrika. The underlying aim of the NGO was to give Africa a more prominent place in the debate surrounding architecture. Early activities of the organization focused in particular on research concerning modern architecture in Africa.Together with ArchiAfrika, he initiated a series of conferences in years 2005-2009 known under the common name African Perspectives. Other notable ArchiAfrika projects are the documentary featuring the Tanzanian architect Anthony Almeida Many Words for Modern: Survey of Modern Architecture in Tanzania and Stars of Dar. After a decade of activity, the organization was handed over to a new Africa based team under the chairmanship of Joe Addo and has henceforth continued its operations from Ghana. In 2010 Folkers and van der Lans established the NGO African Architecture Matters (AAM).
Research
Folkers’ reflections on architecture and building in Africa were presented in the publication Modern Architecture in Africa. The book gives an account of Folkers' personal experience from work on the continent as an architect and urban planner and provides an outline, analysis, and comparison of a number of projects which are sat in the broader context of the history of African architecture.
In years 2006-2010 Folkers was involved in a research and conservation project on the Mtoni Palace located on the western coast of the Unguja Island (Zanzibar) which resulted in the publication Mtoni. Palace, Sultan & Princes of Zanzibar. His research on Zanzibar has also been concerned with the architecture and urban planning of Karume's Revolutionary Government. More recently, through the projects of AAM, he has also been involved in research on the urban history of Zanzibar Town.
Notable projects
Masterplanning and urban planning
Msasani Slipway, Dar es Salaam, Tanzania - redevelopment of the shipyard into a multiuse complex, encompassing retail, a hotel, restaurants, cafés, offices and studios, a mooring site and jetty (FBW Architects. Project architect: Antoni Folkers). 1989-ongoing .
Ng’ambo Local Area Plan, Zanzibar Town, Zanzibar - Cooperation on the proposed urban development scheme for the Department of Urban and Rural Planning of the Government of Zanzibar, the City of Amsterdam and African Architecture Matters, commissioned by Rijksdienst voor Ondernemend Nederland (African Architecture Matters. Team leader, senior adviser and researcher: Antoni Folkers). 2013–2016.
Butiama District Capital Structure Plan and Masterplan for the Julius Nyerere University for Science and Technology (FBW Architects. Project architect: Antoni Folkers). 2012–2015.
Restoration
Jongerius Villa and Factory Complex, Utrecht, the Netherlands – restoration and adaptive re-use of the rundown factory complex in Utrecht including a villa, garden and an office (FBW Architects. Project architect: Antoni Folkers, restoration design: Belinda van Buiten, project team: Antoni Folkers, Belinda van Buiten, Saskia van Haren, Thierry van Baggem). 2007–2012.
Rock-hewn Churches Lalibela, Ethiopia. Design of a protective shelter. International competition.not executed (FBW Architects. Design: van Buiten and Folkers. Engineering: ABT engineers Arnhem). 1999.
St Joseph’ Cathedral, Dar es Salaam, Tanzania (L+P architects Dar es Salaam. Project architect: Antoni Folkers, design work: Belinda van Buiten). 1987–1991.
Health and education
Centre Omnicare (Omnizorg), Apeldoorn, the Netherlands (FBW Architects. Project architect: Antoni Folkers, interior design: Belinda van Buiten). 2003–2008.
Child Welfare Council offices, Almelo, the Netherlands (FBW Architects. Project architect: Antoni Folkers). 1999.
The Phoenix, Park Bloeyendael, Utrecht, the Netherlands (FBW Architects. Project architect: Antoni Folkers). 1996–2000.
St. Francis Turiani Hospital, Turiani, Tanzania (FBW Architects. Project architect: Antoni Folkers). 1992–2000.
Tabora Deaf-Mute Institute, Tabora, Tanzania (FBW Architects. Project architect: Antoni Folkers). 1991–2000.
Holy Family Virika Hospital, Fort Portal, Uganda (FBW Architects. Project architect: Antoni Folkers). 1991–2000.
Prizes and awards
1st Prize spatial intervention province of Gelderland (project Omnizorg). On behalf of FBW Architects. 2010.
1st Prize bi-annual Dutch Daas Brick Award (project Omnizorg). On behalf of FBW Architects. 2010.
1st Prize Dutch environmental building (project BZC Veluwezoom). On behalf of FBW Architects. 2008.
Honorary mention spatial intervention province of South Holland (project BZC Tenellaplas). On behalf of FBW Architects. 2006.
Nomination for the master plan for the restoration of national cultural centre at Alden Biesen, Belgium (client Flemish Government). In close cooperation with van Buiten, Koen Ottenheym (architectural historian) and Gerrit Smienk (landscape design). 2002–2003.
Honorary mention architectural prize Twente (project RvdK Almelo). On behalf of FBW Architects. 2001.
Honorary mention national ideas competition on Royaal Wonen (project vdWel residence), On behalf of FBW Architects. 2000.
Nomination for the master plan for Shelters for five rock-hewn churches in Lalibela, Ethiopia (client CCRHC, EC). In close cooperation with van Buiten (FBW) & ABT engineers. 1999–2000.
Last round ideas competition on the Frederiksplein Amsterdam. In close cooperation with van Buiten. 1987.
Major publications and articles
Folkers, Antoni. Modern Architecture in Africa. Amsterdam: SUN Architecture, 2010.
Folkers, Antoni, Abdul Sheriff, Anne-Katrien Denissen (ed.) Palace, Sultan & Princess of Zanzibar. Utrecht (ArchiAfrika).
Folkers, Antoni and Heinz Kimmerle. Heer Bommel in Afrika – Religie en geloof in Marten Toonders universum en het Afrikaans animisme (2012).
Folkers, Antoni, Berend van der Lans, Joep Mol (ed.) Proceedings: Conference Modern Architecture in Tanzania Around Independence. Utrecht (ArchiAfrika) 2005.
“Architecture.” In Oxford Bibliographies in African Studies. Ed. Thomas Spear. New York: Oxford University Press.
"Early Modern African Architecture. The House of Wonders Revisited." In: Docomomo, Journal 48, pp. 20–29.
"Planning and Replanning Ng’ambo." In: South African Journal of Art History. Vol.29, Nr.1. pp. 35–49.
"Urbanism in Africa." In: Kaleidoscope. Nr.15. pp. 64–70.
References
1960 births
Living people |
The San Luis Obispo Mardi Gras controversy was a major town and gown conflict in San Luis Obispo, California. In late 2004, the city's leaders called for an end to public celebrations during Mardi Gras, hoping to end the event's reputation as a statewide party destination for college students.
Prior to 2004, tensions had grown as the small street parade held by community organizers evolved into a large-scale celebration that attracted thousands of partygoers, mostly students, from California and the Western United States. In 2004, a riot involving partygoers and the local police was widely televised on American newscasts. Local business and community members worried about bad publicity, potential violence, and the effect on local tourism. Many of the partygoers were not students from California Polytechnic State University ("Cal Poly"); instead, they were students from other cities and came to party in San Luis Obispo. After the riots, concerns regarding restrictive rules spread beyond the Cal Poly community to other Californian universities and student organizations.
2004 Mardi Gras riot
In 2004, police officers shut down parties hosted at Mustang Village, an apartment complex near Cal Poly. A police helicopter patrolled over Cedar Creek, an apartment complex that police had been called to during past celebrations. After the Mustang Village parties were closed down, an estimated 5000 people rioted, causing extensive property damage in neighborhoods along California Boulevard. Police officers arrested nearly 200 partygoers and used crowd control weapons to break up the rioting crowds.
Reactions
In response to the riot, the city council, mayor, and community members created "SLOMardiGras", a website and publicity campaign that called for an end to public Mardi Gras parties. "As a career emergency physician, I dread Mardi Gras like no other event," Dr. Steve Sainbury posted on the website, which also carried letters from the heads of Cuesta College and Cal Poly.
Then-mayor Dave Romero noted the event's positive history but observed that it had grown in size, with the post-riot cleanup in 2004 costing almost half a million dollars. He wrote, "This is not what San Luis Obispo is about, and as much as we like special events, our City Council concluded that Mardi Gras in San Luis Obispo must stop—completely... As your Mayor, I ask that those of you who live in San Luis Obispo help us protect our community from such destructive behavior. Please don't invite out-of-town guests to San Luis Obispo to party over Mardi Gras weekend... Encourage your friends who live here to enjoy the weekend in a safe and helpful way. If you don't live in San Luis Obispo, please don't visit us for Mardi Gras. MARDI GRAS IN SAN LUIS OBISPO IS OVER."
Student concerns
Tripled fines
While the administration of Cal Poly supported the city's desire to quell the Mardi Gras celebrations, members of the student community were angered and concerned over new local ordinances that tripled fines for municipal code violations during Mardi Gras. According to the city's website, the San Luis Obispo Police Department, and city officials, alcohol-related offenses would be monitored closely, including underage drinking and public nudity. Cal Poly's Student Community Liaison Committee noted concerns regarding a smaller "safety zone" that would have tripled fines only in specific areas, including downtown and on Foothill and California Boulevards. The committee publicly endorsed the new safety zone, which comprised San Luis Obispo's entire city limits.
SB 337
In February 2005, then-Senator Abel Maldonado introduced California Senate Bill 337 (SB 337), calling for the immediate dismissal of "any student convicted, pleading guilty to, or being adjudicated a delinquent minor with respect to specified rioting provisions of the Penal Code." Under the bill, students found guilty of rioting would be prevented from attending or being admitted to any Californian community college or college in the California State University system for at least one year.
The Associated Students of the University of California (ASUC) created a bill opposing SB 337, noting that it altered the Donahoe Higher Education Act and eligibility for Cal Grants, a form of financial aid. External Affairs Vice President Liz Hall, who wrote the opposition bill on behalf of ASUC, stated that the "UC Student Association opposes SB 337 as a threat to the rights of free speech and assembly of students."
2005 Mardi Gras
In preparation for the 2005 Mardi Gras, some students attempted to circumvent the new ordinances by creating an underground event called Polygras, which was discussed online from late 2004 to early 2005. To avoid fines and the large police presence planned for Mardi Gras, organizers planned for Polygras to take place immediately after the traditional Mardi Gras period. In response, the city of San Luis Obispo designated a city-wide safety enhancement zone effective through March 2, 2005.
In February 2005, sobriety checkpoints were set up throughout the city, and police officers sought to disperse medium-sized gatherings during Mardi Gras. Arrests decreased by 58% from the previous year. The costs of keeping the 2005 celebration under control totaled $1 million, including $385,200 in police department staffing and control costs. 16 other law enforcement organizations, such as the California Highway Patrol, billed an approximate $700,000 in additional staffing and crowd control costs. In February 2004, city councilwoman Christine Mulholland told a New Times reporter that the cost for law enforcement was approximately $100,000 in 2003. Some students congregated at traditional crowd spots during Polygras, but it was not an ongoing concern for the police.
References
Sources
1. "SLO Mardi Gras Celebration Provokes Riot", Matt Dozier, Daily Nexus Online, February 23, 2004, retrieved February 5, 2006.
2. "SCALED-DOWN MARDI GRAS SEASON KICKS OFF", summary, San Luis Obispo Tribune, January 7, 2006, retrieved February 5, 2006;
3. "Voices", from the "SLOMardiGras" website, retrieved February 5, 2006.
4.
5. "Cal Poly the Student Community Liaison Committee Endorses a Citywide Safety Enhancement Zone for Mardi Gras", news release, Oct. 29, 2004, retrieved February 5, 2005.
6.California State Senate Committee on Education, "SB 337 Senate Bill analysis by the California Senate Committee on Education", retrieved February 5, 2006.
7. "A Bill In Opposition to California Senate Bill 337, Spring 2005", retrieved February 5, 2006.
8. Archive of defunct PolyGras.com website, retrieved February 5, 2006. See also #9, which shows archived pages from PolyGras.com.
9. "Resolution Establishing a City-wide Safety Enhancement Zone until March 2, 2005," Council Agenda Report, City of San Luis Obispo, February 10, 2005, retrieved February 5, 2006.
10. "San Luis Launches Campaign Against Wild Mardi Gras," Kristina Ackermann, UCSB Daily Nexus, February 4, 2005, retrieved February 5, 2006.
11. "Mardi Gras officials lower budget for crowd control," Leslie Griffy and Larissa Van Beurden-Doust, San Luis Obispo Tribune, January 24, 2006, retrieved February 5, 2006.
12. "$1 Million," Leslie Griffy,San Luis Obispo Tribune, May 28, 2005, retrieved February 5, 2006.
13. "Surveying the damage", Daniel Blackburn, New Times, February 25, 2004, retrieved February 5, 2006.
2004 in California
2004 in Christianity
2004 riots
February 2005 crimes in the United States
2004 controversies in the United States
History of San Luis Obispo County, California
Riots and civil disorder in California
Mardi Gras |
Gaige is a surname. Notable people with the name include:
Amity Gaige (born 1972), American novelist
Frederick McMahon Gaige (1890–1976), American entomologist and herpetologist
Helen Beulah Thompson Gaige (1890–1976), American herpetologist
Jeremy Gaige (1927–2011), American chess archivist and journalist
See also
Gaige Homestead, a historic home in Schenectady County, New York
Gaige the Mechromancer, a character in the video game Borderlands 2
Gage (disambiguation)
Gauge (disambiguation) |
Dad Camp is a reality TV show on VH1. The show, created by Michael Krupat and Chris Wylde, documents six pregnant couples as they undergo boot camp style group therapy, to help motivate the men to take up the responsibility of fatherhood. At the end of the show, each woman will decide if she wants her partner to stay and help raise the baby, or if she wants sole custody of the child. The couples were: Elliott Miller and Tiffany, Aaron Tyler and Shell, Wes Thompson and Cheryl, Austin Gurley and Candace Hendricks, Donta Young and Briana Stone, and Brian Merrill and Christina Rubert.
Episodes
External links
2010 American television series debuts
2010s American reality television series
2010 American television series endings
VH1 original programming
English-language television shows |
Slezská Ostrava (, lit. Silesian Ostrava), till 1919 Polnisch Ostrau (, , lit. Polish Ostrava) is a district of the city of Ostrava, Moravian-Silesian Region in the Czech Republic. It lies in the historical region of Cieszyn Silesia, not counting Koblov and Antošovice lying north-west from the Oder river in the Hlučín Region.
It comprises historical city of Slezská Ostrava as well as market town of Hrušov and villages Antošovice, Heřmanice, Koblov, Kunčice, Kunčičky and Muglinov.
History
Ostrava was first mentioned in the document of Pope Gregory IX issued for Benedictine abbey in Tyniec in 1229 as Ostrawa. Politically it belonged then to the Duchy of Opole and Racibórz, however it lay on the river Ostravice along which a border between the Silesia and Morava was first regulated in 1261. After founding the town of Moravská Ostrava between 1268 and 1278 on Moravian side, the village left on the Silesian side was called in contrary Slavic and later Polish. Since 1290 it belonged to the Duchy of Teschen, which in 1327 became a fee of Kingdom of Bohemia, which after 1526 became part of the Habsburg monarchy.
The village became a seat of a Catholic parish, mentioned in the register of Peter's Pence payment from 1447 among 50 parishes of Teschen deaconry as Ostravia. After 1540s Protestant Reformation prevailed in the Duchy of Teschen and a local Catholic church was taken over by Lutherans. It was taken from them (as one from around fifty buildings in the region) by a special commission and given back to the Roman Catholic Church on 26 March 1654.
The settlement of Polská Ostrava gained market town rights in 1879. In 1911-1913 a town hall have been built. In 1919 it became a part of Czechoslovakia and in November of that year it was renamed to Slezská Ostrava. On 17 September 1920 it gained city rights.
According to the Austrian census of 1910 Polnisch Ostrau had 22,892 inhabitants, 22,693 of whom had permanent residence there. Census asked people for their native language, 1,296 (5.7%) were German-speaking, 16,927 (74.6%) were Czech-speaking and 4,467 (19.7%) were Polish-speaking. Jews were not allowed to declare Yiddish, most of them thus declared the German language as their native. Most populous religious groups were Roman Catholics with 21,604 (94.4%), followed by Protestants with 933 (4%) and the Jews with 290 (1.3%).
Coats-of-arms of the district's parts
References
External links
Official website
Ostrava
Neighbourhoods in the Czech Republic
Cieszyn Silesia |
```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>
``` |
This is a list of team rosters by season for UCI Continental team and UCI Track Team .
Road
2023
2022
2021
2020
2019
2018
Track
2023
2021
2020
2018
2017
Notes
References
BEAT Cycling Club |
The following is a list of mayors of the city of Teresina, in Piauí state, Brazil.
, 1880-1887
, 1887-1893
Manoel Raimundo da Paz, 1893-1897
Antônio Gonçalves Pedreira Portelada, 1897-1901
Benjamim de Sousa Martins, 1901-1905
Afonso Ribeiro de Albuquerque, 1905
Domingos Monteiro, 1905-1909
Emílio César Burlamaqui, 1909
Adão de Medeiros Soares, 1909, 1910
, 1909-1910
Tersandro Gentil Pedreira Paz, 1910-1917
Antônio da Costa Araújo, 1917-1921
Manoel Raimundo da Paz Filho, 1921-1924
João da Cruz Monteiro, 1924-1925
Anfrísio Lobão Veras Filho, 1925-1929
Domingos Monteiro, 1929-1930
, 1930
João Martins do Rego, 1930-1931
Domingos Monteiro, 1931-1932
, 1932
Luís Pires Chaves, 1932-1935
, 1935
Francisco do Rego Monteiro, 1935-1936
Lindolfo do Rego Monteiro, 1936-1945
José Martins Leite Pereira, 1945-1946
Celso Pinheiro Filho, 1946
Durvalino Couto, 1947
Godofredo Freire da Silva, 1947-1948
José Virgílio Castelo Branco da Rocha, 1948
José Martins Leite Pereira, 1948
José Ribamar de Castro Lima, 1948-1951
, 1951-1955
Agenor Barbosa de Almeida, 1955-1959
, 1959-1963
Hugo Bastos, 1963-1967
, 1967-1969
Raimundo Bona Medeiros, 1969-1970, 1979-1982
Wagner Saraiva de Lima, 1970
Haroldo Borges, 1970-1971
, 1971-1975
, 1975-1979, 1986-1988, 1993-1995
, 1982-1983
, 1983-1986
, 1989-1992
Francisco Gerardo, 1995-1996
Firmino Soares Filho, 1997-2004, 2013-
, 2005-2010
Elmano Férrer, 2010-2012
See also
Elections in Teresina (in Portuguese)
List of mayors of largest cities in Brazil (in Portuguese)
List of mayors of capitals of Brazil (in Portuguese)
References
Mayors of places in Brazil
Politicians from Teresina
Piauí politicians
teresina |
Ioan Prundeanu (born 17 January 1993) is a Romanian rower. He competed in the 2020 Summer Olympics.
References
1993 births
Living people
Rowers from Bucharest
Rowers at the 2020 Summer Olympics
Romanian male rowers
Olympic rowers for Romania
Rowers at the 2010 Summer Youth Olympics |
Willingdon may refer to:
People
Freeman Freeman-Thomas, 1st Marquess of Willingdon (1866–1941), Governor General of Canada and Viceroy of India
Places
Canada
Burnaby-Willingdon, a former electoral district for British Columbia, Canada from 1966 to 2009
Willingdon, Alberta, Canada
Willingdon (electoral district), a former electoral district in Alberta, Canada from 1940 to 1959
Willingdon Heights, a neighbourhood in Burnaby, British Columbia, Canada
England
Willingdon, East Sussex, a village in the parish of Willingdon and Jevington, East Sussex, England
Willingdon Down, a Site of Special Scientific Interest in Eastbourne, East Sussex, England
India
Willingdon Airfield, former name of Safdarjung Airport in New Delhi, India
Willingdon Island, a man-made island located in Kochi, Kerala, India
Willingdon Hospital, later known as Ram Manohar Lohia Hospital, Delhi
Willingdon Bridge, later known as Vivekananda Setu, Kolkata
Other uses
Marquess of Willingdon, a title in the Peerage of the United Kingdom
Willingdon College, Sangli, Maharashtra, India
Willingdon Cup, an annual amateur golf team competition among Canada's provinces
Willingdon Sports Club, a sports club in Mumbai, India
Willingdon Beauty, given name of the proto-revolutionary boar known as Old Major in George Orwell's Animal Farm
See also
Wellington (disambiguation)
Wilmington (disambiguation) |
is one of Tokyo’s largest summer street festivals with up to 12,000 dance team participants and over 1.2 million visitors over the two day event.
Held on the last weekend of August in and around the neighbourhood of Kōenji, Suginami the Awa Dance Festival is the largest of its kind outside of Tokushima Prefecture.
The dance is performed by dance troupes, referred to as group of up to 100 musicians and dancers advancing in lines along the local streets to the accompaniment of shamisen, drums, flutes and cymbals. The dance troupes are mixed both in age and gender with women showcasing intricate formation dance steps wearing traditional yukata, geta and straw amigasa hats.
Local community groups and schools take part in the festivities, but to keep performance standards high the Kōenji Awa-Odori also has a competition element leading to dance troupes from across Japan applying to participate.
Gallery
References
Dance festivals in Japan
Festivals in Tokyo
Summer events in Japan |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.