text
stringlengths 1
22.8M
|
|---|
```c++
/*
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*/
#include "InterDexPass.h"
#include "ConfigFiles.h"
#include "DexClass.h"
#include "DexUtil.h"
#include "JsonWrapper.h"
#include "PassManager.h"
#include "Show.h"
#include "StlUtil.h"
#include "WorkQueue.h"
namespace {
/**
* Generated stores need to be added to the root store.
* We achieve this, by adding all the dexes from those stores after the root
* store.
*/
void treat_generated_stores(DexStoresVector& stores,
interdex::InterDex* interdex) {
std20::erase_if(stores, [&](auto& s) {
if (s.is_generated()) {
interdex->add_dexes_from_store(s);
return true;
}
return false;
});
}
} // namespace
namespace interdex {
// TODO: This code shouldn't live here. "baseline_profile_config" should likely
// be part of the GlobalConfig and parsed early on (close to where deep
// data profiles and the betamap get read). Then both InterDexPass and
// ArtProfileWriterPass (and anything else) can read the baseline profile
// config for a build easily.
// Doing it here for now for ease/speed of implementation for an upcoming
// APK test.
void InterDexPass::bind_baseline_profile_config() {
Json::Value baseline_profile_config_json;
bind("baseline_profile_config", {}, baseline_profile_config_json);
if (baseline_profile_config_json.empty() ||
!m_exclude_baseline_profile_classes) {
return;
}
auto interactions_json = baseline_profile_config_json.get("interactions", {});
always_assert(!interactions_json.empty());
for (auto& interaction_pair_json : interactions_json) {
auto id = interaction_pair_json[0].asString();
auto name = interaction_pair_json[1].asString();
m_baseline_profile_config.interaction_configs[id] = {};
m_baseline_profile_config.interactions.emplace_back(std::move(id),
std::move(name));
}
auto options_json = baseline_profile_config_json.get("options", {});
always_assert(!options_json.empty());
auto options_jw = JsonWrapper(options_json);
options_jw.get("oxygen_modules", false,
m_baseline_profile_config.options.oxygen_modules);
options_jw.get("strip_classes", false,
m_baseline_profile_config.options.strip_classes);
options_jw.get("use_redex_generated_profile", false,
m_baseline_profile_config.options.use_redex_generated_profile);
options_jw.get(
"include_betamap_20pct_coldstart", false,
m_baseline_profile_config.options.include_betamap_20pct_coldstart);
options_jw.get(
"betamap_include_coldstart_1pct", false,
m_baseline_profile_config.options.betamap_include_coldstart_1pct);
for (auto it = baseline_profile_config_json.begin();
it != baseline_profile_config_json.end();
++it) {
std::string key = it.memberName();
if (key == "interactions" || key == "options") {
continue;
}
const auto& interaction_id = key;
auto& bpi_config =
m_baseline_profile_config.interaction_configs[interaction_id];
const auto& bpi_config_jw = JsonWrapper(*it);
bpi_config_jw.get("call_threshold", 1, bpi_config.call_threshold);
bpi_config_jw.get("classes", false, bpi_config.classes);
bpi_config_jw.get("post_startup", false, bpi_config.post_startup);
bpi_config_jw.get("startup", false, bpi_config.startup);
bpi_config_jw.get("threshold", 80, bpi_config.threshold);
}
}
void InterDexPass::bind_config() {
bind("static_prune", false, m_static_prune);
bind("emit_canaries", true, m_emit_canaries);
bind("normal_primary_dex", false, m_normal_primary_dex);
bind("order_interdex", true, m_order_interdex);
bind("keep_primary_order", true, m_keep_primary_order);
always_assert_log(m_keep_primary_order || m_normal_primary_dex,
"We always need to respect primary dex order if we treat "
"the primary dex as a special dex.");
bind("linear_alloc_limit", 11600 * 1024, m_linear_alloc_limit);
bind("reserved_frefs", 0, m_reserve_refs.frefs,
"A relief valve for field refs within each dex in case a legacy "
"optimization introduces a new field reference without declaring it "
"explicitly to the InterDex pass");
bind("reserved_trefs", 0, m_reserve_refs.trefs,
"A relief valve for type refs within each dex in case a legacy "
"optimization introduces a new type reference without declaring it "
"explicitly to the InterDex pass");
bind("reserved_mrefs", 0, m_reserve_refs.mrefs,
"A relief valve for methods refs within each dex in case a legacy "
"optimization introduces a new method reference without declaring it "
"explicitly to the InterDex pass");
bind("minimize_cross_dex_refs", false, m_minimize_cross_dex_refs);
bind("minimize_cross_dex_refs_method_ref_weight",
m_minimize_cross_dex_refs_config.method_ref_weight,
m_minimize_cross_dex_refs_config.method_ref_weight);
bind("minimize_cross_dex_refs_field_ref_weight",
m_minimize_cross_dex_refs_config.field_ref_weight,
m_minimize_cross_dex_refs_config.field_ref_weight);
bind("minimize_cross_dex_refs_type_ref_weight",
m_minimize_cross_dex_refs_config.type_ref_weight,
m_minimize_cross_dex_refs_config.type_ref_weight);
bind("minimize_cross_dex_refs_large_string_ref_weight",
m_minimize_cross_dex_refs_config.large_string_ref_weight,
m_minimize_cross_dex_refs_config.large_string_ref_weight);
bind("minimize_cross_dex_refs_small_string_ref_weight",
m_minimize_cross_dex_refs_config.small_string_ref_weight,
m_minimize_cross_dex_refs_config.small_string_ref_weight);
bind("minimize_cross_dex_refs_min_large_string_size",
m_minimize_cross_dex_refs_config.min_large_string_size,
m_minimize_cross_dex_refs_config.min_large_string_size);
bind("minimize_cross_dex_refs_method_seed_weight",
m_minimize_cross_dex_refs_config.method_seed_weight,
m_minimize_cross_dex_refs_config.method_seed_weight);
bind("minimize_cross_dex_refs_field_seed_weight",
m_minimize_cross_dex_refs_config.field_seed_weight,
m_minimize_cross_dex_refs_config.field_seed_weight);
bind("minimize_cross_dex_refs_type_seed_weight",
m_minimize_cross_dex_refs_config.type_seed_weight,
m_minimize_cross_dex_refs_config.type_seed_weight);
bind("minimize_cross_dex_refs_large_string_seed_weight",
m_minimize_cross_dex_refs_config.large_string_seed_weight,
m_minimize_cross_dex_refs_config.large_string_seed_weight);
bind("minimize_cross_dex_refs_small_string_seed_weight",
m_minimize_cross_dex_refs_config.small_string_seed_weight,
m_minimize_cross_dex_refs_config.small_string_seed_weight);
bind("minimize_cross_dex_refs_emit_json", false,
m_minimize_cross_dex_refs_config.emit_json);
bind("minimize_cross_dex_refs_explore_alternatives", 1,
m_minimize_cross_dex_refs_explore_alternatives);
bind("fill_last_coldstart_dex", m_fill_last_coldstart_dex,
m_fill_last_coldstart_dex);
bind("can_touch_coldstart_cls", false, m_can_touch_coldstart_cls);
bind("can_touch_coldstart_extended_cls", false,
m_can_touch_coldstart_extended_cls);
bind("expect_order_list", false, m_expect_order_list);
bind("transitively_close_interdex_order", m_transitively_close_interdex_order,
m_transitively_close_interdex_order);
bind("reorder_dynamically_dead_classes", false,
m_reorder_dynamically_dead_classes);
bind("exclude_baseline_profile_classes", false,
m_exclude_baseline_profile_classes);
bind_baseline_profile_config();
bind("stable_partitions", 0, m_stable_partitions,
"For the unordered classes, how many dexes they should be distributed "
"over in a stable manner, or 0 if stability is not desired");
after_configuration([=] {
always_assert(m_stable_partitions >= 0);
always_assert(m_stable_partitions < (int64_t)MAX_DEX_NUM);
always_assert((m_stable_partitions == 0) || !m_minimize_cross_dex_refs);
});
trait(Traits::Pass::unique, true);
}
void InterDexPass::run_pass(
const Scope& original_scope,
const XStoreRefs& xstore_refs,
const init_classes::InitClassesWithSideEffects&
init_classes_with_side_effects,
DexStoresVector& stores,
DexClassesVector& dexen,
std::vector<std::unique_ptr<InterDexPassPlugin>>& plugins,
ConfigFiles& conf,
PassManager& mgr,
const ReserveRefsInfo& refs_info,
ClassReferencesCache& cache) {
mgr.set_metric(METRIC_LINEAR_ALLOC_LIMIT, m_linear_alloc_limit);
mgr.set_metric(METRIC_RESERVED_FREFS, refs_info.frefs);
mgr.set_metric(METRIC_RESERVED_TREFS, refs_info.trefs);
mgr.set_metric(METRIC_RESERVED_MREFS, refs_info.mrefs);
mgr.set_metric(METRIC_EMIT_CANARIES, m_emit_canaries);
mgr.set_metric(METRIC_ORDER_INTERDEX, m_order_interdex);
// Reflect configuration in stats.
mgr.set_metric("config.normal_primary_dex", m_normal_primary_dex);
mgr.set_metric("config.static_prune", m_static_prune);
mgr.set_metric("config.keep_primary_order", m_keep_primary_order);
mgr.set_metric("config.can_touch_coldstart_cls", m_can_touch_coldstart_cls);
mgr.set_metric("config.can_touch_coldstart_extended_cls",
m_can_touch_coldstart_extended_cls);
mgr.set_metric("config.minimize_cross_dex_refs", m_minimize_cross_dex_refs);
mgr.set_metric("config.minimize_cross_dex_refs_explore_alternatives",
m_minimize_cross_dex_refs_explore_alternatives);
mgr.set_metric("config.transitively_close_interdex_order",
m_transitively_close_interdex_order);
bool force_single_dex = conf.get_json_config().get("force_single_dex", false);
mgr.set_metric("config.force_single_dex", force_single_dex);
InterDex interdex(
original_scope, dexen, mgr.asset_manager(), conf, plugins,
m_linear_alloc_limit, m_static_prune, m_normal_primary_dex,
m_keep_primary_order, force_single_dex, m_order_interdex, m_emit_canaries,
m_minimize_cross_dex_refs, m_fill_last_coldstart_dex,
m_reorder_dynamically_dead_classes, m_minimize_cross_dex_refs_config,
refs_info, &xstore_refs, mgr.get_redex_options().min_sdk,
init_classes_with_side_effects, m_transitively_close_interdex_order,
m_minimize_cross_dex_refs_explore_alternatives, cache,
m_exclude_baseline_profile_classes, std::move(m_baseline_profile_config),
m_stable_partitions);
if (m_expect_order_list) {
always_assert_log(
!interdex.get_interdex_types().empty(),
"Either no betamap was provided, or an empty list was passed in. FIX!");
}
interdex.run();
treat_generated_stores(stores, &interdex);
dexen = interdex.take_outdex();
mgr.set_metric("root_store.dexes", dexen.size());
redex_assert(dexen.size() == interdex.get_dex_info().size());
for (size_t i = 0; i != dexen.size(); ++i) {
std::string key_prefix = "root_store.dexes." + std::to_string(i) + ".";
mgr.set_metric(key_prefix + "classes", dexen[i].size());
auto& info = interdex.get_dex_info()[i];
mgr.set_metric(key_prefix + "primary", info.primary);
mgr.set_metric(key_prefix + "coldstart", info.coldstart);
mgr.set_metric(key_prefix + "extended", info.extended);
mgr.set_metric(key_prefix + "scroll", info.scroll);
mgr.set_metric(key_prefix + "background", info.background);
mgr.set_metric(key_prefix + "betamap_ordered", info.betamap_ordered);
}
auto final_scope = build_class_scope(stores);
for (const auto& plugin : plugins) {
plugin->cleanup(final_scope);
}
mgr.set_metric(METRIC_COLD_START_SET_DEX_COUNT,
interdex.get_num_cold_start_set_dexes());
mgr.set_metric(METRIC_SCROLL_SET_DEX_COUNT, interdex.get_num_scroll_dexes());
mgr.set_metric("transitive_added", interdex.get_transitive_closure_added());
mgr.set_metric("transitive_moved", interdex.get_transitive_closure_moved());
plugins.clear();
const auto& cross_dex_ref_minimizer_stats =
interdex.get_cross_dex_ref_minimizer_stats();
mgr.set_metric(METRIC_REORDER_CLASSES, cross_dex_ref_minimizer_stats.classes);
mgr.set_metric(METRIC_REORDER_RESETS, cross_dex_ref_minimizer_stats.resets);
mgr.set_metric(METRIC_REORDER_REPRIORITIZATIONS,
cross_dex_ref_minimizer_stats.reprioritizations);
const auto& seed_classes = cross_dex_ref_minimizer_stats.seed_classes;
for (size_t i = 0; i < seed_classes.size(); ++i) {
auto& p = seed_classes.at(i);
std::string metric =
METRIC_REORDER_CLASSES_SEEDS + std::to_string(i) + "_" + SHOW(p.first);
mgr.set_metric(metric, p.second);
}
mgr.set_metric(METRIC_CURRENT_CLASSES_WHEN_EMITTING_REMAINING,
interdex.get_current_classes_when_emitting_remaining());
auto& over = interdex.get_overflow_stats();
mgr.set_metric("num_overflows.linear_alloc", over.linear_alloc_overflow);
mgr.set_metric("num_overflows.method_refs", over.method_refs_overflow);
mgr.set_metric("num_overflows.field_refs", over.field_refs_overflow);
mgr.set_metric("num_overflows.type_refs", over.type_refs_overflow);
if (m_reorder_dynamically_dead_classes && !force_single_dex) {
// If dynamically_dead_classes have been reordered, i.e., emitting to the
// last few dexes, record those dexes full of dynamically_dead_classes. This
// info will be used in later reshuffle and classmerging pass.
auto& root_store = stores.at(0);
auto& root_dexen = root_store.get_dexen();
for (size_t dex_index = 1; dex_index < root_dexen.size(); dex_index++) {
auto& dex = root_dexen.at(dex_index);
bool not_dynamically_dead = false;
for (auto cls : dex) {
if (is_canary(cls)) {
continue;
}
if (!cls->is_dynamically_dead()) {
not_dynamically_dead = true;
break;
}
}
if (!not_dynamically_dead) {
m_dynamically_dead_dexes.emplace(dex_index);
TRACE(IDEX, 2, "Dex %zu is dynamically_dead_dex\n", dex_index);
}
}
}
}
void InterDexPass::run_pass_on_nonroot_store(
const Scope& original_scope,
const XStoreRefs& xstore_refs,
const init_classes::InitClassesWithSideEffects&
init_classes_with_side_effects,
DexClassesVector& dexen,
ConfigFiles& conf,
PassManager& mgr,
const ReserveRefsInfo& refs_info,
ClassReferencesCache& cache) {
// Setup default configs for non-root store
// For now, no plugins configured for non-root stores to run.
std::vector<std::unique_ptr<InterDexPassPlugin>> plugins;
// Cross dex ref minimizers are disabled for non-root stores
// TODO: Make this logic cleaner when these features get enabled for non-root
// stores. Would also need to clean up after it.
cross_dex_ref_minimizer::CrossDexRefMinimizerConfig cross_dex_refs_config;
// Initialize interdex and run for nonroot store
InterDex interdex(
original_scope, dexen, mgr.asset_manager(), conf, plugins,
m_linear_alloc_limit, m_static_prune, m_normal_primary_dex,
m_keep_primary_order, false /* force single dex */, m_order_interdex,
false /* emit canaries */, false /* minimize_cross_dex_refs */,
/* fill_last_coldstart_dex=*/false,
/* reorder_dynamically_dead_classes =*/false, cross_dex_refs_config,
refs_info, &xstore_refs, mgr.get_redex_options().min_sdk,
init_classes_with_side_effects, m_transitively_close_interdex_order,
m_minimize_cross_dex_refs_explore_alternatives, cache,
m_exclude_baseline_profile_classes, std::move(m_baseline_profile_config),
m_stable_partitions);
interdex.run_on_nonroot_store();
dexen = interdex.take_outdex();
}
void InterDexPass::run_pass(DexStoresVector& stores,
ConfigFiles& conf,
PassManager& mgr) {
Scope original_scope = build_class_scope(stores);
init_classes::InitClassesWithSideEffects init_classes_with_side_effects(
original_scope, conf.create_init_class_insns());
XStoreRefs xstore_refs(stores);
// Setup all external plugins.
InterDexRegistry* registry = static_cast<InterDexRegistry*>(
PluginRegistry::get().pass_registry(INTERDEX_PASS_NAME));
auto plugins = registry->create_plugins();
for (const auto& plugin : plugins) {
plugin->configure(original_scope, conf);
}
ReserveRefsInfo refs_info = m_reserve_refs;
refs_info += mgr.get_reserved_refs();
ClassReferencesCache cache(original_scope);
std::vector<DexStore*> parallel_stores;
for (auto& store : stores) {
if (store.is_root_store()) {
run_pass(original_scope, xstore_refs, init_classes_with_side_effects,
stores, store.get_dexen(), plugins, conf, mgr, refs_info, cache);
} else if (!store.is_generated()) {
parallel_stores.push_back(&store);
}
}
workqueue_run<DexStore*>(
[&](DexStore* store) {
run_pass_on_nonroot_store(
original_scope, xstore_refs, init_classes_with_side_effects,
store->get_dexen(), conf, mgr, refs_info, cache);
mgr.set_metric("nonroot_store." + store->get_name() + ".dexes",
store->get_dexen().size());
},
parallel_stores);
++m_run;
// For the last invocation, record that final interdex has been done.
if (m_eval == m_run) {
mgr.record_running_interdex();
}
}
static InterDexPass s_pass;
} // namespace interdex
```
|
Shlomo Lavi (, born Shlomo Levkovich in 1882, died 23 July 1963) was a Zionist activist and politician.
Early life
Born in Plonsk in the Russian Empire (today in Poland), Lavi received a religious education. While growing up in Plonsk, Shlomo Lavi and David Grün (the future founding father of Israel, David Ben-Gurion) were both members of the Ezra youth movement and together taught Bible lessons and Hebrew to poor and orphaned children.
Zionist activity
In 1905 he made aliyah to Ottoman Palestine as part of the second Zionist wave of immigration. In the same year he attended the founding convention of Hapoel Hatzair.
Lavi worked as an agricultural laborer in Petach-Tikva, in an olive oil factory in Haifa, then at the recommendation of Arthur Ruppin as farm manager in Hulda, and together with David Ben-Gurion at Sejera.
Lavi was involved in the establishment of the Jewish defence organisation Hashomer (1909-1920), which he joined as a watchman in the Galilee, in Hedera and Rehovot.
Later on he joined the founders of Kvutzat Kinneret, where he worked at reclaiming marshlands.
Lavi was throughout his life a dedicated member of the Zionist Labour movement and one of its ideologists. Berl Katznelson, one of the founders of Labour Zionism in pre-state Israel, described Lavi as one of the "First Ten" founders of the movement. He became one of the leaders and ideologists of Ahdut HaAvoda, and later co-founded Mapai.
In 1920, he was among the founders of the Histadrut trade union.
In the wake of World War I, a large influx of Jewish immigrants from the former Russian Empire was to be expected and Lavi looked for ways to prepare for their arrival, both in terms of housing and working places. In this context, Lavi became the originator of the idea of the larger communal settlement, the kibbutz, as opposed to the smaller kvutza preferred by earlier pioneers; in 1921 he helped establish the first such settlement, Kibbutz Ein Harod. Here he lived and worked for the rest of his life.
Lavi participated as a delegate in the 12th, 17th, 18th and 19th Zionist Congresses, held in 1921, 1931, 1933 and 1935, respectively.
A member of the Haganah underground militia, during World War II he joined the British Army at the age of 60.
Both sons of Shlomo Lavi, Yerubaal and Hillel, were killed during 1948 Arab–Israeli War, as was his brother Hillel.
In 1949, Lavi was elected to the first Knesset on the Mapai party list. He was re-elected in 1951, but lost his seat in the 1955 elections. As a lawmaker he proposed the nationalisation of the various health and medical care programmes.
A 1926 separation between two Harod Valley kibbutzim, Tel Yosef and Lavi's Ein Harod, was not to Lavi's liking, but it was nothing compared to the breakup of Kibbutz Ein Harod itself, during the sometimes violent split of the Kibbutz Movement of 1952 into the Ahdut HaAvoda/Mapai-affiliated, center-left "Ihud" branch and the Mapam's more Marxist-oriented "Meuhad" branch, which deeply affected Lavi.
Late years
Shlomo Lavi spent the late years of his life in Ein Harod, finishing his last book and working in his garden. He died in 1963 and was buried in Ein Harod's Old Cemetery, at the foot of Mount Gilboa, next to his wife Rachel and his two sons. He was survived by his daughter, Ilana (born 1926).
Works
Igrot Hillel ("The Letters of Hillel")
HaKvutzah HaGdolah ("The Large Kvutza", or group, a synonym for "kibbutz")
Kinat Av ("Mourning of A Father")
Megilati b'Ein Harod ("My Story in Ein Harod")
Zimunei Haim ("Availability in Life")
Ktavim Nivharim ("Selected Articles")
Maarahot ("Battles")
Alilato Shel Shlomo Laish ("The Story of Shlomo Laish")
References
1882 births
1963 deaths
People from Płońsk
Polish emigrants to Israel
Polish Zionists
Jews from Ottoman Palestine
Haganah members
Emigrants from the Russian Empire to the Ottoman Empire
Jews from the Russian Empire
Israeli trade unionists
Mapai politicians
Ahdut HaAvoda politicians
Jews from Mandatory Palestine
Members of the 1st Knesset (1949–1951)
Members of the 2nd Knesset (1951–1955)
|
1983–1986 is an album of Polish new wave group Sni Sredstvom Za Uklanianie, released in 2008 by Biodro Records. It contains sixteen songs recorded in 1995. Sni Sredstvom Za Uklanianie was split up in 1988 but Tymon Tymański decided to reunite his band for two weeks only to record songs played live between 1983 and 1986. Songs were previously recorded in Gdańsk music studio SAR in 1986, but tapes with this material were irretrievably lost.
Track listing
Personnel
Tymon Tymański – voice, guitar
Piotr Merta – guitar
Bartek Szmit – drums
References
2008 compilation albums
Sni Sredstvom Za Uklanianie compilation albums
Biodro Records compilation albums
Polish-language compilation albums
|
```php
<?php
// some file
```
|
```html
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>buffered_read_stream::buffered_read_stream (1 of 2 overloads)</title>
<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
<link rel="home" href="../../../../index.html" title="Chapter 1. Boost.Beast">
<link rel="up" href="../buffered_read_stream.html" title="buffered_read_stream::buffered_read_stream">
<link rel="prev" href="../buffered_read_stream.html" title="buffered_read_stream::buffered_read_stream">
<link rel="next" href="overload2.html" title="buffered_read_stream::buffered_read_stream (2 of 2 overloads)">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
<td align="center"><a href="../../../../../../../../index.html">Home</a></td>
<td align="center"><a href="../../../../../../../../libs/libraries.htm">Libraries</a></td>
<td align="center"><a href="path_to_url">People</a></td>
<td align="center"><a href="path_to_url">FAQ</a></td>
<td align="center"><a href="../../../../../../../../more/index.htm">More</a></td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="../buffered_read_stream.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../buffered_read_stream.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="overload2.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section">
<div class="titlepage"><div><div><h6 class="title">
<a name="beast.ref.boost__beast__buffered_read_stream.buffered_read_stream.overload1"></a><a class="link" href="overload1.html" title="buffered_read_stream::buffered_read_stream (1 of 2 overloads)">buffered_read_stream::buffered_read_stream
(1 of 2 overloads)</a>
</h6></div></div></div>
<p>
Move constructor.
</p>
<h7><a name="beast.ref.boost__beast__buffered_read_stream.buffered_read_stream.overload1.h0"></a>
<span class="phrase"><a name="beast.ref.boost__beast__buffered_read_stream.buffered_read_stream.overload1.synopsis"></a></span><a class="link" href="overload1.html#beast.ref.boost__beast__buffered_read_stream.buffered_read_stream.overload1.synopsis">Synopsis</a>
</h7><pre class="programlisting"><span class="identifier">buffered_read_stream</span><span class="special">(</span>
<span class="identifier">buffered_read_stream</span><span class="special">&&);</span>
</pre>
<h7><a name="beast.ref.boost__beast__buffered_read_stream.buffered_read_stream.overload1.h1"></a>
<span class="phrase"><a name="beast.ref.boost__beast__buffered_read_stream.buffered_read_stream.overload1.description"></a></span><a class="link" href="overload1.html#beast.ref.boost__beast__buffered_read_stream.buffered_read_stream.overload1.description">Description</a>
</h7><h7><a name="beast.ref.boost__beast__buffered_read_stream.buffered_read_stream.overload1.h2"></a>
<span class="phrase"><a name="beast.ref.boost__beast__buffered_read_stream.buffered_read_stream.overload1.remarks"></a></span><a class="link" href="overload1.html#beast.ref.boost__beast__buffered_read_stream.buffered_read_stream.overload1.remarks">Remarks</a>
</h7><p>
The behavior of move assignment on or from streams with active or pending
operations is undefined.
</p>
</div>
<table xmlns:rev="path_to_url~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
file LICENSE_1_0.txt or copy at <a href="path_to_url" target="_top">path_to_url
</p>
</div></td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="../buffered_read_stream.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../buffered_read_stream.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="overload2.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
```
|
Kerr Eby (19 October 1889 – 18 November 1946) was a Canadian illustrator best known for his renderings of soldiers in combat in the First and Second World Wars. He is held in a similar regard to Harvey Dunn and the other famous illustrators dispatched by the government to cover the First World War.
Early life and education
Born in Tokyo, Japan to Canadian Methodist missionary parents in 1889, Eby received formal art training at Pratt Institute and the Art Students League of New York.
Career
Enlisting in the Army in 1917, Eby served in an ambulance crew and later as a camoufleur. Although unable to acquire an artist's commission to cover the war, he created many memorable and haunting images of soldiers both in combat and living their daily lives on the front.
In the 1920s and 1930s, Eby continued to occasionally generate pieces related to his experience, and worked many of his early sketches into completed lithographs. These images were eventually collected and distributed in the book WAR, which remains in the collection of many libraries today. Notable images in this collection include a haunting drawing of marines retreating across the countryside beneath a menacing black cloud. In 1930, he was elected into the National Academy of Design as an Associate member, and became a full Academician in 1934. He was also a member of the Society of American Graphic Artists. His work was part of the painting event in the art competition at the 1932 Summer Olympics.
As the United States returned to war in 1941, Eby attempted to reenlist but was denied because of his age. He found service instead in the combat artists program created by Abbott Laboratories to cover the war. He operated primarily in the Pacific during World War II, where he landed with the Marines on Tarawa and Guadalcanal. He created many of his strongest works, and put his life on the line to capture the experiences he shared with those soldiers.
Eby contracted a tropical disease while covering the war in Bougainville, and would die at his home in Westport, Connecticut in 1946. He left behind a great body of completed work and much that was still in progress. These drawings, prints, and paintings serve as both historical record and primary documentation of the American experience of war in the 20th century.
Collections
Eby's work is held in the permanent collections of many museums throughout the United States, including the Smithsonian American Art Museum, the Detroit Institute of Arts, the Whitney Museum of American Art, the Smart Museum of Art, the Crystal Bridges Museum of American Art, the Worcester Art Museum, the Farnsworth Art Museum, the Nelson-Atkins Museum of Art, the University of Michigan Museum of Art, the Hood Museum of Art, the Philadelphia Museum of Art, the Delaware Art Museum, and the Williams College Museum of Art.
Sample works
References
External links
Naval History article on Kerr Eby
Art Students League of New York alumni
Canadian illustrators
Canadian printmakers
Canadian war artists
1946 deaths
1889 births
World War I artists
World War II artists
20th-century Canadian printmakers
Artists from Tokyo
National Academy of Design members
Olympic competitors in art competitions
Canadian male artists
20th-century Canadian male artists
Canadian expatriates in Japan
Canadian expatriates in the United States
Members of the American Academy of Arts and Letters
|
Broadband acoustic resonance dissolution spectroscopy (BARDS) is a technique in analytical chemistry. Developed in the late 2000s, it involves the analysis of the changes in sound frequency generated when a solute dissolves in a solvent, by harnessing the hot chocolate effect first described by Frank S. Crawford.
The technique is partly based on the solubility difference of gas in pure solvents and in solutions. The dissolution of a compound in a pure solvent results in the generation of gas bubbles in the solvent, due to the lowering of gas solubility in the resulting solution, as well as the introduction of gases with the solute. The presence of these gas bubbles increases the compressibility of the solution, thereby lowering the velocity of sound in the solution. This effect can be monitored by means of the frequency change of acoustic resonances that are mechanically produced in the solvent.
Principles of the BARDS response
Water is approximately 800 times more dense than air. However, air is approximately 15,000 times more compressible than water. The velocity of sound, υ, in a homogeneous liquid or gas is given by the following equation:
where ρ is the mass density and K the compressibility of the gas or liquid. K is given as:
where V is the volume of the medium, and dV is the volume decrease due to the pressure increase dp of the sound wave. When water is filled with air bubbles, the fluid density is essentially the density of water, and the air will contribute significantly to the compressibility. Crawford derived the relationship between fractional bubble volume and sound velocity in water, and hence the sound frequency in water, given as.
where υw and υ are the velocities of sound in pure and bubble-filled water, respectively, fw and f are the frequencies of sound in pure and bubble-filled water, respectively, Va is defined as the fractional volume occupied by gas bubbles, and α is a constant. When the solvent is water and the gas is air, the value of α is 1.49 × 104.
The effect of changes in solution density and solution compressibility are additive and reinforce the phenomenon, causing a significant decrease in the velocity of sound and, therefore, a significant decrease in the frequency of sound passing through an aerated solution.
Applications
BARDS has significant potential as an analytical technique. Applications researched so far include:
Batch consistency analysis
Blend uniformity analysis
Polymorph and pseudopolymorph discrimination
Monitoring of supersaturation of solutions and rates of outgassing
See also
The hot chocolate effect, the physical phenomenon on which the technique is based.
Acoustic resonance spectroscopy
References
Spectroscopy
|
Quarterstaff: The Tomb of Setmoth is an interactive fiction role-playing video game developed by Scott Schmitz and Ken Updike and released by Infocom for Macintosh in 1988. The game features a text parser, graphics, a dynamically updated map, and a graphical interface that incorporates Mac OS hierarchical menus.
Overview
The player takes the part of Titus, a former blacksmith sent by the Druid Council to explore the remains of an underground colony of druids who vanished without a trace. During the course of his adventures, Titus may befriend other characters and persuade them to join his party. Character skills improve with practice, and the game tracks the hunger, thirst and energy levels of characters.
Release history
Quarterstaff: The Tomb of Setmoth was based on Quarterstaff, a game released by Simulated Environment Systems in 1987. Simulated Environment Systems designed the game to support add-on modularity, and planned to create a town module to serve as a hub from which to send the characters of Quarterstaff on other adventures, retaining their inventories and experience.
Activision purchased the rights to the game from Simulated Environment Systems in 1988, and released the game with improvements including color graphics, an upgraded interface, and writing input from Amy Briggs. Infocom revised the narrative voice from a mix of second and third person to a consistent third person narration. The box cover art was by Ken Barr and was reproduced in a color poster packaged with the game. Versions for the Apple IIGS and IBM PC were announced but never released due to low sales. A planned sequel titled Storm Giants was never released.
Infocom billed Quarterstaff as their first fantasy role-playing game, although Beyond Zork, released the previous year, had role-playing game elements. Quarterstaff was part of Activision's strategy to broaden Infocom's appeal in the wake of their acquisition of Infocom in 1986. Activision hoped to build on Infocom's tradition of text-based adventures by adding graphics in an attempt to attract players increasingly accustomed to more complex games that made use of rapidly evolving hardware. Quarterstaff and BattleTech: The Crescent Hawk's Inception (1988) were the first two Infocom games developed by outside sources; both broke from Infocom traditions as graphically rich role-playing games.
StarCraft, Inc. released Japanese language versions of Quarterstaff for PC-98 in 1990 and Sharp X68000 in 1991.
Reception
The Simulated Environment Systems version of Quarterstaff was reviewed positively in Dragon, which called it "among the finest fantasy role-playing games available for any system" and "the most true to form FRP game we've found". Dragon praised the game's NPC artificial intelligence and the need to coordinate the actions of player characters. The Dragon reviewers gave the game 5 out of 5 stars.
Macworld reviewed the Simulated Environment Systems version of Quarterstaff, praising its UI, stating that the "Interface lets you concentrate on solving game puzzles, rather than on the quirks of the interface". Macworld furthermore praises its "flexible" gameplay, expressing that "Quarterstaff offers a refreshing degree of flexibility in the types of activity it will accept. You can divide your group to explore different rooms ... In combat, you can engage in missile fire across room boundaries - Eolene can stand out of harm's way and fire arrows at a monster in the next room while Bruno and Titus charge in and attack face-to-face. The ability to direct individual or group efforts gives you a certain amount of tactical creativity." Macworld also praises the sound, automap feature, graphics, and lack of 'instant death' traps, instead allowing the player to escape triggered traps, or bring other members of the party to rescue them. They call Quarterstaff "a new approach to an old computer-game genre." Macworld however heavily criticizes a fatal glitch in their 1.0 review copy; one of the puzzles required to complete the game is unable to be completed.
MacUser magazine rated the Simulated Environment Systems version of Quarterstaff four out of five mice, calling it a "must-have" for fantasy role-playing fans and saying that it "closely approximates what it's like to play a non-computer fantasy role-playing game." MacUser suggested that newcomers to role-playing games might prefer a lighter, less time-intensive introduction to the genre.
Tilt gave the Infocom version of Quarterstaff 18 out of 20, singling out the game's digitized sound and high quality writing, and describing the interface as a model of flexibility. Tilt praised the game's blend of role-playing and adventure game elements and called Quarterstaff the best game they'd seen on the Macintosh that year.
Feelies
Infocom included extra novelty items called feelies with their packaged games. Included with Quarterstaff were:
A parchment, titled "The Path to Enlightenment"
A wooden druidic coin, which could be used in conjunction with the parchment and an in-game wand to identify items
A color poster
References
External links
Quarterstaff at Resonant.org
1988 video games
Classic Mac OS games
Infocom games
NEC PC-9801 games
Role-playing video games
X68000 games
Video games developed in the United States
Video games scored by Russell Lieblich
|
```asciidoc
[[rewritelocationresponseheader-filter]]
= `RewriteLocationResponseHeader` Filter
The `RewriteLocationResponseHeader` filter modifies the value of the `Location` response header, usually to get rid of backend-specific details.
It takes the `stripVersionMode`, `locationHeaderName`, `hostValue`, and `protocolsRegex` parameters.
The following listing configures a `RewriteLocationResponseHeader` filter:
.application.yml
[source,yaml]
----
spring:
cloud:
gateway:
mvc:
routes:
- id: rewritelocationresponseheader_route
uri: path_to_url
filters:
- RewriteLocationResponseHeader=AS_IN_REQUEST, Location, ,
----
.GatewaySampleApplication.java
[source,java]
----
import static org.springframework.cloud.gateway.server.mvc.filter.AfterFilterFunctions.addResponseHeader;
import static org.springframework.cloud.gateway.server.mvc.filter.RewriteLocationResponseHeaderFilterFunctions.StripVersion;
import static org.springframework.cloud.gateway.server.mvc.handler.GatewayRouterFunctions.route;
import static org.springframework.cloud.gateway.server.mvc.handler.HandlerFunctions.http;
@Configuration
class RouteConfiguration {
@Bean
public RouterFunction<ServerResponse> gatewayRouterFunctionsRewriteLocationResponseHeader() {
return route("rewritelocationresponseheader_route")
.GET("/**", http("path_to_url"))
.after(rewriteLocationResponseHeader(config -> config.setLocationHeaderName("Location").setStripVersion(StripVersion.AS_IN_REQUEST)))
.build();
}
}
----
For example, for a request of `POST path_to_url`, the `Location` response header value of `path_to_url` is rewritten as `path_to_url`.
The `stripVersionMode` parameter has the following possible values: `NEVER_STRIP`, `AS_IN_REQUEST` (default), and `ALWAYS_STRIP`.
* `NEVER_STRIP`: The version is not stripped, even if the original request path contains no version.
* `AS_IN_REQUEST`: The version is stripped only if the original request path contains no version.
* `ALWAYS_STRIP`: The version is always stripped, even if the original request path contains version.
The `hostValue` parameter, if provided, is used to replace the `host:port` portion of the response `Location` header.
If it is not provided, the value of the `Host` request header is used.
The `protocolsRegex` parameter must be a valid regex `String`, against which the protocol name is matched.
If it is not matched, the filter does nothing.
The default is `http|https|ftp|ftps`.
```
|
```c++
/*
This program is free software; you can redistribute it and/or modify
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
#ifndef ATTRIBUTE_LIST_HPP
#define ATTRIBUTE_LIST_HPP
#include "ndb_limits.h"
/**
* Masks and lists used by index and trigger. Must be plain old Uint32 data.
* XXX depends on other headers XXX move to some common file
*/
typedef Bitmask<MAXNROFATTRIBUTESINWORDS> AttributeMask;
typedef BitmaskPOD<MAXNROFATTRIBUTESINWORDS> AttributeMaskPOD;
template <Uint32 SZ>
struct Id_array
{
Uint32 sz;
Uint32 id[SZ];
};
typedef Id_array<MAX_ATTRIBUTES_IN_INDEX> IndexAttributeList;
#endif
```
|
```kotlin
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package com.google.android.flexbox
import android.os.Bundle
import android.widget.Toast
import androidx.fragment.app.FragmentActivity
import androidx.preference.EditTextPreference
import androidx.preference.Preference
import androidx.preference.PreferenceFragmentCompat
import com.google.android.apps.flexbox.R
import com.google.android.flexbox.validators.DimensionInputValidator
import com.google.android.flexbox.validators.FlexBasisPercentInputValidator
import com.google.android.flexbox.validators.IntegerInputValidator
import com.google.android.flexbox.validators.NonNegativeDecimalInputValidator
internal class SettingsActivity : FragmentActivity() {
override fun onCreate(savedInstanceState: Bundle?) {
super.onCreate(savedInstanceState)
// Display the fragment as the main content.
supportFragmentManager.beginTransaction().replace(android.R.id.content,
SettingsFragment()).commit()
}
/**
* Fragment for settings.
*/
class SettingsFragment : PreferenceFragmentCompat() {
override fun onCreatePreferences(savedInstanceState: Bundle?, s: String?) {
addPreferencesFromResource(R.xml.new_flex_item_preferences)
val orderPreference = findPreference(
getString(R.string.new_flex_item_order_key)) as EditTextPreference?
orderPreference?.onPreferenceChangeListener = Preference.OnPreferenceChangeListener { _, newValue ->
val validator = IntegerInputValidator()
if (!validator.isValidInput(newValue.toString())) {
Toast.makeText(activity,
R.string.must_be_integer,
Toast.LENGTH_LONG).show()
return@OnPreferenceChangeListener false
}
true
}
val flexGrowPreference = findPreference(
getString(R.string.new_flex_grow_key)) as EditTextPreference?
flexGrowPreference?.onPreferenceChangeListener = Preference.OnPreferenceChangeListener { _, newValue ->
val validator = NonNegativeDecimalInputValidator()
if (!validator.isValidInput(newValue.toString())) {
Toast.makeText(activity,
R.string.must_be_non_negative_float,
Toast.LENGTH_LONG).show()
return@OnPreferenceChangeListener false
}
true
}
val flexShrinkPreference = findPreference(
getString(R.string.new_flex_shrink_key)) as EditTextPreference?
flexShrinkPreference?.onPreferenceChangeListener = Preference.OnPreferenceChangeListener { _, newValue ->
val validator = NonNegativeDecimalInputValidator()
if (!validator.isValidInput(newValue.toString())) {
Toast.makeText(activity,
R.string.must_be_non_negative_float,
Toast.LENGTH_LONG).show()
return@OnPreferenceChangeListener false
}
true
}
val flexBasisPercentPreference = findPreference(
getString(R.string.new_flex_basis_percent_key)) as EditTextPreference?
flexBasisPercentPreference?.onPreferenceChangeListener = Preference.OnPreferenceChangeListener { _, newValue ->
val validator = FlexBasisPercentInputValidator()
if (!validator.isValidInput(newValue.toString())) {
Toast.makeText(activity,
R.string.must_be_minus_one_or_non_negative_integer,
Toast.LENGTH_LONG).show()
return@OnPreferenceChangeListener false
}
true
}
val widthPreference = findPreference(
getString(R.string.new_width_key)) as EditTextPreference?
widthPreference?.onPreferenceChangeListener = Preference.OnPreferenceChangeListener { _, newValue ->
val validator = DimensionInputValidator()
if (!validator.isValidInput(newValue.toString())) {
Toast.makeText(activity,
R.string.must_be_minus_one_or_minus_two_or_non_negative_integer,
Toast.LENGTH_LONG).show()
return@OnPreferenceChangeListener false
}
true
}
val heightPreference = findPreference(
getString(R.string.new_height_key)) as EditTextPreference?
heightPreference?.onPreferenceChangeListener = Preference.OnPreferenceChangeListener { _, newValue ->
val validator = DimensionInputValidator()
if (!validator.isValidInput(newValue.toString())) {
Toast.makeText(activity,
R.string.must_be_minus_one_or_minus_two_or_non_negative_integer,
Toast.LENGTH_LONG).show()
return@OnPreferenceChangeListener false
}
true
}
}
}
}
```
|
Bucknor may refer to:
People
Bucknor (surname)
Places
Jamaica
Bucknors Bay, an alternate name of Rio Nuevo Bay in Jamaica, at the outlet of the Rio Nuevo.
See also
Buckner (disambiguation)
|
```php
<?php
declare(strict_types=1);
/**
* Login module.
*
* This file is part of MadelineProto.
* MadelineProto 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.
* If not, see <path_to_url
*
* @author Daniil Gentili <daniil@daniil.it>
* @copyright 2016-2023 Daniil Gentili <daniil@daniil.it>
* @license path_to_url AGPLv3
* @link path_to_url MadelineProto documentation
*/
namespace danog\MadelineProto\Wrappers;
use Amp\Cancellation;
use Amp\CancelledException;
use Amp\DeferredCancellation;
use Amp\DeferredFuture;
use AssertionError;
use danog\MadelineProto\API;
use danog\MadelineProto\DataCenter;
use danog\MadelineProto\Exception;
use danog\MadelineProto\Lang;
use danog\MadelineProto\Logger;
use danog\MadelineProto\MTProto\PermAuthKey;
use danog\MadelineProto\MTProto\TempAuthKey;
use danog\MadelineProto\MTProtoTools\PasswordCalculator;
use danog\MadelineProto\RPCError\PasswordHashInvalidError;
use danog\MadelineProto\RPCError\SessionPasswordNeededError;
use danog\MadelineProto\RPCErrorException;
use danog\MadelineProto\Settings;
use danog\MadelineProto\TL\Types\LoginQrCode;
use danog\MadelineProto\Tools;
/**
* Manages logging in and out.
*
* @property Settings $settings Settings
* @property ?LoginQrCode $loginQrCode
* @internal
*/
trait Login
{
/**
* Login as bot.
*
* @param string $token Bot token
*/
public function botLogin(string $token): array|null
{
if ($this->authorized === \danog\MadelineProto\API::LOGGED_IN) {
return null;
}
$callbacks = [$this, $this->referenceDatabase, $this->peerDatabase];
/** @psalm-suppress InvalidArgument */
$this->TL->updateCallbacks($callbacks);
$this->logger->logger(Lang::$current_lang['login_bot'], Logger::NOTICE);
return $this->processAuthorization($this->methodCallAsyncRead(
'auth.importBotAuthorization',
[
'bot_auth_token' => $token,
'api_id' => $this->settings->getAppInfo()->getApiId(),
'api_hash' => $this->settings->getAppInfo()->getApiHash(),
],
));
}
private ?DeferredCancellation $qrLoginDeferred = null;
/**
* Initiates QR code login.
*
* Returns a QR code login helper object, that can be used to render the QR code, display the link directly, wait for login, QR code expiration and much more.
*
* Returns null if we're already logged in, or if we're waiting for a password (use getAuthorization to distinguish between the two cases).
*/
public function qrLogin(): ?LoginQrCode
{
if ($this->authorized === \danog\MadelineProto\API::LOGGED_IN) {
return null;
} elseif ($this->authorized === \danog\MadelineProto\API::WAITING_PASSWORD) {
return null;
} elseif ($this->authorized !== API::NOT_LOGGED_IN) {
throw new AssertionError("Unexpected state {$this->authorized}!");
}
$this->qrLoginDeferred ??= new DeferredCancellation;
if (!$this->loginQrCode || $this->loginQrCode->isExpired()) {
try {
$authorization = $this->methodCallAsyncRead(
'auth.exportLoginToken',
[
'api_id' => $this->settings->getAppInfo()->getApiId(),
'api_hash' => $this->settings->getAppInfo()->getApiHash(),
],
);
$datacenter = $this->datacenter->currentDatacenter;
if ($authorization['_'] === 'auth.loginToken') {
return $this->loginQrCode = new LoginQrCode(
$this,
"tg://login?token=".Tools::base64urlEncode((string) $authorization['token']),
$authorization['expires']
);
}
if ($authorization['_'] === 'auth.loginTokenMigrateTo') {
$datacenter = $this->isTestMode() ? 10_000 + $authorization['dc_id'] : $authorization['dc_id'];
$this->authorized_dc = $datacenter;
$authorization = $this->methodCallAsyncRead(
'auth.importLoginToken',
$authorization,
$datacenter
);
}
$this->processAuthorization($authorization['authorization']);
} catch (SessionPasswordNeededError) {
$this->logger->logger(Lang::$current_lang['login_2fa_enabled'], Logger::NOTICE);
$this->authorization = $this->methodCallAsyncRead('account.getPassword', [], $datacenter ?? null);
if (!isset($this->authorization['hint'])) {
$this->authorization['hint'] = '';
}
$this->authorized = \danog\MadelineProto\API::WAITING_PASSWORD;
$this->qrLoginDeferred?->cancel();
$this->qrLoginDeferred = null;
return null;
}
return null;
}
return $this->loginQrCode;
}
/**
* @internal
*/
public function getQrLoginCancellation(): Cancellation
{
if ($this->qrLoginDeferred) {
return $this->qrLoginDeferred->getCancellation();
}
$c = new DeferredCancellation;
$c->cancel();
return $c->getCancellation();
}
/**
* Logout the session.
*/
public function logout(): void
{
if ($this->authorized === API::LOGGED_IN) {
$this->authorized = API::LOGGED_OUT;
$this->methodCallAsyncRead('auth.logOut', []);
}
$this->authorized = API::LOGGED_OUT;
if ($this->hasEventHandler()) {
$this->stop();
} else {
$this->ipcServer?->stop();
}
}
/** @internal */
public function waitQrLogin(): void
{
if (!$this->qrLoginDeferred) {
return;
}
try {
(new DeferredFuture)->getFuture()->await($this->getQrLoginCancellation());
} catch (CancelledException) {
}
}
/**
* Login as user.
*
* @param string $number Phone number
* @param integer $sms_type SMS type
*/
public function phoneLogin(string $number, int $sms_type = 5): array
{
if ($this->authorized === \danog\MadelineProto\API::LOGGED_IN) {
throw new Exception(Lang::$current_lang['already_loggedIn']);
}
$this->logger->logger(Lang::$current_lang['login_code_sending'], Logger::NOTICE);
$this->authorization = $this->methodCallAsyncRead(
'auth.sendCode',
[
'settings' => ['_' => 'codeSettings'],
'phone_number' => $number,
'sms_type' => $sms_type,
'api_id' => $this->settings->getAppInfo()->getApiId(),
'api_hash' => $this->settings->getAppInfo()->getApiHash(),
'lang_code' => $this->settings->getAppInfo()->getLangCode(),
],
);
$this->authorization['phone_number'] = $number;
//$this->authorization['_'] .= 'MP';
$this->authorized = \danog\MadelineProto\API::WAITING_CODE;
$this->logger->logger(Lang::$current_lang['login_code_sent'], Logger::NOTICE);
return $this->authorization;
}
/**
* Complet user login using login code.
*
* @param string $code Login code
*/
public function completePhoneLogin(string $code): array
{
if ($this->authorized !== \danog\MadelineProto\API::WAITING_CODE) {
throw new Exception(Lang::$current_lang['login_code_uncalled']);
}
$this->authorized = API::NOT_LOGGED_IN;
$this->logger->logger(Lang::$current_lang['login_user'], Logger::NOTICE);
try {
$authorization = $this->methodCallAsyncRead('auth.signIn', ['phone_number' => $this->authorization['phone_number'], 'phone_code_hash' => $this->authorization['phone_code_hash'], 'phone_code' => $code]);
} catch (SessionPasswordNeededError) {
$this->logger->logger(Lang::$current_lang['login_2fa_enabled'], Logger::NOTICE);
$this->authorization = $this->methodCallAsyncRead('account.getPassword', []);
if (!isset($this->authorization['hint'])) {
$this->authorization['hint'] = '';
}
$this->authorized = \danog\MadelineProto\API::WAITING_PASSWORD;
return $this->authorization;
} catch (RPCErrorException $e) {
if ($e->rpc === 'PHONE_NUMBER_UNOCCUPIED') {
$this->logger->logger(Lang::$current_lang['login_need_signup'], Logger::NOTICE);
$this->authorized = \danog\MadelineProto\API::WAITING_SIGNUP;
$this->authorization['phone_code'] = $code;
return ['_' => 'account.needSignup'];
}
throw $e;
}
if ($authorization['_'] === 'auth.authorizationSignUpRequired') {
$this->logger->logger(Lang::$current_lang['login_need_signup'], Logger::NOTICE);
$this->authorized = \danog\MadelineProto\API::WAITING_SIGNUP;
$this->authorization['phone_code'] = $code;
$authorization['_'] = 'account.needSignup';
return $authorization;
}
return $this->processAuthorization($authorization);
}
/**
* Import authorization.
*
* @param array<int, string> $authorization Authorization info
* @param int $mainDcID Main DC ID
*/
public function importAuthorization(array $authorization, int $mainDcID): array
{
if ($this->authorized === \danog\MadelineProto\API::LOGGED_IN) {
throw new Exception(Lang::$current_lang['already_loggedIn']);
}
$this->logger->logger(Lang::$current_lang['login_auth_key'], Logger::NOTICE);
$this->datacenter = new DataCenter($this);
$auth_key = $authorization[$mainDcID];
if (!\is_array($auth_key)) {
$auth_key = ['auth_key' => $auth_key];
}
$dataCenterConnection = $this->datacenter->getDataCenterConnection($mainDcID);
$this->logger->logger("Setting auth key in DC $mainDcID", Logger::NOTICE);
$auth_key = new PermAuthKey($auth_key);
$auth_key->authorized(true);
$auth_key->setServerSalt(random_bytes(8));
$dataCenterConnection->setPermAuthKey($auth_key);
$dataCenterConnection->setTempAuthKey(new TempAuthKey());
$dataCenterConnection->bind($this->settings->getAuth()->getPfs());
$this->datacenter->currentDatacenter = $mainDcID;
$this->authorized_dc = $mainDcID;
$this->authorized = \danog\MadelineProto\API::LOGGED_IN;
$this->getPhoneConfig();
$res = ($this->fullGetSelf());
$callbacks = [$this, $this->referenceDatabase, $this->peerDatabase];
if (!($this->authorization['user']['bot'] ?? false)) {
$callbacks[] = $this->minDatabase;
}
/** @psalm-suppress InvalidArgument */
$this->TL->updateCallbacks($callbacks);
$this->startUpdateSystem();
$this->qrLoginDeferred?->cancel();
$this->qrLoginDeferred = null;
$this->fullGetSelf();
return $res;
}
/**
* Export authorization.
*
* @return array{0: (int|string), 1: string}
*/
public function exportAuthorization(): array
{
if ($this->authorized !== \danog\MadelineProto\API::LOGGED_IN) {
throw new Exception(Lang::$current_lang['not_loggedIn']);
}
$this->fullGetSelf();
$this->authorized_dc = $this->datacenter->currentDatacenter;
return [$this->datacenter->currentDatacenter, $this->datacenter->getDataCenterConnection($this->datacenter->currentDatacenter)->getPermAuthKey()->getAuthKey()];
}
/**
* Complete signup to Telegram.
*
* @param string $first_name First name
* @param string $last_name Last name
*/
public function completeSignup(string $first_name, string $last_name = ''): array
{
if ($this->authorized !== \danog\MadelineProto\API::WAITING_SIGNUP) {
throw new Exception(Lang::$current_lang['signup_uncalled']);
}
$this->authorized = API::NOT_LOGGED_IN;
$this->logger->logger(Lang::$current_lang['signing_up'], Logger::NOTICE);
return $this->processAuthorization($this->methodCallAsyncRead('auth.signUp', ['phone_number' => $this->authorization['phone_number'], 'phone_code_hash' => $this->authorization['phone_code_hash'], 'phone_code' => $this->authorization['phone_code'], 'first_name' => $first_name, 'last_name' => $last_name]));
}
/**
* Complete 2FA login.
*
* @param string $password Password
*/
public function complete2faLogin(string $password): array
{
if ($this->authorized !== \danog\MadelineProto\API::WAITING_PASSWORD) {
throw new Exception(Lang::$current_lang['2fa_uncalled']);
}
$this->logger->logger(Lang::$current_lang['login_user'], Logger::NOTICE);
try {
$res = $this->methodCallAsyncRead('auth.checkPassword', ['password' => $password], $this->authorized_dc);
} catch (PasswordHashInvalidError) {
$res = $this->methodCallAsyncRead('auth.checkPassword', ['password' => $password], $this->authorized_dc);
}
return $this->processAuthorization($res);
}
private function processAuthorization(array $authorization): array
{
if ($this->authorized === \danog\MadelineProto\API::LOGGED_IN) {
throw new Exception(Lang::$current_lang['already_loggedIn']);
}
$this->authorized_dc ??= $this->datacenter->currentDatacenter;
$this->authorization = $authorization;
$this->authorized = \danog\MadelineProto\API::LOGGED_IN;
$this->datacenter->getDataCenterConnection($this->authorized_dc)->authorized(true);
$this->qrLoginDeferred?->cancel();
$this->qrLoginDeferred = null;
$this->logger->logger(Lang::$current_lang['login_ok'], Logger::NOTICE);
$this->fullGetSelf();
$this->getPhoneConfig();
$this->startUpdateSystem();
$this->initDb();
$this->serialize();
return $authorization;
}
/**
* Update the 2FA password.
*
* The params array can contain password, new_password, email and hint params.
*
* @param array{password?: string, new_password?: string, email?: string, hint?: string} $params The params
*/
public function update2fa(array $params): void
{
$hasher = new PasswordCalculator($this->methodCallAsyncRead('account.getPassword', []));
$this->methodCallAsyncRead('account.updatePasswordSettings', $hasher->getPassword($params));
}
}
```
|
Angiotensin (1-7) (; Molecular weight = 899.02 g/mol; H-Asp-Arg-Val-Tyr-Ile-His-Pro-OH) is an active heptapeptide of the renin–angiotensin system (RAS).
In 1988, Santos et al demonstrated that angiotensin (1-7) was a main product of the incubation of angiotensin I with brain micropunches and Schiavone et al reported the first biological effect of this heptapeptide.
Angiotensin (1-7) is a vasodilator agent affecting cardiovascular organs, such as heart, blood vessels and kidneys, with functions frequently opposed to those attributed to the major effector component of the RAS, angiotensin II (Ang II).
Synthesis
The polypeptide Ang I can be converted into Ang (1-7) by the actions of neprilysin (NEP) and thimet oligopeptidase (TOP) enzymes. Also, Ang II can be hydrolyzed into Ang (1-7) through the actions of angiotensin-converting enzyme 2 (ACE2). Ang (1-7) binds and activates the G-protein coupled receptor Mas receptor leading to opposite effects of those of Ang II.
Possible pathways
Action of neprilysin on angiotensin I or angiotensin II.
Action of prolyl endopeptidase on angiotensin I.
Action of ACE on angiotensin 1-9.
Action of neprilysin on angiotensin 1-9.
Action of ACE2 on angiotensin II.
Effects
Ang (1-7) has been shown to have anti-oxidant and anti-inflammatory effects. It helps protect cardiomyocytes of spontaneously hypertensive rats by increasing the expression of endothelial and neuronal nitric oxide synthase enzymes, augmenting production of nitric oxide.
Pharmacological interactions
Ang (1-7) contributes to the beneficial effects of ACE inhibitors and angiotensin II receptor type 1 antagonists.
References
Peptides
Angiology
Endocrinology
Hypertension
|
Camogie in County Cork is administered by the Cork County Board of the Camogie Association.
History
Several people from County Cork, including Síle Horgan, Lil Kirby, Mary Moran, Mary O'Callaghan, Joan O'Flynn and Lil O'Grady, have served as presidents of the national Camogie Association.
The Cork county camogie team have won the All-Ireland Senior Camogie Championship on 28 occasions. These include wins in 1934, 1935, 1936, 1939, 1940, 1941, 1970, 1971, 1972, 1973, 1978, 1980, 1982, 1983, 1992, 1993, 1995, 1997, 1998, 2002, 2005, 2006, 2008, 2009, 2014, 2015, 2017 and 2018.
Cork have also won the National Camogie League on 16 occasions. These include the 1984, 1986, 1991, 1992, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2007, 2008, 2012 and 2013 league competitions.
Notable Cork players have included team of the century members Marie Costine, Sandie Fitzgibbon, Linda Mellerick and Pat Moloney, player of the year recipients Briege Corkery, Claire Cronin, Marion McCarthy, Teresa Murphy, Aoife Murray, Mary O'Leary, Fiona O'Driscoll, Gemma O'Connor, Mary O'Connor and Deirdre Sutton, All Star award winners Rena Buckley, Síle Burns, Orla Cotter, Emer Dillon, Lynn and Stephanie Dunlea, Cathriona Foley, Anna Geary, Rachel Moloney and Jennifer O'Leary, and Elaine Burke, Ann Comerford, Kathleen Cotter, Kathleen Delea, Denise Cronin, Hannah Dineen, Eithne Duggan, Renee Fitzgerald, Vivienne Harris, Cathy Landers, Pat Lenihan, Josie McGrath, Therése O'Callaghan, Nancy O'Driscoll, Irene O'Keeffe and Betty Sugrue.
Under Camogie's National Development Plan 2010-2015, "Our Game, Our Passion", five new camogie clubs were to be established in the county by 2015.
Clubs
The premier club competition in the county is the Cork Senior Camogie Championship.
Glen Rovers (4) Killeagh (1980) and Milford GAA (2) 2013 and 2014 have won the All Ireland senior club championship.
County teams
The Cork senior camogie team represents Cork in the National Camogie League and the All-Ireland Senior Camogie Championship. There are also intermediate, junior, under-21 and minor teams.
References
External links
Cork Camogie Board
Sport in County Cork by sport
|
```c
__complex__ long double sub (__complex__ long double cld) { return cld; }
```
|
The 1963 All-Ireland Senior Hurling Championship Final was the 76th All-Ireland Final and the culmination of the 1963 All-Ireland Senior Hurling Championship, an inter-county hurling tournament for the top teams in Ireland. The match was held at Croke Park, Dublin, on 1 September 1963, between Kilkenny and Waterford. Waterford, the Munster champions, lost to their Leinster opponents on a score line of 4-17 to 6-8.
Match details
All-Ireland Senior Hurling Championship Final
All-Ireland Senior Hurling Championship Final, 1963
All-Ireland Senior Hurling Championship Final
All-Ireland Senior Hurling Championship finals
Kilkenny GAA matches
Waterford GAA matches
|
Jabulani Mnguni (born 9 December 1972) is a South African former footballer who played at both professional and international levels as a midfielder. Mnguni played club football for Vaal Professionals, Moroka Swallows, Orlando Pirates, Tembisa Classic and Uthukela, before moving to Vietnam to play with Sông Lam Nghệ An; he also earned 2 caps for the South African national side in 1997.
External links
1972 births
Living people
South African men's soccer players
South African expatriate men's soccer players
South Africa men's international soccer players
1997 FIFA Confederations Cup players
Orlando Pirates F.C. players
Moroka Swallows F.C. players
Song Lam Nghe An FC players
Expatriate men's footballers in Vietnam
Men's association football midfielders
|
Events in the year 1983 in Turkey.
Parliament
17th Parliament of Turkey (from 6 November)
Incumbents
President – Kenan Evren
Prime Minister –
Bülent Ulusu (up to 13 December)
Turgut Özal (from 13 December)
Leader of the opposition – Necdet Calp (from 13 December)
Ruling party and the main opposition
Ruling party
(Technocrat government) (up to 13 December)
Motherland Party (ANAP) (from 13 December)
Main opposition – People’s Party (HP) (from 13 December)
Cabinet
44th government of Turkey (up to 13 December)
45th government of Turkey (from 13 December)
Events
January
16 January – Turkish Airlines Flight 158, catches fire, resulting in 45 deaths.
28 January – Parliamentary Assembly of Council of Europe considers expulsion of Turkey because of alleged human rights violations.
March
2 March – Free trade zones created in Aliağa, Antalya and Yumurtalık.
7 March – Mining accident in Zonguldak results in 79 deaths.
9 March – Turkish diplomat Galip Balkar was assassinated by Armenian terrorists.
April
24 April – Ban on political activities lifted.
May
4 May – Doğu Perinçek is sentenced to 12 years in prison.
16 May – Nationalist Democracy Party founded.
19 May – Populist Party formed.
20 May – Turgut Özal forms Motherland Party.
20 May – Great Turkey Party founded.
26 May – Social Democracy Party (SODEP) was founded
29 May – Professor Erdal İnönü founds Social Democracy Party.
31 May – Military administration closes down Grand the Turkey Party.
June
1 June – BTP closed by the military rulers. Süleyman Demirel, former prime minister as well as other politicians of the former Justice Party and Republican People's Party were arrested
23 June – True Path Party founded.
July
5 July – 1983 Biga earthquake
7 July – National Security Council vetoes 30 founders of True Path Party.
14 July – Turkish diplomat Dursun Aksoy assassinated by Armenian terrorists.
15 July – Armenian terrorists bomb the Turkish Airlines check-in counter in Paris, resulting in 7 deaths.
August
24 August – Motherland Party receives permission to participate in 6 November elections.
24 August – TPP and SDP are disqualified from taking part in the elections.
October
30 October 1983 Erzurum earthquake with the moment magnitude of 6.6 results in 1,342 deaths.
November
2 November – First successful kidney transplantation in Istanbul.
6 November – MP wins elections by majority.
15 November – Turkey recognizes Northern Cyprus.
December
13 December – First civilian government after the coup of 1980.
18 December – Erdal İnönü replaces Cezmi Kartay as the chairman of SODEP.
Births
16 June – Naz Elmas, actress
29 August – Saadet Aksoy, actress
10 October – Tolga Zengin, footballer
29 October – Nurcan Taylan, weight lifter
9 December – Neslihan Demir volleyball player
Deaths
8 January – Hüseyin Alp (born 1935), basketball player
19 January – Muhittin Taylan, (born 1910) chief of constitutional court and one time candidate of presidency
9 March – Galip Balkar (born 1836), ambassador (assassinated)
24 May – Necip Fazıl Kısakürek (born 1904), poet
28 May – Çiğdem Talu (born 1939), music lyricist
2 September – Feri Cansel (born 1944), actress (killed)
10 October – Salise Abanozoğlu (born 1904), teacher and politician
9 November – Rüştü Erdelhun (born 1894), army general
Gallery
See also
Turkey in the Eurovision Song Contest 1983
1982–83 1.Lig
References
Years of the 20th century in Turkey
Turkey
Turkey
Turkey
|
Huila () is one of the departments of Colombia. It is located in the southwest of the country, and its capital is Neiva.
Demography and Ethnography
Huila is a department that has a population of 1,122,622 inhabitants, of which 679,667 (60.54%) people live in municipal capitals and 442,955 (39.46%) in the rest of the Huilense territory. This corresponds to 2.5% of the total Colombian population. The majority of the population is settled in the Magdalena valley, with epicenters in Neiva and Garzón due to the possibilities offered by the commercial-type agricultural economy, oil exploitation, the best provision of services and the road axes connected to the central axis that borders the Magdalena. The rest of the populations are located on the coffee belt, standing out Pitalito and La Plata, the North Subregion presents a decrease in its rural population, mainly attributable to the alterations of agricultural and oil activities on the landscape. The average population density in the department is 59.88 inhabitants / km2, with the highest densities in Neiva (223.72), Pitalito (200.1) and Garzón (162.45), and with the lowest in the municipalities of Colombia and Villavieja (7.83 and 10.91 respectively).
Ethnography
According to DANE, the racial composition of Huila corresponds to: 98.43% is recognized as Whites and Mestizos while only 1.57% as an ethnic population (Amerindians and Afro/Mulattos) makes it one of the most Eurocentric and less diverse departments in terms of race or ethnicity in the country.
Geography
The south of the department is located in the Colombian Massif. The Cordillera Oriental is born in this place.
Colombia's third highest peak, the Nevado del Huila volcano, is located in the department of Huila.
The Magdalena River (also called Yuma River) is Colombia's largest river, begins in the department of Huila. Some of Huila's most important towns are located in the Magdalena River Valley. Betania is a dam located on the Magdalena river. A larger dam, El Quimbo, is planned for the same river.
Administrative divisions
Municipalities
Acevedo
Agrado
Aipe
Algeciras
Altamira
Baraya
Campoalegre
Colombia
Elías
Garzón
Gigante
Guadalupe
Hobo
Iquira
Isnos
La Argentina
La Plata
Nátaga
Neiva (capital city)
Oporapa
Paicol
Palermo
Palestina
Pital
Pitalito
Rivera
Saladoblanco
San Agustín
Santa María
Suaza
Tarqui
Tello
Teruel
Tesalia
Timaná
Villavieja
Yaguará
References
External links
Government of Huila official website
Huila Department
Departments of Colombia
States and territories established in 1905
1905 establishments in Colombia
|
Aydınlar () is a village in the Yayladere District, Bingöl Province, Turkey. The village is populated by Kurds of the Şadiyan tribe and had a population of 47 in 2021.
Tha hamlets of Bölükören, Çavuşlu, Dağarcık, Dursun, Hacı, Pınarcık and Yağmurdere are attached to the village.
References
Villages in Yayladere District
Kurdish settlements in Bingöl Province
|
Taraxerol is a naturally-occurring pentacyclic triterpenoid. It exists in various higher plants, including Taraxacum officinale (Asteraceae), Alnus glutinosa (Betulaceae), Litsea dealbata (Lauraceae), Skimmia spp. (Rutaceae), Dorstenia spp. (Moraceae), Maytenus spp. (Celastraceae), and Alchornea latifolia (Euphobiaceae). Taraxerol was named "alnulin" when it was first isolated in 1923 from the bark of the grey alder (Alnus incana L.) by Zellner and Röglsperger. It also had the name "skimmiol" when Takeda and Yosiki isolated it from Skimmia (Rutaceae). A large number of medicinal plants are known to have this compound in their leaves, roots or seed oil.
Chemistry
Structure
Taraxerol is an oleanan-3-ol with an alpha-methyl substituent at position 13, a missing methyl group at position 14, and a double bond between 14 and 15. The dominant biological stereoisomer in plant leaves and in sediments has the taraxer-14-en-3β-ol configuration. Taraxerol is a double-bond isomer of β-amyrin, another important naturally-occurring triterpenoid in higher plants. It is a colorless solid under room temperature with an estimated melting point of 283.50 °C and boiling point of 490.70 °C. It is practically insoluble in water and has a solubility of 9.552 × 10−5 mg/L estimated from octanol-water partition coefficient.
Synthesis
While syntheses of pentacyclic triterpenoids in general have been proven challenging, partial synthesis of 11,12-α-oxidotaraxerol, an epoxide taraxerene derivative, has been reported by Ursprung et al. from α- and β-amyrin. Exposing an ethanolic solution of α- and β-amyrin in summer sunlight for 12 weeks yields a colorless precipitate, and saponification of the precipitate gives 11,12-α-oxidotaraxerol. Alternatively, the process could be accelerated by exposing ethanolic β-amyrin solution under ultraviolet light. In this case, the precipitate can be collected in less than 3 weeks.
Transformation in sediment
During early diagenesis, taraxerol loses its hydroxyl group and gets transformed to taraxer-14-ene. Taraxer-14-ene can undergo rapid isomerization to form 18β-olean-12-ene, in which the double bond can migrate and form a mixture of olean-12-ene, olean-13(18)-ene, and olean-18-ene. The oleanene isomers form rapidly from taraxerol rearrangements during diagenesis even under cool geothermal conditions. Further reduction during catagenesis of the three compounds gives predominantly 18α-oleanane and its counterpart 18β-oleanane as a minor product. The direct reduction product of taraxerol, taraxerane, is hardly present in natural sediments. Oleanane seems to be the dominant product as a result of the transformation process.
Biomarker
Taraxerol is usually present in minor amounts in plant extracts, and it can be used as a lipid biomarker for land plants. However, in many species of mangrove tree leaves, e.g. Rhizophora mangle (red mangrove) and Rhizophora racemosa, taraxerol is present in very high levels. Therefore, it is used in various studies as a proxy for mangrove input. Within different mangrove species there also exist compositional differences. For example, Rhizophora mangle contains high levels of taraxerol, β-amyrin, germanicol, and lupeol, Avicennia germinans (black mangrove) consists mainly of lupeol, betulin, and β-sitosterol, and Laguncularia racemosa (white mangrove) is marked by large quantities of lupeol and β-sitosterol.
Mangrove biomarker case study
Rhizophora racemosa represents the dominant mangrove species in equatorial and sub-equatorial west Africa. Versteegh et al. analyzed the leaf lipids of R. racemosa as well as surface sediments and sediment cores from Angola Basin and Cape Basin (southeast Atlantic) to assess the suitability of using taraxerol as a proxy for mangrove input in marine sediments. The hypothesis is that there should be a "base-level" for taraxerol in general sediments and elevated levels at places where Rhizophora has significant contribution.
Analysis suggests that taraxerol dominates the inside and the total composition of R. racemosa leaves (7.7 mg/g leaf). As a result, increase in taraxerol level relative to other higher plant biomarkers in sediments should indicate when and where Rhizophora contributes substantially. In the most part of SE Atlantic, taraxerol/normal C29 alkanes (n-C29) ratio in surface sediments is low. High ratios are observed in a zone along the continental slope, in which maxima always occur near present-day on shore mangrove trees. This pattern strongly corroborates the link between high levels of taraxerol and input from mangrove ecosystems. This link is also supported by a similar, though less prominent, trend in Rhizophora pollens.
Examination of the sediment cores reveals further connections between mangrove population, taraxerol levels, and climate conditions. One important climate condition is glaciation/deglaciation. During deglaciations when rates of sea level rise exceeded 12 cm/100 yr, mangrove populations could not persist due to lack of sediment supply. After this rate slowed down, mangrove populations can expand again in the freshly developed estuaries and deltas. Periods of mangrove development and rise in taraxerol levels in the basin, however, sometimes do not coincide with each other. In times of fast sea-level rise, coastal mangrove deposits can be transported to the basin, resulting in an increase in taraxerol input, while mangrove development would actually happen afterward. In some other cases where fluctuation in taraxerol levels was not related to sea-level changes, it can also be attributed to local climate variations in temperature and humidity.
Analysis methods
Analysis methods for the determination and quantification of taraxerol include gas chromatography/mass spectroscopy (GC/MS) and high-performance thin layer chromatography (HPTLC).
GC/MS
There are several treatment procedures before running leaf or sediment samples containing taraxerol through GC/MS analysis. Dried and grinded samples are saponified with strong base (e.g. potassium hydroxide), extracted in polar solvent (e.g. dichloromethane), separated into fractions by column chromatography, and finally derivatized. Common choices for derivatization include N-methyl-N-(trimethylsilyl)trifluoroacetamide (MSTFA) and mixture of pyridine and bis(trimethylsilyl)trifluoroacetamide (BSTFA), both of which aim to convert the free hydroxyl groups to trimethylsilyl ethers, making the molecules more non-polar and thus more suitable for GC/MS analysis. In GC/MS, taraxerol has a signature peak with a mass-to-charge ratio (m/z) of 204.
HPTLC
Alternatively, determination and quantification of taraxerol can also be achieved with good reliability and reproducibility using HPTLC. In this case, linear ascending development is performed (e.g. using hexane and ethyl acetate (8:2 v/v) as mobile phase) in a twin trough glass chamber on TLC aluminum plates. Quantification can be achieved by spectrodensitometric scanning at a wavelength of 420 nm.
Pharmacological research
Taraxerol, like many triterpenoid compounds, has been shown to possess anti-inflammatory effects in vitro. It can disrupt the activation of the enzymes MAP3K7 (TAK1), protein kinase B (PKB or Akt), and NF-κB. By doing so, it may inhibit the expression of proinflammatory mediators in microphages.
Taraxerol also exhibits anti-carcinogenic activity. In vivo two-stage carcinogenesis tests of mouse skin tumor showed that taraxerol can inhibit the induction of Epstein-Barr virus early antigen (EBV-EA) by the tumor initiator 7,12-dimethylbenz(a)anthracene (DMBA) and the tumor promoter 12-O-tetradecanoylphorbol-13-acetate (TPA).
In addition, taraxerol can inhibit acetylcholinesterase (AChE) activity in rat's hippocampus.
See also
Taraxerol synthase
References
Triterpenes
Secondary alcohols
|
```objective-c
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
//
// path_to_url
//
// Unless required by applicable law or agreed to in writing,
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
// specific language governing permissions and limitations
#pragma once
#include <atomic>
#include <cstdint>
#include <memory>
#include <string>
#include "kudu/gutil/atomicops.h"
#include "kudu/gutil/macros.h"
#include "kudu/kserver/kserver.h"
#include "kudu/tserver/tablet_server_options.h"
#include "kudu/util/status.h"
namespace kudu {
class MaintenanceManager;
namespace transactions {
class TxnSystemClientInitializer;
} // namespace transactions
namespace tserver {
class Heartbeater;
class ScannerManager;
class TSTabletManager;
class TabletServerPathHandlers;
class TabletServer : public kserver::KuduServer {
public:
// TODO(unknown): move this out of this header, since clients want to use
// this constant as well.
static const uint16_t kDefaultPort = 7050;
static const uint16_t kDefaultWebPort = 8050;
explicit TabletServer(const TabletServerOptions& opts);
~TabletServer();
// Initializes the tablet server, including the bootstrapping of all
// existing tablets.
// Some initialization tasks are asynchronous, such as the bootstrapping
// of tablets. Caller can block, waiting for the initialization to fully
// complete by calling WaitInited().
Status Init() override;
// Waits for the tablet server to complete the initialization.
Status WaitInited();
Status Start() override;
void Shutdown() override {
ShutdownImpl();
}
std::string ToString() const;
TSTabletManager* tablet_manager() { return tablet_manager_.get(); }
ScannerManager* scanner_manager() { return scanner_manager_.get(); }
Heartbeater* heartbeater() { return heartbeater_.get(); }
void set_fail_heartbeats_for_tests(bool fail_heartbeats_for_tests) {
base::subtle::NoBarrier_Store(&fail_heartbeats_for_tests_, 1);
}
bool fail_heartbeats_for_tests() const {
return base::subtle::NoBarrier_Load(&fail_heartbeats_for_tests_);
}
MaintenanceManager* maintenance_manager() {
return maintenance_manager_.get();
}
transactions::TxnSystemClientInitializer* txn_client_initializer() {
return client_initializer_.get();
}
bool quiescing() const {
return quiescing_;
}
std::atomic<bool>* mutable_quiescing() {
return &quiescing_;
}
private:
friend class TabletServerTestBase;
enum TabletServerState {
kStopped,
kInitialized,
kRunning
};
// A method for internal use in the destructor. Some static code analyzers
// issue a warning if calling a virtual function from destructor even if it's
// safe in a particular case.
void ShutdownImpl();
TabletServerState state_;
std::atomic<bool> quiescing_;
// If true, all heartbeats will be seen as failed.
Atomic32 fail_heartbeats_for_tests_;
// The options passed at construction time.
const TabletServerOptions opts_;
// Manager for tablets which are available on this server.
std::unique_ptr<TSTabletManager> tablet_manager_;
// Manager for open scanners from clients.
// This is always non-NULL. It is scoped only to minimize header
// dependencies.
std::unique_ptr<ScannerManager> scanner_manager_;
// Thread that initializes a TxnSystemClient.
std::unique_ptr<transactions::TxnSystemClientInitializer> client_initializer_;
// Thread responsible for heartbeating to the master.
std::unique_ptr<Heartbeater> heartbeater_;
// Webserver path handlers.
std::unique_ptr<TabletServerPathHandlers> path_handlers_;
// The maintenance manager for this tablet server
std::shared_ptr<MaintenanceManager> maintenance_manager_;
DISALLOW_COPY_AND_ASSIGN(TabletServer);
};
} // namespace tserver
} // namespace kudu
```
|
```mediawiki
= Dell XPS 17 9710 =
There are two major hardware variants. Intel-only and NVidia
This has only been tested with the Intel-only variant
== Firmware Configuration ==
Enter the bios by repeatedly pressing F2 when the laptop turns on
=== Before installation ===
These settings are needed both for booting the final install, and installer itself. Therefore, they must be done first.
==== Method One ====
* Click ''Restore Settings'' button a select ''BIOS Defaults'', not to be confused with ''Factory Settings''
==== Method Two ====
* ''Disable Secure Boot (but keep UEFI Boot).'' Thankfully doing so is as easy as changing any other simple setting.
* ''Disable Intel hardware RAID and use AHCI instead.'' Intel doesn't seem to provide a working linux driver for this
== Optional ==
=== Firmware upgrades ===
Note that this device is supported by [path_to_url fwupd].
To perform firmware upgrades just activate the service
<code>
services.fwupd.enable = true;
</code>
Then use <code>fwupdmgr</code> to perform updates.
=== Enable fingerprint reader ===
Activate the service
<code>
services.fprintd.enable = true;
</code>
```
|
Sobieski, Wisconsin is an unincorporated census-designated place in Oconto County in northeastern Wisconsin, United States. It is located within the Town of Little Suamico. As of the 2010 census, its population was 259. It is part of the Green Bay Metropolitan Statistical Area. The Little Suamico Town Hall is located in Sobieski, just east of the Escanaba and Lake Superior Railroad.
Sobieski is located along County Trunk Highway S and Cross Road. Sandalwood Road and Krause Road also enter the community. The Little Suamico River flows just south of the St. Maximilian parish cemetery. County S intersects with U.S. Route 141 about a half-mile east of Sobieski.
Demographics
References
Census-designated places in Wisconsin
Census-designated places in Oconto County, Wisconsin
Green Bay metropolitan area
|
Symphony No. 11 in E-flat major "The Four Nations" for string orchestra, Stiles 1.3.3.1 SyFN, was arranged by Australian composer Alfred Hill from his String Quartet No. 5 "The Allies" at some point in 1950s, but the precise date remains unknown, and there is no information about the first performance. The music of the symphony follows that of the original String Quartet, except for the Finale being 4 bars shorter than in the quartet, due to a minor truncation of the melody of the main subject at each repeat of it. The most obvious difference is the addition of the double bass part. Hill also altered the title of the composition.
Instrumentation
The symphony is scored for a standard string orchestra: violins I and II, violas, cellos and double basses.
Structure
The symphony is in four parts, each presenting a nation.
I. France: Artistic. Allegro risoluto — Andantino (E-flat major)
II. America: Syncopated. Intermezzo. Allegretto moderato (G minor)
III. Italy: Romantic. Andantino (G major)
IV. Great Britain: Nautical. Finale. Allegro (E-flat major)
Editions
Alfred Hill. Symphony in E for string orchestra : The Four Nations. Narara: Stiles Music Publications, 2008 (pub. number S103-2008; ISMN 979-0-720073-07-1)
References
Symphonies by Alfred Hill
Compositions in E-flat major
|
```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.
#if defined(PADDLE_WITH_PSCORE)
#include "paddle/fluid/framework/device_worker.h"
#include "paddle/fluid/framework/fleet/metrics.h"
#include "paddle/fluid/operators/isfinite_op.h"
#include "paddle/fluid/platform/cpu_helper.h"
namespace phi {
class DenseTensor;
} // namespace phi
namespace paddle {
namespace framework {
class Variable;
} // namespace framework
} // namespace paddle
#if defined _WIN32 || defined __APPLE__
#else
#define _LINUX
#endif
namespace paddle {
namespace framework {
void DownpourLiteWorker::Initialize(const TrainerDesc& desc) {
param_ = desc.downpour_param();
for (int i = 0; i < param_.sparse_table_size(); ++i) {
uint64_t table_id =
static_cast<uint64_t>(param_.sparse_table(i).table_id());
TableParameter table = param_.sparse_table(i);
sparse_key_names_[table_id].resize(table.sparse_key_name_size());
for (int j = 0; j < table.sparse_key_name_size(); ++j) {
sparse_key_names_[table_id][j] = table.sparse_key_name(j);
}
sparse_value_names_[table_id].resize(table.sparse_value_name_size());
for (int j = 0; j < table.sparse_value_name_size(); ++j) {
sparse_value_names_[table_id][j] = table.sparse_value_name(j);
}
sparse_grad_names_[table_id].resize(table.sparse_grad_name_size());
for (int j = 0; j < table.sparse_grad_name_size(); ++j) {
sparse_grad_names_[table_id][j] = table.sparse_grad_name(j);
}
label_var_name_[table_id] = table.label_var_name();
sparse_push_keys_[table_id] = std::vector<uint64_t>();
}
for (int i = 0; i < param_.dense_table_size(); ++i) {
uint64_t table_id = static_cast<uint64_t>(param_.dense_table(i).table_id());
auto table = param_.dense_table(i);
dense_value_names_[table_id].resize(table.dense_value_name_size());
for (int j = 0; j < table.dense_value_name_size(); ++j) {
dense_value_names_[table_id][j] = table.dense_value_name(j);
}
dense_grad_names_[table_id].resize(table.dense_grad_name_size());
for (int j = 0; j < table.dense_grad_name_size(); ++j) {
dense_grad_names_[table_id][j] = table.dense_grad_name(j);
}
}
flag_partial_push_ = false;
for (auto& m : param_.program_config(0).partial_pushdense_condtable_map()) {
cond2table_map_[m.key()] = m.value();
condvalue_set_.insert(m.value());
flag_partial_push_ = true;
}
skip_ops_.resize(param_.skip_ops_size());
for (int i = 0; i < param_.skip_ops_size(); ++i) {
skip_ops_[i] = param_.skip_ops(i);
}
for (int i = 0; i < param_.stat_var_names_size(); ++i) {
stat_var_name_map_[param_.stat_var_names(i)] = 1;
}
need_to_push_sparse_ = param_.push_sparse();
need_to_push_dense_ = param_.push_dense();
fleet_ptr_ = paddle::distributed::FleetWrapper::GetInstance();
fetch_config_ = desc.fetch_config();
use_cvm_ = desc.use_cvm();
// for sparse value accessor, embedding only
no_cvm_ = desc.no_cvm();
scale_sparse_gradient_with_batch_size_ =
desc.scale_sparse_gradient_with_batch_size();
scale_datanorm_ = desc.scale_datanorm();
dump_slot_ = desc.dump_slot();
adjust_ins_weight_config_ = desc.adjust_ins_weight_config();
for (int i = 0; i < desc.check_nan_var_names_size(); ++i) {
check_nan_var_names_.push_back(desc.check_nan_var_names(i));
}
copy_table_config_ = desc.copy_table_config();
for (int i = 0; i < copy_table_config_.src_sparse_tables_size(); ++i) {
uint64_t src_table = copy_table_config_.src_sparse_tables(i);
uint64_t dest_table = copy_table_config_.dest_sparse_tables(i);
VLOG(3) << "copy_sparse_tables_ push back " << src_table << "->"
<< dest_table;
copy_sparse_tables_.push_back(std::make_pair(src_table, dest_table));
}
for (int i = 0; i < copy_table_config_.src_dense_tables_size(); ++i) {
uint64_t src_table = copy_table_config_.src_dense_tables(i);
uint64_t dest_table = copy_table_config_.dest_dense_tables(i);
VLOG(3) << "copy_dense_tables_ push back " << src_table << "->"
<< dest_table;
copy_dense_tables_.push_back(std::make_pair(src_table, dest_table));
}
for (auto& m : copy_table_config_.table_dependency_map()) {
if (sparse_key_names_.find(m.key()) != sparse_key_names_.end()) {
// currently only support one dependency
for (auto& value : m.values()) {
table_dependency_[m.key()] = value;
}
}
}
}
void DownpourLiteWorker::CopySparseTable() {
for (auto& copy_sparse_table : copy_sparse_tables_) {
int64_t src_table = copy_sparse_table.first;
int64_t dest_table = copy_sparse_table.second;
int32_t feanum = 0;
if (src_table == dest_table) {
continue;
} else if (!copy_table_config_.sparse_copy_by_feasign()) {
if (feasign_set_.find(src_table) == feasign_set_.end()) {
continue;
} else if (feasign_set_[src_table].empty()) {
continue;
}
feanum = fleet_ptr_->CopyTable(src_table, dest_table);
} else {
std::vector<uint64_t> fea_vec(feasign_set_[src_table].begin(),
feasign_set_[src_table].end());
feanum = fleet_ptr_->CopyTableByFeasign(src_table, dest_table, fea_vec);
fea_vec.clear();
std::vector<uint64_t>().swap(fea_vec);
}
VLOG(3) << "copy feasign from table " << src_table << " to table "
<< dest_table << ", feasign num=" << feanum;
feasign_set_[src_table].clear();
std::unordered_set<uint64_t>().swap(feasign_set_[src_table]);
}
feasign_set_.clear();
}
void DownpourLiteWorker::CopyDenseTable() {
if (thread_id_ != 0) {
return;
}
thread_local std::vector<std::future<int32_t>> pull_dense_status;
for (auto& copy_dense_table : copy_dense_tables_) {
uint64_t src_table = copy_dense_table.first;
uint64_t dest_table = copy_dense_table.second;
if (src_table == dest_table) {
continue;
}
int32_t dim = fleet_ptr_->CopyTable(src_table, dest_table);
VLOG(3) << "copy param from table " << src_table << " to table "
<< dest_table << ", dim=" << dim;
if (copy_table_config_.dense_pull_after_copy()) {
VLOG(3) << "dense pull after copy, table=" << dest_table;
pull_dense_status.resize(0);
fleet_ptr_->PullDenseVarsAsync(*root_scope_,
dest_table,
dense_value_names_[dest_table],
&pull_dense_status,
true);
for (auto& t : pull_dense_status) {
t.wait();
auto status = t.get();
if (status != 0) {
LOG(WARNING) << "pull dense after copy table failed,"
<< " table=" << dest_table;
}
}
}
}
}
void DownpourLiteWorker::CopyDenseVars() {
if (thread_id_ != 0) {
return;
}
for (int i = 0; i < copy_table_config_.src_var_list_size(); ++i) {
auto& src_var_name = copy_table_config_.src_var_list(i);
auto& dest_var_name = copy_table_config_.dest_var_list(i);
if (src_var_name == dest_var_name) {
continue;
}
VLOG(3) << "copy dense var from " << src_var_name << " to "
<< dest_var_name;
Variable* src_var = thread_scope_->FindVar(src_var_name);
CHECK(src_var != nullptr) << src_var_name << " not found"; // NOLINT
phi::DenseTensor* src_tensor = src_var->GetMutable<phi::DenseTensor>();
CHECK(src_tensor != nullptr)
<< src_var_name << " tensor is null"; // NOLINT
float* src_data = src_tensor->data<float>();
Variable* dest_var = thread_scope_->FindVar(dest_var_name);
CHECK(dest_var != nullptr) << dest_var_name << " not found"; // NOLINT
phi::DenseTensor* dest_tensor = dest_var->GetMutable<phi::DenseTensor>();
CHECK(dest_tensor != nullptr)
<< dest_var_name << " tensor is null"; // NOLINT
float* dest_data = dest_tensor->data<float>();
CHECK(src_tensor->numel() == dest_tensor->numel())
<< "tensor numel not equal," << src_tensor->numel() << " vs "
<< dest_tensor->numel();
for (int i = 0; i < src_tensor->numel(); i++) {
dest_data[i] = src_data[i];
}
}
}
void DownpourLiteWorker::TrainFilesWithProfiler() {
VLOG(3) << "Begin to train files with profiler";
platform::SetNumThreads(1);
device_reader_->Start();
std::vector<double> op_total_time;
std::vector<std::string> op_name;
for (auto& op : ops_) {
bool need_skip = false;
for (auto& skip_op : skip_ops_) {
if (op->Type().find(skip_op) != std::string::npos) {
need_skip = true;
break;
}
}
if (!need_skip) {
op_name.push_back(op->Type());
}
}
VLOG(3) << "op name size: " << op_name.size();
op_total_time.resize(op_name.size());
for (double& op_time : op_total_time) {
op_time = 0.0;
}
platform::Timer timeline;
double total_time = 0.0;
double read_time = 0.0;
double pull_sparse_time = 0.0;
double adjust_ins_weight_time = 0.0;
double collect_label_time = 0.0;
double fill_sparse_time = 0.0;
double push_sparse_time = 0.0;
double push_dense_time = 0.0;
double copy_table_time = 0.0;
int cur_batch;
int batch_cnt = 0;
uint64_t total_inst = 0;
timeline.Start();
while ((cur_batch = device_reader_->Next()) > 0) {
timeline.Pause();
read_time += timeline.ElapsedSec();
total_time += timeline.ElapsedSec();
timeline.Start();
if (copy_table_config_.need_copy()) {
VLOG(3) << "copy_sparse_tables_.size " << copy_sparse_tables_.size();
if (batch_cnt % copy_table_config_.batch_num() == 0) {
CopySparseTable();
CopyDenseTable();
CopyDenseVars();
}
}
timeline.Pause();
copy_table_time += timeline.ElapsedSec();
total_time += timeline.ElapsedSec();
int run_op_idx = 0;
for (auto& op : ops_) {
bool need_skip = false;
for (auto& skip_op : skip_ops_) {
if (op->Type().find(skip_op) != std::string::npos) {
need_skip = true;
break;
}
}
if (!need_skip) {
timeline.Start();
VLOG(3) << "Going to run op " << op_name[run_op_idx];
op->Run(*thread_scope_, place_);
VLOG(3) << "Op " << op_name[run_op_idx] << " Finished";
timeline.Pause();
op_total_time[run_op_idx++] += timeline.ElapsedSec();
total_time += timeline.ElapsedSec();
}
}
// check inf and nan
for (std::string& var_name : check_nan_var_names_) {
Variable* var = thread_scope_->FindVar(var_name);
if (var == nullptr) {
continue;
}
phi::DenseTensor* tensor = var->GetMutable<phi::DenseTensor>();
if (tensor == nullptr) {
continue;
}
PADDLE_ENFORCE_EQ(framework::TensorContainsInf(*tensor),
false,
common::errors::InvalidArgument(
"phi::DenseTensor %s contains Inf.", var_name));
PADDLE_ENFORCE_EQ(framework::TensorContainsNAN(*tensor),
false,
common::errors::InvalidArgument(
"phi::DenseTensor %s contains NAN.", var_name));
}
#if defined(PADDLE_WITH_PSLIB) || defined(PADDLE_WITH_PSCORE)
if (copy_table_config_.need_copy()) {
if (copy_table_config_.sparse_copy_by_feasign()) {
for (auto& copy_sparse_table : copy_sparse_tables_) {
uint64_t tid = copy_sparse_table.first;
feasign_set_[tid].insert(sparse_push_keys_[tid].begin(),
sparse_push_keys_[tid].end());
}
}
}
#endif
if (need_to_push_dense_) {
for (int i = 0; i < param_.program_config(0).push_dense_table_id_size();
++i) {
uint64_t tid = static_cast<uint64_t>(
param_.program_config(0).push_dense_table_id(i));
pull_dense_worker_->IncreaseThreadVersion(thread_id_, tid);
}
}
PrintFetchVars();
thread_scope_->DropKids();
total_inst += cur_batch;
++batch_cnt;
if (thread_id_ == 0) {
// should be configured here
if (batch_cnt > 0 && batch_cnt % 100 == 0) {
double op_sum_time = 0;
std::unordered_map<std::string, double> op_to_time;
for (size_t i = 0; i < op_total_time.size(); ++i) {
fprintf(stderr,
"op_name:[%zu][%s], op_mean_time:[%fs]\n",
i,
op_name[i].c_str(),
op_total_time[i] / batch_cnt);
if (op_to_time.find(op_name[i]) == op_to_time.end()) {
op_to_time[op_name[i]] = 0.0;
}
op_to_time[op_name[i]] += op_total_time[i];
op_sum_time += op_total_time[i];
}
for (auto& i : op_to_time) {
fprintf(stderr,
"op [%s] run total time: [%f]ms\n",
i.first.c_str(),
i.second / batch_cnt);
}
fprintf(stderr, "op run total time: %fs\n", op_sum_time / batch_cnt);
fprintf(stderr, "train total time: %fs\n", total_time / batch_cnt);
fprintf(
stderr, "pull sparse time: %fs\n", pull_sparse_time / batch_cnt);
fprintf(
stderr, "fill sparse time: %fs\n", fill_sparse_time / batch_cnt);
fprintf(
stderr, "push sparse time: %fs\n", push_sparse_time / batch_cnt);
fprintf(stderr, "push dense time: %fs\n", push_dense_time / batch_cnt);
fprintf(stderr,
"collect label time: %fs\n",
collect_label_time / batch_cnt);
fprintf(stderr,
"adjust ins weight time: %fs\n",
adjust_ins_weight_time / batch_cnt);
fprintf(stderr, "copy table time: %fs\n", copy_table_time / batch_cnt);
fprintf(stderr, "mean read time: %fs\n", read_time / batch_cnt);
fprintf(stderr, "IO percent: %f\n", read_time / total_time * 100);
fprintf(stderr, "op run percent: %f\n", op_sum_time / total_time * 100);
fprintf(stderr,
"pull sparse time percent: %f\n",
pull_sparse_time / total_time * 100);
fprintf(stderr,
"adjust ins weight time percent: %f\n",
adjust_ins_weight_time / total_time * 100);
fprintf(stderr,
"copy table time percent: %f\n",
copy_table_time / total_time * 100);
fprintf(stderr,
"collect label time percent: %f\n",
collect_label_time / total_time * 100);
fprintf(stderr,
"fill sparse time percent: %f\n",
fill_sparse_time / total_time * 100);
fprintf(stderr,
"push sparse time percent: %f\n",
push_sparse_time / total_time * 100);
fprintf(stderr,
"push dense time percent: %f\n",
push_dense_time / total_time * 100);
fprintf(
stderr, "%6.2f instances/s\n", total_inst / total_time); // NOLINT
}
}
timeline.Start();
}
if (copy_table_config_.need_copy()) {
CopySparseTable();
CopyDenseTable();
CopyDenseVars();
}
}
#if defined(PADDLE_WITH_PSLIB) || defined(PADDLE_WITH_PSCORE)
/**
* @brief add auc monitor
*/
inline void AddAucMonitor(const Scope* scope, const phi::Place& place) {
auto metric_ptr = Metric::GetInstance();
auto& metric_list = metric_ptr->GetMetricList();
for (auto& metric_item : metric_list) {
auto* metric_msg = metric_item.second;
if (metric_ptr->Phase() != metric_msg->MetricPhase()) {
continue;
}
metric_msg->add_data(scope, place);
}
}
#endif
void DownpourLiteWorker::TrainFiles() {
VLOG(3) << "Begin to train files";
platform::SetNumThreads(1);
device_reader_->Start();
int batch_cnt = 0;
int cur_batch;
while ((cur_batch = device_reader_->Next()) > 0) {
if (copy_table_config_.need_copy()) {
VLOG(3) << "Begin to copy table";
if (batch_cnt % copy_table_config_.batch_num() == 0) {
CopySparseTable();
CopyDenseTable();
CopyDenseVars();
}
}
// do computation here
for (auto& op : ops_) {
bool need_skip = false;
for (auto& skip_op : skip_ops_) {
if (op->Type().find(skip_op) != std::string::npos) {
need_skip = true;
break;
}
}
if (!need_skip) {
#if defined(PADDLE_WITH_PSLIB) || defined(PADDLE_WITH_PSCORE)
try {
op->Run(*thread_scope_, place_);
} catch (std::exception& e) {
fprintf(stderr, "error message: %s\n", e.what());
auto& ins_id_vec = device_reader_->GetInsIdVec();
size_t batch_size = device_reader_->GetCurBatchSize();
std::string s = "";
for (auto& ins_id : ins_id_vec) {
if (!s.empty()) s += ",";
s += ins_id;
}
fprintf(stderr,
"batch_size: %zu, ins_ids_vec: %s\n",
batch_size,
s.c_str());
s = "";
for (auto& param : all_param_) {
Variable* var = thread_scope_->FindVar(param);
if (var == nullptr) {
continue;
}
phi::DenseTensor* tensor = nullptr;
int64_t len = 0;
if (var->IsType<phi::DenseTensor>()) {
tensor = var->GetMutable<phi::DenseTensor>();
len = tensor->numel();
} else if (var->IsType<phi::SelectedRows>()) {
auto selected_rows = var->GetMutable<phi::SelectedRows>();
tensor = selected_rows->mutable_value();
len = tensor->numel();
}
if (!tensor->IsInitialized()) {
continue;
}
s += param + ":" + std::to_string(len) + ":";
s += PrintLodTensor(tensor, 0, len);
fprintf(stderr, "%s\n", s.c_str());
fflush(stderr);
s = "";
}
throw e;
}
#else
op->Run(*thread_scope_, place_);
#endif
}
}
#if defined(PADDLE_WITH_PSLIB) || defined(PADDLE_WITH_PSCORE)
// add data for MetricMsg
if (Metric::GetInstance() != nullptr) {
AddAucMonitor(thread_scope_, place_);
}
#endif
// check inf and nan
for (std::string& var_name : check_nan_var_names_) {
Variable* var = thread_scope_->FindVar(var_name);
if (var == nullptr) {
continue;
}
phi::DenseTensor* tensor = var->GetMutable<phi::DenseTensor>();
if (tensor == nullptr) {
continue;
}
PADDLE_ENFORCE_EQ(framework::TensorContainsInf(*tensor),
false,
common::errors::InvalidArgument(
"phi::DenseTensor %s contains Inf.", var_name));
PADDLE_ENFORCE_EQ(framework::TensorContainsNAN(*tensor),
false,
common::errors::InvalidArgument(
"phi::DenseTensor %s contains NAN.", var_name));
}
#if defined(PADDLE_WITH_PSLIB) || defined(PADDLE_WITH_PSCORE)
if (copy_table_config_.need_copy()) {
if (copy_table_config_.sparse_copy_by_feasign()) {
for (auto& copy_sparse_table : copy_sparse_tables_) {
uint64_t tid = copy_sparse_table.first;
feasign_set_[tid].insert(sparse_push_keys_[tid].begin(),
sparse_push_keys_[tid].end());
}
}
}
#endif
// TODO(zhaocaibei123): flag_partial_push_ => op
if (need_to_push_dense_) {
for (int i = 0; i < param_.program_config(0).push_dense_table_id_size();
++i) {
uint64_t tid = static_cast<uint64_t>(
param_.program_config(0).push_dense_table_id(i));
pull_dense_worker_->IncreaseThreadVersion(thread_id_, tid);
}
}
if (need_dump_field_) {
DumpField(*thread_scope_, dump_mode_, dump_interval_);
}
if (need_dump_param_ && thread_id_ == 0) {
DumpParam(*thread_scope_, batch_cnt);
}
PrintFetchVars();
thread_scope_->DropKids();
++batch_cnt;
}
if (need_dump_field_ || need_dump_param_) {
writer_.Flush();
}
if (copy_table_config_.need_copy()) {
CopySparseTable();
CopyDenseTable();
CopyDenseVars();
}
}
} // end namespace framework
} // end namespace paddle
#endif
```
|
Chondotl () is a rural locality (a selo) in Khunzakhsky Selsoviet, Khunzakhsky District, Republic of Dagestan, Russia. Population: There are 3 streets in this selo.
Geography
It is located 4 km from Khunzakh (the district's administrative centre), 83 km from Makhachkala (capital of Dagestan) and 1,645 km from Moscow. Baitl is the nearest rural locality.
References
Rural localities in Khunzakhsky District
|
```go
/*
path_to_url
Unless required by applicable law or agreed to in writing, software
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
// Code generated by applyconfiguration-gen. DO NOT EDIT.
package v1
// NodeRuntimeHandlerApplyConfiguration represents a declarative configuration of the NodeRuntimeHandler type for use
// with apply.
type NodeRuntimeHandlerApplyConfiguration struct {
Name *string `json:"name,omitempty"`
Features *NodeRuntimeHandlerFeaturesApplyConfiguration `json:"features,omitempty"`
}
// NodeRuntimeHandlerApplyConfiguration constructs a declarative configuration of the NodeRuntimeHandler type for use with
// apply.
func NodeRuntimeHandler() *NodeRuntimeHandlerApplyConfiguration {
return &NodeRuntimeHandlerApplyConfiguration{}
}
// WithName sets the Name field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the Name field is set to the value of the last call.
func (b *NodeRuntimeHandlerApplyConfiguration) WithName(value string) *NodeRuntimeHandlerApplyConfiguration {
b.Name = &value
return b
}
// WithFeatures sets the Features field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the Features field is set to the value of the last call.
func (b *NodeRuntimeHandlerApplyConfiguration) WithFeatures(value *NodeRuntimeHandlerFeaturesApplyConfiguration) *NodeRuntimeHandlerApplyConfiguration {
b.Features = value
return b
}
```
|
Owen Wade (1831 – 1902) was an American politician and who served as a member of the Oregon Legislature and California State Assembly.
Early life and education
Wade was born on October 28, 1831, in Morgan County, Ohio, where he lived with his parents on a farm. In 1852, he relocated to the Willamette Valley in Oregon.
Career
Wade was elected to the Oregon Legislature in 1862, serving until 1865. In 1865, he was appointed Registrar of General Land Office in Oregon City, Oregon, by President Abraham Lincoln. In 1872, he served as chairman of the Republican Central Committee for Clackamas County. He retained the position of registrar until his resignation in January 1878. In 1879, he went to California and settled in St. Helena, California. There, in 1883, he became a cashier at the Bank of St. Helena. In 1892, he was elected to the California State Assembly. He was re-elected in 1894 and again in 1898.
Personal life
He married Charlotte Johnson in Clackamas County, Oregon, in 1866. They had three children. Charlotte died shortly after the birth of their last daughter in 1873. He died in San Francisco on May 18, 1902.
References
External links
1902 deaths
1831 births
Republican Party members of the California State Assembly
Republican Party members of the Oregon House of Representatives
Oregon pioneers
People from Oregon City, Oregon
People from Morgan County, Ohio
People from St. Helena, California
19th-century American politicians
|
Guangzhou Auto may refer to:
Auto Guangzhou (auto show)
Guangzhou Automobile (auto manufacturer)
|
The situation of the Eagle Wounded by an Arrow vaned with its own feathers is referred to in several ancient Greek sources and is listed as fable 276 in the Perry Index. It is generally applied to the misery of realising that one has contributed to one's own injury but also as a warning against self-reliant pride.
The fable and its interpretations
The earliest mention of the fable is a brief reference in The Myrmidons, a lost tragedy of Aeschylus written in the 5th century BCE. Here it is said to be of Libyan origin and is generally supposed to refer to the personal blame felt by Achilles for the death of his friend Patroclus.
So the eagle, pierced by the bow-sped shaft, looked
At the feathered device and said, “Thus, not by others,
But by means of our own plumage are we slain”.
Widespread references to the fable afterwards suggest that it had gained proverbial force. A version titled "The Archer and the Eagle" and ascribed to Aesop appeared among the collection of fables by Babrius.
The fable did not appear in mediaeval collections of fables reliant on Latin sources but began to be noticed in Europe from the 16th century. In Guillaume La Perrière's Emblem book Le théatre des bons engins (The theatre of fine devices, 1544), there is an illustration of the wounded eagle accompanied by a verse commenting that its sorrow at being struck down is doubled by the knowledge that it has furnished the means for its own destruction. But when the situation appeared in La Fontaine's Fables, it was under the more generalised title of "The bird wounded by an arrow" (II.6) and a wider lesson is drawn from the incident. The dying bird blames humans for using its own parts against itself and claims that they have learnt this cruelty from the way they treat each other.
A contemporary French emblem book took a different view of how the bird had contributed to its own hurt. Daniel de la Feuille's Devises et emblêmes (1691) starts from the perception that the bird in the poem was on the look-out for a hare. If another hunter brings it down while so engaged, then it is a case of poetic justice, of having inflicted on itself the harm it was purposing to inflict on others. Illustrated under the Latin title Capiens capior (the preyer become prey), it shows a sparrow hawk perched on a hare with an arrow through its own neck. There is also a coded reference to the fable in a mountain landscape by Anne-Louis Girodet dating from 1793/5. There an eagle pierced by an arrow lies at the foot of the picture, while towards it a huge snake is crawling across the rocks. Its writhing is echoed by the strangling ivy that climbs the tree beneath which the bird has fallen. Violence and cruelty is not limited to the human sphere; in the artist's eyes they are characteristic of nature as a whole.
The Greek origin of the fable was not lost sight of in France and Isaac de Benserade included L'aigle percé d'une flèche in his collection of Aesop's fables, recounting how it had allowed certain feathers to drop while grooming itself which were collected by the hunter who shot it.
Pierre de Frasnay (1676–1753) also provided a four-line poetic version in his Mythologie ou recueil des fables grecques, ésopiques et sybaritiques (Orléans 1750). The moral he drew from the story was that one should not be too self-reliant, for that too is an avenue that leads to harm.
Condemnation of pride was the interpretation given the fable when it travelled eastwards as well. In the 11th century Diwan (poetical works) of Nasir Khusraw, an eagle soars through the air, vaunting itself. When it is brought down by a hunter and recognises the feathers on the arrow, the realisation comes that it has been injured by its own means. Pieter de la Court was to give the story a similar interpretation in his Sinryke Fabulen (1685), making the point that those who thrust themselves into prominence become the mark for others to harm. The point is underlined by the Latin tag beneath the illustration of the injured bird, an adaptation of proverbial lines from the 4th century Latin poet Claudian: Vivitur exiguo melius, natura beatis / omnibus esse dedit, si quis cognoverit uti (it is better to live on little, [nature has provided for all to do so happily,] could one but know it).
Yet another fable of similar meaning is numbered 303 in the Perry Index. In it an oak (or a pine in another version) complains of being split by wedges made from its own branches. Commentaries on these fables point out that suffering is increased by the knowledge that it is one's own fault.
Poetical allusions
The proverbial image of the wounded eagle was to become a common conceit in English poetry of the 17th century and after. Just as Aeschylus described his image as coming from Libya, James Howell identifies the 2nd century writer Lucian as his source in a commendatory poem on the work of Giles Fletcher:
England, like Lucian’s eagle with an arrow
Of her own plumes, piercing her heart quite thorow.
As he does so, he is also echoing the same conceit used in Fletcher's poem "Christ's Victory in Heaven".
Two poets identified with the Cavalier cause also used the conceit. Katherine Philips placed it at the start of her poem "On Controversies in Religion" (1667), arguing that religion becomes the victim of misapplied texts
And meets that Eagles destiny, whose breast
Felt the same shaft which his own feathers drest.
Edmund Waller, on the other hand, turned the image to Baroque hyperbole by making himself the victim of "A Lady singing a Song of his Composing".
The image was still current at the start of the 19th century. Lord Byron used it in the course of lamenting the early death of Henry Kirke White while still a student. At more or less the same time, Thomas Moore applied it in his early political poem "Corruption" (1808).
Artistic use
La Fontaine's version of the fable was illustrated by woodcuts in various editions over the centuries, usually by nothing more original than a picture of a bird lying on the ground with an arrow piercing its neck or breast. One or other of these served as model for the left-hand page of Kawanabe Kyosui's coloured woodcut in the collectors edition Choix de Fables de La Fontaine published from Tokyo in 1894 with illustrations by Japanese artists. What brings the composition to life is the depiction of the bowman crouching on the bushy shore on the right-hand page.
Marc Chagall also included a distant bowman in his coloured print of 1927 but gives greater prominence to the death agonies of the wounded bird, which is echoed by the waving foliage in the background. André Masson's L'oiseau percé de flèches (1925) equally gives a sense of painful movement. In this Cubist work, the stricken bird inclines diagonally across a stylised rocky background and still aspires upwards.
The painting by Rosa Bonheur of a wounded eagle in mid-air (c. 1870) is not generally referred to the original Greek fable and no arrow is shown there. Instead, it is the eagle's political symbolism on which critics comment, interpreting the work as referring both to the defeat of Napoleon III in the Franco-Prussian war and to the injury to the Prussian state of its aggression. Nevertheless, the theme of harm brought by its own agency is available as an alternative reading.
Among musical settings of La Fontaine's fable are Heitor Villa-Lobos' for voice and piano (1913), and that of Marcelle de Manziarly as the second of her Trois Fables de La Fontaine (1935). In addition, it was Marianne Moore’s poetical versions that were used in Ned Rorem's Fables (1971) as the basis of his 'very short operas', of which "The bird wounded by an arrow" is placed third. More recently it featured as the third piece in Vladimir Cosma's Eh bien ! Dansez maintenant (2006), a light-hearted interpretation for narrator and orchestra in the style of a funeral march.
References
External links
Illustrations from the 15th – 20th centuries
Aesop's Fables
La Fontaine's Fables
Emblem books
Proverbs
Fictional birds of prey
|
Toy Soldiers: War Chest is an action/strategy video game developed by Signal Studios and published by Ubisoft. The game was released in August 2015 for Microsoft Windows, PlayStation 4 and Xbox One.
War Chest is the first title in the series not to be a Microsoft console exclusive.
Gameplay
Toy Soldiers: War Chest is similar to the previous games where players prevent enemy units from reaching the toybox by building and upgrading turrets. In War Chest, turrets can be improved by upgrading armor, fire rate and damage separately. The enemy AI is improved as well. For example, destroying a bridge will cause ground units to take a different path to the toybox. Certain units have the ability to heal nearby units and some will focus on destroying any placed turrets.
Barrages and playable units from Toy Soldiers: Cold War return with a few changes. Instead of earning killstreaks or destroying a specially marked enemy unit, the game uses a bar that fills up when killing enemy units. When the bar is filled to a certain amount, a special ability can used to call in barrages or spawn a hero unit such as a zeppelin that performs a bombing run.
The game features 4 highly customizable armies (8 in Hall of Fame Edition). Players can choose which turrets to deploy, barrages and modify the hero's arsenal. As the game progresses, new customization options will become available
Release
War Chest comes in two versions: Standard and Hall of Fame Edition. The Standard version is digital while the Hall of Fame Edition is available on disc except for the PC version which is all digital. The standard version features four playable armies; in addition to Kaiser from the original game, War Chest includes three new original armies, namely Phantom, StarBright and Dark Lord.
The Hall of Fame Edition features four additional licensed armies based on fictional characters. This includes Duke and Cobra Commander from G.I. Joe, Ezio Auditore da Firenze from Assassin's Creed and He-Man from Masters of the Universe. The characters can be purchased separately or as a bundle on the standard version.
Reception
The game received "mixed" reviews on all platforms according to the review aggregation website Metacritic.
National Post gave the PlayStation 4 version 7.5 out of 10, saying, "Even without multiplayer, though, there's a good 20-plus hours of action packed into this fun little childhood throwback – more than enough to keep strategy fans occupied until the end of the summer." However, The Digital Fix gave the Xbox One version five out of ten, calling it "a decent tower defence title but is severely hamstrung by poor performance, dodgy looks, a big old paywall to character content and some odd design decisions." Metro gave the same console version three out of ten, saying, "Mixing Tower Defense, third person action, and beloved '80s toys should've been a recipe for success, but this bland sequel doesn't do justice to any of its ideas."
References
External links
2015 video games
Action games
Multiplayer and single-player video games
PlayStation 4 games
Signal Studios games
Split-screen multiplayer games
Strategy video games
Tower defense video games
Ubisoft games
Video games about toys
Video games based on toys
Video games developed in the United States
Windows games
World War I video games
Xbox One games
|
```kotlin
package com.x8bit.bitwarden.data.platform.datasource.network.serializer
import com.x8bit.bitwarden.data.platform.datasource.network.di.PlatformNetworkModule
import kotlinx.serialization.SerialName
import kotlinx.serialization.Serializable
import kotlinx.serialization.json.encodeToJsonElement
import org.junit.jupiter.api.Assertions.assertEquals
import org.junit.jupiter.api.Test
import java.time.ZoneId
import java.time.ZoneOffset
import java.time.ZonedDateTime
class ZonedDateTimeSerializerTest {
private val json = PlatformNetworkModule.providesJson()
@Test
fun `properly deserializes raw JSON to ZonedDateTime`() {
assertEquals(
ZonedDateTimeData(
dataAsZonedDateTime = ZonedDateTime.of(
2023,
10,
6,
17,
22,
28,
440000000,
ZoneOffset.UTC,
),
),
json.decodeFromString<ZonedDateTimeData>(
"""
{
"dataAsZonedDateTime": "2023-10-06T17:22:28.44Z"
}
""",
),
)
}
@Test
fun `properly deserializes raw JSON with nano seconds to ZonedDateTime`() {
assertEquals(
ZonedDateTimeData(
dataAsZonedDateTime = ZonedDateTime.of(
2023,
8,
1,
16,
13,
3,
502391000,
ZoneOffset.UTC,
),
),
json.decodeFromString<ZonedDateTimeData>(
"""
{
"dataAsZonedDateTime": "2023-08-01T16:13:03.502391Z"
}
""",
),
)
}
@Test
fun `properly serializes external model back to raw JSON`() {
assertEquals(
json.parseToJsonElement(
"""
{
"dataAsZonedDateTime": "2023-10-06T17:22:28.440Z"
}
""",
),
json.encodeToJsonElement(
ZonedDateTimeData(
dataAsZonedDateTime = ZonedDateTime.of(
2023,
10,
6,
17,
22,
28,
440000000,
ZoneId.of("UTC"),
),
),
),
)
}
}
@Serializable
private data class ZonedDateTimeData(
@Serializable(ZonedDateTimeSerializer::class)
@SerialName("dataAsZonedDateTime")
val dataAsZonedDateTime: ZonedDateTime,
)
```
|
```c++
#include <DataTypes/DataTypeString.h>
#include <DataTypes/DataTypeNullable.h>
#include <Interpreters/Context.h>
#include <Interpreters/InterpreterInsertQuery.h>
#include <Interpreters/InterpreterSelectQuery.h>
#include <Parsers/ASTCreateQuery.h>
#include <Parsers/ASTExpressionList.h>
#include <Parsers/ASTInsertQuery.h>
#include <Processors/Executors/CompletedPipelineExecutor.h>
#include <Processors/Executors/PushingPipelineExecutor.h>
#include <Processors/Transforms/ExpressionTransform.h>
#include <Processors/QueryPlan/ReadFromPreparedSource.h>
#include <Processors/QueryPlan/QueryPlan.h>
#include <Storages/NATS/NATSSource.h>
#include <Storages/NATS/StorageNATS.h>
#include <Storages/NATS/NATSProducer.h>
#include <Storages/MessageQueueSink.h>
#include <Storages/StorageFactory.h>
#include <Storages/StorageMaterializedView.h>
#include <Storages/NamedCollectionsHelpers.h>
#include <QueryPipeline/Pipe.h>
#include <boost/algorithm/string/split.hpp>
#include <boost/algorithm/string/trim.hpp>
#include <Common/Exception.h>
#include <Common/Macros.h>
#include <Common/logger_useful.h>
#include <Common/setThreadName.h>
#include <openssl/ssl.h>
namespace DB
{
static const uint32_t QUEUE_SIZE = 100000;
static const auto RESCHEDULE_MS = 500;
static const auto MAX_THREAD_WORK_DURATION_MS = 60000;
namespace ErrorCodes
{
extern const int LOGICAL_ERROR;
extern const int BAD_ARGUMENTS;
extern const int NUMBER_OF_ARGUMENTS_DOESNT_MATCH;
extern const int CANNOT_CONNECT_NATS;
extern const int QUERY_NOT_ALLOWED;
}
StorageNATS::StorageNATS(
const StorageID & table_id_,
ContextPtr context_,
const ColumnsDescription & columns_,
const String & comment,
std::unique_ptr<NATSSettings> nats_settings_,
LoadingStrictnessLevel mode)
: IStorage(table_id_)
, WithContext(context_->getGlobalContext())
, nats_settings(std::move(nats_settings_))
, subjects(parseList(getContext()->getMacros()->expand(nats_settings->nats_subjects), ','))
, format_name(getContext()->getMacros()->expand(nats_settings->nats_format))
, schema_name(getContext()->getMacros()->expand(nats_settings->nats_schema))
, num_consumers(nats_settings->nats_num_consumers.value)
, max_rows_per_message(nats_settings->nats_max_rows_per_message)
, log(getLogger("StorageNATS (" + table_id_.table_name + ")"))
, semaphore(0, static_cast<int>(num_consumers))
, queue_size(std::max(QUEUE_SIZE, static_cast<uint32_t>(getMaxBlockSize())))
, throw_on_startup_failure(mode <= LoadingStrictnessLevel::CREATE)
{
auto nats_username = getContext()->getMacros()->expand(nats_settings->nats_username);
auto nats_password = getContext()->getMacros()->expand(nats_settings->nats_password);
auto nats_token = getContext()->getMacros()->expand(nats_settings->nats_token);
auto nats_credential_file = getContext()->getMacros()->expand(nats_settings->nats_credential_file);
configuration =
{
.url = getContext()->getMacros()->expand(nats_settings->nats_url),
.servers = parseList(getContext()->getMacros()->expand(nats_settings->nats_server_list), ','),
.username = nats_username.empty() ? getContext()->getConfigRef().getString("nats.user", "") : nats_username,
.password = nats_password.empty() ? getContext()->getConfigRef().getString("nats.password", "") : nats_password,
.token = nats_token.empty() ? getContext()->getConfigRef().getString("nats.token", "") : nats_token,
.credential_file = nats_credential_file.empty() ? getContext()->getConfigRef().getString("nats.credential_file", "") : nats_credential_file,
.max_reconnect = static_cast<int>(nats_settings->nats_max_reconnect.value),
.reconnect_wait = static_cast<int>(nats_settings->nats_reconnect_wait.value),
.secure = nats_settings->nats_secure.value
};
if (configuration.secure)
SSL_library_init();
StorageInMemoryMetadata storage_metadata;
storage_metadata.setColumns(columns_);
storage_metadata.setComment(comment);
setInMemoryMetadata(storage_metadata);
setVirtuals(createVirtuals(nats_settings->nats_handle_error_mode));
nats_context = addSettings(getContext());
nats_context->makeQueryContext();
try
{
size_t num_tries = nats_settings->nats_startup_connect_tries;
for (size_t i = 0; i < num_tries; ++i)
{
connection = std::make_shared<NATSConnectionManager>(configuration, log);
if (connection->connect())
break;
if (i == num_tries - 1)
{
throw Exception(
ErrorCodes::CANNOT_CONNECT_NATS,
"Cannot connect to {}. Nats last error: {}",
connection->connectionInfoForLog(), nats_GetLastError(nullptr));
}
LOG_DEBUG(log, "Connect attempt #{} failed, error: {}. Reconnecting...", i + 1, nats_GetLastError(nullptr));
}
}
catch (...)
{
tryLogCurrentException(log);
if (throw_on_startup_failure)
throw;
}
/// One looping task for all consumers as they share the same connection == the same handler == the same event loop
looping_task = getContext()->getMessageBrokerSchedulePool().createTask("NATSLoopingTask", [this] { loopingFunc(); });
looping_task->deactivate();
streaming_task = getContext()->getMessageBrokerSchedulePool().createTask("NATSStreamingTask", [this] { streamingToViewsFunc(); });
streaming_task->deactivate();
connection_task = getContext()->getMessageBrokerSchedulePool().createTask("NATSConnectionManagerTask", [this] { connectionFunc(); });
connection_task->deactivate();
}
VirtualColumnsDescription StorageNATS::createVirtuals(StreamingHandleErrorMode handle_error_mode)
{
VirtualColumnsDescription desc;
desc.addEphemeral("_subject", std::make_shared<DataTypeString>(), "");
if (handle_error_mode == StreamingHandleErrorMode::STREAM)
{
desc.addEphemeral("_raw_message", std::make_shared<DataTypeNullable>(std::make_shared<DataTypeString>()), "");
desc.addEphemeral("_error", std::make_shared<DataTypeNullable>(std::make_shared<DataTypeString>()), "");
}
return desc;
}
Names StorageNATS::parseList(const String & list, char delim)
{
Names result;
if (list.empty())
return result;
boost::split(result, list, [delim](char c) { return c == delim; });
for (String & key : result)
boost::trim(key);
return result;
}
String StorageNATS::getTableBasedName(String name, const StorageID & table_id)
{
if (name.empty())
return fmt::format("{}_{}", table_id.database_name, table_id.table_name);
else
return fmt::format("{}_{}_{}", name, table_id.database_name, table_id.table_name);
}
ContextMutablePtr StorageNATS::addSettings(ContextPtr local_context) const
{
auto modified_context = Context::createCopy(local_context);
modified_context->setSetting("input_format_skip_unknown_fields", true);
modified_context->setSetting("input_format_allow_errors_ratio", 0.);
if (nats_settings->nats_handle_error_mode == StreamingHandleErrorMode::DEFAULT)
modified_context->setSetting("input_format_allow_errors_num", nats_settings->nats_skip_broken_messages.value);
else
modified_context->setSetting("input_format_allow_errors_num", Field{0});
/// Since we are reusing the same context for all queries executed simultaneously, we don't want to used shared `analyze_count`
modified_context->setSetting("max_analyze_depth", Field{0});
if (!schema_name.empty())
modified_context->setSetting("format_schema", schema_name);
for (const auto & setting : *nats_settings)
{
const auto & setting_name = setting.getName();
/// check for non-nats-related settings
if (!setting_name.starts_with("nats_"))
modified_context->setSetting(setting_name, setting.getValue());
}
return modified_context;
}
void StorageNATS::loopingFunc()
{
connection->getHandler().startLoop();
looping_task->activateAndSchedule();
}
void StorageNATS::stopLoop()
{
connection->getHandler().updateLoopState(Loop::STOP);
}
void StorageNATS::stopLoopIfNoReaders()
{
/// Stop the loop if no select was started.
/// There can be a case that selects are finished
/// but not all sources decremented the counter, then
/// it is ok that the loop is not stopped, because
/// there is a background task (streaming_task), which
/// also checks whether there is an idle loop.
std::lock_guard lock(loop_mutex);
if (readers_count)
return;
connection->getHandler().updateLoopState(Loop::STOP);
}
void StorageNATS::startLoop()
{
connection->getHandler().updateLoopState(Loop::RUN);
looping_task->activateAndSchedule();
}
void StorageNATS::incrementReader()
{
++readers_count;
}
void StorageNATS::decrementReader()
{
--readers_count;
}
void StorageNATS::connectionFunc()
{
if (consumers_ready)
return;
bool needs_rescheduling = true;
if (connection->reconnect())
needs_rescheduling &= !initBuffers();
if (needs_rescheduling)
connection_task->scheduleAfter(RESCHEDULE_MS);
}
bool StorageNATS::initBuffers()
{
size_t num_initialized = 0;
for (auto & consumer : consumers)
{
try
{
consumer->subscribe();
++num_initialized;
}
catch (...)
{
tryLogCurrentException(log);
break;
}
}
startLoop();
const bool are_consumers_initialized = num_initialized == num_created_consumers;
if (are_consumers_initialized)
consumers_ready.store(true);
return are_consumers_initialized;
}
/* Need to deactivate this way because otherwise might get a deadlock when first deactivate streaming task in shutdown and then
* inside streaming task try to deactivate any other task
*/
void StorageNATS::deactivateTask(BackgroundSchedulePool::TaskHolder & task, bool stop_loop)
{
if (stop_loop)
stopLoop();
std::unique_lock<std::mutex> lock(task_mutex, std::defer_lock);
lock.lock();
task->deactivate();
}
size_t StorageNATS::getMaxBlockSize() const
{
return nats_settings->nats_max_block_size.changed ? nats_settings->nats_max_block_size.value
: (getContext()->getSettingsRef().max_insert_block_size.value / num_consumers);
}
void StorageNATS::read(
QueryPlan & query_plan,
const Names & column_names,
const StorageSnapshotPtr & storage_snapshot,
SelectQueryInfo & query_info,
ContextPtr local_context,
QueryProcessingStage::Enum /* processed_stage */,
size_t /* max_block_size */,
size_t /* num_streams */)
{
if (!consumers_ready)
throw Exception(ErrorCodes::CANNOT_CONNECT_NATS, "NATS consumers setup not finished. Connection might be lost");
if (num_created_consumers == 0)
return;
if (!local_context->getSettingsRef().stream_like_engine_allow_direct_select)
throw Exception(
ErrorCodes::QUERY_NOT_ALLOWED, "Direct select is not allowed. To enable use setting `stream_like_engine_allow_direct_select`");
if (mv_attached)
throw Exception(ErrorCodes::QUERY_NOT_ALLOWED, "Cannot read from StorageNATS with attached materialized views");
std::lock_guard lock(loop_mutex);
auto sample_block = storage_snapshot->getSampleBlockForColumns(column_names);
auto modified_context = addSettings(local_context);
if (!connection->isConnected())
{
if (!connection->reconnect())
throw Exception(ErrorCodes::CANNOT_CONNECT_NATS, "No connection to {}", connection->connectionInfoForLog());
}
Pipes pipes;
pipes.reserve(num_created_consumers);
for (size_t i = 0; i < num_created_consumers; ++i)
{
auto nats_source = std::make_shared<NATSSource>(*this, storage_snapshot, modified_context, column_names, 1, nats_settings->nats_handle_error_mode);
auto converting_dag = ActionsDAG::makeConvertingActions(
nats_source->getPort().getHeader().getColumnsWithTypeAndName(),
sample_block.getColumnsWithTypeAndName(),
ActionsDAG::MatchColumnsMode::Name);
auto converting = std::make_shared<ExpressionActions>(std::move(converting_dag));
auto converting_transform = std::make_shared<ExpressionTransform>(nats_source->getPort().getHeader(), std::move(converting));
pipes.emplace_back(std::move(nats_source));
pipes.back().addTransform(std::move(converting_transform));
}
if (!connection->getHandler().loopRunning() && connection->isConnected())
startLoop();
LOG_DEBUG(log, "Starting reading {} streams", pipes.size());
auto pipe = Pipe::unitePipes(std::move(pipes));
if (pipe.empty())
{
auto header = storage_snapshot->getSampleBlockForColumns(column_names);
InterpreterSelectQuery::addEmptySourceToQueryPlan(query_plan, header, query_info);
}
else
{
auto read_step = std::make_unique<ReadFromStorageStep>(std::move(pipe), getName(), local_context, query_info);
query_plan.addStep(std::move(read_step));
query_plan.addInterpreterContext(modified_context);
}
}
SinkToStoragePtr StorageNATS::write(const ASTPtr &, const StorageMetadataPtr & metadata_snapshot, ContextPtr local_context, bool /*async_insert*/)
{
auto modified_context = addSettings(local_context);
std::string subject = modified_context->getSettingsRef().stream_like_engine_insert_queue.changed
? modified_context->getSettingsRef().stream_like_engine_insert_queue.value
: "";
if (subject.empty())
{
if (subjects.size() > 1)
{
throw Exception(
ErrorCodes::NUMBER_OF_ARGUMENTS_DOESNT_MATCH,
"This NATS engine reads from multiple subjects. "
"You must specify `stream_like_engine_insert_queue` to choose the subject to write to");
}
else
{
subject = subjects[0];
}
}
auto pos = subject.find('*');
if (pos != std::string::npos || subject.back() == '>')
throw Exception(ErrorCodes::BAD_ARGUMENTS, "Can not publish to wildcard subject");
if (!isSubjectInSubscriptions(subject))
throw Exception(ErrorCodes::BAD_ARGUMENTS, "Selected subject is not among engine subjects");
auto producer = std::make_unique<NATSProducer>(configuration, subject, shutdown_called, log);
size_t max_rows = max_rows_per_message;
/// Need for backward compatibility.
if (format_name == "Avro" && local_context->getSettingsRef().output_format_avro_rows_in_file.changed)
max_rows = local_context->getSettingsRef().output_format_avro_rows_in_file.value;
return std::make_shared<MessageQueueSink>(
metadata_snapshot->getSampleBlockNonMaterialized(), getFormatName(), max_rows, std::move(producer), getName(), modified_context);}
void StorageNATS::startup()
{
for (size_t i = 0; i < num_consumers; ++i)
{
try
{
auto consumer = createConsumer();
pushConsumer(std::move(consumer));
++num_created_consumers;
}
catch (...)
{
if (throw_on_startup_failure)
throw;
tryLogCurrentException(log);
}
}
if (!connection->isConnected() || !initBuffers())
connection_task->activateAndSchedule();
}
void StorageNATS::shutdown(bool /* is_drop */)
{
shutdown_called = true;
/// In case it has not yet been able to setup connection;
deactivateTask(connection_task, false);
/// The order of deactivating tasks is important: wait for streamingToViews() func to finish and
/// then wait for background event loop to finish.
deactivateTask(streaming_task, false);
deactivateTask(looping_task, true);
/// Just a paranoid try catch, it is not actually needed.
try
{
if (drop_table)
{
for (auto & consumer : consumers)
consumer->unsubscribe();
}
connection->disconnect();
for (size_t i = 0; i < num_created_consumers; ++i)
popConsumer();
}
catch (...)
{
tryLogCurrentException(log);
}
}
void StorageNATS::pushConsumer(NATSConsumerPtr consumer)
{
std::lock_guard lock(consumers_mutex);
consumers.push_back(consumer);
semaphore.set();
}
NATSConsumerPtr StorageNATS::popConsumer()
{
return popConsumer(std::chrono::milliseconds::zero());
}
NATSConsumerPtr StorageNATS::popConsumer(std::chrono::milliseconds timeout)
{
// Wait for the first free consumer
if (timeout == std::chrono::milliseconds::zero())
semaphore.wait();
else
{
if (!semaphore.tryWait(timeout.count()))
return nullptr;
}
// Take the first available consumer from the list
std::lock_guard lock(consumers_mutex);
auto consumer = consumers.back();
consumers.pop_back();
return consumer;
}
NATSConsumerPtr StorageNATS::createConsumer()
{
return std::make_shared<NATSConsumer>(
connection, *this, subjects,
nats_settings->nats_queue_group.changed ? nats_settings->nats_queue_group.value : getStorageID().getFullTableName(),
log, queue_size, shutdown_called);
}
bool StorageNATS::isSubjectInSubscriptions(const std::string & subject)
{
auto subject_levels = parseList(subject, '.');
for (const auto & nats_subject : subjects)
{
auto nats_subject_levels = parseList(nats_subject, '.');
size_t levels_to_check = 0;
if (!nats_subject_levels.empty() && nats_subject_levels.back() == ">")
levels_to_check = nats_subject_levels.size() - 1;
if (levels_to_check)
{
if (subject_levels.size() < levels_to_check)
continue;
}
else
{
if (subject_levels.size() != nats_subject_levels.size())
continue;
levels_to_check = nats_subject_levels.size();
}
bool is_same = true;
for (size_t i = 0; i < levels_to_check; ++i)
{
if (nats_subject_levels[i] == "*")
continue;
if (subject_levels[i] != nats_subject_levels[i])
{
is_same = false;
break;
}
}
if (is_same)
return true;
}
return false;
}
bool StorageNATS::checkDependencies(const StorageID & table_id)
{
// Check if all dependencies are attached
auto view_ids = DatabaseCatalog::instance().getDependentViews(table_id);
if (view_ids.empty())
return true;
// Check the dependencies are ready?
for (const auto & view_id : view_ids)
{
auto view = DatabaseCatalog::instance().tryGetTable(view_id, getContext());
if (!view)
return false;
// If it materialized view, check it's target table
auto * materialized_view = dynamic_cast<StorageMaterializedView *>(view.get());
if (materialized_view && !materialized_view->tryGetTargetTable())
return false;
// Check all its dependencies
if (!checkDependencies(view_id))
return false;
}
return true;
}
void StorageNATS::streamingToViewsFunc()
{
bool do_reschedule = true;
try
{
auto table_id = getStorageID();
// Check if at least one direct dependency is attached
size_t num_views = DatabaseCatalog::instance().getDependentViews(table_id).size();
bool nats_connected = connection->isConnected() || connection->reconnect();
if (num_views && nats_connected)
{
auto start_time = std::chrono::steady_clock::now();
mv_attached.store(true);
// Keep streaming as long as there are attached views and streaming is not cancelled
while (!shutdown_called && num_created_consumers > 0)
{
if (!checkDependencies(table_id))
break;
LOG_DEBUG(log, "Started streaming to {} attached views", num_views);
if (streamToViews())
{
/// Reschedule with backoff.
do_reschedule = false;
break;
}
auto end_time = std::chrono::steady_clock::now();
auto duration = std::chrono::duration_cast<std::chrono::milliseconds>(end_time - start_time);
if (duration.count() > MAX_THREAD_WORK_DURATION_MS)
{
LOG_TRACE(log, "Reschedule streaming. Thread work duration limit exceeded.");
break;
}
}
}
}
catch (...)
{
tryLogCurrentException(__PRETTY_FUNCTION__);
}
mv_attached.store(false);
if (!shutdown_called && do_reschedule)
streaming_task->scheduleAfter(RESCHEDULE_MS);
}
bool StorageNATS::streamToViews()
{
auto table_id = getStorageID();
auto table = DatabaseCatalog::instance().getTable(table_id, getContext());
if (!table)
throw Exception(ErrorCodes::LOGICAL_ERROR, "Engine table {} doesn't exist.", table_id.getNameForLogs());
// Create an INSERT query for streaming data
auto insert = std::make_shared<ASTInsertQuery>();
insert->table_id = table_id;
// Only insert into dependent views and expect that input blocks contain virtual columns
InterpreterInsertQuery interpreter(
insert,
nats_context,
/* allow_materialized */ false,
/* no_squash */ true,
/* no_destination */ true,
/* async_isnert */ false);
auto block_io = interpreter.execute();
auto storage_snapshot = getStorageSnapshot(getInMemoryMetadataPtr(), getContext());
auto column_names = block_io.pipeline.getHeader().getNames();
auto sample_block = storage_snapshot->getSampleBlockForColumns(column_names);
auto block_size = getMaxBlockSize();
// Create a stream for each consumer and join them in a union stream
std::vector<std::shared_ptr<NATSSource>> sources;
Pipes pipes;
sources.reserve(num_created_consumers);
pipes.reserve(num_created_consumers);
for (size_t i = 0; i < num_created_consumers; ++i)
{
LOG_DEBUG(log, "Current queue size: {}", consumers[0]->queueSize());
auto source = std::make_shared<NATSSource>(*this, storage_snapshot, nats_context, column_names, block_size, nats_settings->nats_handle_error_mode);
sources.emplace_back(source);
pipes.emplace_back(source);
Poco::Timespan max_execution_time = nats_settings->nats_flush_interval_ms.changed
? nats_settings->nats_flush_interval_ms
: getContext()->getSettingsRef().stream_flush_interval_ms;
source->setTimeLimit(max_execution_time);
}
block_io.pipeline.complete(Pipe::unitePipes(std::move(pipes)));
if (!connection->getHandler().loopRunning())
startLoop();
{
CompletedPipelineExecutor executor(block_io.pipeline);
executor.execute();
}
size_t queue_empty = 0;
if (!connection->isConnected())
{
if (shutdown_called)
return true;
if (connection->reconnect())
{
LOG_DEBUG(log, "Connection restored");
}
else
{
LOG_TRACE(log, "Reschedule streaming. Unable to restore connection.");
return true;
}
}
else
{
for (auto & source : sources)
{
if (source->queueEmpty())
++queue_empty;
connection->getHandler().iterateLoop();
}
}
if (queue_empty == num_created_consumers)
{
LOG_TRACE(log, "Reschedule streaming. Queues are empty.");
return true;
}
else
{
startLoop();
}
/// Do not reschedule, do not stop event loop.
return false;
}
void registerStorageNATS(StorageFactory & factory)
{
auto creator_fn = [](const StorageFactory::Arguments & args)
{
auto nats_settings = std::make_unique<NATSSettings>();
if (auto named_collection = tryGetNamedCollectionWithOverrides(args.engine_args, args.getLocalContext()))
{
for (const auto & setting : nats_settings->all())
{
const auto & setting_name = setting.getName();
if (named_collection->has(setting_name))
nats_settings->set(setting_name, named_collection->get<String>(setting_name));
}
}
else if (!args.storage_def->settings)
throw Exception(ErrorCodes::BAD_ARGUMENTS, "NATS engine must have settings");
nats_settings->loadFromQuery(*args.storage_def);
if (!nats_settings->nats_url.changed && !nats_settings->nats_server_list.changed)
throw Exception(ErrorCodes::NUMBER_OF_ARGUMENTS_DOESNT_MATCH, "You must specify either `nats_url` or `nats_server_list` settings");
if (!nats_settings->nats_format.changed)
throw Exception(ErrorCodes::NUMBER_OF_ARGUMENTS_DOESNT_MATCH, "You must specify `nats_format` setting");
if (!nats_settings->nats_subjects.changed)
throw Exception(ErrorCodes::NUMBER_OF_ARGUMENTS_DOESNT_MATCH, "You must specify `nats_subjects` setting");
return std::make_shared<StorageNATS>(args.table_id, args.getContext(), args.columns, args.comment, std::move(nats_settings), args.mode);
};
factory.registerStorage("NATS", creator_fn, StorageFactory::StorageFeatures{ .supports_settings = true, });
}
}
```
|
Deir Yassin () was a Palestinian Arab village of around 600 inhabitants about west of Jerusalem. Deir Yassin declared its neutrality during the 1948 Palestine war between Arabs and Jews. The village was razed after a massacre of around 107 of its Arab residents on April 9, 1948, by the Jewish paramilitary groups Irgun and Lehi. The village buildings are today part of the Kfar Shaul Mental Health Center, an Israeli public psychiatric hospital.
Name
The first part of the village's name Deir is defined as "monastery" in Arabic. According to Palestinian historian Walid Khalidi, this was a common occurrence in Palestinian village names especially those so close to Jerusalem. A large ruin that lay at the southwestern edge of Deir Yassin was known simply as "Deir".
History
Crusader/Ayyubid and Mamluk periods
Deir Yassin has been identified as one of the villages given as a fief to the Church of the Holy Sepulchre in the 12th century. However, in 1136 Fulk, King of Jerusalem confirmed it was a casale under the Knights Hospitallers. It has been suggested that a vaulted building in the center of the village could have been of Crusader or Mamluk origin.
Tawfiq Canaan noted that a yellow stone, popular in the Jerusalem Mamluk ablaq building decorations, was apparently quarried at Deir Yassin towards the end of the fifteenth century.
Ottoman period
During the Ottoman era, which began in 1517, the nucleus of settlement activity in the area was Khirbet Ayn al-Tut ("The Ruin of the Mulberry Spring")—some west of the 1948 village site. In 1596, this village was under the administration of the nahiya (subdistrict) of Jerusalem, part of the sanjak (district) of Jerusalem. It had a population of seven Muslim households, who paid taxes on wheat, barley, and olive trees; a total of 4,522 akçe. All of the revenue went to a waqf.
It is unknown precisely when settlement shifted to Deir Yassin. The village was named in honor of a certain Sheikh Yassin whose tomb was in a mosque, or shrine located just outside the village, on a high spot, dominating the surrounding area. The village guesthouse, or Madafeh, was located opposite the shrine.
Edward Robinson noted the village in 1838, and by 1870, an Ottoman village list indicated 13 houses and a population of 48, though the list only counted men. In 1896 the population of Deir Yassin was estimated to be about 138 persons.
In the late 19th century, the houses of Deir Yassin were built of stone. Two springs—one located in the north and another in the south—supplied water to the village. Most of its houses, strongly built with thick walls, were clustered in a small area known as the Hara meaning "Quarter" or "Neighborhood". All residents were Muslims. In 1906, a Jewish suburb of Jerusalem, Givat Shaul, was built across the valley from Deir Yassin. The secondary road linking the village to Jerusalem and the road to Jaffa ran through the suburb.
World War I and British Mandate
During World War I, the Ottomans fortified the hilltop of Deir Yassin as part of the defense system of Jerusalem, but on December 8, 1917, these fortifications were stormed by the Allied Forces under Edmund Allenby. The following day Jerusalem fell to the British. Until the 1920s, Deir Yassin's inhabitants mostly depended on agriculture and livestock for income, but the extensive building projects in Jerusalem in the British Mandate period transformed the basis of its economy.
Deir Yassin's inhabitants prospered from mining, its main source of employment. A rich vein of hard yellow limestone, known as mizi yahudi was prized for its resistance to the rigors of Jerusalem's climate. The quarry (hajar yasinik or "Yasin's stone") supplied the Jerusalem market, and the wealth allowed the village to develop spacious housing, two elementary schools and mosques. By the late 1940s, there were four stone crushers functioning in the village. The business encouraged the wealthier inhabitants to invest in trucking while others became truck drivers. In 1935, a local bus company was established in a joint venture with the neighboring Arab village of Lifta. As Deir Yassin prospered, houses radiated from the Hara uphill and eastward, towards Jerusalem.
In the early days of the British Mandate, Deir Yassin had no school of its own and its children attended the school at Lifta or in Qalunya. By 1943, two elementary schools were built—one for boys and one for girls. The girls' school had a resident headmistress from Jerusalem. At that time, Deir Yassin also had a bakery, two guesthouses, and a social club—the "Renaissance Club", a thrift fund, three shops, four wells and a second mosque built by Mahmud Salah, an affluent resident. Many inhabitants were employed outside the village in the nearby British Army camps as waiters, carpenters, and foremen; others as clerks and teachers in the mandatory civil service. By this time, no more than 15% of the population was engaged in agriculture.
Relations between Deir Yassin and its Jewish neighbors had started reasonably well under the Ottomans, particularly early on when Arabic-speaking Sephardic Yemenite Jews comprised much of the surrounding population. Relations rapidly deteriorated with the growth of Zionism in Palestine and reached their apex during the Arab revolt in 1936-1939. Relations picked up again during the economic boom years of full employment of World War II. Thus, in 1948, Deir Yassin was a prosperous, expanding village at relative peace with its Jewish neighbors with whom much business was done.
April 1948
When hostilities erupted in 1948, the villagers of Deir Yassin and those of the nearby Jewish village of Giv'at Shaul signed a pact, later approved at Haganah headquarters, to maintain their good relations, exchange information on movement of outsiders through village territory, and ensure the safety of vehicles from the village. The inhabitants of Deir Yassin upheld the agreement scrupulously, resisting infiltration by Arab irregulars. Though this was known to the Irgun and Lehi forces, they attacked the village on April 9, 1948. The assault was beaten off initially, with the attackers suffering 40 wounded. Only the intervention of a Palmach unit, using mortars, allowed them to occupy the village. Houses were blown up with people inside and people shot: 107 villagers, including women and children, were killed. The survivors were loaded on trucks that were driven through Jerusalem in a victory parade, with some sources describing further violence by Lehi soldiers. Four Irgun or Lehi men were killed. The incident became known as the Deir Yassin massacre.
On April 10, 1948, one day after the Deir Yassin massacre, Albert Einstein wrote a critical letter to the American Friends of Fighters for the Freedom of Israel (the U.S chapter of Lehi) refusing to assist them with aid or support to raise money for their cause in Palestine. On December 2, 1948, many prominent American Jews signed and published an op-ed article in The New York Times critical of Menachem Begin and the massacre at Deir Yassin.
Post-1948
Following the war, the area was incorporated into the State of Israel. A year later, the Jewish neighborhood of Givat Shaul Bet was built on Deir Yassin's land, despite Israeli scholars' protests to Prime Minister David Ben-Gurion. In 1951, the Kfar Shaul Mental Health Center was built within the village itself, using some abandoned village buildings themselves. In 1980, the remaining ruins of the village were bulldozed to clear the ground for new Orthodox Jewish neighborhoods. In the early 1980s, most of the Deir Yassin cemetery was bulldozed and a new highway to Givat Shaul Bet was paved in its place.
In 1992, Palestinian historian Walid Khalidi wrote: Many of the village houses on the hill are still standing and have been incorporated into an Israeli hospital for the mentally ill that was established on the site. Some houses outside the fence of the hospital grounds are used for residential and commercial purposes, or as warehouses. Outside the fence, there are carob and almond trees and the stumps of olive trees. Several wells are located at the southwestern edge of the site. The old village cemetery, southeast of the site, is unkempt and threatened by debris from a ring road that has been constructed around the village hill. One tall cypress tree still stands at the center of the cemetery.
The killings at Deir Yassin are regarded as one of two pivotal events that led to the exodus of around 700,000 Palestinians from their towns and villages in 1948, along with the defeat of the Palestinians in Haifa. News of the killings, amplified by Arab media broadcasts of atrocity, triggered fear and panic among Palestinians, who in turn increasingly evacuated their homes.
Geography
Deir Yassin was built on the eastern slopes of a hill, with an elevation of roughly above sea level and commanding a wide view all around it. The village faced the western suburbs of Jerusalem which were away. The city center of Jerusalem was about to the east. It was separated from the city by a terraced valley planted with fig, almond, and olive orchards. Along the northern rim of the valley ran a secondary road linking Deir Yassin to the suburbs and to the main Jaffa Road which was about to the north.
The total land area of the village consisted of 2,857 dunams (286 hectares), of which 94.5% was Arab-owned, 5.3% was Jewish-owned and the remainder was public property. Cultivable land amounted to a total of 866 dunams (30%) (87 hectares), all of which was grown with grains and owned mostly by Arabs. The built-up area of the village was 12 dunams.
Demographics
Khirbet Ayn al-Tut had a population of 39 in 1596, during early Ottoman rule. In the 1922 British Mandate census, Deir Yassin had a population of 254. Its population had increased from 429 in the 1931 census to 750 in 1948 and its houses from 91 in the former year to 144 in the latter. Before its ravage in 1948, it is estimated that Deir Yassin had 610 Muslim inhabitants in the 1945 statistics. he five hamulas (clans) of Deir Yassin were the Shahada, 'Aql, Hamidad, Jabir and Jundi.
Gallery
References
Bibliography
External links
Welcome To Dayr Yasin
Dayr Yasin, Zochrot
Survey of Western Palestine, Map 17: IAA, Wikimedia commons
Dayr Yasin, by Rami Nashashibi (1996), Center for Research and Documentation of Palestinian Society.
District of Jerusalem
Deir Yassin
|
Maria A. Oquendo is an American psychiatrist. Oquendo is the chair of the Department of Psychiatry in the Perelman School of Medicine at the University of Pennsylvania. In 2016, she became the first Latina to be elected president of the American Psychiatric Association.
Early life and education
Oquendo graduated from Tufts University in 1980 and received her medical degree from the Columbia University Vagelos College of Physicians and Surgeons in 1984. She then completed her residency in Psychiatry at the Payne Whitney Psychiatric Clinic in the New York Hospital-Cornell Medical Center.
Career
Columbia University
Upon completing her formal education, Oquendo joined the faculty at Columbia University and co-established the Oquendo-Gould-Stanley-Posner classification system to identify sub-categories of suicidal behavior. In 2003, Oquendo and her colleagues were commissioned by the Food and Drug Administration to develop a classification system to examine suicide-related events in the data. Oquendo first proposed suicidal behavior should be its own diagnostic category in 2008 and successfully argued its addition to the DSM-5's appendix in 2013.
By 2007, Oquendo was appointed the director of research clinics at Columbia and vice chair for education and training. As a result of her research, Oquendo was awarded the Gerald Klerman Award from the Depression and Bipolar Support Alliance, Simon Bolivar Award, and the National Hispanic Medical Association Hispanic Health Leadership Award. In September 2014, Milton Wainberg and Oquendo launched a fellowship program to promote international training in mental health implementation research in Mozambique. During the same year, she was announced as president-elect of the American Psychiatric Association (APA), and subsequently became their first Latina president in 2016.
University of Pennsylvania
Oquendo left Columbia in 2017 to become the new chair of the Department of Psychiatry in the Perelman School of Medicine at the University of Pennsylvania. While serving in this role, she was elected a Member of the National Academy of Medicine. Oquendo was also awarded the 2018 Delores Shockley Minority Mentoring Award by the American College of Neuropsychopharmacology for "successfully mentoring young scientists from underrepresented groups in the field of neuropsychopharmacology and related disciplines."
References
External links
Living people
Tufts University alumni
Columbia University Vagelos College of Physicians and Surgeons alumni
Columbia University faculty
Perelman School of Medicine at the University of Pennsylvania faculty
Members of the National Academy of Medicine
American psychiatrists
Year of birth missing (living people)
|
```qmake
# this file and {QtAssistant, QAssistantClient} were copied from the
# Qt 4.6.3 source code, directory "include/QtAssistant". This file
# was modified so that the Q* headers are located in the same
# directory as this file.
SYNCQT.HEADER_FILES = ../../qassistantclient.h ../../qassistantclient_global.h QtAssistant
SYNCQT.HEADER_CLASSES = QAssistantClient
SYNCQT.PRIVATE_HEADER_FILES =
```
|
Gibe may refer to:
Gibe (woreda), a district in Southern Nations, Nationalities, and Peoples' Region, Ethiopia
Gibe River, located in southwestern Ethiopia
Gibe region, the drainage area south of this river
Bob Gibe (1928–2005), American Olympic swimmer
See also
Jibe, a sailing maneuver
Gybe (disambiguation)
|
```javascript
'use strict';
require('../common');
const assert = require('assert');
const path = require('path');
const { createRequire, createRequireFromPath } = require('module');
const p = path.resolve(__dirname, '..', 'fixtures', 'fake.js');
const u = new URL(`file://${p}`);
const req = createRequireFromPath(p);
assert.strictEqual(req('./baz'), 'perhaps I work');
const reqToo = createRequire(u);
assert.deepStrictEqual(reqToo('./experimental'), { ofLife: 42 });
assert.throws(() => {
createRequire('path_to_url
}, {
code: 'ERR_INVALID_ARG_VALUE'
});
assert.throws(() => {
createRequire('../');
}, {
code: 'ERR_INVALID_ARG_VALUE'
});
assert.throws(() => {
createRequire({});
}, {
code: 'ERR_INVALID_ARG_VALUE',
message: 'The argument \'filename\' must be a file URL object, file URL ' +
'string, or absolute path string. Received {}'
});
```
|
```xml
<!--
path_to_url
Unless required by applicable law or agreed to in writing, software
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-->
<vector xmlns:android="path_to_url"
android:width="24dp"
android:height="24dp"
android:tint="?attr/colorControlNormal"
android:viewportHeight="24.0"
android:viewportWidth="24.0">
<path
android:fillColor="@android:color/white"
android:pathData="M12,22l10,-10L12,2 8.67,5.33l6.65,6.65 -6.67,6.67zM5.3,15.32l3.35,-3.34 -3.31,-3.3L2,12.02z"/>
</vector>
```
|
Walter Pullar Cameron (13 November 1896 – 22 April 1957) was an Australian rules footballer who played with St Kilda in the VFL during the 1920s.
Camerson started his career with St Kilda in 1920 and won their Club Champion award in his debut season.
References
External links
1896 births
1957 deaths
Australian rules footballers from Victoria (state)
St Kilda Football Club players
Trevor Barker Award winners
Australian military personnel of World War I
|
Highgate Common is a Staffordshire Wildlife Trust reserve containing a mix of heathland and woodland. It is about 129 hectares or 320 acres in size. The common is a popular leisure destination and a Site of Special Scientific Interest, located in Southern Staffordshire, England.
Location
Highgate Common is situated to the west of the West Midlands conurbation, on a ridge above the Smestow valley. By road it is 1.2 miles from Swindon, 1.7 miles from Enville, 4.5 miles from Wombourne, 9 miles from Perton and 10 miles from Wolverhampton.
Management
Since April 2009 Highgate Common has been owned and managed by the Staffordshire Wildlife Trust.
The site was previously managed by South Staffordshire District Council.
A warden is present most days and their duties are aided by various support staff and volunteers.
Wildlife
Highgate Common contains one of a small number of lowland heaths in Staffordshire, which are highly prized as habitats. However, the heath is not the whole of the common and the vegetation is very varied for such a small area. The sandy heath is covered mainly with heather, broom and gorse, all flowering plants that play an important part in hosting invertebrates. There are areas of woodland, with silver birch and pedunculate oak as canopy and common bracken as ground cover, as well as coniferous plantation. There are roadside verges, areas of acidic grassland, patches of bare sand and earth, and small areas of wet heath, including two artificial ponds. The varied habitat results in a wide variety of animal life.
Highgate has 140 recorded species of fauna of which 36 are rare either nationally or regionally, 82 species of invertebrate 20 of which are regionally scarce and 51 are nationally scarce and 14 heathland specialist species. Nationally rare are at least four species of mining bees, creating burrows that are host to the kleptoparasitic cuckoo bees of the genera Nomada and Sphecodes. Also nationally rare are solitary wasps and wingless wasps and species that are regionally important include small red-tailed bumble bees and solitary bees.
Other animals, reptiles and insects include: common lizards, slowworms, grass snakes, rabbits, bush-crickets, moths, beetles, flies, and dragonflies.
Geology and landscape
The Common is located above the Smestow valley on the ridges of Mid-Severn Sandstone, a Bunter deposit of the Permian and Triassic periods, forming a series of low ridges on both sides of the Severn in Shropshire, Worcestershire and Staffordshire. Similar geology is prominently visible at nearby Kinver Edge and, further afield in the Midlands, at Cannock Chase and Sherwood Forest. Specifically, Highgate is mostly underlain by part of the Bridgnorth Sandstone Formation known as ‘Lower Mottled Soft Red Sandstone’. There are also small areas of Pleistocene sands and gravels.
The common is situated in a shallow valley on the plateau, like a dish sloping gently to the south. The land formation and vegetation together create a micro-climate warmer than expected for this part of England, with considerable impact on the local flora and fauna.
The thin, relatively dry, sandy soils were historically host to open woodland - predominantly birch, with some oak and beech. The early medieval] settlers clearly used the woods for pig-grazing, as is attested by important local Anglo-Saxon toponyms like Swindon and Kingswinford. After the Norman Conquest, the area became part of the vast Kinver Forest, which stretched as far north as the edge of Wolverhampton. In the later Middle Ages, and especially from the 16th century, the forest was denuded. The result was a sandy heathland - a landscape created by humans, but fragile and valuable to wildlife.
The ground is particularly hospitable to rabbits, which have excavated large warrens. It was turned over to agriculture during World War II and concrete roads and channels were put in. However, with careful management, including regular thinning and reduction of the rapidly encroaching trees, a diverse habitat has been recreated, consisting mainly of heathland - of which heather is the most dominant plant - and open woodland with occasional ponds and bogs, over hilly and often rough terrain.
Amenities
The Common is popular with walkers, especially dog walkers, and has a number of car parks. There are numerous footpaths, some way-marked and some affording wheelchair access, as well as bridle paths and several car parks. The long distance Staffordshire Way forms part of the footpath network on the Common, linking it to many other visitor attractions throughout Staffordshire and neighbouring counties. There are seats and picnic tables at many locations on the Common.
A new Warden's office was opened in February 2010, incorporating toilets, a conference room, information points, an additional car park and picnic facilities.
References
Sites of Special Scientific Interest in Staffordshire
|
```html
<div style="background-color: #f6f7f9;padding:24px 24px;border-bottom: 1px solid #eeeeec;font-size: 14px;">
{{^nameservers.length}}
<p>
We can't identify the nameservers which control {{customDomain}}. Do you own this domain? If not, please purchase it from a domain registrar.
</p>
{{/nameservers.length}}
{{#nameservers.length}}
<p style="margin: 0">
{{#revalidation}} Domain does not point to Blot.{{/revalidation}}
Please create this DNS record{{#dnsProvider}} on <a target="_blank" href="{{{URL}}}">{{name}}</a>{{/dnsProvider}}:
</p>
{{#dnsProvider.is.cloudflare}}
{{> record-guide-cloudflare}}
{{/dnsProvider.is.cloudflare}}
{{^dnsProvider.is.cloudflare}}
{{> record-guide-other}}
{{/dnsProvider.is.cloudflare}}
{{/nameservers.length}}
<br>
<button class="revalidate" type="submit">Revalidate domain
<span class="icon-refresh"></span>
</button>
<script>
document.querySelector('button.revalidate').addEventListener('click', function() {
this.classList.add('working');
});
</script>
<p style="display: block;font-size: 12px;color:var(--light-text-color);margin-top:12px;">Last checked {{lastChecked}}. Please <a href="/support">contact support</a> if needed, we will help you set this up.</p>
</div>
<style>
table.dns-records {
max-width: none; font-size: 14px; margin: 24px 0 0;
}
table.dns-records th {
font-size: 12px;
}
button.revalidate {
border:none;background:var(--background-color);border-radius: 5px;padding:9px 12px;color:var(--accent-color);font-weight: 600;font-size: 14px;cursor: pointer;
}
button.revalidate span {
margin-left: 4px;
}
button.revalidate.working {
background: var(--light-border-color);
color: var(--light-text-color);
cursor: not-allowed;
}
button.revalidate.working span {
animation: spin 1s infinite linear;
}
@keyframes spin {
0% { transform: rotate(0deg); }
100% { transform: rotate(360deg); }
}
</style>
```
|
Bedford County is a United States county located in the Piedmont region of the Commonwealth of Virginia. Its county seat is the town of Bedford, which was an independent city from 1968 until rejoining the county in 2013.
Bedford County was created in 1753 from parts of Lunenburg County, and several changes in alignment were made until the present borders were established in 1786. The county was named in honor of John Russell, an English statesman and fourth Duke of Bedford.
Bedford County is part of the Lynchburg Metropolitan Statistical Area. As of the 2020 census, Bedford's population was 79,462. The county population has more than doubled since 1980.
History
The Piedmont area had long been inhabited by indigenous peoples. At the time of European encounter, mostly Siouan-speaking tribes lived in this area.
Bedford County was established by European Americans on December 13, 1753, from parts of Lunenburg County. Later in 1756, a portion of Albemarle County lying south of the James River was added. The county is named for John Russell, the fourth Duke of Bedford, who was a Secretary of State of Great Britain. In 1782, Campbell County was formed from eastern Bedford County and the county seat was moved from New London to Liberty (now Bedford). Also in 1786, the portion of Bedford County south of the Staunton (Roanoke) River was taken with part of Henry County to form Franklin County.
The town of Bedford became an independent city in 1968, and remained the county seat. On September 14, 2011, the Bedford City Council voted to transition into a town and end its independent city status. The supervisors of Bedford County also voted to accept the town of Bedford as part of the county when it lost city status. The town of Bedford once more became part of Bedford County on July 1, 2013.
Geography
According to the U.S. Census Bureau, the county has a total area of , of which is land and (2.1%) is water.
Adjacent counties and city
Rockbridge County – north
Amherst County – northeast
Lynchburg, Virginia – east (independent city)
Campbell County – southeast
Pittsylvania County – south
Franklin County – southwest
Roanoke County – west
Botetourt County – northwest
National protected areas
Blue Ridge Parkway (part)
Jefferson National Forest (part)
James River Face Wilderness (part)
State Park
Smith Mountain Lake State Park
Major highways
Demographics
2020 census
Note: the US Census treats Hispanic/Latino as an ethnic category. This table excludes Latinos from the racial categories and assigns them to a separate category. Hispanics/Latinos can be of any race.
2000 Census
As of the census of 2000, there were 60,371 people, 23,838 households, and 18,164 families residing in the county. The population density was . There were 26,841 housing units at an average density of . The racial makeup of the county was 92.18% White, 6.24% Black or African American, 0.20% Native American, 0.43% Asian, 0.01% Pacific Islander, 0.20% from other races, and 0.74% from two or more races. 0.74% of the population were Hispanic or Latino of any race. 28.2% were of American, 15.6% English, 11.0% German and 9.6% Irish ancestry according to Census 2000.
There were 23,838 households, out of which 32.50% had children under the age of 18 living with them, 65.40% were married couples living together, 7.50% had a female householder with no husband present, and 23.80% were non-families. 20.20% of all households were made up of individuals, and 7.30% had someone living alone who was 65 years of age or older. The average household size was 2.52 and the average family size was 2.89.
In the county, the population's age distribution was: 24.00% under the age of 18, 5.80% from 18 to 24, 29.90% from 25 to 44, 27.50% from 45 to 64, and 12.80% who were 65 years of age or older. The median age was 40 years. For every 100 females there were 99.50 males. For every 100 females age 18 and over, there were 97.50 males.
The median income for a household in the county was $43,136, and the median income for a family was $49,303. Males had a median income of $35,117 versus $23,906 for females. The per capita income for the county was $21,582. About 5.20% of families and 7.10% of the population were below the poverty line, including 8.30% of those under age 18 and 10.50% of those age 65 or over.
2017
As of 2017, the largest self-reported ancestry groups were:
English - 16.5%
American - 14.3%
German - 13.3%
Irish - 11.3%
Italian - 3.0%
Scots-Irish - 2.7%
Scottish - 2.6%
Government
Board of Supervisors
District 1: Mickey M. Johnson (R)
District 2: Edgar Tuck, Chair (I)
District 3: Charla Bansley (R)
District 4: John Sharp, (R)
District 5: Tommy W. Scott (R)
District 6: Bob W. Davis (R)
District 7: Tamara F. "Tammy" Parker, Vice Chair (R)
Constitutional officers
Clerk of the Circuit Court: Judy Reynolds (R)
Commissioner of the Revenue: Tracy Patterson (R)
Commonwealth's Attorney: Wes Nance (R)
Sheriff: Michael Miller (R)
Treasurer: Kim Snow (R)
Bedford County is represented by Republicans David R. Suetterlein (19th District) and Stephen D. "Steve" Newman (23rd District) in the Virginia Senate; Republicans Terry L. Austin (19th District), Kathy J. Byron (22nd District) and Wendell S. Walker (23rd District) in the Virginia House of Delegates; and Republicans Bob Good (VA 5th District), Ben Cline (VA 6th District) in the U.S. House of Representatives, and Morgan Griffith (VA 9th District) in the U.S. House of Representatives.
Economy
Historically, Bedford County was an agricultural economy. While agriculture is still an important factor in the county's economy, Bedford County has significant residential development to serve Lynchburg, Roanoke, and Smith Mountain Lake. Tourism and retail are also becoming more significant with some new industry near Forest and New London.
Politics
Bedford voted for George Wallace, an Independent, for president in 1968.
Attractions
Beale ciphers, the key to a supposed treasure buried somewhere in the county and which has attracted treasure hunters since the 19th century
National D-Day Memorial
Peaks of Otter
Poplar Forest
Smith Mountain Lake
Bedford Museum & Genealogical Library
Communities
Town
Bedford
Census-designated places
Big Island
Forest
Moneta
Montvale
Stewartsville
Other unincorporated communities
Chamblissburg
Coleman Falls
Goode
Goodview
Hardy
Huddleston
New London
Thaxton
Some of these unincorporated areas have mailing addresses in Bedford town and Lynchburg.
Notable people
Nicholas H. Cobbs (1796-1861), former Episcopal prelate, served as the first Bishop of Alabama.
Colonel Chaffin (1826 – April 1873), little person who toured the United States and was billed as the "Virginia Dwarf".
Erik Estrada (born March 16, 1949), an American actor, voice actor, and subsequent Bedford County deputy sheriff, known for his co-starring lead role in the police drama television series, CHiPs, which ran from 1977 to 1983.
Carl Overstreet, (1929-2015) first U2 pilot to fly over Soviet Air Space
Thomas Jefferson had a summer retreat in Bedford County called "Poplar Forest".
James P. Ownby (1845–1906), Illinois state representative; was born in Bedford County.
Lacey Putney was born and raised in Bedford County, VA.
Jerry Falwell Jr, former Liberty University President, lives in Bedford County on a farm.
Sam Sloan, book publisher, lives in Bedford County and attended Boonsboro School Elementary School and High School in Bedford County
See also
National Register of Historic Places listings in Bedford County, Virginia
Bedford Public Library System
References
External links
Bedford Area Chamber of Commerce's website
Bedford County government's website
Virginia counties
1754 establishments in Virginia
Counties on the James River (Virginia)
Populated places established in 1754
|
```shell
Tracking shorthands
Fetching a remote branch
Setting the upstream branch
The golden rule of rebasing
Checkout the previous branch
```
|
```java
/*
*/
package docs.home.persistence;
import java.util.Optional;
// #post1
import com.lightbend.lagom.javadsl.persistence.PersistentEntity;
public class Post1 extends PersistentEntity<BlogCommand, BlogEvent, BlogState> {
@Override
public Behavior initialBehavior(Optional<BlogState> snapshotState) {
BehaviorBuilder b = newBehaviorBuilder(snapshotState.orElse(BlogState.EMPTY));
// TODO define command and event handlers
return b.build();
}
}
// #post1
```
|
In metallurgy, mineral jigs are a type of gravity concentrator, separating materials with different densities. It is widely used in recovering valuable heavy minerals such as gold, platinum, tin, tungsten, as well as gemstones such as diamond and sapphire, from alluvial or placer deposits. Base metals such as iron, manganese, and barite can also be recovered using jigs.
The process begins with flowing a stream of liquid-suspended material over a screen and subjecting the screen to a vertical hydraulic pulsation. This pulsation momentarily expands or dilates the screen bed and allows the heavier materials to work toward the bottom. Heavier material finer than the screen openings will gradually work through the beds and the retention screen into the hutch, or lower compartment. That material, the concentrate, is discharged from this compartment or hutch through a spigot. If the concentrate is coarser than the screen, it will work down to the top of the shot bed, and can be withdrawn either continuously or intermittently. The lighter material, or tailing, will be rejected over the end of the jig.
The mineral jig has certain advantages in placer and hardrock mill flowsheets. In gold recovery, the jigs produce highly concentrated products which can be easily upgraded by methods such as barrel amalgamation, treating across shaking tables or processing through centrifugal concentrators. In other placer operations the heavy minerals being sought are recovered efficiently and cheaply with similar high ratios of concentration. In iron, manganese, and base metal treatment flowsheets, the jigs are operated to produce marketable grades of concentrate, or, as pre-concentration devices, to reject barren gangue prior to the ore entering the fine grinding section of the mill flowsheet.
The construction of the mineral jig results in maximum utilization of floor area and minimum head room requirements, permitting greater capacity per unit of operating floor area than, for example, shaking tables or other devices such as jig concentrators.
See also
Jig concentrators
Mineral processing
References
Mining equipment
|
```cmake
# - Find LibEvent (a cross event library)
# This module defines
# LIBEVENT_INCLUDE_DIR, where to find LibEvent headers
# LIBEVENT_LIB, LibEvent libraries
# LibEvent_FOUND, If false, do not try to use libevent
set(LibEvent_EXTRA_PREFIXES /usr/local /opt/local "$ENV{HOME}")
foreach(prefix ${LibEvent_EXTRA_PREFIXES})
list(APPEND LibEvent_INCLUDE_PATHS "${prefix}/include")
list(APPEND LibEvent_LIB_PATHS "${prefix}/lib")
endforeach()
find_package(Libevent CONFIG QUIET)
if (TARGET event)
# Re-export the config under our own names
# Somewhat gross, but some vcpkg installed libevents have a relative
# `include` path exported into LIBEVENT_INCLUDE_DIRS, which triggers
# a cmake error because it resolves to the `include` dir within the
# folly repo, which is not something cmake allows to be in the
# INTERFACE_INCLUDE_DIRECTORIES. Thankfully on such a system the
# actual include directory is already part of the global include
# directories, so we can just skip it.
if (NOT "${LIBEVENT_INCLUDE_DIRS}" STREQUAL "include")
set(LIBEVENT_INCLUDE_DIR ${LIBEVENT_INCLUDE_DIRS})
else()
set(LIBEVENT_INCLUDE_DIR)
endif()
# Unfortunately, with a bare target name `event`, downstream consumers
# of the package that depends on `Libevent` located via CONFIG end
# up exporting just a bare `event` in their libraries. This is problematic
# because this in interpreted as just `-levent` with no library path.
# When libevent is not installed in the default installation prefix
# this results in linker errors.
# To resolve this, we ask cmake to lookup the full path to the library
# and use that instead.
cmake_policy(PUSH)
if(POLICY CMP0026)
# Allow reading the LOCATION property
cmake_policy(SET CMP0026 OLD)
endif()
get_target_property(LIBEVENT_LIB event LOCATION)
cmake_policy(POP)
set(LibEvent_FOUND ${Libevent_FOUND})
if (NOT LibEvent_FIND_QUIETLY)
message(STATUS "Found libevent from package config include=${LIBEVENT_INCLUDE_DIRS} lib=${LIBEVENT_LIB}")
endif()
else()
find_path(LIBEVENT_INCLUDE_DIR event.h PATHS ${LibEvent_INCLUDE_PATHS})
find_library(LIBEVENT_LIB NAMES event PATHS ${LibEvent_LIB_PATHS})
if (LIBEVENT_LIB AND LIBEVENT_INCLUDE_DIR)
set(LibEvent_FOUND TRUE)
set(LIBEVENT_LIB ${LIBEVENT_LIB})
else ()
set(LibEvent_FOUND FALSE)
endif ()
if (LibEvent_FOUND)
if (NOT LibEvent_FIND_QUIETLY)
message(STATUS "Found libevent: ${LIBEVENT_LIB}")
endif ()
else ()
if (LibEvent_FIND_REQUIRED)
message(FATAL_ERROR "Could NOT find libevent.")
endif ()
message(STATUS "libevent NOT found.")
endif ()
mark_as_advanced(
LIBEVENT_LIB
LIBEVENT_INCLUDE_DIR
)
endif()
```
|
The A.O. Kovalevsky Medal, awarded annually by the St. Petersburg Society of Naturalists for extraordinary achievements in evolutionary developmental biology and comparative zoology, is named after the noted Russian embryologist Alexander Kovalevsky. Since 2002, only one medal has been awarded annually (excepting a joint award in 2014).{Mikhailov and Gilbert, 2002}
Recipients
2021 Nipam Patel, University of Chicago and Director of the Marine Biological Laboratory (USA)
2020 Edward M. De Robertis, Department of Biological Chemistry, University of California at Los Angeles (USA)
2019 Mary E. Rice, Director of the Smithsonian Marine Station at Fort Pierce Florida, (USA)
2018 Andreas Hejnol, Professor of Molecular Biology, University of Bergen (Norway)
2017 Vladimir Malakhov, Department of Invertebrate Zoology, Lomonosov Moscow State University, Moscow (Russia)
2016 Günter Wagner, Department of Ecology and Evolutionary Biology, Yale University, New Haven CT (USA)
2015 Frederik Nijhout, Department of Biology, Duke University, Durham NC (USA)
2014 Linda Zimmerman Holland and Nicholas Drew Holland (jointly), Marine Biology Research Division, Scripps Institution of Oceanography, University of California at San Diego (USA).
2013 Denis Duboule, École polytechnique fédérale de Lausanne (EPFL), University of Geneva (Switzerland)
2012 William R. Jeffery, Professor of Biology, University of Maryland (USA)
2011 Detlev Arendt, European Molecular Biology Laboratory, Heidelberg (Germany).
2010 Shigeru Kuratani from the Center for Developmental Biology, Kobe (Japan)
2009 Mark Q. Martindale, Professor of Organismal Biology and Director of Kewalo Marine Laboratory, University of Hawaii (USA)
2008 Sean B. Carroll, Professor of Molecular Biology and Genetics, University of Wisconsin (USA)
2007 Michael Edwin Akam, Professor of Zoology and Director, University Museum of Zoology, Cambridge (United Kingdom)
2006 Peter Holland, Department of Zoology, Oxford (United Kingdom)
2005 Noriyuki Satoh, Department of Zoology, Faculty of Science, Kyoto University (Japan)
2004 Scott Gilbert, Howard A. Schneiderman Professor of Biology, Swarthmore College (USA)
2003 Walter Jakob Gehring, Professor, Biozentrum, University of Basel (Switzerland)
2002 Eric H. Davidson, Norman Chandler Professor of Cell Biology. California Institute of Technology, Pasadena (USA)
The 2001 medal was awarded to
Donald Thomas Anderson (Australia), comparative anatomy and embryology
Gary Freeman (USA), Professor of Zoology University of Texas Austin, embryological grounds of animal evolution
Brian Hall (Canada), Professor of Biology, Dalhousie University, Halifax, Canada; synthesis of embryology and evolution
Olga Mikhailovna Ivanova-Kazas, Professor of St. Petersburg State University (Russia)
Claus Nielsen (Denmark), development of comparative morphology and phylogeny of multi-celled organisms
Rudolf Raff (USA), James H. Rudy Professor of Biology, at Indiana University, and the author of several books on embryology and evolution
Rupert Riedl (Austria), Professor of Zoology at the Vienna University, Austria
Klaus Sander (Germany), Professor of Zoology at Freiburg University, Germany
References
Introduction to the Kowalevsky medal issue
Brian Keith Hall: Honored by UofC for transforming the study of biology
Denis Duboule is awarded the Alexander Kowalevsky medal | Section of Biology
Scripps Scientists to be Honored with Prestigious International Biology Award
Fred Nijhout wins Kowalevsky Medal! | BIOLOGY
See also
List of biology awards
Biology awards
Russian science and technology awards
Awards established in 2001
|
The 1990 Belgian motorcycle Grand Prix was the ninth round of the 1990 Grand Prix motorcycle racing season. It took place on the weekend of 5–7 July 1990 at Spa-Francorchamps.
References
Belgian motorcycle Grand Prix
Belgian
1990 in Belgian motorsport
|
```xml
<?xml version="1.0" encoding="utf-8"?>
<layer-list xmlns:android="path_to_url">
<item>
<shape android:shape="rectangle">
<solid android:color="@color/white" />
<corners
android:topLeftRadius="30dp"
android:topRightRadius="30dp" />
<size
android:width="16dp"
android:height="4dp" />
</shape>
</item>
</layer-list>
```
|
```xml
<!--
Description: rss item description
-->
<rss version="2.0">
<channel>
<item>
<description>Item Description</description>
</item>
</channel>
</rss>
```
|
Leucetta villosa is a species of calcareous sponge in the family Leucettidae, and was first described in 1999 by Gert Wörheide and John Hooper. The species epithet, villosa, comes from the Latin, villosus ("hairy"), and was given because of the "hair-like extensions on the sponge surface".
It is found in Queensland coastal waters, where occurs in waters with surface temperatures of 20 to 25 °C.
References
Taxa named by Gert Wörheide
Taxa named by John Hooper (marine biologist)
Clathrinida
Animals described in 1999
|
```objective-c
//===your_sha256_hash------===//
//
// See path_to_url for license information.
//
//===your_sha256_hash------===//
#ifndef _LIBCPP___ALGORITHM_NEXT_PERMUTATION_H
#define _LIBCPP___ALGORITHM_NEXT_PERMUTATION_H
#include <__algorithm/comp.h>
#include <__algorithm/comp_ref_type.h>
#include <__algorithm/iterator_operations.h>
#include <__algorithm/reverse.h>
#include <__config>
#include <__iterator/iterator_traits.h>
#include <__utility/move.h>
#include <__utility/pair.h>
#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
# pragma GCC system_header
#endif
_LIBCPP_BEGIN_NAMESPACE_STD
template <class _AlgPolicy, class _Compare, class _BidirectionalIterator, class _Sentinel>
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 pair<_BidirectionalIterator, bool>
__next_permutation(_BidirectionalIterator __first, _Sentinel __last, _Compare&& __comp)
{
using _Result = pair<_BidirectionalIterator, bool>;
_BidirectionalIterator __last_iter = _IterOps<_AlgPolicy>::next(__first, __last);
_BidirectionalIterator __i = __last_iter;
if (__first == __last || __first == --__i)
return _Result(std::move(__last_iter), false);
while (true)
{
_BidirectionalIterator __ip1 = __i;
if (__comp(*--__i, *__ip1))
{
_BidirectionalIterator __j = __last_iter;
while (!__comp(*__i, *--__j))
;
_IterOps<_AlgPolicy>::iter_swap(__i, __j);
std::__reverse<_AlgPolicy>(__ip1, __last_iter);
return _Result(std::move(__last_iter), true);
}
if (__i == __first)
{
std::__reverse<_AlgPolicy>(__first, __last_iter);
return _Result(std::move(__last_iter), false);
}
}
}
template <class _BidirectionalIterator, class _Compare>
inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
bool
next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp)
{
return std::__next_permutation<_ClassicAlgPolicy>(
std::move(__first), std::move(__last), static_cast<__comp_ref_type<_Compare> >(__comp)).second;
}
template <class _BidirectionalIterator>
inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_SINCE_CXX20
bool
next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last)
{
return _VSTD::next_permutation(__first, __last,
__less<typename iterator_traits<_BidirectionalIterator>::value_type>());
}
_LIBCPP_END_NAMESPACE_STD
#endif // _LIBCPP___ALGORITHM_NEXT_PERMUTATION_H
```
|
```objective-c
/*
* (C) 1999 Antti Koivisto (koivisto@kde.org)
* (C) 2001 Dirk Mueller (mueller@kde.org)
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
*
* along with this library; see the file COPYING.LIB. If not, write to
* the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*
*/
#ifndef DOMImplementation_h
#define DOMImplementation_h
#include "core/CoreExport.h"
#include "core/dom/Document.h"
#include "wtf/PassRefPtr.h"
namespace blink {
class Document;
class DocumentInit;
class DocumentType;
class ExceptionState;
class LocalFrame;
class HTMLDocument;
class KURL;
class XMLDocument;
class CORE_EXPORT DOMImplementation final : public NoBaseWillBeGarbageCollected<DOMImplementation>, public ScriptWrappable {
DEFINE_WRAPPERTYPEINFO();
WTF_MAKE_FAST_ALLOCATED_WILL_BE_REMOVED(DOMImplementation);
public:
static PassOwnPtrWillBeRawPtr<DOMImplementation> create(Document& document)
{
return adoptPtrWillBeNoop(new DOMImplementation(document));
}
#if !ENABLE(OILPAN)
void ref() { m_document->ref(); }
void deref() { m_document->deref(); }
#endif
Document& document() const { return *m_document; }
// DOM methods & attributes for DOMImplementation
bool hasFeature() { return true; }
PassRefPtrWillBeRawPtr<DocumentType> createDocumentType(const AtomicString& qualifiedName, const String& publicId, const String& systemId, ExceptionState&);
PassRefPtrWillBeRawPtr<XMLDocument> createDocument(const AtomicString& namespaceURI, const AtomicString& qualifiedName, DocumentType*, ExceptionState&);
// From the HTMLDOMImplementation interface
PassRefPtrWillBeRawPtr<HTMLDocument> createHTMLDocument(const String& title);
// Other methods (not part of DOM)
static PassRefPtrWillBeRawPtr<Document> createDocument(const String& mimeType, const DocumentInit&, bool inViewSourceMode);
static bool isXMLMIMEType(const String&);
static bool isTextMIMEType(const String&);
static bool isJSONMIMEType(const String&);
DECLARE_TRACE();
private:
explicit DOMImplementation(Document&);
RawPtrWillBeMember<Document> m_document;
};
} // namespace blink
#endif // DOMImplementation_h
```
|
The Common is the town common of Union, Maine. Laid out about 1790 and acquired by the town in 1809, it is the oldest public town common in the state of Maine. It is the site of the town's various war and veterans memorials, and also has a bandstand. It was listed on the National Register of Historic Places in 2007.
Description and history
The Common is located in the center of the main village of Union, a rural inland community of coastal Knox County. It is a roughly lozenge-shaped parcel, bounded on the north by Burkett Road and the south by Common Road. It is roughly bisected by Town House Road (Maine State Route 235), with the eastern section further subdivided by Abbott Road and another unnamed spur road. The westernmost portion is an open grassy area, shaded by three rows of maple trees, which are replacements of elm trees planted in the 19th century. Facing Town House Road is the granite American Civil War memorial, placed in 1888 by the local chapter of the Grand Army of the Republic. At the southeast corner of that section is a small cement watering trough, and a wooden 1940s map of the area.
The westernmost eastern section is mostly open, with maple trees around the fringe, and an octagonal Queen Anne style bandstand in the southern half, built in 1895. The central eastern section houses the town's World War II memorial, and a memorial to the town's peacetime veterans. The easternmost section is a small triangular stub of land, devoid of significant ornament.
The town of Union was settled in the 1770s and incorporated in 1786. The first mention that the town has a common is in town documents of 1790, although it is unclear if the present common is the property mentioned. The land that makes up the present common had apparently been laid out by 1801, and was purchased from David Gillmor in 1809 for $100, then a significant sum of money. The common is distinctive among Maine's town commons as the oldest known to have been acquired as a common, and for retaining its original configuration (including the extant road cuts through it) from a very early date.
See also
National Register of Historic Places listings in Knox County, Maine
References
Parks on the National Register of Historic Places in Maine
Queen Anne architecture in Maine
Buildings and structures completed in 1790
Buildings and structures in Knox County, Maine
National Register of Historic Places in Knox County, Maine
Historic districts on the National Register of Historic Places in Maine
|
```c
/* tc-avr.c -- Assembler code for the ATMEL AVR
Contributed by Denis Chertykov <denisc@overta.ru>
This file is part of GAS, the GNU Assembler.
GAS is free software; you can redistribute it and/or modify
the Free Software Foundation; either version 2, or (at your option)
any later version.
GAS is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
along with GAS; see the file COPYING. If not, write to
the Free Software Foundation, 59 Temple Place - Suite 330,
Boston, MA 02111-1307, USA. */
#include <stdio.h>
#include "as.h"
#include "safe-ctype.h"
#include "subsegs.h"
struct avr_opcodes_s
{
char *name;
char *constraints;
int insn_size; /* In words. */
int isa;
unsigned int bin_opcode;
};
#define AVR_INSN(NAME, CONSTR, OPCODE, SIZE, ISA, BIN) \
{#NAME, CONSTR, SIZE, ISA, BIN},
struct avr_opcodes_s avr_opcodes[] =
{
#include "opcode/avr.h"
{NULL, NULL, 0, 0, 0}
};
const char comment_chars[] = ";";
const char line_comment_chars[] = "#";
const char line_separator_chars[] = "$";
const char *md_shortopts = "m:";
struct mcu_type_s
{
char *name;
int isa;
int mach;
};
/* XXX - devices that don't seem to exist (renamed, replaced with larger
ones, or planned but never produced), left here for compatibility.
TODO: hide them in show_mcu_list output? */
static struct mcu_type_s mcu_types[] =
{
{"avr1", AVR_ISA_TINY1, bfd_mach_avr1},
{"avr2", AVR_ISA_2xxx, bfd_mach_avr2},
{"avr3", AVR_ISA_M103, bfd_mach_avr3},
{"avr4", AVR_ISA_M8, bfd_mach_avr4},
{"avr5", AVR_ISA_ALL, bfd_mach_avr5},
{"at90s1200", AVR_ISA_1200, bfd_mach_avr1},
{"attiny10", AVR_ISA_TINY1, bfd_mach_avr1}, /* XXX -> tn11 */
{"attiny11", AVR_ISA_TINY1, bfd_mach_avr1},
{"attiny12", AVR_ISA_TINY1, bfd_mach_avr1},
{"attiny15", AVR_ISA_TINY1, bfd_mach_avr1},
{"attiny28", AVR_ISA_TINY1, bfd_mach_avr1},
{"at90s2313", AVR_ISA_2xxx, bfd_mach_avr2},
{"at90s2323", AVR_ISA_2xxx, bfd_mach_avr2},
{"at90s2333", AVR_ISA_2xxx, bfd_mach_avr2}, /* XXX -> 4433 */
{"at90s2343", AVR_ISA_2xxx, bfd_mach_avr2},
{"attiny22", AVR_ISA_2xxx, bfd_mach_avr2}, /* XXX -> 2343 */
{"attiny26", AVR_ISA_2xxx, bfd_mach_avr2},
{"at90s4433", AVR_ISA_2xxx, bfd_mach_avr2},
{"at90s4414", AVR_ISA_2xxx, bfd_mach_avr2}, /* XXX -> 8515 */
{"at90s4434", AVR_ISA_2xxx, bfd_mach_avr2}, /* XXX -> 8535 */
{"at90s8515", AVR_ISA_2xxx, bfd_mach_avr2},
{"at90s8535", AVR_ISA_2xxx, bfd_mach_avr2},
{"at90c8534", AVR_ISA_2xxx, bfd_mach_avr2},
{"at86rf401", AVR_ISA_2xxx, bfd_mach_avr2},
{"atmega603", AVR_ISA_M603, bfd_mach_avr3}, /* XXX -> m103 */
{"atmega103", AVR_ISA_M103, bfd_mach_avr3},
{"at43usb320",AVR_ISA_M103, bfd_mach_avr3},
{"at43usb355",AVR_ISA_M603, bfd_mach_avr3},
{"at76c711", AVR_ISA_M603, bfd_mach_avr3},
{"atmega8", AVR_ISA_M8, bfd_mach_avr4},
{"atmega83", AVR_ISA_M8, bfd_mach_avr4}, /* XXX -> m8535 */
{"atmega85", AVR_ISA_M8, bfd_mach_avr4}, /* XXX -> m8 */
{"atmega8515",AVR_ISA_M8, bfd_mach_avr4},
{"atmega8535",AVR_ISA_M8, bfd_mach_avr4},
{"atmega16", AVR_ISA_M323, bfd_mach_avr5},
{"atmega161", AVR_ISA_M161, bfd_mach_avr5},
{"atmega162", AVR_ISA_M323, bfd_mach_avr5},
{"atmega163", AVR_ISA_M161, bfd_mach_avr5},
{"atmega169", AVR_ISA_M323, bfd_mach_avr5},
{"atmega32", AVR_ISA_M323, bfd_mach_avr5},
{"atmega323", AVR_ISA_M323, bfd_mach_avr5},
{"atmega64", AVR_ISA_M323, bfd_mach_avr5},
{"atmega128", AVR_ISA_M128, bfd_mach_avr5},
{"at94k", AVR_ISA_94K, bfd_mach_avr5},
{NULL, 0, 0}
};
/* Current MCU type. */
static struct mcu_type_s default_mcu = {"avr2", AVR_ISA_2xxx,bfd_mach_avr2};
static struct mcu_type_s *avr_mcu = &default_mcu;
/* AVR target-specific switches. */
struct avr_opt_s
{
int all_opcodes; /* -mall-opcodes: accept all known AVR opcodes */
int no_skip_bug; /* -mno-skip-bug: no warnings for skipping 2-word insns */
int no_wrap; /* -mno-wrap: reject rjmp/rcall with 8K wrap-around */
};
static struct avr_opt_s avr_opt = { 0, 0, 0 };
const char EXP_CHARS[] = "eE";
const char FLT_CHARS[] = "dD";
static void avr_set_arch (int dummy);
/* The target specific pseudo-ops which we support. */
const pseudo_typeS md_pseudo_table[] =
{
{"arch", avr_set_arch, 0},
{ NULL, NULL, 0}
};
#define LDI_IMMEDIATE(x) (((x) & 0xf) | (((x) << 4) & 0xf00))
static void show_mcu_list PARAMS ((FILE *));
static char *skip_space PARAMS ((char *));
static char *extract_word PARAMS ((char *, char *, int));
static unsigned int avr_operand PARAMS ((struct avr_opcodes_s *,
int, char *, char **));
static unsigned int avr_operands PARAMS ((struct avr_opcodes_s *, char **));
static unsigned int avr_get_constant PARAMS ((char *, int));
static char *parse_exp PARAMS ((char *, expressionS *));
static bfd_reloc_code_real_type avr_ldi_expression PARAMS ((expressionS *));
#define EXP_MOD_NAME(i) exp_mod[i].name
#define EXP_MOD_RELOC(i) exp_mod[i].reloc
#define EXP_MOD_NEG_RELOC(i) exp_mod[i].neg_reloc
#define HAVE_PM_P(i) exp_mod[i].have_pm
struct exp_mod_s
{
char *name;
bfd_reloc_code_real_type reloc;
bfd_reloc_code_real_type neg_reloc;
int have_pm;
};
static struct exp_mod_s exp_mod[] =
{
{"hh8", BFD_RELOC_AVR_HH8_LDI, BFD_RELOC_AVR_HH8_LDI_NEG, 1},
{"pm_hh8", BFD_RELOC_AVR_HH8_LDI_PM, BFD_RELOC_AVR_HH8_LDI_PM_NEG, 0},
{"hi8", BFD_RELOC_AVR_HI8_LDI, BFD_RELOC_AVR_HI8_LDI_NEG, 1},
{"pm_hi8", BFD_RELOC_AVR_HI8_LDI_PM, BFD_RELOC_AVR_HI8_LDI_PM_NEG, 0},
{"lo8", BFD_RELOC_AVR_LO8_LDI, BFD_RELOC_AVR_LO8_LDI_NEG, 1},
{"pm_lo8", BFD_RELOC_AVR_LO8_LDI_PM, BFD_RELOC_AVR_LO8_LDI_PM_NEG, 0},
{"hlo8", -BFD_RELOC_AVR_LO8_LDI, -BFD_RELOC_AVR_LO8_LDI_NEG, 0},
{"hhi8", -BFD_RELOC_AVR_HI8_LDI, -BFD_RELOC_AVR_HI8_LDI_NEG, 0},
};
/* Opcode hash table. */
static struct hash_control *avr_hash;
/* Reloc modifiers hash control (hh8,hi8,lo8,pm_xx). */
static struct hash_control *avr_mod_hash;
#define OPTION_MMCU 'm'
#define OPTION_ALL_OPCODES (OPTION_MD_BASE + 1)
#define OPTION_NO_SKIP_BUG (OPTION_MD_BASE + 2)
#define OPTION_NO_WRAP (OPTION_MD_BASE + 3)
struct option md_longopts[] =
{
{ "mmcu", required_argument, NULL, OPTION_MMCU },
{ "mall-opcodes", no_argument, NULL, OPTION_ALL_OPCODES },
{ "mno-skip-bug", no_argument, NULL, OPTION_NO_SKIP_BUG },
{ "mno-wrap", no_argument, NULL, OPTION_NO_WRAP },
{ NULL, no_argument, NULL, 0 }
};
size_t md_longopts_size = sizeof (md_longopts);
/* Display nicely formatted list of known MCU names. */
static void
show_mcu_list (stream)
FILE *stream;
{
int i, x;
fprintf (stream, _("Known MCU names:"));
x = 1000;
for (i = 0; mcu_types[i].name; i++)
{
int len = strlen (mcu_types[i].name);
x += len + 1;
if (x < 75)
fprintf (stream, " %s", mcu_types[i].name);
else
{
fprintf (stream, "\n %s", mcu_types[i].name);
x = len + 2;
}
}
fprintf (stream, "\n");
}
static inline char *
skip_space (s)
char *s;
{
while (*s == ' ' || *s == '\t')
++s;
return s;
}
/* Extract one word from FROM and copy it to TO. */
static char *
extract_word (char *from, char *to, int limit)
{
char *op_start;
char *op_end;
int size = 0;
/* Drop leading whitespace. */
from = skip_space (from);
*to = 0;
/* Find the op code end. */
for (op_start = op_end = from; *op_end != 0 && is_part_of_name (*op_end);)
{
to[size++] = *op_end++;
if (size + 1 >= limit)
break;
}
to[size] = 0;
return op_end;
}
int
md_estimate_size_before_relax (fragp, seg)
fragS *fragp ATTRIBUTE_UNUSED;
asection *seg ATTRIBUTE_UNUSED;
{
abort ();
return 0;
}
void
md_show_usage (stream)
FILE *stream;
{
fprintf (stream,
_("AVR options:\n"
" -mmcu=[avr-name] select microcontroller variant\n"
" [avr-name] can be:\n"
" avr1 - AT90S1200, ATtiny1x, ATtiny28\n"
" avr2 - AT90S2xxx, AT90S4xxx, AT90S8xxx, ATtiny22\n"
" avr3 - ATmega103, ATmega603\n"
" avr4 - ATmega83, ATmega85\n"
" avr5 - ATmega161, ATmega163, ATmega32, AT94K\n"
" or immediate microcontroller name.\n"));
fprintf (stream,
_(" -mall-opcodes accept all AVR opcodes, even if not supported by MCU\n"
" -mno-skip-bug disable warnings for skipping two-word instructions\n"
" (default for avr4, avr5)\n"
" -mno-wrap reject rjmp/rcall instructions with 8K wrap-around\n"
" (default for avr3, avr5)\n"));
show_mcu_list (stream);
}
static void
avr_set_arch (dummy)
int dummy ATTRIBUTE_UNUSED;
{
char *str;
str = (char *) alloca (20);
input_line_pointer = extract_word (input_line_pointer, str, 20);
md_parse_option (OPTION_MMCU, str);
bfd_set_arch_mach (stdoutput, TARGET_ARCH, avr_mcu->mach);
}
int
md_parse_option (c, arg)
int c;
char *arg;
{
switch (c)
{
case OPTION_MMCU:
{
int i;
char *s = alloca (strlen (arg) + 1);
{
char *t = s;
char *arg1 = arg;
do
*t = TOLOWER (*arg1++);
while (*t++);
}
for (i = 0; mcu_types[i].name; ++i)
if (strcmp (mcu_types[i].name, s) == 0)
break;
if (!mcu_types[i].name)
{
show_mcu_list (stderr);
as_fatal (_("unknown MCU: %s\n"), arg);
}
/* It is OK to redefine mcu type within the same avr[1-5] bfd machine
type - this for allows passing -mmcu=... via gcc ASM_SPEC as well
as .arch ... in the asm output at the same time. */
if (avr_mcu == &default_mcu || avr_mcu->mach == mcu_types[i].mach)
avr_mcu = &mcu_types[i];
else
as_fatal (_("redefinition of mcu type `%s' to `%s'"),
avr_mcu->name, mcu_types[i].name);
return 1;
}
case OPTION_ALL_OPCODES:
avr_opt.all_opcodes = 1;
return 1;
case OPTION_NO_SKIP_BUG:
avr_opt.no_skip_bug = 1;
return 1;
case OPTION_NO_WRAP:
avr_opt.no_wrap = 1;
return 1;
}
return 0;
}
symbolS *
md_undefined_symbol (name)
char *name ATTRIBUTE_UNUSED;
{
return 0;
}
/* Turn a string in input_line_pointer into a floating point constant
of type TYPE, and store the appropriate bytes in *LITP. The number
of LITTLENUMS emitted is stored in *SIZEP. An error message is
returned, or NULL on OK. */
char *
md_atof (type, litP, sizeP)
int type;
char *litP;
int *sizeP;
{
int prec;
LITTLENUM_TYPE words[4];
LITTLENUM_TYPE *wordP;
char *t;
switch (type)
{
case 'f':
prec = 2;
break;
case 'd':
prec = 4;
break;
default:
*sizeP = 0;
return _("bad call to md_atof");
}
t = atof_ieee (input_line_pointer, type, words);
if (t)
input_line_pointer = t;
*sizeP = prec * sizeof (LITTLENUM_TYPE);
/* This loop outputs the LITTLENUMs in REVERSE order. */
for (wordP = words + prec - 1; prec--;)
{
md_number_to_chars (litP, (valueT) (*wordP--), sizeof (LITTLENUM_TYPE));
litP += sizeof (LITTLENUM_TYPE);
}
return NULL;
}
void
md_convert_frag (abfd, sec, fragP)
bfd *abfd ATTRIBUTE_UNUSED;
asection *sec ATTRIBUTE_UNUSED;
fragS *fragP ATTRIBUTE_UNUSED;
{
abort ();
}
void
md_begin ()
{
unsigned int i;
struct avr_opcodes_s *opcode;
avr_hash = hash_new ();
/* Insert unique names into hash table. This hash table then provides a
quick index to the first opcode with a particular name in the opcode
table. */
for (opcode = avr_opcodes; opcode->name; opcode++)
hash_insert (avr_hash, opcode->name, (char *) opcode);
avr_mod_hash = hash_new ();
for (i = 0; i < sizeof (exp_mod) / sizeof (exp_mod[0]); ++i)
hash_insert (avr_mod_hash, EXP_MOD_NAME (i), (void *) (i + 10));
bfd_set_arch_mach (stdoutput, TARGET_ARCH, avr_mcu->mach);
}
/* Resolve STR as a constant expression and return the result.
If result greater than MAX then error. */
static unsigned int
avr_get_constant (str, max)
char *str;
int max;
{
expressionS ex;
str = skip_space (str);
input_line_pointer = str;
expression (&ex);
if (ex.X_op != O_constant)
as_bad (_("constant value required"));
if (ex.X_add_number > max || ex.X_add_number < 0)
as_bad (_("number must be less than %d"), max + 1);
return ex.X_add_number;
}
/* Parse instruction operands.
Return binary opcode. */
static unsigned int
avr_operands (opcode, line)
struct avr_opcodes_s *opcode;
char **line;
{
char *op = opcode->constraints;
unsigned int bin = opcode->bin_opcode;
char *frag = frag_more (opcode->insn_size * 2);
char *str = *line;
int where = frag - frag_now->fr_literal;
static unsigned int prev = 0; /* Previous opcode. */
/* Opcode have operands. */
if (*op)
{
unsigned int reg1 = 0;
unsigned int reg2 = 0;
int reg1_present = 0;
int reg2_present = 0;
/* Parse first operand. */
if (REGISTER_P (*op))
reg1_present = 1;
reg1 = avr_operand (opcode, where, op, &str);
++op;
/* Parse second operand. */
if (*op)
{
if (*op == ',')
++op;
if (*op == '=')
{
reg2 = reg1;
reg2_present = 1;
}
else
{
if (REGISTER_P (*op))
reg2_present = 1;
str = skip_space (str);
if (*str++ != ',')
as_bad (_("`,' required"));
str = skip_space (str);
reg2 = avr_operand (opcode, where, op, &str);
}
if (reg1_present && reg2_present)
reg2 = (reg2 & 0xf) | ((reg2 << 5) & 0x200);
else if (reg2_present)
reg2 <<= 4;
}
if (reg1_present)
reg1 <<= 4;
bin |= reg1 | reg2;
}
/* Detect undefined combinations (like ld r31,Z+). */
if (!avr_opt.all_opcodes && AVR_UNDEF_P (bin))
as_warn (_("undefined combination of operands"));
if (opcode->insn_size == 2)
{
/* Warn if the previous opcode was cpse/sbic/sbis/sbrc/sbrs
(AVR core bug, fixed in the newer devices). */
if (!(avr_opt.no_skip_bug || (avr_mcu->isa & AVR_ISA_MUL))
&& AVR_SKIP_P (prev))
as_warn (_("skipping two-word instruction"));
bfd_putl32 ((bfd_vma) bin, frag);
}
else
bfd_putl16 ((bfd_vma) bin, frag);
prev = bin;
*line = str;
return bin;
}
/* Parse one instruction operand.
Return operand bitmask. Also fixups can be generated. */
static unsigned int
avr_operand (opcode, where, op, line)
struct avr_opcodes_s *opcode;
int where;
char *op;
char **line;
{
expressionS op_expr;
unsigned int op_mask = 0;
char *str = skip_space (*line);
switch (*op)
{
/* Any register operand. */
case 'w':
case 'd':
case 'r':
case 'a':
case 'v':
if (*str == 'r' || *str == 'R')
{
char r_name[20];
str = extract_word (str, r_name, sizeof (r_name));
op_mask = 0xff;
if (ISDIGIT (r_name[1]))
{
if (r_name[2] == '\0')
op_mask = r_name[1] - '0';
else if (r_name[1] != '0'
&& ISDIGIT (r_name[2])
&& r_name[3] == '\0')
op_mask = (r_name[1] - '0') * 10 + r_name[2] - '0';
}
}
else
{
op_mask = avr_get_constant (str, 31);
str = input_line_pointer;
}
if (op_mask <= 31)
{
switch (*op)
{
case 'a':
if (op_mask < 16 || op_mask > 23)
as_bad (_("register r16-r23 required"));
op_mask -= 16;
break;
case 'd':
if (op_mask < 16)
as_bad (_("register number above 15 required"));
op_mask -= 16;
break;
case 'v':
if (op_mask & 1)
as_bad (_("even register number required"));
op_mask >>= 1;
break;
case 'w':
if ((op_mask & 1) || op_mask < 24)
as_bad (_("register r24, r26, r28 or r30 required"));
op_mask = (op_mask - 24) >> 1;
break;
}
break;
}
as_bad (_("register name or number from 0 to 31 required"));
break;
case 'e':
{
char c;
if (*str == '-')
{
str = skip_space (str + 1);
op_mask = 0x1002;
}
c = TOLOWER (*str);
if (c == 'x')
op_mask |= 0x100c;
else if (c == 'y')
op_mask |= 0x8;
else if (c != 'z')
as_bad (_("pointer register (X, Y or Z) required"));
str = skip_space (str + 1);
if (*str == '+')
{
++str;
if (op_mask & 2)
as_bad (_("cannot both predecrement and postincrement"));
op_mask |= 0x1001;
}
/* avr1 can do "ld r,Z" and "st Z,r" but no other pointer
registers, no predecrement, no postincrement. */
if (!avr_opt.all_opcodes && (op_mask & 0x100F)
&& !(avr_mcu->isa & AVR_ISA_SRAM))
as_bad (_("addressing mode not supported"));
}
break;
case 'z':
if (*str == '-')
as_bad (_("can't predecrement"));
if (! (*str == 'z' || *str == 'Z'))
as_bad (_("pointer register Z required"));
str = skip_space (str + 1);
if (*str == '+')
{
++str;
op_mask |= 1;
}
break;
case 'b':
{
char c = TOLOWER (*str++);
if (c == 'y')
op_mask |= 0x8;
else if (c != 'z')
as_bad (_("pointer register (Y or Z) required"));
str = skip_space (str);
if (*str++ == '+')
{
unsigned int x;
x = avr_get_constant (str, 63);
str = input_line_pointer;
op_mask |= (x & 7) | ((x & (3 << 3)) << 7) | ((x & (1 << 5)) << 8);
}
}
break;
case 'h':
str = parse_exp (str, &op_expr);
fix_new_exp (frag_now, where, opcode->insn_size * 2,
&op_expr, FALSE, BFD_RELOC_AVR_CALL);
break;
case 'L':
str = parse_exp (str, &op_expr);
fix_new_exp (frag_now, where, opcode->insn_size * 2,
&op_expr, TRUE, BFD_RELOC_AVR_13_PCREL);
break;
case 'l':
str = parse_exp (str, &op_expr);
fix_new_exp (frag_now, where, opcode->insn_size * 2,
&op_expr, TRUE, BFD_RELOC_AVR_7_PCREL);
break;
case 'i':
str = parse_exp (str, &op_expr);
fix_new_exp (frag_now, where + 2, opcode->insn_size * 2,
&op_expr, FALSE, BFD_RELOC_16);
break;
case 'M':
{
bfd_reloc_code_real_type r_type;
input_line_pointer = str;
r_type = avr_ldi_expression (&op_expr);
str = input_line_pointer;
fix_new_exp (frag_now, where, 3,
&op_expr, FALSE, r_type);
}
break;
case 'n':
{
unsigned int x;
x = ~avr_get_constant (str, 255);
str = input_line_pointer;
op_mask |= (x & 0xf) | ((x << 4) & 0xf00);
}
break;
case 'K':
{
unsigned int x;
x = avr_get_constant (str, 63);
str = input_line_pointer;
op_mask |= (x & 0xf) | ((x & 0x30) << 2);
}
break;
case 'S':
case 's':
{
unsigned int x;
x = avr_get_constant (str, 7);
str = input_line_pointer;
if (*op == 'S')
x <<= 4;
op_mask |= x;
}
break;
case 'P':
{
unsigned int x;
x = avr_get_constant (str, 63);
str = input_line_pointer;
op_mask |= (x & 0xf) | ((x & 0x30) << 5);
}
break;
case 'p':
{
unsigned int x;
x = avr_get_constant (str, 31);
str = input_line_pointer;
op_mask |= x << 3;
}
break;
case '?':
break;
default:
as_bad (_("unknown constraint `%c'"), *op);
}
*line = str;
return op_mask;
}
/* GAS will call this function for each section at the end of the assembly,
to permit the CPU backend to adjust the alignment of a section. */
valueT
md_section_align (seg, addr)
asection *seg;
valueT addr;
{
int align = bfd_get_section_alignment (stdoutput, seg);
return ((addr + (1 << align) - 1) & (-1 << align));
}
/* If you define this macro, it should return the offset between the
address of a PC relative fixup and the position from which the PC
relative adjustment should be made. On many processors, the base
of a PC relative instruction is the next instruction, so this
macro would return the length of an instruction. */
long
md_pcrel_from_section (fixp, sec)
fixS *fixp;
segT sec;
{
if (fixp->fx_addsy != (symbolS *) NULL
&& (!S_IS_DEFINED (fixp->fx_addsy)
|| (S_GET_SEGMENT (fixp->fx_addsy) != sec)))
return 0;
return fixp->fx_frag->fr_address + fixp->fx_where;
}
/* GAS will call this for each fixup. It should store the correct
value in the object file. */
void
md_apply_fix3 (fixP, valP, seg)
fixS *fixP;
valueT * valP;
segT seg;
{
unsigned char *where;
unsigned long insn;
long value = *valP;
if (fixP->fx_addsy == (symbolS *) NULL)
fixP->fx_done = 1;
else if (fixP->fx_pcrel)
{
segT s = S_GET_SEGMENT (fixP->fx_addsy);
if (s == seg || s == absolute_section)
{
value += S_GET_VALUE (fixP->fx_addsy);
fixP->fx_done = 1;
}
}
/* We don't actually support subtracting a symbol. */
if (fixP->fx_subsy != (symbolS *) NULL)
as_bad_where (fixP->fx_file, fixP->fx_line, _("expression too complex"));
switch (fixP->fx_r_type)
{
default:
fixP->fx_no_overflow = 1;
break;
case BFD_RELOC_AVR_7_PCREL:
case BFD_RELOC_AVR_13_PCREL:
case BFD_RELOC_32:
case BFD_RELOC_16:
case BFD_RELOC_AVR_CALL:
break;
}
if (fixP->fx_done)
{
/* Fetch the instruction, insert the fully resolved operand
value, and stuff the instruction back again. */
where = fixP->fx_frag->fr_literal + fixP->fx_where;
insn = bfd_getl16 (where);
switch (fixP->fx_r_type)
{
case BFD_RELOC_AVR_7_PCREL:
if (value & 1)
as_bad_where (fixP->fx_file, fixP->fx_line,
_("odd address operand: %ld"), value);
/* Instruction addresses are always right-shifted by 1. */
value >>= 1;
--value; /* Correct PC. */
if (value < -64 || value > 63)
as_bad_where (fixP->fx_file, fixP->fx_line,
_("operand out of range: %ld"), value);
value = (value << 3) & 0x3f8;
bfd_putl16 ((bfd_vma) (value | insn), where);
break;
case BFD_RELOC_AVR_13_PCREL:
if (value & 1)
as_bad_where (fixP->fx_file, fixP->fx_line,
_("odd address operand: %ld"), value);
/* Instruction addresses are always right-shifted by 1. */
value >>= 1;
--value; /* Correct PC. */
if (value < -2048 || value > 2047)
{
/* No wrap for devices with >8K of program memory. */
if ((avr_mcu->isa & AVR_ISA_MEGA) || avr_opt.no_wrap)
as_bad_where (fixP->fx_file, fixP->fx_line,
_("operand out of range: %ld"), value);
}
value &= 0xfff;
bfd_putl16 ((bfd_vma) (value | insn), where);
break;
case BFD_RELOC_32:
bfd_putl16 ((bfd_vma) value, where);
break;
case BFD_RELOC_16:
bfd_putl16 ((bfd_vma) value, where);
break;
case BFD_RELOC_AVR_16_PM:
bfd_putl16 ((bfd_vma) (value >> 1), where);
break;
case BFD_RELOC_AVR_LO8_LDI:
bfd_putl16 ((bfd_vma) insn | LDI_IMMEDIATE (value), where);
break;
case -BFD_RELOC_AVR_LO8_LDI:
bfd_putl16 ((bfd_vma) insn | LDI_IMMEDIATE (value >> 16), where);
break;
case BFD_RELOC_AVR_HI8_LDI:
bfd_putl16 ((bfd_vma) insn | LDI_IMMEDIATE (value >> 8), where);
break;
case -BFD_RELOC_AVR_HI8_LDI:
bfd_putl16 ((bfd_vma) insn | LDI_IMMEDIATE (value >> 24), where);
break;
case BFD_RELOC_AVR_HH8_LDI:
bfd_putl16 ((bfd_vma) insn | LDI_IMMEDIATE (value >> 16), where);
break;
case BFD_RELOC_AVR_LO8_LDI_NEG:
bfd_putl16 ((bfd_vma) insn | LDI_IMMEDIATE (-value), where);
break;
case -BFD_RELOC_AVR_LO8_LDI_NEG:
bfd_putl16 ((bfd_vma) insn | LDI_IMMEDIATE (-value >> 16), where);
break;
case BFD_RELOC_AVR_HI8_LDI_NEG:
bfd_putl16 ((bfd_vma) insn | LDI_IMMEDIATE (-value >> 8), where);
break;
case -BFD_RELOC_AVR_HI8_LDI_NEG:
bfd_putl16 ((bfd_vma) insn | LDI_IMMEDIATE (-value >> 24), where);
break;
case BFD_RELOC_AVR_HH8_LDI_NEG:
bfd_putl16 ((bfd_vma) insn | LDI_IMMEDIATE (-value >> 16), where);
break;
case BFD_RELOC_AVR_LO8_LDI_PM:
bfd_putl16 ((bfd_vma) insn | LDI_IMMEDIATE (value >> 1), where);
break;
case BFD_RELOC_AVR_HI8_LDI_PM:
bfd_putl16 ((bfd_vma) insn | LDI_IMMEDIATE (value >> 9), where);
break;
case BFD_RELOC_AVR_HH8_LDI_PM:
bfd_putl16 ((bfd_vma) insn | LDI_IMMEDIATE (value >> 17), where);
break;
case BFD_RELOC_AVR_LO8_LDI_PM_NEG:
bfd_putl16 ((bfd_vma) insn | LDI_IMMEDIATE (-value >> 1), where);
break;
case BFD_RELOC_AVR_HI8_LDI_PM_NEG:
bfd_putl16 ((bfd_vma) insn | LDI_IMMEDIATE (-value >> 9), where);
break;
case BFD_RELOC_AVR_HH8_LDI_PM_NEG:
bfd_putl16 ((bfd_vma) insn | LDI_IMMEDIATE (-value >> 17), where);
break;
case BFD_RELOC_AVR_CALL:
{
unsigned long x;
x = bfd_getl16 (where);
if (value & 1)
as_bad_where (fixP->fx_file, fixP->fx_line,
_("odd address operand: %ld"), value);
value >>= 1;
x |= ((value & 0x10000) | ((value << 3) & 0x1f00000)) >> 16;
bfd_putl16 ((bfd_vma) x, where);
bfd_putl16 ((bfd_vma) (value & 0xffff), where + 2);
}
break;
default:
as_fatal (_("line %d: unknown relocation type: 0x%x"),
fixP->fx_line, fixP->fx_r_type);
break;
}
}
else
{
switch (fixP->fx_r_type)
{
case -BFD_RELOC_AVR_HI8_LDI_NEG:
case -BFD_RELOC_AVR_HI8_LDI:
case -BFD_RELOC_AVR_LO8_LDI_NEG:
case -BFD_RELOC_AVR_LO8_LDI:
as_bad_where (fixP->fx_file, fixP->fx_line,
_("only constant expression allowed"));
fixP->fx_done = 1;
break;
default:
break;
}
}
}
/* A `BFD_ASSEMBLER' GAS will call this to generate a reloc. GAS
will pass the resulting reloc to `bfd_install_relocation'. This
currently works poorly, as `bfd_install_relocation' often does the
wrong thing, and instances of `tc_gen_reloc' have been written to
work around the problems, which in turns makes it difficult to fix
`bfd_install_relocation'. */
/* If while processing a fixup, a reloc really needs to be created
then it is done here. */
arelent *
tc_gen_reloc (seg, fixp)
asection *seg ATTRIBUTE_UNUSED;
fixS *fixp;
{
arelent *reloc;
reloc = (arelent *) xmalloc (sizeof (arelent));
reloc->sym_ptr_ptr = (asymbol **) xmalloc (sizeof (asymbol *));
*reloc->sym_ptr_ptr = symbol_get_bfdsym (fixp->fx_addsy);
reloc->address = fixp->fx_frag->fr_address + fixp->fx_where;
reloc->howto = bfd_reloc_type_lookup (stdoutput, fixp->fx_r_type);
if (reloc->howto == (reloc_howto_type *) NULL)
{
as_bad_where (fixp->fx_file, fixp->fx_line,
_("reloc %d not supported by object file format"),
(int) fixp->fx_r_type);
return NULL;
}
if (fixp->fx_r_type == BFD_RELOC_VTABLE_INHERIT
|| fixp->fx_r_type == BFD_RELOC_VTABLE_ENTRY)
reloc->address = fixp->fx_offset;
reloc->addend = fixp->fx_offset;
return reloc;
}
void
md_assemble (str)
char *str;
{
struct avr_opcodes_s *opcode;
char op[11];
str = skip_space (extract_word (str, op, sizeof (op)));
if (!op[0])
as_bad (_("can't find opcode "));
opcode = (struct avr_opcodes_s *) hash_find (avr_hash, op);
if (opcode == NULL)
{
as_bad (_("unknown opcode `%s'"), op);
return;
}
/* Special case for opcodes with optional operands (lpm, elpm) -
version with operands exists in avr_opcodes[] in the next entry. */
if (*str && *opcode->constraints == '?')
++opcode;
if (!avr_opt.all_opcodes && (opcode->isa & avr_mcu->isa) != opcode->isa)
as_bad (_("illegal opcode %s for mcu %s"), opcode->name, avr_mcu->name);
/* We used to set input_line_pointer to the result of get_operands,
but that is wrong. Our caller assumes we don't change it. */
{
char *t = input_line_pointer;
avr_operands (opcode, &str);
if (*skip_space (str))
as_bad (_("garbage at end of line"));
input_line_pointer = t;
}
}
/* Parse ordinary expression. */
static char *
parse_exp (s, op)
char *s;
expressionS *op;
{
input_line_pointer = s;
expression (op);
if (op->X_op == O_absent)
as_bad (_("missing operand"));
return input_line_pointer;
}
/* Parse special expressions (needed for LDI command):
xx8 (address)
xx8 (-address)
pm_xx8 (address)
pm_xx8 (-address)
where xx is: hh, hi, lo. */
static bfd_reloc_code_real_type
avr_ldi_expression (exp)
expressionS *exp;
{
char *str = input_line_pointer;
char *tmp;
char op[8];
int mod;
tmp = str;
str = extract_word (str, op, sizeof (op));
if (op[0])
{
mod = (int) hash_find (avr_mod_hash, op);
if (mod)
{
int closes = 0;
mod -= 10;
str = skip_space (str);
if (*str == '(')
{
int neg_p = 0;
++str;
if (strncmp ("pm(", str, 3) == 0
|| strncmp ("-(pm(", str, 5) == 0)
{
if (HAVE_PM_P (mod))
{
++mod;
++closes;
}
else
as_bad (_("illegal expression"));
if (*str == '-')
{
neg_p = 1;
++closes;
str += 5;
}
else
str += 3;
}
if (*str == '-' && *(str + 1) == '(')
{
neg_p ^= 1;
++closes;
str += 2;
}
input_line_pointer = str;
expression (exp);
do
{
if (*input_line_pointer != ')')
{
as_bad (_("`)' required"));
break;
}
input_line_pointer++;
}
while (closes--);
return neg_p ? EXP_MOD_NEG_RELOC (mod) : EXP_MOD_RELOC (mod);
}
}
}
input_line_pointer = tmp;
expression (exp);
/* Warn about expressions that fail to use lo8 (). */
if (exp->X_op == O_constant)
{
int x = exp->X_add_number;
if (x < -255 || x > 255)
as_warn (_("constant out of 8-bit range: %d"), x);
}
else
as_warn (_("expression possibly out of 8-bit range"));
return BFD_RELOC_AVR_LO8_LDI;
}
/* Flag to pass `pm' mode between `avr_parse_cons_expression' and
`avr_cons_fix_new'. */
static int exp_mod_pm = 0;
/* Parse special CONS expression: pm (expression)
which is used for addressing to a program memory.
Relocation: BFD_RELOC_AVR_16_PM. */
void
avr_parse_cons_expression (exp, nbytes)
expressionS *exp;
int nbytes;
{
char *tmp;
exp_mod_pm = 0;
tmp = input_line_pointer = skip_space (input_line_pointer);
if (nbytes == 2)
{
char *pm_name = "pm";
int len = strlen (pm_name);
if (strncasecmp (input_line_pointer, pm_name, len) == 0)
{
input_line_pointer = skip_space (input_line_pointer + len);
if (*input_line_pointer == '(')
{
input_line_pointer = skip_space (input_line_pointer + 1);
exp_mod_pm = 1;
expression (exp);
if (*input_line_pointer == ')')
++input_line_pointer;
else
{
as_bad (_("`)' required"));
exp_mod_pm = 0;
}
return;
}
input_line_pointer = tmp;
}
}
expression (exp);
}
void
avr_cons_fix_new (frag, where, nbytes, exp)
fragS *frag;
int where;
int nbytes;
expressionS *exp;
{
if (exp_mod_pm == 0)
{
if (nbytes == 2)
fix_new_exp (frag, where, nbytes, exp, FALSE, BFD_RELOC_16);
else if (nbytes == 4)
fix_new_exp (frag, where, nbytes, exp, FALSE, BFD_RELOC_32);
else
as_bad (_("illegal %srelocation size: %d"), "", nbytes);
}
else
{
if (nbytes == 2)
fix_new_exp (frag, where, nbytes, exp, FALSE, BFD_RELOC_AVR_16_PM);
else
as_bad (_("illegal %srelocation size: %d"), "`pm' ", nbytes);
exp_mod_pm = 0;
}
}
```
|
```java
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package com.haulmont.cuba.web.widgets.client.suggestionfield;
import com.vaadin.shared.AbstractFieldState;
import java.util.List;
public class CubaSuggestionFieldState extends AbstractFieldState {
{
primaryStyleName = "c-suggestionfield";
}
public int minSearchStringLength = 0;
public int asyncSearchDelayMs = 300;
public String text = "";
public String inputPrompt = "";
public List<String> popupStylename = null;
public String popupWidth = "auto";
public boolean selectFirstSuggestionOnShow = true;
}
```
|
A Lawman Is Born is a 1937 American Western film directed by Sam Newfield.
Plot summary
Tom Mitchell is a wanted man that becomes the Sheriff after the previous Sheriff is killed, however Brownlee arrives and reveals Tom's identity.
Cast
Johnny Mack Brown as Tom Mitchell
Iris Meredith as Beth Graham
Warner Richmond as Kane Briscoe
Mary MacLaren as Martha Lance
Dick Curtis as Lefty Drogan
Earle Hodgins as Sheriff Rock Lance
Charles King as Bert Moscript
Frank LaRue as Graham
Al St. John as Eli Root
Steve Clark as Sam Brownlee
Jack C. Smith as Ike Manton
External links
1937 films
1937 Western (genre) films
American black-and-white films
Republic Pictures films
American Western (genre) films
Films with screenplays by George H. Plympton
Films directed by Sam Newfield
1930s English-language films
1930s American films
English-language Western (genre) films
|
Katy Lied is the fourth studio album by American rock band Steely Dan, released by ABC Records in March 1975; reissues have been released by MCA Records since ABC Records was acquired by MCA in 1979. It was the first album the group made after they stopped touring, as well as their first to feature backing vocals by Michael McDonald.
In the United States, the album peaked at number 13 on the Billboard Top LPs & Tape chart, and it has been certified Gold by the Recording Industry Association of America (RIAA). The single "Black Friday" charted at number 37 on the Billboard Hot 100.
Recording
The album was the first one recorded by Steely Dan after guitarist Jeff "Skunk" Baxter and drummer Jim Hodder left the group as a result of Walter Becker and Donald Fagen's decision to stop touring and focus solely on recording with various studio musicians. Guitarist Denny Dias, a founding member of Steely Dan, contributed to the album as a session musician, as did vocalist Michael McDonald and drummer Jeff Porcaro, who were both members of Steely Dan's final touring band. Then only 20 years old, Porcaro played drums on every track on the album except "Any World (That I'm Welcome To)", which features session drummer Hal Blaine. Larry Carlton, who became a regular collaborator of the group, made his first appearance on a Steely Dan album playing guitar on "Daddy Don't Live in That New York City No More".
Band leaders Becker & Fagen said they were dissatisfied with the album's sound quality because of an equipment malfunction with the then-new dbx noise reduction system. The damage was mostly repaired after consulting with the engineers at dbx, but Becker & Fagen still refused to listen to the completed album.
Lyrics
"Black Friday", which features Michael Omartian on piano and David Paich on Hohner electric piano and was released as the first single from the album, relates the story of a crooked speculator who makes his fortune and absconds to Muswellbrook, New South Wales, Australia, as, according to Fagen, "It was the place most far away from LA we could think of". The town also "fit[s] the metre of the song and rhyme[s] with 'book'", though Fagen did not realise that locals pronounce it "Musselbrook" (omitting the "w"), which makes the song grating for Australian fans.
Title and packaging
The album's title comes from the lyrics of "Doctor Wu" ("Katy lies / You can see it in her eyes"), and the album cover is a picture of a katydid, a "singing" (stridulating) insect related to crickets and grasshoppers, as a pun on the title. Walter Becker told Rolling Stone, during the band's 2009 tour: "It's about that uneasy relationship between the patient and doctor. People put faith in doctors, yet they abuse their power and become dangerous." The back cover photograph of Donald Fagen (in reindeer sweater) and Denny Dias (in overalls and sombrero and holding a tank of helium) was taken during the session (sometime in 1972-73) for their Schlitz Beer jingle.
Critical reception
{{Album ratings
| rev1 = AllMusic
| rev1Score =
| rev2 = Chicago Tribune
| rev2Score =
| rev3 = Christgau's Record Guide
| rev3Score = A−
| rev4 = Encyclopedia of Popular Music
| rev4Score =
| rev5 = The Great Rock Discography
| rev5Score = 8/10
| rev6 = MusicHound Rock
| rev6Score = 4/5
| rev7 = Pitchfork
| rev7Score = 9.1/10
| rev8 = The Rolling Stone Album Guide
| rev8Score =
| rev9 = Select
| rev9Score = <ref>{{Cite magazine |last=Prendergast |first=Mark |date=September 1990 |title=Steely Dan: 'Katy Lied |magazine=Select |issue=3 |page=106}}</ref>
| rev10 = Tom Hull – on the Web| rev10Score = A
}}
Reviewing the album in 1975 for The Village Voice, Robert Christgau said that, while Katy Lied might be Steely Dan's "biggest" album to that point, he found it "slightly disappointing" on a musical level, citing the loss of lead guitarist Baxter and what he perceived as "cool, cerebral, one-dimensional" jazz guitar influences. Nonetheless, Christgau admitted that he played the album frequently, and he voted it the third-best album of the year on his ballot for the 1975 Pazz & Jop critics poll, on which it placed sixth. John Mendelsohn was more critical in Rolling Stone, writing that "however immaculately tasteful and intelligent" Steely Dan's music may be in theory, it did not register with him emotionally and remained "exemplarily well-crafted and uncommonly intelligent schlock". Mendelsohn found the lyrics interesting, but inscrutable, the musicianship tasteful and well-performed, but not stimulating, and Fagen's singing unique-sounding, but seemingly passionless. In a review in Rolling Stone from 1977, Cameron Crowe called the album "anonymous, absolutely impeccable swing-pop" with "no cheap displays of human emotion".
Retrospectively, Stephen Thomas Erlewine of Allmusic called the album "a smoother version of Pretzel Logic" and "another excellent record" by Steely Dan. Travis Elborough wrote in his 2008 book The Long-Player Goodbye: The Album from LP to iPod and Back Again that Katy Lied, while not on par with Pretzel Logic (1974) or Aja (1977), was still "up there as jazz rock staples go". In The Rolling Stone Album Guide (2004), Rob Sheffield said the album completed a trilogy of Steely Dan albums (the other parts being Countdown to Ecstasy (1973) and Pretzel Logic) that is "a rock version of Chinatown, a film noir tour of L.A.'s decadent losers, showbiz kids, and razor boys". Jazz historian Ted Gioia cited the album as an example of Steely Dan "proving that pop-rock could equally benefit from a healthy dose of jazz" during their initial tenure, which coincided with a period when rock musicians frequently experimented with jazz idioms and techniques.
Of lead single "Black Friday", Cash Box'' said that it contains elements that made earlier Steely Dan singles successful, such as "hot fender rhodes piano tracks, lead guitar work, rhythm that won't stop cooking and identifiable vocals and mix."
Track listing
Personnel
Steely Dan
Donald Fagen – piano, keyboards, vocals
Walter Becker – bass guitar, guitar (solo on 1, 2), personnel photos
Additional musicians
Denny Dias – guitar (solo on 7)
Rick Derringer – guitar (solo on 8)
Dean Parks – guitar (solo on 3)
Elliott Randall – guitar (solo on 10)
Hugh McCracken – guitar
Larry Carlton – guitar (4)
Michael Omartian, David Paich – piano, keyboards
Chuck Rainey, Wilton Felder – bass guitar
Jeff Porcaro – drums (all except 9), dorophone
Hal Blaine – drums (9)
Victor Feldman – percussion, vibraphone
Phil Woods – alto saxophone (5)
Jimmie Haskell – horn arrangement (10)
Bill Perkins – saxophone (10)
Michael McDonald – backing vocals
Sherlie Matthews, Carolyn Willis, Myrna Matthews – backing vocals (6)
Production
Gary Katz – producer
Roger Nichols – engineer, personnel photos
Stuart "Dinky" Dawson – sound consultant
Bob DeAvila – real time analysis
Rick Collins – mastering
Dorothy White – cover photo
Reissue
Vartan – art direction
Michael Diehl – design
Daniel Levitin – consultant
Charts
Album
Singles
References
External links
Complete lyrics
Steely Dan albums
1975 albums
ABC Records albums
Albums arranged by Jimmie Haskell
Albums produced by Gary Katz
|
```turing
We test depopts with conflicting constraints to see which one the solver will
prefer if any:
$ . ../helpers.sh
$ mkpkg foo 1
$ mkpkg foo 2
$ mkpkg bar <<'EOF'
> depopts: [ "foo" {= "1"} ]
> EOF
$ mkpkg baz <<'EOF'
> depopts: [ "foo" {= "2"} ]
> EOF
We don't currently support depopts so they are both omitted.
$ solve bar baz
Solution for dune.lock:
- bar.0.0.1
- baz.0.0.1
It's possible to find a solution by satisfying one (but not both) depopts.
```
|
```java
/*
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package org.apache.rocketmq.remoting.protocol.header;
import org.apache.rocketmq.common.action.Action;
import org.apache.rocketmq.common.action.RocketMQAction;
import org.apache.rocketmq.common.resource.ResourceType;
import org.apache.rocketmq.remoting.CommandCustomHeader;
import org.apache.rocketmq.remoting.exception.RemotingCommandException;
import org.apache.rocketmq.remoting.protocol.RequestCode;
@RocketMQAction(value = RequestCode.AUTH_LIST_ACL, resource = ResourceType.CLUSTER, action = Action.GET)
public class ListAclsRequestHeader implements CommandCustomHeader {
private String subjectFilter;
private String resourceFilter;
public ListAclsRequestHeader() {
}
public ListAclsRequestHeader(String subjectFilter, String resourceFilter) {
this.subjectFilter = subjectFilter;
this.resourceFilter = resourceFilter;
}
@Override
public void checkFields() throws RemotingCommandException {
}
public String getSubjectFilter() {
return subjectFilter;
}
public void setSubjectFilter(String subjectFilter) {
this.subjectFilter = subjectFilter;
}
public String getResourceFilter() {
return resourceFilter;
}
public void setResourceFilter(String resourceFilter) {
this.resourceFilter = resourceFilter;
}
}
```
|
A personal learning network is an informal learning network that consists of the people a learner interacts with and derives knowledge from in a personal learning environment. In a PLN, a person makes a connection with another person with the specific intent that some type of learning will occur because of that connection.
Personal learning networks share a close association with the concept of personal learning environments. Martindale & Dowdy describe a PLE as a "manifestation of a learner’s informal learning processes via the Web".
Aspects
According to the theory of connectivism developed by George Siemens (as well as Stephen Downes), the "epitome of connectivism" is that learners create connections and develop a personal network that contributes to their personal and professional development and knowledge.
The following is an excerpt from Dryden's and Vos' book on learning networks:
"For the first time in history, we know now how to store virtually all humanity's most important information and make it available, almost instantly, in almost any form, to almost anyone on earth. We also know how to do that in great new ways so that people can interact with it, and learn from it."
Specifically, the learner chooses whom to interact with in these media and how much to participate. Learners have certain goals, needs, interests, motivations and problems that are often presented to the people they include in their PLN. Moreover, the learner will collaborate and connect differently with various members. The learner will establish stronger relationships with some members and have a low level of connection with others. Not all nodes will be equal. Some of the member roles include searcher, assemblator, designer of data, innovator of subject matter, and researcher.
Recognition of PLNs
The European Union Lifelong Learning Programme 2007–2013 has recognized the potential for PLNs by funding the aPLaNet project (Autonomous Personal Learning Networks for Language Teachers). The project explains the value of PLNs for the professional development of language educators.
See also
Connectivism (learning theory)
Networked learning
References
External links
European Union funded education project "Autonomous Personal Learning Networks for Language Teachers" (acronym aPLaNet)
Radford University Presentation on Developing Personal Learning Networks
Learning
|
WRDK (90.7 FM) was a radio station licensed to serve Bladenboro, North Carolina, United States. The station was owned by Richburg Educational Broadcasters, Inc. The station surrendered its license on March 12, 2018; the Federal Communications Commission cancelled it on March 22.
References
External links
RDK
Radio stations established in 2011
2011 establishments in North Carolina
Radio stations disestablished in 2018
2018 disestablishments in North Carolina
Defunct radio stations in the United States
RDK
|
Louis Vogel (born 1954) is a French jurist, professor and politician. He was President of Panthéon-Assas University from 2006 to 2012 and president of the Conférence des Présidents d'Université. He is the director of the Paris Institute of Comparative Law. In April 2016, he became the mayor of Melun.
He has studied at Paris Institute of Political Studies, Yale Law School, and Panthéon-Assas.
Works
L'Université, une chance pour la France (2010)
References
1954 births
Living people
People from Saarbrücken
Agir (France) politicians
Mayors of places in Île-de-France
French jurists
French people of German descent
Sciences Po alumni
Paris 2 Panthéon-Assas University alumni
Yale Law School alumni
Presidents of Panthéon-Assas University
Academic staff of Paris 2 Panthéon-Assas University
|
```go
// +build appengine plan9
package request
import (
"strings"
)
func isErrConnectionReset(err error) bool {
return strings.Contains(err.Error(), "connection reset")
}
```
|
was a Japanese manga artist and tarento born in Tosayamada (now part of Kami), Kōchi Prefecture, Japan. He was a long-time resident of Koishikawa, Bunkyō, Tokyo, Japan. He made his professional manga debut in 1963 with his story , published in Weekly Manga Times.
History
Hara was the oldest son, though he had an older sister. His father died of tuberculosis before he was born.
Hara died of liver cancer on 10 November 2006 at a hospital in Fujimi, Saitama Prefecture.
1943 births
2006 deaths
Manga artists
Deaths from liver cancer
People from Kōchi Prefecture
|
```python
import unittest
import requests
import os
import sys
import random
sys.path.insert(1, os.path.join(sys.path[0], '..'))
from plugins.engines.marko import Marko
from basetest import BaseTest
class MarkoTests(unittest.TestCase, BaseTest):
expected_data = {
'language': 'javascript',
'engine': 'marko',
'evaluate' : 'javascript' ,
'execute' : True,
'read' : True,
'write' : True,
'prefix' : '',
'suffix': '',
'render': '${%(code)s}',
'header': '${"%(header)s"}',
'trailer': '${"%(trailer)s"}',
'bind_shell' : True,
'reverse_shell': True
}
expected_data_blind = {
'language': 'javascript',
'engine': 'marko',
'blind': True,
'execute_blind' : True,
'evaluate_blind' : 'javascript',
'write': True,
'prefix' : '',
'suffix' : '',
'bind_shell' : True,
'reverse_shell': True
}
url = 'path_to_url
url_blind = 'path_to_url
plugin = Marko
blind_tests = [
(0, 0, 'AAA%sAAA', {}),
]
reflection_tests = [
(0, 0, '%s', {}),
(0, 0, 'AAA%sAAA', {}),
(1, 0, '${%s}', { 'prefix': '1}', 'suffix' : '${"1"' }),
(2, 0, '<var name=%s/>', { 'prefix': '1/>', 'suffix' : '' }),
(2, 0, '<assign name=%s/>', { 'prefix': '1/>', 'suffix' : '' }),
]
```
|
```xml
import { PlanType } from "../../../billing/enums";
import { PlanResponse } from "../../../billing/models/response/plan.response";
import { BaseResponse } from "../../../models/response/base.response";
export class OrganizationResponse extends BaseResponse {
id: string;
name: string;
businessName: string;
businessAddress1: string;
businessAddress2: string;
businessAddress3: string;
businessCountry: string;
businessTaxNumber: string;
billingEmail: string;
plan: PlanResponse;
planType: PlanType;
seats: number;
maxAutoscaleSeats: number;
maxCollections: number;
maxStorageGb: number;
useGroups: boolean;
useDirectory: boolean;
useEvents: boolean;
useTotp: boolean;
use2fa: boolean;
useApi: boolean;
useResetPassword: boolean;
useSecretsManager: boolean;
hasPublicAndPrivateKeys: boolean;
usePasswordManager: boolean;
smSeats?: number;
smServiceAccounts?: number;
maxAutoscaleSmSeats?: number;
maxAutoscaleSmServiceAccounts?: number;
limitCollectionCreationDeletion: boolean;
allowAdminAccessToAllCollectionItems: boolean;
constructor(response: any) {
super(response);
this.id = this.getResponseProperty("Id");
this.name = this.getResponseProperty("Name");
this.businessName = this.getResponseProperty("BusinessName");
this.businessAddress1 = this.getResponseProperty("BusinessAddress1");
this.businessAddress2 = this.getResponseProperty("BusinessAddress2");
this.businessAddress3 = this.getResponseProperty("BusinessAddress3");
this.businessCountry = this.getResponseProperty("BusinessCountry");
this.businessTaxNumber = this.getResponseProperty("BusinessTaxNumber");
this.billingEmail = this.getResponseProperty("BillingEmail");
const plan = this.getResponseProperty("Plan");
this.plan = plan == null ? null : new PlanResponse(plan);
this.planType = this.getResponseProperty("PlanType");
this.seats = this.getResponseProperty("Seats");
this.maxAutoscaleSeats = this.getResponseProperty("MaxAutoscaleSeats");
this.maxCollections = this.getResponseProperty("MaxCollections");
this.maxStorageGb = this.getResponseProperty("MaxStorageGb");
this.useGroups = this.getResponseProperty("UseGroups");
this.useDirectory = this.getResponseProperty("UseDirectory");
this.useEvents = this.getResponseProperty("UseEvents");
this.useTotp = this.getResponseProperty("UseTotp");
this.use2fa = this.getResponseProperty("Use2fa");
this.useApi = this.getResponseProperty("UseApi");
this.useResetPassword = this.getResponseProperty("UseResetPassword");
this.useSecretsManager = this.getResponseProperty("UseSecretsManager");
this.hasPublicAndPrivateKeys = this.getResponseProperty("HasPublicAndPrivateKeys");
this.usePasswordManager = this.getResponseProperty("UsePasswordManager");
this.smSeats = this.getResponseProperty("SmSeats");
this.smServiceAccounts = this.getResponseProperty("SmServiceAccounts");
this.maxAutoscaleSmSeats = this.getResponseProperty("MaxAutoscaleSmSeats");
this.maxAutoscaleSmServiceAccounts = this.getResponseProperty("MaxAutoscaleSmServiceAccounts");
this.limitCollectionCreationDeletion = this.getResponseProperty(
"LimitCollectionCreationDeletion",
);
this.allowAdminAccessToAllCollectionItems = this.getResponseProperty(
"AllowAdminAccessToAllCollectionItems",
);
}
}
```
|
```python
#!/usr/bin/env python3
###############################################################################
#
# Project: Embedded Learning Library (ELL)
# File: pets_callback.py
# Authors: Chris Lovett
# Byron Changuion
# Lisa Ong
#
# Requires: Python 3.x
#
###############################################################################
import cv2
import tutorial_helpers as helpers
# import the ELL model's Python module
import model
def get_image_from_camera(camera):
"""Function to return an image from our camera using OpenCV"""
if camera:
# if predictor is too slow frames get buffered, this is designed to
# flush that buffer
ret, frame = camera.read()
if not ret:
raise Exception("your capture device is not returning images")
return frame
return None
def prediction_index_in_set(prediction_index, category_set):
"""Returns True if the prediction index is in the set"""
for x in category_set:
if prediction_index == int(x):
return True
return False
class CatsDogsPredictor(model.ModelWrapper):
"""Class that implements input and output callbacks for the ELL model
by deriving from the Model base class.
"""
def __init__(self, camera, cats, dogs):
"""Initializes this object with the camera source and model-related
information"""
super(CatsDogsPredictor, self).__init__(self)
self.camera = camera
self.dogs = dogs
self.cats = cats
# Get the model's input dimensions. We'll use this information later to
# resize images appropriately.
self.input_shape = self.GetInputShape()
# Get the model-specific preprocessing metadata
self.preprocessing_metadata = helpers.get_image_preprocessing_metadata(self)
# Holds the image from the camera or other sources
self.image = None
def input_callback(self):
"""The input callback that returns an image to the model"""
# Get an image from the camera. If you'd like to use a different image,
# load the image from some other source.
self.image = get_image_from_camera(self.camera)
# Prepare the image to pass to the model. This helper:
# - crops and resizes the image maintaining proper aspect ratio
# - reorders the image channels if needed
# - returns the data as a ravelled numpy array of floats so it can be
# handed to the model
return model.FloatVector(helpers.prepare_image_for_model(
self.image, self.input_shape.columns, self.input_shape.rows, preprocessing_metadata=self.preprocessing_metadata))
def output_callback(self, predictions):
"""The output callback that the model calls when predictions are ready"""
header_text = ""
group, probability = self.get_group(predictions)
if group:
# A group was detected, so take action
if group == "Dog":
# A prediction in the dog category group was detected, print a `woof`
print("Woof!")
elif group == "Cat":
# A prediction in the cat category group was detected, print a `meow`
print("Meow!")
header_text = "({:.0%}) {}".format(probability, group)
helpers.draw_header(self.image, header_text)
cv2.imshow("Grouping (with callbacks)", self.image)
def get_group(self, predictions):
"""Returns the group and proability for the top prediction"""
top_n = helpers.get_top_n(predictions, 1, threshold=0.05)
if top_n:
top = top_n[0]
if prediction_index_in_set(top[0], self.dogs):
return "Dog", top[1]
elif prediction_index_in_set(top[0], self.cats):
return "Cat", top[1]
return None
def main():
"""Entry point for the script when called directly"""
# Open the video camera. To use a different camera, change the camera
# index.
camera = cv2.VideoCapture(0)
# Read the category names
with open("dogs.txt", "r") as dogs_file,\
open("cats.txt", "r") as cats_file:
dogs = dogs_file.read().splitlines()
cats = cats_file.read().splitlines()
# Create a predictor
predictor = CatsDogsPredictor(camera, cats, dogs)
while (cv2.waitKey(1) & 0xFF) == 0xFF:
# Run the predictor. The ELL model will call the input callback
# to get an image, and call the output callback when predictions
# are available
predictor.Predict()
if __name__ == "__main__":
main()
```
|
```c
/*
* KMVC decoder
*
* This file is part of FFmpeg.
*
* FFmpeg is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
*
* FFmpeg is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
*
* You should have received a copy of the GNU Lesser General Public
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
/**
* @file
* Karl Morton's Video Codec decoder
*/
#include <stdio.h>
#include <stdlib.h>
#include "avcodec.h"
#include "bytestream.h"
#include "internal.h"
#include "libavutil/common.h"
#define KMVC_KEYFRAME 0x80
#define KMVC_PALETTE 0x40
#define KMVC_METHOD 0x0F
#define MAX_PALSIZE 256
/*
* Decoder context
*/
typedef struct KmvcContext {
AVCodecContext *avctx;
int setpal;
int palsize;
uint32_t pal[MAX_PALSIZE];
uint8_t *cur, *prev;
uint8_t frm0[320 * 200], frm1[320 * 200];
GetByteContext g;
} KmvcContext;
typedef struct BitBuf {
int bits;
int bitbuf;
} BitBuf;
#define BLK(data, x, y) data[av_clip((x) + (y) * 320, 0, 320 * 200 -1)]
#define kmvc_init_getbits(bb, g) bb.bits = 7; bb.bitbuf = bytestream2_get_byte(g);
#define kmvc_getbit(bb, g, res) {\
res = 0; \
if (bb.bitbuf & (1 << bb.bits)) res = 1; \
bb.bits--; \
if(bb.bits == -1) { \
bb.bitbuf = bytestream2_get_byte(g); \
bb.bits = 7; \
} \
}
static int kmvc_decode_intra_8x8(KmvcContext * ctx, int w, int h)
{
BitBuf bb;
int res, val;
int i, j;
int bx, by;
int l0x, l1x, l0y, l1y;
int mx, my;
kmvc_init_getbits(bb, &ctx->g);
for (by = 0; by < h; by += 8)
for (bx = 0; bx < w; bx += 8) {
if (!bytestream2_get_bytes_left(&ctx->g)) {
av_log(ctx->avctx, AV_LOG_ERROR, "Data overrun\n");
return AVERROR_INVALIDDATA;
}
kmvc_getbit(bb, &ctx->g, res);
if (!res) { // fill whole 8x8 block
val = bytestream2_get_byte(&ctx->g);
for (i = 0; i < 64; i++)
BLK(ctx->cur, bx + (i & 0x7), by + (i >> 3)) = val;
} else { // handle four 4x4 subblocks
for (i = 0; i < 4; i++) {
l0x = bx + (i & 1) * 4;
l0y = by + (i & 2) * 2;
kmvc_getbit(bb, &ctx->g, res);
if (!res) {
kmvc_getbit(bb, &ctx->g, res);
if (!res) { // fill whole 4x4 block
val = bytestream2_get_byte(&ctx->g);
for (j = 0; j < 16; j++)
BLK(ctx->cur, l0x + (j & 3), l0y + (j >> 2)) = val;
} else { // copy block from already decoded place
val = bytestream2_get_byte(&ctx->g);
mx = val & 0xF;
my = val >> 4;
if ((l0x-mx) + 320*(l0y-my) < 0 || (l0x-mx) + 320*(l0y-my) > 320*197 - 4) {
av_log(ctx->avctx, AV_LOG_ERROR, "Invalid MV\n");
return AVERROR_INVALIDDATA;
}
for (j = 0; j < 16; j++)
BLK(ctx->cur, l0x + (j & 3), l0y + (j >> 2)) =
BLK(ctx->cur, l0x + (j & 3) - mx, l0y + (j >> 2) - my);
}
} else { // descend to 2x2 sub-sub-blocks
for (j = 0; j < 4; j++) {
l1x = l0x + (j & 1) * 2;
l1y = l0y + (j & 2);
kmvc_getbit(bb, &ctx->g, res);
if (!res) {
kmvc_getbit(bb, &ctx->g, res);
if (!res) { // fill whole 2x2 block
val = bytestream2_get_byte(&ctx->g);
BLK(ctx->cur, l1x, l1y) = val;
BLK(ctx->cur, l1x + 1, l1y) = val;
BLK(ctx->cur, l1x, l1y + 1) = val;
BLK(ctx->cur, l1x + 1, l1y + 1) = val;
} else { // copy block from already decoded place
val = bytestream2_get_byte(&ctx->g);
mx = val & 0xF;
my = val >> 4;
if ((l1x-mx) + 320*(l1y-my) < 0 || (l1x-mx) + 320*(l1y-my) > 320*199 - 2) {
av_log(ctx->avctx, AV_LOG_ERROR, "Invalid MV\n");
return AVERROR_INVALIDDATA;
}
BLK(ctx->cur, l1x, l1y) = BLK(ctx->cur, l1x - mx, l1y - my);
BLK(ctx->cur, l1x + 1, l1y) =
BLK(ctx->cur, l1x + 1 - mx, l1y - my);
BLK(ctx->cur, l1x, l1y + 1) =
BLK(ctx->cur, l1x - mx, l1y + 1 - my);
BLK(ctx->cur, l1x + 1, l1y + 1) =
BLK(ctx->cur, l1x + 1 - mx, l1y + 1 - my);
}
} else { // read values for block
BLK(ctx->cur, l1x, l1y) = bytestream2_get_byte(&ctx->g);
BLK(ctx->cur, l1x + 1, l1y) = bytestream2_get_byte(&ctx->g);
BLK(ctx->cur, l1x, l1y + 1) = bytestream2_get_byte(&ctx->g);
BLK(ctx->cur, l1x + 1, l1y + 1) = bytestream2_get_byte(&ctx->g);
}
}
}
}
}
}
return 0;
}
static int kmvc_decode_inter_8x8(KmvcContext * ctx, int w, int h)
{
BitBuf bb;
int res, val;
int i, j;
int bx, by;
int l0x, l1x, l0y, l1y;
int mx, my;
kmvc_init_getbits(bb, &ctx->g);
for (by = 0; by < h; by += 8)
for (bx = 0; bx < w; bx += 8) {
kmvc_getbit(bb, &ctx->g, res);
if (!res) {
kmvc_getbit(bb, &ctx->g, res);
if (!res) { // fill whole 8x8 block
if (!bytestream2_get_bytes_left(&ctx->g)) {
av_log(ctx->avctx, AV_LOG_ERROR, "Data overrun\n");
return AVERROR_INVALIDDATA;
}
val = bytestream2_get_byte(&ctx->g);
for (i = 0; i < 64; i++)
BLK(ctx->cur, bx + (i & 0x7), by + (i >> 3)) = val;
} else { // copy block from previous frame
for (i = 0; i < 64; i++)
BLK(ctx->cur, bx + (i & 0x7), by + (i >> 3)) =
BLK(ctx->prev, bx + (i & 0x7), by + (i >> 3));
}
} else { // handle four 4x4 subblocks
if (!bytestream2_get_bytes_left(&ctx->g)) {
av_log(ctx->avctx, AV_LOG_ERROR, "Data overrun\n");
return AVERROR_INVALIDDATA;
}
for (i = 0; i < 4; i++) {
l0x = bx + (i & 1) * 4;
l0y = by + (i & 2) * 2;
kmvc_getbit(bb, &ctx->g, res);
if (!res) {
kmvc_getbit(bb, &ctx->g, res);
if (!res) { // fill whole 4x4 block
val = bytestream2_get_byte(&ctx->g);
for (j = 0; j < 16; j++)
BLK(ctx->cur, l0x + (j & 3), l0y + (j >> 2)) = val;
} else { // copy block
val = bytestream2_get_byte(&ctx->g);
mx = (val & 0xF) - 8;
my = (val >> 4) - 8;
if ((l0x+mx) + 320*(l0y+my) < 0 || (l0x+mx) + 320*(l0y+my) > 320*197 - 4) {
av_log(ctx->avctx, AV_LOG_ERROR, "Invalid MV\n");
return AVERROR_INVALIDDATA;
}
for (j = 0; j < 16; j++)
BLK(ctx->cur, l0x + (j & 3), l0y + (j >> 2)) =
BLK(ctx->prev, l0x + (j & 3) + mx, l0y + (j >> 2) + my);
}
} else { // descend to 2x2 sub-sub-blocks
for (j = 0; j < 4; j++) {
l1x = l0x + (j & 1) * 2;
l1y = l0y + (j & 2);
kmvc_getbit(bb, &ctx->g, res);
if (!res) {
kmvc_getbit(bb, &ctx->g, res);
if (!res) { // fill whole 2x2 block
val = bytestream2_get_byte(&ctx->g);
BLK(ctx->cur, l1x, l1y) = val;
BLK(ctx->cur, l1x + 1, l1y) = val;
BLK(ctx->cur, l1x, l1y + 1) = val;
BLK(ctx->cur, l1x + 1, l1y + 1) = val;
} else { // copy block
val = bytestream2_get_byte(&ctx->g);
mx = (val & 0xF) - 8;
my = (val >> 4) - 8;
if ((l1x+mx) + 320*(l1y+my) < 0 || (l1x+mx) + 320*(l1y+my) > 320*199 - 2) {
av_log(ctx->avctx, AV_LOG_ERROR, "Invalid MV\n");
return AVERROR_INVALIDDATA;
}
BLK(ctx->cur, l1x, l1y) = BLK(ctx->prev, l1x + mx, l1y + my);
BLK(ctx->cur, l1x + 1, l1y) =
BLK(ctx->prev, l1x + 1 + mx, l1y + my);
BLK(ctx->cur, l1x, l1y + 1) =
BLK(ctx->prev, l1x + mx, l1y + 1 + my);
BLK(ctx->cur, l1x + 1, l1y + 1) =
BLK(ctx->prev, l1x + 1 + mx, l1y + 1 + my);
}
} else { // read values for block
BLK(ctx->cur, l1x, l1y) = bytestream2_get_byte(&ctx->g);
BLK(ctx->cur, l1x + 1, l1y) = bytestream2_get_byte(&ctx->g);
BLK(ctx->cur, l1x, l1y + 1) = bytestream2_get_byte(&ctx->g);
BLK(ctx->cur, l1x + 1, l1y + 1) = bytestream2_get_byte(&ctx->g);
}
}
}
}
}
}
return 0;
}
static int decode_frame(AVCodecContext * avctx, void *data, int *got_frame,
AVPacket *avpkt)
{
KmvcContext *const ctx = avctx->priv_data;
AVFrame *frame = data;
uint8_t *out, *src;
int i, ret;
int header;
int blocksize;
int pal_size;
const uint8_t *pal = av_packet_get_side_data(avpkt, AV_PKT_DATA_PALETTE, &pal_size);
bytestream2_init(&ctx->g, avpkt->data, avpkt->size);
if ((ret = ff_get_buffer(avctx, frame, 0)) < 0)
return ret;
header = bytestream2_get_byte(&ctx->g);
/* blocksize 127 is really palette change event */
if (bytestream2_peek_byte(&ctx->g) == 127) {
bytestream2_skip(&ctx->g, 3);
for (i = 0; i < 127; i++) {
ctx->pal[i + (header & 0x81)] = 0xFFU << 24 | bytestream2_get_be24(&ctx->g);
bytestream2_skip(&ctx->g, 1);
}
bytestream2_seek(&ctx->g, -127 * 4 - 3, SEEK_CUR);
}
if (header & KMVC_KEYFRAME) {
frame->key_frame = 1;
frame->pict_type = AV_PICTURE_TYPE_I;
} else {
frame->key_frame = 0;
frame->pict_type = AV_PICTURE_TYPE_P;
}
if (header & KMVC_PALETTE) {
frame->palette_has_changed = 1;
// palette starts from index 1 and has 127 entries
for (i = 1; i <= ctx->palsize; i++) {
ctx->pal[i] = 0xFFU << 24 | bytestream2_get_be24(&ctx->g);
}
}
if (pal && pal_size == AVPALETTE_SIZE) {
frame->palette_has_changed = 1;
memcpy(ctx->pal, pal, AVPALETTE_SIZE);
} else if (pal) {
av_log(avctx, AV_LOG_ERROR, "Palette size %d is wrong\n", pal_size);
}
if (ctx->setpal) {
ctx->setpal = 0;
frame->palette_has_changed = 1;
}
/* make the palette available on the way out */
memcpy(frame->data[1], ctx->pal, 1024);
blocksize = bytestream2_get_byte(&ctx->g);
if (blocksize != 8 && blocksize != 127) {
av_log(avctx, AV_LOG_ERROR, "Block size = %i\n", blocksize);
return AVERROR_INVALIDDATA;
}
memset(ctx->cur, 0, 320 * 200);
switch (header & KMVC_METHOD) {
case 0:
case 1: // used in palette changed event
memcpy(ctx->cur, ctx->prev, 320 * 200);
break;
case 3:
kmvc_decode_intra_8x8(ctx, avctx->width, avctx->height);
break;
case 4:
kmvc_decode_inter_8x8(ctx, avctx->width, avctx->height);
break;
default:
av_log(avctx, AV_LOG_ERROR, "Unknown compression method %i\n", header & KMVC_METHOD);
return AVERROR_INVALIDDATA;
}
out = frame->data[0];
src = ctx->cur;
for (i = 0; i < avctx->height; i++) {
memcpy(out, src, avctx->width);
src += 320;
out += frame->linesize[0];
}
/* flip buffers */
if (ctx->cur == ctx->frm0) {
ctx->cur = ctx->frm1;
ctx->prev = ctx->frm0;
} else {
ctx->cur = ctx->frm0;
ctx->prev = ctx->frm1;
}
*got_frame = 1;
/* always report that the buffer was completely consumed */
return avpkt->size;
}
/*
* Init kmvc decoder
*/
static av_cold int decode_init(AVCodecContext * avctx)
{
KmvcContext *const c = avctx->priv_data;
int i;
c->avctx = avctx;
if (avctx->width > 320 || avctx->height > 200) {
av_log(avctx, AV_LOG_ERROR, "KMVC supports frames <= 320x200\n");
return AVERROR(EINVAL);
}
c->cur = c->frm0;
c->prev = c->frm1;
for (i = 0; i < 256; i++) {
c->pal[i] = 0xFFU << 24 | i * 0x10101;
}
if (avctx->extradata_size < 12) {
av_log(avctx, AV_LOG_WARNING,
"Extradata missing, decoding may not work properly...\n");
c->palsize = 127;
} else {
c->palsize = AV_RL16(avctx->extradata + 10);
if (c->palsize >= (unsigned)MAX_PALSIZE) {
c->palsize = 127;
av_log(avctx, AV_LOG_ERROR, "KMVC palette too large\n");
return AVERROR_INVALIDDATA;
}
}
if (avctx->extradata_size == 1036) { // palette in extradata
uint8_t *src = avctx->extradata + 12;
for (i = 0; i < 256; i++) {
c->pal[i] = AV_RL32(src);
src += 4;
}
c->setpal = 1;
}
avctx->pix_fmt = AV_PIX_FMT_PAL8;
return 0;
}
AVCodec ff_kmvc_decoder = {
.name = "kmvc",
.long_name = NULL_IF_CONFIG_SMALL("Karl Morton's video codec"),
.type = AVMEDIA_TYPE_VIDEO,
.id = AV_CODEC_ID_KMVC,
.priv_data_size = sizeof(KmvcContext),
.init = decode_init,
.decode = decode_frame,
.capabilities = AV_CODEC_CAP_DR1,
};
```
|
```javascript
// When calling .end(buffer) right away, this triggers a "hot path"
// optimization in http.js, to avoid an extra write call.
//
// However, the overhead of copying a large buffer is higher than
// the overhead of an extra write() call, so the hot path was not
// always as hot as it could be.
//
// Verify that our assumptions are valid.
'use strict';
const common = require('../common.js');
const bench = common.createBenchmark(main, {
n: [1, 4, 8, 16],
len: [1, 64, 256],
c: [100]
});
function main({ len, n, c }) {
const http = require('http');
const chunk = Buffer.alloc(len, '8');
const server = http.createServer(function(req, res) {
function send(left) {
if (left === 0) return res.end();
res.write(chunk);
setTimeout(function() {
send(left - 1);
}, 0);
}
send(n);
});
server.listen(common.PORT, function() {
bench.http({
connections: c
}, function() {
server.close();
});
});
}
```
|
The Three-Day Week was one of several measures introduced in the United Kingdom in 1973–1974 by Edward Heath's Conservative government to conserve electricity, the generation of which was severely restricted owing to industrial action by coal miners and railway workers.
From 1 January 1974, commercial users of electricity were limited to three specified consecutive days' consumption each week and prohibited from working longer hours on those days. Services deemed essential (e.g. hospitals, supermarkets and newspaper printing presses) were exempt. Television companies were required to cease broadcasting at 22:30 to conserve electricity, although this restriction was dropped after a general election was called. The Three-Day Week restrictions were lifted on 7 March 1974.
The measure was a major disaster for the Heath government, contributing to the losses in both the February election and the subsequent October election. Following the losses Margaret Thatcher challenged Heath to a leadership contest and subsequently won.
Background
Throughout the 1970s the British economy was troubled by high rates of inflation. To tackle this, the government capped public sector pay rises and publicly promoted a clear capped level to the private sector. This caused unrest amongst trade unions as wages did not keep pace with price increases. This extended to most industries, including coal mining, which provided the majority of the country's fuel and had a powerful trade union.
By the middle of 1973, the National Union of Mineworkers (NUM) – drawn from a workforce who almost wholly worked for the National Coal Board – were becoming more militant with the election of Mick McGahey as vice-president. The national conference passed resolutions for a 35% wage increase, regardless of any government guidelines, and for the election of a Labour government committed to "true socialist policy" including nationalisation of land and all key monopolies.
As inflation increased, miners' wages fell in real terms and, by October 1973, average wages were 2.3% lower than recommended by the Wilberforce Inquiry, which reported on miners' pay in 1972. In November 1973, the national executive committee of the NUM rejected the pay offer from the NCB and held a national ballot on a strike. The vote was rejected by 143,006 to 82,631. However, an overtime ban was implemented with the aim of halving production. This action hurt the coal industry and was unpopular amongst the British media, although the Trades Union Congress supported the NUM's actions.
The Three-Day Week
In the 1970s, most of the UK's electricity was produced by coal-burning power stations. To reduce electricity consumption, and thus conserve coal stocks, the Conservative Prime Minister, Edward Heath, announced a number of measures under the Fuel and Electricity (Control) Act 1973 on 13 December 1973, including the Three-Day Work Order, which came into force at midnight on 31 December. Commercial consumption of electricity would be limited to three consecutive days each week. Heath's objectives were business continuity and survival and to avoid further inflation and a currency crisis. Rather than risk a total shutdown, working time was reduced to prolong the life of available fuel stocks. Television broadcasts were to shut down at 22:30 each evening, and most pubs were closed; due to the power surges generated at 22:30, the Central Electricity Generating Board argued for a staggered shutdown on BBC and ITV, alternating nightly, and this was eventually introduced. The television broadcasting restrictions were introduced on 17 December 1973, suspended for the Christmas and New Year period, and lifted on 8 February 1974.
Strike vote
On 24 January 1974, 81% of NUM members voted to strike, having rejected the offer of a 16.5% pay rise. In contrast to the regional divisions of other strikes, every region of the NUM voted by a majority in favour of strike action. The only area that did not was the Colliery Officials and Staff Association (COSA) section. Some administrative staff had joined another union, APEX, to distance themselves from the increasing militancy of the NUM. APEX members did not strike, which led to resentment amongst NUM members.
In the aftermath of the vote, there was speculation that the army would be used to transport coal and man the power stations. McGahey called in a speech for the army to disobey orders, and either stay in the barracks or join picket lines, if they were asked to break the strike. In response, 111 Labour MPs signed a statement to condemn McGahey. He responded "You can't dig coal with bayonets."
Results by NUM area
Taken from John Douglass' Strike, not the end of the story (National Coal Mining Museum for England publications), p.24:
Election call
The strike began officially on 5 February and, two days later, Heath called the February 1974 general election while the Three-Day Week was in force. His government emphasised the pay dispute with the miners and used the slogan "Who governs Britain?". Heath believed that the public sided with the Conservatives on the issues of strikes and union power.
On 21 February 1974, the government's Pay Board reported that the NUM's pay claim was within the Phase 3 system for claims and would return miners' wages to the levels recommended by the Wilberforce Inquiry in 1972.
NUM control of picketing
There had been some violence on miners' picket lines during the unofficial strike of 1969 and the official strike of 1972. Aware of the damage that could be done to the Labour Party's electoral prospects by media coverage of picket-line violence, the NUM instituted strict controls over pickets. Pickets had to wear armbands saying "official picket" and had to be authorised by areas. Unlike in 1972, students were discouraged from joining miners' picket lines. Every picket line had to be authorised by the local NUM area with a chief picket to ensure that no violence took place.
Media
Most of the media were strongly opposed to the NUM strike. An exception was the Daily Mirror, which ran an emotive campaign to support the NUM. Its edition on election day in 1974 showed hundreds of crosses on its front page to represent the miners who had died since nationalisation in 1947, accompanied by the message, "Before you use your cross, remember these crosses".
Election result
The election resulted in a hung parliament: the Conservative Party took the largest share of the vote, but lost its majority, with Labour having the most seats in the House of Commons. In the ensuing talks, Heath failed to secure enough parliamentary support from Liberal and Ulster Unionist MPs; and Harold Wilson returned to power in a minority government. The normal working week was restored on 8 March, but other restrictions on the use of electricity remained in force. A second general election was held in October 1974 cementing the Labour administration, which gained a majority of three seats.
The new Labour government increased miners' wages by 35% immediately after the February 1974 election. In February 1975, a further increase of 35% was achieved without any industrial action.
In the campaign for the 1979 general election, following the Winter of Discontent running into that year, Labour reminded voters of the Three-Day Week, with a poster showing a lit candle and bearing the slogan "Remember the last time the Tories said they had all the answers?"
Notes
Further reading
Beckett, Andy. When the lights went out: Britain in the seventies (Faber & Faber, 2009).
Grawe, Nathan D. "The three-day week of 1974 and measurement error in the FES and NCDS data sets" (No. 2002-11. ISER Working Paper Series, 2002). online
Sandbrook, Dominic. State of Emergency: the way we were: Britain, 1970-1974 (Penguin UK, 2011) pp 584–606.
1974 in the United Kingdom
Labour in the United Kingdom
Political history of the United Kingdom
Energy conservation in the United Kingdom
1974 labor disputes and strikes
February 1974 United Kingdom general election
|
```go
// Use of this source code is governed by a MIT license found in the LICENSE file.
package codec
import (
"math/rand"
"time"
)
// NoopHandle returns a no-op handle. It basically does nothing.
// It is only useful for benchmarking, as it gives an idea of the
// overhead from the codec framework.
//
// LIBRARY USERS: *** DO NOT USE ***
func NoopHandle(slen int) *noopHandle {
h := noopHandle{}
h.rand = rand.New(rand.NewSource(time.Now().UnixNano()))
h.B = make([][]byte, slen)
h.S = make([]string, slen)
for i := 0; i < len(h.S); i++ {
b := make([]byte, i+1)
for j := 0; j < len(b); j++ {
b[j] = 'a' + byte(i)
}
h.B[i] = b
h.S[i] = string(b)
}
return &h
}
// noopHandle does nothing.
// It is used to simulate the overhead of the codec framework.
type noopHandle struct {
BasicHandle
binaryEncodingType
noopDrv // noopDrv is unexported here, so we can get a copy of it when needed.
}
type noopDrv struct {
d *Decoder
e *Encoder
i int
S []string
B [][]byte
mks []bool // stack. if map (true), else if array (false)
mk bool // top of stack. what container are we on? map or array?
ct valueType // last response for IsContainerType.
cb int // counter for ContainerType
rand *rand.Rand
}
func (h *noopDrv) r(v int) int { return h.rand.Intn(v) }
func (h *noopDrv) m(v int) int { h.i++; return h.i % v }
func (h *noopDrv) newEncDriver(e *Encoder) encDriver { h.e = e; return h }
func (h *noopDrv) newDecDriver(d *Decoder) decDriver { h.d = d; return h }
func (h *noopDrv) reset() {}
func (h *noopDrv) uncacheRead() {}
// --- encDriver
// stack functions (for map and array)
func (h *noopDrv) start(b bool) {
// println("start", len(h.mks)+1)
h.mks = append(h.mks, b)
h.mk = b
}
func (h *noopDrv) end() {
// println("end: ", len(h.mks)-1)
h.mks = h.mks[:len(h.mks)-1]
if len(h.mks) > 0 {
h.mk = h.mks[len(h.mks)-1]
} else {
h.mk = false
}
}
func (h *noopDrv) EncodeBuiltin(rt uintptr, v interface{}) {}
func (h *noopDrv) EncodeNil() {}
func (h *noopDrv) EncodeInt(i int64) {}
func (h *noopDrv) EncodeUint(i uint64) {}
func (h *noopDrv) EncodeBool(b bool) {}
func (h *noopDrv) EncodeFloat32(f float32) {}
func (h *noopDrv) EncodeFloat64(f float64) {}
func (h *noopDrv) EncodeRawExt(re *RawExt, e *Encoder) {}
func (h *noopDrv) EncodeArrayStart(length int) { h.start(true) }
func (h *noopDrv) EncodeMapStart(length int) { h.start(false) }
func (h *noopDrv) EncodeEnd() { h.end() }
func (h *noopDrv) EncodeString(c charEncoding, v string) {}
func (h *noopDrv) EncodeSymbol(v string) {}
func (h *noopDrv) EncodeStringBytes(c charEncoding, v []byte) {}
func (h *noopDrv) EncodeExt(rv interface{}, xtag uint64, ext Ext, e *Encoder) {}
// ---- decDriver
func (h *noopDrv) initReadNext() {}
func (h *noopDrv) CheckBreak() bool { return false }
func (h *noopDrv) IsBuiltinType(rt uintptr) bool { return false }
func (h *noopDrv) DecodeBuiltin(rt uintptr, v interface{}) {}
func (h *noopDrv) DecodeInt(bitsize uint8) (i int64) { return int64(h.m(15)) }
func (h *noopDrv) DecodeUint(bitsize uint8) (ui uint64) { return uint64(h.m(35)) }
func (h *noopDrv) DecodeFloat(chkOverflow32 bool) (f float64) { return float64(h.m(95)) }
func (h *noopDrv) DecodeBool() (b bool) { return h.m(2) == 0 }
func (h *noopDrv) DecodeString() (s string) { return h.S[h.m(8)] }
// func (h *noopDrv) DecodeStringAsBytes(bs []byte) []byte { return h.DecodeBytes(bs) }
func (h *noopDrv) DecodeBytes(bs []byte, isstring, zerocopy bool) []byte { return h.B[h.m(len(h.B))] }
func (h *noopDrv) ReadEnd() { h.end() }
// toggle map/slice
func (h *noopDrv) ReadMapStart() int { h.start(true); return h.m(10) }
func (h *noopDrv) ReadArrayStart() int { h.start(false); return h.m(10) }
func (h *noopDrv) ContainerType() (vt valueType) {
// return h.m(2) == 0
// handle kStruct, which will bomb is it calls this and doesn't get back a map or array.
// consequently, if the return value is not map or array, reset it to one of them based on h.m(7) % 2
// for kstruct: at least one out of every 2 times, return one of valueTypeMap or Array (else kstruct bombs)
// however, every 10th time it is called, we just return something else.
var vals = [...]valueType{valueTypeArray, valueTypeMap}
// ------------ TAKE ------------
// if h.cb%2 == 0 {
// if h.ct == valueTypeMap || h.ct == valueTypeArray {
// } else {
// h.ct = vals[h.m(2)]
// }
// } else if h.cb%5 == 0 {
// h.ct = valueType(h.m(8))
// } else {
// h.ct = vals[h.m(2)]
// }
// ------------ TAKE ------------
// if h.cb%16 == 0 {
// h.ct = valueType(h.cb % 8)
// } else {
// h.ct = vals[h.cb%2]
// }
h.ct = vals[h.cb%2]
h.cb++
return h.ct
// if h.ct == valueTypeNil || h.ct == valueTypeString || h.ct == valueTypeBytes {
// return h.ct
// }
// return valueTypeUnset
// TODO: may need to tweak this so it works.
// if h.ct == valueTypeMap && vt == valueTypeArray || h.ct == valueTypeArray && vt == valueTypeMap {
// h.cb = !h.cb
// h.ct = vt
// return h.cb
// }
// // go in a loop and check it.
// h.ct = vt
// h.cb = h.m(7) == 0
// return h.cb
}
func (h *noopDrv) TryDecodeAsNil() bool {
if h.mk {
return false
} else {
return h.m(8) == 0
}
}
func (h *noopDrv) DecodeExt(rv interface{}, xtag uint64, ext Ext) uint64 {
return 0
}
func (h *noopDrv) DecodeNaked() {
// use h.r (random) not h.m() because h.m() could cause the same value to be given.
var sk int
if h.mk {
// if mapkey, do not support values of nil OR bytes, array, map or rawext
sk = h.r(7) + 1
} else {
sk = h.r(12)
}
n := &h.d.n
switch sk {
case 0:
n.v = valueTypeNil
case 1:
n.v, n.b = valueTypeBool, false
case 2:
n.v, n.b = valueTypeBool, true
case 3:
n.v, n.i = valueTypeInt, h.DecodeInt(64)
case 4:
n.v, n.u = valueTypeUint, h.DecodeUint(64)
case 5:
n.v, n.f = valueTypeFloat, h.DecodeFloat(true)
case 6:
n.v, n.f = valueTypeFloat, h.DecodeFloat(false)
case 7:
n.v, n.s = valueTypeString, h.DecodeString()
case 8:
n.v, n.l = valueTypeBytes, h.B[h.m(len(h.B))]
case 9:
n.v = valueTypeArray
case 10:
n.v = valueTypeMap
default:
n.v = valueTypeExt
n.u = h.DecodeUint(64)
n.l = h.B[h.m(len(h.B))]
}
h.ct = n.v
return
}
```
|
Medvedki () is the name of several rural localities in Russia.
Arkhangelsk Oblast
As of 2022, one rural locality in Arkhangelsk Oblast bears this name:
Medvedki, Arkhangelsk Oblast, a village in Votlazhemsky Selsoviet of Kotlassky District
Ivanovo Oblast
As of 2022, one rural locality in Ivanovo Oblast bears this name:
Medvedki, Ivanovo Oblast, a village in Puchezhsky District
Kaluga Oblast
As of 2022, one rural locality in Kaluga Oblast bears this name:
Medvedki, Kaluga Oblast, a village in Meshchovsky District
Kostroma Oblast
As of 2022, four rural localities in Kostroma Oblast bear this name:
Medvedki, Ostrovsky District, Kostroma Oblast, a village in Klevantsovskoye Settlement of Ostrovsky District
Medvedki, Severnoye Settlement, Susaninsky District, Kostroma Oblast, a village in Severnoye Settlement of Susaninsky District
Medvedki, Severnoye Settlement, Susaninsky District, Kostroma Oblast, a village in Severnoye Settlement of Susaninsky District
Medvedki, Sumarokovskoye Settlement, Susaninsky District, Kostroma Oblast, a village in Sumarokovskoye Settlement of Susaninsky District
Moscow Oblast
As of 2022, two rural localities in Moscow Oblast bear this name:
Medvedki, Istrinsky District, Moscow Oblast, a village in Yadrominskoye Rural Settlement of Istrinsky District
Medvedki, Volokolamsky District, Moscow Oblast, a village in Ostashevskoye Rural Settlement of Volokolamsky District
Oryol Oblast
As of 2022, one rural locality in Oryol Oblast bears this name:
Medvedki, Oryol Oblast, a village in Medvedkovsky Selsoviet of Bolkhovsky District
Smolensk Oblast
As of 2022, five rural localities in Smolensk Oblast bear this name:
Medvedki, Demidovsky District, Smolensk Oblast, a village under the administrative jurisdiction of Demidovskoye Urban Settlement of Demidovsky District
Medvedki, Kholm-Zhirkovsky District, Smolensk Oblast, a village in Tupikovskoye Rural Settlement of Kholm-Zhirkovsky District
Medvedki, Novoduginsky District, Smolensk Oblast, a village in Izvekovskoye Rural Settlement of Novoduginsky District
Medvedki, Sychyovsky District, Smolensk Oblast, a village in Bekhteyevskoye Rural Settlement of Sychyovsky District
Medvedki, Ugransky District, Smolensk Oblast, a village in Rusanovskoye Rural Settlement of Ugransky District
Tula Oblast
As of 2022, three rural localities in Tula Oblast bear this name:
Medvedki, Chernsky District, Tula Oblast, a village in Fedorovskaya Rural Administration of Chernsky District
Medvedki, Leninsky District, Tula Oblast, a selo in Aleshinsky Rural Okrug of Leninsky District
Medvedki, Venyovsky District, Tula Oblast, a selo in Gatsky Rural Okrug of Venyovsky District
Vologda Oblast
As of 2022, one rural locality in Vologda Oblast bears this name:
Medvedki, Vologda Oblast, a village in Krasavinsky Selsoviet of Velikoustyugsky District
Yaroslavl Oblast
As of 2022, two rural localities in Yaroslavl Oblast bear this name:
Medvedki, Danilovsky District, Yaroslavl Oblast, a village in Shagotsky Rural Okrug of Danilovsky District
Medvedki, Tutayevsky District, Yaroslavl Oblast, a village in Metenininsky Rural Okrug of Tutayevsky District
|
Kameron is a settlement in the administrative district of Gmina Czersk, within Chojnice County, Pomeranian Voivodeship, in northern Poland. It lies approximately south-east of Czersk, east of Chojnice, and south-west of the regional capital Gdańsk.
For details of the history of the region, see History of Pomerania.
References
Kameron
|
```php
<?php
/**
* Tests that the old Requests class is included
* for plugins or themes that still use it.
*
* @group http
*/
class Tests_HTTP_IncludeOldRequestsClass extends WP_UnitTestCase {
/**
* @ticket 57341
*
* @coversNothing
*/
public function test_should_include_old_requests_class() {
$this->expectDeprecation();
$this->expectDeprecationMessage( 'The PSR-0 `Requests_...` class names in the Requests library are deprecated.' );
new Requests();
}
}
```
|
Silvia Richards (born Silvia Hope Goodenough) was an American screenwriter who worked on a number of films in the 1940s and 1950s, including the film noir Ruby Gentry and the Western Rancho Notorious. She also wrote for television in the 1950s and early 1960s.
Origins
Richards was born in Indianola, Iowa, to Aubrey Goodenough and Gertrude Pearl. She attended high school in Colorado Springs, Colorado. She married Robert L. Richards in 1938 in Alexandra, Virginia. The two lived in New York for a time, where their son David was born; they'd eventually move to Hollywood to launch careers as screenwriters.
HUAC hearings
Richards' work was interrupted by the McCarthy Hearings. She was called in as a friendly witness for HUAC but claimed that she went along with HUAC because she feared for the well-being of her two young sons. Her action helped cause a divorce from her husband, screenwriter Robert L. Richards, who would not testify for the committee. Robert Richards was blacklisted and forced to write under various pseudonyms for the remainder of his career.
Later life
Following her divorce from Richards, Silvia married screenwriter A. I. (Buzz) Bezzerides, another victim of the McCarthy-era blacklist, in 1953. She assisted him in developing his writing ideas but stopped writing on her own. She died in 1999, while Bezzerides lived until 2007.
Selected filmography
1952 Ruby Gentry (screenplay)
1952 Rancho Notorious (original story)
1951 Battle of Powder River (screenplay)
1947 Secret Beyond the Door... (screenplay)
1947 Possessed (screenplay)
References
External links
1915 births
1999 deaths
American women screenwriters
20th-century American women writers
20th-century American screenwriters
|
```python
import json
import os
from collections import namedtuple
from pathlib import Path
from typing import Any, Callable, Dict, List, Optional, Tuple, Union
from PIL import Image
from .utils import extract_archive, iterable_to_str, verify_str_arg
from .vision import VisionDataset
class Cityscapes(VisionDataset):
"""`Cityscapes <path_to_url`_ Dataset.
Args:
root (str or ``pathlib.Path``): Root directory of dataset where directory ``leftImg8bit``
and ``gtFine`` or ``gtCoarse`` are located.
split (string, optional): The image split to use, ``train``, ``test`` or ``val`` if mode="fine"
otherwise ``train``, ``train_extra`` or ``val``
mode (string, optional): The quality mode to use, ``fine`` or ``coarse``
target_type (string or list, optional): Type of target to use, ``instance``, ``semantic``, ``polygon``
or ``color``. Can also be a list to output a tuple with all specified target types.
transform (callable, optional): A function/transform that takes in a PIL image
and returns a transformed version. E.g, ``transforms.RandomCrop``
target_transform (callable, optional): A function/transform that takes in the
target and transforms it.
transforms (callable, optional): A function/transform that takes input sample and its target as entry
and returns a transformed version.
Examples:
Get semantic segmentation target
.. code-block:: python
dataset = Cityscapes('./data/cityscapes', split='train', mode='fine',
target_type='semantic')
img, smnt = dataset[0]
Get multiple targets
.. code-block:: python
dataset = Cityscapes('./data/cityscapes', split='train', mode='fine',
target_type=['instance', 'color', 'polygon'])
img, (inst, col, poly) = dataset[0]
Validate on the "coarse" set
.. code-block:: python
dataset = Cityscapes('./data/cityscapes', split='val', mode='coarse',
target_type='semantic')
img, smnt = dataset[0]
"""
# Based on path_to_url
CityscapesClass = namedtuple(
"CityscapesClass",
["name", "id", "train_id", "category", "category_id", "has_instances", "ignore_in_eval", "color"],
)
classes = [
CityscapesClass("unlabeled", 0, 255, "void", 0, False, True, (0, 0, 0)),
CityscapesClass("ego vehicle", 1, 255, "void", 0, False, True, (0, 0, 0)),
CityscapesClass("rectification border", 2, 255, "void", 0, False, True, (0, 0, 0)),
CityscapesClass("out of roi", 3, 255, "void", 0, False, True, (0, 0, 0)),
CityscapesClass("static", 4, 255, "void", 0, False, True, (0, 0, 0)),
CityscapesClass("dynamic", 5, 255, "void", 0, False, True, (111, 74, 0)),
CityscapesClass("ground", 6, 255, "void", 0, False, True, (81, 0, 81)),
CityscapesClass("road", 7, 0, "flat", 1, False, False, (128, 64, 128)),
CityscapesClass("sidewalk", 8, 1, "flat", 1, False, False, (244, 35, 232)),
CityscapesClass("parking", 9, 255, "flat", 1, False, True, (250, 170, 160)),
CityscapesClass("rail track", 10, 255, "flat", 1, False, True, (230, 150, 140)),
CityscapesClass("building", 11, 2, "construction", 2, False, False, (70, 70, 70)),
CityscapesClass("wall", 12, 3, "construction", 2, False, False, (102, 102, 156)),
CityscapesClass("fence", 13, 4, "construction", 2, False, False, (190, 153, 153)),
CityscapesClass("guard rail", 14, 255, "construction", 2, False, True, (180, 165, 180)),
CityscapesClass("bridge", 15, 255, "construction", 2, False, True, (150, 100, 100)),
CityscapesClass("tunnel", 16, 255, "construction", 2, False, True, (150, 120, 90)),
CityscapesClass("pole", 17, 5, "object", 3, False, False, (153, 153, 153)),
CityscapesClass("polegroup", 18, 255, "object", 3, False, True, (153, 153, 153)),
CityscapesClass("traffic light", 19, 6, "object", 3, False, False, (250, 170, 30)),
CityscapesClass("traffic sign", 20, 7, "object", 3, False, False, (220, 220, 0)),
CityscapesClass("vegetation", 21, 8, "nature", 4, False, False, (107, 142, 35)),
CityscapesClass("terrain", 22, 9, "nature", 4, False, False, (152, 251, 152)),
CityscapesClass("sky", 23, 10, "sky", 5, False, False, (70, 130, 180)),
CityscapesClass("person", 24, 11, "human", 6, True, False, (220, 20, 60)),
CityscapesClass("rider", 25, 12, "human", 6, True, False, (255, 0, 0)),
CityscapesClass("car", 26, 13, "vehicle", 7, True, False, (0, 0, 142)),
CityscapesClass("truck", 27, 14, "vehicle", 7, True, False, (0, 0, 70)),
CityscapesClass("bus", 28, 15, "vehicle", 7, True, False, (0, 60, 100)),
CityscapesClass("caravan", 29, 255, "vehicle", 7, True, True, (0, 0, 90)),
CityscapesClass("trailer", 30, 255, "vehicle", 7, True, True, (0, 0, 110)),
CityscapesClass("train", 31, 16, "vehicle", 7, True, False, (0, 80, 100)),
CityscapesClass("motorcycle", 32, 17, "vehicle", 7, True, False, (0, 0, 230)),
CityscapesClass("bicycle", 33, 18, "vehicle", 7, True, False, (119, 11, 32)),
CityscapesClass("license plate", -1, -1, "vehicle", 7, False, True, (0, 0, 142)),
]
def __init__(
self,
root: Union[str, Path],
split: str = "train",
mode: str = "fine",
target_type: Union[List[str], str] = "instance",
transform: Optional[Callable] = None,
target_transform: Optional[Callable] = None,
transforms: Optional[Callable] = None,
) -> None:
super().__init__(root, transforms, transform, target_transform)
self.mode = "gtFine" if mode == "fine" else "gtCoarse"
self.images_dir = os.path.join(self.root, "leftImg8bit", split)
self.targets_dir = os.path.join(self.root, self.mode, split)
self.target_type = target_type
self.split = split
self.images = []
self.targets = []
verify_str_arg(mode, "mode", ("fine", "coarse"))
if mode == "fine":
valid_modes = ("train", "test", "val")
else:
valid_modes = ("train", "train_extra", "val")
msg = "Unknown value '{}' for argument split if mode is '{}'. Valid values are {{{}}}."
msg = msg.format(split, mode, iterable_to_str(valid_modes))
verify_str_arg(split, "split", valid_modes, msg)
if not isinstance(target_type, list):
self.target_type = [target_type]
[
verify_str_arg(value, "target_type", ("instance", "semantic", "polygon", "color"))
for value in self.target_type
]
if not os.path.isdir(self.images_dir) or not os.path.isdir(self.targets_dir):
if split == "train_extra":
image_dir_zip = os.path.join(self.root, "leftImg8bit_trainextra.zip")
else:
image_dir_zip = os.path.join(self.root, "leftImg8bit_trainvaltest.zip")
if self.mode == "gtFine":
target_dir_zip = os.path.join(self.root, f"{self.mode}_trainvaltest.zip")
elif self.mode == "gtCoarse":
target_dir_zip = os.path.join(self.root, f"{self.mode}.zip")
if os.path.isfile(image_dir_zip) and os.path.isfile(target_dir_zip):
extract_archive(from_path=image_dir_zip, to_path=self.root)
extract_archive(from_path=target_dir_zip, to_path=self.root)
else:
raise RuntimeError(
"Dataset not found or incomplete. Please make sure all required folders for the"
' specified "split" and "mode" are inside the "root" directory'
)
for city in os.listdir(self.images_dir):
img_dir = os.path.join(self.images_dir, city)
target_dir = os.path.join(self.targets_dir, city)
for file_name in os.listdir(img_dir):
target_types = []
for t in self.target_type:
target_name = "{}_{}".format(
file_name.split("_leftImg8bit")[0], self._get_target_suffix(self.mode, t)
)
target_types.append(os.path.join(target_dir, target_name))
self.images.append(os.path.join(img_dir, file_name))
self.targets.append(target_types)
def __getitem__(self, index: int) -> Tuple[Any, Any]:
"""
Args:
index (int): Index
Returns:
tuple: (image, target) where target is a tuple of all target types if target_type is a list with more
than one item. Otherwise, target is a json object if target_type="polygon", else the image segmentation.
"""
image = Image.open(self.images[index]).convert("RGB")
targets: Any = []
for i, t in enumerate(self.target_type):
if t == "polygon":
target = self._load_json(self.targets[index][i])
else:
target = Image.open(self.targets[index][i]) # type: ignore[assignment]
targets.append(target)
target = tuple(targets) if len(targets) > 1 else targets[0]
if self.transforms is not None:
image, target = self.transforms(image, target)
return image, target
def __len__(self) -> int:
return len(self.images)
def extra_repr(self) -> str:
lines = ["Split: {split}", "Mode: {mode}", "Type: {target_type}"]
return "\n".join(lines).format(**self.__dict__)
def _load_json(self, path: str) -> Dict[str, Any]:
with open(path) as file:
data = json.load(file)
return data
def _get_target_suffix(self, mode: str, target_type: str) -> str:
if target_type == "instance":
return f"{mode}_instanceIds.png"
elif target_type == "semantic":
return f"{mode}_labelIds.png"
elif target_type == "color":
return f"{mode}_color.png"
else:
return f"{mode}_polygons.json"
```
|
Marble Hall () was the private residence of Sir Catchick Paul Chater, co-founder of Hongkong Land. It was situated at 1 Conduit Road, Hong Kong, and constructed 1901–1904 from imported European marble. Historians regard it as one of the finest ever examples of architecture in Hong Kong.
History
Sir Paul chose a site above Victoria, 500 feet above sea level. Designed by Leigh & Orange, a most sumptuous residence was constructed from imported marble quarried in Italy and Greece and finished in Belgium. It had extensive gardens, and a gatehouse. Historians regard 'Marble Hall' as among the finest constructions ever executed in Hong Kong. Externally, it was constructed of stuccoed brick. Inside was a magnificent staircase made from Italian marble; it was finished in teak and mahogany.(p41)
Chater died in 1926, and bequeathed Marble Hall and its entire contents, including his unique collection of porcelain and paintings, to Hong Kong. While Chater's wife was allowed to live in Marble Hall as a life tenant until her death in 1935, some source mention that she may have left Hong Kong in 1927. Ownership passed to the government after her death. It became "Admiralty House" – the official residence of the Naval Commander-in-Chief, and was commandeered by Japanese during their occupation.
Post-war
Marble Hall accidentally burned down in 1946, and the government buildings occupied the site since its demolition in 1953. Government residences named 'Chater Hall Flats' are today located on the site of Marble Hall.
All that remains today is the gatekeeper's lodge, which has been given a Grade 2 classification by the Antiquities Advisory Board.
References
External links
Antiquities Advisory Board. Historic Building Appraisal Gatekeeper's Lodge of Marble Hall, No. 1 Conduit Road, Mid-Levels, Hong Kong Pictures
Houses completed in 1904
Former buildings and structures in Hong Kong
Houses in Hong Kong
|
The Fyrish Monument is a monument built in 1782 on Fyrish Hill (), in Fyrish in Evanton, near Alness, Easter Ross, Scotland, on the orders of Sir Hector Munro, 8th of Novar, a native lord of the area who had served in India as a general. As the local population were being cleared off the land they had worked for centuries by the Lords of the Land, survival was a problem and so it was built to keep the locals in labour. It was said that Sir Hector rolled stones from the top of the hill to the bottom, thereby extending the amount of time worked and paying the labourers for additional hours.
It represents the Gate of Negapatam, a port in Madras, India, which General Munro took for the British in 1781. It is visible from almost anywhere in the parishes of Kiltearn and Alness.
The site of the monument provides an extensive view over the Cromarty Firth and beyond, and Ben Wyvis can be seen clearly, especially impressive if snow-covered. A path to the top starts at a car park northeast of the hill at OS grid NH627715.
References
Sources
https://web.archive.org/web/20061002181022/http://www.clanmunro.org.uk/merchandise_files/maps.htm
Touring Guide Scotland, p. 151.
External links
Map from Streetmap.co.uk
Route to the monument from Walkhighlands
3d model representing the monument
Buildings and structures in Highland (council area)
Monuments and memorials in Scotland
Ross and Cromarty
Tourist attractions in Highland (council area)
Category B listed buildings in Highland (council area)
Folly buildings in Scotland
|
Mary Lee (October 24, 1924 – June 6, 1996) was a big band singer and B movie actress from the late 1930s into the 1940s, appearing mostly in Westerns. She did not make any screen appearances after 1944.
Early years
Born Mary Lee Wooters in Centralia, Illinois, on October 24, 1924, her mother and father were Lela Myrtle Telford and Louis Ellis Wooters. They had four daughters, Vera Mae, Dorris Lucille, Mary Lee, and Norma Jean. Dorris Lucille died shortly after birth in 1923. When Mary Lee was four years old the family moved to Ottawa, Illinois, where Louis Wooters opened a barbershop. At age six, Mary Lee began singing with her father and older sister, Vera, who were already performing country and popular songs over a low power radio station and at various events in the LaSalle County, Illinois, area.
Music
In mid-June 1938, Lee joined the Ted Weems Orchestra, traveling with the group four months a year, accompanied by either her mother or her older sister as companion and teacher. She recorded five sides with the Weems band including "Back to Smokey Mountain", a duet with Elmo Tanner from an October 5, 1939 session, issued as Decca 2829-B. In the summer of 1942, Lee recorded eight tracks in two sessions with Bob Crosby's Bob Cats, reissued in Australia on Swaggie CD 504 as Bob Crosby's Bob Cats - Volume Four 1941-1942.
Decades later a review of Varèse Sarabande CD VSD-5910 / Gene Autry With His Little Darlin' Mary Lee in the trade publication Billboard described Lee as a "clear-voiced, expressive singer", noting that she was "heralded as Republic's answer to MGM's Judy Garland." The CD, released in 1998, is a compilation of songs from Lee's appearances in Gene Autry films including "Give Out With a Song" from Gaucho Serenade (May 10, 1940) and "Sing A Song Of Laughter" from Ridin' on a Rainbow (June 24, 1941).
Film
Lee's first screen appearance was with Warner Bros., in Nancy Drew... Reporter, released February 18, 1939, where she portrayed Mary Nickerson, the younger sister of Nancy Drew's (Bonita Granville) boyfriend, Ted Nickerson (Frank Thomas, Jr.). The film utilized her vocal talents in the "Nursery Rhyme Medley". In the fall of 1939, Mary Lee accepted a job at Republic Pictures where she starred alongside Gene Autry and June Storey in South of the Border (15 December 1939). Republic signed her to a five-year contract in June 1940. She starred in a total of nine Autry films, the first five of those with June Storey, always playing the leading lady's younger sister "Patsy" except in Melody Ranch (15 November 1940) where her character's name was "Penny". Mary Lee's last appearance in an Autry film was in The Singing Hill (26 April 1941) with Virginia Dale. She also appeared in nine additional Republic feature films, including Barnyard Follies in 1940 with June Storey and younger sister Norma Jean Wooters and two Roy Rogers films in 1944, plus three of Republic's "Meet the Stars" shorts.
Her other films included Rancho Grande, Ride, Tenderfoot, Ride, Sing, Dance, Plenty Hot, Carolina Moon and Gaucho Serenade.
"Nobody's Darling" is a 1943 American musical film directed by Anthony Mann and written by Olive Cooper. The film stars Mary Lee(as Janie Farnsworth), Louis Calhern, Gladys George, Jackie Moran, Lee Patrick and Benny Bartlett. The film was released on August 27, 1943, by Republic Pictures
World War II
Gene Autry enlisted in July 1942 in the U.S. Army Air Corps, where he would serve for the duration of the war plus six months. With Autry unavailable, Republic soon billed Mary Lee as "America's Little Sister" and starred her in B musicals Shantytown (20 April 1943), Nobody's Darling (27 August 1943), and Three Little Sisters (31 July 1944) in addition to giving her starring roles in the two Roy Rogers films. In her first Rogers film, Cowboy and the Senorita (13 May 1944), Roy's first picture with Dale Evans, Mary Lee was given second billing above Dale and is featured in the film's elaborate musical productions. There, with the Sons of the Pioneers (Ken Carson, Karl Farr, Bob Nolan, Tim Spencer, and Hugh Farr), Mary Lee sings "She Wore a Yellow Ribbon". In the finale, Dale Evans, Mary Lee, and Roy Rogers sing "Enchilada Man" and "Cowboy and the Senorita" with the Sons of the Pioneers. Then, in Song of Nevada (5 August 1944), Mary Lee's last screen appearance, backed by the Sons of the Pioneers, she sings "The Wigwam Song", written by Glenn Spencer, and reprises it in the Song of Nevada Finale. Compare Mary Lee's height there at age nineteen to that of Dale Evans who was tall.
Having married in 1943, with a child born in November 1944, and her five-year contract at Republic Pictures running out in February 1945, Mary Lee did not re-sign with Republic Pictures but may have done some further work with Ted Weems.
Personal life
In Ottawa, Illinois, Mary Lee attended Lincoln Elementary School, graduating from the eighth grade in 1938. In late 1939 or early 1940 the Wooters family moved from Ottawa to Los Angeles. There Mary Lee attended Mar-Ken School, a private school in Hollywood for professional children. As a Junior she was elected Secretary of the Student Body. She graduated from Mar-Ken in 1942. On November 12, 1943, Mary Lee Wooters married Harry J. Banan, First Sergeant, United States Army, who had recently returned from World War II service at Guadalcanal, to whom she would remain married until his death in 1990. Together they had two children, Harry Philip and Laura Lee. In the late 1950s through the 1960s the Banans resided in Pullman, Washington where M.Sgt. Harry J. Banan was an Army ROTC instructor at Washington State University. Later, after they returned to California, Mary Lee was an account teller at Bank of America where she worked for 15 years.
Death
Mary Lee (Wooters) Banan died in Sacramento, California on June 6, 1996, aged 71, and is interred alongside her husband at Sacramento's East Lawn Sierra Hills Cemetery.
Soundtracks and reissues on CD
Bob Crosby's Bob Cats - Volume Four 1941-1942, 8 tracks, CD-502, Swaggie Records, Australia
Gene Autry: The Singing Cowboy - Chapter Two, 2 tracks, VSD-5909 Varèse Sarabande Records, United States, 1998
Gene Autry: With His Little Darlin' Mary Lee, 17 tracks, VSD-5910, Varèse Sarabande Records, United States, 1998
References
External links
Mary Lee biodata
People from Centralia, Illinois
Actresses from Illinois
American film actresses
1924 births
1996 deaths
20th-century American actresses
|
Greg Harrison (born May 4, 1969, in Michigan) is an American film director and editor.
He graduated from Michigan State University where he got his early film experience with MSU Telecasters.
He has directed films such as Groove (2000) and November (2004), both of which were produced by Danielle Renfrew.
References
External links
1969 births
Living people
Michigan State University alumni
|
Catholic University Los Angeles of Chimbote (Universidad Católica Los Ángeles de Chimbote; Uladech Católica or Uladech) is a Catholic university in Chimbote, Peru. The university's rector as of 2013 is Ing. Dr. Julio B. Domínguez Granda.
The university opened in 1985. Law No. 24163 established the university.
References
External links
Universidad Católica Los Ángeles de Chimbote
Professional School of Administration
Professional School of Tourism Management
Catholic universities and colleges in Peru
Buildings and structures in Ancash Region
Universities and colleges established in 1985
1985 establishments in Peru
|
Sir Gavin Alexander Williamson (born 25 June 1976) is a British politician who most recently served as Minister of State without Portfolio from 25 October to 8 November 2022. He has been the Member of Parliament (MP) for South Staffordshire since 2010. A member of the Conservative Party, Williamson previously served in Theresa May's Cabinet as Government Chief Whip from 2016 to 2017, Secretary of State for Defence from 2017 to 2019, and as Secretary of State for Education under Boris Johnson from 2019 to 2021.
Williamson was born in Scarborough, North Yorkshire, and was educated at Raincliffe School, Scarborough Sixth Form College and the University of Bradford. He was chair of a Conservative student body from 1997 to 1998. He served on the North Yorkshire County Council from 2001 to 2005. In the 2005 general election, he stood to become MP for Blackpool North and Fleetwood, without success.
Williamson was elected as MP for South Staffordshire at the 2010 general election. He served in David Cameron's governments as Parliamentary Private Secretary to the Secretary of State for Transport, aiding Patrick McLoughlin, prior to being appointed Parliamentary Private Secretary to the Prime Minister in October 2013. Following Cameron's resignation, Williamson supported Theresa May's bid to become Conservative leader; May appointed Williamson as Chief Whip in her first government in July 2016. He later served as Secretary of State for Defence from November 2017 to May 2019, when he was dismissed following a leak from the National Security Council; Williamson denied leaking the information about Huawei's potential involvement in the British 5G network.
After supporting Boris Johnson's campaign to succeed May as Conservative leader, Williamson returned to the cabinet as Secretary of State for Education in July 2019. He served in the role during the early part of the COVID-19 pandemic, including times when schools were closed to most children, and was criticised for the 2020 school exam grading controversy. In September 2021, he was dismissed as Education Secretary when Johnson reshuffled his cabinet. He was subsequently nominated by Johnson for a knighthood, which he obtained in March 2022. Williamson supported Rishi Sunak in his two attempts to become Conservative leader; following Sunak's election in October 2022, he appointed Williamson as Minister of State without Portfolio.
In November 2022 Williamson resigned, stating he wanted to clear his name "of any wrongdoing" in relation to allegations, which he "strenuously denied", of him having bullied former Chief Whip Wendy Morton and of bullying behaviour previously during his own tenure as Chief Whip and as Defence Secretary.
Early life and career
Williamson was born in Scarborough, North Yorkshire. His father Ray was a local government worker, and his mother Beverly worked in a job centre. They were both Labour Party voters. He attended East Ayton Primary School and for his secondary education, Raincliffe School, a comprehensive. He studied A-Levels in History, Economics, and Government and Politics at Scarborough Sixth Form College. From 1994 to 1997, he completed a BSc in Social Sciences from the University of Bradford.
Williamson was national chair of Conservative Students in 1997, the penultimate chair before it was merged into Conservative Future in 1998. As chair he accused the National Union of Students (NUS) of acting like a "branch of the Labour Party". In 2001, he was elected as the Conservative county councillor for Seamer division in North Yorkshire. In 2003, he was appointed as the County Council's "Young People's Champion". He did not stand for re-election in 2005. Williamson is a former deputy chairman of Staffordshire Area Conservatives, chairman of Stoke-on-Trent Conservative Association and vice-chairman of Derbyshire Dales Conservative Association.
Williamson worked as a manager in fireplace manufacturer Elgin & Hall, a subsidiary of AGA, until 2004. Williamson had become managing director of Aynsley China, a Staffordshire-based pottery firm by 2005. It sold ceramic tableware and he later became co-owner. In April 2005, Williamson was quoted in reports on the consumer rush to buy items with the wrong wedding date on for Charles and Camilla's wedding. He told The Daily Telegraph, "We've literally had fights in our own retail shops. On the first day after the announcement I went into our factory shop in Stoke-on-Trent and we had people fighting over the last plate that we had on the shop floor. I think everybody has decided that this is going to be their pension."
He has also worked for NPS North West Limited, an architectural design firm, until he became an MP in 2010.
In the 2005 general election, he stood unsuccessfully as the Conservative Party candidate in Blackpool North and Fleetwood. After 2005, Williamson moved to Derbyshire.
Parliamentary career
Early parliamentary career (2010–2011)
In January 2010, Williamson was selected as the Conservative candidate in South Staffordshire for the 2010 general election. The incumbent, Patrick Cormack, had announced that he was retiring. The selection went to five ballots, but in the end Williamson won over local councillor Robert Light in the final ballot. Williamson was subsequently elected with a majority of 16,590 votes. Shortly after being elected, he cited his political inspiration as Rab Butler and, when asked what department of any he would most like to lead, he said the Department for Business, Innovation and Skills as it is "business and manufacturing that can lead the way out of difficult economic times".
Williamson made his maiden speech on 8 June 2010, on the same day as Nicky Morgan and Kwasi Kwarteng. During his speech, he said that "We do not sing enough the praises of our designers, engineers and manufacturers. We need to change that ethos and have a similar one to that of Germany or Japan. We will have a truly vibrant economy only when we recreate the Victorian spirit of ingenuity and inventiveness that made Britain such a vibrant country, as I am sure it will be again." Williamson campaigned on a number of issues in his first year in Parliament.
In July 2010, Williamson called for a new law to allow local authorities to clamp down on car boot sales that disrupted traffic flow, citing villages in his constituency as examples. In June 2011, he expressed support for postwoman Julie Roberts, who had been suspended after clinging for over a mile onto the bonnet of her post van that had been stolen. He said that "People want her back in work and they want the Royal Mail to show some common sense and some common decency" and asked the Royal Mail to reinstate her into her old job. Williamson was one of several MPs who was absent or abstained on 21 March 2011 vote on supporting UN-backed action in Libya. The vote ultimately passed 557–13.
Parliamentary Private Secretary (2011–2016)
In October 2011, Williamson was appointed as Parliamentary Private Secretary to the minister of state for Northern Ireland, Hugo Swire. He replaced Conor Burns, who became Owen Paterson's new PPS. In September 2012, Williamson became PPS to Patrick McLoughlin, Secretary of State for Transport, and in 2013 became PPS to the prime minister, David Cameron.
In Parliament, Williamson was a member of the Northern Ireland Affairs Select Committee and was Chair of the All Party Parliamentary Group on Motor Neurone Disease.
Williamson supported the United Kingdom's remain campaign during the 2016 EU membership referendum.
Chief Whip (2016–2017)
Following David Cameron's resignation, Williamson "privately vowed" to stop the front-runner Boris Johnson from becoming Conservative Party leader. He assessed Theresa May to be the likeliest candidate to defeat Johnson, offered his help to her, and was invited to be her parliamentary campaign manager. When May became prime minister, Williamson was appointed Chief Whip.
Following the Conservative–DUP agreement after the 2017 general election, Williamson visited Belfast to discuss arrangements with the DUP.
Defence Secretary (2017–2019)
Williamson was appointed Secretary of State for Defence on 2 November 2017 after the resignation of Sir Michael Fallon the preceding evening.
In February 2018, Williamson dined with Lubov Chernukhin, the wife of a former Putin minister, in exchange for a £30,000 donation to the Conservative party. Later that month, Williamson alleged that the leader of the Labour Party, Jeremy Corbyn, in meeting a Czech diplomat (later revealed to be a spy) during the 1980s, had "betray[ed]" his country. In response to the statement, a spokesman for Corbyn stated: "Gavin Williamson should focus on his job and not give credence to entirely false and ridiculous smears".
Williamson has supported the Saudi Arabian-led military intervention in Yemen against the Shia Houthis despite concerns from human rights activists and Labour MPs about war crimes allegedly committed by the Saudi military.
On 15 March 2018, in the wake of the Salisbury poisoning, Williamson answered a question about Russia's potential response to the UK's punitive measures against Russia by saying that "frankly, Russia should go away, and it should shut up". Major-General Igor Konashenkov, the spokesman of the Russian Defence Ministry, said: "The market wench talk that British defence secretary Gavin Williamson resorted to reflects his extreme intellectual impotency". Williamson's remark was quoted by the president of Ukraine, Petro Poroshenko, who posted a comment on his official Twitter account: "The Kremlin's 'chemical attack' in the UK is nothing but an encroachment on British sovereignty. And our message to Russia is the same as that of British defense secretary Gavin Williamson: 'shut up and go away'."
In December 2018, Williamson expressed "grave" and "very deep concerns" about the Chinese telecommunications company Huawei providing technology to upgrade Britain's services to 5G. He accused China of acting "sometimes in a malign way". China's Defence Ministry spokesman Wu Qian criticised Williamson's comments, saying: "The remarks just reinforced the deep-rooted ignorance, prejudice and anxiety among some British people."
On 11 February 2019, Williamson delivered the speech "Defence in Global Britain" at the Royal United Services Institute outlining the future direction of the British armed forces. The speech, among other things, outlined plans to send Britain's new aircraft carrier to the Pacific; the Chinese Government in turn cancelled trade talks with Chancellor of the Exchequer Philip Hammond and prompted Hammond to state that the decision to deploy the aircraft carrier was premature. The Mail on Sunday quoted an unnamed ally of Hammond comparing Williamson to Private Pike, a hapless character in the television sitcom Dad's Army.
On 1 May 2019, Williamson was asked to resign from his position as Defence Secretary, following the leaking of confidential National Security Council information related to Huawei's potential involvement in the UK's 5G network. He refused to resign because he felt this would incriminate him and be seen as an admission that he was responsible for the leak, and was therefore sacked. Theresa May said that she had "compelling evidence" that Williamson had leaked the information and that she had "lost confidence in his ability to serve in his role". Williamson vehemently denied the allegation, saying that he "swore on his children's lives he was not responsible", and said that a "thorough and formal inquiry" would have vindicated his position. At the time, opposition MPs called for a police investigation into the matter, but the matter was closed.
On 10 November 2022 The Guardian reported when Penny Mordaunt was defence secretary she had to deal with a security leak and the department believed her predecessor, Williamson caused the leak. There were fears the leak could put "our people's lives at risk". Three sources told the Guardian that the leak was considered so serious Mordaunt was ready to look for a D notice to warn media that publishing the information could endanger Britain's national security. Williamson denied leaking the second serious alleged leak. A former government insider said senior Ministry of Defence figures believed at the time that the leak "could only have come from Gavin" and "our people's lives were put at risk by it". They would not discuss the details about the alleged leak, for the same security reasons.
Boris Johnson Conservative leadership campaign (2019)
Williamson worked on Boris Johnson's campaign during the 2019 Conservative Party leadership election.
Education Secretary (2019–2021)
Williamson became Secretary of State for Education following Boris Johnson's election as Prime Minister on 24 July 2019.
Following deplatforming of history professor Selina Todd and former Home Secretary Amber Rudd by student societies at Oxford University, in March 2020 Williamson called for "robust action" to enforce free speech codes, and stated that the government would intervene to protect freedom of speech at universities if they failed to do so themselves. HuffPost reported that Williamson's department had drafted legislation to "strengthen academic freedom and free speech in universities". Williamson brought forward the legislation, titled the Higher Education (Freedom of Speech) Bill, in May 2021.
Early in the COVID-19 pandemic, the Prime Minister announced schools in England were to be closed to most children from 20 March 2020 until further notice. He said that exams in that academic year would not go ahead. On 6 January 2021, Williamson announced GCSE, AS and A-Level exams would once again not go ahead for students in the academic year, being replaced with teacher assessed grades.
On 15 September 2021, Williamson was dismissed as Education Secretary when Johnson reshuffled his cabinet.
Exams controversy
In August 2020, he apologised to schoolchildren for the disruption in the COVID-19 pandemic. He said "...where we haven't got everything great, of course, I'm incredibly sorry for that". There was considerable concern over the A-Level results which, due to all exams having been cancelled in 2020, were based on Ofqual-moderated teacher assessments rather than on moderated exam results. About 39% of results were below the teacher assessment (compared to 79% in 2019) – Ofqual accused some teachers of submitting "implausibly high" predictions. Ofqual rescinded the advice it had given on how the appeals system would operate. The Daily Telegraph reported that Williamson had repeatedly defended the algorithm method as the fairest way to produce grades avoiding grade inflation, though several Ofqual board members had come to believe the algorithm method had been shown to be politically unacceptable.
On 17 August 2020, Ofqual and Williamson announced that the algorithm method for calculating A Level results would be abandoned, and teacher assessments would be used instead, after pressure from within the Conservative Party and the claim that they had lost the confidence of the teaching profession. There were calls for Williamson to resign, for what The Daily Telegraph called "the fiasco". University admission caps were relaxed, as places had already been allocated based on the algorithm results and the change meant many more students would now meet their first-choice university admission offer grades. Teacher assessment would also be used instead of the Ofqual algorithm for GCSE results due to be announced three days later.
In January 2021, GCSE exams were cancelled. The education secretary stated that schools can use optional exams to decide their students' grades. In April 2021, Williamson said that a mobile phone policy ban would be introduced in schools; he also commented that students' behaviour had become worse over the period of lockdown in January. This comment was criticised by some parents, teachers, and headteachers, claiming that "schools already had bans in place" and that Williamson was "not focusing on important matters".
Backbenches (2021–2022)
Williamson returned to the backbenches after his dismissal as Education Secretary.
Williamson helped Rishi Sunak gain support among Conservative MPs during his failed leadership bid in the July-September 2022 Conservative Party leadership election. Williamson again supported Sunak in the October 2022 Conservative Party leadership election, which he won unopposed.
Minister of State without Portfolio (2022)
In October 2022, Williamson was appointed Minister of State without Portfolio, a cabinet position, by new Prime Minister Rishi Sunak.
Allegations of bullying and resignation
It was reported by Tortoise Media on 4 November 2022, followed by other news media, that in October 2022 Wendy Morton had made a formal complaint to the Conservative Party about text messages that Williamson had sent her on 13 September, during her tenure as Chief Whip under Prime Minister Liz Truss; Morton confirmed that she had submitted a complaint. The Sunday Times subsequently published Williamson's WhatsApp messages to Morton in full.
It was also reported that former Conservative chairman Jake Berry had warned Rishi Sunak, the prime minister, that a complaint about Williamson had been made during a private meeting. Sunak later acknowledged he knew of concerns but had not seen the specific texts, which he deemed "unacceptable". In one WhatsApp message, Williamson indicated his frustration that he had not received an invite to the state funeral of Elizabeth II, telling Morton "There is a price for everything", before describing her conduct as "absolutely disgusting". He said she had chosen to "fuck us all over". When challenged he responded that it looked "very shit" and that "perception becomes reality". A source, reported on 4 November 2022, said Williamson had not been told by the party of the formal complaint, but that he "strongly refutes these allegations", and would be "very happy to share all communications with the former chief whip with CCHQ [Conservative Campaign Headquarters] if needed".
On 6 November 2022 cabinet minister Oliver Dowden said that the messages to Morton had been sent "in the heat of the moment" and "should not have been sent". Williamson's messages included angry complaints that MPs who were not "favoured" by Liz Truss were being excluded from Queen Elizabeth's funeral. Labour's Ed Miliband said Williamson's reappointment was not in the public interest. Labour leader Keir Starmer and the Liberal Democrats called for Sunak to sack Williamson over the messages.
On 7 November 2022, The Guardian wrote that a current minister told The Times that Williamson called her to his office at a time she was campaigning about a politically sensitive matter and raised an issue about her private life "which she interpreted as a tacit threat". Unnamed "allies" of Williamson said it was not a threat, but was raised in a "pastoral capacity".
On 7 November 2022 Williamson denied accusations, reported in The Guardian, that he had used bullying language when he was Defence Secretary and had, on one occasion, told an unnamed senior civil servant at the Ministry of Defence to "slit your throat", and on another, to "jump out of the window". It was alleged that he had made the remarks with other civil servants present and the civil servant felt there was a sustained campaign of bullying. The unnamed source said that Williamson had "deliberately demeaned and intimidated" them. In a statement, Williamson said: "I strongly reject this allegation and have enjoyed good working relationships with the many brilliant officials I have worked with across government". The Guardian understood that Williamson did not deny using "those specific words". The former civil servant stated they would take matters to the ICGS due to the "extreme impact" the incidents had on their mental health.
By 7 November 2022 friends of Morton had told the BBC that she had not received an apology or any contact from Williamson. Rishi Sunak said the language used was "not acceptable", but said he still had confidence in Williamson. On 8 November Morton referred Williamson to the parliamentary Independent Complaints and Grievance Scheme. Chair of the Labour Party Anneliese Dodds said Morton's decision to report Williamson showed a "lack of faith in the Conservative Party complaints process".
On 8 November 2022 Williamson resigned, stating he "refutes the characterisation of these claims" and that he was resigning to avoid becoming a distraction for the government and to enable him to "comply fully with the complaints process that is underway and clear my name of any wrongdoing".
On 9 November 2022 two more sources told The Guardian that, when he was Chief Whip, Williamson was heard joking or boasting about how his tactics affected the mental health of people he worked with. Anne Milton told Channel 4 News that Williamson had used MPs' mental and physical health problems against them, and had collected "salacious gossip" about their "sexual preferences". Milton said that Williamson sent her an email, responding to a female civil servant asking about a minister having to alter travel plans to attend a vote, "Always tell them to fuck off and if they have the bollocks to come and see me. Fuck jumped up civil servants." Milton added "It's an image he cultivates. I think he feels that he's Francis Urquhart from House of Cards." Milton accused Williamson of creating a culture of fear for Conservative MPs by using gossip over their drinking, sex lives or mental health as "leverage" to keep control. Milton thought Sunak's decision to reappoint Williamson was "probably a bit naïve. I don't know that there are many people that would hang out the bunting to see Gavin Williamson back in government."
At Prime Minister's Questions on 9 November 2022 Rishi Sunak said it was "absolutely right" that Williamson had resigned and said: "I obviously regret appointing someone who has had to resign in these circumstances". An unnamed senior Conservative MP told Sky News it had always been well known that Williamson was a bully.
On 10 November 2022 the BBC reported that several other Conservative MPs would have been ready to make formal complaints to Conservative head office over Williamson if he had not resigned. According to the BBC two formal complaints were submitted to the Independent Complaints and Grievance Scheme (ICGS). Jake Berry stated he told Sunak about Morton's complaint on 24 October, one day before Williamson was appointed.
From the next general election, Williamson's current seat of South Staffordshire will be split, with Williamson being selected as the Conservative candidate for the newly formed constituency of Stone, Great Wyrely and Penkridge. Philip Catney, a senior politics lecturer at Keele University described the newly formed constituency as a safe seat, with a Conservative MP being "guaranteed a job for life".
On 4 September 2023 Williamson was told by a Parliamentary independent expert panel to apologise to the House of Commons and to take behavioural training. The panel concluded that he had abused his power when he sent Morton text messages in 2022.
Personal life
Williamson married Joanne Eland, a former primary school teacher, in 2001. The couple have two daughters. He was a trustee of a local Citizen's Advice Bureau, and a school governor.
Williamson is a patron of the World Owl Trust and while Government Chief Whip kept a Mexican redknee tarantula, which he named Cronus, in his parliamentary office, for which he was criticised by parliamentary authorities in November 2016.
In January 2018, it was reported that while managing director of fireplace firm Elgin & Hall in 2004, Williamson had an affair with a married colleague. He discussed the affair in an interview with the Daily Mail which he called a "dreadful mistake". The Sunday Telegraph reported that Williamson was subsequently the subject of a meeting with managers; he left the firm days later.
In October 2023, a man was convicted of stalking Williamson; Simon Parry, of no fixed address, had "persistently followed" the MP on two occasions earlier that year.
Honours
In May 2015, Williamson was sworn of Her Majesty's Most Honourable Privy Council, permitting use of the honorific title "The Right Honourable". In the 2016 Resignation Honours List of David Cameron, Williamson was put forward for a Commander of the Order of the British Empire (CBE) "for political and public service".
On 3 March 2022, Williamson was gazetted Knight Bachelor as part of the 2022 Special Honours for Political Service. The honour drew disapproval, with Labour's shadow education secretary Bridget Phillipson describing Williamson's record as "disgraceful" and the Liberal Democrats calling the knighthood "an insult to every child, parent and teacher who struggled through COVID against the odds". Investiture of his knighthood was delayed pending an inquiry by Sue Gray into alleged COVID-19 lockdown breaches in Downing Street.
References
External links
Official site
Conservative Party
South Staffordshire Conservative Association
|-
|-
|-
|-
|-
1976 births
English people of Irish descent
Living people
Alumni of the University of Bradford
Commanders of the Order of the British Empire
Conservative Party (UK) MPs for English constituencies
Members of North Yorkshire County Council
Parliamentary Private Secretaries to the Prime Minister
Politicians from Scarborough, North Yorkshire
UK MPs 2010–2015
UK MPs 2015–2017
UK MPs 2017–2019
UK MPs 2019–present
Members of the Privy Council of the United Kingdom
Politicians from Yorkshire
Russia–United Kingdom relations
British Secretaries of State
Secretaries of State for Defence (UK)
British Secretaries of State for Education
Knights Bachelor
English victims of crime
|
```javascript
import './lib/sre.js';
import './sre_config.js';
import Sre from '../../../../js/a11y/sre.js';
if (MathJax.startup) {
((typeof window !== 'undefined') ? window : global).
SREfeature.custom = (loc) => Sre.preloadLocales(loc);
}
```
|
```smalltalk
Class {
#name : 'MetacelloPreLoadDirective',
#superclass : 'MetacelloPrePostLoadDirective',
#category : 'Metacello-Core-Directives',
#package : 'Metacello-Core',
#tag : 'Directives'
}
{ #category : 'visiting' }
MetacelloPreLoadDirective >> acceptVisitor: aTarget [
aTarget visitPreLoadDirective: self
]
{ #category : 'actions' }
MetacelloPreLoadDirective >> addTo: aLoaderDirective [
spec preLoadDoIt value ifNotNil: [ aLoaderDirective add: self ]
]
{ #category : 'printing' }
MetacelloPreLoadDirective >> label [
^super label, ' >> ', self spec preLoadDoIt value asString
]
{ #category : 'accessing' }
MetacelloPreLoadDirective >> title [
^'preload'
]
```
|
Woodie King Jr. (born July 27, 1937) is an American director and producer of stage and screen, as well as the founding director of the New Federal Theatre in New York City.
Early life and education
King was born in Baldwin Springs, Alabama. He graduated high school in 1956 in Detroit, Michigan, United States, and worked at the Ford Motor Company there for three years. He then worked for the City of Detroit as a draftsman.
In 1970, he founded the New Federal Theatre. He earned a B.A. in Self-Determined Studies, with a focus on Theatre and Black Studies, at Lehman College in 1996, and an M.F.A. at Brooklyn College in 1999.
Film and stage direction
King has a long list of credits in film and stage direction and production, including the following:
Co-produced plays
For Colored Girls Who Have Considered Suicide / When the Rainbow Is Enuf by Ntozake Shange
What the Wine Sellers Buy
Reggae
The Taking of Miss Janie, which earned the Drama Critics Circle Award
Awards and recognition
1985: Joseph Jefferson Award nomination for Appear and Show Cause
1988: NAACP Image Award for directing Checkmates at the Inner City Cultural Center
1993: AUDELCO awards for Best Director and Best Play for Robert Johnson: Trick The Devil
1997: Obie Award for Sustained Achievement
2003: Paul Robeson Award
2005: Rosetta LeNoire Award
2011: Induction into American Theater Hall of Fame
2014: Theatre Legend Award, Atlanta Black Theatre Festival
Works
References
External links
Historymakers Biography
The New Federal Theater in New Yorksee also inspiring purposes of previous 20th-century African-American theatre projects: Federal Theatre Project, American Negro Theater
Rosetta LeNoire Award
Theatre Hall of Fame induction
1937 births
20th-century African-American people
African-American theater directors
American theatre directors
American theatre managers and producers
Brooklyn College alumni
Living people
People from Baldwin County, Alabama
|
Kuhiabad (, also Romanized as Kūhīābād) is a village in Kahir Rural District, in the Central District of Konarak County, Sistan and Baluchestan Province, Iran. At the 2006 census, its population was 18, in 5 families.
References
Populated places in Konarak County
|
```scss
// Scheme Hue and Saturation
$scheme-h: 221 !default;
$scheme-s: 14% !default;
$dark-l: 20% !default;
$light-l: 90% !default;
// Colors
$black: hsl(221, 14%, 4%) !default;
$black-bis: hsl(221, 14%, 9%) !default;
$black-ter: hsl(221, 14%, 14%) !default;
$grey-darker: hsl(221, 14%, 21%) !default;
$grey-dark: hsl(221, 14%, 29%) !default;
$grey: hsl(221, 14%, 48%) !default;
$grey-light: hsl(221, 14%, 71%) !default;
$grey-lighter: hsl(221, 14%, 86%) !default;
$grey-lightest: hsl(221, 14%, 93%) !default;
$white-ter: hsl(221, 14%, 96%) !default;
$white-bis: hsl(221, 14%, 98%) !default;
$white: hsl(221, 14%, 100%) !default;
$orange: hsl(14, 100%, 53%) !default;
$yellow: hsl(42, 100%, 53%) !default;
$green: hsl(153, 53%, 53%) !default;
$turquoise: hsl(171, 100%, 41%) !default;
$cyan: hsl(198, 100%, 70%) !default;
$blue: hsl(233, 100%, 63%) !default;
$purple: hsl(271, 100%, 71%) !default;
$red: hsl(348, 100%, 70%) !default;
// Typography
$family-sans-serif: "Inter", "SF Pro", "Segoe UI", "Roboto", "Oxygen", "Ubuntu",
"Helvetica Neue", "Helvetica", "Arial", sans-serif !default;
$family-monospace: "Inconsolata", "Hack", "SF Mono", "Roboto Mono",
"Source Code Pro", "Ubuntu Mono", monospace !default;
$render-mode: optimizeLegibility !default;
$size-1: 3rem !default;
$size-2: 2.5rem !default;
$size-3: 2rem !default;
$size-4: 1.5rem !default;
$size-5: 1.25rem !default;
$size-6: 1rem !default;
$size-7: 0.75rem !default;
$weight-light: 300 !default;
$weight-normal: 400 !default;
$weight-medium: 500 !default;
$weight-semibold: 600 !default;
$weight-bold: 700 !default;
$weight-extrabold: 800 !default;
// Spacing
$block-spacing: 1.5rem !default;
$aspect-ratios: (
(1, 1),
(5, 4),
(4, 3),
(3, 2),
(5, 3),
(16, 9),
(2, 1),
(3, 1),
(4, 5),
(3, 4),
(2, 3),
(3, 5),
(9, 16),
(1, 2),
(1, 3)
) !default;
// Responsiveness
// The container horizontal gap, which acts as the offset for breakpoints
$gap: 32px !default;
// 960, 1152, and 1344 have been chosen because they are divisible by both 12 and 16
$tablet: 769px !default;
// 960px container + 4rem
$desktop: 960px + 2 * $gap !default;
// 1152px container + 4rem
$widescreen: 1152px + 2 * $gap !default;
$widescreen-enabled: true !default;
// 1344px container + 4rem
$fullhd: 1344px + 2 * $gap !default;
$fullhd-enabled: true !default;
$breakpoints: (
"mobile": (
"until": $tablet,
),
"tablet": (
"from": $tablet,
),
"tablet-only": (
"from": $tablet,
"until": $desktop,
),
"touch": (
"from": $desktop,
),
"desktop": (
"from": $desktop,
),
"desktop-only": (
"from": $desktop,
"until": $widescreen,
),
"until-widescreen": (
"until": $widescreen,
),
"widescreen": (
"from": $widescreen,
),
"widescreen-only": (
"from": $widescreen,
"until": $fullhd,
),
"until-fullhd": (
"until": $fullhd,
),
"fullhd": (
"from": $fullhd,
),
) !default;
// Miscellaneous
$easing: ease-out !default;
$radius-small: 0.25rem !default;
$radius: 0.375rem !default;
$radius-medium: 0.5em !default;
$radius-large: 0.75rem !default;
$radius-rounded: 9999px !default;
$speed: 86ms !default;
// Flags
$variable-columns: true !default;
$rtl: false !default;
// Prefixes
$class-prefix: "" !default;
$cssvars-prefix: "bulma-" !default;
$helpers-prefix: "is-" !default;
$helpers-has-prefix: "has-" !default;
```
|
Feliks Więcek (10 November 1904 – 17 August 1978) was a Polish racing cyclist. He won the 1928 edition of the Tour de Pologne.
References
External links
1904 births
1978 deaths
Polish male cyclists
People from Ostrzeszów County
Sportspeople from Greater Poland Voivodeship
|
Christian privilege is a social advantage bestowed upon Christians in any historically Christian society. This arises out of the presumption that Christian belief is a social norm, that leads to the marginalization of the nonreligious and members of other religions through institutional religious discrimination or religious persecution. Christian privilege can also lead to the neglect of outsiders' cultural heritage and religious practices.
Overview
Christian privilege is a type of dominant group privilege where the unconscious or conscious attitudes and beliefs of Christians are advantageous to Christians over non-Christians. Examples include opinions that non-Christian beliefs are inferior or dangerous, or that those who adhere to non-Christian beliefs are amoral, immoral, or sinful. Such prejudices pervade established social institutions, are reinforced by the broader society, and have evolved as part of its history.
Lewis Z. Schlosser observes that the exposure of Christian privilege breaks a "sacred taboo", and that "both subtle and obvious pressures exist to ensure that these privileges continue to be in the sole domain of Christians. This process is comparable to the way in which whites and males, according to many, continue to (consciously and unconsciously) ensure the privilege of their racial and gender groups".
In the United States, White mainstream Protestant denominations have greater degrees of privilege than minority Christian denominations. Such minority denominations include African American churches, Christian Hispanics and Latinos, Amish people, Mennonite, Quakers, Seventh-day Adventists, Jehovah's Witnesses, adherents of the Eastern Orthodox Church, Christian scientists, Mormons, and in some instances, Catholics.
When dominating groups within societies place Christian cultural norms and perspectives on individuals holding differing viewpoints, those people are sometimes deemed, in social justice terms, to be oppressed. These norms can be imposed "on institutions by individuals and on individuals by institutions". These social and cultural norms define issues related to good and evil, health and sickness, normality and deviance, and a person's normative ethic.
History
Alexis de Tocqueville the French political scientist and diplomat, traveled across the United States for nine months between 1831 and 1832, conducting research for his book Democracy in America. He noted a paradox of religion in the U.S. On the one hand, the United States promoted itself around the world as a country that valued both the "separation of church and state", and religious freedom and tolerance. On the other hand, "There is no country in the world where the Christian religion retains a greater influence over the souls of men than in America". He explained this paradox by proposing that with no officially sanctioned governmental religion, Christian denominations were compelled to compete with one another and promote themselves in order to attract and keep parishioners, thereby making religion even stronger. While the government did not support Christian churches as such, Tocqueville argued that religion should be considered the first political institution because of the enormous influence that churches had on the political process.
Although de Tocqueville favored U.S. style democracy, he found its major limitation to be in its limiting of independent thought and independent beliefs. In a country that promoted the notion that the majority rules, this effectively silenced minorities by what Tocqueville termed the "tyranny of the majority". Without specific guarantees of minority rights—in this case minority religious rights—there is a danger of religious domination over religious minorities and non-believers. The religious majority in the U.S. has historically been adherents of mainline Protestant Christian denominations who often assume that their values and standard apply equally to others.
Another traveler to the United States, social theorist Gunnar Myrdal examined U.S. society following World War II, and he noted a contradiction, which he termed "an American dilemma". He found an overriding commitment to democracy, liberty, freedom, human dignity, and egalitarian values, coexisting alongside deep-seated patterns of racial discrimination, privileging of white people, and the subordination of peoples of color. This contradiction has been reframed for contemporary consideration by the religious scholar, Diana Eck:
Christian hegemony
The concept of hegemony describes the ways in which a dominant group, in this case mainly Christians, disseminate their dominant social constructions as common sense, normative, or even universal, even though most of the world's inhabitants are not Christian. Christian hegemony also accepts Christianity as part of the natural order, even at times by those who are marginalized, disempowered, or rendered invisible by it. Thus, Christian hegemony helps to maintain the marginality of other religions and beliefs. According to Beaman, "the binary opposition of sameness/difference is reflected in Protestant/minority religion in which mainstream Protestantism is representative of the 'normal'".
The French philosopher, Michel Foucault, described how a dominant-group's hegemony is advanced through "discourses". Discourses include the ideas, written expressions, theoretical foundations, and language of the dominant culture. According to Foucault, dominant-group discourses pervade networks of social and political control, which he called "regimes of truth", and which function to legitimize what can be said, who has the authority to speak and be heard, and what is authorized as true or as the truth.
Pervasiveness
Christian privilege at the individual level occurs in proselytizing to convert or reconvert non-Christians to Christianity. While many Christians view proselytizing as offering the gift of Jesus to the non-Christians, some non-believers and people of other faiths may view this as an imposition, manipulation, or oppression.
Social institutions—including but not limited to educational, governmental, and religious bodies—often maintain and perpetuate policies that explicitly or implicitly privilege and rendering invisible other groups based on social identity and social status.
Overt forms of oppression, when a dominant group tyrannizes a subordinate group, for example, apartheid, slavery and ethnic cleansing, are obvious. However, dominant group privilege is not as obvious, especially to members of dominant groups. Oppression in its fullest sense refers to structural or systemic constraints imposed on groups, even within constitutional democracies, and its "causes are embedded in unquestioned norms, habits, and symbols, in the assumptions underlying institutional rules and the collective consequences of following those rules".
Christian dominance is facilitated by its relative invisibility, and because of this invisibility, it is not analyzed, scrutinized, or confronted. Dominance is perceived as unremarkable or "normal". For example, some symbolism and rituals associated with religious holidays may appear to be free of religion. However, this very secularization can fortify Christian privilege and perpetuate Christian hegemony by making it harder to recognize and thus circumvent the constitutional requirements for the separation of religion and government.
Christian privilege and religious oppression exist in a symbiotic relationship. Oppression toward non-Christians gives rise to Christian privilege, and Christian privilege maintains oppression toward non-Christian individuals and faith communities.
Criticism
According to Schlosser, many Christians reject the notion that they have any privilege by claiming that all religions are essentially the same. Thus, they have no more and no fewer benefits accorded to them than members of other faith communities. Blumenfeld notes the objections that some of his university students raise when discussing Christian privilege as connected with the celebration of Christian holidays. The students, he notes, state that many of the celebrations and decorations have nothing to do with religion as such, and do not represent Christianity, but are rather part of American culture—however, this could be considered a further example of privilege.
Scholars and jurists debate the exact scope of religious liberty protected by the First Amendment. It is unclear whether the amendment requires religious minorities to be exempted from neutral laws and whether the Free Exercise Clause requires Congress to exempt religious pacifists from conscription into the military. At a minimum, it prohibits Congress from, in the words of James Madison, compelling "men to worship God in any manner contrary to their conscience".
See also
Angry white male
Antisemitism
Critical theory
Discrimination against atheists
Glass ceiling
Heteronormativity
Homophobia
Institutional racism
Islamophobia
Male privilege
Muslim privilege
Persecution of Christians
Religious discrimination against Neopagans
Reverse discrimination
Transphobia
White privilege
References
External links
Christian Privilege and the Promotion of “Secular” and Not-So “Secular” Mainline Christianity in Public Schooling and in the Larger Society, archived from
Understanding Christian Privilege: Managing the Tensions of Spiritual Plurality, archived from
Christian Privilege with Dr. Warren Blumenfeld podcast episode from The Infidel Guy Show
Christianity and society
Rule by a subset of population
Critical theory
Social privilege
Religious discrimination
|
```ruby
class Ugit < Formula
desc "Undo git commands. Your damage control git buddy"
homepage "path_to_url"
url "path_to_url"
sha256 your_sha256_hash
license "MIT"
bottle do
sha256 cellar: :any_skip_relocation, all: your_sha256_hash
end
depends_on "bash"
depends_on "fzf"
conflicts_with "git-extras", because: "both install `git-undo` binaries"
def install
bin.install "ugit"
bin.install "git-undo"
end
test do
assert_match "ugit version #{version}", shell_output("#{bin}/ugit --version")
assert_match "Ummm, you are not inside a Git repo", shell_output(bin/"ugit")
end
end
```
|
```go
package seccomp
const (
seccompOverwrite = "overwrite"
seccompAppend = "append"
nothing = "nothing"
)
```
|
The Election Commission of Sri Lanka is the constitutional authority responsible for administering and overseeing all elections in Sri Lanka, including the Presidential, Parliamentary, Provincial and Local Authority elections. Sri Lanka has had universal adult suffrage since 1931, becoming the first Crown colony to enfranchise all adult citizens, 3 years after the United Kingdom itself; the country is the oldest democracy in Asia.
Early history
The recommendations of the Soulbury Commission of 1944 led to the country's 1948 'Soulbury Constitution', granting it independence with Dominion status within the British Empire through the Ceylon Independence Act of 1947. The work of the Commission began in 1944, with several pieces of key legislation being enacted in the interim as a result of its work- of these, the Ceylon (Constitution) Order in Council of 1946 would lead to the 1948 constitution, while the Ceylon (Parliamentary Elections) Order in Council and the Local Authorities Ordinance enacted in the same year created two government departments that would eventually go on to form the Elections Commission.
Section 88A of the Ceylon (Parliamentary Elections) Order in Council of 1946 established the Department of Parliamentary elections headed by a Commissioner and assisted by Assistant and Deputy Commissioners, with the responsibility of registering electors and the conduct of Parliamentary Elections. At the same time, the Local Authorities Ordinance, No. 53 of 1946 established the Department of Local Authorities Elections under a separate Commissioner and staff to oversee and administer all non-Parliamentary elections on the island. During its existence, the former oversaw two Parliamentary elections, in 1947 and 1952. These two departments functioned independently of each other until 1 October 1955, when they were merged to form the Department of Elections; as was the case with its predecessors, the department functioned as an independent, non-ministerial institution answerable only to Parliament and the Judiciary.
Commissioners
See also
Electoral districts of Sri Lanka
List of political parties in Sri Lanka
Notes
References
Elections in Sri Lanka
Sri Lanka
|
The deputy director of the Central Intelligence Agency (DD/CIA) is a statutory office () and the second-highest official of the Central Intelligence Agency. The DD/CIA assists the director of the Central Intelligence Agency (D/CIA) and is authorized to exercise the powers of the D/CIA when the director's position is vacant or in the director's absence or disability.
Under current law, the deputy director is appointed by the president of the United States and is not required to be confirmed by the United States Senate. This position has been held by David Cohen since January 20, 2021.
History
The functions of this position were served by the deputy director of central intelligence (DDCI) until that position was abolished under the Intelligence Reform and Terrorism Prevention Act of 2004. The position of DD/CIA was created administratively by then-D/CIA Porter Goss and received statutory approval from the U.S. Congress in 2010.
The first DDCI was Kingman Douglass, appointed by the director of central intelligence in 1946. In April 1953, Congress amended the National Security Act of 1947 to allow the president of the United States to appoint the DDCI (with U.S. Senate confirmation). The amendment stipulated that the director and deputy director positions could not be simultaneously filled by military officers.
List of deputy directors of Central Intelligence (1946–2004)
Deputy Director of the Central Intelligence Agency (2005–present)
Hereafter the "Deputy Director of Central Intelligence" position was replaced by Deputy Director of the Central Intelligence Agency and the Principal Deputy Director of National Intelligence.
In popular culture
In the novel The Hunt for Red October, the character Vice Admiral James Greer is the fictional Deputy Director of the CIA; former U.S. Marine Jack Ryan takes over this role after Admiral Greer's death in Clear and Present Danger. He subsequently retires from the position following a highly publicized media scandal and the detonation of a nuclear weapon at the Super Bowl in The Sum of All Fears.
In the animated sitcom American Dad!'', the character Avery Bullock is the fictional Deputy Director of the CIA.
References
|
```c++
#ifdef _WIN32
#ifndef UNICODE
#define UNICODE
#endif
#endif
#include "tbigmemorymanager.h"
#include "traster.h"
#include "trastercm.h"
// #include "tspecialstyleid.h"
#include "tpixel.h"
#include "tpixelgr.h"
#include "timagecache.h"
DEFINE_CLASS_CODE(TRaster, 1)
//------------------------------------------------------------
TRaster::TRaster(int lx, int ly, int pixelSize)
: TSmartObject(m_classCode)
, m_pixelSize(pixelSize)
, m_lx(lx)
, m_ly(ly)
, m_wrap(lx)
, m_parent(0)
, m_bufferOwner(true)
, m_buffer(0)
, m_lockCount(0)
, m_isLinear(false)
#ifdef _DEBUG
, m_cashed(false)
#endif
{
// try
{
assert(pixelSize > 0);
assert(lx > 0 && ly > 0);
TBigMemoryManager::instance()->putRaster(this);
// m_buffer = new UCHAR[lx*ly*pixelSize];
if (!m_buffer) {
#ifdef _WIN32
static bool firstTime = true;
if (firstTime) {
firstTime = false;
unsigned long size = pixelSize * lx * ly;
TImageCache::instance()->outputMap(size, "C:\\runout");
(*TBigMemoryManager::instance()->m_runOutCallback)(size);
}
#endif
return;
}
// TBigMemoryManager::instance()->checkConsistency();
// m_totalMemory += ((lx*ly*pixelSize)>>10);
}
/* catch(...)
{
TImageCache::instance()->putAllOnDisk();
m_buffer = BigMemoryManager.getMemoryChunk(lx*ly*pixelSize, this);
//m_buffer = new UCHAR[lx*ly*pixelSize];
m_totalMemory += ((lx*ly*pixelSize)>>10);
#ifdef _WIN32
MessageBox( NULL, "Run out of contiguous physical memory: please save all and
restart toonz!", "Warning", MB_OK);
#endif
}*/
}
//------------------------------------------------------------
TRaster::TRaster(int lx, int ly, int pixelSize, int wrap, UCHAR *buffer,
TRaster *parent, bool bufferOwner)
: TSmartObject(m_classCode)
, m_pixelSize(pixelSize)
, m_lx(lx)
, m_ly(ly)
, m_wrap(wrap)
, m_buffer(buffer)
, m_bufferOwner(bufferOwner)
, m_lockCount(0)
, m_isLinear(false)
#ifdef _DEBUG
, m_cashed(false)
#endif
, m_parent(nullptr)
{
if (parent) {
assert(bufferOwner == false);
while (parent->m_parent) parent = parent->m_parent;
parent->addRef();
setLinear(parent->isLinear());
}
#ifdef _DEBUG
else if (bufferOwner)
TBigMemoryManager::instance()->m_totRasterMemInKb +=
((m_lx * m_ly * m_pixelSize) >> 10);
#endif
m_parent = parent;
assert(pixelSize > 0);
assert(lx > 0 && ly > 0);
assert(wrap >= lx);
assert(m_buffer);
// if (parent)
TBigMemoryManager::instance()->putRaster(this);
// TBigMemoryManager::instance()->checkConsistency();
}
//------------------------------------------------------------
// TAtomicVar TRaster::m_totalMemory;
//------------------------------------------------------------
// unsigned long TRaster::getTotalMemoryInKB(){ return m_totalMemory;}
//------------------------------------------------------------
TRaster::~TRaster() {
bool parent = false;
#ifdef _DEBUG
// TBigMemoryManager::instance()->checkConsistency();
#endif
// bool ret =
TBigMemoryManager::instance()->releaseRaster(this);
#ifdef _DEBUG
// TBigMemoryManager::instance()->checkConsistency();
#endif
if (m_parent) {
assert(!m_bufferOwner);
m_parent->release();
m_parent = 0;
parent = true;
}
// if(m_buffer && m_bufferOwner)
// {
// delete [] m_buffer;
// m_totalMemory += -((m_lx*m_ly*m_pixelSize)>>10);
// assert(m_totalMemory>=0);
// }
// UCHAR* aux = m_buffer;
m_buffer = 0;
#ifdef _DEBUG
// TBigMemoryManager::instance()->checkConsistency();
#endif
}
//------------------------------------------------------------
void TRaster::beginRemapping() { m_mutex.lock(); }
void TRaster::endRemapping() { m_mutex.unlock(); }
/*
void TRaster::lock()
{
if (m_parent) m_parent->lock();
else ++m_lockCount;
//TBigMemoryManager::instance()->lock(m_parent?(m_parent->m_buffer):m_buffer);
}
void TRaster::unlock()
{
if (m_parent) m_parent->unlock();
else
{
assert(m_lockCount>0);
--m_lockCount;
}
//TBigMemoryManager::instance()->unlock(m_parent?(m_parent->m_buffer):m_buffer);
}
*/
/*
template<class T>
TRasterT<T>::TRasterT<T>(int lx, int ly) : TRaster(lx,ly,sizeof(T)) {}
// utilizzo di un raster preesistente
template<class T>
TRasterT<T>::TRasterT<T>(int lx, int ly, int wrap, T *buffer, TRasterT<T>
*parent)
: TRaster(lx,ly,sizeof(T), wrap
, reinterpret_cast<UCHAR*>(buffer), parent) {}
*/
//------------------------------------------------------------
void TRaster::fillRawData(const UCHAR *color) {
if (m_lx == 0 || m_ly == 0) return;
// N.B. uso la convenzione stl per end()
const int wrapSize = m_wrap * m_pixelSize;
const int rowSize = m_lx * m_pixelSize;
UCHAR *buf1 = m_parent ? m_parent->m_buffer : m_buffer;
lock();
unsigned char *firstPixel = getRawData();
const unsigned char *lastPixel =
firstPixel + wrapSize * (m_ly - 1) + m_pixelSize * (m_lx - 1);
// riempio la prima riga
unsigned char *pixel = firstPixel;
const unsigned char *endpixel = firstPixel + rowSize;
while (pixel < endpixel) {
assert(firstPixel <= pixel && pixel <= lastPixel);
::memcpy(pixel, color, m_pixelSize);
pixel += m_pixelSize;
}
// riempio le altre
pixel += wrapSize - rowSize;
const unsigned char *endrow = pixel + wrapSize * (m_ly - 1);
while (pixel < endrow) {
assert(firstPixel <= pixel && pixel + rowSize - m_pixelSize <= lastPixel);
::memcpy(pixel, firstPixel, rowSize);
pixel += wrapSize;
}
UCHAR *buf2 = m_parent ? m_parent->m_buffer : m_buffer;
unlock();
}
//------------------------------------------------------------
void TRaster::fillRawDataOutside(const TRect &rect,
const unsigned char *pixel) {
if (m_lx == 0 || m_ly == 0) return;
TRect r = rect * getBounds();
if (r.isEmpty()) return;
if (r.y0 > 0) // fascia "inferiore"
{
TRect bounds(0, 0, m_lx - 1, r.y0 - 1);
extract(bounds)->fillRawData(pixel);
}
if (rect.y1 < m_ly - 1) // fascia "superiore"
{
TRect bounds(0, r.y1 + 1, m_lx - 1, m_ly - 1);
extract(bounds)->fillRawData(pixel);
}
if (rect.x0 > 0) // zona "a sinistra"
{
TRect bounds(0, r.y0, r.x0 - 1, r.y1);
extract(bounds)->fillRawData(pixel);
}
if (rect.x1 < m_lx - 1) // zona "a destra"
{
TRect bounds(r.x1 + 1, r.y0, m_lx - 1, r.y1);
extract(bounds)->fillRawData(pixel);
}
}
//------------------------------------------------------------
void TRaster::copy(const TRasterP &src0, const TPoint &offset) {
assert(m_pixelSize == src0->getPixelSize());
TRect rect = getBounds() * (src0->getBounds() + offset);
if (rect.isEmpty()) return;
TRasterP dst = extract(rect);
TRect r(rect);
r -= offset;
// TRasterP src = src0->extract(rect - offset);
TRasterP src = src0->extract(r);
assert(dst->getSize() == src->getSize());
dst->lock();
src0->lock();
if (dst->getLx() == dst->getWrap() && src->getLx() == src->getWrap()) {
int size = rect.getLx() * rect.getLy() * m_pixelSize;
::memcpy(dst->getRawData(), src->getRawData(), size);
} else {
int rowSize = dst->getLx() * m_pixelSize;
int srcWrapSize = src->getWrap() * m_pixelSize;
int dstWrapSize = dst->getWrap() * m_pixelSize;
const UCHAR *srcRow = src->getRawData();
UCHAR *dstRow = dst->getRawData();
UCHAR *maxDstRow = dstRow + dstWrapSize * dst->getLy();
while (dstRow < maxDstRow) {
::memcpy(dstRow, srcRow, rowSize);
dstRow += dstWrapSize;
srcRow += srcWrapSize;
}
}
setLinear(src0->isLinear());
dst->unlock();
src0->unlock();
}
//------------------------------------------------------------
void TRaster::yMirror() {
const int rowSize = m_lx * m_pixelSize;
const int wrapSize = m_wrap * m_pixelSize;
std::unique_ptr<UCHAR[]> auxBuf(new UCHAR[rowSize]);
lock();
UCHAR *buff1 = getRawData();
UCHAR *buff2 = getRawData(0, (m_ly - 1));
while (buff1 < buff2) {
::memcpy(auxBuf.get(), buff1, rowSize);
::memcpy(buff1, buff2, rowSize);
::memcpy(buff2, auxBuf.get(), rowSize);
buff1 += wrapSize;
buff2 -= wrapSize;
}
unlock();
}
//------------------------------------------------------------
void TRaster::xMirror() {
const int wrapSize = m_wrap * m_pixelSize;
const int lastPixelOffset = (m_lx - 1) * m_pixelSize;
std::unique_ptr<UCHAR[]> auxBuf(new UCHAR[m_pixelSize]);
lock();
UCHAR *row = getRawData();
for (int i = 0; i < m_ly; i++) {
UCHAR *a = row, *b = row + lastPixelOffset;
while (a < b) {
::memcpy(auxBuf.get(), a, m_pixelSize);
::memcpy(a, b, m_pixelSize);
::memcpy(b, auxBuf.get(), m_pixelSize);
a += m_pixelSize;
b -= m_pixelSize;
}
row += wrapSize;
}
unlock();
}
//------------------------------------------------------------
void TRaster::rotate180() {
// const int rowSize = m_lx * m_pixelSize;
const int wrapSize = m_wrap * m_pixelSize;
std::unique_ptr<UCHAR[]> auxBuf(new UCHAR[m_pixelSize]);
lock();
UCHAR *buff1 = getRawData();
UCHAR *buff2 = buff1 + wrapSize * (m_ly - 1) + m_pixelSize * (m_lx - 1);
if (m_wrap == m_lx) {
while (buff1 < buff2) {
::memcpy(auxBuf.get(), buff1, m_pixelSize);
::memcpy(buff1, buff2, m_pixelSize);
::memcpy(buff2, auxBuf.get(), m_pixelSize);
buff1 += m_pixelSize;
buff2 -= m_pixelSize;
}
} else {
for (int y = 0; y < m_ly / 2; y++) {
UCHAR *a = buff1, *b = buff2;
for (int x = 0; x < m_lx; x++) {
::memcpy(auxBuf.get(), a, m_pixelSize);
::memcpy(a, b, m_pixelSize);
::memcpy(b, auxBuf.get(), m_pixelSize);
a += m_pixelSize;
b -= m_pixelSize;
}
buff1 += wrapSize;
buff2 -= wrapSize;
}
}
unlock();
}
//------------------------------------------------------------
void TRaster::rotate90() {
/*
UCHAR *auxBuf= new UCHAR[m_pixelSize];
for(int y=m_ly;y>0;y--)
{
UCHAR *a = getRawData() + wrapSize * (y-1) + m_pixelSize * (m_lx-1);
for (int x=m_lx-1;x>=0;x--)
{
UCHAR *b = a - (m_ly-1)*m_pixelSize *(m_lx-x);
::memcpy(auxBuf, a, m_pixelSize);
::memcpy(a, b, m_pixelSize);
::memcpy(b, auxBuf, m_pixelSize);
a-=m_pixelSize;
}
}
*/
}
//------------------------------------------------------------
void TRaster::clear() {
TRasterCM32 *ras = dynamic_cast<TRasterCM32 *>(this);
if (ras) {
// ras->fill(TPixelCM32(0,BackgroundStyle,TPixelCM32::getMaxTone()));
ras->fill(TPixelCM32());
} else {
const int rowSize = getRowSize();
lock();
if (m_wrap == m_lx) {
int bufferSize = rowSize * m_ly;
memset(getRawData(), 0, bufferSize);
} else
for (int y = m_ly - 1; y >= 0; y--) {
UCHAR *buffer = getRawData(0, y);
memset(buffer, 0, rowSize);
}
unlock();
}
}
//------------------------------------------------------------
void TRaster::remap(UCHAR *newLocation) {
if (m_parent) {
assert(m_parent->m_buffer > newLocation);
assert(m_parent->m_parent == 0);
int offset = (int)(m_buffer - m_parent->m_buffer);
assert(offset >= 0);
// m_parent->remap(newLocation);
m_buffer = newLocation + offset;
} else {
assert(m_buffer > newLocation);
m_buffer = newLocation;
}
}
//------------------------------------------------------------
void TRaster::clearOutside(const TRect &rect) {
if (m_lx == 0 || m_ly == 0) return;
TRect r = rect * getBounds();
if (r.isEmpty()) return;
if (r.y0 > 0) // fascia "inferiore"
{
TRect bounds(0, 0, m_lx - 1, r.y0 - 1);
extract(bounds)->clear();
}
if (rect.y1 < m_ly - 1) // fascia "superiore"
{
TRect bounds(0, r.y1 + 1, m_lx - 1, m_ly - 1);
extract(bounds)->clear();
}
if (rect.x0 > 0) // zona "a sinistra"
{
TRect bounds(0, r.y0, r.x0 - 1, r.y1);
extract(bounds)->clear();
}
if (rect.x1 < m_lx - 1) // zona "a destra"
{
TRect bounds(r.x1 + 1, r.y0, m_lx - 1, r.y1);
extract(bounds)->clear();
}
}
```
|
```cuda
/*
* All rights reserved.
*
* This source code is licensed under the BSD-style license found in the
* LICENSE file in the root directory of this source tree.
*/
// This file is auto-generated. See "generate_kernels.py"
#include <ATen/native/transformers/cuda/mem_eff_attention/kernel_backward.h>
using namespace PyTorchMemEffAttention;
__global__ void __launch_bounds__(
AttentionBackwardKernel<cutlass::arch::Sm50, float, false, false, false, 64, 64, 64>::kNumThreads,
AttentionBackwardKernel<cutlass::arch::Sm50, float, false, false, false, 64, 64, 64>::kMinBlocksPerSm)
fmha_cutlassB_f32_notaligned_64x64_k64_sm50(typename AttentionBackwardKernel<cutlass::arch::Sm50, float, false, false, false, 64, 64, 64>::Params p) {
#ifdef __CUDA_ARCH__
#if __CUDA_ARCH__ >= 500
#if __CUDA_ARCH__ < 700
if (!p.advance_to_block()) {
return;
}
AttentionBackwardKernel<cutlass::arch::Sm50, float, false, false, false, 64, 64, 64>::attention_kernel(p);
return;
#endif
#endif
printf(
"FATAL: kernel `fmha_cutlassB_f32_notaligned_64x64_k64_sm50` is for sm50-sm70, but was built for sm%d\n",
int(__CUDA_ARCH__ + 0) / 10);
#endif
}
__global__ void __launch_bounds__(
AttentionBackwardKernel<cutlass::arch::Sm70, float, false, false, false, 64, 64, 64>::kNumThreads,
AttentionBackwardKernel<cutlass::arch::Sm70, float, false, false, false, 64, 64, 64>::kMinBlocksPerSm)
fmha_cutlassB_f32_notaligned_64x64_k64_sm70(typename AttentionBackwardKernel<cutlass::arch::Sm70, float, false, false, false, 64, 64, 64>::Params p) {
#ifdef __CUDA_ARCH__
#if __CUDA_ARCH__ >= 700
#if __CUDA_ARCH__ < 750
if (!p.advance_to_block()) {
return;
}
AttentionBackwardKernel<cutlass::arch::Sm70, float, false, false, false, 64, 64, 64>::attention_kernel(p);
return;
#endif
#endif
printf(
"FATAL: kernel `fmha_cutlassB_f32_notaligned_64x64_k64_sm70` is for sm70-sm75, but was built for sm%d\n",
int(__CUDA_ARCH__ + 0) / 10);
#endif
}
__global__ void __launch_bounds__(
AttentionBackwardKernel<cutlass::arch::Sm75, float, false, false, false, 64, 64, 64>::kNumThreads,
AttentionBackwardKernel<cutlass::arch::Sm75, float, false, false, false, 64, 64, 64>::kMinBlocksPerSm)
fmha_cutlassB_f32_notaligned_64x64_k64_sm75(typename AttentionBackwardKernel<cutlass::arch::Sm75, float, false, false, false, 64, 64, 64>::Params p) {
#ifdef __CUDA_ARCH__
#if __CUDA_ARCH__ >= 750
#if __CUDA_ARCH__ < 800
if (!p.advance_to_block()) {
return;
}
AttentionBackwardKernel<cutlass::arch::Sm75, float, false, false, false, 64, 64, 64>::attention_kernel(p);
return;
#endif
#endif
printf(
"FATAL: kernel `fmha_cutlassB_f32_notaligned_64x64_k64_sm75` is for sm75-sm80, but was built for sm%d\n",
int(__CUDA_ARCH__ + 0) / 10);
#endif
}
```
|
```ruby
# -*- encoding: utf-8 -*-
# stub: io-wait 0.3.0 ruby lib
# stub: ext/io/wait/extconf.rb
Gem::Specification.new do |s|
s.name = "io-wait".freeze
s.version = "0.3.0"
s.required_rubygems_version = Gem::Requirement.new(">= 0".freeze) if s.respond_to? :required_rubygems_version=
s.metadata = { "homepage_uri" => "path_to_url", "source_code_uri" => "path_to_url" } if s.respond_to? :metadata=
s.require_paths = ["lib".freeze]
s.authors = ["Nobu Nakada".freeze, "Charles Oliver Nutter".freeze]
s.bindir = "exe".freeze
s.date = "2024-04-23"
s.description = "Waits until IO is readable or writable without blocking.".freeze
s.email = ["nobu@ruby-lang.org".freeze, "headius@headius.com".freeze]
s.extensions = ["ext/io/wait/extconf.rb".freeze]
s.files = ["ext/io/wait/extconf.rb".freeze]
s.homepage = "path_to_url".freeze
s.licenses = ["Ruby".freeze, "BSD-2-Clause".freeze]
s.rubygems_version = "3.4.19".freeze
s.summary = "Waits until IO is readable or writable without blocking.".freeze
end
```
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.