text
stringlengths 1
22.8M
|
|---|
16th century
17th century
18th century
19th century
20th century
21st century
See also
Timeline of Philippine history
Philippines history-related lists
Philippines
|
```scss
.omv-form-paragraph {
font-weight: var(--mat-font-weight-headline);
font-size: var(--mat-font-size-headline);
padding-top: 1rem;
padding-bottom: 1rem;
}
```
|
Den norske Bank or DnB was a Norwegian bank that existed between 1990 and 2003 when it merged with Gjensidige NOR to form DnB NOR (now DNB ASA). The bank's headquarters were in Bergen, Norway.
DnB was created as a merger between Bergen Bank and Den norske Creditbank in 1990 after a major downturn in the economy, especially affecting the banks, who lost vast amounts of money due to misheld loans and falling housing prices. The state held a majority ownership in the bank in addition to its being listed on the Oslo Stock Exchange. In 1996, DnB bought Vital Forsikring and in 1999 it merged with Postbanken.
External links
DNB web site
Defunct banks of Norway
Companies formerly listed on the Oslo Stock Exchange
Formerly government-owned companies of Norway
Companies based in Bergen
Banks established in 1990
Banks disestablished in 1999
1990 establishments in Norway
1999 disestablishments in Norway
|
Spinneret principally refers to the silk spinning organ on a spider, silk worm, or insect larvae.
Spinneret may also refer to:
Spinneret (polymers), a device used to extrude polymers into fibers (by analogy with a spider)
Spinneret (novel), a novel by Timothy Zahn
Spinneret (Marvel Comics), a comic-book character related to the High Evolutionary
Spinneret, a web server board made by Parallax, Inc.
See also
Spinnerette, an alternative rock project
|
Arthur Edward Stilwell (October 21, 1859 – September 26, 1928) was the founder of the Kansas City, Pittsburg and Gulf Railroad, predecessor to the Kansas City Southern Railway. He served as KCPG's president from 1897 to 1900. He was also the founder of Port Arthur, Texas.
Early life
Stilwell was born in Rochester, New York, in 1859. While working as a traveling salesman he courted and married Jennie A. Wood, and the couple moved to Kansas City, Missouri, and then Chicago, Illinois, where Arthur sold insurance for the Travelers Insurance Company, inventing a coupon annuity life-insurance policy which paid the policy holder an income after a certain age.
Railroad enterprises
With the money made selling these policies, the Stilwells returned to Kansas City where Arthur sold real estate and began building the Kansas City Suburban Belt Railway. In his quest to connect Kansas City to the Gulf of Mexico by rail, he began building and acquiring rail lines for the Kansas City, Pittsburg and Gulf Railroad Company (later to become the Kansas City Southern Railroad), plotting townsites along the way which included Mena, Arkansas, Stilwell, Oklahoma, Port Arthur, Texas, and many more.
Setbacks including lawsuits, a hurricane, and yellow fever caused financial problems for the otherwise successful venture, and on April 1, 1899, the KCPG was thrown into receivership by one of its financiers, John Warne Gates, over an unpaid printing bill. Stilwell was out, but the discovery of a giant oilfield in Texas in 1901 ensured the railroad's future success.
Unfazed by losing control of the KCPG, Stilwell announced plans to build a railroad connecting Kansas City with the Pacific Ocean and organized the Kansas City, Mexico and Orient Railway. Although progress was made, financial problems and the Mexican Revolution caused this company to be forced into receivership in March 1912. Ironically, oil was discovered under its tracks and was to contribute to the fortune of its receiver William T. Kemper.
After that, the Stilwells moved to New York, where Arthur spent his time writing books, plays, poems and hymns.
Arthur Stilwell died of apoplexy on September 26, 1928, in New York. His distraught wife, Jennie, committed suicide by jumping out the window of their New York apartment thirteen days later. The Stilwells were said to have left an estate of only $1,000. The cremated remains of the Stilwells have never been located.
In all, Arthur Stilwell organized 41 companies of various kinds during his career. He is credited with building more than of railroad in his lifetime and founding more than 40 cities.
Personal life
Stilwell published many books after his retirement in 1912. He wrote novels, poetry and plays. He also wrote political works on world affairs and the monetary system. His writing attracted attention because in them he maintained that he had based many of his life and business decisions on the whispers of what he called fairies or brownies. In his memoirs published in 1927, he reframed this as hunches.
In 1887 Stilwell started the Fairmount Cycling Club and built the amusement center Fairmount Park between Kansas City and Independence, Missouri, ostensibly to boost traffic for one of the trolley lines he owned. It became the Kansas City Athletic Club in 1893. The new club boasted a six-hole golf course, the second in the area after the Kansas City Country Club, based in what became Loose Park. The Fairmount Club eventually became the Evanston Club in 1901, and later moved to a new location at Swope Park in 1905. The quickly expanding sport of golf and the fast growth of the city necessitated another move to a rural tract outside of the city limits in 1916, becoming the Hillcrest Country Club, now at 82nd and Hillcrest Road in Kansas City. Owing to the club's location outside of the city, it was a far more liberal, wild place than the rich clubs in town, allowing gambling and having the highest number of female and minority members.
See also
List of railroad executives
Bibliography
Keith L. Bryant, Jr., Arthur E. Stilwell and the Founding of Port Arthur: A Case of Entrepreneurial Error, Southwestern Historical Quarterly 75 (July 1971).
Keith L. Bryant, Jr., Arthur E. Stilwell: Promoter with a Hunch (Nashville: Vanderbilt University Press, 1971).
David M. Pletcher, Rails, Mines, and Progress: Seven American Promoters in Mexico, 1867-1911 (Ithaca: Cornell University Press, 1958).
Arthur E. Stilwell and James R. Crowell, I Had a Hunch (Port Arthur Historical Society, 1972).
References
Sources
Arthur Stilwell.com Accessed January 2010. Contains downloadable copies of some of Stilwell's books and poetry.
Museum of the Gulf Coast ~ Arthur Stilwell Biography, Accessed January 2010.
Arthur Stilwell: Railroad Visionary at the Kansas City Public Library, Accessed January 2010 Contains downloadable copies of some of Stilwell's books and poetry.
External links
1859 births
1928 deaths
Businesspeople from Rochester, New York
Businesspeople from New York City
People from Polk County, Arkansas
People from Port Arthur, Texas
Businesspeople from Kansas City, Missouri
19th-century American railroad executives
20th-century American railroad executives
American city founders
American psychics
Kansas City Southern Railway
|
```go
//
//
// path_to_url
//
// Unless required by applicable law or agreed to in writing, software
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
package daemon
import (
"github.com/projectcalico/calico/felix/config"
"github.com/projectcalico/calico/libcalico-go/lib/clientv3"
"github.com/projectcalico/calico/typha/pkg/discovery"
)
func bootstrapWireguardAndFilterTyphaAddresses(
_ *config.Config, _ clientv3.NodesClient, typhas []discovery.Typha,
) ([]discovery.Typha, error) {
return typhas, nil
} // no filtering
func bootstrapRemoveWireguard(_ *config.Config, _ clientv3.Interface) error {
return nil
} // no-op
```
|
Wilhelmina "Willie" Cornelia Drupsteen (1880–1966) was a Dutch illustrator. She is known for her graphic work and book illustrations.
Biography
Drupsteen was born on 10 October 1880 in Amsterdam. She studied at Rijksnormaalschool voor Teekenonderwijsers (National Normal School for Drawing Teachers). She went on to study at Rijksschool voor Kunstnijverheid (National School for Arts and Crafts), and Rijksakademie van beeldende kunsten (State Academy of Fine Arts). Her teachers included Karel de Bazel, , , , Nicolaas van der Waay, and
In 1902 she became a teacher at Dagteeken- en Kunstambachtsschool voor Meisjes (Day drawing and craft school for girls) where she worked until 1908. Drupsteen worked as an illustrator for the Dutch women's movement and other social organizations. She also provided illustrations for the magazine Maandblad der Vereeniging voor Verbetering van Vrouwenkleeding.
In 1905 she became the first woman illustrator to become a member of the Nederlandsche Vereeniging voor Ambachts- en Nijverheidskunst (Association for Craft and Craft Art) (VANK). In 1908 she won the Willink van Collen competition administered by the Arti et Amicitiae.
In 1913 Drupsteen created the poster for De Vrouw 1813-1913. The image also used for the cover of the exhibition catalog.
Suffering from physical and financial problems, Drupsteen moved from Amsterdam to Gelderland, eventually settling in Oosterbeek. By 1955 she was no longer able to work due to failing eyesight. Drupsteen died on 2 April 1966 in Oosterbeek.
References
External links
image of Drupsteen's painting on Mutual Art
1880 births
1966 deaths
20th-century Dutch women artists
Artists from Amsterdam
Dutch women illustrators
|
```java
/*
* This Source Code Form is subject to the terms of the Mozilla Public
* file, You can obtain one at path_to_url
*/
package com.vaticle.typedb.core.test.behaviour.query.language.rule_validation;
import io.cucumber.junit.Cucumber;
import io.cucumber.junit.CucumberOptions;
import org.junit.runner.RunWith;
@RunWith(Cucumber.class)
@CucumberOptions(
strict = true,
plugin = "pretty",
glue = "com.vaticle.typedb.core.test.behaviour",
features = "external/vaticle_typedb_behaviour/query/language/rule-validation.feature",
tags = "not @ignore and not @ignore-typedb"
)
public class RuleValidationTest {
// ATTENTION:
// When you click RUN from within this class through Intellij IDE, it will fail.
// You can fix it by doing:
//
// 1) Go to 'Run'
// 2) Select 'Edit Configurations...'
// 3) Select 'Bazel test <Name>'
//
// 4) Update 'Bazel Flags':
// a) Remove the line that says: '--test_filter=...'
// b) Use the following Bazel flags:
// --cache_test_results=no : to make sure you're not using cache
// --test_output=streamed : to make sure all output is printed
// --subcommands : to print the low-level commands and execution paths
//
// 5) Hit the RUN button by selecting the test from the dropdown menu on the top bar
}
```
|
Foreign relations between the Argentine Republic and the Republic of Paraguay, have existed for more than two centuries. Diplomatic relations between those two neighbors were established in 1811 with the signing of an agreement on Friendship, Assistance and Trade. Both countries were at war between 1864 and 1870 (War of the Triple Alliance), but have not fought one another other since.
Argentina has an embassy in Asunción and three consulates-general (in Asunción, Ciudad del Este and Encarnación). Paraguay has an embassy in Buenos Aires and seven consulates (in Clorinda, Corrientes, Formosa, Posadas, Resistencia, Rosario and Puerto Iguazú). Both countries are full members of Mercosur, Union of South American Nations, Organization of American States, Organization of Ibero-American States, Rio Group, Group of 77, Latin American Economic System and Latin American Integration Association.
Both States share the Argentina–Paraguay border.
See also
Foreign relations of Argentina
Foreign relations of Paraguay
Paraguayan War
Paraguayan immigration to Argentina
References
External links
List of Treaties ruling relations Argentina and Paraguay until 1976 (Argentine Foreign Ministry, in Spanish)
List of Treaties ruling relations Argentina and Paraguay from 1977 until present (Argentine Foreign Ministry, in Spanish)
Argentine embassy in Asuncion (in Spanish only)
Paraguayan Ministry of Foreign Relations about relations with Argentina
Paraguay
Bilateral relations of Paraguay
|
```c
/***************************************************************************/
/* */
/* psobjs.c */
/* */
/* Auxiliary functions for PostScript fonts (body). */
/* */
/* David Turner, Robert Wilhelm, and Werner Lemberg. */
/* */
/* This file is part of the FreeType project, and may only be used, */
/* modified, and distributed under the terms of the FreeType project */
/* license, LICENSE.TXT. By continuing to use, modify, or distribute */
/* this file you indicate that you have read the license and */
/* understand and accept it fully. */
/* */
/***************************************************************************/
#include <ft2build.h>
#include FT_INTERNAL_POSTSCRIPT_AUX_H
#include FT_INTERNAL_DEBUG_H
#include FT_INTERNAL_CALC_H
#include "psobjs.h"
#include "psconv.h"
#include "psauxerr.h"
/*************************************************************************/
/* */
/* The macro FT_COMPONENT is used in trace mode. It is an implicit */
/* parameter of the FT_TRACE() and FT_ERROR() macros, used to print/log */
/* messages during execution. */
/* */
#undef FT_COMPONENT
#define FT_COMPONENT trace_psobjs
/*************************************************************************/
/*************************************************************************/
/***** *****/
/***** PS_TABLE *****/
/***** *****/
/*************************************************************************/
/*************************************************************************/
/*************************************************************************/
/* */
/* <Function> */
/* ps_table_new */
/* */
/* <Description> */
/* Initializes a PS_Table. */
/* */
/* <InOut> */
/* table :: The address of the target table. */
/* */
/* <Input> */
/* count :: The table size = the maximum number of elements. */
/* */
/* memory :: The memory object to use for all subsequent */
/* reallocations. */
/* */
/* <Return> */
/* FreeType error code. 0 means success. */
/* */
FT_LOCAL_DEF( FT_Error )
ps_table_new( PS_Table table,
FT_Int count,
FT_Memory memory )
{
FT_Error error;
table->memory = memory;
if ( FT_NEW_ARRAY( table->elements, count ) ||
FT_NEW_ARRAY( table->lengths, count ) )
goto Exit;
table->max_elems = count;
table->init = 0xDEADBEEFUL;
table->num_elems = 0;
table->block = 0;
table->capacity = 0;
table->cursor = 0;
*(PS_Table_FuncsRec*)&table->funcs = ps_table_funcs;
Exit:
if ( error )
FT_FREE( table->elements );
return error;
}
static void
shift_elements( PS_Table table,
FT_Byte* old_base )
{
FT_PtrDist delta = table->block - old_base;
FT_Byte** offset = table->elements;
FT_Byte** limit = offset + table->max_elems;
for ( ; offset < limit; offset++ )
{
if ( offset[0] )
offset[0] += delta;
}
}
static FT_Error
reallocate_t1_table( PS_Table table,
FT_Long new_size )
{
FT_Memory memory = table->memory;
FT_Byte* old_base = table->block;
FT_Error error;
/* allocate new base block */
if ( FT_ALLOC( table->block, new_size ) )
{
table->block = old_base;
return error;
}
/* copy elements and shift offsets */
if ( old_base )
{
FT_MEM_COPY( table->block, old_base, table->capacity );
shift_elements( table, old_base );
FT_FREE( old_base );
}
table->capacity = new_size;
return FT_Err_Ok;
}
/*************************************************************************/
/* */
/* <Function> */
/* ps_table_add */
/* */
/* <Description> */
/* Adds an object to a PS_Table, possibly growing its memory block. */
/* */
/* <InOut> */
/* table :: The target table. */
/* */
/* <Input> */
/* idx :: The index of the object in the table. */
/* */
/* object :: The address of the object to copy in memory. */
/* */
/* length :: The length in bytes of the source object. */
/* */
/* <Return> */
/* FreeType error code. 0 means success. An error is returned if a */
/* reallocation fails. */
/* */
FT_LOCAL_DEF( FT_Error )
ps_table_add( PS_Table table,
FT_Int idx,
void* object,
FT_PtrDist length )
{
if ( idx < 0 || idx >= table->max_elems )
{
FT_ERROR(( "ps_table_add: invalid index\n" ));
return FT_THROW( Invalid_Argument );
}
if ( length < 0 )
{
FT_ERROR(( "ps_table_add: invalid length\n" ));
return FT_THROW( Invalid_Argument );
}
/* grow the base block if needed */
if ( table->cursor + length > table->capacity )
{
FT_Error error;
FT_Offset new_size = table->capacity;
FT_PtrDist in_offset;
in_offset = (FT_Byte*)object - table->block;
if ( in_offset < 0 || (FT_Offset)in_offset >= table->capacity )
in_offset = -1;
while ( new_size < table->cursor + length )
{
/* increase size by 25% and round up to the nearest multiple
of 1024 */
new_size += ( new_size >> 2 ) + 1;
new_size = FT_PAD_CEIL( new_size, 1024 );
}
error = reallocate_t1_table( table, new_size );
if ( error )
return error;
if ( in_offset >= 0 )
object = table->block + in_offset;
}
/* add the object to the base block and adjust offset */
table->elements[idx] = table->block + table->cursor;
table->lengths [idx] = length;
FT_MEM_COPY( table->block + table->cursor, object, length );
table->cursor += length;
return FT_Err_Ok;
}
/*************************************************************************/
/* */
/* <Function> */
/* ps_table_done */
/* */
/* <Description> */
/* Finalizes a PS_TableRec (i.e., reallocate it to its current */
/* cursor). */
/* */
/* <InOut> */
/* table :: The target table. */
/* */
/* <Note> */
/* This function does NOT release the heap's memory block. It is up */
/* to the caller to clean it, or reference it in its own structures. */
/* */
FT_LOCAL_DEF( void )
ps_table_done( PS_Table table )
{
FT_Memory memory = table->memory;
FT_Error error;
FT_Byte* old_base = table->block;
/* should never fail, because rec.cursor <= rec.size */
if ( !old_base )
return;
if ( FT_ALLOC( table->block, table->cursor ) )
return;
FT_MEM_COPY( table->block, old_base, table->cursor );
shift_elements( table, old_base );
table->capacity = table->cursor;
FT_FREE( old_base );
FT_UNUSED( error );
}
FT_LOCAL_DEF( void )
ps_table_release( PS_Table table )
{
FT_Memory memory = table->memory;
if ( (FT_ULong)table->init == 0xDEADBEEFUL )
{
FT_FREE( table->block );
FT_FREE( table->elements );
FT_FREE( table->lengths );
table->init = 0;
}
}
/*************************************************************************/
/*************************************************************************/
/***** *****/
/***** T1 PARSER *****/
/***** *****/
/*************************************************************************/
/*************************************************************************/
/* first character must be already part of the comment */
static void
skip_comment( FT_Byte* *acur,
FT_Byte* limit )
{
FT_Byte* cur = *acur;
while ( cur < limit )
{
if ( IS_PS_NEWLINE( *cur ) )
break;
cur++;
}
*acur = cur;
}
static void
skip_spaces( FT_Byte* *acur,
FT_Byte* limit )
{
FT_Byte* cur = *acur;
while ( cur < limit )
{
if ( !IS_PS_SPACE( *cur ) )
{
if ( *cur == '%' )
/* According to the PLRM, a comment is equal to a space. */
skip_comment( &cur, limit );
else
break;
}
cur++;
}
*acur = cur;
}
#define IS_OCTAL_DIGIT( c ) ( '0' <= (c) && (c) <= '7' )
/* first character must be `('; */
/* *acur is positioned at the character after the closing `)' */
static FT_Error
skip_literal_string( FT_Byte* *acur,
FT_Byte* limit )
{
FT_Byte* cur = *acur;
FT_Int embed = 0;
FT_Error error = FT_ERR( Invalid_File_Format );
unsigned int i;
while ( cur < limit )
{
FT_Byte c = *cur;
++cur;
if ( c == '\\' )
{
/* Red Book 3rd ed., section `Literal Text Strings', p. 29: */
/* A backslash can introduce three different types */
/* of escape sequences: */
/* - a special escaped char like \r, \n, etc. */
/* - a one-, two-, or three-digit octal number */
/* - none of the above in which case the backslash is ignored */
if ( cur == limit )
/* error (or to be ignored?) */
break;
switch ( *cur )
{
/* skip `special' escape */
case 'n':
case 'r':
case 't':
case 'b':
case 'f':
case '\\':
case '(':
case ')':
++cur;
break;
default:
/* skip octal escape or ignore backslash */
for ( i = 0; i < 3 && cur < limit; ++i )
{
if ( !IS_OCTAL_DIGIT( *cur ) )
break;
++cur;
}
}
}
else if ( c == '(' )
embed++;
else if ( c == ')' )
{
embed--;
if ( embed == 0 )
{
error = FT_Err_Ok;
break;
}
}
}
*acur = cur;
return error;
}
/* first character must be `<' */
static FT_Error
skip_string( FT_Byte* *acur,
FT_Byte* limit )
{
FT_Byte* cur = *acur;
FT_Error err = FT_Err_Ok;
while ( ++cur < limit )
{
/* All whitespace characters are ignored. */
skip_spaces( &cur, limit );
if ( cur >= limit )
break;
if ( !IS_PS_XDIGIT( *cur ) )
break;
}
if ( cur < limit && *cur != '>' )
{
FT_ERROR(( "skip_string: missing closing delimiter `>'\n" ));
err = FT_THROW( Invalid_File_Format );
}
else
cur++;
*acur = cur;
return err;
}
/* first character must be the opening brace that */
/* starts the procedure */
/* NB: [ and ] need not match: */
/* `/foo {[} def' is a valid PostScript fragment, */
/* even within a Type1 font */
static FT_Error
skip_procedure( FT_Byte* *acur,
FT_Byte* limit )
{
FT_Byte* cur;
FT_Int embed = 0;
FT_Error error = FT_Err_Ok;
FT_ASSERT( **acur == '{' );
for ( cur = *acur; cur < limit && error == FT_Err_Ok; ++cur )
{
switch ( *cur )
{
case '{':
++embed;
break;
case '}':
--embed;
if ( embed == 0 )
{
++cur;
goto end;
}
break;
case '(':
error = skip_literal_string( &cur, limit );
break;
case '<':
error = skip_string( &cur, limit );
break;
case '%':
skip_comment( &cur, limit );
break;
}
}
end:
if ( embed != 0 )
error = FT_THROW( Invalid_File_Format );
*acur = cur;
return error;
}
/***********************************************************************/
/* */
/* All exported parsing routines handle leading whitespace and stop at */
/* the first character which isn't part of the just handled token. */
/* */
/***********************************************************************/
FT_LOCAL_DEF( void )
ps_parser_skip_PS_token( PS_Parser parser )
{
/* Note: PostScript allows any non-delimiting, non-whitespace */
/* character in a name (PS Ref Manual, 3rd ed, p31). */
/* PostScript delimiters are (, ), <, >, [, ], {, }, /, and %. */
FT_Byte* cur = parser->cursor;
FT_Byte* limit = parser->limit;
FT_Error error = FT_Err_Ok;
skip_spaces( &cur, limit ); /* this also skips comments */
if ( cur >= limit )
goto Exit;
/* self-delimiting, single-character tokens */
if ( *cur == '[' || *cur == ']' )
{
cur++;
goto Exit;
}
/* skip balanced expressions (procedures and strings) */
if ( *cur == '{' ) /* {...} */
{
error = skip_procedure( &cur, limit );
goto Exit;
}
if ( *cur == '(' ) /* (...) */
{
error = skip_literal_string( &cur, limit );
goto Exit;
}
if ( *cur == '<' ) /* <...> */
{
if ( cur + 1 < limit && *(cur + 1) == '<' ) /* << */
{
cur++;
cur++;
}
else
error = skip_string( &cur, limit );
goto Exit;
}
if ( *cur == '>' )
{
cur++;
if ( cur >= limit || *cur != '>' ) /* >> */
{
FT_ERROR(( "ps_parser_skip_PS_token:"
" unexpected closing delimiter `>'\n" ));
error = FT_THROW( Invalid_File_Format );
goto Exit;
}
cur++;
goto Exit;
}
if ( *cur == '/' )
cur++;
/* anything else */
while ( cur < limit )
{
/* *cur might be invalid (e.g., ')' or '}'), but this */
/* is handled by the test `cur == parser->cursor' below */
if ( IS_PS_DELIM( *cur ) )
break;
cur++;
}
Exit:
if ( cur < limit && cur == parser->cursor )
{
FT_ERROR(( "ps_parser_skip_PS_token:"
" current token is `%c' which is self-delimiting\n"
" "
" but invalid at this point\n",
*cur ));
error = FT_THROW( Invalid_File_Format );
}
parser->error = error;
parser->cursor = cur;
}
FT_LOCAL_DEF( void )
ps_parser_skip_spaces( PS_Parser parser )
{
skip_spaces( &parser->cursor, parser->limit );
}
/* `token' here means either something between balanced delimiters */
/* or the next token; the delimiters are not removed. */
FT_LOCAL_DEF( void )
ps_parser_to_token( PS_Parser parser,
T1_Token token )
{
FT_Byte* cur;
FT_Byte* limit;
FT_Int embed;
token->type = T1_TOKEN_TYPE_NONE;
token->start = 0;
token->limit = 0;
/* first of all, skip leading whitespace */
ps_parser_skip_spaces( parser );
cur = parser->cursor;
limit = parser->limit;
if ( cur >= limit )
return;
switch ( *cur )
{
/************* check for literal string *****************/
case '(':
token->type = T1_TOKEN_TYPE_STRING;
token->start = cur;
if ( skip_literal_string( &cur, limit ) == FT_Err_Ok )
token->limit = cur;
break;
/************* check for programs/array *****************/
case '{':
token->type = T1_TOKEN_TYPE_ARRAY;
token->start = cur;
if ( skip_procedure( &cur, limit ) == FT_Err_Ok )
token->limit = cur;
break;
/************* check for table/array ********************/
/* XXX: in theory we should also look for "<<" */
/* since this is semantically equivalent to "["; */
/* in practice it doesn't matter (?) */
case '[':
token->type = T1_TOKEN_TYPE_ARRAY;
embed = 1;
token->start = cur++;
/* we need this to catch `[ ]' */
parser->cursor = cur;
ps_parser_skip_spaces( parser );
cur = parser->cursor;
while ( cur < limit && !parser->error )
{
/* XXX: this is wrong because it does not */
/* skip comments, procedures, and strings */
if ( *cur == '[' )
embed++;
else if ( *cur == ']' )
{
embed--;
if ( embed <= 0 )
{
token->limit = ++cur;
break;
}
}
parser->cursor = cur;
ps_parser_skip_PS_token( parser );
/* we need this to catch `[XXX ]' */
ps_parser_skip_spaces ( parser );
cur = parser->cursor;
}
break;
/* ************ otherwise, it is any token **************/
default:
token->start = cur;
token->type = ( *cur == '/' ? T1_TOKEN_TYPE_KEY : T1_TOKEN_TYPE_ANY );
ps_parser_skip_PS_token( parser );
cur = parser->cursor;
if ( !parser->error )
token->limit = cur;
}
if ( !token->limit )
{
token->start = 0;
token->type = T1_TOKEN_TYPE_NONE;
}
parser->cursor = cur;
}
/* NB: `tokens' can be NULL if we only want to count */
/* the number of array elements */
FT_LOCAL_DEF( void )
ps_parser_to_token_array( PS_Parser parser,
T1_Token tokens,
FT_UInt max_tokens,
FT_Int* pnum_tokens )
{
T1_TokenRec master;
*pnum_tokens = -1;
/* this also handles leading whitespace */
ps_parser_to_token( parser, &master );
if ( master.type == T1_TOKEN_TYPE_ARRAY )
{
FT_Byte* old_cursor = parser->cursor;
FT_Byte* old_limit = parser->limit;
T1_Token cur = tokens;
T1_Token limit = cur + max_tokens;
/* don't include outermost delimiters */
parser->cursor = master.start + 1;
parser->limit = master.limit - 1;
while ( parser->cursor < parser->limit )
{
T1_TokenRec token;
ps_parser_to_token( parser, &token );
if ( !token.type )
break;
if ( tokens != NULL && cur < limit )
*cur = token;
cur++;
}
*pnum_tokens = (FT_Int)( cur - tokens );
parser->cursor = old_cursor;
parser->limit = old_limit;
}
}
/* first character must be a delimiter or a part of a number */
/* NB: `coords' can be NULL if we just want to skip the */
/* array; in this case we ignore `max_coords' */
static FT_Int
ps_tocoordarray( FT_Byte* *acur,
FT_Byte* limit,
FT_Int max_coords,
FT_Short* coords )
{
FT_Byte* cur = *acur;
FT_Int count = 0;
FT_Byte c, ender;
if ( cur >= limit )
goto Exit;
/* check for the beginning of an array; otherwise, only one number */
/* will be read */
c = *cur;
ender = 0;
if ( c == '[' )
ender = ']';
else if ( c == '{' )
ender = '}';
if ( ender )
cur++;
/* now, read the coordinates */
while ( cur < limit )
{
FT_Short dummy;
FT_Byte* old_cur;
/* skip whitespace in front of data */
skip_spaces( &cur, limit );
if ( cur >= limit )
goto Exit;
if ( *cur == ender )
{
cur++;
break;
}
old_cur = cur;
if ( coords != NULL && count >= max_coords )
break;
/* call PS_Conv_ToFixed() even if coords == NULL */
/* to properly parse number at `cur' */
*( coords != NULL ? &coords[count] : &dummy ) =
(FT_Short)( PS_Conv_ToFixed( &cur, limit, 0 ) >> 16 );
if ( old_cur == cur )
{
count = -1;
goto Exit;
}
else
count++;
if ( !ender )
break;
}
Exit:
*acur = cur;
return count;
}
/* first character must be a delimiter or a part of a number */
/* NB: `values' can be NULL if we just want to skip the */
/* array; in this case we ignore `max_values' */
static FT_Int
ps_tofixedarray( FT_Byte* *acur,
FT_Byte* limit,
FT_Int max_values,
FT_Fixed* values,
FT_Int power_ten )
{
FT_Byte* cur = *acur;
FT_Int count = 0;
FT_Byte c, ender;
if ( cur >= limit )
goto Exit;
/* Check for the beginning of an array. Otherwise, only one number */
/* will be read. */
c = *cur;
ender = 0;
if ( c == '[' )
ender = ']';
else if ( c == '{' )
ender = '}';
if ( ender )
cur++;
/* now, read the values */
while ( cur < limit )
{
FT_Fixed dummy;
FT_Byte* old_cur;
/* skip whitespace in front of data */
skip_spaces( &cur, limit );
if ( cur >= limit )
goto Exit;
if ( *cur == ender )
{
cur++;
break;
}
old_cur = cur;
if ( values != NULL && count >= max_values )
break;
/* call PS_Conv_ToFixed() even if coords == NULL */
/* to properly parse number at `cur' */
*( values != NULL ? &values[count] : &dummy ) =
PS_Conv_ToFixed( &cur, limit, power_ten );
if ( old_cur == cur )
{
count = -1;
goto Exit;
}
else
count++;
if ( !ender )
break;
}
Exit:
*acur = cur;
return count;
}
#if 0
static FT_String*
ps_tostring( FT_Byte** cursor,
FT_Byte* limit,
FT_Memory memory )
{
FT_Byte* cur = *cursor;
FT_PtrDist len = 0;
FT_Int count;
FT_String* result;
FT_Error error;
/* that simply doesn't begin with an opening parenthesis, even */
/* though they have a closing one! E.g. "amuncial.pfb" */
/* */
/* We must deal with these ill-fated cases there. Note that */
/* these fonts didn't work with the old Type 1 driver as the */
/* notice/copyright was not recognized as a valid string token */
/* and made the old token parser commit errors. */
while ( cur < limit && ( *cur == ' ' || *cur == '\t' ) )
cur++;
if ( cur + 1 >= limit )
return 0;
if ( *cur == '(' )
cur++; /* skip the opening parenthesis, if there is one */
*cursor = cur;
count = 0;
/* then, count its length */
for ( ; cur < limit; cur++ )
{
if ( *cur == '(' )
count++;
else if ( *cur == ')' )
{
count--;
if ( count < 0 )
break;
}
}
len = cur - *cursor;
if ( cur >= limit || FT_ALLOC( result, len + 1 ) )
return 0;
/* now copy the string */
FT_MEM_COPY( result, *cursor, len );
result[len] = '\0';
*cursor = cur;
return result;
}
#endif /* 0 */
static int
ps_tobool( FT_Byte* *acur,
FT_Byte* limit )
{
FT_Byte* cur = *acur;
FT_Bool result = 0;
/* return 1 if we find `true', 0 otherwise */
if ( cur + 3 < limit &&
cur[0] == 't' &&
cur[1] == 'r' &&
cur[2] == 'u' &&
cur[3] == 'e' )
{
result = 1;
cur += 5;
}
else if ( cur + 4 < limit &&
cur[0] == 'f' &&
cur[1] == 'a' &&
cur[2] == 'l' &&
cur[3] == 's' &&
cur[4] == 'e' )
{
result = 0;
cur += 6;
}
*acur = cur;
return result;
}
/* load a simple field (i.e. non-table) into the current list of objects */
FT_LOCAL_DEF( FT_Error )
ps_parser_load_field( PS_Parser parser,
const T1_Field field,
void** objects,
FT_UInt max_objects,
FT_ULong* pflags )
{
T1_TokenRec token;
FT_Byte* cur;
FT_Byte* limit;
FT_UInt count;
FT_UInt idx;
FT_Error error;
T1_FieldType type;
/* this also skips leading whitespace */
ps_parser_to_token( parser, &token );
if ( !token.type )
goto Fail;
count = 1;
idx = 0;
cur = token.start;
limit = token.limit;
type = field->type;
/* we must detect arrays in /FontBBox */
if ( type == T1_FIELD_TYPE_BBOX )
{
T1_TokenRec token2;
FT_Byte* old_cur = parser->cursor;
FT_Byte* old_limit = parser->limit;
/* don't include delimiters */
parser->cursor = token.start + 1;
parser->limit = token.limit - 1;
ps_parser_to_token( parser, &token2 );
parser->cursor = old_cur;
parser->limit = old_limit;
if ( token2.type == T1_TOKEN_TYPE_ARRAY )
{
type = T1_FIELD_TYPE_MM_BBOX;
goto FieldArray;
}
}
else if ( token.type == T1_TOKEN_TYPE_ARRAY )
{
count = max_objects;
FieldArray:
/* if this is an array and we have no blend, an error occurs */
if ( max_objects == 0 )
goto Fail;
idx = 1;
/* don't include delimiters */
cur++;
limit--;
}
for ( ; count > 0; count--, idx++ )
{
FT_Byte* q = (FT_Byte*)objects[idx] + field->offset;
FT_Long val;
FT_String* string;
skip_spaces( &cur, limit );
switch ( type )
{
case T1_FIELD_TYPE_BOOL:
val = ps_tobool( &cur, limit );
goto Store_Integer;
case T1_FIELD_TYPE_FIXED:
val = PS_Conv_ToFixed( &cur, limit, 0 );
goto Store_Integer;
case T1_FIELD_TYPE_FIXED_1000:
val = PS_Conv_ToFixed( &cur, limit, 3 );
goto Store_Integer;
case T1_FIELD_TYPE_INTEGER:
val = PS_Conv_ToInt( &cur, limit );
/* fall through */
Store_Integer:
switch ( field->size )
{
case (8 / FT_CHAR_BIT):
*(FT_Byte*)q = (FT_Byte)val;
break;
case (16 / FT_CHAR_BIT):
*(FT_UShort*)q = (FT_UShort)val;
break;
case (32 / FT_CHAR_BIT):
*(FT_UInt32*)q = (FT_UInt32)val;
break;
default: /* for 64-bit systems */
*(FT_Long*)q = val;
}
break;
case T1_FIELD_TYPE_STRING:
case T1_FIELD_TYPE_KEY:
{
FT_Memory memory = parser->memory;
FT_UInt len = (FT_UInt)( limit - cur );
if ( cur >= limit )
break;
/* we allow both a string or a name */
/* for cases like /FontName (foo) def */
if ( token.type == T1_TOKEN_TYPE_KEY )
{
/* don't include leading `/' */
len--;
cur++;
}
else if ( token.type == T1_TOKEN_TYPE_STRING )
{
/* don't include delimiting parentheses */
/* XXX we don't handle <<...>> here */
/* XXX should we convert octal escapes? */
/* if so, what encoding should we use? */
cur++;
len -= 2;
}
else
{
FT_ERROR(( "ps_parser_load_field:"
" expected a name or string\n"
" "
" but found token of type %d instead\n",
token.type ));
error = FT_THROW( Invalid_File_Format );
goto Exit;
}
/* for this to work (FT_String**)q must have been */
/* initialized to NULL */
if ( *(FT_String**)q != NULL )
{
FT_TRACE0(( "ps_parser_load_field: overwriting field %s\n",
field->ident ));
FT_FREE( *(FT_String**)q );
*(FT_String**)q = NULL;
}
if ( FT_ALLOC( string, len + 1 ) )
goto Exit;
FT_MEM_COPY( string, cur, len );
string[len] = 0;
*(FT_String**)q = string;
}
break;
case T1_FIELD_TYPE_BBOX:
{
FT_Fixed temp[4];
FT_BBox* bbox = (FT_BBox*)q;
FT_Int result;
result = ps_tofixedarray( &cur, limit, 4, temp, 0 );
if ( result < 0 )
{
FT_ERROR(( "ps_parser_load_field:"
" expected four integers in bounding box\n" ));
error = FT_THROW( Invalid_File_Format );
goto Exit;
}
bbox->xMin = FT_RoundFix( temp[0] );
bbox->yMin = FT_RoundFix( temp[1] );
bbox->xMax = FT_RoundFix( temp[2] );
bbox->yMax = FT_RoundFix( temp[3] );
}
break;
case T1_FIELD_TYPE_MM_BBOX:
{
FT_Memory memory = parser->memory;
FT_Fixed* temp;
FT_Int result;
FT_UInt i;
if ( FT_NEW_ARRAY( temp, max_objects * 4 ) )
goto Exit;
for ( i = 0; i < 4; i++ )
{
result = ps_tofixedarray( &cur, limit, max_objects,
temp + i * max_objects, 0 );
if ( result < 0 )
{
FT_ERROR(( "ps_parser_load_field:"
" expected %d integers in the %s subarray\n"
" "
" of /FontBBox in the /Blend dictionary\n",
max_objects,
i == 0 ? "first"
: ( i == 1 ? "second"
: ( i == 2 ? "third"
: "fourth" ) ) ));
error = FT_THROW( Invalid_File_Format );
goto Exit;
}
skip_spaces( &cur, limit );
}
for ( i = 0; i < max_objects; i++ )
{
FT_BBox* bbox = (FT_BBox*)objects[i];
bbox->xMin = FT_RoundFix( temp[i ] );
bbox->yMin = FT_RoundFix( temp[i + max_objects] );
bbox->xMax = FT_RoundFix( temp[i + 2 * max_objects] );
bbox->yMax = FT_RoundFix( temp[i + 3 * max_objects] );
}
FT_FREE( temp );
}
break;
default:
/* an error occurred */
goto Fail;
}
}
#if 0 /* obsolete -- keep for reference */
if ( pflags )
*pflags |= 1L << field->flag_bit;
#else
FT_UNUSED( pflags );
#endif
error = FT_Err_Ok;
Exit:
return error;
Fail:
error = FT_THROW( Invalid_File_Format );
goto Exit;
}
#define T1_MAX_TABLE_ELEMENTS 32
FT_LOCAL_DEF( FT_Error )
ps_parser_load_field_table( PS_Parser parser,
const T1_Field field,
void** objects,
FT_UInt max_objects,
FT_ULong* pflags )
{
T1_TokenRec elements[T1_MAX_TABLE_ELEMENTS];
T1_Token token;
FT_Int num_elements;
FT_Error error = FT_Err_Ok;
FT_Byte* old_cursor;
FT_Byte* old_limit;
T1_FieldRec fieldrec = *(T1_Field)field;
fieldrec.type = T1_FIELD_TYPE_INTEGER;
if ( field->type == T1_FIELD_TYPE_FIXED_ARRAY ||
field->type == T1_FIELD_TYPE_BBOX )
fieldrec.type = T1_FIELD_TYPE_FIXED;
ps_parser_to_token_array( parser, elements,
T1_MAX_TABLE_ELEMENTS, &num_elements );
if ( num_elements < 0 )
{
error = FT_ERR( Ignore );
goto Exit;
}
if ( (FT_UInt)num_elements > field->array_max )
num_elements = field->array_max;
old_cursor = parser->cursor;
old_limit = parser->limit;
/* we store the elements count if necessary; */
/* we further assume that `count_offset' can't be zero */
if ( field->type != T1_FIELD_TYPE_BBOX && field->count_offset != 0 )
*(FT_Byte*)( (FT_Byte*)objects[0] + field->count_offset ) =
(FT_Byte)num_elements;
/* we now load each element, adjusting the field.offset on each one */
token = elements;
for ( ; num_elements > 0; num_elements--, token++ )
{
parser->cursor = token->start;
parser->limit = token->limit;
ps_parser_load_field( parser, &fieldrec, objects, max_objects, 0 );
fieldrec.offset += fieldrec.size;
}
#if 0 /* obsolete -- keep for reference */
if ( pflags )
*pflags |= 1L << field->flag_bit;
#else
FT_UNUSED( pflags );
#endif
parser->cursor = old_cursor;
parser->limit = old_limit;
Exit:
return error;
}
FT_LOCAL_DEF( FT_Long )
ps_parser_to_int( PS_Parser parser )
{
ps_parser_skip_spaces( parser );
return PS_Conv_ToInt( &parser->cursor, parser->limit );
}
/* first character must be `<' if `delimiters' is non-zero */
FT_LOCAL_DEF( FT_Error )
ps_parser_to_bytes( PS_Parser parser,
FT_Byte* bytes,
FT_Offset max_bytes,
FT_Long* pnum_bytes,
FT_Bool delimiters )
{
FT_Error error = FT_Err_Ok;
FT_Byte* cur;
ps_parser_skip_spaces( parser );
cur = parser->cursor;
if ( cur >= parser->limit )
goto Exit;
if ( delimiters )
{
if ( *cur != '<' )
{
FT_ERROR(( "ps_parser_to_bytes: Missing starting delimiter `<'\n" ));
error = FT_THROW( Invalid_File_Format );
goto Exit;
}
cur++;
}
*pnum_bytes = PS_Conv_ASCIIHexDecode( &cur,
parser->limit,
bytes,
max_bytes );
if ( delimiters )
{
if ( cur < parser->limit && *cur != '>' )
{
FT_ERROR(( "ps_parser_to_bytes: Missing closing delimiter `>'\n" ));
error = FT_THROW( Invalid_File_Format );
goto Exit;
}
cur++;
}
parser->cursor = cur;
Exit:
return error;
}
FT_LOCAL_DEF( FT_Fixed )
ps_parser_to_fixed( PS_Parser parser,
FT_Int power_ten )
{
ps_parser_skip_spaces( parser );
return PS_Conv_ToFixed( &parser->cursor, parser->limit, power_ten );
}
FT_LOCAL_DEF( FT_Int )
ps_parser_to_coord_array( PS_Parser parser,
FT_Int max_coords,
FT_Short* coords )
{
ps_parser_skip_spaces( parser );
return ps_tocoordarray( &parser->cursor, parser->limit,
max_coords, coords );
}
FT_LOCAL_DEF( FT_Int )
ps_parser_to_fixed_array( PS_Parser parser,
FT_Int max_values,
FT_Fixed* values,
FT_Int power_ten )
{
ps_parser_skip_spaces( parser );
return ps_tofixedarray( &parser->cursor, parser->limit,
max_values, values, power_ten );
}
#if 0
FT_LOCAL_DEF( FT_String* )
T1_ToString( PS_Parser parser )
{
return ps_tostring( &parser->cursor, parser->limit, parser->memory );
}
FT_LOCAL_DEF( FT_Bool )
T1_ToBool( PS_Parser parser )
{
return ps_tobool( &parser->cursor, parser->limit );
}
#endif /* 0 */
FT_LOCAL_DEF( void )
ps_parser_init( PS_Parser parser,
FT_Byte* base,
FT_Byte* limit,
FT_Memory memory )
{
parser->error = FT_Err_Ok;
parser->base = base;
parser->limit = limit;
parser->cursor = base;
parser->memory = memory;
parser->funcs = ps_parser_funcs;
}
FT_LOCAL_DEF( void )
ps_parser_done( PS_Parser parser )
{
FT_UNUSED( parser );
}
/*************************************************************************/
/*************************************************************************/
/***** *****/
/***** T1 BUILDER *****/
/***** *****/
/*************************************************************************/
/*************************************************************************/
/*************************************************************************/
/* */
/* <Function> */
/* t1_builder_init */
/* */
/* <Description> */
/* Initializes a given glyph builder. */
/* */
/* <InOut> */
/* builder :: A pointer to the glyph builder to initialize. */
/* */
/* <Input> */
/* face :: The current face object. */
/* */
/* size :: The current size object. */
/* */
/* glyph :: The current glyph object. */
/* */
/* hinting :: Whether hinting should be applied. */
/* */
FT_LOCAL_DEF( void )
t1_builder_init( T1_Builder builder,
FT_Face face,
FT_Size size,
FT_GlyphSlot glyph,
FT_Bool hinting )
{
builder->parse_state = T1_Parse_Start;
builder->load_points = 1;
builder->face = face;
builder->glyph = glyph;
builder->memory = face->memory;
if ( glyph )
{
FT_GlyphLoader loader = glyph->internal->loader;
builder->loader = loader;
builder->base = &loader->base.outline;
builder->current = &loader->current.outline;
FT_GlyphLoader_Rewind( loader );
builder->hints_globals = size->internal;
builder->hints_funcs = 0;
if ( hinting )
builder->hints_funcs = glyph->internal->glyph_hints;
}
builder->pos_x = 0;
builder->pos_y = 0;
builder->left_bearing.x = 0;
builder->left_bearing.y = 0;
builder->advance.x = 0;
builder->advance.y = 0;
builder->funcs = t1_builder_funcs;
}
/*************************************************************************/
/* */
/* <Function> */
/* t1_builder_done */
/* */
/* <Description> */
/* Finalizes a given glyph builder. Its contents can still be used */
/* after the call, but the function saves important information */
/* within the corresponding glyph slot. */
/* */
/* <Input> */
/* builder :: A pointer to the glyph builder to finalize. */
/* */
FT_LOCAL_DEF( void )
t1_builder_done( T1_Builder builder )
{
FT_GlyphSlot glyph = builder->glyph;
if ( glyph )
glyph->outline = *builder->base;
}
/* check that there is enough space for `count' more points */
FT_LOCAL_DEF( FT_Error )
t1_builder_check_points( T1_Builder builder,
FT_Int count )
{
return FT_GLYPHLOADER_CHECK_POINTS( builder->loader, count, 0 );
}
/* add a new point, do not check space */
FT_LOCAL_DEF( void )
t1_builder_add_point( T1_Builder builder,
FT_Pos x,
FT_Pos y,
FT_Byte flag )
{
FT_Outline* outline = builder->current;
if ( builder->load_points )
{
FT_Vector* point = outline->points + outline->n_points;
FT_Byte* control = (FT_Byte*)outline->tags + outline->n_points;
point->x = FIXED_TO_INT( x );
point->y = FIXED_TO_INT( y );
*control = (FT_Byte)( flag ? FT_CURVE_TAG_ON : FT_CURVE_TAG_CUBIC );
}
outline->n_points++;
}
/* check space for a new on-curve point, then add it */
FT_LOCAL_DEF( FT_Error )
t1_builder_add_point1( T1_Builder builder,
FT_Pos x,
FT_Pos y )
{
FT_Error error;
error = t1_builder_check_points( builder, 1 );
if ( !error )
t1_builder_add_point( builder, x, y, 1 );
return error;
}
/* check space for a new contour, then add it */
FT_LOCAL_DEF( FT_Error )
t1_builder_add_contour( T1_Builder builder )
{
FT_Outline* outline = builder->current;
FT_Error error;
/* this might happen in invalid fonts */
if ( !outline )
{
FT_ERROR(( "t1_builder_add_contour: no outline to add points to\n" ));
return FT_THROW( Invalid_File_Format );
}
if ( !builder->load_points )
{
outline->n_contours++;
return FT_Err_Ok;
}
error = FT_GLYPHLOADER_CHECK_POINTS( builder->loader, 0, 1 );
if ( !error )
{
if ( outline->n_contours > 0 )
outline->contours[outline->n_contours - 1] =
(short)( outline->n_points - 1 );
outline->n_contours++;
}
return error;
}
/* if a path was begun, add its first on-curve point */
FT_LOCAL_DEF( FT_Error )
t1_builder_start_point( T1_Builder builder,
FT_Pos x,
FT_Pos y )
{
FT_Error error = FT_ERR( Invalid_File_Format );
/* test whether we are building a new contour */
if ( builder->parse_state == T1_Parse_Have_Path )
error = FT_Err_Ok;
else
{
builder->parse_state = T1_Parse_Have_Path;
error = t1_builder_add_contour( builder );
if ( !error )
error = t1_builder_add_point1( builder, x, y );
}
return error;
}
/* close the current contour */
FT_LOCAL_DEF( void )
t1_builder_close_contour( T1_Builder builder )
{
FT_Outline* outline = builder->current;
FT_Int first;
if ( !outline )
return;
first = outline->n_contours <= 1
? 0 : outline->contours[outline->n_contours - 2] + 1;
/* We must not include the last point in the path if it */
/* is located on the first point. */
if ( outline->n_points > 1 )
{
FT_Vector* p1 = outline->points + first;
FT_Vector* p2 = outline->points + outline->n_points - 1;
FT_Byte* control = (FT_Byte*)outline->tags + outline->n_points - 1;
/* `delete' last point only if it coincides with the first */
/* point and it is not a control point (which can happen). */
if ( p1->x == p2->x && p1->y == p2->y )
if ( *control == FT_CURVE_TAG_ON )
outline->n_points--;
}
if ( outline->n_contours > 0 )
{
/* Don't add contours only consisting of one point, i.e., */
/* check whether the first and the last point is the same. */
if ( first == outline->n_points - 1 )
{
outline->n_contours--;
outline->n_points--;
}
else
outline->contours[outline->n_contours - 1] =
(short)( outline->n_points - 1 );
}
}
/*************************************************************************/
/*************************************************************************/
/***** *****/
/***** OTHER *****/
/***** *****/
/*************************************************************************/
/*************************************************************************/
FT_LOCAL_DEF( void )
t1_decrypt( FT_Byte* buffer,
FT_Offset length,
FT_UShort seed )
{
PS_Conv_EexecDecode( &buffer,
buffer + length,
buffer,
length,
&seed );
}
/* END */
```
|
Although traditionally Titus Andronicus has been seen as one of Shakespeare's least respected plays, its fortunes have changed somewhat in the latter half of the twentieth century, with numerous scholars arguing that the play is more accomplished than has hitherto been allowed for. In particular, scholars have argued that the play is far more thematically complex than has traditionally been thought, and features profound insights into ancient Rome, Elizabethan society, and the human condition. Such scholars tend to argue that these previously unacknowledged insights have only become apparent during the twentieth and twenty-first centuries as only now has the ultraviolent content of the play achieved a sense of relevance. For example, in his 1987 edition of the play for the Contemporary Shakespeare series, A.L. Rowse writes; "in the civilised Victorian age the play could not be performed because it could not be believed. Such is the horror of our own age, with the appalling barbarities of prison camps and resistance movements paralleling the torture and mutilation and feeding on human flesh of the play, that it has ceased to be improbable." Similarly, director Julie Taymor, who staged a production Off-Broadway in 1994 and directed a film version in 1999, says she was drawn to the play because she found it to be the most "relevant of Shakespeare's plays for the modern era". She feels that the play has more relevance for contemporary audiences than it had for the Victorians; "it seems like a play written for today, it reeks of now." Because of this newfound relevance, previously unrecognised thematic strands have thus come to the forefront.
This article presents an overview of four of the most prominent themes in the play.
Revenge
Perhaps the most obvious theme is that of revenge. The story of Procne and Philomela is mentioned several times, and just as they are driven by a desire for revenge, so too are the characters in Titus; the entire narrative from midway through Act 1 is built around the plotting of revenge. According to Hereward Thimbleby Price, Shakespeare "is writing a Senecan play according to the rules, that is to say, a play in which the hero is a man who inexorably pursues revenge and who dies in the act of taking it." Bill Alexander, who directed a Royal Shakespeare Company production in 2003, argues that
the play is largely about revenge and the desire to take revenge. I think that everyone understands on some level that revenge is something you might feel from time to time. The play asks the question "At what point is it right for an individual to take revenge because there is no other way of redressing wrongs?" One of the great things about Shakespeare is that he never attempts to answer such questions, he simply poses them. Titus Andronicus poses the question of revenge, so it can't not be relevant. Everyone has an opinion about when revenge becomes justified and whether the nature of being civilised and human demands that something like revenge is excluded, or must be excluded, from the imagination ... In a sense the play is there to evoke our humanity and our sense of pity about what human beings can do to each other and about what revenge does to human souls. Revenge can drive people mad, and madness can drive people to revenge."
The theme of revenge is introduced very early in the play. In the opening scene, we learn that some of Titus' sons have been killed during the war with the Goths, and as a result, Titus feels compelled to sacrifice Tamora's son, Alarbus. Here revenge takes on a religious duty as Titus claims of his dead sons, "Religiously they ask a sacrifice" (l.124). The sacrifice of Alarbus, however, prompts a desire for revenge in his family. As Demetrius tells Tamora immediately after the sacrifice;
The selfsame gods that armed the Queen of Troy
With opportunity of sharp revenge
Upon the Thracian tyrant in his tent
May favour Tamora, the Queen of Goths
(When Goths were Goths and Tamora was Queen),
To quit the bloody wrongs upon her foes.
1.1.136-141
This ultimately leads to Tamora ordering her sons to rape Lavinia, which in turn leads directly to Titus killing and then cooking Chiron and Demetrius, his eventual murder of both Lavinia and Tamora, his own death at the hands of Saturninus, and Saturninus' death at the hands of Lucius. Revenge runs through the play from beginning to end; Coppélia Kahn argues that the basic trajectory of the plot is "Titus' transformation from Roman hero to revenge hero."
After the sacrifice of Alarbus, when Saturninus has taken Tamora as his bride, she asks him to pardon Titus for what Saturninus sees as dishonourable conduct. Incredulous, Saturninus asks, "What, madam, be dishonoured openly,/And basely put it up without revenge" (1.1.432–433); any infraction or insult must be reciprocated. Later, Aaron tells Tamora that he too is preoccupied with revenge; "Blood and revenge are hammering in my head" (2.3.39). Ordering her sons to rape Lavinia, Tamora says "This vengeance on me had they executed./Revenge it, as you love your mother's life" (2.3.114–115). Then, prior to the rape, Tamora responds to Lavinia's pleas for mercy by outlining how important her revenge is, only Lavinia's pain can satiate it;
Hadst thou in person ne'er offended me,
Even for [Alarbus'] sake am I pitiless.
Remember, boys, I poured forth tears in vain
To save your brother from the sacrifice,
But fierce Andronicus would not relent.
Therefore away with her, and use her as you will;
The worse of her, the better loved of me.
2.3.161-167
As Chiron and Demetrius drag Lavinia into the forest, Tamora vows "Ne'er let my heart know merry cheer indeed/Till all the Andronici be made away" (2.3.187–188). Tamora will literally not be happy until she has avenged herself on the whole family.
Later in the play, Titus makes a similar avowal. After the deaths of Martius and Quintus, he asks, "Which way shall I find Revenge's cave?/For these two heads do seem to speak to me,/And threat me I shall never come to bliss/Till all these mischiefs be returned again" (3.1.269–272). As with Tamora, he is here saying that his primary raison d'être has become to seek revenge. Similarly, prior to Lucius' departure to the Goths, he declares;
If Lucius live he will requite your wrongs,
And make proud Saturnine and his empress
Beg at the gates like Tarquin and his queen.
Now will I to the Goths and raise a power,
To be revenged on Rome and Saturnine.
3.1.295-299
Immediately after Lucius' departure, Titus prepares a meal, but warns Marcus "Look you eat no more/Than will preserve just so much strength in us/As will revenge these bitter woes of ours" (3.2.1–3). Later, Titus comes to feel that even God has become involved in his desire for revenge; "Here display at last/What God will have discovered for revenge" (4.1.73). Then, upon the discovery of who raped Lavinia, he declares
And swear with me, as, with the woeful fere
And father of that chaste dishonoured dame,
Lord Junius Brutus sware for Lucrece' rape,
That we will prosecute by good advice,
Mortal revenge upon these traitorous Goths,
And see their blood, or die with this reproach.
4.1.88-93
Young Lucius also becomes involved in a desire for revenge;
BOY
I say, my lord, that if I were a man,
Their mother's bedchamber should not be safe,
For these base bondmen to the yoke of Rome.
TITUS
Ah, that's my boy! Thy father had full oft
For his ungrateful country done the like.
BOY
And, uncle, so will I an if I live.
4.1.106-111
Later, Marcus urges Publius to "Join with the Goths, and with revengeful war/Take wreak on Rome for this ingratitude,/And vengeance on the traitor Saturnine" (4.3.32–34).
The most obvious manifestation of revenge is when it literally enters the play, with Tamora attempting to dupe the apparently insane Titus; "I will encounter with Andronicus,/And say I am Revenge, sent from below/To join with him and right his heinous wrongs" (5.2.2–4). She then introduces herself as
I am Revenge, sent from th’infernal kingdom
To ease the gnawing vulture of thy mind
By working wreakful vengeance on thy foes.
5.2.32-35
Titus then instructs Revenge that if she encounter Tamora and her sons "I pray thee, do on them some violent death;/They have been violent to me and mine" (5.2.108–109).
Jonathan Bate sees this scene as especially important in the treatment of revenge. On how Titus manipulates the scene and turns the tables, Bate comments "the vehicle of Tamora's revenge against Titus for the death of Alarbus has become the vehicle of Titus' revenge against Tamora for the rape of Lavinia and the deaths of Bassianus, Quintus and Martius." He also finds great significance in the physical entry of Revenge into the play; "by representing Revenge as a character's device rather than a 'reality' outside the action, [Shakespeare] suggests that retribution is a matter of human, not divine will."
Violence and the audience
One of the main reasons that Titus has traditionally been derided is the amount of on-stage violence. The play is saturated with violence from its opening scene, and violence touches virtually every character; Alarbus is burned alive and has his arms chopped off; Titus stabs his own son to death; Bassianus is murdered and thrown into a pit; Lavinia is brutally raped and has her hands cut off and her tongue cut out; Martius and Quintus are decapitated; a nurse and a midwife are stabbed to death by Aaron; an innocent clown is executed for no apparent reason; Titus kills Chiron and Demetrius and cooks them in a pie, which he then feeds to their mother. Then, in the final scene, in the space of a few lines, Titus kills in succession Lavinia and Tamora, and is then immediately killed by Saturninus, who is in turn immediately killed by Lucius. Aaron is then buried up to his neck and left to starve to death in the open air and Tamora's body is thrown to the wild beasts outside the city. As S. Clark Hulse points out, "it has 14 killings, 9 of them on stage, 6 severed members, 1 rape (or 2 or 3 depending on how you count), 1 live burial, 1 case of insanity, and 1 of cannibalism – an average of 5.2 atrocities per act, or one for every 97 lines."
J. Dover Wilson, following John Addington Symonds, defines the play as part of a subgenre called "Tragedy of Blood", directly influenced by Seneca, and places it alongside such plays as Thomas Sackville and Thomas Norton's Gorboduc, (c.1561), Thomas Hughes' The Misfortunes of Arthur (1588), Thomas Kyd's The Spanish Tragedy (c.1588), Christopher Marlowe's The Jew of Malta (1590), Henry Chettle's The Tragedy of Hoffman (1602) and the anonymous Alphonsus, Emperor of Germany (1654). As such, a common theory as to why the play is so violent is that Shakespeare was trying to outdo his predecessors, who catered to the blood-thirsty tastes of the Elizabethan groundlings (Alan C. Dessen refers to Titus as "the most 'Elizabethan' of Shakespeare's plays"). In Thomas Preston's Cambyses (1569), for example, a character is brutally flagellated on stage, and various props and theatrical effects are used to simulate dismemberment and several instances of decapitation. In Kyd's The Spanish Tragedy, there are several graphic murders, and the protagonist bites out his own tongue. Dover Wilson thus suggests that Shakespeare was giving the audience what it wanted, but by giving it to them in such excessive quantities, he was in effect, mocking them, as he watched them "gaping ever wider to swallow more as he tossed them bigger and bigger gobbets of sob-stuff and raw beef-stake."
However, many twentieth century critics, working with new research into Elizabethan culture, have suggested that the society may not have been as blood-thirsty as is often assumed, and as such, Shakespeare could not have been catering to the audience's predilections for violence. According to Ann Jennalie Cook for example, not all of Shakespeare's audience would have been groundlings, the intelligentsia would also have made up an important part of the box office; "the social and economic realities of Renaissance London decreed an audience more privileged than plebeian." With this in mind then, Eugene M. Waith makes the suggestion that Shakespeare was attempting to appeal to both levels of his audience, groundlings and intelligentsia; he embraced the traditions of violence so as to ensure high box office, but the style of the play and the numerous classical allusions suggest he was writing with an educated audience in mind. Similarly, Sylvan Barnet argues, "Although the groundlings probably were delighted, the author must have felt he was creating a drama that would appeal also to the cultivated, who knew Seneca and Ovid." The vast range of mythological and classical references have often been pointed to as evidence of an educated target audience; references include Priam, the Styx, Scythia, Hecuba, Polymnestor, Titan, Phoebe, Hymenaeus, Ajax, Laertes, Odysseus, Olympus, Prometheus, Semiramis, Vulcan, Lucrece, Aeneas, Dido, Venus, Saturn, Philomel, Dian, Acteon, Jove, Pyramus, the Cocytus, Tereus, Cerberus, Orpheus, Tarquin, Cornelia, Apollo, Pallas, Mercury, Hector, Enceladus, Typhon, Alcides, Mars, Astraea, Pluto, Cyclops, Verginia and Sinon.
With this in mind, some critics suggest that the violence in the play is much more than violence for violence's sake, and is instead a fundamental part of the thematic whole. For example, Brian Vickers argues that critics commonly express "an aesthetico-ethical dislike for the violence" because they fail to grasp that "any attentive and unprejudiced reading of the play will show that the violence is in no way gratuitous but part of a closely organised depiction of several cycles of harm and counter-harm." Similarly, for Waith, the violence "represents the political and moral degradation of Rome when Saturninus becomes Emperor of Rome. It also plays a major part in the presentation of the hero's metamorphosis into a cruel revenger. While no artistic device can be called inevitable, one can say with some assurance that Shakespeare's use of violence in Titus Andronicus is far from gratuitous. It is an integral part of his dramatic technique."
Working along the same lines, Jonathan Bate argues that Shakespeare, not content with presenting a play in which violence is a theme, may also have been making his audience wonder about the nature of the violence before them, and thus the play acquires a sense of social critique; "Would playgoers have drawn comparisons between the revenger's ritualised violence and the ritualised violence that they were familiar with in real life?" Thus, "Shakespeare is interrogating Rome, asking what kind of an example it provides for Elizabethan England." Trevor Nunn, who directed an RSC production in 1972, sees the play in a similar light, arguing that the violence raises profound questions for an Elizabethan audience; "thinking about Rome was the only way an Elizabethan had of thinking about civilisation" and as such "if Roman power, law and virtue could fail in the end, what absolutes could men look to under heaven?" In this sense, the play depicts "the Elizabethan nightmare, for even golden ages come to an end in blood, torture and barbarism, and even Rome, the greatest civilisation the world had known, can fall, dragging mankind with it into the darkness."
Another director who has addressed this issue is Gale Edwards, who directed a Shakespeare Theatre Company production in 2007. In her notes, Edwards argues
this is a story, not about gratuitous violence, but about the results and repercussions of violence on society, on family and on the human psyche. It is a story about great pain and suffering, which is the inevitable result of any act of revenge. It deals with our capacity for terrible cruelty and our vulnerability as human beings. It deals with our nobility, our endurance and our definition of ourselves. Our very identity. The lopping off of limbs, in this reading of the play, becomes a powerful metaphor for the dismembership of the state, the destruction of our moral codes and the disintegration of our very humanity.
Similarly, Peter Brook, when explaining why he thought his 1955 RSC production had been so successful, argues that the play is "about the most modern of emotions – about violence, hatred, cruelty, pain."
Breakdown of political order
Another prominent theme in the play is political order, both its collapse and the desire to create a new order. Jacques Berthoud argues that one of the main ideas of the play is "an impression of disintegrating control." Oftentimes, political order is supplanted by total chaos, and the characters can only yearn for a time when order will again reign supreme. As Eugene M. Waith argues of the highly formal nature of the opening scene, "the ceremonies of triumph, sacrifice, burial and election immediately establish the solemnity of public occasions on which an ideal political order is affirmed and individuals are valued to the extent that they support it. The repeated interruptions of the ceremonies suggest the fragility of that order while the mention of Titus' dead sons and the deaths of Alarbus and Mutius emphasise the terrible cost of maintaining it." The political order that so many characters yearn for and would die to protect is presented as far from stable.
The demise of order is represented by Titus himself; the once proud general who stood for everything that was good and honourable in Rome, but is now a madman lying on the road and preaching to the dirt (3.1.23–47);
Titus, noble, patriotic, but flawed by cruelty and an abysmal lack of political judgement, is a mirror of Rome in decline. He, too, has spent his life in repelling barbarism, but now his weariness, old age, and lack of mental agility in coming to terms with new problems, reflect the lack of real energy and capacity of Rome in dealing with the various crises that beset it in its declining years. His subscription to the unhistorical cruelty of making sacrifice of prisoners in the city streets is a symptom of the coarsening of Roman life and values. In the figure of Rome's "best champion," therefore, we see Shakespeare's initial exploration in microcosmic form of the painful and tragic collapse of a great civilization.
The breakdown of order is also emphasised time and again throughout the play in a more literal sense. For example, Marcus alludes to the lack of leadership in Rome because of the death of the old Emperor, and thus asks Titus "Help to set a head on headless Rome" (1.1.186). Due to the appointment of Saturninus however, the breakdown of order accelerates; his wife is having an affair and bent only on revenge upon the Andronici, an invasion army is formed, Saturninus loses the support of the people, and his greatest general seemingly goes mad. The collapse of political order reaches an ironic apotheosis in the final scene, with the breakdown of all order as four murders are committed at a royal banquet in quick succession; Titus kills Lavinia, then Tamora, Saturninus kills Titus, and Lucius kills Saturninus. Immediately upon the restoration of harmony, however, Marcus urges a return to the Rome of old, "O, let me teach you how to knit again/This scattered corn into one mutual sheaf" (5.3.69–70), an order which Lucius subsequently promises to restore; "May I govern so,/To Rome's harms and wipe away her woe" (5.3.146–147). Thus the play ends with a promise of restored order, not with the actual restoration itself.
Civilisation vs. Barbarism
Another theme mentioned numerous times throughout the play is the conflict between civilisation and barbarism. For many of the characters, Rome is the epitome of a civilised society, with everything outside Rome seen as barbarous. This concept is introduced when Marcus intervenes in the debate between Bassianus and Saturninus, which is threatening to boil over into violence;
Let us entreat, by honour of [Titus'] name
Whom worthily you would have now succeed,
And in the Capitol and senate's right,
Whom you pretend to honour and adore,
That you withdraw you and abate your strength,
Dismiss your followers, and, as suitors should,
Plead your deserts in peace and humbleness.
1.1.39-45
Marcus feels that, as a civilised country, this is how Rome should act. He is also the great champion of civility when pleading with Titus to let Mutius be buried in the family tomb;
Suffer thy brother Marcus to inter
His noble nephew here in virtue's nest,
That died in honour and Lavinia's cause.
Thou art a Roman; be not barbarous:
The Greeks upon advise did bury Ajax,
That slew himself; and wise Laertes' son
Did graciously plead for his funerals;
Let not young Mutius then that was thy joy,
Be barred his entrance here.
1.1.377-384
However, not all of the characters agree with the simple equation that Rome is civilised and everything else barbaric. When Titus refuses to spare the life of Alarbus, for example;
TAMORA
O cruel, irreligious piety!
CHIRON
Was never Scythia half so barbarous.
DEMETRIUS
Oppose not Scythia to ambitious Rome.
1.1.130-132
Aaron too sees Roman civility as laughable, but in a different way to Chiron and Demetrius; "I urge thy oath; for that I know/An idiot holds his bauble for a god,/And keeps the oath which by that god he swears." (5.1.78–80). Here, Aaron sees civilisation as nothing more than something foolish, peopled by idiots who keep their word. He returns to this theme in his final speech, glorying in his embracement of barbarism;
Ah, why should wrath be mute, and fury dumb?
I am no baby, I, that with base prayers
I should repent the evils I have done;
Ten thousand worse, than ever yet I did
Would I perform, if I might have my will.
If one good deed in all my life I did,
I do repent it from my very soul.
5.3.183-189
However, the play itself is ambiguous in its depiction of civilised characters and barbaric ones. For example, it ends with the apparently civilised Romans joining forces with the apparently barbarous Goths. However, according to both Jonathan Bate and Jacques Berthoud, the Goths at the end of the play are not the same Goths who had been led by Tamora. Bate believes the play "begins with a Roman stigmatisation of the Goths as barbarians, but modulates towards a very different view. If the Second Goth is a barbarian, what is he doing gazing "upon a ruinous monastery"? For the Elizabethans, history had lessons to teach the present, so this anachronism is purposeful." Bate devises a thesis which suggests that the Goths who appear earlier in the play are 'evil' and those who follow Lucius are 'good'. Bate also argues that "at one level, the Goths at the end of the play are invading Rome because they wish to take revenge on their Queen Tamora for selling out and marrying Saturninus. But at the same time, they and Lucius share a language of faithful friendship, worthiness, honour and valour. They serve as a rebuke to the decadence into which Rome has fallen. This is of a piece with the play's persistent dissolution of the binary opposition which associates Rome and the city with virtue, the Goths and the woods with barbarism."
Jacques Berthoud argues that the Goths at the end of the play are Germanic whereas Tamora is not a Germanic name, but is instead Asiatic, thus the Goths at the end of the play (the Germanic Goths) are not the Goths ruled over by Tamora (the barbaric Goths). Speaking of Tamora's Goths, Berthoud argues "what these Goths have revealed about themselves is not that they are possessed by Satanic powers, but that they are, as it were, socially moronic. The Romans are Romans by virtue of the fact that they have internalised Rome; at an elementary level the Germanic Goths, too, are shown to have assimilated the qualities of a real, if unsophisticated culture. In contrast, these 'barbaric' Goths do not seem to have internalised anything ... they remain morally incomplete. It is for this reason that they regard the massively integrated Andronici as their pre-ordained foes." On the other hand, Anthony Brian Taylor reads the end of the play as meaning that Rome has simply embraced barbarism, and "what motivates the Goths who have allied themselves to Lucius, is no sudden burst of uncharacteristic altruism but the prospect of revenge on Rome."
However, the question has been asked by many critics; is the Rome of Titus Andronicus really civilised itself? According to Robert Miola, it is not; "It devours its children – figuratively by consigning them to the gaping maw of the Andronici tomb, and literally by serving them in the bloody banquet at the play's end." One of the inherent ironies of the play is the contradiction between Titus' civilised veneer when burying his sons, and the unfeeling cruelty he shows to Tamora regarding her own son. This is emphasised in his failure to adhere to his own doctrine that "Sweet mercy is nobility's true badge" (1.1.119). The simplistic distinction between the Romans as civilised and the Goths as barbarous is thus complicated. Markus Marti argues that the apparent contradiction in Titus, and in Rome at large, has more important ramifications beyond character psychology;
Behind a thin layer of cultural gloss lurks Mr Hyde, or rather, our cultural achievements are a superstructure which consists of signifiers heaped upon signifiers of signifiers, but which is ultimately grounded on a very ugly material base which we try to hide, to forget, to dispel and ignore. Rome is the right setting to show this, because this is the place where our culture started in the eyes of an Elizabethan audience, and it is the place where it reached its first peak, in literature, in law, in the building of an empire, in the Pax Romana, in Christianity. But Rome was founded on murder and rape – and if the cultural achievements of humanity – society, law, language, literature – are followed back to their roots, if words are made flesh again, all our cultural achievements turn out to be based on origins which we now consider inhuman and beastly: on sacrifices, on rape and murder, on revenge, on cannibalism.
Similarly, Jonathan Bate argues that the play depicts the Roman conversion from civility to barbarism;
The city prided itself on not being barbaric: the word "civilised" comes from "civilis", which means "of citizens, of the city", and Rome was the city. The religious rituals of a civilised culture, it was believed, involved animal rather than human sacrifice. When Lucius demands that the shadows be appeased through the lopping of the limbs of "the proudest prisoner of the Goths" and the consuming of his flesh in the fire, barbarism has entered the city. The first of the play's many reversals of expected linguistic and behavioural codes takes place, and the supposedly barbaric queen of Goths speaks a Roman language of valour, patriotism, piety, mercy and nobility, whereas the Roman warriors go about their ritual killing.
Anthony Brian Taylor makes a similar argument concerning the character of Lucius, who he sees as "a deeply flawed Roman. Stolid, unimaginative, and soldierly, it never dawns on him that his readiness to commit unspeakable atrocities on man, woman, and child, is utterly barbaric and totally irreconcilable with the civilised values on which his life is centred. Moreover, in being a deeply flawed Roman, Lucius is his father's son, and as such, a fascinating extension of the play's central theme."
Darragh Greene makes the point that it is Lucius and Marcus' mastery of rhetoric, the art of manipulating language, that undermines naive ideals of civilised order: "'Have we done aught amiss?' (5.3.126) asks Marcus, Tribune and so putative guardian and guarantor of the socio-moral order. Once the question is formulated, in an age of rhetoric that recognizes language is the tool for shaping perception, for making the world, the answer will be whatever Marcus or Lucius wish it to be for their own purposes."
References
Notes
All references to Titus Andronicus, unless otherwise specified, are taken from the Oxford Shakespeare (Waith), based on the Q1 text of 1594 (except 3.2, which is based on the folio text of 1623). Under its referencing system, 4.3.15 means act 4, scene 3, line 15.
Editions of Titus Andronicus
Adams, Joseph Quincy (ed.) Shakespeare's Titus Andronicus: The First Quarto, 1594 (New York: C. Scribner's Sons, 1936)
Baildon, Henry Bellyse (ed.) The Lamentable Tragedy of Titus Andronicus (The Arden Shakespeare, 1st Series; London: Arden, 1912)
Barnet, Sylvan (ed.) The Tragedy of Titus Andronicus (Signet Classic Shakespeare; New York: Signet, 1963; revised edition, 1989; 2nd revised edition 2005)
Bate, Jonathan (ed.) Titus Andronicus (The Arden Shakespeare, 3rd Series; London: Arden, 1995)
Bate, Jonathan and Rasmussen, Eric (eds.) Titus Andronicus and Timon of Athens: Two Classical Plays (The RSC Shakespeare; London: Macmillan, 2008)
Cross, Gustav (ed.) Titus Andronicus (The Pelican Shakespeare; London: Penguin, 1966; revised edition 1977)
Dover Wilson, John (ed.) Titus Andronicus (The New Shakespeare; Cambridge: Cambridge University Press, 1948)
Evans, G. Blakemore (ed.) The Riverside Shakespeare (Boston: Houghton Mifflin, 1974; 2nd edn., 1997)
Greenblatt, Stephen; Cohen, Walter; Howard, Jean E. and Maus, Katharine Eisaman (eds.) The Norton Shakespeare: Based on the Oxford Shakespeare (London: Norton, 1997)
Harrison, G.B. (ed.) The Most Lamentable Tragedy of Titus Andronicus (The New Penguin Shakespeare; London: Penguin, 1958; revised edition, 1995)
Hughes, Alan (ed.) Titus Andronicus (The New Cambridge Shakespeare; Cambridge: Cambridge University Press, 1994; 2nd edition 2006)
Massai, Sonia (ed.) Titus Andronicus (The New Penguin Shakespeare, 2nd edition; London: Penguin, 2001)
Maxwell, J.C (ed.) Titus Andronicus (The Arden Shakespeare, 2nd Series; London: Arden, 1953)
MacDonald, Russell (ed.) Titus Andronicus (The Pelican Shakespeare, 2nd edition; London: Penguin, 2000)
Waith, Eugene M. (ed.) Titus Andronicus (The Oxford Shakespeare; Oxford: Oxford University Press, 1984)
Wells, Stanley; Taylor, Gary; Jowett, John and Montgomery, William (eds.) The Oxford Shakespeare: The Complete Works (Oxford: Oxford University Press, 1986; 2nd edn., 2005)
Werstine, Paul and Mowat, Barbara A. (eds.) Titus Andronicus (Folger Shakespeare Library; Washington: Simon & Schuster, 2005)
Selected secondary sources
Bloom, Harold. Shakespeare: The Invention of the Human (New York: New York Publishing Company, 1998)
Boyd, Brian. "Common Words in Titus Andronicus: The Presence of Peele", Notes and Queries, 42:3 (September 1995), 300–307
Brockbank, Philip. "Shakespeare: His Histories, English and Roman" in Christopher Ricks (editor), The New History of Literature (Volume 3): English Drama to 1710 (New York: Peter Bedrick, 1971), 148–181
Brucher, Richard. ""Tragedy Laugh On": Comic Violence in Titus Andronicus", Renaissance Drama, 10 (1979), 71–92
Bryant Jr., Joseph Allen. "Aaron and the Pattern of Shakespeare's Villains" in Dale B. J. Randall and Joseph A. Porter (editors), Renaissance Papers 1984: Southeastern Renaissance Conference (Durham, North Carolina: Duke University Press, 1985), 29–36
Bullough, Geoffrey. Narrative and Dramatic Sources of Shakespeare (Volume 6): Other 'Classical' Plays (New York: Columbia University Press, 1966)
Carroll, James D., "Gorboduc and Titus Andronicus", Notes and Queries, 51:3 (Fall, 2004), 267–269
Chernaik, Warren. "Shakespeare, Co-Author: A Historical Study of Five Collaborative Plays (book review)", Modern Language Review, 99:4 (2004), 1030–1031
Christensen, Ann. ""Playing the Cook": Nurturing Men in Titus Andronicus", in Holger Klein and Rowland Wymer (editors), Shakespeare and History. (Shakespeare Yearbook), (Lewiston: The Edwin Mellen Press, 1996), 327–54
Cohen, Derek. Shakespeare's Culture of Violence (London: St. Martin's Press, 1993)
Daniel, P. A. A Time Analysis of the Plots of Shakespeare's Plays (London: New Shakspere Society, 1879)
Dessen, Alan C. Shakespeare in Performance: Titus Andronicus (Manchester: Manchester University Press, 1989)
Dobson, Michael S. The Making of the National Poet: Shakespeare, Adaptation and Authorship, 1660–1769 (Oxford, Oxford University Press, 1995)
Duthie, G. I. Shakespeare (London: Hutchinson, 1951)
Fawcett, Mary Laughlin. "Arms/Words/Tears: Language and the Body in Titus Andronicus", ELH, 50:2 (Summer, 1983), 261–277
Foakes, R. A. and Rickert R. T. (eds.) Henslowe's Diary (Cambridge: Cambridge University Press, 1961; 2nd edn. edited by Foakes alone, 2002)
Greene, Darragh. "'Have we done aught amiss?': Transgression, Indirection and Audience Reception in Titus Andronicus," in Staged Transgression in Shakespeare's England Ed. Rory Loughnane and Edel Semple. (New York: Palgrave Macmillan, 2013), pp. 63–75.
Goodwin, John. Royal Shakespeare Theatre Company, 1960–1963 (London: Max Reinhardt, 1964)
Haaker, Ann. "Non sine causa: The Use of Emblematic Method and Iconology in the Thematic Structure of Titus Andronicus", Research Opportunities in Renaissance Drama, 13 (1970), 143–168
Halliday, F. E. A Shakespeare Companion, 1564–1964 (Baltimore: Penguin, 1964)
Hamilton, A. C. "Titus Andronicus: The Form of Shakespearean Tragedy", Shakespeare Quarterly, 14:2 (Summer, 1963), 203–207
Hiles, Jane. "A Margin for Error: Rhetorical Context in Titus Andronicus", Style, 21:2 (Summer, 1987), 62–75
Hill, R. F. "The Composition of Titus Andronicus" Shakespeare Survey, 10 (1957), 60–70
Huffman, Clifford. "Titus Andronicus: Metamorphosis and Renewal," Modern Language Review, 67:4 (1972), 730–41
Hulse, S. Clark. "Wresting the Alphabet: Oratory and Action in Titus Andronicus", Criticism, 21:2 (Spring, 1979), 106–18
Hunter, G. K. "Sources and Meanings in Titus Andronicus", in J. C. Gray (editor) The Mirror up to Shakespeare Essays in Honour of G. R. Hibbard (Toronto: Toronto University Press, 1983a), 171–188
. "The Sources of Titus Andronicus – once again", Notes and Queries, 30:2 (Summer, 1983b), 114–116
Jackson, Macdonald P. "Stage Directions and Speech Headings in Act 1 of Titus Andronicus Q (1594): Shakespeare or Peele?", Studies in Bibliography, 49 (1996), 134–148
. "Shakespeare's Brothers and Peele's Brethren Titus Andronicus again", Notes and Queries", 44:4 (November 1997), 494–495
James, Heather. "Cultural Disintegration in Titus Andronicus: Mutilating Titus, Virgil, and Rome", in James Redmond (editor), Themes in Drama (Cambridge: Cambridge University Press, 1991), 123–40
Jones, Emrys. The Origins of Shakespeare (Oxford: Oxford University Press, 1977)
Kahn, Coppélia. Roman Shakespeare: Warriors, Wounds, and Women (New York: Routledge, 1997)
Kendall, Gillian Murray. ""Lend me thy hand": Metaphor and Mayhem in Titus Andronicus", Shakespeare Quarterly, 40:3 (Autumn, 1989), 299–316
Kolin, Philip C. (ed.) Titus Andronicus: Critical Essays (New York: Garland, 1995)
Kott, Jan. Shakespeare Our Contemporary (Garden City, New York: Doubleday Publishing, 1964)
Kramer, Joseph E. "Titus Andronicus: The Fly-Killing Incident", Shakespeare Studies, 5 (1969), 9–19
Law, Robert A. "The Roman Background of Titus Andronicus", Studies in Philology, 40:2 (April 1943), 145–153
Marti, Marcus. "Language of Extremities/Extremities of Language: Body Language and Culture in Titus Andronicus"; 7th World Shakespeare Congress, Valencia, April 2001
Metz, G. Harold. "The History of Titus Andronicus and Shakespeare's Play", Notes and Queries, 22:4 (Winter, 1975), 163–166
. "Stage History of Titus Andronicus", Shakespeare Quarterly, 28:2 (Summer, 1977), 154–169
. "A Stylometric Comparison of Shakespeare's Titus Andronicus, Pericles and Julius Caesar", Shakespeare Newsletter, 29:1 (Spring, 1979), 42
. Shakespeare's Earliest Tragedy: Studies in Titus Andronicus (Madison: Farleigh Dickinson University Press, 1996)
Mincoff, Marco. "The Source of Titus Andronicus", Notes and Queries, 216:2 (Summer, 1971), 131–134
McCandless, David. "A Tale of Two Tituses: Julie Taymor's Vision on Stage and Screen", Shakespeare Quarterly, 53:4 (Winter, 2002), 487–511
Miola, Robert S. "Titus Andronicus and the Mythos of Shakespeare's Rome", Shakespeare Studies, 14 (1981), 85–98
Muir, Kenneth. The Sources of Shakespeare's Plays (London: Routledge, 1977; rpt 2005)
Nevo, Ruth. "Tragic Form in Titus Andronicus", in A.A. Mendilow (editor) Further Studies in English Language and Literature (Jerusalem: Magnes Press, 1975), 1–18
Onions, C. T. A Shakespeare Glossary (London: Oxford University Press, 1953; 2nd edn. edited by Robert D. Eagleson, 1986)
Palmer, D. J. "The Unspeakable in Pursuit of the Uneatable: Language and Action in Titus Andronicus", Critical Quarterly, 14:4 (Winter, 1972), 320–339
Parrott, T. M. "Shakespeare's Revision of Titus Andronicus", Modern Language Review, 14 (1919), 16–37
Price, Hereward. "The Language of Titus Andronicus", Papers of the Michigan Academy of Sciences, Arts and Letters, 21 (1935), 501–507
. "The Authorship of Titus Andronicus", Journal of English and Germanic Philology, 42:1 (Spring 1943), 55–81
Reese, Jack E. "The Formalization of Horror in Titus Andronicus", Shakespeare Quarterly, 21:1 (Spring, 1970), 77–84
Robertson, J.M. Did Shakespeare Write Titus Andronicus?: A Study in Elizabethan Literature (London: Watts, 1905)
Rossiter, A. P. Angel with Horns: Fifteen Lectures on Shakespeare (London: Longmans, 1961; edited by Graham Storey)
Speaight, Robert. Shakespeare on the Stage: An Illustrated History of Shakespearean Performance (London: Collins, 1973)
Sacks, Peter. "Where Words Prevail Not: Grief, Revenge, and Language in Kyd and Shakespeare", ELH, 49:3 (Autumn, 1982), 576–601
Sampley, Arthur M. "Plot Structure in Peele's Plays as a Test of Authorship", PMLA, 51:4 (Winter, 1936), 689–701
Sargent, Ralph M. "The Sources of Titus Andronicus", Studies in Philology, 46:2 (April 1949), 167–183
Schlueter, June. "Rereading the Peacham Drawing", Shakespeare Quarterly, 50:2 (Summer, 1999), 171–184
Sommers, Alan. ""Wilderness of Tigers": Structure and Symbolism in Titus Andronicus", Essays in Criticism, 10 (1960), 275–289
Spencer, T. J. B. "Shakespeare and the Elizabethan Romans", Shakespeare Survey, 10 (1957), 27–38
Starks, Lisa S. "Cinema of Cruelty: Powers of Horror in Julie Taymor's Titus", in Lisa S. Starks and Courtney Lehmann (editors) The Reel Shakespeare: Alternative Cinema and Theory (London: Associated University Press, 2002), 121–142
Taylor, Anthony Brian. "Lucius, the Severely Flawed Redeemer of Titus Andronicus", Connotations, 6:2 (Summer, 1997), 138–157
Tricomi, Albert H. "The Aesthetics of Mutilation in Titus Andronicus", Shakespeare Survey, 27 (1974), 11–19
. "The Mutilated Garden in Titus Andronicus", Shakespeare Studies, 9 (1976), 89–105
Ungerer, Gustav. "An Unrecorded Elizabethan Performance of Titus Andronicus", Shakespeare Survey, 14 (1961), 102–109
Vickers, Brian. Shakespeare, Co-Author: A Historical Study of Five Collaborative Plays (Oxford: Oxford University Press, 2002)
Waith, Eugene M. "The Metamorphosis of Violence in Titus Andronicus", Shakespeare Survey, 10 (1957), 26–35
West, Grace Starry. "Going by the Book: Classical Allusions in Shakespeare's Titus Andronicus", Studies in Philology, 79:1 (Spring 1982), 62–77
Wells, Stanley; Taylor, Gary; with Jowett, John & Montgomery, William. William Shakespeare: a Textual Companion (Oxford: Clarendon Press, 1987)
Willis, Deborah. ""The gnawing vulture": Revenge, Trauma Theory, and Titus Andronicus", Shakespeare Quarterly, 53:1 (Spring, 2002), 21–52
Wilson, F. P. Shakespearean and Other Studies (London: Oxford University Press, 1969; edited by Helen Gardner)
Wynne-Davies, Marion. ""The swallowing womb": Consumed and Consuming Women in Titus Andronicus", in Valerie Wayne (editor), The Matter of Difference: Materialist Feminist Criticism of Shakespeare'' (Ithaca: Cornell University Press, 1991), 129–51
Titus Andronicus
|
```kotlin
package expo.modules.kotlin.typedarray
interface GenericTypedArray<T> : TypedArray, Iterable<T> {
operator fun get(index: Int): T
operator fun set(index: Int, value: T)
override fun iterator(): Iterator<T> = TypedArrayIterator(this)
}
```
|
```objective-c
/*
* 86Box A hypervisor and IBM PC system emulator that specializes in
* running old operating systems and software designed for IBM
* PC systems and compatibles from 1981 through fairly recent
* system designs based on the PCI bus.
*
* This file is part of the 86Box distribution.
*
* CPU type handler.
*
*
*
* Authors: Miran Grca, <mgrca8@gmail.com>
*
*/
#ifndef EMU_X87_SF_H
#define EMU_X87_SF_H
#include "softfloat3e/softfloat.h"
typedef struct {
uint16_t cwd;
uint16_t swd;
uint16_t tag;
uint16_t foo;
uint32_t fip;
uint32_t fdp;
uint16_t fcs;
uint16_t fds;
floatx80 st_space[8];
unsigned char tos;
unsigned char align1;
unsigned char align2;
unsigned char align3;
} fpu_state_t;
extern fpu_state_t fpu_state;
#endif /*EMU_X87_SF_H*/
```
|
Depending on the counting convention used, and including all titles, charts, and edited collections, there may be currently over 500 books in Isaac Asimov's bibliography—as well as his individual short stories, individual essays, and criticism. For his 100th, 200th, and 300th books (based on his personal count), Asimov published Opus 100 (1969), Opus 200 (1979), and Opus 300 (1984), celebrating his writing.
Asimov was so prolific that his books span all major categories of the Dewey Decimal Classification except for category 100, philosophy and psychology. Although Asimov did write several essays about psychology, and forewords for the books The Humanist Way (1988) and In Pursuit of Truth (1982), which were classified in the 100s category, none of his own books were classified in that category.
According to UNESCO's Index Translationum database, Asimov is the world's 24th most-translated author.
An online exhibit in West Virginia University Libraries' virtually complete Asimov Collection displays features, visuals, and descriptions of some of his over 600 books, games, audio recordings, videos, and wall charts. Many first, rare, and autographed editions are in the Libraries' Rare Book Room. Book jackets and autographs are presented online along with descriptions and images of children's books, science fiction art, multimedia, and other materials in the collection.
For a listing of Asimov's science fiction books in chronological order within his future history, see the Foundation series list of books.
Science fiction
Novels
"Greater Foundation" series
The Robot series was originally separate from the Foundation series. The Galactic Empire novels were published as independent stories, set earlier in the same universe as Foundation. Later in life, Asimov synthesized the Robot series into a single coherent "history" that appeared in the extension of the Foundation series.
Robot series:
(first Elijah Baley SF-crime novel)
(second Elijah Baley SF-crime novel)
(third Elijah Baley SF-crime novel)
(sequel to the Elijah Baley trilogy)
Galactic Empire series:
(Republic of Trantor still expanding)
(long before the Empire)
(early Galactic Empire)
Foundation series:
Foundation prequels series:
(occurs before Foundation)
(occurs after Prelude to Foundation and before Foundation)
Original Foundation trilogy:
, Published with the title 'The Man Who Upset the Universe' as a 35c Ace paperback, D-125, in about 1952
Extended Foundation series:
(last of the Foundation series)
Stand-alones
Novels marked with an asterisk (*) have minor connections to the Foundation universe.
The End of Eternity (1955)*
Fantastic Voyage (1966), a novelization of the movie Fantastic Voyage
The Gods Themselves (1972)
Fantastic Voyage II: Destination Brain (1987), not a sequel to Fantastic Voyage, but a similar, independent story
Nemesis (1989)*
Nightfall (1990), with Robert Silverberg, based on "Nightfall", a 1941 novelette written by Asimov
Child of Time (1992), with Robert Silverberg, based on "The Ugly Little Boy", a 1958 novelette written by Asimov
The Positronic Man (1993)*, with Robert Silverberg, based on The Bicentennial Man, a 1976 novelette written by Asimov
Young adult novels
Lucky Starr series (as Paul French):
David Starr, Space Ranger (1952)
Lucky Starr and the Pirates of the Asteroids (1953)
Lucky Starr and the Oceans of Venus (1954)
Lucky Starr and the Big Sun of Mercury (1956)
Lucky Starr and the Moons of Jupiter (1957)
Lucky Starr and the Rings of Saturn (1958)
Children's novels
The Norby Chronicles (with Janet Asimov):
Norby, the Mixed-Up Robot (1983)
Norby's Other Secret (1984)
Norby and the Lost Princess (1985)
Norby and the Invaders (1985)
Norby and the Queen's Necklace (1986)
Norby Finds a Villain (1987)
Norby Down to Earth (1988)
Norby and Yobo's Great Adventure (1989)
Norby and the Oldest Dragon (1990)
Norby and the Court Jester (1991)
Short stories
Collections:
, collection of 5 short stories and 4 novelettes of Robot series:
"Robbie", "Runaround" (novelette), "Reason", "Catch That Rabbit", "Liar!", "Little Lost Robot" (novelette), "Escape!", "Evidence" (novelette), "The Evitable Conflict" (novelette)
, collection of 4 novelettes/novellas:
"The Martian Way" (novelette), "Youth" (novelette), "The Deep" (novelette), "Sucker Bait" (novella)
, collection of 14 short stories, 1 novelette and 2 poems:
"The Dead Past" (novelette, Multivac series), "The Foundation of S.F. Success" (poem), "Franchise" (Multivac series), "Gimmicks Three", "Kid Stuff", "The Watery Place", "Living Space", "The Message", "Satisfaction Guaranteed" (Robot series), "Hell-Fire", "The Last Trump", "The Fun They Had", "Jokester" (Multivac series), "The Immortal Bard", "Someday" (Robot series, Multivac series), "The Author's Ordeal" (poem), "Dreaming Is a Private Thing"
, collection of 6 short stories, 3 novelettes/novellas and 2 poems:
"I Just Make Them Up, See!" (poem), "Profession" (novella), "The Feeling of Power", "The Dying Night" (novelette, Wendell Urth series), "I'm in Marsport Without Hilda", "The Gentle Vultures", "All the Troubles of the World" (Multivac series), "Spell My Name with an S", "The Last Question" (Multivac series), "The Ugly Little Boy" (novelette), "Rejection Slips" (poem)
, collection of 6 short stories, 2 novelettes and 2 novels of Robot series:
"Robot AL-76 Goes Astray", "Victory Unintentional" (also Jovians series #2), "First Law", "Let's Get Together", "Satisfaction Guaranteed", "Risk" (novelette), "Lenny", "Galley Slave" (novelette), The Caves of Steel (novel), The Naked Sun (novel)
, collection of 4 novelettes:
"It's Such a Beautiful Day", "Belief", "Breeds There a Man...?", "C-Chute"
, collection of 14 short stories and 6 novelettes:
"Nightfall" (novelette), "Green Patches", "Hostess" (novelette), "Breeds There a Man...?" (novelette), "C-Chute" (novelette), "In a Good Cause—" (novelette), "What If—", "Sally" (Robot series), "Flies", "Nobody Here But—", "It's Such a Beautiful Day" (novelette), "Strikebreaker", "Insert Knob A in Hole B", "The Up-to-Date Sorcerer", "Unto the Fourth Generation", "What Is This Thing Called Love?", "The Machine That Won the War" (Multivac series), "My Son, the Physicist" (Multivac series), "Eyes Do More Than See", "Segregationist" (Robot series)
, collection of 19 short stories and 8 novelettes:
"The Callistan Menace", "Ring Around the Sun", "The Magnificent Possession", "Trends", "The Weapon Too Dreadful to Use", "Black Friar of the Flame" (novelette), "Half-Breed" (novelette, Half-Breed series #1), "The Secret Sense", "Homo Sol" (Homo Sol series #1), "Half-Breeds on Venus" (novelette, Half-Breed series #2), "The Imaginary" (Homo Sol series #2), "Heredity" (novelette), "History", "Christmas on Ganymede", "The Little Man on the Subway", "The Hazing" (Homo Sol series #3), "Super-Neutron", "Not Final!" (Jovians series #1), "Legal Rites" (novelette), "Time Pussy" (Probability Zero series), "Author! Author!" (novelette), "Death Sentence", "Blind Alley" (Galactic Empire series #4), "No Connection", "The Endochronic Properties of Resublimated Thiotimoline" (Thiotimoline series #1), "The Red Queen's Race" (novelette), "Mother Earth" (novelette, Robot series)
, collection of 5 short stories and 7 novelettes:
"Marooned off Vesta" (Brandon, Shea & Moore series #1), "Nightfall" (novelette), "C-Chute" (novelette), "The Martian Way" (novelette), "The Deep" (novelette), "The Fun They Had", "The Last Question" (Multivac series), "The Dead Past" (novelette, Multivac series), "The Dying Night" (novelette, Wendell Urth series), "Anniversary" (Multivac series, Brandon, Shea & Moore series #2), "The Billiard Ball" (novelette), "Mirror Image" (Robot series #2.5)
, collection of 8 short stories:
"Day of the Hunters", "Shah Guido G.", "The Monkey's Finger", "Everest", "The Pause", "Blank!", "Silly Asses", "Rain, Rain, Go Away"
, collection of 24 short stories:
"Darwinian Pool Room", "Day of the Hunters", "Shah Guido G.", "Button, Button", "The Monkey's Finger", "Everest", "The Pause", "Let's Not", "Each an Explorer", "Blank!", "Does a Bee Care?", "Silly Asses", "Buy Jupiter", "A Statue for Father", "Rain, Rain, Go Away", "Founding Father", "Exile to Hell", "Key Item" (Multivac series), "The Proper Study", "2430 A.D.", "The Greatest Asset", "Take a Match", "Thiotimoline to the Stars" (Thiotimoline series #4), "Light Verse" (Robot series)
, collection of 3 short stories from Dream series:
"The Dream" (#1), "Benjamin's Dream" (#2), "Benjamin's Bicentennial Blast" (#4)
, collection of 6 short stories, 5 novelettes and 1 poem:
"The Prime of Life" (poem), "Feminine Intuition" (novelette, Robot series), "Waterclap" (novelette), "That Thou Art Mindful of Him" (novelette, Robot series), "Stranger in Paradise" (novelette, Robot series), "The Life and Times of Multivac" (Multivac series), "The Winnowing", "The Bicentennial Man" (novelette, Robot series), "Marching In", "Old-fashioned", "The Tercentenary Incident" (Robot series), "Birth of a Notion"
, collection of 3 short stories:
"The Last Answer", "True Love" (Robot series, Multivac series), "Fair Exchange?"
, collection of 21 short stories and 10 novelette from Robot series:
"A Boy's Best Friend", "Sally", "Someday" (also Multivac series), "Point of View" (also Multivac series), "Think!" (also Multivac series), "True Love" (also Multivac series), "Robot AL-76 Goes Astray", "Victory Unintentional" (Jovians series #2), "Stranger in Paradise" (novelette), "Light Verse", "Segregationist", "Robbie", "Let's Get Together", "Mirror Image" (#2.5), "The Tercentenary Incident", "First Law", "Runaround" (novelette), "Reason", "Catch That Rabbit", "Liar!", "Satisfaction Guaranteed", "Lenny", "Galley Slave" (novelette), "Little Lost Robot" (novelette), "Risk" (novelette), "Escape!", "Evidence" (novelette), "The Evitable Conflict" (novelette), "Feminine Intuition" (novelette), "...That Thou Art Mindful of Him" (novelette), "The Bicentennial Man" (novelette)
, collection of 16 short stories and 5 novelettes:
"About Nothing", "A Perfect Fit", "Belief" (novelette), "Death of a Foy", "Fair Exchange?", "For the Birds", "Found!", "Good Taste" (novelette), "How It Happened", "Ideas Die Hard" (novelette), "Ignition Point!", "It Is Coming" (Multivac series), "The Last Answer", "The Last Shuttle", "Lest We Remember" (novelette), "Nothing for Nothing", "One Night of Song" (Azazel series), "The Smile That Loses" (Azazel series), "Sure Thing", "To Tell at a Glance" (novelette), "The Winds of Change"
, collection of 6 short stories, 6 novelettes and y 12 essays:
"Unique Is Where You Find It" (Black Widowers series), "The Eureka Phenomenon" (essay), "The Feeling of Power", "The Comet That Wasn't" (essay), "Found!", "Twinkle, Twinkle, Microwaves" (essay), "Pâté de Foie Gras", "The Bridge of the Gods" (essay), "Belief" (novelette), "Euclid's Fifth" (essay), "The Plane Truth" (essay), "The Billiard Ball" (novelette), "The Winds of Change", "The Figure of the Fastest" (essay), "The Dead Past" (novelette, Multivac series), "The Fateful Lightning" (essay), "Breeds There a Man...?" (novelette), "The Man Who Massed the Earth" (essay), "Nightfall" (novelette), "The Planet That Wasn't" (essay), "The Ugly Little Boy" (novelette), "The Three Who Died Too Soon" (essay), "The Last Question" (Multivac series), "The Nobel Prize That Wasn't" (essay)
, collection of 3 drafts:
Grow Old With Me (novel), "The End of Eternity" (novella), "Belief" (short story)
, collection of 6 short stories and 1 poem:
"More Things in Heaven and Earth" (Azazel series), "Rejection Slips" (poem), "Death of a Foy", "Dashing Through the Snow" (Azazel series), "Potential" (Multivac series), "Eyes Do More Than See", "The Dim Rumble" (Azazel series)
, collection of 23 short stories, 3 novelettes and 2 poems:
"All the Troubles of the World" (Multivac series), "A Loint of Paw", "The Dead Past" (novelette, Multivac series), "Death of a Foy", "Dreaming Is a Private Thing", "Dreamworld", "Eyes Do More Than See", "The Feeling of Power", "Flies", "Found!", "The Foundation of S.F. Success" (poem), "Franchise" (Multivac series), "The Fun They Had", "How It Happened", "I Just Make Them Up, See!" (poem), "I'm in Marsport Without Hilda", "The Immortal Bard", "It's Such a Beautiful Day" (novelette), "Jokester" (Multivac series), "The Last Answer", "The Last Question" (Multivac series), "My Son, the Physicist" (Multivac series), "Obituary", "Spell My Name with an S", "Strikebreaker", "Sure Thing", "The Ugly Little Boy" (novelette), "Unto the Fourth Generation"
, collection of 14 short stories and 7 novelettes:
"Little Lost Robot" (novelette, Robot series), "Robot Dreams" (Robot series), "Breeds There a Man...?" (novelette), "Hostess" (novelette), "Sally" (Robot series), "Strikebreaker", "The Machine that Won the War" (Multivac series), "Eyes Do More Than See", "The Martian Way" (novelette), "Franchise" (Multivac series), "Jokester" (Multivac series), "The Last Question" (Multivac series), "Does a Bee Care?", "Light Verse" (Robot series), "The Feeling of Power", "Spell My Name with an S", "The Ugly Little Boy" (novelette), "The Billiard Ball" (novelette), "True Love" (Robot series, Multivac series), "The Last Answer", "Lest We Remember" (novelette)
, collection of 2 novels and 12 novelettes/novellas:
The Gods Themselves (novel), "The C-Chute" (novelette), "The Dead Past" (novelette, Multivac series), "Hostess" (novelette), "In a Good Cause—" (novelette), "The Key" (novelette, Wendell Urth series), "Lest We Remember" (novelette), "The Martian Way" (novelette), "Nightfall" (novelette), "Profession" (novella), "Sucker Bait" (novella), "The Ugly Little Boy" (novelette), "Youth" (novelette), The End of Eternity (novel)
, collection of 18 short stories from Azazel series:
"The Two-Centimeter Demon", "One Night of Song", "The Smile That Loses", "To the Victor", "The Dim Rumble", "Saving Humanity", "A Matter of Principle", "The Evil Drink Does", "Writing Time", "Dashing Through the Snow", "Logic Is Logic", "He Travels the Fastest", "The Eye of the Beholder", "More Things in Heaven and Earth", "The Mind's Construction", "The Fights of Spring", "Galatea", "Flight of Fancy"
, collection of 32 short stories, 16 novellas/novelettes and 2 essays:
"Marooned Off Vesta" (Brandon, Shea & Moore series #1), "Robbie", "Nightfall" (novelette), "Runaround" (novelette, Robot series), "Death Sentence", "Catch That Rabbit", "Blind Alley" (Galactic Empire series #4), "Evidence" (novelette), "Little Lost Robot" (novelette, Robot series), "No Connection", "The Red Queen's Race" (novelette), "Green Patches", "Breeds There a Man ... ?" (novelette), "The Martian Way" (novelette), "Sally" (Robot series), "The Fun They Had", "Franchise" (Multivac series), "The Last Question" (Multivac series), "Profession" (novella), "The Ugly Little Boy" (novelette), "Unto the Fourth Generation", "Thiotimoline and the Space Age" (Thiotimoline series #3), "The Machine That Won the War" (Multivac series), "My Son, the Physicist!" (Multivac series), "T-Formation" (essay), "Author! Author!" (novelette), "Eyes Do More Than See", "The Key" (novelette, Wendell Urth series), "The Billiard Ball" (novelette), "Exile to Hell", "Feminine Intuition" (novelette, Robot series), "A Problem of Numbers", "Bill and I" (essay), "Mirror Image" (Robot series #2.5), "Light Verse" (Robot series), "—That Thou Art Mindful of Him!" (novelette, Robot series), "Earthset and Evening Star" (Black Widowers series), "The Bicentennial Man" (novelette, Robot series), "True Love" (Robot series, Multivac series), "Found!", "Nothing for Nothing", "For the Birds", "Ignition Point!", "Lest We Remember" (novelette), "Saving Humanity" (Azazel series), "Neither Brute Nor Human" (Black Widowers series), "The Fourth Homonym" (Black Widowers series), "The Eye of the Beholder" (Azazel series), "The Quiet Place" (Black Widowers series), "I Love Little Pussy" (Azazel series)
, collection of 11 short stories, 7 novelettes and 17 essays:
"Introduction: The Robot Chronicles" (18-page introductory essay)
Short stories: "Robot Visions", "Too Bad!", "Robbie", "Reason", "Liar!", "Runaround" (novelette), "Evidence" (novelette), "Little Lost Robot" (novelette), "The Evitable Conflict" (novelette), "Feminine Intuition" (novelette), "The Bicentennial Man" (novelette), "Someday" (Robot series, Multivac series), "Think!" (Robot series, Multivac series), "Segregationist", "Mirror Image" (Robot series #2.5), "Lenny", "Galley Slave" (novelette), "Christmas Without Rodney"
Essays: "Robots I Have Known", "The New Teachers", "Whatever You Wish", "The Friends We Make", "Our Intelligent Tools", "The Machine and the Robot", "The Laws of Robotics", "The New Profession", "The Robot As Enemy?", "Intelligences Together", "My Robots", "The Laws of Humanics", "Cybernetic Organism", "The Sense of Humor", "Robots in Combination", "Future Fantastic"
The Complete Stories:
Volume 1 (1990), collection of 34 short stories, 10 novellas and 4 poems previously published in Earth Is Room Enough, Nine Tomorrows and Nightfall and Other Stories collections
Volume 2 (1992), collection of 29 short stories and 11 novelettes previously published in other collections:
"Not Final!" (Jovians series #1), "The Hazing" (Homo Sol series #3), "Death Sentence", "Blind Alley" (Galactic Empire series #4), "Evidence" (novelette, Robot series), "The Red Queen's Race" (novelette), "Day of the Hunters", "The Deep" (novelette), "The Martian Way" (novelette), "The Monkey's Finger", "The Singing Bell" (Wendell Urth series), "The Talking Stone" (Wendell Urth series), "Each an Explorer", "Let's Get Together" (Robot series), "Pâté de Foie Gras", "Galley Slave" (novelette, Robot series), "Lenny" (Robot series), "A Loint of Paw", "A Statue for Father", "Anniversary" (Multivac series, Brandon, Shea & Moore series #2), "Obituary", "Rain, Rain, Go Away", "Star Light", "Founding Father", "The Key" (novelette, Wendell Urth series), "The Billiard Ball" (novelette), "Exile to Hell", "Key Item" (Multivac series), "Feminine Intuition" (novelette, Robot series), "The Greatest Asset", "Mirror Image" (Robot series #2.5), "Take a Match", "Light Verse" (Robot series), "Stranger In Paradise" (novelette, Robot series), ". . . That Thou Art Mindful of Him" (novelette, Robot series), "The Life and Times of Multivac " (Multivac series), "The Bicentennial Man" (novelette, Robot series), "Marching In", "Old-fashioned", "The Tercentenary Incident" (Robot series)
, published posthumously collection of 12 short stories, 3 novelettes and 35 essays:
"Part One: The Final Stories" (short stories and novelettes): "Cal" (novelette, Robot series), "Left to Right" (Probability Zero series), "Frustration", "Hallucination" (novelette, Multivac series), "The Instability", "Alexander the God", "In the Canyon", "Good-bye to Earth", "Battle-Hymn", "Feghoot and the Courts", "Fault-Intolerant", "Kid Brother" (Robot series), "The Nations in Space", "The Smile of the Chipper", "Gold" (novelette)
"Part Two: On Science Fiction" (essays): "The Longest Voyage", "Inventing the Universe", "Flying Saucers and Science Fiction", "Invasion", "The Science Fiction Blowgun", "The Robot Chronicles", "Golden Age Ahead", "The All-Human Galaxy", "Psychohistory", "Science Fiction Series", "Survivors", "Nowhere!", "Outsiders, Insiders", "Science Fiction Anthologies", "The Influence of Science Fiction", "Women and Science Fiction", "Religion and Science Fiction", "Time-Travel"
"Part Three: On Writing Science Fiction" (essays): "Plotting", "Metaphor", "Ideas", "Serials", "The Name of Our Field", "Hints", "Writing for Young People", "Names", "Originality", "Book Reviews", "What Writers Go Through", "Revisions", "Irony", "Plagiarism", "Symbolism", "Prediction", "Best-Seller", "Pseudonyms", "Dialog"
, published posthumously collection of 10 short stories, 1 novelette and 20 essays:
"Part One: The Final Fantasy Stories" (short stories): "To Your Health" (Azazel series), "The Critic on the Hearth" (Azazel series), "It's a Job" (Azazel series), "Baby, It's Cold Outside" (Azazel series), "The Time Traveler" (Azazel series), "Wine Is a Mocker" (Azazel series), "The Mad Scientist" (Azazel series), "The Fable of the Three Princes" (novelette), "March Against the Foe" (Azazel series), "Northwestward" (Black Widowers series), "Prince Delightful and the Flameless Dragon"
"Part Two: On Fantasy" (essays): "Magic", "Sword and Sorcery", "Concerning Tolkien", "In Days of Old", "Giants in the Earth", "When Fantasy Became Fantasy", "The Reluctant Critic", "The Unicorn", "Unknown", "Extraordinary Voyages", "Fairy Tales", "Dear Judy-Lynn", "Fantasy"
"Part Three: Beyond Fantasy" (essays): "Reading and Writing", "The Right Answer", "Ignorance in America", "Knock Plastic!", "Lost in Non-Translation", "Look Long Upon a Monkey", "Thinking About Thinking"
Uncollected short stories:
"The Weapon" (1942), as H.B. Ogden
"The Micropsychiatric Applications of Thiotimoline" (1953), Thiotimoline series #2
"Question" (1955), Multivac series
"The Portable Star" (1955)
"A Woman's Heart" (1957)
"The Covenant" (1960), five-part round-robin story to which five different authors contributed (Poul Anderson, Isaac Asimov, Robert Sheckley, Murray Leinster, Robert Bloch)
"The Man Who Made the 21st Century" (1965)
"The Holmes-Ginsbook Device" (1968)
"The Best New Thing (1971)
"Big Game" (1974)
"Half-Baked Publisher's Delight (1974), with Jeffrey S. Hudson
"The Heavenly Host" (1974)
"Party by Satellite", or "The Third Dream" (1974), Dream series #3
"Strike!" (1979)
"Getting Even" (1980), Azazel series, Union Club Mysteries series
"The Super Runner" (1982)
"The Ten-Second Election" (1984)
"Left to Right, and Beyond" (1987), with Harrison Roth, Probability Zero series
"The Turning Point" (1988)
Mysteries
Novels
The Death Dealers (1958), republished as A Whiff of Death
Murder at the ABA (1976), also published as Authorized Murder
Short stories
Collections:
, collection of 11 short stories and 3 novelettes:
"The Singing Bell" (Wendell Urth series), "The Talking Stone" (Wendell Urth series), "What's in a Name?", "The Dying Night" (novelette, Wendell Urth series), "Pâté de Foie Gras", "The Dust of Death", "A Loint of Paw", "I'm in Marsport Without Hilda", "Marooned off Vesta" (Brandon, Shea & Moore series #1), "Anniversary" (Multivac series, Brandon, Shea & Moore series #2), "Obituary", "Star Light", "The Key" (novelette, Wendell Urth series), "The Billiard Ball" (novelette)
Black Widowers series:
, collection of 12 short stories:
"The Acquisitive Chuckle", "Ph as in Phony", "Truth to Tell", "Go, Little Book!", "Early Sunday Morning", "The Obvious Factor", "The Pointing Finger", "Miss What?", "The Lullaby of Broadway", "Yankee Doodle Went to Town", "The Curious Omission", "Out of Sight"
, collection of 12 short stories:
"When No Man Pursueth", "Quicker Than the Eye", "The Iron Gem", "The Three Numbers", "Nothing Like Murder", "No Smoking", "Season's Greetings!", "The One and Only East", "Earthset and Evening Star", "Friday the Thirteenth", "The Unabridged", "The Ultimate Crime"
, collection of 12 short stories:
"The Cross of Lorraine", "The Family Man", "The Sports Page", "Second Best", "The Missing Item", "The Next Day", "Irrelevance!", "None So Blind", "The Backward Look", "What Time Is It?", "Middle Name", "To the Barest"
, collection of 12 short stories:
"Sixty Million Trillion Combinations", "The Woman in the Bar", "The Driver", "The Good Samaritan", "The Year of the Action", "Can You Prove It?", "The Phoenician Bauble", "A Monday in April", "Neither Brute Nor Human", "The Redhead", "The Wrong House", "The Intrusion"
, collection of 12 short stories:
"The Fourth Homonym", "Unique Is Where You Find It", "The Lucky Piece", "Triple Devil", "Sunset on the Water", "Where Is He?", "The Old Purse", "The Quiet Place", "The Four-Leaf Clover", "The Envelope", "The Alibi", "The Recipe"
, published posthumously collection of 19 short stories (2 are by other authors):
"The Acquisitive Chuckle", "Ph As in Phony", "Early Sunday Morning", "The Obvious Factor", "The Iron Gem", "To the Barest", "Sixty Million Trillion Combinations", "The Redhead", "The Wrong House", "Triple Devil", "The Men Who Read Isaac Asimov" (by William Brittain), "Northwestward", "Yes, but Why?", "Lost in a Space Warp", "Police at the Door", "The Haunted Cabin", "The Guest's Guest", "The Woman in the Bar", "The Last Story" (by Charles Ardai)
Larry Mysteries (young adult) series:
, collection of 6 short stories:
"The Key Word", "Santa Claus Gets a Coin", "Sarah Tops", "The Thirteenth Day of Christmas", "A Case of Need", "The Disappearing Man" (only in UK edition)
, collection of 5 short stories:
"The Disappearing Man", "Lucky Seven", "The Christmas Solution", "The Twins", "The Man in the Park"
, collection of 30 short stories from Union Club Mysteries series:
"No Refuge Could Save", "The Telephone Number", "The Men Who Wouldn't Talk", "A Clear Shot", "Irresistible to Women", "He Wasn't There", "The Thin Line", "Mystery Tune", "Hide and Seek", "Gift", "Hot or Cold", "The Thirteenth Page", "1 to 999", "Twelve Years Old", "Testing, Testing!", "The Appleby Story", "Dollars and Cents", "Friends and Allies", "Which is Which?", "The Sign", "Catching the Fox", "Getting the Combination", "The Library Book", "The Three Goblets", "Spell It!", "Two Women", "Sending a Signal", "The Favorite Piece", "Half a Ghost", "There Was a Young Lady"
, collection of 30 short stories and 1 novelette;
Black Widowers series: "The Obvious Factor", "The Pointing Finger", "Out of Sight", "Yankee Doodle Went to Town", "Quicker Than the Eye", "The Three Numbers", "The One and Only East", "The Cross of Lorraine", "The Next Day", "What Time Is It?", "Middle Name", "Sixty Million Trillion Combinations", "The Good Samaritan", "Can You Prove It?", "The Redhead"
Union Club Mysteries series: "He Wasn't There", "Hide and Seek", "Dollars and Cents", "The Sign", "Getting the Combination", "The Library Book", "Never Out of Sight", "The Magic Umbrella", "The Speck"
Others: "The Key" (novelette, Wendell Urth series), "A Problem of Numbers", "The Little Things", "Halloween", "The Thirteenth Day of Christmas" (Larry Mysteries series), "The Key Word" (Larry Mysteries series), "Nothing Might Happen"
Uncollected short stories:
"Getting Even" (1980), Azazel series, Union Club Mysteries series
"Zip Code" (1986), Larry Mysteries series
"State Capital", or "A Chemical Solution" (1983), Union Club Mysteries series
"The Bird That Sang Bass", or "Riddled With Clues" (1983), Union Club Mysteries series
"The Briefcase in the Taxi", or "Circuit Breaker" (1983), Union Club Mysteries series
"The Last Caesar", or "Great Caesar's Ghost" (1983), Union Club Mysteries series
"The Queen and King" (1984), Union Club Mysteries series
"The Year of the Feast" (1984), Union Club Mysteries series
"Triply Unique" (1984), Union Club Mysteries series
"Straight Lines" (1985), Union Club Mysteries series
"The Suspect", or "The Taunter" (1985), Union Club Mysteries series
"Upside Down" (1985), Union Club Mysteries series
"Child's Play" (1986), Union Club Mysteries series
"New England Equinox" (1986), Union Club Mysteries series
"Ten" (1986), Union Club Mysteries series
"The Common Name" (1986), Union Club Mysteries series
"The Stamp" (1987), Union Club Mysteries series
"The Teddy Bear" (1987), Union Club Mysteries series
"The Legacy" (1988), Union Club Mysteries series
"The Lost Dog" (1988), Union Club Mysteries series
"Ho! Ho! Ho!" (1989), Union Club Mysteries series
"The Last Man" (1989), Union Club Mysteries series
"Missing", or "A Safe Place" (1991), Union Club Mysteries series
Comics
Star Empire (1990), comic strip
Plays
The Story Machine (1958), based in Asimov short story "Someday"
Poems
Collections:
Lecherous Limericks series:
Lecherous Limericks (1975), , collection of 100 poems:
"Darkest before dawn", "Frustration", "Independence", "The dangers of drink", "Look, everybody!", "The last straw", "Cops are human, too", "Retribution", "Don't back out now", "Conveneent in a pinch", "Overdoing it", "Modesty victorious", "No time out", "Reward of industry", "Shocking!", "A poor example", "The classic", "A good move", "Ah, those sensitive fingers", "How awful", "Compensation", "Side effect", "A la freud", "Don't breathe", "What a shame!", "Fit for his work", "The cost of ignorance", "The prospective widow", "The stars and stripes forever", "Forethought", "Music lover", "Too bad", "Slow but sure", "Valedictorian", "Ouch!", "Law abiding", "Let's see now", "Therapeutic effect", "Yo heave ho", "One has one's pride", "Heh, heh", "Ooh, la, la", "Pleasant surprise", "Zoological comparison", "Oh, that screaming", "Indecision", "Huh?", "Wagnerian", "Either way", "Hold tight!", "It's only fitting", "More than one way", "Following orders", "Unwieldy", "Disillusionment", "Heartbreak!", "All in a night's work", "Asymmetry", "Reciprocity", "Better than nothing", "Nothing personal", "Next!", "All is not lost", "The economic facts", "Woman's prerogative", "Not foiled!", "Retirement!", "No, it won't", "Age cannot wither", "Well, hardly ever", "Male chauvinist pig", "Too good to use", "Disillusionment", "Watch out behind you", "Now we'll never know", "Never say die", "Scarcely worth it", "Bravo!", "Like this, please", "Making beautiful music", "That's the big dipper, my dear", "No safety in numbers", "Last laugh", "Now hear this!", "Insult added to injury", "Each to his taste", "A natural mistake", "Impatience", "Change of life", "Naturally!", "High standards", "Whatever do you mean?", "For a change", "Nonfunctional", "Too good", "Faster, faster!", "Truth in advertising", "The good doctor", "Order of increasing importance", "And, finally"
More Lecherous Limericks (1976), , collection of 100 poems
Still More Lecherous Limericks (1977), , collection of 100 poems:
"Keep it Up", "Ouch!", "Definition", "The Hard Way", "Hubris", "A Woman's Work", "Idiot!", "Entertainment", "Braggart", "These College Girls", "Only Reasonable", "More Than One Way", "No Hurry", "Inept", "You Did?", "About Time", "Ugly!", "Don't Be Too Sure", "What an Improvement!", "Reasons Enough", "Practical", "To Each His Own", "Reminiscences", "Waste of Time", "Demand", "One More Notch", "Cheapskate", "What Were You Saying?", "Education", "Shame!", "Up-Up-", "Down with Virtue!", "Specialized", "No Favorites", "Silver Lining", "Season's Greetings", "Afraid of the Dark", "Unfeeling", "Exchange Problems", "Not Worth the Trouble", "Next to Godliness", "Ethnic", "No Accounting For Tastes", "Screwples", "Effective", "Bravo!", "Better Than Nothint", "The Better Alternative", "To Each Her Own", "Foreplay", "Opportunist", "Economics", "Nonchalance", "Division of Labor", "Drawing the Line", "Grammar", "Unreasonable", "Self-Defeating", "The Male Dream", "Big Mouth", "Disadvantage", "Well, Give In!", "All Talk", "Consequence", "Naughty-Cal", "Stud", "Shortchanged", "Liberal Thinking", "That'll Teach Her", "Compliance", "Weakling", "Poverty", "Emily Post", "Incredible", "Compensation", "Christmas Spirit", "Russian One", "Russian Two", "Russian Three", "Strategy", "The Ayes Have It", "Plural", "Gotcha", "One Way", "It's Not What You Think", "Don't Stop", "Too Late", "Melting", "It's Only Their Duty", "Celibacy", "Don't Miss!", "Safety First", "Repetition", "Practical", "Commencement", "Worthy of Her Hire", "You Never Lose It", "Calisthenics", "Loan", "July 4, 1976"
Asimov's Sherlockian Limericks (1978), , collection of 60 poems:
'A Study in Scarlet", "The Sign of the Four", "A Scandal in Bohemia", "The Red-Headed League", "A Case of Identity", "The Boscombe Valley Mystery", "The Five Orange Pips", "The Man with the Twisted Lip", "The Adventure of the Blue Carbuncle", "The Adventure of the Speckled Band", "The Adventure of the Engineer's Thumb", "The Adventure of the Noble Bachelor", "The Adventure of the Beryl Coronet", "The Adventure of the Copper Beeches", "Silver Blaze", "The Yellow Face", "The Stockbroker's Clerk", "The 'Gloria Scott", "The Musgrave Ritual", "The Reigate Squires", "The Crooked Man", "The Resident Patient", "The Greek Interpreter", "The Naval Treaty", "The Final Problem", "The Hound of the Baskervilles", "The Adventure of the Empty House", "The Adventure of the Norwood Builder", "The Adventure of the Dancing Men", "The Adventure of the Solitary Cyclist", "The Priory School", "The Adventure of Black Peter", "The Adventure of Charles Augustus Milverton", "The Adventure of the Six Napoleons", "The Three Students", "The Golden Pince-Nez", "The Adventure of the Missing Three-Quarter", "The Adventure of the Abbey Grange", "The Adventure of the Second Stain", "The Valley of Fear", "The Adventure of Wisteria Lodge", "The Adventure of the Cardboard Box", "The Adventure of the Red Circle", "The Adventure of the Bruce-Partington Plans", "The Adventure of the Dying Detective", "The Disappearance of Lady Frances Carfax", "The Adventure of the Devil's Foot", "His Last Bow", "The Adventure of the Illustrious Client", "The Adventure of the Blanched Soldier", "The Adventure of the Mazarin Stone", "The Adventure of the Three Gables", "The Adventure of the Sussex Vampire", "The Adventure of the Three Garridebs", "The Problem of Thor Bridge", "The Creeping Man", "The Adventure of the Lion's Mane", "The Adventure of the Veiled Lodger", "The Adventure of Shoscombe Old Place", "The Adventure of the Retired Colourman"
Limericks: Two Gross series:
Limericks: Two Gross, or Two Dozen Dirty Dozen Stanzas (1978), with John Ciardi, , collection of 299 poems
A Grossery of Limericks (1981), with John Ciardi, , collection of 288 poems
Isaac Asimov's Limericks for Children (1984), , collection of 48 poems
Uncollected poems:
"The Foundation of Science Fiction Success", or "The Foundation of S.F. Success" (1954)
"How to Succeed at Science Fiction Without Really Trying" (1956)
"In Reply to Randall Garrett" (1956)
"Tale of the Pioneer" (1957)
"The Author's Ordeal" (1957)
"I Just Make Them Up, See!" (1958)
"Oh, That Lost Sense of Wonder!" (1958)
"The Thunder-Thieves", or "It's All How You Look at It" (1958)
"Rejection Slips" (1959)
"The Prime of Life" (1966)
"Shutting the Barn Door" (1976)
"You Mean" (1976)
"Science Fiction Convention" (1977)
"A Fuller Explanation of Original Sin" (1982), with Janet Asimov as Janet O. Jeppson
"The One Thing Lacking" (1982)
"Phosgene" (1984)
"Potassium Cyanide" (1984)
"Snake Venom" (1984)
"Strychnine" (1984)
"The Gilbert and Sullivan Enthusiasts" (1991)
Non-fiction
General science
Words of Science and the History Behind Them (1959)
Breakthroughs in Science series:
Breakthroughs in Science (1959)
Great Ideas of Science (1969)
The Intelligent Man's Guide to Science (1960)
Revised versions were published as The New Intelligent Man's Guide to Science (1965), Asimov's Guide to Science (1972), and Asimov's New Guide to Science (1984)
Asimov's Biographical Encyclopedia of Science and Technology (1964)
2nd Edition, 1972; 3rd Edition, 1983
Twentieth Century Discovery (1969)
More Words of Science (1972)
Ginn Science Collection (children's textbooks):
Ginn Science Program, Intermediate Level A (1972)
Ginn Science Program, Intermediate Level B (1972)
Ginn Science Program, Intermediate Level C (1972)
Ginn Science Program, Advanced Level A (1973)
Ginn Science Program, Advanced Level B (1973)
Please Explain (1973)
A Choice of Catastrophes (1979)
Exploring the Earth and the Cosmos (1982)
The Measure of the Universe (1983)
Asimov's Chronology of Science and Discovery (1989), second edition adds content thru 1993,
Is Our Planet Warming Up? (1991)
Our Angry Earth: A Ticking Ecological Bomb (1991), with Frederik Pohl
What Causes Acid Rain (1991)
Where Does Garbage Go? (1991)
Why Are Whales Vanishing? (1991)
Why is the Air Dirty? (1991)
Why Do We Have Different Seasons? (1991)
What's Happening to the Ozone Layer? (1992)
Why Are Animals Endangered? (1992)
Why Are Some Beaches Oily? (1992)
Why Are the Rain Forests Vanishing? (1992)
Why Does Litter Cause Problems? (1992)
Collections of essays:
Only a Trillion (1957)
Published in Magazine of Fantasy and Science Fictionoriginally published as monthly columns
Fact and Fancy (1962)
View from a Height (1963)
Adding a Dimension (1964)
Of Time and Space and Other Things (1965)
From Earth to Heaven (1966)
Science, Numbers, and I (1968)
The Solar System and Back (1970)
The Stars in their Courses (1971)
The Left Hand of the Electron (1972)
The Tragedy of the Moon (1973)
Asimov on Astronomy (1974), updated version of essays in previous collections
Asimov on Chemistry (1974), updated version of essays in previous collections
Of Matters Great and Small (1975)
Asimov on Physics (1976), updated version of essays in previous collections
The Planet That Wasn't (1976)
Asimov on Numbers (1976), updated version of essays in previous collections
Quasar, Quasar, Burning Bright (1978)
The Road to Infinity (1979)
The Sun Shines Bright (1981)
Counting the Eons (1983)
X Stands for Unknown (1984)
The Subatomic Monster (1985)
Far as Human Eye Could See: Essays on Science (1987)
Beginnings: The Story of Origins of Mankind, Life, the Earth, the Universe (1987)
The Relativity of Wrong (1988)
Asimov on Science: A 30 Year Retrospective 1959–1989 (1989), features the first essay in the introduction
Out of the Everywhere (1990)
The Secret of the Universe (1991)
Is Anyone There? (1967), – where he used the term Spome
Today and Tomorrow and... (1973)
Science Past, Science Future (1975)
The Beginning and the End (1977)
Life and Time (1978)
The Threats of Our World (1979)
Change!: Seventy-one Glimpses of the Future (1979)
The Roving Mind (1983). New edition published by Prometheus Books, 1997,
The Dangers of Intelligence and Other Science Essays (1986)
Past, Present, and Future (1987)
The Tyrannosaurus Prescription: and One Hundred Other Science Essays (1989)
Frontiers series:
Frontiers: New Discoveries About Man and His Planet, Outer Space and the Universe (1990)
Frontiers II: More Recent Discoveries About Life, Earth, Space, and the Universe (1993), with Janet Asimov, published posthumously
Science fiction
Collections of essays:
Asimov on Science Fiction (1981)
Asimov's Galaxy: Reflections on Science Fiction (1989)
Astronomy
The Clock We Live On (1959)
Satellites in Outer Space (1960)
The Double Planet (1960)
The Kingdom of the Sun (1960)
Planets for Man (1964), with Stephen H. Dole
reprinted by RAND, 2007,
The Universe: From Flat Earth to Quasar (1966)
2nd edition (1971); 3rd edition as The Universe: From Flat Earth to Black Holes and Beyond (1980)
Environments Out There (1967)
Mars (1967)
The Moon (1967)
To The Ends of the Universe (1967)
Galaxies (1968)
Stars (1968)
ABC's of Space (1969)
What Makes the Sun Shine (1971)
Comets and Meteors (1973)
Jupiter, the Largest Planet (1973)
The Sun (1973)
Asimov on Astronomy (1974)
Our World in Space (1974)
Eyes on the Universe: A History of the Telescope (1975)
The Solar System (1975)
Alpha Centauri, the Nearest Star (1976)
Mars, the Red Planet (1977)
The Collapsing Universe (1977)
Extraterrestrial Civilizations (1979)
Saturn and beyond (1979)
Venus, Near Neighbor of the Sun (1981)
Visions of the Universe (1981) with co-author Kazuaki Iwasaki
Asimov's Guide to Halley's Comet (1985)
The Exploding Suns: The Secrets of the Supernovas (1985)
Isaac Asimov's Library of the Universe series:
Ancient Astronomy (1988)
The Solar System series:
The Asteroids, or Cosmic Debris: The Asteroids (1988)
Mercury, or Mercury: The Quick Planet, or Nearest the Sun: The Planet Mercury (1989)
Saturn, or Saturn: The Ringed Beauty, or The Ringed Planet: Saturn (1989)
Earth, or Earth: Our Home Base, or Our Planet Earth (1988)
The Moon, or The Earth's Moon (1988)
The Sun, or The Sun and Its Secrets (1988)
Jupiter, or Jupiter: The Spotted Giant, or Planet of Extremes: Jupiter (1989)
Neptune, or Neptune: The Farthest Giant, or A Distant Giant: The Planet Neptune (1990)
Uranus, or Uranus: The Sideways Planet, or A Distant Puzzle: The Planet Uranus (1988)
Mars, or Mars: Our Mysterious Neighbor, or The Red Planet: Mars (1988)
Pluto and Charon, or Pluto: A Double Planet?, or A Double Planet?: Pluto and Charon (1989)
Venus, or Venus: A Shrouded Mystery, or Earth's Twin? The Planet Venus (1990)
all revised by Richard Hantula
Astronomy Today (1989)
The Birth and Death of Stars (1989)
Colonizing the Planets and the Stars (1989)
Comets and Meteors (1989)
Did Comets Kill the Dinosaurs? (1987)
The Future in Space (1993), with Greg Walz-Chojnacki, published posthumously
How Was the Universe Born? (1988)
Is There Life on Other Planets? (1989)
Mythology and the Universe (1989)
Our Milky Way and Other Galaxies (1988)
Our Solar System (1988)
Piloted Space Flights (1989)
Quasars, Pulsars, and Black Holes, or Black Holes, Pulsars and Quasars, or Mysteries of deep space: Quasars, Pulsars and Black Holes (1988)
Rockets, Probes, and Satellites (1988)
Science Fiction, Science Fact (1989)
Space Garbage (1989)
The Space Spotter's Guide (1988)
Unidentified Flying Objects (1988)
The World's Space Programs (1990)
Think About Space: Where Have We Been and Where Are We Going? (1989), with co-author Frank White
Isaac Asimov's Guide to Earth and Space (1991)
What Is a Shooting Star? (1991)
What Is an Eclipse? (1991)
Why Do Stars Twinkle? (1991)
Why Does the Moon Change Shape? (1991)
Geoscience
Words on the Map (1962)
ABC's of the Ocean (1970)
ABC's of the Earth (1971)
The Ends of the Earth: The Polar Regions of the World (1975)
Mathematics
Realm of Numbers (1959)
Realm of Measure (1960)
Realm of Algebra (1961)
Quick and Easy Math (1964)
An Easy Introduction to the Slide Rule (1965)
The History of Mathematics (1989), chart
Physics
Inside the Atom (1956)
The Neutrino (1966) ASIN B002JK525W
Understanding Physics:
Vol. I, Motion, Sound, and Heat (1966)
Vol. II, Light, Magnetism, and Electricity (1966)
Vol. III, The Electron, Proton, and Neutron (1966)
Light (1970)
Electricity and Man (1972)
World Within Worlds (1972)
Robots: Machines In Man's Image (1985), with Karen Frenklen
Atom: Journey Across the Subatomic Cosmos (1991)
Chemistry
Biochemistry and Human Metabolism (1952)
The Chemicals of Life: Enzymes, Vitamins, and Hormones (1954)
Chemistry and Human Health (1956)
Building Blocks of the Universe (1957; revised 1974)
The World of Carbon (1958)
The World of Nitrogen (1958)
Life and Energy (1962)
The Search for the Elements (1962)
The Genetic Code (1963)
A Short History of Chemistry (1965)
The Genetic Effects of Radiation (1966), with Theodosius Dobzhansky
The Noble Gases (1966)
Photosynthesis (1969)
The History of Chemistry (1991), chart
Biology
Races and People (1955), co-written with William C. Boyd, illustrations by John Bradford
The Living River (1960), book on hematology
The Wellsprings of Life (1960)
The Human Body: Its Structure and Operation (1963) , (revised)
The Human Brain: Its Capacities and Functions (1963)
A Short History of Biology (1964)
ABC's of Ecology (1972)
The History of Biology (1988), chart
Little Library of Dinosaurs (1989), five volumes
History
The Kite That Won the Revolution (1963)
Universal History Asimov series:
The Near East: 10,000 Years of History (1968)
The Land of Canaan (1971)
The Egyptians (1967)
The Greeks: A Great Adventure (1965)
The Roman Republic (1966)
The Roman Empire (1967)
Constantinople: The Forgotten Empire (1970)
The Dark Ages (1968)
The Shaping of England (1969)
The Shaping of France (1972)
The Shaping of North America: From Earliest Times to 1763 (1973)
The Birth of the United States: 1763-1816 (1974)
Our Federal Union: The Union States from 1816 to 1865 (1975),
The Golden Door: The United States From 1865 To 1918 (1977)
Words from History (1968)
Earth: Our Crowded Spaceship (1974)
The March of the Millennia: A Key to Looking at History (1990), with Frank White
Asimov's Chronology of the World: The History of the World From the Big Bang to Modern Times (1991)
Isaac Asimov's Pioneers of Science and Exploration series:
Christopher Columbus: Navigator to the New World (1991)
Ferdinand Magellan: Opening the Door to World Exploration (1991)
Henry Hudson: Arctic Explorer and North American Adventurer (1991)
The Bible
Words in Genesis (1962)
Words from the Exodus (1963)
Asimov's Guide to the Bible, vols I and II (1968 and 1969, one-volume ed. 1981)
The Story of Ruth (1972)
Animals of the Bible (1978)
In the Beginning: Science Faces God in the Book of Genesis (1981)
Literature
Words from the Myths (1961)
Asimov's Guide to Shakespeare, vols I and II (1970),
How to Enjoy Writing: A Book of Aid and Comfort (1987), with Janet Asimov
Asimov's Annotated "Don Juan" (1972)
Asimov's Annotated "Paradise Lost"
Familiar Poems, Annotated (1976)
Asimov's The Annotated "Gulliver's Travels" (1980)
Asimov's Annotated "Gilbert and Sullivan" (1988)
Guides
How Did We Find Out series:
How Did We Find Out the Earth is Round? (1973)
How Did We Find Out About Electricity? (1973)
How Did We Find Out About Numbers? (1973)
How Did We Find Out About Dinosaurs? (1973)
How Did We Find Out About Germs? (1974)
How Did We Find Out About Vitamins? (1974)
How Did We Find Out About Comets? (1975)
How Did We Find Out About Energy? (1975)
How Did We Find Out About Atoms? (1976)
How Did We Find Out About Nuclear Power? (1976)
How Did We Find Out About Outer Space? (1977)
How Did We Find Out About Earthquakes? (1978)
How Did We Find Out About Black Holes? (1978)
How Did We Find Out About Our Human Roots? (1979)
How Did We Find Out About Antarctica? (1979)
How Did We Find Out About Oil? (1980)
How Did We Find Out About Coal? (1980)
How Did We Find Out About Solar Power? (1981)
How Did We Find Out About Volcanoes? (1981)
How Did We Find Out About Life in the Deep Sea? (1982)
How Did We Find Out About the Beginning of Life? (1982)
How Did We Find Out About the Universe? (1982)
How Did We Find Out About Genes? (1983)
How Did We Find Out About Computers? (1984)
How Did We Find Out About Robots? (1984)
How Did We Find Out About the Atmosphere? (1985)
How Did We Find Out About DNA? (1985)
How Did We Find Out About the Speed of Light? (1986)
How Did We Find Out About Blood? (1987)
How Did We Find Out About Sunshine? (1987)
How Did We Find Out About the Brain? (1987)
How Did We Find Out About Superconductivity? (1988)
How Did We Find Out About Microwaves? (1989)
How Did We Find Out About Photosynthesis? (1989)
How Did We Find Out About Lasers? (1990)
How Did We Find Out About Neptune? (1990)
How Did We Find Out About Pluto? (1991)
The Complete Science Fair Handbooks (1989), with Anthony D. Fredericks
Humor
Isaac Asimov's Treasury of Humor (1971)
The Sensuous Dirty Old Man (1971), as Dr. A
Asimov Laughs Again: More Than 700 Favorite Jokes, Limericks, and Anecdotes (1992)
Autobiographies
The Autobiography of Isaac Asimov:
In Memory Yet Green: The Autobiography of Isaac Asimov, 1920–1954 (1979, Doubleday)
In Joy Still Felt: The Autobiography of Isaac Asimov, 1954–1978 (1980, Doubleday)
I. Asimov: A Memoir (1994, Doubleday), published posthumously
Yours, Isaac Asimov (1995), published posthumously
It's Been a Good Life (2002, Prometheus Books), published posthumously, condensation of Asimov's three-volume biography edited by his widow, Janet Asimov
Miscellanies
Opus series (Wide-ranging collections issued to celebrate the publication of Asimov's 100th, 200th and 300th books):
Opus 100 (1969),
Opus 200 (1979),
Opus 300 (1984),
Living in the Future (1975)
Isaac Asimov's Book of Facts) (1979),
Isaac Asimov Presents Superquiz series:
Isaac Asimov Presents Superquiz (1982)
Isaac Asimov Presents Superquiz II (1983)
Isaac Asimov Presents Superquiz III (1987)
Isaac Asimov Presents Superquiz IV (1989)
Futuredays: A Nineteenth-Century Vision of the Year 2000 (1986)
See also
Isaac Asimov bibliography (chronological)
Isaac Asimov bibliography (alphabetical)
References
External links
Asimov Online
The Fiction of Isaac Asimov - Part I and Part II at The Internet Time Travel Database
Jenkins’ Spoiler-Laden Guide to Isaac Asimov
Bibliographies by writer
Bibliographies of American writers
Science fiction bibliographies
|
In chemical thermodynamics, isothermal titration calorimetry (ITC) is a physical technique used to determine the thermodynamic parameters of interactions in solution. It is most often used to study the binding of small molecules (such as medicinal compounds) to larger macromolecules (proteins, DNA etc.) in a label-free environment. It consists of two cells which are enclosed in an adiabatic jacket. The compounds to be studied are placed in the sample cell, while the other cell, the reference cell, is used as a control and contains the buffer in which the sample is dissolved.
The technique was developed by H. D. Johnston in 1968 as a part of his Ph.D. dissertation at Brigham Young University, and was considered niche until introduced commercially by MicroCal Inc. in 1988. Compared to other calorimeters, ITC has an advantage in not requiring any correctors since there was no heat exchange between the system and the environment.
Thermodynamic measurements
ITC is a quantitative technique that can determine the binding affinity (), enthalpy changes (), and binding stoichiometry () of the interaction between two or more molecules in solution. This is achieved from integrating the area of the injection peaks and plotting the individual values by molar ratio of the binding event versus \Delta H (kcal/mol). From these initial measurements, Gibbs free energy changes () and entropy changes () can be determined using the relationship:
(where is the gas constant and is the absolute temperature).
For accurate measurements of binding affinity, the curve of the thermogram must be sigmoidal. The profile of the curve is determined by the c-value, which is calculated using the equation:
where is the stoichiometry of the binding, is the association constant and is the concentration of the molecule in the cell. The c-value must fall between 1 and 1000, ideally between 10 and 100. In terms of binding affinity, it would be approximately from ~ within the limit range.
Instrumental measurements
An isothermal titration calorimeter is composed of two identical cells made of a highly efficient thermally conducting and chemically inert material such as Hastelloy alloy or gold, surrounded by an adiabatic jacket. Sensitive thermopile/thermocouple circuits are used to detect temperature differences between the reference cell (filled with buffer or water) and the sample cell containing the macromolecule. Prior to addition of ligand, a constant power (<1 mW) is applied to the reference cell. This directs a feedback circuit, activating a heater located on the sample cell. During the experiment, ligand is titrated into the sample cell in precisely known aliquots, causing heat to be either taken up or evolved (depending on the nature of the reaction). Measurements consist of the time-dependent input of power required to maintain equal temperatures between the sample and reference cells.
In an exothermic reaction, the temperature in the sample cell increases upon addition of ligand. This causes the feedback power to the sample cell to be decreased (remember: a reference power is applied to the reference cell) in order to maintain an equal temperature between the two cells. In an endothermic reaction, the opposite occurs; the feedback circuit increases the power in order to maintain a constant temperature (isothermal operation).
Observations are plotted as the power needed to maintain the reference and the sample cell at an identical temperature against time. As a result, the experimental raw data consists of a series of spikes of heat flow (power), with every spike corresponding to one ligand injection. These heat flow spikes/pulses are integrated with respect to time, giving the total heat exchanged per injection. The pattern of these heat effects as a function of the molar ratio [ligand]/[macromolecule] can then be analyzed to give the thermodynamic parameters of the interaction under study.
To obtain an optimum result, each injection should be given enough time for a reaction equilibrium to reach. Degassing samples is often necessary in order to obtain good measurements as the presence of gas bubbles within the sample cell will lead to abnormal data plots in the recorded results. The entire experiment takes place under computer control.
Direct titration is performed most commonly with ITC to obtain the thermodynamic data, by binding two components of the reaction directly to each other. However, many of the chemical reactions and binding interactions may have higher binding affinity above what is desirable with the c-window. To troubleshoot the limitation of c-window and conditions for certain binding interactions, various different methods of titration can be performed. In some cases, simply doing a reverse titration of changing the samples between the injection syringe and sample cell can solve the issue, depending on the binding mechanism. For most of the high or low affinity bindings require chelation or competitive titration. This method is done by loading pre-bound complex solution in the sample cell, and chelating one of the components out with a reagent of higher observed binding affinity within the desirable c-window.
Analysis and interpretation
Post-hoc analysis and proton inventory
The collected experimental data reflects not only the binding thermodynamics of the interaction of interest, but any contributing competing equilibria associated to it. A post-hoc analysis can be performed to determine the buffer or solvent-independent enthalpy from the experimental thermodynamics, by simply going through the process of Hess’ law. Below example shows a simple interaction between a metal ion (M) and a ligand (L). B represents the buffer used for this interaction and H+ represents protons.M - B <=> M + B -\Delta H_{MB}
L - H <=> L + H+
H+ + B <=> H - B
M + L <=> M - L
Therefore,which can be further processed to calculate the enthalpy of metal-ligand interaction. Although this example is between a metal and a ligand, it is applicable to any ITC experiment, regarding binding interactions.
As a part of the analysis, a number of protons are required to calculate the solvent-independent thermodynamics. This can be easily done by plotting a graph such as shown below.
The linear equation of this plot is the rearranged version of the equation above from the post-hoc analysis in a form of y = mx + b:
Equilibrium constant
Equilibrium constant of the reaction is also not independent from the other competing equilibria. Competition would include buffer interactions and other pH-dependent reactions depending on the experimental conditions. The competition from species other than the species of interest is included in the competition factor, Q in the following equation:where, represents species such a buffer or protons, represents their equilibrium constant, when,
Applications
For the past 30 years, isothermal titration calorimetry has been used in a wide array of fields. In the old days, this technique was used to determine fundamental thermodynamic values for basic small molecular interactions. In recent years, ITC has been used in more industrially applicable areas, such as drug discovery and testing synthetic materials. Although it is still heavily used in fundamental chemistry, the trend has shifted over to the biological side, where label-free and buffer independent values are relatively harder to achieve.
Enzyme kinetics
Using the thermodynamic data from ITC, it is possible to deduce enzyme kinetics including proton or electron transfer, allostery and cooperativity, and enzyme inhibition. ITC collects data over time that is useful for any kinetic experiments, but especially with the proteins due to constant aliquots of injections. In terms of calculation, equilibrium constant and the slopes of binding can be directly utilized to determine the allostery and charge transfer, by comparing experimental data of different conditions (pH, use of mutated peptide chain and binding sites, etc.) .
Membrane and self-assembling peptide studies
Membrane proteins and self-assembly properties of certain proteins can be studied under this technique, due to being a label-free calorimeter. Membrane proteins are known to have difficulties with selection of proper solubilization and purification protocols. As ITC is a non-destructive calorimetric tool, it can be used as a detector to locate the fraction of protein with desired binding sites, by binding a known binding ligand to the protein. This feature also applies in studies of self-assembling proteins, especially in use of measuring thermodynamics of their structural transformation.
Drug development
Binding affinity carries a huge importance in medicinal chemistry, as drugs need to bind to the protein effectively within a desired range. However, determining enthalpy changes and optimization of thermodynamic parameters are hugely difficult when designing drugs. ITC troubleshoots this issue easily by deducing the binding affinity, enthalpic/entropic contributions and its binding stoichiometry.
Chiral chemistry
Applying the ideas above, chirality of organometallic compounds can be deduced as well with this technique. Each chiral compound has its own unique properties and binding mechanisms that are comparable to each other, which leads to differences in thermodynamic properties. By binding chiral solutions in a binding site can deduce the type of chirality and depending on the purpose, which chiral compound is more suitable for binding.
Metal binding interactions
Binding metal ions to protein and other components of biological material is one of the most popular uses of ITC, since ovotransferrin to ferric iron binding study published by Lin et al. from MicroCal Inc. This is due to some of the metal ions utilized in biological systems having d10 electron configuration which cannot be studied with other common techniques such as UV-vis spectrophotometry or electron paramagnetic resonance. It is also closely related to biochemical and medicinal studies due to the large abundance of metal binding enzymes in biological systems.
Carbon nanotubes and related materials
The technique has been well utilized in studying carbon nanotubes to determine thermodynamic binding interactions with biological molecules and graphene composite interactions. Another notable use of ITC with carbon nanotubes is optimization of preparation of carbon nanotubes from graphene composite and polyvinyl alcohol (PVA). PVA assembly process can be measured thermodynamically as mixing of the two ingredients is an exothermic reaction, and its binding trend can be easily observed by ITC.
See also
Differential scanning calorimetry
Dual polarisation interferometry
Sorption calorimetry
Pressure perturbation calorimetry
Surface plasmon resonance
References
Scientific techniques
Biochemistry methods
Biophysics
Chemical thermodynamics
Calorimetry
|
```yaml
main_repo: git://git.ghostscript.com/mupdf.git
homepage: "path_to_url"
language: c++
primary_contact: tor.andersson@artifex.com
fuzzing_engines:
- libfuzzer
- afl
- honggfuzz
sanitizers:
- address
- memory
auto_ccs:
- jonathan@titanous.com
- sebastian.rasmussen@artifex.com
- julians.artifex@gmail.com
- ken.sharp@artifex.com
- robin.watts@artifex.com
```
|
Kirkcudbright Castle, was a castle that was located on the banks of the River Dee, in Kirkcudbright, Scotland.
A motte and bailey castle was built in the 12th century, however this was replaced with another castle in the 13th century to the south west. The castle belonged to the Comyn family but was placed in the care of King Edward I of England. Sir Walter de Corrie became the governor of the castle in 1291 and Richard Siward became the governor of the castle in 1292. King Edward I stayed at the castle in 1300. King Robert the Bruce captured the castle after 1313 and it appears to have been demolished.
Citations
Castles in Dumfries and Galloway
Buildings and structures in Dumfries and Galloway
Demolished buildings and structures in Scotland
Former castles in Scotland
Kirkcudbright
|
```java
/*
*
*
* This is free software: you can redistribute it and/or modify it
*
* This software 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.
*/
package com.wm.remusic.lastfmapi.callbacks;
import com.wm.remusic.lastfmapi.models.LastfmArtist;
public interface ArtistInfoListener {
void artistInfoSucess(LastfmArtist artist);
void artistInfoFailed();
}
```
|
```c++
#include <Functions/FunctionFactory.h>
#include <Functions/FunctionMathUnary.h>
namespace DB
{
namespace
{
struct Log1pName
{
static constexpr auto name = "log1p";
};
using FunctionLog1p = FunctionMathUnary<UnaryFunctionVectorized<Log1pName, log1p>>;
}
REGISTER_FUNCTION(Log1p)
{
factory.registerFunction<FunctionLog1p>();
}
}
```
|
```objective-c
//
// Aspia Project
//
// This program is free software: you can redistribute it and/or modify
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
//
// along with this program. If not, see <path_to_url
//
#ifndef CLIENT_UI_UPDATE_SETTINGS_DIALOG_H
#define CLIENT_UI_UPDATE_SETTINGS_DIALOG_H
#include "base/macros_magic.h"
#include "ui_update_settings_dialog.h"
namespace client {
class UpdateSettingsDialog final : public QDialog
{
Q_OBJECT
public:
UpdateSettingsDialog(QWidget* parent = nullptr);
~UpdateSettingsDialog() final;
private:
Ui::UpdateSettingsDialog ui;
DISALLOW_COPY_AND_ASSIGN(UpdateSettingsDialog);
};
} // namespace client
#endif // CLIENT_UI_UPDATE_SETTINGS_DIALOG_H
```
|
Open Life Sciences is a peer-reviewed open access scientific journal covering all areas of the life sciences. It was established in 2006 as the Central European Journal of Biology and co-published by Versita and Springer Science+Business Media. It obtained its current title in 2014 when it was moved completely to the De Gruyter imprint, at the same time switching to full open access. The editor-in-chief is Mariusz Ratajczak (University of Louisville).
Abstracting and indexing
The journals is abstracted and indexed in:
According to the Journal Citation Reports, the journal has a 2019 impact factor of 0.690.
References
External links
Biology journals
Academic journals established in 2006
Monthly journals
English-language journals
Springer Science+Business Media academic journals
Creative Commons Attribution-licensed journals
De Gruyter academic journals
|
Hypotia meyi is a species of snout moth in the genus Hypotia. It was described by Patrice J.A. Leraut in 2007 and is known from Namibia.
References
Endemic fauna of Namibia
Moths described in 2007
Hypotiini
Insects of Namibia
Moths of Africa
|
This is a list of kingdoms in pre-colonial Africa, which existed before the Scramble for Africa () when most of the continent came under the control of European powers.
Some kingdoms, such as the Kingdom of Ardra in Benin, Buganda in Uganda, or the Kingdom of Bailundo in Angola, still exist today as non-sovereign monarchies, with varying legal and constitutional statuses within their respective countries.
Comparison
Historian Jan Vansina (1962) discusses the classification of Sub-Saharan African Kingdoms, mostly of Central, South and East Africa, with some additional data on West African (Sahelian) Kingdoms distinguishing five types, by decreasing centralization of power:
Despotic Kingdoms: Kingdoms where the king controls the internal and external affairs directly. Examples are Rwanda, Ankole, Busoga and the Kingdom of Kongo in the 16th century.
Regal Kingdoms: Kingdoms where the king controls the external affairs directly, and the internal affairs via a system of overseers. The king and his chiefs belong to the same religion or group.
Incorporative Kingdoms: Kingdoms where the king only controls the external affairs with no permanent administrative links between him and the chiefs of the provinces. The hereditary chiefdoms of the provinces were left undisturbed after conquest. Examples are the Bamileke, Lunda, Luba and Lozi
Aristocratic Kingdoms: the only link between central authority and the provinces is payment of tribute. These kingdoms are morphologically intermediate between regal kingdoms and federations. This type is rather common in Africa, examples including the Kongo of the 17th century, the Cazembe, Luapula, Kuba, Ngonde, Mlanje, Ha, Zinza and Chagga States of the 18th century.
Federations such as the Ashanti Union. Kingdoms where the external affairs are regulated by a council of elders headed by the king, who is simply primus inter pares.
The Islamic empires of North and Northeast Africa do not fall into this categorization and should be discussed as part of the Muslim world.
History periods
Ancient history (3600 BC – AD 500)
Ancient history refers to the time period beginning with the first records in writing, approximately 3600 BC. It ends with the fall of several significant empires, such as the Western Roman Empire in the Mediterranean, the Han Dynasty in China, and the Gupta Empire in India, collectively around 500 AD.
Postclassical Era (AD 500–1500)
The Postclassical Era, also referred to as the Medieval period or, for Europe, the Middle Ages, begins around 500 AD after the fall of major civilizations, covering the advent of Islam. The period ends around 1450–1500, with events like the rise of moveable-type printing in Europe, the voyages of Christopher Columbus, and the Ottoman Empire's conquest of Constantinople.
Modern history (1500–present)
The Modern Period covers human history from the creation of a more global network (i.e. contact between the Americas and Europeans) to present day.
List of African kingdoms
Non-exhaustive list of known pre-colonial kingdoms and empires on the African continent.
North Africa
Ancient
Old Kingdom of Egypt (2686-2181 BC)
Kingdom of Kerma (2500–1500 BC)
Middle Kingdom of Egypt (2040-1650 BC)
New Kingdom of Egypt (1550-1077 BC)
Kingdom of Kush (1070 BC – AD 350)
Late Dynastic Egypt (664-525 BC, 404-343 BC)
Carthaginian Empire (650–146 BC)
Kingdom of Blemmyes (600 BC– AD 3rd c.)
Ptolemaic Kingdom (306–30 BC)
Kingdom of Numidia (202–46 BC)
Kingdom of Mauretania (202 BC – 44 AD)
Kingdom of Nobatia (AD 350–650)
Kingdom of the Vandals and Alans (AD 435–534)
Post-classical
Kingdom of Alodia (7th c.–1504)
Kingdom of Nekor (710–1019)
Barghawata Confederacy (744–1058)
Emirate of Sijilmassa (758–1055)
Rustamid imamate (Algeria, 767–909)
Idrisid dynasty (Morocco, 789–974)
Aghlabids (Tunisia, 800-909)
Fatimid Caliphate (910–1171)
Hammadid dynasty (Algeria, 1014–1152)
Zirid dynasty (Algeria, 1048–1148)
Almoravid dynasty (Morocco, 1040–1147)
Khurasanid dynasty (1059–1128 & 1148–1158)
Almohad dynasty (Morocco, 1121–1269)
Ayyubid dynasty (Egypt, 1171–1254)
Hafsid dynasty (Tunisia, 1229–1574)
Kingdom of Tlemcen (Algeria, 1235–1556)
Marinid dynasty (Morocco, 1248–1465)
Mamluk Sultanate (Egypt, 1250–1517)
Wattasid dynasty (Morocco, 1420–1554)
Modern
Sultanate of Sennar (1504–1821)
Saadi principality of Sus and Tagmadert (1509–1554)
Saadi dynasty (Morocco, 1554–1659)
Naqsid principality of Tetouan (1597–1673)
Sultanate of Darfur (1603–1874 & 1898–1916)
Republic of Bou Regreg (1627–1668)
Alaouite dynasty (Morocco, 1666–current)
Muhammad Ali dynasty (Egypt, 1914–1951)
Senussi dynasty (Libya, 1951–1969)
East Africa
Ancient
Kingdom of Punt (2400–1069 BC)
Kingdom of Dʿmt (c. 980–400 BC)
Aksumite Empire (AD 50–937)
Swahili Coast (AD 50 – ?)
Barbara/Barbaroi city states (1000 BC – AD 5th century)
Macrobian Kingdom (1000 BC – 500 BC)
Post-classical
Harla Kingdom (501-?)
Kingdom of Bazin (9th century)
Kingdom of Semien (325-1627)
Kingdom of Belgin (9th century)
Kingdom of Jarin (9th century)
Kingdom of Qita'a (9th century)
Kingdom of Nagash (9th century )
Kingdom of Tankish (9th century)
Tunni Sultanate (9th century - 13th century))
Sultanate of Showa (896-1286)
Chwezi Empire (940 - 1500)
Kilwa Sultanate (960–1513 CE)
Kingdom of Medri Bahri (1137–1890)
Ethiopian Empire (1137–1974)
Zagwe dynasty (1137–1270)
Solomonic dynasty (1270–1974)
Sultanate of Ifat (1285–1415)
Hadiya Sultanate (13th century-15th century)
Sultanate of Mogadishu (13th century–16th century)
Kingdom of Buganda (1500 – present)
Kingdom of Bunyoro (1500 – present)
Ajuran Sultanate (14th century–17th century)
Kingdom of Kaffa (1390-1897)
Kingdom of Rwanda (1500 – 1959)
Adal Sultanate (1415–1555)
Shilluk Kingdom (1490-present)
Ankole Kingdom (1500 - 1967)
Wanga Kingdom (12th century - 20th century)
Modern
Buganda Kingdom (15th Century- present)
Sennar Sultanate (1502–1821)
Kingdom of Burundi (1680–1966)
Kingdom of Kooki (1720-1896)
Sultanate of the Geledi (late 17th century–late 19th century)
Sultanate of Aussa (fl. 1734–present)
Majeerteen Sultanate (mid-18th century–early 20th century)
Isaaq Sultanate (mid 18th century-late 19th century)
Habr Yunis Sultanate (late 18th century-1907)
Kingdom of Gomma (early 19th century–1886)
Tooro Kingdom (1830-present)
Mbokane Chieftaincy (pre–1745)
Kingdom of Jimma (1830–1932)
Kingdom of Gumma (1840–1902)
Sultanate of Hobyo (1880s–1920s)
Kingdom of Karagwe (19th century-1916)
Kingdom of Unyanyembe (19th century)
Kingdom of Urambo
West Africa
Ancient
Kintampo Complex (2500-1400 BC)
Dhar Tichitt Civilization (1600–300 BC)
Nok Civilization (1000 BC – AD 300)
Djenné-Djenno Civilization (250 BC – AD 900)
Bura Civilization (AD 300–1300)
Ghana Empire (AD 200–1240)
Post-classical
Ghana Empire (AD 200 – AD 1240)
Kingdom of Nri (AD 948 – AD 1911)
Takrur (800s–13th century)
Bonoman (11th–19th century)
Mossi Kingdoms (11th century–1896)
Benin Empire (1180–1897)
Ife Empire (AD 1200 - AD 1420)
Kingdom of Ardra (12th/13th century–present)
Mali Empire (1235–1600)
Oyo Empire (1300-1898)
Akpakip Oro (1200-1909)
Jolof Empire (1350–1549)
Wolof Empire (1350–1889)
Bornu Empire (1380–1893)
Kingdom of Dagbon (1409–?)
Sultanate of Agadez (1449-1900)
Kingdom of Sine (14th–19th century)
Songhai Empire (1464–1591)
Empire of Great Fulo (1490–1776)
Kingdom of Saloum (1494–1969)
Modern
Kingdom of Dagbon (11th Century-Present)
Mamprussi (16th century –?)
Kwararafa Confederacy (1500-1840)
Kaabu Empire (1537–1867)
Kingdom of Cayor (1549–1879)
Kingdom of Jolof (1549-1875)
Kingdom of Baol (1555–1874)
Kingdom of Whydah (1580–1727)
Kingdom of Dahomey (1600–1900)
Asante Union (1670–Present)
Aro Confederacy (1690–1902)
Wémè Kingdom (17th century —?)
Hogbonu Kingdom (17th century —?)
Gbokpoe dynasty (1700-1940)
Kong Empire (1710–1894)
Bamana Empire (1712–1861)
Sokoto Caliphate (1804–1904)
Wukari Federation (1840-1900)
Wassoulou Empire (1878–1898)
Central Africa
Ancient
Sao Civilization (6th century BC – AD 16th century)
Post-classical
Kanem–Bornu Empire (AD 9th century – 1900)
Kingdom of Kongo (1390–1914)
Modern
Mbunda Kingdom (1500-1917)
Sultanate of Bagirmi (1522–1897)
Luba Empire (1585–1885)
Kingdom of Ndongo (16th century–?)
Anziku Kingdom (? - 19th century)
Kasanje Kingdom (1620-1910)
Kingdom of Matamba (1631–1744)
Wadai Empire (1635–1912)
Lunda Empire (1660–1887)
Kingdom of Lunda (1665–1887)
Kuba Kingdom (1625–present)
Bailundo (1700-present)
Viye (1700-present)
Adamawa Emirate (1809-1903)
Yeke Kingdom (1856-1891)
Southern Africa
Post-classical
Kingdom of Mapungubwe (9th century–14th century)
Kingdom of Zimbabwe (900 –1450)
Kingdom of Mutapa (1430–1760)
Kingdom of Butua (1450–1683)
Torwa dynasty (1450–1683)
Kingdom of Maravi (1480-1891)
Modern
Merina Kingdom (1540–1897)
Rozwi Empire (1660–1866)
Ndwandwe Kingdom (1780–1819)
Xhosa Kingdom (13th century-1879)
Mthethwa Paramountcy Godongwane Jobe (18th century–1820)
Zulu Kingdom Senzangakhona, Shaka, Dingana, Mpande, Cetshwayo (1816–1897)
Kingdom of Mthwakazi (1823-1894)
See also
African empires
List of current non-sovereign African monarchs
List of Nigerian traditional states
Monarchies in Africa
References
Bibliography
J. Vansina, A Comparison of African Kingdoms, Africa: Journal of the International African Institute (1962), pp. 324–335.
Turchin, Peter and Jonathan M. Adams and Thomas D. Hall: "East-West Orientation of Historical Empires and Modern States", Journal of World-Systems Research, Vol. XII, No. II, 2006
External links
Haffenreffer Museum of Anthropology
Pre-colonial
Pre-colonial
Africa
Africa-related lists
Africa
Africa
|
```javascript
`hasOwnProperty` method
Weak vs Strict equality operator
Multi-line string variables
Data type comparison in `switch` statements
Using `eval`
```
|
```c++
#include <stdint.h>
#include <stdio.h>
#include <unistd.h>
/* Main header of binary image */
typedef struct {
uint8_t magic;
uint8_t segment_count;
/* flash read mode (esp_image_spi_mode_t as uint8_t) */
uint8_t spi_mode;
/* flash frequency (esp_image_spi_freq_t as uint8_t) */
uint8_t spi_speed: 4;
/* flash chip size (esp_image_flash_size_t as uint8_t) */
uint8_t spi_size: 4;
uint32_t entry_addr;
/* WP pin when SPI pins set via efuse (read by ROM bootloader, the IDF bootloader uses software to configure the WP
* pin and sets this field to 0xEE=disabled) */
uint8_t wp_pin;
/* Drive settings for the SPI flash pins (read by ROM bootloader) */
uint8_t spi_pin_drv[3];
/* Reserved bytes in ESP32 additional header space, currently unused */
uint8_t reserved[11];
/* If 1, a SHA256 digest "simple hash" (of the entire image) is appended after the checksum. Included in image length. This digest
* is separate to secure boot and only used for detecting corruption. For secure boot signed images, the signature
* is appended after this (and the simple hash is included in the signed data). */
uint8_t hash_appended;
} __attribute__((packed)) esp_image_header_t;
typedef struct {
uint32_t load_addr;
uint32_t data_len;
} esp_image_segment_header_t;
/**
* @brief Return a memory area name given an address.
* @param addr The address to decode.
* @return A string description of the memory area.
*/
static const char* area(uint32_t addr) {
if (addr >= 0x3FF80000 && addr <= 0x3FF81FFF) {
return "RTS Fast (8K)";
}
if (addr >= 0x3FF82000 && addr <= 0x3FF8FFFF) {
return "Reserved";
}
if (addr >= 0x3FF90000 && addr <= 0x3FF9FFFF) {
return "Internal ROM 1 (64K)";
}
if (addr >= 0x3FFA0000 && addr <= 0x3FFADFFF) {
return "Reserved";
}
if (addr >= 0x3FFAE000 && addr <= 0x3FFDFFFF) {
return "Internal SRAM 2 (200K)";
}
if (addr >= 0x3FFE0000 && addr <= 0x3FFFFFFF) {
return "Internal SRAM 1 (128K)";
}
if (addr >= 0x40000000 && addr <= 0x40007FFF) {
return "Internal ROM 0 0 (32K)";
}
if (addr >= 0x40008000 && addr <= 0x4005FFFF) {
return "Internal ROM 0 (352K)";
}
if (addr >= 0x40060000 && addr <= 0x4006FFFF) {
return "Reserved";
}
if (addr >= 0x40070000 && addr <= 0x4007FFFF) {
return "Internal SRAM 0 (64K)";
}
if (addr >= 0x40080000 && addr <= 0x4009FFFF) {
return "Internal SRAM 0 (128K)";
}
if (addr >= 0x400A0000 && addr <= 0x400AFFFF) {
return "Internal SRAM 1 (64K)";
}
if (addr >= 0x400B0000 && addr <= 0x400B7FFF) {
return "Internal SRAM 1 (32K)";
}
if (addr >= 0x400B8000 && addr <= 0x400BFFFF) {
return "Internal SRAM 1 (32K)";
}
if (addr >= 0x400C0000 && addr <= 0x400C1FFF) {
return "RTC FAST Memory (8K)";
}
if (addr >= 0x50000000 && addr <= 0x50001FFF) {
return "RTC SLOW Memory (8K)";
}
if (addr >= 0x3F400000 && addr <= 0x3F7FFFFF) {
return "External Memory (Data)";
}
if (addr >= 0x3F800000 && addr <= 0x3FBFFFFF) {
return "External Memory (Data)";
}
if (addr >= 0x400C2000 && addr <= 0x40BFFFFF) {
return "External Memory (Instruction)";
}
return "Un-described";
} //area
int main(int argc, char *argv[]) {
if (argc != 2) {
printf("Usage: %s ESP32_BIN_FILE.bin\n", argv[0]);
return 0;
}
const char* fileName = argv[1];
esp_image_header_t header;
esp_image_segment_header_t imageSegmentHeader;
FILE* file = fopen(fileName, "rb");
if (file == nullptr) {
printf("Failed to open file %s\n", fileName);
return 0;
}
size_t count = fread(&header, sizeof(esp_image_header_t), 1, file);
if (count != 1) {
printf("Failed to read esp_image_header_t\n");
return 0;
}
if (header.magic != 0xE9) {
printf("Failed to find magic number (0xE9) in BIN file header.\n");
return 0;
}
printf("Dump of ESP32 binary file: %s\n", fileName);
printf("magic: 0x%x, segment_count: %d, entry_addr: 0x%x - %s, hash_appended: %d\n",
header.magic, header.segment_count, header.entry_addr, area(header.entry_addr), header.hash_appended);
printf("\n");
printf("Seg | Start | End | Length | Area\n");
printf("----+------------+------------+-------------------+-------------------------------\n");
for (int i=0; i<header.segment_count; i++) {
count = fread(&imageSegmentHeader, sizeof(esp_image_segment_header_t),1, file);
if (count != 1) {
printf("Failed to read esp_image_segment_header_t\n");
return 0;
}
printf("%3d | 0x%8.8x | 0x%8.8x | %6d (0x%6.6x) | %s", i,
imageSegmentHeader.load_addr, imageSegmentHeader.load_addr + imageSegmentHeader.data_len,
imageSegmentHeader.data_len, imageSegmentHeader.data_len, area(imageSegmentHeader.load_addr));
printf("\n");
fseek(file, imageSegmentHeader.data_len, SEEK_CUR);
}
fclose(file);
return 0;
} // main
```
|
```objective-c
/* $OpenBSD: memconf.h,v 1.1 2010/09/20 06:32:30 syuu Exp $ */
/* public domain */
#include <mips64/memconf.h>
```
|
```xml
import type { GroupsWithContactsMap } from '@proton/components/containers/contacts/ContactEmailsProvider';
import type { ContactEmail, ContactGroup } from '@proton/shared/lib/interfaces/contacts';
/**
* Creates a mapping of contact groups to their associated contacts based on label IDs
* Each contact is assigned to one or more groups, forming a structured representation of group memberships.
*/
export const getGroupsWithContactsMap = (contacts: ContactEmail[], contactGroups: ContactGroup[]) =>
contacts.reduce<GroupsWithContactsMap>((acc, contact) => {
contact.LabelIDs?.forEach((labelID) => {
if (acc[labelID]) {
acc[labelID]?.contacts.push(contact);
} else {
const group = contactGroups.find((group) => group.ID === labelID);
if (group) {
acc[labelID] = { group, contacts: [contact] };
}
}
});
return acc;
}, {});
```
|
```java
/*
*
* This program and the accompanying materials are made
* which is available at path_to_url
*
*/
package org.eclipse.milo.opcua.sdk.client.api;
import org.eclipse.milo.opcua.stack.core.types.structured.ServiceFault;
public interface ServiceFaultListener {
/**
* A {@link ServiceFault} has occurred.
*
* @param serviceFault the {@link ServiceFault}.
*/
void onServiceFault(ServiceFault serviceFault);
}
```
|
```xml
export class Utils {
/**
* @type {string}
*/
public static readonly baseMultipleSourcesIdentifiersPrefix: string = 'a';
/**
* @type {string}
*/
public static readonly hexadecimalPrefix: string = '0x';
/**
* @param {string} version
* @param {string} buildTimestamp
* @returns {string}
*/
public static buildVersionMessage (version?: string, buildTimestamp?: string): string {
const isUnknownVersion = !version || !buildTimestamp;
if (isUnknownVersion) {
return 'unknown';
}
const buildDate: string = new Date(parseInt(buildTimestamp, 10)).toISOString();
return `${version}_${buildDate}`;
}
/**
* @param {string} url
* @returns {string}
*/
public static extractDomainFrom (url: string): string {
let domain: string;
if (url.includes('://') || url.indexOf('//') === 0) {
domain = url.split('/')[2];
} else {
domain = url.split('/')[0];
}
domain = domain.split(':')[0];
return domain;
}
/**
* @param {string | undefined} identifiersPrefix
* @param {number} sourceCodeIndex
* @returns {string}
*/
public static getIdentifiersPrefixForMultipleSources (
identifiersPrefix: string | undefined,
sourceCodeIndex: number
): string {
const baseIdentifiersPrefix: string = !!identifiersPrefix
? identifiersPrefix
: Utils.baseMultipleSourcesIdentifiersPrefix;
return `${baseIdentifiersPrefix}${sourceCodeIndex}`;
}
/**
* @param {TObject} enumLikeObject
* @returns {Readonly<TObject>}
*/
public static makeEnum<
TObject extends {[index: string]: TValue},
TValue extends string
> (enumLikeObject: TObject): Readonly<TObject> {
return Object.freeze({...enumLikeObject});
}
}
```
|
Visa requirements for Moldovan citizens are administrative entry restrictions imposed on citizens of Moldova by the authorities of other states. As of 22 December 2022, Moldovan citizens had visa-free or visa on arrival access to 121 countries and territories, ranking the Moldovan passport 48th in terms of travel freedom according to the Henley Passport Index.
On 28 April 2014 Moldovan citizens were granted visa-free entry to 27 Schengen Area countries as well as Bulgaria, Cyprus and Romania, countries that are applying the Schengen policy and also Monaco, San Marino, Andorra and Vatican City, countries that have no immigration control. Visa waiver applies only to holders of biometric passports.
Visa requirements map
Visa requirements
Territories and disputed areas
Visa requirements for Moldovan citizens for visits to various territories, disputed areas, partially recognized countries and restricted zones:
Visas for Cambodia, Myanmar, Rwanda, São Tomé and Príncipe, Senegal, Sri Lanka and Turkey are obtainable online.
Non-visa restrictions
Moldovan passports are recognized by all countries of the world. However, in some rare cases, Moldovan citizens may be refused entry.
Fingerprinting
Several countries including Argentina, Cambodia, Japan, Malaysia, Saudi Arabia, South Korea and the United States demand all passengers to be fingerprinted on arrival.
See also
Visa policy of Moldova
Moldovan passport
References
Notes
Moldova
Foreign relations of Moldova
|
```php
<?php
declare(strict_types=1);
namespace Doctrine\Inflector;
use RuntimeException;
use function chr;
use function function_exists;
use function lcfirst;
use function mb_strtolower;
use function ord;
use function preg_match;
use function preg_replace;
use function sprintf;
use function str_replace;
use function strlen;
use function strtolower;
use function strtr;
use function trim;
use function ucwords;
class Inflector
{
private const ACCENTED_CHARACTERS = [
'' => 'A',
'' => 'A',
'' => 'A',
'' => 'A',
'' => 'Ae',
'' => 'Ae',
'' => 'Aa',
'' => 'a',
'' => 'C',
'' => 'E',
'' => 'E',
'' => 'E',
'' => 'E',
'' => 'I',
'' => 'I',
'' => 'I',
'' => 'I',
'' => 'N',
'' => 'O',
'' => 'O',
'' => 'O',
'' => 'O',
'' => 'Oe',
'' => 'U',
'' => 'U',
'' => 'U',
'' => 'Ue',
'' => 'Y',
'' => 'ss',
'' => 'a',
'' => 'a',
'' => 'a',
'' => 'a',
'' => 'ae',
'' => 'aa',
'' => 'c',
'' => 'e',
'' => 'e',
'' => 'e',
'' => 'e',
'' => 'i',
'' => 'i',
'' => 'i',
'' => 'i',
'' => 'n',
'' => 'o',
'' => 'o',
'' => 'o',
'' => 'o',
'' => 'oe',
'' => 'u',
'' => 'u',
'' => 'u',
'' => 'ue',
'' => 'y',
'' => 'y',
'' => 'A',
'' => 'a',
'' => 'A',
'' => 'a',
'' => 'A',
'' => 'a',
'' => 'C',
'' => 'c',
'' => 'C',
'' => 'c',
'' => 'C',
'' => 'c',
'' => 'C',
'' => 'c',
'' => 'D',
'' => 'd',
'' => 'D',
'' => 'd',
'' => 'E',
'' => 'e',
'' => 'E',
'' => 'e',
'' => 'E',
'' => 'e',
'' => 'E',
'' => 'e',
'' => 'E',
'' => 'e',
'' => 'G',
'' => 'g',
'' => 'G',
'' => 'g',
'' => 'G',
'' => 'g',
'' => 'G',
'' => 'g',
'' => 'H',
'' => 'h',
'' => 'H',
'' => 'h',
'' => 'I',
'' => 'i',
'' => 'I',
'' => 'i',
'' => 'I',
'' => 'i',
'' => 'I',
'' => 'i',
'' => 'I',
'' => 'i',
'' => 'IJ',
'' => 'ij',
'' => 'J',
'' => 'j',
'' => 'K',
'' => 'k',
'' => 'k',
'' => 'L',
'' => 'l',
'' => 'L',
'' => 'l',
'' => 'L',
'' => 'l',
'' => 'L',
'' => 'l',
'' => 'L',
'' => 'l',
'' => 'N',
'' => 'n',
'' => 'N',
'' => 'n',
'' => 'N',
'' => 'n',
'' => 'N',
'' => 'n',
'' => 'N',
'' => 'O',
'' => 'o',
'' => 'O',
'' => 'o',
'' => 'O',
'' => 'o',
'' => 'OE',
'' => 'oe',
'' => 'O',
'' => 'o',
'' => 'R',
'' => 'r',
'' => 'R',
'' => 'r',
'' => 'R',
'' => 'r',
'' => 'S',
'' => 's',
'' => 'S',
'' => 's',
'' => 'S',
'' => 's',
'' => 'S',
'' => 's',
'' => 'T',
'' => 't',
'' => 'T',
'' => 't',
'' => 'T',
'' => 't',
'' => 'U',
'' => 'u',
'' => 'U',
'' => 'u',
'' => 'U',
'' => 'u',
'' => 'U',
'' => 'u',
'' => 'U',
'' => 'u',
'' => 'U',
'' => 'u',
'' => 'W',
'' => 'w',
'' => 'Y',
'' => 'y',
'' => 'Y',
'' => 'Z',
'' => 'z',
'' => 'Z',
'' => 'z',
'' => 'Z',
'' => 'z',
'' => 's',
'' => 'E',
'' => '',
];
/** @var WordInflector */
private $singularizer;
/** @var WordInflector */
private $pluralizer;
public function __construct(WordInflector $singularizer, WordInflector $pluralizer)
{
$this->singularizer = $singularizer;
$this->pluralizer = $pluralizer;
}
/**
* Converts a word into the format for a Doctrine table name. Converts 'ModelName' to 'model_name'.
*/
public function tableize(string $word): string
{
$tableized = preg_replace('~(?<=\\w)([A-Z])~u', '_$1', $word);
if ($tableized === null) {
throw new RuntimeException(sprintf(
'preg_replace returned null for value "%s"',
$word
));
}
return mb_strtolower($tableized);
}
/**
* Converts a word into the format for a Doctrine class name. Converts 'table_name' to 'TableName'.
*/
public function classify(string $word): string
{
return str_replace([' ', '_', '-'], '', ucwords($word, ' _-'));
}
/**
* Camelizes a word. This uses the classify() method and turns the first character to lowercase.
*/
public function camelize(string $word): string
{
return lcfirst($this->classify($word));
}
/**
* Uppercases words with configurable delimiters between words.
*
* Takes a string and capitalizes all of the words, like PHP's built-in
* ucwords function. This extends that behavior, however, by allowing the
* word delimiters to be configured, rather than only separating on
* whitespace.
*
* Here is an example:
* <code>
* <?php
* $string = 'top-o-the-morning to all_of_you!';
* echo $inflector->capitalize($string);
* // Top-O-The-Morning To All_of_you!
*
* echo $inflector->capitalize($string, '-_ ');
* // Top-O-The-Morning To All_Of_You!
* ?>
* </code>
*
* @param string $string The string to operate on.
* @param string $delimiters A list of word separators.
*
* @return string The string with all delimiter-separated words capitalized.
*/
public function capitalize(string $string, string $delimiters = " \n\t\r\0\x0B-"): string
{
return ucwords($string, $delimiters);
}
/**
* Checks if the given string seems like it has utf8 characters in it.
*
* @param string $string The string to check for utf8 characters in.
*/
public function seemsUtf8(string $string): bool
{
for ($i = 0; $i < strlen($string); $i++) {
if (ord($string[$i]) < 0x80) {
continue; // 0bbbbbbb
}
if ((ord($string[$i]) & 0xE0) === 0xC0) {
$n = 1; // 110bbbbb
} elseif ((ord($string[$i]) & 0xF0) === 0xE0) {
$n = 2; // 1110bbbb
} elseif ((ord($string[$i]) & 0xF8) === 0xF0) {
$n = 3; // 11110bbb
} elseif ((ord($string[$i]) & 0xFC) === 0xF8) {
$n = 4; // 111110bb
} elseif ((ord($string[$i]) & 0xFE) === 0xFC) {
$n = 5; // 1111110b
} else {
return false; // Does not match any model
}
for ($j = 0; $j < $n; $j++) { // n bytes matching 10bbbbbb follow ?
if (++$i === strlen($string) || ((ord($string[$i]) & 0xC0) !== 0x80)) {
return false;
}
}
}
return true;
}
/**
* Remove any illegal characters, accents, etc.
*
* @param string $string String to unaccent
*
* @return string Unaccented string
*/
public function unaccent(string $string): string
{
if (preg_match('/[\x80-\xff]/', $string) === false) {
return $string;
}
if ($this->seemsUtf8($string)) {
$string = strtr($string, self::ACCENTED_CHARACTERS);
} else {
$characters = [];
// Assume ISO-8859-1 if not UTF-8
$characters['in'] =
chr(128)
. chr(131)
. chr(138)
. chr(142)
. chr(154)
. chr(158)
. chr(159)
. chr(162)
. chr(165)
. chr(181)
. chr(192)
. chr(193)
. chr(194)
. chr(195)
. chr(196)
. chr(197)
. chr(199)
. chr(200)
. chr(201)
. chr(202)
. chr(203)
. chr(204)
. chr(205)
. chr(206)
. chr(207)
. chr(209)
. chr(210)
. chr(211)
. chr(212)
. chr(213)
. chr(214)
. chr(216)
. chr(217)
. chr(218)
. chr(219)
. chr(220)
. chr(221)
. chr(224)
. chr(225)
. chr(226)
. chr(227)
. chr(228)
. chr(229)
. chr(231)
. chr(232)
. chr(233)
. chr(234)
. chr(235)
. chr(236)
. chr(237)
. chr(238)
. chr(239)
. chr(241)
. chr(242)
. chr(243)
. chr(244)
. chr(245)
. chr(246)
. chr(248)
. chr(249)
. chr(250)
. chr(251)
. chr(252)
. chr(253)
. chr(255);
$characters['out'] = your_sha256_hashy';
$string = strtr($string, $characters['in'], $characters['out']);
$doubleChars = [];
$doubleChars['in'] = [
chr(140),
chr(156),
chr(198),
chr(208),
chr(222),
chr(223),
chr(230),
chr(240),
chr(254),
];
$doubleChars['out'] = ['OE', 'oe', 'AE', 'DH', 'TH', 'ss', 'ae', 'dh', 'th'];
$string = str_replace($doubleChars['in'], $doubleChars['out'], $string);
}
return $string;
}
/**
* Convert any passed string to a url friendly string.
* Converts 'My first blog post' to 'my-first-blog-post'
*
* @param string $string String to urlize.
*
* @return string Urlized string.
*/
public function urlize(string $string): string
{
// Remove all non url friendly characters with the unaccent function
$unaccented = $this->unaccent($string);
if (function_exists('mb_strtolower')) {
$lowered = mb_strtolower($unaccented);
} else {
$lowered = strtolower($unaccented);
}
$replacements = [
'/\W/' => ' ',
'/([A-Z]+)([A-Z][a-z])/' => '\1_\2',
'/([a-z\d])([A-Z])/' => '\1_\2',
'/[^A-Z^a-z^0-9^\/]+/' => '-',
];
$urlized = $lowered;
foreach ($replacements as $pattern => $replacement) {
$replaced = preg_replace($pattern, $replacement, $urlized);
if ($replaced === null) {
throw new RuntimeException(sprintf(
'preg_replace returned null for value "%s"',
$urlized
));
}
$urlized = $replaced;
}
return trim($urlized, '-');
}
/**
* Returns a word in singular form.
*
* @param string $word The word in plural form.
*
* @return string The word in singular form.
*/
public function singularize(string $word): string
{
return $this->singularizer->inflect($word);
}
/**
* Returns a word in plural form.
*
* @param string $word The word in singular form.
*
* @return string The word in plural form.
*/
public function pluralize(string $word): string
{
return $this->pluralizer->inflect($word);
}
}
```
|
```smalltalk
/*
This file is part of the iText (R) project.
Authors: Apryse Software.
This program is offered under a commercial and under the AGPL license.
For commercial licensing, contact us at path_to_url For AGPL licensing, see below.
AGPL licensing:
This program is free software: you can redistribute it and/or modify
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
along with this program. If not, see <path_to_url
*/
using System;
using iText.Commons.Utils;
using iText.StyledXmlParser.Css.Util;
namespace iText.StyledXmlParser.Css {
/// <summary>Class to store a CSS declaration.</summary>
public class CssDeclaration {
/// <summary>The property.</summary>
private String property;
/// <summary>The expression.</summary>
private String expression;
/// <summary>Instantiates a new CSS declaration.</summary>
/// <param name="property">the property</param>
/// <param name="expression">the expression</param>
public CssDeclaration(String property, String expression) {
this.property = ResolveAlias(CssUtils.NormalizeCssProperty(property));
this.expression = CssUtils.NormalizeCssProperty(expression);
}
/* (non-Javadoc)
* @see java.lang.Object#toString()
*/
public override String ToString() {
return MessageFormatUtil.Format("{0}: {1}", property, expression);
}
/// <summary>Gets the property.</summary>
/// <returns>the property</returns>
public virtual String GetProperty() {
return property;
}
/// <summary>Gets the expression.</summary>
/// <returns>the expression</returns>
public virtual String GetExpression() {
return expression;
}
/// <summary>Sets the expression.</summary>
/// <param name="expression">the new expression</param>
public virtual void SetExpression(String expression) {
this.expression = expression;
}
//\cond DO_NOT_DOCUMENT
/// <summary>Resolves css property aliases.</summary>
/// <remarks>
/// Resolves css property aliases.
/// For example, word-wrap is an alias for overflow-wrap property.
/// </remarks>
/// <param name="normalizedCssProperty">css property to be resolved as alias</param>
/// <returns>resolved property if the provided property was an alias, otherwise original provided property.</returns>
internal virtual String ResolveAlias(String normalizedCssProperty) {
if (CommonCssConstants.WORDWRAP.Equals(normalizedCssProperty)) {
return CommonCssConstants.OVERFLOW_WRAP;
}
return normalizedCssProperty;
}
//\endcond
}
}
```
|
Anacithara caelatura is a species of sea snail, a marine gastropod mollusk in the family Horaiclavidae.
Description
The length of the shell attains 4.5 mm, its diameter 2 mm.
(Original description) The small, rather solid shell has a fusiform shape. Its colour is buff, with an indistinct pale ferruginous band on the shoulder. It contains six whorls, rounded above, constricted at the sutures, and contracted at the base. The ribs are perpendicular, narrow, widely spaced, not continuing from whorl to whorl. The number nine on the penultimate whorl, on the body whorl eight. Fine even close-set
spirals overrun the whole shell. The wide aperture is unarmed. The varix is high and broad. The sinus is wide and rather deep. The siphonal canal is short and broad.
Distribution
This marine species is endemic to Australia and occurs off Queensland.
References
External links
Tucker, J.K. 2004 Catalog of recent and fossil turrids (Mollusca: Gastropoda). Zootaxa 682:1–1295.
caelatura
Gastropods of Australia
Gastropods described in 1922
|
Lambertia rariflora, commonly known as green honeysuckle, is a shrub which is endemic to the south-west of Western Australia.
The species was formally described in 1848 by botanist Carl Meisner.
References
Eudicots of Western Australia
rariflora
Endemic flora of Southwest Australia
|
William Mestrezat John (18881962) was an American rancher, short story writer, and novelist.
Early life
John was born in Trinidad, Colorado. He attended Princeton University and graduated in 1910. Among this graduating class, he was one of only six students heralding from west of the Mississippi River.
Career
Later in life, John would return to Colorado, continuing his life as a rancher and farmer. He took up writing, fictionalizing individuals he witnessed in life. Many of his works were set in the fictional Tumbleweed Valley. It is believed that this location may have been based on the "Sunflower Valley" in Las Animas County, Colorado.
His first novel, 1929's Seven Women, garnered critical praise from The New York Times. The Saturday Review praised the book's overall quality, saying the writing was impressive for a debut novel, but they also criticized the characters for being one dimensional. The Bookman'''s brief review somewhat contradicts The Saturday Review, suggesting John successfully justified the ruthless characters, giving readers insight into each woman's worldview. The Philadelphia Inquirer, in a critical notice of Every Wise Woman (1931), described Seven Women as "psychologically acute".
Mere months after his debut novel appeared as a best-seller, his short story "Neither Jew nor Greek" won him an O. Henry Award in 1930, tying with W. R. Burnett's short story, "Dressing Up." The two authors shared equally the $500 prize money. John's second novel, Every Wise Woman (1931), received criticism from The Saturday Review, which described the novel as blunt, monotonous, and less effective than John's previous book. However, John's novel Mingled Yarn (1933) received praise from The Denver Post, with columnist Caroline Bancroft saying, "[John is] fast becoming that of a first-rate humorist in that homely American tradition of which Mark Twain is its outstanding example."
In 1931, John would become an elected officer to the newly formed Colorado Author's League. However, following a non-fatal heart attack, John's writing career effectively concluded in the early 1940s.
Literary works
Novels
Seven Women (1929)
Every Wise Woman (1931)
Mingled Yarn (1933)
Circumstance (1935)
Short stories
"Through Hell," The Century Magazine (September 1926)
"In the Interests of Light and Learnin'," The Century Magazine (September 1927)
"Tilly Tells the Story," The Century Magazine (December 1927)
"Love Germ," The Century Magazine (February 1928)
"Miss Pansy's Pansies," The Century Magazine (July 1928)
"Concernin' Names," The Century Magazine (September 1928)
"That Passeth Understandin'," The Century Magazine (February 1929)
"Vieve's Man," The Century Magazine (April 1929)
"Neither Jew Nor Greek," The Century Magazine (August 1929)
"After All I've Done," Ladies' Home Journal (September 1930)
"I-and-My," Ladies' Home Journal (April 1931)
"Emma and Frank," Scribner's Magazine'' (December 1937)
Literary awards
O. Henry Award, first prize, 1930, for "Neither Jew nor Greek". Tied for first place with W. R. Burnett.
Scholarship foundation
John started a scholarship in honor of his sister, Mary John Goree, who died in 1944. Established in 1947 (only taking effect in 1962 after John's death), The Princeton Goree Scholarship is offered to Las Animas County, Colorado students looking to attend Princeton.
In 2014, the foundation overseeing the scholarship (the Mary John Goree Las Animas County Scholarship Foundation) created a second scholarship called the Las Animas Goree Scholarship, an award offered to students looking to attend colleges other than Princeton.
References
1888 births
1962 deaths
Princeton University alumni
20th-century American novelists
20th-century American male writers
20th-century American short story writers
American male novelists
American male short story writers
Novelists from Colorado
O. Henry Award winners
People from Trinidad, Colorado
|
```css
Disabling default callouts using `webkit-touch-callout`
Responsive images in a layout
Flexbox `justify-content`
Using `flex-grow`
```
|
```c++
/****************************************************************************
* MeshLab o o *
* A versatile mm->cm processing toolbox 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. *
* *
****************************************************************************/
/****************************************************************************
History
$Log: meshedit.cpp,v $
****************************************************************************/
#include <QtGui>
#include <math.h>
#include <stdlib.h>
#include <meshlab/glarea.h>
#include "edit_kinect.h"
#include "ui_kinect.h"
#include <wrap/gl/picking.h>
#include<vcg/complex/append.h>
#include "freenect.h"
#include "shader_basic.h"
#include "calibration_data.h"
#define GL_TEST_ERR\
{\
GLenum eCode;\
if((eCode=glGetError())!=GL_NO_ERROR)\
std::cerr << "OpenGL error : " << gluErrorString(eCode) << " in " << __FILE__ << " : " << __LINE__ << std::endl;\
}
using namespace std;
using namespace vcg;
KinectEditPlugin::KinectEditPlugin() {
cumulate_frames = false;
// n_frame = 1;
ViewMode = VIEW_REAL_TIME;
qFont.setFamily("Helvetica");
qFont.setPixelSize(12);
toinitialize = true;
tilt = 0.0;
mm = NULL;
}
const QString KinectEditPlugin::Info()
{
return tr("Kinect.");
}
void KinectEditPlugin::mousePressEvent(QMouseEvent */*e*/, MeshModel &, GLArea * ) {
// pickx = e->pos().x();
// picky = e->pos().y();
// pick = true;
// start=e->pos();
// cur=start;
};
void KinectEditPlugin::mouseMoveEvent(QMouseEvent */*e*/, MeshModel &, GLArea * ) {
// isDragging = true;
// prev=cur;
// cur=e->pos();
// a->update();
};
void KinectEditPlugin::mouseReleaseEvent(QMouseEvent * , MeshModel & , GLArea * )
{
}
bool KinectEditPlugin::ScanningConverged(){
unsigned short n_avg[640*480];
memset(&frames_avg[0],0,640*480*sizeof(float));
memset(&frames_var[0],0,640*480*sizeof(float));
memset(&n_avg[0],0,640*480*sizeof(unsigned short));
for(unsigned int fi = 0; fi < frames.size(); ++fi)
for(unsigned int i = 0; i < 640*480; ++i)
if(frames[fi].data[i] < 2000){
frames_avg[i] += frames[fi].data[i];
n_avg[i]++;
}
for(unsigned int i = 0; i < 640*480; ++i)
frames_avg[i] /= n_avg[i];
for(unsigned int fi = 0; fi < frames.size(); ++fi)
for(unsigned int i = 0; i < 640*480; ++i)
if(frames[fi].data[i] < 2000)
frames_var[i] += (frames[fi].data[i]-frames_avg[i])*(frames[fi].data[i]-frames_avg[i]);
for(unsigned int i = 0; i < 640*480; ++i)
frames_var[i] /= n_avg[i];
unsigned short ttt[640*480];
for(unsigned int i = 0; i < 640*480; ++i)
ttt[i] = frames_avg[i];
glBindTexture(GL_TEXTURE_2D,gl_depth_tex_avg);
glTexSubImage2D(GL_TEXTURE_2D,0,0,0,640,480,GL_RED,GL_UNSIGNED_SHORT,&ttt[0]);
// just one scan
return (frames.size()==1);
}
void KinectEditPlugin::CleanupGL(){
glDeleteTextures(1, &gl_depth_tex);
glDeleteTextures(1, &gl_depth_tex_avg);
glDeleteTextures(1, &gl_undistort_depth_tex);
glDeleteTextures(1, &gl_undistort_rgb_tex);
glDeleteTextures(1, &gl_color_tex);
glDeleteBuffers(1, &point_cloud);
glDeleteProgram(pr);
}
void KinectEditPlugin::UndistortMaps()
{
/*RGB Undistort Texture, loading on the device*/
glActiveTexture(GL_TEXTURE3);
glGenTextures(1, &gl_undistort_rgb_tex);
glBindTexture(GL_TEXTURE_2D, gl_undistort_rgb_tex);
glTexImage2D(GL_TEXTURE_2D, 0,GL_R32F, 1024, 512, 0, GL_RED, GL_UNSIGNED_SHORT, 0);
glTexParameteri(GL_TEXTURE_2D,GL_TEXTURE_MIN_FILTER,GL_NEAREST);
glTexParameteri(GL_TEXTURE_2D,GL_TEXTURE_MAG_FILTER,GL_NEAREST);
glTexParameteri(GL_TEXTURE_2D,GL_TEXTURE_WRAP_S,GL_CLAMP_TO_EDGE);
glTexParameteri(GL_TEXTURE_2D,GL_TEXTURE_WRAP_T,GL_CLAMP_TO_EDGE);
/*Depth Undistort Texture, loading on the device*/
glActiveTexture(GL_TEXTURE4);
glGenTextures(1, &gl_undistort_depth_tex);
glBindTexture(GL_TEXTURE_2D, gl_undistort_depth_tex);
glTexImage2D(GL_TEXTURE_2D, 0,GL_R32F, 1024, 512, 0, GL_RED, GL_UNSIGNED_SHORT, 0);
glTexParameteri(GL_TEXTURE_2D,GL_TEXTURE_MIN_FILTER,GL_NEAREST);
glTexParameteri(GL_TEXTURE_2D,GL_TEXTURE_MAG_FILTER,GL_NEAREST);
glTexParameteri(GL_TEXTURE_2D,GL_TEXTURE_WRAP_S,GL_CLAMP_TO_EDGE);
glTexParameteri(GL_TEXTURE_2D,GL_TEXTURE_WRAP_T,GL_CLAMP_TO_EDGE);
}
void KinectEditPlugin::InitializeGL(){
/* generate texture to store kinect map*/
glActiveTexture(GL_TEXTURE0);
glGenTextures(1, &gl_depth_tex);
glBindTexture(GL_TEXTURE_2D, gl_depth_tex);
glTexImage2D(GL_TEXTURE_2D, 0,GL_R32F, 1024, 512, 0, GL_RED, GL_UNSIGNED_SHORT, 0);
glTexParameteri(GL_TEXTURE_2D,GL_TEXTURE_MIN_FILTER,GL_NEAREST);
glTexParameteri(GL_TEXTURE_2D,GL_TEXTURE_MAG_FILTER,GL_NEAREST);
glTexParameteri(GL_TEXTURE_2D,GL_TEXTURE_WRAP_S,GL_CLAMP_TO_EDGE);
glTexParameteri(GL_TEXTURE_2D,GL_TEXTURE_WRAP_T,GL_CLAMP_TO_EDGE);
glGenTextures(1, &gl_depth_tex_avg);
glBindTexture(GL_TEXTURE_2D, gl_depth_tex_avg);
glTexImage2D(GL_TEXTURE_2D, 0,GL_R32F, 1024, 512, 0, GL_RED, GL_UNSIGNED_SHORT, 0);
glTexParameteri(GL_TEXTURE_2D,GL_TEXTURE_MIN_FILTER,GL_NEAREST);
glTexParameteri(GL_TEXTURE_2D,GL_TEXTURE_MAG_FILTER,GL_NEAREST);
glTexParameteri(GL_TEXTURE_2D,GL_TEXTURE_WRAP_S,GL_CLAMP_TO_EDGE);
glTexParameteri(GL_TEXTURE_2D,GL_TEXTURE_WRAP_T,GL_CLAMP_TO_EDGE);
glActiveTexture(GL_TEXTURE2);
glGenTextures(1, &gl_color_tex);
glBindTexture(GL_TEXTURE_2D, gl_color_tex);
glTexImage2D(GL_TEXTURE_2D, 0,GL_RGB, 1024, 512, 0, GL_RGB, GL_UNSIGNED_BYTE, 0);
glTexParameteri(GL_TEXTURE_2D,GL_TEXTURE_MIN_FILTER,GL_NEAREST);
glTexParameteri(GL_TEXTURE_2D,GL_TEXTURE_MAG_FILTER,GL_NEAREST);
glTexParameteri(GL_TEXTURE_2D,GL_TEXTURE_WRAP_S,GL_CLAMP_TO_EDGE);
glTexParameteri(GL_TEXTURE_2D,GL_TEXTURE_WRAP_T,GL_CLAMP_TO_EDGE);
/* create the VBO for the vertices */
glGenBuffersARB(1,&point_cloud);
float points[640*480][3];
for(unsigned int i = 0 ; i < 640;++i)
for(unsigned int j = 0 ; j < 480;++j){
points[j*640+i][0] = i/float(1024);
points[j*640+i][1] = j/float(512);
}
glBindBuffer(GL_ARRAY_BUFFER, point_cloud );
glBufferData(GL_ARRAY_BUFFER, 3*sizeof(float)*640*480,&points[0][0], GL_STATIC_DRAW);
GLuint fs, vs;
std::string str_vs =
std::string("varying bool kill;")+
std::string("uniform sampler2D rgb_undistort;")+
std::string("uniform sampler2D depth_undistort;")+
std::string("uniform sampler2D col;")+
std::string("uniform sampler2D dv;")+
std::string("uniform float focal;")+
std::string("uniform mat3 R;")+
std::string("uniform mat3 rgb_intrinsics;")+
std::string("uniform vec3 T;")+
std::string("vec4 point(float X, float Y){")+
std::string(" vec4 pp;")+
std::string(" vec4 p = texture2D(dv,vec2(X,Y));")+
std::string(" pp.z = 0.1236 *tan(p.x*65536.0 / 2842.5 + 1.1863);")+
std::string(" pp.x = (X*1024.0/640.0-0.5)*pp.z * 1.1904;")+
std::string(" pp.y = (Y*512.0/480.0-0.5)*pp.z * 0.8832;")+
std::string(" if( (pp.z> 5.0) || (pp.z < 0.50)) pp.w= 0.0; else pp.w = 1.0;")+
std::string(" return pp;}")+
std::string("vec2 proj_color(vec4 p){")+
std::string(" vec3 pp;")+
std::string(" pp = R * vec3(p.x,p.y,p.z)+T ;")+
std::string(" pp.x = pp.x * rgb_intrinsics[0][0] / pp.z + rgb_intrinsics[0][2];")+
std::string(" pp.y = pp.y * rgb_intrinsics[1][1] / pp.z + rgb_intrinsics[1][2];")+
std::string(" pp.x = pp.x / 1024.f;")+
std::string(" pp.y = pp.y / 512.f;")+
std::string(" return vec2(pp.x,pp.y);}")+
std::string("void main() { ")+
std::string(" vec4 pp = point(gl_Vertex.x,gl_Vertex.y);")+
std::string(" gl_Position = gl_ModelViewProjectionMatrix * pp;")+
std::string(" vec4 p_dx = point(gl_Vertex.x+3.0/1024.0,gl_Vertex.y);")+
std::string(" vec4 p_dy = point(gl_Vertex.x,gl_Vertex.y+3.0/480.0);")+
std::string(" vec3 nn = normalize(cross( p_dx-pp,p_dy-pp));")+
std::string(" nn = gl_NormalMatrix * nn;")+
std::string(" nn = normalize(nn);")+
std::string(" vec2 col_coord = proj_color(pp);")+
std::string(" vec3 lightVec = normalize(gl_LightSource[0].position.xyz);")+
std::string(" float gray = abs(lightVec*nn);")+
// std::string(" vec4 color = texture2D(col,vec2(gl_Vertex.x,gl_Vertex.y));")+
std::string(" vec4 color = texture2D(col,col_coord);")+
// std::string(" vec4 color = texture2D(col,proj_color(pp));")+
// std::string(" gl_FrontColor = vec4(gray,gray,gray,1.0);")+
std::string(" gl_FrontColor = vec4(color.xyz,1.0);")+
std::string(" if(pp.w==0) kill = true;else kill=false;")+
std::string("}");
std::string str_fs =
std::string("varying bool kill;")+
std::string("void main() { ")+
std::string(" gl_FragColor = gl_Color;")+
std::string(" if (kill) discard;")+
std::string("}");
if(Shader::SetFromString(str_vs.c_str(),str_fs.c_str(),fs,vs,pr)==0)
Shader::Validate(pr);
glUseProgram(pr);
GLuint depth_loc = glGetUniformLocation(pr,"dv");
glUniform1i(depth_loc,0);
GLuint col_loc = glGetUniformLocation(pr,"col");
glUniform1i(col_loc,2);
GLuint rgb_dis_loc = glGetUniformLocation(pr,"rgb_undistort");
glUniform1i(rgb_dis_loc,3);
GLuint depth_dis_loc = glGetUniformLocation(pr,"depth_undistort");
glUniform1i(depth_dis_loc,4);
GLuint R_loc = glGetUniformLocation(pr,"R");
glUniformMatrix3fv(R_loc,1,false,&R[0][0]);
GLuint T_loc = glGetUniformLocation(pr,"T");
glUniform3fv(T_loc,1,&T[0]);
GLuint rgb_intrinsics_loc = glGetUniformLocation(pr,"rgb_intrinsics");
glUniformMatrix3fv(rgb_intrinsics_loc,1,false,&rgb_intrinsics[0][0]);
glUseProgram(0);
}
void KinectEditPlugin::Decorate(MeshModel &, GLArea * )
{
if(toinitialize){
InitializeGL();
toinitialize = false;
}
kinect_qt::qbackbuf_mutex.lock();
while ( kinect_qt::got_frames < 2) {
kinect_qt::qwait.wait(& kinect_qt::qbackbuf_mutex);
}
glActiveTexture(GL_TEXTURE0);
if(ViewMode==VIEW_REAL_TIME){
glBindTexture(GL_TEXTURE_2D,gl_depth_tex);
glTexSubImage2D(GL_TEXTURE_2D,0,0,0,640,480,GL_RED,GL_UNSIGNED_SHORT,&kinect_qt::gl_depth_front[0]);
}
glActiveTexture(GL_TEXTURE2);
glBindTexture(GL_TEXTURE_2D,gl_color_tex);
if(ViewMode==VIEW_REAL_TIME)
glTexSubImage2D(GL_TEXTURE_2D,0,0,0,640,480,GL_RGB,GL_UNSIGNED_BYTE,&kinect_qt::gl_rgb_back[0]);
else
glTexSubImage2D(GL_TEXTURE_2D,0,0,0,640,480,GL_RGB,GL_UNSIGNED_BYTE,&rgb_stored[0]);
if(cumulate_frames){
frames.push_back(Frame());
memcpy(&frames.back().data[0],&kinect_qt::gl_depth_front[0], sizeof(kinect_qt::gl_depth_front));
if( ScanningConverged()){
cumulate_frames = false;
frames.clear();
memcpy(&rgb_stored[0],&kinect_qt::gl_rgb_back[0],640*480*4);
}
}
kinect_qt::qbackbuf_mutex.unlock();
glActiveTexture(GL_TEXTURE0);
if(ViewMode==VIEW_REAL_TIME)
glBindTexture(GL_TEXTURE_2D,gl_depth_tex);
else
glBindTexture(GL_TEXTURE_2D,gl_depth_tex_avg);
glBindBufferARB(GL_ARRAY_BUFFER_ARB, point_cloud);
glEnableClientState(GL_VERTEX_ARRAY);
glVertexPointer(3, GL_FLOAT, 0, 0);
glUseProgram(pr);
glDrawArrays(GL_POINTS,0,640*480);
glDisableClientState(GL_VERTEX_ARRAY); // deactivate vertex array
glUseProgram(0);
}
void KinectEditPlugin::loadCalibration(){
QString filename = QFileDialog::getOpenFileName((QWidget*)0,tr("Open YML"), QDir::currentPath(),
tr("Ocm file (*.yml )"));
if(!filename.isEmpty())
if(!::LoadCalibrationData(filename))
::LoadCalibrationData("default_calibration.yml");
UndistortMaps();
}
void KinectEditPlugin::startScan(){
cumulate_frames = true;
odw->vsmRadioButton->setChecked(true);
odw->vrtRadioButton->setChecked(false);
ViewMode = VIEW_SCANNED_MODEL;
}
void KinectEditPlugin::stopScan(){
cumulate_frames = false;
frames.clear() ;
}
void KinectEditPlugin::setViewMode(){
if(odw->vsmRadioButton->isChecked())
ViewMode = VIEW_SCANNED_MODEL;
else
ViewMode = VIEW_REAL_TIME;
}
void KinectEditPlugin::setTilt(double v){
tilt = v;
kinect_qt::set_tilt_degs(v);
}
vcg::Point3f Point(float v, float X, float Y){
vcg::Point3f pp;
pp[2] = 0.1236 *tan(v / 2842.5 + 1.1863);
pp[0] = (X - 640 / 2) * pp[2] * 0.00186;
pp[1] = (Y - 480 / 2) * pp[2] * 0.00184;
return pp;
}
void KinectEditPlugin::saveScan(){
mm = (MeshModel*)1;
mm = gla->md()->addNewMesh("Kinect Mesh",false);
CMeshO::VertexIterator vi =
vcg::tri::Allocator<CMeshO>::AddVertices(mm->cm,640*480);
mm->updateDataMask( MeshModel::MM_VERTCOLOR|MeshModel::MM_VERTQUALITY);
for(unsigned int i = 0; i < 640; ++i)
for(unsigned int j = 0; j < 480; ++j){
(*vi).P() = Point(frames_avg[j*640+i],i,j);
(*vi).Q() = 1.0/(frames_var[j*640+i]+1);
(*vi).C() = vcg::Color4b(rgb_stored[3*(j*640+i)], rgb_stored[3*(j*640+i)+1],rgb_stored[3*(j*640+i)+2],255);
if((*vi).P()!=(*vi).P())
vcg::tri::Allocator<CMeshO>::DeleteVertex(mm->cm,*vi);
vi++;
}
mm->cm.bbox.Add(vcg::Point3f(-3,4,5));
mm->cm.bbox.Add(vcg::Point3f(3,-4,0));
}
bool KinectEditPlugin::StartEdit(MeshModel &/*m*/, GLArea *_gla )
{
gla = _gla;
DefaultCalibrationData();
odw = new Ui::KinectDockWidget ();
kinect_panel = new QDockWidget(gla);
odw->setupUi(kinect_panel);
kinect_panel->show();
kinect_qt::start_kinect();
QObject::connect(odw->loadCalibrationPushButton,SIGNAL(clicked()),this,SLOT(loadCalibration()));
QObject::connect(odw->startScanPushButton,SIGNAL(clicked()),this,SLOT(startScan()));
QObject::connect(odw->saveScanPushButton,SIGNAL(clicked()),this,SLOT(saveScan()));
QObject::connect(odw->vrtRadioButton,SIGNAL(clicked()),this,SLOT(setViewMode()));
QObject::connect(odw->vsmRadioButton,SIGNAL(clicked()),this,SLOT(setViewMode()));
QObject::connect(odw->tiltSpinBox,SIGNAL(valueChanged(double)),this,SLOT(setTilt(double)));
odw->vrtRadioButton->setChecked(true);
QTimer *timer = new QTimer(this);
connect(timer, SIGNAL(timeout()), _gla, SLOT(update()));
timer->start(50);
{
this->curr_track.track.tra=gla->trackball.track.tra ;
this->curr_track.track.sca=gla->trackball.track.sca ;
this->curr_track.track.rot=gla->trackball.track.rot ;
vcg::Quaternionf q; q.FromEulerAngles(3.14,0,0);
gla->trackball.Reset();
float newScale= 3.0f/5.0;
gla->trackball.track.sca = newScale;
gla->trackball.track.tra = vcg::Point3f(0,0,-2.5);
gla->trackball.track.rot = q;
}
return true;
}
void KinectEditPlugin::EndEdit(MeshModel &/*m*/, GLArea *gla )
{
//if(mm) return;
kinect_panel->hide();
kinect_qt::stop_kinect();
toinitialize = true;
{
gla->trackball.track.tra = this->curr_track.track.tra;
gla->trackball.track.sca = this->curr_track.track.sca;
gla->trackball.track.rot = this->curr_track.track.rot;
}
}
void KinectEditPlugin::setTrackBall(){
// gla->trackball.Reset();
// float newScale= 3.0f/ocme_bbox.Diag();
// gla->trackball.track.sca = newScale;
// gla->trackball.track.tra = -ocme_bbox.Center();
}
void KinectEditPlugin::resetPlugin(){
}
```
|
The German invasion of Luxembourg was part of Case Yellow (), the German invasion of the Low Countries—Belgium, Luxembourg and the Netherlands—and France during World War II. The battle began on 10 May 1940 and lasted just one day. Facing only light resistance, German troops quickly occupied Luxembourg. The Luxembourgish government, and Grand Duchess Charlotte, managed to escape the country and a government-in-exile was created in London.
Background
On 1 September 1939 Germany invaded Poland, initiating World War II. This put Luxembourg's Grand Ducal government in a delicate situation. On one hand, the population's sympathies laid with the UK and France; on the other hand, due to the country's policy of neutrality since the Treaty of London in 1867, the government adopted a careful non-belligerent stance towards its neighbours. In accordance with the treaty's restrictions, the only military force Luxembourg maintained was its small Volunteer Corps under Captain Aloyse Jacoby, reinforced by the Grand Ducal Gendarmerie under Captain Maurice Stein. Together they formed the Corps des Gendarmes et Volontaires under Major-Commandant Émile Speller.
At noon on 1 September Radio Luxembourg announced that in order for the country to remain unambiguously neutral it would cease broadcasting. Exceptions were a daily 20 minute-long message at midday and in the evening reserved for government announcements. For the rest of the month, the government supplied full transcripts of its broadcasts to the foreign legations in the country. Later that day several German stations posed as Radio Luxembourg by broadcasting in the Luxembourgian wavelength, making, in the opinion of United States Chargé d'Affaires George Platt Waller, "grossly unneutral announcements". On the evening of 21 September, the Grand Ducal government suspended all broadcasts pending the resolution of the war.
On 14 September the volunteer corps was bolstered by the addition of a 125-strong auxiliary unit. German military manoeuvres and river traffic made the population increasingly nervous, so in the spring of 1940 fortifications were erected along the borders with Germany and France. The so-called Schuster Line, named after its chief constructor, consisted of 41 sets of concrete blocks and iron gates; 18 bridgeblocks on the German border, 18 roadblocks on the German border, and five roadblocks on the French border. Since the Corps des Gendarmes et Volontaires had no pioneer unit, construction fell to the responsibility of civilian engineers, while technical advice was sought from the French, who took great interest in the line's establishment. A series of nine radio outposts were established along the German border, each manned by gendarmes, with a central radio receiver in Captain Stein's official office near the volunteers' Saint-Esprit Barracks in the capital. On 4 January 1940, the Cabinet convened under Grand Duchess Charlotte and outlined steps to be taken in the event of a German invasion. Charlotte decided that if possible she and the government would flee abroad in the event of an attack to advocate for the country's sovereignty. During World War I, her elder sister and then-Grand Duchess Marie-Adélaïde had elected to stay during Germany's occupation of the country, bringing the monarchy into disrepute; Charlotte wanted to avoid such problems. The government moved some of the country's gold reserves to Belgium, and began stockpiling funds in its Brussels and Paris legations in the event it was forced to flee due to German attack. The Paris legation was also given a sealed envelope detailing a formal request of military assistance from the French government in case communications were cut-off in an invasion.
After several false alarms in the spring of 1940, the probability of a military conflict between Germany and France grew. Germany stopped the export of coke for the Luxembourgish steel industry. Abwehr agents under Oskar Reile infiltrated the country, posing as tourists. This was observed by Captain Fernand Archen, an undercover senior French intelligence officer in Luxembourg City, posing as a wine merchant. He reported his findings to his superiors at Longwy on 7 May, understanding that the agents were to be used to seize key bridges over the Sauer, Moselle and Our rivers. Luxembourg authorities also took notice, and Captain Stein worked to stop the Germans' activities. On 3 March, the French Third Army was ordered to occupy Luxembourg in the event of a German attack.
Prelude
On the evening of 8 May, the Grand Ducal Government ordered for the first time that all doors of the Schuster Line be closed at 11:00 and remain so regardless of circumstance until 06:00 the following morning. Throughout the day Luxembourgian authorities witnessed much less activity on the far side of the border and made no reports of tank or machine gun movements. On the afternoon of 9 May, a French intelligence officer stationed in Clervaux witnessed German troops preparing pontoon bridges in the Sauer. He attempted in vain to contact Captain Archen, and resorted to making a direct phone call to his superiors at Longwy. Also that day a German national working in Luxembourg as a gardener and a member of the German fifth column warned his Luxembourgish employer, Carlo Tuck, that an invasion was impending. Tuck passed the warning on to government officials. Late that evening, the Grand Ducal government came into possession of a document from a German divisional command. Dated 23 April 1940, it detailed the division's chief of staff's orders to various units to occupy strategic points within the country. The Grand Ducal government put all border posts and Grand Ducal Gendarmerie stations on full alert. In Luxembourg City, gendarmes mobilised to defend public buildings and dispatched vehicle patrols to arrest fifth columnists. The economic councillor and the chancellor of the German legation were detained for questioning regarding allegations that they had used legation cars to organise subversive activities within the country. Since an invasion had not yet occurred they still enjoyed diplomatic privilege and the police were forced to release them. One group of fifth columnists was arrested while attempting to reach the legation. Meanwhile, Captain Archen had received his subordinate's report, but by that point, he had been told by informants in the Gendarmerie that shots had been exchanged with German operatives at a remote farm near the Moselle. At 11:45 on 9 May he radioed Longwy: "Reports of important German troop movements on the German-Luxembourg frontier." Throughout the night his messages became more and more frantic. Two Luxembourgish customs officials at Wormeldange heard horses and soldiers across the Moselle, but were unable to make out the Germans' activities due to heavy fog.
At around midnight, Captain Stein, Minister of Justice Victor Bodson, and Police Commissioner Joseph Michel Weis held an emergency meeting. Bodson requested that the capital be reinforced by gendarmes from the south, and told Weis to forward this information to the capital's district commissioner to give the necessary orders. Weis later tried to contact the district commissioner by phone, but failed to reach him; reinforcements never came. A short time later the gendarmes at Diekirch were ordered to patrol the local railway bridge and be wary of unfamiliar persons. Luxembourgian authorities received the first reports of exchanged fire at around 02:00 on 10 May when two gendarmes were ambushed near the German border by plainclothes agents. The Germans retreated to the Fels mill near Grevenmacher and around 20 soldiers who volunteered were dispatched to arrest them. The government then ordered all steel doors along the border locked. At 02:15 soldiers stationed in Bous were attacked by Germans in civilian clothes. One soldier was badly injured, as was one German who was detained. Shortly thereafter a gendarmerie lieutenant and his chauffeur were ambushed and exchanged fire with German-speaking cyclists; no one was hurt. Fifth columnists successfully severed the telephone wires between the capital and the border posts, forcing the gendarmes to communicate via shortwave radio. German agents gradually seized the radio stations; the last post to fall, in Wasserbillig, transmitted until the Germans breached the operating room.
The steel doors of the Schuster Line were ordered closed on 10 May 1940 at 03:15, following reports of movement of German troops on the east side of the border rivers Our, Sauer, and Moselle. At 03:30 Luxembourgian authorities released interned French pilots and German deserters. The Royal Family was evacuated from its residence in Colmar-Berg to the Grand Ducal palace in Luxembourg City. Around 30 minutes later, at dawn, German planes were spotted flying over Luxembourg City towards Belgium.
Invasion
The German invasion began at 04:35 when the 1st, 2nd, and 10th Panzer Divisions crossed the border at Wallendorf-Pont, Vianden, and Echternach respectively. Wooden ramps were used to cross over the Schuster Line's tank traps. Fire was exchanged, but the Germans did not encounter any significant resistance except for some bridges destroyed and some land mines since the majority of the Luxembourgish Volunteer Corps stayed in their barracks. The border was defended only by soldiers who had volunteered for guard duty and gendarmes. A handful of Germans secured the bridge at Wormeldange and captured the two customs officers there, who had demanded that they halt but refrained from opening fire. The partly demolished bridge over the Sauer at Echternach was quickly repaired by engineers of the Großdeutschland regiment, allowing the passage of the 10th Panzer Division. Planes flew overhead, heading for Belgium and France, though some stopped and landed troops within the country.
Captain Archen repeatedly alerted his superiors at Longwy of the invasion, but his reports never reached the 3rd Army at Metz. General Charles Condé, the army's commander, was unclear about the situation and at 05:30 dispatched aerial reconnaissance units to investigate. At 06:00 the French 3rd Light Cavalry Division was ordered to intervene.
Telephone and radio messages from the border posts to the Gendarmerie and Volunteer Corps headquarters informed the Luxembourgish government and Grand Ducal court of the invasion. Foreign Minister Joseph Bech, in the presence of Prime Minister Pierre Dupong, attempted to contact the German ambassador at the legation and at his private residence, but they were informed that he was present at neither. At 06:30 the majority of the government, including Dupong and Bech, evacuated the capital by motorcade to the border town of Esch. Bodson stayed behind at the Saint-Esprit Barracks to monitor the situation. In Esch a group of 125 German special operations troops had landed by Fieseler Storch, with orders to hold the area until the main invasion force arrived. A gendarme confronted the soldiers and asked that they leave, but he was taken prisoner. The government motorcade encountered a roadblock at a crossroads manned by German units, and was forced to detour through the countryside to avoid capture. French Ambassador Jean Tripier followed the government party but was stopped by the Germans and forced to return to the capital. Belgian Ambassador Kervyn de Meerendré was also stopped by German soldiers at the border and ordered to turn back, as was the Luxembourgish Minister of Education, Nicolas Margue, who had attempted to escape by taxi. Bodson later fled the capital and, having learned many of the secondary roads by memory, was able to avoid German roadblocks and navigate his way to France.
Following consultation with her ministers, Grand Duchess Charlotte decided to abandon the palace. Accompanied by her husband, Prince Felix, her mother, Dowager Grand Duchess Marie Anne, and members of the Grand-Ducal suite, she departed for the border village of Redange. After a brief stop, her party crossed the border at 07:45. Meanwhile, Hereditary Grand Duke Jean and two of his sisters, accompanied by an aide-de-camp, Guillaume Konsbruck, were to wait at the border for confirmation of occupation. Around 08:00 the prime minister and his entourage passed over the border before making contact with French troops at Longlaville. Last minute telephone calls with Luxembourg City revealed the capital to be completely surrounded.
Charlotte's party was able to link up with the government motorcade at Longwy. Meanwhile, Jean's party's car was strafed by a German aircraft while stopped at a cafe. Near Esch, the group was delayed by a German roadblock, and they escaped when their chauffeur drove straight through the soldiers. The party ultimately joined Charlotte and the Grand Ducal government at Sainte-Menehould.
At 08:00, elements of the French 3rd Light Cavalry Division under General Petiet, supported by the 1st Spahi Brigade under Colonel Jouffault and the 2nd company of the 5th Armoured Battalion, crossed the southern border to conduct a probe of German forces; these units later retreated behind the Maginot Line. Five Spahis were killed. British Air Marshal Arthur Barratt, impatient with the reluctance of the French Air Force to conduct air strikes, ordered a flight of Fairey Battle bombers from the 226 Squadron to attack German tank columns. They went unescorted and encountered heavy anti-aircraft fire. Most were damaged by flak but managed to escape. One received a direct hit and crashed near Bettendorf. German soldiers pulled the three injured crew from the burning wreckage, one of whom later died in a local hospital.
The Grand Ducal Gendarmerie resisted the German troops, but to little avail; the capital city was occupied before noon. The Gendarmerie chain of command in the south was thrown into disarray by the influx of refugees and the arrival of German and French troops. Most gendarmes escorted refugees over the border, while some abandoned their posts and fled to France. Total Luxembourgish casualties amounted to six gendarmes and one soldier wounded, while 22 soldiers (six officers and 16 non-commissioned officers) and 54 gendarmes were captured.
By the evening of 10 May 1940, most of the country, with the exception of the south, was occupied by German forces. More than 90,000 civilians fled from the canton of Esch-sur-Alzette as a consequence of the advance. 47,000 evacuated to France, 45,000 poured into the central and northern part of Luxembourg.
Aftermath
On 11 May the Grand Ducal government reached Paris and installed itself in the Luxembourg legation. Fearing German aerial attack and finding the small facilities unsuitable, the government moved further south, first to Fontainebleau, and then Poitiers. It later moved to Portugal and the United Kingdom, before finally settling in Canada for the duration of the war. In exile, Charlotte became an important symbol of national unity. Her eldest son and heir, Jean, volunteered for the British Army in 1942. The only official representative left behind was , head of the Ministry of State Affairs, as well as the 41 deputies.
By the end of May Wehrer and several high ranking functionaries established a provisional "Administrative Commission" to govern Luxembourg in lieu of the Grand Ducal family and the other ministers. Wehrer retained the Ministry of State Affairs and assumed responsibility for Foreign Relations and Justice; Jean Metzdorf held the portfolios for Interior, Transportation, and Public Works; Joseph Carmes managed Finance, Labour, and Public Health; Louis Simmer oversaw Education, and Mathias Pütz directed Agriculture, Viticulture, Commerce, and Industry.
In the days after the invasion Luxembourgian officers walked about the capital freely, though the regular soldiers were mostly confined to their barracks. Colonel Speller was briefly incarcerated by the Gestapo, though he was later released under close supervision.
Notes
Citations
References
Further reading
invasion
1940 in Luxembourg
Battles and operations of World War II involving France
Battles and operations of World War II involving Germany
Luxembourg
Invasions of Luxembourg
Luxembourg
Germany–Luxembourg military relations
May 1940 events
Battles involving Luxembourg
|
Klamp is a municipality in the district of Plön, in Schleswig-Holstein, Germany. It has a population of around 800.
References
Municipalities in Schleswig-Holstein
Plön (district)
|
```python
import pytest
class TestPerlcritic:
@pytest.mark.complete("perlcritic ")
def test_1(self, completion):
assert completion
@pytest.mark.complete("perlcritic --", require_cmd=True)
def test_2(self, completion):
assert completion
@pytest.mark.complete("perlcritic --theme ", require_cmd=True)
def test_3(self, completion):
assert completion
```
|
The 1991 Hong Kong District Board elections were held on 3 March 1991. Elections were held in all 19 districts of Hong Kong for 274 members from directly elected constituencies, which counted for about two-thirds of the seats in the District Boards.
It was the first of the three-tier elections in 1991, followed by the May Urban and Regional Council elections and the September Legislative Council election in which direct elections would be introduced for the first time. In preparation for these elections, both the liberal pro-democracy and conservative pro-business forces formed political parties to the contest in the coming elections. The pro-democracy party United Democrats of Hong Kong (UDHK) formed as a grand alliance for the pro-democrats in April 1990, the more middle-class oriented Hong Kong Democratic Foundation (HKDF) formed in October 1989 and the pro-business conservative Liberal Democratic Federation of Hong Kong (LDF) formed in November 1990.
About 420,000 voters cast their votes, which counted for 32.5 per cent of the total electorate, higher than the 30.3 per cent of the previous 1988 elections but lower than the 38.9 per cent in the first District Board elections in 1982. 81 incumbents were elected without contest. 70 pre cent of the candidates were affiliated with political groups and public organisations. The newly established liberal United Democrats emerged as the biggest winner in the election, winning 56 seats out of 80 candidates which won evenly in each region. The conservative Liberal Democratic Federation claimed to have won 50 seats out of 89 candidates, although many of them ran as independents of whom only 35 openly acknowledged their LDF affiliation. Three of the seven candidates from the Democratic Foundation got elected, while the other pro-democracy groups, the Meeting Point won 11 out of 13 bids and the Association for Democracy and People's Livelihood (ADPL) got 14 out of 17 candidates elected.
Out of 30 pro-Beijing candidates who contested in the election, 24 of whom were elected, including each five candidates in Eastern District and Kwun Tong, eight candidates and eight other Beijing-friendly candidates in Kowloon Central. The pro-Beijing Hong Kong Federation of Trade Unions also fielded 16 candidates, of whom 12 were elected, despite most of them ran under their local affiliations and only three of them ran openly with FTU endorsement. The satisfying results encouraged the pro-China camp to field their own candidates in the coming Urban Council and Legislative Council elections.
After the elections, Governor David Wilson appointed 140 members to the District Boards.
Results
General outcome
|-
! style="background-color:#E9E9E9;text-align:center;" colspan=2 |Political Affiliation
! style="background-color:#E9E9E9;text-align:right;" |Popular vote
! style="background-color:#E9E9E9;text-align:right;" |%
! style="background-color:#E9E9E9;text-align:right;" |Standing
! style="background-color:#E9E9E9;text-align:right;" |Elected
|-
| width=1px style="background-color: " |
| style="text-align:left;" |United Democrats of Hong Kong
| 109,747 || 20.64 || 75 || 52
|-
| width=1px style="background-color: " |
| style="text-align:left;" |Liberal Democratic Federation of Hong Kong
| 47,633 || 8.96 || 51 || 24
|-
| width=1px style="background-color: " |
| style="text-align:left;" |Hong Kong Association for Democracy and People's Livelihood
| 27,979 || 5.26 || 19 || 15
|-
| width=1px style="background-color: " |
| style="text-align:left;" |Hong Kong Civic Association
| 24,760 || 4.66 || 21 || 11
|-
| width=1px style="background-color: " |
| style="text-align:left;" |Meeting Point
| 18,386 || 3.46 || 13 || 11
|-
|style="background-color:#6495ED"|
| style="text-align:left;" | Tsing Yi Concern Group
| 8,360 || 1.57 || 4 || 4
|-
|style="background-color:"|
| style="text-align:left;" |Hong Kong Federation of Trade Unions
| 6,229 || 1.17 || 4 || 4
|-
|style="background-color:"|
| style="text-align:left;" |Tuen Mun Forth Reviewers
| 9,161 || 1.72 || 4 || 3
|-
|style="background-color:"|
| style="text-align:left;" |Hong Kong Democratic Foundation
| 8,667 || 1.63 || 7 || 3
|-
| width=1px style="background-color: " |
| style="text-align:left;" |Neighbourhood and Worker's Service Centre
| 5,978 || 1.12 || 2 || 2
|-
|style="background-color:#9E5238"|
| style="text-align:left;" |Kwun Tong Man Chung Friendship Promotion Association
| 2,231 || 0.42 || 2 || 2
|-
|style="background-color:#CC0000"|
| style="text-align:left;" |October Review
| 2,382 || 0.45 || 1 || 1
|-
| width=1px style="background-color: " |
| style="text-align:left;" |Reform Club of Hong Kong
| 2,136 || 0.40 || 1 || 1
|-
| width=1px style="background-color: " |
| style="text-align:left;" |Hong Kong and Kowloon Trades Union Council
| 1,982 || 0.37 || 1 || 1
|-
| width=1px style="background-color: " |
| style="text-align:left;" |Hong Kong Citizen Forum
| 1,276 || 0.24 || 3 || 1
|-
|style="background-color:"|
| style="text-align:left;" |Independent and others
| 256,081 || 48.16 || 261 || 137
|-
|style="text-align:left;background-color:#E9E9E9" colspan="2"|Total (turnout 32.47%)
|width="75" style="text-align:right;background-color:#E9E9E9"|531,712
|width="30" style="text-align:right;background-color:#E9E9E9"|100.0
|style="text-align:right;background-color:#E9E9E9"|467
|style="text-align:right;background-color:#E9E9E9"|272
|}
Note: Some of the candidates with multiple affiliations are overlapped in this chart.
Vote summary
Seat summary
References
Hong Kong
Local elections
1991
Hong Kong local elections
Hong Kong local elections
|
```javascript
ace.define("ace/mode/verilog",["require","exports","module","ace/lib/oop","ace/mode/text","ace/tokenizer","ace/mode/verilog_highlight_rules","ace/range"],function(e,t,n){var r=e("../lib/oop"),i=e("./text").Mode,s=e("../tokenizer").Tokenizer,o=e("./verilog_highlight_rules").VerilogHighlightRules,u=e("../range").Range,a=function(){this.HighlightRules=o};r.inherits(a,i),function(){this.lineCommentStart="//",this.blockComment={start:"/*",end:"*/"}}.call(a.prototype),t.Mode=a}),ace.define("ace/mode/verilog_highlight_rules",["require","exports","module","ace/lib/oop","ace/mode/text_highlight_rules"],function(e,t,n){var r=e("../lib/oop"),i=e("./text_highlight_rules").TextHighlightRules,s=function(){var e="always|and|assign|automatic|begin|buf|bufif0|bufif1|case|casex|casez|cell|cmos|config|deassign|default|defparam|design|disable|edge|else|end|endcase|endconfig|endfunction|endgenerate|endmodule|endprimitive|endspecify|endtable|endtask|event|for|force|forever|fork|function|generate|genvar|highz0|highz1|if|ifnone|incdir|include|initial|inout|input|instance|integer|join|large|liblist|library|localparam|macromodule|medium|module|nand|negedge|nmos|nor|noshowcancelled|not|notif0|notif1|or|output|parameter|pmos|posedge|primitive|pull0|pull1|pulldown|pullup|pulsestyle_onevent|pulsestyle_ondetect|rcmos|real|realtime|reg|release|repeat|rnmos|rpmos|rtran|rtranif0|rtranif1|scalared|showcancelled|signed|small|specify|specparam|strong0|strong1|supply0|supply1|table|task|time|tran|tranif0|tranif1|tri|tri0|tri1|triand|trior|trireg|unsigned|use|vectored|wait|wand|weak0|weak1|while|wire|wor|xnor|xorbegin|bufif0|bufif1|case|casex|casez|config|else|end|endcase|endconfig|endfunction|endgenerate|endmodule|endprimitive|endspecify|endtable|endtask|for|forever|function|generate|if|ifnone|macromodule|module|primitive|repeat|specify|table|task|while",t="true|false|null",n="count|min|max|avg|sum|rank|now|coalesce|main",r=this.createKeywordMapper({"support.function":n,keyword:e,"constant.language":t},"identifier",!0);this.$rules={start:[{token:"comment",regex:"//.*$"},{token:"string",regex:'".*?"'},{token:"string",regex:"'.*?'"},{token:"constant.numeric",regex:"[+-]?\\d+(?:(?:\\.\\d*)?(?:[eE][+-]?\\d+)?)?\\b"},{token:r,regex:"[a-zA-Z_$][a-zA-Z0-9_$]*\\b"},{token:"keyword.operator",regex:"\\+|\\-|\\/|\\/\\/|%|<@>|@>|<@|&|\\^|~|<|>|<=|=>|==|!=|<>|="},{token:"paren.lparen",regex:"[\\(]"},{token:"paren.rparen",regex:"[\\)]"},{token:"text",regex:"\\s+"}]}};r.inherits(s,i),t.VerilogHighlightRules=s})
```
|
```xml
<?xml version="1.0" encoding="UTF-8"?>
<ContentPage xmlns="path_to_url"
xmlns:x="path_to_url"
xmlns:local="using:Xamarin.Forms.Xaml.UnitTests"
x:Class="Xamarin.Forms.Xaml.UnitTests.Gh4130">
<ContentPage.Content>
<local:Gh4130Control TextChanged="OnTextChanged" />
</ContentPage.Content>
</ContentPage>
```
|
```python
#
#
# path_to_url
#
# Unless required by applicable law or agreed to in writing, software
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
r"""Beam job to preprocess a TFRecord of NoteSequences for training a MusicVAE.
Splits a TFRecord of NoteSequences (as prepared by `convert_to_note_sequences`)
into individual examples using the DataConverter in the given config, outputting
the resulting unique sequences in a new TFRecord file. The ID field of each new
NoteSequence will contain a comma-separated list of the original NoteSequence(s)
it was extracted from.
NOTE: for large datasets you will want to use a distributed platform like
Google Cloud DataFlow (path_to_url
Example Usage:
====================
CONFIG=cat-mel_2bar_small
python -m magenta.models.music_vae.preprocess_tfrecord \
--input_tfrecord=/path/to/tfrecords/train.tfrecord \
--output_tfrecord=/path/to/tfrecords/train-$CONFIG.tfrecord \
--output_shards=10 \
--config=$CONFIG \
--alsologtostderr
If running on DataFlow, you'll need to set the `--pipeline_options` flag using
the execution parameters described at
path_to_url
E.g., `--pipeline_options=--runner=DataFlowRunner,--project=<my-project-id>`.
"""
import typing
from absl import app
from absl import flags
from absl import logging
import apache_beam as beam
from apache_beam import typehints
from apache_beam.metrics import Metrics as beam_metrics
from magenta.models.music_vae import configs
import note_seq
from note_seq.sequences_lib import split_note_sequence_on_time_changes
import numpy as np
FLAGS = flags.FLAGS
flags.DEFINE_string(
'input_tfrecord', None,
'Filepattern matching input TFRecord file(s).')
flags.DEFINE_string(
'output_tfrecord', None,
'The prefx for the output TFRecord file(s).')
flags.DEFINE_integer(
'output_shards', 32,
'The number of output shards.')
flags.DEFINE_string(
'config', None,
'The name of the model config to use.')
flags.DEFINE_bool(
'enable_filtering', True,
'If True, enables max_total_time, max_num_notes, min_velocities, '
'min_metric_positions, is_drum, and drums_only flags.')
flags.DEFINE_integer(
'max_total_time', 1800,
'NoteSequences longer than this (in seconds) will be skipped.')
flags.DEFINE_integer(
'max_num_notes', 10000,
'NoteSequences with more than this many notes will be skipped.')
flags.DEFINE_integer(
'min_velocities', 1,
'NoteSequences with fewer unique velocities than this will be skipped.')
flags.DEFINE_integer(
'min_metric_positions', 1,
'NoteSequences with fewer unique metric positions between quarter notes '
'than this will be skipped.')
flags.DEFINE_bool(
'is_drum', None,
'If None, filtering will consider drums and non-drums. If True, only drums '
'will be considered. If False, only non-drums will be considered.')
flags.DEFINE_bool(
'drums_only', False,
'If True, NoteSequences with non-drum instruments will be skipped.')
flags.DEFINE_list(
'pipeline_options', '--runner=DirectRunner',
'A comma-separated list of command line arguments to be used as options '
'for the Beam Pipeline.')
@typehints.with_input_types(note_seq.NoteSequence)
@typehints.with_output_types(typing.Tuple[note_seq.NoteSequence, str])
class ExtractExamplesDoFn(beam.DoFn):
"""Encodes each NoteSequence example and emits the results in a tf.Example."""
def __init__(self, config_name, filters, *unused_args, **unused_kwargs):
super(ExtractExamplesDoFn, self).__init__(*unused_args, **unused_kwargs)
self._config = configs.CONFIG_MAP[config_name]
self._config.data_converter.max_outputs_per_notesequence = None
self._filters = filters
def _process_ns(self, ns):
if self._filters:
if ns.total_time > self._filters['max_total_time']:
logging.info('Skipping %s: total_time=%f', ns.id, ns.total_time)
beam_metrics.counter('ExtractExamplesDoFn', 'filtered-too-long').inc()
return
if len(ns.notes) > self._filters['max_num_notes']:
logging.info('Skipping %s: num_notes=%d', ns.id, len(ns.notes))
beam_metrics.counter(
'ExtractExamplesDoFn', 'filtered-too-many-notes').inc()
return
try:
qns = note_seq.quantize_note_sequence(ns, steps_per_quarter=16)
except (note_seq.BadTimeSignatureError,
note_seq.NonIntegerStepsPerBarError, note_seq.NegativeTimeError):
beam_metrics.counter('ExtractExamplesDoFn', 'quantize-failed').inc()
return
vels = set()
metric_positions = set()
drums_only = True
for note in qns.notes:
drums_only &= note.is_drum
if ((self._filters['is_drum'] is None or
note.is_drum == self._filters['is_drum'])
and note.velocity > 0):
vels.add(note.velocity)
metric_positions.add(note.quantized_start_step % 16)
if len(vels) < self._filters['min_velocities']:
beam_metrics.counter(
'ExtractExamplesDoFn', 'filtered-min-velocities').inc()
return
if len(metric_positions) < self._filters['min_metric_positions']:
beam_metrics.counter(
'ExtractExamplesDoFn', 'filtered-min-metric-positions').inc()
return
if self._filters['drums_only'] and not drums_only:
beam_metrics.counter(
'ExtractExamplesDoFn', 'filtered-drums-only').inc()
return
beam_metrics.counter('ExtractExamplesDoFn', 'unfiltered-sequences').inc()
logging.info('Converting %s to tensors', ns.id)
extracted_examples = self._config.data_converter.to_tensors(ns)
if not extracted_examples.outputs:
beam_metrics.counter('ExtractExamplesDoFn', 'empty-extractions').inc()
return
beam_metrics.counter('ExtractExamplesDoFn', 'extracted-examples').inc(
len(extracted_examples.outputs))
for _, outputs, controls, _ in zip(*extracted_examples):
if controls.size:
example_ns = self._config.data_converter.from_tensors(
[outputs], [controls])[0]
else:
example_ns = self._config.data_converter.from_tensors([outputs])[0]
# Try to re-encode.
# TODO(adarob): For now we filter and count examples that cannot be
# re-extracted, but ultimately the converter should filter these or avoid
# producing them all together.
reextracted_examples = self._config.data_converter.to_tensors(
example_ns).inputs
assert len(reextracted_examples) <= 1
if not reextracted_examples:
logging.warning(
'Extracted example NoteSequence does not reproduce example. '
'Skipping: %s', example_ns)
beam_metrics.counter('ExtractExamplesDoFn', 'empty-reextraction').inc()
continue
# Extra checks if the code returns multiple segments.
# TODO(fjord): should probably make this recursive for cases with more
# than 1 level of hierarchy.
if isinstance(outputs, list):
if len(outputs) != len(reextracted_examples[0]):
logging.warning(
'Re-extracted example tensor has different number of segments. '
'ID: %s. original %d, reextracted %d. Skipping.', ns.id,
len(outputs), len(reextracted_examples[0]))
beam_metrics.counter(
'ExtractExamplesDoFn', 'different-reextraction-count').inc()
continue
for i in range(len(outputs)):
if not np.array_equal(reextracted_examples[0][i], outputs[i]):
logging.warning(
'Re-extracted example tensor does not equal original example. '
'ID: %s. Index %d. NoteSequence: %s', ns.id, i, example_ns)
beam_metrics.counter(
'ExtractExamplesDoFn', 'different-reextraction').inc()
yield example_ns, ns.id
def process(self, seq):
split_seqs = split_note_sequence_on_time_changes(seq)
if len(split_seqs) > 100:
beam_metrics.counter(
'ExtractExamplesDoFn', 'filtered-too-many-sequence-time-splits').inc()
return
beam_metrics.counter(
'ExtractExamplesDoFn', 'sequence-time-splits').inc(len(split_seqs))
for ns in split_seqs:
for res in self._process_ns(ns):
beam_metrics.counter('ExtractExamplesDoFn', 'all-examples').inc()
yield res
def combine_matching_seqs(ns_ids):
ns, ids = ns_ids
beam_metrics.counter('ExtractExamplesDoFn', 'unique-examples').inc()
ns.id = ','.join(ids)
return ns
def run_pipeline(input_tfrecord, output_tfrecord, output_shards, config,
filters, pipeline_options):
with beam.Pipeline(options=pipeline_options) as p:
_ = (
p
| 'read_input' >> beam.io.ReadFromTFRecord(
input_tfrecord, coder=beam.coders.ProtoCoder(note_seq.NoteSequence))
| 'extract_sequences' >> beam.ParDo(
ExtractExamplesDoFn(config, filters))
| 'group' >> beam.GroupByKey()
| 'uniquify' >> beam.Map(combine_matching_seqs)
| 'shuffle' >> beam.Reshuffle()
| 'write' >> beam.io.WriteToTFRecord(
output_tfrecord,
num_shards=output_shards,
coder=beam.coders.ProtoCoder(note_seq.NoteSequence)))
def main(_):
flags.mark_flags_as_required(['input_tfrecord', 'output_tfrecord', 'config'])
filters = None if not FLAGS.enable_filtering else { # pylint: disable=g-long-ternary
'max_total_time': FLAGS.max_total_time,
'max_num_notes': FLAGS.max_num_notes,
'min_velocities': FLAGS.min_velocities,
'min_metric_positions': FLAGS.min_metric_positions,
'is_drum': FLAGS.is_drum,
'drums_only': FLAGS.drums_only,
}
pipeline_options = beam.options.pipeline_options.PipelineOptions(
FLAGS.pipeline_options)
run_pipeline(FLAGS.input_tfrecord, FLAGS.output_tfrecord, FLAGS.output_shards,
FLAGS.config, filters, pipeline_options)
if __name__ == '__main__':
app.run(main)
```
|
Warsaw Financial Center is a skyscraper in Warsaw with a height of topped with an antenna mast which is nearly .
Description
The building was constructed to comply with all applicable building codes of the United States, including an emergency generator that provides power for all Life Safety Systems including fire alarm systems, HVAC fire support systems, the building's fire pump, elevators and emergency egress lighting, and its own water tanks (with a capacity of about ) for the production of safe drinking water. Warsaw Financial Center was designed by renowned U.S. architecture firms, A. Epstein & Sons International and Kohn Pedersen Fox Associates, in cooperation with Polish architects, who were inspired by the 333 Wacker Drive building in Chicago.
The building has a six floor parking lot for 350 cars. The ground floor houses a Bank Pekao branch and a Starbucks coffee shop. There are floors dedicated to office space that are air-conditioned and equipped with satellite connection and internet. The building incorporates 16 elevators and is fully handicapped-accessible.
The total leasable space in the Warsaw Financial Center amounts to 50,000 square metres. Each floor offers 1,900 m² A+ class office space, 2.75 m tall.
The Warsaw Financial Center was designed by the American skyscraper design studio of A. Epstein & Sons International and Kohn Pedersen Fox Associates, in cooperation with Polish architects. The main contractor for the tower was PORR International AG, who have also built the Warsaw Sheraton and the Stock Exchange building.
Construction lasted from 1997 to 1998.
As of the end of 2012, Warsaw Financial Center is owned by CPI Poland.
Notable tenants
Google Poland Sp. z o.o.
Taipei Representative Office in Poland
Taiwan External Trade Development Council (Polish branch)
See also
List of tallest buildings in Poland
References
Office buildings completed in 1998
Śródmieście, Warsaw
Skyscraper office buildings in Warsaw
Kohn Pedersen Fox buildings
|
```c++
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
//
// path_to_url
//
// Unless required by applicable law or agreed to in writing,
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
// specific language governing permissions and limitations
// Note: The results do not include the pre-processing in the prepare function that is
// necessary for SetLookup but not Iterate. None of the values searched for are in the
// fabricated IN list (i.e. hit rate is 0).
//Machine Info: Intel(R) Core(TM) i7-6700 CPU @ 3.40GHz
//tinyInt n=1: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=1 3.29e+03 3.34e+03 3.38e+03 1X 1X 1X
// Iterate n=1 9.48e+03 9.56e+03 9.64e+03 2.88X 2.87X 2.85X
//
//tinyInt n=2: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=2 2.91e+03 2.99e+03 3.02e+03 1X 1X 1X
// Iterate n=2 6.95e+03 7.08e+03 7.14e+03 2.39X 2.37X 2.37X
//
//tinyInt n=3: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=3 2.54e+03 2.6e+03 2.65e+03 1X 1X 1X
// Iterate n=3 4.89e+03 5.01e+03 5.08e+03 1.93X 1.93X 1.92X
//
//tinyInt n=4: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=4 2.89e+03 3e+03 3.04e+03 1X 1X 1X
// Iterate n=4 3.71e+03 3.79e+03 3.84e+03 1.28X 1.26X 1.26X
//
//tinyInt n=5: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=5 2.64e+03 2.74e+03 2.78e+03 1X 1X 1X
// Iterate n=5 3.5e+03 3.57e+03 3.61e+03 1.32X 1.3X 1.3X
//
//tinyInt n=6: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=6 2.62e+03 2.67e+03 2.69e+03 1X 1X 1X
// Iterate n=6 2.73e+03 2.76e+03 2.79e+03 1.04X 1.04X 1.04X
//
//tinyInt n=7: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=7 2.39e+03 2.44e+03 2.46e+03 1X 1X 1X
// Iterate n=7 2.48e+03 2.51e+03 2.54e+03 1.04X 1.03X 1.03X
//
//tinyInt n=8: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=8 2.81e+03 2.85e+03 2.89e+03 1X 1X 1X
// Iterate n=8 2.08e+03 2.12e+03 2.14e+03 0.741X 0.743X 0.741X
//
//tinyInt n=9: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=9 2.66e+03 2.75e+03 2.8e+03 1X 1X 1X
// Iterate n=9 1.69e+03 1.71e+03 1.73e+03 0.635X 0.624X 0.617X
//
//tinyInt n=10: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=10 2.8e+03 2.89e+03 2.92e+03 1X 1X 1X
// Iterate n=10 1.54e+03 1.57e+03 1.58e+03 0.548X 0.543X 0.542X
//
//tinyInt n=400: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=400 2.51e+03 2.61e+03 2.64e+03 1X 1X 1X
// Iterate n=400 84 84.2 85.7 0.0335X 0.0323X 0.0325X
//
//smallInt n=1: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=1 3.16e+03 3.28e+03 3.33e+03 1X 1X 1X
// Iterate n=1 1.03e+04 1.04e+04 1.05e+04 3.27X 3.18X 3.16X
//
//smallInt n=2: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=2 2.94e+03 3.02e+03 3.06e+03 1X 1X 1X
// Iterate n=2 7.03e+03 7.12e+03 7.18e+03 2.39X 2.36X 2.35X
//
//smallInt n=3: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=3 2.64e+03 2.73e+03 2.78e+03 1X 1X 1X
// Iterate n=3 5.33e+03 5.4e+03 5.45e+03 2.02X 1.98X 1.96X
//
//smallInt n=4: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=4 2.96e+03 3.04e+03 3.08e+03 1X 1X 1X
// Iterate n=4 4.06e+03 4.09e+03 4.14e+03 1.37X 1.34X 1.35X
//
//smallInt n=5: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=5 2.72e+03 2.81e+03 2.86e+03 1X 1X 1X
// Iterate n=5 3.59e+03 3.63e+03 3.66e+03 1.32X 1.29X 1.28X
//
//smallInt n=6: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=6 2.68e+03 2.79e+03 2.85e+03 1X 1X 1X
// Iterate n=6 2.9e+03 2.98e+03 3.02e+03 1.08X 1.07X 1.06X
//
//smallInt n=7: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=7 2.35e+03 2.56e+03 2.6e+03 1X 1X 1X
// Iterate n=7 2.63e+03 2.73e+03 2.76e+03 1.12X 1.07X 1.06X
//
//smallInt n=8: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=8 2.78e+03 2.88e+03 2.91e+03 1X 1X 1X
// Iterate n=8 2.33e+03 2.36e+03 2.38e+03 0.839X 0.818X 0.816X
//
//smallInt n=9: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=9 2.76e+03 2.83e+03 2.87e+03 1X 1X 1X
// Iterate n=9 1.79e+03 1.82e+03 1.85e+03 0.648X 0.642X 0.644X
//
//smallInt n=10: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=10 2.83e+03 2.88e+03 2.91e+03 1X 1X 1X
// Iterate n=10 1.61e+03 1.64e+03 1.66e+03 0.567X 0.57X 0.57X
//
//smallInt n=400: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=400 2.62e+03 2.68e+03 2.71e+03 1X 1X 1X
// Iterate n=400 48.7 49.4 49.9 0.0186X 0.0185X 0.0184X
//
//int n=1: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=1 4.66e+03 4.75e+03 4.85e+03 1X 1X 1X
// Iterate n=1 1.03e+04 1.04e+04 1.05e+04 2.21X 2.19X 2.17X
//
//int n=2: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=2 4.1e+03 4.27e+03 4.34e+03 1X 1X 1X
// Iterate n=2 6.62e+03 6.94e+03 7.02e+03 1.61X 1.62X 1.62X
//
//int n=3: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=3 3.78e+03 3.89e+03 3.94e+03 1X 1X 1X
// Iterate n=3 5.21e+03 5.29e+03 5.34e+03 1.38X 1.36X 1.35X
//
//int n=4: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=4 3.16e+03 3.28e+03 3.35e+03 1X 1X 1X
// Iterate n=4 3.9e+03 4e+03 4.07e+03 1.23X 1.22X 1.22X
//
//int n=5: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=5 3.29e+03 3.39e+03 3.45e+03 1X 1X 1X
// Iterate n=5 3.39e+03 3.5e+03 3.53e+03 1.03X 1.03X 1.02X
//
//int n=6: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=6 3.3e+03 3.39e+03 3.44e+03 1X 1X 1X
// Iterate n=6 2.9e+03 2.97e+03 2.99e+03 0.881X 0.874X 0.869X
//
//int n=7: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=7 3.06e+03 3.18e+03 3.21e+03 1X 1X 1X
// Iterate n=7 2.67e+03 2.72e+03 2.74e+03 0.872X 0.855X 0.853X
//
//int n=8: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=8 2.69e+03 2.72e+03 2.75e+03 1X 1X 1X
// Iterate n=8 2.32e+03 2.34e+03 2.36e+03 0.863X 0.862X 0.86X
//
//int n=9: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=9 2.59e+03 2.65e+03 2.7e+03 1X 1X 1X
// Iterate n=9 1.69e+03 1.71e+03 1.73e+03 0.652X 0.647X 0.642X
//
//int n=10: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=10 2.76e+03 2.82e+03 2.85e+03 1X 1X 1X
// Iterate n=10 1.54e+03 1.56e+03 1.58e+03 0.557X 0.554X 0.555X
//
//int n=400: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=400 1.45e+03 1.55e+03 1.57e+03 1X 1X 1X
// Iterate n=400 48.4 48.6 49.3 0.0334X 0.0314X 0.0314X
//
//bigInt n=1: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=1 4.08e+03 4.16e+03 4.23e+03 1X 1X 1X
// Iterate n=1 9.06e+03 9.14e+03 9.24e+03 2.22X 2.2X 2.19X
//
//bigInt n=2: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=2 4.02e+03 4.15e+03 4.24e+03 1X 1X 1X
// Iterate n=2 6.44e+03 6.51e+03 6.58e+03 1.6X 1.57X 1.55X
//
//bigInt n=3: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=3 3.86e+03 3.97e+03 4.03e+03 1X 1X 1X
// Iterate n=3 4.63e+03 4.7e+03 4.76e+03 1.2X 1.18X 1.18X
//
//bigInt n=4: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=4 3.54e+03 3.62e+03 3.7e+03 1X 1X 1X
// Iterate n=4 4.04e+03 4.11e+03 4.13e+03 1.14X 1.13X 1.12X
//
//bigInt n=5: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=5 2.73e+03 2.76e+03 2.79e+03 1X 1X 1X
// Iterate n=5 3.27e+03 3.3e+03 3.34e+03 1.2X 1.19X 1.2X
//
//bigInt n=6: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=6 2.98e+03 3.01e+03 3.04e+03 1X 1X 1X
// Iterate n=6 2.96e+03 2.98e+03 3.02e+03 0.992X 0.991X 0.992X
//
//bigInt n=7: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=7 2.63e+03 2.67e+03 2.7e+03 1X 1X 1X
// Iterate n=7 2.52e+03 2.54e+03 2.57e+03 0.957X 0.951X 0.951X
//
//bigInt n=8: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=8 2.69e+03 2.77e+03 2.81e+03 1X 1X 1X
// Iterate n=8 2.33e+03 2.35e+03 2.38e+03 0.865X 0.849X 0.846X
//
//bigInt n=9: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=9 2.62e+03 2.67e+03 2.7e+03 1X 1X 1X
// Iterate n=9 1.84e+03 1.86e+03 1.88e+03 0.701X 0.695X 0.696X
//
//bigInt n=10: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=10 2.54e+03 2.58e+03 2.62e+03 1X 1X 1X
// Iterate n=10 1.64e+03 1.68e+03 1.69e+03 0.645X 0.65X 0.646X
//
//bigInt n=400: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=400 1.35e+03 1.4e+03 1.42e+03 1X 1X 1X
// Iterate n=400 47.7 48.6 48.8 0.0352X 0.0348X 0.0344X
//
//float n=1: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=1 3.36e+03 3.39e+03 3.42e+03 1X 1X 1X
// Iterate n=1 7.22e+03 7.27e+03 7.34e+03 2.15X 2.14X 2.14X
//
//float n=2: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=2 4.08e+03 4.14e+03 4.19e+03 1X 1X 1X
// Iterate n=2 4.7e+03 4.74e+03 4.77e+03 1.15X 1.14X 1.14X
//
//float n=3: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=3 2.92e+03 2.95e+03 2.98e+03 1X 1X 1X
// Iterate n=3 3.63e+03 3.66e+03 3.7e+03 1.24X 1.24X 1.24X
//
//float n=4: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=4 2.81e+03 2.84e+03 2.87e+03 1X 1X 1X
// Iterate n=4 2.9e+03 2.94e+03 2.97e+03 1.03X 1.03X 1.03X
//
//float n=5: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=5 2.97e+03 3.03e+03 3.07e+03 1X 1X 1X
// Iterate n=5 2.35e+03 2.37e+03 2.4e+03 0.792X 0.782X 0.782X
//
//float n=6: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=6 2.77e+03 2.85e+03 2.88e+03 1X 1X 1X
// Iterate n=6 2.01e+03 2.03e+03 2.04e+03 0.724X 0.71X 0.707X
//
//float n=7: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=7 2.45e+03 2.52e+03 2.61e+03 1X 1X 1X
// Iterate n=7 1.67e+03 1.75e+03 1.77e+03 0.683X 0.696X 0.679X
//
//float n=8: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=8 2.45e+03 2.53e+03 2.56e+03 1X 1X 1X
// Iterate n=8 1.45e+03 1.54e+03 1.56e+03 0.59X 0.607X 0.607X
//
//float n=9: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=9 2.45e+03 2.53e+03 2.56e+03 1X 1X 1X
// Iterate n=9 1.32e+03 1.38e+03 1.4e+03 0.538X 0.547X 0.546X
//
//float n=10: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=10 2.29e+03 2.32e+03 2.35e+03 1X 1X 1X
// Iterate n=10 1.21e+03 1.24e+03 1.25e+03 0.529X 0.535X 0.533X
//
//float n=400: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=400 1.01e+03 1.04e+03 1.08e+03 1X 1X 1X
// Iterate n=400 32.4 32.6 33 0.0321X 0.0313X 0.0305X
//
//double n=1: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=1 2.49e+03 2.52e+03 2.54e+03 1X 1X 1X
// Iterate n=1 7.15e+03 7.26e+03 7.31e+03 2.87X 2.88X 2.88X
//
//double n=2: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=2 2.05e+03 2.08e+03 2.09e+03 1X 1X 1X
// Iterate n=2 4.82e+03 4.97e+03 5.03e+03 2.36X 2.39X 2.4X
//
//double n=3: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=3 2.1e+03 2.14e+03 2.16e+03 1X 1X 1X
// Iterate n=3 3.62e+03 3.67e+03 3.7e+03 1.72X 1.71X 1.71X
//
//double n=4: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=4 2.27e+03 2.29e+03 2.31e+03 1X 1X 1X
// Iterate n=4 2.91e+03 2.94e+03 2.97e+03 1.29X 1.28X 1.29X
//
//double n=5: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=5 2.17e+03 2.2e+03 2.22e+03 1X 1X 1X
// Iterate n=5 2.34e+03 2.37e+03 2.4e+03 1.08X 1.08X 1.08X
//
//double n=6: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=6 1.85e+03 2.04e+03 2.09e+03 1X 1X 1X
// Iterate n=6 1.94e+03 2.02e+03 2.04e+03 1.05X 0.988X 0.976X
//
//double n=7: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=7 2.04e+03 2.06e+03 2.08e+03 1X 1X 1X
// Iterate n=7 1.74e+03 1.75e+03 1.77e+03 0.852X 0.85X 0.851X
//
//double n=8: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=8 2.2e+03 2.23e+03 2.25e+03 1X 1X 1X
// Iterate n=8 1.53e+03 1.55e+03 1.56e+03 0.694X 0.697X 0.695X
//
//double n=9: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=9 2.16e+03 2.23e+03 2.25e+03 1X 1X 1X
// Iterate n=9 1.34e+03 1.38e+03 1.4e+03 0.621X 0.621X 0.619X
//
//double n=10: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=10 2.12e+03 2.18e+03 2.2e+03 1X 1X 1X
// Iterate n=10 1.21e+03 1.24e+03 1.25e+03 0.573X 0.571X 0.569X
//
//double n=400: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=400 1.97e+03 2.01e+03 2.03e+03 1X 1X 1X
// Iterate n=400 31.8 32.5 33 0.0161X 0.0162X 0.0162X
//
//string n=1: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=1 1.69e+03 1.71e+03 1.73e+03 1X 1X 1X
// Iterate n=1 2.25e+03 2.26e+03 2.28e+03 1.33X 1.32X 1.32X
//
//string n=2: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=2 1.5e+03 1.52e+03 1.53e+03 1X 1X 1X
// Iterate n=2 1.19e+03 1.21e+03 1.22e+03 0.795X 0.796X 0.796X
//
//string n=3: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=3 1.42e+03 1.44e+03 1.46e+03 1X 1X 1X
// Iterate n=3 771 797 805 0.544X 0.552X 0.553X
//
//string n=4: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=4 1.5e+03 1.57e+03 1.58e+03 1X 1X 1X
// Iterate n=4 695 706 712 0.464X 0.45X 0.45X
//
//string n=5: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=5 1.43e+03 1.49e+03 1.5e+03 1X 1X 1X
// Iterate n=5 553 563 568 0.386X 0.378X 0.378X
//
//string n=6: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=6 1.28e+03 1.31e+03 1.34e+03 1X 1X 1X
// Iterate n=6 435 441 445 0.341X 0.337X 0.333X
//
//string n=7: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=7 1.33e+03 1.4e+03 1.42e+03 1X 1X 1X
// Iterate n=7 414 420 424 0.311X 0.299X 0.299X
//
//string n=8: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=8 1.52e+03 1.57e+03 1.59e+03 1X 1X 1X
// Iterate n=8 366 371 374 0.241X 0.236X 0.235X
//
//string n=9: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=9 1.49e+03 1.53e+03 1.55e+03 1X 1X 1X
// Iterate n=9 302 304 307 0.202X 0.199X 0.199X
//
//string n=10: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=10 1.4e+03 1.42e+03 1.44e+03 1X 1X 1X
// Iterate n=10 317 320 323 0.226X 0.225X 0.224X
//
//string n=400: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=400 1.36e+03 1.39e+03 1.42e+03 1X 1X 1X
// Iterate n=400 5.38 5.38 5.39 0.00396X 0.00388X 0.0038X
//
//timestamp n=1: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=1 1.79e+03 1.87e+03 1.89e+03 1X 1X 1X
// Iterate n=1 4.33e+03 4.55e+03 4.71e+03 2.41X 2.44X 2.49X
//
//timestamp n=2: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=2 1.69e+03 1.73e+03 1.76e+03 1X 1X 1X
// Iterate n=2 3.42e+03 3.54e+03 3.61e+03 2.02X 2.04X 2.05X
//
//timestamp n=3: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=3 1.54e+03 1.58e+03 1.6e+03 1X 1X 1X
// Iterate n=3 2.49e+03 2.54e+03 2.57e+03 1.61X 1.6X 1.6X
//
//timestamp n=4: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=4 1.53e+03 1.6e+03 1.63e+03 1X 1X 1X
// Iterate n=4 1.9e+03 1.95e+03 1.96e+03 1.24X 1.21X 1.21X
//
//timestamp n=5: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=5 1.61e+03 1.68e+03 1.7e+03 1X 1X 1X
// Iterate n=5 1.57e+03 1.59e+03 1.6e+03 0.976X 0.943X 0.939X
//
//timestamp n=6: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=6 1.47e+03 1.49e+03 1.51e+03 1X 1X 1X
// Iterate n=6 1.32e+03 1.34e+03 1.35e+03 0.893X 0.895X 0.893X
//
//timestamp n=7: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=7 1.44e+03 1.51e+03 1.54e+03 1X 1X 1X
// Iterate n=7 1.12e+03 1.15e+03 1.16e+03 0.776X 0.758X 0.755X
//
//timestamp n=8: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=8 1.65e+03 1.67e+03 1.69e+03 1X 1X 1X
// Iterate n=8 992 1.01e+03 1.02e+03 0.602X 0.604X 0.606X
//
//timestamp n=9: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=9 1.56e+03 1.57e+03 1.59e+03 1X 1X 1X
// Iterate n=9 894 902 912 0.575X 0.573X 0.575X
//
//timestamp n=10: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=10 1.55e+03 1.59e+03 1.61e+03 1X 1X 1X
// Iterate n=10 789 814 824 0.51X 0.511X 0.51X
//
//timestamp n=400: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=400 1.4e+03 1.48e+03 1.5e+03 1X 1X 1X
// Iterate n=400 20.5 20.9 20.9 0.0146X 0.0141X 0.0139X
//
//decimal(4,0) n=1: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=1 1.82e+03 1.89e+03 1.91e+03 1X 1X 1X
// Iterate n=1 6.26e+03 6.43e+03 6.5e+03 3.44X 3.4X 3.4X
//
//decimal(4,0) n=2: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=2 1.69e+03 1.76e+03 1.77e+03 1X 1X 1X
// Iterate n=2 3.99e+03 4.07e+03 4.1e+03 2.36X 2.32X 2.31X
//
//decimal(4,0) n=3: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=3 1.63e+03 1.66e+03 1.68e+03 1X 1X 1X
// Iterate n=3 3.19e+03 3.22e+03 3.26e+03 1.95X 1.94X 1.94X
//
//decimal(4,0) n=4: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=4 1.76e+03 1.81e+03 1.84e+03 1X 1X 1X
// Iterate n=4 2.46e+03 2.52e+03 2.56e+03 1.4X 1.39X 1.39X
//
//decimal(4,0) n=5: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=5 1.64e+03 1.69e+03 1.7e+03 1X 1X 1X
// Iterate n=5 1.93e+03 1.96e+03 1.98e+03 1.17X 1.16X 1.16X
//
//decimal(4,0) n=6: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=6 1.61e+03 1.65e+03 1.67e+03 1X 1X 1X
// Iterate n=6 1.71e+03 1.74e+03 1.76e+03 1.06X 1.06X 1.06X
//
//decimal(4,0) n=7: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=7 1.53e+03 1.56e+03 1.57e+03 1X 1X 1X
// Iterate n=7 1.53e+03 1.57e+03 1.59e+03 1X 1X 1.01X
//
//decimal(4,0) n=8: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=8 1.69e+03 1.73e+03 1.76e+03 1X 1X 1X
// Iterate n=8 1.4e+03 1.43e+03 1.46e+03 0.829X 0.828X 0.83X
//
//decimal(4,0) n=9: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=9 1.69e+03 1.72e+03 1.74e+03 1X 1X 1X
// Iterate n=9 1.28e+03 1.32e+03 1.34e+03 0.756X 0.766X 0.769X
//
//decimal(4,0) n=10: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=10 1.65e+03 1.69e+03 1.71e+03 1X 1X 1X
// Iterate n=10 1.16e+03 1.22e+03 1.25e+03 0.707X 0.723X 0.729X
//
//decimal(4,0) n=400: Function iters/ms 10%ile 50%ile 90%ile 10%ile 50%ile 90%ile
// (relative) (relative) (relative)
//your_sha256_hash-----------------------------------------
// SetLookup n=400 1.52e+03 1.58e+03 1.6e+03 1X 1X 1X
// Iterate n=400 30.6 31.3 31.3 0.0202X 0.0197X 0.0195X
#include <boost/lexical_cast.hpp>
#include <gutil/strings/substitute.h>
#include "exprs/in-predicate.h"
#include "runtime/decimal-value.h"
#include "runtime/string-value.h"
#include "udf/udf-test-harness.h"
#include "util/benchmark.h"
#include "util/cpu-info.h"
#include "common/names.h"
using namespace impala;
using namespace impala_udf;
using namespace strings;
using std::move;
namespace impala {
template<typename T> T MakeAnyVal(int v) {
return T(v);
}
template<> StringVal MakeAnyVal(int v) {
// Leak these strings so we don't have to worry about them going out of scope
string* s = new string();
*s = lexical_cast<string>(v);
return StringVal(reinterpret_cast<uint8_t*>(const_cast<char*>(s->c_str())), s->size());
}
class InPredicateBenchmark {
public:
template<typename T, typename SetType>
struct TestData {
vector<T> anyvals;
vector<AnyVal*> anyval_ptrs;
InPredicate::SetLookupState<SetType> state;
vector<T> search_vals;
int total_found_set;
int total_set;
int total_found_iter;
int total_iter;
};
template<typename T, typename SetType>
static TestData<T, SetType> CreateTestData(int num_values,
const FunctionContext::TypeDesc& type, int num_search_vals = 100) {
srand(time(NULL));
TestData<T, SetType> data;
data.anyvals.resize(num_values);
data.anyval_ptrs.resize(num_values);
for (int i = 0; i < num_values; ++i) {
data.anyvals[i] = MakeAnyVal<T>(rand());
data.anyval_ptrs[i] = &data.anyvals[i];
}
for (int i = 0; i < num_search_vals; ++i) {
data.search_vals.push_back(MakeAnyVal<T>(rand()));
}
FunctionContext* ctx = CreateContext(num_values, type);
vector<AnyVal*> constant_args;
constant_args.push_back(NULL);
for (AnyVal* p : data.anyval_ptrs) constant_args.push_back(p);
UdfTestHarness::SetConstantArgs(ctx, move(constant_args));
InPredicate::SetLookupPrepare<T, SetType>(ctx, FunctionContext::FRAGMENT_LOCAL);
data.state = *reinterpret_cast<InPredicate::SetLookupState<SetType>*>(
ctx->GetFunctionState(FunctionContext::FRAGMENT_LOCAL));
data.total_found_set = data.total_set = data.total_found_iter = data.total_iter = 0;
return data;
}
template<typename T, typename SetType>
static void TestSetLookup(int batch_size, void* d) {
TestData<T, SetType>* data = reinterpret_cast<TestData<T, SetType>*>(d);
for (int i = 0; i < batch_size; ++i) {
for (const T& search_val: data->search_vals) {
BooleanVal found = InPredicate::SetLookup(&data->state, search_val);
if (found.val) ++data->total_found_set;
++data->total_set;
}
}
}
template<typename T, typename SetType>
static void TestIterate(int batch_size, void* d) {
TestData<T, SetType>* data = reinterpret_cast<TestData<T, SetType>*>(d);
for (int i = 0; i < batch_size; ++i) {
for (const T& search_val: data->search_vals) {
BooleanVal found = InPredicate::Iterate(
data->state.type, search_val, data->anyvals.size(), &data->anyvals[0]);
if (found.val) ++data->total_found_iter;
++data->total_iter;
}
}
}
template <typename AnyValType, typename SetType, FunctionContext::Type TypeDesc>
static void RunBenchmark(int n) {
Benchmark suite(Substitute("$0 n=$1", GetTypeName(TypeDesc), n));
FunctionContext::TypeDesc type;
type.type = TypeDesc;
InPredicateBenchmark::TestData<AnyValType, SetType> data =
InPredicateBenchmark::CreateTestData<AnyValType, SetType>(n, type);
suite.AddBenchmark(Substitute("SetLookup n=$0", n),
InPredicateBenchmark::TestSetLookup<AnyValType, SetType>, &data);
suite.AddBenchmark(Substitute("Iterate n=$0", n),
InPredicateBenchmark::TestIterate<AnyValType, SetType>, &data);
cout << suite.Measure() << endl;
}
private:
static FunctionContext* CreateContext(
int num_args, const FunctionContext::TypeDesc& type) {
// Types don't matter (but number of args do)
FunctionContext::TypeDesc ret_type;
vector<FunctionContext::TypeDesc> arg_types(num_args + 1, type);
return UdfTestHarness::CreateTestContext(ret_type, arg_types);
}
static string GetTypeName(FunctionContext::Type type){
switch (type) {
case FunctionContext::TYPE_TINYINT:
return "tinyInt";
case FunctionContext::TYPE_SMALLINT:
return "smallInt";
case FunctionContext::TYPE_INT:
return "int";
case FunctionContext::TYPE_BIGINT:
return "bigInt";
case FunctionContext::TYPE_FLOAT:
return "float";
case FunctionContext::TYPE_DOUBLE:
return "double";
case FunctionContext::TYPE_STRING:
return "string";
case FunctionContext::TYPE_TIMESTAMP:
return "timestamp";
default:
return "Unsupported Type";
}
}
};
template <>
void InPredicateBenchmark::RunBenchmark<DecimalVal, Decimal16Value,
FunctionContext::TYPE_DECIMAL>(int n) {
Benchmark suite(Substitute("decimal(4,0) n=$0", n));
FunctionContext::TypeDesc type;
type.type = FunctionContext::TYPE_DECIMAL;
type.precision = 4;
type.scale = 0;
InPredicateBenchmark::TestData<DecimalVal, Decimal16Value> data =
InPredicateBenchmark::CreateTestData<DecimalVal, Decimal16Value>(n, type);
suite.AddBenchmark(Substitute("SetLookup n=$0", n),
InPredicateBenchmark::TestSetLookup<DecimalVal, Decimal16Value>, &data);
suite.AddBenchmark(Substitute("Iterate n=$0", n),
InPredicateBenchmark::TestIterate<DecimalVal, Decimal16Value>, &data);
cout << suite.Measure() << endl;
}
}
#define RUN_BENCHMARK(AnyValType, SetType, type_desc) \
for (int i = 1; i <= 10; ++i) { \
InPredicateBenchmark::RunBenchmark<AnyValType, SetType, type_desc>(i); \
} \
InPredicateBenchmark::RunBenchmark<AnyValType, SetType, type_desc>(400);
int main(int argc, char **argv) {
CpuInfo::Init();
cout << Benchmark::GetMachineInfo() << endl;
RUN_BENCHMARK(TinyIntVal, int8_t, FunctionContext::TYPE_TINYINT)
RUN_BENCHMARK(SmallIntVal, int16_t, FunctionContext::TYPE_SMALLINT)
RUN_BENCHMARK(IntVal, int32_t, FunctionContext::TYPE_INT)
RUN_BENCHMARK(BigIntVal, int64_t, FunctionContext::TYPE_BIGINT)
RUN_BENCHMARK(FloatVal, float, FunctionContext::TYPE_FLOAT)
RUN_BENCHMARK(DoubleVal, double, FunctionContext::TYPE_DOUBLE)
RUN_BENCHMARK(StringVal, StringValue, FunctionContext::TYPE_STRING)
RUN_BENCHMARK(TimestampVal, TimestampValue, FunctionContext::TYPE_TIMESTAMP)
RUN_BENCHMARK(DecimalVal, Decimal16Value, FunctionContext::TYPE_DECIMAL)
return 0;
}
```
|
The Cincinnati Public School district includes 16 high schools, each accepting students on a citywide basis. The district includes many public Montessori schools, one of which, Clark Montessori, is the first public Montessori high school in the United States.
The city and region is also home to a variety of other schools, both public and private. There are schools for gifted and accelerated students. The Springer School and Center is the only regional school "devoted entirely to the education of children with learning disabilities." St Rita School for the Deaf educates students up through high school and vocational school.
In August 2007, Cincinnati Magazine published an article rating 36 private high schools in greater Cincinnati. The Roman Catholic Archdiocese of Cincinnati accounts for several high schools in metro Cincinnati, ten of which are single-sex: four all-male, and six all-female.
Cincinnati is also home to the all-female RITSS (Regional Institute for Torah and Secular Studies) high school, a small Orthodox Jewish institution., as well as the all-male Yeshivas Lubavitch High School.
According to the 2000 census, the Cincinnati area has some of the highest private school attendance rates in the United States, with Hamilton County ranking second only to St. Louis County, Missouri among the country's 100 largest counties.
Higher education
Cincinnati is also home to several colleges and universities, including:
Art Academy of Cincinnati
Art Institute of Cincinnati
Cincinnati Christian University (closed January 2020)
Cincinnati College of Mortuary Science
Cincinnati State Technical and Community College
God's Bible School and College
University of Cincinnati
Xavier University
Union Institute & University
Mount St. Joseph University
Northern Kentucky University
Gateway Community and Technical College
Miami University (one of the original "Public Ivies")
Thomas More College (Kentucky)
See also
List of high schools in Cincinnati, Ohio
References
|
Fancy Feast is an American author, and sex educator. She was 2016 Miss Coney Island.
She was the subject of a documentary, Character NYC, by Leon Chase. Her work appeared in Jewish Currents. and Buzzfeed.
Works
Naked: On Sex, Work, and Other Burlesques, Algonquin Books, 2023.
References
American writers
|
The Fall of the Louse of Usher is a 2002 British arthouse horror comedy film written and directed by Ken Russell. The film is loosely based on several Edgar Allan Poe stories, notably the 1839 short story "The Fall of the House of Usher".
Plot
Rock star Roddy Usher (played by James Johnston) is confined to an insane asylum after murdering his wife. During his time there he is given various shock treatments by Nurse Smith (Marie Findley) and Dr Calahari (Ken Russell), resulting in a series of bizarre and nightmarish adventures.
Style
The Fall of the Louse of Usher features many of Russell's trademarks including sexuality (often taken to extremes such as the showing of an inflatable doll orgy sequence), musical sequences and over-the-top acting. The film incorporates musical and comedy elements, with scenes exaggerating the cheapness of the props, despite primarily being a horror film.
Reception
Critics generally agreed that the film was not as polished as Russell's earlier work. For example, Paul Higson of The Zone website called the production design "kindergarten level".
References
External links
British comedy horror films
2002 films
Films based on horror novels
Films based on The Fall of the House of Usher
Films directed by Ken Russell
2002 comedy horror films
Films set in psychiatric hospitals
2002 comedy films
2000s English-language films
2000s British films
|
```objective-c
/*
*
* in the file LICENSE in the source distribution or at
* path_to_url
*/
#ifndef OPENSSL_FIPS_NAMES_H
# define OPENSSL_FIPS_NAMES_H
# pragma once
# ifdef __cplusplus
extern "C" {
# endif
/*
* Parameter names that the FIPS Provider defines
*/
/*
* The calculated MAC of the module file (Used for FIPS Self Testing)
* Type: OSSL_PARAM_UTF8_STRING
*/
# define OSSL_PROV_FIPS_PARAM_MODULE_MAC "module-mac"
/*
* A version number for the fips install process (Used for FIPS Self Testing)
* Type: OSSL_PARAM_UTF8_STRING
*/
# define OSSL_PROV_FIPS_PARAM_INSTALL_VERSION "install-version"
/*
* The calculated MAC of the install status indicator (Used for FIPS Self Testing)
* Type: OSSL_PARAM_UTF8_STRING
*/
# define OSSL_PROV_FIPS_PARAM_INSTALL_MAC "install-mac"
/*
* The install status indicator (Used for FIPS Self Testing)
* Type: OSSL_PARAM_UTF8_STRING
*/
# define OSSL_PROV_FIPS_PARAM_INSTALL_STATUS "install-status"
/*
* A boolean that determines if the FIPS conditional test errors result in
* the module entering an error state.
* Type: OSSL_PARAM_UTF8_STRING
*/
# define OSSL_PROV_FIPS_PARAM_CONDITIONAL_ERRORS "conditional-errors"
/*
* A boolean that determines if the runtime FIPS security checks are performed.
* Type: OSSL_PARAM_UTF8_STRING
*/
# define OSSL_PROV_FIPS_PARAM_SECURITY_CHECKS "security-checks"
# ifdef __cplusplus
}
# endif
#endif /* OPENSSL_FIPS_NAMES_H */
```
|
```go
// Unless explicitly stated otherwise all files in this repository are licensed
// This product includes software developed at Datadog (path_to_url
//go:build orchestrator
package k8s
import (
model "github.com/DataDog/agent-payload/v5/process"
"github.com/DataDog/datadog-agent/pkg/collector/corechecks/cluster/orchestrator/transformers"
rbacv1 "k8s.io/api/rbac/v1"
)
// ExtractClusterRoleBinding returns the protobuf model corresponding to a
// Kubernetes ClusterRoleBinding resource.
func ExtractClusterRoleBinding(crb *rbacv1.ClusterRoleBinding) *model.ClusterRoleBinding {
c := &model.ClusterRoleBinding{
Metadata: extractMetadata(&crb.ObjectMeta),
RoleRef: extractRoleRef(&crb.RoleRef),
Subjects: extractSubjects(crb.Subjects),
}
c.Tags = append(c.Tags, transformers.RetrieveUnifiedServiceTags(crb.ObjectMeta.Labels)...)
return c
}
func extractRoleRef(r *rbacv1.RoleRef) *model.TypedLocalObjectReference {
return &model.TypedLocalObjectReference{
ApiGroup: r.APIGroup,
Kind: r.Kind,
Name: r.Name,
}
}
func extractSubjects(s []rbacv1.Subject) []*model.Subject {
subjects := make([]*model.Subject, 0, len(s))
for _, subject := range s {
subjects = append(subjects, &model.Subject{
ApiGroup: subject.APIGroup,
Kind: subject.Kind,
Name: subject.Name,
Namespace: subject.Namespace,
})
}
return subjects
}
```
|
```xml
/**
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*/
import React, { type PropsWithChildren } from 'react';
/**
* Root style-reset for full-screen React Native web apps with a root `<ScrollView />` should use the following styles to ensure native parity. [Learn more](path_to_url#root-element).
*/
export function ScrollViewStyleReset() {
return (
<style
id="expo-reset"
dangerouslySetInnerHTML={{
__html: `#root,body,html{height:100%}body{overflow:hidden}#root{display:flex}`,
}}
/>
);
}
export function Html({ children }: PropsWithChildren) {
return (
<html lang="en">
<head>
<meta charSet="utf-8" />
<meta httpEquiv="X-UA-Compatible" content="IE=edge" />
<meta name="viewport" content="width=device-width, initial-scale=1, shrink-to-fit=no" />
<ScrollViewStyleReset />
</head>
<body>{children}</body>
</html>
);
}
```
|
Moanda or Muanda is a town and territory lying on the Atlantic Ocean coast of the Democratic Republic of the Congo at the mouth of the Congo River. It is situated in Kongo Central Province, and has a population of 90,812 as of 2012. The town has an airport and is known for its beaches, and has a few limited tourist facilities, but tourism is incidental to the main economic activities of the town.
The town of Muanda is north-west of the small port of Banana in the mouth of the Congo, and southeast of Point Kipundji. The Moanda Oil Terminal, consisting of various platforms, pipelines and a permanent tanker, lies 10 miles southwest of Point Kipundji. Some 100 km upstream from Muanda, on the north bank of the Congo River, lies the city of Boma, DR Congo's second-largest port. The great width and depth of the Congo River allow seagoing vessels to reach Boma and the largest port, Matadi, despite their distance from the coast.
Climate
The Köppen-Geiger climate classification system classifies Moanda‘s climate as tropical wet and dry (Aw), although it is only marginally wet enough to avoid being classed as a hot semi-arid climate (BSh).
See also
Mangroves National Park
References
External links
Description of Muanda (French) (English Translation)
Populated places in Kongo Central
Communities on the Congo River
|
Zasmyano is a village in Aksakovo Municipality, in Varna Province, Bulgaria.
References
Villages in Varna Province
|
Miconia guayaquilensis is a species of plant in the family Melastomataceae. It is endemic to Ecuador. Its natural habitats are subtropical or tropical dry forests and subtropical or tropical moist lowland forests.
References
Endemic flora of Ecuador
guayaquilensis
Endangered plants
Taxa named by Aimé Bonpland
Taxonomy articles created by Polbot
|
This article lists the main target shooting events and their results for 2013.
World Events
International Shooting Sport Federation
16–24 September: 2013 World Shotgun Championships held in Lima, Peru.
ISSF World Cup
2013 ISSF World Cup
International Confederation of Fullbore Rifle Associations
2013 ICFRA F-Class World Championships held at the NRA Whittington Center in Raton, New Mexico, United States.
F-Open Team winners (Farquharson Trophy):
F-TR Team winners (Richardson Cup):
F-Open World Champion: , wins Milcun Shield
F-TR World Champion: , wins Brian Boru Trophy
FITASC
2013 Results.
Island Games
14–19 July: Shooting at the 2013 Island Games in Bermuda.
Summer Universiade
12–17 July: Shooting at the 2013 Summer Universiade held in Kazan, Russia.
Regional Events
Africa
Americas
Bolivarian Games
17–23 November: Shooting at the 2013 Bolivarian Games in Trujillo, Peru.
Asia
Asian Shooting Championships
18–26 October: 2013 Asian Airgun Championships held at the Azadi Sport Complex in Tehran, Iran.
1–10 October: 2013 Asian Shotgun Championships in Almaty, Kazakhstan.
Asian Youth Games
18–21 August: Shooting at the 2013 Asian Youth Games in Nanjing, China.
Southeast Asian Games
11–17 December: Shooting at the 2013 Southeast Asian Games in Yangon, Myanmar.
Europe
European Shooting Confederation
25 February – 3 March: 2013 European 10 m Events Championships in Odense, Denmark.
21 July – 4 August: 2013 European Shooting Championships in Osijek, Croatia.
28 July – 8 August: 2013 European Shotgun Championships in Suhl, Germany.
Games of the Small States of Europe
28–31 May: Shooting at the 2013 Games of the Small States of Europe held in Luxembourg.
Mediterranean Games
23–28 June: Shooting at the 2013 Mediterranean Games in Mersin, Turkey.
"B Matches"
31 January – 2 February: InterShoot in Den Haag, Netherlands.
RIAC held in Strassen, Luxembourg.
National Events
United Kingdom
NRA Imperial Meeting
July, held at the National Shooting Centre, Bisley.
Queen's Prize winner:
Grand Aggregate winner:
Ashburton Shield winners: Dollar Academy
Kolapore Winners:
National Trophy Winners:
Elcho Shield winners:
Vizianagram winners: House of Commons
NSRA National Meeting
August, held at the National Shooting Centre, Bisley
Earl Roberts British Prone Champion:
USA
2013 NCAA Rifle Championships, won by West Virginia Mountaineers.
References
2013 in sports
|
```html
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "path_to_url">
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Struct template vararg</title>
<link rel="stylesheet" href="../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
<link rel="home" href="../../index.html" title="The Boost C++ Libraries BoostBook Documentation Subset">
<link rel="up" href="../../proto/reference.html#header.boost.proto.matches_hpp" title="Header <boost/proto/matches.hpp>">
<link rel="prev" href="convertible_to.html" title="Struct template convertible_to">
<link rel="next" href="matches.html" title="Struct template matches">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../boost.png"></td>
<td align="center"><a href="../../../../index.html">Home</a></td>
<td align="center"><a href="../../../../libs/libraries.htm">Libraries</a></td>
<td align="center"><a href="path_to_url">People</a></td>
<td align="center"><a href="path_to_url">FAQ</a></td>
<td align="center"><a href="../../../../more/index.htm">More</a></td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="convertible_to.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../proto/reference.html#header.boost.proto.matches_hpp"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="matches.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="refentry">
<a name="boost.proto.vararg"></a><div class="titlepage"></div>
<div class="refnamediv">
<h2><span class="refentrytitle">Struct template vararg</span></h2>
<p>boost::proto::vararg — For matching a Grammar to a variable number of sub-expressions.</p>
</div>
<h2 xmlns:rev="path_to_url~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
<div xmlns:rev="path_to_url~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../proto/reference.html#header.boost.proto.matches_hpp" title="Header <boost/proto/matches.hpp>">boost/proto/matches.hpp</a>>
</span><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Grammar<span class="special">></span>
<span class="keyword">struct</span> <a class="link" href="vararg.html" title="Struct template vararg">vararg</a> <span class="special">{</span>
<span class="special">}</span><span class="special">;</span></pre></div>
<div class="refsect1">
<a name="id-1.3.33.5.34.12.4"></a><h2>Description</h2>
<p>
An expression type <code class="computeroutput"><a class="link" href="basic_expr.html" title="Struct template basic_expr">proto::basic_expr</a><AT,
<a class="link" href="listN.html" title="Struct template listN">proto::listN</a><A<sub>0</sub>,...A<sub>n</sub>,U<sub>0</sub>,...U<sub>m</sub>> ></code>
matches a grammar <code class="computeroutput"><a class="link" href="basic_expr.html" title="Struct template basic_expr">proto::basic_expr</a><BT,
<a class="link" href="listN.html" title="Struct template listN">proto::listM</a><B<sub>0</sub>,...B<sub>n</sub>,proto::vararg<V> > ></code>
if <code class="computeroutput">BT</code> is <code class="computeroutput"><a class="link" href="_.html" title="Struct _">proto::_</a></code>
or <code class="computeroutput">AT</code>, and if
<code class="computeroutput">A<sub>x</sub></code> matches
<code class="computeroutput">B<sub>x</sub></code>
for each <code class="computeroutput">x</code> in <code class="computeroutput">[0,n]</code>
and if <code class="computeroutput">U<sub>x</sub></code> matches
<code class="computeroutput">V</code> for each <code class="computeroutput">x</code> in <code class="computeroutput">[0,m]</code>.
</p>
<p>For example:</p>
<p>
</p>
<pre class="programlisting"><span class="comment">// Match any function call expression, regardless</span>
<span class="comment">// of the number of function arguments:</span>
<span class="keyword">struct</span> <span class="identifier">Function</span> <span class="special">:</span>
<a class="link" href="function.html" title="Struct template function">proto::function</a><span class="special"><</span> <span class="identifier">proto</span><span class="special">::</span><span class="identifier">vararg</span><span class="special"><</span><span class="identifier">proto</span><span class="special">::</span><span class="identifier">_</span><span class="special">></span> <span class="special">></span>
<span class="special">{</span><span class="special">}</span><span class="special">;</span></pre>
<p>
</p>
<p>
When used as a transform, <code class="computeroutput">proto::vararg<G></code>
applies <code class="computeroutput">G</code>'s transform.
</p>
</div>
</div>
<table xmlns:rev="path_to_url~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
file LICENSE_1_0.txt or copy at <a href="path_to_url" target="_top">path_to_url
</p>
</div></td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="convertible_to.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../proto/reference.html#header.boost.proto.matches_hpp"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="matches.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
```
|
```go
// Code generated by private/model/cli/gen-api/main.go. DO NOT EDIT.
// Package rekognitioniface provides an interface to enable mocking the Amazon Rekognition service client
// for testing your code.
//
// It is important to note that this interface will have breaking changes
// when the service model is updated and adds new API operations, paginators,
// and waiters.
package rekognitioniface
import (
"github.com/aws/aws-sdk-go/aws"
"github.com/aws/aws-sdk-go/aws/request"
"github.com/aws/aws-sdk-go/service/rekognition"
)
// RekognitionAPI provides an interface to enable mocking the
// rekognition.Rekognition service client's API operation,
// paginators, and waiters. This make unit testing your code that calls out
// to the SDK's service client's calls easier.
//
// The best way to use this interface is so the SDK's service client's calls
// can be stubbed out for unit testing your code with the SDK without needing
// to inject custom request handlers into the SDK's request pipeline.
//
// // myFunc uses an SDK service client to make a request to
// // Amazon Rekognition.
// func myFunc(svc rekognitioniface.RekognitionAPI) bool {
// // Make svc.CompareFaces request
// }
//
// func main() {
// sess := session.New()
// svc := rekognition.New(sess)
//
// myFunc(svc)
// }
//
// In your _test.go file:
//
// // Define a mock struct to be used in your unit tests of myFunc.
// type mockRekognitionClient struct {
// rekognitioniface.RekognitionAPI
// }
// func (m *mockRekognitionClient) CompareFaces(input *rekognition.CompareFacesInput) (*rekognition.CompareFacesOutput, error) {
// // mock response/functionality
// }
//
// func TestMyFunc(t *testing.T) {
// // Setup Test
// mockSvc := &mockRekognitionClient{}
//
// myfunc(mockSvc)
//
// // Verify myFunc's functionality
// }
//
// It is important to note that this interface will have breaking changes
// when the service model is updated and adds new API operations, paginators,
// and waiters. Its suggested to use the pattern above for testing, or using
// tooling to generate mocks to satisfy the interfaces.
type RekognitionAPI interface {
CompareFaces(*rekognition.CompareFacesInput) (*rekognition.CompareFacesOutput, error)
CompareFacesWithContext(aws.Context, *rekognition.CompareFacesInput, ...request.Option) (*rekognition.CompareFacesOutput, error)
CompareFacesRequest(*rekognition.CompareFacesInput) (*request.Request, *rekognition.CompareFacesOutput)
CreateCollection(*rekognition.CreateCollectionInput) (*rekognition.CreateCollectionOutput, error)
CreateCollectionWithContext(aws.Context, *rekognition.CreateCollectionInput, ...request.Option) (*rekognition.CreateCollectionOutput, error)
CreateCollectionRequest(*rekognition.CreateCollectionInput) (*request.Request, *rekognition.CreateCollectionOutput)
CreateStreamProcessor(*rekognition.CreateStreamProcessorInput) (*rekognition.CreateStreamProcessorOutput, error)
CreateStreamProcessorWithContext(aws.Context, *rekognition.CreateStreamProcessorInput, ...request.Option) (*rekognition.CreateStreamProcessorOutput, error)
CreateStreamProcessorRequest(*rekognition.CreateStreamProcessorInput) (*request.Request, *rekognition.CreateStreamProcessorOutput)
DeleteCollection(*rekognition.DeleteCollectionInput) (*rekognition.DeleteCollectionOutput, error)
DeleteCollectionWithContext(aws.Context, *rekognition.DeleteCollectionInput, ...request.Option) (*rekognition.DeleteCollectionOutput, error)
DeleteCollectionRequest(*rekognition.DeleteCollectionInput) (*request.Request, *rekognition.DeleteCollectionOutput)
DeleteFaces(*rekognition.DeleteFacesInput) (*rekognition.DeleteFacesOutput, error)
DeleteFacesWithContext(aws.Context, *rekognition.DeleteFacesInput, ...request.Option) (*rekognition.DeleteFacesOutput, error)
DeleteFacesRequest(*rekognition.DeleteFacesInput) (*request.Request, *rekognition.DeleteFacesOutput)
DeleteStreamProcessor(*rekognition.DeleteStreamProcessorInput) (*rekognition.DeleteStreamProcessorOutput, error)
DeleteStreamProcessorWithContext(aws.Context, *rekognition.DeleteStreamProcessorInput, ...request.Option) (*rekognition.DeleteStreamProcessorOutput, error)
DeleteStreamProcessorRequest(*rekognition.DeleteStreamProcessorInput) (*request.Request, *rekognition.DeleteStreamProcessorOutput)
DescribeStreamProcessor(*rekognition.DescribeStreamProcessorInput) (*rekognition.DescribeStreamProcessorOutput, error)
DescribeStreamProcessorWithContext(aws.Context, *rekognition.DescribeStreamProcessorInput, ...request.Option) (*rekognition.DescribeStreamProcessorOutput, error)
DescribeStreamProcessorRequest(*rekognition.DescribeStreamProcessorInput) (*request.Request, *rekognition.DescribeStreamProcessorOutput)
DetectFaces(*rekognition.DetectFacesInput) (*rekognition.DetectFacesOutput, error)
DetectFacesWithContext(aws.Context, *rekognition.DetectFacesInput, ...request.Option) (*rekognition.DetectFacesOutput, error)
DetectFacesRequest(*rekognition.DetectFacesInput) (*request.Request, *rekognition.DetectFacesOutput)
DetectLabels(*rekognition.DetectLabelsInput) (*rekognition.DetectLabelsOutput, error)
DetectLabelsWithContext(aws.Context, *rekognition.DetectLabelsInput, ...request.Option) (*rekognition.DetectLabelsOutput, error)
DetectLabelsRequest(*rekognition.DetectLabelsInput) (*request.Request, *rekognition.DetectLabelsOutput)
DetectModerationLabels(*rekognition.DetectModerationLabelsInput) (*rekognition.DetectModerationLabelsOutput, error)
DetectModerationLabelsWithContext(aws.Context, *rekognition.DetectModerationLabelsInput, ...request.Option) (*rekognition.DetectModerationLabelsOutput, error)
DetectModerationLabelsRequest(*rekognition.DetectModerationLabelsInput) (*request.Request, *rekognition.DetectModerationLabelsOutput)
DetectText(*rekognition.DetectTextInput) (*rekognition.DetectTextOutput, error)
DetectTextWithContext(aws.Context, *rekognition.DetectTextInput, ...request.Option) (*rekognition.DetectTextOutput, error)
DetectTextRequest(*rekognition.DetectTextInput) (*request.Request, *rekognition.DetectTextOutput)
GetCelebrityInfo(*rekognition.GetCelebrityInfoInput) (*rekognition.GetCelebrityInfoOutput, error)
GetCelebrityInfoWithContext(aws.Context, *rekognition.GetCelebrityInfoInput, ...request.Option) (*rekognition.GetCelebrityInfoOutput, error)
GetCelebrityInfoRequest(*rekognition.GetCelebrityInfoInput) (*request.Request, *rekognition.GetCelebrityInfoOutput)
GetCelebrityRecognition(*rekognition.GetCelebrityRecognitionInput) (*rekognition.GetCelebrityRecognitionOutput, error)
GetCelebrityRecognitionWithContext(aws.Context, *rekognition.GetCelebrityRecognitionInput, ...request.Option) (*rekognition.GetCelebrityRecognitionOutput, error)
GetCelebrityRecognitionRequest(*rekognition.GetCelebrityRecognitionInput) (*request.Request, *rekognition.GetCelebrityRecognitionOutput)
GetCelebrityRecognitionPages(*rekognition.GetCelebrityRecognitionInput, func(*rekognition.GetCelebrityRecognitionOutput, bool) bool) error
GetCelebrityRecognitionPagesWithContext(aws.Context, *rekognition.GetCelebrityRecognitionInput, func(*rekognition.GetCelebrityRecognitionOutput, bool) bool, ...request.Option) error
GetContentModeration(*rekognition.GetContentModerationInput) (*rekognition.GetContentModerationOutput, error)
GetContentModerationWithContext(aws.Context, *rekognition.GetContentModerationInput, ...request.Option) (*rekognition.GetContentModerationOutput, error)
GetContentModerationRequest(*rekognition.GetContentModerationInput) (*request.Request, *rekognition.GetContentModerationOutput)
GetContentModerationPages(*rekognition.GetContentModerationInput, func(*rekognition.GetContentModerationOutput, bool) bool) error
GetContentModerationPagesWithContext(aws.Context, *rekognition.GetContentModerationInput, func(*rekognition.GetContentModerationOutput, bool) bool, ...request.Option) error
GetFaceDetection(*rekognition.GetFaceDetectionInput) (*rekognition.GetFaceDetectionOutput, error)
GetFaceDetectionWithContext(aws.Context, *rekognition.GetFaceDetectionInput, ...request.Option) (*rekognition.GetFaceDetectionOutput, error)
GetFaceDetectionRequest(*rekognition.GetFaceDetectionInput) (*request.Request, *rekognition.GetFaceDetectionOutput)
GetFaceDetectionPages(*rekognition.GetFaceDetectionInput, func(*rekognition.GetFaceDetectionOutput, bool) bool) error
GetFaceDetectionPagesWithContext(aws.Context, *rekognition.GetFaceDetectionInput, func(*rekognition.GetFaceDetectionOutput, bool) bool, ...request.Option) error
GetFaceSearch(*rekognition.GetFaceSearchInput) (*rekognition.GetFaceSearchOutput, error)
GetFaceSearchWithContext(aws.Context, *rekognition.GetFaceSearchInput, ...request.Option) (*rekognition.GetFaceSearchOutput, error)
GetFaceSearchRequest(*rekognition.GetFaceSearchInput) (*request.Request, *rekognition.GetFaceSearchOutput)
GetFaceSearchPages(*rekognition.GetFaceSearchInput, func(*rekognition.GetFaceSearchOutput, bool) bool) error
GetFaceSearchPagesWithContext(aws.Context, *rekognition.GetFaceSearchInput, func(*rekognition.GetFaceSearchOutput, bool) bool, ...request.Option) error
GetLabelDetection(*rekognition.GetLabelDetectionInput) (*rekognition.GetLabelDetectionOutput, error)
GetLabelDetectionWithContext(aws.Context, *rekognition.GetLabelDetectionInput, ...request.Option) (*rekognition.GetLabelDetectionOutput, error)
GetLabelDetectionRequest(*rekognition.GetLabelDetectionInput) (*request.Request, *rekognition.GetLabelDetectionOutput)
GetLabelDetectionPages(*rekognition.GetLabelDetectionInput, func(*rekognition.GetLabelDetectionOutput, bool) bool) error
GetLabelDetectionPagesWithContext(aws.Context, *rekognition.GetLabelDetectionInput, func(*rekognition.GetLabelDetectionOutput, bool) bool, ...request.Option) error
GetPersonTracking(*rekognition.GetPersonTrackingInput) (*rekognition.GetPersonTrackingOutput, error)
GetPersonTrackingWithContext(aws.Context, *rekognition.GetPersonTrackingInput, ...request.Option) (*rekognition.GetPersonTrackingOutput, error)
GetPersonTrackingRequest(*rekognition.GetPersonTrackingInput) (*request.Request, *rekognition.GetPersonTrackingOutput)
GetPersonTrackingPages(*rekognition.GetPersonTrackingInput, func(*rekognition.GetPersonTrackingOutput, bool) bool) error
GetPersonTrackingPagesWithContext(aws.Context, *rekognition.GetPersonTrackingInput, func(*rekognition.GetPersonTrackingOutput, bool) bool, ...request.Option) error
IndexFaces(*rekognition.IndexFacesInput) (*rekognition.IndexFacesOutput, error)
IndexFacesWithContext(aws.Context, *rekognition.IndexFacesInput, ...request.Option) (*rekognition.IndexFacesOutput, error)
IndexFacesRequest(*rekognition.IndexFacesInput) (*request.Request, *rekognition.IndexFacesOutput)
ListCollections(*rekognition.ListCollectionsInput) (*rekognition.ListCollectionsOutput, error)
ListCollectionsWithContext(aws.Context, *rekognition.ListCollectionsInput, ...request.Option) (*rekognition.ListCollectionsOutput, error)
ListCollectionsRequest(*rekognition.ListCollectionsInput) (*request.Request, *rekognition.ListCollectionsOutput)
ListCollectionsPages(*rekognition.ListCollectionsInput, func(*rekognition.ListCollectionsOutput, bool) bool) error
ListCollectionsPagesWithContext(aws.Context, *rekognition.ListCollectionsInput, func(*rekognition.ListCollectionsOutput, bool) bool, ...request.Option) error
ListFaces(*rekognition.ListFacesInput) (*rekognition.ListFacesOutput, error)
ListFacesWithContext(aws.Context, *rekognition.ListFacesInput, ...request.Option) (*rekognition.ListFacesOutput, error)
ListFacesRequest(*rekognition.ListFacesInput) (*request.Request, *rekognition.ListFacesOutput)
ListFacesPages(*rekognition.ListFacesInput, func(*rekognition.ListFacesOutput, bool) bool) error
ListFacesPagesWithContext(aws.Context, *rekognition.ListFacesInput, func(*rekognition.ListFacesOutput, bool) bool, ...request.Option) error
ListStreamProcessors(*rekognition.ListStreamProcessorsInput) (*rekognition.ListStreamProcessorsOutput, error)
ListStreamProcessorsWithContext(aws.Context, *rekognition.ListStreamProcessorsInput, ...request.Option) (*rekognition.ListStreamProcessorsOutput, error)
ListStreamProcessorsRequest(*rekognition.ListStreamProcessorsInput) (*request.Request, *rekognition.ListStreamProcessorsOutput)
ListStreamProcessorsPages(*rekognition.ListStreamProcessorsInput, func(*rekognition.ListStreamProcessorsOutput, bool) bool) error
ListStreamProcessorsPagesWithContext(aws.Context, *rekognition.ListStreamProcessorsInput, func(*rekognition.ListStreamProcessorsOutput, bool) bool, ...request.Option) error
RecognizeCelebrities(*rekognition.RecognizeCelebritiesInput) (*rekognition.RecognizeCelebritiesOutput, error)
RecognizeCelebritiesWithContext(aws.Context, *rekognition.RecognizeCelebritiesInput, ...request.Option) (*rekognition.RecognizeCelebritiesOutput, error)
RecognizeCelebritiesRequest(*rekognition.RecognizeCelebritiesInput) (*request.Request, *rekognition.RecognizeCelebritiesOutput)
SearchFaces(*rekognition.SearchFacesInput) (*rekognition.SearchFacesOutput, error)
SearchFacesWithContext(aws.Context, *rekognition.SearchFacesInput, ...request.Option) (*rekognition.SearchFacesOutput, error)
SearchFacesRequest(*rekognition.SearchFacesInput) (*request.Request, *rekognition.SearchFacesOutput)
SearchFacesByImage(*rekognition.SearchFacesByImageInput) (*rekognition.SearchFacesByImageOutput, error)
SearchFacesByImageWithContext(aws.Context, *rekognition.SearchFacesByImageInput, ...request.Option) (*rekognition.SearchFacesByImageOutput, error)
SearchFacesByImageRequest(*rekognition.SearchFacesByImageInput) (*request.Request, *rekognition.SearchFacesByImageOutput)
StartCelebrityRecognition(*rekognition.StartCelebrityRecognitionInput) (*rekognition.StartCelebrityRecognitionOutput, error)
StartCelebrityRecognitionWithContext(aws.Context, *rekognition.StartCelebrityRecognitionInput, ...request.Option) (*rekognition.StartCelebrityRecognitionOutput, error)
StartCelebrityRecognitionRequest(*rekognition.StartCelebrityRecognitionInput) (*request.Request, *rekognition.StartCelebrityRecognitionOutput)
StartContentModeration(*rekognition.StartContentModerationInput) (*rekognition.StartContentModerationOutput, error)
StartContentModerationWithContext(aws.Context, *rekognition.StartContentModerationInput, ...request.Option) (*rekognition.StartContentModerationOutput, error)
StartContentModerationRequest(*rekognition.StartContentModerationInput) (*request.Request, *rekognition.StartContentModerationOutput)
StartFaceDetection(*rekognition.StartFaceDetectionInput) (*rekognition.StartFaceDetectionOutput, error)
StartFaceDetectionWithContext(aws.Context, *rekognition.StartFaceDetectionInput, ...request.Option) (*rekognition.StartFaceDetectionOutput, error)
StartFaceDetectionRequest(*rekognition.StartFaceDetectionInput) (*request.Request, *rekognition.StartFaceDetectionOutput)
StartFaceSearch(*rekognition.StartFaceSearchInput) (*rekognition.StartFaceSearchOutput, error)
StartFaceSearchWithContext(aws.Context, *rekognition.StartFaceSearchInput, ...request.Option) (*rekognition.StartFaceSearchOutput, error)
StartFaceSearchRequest(*rekognition.StartFaceSearchInput) (*request.Request, *rekognition.StartFaceSearchOutput)
StartLabelDetection(*rekognition.StartLabelDetectionInput) (*rekognition.StartLabelDetectionOutput, error)
StartLabelDetectionWithContext(aws.Context, *rekognition.StartLabelDetectionInput, ...request.Option) (*rekognition.StartLabelDetectionOutput, error)
StartLabelDetectionRequest(*rekognition.StartLabelDetectionInput) (*request.Request, *rekognition.StartLabelDetectionOutput)
StartPersonTracking(*rekognition.StartPersonTrackingInput) (*rekognition.StartPersonTrackingOutput, error)
StartPersonTrackingWithContext(aws.Context, *rekognition.StartPersonTrackingInput, ...request.Option) (*rekognition.StartPersonTrackingOutput, error)
StartPersonTrackingRequest(*rekognition.StartPersonTrackingInput) (*request.Request, *rekognition.StartPersonTrackingOutput)
StartStreamProcessor(*rekognition.StartStreamProcessorInput) (*rekognition.StartStreamProcessorOutput, error)
StartStreamProcessorWithContext(aws.Context, *rekognition.StartStreamProcessorInput, ...request.Option) (*rekognition.StartStreamProcessorOutput, error)
StartStreamProcessorRequest(*rekognition.StartStreamProcessorInput) (*request.Request, *rekognition.StartStreamProcessorOutput)
StopStreamProcessor(*rekognition.StopStreamProcessorInput) (*rekognition.StopStreamProcessorOutput, error)
StopStreamProcessorWithContext(aws.Context, *rekognition.StopStreamProcessorInput, ...request.Option) (*rekognition.StopStreamProcessorOutput, error)
StopStreamProcessorRequest(*rekognition.StopStreamProcessorInput) (*request.Request, *rekognition.StopStreamProcessorOutput)
}
var _ RekognitionAPI = (*rekognition.Rekognition)(nil)
```
|
The Nokia 3200 is a mobile phone by Nokia, part of the Nokia Expression (youth) series and announced on 12 September 2003. It is based on the Nokia Series 40 platform. The phone is an update of the Nokia 3100, while adding features from the Nokia 7250i and 6610i. The phone's feature set was very similar to the 7250i and 6610i, but featured different software and firmware installed, and was sold at a lower price than the 7250i or 6610i. Of the three phones, the 3200 was mainly targeted towards the youth market, the 7250i towards fashion-conscious users, and the 6610i towards business users. Core features include an XHTML browser, alarm clock, flashlight, EDGE and FM stereo radio with a 128 × 128 12-bit (4096) color screen. The phone has multimedia features such as picture and text messaging. Features carried over from the Nokia 3100 include ringer profiles and voice memo capability. It also has Java games (max downloadable size of game or application cannot exceed 64 kB). The phone has an extensive calendar with a lunar calendar (for the Chinese/Asian variants). The flashlight is located under the phone and can be activated by holding the "star" (asterisk) key. The camera is on the back of the phone. The 3200 can also play both polyphonic and monophonic ringtones. The phone's visual interface in its menu system is similar to that of the Nokia 3100, using large, static icons rather than animated ones.
An interesting feature present in this phone is that the face plate system allows users to print out their own cut-out cover designs and use it in the phone. The official special released designs include "Snowboard," "Street life" and "Urban chic". It was thus marketed as being "fun and funky" with a unique style.
While the phone's feature set was an improvement over the Nokia 3100, the 3200 did not quite enjoy the popularity that the 3100 did. Some known complaints with the phone included its low CIF resolution camera, quirky keypad design, and its small 12-bit color display. This kept the 3100, and its redesign, the 3120, in production, while the 3200 was discontinued and replaced by its successor, the Nokia 3220. The Nokia 3220 addresses some of the 3200's known flaws, upgrading to a higher VGA resolution camera with video recording capability, redesigning the keypad to a more standard layout, and improving the display to a 16-bit color LCD.
Versions
Nokia 3200b (RH-31) for North America - Operates on GSM 850/1800/1900 with GPRS and EDGE technology.
Nokia 3200 (RH-30) for Europe / Asia - Operates on GSM 900/1800/1900 with GPRS and EDGE technology.
Nokia 3205 - Operates on CDMA2000 800/1900 and AMPS 800 with CDMA2000 1xRTT technology. Features a VGA camera, a timer and night mode.
To check version type *#0000# while phone is powered on.
Reception
Kent German of CNET gave the phone 3.5 out of 5 stars, lauding its extensive personalization options, its ability to send and receive instant messages, built-in speakerphone FM radio, decent battery life, infra-red port, and compatibility with the EDGE network while panning its "somewhat flimsy" plastic casing, "confusing" keypad layout, "unintuitive" multimedia messaging, "basic" CIF camera and its 1 MB of shared memory.
The PhoneArena team was more positive, giving the phone a 7 out of 10. Unlike CNET they said camera was of "satisfactory" quality and its battery life was "good", they further praised its flashlight, FM radio and speakerphone however they panned its lack of appeal for the youth market with its "same old form factor" with the "same old series 40 graphic platform".
References
Related handsets
Nokia 3100
Nokia 3220
Nokia 6610i
Nokia 7250i
3200
Mobile phones with infrared transmitter
|
Trees Dream in Algebra is the first studio album from Irish alternative-rock group Codes.
Track listing
Peak positions
External links
Codes' official site
2009 debut albums
Codes (band) albums
|
The Calle de la Montera is a pedestrian street in the centre of Madrid. Starting from the south, it links the Puerta del Sol and the so-called Red de San Luis (the junction with the Gran Vía). It presents a south-north positive slope.
All its path falls within the limits of the Sol neighborhood, in turn part of the Centro District of the Spanish capital.
History
The popular folklore is fertile in bringing explanations for the name of the street. However the reason for the name is the house of Juan Carlos and Francisco Lamontera, documented to exist in the area by the mid 16th century.
By the end of the 17th century the Church of San Luis Obispo was built in the street.
During the 18th century Montera was a luxury street. The writer Valle Inclán set in 1920 an scene of his play Bohemian Lights in the street; the place where the "taberna Pica Lagartos" was located. The onset of the 20th century saw the street becoming one of the main commercial streets in the city centre, with a plethora of merceries, shirt-shops, other textile stores, jewellery and shoe-stores. Parts of the street were affected by the construction of the Gran Vía, whose works started in 1910. During the 20th century the upper segment of the street also became known by the visible street prostitution, gaining a long-lasting reputation in that regard.
The Church of San Luis Obispo suffered a fire in March 1936 that led to its destruction, with the complete demolition taking place in 1943.
More recently CCTV control was installed in the area. The street was pedestrianised in two steps: first the segment between the Puerta del Sol to Aduana Street in 2006. The process was completed in 2009. With the street having several business premises closed during the 21st century, by the end of the decade of 2010 the impending gentrification of the city-centre began to considerably increase the interest for real estate in the street.
A rare surviving example of work by the pioneering flechero artist Muelle was restored in 2016 and can be seen on a wall of the street.
In August 2018 works towards the creation of a pedestrian underground connection between the Metro stations of Sol and Gran Vía passing below the street started.
References
Streets in Madrid
Sol neighborhood, Madrid
|
```c++
// Use, modification and distribution are subject to the
// LICENSE_1_0.txt or copy at path_to_url
static const boost::array<boost::array<typename table_type<T>::type, 4>, 190> tgamma_delta_ratio_int2 = { {
{{ SC_(0.11e2), SC_(0.1e2), SC_(0.1491552059147518383844493235618106619139e-11), SC_(0.36288e7) }},
{{ SC_(0.12e2), SC_(0.1e2), SC_(0.7812891738391762962994964567523415624059e-12), SC_(0.399168e8) }},
{{ SC_(0.12e2), SC_(0.11e2), SC_(0.3551314426541710437724983894328825283663e-13), SC_(0.399168e8) }},
{{ SC_(0.13e2), SC_(0.1e2), SC_(0.4261577311850052525269980673194590340396e-12), SC_(0.2395008e9) }},
{{ SC_(0.13e2), SC_(0.11e2), SC_(0.1852859700804370663160861162258517539303e-13), SC_(0.4790016e9) }},
{{ SC_(0.13e2), SC_(0.12e2), SC_(0.7720248753351544429836921509410489747094e-15), SC_(0.4790016e9) }},
{{ SC_(0.14e2), SC_(0.1e2), SC_(0.2408717611045681862109119510936072801093e-12), SC_(0.10378368e10) }},
{{ SC_(0.14e2), SC_(0.11e2), SC_(0.1003632337935700775878799796223363667122e-13), SC_(0.31135104e10) }},
{{ SC_(0.14e2), SC_(0.12e2), SC_(0.4014529351742803103515199184893454668489e-15), SC_(0.62270208e10) }},
{{ SC_(0.14e2), SC_(0.13e2), SC_(0.1544049750670308885967384301882097949419e-16), SC_(0.62270208e10) }},
{{ SC_(0.15e2), SC_(0.1e2), SC_(0.1405085273109981086230319714712709133971e-12), SC_(0.36324288e10) }},
{{ SC_(0.15e2), SC_(0.11e2), SC_(0.5620341092439924344921278858850836535885e-14), SC_(0.145297152e11) }},
{{ SC_(0.15e2), SC_(0.12e2), SC_(0.2161669650938432440354338022634937129186e-15), SC_(0.435891456e11) }},
{{ SC_(0.15e2), SC_(0.13e2), SC_(0.8006183892364564593904955639388656034024e-17), SC_(0.871782912e11) }},
{{ SC_(0.15e2), SC_(0.14e2), SC_(0.2859351390130201640680341299781662869294e-18), SC_(0.871782912e11) }},
{{ SC_(0.16e2), SC_(0.1e2), SC_(0.8430511638659886517381918288276254803827e-13), SC_(0.108972864e11) }},
{{ SC_(0.16e2), SC_(0.11e2), SC_(0.324250447640764866053150703395240569378e-14), SC_(0.54486432e11) }},
{{ SC_(0.16e2), SC_(0.12e2), SC_(0.1200927583854684689085743345908298405104e-15), SC_(0.217945728e12) }},
{{ SC_(0.16e2), SC_(0.13e2), SC_(0.4289027085195302461020511949672494303941e-17), SC_(0.653837184e12) }},
{{ SC_(0.16e2), SC_(0.14e2), SC_(0.1478974856963897400351900672300860104807e-18), SC_(0.1307674368e13) }},
{{ SC_(0.16e2), SC_(0.15e2), SC_(0.4929916189879658001173002241002867016024e-20), SC_(0.1307674368e13) }},
{{ SC_(0.17e2), SC_(0.1e2), SC_(0.5188007162252237856850411254323849110047e-13), SC_(0.290594304e11) }},
{{ SC_(0.17e2), SC_(0.11e2), SC_(0.1921484134167495502537189353453277448166e-14), SC_(0.1743565824e12) }},
{{ SC_(0.17e2), SC_(0.12e2), SC_(0.6862443336312483937632819119475990886306e-16), SC_(0.871782912e12) }},
{{ SC_(0.17e2), SC_(0.13e2), SC_(0.2366359771142235840563041075681376167692e-17), SC_(0.3487131648e13) }},
{{ SC_(0.17e2), SC_(0.14e2), SC_(0.7887865903807452801876803585604587225639e-19), SC_(0.10461394944e14) }},
{{ SC_(0.17e2), SC_(0.15e2), SC_(0.254447287219595251673445276954986684698e-20), SC_(0.20922789888e14) }},
{{ SC_(0.17e2), SC_(0.16e2), SC_(0.7951477725612351614795164904843333896814e-22), SC_(0.20922789888e14) }},
{{ SC_(0.18e2), SC_(0.1e2), SC_(0.3266523028084742354313221900870571661882e-13), SC_(0.705729024e11) }},
{{ SC_(0.18e2), SC_(0.11e2), SC_(0.1166615367173122269397579250310918450672e-14), SC_(0.4940103168e12) }},
{{ SC_(0.18e2), SC_(0.12e2), SC_(0.4022811610941800928957169828658339485076e-16), SC_(0.29640619008e13) }},
{{ SC_(0.18e2), SC_(0.13e2), SC_(0.1340937203647266976319056609552779828359e-17), SC_(0.14820309504e14) }},
{{ SC_(0.18e2), SC_(0.14e2), SC_(0.4325603882733119278448569708234773639867e-19), SC_(0.59281238016e14) }},
{{ SC_(0.18e2), SC_(0.15e2), SC_(0.1351751213354099774515178033823366762458e-20), SC_(0.177843714048e15) }},
{{ SC_(0.18e2), SC_(0.16e2), SC_(0.4096215798042726589439933435828384128662e-22), SC_(0.355687428096e15) }},
{{ SC_(0.18e2), SC_(0.17e2), SC_(0.1204769352365507820423509834067171802548e-23), SC_(0.355687428096e15) }},
{{ SC_(0.19e2), SC_(0.1e2), SC_(0.209990766091162008491564265055965321121e-13), SC_(0.1587890304e12) }},
{{ SC_(0.19e2), SC_(0.11e2), SC_(0.7241060899695241672122905691585011073137e-15), SC_(0.12703122432e13) }},
{{ SC_(0.19e2), SC_(0.12e2), SC_(0.2413686966565080557374301897195003691046e-16), SC_(0.88921857024e13) }},
{{ SC_(0.19e2), SC_(0.13e2), SC_(0.778608698891961470120742547482259255176e-18), SC_(0.533531142144e14) }},
{{ SC_(0.19e2), SC_(0.14e2), SC_(0.2433152184037379594127320460882060172425e-19), SC_(0.266765571072e15) }},
{{ SC_(0.19e2), SC_(0.15e2), SC_(0.7373188436476907860991880184491091431591e-21), SC_(0.1067062284288e16) }},
{{ SC_(0.19e2), SC_(0.16e2), SC_(0.2168584834257914076762317701320909244586e-22), SC_(0.3201186852864e16) }},
{{ SC_(0.19e2), SC_(0.17e2), SC_(0.6195956669308325933606622003774026413102e-24), SC_(0.6402373705728e16) }},
{{ SC_(0.19e2), SC_(0.18e2), SC_(0.1721099074807868314890728334381674003639e-25), SC_(0.6402373705728e16) }},
{{ SC_(0.2e2), SC_(0.1e2), SC_(0.1375801570942095917703352081401152103896e-13), SC_(0.3352212864e12) }},
{{ SC_(0.2e2), SC_(0.11e2), SC_(0.4586005236473653059011173604670507012987e-15), SC_(0.30169915776e13) }},
{{ SC_(0.2e2), SC_(0.12e2), SC_(0.1479356527894726793229410840216292584834e-16), SC_(0.241359326208e14) }},
{{ SC_(0.2e2), SC_(0.13e2), SC_(0.4622989149671021228841908875675914327607e-18), SC_(0.1689515283456e15) }},
{{ SC_(0.2e2), SC_(0.14e2), SC_(0.1400905802930612493588457235053307372002e-19), SC_(0.10137091700736e16) }},
{{ SC_(0.2e2), SC_(0.15e2), SC_(0.4120311185090036745848403632509727564713e-21), SC_(0.5068545850368e16) }},
{{ SC_(0.2e2), SC_(0.16e2), SC_(0.1177231767168581927385258180717065018489e-22), SC_(0.20274183401472e17) }},
{{ SC_(0.2e2), SC_(0.17e2), SC_(0.3270088242134949798292383835325180606915e-24), SC_(0.60822550204416e17) }},
{{ SC_(0.2e2), SC_(0.18e2), SC_(0.8838076330094458914303740095473461099769e-26), SC_(0.121645100408832e18) }},
{{ SC_(0.2e2), SC_(0.19e2), SC_(0.2325809560551173398500984235650910815729e-27), SC_(0.121645100408832e18) }},
{{ SC_(0.21e2), SC_(0.1e2), SC_(0.9172010472947306118022347209341014025973e-14), SC_(0.6704425728e12) }},
{{ SC_(0.21e2), SC_(0.11e2), SC_(0.2958713055789453586458821680432585169669e-15), SC_(0.6704425728e13) }},
{{ SC_(0.21e2), SC_(0.12e2), SC_(0.9245978299342042457683817751351828655215e-17), SC_(0.60339831552e14) }},
{{ SC_(0.21e2), SC_(0.13e2), SC_(0.2801811605861224987176914470106614744005e-18), SC_(0.482718652416e15) }},
{{ SC_(0.21e2), SC_(0.14e2), SC_(0.8240622370180073491696807265019455129425e-20), SC_(0.3379030566912e16) }},
{{ SC_(0.21e2), SC_(0.15e2), SC_(0.2354463534337163854770516361434130036979e-21), SC_(0.20274183401472e17) }},
{{ SC_(0.21e2), SC_(0.16e2), SC_(0.6540176484269899596584767670650361213829e-23), SC_(0.10137091700736e18) }},
{{ SC_(0.21e2), SC_(0.17e2), SC_(0.1767615266018891782860748019094692219954e-24), SC_(0.40548366802944e18) }},
{{ SC_(0.21e2), SC_(0.18e2), SC_(0.4651619121102346797001968471301821631458e-26), SC_(0.121645100408832e19) }},
{{ SC_(0.21e2), SC_(0.19e2), SC_(0.1192722851564704306923581659308159392681e-27), SC_(0.243290200817664e19) }},
{{ SC_(0.21e2), SC_(0.2e2), SC_(0.2981807128911760767308954148270398481704e-29), SC_(0.243290200817664e19) }},
{{ SC_(0.22e2), SC_(0.1e2), SC_(0.6213297417157852531563525528908428856304e-14), SC_(0.12799358208e13) }},
{{ SC_(0.22e2), SC_(0.11e2), SC_(0.1941655442861828916113601727783884017595e-15), SC_(0.140792940288e14) }},
{{ SC_(0.22e2), SC_(0.12e2), SC_(0.5883804372308572473071520387223890962409e-17), SC_(0.140792940288e15) }},
{{ SC_(0.22e2), SC_(0.13e2), SC_(0.1730530697737815433256329525654085577179e-18), SC_(0.1267136462592e16) }},
{{ SC_(0.22e2), SC_(0.14e2), SC_(0.4944373422108044095018084359011673077655e-20), SC_(0.10137091700736e17) }},
{{ SC_(0.22e2), SC_(0.15e2), SC_(0.1373437061696678915282801210836575854904e-21), SC_(0.70959641905152e17) }},
{{ SC_(0.22e2), SC_(0.16e2), SC_(0.3711992058639672744007570840098853661903e-23), SC_(0.425757851430912e18) }},
{{ SC_(0.22e2), SC_(0.17e2), SC_(0.9768400154314928273704133789733825426061e-25), SC_(0.212878925715456e19) }},
{{ SC_(0.22e2), SC_(0.18e2), SC_(0.2504717988285879044539521484547134724631e-26), SC_(0.851515702861824e19) }},
{{ SC_(0.22e2), SC_(0.19e2), SC_(0.6261794970714697611348803711367836811578e-28), SC_(0.2554547108585472e20) }},
{{ SC_(0.22e2), SC_(0.2e2), SC_(0.1527267066027975027158244807650691905263e-29), SC_(0.5109094217170944e20) }},
{{ SC_(0.22e2), SC_(0.21e2), SC_(0.3636350157209464350376773351549266441102e-31), SC_(0.5109094217170944e20) }},
{{ SC_(0.23e2), SC_(0.1e2), SC_(0.4271641974296023615449923801124544838709e-14), SC_(0.23465490048e13) }},
{{ SC_(0.23e2), SC_(0.11e2), SC_(0.129443696190788594407573448518925601173e-15), SC_(0.281585880576e14) }},
{{ SC_(0.23e2), SC_(0.12e2), SC_(0.3807167535023193953163924956438988269794e-17), SC_(0.3097444686336e15) }},
{{ SC_(0.23e2), SC_(0.13e2), SC_(0.1087762152863769700903978558982568077084e-18), SC_(0.3097444686336e16) }},
{{ SC_(0.23e2), SC_(0.14e2), SC_(0.3021561535732693613622162663840466880789e-20), SC_(0.27877002177024e17) }},
{{ SC_(0.23e2), SC_(0.15e2), SC_(0.8166382529007280036816655848217478056187e-22), SC_(0.223016017416192e18) }},
{{ SC_(0.23e2), SC_(0.16e2), SC_(0.2149048033949284220214909433741441593733e-23), SC_(0.1561112121913344e19) }},
{{ SC_(0.23e2), SC_(0.17e2), SC_(0.5510379574228933897986947266003696394188e-25), SC_(0.9366672731480064e19) }},
{{ SC_(0.23e2), SC_(0.18e2), SC_(0.1377594893557233474496736816500924098547e-26), SC_(0.4683336365740032e20) }},
{{ SC_(0.23e2), SC_(0.19e2), SC_(0.3359987545261545059748138576831522191578e-28), SC_(0.18733345462960128e21) }},
{{ SC_(0.23e2), SC_(0.2e2), SC_(0.7999970345860821570828901373408386170424e-30), SC_(0.56200036388880384e21) }},
{{ SC_(0.23e2), SC_(0.21e2), SC_(0.1860458219967632923448581714746136318703e-31), SC_(0.112400072777760768e22) }},
{{ SC_(0.23e2), SC_(0.22e2), SC_(0.4228314136290074826019503897150309815235e-33), SC_(0.112400072777760768e22) }},
{{ SC_(0.24e2), SC_(0.1e2), SC_(0.2977205012388137671374189315935288826979e-14), SC_(0.41515867008e13) }},
{{ SC_(0.24e2), SC_(0.11e2), SC_(0.8756485330553346092277027399809673020527e-16), SC_(0.539706271104e14) }},
{{ SC_(0.24e2), SC_(0.12e2), SC_(0.2501852951586670312079150685659906577293e-17), SC_(0.6476475253248e15) }},
{{ SC_(0.24e2), SC_(0.13e2), SC_(0.6949591532185195311330974126833073825815e-19), SC_(0.71241227785728e16) }},
{{ SC_(0.24e2), SC_(0.14e2), SC_(0.1878267981671674408467830845090019952923e-20), SC_(0.71241227785728e17) }},
{{ SC_(0.24e2), SC_(0.15e2), SC_(0.4942810478083353706494291697605315665587e-22), SC_(0.641171050071552e18) }},
{{ SC_(0.24e2), SC_(0.16e2), SC_(0.1267387302072654796536997871180850170663e-23), SC_(0.5129368400572416e19) }},
{{ SC_(0.24e2), SC_(0.17e2), SC_(0.3168468255181636991342494677952125426658e-25), SC_(0.35905578804006912e20) }},
{{ SC_(0.24e2), SC_(0.18e2), SC_(0.772797135410155363742071872671250104063e-27), SC_(0.215433472824041472e21) }},
{{ SC_(0.24e2), SC_(0.19e2), SC_(0.1839993179547988961290647315883928819198e-28), SC_(0.107716736412020736e22) }},
{{ SC_(0.24e2), SC_(0.2e2), SC_(0.4279053905925555723931737943916113533018e-30), SC_(0.430866945648082944e22) }},
{{ SC_(0.24e2), SC_(0.21e2), SC_(0.972512251346717209984485896344571257504e-32), SC_(0.1292600836944248832e23) }},
{{ SC_(0.24e2), SC_(0.22e2), SC_(0.2161138336326038244409968658543491683342e-33), SC_(0.2585201673888497664e23) }},
{{ SC_(0.24e2), SC_(0.23e2), SC_(0.4698126818100083140021670996833677572483e-35), SC_(0.2585201673888497664e23) }},
{{ SC_(0.25e2), SC_(0.1e2), SC_(0.2101556479332803062146486575954321524926e-14), SC_(0.71170057728e13) }},
{{ SC_(0.25e2), SC_(0.11e2), SC_(0.6004447083808008748989961645583775785504e-16), SC_(0.996380808192e14) }},
{{ SC_(0.25e2), SC_(0.12e2), SC_(0.1667901967724446874719433790439937718196e-17), SC_(0.12952950506496e16) }},
{{ SC_(0.25e2), SC_(0.13e2), SC_(0.4507843156012018580322794028216047887015e-19), SC_(0.155435406077952e17) }},
{{ SC_(0.25e2), SC_(0.14e2), SC_(0.1186274514740004889558630007425275759741e-20), SC_(0.1709789466857472e18) }},
{{ SC_(0.25e2), SC_(0.15e2), SC_(0.3041729524974371511688794890834040409592e-22), SC_(0.1709789466857472e19) }},
{{ SC_(0.25e2), SC_(0.16e2), SC_(0.760432381243592877922198722708510102398e-24), SC_(0.15388105201717248e20) }},
{{ SC_(0.25e2), SC_(0.17e2), SC_(0.1854713124984372872980972494411000249751e-25), SC_(0.123104841613737984e21) }},
{{ SC_(0.25e2), SC_(0.18e2), SC_(0.4415983630915173507097553558121429166074e-27), SC_(0.861733891296165888e21) }},
{{ SC_(0.25e2), SC_(0.19e2), SC_(0.1026972937422133373743617106539867247924e-28), SC_(0.5170403347776995328e22) }},
{{ SC_(0.25e2), SC_(0.2e2), SC_(0.233402940323212130396276615122697101801e-30), SC_(0.2585201673888497664e23) }},
{{ SC_(0.25e2), SC_(0.21e2), SC_(0.5186732007182491786583924780504380040021e-32), SC_(0.10340806695553990656e24) }},
{{ SC_(0.25e2), SC_(0.22e2), SC_(0.1127550436344019953605201039240082617396e-33), SC_(0.31022420086661971968e24) }},
{{ SC_(0.25e2), SC_(0.23e2), SC_(0.2399043481583021177883406466468260888076e-35), SC_(0.62044840173323943936e24) }},
{{ SC_(0.25e2), SC_(0.24e2), SC_(0.4998007253297960787257096805142210183493e-37), SC_(0.62044840173323943936e24) }},
{{ SC_(0.26e2), SC_(0.1e2), SC_(0.1501111770952002187247490411395943946376e-14), SC_(0.11861676288e14) }},
{{ SC_(0.26e2), SC_(0.11e2), SC_(0.4169754919311117186798584476099844295489e-16), SC_(0.17792514432e15) }},
{{ SC_(0.26e2), SC_(0.12e2), SC_(0.1126960789003004645080698507054011971754e-17), SC_(0.249095202048e16) }},
{{ SC_(0.26e2), SC_(0.13e2), SC_(0.2965686286850012223896575018563189399352e-19), SC_(0.3238237626624e17) }},
{{ SC_(0.26e2), SC_(0.14e2), SC_(0.760432381243592877922198722708510102398e-21), SC_(0.38858851519488e18) }},
{{ SC_(0.26e2), SC_(0.15e2), SC_(0.1901080953108982194805496806771275255995e-22), SC_(0.427447366714368e19) }},
{{ SC_(0.26e2), SC_(0.16e2), SC_(0.4636782812460932182452431236027500624378e-24), SC_(0.427447366714368e20) }},
{{ SC_(0.26e2), SC_(0.17e2), SC_(0.1103995907728793376774388389530357291519e-25), SC_(0.3847026300429312e21) }},
{{ SC_(0.26e2), SC_(0.18e2), SC_(0.2567432343555333434359042766349668119811e-27), SC_(0.30776210403434496e22) }},
{{ SC_(0.26e2), SC_(0.19e2), SC_(0.5835073508080303259906915378067427545024e-29), SC_(0.215433472824041472e23) }},
{{ SC_(0.26e2), SC_(0.2e2), SC_(0.1296683001795622946645981195126095010005e-30), SC_(0.1292600836944248832e24) }},
{{ SC_(0.26e2), SC_(0.21e2), SC_(0.281887609086004988401300259810020654349e-32), SC_(0.646300418472124416e24) }},
{{ SC_(0.26e2), SC_(0.22e2), SC_(0.5997608703957552944708516166170652220191e-34), SC_(0.2585201673888497664e25) }},
{{ SC_(0.26e2), SC_(0.23e2), SC_(0.1249501813324490196814274201285552545873e-35), SC_(0.7755605021665492992e25) }},
{{ SC_(0.26e2), SC_(0.24e2), SC_(0.2550003700662224891457702451603168460966e-37), SC_(0.15511210043330985984e26) }},
{{ SC_(0.26e2), SC_(0.25e2), SC_(0.5100007401324449782915404903206336921931e-39), SC_(0.15511210043330985984e26) }},
{{ SC_(0.27e2), SC_(0.1e2), SC_(0.1084136279020890468567631963785959516827e-14), SC_(0.19275223968e14) }},
{{ SC_(0.27e2), SC_(0.11e2), SC_(0.293009805140781207720981611834043112656e-16), SC_(0.308403583488e15) }},
{{ SC_(0.27e2), SC_(0.12e2), SC_(0.7710784345810031782131095048264292438315e-18), SC_(0.462605375232e16) }},
{{ SC_(0.27e2), SC_(0.13e2), SC_(0.1977124191233341482597716679042126266235e-19), SC_(0.6476475253248e17) }},
{{ SC_(0.27e2), SC_(0.14e2), SC_(0.4942810478083353706494291697605315665587e-21), SC_(0.84194178292224e18) }},
{{ SC_(0.27e2), SC_(0.15e2), SC_(0.1205563531239842367437632121367150162338e-22), SC_(0.1010330139506688e20) }},
{{ SC_(0.27e2), SC_(0.16e2), SC_(0.2870389360094862779613409812778928957948e-24), SC_(0.11113631534573568e21) }},
{{ SC_(0.27e2), SC_(0.17e2), SC_(0.6675324093243866929333511192509137111507e-26), SC_(0.11113631534573568e22) }},
{{ SC_(0.27e2), SC_(0.18e2), SC_(0.1517119112100878847575797998297531161706e-27), SC_(0.100022683811162112e23) }},
{{ SC_(0.27e2), SC_(0.19e2), SC_(0.3371375804668619661279551107327847026014e-29), SC_(0.800181470489296896e23) }},
{{ SC_(0.27e2), SC_(0.2e2), SC_(0.7329077836236129698433806755060537013074e-31), SC_(0.5601270293425078272e24) }},
{{ SC_(0.27e2), SC_(0.21e2), SC_(0.155937826302896376562421420320436957725e-32), SC_(0.33607621760550469632e25) }},
{{ SC_(0.27e2), SC_(0.22e2), SC_(0.324870471464367451171711292334243661927e-34), SC_(0.16803810880275234816e26) }},
{{ SC_(0.27e2), SC_(0.23e2), SC_(0.6630009621721784717790026374168237998511e-36), SC_(0.67215243521100939264e26) }},
{{ SC_(0.27e2), SC_(0.24e2), SC_(0.1326001924344356943558005274833647599702e-37), SC_(0.201645730563302817792e27) }},
{{ SC_(0.27e2), SC_(0.25e2), SC_(0.2600003773224229301094127989869897254318e-39), SC_(0.403291461126605635584e27) }},
{{ SC_(0.27e2), SC_(0.26e2), SC_(0.5000007256200440963642553826672879335227e-41), SC_(0.403291461126605635584e27) }},
{{ SC_(0.28e2), SC_(0.1e2), SC_(0.7911264738801092608466503519519164041712e-15), SC_(0.30613591008e14) }},
{{ SC_(0.28e2), SC_(0.11e2), SC_(0.2081911773368708581175395663031358958345e-16), SC_(0.520431047136e15) }},
{{ SC_(0.28e2), SC_(0.12e2), SC_(0.5338235316330022003013835033413740918834e-18), SC_(0.8326896754176e16) }},
{{ SC_(0.28e2), SC_(0.13e2), SC_(0.1334558829082505500753458758353435229708e-19), SC_(0.12490345131264e18) }},
{{ SC_(0.28e2), SC_(0.14e2), SC_(0.3255021534347574392081606727691305438313e-21), SC_(0.174864831837696e19) }},
{{ SC_(0.28e2), SC_(0.15e2), SC_(0.775005127225612950495620649450310818646e-23), SC_(0.2273242813890048e20) }},
{{ SC_(0.28e2), SC_(0.16e2), SC_(0.1802337505175844070920048021977467020107e-24), SC_(0.27278913766680576e21) }},
{{ SC_(0.28e2), SC_(0.17e2), SC_(0.4096221602672372888454654595403334136607e-26), SC_(0.300068051433486336e22) }},
{{ SC_(0.28e2), SC_(0.18e2), SC_(0.9102714672605273085454787989785186970237e-28), SC_(0.300068051433486336e23) }},
{{ SC_(0.28e2), SC_(0.19e2), SC_(0.197885101578375501857712782386634499353e-29), SC_(0.2700612462901377024e24) }},
{{ SC_(0.28e2), SC_(0.2e2), SC_(0.4210321310178202167185378348651797858574e-31), SC_(0.21604899703211016192e25) }},
{{ SC_(0.28e2), SC_(0.21e2), SC_(0.877150272953792118163620489302457887203e-33), SC_(0.151234297922477113344e26) }},
{{ SC_(0.28e2), SC_(0.22e2), SC_(0.1790102597864881873803307121025424259598e-34), SC_(0.907405787534862680064e26) }},
{{ SC_(0.28e2), SC_(0.23e2), SC_(0.3580205195729763747606614242050848519196e-36), SC_(0.453702893767431340032e27) }},
{{ SC_(0.28e2), SC_(0.24e2), SC_(0.7020010187705419112954145572648722586658e-38), SC_(0.1814811575069725360128e28) }},
{{ SC_(0.28e2), SC_(0.25e2), SC_(0.1350001959174119060183489533201677420511e-39), SC_(0.5444434725209176080384e28) }},
{{ SC_(0.28e2), SC_(0.26e2), SC_(0.2547173507875696339968848175852221548134e-41), SC_(0.10888869450418352160768e29) }},
{{ SC_(0.28e2), SC_(0.27e2), SC_(0.4716987977547585814757126251578188052101e-43), SC_(0.10888869450418352160768e29) }},
{{ SC_(0.29e2), SC_(0.1e2), SC_(0.5829352965432384027291107856487805083366e-15), SC_(0.47621141568e14) }},
{{ SC_(0.29e2), SC_(0.11e2), SC_(0.1494705888572406160843873809355847457273e-16), SC_(0.857180548224e15) }},
{{ SC_(0.29e2), SC_(0.12e2), SC_(0.3736764721431015402109684523389618643184e-18), SC_(0.14572069319808e17) }},
{{ SC_(0.29e2), SC_(0.13e2), SC_(0.9114060296173208297828498837535655227277e-20), SC_(0.233153109116928e18) }},
{{ SC_(0.29e2), SC_(0.14e2), SC_(0.2170014356231716261387737818460870292209e-21), SC_(0.349729663675392e19) }},
{{ SC_(0.29e2), SC_(0.15e2), SC_(0.50465450144923633985761344615369076563e-23), SC_(0.4896215291455488e20) }},
{{ SC_(0.29e2), SC_(0.16e2), SC_(0.114694204874826440876730328671293355825e-24), SC_(0.63650798788921344e21) }},
{{ SC_(0.29e2), SC_(0.17e2), SC_(0.2548760108329476463927340637139852351666e-26), SC_(0.763809585467056128e22) }},
{{ SC_(0.29e2), SC_(0.18e2), SC_(0.5540782844194514052015957906825765981884e-28), SC_(0.8401905440137617408e23) }},
{{ SC_(0.29e2), SC_(0.19e2), SC_(0.1178889966849896606811905937622503400401e-29), SC_(0.8401905440137617408e24) }},
{{ SC_(0.29e2), SC_(0.2e2), SC_(0.2456020764270617930858137370046882084168e-31), SC_(0.75617148961238556672e25) }},
{{ SC_(0.29e2), SC_(0.21e2), SC_(0.5012287274021669246649259938871187926874e-33), SC_(0.604937191689908453376e26) }},
{{ SC_(0.29e2), SC_(0.22e2), SC_(0.1002457454804333849329851987774237585375e-34), SC_(0.4234560341829359173632e27) }},
{{ SC_(0.29e2), SC_(0.23e2), SC_(0.1965602852557517351627160760341642324264e-36), SC_(0.25407362050976155041792e28) }},
{{ SC_(0.29e2), SC_(0.24e2), SC_(0.3780005485687533368513770692964696777431e-38), SC_(0.12703681025488077520896e29) }},
{{ SC_(0.29e2), SC_(0.25e2), SC_(0.7132085822051949751912774892386220334776e-40), SC_(0.50814724101952310083584e29) }},
{{ SC_(0.29e2), SC_(0.26e2), SC_(0.1320756633713324028131995350441892654588e-41), SC_(0.152444172305856930250752e30) }},
{{ SC_(0.29e2), SC_(0.27e2), SC_(0.2401375697660589142058173364439804826524e-43), SC_(0.304888344611713860501504e30) }},
{{ SC_(0.29e2), SC_(0.28e2), SC_(0.4288170888679623467961023865071080047364e-45), SC_(0.304888344611713860501504e30) }}
} };
```
|
KDCO may refer to:
KDCO (AM), a radio station (1340 AM) licensed to serve Denver, Colorado, United States
KKWY (Colorado), a radio station (88.7 FM) licensed to serve Estes Park, Colorado, which held the call sign KDCO in 2015
KKCL (AM), a radio station (1550 AM) licensed to serve Golden, Colorado, which held the call sign KDCO from 2012 to 2015
|
The 2014–15 FIU Panthers women's basketball team represents Florida International University during the 2014–15 NCAA Division I women's basketball season. The Panthers, led by thirty-fifth year head coach Cindy Russo, play their home games at FIU Arena, and were members of Conference USA. They finished the season 3–26, 0–18 in C-USA play to finish in last place. They failed to qualify for the Conference USA women's tournament.
Roster
Schedule
|-
!colspan=9 style="background:#002D62; color:#C5960C;"| Exhibition
|-
!colspan=9 style="background:#002D62; color:#C5960C;"| Regular season
See also
2014–15 FIU Panthers men's basketball team
References
FIU Panthers women's basketball seasons
FIU
FIU Panthers women's basketball team
FIU Panthers women's basketball team
|
```ruby
class Proxytunnel < Formula
desc "Create TCP tunnels through HTTPS proxies"
homepage "path_to_url"
url "path_to_url"
sha256 your_sha256_hash
license "GPL-2.0-or-later" => { with: "openvpn-openssl-exception" }
bottle do
sha256 cellar: :any, arm64_sonoma: your_sha256_hash
sha256 cellar: :any, arm64_ventura: your_sha256_hash
sha256 cellar: :any, arm64_monterey: your_sha256_hash
sha256 cellar: :any, sonoma: your_sha256_hash
sha256 cellar: :any, ventura: your_sha256_hash
sha256 cellar: :any, monterey: your_sha256_hash
sha256 cellar: :any_skip_relocation, x86_64_linux: your_sha256_hash
end
depends_on "asciidoc" => :build
depends_on "xmlto" => :build
depends_on "openssl@3"
def install
ENV["XML_CATALOG_FILES"] = etc/"xml/catalog"
system "make"
system "make", "install", "prefix=#{prefix}"
end
test do
system bin/"proxytunnel", "--version"
end
end
```
|
Euseius orientalis is a species of mite in the family Phytoseiidae.
References
orientalis
Articles created by Qbugbot
Animals described in 1968
|
```xml
/*
*
*
* 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 { HttpClient } from '@angular/common/http';
import { Injectable } from '@angular/core';
import { NzSafeAny } from 'ng-zorro-antd/core/types';
import { Observable } from 'rxjs';
import { AppsTokenBasedDetails } from '../entity/AppsTokenBasedDetails';
import { Message } from '../entity/Message';
import { BaseService } from './base.service';
@Injectable({
providedIn: 'root'
})
export class AppsTokenBasedDetailsService extends BaseService<AppsTokenBasedDetails> {
constructor(private _httpClient: HttpClient) {
super(_httpClient, '/apps/tokenbased');
}
init(): Observable<Message<AppsTokenBasedDetails>> {
return this.getByParams({}, `${this.server.urls.base}/init`);
}
}
```
|
The second series of the British comedy-drama television series Cold Feet was first broadcast on the ITV network from 26 September to 31 October 1999. The six episodes were written by series creator Mike Bullen, produced by Christine Langan, and directed by Tom Hooper, Tom Vaughan and Pete Travis. The storylines focus on three couples: Adam Williams and Rachel Bradley, Pete and Jenny Gifford, and David and Karen Marsden who are played by James Nesbitt, Helen Baxendale, John Thomson, Fay Ripley, Robert Bathurst and Hermione Norris respectively.
The series followed multiple storylines for the characters: Rachel returns to Manchester and she and Adam begin seeing other people, though reunite after he is treated for testicular cancer; Pete and Jenny's relationship falters after she thinks she no longer loves him and he has an affair with a colleague; Karen and David work their way through his redundancy from work and are elated to learn Karen is pregnant. Bullen drew on real-life experiences for the storylines, and contributions were made to the script by other production staff. Filming took place in the first half of 1999, and took in locations in Greater Manchester, Lindisfarne in Northumberland, and Paris.
Critics reacted well to the series and drew favourable comparisons to other visual media. Viewing figures reached a high of 9.48 million for Episode 6. The series was nominated for several awards, including four British Academy Television Awards. All six episodes have been released on VHS, DVD, and through Internet media distributors.
Episodes
Production
Cast
All six main cast members from the first series returned; James Nesbitt as Adam Williams, Helen Baxendale as Rachel Bradley, John Thomson as Pete Gifford, Fay Ripley as Jenny Gifford, Robert Bathurst as David Marsden and Hermione Norris as Karen Marsden. Recurring cast member Jacey Salles also returned to play the Marsdens' nanny Ramona Ramirez in all six episodes. Rosie Cavaliero joined the series to play Pete's co-worker and mistress Amy in six episodes, Lorelei King reprised her role as David's boss Natalie Lawrence in three episodes, Hugh Dancy guest starred in two episodes as Rachel's colleague and toyboy Danny Burke, and Stephen Moyer guest starred in one episode as David's wayward brother Nick.
Writing
Planning of the second series had already begun before the first series was broadcast. Andy Harries believed that the first series had used up a lot of storylines, and the production team decided to focus on more dramatic plots rather than "whimsical humour". The producers also decided to have more non-linear storylines. When developing the plot of Series 1, Episode 6—in which Rachel discovers that she is pregnant with two possible fathers—Bullen, Harries and Langan were concerned about the outcome; Harries believed that a miscarriage would be "a cop-out". Baxendale found the abortion storyline difficult, as she had given birth to her first child the year before.
The marijuana scenes in Episode 4 were originally scripted differently: Karen and Adam's recreational drug use played out the same but Granada's legal department objected to the scenes because to Independent Television Commission's (ITC) code of conduct forbade the depiction of drug use unless it is shown in a negative light. The legal team proposed Adam and Karen getting arrested at the school reunion as a resolution. Bullen found this idea "ludicrous" and a repetition of the Adam and Pete's arrest in Series 1, Episode 5. As a compromise, Bullen wrote an extra scene where David discovers what he thinks is Ramona's marijuana, and lectures her on the social and personal ramifications of its use. The scene ends with Ramona correcting David; it is actually tobacco, which David, relievedly, considers "harmless". Ramona refutes this by telling him tobacco causes cancer. Bullen was pleased to be able to subvert the anti-drugs message and relished putting the words into the mouth of David, "the most buffoonish of characters". Robert Bathurst and Jacey Salles were also pleased with the scene; Bathurst thought the scene was "a neat device" as a disclaimer and Salles was proud that Ramona got "the last word" in the argument and was beginning to assert herself as her English speaking improved.
Bullen, Langan and Harries decided to give one of the characters cancer early in the storylining stages. Breast cancer in women had received a lot of publicity, so was ruled out for being "too obvious". Testicular cancer had begun to receive greater attention around that time, and Harries believed that Cold Feet could publicise the illness. The condition would also provide a direct contrast to Adam's "Lothario" characterisation. Harries had been influenced by journalist John Diamond's personal account of his own cancer. Bullen also used Diamond's columns for research, and liaised with Imperial Cancer Research. Partway through writing the episode, Langan learned that the series' publicist Ian Johnson's partner had testicular cancer. Johnson talked Bullen through what happens before, during and after treatment, and proofread the script drafts. He also spoke with James Nesbitt during the filming of the episode. Bullen took the opportunity to add humour to the otherwise dramatic storyline by scripting Adam's dream to feature a parody of Rover, the white ball from the 1960s TV series The Prisoner, in this case representing an enormous testicle.
Filming
Three new directors were hired by Granada to lead filming on the second series, so the style of the first series was not repeated; Tom Hooper, Tom Vaughan and Pete Travis directed two episodes each. Hooper came from a background directing Byker Grove and EastEnders, and Cold Feet was his first production with a larger budget. The first series' interior filming was based at the Blue Shed Studios in Salford. For this series, filming moved to the larger Spectrum Arena in Warrington. Filming began on 22 March 1999 and ran for three months until June.
The first scene filmed for the second series was Episode 1, Scene 55, in which Pete sees Rachel and what he thinks is her baby in the supermarket. The scene was shot in a Morrisons supermarket on a Sunday evening after closing time. Although many babies played the one part, Tom Hooper found the scene difficult. Another scene in the same episode featured David pulling Josh from out of the way of an oncoming car. The scene was filmed in two parts; one of David pulling Josh out of the way, acting in front of a green screen, and the other of the car coming towards the camera. The two parts were composited afterwards. When rehearsing the scene, Bathurst picked up a lightweight dummy. As the child actor in the scene as filmed was much heavier, Bathurst had to drag him, as he could not pick him up. He believed the result looked more realistic. The paintball scenes in Episode 3 were filmed at Tatton Park in Cheshire. Tom Vaughan directed the scene like "a bad action movie". Although safety advisers were on set, John Thomson and Rosie Cavaliero were injured by the paintballs.
Episode 3 also featured the series' first scenes filmed outside England; Karen and David's anniversary storyline was originally scripted to conclude with the couple not meeting up due to a misunderstanding. Harries read the script and declared that it had no ending but Bullen defended it that as being the point. After filming concluded, the editor said the same thing, and Bullen decided a rewrite was needed. Vaughan thought the characters needed an uplifting ending because the other couples had downbeat dramatic endings in the same episode. A crew member suggested the characters should meet in Paris, so a scheduled two-day break in production was used to send a skeleton crew of Robert Bathurst, Hermione Norris, Christine Langan, Tom Vaughan and the director of photography Peter Middleton to the city to film the scenes with a small French crew. Bullen wrote the scene of David leaving a voicemail for Natalie, but the rest was improvised. The restaurant Karen and David eat at featured the illuminated Notre Dame Cathedral in the background. As the scene was being filmed, the lights were turned off, so Middleton had the French crew use their car headlights to re-illuminate it. Vaughan found the improvisation to be exciting, and Norris was pleased that a scene could show "the love and tenderness between Karen and David after all the sniping that had been going on".
Episode 6 was shot on location on Lindisfarne, though the setting had not been chosen when production on the episode commenced. A production manager suggested Lindisfarne as a location after seeing it in the film Cul-de-sac (Roman Polanski, 1966). Bullen and Pete Travis visited the island the following day and were "inspired by the beauty and dramatic possibilities" of the location. Bullen then wrote the script, which Travis compared to The Big Chill (Lawrence Kasdan, 1983), in two days. The Lindisfarne shoot lasted for five days; interior scenes of the castle were shot at Hoghton Tower in Lancashire.
Reception
Broadcast and ratings
The first series had been broadcast in the 9.30 p.m. timeslot on Sunday nights. This was a compromise between Harries and ITV director of channels David Liddiment; Liddiment wanted it to go out at 10 p.m. because he believed that viewers needed to concentrate on the plot; in the 9 p.m. "ironing slot"—for undemanding programmes. For the second series, Harries was able to get Cold Feet moved to 9 p.m., an action that made advertisers "furious". For the second time, Allied Domecq's Cockburn's Port sponsored the broadcast. The deal, which included prominent advertisements either side of commercial breaks, was estimated to be worth £1.4 million.
Episode 1 averaged 8.08 million viewers on first broadcast, making it the 25th-most-watched programme of the week and the fifth-most-watched drama. Episode 2 dropped to 7.95 million viewers and the 36th-most-watched programme (sixth-most-watched drama). Despite the promotion it received, it still lost five million viewers after Heartbeat. The third week grew to 7.96 million and the 32nd-most-watched programme. The fourth episode recovered to 8.64 million viewers as the 25th-most-watched programme. Episode 5's audience grew to 9.14 million, taking some 25% of Michael Palin's Hemingway Adventures viewers. The final episode drew 9.48 million viewers, making it the 19th-most-watched programme of the week.
Critical reaction
Paul Hoggart of The Times wrote that the series was "extremely and self-consciously stylish", writing highly of the fantasy scenes, the blending of "real life" scenes, and the multiple plotlines. However, he criticised the emotional impact that Rachel's admission of her abortion had, stating that "it was obvious from the moment she appeared that she had returned without a baby". He concluded his review by writing that "the substance always matters more than the presentation". Kathleen Morgan for the Daily Record wrote, "There was always a danger that Cold Feet wouldn't live up to its first series, but yet again it left its rivals standing." She wrote positively of the scenes in Episode 2 where Jenny's revelation that she loves Adam is drowned out by the whistling kettle, and of Adam's apparent threesome with Rosie and Rachel 2. She concluded by calling it "a classic episode". Andrew Billen for the New Statesman also enjoyed Episode 2, comparing the phone scene to David Jason as Del Boy falling through the bar in an episode of Only Fools and Horses, "except this was more painful".
The Mirrors Charlie Catchpole called Episode 4 "Funny, sad, touching. Brilliantly written, superbly acted" and complemented to the school disco scenes, off-handedly writing, "I want the CD". Catchpole was unaware that a soundtrack CD had been shelved; Christine Langan read Catchpole's column and faxed his comments to Global Media Group, who resumed plans for a soundtrack within 24 hours. Of Episode 5, Catchpole praised the scene where Adam shared his cancer worries with the cab driver, and Adam's Prisoner-esque dream. Robert Bathurst did not like the scene; he believed that the computer-generated testicle was of poor quality and thought that, instead of it being on screen for so long, it should have come down like a Monty Python foot. The Daily Record picked Episode 6 as its "drama of the week".
The series was nominated for four British Academy Television Awards: Mike Bullen and Christine Langan received the nomination for the BAFTA TV Award for Best Drama Series; Mark Russell the nomination for Best Original Television Music; Peter Terry, Matt Howarth and Susan Voudouris the nomination for Best Graphic Design; Tim Waddell the nomination for Best Editing (Fiction/Entertainment). At the British Comedy Awards, the series won Best TV Comedy Drama and James Nesbitt won Best TV Comedy Actor. At the Broadcast Awards, the series won in the Drama: Series or Serial category.
Home media
Cold Feet: The Complete 2nd Series was released in the UK by Video Collection International on VHS on 10 April 2000, and on region 2 DVD on 16 October 2000. It was released in the United States by Acorn Media on 26 April 2005 and in Australia by Time Life on 5 December 2006.
References
Bibliography
Rice, Jonathan (2000). Cold Feet: A Man's/Woman's Guide to Life. London: Granada Media. .
Tibballs, Geoff (2000). Cold Feet: The Best Bits…. London: Granada Media. .
1999 British television seasons
|
```smalltalk
// <auto-generated />
using Microsoft.EntityFrameworkCore;
using Microsoft.EntityFrameworkCore.Infrastructure;
using Microsoft.EntityFrameworkCore.Metadata;
using Microsoft.EntityFrameworkCore.Migrations;
using Microsoft.EntityFrameworkCore.Storage;
using Microsoft.EntityFrameworkCore.Storage.Internal;
using Npgsql.EntityFrameworkCore.PostgreSQL.Metadata;
using Piranha.AspNetCore.Identity.PostgreSQL;
using System;
using System.Diagnostics.CodeAnalysis;
namespace Piranha.AspNetCore.Identity.PostgreSQL.Migrations
{
[ExcludeFromCodeCoverage]
[DbContext(typeof(IdentityPostgreSQLDb))]
partial class IdentityPostgreSQLDbModelSnapshot : ModelSnapshot
{
protected override void BuildModel(ModelBuilder modelBuilder)
{
#pragma warning disable 612, 618
modelBuilder
.HasAnnotation("Npgsql:ValueGenerationStrategy", NpgsqlValueGenerationStrategy.SerialColumn)
.HasAnnotation("ProductVersion", "2.0.1-rtm-125");
modelBuilder.Entity("Microsoft.AspNetCore.Identity.IdentityRoleClaim<System.Guid>", b =>
{
b.Property<int>("Id")
.HasAnnotation("Npgsql:ValueGenerationStrategy", NpgsqlValueGenerationStrategy.SerialColumn);
b.Property<string>("ClaimType");
b.Property<string>("ClaimValue");
b.Property<Guid>("RoleId");
b.HasKey("Id");
b.HasIndex("RoleId");
b.ToTable("Piranha_RoleClaims");
});
modelBuilder.Entity("Microsoft.AspNetCore.Identity.IdentityUserClaim<System.Guid>", b =>
{
b.Property<int>("Id")
.HasAnnotation("Npgsql:ValueGenerationStrategy", NpgsqlValueGenerationStrategy.SerialColumn);
b.Property<string>("ClaimType");
b.Property<string>("ClaimValue");
b.Property<Guid>("UserId");
b.HasKey("Id");
b.HasIndex("UserId");
b.ToTable("Piranha_UserClaims");
});
modelBuilder.Entity("Microsoft.AspNetCore.Identity.IdentityUserLogin<System.Guid>", b =>
{
b.Property<string>("LoginProvider");
b.Property<string>("ProviderKey");
b.Property<string>("ProviderDisplayName");
b.Property<Guid>("UserId");
b.HasKey("LoginProvider", "ProviderKey");
b.HasIndex("UserId");
b.ToTable("Piranha_UserLogins");
});
modelBuilder.Entity("Microsoft.AspNetCore.Identity.IdentityUserRole<System.Guid>", b =>
{
b.Property<Guid>("UserId");
b.Property<Guid>("RoleId");
b.HasKey("UserId", "RoleId");
b.HasIndex("RoleId");
b.ToTable("Piranha_UserRoles");
});
modelBuilder.Entity("Microsoft.AspNetCore.Identity.IdentityUserToken<System.Guid>", b =>
{
b.Property<Guid>("UserId");
b.Property<string>("LoginProvider");
b.Property<string>("Name");
b.Property<string>("Value");
b.HasKey("UserId", "LoginProvider", "Name");
b.ToTable("Piranha_UserTokens");
});
modelBuilder.Entity("Piranha.AspNetCore.Identity.Data.Role", b =>
{
b.Property<Guid>("Id")
.HasAnnotation("Npgsql:ValueGenerationStrategy", NpgsqlValueGenerationStrategy.SerialColumn);
b.Property<string>("ConcurrencyStamp")
.IsConcurrencyToken();
b.Property<string>("Name")
.HasMaxLength(256);
b.Property<string>("NormalizedName")
.HasMaxLength(256);
b.HasKey("Id");
b.HasIndex("NormalizedName")
.IsUnique()
.HasName("RoleNameIndex");
b.ToTable("Piranha_Roles");
});
modelBuilder.Entity("Piranha.AspNetCore.Identity.Data.User", b =>
{
b.Property<Guid>("Id")
.HasAnnotation("Npgsql:ValueGenerationStrategy", NpgsqlValueGenerationStrategy.SerialColumn);
b.Property<int>("AccessFailedCount");
b.Property<string>("ConcurrencyStamp")
.IsConcurrencyToken();
b.Property<string>("Email")
.HasMaxLength(256);
b.Property<bool>("EmailConfirmed");
b.Property<bool>("LockoutEnabled");
b.Property<DateTimeOffset?>("LockoutEnd");
b.Property<string>("NormalizedEmail")
.HasMaxLength(256);
b.Property<string>("NormalizedUserName")
.HasMaxLength(256);
b.Property<string>("PasswordHash");
b.Property<string>("PhoneNumber");
b.Property<bool>("PhoneNumberConfirmed");
b.Property<string>("SecurityStamp");
b.Property<bool>("TwoFactorEnabled");
b.Property<string>("UserName")
.HasMaxLength(256);
b.HasKey("Id");
b.HasIndex("NormalizedEmail")
.HasName("EmailIndex");
b.HasIndex("NormalizedUserName")
.IsUnique()
.HasName("UserNameIndex");
b.ToTable("Piranha_Users");
});
modelBuilder.Entity("Microsoft.AspNetCore.Identity.IdentityRoleClaim<System.Guid>", b =>
{
b.HasOne("Piranha.AspNetCore.Identity.Data.Role")
.WithMany()
.HasForeignKey("RoleId")
.OnDelete(DeleteBehavior.Cascade);
});
modelBuilder.Entity("Microsoft.AspNetCore.Identity.IdentityUserClaim<System.Guid>", b =>
{
b.HasOne("Piranha.AspNetCore.Identity.Data.User")
.WithMany()
.HasForeignKey("UserId")
.OnDelete(DeleteBehavior.Cascade);
});
modelBuilder.Entity("Microsoft.AspNetCore.Identity.IdentityUserLogin<System.Guid>", b =>
{
b.HasOne("Piranha.AspNetCore.Identity.Data.User")
.WithMany()
.HasForeignKey("UserId")
.OnDelete(DeleteBehavior.Cascade);
});
modelBuilder.Entity("Microsoft.AspNetCore.Identity.IdentityUserRole<System.Guid>", b =>
{
b.HasOne("Piranha.AspNetCore.Identity.Data.Role")
.WithMany()
.HasForeignKey("RoleId")
.OnDelete(DeleteBehavior.Cascade);
b.HasOne("Piranha.AspNetCore.Identity.Data.User")
.WithMany()
.HasForeignKey("UserId")
.OnDelete(DeleteBehavior.Cascade);
});
modelBuilder.Entity("Microsoft.AspNetCore.Identity.IdentityUserToken<System.Guid>", b =>
{
b.HasOne("Piranha.AspNetCore.Identity.Data.User")
.WithMany()
.HasForeignKey("UserId")
.OnDelete(DeleteBehavior.Cascade);
});
#pragma warning restore 612, 618
}
}
}
```
|
```java
Distributed under MIT license.
See file LICENSE for detail or copy at path_to_url
*/
package com.itextpdf.io.codec.brotli.dec;
/**
* Common context lookup table for all context modes.
*/
final class Context {
static final int[] LOOKUP = {
// CONTEXT_UTF8, last byte.
// ASCII range.
0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 4, 0, 0, 4, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
8, 12, 16, 12, 12, 20, 12, 16, 24, 28, 12, 12, 32, 12, 36, 12,
44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 32, 32, 24, 40, 28, 12,
12, 48, 52, 52, 52, 48, 52, 52, 52, 48, 52, 52, 52, 52, 52, 48,
52, 52, 52, 52, 52, 48, 52, 52, 52, 52, 52, 24, 12, 28, 12, 12,
12, 56, 60, 60, 60, 56, 60, 60, 60, 56, 60, 60, 60, 60, 60, 56,
60, 60, 60, 60, 60, 56, 60, 60, 60, 60, 60, 24, 12, 28, 12, 0,
// UTF8 continuation byte range.
0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1,
0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1,
0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1,
0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1,
// UTF8 lead byte range.
2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3,
2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3,
2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3,
2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3,
// CONTEXT_UTF8 second last byte.
// ASCII range.
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1,
1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1,
1, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 0,
// UTF8 continuation byte range.
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
// UTF8 lead byte range.
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
// CONTEXT_SIGNED, second last byte.
0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7,
// CONTEXT_SIGNED, last byte, same as the above values shifted by 3 bits.
0, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16,
16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16,
16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16,
24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32,
32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32,
32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32,
32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32,
40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 56,
// CONTEXT_LSB6, last byte.
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,
16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31,
32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47,
48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63,
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,
16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31,
32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47,
48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63,
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,
16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31,
32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47,
48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63,
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,
16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31,
32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47,
48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63,
// CONTEXT_MSB6, last byte.
0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3,
4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7,
8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 11, 11, 11, 11,
12, 12, 12, 12, 13, 13, 13, 13, 14, 14, 14, 14, 15, 15, 15, 15,
16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, 19, 19, 19, 19,
20, 20, 20, 20, 21, 21, 21, 21, 22, 22, 22, 22, 23, 23, 23, 23,
24, 24, 24, 24, 25, 25, 25, 25, 26, 26, 26, 26, 27, 27, 27, 27,
28, 28, 28, 28, 29, 29, 29, 29, 30, 30, 30, 30, 31, 31, 31, 31,
32, 32, 32, 32, 33, 33, 33, 33, 34, 34, 34, 34, 35, 35, 35, 35,
36, 36, 36, 36, 37, 37, 37, 37, 38, 38, 38, 38, 39, 39, 39, 39,
40, 40, 40, 40, 41, 41, 41, 41, 42, 42, 42, 42, 43, 43, 43, 43,
44, 44, 44, 44, 45, 45, 45, 45, 46, 46, 46, 46, 47, 47, 47, 47,
48, 48, 48, 48, 49, 49, 49, 49, 50, 50, 50, 50, 51, 51, 51, 51,
52, 52, 52, 52, 53, 53, 53, 53, 54, 54, 54, 54, 55, 55, 55, 55,
56, 56, 56, 56, 57, 57, 57, 57, 58, 58, 58, 58, 59, 59, 59, 59,
60, 60, 60, 60, 61, 61, 61, 61, 62, 62, 62, 62, 63, 63, 63, 63,
// CONTEXT_{M,L}SB6, second last byte,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
};
static final int[] LOOKUP_OFFSETS = {
// CONTEXT_LSB6
1024, 1536,
// CONTEXT_MSB6
1280, 1536,
// CONTEXT_UTF8
0, 256,
// CONTEXT_SIGNED
768, 512
};
}
```
|
```c
/*
* lib/utils.c Utility Functions
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
*
*/
/**
* @ingroup core
* @defgroup utils Utilities
* @{
*/
#include <netlink-local.h>
#include <netlink/netlink.h>
#include <netlink/utils.h>
#include <linux/socket.h>
/**
* Debug level
*/
int nl_debug = 0;
struct nl_dump_params nl_debug_dp = {
.dp_type = NL_DUMP_DETAILS,
};
static void __init nl_debug_init(void)
{
char *nldbg, *end;
if ((nldbg = getenv("NLDBG"))) {
long level = strtol(nldbg, &end, 0);
if (nldbg != end)
nl_debug = level;
}
nl_debug_dp.dp_fd = stderr;
}
int __nl_read_num_str_file(const char *path, int (*cb)(long, const char *))
{
FILE *fd;
char buf[128];
fd = fopen(path, "r");
if (fd == NULL)
return -nl_syserr2nlerr(errno);
while (fgets(buf, sizeof(buf), fd)) {
int goodlen, err;
long num;
char *end;
if (*buf == '#' || *buf == '\n' || *buf == '\r')
continue;
num = strtol(buf, &end, 0);
if (end == buf)
return -NLE_INVAL;
if (num == LONG_MIN || num == LONG_MAX)
return -NLE_RANGE;
while (*end == ' ' || *end == '\t')
end++;
goodlen = strcspn(end, "#\r\n\t ");
if (goodlen == 0)
return -NLE_INVAL;
end[goodlen] = '\0';
err = cb(num, end);
if (err < 0)
return err;
}
fclose(fd);
return 0;
}
/**
* @name Unit Pretty-Printing
* @{
*/
/**
* Cancel down a byte counter
* @arg l byte counter
* @arg unit destination unit pointer
*
* Cancels down a byte counter until it reaches a reasonable
* unit. The chosen unit is assigned to \a unit.
*
* @return The cancelled down byte counter in the new unit.
*/
double nl_cancel_down_bytes(unsigned long long l, char **unit)
{
if (l >= 1099511627776LL) {
*unit = "TiB";
return ((double) l) / 1099511627776LL;
} else if (l >= 1073741824) {
*unit = "GiB";
return ((double) l) / 1073741824;
} else if (l >= 1048576) {
*unit = "MiB";
return ((double) l) / 1048576;
} else if (l >= 1024) {
*unit = "KiB";
return ((double) l) / 1024;
} else {
*unit = "B";
return (double) l;
}
}
/**
* Cancel down a bit counter
* @arg l bit counter
* @arg unit destination unit pointer
*
* Cancels downa bit counter until it reaches a reasonable
* unit. The chosen unit is assigned to \a unit.
*
* @return The cancelled down bit counter in the new unit.
*/
double nl_cancel_down_bits(unsigned long long l, char **unit)
{
if (l >= 1099511627776ULL) {
*unit = "Tbit";
return ((double) l) / 1099511627776ULL;
} else if (l >= 1073741824) {
*unit = "Gbit";
return ((double) l) / 1073741824;
} else if (l >= 1048576) {
*unit = "Mbit";
return ((double) l) / 1048576;
} else if (l >= 1024) {
*unit = "Kbit";
return ((double) l) / 1024;
} else {
*unit = "bit";
return (double) l;
}
}
/**
* Cancel down a micro second value
* @arg l micro seconds
* @arg unit destination unit pointer
*
* Cancels down a microsecond counter until it reaches a
* reasonable unit. The chosen unit is assigned to \a unit.
*
* @return The cancelled down microsecond in the new unit
*/
double nl_cancel_down_us(uint32_t l, char **unit)
{
if (l >= 1000000) {
*unit = "s";
return ((double) l) / 1000000;
} else if (l >= 1000) {
*unit = "ms";
return ((double) l) / 1000;
} else {
*unit = "us";
return (double) l;
}
}
/** @} */
/**
* @name Generic Unit Translations
* @{
*/
/**
* Convert a character string to a size
* @arg str size encoded as character string
*
* Converts the specified size as character to the corresponding
* number of bytes.
*
* Supported formats are:
* - b,kb/k,m/mb,gb/g for bytes
* - bit,kbit/mbit/gbit
*
* @return The number of bytes or -1 if the string is unparseable
*/
long nl_size2int(const char *str)
{
char *p;
long l = strtol(str, &p, 0);
if (p == str)
return -NLE_INVAL;
if (*p) {
if (!strcasecmp(p, "kb") || !strcasecmp(p, "k"))
l *= 1024;
else if (!strcasecmp(p, "gb") || !strcasecmp(p, "g"))
l *= 1024*1024*1024;
else if (!strcasecmp(p, "gbit"))
l *= 1024*1024*1024/8;
else if (!strcasecmp(p, "mb") || !strcasecmp(p, "m"))
l *= 1024*1024;
else if (!strcasecmp(p, "mbit"))
l *= 1024*1024/8;
else if (!strcasecmp(p, "kbit"))
l *= 1024/8;
else if (!strcasecmp(p, "bit"))
l /= 8;
else if (strcasecmp(p, "b") != 0)
return -NLE_INVAL;
}
return l;
}
/**
* Convert a character string to a probability
* @arg str probability encoded as character string
*
* Converts the specified probability as character to the
* corresponding probability number.
*
* Supported formats are:
* - 0.0-1.0
* - 0%-100%
*
* @return The probability relative to NL_PROB_MIN and NL_PROB_MAX
*/
long nl_prob2int(const char *str)
{
char *p;
double d = strtod(str, &p);
if (p == str)
return -NLE_INVAL;
if (d > 1.0)
d /= 100.0f;
if (d > 1.0f || d < 0.0f)
return -NLE_RANGE;
if (*p && strcmp(p, "%") != 0)
return -NLE_INVAL;
return rint(d * NL_PROB_MAX);
}
/** @} */
/**
* @name Time Translations
* @{
*/
#ifdef USER_HZ
static uint32_t user_hz = USER_HZ;
#else
static uint32_t user_hz = 100;
#endif
static double ticks_per_usec = 1.0f;
/* Retrieves the configured HZ and ticks/us value in the kernel.
* The value is cached. Supported ways of getting it:
*
* 1) environment variable
* 2) /proc/net/psched and sysconf
*
* Supports the environment variables:
* PROC_NET_PSCHED - may point to psched file in /proc
* PROC_ROOT - may point to /proc fs */
static void __init get_psched_settings(void)
{
char name[FILENAME_MAX];
FILE *fd;
int got_hz = 0;
if (getenv("HZ")) {
long hz = strtol(getenv("HZ"), NULL, 0);
if (LONG_MIN != hz && LONG_MAX != hz) {
user_hz = hz;
got_hz = 1;
}
}
if (!got_hz)
user_hz = sysconf(_SC_CLK_TCK);
if (getenv("TICKS_PER_USEC")) {
double t = strtod(getenv("TICKS_PER_USEC"), NULL);
ticks_per_usec = t;
}
else {
if (getenv("PROC_NET_PSCHED"))
snprintf(name, sizeof(name), "%s", getenv("PROC_NET_PSCHED"));
else if (getenv("PROC_ROOT"))
snprintf(name, sizeof(name), "%s/net/psched",
getenv("PROC_ROOT"));
else
strncpy(name, "/proc/net/psched", sizeof(name) - 1);
if ((fd = fopen(name, "r"))) {
uint32_t tick, us;
/* the file contains 4 hexadecimals, but we just use
the first two of them */
fscanf(fd, "%08x %08x", &tick, &us);
ticks_per_usec = (double)tick/(double)us;
fclose(fd);
}
}
}
/**
* Return the value of HZ
*/
int nl_get_hz(void)
{
return user_hz;
}
/**
* Convert micro seconds to ticks
* @arg us micro seconds
* @return number of ticks
*/
uint32_t nl_us2ticks(uint32_t us)
{
return us * ticks_per_usec;
}
/**
* Convert ticks to micro seconds
* @arg ticks number of ticks
* @return microseconds
*/
uint32_t nl_ticks2us(uint32_t ticks)
{
return ticks / ticks_per_usec;
}
int nl_str2msec(const char *str, uint64_t *result)
{
uint64_t total = 0, l;
int plen;
char *p;
do {
l = strtoul(str, &p, 0);
if (p == str)
return -NLE_INVAL;
else if (*p) {
plen = strcspn(p, " \t");
if (!plen)
total += l;
else if (!strncasecmp(p, "sec", plen))
total += (l * 1000);
else if (!strncasecmp(p, "min", plen))
total += (l * 1000*60);
else if (!strncasecmp(p, "hour", plen))
total += (l * 1000*60*60);
else if (!strncasecmp(p, "day", plen))
total += (l * 1000*60*60*24);
else
return -NLE_INVAL;
str = p + plen;
} else
total += l;
} while (*str && *p);
*result = total;
return 0;
}
/**
* Convert milliseconds to a character string
* @arg msec number of milliseconds
* @arg buf destination buffer
* @arg len buffer length
*
* Converts milliseconds to a character string split up in days, hours,
* minutes, seconds, and milliseconds and stores it in the specified
* destination buffer.
*
* @return The destination buffer.
*/
char * nl_msec2str(uint64_t msec, char *buf, size_t len)
{
int i, split[5];
char *units[] = {"d", "h", "m", "s", "msec"};
#define _SPLIT(idx, unit) if ((split[idx] = msec / unit) > 0) msec %= unit
_SPLIT(0, 86400000); /* days */
_SPLIT(1, 3600000); /* hours */
_SPLIT(2, 60000); /* minutes */
_SPLIT(3, 1000); /* seconds */
#undef _SPLIT
split[4] = msec;
memset(buf, 0, len);
for (i = 0; i < ARRAY_SIZE(split); i++) {
if (split[i] > 0) {
char t[64];
snprintf(t, sizeof(t), "%s%d%s",
strlen(buf) ? " " : "", split[i], units[i]);
strncat(buf, t, len - strlen(buf) - 1);
}
}
return buf;
}
/** @} */
/**
* @name Netlink Family Translations
* @{
*/
static struct trans_tbl nlfamilies[] = {
__ADD(NETLINK_ROUTE,route)
__ADD(NETLINK_USERSOCK,usersock)
__ADD(NETLINK_FIREWALL,firewall)
__ADD(NETLINK_INET_DIAG,inetdiag)
__ADD(NETLINK_NFLOG,nflog)
__ADD(NETLINK_XFRM,xfrm)
__ADD(NETLINK_SELINUX,selinux)
__ADD(NETLINK_ISCSI,iscsi)
__ADD(NETLINK_AUDIT,audit)
__ADD(NETLINK_FIB_LOOKUP,fib_lookup)
__ADD(NETLINK_CONNECTOR,connector)
__ADD(NETLINK_NETFILTER,netfilter)
__ADD(NETLINK_IP6_FW,ip6_fw)
__ADD(NETLINK_DNRTMSG,dnrtmsg)
__ADD(NETLINK_KOBJECT_UEVENT,kobject_uevent)
__ADD(NETLINK_GENERIC,generic)
__ADD(NETLINK_SCSITRANSPORT,scsitransport)
__ADD(NETLINK_ECRYPTFS,ecryptfs)
};
char * nl_nlfamily2str(int family, char *buf, size_t size)
{
return __type2str(family, buf, size, nlfamilies,
ARRAY_SIZE(nlfamilies));
}
int nl_str2nlfamily(const char *name)
{
return __str2type(name, nlfamilies, ARRAY_SIZE(nlfamilies));
}
/**
* @}
*/
/**
* @name Link Layer Protocol Translations
* @{
*/
static struct trans_tbl llprotos[] = {
{0, "generic"},
__ADD(ARPHRD_ETHER,ether)
__ADD(ARPHRD_EETHER,eether)
__ADD(ARPHRD_AX25,ax25)
__ADD(ARPHRD_PRONET,pronet)
__ADD(ARPHRD_CHAOS,chaos)
__ADD(ARPHRD_IEEE802,ieee802)
__ADD(ARPHRD_ARCNET,arcnet)
__ADD(ARPHRD_APPLETLK,atalk)
__ADD(ARPHRD_DLCI,dlci)
__ADD(ARPHRD_ATM,atm)
__ADD(ARPHRD_METRICOM,metricom)
__ADD(ARPHRD_IEEE1394,ieee1394)
#ifdef ARPHRD_EUI64
__ADD(ARPHRD_EUI64,eui64)
#endif
__ADD(ARPHRD_INFINIBAND,infiniband)
__ADD(ARPHRD_SLIP,slip)
__ADD(ARPHRD_CSLIP,cslip)
__ADD(ARPHRD_SLIP6,slip6)
__ADD(ARPHRD_CSLIP6,cslip6)
__ADD(ARPHRD_RSRVD,rsrvd)
__ADD(ARPHRD_ADAPT,adapt)
__ADD(ARPHRD_ROSE,rose)
__ADD(ARPHRD_X25,x25)
#ifdef ARPHRD_HWX25
__ADD(ARPHRD_HWX25,hwx25)
#endif
__ADD(ARPHRD_PPP,ppp)
__ADD(ARPHRD_HDLC,hdlc)
__ADD(ARPHRD_LAPB,lapb)
__ADD(ARPHRD_DDCMP,ddcmp)
__ADD(ARPHRD_RAWHDLC,rawhdlc)
__ADD(ARPHRD_TUNNEL,ipip)
__ADD(ARPHRD_TUNNEL6,tunnel6)
__ADD(ARPHRD_FRAD,frad)
__ADD(ARPHRD_SKIP,skip)
__ADD(ARPHRD_LOOPBACK,loopback)
__ADD(ARPHRD_LOCALTLK,localtlk)
__ADD(ARPHRD_FDDI,fddi)
__ADD(ARPHRD_BIF,bif)
__ADD(ARPHRD_SIT,sit)
__ADD(ARPHRD_IPDDP,ip/ddp)
__ADD(ARPHRD_IPGRE,gre)
__ADD(ARPHRD_PIMREG,pimreg)
__ADD(ARPHRD_HIPPI,hippi)
__ADD(ARPHRD_ASH,ash)
__ADD(ARPHRD_ECONET,econet)
__ADD(ARPHRD_IRDA,irda)
__ADD(ARPHRD_FCPP,fcpp)
__ADD(ARPHRD_FCAL,fcal)
__ADD(ARPHRD_FCPL,fcpl)
__ADD(ARPHRD_FCFABRIC,fcfb_0)
__ADD(ARPHRD_FCFABRIC+1,fcfb_1)
__ADD(ARPHRD_FCFABRIC+2,fcfb_2)
__ADD(ARPHRD_FCFABRIC+3,fcfb_3)
__ADD(ARPHRD_FCFABRIC+4,fcfb_4)
__ADD(ARPHRD_FCFABRIC+5,fcfb_5)
__ADD(ARPHRD_FCFABRIC+6,fcfb_6)
__ADD(ARPHRD_FCFABRIC+7,fcfb_7)
__ADD(ARPHRD_FCFABRIC+8,fcfb_8)
__ADD(ARPHRD_FCFABRIC+9,fcfb_9)
__ADD(ARPHRD_FCFABRIC+10,fcfb_10)
__ADD(ARPHRD_FCFABRIC+11,fcfb_11)
__ADD(ARPHRD_FCFABRIC+12,fcfb_12)
__ADD(ARPHRD_IEEE802_TR,tr)
__ADD(ARPHRD_IEEE80211,ieee802.11)
#ifdef ARPHRD_IEEE80211_PRISM
__ADD(ARPHRD_IEEE80211_PRISM, ieee802.11_prism)
#endif
#ifdef ARPHRD_VOID
__ADD(ARPHRD_VOID,void)
#endif
};
char * nl_llproto2str(int llproto, char *buf, size_t len)
{
return __type2str(llproto, buf, len, llprotos, ARRAY_SIZE(llprotos));
}
int nl_str2llproto(const char *name)
{
return __str2type(name, llprotos, ARRAY_SIZE(llprotos));
}
/** @} */
/**
* @name Ethernet Protocol Translations
* @{
*/
static struct trans_tbl ether_protos[] = {
__ADD(ETH_P_LOOP,loop)
__ADD(ETH_P_PUP,pup)
__ADD(ETH_P_PUPAT,pupat)
__ADD(ETH_P_IP,ip)
__ADD(ETH_P_X25,x25)
__ADD(ETH_P_ARP,arp)
__ADD(ETH_P_BPQ,bpq)
__ADD(ETH_P_IEEEPUP,ieeepup)
__ADD(ETH_P_IEEEPUPAT,ieeepupat)
__ADD(ETH_P_DEC,dec)
__ADD(ETH_P_DNA_DL,dna_dl)
__ADD(ETH_P_DNA_RC,dna_rc)
__ADD(ETH_P_DNA_RT,dna_rt)
__ADD(ETH_P_LAT,lat)
__ADD(ETH_P_DIAG,diag)
__ADD(ETH_P_CUST,cust)
__ADD(ETH_P_SCA,sca)
__ADD(ETH_P_RARP,rarp)
__ADD(ETH_P_ATALK,atalk)
__ADD(ETH_P_AARP,aarp)
#ifdef ETH_P_8021Q
__ADD(ETH_P_8021Q,802.1q)
#endif
__ADD(ETH_P_IPX,ipx)
__ADD(ETH_P_IPV6,ipv6)
#ifdef ETH_P_WCCP
__ADD(ETH_P_WCCP,wccp)
#endif
__ADD(ETH_P_PPP_DISC,ppp_disc)
__ADD(ETH_P_PPP_SES,ppp_ses)
__ADD(ETH_P_MPLS_UC,mpls_uc)
__ADD(ETH_P_MPLS_MC,mpls_mc)
__ADD(ETH_P_ATMMPOA,atmmpoa)
__ADD(ETH_P_ATMFATE,atmfate)
__ADD(ETH_P_EDP2,edp2)
__ADD(ETH_P_802_3,802.3)
__ADD(ETH_P_AX25,ax25)
__ADD(ETH_P_ALL,all)
__ADD(ETH_P_802_2,802.2)
__ADD(ETH_P_SNAP,snap)
__ADD(ETH_P_DDCMP,ddcmp)
__ADD(ETH_P_WAN_PPP,wan_ppp)
__ADD(ETH_P_PPP_MP,ppp_mp)
__ADD(ETH_P_LOCALTALK,localtalk)
__ADD(ETH_P_PPPTALK,ppptalk)
__ADD(ETH_P_TR_802_2,tr_802.2)
__ADD(ETH_P_MOBITEX,mobitex)
__ADD(ETH_P_CONTROL,control)
__ADD(ETH_P_IRDA,irda)
__ADD(ETH_P_ECONET,econet)
__ADD(ETH_P_HDLC,hdlc)
};
char *nl_ether_proto2str(int eproto, char *buf, size_t len)
{
return __type2str(eproto, buf, len, ether_protos,
ARRAY_SIZE(ether_protos));
}
int nl_str2ether_proto(const char *name)
{
return __str2type(name, ether_protos, ARRAY_SIZE(ether_protos));
}
/** @} */
/**
* @name IP Protocol Translations
* @{
*/
char *nl_ip_proto2str(int proto, char *buf, size_t len)
{
struct protoent *p = getprotobynumber(proto);
if (p) {
snprintf(buf, len, "%s", p->p_name);
return buf;
}
snprintf(buf, len, "0x%x", proto);
return buf;
}
int nl_str2ip_proto(const char *name)
{
struct protoent *p = getprotobyname(name);
unsigned long l;
char *end;
if (p)
return p->p_proto;
l = strtoul(name, &end, 0);
if (l == ULONG_MAX || *end != '\0')
return -NLE_OBJ_NOTFOUND;
return (int) l;
}
/** @} */
/**
* @name Dumping Helpers
* @{
*/
/**
* Handle a new line while dumping
* @arg params Dumping parameters
*
* This function must be called before dumping any onto a
* new line. It will ensure proper prefixing as specified
* by the dumping parameters.
*
* @note This function will NOT dump any newlines itself
*/
void nl_new_line(struct nl_dump_params *params)
{
params->dp_line++;
if (params->dp_prefix) {
int i;
for (i = 0; i < params->dp_prefix; i++) {
if (params->dp_fd)
fprintf(params->dp_fd, " ");
else if (params->dp_buf)
strncat(params->dp_buf, " ",
params->dp_buflen -
sizeof(params->dp_buf) - 1);
}
}
if (params->dp_nl_cb)
params->dp_nl_cb(params, params->dp_line);
}
static void dump_one(struct nl_dump_params *parms, const char *fmt,
va_list args)
{
if (parms->dp_fd)
vfprintf(parms->dp_fd, fmt, args);
else if (parms->dp_buf || parms->dp_cb) {
char *buf = NULL;
vasprintf(&buf, fmt, args);
if (parms->dp_cb)
parms->dp_cb(parms, buf);
else
strncat(parms->dp_buf, buf,
parms->dp_buflen - strlen(parms->dp_buf) - 1);
free(buf);
}
}
/**
* Dump a formatted character string
* @arg params Dumping parameters
* @arg fmt printf style formatting string
* @arg ... Arguments to formatting string
*
* Dumps a printf style formatting string to the output device
* as specified by the dumping parameters.
*/
void nl_dump(struct nl_dump_params *params, const char *fmt, ...)
{
va_list args;
va_start(args, fmt);
dump_one(params, fmt, args);
va_end(args);
}
void nl_dump_line(struct nl_dump_params *parms, const char *fmt, ...)
{
va_list args;
nl_new_line(parms);
va_start(args, fmt);
dump_one(parms, fmt, args);
va_end(args);
}
/** @} */
/** @cond SKIP */
int __trans_list_add(int i, const char *a, struct nl_list_head *head)
{
struct trans_list *tl;
tl = calloc(1, sizeof(*tl));
if (!tl)
return -NLE_NOMEM;
tl->i = i;
tl->a = strdup(a);
nl_list_add_tail(&tl->list, head);
return 0;
}
void __trans_list_clear(struct nl_list_head *head)
{
struct trans_list *tl, *next;
nl_list_for_each_entry_safe(tl, next, head, list) {
free(tl->a);
free(tl);
}
}
char *__type2str(int type, char *buf, size_t len, struct trans_tbl *tbl,
size_t tbl_len)
{
int i;
for (i = 0; i < tbl_len; i++) {
if (tbl[i].i == type) {
snprintf(buf, len, "%s", tbl[i].a);
return buf;
}
}
snprintf(buf, len, "0x%x", type);
return buf;
}
char *__list_type2str(int type, char *buf, size_t len,
struct nl_list_head *head)
{
struct trans_list *tl;
nl_list_for_each_entry(tl, head, list) {
if (tl->i == type) {
snprintf(buf, len, "%s", tl->a);
return buf;
}
}
snprintf(buf, len, "0x%x", type);
return buf;
}
char *__flags2str(int flags, char *buf, size_t len,
struct trans_tbl *tbl, size_t tbl_len)
{
int i;
int tmp = flags;
memset(buf, 0, len);
for (i = 0; i < tbl_len; i++) {
if (tbl[i].i & tmp) {
tmp &= ~tbl[i].i;
strncat(buf, tbl[i].a, len - strlen(buf) - 1);
if ((tmp & flags))
strncat(buf, ",", len - strlen(buf) - 1);
}
}
return buf;
}
int __str2type(const char *buf, struct trans_tbl *tbl, size_t tbl_len)
{
unsigned long l;
char *end;
int i;
if (*buf == '\0')
return -NLE_INVAL;
for (i = 0; i < tbl_len; i++)
if (!strcasecmp(tbl[i].a, buf))
return tbl[i].i;
l = strtoul(buf, &end, 0);
if (l == ULONG_MAX || *end != '\0')
return -NLE_OBJ_NOTFOUND;
return (int) l;
}
int __list_str2type(const char *buf, struct nl_list_head *head)
{
struct trans_list *tl;
unsigned long l;
char *end;
if (*buf == '\0')
return -NLE_INVAL;
nl_list_for_each_entry(tl, head, list) {
if (!strcasecmp(tl->a, buf))
return tl->i;
}
l = strtoul(buf, &end, 0);
if (l == ULONG_MAX || *end != '\0')
return -NLE_OBJ_NOTFOUND;
return (int) l;
}
int __str2flags(const char *buf, struct trans_tbl *tbl, size_t tbl_len)
{
int i, flags = 0, len;
char *p = (char *) buf, *t;
for (;;) {
if (*p == ' ')
p++;
t = strchr(p, ',');
len = t ? t - p : strlen(p);
for (i = 0; i < tbl_len; i++)
if (!strncasecmp(tbl[i].a, p, len))
flags |= tbl[i].i;
if (!t)
return flags;
p = ++t;
}
return 0;
}
void dump_from_ops(struct nl_object *obj, struct nl_dump_params *params)
{
int type = params->dp_type;
if (type < 0 || type > NL_DUMP_MAX)
BUG();
params->dp_line = 0;
if (params->dp_dump_msgtype) {
#if 0
/* XXX */
char buf[64];
dp_dump_line(params, 0, "%s ",
nl_cache_mngt_type2name(obj->ce_ops,
obj->ce_ops->co_protocol,
obj->ce_msgtype,
buf, sizeof(buf)));
#endif
params->dp_pre_dump = 1;
}
if (obj->ce_ops->oo_dump[type])
obj->ce_ops->oo_dump[type](obj, params);
}
/** @endcond */
/** @} */
```
|
Max Steel is a science fiction–comedy CGI–animated television series co-produced by Mattel Playground Productions, Nerd Corps Entertainment and FremantleMedia Kids & Entertainment. It is a re-imagining of its 2000-2002 predecessor and both series are based on the Mattel action-figure of the same name. Max Steel premiered on March 25, 2013 and ended on December 6, 2014.
Series overview
Episode list
Season 1 (2013)
Season 2 (2014)
Season 3 (2015)
Season 4 (2016)
Season 5 (2017)
References
Lists of American children's animated television series episodes
Lists of Canadian children's animated television series episodes
|
```c++
#include "etc.h"
#include <stdint.h>
#include <string.h>
#include "color.h"
const uint_fast8_t WriteOrderTable[16] = {0, 4, 8, 12, 1, 5, 9, 13, 2, 6, 10, 14, 3, 7, 11, 15};
const uint_fast8_t WriteOrderTableRev[16] = {15, 11, 7, 3, 14, 10, 6, 2, 13, 9, 5, 1, 12, 8, 4, 0};
const uint_fast8_t Etc1ModifierTable[8][2] = {{2, 8}, {5, 17}, {9, 29}, {13, 42},
{18, 60}, {24, 80}, {33, 106}, {47, 183}};
const uint_fast8_t Etc2aModifierTable[2][8][2] = {
{{0, 8}, {0, 17}, {0, 29}, {0, 42}, {0, 60}, {0, 80}, {0, 106}, {0, 183}},
{{2, 8}, {5, 17}, {9, 29}, {13, 42}, {18, 60}, {24, 80}, {33, 106}, {47, 183}}};
const uint_fast8_t Etc1SubblockTable[2][16] = {{0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1},
{0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1}};
const uint_fast8_t Etc2DistanceTable[8] = {3, 6, 11, 16, 23, 32, 41, 64};
const int_fast8_t Etc2AlphaModTable[16][8] = {
{-3, -6, -9, -15, 2, 5, 8, 14}, {-3, -7, -10, -13, 2, 6, 9, 12}, {-2, -5, -8, -13, 1, 4, 7, 12},
{-2, -4, -6, -13, 1, 3, 5, 12}, {-3, -6, -8, -12, 2, 5, 7, 11}, {-3, -7, -9, -11, 2, 6, 8, 10},
{-4, -7, -8, -11, 3, 6, 7, 10}, {-3, -5, -8, -11, 2, 4, 7, 10}, {-2, -6, -8, -10, 1, 5, 7, 9},
{-2, -5, -8, -10, 1, 4, 7, 9}, {-2, -4, -8, -10, 1, 3, 7, 9}, {-2, -5, -7, -10, 1, 4, 6, 9},
{-3, -4, -7, -10, 2, 3, 6, 9}, {-1, -2, -3, -10, 0, 1, 2, 9}, {-4, -6, -8, -9, 3, 5, 7, 8},
{-3, -5, -7, -9, 2, 4, 6, 8}};
static inline uint_fast8_t clamp(const int n) {
return n < 0 ? 0 : n > 255 ? 255 : n;
}
static inline uint32_t applicate_color(uint_fast8_t c[3], int_fast16_t m) {
return color(clamp(c[0] + m), clamp(c[1] + m), clamp(c[2] + m), 255);
}
static inline uint32_t applicate_color_alpha(uint_fast8_t c[3], int_fast16_t m, int transparent) {
return color(clamp(c[0] + m), clamp(c[1] + m), clamp(c[2] + m), transparent ? 0 : 255);
}
static inline uint32_t applicate_color_raw(uint_fast8_t c[3]) {
return color(c[0], c[1], c[2], 255);
}
static void decode_etc1_block(const uint8_t *data, uint32_t *outbuf) {
const uint_fast8_t code[2] = {data[3] >> 5, data[3] >> 2 & 7}; // Table codewords
const uint_fast8_t *table = Etc1SubblockTable[data[3] & 1];
uint_fast8_t c[2][3];
if (data[3] & 2) {
// diff bit == 1
c[0][0] = data[0] & 0xf8;
c[0][1] = data[1] & 0xf8;
c[0][2] = data[2] & 0xf8;
c[1][0] = c[0][0] + (data[0] << 3 & 0x18) - (data[0] << 3 & 0x20);
c[1][1] = c[0][1] + (data[1] << 3 & 0x18) - (data[1] << 3 & 0x20);
c[1][2] = c[0][2] + (data[2] << 3 & 0x18) - (data[2] << 3 & 0x20);
c[0][0] |= c[0][0] >> 5;
c[0][1] |= c[0][1] >> 5;
c[0][2] |= c[0][2] >> 5;
c[1][0] |= c[1][0] >> 5;
c[1][1] |= c[1][1] >> 5;
c[1][2] |= c[1][2] >> 5;
} else {
// diff bit == 0
c[0][0] = (data[0] & 0xf0) | data[0] >> 4;
c[1][0] = (data[0] & 0x0f) | data[0] << 4;
c[0][1] = (data[1] & 0xf0) | data[1] >> 4;
c[1][1] = (data[1] & 0x0f) | data[1] << 4;
c[0][2] = (data[2] & 0xf0) | data[2] >> 4;
c[1][2] = (data[2] & 0x0f) | data[2] << 4;
}
uint_fast16_t j = data[6] << 8 | data[7]; // less significant pixel index bits
uint_fast16_t k = data[4] << 8 | data[5]; // more significant pixel index bits
for (int i = 0; i < 16; i++, j >>= 1, k >>= 1) {
uint_fast8_t s = table[i];
uint_fast8_t m = Etc1ModifierTable[code[s]][j & 1];
outbuf[WriteOrderTable[i]] = applicate_color(c[s], k & 1 ? -m : m);
}
}
static void decode_etc2_block(const uint8_t *data, uint32_t *outbuf) {
uint_fast16_t j = data[6] << 8 | data[7]; // 15 -> 0
uint_fast32_t k = data[4] << 8 | data[5]; // 31 -> 16
uint_fast8_t c[3][3] = {};
if (data[3] & 2) {
// diff bit == 1
uint_fast8_t r = data[0] & 0xf8;
int_fast16_t dr = (data[0] << 3 & 0x18) - (data[0] << 3 & 0x20);
uint_fast8_t g = data[1] & 0xf8;
int_fast16_t dg = (data[1] << 3 & 0x18) - (data[1] << 3 & 0x20);
uint_fast8_t b = data[2] & 0xf8;
int_fast16_t db = (data[2] << 3 & 0x18) - (data[2] << 3 & 0x20);
if (r + dr < 0 || r + dr > 255) {
// T
c[0][0] = (data[0] << 3 & 0xc0) | (data[0] << 4 & 0x30) | (data[0] >> 1 & 0xc) | (data[0] & 3);
c[0][1] = (data[1] & 0xf0) | data[1] >> 4;
c[0][2] = (data[1] & 0x0f) | data[1] << 4;
c[1][0] = (data[2] & 0xf0) | data[2] >> 4;
c[1][1] = (data[2] & 0x0f) | data[2] << 4;
c[1][2] = (data[3] & 0xf0) | data[3] >> 4;
const uint_fast8_t d = Etc2DistanceTable[(data[3] >> 1 & 6) | (data[3] & 1)];
uint_fast32_t color_set[4] = {applicate_color_raw(c[0]), applicate_color(c[1], d),
applicate_color_raw(c[1]), applicate_color(c[1], -d)};
k <<= 1;
for (int i = 0; i < 16; i++, j >>= 1, k >>= 1)
outbuf[WriteOrderTable[i]] = color_set[(k & 2) | (j & 1)];
} else if (g + dg < 0 || g + dg > 255) {
// H
c[0][0] = (data[0] << 1 & 0xf0) | (data[0] >> 3 & 0xf);
c[0][1] = (data[0] << 5 & 0xe0) | (data[1] & 0x10);
c[0][1] |= c[0][1] >> 4;
c[0][2] = (data[1] & 8) | (data[1] << 1 & 6) | data[2] >> 7;
c[0][2] |= c[0][2] << 4;
c[1][0] = (data[2] << 1 & 0xf0) | (data[2] >> 3 & 0xf);
c[1][1] = (data[2] << 5 & 0xe0) | (data[3] >> 3 & 0x10);
c[1][1] |= c[1][1] >> 4;
c[1][2] = (data[3] << 1 & 0xf0) | (data[3] >> 3 & 0xf);
uint_fast8_t d = (data[3] & 4) | (data[3] << 1 & 2);
if (c[0][0] > c[1][0] ||
(c[0][0] == c[1][0] && (c[0][1] > c[1][1] || (c[0][1] == c[1][1] && c[0][2] >= c[1][2]))))
++d;
d = Etc2DistanceTable[d];
uint_fast32_t color_set[4] = {applicate_color(c[0], d), applicate_color(c[0], -d), applicate_color(c[1], d),
applicate_color(c[1], -d)};
k <<= 1;
for (int i = 0; i < 16; i++, j >>= 1, k >>= 1)
outbuf[WriteOrderTable[i]] = color_set[(k & 2) | (j & 1)];
} else if (b + db < 0 || b + db > 255) {
// planar
c[0][0] = (data[0] << 1 & 0xfc) | (data[0] >> 5 & 3);
c[0][1] = (data[0] << 7 & 0x80) | (data[1] & 0x7e) | (data[0] & 1);
c[0][2] = (data[1] << 7 & 0x80) | (data[2] << 2 & 0x60) | (data[2] << 3 & 0x18) | (data[3] >> 5 & 4);
c[0][2] |= c[0][2] >> 6;
c[1][0] = (data[3] << 1 & 0xf8) | (data[3] << 2 & 4) | (data[3] >> 5 & 3);
c[1][1] = (data[4] & 0xfe) | data[4] >> 7;
c[1][2] = (data[4] << 7 & 0x80) | (data[5] >> 1 & 0x7c);
c[1][2] |= c[1][2] >> 6;
c[2][0] = (data[5] << 5 & 0xe0) | (data[6] >> 3 & 0x1c) | (data[5] >> 1 & 3);
c[2][1] = (data[6] << 3 & 0xf8) | (data[7] >> 5 & 0x6) | (data[6] >> 4 & 1);
c[2][2] = data[7] << 2 | (data[7] >> 4 & 3);
for (int y = 0, i = 0; y < 4; y++) {
for (int x = 0; x < 4; x++, i++) {
uint8_t r = clamp((x * (c[1][0] - c[0][0]) + y * (c[2][0] - c[0][0]) + 4 * c[0][0] + 2) >> 2);
uint8_t g = clamp((x * (c[1][1] - c[0][1]) + y * (c[2][1] - c[0][1]) + 4 * c[0][1] + 2) >> 2);
uint8_t b = clamp((x * (c[1][2] - c[0][2]) + y * (c[2][2] - c[0][2]) + 4 * c[0][2] + 2) >> 2);
outbuf[i] = color(r, g, b, 255);
}
}
} else {
// differential
const uint_fast8_t code[2] = {data[3] >> 5, data[3] >> 2 & 7};
const uint_fast8_t *table = Etc1SubblockTable[data[3] & 1];
c[0][0] = r | r >> 5;
c[0][1] = g | g >> 5;
c[0][2] = b | b >> 5;
c[1][0] = r + dr;
c[1][1] = g + dg;
c[1][2] = b + db;
c[1][0] |= c[1][0] >> 5;
c[1][1] |= c[1][1] >> 5;
c[1][2] |= c[1][2] >> 5;
for (int i = 0; i < 16; i++, j >>= 1, k >>= 1) {
uint_fast8_t s = table[i];
uint_fast8_t m = Etc1ModifierTable[code[s]][j & 1];
outbuf[WriteOrderTable[i]] = applicate_color(c[s], k & 1 ? -m : m);
}
}
} else {
// individual (diff bit == 0)
const uint_fast8_t code[2] = {data[3] >> 5, data[3] >> 2 & 7};
const uint_fast8_t *table = Etc1SubblockTable[data[3] & 1];
c[0][0] = (data[0] & 0xf0) | data[0] >> 4;
c[1][0] = (data[0] & 0x0f) | data[0] << 4;
c[0][1] = (data[1] & 0xf0) | data[1] >> 4;
c[1][1] = (data[1] & 0x0f) | data[1] << 4;
c[0][2] = (data[2] & 0xf0) | data[2] >> 4;
c[1][2] = (data[2] & 0x0f) | data[2] << 4;
for (int i = 0; i < 16; i++, j >>= 1, k >>= 1) {
uint_fast8_t s = table[i];
uint_fast8_t m = Etc1ModifierTable[code[s]][j & 1];
outbuf[WriteOrderTable[i]] = applicate_color(c[s], k & 1 ? -m : m);
}
}
}
static void decode_etc2a1_block(const uint8_t *data, uint32_t *outbuf) {
uint_fast16_t j = data[6] << 8 | data[7]; // 15 -> 0
uint_fast32_t k = data[4] << 8 | data[5]; // 31 -> 16
uint_fast8_t c[3][3] = {};
int obaq = data[3] >> 1 & 1;
// diff bit == 1
uint_fast8_t r = data[0] & 0xf8;
int_fast16_t dr = (data[0] << 3 & 0x18) - (data[0] << 3 & 0x20);
uint_fast8_t g = data[1] & 0xf8;
int_fast16_t dg = (data[1] << 3 & 0x18) - (data[1] << 3 & 0x20);
uint_fast8_t b = data[2] & 0xf8;
int_fast16_t db = (data[2] << 3 & 0x18) - (data[2] << 3 & 0x20);
if (r + dr < 0 || r + dr > 255) {
// T
c[0][0] = (data[0] << 3 & 0xc0) | (data[0] << 4 & 0x30) | (data[0] >> 1 & 0xc) | (data[0] & 3);
c[0][1] = (data[1] & 0xf0) | data[1] >> 4;
c[0][2] = (data[1] & 0x0f) | data[1] << 4;
c[1][0] = (data[2] & 0xf0) | data[2] >> 4;
c[1][1] = (data[2] & 0x0f) | data[2] << 4;
c[1][2] = (data[3] & 0xf0) | data[3] >> 4;
const uint_fast8_t d = Etc2DistanceTable[(data[3] >> 1 & 6) | (data[3] & 1)];
uint_fast32_t color_set[4] = {applicate_color_raw(c[0]), applicate_color(c[1], d), applicate_color_raw(c[1]),
applicate_color(c[1], -d)};
k <<= 1;
for (int i = 0; i < 16; i++, j >>= 1, k >>= 1) {
int index = (k & 2) | (j & 1);
outbuf[WriteOrderTable[i]] = color_set[index];
if (!obaq && index == 2)
outbuf[WriteOrderTable[i]] &= TRANSPARENT_MASK;
}
} else if (g + dg < 0 || g + dg > 255) {
// H
c[0][0] = (data[0] << 1 & 0xf0) | (data[0] >> 3 & 0xf);
c[0][1] = (data[0] << 5 & 0xe0) | (data[1] & 0x10);
c[0][1] |= c[0][1] >> 4;
c[0][2] = (data[1] & 8) | (data[1] << 1 & 6) | data[2] >> 7;
c[0][2] |= c[0][2] << 4;
c[1][0] = (data[2] << 1 & 0xf0) | (data[2] >> 3 & 0xf);
c[1][1] = (data[2] << 5 & 0xe0) | (data[3] >> 3 & 0x10);
c[1][1] |= c[1][1] >> 4;
c[1][2] = (data[3] << 1 & 0xf0) | (data[3] >> 3 & 0xf);
uint_fast8_t d = (data[3] & 4) | (data[3] << 1 & 2);
if (c[0][0] > c[1][0] ||
(c[0][0] == c[1][0] && (c[0][1] > c[1][1] || (c[0][1] == c[1][1] && c[0][2] >= c[1][2]))))
++d;
d = Etc2DistanceTable[d];
uint_fast32_t color_set[4] = {applicate_color(c[0], d), applicate_color(c[0], -d), applicate_color(c[1], d),
applicate_color(c[1], -d)};
k <<= 1;
for (int i = 0; i < 16; i++, j >>= 1, k >>= 1) {
int index = (k & 2) | (j & 1);
outbuf[WriteOrderTable[i]] = color_set[index];
if (!obaq && index == 2)
outbuf[WriteOrderTable[i]] &= TRANSPARENT_MASK;
}
} else if (b + db < 0 || b + db > 255) {
// planar
c[0][0] = (data[0] << 1 & 0xfc) | (data[0] >> 5 & 3);
c[0][1] = (data[0] << 7 & 0x80) | (data[1] & 0x7e) | (data[0] & 1);
c[0][2] = (data[1] << 7 & 0x80) | (data[2] << 2 & 0x60) | (data[2] << 3 & 0x18) | (data[3] >> 5 & 4);
c[0][2] |= c[0][2] >> 6;
c[1][0] = (data[3] << 1 & 0xf8) | (data[3] << 2 & 4) | (data[3] >> 5 & 3);
c[1][1] = (data[4] & 0xfe) | data[4] >> 7;
c[1][2] = (data[4] << 7 & 0x80) | (data[5] >> 1 & 0x7c);
c[1][2] |= c[1][2] >> 6;
c[2][0] = (data[5] << 5 & 0xe0) | (data[6] >> 3 & 0x1c) | (data[5] >> 1 & 3);
c[2][1] = (data[6] << 3 & 0xf8) | (data[7] >> 5 & 0x6) | (data[6] >> 4 & 1);
c[2][2] = data[7] << 2 | (data[7] >> 4 & 3);
for (int y = 0, i = 0; y < 4; y++) {
for (int x = 0; x < 4; x++, i++) {
uint8_t r = clamp((x * (c[1][0] - c[0][0]) + y * (c[2][0] - c[0][0]) + 4 * c[0][0] + 2) >> 2);
uint8_t g = clamp((x * (c[1][1] - c[0][1]) + y * (c[2][1] - c[0][1]) + 4 * c[0][1] + 2) >> 2);
uint8_t b = clamp((x * (c[1][2] - c[0][2]) + y * (c[2][2] - c[0][2]) + 4 * c[0][2] + 2) >> 2);
outbuf[i] = color(r, g, b, 255);
}
}
} else {
// differential
const uint_fast8_t code[2] = {data[3] >> 5, data[3] >> 2 & 7};
const uint_fast8_t *table = Etc1SubblockTable[data[3] & 1];
c[0][0] = r | r >> 5;
c[0][1] = g | g >> 5;
c[0][2] = b | b >> 5;
c[1][0] = r + dr;
c[1][1] = g + dg;
c[1][2] = b + db;
c[1][0] |= c[1][0] >> 5;
c[1][1] |= c[1][1] >> 5;
c[1][2] |= c[1][2] >> 5;
for (int i = 0; i < 16; i++, j >>= 1, k >>= 1) {
uint_fast8_t s = table[i];
uint_fast8_t m = Etc2aModifierTable[obaq][code[s]][j & 1];
outbuf[WriteOrderTable[i]] = applicate_color_alpha(c[s], k & 1 ? -m : m, !obaq && (k & 1) && !(j & 1));
}
}
}
static void decode_etc2a8_block(const uint8_t *data, uint32_t *outbuf) {
if (data[1] & 0xf0) {
// multiplier != 0
const uint_fast8_t multiplier = data[1] >> 4;
const int_fast8_t *table = Etc2AlphaModTable[data[1] & 0xf];
uint_fast64_t l = bton64(*(uint64_t*)data);
for (int i = 0; i < 16; i++, l >>= 3)
((uint8_t *)(outbuf + WriteOrderTableRev[i]))[3] = clamp(data[0] + multiplier * table[l & 7]);
} else {
// multiplier == 0 (always same as base codeword)
for (int i = 0; i < 16; i++, outbuf++)
((uint8_t *)outbuf)[3] = data[0];
}
}
static void decode_eac_block(const uint8_t *data, int color, uint32_t *outbuf) {
uint_fast8_t multiplier = data[1] >> 1 & 0x78;
if (multiplier == 0)
multiplier = 1;
const int_fast8_t *table = Etc2AlphaModTable[data[1] & 0xf];
uint_fast64_t l = bton64(*(uint64_t*)data);
for (int i = 0; i < 16; i++, l >>= 3) {
int_fast16_t val = data[0] * 8 + multiplier * table[l & 7] + 4;
((uint8_t *)(outbuf + WriteOrderTableRev[i]))[color] = val < 0 ? 0 : val >= 2048 ? 0xff : val >> 3;
}
}
static void decode_eac_signed_block(const uint8_t *data, int color, uint32_t *outbuf) {
int8_t base = (int8_t)data[0];
uint_fast8_t multiplier = data[1] >> 1 & 0x78;
if (multiplier == 0)
multiplier = 1;
const int_fast8_t *table = Etc2AlphaModTable[data[1] & 0xf];
uint_fast64_t l = bton64(*(uint64_t*)data);
for (int i = 0; i < 16; i++, l >>= 3) {
int_fast16_t val = base * 8 + multiplier * table[l & 7] + 1023;
((uint8_t *)(outbuf + WriteOrderTableRev[i]))[color] = val < 0 ? 0 : val >= 2048 ? 0xff : val >> 3;
}
}
int decode_etc1(const uint8_t *data, const long w, const long h, uint32_t *image) {
long num_blocks_x = (w + 3) / 4;
long num_blocks_y = (h + 3) / 4;
uint32_t buffer[16];
for (long by = 0; by < num_blocks_y; by++) {
for (long bx = 0; bx < num_blocks_x; bx++, data += 8) {
decode_etc1_block(data, buffer);
copy_block_buffer(bx, by, w, h, 4, 4, buffer, image);
}
}
return 1;
}
int decode_etc2(const uint8_t *data, const long w, const long h, uint32_t *image) {
long num_blocks_x = (w + 3) / 4;
long num_blocks_y = (h + 3) / 4;
uint32_t buffer[16];
for (long by = 0; by < num_blocks_y; by++) {
for (long bx = 0; bx < num_blocks_x; bx++, data += 8) {
decode_etc2_block(data, buffer);
copy_block_buffer(bx, by, w, h, 4, 4, buffer, image);
}
}
return 1;
}
int decode_etc2a1(const uint8_t *data, const long w, const long h, uint32_t *image) {
long num_blocks_x = (w + 3) / 4;
long num_blocks_y = (h + 3) / 4;
uint32_t buffer[16];
for (long by = 0; by < num_blocks_y; by++) {
for (long bx = 0; bx < num_blocks_x; bx++, data += 8) {
decode_etc2a1_block(data, buffer);
copy_block_buffer(bx, by, w, h, 4, 4, buffer, image);
}
}
return 1;
}
int decode_etc2a8(const uint8_t *data, const long w, const long h, uint32_t *image) {
long num_blocks_x = (w + 3) / 4;
long num_blocks_y = (h + 3) / 4;
uint32_t buffer[16];
for (long by = 0; by < num_blocks_y; by++) {
for (long bx = 0; bx < num_blocks_x; bx++, data += 16) {
decode_etc2_block(data + 8, buffer);
decode_etc2a8_block(data, buffer);
copy_block_buffer(bx, by, w, h, 4, 4, buffer, image);
}
}
return 1;
}
int decode_eacr(const uint8_t *data, const long w, const long h, uint32_t *image) {
long num_blocks_x = (w + 3) / 4;
long num_blocks_y = (h + 3) / 4;
uint32_t buffer[16];
uint32_t base_buffer[16];
for (int i = 0; i < 16; i++)
base_buffer[i] = color(0, 0, 0, 255);
for (long by = 0; by < num_blocks_y; by++) {
for (long bx = 0; bx < num_blocks_x; bx++, data += 8) {
memcpy(buffer, base_buffer, sizeof(buffer));
decode_eac_block(data, 2, buffer);
copy_block_buffer(bx, by, w, h, 4, 4, buffer, image);
}
}
return 1;
}
int decode_eacr_signed(const uint8_t *data, const long w, const long h, uint32_t *image) {
long num_blocks_x = (w + 3) / 4;
long num_blocks_y = (h + 3) / 4;
uint32_t buffer[16];
uint32_t base_buffer[16];
for (int i = 0; i < 16; i++)
base_buffer[i] = color(0, 0, 0, 255);
for (long by = 0; by < num_blocks_y; by++) {
for (long bx = 0; bx < num_blocks_x; bx++, data += 8) {
memcpy(buffer, base_buffer, sizeof(buffer));
decode_eac_signed_block(data, 2, buffer);
copy_block_buffer(bx, by, w, h, 4, 4, buffer, image);
}
}
return 1;
}
int decode_eacrg(const uint8_t *data, const long w, const long h, uint32_t *image) {
long num_blocks_x = (w + 3) / 4;
long num_blocks_y = (h + 3) / 4;
uint32_t buffer[16];
uint32_t base_buffer[16];
for (int i = 0; i < 16; i++)
base_buffer[i] = color(0, 0, 0, 255);
for (long by = 0; by < num_blocks_y; by++) {
for (long bx = 0; bx < num_blocks_x; bx++, data += 16) {
memcpy(buffer, base_buffer, sizeof(buffer));
decode_eac_block(data, 2, buffer);
decode_eac_block(data + 8, 1, buffer);
copy_block_buffer(bx, by, w, h, 4, 4, buffer, image);
}
}
return 1;
}
int decode_eacrg_signed(const uint8_t *data, const long w, const long h, uint32_t *image) {
long num_blocks_x = (w + 3) / 4;
long num_blocks_y = (h + 3) / 4;
uint32_t buffer[16];
uint32_t base_buffer[16];
for (int i = 0; i < 16; i++)
base_buffer[i] = color(0, 0, 0, 255);
for (long by = 0; by < num_blocks_y; by++) {
for (long bx = 0; bx < num_blocks_x; bx++, data += 16) {
memcpy(buffer, base_buffer, sizeof(buffer));
decode_eac_signed_block(data, 2, buffer);
decode_eac_signed_block(data + 8, 1, buffer);
copy_block_buffer(bx, by, w, h, 4, 4, buffer, image);
}
}
return 1;
}
```
|
Villars-le-Pautel is a commune in the Haute-Saône department in the region of Bourgogne-Franche-Comté in eastern France.
See also
Communes of the Haute-Saône department
References
Communes of Haute-Saône
|
Spirotropis tmeta is a species of sea snail, a marine gastropod mollusk in the family Drilliidae.
Description
(Original description) The incomplete shell of the holotype consists of a mere fragment of two whorls, but with very marked features. It is evidently high and narrow, with short and numerous whorls, which are sharply but broadly angulated very much above the middle. The shoulder above the angulation is scored by very many sharp curved threads, the scars of the old sinus. The rise of these forms a collar below the
suture, which is thus distinct. The angulation is raised into a keel by rounded tubercles, which are the origin of narrow, curved, very oblique ribs, of which there are twelve on the body whorl. They extend to the base, but not to the snout, which is very small and short. The whole surface is closely scored by fine, rounded, spiral threads. The sinus of the outer lip is separated from the body by a narrow shelf, and is shallow, rounded, and open on the under side, where the convex shoulder of the lip lies very low. The narrow inner lip has a small pad above, is rather oblique and concave in the middle. The front of the columella is very slightly truncated obliquely, and has a sharply rounded and hardly twisted edge. The aperture is long, narrow, and oblique.
Distribution
This species occurs in the demersal zone of the tropical Western Atlantic Ocean (found off Pernambuco at a depth of 640 m.)
References
R.B. Watson, Prelim. Report, pt. 9, Journ. Linn. Soc. Lond., vol. xv. p. 424
Tucker, J.K. 2004 Catalog of recent and fossil turrids (Mollusca: Gastropoda). Zootaxa 682:1–1295
External links
tmeta
Gastropods described in 1881
|
```ruby
require 'concurrent/atomic/atomic_reference'
require 'concurrent/collection/copy_on_notify_observer_set'
require 'concurrent/concern/observable'
require 'concurrent/synchronization'
# @!macro thread_safe_variable_comparison
#
# ## Thread-safe Variable Classes
#
# Each of the thread-safe variable classes is designed to solve a different
# problem. In general:
#
# * *{Concurrent::Agent}:* Shared, mutable variable providing independent,
# uncoordinated, *asynchronous* change of individual values. Best used when
# the value will undergo frequent, complex updates. Suitable when the result
# of an update does not need to be known immediately.
# * *{Concurrent::Atom}:* Shared, mutable variable providing independent,
# uncoordinated, *synchronous* change of individual values. Best used when
# the value will undergo frequent reads but only occasional, though complex,
# updates. Suitable when the result of an update must be known immediately.
# * *{Concurrent::AtomicReference}:* A simple object reference that can be
# atomically. Updates are synchronous but fast. Best used when updates a
# simple set operations. Not suitable when updates are complex.
# {Concurrent::AtomicBoolean} and {Concurrent::AtomicFixnum} are similar
# but optimized for the given data type.
# * *{Concurrent::Exchanger}:* Shared, stateless synchronization point. Used
# when two or more threads need to exchange data. The threads will pair then
# block on each other until the exchange is complete.
# * *{Concurrent::MVar}:* Shared synchronization point. Used when one thread
# must give a value to another, which must take the value. The threads will
# block on each other until the exchange is complete.
# * *{Concurrent::ThreadLocalVar}:* Shared, mutable, isolated variable which
# holds a different value for each thread which has access. Often used as
# an instance variable in objects which must maintain different state
# for different threads.
# * *{Concurrent::TVar}:* Shared, mutable variables which provide
# *coordinated*, *synchronous*, change of *many* stated. Used when multiple
# value must change together, in an all-or-nothing transaction.
module Concurrent
# Atoms provide a way to manage shared, synchronous, independent state.
#
# An atom is initialized with an initial value and an optional validation
# proc. At any time the value of the atom can be synchronously and safely
# changed. If a validator is given at construction then any new value
# will be checked against the validator and will be rejected if the
# validator returns false or raises an exception.
#
# There are two ways to change the value of an atom: {#compare_and_set} and
# {#swap}. The former will set the new value if and only if it validates and
# the current value matches the new value. The latter will atomically set the
# new value to the result of running the given block if and only if that
# value validates.
#
# ## Example
#
# ```
# def next_fibonacci(set = nil)
# return [0, 1] if set.nil?
# set + [set[-2..-1].reduce{|sum,x| sum + x }]
# end
#
# # create an atom with an initial value
# atom = Concurrent::Atom.new(next_fibonacci)
#
# # send a few update requests
# 5.times do
# atom.swap{|set| next_fibonacci(set) }
# end
#
# # get the current value
# atom.value #=> [0, 1, 1, 2, 3, 5, 8]
# ```
#
# ## Observation
#
# Atoms support observers through the {Concurrent::Observable} mixin module.
# Notification of observers occurs every time the value of the Atom changes.
# When notified the observer will receive three arguments: `time`, `old_value`,
# and `new_value`. The `time` argument is the time at which the value change
# occurred. The `old_value` is the value of the Atom when the change began
# The `new_value` is the value to which the Atom was set when the change
# completed. Note that `old_value` and `new_value` may be the same. This is
# not an error. It simply means that the change operation returned the same
# value.
#
# Unlike in Clojure, `Atom` cannot participate in {Concurrent::TVar} transactions.
#
# @!macro thread_safe_variable_comparison
#
# @see path_to_url Clojure Atoms
# @see path_to_url Values and Change - Clojure's approach to Identity and State
class Atom < Synchronization::Object
include Concern::Observable
safe_initialization!
attr_atomic(:value)
private :value=, :swap_value, :compare_and_set_value, :update_value
public :value
alias_method :deref, :value
# @!method value
# The current value of the atom.
#
# @return [Object] The current value.
# Create a new atom with the given initial value.
#
# @param [Object] value The initial value
# @param [Hash] opts The options used to configure the atom
# @option opts [Proc] :validator (nil) Optional proc used to validate new
# values. It must accept one and only one argument which will be the
# intended new value. The validator will return true if the new value
# is acceptable else return false (preferrably) or raise an exception.
#
# @!macro deref_options
#
# @raise [ArgumentError] if the validator is not a `Proc` (when given)
def initialize(value, opts = {})
super()
@Validator = opts.fetch(:validator, -> v { true })
self.observers = Collection::CopyOnNotifyObserverSet.new
self.value = value
end
# Atomically swaps the value of atom using the given block. The current
# value will be passed to the block, as will any arguments passed as
# arguments to the function. The new value will be validated against the
# (optional) validator proc given at construction. If validation fails the
# value will not be changed.
#
# Internally, {#swap} reads the current value, applies the block to it, and
# attempts to compare-and-set it in. Since another thread may have changed
# the value in the intervening time, it may have to retry, and does so in a
# spin loop. The net effect is that the value will always be the result of
# the application of the supplied block to a current value, atomically.
# However, because the block might be called multiple times, it must be free
# of side effects.
#
# @note The given block may be called multiple times, and thus should be free
# of side effects.
#
# @param [Object] args Zero or more arguments passed to the block.
#
# @yield [value, args] Calculates a new value for the atom based on the
# current value and any supplied arguments.
# @yieldparam value [Object] The current value of the atom.
# @yieldparam args [Object] All arguments passed to the function, in order.
# @yieldreturn [Object] The intended new value of the atom.
#
# @return [Object] The final value of the atom after all operations and
# validations are complete.
#
# @raise [ArgumentError] When no block is given.
def swap(*args)
raise ArgumentError.new('no block given') unless block_given?
loop do
old_value = value
new_value = yield(old_value, *args)
begin
break old_value unless valid?(new_value)
break new_value if compare_and_set(old_value, new_value)
rescue
break old_value
end
end
end
# Atomically sets the value of atom to the new value if and only if the
# current value of the atom is identical to the old value and the new
# value successfully validates against the (optional) validator given
# at construction.
#
# @param [Object] old_value The expected current value.
# @param [Object] new_value The intended new value.
#
# @return [Boolean] True if the value is changed else false.
def compare_and_set(old_value, new_value)
if valid?(new_value) && compare_and_set_value(old_value, new_value)
observers.notify_observers(Time.now, old_value, new_value)
true
else
false
end
end
# Atomically sets the value of atom to the new value without regard for the
# current value so long as the new value successfully validates against the
# (optional) validator given at construction.
#
# @param [Object] new_value The intended new value.
#
# @return [Object] The final value of the atom after all operations and
# validations are complete.
def reset(new_value)
old_value = value
if valid?(new_value)
self.value = new_value
observers.notify_observers(Time.now, old_value, new_value)
new_value
else
old_value
end
end
private
# Is the new value valid?
#
# @param [Object] new_value The intended new value.
# @return [Boolean] false if the validator function returns false or raises
# an exception else true
def valid?(new_value)
@Validator.call(new_value)
rescue
false
end
end
end
```
|
```go
// snippet-start:[codebuild.go.list_builds]
package main
// snippet-start:[codebuild.go.list_builds.imports]
import (
"fmt"
"github.com/aws/aws-sdk-go/aws"
"github.com/aws/aws-sdk-go/aws/session"
"github.com/aws/aws-sdk-go/service/codebuild"
)
// snippet-end:[codebuild.go.list_builds.imports]
// GetBuilds retrieves a list of AWS CodeBuild builds
// Inputs:
// sess is the current session, which provides configuration for the SDK's service clients
// Output:
// If success, the list of the builds and nil
// Otherwise, nil and an error from the call to ListBuilds or BatchGetBuilds
func GetBuilds(sess *session.Session) (*codebuild.BatchGetBuildsOutput, error) {
// snippet-start:[codebuild.go.list_builds.call]
svc := codebuild.New(sess)
// Get the list of builds
names, err := svc.ListBuilds(&codebuild.ListBuildsInput{
SortOrder: aws.String("ASCENDING"),
})
// snippet-end:[codebuild.go.list_builds.call]
if err != nil {
return nil, err
}
// snippet-start:[codebuild.go.list_builds.batch]
builds, err := svc.BatchGetBuilds(&codebuild.BatchGetBuildsInput{
Ids: names.Ids,
})
// snippet-end:[codebuild.go.list_builds.batch]
if err != nil {
return nil, err
}
return builds, nil
}
func main() {
// snippet-start:[codebuild.go.list_builds.session]
sess := session.Must(session.NewSessionWithOptions(session.Options{
SharedConfigState: session.SharedConfigEnable,
}))
// snippet-end:[codebuild.go.list_builds.session]
builds, err := GetBuilds(sess)
if err != nil {
fmt.Println("Got error getting builds:")
fmt.Println(err)
return
}
// snippet-start:[codebuild.go.list_builds.display]
for _, build := range builds.Builds {
fmt.Printf("Project: %s\n", aws.StringValue(build.ProjectName))
fmt.Printf("Phase: %s\n", aws.StringValue(build.CurrentPhase))
fmt.Printf("Status: %s\n", aws.StringValue(build.BuildStatus))
fmt.Println("")
}
// snippet-end:[codebuild.go.list_builds.display]
}
// snippet-end:[codebuild.go.list_builds]
```
|
```xml
import * as React from 'react';
import * as ReactDom from 'react-dom';
import { Version } from '@microsoft/sp-core-library';
import {
BaseClientSideWebPart,
IPropertyPaneConfiguration,
PropertyPaneTextField
} from '@microsoft/sp-webpart-base';
import * as strings from 'SingletonWebPartStrings';
import Singleton from './components/Singleton';
import { ISingletonProps } from './components/ISingletonProps';
export interface ISingletonWebPartProps {
description: string;
}
export default class SingletonWebPart extends BaseClientSideWebPart<ISingletonWebPartProps> {
public render(): void {
const element: React.ReactElement<ISingletonProps > = React.createElement(
Singleton,
{
description: this.properties.description
}
);
ReactDom.render(element, this.domElement);
}
protected get dataVersion(): Version {
return Version.parse('1.0');
}
protected getPropertyPaneConfiguration(): IPropertyPaneConfiguration {
return {
pages: [
{
header: {
description: strings.PropertyPaneDescription
},
groups: [
{
groupName: strings.BasicGroupName,
groupFields: [
PropertyPaneTextField('description', {
label: strings.DescriptionFieldLabel
})
]
}
]
}
]
};
}
}
```
|
Watch Hill may refer to:
in England
Watch Hill (Cockermouth), a 254 m Marilyn and Wainwright Outlying Fell near Cockermouth in the Lake District
Watch Hill (Whitehaven), a 172 m hill near Whitehaven in the Lake District
Watch Hill Castle, a medieval fortification in Greater Manchester
in the United States
Watch Hill, New York
Watch Hill, Rhode Island
Watch Hill Light, a lighthouse in Watch Hill, Rhode Island
See also
Watchhill, Cumbria, England
Watchill, Dumfries and Galloway, Scotland
|
```vue
<template>
<a-row :gutter="24">
<a-col :md="24">
<a-card :style="cardStyle" :bordered="false">
<!-- -->
<div class="table-page-search-wrapper">
<!-- -->
<a-form layout="inline" @keyup.enter.native="searchQuery">
<a-row :gutter="24">
<a-col :md="6" :sm="24">
<a-form-item label="" :labelCol="labelCol" :wrapperCol="wrapperCol">
<a-input placeholder="" v-model="queryParam.number"></a-input>
</a-form-item>
</a-col>
<a-col :md="6" :sm="24">
<a-form-item label="" :labelCol="labelCol" :wrapperCol="wrapperCol">
<a-input placeholder="" v-model="queryParam.materialParam"></a-input>
</a-form-item>
</a-col>
<a-col :md="6" :sm="24">
<a-form-item label="" :labelCol="labelCol" :wrapperCol="wrapperCol">
<a-range-picker
style="width:100%"
v-model="queryParam.createTimeRange"
format="YYYY-MM-DD"
:placeholder="['', '']"
@change="onDateChange"
@ok="onDateOk"
/>
</a-form-item>
</a-col>
<span style="float: left;overflow: hidden;" class="table-page-search-submitButtons">
<a-col :md="6" :sm="24">
<a-button type="primary" @click="searchQuery"></a-button>
<a-button style="margin-left: 8px" @click="searchReset"></a-button>
<a @click="handleToggleSearch" style="margin-left: 8px">
{{ toggleSearchStatus ? '' : '' }}
<a-icon :type="toggleSearchStatus ? 'up' : 'down'"/>
</a>
</a-col>
</span>
<template v-if="toggleSearchStatus">
<a-col :md="6" :sm="24">
<a-form-item label="" :labelCol="labelCol" :wrapperCol="wrapperCol">
<a-select placeholder="" showSearch optionFilterProp="children" v-model="queryParam.creator">
<a-select-option v-for="(item,index) in userList" :key="index" :value="item.id">
{{ item.userName }}
</a-select-option>
</a-select>
</a-form-item>
</a-col>
<a-col :md="6" :sm="24">
<a-form-item label="" :labelCol="labelCol" :wrapperCol="wrapperCol">
<a-select placeholder="" v-model="queryParam.status">
<a-select-option value="0"></a-select-option>
<a-select-option value="9" v-if="!checkFlag"></a-select-option>
<a-select-option value="1"></a-select-option>
<a-select-option value="3"></a-select-option>
<a-select-option value="2"></a-select-option>
</a-select>
</a-form-item>
</a-col>
<a-col :md="6" :sm="24">
<a-form-item label="" :labelCol="labelCol" :wrapperCol="wrapperCol">
<a-input placeholder="" v-model="queryParam.remark"></a-input>
</a-form-item>
</a-col>
</template>
</a-row>
</a-form>
</div>
<!-- -->
<div class="table-operator" style="margin-top: 5px">
<a-button v-if="btnEnableList.indexOf(1)>-1" @click="myHandleAdd" type="primary" icon="plus"></a-button>
<a-button v-if="btnEnableList.indexOf(1)>-1" icon="delete" @click="batchDel"></a-button>
<a-button v-if="checkFlag && btnEnableList.indexOf(2)>-1" icon="check" @click="batchSetStatus(1)"></a-button>
<a-button v-if="checkFlag && btnEnableList.indexOf(7)>-1" icon="stop" @click="batchSetStatus(0)"></a-button>
<a-button v-if="isShowExcel && btnEnableList.indexOf(3)>-1" icon="download" @click="handleExport"></a-button>
<a-popover trigger="click" placement="right">
<template slot="content">
<a-checkbox-group @change="onColChange" v-model="settingDataIndex" :defaultValue="settingDataIndex">
<a-row style="width: 500px">
<template v-for="(item,index) in defColumns">
<template>
<a-col :span="8">
<a-checkbox :value="item.dataIndex">
<j-ellipsis :value="item.title" :length="10"></j-ellipsis>
</a-checkbox>
</a-col>
</template>
</template>
</a-row>
<a-row style="padding-top: 10px;">
<a-col>
<a-button @click="handleRestDefault" type="link" size="small"></a-button>
</a-col>
</a-row>
</a-checkbox-group>
</template>
<a-button icon="setting"></a-button>
</a-popover>
<a-tooltip placement="left" title="
" slot="action">
<a-icon v-if="btnEnableList.indexOf(1)>-1" type="question-circle" style="font-size:20px;float:right;" />
</a-tooltip>
</div>
<!-- table-begin -->
<div>
<a-table
ref="table"
size="middle"
bordered
rowKey="id"
:columns="columns"
:dataSource="dataSource"
:components="handleDrag(columns)"
:pagination="ipagination"
:scroll="scroll"
:loading="loading"
:rowSelection="{selectedRowKeys: selectedRowKeys, onChange: onSelectChange}"
@change="handleTableChange">
<span slot="action" slot-scope="text, record">
<a @click="myHandleDetail(record, '', prefixNo)"></a>
<a-divider v-if="btnEnableList.indexOf(1)>-1" type="vertical" />
<a v-if="btnEnableList.indexOf(1)>-1" @click="myHandleEdit(record)"></a>
<a-divider v-if="btnEnableList.indexOf(1)>-1" type="vertical" />
<a v-if="btnEnableList.indexOf(1)>-1" @click="myHandleCopyAdd(record)"></a>
<a-divider v-if="btnEnableList.indexOf(1)>-1" type="vertical" />
<a-popconfirm v-if="btnEnableList.indexOf(1)>-1" title="?" @confirm="() => myHandleDelete(record)">
<a></a>
</a-popconfirm>
</span>
<template slot="customRenderStatus" slot-scope="status">
<a-tag v-if="status == '0'" color="red"></a-tag>
<a-tag v-if="status == '1'" color="green"></a-tag>
<a-tag v-if="status == '2'" color="cyan"></a-tag>
<a-tag v-if="status == '3'" color="blue"></a-tag>
<a-tag v-if="status == '9'" color="orange"></a-tag>
</template>
</a-table>
</div>
<!-- table-end -->
<!-- -->
<purchase-apply-modal ref="modalForm" @ok="modalFormOk" @close="modalFormClose"></purchase-apply-modal>
<bill-detail ref="modalDetail" @ok="modalFormOk" @close="modalFormClose"></bill-detail>
<bill-excel-iframe ref="billExcelIframe" @ok="modalFormOk" @close="modalFormClose"></bill-excel-iframe>
</a-card>
</a-col>
</a-row>
</template>
<!-- by ji sheng hua-->
<script>
import PurchaseApplyModal from './modules/PurchaseApplyModal'
import BillDetail from './dialog/BillDetail'
import BillExcelIframe from '@/components/tools/BillExcelIframe'
import { JeecgListMixin } from '@/mixins/JeecgListMixin'
import { BillListMixin } from './mixins/BillListMixin'
import JEllipsis from '@/components/jeecg/JEllipsis'
import JDate from '@/components/jeecg/JDate'
import Vue from 'vue'
export default {
name: "PurchaseApplyList",
mixins:[JeecgListMixin,BillListMixin],
components: {
PurchaseApplyModal,
BillDetail,
BillExcelIframe,
JEllipsis,
JDate
},
data () {
return {
//
queryParam: {
number: "",
materialParam: "",
type: "",
subType: "",
creator: "",
status: "",
remark: ""
},
prefixNo: 'QGD',
labelCol: {
span: 5
},
wrapperCol: {
span: 18,
offset: 1
},
//
defDataIndex:['action','number','materialsList','operTimeStr','userName','materialCount','status'],
//
defColumns: [
{
title: '',
dataIndex: 'action',
align:"center", width: 180,
scopedSlots: { customRender: 'action' },
},
{ title: '', dataIndex: 'number',width:180},
{ title: '', dataIndex: 'materialsList',width:320, ellipsis:true},
{ title: '', dataIndex: 'operTimeStr',width:185},
{ title: '', dataIndex: 'userName',width:120, ellipsis:true},
{ title: '', dataIndex: 'materialCount',width:80},
{ title: '', dataIndex: 'remark',width:250},
{ title: '', dataIndex: 'status', width: 100, align: "center",
scopedSlots: { customRender: 'customRenderStatus' }
}
],
url: {
list: "/depotHead/list",
delete: "/depotHead/delete",
deleteBatch: "/depotHead/deleteBatch",
batchSetStatusUrl: "/depotHead/batchSetStatus"
}
}
},
created() {
this.initSystemConfig()
this.initUser()
},
computed: {
},
methods: {
}
}
</script>
<style scoped>
@import '~@assets/less/common.less'
</style>
```
|
```java
package com.yahoo.vespa.config.server.http;
/**
* Will create an exception which will result in a Request Timeout, 408.
*/
public class RequestTimeoutException extends RuntimeException {
public RequestTimeoutException(String message) {
super(message);
}
}
```
|
Reed Island State Park is a public recreation area on the Columbia River east of Washougal in Clark County, Washington. The state park comprises Reed island and is only accessible by boat. The island, which is part of the Columbia River Water Trail, has primitive camping and picnicking areas.
References
External links
Reed Island State Park Washington State Parks and Recreation Commission
Reed Island State Park Map Washington State Parks and Recreation Commission
Parks in Clark County, Washington
Portland metropolitan area
State parks of Washington (state)
|
The Sawyer Kill or Sawyer's Kill is a tributary stream of the Hudson River in New York state. The source is at the Great Vlaie on the border of Ulster and Greene counties. The stream enters the Hudson River at Seamon Park in Malden, New York, just north of the village of Saugerties.
Saugerties takes its name from the Dutch, "Saugerje's Kill" or "Little Sawyer's creek".
See also
List of rivers of New York
References
Rivers of New York (state)
Tributaries of the Hudson River
Rivers of Ulster County, New York
|
Iso Omena (Finnish for "Big Apple") is a shopping centre in Matinkylä, Espoo, Finland, opened on September 24, 2001. The construction of Iso Omena aimed to, as far as possible, take heed of the wishes of the population of Espoo. Because of this, Iso Omena includes many centralised municipal and private services. Iso Omena also includes apartments, with a direct connection to the shopping centre. The name "Iso Omena" comes from the nickname "The Big Apple" of New York City in the United States.
Iso Omena includes over 200 businesses. The total area for rent is approximately . The building has three floors, a parking lot on the bottom floor and a separate parking building and an office tower.
Information
It opened September 24, 2001. It is owned by Doughty Hanson & Co Real Estate Fund. The architect was Mauri Tommila. Its motto is "Like a small city".
It houses over 200 businesses. It has four floors: Parking lot floor P, Market floor M, Forum floor T and Service floor S. It provides approximately 1,100 jobs.
It has sales of approximately 260 million Euro per year and approximately 12 million visitors per year.
Largest businesses
K-Citymarket:
Prisma:
Kirjasto Omena:
Aleksi 13:
Stadium:
HOK, restaurants:
Area
It has a Total area of with area for rent comprising a shopping centre of offices of and Senior apartments of (95 apartments).
Parking
It has approximately 2,200 free parking spaces in total, divided into Parking lot floor P1 (1,061), Parking lot floor P2 (818), Outside on the market floor P3 (136), Outside on the roof P2 (172), Totaling : 2,187
Services
Services offered include: library, Espoo city common service centre, ticket service and medical and dental health service, chapel, KELA, office of the Finnish employment bureau, and a movie theatre.
Connections
Iso Omena can be reached by all buses travelling along Länsiväylä past Matinkylä, and by buses passing over Piispansilta. Beginning from November 2017, the shopping centre can also be reached by the metro. The Matinkylä metro station is located directly under the southern part of Iso Omena.
References
External links
Shopping centres in Espoo
|
Sainte-Apolline-de-Patton is a parish municipality of 542 people in Montmagny Regional County Municipality in the Chaudière-Appalaches region of Quebec.
Demographics
In the 2021 Census of Population conducted by Statistics Canada, Sainte-Apolline-de-Patton had a population of living in of its total private dwellings, a change of from its 2016 population of . With a land area of , it had a population density of in 2021.
See also
L'Islet Regional County Municipality
Big Black River (Saint John River), a river
List of parish municipalities in Quebec
References
Parish municipalities in Quebec
Incorporated places in Chaudière-Appalaches
|
```smalltalk
"
Dead Block. The block is not assigned, not returned and no message is send to it.
Often this is a left over from using blocks to comment out code.
"
Class {
#name : 'ReDeadBlockRule',
#superclass : 'ReNodeBasedRule',
#category : 'General-Rules-Optimization',
#package : 'General-Rules',
#tag : 'Optimization'
}
{ #category : 'accessing' }
ReDeadBlockRule class >> group [
^ 'Optimization'
]
{ #category : 'accessing' }
ReDeadBlockRule class >> rationale [
^ 'Dead Block. The block is not assigned, not returned and no message is send to it.
Often this is a left over from using blocks to comment out code.'
]
{ #category : 'accessing' }
ReDeadBlockRule class >> ruleName [
^ 'Dead Block'
]
{ #category : 'accessing' }
ReDeadBlockRule class >> severity [
^ #information
]
{ #category : 'accessing' }
ReDeadBlockRule class >> uniqueIdentifierName [
"This number should be unique and should change only when the rule completely change semantics"
^'DeadBlockRule'
]
{ #category : 'running' }
ReDeadBlockRule >> basicCheck: node [
^ node isBlock and: [ node isUsedAsReturnValue not ]
]
```
|
Village Suisse ONG is a Swiss-based NGO, accredited to the UN ECOSOC, with a stated mandate to help children in developing countries, to provide computers to persons in developing countries and to provide social integration for persons in Switzerland.
Village Suisse ONG and the Church of Scientology
Village Suisse ONG is associated with several events of the Church of Scientology
The relationship of Village Suisse ONG to the Church of Scientology caused media controversy in 2009, when the UN Office at Geneva (UNOG) refused entrance of the Scientology group "Youth for Understanding" to the UN premises, for a meeting which had been planned and organized by Village Suisse ONG.
In 2016, Village Suisse ONG was again noted by the Tribune de Geneve for holding a conference for a "Day of the NGOs", sponsored by the Church of Scientology. The news-article claimed that documentation distributed at the meeting in the UN Palais des Nations was probably edited by the Church of Scientology.
See also
Youth for Human Rights International
References
Scientology
|
Karla Erbová (born Fremrová; pseudonym: K. Papežová) (born 1933 in Plzeň) is a contemporary Czech poet, prose writer, and journalist. Many of her writings are historical or mythological in subject matter, often including works on Ancient Greece.
References
External links
Karla Erbová at the Portal of Czech Literature
1933 births
Living people
Czech poets
Czech women writers
Writers from Plzeň
|
```objective-c
/*
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. 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.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. ``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 APPLE INC. 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.
*/
#pragma once
#if ENABLE(DFG_JIT)
namespace JSC { namespace DFG {
class Graph;
// Cleans up unneeded nodes, like empty Checks and Phantoms.
bool performCleanUp(Graph&);
} } // namespace JSC::DFG
#endif // ENABLE(DFG_JIT)
```
|
Simeon "Sima" Milutinović "Sarajlija" (, ; 3 October 1791 – 30 December 1847) was a poet, hajduk, translator, historian and adventurer. Literary critic Jovan Skerlić dubbed him the first Serbian romantist.
Life and work
Sima Milutinović was born in Sarajevo, Ottoman Empire in 1791, hence his nickname Sarajlija (The Sarajevan). His father Milutin was from the village of Rožanstvo near Užice, which he left running away from the plague and eventually settled in Sarajevo, where he was married.
When Sarajlija was a child, the family fled the town seeking because of a plague. They sought refuge at several locations in Bosnia and Slavonski Brod before ending up in Zemun, where Sima commenced primary education which he never completed. He attended a school in Szeged and was later expelled from gymnasium in Sremski Karlovci.
During the First Serbian Uprising he was a scribe in Karađorđe's Governing Council (Praviteljstvujušći Sovjet). Sarajlija joined a guerilla group commanded by hajduk Zeka Buljubaša. It was in the heat of battles with Ottoman Turks that his first poems germinated. They were mostly lovesongs, inspired by his first great love - Fatima. After the collapse of the First Serbian Uprising he was a hajduk and teacher in Vidin. He also spent a year or two in a Turkish dungeon. After evading the Turks, he went to Chişinău (then part of Imperial Russia), where he remained, long enough to write The Serbian Maid. It is said that he sent reports to confidants of Miloš Obrenović I, Prince of Serbia concerning Karađorđe's followers in exile. In 1825 he went to Germany where he enrolled in the University of Leipzig, though he did not tarry there. Instead, a year later, he went back to Serbia to be a clerk in the employ of Prince Miloš but on arriving in Zemun, however, he turned about and went to Trieste, Kotor, and then Cetinje.
He arrived in Cetinje on 25 September 1827, and the Bishop of Montenegro took him in as a secretary. He also went among the tribes to dispense justice and settle disputes and took upon himself the education of Bishop's nephew Rade (Petar II Petrović-Njegoš). In 1829 Bjelice tribe struggled against Ozrinići and Kuće, two neighboring tribes, and his former pupil Petar II Petrović-Njegoš sent Sarajlija and Mojsije to negotiate peace among them. Sarajlija remained in Cetinje for more than three years, until the spring of 1831. He came to Montenegro for another three times.
In 1836, he escorted Prince Miloš to Constantinople and went on to travel to Prague, Vienna and Budapest. He remained a while in Budapest and married Marija Popović-Punktatorka (1810–1875), who was also a poet.
He died suddenly in Belgrade at the end of 1847. He was buried in the graveyard at St. Mark's Church.
Selected works
Serbijanka, epic poem
Nekolike pjesnice, stare, nove, prevedene i sočinjene Simom Milutinovićem Sarajlijom, book of poems
Zorica, book of poems
Tragedija Obilić, epic poem about Miloš Obilić
Raspjevke Talfiji, book of poems
Dika crnogorska, drama
Istorija Crne Gore: History of Montenegro
Pjevanija crnogorska i hercegovačka, collection of Serbian epic poetry from Montenegro and Herzegovina
Tragedija vožda Karađorđa, epic poem about Leader Karađorđe
Collected works published in 6 volumes
See also
Serbian art
References
Further reading
Milovan Djilas: "Njegoš - poet, prince, bishop," Harcourt Brace (1966)
Jovan Pejčić: Zasnovi Gligorija Vozarovića, 158 str, izd. Dental, Beograd 1995, v. fusnotu 166. na str. 118–120.
Tanja Popović, Poslednje Sarajlijino delo - o Tragediji Vožda Karađorđa, Beograd, 1992.
Jovan Skerlić, Istorija nove srpske književnosti (Belgrade, 1921), pages 156-163
Adapted from Serbian Wikipedia: Сима Милутиновић Сарајлија
1791 births
1847 deaths
Serbian dramatists and playwrights
19th-century Serbian historians
Serbian male poets
Epic poets
Serbian translators
Serbs of Bosnia and Herzegovina
Writers from Sarajevo
Montenegrin poets
Montenegrin male writers
19th-century poets
19th-century dramatists and playwrights
19th-century translators
Serbs from the Ottoman Empire
|
Daniel López Ramos (born 24 November 1976) is a Spanish former footballer who played as a central defender.
Club career
Born in Jerez de la Frontera, Province of Cádiz, López Ramos played 308 Segunda División matches over ten seasons in representation of five clubs, mainly Córdoba CF.
He retired in June 2011 at nearly 35, after one year in Segunda División B with Real Oviedo.
External links
1976 births
Living people
Footballers from Jerez de la Frontera
Spanish men's footballers
Men's association football defenders
Segunda División players
Segunda División B players
Xerez CD footballers
Córdoba CF players
Polideportivo Ejido footballers
UD Las Palmas players
Albacete Balompié players
Real Oviedo players
|
Giləzi (Tat: Güləzi) is a village and the most populous municipality in the Khizi Rayon of Azerbaijan. It has a population of 3,530.
References
Populated places in Khizi District
|
The Maritime & Seafood Industry Museum (MSIM) was established in 1986 to preserve and interpret the maritime history and heritage of Biloxi and the Mississippi Gulf Coast. It accomplishes this mission through an array of exhibits on shrimping, oystering, recreational fishing, wetlands, managing marine resources, charter boats, marine blacksmithing, wooden boat building, net-making, catboats/Biloxi skiff, shrimp peeling machine and numerous historic photographs and objects. The Wade Guice Hurricane Museum within the museum, featuring of exhibit space and a state of the art theatre. The Museum has brought life to local maritime history and heritage by replicating two 65-ft two-masted Biloxi Schooners.
In August 2005, the Museum was destroyed by Hurricane Katrina. Nine years later, a newly constructed museum opened to the public.
Programs
The Maritime & Seafood Industry Museum currently sponsors two programs annually, the Sea and Sail Adventure Camp and the Billy Creel Memorial Wooden Boat Show.
In the Sea and Sail Adventure Camp, children aged 8–13 are given experience of the history and heritage of the Mississippi Gulf Coast through sailing trips, fishing, maritime crafts, and seafood industry field trips.
The Billy Creel Memorial Wooden Boat Show presents the historic, antique, classic and contemporary wooden boats at the largest gathering of watercraft on the Mississippi Gulf Coast.
Schooners
The Maritime & Seafood Industry Museum has recaptured a piece of history in their two famous schooner, the "Glenn L. Swetman" and the "Mike Sekul". For a truly unique way of enjoying the Mississippi Gulf Coast. Step on board an authentic replica of a Biloxi oyster schooner. These "White Winged Queens" once sailed the Coast from the late 1800s to the early 1900s; however the introduction of marine engines and the changes in oyster harvesting laws caused these beautiful crafts to disappear.
Schooner Pier Complex
Completed in June 2006, the Schooner Pier Complex provides a home for the two Biloxi Schooner replicas, Glenn L. Swetman and Mike Sekul. The pier has three pavilions, storage area for schooner parts, handicapped accessible rest room facilities and a second story observation deck. It also has a marine pump out station and an area for a future gift shop and office area for schooner business.
Reconstruction
On August 2, 2014, a new three-story museum, containing , opened to the public.
See also
List of maritime museums in the United States
References
External links
Maritime & Seafood Industry Museum - official site
Museums established in 1986
Buildings and structures in Biloxi, Mississippi
History of Mississippi
Maritime museums in Mississippi
Food museums in the United States
Museums in Harrison County, Mississippi
1986 establishments in Mississippi
|
```python
import re
import sys
import os
from .ansi import AnsiFore, AnsiBack, AnsiStyle, Style
from .winterm import WinTerm, WinColor, WinStyle
from .win32 import windll
winterm = None
if windll is not None:
winterm = WinTerm()
def is_a_tty(stream):
return hasattr(stream, 'isatty') and stream.isatty()
class StreamWrapper(object):
'''
Wraps a stream (such as stdout), acting as a transparent proxy for all
attribute access apart from method 'write()', which is delegated to our
Converter instance.
'''
def __init__(self, wrapped, converter):
# double-underscore everything to prevent clashes with names of
# attributes on the wrapped stream object.
self.__wrapped = wrapped
self.__convertor = converter
def __getattr__(self, name):
return getattr(self.__wrapped, name)
def write(self, text):
self.__convertor.write(text)
class AnsiToWin32(object):
'''
Implements a 'write()' method which, on Windows, will strip ANSI character
sequences from the text, and if outputting to a tty, will convert them into
win32 function calls.
'''
ANSI_CSI_RE = re.compile('\033\[((?:\d|;)*)([a-zA-Z])') # Control Sequence Introducer
ANSI_OSC_RE = re.compile('\033\]((?:.|;)*?)(\x07)') # Operating System Command
def __init__(self, wrapped, convert=None, strip=None, autoreset=False):
# The wrapped stream (normally sys.stdout or sys.stderr)
self.wrapped = wrapped
# should we reset colors to defaults after every .write()
self.autoreset = autoreset
# create the proxy wrapping our output stream
self.stream = StreamWrapper(wrapped, self)
on_windows = os.name == 'nt'
on_emulated_windows = on_windows and 'TERM' in os.environ
# should we strip ANSI sequences from our output?
if strip is None:
strip = on_windows and not on_emulated_windows
self.strip = strip
# should we should convert ANSI sequences into win32 calls?
if convert is None:
convert = on_windows and not wrapped.closed and not on_emulated_windows and is_a_tty(wrapped)
self.convert = convert
# dict of ansi codes to win32 functions and parameters
self.win32_calls = self.get_win32_calls()
# are we wrapping stderr?
self.on_stderr = self.wrapped is sys.stderr
def should_wrap(self):
'''
True if this class is actually needed. If false, then the output
stream will not be affected, nor will win32 calls be issued, so
wrapping stdout is not actually required. This will generally be
False on non-Windows platforms, unless optional functionality like
autoreset has been requested using kwargs to init()
'''
return self.convert or self.strip or self.autoreset
def get_win32_calls(self):
if self.convert and winterm:
return {
AnsiStyle.RESET_ALL: (winterm.reset_all, ),
AnsiStyle.BRIGHT: (winterm.style, WinStyle.BRIGHT),
AnsiStyle.DIM: (winterm.style, WinStyle.NORMAL),
AnsiStyle.NORMAL: (winterm.style, WinStyle.NORMAL),
AnsiFore.BLACK: (winterm.fore, WinColor.BLACK),
AnsiFore.RED: (winterm.fore, WinColor.RED),
AnsiFore.GREEN: (winterm.fore, WinColor.GREEN),
AnsiFore.YELLOW: (winterm.fore, WinColor.YELLOW),
AnsiFore.BLUE: (winterm.fore, WinColor.BLUE),
AnsiFore.MAGENTA: (winterm.fore, WinColor.MAGENTA),
AnsiFore.CYAN: (winterm.fore, WinColor.CYAN),
AnsiFore.WHITE: (winterm.fore, WinColor.GREY),
AnsiFore.RESET: (winterm.fore, ),
AnsiFore.LIGHTBLACK_EX: (winterm.fore, WinColor.BLACK, True),
AnsiFore.LIGHTRED_EX: (winterm.fore, WinColor.RED, True),
AnsiFore.LIGHTGREEN_EX: (winterm.fore, WinColor.GREEN, True),
AnsiFore.LIGHTYELLOW_EX: (winterm.fore, WinColor.YELLOW, True),
AnsiFore.LIGHTBLUE_EX: (winterm.fore, WinColor.BLUE, True),
AnsiFore.LIGHTMAGENTA_EX: (winterm.fore, WinColor.MAGENTA, True),
AnsiFore.LIGHTCYAN_EX: (winterm.fore, WinColor.CYAN, True),
AnsiFore.LIGHTWHITE_EX: (winterm.fore, WinColor.GREY, True),
AnsiBack.BLACK: (winterm.back, WinColor.BLACK),
AnsiBack.RED: (winterm.back, WinColor.RED),
AnsiBack.GREEN: (winterm.back, WinColor.GREEN),
AnsiBack.YELLOW: (winterm.back, WinColor.YELLOW),
AnsiBack.BLUE: (winterm.back, WinColor.BLUE),
AnsiBack.MAGENTA: (winterm.back, WinColor.MAGENTA),
AnsiBack.CYAN: (winterm.back, WinColor.CYAN),
AnsiBack.WHITE: (winterm.back, WinColor.GREY),
AnsiBack.RESET: (winterm.back, ),
AnsiBack.LIGHTBLACK_EX: (winterm.back, WinColor.BLACK, True),
AnsiBack.LIGHTRED_EX: (winterm.back, WinColor.RED, True),
AnsiBack.LIGHTGREEN_EX: (winterm.back, WinColor.GREEN, True),
AnsiBack.LIGHTYELLOW_EX: (winterm.back, WinColor.YELLOW, True),
AnsiBack.LIGHTBLUE_EX: (winterm.back, WinColor.BLUE, True),
AnsiBack.LIGHTMAGENTA_EX: (winterm.back, WinColor.MAGENTA, True),
AnsiBack.LIGHTCYAN_EX: (winterm.back, WinColor.CYAN, True),
AnsiBack.LIGHTWHITE_EX: (winterm.back, WinColor.GREY, True),
}
return dict()
def write(self, text):
if self.strip or self.convert:
self.write_and_convert(text)
else:
self.wrapped.write(text)
self.wrapped.flush()
if self.autoreset:
self.reset_all()
def reset_all(self):
if self.convert:
self.call_win32('m', (0,))
elif not self.wrapped.closed and is_a_tty(self.wrapped):
self.wrapped.write(Style.RESET_ALL)
def write_and_convert(self, text):
'''
Write the given text to our wrapped stream, stripping any ANSI
sequences from the text, and optionally converting them into win32
calls.
'''
cursor = 0
text = self.convert_osc(text)
for match in self.ANSI_CSI_RE.finditer(text):
start, end = match.span()
self.write_plain_text(text, cursor, start)
self.convert_ansi(*match.groups())
cursor = end
self.write_plain_text(text, cursor, len(text))
def write_plain_text(self, text, start, end):
if start < end:
self.wrapped.write(text[start:end])
self.wrapped.flush()
def convert_ansi(self, paramstring, command):
if self.convert:
params = self.extract_params(command, paramstring)
self.call_win32(command, params)
def extract_params(self, command, paramstring):
if command in 'Hf':
params = tuple(int(p) if len(p) != 0 else 1 for p in paramstring.split(';'))
while len(params) < 2:
# defaults:
params = params + (1,)
else:
params = tuple(int(p) for p in paramstring.split(';') if len(p) != 0)
if len(params) == 0:
# defaults:
if command in 'JKm':
params = (0,)
elif command in 'ABCD':
params = (1,)
return params
def call_win32(self, command, params):
if command == 'm':
for param in params:
if param in self.win32_calls:
func_args = self.win32_calls[param]
func = func_args[0]
args = func_args[1:]
kwargs = dict(on_stderr=self.on_stderr)
func(*args, **kwargs)
elif command in 'J':
winterm.erase_screen(params[0], on_stderr=self.on_stderr)
elif command in 'K':
winterm.erase_line(params[0], on_stderr=self.on_stderr)
elif command in 'Hf': # cursor position - absolute
winterm.set_cursor_position(params, on_stderr=self.on_stderr)
elif command in 'ABCD': # cursor position - relative
n = params[0]
# A - up, B - down, C - forward, D - back
x, y = {'A': (0, -n), 'B': (0, n), 'C': (n, 0), 'D': (-n, 0)}[command]
winterm.cursor_adjust(x, y, on_stderr=self.on_stderr)
def convert_osc(self, text):
for match in self.ANSI_OSC_RE.finditer(text):
start, end = match.span()
text = text[:start] + text[end:]
paramstring, command = match.groups()
if command in '\x07': # \x07 = BEL
params = paramstring.split(";")
# 0 - change title and icon (we will only change title)
# 1 - change icon (we don't support this)
# 2 - change title
if params[0] in '02':
winterm.set_title(params[1])
return text
```
|
```qmake
# Add project specific ProGuard rules here.
# By default, the flags in this file are appended to flags specified
# in /Users/victor/Documents/AndroidStudio/android_sdk/tools/proguard/proguard-android.txt
# You can edit the include path and order by changing the proguardFiles
# directive in build.gradle.
#
# For more details, see
# path_to_url
# Add any project specific keep options here:
# If your project uses WebView with JS, uncomment the following
# and specify the fully qualified class name to the JavaScript interface
# class:
#-keepclassmembers class fqcn.of.javascript.interface.for.webview {
# public *;
#}
```
|
Rheomithres (Old Persian: ; Ancient Greek: ) was a Persian noble. He was father of several children, including Phrasaortes whom Alexander the Great appointed satrap of Persis in 330 BC. He joined in the Great Satraps' Revolt of the western Persian provinces from Artaxerxes II, in 362 BC, and was employed by his confederates to go to Tachos, pharaoh of Egypt, for aid. He came back with 500 talents and 50 warships and he is supposed to have left his wife and his children to Tachos as a guarantee for his assistance. Nevertheless, Rheomithres betrayed the rebels and he invited a number of them in a meeting. On their arrival, he arrested them, and despatched them in chains to Artaxerxes to receive the bounties, thus making his own peace at court. Rheomithres took part in the battle of the Granicus, in 334 BC, where he was in command of a body of 2,000 cavalry on the right wing, between 1,000 Medes and 2,000 Bactrians. He survived the battle and the next year he joined Darius at the battle of Issus (modern-day Turkey), where he lost his life.
References
Sources
4th-century BC Iranian people
Military leaders of the Achaemenid Empire
Darius III
|
İşcan is a Turkish given name for males and a surname. Notable people with the surname include:
Dilan Deniz Gökçek İşcan (born 1976), Turkish female football official
Eray İşcan (born 1991), Turkish footballer
Haşim İşcan (1898-1968), Turkish educator, province governor and the first elected mayor of Istanbul
Turkish-language surnames
|
```shell
Fast file indexing with `updatedb` and `locate`
Finding file with regexes
Converting between Unix and Windows text files
Deleting files in a secure manner
Monitor the progress of data through a pipe with `pv`
```
|
```objective-c
/*
*
* @APPLE_OSREFERENCE_LICENSE_HEADER_START@
*
* This file contains Original Code and/or Modifications of Original Code
* may not be used to create, or enable the creation or redistribution of,
* unlawful or unlicensed copies of an Apple operating system, or to
* circumvent, violate, or enable the circumvention or violation of, any
* terms of an Apple operating system software license agreement.
*
* path_to_url and read it before using this file.
*
* distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
* EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
* INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
*
* @APPLE_OSREFERENCE_LICENSE_HEADER_END@
*/
#ifndef _BSD_I386__TYPES_H_
#define _BSD_I386__TYPES_H_
#if defined (__i386__) || defined (__x86_64__)
typedef long __darwin_intptr_t;
typedef unsigned int __darwin_natural_t;
#endif /* defined (__i386__) || defined (__x86_64__) */
#endif /* _BSD_I386__TYPES_H_ */
```
|
The Menu is a 2022 American comedy horror film directed by Mark Mylod, written by Seth Reiss and Will Tracy, based on an original story created by Tracy, produced by Adam McKay, Betsy Koch and Will Ferrell. The film stars Ralph Fiennes as a celebrity chef with Hong Chau playing his assistant and Anya Taylor-Joy, Nicholas Hoult, Janet McTeer, Reed Birney, Judith Light, Aimee Carrero, and John Leguizamo playing diners who attend his exclusive restaurant.
The Menu had its world premiere at the Toronto International Film Festival on September 10, 2022, and was released in the United States on November 18, 2022, by Searchlight Pictures. The film grossed over $79 million worldwide and received positive reviews from critics.
Plot
Foodie Tyler Ledford and his date, Margot Mills, travel by boat to Hawthorn, an exclusive restaurant on a private island owned by celebrity chef Julian Slowik. The other guests are food critic Lillian Bloom; her editor Ted; wealthy regulars Richard and Anne Leibrandt; washed-up movie star George Diaz and his personal assistant Felicity Lynn; business partners Soren, Dave, and Bryce; and Slowik's alcoholic mother Linda. The group is given an island tour by the maître d' Elsa, who notes that Margot is not Tyler's designated guest.
Dinner begins and Slowik introduces a series of courses, during which he delivers increasingly unsettling monologues. For the third course, uncomfortable truths about each guest are exposed via images laser-printed on tortillas. During the fourth course, sous-chef Jeremy kills himself. When Richard tries to leave, the staff cuts off his left ring finger as a warning to stay. Hawthorn's angel investor Doug Verrick, to whom Slowik relinquished ownership during the COVID-19 pandemic, is drowned in front of the guests. The fifth course commences with Slowik allowing himself to be stabbed by Katherine, an employee whom he had sexually harassed. The female guests dine with Katherine while the men are given the chance to escape the island via a game of cat-and-mouse, but Slowik's staff catches them all. When Lillian attempts to gain Katherine's favor by offering assistance in starting her own restaurant, Katherine reveals that she was the one who suggested Slowik kill the guests and staff.
Slowik explains that each guest was invited because they contributed to him losing his passion for his craft or because they make a living by exploiting the work of food artisans like him. He announces that everyone will be dead by the end of the night. Since Margot's presence was unplanned, Slowik privately gives her the choice of dying with the staff or the guests. When she hesitates, he chooses the staff. Margot is unmasked as an escort named Erin, whose clients included Richard, whom she stopped meeting because he hired her to pretend to be his daughter. Slowik reveals that Tyler was informed the guests would be killed. Despite this, he was so zealous to participate in Slowik's craft that he kept it secret and hired Margot to replace his ex-girlfriend because Hawthorn does not seat lone diners. Slowik invites Tyler to cook, and his performance in the kitchen fails to live up to his pretensions. Slowik humiliates him by detailing his culinary mistakes, then whispers in his ear, and a deflated Tyler leaves the kitchen.
Slowik asks Margot to go to the smokehouse and collect a barrel needed for dessert. As she leaves the kitchen, she discovers that Tyler has hanged himself in a closet. En route, Margot sneaks into Slowik's house, where she is attacked by a jealous Elsa. After a scuffle, Margot fatally stabs her. After seeing a framed employee of the month award showing Slowik as a young and happy cook preparing hamburgers at a greasy spoon diner, Margot finds a radio, calls for help and returns to the restaurant with the barrel. A Coast Guard officer named Dale arrives. After the guests are convinced they have been saved, Dale reveals himself to be a line cook in disguise and returns to the kitchen.
As dessert is being prepared, Margot confronts Slowik for his "loveless" cooking and complains that she is still hungry. When he asks what she would like, Margot requests a cheeseburger and French fries prepared without the pretentiousness of fine dining. Moved by her request, Slowik personally does so, and finds joy in preparing it. After one bite, Margot praises the food, then requests to take it "to go". Slowik allows her to leave, and Margot escapes on the Coast Guard boat docked nearby. The dessert is an elevated s'mores dish—the staff decorate the restaurant with crushed graham crackers and melted chocolate, then adorn the guests with stoles made of marshmallows and hats made of chocolate. Slowik sets the restaurant ablaze, detonating the barrel and killing the guests, staff, and himself. Safely away, Margot eats her cheeseburger as she watches the restaurant burn, and uses a copy of the menu to wipe her mouth.
Cast
Ralph Fiennes as Chef Slowik
Anya Taylor-Joy as Margot
Nicholas Hoult as Tyler
Hong Chau as Elsa
Janet McTeer as Lillian
Paul Adelstein as Ted
John Leguizamo as a movie star
Aimee Carrero as Felicity
Reed Birney as Richard
Judith Light as Anne
Rob Yang as Bryce
Arturo Castro as Soren
Mark St. Cyr as Dave
Rebecca Koon as Linda
Peter Grosz as sommelier
Christina Brucato as Katherine
Adam Aalderks as Jeremy
Production
Development
Will Tracy dined at Cornelius Sjømatrestaurant, an island restaurant outside Bergen, Norway, during a honeymoon and later suggested a story to Seth Reiss inspired by the experience. Several figures from the world of fine dining were brought on as consultants for the film, including chef Dominique Crenn, who recreated several dishes from her San Francisco restaurant Atelier Crenn for the fictional restaurant Hawthorn, and second unit director David Gelb, who was brought on to recreate the filmmaking style from his Netflix docuseries Chef's Table.
It was announced in April 2019 that Alexander Payne was attached to direct. In December 2019, the screenplay appeared on the annual Black List, a survey showcasing the most popular films still in development. By May 2020, Searchlight Pictures held the distribution rights, and Payne had left the film due to scheduling conflicts, with Mark Mylod replacing Payne as director.
Casting
In April 2019, it was announced that Emma Stone and Ralph Fiennes would star in The Menu.
In June 2021, Anya Taylor-Joy entered negotiations and was confirmed in July to replace Stone, who had left due to commitments to other projects; Hong Chau and Nicholas Hoult joined the cast the same month. John Leguizamo, Janet McTeer, Judith Light, Reed Birney, Rob Yang, and Aimee Carrero joined in September. In October, Paul Adelstein, Arturo Castro, Mark St. Cyr, Rebecca Koon and Peter Grosz were confirmed as parts of the ensemble.
Filming and post-production
Filming began on September 3, 2021, in Savannah, Georgia, with cinematographer Peter Deming and film editor Christopher Tellefsen. Film locations include the Jekyll Island shore.
Colin Stetson composed the musical score, released by Milan Records as The Menu (Original Motion Picture Soundtrack) on November 18, coinciding with the film's release.
Release
The Menu premiered at the Toronto International Film Festival on September 10, 2022, and also made its US premiere at Fantastic Fest that month. It was released November 18, 2022 in the United States in 3,211 theaters, the widest release in Searchlight's history.
The film was released to digital platforms on January 3, 2023, with a Blu-ray and DVD release by Walt Disney Studios Home Entertainment on January 17, 2023.
Reception
Box office
The Menu grossed $38.5 million in the United States and Canada, and $41.1 million in other territories, for a worldwide total of $79.6 million.
In the United States and Canada, The Menu was released alongside She Said, and was projected to gross $7–10 million from 3,100 theaters in its opening weekend. It made $3.6 million on its first day, including $1 million from Wednesday and Thursday night previews. The film went on to debut to $9 million, finishing second behind holdover Black Panther: Wakanda Forever. Over its second weekend, The Menu made $5.5 million (and a total of $7.6 million over the five-day Thanksgiving frame), finishing fifth. During its third weekend, the film made $3.5 million, finishing fourth.
Critical response
Audiences surveyed by CinemaScore gave the film an average grade of "B" on an A+ to F scale, while those polled by PostTrak gave it a 78% positive score, with 53% saying they would definitely recommend it.
Accolades
References
Notes
External links
Official screenplay
2022 black comedy films
2022 comedy horror films
2022 thriller films
2022 films
2020s English-language films
2020s American films
American black comedy films
American comedy horror films
American comedy thriller films
American satirical films
Matricide in fiction
Films about chefs
Films directed by Mark Mylod
Films produced by Adam McKay
Films about food and drink
Films about mass murder
Murder–suicide in films
Films set in restaurants
Films set on islands
Films shot in Savannah, Georgia
Films scored by Colin Stetson
Gary Sanchez Productions films
Searchlight Pictures films
TSG Entertainment films
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.