text stringlengths 1 22.8M |
|---|
Tytsjerksteradiel () is a municipality in the province of Friesland in the Netherlands. It is named after the town of Tytsjerk, whose name is derived from a person named Tiete. Tiete was a daughter of Tryn, after whom the region (Trynwâlden) is named. The other villages in Trynwâlden are also named after Tryn's children: Oentsjerk (Oene), Gytsjerk (Giete), Readtsjerk (Reade), Aldtsjerk (Âlde), Ryptsjerk (Rype). A statue of Tryn and her children is placed in Oentsjerk next to the mainroad (Rengerswei). Tsjerk is the West Frisian word for Church. Until 1989 the official name of the municipality was Tietjerksteradeel (), the Dutch name; the current official name is West Frisian. The largest village in the municipality is Burgum.
Population centers
The administrative centre and largest village in the municipality is Burgum.
Hamlets
Altenburch (Altenburg)
De Joere
Gytsjerksterhoeke (Giekerkerhoek)
Iniaheide
It Heechsân (Hoogzand)
It Wytfean (Witveen)
Kûkherne (Kuikhorne) ((partially))
Noardermar (Noordermeer)
Lytse Geast (Kleinegeest)
Quatrebras
Sânhuzen (Zevenhuizen)
Sigerswâld (Siegerswoude)
Skûlenboarch (Schuilenburg)
Sumarreheide (Suameerderheide)
Swarteweisein (Zwartewegsend)
Tergrêft (Tergraft) ((partially))
Main sights
Wyns, Aldtsjerk, Jistrum, Eastermar, Oentsjerk, Burgum and Gytsjerk are home to medieval churches
The villages Aldtsjerk, Earnewâld, Ryptsjerk, Sumar, Tytsjerk (De Lytse Geast and De Himriksmole) and Wyns are home to mills.
The Burgumer Lake
The Museum for Folklore in Earnewâld
The Skûtsje-Museum in Earnewâld
The Heimatmuseum with an Observatory in Burgum.
Notable people
Adriaen van Cronenburg (ca.1525 – 1604 in Bergum) a Northern Netherlandish painter of portraits
Rombertus van Uylenburgh (1554 in Burgum – 1624) academic and father-in-law of Rembrandt
Jurjentje Aukes Rauwerda (1812 in Oentsjerk – 1877) a Dutch prostitute and procurer. Ran the largest brothel in Amsterdam
Tsjibbe Gearts van der Meulen (1824 in Burgum – 1906) writer, poet, clock-maker, book seller, printer and publisher
Piet Bouman (1892 – 1980 in Tietjerksteradeel) a Dutch amateur football player who competed in the 1912 Summer Olympics
Enneüs Heerma (1944 in Rijperkerk – 1999) a Dutch politician
Henk Stallinga (born 1962 in Tytsjerksteradiel) a Dutch multidisciplinary contemporary artist
Marjon Wijnsma (born 1965 in Giekerk) a retired Dutch heptathlete
Doutzen Kroes (born 1985 in Eastermar) a Dutch model, actress, activist and philanthropist
Gallery
References
External links
Official website
Municipalities of Friesland |
Herald Harbor is a census-designated place and an unincorporated community in Anne Arundel County, Maryland, United States. As of the 2010 census, the population was 2,603. It is a quiet residential area with a scenic view of the Severn River and is near the community of Crownsville and Interstate 97. Herald Harbor is known for its area immediately along the Severn River known as Long Point on the Severn, a fairly affluent neighborhood composed mainly of retired and wealthy land owners.
Geography
Herald Harbor is located at (39.051260, −76.574960).
According to the United States Census Bureau, the CDP has a total area of , of which is land and , or 31.31%, is water, consisting of the tidal Severn River.
The name "Herald Harbor" is originally derived from a Washington, D.C. newspaper, the Washington Herald, which promoted its subscriptions by giving away small plots of land in the area for summer homes.
Demographics
As of the census of 2000, there were 2,313 people, 941 households, and 641 families residing in the CDP. The population density was . There were 1,022 housing units at an average density of . The racial makeup of the CDP was 96.97% White, 0.65% African American, 0.30% Native American, 0.82% Asian, 0.04% Pacific Islander, 0.17% from other races, and 1.04% from two or more races. Hispanic or Latino of any race were 1.25% of the population.
There were 941 households, out of which 28.6% had children under the age of 18 living with them, 58.8% were married couples living together, 6.3% had a female householder with no husband present, and 31.8% were non-families. 22.0% of all households were made up of individuals, and 4.3% had someone living alone who was 65 years of age or older. The average household size was 2.46 and the average family size was 2.90.
In the CDP, the population was spread out, with 21.1% under the age of 18, 6.1% from 18 to 24, 34.5% from 25 to 44, 30.3% from 45 to 64, and 8.0% who were 65 years of age or older. The median age was 39 years. For every 100 females, there were 105.6 males. For every 100 females age 18 and over, there were 101.8 males.
The median income for a household in the CDP was $73,893, and the median income for a family was $83,812. Males had a median income of $55,000 versus $28,684 for females. The per capita income for the CDP was $34,189. About 4.1% of families and 5.9% of the population were below the poverty line, including 10.3% of those under age 18 and none of those age 65 or over.
References
Census-designated places in Maryland
Census-designated places in Anne Arundel County, Maryland |
Arun Bali (23 December 1942 – 7 October 2022) was an Indian actor who has worked in numerous films and television series. He played the part of Maharaj Porus in the 1991 period drama Chanakya, Kunwar Singh in the Doordarshan soap opera Swabhimaan and the Chief Minister of undivided Bengal, Huseyn Shaheed Suhrawardy, in the controversial and critically acclaimed 2000 film Hey Ram. In the 2000s, he became known for his "grandfatherly" roles like that of Harshvardhan Wadhwa in Kumkum – Ek Pyara Sa Bandhan and has even garnered popular awards for the same.
In 2001, the prominent writer, actor and director Lekh Tandon counted Bali amongst his favorite actors.
He died at his home in suburban Mumbai on 7 October 2022, at the age of 79 and was treated for Myasthenia gravis prior to his death.
Filmography
Television
Web Series
Television Movie
Phir Wahi Talash (TV Series) (1989-90)
Dastoor (TV Series) 1996
Dil Dariya (TV Series) (1989)
Dekh Bhai Dekh (1993-1994)... Various characters
Mahabharat Katha (1997) - Chitravahan (Chitrangada's Father)
Zee Horror Show (1 episode – "Raaz", 1994)
Sidhhi (1995)... Guru
Swabhimaan (1995)... Kunwar Singh
Maharath (1996)... Vrahaspati
Aahat (1997)
Chamatkaar (1998)... Fake sage
Amrapali (2002)
Maayka (2007)
Maryada: Lekin Kab Tak? (2010)... Babuji
References
External links
1942 births
2022 deaths
Indian male film actors
Male actors in Hindi cinema
Indian male television actors
Indian male soap opera actors |
Route 92 is a major east–west highway on the island of Oahu which begins at exit 15 off Interstate H-1 (H-1) in Honolulu. The western end of the highway is located at the gate to Joint Base Pearl Harbor–Hickam and the eastern end is east of the Ala Wai Canal crossing in Waikiki. The western portion of the highway, west of Richards Street, is named the Nimitz Highway (in honor Chester Nimitz, the Pacific Fleet Admiral during World War II). East of Richards Street, Route 92 is also known as Ala Moana Boulevard.
History
The route was constructed in the 1940s during World War II to serve military facilities and the local airport. There were plans in the 1960s to extend the road east of the Ala Moana Center mall toward H-1 once again, but those plans were dropped by the late 1970s.
Route description
After exiting H-1, Route 92 goes past the Pearl Harbor Naval Base and Hickam Air Force Base gates. Route 92 goes under the Airport Viaduct (H-1) and serves primary route for Honolulu International Airport. Route 92 briefly runs underneath H-1 before exiting again at exit 18. Heading east, Route 92 enters into the Port of Honolulu and downtown Honolulu. After crossing the Ala Wai Canal to Waikiki, Route 92 ends, and county jurisdiction is transferred at that point.
Major intersections
References
External links
Hawaii Highways – Oahu Route List
0092
Transportation in Honolulu County, Hawaii
Transportation in Honolulu |
Iowa Highway 81 is a state highway that runs from south to north in southeastern Iowa. It begins at the Missouri state line southwest of Farmington, where it continues as Missouri Route 81 and ends at Iowa 2 in Farmington. The route Iowa 81 takes has been in the primary highway system since the 1920s. The current Iowa 81 was created on January 1, 1969, when it traded route numbers with Iowa 114 in the southeast-central part of the state.
Route description
Iowa 81 begins at the Missouri border, where it is a continuation of Missouri Route 81. The highway heads in a northeasterly direction from that point, passing by Indian Lake Park along the way. It ends at Iowa 2 on the west side of Farmington.
History
Prior to its current designation, Iowa 81 was known as Iowa 114. On January 1, 1969, Iowa 114 and Iowa 81 traded route numbers in order to harmonize route numbers with neighboring states, Route 81 in Missouri, in this case. At the time of its designation, the highway was a fully paved road.
Major intersections
References
External links
End of Iowa 81 at Iowa Highway Ends
081 |
```c
/* Perform non-arithmetic operations on values, for GDB.
1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004
Free Software Foundation, Inc.
This file is part of GDB.
This program is free software; you can redistribute it and/or modify
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330,
Boston, MA 02111-1307, USA. */
#include "defs.h"
#include "symtab.h"
#include "gdbtypes.h"
#include "value.h"
#include "frame.h"
#include "inferior.h"
#include "gdbcore.h"
#include "target.h"
#include "demangle.h"
#include "language.h"
#include "gdbcmd.h"
#include "regcache.h"
#include "cp-abi.h"
#include "block.h"
#include "infcall.h"
#include "dictionary.h"
#include "cp-support.h"
#include <errno.h>
#include "gdb_string.h"
#include "gdb_assert.h"
#include "cp-support.h"
#include "observer.h"
extern int overload_debug;
/* Local functions. */
static int typecmp (int staticp, int varargs, int nargs,
struct field t1[], struct value *t2[]);
static struct value *search_struct_field (char *, struct value *, int,
struct type *, int);
static struct value *search_struct_method (char *, struct value **,
struct value **,
int, int *, struct type *);
static int find_oload_champ_namespace (struct type **arg_types, int nargs,
const char *func_name,
const char *qualified_name,
struct symbol ***oload_syms,
struct badness_vector **oload_champ_bv);
static
int find_oload_champ_namespace_loop (struct type **arg_types, int nargs,
const char *func_name,
const char *qualified_name,
int namespace_len,
struct symbol ***oload_syms,
struct badness_vector **oload_champ_bv,
int *oload_champ);
static int find_oload_champ (struct type **arg_types, int nargs, int method,
int num_fns,
struct fn_field *fns_ptr,
struct symbol **oload_syms,
struct badness_vector **oload_champ_bv);
static int oload_method_static (int method, struct fn_field *fns_ptr,
int index);
enum oload_classification { STANDARD, NON_STANDARD, INCOMPATIBLE };
static enum
oload_classification classify_oload_match (struct badness_vector
* oload_champ_bv,
int nargs,
int static_offset);
static int check_field_in (struct type *, const char *);
static struct value *value_struct_elt_for_reference (struct type *domain,
int offset,
struct type *curtype,
char *name,
struct type *intype,
enum noside noside);
static struct value *value_namespace_elt (const struct type *curtype,
char *name,
enum noside noside);
static struct value *value_maybe_namespace_elt (const struct type *curtype,
char *name,
enum noside noside);
static CORE_ADDR allocate_space_in_inferior (int);
static struct value *cast_into_complex (struct type *, struct value *);
static struct fn_field *find_method_list (struct value ** argp, char *method,
int offset,
struct type *type, int *num_fns,
struct type **basetype,
int *boffset);
void _initialize_valops (void);
/* Flag for whether we want to abandon failed expression evals by default. */
#if 0
static int auto_abandon = 0;
#endif
int overload_resolution = 0;
/* Find the address of function name NAME in the inferior. */
struct value *
find_function_in_inferior (const char *name)
{
struct symbol *sym;
struct minimal_symbol *msymbol;
sym = lookup_symbol (name, 0, VAR_DOMAIN, 0, NULL);
if (sym != NULL)
{
if (SYMBOL_CLASS (sym) != LOC_BLOCK)
error (_("\"%s\" exists in this program but is not a function."),
name);
if (TYPE_PROTOTYPED (SYMBOL_TYPE (sym)))
return value_of_variable (sym, NULL);
}
msymbol = lookup_minimal_symbol (name, NULL, NULL);
if (msymbol != NULL)
{
struct type *type;
CORE_ADDR maddr;
type = lookup_pointer_type (builtin_type_char);
type = lookup_function_type (type);
type = lookup_pointer_type (type);
maddr = SYMBOL_VALUE_ADDRESS (msymbol);
return value_from_pointer (type, maddr);
}
if (!target_has_execution)
error ("evaluation of this expression requires the target program to be active");
else
error ("evaluation of this expression requires the program to have a function \"%s\".", name);
}
/* Allocate NBYTES of space in the inferior using the inferior's malloc
and return a value that is a pointer to the allocated space. */
struct value *
value_allocate_space_in_inferior (int len)
{
struct value *blocklen;
struct value *val = find_function_in_inferior (NAME_OF_MALLOC);
blocklen = value_from_longest (builtin_type_int, (LONGEST) len);
val = call_function_by_hand (val, 1, &blocklen);
if (value_logical_not (val))
{
if (!target_has_execution)
error ("No memory available to program now: you need to start the target first");
else
error ("No memory available to program: call to malloc failed");
}
return val;
}
static CORE_ADDR
allocate_space_in_inferior (int len)
{
return value_as_long (value_allocate_space_in_inferior (len));
}
/* Cast value ARG2 to type TYPE and return as a value.
More general than a C cast: accepts any two types of the same length,
and if ARG2 is an lvalue it can be cast into anything at all. */
/* In C++, casts may change pointer or object representations. */
struct value *
value_cast (struct type *type, struct value *arg2)
{
enum type_code code1;
enum type_code code2;
int scalar;
struct type *type2;
int convert_to_boolean = 0;
if (VALUE_TYPE (arg2) == type)
return arg2;
CHECK_TYPEDEF (type);
code1 = TYPE_CODE (type);
COERCE_REF (arg2);
type2 = check_typedef (VALUE_TYPE (arg2));
/* A cast to an undetermined-length array_type, such as (TYPE [])OBJECT,
is treated like a cast to (TYPE [N])OBJECT,
where N is sizeof(OBJECT)/sizeof(TYPE). */
if (code1 == TYPE_CODE_ARRAY)
{
struct type *element_type = TYPE_TARGET_TYPE (type);
unsigned element_length = TYPE_LENGTH (check_typedef (element_type));
if (element_length > 0
&& TYPE_ARRAY_UPPER_BOUND_TYPE (type) == BOUND_CANNOT_BE_DETERMINED)
{
struct type *range_type = TYPE_INDEX_TYPE (type);
int val_length = TYPE_LENGTH (type2);
LONGEST low_bound, high_bound, new_length;
if (get_discrete_bounds (range_type, &low_bound, &high_bound) < 0)
low_bound = 0, high_bound = 0;
new_length = val_length / element_length;
if (val_length % element_length != 0)
warning ("array element type size does not divide object size in cast");
/* FIXME-type-allocation: need a way to free this type when we are
done with it. */
range_type = create_range_type ((struct type *) NULL,
TYPE_TARGET_TYPE (range_type),
low_bound,
new_length + low_bound - 1);
VALUE_TYPE (arg2) = create_array_type ((struct type *) NULL,
element_type, range_type);
return arg2;
}
}
if (current_language->c_style_arrays
&& TYPE_CODE (type2) == TYPE_CODE_ARRAY)
arg2 = value_coerce_array (arg2);
if (TYPE_CODE (type2) == TYPE_CODE_FUNC)
arg2 = value_coerce_function (arg2);
type2 = check_typedef (VALUE_TYPE (arg2));
COERCE_VARYING_ARRAY (arg2, type2);
code2 = TYPE_CODE (type2);
if (code1 == TYPE_CODE_COMPLEX)
return cast_into_complex (type, arg2);
if (code1 == TYPE_CODE_BOOL)
{
code1 = TYPE_CODE_INT;
convert_to_boolean = 1;
}
if (code1 == TYPE_CODE_CHAR)
code1 = TYPE_CODE_INT;
if (code2 == TYPE_CODE_BOOL || code2 == TYPE_CODE_CHAR)
code2 = TYPE_CODE_INT;
scalar = (code2 == TYPE_CODE_INT || code2 == TYPE_CODE_FLT
|| code2 == TYPE_CODE_ENUM || code2 == TYPE_CODE_RANGE);
if (code1 == TYPE_CODE_STRUCT
&& code2 == TYPE_CODE_STRUCT
&& TYPE_NAME (type) != 0)
{
/* Look in the type of the source to see if it contains the
type of the target as a superclass. If so, we'll need to
offset the object in addition to changing its type. */
struct value *v = search_struct_field (type_name_no_tag (type),
arg2, 0, type2, 1);
if (v)
{
VALUE_TYPE (v) = type;
return v;
}
}
if (code1 == TYPE_CODE_FLT && scalar)
return value_from_double (type, value_as_double (arg2));
else if ((code1 == TYPE_CODE_INT || code1 == TYPE_CODE_ENUM
|| code1 == TYPE_CODE_RANGE)
&& (scalar || code2 == TYPE_CODE_PTR))
{
LONGEST longest;
if (deprecated_hp_som_som_object_present /* if target compiled by HP aCC */
&& (code2 == TYPE_CODE_PTR))
{
unsigned int *ptr;
struct value *retvalp;
switch (TYPE_CODE (TYPE_TARGET_TYPE (type2)))
{
/* With HP aCC, pointers to data members have a bias */
case TYPE_CODE_MEMBER:
retvalp = value_from_longest (type, value_as_long (arg2));
/* force evaluation */
ptr = (unsigned int *) VALUE_CONTENTS (retvalp);
*ptr &= ~0x20000000; /* zap 29th bit to remove bias */
return retvalp;
/* While pointers to methods don't really point to a function */
case TYPE_CODE_METHOD:
error ("Pointers to methods not supported with HP aCC");
default:
break; /* fall out and go to normal handling */
}
}
/* When we cast pointers to integers, we mustn't use
POINTER_TO_ADDRESS to find the address the pointer
represents, as value_as_long would. GDB should evaluate
expressions just as the compiler would --- and the compiler
sees a cast as a simple reinterpretation of the pointer's
bits. */
if (code2 == TYPE_CODE_PTR)
longest = extract_unsigned_integer (VALUE_CONTENTS (arg2),
TYPE_LENGTH (type2));
else
longest = value_as_long (arg2);
return value_from_longest (type, convert_to_boolean ?
(LONGEST) (longest ? 1 : 0) : longest);
}
else if (code1 == TYPE_CODE_PTR && (code2 == TYPE_CODE_INT ||
code2 == TYPE_CODE_ENUM ||
code2 == TYPE_CODE_RANGE))
{
/* TYPE_LENGTH (type) is the length of a pointer, but we really
want the length of an address! -- we are really dealing with
addresses (i.e., gdb representations) not pointers (i.e.,
target representations) here.
This allows things like "print *(int *)0x01000234" to work
without printing a misleading message -- which would
otherwise occur when dealing with a target having two byte
pointers and four byte addresses. */
int addr_bit = TARGET_ADDR_BIT;
LONGEST longest = value_as_long (arg2);
if (addr_bit < sizeof (LONGEST) * HOST_CHAR_BIT)
{
if (longest >= ((LONGEST) 1 << addr_bit)
|| longest <= -((LONGEST) 1 << addr_bit))
warning ("value truncated");
}
return value_from_longest (type, longest);
}
else if (TYPE_LENGTH (type) == TYPE_LENGTH (type2))
{
if (code1 == TYPE_CODE_PTR && code2 == TYPE_CODE_PTR)
{
struct type *t1 = check_typedef (TYPE_TARGET_TYPE (type));
struct type *t2 = check_typedef (TYPE_TARGET_TYPE (type2));
if (TYPE_CODE (t1) == TYPE_CODE_STRUCT
&& TYPE_CODE (t2) == TYPE_CODE_STRUCT
&& !value_logical_not (arg2))
{
struct value *v;
/* Look in the type of the source to see if it contains the
type of the target as a superclass. If so, we'll need to
offset the pointer rather than just change its type. */
if (TYPE_NAME (t1) != NULL)
{
v = search_struct_field (type_name_no_tag (t1),
value_ind (arg2), 0, t2, 1);
if (v)
{
v = value_addr (v);
VALUE_TYPE (v) = type;
return v;
}
}
/* Look in the type of the target to see if it contains the
type of the source as a superclass. If so, we'll need to
offset the pointer rather than just change its type.
FIXME: This fails silently with virtual inheritance. */
if (TYPE_NAME (t2) != NULL)
{
v = search_struct_field (type_name_no_tag (t2),
value_zero (t1, not_lval), 0, t1, 1);
if (v)
{
CORE_ADDR addr2 = value_as_address (arg2);
addr2 -= (VALUE_ADDRESS (v)
+ VALUE_OFFSET (v)
+ VALUE_EMBEDDED_OFFSET (v));
return value_from_pointer (type, addr2);
}
}
}
/* No superclass found, just fall through to change ptr type. */
}
VALUE_TYPE (arg2) = type;
arg2 = value_change_enclosing_type (arg2, type);
VALUE_POINTED_TO_OFFSET (arg2) = 0; /* pai: chk_val */
return arg2;
}
else if (VALUE_LVAL (arg2) == lval_memory)
{
return value_at_lazy (type, VALUE_ADDRESS (arg2) + VALUE_OFFSET (arg2),
VALUE_BFD_SECTION (arg2));
}
else if (code1 == TYPE_CODE_VOID)
{
return value_zero (builtin_type_void, not_lval);
}
else
{
error ("Invalid cast.");
return 0;
}
}
/* Create a value of type TYPE that is zero, and return it. */
struct value *
value_zero (struct type *type, enum lval_type lv)
{
struct value *val = allocate_value (type);
memset (VALUE_CONTENTS (val), 0, TYPE_LENGTH (check_typedef (type)));
VALUE_LVAL (val) = lv;
return val;
}
/* Return a value with type TYPE located at ADDR.
Call value_at only if the data needs to be fetched immediately;
if we can be 'lazy' and defer the fetch, perhaps indefinately, call
value_at_lazy instead. value_at_lazy simply records the address of
the data and sets the lazy-evaluation-required flag. The lazy flag
is tested in the VALUE_CONTENTS macro, which is used if and when
the contents are actually required.
Note: value_at does *NOT* handle embedded offsets; perform such
adjustments before or after calling it. */
struct value *
value_at (struct type *type, CORE_ADDR addr, asection *sect)
{
struct value *val;
if (TYPE_CODE (check_typedef (type)) == TYPE_CODE_VOID)
error ("Attempt to dereference a generic pointer.");
val = allocate_value (type);
read_memory (addr, VALUE_CONTENTS_ALL_RAW (val), TYPE_LENGTH (type));
VALUE_LVAL (val) = lval_memory;
VALUE_ADDRESS (val) = addr;
VALUE_BFD_SECTION (val) = sect;
return val;
}
/* Return a lazy value with type TYPE located at ADDR (cf. value_at). */
struct value *
value_at_lazy (struct type *type, CORE_ADDR addr, asection *sect)
{
struct value *val;
if (TYPE_CODE (check_typedef (type)) == TYPE_CODE_VOID)
error ("Attempt to dereference a generic pointer.");
val = allocate_value (type);
VALUE_LVAL (val) = lval_memory;
VALUE_ADDRESS (val) = addr;
VALUE_LAZY (val) = 1;
VALUE_BFD_SECTION (val) = sect;
return val;
}
/* Called only from the VALUE_CONTENTS and VALUE_CONTENTS_ALL macros,
if the current data for a variable needs to be loaded into
VALUE_CONTENTS(VAL). Fetches the data from the user's process, and
clears the lazy flag to indicate that the data in the buffer is valid.
If the value is zero-length, we avoid calling read_memory, which would
abort. We mark the value as fetched anyway -- all 0 bytes of it.
This function returns a value because it is used in the VALUE_CONTENTS
macro as part of an expression, where a void would not work. The
value is ignored. */
int
value_fetch_lazy (struct value *val)
{
CORE_ADDR addr = VALUE_ADDRESS (val) + VALUE_OFFSET (val);
int length = TYPE_LENGTH (VALUE_ENCLOSING_TYPE (val));
struct type *type = VALUE_TYPE (val);
if (length)
read_memory (addr, VALUE_CONTENTS_ALL_RAW (val), length);
VALUE_LAZY (val) = 0;
return 0;
}
/* Store the contents of FROMVAL into the location of TOVAL.
Return a new value with the location of TOVAL and contents of FROMVAL. */
struct value *
value_assign (struct value *toval, struct value *fromval)
{
struct type *type;
struct value *val;
struct frame_id old_frame;
if (!toval->modifiable)
error ("Left operand of assignment is not a modifiable lvalue.");
COERCE_REF (toval);
type = VALUE_TYPE (toval);
if (VALUE_LVAL (toval) != lval_internalvar)
fromval = value_cast (type, fromval);
else
COERCE_ARRAY (fromval);
CHECK_TYPEDEF (type);
/* Since modifying a register can trash the frame chain, and modifying memory
can trash the frame cache, we save the old frame and then restore the new
frame afterwards. */
old_frame = get_frame_id (deprecated_selected_frame);
switch (VALUE_LVAL (toval))
{
case lval_internalvar:
set_internalvar (VALUE_INTERNALVAR (toval), fromval);
val = value_copy (VALUE_INTERNALVAR (toval)->value);
val = value_change_enclosing_type (val, VALUE_ENCLOSING_TYPE (fromval));
VALUE_EMBEDDED_OFFSET (val) = VALUE_EMBEDDED_OFFSET (fromval);
VALUE_POINTED_TO_OFFSET (val) = VALUE_POINTED_TO_OFFSET (fromval);
return val;
case lval_internalvar_component:
set_internalvar_component (VALUE_INTERNALVAR (toval),
VALUE_OFFSET (toval),
VALUE_BITPOS (toval),
VALUE_BITSIZE (toval),
fromval);
break;
case lval_memory:
{
char *dest_buffer;
CORE_ADDR changed_addr;
int changed_len;
char buffer[sizeof (LONGEST)];
if (VALUE_BITSIZE (toval))
{
/* We assume that the argument to read_memory is in units of
host chars. FIXME: Is that correct? */
changed_len = (VALUE_BITPOS (toval)
+ VALUE_BITSIZE (toval)
+ HOST_CHAR_BIT - 1)
/ HOST_CHAR_BIT;
if (changed_len > (int) sizeof (LONGEST))
error ("Can't handle bitfields which don't fit in a %d bit word.",
(int) sizeof (LONGEST) * HOST_CHAR_BIT);
read_memory (VALUE_ADDRESS (toval) + VALUE_OFFSET (toval),
buffer, changed_len);
modify_field (buffer, value_as_long (fromval),
VALUE_BITPOS (toval), VALUE_BITSIZE (toval));
changed_addr = VALUE_ADDRESS (toval) + VALUE_OFFSET (toval);
dest_buffer = buffer;
}
else
{
changed_addr = VALUE_ADDRESS (toval) + VALUE_OFFSET (toval);
changed_len = TYPE_LENGTH (type);
dest_buffer = VALUE_CONTENTS (fromval);
}
write_memory (changed_addr, dest_buffer, changed_len);
if (deprecated_memory_changed_hook)
deprecated_memory_changed_hook (changed_addr, changed_len);
}
break;
case lval_reg_frame_relative:
case lval_register:
{
struct frame_info *frame;
int value_reg;
/* Figure out which frame this is in currently. */
if (VALUE_LVAL (toval) == lval_register)
{
frame = get_current_frame ();
value_reg = VALUE_REGNO (toval);
}
else
{
frame = frame_find_by_id (VALUE_FRAME_ID (toval));
value_reg = VALUE_FRAME_REGNUM (toval);
}
if (!frame)
error ("Value being assigned to is no longer active.");
if (VALUE_LVAL (toval) == lval_reg_frame_relative
&& CONVERT_REGISTER_P (VALUE_FRAME_REGNUM (toval), type))
{
/* If TOVAL is a special machine register requiring
conversion of program values to a special raw format. */
VALUE_TO_REGISTER (frame, VALUE_FRAME_REGNUM (toval),
type, VALUE_CONTENTS (fromval));
}
else
{
/* TOVAL is stored in a series of registers in the frame
specified by the structure. Copy that value out,
modify it, and copy it back in. */
int amount_copied;
int amount_to_copy;
char *buffer;
int reg_offset;
int byte_offset;
int regno;
/* Locate the first register that falls in the value that
needs to be transfered. Compute the offset of the
value in that register. */
{
int offset;
for (reg_offset = value_reg, offset = 0;
offset + register_size (current_gdbarch, reg_offset) <= VALUE_OFFSET (toval);
reg_offset++);
byte_offset = VALUE_OFFSET (toval) - offset;
}
/* Compute the number of register aligned values that need
to be copied. */
if (VALUE_BITSIZE (toval))
amount_to_copy = byte_offset + 1;
else
amount_to_copy = byte_offset + TYPE_LENGTH (type);
/* And a bounce buffer. Be slightly over generous. */
buffer = (char *) alloca (amount_to_copy + MAX_REGISTER_SIZE);
/* Copy it in. */
for (regno = reg_offset, amount_copied = 0;
amount_copied < amount_to_copy;
amount_copied += register_size (current_gdbarch, regno), regno++)
frame_register_read (frame, regno, buffer + amount_copied);
/* Modify what needs to be modified. */
if (VALUE_BITSIZE (toval))
modify_field (buffer + byte_offset,
value_as_long (fromval),
VALUE_BITPOS (toval), VALUE_BITSIZE (toval));
else
memcpy (buffer + byte_offset, VALUE_CONTENTS (fromval),
TYPE_LENGTH (type));
/* Copy it out. */
for (regno = reg_offset, amount_copied = 0;
amount_copied < amount_to_copy;
amount_copied += register_size (current_gdbarch, regno), regno++)
put_frame_register (frame, regno, buffer + amount_copied);
}
if (deprecated_register_changed_hook)
deprecated_register_changed_hook (-1);
observer_notify_target_changed (¤t_target);
break;
}
default:
error ("Left operand of assignment is not an lvalue.");
}
/* Assigning to the stack pointer, frame pointer, and other
(architecture and calling convention specific) registers may
cause the frame cache to be out of date. Assigning to memory
also can. We just do this on all assignments to registers or
memory, for simplicity's sake; I doubt the slowdown matters. */
switch (VALUE_LVAL (toval))
{
case lval_memory:
case lval_register:
case lval_reg_frame_relative:
reinit_frame_cache ();
/* Having destoroyed the frame cache, restore the selected frame. */
/* FIXME: cagney/2002-11-02: There has to be a better way of
doing this. Instead of constantly saving/restoring the
frame. Why not create a get_selected_frame() function that,
having saved the selected frame's ID can automatically
re-find the previously selected frame automatically. */
{
struct frame_info *fi = frame_find_by_id (old_frame);
if (fi != NULL)
select_frame (fi);
}
break;
default:
break;
}
/* If the field does not entirely fill a LONGEST, then zero the sign bits.
If the field is signed, and is negative, then sign extend. */
if ((VALUE_BITSIZE (toval) > 0)
&& (VALUE_BITSIZE (toval) < 8 * (int) sizeof (LONGEST)))
{
LONGEST fieldval = value_as_long (fromval);
LONGEST valmask = (((ULONGEST) 1) << VALUE_BITSIZE (toval)) - 1;
fieldval &= valmask;
if (!TYPE_UNSIGNED (type) && (fieldval & (valmask ^ (valmask >> 1))))
fieldval |= ~valmask;
fromval = value_from_longest (type, fieldval);
}
val = value_copy (toval);
memcpy (VALUE_CONTENTS_RAW (val), VALUE_CONTENTS (fromval),
TYPE_LENGTH (type));
VALUE_TYPE (val) = type;
val = value_change_enclosing_type (val, VALUE_ENCLOSING_TYPE (fromval));
VALUE_EMBEDDED_OFFSET (val) = VALUE_EMBEDDED_OFFSET (fromval);
VALUE_POINTED_TO_OFFSET (val) = VALUE_POINTED_TO_OFFSET (fromval);
return val;
}
/* Extend a value VAL to COUNT repetitions of its type. */
struct value *
value_repeat (struct value *arg1, int count)
{
struct value *val;
if (VALUE_LVAL (arg1) != lval_memory)
error ("Only values in memory can be extended with '@'.");
if (count < 1)
error ("Invalid number %d of repetitions.", count);
val = allocate_repeat_value (VALUE_ENCLOSING_TYPE (arg1), count);
read_memory (VALUE_ADDRESS (arg1) + VALUE_OFFSET (arg1),
VALUE_CONTENTS_ALL_RAW (val),
TYPE_LENGTH (VALUE_ENCLOSING_TYPE (val)));
VALUE_LVAL (val) = lval_memory;
VALUE_ADDRESS (val) = VALUE_ADDRESS (arg1) + VALUE_OFFSET (arg1);
return val;
}
struct value *
value_of_variable (struct symbol *var, struct block *b)
{
struct value *val;
struct frame_info *frame = NULL;
if (!b)
frame = NULL; /* Use selected frame. */
else if (symbol_read_needs_frame (var))
{
frame = block_innermost_frame (b);
if (!frame)
{
if (BLOCK_FUNCTION (b)
&& SYMBOL_PRINT_NAME (BLOCK_FUNCTION (b)))
error ("No frame is currently executing in block %s.",
SYMBOL_PRINT_NAME (BLOCK_FUNCTION (b)));
else
error ("No frame is currently executing in specified block");
}
}
val = read_var_value (var, frame);
if (!val)
error ("Address of symbol \"%s\" is unknown.", SYMBOL_PRINT_NAME (var));
return val;
}
/* Given a value which is an array, return a value which is a pointer to its
first element, regardless of whether or not the array has a nonzero lower
bound.
FIXME: A previous comment here indicated that this routine should be
substracting the array's lower bound. It's not clear to me that this
is correct. Given an array subscripting operation, it would certainly
work to do the adjustment here, essentially computing:
(&array[0] - (lowerbound * sizeof array[0])) + (index * sizeof array[0])
However I believe a more appropriate and logical place to account for
the lower bound is to do so in value_subscript, essentially computing:
(&array[0] + ((index - lowerbound) * sizeof array[0]))
As further evidence consider what would happen with operations other
than array subscripting, where the caller would get back a value that
had an address somewhere before the actual first element of the array,
and the information about the lower bound would be lost because of
the coercion to pointer type.
*/
struct value *
value_coerce_array (struct value *arg1)
{
struct type *type = check_typedef (VALUE_TYPE (arg1));
if (VALUE_LVAL (arg1) != lval_memory)
error ("Attempt to take address of value not located in memory.");
return value_from_pointer (lookup_pointer_type (TYPE_TARGET_TYPE (type)),
(VALUE_ADDRESS (arg1) + VALUE_OFFSET (arg1)));
}
/* Given a value which is a function, return a value which is a pointer
to it. */
struct value *
value_coerce_function (struct value *arg1)
{
struct value *retval;
if (VALUE_LVAL (arg1) != lval_memory)
error ("Attempt to take address of value not located in memory.");
retval = value_from_pointer (lookup_pointer_type (VALUE_TYPE (arg1)),
(VALUE_ADDRESS (arg1) + VALUE_OFFSET (arg1)));
VALUE_BFD_SECTION (retval) = VALUE_BFD_SECTION (arg1);
return retval;
}
/* Return a pointer value for the object for which ARG1 is the contents. */
struct value *
value_addr (struct value *arg1)
{
struct value *arg2;
struct type *type = check_typedef (VALUE_TYPE (arg1));
if (TYPE_CODE (type) == TYPE_CODE_REF)
{
/* Copy the value, but change the type from (T&) to (T*).
We keep the same location information, which is efficient,
and allows &(&X) to get the location containing the reference. */
arg2 = value_copy (arg1);
VALUE_TYPE (arg2) = lookup_pointer_type (TYPE_TARGET_TYPE (type));
return arg2;
}
if (TYPE_CODE (type) == TYPE_CODE_FUNC)
return value_coerce_function (arg1);
if (VALUE_LVAL (arg1) != lval_memory)
error ("Attempt to take address of value not located in memory.");
/* Get target memory address */
arg2 = value_from_pointer (lookup_pointer_type (VALUE_TYPE (arg1)),
(VALUE_ADDRESS (arg1)
+ VALUE_OFFSET (arg1)
+ VALUE_EMBEDDED_OFFSET (arg1)));
/* This may be a pointer to a base subobject; so remember the
full derived object's type ... */
arg2 = value_change_enclosing_type (arg2, lookup_pointer_type (VALUE_ENCLOSING_TYPE (arg1)));
/* ... and also the relative position of the subobject in the full object */
VALUE_POINTED_TO_OFFSET (arg2) = VALUE_EMBEDDED_OFFSET (arg1);
VALUE_BFD_SECTION (arg2) = VALUE_BFD_SECTION (arg1);
return arg2;
}
/* Given a value of a pointer type, apply the C unary * operator to it. */
struct value *
value_ind (struct value *arg1)
{
struct type *base_type;
struct value *arg2;
COERCE_ARRAY (arg1);
base_type = check_typedef (VALUE_TYPE (arg1));
if (TYPE_CODE (base_type) == TYPE_CODE_MEMBER)
error ("not implemented: member types in value_ind");
/* Allow * on an integer so we can cast it to whatever we want.
This returns an int, which seems like the most C-like thing
to do. "long long" variables are rare enough that
BUILTIN_TYPE_LONGEST would seem to be a mistake. */
if (TYPE_CODE (base_type) == TYPE_CODE_INT)
return value_at_lazy (builtin_type_int,
(CORE_ADDR) value_as_long (arg1),
VALUE_BFD_SECTION (arg1));
else if (TYPE_CODE (base_type) == TYPE_CODE_PTR)
{
struct type *enc_type;
/* We may be pointing to something embedded in a larger object */
/* Get the real type of the enclosing object */
enc_type = check_typedef (VALUE_ENCLOSING_TYPE (arg1));
enc_type = TYPE_TARGET_TYPE (enc_type);
/* Retrieve the enclosing object pointed to */
arg2 = value_at_lazy (enc_type,
value_as_address (arg1) - VALUE_POINTED_TO_OFFSET (arg1),
VALUE_BFD_SECTION (arg1));
/* Re-adjust type */
VALUE_TYPE (arg2) = TYPE_TARGET_TYPE (base_type);
/* Add embedding info */
arg2 = value_change_enclosing_type (arg2, enc_type);
VALUE_EMBEDDED_OFFSET (arg2) = VALUE_POINTED_TO_OFFSET (arg1);
/* We may be pointing to an object of some derived type */
arg2 = value_full_object (arg2, NULL, 0, 0, 0);
return arg2;
}
error ("Attempt to take contents of a non-pointer value.");
return 0; /* For lint -- never reached */
}
/* Pushing small parts of stack frames. */
/* Push one word (the size of object that a register holds). */
CORE_ADDR
push_word (CORE_ADDR sp, ULONGEST word)
{
int len = DEPRECATED_REGISTER_SIZE;
char buffer[MAX_REGISTER_SIZE];
store_unsigned_integer (buffer, len, word);
if (INNER_THAN (1, 2))
{
/* stack grows downward */
sp -= len;
write_memory (sp, buffer, len);
}
else
{
/* stack grows upward */
write_memory (sp, buffer, len);
sp += len;
}
return sp;
}
/* Push LEN bytes with data at BUFFER. */
CORE_ADDR
push_bytes (CORE_ADDR sp, char *buffer, int len)
{
if (INNER_THAN (1, 2))
{
/* stack grows downward */
sp -= len;
write_memory (sp, buffer, len);
}
else
{
/* stack grows upward */
write_memory (sp, buffer, len);
sp += len;
}
return sp;
}
/* Create a value for an array by allocating space in the inferior, copying
the data into that space, and then setting up an array value.
The array bounds are set from LOWBOUND and HIGHBOUND, and the array is
populated from the values passed in ELEMVEC.
The element type of the array is inherited from the type of the
first element, and all elements must have the same size (though we
don't currently enforce any restriction on their types). */
struct value *
value_array (int lowbound, int highbound, struct value **elemvec)
{
int nelem;
int idx;
unsigned int typelength;
struct value *val;
struct type *rangetype;
struct type *arraytype;
CORE_ADDR addr;
/* Validate that the bounds are reasonable and that each of the elements
have the same size. */
nelem = highbound - lowbound + 1;
if (nelem <= 0)
{
error ("bad array bounds (%d, %d)", lowbound, highbound);
}
typelength = TYPE_LENGTH (VALUE_ENCLOSING_TYPE (elemvec[0]));
for (idx = 1; idx < nelem; idx++)
{
if (TYPE_LENGTH (VALUE_ENCLOSING_TYPE (elemvec[idx])) != typelength)
{
error ("array elements must all be the same size");
}
}
rangetype = create_range_type ((struct type *) NULL, builtin_type_int,
lowbound, highbound);
arraytype = create_array_type ((struct type *) NULL,
VALUE_ENCLOSING_TYPE (elemvec[0]), rangetype);
if (!current_language->c_style_arrays)
{
val = allocate_value (arraytype);
for (idx = 0; idx < nelem; idx++)
{
memcpy (VALUE_CONTENTS_ALL_RAW (val) + (idx * typelength),
VALUE_CONTENTS_ALL (elemvec[idx]),
typelength);
}
VALUE_BFD_SECTION (val) = VALUE_BFD_SECTION (elemvec[0]);
return val;
}
/* Allocate space to store the array in the inferior, and then initialize
it by copying in each element. FIXME: Is it worth it to create a
local buffer in which to collect each value and then write all the
bytes in one operation? */
addr = allocate_space_in_inferior (nelem * typelength);
for (idx = 0; idx < nelem; idx++)
{
write_memory (addr + (idx * typelength), VALUE_CONTENTS_ALL (elemvec[idx]),
typelength);
}
/* Create the array type and set up an array value to be evaluated lazily. */
val = value_at_lazy (arraytype, addr, VALUE_BFD_SECTION (elemvec[0]));
return (val);
}
/* Create a value for a string constant by allocating space in the inferior,
copying the data into that space, and returning the address with type
TYPE_CODE_STRING. PTR points to the string constant data; LEN is number
of characters.
Note that string types are like array of char types with a lower bound of
zero and an upper bound of LEN - 1. Also note that the string may contain
embedded null bytes. */
struct value *
value_string (char *ptr, int len)
{
struct value *val;
int lowbound = current_language->string_lower_bound;
struct type *rangetype = create_range_type ((struct type *) NULL,
builtin_type_int,
lowbound, len + lowbound - 1);
struct type *stringtype
= create_string_type ((struct type *) NULL, rangetype);
CORE_ADDR addr;
if (current_language->c_style_arrays == 0)
{
val = allocate_value (stringtype);
memcpy (VALUE_CONTENTS_RAW (val), ptr, len);
return val;
}
/* Allocate space to store the string in the inferior, and then
copy LEN bytes from PTR in gdb to that address in the inferior. */
addr = allocate_space_in_inferior (len);
write_memory (addr, ptr, len);
val = value_at_lazy (stringtype, addr, NULL);
return (val);
}
struct value *
value_bitstring (char *ptr, int len)
{
struct value *val;
struct type *domain_type = create_range_type (NULL, builtin_type_int,
0, len - 1);
struct type *type = create_set_type ((struct type *) NULL, domain_type);
TYPE_CODE (type) = TYPE_CODE_BITSTRING;
val = allocate_value (type);
memcpy (VALUE_CONTENTS_RAW (val), ptr, TYPE_LENGTH (type));
return val;
}
/* See if we can pass arguments in T2 to a function which takes arguments
of types T1. T1 is a list of NARGS arguments, and T2 is a NULL-terminated
vector. If some arguments need coercion of some sort, then the coerced
values are written into T2. Return value is 0 if the arguments could be
matched, or the position at which they differ if not.
STATICP is nonzero if the T1 argument list came from a
static member function. T2 will still include the ``this'' pointer,
but it will be skipped.
For non-static member functions, we ignore the first argument,
which is the type of the instance variable. This is because we want
to handle calls with objects from derived classes. This is not
entirely correct: we should actually check to make sure that a
requested operation is type secure, shouldn't we? FIXME. */
static int
typecmp (int staticp, int varargs, int nargs,
struct field t1[], struct value *t2[])
{
int i;
if (t2 == 0)
internal_error (__FILE__, __LINE__, "typecmp: no argument list");
/* Skip ``this'' argument if applicable. T2 will always include THIS. */
if (staticp)
t2 ++;
for (i = 0;
(i < nargs) && TYPE_CODE (t1[i].type) != TYPE_CODE_VOID;
i++)
{
struct type *tt1, *tt2;
if (!t2[i])
return i + 1;
tt1 = check_typedef (t1[i].type);
tt2 = check_typedef (VALUE_TYPE (t2[i]));
if (TYPE_CODE (tt1) == TYPE_CODE_REF
/* We should be doing hairy argument matching, as below. */
&& (TYPE_CODE (check_typedef (TYPE_TARGET_TYPE (tt1))) == TYPE_CODE (tt2)))
{
if (TYPE_CODE (tt2) == TYPE_CODE_ARRAY)
t2[i] = value_coerce_array (t2[i]);
else
t2[i] = value_addr (t2[i]);
continue;
}
/* djb - 20000715 - Until the new type structure is in the
place, and we can attempt things like implicit conversions,
we need to do this so you can take something like a map<const
char *>, and properly access map["hello"], because the
argument to [] will be a reference to a pointer to a char,
and the argument will be a pointer to a char. */
while ( TYPE_CODE(tt1) == TYPE_CODE_REF ||
TYPE_CODE (tt1) == TYPE_CODE_PTR)
{
tt1 = check_typedef( TYPE_TARGET_TYPE(tt1) );
}
while ( TYPE_CODE(tt2) == TYPE_CODE_ARRAY ||
TYPE_CODE(tt2) == TYPE_CODE_PTR ||
TYPE_CODE(tt2) == TYPE_CODE_REF)
{
tt2 = check_typedef( TYPE_TARGET_TYPE(tt2) );
}
if (TYPE_CODE (tt1) == TYPE_CODE (tt2))
continue;
/* Array to pointer is a `trivial conversion' according to the ARM. */
/* We should be doing much hairier argument matching (see section 13.2
of the ARM), but as a quick kludge, just check for the same type
code. */
if (TYPE_CODE (t1[i].type) != TYPE_CODE (VALUE_TYPE (t2[i])))
return i + 1;
}
if (varargs || t2[i] == NULL)
return 0;
return i + 1;
}
/* Helper function used by value_struct_elt to recurse through baseclasses.
Look for a field NAME in ARG1. Adjust the address of ARG1 by OFFSET bytes,
and search in it assuming it has (class) type TYPE.
If found, return value, else return NULL.
If LOOKING_FOR_BASECLASS, then instead of looking for struct fields,
look for a baseclass named NAME. */
static struct value *
search_struct_field (char *name, struct value *arg1, int offset,
struct type *type, int looking_for_baseclass)
{
int i;
int nbases = TYPE_N_BASECLASSES (type);
CHECK_TYPEDEF (type);
if (!looking_for_baseclass)
for (i = TYPE_NFIELDS (type) - 1; i >= nbases; i--)
{
char *t_field_name = TYPE_FIELD_NAME (type, i);
if (t_field_name && (strcmp_iw (t_field_name, name) == 0))
{
struct value *v;
if (TYPE_FIELD_STATIC (type, i))
{
v = value_static_field (type, i);
if (v == 0)
error ("field %s is nonexistent or has been optimised out",
name);
}
else
{
v = value_primitive_field (arg1, offset, i, type);
if (v == 0)
error ("there is no field named %s", name);
}
return v;
}
if (t_field_name
&& (t_field_name[0] == '\0'
|| (TYPE_CODE (type) == TYPE_CODE_UNION
&& (strcmp_iw (t_field_name, "else") == 0))))
{
struct type *field_type = TYPE_FIELD_TYPE (type, i);
if (TYPE_CODE (field_type) == TYPE_CODE_UNION
|| TYPE_CODE (field_type) == TYPE_CODE_STRUCT)
{
/* Look for a match through the fields of an anonymous union,
or anonymous struct. C++ provides anonymous unions.
In the GNU Chill (now deleted from GDB)
implementation of variant record types, each
<alternative field> has an (anonymous) union type,
each member of the union represents a <variant
alternative>. Each <variant alternative> is
represented as a struct, with a member for each
<variant field>. */
struct value *v;
int new_offset = offset;
/* This is pretty gross. In G++, the offset in an
anonymous union is relative to the beginning of the
enclosing struct. In the GNU Chill (now deleted
from GDB) implementation of variant records, the
bitpos is zero in an anonymous union field, so we
have to add the offset of the union here. */
if (TYPE_CODE (field_type) == TYPE_CODE_STRUCT
|| (TYPE_NFIELDS (field_type) > 0
&& TYPE_FIELD_BITPOS (field_type, 0) == 0))
new_offset += TYPE_FIELD_BITPOS (type, i) / 8;
v = search_struct_field (name, arg1, new_offset, field_type,
looking_for_baseclass);
if (v)
return v;
}
}
}
for (i = 0; i < nbases; i++)
{
struct value *v;
struct type *basetype = check_typedef (TYPE_BASECLASS (type, i));
/* If we are looking for baseclasses, this is what we get when we
hit them. But it could happen that the base part's member name
is not yet filled in. */
int found_baseclass = (looking_for_baseclass
&& TYPE_BASECLASS_NAME (type, i) != NULL
&& (strcmp_iw (name, TYPE_BASECLASS_NAME (type, i)) == 0));
if (BASETYPE_VIA_VIRTUAL (type, i))
{
int boffset;
struct value *v2 = allocate_value (basetype);
boffset = baseclass_offset (type, i,
VALUE_CONTENTS (arg1) + offset,
VALUE_ADDRESS (arg1)
+ VALUE_OFFSET (arg1) + offset);
if (boffset == -1)
error ("virtual baseclass botch");
/* The virtual base class pointer might have been clobbered by the
user program. Make sure that it still points to a valid memory
location. */
boffset += offset;
if (boffset < 0 || boffset >= TYPE_LENGTH (type))
{
CORE_ADDR base_addr;
base_addr = VALUE_ADDRESS (arg1) + VALUE_OFFSET (arg1) + boffset;
if (target_read_memory (base_addr, VALUE_CONTENTS_RAW (v2),
TYPE_LENGTH (basetype)) != 0)
error ("virtual baseclass botch");
VALUE_LVAL (v2) = lval_memory;
VALUE_ADDRESS (v2) = base_addr;
}
else
{
VALUE_LVAL (v2) = VALUE_LVAL (arg1);
VALUE_ADDRESS (v2) = VALUE_ADDRESS (arg1);
VALUE_OFFSET (v2) = VALUE_OFFSET (arg1) + boffset;
if (VALUE_LAZY (arg1))
VALUE_LAZY (v2) = 1;
else
memcpy (VALUE_CONTENTS_RAW (v2),
VALUE_CONTENTS_RAW (arg1) + boffset,
TYPE_LENGTH (basetype));
}
if (found_baseclass)
return v2;
v = search_struct_field (name, v2, 0, TYPE_BASECLASS (type, i),
looking_for_baseclass);
}
else if (found_baseclass)
v = value_primitive_field (arg1, offset, i, type);
else
v = search_struct_field (name, arg1,
offset + TYPE_BASECLASS_BITPOS (type, i) / 8,
basetype, looking_for_baseclass);
if (v)
return v;
}
return NULL;
}
/* Return the offset (in bytes) of the virtual base of type BASETYPE
* in an object pointed to by VALADDR (on the host), assumed to be of
* type TYPE. OFFSET is number of bytes beyond start of ARG to start
* looking (in case VALADDR is the contents of an enclosing object).
*
* This routine recurses on the primary base of the derived class because
* the virtual base entries of the primary base appear before the other
* virtual base entries.
*
* If the virtual base is not found, a negative integer is returned.
* The magnitude of the negative integer is the number of entries in
* the virtual table to skip over (entries corresponding to various
* ancestral classes in the chain of primary bases).
*
* Important: This assumes the HP / Taligent C++ runtime
* conventions. Use baseclass_offset() instead to deal with g++
* conventions. */
void
find_rt_vbase_offset (struct type *type, struct type *basetype, char *valaddr,
int offset, int *boffset_p, int *skip_p)
{
int boffset; /* offset of virtual base */
int index; /* displacement to use in virtual table */
int skip;
struct value *vp;
CORE_ADDR vtbl; /* the virtual table pointer */
struct type *pbc; /* the primary base class */
/* Look for the virtual base recursively in the primary base, first.
* This is because the derived class object and its primary base
* subobject share the primary virtual table. */
boffset = 0;
pbc = TYPE_PRIMARY_BASE (type);
if (pbc)
{
find_rt_vbase_offset (pbc, basetype, valaddr, offset, &boffset, &skip);
if (skip < 0)
{
*boffset_p = boffset;
*skip_p = -1;
return;
}
}
else
skip = 0;
/* Find the index of the virtual base according to HP/Taligent
runtime spec. (Depth-first, left-to-right.) */
index = virtual_base_index_skip_primaries (basetype, type);
if (index < 0)
{
*skip_p = skip + virtual_base_list_length_skip_primaries (type);
*boffset_p = 0;
return;
}
/* pai: FIXME -- 32x64 possible problem */
/* First word (4 bytes) in object layout is the vtable pointer */
vtbl = *(CORE_ADDR *) (valaddr + offset);
/* Before the constructor is invoked, things are usually zero'd out. */
if (vtbl == 0)
error ("Couldn't find virtual table -- object may not be constructed yet.");
/* Find virtual base's offset -- jump over entries for primary base
* ancestors, then use the index computed above. But also adjust by
* HP_ACC_VBASE_START for the vtable slots before the start of the
* virtual base entries. Offset is negative -- virtual base entries
* appear _before_ the address point of the virtual table. */
/* pai: FIXME -- 32x64 problem, if word = 8 bytes, change multiplier
& use long type */
/* epstein : FIXME -- added param for overlay section. May not be correct */
vp = value_at (builtin_type_int, vtbl + 4 * (-skip - index - HP_ACC_VBASE_START), NULL);
boffset = value_as_long (vp);
*skip_p = -1;
*boffset_p = boffset;
return;
}
/* Helper function used by value_struct_elt to recurse through baseclasses.
Look for a field NAME in ARG1. Adjust the address of ARG1 by OFFSET bytes,
and search in it assuming it has (class) type TYPE.
If found, return value, else if name matched and args not return (value)-1,
else return NULL. */
static struct value *
search_struct_method (char *name, struct value **arg1p,
struct value **args, int offset,
int *static_memfuncp, struct type *type)
{
int i;
struct value *v;
int name_matched = 0;
char dem_opname[64];
CHECK_TYPEDEF (type);
for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; i--)
{
char *t_field_name = TYPE_FN_FIELDLIST_NAME (type, i);
/* FIXME! May need to check for ARM demangling here */
if (strncmp (t_field_name, "__", 2) == 0 ||
strncmp (t_field_name, "op", 2) == 0 ||
strncmp (t_field_name, "type", 4) == 0)
{
if (cplus_demangle_opname (t_field_name, dem_opname, DMGL_ANSI))
t_field_name = dem_opname;
else if (cplus_demangle_opname (t_field_name, dem_opname, 0))
t_field_name = dem_opname;
}
if (t_field_name && (strcmp_iw (t_field_name, name) == 0))
{
int j = TYPE_FN_FIELDLIST_LENGTH (type, i) - 1;
struct fn_field *f = TYPE_FN_FIELDLIST1 (type, i);
name_matched = 1;
check_stub_method_group (type, i);
if (j > 0 && args == 0)
error ("cannot resolve overloaded method `%s': no arguments supplied", name);
else if (j == 0 && args == 0)
{
v = value_fn_field (arg1p, f, j, type, offset);
if (v != NULL)
return v;
}
else
while (j >= 0)
{
if (!typecmp (TYPE_FN_FIELD_STATIC_P (f, j),
TYPE_VARARGS (TYPE_FN_FIELD_TYPE (f, j)),
TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (f, j)),
TYPE_FN_FIELD_ARGS (f, j), args))
{
if (TYPE_FN_FIELD_VIRTUAL_P (f, j))
return value_virtual_fn_field (arg1p, f, j, type, offset);
if (TYPE_FN_FIELD_STATIC_P (f, j) && static_memfuncp)
*static_memfuncp = 1;
v = value_fn_field (arg1p, f, j, type, offset);
if (v != NULL)
return v;
}
j--;
}
}
}
for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--)
{
int base_offset;
if (BASETYPE_VIA_VIRTUAL (type, i))
{
if (TYPE_HAS_VTABLE (type))
{
/* HP aCC compiled type, search for virtual base offset
according to HP/Taligent runtime spec. */
int skip;
find_rt_vbase_offset (type, TYPE_BASECLASS (type, i),
VALUE_CONTENTS_ALL (*arg1p),
offset + VALUE_EMBEDDED_OFFSET (*arg1p),
&base_offset, &skip);
if (skip >= 0)
error ("Virtual base class offset not found in vtable");
}
else
{
struct type *baseclass = check_typedef (TYPE_BASECLASS (type, i));
char *base_valaddr;
/* The virtual base class pointer might have been clobbered by the
user program. Make sure that it still points to a valid memory
location. */
if (offset < 0 || offset >= TYPE_LENGTH (type))
{
base_valaddr = (char *) alloca (TYPE_LENGTH (baseclass));
if (target_read_memory (VALUE_ADDRESS (*arg1p)
+ VALUE_OFFSET (*arg1p) + offset,
base_valaddr,
TYPE_LENGTH (baseclass)) != 0)
error ("virtual baseclass botch");
}
else
base_valaddr = VALUE_CONTENTS (*arg1p) + offset;
base_offset =
baseclass_offset (type, i, base_valaddr,
VALUE_ADDRESS (*arg1p)
+ VALUE_OFFSET (*arg1p) + offset);
if (base_offset == -1)
error ("virtual baseclass botch");
}
}
else
{
base_offset = TYPE_BASECLASS_BITPOS (type, i) / 8;
}
v = search_struct_method (name, arg1p, args, base_offset + offset,
static_memfuncp, TYPE_BASECLASS (type, i));
if (v == (struct value *) - 1)
{
name_matched = 1;
}
else if (v)
{
/* FIXME-bothner: Why is this commented out? Why is it here? */
/* *arg1p = arg1_tmp; */
return v;
}
}
if (name_matched)
return (struct value *) - 1;
else
return NULL;
}
/* Given *ARGP, a value of type (pointer to a)* structure/union,
extract the component named NAME from the ultimate target structure/union
and return it as a value with its appropriate type.
ERR is used in the error message if *ARGP's type is wrong.
C++: ARGS is a list of argument types to aid in the selection of
an appropriate method. Also, handle derived types.
STATIC_MEMFUNCP, if non-NULL, points to a caller-supplied location
where the truthvalue of whether the function that was resolved was
a static member function or not is stored.
ERR is an error message to be printed in case the field is not found. */
struct value *
value_struct_elt (struct value **argp, struct value **args,
char *name, int *static_memfuncp, char *err)
{
struct type *t;
struct value *v;
COERCE_ARRAY (*argp);
t = check_typedef (VALUE_TYPE (*argp));
/* Follow pointers until we get to a non-pointer. */
while (TYPE_CODE (t) == TYPE_CODE_PTR || TYPE_CODE (t) == TYPE_CODE_REF)
{
*argp = value_ind (*argp);
/* Don't coerce fn pointer to fn and then back again! */
if (TYPE_CODE (VALUE_TYPE (*argp)) != TYPE_CODE_FUNC)
COERCE_ARRAY (*argp);
t = check_typedef (VALUE_TYPE (*argp));
}
if (TYPE_CODE (t) == TYPE_CODE_MEMBER)
error ("not implemented: member type in value_struct_elt");
if (TYPE_CODE (t) != TYPE_CODE_STRUCT
&& TYPE_CODE (t) != TYPE_CODE_UNION)
error ("Attempt to extract a component of a value that is not a %s.", err);
/* Assume it's not, unless we see that it is. */
if (static_memfuncp)
*static_memfuncp = 0;
if (!args)
{
/* if there are no arguments ...do this... */
/* Try as a field first, because if we succeed, there
is less work to be done. */
v = search_struct_field (name, *argp, 0, t, 0);
if (v)
return v;
/* C++: If it was not found as a data field, then try to
return it as a pointer to a method. */
if (destructor_name_p (name, t))
error ("Cannot get value of destructor");
v = search_struct_method (name, argp, args, 0, static_memfuncp, t);
if (v == (struct value *) - 1)
error ("Cannot take address of a method");
else if (v == 0)
{
if (TYPE_NFN_FIELDS (t))
error ("There is no member or method named %s.", name);
else
error ("There is no member named %s.", name);
}
return v;
}
if (destructor_name_p (name, t))
{
if (!args[1])
{
/* Destructors are a special case. */
int m_index, f_index;
v = NULL;
if (get_destructor_fn_field (t, &m_index, &f_index))
{
v = value_fn_field (NULL, TYPE_FN_FIELDLIST1 (t, m_index),
f_index, NULL, 0);
}
if (v == NULL)
error ("could not find destructor function named %s.", name);
else
return v;
}
else
{
error ("destructor should not have any argument");
}
}
else
v = search_struct_method (name, argp, args, 0, static_memfuncp, t);
if (v == (struct value *) - 1)
{
error ("One of the arguments you tried to pass to %s could not be converted to what the function wants.", name);
}
else if (v == 0)
{
/* See if user tried to invoke data as function. If so,
hand it back. If it's not callable (i.e., a pointer to function),
gdb should give an error. */
v = search_struct_field (name, *argp, 0, t, 0);
}
if (!v)
error ("Structure has no component named %s.", name);
return v;
}
/* Search through the methods of an object (and its bases)
* to find a specified method. Return the pointer to the
* fn_field list of overloaded instances.
* Helper function for value_find_oload_list.
* ARGP is a pointer to a pointer to a value (the object)
* METHOD is a string containing the method name
* OFFSET is the offset within the value
* TYPE is the assumed type of the object
* NUM_FNS is the number of overloaded instances
* BASETYPE is set to the actual type of the subobject where the method is found
* BOFFSET is the offset of the base subobject where the method is found */
static struct fn_field *
find_method_list (struct value **argp, char *method, int offset,
struct type *type, int *num_fns,
struct type **basetype, int *boffset)
{
int i;
struct fn_field *f;
CHECK_TYPEDEF (type);
*num_fns = 0;
/* First check in object itself */
for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; i--)
{
/* pai: FIXME What about operators and type conversions? */
char *fn_field_name = TYPE_FN_FIELDLIST_NAME (type, i);
if (fn_field_name && (strcmp_iw (fn_field_name, method) == 0))
{
int len = TYPE_FN_FIELDLIST_LENGTH (type, i);
struct fn_field *f = TYPE_FN_FIELDLIST1 (type, i);
*num_fns = len;
*basetype = type;
*boffset = offset;
/* Resolve any stub methods. */
check_stub_method_group (type, i);
return f;
}
}
/* Not found in object, check in base subobjects */
for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--)
{
int base_offset;
if (BASETYPE_VIA_VIRTUAL (type, i))
{
if (TYPE_HAS_VTABLE (type))
{
/* HP aCC compiled type, search for virtual base offset
* according to HP/Taligent runtime spec. */
int skip;
find_rt_vbase_offset (type, TYPE_BASECLASS (type, i),
VALUE_CONTENTS_ALL (*argp),
offset + VALUE_EMBEDDED_OFFSET (*argp),
&base_offset, &skip);
if (skip >= 0)
error ("Virtual base class offset not found in vtable");
}
else
{
/* probably g++ runtime model */
base_offset = VALUE_OFFSET (*argp) + offset;
base_offset =
baseclass_offset (type, i,
VALUE_CONTENTS (*argp) + base_offset,
VALUE_ADDRESS (*argp) + base_offset);
if (base_offset == -1)
error ("virtual baseclass botch");
}
}
else
/* non-virtual base, simply use bit position from debug info */
{
base_offset = TYPE_BASECLASS_BITPOS (type, i) / 8;
}
f = find_method_list (argp, method, base_offset + offset,
TYPE_BASECLASS (type, i), num_fns, basetype,
boffset);
if (f)
return f;
}
return NULL;
}
/* Return the list of overloaded methods of a specified name.
* ARGP is a pointer to a pointer to a value (the object)
* METHOD is the method name
* OFFSET is the offset within the value contents
* NUM_FNS is the number of overloaded instances
* BASETYPE is set to the type of the base subobject that defines the method
* BOFFSET is the offset of the base subobject which defines the method */
struct fn_field *
value_find_oload_method_list (struct value **argp, char *method, int offset,
int *num_fns, struct type **basetype,
int *boffset)
{
struct type *t;
t = check_typedef (VALUE_TYPE (*argp));
/* code snarfed from value_struct_elt */
while (TYPE_CODE (t) == TYPE_CODE_PTR || TYPE_CODE (t) == TYPE_CODE_REF)
{
*argp = value_ind (*argp);
/* Don't coerce fn pointer to fn and then back again! */
if (TYPE_CODE (VALUE_TYPE (*argp)) != TYPE_CODE_FUNC)
COERCE_ARRAY (*argp);
t = check_typedef (VALUE_TYPE (*argp));
}
if (TYPE_CODE (t) == TYPE_CODE_MEMBER)
error ("Not implemented: member type in value_find_oload_lis");
if (TYPE_CODE (t) != TYPE_CODE_STRUCT
&& TYPE_CODE (t) != TYPE_CODE_UNION)
error ("Attempt to extract a component of a value that is not a struct or union");
return find_method_list (argp, method, 0, t, num_fns, basetype, boffset);
}
/* Given an array of argument types (ARGTYPES) (which includes an
entry for "this" in the case of C++ methods), the number of
arguments NARGS, the NAME of a function whether it's a method or
not (METHOD), and the degree of laxness (LAX) in conforming to
overload resolution rules in ANSI C++, find the best function that
matches on the argument types according to the overload resolution
rules.
In the case of class methods, the parameter OBJ is an object value
in which to search for overloaded methods.
In the case of non-method functions, the parameter FSYM is a symbol
corresponding to one of the overloaded functions.
Return value is an integer: 0 -> good match, 10 -> debugger applied
non-standard coercions, 100 -> incompatible.
If a method is being searched for, VALP will hold the value.
If a non-method is being searched for, SYMP will hold the symbol for it.
If a method is being searched for, and it is a static method,
then STATICP will point to a non-zero value.
Note: This function does *not* check the value of
overload_resolution. Caller must check it to see whether overload
resolution is permitted.
*/
int
find_overload_match (struct type **arg_types, int nargs, char *name, int method,
int lax, struct value **objp, struct symbol *fsym,
struct value **valp, struct symbol **symp, int *staticp)
{
struct value *obj = (objp ? *objp : NULL);
int oload_champ; /* Index of best overloaded function */
struct badness_vector *oload_champ_bv = NULL; /* The measure for the current best match */
struct value *temp = obj;
struct fn_field *fns_ptr = NULL; /* For methods, the list of overloaded methods */
struct symbol **oload_syms = NULL; /* For non-methods, the list of overloaded function symbols */
int num_fns = 0; /* Number of overloaded instances being considered */
struct type *basetype = NULL;
int boffset;
int ix;
int static_offset;
struct cleanup *old_cleanups = NULL;
const char *obj_type_name = NULL;
char *func_name = NULL;
enum oload_classification match_quality;
/* Get the list of overloaded methods or functions */
if (method)
{
obj_type_name = TYPE_NAME (VALUE_TYPE (obj));
/* Hack: evaluate_subexp_standard often passes in a pointer
value rather than the object itself, so try again */
if ((!obj_type_name || !*obj_type_name) &&
(TYPE_CODE (VALUE_TYPE (obj)) == TYPE_CODE_PTR))
obj_type_name = TYPE_NAME (TYPE_TARGET_TYPE (VALUE_TYPE (obj)));
fns_ptr = value_find_oload_method_list (&temp, name, 0,
&num_fns,
&basetype, &boffset);
if (!fns_ptr || !num_fns)
error ("Couldn't find method %s%s%s",
obj_type_name,
(obj_type_name && *obj_type_name) ? "::" : "",
name);
/* If we are dealing with stub method types, they should have
been resolved by find_method_list via value_find_oload_method_list
above. */
gdb_assert (TYPE_DOMAIN_TYPE (fns_ptr[0].type) != NULL);
oload_champ = find_oload_champ (arg_types, nargs, method, num_fns,
fns_ptr, oload_syms, &oload_champ_bv);
}
else
{
const char *qualified_name = SYMBOL_CPLUS_DEMANGLED_NAME (fsym);
func_name = cp_func_name (qualified_name);
/* If the name is NULL this must be a C-style function.
Just return the same symbol. */
if (func_name == NULL)
{
*symp = fsym;
return 0;
}
old_cleanups = make_cleanup (xfree, func_name);
make_cleanup (xfree, oload_syms);
make_cleanup (xfree, oload_champ_bv);
oload_champ = find_oload_champ_namespace (arg_types, nargs,
func_name,
qualified_name,
&oload_syms,
&oload_champ_bv);
}
/* Check how bad the best match is. */
match_quality
= classify_oload_match (oload_champ_bv, nargs,
oload_method_static (method, fns_ptr,
oload_champ));
if (match_quality == INCOMPATIBLE)
{
if (method)
error ("Cannot resolve method %s%s%s to any overloaded instance",
obj_type_name,
(obj_type_name && *obj_type_name) ? "::" : "",
name);
else
error ("Cannot resolve function %s to any overloaded instance",
func_name);
}
else if (match_quality == NON_STANDARD)
{
if (method)
warning ("Using non-standard conversion to match method %s%s%s to supplied arguments",
obj_type_name,
(obj_type_name && *obj_type_name) ? "::" : "",
name);
else
warning ("Using non-standard conversion to match function %s to supplied arguments",
func_name);
}
if (method)
{
if (staticp != NULL)
*staticp = oload_method_static (method, fns_ptr, oload_champ);
if (TYPE_FN_FIELD_VIRTUAL_P (fns_ptr, oload_champ))
*valp = value_virtual_fn_field (&temp, fns_ptr, oload_champ, basetype, boffset);
else
*valp = value_fn_field (&temp, fns_ptr, oload_champ, basetype, boffset);
}
else
{
*symp = oload_syms[oload_champ];
}
if (objp)
{
if (TYPE_CODE (VALUE_TYPE (temp)) != TYPE_CODE_PTR
&& TYPE_CODE (VALUE_TYPE (*objp)) == TYPE_CODE_PTR)
{
temp = value_addr (temp);
}
*objp = temp;
}
if (old_cleanups != NULL)
do_cleanups (old_cleanups);
switch (match_quality)
{
case INCOMPATIBLE:
return 100;
case NON_STANDARD:
return 10;
default: /* STANDARD */
return 0;
}
}
/* Find the best overload match, searching for FUNC_NAME in namespaces
contained in QUALIFIED_NAME until it either finds a good match or
runs out of namespaces. It stores the overloaded functions in
*OLOAD_SYMS, and the badness vector in *OLOAD_CHAMP_BV. The
calling function is responsible for freeing *OLOAD_SYMS and
*OLOAD_CHAMP_BV. */
static int
find_oload_champ_namespace (struct type **arg_types, int nargs,
const char *func_name,
const char *qualified_name,
struct symbol ***oload_syms,
struct badness_vector **oload_champ_bv)
{
int oload_champ;
find_oload_champ_namespace_loop (arg_types, nargs,
func_name,
qualified_name, 0,
oload_syms, oload_champ_bv,
&oload_champ);
return oload_champ;
}
/* Helper function for find_oload_champ_namespace; NAMESPACE_LEN is
how deep we've looked for namespaces, and the champ is stored in
OLOAD_CHAMP. The return value is 1 if the champ is a good one, 0
if it isn't.
It is the caller's responsibility to free *OLOAD_SYMS and
*OLOAD_CHAMP_BV. */
static int
find_oload_champ_namespace_loop (struct type **arg_types, int nargs,
const char *func_name,
const char *qualified_name,
int namespace_len,
struct symbol ***oload_syms,
struct badness_vector **oload_champ_bv,
int *oload_champ)
{
int next_namespace_len = namespace_len;
int searched_deeper = 0;
int num_fns = 0;
struct cleanup *old_cleanups;
int new_oload_champ;
struct symbol **new_oload_syms;
struct badness_vector *new_oload_champ_bv;
char *new_namespace;
if (next_namespace_len != 0)
{
gdb_assert (qualified_name[next_namespace_len] == ':');
next_namespace_len += 2;
}
next_namespace_len
+= cp_find_first_component (qualified_name + next_namespace_len);
/* Initialize these to values that can safely be xfree'd. */
*oload_syms = NULL;
*oload_champ_bv = NULL;
/* First, see if we have a deeper namespace we can search in. If we
get a good match there, use it. */
if (qualified_name[next_namespace_len] == ':')
{
searched_deeper = 1;
if (find_oload_champ_namespace_loop (arg_types, nargs,
func_name, qualified_name,
next_namespace_len,
oload_syms, oload_champ_bv,
oload_champ))
{
return 1;
}
};
/* If we reach here, either we're in the deepest namespace or we
didn't find a good match in a deeper namespace. But, in the
latter case, we still have a bad match in a deeper namespace;
note that we might not find any match at all in the current
namespace. (There's always a match in the deepest namespace,
because this overload mechanism only gets called if there's a
function symbol to start off with.) */
old_cleanups = make_cleanup (xfree, *oload_syms);
old_cleanups = make_cleanup (xfree, *oload_champ_bv);
new_namespace = alloca (namespace_len + 1);
strncpy (new_namespace, qualified_name, namespace_len);
new_namespace[namespace_len] = '\0';
new_oload_syms = make_symbol_overload_list (func_name,
new_namespace);
while (new_oload_syms[num_fns])
++num_fns;
new_oload_champ = find_oload_champ (arg_types, nargs, 0, num_fns,
NULL, new_oload_syms,
&new_oload_champ_bv);
/* Case 1: We found a good match. Free earlier matches (if any),
and return it. Case 2: We didn't find a good match, but we're
not the deepest function. Then go with the bad match that the
deeper function found. Case 3: We found a bad match, and we're
the deepest function. Then return what we found, even though
it's a bad match. */
if (new_oload_champ != -1
&& classify_oload_match (new_oload_champ_bv, nargs, 0) == STANDARD)
{
*oload_syms = new_oload_syms;
*oload_champ = new_oload_champ;
*oload_champ_bv = new_oload_champ_bv;
do_cleanups (old_cleanups);
return 1;
}
else if (searched_deeper)
{
xfree (new_oload_syms);
xfree (new_oload_champ_bv);
discard_cleanups (old_cleanups);
return 0;
}
else
{
gdb_assert (new_oload_champ != -1);
*oload_syms = new_oload_syms;
*oload_champ = new_oload_champ;
*oload_champ_bv = new_oload_champ_bv;
discard_cleanups (old_cleanups);
return 0;
}
}
/* Look for a function to take NARGS args of types ARG_TYPES. Find
the best match from among the overloaded methods or functions
(depending on METHOD) given by FNS_PTR or OLOAD_SYMS, respectively.
The number of methods/functions in the list is given by NUM_FNS.
Return the index of the best match; store an indication of the
quality of the match in OLOAD_CHAMP_BV.
It is the caller's responsibility to free *OLOAD_CHAMP_BV. */
static int
find_oload_champ (struct type **arg_types, int nargs, int method,
int num_fns, struct fn_field *fns_ptr,
struct symbol **oload_syms,
struct badness_vector **oload_champ_bv)
{
int ix;
struct badness_vector *bv; /* A measure of how good an overloaded instance is */
int oload_champ = -1; /* Index of best overloaded function */
int oload_ambiguous = 0; /* Current ambiguity state for overload resolution */
/* 0 => no ambiguity, 1 => two good funcs, 2 => incomparable funcs */
*oload_champ_bv = NULL;
/* Consider each candidate in turn */
for (ix = 0; ix < num_fns; ix++)
{
int jj;
int static_offset = oload_method_static (method, fns_ptr, ix);
int nparms;
struct type **parm_types;
if (method)
{
nparms = TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (fns_ptr, ix));
}
else
{
/* If it's not a method, this is the proper place */
nparms=TYPE_NFIELDS(SYMBOL_TYPE(oload_syms[ix]));
}
/* Prepare array of parameter types */
parm_types = (struct type **) xmalloc (nparms * (sizeof (struct type *)));
for (jj = 0; jj < nparms; jj++)
parm_types[jj] = (method
? (TYPE_FN_FIELD_ARGS (fns_ptr, ix)[jj].type)
: TYPE_FIELD_TYPE (SYMBOL_TYPE (oload_syms[ix]), jj));
/* Compare parameter types to supplied argument types. Skip THIS for
static methods. */
bv = rank_function (parm_types, nparms, arg_types + static_offset,
nargs - static_offset);
if (!*oload_champ_bv)
{
*oload_champ_bv = bv;
oload_champ = 0;
}
else
/* See whether current candidate is better or worse than previous best */
switch (compare_badness (bv, *oload_champ_bv))
{
case 0:
oload_ambiguous = 1; /* top two contenders are equally good */
break;
case 1:
oload_ambiguous = 2; /* incomparable top contenders */
break;
case 2:
*oload_champ_bv = bv; /* new champion, record details */
oload_ambiguous = 0;
oload_champ = ix;
break;
case 3:
default:
break;
}
xfree (parm_types);
if (overload_debug)
{
if (method)
fprintf_filtered (gdb_stderr,"Overloaded method instance %s, # of parms %d\n", fns_ptr[ix].physname, nparms);
else
fprintf_filtered (gdb_stderr,"Overloaded function instance %s # of parms %d\n", SYMBOL_DEMANGLED_NAME (oload_syms[ix]), nparms);
for (jj = 0; jj < nargs - static_offset; jj++)
fprintf_filtered (gdb_stderr,"...Badness @ %d : %d\n", jj, bv->rank[jj]);
fprintf_filtered (gdb_stderr,"Overload resolution champion is %d, ambiguous? %d\n", oload_champ, oload_ambiguous);
}
}
return oload_champ;
}
/* Return 1 if we're looking at a static method, 0 if we're looking at
a non-static method or a function that isn't a method. */
static int
oload_method_static (int method, struct fn_field *fns_ptr, int index)
{
if (method && TYPE_FN_FIELD_STATIC_P (fns_ptr, index))
return 1;
else
return 0;
}
/* Check how good an overload match OLOAD_CHAMP_BV represents. */
static enum oload_classification
classify_oload_match (struct badness_vector *oload_champ_bv,
int nargs,
int static_offset)
{
int ix;
for (ix = 1; ix <= nargs - static_offset; ix++)
{
if (oload_champ_bv->rank[ix] >= 100)
return INCOMPATIBLE; /* truly mismatched types */
else if (oload_champ_bv->rank[ix] >= 10)
return NON_STANDARD; /* non-standard type conversions needed */
}
return STANDARD; /* Only standard conversions needed. */
}
/* C++: return 1 is NAME is a legitimate name for the destructor
of type TYPE. If TYPE does not have a destructor, or
if NAME is inappropriate for TYPE, an error is signaled. */
int
destructor_name_p (const char *name, const struct type *type)
{
/* destructors are a special case. */
if (name[0] == '~')
{
char *dname = type_name_no_tag (type);
char *cp = strchr (dname, '<');
unsigned int len;
/* Do not compare the template part for template classes. */
if (cp == NULL)
len = strlen (dname);
else
len = cp - dname;
if (strlen (name + 1) != len || strncmp (dname, name + 1, len) != 0)
error ("name of destructor must equal name of class");
else
return 1;
}
return 0;
}
/* Helper function for check_field: Given TYPE, a structure/union,
return 1 if the component named NAME from the ultimate
target structure/union is defined, otherwise, return 0. */
static int
check_field_in (struct type *type, const char *name)
{
int i;
for (i = TYPE_NFIELDS (type) - 1; i >= TYPE_N_BASECLASSES (type); i--)
{
char *t_field_name = TYPE_FIELD_NAME (type, i);
if (t_field_name && (strcmp_iw (t_field_name, name) == 0))
return 1;
}
/* C++: If it was not found as a data field, then try to
return it as a pointer to a method. */
/* Destructors are a special case. */
if (destructor_name_p (name, type))
{
int m_index, f_index;
return get_destructor_fn_field (type, &m_index, &f_index);
}
for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; --i)
{
if (strcmp_iw (TYPE_FN_FIELDLIST_NAME (type, i), name) == 0)
return 1;
}
for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--)
if (check_field_in (TYPE_BASECLASS (type, i), name))
return 1;
return 0;
}
/* C++: Given ARG1, a value of type (pointer to a)* structure/union,
return 1 if the component named NAME from the ultimate
target structure/union is defined, otherwise, return 0. */
int
check_field (struct value *arg1, const char *name)
{
struct type *t;
COERCE_ARRAY (arg1);
t = VALUE_TYPE (arg1);
/* Follow pointers until we get to a non-pointer. */
for (;;)
{
CHECK_TYPEDEF (t);
if (TYPE_CODE (t) != TYPE_CODE_PTR && TYPE_CODE (t) != TYPE_CODE_REF)
break;
t = TYPE_TARGET_TYPE (t);
}
if (TYPE_CODE (t) == TYPE_CODE_MEMBER)
error ("not implemented: member type in check_field");
if (TYPE_CODE (t) != TYPE_CODE_STRUCT
&& TYPE_CODE (t) != TYPE_CODE_UNION)
error ("Internal error: `this' is not an aggregate");
return check_field_in (t, name);
}
/* C++: Given an aggregate type CURTYPE, and a member name NAME,
return the appropriate member. This function is used to resolve
user expressions of the form "DOMAIN::NAME". For more details on
what happens, see the comment before
value_struct_elt_for_reference. */
struct value *
value_aggregate_elt (struct type *curtype,
char *name,
enum noside noside)
{
switch (TYPE_CODE (curtype))
{
case TYPE_CODE_STRUCT:
case TYPE_CODE_UNION:
return value_struct_elt_for_reference (curtype, 0, curtype, name, NULL,
noside);
case TYPE_CODE_NAMESPACE:
return value_namespace_elt (curtype, name, noside);
default:
internal_error (__FILE__, __LINE__,
"non-aggregate type in value_aggregate_elt");
}
}
/* C++: Given an aggregate type CURTYPE, and a member name NAME,
return the address of this member as a "pointer to member"
type. If INTYPE is non-null, then it will be the type
of the member we are looking for. This will help us resolve
"pointers to member functions". This function is used
to resolve user expressions of the form "DOMAIN::NAME". */
static struct value *
value_struct_elt_for_reference (struct type *domain, int offset,
struct type *curtype, char *name,
struct type *intype,
enum noside noside)
{
struct type *t = curtype;
int i;
struct value *v;
if (TYPE_CODE (t) != TYPE_CODE_STRUCT
&& TYPE_CODE (t) != TYPE_CODE_UNION)
error ("Internal error: non-aggregate type to value_struct_elt_for_reference");
for (i = TYPE_NFIELDS (t) - 1; i >= TYPE_N_BASECLASSES (t); i--)
{
char *t_field_name = TYPE_FIELD_NAME (t, i);
if (t_field_name && strcmp (t_field_name, name) == 0)
{
if (TYPE_FIELD_STATIC (t, i))
{
v = value_static_field (t, i);
if (v == NULL)
error ("static field %s has been optimized out",
name);
return v;
}
if (TYPE_FIELD_PACKED (t, i))
error ("pointers to bitfield members not allowed");
return value_from_longest
(lookup_reference_type (lookup_member_type (TYPE_FIELD_TYPE (t, i),
domain)),
offset + (LONGEST) (TYPE_FIELD_BITPOS (t, i) >> 3));
}
}
/* C++: If it was not found as a data field, then try to
return it as a pointer to a method. */
/* Destructors are a special case. */
if (destructor_name_p (name, t))
{
error ("member pointers to destructors not implemented yet");
}
/* Perform all necessary dereferencing. */
while (intype && TYPE_CODE (intype) == TYPE_CODE_PTR)
intype = TYPE_TARGET_TYPE (intype);
for (i = TYPE_NFN_FIELDS (t) - 1; i >= 0; --i)
{
char *t_field_name = TYPE_FN_FIELDLIST_NAME (t, i);
char dem_opname[64];
if (strncmp (t_field_name, "__", 2) == 0 ||
strncmp (t_field_name, "op", 2) == 0 ||
strncmp (t_field_name, "type", 4) == 0)
{
if (cplus_demangle_opname (t_field_name, dem_opname, DMGL_ANSI))
t_field_name = dem_opname;
else if (cplus_demangle_opname (t_field_name, dem_opname, 0))
t_field_name = dem_opname;
}
if (t_field_name && strcmp (t_field_name, name) == 0)
{
int j = TYPE_FN_FIELDLIST_LENGTH (t, i);
struct fn_field *f = TYPE_FN_FIELDLIST1 (t, i);
check_stub_method_group (t, i);
if (intype == 0 && j > 1)
error ("non-unique member `%s' requires type instantiation", name);
if (intype)
{
while (j--)
if (TYPE_FN_FIELD_TYPE (f, j) == intype)
break;
if (j < 0)
error ("no member function matches that type instantiation");
}
else
j = 0;
if (TYPE_FN_FIELD_VIRTUAL_P (f, j))
{
return value_from_longest
(lookup_reference_type
(lookup_member_type (TYPE_FN_FIELD_TYPE (f, j),
domain)),
(LONGEST) METHOD_PTR_FROM_VOFFSET (TYPE_FN_FIELD_VOFFSET (f, j)));
}
else
{
struct symbol *s = lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f, j),
0, VAR_DOMAIN, 0, NULL);
if (s == NULL)
{
v = 0;
}
else
{
v = read_var_value (s, 0);
#if 0
VALUE_TYPE (v) = lookup_reference_type
(lookup_member_type (TYPE_FN_FIELD_TYPE (f, j),
domain));
#endif
}
return v;
}
}
}
for (i = TYPE_N_BASECLASSES (t) - 1; i >= 0; i--)
{
struct value *v;
int base_offset;
if (BASETYPE_VIA_VIRTUAL (t, i))
base_offset = 0;
else
base_offset = TYPE_BASECLASS_BITPOS (t, i) / 8;
v = value_struct_elt_for_reference (domain,
offset + base_offset,
TYPE_BASECLASS (t, i),
name,
intype,
noside);
if (v)
return v;
}
/* As a last chance, pretend that CURTYPE is a namespace, and look
it up that way; this (frequently) works for types nested inside
classes. */
return value_maybe_namespace_elt (curtype, name, noside);
}
/* C++: Return the member NAME of the namespace given by the type
CURTYPE. */
static struct value *
value_namespace_elt (const struct type *curtype,
char *name,
enum noside noside)
{
struct value *retval = value_maybe_namespace_elt (curtype, name,
noside);
if (retval == NULL)
error ("No symbol \"%s\" in namespace \"%s\".", name,
TYPE_TAG_NAME (curtype));
return retval;
}
/* A helper function used by value_namespace_elt and
value_struct_elt_for_reference. It looks up NAME inside the
context CURTYPE; this works if CURTYPE is a namespace or if CURTYPE
is a class and NAME refers to a type in CURTYPE itself (as opposed
to, say, some base class of CURTYPE). */
static struct value *
value_maybe_namespace_elt (const struct type *curtype,
char *name,
enum noside noside)
{
const char *namespace_name = TYPE_TAG_NAME (curtype);
struct symbol *sym;
sym = cp_lookup_symbol_namespace (namespace_name, name, NULL,
get_selected_block (0), VAR_DOMAIN,
NULL);
if (sym == NULL)
return NULL;
else if ((noside == EVAL_AVOID_SIDE_EFFECTS)
&& (SYMBOL_CLASS (sym) == LOC_TYPEDEF))
return allocate_value (SYMBOL_TYPE (sym));
else
return value_of_variable (sym, get_selected_block (0));
}
/* Given a pointer value V, find the real (RTTI) type
of the object it points to.
Other parameters FULL, TOP, USING_ENC as with value_rtti_type()
and refer to the values computed for the object pointed to. */
struct type *
value_rtti_target_type (struct value *v, int *full, int *top, int *using_enc)
{
struct value *target;
target = value_ind (v);
return value_rtti_type (target, full, top, using_enc);
}
/* Given a value pointed to by ARGP, check its real run-time type, and
if that is different from the enclosing type, create a new value
using the real run-time type as the enclosing type (and of the same
type as ARGP) and return it, with the embedded offset adjusted to
be the correct offset to the enclosed object
RTYPE is the type, and XFULL, XTOP, and XUSING_ENC are the other
parameters, computed by value_rtti_type(). If these are available,
they can be supplied and a second call to value_rtti_type() is avoided.
(Pass RTYPE == NULL if they're not available */
struct value *
value_full_object (struct value *argp, struct type *rtype, int xfull, int xtop,
int xusing_enc)
{
struct type *real_type;
int full = 0;
int top = -1;
int using_enc = 0;
struct value *new_val;
if (rtype)
{
real_type = rtype;
full = xfull;
top = xtop;
using_enc = xusing_enc;
}
else
real_type = value_rtti_type (argp, &full, &top, &using_enc);
/* If no RTTI data, or if object is already complete, do nothing */
if (!real_type || real_type == VALUE_ENCLOSING_TYPE (argp))
return argp;
/* If we have the full object, but for some reason the enclosing
type is wrong, set it *//* pai: FIXME -- sounds iffy */
if (full)
{
argp = value_change_enclosing_type (argp, real_type);
return argp;
}
/* Check if object is in memory */
if (VALUE_LVAL (argp) != lval_memory)
{
warning ("Couldn't retrieve complete object of RTTI type %s; object may be in register(s).", TYPE_NAME (real_type));
return argp;
}
/* All other cases -- retrieve the complete object */
/* Go back by the computed top_offset from the beginning of the object,
adjusting for the embedded offset of argp if that's what value_rtti_type
used for its computation. */
new_val = value_at_lazy (real_type, VALUE_ADDRESS (argp) - top +
(using_enc ? 0 : VALUE_EMBEDDED_OFFSET (argp)),
VALUE_BFD_SECTION (argp));
VALUE_TYPE (new_val) = VALUE_TYPE (argp);
VALUE_EMBEDDED_OFFSET (new_val) = using_enc ? top + VALUE_EMBEDDED_OFFSET (argp) : top;
return new_val;
}
/* Return the value of the local variable, if one exists.
Flag COMPLAIN signals an error if the request is made in an
inappropriate context. */
struct value *
value_of_local (const char *name, int complain)
{
struct symbol *func, *sym;
struct block *b;
struct value * ret;
if (deprecated_selected_frame == 0)
{
if (complain)
error ("no frame selected");
else
return 0;
}
func = get_frame_function (deprecated_selected_frame);
if (!func)
{
if (complain)
error ("no `%s' in nameless context", name);
else
return 0;
}
b = SYMBOL_BLOCK_VALUE (func);
if (dict_empty (BLOCK_DICT (b)))
{
if (complain)
error ("no args, no `%s'", name);
else
return 0;
}
/* Calling lookup_block_symbol is necessary to get the LOC_REGISTER
symbol instead of the LOC_ARG one (if both exist). */
sym = lookup_block_symbol (b, name, NULL, VAR_DOMAIN);
if (sym == NULL)
{
if (complain)
error ("current stack frame does not contain a variable named `%s'", name);
else
return NULL;
}
ret = read_var_value (sym, deprecated_selected_frame);
if (ret == 0 && complain)
error ("`%s' argument unreadable", name);
return ret;
}
/* C++/Objective-C: return the value of the class instance variable,
if one exists. Flag COMPLAIN signals an error if the request is
made in an inappropriate context. */
struct value *
value_of_this (int complain)
{
if (current_language->la_language == language_objc)
return value_of_local ("self", complain);
else
return value_of_local ("this", complain);
}
/* Create a slice (sub-string, sub-array) of ARRAY, that is LENGTH elements
long, starting at LOWBOUND. The result has the same lower bound as
the original ARRAY. */
struct value *
value_slice (struct value *array, int lowbound, int length)
{
struct type *slice_range_type, *slice_type, *range_type;
LONGEST lowerbound, upperbound;
struct value *slice;
struct type *array_type;
array_type = check_typedef (VALUE_TYPE (array));
COERCE_VARYING_ARRAY (array, array_type);
if (TYPE_CODE (array_type) != TYPE_CODE_ARRAY
&& TYPE_CODE (array_type) != TYPE_CODE_STRING
&& TYPE_CODE (array_type) != TYPE_CODE_BITSTRING)
error ("cannot take slice of non-array");
range_type = TYPE_INDEX_TYPE (array_type);
if (get_discrete_bounds (range_type, &lowerbound, &upperbound) < 0)
error ("slice from bad array or bitstring");
if (lowbound < lowerbound || length < 0
|| lowbound + length - 1 > upperbound)
error ("slice out of range");
/* FIXME-type-allocation: need a way to free this type when we are
done with it. */
slice_range_type = create_range_type ((struct type *) NULL,
TYPE_TARGET_TYPE (range_type),
lowbound, lowbound + length - 1);
if (TYPE_CODE (array_type) == TYPE_CODE_BITSTRING)
{
int i;
slice_type = create_set_type ((struct type *) NULL, slice_range_type);
TYPE_CODE (slice_type) = TYPE_CODE_BITSTRING;
slice = value_zero (slice_type, not_lval);
for (i = 0; i < length; i++)
{
int element = value_bit_index (array_type,
VALUE_CONTENTS (array),
lowbound + i);
if (element < 0)
error ("internal error accessing bitstring");
else if (element > 0)
{
int j = i % TARGET_CHAR_BIT;
if (BITS_BIG_ENDIAN)
j = TARGET_CHAR_BIT - 1 - j;
VALUE_CONTENTS_RAW (slice)[i / TARGET_CHAR_BIT] |= (1 << j);
}
}
/* We should set the address, bitssize, and bitspos, so the clice
can be used on the LHS, but that may require extensions to
value_assign. For now, just leave as a non_lval. FIXME. */
}
else
{
struct type *element_type = TYPE_TARGET_TYPE (array_type);
LONGEST offset
= (lowbound - lowerbound) * TYPE_LENGTH (check_typedef (element_type));
slice_type = create_array_type ((struct type *) NULL, element_type,
slice_range_type);
TYPE_CODE (slice_type) = TYPE_CODE (array_type);
slice = allocate_value (slice_type);
if (VALUE_LAZY (array))
VALUE_LAZY (slice) = 1;
else
memcpy (VALUE_CONTENTS (slice), VALUE_CONTENTS (array) + offset,
TYPE_LENGTH (slice_type));
if (VALUE_LVAL (array) == lval_internalvar)
VALUE_LVAL (slice) = lval_internalvar_component;
else
VALUE_LVAL (slice) = VALUE_LVAL (array);
VALUE_ADDRESS (slice) = VALUE_ADDRESS (array);
VALUE_OFFSET (slice) = VALUE_OFFSET (array) + offset;
}
return slice;
}
/* Create a value for a FORTRAN complex number. Currently most of
the time values are coerced to COMPLEX*16 (i.e. a complex number
composed of 2 doubles. This really should be a smarter routine
that figures out precision inteligently as opposed to assuming
doubles. FIXME: fmb */
struct value *
value_literal_complex (struct value *arg1, struct value *arg2, struct type *type)
{
struct value *val;
struct type *real_type = TYPE_TARGET_TYPE (type);
val = allocate_value (type);
arg1 = value_cast (real_type, arg1);
arg2 = value_cast (real_type, arg2);
memcpy (VALUE_CONTENTS_RAW (val),
VALUE_CONTENTS (arg1), TYPE_LENGTH (real_type));
memcpy (VALUE_CONTENTS_RAW (val) + TYPE_LENGTH (real_type),
VALUE_CONTENTS (arg2), TYPE_LENGTH (real_type));
return val;
}
/* Cast a value into the appropriate complex data type. */
static struct value *
cast_into_complex (struct type *type, struct value *val)
{
struct type *real_type = TYPE_TARGET_TYPE (type);
if (TYPE_CODE (VALUE_TYPE (val)) == TYPE_CODE_COMPLEX)
{
struct type *val_real_type = TYPE_TARGET_TYPE (VALUE_TYPE (val));
struct value *re_val = allocate_value (val_real_type);
struct value *im_val = allocate_value (val_real_type);
memcpy (VALUE_CONTENTS_RAW (re_val),
VALUE_CONTENTS (val), TYPE_LENGTH (val_real_type));
memcpy (VALUE_CONTENTS_RAW (im_val),
VALUE_CONTENTS (val) + TYPE_LENGTH (val_real_type),
TYPE_LENGTH (val_real_type));
return value_literal_complex (re_val, im_val, type);
}
else if (TYPE_CODE (VALUE_TYPE (val)) == TYPE_CODE_FLT
|| TYPE_CODE (VALUE_TYPE (val)) == TYPE_CODE_INT)
return value_literal_complex (val, value_zero (real_type, not_lval), type);
else
error ("cannot cast non-number to complex");
}
void
_initialize_valops (void)
{
#if 0
deprecated_add_show_from_set
(add_set_cmd ("abandon", class_support, var_boolean, (char *) &auto_abandon,
"Set automatic abandonment of expressions upon failure.",
&setlist),
&showlist);
#endif
deprecated_add_show_from_set
(add_set_cmd ("overload-resolution", class_support, var_boolean, (char *) &overload_resolution,
"Set overload resolution in evaluating C++ functions.",
&setlist),
&showlist);
overload_resolution = 1;
}
``` |
```ruby
# code is released under a tri EPL/GPL/LGPL license. You can use it,
# redistribute it and/or modify it under the terms of the:
#
require 'socket'
server = TCPServer.new('127.0.0.1', 0)
loop do
socket = server.accept
begin
request = "Hello, World from TruffleRuby! #{socket.gets}"
socket.print "HTTP/1.1 200 OK\r\n" +
"Content-Type: text/plain\r\n" +
"Content-Length: #{request.bytesize}\r\n" +
"Connection: close\r\n\r\n"
socket.print request
socket.print "\n"
ensure
socket.close
end
end
``` |
```objective-c
//===- ReduceInstructions.h -------------------------------------*- C++ -*-===//
//
// See path_to_url for license information.
//
//===your_sha256_hash------===//
//
// This file implements a function which calls the Generic Delta pass in order
// to reduce uninteresting Arguments from defined functions.
//
//===your_sha256_hash------===//
#ifndef LLVM_TOOLS_LLVM_REDUCE_DELTAS_REDUCEINSTRUCTIONS_H
#define LLVM_TOOLS_LLVM_REDUCE_DELTAS_REDUCEINSTRUCTIONS_H
#include "Delta.h"
#include "llvm/Transforms/Utils/BasicBlockUtils.h"
#include "llvm/Transforms/Utils/Cloning.h"
namespace llvm {
void reduceInstructionsDeltaPass(TestRunner &Test);
} // namespace llvm
#endif
``` |
Pseudimalmus fasciatus is a species of beetle in the family Cerambycidae, and the only species in the genus Pseudimalmus. It was described by Hintz in 1919.
References
Tragocephalini
Beetles described in 1919 |
```rust
mod shared;
pub use shared::*;
mod locale;
pub use locale::*;
``` |
The Udmurts (, ) are a Permian (Finnic) ethnic group in Eastern Europe, who speak the Udmurt language. During the course of the Russian Empire, Udmurts have been referred to mainly as (), Otyaks, Wotyaks or Votyaks, all being exonyms. Today such exonyms are considered offensive by Udmurts themselves and are mainly used against those who have forgotten Udmurt language. They are close to Komis to their north both linguistically and culturally.
Etymology
The name Udmurt comes from * 'meadow people,' where the first part represents the Permic root * 'meadow, glade, turf, greenery', and the second part, murt means 'person' (cf. Komi , Mari ), probably an early borrowing from an Iranian language (such as Scythian): * or * 'person, man' (cf. Persian ), which is thought to have been borrowed from the Indo-Aryan term * 'man', literally 'mortal, one who is bound to die' (< PIE 'to die'), compare Old Indic 'young warrior' and Old Indic 'chariot warrior', both connected specifically with horses and chariots. This is supported by a document dated 1557, in which the Udmurts are referred to as lugovye lyudi 'meadow people', alongside the traditional Russian name .
On the other hand, in the Russian tradition, the name 'meadow people' refers to the inhabitants of the left bank of river in general. Recently, the most relevant is the version of V. V. Napolskikh and S. K. Belykh. They suppose that ethnonym was borrowed from the Iranian entirely: 'resident of outskirts, border zone' (cf. Antes) → Proto-Permic * → Udmurt .
Distribution
Most Udmurt people live in Udmurtia. Small groups live in the neighboring areas of Kirov Oblast and Perm Krai, Bashkortostan, Tatarstan, and Mari El.
The Udmurt population is shrinking; the Russian Census reported 552,299 in 2010, down from the 2002 Russian census figure of 637,000, in turn down from 746,562 in 1989.
The 2021 census counted fewer Udmurts than had the 1926 census.
Culture
The Udmurt language belongs to the Uralic family.
The Udmurts have a national epic called Dorvyzhy. Their national musical instruments include the krez zither (similar to the Russian gusli) and a pipe-like wind instrument called the .
A chapter in the French from 1776 is devoted to the description of the Wotyak people.
James George Frazer also mentions a rite performed by the people in his book The Golden Bough.
Many Udmurt people have red hair, and a festival to celebrate the red-haired people has been held annually in Izhevsk since 2004.
The Udmurts used to be semi-nomadic forest dwellers that lived in riverside communities. However, most Udmurts now live in towns. Although the clan-based social structure of the Udmurts no longer exists, its traces are still strong and it continues to shape modern Udmurt culture.
See also
Besermyan (considered a subgroup of the Udmurts)
References
Further reading
. "Сто сказок удмуртского народа" [A hundred fairy tales from the Udmurt people]. Ижевск: Удмуртское книжное издательство, 1961.
. "III. Forschungsberichte: Die Volkserzählungen der Wotjaken (Udmurten) (Mit Beiträgen von Walter Anderson)". In: Fabula 5, no. Jahresband (1962): 101-155. https://doi.org/10.1515/fabl.1962.5.1.101
Shushakova, Galina. "The Idea of Earthly and Unearthly worlds in the Udmurt fairy-tales". In: Folk Belief Today. Edited by Mare Kõiva and Kai Vassiljeva. Tartu: Estonian Academy of Sciences; Institute of Estonian Language; Estonian Museum of Literature, 1995. pp. 442-446. .
External links
Udmurtology—, a site devoted to the Udmurt language and online resources.
Udmurt language Wikipedia
Permians
Ethnic groups in Russia
History of Ural
History of Udmurtia
Indigenous peoples of Europe
Indigenous peoples of Russia
People from Udmurtia |
```lua
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
with this program; if not, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
]]
local lang_fastmapping = require 'factories.language.fastmapping_factory'
local object_generator = require 'language.object_generator'
local factory = require 'levels.contributed.fast_mapping.factories.fast_mapping_factory'
local game = require 'dmlab.system.game'
local lcm = require 'language.make'
local maze_generation = require 'dmlab.system.maze_generation'
local object_generator = require 'language.object_generator'
local placers = require 'language.placers'
local random = require 'common.random'
local selectors = require 'language.selectors'
local texter = require 'language.texter'
local ALL_ATTRIBUTES = {
shape = factory.EVAL_SHAPES,
pattern = {'solid'},
color = {"red"},
size = {"medium"},
}
local CONFOUNDER_SHAPES = {}
for i = 1, #factory.EVAL_SHAPES do
CONFOUNDER_SHAPES[i] = 'runcible' .. i
end
local OBJECT_COUNT = 2
local DISTRACTOR_OBJECT_COUNT = 1
local GOAL_REWARD = 10
local LEARNING_REWARD = 0
local EPISODE_LENGTH_SECONDS = 60
local fastMap = lang_fastmapping.buildMap(OBJECT_COUNT, DISTRACTOR_OBJECT_COUNT)
local fastTask = factory.createTask{
confoundNames = true,
confounderShapes = CONFOUNDER_SHAPES,
episodeLengthSeconds = EPISODE_LENGTH_SECONDS,
distractorObjectCount = DISTRACTOR_OBJECT_COUNT,
goalShapes = factory.EVAL_SHAPES,
objectCount = OBJECT_COUNT,
goalReward = GOAL_REWARD,
learningReward = LEARNING_REWARD,
}
return factory.createLevelApi{
episodeLengthSeconds = 60,
instructor = factory.defaultInstructor,
levelMapSelector = selectors.createIdentity(fastMap),
objectContext = object_generator.createContext{attributes = ALL_ATTRIBUTES},
taskSelector = selectors.createDiscreteDistribution({{10, fastTask}}),
}
``` |
```objective-c
#pragma once
#include <cassert>
#include <stdexcept> // for std::logic_error
#include <string>
#include <type_traits>
#include <vector>
#include <functional>
#include <iosfwd>
#include <base/defines.h>
#include <base/types.h>
#include <base/unaligned.h>
#include <base/simd.h>
#include <fmt/core.h>
#include <fmt/ostream.h>
#include <city.h>
#if defined(__SSE2__)
#include <emmintrin.h>
#endif
#if defined(__SSE4_2__)
#include <smmintrin.h>
#include <nmmintrin.h>
#define CRC_INT _mm_crc32_u64
#endif
#if defined(__aarch64__) && defined(__ARM_FEATURE_CRC32)
#include <arm_acle.h>
#define CRC_INT __crc32cd
#endif
#if defined(__aarch64__) && defined(__ARM_NEON)
#include <arm_neon.h>
#pragma clang diagnostic ignored "-Wreserved-identifier"
#endif
#if defined(__s390x__)
#include <base/crc32c_s390x.h>
#define CRC_INT s390x_crc32c
#endif
/**
* The std::string_view-like container to avoid creating strings to find substrings in the hash table.
*/
struct StringRef
{
const char * data = nullptr;
size_t size = 0;
/// Non-constexpr due to reinterpret_cast.
template <typename CharT>
requires (sizeof(CharT) == 1)
StringRef(const CharT * data_, size_t size_) : data(reinterpret_cast<const char *>(data_)), size(size_)
{
/// Sanity check for overflowed values.
assert(size < 0x8000000000000000ULL);
}
constexpr StringRef(const char * data_, size_t size_) : data(data_), size(size_) {}
StringRef(const std::string & s) : data(s.data()), size(s.size()) {} /// NOLINT
constexpr explicit StringRef(std::string_view s) : data(s.data()), size(s.size()) {}
constexpr StringRef(const char * data_) : StringRef(std::string_view{data_}) {} /// NOLINT
constexpr StringRef() = default;
bool empty() const { return size == 0; }
std::string toString() const { return std::string(data, size); }
explicit operator std::string() const { return toString(); }
std::string_view toView() const { return std::string_view(data, size); }
constexpr explicit operator std::string_view() const { return std::string_view(data, size); }
};
using StringRefs = std::vector<StringRef>;
#if defined(__SSE2__)
/** Compare strings for equality.
* The approach is controversial and does not win in all cases.
* For more information, see hash_map_string_2.cpp
*/
inline bool compare8(const char * p1, const char * p2)
{
return 0xFFFF == _mm_movemask_epi8(_mm_cmpeq_epi8(
_mm_loadu_si128(reinterpret_cast<const __m128i *>(p1)),
_mm_loadu_si128(reinterpret_cast<const __m128i *>(p2))));
}
inline bool compare64(const char * p1, const char * p2)
{
return 0xFFFF == _mm_movemask_epi8(
_mm_and_si128(
_mm_and_si128(
_mm_cmpeq_epi8(
_mm_loadu_si128(reinterpret_cast<const __m128i *>(p1)),
_mm_loadu_si128(reinterpret_cast<const __m128i *>(p2))),
_mm_cmpeq_epi8(
_mm_loadu_si128(reinterpret_cast<const __m128i *>(p1) + 1),
_mm_loadu_si128(reinterpret_cast<const __m128i *>(p2) + 1))),
_mm_and_si128(
_mm_cmpeq_epi8(
_mm_loadu_si128(reinterpret_cast<const __m128i *>(p1) + 2),
_mm_loadu_si128(reinterpret_cast<const __m128i *>(p2) + 2)),
_mm_cmpeq_epi8(
_mm_loadu_si128(reinterpret_cast<const __m128i *>(p1) + 3),
_mm_loadu_si128(reinterpret_cast<const __m128i *>(p2) + 3)))));
}
#elif defined(__aarch64__) && defined(__ARM_NEON)
inline bool compare8(const char * p1, const char * p2)
{
uint64_t mask = getNibbleMask(vceqq_u8(
vld1q_u8(reinterpret_cast<const unsigned char *>(p1)), vld1q_u8(reinterpret_cast<const unsigned char *>(p2))));
return 0xFFFFFFFFFFFFFFFF == mask;
}
inline bool compare64(const char * p1, const char * p2)
{
uint64_t mask = getNibbleMask(vandq_u8(
vandq_u8(vceqq_u8(vld1q_u8(reinterpret_cast<const unsigned char *>(p1)), vld1q_u8(reinterpret_cast<const unsigned char *>(p2))),
vceqq_u8(vld1q_u8(reinterpret_cast<const unsigned char *>(p1 + 16)), vld1q_u8(reinterpret_cast<const unsigned char *>(p2 + 16)))),
vandq_u8(vceqq_u8(vld1q_u8(reinterpret_cast<const unsigned char *>(p1 + 32)), vld1q_u8(reinterpret_cast<const unsigned char *>(p2 + 32))),
vceqq_u8(vld1q_u8(reinterpret_cast<const unsigned char *>(p1 + 48)), vld1q_u8(reinterpret_cast<const unsigned char *>(p2 + 48))))));
return 0xFFFFFFFFFFFFFFFF == mask;
}
#endif
#if defined(__SSE2__) || (defined(__aarch64__) && defined(__ARM_NEON))
inline bool memequalWide(const char * p1, const char * p2, size_t size)
{
/** The order of branches and the trick with overlapping comparisons
* are the same as in memcpy implementation.
* See the comments in base/glibc-compatibility/memcpy/memcpy.h
*/
if (size <= 16)
{
if (size >= 8)
{
/// Chunks of 8..16 bytes.
return unalignedLoad<uint64_t>(p1) == unalignedLoad<uint64_t>(p2)
&& unalignedLoad<uint64_t>(p1 + size - 8) == unalignedLoad<uint64_t>(p2 + size - 8);
}
else if (size >= 4)
{
/// Chunks of 4..7 bytes.
return unalignedLoad<uint32_t>(p1) == unalignedLoad<uint32_t>(p2)
&& unalignedLoad<uint32_t>(p1 + size - 4) == unalignedLoad<uint32_t>(p2 + size - 4);
}
else if (size >= 2)
{
/// Chunks of 2..3 bytes.
return unalignedLoad<uint16_t>(p1) == unalignedLoad<uint16_t>(p2)
&& unalignedLoad<uint16_t>(p1 + size - 2) == unalignedLoad<uint16_t>(p2 + size - 2);
}
else if (size >= 1)
{
/// A single byte.
return *p1 == *p2;
}
return true;
}
while (size >= 64)
{
if (compare64(p1, p2))
{
p1 += 64;
p2 += 64;
size -= 64;
}
else
return false;
}
switch (size / 16) // NOLINT(bugprone-switch-missing-default-case)
{
case 3: if (!compare8(p1 + 32, p2 + 32)) return false; [[fallthrough]];
case 2: if (!compare8(p1 + 16, p2 + 16)) return false; [[fallthrough]];
case 1: if (!compare8(p1, p2)) return false; [[fallthrough]];
default: ;
}
return compare8(p1 + size - 16, p2 + size - 16);
}
#endif
inline bool operator== (StringRef lhs, StringRef rhs)
{
if (lhs.size != rhs.size)
return false;
if (lhs.size == 0)
return true;
#if defined(__SSE2__) || (defined(__aarch64__) && defined(__ARM_NEON))
return memequalWide(lhs.data, rhs.data, lhs.size);
#else
return 0 == memcmp(lhs.data, rhs.data, lhs.size);
#endif
}
inline bool operator!= (StringRef lhs, StringRef rhs)
{
return !(lhs == rhs);
}
inline bool operator< (StringRef lhs, StringRef rhs)
{
int cmp = memcmp(lhs.data, rhs.data, std::min(lhs.size, rhs.size));
return cmp < 0 || (cmp == 0 && lhs.size < rhs.size);
}
inline bool operator> (StringRef lhs, StringRef rhs)
{
int cmp = memcmp(lhs.data, rhs.data, std::min(lhs.size, rhs.size));
return cmp > 0 || (cmp == 0 && lhs.size > rhs.size);
}
/** Hash functions.
* You can use either CityHash64,
* or a function based on the crc32 statement,
* which is obviously less qualitative, but on real data sets,
* when used in a hash table, works much faster.
* For more information, see hash_map_string_3.cpp
*/
struct StringRefHash64
{
size_t operator() (StringRef x) const
{
return CityHash_v1_0_2::CityHash64(x.data, x.size);
}
};
#if defined(CRC_INT)
/// Parts are taken from CityHash.
inline UInt64 hashLen16(UInt64 u, UInt64 v)
{
return CityHash_v1_0_2::Hash128to64(CityHash_v1_0_2::uint128(u, v));
}
inline UInt64 shiftMix(UInt64 val)
{
return val ^ (val >> 47);
}
inline UInt64 rotateByAtLeast1(UInt64 val, UInt8 shift)
{
return (val >> shift) | (val << (64 - shift));
}
inline size_t hashLessThan8(const char * data, size_t size)
{
static constexpr UInt64 k2 = 0x9ae16a3b2f90404fULL;
static constexpr UInt64 k3 = 0xc949d7c7509e6557ULL;
if (size >= 4)
{
UInt64 a = unalignedLoadLittleEndian<uint32_t>(data);
return hashLen16(size + (a << 3), unalignedLoadLittleEndian<uint32_t>(data + size - 4));
}
if (size > 0)
{
uint8_t a = data[0];
uint8_t b = data[size >> 1];
uint8_t c = data[size - 1];
uint32_t y = static_cast<uint32_t>(a) + (static_cast<uint32_t>(b) << 8);
uint32_t z = static_cast<uint32_t>(size) + (static_cast<uint32_t>(c) << 2);
return shiftMix(y * k2 ^ z * k3) * k2;
}
return k2;
}
inline size_t hashLessThan16(const char * data, size_t size)
{
if (size > 8)
{
UInt64 a = unalignedLoadLittleEndian<UInt64>(data);
UInt64 b = unalignedLoadLittleEndian<UInt64>(data + size - 8);
return hashLen16(a, rotateByAtLeast1(b + size, static_cast<UInt8>(size))) ^ b;
}
return hashLessThan8(data, size);
}
struct CRC32Hash
{
unsigned operator() (StringRef x) const
{
const char * pos = x.data;
size_t size = x.size;
if (size == 0)
return 0;
chassert(pos);
if (size < 8)
{
return static_cast<unsigned>(hashLessThan8(x.data, x.size));
}
const char * end = pos + size;
unsigned res = -1U;
do
{
UInt64 word = unalignedLoadLittleEndian<UInt64>(pos);
res = static_cast<unsigned>(CRC_INT(res, word));
pos += 8;
} while (pos + 8 < end);
UInt64 word = unalignedLoadLittleEndian<UInt64>(end - 8); /// I'm not sure if this is normal.
res = static_cast<unsigned>(CRC_INT(res, word));
return res;
}
};
struct StringRefHash : CRC32Hash {};
#else
struct CRC32Hash
{
unsigned operator() (StringRef /* x */) const
{
throw std::logic_error{"Not implemented CRC32Hash without SSE"};
}
};
struct StringRefHash : StringRefHash64 {};
#endif
namespace std
{
template <>
struct hash<StringRef> : public StringRefHash {};
}
namespace ZeroTraits
{
inline bool check(const StringRef & x) { return 0 == x.size; }
inline void set(StringRef & x) { x.size = 0; }
}
namespace PackedZeroTraits
{
template <typename Second, template <typename, typename> class PackedPairNoInit>
inline bool check(const PackedPairNoInit<StringRef, Second> p)
{ return 0 == p.key.size; }
template <typename Second, template <typename, typename> class PackedPairNoInit>
inline void set(PackedPairNoInit<StringRef, Second> & p)
{ p.key.size = 0; }
}
std::ostream & operator<<(std::ostream & os, const StringRef & str);
template<> struct fmt::formatter<StringRef> : fmt::ostream_formatter {};
``` |
```xml
<?xml version="1.0" encoding="UTF-8"?>
<configuration>
<appender name="STDOUT" class="ch.qos.logback.core.ConsoleAppender">
<target>System.out</target>
<filter class="ch.qos.logback.classic.filter.ThresholdFilter">
<level>INFO</level>
</filter>
<encoder>
<pattern>%date{yyyy-MM-dd HH:mm:ss.SSS} %-5level [%thread] %logger{26} - %msg%n</pattern>
</encoder>
</appender>
<logger name="org.asynchttpclient" level="INFO"/>
<logger name="io.netty" level="INFO"/>
<logger name="io.swagger" level="OFF"/>
<root level="INFO">
<appender-ref ref="STDOUT"/>
</root>
</configuration>
``` |
Frederick J. "Jim" Finch (born July 29, 1956) is a retired Chief Master Sergeant of the United States Air Force who served as the 13th Chief Master Sergeant of the Air Force from 1999 to 2002.
Military career
Finch grew up in East Hampton, New York, and entered the United States Air Force in July 1974. His background was in missile maintenance and professional military education and he served in a number of operational, maintenance, and support units at every level of command, from squadron through Major Command. His assignments included bases in Colorado, Florida, Alabama, Texas, Virginia, and Washington, D.C. He served overseas in the United Kingdom and Alaska. Finch served as the Command Chief Master Sergeant for the 11th Air Force and Air Combat Command (ACC). While at ACC, the command was involved in operations such as Operation Provide Promise, Operation Northern Watch, Operation Southern Watch, Operation Deliberate Force, Operation Joint Endeavor, Operation Desert Fox, and Operation Allied Force.
Assignments
July 1974 – September 1974, student, Air Force basic military training, Lackland Air Force Base, TX
September 1974 – February 1975, student, Missile Maintenance Technician School, Lowry Air Force Base, CO
March 1975 – November 1976, missile maintenance technician, 31st Munitions Maintenance Squadron, Homestead Air Reserve Base, FL
November 1976 – July 1978, missile maintenance technician, 7551st Ammunition Supply Squadron, Royal Air Force Welford, England
July 1978 – April 1980, missile maintenance crew chief and shift supervisor, 31st Equipment Maintenance Squadron, Homestead Air Reserve Base, FL
April 1980 – October 1984, instructor and Director of Education, Tactical Air Command Noncommissioned Officer Professional Military Education Center, Homestead Air Reserve Base, FL
October 1984 – June 1988, Chief, Nonresident Course Development; Director, Noncommissioned Officer Preparatory Course Instructor Course; and Chief, Noncommissioned Officer Professional Military Education Evaluations and Analysis Branch, Leadership and Management Development Center, Center for Professional Development, Maxwell Air Force Base, AL
June 1988 – August 1992, Superintendent for Noncommissioned Officer Professional Military Education, Air Force Military Personnel Center, Randolph Air Force Base, TX
September 1992 – July 1993, Commandant, Pacific Air Forces Noncommissioned Officer Academy — Alaska, Elmendorf Air Force Base, AK
July 1993 – July 1995, Senior Enlisted Adviser, 11th Air Force, Elmendorf Air Force Base, AK
July 1995 – July 1999, Command Chief Master Sergeant, Air Combat Command, Langley Air Force Base, VA
August 1999 – June 2002, Chief Master Sergeant of the Air Force, The Pentagon, Washington, D.C.
Education
1980 Tactical Air Command Noncommissioned Officer Leadership School, Homestead Air Force Base, Fla.
1983 Tactical Air Command Noncommissioned Officer Academy, Tyndall Air Force Base, Fla.
1987 Associate degree in electronic systems technology, Community College of the Air Force
1990 U.S. Air Force Senior Noncommissioned Officer Academy, Gunter Air Force Base, Ala.
1991 Associate degree in instructor of technology, Community College of the Air Force
Awards and decorations
References
Living people
Chief Master Sergeants of the United States Air Force
Recipients of the Legion of Merit
People from East Hampton (town), New York
1956 births
Recipients of the Air Force Distinguished Service Medal
Community College of the Air Force alumni
American Security Council Foundation
Recipients of the Meritorious Service Medal (United States) |
"To Be, to Be, Ten Made to Be" is Tackey & Tsubasa's debut single under the Avex Trax label. This is the first retail single for their 2wenty 2wo album.
Overview
"To Be, to Be, Ten Made to Be" is the debut single released by singer duo Tackey & Tsubasa. The a-side song "Sotsugyou:Sayonara wa Ashita no Tameni" was used as the insert song for the anime InuYasha on episode 124, only the version of the song used was not the same version that is on this single. It was also used as the Olympus "μDigital" commercial song. The single was released in five different editions, the regular edition with only the songs, a second edition containing a video of the PVs "True Heart", "Ki・Se・Ki", and "Get Down", another edition containing the said PVs on DVD, the fourth coming with a DVD with the said PVs and extra goods, and the last one containing the said PVs on video along with extra goods.
Sample of the translated lyrics:
We're becoming memories
Your nearby warmth is no longer granted to me
My painful sighs suddenly overflowed
and whirled up faraway in the distance to reach you
Music video
The promotional video for "Sotsugyou: Sayonara wa Ashita no Tameni" was shot in an unknown location by director Akie Hayashi. This PV showcases Tackey and Tsubasa singing in a small clearing, densely surrounded by bushes and vines. During the second chorus, the scene switches to the two standing up with a cloudy sky behind them. Also seen in the PV is a cage that, depending on the scene, either has two doves in it, or is empty. Once the instrumental is over, and the chorus is sung again, the two are seen standing up in the bush and vine area, only this time with sakura petals flying around them.
Track listing
Regular CD Format
"" (Kenn Kato, Ryouki Matsumoto) - 5:34
"To Be, or Not to Be" (Hideyuki Obata, Toshiharu Umezaki, Takehito Shimizu, Yuta Nakano) - 5:17
"Brand-new Song Medley" - 5:37
""
""
"Love&Tough"
Limited CD+DVD Format
CD Portion
"" (Kenn Kato, Ryouki Matsumoto) - 5:34
"To Be, or Not to Be" (Hideyuki Obata, Toshiharu Umezaki, Takehito Shimizu, Yuta Nakano) - 5:17
"Brand-new Song Medley" - 5:37
""
""
"Love&Tough"
DVD Portion
"Hatachi visual mix"
": Get Down True Heart"
"True Heart"
Personnel
Takizawa Hideaki - vocals
Imai Tsubasa - vocals
TV performances
February 21, 2003 - Music Station
Charts
Oricon Sales Chart (Japan)
RIAJ Certification
As of January 2004, "To Be, to Be, Ten Made to Be" has been certified gold for shipments of over 100,000 by the Recording Industry Association of Japan.
References
2003 singles
Tackey & Tsubasa songs
2003 songs
Avex Trax singles |
Martin Gold (December 26, 1915 – January 14, 2011) was an American composer, pianist, and bandleader born in New York City, New York, United States. He was the pianist and arranger for the Korn Kobblers, a popular 1940s novelty group billed as "America's most nonsensical dance band", but was probably best known as the composer of the song "Tell Me Why", which was a hit for The Four Aces in 1951.
Gold also arranged, conducted, and recorded for RCA Victor light orchestral "mood music" pieces utilizing fully the possibilities of the newly developed Stereophonic sound, with whole sections of violins drifting between right and left speakers.
He conducted (along with Sid Ramin) The Three Suns' The Sounds of Christmas (RCA, 1955). He produced two of Peter Nero's first albums for RCA Records (1961) and also conducted the accompanying orchestra. While at RCA, he had the distinction of playing on pre-Columbia signed Barbra Streisand's RCA audition demo in March, 1962.
Gold died on January 14, 2011, in Agoura Hills, California, at the age of 95.
Discography
Wired for Sound (Vik Records, 1956)
Sticks and Strings (Vik Records, 1956)
Higher Than Fi (Vik Records, 1957)
Hi Fi Fo Fum (Vik Records, 1958)
Sticks and Bones (RCA Victor, 1958)
By the Waters of the Minnetonka (Kapp, 1959)
College Songs in Stereo (Kapp, 1959)
Swingin' West (RCA Victor, 1960)
It's Magic (RCA Victor, 1961)
Stereo Action Goes Hollywood (RCA Victor, 1961)
Classic Bossa Nova (RCA Victor, 1965)
Moog Plays the Beatles (AVCO Embassy, 1969)
References
External links
Brief bio for Marty Gold
Listing from Space Age Pop Music
Article on the Korn Kobblers
1915 births
2011 deaths
American male composers
American conductors (music)
American male conductors (music)
American music arrangers
RCA Victor artists
American bandleaders
Musicians from New York City
20th-century American pianists
20th-century American composers
American male pianists
20th-century American male musicians
Easy listening musicians |
Wilbur W. Marsh (July 14, 1862 - December 23, 1929), was treasurer of the Democratic National Committee.
Biography
He was born in New York on July 14, 1862. He was a Democratic National Committeeman in 1912 and again in 1916. He was the Committee's treasurer from 1916 to 1924.
He was a delegate to 1920 Democratic National Convention and the 1928 Democratic National Convention representing Iowa.
Marsh died at his home in Waterloo, Iowa, on December 23, 1929, after having a stroke while driving his car.
References
1862 births
1929 deaths
Democratic National Committee people
Democratic National Committee treasurers |
Ludwig Wilhelm Andreas Maria Thuille (Bozen, 30 November 1861 – 5 February 1907) was an Austrian composer and teacher, numbered for a while among the leading operatic composers of the so-called Munich School of composers, whose most famous representative was Richard Strauss.
Biography
Thuille was born in Bozen, then part of Tyrol, now in Italy.
He lost both his parents in 1872 when he was 11, and moved in with his step-uncle in Kremsmünster, Austria. There he sang in the Benedictine choir and studied organ, piano, and violin. His musical abilities were exceptional, so in 1876 the widow of a composer/ conductor, Matthaus Nagiller, took him to Innsbruck for more advanced musical training. There, in the summer of 1877, he met the young Richard Strauss, whose family was visiting the town; the two became lifelong friends. His Innsbruck teacher of organ and theory recommended him to the distinguished composer Josef Rheinberger in Munich, who took him as a pupil in the Hochschule für Musik und Theater München, from where he graduated with honors in 1882. A year later he became a teacher, and few years thereafter a professor of theory and composition. His many pupils included Hermann Abendroth, Ernest Bloch, , Richard Wetz, Paul von Klenau, Rudi Stephan, Walter Braunfels, Mabel Wheeler Daniels, Henry Kimball Hadley and Walter R. Spalding, who became the head of the Division of Music at Harvard University, and later taught Leroy Anderson.
A prolific composer, Thuille concentrated on chamber music - he is remembered principally for his Sextet for piano and wind instruments (1886–88), the only one of his works to have kept a toehold on the repertoire - and opera, though his early works include a Piano Concerto and a Symphony. In 1897 his opera Theuerdank gained the first prize and a prestigious staged premiere in an operatic competition sponsored by the Regent of Bavaria, in which Alexander von Zemlinsky was placed second. His second opera Lobetanz was premiered the following year in Karlsruhe and was a considerable, if short-lived, success. He also composed a Symphony in F major, much praised by Strauss, five other chamber works, 13 choral pieces, and 78 songs.
Despite his friendship with Strauss (which extended to making a 2-piano arrangement of the latter's tone poem Don Juan), and despite his devotion to music-drama, Thuille remained a fairly conservative composer during his brief life. He died at the age of 45 in 1907 in Munich of heart failure. He was married for twenty years to Emma (née Dietl) until his death. They had two children.
Though neglected as a composer, Thuille's posthumously published Harmonielehre (written in collaboration with Rudolf Louis) went through many editions and was highly influential. Widely employed as part of the conservatory curriculum in German speaking countries through the 1960s, the Harmonielehre in two volumes is an important theoretical formulation devoted innovatively to the practices of the Munich School of composers, and remains one of few existing records providing examples of this music.
While Thuille's Sextet has always retained a certain following, several of his other compositions have become commercially available on CD only in recent years — his two Piano Quintets, the Piano Trio in E-flat, the Piano Concerto in D and the Symphony in F among them.
List of selected works
Operas
Theuerdank
Lobetanz, Op.10
Orchestral works
Romantic Overture, Op.16 (Prelude to Act I of Theuerdank)
Symphonicher Festmarsch, Op.38
Symphony in F
Piano Concerto in D
Keyboard
Organ sonata in A minor, Op. 2
3 Piano Pieces, Op.3
3 Piano Pieces, Op.33
3 Piano Pieces, Op.34
2 Piano Pieces, Op.37
Chamber
Violin Sonata in D minor, No.1, Op.1
Sextet for Piano and Wind Quintet in B-flat major, Op.6
Piano Quintet in E-flat major, No.2, Op.20
Cello Sonata, Op.22
Violin Sonata in E minor, No.2, Op.30
Allegro Giusto, Op.39, for Violin and Piano
Piano Trio in E-flat major
Piano Quintet in G minor
String Quartet in A major, No.1
String Quartet in G major, No.2, WoO
Quartett-Satz for String Quartet in A major
Vocal
78 solo songs, including:
5 Lieder, Op.4
3 Lieder for female voice, Op. 5
Song-cycle, Von Lieb' und Leid, Op. 7
3 Lieder Op. 12
3 Lieder, Op.15
3 Lieder, Op.26
4 Lieder, Op.27
Urschlamm-Idyll, song for bass voice and piano (1908)
13 choral pieces, including:
Weihnacht im Walde, Op. 14 for men's chorus
Traumsommernacht, Op. 25, for women's chorus with harp and violin
Rosenlied, Op. 29, for three-part women's chorus with piano
References
Further reading
Munter, Friedrich. Ludwig Thuille: Ein enter Versuch. Munich: Drei Masken Verlag, 1923.
External links
Texts of songs by Ludwig Thuille at The LiederNet Archive
1861 births
1907 deaths
Burials at Munich Waldfriedhof
Musicians from Bolzano
Austrian Romantic composers
Austrian opera composers
Male opera composers
German music educators
Austrian people of French descent
German music theorists
University of Music and Performing Arts Munich alumni
Pupils of Josef Rheinberger
Austrian male classical composers
20th-century Italian male musicians
19th-century Italian male musicians
19th-century German musicologists |
The Forty-Second Wisconsin Legislature convened from to in regular session. They convened again in special session in February 1896 to pass a legislative redistricting law.
Senators representing odd-numbered districts were newly elected for this session and were serving the first two years of a four-year term. Assembly members were elected to a two-year term. Assembly members and odd-numbered senators were elected in the general election of November 6, 1894. Senators representing even-numbered districts were serving the third and fourth year of a four-year term, having been elected in the general election of November 8, 1892.
Major events
January 7, 1895: Inauguration of William H. Upham as 18th Governor of Wisconsin.
February 25, 1895: The first rebellions of the Cuban War of Independence began.
May 27, 1895: The United States Supreme Court, in the case In re Debs, ruled that the United States government had the authority to regulate interstate commerce.
July 14, 1895: Wisconsin Supreme Court chief justice Harlow S. Orton died in office. He was succeeded as chief justice by John B. Cassoday by rule of seniority.
August 5, 1895: Roujet D. Marshall was appointed to the Wisconsin Supreme Court to fill the vacancy caused by the death of Harlow S. Orton.
January 4, 1896: Utah was admitted as the 45th U.S. state.
May 18, 1896: The United States Supreme Court, in the case Plessy v. Ferguson, ruled that racial segregation was legal as long as facilities were "equal", later referred to as the "separate but equal" doctrine.
May 25, 1896: Former three-term Wisconsin Governor and Union Army general Lucius Fairchild died in Madison.
June 6, 1896: U.S. President Grover Cleveland signed the "Filled Cheese Act", which established a prohibitive tax on cheese products that had been enhanced with vegetable oil or other fats. This law was proposed by Wisconsin congressman Samuel A. Cook, and was part of a decades-long effort by Wisconsin's congressional delegation to prohibit selling margarine or other alternatives to dairy products.
July 9, 1896: William Jennings Bryan delivered his famous Cross of Gold speech at the 1896 Democratic National Convention.
August 23, 1896: The Cry of Pugad Lawin initiated the Philippine Revolution.
November 3, 1896: 1896 United States general election:
William McKinley elected President of the United States.
Edward Scofield elected Governor of Wisconsin.
Wisconsin voters rejected a proposed constitutional amendment to allow the Legislature to set the salary of the state superintendent of public instruction.
Major legislation
Joint Resolution agreeing to a proposed amendment to section 1, article 10, of the constitution of the state of Wisconsin, 1895 Joint Resolution 2.
Joint Resolution that section 7, article 7, constitution of Wisconsin, relating to circuit courts be amended so as to read as follows, 1895 Joint Resolution 8. Proposed an amendment to the state constitution to allow counties with large populations to have more than one circuit judge.
1896 Wisc. Special Session Act 1, a legislative redistricting law based on Wisconsin's mid-decade state census.
Summary
Senate summary
Assembly summary
Sessions
1st Regular session: January 9, 1895April 20, 1895
February 1896 Special session: February 18, 1896February 28, 1896
Leaders
Senate leadership
President of the Senate: Emil Baensch (R)
President pro tempore: Thompson Weeks (R)
Assembly leadership
Speaker of the Assembly: George B. Burrows (R)
Members
Members of the Senate
Members of the Senate for the Forty-Second Wisconsin Legislature:
Members of the Assembly
Members of the Assembly for the Forty-Second Wisconsin Legislature:
Committees
Senate committees
Senate Committee on AgriculturePeirce, chair
Senate Committee on Assessment and Collection of TaxesWoodworth, chair
Senate Committee on BankingDavis, chair
Senate Committee on Dairy and FoodMcGillivray, chair
Senate Committee on EducationStout, chair
Senate Committee on Enrolled BillsPhillips, chair
Senate Committee on Engrossed BillsConger, chair
Senate Committee on Federal RelationsAustin, chair
Senate Committee on IncorporationsMills, chair
Senate Committee on the JudiciarySpensley, chair
Senate Committee on Legislative ExpendituresMcGillivray, chair
Senate Committee on Manufacturing and CommerceThayer, chair
Senate Committee on Military AffairsWeeks, chair
Senate Committee on Privileges and ElectionsStebbins, chair
Senate Committee on Public LandsTimme, chair
Senate Committee on RailroadsWithee, chair
Senate Committee on Roads and BridgesYoumans, chair
Senate Committee on State AffairsPutnam, chair
Senate Committee on Town and County OrganizationsFisher, chair
Assembly committees
Assembly Committee on AgricultureThomas H. Grier, chair
Assembly Committee on Assessment and Collection of TaxesN. B. Treat, chair
Assembly Committee on Bills on their Third ReadingCharles F. Hanke, chair
Assembly Committee on CitiesFrank Anson, chair
Assembly Committee on Dairy and FoodGeorge H. Blake, chair
Assembly Committee on EducationD. O. Mahoney, chair
Assembly Committee on Engrossed BillsJ. O. Davidson, chair
Assembly Committee on Enrolled BillsA. H. De Groff, chair
Assembly Committee on Federal RelationsG. J. Jeske, chair
Assembly Committee on Forestry and HorticultureCharles Hirschinger, chair
Assembly Committee on IncorporationsO. J. Williams, chair
Assembly Committee on Insurance, Banks, and BankingWilliam A. Jones, chair
Assembly Committee on the JudiciaryH. P. Burdick, chair
Assembly Committee on Labor and ManufacturesE. R. Stillman, chair
Assembly Committee on Legislative ExpendituresA. L. Utt, chair
Assembly Committee on Lumber and MiningA. R. Hall, chair
Assembly Committee on Medical SocietiesC. C. Harris, chair
Assembly Committee on MilitiaMarshall Cousins, chair
Assembly Committee on Privileges and ElectionsH. C. Sloan, chair
Assembly Committee on Public ImprovementsJ. B. Miller, chair
Assembly Committee on Public LandsC. A. Stanley, chair
Assembly Committee on RailroadsE. D. Hoyt, chair
Assembly Committee on Roads and BridgesL. B. Cox, chair
Assembly Committee on State AffairsJ. G. Lamberson, chair
Assembly Committee on Town and County OrganizationWilliam O'Neil, chair
Assembly Committee on Ways and MeansJames Freeman, chair
Joint committees
Joint Committee on Charitable and Penal InstitutionsOfficer (Sen.) & Fenner Kimball (Asm.), co-chairs
Joint Committee on ClaimsBaxter(Sen.) & Frank L. Fraser (Asm.), co-chairs
Joint Committee on Fish and GameTimme (Sen.) & Henry L. Besse (Asm.), co-chairs
Joint Committee on PrintingPeirce (Sen.) & James T. Ellarson (Asm.), co-chairs
Employees
Senate employees
Chief Clerk: Walter Houser
Assistant Chief Clerk: Fred W. Coon
Journal Clerk: William M. Fogo
Bookkeeper: E. S. Hotchkiss
Assistant Bookkepper: I. S. Griffin
Engrossing Clerk: Francis Stirn
Assistant Engrossing Clerk: Helena Heyd
Enrolling Clerk: L. J. Burlingame
Assistant Enrolling Clerk: George L. Kingsley Jr.
Proofreader: H. F. Poland
Index Clerk: F. L. Perrin
Assistant Index Clerk: Charles Jewell
Copy Holder: E. A. Charlton
Clerk for the Judiciary Committee: C. S. Spensley
Clerk for the Committee on Incorporations: M. P. Schmitt
Clerk for the Committee on Claims: James M. Hayden
Clerk for the Committee on Town and County Organization: Fisher
Clerk for the Committee on Railroads: W. E. Miner
Clerk for the Committee on State Affairs: Fred Gilman
Clerk for the Committee on Engrossed Bills: S. A. Pelton
Clerk for the Committee on Enrolled Bills: Hattie M. Phillips
Document Clerk: Arton T. Sutton
Comparing Clerks:
Caroline Lawson
S. N. Hartwell
C. L. Fellows
Edwin French
General Clerks:
C. P. Northrup
LeRoy Thomas
Horace G. Cole
A. W. James
Ruling Clerk: Eddie Sherman
Printing Page: B. Staunchfield
Sergeant-at-Arms: Charles A. Pettibone
Assistant Sergeant-at-Arms: Hans J. Jacobson
Postmaster: Harvey R. Rawson
Assistant Postmaster: Charles W. Stewart
Gallery Attendants: Henry Grapengleser
General Attendants:
Iver Torkelson
George S. Sutherland
Document Room Attendant: Thomas R. McLean
Doorkeepers:
Robert McCalvy
Daniel E. Catlin
John Keller
Charles D. Nelson
Night Watch: George J. Walters
Custodian: Edwin Culver
Night Laborer: William Gillett
Messengers:
Hugh W. Whitcomb
James E. Calmso
Walter E. Grams
James S. Bartels
Arthur Schempp
Alfred Johnson
Anton Kempter
Eldon D. Woodworth
Jacob G. Childs
Assembly employees
Chief Clerk: N. A. Nowell
Assistant Chief Clerk: Oliver G. Munson
Journal Clerks:
Charles M. Durkee
B. H. Sanford
Bookkeepers:
C. E. Brightman
Robert A. Gillett
Engrossing Clerk: Julius Ewald
Enrolling Clerk: John W. Hare
Index Clerk: C. K. Pettingill
Stationary Clerk: Frank S. Horner
Proof Reader: John H. Frazier
Printing Clerk: Samuel J. Williams
Clerk for the Judiciary Committee: W. C. Reilly
Stenographer for the Judiciary Committee: Ella K. Smith
Clerk for the Committee on Enrolled Bills: Andrew Rohrscheib
Clerk for the Committee on Engrossed Bills: Joseph Smethurst
Clerk for the Committee on Assessment and Collection of Taxes: Harvey Clark
Clerk for the Committee on State Affairs: W. C. Thomas
Clerk for the Committee on Railroads: Dan B. Starkey
Clerk for the Committee on Insurance, Banks, and Banking: Ole Steensland
Clerk for the Committee on Town and County Organization: Jery Palmer
Clerk for the Committee on Bills on Third Reading: N. Marte
Document Clerk: K. W. Jensen
Sergeant-at-Arms: Benjamin Franklin Millard
Assistant Sergeant-at-Arms: Joseph B. Johnson
Postmaster: O. B. Moon
Assistant Postmaster: C. H. Underhill
Doorkeepers:
Edward Emerson
Daniel Stromstad
R. J. Jeskie
William Disch
Document Room Attendant: A. C. Lymon
Gallery Attendants:
Edwin Davis
John Campbell
Day Attendant: T. F. Monty
Committee Room Attendants:
F. G. Dahlberg
Max Booth
Wallace Hegelmire
Henry Kessler
S. H. Sorinson
M. Nelson
Porter: Aretus Bond
Flagman: Harvey Allen
Night Watch: I. O. Hilmoe
Custodian of the Enrolling Room: Albert Glander
Custodian of the Engrossing Room: R. A. Vedder
Committee Room Custodians:
C. E. Foot
S. Teasdeal
Wash Room Attendants:
Louis Donald
Herman Miller
Coat Room Attendants:
Frank Gaus
Sam Debrozzo
Janitor: Jacob Dischler
Pages:
Frank Howard
Paul Sumers
Claude Blake
Alford Wilkey
William Hoskosh
Eddie Beebie
Arthur Nichols
Clyde Varley
George Cary
John Millard
Kurt Pressentin
George Thompson
References
External links
1895: Related Documents from Wisconsin Legislature
1895 in Wisconsin
1896 in Wisconsin
Wisconsin
Wisconsin
Wisconsin legislative sessions |
```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
//
#include "base/win/desktop.h"
#include "base/logging.h"
namespace base {
//your_sha256_hash----------------------------------
Desktop::Desktop(Desktop&& other) noexcept
{
desktop_ = other.desktop_;
own_ = other.own_;
other.desktop_ = nullptr;
}
//your_sha256_hash----------------------------------
Desktop::Desktop(HDESK desktop, bool own)
: desktop_(desktop),
own_(own)
{
// Nothing
}
//your_sha256_hash----------------------------------
Desktop::~Desktop()
{
close();
}
//your_sha256_hash----------------------------------
// static
Desktop Desktop::desktop(const wchar_t* desktop_name)
{
const ACCESS_MASK desired_access =
DESKTOP_CREATEMENU | DESKTOP_CREATEWINDOW |
DESKTOP_ENUMERATE | DESKTOP_HOOKCONTROL |
DESKTOP_WRITEOBJECTS | DESKTOP_READOBJECTS |
DESKTOP_SWITCHDESKTOP | GENERIC_WRITE;
HDESK desktop = OpenDesktopW(desktop_name, 0, FALSE, desired_access);
if (!desktop)
{
PLOG(LS_ERROR) << "OpenDesktopW failed";
return Desktop();
}
return Desktop(desktop, true);
}
//your_sha256_hash----------------------------------
// static
Desktop Desktop::inputDesktop()
{
const ACCESS_MASK desired_access = GENERIC_READ | GENERIC_WRITE | GENERIC_EXECUTE;
HDESK desktop = OpenInputDesktop(0, FALSE, desired_access);
if (!desktop)
{
PLOG(LS_ERROR) << "OpenInputDesktop failed";
return Desktop();
}
return Desktop(desktop, true);
}
//your_sha256_hash----------------------------------
// static
Desktop Desktop::threadDesktop()
{
HDESK desktop = GetThreadDesktop(GetCurrentThreadId());
if (!desktop)
{
PLOG(LS_ERROR) << "GetThreadDesktop failed";
return Desktop();
}
return Desktop(desktop, false);
}
//your_sha256_hash----------------------------------
// static
std::vector<std::wstring> Desktop::desktopList(HWINSTA winsta)
{
std::vector<std::wstring> list;
if (!EnumDesktopsW(winsta, enumDesktopProc, reinterpret_cast<LPARAM>(&list)))
{
PLOG(LS_ERROR) << "EnumDesktopsW failed";
return {};
}
return list;
}
//your_sha256_hash----------------------------------
bool Desktop::name(wchar_t* name, DWORD length) const
{
if (!desktop_)
return false;
if (!GetUserObjectInformationW(desktop_, UOI_NAME, name, length, nullptr))
{
PLOG(LS_ERROR) << "Failed to query the desktop name";
return false;
}
return true;
}
//your_sha256_hash----------------------------------
bool Desktop::isSame(const Desktop& other) const
{
wchar_t this_name[128];
if (!name(this_name, sizeof(this_name)))
return false;
wchar_t other_name[128];
if (!other.name(other_name, sizeof(other_name)))
return false;
return wcscmp(this_name, other_name) == 0;
}
//your_sha256_hash----------------------------------
bool Desktop::setThreadDesktop() const
{
if (!SetThreadDesktop(desktop_))
{
PLOG(LS_ERROR) << "SetThreadDesktop failed";
return false;
}
return true;
}
//your_sha256_hash----------------------------------
bool Desktop::isValid() const
{
return (desktop_ != nullptr);
}
//your_sha256_hash----------------------------------
void Desktop::close()
{
if (own_ && desktop_)
{
if (!CloseDesktop(desktop_))
{
PLOG(LS_ERROR) << "CloseDesktop failed";
}
}
desktop_ = nullptr;
}
//your_sha256_hash----------------------------------
Desktop& Desktop::operator=(Desktop&& other) noexcept
{
close();
desktop_ = other.desktop_;
own_ = other.own_;
other.desktop_ = nullptr;
return *this;
}
//your_sha256_hash----------------------------------
// static
BOOL CALLBACK Desktop::enumDesktopProc(LPWSTR desktop, LPARAM lparam)
{
std::vector<std::wstring>* list = reinterpret_cast<std::vector<std::wstring>*>(lparam);
if (!list)
{
LOG(LS_ERROR) << "Invalid desktop list pointer";
return FALSE;
}
if (!desktop)
{
LOG(LS_ERROR) << "Invalid desktop name";
return FALSE;
}
list->emplace_back(desktop);
return TRUE;
}
} // namespace base
``` |
Bueno may refer to:
Places
Bueno Brandão, a municipality in Brazil
Bueno River, in Chile
Río Bueno, Chile, a city and commune
Rio Bueno (Jamaica), a river
Rio Bueno, Jamaica, a settlement
Pimenta Bueno, a municipality in Brazil
Pimenta Bueno River, a river in Brazil
Other
Bueno (surname)
Kinder Bueno, an Italian chocolate bar
Poco Bueno, an American Quarter Horse stallion
Taco Bueno, a U.S.-based fast-food restaurant chain
Bueno (footballer) (born 1995), Wellington Daniel Bueno, Brazilian footballer |
Olga Averino (November 15, 1895 – January 17, 1989) was a Russian-born soprano and voice teacher. A white émigré to the United States in the wake of the Russian Civil War, she was prominent in the musical life of Boston for over 60 years, first as a singer and later as a distinguished voice teacher.
Biography
Olga Averino was born into a family of musicians in Moscow in 1895. Her father, Nicholas Averino, was a violist and director of the music conservatory in Rostov. Her mother, Olga Laroche, was a pianist, the daughter of the Russian musicologist Herman Laroche and the god-daughter of the composer Pyotr Ilyich Tchaikovsky. Averino, herself was the god-daughter of the composer's brother Modest Ilyich Tchaikovsky. She trained in piano and voice at the Moscow Conservatory and married the violinist Paul Fedorovsky.
In 1918, the Bolshevik Revolution and ensuing civil war led the young couple to flee Russia with their baby daughter. They travelled across Siberia to Vladivostok and down into Manchuria. After living in Beijing for several years, they eventually made their way to the United States, settling in Boston in 1924 where Fedorovsky became a violinist in the Boston Symphony Orchestra; Averino appeared frequently as a soprano soloist.
She was a regular soloist with the Boston Symphony during the Koussvitzky era. Amongst the many works in which she performed there, were Beethoven's 9th Symphony, Bach's Mass in B Minor, Ravel's Sheherazade, Debussy's Martyrdom of St. Sebastian, and the American premiere of Alban Berg's Lied der Lulu. During her long career as a performer she sang in lieder, oratorio and opera and worked with many prominent 20th century composers including Ravel, Schoenberg, Stravinsky, Rachmaninoff, and Glazunov.
She was a noted recitalist and is credited with having established the success of Ravel's Chansons madecasses in the United States. She also toured the United States in a series of joint recitals with the cellist Gregor Piatigorsky, where her accompanist was Alexander Siloti, the last pupil of Franz Liszt.
Olga Averino taught voice at the Longy School of Music, Middlebury College, Wellesley College, and The New School of Music. She also gave a lecture series at Harvard University. However, she is most closely associated with the Longy School, where she was the head of the voice department from 1938 to 1976, returning occasionally for master classes after her retirement, the last of which she gave in 1987. It was also at the Longy School that she gave her final public recital, at age 74.
Among her many pupils, perhaps the most prominent was American soprano, Phyllis Curtin, who studied voice with Averino at Wellesley College during the 1940s. Curtin said of her teacher:
Impatient of sloppy musicianship, demanding emotional commitment, she gave me a vision of the art of singing that led me the rest of my life. On the few occasions when she sang, I learned what a great singing artist is.
Her charismatic teaching style was also recalled by composer and critic, Greg Sandow, who studied under her at the Longy School:
[She] would bring her students all together for a class. Somebody would sing, and, in her Russian accent, Olga typically would ask, 'What emotion does the person in the song feel?' 'The person in the song is angry,' the student would reply. 'But which kind of anger?' Olga would demand, and then sing the opening of the song six times, in six precisely differentiated shades of anger, as distinct as six different people.
Olga Averino and Paul Fedorovsky's daughter Irina Lasoff (1918 – 2006) became a noted choreographer and teacher.
Last years
Following her husband's death in 1958, Averino moved from their home in Boston's Back Bay to an apartment in Cambridge where she continued to teach private pupils until a few days before her death. Olga Averino died in her sleep in Cambridge at the age of 93.
Recordings
South American Chamber Music (Soprano Olga Averino, Violinist Alfredo St Malo, Cellist Fritz Magg, Pianist-Arranger Nicolas Slonimsky) Columbia Records, 1941.
French Songs (Soprano Olga Averino), Victor records, 1940.
Book
Olga Averino, Principles and Art of Singing, Novis, 1989
Averino wrote Principles and Art of Singing in the late 1970s and continued to revise it through 1987, circulating mimeographed copies amongst her students and friends. The book, edited by her daughter, Irina Lasoff, was finally published posthumously in late 1989. The final words of the book are a summation of her teaching philosophy:
Singing is an expression of life, and if you have no time for your life, how can you sing? Quality always needs time, not only in music but also in life itself.
References
Further Sources
Richard Dyer, Averino Opened Doors in the World of Music, Boston Globe, January 21, 1989; accessed via subscription January 24, 2008.
Robert Wilder Blue, American Icon: Phyllis Curtin, USOperaWeb, Autumn 2002; accessed January 24, 2008.
Obituary: Olga Averino, New York Times, January 21, 1989; accessed January 24, 2008.
External links
Portrait sculpture of Olga Averino by Anna Coleman Ladd, Smithsonian American Art Museum, Photograph Archives, Washington D.C.
1895 births
1989 deaths
20th-century Russian women opera singers
Russian operatic sopranos
Sopranos from the Russian Empire
Voice teachers
White Russian emigrants to the United States
Singers from Moscow
Russian music educators
Russian women music educators
Moscow Conservatory alumni |
```javascript
const { defineConfig } = require('cypress')
module.exports = defineConfig({
fixturesFolder: false,
viewportHeight: 300,
viewportWidth: 500,
e2e: {
supportFile: false,
},
})
``` |
Mahalina is a municipality (, ) in Madagascar. It belongs to the district of Antsiranana II, which is a part of Diana Region. According to 2001 census, the population of Mahalina was 2,217.
The majority 95% of the population are farmers. The most important crop is rice, while other important products are banana and coconut. Fishing employs the rest 5% of the population.
References and notes
Populated places in Diana Region |
```python
# 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
import numpy as np
import tvm
import tvm.testing
from tvm import te
from tvm.script import tir as T
from tvm import relay, tir
from tvm.relay.backend.te_compiler import lower_to_primfunc
from tvm.tir.tensor_intrin.hexagon import VRMPY_u8u8i32_INTRIN
def _check(original, transformed):
func = original
mod = tvm.IRModule.from_expr(func.with_attr("global_symbol", "main"))
mod = tvm.tir.transform.PlanAndUpdateBufferAllocationLocation()(mod)
tvm.ir.assert_structural_equal(mod["main"], transformed.with_attr("global_symbol", "main"))
@T.prim_func
def element_func(a: T.handle, c: T.handle) -> None:
A = T.match_buffer(a, (16, 16))
C = T.match_buffer(c, (16, 16))
B = T.alloc_buffer((16, 16))
for i0 in range(0, 16):
for j0 in range(0, 16):
with T.block():
i, j = T.axis.remap("SS", [i0, j0])
B[i, j] = A[i, j] + 1.0
for j0 in range(0, 16):
with T.block():
i, j = T.axis.remap("SS", [i0, j0])
C[i, j] = B[i, j] * 2.0
@T.prim_func
def transformed_element_func(a: T.handle, c: T.handle) -> None:
A = T.match_buffer(a, [16, 16])
C = T.match_buffer(c, [16, 16])
for i_0 in range(0, 16):
with T.block():
T.reads([A[i_0, 0:16]])
T.writes([C[i_0, 0:16]])
B = T.alloc_buffer([16, 16])
for j_0 in T.serial(0, 16):
with T.block():
i, j = T.axis.remap("SS", [i_0, j_0])
B[i, j] = A[i, j] + 1.0
for j_0 in T.serial(0, 16):
with T.block():
i, j = T.axis.remap("SS", [i_0, j_0])
C[i, j] = B[i, j] * 2.0
@T.prim_func
def original_func() -> None:
A = T.alloc_buffer((128, 128), "float32")
for i0, j0 in T.grid(128, 128):
with T.block():
i, j = T.axis.remap("SS", [i0, j0])
A[i, j] = T.float32(0)
for i0, j0, k0 in T.grid(32, 32, 32):
with T.block():
i, j, k = T.axis.remap("SSR", [i0, j0, k0])
B = T.alloc_buffer((128, 128), "float32")
C = T.alloc_buffer((128, 128), "float32")
D = T.alloc_buffer((128, 128), "float32")
if k == 0:
for ii, jj in T.grid(4, 4):
B[i * 4 + ii, j * 4 + jj] = A[i * 4 + ii, j * 4 + jj]
for ii, jj in T.grid(4, 4):
for kk in range(0, 4):
B[i * 4 + ii, j * 4 + jj] += C[i * 4 + ii, k * 4 + kk]
for kk in range(0, 4):
B[i * 4 + ii, j * 4 + jj] += (
D[j * 4 + jj, k * 4 + kk] * C[i * 4 + ii, k * 4 + kk]
)
@T.prim_func
def transformed_func() -> None:
A = T.alloc_buffer([128, 128])
for i0, j0 in T.grid(128, 128):
with T.block():
i, j = T.axis.remap("SS", [i0, j0])
A[i, j] = T.float32(0)
for i0, j0, k0 in T.grid(32, 32, 32):
with T.block():
i, j, k = T.axis.remap("SSR", [i0, j0, k0])
B = T.alloc_buffer([128, 128])
if k == 0:
for ii, jj in T.grid(4, 4):
B[i * 4 + ii, j * 4 + jj] = A[i * 4 + ii, j * 4 + jj]
for ii, jj in T.grid(4, 4):
with T.block(""):
T.reads([B[((i * 4) + ii), ((j * 4) + jj)]])
T.writes([B[((i * 4) + ii), ((j * 4) + jj)]])
C = T.alloc_buffer([128, 128])
for kk in T.serial(0, 4):
B[((i * 4) + ii), ((j * 4) + jj)] = (
B[((i * 4) + ii), ((j * 4) + jj)] + C[((i * 4) + ii), ((k * 4) + kk)]
)
for kk in T.serial(0, 4):
with T.block(""):
T.reads(
[
B[((i * 4) + ii), ((j * 4) + jj)],
C[((i * 4) + ii), ((k * 4) + kk)],
]
)
T.writes([B[((i * 4) + ii), ((j * 4) + jj)]])
D = T.alloc_buffer([128, 128])
B[((i * 4) + ii), ((j * 4) + jj)] = B[
((i * 4) + ii), ((j * 4) + jj)
] + (
D[((j * 4) + jj), ((k * 4) + kk)]
* C[((i * 4) + ii), ((k * 4) + kk)]
)
@T.prim_func
def match_buffer_func() -> None:
C = T.alloc_buffer((128, 128))
for i in range(128):
with T.block():
vi = T.axis.S(128, i)
C0 = T.match_buffer(C[vi, 0:128], (128))
for j in range(128):
with T.block():
jj = T.axis.S(128, j)
C1 = T.match_buffer(C0[jj], ())
C1[()] = 0
@T.prim_func
def transformed_match_buffer_func() -> None:
for i in range(0, 128):
with T.block():
vi = T.axis.S(128, i)
C = T.alloc_buffer((128, 128))
C0 = T.match_buffer(C[vi, 0:128], (128))
for j in range(128):
with T.block():
jj = T.axis.S(128, j)
C1 = T.match_buffer(C0[jj], ())
C1[()] = 0
@T.prim_func
def opaque_access(a: T.handle, b: T.handle) -> None:
A = T.match_buffer(a, [1024])
B = T.match_buffer(b, [1024])
A_cache = T.alloc_buffer([1024])
for i in T.serial(0, 8):
with T.block():
vi = T.axis.S(8, i)
with T.block():
v = T.axis.S(8, vi)
T.reads([A[(v * 128) : ((v * 128) + 128)]])
T.writes([A_cache[(v * 128) : ((v * 128) + 128)]])
T.evaluate(
T.call_extern(
"test",
A_cache.data,
(v * 128),
128,
A.data,
(v * 128),
128,
dtype="float32",
)
)
for j in T.serial(0, 128):
with T.block():
v = T.axis.S(1024, vi * 128 + j)
T.reads([A_cache[v]])
T.writes([B[v]])
B[v] = A_cache[v]
@T.prim_func
def transformed_opaque_access(a: T.handle, b: T.handle) -> None:
A = T.match_buffer(a, [1024])
B = T.match_buffer(b, [1024])
for i in T.serial(0, 8):
with T.block():
vi = T.axis.S(8, i)
T.reads(A[vi * 128 : vi * 128 + 128])
T.writes(B[vi * 128 : vi * 128 + 128])
A_cache = T.alloc_buffer([1024])
with T.block():
v = T.axis.S(8, vi)
T.reads([A[v * 128 : v * 128 + 128]])
T.writes([A_cache[v * 128 : v * 128 + 128]])
T.evaluate(
T.call_extern(
"test", A_cache.data, v * 128, 128, A.data, v * 128, 128, dtype="float32"
)
)
for j in T.serial(0, 128):
with T.block():
v = T.axis.S(1024, vi * 128 + j)
T.reads([A_cache[v]])
T.writes([B[v]])
B[v] = A_cache[v]
def test_elementwise():
_check(element_func, transformed_element_func)
def test_locate_buffer_allocation():
_check(original_func, transformed_func)
def test_match_buffer_allocation():
_check(match_buffer_func, transformed_match_buffer_func)
def test_opaque_access():
_check(opaque_access, transformed_opaque_access)
def test_lower_te():
x = te.placeholder((1,))
y = te.compute((1,), lambda i: x[i] + 2)
s = te.create_schedule(y.op)
orig_mod = tvm.driver.build_module.schedule_to_module(s, [x, y])
mod = tvm.tir.transform.PlanAndUpdateBufferAllocationLocation()(orig_mod)
tvm.ir.assert_structural_equal(
mod, orig_mod
) # PlanAndUpdateBufferAllocationLocation should do nothing on TE
def test_loop_carried_dependency():
"""The buffer allocation should be above opaque iter var's loop scopes
such that buffer accesses with loop carried dependencies are covered,
and the allocate buffer should keep the order."""
@T.prim_func
def before(A: T.Buffer((8, 8, 8), "int32"), B: T.Buffer((8, 8, 8), "int32")):
C = T.alloc_buffer([8, 8, 8], dtype="int32")
D = T.alloc_buffer([8, 8, 8], dtype="int32")
for i in T.serial(8):
for j in T.serial(8):
for k in T.serial(8):
with T.block("b0"):
vi, vj, vk = T.axis.remap("SSS", [i, j, k])
C[vi, vj, vk] = A[vi, vj, vk] + 1
for k in T.serial(8):
with T.block("b1"):
vi, vj, vk = T.axis.remap("SSS", [i, j, k])
D[vi, vj, vk] = A[vi, vj, vk] + 2
for k in T.serial(8):
with T.block("b2"):
vi, vk = T.axis.remap("SS", [i, k])
vj = T.axis.opaque(8, j)
B[vi, vj, vk] = (
C[vi, vj, vk]
+ T.if_then_else(0 < vj, C[vi, vj - 1, vk], 0, dtype="int32")
+ D[vi, vj, vk]
)
@T.prim_func
def after(A: T.Buffer((8, 8, 8), "int32"), B: T.Buffer((8, 8, 8), "int32")) -> None:
for i in T.serial(8):
with T.block():
T.reads(A[i, 0:8, 0:8])
T.writes(B[i, 0:8, 0:8])
C = T.alloc_buffer([8, 8, 8], dtype="int32")
D = T.alloc_buffer([8, 8, 8], dtype="int32")
for j in T.serial(8):
for k in T.serial(8):
with T.block("b0"):
vi, vj, vk = T.axis.remap("SSS", [i, j, k])
C[vi, vj, vk] = A[vi, vj, vk] + 1
for k in T.serial(8):
with T.block("b1"):
vi, vj, vk = T.axis.remap("SSS", [i, j, k])
D[vi, vj, vk] = A[vi, vj, vk] + 2
for k in T.serial(8):
with T.block("b2"):
vi, vk = T.axis.remap("SS", [i, k])
vj = T.axis.opaque(8, j)
B[vi, vj, vk] = (
C[vi, vj, vk]
+ T.if_then_else(0 < vj, C[vi, vj - 1, vk], 0, dtype="int32")
+ D[vi, vj, vk]
)
_check(before, after)
def test_1D_cascade_op_rolling_buffer():
"""The intermediate buffer must be allocated above rolling buffer's rolling loop,
which is marked as opaque in consumer block's iter mappings."""
@T.prim_func
def before(A: T.Buffer((4, 16), "int32"), C: T.Buffer((4, 8), "int32")):
B = T.alloc_buffer((4, 6), "int32")
for c in T.serial(4):
for i in T.serial(0, 2):
for j in T.serial(0, 6):
for k in T.serial(3):
with T.block("P1"):
T.where(i < 1 or j >= 2)
cc, vi, vj, vk = T.axis.remap("SSSR", [c, i, j, k])
if vk == 0:
B[cc, T.floormod(vi * 4 + vj, 6)] = 0
B[cc, T.floormod(vi * 4 + vj, 6)] = (
B[cc, T.floormod(vi * 4 + vj, 6)] + A[cc, vi * 4 + vj + vk]
)
for j in T.serial(0, 4):
for k in T.serial(3):
with T.block("P2"):
vi = T.axis.opaque(2, i)
cc, vj, vk = T.axis.remap("SSR", [c, j, k])
if vk == 0:
C[cc, vi * 4 + vj] = 0
C[cc, vi * 4 + vj] = (
C[cc, vi * 4 + vj] + B[cc, T.floormod(vi * 4 + vj + vk, 6)]
)
@T.prim_func
def after(A: T.Buffer((4, 16), "int32"), C: T.Buffer((4, 8), "int32")):
for c in T.serial(4):
with T.block():
T.reads(A[c, 0:12], C[c, 0:8])
T.writes(C[c, 0:8])
B = T.alloc_buffer([4, 6], dtype="int32")
for i in T.serial(2):
for j, k in T.grid(6, 3):
with T.block("P1"):
T.where(i < 1 or j >= 2)
cc, vi, vj, vk = T.axis.remap("SSSR", [c, i, j, k])
if vk == 0:
B[cc, (vi * 4 + vj) % 6] = 0
B[cc, (vi * 4 + vj) % 6] = (
B[cc, (vi * 4 + vj) % 6] + A[cc, vi * 4 + vj + vk]
)
for j, k in T.grid(4, 3):
with T.block("P2"):
vi = T.axis.opaque(2, i)
cc, vj, vk = T.axis.remap("SSR", [c, j, k])
if vk == 0:
C[cc, vi * 4 + vj] = 0
C[cc, vi * 4 + vj] = C[cc, vi * 4 + vj] + B[cc, (vi * 4 + vj + vk) % 6]
_check(before, after)
def test_allocate_const_after_tensorize():
i_size, o_size, h_size, w_size = 64, 64, 56, 56
k_height_size = k_width_size = 3
w_shape = (o_size, i_size, k_height_size, k_width_size)
data = relay.var("data", shape=(1, i_size, h_size, w_size), dtype="uint8")
weight = relay.var("weight", shape=w_shape, dtype="uint8")
conv2d = relay.nn.conv2d(
data=data,
weight=weight,
kernel_size=(k_height_size, k_width_size),
channels=o_size,
padding=(0, 0),
strides=(1, 1),
out_dtype="int32",
)
mod = tvm.IRModule.from_expr(conv2d)
executor = relay.backend.Executor("graph", {"link-params": True})
mod = mod.with_attr("executor", executor)
weight_np = np.random.uniform(1, 10, size=w_shape).astype("uint8")
target = tvm.target.Target("hexagon")
with tvm.transform.PassContext(opt_level=3):
opt_mod, _ = relay.optimize(mod, params={"weight": weight_np}, target=target)
conv2d_func = opt_mod["main"].body.args[0].op
prim_func = lower_to_primfunc(conv2d_func, target)
sch = tir.Schedule(prim_func)
block = sch.get_block("conv2d_NCHWc_int8")
loops = sch.get_loops(block)
sch.reorder(loops[8], loops[4], loops[-1])
sch.decompose_reduction(block, loops[1])
sch.tensorize(loops[4], VRMPY_u8u8i32_INTRIN)
seq = tvm.transform.Sequential(
[
tvm.tir.transform.LowerInitBlock(),
tvm.tir.transform.PlanAndUpdateBufferAllocationLocation(),
]
)
# The following error is emitted if AllocateConst nodes are not correctly handled:
# Check failed: (buffer_data_to_buffer_.count(source_var)) is false:
_ = seq(sch.mod)
def test_buffer_conditional_lowering():
"""Buffers passed as pointer arguments are unmodified
Confirm that the `tir.PlanAndUpdateBufferAllocationLocation` pass
leaves (Buffer nodes corresponding to pointer-typed PrimFunc arguments)
unchanged, rather than lowering them to `reads`, `writes`, and `alloc_buffer` nodes.
"""
@T.prim_func
def before(A: T.handle("float32")):
T.func_attr({"global_symbol": "main", "tir.noalias": True})
for i in range(1):
A_1 = T.Buffer((1,), data=A)
A_1[i] = 0
after = before
_check(before, after)
def test_dltensor_buffer_is_unlowered():
"""Buffers allocated with a LetStmt are unmodified
Confirm that the `tir.PlanAndUpdateBufferAllocationLocation` pass
leaves (Buffer nodes corresponding to PrimFunc DLTensor arguments)
unchanged, rather than lowering them to `reads`, `writes`, and
`alloc_buffer` nodes.
"""
@T.prim_func
def before(dlpack_handle: T.handle, axis: T.int64) -> T.int64:
ndim: T.int32 = T.tvm_struct_get(dlpack_handle, 0, 5, "int32")
stride_ptr: T.handle("int64") = T.tvm_struct_get(dlpack_handle, 0, 4, "handle")
if T.isnullptr(stride_ptr):
shape_ptr: T.handle("int64") = T.tvm_struct_get(dlpack_handle, 0, 3, "handle")
shape = T.decl_buffer(ndim, "int64", data=shape_ptr)
product = T.decl_buffer([], "int64")
product[()] = 1
for dim in range(axis + 1, ndim):
product[()] = product[()] * shape[dim]
return product[()]
else:
strides = T.decl_buffer(ndim, "int64", data=stride_ptr)
stride: T.int64 = strides[axis]
return stride
after = before
_check(before, after)
if __name__ == "__main__":
tvm.testing.main()
``` |
Carnes Creek is a creek located in the Big Bend Country region of British Columbia. The flows into the Columbia River from the east. It was discovered no later than 1865. The creek has been mined and has produced $200,000 in gold.
References
Rivers of British Columbia |
Eupselia beatella is a species of the family Depressariidae that occurs in Australia, where it has been recorded from Queensland, New South Wales and the Australian Capital Territory.
References
Moths described in 1864
Eupselia
Moths of Australia |
Yang Zhi may refer to:
Yang Zhi (Sizu) (羊陟), style name Sizu (嗣祖), Eastern Han Dynasty official, see Book of the Later Han
Empress Yang Zhi (楊芷; 259–292), Jin Dynasty (266–420) empress
Jiang Nan (novelist) (born 1977), birth name Yang Zhi
Yang Zhi (footballer) (杨智; born 1983), footballer
Yang Zhi (Water Margin) (楊志), fictional character in the novel Water Margin |
```smalltalk
// KEngine - Toolset and framework for Unity3D
// ===================================
//
// Filename: AppEngine.cs
// Date: 2015/12/03
// Author: Kelly
// Email: 23110388@qq.com
// Github: path_to_url
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
//
// This library 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 GNU
//
// You should have received a copy of the GNU Lesser General Public
#endregion
using System;
using System.Collections.Generic;
using UnityEngine;
using System.IO;
using System.Text;
using TableML;
//using KEngine.Table;
namespace KEngine.Modules
{
/// <summary>
/// Unity SettingModule, with Resources.Load in product, with File.Read in editor
/// </summary>
public class SettingModule : SettingModuleBase
{
private static readonly bool IsEditor;
static SettingModule()
{
IsEditor = Application.isEditor;
}
/// <summary>
/// internal constructor
/// </summary>
internal SettingModule()
{
}
/// <summary>
/// Singleton
/// </summary>
private static SettingModule _instance;
/// <summary>
/// Quick method to get TableFile from instance
/// </summary>
/// <param name="path"></param>
/// <param name="useCache"></param>
/// <returns></returns>
public static TableFile Get(string path, bool useCache = true)
{
if (_instance == null)
_instance = new SettingModule();
return _instance.GetTableFile(path, useCache);
}
/// <summary>
/// Unity Resources.Load setting file in Resources folder
/// </summary>
/// <param name="path"></param>
/// <returns></returns>
protected override string LoadSetting(string path)
{
byte[] fileContent = KResourceModule.LoadAssetsSync(GetSettingFilePath(path));
return Encoding.UTF8.GetString(fileContent);
}
/// <summary>
/// Settings
/// </summary>
/// <param name="path"></param>
/// <returns></returns>
public static string GetSettingFilePath(string path)
{
return AppConfig.SettingResourcesPath + "/" + path;
}
#if UNITY_EDITOR
/// <summary>
/// Cache all the FileSystemWatcher, prevent the duplicated one
/// </summary>
private static Dictionary<string, FileSystemWatcher> _cacheWatchers;
/// <summary>
/// Watch the setting file, when changed, trigger the delegate
/// </summary>
/// <param name="path"></param>
/// <param name="action"></param>
public static void WatchSetting(string path, System.Action<string> action)
{
if (!IsFileSystemMode)
{
Log.Error("[WatchSetting] Available in Unity Editor mode only!");
return;
}
if (_cacheWatchers == null)
_cacheWatchers = new Dictionary<string, FileSystemWatcher>();
FileSystemWatcher watcher;
var dirPath = Path.GetDirectoryName(KResourceModule.EditorProductFullPath + "/" + AppConfig.SettingResourcesPath + "/" + path);
dirPath = dirPath.Replace("\\", "/");
//if(Application.isEditor) Log.Info($"watch:{path}\n{dirPath}");
if (!Directory.Exists(dirPath))
{
Log.Error("[WatchSetting] Not found Dir: {0}", dirPath);
return;
}
if (!_cacheWatchers.TryGetValue(dirPath, out watcher))
{
_cacheWatchers[dirPath] = watcher = new FileSystemWatcher(dirPath);
Log.Info("Watching Setting Dir: {0}", dirPath);
}
watcher.IncludeSubdirectories = false;
watcher.Path = dirPath;
watcher.NotifyFilter = NotifyFilters.LastWrite;
watcher.Filter = "*";
watcher.EnableRaisingEvents = true;
watcher.InternalBufferSize = 2048;
watcher.Changed += (sender, e) =>
{
Log.LogConsole_MultiThread("Setting changed: {0}", e.FullPath);
action.Invoke(path);
};
}
#endif
/// <summary>
/// whether or not using file system file, in unity editor mode only
/// </summary>
public static bool IsFileSystemMode
{
get
{
if (IsEditor)
return true;
return false;
}
}
}
}
``` |
Centre Avenue or Center Avenue may refer to:
Centre Avenue station, a Long Island Rail Road station in East Rockaway, New York, U.S.
Centre Avenue (Pittsburgh), Pennsylvania, U.S.
Center Avenue Neighborhood Residential District, Bay City, Michigan, U.S. |
```go
package client
import (
"io"
"net/http"
"net/url"
"golang.org/x/net/context"
"github.com/docker/distribution/reference"
"github.com/docker/docker/api/types"
)
// ImagePull requests the docker host to pull an image from a remote registry.
// It executes the privileged function if the operation is unauthorized
// and it tries one more time.
// It's up to the caller to handle the io.ReadCloser and close it properly.
//
// FIXME(vdemeester): there is currently used in a few way in docker/docker
// - if not in trusted content, ref is used to pass the whole reference, and tag is empty
// - if in trusted content, ref is used to pass the reference name, and tag for the digest
func (cli *Client) ImagePull(ctx context.Context, refStr string, options types.ImagePullOptions) (io.ReadCloser, error) {
ref, err := reference.ParseNormalizedNamed(refStr)
if err != nil {
return nil, err
}
query := url.Values{}
query.Set("fromImage", reference.FamiliarName(ref))
if !options.All {
query.Set("tag", getAPITagFromNamedRef(ref))
}
resp, err := cli.tryImageCreate(ctx, query, options.RegistryAuth)
if resp.statusCode == http.StatusUnauthorized && options.PrivilegeFunc != nil {
newAuthHeader, privilegeErr := options.PrivilegeFunc()
if privilegeErr != nil {
return nil, privilegeErr
}
resp, err = cli.tryImageCreate(ctx, query, newAuthHeader)
}
if err != nil {
return nil, err
}
return resp.body, nil
}
// getAPITagFromNamedRef returns a tag from the specified reference.
// This function is necessary as long as the docker "server" api expects
// digests to be sent as tags and makes a distinction between the name
// and tag/digest part of a reference.
func getAPITagFromNamedRef(ref reference.Named) string {
if digested, ok := ref.(reference.Digested); ok {
return digested.Digest().String()
}
ref = reference.TagNameOnly(ref)
if tagged, ok := ref.(reference.Tagged); ok {
return tagged.Tag()
}
return ""
}
``` |
Numerous women enlisted and fought as men in the American Civil War.
Historian Elizabeth D. Leonard writes that, according to various estimates, between five hundred and one thousand women enlisted as soldiers on both sides of the war, disguised as men.
A-B
Mollie Bean served with the Confederate Army under the name Melvin Bean. She was captured by the Union Army in February 1865 near Richmond, Virginia.
Mary and Molly Bell, cousins who both served with the Confederate Army.
Malinda Blalock (1842 – 1901 or 1903) was a female soldier who fought on both sides during the Civil War. She followed her husband and joined the 26th North Carolina Regiment of the Confederate Army, disguising herself as a young man and calling herself Samuel Blalock. The couple eventually escaped across Confederate lines and joined the Union partisans in the Appalachian mountains of western North Carolina.
Disguised as a man, Florena Budwin (1844–1865) enlisted in the Union Army in Philadelphia with her husband, an artillery captain. Captured by the Confederacy in 1864, she was confined at the notoriously brutal Andersonville Prison, and the transferred to Florence Stockade. Her status was discovered while under treatment for pneumonia, and she died, age 20.
Mary Burns (1821–1863), or John Burns, was an American woman who disguised herself as a man in order to fight in the war. She enlisted in the 7th Michigan Volunteer Cavalry Regiment in order not to be parted from her lover, who was in the same regiment.
C-D
Albert Cashier (1843–1915) was Irish-born and served three years in the Union Army as a male soldier. Cashier lived the next fifty years as a man. Cashier's regiment was part of the Army of the Tennessee under Ulysses S. Grant and fought in approximately forty battles, including the Siege of Vicksburg. During this campaign, Cashier was captured while performing reconnaissance, but managed to escape and return to the regiment.
Frances Clayton (c. 1830–after 1863) enlisted in the Union Army under the name Jack Williams, along with her husband. Clayton's exploits became known after the war, and there is some contradictory information in reports but most accounts say they enlisted in a Missouri unit, despite being from Minnesota. Clayton is said to have fought in 18 battles including Shiloh, Stones River, and Fort Donelson where she was wounded.
was a 16-year-old schoolgirl from Lake Mills, Wisconsin who enlisted as a soldier in a Wisconsin regiment with her brother. Although she disguised herself as a man by cutting off her hair and donned men's clothing, her sex was suspected because of how she put on her shoes and socks. She was discovered to be female before her regiment left for the front.
At the age of fourteen, Lizzie Compton enlisted in the army, falsifying her age and changing her name. Compton saw considerable action during the war, serving in seven different regiments, holding the record for the most reenlistments. While being treated for injuries after a riding incident, the doctor revealed her status as a woman, and she was discharged. In her eighteen months in the army, she served in three cavalry units and two infantry. She fought at the Battle of Antietam and was wounded, and at the Battle of Gettysburg, where she was wounded again and discharged, and fought several other battles as well.
Pauline Cushman (1833–1893) was an American actress and spy for the Union Army. She is considered one of the most successful Civil War spies. She fraternized with Confederate officials and managed to conceal battle plans and drawings in her shoes, but was caught twice in 1864 and brought before Confederate General Braxton Bragg, tried by a military court, and sentenced to death by hanging but was spared by the arrival of Union troops.
Catherine E. Davidson fought at Antietam, and saw her lover wounded in the battle.
E-H
Sarah Emma Edmonds (1841–1898) served with the Union Army disguised as a man named Frank Thompson.
Nellie Graves was a female soldier who served in secret as a man in the Union Army alongside her close friend Fanny Wilson. Both saw action at the battles of Fredericksburg and Chancellorsville. Their status as women was discovered while they were being treated for an illness, and both were discharged.
Mary Jane Green
Better known as "Mountain Charley", Elsa Jane Forest Guerin published a memoir about her life, purporting to relate her "thirteen years in male attire"; it was published in Iowa in 1861. She enlisted in the Union Army in Iowa as "Charles Hatfield", she spied on the Confederates and attained the rank of first lieutenant.
Frances Hook
Sophronia Smith Hunt (1846–1928) was an American woman who disguised herself as a man and secretly served as a soldier in the Union Army. Her first soldier husband died after he was wounded at the Battle of Jenkins' Ferry. They served in the 29th Iowa Infantry Regiment.
I-Q
Maria Lewis, also known as George Harris, was a soldier in the Union army and former slave who gained distinction in the Eighth New York Cavalry.
Annie Lillybridge was from Detroit, and enlisted in the 21st Michigan Infantry Regiment to be near her fiancé. She hid her identity from everyone, including even him until she was wounded and discharged after being discovered.
Elizabeth A. Niles (1842 - 1920) served in the Union Army. After her husband enlisted in the 14th Vermont Infantry she joined him, and participated in numerous battles, including First Battle of Bull Run, Antietam, and Gettysburg. She remained undetected, and mustered out in September 1864, with her husband.
Mary Owens enlisted with her husband in the 9th Cavalry in Pennsylvania, posing as his brother. After he died in combat, Owens remained for an additional eighteen months, fought three battles, and was wounded in each.
Frances Elizabeth Quinn was an Irish born Union Army soldier who fought in both the infantry and cavalry. She enlisted over five separate times throughout the war and the country, assuming the name Frank Miller, and other names. Each time she was eventually discovered to be a woman and discharged from the military. In Alabama, she was captured by the Confederate Army and force-marched to Atlanta, where she was shot during an escape attempt.
S-Z
Loreta Janeta Velazquez a.k.a. "Lieutenant Harry Buford" (June 26, 1842 – ) – A Cuban woman who donned Confederate garb and served as a Confederate officer and spy during the war.
Sarah Rosetta Wakeman (1843-1864) served with the Union Army under the alias of Lyons Wakeman and Edwin R. Wakeman. Her letters remain one of the few surviving primary accounts of female soldiers in the American Civil War.
was a woman who disguised herself as a man and used the alias Lt. Henry Benford in order to raise and lead a company of Texas Confederates. She and the company participated in the Battle of Shiloh.
Fanny Wilson enlisted as a soldier in the Union Army along with her close friend Nellie Graves. They served in the defense of Washington, D.C. until December 1862, when they participated in the Battle of Fredericksburg. After being treated for an illness, their sex was discovered and they were discharged. After some time as a civilian, Wilson joined the 3rd Illinois Cavalry, and was wounded at the Battle of Vicksburg. She recovered and continued on with her regiment. She was discharged after being discovered in August 1863.
Unknown
A dismounted soldier of the 5th West Virginia cavalry, who refused to take cover from confederate artillery bombardment until the nearby Col. Hayes (future president Rutherford B. Hayes, then commanding an infantry regiment) did so during an engagement near New River, after the battle of Cloyd Mountain, was mortally wounded by an artillery shell. The soldiers were shocked to discover this soldier was female while attempting to treat the wounds.
Female confederate soldier belonging to a Louisiana regiment, described by the British colonel Arthur Fremantle, who travelled through the confederacy for over 3 months in 1863 as a war tourist. He wrote; "A goodish-looking woman was pointed out to in my car as having served as a private soldier in the battles of Perryville and Murfreesboro. Several men in my car had served with her in a Louisianian regiment, and they said she had been turned out a short time since for her bad and immoral conduct. They told me that her sex was notorious to all the regiment, but no notice had been taken of it so long as she conducted herself properly. They also said that she was not the only representative of the female sex in the ranks. When I saw her she wore a soldier's hat and coat, but had resumed her petticoats."
See also
Gender stereotypes
List of wartime cross-dressers
List of women warriors in folklore
Timeline of women in 19th century warfare
Timeline of women in early modern warfare
Timeline of women in war in the United States, Pre-1945
Wartime cross-dressing
Women in the military
Women in war
Women in warfare and the military in the 19th century
Women warriors in literature and culture
References
External links
Female soldiers
Civil War Soldiers
Soldiers
Civil War
Civil War |
```javascript
//
// 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. AND ITS CONTRIBUTORS ``AS IS'' AND ANY
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
// WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
// DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS 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.
description(
"Tests that DFG silent spill and fill of WeakJSConstants does not result in nonsense."
);
function foo(a, b, c, d)
{
a.f = 42; // WeakJSConstants corresponding to the o.f transition get created here.
var x = !d; // Silent spilling and filling happens here.
b.f = x; // The WeakJSConstants get reused here.
var y = !d; // Silent spilling and filling happens here.
c.f = y; // The WeakJSConstants get reused here.
}
var Empty = "";
for (var i = 0; i < 1000; ++i) {
var o1 = new Object();
var o2 = new Object();
var o3 = new Object();
eval(Empty + "foo(o1, o2, o3, \"stuff\")");
shouldBe("o1.f", "42");
shouldBe("o2.f", "false");
shouldBe("o3.f", "false");
}
``` |
Franz Christian Gau (15 June 1790, in Cologne – January 1854, in Paris) was a French architect and archaeologist of German descent.
In 1809 he entered the Académie des Beaux-Arts, Paris, and in 1815 visited Italy and Sicily. In 1817 he went to Nubia, and while there he made drawings and measurements of all the more important monuments of that country, his ambition being to produce a work which should supplement the great work of the French expedition in Egypt. The result of his labours appeared in a folio volume (Stuttgart and Paris, 1822), entitled Antiquitiés de la Nubie ou monuments inédits des bords du Nil, situés entre la première et la seconde cataracte, dessinés et mesurés in 1819. It consists of sixty-eight plates, of plans, sections, and views, and was received as an authority. His next publication was the completion of Francois Mazois's work on the ruins of Pompeii.
In 1825 Gau was naturalized as a French citizen, and later became Architect of the City of Paris. He directed the restoration of the churches of Saint-Julien-le-Pauvre, and Saint-Séverin, and built the great prison of La Roquette, etc. With his name also is associated the revival of Gothic architecture in Paris - he having designed and commenced, in 1846, the erection of the Church of Sainte-Clotilde, the first modern church erected in the capital in that style. Illness compelled him to relinquish the care of supervising the work, and he died before its completion.
Gau was mentor to Gottfried Semper.
Sources
The entry cites:
Imperial Dict. Univ. Biog.;
Michaud, Biog. Univ.
1790 births
Architects from Cologne
1854 deaths
Archaeologists from North Rhine-Westphalia
Naturalized citizens of France
Architects from Paris
École des Beaux-Arts alumni
Burials at Montmartre Cemetery |
```go
// contributor license agreements. See the NOTICE file distributed with
// this work for additional information regarding copyright ownership.
//
// path_to_url
//
// Unless required by applicable law or agreed to in writing, software
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
package main
import (
"beam.apache.org/learning/katas/core_transforms/cogroupbykey/cogroupbykey/pkg/task"
"context"
"github.com/apache/beam/sdks/v2/go/pkg/beam"
"github.com/apache/beam/sdks/v2/go/pkg/beam/log"
"github.com/apache/beam/sdks/v2/go/pkg/beam/x/beamx"
"github.com/apache/beam/sdks/v2/go/pkg/beam/x/debug"
)
func main() {
ctx := context.Background()
p, s := beam.NewPipelineWithRoot()
fruits := beam.Create(s.Scope("Fruits"), "apple", "banana", "cherry")
countries := beam.Create(s.Scope("Countries"), "australia", "brazil", "canada")
output := task.ApplyTransform(s, fruits, countries)
debug.Print(s, output)
err := beamx.Run(ctx, p)
if err != nil {
log.Exitf(ctx, "Failed to execute job: %v", err)
}
}
``` |
Anders Christian Lunde (24 October 1809, Copenhagen – 26 October 1886, Copenhagen) was a Danish landscape painter, a minor participant in the Golden Age of Danish painting. He painted his native Denmark including the north of Zealand and the island of Bornholm while also showing an interest in Mediterranean landscapes.
Biography
Lunde was the son of teahouse manager Svend Svendsen Lunde (1776–1846) and Johanna Johanne Michaeline (born Møller; 1769–1849). After an apprenticeship as a house painter, he studied at the Academy, winning both its silver medals (1833–35).
He began to exhibit in 1834 as a portrait painter but soon switched to landscapes, following in the footsteps of Louis Gurlitt in depicting the Italian countryside. While he gained some attention, he never became well-known.
In 1842, Lunde traveled to Italy, though he had not received a scholarship. However the work he sent home raised so much interest that he was later awarded a two-year stipendium and only returned to Denmark in 1847.
In 1857, he was in line to become a member of the Academy, but when his membership application was almost complete, the Academy's charter changed and as a result he never became a member.
The Statens Museum for Kunst has only bought one of his juvenile works but a larger image, Frederiksborg Castle, painted for Frederik VII in 1850, was the gift of a Russian grand duke.
Style
Lunde paid great attention to detail in his landscapes. His best works reconcile his interest in detail with a masterly representation of nature while his less successful paintings barely do more than convey the scene. Especially in his paintings of the Italian countryside, his contemporaries noted similarities with Gurlitt's efforts to add a more idealistic approach to his meticulous studies of nature.
References
Danish landscape painters
1809 births
1886 deaths
Painters from Copenhagen
19th-century Danish painters
Danish male painters
19th-century Danish male artists |
Paul Michael Borrington (born 24 May 1988) is an English cricketer. He is a right-handed batsman and a right-arm off-break bowler who played for Derbyshire.
Despite a disappointing debut which saw him only score four runs, against Leicestershire before being dismissed, in September 2005, he later played his part in getting Derbyshire up to what was then their highest ever total of 707-7 declared, thanks to two innings in excess of 150 from Steve Stubbings and Hassan Adnan, against Somerset. He signed a three-year contract extension in July 2011.
Borrington's father, Anthony, also played first-class cricket for Derbyshire.
References
External links
1988 births
English cricketers
Derbyshire cricketers
Living people
Loughborough MCCU cricketers
People educated at Repton School
English cricketers of the 21st century
Cricketers from Nottingham |
Ayungon (; ), officially the Municipality of Ayungon, is a 2nd class municipality in the province of Negros Oriental, Philippines. According to the 2020 census, it has a population of 47,102 people.
Attractions include the Karalaon Bird Sanctuary, the subterranean area of the Mabato Caves, and the Pagsalsalan Twin Falls (Maaslum Falls).
Ayungon is from Dumaguete.
History
It is said that Ayungon is derived from the name of a deaf man, “Ayung,” who cut down a “dungon” tree. Old municipal profiles refer to Ayungon as Todos los Santos though there are no legends to explain that Hispanic name, just as there are no tales elaborating on the ruins of apparently Hispanic fortifications on the Tampocon II shoreline, perhaps because Ayungon's colonial past was not entirely its own: for many years it was a mere barrio of Tayasan, until 1924 when Governor General Leonard Wood came to establish Ayungon as a full-fledged municipality.
Geography
Ayungon is located on the midriff of Oriental Negros’ northern stretch, approximately two hours from Dumaguete.
Of only three virgin forests said to be still remaining on Negros Island, one is located in barangay Banban.
Barangays
Ayungon is politically subdivided into 24 barangays. Each barangay consists of puroks and some have sitios.
Amdus
Anibong
Atabay
Awa-an
Ban-ban
Calagcalag
Candana-ay
Carol-an
Gomentoc
Inacban
Iniban
Jandalamanon
Kilaban
Lamigan
Maaslum
Mabato
Manogtong
Nabhang
Poblacion
Tambo
Tampocon I
Tampocon II
Tibyawan
Tiguib
Climate
Demographics
Economy
Ayungon is mostly rural with vast rice fields, dense coconut groves and expansive plantations of sugar cane, bananas and pineapple.
Education
The public schools in the town of Ayungon are administered by two school districts under the Schools Division of Negros Oriental.
Elementary schools:
Amdus Elementary School — Amdus
Anibong Elementary School — Anibong
Awa-an Elementary School — Awa-an
Ayungon Central Elementary School — Nat'l Highway, Poblacion
Banban Elementary School — Banban
Buenavista Elementary School — Atabay
Calagcalag Elementary School — Calagcalag
Candana-ay Elementary School — Candana-ay
Canlukduhan Elementary School — Sitio Canlukduhan, Gomentoc
Carol-an Elementary School — Carol-an
Duli-Duli Elementary School — Sitio Duli-Duli, Tibyawan
Gomentoc Elementary School — Gomentoc
Inacban Elementary School — Inacban
Iniban Elementary School — Iniban
Jandalamanon Elementary School — Jandalamanon
Kilaban Elementary School — Kilaban
Lamigan Elementary School — Lamigan
Libtacon Elementary School — Sitio Libtacon, Banban
Maaslum Elementary School — Maaslum
Mabato Elementary School — Mabato
Manogtong Elementary School — Manogtong
Nabalian Elementary School — Sitio Nabalian, Carol-an
Nabhang Elementary School — Nabhang
So-ok Elementary School — Sitio So-ok, Mabato
South Poblacion Elementary School — Nat'l Highway, Tampocon II
Talanyog Elementary School — Sitio Talanyog, Carol-an
Tambo Elementary School — Tambo
Tampocon I Elementary School — Tampocon I
Tibyawan Elementary School — Tibyawan
Tiguib Elementary School — Tiguib
Tumampon Elementary School — Sitio Tumampon, Tiguib
High schools:
Ayungon National High School — Nat'l Highway, Tampocon I
Ayungon NHS - Carol-an Extension — Carol-an
Ayungon Science High School — Todos Los Santos Street, Tampocon II
Mabato Provincial Community High School — Mabato
Tambo National High School — Tambo
Private schools:
Negros Academy — Enardecido Street, Tampocon II
References
External links
[ Philippine Standard Geographic Code]
Philippine Census Information
Official Website
Local Governance Performance Management System
Municipalities of Negros Oriental |
Christian Peter "Alphons" Maria Joseph Bellesheim (16 December 1839 Monschau, Germany - 5 February 1912 Aachen, Germany) was a church historian. He also reviewed and collected books.
Family
Alphons was the son of Heinrich "Wilhelm" Ludwig Joseph Bellesheim (26 December 1801 Essen, Germany - 1867 Aachen, Germany) and Maria Anna "Margaretha" Dumesnil (15 March 1797 Aachen, Germany - 1866 Aachen, Germany). His parents were married on 27 June 1838 in Monschau, Germany. Alphons' paternal grandparents were Carl Anton Bellesheim and Maria Josepha Helena Hennekes. His maternal grandparents were Carl Dumesnil and Christina Windhagen.
Alphons had one known brother, Hugo Franz Julius Bellesheim. Hugo was born on 3 February 1841 in Monschau and married to Hulda Caecilia Kelsch on 4 October 1866 in Aachen. A Hugo Bellesheim, aged 27 years, arrived at the Port of New York on 30 August 1867 having departed from Hamburg, Germany on the ship Germanic. It is unknown, but assumed that the two are the same.
Further research is being done into the family of Alphons Bellesheim. Please see the external link below for contact to the researcher.
Life
The son of the pharmacist s Wilhelm Bellesheim (1801-1867) studied Roman Catholic theology at the universities of Bonn and Tübingen and attended thereafter the theological college of Cologne. After his ordination of priest s in the year 1862 he was assumed as chaplain at the Santa Maria dell'Anima, where he was active 1862 and where he obtained his doctorate in the last month of his time in Rome.
After his return to Germany he became vicar at the Cologne Cathedral and also secretary of the general vicariate. As a result of the Kulturkampf in the 1870th he had to quit his tasks. Subsequently, in the following more than 25 years he was active in the scientific-theological research and published a lot of publications, including 10 books, 4 brochures, 148 essays and 77 inscriptions in dictionaries. One of his focus areas was the history of Christianity of the British Isles.
Finally in 1902 Bellesheim was appointed as provost at the Aachen Cathedral and he practised this ministry until his death in 1912 and was in the meantime honoured with the title as a Protonotary apostolic.
Publications and books (option)
Giuseppe Cardinal Mezzofanti : Ein Lebensbild aus der Kirchengeschichte des 18. und 19. Jahrhunderts, Woerl, Würzburg 1879
Die Elementarschulen im katholischen England, Foesser, Frankfurt a. M. 1882
History of the Catholic Church of Scotland: From the Introduction of Christianity to the Present Day. Clarke Press. February 2008.
Geschichte der Katholischen Kirche in Schottland von der Einführung des Christenthums bis auf die Gegenwart, Vol. 1−2, Kirchheim, Mainz 1883
Wilhelm Cardinal Allen und die englischen Seminare auf dem Festlande, Mainz 1885
Geschichte der Katholischen Kirche in Irland von der Einführung des Christenthums bis auf die Gegenwart, Vol. 1−3, Kirchheim, Mainz 1890/91
Henry Edward Manning ; Cardinal-Erzbischof von Westminster (1808–1892), Kirchheim, Mainz 1892
Charles Cardinal Lavigerie, Erzbischof von Karthago und Primas von Afrika (1825–1892), In: Der Katholik, Zeitschrift für katholische Wissenschaft und kirchliches Leben, 27. Jg., Mag. 3, P. 248–266 und Mag. 4, P. 356–377, Kirchheim, Mainz 1897
References
Hermann-Josef Reudenbach: Stiftspropst Alfons Bellesheim (1839–1912) und das Buch: ein Beitrag zur Kirchengeschichte und zur Geschichte der Buchkultur. Libelli Rhenani: Schriften der Erzbischöflichen Diözesan- und Dombibliothek zur rheinischen Kirchen- und Landesgeschichte sowie zur Buch- und Bibliotheksgeschichte, 14. Erzbischöfliche Diözesan- und Dombibliothek, Cologne 2006
August Brecher: Ein Leben im Dienst der Wissenschaft und des Aachener Münsters. Stiftpropst Dr. Alfons Bellesheim 1839–1912, in: Zeitschrift des Aachener Geschichtsvereins 96, 1989, S. 209–372
Ingeborg Schild/Elisabeth Janssen: Der Aachener Ostfriedhof, publisher Mayersche Buchhandlung, Aachen 1991, . S. 386–388.
1839 births
1912 deaths
People from Monschau
19th-century German Roman Catholic priests |
```javascript
import { test } from '../../test';
export default test({
test({ assert, component, target, window }) {
const allow = target.querySelector('.allow-propagation');
const stop = target.querySelector('.stop-propagation');
allow?.dispatchEvent(new window.MouseEvent('click', { bubbles: true }));
stop?.dispatchEvent(new window.MouseEvent('click', { bubbles: true }));
assert.equal(component.foo, true);
assert.equal(component.bar, false);
}
});
``` |
Junia Calvina was a Roman noblewoman who lived in the 1st century AD.
Biography
The daughter of Aemilia Lepida and Marcus Junius Silanus Torquatus, consul in 19, Calvina belonged to two patrician houses: the gens Aemilia and gens Junia respectively. She was also the great-great-granddaughter of the Roman emperor Caesar Augustus on her mother's side of the Imperial family. As such, she was also related by blood to the gens Julia, the aristocratic family of the Roman dictator Julius Caesar. Tacitus calls Calvina "festivissima puella" and the Emperor Vespasian, in one of his jokes, mentions her as living in AD 79. Seneca describes her as "most celebrated of all women (she whom all called Venus)."
Calvina may have been married to Gaius Sallustius Passienus Crispus and had a daughter named Sallustia Calvina with him, this woman married Publius Ostorius Scapula.
Calvina was married to Lucius Vitellius, the brother of Aulus Vitellius, in the 1st century AD. Despite, or rather because of their blood relation to the first emperor of Rome, Calvina's close family was often persecuted by their kinsmen, particularly the lineal descendants of Livia Drusilla, Augustus' third wife and the first Roman empress. Calvina and Vitellius were divorced in AD 49 following allegations of incest with her younger brother, Lucius Junius Silanus Torquatus, who was forced to commit suicide shortly thereafter. In the same year, Calvina was exiled from Rome by Emperor Claudius, only to be recalled a decade later by his successor, Nero.
With Nero's suicide in AD 68, the Julio-Claudian dynasty collapsed and gave way to the Roman civil war known as the Year of the Four Emperors. By then Calvina was one of Augustus' few remaining descendants who survived the fall of Rome's first Imperial dynasty.
References
1st-century Roman women
Junii Silani
Julio-Claudian dynasty
Ancient Roman exiles |
Amalia Pérez Vázquez (born 10 July 1973) is a Mexican powerlifter in the - bracket. She has four times been a Paralympic champion and is the only powerlifter in the world to have Paralympic champion in three divisions.
Pérez has been a member of the Mexican delegation to the Paralympic Games since 2000. It was her participation of 2000 Summer Paralympics that won Pérez her first silver medal in the powerlifting event, and she would again win a silver medal in the 2004 Summer Paralympics in Athens, but this time in the event. At the 2008 Summer Paralympics, Pérez won her first gold medal in the 52kg event and surpass the Pan-American record with a lifted weight of . She would do this again four years later at the 2012 Summer Paralympics, this time with a lifted weight of . In 2016, she won the gold medal in the women's 55 kg event at the 2016 Summer Paralympics held in Rio de Janeiro, Brazil. She also won the gold medal in the women's 61 kg event at the 2020 Summer Paralympics held in Tokyo, Japan.
At the continental level, Pérez won a gold medal 2007 Parapan American Games in Rio de Janeiro in the 52kg event and broke the world Paralympic powerlifting record with on 14 August 2007. At the 2011 Parapan American Games held in Guadalajara, she received the gold medal in the women's 44kg - 60kg event.
In 2008, Pérez received the National Mexican Sports Award.
In 2021, she won the gold medal in her event at the 2021 World Para Powerlifting Championships held in Tbilisi, Georgia.
References
External links
Living people
1977 births
Female powerlifters
Paralympic powerlifters for Mexico
Paralympic gold medalists for Mexico
Paralympic silver medalists for Mexico
Powerlifters at the 2000 Summer Paralympics
Powerlifters at the 2004 Summer Paralympics
Powerlifters at the 2008 Summer Paralympics
Powerlifters at the 2012 Summer Paralympics
Powerlifters at the 2016 Summer Paralympics
Powerlifters at the 2020 Summer Paralympics
Medalists at the 2000 Summer Paralympics
Medalists at the 2004 Summer Paralympics
Medalists at the 2008 Summer Paralympics
Medalists at the 2012 Summer Paralympics
Medalists at the 2016 Summer Paralympics
Medalists at the 2020 Summer Paralympics
Paralympic medalists in powerlifting
Medalists at the 2007 Parapan American Games
Medalists at the 2011 Parapan American Games
Medalists at the 2015 Parapan American Games
Medalists at the 2019 Parapan American Games
Sportspeople from Mexico City
20th-century Mexican women
21st-century Mexican women |
Hocus Pocus, or What's the Hurry, Son? is a 1990 novel by Kurt Vonnegut.
Plot summary
In an editor's note at the beginning of the book, Vonnegut claims to have found hundreds of scraps of paper of varying sizes, from wrapping paper to business cards, sequentially numbered by their author to form a narrative. The breaks between pieces of paper often signal a sort of ironic "punchline".
The main character is Eugene Debs Hartke, a Vietnam War veteran and carillonneur who realizes that he has killed exactly as many people as the number of women he has had sex with. The character's name is an homage to American labor and political leader Eugene V. Debs and anti-war senator Vance Hartke, both from Vonnegut's home state, Indiana. Upon his discharge from the military, Hartke becomes a professor at Tarkington College in the Finger Lakes region of upstate New York, but is later fired for sexual misconduct.
Hartke then becomes a teacher at a private prison in the nearby town of Scipio. The prison is run by a Japanese corporation and overseen by Hartke's occasional acquaintance, Hiroshi Matsumoto. The prison is populated entirely by black inmates, America having been resegregated by both race and class. Hartke sets about teaching the inmates how to read.
After a massive prison break, the escaped inmates occupy Tarkington College and take the staff hostage. With the old prison destroyed in the breakout, Tarkington becomes a prison with Hartke as its warden. When it becomes known that the breakout was led by one of his former students, Hartke is accused of collaboration and becomes an inmate himself.
Upon completion of the riddle on the final page Eugene's number of sexual partners and confirmed kills is found to be 82.
Film adaptation
In March 2021, Uri Singer acquired the rights to adapt the novel into a film.
References
1990 American novels
Nonlinear narrative novels
Novels by Kurt Vonnegut
Novels set in New York (state)
Postmodern novels |
Asif Kamran Dar (born April 16, 1966) is a former boxer from Pakistan, competing in the lightweight (– 60 kg) division. He was born in Quetta.
A resident of Toronto, Ontario he represented Pakistan at the 1984 Summer Olympics in Los Angeles, where he was eliminated in the second round. Afterwards he competed for Canada, representing that country at the 1988 Summer Olympics in Seoul, South Korea where he was also eliminated in the second round. He won the gold medal in the same weight division, two years earlier, at the 1986 Commonwealth Games, beating Welshman Neil Haddock in the final. He also represented Canada at the 1987 Pan American Games.
References
External links
1966 births
Living people
Canadian people of Kashmiri descent
Lightweight boxers
Boxers at the 1984 Summer Olympics
Boxers at the 1986 Commonwealth Games
Boxers at the 1987 Pan American Games
Boxers at the 1988 Summer Olympics
Boxers from Toronto
Commonwealth Games gold medallists for Canada
Pan American Games competitors for Canada
Olympic boxers for Canada
Olympic boxers for Pakistan
Pakistani male boxers
Pakistani emigrants to Canada
Naturalized citizens of Canada
Pakistani people of Kashmiri descent
Sportspeople from Quetta
Canadian male boxers
Canadian sportspeople of Pakistani descent
Commonwealth Games medallists in boxing
Medallists at the 1986 Commonwealth Games |
Zwanowice may refer to:
Zwanowice, Brzeg County, Opole Voivodeship (south-west Poland)
Zwanowice, Nysa County, Opole Voivodeship (south-west Poland)
Żwanowice, Kuyavian-Pomeranian Voivodeship (north-central Poland) |
Nabila Tizi-Sadki (born 20 March 1984) is an Algerian team handball player. She plays for the club Brest Bretagne Handball, and on the Algerian national team. She competed at the 2013 World Women's Handball Championship in Serbia, where Algeria placed 22nd, and Tizi was top scorer for the Algerian team.
References
1984 births
Living people
People from Akbou
Algerian female handball players
21st-century Algerian people |
Yelizaveta Nikolayevna Osetinskaya (; born 3 May 1977, Moscow) is a Russian journalist and media manager. She is notable as a former editor-in-chief of the Russian edition of Forbes (2011–2013) and RBC (2014–2016). Her reforms at RBC helped make it one of the most-cited Russian media holdings. Under her editorship, RBC emphasized investigative journalism, with highlights including the participation of Russian troops in the War in Donbass and the business connections of president Vladimir Putin's family.
Biography
Family and early years
Osetinskaya was born in Moscow in 1977. Her father Nikolay Iosifovich Osetinskiy was a professor in the Gubkin Russian State University of Oil and Gas. She graduated from Moscow public school №1543 in 1994.
Osetinskaya is an alumna of the MSU Faculty of Economics, graduating in 1998. During her students years, in 1995 she started reporting for RBC.
Career
Between November 1999 and April 2011 Osetinskaya worked for Vedomosti. She started as a correspondent and gradually rose to editor-in-chief position. In 2005 she obtained an MBA in a joint program of RANEPA and the Kingston University; in the same year she started as a radio host on ‘Echo of Moscow’.
In 2009 Vedomosti had a conflict with Oleg Deripaska's Rusal. The newspaper published data on $5.98billion losses of Rusal in 2008 and $720million losses in the first six months of 2009. Rusal lawyers accused the newspaper for disclosing business secrets and demanded to reveal the sources, despite prohibition of such revealing enshrined in state Media Law. The company also tried to forbid Vedomosti to publish any news on its account. Osetinskaya spoke out publicly and condemned the intimidation of the journalists. Due to her positions, the Media Workers Union wrote an open letter to Deripaska, demanding to end pressure on the media. Later on, Vedomisti continued to write about Deripaska's companies and Rusal.
Between May 2011 and December 2013, Osetinskaya was the editor-in-chief of the Russian edition of Forbes.
In January 2014 she started as the editor-in-chief of business-news conglomerate RBC, which included the television network, the website, the daily newspaper, and the magazine.
On 13 May 2016, together with two more editors of the RBC Information Systems, she was fired with immediate effect. It is believed that this was a consequence of the publication about the Panama Papers and their connections to Vladimir Putin. Earlier that year, she was named a 2016–17 International John S. Knight Journalism Fellow at Stanford University. In the same year, she also received a scholarship to the Investigative Reporting Program at the University of California, Berkeley. After graduation, she returned to Russia and launched The Bell, a six-person media start-up, independent of oligarch or state money.
In December 2017, Osetinskaya launched her own Youtube show ‘Russkie Norm’ (trans. ‘Russians are Okay’) where she interviewed successful Russian scientists and businessmen, living abroad.
In July 2020, she signed a letter in support of journalist , who was accused for state treason by the Russian authorities.
Crackdown
Osetinskaya condemned the 2022 Russian invasion of Ukraine. She also stopped releasing her ‘Russkie Norm’ show, explaining that ‘now it would be cynical to speak about talents, business and development’. Instead, she started a series of interviews with political analysts, economists and other experts, trying to analyze Russia's future in economics. On April 1, 2022, she was declared foreign agent by the Russian Ministry of Justice.
References
1977 births
Living people
Russian women journalists
Russian magazine editors
Women magazine editors
People listed in Russia as media foreign agents
Moscow State University alumni
Russian activists against the Russian invasion of Ukraine |
The Red Beans and Rice Bowl is the name of the rivalry between the Central Arkansas Bears and the McNeese Cowboys. The winner of the game receives a bronzed bowl trophy. The name of the game was chosen by the two schools to recognize the importance of the rice industry in Louisiana and Arkansas. The two teams have met thirteen times on the football field, with Central Arkansas leading 7–6.
Game results
See also
List of NCAA college football rivalry games
References
College football rivalries in the United States
Central Arkansas Bears football
McNeese Cowboys football |
```xml
<vector xmlns:android="path_to_url" android:height="34.0dp" android:tint="?attr/colorControlNormal" android:viewportHeight="15" android:viewportWidth="15" android:width="34.0dp">
<path android:fillColor="@android:color/white" android:pathData="M12 0C13 0 13 0 13 1L13 14C13 15 13 15 12 15L3 15C2 15 2 15 2 14L2 1C2 0 2 0 3 0L12 0zM10 12L4 12L4 13L10 13L10 12zM12 9L11 9L11 9.75L12 9.75L12 9zM10 2L4 2L4 10L10 10L10 2zM12 7.5L11 7.5L11 8.25L12 8.25L12 7.5zM12 6L11 6L11 6.75L12 6.75L12 6zM12 4.5L11 4.5L11 5.25L12 5.25L12 4.5z"/>
<path android:fillColor="@android:color/white" android:pathData="M8 4C7.25 4 7 4.75 7 4.75C7 4.75 6.75 4 6 4C5.5 4 5 4.5 5 5.25C5 6.5 6.75 8 7 8C7.25 8 9 6.5 9 5.25C9 4.5 8.5 4 8 4z"/>
</vector>
``` |
Zlatibor Lončar (; born 3 August 1971) is a Serbian doctor and politician who served as minister of health from 2014 to 2022.
Education and career
Lončar finished primary and secondary school in Belgrade, and later enrolled at the Faculty of Medicine, University of Belgrade, which he finished in 1997. In 1998, he started the specialization of general surgery and finished in 2003. In 2008, he enrolled in a PhD in Medical Epidemiology.
From 2012, he served as a director of the Emergency Center within the Clinical Centre of Serbia and from 2013 as the head of Transplantation department.
Minister of Health
On April 27, 2014, following the 2014 Serbian parliamentary election he was appointed as the minister of Health in the first cabinet of Aleksandar Vučić. His appointment was heavily criticized, among others by group of doctors at the Clinical Centre of Serbia, due to the "lack of professional skills", unexplained origin of wealth and criminal connections. After the 2016 Serbian parliamentary election, he remained as part of the second cabinet of Aleksandar Vučić.
In February 2017, the Prime Minister of Serbia Aleksandar Vučić decided to run for the 2017 Serbian presidential elections. He won the elections in the first round and was sworn as the President of Serbia on 31 May 2017. Weeks later, he gave mandate to Ana Brnabić to form the governmental cabinet. On 29 June 2017, the cabinet of Ana Brnabić was formed, with Lončar keeping his office.
Accusations of criminal connections
According to the testimonies of several Zemun Clan members, Lončar had close relationship with the head of the criminal group Dušan Spasojević.
According to the 2004 testimony of the cooperative witness Dejan Milenković Bagzi (who was an important member of the Zemun Clan) in the Zoran Đinđić trial, in Serbian Special Court for Organised Crime: on 5 September 2002, Belgrade-based Rakovica Clan tried to eliminate the Montenegrin criminal Veselin Božović Vesko, but he survived the assassination and was transferred to the Clinical Centre of Serbia in which at that time worked Lončar. Allegedly, he had good chances to survive and his condition was stable. According to Milenković, head of the criminal group Dušan Spasojević who also had interest of Božović's death, asked one of his insider doctors Risović to finish him in the hospital, but he was having second thoughts. Later, allegedly, another Spasojević's insider doctor, Lončar confessed to Spasojević that he gave him lethal injection and Božović died shortly after, on 7 September 2002. For the reward, Spasojević gave him apartment in New Belgrade. Officially, ten days after Božović's death, Lončar bought the apartment from the wife of Zemun Clan hitman Sretko Kalinić for 30,000 euros only to re-sell it months later. Miladin Suvajdžić, another cooperative witness and former important member of the Zemun Clan, in his 2006 testimony confirmed the story of Milenković; one of the main roles of Suvajdžić was to buy properties, vehicles for various of reasons. At the time of testimonies, Lončar denied these allegations and was never prosecuted.
In 2005, convicted Zemun Clan member Milomir Kaličanin testified that many police officers, footballers and doctors Lončar and Risović often came to Zemun Clan headquarters.
In January 2017, following the political battle with former ally Prime Minister Aleksandar Vučić and alleged assassination attempt, Serbian politician Velimir Ilić showed media several photos of Lončar and notorious Zemun Clan now deceased head Dušan Spasojević, along with other criminal members and footballers Dragoljub Jeremić and Danko Lazović who were interrogated during the Operation Sabre. The photos were taken in period prior to the Zemun Clan assassination of Zoran Đinđić, while Lončar was studying for specialization thesis in general surgery.
Serbian Prime Minister Vučić backed minister saying that Lončar told him that: "the photo was taken after Lončar completed surgery on Spasojević's father and later called him to a nearby café to thank him". Ilić replied saying that the specialization students cannot operate surgeries.
Personal life
He is married to Vesna Lončar with whom he has a daughter. According to the Serbian tabloid Alo!, the other male infant twin died after the birth; for the release of private information to the public, Lončar sued the tabloid and then Alo! apologized to his family. According to one group of doctors at the Clinical Centre of Serbia, Lončar has paid 3,000 euros daily over 60 days for the treatment of newborn daughter in Vienna.
His wife Vesna is a lawyer and has also served as a chairman of the supervisory board of Pošta Srbije. She has represented many Serbian criminals and suspicious figures close to the Serbian political leadership, including drug lord Darko Šarić close associates, Sreten Jocić, Predrag Mali, brother of the Mayor of Belgrade Siniša Mali and even close family members of the Serbian Prime Minister Aleksandar Vučić – brother Andrej Vučić and general director of Elektromreža Srbije Nikola Petrović.
References
External links
Zlatibor Lončar Biography
1971 births
Living people
Physicians from Belgrade
Government ministers of Serbia
University of Belgrade Faculty of Medicine alumni
Politicians from Belgrade
Serbian Progressive Party politicians |
Kalipso Chalkidou (born in 1976) is the Head of Health Finance at The Global Fund to Fight AIDS, Tuberculosis and Malaria and a Visiting Professor at Imperial College London. Previously she was Director of Global Health Policy at the Center for Global Development and Professor of Practice in Global Health at Imperial College London. Her research considers how local expertise can inform the allocation of scientific and healthcare resources.
Early life and education
Chalkidou was born in Greece. Her earliest ambition was to become a train driver. Instead, Chalkidou became a physician. She originally studied medicine at the National and Kapodistrian University of Athens. She completed a doctoral degree in molecular biology at Newcastle University. She has said that one of her greatest inspirations was Che Guevara. Whilst completing her doctoral research, Chalkidou completed her clinical rotations in basic surgery. Her research considered novel therapies for prostate cancer.
Research and career
After earning her doctorate Chalkidou joined National Institute for Health and Care Excellence (NICE) as Associate Director of Research. In this capacity, she evaluated novel healthcare technologies and reviewed the social value judgements of the NICE committees. She held an honorary position at the London School of Hygiene & Tropical Medicine, where she studied applications of pharmacoeconomics in Japan.
In 2007 Chalkidou joined the Johns Hopkins Bloomberg School of Public Health, where she was made a Harkness fellow in Health Policy and Practice. As part of her fellowship, Chalkidou studied how to translate evidence into a research agenda. She argued that healthcare decision making should be rooted in research policies. On her return to the United Kingdom Chalkidou helped to set up National Institute for Health and Care Excellence (NICE) International. Here she established the International Decision Support Initiative (IDSI), a network of policy makers, researchers and development experts which was largely funded by the Bill & Melinda Gates Foundation.
Chalkidou moved to Imperial College London in 2016. In 2018 Bill & Melinda Gates Foundation awarded Chalkidou and IDSI a $14.5 million grant to expand healthcare access in the developing world. IDSI works with governments in the developing world to support their health policy, looking to achieve value-for-money in the medical decision making. With IDSI, Chalkidou led national health reform programmes in Colombia, India and the Middle East. She supported Tanzania in their prioritisation list of essential medicines, which freed up essential resources for more effective treatments.
Chalkidou was Director of Global Health Policy and Senior Fellow at the Center for Global Development. Her research focussed on helping governments improve health policy.
From 2019, she was a research lead at the Jameel Institute (J-IDEA) at Imperial.
She was appointed to the Board of Directors at the International Society for Pharmacoeconomics and Outcomes Research (ISPOR) in 2020.
She is currently the Head of Health Finance at The Global Fund to Fight AIDS, Tuberculosis and Malaria.
Select publications
References
1976 births
Living people
Academics of Imperial College London
National and Kapodistrian University of Athens alumni
Alumni of Newcastle University |
Orkan ("Hurricane") is the eighth full-length album by Swedish folk metal band Vintersorg. As with the previous two albums, the lyrics are all in Swedish. This is the second of a planned four-album concept series based on the elements, the first being Jordpuls.
Track listing
Personnel
Vintersorg
Andreas Hedlund - vocals, guitars (acoustic, lead, rhythm), bass, keyboards, programming
Mattias Marklund - guitars (lead, rhythm)
Guest musicians and staff
Cia Hedmark - female vocals on "Norrskenssyner"
Kris Verwimp - cover art, booklet
Orjan Fredriksson - photography
Produced, engineered, mastered and mixed by Vintersorg
References
Vintersorg albums
2012 albums
Napalm Records albums |
The year 1814 in archaeology involved some significant events.
Explorations
Stamford Raffles becomes the first European to explore Borobudur in Central Java.
Excavations
Colosseum, Rome: The arena substructure is partly excavated during 1810-1814.
Finds
Kritonios Crown is found in Armento, Italy.
Publications
Births
23 January: Alexander Cunningham, father of the Archaeological Survey of India (d. 1893)
2 September: Ernst Curtius, conducted archaeological research in the late 19th century; primarily interested in Greek archaeology (d. 1896)
Deaths
References
See also
Roman Forum - excavations.
Archaeology
Archaeology by year
Archaeology
Archaeology |
James Walton (1479/80–1546/50), of Preston, Lancashire, was an English politician.
Career
He was Mayor of Preston in 1526–27, ?1532–33, ?1533–34 and 1546.
He was a Member (MP) of the Parliament of England for Preston in 1529.
References
1480 births
16th-century deaths
Mayors of Preston, Lancashire
English MPs 1529–1536 |
Ivan Nechepurenko () is a Russian writer and journalist. Born in St Petersburg in 1986, he lives in Moscow and serves as a reporter for The New York Times. His writings have also been published by The Moscow Times (reprinted by The Guardian), The Aspen Institute, Kyiv Post, The Insider, GQ Russia and Slon.ru website. Nechepurenko has closely collaborated with Carnegie Moscow Center and The International Crisis Group and appeared on the BBC, CBC, France 24, CTV, i24news among other media outlets. He travels widely inside and outside Russia, interviewing many prominent figures. He wrote extensively on Russia's image in the West and specialized in writing about Russian culture, politics, and foreign policy. Nechepurenko earned bachelor's degree from the University of Calgary, where he studied under John Ferris and master's degree at the London School of Economics and Political Science, where he studied under Roy Allison.
References
External links
The Moscow Times page
1986 births
Living people
Alumni of the London School of Economics
Russian male journalists
The Moscow Times people |
Éloyse Lesueur (born 15 July 1988) is a French long jumper.
Career
Lesueur became the first woman from France to win a long jump gold medal at the European Championships when she won the 2012 European Championships long jump event in Helsinki by jumping 6.81 meters in the final.
Lesueur currently holds the French national indoor record of 6.90 m. This record was set in the final of the 2013 European Indoor Championships in Gothenburg, where she won the silver medal.
Lesueur withdrew from the 2015 World Championships in Athletics because of torn ligaments in her right knee sustained during training in May 2015.
Results in international competitions
Note: Only the position and distance in the final are indicated, unless otherwise stated. (q) means the athlete did not qualify for the final, with the overall position and distance in the qualification round indicated.
References
External links
1988 births
Living people
French female long jumpers
Sportspeople from Créteil
Black French sportspeople
Athletes (track and field) at the 2012 Summer Olympics
Olympic athletes for France
European Athletics Championships medalists
World Athletics Indoor Championships winners
IAAF Continental Cup winners |
```php
<?php
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
*/
namespace Google\Service\Genomics;
class ContainerStartedEvent extends \Google\Model
{
/**
* @var int
*/
public $actionId;
/**
* @var string
*/
public $ipAddress;
/**
* @var int[]
*/
public $portMappings;
/**
* @param int
*/
public function setActionId($actionId)
{
$this->actionId = $actionId;
}
/**
* @return int
*/
public function getActionId()
{
return $this->actionId;
}
/**
* @param string
*/
public function setIpAddress($ipAddress)
{
$this->ipAddress = $ipAddress;
}
/**
* @return string
*/
public function getIpAddress()
{
return $this->ipAddress;
}
/**
* @param int[]
*/
public function setPortMappings($portMappings)
{
$this->portMappings = $portMappings;
}
/**
* @return int[]
*/
public function getPortMappings()
{
return $this->portMappings;
}
}
// Adding a class alias for backwards compatibility with the previous class name.
class_alias(ContainerStartedEvent::class, 'Google_Service_Genomics_ContainerStartedEvent');
``` |
```c++
#include <boost/test/unit_test.hpp>
#include <fc/bloom_filter.hpp>
#include <fc/exception/exception.hpp>
#include <fc/reflect/variant.hpp>
#include <iostream>
#include <fc/variant.hpp>
#include <fc/io/raw.hpp>
#include <fstream>
#include <fc/io/json.hpp>
#include <fc/crypto/base64.hpp>
using namespace fc;
static bloom_parameters setup_parameters()
{
bloom_parameters parameters;
// How many elements roughly do we expect to insert?
parameters.projected_element_count = 100000;
// Maximum tolerable false positive probability? (0,1)
parameters.false_positive_probability = 0.0001; // 1 in 10000
// Simple randomizer (optional)
parameters.random_seed = 0xA5A5A5A5;
if (!parameters)
{
BOOST_FAIL( "Error - Invalid set of bloom filter parameters!" );
}
parameters.compute_optimal_parameters();
return parameters;
}
BOOST_AUTO_TEST_SUITE(fc_crypto)
BOOST_AUTO_TEST_CASE(bloom_test_1)
{
try {
//Instantiate Bloom Filter
bloom_filter filter(setup_parameters());
uint32_t count = 0;
std::string line;
std::ifstream in("README.md");
std::ofstream words("words.txt");
while( !in.eof() && count < 100000 )
{
std::getline(in, line);
// std::cout << "'"<<line<<"'\n";
if( !filter.contains(line) )
{
filter.insert( line );
words << line << "\n";
++count;
}
}
// wdump((filter));
auto packed_filter = fc::raw::pack_to_vector(filter);
// wdump((packed_filter.size()));
// wdump((packed_filter));
std::stringstream out;
// std::string str = fc::json::to_string(packed_filter);
auto b64 = fc::base64_encode( packed_filter.data(), packed_filter.size() );
for( uint32_t i = 0; i < b64.size(); i += 1024 )
out << '"' << b64.substr( i, 1024 ) << "\",\n";
}
catch ( const fc::exception& e )
{
edump((e.to_detail_string()) );
}
}
BOOST_AUTO_TEST_CASE(bloom_test_2)
{
try {
//Instantiate Bloom Filter
bloom_filter filter(setup_parameters());
std::string str_list[] = { "AbC", "iJk", "XYZ" };
// Insert into Bloom Filter
{
// Insert some strings
for (std::size_t i = 0; i < (sizeof(str_list) / sizeof(std::string)); ++i)
{
filter.insert(str_list[i]);
}
// Insert some numbers
for (std::size_t i = 0; i < 100; ++i)
{
filter.insert(i);
}
}
// Query Bloom Filter
{
// Query the existence of strings
for (std::size_t i = 0; i < (sizeof(str_list) / sizeof(std::string)); ++i)
{
BOOST_CHECK( filter.contains(str_list[i]) );
}
// Query the existence of numbers
for (std::size_t i = 0; i < 100; ++i)
{
BOOST_CHECK( filter.contains(i) );
}
std::string invalid_str_list[] = { "AbCX", "iJkX", "XYZX" };
// Query the existence of invalid strings
for (std::size_t i = 0; i < (sizeof(invalid_str_list) / sizeof(std::string)); ++i)
{
BOOST_CHECK( !filter.contains(invalid_str_list[i]) );
}
// Query the existence of invalid numbers
for (int i = -1; i > -100; --i)
{
BOOST_CHECK( !filter.contains(i) );
}
}
}
catch ( const fc::exception& e )
{
edump((e.to_detail_string()) );
}
}
BOOST_AUTO_TEST_SUITE_END()
``` |
The Money Drop Myanmar () is a Burmese reality television game show which is airing on Channel 7. It is based on British Gameshow, Million Pound Drop. The show has been airing since 2017.
Game format
This show can be participated with two contestants. Contestants are presented with eight multiple-choice questions. Contestants will get Ks.2,50,00,000/- for answer this questions.
At the beginning of each round, they will be given two categories to choose one. Each of the first four questions contains four possible answers and the next three have three and the last two. It has different drops and one is the correct answer. Then they asked the question, contestants will choose in a set time (60 seconds) to split all the money.
If the contestants are unsure about this question, they may distribute as much as two or more money as they think is necessary. Contestants will cancel one drop and splits the money on the other drops. Contestants can stop at any time if they are satisfied with their choice.
If the timer is stopped or the time has elapsed, it will open up for incorrect answers. The rest of the money left on the correct answer may go to the next question. This process is repeated until the last question is answered. If the contestants correctly answer the final question, all the remaining money will be owned.
References
External links
Burmese television series
Television game shows
Endemol Shine Group franchises
Channel 7 (Myanmar) original programming |
This is list of editions of Leza Awards, an Ethiopian music and film award held in Hilton Hotel in Addis Ababa since 2010.
2015
The fifth edition of Leza Awards was scheduled on 1 October 2015 at Hilton Hotel in Addis Ababa. Organized by Birhanu Digaffe, a radio host and producer, the final list of nominees drawn from the field of music and film was released to the public.
Best Music Album
Siwedlat - Madingo Afework
Astaraki - Abinet Agonafir
Meche New - Yosef Gebre
Zebenay - Dan Admasu
Yeneta - Tsehaye Yohanis
Manew Fitsum - Betty G
Best Music Single
"Seba Dereja" - Teddy Afro
"Sidet" - Yegna
"Seifhen Ansa" - Zeritu Kebede
"Alsemam" - Jacky Gossy
"Mal Naweya" - Abinet Agonafir
"Hagere" – Mahmoud Ahmed
"Yefikir Girma" – Tsedenia Gebremarkos
Best Music Video
"Shik Biles" by Yosef Gebre
"Astaraki" by Abinet Agonafir
"Manew Yalew" by Abinet Agonafir
"Tangut" by Madingo Afework
"Nana Demaye" by Betty G
"Keza Sefer" by Tamrat Desta
Best New Album
Zebenay by ዳን አድማሱ(dan admasu)
Ewnet by Hana Girma
Manew Fisum by Betty G
Selamta by Ras Janny
Best Film Score
Tsedenya Gebremarkos in Hareyet
Anteneh Minalu in Lamba
Matias Yilma in Yaye Yifredew
Kasahun Eshetu in Shefu 2
Elias Husein in Fikirena Genzeb
Hailu Amerga in Zetegn Mot
Lifetime Achievement
Maritu legesse
Alemayehu Eshete
Bahta Gebrehiwot
Dawit Yifru
Girma Beyene
Girma Negash
Yohannis Afework
2019
The 9th edition of Sheger FM Radio Leza Radio Show was held on 19 October 2019 at Hilton Hotel. Singer Chelina, who debuted her album in December 2018, took two of the 12 categories of the 9th Leza Listeners' Award - Album of the Year and Best Artist of the Year. In addition, the most acclaimed feature film named Quragnaye won three categories – Best Feature Film and Best Actress and Best Actor.
Single of the Year ― Presented by Teshome Sisay (Singer/Composer)
"Belba" by Jambo Jote — WINNER
"Ete Abay" by Abrham Belayneh "Sey" by Ephrem Amare
"Tilobign" by Rahel Getu
"Adimera" Yared Negu
"Mahiya" Dany Magna
Best Actor in Television Series
Presented by Kurabachew Deneke (Playwright)
Abebe Balcha (TV Series: Zemen on EBS) — WINNER
Alemayehu Tadesse (Derso Mels on FANA)
Yigerem Dejene (Mogachoch on EBS)
Million Berhane (Zetenegnaw Shi on FANA)
Solomon Bogale (Zemen on EBS)
Michael Tamire (Min Litazez on FANA)
Best New Artist
Presented by Presented by Kuku Sebsebe (Singer)
Chelina — WINNER
Ziggy Zaga (Behailu Tafesse)
Jacky Gosee
Yohana
Hayleyesus Feyssa (Haile)
Dag Daniel
Best Actor
Presented by Azeb Worku (Playwright)
Zerihun Mulat (film: Quragnaye) — WINNER
Henok Wondimu (Sumalew Vandam)
Tariku Birhanu "Baba" (Mugnu Yarada Lij 4)
Alemseged Assefa (Atifred)
Cherinet Fikadu (Zemene)
Girum Ermiays (Tefetari)
Song of the Year
Presented by Samuel Yirga (Musician and composer)
Serkaleme by Ziggy Zaga (Behailu Tafesse) — WINNER
Bati by Chelina
Maye Kaja by Yohana
Gum Semay by Ziggy Zaga (Behailu Tafesse)
Habesha by Dag Daniel
Selam Yisten by Gossaye Tesfaye
Best Actress
Presented by Aboneh Ashagre (Playwright/ Associate Professor)
Yemisrach Girma (film: Quragnaye) — WINNER
Meskerem Abera (Simet)
Edelework Tassew (Wedefit)
Melat Yirgalem (Berabish)
Shewit Kebede (Wuha ena Werk)
Kalkidan Tibebu (Zemene)
Best TV Series
Presented by Manyazewal Endeshaw (Theater/Film Director)
Derso Mels on FANA (Directed by Meaza Worku; Kiba Multimedia Production/ Amad Film Production) — WINNER
Mogachoch on EBS
Zetenegnaw Shi on Fana
Betoch on ETV
Min Litazez on FANA
Zemen on EBS
Best Album of the Year
Hailu Mergia (Accordionist, keyboardist)
Chelina by Chelina — WINNER
Nigus by Jah Lude
Siyamish Yamegna by Gossaye Tesfaye
Yohana by Yohana
Korma by Ziggy Zaga (Behailu Tafesse)
Balambaras by Jacky Gosee
Best Feature Film
Presented by Abraham Gezahegn (Screen writer, director, producer)
Quragnaye (Directed by Moges Tafesse; Starring Zerihun Mulatu, Tesfaye Demam, Yemisrach Girma, Frehiwot Kelkilew, Feleke Kassa and Henok Zerabiruk)
Tefetari Wedefit Zemene Mognu Yarada Lij 4 Simet Best Actress in Television Series
Presented by Hanna Terefe (Stage and screen actress)
Hanna Yohannes (TV Series: Zemen on EBS) — WINNER
Meskerem Abera (Min Litazez on FANA )
Mekdes Tsegaye (Mogachoch on EBS)
Christy Haile (Derso Mels on FANA)
Mestawet Aragaw (Senselet on EBS)
Martha Getachew (Derso Mels on FANA)
Best Music Video (Clip)
Presented by Hamelmal Abate (Singer)
"Ke Ehud Eske Ehud" – Gossaye Tesfaye — WINNER
"Benetselay"– Dawit Nega
"Mircha Alat" – Yohana
"Say Bay" – Chelina
"Yebalewa Konjo" – Dag Daniel
Kedamawit – Jacky Gosee
Lifetime Achievement Award Recipient
Presented by Elias Tebabal (Singer)
2022
The 12th edition of Leza Awards was held on 25 May 2022.
Best Single Music: Rophnan – SOSTBest Video Clip: Tilahun Gessesse – "Qome Limereqesh"
Best New Singer: Elias Melka and Dawit Tsige
Best Song of the Year: Meselu Fantahun – "Limeta Woyes Mita"
Best Drama Series: EregnayeBest Drama Series Actor: Million Berhane (Zetenegnaw Shi)
Best Drama Series Actress Direbworq Seyfu (Eregnaye)
Best Actress: Meskerem Abere (Ensaro)
Best Actor: Amanuel Habtamu (Ensaro)
Best Film: EnsaroBest Album: Dawit Tsige (Yene Zema'')Lifetime Award''': Selam Seyoum
References
Lists of awards |
State Route 370 (SR 370) is a north–south state highway in Union County, Tennessee. It connects the community of Potato Valley with the cities of Plainview and Maynardville.
Route description
SR 370 begins just northwest of Plainview at an intersection with SR 144. It goes northeast as an unnamed roadway between two ridges before joining Bull Run Road after crossing a ridge. The highway, now known as Bull Run Road, goes down a valley as it passes through the community of Potato Valley. SR 370 then leaves the community and continues northeast through farmland to come to an end at an intersection with SR 61 just southeast of Maynardville. The entire route of SR 370 is a rural two-lane highway.
Major intersections
References
370
Transportation in Union County, Tennessee |
```javascript
import { LazyClientComponent } from './dynamic-imports/react-lazy-client'
import { NextDynamicClientComponent } from './dynamic-imports/dynamic-client'
import {
NextDynamicServerComponent,
NextDynamicServerImportClientComponent,
NextDynamicNoSSRServerComponent,
} from './dynamic-imports/dynamic-server'
export default function page() {
return (
<div id="content">
<LazyClientComponent />
<NextDynamicServerComponent />
<NextDynamicClientComponent />
<NextDynamicServerImportClientComponent />
<NextDynamicNoSSRServerComponent />
</div>
)
}
``` |
Grabno may refer to the following places:
In Poland:
Grabno, Lesser Poland Voivodeship (south Poland)
Grabno, Łódź Voivodeship (central Poland)
Grabno, Lubusz Voivodeship (west Poland)
Grabno, Pomeranian Voivodeship (north Poland)
Grabno, Warmian-Masurian Voivodeship (north Poland)
Grabno, Szczecinek County in West Pomeranian Voivodeship (north-west Poland)
Grabno, Świdwin County in West Pomeranian Voivodeship (north-west Poland)
In Slovenia:
Gradno, a settlement in the Municipality of Brda (known as Grabno until 1952) |
Foro Interno: Anuario de Teoría Política is an open access peer-reviewed academic journal covering political theory that was established in 2000. The editor-in-chief is Javier Roiz (Complutense University of Madrid). The journal was established with the support of the Universidad Complutense de Madrid, the Universidad de Salamanca, and the Universidad de Alicante. Since 2004, it is published by the Servicio de Publicaciones (Universidad Complutense de Madrid). It appears annually, in December, in both paper and electronic format. The journal is abstracted and indexed in Difusión y Calidad Editorial (DICE), Dialnet, Latindex, International Bibliography of the Social Sciences, and the Philosopher's Index.
Foro Interno has also published relevant books as the Colección Rétor. The first book was published in 2002. This collection of books was integrated into the catalogue of the Servicio de Publicaciones de la Universidad Complutense in 2007, within the Key Thinkers Collection, which has since published two more books.
External links
Political science journals
Academic journals established in 2001
Spanish-language journals
Complutense University of Madrid
Academic journals published by university presses
Annual journals |
Tuckermanella is a genus of lichen-forming fungi in the family Parmeliaceae.
Taxonomy
The genus was circumscribed in 2003 by lichenologist Ted Essingler to contain s previously placed in the "Cetraria fendleri" species group. The genus names honors the American lichenologist Edward Tuckerman.
In 2017, Pradeep Divakar and colleagues used a then-recently developed "temporal phylogenetic" approach to identify temporal bands for specific taxonomic ranks in the family Parmeliaceae, suggesting that groups of species that diverged within the time window of 29.45–32.55 million years ago represent genera. They proposed to synonymize Tuckermanella with Nephromopsis, along with several other Parmelioid genera, so that all the genera within the Parmeliaceae are about the same age. Although some of their proposed taxonomic changes were accepted, the synonymization of the Parmelioid genera with Nephromopsis was not accepted in a later critical analysis of the temporal phylogenetic approach for fungal classification.
Description
Tuckermanella lichens have small- to medium-sized foliose (leafy) thalli, and are generally brown to blackish-green in colour. They have continuous pseudocyphellae (tiny pores that allow gas exchange) on the margins of their lobes. Tuckermannopsis and Melanohalea are similar in appearance, although species in those genera are typically larger and lack the continuous marginal pseudocyphellae.
Species
Tuckermanella arizonica
Tuckermanella coralligera
Tuckermanella fendleri
Tuckermanella pseudoweberi
Tuckermanella rickieae – Mexico
Tuckermanella subfendleri
Tuckermanella weberi
References
Parmeliaceae
Lichen genera
Lecanorales genera
Taxa described in 2003
Taxa named by Theodore Lee Esslinger |
```xml
<?xml version="1.0" encoding="UTF-8"?>
<!--
~ contributor license agreements. See the NOTICE file distributed with
~ this work for additional information regarding copyright ownership.
~
~ path_to_url
~
~ Unless required by applicable law or agreed to in writing, software
~ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-->
<project xmlns="path_to_url" xmlns:xsi="path_to_url" xsi:schemaLocation="path_to_url path_to_url">
<modelVersion>4.0.0</modelVersion>
<parent>
<groupId>org.apache.shardingsphere</groupId>
<artifactId>shardingsphere-logging</artifactId>
<version>5.5.1-SNAPSHOT</version>
</parent>
<artifactId>shardingsphere-logging-core</artifactId>
<name>${project.artifactId}</name>
<dependencies>
<dependency>
<groupId>org.apache.shardingsphere</groupId>
<artifactId>shardingsphere-logging-api</artifactId>
<version>${project.version}</version>
</dependency>
<dependency>
<groupId>org.apache.shardingsphere</groupId>
<artifactId>shardingsphere-mode-api</artifactId>
<version>${project.version}</version>
</dependency>
<dependency>
<groupId>org.apache.shardingsphere</groupId>
<artifactId>shardingsphere-test-it-yaml</artifactId>
<version>${project.version}</version>
<scope>test</scope>
</dependency>
<dependency>
<groupId>ch.qos.logback</groupId>
<artifactId>logback-classic</artifactId>
<scope>compile</scope>
</dependency>
</dependencies>
</project>
``` |
```yaml
{{- /*
*/}}
{{- if .Values.kustomizeController.serviceAccount.create }}
apiVersion: v1
kind: ServiceAccount
metadata:
name: {{ include "flux.kustomize-controller.serviceAccountName" . }}
namespace: {{ .Release.Namespace | quote }}
{{- $versionLabel := dict "app.kubernetes.io/version" ( include "common.images.version" ( dict "imageRoot" .Values.kustomizeController.image "chart" .Chart ) ) }}
{{- $labels := include "common.tplvalues.merge" ( dict "values" ( list .Values.commonLabels $versionLabel ) "context" . ) }}
labels: {{- include "common.labels.standard" ( dict "customLabels" $labels "context" $ ) | nindent 4 }}
app.kubernetes.io/part-of: flux
app.kubernetes.io/component: kustomize-controller
{{- if or .Values.kustomizeController.serviceAccount.annotations .Values.commonAnnotations }}
{{- $annotations := include "common.tplvalues.merge" ( dict "values" ( list .Values.kustomizeController.serviceAccount.annotations .Values.commonAnnotations ) "context" . ) }}
annotations: {{- include "common.tplvalues.render" ( dict "value" $annotations "context" $) | nindent 4 }}
{{- end }}
automountServiceAccountToken: {{ .Values.kustomizeController.serviceAccount.automountServiceAccountToken }}
{{- end }}
``` |
Bender: The Beginning, also known as Ostap Bender. The Beginning () is a 2021 Russian action adventure comedy film directed by Igor Zaytsev, a prequel to The Twelve Chairs from the production company Sreda.
It stars Sergey Bezrukov as Ibrahim Bender, and Aram Vardevanyan in the role was dedicated to Ostap Bender-Zadunaisky.
It is scheduled to be theatrically released on 24 June 2021.
Plot
The film is set in 1919. A young idealist named Osip ran into a Turkish swindler, Ibrahim Bender, who, like Osip, hunts for a royal relic. Osip learns from Ibrahim flattery, deception, blackmail and brute force, falls in love with a fatal beautiful foreigner and becomes the legendary Ostap Bender.
Cast
Sergey Bezrukov as Ibrahim Suleiman Berta-Maria Bender-Bey
Aram Vardevanyan as Osip "Osya" Zadunaisky (Ostap Bender-Zadunaisky)
Nikita Kologrivyy as Mishka Yaponchik
Taisiya Vilkova as Eva Machulskaya, a swindler
Natalya Bochkareva as Madame Tsits
Georgy Shtil as Fuks
Aleksandr Tsekalo as Mark Sokolovich
Yuliya Rutberg as Madame Sokolovich
Yuliya Makarova as Sofi Sokolovich
Olga Sutulova as Osip's mother
Garik Kharlamov as Valiadis, host cabaret
Artyom Tkachenko as Staff captain Ametistov, military commandant of Solnechnomorsk
Aleksandr Ilin as Mendel Vinnitsky, Mishka's father
Yuri Kolokolnikov as Grigory Kotovsky
Pavel Derevyanko as Nestor Makhno
Andrey Levin as Leon Trotsky
Richard Lappers as Mr. Armand Hammer
Production
The film was shot by the Sreda company, owned by Aleksandr Tsekalo, and the television channel Russia-1. The film was directed by Igor Zaytsev.
Bender: The Beginning is the first part of the series, followed by the films Bender: Gold of the Empire and Bender: The Final Hustle.
It is assumed that later on from these pictures a single series about Ostap Bender will be created.
See also
Bender: Gold of the Empire – Part 2 (2021 film)
Bender: The Final Hustle – Part 3 (2021 film)
References
External links
2021 films
2020s Russian-language films
2021 action adventure films
2021 action comedy films
2020s adventure comedy films
Russian action adventure films
Russian action comedy films
Russian adventure comedy films
Films about the Russian Empire
Films based on television series
Russian prequel films |
An ala (Latin for "wing", plural: alae) was the term used during the middle of the Roman Republic (338–88 BC) to denote a military formation composed of conscripts from the socii, Rome's Italian military allies. A normal consular army during the period consisted of two legions, composed of only Roman citizens, and two allied alae.
The alae were somewhat larger than normal legions, 5,400 or 5,100 men against the legion's 4,500 men, and it contained a greater quantity of cavalry, usually 900 horsemen against the 300 supplied by the Romans.
From the time of the first Roman emperor, Augustus (ruled 27 BC – AD 14), the term ala was used in the professional imperial army to denote a much smaller (ca. 500), purely cavalry unit of the non-citizen auxilia corps: see ala (Roman cavalry unit).
History
When the Roman armies started being composed partly of Roman citizens and partly of socii (allies from the rest of the Italian mainland), either Latini or Italici, it became the practice to marshal the Roman troops in the centre of the battle line and the socii upon the wings. Consular armies of the mid-Republic would consist of two legions of Roman citizens and two legions of "ala", with the ala supplying thirty turmae of cavalry per legion, whereas the Roman provided only ten turmae. Hence ala and alarii denoted the contingent furnished by the allies, both horse and foot, and the two divisions were distinguished as dextera ala (right wing) and sinistra ala (left wing).
As late as Polybius' times, contingents of allies forming the alae were recruited by their own leaders in their homelands, which were expected to levy an equivalent number to the Roman troops; the specifications of those agreements were covered in the formula togatorum. They were managed by six Roman officers called praefecti sociorum, equivalent to the legion's six military tribunes, who were chosen from the equestrian order by the consul at charge However, Rome would also trust on their allied commander themselves, with outstanding examples like the Frentani Oblacus Volsinius or the Campanian Decius Vibellius during the Pyrrhic War.
Socii were expected to fight in the same manner and equipment as the Roman troops and provide their own basic rations, and were in turn would receive a percentage of any loot gained, although at a lower rate than their Roman equivalents.
References
Sources
Ann Hyland: Equus: The Horse in the Roman World,
Adrian Goldsworthy: The Complete Roman Army,
William Smith, ed.: A Dictionary of Greek and Roman Antiquities, John Murray, London, 1875
Citations
Roman auxiliaries
Socii |
```c
/*your_sha256_hash---------
*
* recovery_gen.c
* Generator for recovery configuration
*
*
*your_sha256_hash---------
*/
#include "postgres_fe.h"
#include "common/logging.h"
#include "fe_utils/recovery_gen.h"
#include "fe_utils/string_utils.h"
static char *escape_quotes(const char *src);
/*
* Write recovery configuration contents into a fresh PQExpBuffer, and
* return it.
*/
PQExpBuffer
GenerateRecoveryConfig(PGconn *pgconn, char *replication_slot)
{
PQconninfoOption *connOptions;
PQExpBufferData conninfo_buf;
char *escaped;
PQExpBuffer contents;
Assert(pgconn != NULL);
contents = createPQExpBuffer();
if (!contents)
{
pg_log_error("out of memory");
exit(1);
}
/*
* In PostgreSQL 12 and newer versions, standby_mode is gone, replaced by
* standby.signal to trigger a standby state at recovery.
*/
if (PQserverVersion(pgconn) < MINIMUM_VERSION_FOR_RECOVERY_GUC)
appendPQExpBufferStr(contents, "standby_mode = 'on'\n");
connOptions = PQconninfo(pgconn);
if (connOptions == NULL)
{
pg_log_error("out of memory");
exit(1);
}
initPQExpBuffer(&conninfo_buf);
for (PQconninfoOption *opt = connOptions; opt && opt->keyword; opt++)
{
/* Omit empty settings and those libpqwalreceiver overrides. */
if (strcmp(opt->keyword, "replication") == 0 ||
strcmp(opt->keyword, "dbname") == 0 ||
strcmp(opt->keyword, "fallback_application_name") == 0 ||
(opt->val == NULL) ||
(opt->val != NULL && opt->val[0] == '\0'))
continue;
/* Separate key-value pairs with spaces */
if (conninfo_buf.len != 0)
appendPQExpBufferChar(&conninfo_buf, ' ');
/*
* Write "keyword=value" pieces, the value string is escaped and/or
* quoted if necessary.
*/
appendPQExpBuffer(&conninfo_buf, "%s=", opt->keyword);
appendConnStrVal(&conninfo_buf, opt->val);
}
if (PQExpBufferDataBroken(conninfo_buf))
{
pg_log_error("out of memory");
exit(1);
}
/*
* Escape the connection string, so that it can be put in the config file.
* Note that this is different from the escaping of individual connection
* options above!
*/
escaped = escape_quotes(conninfo_buf.data);
termPQExpBuffer(&conninfo_buf);
appendPQExpBuffer(contents, "primary_conninfo = '%s'\n", escaped);
free(escaped);
if (replication_slot)
{
/* unescaped: ReplicationSlotValidateName allows [a-z0-9_] only */
appendPQExpBuffer(contents, "primary_slot_name = '%s'\n",
replication_slot);
}
if (PQExpBufferBroken(contents))
{
pg_log_error("out of memory");
exit(1);
}
PQconninfoFree(connOptions);
return contents;
}
/*
* Write the configuration file in the directory specified in target_dir,
* with the contents already collected in memory appended. Then write
* the signal file into the target_dir. If the server does not support
* recovery parameters as GUCs, the signal file is not necessary, and
* configuration is written to recovery.conf.
*/
void
WriteRecoveryConfig(PGconn *pgconn, char *target_dir, PQExpBuffer contents)
{
char filename[MAXPGPATH];
FILE *cf;
bool use_recovery_conf;
Assert(pgconn != NULL);
use_recovery_conf =
PQserverVersion(pgconn) < MINIMUM_VERSION_FOR_RECOVERY_GUC;
snprintf(filename, MAXPGPATH, "%s/%s", target_dir,
use_recovery_conf ? "recovery.conf" : "postgresql.auto.conf");
cf = fopen(filename, use_recovery_conf ? "w" : "a");
if (cf == NULL)
{
pg_log_error("could not open file \"%s\": %m", filename);
exit(1);
}
if (fwrite(contents->data, contents->len, 1, cf) != 1)
{
pg_log_error("could not write to file \"%s\": %m", filename);
exit(1);
}
fclose(cf);
if (!use_recovery_conf)
{
snprintf(filename, MAXPGPATH, "%s/%s", target_dir, "standby.signal");
cf = fopen(filename, "w");
if (cf == NULL)
{
pg_log_error("could not create file \"%s\": %m", filename);
exit(1);
}
fclose(cf);
}
}
/*
* Escape a string so that it can be used as a value in a key-value pair
* a configuration file.
*/
static char *
escape_quotes(const char *src)
{
char *result = escape_single_quotes_ascii(src);
if (!result)
{
pg_log_error("out of memory");
exit(1);
}
return result;
}
``` |
```php
<?php
/*
*
* File ini bagian dari:
*
* OpenSID
*
* Sistem informasi desa sumber terbuka untuk memajukan desa
*
* Aplikasi dan source code ini dirilis berdasarkan lisensi GPL V3
*
* Hak Cipta 2009 - 2015 Combine Resource Institution (path_to_url
* Hak Cipta 2016 - 2024 Perkumpulan Desa Digital Terbuka (path_to_url
*
* Dengan ini diberikan izin, secara gratis, kepada siapa pun yang mendapatkan salinan
* dari perangkat lunak ini dan file dokumentasi terkait ("Aplikasi Ini"), untuk diperlakukan
* tanpa batasan, termasuk hak untuk menggunakan, menyalin, mengubah dan/atau mendistribusikan,
* asal tunduk pada syarat berikut:
*
* Pemberitahuan hak cipta di atas dan pemberitahuan izin ini harus disertakan dalam
* setiap salinan atau bagian penting Aplikasi Ini. Barang siapa yang menghapus atau menghilangkan
* pemberitahuan ini melanggar ketentuan lisensi Aplikasi Ini.
*
* PERANGKAT LUNAK INI DISEDIAKAN "SEBAGAIMANA ADANYA", TANPA JAMINAN APA PUN, BAIK TERSURAT MAUPUN
* TERSIRAT. PENULIS ATAU PEMEGANG HAK CIPTA SAMA SEKALI TIDAK BERTANGGUNG JAWAB ATAS KLAIM, KERUSAKAN ATAU
* KEWAJIBAN APAPUN ATAS PENGGUNAAN ATAU LAINNYA TERKAIT APLIKASI INI.
*
* @package OpenSID
* @author Tim Pengembang OpenDesa
* @copyright Hak Cipta 2009 - 2015 Combine Resource Institution (path_to_url
* @copyright Hak Cipta 2016 - 2024 Perkumpulan Desa Digital Terbuka (path_to_url
* @license path_to_url GPL V3
* @link path_to_url
*
*/
namespace App\Libraries\TinyMCE;
use App\Libraries\DateConv;
class KodeIsianSurat
{
private $dataSurat;
public function __construct($dataSurat)
{
$this->dataSurat = $dataSurat;
}
public static function get($dataSurat): array
{
return (new self($dataSurat))->kodeIsian();
}
public function kodeIsian(): array
{
$DateConv = new DateConv();
return [
[
'judul' => 'Format Nomor Surat',
'isian' => 'format_nomor_surat',
'data' => strtoupper(substitusiNomorSurat($this->dataSurat['no_surat'], ($this->dataSurat['surat']['format_nomor'] == '') ? setting('format_nomor_surat') : $this->dataSurat['surat']['format_nomor'])),
],
[
'judul' => 'Kode',
'isian' => 'kode_surat',
'data' => $this->dataSurat['surat']['kode_surat'],
],
[
'case_sentence' => true,
'judul' => 'Nomer',
'isian' => 'nomer_surat',
'data' => $this->dataSurat['no_surat'],
],
[
'judul' => 'Judul',
'isian' => 'judul_surat',
'data' => $this->dataSurat['surat']['judul_surat'],
],
[
'judul' => 'Tanggal',
'isian' => 'tgl_surat',
'data' => formatTanggal(date('Y-m-d')),
],
[
'judul' => 'Tanggal Hijri',
'isian' => 'tgl_surat_hijrI',
'data' => $DateConv->HijriDateId('j F Y'),
],
[
'case_sentence' => true,
'judul' => 'Tahun',
'isian' => 'tahuN',
'data' => $this->dataSurat['log_surat']['bulan'] ?? date('Y'),
],
[
'judul' => 'Bulan Romawi',
'isian' => 'bulan_romawi',
'data' => bulan_romawi((int) ($this->dataSurat['log_surat']['bulan'] ?? date('m'))),
],
[
'case_sentence' => true,
'judul' => 'Logo Surat',
'isian' => 'logo',
'data' => '[logo]',
],
[
'case_sentence' => true,
'judul' => 'QRCode',
'isian' => 'qr_code',
'data' => '[qr_code]',
],
[
'case_sentence' => true,
'judul' => 'QRCode BSrE',
'isian' => 'qr_bsre',
'data' => '[qr_bsre]',
],
[
'case_sentence' => true,
'judul' => 'Logo BSrE',
'isian' => 'logo_bsre',
'data' => '[logo_bsre]',
],
];
}
}
``` |
Lillian "Lillie" Stella Acer Ballagh Farmer (died April 30, 1938) was the founder of Matinee Musical Club, Los Angeles.
Early life
Lillian "Lillie" Stella Acer was born October 30, in Rochester, New York, the daughter of John Acer and Maria Foster.
Career
Before moving to Southern California, Ballagh was for three consecutive years the president of the Schumann Club in Chicago.
Ballagh was the founder of Matinee Musical Club in 1908. She aspired to an unbroken record of paying for services of artists appearing on the club's program. Matinee Musical adhered to its original aim and was the first club of the kind in Los Angeles to take that stand. In that way, musicians were encouraged and music was advanced in the community.
She was the national chairman of Colonial Relics of the Daughters of the American Revolution.
A wealthy widow in May 1925, Ballagh engaged further in the real estate operations of her late husband with success.
She was a member of the Friday Morning Club, the Ebell of Los Angeles, the Wa-Wan Club, the Colonial Dames of America and Southern California Woman's Press Club.
Personal life
Ballagh moved to California in 1907. She had a summer home at Palisades, State Highway, Santa Monica, California and a winter home at 308 N. Louise St., Glendale, California. She also had a country home, Ballagh Lodge, on Malibu Road.
Lillie Stella Acer married James Henry Ballagh (1851-1925) on April 25, 1883, in Ontario. Ballagh was a pioneer real estate operator. They had two children: Roy Acer and James Courtenay (1889-1966).
She was a widow in 1925 and, on June 26, 1929, she married a second time to Frank Edward Farmer of San Diego, executive of the Bell-Lloyd Corporation. She died on April 30, 1938, and is buried at Forest Lawn Memorial Park (Glendale).
References
1938 deaths
Colonial Dames of America
Daughters of the American Revolution people
Philanthropists from New York (state)
People from Rochester, New York |
The Arkansas Valley National Bank, constructed in 1902, is a two-story, 30 feet x 90 feet sandstone structure located in Pawnee, Oklahoma. Constructed in a Late Victorian architectural style, it was Pawnee's original bank. When the building opened, the bank occupied the first floor, while a doctor, photographer, and local telephone office occupied the second floor. The bank closed around 1918, and the building has served as various storefronts since.
Originally the bank was to be called the Pawnee County Bank, and this name is engraved on the east wall; however it was chartered as the Arkansas Valley National Bank. It was listed on the National Register of Historic Places in 1978.
The building's facade was heavily damaged in a 5.8-magnitude earthquake on September 3, 2016.
References
Buildings and structures in Pawnee County, Oklahoma
Commercial buildings completed in 1902
Pawnee, Oklahoma
National Register of Historic Places in Pawnee County, Oklahoma
Bank buildings on the National Register of Historic Places in Oklahoma |
Loyd Hall Plantation is located in Cheneyville, Louisiana. It was added to the National Register of Historic Places on April 29, 1977.
Loyd Hall was built around 1820 by William Loyd, who was executed in the house by Union troops in 1864 on suspicion of being a double spy for both the Union and the Confederate States of America. He was tarred and feathered and then hanged in front of his home.
In 1934 the plantation was bought by Mary Raxsdale, whose brother John Clarence Raxsdale Sr. supervised renovation of the Hall. After Mary's death in 1946, the plantation was sold to the Fitzgerald family. Today the plantation consists of a 640-acre working farm and a bed and breakfast.
Legends
The spirit of William Loyd is said to be heard walking around the halls of the mansion he built. A slave, Sally Boston, has been sighted, accompanied by the aroma of food cooking.
A Union Army deserter named Harry is thought to have hid in the attic, where he was fatally shot. He is believed to be buried on the grounds, and the sound of his violin is heard late at night.
William Loyd's niece Inez, who died from falling out of a third-floor window, is said to still play the piano. This was apparently after her would-be husband left her at the altar.
References
Houses on the National Register of Historic Places in Louisiana
Georgian architecture in Louisiana
Plantations in Louisiana
Neoclassical architecture in Louisiana
Houses completed in 1850
Houses in Rapides Parish, Louisiana
National Register of Historic Places in Rapides Parish, Louisiana |
Events from the year 1923 in the United States.
Incumbents
Federal government
President: Warren G. Harding (R-Ohio) (until August 2), Calvin Coolidge (R-Massachusetts) (starting August 2)
Vice President: Calvin Coolidge (R-Massachusetts) (until August 2), vacant (starting August 2)
Chief Justice: William Howard Taft (Ohio)
Speaker of the House of Representatives: Frederick H. Gillett (R-Massachusetts)
Senate Majority Leader: Henry Cabot Lodge (R-Massachusetts)
Congress: 67th (until March 4), 68th (starting March 4)
Events
January–March
January 1–7 – The Rosewood massacre, a racially motivated massacre of black people and the destruction of a black town, takes place in Rosewood, Florida.
January 18 – Elon College's campus in North Carolina is destroyed by a fire.
February 5 – United States v. Bhagat Singh Thind: The Supreme Court decides that Bhagat Singh Thind cannot become a naturalized U.S. citizen because, as a Punjabi Sikh, he is not a "white person".
February 23 – The American Law Institute is incorporated.
March 1 – The USS Connecticut is decommissioned.
March 2 – The first issue of Time magazine is published.
March 23 – The governor of Oklahoma signs House Bill 197 with the Montgomery amendment outlawing the theory of evolution in public school textbooks purchased by the state, the first anti-Darwinian legislation passed in the U.S.
April–June
April 1 – Safety Last!, a silent romantic comedy film starring Harold Lloyd, is released.
April 4 – Warner Bros. Film Studio is formally incorporated in the United States, as Warner Brothers Pictures, Inc., by Jack L. Warner, Harry Warner, Sam Warner and Albert Warner.
April 6 – Louis Armstrong makes his first recording, "Chimes Blues", with King Oliver's Creole Jazz Band.
April 18 – The first Yankee Stadium opens its doors in the Bronx, New York City.
May 9 – Southeastern Michigan receives a record of snow after temperatures plummeted from to degrees between 13:00-18:00 on the previous day.
May 15 – Riegelmann Boardwalk at Coney Island officially opened.
May 27 – The Ku Klux Klan defies a law requiring publication of its members.
July–September
July 13 – The Hollywood Sign is inaugurated in California (originally reading Hollywoodland).
August 2 – Vice President Calvin Coolidge becomes the 30th president of the United States, upon the death of President Warren G. Harding.
September 3 – Illustrated Daily News first published in Los Angeles by Cornelius Vanderbilt IV.
September 4 – The United States Navy's first home-built rigid airship USS Shenandoah makes her first flight at Naval Air Station Lakehurst (New Jersey); she contains most of the world's extracted reserves of helium at this time (named and commissioned October 10).
September 8 – Honda Point Disaster: Seven U.S. Navy destroyers run aground off the California coast.
September 17 – 1923 Berkeley Fire: Berkeley, California erupts, consuming some 640 structures, including 584 homes in the densely built neighborhoods north of the campus of the University of California.
September 18–26 – Newspaper printers strike in New York City.
September 24 – Rowan University opens.
September 29 – First American Track & Field championships for women, in New Jersey
October–December
October 1, Mississippi something Road Signs Act came into effect.
October 15 – The New York Yankees defeat the New York Giants (baseball), 4 games to 2, to win their first World Series Title.
October 16 – Roy and Walt Disney found The Walt Disney Company.
October 19 – War Resisters League organized by Jessie Wallace Hughan.
December 10 – Sigma Alpha Kappa (the first social fraternity at a Jesuit college in the United States) is founded at Loyola University New Orleans, making it the first social fraternity at a Jesuit college in the U.S.
December 20 – BEGGARS Fraternity (the second social fraternity at a Jesuit college in the United States) is founded by nine men, who have secured permission to do so from the Pope.
Undated
Soledad C. Chacón takes office as Secretary of State of New Mexico; all subsequent holders of this office through 2011 will also be women.
The Moderation League of New York becomes part of the movement for the repeal of Prohibition in the U.S.
Rainbow trout introduced into the upper Firehole River in Yellowstone National Park.
Ongoing
Lochner era (c. 1897–c. 1937)
U.S. occupation of Haiti (1915–1934)
Prohibition (1920–1933)
Roaring Twenties (1920–1929)
Births
January 1 – Daniel Gorenstein, mathematician (died 1992)
January 16 – Anthony Hecht, poet (died 2004)
January 29
Jack Burke, Jr., golfer and coach
Paddy Chayefsky, writer (died 1981)
January 31 – Norman Mailer, writer (died 2007)
February 2
James Dickey, poet and author (died 1997)
Liz Smith, gossip columnist (died 2017)
February 13
James Abdnor, U.S. Senator from South Dakota from 1981 to 1987 (died 2012)
Chuck Yeager, pilot (died 2020)
February 20 – Helen Murray Free, chemist and educator (died 2021)
February 28
Jean Carson, actress (died 2005)
Charles Durning, actor (died 2012)
March 2 – Bob Chinn, restaurateur (d. 2022)
March 9
James L. Buckley, judge and U.S. Senator from New York from 1971 to 1977 (died 2023)
Wayne B. Warrington Sr., Arizona civil servant (died 1989)
March 10 – Val Logsdon Fitch, nuclear physicist, recipient of the Nobel Prize in Physics (died 2015)
March 12 – Mae Young, wrestler (died 2014)
March 14 – Diane Arbus, photographer (died 1971)
March 27 – Jack O'Neill, businessman (O'Neill surfwear & equipment) (died 2017)
April 1
Leora Dana, actress (died 1983)
Bobby Jordan, actor (died 1965)
April 3 – Daniel Hoffman, poet (died 2013)
April 13
Don Adams, actor and director (died 2005)
Stanley Tanger, businessman and philanthropist, founder of the Tanger Factory Outlet Centers (died 2010)
April 23 – Walter Pitts, logician and cognitive psychologist (died 1969)
April 25
Timothy S. Healy, Jesuit priest and academic administrator (died 1992)
Albert King, blues guitarist and singer (died 1992)
May 1 – Joseph Heller, novelist (died 1999)
May 16 – Merton Miller, economist, recipient of the Nobel Memorial Prize in Economic Sciences (died 2000)
May 27 – Henry Kissinger, United States Secretary of State, recipient of the 1973 Nobel Peace Prize
June 2 – Lloyd Shapley, mathematician, economist and Nobel Prize laureate (died 2016)
June 8 – Malcolm Boyd, priest and author (died 2015)
June 19 – Geri M. Joseph, diplomat and political figure (died 2023)
June 22 – John Oldham, basketball player (died 2020)
July 13 – Ashley Bryan, children's book writer and illustrator (died 2022)
July 14 – Robert Zildjian, musical instrument manufacturer (Sabian) (died 2013)
July 22
Bob Dole, U.S. Senator from Kansas from 1969 to 1996, presidential candidate (died 2021)
The Fabulous Moolah, wrestler (died 2007)
July 31 – Stephanie Kwolek, polymer chemist (died 2014)
August 3 – Jean Hagen, actress (died 1977)
August 10
Rhonda Fleming, screen actress (died 2020)
David H. Rodgers, politician (died 2017)
August 20 – Jim Reeves, country singer (died 1964)
September 1 – Rocky Marciano, boxer (died 1969)
September 3
Glen Bell, entrepreneur, founder of Taco Bell (died 2010)
Mort Walker, cartoonist, creator of Beetle Bailey (died 2018)
September 9 – Daniel Carleton Gajdusek, virologist (died 2008)
September 17 – Hank Williams, country musician (died 1953)
September 18 – Al Quie, politician (died 2023)
September 26 – Jack Oliver, geophysicist (died 2011)
October 1 – Babe McCarthy, basketball coach (died 1975)
October 2 – Hershel W. Williams, Medal of Honour recipient (died 2022)
October 4 – Charlton Heston, film actor (died 2008)
October 20 – Robert Craft, orchestral conductor (died 2015)
October 23
Ned Rorem, composer (died 2022)
Frank Sutton, actor (died 2022)
October 27 – Roy Lichtenstein, pop artist (died 1997)
November 6 – Robert P. Griffin, U.S. Senator from Michigan from 1966 to 1979 (died 2015)
November 8 – Jack Kilby, electrical engineer, recipient of the Nobel Prize in Physics (died 2005)
November 9
Charles Grier Sellers, historian (died 2021)
James Schuyler, poet (died 1991)
November 18
Ted Stevens, U.S. Senator from Alaska from 1968 to 2009 (died 2010)
Alan Shepard, astronaut (died 1998)
November 23
Daniel Brewster, U.S. Senator from Maryland from 1963 to 1969 (died 2007)
Billy Haughton, harness racer and trainer (died 1986)
November 26 – Nat Allbright, sports commentator (died 2011)
December 2 – Maria Callas, singer (died 1977)
December 10 – Harold Gould, actor (died 2010)
December 11
Betsy Blair, film actress (died 2009)
Lillian Cahn, Hungarian-American businesswoman, co-founder of Coach, Inc. (died 2013)
December 12 – Bob Barker, game show host (died 2023)
December 13
Philip W. Anderson, physicist, recipient of the Nobel Prize in Physics (died 2020)
Larry Doby, baseball player (died 2003)
December 23 – James Stockdale, U.S. Navy admiral and vice presidential candidate (died 2005)
December 24 – George Patton IV, U.S. Army general (died 2004)
December 29 – Dina Merrill, actress, heiress, socialite and philanthropist (died 2017)
Deaths
January 1 – Willie Keeler, baseball player (born 1872)
January 18 – Wallace Reid, actor (born 1891)
February 6 – Edward Emerson Barnard, astronomer (born 1857)
February 14 – Charles Henry Turner, African American entomologist (born 1867)
February 15 – Minnie Willis Baines, author (born 1845)
February 24 – Edward W. Morley, scientist (born 1838)
February 26
Walter B. Barrows, naturalist (born 1855)
George Clement Perkins, U.S. Senator from California from 1893 to 1915 (born 1839)
March 3 – Melancthon J. Briggs, lawyer and politician (born 1846)
March 6 – Joseph McDermott, actor (born 1878)
March 15 – Goat Anderson, baseball player (born 1880)
April 6 – Alice Cunningham Fletcher, ethnologist and anthropologist (born 1838)
April 11 – Mary Treat, naturalist (born 1830)
April 28 – Knute Nelson, Governor of Minnesota from 1893 to 1895 and U.S. Senator from Minnesota from 1895 to 1923 (born 1843 in Norway)
August 2 – Warren G. Harding, 29th president of the United States from 1921 to 1923 (born 1865)
August 10 – Laura Redden Searing, deaf poet and journalist (born 1839)
October 19 – Eleanor Norcross, painter (born 1854)
October 23 – Hannah Johnston Bailey, temperance advocate and suffragist (born 1839)
November 11 – Elizabeth Eggleston Seelye, biographer (born 1858)
November 17 – Mary Bigelow Ingham, author, educator, and religious worker (born 1832)
December 28 – Frank Hayes, actor (born 1871)
See also
List of American films of 1923
Timeline of United States history (1900–1929)
References
External links
1920s in the United States
United States
United States
Years of the 20th century in the United States |
Koji Aoyama (青山 浩二, born August 12, 1983) is a Japanese former professional baseball pitcher. He has played in his entire career with the Nippon Professional Baseball (NPB) for the Tohoku Rakuten Golden Eagles.
Career
Tohoku Rakuten Golden Eagles selected Aoyama with the third selection in the .
On March 25, 2006, Aoyama made his NPB debut.
On November 21, 2020, Aoyama announced his retirement.
References
External links
NPB.com
1983 births
Living people
Baseball people from Hokkaido
Japanese baseball players
People from Hakodate
Nippon Professional Baseball pitchers
Tohoku Rakuten Golden Eagles players |
Moneuptychia is a genus of satyrid butterflies found in the Neotropical realm.
Species
Listed alphabetically:
Moneuptychia giffordi Freitas, E.O. Emery & Mielke, 2010
Moneuptychia griseldis (Weymer, 1911)
Moneuptychia itapeva Freitas, 2007
Moneuptychia melchiades (Butler, 1877)
Moneuptychia paeon (Godart, [1824])
Moneuptychia soter (Butler, 1877)
Moneuptychia umuarama (Ebert & Dias, 1997)
References
, 2007: A new species of Moneuptychia Forster (Lepidoptera: Satyrinae, Euptychiina) from the highlands of Southeastern Brazil. Neotropical Entomology 36 (6): 919-925. Full article: .
, 2010: A new species of Moneuptychia Forster (Lepidoptera: Satyrinae: Euptychiina) from central Brazil. Neotropical Entomology 39 (1): 83-90. Full article: .
Euptychiina
Butterfly genera
Taxa named by Walter Forster (entomologist) |
Shahla ( []; ; ; ; ; ; ; ) is a feminine given name used throughout the Muslim world.
It is based on the feminine form of the Arabic adjective () in the sense "whose eyes have ()", which is said to have meant "a blue or greenish hue" in Classical Arabic, or "black with some blueness in them" (navy blue color). Some sources also say "black with redness" (i.e. very dark maroon). Others say the name means "dark-grey-eyed", "hazel-eyed", or simply "who has beautiful eyes".
The colloquial Arabic spelling of the name omits the hamza (as is usually the case when the hamza is in final position), thus rendering , with the stress on the first syllable. Incidentally, omission of the final hamza is also the standard in Persian and Urdu.
Alternate transcriptions include: Chahla, Chahlaa, Chehla, Chehlaa, Shehla, Shehlaa, Shahlaa.
People
Shahla
Shahla Aghapour, Iranian artist, author and gallery director
Shahla Arbabi (born 1945), Iranian-born American artist
Shahla Ata (1959–2015), Afghan politician
Shahla Behrouzirad (born 1985), Iranian paracanoer
Shahla Habibi (1958–2017), Iranian advisor
Shahla Humbatova, Azerbaijani human rights lawyer
Shahla Jahed (1970–2010), Iranian nurse
Shahla Khatun, Bangladeshi physician and professor
Shahla Lahiji (born 1942), Iranian writer, publisher, translator, and publishing house director
Shahla Riahi (1927–2019), Iranian actress and film director
Shahla Sherkat (born 1956), Iranian journalist, author, and activist
Shahla Ujayli (born 1976), Syrian writer
Shahla Safi Zamir (born 1948), Iranian singer
Shahla Zia (1947–2005), Pakistani lawyer and activist
Chahla
Chahla Benmokhtar (born 1997), Algerian volleyball player
Chahla Chafiq (born 1954), Iranian writer and sociologist
Shahlo
Shahlo Mahmudova, Uzbekistani politician
Shehla
Shehla Gill, Pakistani actress
Shehla Masood (1973–2011), Indian environmentalist, wildlife and Right to Information activist
Shehla Pervin, Indian-American breast cancer specialist
Shehla Rashid (born 1988), Indian human rights activist
Shehla Raza (born 1964), Pakistani politician
References
See also
Shahla (disambiguation)
Arabic-language feminine given names
Feminine given names
Azerbaijani feminine given names
Bangladeshi feminine given names
Indian feminine given names
Iranian feminine given names
Pakistani feminine given names |
```javascript
// Node module: microgateway
// LICENSE: Apache 2.0, path_to_url
'use strict';
var supertest = require('supertest');
var microgw = require('../lib/microgw');
var backend = require('./support/invoke-server');
var apimServer = require('./support/mock-apim-server/apim-server');
var dsCleanup = require('./support/utils').dsCleanup;
var resetLimiterCache = require('../lib/rate-limit/util').resetLimiterCache;
var zlib = require('zlib');
describe('invokePolicy', function() {
var request;
before(function(done) {
// Use production instead of CONFIG_DIR: reading from apim instead of laptop
process.env.NODE_ENV = 'production';
// The apim server and datastore
process.env.APIMANAGER = '127.0.0.1';
process.env.APIMANAGER_PORT = 8081;
process.env.DATASTORE_PORT = 5000;
resetLimiterCache();
apimServer.start(
process.env.APIMANAGER,
process.env.APIMANAGER_PORT,
__dirname + '/definitions/invoke')
.then(function() { return microgw.start(3000); })
.then(function() { return backend.start(8889); })
.then(function() {
request = supertest('path_to_url
})
.then(done)
.catch(function(err) {
console.error(err);
done(err);
});
});
after(function(done) {
delete process.env.NODE_ENV;
delete process.env.APIMANAGER;
delete process.env.APIMANAGER_PORT;
delete process.env.DATASTORE_PORT;
resetLimiterCache();
dsCleanup(5000)
.then(function() { return apimServer.stop(); })
.then(function() { return microgw.stop(); })
.then(function() { return backend.stop(); })
.then(done, done)
.catch(function(err) {
console.log(err);
done(err);
});
});
var data = { msg: 'Hello world' };
// invoke policy to post a request
it('post', function(done) {
this.timeout(10000);
// by default, chunk-uploaded is false
request
.post('/invoke/basic')
.send(data)
.expect(/z-method: POST/)
.expect(/z-content-length: 21/)
.expect(/z-transfer-encoding: undefined/)
.expect(/z-user-agent: APIConnect\/5.0 \(MicroGateway\)/)
.expect(200, /z-url: \/\/invoke\/basic/)
.end(function(err, res) {
done(err);
});
});
// invoke policy to get a request
it('get', function(done) {
this.timeout(10000);
// Two things are tested:
// 1. a GET request with data should not be rejected by microgateway
// 2. The invoke policy should not forward the Content-Length of a GET request
request
.get('/invoke/basic')
.set('Content-Length', '5')
.send('dummy')
.expect(/z-method: GET/)
.expect(/z-content-length: undefined/)
.expect(/z-transfer-encoding: undefined/)
.expect(/body: \n/)
.expect(200)
.end(function(err, res) {
done(err);
});
});
// This testcase is to verify the invoke policy will urlencode the form data
// before sending them to the api server
it('form-urlencoded-1', function(done) {
this.timeout(10000);
// POST application/x-www-form-urlencoded
request
.post('/invoke/encode')
.type('form')
.send({ foo: 'hello' })
.send({ bar: 123 })
.send({ baz: [ 'qux', 'quux' ] })
.expect(/z-method: POST/)
.expect(/z-content-type: application\/x-www-form-urlencoded/)
.expect(200, /body: foo=hello&bar=123&baz%5B0%5D=qux&baz%5B1%5D=quux/)
// foo=hello&bar=123&baz[0]=qux&baz[1]=quux
.end(function(err, res) {
done(err);
});
});
// This testcase is to verify the invoke policy will parse the urlencoded data
// after receiving them from the api server
it('form-urlencoded-2', function(done) {
this.timeout(10000);
request
.get('/invoke/decode')
.expect('Content-Type', 'application/x-www-form-urlencoded')
.expect(200, /Found the parameter 'baz'=qux,quux in the message.body/)
.end(function(err, res) {
done(err);
});
});
// This testcase is to verify the post-flow should urlencode the message.body
// when the content-type is x-www-form-urlencoded
it('post-flow-should-urlencode-the-form-data', function(done) {
this.timeout(10000);
request
.get('/invoke/decode')
.set('X-TEST-POSTFLOW', 'yes')
.expect('Content-Type', 'application/x-www-form-urlencoded')
.expect(200, /^foo=bar&baz%5B0%5D=qux&baz%5B1%5D=quux&corge=$/)
.end(function(err, res) {
done(err);
});
});
it('get', function(done) {
this.timeout(10000);
request
.get('/invoke/basic')
.expect(200, /z-method: GET/)
.expect(200, /z-url: \/\/invoke\/basic/, done);
});
// a HEAD response has no body
it('head', function(done) {
this.timeout(10000);
request
.head('/invoke/basic')
.expect(200, {}, done);
});
// An invalid host will lead to a ConnectionError. By default, the invoke
// policy stops on ConnectionError. A ConnectionError returns with status of
// "500: URL Open error".
it('host-not-found', function(done) {
this.timeout(10000);
request
.get('/invoke/dynHost')
.set('X-TEST-HOSTNAME', 'cannotbevalidcom')
.expect(function(res, done) {
if (res.res.statusCode !== 500) {
throw new Error('status code should be 500');
}
if (res.res.statusMessage !== 'URL Open error') {
throw new Error('status reason should be "URL Open error"');
}
})
.expect(/"name":"ConnectionError"/)
.expect(/getaddrinfo ENOTFOUND cannotbevalidcom/,
done);
});
// The invoke policy receives a 500 error from the server.
// Any non-2xx response is considered as an OperationError.
// However, by default, invoke only stops on ConnectionError
it('test-500-response-default', function(done) {
this.timeout(10000);
request
.get('/invoke/testStatusCode')
.set('X-CODE', '500')
.expect('x-after-invoke', 'this is the post-invoke header')
.expect(500, /This is a 500 response./, done);
});
// The invoke policy receives a 303 response from the server.
// Any non-2xx response is considered as an OperationError.
// However, by default, invoke only stops on ConnectionError
it('test-303-response-default', function(done) {
this.timeout(10000);
request
.get('/invoke/testStatusCode')
.set('X-CODE', '303')
.expect('x-after-invoke', 'this is the post-invoke header')
.expect(303, /This is a 303 response./, done);
});
// The invoke policy receives a 303 response from the server.
// The invoke policy stops on OperationError
it('test-stop-on-303-response', function(done) {
this.timeout(10000);
request
.get('/invoke/stopOnOperationError')
.set('X-CODE', '303')
.expect(303, /'OperationError' 303: undefined is caught!/, done);
});
// The invoke policy receives a 203 response from the server.
// The invoke policy stops on OperationError
it('test-stop-on-203-response', function(done) {
this.timeout(10000);
request
.get('/invoke/stopOnOperationError')
.set('X-CODE', '203')
.expect(203, /Only non-operationError can reach here!/, done);
});
it('test-ignore-operation-error', function(done) {
this.timeout(10000);
request
.get('/invoke/ignoreAllErrors')
.set('X-CODE', '303')
.expect(303,
/All errors should be ignored, this must be executed after the invoke./,
done);
});
it('test-ignore-connection-error', function(done) {
this.timeout(10000);
request
.get('/invoke/ignoreAllErrors')
.set('X-CODE', '-1')
.expect(function(res, done) {
if (res.res.statusCode !== 500) {
throw new Error('status code should be 500');
}
if (res.res.statusMessage !== 'URL Open error') {
throw new Error('status reason should be "URL Open error"');
}
})
.expect(500,
/All errors should be ignored, this must be executed after the invoke./,
done);
});
it('auth-OK', function(done) {
this.timeout(10000);
request
.get('/invoke/basic')
.auth('root', 'Hunter2')
.expect(200, /z-method: GET/, done);
});
it('auth-NG', function(done) {
this.timeout(10000);
request
.get('/invoke/basic')
.auth('root', 'test123')
.expect(401, /^Not Authorized/, done);
});
it('compress-data', function(done) {
this.timeout(10000);
// gzip compression header includes a platform bit which means different
// platforms actually produce _slightly_ different gzip compression results
// depending on the platform.
// see path_to_url
const gzHelloWorld = zlib.gzipSync('Hello World').toString('base64');
// when data is compressed, use the chunked encoding
request
.post('/invoke/testCompression')
.set('X-RAW-DATA', 'Hello World')
.expect(/z-content-encoding: gzip/)
.expect(/z-content-length: undefined/)
.expect(/z-transfer-encoding: chunked/)
.expect(new RegExp(`raw: ${gzHelloWorld}`))
.expect(200, /body: Hello World/, done);
});
it('use-chunks-yes', function(done) {
this.timeout(10000);
request
.post('/invoke/useChunks')
.send(data)
.expect(/z-content-encoding: undefined/)
.expect(/z-content-length: undefined/)
.expect(/z-transfer-encoding: chunked/)
.expect(200, /{"msg":"Hello world"}/, done);
});
it('just-in-time', function(done) {
this.timeout(10000);
// request returned before timeout
request
.get('/invoke/timeout5Sec')
.set('X-DELAY-ME', '2')
.expect(200, /z-url: \/\/invoke\/timeout5Sec/, done);
});
it('request-timeouted', function(done) {
this.timeout(10000);
// the request timeouted
request
.get('/invoke/timeout5Sec')
.set('X-DELAY-ME', '7')
.expect(/"name":"ConnectionError"/)
.expect(/"message":"The invoke policy is timeouted."/)
.expect(500, done);
});
/// //////////////////// HTTPS servers ///////////////////////
// 8890: The server is "Sarah", whose CA is root
// 8891: The server is "Sandy", whose CA is root2
// 8892: The server is using TLS10, "ProtocolTLS10"
// 8893: The server uses only some ciphers, "LimitedCiphers"
// 8894: The server uses alice and bob as the CA. Incorrect usage?
// 8895: 'Sarah' uses the CA 'root' to authenticate clients
// 8896: 'Sarah' uses the CA 'root2' to authenticate clients
// 8897: 'Sandy' uses the CA 'root2' to authenticate clients
/// //////////////////////////////////////////////////////////
// This is to test if client can skip the validation of server's certificate.
// By default, yes (to be consistent with edge gateway)
it('https-basic', function(done) {
this.timeout(10000);
request
.get('/invoke/testTLS')
.set('X-HTTPS-PORT', '8890')
.set('X-TLS-PROFILE', 'tls-profile-simple')
.expect(/body/)
.expect(200, done);
});
it('https-without-tlsprofile', function(done) {
this.timeout(10000);
request
.get('/invoke/testTLS')
.set('X-HTTPS-PORT', '8890')
.expect(200, done);
});
// Use the certificate of Sarah's Root CA to authenticate the Sarah. OK
// Note: the common name of Sarah must be domain name or localhost. Otherwise,
// You might get an error "Host: localhost. is not cert\'s CN: Sarah".
it('https-server-sarah-OK', function(done) {
this.timeout(10000);
request
.get('/invoke/testTLS')
.set('X-HTTPS-PORT', '8890')
.set('X-TLS-PROFILE', 'tls-profile-serverSarah-1')
.expect(/url: \/\/invoke\/testTLS/)
.expect(200, done);
});
// Use Sarah's own certificate to authenticate Sarah. NG
it('https-server-sarah-NG', function(done) {
this.timeout(10000);
request
.get('/invoke/testTLS')
.set('X-HTTPS-PORT', '8890')
.set('X-TLS-PROFILE', 'tls-profile-serverSarah-2')
.expect(/"name":"ConnectionError"/)
.expect(/"message":"Error: unable to verify the first certificate"/)
.expect(500, done);
});
it('cannot-find-tls-profile', function(done) {
this.timeout(10000);
request
.get('/invoke/testTLS')
.set('X-HTTPS-PORT', '8890')
.set('X-TLS-PROFILE', 'not-found')
.expect(299, /Unexpect \'PropertyError\' Cannot find the TLS profile "not-found"/, done);
});
// openssl s_client -tls1_2 -CAfile root.crt -connect localhost:port
// openssl s_client -tls1 -CAfile root.crt -connect localhost:port
// Both of server and client use the TLS v1.0
it('require-tls10', function(done) {
this.timeout(10000);
request
.get('/invoke/testTLS')
.set('X-HTTPS-PORT', '8892')
.set('X-TLS-PROFILE', 'tls-profile-require-tls10')
.expect(/url: \/\/invoke\/testTLS/)
.expect(200, done);
});
it('require-tls12-while-server-supports-tls10', function(done) {
this.timeout(10000);
request
.get('/invoke/testTLS')
.set('X-HTTPS-PORT', '8892')
.set('X-TLS-PROFILE', 'tls-profile-require-tls12')
.expect(/"name":"ConnectionError"/)
.expect(/(wrong version number|write EPROTO)/)
.expect(500, done);
});
/// /cipher mapping table for each TLS versions:
/// /path_to_url#CIPHER_LIST_FORMAT
/// /both of server and client support the cipher 'TLS_RSA_WITH_3DES_EDE_CBC_SHA'
// it('use-cipher-TLS_RSA_WITH_3DES_EDE_CBC_SHA', function(done) {
// this.timeout(10000);
//
// request
// .get('/invoke/testTLS')
// .set('X-HTTPS-PORT', '8892')
// .set('X-TLS-PROFILE', 'use-cipher-TLS_RSA_WITH_3DES_EDE_CBC_SHA')
// .expect(200, done);
// });
//
/// /client requires a cipher which is disalloed by server
/// /The EPROTO error is due to the "!ECDHE-RSA-AES128-SHA256" in server side.
/// /The cipher is available but is not allowed.
// it('use-cipher-TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256', function(done) {
// this.timeout(10000);
//
// request
// .get('/invoke/testTLS')
// .set('X-HTTPS-PORT', '8893')
// .set('X-TLS-PROFILE', 'use-cipher-TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256')
// .expect(299, /Error: write EPROTO/, done);
// });
//
/// /client requires the PSK cipher that is not available at server
/// /'no ciphers available'
// it('use-cipher-PSK_WITH_CAMELLIA_128_CBC_SHA256', function(done) {
// this.timeout(10000);
//
// request
// .get('/invoke/testTLS')
// .set('X-HTTPS-PORT', '8893')
// .set('X-TLS-PROFILE', 'use-cipher-PSK_WITH_CAMELLIA_128_CBC_SHA256')
// .expect(299, /SSL23_CLIENT_HELLO:no ciphers available/, done);
// });
// The client expects the server to be Sarah and uses the CA 'root' for auth.
// However, the server is Sandy who should be authenticated using 'root2'.
it('unexected-https-server', function(done) {
this.timeout(10000);
request
.get('/invoke/testTLS')
.set('X-HTTPS-PORT', '8891')
.set('X-TLS-PROFILE', 'tls-profile-serverSarah-1')
.expect(/"name":"ConnectionError"/)
.expect(/"message":"Error: unable to verify the first certificate"/)
.expect(500, done);
});
// 'sarah' at 8895 is authenticated by 'root' and uses 'root' to authenticate
// its client too. So both of 'alice' and 'bob' will be good
it('mutual-auth-ok', function(done) {
this.timeout(10000);
request
.get('/invoke/testTLS')
.set('X-HTTPS-PORT', '8895')
.set('X-TLS-PROFILE', 'tls-profile-alice-2')
.expect(/url: \/\/invoke\/testTLS/)
.expect(200, done);
});
it('mutual-auth-ok-2', function(done) {
this.timeout(10000);
request
.get('/invoke/testTLS')
.set('X-HTTPS-PORT', '8895')
.set('X-TLS-PROFILE', 'tls-profile-bob-2')
.expect(/url: \/\/invoke\/testTLS/)
.expect(200, done);
});
it('mutual-auth-ng', function(done) {
this.timeout(10000);
request
.get('/invoke/testTLS')
.set('X-HTTPS-PORT', '8895')
.set('X-TLS-PROFILE', 'tls-profile-sandy-2')
.expect(/"name":"ConnectionError"/)
.expect(/"message":"Error: socket hang up"/)
.expect(500, done);
});
// 'sarah' at 8896 is authenticated by 'root' and uses 'root2' to authenticate
// its client too. So only 'sandy' will be good
it('mutual-auth-ok-3', function(done) {
this.timeout(10000);
request
.get('/invoke/testTLS')
.set('X-HTTPS-PORT', '8896')
.set('X-TLS-PROFILE', 'tls-profile-sandy-2')
.expect(/url: \/\/invoke\/testTLS/)
.expect(200, done);
});
it('mutual-auth-ng-2', function(done) {
this.timeout(10000);
request
.get('/invoke/testTLS')
.set('X-HTTPS-PORT', '8896')
.set('X-TLS-PROFILE', 'tls-profile-bob-2')
.expect(/"name":"ConnectionError"/)
.expect(/"message":"Error: socket hang up"/)
.expect(500, done);
});
// 'sandy' at 8897 is authenticated by 'root2' and uses 'root2' to authenticate
// its client too. Son only 'sandy' will be good
it('mutual-auth-ok-4', function(done) {
this.timeout(10000);
request
.get('/invoke/testTLS')
.set('X-HTTPS-PORT', '8897')
.set('X-TLS-PROFILE', 'tls-profile-sandy-2')
.expect(/url: \/\/invoke\/testTLS/)
.expect(200, done);
});
it('mutual-auth-ng-3', function(done) {
this.timeout(10000);
request
.get('/invoke/testTLS')
.set('X-HTTPS-PORT', '8897')
.set('X-TLS-PROFILE', 'tls-profile-alice-2')
.expect(/"name":"ConnectionError"/)
.expect(/"message":"Error: socket hang up"/)
.expect(500, done);
});
// to read the data and headers from somewhere other than the context.message
it('test-input', function(done) {
this.timeout(10000);
request
.post('/invoke/testInput')
.send(data)
.expect(/z-method: POST/)
.expect(/z-secret-1: test 123/)
.expect(/z-secret-2: hello amigo/)
.expect(200, /body: This is a custom body message/, done);
});
// to save the result of invoke policy somewhere other than the context.message
it('test-output', function(done) {
this.timeout(10000);
request
.get('/invoke/testOutput')
.expect('X-TOKEN-ID', 'foo')
.expect(202, /You are accepted/, done);
});
// The api server returns a message of length 5 and header 'Content-Length:5'.
// Then a set-variable policy modifies the message without changing the
// Content-Length. Let's see what'll happen.
// It turns out that express will update the Content-Length
it('test-content-length', function(done) {
this.timeout(10000);
request
.get('/invoke/testContentLength')
.expect('Content-Length', '95')
.expect(200, /This is a very long message/, done);
});
// the returned body might be parsed as JSON depending on the content-type
it('test-json', function(done) {
this.timeout(10000);
request
.get('/invoke/testJSON')
.expect(200, /The quantity is 150 and the price is 23/, done);
});
});
``` |
Wola Niedźwiedzia is a village in the administrative district of Gmina Wartkowice, within Poddębice County, Łódź Voivodeship, in central Poland. It lies approximately north-east of Wartkowice, north-east of Poddębice, and north-west of the regional capital Łódź.
References
Villages in Poddębice County |
Midway Lady (foaled 1983) was an American-bred, British-trained Thoroughbred racehorse and broodmare who won two British Classic Races in 1986. In a racing career lasting from August 1985 until June 1986, the filly ran six times and won her last five races. She sustained her only defeat when finishing second on her racecourse debut but won her remaining three races in 1985 including the May Hill Stakes at Doncaster and the Prix Marcel Boussac at Longchamp. Her three-year-old campaign consisted of only two races, as she won the 1000 Guineas at Newmarket and the Oaks at Epsom a month later. After sustaining a serious leg injury, she was retired to stud where she became a successful producer of winners including the Oaks winner Eswarah.
Background
Midway Lady was a big, powerful bay filly bred in Kentucky by Edward A. Seltzer and Shadowlawn Farm. She was sired by the dual Prix de l'Arc de Triomphe winner Alleged out of the mare Smooth Bore. Alleged a successful stallion, and a strong influence for stamina: his best winners included Miss Alleged, Shantou, Legal Case (Champion Stakes) and Law Society (Irish Derby). In September 1983, Midway Lady was sent as a yearling to the sales at Keeneland where she was sold for $42,000 to a group called Robin Enrterprises. The price was less than half Alleged's stud fee at the time and was explained by the fact that the filly's legs, according to one authority, "deviated from the ideal to a marked degree". Despite her sale she raced in the colours of Harry Ranier, one of the owners of Shadowlawn: Timeform described the exact details of the filly's sale and ownership as "rather obscure". Midway Lady was sent to race in Europe as a two-year-old where she was trained by Ben Hanbury at Newmarket, Suffolk.
Racing career
1985: two-year-old season
After finishing second to Untold on her racecourse debut at Yarmouth Racecourse in August 1985, Midway Lady recorded her first win when taking a seven furlong maiden race later that month at the same course. She was then moved up to Group Three class for the May Hill Stakes at Doncaster a month later. She was restrained in the early stages by her veteran jockey Lester Piggott before taking the lead in the straight and winning by three lengths from Tender Loving Care. The form of her only defeat was boosted on 26 September when Untold won the Fillies' Mile.
Piggott rode the filly again in the Prix Marcel Boussac at Longchamp on October. She started a clear favourite for the Group One race at odds of 7/10 against fourteen rivals. Midway Lady was second on the final turn before taking the lead in the straight. She stayed on strongly to win from the outsiders Fieldy and Riverbride, and although the final winning margin was only a neck, she never appeared likely to be caught.
1986: three-year-old season
With her stamina-rich pedigree Midway Lady was regarded as a leading fancy for the one and a half mile Epsom Oaks, but she began her season in the 1000 Guineas over Newmarket's Rowley Mile course in May. With Piggott having retired (for the first time) at the end of 1985, the filly was ridden by Ray Cochrane and started at odds of 10/1 in a field of fifteen fillies. She won by three quarters of a length from Maysoon, with the 6/4 favourite Sonic Lady a short head away in third. After the race, Hanbury admitted that he had always considered Midway Lady to be primarily an Oaks filly, but that Piggott had insisted that she had the speed to win a Guineas.
On 7 June, Midway Lady started 15/8 favourite for the Epsom Oaks. Ridden again by Cochrane, she won by a length from Untold with Maysoon third. Her winning time of 2:35.60 was more than one and a half seconds faster than that recorded by Shahrastani, when beating Dancing Brave in the Derby over the same course and distance three days earlier. After the Oaks, Midway Lady sustained a leg injury described as inflamed tendon sheath, which did not respond to treatment. In August Hanbury announced that the filly would not race again.
Retirement
In November 1986, Midway Lady was offered for sale at Keeneland, and was bought for $3.3m by representatives of Hamdan Al Maktoum's Shadwell Stud. She made an immediate impact as a broodmare when her first foal, a filly named Umniyatee won two races and finished third in the Irish 1000 Guineas. Midway Lady produced several other winners, most notably Eswarah (sired by Unfuwain), who emulated her mother by winning the Epsom Oaks in 2005. A more unusual success was the gelding Fatehalkhair, who was virtually useless on the flat, but won twenty races under National Hunt rules.
Stud Record
2005 Ghaidaa (IRE) : Bay filly, foaled 8 February, by Cape Cross (IRE) - won 1 race and placed 4 times from 7 starts in England 2008, including 3rd LR Atalanta Stakes, Sandown; 3rd LR Rosemary Stakes, Ascot
2006 Sana Abel (IRE) : Bay filly, foaled 22 May, by Alhaarth (IRE) - won 1 race and placed 2nd once from 7 starts in England 2009
Assessment and honours
The independent Timeform organisation gave Midway Lady a rating of 120 in 1985 and 126 in 1986.
In their book, A Century of Champions, based on the Timeform rating system, John Randall and Tony Morris rated Midway Lady an "average" winner of the 1000 Guineas and Oaks.
Pedigree
Midway Lady was inbred 3x4 to Ribot, meaning that this stallion appears in the fourth generation of her pedigree.
Midway Lady's ancestors were predominantly North American. The unraced Alibhai was the only British-bred horse in the first four generations of her pedigree.
References
1983 racehorse births
Racehorses bred in Kentucky
Racehorses trained in the United Kingdom
Thoroughbred family 8-k
1000 Guineas winners
Epsom Oaks winners |
Hjeltnes is a surname. Notable people with the surname include:
Arne Hjeltnes (born 1963), Norwegian writer, television personality, marketer and politician
Guri Hjeltnes (born 1953), Norwegian journalist and historian
Knut Hjeltnes (athlete) (born 1952), former athlete from Norway
Knut Hjeltnes (architect) (born 1961), Norwegian architect
Kristofer Kristofersson Hjeltnes (1856–1930), Norwegian horticulturist and politician
Kristofer Sjursson Hjeltnes (1730–1804), Norwegian farmer and businessperson
Norwegian-language surnames |
Nico Porteous (born 23 November 2001) is a New Zealand freestyle skier and an Olympic champion. He is New Zealand's youngest Olympic Games medallist, having won a bronze medal at the 2018 Winter Olympics at the age of 16. He became New Zealand's second Winter Olympic gold medallist, and first male, with his win in men's halfpipe at the Beijing 2022 Winter Olympics.
Early life and family
Porteous was introduced to skiing by his parents and learned to ski in France when he was three years old. He has had a professional coach since he was six years old. Porteous has been home-schooled through Te Aho o Te Kura Pounamu, as well as studying at Christ Church Grammar School in Perth, Western Australia. His older brother Miguel Porteous is also a freeskier and Olympian, having competed at the 2018 Winter Olympics and the 2022 Winter Olympics.
Career
When Porteous was 14, he became the youngest person in the world to land the triple cork 1440 (upside down three times, and four full spins). This has since been beaten by another skier.
Porteous was selected to compete at the 2018 Winter Olympics, making him the second-youngest Winter Olympian in the nation's history (behind Alice Robinson). In the men's halfpipe he won the bronze medal, becoming only the third New Zealander (and first male New Zealander) to win a medal at a Winter Olympics. At age 16 years 91 days, Porteous became New Zealand's youngest Olympic Games medallist, breaking the previous record of 16 years and 353 days set by Zoi Sadowski-Synnott earlier the same day, who had in turn broken the record of 17 years 100 days set by Danyon Loader at the 1992 Summer Olympics.
His best 2017–18 FIS Freestyle Ski World Cup finish is 6th at Cardrona Alpine Resort.
In 2019, Porteous claimed the bronze medal in the superpipe event at the Winter X Games in Aspen, Colorado.
At the 2019 Audi Nines Porteous performed a Switch Alley Oop Double Misty 1080.
In 2021, Porteous claimed his first X Games gold medal in the Superpipe event. In January 2022, Porteous won a gold medal in the freeski halfpipe event at the U.S. Grand Prix World Cup event in California, USA. During the 2022 X Games in Aspen, USA, Porteous defended his title by winning gold in superpipe on the final run of the competition.
On 19 February 2022, Porteous won the gold medal in the men's halfpipe event at the Beijing 2022 Winter Olympics. In the 2023 New Year Honours, he was appointed a Member of the New Zealand Order of Merit, for services to snow sports.
References
External links
Nico Porteous at Snow Sports NZ
Living people
New Zealand male freestyle skiers
2001 births
Olympic freestyle skiers for New Zealand
Freestyle skiers at the 2018 Winter Olympics
Freestyle skiers at the 2022 Winter Olympics
Olympic gold medalists for New Zealand
Olympic bronze medalists for New Zealand
Medalists at the 2018 Winter Olympics
Medalists at the 2022 Winter Olympics
Olympic medalists in freestyle skiing
Sportspeople from Hamilton, New Zealand
People from Wānaka
People educated at Te Aho o Te Kura Pounamu
X Games athletes
Members of the New Zealand Order of Merit |
Saeed Ghezelagchi (born March 6, 1983) is an Iranian football player who currently plays for Paykan of the Iran Pro League.
Professional
Ghezelagchi has played for Saipa since 2009.
References
1983 births
Living people
Iranian men's footballers
Footballers from Tabriz
Saipa F.C. players
Fajr Sepasi Shiraz F.C. players
Machine Sazi F.C. players
Naft Tehran F.C. players
Esteghlal Ahvaz F.C. players
Shahr Khodro F.C. players
Men's association football defenders |
Marie Winn (née Wienerová; 1936) is a journalist, author, and bird-watcher. She is known for her books and articles on the wildlife of Central Park and her Wall Street Journal Leisure & Arts column. She appears in Frederic Lilien's documentary film, The Legend of Pale Male (2010). She is also known for writing The Plug-In Drug (1977), which explored the impact of television on young children, and for her involvement in the quiz show scandals of the 1950s.
Early life
Born into a Jewish family in 1936 in Prague, Czechoslovakia, Winn is one of two daughters of Hanna (née Taussig) and Josef Wiener aka Joseph A. Winn, a psychiatrist; her sister was the writer Janet Malcolm. Winn is a U.S. citizen who attended the Bronx High School of Science, Radcliffe College and Columbia University.
In May 1958, while Winn was a contestant on Dotto, a knowledge-quiz type TV game, a notebook which belonged to her was found by another contestant, Ed Hilgemeier, who discovered that the notebook included questions and answers to be used during Winn's appearances. Jack Narz, the host of Dotto at the time, recalled, when interviewed for a PBS documentary, that he believed Winn to be "a little too pat" when giving her answers. A CBS executive vice president, Thomas Fisher, tested kinescopes of the show against Winn's notebook and concluded that the show appeared to have been fixed. The executives also learned the show's producers had paid Winn, Hilgemeier, and Winn's opponent Yaffe Kimball-Slatin to keep quiet about the notebook.
Writing career
The Plug-In Drug
Winn is the author of The Plug-In Drug (1977), an often scathing critique of television's addictive influence on the young, Winn wrote, "The television experience allows the participant to blot out the real world and enter into a pleasurable and passive mental state." In 2002, she added new material to update the study as The Plug-In Drug: Television, Computers, and Family Life, published on the 25th anniversary of the original book.
Pale Male
An advocate for the protection of wildlife, Winn gave the name Pale Male to the red-tailed hawk that nested on a Fifth Avenue building, receiving much press coverage. She was also prominent in preserving Pale Male's nest when it was threatened with removal. She wrote about these events in her book, Red-Tails in Love: Pale Male's Story – A True Wildlife Drama in Central Park (1998). The book is an expansion of her Smithsonian magazine articles and her column in The Wall Street Journal. Frederic Lilien's documentary film, Pale Male (2002), is an adaptation of Winn's book and includes interview scenes with Winn.
References
Notes
Further reading
Winn, Marie. "The Loss of Childhood," The New York Times, May 8, 1983: Excerpt from Children Without Childhood (Pantheon, 1983).
Further listening
Marie Winn interviewed on NPR's All Things Considered (12/10/04)
Sources
Winn, Marie. "What Became of Childhood Innocence?", The New York Times, January 25, 1981.
Winn, Marie and Creshkoff, Rebekah. The Birds of Central Park: An Annotated Checklist (pdf)
Selected bibliography
The Fireside Book of Children's Songs (Simon and Schuster, 1966)
The Plug-In Drug (Penguin, 1977)
Red-Tails in Love (Random House, 1998)
Birds of Central Park by Cal Vornberger, foreword by Marie Winn (Abrams, 2005)
Central Park in the Dark (FSG, 2008)
External links
Marie Winn and Rebekah Creshkoff in Cardinal costumes at Pale Male Eviction Protest Rally (12/12/04)
Marie Winn official site
Pale Male
1936 births
Living people
Writers from Prague
American ornithological writers
American people of Czech-Jewish descent
American women non-fiction writers
Czechoslovak emigrants to the United States
The Bronx High School of Science alumni
Columbia University alumni
Radcliffe College alumni
Contestants on American game shows
Jewish American writers
The Wall Street Journal people
Women ornithologists
Women science writers
20th-century American non-fiction writers
20th-century American women writers
20th-century American scientists
20th-century American women scientists
21st-century American scientists
21st-century American women scientists
21st-century American women writers
Scientists from New York (state)
21st-century American Jews |
```javascript
import Image from 'next/image'
export default function Home() {
return (
<Image
alt="red square"
src="data:image/png;base64,your_sha256_hashHwAFBQIAX8jx0gAAAABJRU5ErkJggg=="
width={64}
height={64}
/>
)
}
``` |
Seo Taiji and Boys II is the second studio album by South Korean boy group Seo Taiji and Boys, released via Bando Records on June 21, 1993. With over 2.2 million copies sold, it is one of the best-selling albums in South Korea. The album spawned the hit "Anyhow Song" (Hayeoga) which became its lead single.
Overview
Following the breakout success of their debut album, its followup was highly anticipated. While promoting the second album, Seo Taiji and Boys were banned from appearing on certain television shows, including KBS, because they wore earrings, ripped jeans and had dreadlocks.
Reception
The album was well received in South Korea and continued to build upon the group's popularity, especially amongst teenagers and college students. In November 1993, "Anyhow Song" was deemed the song with the "highest musical perfection" among new generation singers throughout the year. At year-end award shows, Seo Taiji and Boys won the Album Bonsang prize at the 8th Golden Disc Awards in December and was nominated for Album Daesang, but lost to Shin Seung-hun's Because I Love You. In April 1996, Billboard reported that the album had sold over 1.6 million copies, which has since reportedly grown to over 2.2 million copies. In 2007, Kyunghyang Shinmun ranked the album number 30 on its 2007 list of the Top 100 Korean Albums of all time.
Accolades
Track listing
English titles are based on the official translations provided by the Seotaiji Company for international markets. All tracks are written by Seo Taiji, except track 3; rap written by William Byun.
Personnel
Seo Taiji − vocals, sampling, engineering, guitar on track 2, beat box on track 2, bass on tracks 2, 3, 5, 7 & 8
Yang Hyun-suk − vocals
Lee Juno − vocals
Kim Jong-seo − backing vocals on track 2
Kim Duk-soo − taepyeongso and samul nori on track 2
Lee Tae-sub − guitar on track 2
Ito − guitar on tracks 3−5, 7 & 8
Lee Jeong-sik − saxophone on track 5
References
External links
1993 albums
Seo Taiji and Boys albums |
The Bananal River is a river of Tocantins state in central Brazil.
See also
List of rivers of Tocantins
References
Brazilian Ministry of Transport
Rivers of Tocantins |
```python
import json
import logging
from copy import deepcopy
from typing import Any, Dict, List, Optional
from zlib import crc32
from ray._private.pydantic_compat import BaseModel
from ray.serve._private.config import DeploymentConfig
from ray.serve._private.utils import DeploymentOptionUpdateType, get_random_string
from ray.serve.config import AutoscalingConfig
from ray.serve.generated.serve_pb2 import DeploymentVersion as DeploymentVersionProto
logger = logging.getLogger("ray.serve")
class DeploymentVersion:
def __init__(
self,
code_version: Optional[str],
deployment_config: DeploymentConfig,
ray_actor_options: Optional[Dict],
placement_group_bundles: Optional[List[Dict[str, float]]] = None,
placement_group_strategy: Optional[str] = None,
max_replicas_per_node: Optional[int] = None,
):
if code_version is not None and not isinstance(code_version, str):
raise TypeError(f"code_version must be str, got {type(code_version)}.")
if code_version is None:
self.code_version = get_random_string()
else:
self.code_version = code_version
# Options for this field may be mutated over time, so any logic that uses this
# should access this field directly.
self.deployment_config = deployment_config
self.ray_actor_options = ray_actor_options
self.placement_group_bundles = placement_group_bundles
self.placement_group_strategy = placement_group_strategy
self.max_replicas_per_node = max_replicas_per_node
self.compute_hashes()
@classmethod
def from_deployment_version(cls, deployment_version, deployment_config):
version_copy = deepcopy(deployment_version)
version_copy.deployment_config = deployment_config
version_copy.compute_hashes()
return version_copy
def __hash__(self) -> int:
return self._hash
def __eq__(self, other: Any) -> bool:
if not isinstance(other, DeploymentVersion):
return False
return self._hash == other._hash
def requires_actor_restart(self, new_version):
"""Determines whether the new version requires actors of the current version to
be restarted.
"""
return (
self.code_version != new_version.code_version
or self.ray_actor_options_hash != new_version.ray_actor_options_hash
or self.placement_group_options_hash
!= new_version.placement_group_options_hash
or self.max_replicas_per_node != new_version.max_replicas_per_node
)
def requires_actor_reconfigure(self, new_version):
"""Determines whether the new version requires calling reconfigure() on the
replica actor.
"""
return self.reconfigure_actor_hash != new_version.reconfigure_actor_hash
def requires_long_poll_broadcast(self, new_version):
"""Determines whether lightweightly updating an existing replica to the new
version requires broadcasting through long poll that the running replicas has
changed.
"""
return (
self.deployment_config.max_ongoing_requests
!= new_version.deployment_config.max_ongoing_requests
)
def compute_hashes(self):
# If these change, the controller will rolling upgrade existing replicas.
serialized_ray_actor_options = _serialize(self.ray_actor_options or {})
self.ray_actor_options_hash = crc32(serialized_ray_actor_options)
combined_placement_group_options = {}
if self.placement_group_bundles is not None:
combined_placement_group_options["bundles"] = self.placement_group_bundles
if self.placement_group_strategy is not None:
combined_placement_group_options["strategy"] = self.placement_group_strategy
serialized_placement_group_options = _serialize(
combined_placement_group_options
)
self.placement_group_options_hash = crc32(serialized_placement_group_options)
# If this changes, DeploymentReplica.reconfigure() will call reconfigure on the
# actual replica actor
self.reconfigure_actor_hash = crc32(
self._get_serialized_options(
[DeploymentOptionUpdateType.NeedsActorReconfigure]
)
)
# Used by __eq__ in deployment state to either reconfigure the replicas or
# stop and restart them
self._hash = crc32(
self.code_version.encode("utf-8")
+ serialized_ray_actor_options
+ serialized_placement_group_options
+ str(self.max_replicas_per_node).encode("utf-8")
+ self._get_serialized_options(
[
DeploymentOptionUpdateType.NeedsReconfigure,
DeploymentOptionUpdateType.NeedsActorReconfigure,
]
)
)
def to_proto(self) -> bytes:
# TODO(simon): enable cross language user config
return DeploymentVersionProto(
code_version=self.code_version,
deployment_config=self.deployment_config.to_proto(),
ray_actor_options=json.dumps(self.ray_actor_options),
placement_group_bundles=json.dumps(self.placement_group_bundles)
if self.placement_group_bundles is not None
else "",
placement_group_strategy=self.placement_group_strategy
if self.placement_group_strategy is not None
else "",
max_replicas_per_node=self.max_replicas_per_node
if self.max_replicas_per_node is not None
else 0,
)
@classmethod
def from_proto(cls, proto: DeploymentVersionProto):
return DeploymentVersion(
proto.code_version,
DeploymentConfig.from_proto(proto.deployment_config),
json.loads(proto.ray_actor_options),
placement_group_bundles=(
json.loads(proto.placement_group_bundles)
if proto.placement_group_bundles
else None
),
placement_group_version=(
proto.placement_group_version if proto.placement_group_version else None
),
max_replicas_per_node=(
proto.max_replicas_per_node if proto.max_replicas_per_node else None
),
)
def _get_serialized_options(
self, update_types: List[DeploymentOptionUpdateType]
) -> bytes:
"""Returns a serialized dictionary containing fields of a deployment config that
should prompt a deployment version update.
"""
reconfigure_dict = {}
# TODO(aguo): Once we only support pydantic 2, we can remove this if check.
# In pydantic 2.0, `__fields__` has been renamed to `model_fields`.
fields = (
self.deployment_config.model_fields
if hasattr(self.deployment_config, "model_fields")
else self.deployment_config.__fields__
)
for option_name, field in fields.items():
option_weight = field.field_info.extra.get("update_type")
if option_weight in update_types:
reconfigure_dict[option_name] = getattr(
self.deployment_config, option_name
)
# If autoscaling config was changed, only broadcast to
# replicas if metrics_interval_s or look_back_period_s
# was changed, because the rest of the fields are only
# used in deployment state manager
if isinstance(reconfigure_dict[option_name], AutoscalingConfig):
reconfigure_dict[option_name] = reconfigure_dict[option_name].dict(
include={"metrics_interval_s", "look_back_period_s"}
)
elif isinstance(reconfigure_dict[option_name], BaseModel):
reconfigure_dict[option_name] = reconfigure_dict[option_name].dict()
if (
isinstance(self.deployment_config.user_config, bytes)
and "user_config" in reconfigure_dict
):
del reconfigure_dict["user_config"]
return self.deployment_config.user_config + _serialize(reconfigure_dict)
return _serialize(reconfigure_dict)
def _serialize(json_object):
return str.encode(json.dumps(json_object, sort_keys=True))
``` |
```python
from c7n_azure.provider import resources
from c7n_azure.query import ChildResourceManager, ChildTypeInfo
from c7n_azure.utils import ResourceIdParser
@resources.register('servicebus-namespace-networkrules')
class ServiceBusNamespaceNetworkrules(ChildResourceManager):
"""Azure Service Bus Namespace Network Ruleset Resource
:example:
Returns Service Bus Namespace Network Ruleset resources
.. code-block:: yaml
policies:
- name: basic-servicebus-namespace-networkrule
resource: azure.servicebus-namespace-networkrules
"""
class resource_type(ChildTypeInfo):
doc_groups = ['Events']
service = 'azure.mgmt.servicebus'
client = 'ServiceBusManagementClient'
enum_spec = ('namespaces', 'list_network_rule_sets', None)
parent_manager_name = 'servicebus-namespace'
default_report_fields = (
'name',
'location',
'resourceGroup'
)
resource_type = 'Microsoft.ServiceBus/namespaces'
@classmethod
def extra_args(cls, parent_resource):
return {
'resource_group_name': ResourceIdParser.get_resource_group(parent_resource['id']),
'namespace_name': parent_resource['name']
}
``` |
Maria Erhart (née Kirner; 15 November 1944 – 2 September 2011), was an Austrian international bridge player, who had the rare distinction of playing for her country's Open team as well as for the Women's team. She reached the highest rank in the game, World Grand Master, and was a member of the Austrian teams which won the women's event at the European Team Championships in 1991, the World Team Olympiad the following year and the World Championships in 1998. She was described in Bridge Magazine as "one of the finest and most charismatic players in the history of the game".
Early life
She was born in Vienna, and in later life lived in Rattenberg. There she studied at the world trade university, which led to a job in market research. She married Peter Erhart, a medical doctor and like herself an international bridge player, in 1987. She worked as his assistant, as well as looking after the commercial aspect of his practice.
Bridge accomplishments
She began playing bridge in 1969. Just a year after taking up the game she took part in a tournament in Venice, where she met the top Italian players.
In 1971 she met Rixi Markus, and thereafter they played together once or twice a year. In 1992 they won the St. Moritz Teams just two months before Markus's death.
Only five years after taking up the game she made her international debut, not in the Austrian Women's team but in the Open team.
A year later, in 1975, she was a member of the Austrian Women's team which won a bronze medal at the European Team Championships, partnering Barbara Lindinger.
In 1991, she decided that in future she would play mainly in Women's events, in spite of being able to command a place in the Austrian Open team. This immediately paid dividends when the Austrian Women's team which she had helped to put together won that year's European Championships at Killarney, and they followed this by winning the Olympiad in Salsomaggiore the following year.
In 1992, she won the Generali Women's World Masters Individual event, but shortly afterwards she contracted an illness that prevented her from playing again at the top level until 1996, when she won the European Mixed Pairs partnered by Fritz Kubak.
In 1998 she was a member of the Austrian women's team which won the McConnell Cup, the World Championship, in Lille, and the following year the team was second in the European Championships held in Malta.
In 2002 she was a member of the Lavazza team which won the European Mixed Teams event in Ostend, and in 2003 she won the European Women's Pairs in Menton partnering Jovi Smederevac.
Personal
Her hobbies included classical music, and playing tennis and golf. She also oversaw community work for the Rattenberg council.
In later life she suffered from an incapacitating disease. In spite of this handicap, at the 2011 St. Moritz tournament she won the Teams event, finished second in the Open Pairs and third in the Mixed Pairs.
References
External links
1944 births
2011 deaths
Austrian contract bridge players
Venice Cup players
Game players from Vienna |
The Bath coup is a coup in the game of contract bridge in which the declarer, who holds AJx(x) in a suit, ducks the left-hand opponent's lead of a king (or a queen) in that suit. The coup is presumed to be named after the city of Bath in England and dates from the game of whist, the predecessor of bridge.
The purpose of the Bath coup is either to gain a trick by means of a free finesse if the suit is continued or to gain a tempo because the suit may not be continued by opponents without the loss of a trick. The basic position for the Bath coup is like this diagram:
West leads the king at a notrump contract. If South takes the trick immediately, his jack can be finessed subsequently if East gains a later trick, providing four tricks in the suit for the defense. However, if South applies the Bath coup by ducking, he will either take two tricks with AJ, or the opponents would have to regain the lead twice to cash the suit—first, East must gain the lead in order to finesse through declarer's AJ, and later, West must regain the lead to cash the suit. If the suit is divided 5–2, as in the diagram, the declarer has in effect performed a hold up with an additional gain in tempo, as the opponents have to regain the lead once each. If the suit were divided 4–3, the last lead could be gained by any opponent to cash the suit, but the number of available tricks would be smaller.
The coup also occurs when ace and jack are split, but the jack lies before KQ.
Defense
The defense can relatively easily prevent giving away the trick by free finesse by accurate signaling. The most common signaling method on partner's lead is encouraging/discouraging (high card/low card respectively). In the examples above, East would play the six (the lowest), indicating that he doesn't have the jack. However, there are situations when West may misread the signal. To overcome the situation, some players agree that throwing away the jack is mandatory when a King is led at a notrump contract; yet others play that only the lead of the queen requires the partner to drop the Jack if he has it.
However, when a Bath coup position arises, defenders can't regain the tempo. What they can do, though, is to utilize the order of their entries correctly, as in the following deal:
West leads K against 3NT, South executes the Bath coup by ducking, and West must switch. If he plays a red suit, declarer will play on hearts (and will have to guess the position correctly). When West takes his ace, he still cannot continue spades, and the declarer will have time to develop a club trick as his ninth (along with four heart tricks, A, and three diamonds). However, if West plays a club, the declarer is doomed: East will take his A and play a spade through, while West still has the A as an entry to good spades.
References
Contract bridge coups |
```c
// 2017 and later: Unicode, Inc. and others.
/*
******************************************************************************
*
* Corporation and others. All Rights Reserved.
*
******************************************************************************
*
* FILE NAME : testTimezone.c
*
* Date Name Description
* 03/02/2006 grhoten Creation.
******************************************************************************
*/
#include "unicode/putil.h"
#include "unicode/ucnv.h"
#include "unicode/uloc.h"
#include "unicode/ures.h"
#include <stdbool.h>
#include <stdio.h>
#include <string.h>
int main(int argc, const char* const argv[]) {
UErrorCode status = U_ZERO_ERROR;
ures_close(ures_open(NULL, NULL, &status));
if (status != U_ZERO_ERROR) {
printf("uloc_getDefault = %s\n", uloc_getDefault());
printf("Locale available in ICU = %s\n", status == U_ZERO_ERROR ? "true" : "false");
}
if (strcmp(ucnv_getDefaultName(), "US-ASCII") == 0) {
printf("uprv_getDefaultCodepage = %s\n", uprv_getDefaultCodepage());
printf("ucnv_getDefaultName = %s\n", ucnv_getDefaultName());
}
return 0;
}
``` |
```yaml
subject: "Encoding keyword"
description: "__ENCODING__ keyword"
focused_on_node: "org.truffleruby.language.literal.ObjectLiteralNode"
ruby: |
__ENCODING__
ast: |
ObjectLiteralNode
attributes:
flags = 1
object = UTF-8
sourceCharIndex = 0
sourceLength = 12
``` |
Hibbertia obtusifolia, commonly known as hoary guinea flower, is a species of flowering plant in the family Dilleniaceae and is endemic to south-eastern Australia. It is usually an erect shrub with spreading branches, lance-shaped to egg-shaped leaves with the narrower end towards the base, and yellow flowers with thirty or more stamens arranged around three glabrous carpels.
Description
Hibbertia obtusifolia is an erect shrub with spreading branches up to long that are hairy when young. The leaves are lance-shaped to egg-shaped leaves with the narrower end towards the base, long and wide with a rounded or truncated end. The flowers are arranged on the ends of branches or short side shoots and are sessile with two or three bracts long at the base. The sepals are long and of unequal lengths. The petals are mid to pale yellow, egg-shaped with the narrower end towards the base, and long. There are thirty or more stamens arranged around three glabrous carpels. Flowering occurs from September to December.
Taxonomy
Hibbertia obtusifolia was first formally described in 1817 by Swiss botanist Augustin Pyramus de Candolle in Regni Vegetabilis Systema Naturale from specimens collected by George Caley. The specific epithet (obtusifolia) means "blunt leaved".
Distribution and habitat
Hoary guinea flower is widespread and locally common in south-east Queensland, all but the far west of New South Wales, the Australian Capital Territory and in mainly eastern Victoria, growing in forest and woodland. There is a single record from Clarke Island in Bass Strait in 1892, but recent surveys have not located the species and it is presumed extinct in that state.
Conservation status
This hibbertia is presumed extinct in Tasmania under the Tasmanian Government Threatened Species Protection Act 1995.
References
obtusifolia
Flora of New South Wales
Flora of the Australian Capital Territory
Flora of Queensland
Flora of Victoria (state)
Flora of Tasmania
Taxa named by Augustin Pyramus de Candolle
Plants described in 1817 |
Mallace is a surname. Notable people with the surname include:
Calum Mallace (born 1990), Scottish-born American soccer player
Craig Mallace (born 1985), Scottish-born American soccer player and coach, brother of Calum
See also
Wallace (surname) |
Shahwar Ali is an Indian actor and model who appears primarily in Bollywood, Tollywood and Sandalwood films.
Early life and career
Sarwar Ali was born and raised in Bhopal, Madhya Pradesh. His father was a farmer in Bhopal. He shifted to Mumbai in 2000. He worked as a ramp model for the fashion brand Calvin Klein for three months in 2002 before joining the film industry. His debut film was Asambhav released in 2004, where he acted alongside Arjun Rampal and Priyanka Chopra.
In 1998, he won an award in Mr. India under "Best Physique category".
Filmography
Films
Television
Power Couple
Amma
Mast Mauli
References
External links
Indian male film actors
Indian male models
Living people
Year of birth missing (living people)
Male actors from Bhopal
Male actors in Telugu cinema
Male actors in Hindi cinema
Male actors in Kannada cinema |
Emmanuel "Masanja Mkandamizaji" Mgaya is a Tanzanian comedian who co-hosts the comedy TV show Orijino Komedi on TBC1 Tanzania with five other Tanzanian comedians (Joti, Mpoki, Wakuvanga, MC Reagan, and Vengu). Emmanuel was born in Ubaruku village, but has since moved to Dar es Salaam. He has worked in the comedy industry since 2005 and is now considered a household name in Tanzania.
Emmanuel is estimated to be worth more than $3m with investments in entertainment, fast food restaurants and commercial agriculture.
He is one of the top 10 most influential Tanzanians on social media., and one of the first Tanzanians to get a million followers on Instagram.
Apart from being a performing artist, Emmanuel is also a pastor and owns a fast growing church known as "Mito ya Baraka", Swahili for Rivers of Blessings in Tanzania's capital, Dar es Salaam. Emmanuel has performed in 4 continents: his native Africa, North America, Asia, and Europe. In 2015 Emmanuel Mgaya participated in election preliminaries for Ludewa Province MP within CCM but subsequently he was not successful
References
External links
Living people
1985 births
Tanzanian television presenters |
```objective-c
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
// This file has been auto-generated by code_generator_v8.py. DO NOT MODIFY!
#ifndef V8SVGFEFuncAElement_h
#define V8SVGFEFuncAElement_h
#include "bindings/core/v8/ScriptWrappable.h"
#include "bindings/core/v8/ToV8.h"
#include "bindings/core/v8/V8Binding.h"
#include "bindings/core/v8/V8DOMWrapper.h"
#include "bindings/core/v8/V8SVGComponentTransferFunctionElement.h"
#include "bindings/core/v8/WrapperTypeInfo.h"
#include "core/CoreExport.h"
#include "core/svg/SVGFEFuncAElement.h"
#include "platform/heap/Handle.h"
namespace blink {
class V8SVGFEFuncAElement {
public:
CORE_EXPORT static bool hasInstance(v8::Local<v8::Value>, v8::Isolate*);
static v8::Local<v8::Object> findInstanceInPrototypeChain(v8::Local<v8::Value>, v8::Isolate*);
CORE_EXPORT static v8::Local<v8::FunctionTemplate> domTemplate(v8::Isolate*);
static SVGFEFuncAElement* toImpl(v8::Local<v8::Object> object)
{
return toScriptWrappable(object)->toImpl<SVGFEFuncAElement>();
}
CORE_EXPORT static SVGFEFuncAElement* toImplWithTypeCheck(v8::Isolate*, v8::Local<v8::Value>);
CORE_EXPORT static const WrapperTypeInfo wrapperTypeInfo;
static void refObject(ScriptWrappable*);
static void derefObject(ScriptWrappable*);
template<typename VisitorDispatcher>
static void trace(VisitorDispatcher visitor, ScriptWrappable* scriptWrappable)
{
#if ENABLE(OILPAN)
visitor->trace(scriptWrappable->toImpl<SVGFEFuncAElement>());
#endif
}
static const int internalFieldCount = v8DefaultWrapperInternalFieldCount + 0;
static void installConditionallyEnabledProperties(v8::Local<v8::Object>, v8::Isolate*) { }
static void preparePrototypeObject(v8::Isolate*, v8::Local<v8::Object> prototypeObject, v8::Local<v8::FunctionTemplate> interfaceTemplate) { }
};
template <>
struct V8TypeOf<SVGFEFuncAElement> {
typedef V8SVGFEFuncAElement Type;
};
} // namespace blink
#endif // V8SVGFEFuncAElement_h
``` |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.