text stringlengths 1 22.8M |
|---|
```c++
/*******************************************************************************
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*******************************************************************************/
#include <compiler/ir/easy_build.hpp>
#include <compiler/ir/ir_comparer.hpp>
#include <compiler/ir/ir_module.hpp>
#include <compiler/ir/pass/dependency_analyzer.hpp>
#include <compiler/ir/sc_stmt.hpp>
#include <compiler/ir/transform/dead_write_eliminate.hpp>
#include <compiler/ir/viewer.hpp>
#include <iostream>
#include "gtest/gtest.h"
using namespace dnnl::impl::graph::gc;
using dependency_analysis::stmt_weak_set;
namespace ut {
using namespace dnnl::impl::graph::gc;
class dep_printer_t : public ir_viewer_t {
void view(assign_c v) override {
std::cout << "IR=" << v << "\ndepended by:\n";
auto &dep = dependency_analysis::get_dep_info(v.get());
for (auto v : dep.depended_by_) {
auto ptr = v.lock();
assert(ptr);
std::cout << '\t' << ptr.get() << '\n';
}
std::cout << "depending on:\n";
for (auto v : dep.depends_on_) {
auto ptr = v.lock();
assert(ptr);
std::cout << '\t' << ptr.get() << '\n';
}
}
};
} // namespace ut
static std::shared_ptr<stmt_base_t> get_builder_top() {
return builder::get_current_builder()
->get_current_scope()
.as_seq()
.back()
.impl;
}
static void check_dep(const std::shared_ptr<stmt_base_t> &ptr,
const stmt_weak_set &depended_by, const stmt_weak_set &depends_on) {
auto &dep = dependency_analysis::get_dep_info(ptr.get());
bool result = dep.depended_by_ == depended_by;
if (!result) { std::cout << "depended_by failed:" << ptr.get() << "\n"; }
EXPECT_TRUE(result);
result = dep.depends_on_ == depends_on;
if (!result) { std::cout << "depends_on failed:" << ptr.get() << "\n"; }
EXPECT_TRUE(result);
}
#define SAVE(v) v = get_builder_top();
TEST(GCCore_CPU_dependency_analyzer, TestDependency) {
builder::ir_builder_t builder;
std::shared_ptr<stmt_base_t> b_eq_3, c_eq_3, c_eq_4, c_eq_5, bc_eq_ab,
bc_eq_2, c_eq_bb, ab_eq_3, if_else_s, c_eq_ab, t_eq_ai, ai_eq_t,
loop_i;
_function_(datatypes::void_t, ccc, _arg_("A", datatypes::f32, {10000}),
_arg_("b", datatypes::s32)) {
_bind_(A, b);
_tensor_(B, datatypes::f32, 100);
_tensor_(D, datatypes::f32, 100);
b = 3;
SAVE(b_eq_3);
_var_(c, datatypes::s32);
c = 3;
SAVE(c_eq_3);
_if_(b == 2) {
c = 4;
SAVE(c_eq_4);
}
_else_ {
c = 5;
SAVE(c_eq_5);
}
SAVE(if_else_s);
B[c] = A[b];
SAVE(bc_eq_ab);
_for_(i, 0, 10) {
B[c] = 2;
SAVE(bc_eq_2);
c = B[b];
SAVE(c_eq_bb);
A[b] = 3;
SAVE(ab_eq_3);
c = A[b];
SAVE(c_eq_ab);
}
_for_(i, 0, 10) {
_var_(t, datatypes::s32);
t = D[i];
SAVE(t_eq_ai);
D[i] = t + 1;
SAVE(ai_eq_t);
}
SAVE(loop_i);
}
dependency_analyzer_t ana;
ana(ccc);
// ut::dep_printer_t p;
// p.dispatch(ccc);
check_dep(b_eq_3, {c_eq_ab, if_else_s, ab_eq_3, c_eq_bb, bc_eq_ab}, {});
check_dep(c_eq_3, {c_eq_bb, bc_eq_2, bc_eq_ab, c_eq_4, c_eq_5}, {});
check_dep(c_eq_4, {c_eq_bb, bc_eq_2, bc_eq_ab}, {c_eq_3});
check_dep(c_eq_5, {c_eq_bb, bc_eq_2, bc_eq_ab}, {c_eq_3});
check_dep(bc_eq_ab, {c_eq_ab, c_eq_bb, bc_eq_2, ab_eq_3},
{b_eq_3, c_eq_5, c_eq_3, c_eq_4});
check_dep(bc_eq_2, {c_eq_bb}, {c_eq_bb, bc_eq_ab, c_eq_5, c_eq_3, c_eq_4});
check_dep(c_eq_bb, {c_eq_ab, bc_eq_2},
{bc_eq_2, bc_eq_ab, c_eq_5, c_eq_3, c_eq_4, b_eq_3});
check_dep(ab_eq_3, {c_eq_ab}, {b_eq_3, bc_eq_ab, c_eq_ab});
check_dep(c_eq_ab, {ab_eq_3}, {ab_eq_3, bc_eq_ab, c_eq_bb, b_eq_3});
check_dep(t_eq_ai, {ai_eq_t}, {loop_i});
check_dep(ai_eq_t, {}, {loop_i, t_eq_ai});
}
TEST(GCCore_CPU_dead_write_elimination, TestDWE) {
builder::ir_builder_t builder;
auto mod = std::make_shared<ir_module_t>(get_default_context());
_global_tensor_(mod, G, datatypes::f32, 100);
_function_(datatypes::f32, ccc, _arg_("A", datatypes::f32, {10000})) {
_bind_(A);
_tensor_(B, datatypes::f32, 100);
_tensor_(C, datatypes::f32, 100);
_tensor_(D, datatypes::f32, 100);
_tensor_(E, datatypes::f32, 100);
// constant index, required by the code in the loop
C[1] = 1.0f;
_for_(i, 0, 100) {
_var_(t, datatypes::f32);
_var_(t2, datatypes::f32);
_for_(j, 0, 100) {
t = D[j];
D[j] = t + 1;
}
t2 = B[i];
t = t + A[i] + G[i];
t = t * t2;
A[i] = C[1];
G[i] = t;
B[i] = t;
// constant index, dead write
C[0] = 1.0f;
// constant index, required by the code after the loop
C[2] = 1.0f;
// constant index, overlap with SIMD load
C[5] = 1.0f;
}
_for_(i, 0, 100) {
_var_(t, datatypes::f32);
t = E[i];
t = t + 1;
E[i] = t;
}
_return_(C[2] + builder::make_reduce_add(C[span_t {{4}, 4}]));
}
dead_write_eliminator_t dwe;
auto out = dwe(ccc);
_function_(datatypes::f32, expected, _arg_("A", datatypes::f32, {10000})) {
_bind_(A);
_tensor_(B, datatypes::f32, 100);
_tensor_(C, datatypes::f32, 100);
_tensor_(D, datatypes::f32, 100);
_tensor_(E, datatypes::f32, 100);
C[1] = 1.0f;
_for_(i, 0, 100) {
_var_(t, datatypes::f32);
_var_(t2, datatypes::f32);
_for_(j, 0, 100) {
t = D[j];
D[j] = t + 1;
}
t2 = B[i];
t = t + A[i] + G[i];
t = t * t2;
A[i] = C[1];
G[i] = t;
builder.push_scope();
builder.emit(builder.pop_scope());
builder.push_scope();
builder.emit(builder.pop_scope());
C[2] = 1.0f;
// constant index, overlap with SIMD load
C[5] = 1.0f;
}
_for_(i, 0, 100) {
_var_(t, datatypes::f32);
t = E[i];
t = t + 1; // successful elimination
builder.push_scope();
builder.emit(builder.pop_scope());
}
_return_(C[2] + builder::make_reduce_add(C[span_t {{4}, 4}]));
}
ir_comparer cmper;
EXPECT_TRUE(cmper.compare(out, expected));
}
TEST(GCCore_CPU_dead_write_elimination, TestDWELoopIndependent) {
builder::ir_builder_t builder;
_function_(datatypes::f32, ccc, _arg_("A", datatypes::f32, {10000})) {
_bind_(A);
_tensor_(B, datatypes::f32, 100);
_var_(tid, datatypes::f32);
tid = 122;
B[tid] = 1.0f;
_for_(i, 0, 100) {
_var_(t, datatypes::f32);
t = B[tid];
_if_(t == 1.0f) {
_var_(t2, datatypes::f32);
t2 = 2.0f;
B[tid] = t2;
}
}
_return_(0);
}
dead_write_eliminator_t dwe;
auto out = dwe(ccc);
EXPECT_TRUE(out == ccc);
}
``` |
Joseph Schubert (24 June 1890 – 4 April 1969) was a Romanian cleric and a titular bishop of the Roman Catholic Church.
Biography
Born to an ethnic German family in Bucharest, he studied theology at Innsbruck, becoming doctor of theology and being ordained a priest in 1916. After returning to Romania, he was assigned as parish priest in Caramurat, and in 1931 as a priest attached to the Bucharest cathedral. He also taught at the theological seminary in his native city. Following the 1949 arrest of Anton Durcovici by the authorities of the new Communist regime, he was made Apostolic Administrator of the Roman Catholic Archdiocese of Bucharest, being consecrated titular bishop of Ceramus by Gerald Patrick O'Hara in June 1950. Arrested in February 1951, he was sentenced to hard labor for life and freed in August 1964. Sighet prison was among the places where he was incarcerated. Forced to reside at first in Timişu de Sus, he was under constant surveillance from agents of the Religious Affairs Department. In January 1969 he was allowed to emigrate to Western Europe, meeting Pope Paul VI the following month and dying in Munich in April.
It was Schubert who consecrated Alexandru Todea bishop in 1950. Prior to leaving Romania, he transferred his administrative duties to Iosif Gonciu, who in turn left them to Ioan Robu in 1983.
See also
Notes
References
Mircea Birtz and Manfred Kierein, Alte fărâme din prescura prigoanei (1948-1989). Editura Napoca Star, Cluj-Napoca, 2010,
Further reading
William Totok,
„Der vergessene stalinistische Schauprozess gegen die »Spione des Vatikans« in Rumänien 1951“, in: Jahrbuch für Historische Kommunismusforschung 2005, Hg. von Hermann Weber, Ulrich Mählert, Bernhard H. Bayerlein u.a., Aufbau Verlag, Berlin 2005, S. 233-259.
„Der Bischof, Hitler und die Securitate. Der stalinistische Schauprozess gegen die so genannten »Spione des Vatikans«„, 1951 in Bukarest" (I-VII), in: Halbjahresschrift für südosteuropäosche Geschichte, Literatur und Politik, 17.-20. Jg. 2005-2008.
Episcopul, Hitler și Securitatea - Procesul stalinist împotriva »spionilor Vaticanului« din România, Editura Polirom, Iași, 2008.
1890 births
1969 deaths
Clergy from Bucharest
Romanian people of German descent
20th-century Roman Catholic titular bishops
Romanian anti-communist clergy
Romanian prisoners and detainees
People detained by the Securitate
Inmates of Sighet prison
20th-century Roman Catholic bishops in Romania |
No Blood Spilled is a novel by Les Daniels published by TOR in 1991, and by Raven in 1996.
Plot summary
No Blood Spilled is a novel which continues the story of vampire Sebastian Newcastle, in which his enemy Reginald Callender follows him from England to colonial India to destroy him.
Reception
Gideon Kibblewhite reviewed No Blood Spilled for Arcane magazine, rating it a 4 out of 10 overall. Kibblewhite comments that "Enjoyable this may be, but it certainly isn't very creepy, and if Daniels intended it to be light-hearted it doesn't make up for the rather cheesy ending. It spirals into a Holmes-versus-Moriarty affair that makes pleasant, but on the whole, unremarkable entertainment."
Reviews
Review by Algis Budrys (1991) in The Magazine of Fantasy & Science Fiction, July 1991
References
1991 American novels
Tor Books books |
```shell
Proxifying `ssh` connections
How to clear `iptables` rules
Find services running on your host
Disable `IPv6`
Get real network statistics with `slurm`
``` |
Dave Hunt (August 2, 1942 – March 5, 2017) was an American comic book artist and fine art painter. Most active during the "Bronze Age" of American comics, he did inking for both DC and Marvel comics and Disney's comics. He was also an accomplished hyperrealist painter.
Career
Beginning in 1972, he worked as an inker for Marvel Comics, assisting Mike Esposito and Frank Giacoia. He inked artists including John Byrne and Ross Andru, working on titles such as The Amazing Spider-Man, Captain America and the Fantastic Four.
Hunt was the co-inker, with Frank Giacoia, of the first appearance of the Punisher in The Amazing Spider-Man #129 (Feb. 1974). In 1978 Hunt began working for DC, where he worked with Superman pencilers Curt Swan and Kurt Schaffenberger and other artists on Superboy and the Legion of Super-Heroes, Wonder Woman, and DC Comics Presents. In the 1980s, he worked with penciler José Delbo on Marvel's Transformers comics. Beginning in 1991 he worked for Disney, on titles such as The Little Mermaid, Darkwing Duck, and Beauty and the Beast. In the mid 1990s he inked Mr. Hero the Newmatic Man for Tekno Comix. He worked on Scooby-Doo comics for DC from 1999 to 2005. Other pencilers he worked with include John Romita, Gil Kane, George Tuska, Sal Buscema, Tom Morgan, Keith Giffen, George Pérez, Jim Mooney, Don Newton, Jimmy Janes, and Keith Pollard.
Death
Hunt died on March 5, 2017, of complications from cancer.
References
External links
1942 births
2017 deaths
American comics creators
Deaths from cancer in New Jersey
Artists from Newark, New Jersey |
Takiora Ingram is a senior governmental policy advisor on marine conservation from the Cook Islands.
Early life
Ingram was born in Rarotonga. Her mother was Poko Ingram, who was the first woman elected to the Cook Islands Legislative Assembly in 1961. She completed a B.A. in Anthropology, with High Honors, and an M.A. in Urban and Regional Planning at the University of Hawaiʻi. In 1990 she completed a PhD at Massey University, New Zealand, in business management and public policy. Her thesis was supervised by Ngātata Love, Tony Vitalis and Rae Weston.
Career
Ingram's career has been focused on marine conservation. In the 1980s she worked at the Pacific Islands Forum in Fiji on regional tourism developments. From 1990 to 2004 she served as a senior policy advisor to the governments of the Cook Islands (General Licensing Authority), New Zealand (Te Puni Kokiri), and New South Wales (Department of Community Services). From 2006 to July 2013, Ingram worked for the U.S. National Oceanographic and Atmospheric Administration (NOAA) serving as Executive Director of the All Islands Coral Reef Committee (AIC) Secretariat based in Honolulu, Hawaii.
Community activities
On returning to the Cook Islands from her studies in New Zealand, Ingram approached other professional women and proposed they join together to form a women's organisation to focus on issues of women's rights, domestic violence, health, equality and the importance of a female political voice. The group has evolved into the present-day Cook Island Business and Professional Women's Association (CIBPW). In 1993 Ingram withdrew from her involvement with CIBPW to serve as the founding president of Punanga Tauturu, an organisation which provides counselling support and legal services to women and children in domestic violence situations.
Ingram has also been a strong advocate and supporter of the arts and culture of the Cook Islands. She was Chair of the Pacific Islands Arts Committee of Creative New Zealand from 1996 to 2000 and President of the Pacific Wave Association in Sydney, Australia from 2001 to 2005. She was the founding director of the Pacific Writers’ Connection and has organised annual creative/environmental writing workshops for adults, and an annual environmental writing competition for children.
Recognition
In 2013, Ingram received an 'Oceania Star' award from the University of Hawaiʻi Pacific Business Center Program, an award which recognises the contributions of women in the Pacific islands. Ingram has also received an award from the U.S. Coral Reef Task Force for her service.
References
Living people
Year of birth missing (living people)
Massey University alumni
University of Hawaiʻi at Mānoa alumni
People from Rarotonga
Cook Island environmentalists
Marine conservation
Cook Island women |
```shell
#!/bin/bash -e
on_chroot << EOF
SUDO_USER="${FIRST_USER_NAME}" raspi-config nonint do_wayland W2
EOF
``` |
```c
/* $Id: tif_fax3.c,v 1.74 2012-06-21 02:01:31 fwarmerdam Exp $ */
/*
*
* Permission to use, copy, modify, distribute, and sell this software and
* its documentation for any purpose is hereby granted without fee, provided
* that (i) the above copyright notices and this permission notice appear in
* all copies of the software and related documentation, and (ii) the names of
* Sam Leffler and Silicon Graphics may not be used in any advertising or
* publicity relating to the software without the specific, prior written
* permission of Sam Leffler and Silicon Graphics.
*
* THE SOFTWARE IS PROVIDED "AS-IS" AND WITHOUT WARRANTY OF ANY KIND,
* EXPRESS, IMPLIED OR OTHERWISE, INCLUDING WITHOUT LIMITATION, ANY
* WARRANTY OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.
*
* IN NO EVENT SHALL SAM LEFFLER OR SILICON GRAPHICS BE LIABLE FOR
* ANY SPECIAL, INCIDENTAL, INDIRECT OR CONSEQUENTIAL DAMAGES OF ANY KIND,
* OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
* WHETHER OR NOT ADVISED OF THE POSSIBILITY OF DAMAGE, AND ON ANY THEORY OF
* LIABILITY, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE
* OF THIS SOFTWARE.
*/
#include "tiffiop.h"
#ifdef CCITT_SUPPORT
/*
* TIFF Library.
*
* CCITT Group 3 (T.4) and Group 4 (T.6) Compression Support.
*
* This file contains support for decoding and encoding TIFF
* compression algorithms 2, 3, 4, and 32771.
*
* Decoder support is derived, with permission, from the code
* in Frank Cringle's viewfax program;
*/
#include "tif_fax3.h"
#define G3CODES
#include "t4.h"
#include <stdio.h>
/*
* Compression+decompression state blocks are
* derived from this ``base state'' block.
*/
typedef struct {
int rw_mode; /* O_RDONLY for decode, else encode */
int mode; /* operating mode */
tmsize_t rowbytes; /* bytes in a decoded scanline */
uint32 rowpixels; /* pixels in a scanline */
uint16 cleanfaxdata; /* CleanFaxData tag */
uint32 badfaxrun; /* BadFaxRun tag */
uint32 badfaxlines; /* BadFaxLines tag */
uint32 groupoptions; /* Group 3/4 options tag */
TIFFVGetMethod vgetparent; /* super-class method */
TIFFVSetMethod vsetparent; /* super-class method */
TIFFPrintMethod printdir; /* super-class method */
} Fax3BaseState;
#define Fax3State(tif) ((Fax3BaseState*) (tif)->tif_data)
typedef enum { G3_1D, G3_2D } Ttag;
typedef struct {
Fax3BaseState b;
/* Decoder state info */
const unsigned char* bitmap; /* bit reversal table */
uint32 data; /* current i/o byte/word */
int bit; /* current i/o bit in byte */
int EOLcnt; /* count of EOL codes recognized */
TIFFFaxFillFunc fill; /* fill routine */
uint32* runs; /* b&w runs for current/previous row */
uint32* refruns; /* runs for reference line */
uint32* curruns; /* runs for current line */
/* Encoder state info */
Ttag tag; /* encoding state */
unsigned char* refline; /* reference line for 2d decoding */
int k; /* #rows left that can be 2d encoded */
int maxk; /* max #rows that can be 2d encoded */
int line;
} Fax3CodecState;
#define DecoderState(tif) ((Fax3CodecState*) Fax3State(tif))
#define EncoderState(tif) ((Fax3CodecState*) Fax3State(tif))
#define is2DEncoding(sp) (sp->b.groupoptions & GROUP3OPT_2DENCODING)
#define isAligned(p,t) ((((size_t)(p)) & (sizeof (t)-1)) == 0)
/*
* Group 3 and Group 4 Decoding.
*/
/*
* These macros glue the TIFF library state to
* the state expected by Frank's decoder.
*/
#define DECLARE_STATE(tif, sp, mod) \
static const char module[] = mod; \
Fax3CodecState* sp = DecoderState(tif); \
int a0; /* reference element */ \
int lastx = sp->b.rowpixels; /* last element in row */ \
uint32 BitAcc; /* bit accumulator */ \
int BitsAvail; /* # valid bits in BitAcc */ \
int RunLength; /* length of current run */ \
unsigned char* cp; /* next byte of input data */ \
unsigned char* ep; /* end of input data */ \
uint32* pa; /* place to stuff next run */ \
uint32* thisrun; /* current row's run array */ \
int EOLcnt; /* # EOL codes recognized */ \
const unsigned char* bitmap = sp->bitmap; /* input data bit reverser */ \
const TIFFFaxTabEnt* TabEnt
#define DECLARE_STATE_2D(tif, sp, mod) \
DECLARE_STATE(tif, sp, mod); \
int b1; /* next change on prev line */ \
uint32* pb /* next run in reference line */\
/*
* Load any state that may be changed during decoding.
*/
#define CACHE_STATE(tif, sp) do { \
BitAcc = sp->data; \
BitsAvail = sp->bit; \
EOLcnt = sp->EOLcnt; \
cp = (unsigned char*) tif->tif_rawcp; \
ep = cp + tif->tif_rawcc; \
} while (0)
/*
* Save state possibly changed during decoding.
*/
#define UNCACHE_STATE(tif, sp) do { \
sp->bit = BitsAvail; \
sp->data = BitAcc; \
sp->EOLcnt = EOLcnt; \
tif->tif_rawcc -= (tmsize_t)((uint8*) cp - tif->tif_rawcp); \
tif->tif_rawcp = (uint8*) cp; \
} while (0)
/*
* Setup state for decoding a strip.
*/
static int
Fax3PreDecode(TIFF* tif, uint16 s)
{
Fax3CodecState* sp = DecoderState(tif);
(void) s;
assert(sp != NULL);
sp->bit = 0; /* force initial read */
sp->data = 0;
sp->EOLcnt = 0; /* force initial scan for EOL */
/*
* Decoder assumes lsb-to-msb bit order. Note that we select
* this here rather than in Fax3SetupState so that viewers can
* hold the image open, fiddle with the FillOrder tag value,
* and then re-decode the image. Otherwise they'd need to close
* and open the image to get the state reset.
*/
sp->bitmap =
TIFFGetBitRevTable(tif->tif_dir.td_fillorder != FILLORDER_LSB2MSB);
if (sp->refruns) { /* init reference line to white */
sp->refruns[0] = (uint32) sp->b.rowpixels;
sp->refruns[1] = 0;
}
sp->line = 0;
return (1);
}
/*
* Routine for handling various errors/conditions.
* Note how they are "glued into the decoder" by
* overriding the definitions used by the decoder.
*/
static void
Fax3Unexpected(const char* module, TIFF* tif, uint32 line, uint32 a0)
{
TIFFErrorExt(tif->tif_clientdata, module, "Bad code word at line %u of %s %u (x %u)",
line, isTiled(tif) ? "tile" : "strip",
(isTiled(tif) ? tif->tif_curtile : tif->tif_curstrip),
a0);
}
#define unexpected(table, a0) Fax3Unexpected(module, tif, sp->line, a0)
static void
Fax3Extension(const char* module, TIFF* tif, uint32 line, uint32 a0)
{
TIFFErrorExt(tif->tif_clientdata, module,
"Uncompressed data (not supported) at line %u of %s %u (x %u)",
line, isTiled(tif) ? "tile" : "strip",
(isTiled(tif) ? tif->tif_curtile : tif->tif_curstrip),
a0);
}
#define extension(a0) Fax3Extension(module, tif, sp->line, a0)
static void
Fax3BadLength(const char* module, TIFF* tif, uint32 line, uint32 a0, uint32 lastx)
{
TIFFWarningExt(tif->tif_clientdata, module, "%s at line %u of %s %u (got %u, expected %u)",
a0 < lastx ? "Premature EOL" : "Line length mismatch",
line, isTiled(tif) ? "tile" : "strip",
(isTiled(tif) ? tif->tif_curtile : tif->tif_curstrip),
a0, lastx);
}
#define badlength(a0,lastx) Fax3BadLength(module, tif, sp->line, a0, lastx)
static void
Fax3PrematureEOF(const char* module, TIFF* tif, uint32 line, uint32 a0)
{
TIFFWarningExt(tif->tif_clientdata, module, "Premature EOF at line %u of %s %u (x %u)",
line, isTiled(tif) ? "tile" : "strip",
(isTiled(tif) ? tif->tif_curtile : tif->tif_curstrip),
a0);
}
#define prematureEOF(a0) Fax3PrematureEOF(module, tif, sp->line, a0)
#define Nop
/*
* Decode the requested amount of G3 1D-encoded data.
*/
static int
Fax3Decode1D(TIFF* tif, uint8* buf, tmsize_t occ, uint16 s)
{
DECLARE_STATE(tif, sp, "Fax3Decode1D");
(void) s;
if (occ % sp->b.rowbytes)
{
TIFFErrorExt(tif->tif_clientdata, module, "Fractional scanlines cannot be read");
return (-1);
}
CACHE_STATE(tif, sp);
thisrun = sp->curruns;
while (occ > 0) {
a0 = 0;
RunLength = 0;
pa = thisrun;
#ifdef FAX3_DEBUG
printf("\nBitAcc=%08X, BitsAvail = %d\n", BitAcc, BitsAvail);
printf("-------------------- %d\n", tif->tif_row);
fflush(stdout);
#endif
SYNC_EOL(EOF1D);
EXPAND1D(EOF1Da);
(*sp->fill)(buf, thisrun, pa, lastx);
buf += sp->b.rowbytes;
occ -= sp->b.rowbytes;
sp->line++;
continue;
EOF1D: /* premature EOF */
CLEANUP_RUNS();
EOF1Da: /* premature EOF */
(*sp->fill)(buf, thisrun, pa, lastx);
UNCACHE_STATE(tif, sp);
return (-1);
}
UNCACHE_STATE(tif, sp);
return (1);
}
#define SWAP(t,a,b) { t x; x = (a); (a) = (b); (b) = x; }
/*
* Decode the requested amount of G3 2D-encoded data.
*/
static int
Fax3Decode2D(TIFF* tif, uint8* buf, tmsize_t occ, uint16 s)
{
DECLARE_STATE_2D(tif, sp, "Fax3Decode2D");
int is1D; /* current line is 1d/2d-encoded */
(void) s;
if (occ % sp->b.rowbytes)
{
TIFFErrorExt(tif->tif_clientdata, module, "Fractional scanlines cannot be read");
return (-1);
}
CACHE_STATE(tif, sp);
while (occ > 0) {
a0 = 0;
RunLength = 0;
pa = thisrun = sp->curruns;
#ifdef FAX3_DEBUG
printf("\nBitAcc=%08X, BitsAvail = %d EOLcnt = %d",
BitAcc, BitsAvail, EOLcnt);
#endif
SYNC_EOL(EOF2D);
NeedBits8(1, EOF2D);
is1D = GetBits(1); /* 1D/2D-encoding tag bit */
ClrBits(1);
#ifdef FAX3_DEBUG
printf(" %s\n-------------------- %d\n",
is1D ? "1D" : "2D", tif->tif_row);
fflush(stdout);
#endif
pb = sp->refruns;
b1 = *pb++;
if (is1D)
EXPAND1D(EOF2Da);
else
EXPAND2D(EOF2Da);
(*sp->fill)(buf, thisrun, pa, lastx);
SETVALUE(0); /* imaginary change for reference */
SWAP(uint32*, sp->curruns, sp->refruns);
buf += sp->b.rowbytes;
occ -= sp->b.rowbytes;
sp->line++;
continue;
EOF2D: /* premature EOF */
CLEANUP_RUNS();
EOF2Da: /* premature EOF */
(*sp->fill)(buf, thisrun, pa, lastx);
UNCACHE_STATE(tif, sp);
return (-1);
}
UNCACHE_STATE(tif, sp);
return (1);
}
#undef SWAP
/*
* The ZERO & FILL macros must handle spans < 2*sizeof(long) bytes.
* For machines with 64-bit longs this is <16 bytes; otherwise
* this is <8 bytes. We optimize the code here to reflect the
* machine characteristics.
*/
#if SIZEOF_UNSIGNED_LONG == 8
# define FILL(n, cp) \
switch (n) { \
case 15:(cp)[14] = 0xff; case 14:(cp)[13] = 0xff; case 13: (cp)[12] = 0xff;\
case 12:(cp)[11] = 0xff; case 11:(cp)[10] = 0xff; case 10: (cp)[9] = 0xff;\
case 9: (cp)[8] = 0xff; case 8: (cp)[7] = 0xff; case 7: (cp)[6] = 0xff;\
case 6: (cp)[5] = 0xff; case 5: (cp)[4] = 0xff; case 4: (cp)[3] = 0xff;\
case 3: (cp)[2] = 0xff; case 2: (cp)[1] = 0xff; \
case 1: (cp)[0] = 0xff; (cp) += (n); case 0: ; \
}
# define ZERO(n, cp) \
switch (n) { \
case 15:(cp)[14] = 0; case 14:(cp)[13] = 0; case 13: (cp)[12] = 0; \
case 12:(cp)[11] = 0; case 11:(cp)[10] = 0; case 10: (cp)[9] = 0; \
case 9: (cp)[8] = 0; case 8: (cp)[7] = 0; case 7: (cp)[6] = 0; \
case 6: (cp)[5] = 0; case 5: (cp)[4] = 0; case 4: (cp)[3] = 0; \
case 3: (cp)[2] = 0; case 2: (cp)[1] = 0; \
case 1: (cp)[0] = 0; (cp) += (n); case 0: ; \
}
#else
# define FILL(n, cp) \
switch (n) { \
case 7: (cp)[6] = 0xff; case 6: (cp)[5] = 0xff; case 5: (cp)[4] = 0xff; \
case 4: (cp)[3] = 0xff; case 3: (cp)[2] = 0xff; case 2: (cp)[1] = 0xff; \
case 1: (cp)[0] = 0xff; (cp) += (n); case 0: ; \
}
# define ZERO(n, cp) \
switch (n) { \
case 7: (cp)[6] = 0; case 6: (cp)[5] = 0; case 5: (cp)[4] = 0; \
case 4: (cp)[3] = 0; case 3: (cp)[2] = 0; case 2: (cp)[1] = 0; \
case 1: (cp)[0] = 0; (cp) += (n); case 0: ; \
}
#endif
/*
* Bit-fill a row according to the white/black
* runs generated during G3/G4 decoding.
*/
void
_TIFFFax3fillruns(unsigned char* buf, uint32* runs, uint32* erun, uint32 lastx)
{
static const unsigned char _fillmasks[] =
{ 0x00, 0x80, 0xc0, 0xe0, 0xf0, 0xf8, 0xfc, 0xfe, 0xff };
unsigned char* cp;
uint32 x, bx, run;
int32 n, nw;
long* lp;
if ((erun-runs)&1)
*erun++ = 0;
x = 0;
for (; runs < erun; runs += 2) {
run = runs[0];
if (x+run > lastx || run > lastx )
run = runs[0] = (uint32) (lastx - x);
if (run) {
cp = buf + (x>>3);
bx = x&7;
if (run > 8-bx) {
if (bx) { /* align to byte boundary */
*cp++ &= 0xff << (8-bx);
run -= 8-bx;
}
if( (n = run >> 3) != 0 ) { /* multiple bytes to fill */
if ((n/sizeof (long)) > 1) {
/*
* Align to longword boundary and fill.
*/
for (; n && !isAligned(cp, long); n--)
*cp++ = 0x00;
lp = (long*) cp;
nw = (int32)(n / sizeof (long));
n -= nw * sizeof (long);
do {
*lp++ = 0L;
} while (--nw);
cp = (unsigned char*) lp;
}
ZERO(n, cp);
run &= 7;
}
if (run)
cp[0] &= 0xff >> run;
} else
cp[0] &= ~(_fillmasks[run]>>bx);
x += runs[0];
}
run = runs[1];
if (x+run > lastx || run > lastx )
run = runs[1] = lastx - x;
if (run) {
cp = buf + (x>>3);
bx = x&7;
if (run > 8-bx) {
if (bx) { /* align to byte boundary */
*cp++ |= 0xff >> bx;
run -= 8-bx;
}
if( (n = run>>3) != 0 ) { /* multiple bytes to fill */
if ((n/sizeof (long)) > 1) {
/*
* Align to longword boundary and fill.
*/
for (; n && !isAligned(cp, long); n--)
*cp++ = 0xff;
lp = (long*) cp;
nw = (int32)(n / sizeof (long));
n -= nw * sizeof (long);
do {
*lp++ = -1L;
} while (--nw);
cp = (unsigned char*) lp;
}
FILL(n, cp);
run &= 7;
}
if (run)
cp[0] |= 0xff00 >> run;
} else
cp[0] |= _fillmasks[run]>>bx;
x += runs[1];
}
}
assert(x == lastx);
}
#undef ZERO
#undef FILL
static int
Fax3FixupTags(TIFF* tif)
{
(void) tif;
return (1);
}
/*
* Setup G3/G4-related compression/decompression state
* before data is processed. This routine is called once
* per image -- it sets up different state based on whether
* or not decoding or encoding is being done and whether
* 1D- or 2D-encoded data is involved.
*/
static int
Fax3SetupState(TIFF* tif)
{
static const char module[] = "Fax3SetupState";
TIFFDirectory* td = &tif->tif_dir;
Fax3BaseState* sp = Fax3State(tif);
int needsRefLine;
Fax3CodecState* dsp = (Fax3CodecState*) Fax3State(tif);
tmsize_t rowbytes;
uint32 rowpixels, nruns;
if (td->td_bitspersample != 1) {
TIFFErrorExt(tif->tif_clientdata, module,
"Bits/sample must be 1 for Group 3/4 encoding/decoding");
return (0);
}
/*
* Calculate the scanline/tile widths.
*/
if (isTiled(tif)) {
rowbytes = TIFFTileRowSize(tif);
rowpixels = td->td_tilewidth;
} else {
rowbytes = TIFFScanlineSize(tif);
rowpixels = td->td_imagewidth;
}
sp->rowbytes = rowbytes;
sp->rowpixels = rowpixels;
/*
* Allocate any additional space required for decoding/encoding.
*/
needsRefLine = (
(sp->groupoptions & GROUP3OPT_2DENCODING) ||
td->td_compression == COMPRESSION_CCITTFAX4
);
/*
Assure that allocation computations do not overflow.
TIFFroundup and TIFFSafeMultiply return zero on integer overflow
*/
dsp->runs=(uint32*) NULL;
nruns = TIFFroundup_32(rowpixels,32);
if (needsRefLine) {
nruns = TIFFSafeMultiply(uint32,nruns,2);
}
if ((nruns == 0) || (TIFFSafeMultiply(uint32,nruns,2) == 0)) {
TIFFErrorExt(tif->tif_clientdata, tif->tif_name,
"Row pixels integer overflow (rowpixels %u)",
rowpixels);
return (0);
}
dsp->runs = (uint32*) _TIFFCheckMalloc(tif,
TIFFSafeMultiply(uint32,nruns,2),
sizeof (uint32),
"for Group 3/4 run arrays");
if (dsp->runs == NULL)
return (0);
memset( dsp->runs, 0, TIFFSafeMultiply(uint32,nruns,2)*sizeof(uint32));
dsp->curruns = dsp->runs;
if (needsRefLine)
dsp->refruns = dsp->runs + nruns;
else
dsp->refruns = NULL;
if (td->td_compression == COMPRESSION_CCITTFAX3
&& is2DEncoding(dsp)) { /* NB: default is 1D routine */
tif->tif_decoderow = Fax3Decode2D;
tif->tif_decodestrip = Fax3Decode2D;
tif->tif_decodetile = Fax3Decode2D;
}
if (needsRefLine) { /* 2d encoding */
Fax3CodecState* esp = EncoderState(tif);
/*
* 2d encoding requires a scanline
* buffer for the ``reference line''; the
* scanline against which delta encoding
* is referenced. The reference line must
* be initialized to be ``white'' (done elsewhere).
*/
esp->refline = (unsigned char*) _TIFFmalloc(rowbytes);
if (esp->refline == NULL) {
TIFFErrorExt(tif->tif_clientdata, module,
"No space for Group 3/4 reference line");
return (0);
}
} else /* 1d encoding */
EncoderState(tif)->refline = NULL;
return (1);
}
/*
* CCITT Group 3 FAX Encoding.
*/
#define Fax3FlushBits(tif, sp) { \
if ((tif)->tif_rawcc >= (tif)->tif_rawdatasize) \
(void) TIFFFlushData1(tif); \
*(tif)->tif_rawcp++ = (uint8) (sp)->data; \
(tif)->tif_rawcc++; \
(sp)->data = 0, (sp)->bit = 8; \
}
#define _FlushBits(tif) { \
if ((tif)->tif_rawcc >= (tif)->tif_rawdatasize) \
(void) TIFFFlushData1(tif); \
*(tif)->tif_rawcp++ = (uint8) data; \
(tif)->tif_rawcc++; \
data = 0, bit = 8; \
}
static const int _msbmask[9] =
{ 0x00, 0x01, 0x03, 0x07, 0x0f, 0x1f, 0x3f, 0x7f, 0xff };
#define _PutBits(tif, bits, length) { \
while (length > bit) { \
data |= bits >> (length - bit); \
length -= bit; \
_FlushBits(tif); \
} \
assert( length < 9 ); \
data |= (bits & _msbmask[length]) << (bit - length); \
bit -= length; \
if (bit == 0) \
_FlushBits(tif); \
}
/*
* Write a variable-length bit-value to
* the output stream. Values are
* assumed to be at most 16 bits.
*/
static void
Fax3PutBits(TIFF* tif, unsigned int bits, unsigned int length)
{
Fax3CodecState* sp = EncoderState(tif);
unsigned int bit = sp->bit;
int data = sp->data;
_PutBits(tif, bits, length);
sp->data = data;
sp->bit = bit;
}
/*
* Write a code to the output stream.
*/
#define putcode(tif, te) Fax3PutBits(tif, (te)->code, (te)->length)
#ifdef FAX3_DEBUG
#define DEBUG_COLOR(w) (tab == TIFFFaxWhiteCodes ? w "W" : w "B")
#define DEBUG_PRINT(what,len) { \
int t; \
printf("%08X/%-2d: %s%5d\t", data, bit, DEBUG_COLOR(what), len); \
for (t = length-1; t >= 0; t--) \
putchar(code & (1<<t) ? '1' : '0'); \
putchar('\n'); \
}
#endif
/*
* Write the sequence of codes that describes
* the specified span of zero's or one's. The
* appropriate table that holds the make-up and
* terminating codes is supplied.
*/
static void
putspan(TIFF* tif, int32 span, const tableentry* tab)
{
Fax3CodecState* sp = EncoderState(tif);
unsigned int bit = sp->bit;
int data = sp->data;
unsigned int code, length;
while (span >= 2624) {
const tableentry* te = &tab[63 + (2560>>6)];
code = te->code, length = te->length;
#ifdef FAX3_DEBUG
DEBUG_PRINT("MakeUp", te->runlen);
#endif
_PutBits(tif, code, length);
span -= te->runlen;
}
if (span >= 64) {
const tableentry* te = &tab[63 + (span>>6)];
assert(te->runlen == 64*(span>>6));
code = te->code, length = te->length;
#ifdef FAX3_DEBUG
DEBUG_PRINT("MakeUp", te->runlen);
#endif
_PutBits(tif, code, length);
span -= te->runlen;
}
code = tab[span].code, length = tab[span].length;
#ifdef FAX3_DEBUG
DEBUG_PRINT(" Term", tab[span].runlen);
#endif
_PutBits(tif, code, length);
sp->data = data;
sp->bit = bit;
}
/*
* Write an EOL code to the output stream. The zero-fill
* logic for byte-aligning encoded scanlines is handled
* here. We also handle writing the tag bit for the next
* scanline when doing 2d encoding.
*/
static void
Fax3PutEOL(TIFF* tif)
{
Fax3CodecState* sp = EncoderState(tif);
unsigned int bit = sp->bit;
int data = sp->data;
unsigned int code, length, tparm;
if (sp->b.groupoptions & GROUP3OPT_FILLBITS) {
/*
* Force bit alignment so EOL will terminate on
* a byte boundary. That is, force the bit alignment
* to 16-12 = 4 before putting out the EOL code.
*/
int align = 8 - 4;
if (align != sp->bit) {
if (align > sp->bit)
align = sp->bit + (8 - align);
else
align = sp->bit - align;
code = 0;
tparm=align;
_PutBits(tif, 0, tparm);
}
}
code = EOL, length = 12;
if (is2DEncoding(sp))
code = (code<<1) | (sp->tag == G3_1D), length++;
_PutBits(tif, code, length);
sp->data = data;
sp->bit = bit;
}
/*
* Reset encoding state at the start of a strip.
*/
static int
Fax3PreEncode(TIFF* tif, uint16 s)
{
Fax3CodecState* sp = EncoderState(tif);
(void) s;
assert(sp != NULL);
sp->bit = 8;
sp->data = 0;
sp->tag = G3_1D;
/*
* This is necessary for Group 4; otherwise it isn't
* needed because the first scanline of each strip ends
* up being copied into the refline.
*/
if (sp->refline)
_TIFFmemset(sp->refline, 0x00, sp->b.rowbytes);
if (is2DEncoding(sp)) {
float res = tif->tif_dir.td_yresolution;
/*
* The CCITT spec says that when doing 2d encoding, you
* should only do it on K consecutive scanlines, where K
* depends on the resolution of the image being encoded
* (2 for <= 200 lpi, 4 for > 200 lpi). Since the directory
* code initializes td_yresolution to 0, this code will
* select a K of 2 unless the YResolution tag is set
* appropriately. (Note also that we fudge a little here
* and use 150 lpi to avoid problems with units conversion.)
*/
if (tif->tif_dir.td_resolutionunit == RESUNIT_CENTIMETER)
res *= 2.54f; /* convert to inches */
sp->maxk = (res > 150 ? 4 : 2);
sp->k = sp->maxk-1;
} else
sp->k = sp->maxk = 0;
sp->line = 0;
return (1);
}
static const unsigned char zeroruns[256] = {
8, 7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, /* 0x00 - 0x0f */
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, /* 0x10 - 0x1f */
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, /* 0x20 - 0x2f */
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, /* 0x30 - 0x3f */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 0x40 - 0x4f */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 0x50 - 0x5f */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 0x60 - 0x6f */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 0x70 - 0x7f */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x80 - 0x8f */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x90 - 0x9f */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0xa0 - 0xaf */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0xb0 - 0xbf */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0xc0 - 0xcf */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0xd0 - 0xdf */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0xe0 - 0xef */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0xf0 - 0xff */
};
static const unsigned char oneruns[256] = {
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x00 - 0x0f */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x10 - 0x1f */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x20 - 0x2f */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x30 - 0x3f */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x40 - 0x4f */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x50 - 0x5f */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x60 - 0x6f */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x70 - 0x7f */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 0x80 - 0x8f */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 0x90 - 0x9f */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 0xa0 - 0xaf */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 0xb0 - 0xbf */
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, /* 0xc0 - 0xcf */
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, /* 0xd0 - 0xdf */
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, /* 0xe0 - 0xef */
4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 7, 8, /* 0xf0 - 0xff */
};
/*
* On certain systems it pays to inline
* the routines that find pixel spans.
*/
#ifdef VAXC
static int32 find0span(unsigned char*, int32, int32);
static int32 find1span(unsigned char*, int32, int32);
#pragma inline(find0span,find1span)
#endif
/*
* Find a span of ones or zeros using the supplied
* table. The ``base'' of the bit string is supplied
* along with the start+end bit indices.
*/
inline static int32
find0span(unsigned char* bp, int32 bs, int32 be)
{
int32 bits = be - bs;
int32 n, span;
bp += bs>>3;
/*
* Check partial byte on lhs.
*/
if (bits > 0 && (n = (bs & 7))) {
span = zeroruns[(*bp << n) & 0xff];
if (span > 8-n) /* table value too generous */
span = 8-n;
if (span > bits) /* constrain span to bit range */
span = bits;
if (n+span < 8) /* doesn't extend to edge of byte */
return (span);
bits -= span;
bp++;
} else
span = 0;
if (bits >= (int32)(2 * 8 * sizeof(long))) {
long* lp;
/*
* Align to longword boundary and check longwords.
*/
while (!isAligned(bp, long)) {
if (*bp != 0x00)
return (span + zeroruns[*bp]);
span += 8, bits -= 8;
bp++;
}
lp = (long*) bp;
while ((bits >= (int32)(8 * sizeof(long))) && (0 == *lp)) {
span += 8*sizeof (long), bits -= 8*sizeof (long);
lp++;
}
bp = (unsigned char*) lp;
}
/*
* Scan full bytes for all 0's.
*/
while (bits >= 8) {
if (*bp != 0x00) /* end of run */
return (span + zeroruns[*bp]);
span += 8, bits -= 8;
bp++;
}
/*
* Check partial byte on rhs.
*/
if (bits > 0) {
n = zeroruns[*bp];
span += (n > bits ? bits : n);
}
return (span);
}
inline static int32
find1span(unsigned char* bp, int32 bs, int32 be)
{
int32 bits = be - bs;
int32 n, span;
bp += bs>>3;
/*
* Check partial byte on lhs.
*/
if (bits > 0 && (n = (bs & 7))) {
span = oneruns[(*bp << n) & 0xff];
if (span > 8-n) /* table value too generous */
span = 8-n;
if (span > bits) /* constrain span to bit range */
span = bits;
if (n+span < 8) /* doesn't extend to edge of byte */
return (span);
bits -= span;
bp++;
} else
span = 0;
if (bits >= (int32)(2 * 8 * sizeof(long))) {
long* lp;
/*
* Align to longword boundary and check longwords.
*/
while (!isAligned(bp, long)) {
if (*bp != 0xff)
return (span + oneruns[*bp]);
span += 8, bits -= 8;
bp++;
}
lp = (long*) bp;
while ((bits >= (int32)(8 * sizeof(long))) && (~0 == *lp)) {
span += 8*sizeof (long), bits -= 8*sizeof (long);
lp++;
}
bp = (unsigned char*) lp;
}
/*
* Scan full bytes for all 1's.
*/
while (bits >= 8) {
if (*bp != 0xff) /* end of run */
return (span + oneruns[*bp]);
span += 8, bits -= 8;
bp++;
}
/*
* Check partial byte on rhs.
*/
if (bits > 0) {
n = oneruns[*bp];
span += (n > bits ? bits : n);
}
return (span);
}
/*
* Return the offset of the next bit in the range
* [bs..be] that is different from the specified
* color. The end, be, is returned if no such bit
* exists.
*/
#define finddiff(_cp, _bs, _be, _color) \
(_bs + (_color ? find1span(_cp,_bs,_be) : find0span(_cp,_bs,_be)))
/*
* Like finddiff, but also check the starting bit
* against the end in case start > end.
*/
#define finddiff2(_cp, _bs, _be, _color) \
(_bs < _be ? finddiff(_cp,_bs,_be,_color) : _be)
/*
* 1d-encode a row of pixels. The encoding is
* a sequence of all-white or all-black spans
* of pixels encoded with Huffman codes.
*/
static int
Fax3Encode1DRow(TIFF* tif, unsigned char* bp, uint32 bits)
{
Fax3CodecState* sp = EncoderState(tif);
int32 span;
uint32 bs = 0;
for (;;) {
span = find0span(bp, bs, bits); /* white span */
putspan(tif, span, TIFFFaxWhiteCodes);
bs += span;
if (bs >= bits)
break;
span = find1span(bp, bs, bits); /* black span */
putspan(tif, span, TIFFFaxBlackCodes);
bs += span;
if (bs >= bits)
break;
}
if (sp->b.mode & (FAXMODE_BYTEALIGN|FAXMODE_WORDALIGN)) {
if (sp->bit != 8) /* byte-align */
Fax3FlushBits(tif, sp);
if ((sp->b.mode&FAXMODE_WORDALIGN) &&
!isAligned(tif->tif_rawcp, uint16))
Fax3FlushBits(tif, sp);
}
return (1);
}
static const tableentry horizcode =
{ 3, 0x1, 0 }; /* 001 */
static const tableentry passcode =
{ 4, 0x1, 0 }; /* 0001 */
static const tableentry vcodes[7] = {
{ 7, 0x03, 0 }, /* 0000 011 */
{ 6, 0x03, 0 }, /* 0000 11 */
{ 3, 0x03, 0 }, /* 011 */
{ 1, 0x1, 0 }, /* 1 */
{ 3, 0x2, 0 }, /* 010 */
{ 6, 0x02, 0 }, /* 0000 10 */
{ 7, 0x02, 0 } /* 0000 010 */
};
/*
* 2d-encode a row of pixels. Consult the CCITT
* documentation for the algorithm.
*/
static int
Fax3Encode2DRow(TIFF* tif, unsigned char* bp, unsigned char* rp, uint32 bits)
{
#define PIXEL(buf,ix) ((((buf)[(ix)>>3]) >> (7-((ix)&7))) & 1)
uint32 a0 = 0;
uint32 a1 = (PIXEL(bp, 0) != 0 ? 0 : finddiff(bp, 0, bits, 0));
uint32 b1 = (PIXEL(rp, 0) != 0 ? 0 : finddiff(rp, 0, bits, 0));
uint32 a2, b2;
for (;;) {
b2 = finddiff2(rp, b1, bits, PIXEL(rp,b1));
if (b2 >= a1) {
int32 d = b1 - a1;
if (!(-3 <= d && d <= 3)) { /* horizontal mode */
a2 = finddiff2(bp, a1, bits, PIXEL(bp,a1));
putcode(tif, &horizcode);
if (a0+a1 == 0 || PIXEL(bp, a0) == 0) {
putspan(tif, a1-a0, TIFFFaxWhiteCodes);
putspan(tif, a2-a1, TIFFFaxBlackCodes);
} else {
putspan(tif, a1-a0, TIFFFaxBlackCodes);
putspan(tif, a2-a1, TIFFFaxWhiteCodes);
}
a0 = a2;
} else { /* vertical mode */
putcode(tif, &vcodes[d+3]);
a0 = a1;
}
} else { /* pass mode */
putcode(tif, &passcode);
a0 = b2;
}
if (a0 >= bits)
break;
a1 = finddiff(bp, a0, bits, PIXEL(bp,a0));
b1 = finddiff(rp, a0, bits, !PIXEL(bp,a0));
b1 = finddiff(rp, b1, bits, PIXEL(bp,a0));
}
return (1);
#undef PIXEL
}
/*
* Encode a buffer of pixels.
*/
static int
Fax3Encode(TIFF* tif, uint8* bp, tmsize_t cc, uint16 s)
{
static const char module[] = "Fax3Encode";
Fax3CodecState* sp = EncoderState(tif);
(void) s;
if (cc % sp->b.rowbytes)
{
TIFFErrorExt(tif->tif_clientdata, module, "Fractional scanlines cannot be written");
return (0);
}
while (cc > 0) {
if ((sp->b.mode & FAXMODE_NOEOL) == 0)
Fax3PutEOL(tif);
if (is2DEncoding(sp)) {
if (sp->tag == G3_1D) {
if (!Fax3Encode1DRow(tif, bp, sp->b.rowpixels))
return (0);
sp->tag = G3_2D;
} else {
if (!Fax3Encode2DRow(tif, bp, sp->refline,
sp->b.rowpixels))
return (0);
sp->k--;
}
if (sp->k == 0) {
sp->tag = G3_1D;
sp->k = sp->maxk-1;
} else
_TIFFmemcpy(sp->refline, bp, sp->b.rowbytes);
} else {
if (!Fax3Encode1DRow(tif, bp, sp->b.rowpixels))
return (0);
}
bp += sp->b.rowbytes;
cc -= sp->b.rowbytes;
}
return (1);
}
static int
Fax3PostEncode(TIFF* tif)
{
Fax3CodecState* sp = EncoderState(tif);
if (sp->bit != 8)
Fax3FlushBits(tif, sp);
return (1);
}
static void
Fax3Close(TIFF* tif)
{
if ((Fax3State(tif)->mode & FAXMODE_NORTC) == 0) {
Fax3CodecState* sp = EncoderState(tif);
unsigned int code = EOL;
unsigned int length = 12;
int i;
if (is2DEncoding(sp))
code = (code<<1) | (sp->tag == G3_1D), length++;
for (i = 0; i < 6; i++)
Fax3PutBits(tif, code, length);
Fax3FlushBits(tif, sp);
}
}
static void
Fax3Cleanup(TIFF* tif)
{
Fax3CodecState* sp = DecoderState(tif);
assert(sp != 0);
tif->tif_tagmethods.vgetfield = sp->b.vgetparent;
tif->tif_tagmethods.vsetfield = sp->b.vsetparent;
tif->tif_tagmethods.printdir = sp->b.printdir;
if (sp->runs)
_TIFFfree(sp->runs);
if (sp->refline)
_TIFFfree(sp->refline);
_TIFFfree(tif->tif_data);
tif->tif_data = NULL;
_TIFFSetDefaultCompressionState(tif);
}
#define FIELD_BADFAXLINES (FIELD_CODEC+0)
#define FIELD_CLEANFAXDATA (FIELD_CODEC+1)
#define FIELD_BADFAXRUN (FIELD_CODEC+2)
#define FIELD_OPTIONS (FIELD_CODEC+7)
static const TIFFField faxFields[] = {
{ TIFFTAG_FAXMODE, 0, 0, TIFF_ANY, 0, TIFF_SETGET_INT, TIFF_SETGET_UNDEFINED, FIELD_PSEUDO, FALSE, FALSE, "FaxMode", NULL },
{ TIFFTAG_FAXFILLFUNC, 0, 0, TIFF_ANY, 0, TIFF_SETGET_OTHER, TIFF_SETGET_UNDEFINED, FIELD_PSEUDO, FALSE, FALSE, "FaxFillFunc", NULL },
{ TIFFTAG_BADFAXLINES, 1, 1, TIFF_LONG, 0, TIFF_SETGET_UINT32, TIFF_SETGET_UINT32, FIELD_BADFAXLINES, TRUE, FALSE, "BadFaxLines", NULL },
{ TIFFTAG_CLEANFAXDATA, 1, 1, TIFF_SHORT, 0, TIFF_SETGET_UINT16, TIFF_SETGET_UINT16, FIELD_CLEANFAXDATA, TRUE, FALSE, "CleanFaxData", NULL },
{ TIFFTAG_CONSECUTIVEBADFAXLINES, 1, 1, TIFF_LONG, 0, TIFF_SETGET_UINT32, TIFF_SETGET_UINT32, FIELD_BADFAXRUN, TRUE, FALSE, "ConsecutiveBadFaxLines", NULL }};
static const TIFFField fax3Fields[] = {
{ TIFFTAG_GROUP3OPTIONS, 1, 1, TIFF_LONG, 0, TIFF_SETGET_UINT32, TIFF_SETGET_UINT32, FIELD_OPTIONS, FALSE, FALSE, "Group3Options", NULL },
};
static const TIFFField fax4Fields[] = {
{ TIFFTAG_GROUP4OPTIONS, 1, 1, TIFF_LONG, 0, TIFF_SETGET_UINT32, TIFF_SETGET_UINT32, FIELD_OPTIONS, FALSE, FALSE, "Group4Options", NULL },
};
static int
Fax3VSetField(TIFF* tif, uint32 tag, va_list ap)
{
Fax3BaseState* sp = Fax3State(tif);
const TIFFField* fip;
assert(sp != 0);
assert(sp->vsetparent != 0);
switch (tag) {
case TIFFTAG_FAXMODE:
sp->mode = (int) va_arg(ap, int);
return 1; /* NB: pseudo tag */
case TIFFTAG_FAXFILLFUNC:
DecoderState(tif)->fill = va_arg(ap, TIFFFaxFillFunc);
return 1; /* NB: pseudo tag */
case TIFFTAG_GROUP3OPTIONS:
/* XXX: avoid reading options if compression mismatches. */
if (tif->tif_dir.td_compression == COMPRESSION_CCITTFAX3)
sp->groupoptions = (uint32) va_arg(ap, uint32);
break;
case TIFFTAG_GROUP4OPTIONS:
/* XXX: avoid reading options if compression mismatches. */
if (tif->tif_dir.td_compression == COMPRESSION_CCITTFAX4)
sp->groupoptions = (uint32) va_arg(ap, uint32);
break;
case TIFFTAG_BADFAXLINES:
sp->badfaxlines = (uint32) va_arg(ap, uint32);
break;
case TIFFTAG_CLEANFAXDATA:
sp->cleanfaxdata = (uint16) va_arg(ap, uint16_vap);
break;
case TIFFTAG_CONSECUTIVEBADFAXLINES:
sp->badfaxrun = (uint32) va_arg(ap, uint32);
break;
default:
return (*sp->vsetparent)(tif, tag, ap);
}
if ((fip = TIFFFieldWithTag(tif, tag)))
TIFFSetFieldBit(tif, fip->field_bit);
else
return 0;
tif->tif_flags |= TIFF_DIRTYDIRECT;
return 1;
}
static int
Fax3VGetField(TIFF* tif, uint32 tag, va_list ap)
{
Fax3BaseState* sp = Fax3State(tif);
assert(sp != 0);
switch (tag) {
case TIFFTAG_FAXMODE:
*va_arg(ap, int*) = sp->mode;
break;
case TIFFTAG_FAXFILLFUNC:
*va_arg(ap, TIFFFaxFillFunc*) = DecoderState(tif)->fill;
break;
case TIFFTAG_GROUP3OPTIONS:
case TIFFTAG_GROUP4OPTIONS:
*va_arg(ap, uint32*) = sp->groupoptions;
break;
case TIFFTAG_BADFAXLINES:
*va_arg(ap, uint32*) = sp->badfaxlines;
break;
case TIFFTAG_CLEANFAXDATA:
*va_arg(ap, uint16*) = sp->cleanfaxdata;
break;
case TIFFTAG_CONSECUTIVEBADFAXLINES:
*va_arg(ap, uint32*) = sp->badfaxrun;
break;
default:
return (*sp->vgetparent)(tif, tag, ap);
}
return (1);
}
static void
Fax3PrintDir(TIFF* tif, FILE* fd, long flags)
{
Fax3BaseState* sp = Fax3State(tif);
assert(sp != 0);
(void) flags;
if (TIFFFieldSet(tif,FIELD_OPTIONS)) {
const char* sep = " ";
if (tif->tif_dir.td_compression == COMPRESSION_CCITTFAX4) {
fprintf(fd, " Group 4 Options:");
if (sp->groupoptions & GROUP4OPT_UNCOMPRESSED)
fprintf(fd, "%suncompressed data", sep);
} else {
fprintf(fd, " Group 3 Options:");
if (sp->groupoptions & GROUP3OPT_2DENCODING)
fprintf(fd, "%s2-d encoding", sep), sep = "+";
if (sp->groupoptions & GROUP3OPT_FILLBITS)
fprintf(fd, "%sEOL padding", sep), sep = "+";
if (sp->groupoptions & GROUP3OPT_UNCOMPRESSED)
fprintf(fd, "%suncompressed data", sep);
}
fprintf(fd, " (%lu = 0x%lx)\n",
(unsigned long) sp->groupoptions,
(unsigned long) sp->groupoptions);
}
if (TIFFFieldSet(tif,FIELD_CLEANFAXDATA)) {
fprintf(fd, " Fax Data:");
switch (sp->cleanfaxdata) {
case CLEANFAXDATA_CLEAN:
fprintf(fd, " clean");
break;
case CLEANFAXDATA_REGENERATED:
fprintf(fd, " receiver regenerated");
break;
case CLEANFAXDATA_UNCLEAN:
fprintf(fd, " uncorrected errors");
break;
}
fprintf(fd, " (%u = 0x%x)\n",
sp->cleanfaxdata, sp->cleanfaxdata);
}
if (TIFFFieldSet(tif,FIELD_BADFAXLINES))
fprintf(fd, " Bad Fax Lines: %lu\n",
(unsigned long) sp->badfaxlines);
if (TIFFFieldSet(tif,FIELD_BADFAXRUN))
fprintf(fd, " Consecutive Bad Fax Lines: %lu\n",
(unsigned long) sp->badfaxrun);
if (sp->printdir)
(*sp->printdir)(tif, fd, flags);
}
static int
InitCCITTFax3(TIFF* tif)
{
static const char module[] = "InitCCITTFax3";
Fax3BaseState* sp;
/*
* Merge codec-specific tag information.
*/
if (!_TIFFMergeFields(tif, faxFields, TIFFArrayCount(faxFields))) {
TIFFErrorExt(tif->tif_clientdata, "InitCCITTFax3",
"Merging common CCITT Fax codec-specific tags failed");
return 0;
}
/*
* Allocate state block so tag methods have storage to record values.
*/
tif->tif_data = (uint8*)
_TIFFmalloc(sizeof (Fax3CodecState));
if (tif->tif_data == NULL) {
TIFFErrorExt(tif->tif_clientdata, module,
"No space for state block");
return (0);
}
sp = Fax3State(tif);
sp->rw_mode = tif->tif_mode;
/*
* Override parent get/set field methods.
*/
sp->vgetparent = tif->tif_tagmethods.vgetfield;
tif->tif_tagmethods.vgetfield = Fax3VGetField; /* hook for codec tags */
sp->vsetparent = tif->tif_tagmethods.vsetfield;
tif->tif_tagmethods.vsetfield = Fax3VSetField; /* hook for codec tags */
sp->printdir = tif->tif_tagmethods.printdir;
tif->tif_tagmethods.printdir = Fax3PrintDir; /* hook for codec tags */
sp->groupoptions = 0;
if (sp->rw_mode == O_RDONLY) /* FIXME: improve for in place update */
tif->tif_flags |= TIFF_NOBITREV; /* decoder does bit reversal */
DecoderState(tif)->runs = NULL;
TIFFSetField(tif, TIFFTAG_FAXFILLFUNC, _TIFFFax3fillruns);
EncoderState(tif)->refline = NULL;
/*
* Install codec methods.
*/
tif->tif_fixuptags = Fax3FixupTags;
tif->tif_setupdecode = Fax3SetupState;
tif->tif_predecode = Fax3PreDecode;
tif->tif_decoderow = Fax3Decode1D;
tif->tif_decodestrip = Fax3Decode1D;
tif->tif_decodetile = Fax3Decode1D;
tif->tif_setupencode = Fax3SetupState;
tif->tif_preencode = Fax3PreEncode;
tif->tif_postencode = Fax3PostEncode;
tif->tif_encoderow = Fax3Encode;
tif->tif_encodestrip = Fax3Encode;
tif->tif_encodetile = Fax3Encode;
tif->tif_close = Fax3Close;
tif->tif_cleanup = Fax3Cleanup;
return (1);
}
int
TIFFInitCCITTFax3(TIFF* tif, int scheme)
{
(void) scheme;
if (InitCCITTFax3(tif)) {
/*
* Merge codec-specific tag information.
*/
if (!_TIFFMergeFields(tif, fax3Fields,
TIFFArrayCount(fax3Fields))) {
TIFFErrorExt(tif->tif_clientdata, "TIFFInitCCITTFax3",
"Merging CCITT Fax 3 codec-specific tags failed");
return 0;
}
/*
* The default format is Class/F-style w/o RTC.
*/
return TIFFSetField(tif, TIFFTAG_FAXMODE, FAXMODE_CLASSF);
} else
return 01;
}
/*
* CCITT Group 4 (T.6) Facsimile-compatible
* Compression Scheme Support.
*/
#define SWAP(t,a,b) { t x; x = (a); (a) = (b); (b) = x; }
/*
* Decode the requested amount of G4-encoded data.
*/
static int
Fax4Decode(TIFF* tif, uint8* buf, tmsize_t occ, uint16 s)
{
DECLARE_STATE_2D(tif, sp, "Fax4Decode");
(void) s;
if (occ % sp->b.rowbytes)
{
TIFFErrorExt(tif->tif_clientdata, module, "Fractional scanlines cannot be read");
return (-1);
}
CACHE_STATE(tif, sp);
while (occ > 0) {
a0 = 0;
RunLength = 0;
pa = thisrun = sp->curruns;
pb = sp->refruns;
b1 = *pb++;
#ifdef FAX3_DEBUG
printf("\nBitAcc=%08X, BitsAvail = %d\n", BitAcc, BitsAvail);
printf("-------------------- %d\n", tif->tif_row);
fflush(stdout);
#endif
EXPAND2D(EOFG4);
if (EOLcnt)
goto EOFG4;
(*sp->fill)(buf, thisrun, pa, lastx);
SETVALUE(0); /* imaginary change for reference */
SWAP(uint32*, sp->curruns, sp->refruns);
buf += sp->b.rowbytes;
occ -= sp->b.rowbytes;
sp->line++;
continue;
EOFG4:
NeedBits16( 13, BADG4 );
BADG4:
#ifdef FAX3_DEBUG
if( GetBits(13) != 0x1001 )
fputs( "Bad EOFB\n", stderr );
#endif
ClrBits( 13 );
(*sp->fill)(buf, thisrun, pa, lastx);
UNCACHE_STATE(tif, sp);
return ( sp->line ? 1 : -1); /* don't error on badly-terminated strips */
}
UNCACHE_STATE(tif, sp);
return (1);
}
#undef SWAP
/*
* Encode the requested amount of data.
*/
static int
Fax4Encode(TIFF* tif, uint8* bp, tmsize_t cc, uint16 s)
{
static const char module[] = "Fax4Encode";
Fax3CodecState *sp = EncoderState(tif);
(void) s;
if (cc % sp->b.rowbytes)
{
TIFFErrorExt(tif->tif_clientdata, module, "Fractional scanlines cannot be written");
return (0);
}
while (cc > 0) {
if (!Fax3Encode2DRow(tif, bp, sp->refline, sp->b.rowpixels))
return (0);
_TIFFmemcpy(sp->refline, bp, sp->b.rowbytes);
bp += sp->b.rowbytes;
cc -= sp->b.rowbytes;
}
return (1);
}
static int
Fax4PostEncode(TIFF* tif)
{
Fax3CodecState *sp = EncoderState(tif);
/* terminate strip w/ EOFB */
Fax3PutBits(tif, EOL, 12);
Fax3PutBits(tif, EOL, 12);
if (sp->bit != 8)
Fax3FlushBits(tif, sp);
return (1);
}
int
TIFFInitCCITTFax4(TIFF* tif, int scheme)
{
(void) scheme;
if (InitCCITTFax3(tif)) { /* reuse G3 support */
/*
* Merge codec-specific tag information.
*/
if (!_TIFFMergeFields(tif, fax4Fields,
TIFFArrayCount(fax4Fields))) {
TIFFErrorExt(tif->tif_clientdata, "TIFFInitCCITTFax4",
"Merging CCITT Fax 4 codec-specific tags failed");
return 0;
}
tif->tif_decoderow = Fax4Decode;
tif->tif_decodestrip = Fax4Decode;
tif->tif_decodetile = Fax4Decode;
tif->tif_encoderow = Fax4Encode;
tif->tif_encodestrip = Fax4Encode;
tif->tif_encodetile = Fax4Encode;
tif->tif_postencode = Fax4PostEncode;
/*
* Suppress RTC at the end of each strip.
*/
return TIFFSetField(tif, TIFFTAG_FAXMODE, FAXMODE_NORTC);
} else
return (0);
}
/*
* CCITT Group 3 1-D Modified Huffman RLE Compression Support.
* (Compression algorithms 2 and 32771)
*/
/*
* Decode the requested amount of RLE-encoded data.
*/
static int
Fax3DecodeRLE(TIFF* tif, uint8* buf, tmsize_t occ, uint16 s)
{
DECLARE_STATE(tif, sp, "Fax3DecodeRLE");
int mode = sp->b.mode;
(void) s;
if (occ % sp->b.rowbytes)
{
TIFFErrorExt(tif->tif_clientdata, module, "Fractional scanlines cannot be read");
return (-1);
}
CACHE_STATE(tif, sp);
thisrun = sp->curruns;
while (occ > 0) {
a0 = 0;
RunLength = 0;
pa = thisrun;
#ifdef FAX3_DEBUG
printf("\nBitAcc=%08X, BitsAvail = %d\n", BitAcc, BitsAvail);
printf("-------------------- %d\n", tif->tif_row);
fflush(stdout);
#endif
EXPAND1D(EOFRLE);
(*sp->fill)(buf, thisrun, pa, lastx);
/*
* Cleanup at the end of the row.
*/
if (mode & FAXMODE_BYTEALIGN) {
int n = BitsAvail - (BitsAvail &~ 7);
ClrBits(n);
} else if (mode & FAXMODE_WORDALIGN) {
int n = BitsAvail - (BitsAvail &~ 15);
ClrBits(n);
if (BitsAvail == 0 && !isAligned(cp, uint16))
cp++;
}
buf += sp->b.rowbytes;
occ -= sp->b.rowbytes;
sp->line++;
continue;
EOFRLE: /* premature EOF */
(*sp->fill)(buf, thisrun, pa, lastx);
UNCACHE_STATE(tif, sp);
return (-1);
}
UNCACHE_STATE(tif, sp);
return (1);
}
int
TIFFInitCCITTRLE(TIFF* tif, int scheme)
{
(void) scheme;
if (InitCCITTFax3(tif)) { /* reuse G3 support */
tif->tif_decoderow = Fax3DecodeRLE;
tif->tif_decodestrip = Fax3DecodeRLE;
tif->tif_decodetile = Fax3DecodeRLE;
/*
* Suppress RTC+EOLs when encoding and byte-align data.
*/
return TIFFSetField(tif, TIFFTAG_FAXMODE,
FAXMODE_NORTC|FAXMODE_NOEOL|FAXMODE_BYTEALIGN);
} else
return (0);
}
int
TIFFInitCCITTRLEW(TIFF* tif, int scheme)
{
(void) scheme;
if (InitCCITTFax3(tif)) { /* reuse G3 support */
tif->tif_decoderow = Fax3DecodeRLE;
tif->tif_decodestrip = Fax3DecodeRLE;
tif->tif_decodetile = Fax3DecodeRLE;
/*
* Suppress RTC+EOLs when encoding and word-align data.
*/
return TIFFSetField(tif, TIFFTAG_FAXMODE,
FAXMODE_NORTC|FAXMODE_NOEOL|FAXMODE_WORDALIGN);
} else
return (0);
}
#endif /* CCITT_SUPPORT */
/* vim: set ts=8 sts=8 sw=8 noet: */
/*
* Local Variables:
* mode: c
* c-basic-offset: 8
* fill-column: 78
* End:
*/
``` |
Read More About It is a public service announcement campaign created as a joint venture between CBS and the Library of Congress that ran from 1980 to 1999 on CBS. The campaign, which usually aired one at the end of a special primetime program, was famous for its opening title sequence, which originally showed a live action TV set which zoomed in using stop motion that used pages on the side flipping into either the celebrity of the program aired or just on-screen graphics, which was remade in 1990 using computer animation that used CGI for the pages on the side of the TV flipping to revolve to the celebrity/graphics. The spiel in each PSA talks about learning more about what happened in the program, the books the Library of Congress suggests, and that they can be found in their local library or bookstore. It ended with either the celebrity of the program or an announcer saying, "Visit them. They'll be happy to help you Read More About It."
Originally the theme music was composed by Keith Mansfield, but in 1983, "Moments of Courage" by composer Craig Palmer became the theme for the PSAs. Along with a remade intro came a new theme for the campaign which lasted for the 1990s. With the arrival of the internet came new resources to learn about the subject of the special or movie aired on CBS and other networks. Because of this, Read More About It was succeeded at the turn of the 21st century by the CBS Cares campaign, which like its predecessor usually airs at the end of either a movie (example: The Karen Carpenter Story) (until 2010) or a special program (example: The Grammy Awards or the Super Bowl) and focuses primarily on resources, online and print, to learn about the event or subject featured in the preceding program or community involvement.
CBS Storybreak was the only series to have regular book suggestions from the Library of Congress. The books suggested usually are related to the plots of the featured half-hour animated adaptations.
See also
CBS Cares, a currently running CBS PSA campaign
The More You Know, a PSA campaign created by NBC and expanded throughout NBCUniversal
One to Grow On, The More You Know 's predecessor on NBC
Reading Is Fundamental, the oldest American literacy organization
Book It!, a program run by Pizza Hut
References
Public service announcements of the United States
CBS Television Network
Library of Congress
Literacy
Reading (process)
American advertising slogans
1980 neologisms |
Madisonville is a city in Madison County, Texas, United States. The population was 4,420 at the 2020 census. It is the county seat of Madison County. Both the City of Madisonville and the County of Madison were named for U.S. President James Madison, the fourth chief executive.
Geography
Madisonville is located at (30.950915, –95.912623).
According to the United States Census Bureau, the city has a total area of , of which, of it is land and of it (3.49%) is water.
Demographics
As of the 2020 United States census, there were 4,420 people, 1,548 households, and 1,065 families residing in the city.
At the 2000 census there were 4,159 people, 1,473 households, and 1,016 families living in the city. The population density was . There were 1,653 housing units at an average density of . The racial makeup of the city was 56.60% White, 29.21% African American, 0.50% Native American, 0.41% Asian, 0.02% Pacific Islander, 10.56% from other races, and 2.69% from two or more races. Hispanic or Latino of any race were 22.24%.
Of the 1,473 households 35.6% had children under the age of 18 living with them, 46.1% were married couples living together, 17.7% had a female householder with no husband present, and 31.0% were non-families. 26.8% of households were one person and 13.2% were one person aged 65 or older. The average household size was 2.70 and the average family size was 3.28.
The age distribution was 29.7% under the age of 18, 10.1% from 18 to 24, 25.2% from 25 to 44, 18.2% from 45 to 64, and 16.8% 65 or older. The median age was 33 years. For every 100 females, there were 88.7 males. For every 100 females age 18 and over, there were 82.3 males.
The median household income was $25,440 and the median family income was $29,077. Males had a median income of $22,292 versus $19,885 for females. The per capita income for the city was $12,551. About 20.7% of families and 23.2% of the population were below the poverty line, including 31.1% of those under age 18 and 17.0% of those age 65 or over.
Education
The City of Madisonville is served by the Madisonville Consolidated Independent School District.
Climate
The climate in this area is characterized by hot, humid summers and generally mild to cool winters. According to the Köppen Climate Classification system, Madisonville has a humid subtropical climate, abbreviated "Cfa" on climate maps.
History
The town of Madisonville was founded in 1853 as the county seat of the at the time newly organized Madison county. Lots were sold in the summer of the same year, on a 200 acre tract of land donated by Job Starks Collard. At the suggestion of Dr. Pleasant Williams Kittrell, the town was named after President James Madison. Hillary Mercer Crabb served as a justice of the peace and chief justice (county judge). In 1852 he was elected to serve the unexpired term of State Representative F. L. Hatch. Among Crabb's accomplishments as a legislator was the introduction of a bill to create Madison County.
Gallery
References
External links
City of Madisonville
History of Madisonville from the Handbook of Texas Online published by the Texas State Historical Association
Cities in Texas
Cities in Madison County, Texas
County seats in Texas |
HMS True Briton was a cutter the Royal Navy purchased in 1778. In 1779 she participated in a successful operation that resulted in the capture of a French frigate and several other naval vessels. The French Navy captured True Briton in 1780. She became the mercantile Tartare. The Royal Navy recaptured her and recommissioned her as HMS True Briton. The Navy laid her up in 1783 and sold her in 1785.
Career
The Navy purchase True Briton in April 1778 for £ 3,240 7s 7d. She underwent fitting at Deptford between 29 April and 18 September 1778.
Lieutenant Charles Cobb commissioned True Briton in July 1779 for the Channel Islands. In 1780 she was under the command of Lieutenant the Honourable Patrick Napier.
On 13 May 1779 True Briton was part of a squadron commanded by Captain Sir James Wallace in HMS Experiment that captured the French frigate , and a brig and cutter, in Cancale Bay. The squadron had sailed from Portsmouth to the relief of Jersey after the failed French invasion. Other vessels in the squadron consisted of the sloops , , and , and the hired armed ship .
Capture: True Briton was returning to England from France in November 1780 when she got caught in a storm off Lisbon that cost her her bowsprit. Then On 2 December she was in the Bay of Biscay when another storm took away her masts. She was proceeding towards Ireland under a jury mast made of spars and booms when on 5 December she encountered the French 32-gun privateer Bougainville. Napier had no choice but to strike.
Recapture: In February 1782, captured the French ship Tartare, of fourteen 6-pounder guns. There are alternate accounts of Tartares origins. French sources state that she was the former British privateer Tartar, which the French ships Aimable and Diligente had captured in September 1780. The Royal Navy took Tartare into service as HMS True Briton. Lloyds List reported that Tartar was the former British cutter True Briton.
HMS True Briton: Tartar underwent fitting at Portsmouth between February and August 1782, and was recommissioned in June under Lieutenant Francis Loveday, for the Channel Islands.
Disposal: True Briton was fitted for Ordinary between April and November 1783. The Navy sold her at Sheerness on 9 June 1785 for £205.
Citations
References
Cutters of the Royal Navy
Captured ships
Merchant ships of France |
Colmar - Houssen Airport () is an airport in Houssen, north of Colmar, both communes in the Haut-Rhin department of the Alsace region in France. The airport is along Autoroute A35 and is served by the Colmar Station.
Facilities
The airport resides at an elevation of above mean sea level. It has one paved runway designated 01/19 which measures and a parallel grass runway measuring .
Statistics
References
External links
A History of Colmar Airport
Colmar Airport
Colmar Airport
Airports in Grand Est
Haut-Rhin
Colmar |
Matilda Ridout Edgar (29 September 1844 – 29 September 1910) was a Canadian historian and feminist.
She was born Matilda Ridout, became Matilda Edgar by marriage, and became Lady Edgar in 1898 when her husband was knighted.
The mother of nine children, she turned to historical research and writing when in her forties.
She published three books in her lifetime and was working on a fourth when she died.
She was active in a number of Toronto-based societies and in her later years was a strong advocate of women's causes.
Early years
Matilda Ridout was born in Toronto, Canada, on 29 September 1844, the fifth child and second daughter of Thomas Gibbs Ridout and Matilda Ann Bramley.
Her grandfather, Thomas Ridout of Sherborne, Dorset, was surveyor general of Upper Canada from 1810 to 1829.
Her father was the first cashier of the Bank of Upper Canada from 1822 until he retired in 1861.
Her father died a few months after retiring, and his mother was left with little money to support a family of nine.
On 5 September 1865 Matilda married James David Edgar, a barrister, lawyer and author, becoming Matilda Edgar.
The marriage of "Tillie" (Matilda) and James was happy and loving, as is shown by the letters he wrote to her daily when politics took him to Ottawa.
She enjoyed raising their three daughters and six sons, although they left her with little free time.
Eight of the children lived into adulthood.
Their eldest son was James Frederic Edgar, born on 6 July 1866.
Their second surviving son was Pelham Edgar and their oldest daughter was Maud.
They were followed by William Wilkie, born on 26 October 1874, Beatrice on 25 August 1877, David Keithock on 29 November 1879 and Herbert Wedderlie on 20 June 1883.
Marjorie was born in 1886.
Her husband ran on the Liberal platform and was elected to the House of Commons of Canada to represent Monck, Ontario on 12 October 1872, but lost his seat in the election of 22 January 1874. He ran again without success in several by-elections and elections until being elected on the Liberal platform for Ontario West on 22 August 1884.
During his time out of office he became the unofficial organizer for Prime Minister Alexander Mackenzie in Ontario, and negotiated a new railway clause for the entry of British Columbia into the Confederation of Canada.
Philanthropist
James David Edgar was appointed Speaker of the House of Commons on 19 August 1896, holding this position until his death. As his wife, Matilda Edgar was invited to become patron of enterprises such as the Toronto Infants' Home, the Imperial Order of the Daughters of the Empire, and the Women's Art Association of Canada (WAAC) In 1898 Matilda Edgar and Mary Dignam, president of the WAAC, arranged for members of the House and Senate to subscribe $1,000 to purchase the Cabot Commemorative State Dinner Service. This was a hand-painted eight-course, 24-place dinner set representing Canadian subjects that had been made by WAAC members to commemorate the 400th anniversary of John Cabot's discovery of Canada. The set was formally presented to Lady Aberdeen on the occasion of her husband finishing his assignment as Governor General of Canada.
Prime Minister Sir Wilfrid Laurier appointed Edgar to the Privy Council, and in 1898 he was knighted. He was already showing the symptoms of nephritis, a kidney disease. For part of 1898 Matilda, now Lady Edgar, was acting president of the National Council of Women of Canada. When her husband died on 31 July 1899, Matilda Edgar was devastated, and gave up all public activities for the next year. She briefly turned to spiritualism, and thought she received a message from her husband telling her to continue to work and to give her support to the children.
Matilda Edgar became active in public again in 1900. She threw herself into women's causes, proposing that women should have the right to receive higher education, support themselves, vote, and not lose control of their property when they married. She became a life member of the National Council of Women in 1906, and was elected president of the council that year. She was elected president again in 1909.
Historian
In 1890 Matilda Edgar published an edited collection of letters between her grandfather and his sons George and Thomas. They described life in Toronto and London and the battles of the War of 1812. The work celebrated the achievements of Canada in an effort to build national pride, and was well received.
A sketch of her life published by the Women's Canadian Historical Society in 1914 said, "The resultant volume ... revealed her sense of historical perspective, her easy mastery of detail, and her possession of a literary style that was at once limpid, nervous and strong".
Matilda Edgar and Sarah Anne Curzon founded the Canadian Women's Historical Society in 1895. She replaced Curzon as president of the Society in 1897, when Curzon retired. In 1904 she published a biography of Sir Isaac Brock, another "whig" celebration of Canadian achievement. The Montreal Standard said of this book that "for accuracy and completeness of information…and for beauty of style, it has seldom been surpassed." Her third book also drew on the Ridout family papers. It was a biography of Horatio Sharpe, a colonial governor of Maryland. The book was published in 1912, after her death, and was highly praised.
Matilda Edgar began work on a biography of an ancestor of her husband, James Edgar, a Scottish Jacobite. For more than forty years he was private secretary to James Francis Edward Stuart, the Chevalier St. George.
She was given permission to conduct research at Windsor Castle, where his correspondence was preserved, and spent the winter of 1909–10 working in the library. The book was complete apart from the last three chapters when she went back to London to conduct some research in the British Museum. She died of heart failure in London, England, on 29 September 1910. Her body was taken back to Toronto for burial.
James Frederic Edgar served in the Second Riel Rebellion, then completed his legal studies and was called to the bar of Ontario. He was eventually created a King's Counsel. Pelham Edgar became an English professor at Victoria College in the University of Toronto. Maud co-founded Miss Edgar's and Miss Cramp's School in Montreal, and for many years was headmistress of this private school for girls.
Marjorie married Keith Hicks. Their daughter Maud McLean co-authored a biography of Matilda and her husband, published in 1988.
Bibliography
Matilda Edgar's published works were:
References
Sources
External links
J. D. Edgar family fonds, Archives of Ontario
1844 births
1910 deaths
Canadian women historians
Canadian feminists
People from Old Toronto
20th-century Canadian historians
19th-century Canadian historians |
HMCS Antigonish was a that served in the Royal Canadian Navy from 1944–1946 and as a from 1957–1966. She is named for Antigonish, Nova Scotia. Her photo is featured on the cover of the 1994 album Frigate by the band April Wine.
Antigonish was ordered 1 February 1943 as part of the 1943–44 River-class building programme. She was laid down by Yarrows Ltd. at Esquimalt on 2 October 1943 and launched 10 February 1944. She was commissioned at Esquimalt into the RCN on 4 July 1944 with the pennant K661.
Background
The River-class frigate was designed by William Reed of Smith's Dock Company of South Bank-on-Tees. Originally called a "twin-screw corvette", its purpose was to improve on the convoy escort classes in service with the Royal Navy at the time, including the . The first orders were placed by the Royal Navy in 1940 and the vessels were named for rivers in the United Kingdom, giving name to the class. In Canada they were named for towns and cities though they kept the same designation. The name "frigate" was suggested by Vice-Admiral Percy Nelles of the Royal Canadian Navy and was adopted later that year.
Improvements over the corvette design included improved accommodation which was markedly better. The twin engines gave only three more knots of speed but extended the range of the ship to nearly double that of a corvette at at . Among other lessons applied to the design was an armament package better designed to combat U-boats including a twin 4-inch mount forward and 12-pounder aft. 15 Canadian frigates were initially fitted with a single 4-inch gun forward but with the exception of , they were all eventually upgraded to the double mount. For underwater targets, the River-class frigate was equipped with a Hedgehog anti-submarine mortar and depth charge rails aft and four side-mounted throwers.
River-class frigates were the first Royal Canadian Navy warships to carry the 147B Sword horizontal fan echo sonar transmitter in addition to the irregular ASDIC. This allowed the ship to maintain contact with targets even while firing unless a target was struck. Improved radar and direction-finding equipment improved the RCN's ability to find and track enemy submarines over the previous classes.
Service history
After transiting to Halifax, from which she required some minor repairs, Antigonish was sent to Bermuda to work up. Upon her return she was assigned to EG 16. She remained with the unit for the rest of the European war, making a couple of trips to Gibraltar. In December 1944, with Antigonish as Senior Officer's Ship, EG 16 was deployed to Canadian waters for operations.
Antigonish returned to Canada in June 1945 and began a tropicalization refit at Pictou, Nova Scotia on 1 July. This refit was completed on 17 November. She was ordered to Esquimalt where she was paid off into the reserve on 5 February 1946.
Post-war service
Antigonish was reactivated in 1947 for use as a training ship until 1954. In October 1948, Antigonish joined the cruiser and destroyers , , in sailing to Pearl Harbor, Hawaii; the largest deployment of the Royal Canadian Navy following the war. In January 1952, and Antigonish deployed on a training cruise to South America along the Pacific coast, making several port visits. In May, , Antigonish and Beacon Hill travelled to Juneau, Alaska and in August, to San Diego on training cruises.
She was one of twenty-one River-class frigates chosen to undergo conversion to a Prestonian-class frigate which gave her a flush-decked configuration and required the enlargement of her bridge and the heightening of her funnel. This also required the enclosing the quarterdeck in order to house the two Squid anti-submarine mortars. She was converted in 1956–1957 and was recommissioned with pennant 301 on 12 October 1957. During service with the Fourth Canadian Escort Squadron she was fitted with a midship deckhouse to provide classroom and training facilities for officer candidates. In January 1960, Antigonish and three other Prestonian-class ships made a tour of South American ports, visiting San Diego, Balboa, the Galapagos Islands, Callao and Valparaíso, Talara and Long Beach. Antigonish was a member of the Fourth Canadian Escort Squadron based out of Esquimalt, British Columbia. In June 1960 the Fourth Canadian Escort Squadron performed a training tour of the Pacific, with stops at Yokohama, Japan, Midway Atoll and Pearl Harbor. They returned to Canada in August. She remained in a training role until she was paid off by the RCN on 30 November 1966. She was sold for scrap and broken up in Japan in 1968.
Ship's bell
The ship's bell of HMCS Antigonish is currently held by the Maritime Museum of British Columbia. The Christening Bells Project at Canadian Forces Base Esquimalt Naval and Military Museum includes information from the ship's bell of HMCS Antigonish, which was used for baptism of babies on board the ship.
See also
List of ships of the Canadian Navy
References
Citations
Sources
External links
Antigonish Heritage Museum – HMCS Antigonish
River-class frigates of the Royal Canadian Navy
1944 ships
Ships built in Esquimalt |
SM U-36 was a Type 31 U-boat in the service of the Imperial German Navy of the German Empire, employed in the commerce war in World War I.
Construction
U-36 was laid down on 2 January 1913 at Germaniawerft in Kiel. She was launched on 6 June 1914 and commissioned on 14 November 1914, under the command of Kapitänleutnant Ernst Graeff. During February 1915, she carried out acceptance trials at Kiel, and was attached to the 2d Half-Flotilla in the North Sea in March.
Design
German Type U 31 submarines were double-hulled ocean-going submarines similar to Type 23 and Type 27 subs in dimensions and differed only slightly in propulsion and speed. They were considered very good high sea boats with average manoeuvrability and good surface steering.
U-36 had an overall length of , her pressure hull was long. The boat's beam was (o/a), while the pressure hull measured . Type 31s had a draught of with a total height of . The boats displaced a total of ; when surfaced and when submerged.
U-36 was fitted with two Germania 6-cylinder two-stroke diesel engines with a total of for use on the surface and two Siemens-Schuckert double-acting electric motors with a total of for underwater use. These engines powered two shafts each with a propeller, which gave the boat a top surface speed of , and when submerged. Cruising range was at on the surface, and at under water. Diving depth was .
The U-boat was armed with four torpedo tubes, two fitted in the bow and two in the stern, and carried 6 torpedoes. Additionally U-36 was equipped in 1915 with two Uk L/30 deck guns.
The boat's complement was 4 officers and 31 enlisted.
Service history
SM U-36s movements and operations were monitored and reported by British Naval Intelligence, better known as "Room 40". Her first war patrol was in Heligoland Bight from 29 to 30 March 1915; she reported no sinkings during this time. On 23 April, she returned to Heligoland Bight, apparently from a North Sea patrol.
She departed on 29 April, bound again for the North Sea, where she sank the 1,966-ton Danish steamer Lilian Drost on 8 May, captured the 1,241-ton Swedish steamer Björn on 10 May as a prize, while capturing and releasing the 654-ton Dutch steamer Niobe the same day.
U-36 returned to her North Sea station on 17 July. Operating off the north and northwest coast of Scotland, she sank three steamers and almost a dozen smaller vessels. On 22 July, the 3,644-ton Russian Rubonia fell victim. That same day, U-36 also attacked a group of fishing vessels west of the Orkney Islands, sinking nine small trawlers and two sailing vessels, while taking one prize. The following day, the 1,505-ton Frenchman Danae was stopped according to prize rules and sunk, and the 3,819-ton Norwegian Fimreite was sunk as well.
On the day she was sunk, U-36 intercepted and captured the American windjammer Pass of Balmaha, bearing a cargo of cotton intended for Russia and en route to Kirkwall to be inspected by British authorities. An ensign from U-36 was left aboard the windjammer to ensure her successful passage to Cuxhaven. Pass was refitted as a merchant raider and re-christened , commanded by Count Felix von Luckner, soon to become famous for her naval exploits in the Atlantic and Pacific.
Fate
U-36 was sunk in the afternoon of 24 July 1915 in combat off the coast of North Rona in the Outer Hebrides with the British Q-ship , commanded by Lieutenant Mark Wardlaw, Royal Navy. The submarine had just stopped and boarded the Danish vessel SS Luise and a boarding party was in the process of dumping her cargo when a lookout sighted an approaching steamer. U-36 sailed towards the disguised Prince Charles and ordered her to stop while firing at her. The Q-ship complied, swinging out her boats. The unsuspecting submarine came within about of the ship when Prince Charles hoisted the British flag of war and commenced firing. Taken completely by surprise, U-36 took several direct hits and heavy damage, and sank. When Luise moved to pick up the survivors floating in the water, Prince Charles fired into her, believing her to be a German resupply vessel. Forty-five minutes after U-36 sank, the remaining survivors were picked up by the Q-ship. Kptlt. Graeff and 15 crewmen were saved, but 18 others were lost. U-36 was the first U-boat sunk by Q-ship, and one of only a handful to fall victim. Lieutenant Wardlaw received a Distinguished Service Order for the action, and two of his crew received Distinguished Service Medals. The merchant crew of the Q-ship was awarded a prize sum of £1,000, to be divided amongst themselves.
Summary of raiding history
See also
Room 40
Notes
Citiations
Bibliography
Fitzsimons, Bernard, ed. The Illustrated Encyclopedia of 20th Century Weapons and Warfare, "U-Boats (1905–18), Volume 23, p. 2534. London: Phoebus Publishing, 1978.
*
Bodo Herzog: Deutsche U-Boote 1906-1966. Manfred Pawlak Verlags GmbH, Herrschingen 1990,
Paul Kemp: Die deutschen und österreichischen U-Boot Verluste in beiden Weltkriegen. Urbes Verlag Hans Jürgen Hansen, Gräfelfing vor München 1998,
External links
Information on British Q-ships like Prince Charles.
A 44 min. film from 1917 about a cruise of the German submarine U-35. A German propaganda film without dead or wounded; many details about submarine warfare in World War I.
Room 40: original documents, photos and maps about World War I German submarine warfare and British Room 40 Intelligence from The National Archives, Kew, Richmond, UK.
German Type U 31 submarines
U-boats commissioned in 1914
Maritime incidents in 1915
U-boats sunk in 1915
World War I submarines of Germany
World War I shipwrecks in the Atlantic Ocean
1914 ships
Ships built in Kiel |
Maxim Igorevich Belkov (; born 9 January 1985) is a Russian former professional road cyclist, who rode professionally between 2009 and 2018 for the , and squads.
Major results
2004
2nd Overall Giro delle Regioni
7th Gran Premio Palio del Recioto
2005
1st Time trial, National Road Championships
UEC European Under-23 Road Championships
6th Road race
8th Time trial
2006
1st Road race, National Under-23 Road Championships
1st Trofeo Città di San Vendemiano
2nd Overall Giro delle Regioni
3rd Time trial, National Road Championships
7th Memorial Oleg Dyachenko
2007
1st Time trial, UEC European Under-23 Road Championships
8th Coppa San Geo
2008
8th Overall Giro della Valle d'Aosta
2009
1st Stage 1b (TTT) Settimana Internazionale di Coppi e Bartali
2nd Ringerike GP
3rd Time trial, National Road Championships
2010
1st Stage 1 (TTT) Brixia Tour
5th Overall Five Rings of Moscow
9th Overall Danmark Rundt
2012
1st Sprints classification Tour of Turkey
2013
1st Stage 9 Giro d'Italia
1st Stage 1b (TTT) Settimana Internazionale di Coppi e Bartali
1st Stage 3 (TTT) Tour des Fjords
10th Strade Bianche
2014
1st Mountains classification Tour of Austria
2015
Tour de Romandie
1st Sprints classification
1st Mountains classification
2016
National Road Championships
2nd Road race
3rd Time trial
2017
2nd Time trial, National Road Championships
Grand Tour general classification results timeline
References
External links
Maxim Belkov profile at
1985 births
Living people
Russian male cyclists
Sportspeople from Izhevsk
Russian Giro d'Italia stage winners |
The Alvar Aalto Medal was established in 1967 by the Museum of Finnish Architecture, the Finnish Association of Architects (SAFA), and the Finnish Architectural Society. The Medal has been awarded intermittently since 1967, when the medal was created in honour of Alvar Aalto. The award is given in recognition of a significant contribution to creative architecture. The award was given earlier at the Alvar Aalto Symposium, held every three years in Jyväskylä, Aalto's hometown. Recently the ceremony has been organized on Aalto's birthday, February 3rd, today the Finnish national Day of Architecture.
The Alvar Aalto medal is typically awarded every 3 years in association with 5 organisations: the Alvar Aalto Foundation, The Finnish Association of Architects (SAFA), the City of Helsinki, Foundation for the Museum of Finnish Architecture and Architecture Information Finland, and The Finnish Society of Architecture. The medal, said to be awarded to future star architects; avoiding both currently vogue and the most radical avant-garde work. The medal was last awarded in 2020 to Bijoy Jain of Studio Mumbai.
Recipients of the Alvar Aalto Medal
See also
List of architecture prizes
References
Architecture awards
Awards established in 1967
Alvar Aalto |
```xml
/** @jsx jsx */
import { Node } from 'slate'
import { jsx } from 'slate-hyperscript'
export const input = (
<editor>
<element>
<text key="a" />
<text key="b" />
<text key="c" />
<text key="d" />
</element>
</editor>
)
export const test = value => {
return Array.from(
Node.descendants(value, {
from: [0, 1],
to: [0, 2],
})
)
}
export const output = [
[
<element>
<text key="a" />
<text key="b" />
<text key="c" />
<text key="d" />
</element>,
[0],
],
[<text key="b" />, [0, 1]],
[<text key="c" />, [0, 2]],
]
``` |
```python
from __future__ import division, absolute_import, print_function
import numpy as np
import numpy.matlib
from numpy.testing import assert_array_equal, assert_, run_module_suite
def test_empty():
x = numpy.matlib.empty((2,))
assert_(isinstance(x, np.matrix))
assert_(x.shape, (1, 2))
def test_ones():
assert_array_equal(numpy.matlib.ones((2, 3)),
np.matrix([[ 1., 1., 1.],
[ 1., 1., 1.]]))
assert_array_equal(numpy.matlib.ones(2), np.matrix([[ 1., 1.]]))
def test_zeros():
assert_array_equal(numpy.matlib.zeros((2, 3)),
np.matrix([[ 0., 0., 0.],
[ 0., 0., 0.]]))
assert_array_equal(numpy.matlib.zeros(2), np.matrix([[ 0., 0.]]))
def test_identity():
x = numpy.matlib.identity(2, dtype=np.int)
assert_array_equal(x, np.matrix([[1, 0], [0, 1]]))
def test_eye():
x = numpy.matlib.eye(3, k=1, dtype=int)
assert_array_equal(x, np.matrix([[ 0, 1, 0],
[ 0, 0, 1],
[ 0, 0, 0]]))
def test_rand():
x = numpy.matlib.rand(3)
# check matrix type, array would have shape (3,)
assert_(x.ndim == 2)
def test_randn():
x = np.matlib.randn(3)
# check matrix type, array would have shape (3,)
assert_(x.ndim == 2)
def test_repmat():
a1 = np.arange(4)
x = numpy.matlib.repmat(a1, 2, 2)
y = np.array([[0, 1, 2, 3, 0, 1, 2, 3],
[0, 1, 2, 3, 0, 1, 2, 3]])
assert_array_equal(x, y)
if __name__ == "__main__":
run_module_suite()
``` |
```php
<?php
/**
* Passbolt ~ Open source password manager for teams
*
* For full copyright and license information, please see the LICENSE.txt
* Redistributions of files must retain the above copyright notice.
*
* @link path_to_url Passbolt(tm)
* @since 4.5.0
*
* @see \Passbolt\PasswordExpiry\Notification\Email\PasswordExpirySettingsUpdatedEmailRedactor
* @var \App\View\AppView $this
* @var array $body
*/
use App\View\Helper\AvatarHelper;
use Cake\Routing\Router;
if (PHP_SAPI === 'cli') {
Router::fullBaseUrl($body['fullBaseUrl']);
}
/** @var array $operator */
$operator = $body['operator'];
/** @var array $setting */
$setting = $body['setting'];
/** @var string $userAgent */
$userAgent = $body['user_agent'];
/** @var string $clientIp */
$clientIp = $body['ip'];
echo $this->element('Email/module/avatar', [
'url' => AvatarHelper::getAvatarUrl($operator['profile']['avatar']),
'text' => $this->element('Email/module/avatar_text', [
'user' => $operator,
'datetime' => $setting['modified'],
'text' => $title,
]),
]);
$text = __('The password expiry settings have been updated.') . '<br/>';
echo $this->element('Email/module/text', [
'text' => $text,
]);
echo $this->element('Email/module/user_info', compact('userAgent', 'clientIp'));
echo $this->element('Email/module/button', [
'url' => Router::url('/app/administration/password-expiry', true),
'text' => __('View them in passbolt'),
]);
``` |
B.C. Bill is a 2D action video game published by Imagine Software in 1984. It was released for the Commodore 64, ZX Spectrum, TRS-80 Color Computer, Dragon 32/64 and BBC Micro.
Gameplay
The player controls the eponymous B.C. Bill, a caveman, and must gather wives and enough food to feed his growing family, while avoiding predatory dinosaurs. Bill is armed with a club, which he uses to stun cavewomen and to kill a variety of roaming creatures. Smaller creatures may be dragged back to the cave as food, whereas larger dinosaurs will eat potential wives and food, and will kill Bill on contact. Bill can die from a broken heart if too many wives leave the cave, and from starvation if he is unable to provide enough food to feed himself and his family.
The seasons change, which affect the number and variety of food animals and also act as an internal gameplay timer: in spring, every wife who has food will produce a child, while in autumn any wife with no food will die and any child with no food will leave home.
Development
B.C. Bill was developed in the UK by Creative Technology Group, and was published in the UK by Imagine Software in 1984 and in Spain by ABC Soft. Versions of the game were developed and released for the Commodore 64, ZX Spectrum, TRS-80, Dragon 32/64 and BBC Micro home computers.
The game was the last title published by Imagine, which was wound up in July 1984 due to unpaid debts of £10,000. Prior to the company's collapse Beau Jolly acquired the rights to market Imagine's games, so after the company's demise Beau Jolly took over marketing and distribution of B.C. Bill.
Reception
The game received generally favourable reviews at release, with reviewers variously praising its graphics, sound and playability. Looking back at the game in 2010, however, Retro Gamer described it as "an exceedingly poor game".
While reviewers praised the gameplay, the game has been criticised by both contemporary and modern reviewers for its sexist subject matter, as a core element of gameplay involves the protagonist clubbing women and then dragging them by the hair into his cave to become his wife. Your Sinclair's (then Your Spectrum) Ron Smith speculated that this might have been deliberate on the part of Imagine, and Imagine's Tim Best appeared to confirm this, saying that he expected the "Greenham Common women" to take up residence outside Imagine's Liverpool offices.
References
External links
1984 video games
Action games
BBC Micro and Acorn Electron games
Commodore 64 games
Dragon 32 games
Imagine Software games
Prehistoric people in popular culture
Single-player video games
TRS-80 Color Computer games
Video games about dinosaurs
Video games developed in the United Kingdom
Video games scored by Fred Gray
Video games set in prehistory
ZX Spectrum games |
Eric Frank Russell (January 6, 1905 – February 28, 1978) was a British writer best known for his science fiction novels and short stories. Much of his work was first published in the United States, in John W. Campbell's Astounding Science Fiction and other pulp magazines. Russell also wrote horror fiction for Weird Tales and non-fiction articles on Fortean topics. Up to 1955 several of his stories were published under pseudonyms, at least Duncan H. Munro and Niall(e) Wilde.
Biography
Russell was born in 1905 near Sandhurst in Berkshire, where his father was an instructor at the Royal Military College. Russell became a fan of science fiction and in 1934, while living near Liverpool, he saw a letter in Amazing Stories from Leslie J. Johnson, another reader from the same area. Russell met with Johnson, who encouraged him to embark on a writing career. Together, the two men wrote a novella, "Seeker of Tomorrow", that was published by F. Orlin Tremaine in the July 1937 number of Astounding Stories. Both Russell and Johnson became members of the British Interplanetary Society.
Russell's first novel was Sinister Barrier, cover story for the inaugural, May 1939 issue of Unknown—Astoundings sister magazine devoted to fantasy. It is explicitly a Fortean tale, based on Charles Fort's famous speculation "I think we're property", Russell explains in the foreword. An often-repeated legend has it that Campbell, on receiving the manuscript for Sinister Barrier, created Unknown primarily as a vehicle for the short novel (pp. 9–94). There is no real evidence for this, despite a statement to that effect in the first volume of Isaac Asimov's autobiography, In Memory Yet Green.
His second novel, Dreadful Sanctuary (serialized in Astounding during 1948) is an early example of conspiracy fiction, in which a paranoid delusion of global proportions is perpetuated by a small but powerful secret society.
There are two incompatible accounts of Russell's military service during World War II. The official, well-documented version is that he served with the Royal Air Force, with whom he saw active service in Europe as a member of a Mobile Signals Unit. However, in the introduction to the 1986 Del Rey Books edition of Russell's novel Wasp, Jack L. Chalker states that Russell was too old for active service, and instead worked for Military Intelligence in London, where he "spent the war dreaming up nasty tricks to play against the Germans and Japanese", including Operation Mincemeat. Russell's biographer John L. Ingham states however that "there is nothing, absolutely nothing, in his R.A.F. record to show that he was anything more than a wireless mechanic and radio operator".
Russell took up writing full-time in the late 1940s. He became an active member of British science fiction fandom and the British representative of the Fortean Society. He won the first annual Hugo Award for Best Short Story in 1955 recognizing his humorous "Allamagoosa" as the year's best science fiction.
The 1962 novel The Great Explosion won a Prometheus Hall of Fame Award in 1985—the third naming of two works to the libertarian science fiction hall of fame. The 1957 novel Wasp has been a finalist for the honor, which is now limited to one work per year.
The Science Fiction and Fantasy Hall of Fame inducted Russell in 2000, its fifth class of two deceased and two living writers.
Into Your Tent, a thorough and detailed biography of Russell by John L. Ingham, was published in 2010 by Plantech (UK).
Writings
Russell's full-length fiction includes the following:
Sinister Barrier (1939)
Dreadful Sanctuary (1948)
Sentinels From Space (1953), based on the earlier magazine story The Star Watchers (1951)
Three to Conquer (1956), based on the earlier magazine serial Call Him Dead (1955)
Men, Martians and Machines (1955), containing four related novellas
Wasp (1958)
Next of Kin (1959), published earlier as The Space Willies (1958)
The Great Explosion (1962)
With a Strange Device (1964), also published as The Mindwarpers.
Russell also wrote a large number of shorter works, many of which have been reprinted in collections such as Deep Space (1954), Six Worlds Yonder (1958), Far Stars (1961), Dark Tides (1962) and Somewhere a Voice (1965). His short story "Allamagoosa" (1955), which was essentially a science-fictional retelling of a traditional tall story called "The Shovewood", won the Hugo Award for Best Short Story.
Russell wrote numerous non-fiction essays on Fortean themes, some of which were collected in a compendium of Forteana entitled Great World Mysteries (1957). His second non-fiction book was The Rabble Rousers (1963), a sardonic look at human folly including the Dreyfus affair and the Florida land boom. He also wrote Lern Yerself Scouse: The ABZ of Scouse (1966) under the pseudonym "Linacre Lane".
Two omnibus collections of Russell's science fiction are available from NESFA Press: Major Ingredients (2000), containing 30 of his short stories, and Entities (2001) containing five novels. John Pelan's Midnight House published Dark Tides, a collection of Russell's horror and weird fiction, in 2006.
The 1995 novel Design for Great-Day, published as by Alan Dean Foster and Eric Frank Russell, is an expansion by Foster of a 1953 short story of the same name by Russell.
Writing style and themes
Russell had an easy-going, colloquial writing style that was influenced in part by American "hard-boiled" detective fiction of the kind popularized by Black Mask magazine. Although British, Russell wrote predominantly for an American audience, and was often assumed to be American by readers.
Much of Russell's science fiction is based on what might be described as Fortean themes, with Sinister Barrier and Dreadful Sanctuary the most notable examples. Another common theme is the single resourceful human pitted against a ponderous alien bureaucracy, as in the novels Wasp and Next of Kin, as well as several shorter works.
Russell is sometimes categorized as a humorous writer, and Brian Aldiss describes him as John W. Campbell's "licensed jester". However, Russell's humour generally has a satirical edge, often aimed at authority and bureaucracy in its various forms. On other occasions, for example in the short stories "Somewhere a Voice" and "The Army Comes to Venus", his work has a deeper and more serious tone, in which the spiritual aspects of humanity's endeavours and aspirations shine through.
Critical reception
Scott Connors, reviewing Russell's book Darker Tides, stated that "Russell's prose displays a rare sense of irony and wit...and does the reader the compliment of presenting the story in an indirect fashion so that he has an investment in the tale." Carl Sagan wrote that Russell's stories were examples of "desperately need[ed] exploration of alternative futures, both experimental and conceptual".
Cultural influences
Russell's short story "Jay Score" (1941) is unusual amongst the pulp fiction of its time in presenting a black character, the ship's doctor, without any racial stereotyping. Indeed, this story and its sequels (collected in Men, Martians and Machines) may be considered an early example of the science fiction subgenre in which a spaceship is crewed by a multi-ethnic, mixed human/non-human, complement (cf. the much later Star Trek).
In 1970, Russell was paid £4689 by the Beatles's company Apple Corps for the motion picture rights to his novel Wasp, the contract being signed on behalf of Apple by Ringo Starr. The film was never made, but it remained one of the most lucrative deals Russell ever made.
See also
Study in Still Life – story by Russell
Tower of Hanoi – which features in his story "Now Inhale"
Notes
References
Further reading
External links
Eric Frank Russell at The Encyclopedia of Science Fiction
Review of Major Ingredients
"Shadow Man" fan site by Narrelle Harris
Past Masters: Let Me Be Frank, or Welcome to the Allamagoosa Russell-Palooza by Bud Webster, at Galactic Central
And then there were none (1951)—the internet host notes "Anarchy in action—an excellent model of an anarchist or free society"
1905 births
1978 deaths
Military personnel from Berkshire
Royal Air Force personnel of World War II
Royal Air Force airmen
English short story writers
20th-century English novelists
English horror writers
English science fiction writers
Weird fiction writers
Fortean writers
Forteana
Hugo Award-winning writers
People from Sandhurst, Berkshire
Science Fiction Hall of Fame inductees
English male novelists |
Death to Music is the third full-length album by the band Nightstick, released in 1999 on Relapse Records.
Track listing
All songs were written by Robert Williams.
"Babykiller" – 09:36
"Jarhead" – 03:16
"Young Man, Old Man" – 08:04
"(Won't You Take Me To) Junkytown" – 04:58
"The American Way" – 03:25
"Free Man" – 03:40
"In Dahmer's Room" – 11:56
"Boot Party Theme" – 05:36
"Egghead: a) 'I Am Egghead', b) Naked Came the Egg, c) Egghead Is Dead" – 09:57
Personnel
Alex Smith – vocals, bass
Cotie Cowgill – guitars
Robert Williams – drums, backing vocals
Nightstick (band) albums
1999 albums |
```c++
//
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
//
// entry_points_gles_2_0_ext.cpp : Implements the GLES 2.0 extension entry points.
#include "libGLESv2/entry_points_gles_2_0_ext.h"
#include "libGLESv2/global_state.h"
#include "libANGLE/Buffer.h"
#include "libANGLE/Context.h"
#include "libANGLE/Error.h"
#include "libANGLE/Fence.h"
#include "libANGLE/Framebuffer.h"
#include "libANGLE/Shader.h"
#include "libANGLE/Query.h"
#include "libANGLE/validationES.h"
#include "libANGLE/validationES2.h"
#include "libANGLE/validationES3.h"
#include "common/debug.h"
#include "common/utilities.h"
namespace gl
{
void GL_APIENTRY BeginQueryEXT(GLenum target, GLuint id)
{
EVENT("(GLenum target = 0x%X, GLuint %d)", target, id);
Context *context = GetValidGlobalContext();
if (context)
{
if (!ValidateBeginQuery(context, target, id))
{
return;
}
Error error = context->beginQuery(target, id);
if (error.isError())
{
context->recordError(error);
return;
}
}
}
void GL_APIENTRY DeleteFencesNV(GLsizei n, const GLuint* fences)
{
EVENT("(GLsizei n = %d, const GLuint* fences = 0x%0.8p)", n, fences);
Context *context = GetValidGlobalContext();
if (context)
{
if (n < 0)
{
context->recordError(Error(GL_INVALID_VALUE));
return;
}
for (int i = 0; i < n; i++)
{
context->deleteFenceNV(fences[i]);
}
}
}
void GL_APIENTRY DeleteQueriesEXT(GLsizei n, const GLuint *ids)
{
EVENT("(GLsizei n = %d, const GLuint *ids = 0x%0.8p)", n, ids);
Context *context = GetValidGlobalContext();
if (context)
{
if (n < 0)
{
context->recordError(Error(GL_INVALID_VALUE));
return;
}
for (int i = 0; i < n; i++)
{
context->deleteQuery(ids[i]);
}
}
}
void GL_APIENTRY DrawArraysInstancedANGLE(GLenum mode, GLint first, GLsizei count, GLsizei primcount)
{
EVENT("(GLenum mode = 0x%X, GLint first = %d, GLsizei count = %d, GLsizei primcount = %d)", mode, first, count, primcount);
Context *context = GetValidGlobalContext();
if (context)
{
if (!ValidateDrawArraysInstancedANGLE(context, mode, first, count, primcount))
{
return;
}
Error error = context->drawArraysInstanced(mode, first, count, primcount);
if (error.isError())
{
context->recordError(error);
return;
}
}
}
void GL_APIENTRY DrawElementsInstancedANGLE(GLenum mode, GLsizei count, GLenum type, const GLvoid *indices, GLsizei primcount)
{
EVENT("(GLenum mode = 0x%X, GLsizei count = %d, GLenum type = 0x%X, const GLvoid* indices = 0x%0.8p, GLsizei primcount = %d)",
mode, count, type, indices, primcount);
Context *context = GetValidGlobalContext();
if (context)
{
IndexRange indexRange;
if (!ValidateDrawElementsInstancedANGLE(context, mode, count, type, indices, primcount, &indexRange))
{
return;
}
Error error =
context->drawElementsInstanced(mode, count, type, indices, primcount, indexRange);
if (error.isError())
{
context->recordError(error);
return;
}
}
}
void GL_APIENTRY EndQueryEXT(GLenum target)
{
EVENT("GLenum target = 0x%X)", target);
Context *context = GetValidGlobalContext();
if (context)
{
if (!ValidateEndQuery(context, target))
{
return;
}
Error error = context->endQuery(target);
if (error.isError())
{
context->recordError(error);
return;
}
}
}
void GL_APIENTRY FinishFenceNV(GLuint fence)
{
EVENT("(GLuint fence = %d)", fence);
Context *context = GetValidGlobalContext();
if (context)
{
FenceNV *fenceObject = context->getFenceNV(fence);
if (fenceObject == NULL)
{
context->recordError(Error(GL_INVALID_OPERATION));
return;
}
if (fenceObject->isSet() != GL_TRUE)
{
context->recordError(Error(GL_INVALID_OPERATION));
return;
}
fenceObject->finish();
}
}
void GL_APIENTRY GenFencesNV(GLsizei n, GLuint* fences)
{
EVENT("(GLsizei n = %d, GLuint* fences = 0x%0.8p)", n, fences);
Context *context = GetValidGlobalContext();
if (context)
{
if (n < 0)
{
context->recordError(Error(GL_INVALID_VALUE));
return;
}
for (int i = 0; i < n; i++)
{
fences[i] = context->createFenceNV();
}
}
}
void GL_APIENTRY GenQueriesEXT(GLsizei n, GLuint* ids)
{
EVENT("(GLsizei n = %d, GLuint* ids = 0x%0.8p)", n, ids);
Context *context = GetValidGlobalContext();
if (context)
{
if (n < 0)
{
context->recordError(Error(GL_INVALID_VALUE));
return;
}
for (GLsizei i = 0; i < n; i++)
{
ids[i] = context->createQuery();
}
}
}
void GL_APIENTRY GetFenceivNV(GLuint fence, GLenum pname, GLint *params)
{
EVENT("(GLuint fence = %d, GLenum pname = 0x%X, GLint *params = 0x%0.8p)", fence, pname, params);
Context *context = GetValidGlobalContext();
if (context)
{
FenceNV *fenceObject = context->getFenceNV(fence);
if (fenceObject == NULL)
{
context->recordError(Error(GL_INVALID_OPERATION));
return;
}
if (fenceObject->isSet() != GL_TRUE)
{
context->recordError(Error(GL_INVALID_OPERATION));
return;
}
switch (pname)
{
case GL_FENCE_STATUS_NV:
{
// GL_NV_fence spec:
// Once the status of a fence has been finished (via FinishFenceNV) or tested and the returned status is TRUE (via either TestFenceNV
// or GetFenceivNV querying the FENCE_STATUS_NV), the status remains TRUE until the next SetFenceNV of the fence.
GLboolean status = GL_TRUE;
if (fenceObject->getStatus() != GL_TRUE)
{
Error error = fenceObject->test(&status);
if (error.isError())
{
context->recordError(error);
return;
}
}
*params = status;
break;
}
case GL_FENCE_CONDITION_NV:
{
*params = static_cast<GLint>(fenceObject->getCondition());
break;
}
default:
{
context->recordError(Error(GL_INVALID_ENUM));
return;
}
}
}
}
GLenum GL_APIENTRY GetGraphicsResetStatusEXT(void)
{
EVENT("()");
Context *context = GetGlobalContext();
if (context)
{
return context->getResetStatus();
}
return GL_NO_ERROR;
}
void GL_APIENTRY GetQueryivEXT(GLenum target, GLenum pname, GLint *params)
{
EVENT("GLenum target = 0x%X, GLenum pname = 0x%X, GLint *params = 0x%0.8p)", target, pname, params);
Context *context = GetValidGlobalContext();
if (context)
{
if (!ValidQueryType(context, target))
{
context->recordError(Error(GL_INVALID_ENUM));
return;
}
switch (pname)
{
case GL_CURRENT_QUERY_EXT:
params[0] = context->getState().getActiveQueryId(target);
break;
default:
context->recordError(Error(GL_INVALID_ENUM));
return;
}
}
}
void GL_APIENTRY GetQueryObjectuivEXT(GLuint id, GLenum pname, GLuint *params)
{
EVENT("(GLuint id = %d, GLenum pname = 0x%X, GLuint *params = 0x%0.8p)", id, pname, params);
Context *context = GetValidGlobalContext();
if (context)
{
Query *queryObject = context->getQuery(id, false, GL_NONE);
if (!queryObject)
{
context->recordError(Error(GL_INVALID_OPERATION));
return;
}
if (context->getState().getActiveQueryId(queryObject->getType()) == id)
{
context->recordError(Error(GL_INVALID_OPERATION));
return;
}
switch(pname)
{
case GL_QUERY_RESULT_EXT:
{
Error error = queryObject->getResult(params);
if (error.isError())
{
context->recordError(error);
return;
}
}
break;
case GL_QUERY_RESULT_AVAILABLE_EXT:
{
Error error = queryObject->isResultAvailable(params);
if (error.isError())
{
context->recordError(error);
return;
}
}
break;
default:
context->recordError(Error(GL_INVALID_ENUM));
return;
}
}
}
void GL_APIENTRY GetTranslatedShaderSourceANGLE(GLuint shader, GLsizei bufsize, GLsizei* length, GLchar* source)
{
EVENT("(GLuint shader = %d, GLsizei bufsize = %d, GLsizei* length = 0x%0.8p, GLchar* source = 0x%0.8p)",
shader, bufsize, length, source);
Context *context = GetValidGlobalContext();
if (context)
{
if (bufsize < 0)
{
context->recordError(Error(GL_INVALID_VALUE));
return;
}
Shader *shaderObject = context->getShader(shader);
if (!shaderObject)
{
context->recordError(Error(GL_INVALID_OPERATION));
return;
}
// Only returns extra info if ANGLE_GENERATE_SHADER_DEBUG_INFO is defined
shaderObject->getTranslatedSourceWithDebugInfo(bufsize, length, source);
}
}
void GL_APIENTRY GetnUniformfvEXT(GLuint program, GLint location, GLsizei bufSize, GLfloat* params)
{
EVENT("(GLuint program = %d, GLint location = %d, GLsizei bufSize = %d, GLfloat* params = 0x%0.8p)",
program, location, bufSize, params);
Context *context = GetValidGlobalContext();
if (context)
{
if (!ValidateGetnUniformfvEXT(context, program, location, bufSize, params))
{
return;
}
Program *programObject = context->getProgram(program);
ASSERT(programObject);
programObject->getUniformfv(location, params);
}
}
void GL_APIENTRY GetnUniformivEXT(GLuint program, GLint location, GLsizei bufSize, GLint* params)
{
EVENT("(GLuint program = %d, GLint location = %d, GLsizei bufSize = %d, GLint* params = 0x%0.8p)",
program, location, bufSize, params);
Context *context = GetValidGlobalContext();
if (context)
{
if (!ValidateGetnUniformivEXT(context, program, location, bufSize, params))
{
return;
}
Program *programObject = context->getProgram(program);
ASSERT(programObject);
programObject->getUniformiv(location, params);
}
}
GLboolean GL_APIENTRY IsFenceNV(GLuint fence)
{
EVENT("(GLuint fence = %d)", fence);
Context *context = GetValidGlobalContext();
if (context)
{
FenceNV *fenceObject = context->getFenceNV(fence);
if (fenceObject == NULL)
{
return GL_FALSE;
}
// GL_NV_fence spec:
// A name returned by GenFencesNV, but not yet set via SetFenceNV, is not the name of an existing fence.
return fenceObject->isSet();
}
return GL_FALSE;
}
GLboolean GL_APIENTRY IsQueryEXT(GLuint id)
{
EVENT("(GLuint id = %d)", id);
Context *context = GetValidGlobalContext();
if (context)
{
return (context->getQuery(id, false, GL_NONE) != NULL) ? GL_TRUE : GL_FALSE;
}
return GL_FALSE;
}
void GL_APIENTRY ReadnPixelsEXT(GLint x, GLint y, GLsizei width, GLsizei height,
GLenum format, GLenum type, GLsizei bufSize,
GLvoid *data)
{
EVENT("(GLint x = %d, GLint y = %d, GLsizei width = %d, GLsizei height = %d, "
"GLenum format = 0x%X, GLenum type = 0x%X, GLsizei bufSize = 0x%d, GLvoid *data = 0x%0.8p)",
x, y, width, height, format, type, bufSize, data);
Context *context = GetValidGlobalContext();
if (context)
{
if (width < 0 || height < 0 || bufSize < 0)
{
context->recordError(Error(GL_INVALID_VALUE));
return;
}
if (!ValidateReadPixelsParameters(context, x, y, width, height,
format, type, &bufSize, data))
{
return;
}
Framebuffer *framebufferObject = context->getState().getReadFramebuffer();
ASSERT(framebufferObject);
Rectangle area(x, y, width, height);
Error error = framebufferObject->readPixels(context, area, format, type, data);
if (error.isError())
{
context->recordError(error);
return;
}
}
}
void GL_APIENTRY RenderbufferStorageMultisampleANGLE(GLenum target, GLsizei samples, GLenum internalformat, GLsizei width, GLsizei height)
{
EVENT("(GLenum target = 0x%X, GLsizei samples = %d, GLenum internalformat = 0x%X, GLsizei width = %d, GLsizei height = %d)",
target, samples, internalformat, width, height);
Context *context = GetValidGlobalContext();
if (context)
{
if (!ValidateRenderbufferStorageParametersANGLE(context, target, samples, internalformat,
width, height))
{
return;
}
Renderbuffer *renderbuffer = context->getState().getCurrentRenderbuffer();
Error error = renderbuffer->setStorageMultisample(samples, internalformat, width, height);
if (error.isError())
{
context->recordError(error);
return;
}
}
}
void GL_APIENTRY SetFenceNV(GLuint fence, GLenum condition)
{
EVENT("(GLuint fence = %d, GLenum condition = 0x%X)", fence, condition);
Context *context = GetValidGlobalContext();
if (context)
{
if (condition != GL_ALL_COMPLETED_NV)
{
context->recordError(Error(GL_INVALID_ENUM));
return;
}
FenceNV *fenceObject = context->getFenceNV(fence);
if (fenceObject == NULL)
{
context->recordError(Error(GL_INVALID_OPERATION));
return;
}
Error error = fenceObject->set(condition);
if (error.isError())
{
context->recordError(error);
return;
}
}
}
GLboolean GL_APIENTRY TestFenceNV(GLuint fence)
{
EVENT("(GLuint fence = %d)", fence);
Context *context = GetValidGlobalContext();
if (context)
{
FenceNV *fenceObject = context->getFenceNV(fence);
if (fenceObject == NULL)
{
context->recordError(Error(GL_INVALID_OPERATION));
return GL_TRUE;
}
if (fenceObject->isSet() != GL_TRUE)
{
context->recordError(Error(GL_INVALID_OPERATION));
return GL_TRUE;
}
GLboolean result;
Error error = fenceObject->test(&result);
if (error.isError())
{
context->recordError(error);
return GL_TRUE;
}
return result;
}
return GL_TRUE;
}
void GL_APIENTRY TexStorage2DEXT(GLenum target, GLsizei levels, GLenum internalformat, GLsizei width, GLsizei height)
{
EVENT("(GLenum target = 0x%X, GLsizei levels = %d, GLenum internalformat = 0x%X, GLsizei width = %d, GLsizei height = %d)",
target, levels, internalformat, width, height);
Context *context = GetValidGlobalContext();
if (context)
{
if (!context->getExtensions().textureStorage)
{
context->recordError(Error(GL_INVALID_OPERATION));
return;
}
if (context->getClientVersion() < 3 &&
!ValidateES2TexStorageParameters(context, target, levels, internalformat, width, height))
{
return;
}
if (context->getClientVersion() >= 3 &&
!ValidateES3TexStorageParameters(context, target, levels, internalformat, width, height, 1))
{
return;
}
Extents size(width, height, 1);
Texture *texture = context->getTargetTexture(target);
Error error = texture->setStorage(target, levels, internalformat, size);
if (error.isError())
{
context->recordError(error);
return;
}
}
}
void GL_APIENTRY VertexAttribDivisorANGLE(GLuint index, GLuint divisor)
{
EVENT("(GLuint index = %d, GLuint divisor = %d)", index, divisor);
Context *context = GetValidGlobalContext();
if (context)
{
if (index >= MAX_VERTEX_ATTRIBS)
{
context->recordError(Error(GL_INVALID_VALUE));
return;
}
if (context->getLimitations().attributeZeroRequiresZeroDivisorInEXT)
{
if (index == 0 && divisor != 0)
{
const char *errorMessage = "The current context doesn't support setting a non-zero divisor on the attribute with index zero. "
"Please reorder the attributes in your vertex shader so that attribute zero can have a zero divisor.";
context->recordError(Error(GL_INVALID_OPERATION, errorMessage));
// We also output an error message to the debugger window if tracing is active, so that developers can see the error message.
ERR("%s", errorMessage);
return;
}
}
context->setVertexAttribDivisor(index, divisor);
}
}
void GL_APIENTRY BlitFramebufferANGLE(GLint srcX0, GLint srcY0, GLint srcX1, GLint srcY1, GLint dstX0, GLint dstY0, GLint dstX1, GLint dstY1,
GLbitfield mask, GLenum filter)
{
EVENT("(GLint srcX0 = %d, GLint srcY0 = %d, GLint srcX1 = %d, GLint srcY1 = %d, "
"GLint dstX0 = %d, GLint dstY0 = %d, GLint dstX1 = %d, GLint dstY1 = %d, "
"GLbitfield mask = 0x%X, GLenum filter = 0x%X)",
srcX0, srcY0, srcX1, srcX1, dstX0, dstY0, dstX1, dstY1, mask, filter);
Context *context = GetValidGlobalContext();
if (context)
{
if (!ValidateBlitFramebufferParameters(context, srcX0, srcY0, srcX1, srcY1,
dstX0, dstY0, dstX1, dstY1, mask, filter,
true))
{
return;
}
Framebuffer *readFramebuffer = context->getState().getReadFramebuffer();
ASSERT(readFramebuffer);
Framebuffer *drawFramebuffer = context->getState().getDrawFramebuffer();
ASSERT(drawFramebuffer);
Rectangle srcArea(srcX0, srcY0, srcX1 - srcX0, srcY1 - srcY0);
Rectangle dstArea(dstX0, dstY0, dstX1 - dstX0, dstY1 - dstY0);
Error error =
drawFramebuffer->blit(context, srcArea, dstArea, mask, filter, readFramebuffer);
if (error.isError())
{
context->recordError(error);
return;
}
}
}
void GL_APIENTRY DiscardFramebufferEXT(GLenum target, GLsizei numAttachments, const GLenum *attachments)
{
EVENT("(GLenum target = 0x%X, GLsizei numAttachments = %d, attachments = 0x%0.8p)", target, numAttachments, attachments);
Context *context = GetValidGlobalContext();
if (context)
{
if (!context->getExtensions().discardFramebuffer)
{
context->recordError(Error(GL_INVALID_OPERATION, "Extension not enabled"));
return;
}
if (!ValidateDiscardFramebufferEXT(context, target, numAttachments, attachments))
{
return;
}
Framebuffer *framebuffer = context->getState().getTargetFramebuffer(target);
ASSERT(framebuffer);
// The specification isn't clear what should be done when the framebuffer isn't complete.
// We leave it up to the framebuffer implementation to decide what to do.
Error error = framebuffer->discard(numAttachments, attachments);
if (error.isError())
{
context->recordError(error);
return;
}
}
}
void GL_APIENTRY TexImage3DOES(GLenum target, GLint level, GLenum internalformat, GLsizei width, GLsizei height, GLsizei depth,
GLint border, GLenum format, GLenum type, const GLvoid* pixels)
{
EVENT("(GLenum target = 0x%X, GLint level = %d, GLenum internalformat = 0x%X, "
"GLsizei width = %d, GLsizei height = %d, GLsizei depth = %d, GLint border = %d, "
"GLenum format = 0x%X, GLenum type = 0x%x, const GLvoid* pixels = 0x%0.8p)",
target, level, internalformat, width, height, depth, border, format, type, pixels);
UNIMPLEMENTED(); // FIXME
}
void GL_APIENTRY GetProgramBinaryOES(GLuint program, GLsizei bufSize, GLsizei *length, GLenum *binaryFormat, void *binary)
{
EVENT("(GLenum program = 0x%X, bufSize = %d, length = 0x%0.8p, binaryFormat = 0x%0.8p, binary = 0x%0.8p)",
program, bufSize, length, binaryFormat, binary);
Context *context = GetValidGlobalContext();
if (context)
{
Program *programObject = context->getProgram(program);
if (!programObject || !programObject->isLinked())
{
context->recordError(Error(GL_INVALID_OPERATION));
return;
}
Error error = programObject->saveBinary(binaryFormat, binary, bufSize, length);
if (error.isError())
{
context->recordError(error);
return;
}
}
}
void GL_APIENTRY ProgramBinaryOES(GLuint program, GLenum binaryFormat, const void *binary, GLint length)
{
EVENT("(GLenum program = 0x%X, binaryFormat = 0x%x, binary = 0x%0.8p, length = %d)",
program, binaryFormat, binary, length);
Context *context = GetValidGlobalContext();
if (context)
{
const std::vector<GLenum> &programBinaryFormats = context->getCaps().programBinaryFormats;
if (std::find(programBinaryFormats.begin(), programBinaryFormats.end(), binaryFormat) == programBinaryFormats.end())
{
context->recordError(Error(GL_INVALID_ENUM));
return;
}
Program *programObject = context->getProgram(program);
if (!programObject)
{
context->recordError(Error(GL_INVALID_OPERATION));
return;
}
Error error = programObject->loadBinary(binaryFormat, binary, length);
if (error.isError())
{
context->recordError(error);
return;
}
}
}
void GL_APIENTRY DrawBuffersEXT(GLsizei n, const GLenum *bufs)
{
EVENT("(GLenum n = %d, bufs = 0x%0.8p)", n, bufs);
Context *context = GetValidGlobalContext();
if (context)
{
if (!ValidateDrawBuffers(context, n, bufs))
{
return;
}
Framebuffer *framebuffer = context->getState().getDrawFramebuffer();
ASSERT(framebuffer);
framebuffer->setDrawBuffers(n, bufs);
}
}
void GL_APIENTRY GetBufferPointervOES(GLenum target, GLenum pname, void** params)
{
EVENT("(GLenum target = 0x%X, GLenum pname = 0x%X, GLvoid** params = 0x%0.8p)", target, pname, params);
Context *context = GetValidGlobalContext();
if (context)
{
if (!ValidBufferTarget(context, target))
{
context->recordError(Error(GL_INVALID_ENUM));
return;
}
if (pname != GL_BUFFER_MAP_POINTER)
{
context->recordError(Error(GL_INVALID_ENUM));
return;
}
Buffer *buffer = context->getState().getTargetBuffer(target);
if (!buffer || !buffer->isMapped())
{
*params = NULL;
}
else
{
*params = buffer->getMapPointer();
}
}
}
void *GL_APIENTRY MapBufferOES(GLenum target, GLenum access)
{
EVENT("(GLenum target = 0x%X, GLbitfield access = 0x%X)", target, access);
Context *context = GetValidGlobalContext();
if (context)
{
if (!ValidBufferTarget(context, target))
{
context->recordError(Error(GL_INVALID_ENUM));
return NULL;
}
Buffer *buffer = context->getState().getTargetBuffer(target);
if (buffer == NULL)
{
context->recordError(Error(GL_INVALID_OPERATION));
return NULL;
}
if (access != GL_WRITE_ONLY_OES)
{
context->recordError(Error(GL_INVALID_ENUM));
return NULL;
}
if (buffer->isMapped())
{
context->recordError(Error(GL_INVALID_OPERATION));
return NULL;
}
Error error = buffer->map(access);
if (error.isError())
{
context->recordError(error);
return NULL;
}
return buffer->getMapPointer();
}
return NULL;
}
GLboolean GL_APIENTRY UnmapBufferOES(GLenum target)
{
EVENT("(GLenum target = 0x%X)", target);
Context *context = GetValidGlobalContext();
if (context)
{
if (!ValidBufferTarget(context, target))
{
context->recordError(Error(GL_INVALID_ENUM));
return GL_FALSE;
}
Buffer *buffer = context->getState().getTargetBuffer(target);
if (buffer == NULL || !buffer->isMapped())
{
context->recordError(Error(GL_INVALID_OPERATION));
return GL_FALSE;
}
GLboolean result;
Error error = buffer->unmap(&result);
if (error.isError())
{
context->recordError(error);
return GL_FALSE;
}
return result;
}
return GL_FALSE;
}
void *GL_APIENTRY MapBufferRangeEXT(GLenum target, GLintptr offset, GLsizeiptr length, GLbitfield access)
{
EVENT("(GLenum target = 0x%X, GLintptr offset = %d, GLsizeiptr length = %d, GLbitfield access = 0x%X)",
target, offset, length, access);
Context *context = GetValidGlobalContext();
if (context)
{
if (!ValidBufferTarget(context, target))
{
context->recordError(Error(GL_INVALID_ENUM));
return NULL;
}
if (offset < 0 || length < 0)
{
context->recordError(Error(GL_INVALID_VALUE));
return NULL;
}
Buffer *buffer = context->getState().getTargetBuffer(target);
if (buffer == NULL)
{
context->recordError(Error(GL_INVALID_OPERATION));
return NULL;
}
// Check for buffer overflow
size_t offsetSize = static_cast<size_t>(offset);
size_t lengthSize = static_cast<size_t>(length);
if (!rx::IsUnsignedAdditionSafe(offsetSize, lengthSize) ||
offsetSize + lengthSize > static_cast<size_t>(buffer->getSize()))
{
context->recordError(Error(GL_INVALID_VALUE));
return NULL;
}
// Check for invalid bits in the mask
GLbitfield allAccessBits = GL_MAP_READ_BIT |
GL_MAP_WRITE_BIT |
GL_MAP_INVALIDATE_RANGE_BIT |
GL_MAP_INVALIDATE_BUFFER_BIT |
GL_MAP_FLUSH_EXPLICIT_BIT |
GL_MAP_UNSYNCHRONIZED_BIT;
if (access & ~(allAccessBits))
{
context->recordError(Error(GL_INVALID_VALUE));
return NULL;
}
if (length == 0 || buffer->isMapped())
{
context->recordError(Error(GL_INVALID_OPERATION));
return NULL;
}
// Check for invalid bit combinations
if ((access & (GL_MAP_READ_BIT | GL_MAP_WRITE_BIT)) == 0)
{
context->recordError(Error(GL_INVALID_OPERATION));
return NULL;
}
GLbitfield writeOnlyBits = GL_MAP_INVALIDATE_RANGE_BIT |
GL_MAP_INVALIDATE_BUFFER_BIT |
GL_MAP_UNSYNCHRONIZED_BIT;
if ((access & GL_MAP_READ_BIT) != 0 && (access & writeOnlyBits) != 0)
{
context->recordError(Error(GL_INVALID_OPERATION));
return NULL;
}
if ((access & GL_MAP_WRITE_BIT) == 0 && (access & GL_MAP_FLUSH_EXPLICIT_BIT) != 0)
{
context->recordError(Error(GL_INVALID_OPERATION));
return NULL;
}
Error error = buffer->mapRange(offset, length, access);
if (error.isError())
{
context->recordError(error);
return NULL;
}
return buffer->getMapPointer();
}
return NULL;
}
void GL_APIENTRY FlushMappedBufferRangeEXT(GLenum target, GLintptr offset, GLsizeiptr length)
{
EVENT("(GLenum target = 0x%X, GLintptr offset = %d, GLsizeiptr length = %d)", target, offset, length);
Context *context = GetValidGlobalContext();
if (context)
{
if (offset < 0 || length < 0)
{
context->recordError(Error(GL_INVALID_VALUE));
return;
}
if (!ValidBufferTarget(context, target))
{
context->recordError(Error(GL_INVALID_ENUM));
return;
}
Buffer *buffer = context->getState().getTargetBuffer(target);
if (buffer == NULL)
{
context->recordError(Error(GL_INVALID_OPERATION));
return;
}
if (!buffer->isMapped() || (buffer->getAccessFlags() & GL_MAP_FLUSH_EXPLICIT_BIT) == 0)
{
context->recordError(Error(GL_INVALID_OPERATION));
return;
}
// Check for buffer overflow
size_t offsetSize = static_cast<size_t>(offset);
size_t lengthSize = static_cast<size_t>(length);
if (!rx::IsUnsignedAdditionSafe(offsetSize, lengthSize) ||
offsetSize + lengthSize > static_cast<size_t>(buffer->getMapLength()))
{
context->recordError(Error(GL_INVALID_VALUE));
return;
}
// We do not currently support a non-trivial implementation of FlushMappedBufferRange
}
}
void GL_APIENTRY InsertEventMarkerEXT(GLsizei length, const char *marker)
{
// Don't run an EVENT() macro on the EXT_debug_marker entry points.
// It can interfere with the debug events being set by the caller.
Context *context = GetValidGlobalContext();
if (context)
{
if (!context->getExtensions().debugMarker)
{
// The debug marker calls should not set error state
// However, it seems reasonable to set an error state if the extension is not enabled
context->recordError(Error(GL_INVALID_OPERATION, "Extension not enabled"));
return;
}
if (!ValidateInsertEventMarkerEXT(context, length, marker))
{
return;
}
context->insertEventMarker(length, marker);
}
}
void GL_APIENTRY PushGroupMarkerEXT(GLsizei length, const char *marker)
{
// Don't run an EVENT() macro on the EXT_debug_marker entry points.
// It can interfere with the debug events being set by the caller.
Context *context = GetValidGlobalContext();
if (context)
{
if (!context->getExtensions().debugMarker)
{
// The debug marker calls should not set error state
// However, it seems reasonable to set an error state if the extension is not enabled
context->recordError(Error(GL_INVALID_OPERATION, "Extension not enabled"));
return;
}
if (!ValidatePushGroupMarkerEXT(context, length, marker))
{
return;
}
if (marker == nullptr)
{
// From the EXT_debug_marker spec,
// "If <marker> is null then an empty string is pushed on the stack."
context->pushGroupMarker(length, "");
}
else
{
context->pushGroupMarker(length, marker);
}
}
}
void GL_APIENTRY PopGroupMarkerEXT()
{
// Don't run an EVENT() macro on the EXT_debug_marker entry points.
// It can interfere with the debug events being set by the caller.
Context *context = GetValidGlobalContext();
if (context)
{
if (!context->getExtensions().debugMarker)
{
// The debug marker calls should not set error state
// However, it seems reasonable to set an error state if the extension is not enabled
context->recordError(Error(GL_INVALID_OPERATION, "Extension not enabled"));
return;
}
context->popGroupMarker();
}
}
ANGLE_EXPORT void GL_APIENTRY EGLImageTargetTexture2DOES(GLenum target, GLeglImageOES image)
{
EVENT("(GLenum target = 0x%X, GLeglImageOES image = 0x%0.8p)", target, image);
Context *context = GetValidGlobalContext();
if (context)
{
egl::Display *display = egl::GetGlobalDisplay();
egl::Image *imageObject = reinterpret_cast<egl::Image *>(image);
if (!ValidateEGLImageTargetTexture2DOES(context, display, target, imageObject))
{
return;
}
Texture *texture = context->getTargetTexture(target);
Error error = texture->setEGLImageTarget(target, imageObject);
if (error.isError())
{
context->recordError(error);
return;
}
}
}
ANGLE_EXPORT void GL_APIENTRY EGLImageTargetRenderbufferStorageOES(GLenum target,
GLeglImageOES image)
{
EVENT("(GLenum target = 0x%X, GLeglImageOES image = 0x%0.8p)", target, image);
Context *context = GetValidGlobalContext();
if (context)
{
egl::Display *display = egl::GetGlobalDisplay();
egl::Image *imageObject = reinterpret_cast<egl::Image *>(image);
if (!ValidateEGLImageTargetRenderbufferStorageOES(context, display, target, imageObject))
{
return;
}
Renderbuffer *renderbuffer = context->getState().getCurrentRenderbuffer();
Error error = renderbuffer->setStorageEGLImageTarget(imageObject);
if (error.isError())
{
context->recordError(error);
return;
}
}
}
void GL_APIENTRY BindVertexArrayOES(GLuint array)
{
EVENT("(GLuint array = %u)", array);
Context *context = GetValidGlobalContext();
if (context)
{
if (!ValidateBindVertexArrayOES(context, array))
{
return;
}
context->bindVertexArray(array);
}
}
void GL_APIENTRY DeleteVertexArraysOES(GLsizei n, const GLuint *arrays)
{
EVENT("(GLsizei n = %d, const GLuint* arrays = 0x%0.8p)", n, arrays);
Context *context = GetValidGlobalContext();
if (context)
{
if (!ValidateDeleteVertexArraysOES(context, n))
{
return;
}
for (int arrayIndex = 0; arrayIndex < n; arrayIndex++)
{
if (arrays[arrayIndex] != 0)
{
context->deleteVertexArray(arrays[arrayIndex]);
}
}
}
}
void GL_APIENTRY GenVertexArraysOES(GLsizei n, GLuint *arrays)
{
EVENT("(GLsizei n = %d, GLuint* arrays = 0x%0.8p)", n, arrays);
Context *context = GetValidGlobalContext();
if (context)
{
if (!ValidateGenVertexArraysOES(context, n))
{
return;
}
for (int arrayIndex = 0; arrayIndex < n; arrayIndex++)
{
arrays[arrayIndex] = context->createVertexArray();
}
}
}
GLboolean GL_APIENTRY IsVertexArrayOES(GLuint array)
{
EVENT("(GLuint array = %u)", array);
Context *context = GetValidGlobalContext();
if (context)
{
if (!ValidateIsVertexArrayOES(context))
{
return GL_FALSE;
}
if (array == 0)
{
return GL_FALSE;
}
VertexArray *vao = context->getVertexArray(array);
return (vao != nullptr ? GL_TRUE : GL_FALSE);
}
return GL_FALSE;
}
}
``` |
Affinger Bach is a river of Bavaria, Germany. It flows into the Friedberger Ach in Anwalting.
See also
List of rivers of Bavaria
References
Rivers of Bavaria
Rivers of Germany |
```java
/**
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package org.thingsboard.server.common.data.sync.vc;
import lombok.Data;
import lombok.NoArgsConstructor;
import org.thingsboard.server.common.data.id.EntityId;
@Data
@NoArgsConstructor
public class VersionedEntityInfo {
private EntityId externalId;
public VersionedEntityInfo(EntityId externalId) {
this.externalId = externalId;
}
}
``` |
```c++
/*
This program is free software; you can redistribute it and/or modify
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include <ndb_global.h>
#include <ndb_opts.h>
#include <NdbOut.hpp>
#include <NdbApi.hpp>
#include <NDBT.hpp>
static const char* _dbname = "TEST_DB";
const char *load_default_groups[]= { "mysql_cluster",0 };
static struct my_option my_long_options[] =
{
NDB_STD_OPTS("ndb_desc"),
{ "database", 'd', "Name of database table is in",
(uchar**) &_dbname, (uchar**) &_dbname, 0,
GET_STR, REQUIRED_ARG, 0, 0, 0, 0, 0, 0 },
{ 0, 0, 0, 0, 0, 0, GET_NO_ARG, NO_ARG, 0, 0, 0, 0, 0, 0}
};
static void short_usage_sub(void)
{
ndb_short_usage_sub(NULL);
}
static void usage()
{
ndb_usage(short_usage_sub, load_default_groups, my_long_options);
}
int main(int argc, char** argv){
NDB_INIT(argv[0]);
ndb_opt_set_usage_funcs(short_usage_sub, usage);
load_defaults("my",load_default_groups,&argc,&argv);
int ho_error;
if ((ho_error=handle_options(&argc, &argv, my_long_options,
ndb_std_get_one_option)))
return NDBT_ProgramExit(NDBT_WRONGARGS);
if (argc < 1) {
usage();
return NDBT_ProgramExit(NDBT_WRONGARGS);
}
Ndb_cluster_connection con(opt_ndb_connectstring, opt_ndb_nodeid);
con.set_name("ndb_drop_table");
if(con.connect(12, 5, 1) != 0)
{
ndbout << "Unable to connect to management server." << endl;
return NDBT_ProgramExit(NDBT_FAILED);
}
if (con.wait_until_ready(30,3) < 0)
{
ndbout << "Cluster nodes not ready in 30 seconds." << endl;
return NDBT_ProgramExit(NDBT_FAILED);
}
Ndb MyNdb(&con, _dbname );
if(MyNdb.init() != 0){
ERR(MyNdb.getNdbError());
return NDBT_ProgramExit(NDBT_FAILED);
}
int res = 0;
for(int i = 0; i<argc; i++){
ndbout << "Dropping table " << argv[i] << "...";
int tmp;
if((tmp = MyNdb.getDictionary()->dropTable(argv[i])) != 0){
ndbout << endl << MyNdb.getDictionary()->getNdbError() << endl;
res = tmp;
} else {
ndbout << "OK" << endl;
}
}
if(res != 0){
return NDBT_ProgramExit(NDBT_FAILED);
}
return NDBT_ProgramExit(NDBT_OK);
}
``` |
```java
/**
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package org.thingsboard.monitoring.client;
import org.springframework.beans.factory.annotation.Value;
import org.springframework.beans.factory.config.ConfigurableBeanFactory;
import org.springframework.boot.web.client.RestTemplateBuilder;
import org.springframework.context.annotation.Scope;
import org.springframework.stereotype.Component;
import org.thingsboard.rest.client.RestClient;
import java.time.Duration;
@Component
@Scope(ConfigurableBeanFactory.SCOPE_PROTOTYPE)
public class TbClient extends RestClient {
@Value("${monitoring.rest.username}")
private String username;
@Value("${monitoring.rest.password}")
private String password;
public TbClient(@Value("${monitoring.rest.base_url}") String baseUrl,
@Value("${monitoring.rest.request_timeout_ms}") int requestTimeoutMs) {
super(new RestTemplateBuilder()
.setConnectTimeout(Duration.ofMillis(requestTimeoutMs))
.setReadTimeout(Duration.ofMillis(requestTimeoutMs))
.build(), baseUrl);
}
public String logIn() {
login(username, password);
return getToken();
}
}
``` |
Oreoleuciscus is a genus of medium to large cyprinid freshwater fish which is only found in Mongolia and adjacent parts of Russia.
Species
There are currently four recognized species in this genus:
Oreoleuciscus angusticephalus Bogutskaya, 2001 (Narrow-headed Altai osman)
Oreoleuciscus dsapchynensis Warpachowski, 1889
Oreoleuciscus humilis Warpachowski, 1889 (Dwarf Altai osman)
Oreoleuciscus potanini (Kessler, 1879) (Altai osman)
References
Cyprinid fish of Asia
Cyprinidae genera |
Helena Roque Gameiro Leitao de Barros (1895–1986) was a Portuguese watercolourist and painter.
Biography
Helena Roque Gameiro was the daughter of painter Alfredo Roque Gameiro and Maria da Assuncao de Carvalho Forte. Her sisters Raquel, Màmia and brothers Manuel and Ruy were also artists. At the age of 14, she began teaching drawing and painting at her father's studio located on Rua D. Pedro V in Lisbon.
Roque Gameiro became professor of Decorative Arts at Escola Secundária Artística António Arroio and served for over 25 years. On 14 June 1940 she was made an Officer of the Order of Public Instruction.
Roque Gameiro married film director Jose Leitao de Barros on 17 August 1923 in Oeiras. The couple had two children, José Manuel and Maria Helena.
Career
Along with her siblings Raquel and Manuel, Helena Roque Gameiro participated in a 1911 exhibition held in her father's studio. She also exhibited watercolors in several exhibitions at the (SNBA) in 1912, 1915, 1924, and 1925. At the 10th Exhibition in 1913 she received an honorable mention in the Watercolor category. She also participated in the first SNBA Watercolor Exhibition in 1914. In 1917, she won first place in the Watercolour category in the Third Watercolor, Drawing and Miniature Exhibition. In 1920, she accompanied her father to Rio de Janeiro and São Paulo, where she was well received. In May 1922, she organized an exhibition of Applied Art. She later presented her work in January 1923. In 1933 she exhibited in Porto with her father and sister Raquel.
After the death of her father in 1935, Roque Gameiro ceased exhibiting her work, only participating in a exhibition of her watercolors in 1947 held in the National Information Secretariat.
She died on 26 April 1986 and is buried in Prazeres Cemetery.
Roque Gameiro's work is part of a number of national museums and galleries, including: the National Museum of Contemporary Art (Portugal), the Jose Malhoa Museum, the Grão Vasco National Museum and the Museum of Modern Art, Rio de Janeiro.
References
1895 births
1986 deaths
20th-century Portuguese women artists
20th-century Portuguese painters
Portuguese women painters
Portuguese watercolourists
Women watercolorists
Artists from Lisbon
Sibling artists |
```java
/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* published by the Free Software Foundation. Oracle designates this
* particular file as subject to the "Classpath" exception as provided
* by Oracle in the LICENSE file that accompanied this code.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
package org.graalvm.visualvm.pluginimporter;
import java.io.BufferedInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.util.Collection;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.jar.JarFile;
import java.util.jar.Manifest;
import java.util.logging.Level;
import java.util.logging.Logger;
import org.netbeans.api.autoupdate.UpdateUnitProvider;
import org.netbeans.api.autoupdate.UpdateUnitProvider.CATEGORY;
import org.netbeans.spi.autoupdate.UpdateItem;
import org.netbeans.spi.autoupdate.UpdateProvider;
import org.openide.util.NbBundle;
import org.openide.util.lookup.ServiceProvider;
import org.openide.xml.EntityCatalog;
import org.openide.xml.XMLUtil;
import org.w3c.dom.Document;
import org.w3c.dom.Element;
import org.w3c.dom.Node;
import org.w3c.dom.NodeList;
import org.xml.sax.InputSource;
import org.xml.sax.SAXException;
/**
*
* @author Jiri Rechtacek
*/
@ServiceProvider(service=UpdateProvider.class)
public class ClusterUpdateProvider implements UpdateProvider {
private static File cluster = null;
private static final Logger LOG = Logger.getLogger (ClusterUpdateProvider.class.getName ());
private static final String ELEMENT_MODULE = "module"; // NOI18N
public ClusterUpdateProvider () {}
public static void attachCluster (File newCluster) {
if (newCluster == null) {
throw new IllegalArgumentException ("Cluster cannot be null!"); // NOI18N
}
cluster = newCluster;
}
public String getName () {
return Installer.CODE_NAME;
}
public String getDisplayName () {
if (cluster == null) {
return NbBundle.getMessage(ClusterUpdateProvider.class, "ClusterUpdateProvider_DisplayName_disabled");
}
return NbBundle.getMessage (ClusterUpdateProvider.class, "ClusterUpdateProvider_DisplayName", cluster); // NOI18N
}
public String getDescription () {
return NbBundle.getMessage (ClusterUpdateProvider.class, "ClusterUpdateProvider_Description"); // NOI18N
}
public CATEGORY getCategory () {
return UpdateUnitProvider.CATEGORY.STANDARD;
}
public Map<String, UpdateItem> getUpdateItems () throws IOException {
Map<String, UpdateItem> res = new HashMap<> ();
for (File cf: readModules (cluster)) {
String cnb = (cf.getName ().substring (0, cf.getName ().length () - ".xml".length ())).replaceAll ("-", "."); // NOI18N
Map<String, String> attr = new HashMap<> (7);
readConfigFile (cf, attr);
String jarName = attr.get ("jar");
if(jarName == null) {
LOG.info ("Can`t get jar file name for " + cnb + ", skip checking.");
continue;
}
File jarFile = new File (cluster, jarName); // NOI18N
if (! jarFile.exists ()) {
LOG.info ("Jar file " + jarFile + " doesn't exists. Skip checking " + cnb);
continue;
}
File updateTrackingFile = new File(cluster, "update_tracking" + File.separator + cf.getName());
if (! updateTrackingFile.exists ()) {
LOG.info ("Update tracking file " + updateTrackingFile + " doesn't exists. Skip checking " + cnb);
continue;
}
Manifest mf = new JarFile (jarFile).getManifest ();
UpdateItem item = UpdateItem.createModule (
cnb,
attr.get ("specversion"), // NOI18N
null,
cluster.getName (), // XXX: to identify such items later
"0", // NOI18N
"",
"",
"",
mf,
Boolean.valueOf (attr.get ("eager")), // NOI18N
Boolean.valueOf (attr.get ("autoload")), // NOI18N
null,
null,
"",
res.put (cnb + '_' + attr.get ("specversion"), item); // NOI18N
}
return res;
}
public boolean refresh (boolean force) throws IOException {
return true;
}
private static Collection<File> readModules (File cluster) {
if (cluster == null || ! cluster.exists ()) {
return Collections.emptySet ();
}
Collection<File> res = new HashSet<> ();
File config = new File (new File (cluster, "config"), "Modules"); // NOI18N
if (config.listFiles () == null) {
return Collections.emptySet ();
}
for (File cf : config.listFiles ()) {
if(cf.getName ().endsWith(".xml_hidden")) {
//158204
continue;
}
if (cf.getName ().endsWith (".xml")) { // NOI18N
if(cf.length() > 0) {
res.add (cf);
} else {
LOG.log(Level.INFO, "Found zero-sized xml file in config/Modules, ignoring: " + cf);
}
} else {
LOG.log(Level.INFO, "Found non-xml file in config/Modules, ignoring: " + cf);
}
}
return res;
}
private static void readConfigFile (File cf, Map<String, String> attr) {
Document document = null;
InputStream is = null;
try {
is = new BufferedInputStream (new FileInputStream (cf));
InputSource xmlInputSource = new InputSource (is);
document = XMLUtil.parse (xmlInputSource, false, false, null, EntityCatalog.getDefault ());
} catch (SAXException saxe) {
LOG.log(Level.INFO, "Error while reading " + cf);
LOG.log(Level.INFO, saxe.getLocalizedMessage (), saxe);
return;
} catch (IOException ioe) {
LOG.log(Level.INFO, "Error while reading " + cf);
LOG.log(Level.WARNING, ioe.getLocalizedMessage (), ioe);
} finally {
if (is != null) {
try {
is.close ();
} catch (IOException e){
//ignore
}
}
}
assert document.getDocumentElement () != null : "File " + cf + " must contain document element.";
Element element = document.getDocumentElement ();
assert ELEMENT_MODULE.equals (element.getTagName ()) : "The root element is: " + ELEMENT_MODULE + " but was: " + element.getTagName ();
NodeList children = element.getChildNodes ();
for (int i = 0; i < children.getLength (); i++) {
Node n = children.item (i);
if (Node.ELEMENT_NODE != n.getNodeType()) {
continue;
}
Element e = (Element) n;
String name = e.getAttributes ().getNamedItem ("name").getNodeValue (); // NOI18N
String value = e.getChildNodes ().item (0).getNodeValue ();
attr.put (name, value);
}
}
}
``` |
Paleni (Paléni), also known as Wara (Ouara, Ouala), is a minor Niger–Congo language spoken in the village of Faniagara in Burkina.
References
Wara–Natyoro languages
Languages of Burkina Faso |
```xml
<vector xmlns:android="path_to_url"
xmlns:tools="path_to_url"
android:width="640dp"
android:height="512dp"
android:viewportWidth="640.0"
android:viewportHeight="512.0"
tools:keep="@drawable/fa_vnv">
<path
android:fillColor="#FFFFFFFF"
android:pathData="M104.9,352c-34.1,0 -46.4,-30.4 -46.4,-30.4L2.6,210.1S-7.8,192 13,192h32.8c10.4,0 13.2,8.7 18.8,18.1l36.7,74.5s5.2,13.1 21.1,13.1 21.1,-13.1 21.1,-13.1l36.7,-74.5c5.6,-9.5 8.4,-18.1 18.8,-18.1h32.8c20.8,0 10.4,18.1 10.4,18.1l-55.8,111.5S174.2,352 140,352h-35.1zM499.9,352c-34.1,0 -46.4,-30.4 -46.4,-30.4l-55.9,-111.5S387.2,192 408,192h32.8c10.4,0 13.2,8.7 18.8,18.1l36.7,74.5s5.2,13.1 21.1,13.1 21.1,-13.1 21.1,-13.1l36.8,-74.5c5.6,-9.5 8.4,-18.1 18.8,-18.1L627,192c20.8,0 10.4,18.1 10.4,18.1l-55.9,111.5S569.3,352 535.1,352h-35.2zM337.6,192c34.1,0 46.4,30.4 46.4,30.4l55.9,111.5s10.4,18.1 -10.4,18.1h-32.8c-10.4,0 -13.2,-8.7 -18.8,-18.1l-36.7,-74.5s-5.2,-13.1 -21.1,-13.1c-15.9,0 -21.1,13.1 -21.1,13.1l-36.7,74.5c-5.6,9.4 -8.4,18.1 -18.8,18.1h-32.9c-20.8,0 -10.4,-18.1 -10.4,-18.1l55.9,-111.5s12.2,-30.4 46.4,-30.4h35.1z"/>
</vector>
``` |
Theta Tau is a professional engineering fraternity established at the University of Minnesota in 1904. Below is a list of the Theta Tau chapters. Active chapters are indicated in bold. Inactive chapters are in italics.
Notes
References
Lists of chapters of Professional Fraternity Association members by society
Engineering societies based in the United States |
Çakılköy is a village in the Çan District of Çanakkale Province in Turkey. Its population is 167 (2021).
References
Villages in Çan District |
Crupilly is a commune in the Aisne department in Hauts-de-France in northern France.
Population
See also
Communes of the Aisne department
References
Communes of Aisne
Aisne communes articles needing translation from French Wikipedia |
Iponjola is an administrative ward in Rungwe District, Mbeya Region, Tanzania. In 2016 the Tanzania National Bureau of Statistics report there were 6,633 people in the ward.
Villages and hamlets
The ward has 4 villages, and 13 hamlets.
Iponjola
Iponjola
Ngena
Njelenje
Ilalabwe
Bujesi
Igisa
Ilalabwe
Ipangalwigi
Lugombo
Bujela
Ipande
Lugombo
Lupaso
Ngana
Ibagha
Ngana
References
Wards of Mbeya Region
Rungwe District
Constituencies of Tanzania |
Yusif Sayigh (1916–2004) was a Palestinian economist, academic and politician. He was an Arab nationalist and is known for his both academic and practical activities on economic development of Arabs.
Early life and education
Sayigh was born in al-Bassa, northern Palestine, in 1916. He was the eldest of Abdullah Sayigh and Afifa Batruni's six sons, including Anis Sayigh and Tawfiq Sayigh. He also had a sister, Mary. His father was a Protestant pastor of Syrian origin, and his mother was a native of al-Bassa. Shortly after the birth of Yusif, the family moved to Kharaba, Syria.
When a Druze revolt occurred in 1925, the family had to leave Kharaba and settled in al-Bassa. His father was assigned to a church in Tiberias in 1930 where they lived until May 1948. They were forced to leave the city which was captured by the Zionist forces of the newly founded Israel state after the Deir Yassin massacre.
Sayigh went to Sidon at age 13 for high school education and obtained a degree in business administration from American University of Beirut in 1938. He received his MA degree from the American University of Beirut in 1952, and his thesis was entitled Economic Implications of UNRWA Operations in Jordan, Syria, and Lebanon. During his university studies he joined the Syrian Social Nationalist Party (SSNP) led by Antoun Saadeh. Sayigh went to the US for the doctorate studies in 1954 when he was awarded a Fulbright scholarship and graduated from Johns Hopkins University in 1958. His PhD thesis was published with the title Entrepreneurs of Lebanon in 1962.
Career and activities
Sayigh was first employed as a lecturer in Tikrit, Iraq, between 1939 and 1940 after he received a degree in business. He had to return to Tiberias because of his mother's illness and worked at the Tiberias Hotel. Then he became an official in the Bayt al-Mal which was the fund of the Arab Higher Committee. During this period he also headed the Palestinian branch of the SSNP.
At the end of World War II Sayigh involved in the activities to raise funds to buy lands in Palestine to block the Jewish settlement. He was arrested during the 1948 Palestine war and released from prison in 1949. Then he went into exile settling in Beirut and became a Syrian citizen. After he received his PhD from Johns Hopkins University he returned to Beirut and joined the American University of Beirut where he taught courses on development economics and became a professor economics in 1963. In addition, he taught at different universities, including Princeton University, Harvard University and the University of Oxford. Sayigh was the head of the Economic Research Institute of the American University of Beirut from 1962 to 1964. He retired from his university post in 1974.
Sayigh was elected as a member of the Palestinian National Council in 1966. He was the member of the executive committee of the Palestine Liberation Organization (PLO) between 1968 and 1974. He was instrumental in the establishment of the Planning Center in Beirut which he headed between 1968 and 1971. He also served as the treasurer of the PLO's National Fund from 1971 to 1974 and as its official representative to the World Bank. In the 1980s and 1990s he was a member of the PLO's Parliament in-exile.
Sayigh worked as an adviser to the Kuwait's Planning Board between 1964 and 1965 and developed a five-year development plan for the country. He was an economic adviser to the Arab League. He headed the Arab Society for Economic Research between 1992 and 1995. In addition, he was also active in the establishment of the Centre for Arab Unity Studies, the Arab Though Forum based in Jordan and the Economic Research Forum for the Arab Countries based in Iran and Turkey.
Work
Sayigh published many books and articles which are mostly about economic development of the Arab countries. Some of his books included The Economies of the Arab World (1978), The Arab Economy (1982) and Arab Oil Policies (1983). His 1966 analysis on the value of the property of the Palestinian refugees which they had to abandon in Palestine was the first study on the topic.
Sayigh also wrote a comprehensive report for the PLO entitled The Programme for Development of the Palestinian National Economy 1994–2000 in collaboration with the Palestinian experts.
Views
Sayigh was an advocate of the heterodox economics based on the public goods and social justice. He argued in 1986 that there could not be any economic development in Palestine under occupation.
For Sayigh the first intifada of Palestinians in 1988 contributed to the global understanding of their struggle for national self-determination and expanded the support for an independent Palestinian state.
Personal life and death
Sayigh was married to Rosemary Sayigh, elder sister of the British journalist Mark Boxer. They met in Beirut and wed at the National Evangelical Church in Beirut on 7 October 1953. They had three children: Joumana, Yezid and Faris. Yezid Sayigh is an academic. Yusif Sayigh died in 2004.
Awards
Sayigh was the recipient of the prize of the Kuwait Institute for Scientific Research in 1981 and of the Abdullah Tariki Award in 2000.
Legacy
His wife, Rosemary Sayigh, edited a book on Yusif Sayigh entitled Yusif Sayigh: Arab Economist, Palestinian Patriot. A Fractured Life in 2015.
References
External links
20th-century Palestinian politicians
20th-century Palestinian writers
20th-century economists
1916 births
2004 deaths
Palestinian emigrants to Lebanon
Palestinian economists
American University of Beirut alumni
Johns Hopkins University alumni
Academic staff of the American University of Beirut
Members of the Palestinian National Council
Palestinian prisoners and detainees
Syrian Social Nationalist Party in Lebanon politicians
Palestinian evangelicals
Members of the Palestinian Central Council
Development economists
Fulbright alumni
Arab people in Mandatory Palestine |
```html
<html lang="en">
<head>
<title>i386-16bit - Using as</title>
<meta http-equiv="Content-Type" content="text/html">
<meta name="description" content="Using as">
<meta name="generator" content="makeinfo 4.8">
<link title="Top" rel="start" href="index.html#Top">
<link rel="up" href="i386_002dDependent.html#i386_002dDependent" title="i386-Dependent">
<link rel="prev" href="i386_002dTBM.html#i386_002dTBM" title="i386-TBM">
<link rel="next" href="i386_002dArch.html#i386_002dArch" title="i386-Arch">
<link href="path_to_url" rel="generator-home" title="Texinfo Homepage">
<!--
This file documents the GNU Assembler "as".
Permission is granted to copy, distribute and/or modify this document
or any later version published by the Free Software Foundation;
with no Invariant Sections, with no Front-Cover Texts, and with no
Back-Cover Texts. A copy of the license is included in the
-->
<meta http-equiv="Content-Style-Type" content="text/css">
<style type="text/css"><!--
pre.display { font-family:inherit }
pre.format { font-family:inherit }
pre.smalldisplay { font-family:inherit; font-size:smaller }
pre.smallformat { font-family:inherit; font-size:smaller }
pre.smallexample { font-size:smaller }
pre.smalllisp { font-size:smaller }
span.sc { font-variant:small-caps }
span.roman { font-family:serif; font-weight:normal; }
span.sansserif { font-family:sans-serif; font-weight:normal; }
--></style>
</head>
<body>
<div class="node">
<p>
<a name="i386-16bit"></a>
<a name="i386_002d16bit"></a>
Next: <a rel="next" accesskey="n" href="i386_002dArch.html#i386_002dArch">i386-Arch</a>,
Previous: <a rel="previous" accesskey="p" href="i386_002dTBM.html#i386_002dTBM">i386-TBM</a>,
Up: <a rel="up" accesskey="u" href="i386_002dDependent.html#i386_002dDependent">i386-Dependent</a>
<hr>
</div>
<h4 class="subsection">9.15.14 Writing 16-bit Code</h4>
<p><a name="index-i386-16_002dbit-code-1149"></a><a name="index-g_t16_002dbit-code_002c-i386-1150"></a><a name="index-real_002dmode-code_002c-i386-1151"></a><a name="index-g_t_0040code_007bcode16gcc_007d-directive_002c-i386-1152"></a><a name="index-g_t_0040code_007bcode16_007d-directive_002c-i386-1153"></a><a name="index-g_t_0040code_007bcode32_007d-directive_002c-i386-1154"></a><a name="index-g_t_0040code_007bcode64_007d-directive_002c-i386-1155"></a><a name=your_sha256_hash6"></a>While <code>as</code> normally writes only “pure” 32-bit i386 code
or 64-bit x86-64 code depending on the default configuration,
it also supports writing code to run in real mode or in 16-bit protected
mode code segments. To do this, put a `<samp><span class="samp">.code16</span></samp>' or
`<samp><span class="samp">.code16gcc</span></samp>' directive before the assembly language instructions to
be run in 16-bit mode. You can switch <code>as</code> to writing
32-bit code with the `<samp><span class="samp">.code32</span></samp>' directive or 64-bit code with the
`<samp><span class="samp">.code64</span></samp>' directive.
<p>`<samp><span class="samp">.code16gcc</span></samp>' provides experimental support for generating 16-bit
code from gcc, and differs from `<samp><span class="samp">.code16</span></samp>' in that `<samp><span class="samp">call</span></samp>',
`<samp><span class="samp">ret</span></samp>', `<samp><span class="samp">enter</span></samp>', `<samp><span class="samp">leave</span></samp>', `<samp><span class="samp">push</span></samp>', `<samp><span class="samp">pop</span></samp>',
`<samp><span class="samp">pusha</span></samp>', `<samp><span class="samp">popa</span></samp>', `<samp><span class="samp">pushf</span></samp>', and `<samp><span class="samp">popf</span></samp>' instructions
default to 32-bit size. This is so that the stack pointer is
manipulated in the same way over function calls, allowing access to
function parameters at the same stack offsets as in 32-bit mode.
`<samp><span class="samp">.code16gcc</span></samp>' also automatically adds address size prefixes where
necessary to use the 32-bit addressing modes that gcc generates.
<p>The code which <code>as</code> generates in 16-bit mode will not
necessarily run on a 16-bit pre-80386 processor. To write code that
runs on such a processor, you must refrain from using <em>any</em> 32-bit
constructs which require <code>as</code> to output address or operand
size prefixes.
<p>Note that writing 16-bit code instructions by explicitly specifying a
prefix or an instruction mnemonic suffix within a 32-bit code section
generates different machine instructions than those generated for a
16-bit code segment. In a 32-bit code section, the following code
generates the machine opcode bytes `<samp><span class="samp">66 6a 04</span></samp>', which pushes the
value `<samp><span class="samp">4</span></samp>' onto the stack, decrementing `<samp><span class="samp">%esp</span></samp>' by 2.
<pre class="smallexample"> pushw $4
</pre>
<p>The same code in a 16-bit code section would generate the machine
opcode bytes `<samp><span class="samp">6a 04</span></samp>' (i.e., without the operand size prefix), which
is correct since the processor default operand size is assumed to be 16
bits in a 16-bit code section.
</body></html>
``` |
Maxi Glamour is the stage name of Maximus Ademaus Glamour, a non-binary multi-disciplinary drag artist from St. Louis, Missouri, and the self-titled "Demon Queen of Polka and Baklava". They were a contestant in Season 3 of The Boulet Brothers' Dragula.
Career
Activism
Glamour founded the St. Louis-based Qu'art in 2014 to organize shows promoting diversity in the queer arts scene, citing PLUR (Peace Love Unity Respect) from the raver scene as an influence. Glamour is outspoken about the lack of Black performers at Queer events in the St. Louis area, and has said, "If you're a producer and you're not putting Black people in your show, maybe you shouldn't be producing." Glamour also advocates for transgender, AFAB, and non-Black people of color performers. To promote civic and political education, each Qu'art event includes a panel featuring community leaders, activists, and artists speaking about issues that affect Queer lives.
Glamour has also demonstrated in full drag, including in front of former mayor Lyda Krewson's home. Glamour created a petition calling for Krewson's resignation and later organized a debate focused on local LGBTQ+ issues for the 2021 St. Louis mayoral election.
Cannabis
In 2023, Glamour collaborated with CuCo (Culture Collective) on a line of cannabis flower called Faeded, debuted at a show with the same name.
Dragula
Glamour may be the first drag performer from St. Louis to appear on a major televised drag competition. Their international debut was in The Boulet Brothers' Dragula Season 3 in 2019. They participated in the first episode elimination challenge, which involved skydiving in drag, and were eliminated in the fourth episode.
Music
Glamour plays flute and other instruments. They signed with independent label Trans Trenderz for an experimental debut album, Modernadada, released in 2021. Q Review describes the album as a "battle-cry" and allegory for self-actualization.
Influences
Glamour claims influences from the Dada movement and artist Marcel Duchamp. They call their own art form "Modernadada".
References
External links
Official website
OnStL Interview
Armour Magazine interview
African-American drag queens
American drag queens
LGBT people from Missouri
People from St. Louis
Year of birth missing (living people)
Living people
Non-binary drag performers
The Boulet Brothers' Dragula contestants |
was a professional Go player.
Biography
Hashimoto turned pro in 1947 when he was just 12. It took him only 11 years to reach 9p. He learned Go from his father Hashimoto Kunisaburō and his disciples include Takahara Shūji, Moriyama Naoki, Oda Hiromitsu, Okahashi Hirotada, and Hayashi Kōzō. He was a member of the Kansai Ki-in.
Titles & runners-up
References
1935 births
Japanese Go players
2009 deaths |
Acanthoderes subtessellata is a species of beetle in the family Cerambycidae. It was described by Bates in 1880.
References
Acanthoderes
Beetles described in 1880 |
"Saturday Sun" is a song by Australian singer-songwriter Vance Joy and was released on 1 February 2018 as the fourth single from Joy's second studio album Nation of Two.
Joy explains "I wrote this last year when I was in Malibu. I guess it’s about meeting someone really great and not wanting to miss the chance of seeing them again. When I was writing this song, I was travelling from my little AirBnB in Venice Beach to the studio in Malibu and I got to drive my car on this beautiful stretch of coastal highway and I think that drive inspired some of the lyrics."
An acoustic version of the song was released on 4 May 2018.
A Luca Schreiner version of the song was released on 8 June 2018 and a Ryan Riback version on 6 July 2018.
Video
The video was released on 12 April 2018.
Reception
Brandon John from Tone Deaf said "In keeping with much of his best work, it’s about as hopeful a tune as you could reasonably ask for, dripping with the optimism of a young romantic as Vance proclaims his new love to the sun over bright acoustic and a swelling horn section."
Track listing
Charts
Weekly charts
Year-end charts
Certifications
References
2018 singles
2017 songs
Vance Joy songs
Songs written by Dave Bassett (songwriter)
Songs written by Vance Joy |
```cmake
string(REPLACE "." "_" REF "R_${VERSION}")
vcpkg_from_github(
OUT_SOURCE_PATH SOURCE_PATH
REPO libexpat/libexpat
REF "${REF}"
SHA512 your_sha256_hashyour_sha256_hash
HEAD_REF master
)
string(COMPARE EQUAL "${VCPKG_LIBRARY_LINKAGE}" "dynamic" EXPAT_LINKAGE)
string(COMPARE EQUAL "${VCPKG_CRT_LINKAGE}" "static" EXPAT_CRT_LINKAGE)
vcpkg_cmake_configure(
SOURCE_PATH "${SOURCE_PATH}/expat"
OPTIONS
-DEXPAT_BUILD_EXAMPLES=OFF
-DEXPAT_BUILD_TESTS=OFF
-DEXPAT_BUILD_TOOLS=OFF
-DEXPAT_BUILD_DOCS=OFF
-DEXPAT_SHARED_LIBS=${EXPAT_LINKAGE}
-DEXPAT_MSVC_STATIC_CRT=${EXPAT_CRT_LINKAGE}
-DEXPAT_BUILD_PKGCONFIG=ON
MAYBE_UNUSED_VARIABLES
EXPAT_MSVC_STATIC_CRT
)
vcpkg_cmake_install()
vcpkg_copy_pdbs()
vcpkg_cmake_config_fixup(CONFIG_PATH "lib/cmake/expat-${VERSION}")
vcpkg_fixup_pkgconfig()
file(REMOVE_RECURSE "${CURRENT_PACKAGES_DIR}/debug/include")
file(REMOVE_RECURSE "${CURRENT_PACKAGES_DIR}/debug/share")
file(REMOVE_RECURSE "${CURRENT_PACKAGES_DIR}/share/doc")
vcpkg_replace_string("${CURRENT_PACKAGES_DIR}/include/expat_external.h" "defined(_MSC_EXTENSIONS)" "defined(_WIN32)")
if(VCPKG_LIBRARY_LINKAGE STREQUAL "static")
vcpkg_replace_string("${CURRENT_PACKAGES_DIR}/include/expat_external.h" "! defined(XML_STATIC)" "0")
endif()
file(COPY "${CMAKE_CURRENT_LIST_DIR}/vcpkg-cmake-wrapper.cmake" DESTINATION "${CURRENT_PACKAGES_DIR}/share/${PORT}")
vcpkg_install_copyright(FILE_LIST "${SOURCE_PATH}/expat/COPYING")
``` |
The Episcopal Missionary Church (EMC) is a Continuing Anglican church body in the United States and a member of the Federation of Anglican Churches in the Americas.
History
Its founding in the early 1990s can be traced to the protests of members of the Episcopal Church who were concerned that their church had become massively influenced by secular humanism brought about through the adoption of theological liberalism. At first, these clergy and laymen sought to change the direction of their church by working from within it, to which end they formed a voluntary association, the Episcopal Synod of America.
When they later concluded that this approach would not succeed, a new missionary diocese was formed by them, still attempting to remain within ECUSA. In 1992, however, the missionary diocese withdrew from ECUSA and formed a separate church, the Episcopal Missionary Church. A. Donald Davies, retired ECUSA Bishop of Dallas and Fort Worth, was named the first Presiding Bishop of the Episcopal Missionary Church.
The Episcopal Missionary Church affirms the Holy Scriptures as containing all things necessary to salvation and as the ultimate rule and standard of faith. The church acknowledges the Nicene and Apostles' Creeds and the necessity of the sacraments of Baptism and Holy Communion. It uses the 1928 American edition of the Book of Common Prayer or the Anglican Missal based upon it, and emphasizes the preservation of apostolic succession. The Episcopal Missionary Church embraces a variety of liturgical styles from low church to high church, evangelical to Anglo-Catholic.
In January 2020, the Episcopal Missionary Church endorsed a concordant of communion with the Anglican Church in North America (ACNA), which was signed by Archbishop Foley Beach and EMC Presiding Bishop William Millsaps on 14 September 2020.
References
External links
Episcopal Missionary Church
Federation of Anglican Churches in the Americas
Holy Cross Anglican Church, Franklin TN
Christian organizations established in 1992
Continuing Anglican denominations
Anglican denominations in North America
Anglicanism in the United States |
```kotlin
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package com.drakeet.multitype.sample.communication
import android.os.Bundle
import androidx.recyclerview.widget.RecyclerView
import com.drakeet.multitype.MultiTypeAdapter
import com.drakeet.multitype.sample.MenuBaseActivity
import com.drakeet.multitype.sample.R
import com.drakeet.multitype.sample.normal.TextItem
import java.util.*
/**
* @author Drakeet Xu
*/
class CommunicateWithBinderActivity : MenuBaseActivity() {
private val aFieldValue = "aFieldValue of SimpleActivity"
private var adapter: MultiTypeAdapter = MultiTypeAdapter()
override fun onCreate(savedInstanceState: Bundle?) {
super.onCreate(savedInstanceState)
setContentView(R.layout.activity_list)
val recyclerView = findViewById<RecyclerView>(R.id.list)
val items = ArrayList<Any>()
adapter.register(TextItemWithOutsizeDataViewBinder(aFieldValue))
recyclerView.adapter = adapter
for (i in 0..19) {
items.add(TextItem(i.toString()))
}
adapter.items = items
adapter.notifyDataSetChanged()
}
}
``` |
St Catherine's Chapel is a small chapel situated on a hill above the village of Abbotsbury in Dorset, England. It is dedicated to Saint Catherine. It is now in the guardianship of English Heritage and became a Grade I listed building in 1956. The chapel is also scheduled together with the field systems and quarries on the hill.
The chapel is best seen from the viewpoint on the B3157 Abbotsbury to Bridport road, with Chesil Beach in the background. The medieval strip lynchets etched into the side of the hill are known locally as the Chapel Rings.
History
Although no records survive of the chapel's construction, the chapel has been dated in style to the late 14th century, the same time as Abbotsbury's tithe barn was built. The chapel is built on a definite platform which could have been originally for a pagan temple. St Catherine's Chapel was built as a place of pilgrimage and retreat by the monks of the nearby Benedictine monastery Abbotsbury Abbey, which the chapel overlooks high up on the hilltop. Its position on the top of a hill about 80 m (260 ft) high, overlooking the coast from Portland Bill to Bridport, meant that it was a prominent feature for seafarers. Only a handful of chapels of the same kind are located outside the precincts of the monasteries who constructed them. The isolated setting of the chapel granted the monks to withdraw from the monastery during Lent for private prayer and meditation.
In the 16th century the main abbey buildings were destroyed in the dissolution of the monasteries, but the chapel survived, most likely due to its usefulness as a coastal beacon and seamark. In later times a navigation light used to be lit at the top of the stair turret. The chapel was repaired in 1742 and the late 19th century but is largely unaltered.
Under the care of English Heritage, the chapel is open over the peak season, with free entry. Abbotsbury's local parish holds several informal services at St Catherine's Chapel during the year, usually in the latter half of the year, from June to December.
Design
The construction of the chapel, which has a rectangular structure, is entirely of locally quarried ashlar golden buff limestone. It is notably robust in order to withstand the elements; the walls are thick and supported by stout buttresses, and the roof and even the paneled ceiling are also made of stone. The construction allows rainwater to drain off the roof through holes in the parapet wall between the buttresses. In the north-west corner is a tower. At the north-east corner a stair turret, octagonal on the outside, rises above the roof and gives access to the parapet. There is also a tiny oratory at roof level. The buttresses and the stair turret would have been originally crowned with pinnacles. A porch was constructed on both north and south walls. The stone slab roof was renewed during 1983 in Clipsham stone.
The chapel has an effect of looking far larger than it really is. The high walls and tall parapets were designed to impress, and this sense of splendour is further enhanced by the chapel's lofty position. Within the interior of the chapel, stained glass windows and details of the roof picked out in bright colours would have been the effect in medieval times. At the vaulting's intersections are bosses carved with foliage, figure subjects and animals. The chapel's main window is a large triple window on the east wall, although there are smaller windows on other walls.
Tradition of St Catherine
St Catherine is the patron saint of spinsters and virgins, particularly those in search of husbands, and until the late 19th century the chapel had a local tradition where young women of Abbotsbury would 'wish', which involved using the niches provided (one for a knee and two other two holes for the hands) in the east jamb of the south doorway to 'post' prayers and make a wish to the saint asking for her help and aid. A traditional prayer used here says:
A husband, St Catherine,
A handsome one, St Catherine,
A rich one, St Catherine,
A nice one, St Catherine,
And soon, St Catherine.
In the local dialect version the request ends with the expression "Arn-a-one's better than Narn-a-one", meaning that anyone is better than 'never a one'.
The dedication of the chapel to St Catherine of Alexandria is rare, but her cult was one of the most popular in medieval England. It was St Augustine's policy that his priests, sent out from Rome around 600 AD to convert the English, should replace pagan temples with Christian churches and chapels. The early Christian missionaries would naturally try to choose a patron saint that continued, as closely as possible, the pagan dedication of the temple, and this chapel was most likely an example of that. Chapels dedicated to St Catherine are often found on hills, possibly in reference to Mount Sinai.
In popular culture
The chapel appears briefly in the Powell and Pressburger film The Small Back Room.
The chapel was the inspiration behind PJ Harvey's song "The Wind", from her 1998 album Is This Desire?. PJ Harvey lives and grew up near Abbotsbury.
See also
List of English Heritage properties
References
External links
st-catherine.org.uk - The Legend of St Catherine
History and Research on St Catherine's: English Heritage
Chapels in England
Churches in Dorset
English Heritage sites in Dorset
Grade I listed churches in Dorset |
Cedros is a coastal area that lies on a peninsula at the South-Western end of the island of Trinidad. Named by Spanish sailors due to the once heavy presence of cedar trees, it is located at the tip of the peninsula which lies mere miles off the coast of Venezuela and is the most southern point in the Caribbean. The main area is known as Bonasse which is of French origin meaning "easy-going."
Cedros is the closest legal point of entry to Venezuelans wishing to enter Trinidad and Tobago.
Economic history
Cedros has historically been a fishing village and coconut grove, producing much of the coconuts for harvest. In the 1800's, several estates were producing cotton but switched to sugar with seven distilleries across several sugar estates in operation with rum being the main export. Activity in Cedros increased due to the introduction of the Gulf Steamer in 1818 which connected Bonasse to the main towns of San Fernando and Port of Spain.
After the Slavery Abolition Act on 1st August 1834, many of the estates went bankrupt in the 1840s which led to the experimentation into other crops such as Bananas, Cotton, Cocoa, Coffee, Corn, Citrus and ground provisions. Coconuts were found to be the most economically successful with the exportation of copra and coconut oil.
The "Hurricane of 1933" measuring 120km/ph destroyed most of the southern peninsula which led to the demise of several estates. Most coconut trees were replanted but was devastated over the decades as they were infected by several types of diseases such as the Cedros Wilt Disease (Hartrot), Bronze Leaf Wilt, Bursaphelenchus cocophilus causing Red Ring disease, and the Red Palm Mite.
Today, small scale coconut harvesting, fishing and light tourism from mainly Venezuelan visitors are the main economic activities. Several estates have been repurposed for private real estate development with many in the area concerned that historical artifacts on these estates would be lost.
The proximity of Cedros to the South American mainland has led to many drug cartels from South America trying to bring their cargoes via the Gulf of Paria into the Caribbean region or though Cedros. As a countermeasure to suppress the drug trade using Venezuela, the Venezuelan government routinely sends gunships to patrol the waters between Trinidad and Tobago and Venezuela. With Cedros being a key area, countermeasures were done by the Government of Trinidad and Tobago include a jetty for quickly launching boats for drug interdiction and the installation of a 360 Degree Radar at Green Hill, Galfa.
Geography
Widely considered on the island as a rural area, Cedros is considered to be one of the final remaining areas that only a few thousands of years ago attached the island of Trinidad geologically to the South American continent. Cedros is said to still share resemblance to the adjacent Venezuelan coastline 11–12 km across the passage of water known as Boca del Sierpe (Serpent's Mouth).
Villages
Cedros comprises many villages developed and undeveloped, some of which were once thriving coconut and sugar estates: Bonasse (main community), Bamboo, Fullarton, Perseverance, Lochmaben, Columbia, St. Marie, Lans Vieusse (L'Envieusse) and Galfa.
Fullarton Village was named after the British Army Colonel, William Fullarton.
Bonasse Village which occupies the "Union" sugar estate was named after one of its plantation owners Jean Baptiste Bonnasse. Under Spanish rule, Bonasse was comprised off three smaller districts known as the Torre, Consedor, and Quorge.
Columbia Estate was named in honor of Christopher Columbus who docked at Los Gallos Point on 2nd August 1498.
Several streets were named after former estates such as Union Street, St. Marie Road, St. John Road, Fullerton Road, Columbia Road and St. Quintin Road. Other streets were named after the proprietors of the estates such as Gardieu Street and Hughes Street. Some streets were named after British aristocratic figures such as George Street, Charles Street, Henry Street, Edward Street and King Street.
Places of interest
On weekends, persons tend to drive down to Cedros to either bathe in the sea, purchase fish for consumption, enjoy the scenery or to participate in hikes and other nature events. Various groups conduct hikes over various geographical terrain in Cedros and neighboring Icacos at different times in the year. Hikes are usually offered to the public by a public hiking group for a fee.
Cedros Bay
Cedros Bay is a large stretch of beach with coconut trees along the shore of the bay with the villages of Bamboo, Bonasse and Fullerton overlooking the sea. The beach is excellent for walking and exercising while the waters tend to be more muddy than clear.
Green Hill Bunkers
Located at Green Hill in Galfa, the Green Hill Bunkers was once a 300-acre American Military Base built in 1941 during World War II to monitor the Gulf of Paria and the Columbus Channel against German aggression. With the war ending in 1945, the installation was discontinued in 1949.
Mystery Tombs
Located on L'Envieusse Estate are two mystery tombs over 200 years old surrounded by broken Scottish ballast bricks. It was eventually suspected to be the graves of two French planters, Jean and Michel Cavalan.
Mud Volcanoes
Mud volcanoes that exist in Cedros are Columbia, Lam Vierge and the popular Balka Devi which is revered by the local Hindu population.
Manmohansingh Park
Public space located in Bonasse Village overlooking the sea.
Cedros Public Cemetery
Cedros Public Cemetery has simple and elaborate tombs and grave spots. On some of the grave spots, the boundaries of which are marked off by bricks, there is indication of recent maintenance in the white paint. However, there are one or two which have an elaborate gravestone, along with information which has been carved into the tombstone.
It is the practice of holders of grave spots in cemeteries to bury their close relatives one on top of the other with a few feet of dirt between each person after a number of years have passed. Some grave holders rent spots in different parts of the cemetery either as the spaces become available or as the family grows and the spots are used or as the finances of the family changes, whichever comes first. Given the terrain of most areas, it is practical to select spots in different locations to take account of expansion of the cemetery and or the wishes of parents with respect to burial.
Cedros Secondary School
Cedros Composite School is located in "Bonasse Village, Trinidad"
Oil fields
There are shallow onshore oil deposits located in Cedros however, they are currently being explored. The only producing oil field is located in Bonasse that was discovered in 1911.
Cedros Public Library
The Cedros Public Library is located in the Cedros Composite School according to the NALIS website. Thus the Public Library falls under the Authority of the National Library Information System even though it is housed in a school compound. As there has been an expansion in the services which the Public Library offers, some of which are: free internet access on computers for an hour per day for a person, access to books online and access to research facilities once a person joins a Library and signs up for the service, there should be an increase in borrowings from the Cedros area with the availability of services in the Library.
Smelter
In 2005–06, the Government of Trinidad and Tobago led by the then Prime Minister of T&T – Patrick Manning announced an initiative to rapidly industrialize the Cedros area. One of the projects devised for Cedros was the establishment of an Alumina smelter plant which was backed by ALCOA. Residents living in the Cedros area opposed the project. The plant was touted as becoming one of the biggest alumina smelter plants in the world once completed; however, residents in Cedros claimed that ash from the plant could contaminate the local area's soil and may lead to possible respiratory-health issues in the long run. The Smelter project was cancelled in September 2010.
Notable natives of Cedros
Mervyn Malcolm Dymally, Lieutenant Governor of California, 1975–79; and U.S. Representative from California 31st District, 1981–93; delegate to Democratic National Convention from California, 2004.
References
Populated places in Trinidad and Tobago
Beaches of Trinidad and Tobago |
Artoviridae is a family of negative-strand RNA viruses in the order Mononegavirales. Barnacles, copepods, odonates, parasitoid wasps, pile worms, and woodlice serve as natural hosts. The group name derives from arthropod the phylum of its hosts. Members of the family were initially discovered by high throughput sequencing.
Structure
Virions are enveloped, spherical particles, 100 to 130 nm in diameter, and the virus genome comprises about 12 kb of negative-sense, unsegmented RNA.
Taxonomy
The following genera and species are recognized:
Genus: Hexartovirus
Barnacle hexartovirus
Caligid hexartovirus
Genus: Peropuvirus
Beihai peropuvirus
Hubei peropuvirus
Odonate peropuvirus
Pillworm peropuvirus
Pteromalus puparum peropuvirus
Woodlouse peropuvirus
References
Mononegavirales
Virus families |
The Motozintlecos or Mochós are an indigenous people of Chiapas, Mexico. They speak the Mocho’ language, part of the western branch of Mayan languages. With only about 100 speakers (as of the 2010 census), the Mocho' language is in danger of extinction.
The majority of the Motozintleco community resides in Motozintla de Mendoza.
References
Maya peoples of Mexico |
Carolesia blakei is a species of sea snail, a marine gastropod mollusk in the family Tegulidae.
References
Güller M. & Zelaya D.G. (2014). A new generic placement for "Calliostoma" blakei Clench & Aguayo, 1938 (Gastropoda: Trochoidea). Malacologia. 57(2): 309-317
External links
To Biodiversity Heritage Library (1 publication)
To Encyclopedia of Life
To World Register of Marine Species
Tegulidae
Gastropods described in 1938 |
Bendix Helicopters, Inc. was the last company founded by prolific inventor Vincent Bendix, in 1943 in Connecticut. It ceased operations in 1949.
History
It built a 10,000 square foot factory for helicopter production on East Main Street in Stratford, Connecticut in 1945.
Bendix created 3 prototypes that used a system of coaxial rotors: Model K (1945), Model L and Model J (1946).
Due to lack of sales and capital, in January 1947 the large factory building was sold to Manning, Maxwell and Moore, who were taken over by Dresser Industries in 1964.
In 1949, Bendix Helicopter was forced to close. In an auction the assets of the company were sold to the Gyrodyne Company of America on Long Island in New York. Gyrodyne continued development of several helicopter models introduced by Bendix.
See also
Bendix Trophy
References
External links
Helis.com: History of Bendix Helicopters
Defunct helicopter manufacturers of the United States
Companies based in Stratford, Connecticut
American companies established in 1943
Manufacturing companies established in 1943
Manufacturing companies disestablished in 1949
1943 establishments in Connecticut
1949 disestablishments in Connecticut
Defunct manufacturing companies based in Connecticut
Honeywell
Bendix Corporation |
The Northern Pacific Depot or Villard Depot is a historic railway station in Villard, Minnesota, United States, built in 1882. It is listed on the National Register of Historic Places for having local significance in exploration/settlement and transportation. The depot was constructed upon the completion of a new Northern Pacific Railway line and the platting of a new trackside town named after the railway's president Henry Villard. The Little Falls and Dakota Branch line, running between Little Falls and Morris, Minnesota, provided a key link between the agricultural region of west-central Minnesota and the Great Lakes port of Duluth. The depot now marks the eastern terminus of the Villard–Starbuck Trail, a rail trail in development from Villard through Glenwood, Starbuck, and on to Glacial Lakes State Park.
See also
National Register of Historic Places listings in Pope County, Minnesota
References
Buildings and structures in Pope County, Minnesota
Former railway stations in Minnesota
Former Northern Pacific Railway stations
Railway stations on the National Register of Historic Places in Minnesota
Railway stations in the United States opened in 1882
National Register of Historic Places in Pope County, Minnesota |
Lumberton is a city in Hardin County, Texas, United States. The population was 13,554 at the 2010 census, up from 11,943 at the 2000 census. Lumberton is the home of Village Creek State Park. The city is part of the Beaumont–Port Arthur metropolitan area.
Geography
Lumberton is located in southeastern Hardin County at (30.263896, –94.201918). According to the United States Census Bureau, the city has a total area of , of which are land and , or 0.77%, are water. The eastern border of the city is Village Creek, a southeast-flowing tributary of the Neches River.
The Eastex Freeway (comprising US 69, 96, and US 287) runs north from Beaumont to the southern border of Lumberton, where it splits into two separate highways, both running north to south, with Highway 96 in the eastern portion of the city and Highways 69 and 287 in the western portion. The two highways house the majority of the commercial development on the city. US 96 leads north-northeast to Silsbee, while Highway 69/287 leads northwest to Kountze, the Hardin County seat. Beaumont is to the south.
Lumberton is considered a "bedroom" community to Beaumont, Texas; the county seat to Jefferson County. It has many subdivisions and a school district.
Historical development
The town was established as a stop on the Gulf, Beaumont and Kansas City Railway that was built through the area in 1894. Serving the local sawmills and lumber camps, the post office was established at Lumberton in 1909. In 1914, the post office was relocated to the Fletcher site nearby, which was a major sawmill until the mid-1920s. After the closure of the sawmill at Fletcher, the area remained populated and became part of the city of Lumberton when it was first incorporated in July 1973 when the towns city limits were within Beaumont's jurisdiction; however, two years later in 1975 Beaumont filed two lawsuits challenging Lumberton's right to exist. One lawsuit was with the State of Texas, the other lawsuit was locally. The official judgement declared Lumberton a non-city. Lumberton was able to re-incorporate with new boundaries. Those boundaries are the existing boundaries today which put the city limits at the split between Highway96/69 on the South end and on the North end at Village Creek. At the time this happened the Mayor of Lumberton was Dannis Robinson and the lawyer was Kenneth Furlow.
Demographics
As of the 2020 United States census, there were 13,554 people, 4,920 households, and 3,812 families residing in the city.
As of the 2010 census Lumberton had a population of 11,943. The ethnic and racial makeup of the population was 92.9% non-Hispanic white, 0.4% African American, 0.3% Native American, 0.7% Asian, 1.0% some other race, and 1.3% reporting two or more races.
As of the census of 2000, 8,731 people, 3,198 households, and 2,542 families resided in the city. The population density was . The 3,443 housing units averaged 366.2 per square mile (141.4/km). The racial makeup of the city was 97.64% White, 0.05% African American, 0.29% Native American, 0.21% Asian, 0.87% from other races, and 0.95% from two or more races. Hispanics or Latinos of any race were 2.79% of the population.
Of the 3,198 households, 42.6% had children under the age of 18 living with them, 66.4% were married couples living together, 9.9% had a female householder with no husband present, and 20.5% were not families; 17.8% of all households were made up of individuals, and 6.1% had someone living alone who was 65 years of age or older. The average household size was 2.73 and the average family size was 3.09.
In the city, the population was distributed as 29.1% under the age of 18, 9.0% from 18 to 24, 30.3% from 25 to 44, 22.8% from 45 to 64, and 8.7% who were 65 years of age or older. The median age was 34 years. For every 100 females, there were 93.1 males. For every 100 females age 18 and over, there were 91.4 males.
The median income for a household in the city was $45,700, and for a family was $47,184. Males had a median income of $38,315 versus $26,217 for females. The per capita income for the city was $19,650. About 5.5% of families and 7.0% of the population were below the poverty line, including 8.0% of those under age 18 and 5.0% of those age 65 or over.
In 2005, the estimated average value of a home in Lumberton was $111,700. The crime index rate for Lumberton in 2006 was 154.6. This is well below the national average of 325.2.
Lumberton is a rapidly growing community, and is the largest city in Hardin County. Many of the newest and largest subdivisions that are considered by many as part of Lumberton are actually outside of the city limits and not included in the official city population totals.
Culture
Lumberton is the home of Village Creek State Park, which attracts tourists from all over the states of Texas and Louisiana. Every year, the Village Creek Festival is held in Lumberton.
Education
Lumberton is served by the Lumberton Independent School District. The athletic teams of Lumberton High School are known as the Raiders and compete in Division 1 4A.
Notable people
Clay Buchholz, pitcher for the Arizona Diamondbacks
Debra Jo Fondren, 1978 Playboy Playmate of the year
Trey Mitchell, America's Strongest Man in 2018
Notable events
In October 1994, heavy rains (10–25 inches in 5 days) resulted in a severe flood over southeastern portions of Texas which damaged and destroyed homes across the region and resulted in 22 flood-related deaths. Lumberton suffered significant property damage, particularly in the Pine Island Bayou and Village Creek areas.
In 2005, Lumberton resident Mike Smith was elected to the LISD School Board at the age of 19. Smith became the youngest individual to be on a board of education in the state of Texas. In April 2007, Smith became the youngest man to testify in front of the Texas House of Representatives during the 2007 legislative session.
On September 24, 2005, Lumberton made national headlines after suffering a direct hit from Hurricane Rita. And on September 13, 2008, Lumberton made national headlines again for having another direct hit from Hurricane Ike. And again on August 28, 2017, Hurricane Harvey hit Lumberton and around 1/2 of it went underwater again.
Climate
The climate in this area is characterized by hot, humid summers and generally mild to cool winters. According to the Köppen climate classification system, Lumberton has a humid subtropical climate, Cfa on climate maps.
References
External links
City of Lumberton official website
Cities in Texas
Cities in Hardin County, Texas
Beaumont–Port Arthur metropolitan area
1894 establishments in Texas |
The 1964 Danish 2nd Division (Danish: Danmarksturneringens 2. division 1964) was the twenty-ninth season of the Danish second-tier association football division since the establishment of Danmarksturneringen's nation-wide league structure in 1927. Governed by the Danish FA, the season was launched on 29 March 1964, with the match between Ikast FS and Vanløse IF, and the last round of matches concluded in November 1964. Aalborg BK and Køge BK entered as relegated teams from last season's top-flight, while Hvidovre IF and Næstved IF entered as promoted teams from the 1963 Danish 3rd Division. Fixtures for the 1964 season were announced in February 1964.
Hvidovre IF won the league, securing their third promotion in a row after having entered second-tier league for the first time in the club's history, with Aalborg BK becoming the runners-up and returning immediately to the top-flight in the 1965 Danish 1st Division. At the end of the season, the two clubs with the fewest points in the final league standings, Vanløse IF and Randers SK Freja, were relegated to the 1965 Danish 3rd Division. Helge Jørgensen of Odense KFUM became the league's top scorer, netting a total of 24 goals.
Summary
The 1964 season was inaugurated on 29 March with a single Easter Sunday match between Ikast FS, that finished the 1963 Danish 2nd Division season in ninth place, and Vanløse IF, that finished in tenth place last season, at Ikast Stadium in front of a crowd of 1,200 spectators. Ikast FS' centerforward Jørgen Nielsen scored the first goal of the season in the 11th minute after a pass from Kristian Mosegaard and scored additional two goals after 34 and 80 minutes of play, hence also completing the first hat-trick of the season. The remaining fixture for the first matchday was held on 30 March 1964.
On 26 April 1964, the game between Hvidovre IF and Odense KFUM became the first live television transmission by Danmarks Radio from a domestic competitive match in the Danmarksturneringen i fodbold. The league match, played at Hvidovre Stadium with an attendance of 4,850 spectators, was won 2-1 by the Copenhagen suburban-based club. Over 1 million television viewers nationwide tuned to watch the match that was shown in its full length at 18:00 CET until approx. 19:45 CET.
Teams
Twelve teams competed in the league – eight teams from the previous season, two teams relegated from the top tier and two teams promoted from the third tier. The promoted teams were Hvidovre IF, who entered the second-tier league for the first time in the club's history, and Næstved IF, returning after a three-year absence. They replaced Skovshoved IF and Hellerup IK, ending their second-tier spells of two and three years respectively. The relegated teams were Aalborg BK, returning after one season, and Køge BK, returning after a three-year absence, replacing BK Frem and B.93, who returned to the top-flight division, ending their spells in the second-tier of three and four years respectively.
Stadiums and locations
Personnel
Coaching changes
League table
Every team played two games against the other teams, at home and away, totaling 22 games each. Teams received two points for a win and one point for a draw. If two or more teams were tied on points, places were determined by goal average. The team with the most points were crowned winners of the league. The winners and the runners-up were promoted to the 1965 Danish 1st Division, while the two teams with the fewest points would be relegated to the 1965 Danish 3rd Division.
Results
Statistics
Scoring
Top scorers
Hat-tricks
Clean sheets
References
1963–64 in European second tier association football leagues
1964–65 in European second tier association football leagues
1963–64 in Danish football
1964–65 in Danish football |
```objective-c
#ifndef PopcornTimetvOS_Bridging_Header_h
#define PopcornTimetvOS_Bridging_Header_h
#import <TVVLCKit/TVVLCKit.h>
#import "NSObject+Swift_Observer.h"
#import <ifaddrs.h>
#endif
``` |
Ian Douglas may refer to:
Ian Douglas (author), pseudonym of American author William H. Keith, Jr.
Ian Douglas (bishop), American bishop
Ian Douglas (politician), Dominican politician
See also
Iain Douglas-Hamilton (born 1942), zoologist
Ian Akers-Douglas (1909–1952), English cricketer |
```python
from QRec import QRec
from util.config import ModelConf
if __name__ == '__main__':
print('='*80)
print(' QRec: An effective python-based recommendation model library. ')
print('='*80)
# print('0. Analyze the input data.(Configure the visual.conf in config/visual first.)')
# print('-' * 80)
print('Generic Recommenders:')
print('1. UserKNN 2. ItemKNN 3. BasicMF 4. SlopeOne 5. SVD')
print('6. PMF 7. SVD++ 8. EE 9. BPR 10. WRMF')
print('11. ExpoMF')
print('MF-based Social Recommenders:')
print('s1. RSTE s2. SoRec s3. SoReg s4. SocialMF s5. SBPR')
print('s6. SREE s7. LOCABAL s8. SocialFD s9. TBPR s10. SERec')
print('Network Embedding based Recommenders:')
print('a1. CoFactor a2. CUNE-MF a3. CUNE-BPR a4. IF-BPR')
print('DNNs-based Recommenders:')
print('d1. APR d2. CDAE d3. DMF d4. NeuMF d5. CFGAN')
print('d6. IRGAN d7. RSGAN')
print('GNNs-based Recommenders:')
print('g1. NGCF g2. LightGCN g3. ESRF g4. DHCF g5. DiffNet')
print('Self-Supervised Recommenders:')
print('q1. SGL q2. SEPT q3. BUIR q4. MHCN q5. SimGCL')
print('Basic Methods:')
print('b1. UserMean b2. ItemMean b3. MostPopular b4. Rand')
print('='*80)
num = input('please enter the number of the model you want to run:')
import time
s = time.time()
#Register your model here and add the conf file into the config directory
models = {'1':'UserKNN','2':'ItemKNN','3':'BasicMF','4':'SlopeOne','5':'SVD','6':'PMF',
'7':'SVD++','8':'EE','9':'BPR','10':'WRMF','11':'ExpoMF',
's1':'RSTE','s2':'SoRec','s3':'SoReg','s4':'SocialMF','s5':'SBPR','s6':'SREE',
's7':'LOCABAL','s8':'SocialFD','s9':'TBPR','s10':'SEREC','a1':'CoFactor',
'a2':'CUNE_MF','a3':'CUNE_BPR','a4':'IF_BPR',
'd1':'APR','d2':'CDAE','d3':'DMF','d4':'NeuMF','d5':'CFGAN','d6':'IRGAN','d7':'RSGAN',
'g1':'NGCF', 'g2':'LightGCN', 'g3':'ESRF', 'g4':'DHCF', 'g5':'DiffNet',
'q1':'SGL', 'q2':'SEPT', 'q3':'BUIR', 'q4':'MHCN', 'q5':'SimGCL',
'b1':'UserMean','b2':'ItemMean','b3':'MostPopular','b4':'Rand'}
try:
conf = ModelConf('./config/' + models[num] + '.conf')
except KeyError:
print('wrong num!')
exit(-1)
recSys = QRec(conf)
recSys.execute()
e = time.time()
print("Running time: %f s" % (e - s))
``` |
Stick It is a 1972 studio album by Buddy Rich, with his big band. The album was his third for RCA Records as well as his last album for the label prior to his 1976 album Speak No Evil.
Track listing
LP side A
"Space Shuttle" (John LaBarbera) – 4:19
"God Bless the Child" (Arthur Herzog Jr., Billie Holiday) – 4:48
"Best Coast" (John LaBarbera) – 3:58
"Wave" (Antonio Carlos Jobim) – 4:15
LP side B
"Something" (George Harrison) – 3:25
"Uncle Albert/Admiral Halsey" (Paul McCartney, Linda McCartney) – 7:57
"Sassy Strut" (John LaBarbera) – 6:06
"Bein' Green" (Joe Raposo) – 2:58
bonus track on 1999 RCA CD re-issue
"Space Shuttle" – 10:38 (extended version)
track order on CD re-issue differs from original LP
Personnel
The Buddy Rich big band
Buddy Rich – drums
Joel DiBartolo – double bass
Pat LaBarbera – flute, soprano saxophone, tenor saxophone
Joe Romano – flute, alto saxophone
Brian A. Grivna – flute, alto saxophone
Don Englert – flute, tenor saxophone
Walter Namuth – guitar
George McFetridge – piano
Richard Centalonza – baritone saxophone
Eric Culver – trombone
Alan Kaplan – trombone
William Reichenbach – bass trombone
Greg Hopkins – trumpet, arranger
Lin Biviano, John DeFlon, Wayne Naus – trumpet
Production
Pete Spargo – producer
James Nichols – reissue producer
Janet DeMatteis – art direction
Jim Crotty – engineer
Griffin Norman – design
Chuck Stewart – photography
References
RCA LSP 4802 (LP)
RCA 68732 (1999 CD)
BMG 37434 (2005 CD)
1972 albums
Buddy Rich albums
RCA Records albums |
Rick Shaw may refer to:
Rick Shaw (journalist) (born 1956), American journalism academic and journalist
Rick Shaw (radio) (1938–2017), American disc jockey, radio and television personality
Rick Shaw (American football) (born 1946), American football player
See also
Rickshaw, a pedestrian-powered vehicle for carrying one or two passengers
Ricky Shaw (born 1965), American football player
Richard Shaw (disambiguation) |
```ocaml
(*
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*)
(* This lists two valid unicode point ranges in tuple format.
see more details in path_to_url
TODO: store it in a flat array
add more docs
*)
[@@@ocamlformat "disable"]
(* JS has stricter rules with start id *)
let id_start = [|36,37;65,91;95,96;97,123;170,171;181,182;186,187;192,215;216,247;248,706;710,722;736,741;748,749;750,751;880,885;886,888;890,894;895,896;902,903;904,907;908,909;910,930;931,1014;1015,1154;1162,1328;1329,1367;1369,1370;1376,1417;1488,1515;1519,1523;1568,1611;1646,1648;1649,1748;1749,1750;1765,1767;1774,1776;1786,1789;1791,1792;1808,1809;1810,1840;1869,1958;1969,1970;1994,2027;2036,2038;2042,2043;2048,2070;2074,2075;2084,2085;2088,2089;2112,2137;2144,2155;2208,2229;2230,2238;2308,2362;2365,2366;2384,2385;2392,2402;2417,2433;2437,2445;2447,2449;2451,2473;2474,2481;2482,2483;2486,2490;2493,2494;2510,2511;2524,2526;2527,2530;2544,2546;2556,2557;2565,2571;2575,2577;2579,2601;2602,2609;2610,2612;2613,2615;2616,2618;2649,2653;2654,2655;2674,2677;2693,2702;2703,2706;2707,2729;2730,2737;2738,2740;2741,2746;2749,2750;2768,2769;2784,2786;2809,2810;2821,2829;2831,2833;2835,2857;2858,2865;2866,2868;2869,2874;2877,2878;2908,2910;2911,2914;2929,2930;2947,2948;2949,2955;2958,2961;2962,2966;2969,2971;2972,2973;2974,2976;2979,2981;2984,2987;2990,3002;3024,3025;3077,3085;3086,3089;3090,3113;3114,3130;3133,3134;3160,3163;3168,3170;3200,3201;3205,3213;3214,3217;3218,3241;3242,3252;3253,3258;3261,3262;3294,3295;3296,3298;3313,3315;3333,3341;3342,3345;3346,3387;3389,3390;3406,3407;3412,3415;3423,3426;3450,3456;3461,3479;3482,3506;3507,3516;3517,3518;3520,3527;3585,3633;3634,3636;3648,3655;3713,3715;3716,3717;3718,3723;3724,3748;3749,3750;3751,3761;3762,3764;3773,3774;3776,3781;3782,3783;3804,3808;3840,3841;3904,3912;3913,3949;3976,3981;4096,4139;4159,4160;4176,4182;4186,4190;4193,4194;4197,4199;4206,4209;4213,4226;4238,4239;4256,4294;4295,4296;4301,4302;4304,4347;4348,4681;4682,4686;4688,4695;4696,4697;4698,4702;4704,4745;4746,4750;4752,4785;4786,4790;4792,4799;4800,4801;4802,4806;4808,4823;4824,4881;4882,4886;4888,4955;4992,5008;5024,5110;5112,5118;5121,5741;5743,5760;5761,5787;5792,5867;5870,5881;5888,5901;5902,5906;5920,5938;5952,5970;5984,5997;5998,6001;6016,6068;6103,6104;6108,6109;6176,6265;6272,6313;6314,6315;6320,6390;6400,6431;6480,6510;6512,6517;6528,6572;6576,6602;6656,6679;6688,6741;6823,6824;6917,6964;6981,6988;7043,7073;7086,7088;7098,7142;7168,7204;7245,7248;7258,7294;7296,7305;7312,7355;7357,7360;7401,7405;7406,7412;7413,7415;7418,7419;7424,7616;7680,7958;7960,7966;7968,8006;8008,8014;8016,8024;8025,8026;8027,8028;8029,8030;8031,8062;8064,8117;8118,8125;8126,8127;8130,8133;8134,8141;8144,8148;8150,8156;8160,8173;8178,8181;8182,8189;8305,8306;8319,8320;8336,8349;8450,8451;8455,8456;8458,8468;8469,8470;8472,8478;8484,8485;8486,8487;8488,8489;8490,8506;8508,8512;8517,8522;8526,8527;8544,8585;11264,11311;11312,11359;11360,11493;11499,11503;11506,11508;11520,11558;11559,11560;11565,11566;11568,11624;11631,11632;11648,11671;11680,11687;11688,11695;11696,11703;11704,11711;11712,11719;11720,11727;11728,11735;11736,11743;12293,12296;12321,12330;12337,12342;12344,12349;12353,12439;12443,12448;12449,12539;12540,12544;12549,12592;12593,12687;12704,12731;12784,12800;13312,19894;19968,40944;40960,42125;42192,42238;42240,42509;42512,42528;42538,42540;42560,42607;42623,42654;42656,42736;42775,42784;42786,42889;42891,42944;42946,42951;42999,43010;43011,43014;43015,43019;43020,43043;43072,43124;43138,43188;43250,43256;43259,43260;43261,43263;43274,43302;43312,43335;43360,43389;43396,43443;43471,43472;43488,43493;43494,43504;43514,43519;43520,43561;43584,43587;43588,43596;43616,43639;43642,43643;43646,43696;43697,43698;43701,43703;43705,43710;43712,43713;43714,43715;43739,43742;43744,43755;43762,43765;43777,43783;43785,43791;43793,43799;43808,43815;43816,43823;43824,43867;43868,43880;43888,44003;44032,55204;55216,55239;55243,55292;63744,64110;64112,64218;64256,64263;64275,64280;64285,64286;64287,64297;64298,64311;64312,64317;64318,64319;64320,64322;64323,64325;64326,64434;64467,64830;64848,64912;64914,64968;65008,65020;65136,65141;65142,65277;65313,65339;65345,65371;65382,65471;65474,65480;65482,65488;65490,65496;65498,65501;65536,65548;65549,65575;65576,65595;65596,65598;65599,65614;65616,65630;65664,65787;65856,65909;66176,66205;66208,66257;66304,66336;66349,66379;66384,66422;66432,66462;66464,66500;66504,66512;66513,66518;66560,66718;66736,66772;66776,66812;66816,66856;66864,66916;67072,67383;67392,67414;67424,67432;67584,67590;67592,67593;67594,67638;67639,67641;67644,67645;67647,67670;67680,67703;67712,67743;67808,67827;67828,67830;67840,67862;67872,67898;67968,68024;68030,68032;68096,68097;68112,68116;68117,68120;68121,68150;68192,68221;68224,68253;68288,68296;68297,68325;68352,68406;68416,68438;68448,68467;68480,68498;68608,68681;68736,68787;68800,68851;68864,68900;69376,69405;69415,69416;69424,69446;69600,69623;69635,69688;69763,69808;69840,69865;69891,69927;69956,69957;69968,70003;70006,70007;70019,70067;70081,70085;70106,70107;70108,70109;70144,70162;70163,70188;70272,70279;70280,70281;70282,70286;70287,70302;70303,70313;70320,70367;70405,70413;70415,70417;70419,70441;70442,70449;70450,70452;70453,70458;70461,70462;70480,70481;70493,70498;70656,70709;70727,70731;70751,70752;70784,70832;70852,70854;70855,70856;71040,71087;71128,71132;71168,71216;71236,71237;71296,71339;71352,71353;71424,71451;71680,71724;71840,71904;71935,71936;72096,72104;72106,72145;72161,72162;72163,72164;72192,72193;72203,72243;72250,72251;72272,72273;72284,72330;72349,72350;72384,72441;72704,72713;72714,72751;72768,72769;72818,72848;72960,72967;72968,72970;72971,73009;73030,73031;73056,73062;73063,73065;73066,73098;73112,73113;73440,73459;73728,74650;74752,74863;74880,75076;77824,78895;82944,83527;92160,92729;92736,92767;92880,92910;92928,92976;92992,92996;93027,93048;93053,93072;93760,93824;93952,94027;94032,94033;94099,94112;94176,94178;94179,94180;94208,100344;100352,101107;110592,110879;110928,110931;110948,110952;110960,111356;113664,113771;113776,113789;113792,113801;113808,113818;119808,119893;119894,119965;119966,119968;119970,119971;119973,119975;119977,119981;119982,119994;119995,119996;119997,120004;120005,120070;120071,120075;120077,120085;120086,120093;120094,120122;120123,120127;120128,120133;120134,120135;120138,120145;120146,120486;120488,120513;120514,120539;120540,120571;120572,120597;120598,120629;120630,120655;120656,120687;120688,120713;120714,120745;120746,120771;120772,120780;123136,123181;123191,123198;123214,123215;123584,123628;124928,125125;125184,125252;125259,125260;126464,126468;126469,126496;126497,126499;126500,126501;126503,126504;126505,126515;126516,126520;126521,126522;126523,126524;126530,126531;126535,126536;126537,126538;126539,126540;126541,126544;126545,126547;126548,126549;126551,126552;126553,126554;126555,126556;126557,126558;126559,126560;126561,126563;126564,126565;126567,126571;126572,126579;126580,126584;126585,126589;126590,126591;126592,126602;126603,126620;126625,126628;126629,126634;126635,126652;131072,173783;173824,177973;177984,178206;178208,183970;183984,191457;194560,195102|]
(* The followed ID restriction is relaxed, this one
is used in our customized unicode lexing.
*)
let id_continue = [|36,37;48,58;65,91;95,96;97,123;170,171;181,182;183,184;186,187;192,215;216,247;248,706;710,722;736,741;748,749;750,751;768,885;886,888;890,894;895,896;902,907;908,909;910,930;931,1014;1015,1154;1155,1160;1162,1328;1329,1367;1369,1370;1376,1417;1425,1470;1471,1472;1473,1475;1476,1478;1479,1480;1488,1515;1519,1523;1552,1563;1568,1642;1646,1748;1749,1757;1759,1769;1770,1789;1791,1792;1808,1867;1869,1970;1984,2038;2042,2043;2045,2046;2048,2094;2112,2140;2144,2155;2208,2229;2230,2238;2259,2274;2275,2404;2406,2416;2417,2436;2437,2445;2447,2449;2451,2473;2474,2481;2482,2483;2486,2490;2492,2501;2503,2505;2507,2511;2519,2520;2524,2526;2527,2532;2534,2546;2556,2557;2558,2559;2561,2564;2565,2571;2575,2577;2579,2601;2602,2609;2610,2612;2613,2615;2616,2618;2620,2621;2622,2627;2631,2633;2635,2638;2641,2642;2649,2653;2654,2655;2662,2678;2689,2692;2693,2702;2703,2706;2707,2729;2730,2737;2738,2740;2741,2746;2748,2758;2759,2762;2763,2766;2768,2769;2784,2788;2790,2800;2809,2816;2817,2820;2821,2829;2831,2833;2835,2857;2858,2865;2866,2868;2869,2874;2876,2885;2887,2889;2891,2894;2902,2904;2908,2910;2911,2916;2918,2928;2929,2930;2946,2948;2949,2955;2958,2961;2962,2966;2969,2971;2972,2973;2974,2976;2979,2981;2984,2987;2990,3002;3006,3011;3014,3017;3018,3022;3024,3025;3031,3032;3046,3056;3072,3085;3086,3089;3090,3113;3114,3130;3133,3141;3142,3145;3146,3150;3157,3159;3160,3163;3168,3172;3174,3184;3200,3204;3205,3213;3214,3217;3218,3241;3242,3252;3253,3258;3260,3269;3270,3273;3274,3278;3285,3287;3294,3295;3296,3300;3302,3312;3313,3315;3328,3332;3333,3341;3342,3345;3346,3397;3398,3401;3402,3407;3412,3416;3423,3428;3430,3440;3450,3456;3458,3460;3461,3479;3482,3506;3507,3516;3517,3518;3520,3527;3530,3531;3535,3541;3542,3543;3544,3552;3558,3568;3570,3572;3585,3643;3648,3663;3664,3674;3713,3715;3716,3717;3718,3723;3724,3748;3749,3750;3751,3774;3776,3781;3782,3783;3784,3790;3792,3802;3804,3808;3840,3841;3864,3866;3872,3882;3893,3894;3895,3896;3897,3898;3902,3912;3913,3949;3953,3973;3974,3992;3993,4029;4038,4039;4096,4170;4176,4254;4256,4294;4295,4296;4301,4302;4304,4347;4348,4681;4682,4686;4688,4695;4696,4697;4698,4702;4704,4745;4746,4750;4752,4785;4786,4790;4792,4799;4800,4801;4802,4806;4808,4823;4824,4881;4882,4886;4888,4955;4957,4960;4969,4978;4992,5008;5024,5110;5112,5118;5121,5741;5743,5760;5761,5787;5792,5867;5870,5881;5888,5901;5902,5909;5920,5941;5952,5972;5984,5997;5998,6001;6002,6004;6016,6100;6103,6104;6108,6110;6112,6122;6155,6158;6160,6170;6176,6265;6272,6315;6320,6390;6400,6431;6432,6444;6448,6460;6470,6510;6512,6517;6528,6572;6576,6602;6608,6619;6656,6684;6688,6751;6752,6781;6783,6794;6800,6810;6823,6824;6832,6846;6912,6988;6992,7002;7019,7028;7040,7156;7168,7224;7232,7242;7245,7294;7296,7305;7312,7355;7357,7360;7376,7379;7380,7419;7424,7674;7675,7958;7960,7966;7968,8006;8008,8014;8016,8024;8025,8026;8027,8028;8029,8030;8031,8062;8064,8117;8118,8125;8126,8127;8130,8133;8134,8141;8144,8148;8150,8156;8160,8173;8178,8181;8182,8189;8204,8206;8255,8257;8276,8277;8305,8306;8319,8320;8336,8349;8400,8413;8417,8418;8421,8433;8450,8451;8455,8456;8458,8468;8469,8470;8472,8478;8484,8485;8486,8487;8488,8489;8490,8506;8508,8512;8517,8522;8526,8527;8544,8585;11264,11311;11312,11359;11360,11493;11499,11508;11520,11558;11559,11560;11565,11566;11568,11624;11631,11632;11647,11671;11680,11687;11688,11695;11696,11703;11704,11711;11712,11719;11720,11727;11728,11735;11736,11743;11744,11776;12293,12296;12321,12336;12337,12342;12344,12349;12353,12439;12441,12448;12449,12539;12540,12544;12549,12592;12593,12687;12704,12731;12784,12800;13312,19894;19968,40944;40960,42125;42192,42238;42240,42509;42512,42540;42560,42608;42612,42622;42623,42738;42775,42784;42786,42889;42891,42944;42946,42951;42999,43048;43072,43124;43136,43206;43216,43226;43232,43256;43259,43260;43261,43310;43312,43348;43360,43389;43392,43457;43471,43482;43488,43519;43520,43575;43584,43598;43600,43610;43616,43639;43642,43715;43739,43742;43744,43760;43762,43767;43777,43783;43785,43791;43793,43799;43808,43815;43816,43823;43824,43867;43868,43880;43888,44011;44012,44014;44016,44026;44032,55204;55216,55239;55243,55292;63744,64110;64112,64218;64256,64263;64275,64280;64285,64297;64298,64311;64312,64317;64318,64319;64320,64322;64323,64325;64326,64434;64467,64830;64848,64912;64914,64968;65008,65020;65024,65040;65056,65072;65075,65077;65101,65104;65136,65141;65142,65277;65296,65306;65313,65339;65343,65344;65345,65371;65382,65471;65474,65480;65482,65488;65490,65496;65498,65501;65536,65548;65549,65575;65576,65595;65596,65598;65599,65614;65616,65630;65664,65787;65856,65909;66045,66046;66176,66205;66208,66257;66272,66273;66304,66336;66349,66379;66384,66427;66432,66462;66464,66500;66504,66512;66513,66518;66560,66718;66720,66730;66736,66772;66776,66812;66816,66856;66864,66916;67072,67383;67392,67414;67424,67432;67584,67590;67592,67593;67594,67638;67639,67641;67644,67645;67647,67670;67680,67703;67712,67743;67808,67827;67828,67830;67840,67862;67872,67898;67968,68024;68030,68032;68096,68100;68101,68103;68108,68116;68117,68120;68121,68150;68152,68155;68159,68160;68192,68221;68224,68253;68288,68296;68297,68327;68352,68406;68416,68438;68448,68467;68480,68498;68608,68681;68736,68787;68800,68851;68864,68904;68912,68922;69376,69405;69415,69416;69424,69457;69600,69623;69632,69703;69734,69744;69759,69819;69840,69865;69872,69882;69888,69941;69942,69952;69956,69959;69968,70004;70006,70007;70016,70085;70089,70093;70096,70107;70108,70109;70144,70162;70163,70200;70206,70207;70272,70279;70280,70281;70282,70286;70287,70302;70303,70313;70320,70379;70384,70394;70400,70404;70405,70413;70415,70417;70419,70441;70442,70449;70450,70452;70453,70458;70459,70469;70471,70473;70475,70478;70480,70481;70487,70488;70493,70500;70502,70509;70512,70517;70656,70731;70736,70746;70750,70752;70784,70854;70855,70856;70864,70874;71040,71094;71096,71105;71128,71134;71168,71233;71236,71237;71248,71258;71296,71353;71360,71370;71424,71451;71453,71468;71472,71482;71680,71739;71840,71914;71935,71936;72096,72104;72106,72152;72154,72162;72163,72165;72192,72255;72263,72264;72272,72346;72349,72350;72384,72441;72704,72713;72714,72759;72760,72769;72784,72794;72818,72848;72850,72872;72873,72887;72960,72967;72968,72970;72971,73015;73018,73019;73020,73022;73023,73032;73040,73050;73056,73062;73063,73065;73066,73103;73104,73106;73107,73113;73120,73130;73440,73463;73728,74650;74752,74863;74880,75076;77824,78895;82944,83527;92160,92729;92736,92767;92768,92778;92880,92910;92912,92917;92928,92983;92992,92996;93008,93018;93027,93048;93053,93072;93760,93824;93952,94027;94031,94088;94095,94112;94176,94178;94179,94180;94208,100344;100352,101107;110592,110879;110928,110931;110948,110952;110960,111356;113664,113771;113776,113789;113792,113801;113808,113818;113821,113823;119141,119146;119149,119155;119163,119171;119173,119180;119210,119214;119362,119365;119808,119893;119894,119965;119966,119968;119970,119971;119973,119975;119977,119981;119982,119994;119995,119996;119997,120004;120005,120070;120071,120075;120077,120085;120086,120093;120094,120122;120123,120127;120128,120133;120134,120135;120138,120145;120146,120486;120488,120513;120514,120539;120540,120571;120572,120597;120598,120629;120630,120655;120656,120687;120688,120713;120714,120745;120746,120771;120772,120780;120782,120832;121344,121399;121403,121453;121461,121462;121476,121477;121499,121504;121505,121520;122880,122887;122888,122905;122907,122914;122915,122917;122918,122923;123136,123181;123184,123198;123200,123210;123214,123215;123584,123642;124928,125125;125136,125143;125184,125260;125264,125274;126464,126468;126469,126496;126497,126499;126500,126501;126503,126504;126505,126515;126516,126520;126521,126522;126523,126524;126530,126531;126535,126536;126537,126538;126539,126540;126541,126544;126545,126547;126548,126549;126551,126552;126553,126554;126555,126556;126557,126558;126559,126560;126561,126563;126564,126565;126567,126571;126572,126579;126580,126584;126585,126589;126590,126591;126592,126602;126603,126620;126625,126628;126629,126634;126635,126652;131072,173783;173824,177973;177984,178206;178208,183970;183984,191457;194560,195102;917760,918000|]
``` |
Vaughan v Menlove (1837) 132 ER 490 (CP) is a leading English tort law case that first introduced the concept of the reasonable person in law.
Facts
As hay decomposes, heat is generated. In the absence of ventilation, the increased heat can cause a fire.
The defendant built a hay rick (or haystack) near the boundary of his land which bordered the plaintiff's land. The defendant's hay rick had been built with a precautionary "chimney" to prevent the hay from spontaneously igniting, but it ignited anyway. He had been warned several times over a period of five weeks that the manner in which he built the hay rick was dangerous, but he said "he would chance it." Consequently, the hay ignited and spread to the plaintiff's land, burning down two of the plaintiff's cottages.
Judgment
Trial
At trial the judge instructed the jury to consider whether the fire had been caused by gross negligence on the part of the defendant, and stated the defendant "was [duty] bound to proceed with such reasonable caution as a prudent man would have exercised under such circumstances." The jury found the defendant negligent.
Appeal
The defendant appealed the trial court's verdict, arguing the jury should have instead been instructed to consider "whether he acted bona fide to the best of his judgment; if he had, he ought not to be responsible for the misfortune of not possessing the highest order of intelligence."
The court, composed of Tindal CJ, Park J and Vaughan J, rejected the defendant's argument, holding that the lower court's jury instructions were correct and therefore affirming the verdict. The court stated that to judge,
The court indicated that although this was a case of first impression, the "man of ordinary prudence" standard was supported by a similar duty of care applied in cases of bailment, in which liability was imposed only for negligence relative to that standard. The court also viewed the "reasonable man" standard as supported by the long-settled principle that persons must use their property so as not to harm that of others (sic utere tuo ut alienum non laedas). Finally, the court held that the question of whether the defendant was liable because of negligence in violation of the reasonable person standard was a proper question for the jury ("The care taken by a prudent man has always been the rule laid down; and as to the supposed difficulty of applying it, a jury has always been able to say, whether, taking that rule as their guide, there has been negligence....").
Significance
The defense counsel had argued that there was no duty imposed on the defendant to be responsible for the exercise of any given degree of care, in contrast to the duty of care imposed on common carriers and bailees, or under an implied contract. This case was decided during a transitional period in the history of the common law rule on negligence and liability. Until the mid- to late 19th century in the United States and England, there was no settled standard for tort liability. Courts in the early 19th century often found a negligence requirement for liability to exist only for common carriers or bailees. English and U.S. courts later began to move toward a standard of negligence based on a universal duty of care in light of the "reasonable person" test.
Vaughan v. Menlove is often cited as the seminal case which introduced the “reasonable person” test not only to the tort law, but to jurisprudence generally. This assertion is false. A 2019 law review article discovered that the misidentification of Vaughan v. Menlove as the birthplace of the “reasonable man of ordinary prudence” originated from a typographical error in an influential tort treatise, Prosser’s Law of Torts (4th edition), which erroneously cites the date of the case as “1738” rather than “1837.” Although no cases earlier than 1738 were found to apply a reasonable person standard, there exist several cases prior to 1837 applying the reasonable person standard. The error was corrected after the fourth edition of Prosser’s treatise, however subsequent legal scholars have continued to repeat the claim that Vaughan v. Menlove is where the “reasonable person” concept first appeared in the law, as the misattribution propagates indirectly through a citation network.
See also
English tort law
Notes
1837 in case law
English tort case law
1837 in British law
Court of Common Pleas (England) cases |
The following is an alphabetized and categorized list of notable tests.
Clinical psychology tests
Cognitive development tests
Intelligence tests
Cattell Culture Fair
Kohs block
Woodcock–Johnson Tests of Cognitive Abilities
Multidimensional Aptitude Battery II
Leiter International Performance Scale
Miller Analogies Test
Otis–Lennon School Ability Test
Raven's Progressive Matrices
Stanford–Binet Intelligence Scales
Sternberg Triarchic Abilities Test
Turing test
Wechsler Adult Intelligence Scale
Wechsler Intelligence Scale for Children
Wechsler Preschool and Primary Scale of Intelligence
Wonderlic Test
Medical tests
Self tests
Statistical tests
Ames test
Chi-squared test
Draize test
Dixon's Q test
F-test
Fisher's exact test
GRIM test
Kolmogorov–Smirnov test
Kuiper's test
Likelihood-ratio test
Median test
Mann–Whitney U test
Pearson's chi-squared test
Rank product test
Shapiro–Wilk test
Statistical hypothesis testing
Student's t-test
Tukey's range test
Tukey's test of additivity
Welch's t test
Personality tests
Pure-mathematical tests
Skills assessment tests
Student assessment test
Scantron test
Bourdon–Wiersma test
Graduate Management Admission Test
Graduate Record Examination (GRE)
GRE Physics Test
HESI exam
Japanese-Language Proficiency Test
Medical College Admission Test
SAT college entrance test
Screen test
Language tests
PTE-A (Pearson Test of English – Academic)
VET (Versant English Test)
IELTS (International English Language Testing System)
iTEP (International Test of English Proficiency)
TEFL (Teaching English as a Foreign Language)
TOEFL (Test of English as a Foreign Language)
TOEIC (Test of English for International Communication)
TSE (Test of Spoken English)
DALF (Test of French Language)
Industrial and manufacturing tests
Laboratory (non-medical) tests
Legal tests
Miscellaneous and uncategorized tests
See also
List of standardized tests in the United States
References
List
Tests |
Vera Alida Bergkamp (; born 1 June 1971) is a Dutch politician. A member of the Democrats 66 (D66) party, she has been a member of the House of Representatives since 20 September 2012. On 7 April 2021, she was elected Speaker of the House of Representatives.
Early life and education
Bergkamp was born in Amsterdam to a Dutch mother and a Moroccan father. At the age of 20, she adopted her mother's surname, because her father's surname was too difficult to write and to pronounce. Bergkamp studied human resource management at the Amsterdam University of Applied Sciences. She also holds a master's degree in public administration and political science from the Vrije Universiteit Amsterdam.
Career
From 2008 to 2012, Bergkamp was the director of the human resources department of the Social Insurance Bank (SVB), a Dutch quango responsible for administering national insurance schemes. From 2010 to 2012, she chaired the LGBT rights organisation COC Nederland, as well as held a seat in the district council of Amsterdam-Centrum.
In the 2012 general election, Bergkamp was elected into the House of Representatives as a member of D66. She was re-elected in 2017 and 2021. On 7 April 2021, she succeeded Khadija Arib as Speaker of the House of Representatives.
Personal life
Bergkamp is openly lesbian. She is married and has two children.
See also
2021 Speaker of the Dutch House of Representatives election
References
External links
Profile at Parlement.com
1971 births
Living people
21st-century Dutch women politicians
21st-century Dutch politicians
Democrats 66 politicians
Dutch columnists
Dutch human resource management people
Dutch people of Moroccan descent
Dutch political consultants
Lesbian politicians
LGBT members of the Parliament of the Netherlands
Dutch LGBT rights activists
Dutch lesbian writers
Members of the House of Representatives (Netherlands)
Municipal councillors of Amsterdam-Centrum
Speakers of the House of Representatives (Netherlands)
Vrije Universiteit Amsterdam alumni
Dutch women columnists
Writers from Amsterdam
20th-century Dutch women
20th-century Dutch LGBT people
21st-century Dutch LGBT people |
```javascript
'use strict';
const common = require('../common');
if (!common.hasCrypto)
common.skip('missing crypto');
const assert = require('assert');
const child_process = require('child_process');
const path = require('path');
process.env.NODE_DEBUG_NATIVE = 'http2';
process.env.NODE_DEBUG = 'http2';
const { stdout, stderr } = child_process.spawnSync(process.execPath, [
path.resolve(__dirname, 'test-http2-ping.js')
], { encoding: 'utf8' });
assert(stderr.match(/Setting the NODE_DEBUG environment variable to 'http2' can expose sensitive data \(such as passwords, tokens and authentication headers\) in the resulting log\.\r?\n/),
stderr);
assert(stderr.match(/Http2Session client \(\d+\) handling data frame for stream \d+\r?\n/),
stderr);
assert(stderr.match(/HttpStream \d+ \(\d+\) \[Http2Session client \(\d+\)\] reading starting\r?\n/),
stderr);
assert(stderr.match(/HttpStream \d+ \(\d+\) \[Http2Session client \(\d+\)\] closed with code 0\r?\n/),
stderr);
assert(stderr.match(/HttpStream \d+ \(\d+\) \[Http2Session server \(\d+\)\] closed with code 0\r?\n/),
stderr);
assert(stderr.match(/HttpStream \d+ \(\d+\) \[Http2Session server \(\d+\)\] tearing down stream\r?\n/),
stderr);
assert.strictEqual(stdout.trim(), '');
``` |
```shell
#!/usr/bin/env bats
# vim:set ft=bash :
load helpers
function setup() {
setup_test
CONTAINER_CONMON_CGROUP="pod" CONTAINER_INFRA_CTR_CPUSET="0" CONTAINER_DROP_INFRA_CTR=false start_crio
}
function teardown() {
cleanup_test
}
@test "test infra ctr cpuset" {
if [[ $RUNTIME_TYPE == pod ]]; then
skip "not yet supported by conmonrs"
fi
pod_id=$(crictl runp "$TESTDATA"/sandbox_config.json)
output=$(crictl inspectp -o yaml "$pod_id")
[[ "$output" = *"cpus: \"0\""* ]]
check_conmon_cpuset "$pod_id" '0'
# Ensure the container gets the appropriate taskset
ctr_id=$(crictl create "$pod_id" "$TESTDATA"/container_redis.json "$TESTDATA"/sandbox_config.json)
ctr_output=$(crictl inspect -o json "$ctr_id")
ctr_pid=$(jq -r '.info.pid' <<< "$ctr_output")
ctr_taskset=$(taskset -p "$ctr_pid")
[[ ${ctr_taskset#*current affinity mask: } = 1 ]]
}
``` |
Dheere Dheere Se () also known as Aashao Ka Savera...Dheere Dheere Se is an Indian Hindi-language drama television series produced by Siddharth Kumar Tewary under their banner Swastik Productions. It aired from 12 December 2022 to 7 July 2023 on Star Bharat. The series starred Reena Kapoor and Rahil Azam.
The story revolves around a widow woman’s compromises after her husband’s death, and the second chance she gets at love.
Premise
Bhawna who recently lost her husband and faces difficulty to sustain her day-to-day life after her husband’s death since she was so dependent upon him for her each and everyday necessities which seems very obvious, but her life takes a turn when Raghav enters her life giving her hope for being independent and financially literate which helps her overcome the obstacles of her life. The show is a mirror to society which shows how a woman, especially a widow is treated in society after she loses her husband and what difficulties she goes through which are not often talked about.
Cast
Main
Reena Kapoor as Bhavana Srivastav (formerly Shastri) : Aanchal's mother, Deepak's widow, Raghav's wife (2022-2023)
Rahil Azam as Raghav Srivastav: Brijmohan and Savita's son; Gaurav and Dimple's brother and Swati's brother-in law, Bhavana's husband; Aanchal’s step-father. (2022-2023)
Dhruti Mangeshkar as Aanchal "Bulbul" Shastri Srivastav: Deepak and Bhavana's daughter, Raghav's step-daughter (2022-2023)
Recurring
Vijay Badlani as Deepak Shastri: Jagjeevan's son; Bhanu and Amit's younger brother; Bhavana's husband; Aanchal's father. (2022-2023) (Dead)
Raja Kapse as Jagjeevan Shastri: Bhanu, Amit and Deepak's father; Malini, Vidya and Bhavana's father-in-law. (2022-2023)
Aman Verma as Bhanu Shastri: Jagjeevan's elder son; Amit and Deepak's elder brother; Abhishek's father; Dimple's father-in-law (2022-2023)
Emir Shah as Abhishek Shastri: Bhanu and Malini's son; Aarushi and Aanchal's cousin; Meera's ex-fianće; Dimple's love-interest turned husband. (2022-2023)
Raju Kher as Brijmohan Srivastav: Savita's husband; Raghav, Gaurav and Dimple's father; Bhavana,Swati and Abhishek's father-in law; Aarav's grandfather. (2022-2023)
Shama Deshpande as Savita Brijmohan Srivastav: Brijmohan's wife; Raghav, Gaurav and Dimple's mother; Bhavana, Swati and Abhishek's mother-in-law; Aarav's grandmother. (2022-2023)
Diksha Tiwari as Dimple Shastri (née Srivastav): Raghav and Gaurav's younger sister; Savita and Brijmohan's younger daughter; Swati's sister-in law; Abhishek's love-interest turned wife; Bhanu and Malini's daughter-in-law. (2022-2023)
Tisha Kapoor as Meera Mishra: Nirmala and Manohar's daughter; Abhishek's ex–fianće. (2023)
Jiya Solanki as Aarushi "Chulbul" Amit Shastri: Amit and Vidya's Daughter; Abhishek and Aanchal's cousin. (2022-2023)
Shilpa Kataria Singh as Nirmala Manohar Mishra: Meera's mother. (2023)
Yogesh Mahajan as Manohar Mishra: Meera's father. (2023)
Munendra Singh Kushwah as Inspector Rajesh Kaushik: Raghav's Friend. (2022-2023)
Bhavana Aneja as Vidya Amit Shastri: Amit's wife; Jagjeevan's middle daughter-in-law; Aarushi's mother. (2022-2023)
Praneet Bhatt as Amit Shastri : Jagjeevan's son; Bhanu and Deepak's brother; Vidya's husband; Aarushi's father. (2022-2023)
Malini Sengupta as Malini Bhanu Shastri: Bhanu's wife; Jagjeevan's eldest daughter-in-law; Abhishek's mother; Dimple's mother-in-law. (2022-2023)
Nidhi Tiwari as Poonam Vikas Sharma: Vikas' wife; Shastri family's neighbour. (2022-2023)
Mani Rai as Vikas Sharma: A tenant; Poonam's husband. (2022-2023)
Amit Sinha as Mr. Verma: Staff of Brijmohan Srivastav at BSA Office. (2022)
Shyam Lal Navait as Devraj: Raghav's helper. (2022-2023)
Suman Gupta as Swati Gaurav Srivastav: Gaurav's wife; Brijmohan and Savita's daughter-in law; Aarav's mother. (2022-2023)
Vikrant Kaul as Gaurav Srivastav: Brijmohan and Savita's son; Raghav's younger and Dimple's elder brother; Swati's husband; Aarav's father. (2022-2023)
Brijesh Maurya as Raghav's office peon. (2022)
Production
Casting
Reena Kapoor as Bhawana, and Rahil Azam as Raghav were signed as the lead.
Aman Verma and Ruhi Chaturvedi was cast to portray the negative lead.
Development
The series marks comeback for Aman Verma into fiction after five years.
Filming
The shooting of the series began in November 2022, mainly shot at the Film City, Mumbai. Some initial sequences were also shot at Ujjain.
Release
The first promo arrived in November 2022 featuring Reena Kapoor as Bhawana.
It replaced Bohot Pyaar Karte Hai from 12 December 2022.
See also
List of programs broadcast by Star Bharat
References
External links
Dheere Dheere Se on Disney+ Hotstar
2022 Indian television series debuts
Hindi-language television shows
Indian drama television series
Indian television soap operas
Star Bharat original programming |
Always prepared ( []) is the motto of the Pioneer movement , adopted by most of the Pioneer organizations in socialist countries. The motto is a common feature on the organizations' badges. The motto echoes the Scout motto, "Be Prepared." After the end of the Russian Civil War, the Scout organization of the former Tsarist Russia was reorganized into the Young Pioneers. The head of the Scouts, who supported the Red Army and the Komsomol, suggested the modified motto. The Scout motto, in use since 1907, meant that Scouts needed to be physically and mentally ready. The "always ready" of the young pioneers is mostly related to socialism, peace and country building.
Background
The motto of the Young Pioneers of the Soviet Union consisted of two parts, the summons and the answer or response (1986 revision is presented below).
Summons - Pioneer, to fight for the cause of the Communist Party of the Soviet Union, be prepared! ().
Response - Always prepared! ().
This, like other rituals and customs of the organization, reflected its origin in the Scouts movement (their motto is "Be Prepared").
Gallery
References
Mottos
Pioneer movement |
Model Town is a tehsil located in Lahore District, Punjab, Pakistan. The population is 2,698,235 according to the 2017 census.
Settlements
Kahna Nau
Lahore Metropolitan Corporation
See also
List of tehsils of Punjab, Pakistan
References
Tehsils of Punjab, Pakistan
Populated places in Lahore District |
Babu Lal Mahere is an Indian politician and member of the Bharatiya Janata Party. Mahere is a member of the Madhya Pradesh Legislative Assembly from the Ujjain Dakshin constituency in Ujjain district.
References
People from Ujjain
Bharatiya Janata Party politicians from Madhya Pradesh
Madhya Pradesh MLAs 1990–1992
Living people
Year of birth missing (living people) |
Katherine Brooks Waddell (born June 16, 1938) is a Virginia politician who served in the Virginia House of Delegates. She represented the 68th District, which includes portions of the City of Richmond and Chesterfield County.
Electoral history
References
External links
Official Biography - Virginia General Assembly
Campaign Website
1938 births
Living people
Members of the Virginia House of Delegates
Women state legislators in Virginia
Virginia Independents
Virginia Republicans
21st-century American politicians
21st-century American women politicians
Politicians from Danville, Virginia
Politicians from Richmond, Virginia
Averett University alumni |
```php
<?php
/*
*
* ____ _ _ __ __ _ __ __ ____
* | _ \ ___ ___| | _____| |_| \/ (_)_ __ ___ | \/ | _ \
* | |_) / _ \ / __| |/ / _ \ __| |\/| | | '_ \ / _ \_____| |\/| | |_) |
* | __/ (_) | (__| < __/ |_| | | | | | | | __/_____| | | | __/
* |_| \___/ \___|_|\_\___|\__|_| |_|_|_| |_|\___| |_| |_|_|
*
* This program is free software: you can redistribute it and/or modify
* (at your option) any later version.
*
* @author PocketMine Team
* @link path_to_url
*
*
*/
declare(strict_types=1);
namespace pocketmine\player;
interface IPlayer{
public function getName() : string;
public function getFirstPlayed() : ?int;
public function getLastPlayed() : ?int;
public function hasPlayedBefore() : bool;
}
``` |
```xml
/**
* Sets up the AI Assist plugin with preset prompts for content creation
*/
import { assist } from "@sanity/assist";
import postType from "../schemas/documents/post";
export const assistWithPresets = () =>
assist({
__presets: {
[postType.name]: {
fields: [
{
/**
* Creates Portable Text `content` blocks from the `title` field
*/
path: "content",
instructions: [
{
_key: "preset-instruction-1",
title: "Generate sample content",
icon: "block-content",
prompt: [
{
_key: "86e70087d4d5",
markDefs: [],
children: [
{
_type: "span",
marks: [],
text: "Given the draft title ",
_key: "6b5d5d6a63cf0",
},
{
path: "title",
_type: "sanity.assist.instruction.fieldRef",
_key: "0132742d463b",
},
{
_type: "span",
marks: [],
text: " of a blog post, generate a comprehensive and engaging sample content that spans the length of one to two A4 pages. The content should be structured, informative, and tailored to the subject matter implied by the title, whether it be travel, software engineering, fashion, politics, or any other theme. The text will be displayed below the ",
_key: "a02c9ab4eb2d",
},
{
_type: "sanity.assist.instruction.fieldRef",
_key: "f208ef240062",
path: "title",
},
{
text: " and doesn't need to repeat it in the text. The generated text should include the following elements:",
_key: "8ecfa74a8487",
_type: "span",
marks: [],
},
],
_type: "block",
style: "normal",
},
{
style: "normal",
_key: "e4dded41ea89",
markDefs: [],
children: [
{
_type: "span",
marks: [],
text: "1. Introduction: A brief paragraph that captures the essence of the blog post, hooks the reader with intriguing insights, and outlines the purpose of the post.",
_key: "cc5ef44a2fb5",
},
],
_type: "block",
},
{
style: "normal",
_key: "585e8de2fe35",
markDefs: [],
children: [
{
_type: "span",
marks: [],
text: "2. Main Body:",
_key: "fab36eb7c541",
},
],
_type: "block",
},
{
_type: "block",
style: "normal",
_key: "e96b89ef6357",
markDefs: [],
children: [
{
_type: "span",
marks: [],
text: "- For thematic consistency, divide the body into several sections with subheadings that explore different facets of the topic.",
_key: "b685a310a0ff",
},
],
},
{
children: [
{
marks: [],
text: "- Include engaging and informative content such as personal anecdotes (for travel or fashion blogs), technical explanations or tutorials (for software engineering blogs), satirical or humorous observations (for shitposting), or well-argued positions (for political blogs).",
_key: "c7468d106c91",
_type: "span",
},
],
_type: "block",
style: "normal",
_key: "ce4acdb00da9",
markDefs: [],
},
{
_type: "block",
style: "normal",
_key: "fb4572e65833",
markDefs: [],
children: [
{
_type: "span",
marks: [],
text: "- ",
_key: "5358f261dce4",
},
{
_type: "span",
marks: [],
text: " observations (for shitposting), or well-argued positions (for political blogs).",
_key: "50792c6d0f77",
},
],
},
{
children: [
{
marks: [],
text: "Where applicable, incorporate bullet points or numbered lists to break down complex information, steps in a process, or key highlights.",
_key: "3b891d8c1dde0",
_type: "span",
},
],
_type: "block",
style: "normal",
_key: "9364b67074ce",
markDefs: [],
},
{
_key: "a6ba7579cd66",
markDefs: [],
children: [
{
_type: "span",
marks: [],
text: "3. Conclusion: Summarize the main points discussed in the post, offer final thoughts or calls to action, and invite readers to engage with the content through comments or social media sharing.",
_key: "1280f11d499d",
},
],
_type: "block",
style: "normal",
},
{
style: "normal",
_key: "719a79eb4c1c",
markDefs: [],
children: [
{
marks: [],
text: "4. Engagement Prompts: Conclude with questions or prompts that encourage readers to share their experiences, opinions, or questions related to the blog post's topic, but keep in mind there is no Comments field below the blog post.",
_key: "f1512086bab6",
_type: "span",
},
],
_type: "block",
},
{
_type: "block",
style: "normal",
_key: "4a1c586fd44a",
markDefs: [],
children: [
{
marks: [],
text: "Ensure the generated content maintains a balance between being informative and entertaining, to capture the interest of a wide audience. The sample content should serve as a solid foundation that can be further customized or expanded upon by the blog author to finalize the post.",
_key: "697bbd03cb110",
_type: "span",
},
],
},
{
children: [
{
marks: [],
text: 'Don\'t prefix each section with "Introduction", "Main Body", "Conclusion" or "Engagement Prompts"',
_key: "d20bb9a03b0d",
_type: "span",
},
],
_type: "block",
style: "normal",
_key: "b072b3c62c3c",
markDefs: [],
},
],
},
],
},
{
/**
* Summarize content into the `excerpt` field
*/
path: "excerpt",
instructions: [
{
_key: "preset-instruction-2",
title: "Summarize content",
icon: "blockquote",
prompt: [
{
markDefs: [],
children: [
{
_key: "650a0dcc327d",
_type: "span",
marks: [],
text: "Create a short excerpt based on ",
},
{
path: "content",
_type: "sanity.assist.instruction.fieldRef",
_key: "c62d14c73496",
},
{
_key: "38e043efa606",
_type: "span",
marks: [],
text: " that doesn't repeat what's already in the ",
},
{
path: "title",
_type: "sanity.assist.instruction.fieldRef",
_key: "445e62dda246",
},
{
_key: "98cce773915e",
_type: "span",
marks: [],
text: " . Consider the UI has limited horizontal space and try to avoid too many line breaks and make it as short, terse and brief as possible. At best a single sentence, at most two sentences.",
},
],
_type: "block",
style: "normal",
_key: "392c618784b0",
},
],
},
],
},
],
},
},
});
``` |
```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';
var sort2hp = require( '@stdlib/blas/ext/base/gsort2hp' );
var discreteUniform = require( '@stdlib/random/array/discrete-uniform' );
var oneTo = require( './../lib' );
// Generate an array of random numbers:
var opts = {
'dtype': 'generic'
};
var x = discreteUniform( 10, 100, 200, opts );
// Generate a linearly-spaced array:
var y = oneTo( x.length, opts.dtype );
// Create a temporary array to avoid mutation:
var tmp = x.slice();
// Sort `y` according to the sort order of `x`:
sort2hp( x.length, 1, tmp, 1, y, 1 );
console.log( x );
console.log( y );
``` |
Moilang or Moirang (modern term) is one of the seven clans of the Meitei people. Moirang consists of many several Yumnaks which are native peoples of ancient Kangleipak (now Manipur), one of the states of India. Moirang clan is considered most rich clan in terms of culture as reflected in Khamba and Thoibi.
See also
Mangang
Luwang
Khuman
Angom
Kha Nganpa
Salai Leishangthem
References
Clans of Meitei |
```javascript
Hoisting
Functions can be declared after use
`.bind()`
Easily generate a random `HEX` color
Move cursor at the end of text input
``` |
Melinda Fábián (born June, 25 1987) is a Hungarian mixed martial artist, she was the first Hungarian who compete in the UFC.
Background
Born in 1987, Melinda Fábián first started fighting martial arts at the age of 12, starting to shotokan karate at Vértesszőlős where she reached the brown belt. She then made her way to Stockholm, where, besides karate, he became acquainted with Muay Thai. She returned home in 2006 and started her favorite martial art, which she liked as a kenpo karate the Kurayfat campsite. A year later, she had already won a silver medal at the World Championships in Home Affairs as a blue belt. And in 2013, at the World Championships, also home to the podium, she was the winner of the full contact and knockdown rules, with a black belt at her waist. Melinda loves Kenpo karate so much that she runs her own club, Sakura Doyo.
After finding great success at the campsite, Melinda set out on mixed martial arts, which was less well known in Hungary at the time. In this style, ground combat plays the same role as standing, so wrestling and Brazilian jiu-jitsu are at the forefront, as evidenced in Melinda's victories.
Personal life
Fábián had a date and relationship with her Head Coach Ferenc "Rendes" Peszlen.
Mixed martial career
Early career
The blonde lady first entered the cage at HFC 09 in 2015 as the only Hungarian female warrior in a quad tournament in front of a domestic audience. In the opening match, he had a straight-up victory in the first round, but she got exactly the same technique from her more experienced American opponent in the final. Nevertheless, according to Melinda, her lack of routine was the only drawback with the other fighters. In the next 3 games, she ended with one draw, one win (Ezekiel choke) and one with a split scoring defeat.
The defeat was followed by a two-match winning streak (brace, ankle strain), both knocking in the first round. (Interestingly, although Melinda is basically the strength of the stand-up fight, she has achieved all her victories by forcing and has never been knocked out.) Unfortunately, after two quick wins, a defeat slipped, but that did not stop her from winning. The Hungarian girl was to get the big chance of her life from UFC and finally show herself outside the old continent.
The Ultimate Fighter
She has been invited to The Ultimate Fighter UFC reality show, which has not become a former champion, and often gets a UFC contract at the end of the show. And the stake in the 26th TUF season was nothing but the winner becoming the champion of the newly introduced women's weight (57kg) division. Melinda – who even sold her car to buy a plane ticket overseas – joined Eddie Alvarez in the selection. (Eddie Alvarez is a former lightweight champion of Bellator and the UFC.)
Unfortunately, Melinda had an injury during the show, which put her mark on her training and preparation for the game. In the show, every warrior has a homemade video in which Melinda introduces Budapest, her apartment and talks about her team the Budapest Top Team. Her opponent, Rachael Ostovich, is a Hawaiian-born girl with a warrior background, with a balance of 3–3 (Melinda's 4–3–1). At the start of the match, the Hungarian girl worked well in stand-up combat but was unable to defend Rachael's grounding and gave up her back with an unfortunate move and the American took the opportunity and pulled in the back throttle after some submission attempts and some ground-and-pound and victory.
Ultimate Fighting Championship
Fábián faced DeAnna Bennett on December 1, 2017 at The Ultimate Fighter: A New World Champion#The Ultimate Fighter 26 Finale. The fight ended as a majority draw and Bennett was subsequently released from the promotion.
Her second fight came on June 23, 2018, at UFC Fight Night: Cerrone vs. Edwards against Ji Yeon Kim. She lost the fight via split decision.
On August 11, 2018, it was reported that Fábián was released by UFC.
Post UFC career
Fábián faced Karla Benitez on October 22, 2019, at The Cage Fighting Komarno 7. She won the fight via knockout.
Mixed martial arts record
|Win
|align=center|5–4–2
|Karla Benitez
|KO (head kick)
|Cage Fighting Komarno 7
|
|align=center|3
|align=center|4:59
|Győr, Hungary
|
|-
|Loss
|align=center|4–4–2
|Ji Yeon Kim
|Decision (split)
|UFC Fight Night: Cowboy vs. Edwards
|
|align=center|3
|align=center|5:00
|Kallang, Singapore
|
|-
|Draw
|align=center|4–3–2
|DeAnna Bennett
|Draw (Majority)
|The Ultimate Fighter: A New World Champion Finale
|
|align=center|3
|align=center|5:00
|Las Vegas, Nevada, United States
|
|-
|Loss
|align=center|4–3–1
|Judith Ruis
|Submission (guillotine choke)
|Aggrelin 16: MIA Cage Fight
|
|align=center|1
|align=center|4:30
|Munich, Germany
|
|-
|Win
|align=center|4–2–1
|Monic Bilicsi
|Submission (straight ankle lock)
|Aggrelin 15
|
|align=center|1
|align=center|0:14
|Nurnberg, Germany
|
|-
|Win
|align=center|3–2–1
|Tímea Nyistor
|Submission (armbar)
|Cage Fighting Komárno 1
|
|align=center|1
|align=center|0:38
|Komárno, Slovakia
|
|-
|Loss
|align=center|2–2–1
|Lucie Pudilová
| Decision (split)
|GCF 34: Back in The Fight 5
|
|align=center| 5
|align=center| 5:00
|Příbram, Czech Republic
|
|-
| Win
| align=center| 2–1–1
| Paulina Borkowska
| Submission (rear naked choke)
| PLMMA 62: AFC 6
|
| align=center| 2
| align=center| 2:32
| Wyszków, Poland
|
|-
| Draw
| align=center| 1–1–1
| Eava Siikonen
| Draw (majority)
| Carelia Fight 11
|
| align=center| 3
| align=center| 5:00
| Imatra, Finland
|
|-
| Loss
| align=center| 1–1
| Katlyn Chookagian
| Submission (armbar)
| PMMAL Hungarian Fight Championship 9
|
| align=center| 1
| align=center| 4:33
| Budapest, Hungary
|
|-
| Win
| align=center| 1–0
| Barbora Poláková
| Submission (armbar)
| PMMAL Hungarian Fight Championship 9
|
| align=center| 1
| align=center| 3:34
| Budapest, Hungary
|
|-
| Loss
| align=center | 0–1
| Rachael Ostovich
| Submission (rear naked choke)
|rowspan=2| The Ultimate Fighter: A New World Champion
| (air date)
| align=Center | 1
| align=center | 4:22
|rowspan=2| Las Vegas, Nevada, United States
|
References
Hungarian female mixed martial artists
1987 births
Living people
Hungarian female karateka
Hungarian practitioners of Brazilian jiu-jitsu
Female Brazilian jiu-jitsu practitioners
Sportspeople from Tatabánya
Mixed martial artists utilizing American Kenpo
Mixed martial artists utilizing Shotokan
Mixed martial artists utilizing boxing
Mixed martial artists utilizing Brazilian jiu-jitsu
Ultimate Fighting Championship female fighters |
A Gladstone bag is a small portmanteau suitcase built over a rigid frame, which can separate into two equal sections. Gladstones are typically made of stiff leather and often belted with lanyards. The bags are named after William Gladstone (1809–1898), the four-time Prime Minister of the United Kingdom.
History
The first Gladstone bag was designed and manufactured by J. G. Beard at his leather shop in the City of Westminster.
The patent for "An Improvement In The Frames Of Traveling Bags" was registered by Edward Cole on 4 February 1854, and sealed 14 July 1854. This original patent is still held by Cole Brothers of England in their archive. At the end of the 19th century, the business of Edward Cole was taken over and run by two of his sons, James and Edward, and subsequently changed to Cole Brothers in 1907, being located at 24a Floral Street, Covent Garden, after the earlier demolition of the Hemmings Row site in 1886 to make way for the extension to the National Gallery.
The Gladstone bag should not be confused with the attaché case-styled red box (also called a despatch box or ministerial box) which is issued to British Cabinet ministers to carry official paperwork, and the one also used to deliver government papers to the monarch. Red boxes are made by Barrow Hepburn & Gale, and the pattern of the two styles is totally different. When he was Chancellor of the Exchequer, Gladstone used a red box to carry his 1853 Budget Speech to Parliament. The travelling case to which his name is now attached was not patented until the following year. It has a frame with an opening top, rather than the book-type opening on a spine, as featured on the red box.
By the end of the 19th century, the Gladstone bag had been adopted by doctors to carry their medical equipment. Gladstone bags were also used by the pursers on the RMS Titanic to carry valuables.
References
External links
Luggage |
A liquid-ring pump is a rotating positive-displacement gas pump, with liquid under centrifugal force acting as a seal.
Description of operation
Liquid-ring pumps are typically used as vacuum pumps, but can also be used as gas compressors. The function of a liquid-ring pump is similar to a rotary vane pump, with the difference being that the vanes are a rigid part of the rotor and churn a rotating ring of liquid to form the compression-chamber seal. They are an inherently low-friction design, with the rotor being the only moving part. Sliding friction is limited to the shaft seals. Liquid-ring pumps are typically powered by an induction motor.
The liquid-ring pump compresses gas by rotating a vaned impeller located eccentrically within a cylindrical casing. Liquid (often water) is fed into the pump, and by centrifugal acceleration forms a moving cylindrical ring against the inside of the casing. This liquid ring creates a series of seals in the spaces between the impeller vanes, which form compression chambers. The eccentricity between the impeller's axis of rotation and the casing geometric axis results in a cyclic variation of the volume enclosed by the vanes and the ring.
A gas (often air) is drawn into the pump through an inlet port in the side of the casing. The gas is trapped in the compression chambers formed by the impeller vanes and the liquid ring. The reduction in volume caused by the impeller rotation compresses the gas, which exits through the discharge port in the side of the casing.
The compressed gas at the discharge of pump contains a small amount of the working fluid, which is usually removed in a vapor–liquid separator.
History
The earliest liquid-ring pumps date from 1903, when a patent was granted in Germany to Siemens-Schuckert. US Patent 1,091,529, for liquid-ring vacuum pumps and compressors, was granted to Lewis H. Nash in 1914. They were manufactured by the Nash Engineering Company in Norwalk, Connecticut, US. Around the same time in Austria, Patent 69274 was granted to Siemens-Schuckertwerke for a similar liquid-ring vacuum pump.
Applications
These simple, but highly reliable pumps have a variety of industrial applications. They are used to maintain condenser vacuum on large steam-turbine generator sets by removing incondensable gasses, where vacuum levels are typically 30–50 mbar. They are used on paper machines to dewater the pulp slurry and to extract water from press felts. Another application is the vacuum forming of molded paper-pulp products (egg cartons and other packaging). Other applications include soil remediation, where contaminated ground water is drawn from wells by vacuum. In petroleum refining, vacuum distillation also makes use of liquid-ring vacuum pumps to provide the process vacuum. Liquid-ring compressors are often used in vapor recovery systems.
Design
Single- and multi-stage
Liquid-ring systems can be single- or multistage. Typically a multistage pump will have up to two cascaded compression stages on a common shaft. In vacuum service, the attainable pressure reduction is limited by the vapor pressure of the ring-liquid. As the generated vacuum approaches the vapor pressure of the ring-liquid, the increasing volume of vapor released from the ring-liquid diminishes the remaining vacuum capacity. The efficiency of the system declines as the limit is approached.
Single-stage vacuum pumps typically produce vacuum to 35 Torr (mm Hg) or , and two-stage pumps can produce vacuum to 25 Torr, assuming air is being pumped and the ring-liquid is water at or less. Dry air and 15 °C sealant-water temperature is the standard performance basis, which most manufacturers use for their performance curves.
Recirculation of ring-liquid
Some ring-liquid is also entrained with the gaseous discharge stream. This liquid is separated from the gas stream by other equipment external to the pump. In some systems, the discharged ring-liquid is cooled by a heat exchanger or cooling tower, and then returned to the pump casing. In some recirculating systems, contaminants from the gas become trapped in the ring-liquid, depending on system configuration. These contaminants become concentrated as the liquid continues to recirculate, and eventually could cause damage and reduced life of the pump. In this case, filtration systems are required to ensure that contamination is kept to acceptable levels.
In non-recirculating systems, the discharged hot liquid (usually water) is treated as a waste stream. In this case, fresh cool water is used to make up the loss. Environmental considerations are making such "once-through" systems increasingly rare.
Liquid selection
Liquid-ring vacuum pumps can use any liquid compatible with the process as the sealant liquid, provided it has the appropriate vapor pressure properties. Although the most common sealant is water, almost any liquid can be used. The second most common sealant liquid is oil. Since oil has a very low vapor pressure, oil-sealed liquid-ring vacuum pumps are typically air-cooled. For dry chlorine gas applications, concentrated sulfuric acid is used as the sealant.
The ability to use any liquid allows the liquid-ring vacuum pump to be ideally suited for solvent (vapor) recovery. For example, if a process such as distillation or a vacuum dryer is generating toluene vapors, then it is possible to use liquid toluene as the sealant, provided the cooling water is cold enough to keep the vapor pressure of the sealant liquid low enough to pull the desired vacuum.
Ionic liquids in liquid-ring vacuum pumps can lower the vacuum pressure from about 70 mbar to below 1 mbar.
References
Pumps
Gas technologies |
Hastings-on-Hudson station is a commuter rail stop on the Metro-North Railroad's Hudson Line, located in Hastings-on-Hudson, New York.
As of August 2006, daily commuter ridership was 1154 and there are 783 parking spots.
History
Hastings-on-Hudson has had railroad service from as far back as the 1840s, pre-dating the Hudson River Railroad, and served both passengers and a local sugar refinery. In 1875, a major fire destroyed the waterfront, and the company running the sugar refinery left town, but other industries ended up taking its place.
The current Hastings-on-Hudson station building was built in 1910 by the New York Central Railroad. As with many NYCRR stations in Westchester County, the station became a Penn Central station upon the merger between NYC and Pennsylvania Railroad in 1968, until it was taken over by Conrail in 1976, and then by Metro-North Railroad in 1983.
Station layout
The station has two slightly offset high-level side platforms each eight cars long. The inner tracks not next to either platform are used by express trains, only one of the express tracks is powered.
References
External links
Hastings-on-Hudson Metro-North Station (TheSubwayNut)
Entrance from Google Maps Street View
Metro-North Railroad stations in New York (state)
Former New York Central Railroad stations
Railway stations in Westchester County, New York
Railway stations in the United States opened in 1849
1849 establishments in New York (state) |
Frederick Brock may refer to:
Frederic Edward Errington Brock (1854–1929), English naval officer
Frederick Brock (footballer) (1901–?), English footballer
Frederick W. Brock (1899–1972), Swiss optometrist
See also
Fred Brock (born 1974), American football player |
Zhouzhi County () is a county under the administration of Xi'an, the capital of Shaanxi province, China. It is the most spacious but least densely populated county-level division of Xi'an, and also contains the city's southernmost and westernmost points. The county borders the prefecture-level cities of Xianyang to the north, Ankang to the southeast, Hanzhong to the southwest, and Baoji to the west, as well as Xi'an's Huyi District to the east. It is famous for kiwifruit, one type of produce in which Shaanxi province excels.
Many of notable historical figures have visited Zhouzhi county, such as Chinese philosopher Laozi (老子), poet Bai Juyi (白居易), and British biochemist Joseph Needham.
There are some claims Yu the Great (大禹) was born in Zhouzhi county hongqi village.
In 1964, the Chinese name of Zhouzhi was changed from '' to its current homophonous name.
Administrative divisions
As 2020, Zhouzhi County is divided to 1 subdistrict and 19 towns.
Subdistricts
Erqu Subdistrict ()
Towns
Climate
See also
Roman Catholic Diocese of Zhouzhi
Louguantai
Daqin Pagoda
References
External links
County-level divisions of Shaanxi
Geography of Xi'an |
The Union of Food and Tobacco Workers () was a trade union representing workers in the food and tobacco processing sectors in Yugoslavia.
The union was founded in April 1945 and affiliated to the Confederation of Trade Unions of Yugoslavia. Initially, it only represented food workers, but in 1948, it absorbed the smaller Union of Workers and Employees of the Tobacco Industry. By 1954, it claimed 57,437 members, and was led by Mladen Bogosavljević. In 1959, it merged with the Union of Agricultural Workers and Employees, to form the Union of Agricultural, Food Processing and Tobacco Workers of Yugoslavia.
References
Food processing trade unions
Tobacco industry trade unions
Trade unions established in 1945
Trade unions disestablished in 1959
Trade unions in Yugoslavia |
Quinzio Rustici (died 1566) was a Roman Catholic prelate who served as Bishop of Mileto (1523–1566).
Biography
Quinzio Rustici was born in Rome, Italy.
On 26 November 1523, he was appointed during the papacy of Pope Clement VII as Bishop of Mileto.
On 19 March 1535, he was consecrated bishop by Girolamo Grimaldi, Cardinal-Deacon of San Giorgio in Velabro.
He served as Bishop of Mileto until his death in 1566.
References
External links and additional sources
(for Chronology of Bishops)
(for Chronology of Bishops)
16th-century Italian Roman Catholic bishops
Bishops appointed by Pope Clement VII
1566 deaths |
A Nice Little Bank That Should Be Robbed is a 1958 American comedy film directed by Henry Levin and written by Sydney Boehm. The film stars Tom Ewell, Mickey Rooney, Mickey Shaughnessy, Dina Merrill, Madge Kennedy and Frances Bavier. The film was released on December 1, 1958, by 20th Century Fox.
Plot
Auto mechanic Max Rutgers is spinning his wheels, going nowhere. He has been promising sweetheart Margie Solitaire for five years that they will marry, but wishes he had more money to support her.
His best pal, Gus Harris, knows a lot about racehorses, but keeps flunking his exam to become a licensed trainer. Fed up, he and Max decide to rob a bank, succeeding in a heist of $28,000. They use the money to buy a horse, Tattooed Man, but an acquaintance, cabbie and bookie Rocky Baker, figures out how they got the money and wants to be cut in on a share.
Max and Gus bet their life savings on Tattooed Man's next race. When their horse is victorious, only to be disqualified for a rules infraction, they become desperate and decide to rob another bank. A series of errors ensues, teller Grace Havens being held hostage, the vault being on a timer and unable to be opened until morning, and bank manager Schroeder coming along for the ride in his own vehicle when the getaway car they stole from Margie isn't there.
The police ultimately trace the thieves to Margie's house and take the crooks into custody. Max, Gus and Rocky are behind bars together when they hear a radio broadcast of a big race that Tattooed Man wins.
Cast
Tom Ewell as Max Rutgers
Mickey Rooney as Gus Harris
Mickey Shaughnessy as Harold 'Rocky' Baker
Dina Merrill as Margie Solitaire
Madge Kennedy as Grace Havens
Frances Bavier as Mrs. Solitaire
Richard Deacon as Milburn Schroeder
Stanley Clements as Fitz
References
External links
1958 films
1950s crime comedy films
20th Century Fox films
American black-and-white films
American crime comedy films
American heist films
Films about bank robbery
Films directed by Henry Levin
1958 comedy films
1950s English-language films
1950s American films |
New Tales from the Borderlands is a graphic adventure video game developed by Gearbox Studio Québec and published by 2K. A spin-off of the Borderlands series and a successor to Tales from the Borderlands (2014–2015), the game was released in October 2022 for Nintendo Switch, PlayStation 4, PlayStation 5, Windows, Xbox One, and Xbox Series X and Series S.
Gameplay
Similar to Tales from the Borderlands, it is a graphic adventure game in which the player must move the game's protagonist around the world's environment, explore their surroundings, complete quick-time events, and make narrative choices that may change the outcome of the story. Each character has their own unique gadgets. Anu has a high-tech glasses which allow her to scan objects; Octavio can browse other people's social media pages and hack into their devices; Fran can freeze enemies using her hoverchair.
Plot
Characters and settings
Set about a year after Borderlands 3, weapon manufacturer Tediore has begun invading the planet Promethea. New Tales from the Borderlands introduces a cast of new characters, including three playable protagonists: Anuradha Dhar (Michelle Rambharose), an altruistic scientist; Octavio Wallace-Dhar (Diego Stredel), Anu's brother who is seeking for fame and fortune; and Francine Miscowicz (Lucia Frangione), the owner of a frozen yogurt store who uses a hoverchair for mobility. The player must guide the three protagonists, each with their own hopes and dreams, as they fight against Tediore agents, as well as monsters and criminals that roam the planet. The trio must also work together as they seek a Vault key which may grant them access to a vault stashed with treasures that may change their lives forever. Major non-playable characters include: L0U13 (Temapare Hodson), an assassination bot allied with the three protagonists; Rhys Strongfork (Ray Chase), CEO of Atlas and previously one of the two playable protagonists of Tales from the Borderlands; and Susan Coldwell (Samantha Ferris), CEO of Tediore and the major antagonist of the game. Weapon salesman Marcus Kincaid (Bruce DuBose) returns as the narrator of the game, while Fiona (Laura Bailey), the other playable protagonist of Tales, makes a cameo appearance in the ending.
Synopsis
Atlas scientist Anuradha Dhar attempts to present her invention, a non-lethal ray gun utilizing Eridium to mimic Siren powers, to her boss, Rhys Strongfork, but the device is rejected and she is fired from her job. Just as she returns to her office, the Atlas space station is under siege by Tediore forces, who are attempting to acquire a Vault Key from Rhys. Anu escapes to Promethea using Rhys' car. Meanwhile, on Promethea, Anu's estranged half-brother, Octavio Wallace-Dhar, also struggles to survive the Tediore invasion alongside his friend, assassination bot L0U13. Anu and Octavio later reunite at Fran's Frogurt, a failing frozen yogurt shop owned by Octavio's boss, Francine Miscowicz. After Tediore forces decimate the shop while looking for Octavio, the three of them agree to ally and find out Tediore's plan.
Anu, Octavio, and Fran follow Tediore troops to the sewers, where they discover a Vault entrance. Upon entering, they are forced to face the Vault's guardian, the Devourer. With their combined efforts, they defeat the Devourer and retrieve a green shard from its body, which they later learn has healing capabilities. On Octavio's suggestion, the trio signs up for the reality game show Sink or Swim to pitch the shard, combined with Anu's ray gun, as an invention, in order to win the prize money and start their own business. Though Anu nearly loses her life while making her sales pitch, they manage to win the competition with backing from an angel investor. Anu later learns, however, that Tediore had put a bounty on her head, having recovered her ID card from the Vault. Tediore forces later attack the shop and kill Anu, though Octavio is able to revive her using her ray gun. However, Anu is temporarily possessed by an unknown entity, who demands that they are reunited with their "twin".
Octavio contacts the angel investor to seek refuge, to which they agree. However, it turns out to be a trap as Tediore's CEO, Susan Coldwell, reveals herself as the angel investor in disguise. After capturing the trio and L0U13, Coldwell makes a presentation to other mega-corporation CEOs, revealing that the green shard is one-half of a full Anahatium shard, and that she was in possession of the other half; with both shards, Coldwell can power up a superweapon capable of torturing others by killing and resurrecting them repeatedly. As she demands the other corporations to merge with Tediore by choice or force, the entity within Anu becomes enraged and breaks free from containment, while also fusing the green shard with Anu's body. Coldwell detains them once more, and instructs her scientists to remove the shard from Anu.
Octavio, Fran and L0U13 manage to break free on their own and reunite with each other, then later find Anu, who had a conversation with the shard's spirit entity while in coma. They learn that Coldwell had constructed a gigantic-sized version of Anu's device. After L0U13 sacrifices himself, the trio moves on and confronts Coldwell, who uses her super gun on the entirety of Promethea. Anu is faced with a choice: to merge with the shard and become a corporeal entity, killing her mortal form and gaining the power to defeat Coldwell, or resist the shard and work with Octavio and Fran. Regardless of the choices, Coldwell is killed and the Anahatium shard is fully reunited, as it flies away into space, and Promethea's population is restored.
Depending on the player's choices, there are several possible endings, which are reliant on the bond between the playable characters. There are three endings, each of which feature one of the characters dying; another ending where they survive but go their separate ways; or an ending where they survive and start a new business together, alongside all of their friends on Promethea as well as a rebuilt L0U13. Meanwhile, it is revealed that Marcus Kincaid is narrating the story to Fiona, a con artist and Vault Hunter, who deduces where the Anahatium shard ends up next.
Development
The original Tales from the Borderlands was developed by Telltale Games, which was shut down in 2018. Gearbox Studio Quebec, which was opened in 2015, served as the game's lead developer. The team spent at least two and a half years developing the game. As the Gearbox team did not have experience developing a game featuring a branching narrative, they hired several key members of the original game's development team to help them understand how to write an interactive story which can respond to the choices and decisions made by players. The studio also hired Lin Joyce, a doctor in interactive fiction, to serve as the game's lead writer. While the game initially had a larger cast of characters, many actors were unable to complete motion capture work for the game. As a result, the writing team had to modify the game's script to focus on the three core characters, resulting in a more "intimate" story.
Gearbox considered New Tales from the Borderlands a "standalone product", and a spiritual successor to Tales from the Borderlands. It features a cast of new characters and a self-contained story, so that players will not need to have played other games in the series to fully understand the story. However, the game also features returning characters, including Rhys Strongfork, CEO of Atlas and one of the two protagonists from the original Tales, and his employee Lor from Borderlands 3. Its art also looks closer to that of Borderlands 3 than the original Tales, and the game is powered by Unreal Engine 4. New Tales from the Borderlands retains the episodic structure of the original game, but all five episodes were released at once, similar to Life Is Strange: True Colors.
Gearbox Software CEO Randy Pitchford announced a successor to Tales from the Borderlands at PAX East in April 2022. The game was officially unveiled at Gamescom in August 2022 by Gearbox and series publisher 2K. It was released on October 21, 2022 for Nintendo Switch, PlayStation 4, PlayStation 5, Windows, Xbox One, and Xbox Series X and Series S. The Deluxe Edition bundled the game with the original Tales, while players who pre-ordered the game would gain access to an in-game collectible, in-game credits, and cosmetics for the three protagonists.
Reception
New Tales from the Borderlands received "mixed or average" reviews, according to review aggregator Metacritic. Critics criticized the dated gameplay formula and the lack of impact of choices, while reactions to the story and writing were mixed.
References
External links
2022 video games
Borderlands (series) games
Gearbox Software games
Take-Two Interactive games
Windows games
Nintendo Switch games
PlayStation 4 games
PlayStation 5 games
Xbox One games
Xbox Series X and Series S games
Video games set on fictional planets
Video games developed in Canada
Point-and-click adventure games
Single-player video games
Science fiction video games
Unreal Engine games
2K games |
Poghosagomer () or Devedashy () is a village that is, de facto, in the Martakert Province of the breakaway Republic of Artsakh; de jure, it is in the Kalbajar District of Azerbaijan, in the disputed region of Nagorno-Karabakh. The village has an ethnic Armenian-majority population, and also had an Armenian majority in 1989.
History
During the Soviet period, the village was part of the Mardakert District of the Nagorno-Karabakh Autonomous Oblast.
Historical heritage sites
Historical heritage sites in and around the village include khachkars from between the 11th and 13th centuries, the 12th/13th-century Holy Savior Monastery (), a 12th/13th-century village and cemetery, a 13th-century chapel, and a 19th-century spring monument.
Economy and culture
The population is mainly engaged in agriculture, animal husbandry, and mining. As of 2015, the village has a municipal building, a secondary school, two shops, and a medical centre. The community of Poghosagomer includes the village of Ghazarahogh.
Demographics
The village had 157 inhabitants in 2005, and 242 inhabitants in 2015.
References
External links
Populated places in Martakert Province
Populated places in Kalbajar District |
GMI may refer to:
Educational and research institutions
General Motors Institute of Technology, in Flint, Michigan, United States
Genomic Medicine Institute, at the Cleveland Clinic, Ohio, United States
Georgia Medical Institute, in Georgia, United States
Georgia Military Institute, in Marietta, Georgia, United States
German-Malaysian Institute, in Malaysia
Gorgas Memorial Institute for Health Studies, a medical research institution in Panama
Greenwich Maritime Institute, of the University of Greenwich, England
Gregor Mendel Institute, a biological research institute in Austria
Enterprises and organizations
General Mills Inc
George C. Marshall Institute, an American think tank
Global Methane Initiative, an environmental organization
GMInsideNews, an internet forum focused on General Motors
Grace Ministries International, a Christian organization
Greater Ministries International, an American Christian ministry that ran a Ponzi scheme
Groupement Mixte d'Intervention, a French Cold-War-era counter-intelligence service
Transport
Gasmata Airport, in Papua New Guinea
Germania (airline), a German airline
Gond Umri railway station, in Maharashtra, India
Other uses
GamesMaster International, a British magazine
Giant magnetoimpedance
Global microbial identifier
Global Militarization Index
GPM Microwave Imager (see Global Precipitation Measurement)
Graded motor imagery, a therapy for Complex regional pain syndrome (CRPS)
Guaranteed minimum income
.gmi, a file extension used by Gemini (protocol) |
```c++
// This Source Code Form is subject to the terms of the Mozilla Public
// file, You can obtain one at path_to_url
#include <chrono>
#include <condition_variable>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <thread>
#include <map>
#include <algorithm>
#include <atomic>
#include <gtest/gtest.h>
#include <vsomeip/vsomeip.hpp>
#include <vsomeip/internal/logger.hpp>
#include "offer_test_globals.hpp"
#include "../someip_test_globals.hpp"
#include <common/vsomeip_app_utilities.hpp>
static std::string service_number;
class offer_test_service : public vsomeip_utilities::base_logger {
public:
offer_test_service(struct offer_test::service_info _service_info) :
vsomeip_utilities::base_logger("OTS1", "OFFER TEST SERVICE"),
service_info_(_service_info),
// service with number 1 uses "routingmanagerd" as application name
// this way the same json file can be reused for all local tests
// including the ones with routingmanagerd
app_(vsomeip::runtime::get()->create_application(
(service_number == "1") ? "routingmanagerd" :
"offer_test_service" + service_number)),
counter_(0),
wait_until_registered_(true),
shutdown_method_called_(false),
offer_thread_(std::bind(&offer_test_service::run, this)) {
if (!app_->init()) {
ADD_FAILURE() << "Couldn't initialize application";
return;
}
app_->register_state_handler(
std::bind(&offer_test_service::on_state, this,
std::placeholders::_1));
// offer field
std::set<vsomeip::eventgroup_t> its_eventgroups;
its_eventgroups.insert(service_info_.eventgroup_id);
app_->offer_event(service_info_.service_id, service_info_.instance_id,
service_info_.event_id, its_eventgroups,
vsomeip::event_type_e::ET_EVENT, std::chrono::milliseconds::zero(),
false, true, nullptr, vsomeip::reliability_type_e::RT_BOTH);
inc_counter_and_notify();
app_->register_message_handler(service_info_.service_id,
service_info_.instance_id, service_info_.method_id,
std::bind(&offer_test_service::on_request, this,
std::placeholders::_1));
app_->register_message_handler(service_info_.service_id,
service_info_.instance_id, service_info_.shutdown_method_id,
std::bind(&offer_test_service::on_shutdown_method_called, this,
std::placeholders::_1));
app_->start();
}
~offer_test_service() {
offer_thread_.join();
}
void offer() {
app_->offer_service(service_info_.service_id, service_info_.instance_id);
// this is allowed
app_->offer_service(service_info_.service_id, service_info_.instance_id);
// this is not allowed and will be rejected
app_->offer_service(service_info_.service_id, service_info_.instance_id, 33, 4711);
}
void on_state(vsomeip::state_type_e _state) {
VSOMEIP_INFO << "Application " << app_->get_name() << " is "
<< (_state == vsomeip::state_type_e::ST_REGISTERED ?
"registered." : "deregistered.");
if (_state == vsomeip::state_type_e::ST_REGISTERED) {
std::lock_guard<std::mutex> its_lock(mutex_);
wait_until_registered_ = false;
condition_.notify_one();
}
}
void on_request(const std::shared_ptr<vsomeip::message> &_message) {
app_->send(vsomeip::runtime::get()->create_response(_message));
}
void on_shutdown_method_called(const std::shared_ptr<vsomeip::message> &_message) {
(void)_message;
shutdown_method_called_ = true;
// this is will trigger a warning
app_->stop_offer_service(service_info_.service_id, service_info_.instance_id, 44, 4711);
app_->stop_offer_service(service_info_.service_id, service_info_.instance_id);
app_->clear_all_handler();
app_->stop();
}
void run() {
VSOMEIP_DEBUG << "[" << std::setw(4) << std::setfill('0') << std::hex
<< service_info_.service_id << "] Running";
std::unique_lock<std::mutex> its_lock(mutex_);
while (wait_until_registered_) {
condition_.wait(its_lock);
}
VSOMEIP_DEBUG << "[" << std::setw(4) << std::setfill('0') << std::hex
<< service_info_.service_id << "] Offering";
offer();
VSOMEIP_DEBUG << "[" << std::setw(4) << std::setfill('0') << std::hex
<< service_info_.service_id << "] Notifying";
while(!shutdown_method_called_) {
std::this_thread::sleep_for(std::chrono::milliseconds(10));
inc_counter_and_notify();
}
}
void inc_counter_and_notify() {
++counter_;
// set value to field
const std::shared_ptr<vsomeip::payload> its_payload(vsomeip::runtime::get()->create_payload());
std::vector<vsomeip::byte_t> its_data;
its_data.push_back(static_cast<vsomeip::byte_t>((counter_ & 0xFF000000) >> 24));
its_data.push_back(static_cast<vsomeip::byte_t>((counter_ & 0xFF0000) >> 16));
its_data.push_back(static_cast<vsomeip::byte_t>((counter_ & 0xFF00) >> 8));
its_data.push_back(static_cast<vsomeip::byte_t>((counter_ & 0xFF)));
its_payload->set_data(its_data);
app_->notify(service_info_.service_id, service_info_.instance_id,
service_info_.event_id, its_payload);
}
private:
struct offer_test::service_info service_info_;
std::shared_ptr<vsomeip::application> app_;
std::uint32_t counter_;
bool wait_until_registered_;
std::mutex mutex_;
std::condition_variable condition_;
std::atomic<bool> shutdown_method_called_;
std::thread offer_thread_;
};
TEST(someip_offer_test, notify_increasing_counter)
{
offer_test_service its_sample(offer_test::service);
}
#if defined(__linux__) || defined(ANDROID) || defined(__QNX__)
int main(int argc, char** argv)
{
::testing::InitGoogleTest(&argc, argv);
if(argc < 2) {
std::cerr << "Please specify a service number, like: " << argv[0] << " 2" << std::endl;
return 1;
}
service_number = std::string(argv[1]);
return RUN_ALL_TESTS();
}
#endif
``` |
Juho Rantala (born 13 December 1974 in Helsinki) is a football manager and former defender/midfielder. He is an assistant manager with the Finland national under-19 football team.
References
Living people
1974 births
Finnish men's footballers
Finnish football managers
FC Honka managers
Men's association football defenders
Men's association football midfielders |
Bay of Sails () is a shallow indentation in the coast of Victoria Land between Spike Cape and Gneiss Point. The bay is the end point of Scheuren Stream, which carries meltwater from Wilson Piedmont Glacier.
The name was first suggested by the Western Geological Party of the British Antarctic Expedition, 1910–13, which erected makeshift sails on their man-drawn sledge while sledging across the ice at the mouth of the bay, thereby increasing their speed.
References
Bays of Victoria Land
Scott Coast |
Westwell Leacon is a hamlet in the civil parish of Charing near Ashford in Kent, England. Its most famous resident is international Cyclocross star Ian Field.
Villages in Kent |
Kuźnica Czarnkowska () is a village in the administrative district of Gmina Czarnków, within Czarnków-Trzcianka County, Greater Poland Voivodeship, in west-central Poland. It lies approximately north-west of Czarnków and north-west of the regional capital Poznań.
References
Villages in Czarnków-Trzcianka County |
```javascript
Custom Node REPL Server
Asynchronous File Write/Read in Node.js
Global Objects and Environment Variables in **Node**
The built-in Node debugger
Automatic compilation for Node with **Nodemon**
``` |
Dzhalaturi () is a rural locality (a selo) in Amishtinsky Selsoviet, Khunzakhsky District, Republic of Dagestan, Russia. Population: There is 1 street in this selo.
Geography
It is located 15 km from Khunzakh (the district's administrative centre), 85 km from Makhachkala (capital of Dagestan) and 1,632 km from Moscow. Amishta is the nearest rural locality.
References
Rural localities in Khunzakhsky District |
Lewis Anthony Botto (12 July 1898 – 4 June 1953), also written Louis Botto, was an English professional footballer who made 100 appearances in the Football League in the 1920s playing as a goalkeeper for Durham City, Wolverhampton Wanderers, Norwich City and Nelson. He also played non-league football for Jarrow Rangers, Hebburn Colliery, Shildon and Jarrow.
Life and career
Botto was born in 1898 in Jarrow, County Durham, a son of William Botto and his wife Sarah, who kept a common lodging-house in Stanley Street. William Botto died in 1910, and the 1911 Census shows the 12-year-old Lewis resident in the Chadwick Memorial Industrial School in Carlisle. Sarah Botto died in 1911.
Botto played football for Jarrow Rangers and Hebburn Colliery before signing amateur form with Football League Third Division North club Durham City in October 1923. He made his debut in the 1923–24 FA Cup first qualifying round match against Dipton United on 6 October, which Durham lost 1–0. Because Durham had a league match on the same day, they fielded a reserve side in the FA Cup, an offence for which the club was fined £5 by the Football Association and required to pay the Dipton club £10 compensation for loss of gate money. Botto made seven league appearances that season, standing in for Jimmy Hugall when the player-manager decided not to pick himself.
In 1924–25, Botto was undisputed first choice in goal, ever-present in both league and FA Cup as Durham City finished in mid-table. He was included in Durham's retained list for the next season, but Harry Harrison was brought in from Darlington as first choice and Botto spent the season with Shildon of the North-Eastern League. Harrison moved on and Botto returned for the 1926–27 season, initially as an amateur but signing professional forms in October 1926. He made 32 league appearances, and was transfer-listed by the financially struggling club at the end of the season.
On application to the Football League, he was given a free transfer, and in August he signed for Second Division club Wolverhampton Wanderers, whose backup goalkeeper Jack Hampton had left for Derby County. Botto began the season with the reserve team playing in the Central League, and came into the league side in November when Noel George's health worsened. He played three matches before Alf Canavon took his place, but came back into the team in March when Canavon was injured and kept the position to the end of the season. He was initially included in Wolves' retained list, but in mid-September was one of five players unexpectedly listed for transfer. He joined Norwich City, but played just twice in the Third Division South and was released on a free transfer. After a single appearance for Nelson in the Third Division North, his contract was cancelled in December 1929 and he returned home to play North-Eastern League football for Jarrow.
Botto died in Jarrow in 1953 at the age of 54.
References
General
Specific
1898 births
1953 deaths
Footballers from Jarrow
Footballers from County Durham
English men's footballers
Men's association football goalkeepers
Hebburn Colliery F.C. players
Durham City A.F.C. players
Shildon A.F.C. players
Wolverhampton Wanderers F.C. players
Norwich City F.C. players
Nelson F.C. players
Jarrow F.C. players
English Football League players |
José Alarcón is the name of:
José Alarcón (cyclist) (born 1988), Venezuelan cyclist
José Alarcón (politician) (1878–1940), Spanish politician
José Alarcón Hernández (born 1945), Mexican politician |
Lufthansa Consulting is an international aviation consultancy for airlines, airports and related industries. The company is an independent subsidiary of the Lufthansa Group and provides services to the air transportation industry worldwide. The headquarters are situated at the Frankfurt Airport Center (FAC) in Frankfurt, and there are branch offices in Moscow and Rio de Janeiro. Around 100 employees from 18 countries work on projects throughout the world. The German consultancy assists aviation-specific client groups including airlines, airports and aviation authorities as well as related industries such as ground handling companies, cargo terminal operators, aircraft manufacturers and financial institutions. Safety issues and sustainable aviation have gained increasing importance for the aviation industry as particularly airlines, and airports strive to comply with new security and environmental regulations.
History
Lufthansa Consulting GmbH was founded in 1998 as a subsidiary of Lufthansa. This independent service area was capable of reacting more flexibly to market demand. The intention was for Lufthansa Consulting to offer services to the transportation industry in general. Based on this decision a cooperation with a railway company and other transportation and aviation companies were planned.
In the 1990s with an increased market orientation the consulting portfolio was extended to include Air Traffic Control and infrastructure development services. The rising demand for services that included implementation caused a shift in the product development focus. Lufthansa Consulting established aviation restructuring and privatization services. During this period international projects included the privatization of Carrasco International Airport in Uruguay and the turnaround of Mexicana de Aviación in Mexico and the restructuring of Philippine Airlines.
From 2000 Lufthansa Consulting focused on management consultancy services for the aviation industry. Notable projects have included the restructuring of Air Madagascar, the development of Ouagadougou International Airport, flight operations and safety improvements at Petrobras and upgrading operational processes for Kenya Airways. As the market has become more competitive businesses have been finding it necessary to adopt new strategies and tools to remain viable.
In 2012 Dr Andreas Jahnke took over the position as Managing Director of Lufthansa Consulting. New management structures and reorganized responsibilities were established. The company focuses primarily on regional markets in Europe, Russia, CIS, Middle East, Asia, Africa and South America. Solution Groups focuses on operations, commercial, finance and "transformation topics". The new Inter-Branch services is active in non-aviation industries like transport and logistics companies, railways and bus line operators.
Recent projects have included the restructuring of Saudia, the optimization of
pricing and revenue management processes at EgyptAir and network planning for Estonian Air. An expansion plan for Air Astana and a master plan concept for the strategic development for Almaty International Airport were established. More projects have included a pricing and revenue check-up at SriLankan Airlines, the design of a cargo growth strategy for jetBlue and the development of an operations assessment to increase efficiency and productivity at Air Mauritius.
Cooperations
ACI Airports Council International
AFRAA African Airlines Association https://web.archive.org/web/20090815183931/http://www.afraa.org/partner-list.htm
AACO Arab Air Carriers' Organization https://web.archive.org/web/20101224232133/http://www.aaco.org/partners.asp
Corporate affairs
In August 2014 it moved into its new headquarters at the Frankfurt Airport Center (FAC) at Frankfurt Airport, near Terminal 1. Previously it had offices in Cologne and Frankfurt, with Cologne having the headquarters.
References
Lufthansa
Companies based in Frankfurt
Companies based in Cologne |
```yaml
# index page sections
# custom following lines to edit your index page
- id: about-me
i18n: nav.about_me
name: About
tpl: about.html
css:
- id: career
i18n: nav.career
name: Career
tpl: career.html
css: timeline
- id: skills
i18n: nav.skills
name: Skills
tpl: skills.html
css: team
- id: projects
i18n: nav.projects
name: Projects
tpl: projects.html
css: project
- id: blog
i18n: nav.blog
name: Blog
tpl: blog.html
page: blog/
css: testimonials navy-section
- id: links
i18n: nav.link
name: Links
tpl: links.html
css: contact
``` |
Vijaydurg Port is a natural harbour on the west coast of the district of Sindhudurg in Maharashtra, India. The port is situated midway between Malvan and Ratnagiri at the mouth of the Vijaydurg creek in Devgad taluka. Its coastal jurisdiction extends 10 km north up to the Jaitapur lighthouse. Goods weighing about 200 tons are generally loaded or unloaded at the port daily. The cargo brought by sea is transported by creek up to Kharepatan which is 26 miles up from Vijayadurg.
Administration
Vijaydurg Port is one of the operational minor (non-major) ports handling cargo under Maharashtra Maritime Board (MMB). This port is categorized under Vengurla group of ports under Maharashtra Maritime Board. The controlling authority of this port is "Assistant Range Officer".
Commodities
The chief commodities imported in this port are food-stuffs, pulses, salt, oil-cakes, sugar, cement and dry fish. The chief commodities exported from this port are; mangoes, jungle-wood, hemp, bamboos and coconuts.
Food and related products as well as general merchandise are imported from Mumbai, salt from Mora and Karanja, tiles from Mangalore and salted fish from Malvan and Karwar. Mangoes, wood and salted fish are sent to Mumbai.
Trade
The average turn-over of import and export at the port during 1953-58 was about 25,000 tons and about 25,000 passengers travel through the port every year. An old anchor (length 13m, breadth 8m and road circumference 2m), belonging to the Maratha Navy was found lying in water near the port for over hundred years and still in good condition. It was moved to the Maritime Museum, Mumbai, from the port at the request of Captain J. R. Davis, Nautical Adviser to the Government of India, on 5 February 1956.
Ferries
The region surrounding Vijaydurg Port has a good network of rivers and rivulets. There are many interruptions to road traffic due to the absence of bridges over the numerous rivers, rivulets and creeks. Many ferries ply only after monsoon as the swelling waters begin to recede as the month of October advances. The ferries ply between Vijaydurg and Kharepatan which is 40 km towards the eastern side of Waghotan River.
Almost all the ferries are country crafts manned by two or three ferrymen. Small boats called Hodis ply across rivers and rivulets. The sailing vessels plying across creeks are called machwas. A hodi can accommodate four persons, while a machwa can carry up to fifty persons.
The statistics regarding the number of passengers embarked and disembarked at this port for six years (1951 to 1957) are given in the table below:
Konkan Steamer Service
Until 1983, Vijaydurg was a port of call for the Konkan Steamer service, which ran two ships: Konkan Sevak and Konkan Shakti, which were later sent to supply the IPKF (Indian Peace Keeping Forces) in Sri Lanka in the late 1980s on the behest of late Prime Minister of India, Rajiv Gandhi. In the past, a few operators like Damania did launch catamaran services, but they never really took off. The smaller catamarans that replaced them in the mid-nineties were described as "soulless" by many a traveller. 'The sea route on board the catamarans could never be a pleasant experience for the passengers due to the heavy rolling and pitching effects of the sea throughout the entire journey,' states the proposal passed by the state government.
Relaunch of Mumbai-Goa Liner
Twenty-two years after its last voyage the Mumbai-Goa steamer service will set sail once again, with Goa Chief Minister Manohar Parrikar and his Maharashtra counterpart Prithviraj Chauhan keen on relaunching the service.
A proposal to restart the service was made by the Goa Government in the last week of May, and was promptly seconded by the Maharashtra Government. "It has been cleared and the service will be launched in the next three months," Captain of Ports, Goa, James Braganza. The service will be purely an alternative mode of transport between Mumbai and Goa, minus any frills, but comfortable. As earlier, the service is expected to operate between Ferry Wharf (Bhaucha Dhakka) in Mazgaon and Panaji port. En route it will halt at Raigad, Ratnagiri, Jaigad, Vijaydurg, Malvan and Vengurla, where smaller boats will ferry passengers to the shore. There is much scope for a daily steamer services on the route, as trains invariably run full and buses are not preferred by many.
Construction of a new Minor Port
Maharashtra Maritime Board has proposed the construction of a modern and all weather port at Vijaydurg in Sindhudurg District, Maharashtra. The estimated investment in the project is Rs. 5000.0 Million (USD 100.0 million).
Project Description
Maharashtra has a long coastline which could be effectively developed for carrying out inland water transport for goods and passengers. Maharashtra Maritime Board has identified development of a minor port at Vijaydurg in Sindhudurg District. The proposed port will be located at southern portion of Burmana bay near the mouth of Wagothane River. As per a study carried out by Consulting Engineering Services (CES), the traffic projections are in the region of 2.0 mtpa and 2.5 mtpa for the years 2005 and 2010, respectively. The traffic composition will be of general cargo with or without containers.
Project Benefits
To facilitate inland movement of cargo and passengers.
Status of government clearances needed for successful implementation of the project
Location
The site lies in Sindhudurg district at about 60 km from Kokisare Railway station and 55 km from NH-17. Presently, there is one jetty (51m* 6.6 m) with maximum permissible draft of 3.0 m. Bore logs available indicate soft clay for a depth of 3 to 6 m below sea bed at proposed harbour basin and channel, which is underlain by moderate to completely weathered basalt layer and hard rock.
Proposed implementation plan
The project implementation schedule begins with selection of the agency (Licensee) which will under take construction of facilities on "Build, Own, Operate & Transfer" basis. The licensee will have to complete the survey of the project site, carry out detailed soil & other investigations followed by detailed engineering, selection of agencies to construct the port before commencing construction. Considering the variety & volume of work involved in creation of the Port, it is suggested that total works be divided into several packages for execution as indicated below:
Breakwater
Jetties
Dredging
Tugs & navigational Aids
Electrical Facilities
Roads
The construction, repair, maintenance and management of the port will be the sole responsibility
of the developer.
Satellite Port
State-run Jawaharlal Nehru Port Trust (JNPT), India’s busiest container gateway near Mumbai, is planning to build a satellite port at either Vijaydurg or Dahanu in Maharashtra for at least Rs.10,000 crore. JNPT and the Maharashtra government will hold 75% and 25% respectively in the proposed project, according to port chairman N.N. Kumar, in an interview. At both Vijaydurg and Dahanu, there is natural draught of 20 metres to receive bigger ships. A feasibility study for a satellite port has been completed internally. At present, there is only one big port in Maharashtra - JNPT, despite the fact that there is large industrial growth taking place in the state. The project's time frame has not been disclosed.
Gallery
See also
Vijaydurg
Vijaydurg Fort
Rameshwar Wadi
Shri Dev Rameshwar Temple
Rameshwar Dockyard
References
Tourist attractions in Sindhudurg district |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.