text
stringlengths 1
22.8M
|
|---|
```css
.root {
}
.result {
margin-bottom: 10px;
}
.result:last-child {
margin-bottom: 0;
}
.pagination {
display: flex;
padding: 16px 0;
justify-content: center;
}
```
|
```objective-c
//
//
// path_to_url
//
// WARNING: THIS FILE IS GENERATED. DO NOT EDIT.
//
#define TF_MAX_ARITY 7
#include "pxr/pxr.h"
#include "pxr/base/arch/defines.h"
#if defined(ARCH_OS_DARWIN)
#include <mach/mach_time.h>
#endif
#if defined(ARCH_OS_LINUX)
#include <unistd.h>
#include <x86intrin.h>
#endif
#if defined(ARCH_OS_WINDOWS)
#ifndef WIN32_LEAN_AND_MEAN
#define WIN32_LEAN_AND_MEAN
#endif
#include <Windows.h>
#include <intrin.h>
#endif
#include <algorithm>
#include <any>
#include <atomic>
#include <bitset>
#include <cfloat>
#include <cinttypes>
#include <cmath>
#include <cstdarg>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <float.h>
#include <functional>
#include <initializer_list>
#include <iosfwd>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <math.h>
#include <memory>
#include <new>
#include <numeric>
#include <optional>
#include <set>
#include <sstream>
#include <stdarg.h>
#include <stddef.h>
#include <stdint.h>
#include <string>
#include <sys/types.h>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <variant>
#include <vector>
#ifdef PXR_PYTHON_SUPPORT_ENABLED
#include <boost/python.hpp>
#include <boost/python/class.hpp>
#include <boost/python/def_visitor.hpp>
#include <boost/python/dict.hpp>
#include <boost/python/extract.hpp>
#include <boost/python/handle.hpp>
#include <boost/python/list.hpp>
#include <boost/python/module.hpp>
#include <boost/python/object.hpp>
#include <boost/python/object_fwd.hpp>
#include <boost/python/object_operators.hpp>
#include <boost/python/operators.hpp>
#include <boost/python/return_by_value.hpp>
#include <boost/python/to_python_converter.hpp>
#include <boost/python/tuple.hpp>
#include <boost/python/type_id.hpp>
#if defined(__APPLE__) // Fix breakage caused by Python's pyport.h.
#undef tolower
#undef toupper
#endif
#endif // PXR_PYTHON_SUPPORT_ENABLED
#include <tbb/blocked_range.h>
#include <tbb/cache_aligned_allocator.h>
#include <tbb/concurrent_hash_map.h>
#include <tbb/concurrent_queue.h>
#include <tbb/concurrent_unordered_set.h>
#include <tbb/concurrent_vector.h>
#include <tbb/enumerable_thread_specific.h>
#include <tbb/spin_mutex.h>
#include <tbb/spin_rw_mutex.h>
#include <tbb/task.h>
#include <tbb/task_group.h>
#ifdef PXR_PYTHON_SUPPORT_ENABLED
#include "pxr/base/tf/pySafePython.h"
#endif // PXR_PYTHON_SUPPORT_ENABLED
```
|
```c++
/*
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following disclaimer
* in the documentation and/or other materials provided with the
* distribution.
* * Neither the name of Google Inc. nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "config.h"
#include "web/WebDevToolsFrontendImpl.h"
#include "bindings/core/v8/ScriptController.h"
#include "bindings/core/v8/V8DevToolsHost.h"
#include "core/frame/LocalFrame.h"
#include "core/inspector/DevToolsHost.h"
#include "public/platform/WebSecurityOrigin.h"
#include "public/platform/WebString.h"
#include "public/web/WebDevToolsFrontendClient.h"
#include "web/WebLocalFrameImpl.h"
#include "web/WebViewImpl.h"
namespace blink {
WebDevToolsFrontend* WebDevToolsFrontend::create(
WebView* view,
WebDevToolsFrontendClient* client,
const WebString& applicationLocale)
{
return new WebDevToolsFrontendImpl(toWebLocalFrameImpl(view->mainFrame()), client);
}
WebDevToolsFrontend* WebDevToolsFrontend::create(
WebLocalFrame* frame,
WebDevToolsFrontendClient* client,
const WebString& applicationLocale)
{
return new WebDevToolsFrontendImpl(toWebLocalFrameImpl(frame), client);
}
WebDevToolsFrontendImpl::WebDevToolsFrontendImpl(
WebLocalFrameImpl* webFrame,
WebDevToolsFrontendClient* client)
: m_webFrame(webFrame)
, m_client(client)
{
m_webFrame->setDevToolsFrontend(this);
}
WebDevToolsFrontendImpl::~WebDevToolsFrontendImpl()
{
if (m_devtoolsHost)
m_devtoolsHost->disconnectClient();
if (!m_devtoolsHost || !m_webFrame)
return;
v8::Isolate* isolate = v8::Isolate::GetCurrent();
ScriptState* scriptState = ScriptState::forMainWorld(m_webFrame->frame());
ScriptState::Scope scope(scriptState);
v8::Local<v8::Object> global = scriptState->context()->Global();
global->Delete(v8AtomicString(isolate, "DevToolsHost"));
m_devtoolsHost = nullptr;
}
void WebDevToolsFrontendImpl::didClearWindowObject(WebLocalFrameImpl* frame)
{
if (m_webFrame == frame) {
v8::Isolate* isolate = v8::Isolate::GetCurrent();
ScriptState* scriptState = ScriptState::forMainWorld(m_webFrame->frame());
ScriptState::Scope scope(scriptState);
if (m_devtoolsHost)
m_devtoolsHost->disconnectClient();
m_devtoolsHost = DevToolsHost::create(this, m_webFrame->frame());
v8::Local<v8::Object> global = scriptState->context()->Global();
v8::Local<v8::Value> devtoolsHostObj = toV8(m_devtoolsHost.get(), global, scriptState->isolate());
ASSERT(!devtoolsHostObj.IsEmpty());
global->Set(v8AtomicString(isolate, "DevToolsHost"), devtoolsHostObj);
}
if (m_injectedScriptForOrigin.isEmpty())
return;
String origin = frame->securityOrigin().toString();
String script = m_injectedScriptForOrigin.get(origin);
if (script.isEmpty())
return;
static int s_lastScriptId = 0;
StringBuilder scriptWithId;
scriptWithId.append(script);
scriptWithId.append('(');
scriptWithId.appendNumber(++s_lastScriptId);
scriptWithId.append(')');
frame->frame()->script().executeScriptInMainWorld(scriptWithId.toString());
}
void WebDevToolsFrontendImpl::sendMessageToBackend(const String& message)
{
if (m_client)
m_client->sendMessageToBackend(message);
}
void WebDevToolsFrontendImpl::sendMessageToEmbedder(const String& message)
{
if (m_client)
m_client->sendMessageToEmbedder(message);
}
bool WebDevToolsFrontendImpl::isUnderTest()
{
return m_client ? m_client->isUnderTest() : false;
}
void WebDevToolsFrontendImpl::showContextMenu(LocalFrame* targetFrame, float x, float y, PassRefPtrWillBeRawPtr<ContextMenuProvider> menuProvider)
{
WebLocalFrameImpl::fromFrame(targetFrame)->viewImpl()->showContextMenuAtPoint(x, y, menuProvider);
}
void WebDevToolsFrontendImpl::setInjectedScriptForOrigin(const String& origin, const String& source)
{
m_injectedScriptForOrigin.set(origin, source);
}
} // namespace blink
```
|
The spotted Eastern Ghats skink (Sepsophis punctatus) is a species of skink. It endemic to India and known from its type locality in Andhra Pradesh (Darakondah, Golconda Hills, then Madras Presidency) and from Odissa. It is monotypic in the genus Sepsophis.
References
Skinks
Reptiles of India
Endemic fauna of India
Taxa named by Richard Henry Beddome
Reptiles described in 1870
|
```javascript
var Migrations = artifacts.require("Migrations");
module.exports = function (deployer) {
deployer.deploy(Migrations);
};
```
|
```php
<?php
declare(strict_types=1);
/**
*/
namespace OC\Core\Db;
use OCP\AppFramework\Db\DoesNotExistException;
use OCP\AppFramework\Db\QBMapper;
use OCP\AppFramework\Utility\ITimeFactory;
use OCP\IDBConnection;
/**
* @template-extends QBMapper<LoginFlowV2>
*/
class LoginFlowV2Mapper extends QBMapper {
private const lifetime = 1200;
public function __construct(
IDBConnection $db,
private ITimeFactory $timeFactory,
) {
parent::__construct(
$db,
'login_flow_v2',
LoginFlowV2::class,
);
}
/**
* @param string $pollToken
* @return LoginFlowV2
* @throws DoesNotExistException
*/
public function getByPollToken(string $pollToken): LoginFlowV2 {
$qb = $this->db->getQueryBuilder();
$qb->select('*')
->from($this->getTableName())
->where(
$qb->expr()->eq('poll_token', $qb->createNamedParameter($pollToken))
);
$entity = $this->findEntity($qb);
return $this->validateTimestamp($entity);
}
/**
* @param string $loginToken
* @return LoginFlowV2
* @throws DoesNotExistException
*/
public function getByLoginToken(string $loginToken): LoginFlowV2 {
$qb = $this->db->getQueryBuilder();
$qb->select('*')
->from($this->getTableName())
->where(
$qb->expr()->eq('login_token', $qb->createNamedParameter($loginToken))
);
$entity = $this->findEntity($qb);
return $this->validateTimestamp($entity);
}
public function cleanup(): void {
$qb = $this->db->getQueryBuilder();
$qb->delete($this->getTableName())
->where(
$qb->expr()->lt('timestamp', $qb->createNamedParameter($this->timeFactory->getTime() - self::lifetime))
);
$qb->execute();
}
/**
* @param LoginFlowV2 $flowV2
* @return LoginFlowV2
* @throws DoesNotExistException
*/
private function validateTimestamp(LoginFlowV2 $flowV2): LoginFlowV2 {
if ($flowV2->getTimestamp() < ($this->timeFactory->getTime() - self::lifetime)) {
$this->delete($flowV2);
throw new DoesNotExistException('Token expired');
}
return $flowV2;
}
}
```
|
The 14th Guards Rifle Division was reformed as an elite infantry division of the Red Army in January, 1942, based on the 1st formation of the 96th Rifle Division, which was officially a mountain unit at the time, and served in that role until after the end of the Great Patriotic War. It was on Southern Front when it was redesignated and was soon assigned to the 57th Army. It was encircled during the May German counterattack in the Second Battle of Kharkov. Its first commander was made a prisoner of war, later dying in German captivity. A cadre of the division managed to escape and was sent to the Reserve of the Supreme High Command for rebuilding. In July it joined the 63rd Army and took part in the attacks against the Italian 8th Army that created the bridgehead south of the Don River near Serafimovich during August. In October, now in the 21st Army of Don Front, it was active in two probing attacks against the Romanian forces now containing the bridgehead which inflicted severe casualties in advance of the Soviet winter counteroffensive. At the start of that offensive the division was in 5th Tank Army, but was soon transferred to 1st Guards Army and then to the 3rd Guards Army when that was formed. It was under this Army as it advanced into the Donbas in late winter before returning to 57th Army during most of 1943, fighting through east Ukraine and across the lower Dniepr by the end of the year. After being briefly assigned to 53rd Army in December it was moved to 5th Guards Army in February, 1944 where it remained for the duration, mostly in the 33rd Guards Rifle Corps. It saw action in the Uman–Botoșani Offensive and won its first decoration, the Order of the Red Banner, as it advanced, before being involved in the frustrating battles along the Dniestr River on the Romanian border. In late spring, 1944 the division was redeployed north becoming part of 1st Ukrainian Front and taking part in the Lvov–Sandomierz Offensive into Poland. The 14th Guards made a spectacular advance across Poland during the Vistula-Oder Offensive and was awarded the Order of Lenin for its part in the liberation of Sandomierz. On January 22, 1945, its commander suffered mortal wounds in the fighting for a bridgehead over the Oder River. In the drive on Berlin in April the division and its regiments won further honors and decorations but despite these distinctions it was disbanded in August, 1946.
Formation
The division was officially raised to Guards status on January 24, 1942, in recognition of its role in the first liberation of Rostov-on-Don on December 2, 1941. Its sub-units would not receive their Guards redesignations until February. The 96th had been originally formed as the 24th Rifle "Vinnitsa" Division in November, 1923 in recognition of where it was formed before being renumbered in May, 1924. In September, 1929 it added the honorific "in the name of Jan Fabricius". When it became the 14th Guards it continued to carry these titles as parts of its official designation. In April, 1940 it had been converted to a mountain rifle division and although it is sometimes referred to as a regular rifle division from about October 1 onward in Soviet records it never officially had its designation changed prior to becoming a Guards unit. Its order of battle, based on the first wartime shtat (table of organization and equipment) for rifle divisions, while maintaining some of its mountain equipment (for example, 107mm mortars in place of 120mm mortars), was eventually as follows:
36th Guards Rifle Regiment (from 43rd Mountain Rifle Regiment)
38th Guards Rifle Regiment (from 209th Mountain Rifle Regiment)
41st Guards Rifle Regiment (from 651st Mountain Rifle Regiment)
33rd Guards Artillery Regiment (from 146th Mountain Artillery Regiment)
6th Guards Antitank Battalion (from 63rd Antitank Battalion)
11th Guards Reconnaissance Company
13th Guards Sapper Battalion
16th Guards Signal Battalion
17th Guards Medical/Sanitation Battalion
8th Guards Chemical Defense (Anti-gas) Company
9th Guards Motor Transport Company
15th Guards Field Bakery
1st Guards Divisional Veterinary Hospital
1455th Field Postal Station
362nd Field Office of the State Bank
Maj. Gen. Ivan Shepetov, who had led the 96th (Mountain) Rifle Division since 1940, remained in command. At the time it was redesignated the division was in 37th Army of Southern Front. During February it was transferred to 57th Army in the same Front which was well inside the salient created during the Barvenkovo–Lozovaya offensive which had recently ended.
Second Battle of Kharkov
At the beginning of May 57th Army was still located in the southwest sector of the salient with its positions centered on Star Bliznetsy to the east of Lozovaya. 14th Guards constituted the Army reserve and had its main forces in the former town and one regiment in the latter. Southwestern Front launched an offensive to liberate Kharkov on May 12; Southern Front had no direct role in this even though the southern pincer of the offensive was being launched from the northwest sector of the salient. In the early going the attacking Soviet forces, Army Group Bobkin and 6th Army, made good progress in the direction of Krasnograd, reaching its outskirts by May 15. However the German Army Group South was planning its own operation to end the threat by cutting off the salient entirely; to this end it began regrouping mobile forces to its south, aiming at the 9th Army to the east of 57th Army. On the morning of May 17 the regrouping was complete and the German forces, led by the 14th and 16th Panzer Divisions, went over to the attack.
By 1700 hours the 14th Panzer had captured Barvenkovo. While 14th Guards covered the 57th Army's alternate command post at Star Bliznetsy, the main post was soon overrun. Due to the breakdown in communications the division received no orders to go into battle and remained in place all day, between 20 and 30km from the front line. Overall the German advance had torn 9th Army's defenses apart and left 57th Army in a grave position. It wasn't until the next morning that a directive was received for the division to move east and attack the left flank of the German penetration along with the 2nd Cavalry Corps. Late that day the commander of the Army, Lt. Gen. K. P. Podlas, was killed while leading some of his encircled troops, further worsening the command situation. At the same time the 14th Guards and 2nd Cavalry were fighting to contain the German attack along a line from Novo-Prigozhaia to Prigozhaia to Margaritovka. By midday on May 19 Marshal S. K. Timoshenko, commander of Southwestern Front, acknowledged that his offensive had failed and began moving the mobile forces of 6th Army against the breakthrough sector.
On May 20 the 14th Panzer continued its advance to the north against desperate resistance while the 16th Panzer and 60th Motorized Division struck east towards Lozovaya in an effort to encircle 57th Army. This forced 14th Guards back several kilometres but proved temporary as the German command decided to complete the encirclement of the entire salient instead. On the afternoon of May 22 14th Panzer linked up with the 44th Infantry Division of German 6th Army and this was achieved. The division began moving north in an effort to find an escape route, reaching the south end of the German corridor west of Marevka the next day. The Soviet front along the Donets was 40km away. The encircled forces formed a shock group from the 317th, 393rd and 150th Rifle Divisions, backed by cavalry and tanks, to make a breakthrough while the 14th Guards and remnants of several other divisions were to defend firmly to protect the shock group from the south and southwest. This disorganized effort began at 1000 hours on May 25 and while it made initial progress it soon ran into the 1st Mountain Division within the corridor and was badly shot up. Over the following days the main forces of the division were forced to the west and it's unknown how many of its men managed to break free. General Shepetov was severely wounded and captured near Izium after someone betrayed his location. He survived in the German Flossenbürg concentration camp until May 21, 1943, when he was executed for anti-fascist agitation.
Operation Blue
As of June 1 the remnants of 14th Guards were still in 57th Army, but required considerable rebuilding. Maj. Gen. Afanasy Gryaznov was appointed to command on the same day. By the beginning of July the division was in the Reserve of the Supreme High Command in 5th Reserve Army, being brought back to strength as the German summer offensive unfolded. On July 12 the STAVKA ordered Southwestern Front to be renamed as Stalingrad Front and to have four armies incorporated into its forces, including the former 5th Reserve as 63rd Army. The orders continued: "Defend the eastern bank of the Don River with the 63rd Army in the sector it occupies and prevent the enemy from forcing the Don River under any circumstances." The Army was to link its left flank to the 21st Army in the area of Serafimovich. It remained in this general situation at the start of August.
As the German 6th Army prepared to drive from the Don to Stalingrad the commander of Stalingrad Front, Col. Gen. A. I. Yeryomenko, issued orders on August 18/19 for a series of coordinated counterattacks by his armies to tie down German forces. 63rd Army was directed to advance from a 15km-wide sector west of the Khopyor River southwards across the Don towards Chebotarevskii, Klinovoi and Perelazovskii with 14th Guards and 197th Rifle Divisions with an immediate objective 15-20km south of the river. The attack began at dawn on August 20 and faced the Italian 2nd Infantry Division of 8th Army's XXXV Corps, which had only moved into the sector four days earlier. It gained immediate success and soon held a bridgehead 2-3km deep:Continuing their advance over the next two days the two attacking divisions were soon reinforced by 203rd Rifle Division and 21st Army's 304th Rifle Division. By then they had expanded their bridgehead to a depth of 2-10km, with 14th Guards at the deepest point, the village of Kotovsky. By the time the attack wound down on August 28 the combined Soviet assault force had carved a bridgehead 50km wide and up to 25km deep on the south bank of the Don.
In September Stalingrad Front was reorganized and 63rd Army was reassigned to the new Don Front. Between October 1 and 10 the German Army Group B moved all of Romanian 3rd Army into the defenses facing the Serafimovich bridgehead and the western end of the Kletskaya bridgehead. The commander of 3rd Army, Gen. P. Dumitrescu, sensed the threat posed by these bridgeheads and on September 24 had requested German backing to mount an offensive against them while his Army was still not completely committed. This request was turned down by the German high command, which did not want any resources diverted from the fighting in Stalingrad. In October the 14th Guards was transferred to 21st Army, now in Southwestern Front. Beginning on the night of October 13/14 the division, along with the 124th Rifle Division, began an intense probing attack against the Romanian forces which continued until the 16th, followed by another on its own overnight on October 19/20. The intention was to draw German forces away from Stalingrad but not incidentally these attacks, along with a third by 76th Rifle Division on October 24 - 27, inflicted 13,154 casualties on 3rd Army, roughly the equivalent of what the British 8th Army would suffer in the concurrent Second Battle of El Alamein.
Operation Uranus
In the buildup to the Soviet counteroffensive against the German forces at Stalingrad the 14th Guards was again reassigned, now to the 5th Tank Army, which would be the main shock group of Southwestern Front. Before the main offensive began on November 19 all four of the Army's first-echelon rifle divisions conducted a reconnaissance-in-force with reinforced rifle battalions on the night of November 17/18. Overcoming Romanian forward security outposts and eliminating obstacles as they were encountered the division advanced nearly 2km into the positions of Romanian 9th Infantry Division to the southern slope of Hill 220 and the northern outskirts of State Farm (Sovkhoz) No. 3. This reconnaissance was effective in uncovering and removing minefields and other engineering works and identified many strongpoints in the main defensive line as well as weak spots.
When the true offensive began the 14th Guards manned security positions in a 15km-wide sector, concealing the forward deployment of the 47th Guards and 119th Rifle Divisions into their jumping-off positions for the assault. The division had four tank destroyer regiments attached to support and protect its advance and there was a total of 138 tanks in the bridgehead in the infantry support role. It was on the Army's right (west) flank in much the same positions it had won in August. The attack began between 0848 and 0850 hours Moscow time and during the first hour the rifle divisions overcame the Romanian first defensive positions with relative ease. Following this the 14th Guards found the going much more difficult. With no armor support the division's multiple assaults were broken up by intense flanking artillery, mortar and machine gun fire from a Romanian strongpoint on Hill 228, 4km northwest of Sovkhoz No. 3. The commander of 1st Guards Army to the west attempted to assist with an attack by his 203rd Rifle Division but this failed in the face of determined resistance by the Romanian 11th Infantry Division. By now Romanian resistance was stiffening throughout 5th Tank's sector, evidence that the artillery preparation had not been as effective as planned.
By noon the commander of 5th Tank, Lt. Gen. P. L. Romanenko, decided that if the offensive was to succeed he would have to commit his 1st and 26th Tank Corps. These corps stepped off at 1400 hours, east of the 14th Guards' sector, and effectively obliterated two regiments of the Romanian 14th Infantry Division. While two regiments of the division remained stalled in front of the Romanian defenses, its left-wing regiment managed to exploit the tank-assisted success of 47th Guards with an advance of up to 2km. Over the course of the next day the division continued to slowly move ahead as 9th Romanian refused its right flank to the west and 47th Guards and 8th Cavalry Corps exploited into the gap in the Romanian defenses. The Romanian resistance was so stout that Romanenko was forced to commit his reserve 159th Rifle Division to the fight. In addition a desperate counterattack by the 9th and elements of the 11th Romanian Divisions compelled Romanenko to further reinforce his flank with the 21st Cavalry Division of 8th Cavalry Corps; this reinforced Soviet grouping, supported by a handful of tanks from 1st Tank Corps, forced the two Romanian divisions to withdraw.
On November 21, as most of Romanian 3rd Army was being encircled between 5th Tank and 21st Armies the 14th Guards, along with its reinforcements, continued to push the 9th Romanian west and southwest toward the Krivaia River. In the course of this the 21st Cavalry, many mounted on tanks, overran the headquarters of the Romanian division. Farther to the right the 14th Guards got into its stride, crushing the Romanians' right wing 12-14km east of Verkhnyi Gorbatovsky. The division encircled and captured most of a Romanian infantry regiment during the day, pursuing its remnants and liberating the village before nightfall. The next day General Romanenko was ordered to transfer the division and its supporting artillery to the 1st Guards Army effective on November 23. During the day it conducted local attacks and raids east of the Krivaia in cooperation with the 203rd and 278th Rifle Divisions, penetrating the defenses of the Romanian 9th and 11th Divisions and liberating the towns of Dubovskoi, Rubashkin, Bakhmutkin and Yagodnyi on the Krivaia, 50-55km west-southwest of Serafimovich. Late on the same day forces of the Southwestern and Stalingrad Fronts met and sealed the encirclement of the German forces at Stalingrad.
1st Guards Army set out to encircle and destroy the Romanian 7th and 11th Divisions on November 24, which were defending a wedge of territory between the Don and Krivaia Rivers. The 14th Guards and 203rd Divisions were tasked with attacking westward across the Krivaia on a 6km-wide sector from Gorbatovskaia to Ushakov against the 11th Romanian. At about midday the 266th Rifle Division was ordered into the boundary between the two divisions to fend off any German counterattacks that might materialize. Although most of the attack failed to develop as planned, the division, reinforced by the 266th during the day, penetrated the Romanian defenses and during the day advanced westward up to 16km. By nightfall General Gryaznov reported that his division "attacked the enemy along the 2nd Section State Farm - Ilin - Dulensky line and advanced from 5-16 kilometres, reaching the Konkov, Vislogubov, and Nizhnye Luchki line before being halted." However, Gen. K. A. Hollidt, commander of the German XVII Army Corps, soon dispatched his 62nd and 294th Infantry Divisions with orders to reinforce the Romanians and drive the Soviet forces back across the Krivaia. The next day the 159th Rifle Division of 5th Tank Army moved to tie in closely to the left flank of 14th Guards. The German counterstroke began on November 27 and was successful; the 14th Guards was forced back across the Krivaia.
Operation Little Saturn
As the Axis defenses along the Krivaia and Chir rivers crystalized the Soviet command was forced to reassess its plans. 1st Guards Army had been earmarked for Operation Saturn, which had been intended to destroy the entire Axis position in the Caucasus region. Now circumstances, including the sheer size of the German force encircled at Stalingrad, required a change in plans. On the morning of December 5 the 1st Guards was split with its eastern half, including 14th Guards, becoming the new 3rd Guards Army. Several days earlier the division had been subordinated to the 14th Rifle Corps along with the 203rd Division. The operation, which would also include the 6th Army of Voronezh Front, targeted the German XVII Corps, the weakened divisions of Romanian I Corps and the bulk of Italian 8th Army.
The offensive began on December 16 and the 14th Guards, supported by the 114th Separate Tank Regiment and leading the 1st Guards Mechanized Corps, crashed through the defenses of the German 294th Infantry at Astskhov. Although Army Group Don recorded that the Soviet force lost 17 tanks destroyed and four damaged, it also admitted that "the heights from east of Kriuscha Tal [gorge] to Hill 156 are in enemy hands." The German division brought up reserves which stalled further advance that day, but on the 17th the 1st Guards Mechanized was committed to complete the breakthrough. This was successful, and allowed the division to re-occupy Dulensky by the end of the day. On December 18 the two Soviet units, now joined by 203rd Division, continued to attack and by the end of the day recaptured Konkov, as well as Bokovskaya and Staryi Zemtsov, which broke the last German fortified line. Over three days the Soviet grouping had advanced 15-20km and began to pursue the German 294th and 62nd Divisions, plus the Romanian 7th and 11th, striving to complete their encirclement and destruction in the Kruzhilin area. During the day of December 19 the 14th Rifle and 1st Guards Mechanized Corps, advancing from the south, met the 197th Rifle Division advancing from the north in the Kruzhilin area, completing 3rd Guards Army's immediate task. However on the previous day and overnight the Axis managed to pull out a significant portion of its forces from the pocket and consolidate along the south bank of the Chir. The 3rd Guards commander, Lt. Gen. D. D. Lelyushenko, was ordered to immediately turn the Army's main forces to the south and organize an unremitting pursuit.
Into Ukraine
On December 21 General Gryasnov took over command of the 14th Rifle Corps while remaining in command of the 14th Guards. On January 24, 1943, he was given command of the 15th Rifle Corps and handed the division over to Col. Vladimir Rusakov. By the beginning of February the 3rd Guards Army held a bridgehead over the Northern Donets River south of Voroshilovgrad from which it broke out in a drive to liberate that city. In the plan for the offensive the 14th Rifle Corps (now consisting of the 14th and 61st Guards Rifle Divisions) was not part of the Army's shock group but was instead to reach a line from Georgievskoe to Orekhova to Semeikino to guard its flank from any attack from the southwest. By February 4 the 14th Corps, supported by the 169th Tank Brigade, was operating in the area of heights 207, 202.8 and 206.9. Two days later German forces counterattacked the 61st Guards but were repelled; on February 7 a more powerful attack was made by elements of the 3rd SS Panzer Division supported by 40 tanks which broke through the Soviet front and captured Orlovka, Belo-Skelevatyi and Nizhnii and Verkhnii Gabun. This attack brought the advance on Voroshilovgrad to a halt.
After regrouping his Army General Lelyushenko decided to go over to a decisive offensive on the morning of February 12 to take Voroshilovgrad and subsequently carry out the Army's main task of reaching the Stalino - Ordzhonikidze area. East of the Luganchik River at 0500 hours the 61st Guards' 558th Rifle Regiment, with the 14th Guards' training battalion and two battalions of the 229th Rifle Brigade, defeated the German garrisons in Orlovka and Belo-Skelevatyi. Simultaneously Popovka was seized by the main body of the division, backed by support elements of the 14th Corps, and continued advancing, reaching the Lutugino area by the end of February 14. That morning other units of the 3rd Guards Army, chiefly the 59th Guards and 243rd Rifle Divisions and elements of 2nd Tank Corps, had cleared the city. After this victory the 3rd Guards and 5th Tank Armies pressed on towards Stalino, but on February 20 the German 4th and 1st Panzer Armies began the counteroffensive that would become the Third Battle of Kharkov. While this was primarily aimed at Voronezh Front, Southwestern Front also faced attacks and the overall crisis made any further Soviet advance impossible.
Battle of the Dniepr
In April the 14th Guards returned to 57th Army, still in Southwestern Front, where it came under the 27th Guards Rifle Corps. In July that Corps was moved to 6th Army in the same Front. In August the division was once again assigned to 57th Army, this time to the 64th Rifle Corps; the Army was now part of Steppe Front. Under these headquarters it took part in the Poltava-Kremenchug Offensive beginning on August 26. Colonel Rusakov was replaced in command by Col. Georgii Pavlovich Slatov on September 9. On September 25 the division reached the Dniepr River and the 11th Guards Reconnaissance Company (which was now motorized) forced a crossing under German fire near the village of Pushkarevka which is now part of the city of Verkhnodniprovsk. In recognition of their gallantry, five men of the company were made Heroes of the Soviet Union on December 20.
First Jassy-Kishinev Offensive
In October the division left 64th Corps to come under direct command of 57th Army in the 2nd Ukrainian (former Steppe) Front, while a month later it moved to direct Front control. In December it was again reassigned, now to 53rd Army's 48th Rifle Corps in the same Front. At this time the division's personnel were noted as being roughly 50 percent Russian and 50 percent of several Asian nationalities. On January 29, 1944, Colonel Slatov handed the division over to Col. Vikentii Vasilevich Skryganov; this officer would be promoted to the rank of major general on September 13. In February the 48th Corps was transferred to 5th Guards Army of the same Front and in March the 14th Guards was reassigned to 33rd Guards Rifle Corps; the division would remain in this Army for the duration of the war.
During the Uman–Botoșani Offensive the division took part in the liberation of Novoukrainka on March 17 for which it was decorated on March 29 with the Order of the Red Banner. By mid-April the 5th Guards Army was approaching the Dniestr River in the vicinity of Grigoriopol. 33rd Guards Corps (14th Guards, 9th Guards Airborne and 214th Rifle Divisions) was on the Army's right (north) flank; the Army was on the far left flank of its Front. The Army commander, Lt. Gen. Aleksey Zhadov, had already ordered the Corps to force a crossing of the Dniestr and develop its offensive towards Cimișeni. The Corps faced defenses manned by the German 4th Mountain Division of XXXX Panzer Corps.
The Army began crossing operations, mostly using improvised means, immediately upon reaching the east bank of April 12. The first across was a regiment of 95th Guards Rifle Division of 32nd Guards Rifle Corps. 33rd Guards Corps was intended to cross further north, closer to Grigoriopol but all three divisions were unsuccessful overnight on April 12/13. On April 13 and 14 the remainder of 32nd Guards Corps crossed into the 95th Guards' bridgehead and expanded it by capturing the village of Puhăceni and the town of Speia. General Zhadov ordered 33rd Guards Corps into the bridgehead as well, which was completed by the end of April 16. The bridgehead was now about 12km wide and 8km deep and engineering efforts across the river had allowed Zhadov to move tanks and other heavy weapons into it so offensive operations could be resumed in the direction of Chișinău. 33rd Guards Corps was in the northern half of the bridgehead with the 14th Guards tying in to 32nd Guards Corps to its south.
Zhadov launched his attack at dawn on April 16 after a two-hour artillery and airstrike preparation; 14th Guards was in the second echelon. After about two hours of fighting the first echelon divisions with armor support overpowered the German 320th Infantry Division's forward security belt and by 0930 hours had torn a hole up to 2km wide and 3km deep in the German defenses. The most significant gains were made in a sector 3-6km south of the village of Delacău where the German second defensive position was breached up to 2km deep. However at 1030 hours the German forces replied with their own intense artillery fire and airstrikes and a wave of counterattacks that halted 5th Guards Army in its tracks. Further attacks at 1500 hours by 4th Mountain and 294th Infantry and 13th Panzer Divisions did considerable damage to 95th and 13th Guards Divisions. When the fighting finally died down late on April 17 both sides were thoroughly exhausted and the 5th Guards was back to its starting point. A renewed attack on the 18th, which likely had 14th Guards in the first echelon, made no progress. The bridgehead was reinforced over the following days and a new effort was mounted on April 25 and this time expanded the area of the bridgehead by about one-third; 33rd Guards Corps had advanced 8-10km by May 6. By now it was clear that no successful advance on Chișinău would be made on this axis and 5th Guards was replaced in the bridgehead by 8th Guards Army while the former was redeployed to the northwest for a new assault on Iași in mid-May.
The handover did not go smoothly as the German 6th Army launched new attacks on the bridgehead as it was happening and many of 5th Guards' rifle divisions had to withdraw under enemy fire. Ultimately the Army did not begin concentrating northeast of Iași until May 15 and did not complete the process until the first week of June. This delay, among other events, forced the STAVKA to postpone and later cancel the entire operation. Meanwhile the commander of 2nd Ukrainian Front, Marshal I. S. Konev, was transferred to command of 1st Ukrainian Front on May 24. In June the 5th Guards Army was moved to the Reserve of the Supreme High Command and by the beginning of July it was under command of the same Front. The 14th Guards would remain in this Front for the duration.
Into Poland and Germany
About the beginning of August the personnel of the division were noted as being 25 percent Russian, 50 percent Ukrainian, 15 percent Moldovan, and 10 percent several Asian nationalities. Under 1st Ukrainian Front the division took part in the Lvov–Sandomierz Offensive. In early August the 5th Guards Army entered the bridgehead over the Vistula that had been created by the 6th Guards Tank Corps near Baranów Sandomierski. In September the division was moved to the 101st Rifle Corps of 38th Army in the same Front. It was under these commands when the bridgehead was hit by heavy German counterattacks from October 14-18. In the Draganovo and Palatsuvka region for a short time the German forces managed to encircle several Soviet divisions including the 14th Guards. During its escape the division destroyed 22 enemy guns, 40 mortars, 125 machine guns, while killing up to 2,000 German soldiers and officers and capturing another 27. During the five-day battle the division lost 770 men killed and 2,590 wounded. Later that month the division returned to its previous corps and army.
1st Ukrainian Front launched its part of the Vistula-Oder Offensive on January 12, 1945. On the first day the 14th Guards broke through the entire depth of the German defenses west of Sandomierz and continued to advance through Poland for the next 11 days, covering 265km during that time, killing 1,360 German officers and men and destroying or capturing 17 tanks, 60 guns or mortars, 105 machine guns and 178 motor vehicles. On the night of January 21/22 the division crossed the Oder River off the march 16km northwest of Oppeln. During the advance the 41st Guards Rifle Regiment was awarded an honorific:The Oder bridgehead came under heavy German counterattacks on January 22 and in the course of these General Skryganov was mortally wounded and died on January 26. On April 6 Skryganov would be posthumously made a Hero of the Soviet Union. On February 19 the 14th Guards was decorated with the Order of Lenin, a rare distinction for a rifle division, for its part in the fighting in and around Sandomierz. On the same date the 33rd Guards Artillery Regiment received the Order of the Red Banner and the 41st Guards Rifle was awarded the Order of Kutuzov, 3rd Degree, both for their successes in the fighting for Silesia. The 33rd Guards Artillery and the 38th Guards Rifle were further granted "Wisła" as a battle honor while the 36th Guards Rifle received "Silesia" as the same.
Lower Silesian Offensive
Following the death of General Skryganov the division would be commanded by a succession of colonels: Aleksey Yakovlevich Goryachev (January 26 - March 14); Sigismund Adolfovich Losik-Savitzkii (March 15 - April 20); and Pavel Ivanovich Sikorsky (April 21 - May 11). Beginning on February 8 the 5th Guards Army took part in the Front's Lower Silesian Offensive with its main objective of encircling the German garrison of Breslau. On its sector the offensive was based on the bridgehead seized by 14th Guards in January. The German defense was based on the 269th Infantry Division with several battlegroups, five independent battalions, two panzer battalions and an NCO school. The Army's attack was led by 32nd Guards Rifle Corps and developed slowly over the first three days in large part due to the large number of fortified villages to be overcome and the ammunition shortage faced by all Soviet forces after the breakneck advance through Poland. On February 11 Marshal Konev shifted the 31st Tank Corps from 21st Army and committed it on the sector of 33rd Guards Corps the next day with the immediate objective of capturing the Bogenau area.
On February 13 the Army's offensive developed more successfully than in the preceding days. German resistance did not abate and if anything increased as further forces entered the Breslau area but despite this the 4th Guards and 31st Tank Corps linked up with the 7th Guards Mechanized Corps of 6th Army to complete the encirclement. Konev chose to leave 6th Army to maintain the siege while the 32nd and 33rd Guards Corps of 5th Guards Army were ordered to make a decisive attack from the Magnitz area toward Koberwitz and then to the southwest. The former Corps was reinforced with the 14th Guards, whose former sector was taken over by forces from 21st Army. During the fighting on February 15 the width of the cordon between Breslau and the main German forces was increased to up to 13km. By the end of February 17 the 32nd Guards Corps had arrived in the Liegnitz area, relieving the 3rd Guards Tank Army's 9th Mechanized Corps which then undertook a forced night march which brought it to Bober River in the Lewenberg area. By the beginning of March the division had returned to 33rd Guards Corps.
Berlin Operation
Prior to the start of the Berlin offensive the 14th Guards was again reassigned within 5th Guards Army, now to the 34th Guards Rifle Corps where it joined the 15th and 58th Guards Rifle Divisions. The Army was deployed along the eastern bank of the Neisse River on a 13km front and planned to launch its main attack with its right wing on the 8km sector from Gross Saerchen to Muskau. 34th Guards Corps was in the first echelon with its divisions in a single echelon, but the 14th Guards was not on the attack sector. When the offensive began on April 16 the Army's main forces crossed the Neisse under the cover of massed artillery fire. The first task of 34th Guards Corps was to eliminate a German bridgehead on the eastern bank in the Muskau area. This done, the 15th and 58th Guards Divisions advanced as much as 6km into the German defenses on the west bank. Early the next day the 15th Guards helped clear the passage of the 14th Guards by advancing into the rear of the German forces it was facing.
By April 22 the 5th Guards Army was pursuing defeated German forces to the west, destroying rearguards and advancing 30km during the day. 14th Guards was in part responsible for securing the Army's left flank which had grown to almost 100km in length and was holding along a line from Broten to Wittichenau to Buchwalde with its front facing south. Over the next two days a German force based on elements of 17th and 4th Panzer Armies launched a counteroffensive which broke through the 52nd Army's front along its boundary with the 2nd Polish Army and continued north in the general direction of Spremberg. To counter this effort, Konev ordered Zhadov to use the 33rd Guards Corps and the 14th Guards to attack towards Losa and Ugist (north of Bautzen) and reestablish contact with the Poles. This effort brought the German attack to a halt by the end of April 24. On the next day the 58th Guards Division joined hands with the U.S. 69th Infantry Division at Torgau.
On April 26 Zhadov ordered the 14th Guards to capture Kamenz and link up its left flank to the Polish Army. Fighting continued in this area through April 27-30 with no significant changes in the situation until the German grouping was completely worn out and went over to the defense. During this period the division returned to 33rd Guards Corps. From May 6-11 it took part, with the rest of 1st Ukrainian Front, in the final offensive on Prague.
Postwar
At the time of the German surrender the division carried the official title 14th Guards Rifle, Vinnitsa, Order of Lenin, Order of the Red Banner, in the name of Jan Fabricius Division. [Russian: 14-я гвардейская стрелковая Винницкая ордена Ленина Краснознамённая дивизия имени Яна Фабрициуса.] As part of a postwar wave of decorations on May 28 the 36th Guards Regiment received the Order of Kutuzov, 3rd Degree for its part in the fighting around Cottbus. On June 4 the division as a whole was decorated with the Order of Kutuzov, 2nd Degree, for its part in the capture of Dresden. In July the division came under the command of Maj. Gen. V. A. Samsonov, who had led the 58th Rifle Division until being seriously wounded during the Berlin offensive. In the fall of the year the division was moved to Papa, Hungary, where it was disbanded in 1946.
References
Citations
Bibliography
p. 165
pp. 12-13, 146, 303-04
External links
Ivan Mikhailovich Shepetov
Afanasii Sergeevich Gryaznov
Vladimir Vasilevich Rusakov
Vikentii Vasilevich Skryganov
Vasilii Akimovich Samsonov
HSU Aleksandr Samoylovich Shopin
HSU Egor Akimovich Tokarev
HSU Nikolai Ivanovich Obednyak
HSU Andrei Vasilievich Gryasnov
HSU Mikhail Andreevich Chebotkov
HSU Vikentii Vasilevich Skryganov
G14
Military units and formations established in 1942
Military units and formations disestablished in 1946
Military units and formations awarded the Order of the Red Banner
1942 establishments in the Soviet Union
1946 disestablishments in the Soviet Union
|
The Epiphone Joe Pass Emperor II is an electric guitar model produced by Epiphone in Korea as Joe Pass's signature model. First released in 1994,
just prior to Joe Pass's death, and was produced until 2015.
Origins
Joe Pass was a very well known virtuoso Jazz guitarist becoming most well known for his solo work whilst also having recorded with a number of other leading artists such as Ella Fitzgerald.
Joe Pass previously had a relationship with the Ibanez guitar company, but in the late 1990s Epiphone released the Emperor II, claiming Pass had a hand in the design of the guitar. Epiphone had previously issued the guitar as just the Emperor and with Pass's endorsement some subtle changes to the guitar were made (such as moving the pickup selector switch). While Pass endorsed the Epiphone he was more commonly seen with a Gibson ES-175.
The guitar
The Joe Pass Epiphone Emperor II is an archtop guitar, like a 175, but with certain unique features which included:
Gold-plated hardware
Multiple bound body (top and back), neck, f-holes, and peghead
Laminated spruce top
Maple laminate, hollow body (figured maple veneer)
Dual humbuckers
Raised pickguard with facsimile of Joe Pass' signature
Gibson Byrdland style tailpiece
Solid rosewood, floating bridge
"Joe Pass" model name on truss rod cover
Finishes: Natural, Vintage sunburst, Cherry sunburst (disc) Wine red (disc)
Countries of origin: Korea (disc). Indonesia and China for the Epiphone Joe Pass Emperor II Pro
References
External links
Official Epiphone Product Page
Joe Pass Emperor II review
Joe Pass
Semi-acoustic guitars
|
An ellipsoid is a surface that can be obtained from a sphere by deforming it by means of directional scalings, or more generally, of an affine transformation.
An ellipsoid is a quadric surface; that is, a surface that may be defined as the zero set of a polynomial of degree two in three variables. Among quadric surfaces, an ellipsoid is characterized by either of the two following properties. Every planar cross section is either an ellipse, or is empty, or is reduced to a single point (this explains the name, meaning "ellipse-like"). It is bounded, which means that it may be enclosed in a sufficiently large sphere.
An ellipsoid has three pairwise perpendicular axes of symmetry which intersect at a center of symmetry, called the center of the ellipsoid. The line segments that are delimited on the axes of symmetry by the ellipsoid are called the principal axes, or simply axes of the ellipsoid. If the three axes have different lengths, the figure is a triaxial ellipsoid (rarely scalene ellipsoid), and the axes are uniquely defined.
If two of the axes have the same length, then the ellipsoid is an ellipsoid of revolution, also called a spheroid. In this case, the ellipsoid is invariant under a rotation around the third axis, and there are thus infinitely many ways of choosing the two perpendicular axes of the same length. If the third axis is shorter, the ellipsoid is an oblate spheroid; if it is longer, it is a prolate spheroid. If the three axes have the same length, the ellipsoid is a sphere.
Standard equation
The general ellipsoid, also known as triaxial ellipsoid, is a quadratic surface which is defined in Cartesian coordinates as:
where , and are the length of the semi-axes.
The points , and lie on the surface. The line segments from the origin to these points are called the principal semi-axes of the ellipsoid, because are half the length of the principal axes. They correspond to the semi-major axis and semi-minor axis of an ellipse.
In spherical coordinate system for which , the general ellipsoid is defined as:
where is the polar angle and is the azimuthal angle.
When , the ellipsoid is a sphere.
When , the ellipsoid is a spheroid or ellipsoid of revolution. In particular, if , it is an oblate spheroid; if , it is a prolate spheroid.
Parameterization
The ellipsoid may be parameterized in several ways, which are simpler to express when the ellipsoid axes coincide with coordinate axes. A common choice is
where
These parameters may be interpreted as spherical coordinates, where is the polar angle and is the azimuth angle of the point of the ellipsoid.
Measuring from the equator rather than a pole,
where
is the reduced latitude, parametric latitude, or eccentric anomaly and is azimuth or longitude.
Measuring angles directly to the surface of the ellipsoid, not to the circumscribed sphere,
where
would be geocentric latitude on the Earth, and is longitude. These are true spherical coordinates with the origin at the center of the ellipsoid.
In geodesy, the geodetic latitude is most commonly used, as the angle between the vertical and the equatorial plane, defined for a biaxial ellipsoid. For a more general triaxial ellipsoid, see ellipsoidal latitude.
Volume
The volume bounded by the ellipsoid is
In terms of the principal diameters (where , , ), the volume is
.
This equation reduces to that of the volume of a sphere when all three elliptic radii are equal, and to that of an oblate or prolate spheroid when two of them are equal.
The volume of an ellipsoid is the volume of a circumscribed elliptic cylinder, and the volume of the circumscribed box. The volumes of the inscribed and circumscribed boxes are respectively:
Surface area
The surface area of a general (triaxial) ellipsoid is
where
and where and are incomplete elliptic integrals of the first and second kind respectively. The surface area of this general ellipsoid can also be expressed using the and Carlson symmetric forms of the elliptic integrals by simply substituting the above formula to the respective definitions:
Unlike the expression with and , the variant based on the Carlson symmetric integrals yields valid results for a sphere and only the axis must be the smallest, the order between the two larger axes, and can be arbitrary.
The surface area of an ellipsoid of revolution (or spheroid) may be expressed in terms of elementary functions:
or
or
and
which, as follows from basic trigonometric identities, are equivalent expressions (i.e. the formula for can be used to calculate the surface area of a prolate ellipsoid and vice versa). In both cases may again be identified as the eccentricity of the ellipse formed by the cross section through the symmetry axis. (See ellipse). Derivations of these results may be found in standard sources, for example Mathworld.
Approximate formula
Here yields a relative error of at most 1.061%; a value of is optimal for nearly spherical ellipsoids, with a relative error of at most 1.178%.
In the "flat" limit of much smaller than and , the area is approximately , equivalent to .
Plane sections
The intersection of a plane and a sphere is a circle (or is reduced to a single point, or is empty). Any ellipsoid is the image of the unit sphere under some affine transformation, and any plane is the image of some other plane under the same transformation. So, because affine transformations map circles to ellipses, the intersection of a plane with an ellipsoid is an ellipse or a single point, or is empty. Obviously, spheroids contain circles. This is also true, but less obvious, for triaxial ellipsoids (see Circular section).
Determining the ellipse of a plane section
Given: Ellipsoid and the plane with equation , which have an ellipse in common.
Wanted: Three vectors (center) and , (conjugate vectors), such that the ellipse can be represented by the parametric equation
(see ellipse).
Solution: The scaling transforms the ellipsoid onto the unit sphere and the given plane onto the plane with equation
Let be the Hesse normal form of the new plane and
its unit normal vector. Hence
is the center of the intersection circle and
its radius (see diagram).
Where (i.e. the plane is horizontal), let
Where , let
In any case, the vectors are orthogonal, parallel to the intersection plane and have length (radius of the circle). Hence the intersection circle can be described by the parametric equation
The reverse scaling (see above) transforms the unit sphere back to the ellipsoid and the vectors are mapped onto vectors , which were wanted for the parametric representation of the intersection ellipse.
How to find the vertices and semi-axes of the ellipse is described in ellipse.
Example: The diagrams show an ellipsoid with the semi-axes which is cut by the plane .
Pins-and-string construction
The pins-and-string construction of an ellipsoid is a transfer of the idea constructing an ellipse using two pins and a string (see diagram).
A pins-and-string construction of an ellipsoid of revolution is given by the pins-and-string construction of the rotated ellipse.
The construction of points of a triaxial ellipsoid is more complicated. First ideas are due to the Scottish physicist J. C. Maxwell (1868). Main investigations and the extension to quadrics was done by the German mathematician O. Staude in 1882, 1886 and 1898. The description of the pins-and-string construction of ellipsoids and hyperboloids is contained in the book Geometry and the imagination written by D. Hilbert & S. Vossen, too.
Steps of the construction
Choose an ellipse and a hyperbola , which are a pair of focal conics: with the vertices and foci of the ellipse and a string (in diagram red) of length .
Pin one end of the string to vertex and the other to focus . The string is kept tight at a point with positive - and -coordinates, such that the string runs from to behind the upper part of the hyperbola (see diagram) and is free to slide on the hyperbola. The part of the string from to runs and slides in front of the ellipse. The string runs through that point of the hyperbola, for which the distance over any hyperbola point is at a minimum. The analogous statement on the second part of the string and the ellipse has to be true, too.
Then: is a point of the ellipsoid with equation
The remaining points of the ellipsoid can be constructed by suitable changes of the string at the focal conics.
Semi-axes
Equations for the semi-axes of the generated ellipsoid can be derived by special choices for point :
The lower part of the diagram shows that and are the foci of the ellipse in the -plane, too. Hence, it is confocal to the given ellipse and the length of the string is . Solving for yields ; furthermore .
From the upper diagram we see that and are the foci of the ellipse section of the ellipsoid in the -plane and that .
Converse
If, conversely, a triaxial ellipsoid is given by its equation, then from the equations in step 3 one can derive the parameters , , for a pins-and-string construction.
Confocal ellipsoids
If is an ellipsoid confocal to with the squares of its semi-axes
then from the equations of
one finds, that the corresponding focal conics used for the pins-and-string construction have the same semi-axes as ellipsoid . Therefore (analogously to the foci of an ellipse) one considers the focal conics of a triaxial ellipsoid as the (infinite many) foci and calls them the focal curves of the ellipsoid.
The converse statement is true, too: if one chooses a second string of length and defines
then the equations
are valid, which means the two ellipsoids are confocal.
Limit case, ellipsoid of revolution
In case of (a spheroid) one gets and , which means that the focal ellipse degenerates to a line segment and the focal hyperbola collapses to two infinite line segments on the -axis. The ellipsoid is rotationally symmetric around the -axis and
.
Properties of the focal hyperbola
True curve
If one views an ellipsoid from an external point of its focal hyperbola, than it seems to be a sphere, that is its apparent shape is a circle. Equivalently, the tangents of the ellipsoid containing point are the lines of a circular cone, whose axis of rotation is the tangent line of the hyperbola at . If one allows the center to disappear into infinity, one gets an orthogonal parallel projection with the corresponding asymptote of the focal hyperbola as its direction. The true curve of shape (tangent points) on the ellipsoid is not a circle. The lower part of the diagram shows on the left a parallel projection of an ellipsoid (with semi-axes 60, 40, 30) along an asymptote and on the right a central projection with center and main point on the tangent of the hyperbola at point . ( is the foot of the perpendicular from onto the image plane.) For both projections the apparent shape is a circle. In the parallel case the image of the origin is the circle's center; in the central case main point is the center.
Umbilical points
The focal hyperbola intersects the ellipsoid at its four umbilical points.
Property of the focal ellipse
The focal ellipse together with its inner part can be considered as the limit surface (an infinitely thin ellipsoid) of the pencil of confocal ellipsoids determined by for . For the limit case one gets
In general position
As a quadric
If is a point and is a real, symmetric, positive-definite matrix, then the set of points that satisfy the equation
is an ellipsoid centered at . The eigenvectors of are the principal axes of the ellipsoid, and the eigenvalues of are the reciprocals of the squares of the semi-axes: , and .
An invertible linear transformation applied to a sphere produces an ellipsoid, which can be brought into the above standard form by a suitable rotation, a consequence of the polar decomposition (also, see spectral theorem). If the linear transformation is represented by a symmetric 3 × 3 matrix, then the eigenvectors of the matrix are orthogonal (due to the spectral theorem) and represent the directions of the axes of the ellipsoid; the lengths of the semi-axes are computed from the eigenvalues. The singular value decomposition and polar decomposition are matrix decompositions closely related to these geometric observations.
Parametric representation
The key to a parametric representation of an ellipsoid in general position is the alternative definition:
An ellipsoid is an affine image of the unit sphere.
An affine transformation can be represented by a translation with a vector and a regular 3 × 3 matrix :
where are the column vectors of matrix .
A parametric representation of an ellipsoid in general position can be obtained by the parametric representation of a unit sphere (see above) and an affine transformation:
.
If the vectors form an orthogonal system, the six points with vectors are the vertices of the ellipsoid and are the semi-principal axes.
A surface normal vector at point is
For any ellipsoid there exists an implicit representation . If for simplicity the center of the ellipsoid is the origin, , the following equation describes the ellipsoid above:
Applications
The ellipsoidal shape finds many practical applications:
Geodesy
Earth ellipsoid, a mathematical figure approximating the shape of the Earth.
Reference ellipsoid, a mathematical figure approximating the shape of planetary bodies in general.
Mechanics
Poinsot's ellipsoid, a geometrical method for visualizing the torque-free motion of a rotating rigid body.
Lamé's stress ellipsoid, an alternative to Mohr's circle for the graphical representation of the stress state at a point.
Manipulability ellipsoid, used to describe a robot's freedom of motion.
Jacobi ellipsoid, a triaxial ellipsoid formed by a rotating fluid
Crystallography
Index ellipsoid, a diagram of an ellipsoid that depicts the orientation and relative magnitude of refractive indices in a crystal.
Thermal ellipsoid, ellipsoids used in crystallography to indicate the magnitudes and directions of the thermal vibration of atoms in crystal structures.
Lighting
Ellipsoidal reflector floodlight
Ellipsoidal reflector spotlight
Medicine
Measurements obtained from MRI imaging of the prostate can be used to determine the volume of the gland using the approximation (where 0.52 is an approximation for )
Dynamical properties
The mass of an ellipsoid of uniform density is
The moments of inertia of an ellipsoid of uniform density are
For these moments of inertia reduce to those for a sphere of uniform density.
Ellipsoids and cuboids rotate stably along their major or minor axes, but not along their median axis. This can be seen experimentally by throwing an eraser with some spin. In addition, moment of inertia considerations mean that rotation along the major axis is more easily perturbed than rotation along the minor axis.
One practical effect of this is that scalene astronomical bodies such as generally rotate along their minor axes (as does Earth, which is merely oblate); in addition, because of tidal locking, moons in synchronous orbit such as Mimas orbit with their major axis aligned radially to their planet.
A spinning body of homogeneous self-gravitating fluid will assume the form of either a Maclaurin spheroid (oblate spheroid) or Jacobi ellipsoid (scalene ellipsoid) when in hydrostatic equilibrium, and for moderate rates of rotation. At faster rotations, non-ellipsoidal piriform or oviform shapes can be expected, but these are not stable.
Fluid dynamics
The ellipsoid is the most general shape for which it has been possible to calculate the creeping flow of fluid around the solid shape. The calculations include the force required to translate through a fluid and to rotate within it. Applications include determining the size and shape of large molecules, the sinking rate of small particles, and the swimming abilities of microorganisms.
In probability and statistics
The elliptical distributions, which generalize the multivariate normal distribution and are used in finance, can be defined in terms of their density functions. When they exist, the density functions have the structure:
where is a scale factor, is an -dimensional random row vector with median vector (which is also the mean vector if the latter exists), is a positive definite matrix which is proportional to the covariance matrix if the latter exists, and is a function mapping from the non-negative reals to the non-negative reals giving a finite area under the curve. The multivariate normal distribution is the special case in which for quadratic form .
Thus the density function is a scalar-to-scalar transformation of a quadric expression. Moreover, the equation for any iso-density surface states that the quadric expression equals some constant specific to that value of the density, and the iso-density surface is an ellipsoid.
In higher dimensions
A hyperellipsoid, or ellipsoid of dimension in a Euclidean space of dimension , is a quadric hypersurface defined by a polynomial of degree two that has a homogeneous part of degree two which is a positive definite quadratic form.
One can also define a hyperellipsoid as the image of a sphere under an invertible affine transformation. The spectral theorem can again be used to obtain a standard equation of the form
The volume of an -dimensional hyperellipsoid can be obtained by replacing by the product of the semi-axes in the formula for the volume of a hypersphere:
(where is the gamma function).
See also
Ellipsoidal dome
Ellipsoid method
Ellipsoidal coordinates
Elliptical distribution, in statistics
Flattening, also called ellipticity and oblateness, is a measure of the compression of a circle or sphere along a diameter to form an ellipse or an ellipsoid of revolution (spheroid), respectively.
Focaloid, a shell bounded by two concentric, confocal ellipsoids
Geodesics on an ellipsoid
Geodetic datum, the gravitational Earth modeled by a best-fitted ellipsoid
Homoeoid, a shell bounded by two concentric similar ellipsoids
List of surfaces
Superellipsoid
Notes
References
External links
"Ellipsoid" by Jeff Bryant, Wolfram Demonstrations Project, 2007.
Ellipsoid and Quadratic Surface, MathWorld.
Geometric shapes
Surfaces
Quadrics
ta:நீளுருண்டை
|
```objective-c
#ifndef GVBARMODELMAPPER_H
#define GVBARMODELMAPPER_H
#include "ringqt.h"
#include <QtCharts>
extern "C" {
#include "ring.h"
}
class GVBarModelMapper : public QtCharts::QVBarModelMapper
{
Q_OBJECT
public:
struct VM *pVM;
struct List *pParaList;
char cfirstBarSetColumnChangedEvent[RINGQT_EVENT_SIZE];
char cfirstRowChangedEvent[RINGQT_EVENT_SIZE];
char clastBarSetColumnChangedEvent[RINGQT_EVENT_SIZE];
char cmodelReplacedEvent[RINGQT_EVENT_SIZE];
char crowCountChangedEvent[RINGQT_EVENT_SIZE];
char cseriesReplacedEvent[RINGQT_EVENT_SIZE];
GVBarModelMapper(QObject * parent,VM *pVM );
~GVBarModelMapper();
void geteventparameters(void) ;
void setfirstBarSetColumnChangedEvent(const char *cStr);
void setfirstRowChangedEvent(const char *cStr);
void setlastBarSetColumnChangedEvent(const char *cStr);
void setmodelReplacedEvent(const char *cStr);
void setrowCountChangedEvent(const char *cStr);
void setseriesReplacedEvent(const char *cStr);
const char *getfirstBarSetColumnChangedEvent(void);
const char *getfirstRowChangedEvent(void);
const char *getlastBarSetColumnChangedEvent(void);
const char *getmodelReplacedEvent(void);
const char *getrowCountChangedEvent(void);
const char *getseriesReplacedEvent(void);
public slots:
void firstBarSetColumnChangedSlot();
void firstRowChangedSlot();
void lastBarSetColumnChangedSlot();
void modelReplacedSlot();
void rowCountChangedSlot();
void seriesReplacedSlot();
};
#endif
```
|
Blue House Field was a football ground in the Hendon area of Sunderland, England. It was the original home of Sunderland A.F.C hosting the club between 1880 and 1881. It hosted rivals Sunderland Albion F.C. between 1888 and 1892. While the home of Sunderland Albion, Blue House Field hosted matches in the Football Alliance and the FA Cup.
Sunderland A.F.C. Tenancy
Sunderland A.F.C, originally called Sunderland District Teachers Association Football Club, rented the Blue House Field on their formation in 1879 as it was in close proximity to the Hendon Board School where founder James Allan taught. They used it to train until they hosted their very first game on 13 November 1880. They had dropped the 'District Teachers' part of the name before playing a single game, having struggled to find enough teachers to field a team. The first game was a friendly against Ferryhill, which the visitors won 1 - 0. A few weeks later on Blue House Field, Sunderland won their first game; a 4 - 0 victory over Ovingham.
Blue House Field hosted its first competitive football game on December 11, 1880, when Sunderland faced Burnopfield in the Northumberland and Durham Challenge Cup, a precursor to the Durham Challenge Cup and the only opportunity for football teams in the North East to play competitive games at that time. The game ended in a 2 - 2 draw.
The following season, Blue House Field hosted a handful of friendlies, but no competitive games, as Sunderland had been eliminated from the challenge cup while playing away to Sedgefield. The annual rent of £10 was proving onerous for the fledgling club, so it moved away from Blue House Field to find a cheaper home.
Sunderland Albion F.C. Tenancy
In 1888, following a dispute over the direction of the club, Sunderland Albion F.C. were formed as a rival to Sunderland A.F.C. Although they played their first game at Newcastle Road, Albion came to find Blue House Field their home. Blue House Field lacked stands and fencing, meaning that spectators could watch games for free. This was in contrast to their older neighbours, who had moved into Newcastle Road and were charging spectators an entry fee. Undeterred, Albion, which contained a number of players poached from Sunderland A.F.C, quickly grew in stature, winning the Durham Challenge Cup in 1889 (holders Sunderland had chosen to withdraw from a game against Albion rather than allow them to take the gate receipts).
Football Alliance
Both clubs applied for membership to the Football League in 1889, but neither was accepted. Albion decided to become founder members of the Football Alliance instead. Blue House Field therefore hosted the first competitive league football in Sunderland, as Albion hosted 12 matches in the 1889-90 Football Alliance against teams including Nottingham Forest F.C. (won 4 - 0), Small Heath (later to become Birmingham City F.C.) (won 6 - 1), Newton Heath (later to become Manchester United F.C.) (won 4 - 0), and the eventual champions Sheffield Wednesday F.C. (lost 3 - 2). The relative success of the club led to Blue House Field being expanded, with a cycle track and a grandstand added.
Albion's application to join the Football League was again rejected, while Sunderland A.F.C (who had spent the 1889-90 season playing friendly matches) were accepted into the league. League membership brought with it both national prestige and local crowds, which dealt a huge blow to Albion's long-term ambitions of becoming the town's main team. Now over-shadowed by their neighbours, they decided to play in two leagues simultaneously; the Football Alliance and the Northern Football League. In the 1890–91 Football Alliance they finished a narrow second to Stoke City F.C. who had been ejected from the Football League at Sunderland's expense. They remained unbeaten at Blue House Field that season and recorded an impressive 11 - 1 victory over Walsall F.C.
Northern League
Albion also took part in the 1890-91 Northern Football League, finishing third. In that season, Blue House Field also hosted FA Cup football, as Albion reached the last 16, drawing at home to Nottingham Forest F.C. before losing a third replay on neutral ground.
Despite impressive performances, Albion's league application was once again rejected, with a solitary vote being cast in their favour. Facing financial difficulty, Albion elected not to play in the Alliance (with its relatively long-distance travel), instead choosing to focus on the more local Northern Football League. They finished sixth in the 1891-92 season.
in April 1892, Blue House Field once again hosted Sunderland A.F.C - eleven years after the club moved away. Albion welcomed their Football League rivals for a friendly match, the fourth and final meeting between the clubs, and the first not to be played at Newcastle Road. It did not end well for the hosts, with Sunderland, who were just about to be crowned English Champions for the first time, running out 8 - 0 winners in front of an estimated crowd of 2,000.
With the financial troubles mounting, Albion folded in the summer of 1892, and Blue House Field no longer played host to professional football, though to this day it still plays host to amateur and junior teams.
References
Football Alliance venues
Home Grounds of Sunderland A.F.C.
|
```c++
////////////////////////////////////////////////////////////////////////////////////////////////////
//
// Project: Embedded Learning Library (ELL)
// File: IIRFilterNode.cpp (nodes)
// Authors: Chuck Jacobs
//
////////////////////////////////////////////////////////////////////////////////////////////////////
#include "IIRFilterNode.h"
#include <emitters/include/EmitterException.h>
#include <emitters/include/EmitterTypes.h>
#include <emitters/include/IRLocalValue.h>
#include <dsp/include/FFT.h>
#include <math/include/MathConstants.h>
namespace ell
{
namespace nodes
{
namespace detail
{
// Returns an array with the coeff values in reverse order, and almost doubled in length
// [b0, b1, b2] is returned as [b2, b1, b0, b2, b1, b0]
template <typename ValueType>
std::vector<ValueType> GetFilterCoeffArray(const std::vector<ValueType>& coeffs)
{
std::vector<ValueType> result;
result.reserve(coeffs.size() * 2);
std::reverse_copy(coeffs.begin(), coeffs.end(), std::back_inserter(result));
std::reverse_copy(coeffs.begin(), coeffs.end(), std::back_inserter(result));
// This is slightly wasteful of memory --- we only need the last entry in this array
// to make the indexing simpler for the recurrent filter coefficients
// The non-recurrent coefficients could use this and be fine:
// std::reverse_copy(coeffs.begin()+1, coeffs.end(), std::back_inserter(result));
return result;
}
} // namespace detail
template <typename ValueType>
IIRFilterNode<ValueType>::IIRFilterNode() :
CompilableNode({ &_input }, { &_output }),
_input(this, {}, defaultInputPortName),
_output(this, defaultOutputPortName, 0),
_filter({}, {})
{
}
template <typename ValueType>
IIRFilterNode<ValueType>::IIRFilterNode(const model::OutputPort<ValueType>& input, const std::vector<ValueType>& b, const std::vector<ValueType>& a) :
CompilableNode({ &_input }, { &_output }),
_input(this, input, defaultInputPortName),
_output(this, defaultOutputPortName, _input.Size()),
_filter(b, a)
{
}
template <typename ValueType>
void IIRFilterNode<ValueType>::Compute() const
{
std::vector<ValueType> output = _filter.FilterSamples(_input.GetValue());
_output.SetOutput(output);
};
template <typename ValueType>
void IIRFilterNode<ValueType>::Copy(model::ModelTransformer& transformer) const
{
const auto& newInputs = transformer.GetCorrespondingInputs(_input);
auto newNode = transformer.AddNode<IIRFilterNode<ValueType>>(newInputs, _filter.GetFeedforwardCoefficients(), _filter.GetRecursiveCoefficients());
transformer.MapNodeOutput(output, newNode->output);
}
template <typename ValueType>
void IIRFilterNode<ValueType>::Compile(model::IRMapCompiler& compiler, emitters::IRFunctionEmitter& function)
{
using namespace std::string_literals;
auto& module = function.GetModule();
const auto inputSize = input.Size();
const auto bSize = _filter.GetFeedforwardCoefficients().size();
const auto aSize = _filter.GetRecursiveCoefficients().size();
// Allocate global variables to accumulate the previous input and output
llvm::GlobalVariable* prevInput = module.GlobalArray("prevInput_"s + GetInternalStateIdentifier(), std::vector<ValueType>(bSize, 0.0));
llvm::GlobalVariable* prevOutput = module.GlobalArray("prevOutput_"s + GetInternalStateIdentifier(), std::vector<ValueType>(aSize, 0.0));
// Allocate global constants for the A and B filter coefficients
std::vector<ValueType> bCoeffValues = detail::GetFilterCoeffArray(_filter.GetFeedforwardCoefficients());
std::vector<ValueType> aCoeffValues = detail::GetFilterCoeffArray(_filter.GetRecursiveCoefficients());
llvm::GlobalVariable* bCoeffs = module.ConstantArray("bCoeffs_"s + GetInternalStateIdentifier(), bCoeffValues);
llvm::GlobalVariable* aCoeffs = module.ConstantArray("aCoeffs_"s + GetInternalStateIdentifier(), aCoeffValues);
// Allocate global variable for current input and output indices
llvm::GlobalVariable* xIndexVar = module.Global<int>("xIndex_"s + GetInternalStateIdentifier(), 0);
llvm::GlobalVariable* yIndexVar = module.Global<int>("yIndex_"s + GetInternalStateIdentifier(), 0);
// Get input
emitters::LLVMValue pInput = compiler.EnsurePortEmitted(input);
emitters::LLVMValue pOutput = compiler.EnsurePortEmitted(output);
// Allocate local variable to accumulate y
emitters::LLVMValue yVar = function.Variable(emitters::GetVariableType<ValueType>(), "y");
// Loop over input entries
function.For(inputSize, [=](emitters::IRFunctionEmitter& function, emitters::LLVMValue inputIndex) {
auto* inputVal = function.ValueAt(pInput, inputIndex);
// zero out accumulator
function.StoreZero(yVar);
// Store current x_t
auto xIndex = function.LocalScalar(function.Load(xIndexVar));
function.SetValueAt(prevInput, xIndex, inputVal); // X[i] = x_t
// compute dot product X dot B
auto bOffset = function.LocalScalar((int)bSize - 1) - xIndex;
function.For(bSize, [prevInput, bCoeffs, bOffset, yVar](emitters::IRFunctionEmitter& function, emitters::LLVMValue iVar) {
auto i = function.LocalScalar(iVar);
auto xVal = function.LocalScalar(function.ValueAt(prevInput, i));
auto bVal = function.LocalScalar(function.ValueAt(bCoeffs, bOffset + i));
function.Store(yVar, function.LocalScalar(function.Load(yVar)) + (xVal * bVal));
});
// compute dot product Y dot A
auto yIndex = function.LocalScalar(function.Load(yIndexVar));
auto aOffset = function.LocalScalar((int)aSize) - yIndex;
function.For(aSize, [prevOutput, aCoeffs, aOffset, yVar](emitters::IRFunctionEmitter& function, emitters::LLVMValue jVar) {
auto j = function.LocalScalar(jVar);
auto yVal = function.LocalScalar(function.ValueAt(prevOutput, j));
auto aVal = function.LocalScalar(function.ValueAt(aCoeffs, aOffset + j));
function.Store(yVar, function.LocalScalar(function.Load(yVar)) - (yVal * aVal));
});
// Store current y_t
auto y = function.Load(yVar);
function.SetValueAt(prevOutput, yIndex, y); // Y[i] = y_t
function.SetValueAt(pOutput, inputIndex, y); // output[inputIndex] = y_t
// Update xIndex and yIndex
function.Store(xIndexVar, function.Operator(emitters::TypedOperator::moduloSigned, xIndex + function.LocalScalar(1), function.LocalScalar((int)bSize)));
function.Store(yIndexVar, function.Operator(emitters::TypedOperator::moduloSigned, yIndex + function.LocalScalar(1), function.LocalScalar((int)aSize)));
});
}
template <typename ValueType>
void IIRFilterNode<ValueType>::WriteToArchive(utilities::Archiver& archiver) const
{
Node::WriteToArchive(archiver);
archiver[defaultInputPortName] << _input;
archiver["filter"] << _filter;
}
template <typename ValueType>
void IIRFilterNode<ValueType>::ReadFromArchive(utilities::Unarchiver& archiver)
{
Node::ReadFromArchive(archiver);
archiver[defaultInputPortName] >> _input;
archiver["filter"] >> _filter;
_output.SetSize(_input.Size());
}
//
// Explicit instantiation definitions
//
template class IIRFilterNode<float>;
template class IIRFilterNode<double>;
} // namespace nodes
} // namespace ell
```
|
```shell
#!/usr/bin/env bash
if gpgme-config --libs &>/dev/null; then
echo containers_image_openpgp
fi
```
|
94.1 Magik FM (DWVN 94.1 MHz) is an FM station owned and operated by Century Broadcasting Network. Its studios and transmitter are located at Quezon Ave., Vigan.
References
External links
Magik FM Vigan FB Page
Radio stations in Ilocos Sur
Radio stations established in 1992
|
```smalltalk
// This file is part of Core WF which is licensed under the MIT license.
// See LICENSE file in the project root for full license information.
namespace System.Activities;
[Serializable]
public class WorkflowApplicationUnloadedException : WorkflowApplicationException
{
public WorkflowApplicationUnloadedException()
{
}
public WorkflowApplicationUnloadedException(string message)
: base(message)
{
}
public WorkflowApplicationUnloadedException(string message, Guid instanceId)
: base(message, instanceId)
{
}
public WorkflowApplicationUnloadedException(string message, Exception innerException)
: base(message, innerException)
{
}
public WorkflowApplicationUnloadedException(string message, Guid instanceId, Exception innerException)
: base(message, instanceId, innerException)
{
}
protected WorkflowApplicationUnloadedException(SerializationInfo info, StreamingContext context)
: base(info, context)
{
}
}
```
|
```javascript
/** Used for built-in method references. */
var objectProto = Object.prototype;
/**
* Used to resolve the
* [`toStringTag`](path_to_url#sec-object.prototype.tostring)
* of values.
*/
var nativeObjectToString = objectProto.toString;
/**
* Converts `value` to a string using `Object.prototype.toString`.
*
* @private
* @param {*} value The value to convert.
* @returns {string} Returns the converted string.
*/
function objectToString(value) {
return nativeObjectToString.call(value);
}
module.exports = objectToString;
```
|
```c++
/*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include "SkPdfLineAnnotationDictionary_autogen.h"
#include "SkPdfNativeDoc.h"
SkString SkPdfLineAnnotationDictionary::Subtype(SkPdfNativeDoc* doc) {
SkPdfNativeObject* ret = get("Subtype", "");
if (doc) {ret = doc->resolveReference(ret);}
if ((ret != NULL && ret->isName()) || (doc == NULL && ret != NULL && ret->isReference())) return ret->nameValue2();
// TODO(edisonn): warn about missing required field, assert for known good pdfs
return SkString();
}
bool SkPdfLineAnnotationDictionary::has_Subtype() const {
return get("Subtype", "") != NULL;
}
SkString SkPdfLineAnnotationDictionary::Contents(SkPdfNativeDoc* doc) {
SkPdfNativeObject* ret = get("Contents", "");
if (doc) {ret = doc->resolveReference(ret);}
if ((ret != NULL && ret->isAnyString()) || (doc == NULL && ret != NULL && ret->isReference())) return ret->stringValue2();
// TODO(edisonn): warn about missing required field, assert for known good pdfs
return SkString();
}
bool SkPdfLineAnnotationDictionary::has_Contents() const {
return get("Contents", "") != NULL;
}
SkPdfArray* SkPdfLineAnnotationDictionary::L(SkPdfNativeDoc* doc) {
SkPdfNativeObject* ret = get("L", "");
if (doc) {ret = doc->resolveReference(ret);}
if ((ret != NULL && ret->isArray()) || (doc == NULL && ret != NULL && ret->isReference())) return (SkPdfArray*)ret;
// TODO(edisonn): warn about missing required field, assert for known good pdfs
return NULL;
}
bool SkPdfLineAnnotationDictionary::has_L() const {
return get("L", "") != NULL;
}
SkPdfDictionary* SkPdfLineAnnotationDictionary::BS(SkPdfNativeDoc* doc) {
SkPdfNativeObject* ret = get("BS", "");
if (doc) {ret = doc->resolveReference(ret);}
if ((ret != NULL && ret->isDictionary()) || (doc == NULL && ret != NULL && ret->isReference())) return (SkPdfDictionary*)ret;
// TODO(edisonn): warn about missing default value for optional fields
return NULL;
}
bool SkPdfLineAnnotationDictionary::has_BS() const {
return get("BS", "") != NULL;
}
SkPdfArray* SkPdfLineAnnotationDictionary::LE(SkPdfNativeDoc* doc) {
SkPdfNativeObject* ret = get("LE", "");
if (doc) {ret = doc->resolveReference(ret);}
if ((ret != NULL && ret->isArray()) || (doc == NULL && ret != NULL && ret->isReference())) return (SkPdfArray*)ret;
// TODO(edisonn): warn about missing default value for optional fields
return NULL;
}
bool SkPdfLineAnnotationDictionary::has_LE() const {
return get("LE", "") != NULL;
}
SkPdfArray* SkPdfLineAnnotationDictionary::IC(SkPdfNativeDoc* doc) {
SkPdfNativeObject* ret = get("IC", "");
if (doc) {ret = doc->resolveReference(ret);}
if ((ret != NULL && ret->isArray()) || (doc == NULL && ret != NULL && ret->isReference())) return (SkPdfArray*)ret;
// TODO(edisonn): warn about missing default value for optional fields
return NULL;
}
bool SkPdfLineAnnotationDictionary::has_IC() const {
return get("IC", "") != NULL;
}
```
|
Sardar Khan's Roza or Nawab Sardar Khan's Mosque and Tomb, is a mosque and tomb complex in Jamalpur area of Ahmedabad, India.
History and architecture
Sardar Khan was a minister of Ahmedabad during Mughal rule. He did not provide help to Mughal prince Dara Shikoh, who fled from captivity of Aurangzeb.
Sardar Khan's Roza was built in 1685. The tomb of Sardar Khan was built of stone and had a marble floor. The mosque was made of bricks situated on high platform, and the façade of the mosque had three pointed arches and two minarets on either side. The minarets were four storeys high, which were octagonal at the base and circular in the upper parts. This minaret had gilt balls on the top and had three large onion shaped domes, while the gateway had two domes too. The tomb and mosque have been encroached since 1884 and are in bad shape now.
References
Mosques in Ahmedabad
Religious buildings and structures completed in 1685
Monuments of National Importance in Gujarat
|
Britain's Next Top Model, Cycle 5 is the fifth cycle of Britain's Next Top Model and the fifth cycle to air on Living. With an increased budget, Cycle 5 claims to be "bigger, better and more high-fashion than ever before."
The winner of this cycle, like the previous cycles (excluding Cycle 1), received a contract with modelling agency Models 1, became the face of a Max Factor cosmetics campaign, and a cover and six-page spread in Company Magazine. This was Lisa Snowdon's last series as the host before she was replaced by model Elle Macpherson.
Mecia Simson was the winner of the competition.
Runner-up Sophie Sumner along with fellow contestants Annaliese Dayes and Ashley Brown also participated as contestants on America's Next Top Model: British Invasion along with four other former BNTM contestants. While Brown and Dayes were eliminated in the 5th and 11th episodes respectively, Sumner would later claim victory as the winner of ANTM Cycle 18.
Production
This cycle saw major changes in the show. While Lisa Snowdon and Huggy Ragnarsson both returned to the judging panel, head garment designer and distinguished milliner, Louis Mariette, took over from Gerry DeVeaux. This series was also the first to feature a boot-camp stage, with 20 semi-finalists starting the competition in the cycle premiere, the largest number of girls that the show has started with so far. 7 girls were eliminated in the first episode, and the number of contestants was reduced to the top 13 who entered the Britain's Next Top Model house, in London.
This is the second cycle (after cycle 1) with two international destinations. In episode 6, the top 9 contestants travelled to Reykjavík, and in episode 9, the top 5 contestants travelled to Buenos Aires.
Contestants
(ages stated are at start of contest)
Episodes
The Girls Go To Boot Camp
Original airdate: 20 April 2009
The 20 potential contestants arrive at a country manor house with a champagne reception, and are soon greeted by host Lisa, who informs them they are to enter the gruelling model boot camp. Amongst the girls is Hayley, who was chosen by the public to take part following an online vote. After completing an assault course at Henfold Lakes Dorking, now home to the famous 'Nuts Challenge' (probably the longest army assault course in the world) the girls did a catwalk challenge featuring clothing from the Ed Hardy range, as well as a brief individual meeting with the judges, 5 girls are eliminated when they don't find dog tags in boxes placed on their beds.
Eliminated: Emily Holmes, Emma Ward, Jennifer Thomas-Grant, Natalie Henry & Natasha Causon
The episode's photo challenge sees the remaining 15 girls put in the following three groups of five for an army inspired shoot with Huggy:
At panel, the judges have praise for Mecia, Viola, Hayley, Jade, Chloe and Kasey, who all stand out in their pictures, as well as Lauren, who is rather bizarrely told by new judge Louis that she is 'the new Moulin Rouge'.
Daisy is told she looks dead in the eyes, while Ashley disappoints when she states she is not happy with the way she has photographed. Mecia receives the first call out and is thrilled to be told she has booked a billboard campaign in the USA for Christian Audigier, after impressing on the catwalk. Ultimately, 2 more girls are eliminated; Nell because of some wrist worry from the judge and her look not being versatile, and Rebecca over concern of her commitment to the competition. The 13 girls are finally ready to enter the Top Model house.
First Call-Out: Mecia Simson
Bottom Three: Ashley Brown, Nell Naberro & Rebecca Ball
Eliminated: Nell Naberro & Rebecca Ball
Featured photographer: Huggy Ragnarsson
Quizzes and Castings
Original airdate: 27 April 2009
The girls excitedly move into the model house and are thrilled with their new abode. The following morning they are split into two teams for a very raucous fashion quiz, with the winners (Ashley, Daisy, Jade, Kasey, Lisa-Ann & Sophie) receiving designer watches. The week's challenge is to film an advert on the Millennium bridge wearing Elizabeth Emanuel bridal wear. The girls have to deliver some dialogue then kiss a male model. Kasey impresses and wins the challenge, while Mecia irritates the photographer by refusing to kiss the model, worried she will upset her boyfriend of four years.
The girls return home to find high heels all over the living room and are delighted when J. Alexander (Miss J) appears from behind a curtain and informs the 'model bitches' it's time for them to learn how to walk. Daisy and Hayley prove to be amongst the strongest, while Lisa-Ann and Chloe's efforts are heavily derided and amusingly imitated by Miss J.
The week's photo shoot challenge asks the girls to pose naked in a bath of water filled with mangos for the brand Simple Cosmetics. Sophie struggles, going into 'panic mode' once in the water, while Ashley is concerned how her body will look considering she has had two children.
At elimination, the judges have praise for Daisy, Hayley, Mecia and Kasey, while Chloe is told her picture looks like soft porn. Mecia is also reprimanded for her performance at the week's challenge. Ultimately, Sophie and Lisa-Ann wind up in the bottom two; Sophie because of her poor performance at the photo-shoot and Lisa-Ann due to having a generally dismal week. Lisa-Ann is the first girl to be sent home from the model house.
First call-out: Kasey Wynter
Bottom two: Lisa-Ann Hillman & Sophie Sumner
Eliminated: Lisa-Ann Hillman
Featured photographer: Christopher Bissell (credited as Chris Bissell)
Special guests: Simon Withington, Elizabeth Emanuel, J. Alexander, Lloyd Nwagboso, Rachel Snary
Re-style and Rhythm
Original airdate: 4 May 2009
Tensions rise in the model house when Annaliese tells the other girls to turn off the kitchen's extractor fan as she can smell mackerel and tuna in her bedroom at the other side of the house. Chloe answers back, accusing Annaliese of not washing her scrambled eggs pan with washing up liquid, which results in Annaliese angrily branding Chloe a wannabe porn star and lads mag model.
The following day the girls arrive at Daniel Galvin salon to excitedly receive their long-awaited makeovers. Madeleine is very upset with her short, asymmetric ginger bob, and thinks she looks like a boy or "even a lesbian". Sophie and Ashley are also less than pleased with their short, edgier haircuts, although Kasey takes the removal of her blonde weave in her stride and seems happy with her short black bob. It is Viola, however, who impresses the salon's management the most, and she is chosen to model for their 50th anniversary ad campaign.
The week's challenge involves the girls performing a dance routine in groups of four at London's Movida nightclub. Mecia and Annaliese impress and they along with the winning group of four (Ashley, Daisy, Hayley, & Kasey) get to party the night away at the club, while the losers return home. At the week's photo shoot, the girls are taken to an underground carpark and are shocked when they're told they are to be paired up and will be kissing their partner in the following pairs:
Sophie is disgusted that she will have to kiss Mecia, who has been sick the night before from drinking too much. Hayley, Daisy and Lauren perform confidently, while Chloe & Ashley struggles to feel comfortable on set.
At panel, the judges have praise for Daisy, Hayley, Jade, Lauren, Viola, Mecia & Kasey. Madeleine is reprimanded for her attitude at the makeovers, though she redeems herself in her photo, but it is Ashley and Chloe who land in the bottom two for their weak performance at the photo shoot, with Chloe being told by photographer Nicky Johnston that her becoming a model is about as likely as him studying medicine at Harvard. In a shocking twist, Lisa announces that both girls are to be given another chance and no-one is eliminated.
First call-out: Kasey Wynter
Bottom two: Ashley Brown & Chloe Cummings
Eliminated: None
Featured photographer: Nicky Johnston
Special guests: James Galvin, Louise Galvin, Jaime Karitzis, Daniele Sismondi, Alex Evans (uncredited), Leanne Nagle (uncredited), Rachael Cairns (uncredited)
Charity
Original airdate: 11 May 2009
Returning home from judging panel, many of the girls, particularly Sophie and Daisy, are angry that nobody was eliminated. Chloe in particular is targeted, with some girls questioning her place in the competition.
The following morning the girls are excited to meet 'rock royalty', Jo Wood, who challenges them to perform a short inspirational speech in front of a group of 12- to 16-year-olds. Jade impresses, talking candidly about her battle with anorexia, while Chloe particularly disappoints with her talk on her passion, make up. She also gets in trouble for lecturing against animal cruelty whilst wearing a leather jacket. Surprisingly to some of the other girls, Daisy wins the challenge.
The next day the girls meet Johnny Vaughan at Capital FM, who interviews the girls in groups of three, with Lisa watching behind the scenes. Viola performs particularly badly, not saying one word throughout, while Annaliese impresses and wins the challenge, choosing to take Ashley on a shopping spree for the prize.
The week's photo challenge involves the girls posing for adverts highlighting issues raised by various different charities and campaigns as follows:
At panel the judges told that Sophie's close-up is a mess, but the wide is insane. Both Jade and Daisy continues to impress, but Ashley produced the most believable photo, of which she has been a victim of domestic violence in the past. Both Viola and Madeleine impressed for their QUIT campaign, Chloe receives praise for her huge improvement from last week, Mecia's photograph is well received but she is told that her film was poor. The rest of the girls receive much more negative reviews. Ultimately, Lauren and Kasey wind up in the bottom two, and Lauren is sent home because of her limited look and the lack of variety in her facial expressions.
First call-out: Sophie Sumner
Bottom two: Kasey Wynter & Lauren Wee
Eliminated: Lauren Wee
Featured photographer: Matthew Brindle
Special guests: Johnny Vaughan, Jo Wood, Leah Wood (in video message), Lina El-Solh (Know Your Limits rep), Robbie LeBlanc (PETA Europe rep), Claire Everett (Frank rep), Alison Walsh (Quit rep)
Kylie Couture
Original airdate: 18 May 2009
The girls are taken to a London club where they are introduced to Louise Redknapp. In turn, the girls interview Louise, with the girl that impresses the most having her interview featured on Handbag.com. Sophie and Chloe are reprimanded for asking inappropriate and negative questions, but Hayley impresses and is delighted to be chosen by Louise as the winner.
The week's second reward challenge sees the girls modelling hats and headwear by judge Louis, and having to walk elegantly to impress a party of people, including Fashion Director, Hilary Alexander, who asks each girl probing questions. Again, Chloe disappoints, tripping on some rose petals on the floor, but Louis is pleased with the performances by Hayley, Daisy and especially Jade, who wins the challenge and a specially made head piece designed by Louis.
Back at the house, the girls are excited to receive a video message from Kylie Minogue, who explains that this week's photo-shoot will be for her new perfume, 'Couture', and the girls will be wearing elegant evening dresses harking back to 1920s glamour. At the photo-shoot, Jade, Daisy and Mecia impress, while Kasey and Chloe struggle to relax on set.
At panel, the judges have praise for Jade, who receives the first call out, as well as Daisy and Mecia. Ultimately, both for the second time, Kasey and Chloe wind up in the bottom two, for producing lacklustre photos. Despite Kasey receiving two consecutive first call-outs in the first two weeks, the girls are shocked when Lisa reveals that both girls in the bottom two are eliminated from the competition due to not pushing through and delivering strong pictures.
First call-out: Jade McSorley
Bottom two/Eliminated: Chloe Cummings & Kasey Wynter
Featured photographer: Johnny Blue-Eyes
Special guests: Belinda White, Louise Redknapp, Hilary Alexander, Kylie Minogue (in 2 video messages), Rachel Hardy, Giles Pearson
Ice Queens
Original airdate: 25 May 2009
The girls are excited to learn they are to go on a surprise overseas trip where they are to take part in a photo shoot in the freezing cold. The following day, judge and photographer Huggy Ragnarsson meets them at London Heathrow Airport and reveals they're going to Iceland. At dinner in their new destination, some of the girls question what they're eating - a harbinger of the challenge they will face the next day.
The challenge is to shoot a commercial to market Iceland. Andrea Brabin, who runs a casting agency, tells the girls they are to wear Icelandic clothes, eat Icelandic food and recite a line in the local language, while shooting the commercial. The sheep's head horrifies the girls and some girls have trouble eating the delicacy, including Jade who does not eat the meat because of her vegetarianism. Some excel in the commercial however, especially Sophie, who is the eventual winner of the challenge.
The girls' photo shoot the next day is on the rocky shoreline of the Blue Lagoon, with each girl representing a different queen. Most girls do a good job, based on feedback by Huggy who is the week's photographer, but Viola is lightly reprimanded for her inability to keep still.
Before the girls are due to leave Iceland, Viola and Ashley end up fighting back at the hotel, with Ashley accusing Viola of having no manners, which leaves Viola angry and in tears.
Back in the UK and straight at panel, Daisy is given the opportunity to be a guest judge on the panel due to the fact that she excelled at the photo shoot, making her exempt from elimination. Viola is told by Huggy and Lisa that her picture is strong, but Louis disagrees, thinking she looks boring and flat. Jade's picture, however, is unanimously praised, and she is told that she is growing in confidence and definitely progressing. Mecia, Hayley and Ashley also received huge praise for their beautiful photo's, while the judges thought Sophie's photograph is good but not great.
Ultimately, Annaliese and Madeleine end up in the bottom two. Annaliese is told that her energy and enthusiasm is causing her to lose focus while the judges see Madeleine as having an ideal face for beauty but she is missing height and edge. In the end, Madeleine is sent home due to her lack of editorial appeal.
Immune / First call-out: Daisy Payne
Bottom two: Annaliese Dayes & Madeleine Wheatley
Eliminated: Madeleine Wheatley
Featured photographer: Huggy Ragnarsson
Special guests: Andrea Brabin
Sink or Swim
Original airdate: 1 June 2009
The weekly challenge involves the girls all posing for photographs wearing Faith shoes, with the winning two pictures being displayed in shop windows throughout the country. Despite good performances from Jade and Annaliese, it is Sophie and Ashley who impress the most and win the challenge, and as an extra treat, the girls are taken to a luxury nail salon, where they get the chance to drink champagne and discuss the behaviour of their fellow competitors.
The week's photo-shoot proves to be the most gruelling to date, with each girl posing underwater in a large tank, wearing a Louis Mariette headpiece and a gown designed by Debbie Gething (now Debbie Wingham). Jade impresses the most, despite being so light that she finds it hard to stay under water, although Hayley and Viola panic and do not perform so confidently.
Back at the house, there is further tension, mainly surrounding Viola's supposed attitude problem. But it is Ashley and Mecia who end up coming to blows, with Mecia accused of being a 'two-faced bitch' with regards to her behaviour around Viola.
At panel, most of the girls produced poor photos, and only Jade, Viola and Ashley shine. Jade received yet another first call-out for her outstanding photo and her facial expression underwater, while Viola is very close behind, as the judges really like how she changes herself underwater so she can look "Long, Lean, and Beautiful". Ashley shocked Lisa when she pulled off a decent photo, but rest of the others failed to impress the judges.
Sophie's pose in her photo received positive reviews, however her facial expression was criticized heavily. Mecia was lambasted for looking dead and drowned in her photo rather than beautiful, while Annaliese's bubbly personality did not show in her photo but ended up looking "afraid of a shark coming". But it was Daisy and Hayley, both of them producing stunning shots the week before but poor photos this week. Daisy's stronger performance keeps her safe while Hayley's inconsistent performance sent her home.
First call-out: Jade McSorley
Bottom two: Daisy Payne & Hayley Buchanan
Eliminated: Hayley Buchanan
Featured photographer: Michele Civelli (challenge), Zena Holloway (photo shoot)
Special guests: Alistair Monteith, Ruth Ross, Debbie Gething
Surprise Casting
Original airdate: 8 June 2009
The seven remaining girls return to the house following Hayley's surprise elimination, and Mecia finds she is the only girl to receive a personal letter from Hayley, upsetting Ashley who felt that, also being Scottish, she should have got one too. The girls learn that they are to attend two separate castings, with the first being for Imodium. Viola struggles, and admits she is unaware what the product is, whilst Sophie is unable to correctly name the product. Ashley is initially confident, but following her meeting, finds that the other girls are shocked at how blunt her description of the product was. Annaliese impresses, and wins a potential role in a television campaign for Imodium, to the amusement of the others.
At the second casting, the girls are excited to meet Pearl Lowe who is looking for another girl to star alongside her daughter, the model Daisy Lowe for her new look-book. Mecia is selected as the best and wins the job. Jade is told that she is too skinny for the campaign, and she breaks down on the way home.
Next the girls head to a wind tunnel, to film a potential commercial for Rice Cakes. Sophie tells Viola that people have died from using a wind tunnel, causing her to perform badly. Daisy is deemed the best, and wins tickets to a private fashion party, choosing to take Sophie with her.
At the party, and just as Sophie is expressing her delight that 'Scouse' was eliminated, Chloe's cousin, and former BNTM runner-up Abigail Clancy arrives, prompting Sophie to worry that Chloe had said bad things about her. Later, Daisy and Sophie lie to the other girls, making up a story that they met a fictional fashion designer, which most of the other girls, and Jade in particular believe.
The girls head to their photo shoot which sees them posing with a burning car for a potential Lipsy campaign. Abigail appears to monitor the girls' performances on set, and Daisy and Sophie are forced to reveal that they had met her the night before, which the others take it in good humour. At panel, Abigail returns as the guest judge for the week, and informs the rest of the panel that Sophie seemed like a know-it-all and acting disgustingly every time.
The girls are generally considered disappointing, including Jade which had been always producing impressive shots the previous weeks. The only girl that had a stunning photo is Viola, as the judges really inspired with how she changed her shy persona into a glamorous woman in the shot, and she also using her whole body as an asset and working them together to produce a powerful photograph with her personality successfully comes through. However, even if her shot isn't close to match Viola's impressive shot (mostly because she totally forgot the car), Mecia was deemed very good on the set (as did Viola's) and the client love her, so she received the first call-out.
The rest of the girls produce a disappointing shots, such as: Jade is criticized for not knowing what she's doing because she didn't either look commercial or editorial, Ashley's pose deemed as decent but she totally forget the car. Daisy's body proportion is praised for looking long and lean, but her facial expression deemed by Huggy as "Driving Miss Daisy in Drag". But the last two girls are the most unimpressive. Sophie ended in the bottom two, despite producing a good photo but Abigail and the client was so disappointed of her because she acted disgustingly and seemed like a know-it-all, with Annaliese, who the judges think was holding back. Sophie is spared, with Annaliese sent home.
First call-out: Mecia Simson
Bottom two: Annaliese Dayes & Sophie Sumner
Eliminated: Annaliese Dayes
Featured photographer: Rachel Joseph
Special guests: Fraser Belk, Abigail Clancy, Caroline Copsey, Julia Anderton, Eira Ellis, Pearl Lowe, Dahlia Schaeffer
Face, Face, Face
Original airdate: 15 June 2009
The girls are immediately thrown into a photo shoot for Company magazine, the magazine that is going to put the winner on the cover. The twist is that the photo shoot is with the upcoming rock band The Script. This causes a few of the girls to get star struck and impacts negatively on their photo. Sophie wins the challenge and chooses Daisy to come with her to The Script's gig later that evening, with both girls enjoying champagne backstage with the band afterwards. Back at the house, tension brews when Ashley accuses Sophie of breaking a promise that they had made previously, where Sophie would take Ashley on a reward in exchange for tips on photo shoots.
The second challenge of the week is a commercial for Special K. Lisa, having done several commercials for the company, tells the girls now is the time to step up. She's especially concerned about Viola and even gives her a special pep talk with regards to her attitude. Jade also gets some one-to-one time with Lisa because of her weight, and she talks candidly about her battle with anorexia. Despite this extra attention, Sophie takes home the prize for the second time this episode, which was a video message from loved ones from home.
The photo shoot is a recreation of the famous Kate Moss lace body suit beauty shot. Terry O'Neill, who photographed the original, is not particularly impressed with anybody's performance on set, with the exception of Mecia and especially Jade, who he thinks might have something special.
After the shoot, Lisa shows off her skills from Strictly Come Dancing with her professional dance partner from the show, Brendan Cole. The dancing isn't completely irrelevant, as Lisa uses it to reveal that the girls (with the exception of one) are headed to Buenos Aires.
At panel, Terry has criticism for all the girls except Jade, with some judges expressing that they prefer Jade's picture to Kate Moss'. The judges also love Viola's shot, while Mecia is told she would work better as an actress. Terry tells Sophie that he doesn't 'get her look' at all. Ashley shocks the judges by admitting that she had attended the photo shoot hungover. Ashley winds up in the bottom two due to her lack of professionalism and Daisy is placed in the bottom two for producing lackluster photos, and it is early favourite Daisy and her 'wonky' eye who is shockingly sent home due to her lack of vitality and for looking older than she is, whilst the other girls get ready to head to Argentina.
First call-out: Jade McSorley
Bottom two: Ashley Brown & Daisy Payne
Eliminated: Daisy Payne
Featured photographer: Diana Gomez (Company photo shoot), Terry O'Neill (Kate Moss photo shoot)
Special guests: Sarah Cumming, Brendan Cole, The Script, Victoria White
Time to Tango
Original airdate: 22 June 2009
The girls excitedly arrive in Buenos Aires and are thrilled to be given a tour of the city by a male model, who Viola seems particularly enamoured with. Their first task is to perform a fashion show for the local elite society, modelling polo clothes. Sophie is shocked to be criticised by Lisa for her steely expression and uninviting body language, while Jade is praised for her moves. The fivesome are allowed to enjoy the remainder of the party, which Sophie and Ashley use as an opportunity to flirt with the male guests.
The following day the girls head into the desert to do a casting for a commercial. They have a few lines to deliver including something in Spanish, as well as having to interact with the male models and get on a horse. Mecia struggles slightly with the words, and her Spanish is unintelligible. Jade does a fairly good job, while Ashley forgets her words and giggles too much. Viola is deemed the worst, completely forgetting her words and the director eventually gives up on her. Sophie, however, does an excellent job, and wins yet another challenge. Afterwards, they had to stay at Purmamarca for the night.
Next, the girls head into the famous Argentinian Salt Flats for a photo shoot for a potential nationwide campaign for Skin Bliss. Mecia has quite a good shoot, but lacks diversity of facial expressions, as does Ashley who is visibly nervous. Again, Viola does not let her personality shine through, while Jade and Sophie perform confidently.
At panel, Jade is praised for her photo, as is Sophie, who is thrilled to learn she has won the campaign. Despite producing a good photo, Viola is reprimanded for her unprofessional attitude on set at the commercial casting, and ends up in the bottom two with Ashley, who the judges feel is not taking the competition as seriously as she should. In a very shocking ending to everyone, Viola is sent home because the judges feeling she had seemed to give up, despite having a strong look, very strong portfolio and just had second call-out three weeks in a row and four in total.
First call-out: Sophie Sumner
Bottom two: Ashley Brown & Viola Szekely
Eliminated: Viola Szekely
Featured photographer: Rachel Joseph
Special guests: Ignacio Archain, Ivan Valdivizzo, Caroline Reynolds, Beltran Zuberbuhler
Latino Dancing and Latino Loving
Original airdate: 29 June 2009
The girls are given a crash course in Latin dancing at a traditional Argentinian dance hall, and then an hour later sent to perform a tango on the streets of La Boca. None of the girls fare particularly well, although Ashley's confused performance leaves the most to be desired. Back at the house, Ashley argued with Sophie and feels that she was wanting to get Jade out of the house.
The following day the girls are sent on their first go-sees. The first is with Elite Model Management, who quiz the girls on their eating and exercise habits. Ashley admits that she has a bad diet, while Sophie does not impress when she states that shopping comprises the largest part of her exercise regime. The second go-see is at the boutique of top designer, Benito Fernandez, where each girl enjoys strutting their stuff in his colourful clothes. Next the girls are taken to see haute couture designer Pablo Ramirez, where Louis announces that Jade has impressed the most throughout the day, and she is delighted to be able to choose one of Pablo's dresses to keep.
Back at the house, the girls are joined again by their model tour guide, Ivan, and his equally dashing friend. The evening's drinking games lead to frolics in the pool, resulting in Ashley and Sophie getting amorous with the boys, and Sophie branding Ashley's aggressive goodbye kiss with her man as bordering on soft porn.
The next day's photo-shoot is for the very high fashion Catalogue magazine, with each girl having to pose seductively with a male model while dressed in regal attire. Sophie sets the bar high with an impressive performance on set, while Jade also shines, delivering some sexy poses, which leaves Sophie questioning whether Jade is as nice and innocent as she seems.
At panel, Jade received another first call-out, thus making her tie with Cycle 3's runner up Louise Watts for the most collective first call-out in a season for the model. However, Mecia and a very nervous Ashley in the bottom two. Mecia is criticised for not interacting effectively with the boy model and an uninspiring performance on set as well as not delivering a variety of facial expressions, but at least has produced a lucky shot, while it is agreed that Ashley looks stiff in her photo and might have given too little too late. Unfortunately, it is Ashley that is sent back to the UK.
First call-out: Jade McSorley
Bottom two: Ashley Brown & Mecia Simson
Eliminated: Ashley Brown
Featured photographer: Candelaria Gil
Special guests: Benito Fernandez, Pablo Ramirez, Jimena Nahon, Ivan Valdivizzo, Ginette Reynal, Belén Vińas
The Finale is Coming
Original airdate: 6 July 2009
The three remaining girls arrive in Buenos Aires for the Fashion Week. They have to work backstage. Later, they are challenged to re-enact scenes from the life of Argentinian icon Eva Perón for a photo shoot, in two different shots each (a full length shot and beauty shot). During elimination, it is Jade who is sent home. Afterwards, Sophie and Mecia are whisked back to London in preparation for the final catwalk showdown.
Final three: Jade McSorley, Mecia Simson & Sophie Sumner
Eliminated: Jade McSorley
Featured photographer: Huggy Ragnarsson
Finale
Original airdate: 6 July 2009
The pressure mounts as the remaining two competitors face the glare of the press and the glamour of the modeling high-life before their final showdown. All of the eliminated models (including Hayley, Madeleine & Daisy) come back to support them, as did the finalists families. Mecia was crowned Britain's Next Top Model for 2009.
Final two: Mecia Simson & Sophie Sumner
Britain's Next Top Model: Mecia Simson
Special guests: Fraser Belk, Rosie Huntington-Whiteley, Peaches Geldof, Sara Nathan, Jodie Kidd, Abigail Clancy, Lee Lapthorne, Percy Parker, Amy Molyneux
Note: This episode aired at 10pm due to the launch of Four Weddings
Summaries
Call-out order
The contestant was eliminated
The contestant was part of a non-elimination bottom two
The contestant was immune from elimination
The contestant won the competition
In episode 1, the pool of 20 girls was reduced to 13 who moved on to the main competition. There were two separate eliminations; in the first, five girls were eliminated outside of panel, and in the second, two girls were eliminated.
Average call-out order
Episode 13 is not included.
Bottom two
The contestant was eliminated after their first time in the bottom two
The contestant was eliminated after their second time in the bottom two
The contestant was eliminated after their fourth time in the bottom two
The contestant was eliminated in the semi-final judging and placed third
The contestant was eliminated in the final judging and placed as the runner-up
Photo shoot guide
Episode 1 photo shoot: Army bootcamp in groups (casting)
Episode 2 photo shoot: Naked mango bath for skin campaign
Episode 3 photo shoot: Rock couture lesbians
Episode 4 photo shoot: Social awareness campaigns
Episode 5 photo shoot: Kylie Minogue "Couture" fragrance ad
Episode 6 photo shoot: 9 Nordic queens of Iceland
Episode 7 photo shoot: Underwater nymphs
Episode 8 photo shoot: Glam with a burning car
Episode 9 photo shoots: Fans of The Script; Kate Moss beauty shot replicas
Episode 10 photo shoot: Nude with a towel in an Argentinian salt plain for Skin Bliss campaign
Episode 11 photo shoot: Tango dancers
Episode 12 photo shoot: Re-enacting Eva Perón
Judges
Lisa Snowdon
Huggy Ragnarsson
Louis Mariette
Ratings
Episode viewing figures from BARB
References
External links
Britain's Next Top Model 5 Official Site
05
2009 British television seasons
Television shows filmed in England
Television shows filmed in Iceland
Television shows filmed in Argentina
|
Allegory of Virtue and Vice may refer to:
Allegory of Virtue and Vice (Lotto)
Allegory of Virtue and Vice (Veronese)
|
```kotlin
package mega.privacy.android.app.presentation.imagepreview.menu
import mega.privacy.android.domain.entity.VideoFileTypeInfo
import mega.privacy.android.domain.entity.node.ImageNode
import mega.privacy.android.domain.entity.shares.AccessPermission
import mega.privacy.android.domain.usecase.shares.GetNodeAccessPermission
import javax.inject.Inject
internal class ChatImagePreviewMenu @Inject constructor(
private val getNodeAccessPermission: GetNodeAccessPermission,
) : ImagePreviewMenu {
override suspend fun isInfoMenuVisible(imageNode: ImageNode): Boolean {
return haveOwnerAccessPermission(imageNode)
}
override suspend fun isSlideshowMenuVisible(imageNode: ImageNode): Boolean {
return imageNode.type !is VideoFileTypeInfo
}
override suspend fun isFavouriteMenuVisible(imageNode: ImageNode): Boolean {
return false
}
override suspend fun isLabelMenuVisible(imageNode: ImageNode): Boolean {
return false
}
override suspend fun isDisputeMenuVisible(imageNode: ImageNode): Boolean {
return imageNode.isTakenDown
}
override suspend fun isOpenWithMenuVisible(imageNode: ImageNode): Boolean {
return false
}
override suspend fun isForwardMenuVisible(imageNode: ImageNode): Boolean {
return true
}
override suspend fun isSaveToDeviceMenuVisible(imageNode: ImageNode): Boolean {
return true
}
override suspend fun isImportMenuVisible(imageNode: ImageNode): Boolean {
return true
}
override suspend fun isGetLinkMenuVisible(imageNode: ImageNode): Boolean {
return false
}
override suspend fun isSendToChatMenuVisible(imageNode: ImageNode): Boolean {
return false
}
override suspend fun isShareMenuVisible(imageNode: ImageNode): Boolean {
return false
}
override suspend fun isRenameMenuVisible(imageNode: ImageNode): Boolean {
return false
}
override suspend fun isHideMenuVisible(imageNode: ImageNode): Boolean {
return false
}
override suspend fun isUnhideMenuVisible(imageNode: ImageNode): Boolean {
return false
}
override suspend fun isMoveMenuVisible(imageNode: ImageNode): Boolean {
return false
}
override suspend fun isCopyMenuVisible(imageNode: ImageNode): Boolean {
return false
}
override suspend fun isRestoreMenuVisible(imageNode: ImageNode): Boolean {
return false
}
override suspend fun isRemoveMenuVisible(imageNode: ImageNode): Boolean {
return false
}
override suspend fun isAvailableOfflineMenuVisible(imageNode: ImageNode): Boolean {
return false
}
override suspend fun isRemoveOfflineMenuVisible(imageNode: ImageNode): Boolean {
return false
}
override suspend fun isMoreMenuVisible(imageNode: ImageNode): Boolean {
return true
}
override suspend fun isMoveToRubbishBinMenuVisible(imageNode: ImageNode): Boolean {
return false
}
private suspend fun haveOwnerAccessPermission(
imageNode: ImageNode,
) = getNodeAccessPermission(imageNode.id)?.let { accessPermission ->
accessPermission == AccessPermission.OWNER
} ?: false
}
```
|
```javascript
Use `splice()` to remove an item from an array
Truthiness
Counting the months from zero
`NaN` is a number
Extra function arguments are undefined by default
```
|
Everett Dedman Woods was an architect based in Memphis, Tennessee. He was the younger brother of fellow architect Neander Woods Jr. The Coca-Cola bottling plant he designed in Covington, Tennessee is listed on the National Register of Historic Places and a residence he built in Memphis became corporate headquarters for Harrah's Entertainment. He also designed East High School in Memphis.
He worked with George Mahan Jr. designing residences for many prominent citizens before establishing his own firm in 1930.
One of his designs, Poplar Plaza, was the first shopping center in Memphis and, according to a planning official in Memphis, the first shopping center in the United States designed for the automobile. John B. Goodwin was the developer. East High School was the largest and finest school in Memphis history when it was built and was the city's first integrated high school.
Work
Scates Hall at the University of Memphis (1921) chief architect
Coca-Cola Bottling Plant, 126 US 51, S Covington, TN Woods, Everett NRHP listed
Everett Cook House which became Harrah's Entertainment Corporate Headquarters and then Wright Medical's headquarters (1938), 1023 Cherry Rd.
East High School (1946) 3206 Poplar Avenue
West Tennessee Tuberculosis Hospital (1948) in association with another architectural firm
Poplar Plaza (1949) at Poplar and Highland, Memphis an early example of a shopping center
Brooks Art Museum wing (1950) since demolished
Commercial block on Madison along with a planned but never built apartment building
Further reading
Memphis An Architectural Guide by Eugene J. Johnson and Robert D. Russell Jr., The University of Tennessee Press, 1990, pp. 305–306
Selections from the work of George Mahan, Jr., architect [and] Everett Woods, associate. Memphis
References
Year of birth missing
Year of death missing
Architects from Tennessee
|
Parascutigera nubila is a species of centipede in the Scutigeridae family. It is endemic to New Caledonia, a French overseas territory in Melanesia. It was first described in 1923 by French entomologist Henri Ribaut.
Distribution
The species occurs on the main island of Grande Terre. The type locality is Mont Canala.
References
nubila
Centipedes of New Caledonia
Animals described in 1923
Taxa named by Henri Ribaut
|
```java
package com.kelin.mvvmlight.zhihu.newsdetail;
import java.util.List;
import retrofit2.http.GET;
import retrofit2.http.Path;
import rx.Observable;
/**
* Created by kelin on 16-4-29.
*/
public interface NewsDetailService {
@GET("/api/4/news/{id}")
public Observable<NewsDetail> getNewsDetail(@Path("id") long id);
public class NewsDetail{
/**
* body : T
* image_source : Angel Abril Ruiz / CC BY
* title :
* image : path_to_url
* share_url : path_to_url
* js : []
* ga_prefix : 050615
* images : ["path_to_url"]
* type : 0
* id : 3892357
* css : ["path_to_url"]
*/
private String body;
private String image_source;
private String title;
private String image;
private String share_url;
private String ga_prefix;
private int type;
private int id;
private List<?> js;
private List<String> images;
private List<String> css;
private String cssStr;
public String getCssStr() {
return cssStr;
}
public void setCssStr(String cssStr) {
this.cssStr = cssStr;
}
public String getBody() {
return body;
}
public void setBody(String body) {
this.body = body;
}
public String getImage_source() {
return image_source;
}
public void setImage_source(String image_source) {
this.image_source = image_source;
}
public String getTitle() {
return title;
}
public void setTitle(String title) {
this.title = title;
}
public String getImage() {
return image;
}
public void setImage(String image) {
this.image = image;
}
public String getShare_url() {
return share_url;
}
public void setShare_url(String share_url) {
this.share_url = share_url;
}
public String getGa_prefix() {
return ga_prefix;
}
public void setGa_prefix(String ga_prefix) {
this.ga_prefix = ga_prefix;
}
public int getType() {
return type;
}
public void setType(int type) {
this.type = type;
}
public int getId() {
return id;
}
public void setId(int id) {
this.id = id;
}
public List<?> getJs() {
return js;
}
public void setJs(List<?> js) {
this.js = js;
}
public List<String> getImages() {
return images;
}
public void setImages(List<String> images) {
this.images = images;
}
public List<String> getCss() {
return css;
}
public void setCss(List<String> css) {
this.css = css;
}
}
}
```
|
```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.
-->
<window xmlns="path_to_url"
class="com.haulmont.cuba.gui.app.core.categories.AttributesLocationFrame"
messagesPack="com.haulmont.cuba.gui.app.core.categories">
<companions>
<web class="com.haulmont.cuba.web.app.core.categories.AttributesLocationCompanion"/>
</companions>
<layout height="100%" spacing="true">
<hbox spacing="true" >
<lookupField id="columnsCountLookupField" caption="msg://attributesLocation.columnsCountLookupCaption"
nullOptionVisible="false" width="175px"/>
<button id="saveBtn" invoke="saveCoordinates" caption="msg://attributesLocation.saveBtnCaption" align="BOTTOM_RIGHT"/>
</hbox>
<hbox spacing="true">
<dataGrid id="sourceDataGrid" metaClass="sys$CategoryAttribute"
editorEnabled="false" width="175px" settingsEnabled="false" columnsCollapsingAllowed="false">
<columns>
<column caption="msg://attributesLocation.sourceColumnCaption" id="name" property="localeName" sortable="false"/>
</columns>
</dataGrid>
<hbox id="hBox"/>
</hbox>
</layout>
</window>
```
|
```yaml
series:
- name: emsk
socs:
- name: emsk_em7d
- name: emsk_em9d
- name: emsk_em11d
```
|
```objective-c
/*
This file is part of Slate.
Slate is free software: you can redistribute it and/or modify
(at your option) any later version.
Slate 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 Slate. If not, see <path_to_url
*/
#ifndef DELETENOTECOMMAND_H
#define DELETENOTECOMMAND_H
#include <QDebug>
#include "note.h"
#include "slate-global.h"
#include "undocommand.h"
class Project;
class SLATE_EXPORT DeleteNoteCommand : public UndoCommand
{
public:
DeleteNoteCommand(Project *project, const Note ¬e, UndoCommand *parent = nullptr);
void undo() override;
void redo() override;
int id() const override;
private:
friend QDebug operator<<(QDebug debug, const DeleteNoteCommand *command);
Project *mProject;
Note mNote;
};
#endif // DELETENOTECOMMAND_H
```
|
Inman is a city in Spartanburg County, South Carolina, United States. The population was 3,665 at the 2020 census, and 2,321 at the 2010 census.
Greater Inman is close to the Spartanburg-Greenville-Anderson metroplex. Inman residents have access to nearby Lake Bowen that affords water recreational sports and fishing, and Inman is accessible by Interstate 26 and Interstate 85. The city contains a historic main street district, several houses of worship, and a school district.
History
Inman was established in 1882 at the crossroads of Howard Gap and Blackstock. William Gowan, a local landowner, founded the town by volunteering to build a railroad depot which convinced the railroad to pass through the city. Since there was already a town named Gowansville, some local historians have said town was named after the president of the railroad or a surveyor However, according to geographer Henry Gannett, the town was named after a local resident. The town emerged as a small settlement, with businesses such as a blacksmith, a bank, and even a barber shop springing up around the depot. During the 1930s Inman was considered the fresh peach capital of the world. The Bush House and Shiloh Methodist Church are listed on the National Register of Historic Places.
In 1935, a local man named Bryson Hammet found a large stone off South Carolina highway 292 with various markings and the year 1567 carved into it. Historians have debated the authenticity and meaning of the stone for decades with many attributing the stone to Spanish Explorer and gold seeker Captain Juan Pardo.
Geography
Inman is located at (35.047493, -82.090329). The city lies just north of Spartanburg, and a few miles south of the North Carolina-South Carolina border.
The city's historic district lies along South Carolina Highway 292 just north of its intersection with U.S. Route 176 (which passes along the southwestern edge of the city). SC 292 also connects Inman with Interstate 26 to the east. Inman Mills, an unincorporated community, lies immediately southwest of Inman.
According to the United States Census Bureau, the city has a total area of , all land.
Climate
Inman is located in the Upstate region of South Carolina. The weather is temperate year-round, due to its location in the Isothermal Belt, a phenomenon that results when warmer air on the western side of the Appalachian Mountains blows over the mountains, leaving a trough where significant temperature inversions of 20 degrees Fahrenheit or greater can occur.
Demographics
2020 census
As of the 2020 United States census, there were 2,990 people, 1,141 households, and 604 families residing in the city with the median household income of $51,210. The median property value was $106,000, and the homeownership rate was 62%. Most people commuted by driving alone, with an average commute time of 20.5 minutes, and households owned an average of two cars.
Education
Inman has a lending library, a branch of the Spartanburg County Public Library.
Notable people
Fieldin Culbreth, MLB umpire
Heath Hembree, MLB Pitcher
James Hylton, NASCAR driver
Deebo Samuel, NFL Wide Receiver
References
External links
City of Inman official website
Greater Inman Area Chamber of Commerce
Cities in South Carolina
Cities in Spartanburg County, South Carolina
|
Newtonian refers to the work of Isaac Newton, in particular:
Newtonian mechanics, i.e. classical mechanics
Newtonian telescope, a type of reflecting telescope
Newtonian cosmology
Newtonian dynamics
Newtonianism, the philosophical principle of applying Newton's methods in a variety of fields
Newtonian fluid, a fluid that flows like water—its shear stress is linearly proportional to the velocity gradient in the direction perpendicular to the plane of shear
Non-Newtonian fluids, in which the viscosity changes with the applied shear force
Supplementary material
List of things named after Isaac Newton
|
```go
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
// +build aix
// +build ppc
package unix
//sysnb Getrlimit(resource int, rlim *Rlimit) (err error) = getrlimit64
//sysnb Setrlimit(resource int, rlim *Rlimit) (err error) = setrlimit64
//sys Seek(fd int, offset int64, whence int) (off int64, err error) = lseek64
//sys mmap(addr uintptr, length uintptr, prot int, flags int, fd int, offset int64) (xaddr uintptr, err error)
func setTimespec(sec, nsec int64) Timespec {
return Timespec{Sec: int32(sec), Nsec: int32(nsec)}
}
func setTimeval(sec, usec int64) Timeval {
return Timeval{Sec: int32(sec), Usec: int32(usec)}
}
func (iov *Iovec) SetLen(length int) {
iov.Len = uint32(length)
}
func (msghdr *Msghdr) SetControllen(length int) {
msghdr.Controllen = uint32(length)
}
func (cmsg *Cmsghdr) SetLen(length int) {
cmsg.Len = uint32(length)
}
func Fstat(fd int, stat *Stat_t) error {
return fstat(fd, stat)
}
func Fstatat(dirfd int, path string, stat *Stat_t, flags int) error {
return fstatat(dirfd, path, stat, flags)
}
func Lstat(path string, stat *Stat_t) error {
return lstat(path, stat)
}
func Stat(path string, statptr *Stat_t) error {
return stat(path, statptr)
}
```
|
Olof Henrik Dagård (born 7 August 1969 in Halmstad) is a retired Swedish decathlete.
Achievements
Personal bests
100 metres - 10.58 (1989)
400 metres - 46.71 (1994)
1500 metres - 4:34.46 (1990)
110 metres hurdles - 13.97 (1994)
High jump - 2.07 (1989)
Pole vault - 5.10 (2000)
Long jump - 7.48 (1989)
Shot put - 15.45 (1993)
Discus throw - 45.64 (1994)
Javelin throw - 69.26 (1993)
Decathlon - 8403 (1994)
External links
1969 births
Living people
Swedish decathletes
Athletes (track and field) at the 2000 Summer Olympics
Olympic athletes for Sweden
Sportspeople from Halmstad
European Athletics Championships medalists
|
Diever is a village in the Dutch province of Drenthe. It is a part of the municipality of Westerveld, and lies about 18 km northwest of Hoogeveen.
Diever is located near the , a major north–south route for pleasure boats in the province of Drenthe. Diever is located next to the Drents-Friese Wold, one of the national parks in the Netherlands, and a attraction for tourists. In the centre of Diever there is the brink, the village square with old buildings surrounding it. The Dutch Reformed Saint Pancratius-church is a 15th-century building, and considered one of the most beautiful churches of Drenthe.
Diever was a separate municipality until 1998, when the new municipality of Westerveld was created.
Shakespeare
In July and August the local people of Diever perform in dramas written by William Shakespeare. Diever is also known as "Shakespeare-town". The plays are being performed in an open-air theatre. The local amateur theater group was formed in 1946 by a local medical doctor, Mr. Derp Broekema. Thus, in 2006 the 60th anniversary of this annual event was celebrated with the performance of Henry IV.
Gallery
References
Municipalities of the Netherlands disestablished in 1998
Populated places in Drenthe
Former municipalities of Drenthe
Westerveld
|
, styled as Takanori Oguiss, was a Japanese figurative painter who lived and worked most of his life in France. He is known by his cityscape paintings.
Life and career
Born in Inazawa, Takanori Ogisu was the son of a landowner in the Nagoya region. Ogisu went to Tokyo in 1920 to become a painter. He studied at the Kawabata painting school (川端 画 学校, Kawabata Gagakkō) under Fujishima Takeji, then went to the Tokyo School of Fine Arts (precursor of Tōkyō Geijutsu Daigaku), where he graduated in 1929. In the same year the painter Yuzo Saeki , who had come back from France, visited Ogisu together with Takeo Yamaguchi and encouraged them to study in France. Ogisu and Yamaguchi followed the advice and went to Paris. They were part of a group of Japanese painters who went to study in France, such as Foujita, Inokuma, and Sadami Yokote, in 1927.
Ogisu settled in the district of Montparnasse, and frequented the painters of La Ruche, being particularly impressed by the paintings of Maurice Utrillo. In the 1930s, he occupied a studio at the foot of the Butte Montmartre, on rue Ordener, not far from his friends Inokuma and Foujita.
After a return to Japan, on the orders of the Vichy government (when he was appointed as a painter of the Japanese armies during the Second World War, but served only a few weeks on the two and a half years he was there, spending the rest of the time painting in Inazawa), Ogisu established himself definitively in 1948 in France, painting in bright colors the old picturesque districts, the old shops, haberdashery, paper mills, wine and liquor stores, wood, coal, and flower markets. In 1951, he wrote and illustrated Nouvelles de Paris, published by Mainichi. He also traveled to Amsterdam, Ghent, Antwerp and Venice, composing colorful works with unusual framing.
Death and legacy
His last exhibition during his lifetime took place at the museum of Saint-Denis in 1986. He died the same year and is buried in the Montmartre cemetery. A museum is dedicated to him in the Japanese city of Inazawa where his Montmartre city studio has been reconstituted.
References
1901 births
1986 deaths
Japanese painters
|
The Rough Guide To Desert Blues is a world music compilation album originally released in 2010. Desert blues refers to the music of the Mandinka and related nomad groups of the Sahara, who perform a style of music considered the root of the American Blues genre. This was first popularized in the West by Ali Farka Touré and has more recently been carried by a new wave of artists such as Tinariwen.
Part of the World Music Network Rough Guides series, the album contains two discs: an overview of the genre on Disc One, and a "bonus" Disc Two highlighting Etran Finatawa. Disc One features nine Malian tracks, two Sahrawi, and one each from Mauritania and Niger. The compilation was produced by Phil Stanton, co-founder of the World Music Network.
Critical reception
The album met positive reviews upon release. Robert Christgau called the compilation an "accessible variant" of the Rough Guide to the Music of the Sahara. He went on to include it in his top albums of 2010. Chris Nickson of AllMusic named it a "thorough introduction" to desert blues but called the Amadou & Mariam track "the odd one out", claiming it doesn't represent the genre. David Maine of PopMatters said that while albums in the series could be hit-and miss, this one had "far more hits than misses." Calling Tinariwen "the greatest band in the world right now, bar none", Maine explained that he'd long wondered whether similar acts were "ripping off" Tinariwen, and that the album had emphatically proven that they are "not simply mimicking" the band's success.
Track listing
Disc One
Disc Two
All tracks on Disc Two are performed by Etran Finatawa.
References
External links
2010 compilation albums
World Music Network Rough Guide albums
Desert blues albums
|
```python
# your_sha256_hash___________
#
# Pyomo: Python Optimization Modeling Objects
# National Technology and Engineering Solutions of Sandia, LLC
# Under the terms of Contract DE-NA0003525 with National Technology and
# Engineering Solutions of Sandia, LLC, the U.S. Government retains certain
# rights in this software.
# your_sha256_hash___________
from pyomo.environ import *
model = AbstractModel()
model.A = Set()
model.Z = Set(dimen=2)
model.M = Param(model.A)
model.N = Param(model.Z)
instance = model.create_instance('table4.dat')
instance.pprint()
```
|
William Drysdale (4 November 1876 – 29 September 1916) was a Scottish first-class cricketer and British Army officer.
The son of William Drysdale senior, he was born at Kirkcaldy in November 1876. He was educated at Loretto School, where he played rugby union. After leaving Loretto, he decided on a career in the British Army and attended the Royal Military College, Sandhurst. He graduated as a second lieutenant into the Royal Scots in September 1896. Shortly after graduating he served in British India and British Burma, with promotion to lieutenant coming in August 1898. While in British India, he played first-class cricket for the Europeans cricket team on four occasions all against the Parsees cricket team in the Bombay Presidency between 1900 and 1902. He scored 92 runs in his four matches, with a high score of 55. He was awarded a medal for attempting to save the life of comrade from drowning in 1902. He was promoted to captain in November 1902. He married Mary Louisa Mackenzie, the daughter of Sir John Muir Mackenzie, in January 1904. Drysdale later attended the Staff College in 1908 and 1909, captaining their cricket team.
Drysdale served in the First World War, where he was wounded in action and earned the Distinguished Service Cross during the First Battle of Ypres for showing “an unsurpassed example of fearlessness and courage, refusing to quit his brigade when wounded”. In February 1915 he was promoted to major. He was given command of the 7th Battalion of the Leicestershire Regiment in October 1915. He was made a brevet lieutenant colonel in June 1916, while the following month he was again wounded in action during the Battle of Bazentin Ridge when storming the village of Bazentinle-Petit. After recovering from his wounds, he returned to his battalion September, but was killed on the 29th of the same month by a German sniper when looking over a trench near Gueudecourt. He is buried at the Caterpillar Valley Cemetery.
References
External links
1876 births
1916 deaths
Sportspeople from Kirkcaldy
People educated at Loretto School, Musselburgh
Graduates of the Royal Military College, Sandhurst
Royal Scots officers
Scottish cricketers
Europeans cricketers
British Army personnel of World War I
Companions of the Distinguished Service Order
Royal Leicestershire Regiment officers
British military personnel killed in World War I
Deaths by firearm in France
|
```xml
export * from './TypedEmitter'
export * from './SimpleEmitter'
```
|
```php
<?php
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
*/
namespace Google\Service\Bigquery;
class FeatureValue extends \Google\Model
{
protected $categoricalValueType = CategoricalValue::class;
protected $categoricalValueDataType = '';
/**
* @var string
*/
public $featureColumn;
public $numericalValue;
/**
* @param CategoricalValue
*/
public function setCategoricalValue(CategoricalValue $categoricalValue)
{
$this->categoricalValue = $categoricalValue;
}
/**
* @return CategoricalValue
*/
public function getCategoricalValue()
{
return $this->categoricalValue;
}
/**
* @param string
*/
public function setFeatureColumn($featureColumn)
{
$this->featureColumn = $featureColumn;
}
/**
* @return string
*/
public function getFeatureColumn()
{
return $this->featureColumn;
}
public function setNumericalValue($numericalValue)
{
$this->numericalValue = $numericalValue;
}
public function getNumericalValue()
{
return $this->numericalValue;
}
}
// Adding a class alias for backwards compatibility with the previous class name.
class_alias(FeatureValue::class, 'Google_Service_Bigquery_FeatureValue');
```
|
```xml
export const enum eThemeBasicComponents {
ApplicationLayout = 'Theme.ApplicationLayoutComponent',
AccountLayout = 'Theme.AccountLayoutComponent',
EmptyLayout = 'Theme.EmptyLayoutComponent',
Logo = 'Theme.LogoComponent',
Routes = 'Theme.RoutesComponent',
NavItems = 'Theme.NavItemsComponent',
CurrentUser = 'Theme.CurrentUserComponent',
Languages = 'Theme.LanguagesComponent',
}
```
|
```css
`currentColor` improves code reusability
Use `background-repeat` to repeat a background image horizontally or vertically
Use `box-sizing` to define an element's `width` and `height` properties
Default to a transparent `border-color` before adding a border to on `:hover` state elements
Matching images to a website's color scheme
```
|
```xml
export function notEmpty<T>(item: T | null | undefined): item is T {
return item !== undefined && item !== null;
}
```
|
Lieutenant-General Sir Lawrence Worthington Parsons (23 March 1850 – 20 August 1923) was a British Army officer who became General Officer Commanding 6th Division.
Military career
Parsons was brought up in Parsonstown in King's County, the only son of Lawrence Parsons. He was commissioned into the Royal Artillery as a lieutenant on 23 July 1870, then promoted to captain on 16 September 1880, to major on 1 July 1886, and to lieutenant-colonel on 1 October 1896. He served in the Second Boer War and took part in the Battle of Colenso, the Battle of Spion Kop and the Relief of Ladysmith, following which he was promoted to substantive colonel on 23 April 1900. After returning to the United Kingdom, he was in January 1901 appointed Colonel on the Staff Commanding Royal Artillery at Salisbury Plains. In early 1903, he was appointed Inspector General of Artillery in India. He was then appointed General Officer Commanding 8th Division in Ireland in 1906 and General Officer Commanding 6th Division also in Ireland in 1907 before retiring in 1909. He was recalled as General Officer Commanding 16th (Irish) Division in 1914 at the start of the First World War and retired again in 1916.
Family
In 1880, he married Florence Anna Graves, daughter of Dr. Robert Graves of Cloghan Castle, and had one daughter.
References
External links
|-
|-
1850 births
1923 deaths
Military personnel from County Offaly
British Army lieutenant generals
British Army generals of World War I
Royal Artillery officers
Knights Commander of the Order of the Bath
British Army personnel of the Second Boer War
People from Birr, County Offaly
|
```php
<?php
namespace MathPHP\Tests\Arithmetic;
use MathPHP\Arithmetic;
/**
* Tests of arithmetic axioms
* These tests don't test specific functions,
* but rather arithmetic axioms which in term make use of multiple functions.
* If all the arithmetic math is implemented properly, these tests should
* all work out according to the axioms.
*
* Axioms tested:
* - Digital root
* - dr(n) = n n {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
* - dr(n) < n n 10
* - dr(a+b) = dr(dr(a) + dr(b))
* - dr(ab) = dr(dr(a) dr(b))
* - dr(n) = 0 n = 9m for m = 1, 2, 3
* - Modulo
* - Identity: (a mod n) mod n = a mod n
* - Identity: n mod n = 0 for all positive integer values of x
* - Inverse: [(a mod n) + (a mod n)] mod n = 0
* - Distributive: (a + b) mod n = [(a mod n) + (b mod n)] mod n
* - Distributive: ab mod n = [(a mod n)(b mod n)] mod n
* - Distributive: c(x mod y) = (cx) mod (cy)
*/
class ArithmeticAxiomsTest extends \PHPUnit\Framework\TestCase
{
/**
* @test Axiom: dr(n) = n n {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
* The digital root of n is n itself if and only if the number has exactly one digit.
*/
public function testDigitalRootEqualsN()
{
// Given
for ($n = 0; $n < 10; $n++) {
// When
$digitalRoot = Arithmetic::digitalRoot($n);
// Then
$this->assertEquals($n, $digitalRoot);
}
}
/**
* @test Axiom: dr(n) < n n 10
* The digital root of n is less than n if and only if the number is greater than or equal to 10.
*/
public function testDigitalRootLessThanN()
{
// Given
for ($n = 10; $n <= 100; $n++) {
// When
$digitalRoot = Arithmetic::digitalRoot($n);
// Then
$this->assertLessThan($n, $digitalRoot);
}
}
/**
* @test Axiom: dr(a+b) = dr(dr(a) + dr(b))
* The digital root of a + b is digital root of the sum of the digital root of a and the digital root of b.
* @dataProvider dataProviderDigitalRootArithmetic
* @param int $a
* @param int $b
*/
public function testDigitalRootAddition(int $a, int $b)
{
// When
$drab = Arithmetic::digitalRoot($a + $b);
$drdradrb = Arithmetic::digitalRoot(Arithmetic::digitalRoot($a) + Arithmetic::digitalRoot($b));
// Then
$this->assertEquals($drab, $drdradrb);
}
/**
* @test Axiom: dr(ab) = dr(dr(a) dr(b))
* The digital root of a b is digital root of the product of the digital root of a and the digital root of b.
* @dataProvider dataProviderDigitalRootArithmetic
* @param int $a
* @param int $b
*/
public function testDigitalRootProduct(int $a, int $b)
{
// When
$drab = Arithmetic::digitalRoot($a * $b);
$drdradrb = Arithmetic::digitalRoot(Arithmetic::digitalRoot($a) * Arithmetic::digitalRoot($b));
// Then
$this->assertEquals($drab, $drdradrb);
}
/**
* @return array
*/
public function dataProviderDigitalRootArithmetic(): array
{
return [
[0, 0],
[1, 0],
[0, 1],
[1, 1],
[1, 2],
[2, 2],
[5, 4],
[16, 42],
[10, 10],
[8041, 2301],
[241, 325],
[48, 332],
[89, 404804],
[12345, 67890],
[405, 3],
[0, 34434],
[398792873, 2059872903],
];
}
/**
* @test Axiom: dr(n) = 0 n = 9m for m = 1, 2, 3
* The digital root of a nonzero number is 9 if and only if the number is itself a multiple of 9.
*/
public function testDigitalRootMultipleOfNine()
{
// Given
for ($n = 9; $n <= 900; $n += 9) {
// When
$digitalRoot = Arithmetic::digitalRoot($n);
// Then
$this->assertEquals(9, $digitalRoot);
}
}
/**
* @test Axiom Identity: (a mod n) mod n = a mod n
* path_to_url#Properties_(identities)
*/
public function testModuloIdentity()
{
// Given
foreach (\range(-20, 20) as $a) {
foreach (\range(-20, 20) as $n) {
// When
$amodnmodn = Arithmetic::modulo(Arithmetic::modulo($a, $n), $n);
$amodn = Arithmetic::modulo($a, $n);
// Then
$this->assertEquals($amodnmodn, $amodn);
}
}
}
/**
* @test Axiom Identity: n mod n = 0 for all positive integer values of x
* path_to_url#Properties_(identities)
*/
public function testModuloIdentityOfPowers()
{
foreach (\range(-20, 20) as $n) {
foreach (\range(1, 5) as $) {
// Given
$n = $n ** $;
// When
$nmodn = Arithmetic::modulo($n, $n);
// Then
$this->assertEquals(0, $nmodn);
}
}
}
/**
* @test Axiom Inverse: [(a mod n) + (a mod n)] mod n = 0
* path_to_url#Properties_(identities)
*/
public function testModuloInverse()
{
// Given
foreach (\range(-20, 20) as $a) {
foreach (\range(-20, 20) as $n) {
// When
$amodnamodnmodn = Arithmetic::modulo(
Arithmetic::modulo(-$a, $n) + Arithmetic::modulo($a, $n),
$n
);
// Then
$this->assertEquals(0, $amodnamodnmodn);
}
}
}
/**
* @test Axiom Distributive: (a + b) mod n = [(a mod n) + (b mod n)] mod n
* path_to_url#Properties_(identities)
*/
public function testModuloDistributiveAdditionProperty()
{
// Given
foreach (\range(-5, 5) as $a) {
foreach (\range(-5, 5) as $b) {
foreach (\range(-6, 6) as $n) {
// When
$abmodn = Arithmetic::modulo($a + $b, $n);
$amodnbmodnmodn = Arithmetic::modulo(
Arithmetic::modulo($a, $n) + Arithmetic::modulo($b, $n),
$n
);
// Then
$this->assertEquals($abmodn, $amodnbmodnmodn);
}
}
}
}
/**
* @test Axiom Distributive: ab mod n = [(a mod n)(b mod n)] mod n
* path_to_url#Properties_(identities)
*/
public function testModuloDistributiveMultiplicationProperty()
{
// Given
foreach (\range(-5, 5) as $a) {
foreach (\range(-5, 5) as $b) {
foreach (\range(-6, 6) as $n) {
// When
$abmodn = Arithmetic::modulo($a * $b, $n);
$amodnbmodnmodn = Arithmetic::modulo(
Arithmetic::modulo($a, $n) * Arithmetic::modulo($b, $n),
$n
);
// Then
$this->assertEquals($abmodn, $amodnbmodnmodn);
}
}
}
}
/**
* @test Axiom Distributive: c(x mod y) = (cx) mod (cy)
* Graham, Knuth, Patashnik (1994). Concrete Mathematics, A Foundation For Computer Science. Addison-Wesley.
*/
public function testModuloDistributiveLaw()
{
// Given
foreach (\range(-5, 5) as $x) {
foreach (\range(-5, 5) as $y) {
foreach (\range(-6, 6) as $c) {
// When
$cxmody = $c * Arithmetic::modulo($x, $y);
$cxmodcy = Arithmetic::modulo($c * $x, $c * $y);
// Then
$this->assertEquals($cxmody, $cxmodcy);
}
}
}
}
}
```
|
"So Excited" is a song by American rapper Fat Joe, released on August 2, 2017. The song was produced by his longtime producer Streetrunner and features Dre from Cool & Dre on the hook.
Composition
"So Excited" samples "Don't Look Any Further" by Dennis Edwards and Siedah Garrett, which was notably sampled on 2Pac's infamous diss record "Hit 'Em Up" and Junior M.A.F.I.A. and The Notorious B.I.G.'s "Gettin' Money (The Get Money Remix)."
Music video
The official music video was released August 11, 2017.
Charts
References
External links
2017 singles
2017 songs
Songs written by Fat Joe
Fat Joe songs
Empire Distribution singles
Songs written by Dre (record producer)
|
Clube Desportivo de Cerveira (abbreviated as CD Cerveira) is a Portuguese football club based in Vila Nova de Cerveira in the district of Viana do Castelo.
Background
CD Cerveira currently plays in the Terceira Divisão Série A which is the fourth tier of Portuguese football. The club was founded in 1972 and they play their home matches at the Estádio Municipal Rafael Pedreira in Vila Nova de Cerveira. The stadium is able to accommodate 2,500 spectators.
The club is affiliated to Associação de Futebol de Viana do Castelo and has competed in the AF Viana do Castelo Taça. The club has also entered the national cup competition known as Taça de Portugal on occasions.
Season to season
League and cup history
Honours
AF Viana do Castelo Divisão de Honra: 2001/02, 2010/11
AF Viana do Castelo 1ª Divisão: 1982/83
AF Viana do Castelo Taça: 2009/10
Footnotes
External links
Official website
Official blog
Cerveira
Cerveira
1972 establishments in Portugal
Vila Nova de Cerveira
|
Qaruh Island () is an island belonging to the state of Kuwait, which received its name from the large amounts of petroleum sediments in the area (known as Qar in Arabic). It is the smallest of the nine islands, and also the furthest island from the Kuwaiti mainland. It is located 37.5 kilometres east of the mainland coast, and 17 kilometres northeast of Umm al Maradim. The island is roughly 275 meters long by 175 meters at its widest (area about 3.5 ha. The island was also the first part of Kuwaiti soil that was liberated from Iraq during the Gulf War on January 21, 1991.
See also
List of lighthouses in Kuwait
References
External links
Pictures of the liberation of Qaruh Island
Picture of the Jazirat Qaruh Lighthouse
Uninhabited islands of Kuwait
Lighthouses in Kuwait
|
Nazodelavo Cave Natural Monument () is a karst cave 6.8 km to the north from village Akhuti in Chkhorotsqu Municipality in Samegrelo-Zemo Svaneti region of Georgia. Cave is located on the left bank of river Zana (Khobi river tributary), 290 meters above sea level. Nazodelavo means the dwelling of Zodelavos. According to cave narratives, it was used as a means of defense in the middle ages.
Morphology
Nazodelavo karst cave formed in a conglomerates of the Neogene geologic period in Odishi plain karst massif. Cave is 600 m long with main tunnel average width of 4 m and height 3 m. The two main outlets are narrower and shorter than the main cave tunnel. A cold underground river with clear water flows through an erosion canyon in cave floor. In some places depth of the erosion canyon reaches 7-8 meters.
Fauna
In the cave and in the surrounding area on the surface there are summer moths.
The inhabitants of the cave include Lepidocyrtus, Folsomia and Oxychilus.
See also
Prometheus Cave Natural Monument
References
Natural monuments of Georgia (country)
Caves of Georgia (country)
Protected areas established in 2013
Geography of Imereti
|
```html
<html><head><meta http-equiv="X-UA-Compatible" content="IE=edge" /><link rel="shortcut icon" href="../icons/favicon.ico" /><link rel="stylesheet" type="text/css" href="../styles/branding.css" /><link rel="stylesheet" type="text/css" href="../styles/branding-en-US.css" /><script type="text/javascript" src="../scripts/branding.js"> </script><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>IEvaluator Interface</title><meta name="Language" content="en-us" /><meta name="System.Keywords" content="IEvaluator interface" /><meta name="System.Keywords" content="CSScriptLib.IEvaluator interface" /><meta name="Microsoft.Help.F1" content="CSScriptLib.IEvaluator" /><meta name="Microsoft.Help.Id" content="T:CSScriptLib.IEvaluator" /><meta name="Description" content="A generic interface of the CS-Script evaluator. It encapsulates the generic functionality of the evaluator regardless of the nature of the underlying compiling services (e.g. Mono, Roslyn, CodeDom)." /><meta name="Microsoft.Help.ContentType" content="Reference" /><meta name="BrandingAware" content="true" /><meta name="container" content="CSScriptLib" /><meta name="file" content="3853215a-1dba-de06-cfdc-13a6edb2e37f" /><meta name="guid" content="3853215a-1dba-de06-cfdc-13a6edb2e37f" /><link type="text/css" rel="stylesheet" href="../styles/highlight.css" /><script type="text/javascript" src="../scripts/highlight.js"> </script><link rel="stylesheet" type="text/css" href="../styles/branding-Website.css" /><script type="text/javascript" src="../scripts/jquery-3.3.1.min.js"></script><script type="text/javascript" src="../scripts/branding-Website.js"></script><script type="text/javascript" src="../scripts/clipboard.min.js"></script></head><body onload="OnLoad('cs')"><input type="hidden" id="userDataCache" class="userDataStyle" /><div class="pageHeader" id="PageHeader">A Sandcastle Documented Class Library<form id="SearchForm" method="get" action="#" onsubmit="javascript:TransferToSearchPage(); return false;"><input id="SearchTextBox" type="text" maxlength="200" /><button id="SearchButton" type="submit"></button></form></div><div class="pageBody"><div class="leftNav" id="leftNav"><div id="tocNav"><div class="toclevel0" data-toclevel="0"><a class="tocCollapsed" onclick="javascript: Toggle(this);" href="#!" /><a data-tochassubtree="true" href="../html/e862697d-3cd2-4fa7-bdbd-3d17ef405b58.htm" title="A Sandcastle Documented Class Library" tocid="roottoc">A Sandcastle Documented Class Library</a></div><div class="toclevel0" data-toclevel="0"><a class="tocCollapsed" onclick="javascript: Toggle(this);" href="#!" /><a data-tochassubtree="true" href="../html/3bca438b-6a3b-acb6-218a-f07ec3aa462e.htm" title="CSScriptLib" tocid="3bca438b-6a3b-acb6-218a-f07ec3aa462e">CSScriptLib</a></div><div class="toclevel1 current" data-toclevel="1" data-childrenloaded="true"><a class="tocExpanded" onclick="javascript: Toggle(this);" href="#!" /><a data-tochassubtree="true" href="../html/3853215a-1dba-de06-cfdc-13a6edb2e37f.htm" title="IEvaluator Interface" tocid="3853215a-1dba-de06-cfdc-13a6edb2e37f">IEvaluator Interface</a></div><div class="toclevel2" data-toclevel="2"><a class="tocCollapsed" onclick="javascript: Toggle(this);" href="#!" /><a data-tochassubtree="true" href="../html/1a8bb1a0-2325-9361-98e4-520e5020fe71.htm" title="IEvaluator Properties" tocid="1a8bb1a0-2325-9361-98e4-520e5020fe71">IEvaluator Properties</a></div><div class="toclevel2" data-toclevel="2"><a class="tocCollapsed" onclick="javascript: Toggle(this);" href="#!" /><a data-tochassubtree="true" href="../html/7686eb04-f896-6c92-a375-eec64782cfbc.htm" title="IEvaluator Methods" tocid="7686eb04-f896-6c92-a375-eec64782cfbc">IEvaluator Methods</a></div></div><div id="tocResizableEW" onmousedown="OnMouseDown(event);"></div><div id="TocResize" class="tocResize"><img id="ResizeImageIncrease" src="../icons/TocOpen.gif" onclick="OnIncreaseToc()" alt="Click or drag to resize" title="Click or drag to resize" /><img id="ResizeImageReset" src="../icons/TocClose.gif" style="display:none" onclick="OnResetToc()" alt="Click or drag to resize" title="Click or drag to resize" /></div></div><div class="topicContent" id="TopicContent"><table class="titleTable"><tr><td class="logoColumn"><img src="../icons/Help.png" /></td><td class="titleColumn"><h1>IEvaluator Interface</h1></td></tr></table><span class="introStyle"></span> <div class="summary">
A generic interface of the CS-Script evaluator. It encapsulates the generic functionality of the evaluator regardless
of the nature of the underlying compiling services (e.g. Mono, Roslyn, CodeDom).
</div><p> </p>
<strong>Namespace:</strong>
<a href="3bca438b-6a3b-acb6-218a-f07ec3aa462e.htm">CSScriptLib</a><br />
<strong>Assembly:</strong>
CSScriptLib (in CSScriptLib.dll) Version: 1.3.2.0<div class="collapsibleAreaRegion"><span class="collapsibleRegionTitle" onclick="SectionExpandCollapse('ID1RB')" onkeypress="SectionExpandCollapse_CheckKey('ID1RB', event)" tabindex="0"><img id="ID1RBToggle" class="collapseToggle" src="../icons/SectionExpanded.png" />Syntax</span></div><div id="ID1RBSection" class="collapsibleSection"><div class="codeSnippetContainer"><div class="codeSnippetContainerTabs"><div id="ID0EACA_tab1" class="codeSnippetContainerTabSingle">C#</div></div><div class="codeSnippetContainerCodeContainer"><div class="codeSnippetToolBar"><div class="codeSnippetToolBarText"><a id="ID0EACA_copyCode" href="#" class="copyCodeSnippet" onclick="javascript:CopyToClipboard('ID0EACA');return false;" title="Copy">Copy</a></div></div><div id="ID0EACA_code_Div1" class="codeSnippetContainerCode" style="display: block"><pre xml:space="preserve"><span class="keyword">public</span> <span class="keyword">interface</span> <span class="identifier">IEvaluator</span></pre></div></div></div><script type="text/javascript">AddLanguageTabSet("ID0EACA");</script></div><p>The <span class="selflink">IEvaluator</span> type exposes the following members.</p><div class="collapsibleAreaRegion"><span class="collapsibleRegionTitle" onclick="SectionExpandCollapse('ID2RB')" onkeypress="SectionExpandCollapse_CheckKey('ID2RB', event)" tabindex="0"><img id="ID2RBToggle" class="collapseToggle" src="../icons/SectionExpanded.png" />Properties</span></div><div id="ID2RBSection" class="collapsibleSection"><table class="members" id="propertyList"><tr><th class="iconColumn">
</th><th>Name</th><th>Description</th></tr><tr data="public;declared;notNetfw;"><td><img src="../icons/pubproperty.gif" alt="Public property" title="Public property" /></td><td><a href="ceb4eab2-3fb7-b506-eb71-c942971c8641.htm">DebugBuild</a></td><td><div class="summary">
Gets or sets a value indicating whether to compile script with debug symbols.
<p>Note, setting <span class="code">DebugBuild</span> will only affect the current instance of Evaluator.
If you want to emit debug symbols for all instances of Evaluator then use
<a href="33e2b04a-87b0-98e5-bfc2-f85c47029951.htm">EvaluatorConfig</a>.DebugBuild.
</p></div></td></tr><tr data="public;declared;notNetfw;"><td><img src="../icons/pubproperty.gif" alt="Public property" title="Public property" /></td><td><a href="62ee5b67-b522-438d-0a01-da897fc2ba5b.htm">DisableReferencingFromCode</a></td><td><div class="summary">
Gets or sets the flag indicating if the script code should be analyzed and the assemblies
that the script depend on (via '//css_...' and 'using ...' directives) should be referenced.
</div></td></tr></table><a href="#PageHeader">Top</a></div><div class="collapsibleAreaRegion"><span class="collapsibleRegionTitle" onclick="SectionExpandCollapse('ID3RB')" onkeypress="SectionExpandCollapse_CheckKey('ID3RB', event)" tabindex="0"><img id="ID3RBToggle" class="collapseToggle" src="../icons/SectionExpanded.png" />Methods</span></div><div id="ID3RBSection" class="collapsibleSection"><table class="members" id="methodList"><tr><th class="iconColumn">
</th><th>Name</th><th>Description</th></tr><tr data="public;declared;notNetfw;"><td><img src="../icons/pubmethod.gif" alt="Public method" title="Public method" /><img src="../icons/CodeExample.png" alt="Code example" title="Code example" /></td><td><a href="8633c34f-f1e2-e370-5d13-d2725126503e.htm">Check</a></td><td><div class="summary">
Compiles the specified script text without loading it into the AppDomain or
writing to the file system.
</div></td></tr><tr data="public;declared;notNetfw;"><td><img src="../icons/pubmethod.gif" alt="Public method" title="Public method" /><img src="../icons/CodeExample.png" alt="Code example" title="Code example" /></td><td><a href="f3a34d8f-79b9-4863-5089-b74fb32b266b.htm">Clone</a></td><td><div class="summary">
Clones the parent <span class="selflink">IEvaluator</span>.
<p>
This method returns a freshly initialized copy of the <span class="selflink">IEvaluator</span>.
The cloning 'depth' can be controlled by the <span class="parameter">copyRefAssemblies</span>.
</p><p>
This method is a convenient technique when multiple <span class="selflink">IEvaluator</span> instances
are required (e.g. for concurrent script evaluation).
</p></div></td></tr><tr data="public;declared;notNetfw;"><td><img src="../icons/pubmethod.gif" alt="Public method" title="Public method" /><img src="../icons/CodeExample.png" alt="Code example" title="Code example" /></td><td><a href="9444c04e-cf37-e231-e78d-547795d56d5f.htm">CompileAssemblyFromCode</a></td><td><div class="summary">
Compiles C# code (script) into assembly file. The C# code is a typical C# code containing a single or multiple class definition(s).
</div></td></tr><tr data="public;declared;notNetfw;"><td><img src="../icons/pubmethod.gif" alt="Public method" title="Public method" /><img src="../icons/CodeExample.png" alt="Code example" title="Code example" /></td><td><a href="2c385d49-7614-07ea-1214-0b8034380290.htm">CompileAssemblyFromFile</a></td><td><div class="summary">
Compiles C# file (script) into assembly file. The C# contains typical C# code containing a single or multiple class definition(s).
</div></td></tr><tr data="public;declared;notNetfw;"><td><img src="../icons/pubmethod.gif" alt="Public method" title="Public method" /><img src="../icons/CodeExample.png" alt="Code example" title="Code example" /></td><td><a href="13d95584-7d3c-62fe-b3d7-1cbe59658f8f.htm">CompileCode</a></td><td><div class="summary">
Evaluates (compiles) C# code (script). The C# code is a typical C# code containing a single or multiple class definition(s).
</div></td></tr><tr data="public;declared;notNetfw;"><td><img src="../icons/pubmethod.gif" alt="Public method" title="Public method" /><img src="../icons/CodeExample.png" alt="Code example" title="Code example" /></td><td><a href="e1cb974a-6909-64d1-397e-41e1b6119ab1.htm">CompileMethod</a></td><td><div class="summary">
Wraps C# code fragment into auto-generated class (type name <span class="code">DynamicClass</span>) and evaluates it.
<p>
This method is a logical equivalent of <a href="13d95584-7d3c-62fe-b3d7-1cbe59658f8f.htm">CompileCode(String, CompileInfo)</a> but is allows you to define
your script class by specifying class method instead of whole class declaration.</p></div></td></tr><tr data="public;declared;notNetfw;"><td><img src="../icons/pubmethod.gif" alt="Public method" title="Public method" /><img src="../icons/CodeExample.png" alt="Code example" title="Code example" /></td><td><a href="e8feecdf-589c-0cb4-0776-e3653335f139.htm">CreateDelegate(String)</a></td><td><div class="summary">
Wraps C# code fragment into auto-generated class (type name <span class="code">DynamicClass</span>), evaluates it and loads the class to the current AppDomain.
<p>Returns non-typed <a href="d102f883-37bb-3977-9012-0f21657bdf28.htm">MethodDelegate</a> for class-less style of invoking.</p></div></td></tr><tr data="public;declared;notNetfw;"><td><img src="../icons/pubmethod.gif" alt="Public method" title="Public method" /><img src="../icons/CodeExample.png" alt="Code example" title="Code example" /></td><td><a href="8635a3b6-4dda-78b6-3c00-b680f5bd52bf.htm">CreateDelegate<span id="LST99EE3A40_0"></span><script type="text/javascript">AddLanguageSpecificTextSet("LST99EE3A40_0?cs=<|vb=(Of |cpp=<|fs=<'|nu=(");</script>T<span id="LST99EE3A40_1"></span><script type="text/javascript">AddLanguageSpecificTextSet("LST99EE3A40_1?cs=>|vb=)|cpp=>|fs=>|nu=)");</script>(String)</a></td><td><div class="summary">
Wraps C# code fragment into auto-generated class (type name <span class="code">DynamicClass</span>), evaluates it and loads the class to the current AppDomain.
<p>Returns typed <a href="4e831977-d07c-c462-2ce8-4f5edac5c93c.htm">MethodDelegate<span id="LST99EE3A40_2"></span><script type="text/javascript">AddLanguageSpecificTextSet("LST99EE3A40_2?cs=<|vb=(Of |cpp=<|nu=(|fs=<'");</script>T<span id="LST99EE3A40_3"></span><script type="text/javascript">AddLanguageSpecificTextSet("LST99EE3A40_3?cs=>|vb=)|cpp=>|nu=)|fs=>");</script></a> for class-less style of invoking.</p></div></td></tr><tr data="public;declared;notNetfw;"><td><img src="../icons/pubmethod.gif" alt="Public method" title="Public method" /></td><td><a href="ad5d369f-a449-90d9-6159-a9d431c80dfb.htm">GetReferencedAssemblies<span id="LST99EE3A40_4"></span><script type="text/javascript">AddLanguageSpecificTextSet("LST99EE3A40_4?cs=()|vb=|cpp=()|nu=()|fs=()");</script></a></td><td><div class="summary">
Returns set of referenced assemblies.
<p>
Notre: the set of assemblies is cleared on Reset.
</p></div></td></tr><tr data="public;declared;notNetfw;"><td><img src="../icons/pubmethod.gif" alt="Public method" title="Public method" /></td><td><a href="8eed2f6c-0e19-3dc2-8b02-202e02c303c7.htm">GetReferencedAssemblies(String, <span id="LST99EE3A40_5"></span><script type="text/javascript">AddLanguageSpecificTextSet("LST99EE3A40_5?cpp=array<");</script>String<span id="LST99EE3A40_6"></span><script type="text/javascript">AddLanguageSpecificTextSet("LST99EE3A40_6?cpp=>|cs=[]|vb=()|nu=[]|fs=[]");</script>)</a></td><td><div class="summary">
Analyses the script code and returns set of locations for the assemblies referenced from the code with CS-Script directives (//css_ref).
</div></td></tr><tr data="public;declared;notNetfw;"><td><img src="../icons/pubmethod.gif" alt="Public method" title="Public method" /><img src="../icons/CodeExample.png" alt="Code example" title="Code example" /></td><td><a href="ea230527-cb73-5f65-3758-3cefe73be216.htm">LoadCode(String, <span id="LST99EE3A40_7"></span><script type="text/javascript">AddLanguageSpecificTextSet("LST99EE3A40_7?cpp=array<");</script>Object<span id="LST99EE3A40_8"></span><script type="text/javascript">AddLanguageSpecificTextSet("LST99EE3A40_8?cpp=>|cs=[]|vb=()|nu=[]|fs=[]");</script>)</a></td><td><div class="summary">
Evaluates and loads C# code to the current AppDomain. Returns instance of the first class defined in the code.
</div></td></tr><tr data="public;declared;notNetfw;"><td><img src="../icons/pubmethod.gif" alt="Public method" title="Public method" /><img src="../icons/CodeExample.png" alt="Code example" title="Code example" /></td><td><a href="10aa6cee-85d8-20ee-3805-04eb499e18c2.htm">LoadCode<span id="LST99EE3A40_9"></span><script type="text/javascript">AddLanguageSpecificTextSet("LST99EE3A40_9?cs=<|vb=(Of |cpp=<|fs=<'|nu=(");</script>T<span id="LST99EE3A40_10"></span><script type="text/javascript">AddLanguageSpecificTextSet("LST99EE3A40_10?cs=>|vb=)|cpp=>|fs=>|nu=)");</script>(String, <span id="LST99EE3A40_11"></span><script type="text/javascript">AddLanguageSpecificTextSet("LST99EE3A40_11?cpp=array<");</script>Object<span id="LST99EE3A40_12"></span><script type="text/javascript">AddLanguageSpecificTextSet("LST99EE3A40_12?cpp=>|cs=[]|vb=()|nu=[]|fs=[]");</script>)</a></td><td><div class="summary">
Evaluates and loads C# code to the current AppDomain. Returns instance of the first class defined in the code.
</div></td></tr><tr data="public;declared;notNetfw;"><td><img src="../icons/pubmethod.gif" alt="Public method" title="Public method" /><img src="../icons/CodeExample.png" alt="Code example" title="Code example" /></td><td><a href="24a8edf3-c189-eafc-310b-19f1f58a7fec.htm">LoadDelegate<span id="LST99EE3A40_13"></span><script type="text/javascript">AddLanguageSpecificTextSet("LST99EE3A40_13?cs=<|vb=(Of |cpp=<|fs=<'|nu=(");</script>T<span id="LST99EE3A40_14"></span><script type="text/javascript">AddLanguageSpecificTextSet("LST99EE3A40_14?cs=>|vb=)|cpp=>|fs=>|nu=)");</script></a></td><td><div class="summary">
Wraps C# code fragment into auto-generated class (type name <span class="code">DynamicClass</span>), evaluates it and loads
the class to the current AppDomain.
<p>Returns instance of <span class="code">T</span> delegate for the first method in the auto-generated class.</p></div></td></tr><tr data="public;declared;notNetfw;"><td><img src="../icons/pubmethod.gif" alt="Public method" title="Public method" /><img src="../icons/CodeExample.png" alt="Code example" title="Code example" /></td><td><a href="8bdb6840-f8b9-a23c-a912-072e2d7bfe9f.htm">LoadFile(String, <span id="LST99EE3A40_15"></span><script type="text/javascript">AddLanguageSpecificTextSet("LST99EE3A40_15?cpp=array<");</script>Object<span id="LST99EE3A40_16"></span><script type="text/javascript">AddLanguageSpecificTextSet("LST99EE3A40_16?cpp=>|cs=[]|vb=()|nu=[]|fs=[]");</script>)</a></td><td><div class="summary">
Evaluates and loads C# code from the specified file to the current AppDomain. Returns instance of the first
class defined in the script file.
</div></td></tr><tr data="public;declared;notNetfw;"><td><img src="../icons/pubmethod.gif" alt="Public method" title="Public method" /><img src="../icons/CodeExample.png" alt="Code example" title="Code example" /></td><td><a href="0bab5c7c-d6d7-0b88-744b-10af4c0270dc.htm">LoadFile<span id="LST99EE3A40_17"></span><script type="text/javascript">AddLanguageSpecificTextSet("LST99EE3A40_17?cs=<|vb=(Of |cpp=<|fs=<'|nu=(");</script>T<span id="LST99EE3A40_18"></span><script type="text/javascript">AddLanguageSpecificTextSet("LST99EE3A40_18?cs=>|vb=)|cpp=>|fs=>|nu=)");</script>(String, <span id="LST99EE3A40_19"></span><script type="text/javascript">AddLanguageSpecificTextSet("LST99EE3A40_19?cpp=array<");</script>Object<span id="LST99EE3A40_20"></span><script type="text/javascript">AddLanguageSpecificTextSet("LST99EE3A40_20?cpp=>|cs=[]|vb=()|nu=[]|fs=[]");</script>)</a></td><td><div class="summary">
Evaluates and loads C# code from the specified file to the current AppDomain. Returns instance of the first
class defined in the script file.
After initializing the class instance it is aligned to the interface specified by the parameter <span class="code">T</span>.
<p><span class="code">Note:</span> the script class does not have to inherit from the <span class="code">T</span> parameter as the proxy type
will be generated anyway.</p></div></td></tr><tr data="public;declared;notNetfw;"><td><img src="../icons/pubmethod.gif" alt="Public method" title="Public method" /><img src="../icons/CodeExample.png" alt="Code example" title="Code example" /></td><td><a href="e35b2c14-feb8-2a05-b4ac-5421fd0d57f0.htm">LoadMethod(String)</a></td><td><div class="summary">
Wraps C# code fragment into auto-generated class (type name <span class="code">DynamicClass</span>), evaluates it and loads
the class to the current AppDomain.
</div></td></tr><tr data="public;declared;notNetfw;"><td><img src="../icons/pubmethod.gif" alt="Public method" title="Public method" /><img src="../icons/CodeExample.png" alt="Code example" title="Code example" /></td><td><a href="f4567bee-c0ab-2e65-9e85-bcf87289a445.htm">LoadMethod<span id="LST99EE3A40_21"></span><script type="text/javascript">AddLanguageSpecificTextSet("LST99EE3A40_21?cs=<|vb=(Of |cpp=<|fs=<'|nu=(");</script>T<span id="LST99EE3A40_22"></span><script type="text/javascript">AddLanguageSpecificTextSet("LST99EE3A40_22?cs=>|vb=)|cpp=>|fs=>|nu=)");</script>(String)</a></td><td><div class="summary">
Wraps C# code fragment into auto-generated class (type name <span class="code">DynamicClass</span>), evaluates it and loads
the class to the current AppDomain.
<p>
After initializing the class instance it is aligned to the interface specified by the parameter <span class="code">T</span>.
</p></div></td></tr><tr data="public;declared;notNetfw;"><td><img src="../icons/pubmethod.gif" alt="Public method" title="Public method" /></td><td><a href="119d5cb0-66b7-5527-367a-62c64ac98e2c.htm">ReferenceAssembliesFromCode</a></td><td><div class="summary">
References the assemblies from the script code.
<p>The method analyses and tries to resolve CS-Script directives (e.g. '//css_ref') and 'used' namespaces based on the
optional search directories.</p></div></td></tr><tr data="public;declared;notNetfw;"><td><img src="../icons/pubmethod.gif" alt="Public method" title="Public method" /></td><td><a href="1fc041db-891d-ea4d-44e2-1a08c768b365.htm">ReferenceAssembly(Assembly)</a></td><td><div class="summary">
References the given assembly.
<p>It is safe to call this method multiple times
for the same assembly. If the assembly already referenced it will not
be referenced again.
</p></div></td></tr><tr data="public;declared;notNetfw;"><td><img src="../icons/pubmethod.gif" alt="Public method" title="Public method" /></td><td><a href="99418b18-b71b-9033-7c08-6ff39aac88d2.htm">ReferenceAssembly(String)</a></td><td><div class="summary">
References the given assembly by the assembly path.
<p>It is safe to call this method multiple times for the same assembly. If the assembly already referenced it will not
be referenced again.</p></div></td></tr><tr data="public;declared;notNetfw;"><td><img src="../icons/pubmethod.gif" alt="Public method" title="Public method" /></td><td><a href="b566748c-9cd1-3f37-abd8-a944fbdc201f.htm">ReferenceAssemblyByName</a></td><td><div class="summary">
References the name of the assembly by its partial name.
<p>Note that the referenced assembly will be loaded into the host AppDomain in order to resolve assembly partial name.</p><p>It is an equivalent of <span class="code">Evaluator.ReferenceAssembly(Assembly.LoadWithPartialName(assemblyPartialName))</span></p></div></td></tr><tr data="public;declared;notNetfw;"><td><img src="../icons/pubmethod.gif" alt="Public method" title="Public method" /></td><td><a href="00a902da-a4b5-9520-794a-271520c93b86.htm">ReferenceAssemblyByNamespace</a></td><td><div class="summary">
References the assembly by the given namespace it implements.
<p>Adds assembly reference if the namespace was successfully resolved (found) and, otherwise does nothing</p></div></td></tr><tr data="public;declared;notNetfw;"><td><img src="../icons/pubmethod.gif" alt="Public method" title="Public method" /></td><td><a href="c9938dbd-8050-ae76-586d-4b3c2b5051d4.htm">ReferenceAssemblyOf(Object)</a></td><td><div class="summary">
References the assembly by the object, which belongs to this assembly.
<p>It is safe to call this method multiple times
for the same assembly. If the assembly already referenced it will not
be referenced again.
</p></div></td></tr><tr data="public;declared;notNetfw;"><td><img src="../icons/pubmethod.gif" alt="Public method" title="Public method" /></td><td><a href="8d901c29-e4ed-e9c9-0ce6-45a26cb5de74.htm">ReferenceAssemblyOf<span id="LST99EE3A40_23"></span><script type="text/javascript">AddLanguageSpecificTextSet("LST99EE3A40_23?cs=<|vb=(Of |cpp=<|fs=<'|nu=(");</script>T<span id="LST99EE3A40_24"></span><script type="text/javascript">AddLanguageSpecificTextSet("LST99EE3A40_24?cs=>|vb=)|cpp=>|fs=>|nu=)");</script><span id="LST99EE3A40_25"></span><script type="text/javascript">AddLanguageSpecificTextSet("LST99EE3A40_25?cs=()|vb=|cpp=()|nu=()|fs=()");</script></a></td><td><div class="summary">
References the assembly by the object, which belongs to this assembly.
<p>It is safe to call this method multiple times
for the same assembly. If the assembly already referenced it will not
be referenced again.
</p></div></td></tr><tr data="public;declared;notNetfw;"><td><img src="../icons/pubmethod.gif" alt="Public method" title="Public method" /></td><td><a href="5e2dbdc6-548f-068d-e74a-9924b58479d2.htm">ReferenceDomainAssemblies</a></td><td><div class="summary">
References the assemblies the are already loaded into the current <span class="code">AppDomain</span>.
</div></td></tr><tr data="public;declared;notNetfw;"><td><img src="../icons/pubmethod.gif" alt="Public method" title="Public method" /></td><td><a href="448f9e5b-2ab7-7889-2023-b49017452017.htm">Reset</a></td><td><div class="summary">
Resets Evaluator.
<p>
Resetting means clearing all referenced assemblies, recreating evaluation infrastructure (e.g. compiler setting)
and reconnection to or recreation of the underlying compiling services.
</p><p>Optionally the default current AppDomain assemblies can be referenced automatically with
<span class="parameter">referenceDomainAssemblies</span>.</p></div></td></tr><tr data="public;declared;notNetfw;"><td><img src="../icons/pubmethod.gif" alt="Public method" title="Public method" /></td><td><a href="3be9ef02-eb46-3210-6986-e2aaa7567039.htm">TryReferenceAssemblyByNamespace</a></td><td><div class="summary">
References the assembly by the given namespace it implements.
</div></td></tr></table><a href="#PageHeader">Top</a></div><div class="collapsibleAreaRegion" id="seeAlsoSection"><span class="collapsibleRegionTitle" onclick="SectionExpandCollapse('ID4RB')" onkeypress="SectionExpandCollapse_CheckKey('ID4RB', event)" tabindex="0"><img id="ID4RBToggle" class="collapseToggle" src="../icons/SectionExpanded.png" />See Also</span></div><div id="ID4RBSection" class="collapsibleSection"><h4 class="subHeading">Reference</h4><div class="seeAlsoStyle"><a href="3bca438b-6a3b-acb6-218a-f07ec3aa462e.htm">CSScriptLib Namespace</a></div></div></div></div><div id="pageFooter" class="pageFooter"> </div></body></html>
```
|
The 25th New York Infantry Regiment, the "Union Rangers", was an infantry
regiment that served in the Union Army during the American Civil War.
Service
The regiment was organized in New York City, New York, on May 10, 1861, and was mustered in for a two-year enlistment on June 28, 1861.
The regiment was mustered out of service on June 26, 1863, and those men who had signed three year enlistments were transferred to the 44th New York.
Total strength and casualties
The regiment suffered 7 officers and 54 enlisted men who were killed in action or mortally wounded and 4 officers and 25 enlisted men who died of disease, for a total of 90 fatalities.
Commanders
Colonel James E. Kerrigan
Colonel Charles Adams Johnson
See also
List of New York Civil War regiments
Notes
References
The Civil War Archive
External links
New York State Military Museum and Veterans Research Center - Civil War - 25th Infantry Regiment History, photographs, table of battles and casualties, and historical sketch for the 25th New York Infantry Regiment.
Infantry 025
1861 establishments in New York (state)
Military units and formations established in 1861
Military units and formations disestablished in 1863
1863 disestablishments in New York (state)
|
"La Loto" () is a song by Argentine singer Tini, American singer Becky G and Brazilian singer Anitta. It was released on July 6, 2022 by Sony Music Latin and Hollywood Records as the seventh single from Tini's fourth studio album, Cupido (2023). The song was written by the three singers alongside Elena Rose, while Andrés Torres and Mauricio Rengifo handled musical composition and production.
Tini collaborated with both artists for the first time, while Gomez and Anitta previously sang on a remix version of Maluma's "Mala Mía"; Gomez had also featured in a duet with Anitta, on the song "Banana".
"La Loto" is a primary bass-heavy reggaetón party track, with some urbano and modern hip hop influence. The lyrical content focuses on the usual pop themes of self-confidence and heavy partying; overall, the song features a theme of female solidarity and camaraderie. “La Loto” peaked at #6 on Billboard Argentina Hot 100, while also reaching #16 on Billboard's US Latin Digital Song Sales and #8 on US Latin Pop Airplay.
Background and release
Tini, Becky G and Anitta were part of WhatsApp's “Escuchanos, Miranos” campaign in celebration of Women's History Month. Soon after, rumors started to surface that the three were working on a song together, and in an interview with Billboard, Anitta confirmed and revealed that a “super cool” collaboration with Tini and Gomez was in the works.
In an interview, Tini said about the collaboration: “The truth is that both of them have been great references throughout my musical growth, as women in the industry and as artists, I have to say that I have always dreamt of doing something with one of them. And now having them, together in a song of mine, recording this powerful video – I feel that the truth is, it is a dream come true and I am happy to share this with them.” Gomez also spoke about the collaboration in an Instagram video, saying: “How empowering it is to see three women hustlers coming together for a bop. Anitta swung by and so did Tini, and we were all hanging out and we were talking about girl power. We got to do something together!” [...] We're a force to reckon with now in the music industry. The way I walk into a room, when I see my female counterparts, it's different. Instead of trying to make headlines about who is fighting about what, it's about our record-breaking numbers.”
On June 27, Tini announced via her social media, that a song was coming with the Brazilian and American singers. On July 4, Tini announced the release date of the song with a fragment of the video. On July 6, the song was released, along with its music video on Tini's YouTube channel.
Composition
"La Loto" was written by Tini, Becky G, Anitta, and Elena Rose; Andrés Torres and Mauricio "El Dandee" Rengifo composed and produced the song. The song is written in the key of D♭ major, with a moderately fast tempo of 90 beats per minute. It is a reggaeton song that lasts for a duration of three minutes and ten seconds. The song also has a Latin rhythm, and is described by Tini as exploring more urban nuances rarely heard in her music.
Lyrically, the song revolves around sex, or "sinning" as the girls call it in the chorus, with themes of female empowerment. Tini opens the song by singing about being in a party, saying: "Today we're sweating off all the makeup [...] This now looks like our runway". Anitta takes the second verse: "I fly directly from Miami to Rio [...] I brought Tini, we're gonna make a tremendous mess" before stating "Diamonds shining from head to toe/ The one that's with me won the lotto". Finally, Gomez sings the third verse: "We got all the drip, drip, all of Gucci-cci", and referencing the couple Lele Pons and Guaynaa, followed by "Short dress with nothing under/ This is what I work for". In the chorus, the girls state that they don't care about other people's opinions, and that "Tonight it seems we're sinning/ Tomorrow we go confess". The line "The baby with me won the lotto" expresses female empowerment, with the girls alluding to being the biggest and best prize their partners could have.
Music video
The music video for "La Loto" was shot in Los Angeles. It was co-directed by Argentine director Diego Peskins and Venezuelan Daniel Duran, both having worked with the singers on their previous songs. Rather than the typically-modern nightclub scenes of many music videos, “La Loto” takes place in a 1920s-style “speakeasy” setting, with rather dark, subdued lighting, along with jewels, diamonds and gold elements. The three singers are all wearing diamond-studded, shiny and revealing outfits, while the background dancers are simply in all-black clothing. Overall, the video’s style and feeling can best be described as sexy, with some Burlesque elements, as well as early-Hollywood, somewhat “vintage” looks influenced by 1920s, 1930s, and 1940s actresses. The visual appeal is offset with the pulsating rhythms of Urbano Latino music.
In an interview with Rolling Stone, Tini herself described the video as a “burlesque”-style visual and added that “…This video has an aesthetic that is quite vintage, like a burlesque, like Moulin Rouge, as in the old times. The song makes you feel powerful and I think that's what each of us wants to convey on the set.”
Meanwhile, Gomez commented “This video is so fire… The concept, the visuals, the outfits, the hair, the looks, the makeup; it's serving, for sure.”
Synopsis
The video opens with Tini seated at a vanity in a dressing room, finishing applying her makeup. The camera begins by briefly filming her reflection, while she says to herself, “Un poquitito; un poquitito te podés emborrachar. Dos copas de vino…” (lit. “You can get a little bit drunk, a little bit; Two glasses of wine…”). At this point, Tini puts her makeup brush down; the camera pans to the right as she begins singing directly to the camera. She is wearing a gold sequined dress with her hair in a long ponytail. She then stands up, and in the room with her are Becky G and Anitta, both dressed similarly and getting ready.
Next, Tini is entering a crowded bar, in a jewel-studded black catsuit and stilettos, wearing gold sunglasses and a large, pink faux-fur coat. Her dancers approach her and take her coat, while she confidently and sexily walks around the bar, greeting the patrons and other dancers. She then is on a darkened stage, and the group of male and female dancers join Tini in executing the tight choreography. Parts of the dance routine feature the use of chairs and seated moves.
On the second verse, we see Anitta ordering a drink at the bar, at which point she faces the camera and begins dancing on and around the bar. She is wearing stilettos with a typically burlesque-style outfit (brassiere, garters, etc). Then, Becky G is seen sitting on a sofa, in an all-black ensemble, surrounded by opulent pearls and vintage jewelry, with the male dancers wearing masquerade ball masks. The three Latina singers are finally shown seated together, in their original looks, copying each other as they cross and un-cross their legs on the couch. They’re showing they’re sexy with 'badass' personas, at times singing quite close to one another (to the point of near-intimacy). The trio is finally shown dancing on a stage, giving us a taste of what winning their “lottery” must feel like.
Accolades
Personnel
Credits adapted from Tidal.
Tini – lead vocals, songwriter
Becky G – vocals, songwriter
Anitta – vocals, songwriter
Carlos A. Molina – recording engineer
Tom Norris – mixing engineer, mastering engineer
Mauricio Rengifo – producer, songwriter, recording engineer, programming
Elena Rose – songwriter
Andrés Torres – producer, songwriter, recording engineer, programming
Charts
Year-end charts
Certifications
References
External links
2022 singles
2022 songs
Tini (singer) songs
Becky G songs
Songs written by Becky G
Anitta (singer) songs
Songs written by Anitta (singer)
Songs written by Elena Rose
Songs written by Andrés Torres (producer)
Songs written by Mauricio Rengifo
Song recordings produced by Andrés Torres (producer)
Sony Music Latin singles
Hollywood Records singles
Spanish-language songs
Reggaeton songs
|
```python
#
#
# path_to_url
#
# Unless required by applicable law or agreed to in writing, software
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# Utilities for the server and things that run on the server (like
# algorithms).
from utils import clock
# Helper function to determine if a resource is in learning mode.
def in_learning_mode(resource):
return resource.learning_mode_expiry_time >= clock.get_time()
# Helper function to determine if a lease is expired.
# Note: If there is no lease, it is not expired!
def lease_expired(thing):
return thing and thing.HasField('has') and thing.has.expiry_time <= clock.get_time()
# Calculates the sum of all wants by clients and servers that depend on this
# server.
def sum_wants(resource):
# Calculates the sum of what all clients and higher level servers want.
n = sum([client.wants for client in resource.client])
for server in resource.server:
for want in server.wants:
n += want.wants
return n
# Calculates the sum of capacity that this server has outstanding
# leases for.
def sum_leases(resource):
return sum([
client.has.capacity for client in resource.client
if client.HasField('has')]) + sum([
server.has.capacity
for server in resource.server
if server.HasField('has')])
# Calculates the sum of capacity that this server has outstanding
# responsibilities for. These responsibilities include all the
# clients that have leases, and all the outstanding responsibilities
# of the server. In a time of shrinking allocations a server might
# have more outstanding responsibilities than it has capacity to
# give out. We call this phenomenon 'shortfall'.
def sum_outstanding(resource):
return sum([
client.has.capacity for client in resource.client
if client.HasField('has')]) + sum([
server.outstanding
for server in resource.server])
```
|
```python
"""Kernel Principal Components Analysis"""
# Author: Mathieu Blondel <mathieu@mblondel.org>
import numpy as np
from scipy import linalg
from scipy.sparse.linalg import eigsh
from ..utils import check_random_state
from ..utils.validation import check_is_fitted, check_array
from ..exceptions import NotFittedError
from ..base import BaseEstimator, TransformerMixin
from ..preprocessing import KernelCenterer
from ..metrics.pairwise import pairwise_kernels
class KernelPCA(BaseEstimator, TransformerMixin):
"""Kernel Principal component analysis (KPCA)
Non-linear dimensionality reduction through the use of kernels (see
:ref:`metrics`).
Read more in the :ref:`User Guide <kernel_PCA>`.
Parameters
----------
n_components : int, default=None
Number of components. If None, all non-zero components are kept.
kernel : "linear" | "poly" | "rbf" | "sigmoid" | "cosine" | "precomputed"
Kernel. Default="linear".
gamma : float, default=1/n_features
Kernel coefficient for rbf, poly and sigmoid kernels. Ignored by other
kernels.
degree : int, default=3
Degree for poly kernels. Ignored by other kernels.
coef0 : float, default=1
Independent term in poly and sigmoid kernels.
Ignored by other kernels.
kernel_params : mapping of string to any, default=None
Parameters (keyword arguments) and values for kernel passed as
callable object. Ignored by other kernels.
alpha : int, default=1.0
Hyperparameter of the ridge regression that learns the
inverse transform (when fit_inverse_transform=True).
fit_inverse_transform : bool, default=False
Learn the inverse transform for non-precomputed kernels.
(i.e. learn to find the pre-image of a point)
eigen_solver : string ['auto'|'dense'|'arpack'], default='auto'
Select eigensolver to use. If n_components is much less than
the number of training samples, arpack may be more efficient
than the dense eigensolver.
tol : float, default=0
Convergence tolerance for arpack.
If 0, optimal value will be chosen by arpack.
max_iter : int, default=None
Maximum number of iterations for arpack.
If None, optimal value will be chosen by arpack.
remove_zero_eig : boolean, default=False
If True, then all components with zero eigenvalues are removed, so
that the number of components in the output may be < n_components
(and sometimes even zero due to numerical instability).
When n_components is None, this parameter is ignored and components
with zero eigenvalues are removed regardless.
random_state : int, RandomState instance or None, optional (default=None)
If int, random_state is the seed used by the random number generator;
If RandomState instance, random_state is the random number generator;
If None, the random number generator is the RandomState instance used
by `np.random`. Used when ``eigen_solver`` == 'arpack'.
.. versionadded:: 0.18
copy_X : boolean, default=True
If True, input X is copied and stored by the model in the `X_fit_`
attribute. If no further changes will be done to X, setting
`copy_X=False` saves memory by storing a reference.
.. versionadded:: 0.18
n_jobs : int, default=1
The number of parallel jobs to run.
If `-1`, then the number of jobs is set to the number of CPU cores.
.. versionadded:: 0.18
Attributes
----------
lambdas_ : array, (n_components,)
Eigenvalues of the centered kernel matrix in decreasing order.
If `n_components` and `remove_zero_eig` are not set,
then all values are stored.
alphas_ : array, (n_samples, n_components)
Eigenvectors of the centered kernel matrix. If `n_components` and
`remove_zero_eig` are not set, then all components are stored.
dual_coef_ : array, (n_samples, n_features)
Inverse transform matrix. Set if `fit_inverse_transform` is True.
X_transformed_fit_ : array, (n_samples, n_components)
Projection of the fitted data on the kernel principal components.
X_fit_ : (n_samples, n_features)
The data used to fit the model. If `copy_X=False`, then `X_fit_` is
a reference. This attribute is used for the calls to transform.
References
----------
Kernel PCA was introduced in:
Bernhard Schoelkopf, Alexander J. Smola,
and Klaus-Robert Mueller. 1999. Kernel principal
component analysis. In Advances in kernel methods,
MIT Press, Cambridge, MA, USA 327-352.
"""
def __init__(self, n_components=None, kernel="linear",
gamma=None, degree=3, coef0=1, kernel_params=None,
alpha=1.0, fit_inverse_transform=False, eigen_solver='auto',
tol=0, max_iter=None, remove_zero_eig=False,
random_state=None, copy_X=True, n_jobs=1):
if fit_inverse_transform and kernel == 'precomputed':
raise ValueError(
"Cannot fit_inverse_transform with a precomputed kernel.")
self.n_components = n_components
self.kernel = kernel
self.kernel_params = kernel_params
self.gamma = gamma
self.degree = degree
self.coef0 = coef0
self.alpha = alpha
self.fit_inverse_transform = fit_inverse_transform
self.eigen_solver = eigen_solver
self.remove_zero_eig = remove_zero_eig
self.tol = tol
self.max_iter = max_iter
self._centerer = KernelCenterer()
self.random_state = random_state
self.n_jobs = n_jobs
self.copy_X = copy_X
@property
def _pairwise(self):
return self.kernel == "precomputed"
def _get_kernel(self, X, Y=None):
if callable(self.kernel):
params = self.kernel_params or {}
else:
params = {"gamma": self.gamma,
"degree": self.degree,
"coef0": self.coef0}
return pairwise_kernels(X, Y, metric=self.kernel,
filter_params=True, n_jobs=self.n_jobs,
**params)
def _fit_transform(self, K):
""" Fit's using kernel K"""
# center kernel
K = self._centerer.fit_transform(K)
if self.n_components is None:
n_components = K.shape[0]
else:
n_components = min(K.shape[0], self.n_components)
# compute eigenvectors
if self.eigen_solver == 'auto':
if K.shape[0] > 200 and n_components < 10:
eigen_solver = 'arpack'
else:
eigen_solver = 'dense'
else:
eigen_solver = self.eigen_solver
if eigen_solver == 'dense':
self.lambdas_, self.alphas_ = linalg.eigh(
K, eigvals=(K.shape[0] - n_components, K.shape[0] - 1))
elif eigen_solver == 'arpack':
random_state = check_random_state(self.random_state)
# initialize with [-1,1] as in ARPACK
v0 = random_state.uniform(-1, 1, K.shape[0])
self.lambdas_, self.alphas_ = eigsh(K, n_components,
which="LA",
tol=self.tol,
maxiter=self.max_iter,
v0=v0)
# sort eigenvectors in descending order
indices = self.lambdas_.argsort()[::-1]
self.lambdas_ = self.lambdas_[indices]
self.alphas_ = self.alphas_[:, indices]
# remove eigenvectors with a zero eigenvalue
if self.remove_zero_eig or self.n_components is None:
self.alphas_ = self.alphas_[:, self.lambdas_ > 0]
self.lambdas_ = self.lambdas_[self.lambdas_ > 0]
return K
def _fit_inverse_transform(self, X_transformed, X):
if hasattr(X, "tocsr"):
raise NotImplementedError("Inverse transform not implemented for "
"sparse matrices!")
n_samples = X_transformed.shape[0]
K = self._get_kernel(X_transformed)
K.flat[::n_samples + 1] += self.alpha
self.dual_coef_ = linalg.solve(K, X, sym_pos=True, overwrite_a=True)
self.X_transformed_fit_ = X_transformed
def fit(self, X, y=None):
"""Fit the model from data in X.
Parameters
----------
X : array-like, shape (n_samples, n_features)
Training vector, where n_samples in the number of samples
and n_features is the number of features.
Returns
-------
self : object
Returns the instance itself.
"""
X = check_array(X, accept_sparse='csr', copy=self.copy_X)
K = self._get_kernel(X)
self._fit_transform(K)
if self.fit_inverse_transform:
sqrt_lambdas = np.diag(np.sqrt(self.lambdas_))
X_transformed = np.dot(self.alphas_, sqrt_lambdas)
self._fit_inverse_transform(X_transformed, X)
self.X_fit_ = X
return self
def fit_transform(self, X, y=None, **params):
"""Fit the model from data in X and transform X.
Parameters
----------
X : array-like, shape (n_samples, n_features)
Training vector, where n_samples in the number of samples
and n_features is the number of features.
Returns
-------
X_new : array-like, shape (n_samples, n_components)
"""
self.fit(X, **params)
X_transformed = self.alphas_ * np.sqrt(self.lambdas_)
if self.fit_inverse_transform:
self._fit_inverse_transform(X_transformed, X)
return X_transformed
def transform(self, X):
"""Transform X.
Parameters
----------
X : array-like, shape (n_samples, n_features)
Returns
-------
X_new : array-like, shape (n_samples, n_components)
"""
check_is_fitted(self, 'X_fit_')
K = self._centerer.transform(self._get_kernel(X, self.X_fit_))
return np.dot(K, self.alphas_ / np.sqrt(self.lambdas_))
def inverse_transform(self, X):
"""Transform X back to original space.
Parameters
----------
X : array-like, shape (n_samples, n_components)
Returns
-------
X_new : array-like, shape (n_samples, n_features)
References
----------
"Learning to Find Pre-Images", G BakIr et al, 2004.
"""
if not self.fit_inverse_transform:
raise NotFittedError("The fit_inverse_transform parameter was not"
" set to True when instantiating and hence "
"the inverse transform is not available.")
K = self._get_kernel(X, self.X_transformed_fit_)
return np.dot(K, self.dual_coef_)
```
|
The East Main Street Residential Historic District in Lumpkin, Georgia is a historic district which was listed on the National Register of Historic Places in 1982. The listing included five contributing buildings.
The district includes buildings on East Main Street near Elm Street. It includes a Plantation Plain-style cottage, two Victorian cottages, and a Queen Anne-style house.
References
Historic districts on the National Register of Historic Places in Georgia (U.S. state)
National Register of Historic Places in Stewart County, Georgia
Victorian architecture in Georgia (U.S. state)
Queen Anne architecture in Georgia (U.S. state)
|
```html
<html>
<head>
<meta http-equiv="Content-Language" content="en-us">
<meta name="GENERATOR" content="Microsoft FrontPage 5.0">
<meta name="ProgId" content="FrontPage.Editor.Document">
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
<title>Filesystem Home</title>
<link href="styles.css" rel="stylesheet">
</head>
<body>
<table border="0" cellpadding="5" cellspacing="0" style="border-collapse: collapse"
bordercolor="#111111">
<tr>
<td width="277">
<a href="../../../index.htm">
<img src="../../../boost.png" alt="boost.png (6897 bytes)" align="middle"
width="300" height="86" border="0"></a></td>
<td align="middle">
<font size="7">Filesystem Library<br>
Version 3</font>
</td>
</tr>
</table>
<table border="0" cellpadding="5" cellspacing="0" style="border-collapse: collapse"
bordercolor="#111111" bgcolor="#D7EEFF" width="100%">
<tr>
<td><a href="index.htm">Home</a>
<a href="tutorial.html">Tutorial</a>
<a href="reference.html">Reference</a>
<a href="faq.htm">FAQ</a>
<a href="release_history.html">Releases</a>
<a href="portability_guide.htm">Portability</a>
<a href="v3.html">V3 Intro</a>
<a href="v3_design.html">V3 Design</a>
<a href="deprecated.html">Deprecated</a>
<a href="issue_reporting.html">Bug Reports</a>
</td>
</table>
<p></p>
<table border="1" cellpadding="5" cellspacing="0" style="border-collapse: collapse"
bordercolor="#111111" align="right">
<tr>
<td width="100%" bgcolor="#D7EEFF" align="center">
<i><b>Contents</b></i></td>
</tr>
<tr>
<td width="100%" bgcolor="#E8F5FF">
<a href="#Introduction">Introduction</a><br>
<a href="#Documentation">Documentation</a><br>
<a href="#Using">Using the library</a><br>
<a href="#Coding-guidelines">Coding guidelines</a><br>
<a href="#Cautions">Cautions</a><br>
<a href="#Headers">Headers</a><br>
<a href="#Examples">Example programs</a><br>
<a href="#Implementation">Implementation</a><br>
<a href="#Macros">Macros</a><br>
<a href="#Building">Building the object-library</a><br>
<a href="#Cgywin">Notes for Cygwin users</a><br>
<a href="#Change-history">Version history<br>
with acknowledgements</a></td>
</tr>
</table>
<p></p>
<h2><a name="Introduction">Introduction</a></h2>
<p>The Boost.Filesystem library provides facilities to manipulate files and directories,
and the paths that identify them.</p>
<p>The features of the library include:</p>
<ul>
<li><b>A modern C++ interface, highly compatible with the C++ standard
library.</b></li>
</ul>
<blockquote>
<blockquote>
<p>Many users say the interface is their primary motivation for using
Boost.Filesystem. They like its use of familiar idioms based on standard library
containers, iterators, and algorithms. They like having errors reported by
throwing exceptions.</p>
</blockquote>
</blockquote>
<ul>
<li><b>Portability between operating systems.</b><br>
<ul>
<li>At the C++ syntax level, it is convenient to learn and use one interface
regardless of the operating system.</li>
<li>At the semantic level, behavior of code is reasonably portable across
operating systems.</li>
<li>Dual generic or native path format support encourages program
portability, yet still allows communication with users in system specific
formats.<br>
</li>
</ul>
</li>
<li><b>Error handling and reporting via C++ exceptions (the default) or error
codes.</b><br>
<ul>
<li>C++ exceptions are the preferred error reporting mechanism for most
applications. The exception thrown includes the detailed error code
information important for diagnosing the exact cause of file system errors.</li>
<li>Error reporting via error code allows user code that provides detailed
error recovery to avoid becoming so littered with try-catch blocks as to be
unmaintainable. <br>
</li>
</ul>
</li>
<li><b>Suitable for a broad spectrum of applications, ranging from simple
script-like operations to extremely complex production code.</b><br>
<ul>
<li>At the simple script-like end of the spectrum, the intent is not to
compete with Python, Perl, or shell languages, but rather to provide
filesystem operations when C++ is already the language of choice.</li>
<li dir="ltr">
<p dir="ltr">Finer grained control over operations and error handling is available to
support more complex applications or other cases where throwing exceptions
isn't desired.<br>
</li>
</ul>
</li>
<li>
<p dir="ltr"><b>Forms the basis for
<a href="path_to_url">
ISO/IEC TS 18822</a>, the C++ standard library Filesystem Technical
Specification.</b></li>
</ul>
<h2><a name="Documentation">Documentation</a></h2>
<p><b><a href="tutorial.html">Tutorial</a></b> - A gentle introduction to
the library, with example programs provided for you to experiment with.</p>
<p><b><a href="reference.html">Reference</a></b> - Formal documentation in the
style of the C++ standard for
every component of the library.</p>
<p><b><a href="faq.htm">FAQ</a></b> - Frequently asked questions.</p>
<p><b><a href="portability_guide.htm">Portability Guide</a></b> - Help for those
concerned with writing code to run on multiple operating systems.</p>
<p><b><a href="deprecated.html">Deprecated Features</a></b> - Identifies
deprecated features and their replacements.</p>
<p><b><a href="v3.html">Version 3 Introduction</a></b> - Aimed at users of prior
Boost.Filesystem versions.</p>
<p><b><a href="v3_design.html">Version 3 Design</a></b> - Historical document
from the start of the Version 3 design process.</p>
<p><b><a href="design.htm">Original Design</a></b> - Historical document from
the start of the Version 1 design process.</p>
<p><b><a href="do_list.html">Do List</a></b> - Boost.Filesystem development work
in the pipeline.</p>
<h2><a name="Using">Using</a> the library</h2>
<p>Boost.Filesystem is implemented as a separately compiled library, so you must install
binaries in a location that can be found by your linker. If you followed the
<a href="path_to_url">Boost Getting Started</a> instructions, that's already been done for you.</p>
<h2><a name="Coding-guidelines">Coding guidelines</a></h2>
<p>For new code, defining <code>BOOST_FILESYSTEM_NO_DEPRECATED</code> before
including filesystem headers is strongly recommended. This prevents inadvertent
use of old features, particularly legacy function names, that have been replaced
and are going to go away in the future.</p>
<h2><a name="Cautions">Cautions</a></h2>
<p>After reading the tutorial you can dive right into simple,
script-like programs using the Filesystem Library! Before doing any serious
work, however, there a few cautions to be aware of:</p>
<h4><b>Effects and Postconditions not guaranteed in the presence of race-conditions</b></h4>
<p>Filesystem function specifications follow the C++ Standard Library form, specifying behavior in terms of
effects and postconditions. If
a <a href="reference.html#Race-condition">race-condition</a> exists, a function's
postconditions may no longer be true by the time the function returns to the
caller.</p>
<blockquote>
<p><b><i>Explanation: </i></b>The state of files and directories is often
globally shared, and thus may be changed unexpectedly by other threads,
processes, or even other computers having network access to the filesystem. As an
example of the difficulties this can cause, note that the following asserts
may fail:</p>
<blockquote>
<p><code>assert( exists( "foo" ) == exists( "foo" ) ); //
(1)<br>
<br>
remove_all( "foo" );<br>
assert( !exists( "foo" ) ); // (2)<br>
<br>
assert( is_directory( "foo" ) == is_directory( "foo" ) ); //
(3)</code></p>
</blockquote>
<p>(1) will fail if a non-existent "foo" comes into existence, or an
existent "foo" is removed, between the first and second call to <i>exists()</i>.
This could happen if, during the execution of the example code, another thread,
process, or computer is also performing operations in the same directory.</p>
<p>(2) will fail if between the call to <i>remove_all()</i> and the call to
<i>exists()</i> a new file or directory named "foo" is created by another
thread, process, or computer.</p>
<p>(3) will fail if another thread, process, or computer removes an
existing file "foo" and then creates a directory named "foo", between the
example code's two calls to <i>is_directory()</i>.</p>
</blockquote>
<h4>E<b>xceptions</b></h4>
<p>Unless otherwise specified, Boost.Filesystem functions throw <i>
<a href="reference.html#basic_filesystem_error-constructors">basic_filesystem_error</a></i>
exceptions to report failures such as I/O errors. Implementations may also use C++ Standard Library functions
which can throw <i>std::bad_alloc </i>exceptions to report memory allocation
errors. These exceptions may be thrown even
though the error condition leading to the exception is not explicitly specified
in the function's "Throws" paragraph.</p>
<p>Nominally non-throwing versions are provided for
<a href="reference.html#Operational-functions">operational functions</a> that
access the external file system, since these are often used
in contexts where error codes may be the preferred way to report an error. Even
the nominally non-throwing versions of functions will throw <i>std::bad_alloc </i>
exceptions to report memory allocation errors. However, functions marked <code>
noexcept</code> never throw exceptions.</p>
<h2><a name="Headers">Headers</a></h2>
<p>The Boost.Filesystem library provides several headers:</p>
<ul>
<li>Header <<a href="../../../boost/filesystem.hpp">boost/filesystem.hpp</a>>
provides access to all features of the library, except file streams.<br>
</li>
<li>Header <<a href="../../../boost/filesystem/fstream.hpp">boost/filesystem<i>/</i>fstream.hpp</a>>
inherits the same components as the C++ Standard
Library's <i>fstream</i> header, but files are identified by <code>const path&</code>
arguments rather that <code>const char*</code> arguments.</li>
</ul>
<h2><a name="Examples">Example programs</a></h2>
<p>See the <a href="tutorial.html">tutorial</a> for example programs.</p>
<h2><a name="Implementation">Implementation</a></h2>
<p>The current implementation supports operating systems which provide
the POSIX or Windows API's.</p>
<p>The library is in regular use on Apple OS X, HP-UX, IBM AIX, Linux,
Microsoft Windows, SGI IRIX, and Sun Solaris operating systems using a variety
of compilers. It is also used by several smart phone operating systems.</p>
<h2><a name="Macros">Macros</a></h2>
<p>Users may defined the following macros if desired. Sensible defaults are
provided, so users can ignore these macros unless they have special needs.</p>
<table border="1" cellpadding="5" cellspacing="0" style="border-collapse: collapse" bordercolor="#111111">
<tr>
<td><b><i>Macro Name</i></b></td>
<td><b><i>Default</i></b></td>
<td><b><i>Effect if defined</i></b></td>
</tr>
<tr>
<td valign="top"><code>BOOST_FILESYSTEM_NO_DEPRECATED</code></td>
<td valign="top">Not defined.</td>
<td valign="top">Deprecated features are excluded from headers.</td>
</tr>
<tr>
<td valign="top"><code>BOOST_FILESYSTEM_DYN_LINK</code></td>
<td valign="top">Defined if <code>BOOST_ALL_DYN_LINK</code> is defined,
otherwise not defined.</td>
<td valign="top">The Boost.Filesystem library is dynamically linked. If not defined,
static linking is assumed.</td>
</tr>
<tr>
<td valign="top"><code>BOOST_FILESYSTEM_NO_LIB</code></td>
<td valign="top">Defined if <code>BOOST_ALL_NO_LIB</code> is defined,
otherwise not defined.</td>
<td valign="top">Boost.Filesystem library does not use the Boost auto-link
facility.</td>
</tr>
</table>
<p>User-defined BOOST_POSIX_API and BOOST_WINDOWS_API macros are no longer
supported.</p>
<h2><a name="Building">Building</a> the object-library</h2>
<p>The object-library will be built automatically if you are using the Boost
build system. See
<a href="../../../more/getting_started.html">Getting Started</a>. It can also be
built manually using a <a href="../build/Jamfile.v2">Jamfile</a>
supplied in directory libs/filesystem/build, or the user can construct an IDE
project or make file which includes the object-library source files.</p>
<p>The object-library source files are
supplied in the <a href="../src">src directory</a>. These source files implement the
library for POSIX or Windows compatible operating systems; no implementation is
supplied for other operating systems. Note that many operating systems not
normally thought of as POSIX systems, such as mainframe legacy
operating systems or embedded operating systems, support POSIX compatible file
systems and so will work with the Filesystem Library.</p>
<p>The object-library can be built for static or dynamic (shared/dll) linking.
This is controlled by the BOOST_ALL_DYN_LINK or BOOST_FILESYSTEM_DYN_LINK
macros. See the <a href="path_to_url">Separate
Compilation</a> page for a description of the techniques used.</p>
<h3>Note for <a name="Cgywin">Cygwin</a> users</h3>
<p> <a href="path_to_url">Cygwin</a> version 1.7 or later is
required because only versions of GCC with wide character strings are supported.</p>
<p> The library's implementation code treats Cygwin as a Windows platform, and
thus uses the Windows API and uses Windows path syntax as the native path
syntax.</p>
<h2><a name="Change-history">Version history</a></h2>
<h3>Version 4</h3>
<p><b>Under development </b>- Add support for the
<a href="path_to_url">ISO
C++ File System Technical Specification</a>. The Filesystem TS is based on
Boost.Filesystem Version 3, with only a small number of changes. Most user code
written for Version 3 should work unchanged with Version 4.</p>
<h3>Version 3</h3>
<p>Boost 1.44.0 - June, 2010 - Internationalization via single class <code>path</code>.
More uniform error handling.</p>
<p>Peter Dimov suggested use of a single path class rather than a <code>basic_path</code>
class template. That idea was the basis for the Version 3 redesign.</p>
<p>Thanks for comments from Robert Stewart, Zach Laine, Peter Dimov, Gregory
Peele, Scott McMurray, John Bytheway, Jeff Flinn, Jeffery Bosboom.</p>
<h3>Version 2</h3>
<p>Boost 1.34.0 - May, 2007 - Internationalization via <code>basic_path</code>
template.</p>
<p>So many people have contributed comments and bug reports that it isn't any
longer possible to acknowledge them individually. That said, Peter Dimov and Rob
Stewart need to be specially thanked for their many constructive criticisms and
suggestions. Terence
Wilson and Chris Frey contributed timing programs which helped illuminate
performance issues.</p>
<h3>Version 1</h3>
<p>Boost 1.30.0 - March, 2003 - Initial official Boost release.</p>
<p>The Filesystem Library was designed and implemented by Beman Dawes. The
original <i>directory_iterator</i> and <i>filesystem_error</i> classes were
based on prior work from Dietmar Kuehl, as modified by Jan Langer. Thomas Witt
was a particular help in later stages of initial development. Peter Dimov and
Rob Stewart made many useful suggestions and comments over a long period of
time. Howard Hinnant helped with internationalization issues.</p>
<p>Key <a href="design.htm#Requirements">design requirements</a> and
<a href="design.htm#Realities">design realities</a> were developed during
extensive discussions on the Boost mailing list, followed by comments on the
initial implementation. Numerous helpful comments were then received during the
Formal Review.<p>Participants included
Aaron Brashears,
Alan Bellingham,
Aleksey Gurtovoy,
Alex Rosenberg,
Alisdair Meredith,
Andy Glew,
Anthony Williams,
Baptiste Lepilleur,
Beman Dawes,
Bill Kempf,
Bill Seymour,
Carl Daniel,
Chris Little,
Chuck Allison,
Craig Henderson,
Dan Nuffer,
Dan'l Miller,
Daniel Frey,
Darin Adler,
David Abrahams,
David Held,
Davlet Panech,
Dietmar Kuehl,
Douglas Gregor,
Dylan Nicholson,
Ed Brey,
Eric Jensen,
Eric Woodruff,
Fedder Skovgaard,
Gary Powell,
Gennaro Prota,
Geoff Leyland,
George Heintzelman,
Giovanni Bajo,
Glen Knowles,
Hillel Sims,
Howard Hinnant,
Jaap Suter,
James Dennett,
Jan Langer,
Jani Kajala,
Jason Stewart,
Jeff Garland,
Jens Maurer,
Jesse Jones,
Jim Hyslop,
Joel de Guzman,
Joel Young,
John Levon,
John Maddock,
John Williston,
Jonathan Caves,
Jonathan Biggar,
Jurko,
Justus Schwartz,
Keith Burton,
Ken Hagen,
Kostya Altukhov,
Mark Rodgers,
Martin Schuerch,
Matt Austern,
Matthias Troyer,
Mattias Flodin,
Michiel Salters,
Mickael Pointier,
Misha Bergal,
Neal Becker,
Noel Yap,
Parksie,
Patrick Hartling, Pavel Vozenilek,
Pete Becker,
Peter Dimov,
Rainer Deyke,
Rene Rivera,
Rob Lievaart,
Rob Stewart,
Ron Garcia,
Ross Smith,
Sashan,
Steve Robbins,
Thomas Witt,
Tom Harris,
Toon Knapen,
Victor Wagner,
Vincent Finn,
Vladimir Prus, and
Yitzhak Sapir
<p>A lengthy discussion on the C++ committee's library reflector illuminated the "illusion
of portability" problem, particularly in postings by PJ Plauger and Pete Becker.</p>
<p>Walter Landry provided much help illuminating symbolic link use cases for
version 1.31.0. </p>
<hr>
<p>Revised
<!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->25 October, 2015<!--webbot bot="Timestamp" endspan i-checksum="38877" --></p>
<p> Use, modification, and distribution are subject to the Boost Software
www.boost.org/LICENSE_1_0.txt</a></p>
</body>
</html>
```
|
Garfield Weston Merit Scholarships for Colleges (GWMSC) was a scholarship program that recognize exemplary college students who were passionate about their field of study and were interested in helping their communities. The program ran from 1998 to 2012.
History
In 1998, The W. Garfield Weston Foundation collaborated with the Canadian Merit Scholarship Foundation (now the Loran Scholars Foundation) to start a scholarship program for college students. Over the course of 14 years, The W. Garfield Weston Foundation invested $14.6 million in 471 W. Garfield Weston Scholars and 409 college students who received regional or provincial awards.
Awards
The Garfield Weston Merit Scholarship for Colleges (GWMSC) program presented three types of awards to students who were beginning their first year of college. The GWMSC presented National Awards to 25 students. This scholarship waived the tuition at a consortium college and was renewable for one or two years. The GWMSC also presented 18 regional awards, valued at $4,000 each for one year of college study. The third award was the $2,500 provincial award for one year of study.
References
External links
Official website of The Garfield Weston Merit Scholarships for Colleges
Scholarships in Canada
|
```java
package org.hswebframework.web.crud.service;
import org.hswebframework.web.crud.TestApplication;
import org.hswebframework.web.crud.entity.TestEntity;
import org.junit.Test;
import org.junit.runner.RunWith;
import org.springframework.beans.factory.annotation.Autowired;
import org.springframework.boot.test.context.SpringBootTest;
import org.springframework.test.annotation.DirtiesContext;
import org.springframework.test.context.junit4.SpringRunner;
import reactor.core.publisher.Mono;
import reactor.test.StepVerifier;
@SpringBootTest(classes = TestApplication.class, args = "--hsweb.cache.type=guava")
@RunWith(SpringRunner.class)
@DirtiesContext(classMode = DirtiesContext.ClassMode.BEFORE_CLASS)
public class GenericReactiveCacheSupportCrudServiceTest {
@Autowired
private TestCacheEntityService entityService;
@Test
public void test() {
TestEntity entity = TestEntity.of("test2",100,"testName");
entityService.insert(Mono.just(entity))
.as(StepVerifier::create)
.expectNext(1)
.verifyComplete();
entityService.findById(Mono.just(entity.getId()))
.map(TestEntity::getId)
.as(StepVerifier::create)
.expectNext(entity.getId())
.verifyComplete();
entityService.getCache()
.getMono("id:".concat(entity.getId()))
.map(TestEntity::getId)
.as(StepVerifier::create)
.expectNext(entity.getId())
.verifyComplete();
entityService.createUpdate()
.set("age",120)
.where("id",entity.getId())
.execute()
.as(StepVerifier::create)
.expectNext(1)
.verifyComplete();
entityService.getCache()
.getMono("id:".concat(entity.getId()))
.switchIfEmpty(Mono.error(NullPointerException::new))
.as(StepVerifier::create)
.expectError(NullPointerException.class)
.verify();
}
@Test
public void test2() {
TestEntity entity = TestEntity.of("test1",100,"testName");
entityService
.createDelete()
.notNull(TestEntity::getId)
.execute()
.block();
entityService
.insert(Mono.just(entity))
.as(StepVerifier::create)
.expectNext(1)
.verifyComplete();
entityService
.getCacheAll()
.as(StepVerifier::create)
.expectNextCount(1)
.verifyComplete();
entity.setAge(120);
entityService
.updateById(entity.getId(), entity)
.as(StepVerifier::create)
.expectNext(1)
.verifyComplete();
entityService
.getCacheAll()
.switchIfEmpty(Mono.error(NullPointerException::new))
.as(StepVerifier::create)
.expectNextMatches(t -> t.getAge().equals(120))
.verifyComplete();
entity.setId(null);
entityService
.insert(Mono.just(entity))
.as(StepVerifier::create)
.expectNext(1)
.verifyComplete();
entityService
.getCacheAll()
.as(StepVerifier::create)
.expectNextCount(2)
.verifyComplete();
entityService
.deleteById(entity.getId())
.as(StepVerifier::create)
.expectNextCount(1)
.verifyComplete();
entityService
.getCacheAll()
.as(StepVerifier::create)
.expectNextCount(1)
.verifyComplete();
}
}
```
|
```java
/*
*/
package test.pmu;
import java.util.concurrent.ThreadLocalRandom;
/**
* This demo shows the importance of hardware performance counters.
* Two tests (test128K and test8M) execute the same number of
* operations, however, test128K completes much quicker than test8M.
* <p>
* CPU profiling shows no difference between two tests,
* but cache-misses profiling highlights test8M
* as the problematic method.
*/
public class Dictionary {
private static void testRandomRead(long[] array, int bound) {
long startTime = System.nanoTime();
for (long i = 0; i < Integer.MAX_VALUE; i++) {
int index = ThreadLocalRandom.current().nextInt(bound);
array[index]++;
}
long endTime = System.nanoTime();
System.out.printf("Time spent: %.3f\n", (endTime - startTime) / 1e9);
}
public static void test128K() {
long[] array = new long[1024 * 1024];
testRandomRead(array, 16384);
}
public static void test8M() {
long[] array = new long[1024 * 1024];
testRandomRead(array, 1024 * 1024);
}
public static void main(String[] args) {
new Thread(Dictionary::test128K).start();
new Thread(Dictionary::test8M).start();
}
}
```
|
```javascript
/**
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
'use strict';
/**
* Compute the mid-range of a double-precision floating-point strided array.
*
* @module @stdlib/stats/base/dmidrange
*
* @example
* var Float64Array = require( '@stdlib/array/float64' );
* var dmidrange = require( '@stdlib/stats/base/dmidrange' );
*
* var x = new Float64Array( [ 1.0, -2.0, 2.0 ] );
*
* var v = dmidrange( x.length, x, 1 );
* // returns 0.0
*
* @example
* var Float64Array = require( '@stdlib/array/float64' );
* var floor = require( '@stdlib/math/base/special/floor' );
* var dmidrange = require( '@stdlib/stats/base/dmidrange' );
*
* var x = new Float64Array( [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0 ] );
* var N = floor( x.length / 2 );
*
* var v = dmidrange.ndarray( N, x, 2, 1 );
* // returns 1.0
*/
// MODULES //
var join = require( 'path' ).join;
var tryRequire = require( '@stdlib/utils/try-require' );
var isError = require( '@stdlib/assert/is-error' );
var main = require( './main.js' );
// MAIN //
var dmidrange;
var tmp = tryRequire( join( __dirname, './native.js' ) );
if ( isError( tmp ) ) {
dmidrange = main;
} else {
dmidrange = tmp;
}
// EXPORTS //
module.exports = dmidrange;
// exports: { "ndarray": "dmidrange.ndarray" }
```
|
```smalltalk
using System;
using System.Collections.Immutable;
using System.Globalization;
using System.Linq;
using System.Text.Json;
using System.Threading;
using System.Threading.Tasks;
using Microsoft.Extensions.DependencyInjection;
using OpenIddict.Abstractions;
using Shouldly;
using Xunit;
namespace Volo.Abp.OpenIddict.Scopes;
public class AbpOpenIddictScopeStore_Tests : OpenIddictDomainTestBase
{
private readonly IOpenIddictScopeStore<OpenIddictScopeModel> _scopeStore;
private readonly AbpOpenIddictTestData _testData;
public AbpOpenIddictScopeStore_Tests()
{
_scopeStore = ServiceProvider.GetRequiredService<IOpenIddictScopeStore<OpenIddictScopeModel>>();
_testData = ServiceProvider.GetRequiredService<AbpOpenIddictTestData>();
}
[Fact]
public async Task CountAsync()
{
var count = await _scopeStore.CountAsync(CancellationToken.None);
count.ShouldBe(2);
}
[Fact]
public async Task CreateAsync()
{
await _scopeStore.CreateAsync(
new OpenIddictScopeModel {
Name = "scope3", Description = "scope3 description", DisplayName = "scope3 display name"
}, CancellationToken.None);
var scope = await _scopeStore.FindByNameAsync("scope3", CancellationToken.None);
scope.ShouldNotBeNull();
scope.Name.ShouldBe("scope3");
scope.Description.ShouldBe("scope3 description");
scope.DisplayName.ShouldBe("scope3 display name");
scope.Descriptions.ShouldBeNull();
scope.DisplayNames.ShouldBeNull();
scope.Resources.ShouldBeNull();
}
[Fact]
public async Task DeleteAsync()
{
var scope = await _scopeStore.FindByIdAsync(_testData.Scope1Id.ToString(), CancellationToken.None);
await _scopeStore.DeleteAsync(scope, CancellationToken.None);
scope = await _scopeStore.FindByIdAsync(_testData.Scope1Id.ToString(), CancellationToken.None);
scope.ShouldBeNull();
}
[Fact]
public async Task FindByIdAsync_Should_Return_Null_If_Not_Found()
{
var nonExistingId = Guid.NewGuid().ToString();
var scope = await _scopeStore.FindByIdAsync(nonExistingId, CancellationToken.None);
scope.ShouldBeNull();
}
[Fact]
public async Task FindByIdAsync_Should_Return_Scope_If_Found()
{
var scope = await _scopeStore.FindByIdAsync(_testData.Scope1Id.ToString(), CancellationToken.None);
scope.ShouldNotBeNull();
scope.Name.ShouldBe(_testData.Scope1Name);
scope.DisplayName.ShouldBe("Test Scope 1");
scope.Description.ShouldBe("Test Scope 1");
scope.DisplayNames.ShouldContain("1");
scope.DisplayNames.ShouldContain("Test Kapsam 1");
scope.Resources.ShouldBe("[\"TestScope1Resource\"]");
}
[Fact]
public async Task FindByNameAsync_Should_Return_Null_If_Not_Found()
{
var nonExistingName = Guid.NewGuid().ToString();
var scope = await _scopeStore.FindByNameAsync(nonExistingName, CancellationToken.None);
scope.ShouldBeNull();
}
[Fact]
public async Task FindByNameAsync_Should_Return_Application_If_Found()
{
var scope = await _scopeStore.FindByNameAsync(_testData.Scope1Name, CancellationToken.None);
scope.ShouldNotBeNull();
scope.Name.ShouldBe(_testData.Scope1Name);
scope.DisplayName.ShouldBe("Test Scope 1");
scope.Description.ShouldBe("Test Scope 1");
scope.DisplayNames.ShouldContain("1");
scope.DisplayNames.ShouldContain("Test Kapsam 1");
scope.Resources.ShouldBe("[\"TestScope1Resource\"]");
}
[Fact]
public async Task FindByNamesAsync_Should_Return_Empty_If_Not_Found()
{
var scopes = await _scopeStore
.FindByNamesAsync(ImmutableArray.Create("non-existing-name"), CancellationToken.None).ToListAsync();
scopes.Count.ShouldBe(0);
}
[Fact]
public async Task FindByNamesAsync_Should_Return_Scopes_If_Found()
{
var scopes = await _scopeStore
.FindByNamesAsync(ImmutableArray.Create("Scope1", "Scope2", "Scope3"), CancellationToken.None)
.ToListAsync();
scopes.Count.ShouldBe(2);
}
[Fact]
public async Task FindByResourceAsync_Should_Return_Empty_If_Not_Found()
{
var scopes = await _scopeStore.FindByResourceAsync("non-existing-resource", CancellationToken.None)
.ToListAsync();
scopes.Count.ShouldBe(0);
}
[Fact]
public async Task FindByResourceAsync_Should_Return_Scopes_If_Found()
{
var scopes = await _scopeStore.FindByResourceAsync("TestScope1Resource", CancellationToken.None).ToListAsync();
scopes.Count.ShouldBe(1);
}
[Fact]
public async Task GetDescriptionAsync()
{
var scope = await _scopeStore.FindByIdAsync(_testData.Scope1Id.ToString(), CancellationToken.None);
var description = await _scopeStore.GetDescriptionAsync(scope, CancellationToken.None);
description.ShouldBe("Test Scope 1");
}
[Fact]
public async Task GetDescriptionsAsync()
{
var scope = await _scopeStore.FindByIdAsync(_testData.Scope1Id.ToString(), CancellationToken.None);
var descriptions = await _scopeStore.GetDescriptionsAsync(scope, CancellationToken.None);
descriptions.Count.ShouldBe(0);
}
[Fact]
public async Task GetDisplayNameAsync()
{
var scope = await _scopeStore.FindByIdAsync(_testData.Scope1Id.ToString(), CancellationToken.None);
var displayName = await _scopeStore.GetDisplayNameAsync(scope, CancellationToken.None);
displayName.ShouldBe("Test Scope 1");
}
[Fact]
public async Task GetDisplayNamesAsync()
{
var scope = await _scopeStore.FindByIdAsync(_testData.Scope1Id.ToString(), CancellationToken.None);
var displayNames = await _scopeStore.GetDisplayNamesAsync(scope, CancellationToken.None);
displayNames.Count.ShouldBe(2);
}
[Fact]
public async Task GetIdAsync()
{
var scope = await _scopeStore.FindByIdAsync(_testData.Scope1Id.ToString(), CancellationToken.None);
var id = await _scopeStore.GetIdAsync(scope, CancellationToken.None);
id.ShouldBe(_testData.Scope1Id.ToString());
}
[Fact]
public async Task GetNameAsync()
{
var scope = await _scopeStore.FindByIdAsync(_testData.Scope1Id.ToString(), CancellationToken.None);
var name = await _scopeStore.GetNameAsync(scope, CancellationToken.None);
name.ShouldBe("Scope1");
}
[Fact]
public async Task GetPropertiesAsync()
{
var scope = await _scopeStore.FindByIdAsync(_testData.Scope1Id.ToString(), CancellationToken.None);
var properties = await _scopeStore.GetPropertiesAsync(scope, CancellationToken.None);
properties.Count.ShouldBe(0);
}
[Fact]
public async Task GetResourcesAsync()
{
var scope = await _scopeStore.FindByIdAsync(_testData.Scope1Id.ToString(), CancellationToken.None);
var resources = await _scopeStore.GetResourcesAsync(scope, CancellationToken.None);
resources.Length.ShouldBe(1);
resources.First().ShouldBe("TestScope1Resource");
}
[Fact]
public async Task InstantiateAsync()
{
var scope = await _scopeStore.InstantiateAsync(CancellationToken.None);
scope.ShouldNotBeNull();
}
[Fact]
public async Task ListAsync_Should_Return_Empty_If_Not_Found()
{
var scopes = await _scopeStore.ListAsync(2, 2, CancellationToken.None).ToListAsync();
scopes.Count.ShouldBe(0);
}
[Fact]
public async Task ListAsync_Should_Return_Applications_If_Found()
{
var scopes = await _scopeStore.ListAsync(2, 0, CancellationToken.None).ToListAsync();
scopes.Count.ShouldBe(2);
}
[Fact]
public async Task SetDescriptionAsync()
{
var scope = await _scopeStore.FindByIdAsync(_testData.Scope1Id.ToString(), CancellationToken.None);
await _scopeStore.SetDescriptionAsync(scope, "New Test Scope 1 Description", CancellationToken.None);
scope.Description.ShouldBe("New Test Scope 1 Description");
}
[Fact]
public async Task SetDescriptionsAsync()
{
var descriptions = ImmutableDictionary.Create<CultureInfo, string>();
descriptions = descriptions.Add(CultureInfo.GetCultureInfo("en"), "Test Scope");
descriptions = descriptions.Add(CultureInfo.GetCultureInfo("zh-Hans"), "");
var scope = await _scopeStore.FindByIdAsync(_testData.Scope1Id.ToString(), CancellationToken.None);
await _scopeStore.SetDescriptionsAsync(scope, descriptions, CancellationToken.None);
scope.Descriptions.ShouldContain("Test Scope");
scope.Descriptions.ShouldContain("");
}
[Fact]
public async Task SetDisplayNameAsync()
{
var scope = await _scopeStore.FindByIdAsync(_testData.Scope1Id.ToString(), CancellationToken.None);
await _scopeStore.SetDisplayNameAsync(scope, "New Test Scope 1 Display Name", CancellationToken.None);
scope.DisplayName.ShouldBe("New Test Scope 1 Display Name");
}
[Fact]
public async Task SetDisplayNamesAsync()
{
var displayNames = ImmutableDictionary.Create<CultureInfo, string>();
displayNames = displayNames.Add(CultureInfo.GetCultureInfo("en"), "Test Scope");
displayNames = displayNames.Add(CultureInfo.GetCultureInfo("zh-Hans"), "");
var scope = await _scopeStore.FindByIdAsync(_testData.Scope1Id.ToString(), CancellationToken.None);
await _scopeStore.SetDisplayNamesAsync(scope, displayNames, CancellationToken.None);
scope.DisplayNames.ShouldContain("Test Scope");
scope.DisplayNames.ShouldContain("");
}
[Fact]
public async Task SetNameAsync()
{
var scope = await _scopeStore.FindByIdAsync(_testData.Scope1Id.ToString(), CancellationToken.None);
await _scopeStore.SetNameAsync(scope, "New Test Scope 1 Name", CancellationToken.None);
scope.Name.ShouldBe("New Test Scope 1 Name");
}
[Fact]
public async Task SetPropertiesAsync()
{
var scope = await _scopeStore.FindByIdAsync(_testData.Scope1Id.ToString(), CancellationToken.None);
await _scopeStore.SetPropertiesAsync(scope, ImmutableDictionary.Create<string, JsonElement>(),
CancellationToken.None);
scope.Properties.ShouldBeNull();
}
[Fact]
public async Task SetResourcesAsync()
{
var scope = await _scopeStore.FindByIdAsync(_testData.Scope1Id.ToString(), CancellationToken.None);
await _scopeStore.SetResourcesAsync(scope, ImmutableArray.Create("TestScope1Resource", "TestScope1Resource2"),
CancellationToken.None);
scope.Resources.ShouldContain("TestScope1Resource");
scope.Resources.ShouldContain("TestScope1Resource2");
}
[Fact]
public async Task UpdateAsync()
{
var scope = await _scopeStore.FindByIdAsync(_testData.Scope1Id.ToString(), CancellationToken.None);
scope.Name = "New Test Scope 1 Name";
scope.DisplayName = "New Test Scope 1 Display Name";
scope.Resources = "New Test Scope 1 Resource";
scope.Properties = "New Test Scope 1 Properties";
scope.Description = "New Test Scope 1 Description";
scope.Descriptions = "New Test Scope 1 Descriptions";
scope.DisplayNames = "New Test Scope 1 Display Names";
await _scopeStore.UpdateAsync(scope, CancellationToken.None);
scope = await _scopeStore.FindByIdAsync(_testData.Scope1Id.ToString(), CancellationToken.None);
scope.Name.ShouldBe("New Test Scope 1 Name");
scope.DisplayName.ShouldBe("New Test Scope 1 Display Name");
scope.Resources.ShouldBe("New Test Scope 1 Resource");
scope.Properties.ShouldBe("New Test Scope 1 Properties");
scope.Description.ShouldBe("New Test Scope 1 Description");
scope.Descriptions.ShouldBe("New Test Scope 1 Descriptions");
scope.DisplayNames.ShouldBe("New Test Scope 1 Display Names");
}
}
```
|
```xml
import path from 'path';
import { safeYarnOrNpm } from '@electron-forge/core-utils';
import { ForgeTemplate } from '@electron-forge/shared-types';
import debug from 'debug';
import { Listr } from 'listr2';
import semver from 'semver';
import installDepList, { DepType, DepVersionRestriction } from '../util/install-dependencies';
import { readRawPackageJson } from '../util/read-package-json';
import { findTemplate } from './init-scripts/find-template';
import { initDirectory } from './init-scripts/init-directory';
import { initGit } from './init-scripts/init-git';
import { initLink } from './init-scripts/init-link';
import { initNPM } from './init-scripts/init-npm';
const d = debug('electron-forge:init');
export interface InitOptions {
/**
* The path to the app to be initialized
*/
dir?: string;
/**
* Whether to use sensible defaults or prompt the user visually
*/
interactive?: boolean;
/**
* Whether to copy template CI files
*/
copyCIFiles?: boolean;
/**
* Whether to overwrite an existing directory
*/
force?: boolean;
/**
* The custom template to use. If left empty, the default template is used
*/
template?: string;
}
async function validateTemplate(template: string, templateModule: ForgeTemplate): Promise<void> {
if (!templateModule.requiredForgeVersion) {
throw new Error(`Cannot use a template (${template}) with this version of Electron Forge, as it does not specify its required Forge version.`);
}
const forgeVersion = (await readRawPackageJson(path.join(__dirname, '..', '..'))).version;
if (!semver.satisfies(forgeVersion, templateModule.requiredForgeVersion)) {
throw new Error(
`Template (${template}) is not compatible with this version of Electron Forge (${forgeVersion}), it requires ${templateModule.requiredForgeVersion}`
);
}
}
export default async ({ dir = process.cwd(), interactive = false, copyCIFiles = false, force = false, template = 'base' }: InitOptions): Promise<void> => {
d(`Initializing in: ${dir}`);
const packageManager = safeYarnOrNpm();
const runner = new Listr<{
templateModule: ForgeTemplate;
}>(
[
{
title: `Locating custom template: "${template}"`,
task: async (ctx) => {
ctx.templateModule = await findTemplate(dir, template);
},
},
{
title: 'Initializing directory',
task: async (_, task) => {
await initDirectory(dir, task, force);
await initGit(dir);
},
rendererOptions: { persistentOutput: true },
},
{
title: 'Preparing template',
task: async ({ templateModule }) => {
await validateTemplate(template, templateModule);
},
},
{
title: 'Initializing template',
task: async ({ templateModule }, task) => {
if (typeof templateModule.initializeTemplate === 'function') {
const tasks = await templateModule.initializeTemplate(dir, { copyCIFiles });
if (tasks) {
return task.newListr(tasks, { concurrent: false });
}
}
},
},
{
title: 'Installing template dependencies',
task: async ({ templateModule }, task) => {
return task.newListr(
[
{
title: 'Installing production dependencies',
task: async (_, task) => {
d('installing dependencies');
if (templateModule.dependencies?.length) {
task.output = `${packageManager} install ${templateModule.dependencies.join(' ')}`;
}
return await installDepList(dir, templateModule.dependencies || [], DepType.PROD, DepVersionRestriction.RANGE);
},
exitOnError: false,
},
{
title: 'Installing development dependencies',
task: async (_, task) => {
d('installing devDependencies');
if (templateModule.devDependencies?.length) {
task.output = `${packageManager} install --dev ${templateModule.devDependencies.join(' ')}`;
}
await installDepList(dir, templateModule.devDependencies || [], DepType.DEV);
},
exitOnError: false,
},
{
title: 'Finalizing dependencies',
task: async (_, task) => {
return task.newListr([
{
title: 'Installing common dependencies',
task: async (_, task) => {
await initNPM(dir, task);
},
exitOnError: false,
},
{
title: process.env.LINK_FORGE_DEPENDENCIES_ON_INIT ? 'Linking forge dependencies' : 'Skip linking forge dependencies',
task: async (_, task) => {
await initLink(dir, task);
},
exitOnError: true,
},
]);
},
},
],
{
concurrent: false,
}
);
},
},
],
{
concurrent: false,
silentRendererCondition: !interactive,
fallbackRendererCondition: Boolean(process.env.DEBUG) || Boolean(process.env.CI),
}
);
await runner.run();
};
```
|
```c++
// bindgen-flags: -- -std=c++14
template <typename T, typename U, typename V>
class DoesNotUseU {
T t;
V v;
};
// The bool should go away because U is not used.
using Alias = DoesNotUseU<int, bool, char>;
```
|
```java
package com.pantheon.server.node;
public class ControllerNode {
private Integer nodeId;
private ControllerNode() {
}
static class Singleton {
static ControllerNode instance = new ControllerNode();
}
public static ControllerNode getInstance() {
return Singleton.instance;
}
public Integer getNodeId() {
return nodeId;
}
public static void setNodeId(Integer nodeId) {
getInstance().nodeId = nodeId;
}
public static Boolean isControllerNode(Integer nodeId) {
return getInstance().nodeId.equals(nodeId);
}
}
```
|
Scythris corleyi is a moth of the family Scythrididae. It was described by Bengt Å. Bengtsson in 1997. It is found in Spain (Andalusia) and Portugal.
Etymology
The species is named in honour of the collector of most of the type series, Mr. Martin Corley.
References
corleyi
Moths described in 1997
|
The Metcalfe County Jail, in Edmonton, Kentucky, is a historic jail which was built around 1861. It was used to hold prisoners until the early 1980s. It was listed on the National Register of Historic Places in 2004.
It is an early Romanesque Revival-style building constructed of limestone blocks by stonemason John Wilson. It is in plan.
It is located on a corner of East street about northeast of the Metcalfe County Courthouse.
References
Jails on the National Register of Historic Places in Kentucky
Romanesque Revival architecture in Kentucky
Government buildings completed in 1861
National Register of Historic Places in Metcalfe County, Kentucky
1861 establishments in Kentucky
County government buildings in Kentucky
Limestone buildings in the United States
Edmonton, Kentucky
|
```ruby
# typed: strong
# frozen_string_literal: true
module Utils
module Timer
sig { params(time: T.nilable(Time)).returns(T.any(Float, Integer, NilClass)) }
def self.remaining(time)
return unless time
[0, time - Time.now].max
end
sig { params(time: T.nilable(Time)).returns(T.any(Float, Integer, NilClass)) }
def self.remaining!(time)
r = remaining(time)
raise Timeout::Error if r && r <= 0
r
end
end
end
```
|
```c
/* $OpenBSD: ofw_misc.c,v 1.43 2023/05/17 23:25:45 patrick Exp $ */
/*
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <sys/types.h>
#include <sys/device.h>
#include <sys/malloc.h>
#include <sys/systm.h>
#include <net/if.h>
#include <net/if_media.h>
#include <machine/bus.h>
#include <dev/mii/mii.h>
#include <dev/mii/miivar.h>
#include <dev/ofw/openfirm.h>
#include <dev/ofw/ofw_gpio.h>
#include <dev/ofw/ofw_misc.h>
#include <dev/ofw/ofw_regulator.h>
/*
* Register maps.
*/
struct regmap {
int rm_node;
uint32_t rm_phandle;
bus_space_tag_t rm_tag;
bus_space_handle_t rm_handle;
bus_size_t rm_size;
LIST_ENTRY(regmap) rm_list;
};
LIST_HEAD(, regmap) regmaps = LIST_HEAD_INITIALIZER(regmap);
void
regmap_register(int node, bus_space_tag_t tag, bus_space_handle_t handle,
bus_size_t size)
{
struct regmap *rm;
rm = malloc(sizeof(struct regmap), M_DEVBUF, M_WAITOK);
rm->rm_node = node;
rm->rm_phandle = OF_getpropint(node, "phandle", 0);
rm->rm_tag = tag;
rm->rm_handle = handle;
rm->rm_size = size;
LIST_INSERT_HEAD(®maps, rm, rm_list);
}
struct regmap *
regmap_bycompatible(char *compatible)
{
struct regmap *rm;
LIST_FOREACH(rm, ®maps, rm_list) {
if (OF_is_compatible(rm->rm_node, compatible))
return rm;
}
return NULL;
}
struct regmap *
regmap_bynode(int node)
{
struct regmap *rm;
LIST_FOREACH(rm, ®maps, rm_list) {
if (rm->rm_node == node)
return rm;
}
return NULL;
}
struct regmap *
regmap_byphandle(uint32_t phandle)
{
struct regmap *rm;
if (phandle == 0)
return NULL;
LIST_FOREACH(rm, ®maps, rm_list) {
if (rm->rm_phandle == phandle)
return rm;
}
return NULL;
}
void
regmap_write_4(struct regmap *rm, bus_size_t offset, uint32_t value)
{
KASSERT(offset <= rm->rm_size - sizeof(uint32_t));
bus_space_write_4(rm->rm_tag, rm->rm_handle, offset, value);
}
uint32_t
regmap_read_4(struct regmap *rm, bus_size_t offset)
{
KASSERT(offset <= rm->rm_size - sizeof(uint32_t));
return bus_space_read_4(rm->rm_tag, rm->rm_handle, offset);
}
/*
* Network interface support.
*/
LIST_HEAD(, if_device) if_devices =
LIST_HEAD_INITIALIZER(if_devices);
void
if_register(struct if_device *ifd)
{
ifd->if_phandle = OF_getpropint(ifd->if_node, "phandle", 0);
LIST_INSERT_HEAD(&if_devices, ifd, if_list);
}
struct ifnet *
if_bynode(int node)
{
struct if_device *ifd;
LIST_FOREACH(ifd, &if_devices, if_list) {
if (ifd->if_node == node)
return (ifd->if_ifp);
}
return (NULL);
}
struct ifnet *
if_byphandle(uint32_t phandle)
{
struct if_device *ifd;
if (phandle == 0)
return (NULL);
LIST_FOREACH(ifd, &if_devices, if_list) {
if (ifd->if_phandle == phandle)
return (ifd->if_ifp);
}
return (NULL);
}
/*
* PHY support.
*/
LIST_HEAD(, phy_device) phy_devices =
LIST_HEAD_INITIALIZER(phy_devices);
void
phy_register(struct phy_device *pd)
{
pd->pd_cells = OF_getpropint(pd->pd_node, "#phy-cells", 0);
pd->pd_phandle = OF_getpropint(pd->pd_node, "phandle", 0);
if (pd->pd_phandle == 0)
return;
LIST_INSERT_HEAD(&phy_devices, pd, pd_list);
}
int
phy_usb_nop_enable(int node)
{
uint32_t vcc_supply;
uint32_t *gpio;
int len;
vcc_supply = OF_getpropint(node, "vcc-supply", 0);
if (vcc_supply)
regulator_enable(vcc_supply);
len = OF_getproplen(node, "reset-gpios");
if (len <= 0)
return 0;
/* There should only be a single GPIO pin. */
gpio = malloc(len, M_TEMP, M_WAITOK);
OF_getpropintarray(node, "reset-gpios", gpio, len);
gpio_controller_config_pin(gpio, GPIO_CONFIG_OUTPUT);
gpio_controller_set_pin(gpio, 1);
delay(10000);
gpio_controller_set_pin(gpio, 0);
free(gpio, M_TEMP, len);
return 0;
}
int
phy_enable_cells(uint32_t *cells)
{
struct phy_device *pd;
uint32_t phandle = cells[0];
int node;
LIST_FOREACH(pd, &phy_devices, pd_list) {
if (pd->pd_phandle == phandle)
break;
}
if (pd && pd->pd_enable)
return pd->pd_enable(pd->pd_cookie, &cells[1]);
node = OF_getnodebyphandle(phandle);
if (node == 0)
return ENXIO;
if (OF_is_compatible(node, "usb-nop-xceiv"))
return phy_usb_nop_enable(node);
return ENXIO;
}
uint32_t *
phy_next_phy(uint32_t *cells)
{
uint32_t phandle = cells[0];
int node, ncells;
node = OF_getnodebyphandle(phandle);
if (node == 0)
return NULL;
ncells = OF_getpropint(node, "#phy-cells", 0);
return cells + ncells + 1;
}
int
phy_enable_prop_idx(int node, char *prop, int idx)
{
uint32_t *phys;
uint32_t *phy;
int rv = -1;
int len;
len = OF_getproplen(node, prop);
if (len <= 0)
return -1;
phys = malloc(len, M_TEMP, M_WAITOK);
OF_getpropintarray(node, prop, phys, len);
phy = phys;
while (phy && phy < phys + (len / sizeof(uint32_t))) {
if (idx <= 0)
rv = phy_enable_cells(phy);
if (idx == 0)
break;
phy = phy_next_phy(phy);
idx--;
}
free(phys, M_TEMP, len);
return rv;
}
int
phy_enable_idx(int node, int idx)
{
return (phy_enable_prop_idx(node, "phys", idx));
}
int
phy_enable(int node, const char *name)
{
int idx;
idx = OF_getindex(node, name, "phy-names");
if (idx == -1)
return -1;
return phy_enable_idx(node, idx);
}
/*
* I2C support.
*/
LIST_HEAD(, i2c_bus) i2c_busses =
LIST_HEAD_INITIALIZER(i2c_bus);
void
i2c_register(struct i2c_bus *ib)
{
ib->ib_phandle = OF_getpropint(ib->ib_node, "phandle", 0);
if (ib->ib_phandle == 0)
return;
LIST_INSERT_HEAD(&i2c_busses, ib, ib_list);
}
struct i2c_controller *
i2c_bynode(int node)
{
struct i2c_bus *ib;
LIST_FOREACH(ib, &i2c_busses, ib_list) {
if (ib->ib_node == node)
return ib->ib_ic;
}
return NULL;
}
struct i2c_controller *
i2c_byphandle(uint32_t phandle)
{
struct i2c_bus *ib;
if (phandle == 0)
return NULL;
LIST_FOREACH(ib, &i2c_busses, ib_list) {
if (ib->ib_phandle == phandle)
return ib->ib_ic;
}
return NULL;
}
/*
* SFP support.
*/
LIST_HEAD(, sfp_device) sfp_devices =
LIST_HEAD_INITIALIZER(sfp_devices);
void
sfp_register(struct sfp_device *sd)
{
sd->sd_phandle = OF_getpropint(sd->sd_node, "phandle", 0);
if (sd->sd_phandle == 0)
return;
LIST_INSERT_HEAD(&sfp_devices, sd, sd_list);
}
int
sfp_do_enable(uint32_t phandle, int enable)
{
struct sfp_device *sd;
if (phandle == 0)
return ENXIO;
LIST_FOREACH(sd, &sfp_devices, sd_list) {
if (sd->sd_phandle == phandle)
return sd->sd_enable(sd->sd_cookie, enable);
}
return ENXIO;
}
int
sfp_enable(uint32_t phandle)
{
return sfp_do_enable(phandle, 1);
}
int
sfp_disable(uint32_t phandle)
{
return sfp_do_enable(phandle, 0);
}
int
sfp_get_sffpage(uint32_t phandle, struct if_sffpage *sff)
{
struct sfp_device *sd;
if (phandle == 0)
return ENXIO;
LIST_FOREACH(sd, &sfp_devices, sd_list) {
if (sd->sd_phandle == phandle)
return sd->sd_get_sffpage(sd->sd_cookie, sff);
}
return ENXIO;
}
#define SFF8472_TCC_XCC 3 /* 10G Ethernet Compliance Codes */
#define SFF8472_TCC_XCC_10G_SR (1 << 4)
#define SFF8472_TCC_XCC_10G_LR (1 << 5)
#define SFF8472_TCC_XCC_10G_LRM (1 << 6)
#define SFF8472_TCC_XCC_10G_ER (1 << 7)
#define SFF8472_TCC_ECC 6 /* Ethernet Compliance Codes */
#define SFF8472_TCC_ECC_1000_SX (1 << 0)
#define SFF8472_TCC_ECC_1000_LX (1 << 1)
#define SFF8472_TCC_ECC_1000_CX (1 << 2)
#define SFF8472_TCC_ECC_1000_T (1 << 3)
#define SFF8472_TCC_SCT 8 /* SFP+ Cable Technology */
#define SFF8472_TCC_SCT_PASSIVE (1 << 2)
#define SFF8472_TCC_SCT_ACTIVE (1 << 3)
int
sfp_add_media(uint32_t phandle, struct mii_data *mii)
{
struct if_sffpage sff;
int error;
memset(&sff, 0, sizeof(sff));
sff.sff_addr = IFSFF_ADDR_EEPROM;
sff.sff_page = 0;
error = sfp_get_sffpage(phandle, &sff);
if (error)
return error;
/* SFP */
if (sff.sff_data[SFF8472_TCC_ECC] & SFF8472_TCC_ECC_1000_SX) {
ifmedia_add(&mii->mii_media, IFM_ETHER | IFM_1000_SX, 0, NULL);
mii->mii_media_active = IFM_ETHER | IFM_1000_SX | IFM_FDX;
}
if (sff.sff_data[SFF8472_TCC_ECC] & SFF8472_TCC_ECC_1000_LX) {
ifmedia_add(&mii->mii_media, IFM_ETHER | IFM_1000_LX, 0, NULL);
mii->mii_media_active = IFM_ETHER | IFM_1000_LX | IFM_FDX;
}
if (sff.sff_data[SFF8472_TCC_ECC] & SFF8472_TCC_ECC_1000_CX) {
ifmedia_add(&mii->mii_media, IFM_ETHER | IFM_1000_CX, 0, NULL);
mii->mii_media_active = IFM_ETHER | IFM_1000_CX | IFM_FDX;
}
if (sff.sff_data[SFF8472_TCC_ECC] & SFF8472_TCC_ECC_1000_T) {
ifmedia_add(&mii->mii_media, IFM_ETHER | IFM_1000_T, 0, NULL);
mii->mii_media_active = IFM_ETHER | IFM_1000_T | IFM_FDX;
}
/* SFP+ */
if (sff.sff_data[SFF8472_TCC_XCC] & SFF8472_TCC_XCC_10G_SR) {
ifmedia_add(&mii->mii_media, IFM_ETHER | IFM_10G_SR, 0, NULL);
mii->mii_media_active = IFM_ETHER | IFM_10G_SR | IFM_FDX;
}
if (sff.sff_data[SFF8472_TCC_XCC] & SFF8472_TCC_XCC_10G_LR) {
ifmedia_add(&mii->mii_media, IFM_ETHER | IFM_10G_LR, 0, NULL);
mii->mii_media_active = IFM_ETHER | IFM_10G_LR | IFM_FDX;
}
if (sff.sff_data[SFF8472_TCC_XCC] & SFF8472_TCC_XCC_10G_LRM) {
ifmedia_add(&mii->mii_media, IFM_ETHER | IFM_10G_LRM, 0, NULL);
mii->mii_media_active = IFM_ETHER | IFM_10G_LRM | IFM_FDX;
}
if (sff.sff_data[SFF8472_TCC_XCC] & SFF8472_TCC_XCC_10G_ER) {
ifmedia_add(&mii->mii_media, IFM_ETHER | IFM_10G_ER, 0, NULL);
mii->mii_media_active = IFM_ETHER | IFM_10G_ER | IFM_FDX;
}
/* SFP+ DAC */
if (sff.sff_data[SFF8472_TCC_SCT] & SFF8472_TCC_SCT_PASSIVE ||
sff.sff_data[SFF8472_TCC_SCT] & SFF8472_TCC_SCT_ACTIVE) {
ifmedia_add(&mii->mii_media,
IFM_ETHER | IFM_10G_SFP_CU, 0, NULL);
mii->mii_media_active = IFM_ETHER | IFM_10G_SFP_CU | IFM_FDX;
}
return 0;
}
/*
* PWM support.
*/
LIST_HEAD(, pwm_device) pwm_devices =
LIST_HEAD_INITIALIZER(pwm_devices);
void
pwm_register(struct pwm_device *pd)
{
pd->pd_cells = OF_getpropint(pd->pd_node, "#pwm-cells", 0);
pd->pd_phandle = OF_getpropint(pd->pd_node, "phandle", 0);
if (pd->pd_phandle == 0)
return;
LIST_INSERT_HEAD(&pwm_devices, pd, pd_list);
}
int
pwm_init_state(uint32_t *cells, struct pwm_state *ps)
{
struct pwm_device *pd;
LIST_FOREACH(pd, &pwm_devices, pd_list) {
if (pd->pd_phandle == cells[0]) {
memset(ps, 0, sizeof(struct pwm_state));
pd->pd_get_state(pd->pd_cookie, &cells[1], ps);
ps->ps_pulse_width = 0;
if (pd->pd_cells >= 2)
ps->ps_period = cells[2];
if (pd->pd_cells >= 3)
ps->ps_flags = cells[3];
return 0;
}
}
return ENXIO;
}
int
pwm_get_state(uint32_t *cells, struct pwm_state *ps)
{
struct pwm_device *pd;
LIST_FOREACH(pd, &pwm_devices, pd_list) {
if (pd->pd_phandle == cells[0])
return pd->pd_get_state(pd->pd_cookie, &cells[1], ps);
}
return ENXIO;
}
int
pwm_set_state(uint32_t *cells, struct pwm_state *ps)
{
struct pwm_device *pd;
LIST_FOREACH(pd, &pwm_devices, pd_list) {
if (pd->pd_phandle == cells[0])
return pd->pd_set_state(pd->pd_cookie, &cells[1], ps);
}
return ENXIO;
}
/*
* Non-volatile memory support.
*/
LIST_HEAD(, nvmem_device) nvmem_devices =
LIST_HEAD_INITIALIZER(nvmem_devices);
struct nvmem_cell {
uint32_t nc_phandle;
struct nvmem_device *nc_nd;
bus_addr_t nc_addr;
bus_size_t nc_size;
uint32_t nc_offset;
uint32_t nc_bitlen;
LIST_ENTRY(nvmem_cell) nc_list;
};
LIST_HEAD(, nvmem_cell) nvmem_cells =
LIST_HEAD_INITIALIZER(nvmem_cells);
void
nvmem_register_child(int node, struct nvmem_device *nd)
{
struct nvmem_cell *nc;
uint32_t phandle;
uint32_t reg[2], bits[2] = {};
phandle = OF_getpropint(node, "phandle", 0);
if (phandle == 0)
return;
if (OF_getpropintarray(node, "reg", reg, sizeof(reg)) != sizeof(reg))
return;
OF_getpropintarray(node, "bits", bits, sizeof(bits));
nc = malloc(sizeof(struct nvmem_cell), M_DEVBUF, M_WAITOK);
nc->nc_phandle = phandle;
nc->nc_nd = nd;
nc->nc_addr = reg[0];
nc->nc_size = reg[1];
nc->nc_offset = bits[0];
nc->nc_bitlen = bits[1];
LIST_INSERT_HEAD(&nvmem_cells, nc, nc_list);
}
void
nvmem_register(struct nvmem_device *nd)
{
int node;
nd->nd_phandle = OF_getpropint(nd->nd_node, "phandle", 0);
if (nd->nd_phandle)
LIST_INSERT_HEAD(&nvmem_devices, nd, nd_list);
for (node = OF_child(nd->nd_node); node; node = OF_peer(node))
nvmem_register_child(node, nd);
}
int
nvmem_read(uint32_t phandle, bus_addr_t addr, void *data, bus_size_t size)
{
struct nvmem_device *nd;
if (phandle == 0)
return ENXIO;
LIST_FOREACH(nd, &nvmem_devices, nd_list) {
if (nd->nd_phandle == phandle)
return nd->nd_read(nd->nd_cookie, addr, data, size);
}
return ENXIO;
}
int
nvmem_read_cell(int node, const char *name, void *data, bus_size_t size)
{
struct nvmem_device *nd;
struct nvmem_cell *nc;
uint8_t *p = data;
bus_addr_t addr;
uint32_t phandle, *phandles;
uint32_t offset, bitlen;
int id, len, first;
id = OF_getindex(node, name, "nvmem-cell-names");
if (id < 0)
return ENXIO;
len = OF_getproplen(node, "nvmem-cells");
if (len <= 0)
return ENXIO;
phandles = malloc(len, M_TEMP, M_WAITOK);
OF_getpropintarray(node, "nvmem-cells", phandles, len);
phandle = phandles[id];
free(phandles, M_TEMP, len);
LIST_FOREACH(nc, &nvmem_cells, nc_list) {
if (nc->nc_phandle == phandle)
break;
}
if (nc == NULL)
return ENXIO;
nd = nc->nc_nd;
if (nd->nd_read == NULL)
return EACCES;
first = 1;
addr = nc->nc_addr + (nc->nc_offset / 8);
offset = nc->nc_offset % 8;
bitlen = nc->nc_bitlen;
while (bitlen > 0 && size > 0) {
uint8_t mask, tmp;
int error;
error = nd->nd_read(nd->nd_cookie, addr++, &tmp, 1);
if (error)
return error;
if (bitlen >= 8)
mask = 0xff;
else
mask = (1 << bitlen) - 1;
if (!first) {
*p++ |= (tmp << (8 - offset)) & (mask << (8 - offset));
bitlen -= MIN(offset, bitlen);
mask >>= offset;
size--;
}
if (bitlen > 0 && size > 0) {
*p = (tmp >> offset) & mask;
bitlen -= MIN(8 - offset, bitlen);
}
first = 0;
}
if (nc->nc_bitlen > 0)
return 0;
if (size > nc->nc_size)
return EINVAL;
return nd->nd_read(nd->nd_cookie, nc->nc_addr, data, size);
}
int
nvmem_write_cell(int node, const char *name, const void *data, bus_size_t size)
{
struct nvmem_device *nd;
struct nvmem_cell *nc;
const uint8_t *p = data;
bus_addr_t addr;
uint32_t phandle, *phandles;
uint32_t offset, bitlen;
int id, len, first;
id = OF_getindex(node, name, "nvmem-cell-names");
if (id < 0)
return ENXIO;
len = OF_getproplen(node, "nvmem-cells");
if (len <= 0)
return ENXIO;
phandles = malloc(len, M_TEMP, M_WAITOK);
OF_getpropintarray(node, "nvmem-cells", phandles, len);
phandle = phandles[id];
free(phandles, M_TEMP, len);
LIST_FOREACH(nc, &nvmem_cells, nc_list) {
if (nc->nc_phandle == phandle)
break;
}
if (nc == NULL)
return ENXIO;
nd = nc->nc_nd;
if (nd->nd_write == NULL)
return EACCES;
first = 1;
addr = nc->nc_addr + (nc->nc_offset / 8);
offset = nc->nc_offset % 8;
bitlen = nc->nc_bitlen;
while (bitlen > 0 && size > 0) {
uint8_t mask, tmp;
int error;
error = nd->nd_read(nd->nd_cookie, addr, &tmp, 1);
if (error)
return error;
if (bitlen >= 8)
mask = 0xff;
else
mask = (1 << bitlen) - 1;
tmp &= ~(mask << offset);
tmp |= (*p++ << offset) & (mask << offset);
bitlen -= MIN(8 - offset, bitlen);
size--;
if (!first && bitlen > 0 && size > 0) {
tmp &= ~(mask >> (8 - offset));
tmp |= (*p >> (8 - offset)) & (mask >> (8 - offset));
bitlen -= MIN(offset, bitlen);
}
error = nd->nd_write(nd->nd_cookie, addr++, &tmp, 1);
if (error)
return error;
first = 0;
}
if (nc->nc_bitlen > 0)
return 0;
if (size > nc->nc_size)
return EINVAL;
return nd->nd_write(nd->nd_cookie, nc->nc_addr, data, size);
}
/* Port/endpoint interface support */
LIST_HEAD(, endpoint) endpoints =
LIST_HEAD_INITIALIZER(endpoints);
void
endpoint_register(int node, struct device_port *dp, enum endpoint_type type)
{
struct endpoint *ep;
ep = malloc(sizeof(*ep), M_DEVBUF, M_WAITOK);
ep->ep_node = node;
ep->ep_phandle = OF_getpropint(node, "phandle", 0);
ep->ep_reg = OF_getpropint(node, "reg", -1);
ep->ep_port = dp;
ep->ep_type = type;
LIST_INSERT_HEAD(&endpoints, ep, ep_list);
LIST_INSERT_HEAD(&dp->dp_endpoints, ep, ep_plist);
}
void
device_port_register(int node, struct device_ports *ports,
enum endpoint_type type)
{
struct device_port *dp;
dp = malloc(sizeof(*dp), M_DEVBUF, M_WAITOK);
dp->dp_node = node;
dp->dp_phandle = OF_getpropint(node, "phandle", 0);
dp->dp_reg = OF_getpropint(node, "reg", -1);
dp->dp_ports = ports;
LIST_INIT(&dp->dp_endpoints);
for (node = OF_child(node); node; node = OF_peer(node))
endpoint_register(node, dp, type);
LIST_INSERT_HEAD(&ports->dp_ports, dp, dp_list);
}
void
device_ports_register(struct device_ports *ports,
enum endpoint_type type)
{
int node;
LIST_INIT(&ports->dp_ports);
node = OF_getnodebyname(ports->dp_node, "ports");
if (node == 0) {
node = OF_getnodebyname(ports->dp_node, "port");
if (node == 0)
return;
device_port_register(node, ports, type);
return;
}
for (node = OF_child(node); node; node = OF_peer(node))
device_port_register(node, ports, type);
}
struct device_ports *
device_ports_byphandle(uint32_t phandle)
{
struct endpoint *ep;
if (phandle == 0)
return NULL;
LIST_FOREACH(ep, &endpoints, ep_list) {
if (ep->ep_port->dp_phandle == phandle)
return ep->ep_port->dp_ports;
}
return NULL;
}
struct endpoint *
endpoint_byphandle(uint32_t phandle)
{
struct endpoint *ep;
if (phandle == 0)
return NULL;
LIST_FOREACH(ep, &endpoints, ep_list) {
if (ep->ep_phandle == phandle)
return ep;
}
return NULL;
}
struct endpoint *
endpoint_byreg(struct device_ports *ports, uint32_t dp_reg, uint32_t ep_reg)
{
struct device_port *dp;
struct endpoint *ep;
LIST_FOREACH(dp, &ports->dp_ports, dp_list) {
if (dp->dp_reg != dp_reg)
continue;
LIST_FOREACH(ep, &dp->dp_endpoints, ep_list) {
if (ep->ep_reg != ep_reg)
continue;
return ep;
}
}
return NULL;
}
struct endpoint *
endpoint_remote(struct endpoint *ep)
{
struct endpoint *rep;
int phandle;
phandle = OF_getpropint(ep->ep_node, "remote-endpoint", 0);
if (phandle == 0)
return NULL;
LIST_FOREACH(rep, &endpoints, ep_list) {
if (rep->ep_phandle == phandle)
return rep;
}
return NULL;
}
int
endpoint_activate(struct endpoint *ep, void *arg)
{
struct device_ports *ports = ep->ep_port->dp_ports;
return ports->dp_ep_activate(ports->dp_cookie, ep, arg);
}
void *
endpoint_get_cookie(struct endpoint *ep)
{
struct device_ports *ports = ep->ep_port->dp_ports;
return ports->dp_ep_get_cookie(ports->dp_cookie, ep);
}
int
device_port_activate(uint32_t phandle, void *arg)
{
struct device_port *dp = NULL;
struct endpoint *ep, *rep;
int count;
int error;
if (phandle == 0)
return ENXIO;
LIST_FOREACH(ep, &endpoints, ep_list) {
if (ep->ep_port->dp_phandle == phandle) {
dp = ep->ep_port;
break;
}
}
if (dp == NULL)
return ENXIO;
count = 0;
LIST_FOREACH(ep, &dp->dp_endpoints, ep_plist) {
rep = endpoint_remote(ep);
if (rep == NULL)
continue;
error = endpoint_activate(ep, arg);
if (error)
continue;
error = endpoint_activate(rep, arg);
if (error)
continue;
count++;
}
return count ? 0 : ENXIO;
}
/* Digital audio interface support */
LIST_HEAD(, dai_device) dai_devices =
LIST_HEAD_INITIALIZER(dai_devices);
void *
dai_ep_get_cookie(void *cookie, struct endpoint *ep)
{
return cookie;
}
void
dai_register(struct dai_device *dd)
{
dd->dd_phandle = OF_getpropint(dd->dd_node, "phandle", 0);
if (dd->dd_phandle != 0)
LIST_INSERT_HEAD(&dai_devices, dd, dd_list);
dd->dd_ports.dp_node = dd->dd_node;
dd->dd_ports.dp_cookie = dd;
dd->dd_ports.dp_ep_get_cookie = dai_ep_get_cookie;
device_ports_register(&dd->dd_ports, EP_DAI_DEVICE);
}
struct dai_device *
dai_byphandle(uint32_t phandle)
{
struct dai_device *dd;
if (phandle == 0)
return NULL;
LIST_FOREACH(dd, &dai_devices, dd_list) {
if (dd->dd_phandle == phandle)
return dd;
}
return NULL;
}
/* MII support */
LIST_HEAD(, mii_bus) mii_busses =
LIST_HEAD_INITIALIZER(mii_busses);
void
mii_register(struct mii_bus *md)
{
LIST_INSERT_HEAD(&mii_busses, md, md_list);
}
struct mii_bus *
mii_bynode(int node)
{
struct mii_bus *md;
LIST_FOREACH(md, &mii_busses, md_list) {
if (md->md_node == node)
return md;
}
return NULL;
}
struct mii_bus *
mii_byphandle(uint32_t phandle)
{
int node;
if (phandle == 0)
return NULL;
node = OF_getnodebyphandle(phandle);
if (node == 0)
return NULL;
node = OF_parent(node);
if (node == 0)
return NULL;
return mii_bynode(node);
}
/* IOMMU support */
LIST_HEAD(, iommu_device) iommu_devices =
LIST_HEAD_INITIALIZER(iommu_devices);
void
iommu_device_register(struct iommu_device *id)
{
id->id_phandle = OF_getpropint(id->id_node, "phandle", 0);
if (id->id_phandle == 0)
return;
LIST_INSERT_HEAD(&iommu_devices, id, id_list);
}
bus_dma_tag_t
iommu_device_do_map(uint32_t phandle, uint32_t *cells, bus_dma_tag_t dmat)
{
struct iommu_device *id;
if (phandle == 0)
return dmat;
LIST_FOREACH(id, &iommu_devices, id_list) {
if (id->id_phandle == phandle)
return id->id_map(id->id_cookie, cells, dmat);
}
return dmat;
}
int
iommu_device_lookup(int node, uint32_t *phandle, uint32_t *cells)
{
uint32_t *cell;
uint32_t *map;
int len, icells, ncells;
int ret = 1;
int i;
len = OF_getproplen(node, "iommus");
if (len <= 0)
return ret;
map = malloc(len, M_TEMP, M_WAITOK);
OF_getpropintarray(node, "iommus", map, len);
cell = map;
ncells = len / sizeof(uint32_t);
while (ncells > 1) {
node = OF_getnodebyphandle(cell[0]);
if (node == 0)
goto out;
icells = OF_getpropint(node, "#iommu-cells", 1);
if (ncells < icells + 1)
goto out;
KASSERT(icells <= 2);
*phandle = cell[0];
for (i = 0; i < icells; i++)
cells[i] = cell[1 + i];
ret = 0;
break;
cell += (1 + icells);
ncells -= (1 + icells);
}
out:
free(map, M_TEMP, len);
return ret;
}
int
iommu_device_lookup_pci(int node, uint32_t rid, uint32_t *phandle,
uint32_t *cells)
{
uint32_t sid_base;
uint32_t *cell;
uint32_t *map;
uint32_t mask, rid_base;
int len, length, icells, ncells;
int ret = 1;
len = OF_getproplen(node, "iommu-map");
if (len <= 0)
return ret;
map = malloc(len, M_TEMP, M_WAITOK);
OF_getpropintarray(node, "iommu-map", map, len);
mask = OF_getpropint(node, "iommu-map-mask", 0xffff);
rid = rid & mask;
cell = map;
ncells = len / sizeof(uint32_t);
while (ncells > 1) {
node = OF_getnodebyphandle(cell[1]);
if (node == 0)
goto out;
icells = OF_getpropint(node, "#iommu-cells", 1);
if (ncells < icells + 3)
goto out;
KASSERT(icells == 1);
rid_base = cell[0];
sid_base = cell[2];
length = cell[3];
if (rid >= rid_base && rid < rid_base + length) {
cells[0] = sid_base + (rid - rid_base);
*phandle = cell[1];
ret = 0;
break;
}
cell += 4;
ncells -= 4;
}
out:
free(map, M_TEMP, len);
return ret;
}
bus_dma_tag_t
iommu_device_map(int node, bus_dma_tag_t dmat)
{
uint32_t phandle, cells[2] = {0};
if (iommu_device_lookup(node, &phandle, &cells[0]))
return dmat;
return iommu_device_do_map(phandle, &cells[0], dmat);
}
bus_dma_tag_t
iommu_device_map_pci(int node, uint32_t rid, bus_dma_tag_t dmat)
{
uint32_t phandle, cells[2] = {0};
if (iommu_device_lookup_pci(node, rid, &phandle, &cells[0]))
return dmat;
return iommu_device_do_map(phandle, &cells[0], dmat);
}
void
iommu_device_do_reserve(uint32_t phandle, uint32_t *cells, bus_addr_t addr,
bus_size_t size)
{
struct iommu_device *id;
if (phandle == 0)
return;
LIST_FOREACH(id, &iommu_devices, id_list) {
if (id->id_phandle == phandle) {
id->id_reserve(id->id_cookie, cells, addr, size);
break;
}
}
}
void
iommu_reserve_region_pci(int node, uint32_t rid, bus_addr_t addr,
bus_size_t size)
{
uint32_t phandle, cells[2] = {0};
if (iommu_device_lookup_pci(node, rid, &phandle, &cells[0]))
return;
return iommu_device_do_reserve(phandle, &cells[0], addr, size);
}
/*
* Mailbox support.
*/
struct mbox_channel {
struct mbox_device *mc_md;
void *mc_cookie;
};
LIST_HEAD(, mbox_device) mbox_devices =
LIST_HEAD_INITIALIZER(mbox_devices);
void
mbox_register(struct mbox_device *md)
{
md->md_cells = OF_getpropint(md->md_node, "#mbox-cells", 0);
md->md_phandle = OF_getpropint(md->md_node, "phandle", 0);
if (md->md_phandle == 0)
return;
LIST_INSERT_HEAD(&mbox_devices, md, md_list);
}
struct mbox_channel *
mbox_channel_cells(uint32_t *cells, struct mbox_client *client)
{
struct mbox_device *md;
struct mbox_channel *mc;
uint32_t phandle = cells[0];
void *cookie;
LIST_FOREACH(md, &mbox_devices, md_list) {
if (md->md_phandle == phandle)
break;
}
if (md && md->md_channel) {
cookie = md->md_channel(md->md_cookie, &cells[1], client);
if (cookie) {
mc = malloc(sizeof(*mc), M_DEVBUF, M_WAITOK);
mc->mc_md = md;
mc->mc_cookie = cookie;
return mc;
}
}
return NULL;
}
uint32_t *
mbox_next_mbox(uint32_t *cells)
{
uint32_t phandle = cells[0];
int node, ncells;
node = OF_getnodebyphandle(phandle);
if (node == 0)
return NULL;
ncells = OF_getpropint(node, "#mbox-cells", 0);
return cells + ncells + 1;
}
struct mbox_channel *
mbox_channel_idx(int node, int idx, struct mbox_client *client)
{
struct mbox_channel *mc = NULL;
uint32_t *mboxes;
uint32_t *mbox;
int len;
len = OF_getproplen(node, "mboxes");
if (len <= 0)
return NULL;
mboxes = malloc(len, M_TEMP, M_WAITOK);
OF_getpropintarray(node, "mboxes", mboxes, len);
mbox = mboxes;
while (mbox && mbox < mboxes + (len / sizeof(uint32_t))) {
if (idx == 0) {
mc = mbox_channel_cells(mbox, client);
break;
}
mbox = mbox_next_mbox(mbox);
idx--;
}
free(mboxes, M_TEMP, len);
return mc;
}
struct mbox_channel *
mbox_channel(int node, const char *name, struct mbox_client *client)
{
int idx;
idx = OF_getindex(node, name, "mbox-names");
if (idx == -1)
return NULL;
return mbox_channel_idx(node, idx, client);
}
int
mbox_send(struct mbox_channel *mc, const void *data, size_t len)
{
struct mbox_device *md = mc->mc_md;
if (md->md_send)
return md->md_send(mc->mc_cookie, data, len);
return ENXIO;
}
int
mbox_recv(struct mbox_channel *mc, void *data, size_t len)
{
struct mbox_device *md = mc->mc_md;
if (md->md_recv)
return md->md_recv(mc->mc_cookie, data, len);
return ENXIO;
}
/* hwlock support */
LIST_HEAD(, hwlock_device) hwlock_devices =
LIST_HEAD_INITIALIZER(hwlock_devices);
void
hwlock_register(struct hwlock_device *hd)
{
hd->hd_cells = OF_getpropint(hd->hd_node, "#hwlock-cells", 0);
hd->hd_phandle = OF_getpropint(hd->hd_node, "phandle", 0);
if (hd->hd_phandle == 0)
return;
LIST_INSERT_HEAD(&hwlock_devices, hd, hd_list);
}
int
hwlock_lock_cells(uint32_t *cells, int lock)
{
struct hwlock_device *hd;
uint32_t phandle = cells[0];
LIST_FOREACH(hd, &hwlock_devices, hd_list) {
if (hd->hd_phandle == phandle)
break;
}
if (hd && hd->hd_lock)
return hd->hd_lock(hd->hd_cookie, &cells[1], lock);
return ENXIO;
}
uint32_t *
hwlock_next_hwlock(uint32_t *cells)
{
uint32_t phandle = cells[0];
int node, ncells;
node = OF_getnodebyphandle(phandle);
if (node == 0)
return NULL;
ncells = OF_getpropint(node, "#hwlock-cells", 0);
return cells + ncells + 1;
}
int
hwlock_do_lock_idx(int node, int idx, int lock)
{
uint32_t *hwlocks;
uint32_t *hwlock;
int rv = -1;
int len;
len = OF_getproplen(node, "hwlocks");
if (len <= 0)
return -1;
hwlocks = malloc(len, M_TEMP, M_WAITOK);
OF_getpropintarray(node, "hwlocks", hwlocks, len);
hwlock = hwlocks;
while (hwlock && hwlock < hwlocks + (len / sizeof(uint32_t))) {
if (idx <= 0)
rv = hwlock_lock_cells(hwlock, lock);
if (idx == 0)
break;
hwlock = hwlock_next_hwlock(hwlock);
idx--;
}
free(hwlocks, M_TEMP, len);
return rv;
}
int
hwlock_lock_idx(int node, int idx)
{
return hwlock_do_lock_idx(node, idx, 1);
}
int
hwlock_lock_idx_timeout(int node, int idx, int ms)
{
int i, ret = ENXIO;
for (i = 0; i <= ms; i++) {
ret = hwlock_do_lock_idx(node, idx, 1);
if (ret == EAGAIN) {
delay(1000);
continue;
}
break;
}
return ret;
}
int
hwlock_unlock_idx(int node, int idx)
{
return hwlock_do_lock_idx(node, idx, 0);
}
```
|
The National Center for Digitization (NCD) is a consortium composed of the most important
leading Serbian (and former Yugoslav) cultural and scientific institutions, which analyse problems of digitization of cultural and scientific heritage.
History
The work on the foundation of the National Center for Digitization (NCD) in Serbia started in 2002, with the idea to form a consortium consisting of leading cultural and research institutions involved in digitization of heritage. At the present state, the consortium includes:
Mathematical institute of the Serbian Academy of Sciences and Arts
Faculty of Mathematics Belgrade
National Library of Serbia
National Museum Belgrade
Archaeological Institute Belgrade
Archive of the Republic of Serbia
Institute for the Protection of Cultural Monuments of Serbia
Yugoslav Film Archive
University library Svetozar Markovic
Objectives
The main subjects of cooperation in the NCD are the following:
Coordination of efforts of institutions involved in the cultural and scientific heritage digitization
Establishing and promoting a national strategy for the cultural and scientific heritage digitization
Exploring, adaptation and implementation of international standards and protocols for the cultural and scientific heritage digitization and preservation at the national level. Development of new standards in areas where they do not exist.
Launching the cultural and scientific heritage digitization and making plans for possible migration process to new formats and technologies for already digitized data
The main activities of the NCD are:
Annual national conferences New Technologies and Standards:Digitization of National Heritage
The journal Review of the National Center for Digitization, published both on paper and in electronic form
Establishing, at the national level, proposals for a basic set of standards in the area of digitization of cultural and scientific heritage
Developing models of the appropriate distributed information systems and specific software for the realization of the digitization standards
Collaboration with the similar institutions from abroad, particularly with the South-Eastern European Digitization Initiative (SEEDI).
Projects
Electronic catalog of cultural monuments in Serbia
Electronic editions of mathematical journals
Digital library retro-digitized books and documents
Digital National library of Serbia
See also
South-Eastern European Digitization Initiative (SEEDI)
References
Bibliography
National Center for Digitization, NCD <http://www.ncd.org.rs/ncd_en/index.html> (May 24th, 2011)
National conferences New Technologies and Standards: Digitization of National Heritage <http://www.ncd.org.rs/ncd_en/conferences.html> (May 24th, 2011)
Review of the National Center for Digitization <http://elib.mi.sanu.ac.rs/pages/browse_publication.php?db=ncd> (May 24th, 2011)
2002 establishments in Serbia
Cultural organizations based in Serbia
Data transmission
Digital preservation
Mass digitization
Technology consortia
|
Michael Savage is an American radio host, author and conservative political commentator.
Michael Savage may also refer to:
Michael Joseph Savage (1872–1940), Prime Minister of New Zealand, 1935–1940
Michael Savage (sociologist) (born 1959), British sociologist and academic
Michael Savage (politician) (born 1960), Canadian politician
Michael Savage (Gaelic footballer) (born 1986), Gaelic football goalkeeper with Dublin
|
Gavin James Creel (born April 18, 1976) is an American actor, singer, and songwriter best known for his work in musical theater. Creel made his Broadway debut in 2002 in the leading role of Jimmy in Thoroughly Modern Millie before starring as Claude in the 2009 Broadway revival of Hair, both Tony Award-nominated performances. From 2012 to 2015, he starred as Elder Price in The Book of Mormon; he received a Laurence Olivier Award for originating the role in the West End version of the musical and has played the role in the US National Tour and on Broadway. In 2017, he received a Tony Award for his performance as Cornelius Hackl in Broadway's Hello, Dolly!.
Other stage credits of his include La Cage aux Folles (2004), She Loves Me (2016), Waitress (2019), and Into the Woods (2022) on Broadway, Mary Poppins (2006) and Waitress (2020) in the West End, and the national tours of Fame (1998), Flashdance (2012), and Into the Woods (2023). Primarily a theater actor, his most notable screen acting role is as Bill in Eloise at the Plaza and its Christmas-themed sequel.
Early life
Creel was born in Findlay, Ohio. He attended Findlay High School, graduating in 1994. He received his Bachelor of Fine Arts in musical theatre at the University of Michigan School of Music, Theatre & Dance in 1998.
Career
1997–2002: Early career
Creel began his professional career in regional theater. Some of his earliest credits are as part of the resident cast of Pittsburgh CLO, a repertory theater, for their 1997 and 1998 seasons; mostly ensemble roles, some of his eight productions there included Kiss Me Kate, La Cage aux Folles, and On the Town. Other stock theater credits around this time include productions in Massachusetts and New York state.
Following college graduation, Creel played Nick Piazza in the opening cast of 1998 national tour of Fame. In 1998–1999, the tour performed in cities including Toronto, Washington, D.C., and Chicago. Following the tour, he continued to perform in regional theater before moving to New York City in the early 2000s. In 2001, he was the swing in the original off-Broadway production of Bat Boy: The Musical. He also took part in the 2001 workshop of Spring Awakening.
2002–2012: Thoroughly Modern Millie and Hair
In 2002, Creel made his Broadway debut in the original production Thoroughly Modern Millie, originating the role of Jimmy Smith opposite Sutton Foster's Millie Dillmount. A breakthrough performance, he was nominated for the Tony Award for Best Performance by a Leading Actor in a Musical.
In February 2003, Creel played Prince Eric in a workshop for Disney's stage adaptation of The Little Mermaid.
After he departed Thoroughly Modern Millie in April 2003, he performed in the original Chicago production of Stephen Sondheim's Road Show, then titled Bounce, recorded the original cast album for Bright Lights, Big City, among other productions and workshops. Of note, he made his screen acting debut in the 2003 film Eloise at the Plaza and its follow-up Eloise at Christmastime as Bill.
He returned to Broadway in 2004 in the revival La Cage aux Folles. He played Jean-Michel throughout the production. In 2006, he made his West End debut in Mary Poppins. He replaced Bert in the original production. Also in 2006, he released his debut studio album Goodtimenation.
In 2008, Creel was set to star as Jesus alongside Joshua Henry as Judas/John the Baptist and Diana DeGarmo in a Broadway revival of Godspell at the Ethel Barrymore Theatre, but on August 19, it was announced that the show was postponed indefinitely due to the loss of an investor.
He returned to Broadway in 2009 in the revival of Hair. For his starring role of Claude, he received his second Tony Award nomination for Best Actor in a Musical. He and the rest of the cast performed in London through 2010 when the production transferred to the West End. Following Hair, he starred in the world premiere of Prometheus Bound and the original US tour of the Flashdance musical; the national tour was expected to function as a pre-Broadway production but did not transfer.
2012–present: The Book of Mormon, Hello Dolly!, and Into the Woods
From 2012 until 2015, Creel starred in a series of productions of The Book of Mormon. He first starred as Elder Price in the First National Tour of the show in 2012. He subsequently originated the role in the musical's original West End production; for this performance, he was awarded Best Actor in a Musical at the 2014 Laurence Olivier Awards, the most prestigious theatrical awards in the United Kingdom. Following his West End run, he returned to the touring production for a number of months before joining the Broadway cast in 2015.
Creel played the suave salesman Steven Kodaly, opposite Jane Krakowski, in the 2016 Broadway revival of She Loves Me. The show was a critical success and the production became the first Broadway show ever to be live-streamed. Since then, the recording has been part of the PBS series Great Performances.
In 2017, he began playing Cornelius Hackl in the Broadway revival of Hello, Dolly! starring Bette Midler. For his role, Creel was awarded the 2017 Tony Award for Best Actor in a Featured Role in a Musical.
In 2019, Creel assumed the role of Dr. Pomatter in the Broadway production of Waitress. He subsequently played the role in the West End production of the musical starring alongside Sara Bareilles.
In 2021, Creel appeared in two episodes of American Horror Stories opposite Matt Bomer and Sierra McCormick on FX on Hulu.
On August 29, 2021, Creel was featured in the Public Broadcasting Service (PBS) network's aired concert for the musical Wicked which was hosted by Kristin Chenoweth and Idina Menzel. Other featured artists were Rita Moreno, Cynthia Erivo, Ariana DeBose, Ali Stroker, Amber Riley, Mario Cantone, Jennifer Nettles, Stephanie Hsu, Alex Newell, Isaac Cole Powell and Gabrielle Ruiz performing many of the musical's numbers.
Also in 2021, Creel performed in a self-described 'concert-cal' called Walk on Through: Confessions of a Museum Novice, for which Creel was commissioned to write and perform the book, music, and lyrics by the Metropolitan Museum of Art. Creel has spoken at length on various podcasts about working on this piece before and during the COVID-19 pandemic. It is set for its world premiere Off-Broadway in November 2023.
In May 2022, Creel appeared as The Wolf and Cinderella's Prince in the New York City Center Encores! production and subsequent Broadway revival in June of Into the Woods. He left the production July 23 for two weeks and was filled in for by Cheyenne Jackson and understudy Jason Forbach. He came back for a month and then left again on September 4 for 10 days and was filled in for by Andy Karl, He returned to the production September 16 and stayed with the cast through its closing date January 8, 2023. During the Broadway run he would star opposite Bareilles, Karl, Joshua Henry, Phillipa Soo, Brian d'Arcy James, Patina Miller, Stephanie J. Block, Krysta Rodriguez, Denée Benton, Julia Lester, Sebastian Arcelus, Montego Glover, Diane Phelan, and Joaquina Kalukango. He reprised these roles in the 2023 national tour opposite Glover, Block, Arcelus, Forbach, Phelan, Rodriguez, and Karl.
Personal life
Creel is gay. He is a regular on the LGBT RFamilyVacations cruise with Rosie O'Donnell. He is also one of the founders, with Rory O'Malley and Jenny Kanelos, of Broadway Impact, an LGBT activist group that mobilized the New York theatre community in the pursuit of marriage equality. He is an alumnus of Findlay First Edition Show Choir.
Creel took a temporary leave from Hello, Dolly! in March 2018 to recover from back surgery.
Acting credits
Theatre
Adapted from About The Artists and Broadway World.
Television
Other works
2016: The Ceiling Fan (producer) • short film
Discography
Solo discography
Albums
2006: Goodtimenation (Creel/Roth)
2012: Get Out (self-released)
EPs
2010: Quiet (self-released); No. 44 at the Billboard's Top Heatseekers
Singles
2011: "Noise (Equality Now)"
2012: "Whitney Houston"
Guest appearances
2002: "Lullaby of Broadway" with Marc Kudisch & David Nehls from Broadway Romances Manhattan
2005: "'Til Then" from ZEITGEIST by Dan Lipton
2007: "Young at Heart" from Over the Rainbow (Universal)
2010: "Greenwich Time" from Love on a Summer Afternoon: Songs of Sam Davis (PS Classics)
2017: "Christmas Broadway Bus Stop" with Laura Bell Bundy & Eden Espinosa
2019: "Do You Hear the Bells?" with The Laurie Berkner Band from Waiting For The Elevator
2020: "Witchcraft/I Put a Spell on You" from I Put a Spell on You (Broadway Records)
2020: "If It Be Your Will" with Shoshana Bean & Shayna Steele from Sing Your Hallelujah (Shotime Records)
2021: "Something Wonderful" from R&H Goes Pop!
2021: "A Moment Forever Ago" from Central Park Season Two, The Soundtrack
Cast recordings
2002: Thoroughly Modern Millie (RCA Victor)
2005: Hair (Actors Fund of America Benefit Recording) (Sh-K-Boom)
2005: Bright Lights, Big City (Original Cast Recording) (Sh-K-Boom)
2006: It's Only Life (A New Musical Revue) (PS Classics)
2009: Hair (New Broadway Cast Recording) (Sh-K-Boom)
2011: Fine and Dandy (World Premiere Recording) (PS Classics)
2012: Flashdance - The Musical (Roth Music Inc.)
2012: Fugitive Songs - A Song Cycle (Warner/Chappell)
2016: She Loves Me (2016 Broadway Cast Recording) (Ghostlight Records)
2017: Hello, Dolly! (New Broadway Cast Recording) (Masterworks Broadway)
2019: Three Points of Contact (Very Intense Records)
2019: The Man in the Ceiling (World Premiere Recording) (Ghostlight Records)
2022: Into the Woods (2022 Broadway Cast Recording) (Craft Recordings)
Awards and nominations
See also
LGBT culture in New York City
List of LGBT people from New York City
References
External links
(official website)
[ Gavin Creel] at Billboard
Gavin Creel on Discogs
1976 births
Living people
20th-century American male actors
21st-century American male actors
People from Findlay, Ohio
Male actors from Ohio
American gay actors
American male musical theatre actors
American male television actors
Tony Award winners
American film producers
LGBT people from Ohio
American LGBT musicians
American LGBT rights activists
Activists from Ohio
University of Michigan School of Music, Theatre & Dance alumni
Laurence Olivier Award winners
Findlay High School alumni
21st-century American male singers
21st-century American singers
20th-century American male singers
20th-century American singers
|
```go
//go:build !ignore_autogenerated
// +build !ignore_autogenerated
/*
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 fitask. DO NOT EDIT.
package scalewaytasks
import (
"k8s.io/kops/upup/pkg/fi"
)
// LoadBalancer
var _ fi.HasLifecycle = &LoadBalancer{}
// GetLifecycle returns the Lifecycle of the object, implementing fi.HasLifecycle
func (o *LoadBalancer) GetLifecycle() fi.Lifecycle {
return o.Lifecycle
}
// SetLifecycle sets the Lifecycle of the object, implementing fi.SetLifecycle
func (o *LoadBalancer) SetLifecycle(lifecycle fi.Lifecycle) {
o.Lifecycle = lifecycle
}
var _ fi.HasName = &LoadBalancer{}
// GetName returns the Name of the object, implementing fi.HasName
func (o *LoadBalancer) GetName() *string {
return o.Name
}
// String is the stringer function for the task, producing readable output using fi.TaskAsString
func (o *LoadBalancer) String() string {
return fi.CloudupTaskAsString(o)
}
```
|
```c++
#include <utility>
#include <vector>
#include "gtest/gtest.h"
#include "caffe/blob.hpp"
#include "caffe/common.hpp"
#include "caffe/filler.hpp"
#include "caffe/vision_layers.hpp"
#include "caffe/test/test_caffe_main.hpp"
namespace caffe {
template <typename Dtype>
class ArgMaxLayerTest : public CPUDeviceTest<Dtype> {
protected:
ArgMaxLayerTest()
: blob_bottom_(new Blob<Dtype>(10, 20, 1, 1)),
blob_top_(new Blob<Dtype>()),
top_k_(5) {
Caffe::set_random_seed(1701);
// fill the values
FillerParameter filler_param;
GaussianFiller<Dtype> filler(filler_param);
filler.Fill(this->blob_bottom_);
blob_bottom_vec_.push_back(blob_bottom_);
blob_top_vec_.push_back(blob_top_);
}
virtual ~ArgMaxLayerTest() { delete blob_bottom_; delete blob_top_; }
Blob<Dtype>* const blob_bottom_;
Blob<Dtype>* const blob_top_;
vector<Blob<Dtype>*> blob_bottom_vec_;
vector<Blob<Dtype>*> blob_top_vec_;
size_t top_k_;
};
TYPED_TEST_CASE(ArgMaxLayerTest, TestDtypes);
TYPED_TEST(ArgMaxLayerTest, TestSetup) {
LayerParameter layer_param;
ArgMaxLayer<TypeParam> layer(layer_param);
layer.SetUp(this->blob_bottom_vec_, this->blob_top_vec_);
EXPECT_EQ(this->blob_top_->num(), this->blob_bottom_->num());
EXPECT_EQ(this->blob_top_->channels(), 1);
}
TYPED_TEST(ArgMaxLayerTest, TestSetupMaxVal) {
LayerParameter layer_param;
ArgMaxParameter* argmax_param = layer_param.mutable_argmax_param();
argmax_param->set_out_max_val(true);
ArgMaxLayer<TypeParam> layer(layer_param);
layer.SetUp(this->blob_bottom_vec_, this->blob_top_vec_);
EXPECT_EQ(this->blob_top_->num(), this->blob_bottom_->num());
EXPECT_EQ(this->blob_top_->channels(), 2);
}
TYPED_TEST(ArgMaxLayerTest, TestCPU) {
LayerParameter layer_param;
ArgMaxLayer<TypeParam> layer(layer_param);
layer.SetUp(this->blob_bottom_vec_, this->blob_top_vec_);
layer.Forward(this->blob_bottom_vec_, this->blob_top_vec_);
// Now, check values
const TypeParam* bottom_data = this->blob_bottom_->cpu_data();
const TypeParam* top_data = this->blob_top_->cpu_data();
int max_ind;
TypeParam max_val;
int num = this->blob_bottom_->num();
int dim = this->blob_bottom_->count() / num;
for (int i = 0; i < num; ++i) {
EXPECT_GE(top_data[i], 0);
EXPECT_LE(top_data[i], dim);
max_ind = top_data[i];
max_val = bottom_data[i * dim + max_ind];
for (int j = 0; j < dim; ++j) {
EXPECT_LE(bottom_data[i * dim + j], max_val);
}
}
}
TYPED_TEST(ArgMaxLayerTest, TestCPUMaxVal) {
LayerParameter layer_param;
ArgMaxParameter* argmax_param = layer_param.mutable_argmax_param();
argmax_param->set_out_max_val(true);
ArgMaxLayer<TypeParam> layer(layer_param);
layer.SetUp(this->blob_bottom_vec_, this->blob_top_vec_);
layer.Forward(this->blob_bottom_vec_, this->blob_top_vec_);
// Now, check values
const TypeParam* bottom_data = this->blob_bottom_->cpu_data();
const TypeParam* top_data = this->blob_top_->cpu_data();
int max_ind;
TypeParam max_val;
int num = this->blob_bottom_->num();
int dim = this->blob_bottom_->count() / num;
for (int i = 0; i < num; ++i) {
EXPECT_GE(top_data[i], 0);
EXPECT_LE(top_data[i], dim);
max_ind = top_data[i * 2];
max_val = top_data[i * 2 + 1];
EXPECT_EQ(bottom_data[i * dim + max_ind], max_val);
for (int j = 0; j < dim; ++j) {
EXPECT_LE(bottom_data[i * dim + j], max_val);
}
}
}
TYPED_TEST(ArgMaxLayerTest, TestCPUTopK) {
LayerParameter layer_param;
ArgMaxParameter* argmax_param = layer_param.mutable_argmax_param();
argmax_param->set_top_k(this->top_k_);
ArgMaxLayer<TypeParam> layer(layer_param);
layer.SetUp(this->blob_bottom_vec_, this->blob_top_vec_);
layer.Forward(this->blob_bottom_vec_, this->blob_top_vec_);
// Now, check values
int max_ind;
TypeParam max_val;
int num = this->blob_bottom_->num();
int dim = this->blob_bottom_->count() / num;
for (int i = 0; i < num; ++i) {
EXPECT_GE(this->blob_top_->data_at(i, 0, 0, 0), 0);
EXPECT_LE(this->blob_top_->data_at(i, 0, 0, 0), dim);
for (int j = 0; j < this->top_k_; ++j) {
max_ind = this->blob_top_->data_at(i, 0, j, 0);
max_val = this->blob_bottom_->data_at(i, max_ind, 0, 0);
int count = 0;
for (int k = 0; k < dim; ++k) {
if (this->blob_bottom_->data_at(i, k, 0, 0) > max_val) {
++count;
}
}
EXPECT_EQ(j, count);
}
}
}
TYPED_TEST(ArgMaxLayerTest, TestCPUMaxValTopK) {
LayerParameter layer_param;
ArgMaxParameter* argmax_param = layer_param.mutable_argmax_param();
argmax_param->set_out_max_val(true);
argmax_param->set_top_k(this->top_k_);
ArgMaxLayer<TypeParam> layer(layer_param);
layer.SetUp(this->blob_bottom_vec_, this->blob_top_vec_);
layer.Forward(this->blob_bottom_vec_, this->blob_top_vec_);
// Now, check values
int max_ind;
TypeParam max_val;
int num = this->blob_bottom_->num();
int dim = this->blob_bottom_->count() / num;
for (int i = 0; i < num; ++i) {
EXPECT_GE(this->blob_top_->data_at(i, 0, 0, 0), 0);
EXPECT_LE(this->blob_top_->data_at(i, 0, 0, 0), dim);
for (int j = 0; j < this->top_k_; ++j) {
max_ind = this->blob_top_->data_at(i, 0, j, 0);
max_val = this->blob_top_->data_at(i, 1, j, 0);
EXPECT_EQ(this->blob_bottom_->data_at(i, max_ind, 0, 0), max_val);
int count = 0;
for (int k = 0; k < dim; ++k) {
if (this->blob_bottom_->data_at(i, k, 0, 0) > max_val) {
++count;
}
}
EXPECT_EQ(j, count);
}
}
}
} // namespace caffe
```
|
```xml
<annotation>
<folder>toy_images</folder>
<filename>toy54.jpg</filename>
<path>/home/animesh/Documents/grocery_detection/toy_exptt/toy_images/toy54.jpg</path>
<source>
<database>Unknown</database>
</source>
<size>
<width>500</width>
<height>300</height>
<depth>3</depth>
</size>
<segmented>0</segmented>
<object>
<name>toy</name>
<pose>Unspecified</pose>
<truncated>0</truncated>
<difficult>0</difficult>
<bndbox>
<xmin>184</xmin>
<ymin>38</ymin>
<xmax>347</xmax>
<ymax>211</ymax>
</bndbox>
</object>
</annotation>
```
|
```javascript
(function () {
'use strict';
angular.module('ariaNg').constant('ariaNgFileTypes', {
video: {
name: 'Videos',
extensions: [
'.3g2',
'.3gp',
'.3gp2',
'.3gpp',
'.asf',
'.asx',
'.avi',
'.dat',
'.divx',
'.flv',
'.m1v',
'.m2ts',
'.m2v',
'.m4v',
'.mkv',
'.mov',
'.mp4',
'.mpe',
'.mpeg',
'.mpg',
'.mts',
'.ogv',
'.qt',
'.ram',
'.rm',
'.rmvb',
'.ts',
'.vob',
'.wmv'
]
},
audio: {
name: 'Audios',
extensions: [
'.aac',
'.ac3',
'.adts',
'.amr',
'.ape',
'.eac3',
'.flac',
'.m1a',
'.m2a',
'.m4a',
'.mid',
'.mka',
'.mp2',
'.mp3',
'.mpa',
'.mpc',
'.ogg',
'.ra',
'.tak',
'.vqf',
'.wm',
'.wav',
'.wma',
'.wv'
]
},
picture: {
name: 'Pictures',
extensions: [
'.abr',
'.bmp',
'.emf',
'.gif',
'.j2c',
'.j2k',
'.jfif',
'.jif',
'.jp2',
'.jpc',
'.jpe',
'.jpeg',
'.jpf',
'.jpg',
'.jpk',
'.jpx',
'.pcx',
'.pct',
'.pic',
'.pict',
'.png',
'.pns',
'.psd',
'.psdx',
'.raw',
'.svg',
'.svgz',
'.tga',
'.tif',
'.tiff',
'.wbm',
'.wbmp',
'.webp',
'.wmf',
'.xif'
]
},
document: {
name: 'Documents',
extensions: [
'.csv',
'.doc',
'.docm',
'.docx',
'.dot',
'.dotm',
'.dotx',
'.key',
'.mpp',
'.numbers',
'.odp',
'.ods',
'.odt',
'.pages',
'.pdf',
'.pot',
'.potm',
'.potx',
'.pps',
'.ppsm',
'.ppsx',
'.ppt',
'.pptm',
'.pptx',
'.rtf',
'.txt',
'.vsd',
'.vsdx',
'.wk1',
'.wk2',
'.wk3',
'.wk4',
'.wks',
'.wpd',
'.wps',
'.xla',
'.xlam',
'.xll',
'.xlm',
'.xls',
'.xlsb',
'.xlsm',
'.xlsx',
'.xlt',
'.xltx',
'.xlw',
'.xps'
]
},
application: {
name: 'Applications',
extensions: [
'.apk',
'.bat',
'.com',
'.deb',
'.dll',
'.dmg',
'.exe',
'.ipa',
'.jar',
'.msi',
'.rpm',
'.sh'
]
},
archive: {
name: 'Archives',
extensions: [
'.001',
'.7z',
'.ace',
'.arj',
'.bz2',
'.cab',
'.cbr',
'.cbz',
'.gz',
'.img',
'.iso',
'.lzh',
'.qcow2',
'.r',
'.rar',
'.sef',
'.tar',
'.taz',
'.tbz',
'.tbz2',
'.uue',
'.vdi',
'.vhd',
'.vmdk',
'.wim',
'.xar',
'.xz',
'.z',
'.zip'
]
}
});
}());
```
|
Ronnie Balya (born 1961) is a Ugandan military officer currently serving at the rank of Brigadier General in the Uganda People's Defence Force (UPDF). He is currently serving as Uganda's ambassador to South Sudan, based in Juba, from 2017. Before that, from 2010 until 2017, he was the Director General of the Internal Security Organisation (ISO).
Background and education
Balya was born 1961 in Kabarole District in Toro sub-region, in the Western Region of Uganda. He studied at Makerere University, graduating with a Bachelor of Social Sciences degree. He continued with his studies at University of Nairobi where he earned a Master of Arts degree in Diplomacy and International Studies. He was selected by the Commander in Chief to attend a Strategic Command and Leadership Course at the National Defence College, Kenya, in Nairobi. He has also studied in various intelligence courses in Russia, the United Kingdom and the United States.
Military career
He joined the National Resistance Army in 1985. He served initially as a district internal security officer in Northern Uganda and Western Uganda. In 1997, Balya was moved to headquarters where he served in various capacities like director of the ISO inspectorate, director analysis and director technical intelligence. In August 2006, Balya was appointed deputy director general of ISO.
On 27 July 2010, Balya was appointed director general of ISO, replacing Amos Mukumbi who was given another engagement in government. In December 2010, he was promoted to the rank of colonel. In February 2014, he was promoted to the rank of Brigadier.
Other responsibilities
He is the current Uganda's Ambassador Extraordinary and Plenipotentiary to the Republic of South Sudan-Recently he addressed Uganda, South Sudan business forum held in Juba in July,2022 where he emphasized Uganda's commitment to promoting trade, peace, security and stability in the region (Full speech of Amb. H.E Brig.Gen. Ronnie Balya ‘ndc’,during the July Uganda, South Sudan Business forum,https://explorer.co.ug/inside-uganda-south-sudan-trade-ties/ .In addition to his duties at ISO, he served as the chair of the Joint Intelligence Committee which brings together all the Intelligence agencies. He was also the secretary to the National Security Council, which is chaired by the President and composed of Ministers and Security Chiefs that handle National Defence and Security matters. In July 2016, he told the Ugandan Cabinet during a retreat in Kyankwanzi District that "corruption is killing government".
See also
Elly Kayanja
Jim Muhwezi
Henry Tumukunde
Order of succession
References
External links
https://explorer.co.ug/inside-uganda-south-sudan-trade-ties/
ISO helping Police track down killers of Muslim Sheikhs
People from Kabarole District
Living people
Toro people
1961 births
Ugandan military personnel
Ugandan generals
|
This is a list of the Iraq national football team results from 1957 to 1969.
Results
1950s
1957
1959
1960s
1962
1964
1965
1966
1967
1968
1969
See also
Iraq national football team results
References
External links
Iraq fixtures on eloratings.net
Iraq on soccerway.com
1960s in Iraqi sport
1957
1950s in Iraq
|
```ruby
class Gwyddion < Formula
desc "Scanning Probe Microscopy visualization and analysis tool"
homepage "path_to_url"
url "path_to_url"
sha256 your_sha256_hash
license "GPL-2.0-or-later"
livecheck do
url "path_to_url"
regex(/stable version Gwyddion v?(\d+(?:\.\d+)+):/i)
end
bottle do
sha256 arm64_sonoma: your_sha256_hash
sha256 arm64_ventura: your_sha256_hash
sha256 arm64_monterey: your_sha256_hash
sha256 sonoma: your_sha256_hash
sha256 ventura: your_sha256_hash
sha256 monterey: your_sha256_hash
sha256 x86_64_linux: your_sha256_hash
end
depends_on "pkg-config" => :build
depends_on "cairo"
depends_on "fftw"
depends_on "gdk-pixbuf"
depends_on "glib"
depends_on "gtk+"
depends_on "gtkglext"
depends_on "libpng"
depends_on "libxml2"
depends_on "minizip"
depends_on "pango"
uses_from_macos "bzip2"
uses_from_macos "zlib"
on_macos do
# Regenerate autoconf files to avoid flat namespace in library
# (autoreconf runs gtkdocize, provided by gtk-doc)
depends_on "autoconf" => :build
depends_on "automake" => :build
depends_on "gtk-doc" => :build
depends_on "libtool" => :build
# TODO: depends_on "gtk-mac-integration"
depends_on "at-spi2-core"
depends_on "gettext"
depends_on "harfbuzz"
end
def install
system "autoreconf", "--force", "--install", "--verbose" if OS.mac?
system "./configure", *std_configure_args,
"--disable-silent-rules",
"--disable-desktop-file-update",
"--with-html-dir=#{doc}",
"--without-gtksourceview",
"--disable-pygwy"
system "make", "install"
end
test do
system bin/"gwyddion", "--version"
(testpath/"test.c").write <<~EOS
#include <libgwyddion/gwyddion.h>
int main(int argc, char *argv[]) {
const gchar *string = gwy_version_string();
return 0;
}
EOS
atk = Formula["atk"]
cairo = Formula["cairo"]
fftw = Formula["fftw"]
fontconfig = Formula["fontconfig"]
freetype = Formula["freetype"]
gdk_pixbuf = Formula["gdk-pixbuf"]
gettext = Formula["gettext"]
glib = Formula["glib"]
gtkx = Formula["gtk+"]
gtkglext = Formula["gtkglext"]
harfbuzz = Formula["harfbuzz"]
libpng = Formula["libpng"]
pango = Formula["pango"]
pixman = Formula["pixman"]
flags = %W[
-I#{atk.opt_include}/atk-1.0
-I#{cairo.opt_include}/cairo
-I#{fftw.opt_include}
-I#{fontconfig.opt_include}
-I#{freetype.opt_include}/freetype2
-I#{gdk_pixbuf.opt_include}/gdk-pixbuf-2.0
-I#{gettext.opt_include}
-I#{glib.opt_include}/glib-2.0
-I#{glib.opt_lib}/glib-2.0/include
-I#{gtkglext.opt_include}/gtkglext-1.0
-I#{gtkglext.opt_lib}/gtkglext-1.0/include
-I#{gtkx.opt_include}/gtk-2.0
-I#{gtkx.opt_lib}/gtk-2.0/include
-I#{harfbuzz.opt_include}/harfbuzz
-I#{include}/gwyddion
-I#{libpng.opt_include}/libpng16
-I#{lib}/gwyddion/include
-I#{pango.opt_include}/pango-1.0
-I#{pixman.opt_include}/pixman-1
-D_REENTRANT
-L#{atk.opt_lib}
-L#{cairo.opt_lib}
-L#{fftw.opt_lib}
-L#{fontconfig.opt_lib}
-L#{freetype.opt_lib}
-L#{gdk_pixbuf.opt_lib}
-L#{gettext.opt_lib}
-L#{glib.opt_lib}
-L#{gtkglext.opt_lib}
-L#{gtkx.opt_lib}
-L#{lib}
-L#{pango.opt_lib}
-latk-1.0
-lcairo
-lfftw3
-lfontconfig
-lfreetype
-lgdk_pixbuf-2.0
-lgio-2.0
-lglib-2.0
-lgmodule-2.0
-lgobject-2.0
-lgwyapp2
-lgwyddion2
-lgwydgets2
-lgwydraw2
-lgwymodule2
-lgwyprocess2
-lpango-1.0
-lpangocairo-1.0
-lpangoft2-1.0
]
if OS.mac?
flags += %w[
-lintl
-lgdk-quartz-2.0
-lgdkglext-quartz-1.0
-lgtk-quartz-2.0
-lgtkglext-quartz-1.0
-framework AppKit
-framework OpenGL
]
end
system ENV.cc, "test.c", "-o", "test", *flags
system "./test"
end
end
```
|
Bilgadi (; , Bilhədi) is a rural locality (a selo) in Chinarsky Selsoviet, Derbentsky District, Republic of Dagestan, Russia. The population was 635 as of 2010. The village has an Azerbaijani-majority.
Geography
Bilgadi is located 17 km northwest of Derbent (the district's administrative centre) by road. Chinar and Zidyan-Kazmalyar are the nearest rural localities.
References
Rural localities in Derbentsky District
|
Alexander Murray, Lord Henderland (11 May 1736 – 16 March 1795) was a Scottish judge and politician.
Life
Born at Murrayfield House west of Edinburgh's Old Town on 11 May 1736, he was the son of Archibald Murray of Cringletie, an advocate.
He studied law at the University of Edinburgh, and was called to the Scottish bar on 7 March 1758, and succeeded his father as sheriff-depute of Peebles in 1761, and as one of the commissaries of Edinburgh in 1765.
He inherited the estate of Henderland in Dumfries and Galloway around 1760.
On 24 May 1775 Murray was appointed solicitor-general for Scotland, and at the general election in September 1780 was returned to the House of Commons for Peeblesshire. The only speech he is recorded to have made in parliament was in opposition to Sir George Savile's motion relating to the petition of the delegated counties for a redress of grievances.
Murray succeeded Henry Home, Lord Kames, as an ordinary lord of session and a commissioner of the court of justiciary, and took his seat on the bench with the title of Lord Henderland on 6 March 1783. He took part in the trials for sedition at Edinburgh in 1793, and died of cholera at Murrayfield on 16 March 1795.
He is buried in St Cuthberts Churchyard in Edinburgh, beneath a huge monument, to the north side of the church.
Recognition
The district of Murrayfield takes the name of his family, as does the street name of Henderland Road within that district.
Works
Murray's Disputatio Juridica . . . de Divortiis et Repudiis was published in 1758 (Edinburgh).
Family
On 15 March 1773 he married Katherine Lindsay (1737-1828), daughter of Sir Alexander Lindsay, 3rd Baronet of Evelick, Perthshire. Their children included Sir John Archibald Murray, Lord Murray. Henderland was joint clerk of the pipe in the court of exchequer, an office which, through the influence of Lord Melville, was subsequently conferred on his two sons.
His sister Susan married Sir Ilay Campbell.
Notes
Attribution
1736 births
1795 deaths
Politicians from Edinburgh
Scottish sheriffs
Henderland
Members of the Parliament of Great Britain for Scottish constituencies
Solicitors General for Scotland
British MPs 1780–1784
Deaths from cholera
Lawyers from Edinburgh
|
```objective-c
//your_sha256_hash------------
// Anti-Grain Geometry - Version 2.3
//
// Permission to copy, use, modify, sell and distribute this software
// is granted provided this copyright notice appears in all copies.
// This software is provided "as is" without express or implied
// warranty, and with no claim as to its suitability for any purpose.
//
//your_sha256_hash------------
// Contact: mcseem@antigrain.com
// mcseemagg@yahoo.com
// path_to_url
//your_sha256_hash------------
//
// vertex_sequence container and vertex_dist struct
//
//your_sha256_hash------------
#ifndef AGG_VERTEX_SEQUENCE_INCLUDED
#define AGG_VERTEX_SEQUENCE_INCLUDED
#include "agg_basics.h"
#include "agg_array.h"
#include "agg_math.h"
namespace agg
{
template<class T, unsigned S = 6>
class vertex_sequence : public pod_deque<T, S>
{
public:
typedef pod_deque<T, S> base_type;
void add(const T& val);
void modify_last(const T& val);
void close(bool remove_flag);
};
template<class T, unsigned S>
void vertex_sequence<T, S>::add(const T& val)
{
if(base_type::size() > 1) {
if(!(*this)[base_type::size() - 2]((*this)[base_type::size() - 1])) {
base_type::remove_last();
}
}
base_type::add(val);
}
template<class T, unsigned S>
void vertex_sequence<T, S>::modify_last(const T& val)
{
base_type::remove_last();
add(val);
}
template<class T, unsigned S>
void vertex_sequence<T, S>::close(bool closed)
{
while(base_type::size() > 1) {
if((*this)[base_type::size() - 2]((*this)[base_type::size() - 1])) {
break;
}
T t = (*this)[base_type::size() - 1];
base_type::remove_last();
modify_last(t);
}
if(closed) {
while(base_type::size() > 1) {
if((*this)[base_type::size() - 1]((*this)[0])) {
break;
}
base_type::remove_last();
}
}
}
const float vertex_dist_epsilon = 1e-14f;
struct vertex_dist {
float x;
float y;
float dist;
vertex_dist() {}
vertex_dist(float x_, float y_) :
x(x_),
y(y_),
dist(0)
{
}
bool operator () (const vertex_dist& val)
{
bool ret = (dist = calc_distance(x, y, val.x, val.y)) > vertex_dist_epsilon;
return ret;
}
};
struct vertex_dist_cmd : public vertex_dist {
unsigned cmd;
vertex_dist_cmd() {}
vertex_dist_cmd(float x_, float y_, unsigned cmd_) :
vertex_dist(x_, y_),
cmd(cmd_)
{
}
};
}
#endif
```
|
Olivier Séchan (January 14, 1911 – July 7, 2006) was a French writer best known for his children’s books. He was born in Montpellier and died in Paris at the age of 95. He was the son of Louis Séchan and brother of Edmond Séchan.
Life and work
His father Louis Séchan was a professor at the Sorbonne. His mother Isabelle Bost was the granddaughter of a Protestant pastor. He was born in Montpellier where he spent the first twenty years of his life. Moving to Paris, he taught German in the 1930s. During the 1930s, he was a member of the leftist “Groupe Brunet,” which included Claude Cahun and Jean Legrand.
In 1939, he published his first novel Les eaux mortes which was considered "too American". Eight more novels followed, including Les corps ont soif which won the Prix des Deux Magots in 1942. He also won the Prix du Roman d'Aventures in 1951 for his humorous crime novel Vous qui n'avez jamais été tués, written with his friend Igor Maslowski. Several of his novels are set in the Cevennes region.
During World War II, he ran for a while the collaborationist radio station Radio Paris.
He became a director at the publishing firm Hachette. He began writing children's books that were published in the famous Bibliothèque rose and Bibliothèque verte series. He created the recurring characters Luc and Martine, and translated many of the Jennings novels of Anthony Buckeridge. His work for young readers proved very popular.
Séchan spoke fluent English, German and Dutch. He had a wife and six children, among them the novelist Thierry Séchan and the famous singer Renaud Séchan, known simply throughout France as Renaud.
He was buried in Montparnasse.
References
Writers from Montpellier
1911 births
2006 deaths
20th-century French novelists
21st-century French novelists
French crime fiction writers
French children's writers
French male short story writers
French short story writers
French male novelists
Prix des Deux Magots winners
20th-century French male writers
21st-century French male writers
French Protestants
|
Mysore Venkatesha Doreswamy Iyengar (1920-1997) was a Carnatic musician and one of the greatest exponents of the veena in modern Indian history.
Early life
He was a son of Venkatesha Iyengar, a learned vainika and royal musician at the court of the Princely State of Mysore.
Iyengar started learning the veena from his father at an early age and soon became a disciple of Veena Venkatagiriyappa. He performed in the presence of the then Maharaja of Mysore at the age of 12. Spellbound, the Maharaja presented him with a fifty-rupee silver coin. Iyengar received a BA degree from Maharaja's College, Mysore.
Career
He gave his first public performance in 1943 at the Bangalore Gayana Samaja. He participated in music conferences including one in Shiraz, Iran, in 1969, where he was also invited to perform at the Shiraz Persepolis Festival of Arts..
He served as the Music Director at the All India Radio in Bangalore. The University of Mysore conferred upon him an Honorary Doctorate in 1975.
In an age when most of the other vainikas had started using the contact microphone, Iyengar stuck to the ‘acoustic’ Veena. His style of playing is sometimes referred to as the Mysore Style. This distinctive style is marked by the movements from one note to another being achieved with the playing fingers (the index and middle fingers of the left hand) parted. This, along with his prolonged, medieval string plucking style enabled him to achieve the continuity of sound.
Concerts of Iyengar, accompanied by Mysore T Chowdiah on the violin, became very popular. He participated in many Jugalbandis, including with famous Hindustani classical instrumentalists such as Ustad Ali Akbar Khan. He composed music for dance dramas, notably to those of P. T. Narasimhachar. Iyengar also composed songs for a few Kannada films, notably Subbashastri, starring Kalyan Kumar. Iyengar was regularly accompanied on mridangam by V S Rajagopal. The noted vainika C. Krishnamurthy was one of Iyengar's main disciples.
Iyengar died aged 77 in Bangalore, India.
Awards
Doreswamy Iyengar was awarded the Padma Bhushan by the President of India in 1983, the Sangeetha Kalanidhi of the Madras Music Academy in 1984, the Sangeetha Kalasikhamani of the Indian Fine Arts Society in 1994, the Sangeetha Kalarathna of the Bangalore Gayanasamaja, and the Chowdiah National Memorial Award.
References
External links
Listen to Tyagaraja Compositions performed by Sri Doreswamy Iyengar
his compositions in mp3 format
1920 births
1997 deaths
Saraswati veena players
Male Carnatic singers
Carnatic singers
Musicians from Mysore
University of Mysore alumni
Maharaja's College, Mysore alumni
All India Radio people
20th-century Indian male classical singers
Recipients of the Padma Bhushan in arts
Recipients of the Sangeet Natak Akademi Award
|
```objective-c
#pragma once
#include <Processors/ISimpleTransform.h>
#include <Interpreters/Cache/QueryCache.h>
namespace DB
{
class StreamInQueryCacheTransform : public ISimpleTransform
{
public:
StreamInQueryCacheTransform(
const Block & header_,
std::shared_ptr<QueryCache::Writer> query_cache_writer,
QueryCache::Writer::ChunkType chunk_type);
protected:
void transform(Chunk & chunk) override;
public:
void finalizeWriteInQueryCache();
String getName() const override { return "StreamInQueryCacheTransform"; }
private:
const std::shared_ptr<QueryCache::Writer> query_cache_writer;
const QueryCache::Writer::ChunkType chunk_type;
};
}
```
|
```java
package app.nzyme.core.distributed;
import app.nzyme.plugin.RegistryKey;
import app.nzyme.plugin.rest.configuration.ConfigurationEntryConstraint;
import java.util.ArrayList;
import java.util.Optional;
public class NodeRegistryKeys {
public static final RegistryKey EPHEMERAL_NODES_REGEX = RegistryKey.create(
"ephemeral_nodes_regex",
Optional.of(new ArrayList<>() {{
ConfigurationEntryConstraint.createStringLengthConstraint(1, 255);
}}),
Optional.empty(),
false
);
public static final RegistryKey VERSIONCHECK_STATUS = RegistryKey.create(
"versioncheck_status",
Optional.of(new ArrayList<>() {{
ConfigurationEntryConstraint.createSimpleBooleanConstraint();
}}),
Optional.empty(),
false
);
}
```
|
The Isaac Holmes Tenement is a pre-Revolutionary house in Charleston, South Carolina. In 1721, Isaac Holmes acquired the parcel upon which 107 Church Street was built. It appears that he built a house on the land, but whatever structure he had built was lost in a fire in 1740 that wiped out many buildings in the area.
The current house was likely built soon after that fire. The house has Georgian interiors similar to those found in the George Eveleigh House and Thomas Rose House.
When Isaac Holmes prepared his will in 1754, the house was being occupied by a family of no apparent relation to Isaac Holmes.
References
Houses in Charleston, South Carolina
|
C. petiti may refer to:
Campephaga petiti, the Petit's cuckoo-shrike, a bird species
Cottus petiti, the chub of Lez, a fish species endemic to France
|
Brad Roberts (born c. 2000) is an American football running back for the Air Force Falcons.
High school
He attended Ralston Valley High School in Arvada, Colorado, receiving first-team All-Colorado honors as a senior.
College career
Roberts enrolled in the United States Air Force Academy in 2019, but did not see game action as a freshman. As a sophomore in 2020, he led Air Force with 461 rushing yards in four games, an average of 115.2 yards per game. He rushed for a career-high 177 yards and three touchdowns against New Mexico on November 20, 2020.
As a junior in 2021, he rushed for 142 yards against New Mexico and added another 140 yards the following week against Wyoming. He finished the 2021 regular season with 1,279 rushing yards, eighth best among all Division I FBS players.
As a senior in 2022, Roberts had 1,425 rushing yards and 14 rushing touchdowns through games played on November 19, 2022. Roberts was named the Mountain West conference's Offensive Player of the Year for 2022.
On April 29, 2023, Roberts was granted permission to delay his service in order to play in the National Football League (NFL).
References
External links
Air Force Falcons bio
Year of birth missing (living people)
Living people
American football running backs
Air Force Falcons football players
People from Arvada, Colorado
Players of American football from Colorado
Military personnel from Colorado
|
```smalltalk
namespace FsaServices.Models;
/// <summary>
/// Model containing source text details.
/// </summary>
public class SourceTextDetails
{
/// <summary>
/// The source text.
/// </summary>
public string source_text { get; set; } = null!;
}
```
|
This One's for Tedi is a studio album by American jazz vocalist Johnny Hartman, released in 1985 by Audiophile Records. It was his final studio recording, made in August 1980, three years before his death. The album is dedicated to Hartman's wife Theodora (Tedi). According to producer George H. Buck Jr., This One's for Tedi "was the first digital recording to be made in Canada."
Reception
Reception for This One's for Tedi has been mostly favorable.
The album "finds the 56-year-old singer still in prime form," writes Scott Yanow at AllMusic. "Hartman is as warm as usual on ballads, and also swings lightly on a few medium-tempo pieces."
Andrew Sussman, critic at Fanfare, called the album "the most satisfying I have heard from him since his landmark LP with John Coltrane. . . . If Mel Torme is the 'Velvet Fog,' then Johnny Hartman was surely pure silk, singing most often through the rain of human tears." Sussman also complimented the musicians, saying "there are no overwhelming jazz soloists here; just a superbly tasteful and sensitive group led by pianist Tony Monte." He praised Hartman's "luxurious baritone voice" on several songs and concludes by saying, "There is even a haunting fresh rendition of 'Send In the Clowns' with a truly singular piano accompaniment by Monte."
Show Music magazine praised the collection of "ten excellent tracks by the ex-Dizzy Gillespie vocalist. Mr. Hartman's rich voice caresses "That's All," "More I Cannot Wish You" ... among other tracks on the album, and more than 'hearing' these songs, you experience them." They also hailed Monte's "sensitive piano accompaniment," Lorne Lofsky's guitar playing, and the "perceptive [liner] notes by Nick Catalano."
Will Friedwald, writing in A Biographical Guide to the Great Jazz and Pop Singers, called This One's for Tedi "a fittingly sentimental dedication to his wife, who at the time of the singer's death in 1983, had been married to him for twenty-six years."
Track listing
Side 1
"That's All" (Bob Haymes, Alan Brandt) – 4:59
"They Can't Take That Away from Me" (George Gershwin, Ira Gershwin) – 3:19
"More I Cannot Wish You" (Frank Loesser) – 3:20
"Wait till You See Her" (Richard Rodgers, Lorenz Hart) – 2:07
"Miss Otis Regrets" (Cole Porter) - 3:51
Side 2
"Then I'll Be Tired Of You" (Yip Harburg, Arthur Schwartz) – 3:36
"It Could Happen to You" (Jimmy Van Heusen, Johnny Burke) – 2:05
"Send In the Clowns" (Stephen Sondheim) – 4:26
"You Stepped Out of a Dream" (Nacio Herb Brown, Gus Kahn) – 2:29
"The Ballad of the Sad Young Men" (Fran Landesman, Tommy Wolf) – 5:28
Recorded August 23, 1980, Grant Avenue Studios, Hamilton, Ontario, Canada.
Personnel
Johnny Hartman - vocals
Lorne Lofsky - guitar
Tony Monte - piano, arranger
Chris Conner - bass
Craig "Buff" Allen - drums
George H. Buck Jr. - producer
Bill Garrett - co-producer
David Dobbs - co-producer, engineer
Nick Catalano - liner notes
References
1985 albums
Johnny Hartman albums
|
```objective-c
//
// AMapSearchServices.h
// AMapSearchKit
//
// Created by xiaoming han on 15/6/18.
//
#import <Foundation/Foundation.h>
@interface AMapServices : NSObject
+ (AMapServices *)sharedServices;
/**
* APIkeykeybundle id
*/
@property (nonatomic, copy) NSString *apiKey;
/**
* HTTPSNO
* keyiOS9 SSL
*/
@property (nonatomic, assign) BOOL enableHTTPS;
/**
* YES,
* SDKSDK
* NSUncaughtExceptionHandlerAPPSDKNSUncaughtExceptionHandler AMapServices NSUncaughtExceptionHandlerhandlerhandlerhandler
*/
@property (nonatomic, assign) BOOL crashReportEnabled;
@end
```
|
Thomas Arnold Anderson (October 21, 1871 – 1939) was a farmer and political figure in Saskatchewan. He represented Last Mountain in the Legislative Assembly of Saskatchewan from 1908 to 1912 as a Provincial Rights Party member.
He was born in Torbolton, Carleton County, Ontario (now Ottawa, Ontario), the son of John Anderson and Sarah Rebecca Arnold. In 1905, Anderson married Alice Gertrude Simpson. He lived in Earl Grey, Saskatchewan.
References
1871 births
1939 deaths
Saskatchewan Provincial Rights Party MLAs
|
```c
/*
* wiiuse
*
* Written By:
* Michael Laforest < para >
* Email: < thepara (--AT--) g m a i l [--DOT--] com >
*
*
* This file is part of wiiuse.
*
* This program is free software; you can redistribute it and/or modify
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
*
* along with this program. If not, see <path_to_url
*
* $Header$
*
*/
#pragma warning(disable:4206)
#if defined __APPLE__
//#include "os.h"
#ifdef __MACH__
#include <mach/clock.h>
#include <mach/mach.h>
#endif
unsigned long wiiuse_os_ticks() {
struct timespec
{
unsigned int tv_sec; /* seconds */
clock_res_t tv_nsec; /* nanoseconds */
}ts;
clock_serv_t cclock;
mach_timespec_t mts;
host_get_clock_service(mach_host_self(), CALENDAR_CLOCK, &cclock);
clock_get_time(cclock, &mts);
mach_port_deallocate(mach_task_self(), cclock);
ts.tv_sec = mts.tv_sec;
ts.tv_nsec = mts.tv_nsec;
unsigned long ms = 1000 * ts.tv_sec + ts.tv_nsec / 1e6;
return ms;
}
#endif
```
|
The 1996 Indiana gubernatorial Election was held on November 5, 1996, alongside the election of both houses of the Indiana General Assembly. Incumbent Governor Evan Bayh, a Democrat, was ineligible to run for a third consecutive term due to term limits established by the Indiana Constitution. He was succeeded by Lt. Governor Frank O'Bannon, who won election over Republican Stephen Goldsmith with 52% of the vote.
Primaries
Democratic Party
Candidates
Lt. Governor Frank O'Bannon
O'Bannon was unchallenged in his party's primary, winning the Democratic nomination unanimously. He chose South Bend Mayor Joe Kernan to be his running mate.
Republican Party
Candidates
Mayor of Indianapolis and nominee for Lieutenant Governor in 1988 Stephen Goldsmith
Former Marine Sergeant Rex Early
George Witwer
Declined
Former Vice President of the United States Dan Quayle
With Governor Evan Bayh unable to seek another term in office, Indiana Republicans felt confident in their ability to take the Governor's Mansion in the general election. Of the three candidates for the nomination, the front-runner by far was Indianapolis Mayor Stephen Goldsmith. Goldsmith was by far the favorite for the nomination throughout the race, in some polls leading by as much as 20 points. The race was particularly heated: Indiana Republican Party Chairman Michael McDaniel, hoping to avoid alienating any voters, declined to endorse a candidate, instead hanging a Swiss flag in his office to symbolize his neutrality.
Goldsmith easily won the primary. Goldsmith endorsed no candidate for lieutenant governor, and Republican state convention delegates chose Witwer as his running mate.
Libertarian Party
Candidates
Steve Dillon
The Libertarian Party nominated Steve Dillon as their second candidate to contest the Indiana governorship.
Dillon's running mate was Leona McPherson.
General election
The only Great Lakes state to have a Democratic Governor going into the 1996 elections, Indiana became the center of the Republican Party's attention in that year's gubernatorial elections. A traditionally Republican state, Goldsmith and his party were considered to have the edge in the election. That changed, however, when questions about Goldsmith's performance as Mayor of Indianapolis surfaced, specifically regarding an August 27 brawl in the city involving several drunken policemen. Goldsmith's campaign was further hurt when it was revealed that several comments made about O'Bannon's record as part of the Indiana state government had been statistically incorrect. The effect of these gaffes was to erase the double digit lead Goldsmith had enjoyed throughout the summer, leaving him narrowly trailing O'Bannon.
O'Bannon, meanwhile, was able to take credit for a thriving economy and a recent tax surplus that had occurred during Bayh's administration. The Democrat centered his campaign on his record in the Indiana State Senate, simultaneously attacking Goldsmith for controversial decisions made during his tenure as Mayor of Indianapolis. By running what was later described as a "steady" campaign, O'Bannon was able to refute many of the charges Goldsmith brought against him while keeping the pressure on. Even so, the race remained tight down to election night, and Goldsmith reportedly settled in on November 5 expecting to be elected.
Results
O'Bannon won the election narrowly, carrying 52% of the vote to Goldsmith's 47%.
References
1996
Gubernatorial
Indiana
|
Clio (pronounced CLY-oh) is a town in Marlboro County, South Carolina, United States. The population was 726 at the 2010 census. Marlboro School of Discovery is a magnet school in Clio, South Carolina and is part of the Marlboro County School District.
History
The Clio Historic District, McLaurin House, and McLaurin-Roper-McColl Farmstead are listed on the National Register of Historic Places.
Geography
Clio is located at (34.579921, -79.543401).
According to the United States Census Bureau, the town has a total area of , all land.
Demographics
As of the census of 2000, there were 774 people, 302 households, and 192 families residing in the town. The population density was . There were 339 housing units at an average density of . The racial makeup of the town was 36.05% White, 57.11% African American, 6.20% Native American, 0.13% from other races, and 0.52% from two or more races. Hispanic or Latino of any race were 0.52% of the population.
There were 302 households, out of which 26.8% had children under the age of 18 living with them, 34.1% were married couples living together, 25.5% had a female householder with no husband present, and 36.1% were non-families. 33.8% of all households were made up of individuals, and 15.6% had someone living alone who was 65 years of age or older. The average household size was 2.56 and the average family size was 3.30.
In the town, the population was spread out, with 27.0% under the age of 18, 6.7% from 18 to 24, 26.4% from 25 to 44, 26.2% from 45 to 64, and 13.7% who were 65 years of age or older. The median age was 37 years. For every 100 females, there were 84.3 males. For every 100 females age 18 and over, there were 74.9 males.
The median income for a household in the town was $25,313, and the median income for a family was $31,875. Males had a median income of $26,364 versus $18,092 for females. The per capita income for the town was $14,215. About 23.0% of families and 28.9% of the population were below the poverty line, including 39.1% of those under age 18 and 21.3% of those age 65.
References
External links
Towns in Marlboro County, South Carolina
Towns in South Carolina
|
Kvant ( for "quantum") is a popular science magazine in physics and mathematics for school students and teachers, issued in print between 1970 and 2011. The magazine became an online-only publication in 2011. Translation of selected articles from Kvant had been published in Quantum Magazine in 1990–2001, which in turn had been translated and published in Greece in 1994–2001.
History
Kvant was started as a joint project of the USSR Academy of Sciences and USSR Academy of Pedagogical Sciences. In Soviet time, it was published by Nauka publisher with circulation about 200,000.
The idea of the magazine was introduced by Pyotr Kapitsa. Its first chief editors were physicist Isaak Kikoin and mathematician Andrei Kolmogorov. In 1985, its editorial board had 18 Academicians and Corresponding Members of the USSR Academy of Sciences and USSR Academy of Pedagogical Sciences, 14 Doctors of Sciences and 20 Candidates of Science.
The last print issue of Kvant was published at the beginning of 2011. Then the print edition was closed making the magazine an online publication.
Availability
All published issues of Kvant were freely available online.
Translations
Quantum Magazine
Quantum Magazine was a US-based bimonthly magazine published by the National Science Teachers Association (NSTA) from 1990 to 2001. Some of its articles were translations from Kvant.
Kvant Selecta
In 1999, American Mathematical Society published translation of selected articles from Kvant on algebra and mathematical analysis as two volumes in the Mathematical World series. Yet another volume, published in 2002, included translation of selected articles on combinatorics.
Other translations
There were two books with selected articles from Kvant published in France by Jean-Michel Kantor
References
External links
Kvant archive website
Kvant website
The official website of Quantum Magazine
The Greek version of Quantum Magazine.
1970 establishments in the Soviet Union
2011 disestablishments in Russia
Education in the Soviet Union
Education magazines
Magazines established in 1970
Magazines disestablished in 2011
Magazines published in Moscow
Magazines published in the Soviet Union
Online magazines with defunct print editions
Russian-language magazines
Science education materials
Science and technology in the Soviet Union
Science and technology magazines published in Russia
|
Elliot T. Anderson (born November 15, 1982, in Marshfield, Wisconsin) is an American politician who formerly represented District 15 as a Democratic member in the Nevada Assembly from 2011 to 2019.
Education
Anderson earned his BA from UNLV and his JD from the William S. Boyd School of Law at UNLV.
Mr. Anderson is a licensed attorney in Nevada.
Elections
2012 Anderson won the June 12, 2012 Democratic Primary with 1,632 votes (84.34%) against former Assemblyman Lou Toumin and won the November 6, 2012 General election with 11,809 votes (72.05%) against Republican nominee Megan Heryet.
2010 When Democratic Assemblywoman Kathy McClain ran for Nevada Senate and left the House District 15 seat open, Anderson won the four-way June 8, 2010 Democratic Primary with 1,108 votes (45.80%) in a field which included former Assemblyman Lou Toomin, and won the November 2, 2010 General election with 6,760 votes (62.63%) against Republican nominee Dale Snyder and Independent American candidate Stan Vaughan; Snyder had run for the seat in 2008, and Vaughan had run for Nevada Legislature seats in 2004, 2006, and 2008.
References
External links
Official page at the Nevada Legislature
Campaign site
Biography at Ballotpedia
Financial information (state office) at the National Institute for Money in State Politics
1982 births
Living people
Democratic Party members of the Nevada Assembly
Politicians from the Las Vegas Valley
People from Marshfield, Wisconsin
United States Marines
University of Nevada, Las Vegas alumni
William S. Boyd School of Law alumni
21st-century American politicians
|
The following is a list of land border crossings of Azerbaijan, including both highway and rail crossings.
References
Azerbaijan
|
```python
from _Alias import *
```
|
The James Madison Dukes men's basketball statistical leaders are individual statistical leaders of the James Madison Dukes men's basketball program in various categories, including points, rebounds, assists, steals, and blocks. Within those areas, the lists identify single-game, single-season, and career leaders. The Dukes represent James Madison University in the NCAA Division I Sun Belt Conference.
James Madison began competing in intercollegiate men's basketball in 1969, when the school was known as Madison College; the current university name was adopted in 1976. The NCAA did not officially record assists as a stat until the 1983–84 season, and blocks and steals until the 1985–86 season, but JMUs record books include players in these stats before these seasons. These lists are updated through the end of the 2021–22 season.
Scoring
Rebounds
Assists
Steals
Blocks
References
Lists of college basketball statistical leaders by team
Statistical
|
The Barun River () is a tributary of the Arun River and is part of the Kosi river system in Nepal.
Koshi River System
The Koshi or Sapta Koshi drains eastern Nepal. It is known as Sapta Koshi because of the seven rivers which join together in east-central Nepal to form this river. The main rivers forming the Kosi system are – the Sun Kosi River, the Indravati River, the Bhote Koshi, the Dudh Kosi, the Arun River, Barun River, and Tamor River. The combined river flows through the Chatra Gorge in a southerly direction to emerge from the hills.
Course
The Barun River originates from the Barun glacier at the base of Makalu, one of the eight-thousanders. The river freezes in winter and in summer outburst floods in the Barun valley are inevitable but should lose much of their power and sediment passing through two broad flat areas.
The Barun is known as Chukchuwa in local Kirat language. Studies have shown that this place had been initially habituated by Yakkha and Limbu .
Bird watching
The Upper Barun Valley is among the richest for birds in Nepal. It is virtually untouched by man. Birdwatchers have rarely visited the region because it is not easily accessible. There are no trekkers lodges within Makalu-Barun National Park. There is one small tea house at Langmale (near the Base Camp) run by a third-generation native of the upper Barun Valley. In an effort to control and consolidate the impacts of camping, the pitching of tents is only allowed in designated campsites.
References
Rivers of Koshi Province
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.