text
stringlengths 1
22.8M
|
|---|
```xml
import * as React from 'react';
import createSvgIcon from '../utils/createSvgIcon';
const ExportIcon = createSvgIcon({
svg: ({ classes }) => (
<svg xmlns="path_to_url" viewBox="0 0 2048 2048" className={classes.svg} focusable="false">
<path d="M1497 589l308 309H262v128h1540l-305 305 90 90 461-461-461-461-90 90zM134 512H6v896h128V512z" />
</svg>
),
displayName: 'ExportIcon',
});
export default ExportIcon;
```
|
Choe Chang-ik (, 1896 – 1960) was a Korean politician in the Japanese colonial era. He was a member of the Korean independence movement. He was also known by the names Choe Chang-sok (최창석, 崔昌錫), Choe Chang-sun (최창순, 崔昌淳), Choe Tong-u (최동우, 崔東宇), and Ri Kon-u.
Early life
Choe Chang-ik was born in Onsong County, Korea Empire in 1896. His exact date of birth remains unknown.
In his fifth year of high school he participated in the March 1st Movement, which resulted in his expulsion. That same year he went to Japan to continue his education at the Seisoku English School (today's Seisoku Gakuen High School).
Choe Chang-ik later studied at Tokyo's Waseda University in the Department of Economics and Politics where he organized a student union and continued his activism. This included secretly infiltrating areas in Korea such as Ganggyeong, Jeonju, Okgu, and Gunsan, where he went on a lecture tour to share his ideas on socialism and equality. Choe Chang-ik was arrested by the Japanese police for these activities but was eventually released. He graduated from Waseda University in February 1925.
Timeline
In June 1923, Choe Chang-ik returned to Korea and became a member of the Korean Labor Society. In July of that year he helped found the Korea Communist Youth Alliance and served as a commissioner. By September he was arrested by the police while leading a Korean Labor Conference meeting. In April 1924, Choe took part in the founding of the Joseon Youth Alliance and was elected to the group's central executive committee. Eight months later he helped found the Socialist Alliance (an organization not affiliated with the Seoul Youth Association) and was elected to serve as a member of its executive committee.
Following his graduation Choe traveled to the Communist International World Congress as a representative of the Seoul Youth Association. During his return home he became involved with Kim Chwa-chin's Shinmin group, a rebel community in Shinmin province, Manchuria. Choe eventually worked to create a communist league within the organization.
Choe eventually seceded from Kim's group in October 1925 and returned to Korea. In the same month Japanese officials arrested him for his involvement with the Shinmin group along with Han Bin (한빈, 韓斌), Lee Kyung-ho (이경호, 李京鎬) and Lee Young (이영, 李英). In 1926, Choe and Park Du-hui, a member of the Shinmin group, were selected to attend a communist conference in Vladivostok of Russian far east. While there he joined efforts to start a national party assembly. In 1927, upon returning to Korea, he joined, and became an executive, of the Communist Party of Korea. In February 1928 Choe was imprisoned for the so-called "Third Communist Party of Korea Incident". He escaped from prison in 1935.
In 1936, he sought and gained political asylum in China. There he became a part of the Korean National Revolutionary Party and formed the Chonwi Club (전위동맹) in Hankou. He married his wife, Heo Jong-suk, in 1937. In May 1938, he became the commander of Choson uiyongdae (조선의용대), which was Kim Won-bong's Korean National Revolutionary Party's Military Organisation, but he complained that it was funded by Chiang Kai-shek's Kuomintang. A disagreement followed and he left Kim Won-bong's (김원봉, 金元鳳) organisation. He also went to Yan'an, in partnership with Mu Chong (무정, 武亭) and Kim Tu-bong (김두봉, 金枓奉).
In January 1941, with funding from the Chinese Communist Party, and later with Lee Gunwu, Mu Chong founded the "Hebei Korea Youth Federation" in Jindong. In 1942, with Kim Dubong and Lee Gunwu, Mujung, Han bin was created as a Chosun independent alliance, and he was elected as the vice-chairman of the independent alliance. In September 1945, he was appointed to the Communist Party of Korea's Political Committee, and in December he returned to Pyongyang with Kim Tu-bong and Mu Chong. In March 1946, he founded the New Korean Democratic Party and was elected vice-chairman. In August of that year he was involved in the integration of the New Democratic Party and the Communist Party of Korea to North faction of Workers' Party of Korea. In September the Workers' Party of North Korea's Central Committee, the Standing Committee, elected Choe as commerce and business commissar.
Ambassador Ianov and Choe Chang-ik discussed the visit of the DPRK government delegation to Eastern Europe and the USSR (east bloc), and the policies of the Korean Workers' Party. In 1948 he attended the Workers' Party of North Korea's Central Committee and the deputies of the North Korean Supreme People's Assembly. In September Choe became the first North Korea minister of finance; in 1952 deputy prime minister; in 1954 minister of finance and in 1955 security minister of the DPRK.
See also
Kim Won-bong
Pak Hon-yong
Kim Tu-bong
Ho Jong-suk
August Faction Incident
References
External links
Choe Chang-ik
Choe Chang-ik: Korean historic person information
Choe Chang-ik
1896 births
1957 deaths
People from Onsong County
Finance ministers of North Korea
Korean independence activists
Executed communists
Executed politicians
Executed revolutionaries
Executed North Korean people
Korean revolutionaries
Communist Party of Korea politicians
Korean expatriates in China
Korean expatriates in the Soviet Union
Waseda University alumni
Kim Won-bong
Members of the 1st Central Committee of the Workers' Party of North Korea
Members of the 2nd Central Committee of the Workers' Party of Korea
Members of the 1st Political Committee of the Workers' Party of North Korea
Members of the 1st Standing Committee of the Workers' Party of North Korea
Members of the 2nd Political Committee of the Workers' Party of Korea
Members of the 2nd Standing Committee of the Workers' Party of Korea
Members of the 1st Supreme People's Assembly
People executed by North Korea
Yan'an faction
|
```rust
#![allow(dead_code, non_snake_case, non_camel_case_types, non_upper_case_globals)]
#[repr(C)]
#[derive(Debug, Copy, Clone)]
pub struct foo {
pub member: foo__bindgen_ty_1,
}
pub const foo_FOO_A: foo__bindgen_ty_1 = foo__bindgen_ty_1(0);
pub const foo_FOO_B: foo__bindgen_ty_1 = foo__bindgen_ty_1(1);
impl ::std::ops::BitOr<foo__bindgen_ty_1> for foo__bindgen_ty_1 {
type Output = Self;
#[inline]
fn bitor(self, other: Self) -> Self {
foo__bindgen_ty_1(self.0 | other.0)
}
}
impl ::std::ops::BitOrAssign for foo__bindgen_ty_1 {
#[inline]
fn bitor_assign(&mut self, rhs: foo__bindgen_ty_1) {
self.0 |= rhs.0;
}
}
impl ::std::ops::BitAnd<foo__bindgen_ty_1> for foo__bindgen_ty_1 {
type Output = Self;
#[inline]
fn bitand(self, other: Self) -> Self {
foo__bindgen_ty_1(self.0 & other.0)
}
}
impl ::std::ops::BitAndAssign for foo__bindgen_ty_1 {
#[inline]
fn bitand_assign(&mut self, rhs: foo__bindgen_ty_1) {
self.0 &= rhs.0;
}
}
#[repr(transparent)]
#[derive(Debug, Copy, Clone, Hash, PartialEq, Eq)]
pub struct foo__bindgen_ty_1(pub ::std::os::raw::c_uint);
#[allow(clippy::unnecessary_operation, clippy::identity_op)]
const _: () = {
["Size of foo"][::std::mem::size_of::<foo>() - 4usize];
["Alignment of foo"][::std::mem::align_of::<foo>() - 4usize];
["Offset of field: foo::member"][::std::mem::offset_of!(foo, member) - 0usize];
};
impl Default for foo {
fn default() -> Self {
let mut s = ::std::mem::MaybeUninit::<Self>::uninit();
unsafe {
::std::ptr::write_bytes(s.as_mut_ptr(), 0, 1);
s.assume_init()
}
}
}
impl Foo {
pub const Bar: Foo = Foo(0);
}
impl Foo {
pub const Qux: Foo = Foo(1);
}
impl ::std::ops::BitOr<Foo> for Foo {
type Output = Self;
#[inline]
fn bitor(self, other: Self) -> Self {
Foo(self.0 | other.0)
}
}
impl ::std::ops::BitOrAssign for Foo {
#[inline]
fn bitor_assign(&mut self, rhs: Foo) {
self.0 |= rhs.0;
}
}
impl ::std::ops::BitAnd<Foo> for Foo {
type Output = Self;
#[inline]
fn bitand(self, other: Self) -> Self {
Foo(self.0 & other.0)
}
}
impl ::std::ops::BitAndAssign for Foo {
#[inline]
fn bitand_assign(&mut self, rhs: Foo) {
self.0 &= rhs.0;
}
}
#[repr(transparent)]
#[derive(Debug, Copy, Clone, Hash, PartialEq, Eq)]
pub struct Foo(pub ::std::os::raw::c_uint);
pub mod Neg {
pub type Type = ::std::os::raw::c_int;
pub const MinusOne: Type = -1;
pub const One: Type = 1;
}
impl NoDebug {
pub const NoDebug1: NoDebug = NoDebug(0);
}
impl NoDebug {
pub const NoDebug2: NoDebug = NoDebug(1);
}
impl ::std::ops::BitOr<NoDebug> for NoDebug {
type Output = Self;
#[inline]
fn bitor(self, other: Self) -> Self {
NoDebug(self.0 | other.0)
}
}
impl ::std::ops::BitOrAssign for NoDebug {
#[inline]
fn bitor_assign(&mut self, rhs: NoDebug) {
self.0 |= rhs.0;
}
}
impl ::std::ops::BitAnd<NoDebug> for NoDebug {
type Output = Self;
#[inline]
fn bitand(self, other: Self) -> Self {
NoDebug(self.0 & other.0)
}
}
impl ::std::ops::BitAndAssign for NoDebug {
#[inline]
fn bitand_assign(&mut self, rhs: NoDebug) {
self.0 &= rhs.0;
}
}
#[repr(transparent)]
/// <div rustbindgen nodebug></div>
#[derive(Copy, Clone, Hash, PartialEq, Eq)]
pub struct NoDebug(pub ::std::os::raw::c_uint);
impl Debug {
pub const Debug1: Debug = Debug(0);
}
impl Debug {
pub const Debug2: Debug = Debug(1);
}
impl ::std::ops::BitOr<Debug> for Debug {
type Output = Self;
#[inline]
fn bitor(self, other: Self) -> Self {
Debug(self.0 | other.0)
}
}
impl ::std::ops::BitOrAssign for Debug {
#[inline]
fn bitor_assign(&mut self, rhs: Debug) {
self.0 |= rhs.0;
}
}
impl ::std::ops::BitAnd<Debug> for Debug {
type Output = Self;
#[inline]
fn bitand(self, other: Self) -> Self {
Debug(self.0 & other.0)
}
}
impl ::std::ops::BitAndAssign for Debug {
#[inline]
fn bitand_assign(&mut self, rhs: Debug) {
self.0 &= rhs.0;
}
}
#[repr(transparent)]
/// <div rustbindgen derive="Debug"></div>
#[derive(Debug, Copy, Clone, Hash, PartialEq, Eq)]
pub struct Debug(pub ::std::os::raw::c_uint);
```
|
Oru Yathrayil is a 2013 Indian Malayalam anthology film. The film comprises four shorts namely Honeymoon, I Love My Appa, Marichavarude Kadal and Amma which all are half an hour long each. The four featurettes are directed by Rajesh Amanakkara, Mathews, Priyanandanan and Major Ravi respectively. Major Ravi coordinated the efforts for the film.
Another featurette titled Sarvashiksha Abhiyan directed by Vinod Vijayan was originally announced but was not included in the final print.
Films
Common Cast
Anoop Chandran
Bineesh Kodiyeri
Rajeev Pillai
Jayakrishnan
Pradeep Chandran
Plots
Honeymoon is a take on the life of a newlywed couple in the backdrop of a slum. I Love My Appa is a family drama set in the backdrop of a typical Brahmin colony in Kalpathy in Palakkad. Marichavarude Kadal is about the decline of Gandhian principles in the modern era. It flits between past and present, as the tale of an elderly couple wedded to Gandhism is narrated, in the backdrop of sea. The sea, here is a symbol of the watery end of the great ideals of Mahatma Gandhi. Amma is a tale of an elderly housewife who yearns for love and attention from her husband and grown up children.
References
External links
Oru Yathrayil at the Malayalam Movie Database
Review, Nowrunning.com
2013 films
2010s Malayalam-language films
Indian anthology films
|
The Lyons in Paris (also called The Lyons Abroad and Mr. and Mrs. in Paree) is a 1955 British comedy film directed by Val Guest and starring Ben Lyon, Bebe Daniels and Reginald Beckwith. It was a sequel to the 1954 film Life with the Lyons, and was shot at Southall Studios, though some genuine Paris location shots were used.
Plot
Has Ben Lyon forgotten his wedding anniversary? His wife Bebe thinks he has, and can hardly contain her fury. When his son Richard sees him dining with a glamorous French singer he thinks the worst. But Ben is actually buying tickets from her, and he surprises everyone with a family holiday to Paris. Once in Paris, there are further misunderstandings involving the singer, trouble with an antique car, as well as visits to a seedy nightclub and to the famous Folies Bergère.
Cast
Ben Lyon as Ben
Bebe Daniels as Bebe
Barbara Lyon as Barbara
Richard Lyon as Richard
Reginald Beckwith as Captain le Grand
Horace Percival as Mr. Wimple
Molly Weir as Aggie
Hugh Morton as Colonel Price
Production
Val Guest said "we all went to Paris and did our stint over there; we were not allowed to take any lamps at all. We had to shoot the whole thing without lamps, night as well. We’d get every car we had in the unit and turn the headlights on, and that was our lighting."
Critical reception
David McGillivray wrote in the Radio Times, "director Val Guest maintains a brisk pace, and the Lyons are really rather endearing."
References
External links
1955 films
1955 comedy films
British comedy films
1950s English-language films
Films directed by Val Guest
Films based on radio series
Films shot at Southall Studios
Films set in Paris
British sequel films
Hammer Film Productions films
1950s British films
British black-and-white films
English-language comedy films
|
USS Sunnadin may refer to the following ships of the United States Navy:
a serving from 1919 to 1946
a serving from 1945 to 1969
United States Navy ship names
|
```objective-c
/* Variables that describe the inferior process running under GDB:
Where it is, why it stopped, and how to step it.
1996, 1998, 1999, 2000, 2001, 2003 Free Software Foundation, Inc.
This file is part of GDB.
This program is free software; you can redistribute it and/or modify
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330,
Boston, MA 02111-1307, USA. */
#if !defined (INFERIOR_H)
#define INFERIOR_H 1
struct target_waitstatus;
struct frame_info;
struct ui_file;
struct type;
struct gdbarch;
struct regcache;
/* For bpstat. */
#include "breakpoint.h"
/* For enum target_signal. */
#include "target.h"
/* For struct frame_id. */
#include "frame.h"
/* Structure in which to save the status of the inferior. Create/Save
through "save_inferior_status", restore through
"restore_inferior_status".
This pair of routines should be called around any transfer of
control to the inferior which you don't want showing up in your
control variables. */
struct inferior_status;
extern struct inferior_status *save_inferior_status (int);
extern void restore_inferior_status (struct inferior_status *);
extern struct cleanup *make_cleanup_restore_inferior_status (struct inferior_status *);
extern void discard_inferior_status (struct inferior_status *);
extern void write_inferior_status_register (struct inferior_status
*inf_status, int regno,
LONGEST val);
/* The -1 ptid, often used to indicate either an error condition
or a "don't care" condition, i.e, "run all threads." */
extern ptid_t minus_one_ptid;
/* The null or zero ptid, often used to indicate no process. */
extern ptid_t null_ptid;
/* Attempt to find and return an existing ptid with the given PID, LWP,
and TID components. If none exists, create a new one and return
that. */
ptid_t ptid_build (int pid, long lwp, long tid);
/* Find/Create a ptid from just a pid. */
ptid_t pid_to_ptid (int pid);
/* Fetch the pid (process id) component from a ptid. */
int ptid_get_pid (ptid_t ptid);
/* Fetch the lwp (lightweight process) component from a ptid. */
long ptid_get_lwp (ptid_t ptid);
/* Fetch the tid (thread id) component from a ptid. */
long ptid_get_tid (ptid_t ptid);
/* Compare two ptids to see if they are equal */
extern int ptid_equal (ptid_t p1, ptid_t p2);
/* Save value of inferior_ptid so that it may be restored by
a later call to do_cleanups(). Returns the struct cleanup
pointer needed for later doing the cleanup. */
extern struct cleanup * save_inferior_ptid (void);
extern void set_sigint_trap (void);
extern void clear_sigint_trap (void);
extern void set_sigio_trap (void);
extern void clear_sigio_trap (void);
/* File name for default use for standard in/out in the inferior. */
extern char *inferior_io_terminal;
/* Collected pid, tid, etc. of the debugged inferior. When there's
no inferior, PIDGET (inferior_ptid) will be 0. */
extern ptid_t inferior_ptid;
/* Is the inferior running right now, as a result of a 'run&',
'continue&' etc command? This is used in asycn gdb to determine
whether a command that the user enters while the target is running
is allowed or not. */
extern int target_executing;
/* Are we simulating synchronous execution? This is used in async gdb
to implement the 'run', 'continue' etc commands, which will not
redisplay the prompt until the execution is actually over. */
extern int sync_execution;
/* This is only valid when inferior_ptid is non-zero.
If this is 0, then exec events should be noticed and responded to
by the debugger (i.e., be reported to the user).
If this is > 0, then that many subsequent exec events should be
ignored (i.e., not be reported to the user).
*/
extern int inferior_ignoring_startup_exec_events;
/* This is only valid when inferior_ignoring_startup_exec_events is
zero.
Some targets (stupidly) report more than one exec event per actual
call to an event() system call. If only the last such exec event
need actually be noticed and responded to by the debugger (i.e.,
be reported to the user), then this is the number of "leading"
exec events which should be ignored.
*/
extern int inferior_ignoring_leading_exec_events;
/* Inferior environment. */
extern struct environ *inferior_environ;
extern void clear_proceed_status (void);
extern void proceed (CORE_ADDR, enum target_signal, int);
/* When set, stop the 'step' command if we enter a function which has
no line number information. The normal behavior is that we step
over such function. */
extern int step_stop_if_no_debug;
extern void kill_inferior (void);
extern void generic_mourn_inferior (void);
extern void terminal_save_ours (void);
extern void terminal_ours (void);
extern CORE_ADDR read_pc (void);
extern CORE_ADDR read_pc_pid (ptid_t);
extern void write_pc (CORE_ADDR);
extern void write_pc_pid (CORE_ADDR, ptid_t);
extern void generic_target_write_pc (CORE_ADDR, ptid_t);
extern CORE_ADDR read_sp (void);
extern CORE_ADDR unsigned_pointer_to_address (struct type *type, const void *buf);
extern void unsigned_address_to_pointer (struct type *type, void *buf,
CORE_ADDR addr);
extern CORE_ADDR signed_pointer_to_address (struct type *type,
const void *buf);
extern void address_to_signed_pointer (struct type *type, void *buf,
CORE_ADDR addr);
extern void wait_for_inferior (void);
extern void fetch_inferior_event (void *);
extern void init_wait_for_inferior (void);
extern void close_exec_file (void);
extern void reopen_exec_file (void);
/* The `resume' routine should only be called in special circumstances.
Normally, use `proceed', which handles a lot of bookkeeping. */
extern void resume (int, enum target_signal);
/* From misc files */
extern void default_print_registers_info (struct gdbarch *gdbarch,
struct ui_file *file,
struct frame_info *frame,
int regnum, int all);
extern void store_inferior_registers (int);
extern void fetch_inferior_registers (int);
extern void solib_create_inferior_hook (void);
extern void child_terminal_info (char *, int);
extern void term_info (char *, int);
extern void terminal_ours_for_output (void);
extern void terminal_inferior (void);
extern void terminal_init_inferior (void);
extern void terminal_init_inferior_with_pgrp (int pgrp);
/* From infptrace.c or infttrace.c */
extern int attach (int);
extern void detach (int);
/* PTRACE method of waiting for inferior process. */
int ptrace_wait (ptid_t, int *);
extern void child_resume (ptid_t, int, enum target_signal);
#ifndef PTRACE_ARG3_TYPE
#define PTRACE_ARG3_TYPE PTRACE_TYPE_ARG3
#endif
extern int call_ptrace (int, int, PTRACE_ARG3_TYPE, int);
extern void pre_fork_inferior (void);
/* From procfs.c */
extern int proc_iterate_over_mappings (int (*)(int, CORE_ADDR));
extern ptid_t procfs_first_available (void);
/* From fork-child.c */
extern void fork_inferior (char *, char *, char **,
void (*)(void),
void (*)(int), void (*)(void), char *);
extern void startup_inferior (int);
extern char *construct_inferior_arguments (struct gdbarch *, int, char **);
/* From inflow.c */
extern void new_tty_prefork (char *);
extern int gdb_has_a_terminal (void);
/* From infrun.c */
extern void start_remote (void);
extern void normal_stop (void);
extern int signal_stop_state (int);
extern int signal_print_state (int);
extern int signal_pass_state (int);
extern int signal_stop_update (int, int);
extern int signal_print_update (int, int);
extern int signal_pass_update (int, int);
extern void get_last_target_status(ptid_t *ptid,
struct target_waitstatus *status);
extern void follow_inferior_reset_breakpoints (void);
/* From infcmd.c */
extern void tty_command (char *, int);
extern void attach_command (char *, int);
extern char *get_inferior_args (void);
extern char *set_inferior_args (char *);
extern void set_inferior_args_vector (int, char **);
extern void registers_info (char *, int);
extern void nexti_command (char *, int);
extern void stepi_command (char *, int);
extern void continue_command (char *, int);
extern void interrupt_target_command (char *args, int from_tty);
/* Last signal that the inferior received (why it stopped). */
extern enum target_signal stop_signal;
/* Address at which inferior stopped. */
extern CORE_ADDR stop_pc;
/* Chain containing status of breakpoint(s) that we have stopped at. */
extern bpstat stop_bpstat;
/* Flag indicating that a command has proceeded the inferior past the
current breakpoint. */
extern int breakpoint_proceeded;
/* Nonzero if stopped due to a step command. */
extern int stop_step;
/* Nonzero if stopped due to completion of a stack dummy routine. */
extern int stop_stack_dummy;
/* Nonzero if program stopped due to a random (unexpected) signal in
inferior process. */
extern int stopped_by_random_signal;
/* Range to single step within.
If this is nonzero, respond to a single-step signal
by continuing to step if the pc is in this range.
If step_range_start and step_range_end are both 1, it means to step for
a single instruction (FIXME: it might clean up wait_for_inferior in a
minor way if this were changed to the address of the instruction and
that address plus one. But maybe not.). */
extern CORE_ADDR step_range_start; /* Inclusive */
extern CORE_ADDR step_range_end; /* Exclusive */
/* Stack frame address as of when stepping command was issued.
This is how we know when we step into a subroutine call,
and how to set the frame for the breakpoint used to step out. */
extern struct frame_id step_frame_id;
/* 1 means step over all subroutine calls.
-1 means step over calls to undebuggable functions. */
enum step_over_calls_kind
{
STEP_OVER_NONE,
STEP_OVER_ALL,
STEP_OVER_UNDEBUGGABLE
};
extern enum step_over_calls_kind step_over_calls;
/* If stepping, nonzero means step count is > 1
so don't print frame next time inferior stops
if it stops due to stepping. */
extern int step_multi;
/* Nonzero means expecting a trap and caller will handle it
themselves. It is used when running in the shell before the child
program has been exec'd; and when running some kinds of remote
stuff (FIXME?). */
/* It is also used after attach, due to attaching to a process. This
is a bit trickier. When doing an attach, the kernel stops the
debuggee with a SIGSTOP. On newer GNU/Linux kernels (>= 2.5.61)
the handling of SIGSTOP for a ptraced process has changed. Earlier
versions of the kernel would ignore these SIGSTOPs, while now
SIGSTOP is treated like any other signal, i.e. it is not muffled.
If the gdb user does a 'continue' after the 'attach', gdb passes
the global variable stop_signal (which stores the signal from the
attach, SIGSTOP) to the ptrace(PTRACE_CONT,...) call. This is
problematic, because the kernel doesn't ignore such SIGSTOP
now. I.e. it is reported back to gdb, which in turn presents it
back to the user.
To avoid the problem, we use STOP_QUIETLY_NO_SIGSTOP, which allows
gdb to clear the value of stop_signal after the attach, so that it
is not passed back down to the kernel. */
enum stop_kind
{
NO_STOP_QUIETLY = 0,
STOP_QUIETLY,
STOP_QUIETLY_NO_SIGSTOP
};
extern enum stop_kind stop_soon;
/* Nonzero if proceed is being used for a "finish" command or a similar
situation when stop_registers should be saved. */
extern int proceed_to_finish;
/* Save register contents here when about to pop a stack dummy frame,
if-and-only-if proceed_to_finish is set.
Thus this contains the return value from the called function (assuming
values are returned in a register). */
extern struct regcache *stop_registers;
/* Nonzero if the child process in inferior_ptid was attached rather
than forked. */
extern int attach_flag;
/* Possible values for CALL_DUMMY_LOCATION. */
#define ON_STACK 1
#define AT_ENTRY_POINT 4
#define AT_SYMBOL 5
/* If STARTUP_WITH_SHELL is set, GDB's "run"
will attempts to start up the debugee under a shell.
This is in order for argument-expansion to occur. E.g.,
(gdb) run *
The "*" gets expanded by the shell into a list of files.
While this is a nice feature, it turns out to interact badly
with some of the catch-fork/catch-exec features we have added.
In particular, if the shell does any fork/exec's before
the exec of the target program, that can confuse GDB.
To disable this feature, set STARTUP_WITH_SHELL to 0.
To enable this feature, set STARTUP_WITH_SHELL to 1.
The catch-exec traps expected during start-up will
be 1 if target is not started up with a shell, 2 if it is.
- RT
If you disable this, you need to decrement
START_INFERIOR_TRAPS_EXPECTED in tm.h. */
#define STARTUP_WITH_SHELL 1
#if !defined(START_INFERIOR_TRAPS_EXPECTED)
#define START_INFERIOR_TRAPS_EXPECTED 2
#endif
#endif /* !defined (INFERIOR_H) */
```
|
```go
// Code generated by protoc-gen-gogo. DO NOT EDIT.
// source: typedeclall.proto
/*
Package typedeclall is a generated protocol buffer package.
It is generated from these files:
typedeclall.proto
It has these top-level messages:
Dropped
DroppedWithoutGetters
Kept
*/
package typedeclall
import testing "testing"
import math_rand "math/rand"
import time "time"
import github_com_gogo_protobuf_proto "github.com/gogo/protobuf/proto"
import github_com_gogo_protobuf_jsonpb "github.com/gogo/protobuf/jsonpb"
import proto "github.com/gogo/protobuf/proto"
import fmt "fmt"
import math "math"
import _ "github.com/gogo/protobuf/gogoproto"
// Reference imports to suppress errors if they are not otherwise used.
var _ = proto.Marshal
var _ = fmt.Errorf
var _ = math.Inf
func TestDroppedProto(t *testing.T) {
seed := time.Now().UnixNano()
popr := math_rand.New(math_rand.NewSource(seed))
p := NewPopulatedDropped(popr, false)
dAtA, err := github_com_gogo_protobuf_proto.Marshal(p)
if err != nil {
t.Fatalf("seed = %d, err = %v", seed, err)
}
msg := &Dropped{}
if err := github_com_gogo_protobuf_proto.Unmarshal(dAtA, msg); err != nil {
t.Fatalf("seed = %d, err = %v", seed, err)
}
littlefuzz := make([]byte, len(dAtA))
copy(littlefuzz, dAtA)
for i := range dAtA {
dAtA[i] = byte(popr.Intn(256))
}
if err := p.VerboseEqual(msg); err != nil {
t.Fatalf("seed = %d, %#v !VerboseProto %#v, since %v", seed, msg, p, err)
}
if !p.Equal(msg) {
t.Fatalf("seed = %d, %#v !Proto %#v", seed, msg, p)
}
if len(littlefuzz) > 0 {
fuzzamount := 100
for i := 0; i < fuzzamount; i++ {
littlefuzz[popr.Intn(len(littlefuzz))] = byte(popr.Intn(256))
littlefuzz = append(littlefuzz, byte(popr.Intn(256)))
}
// shouldn't panic
_ = github_com_gogo_protobuf_proto.Unmarshal(littlefuzz, msg)
}
}
func TestDroppedMarshalTo(t *testing.T) {
seed := time.Now().UnixNano()
popr := math_rand.New(math_rand.NewSource(seed))
p := NewPopulatedDropped(popr, false)
size := p.Size()
dAtA := make([]byte, size)
for i := range dAtA {
dAtA[i] = byte(popr.Intn(256))
}
_, err := p.MarshalTo(dAtA)
if err != nil {
t.Fatalf("seed = %d, err = %v", seed, err)
}
msg := &Dropped{}
if err := github_com_gogo_protobuf_proto.Unmarshal(dAtA, msg); err != nil {
t.Fatalf("seed = %d, err = %v", seed, err)
}
for i := range dAtA {
dAtA[i] = byte(popr.Intn(256))
}
if err := p.VerboseEqual(msg); err != nil {
t.Fatalf("seed = %d, %#v !VerboseProto %#v, since %v", seed, msg, p, err)
}
if !p.Equal(msg) {
t.Fatalf("seed = %d, %#v !Proto %#v", seed, msg, p)
}
}
func BenchmarkDroppedProtoMarshal(b *testing.B) {
popr := math_rand.New(math_rand.NewSource(616))
total := 0
pops := make([]*Dropped, 10000)
for i := 0; i < 10000; i++ {
pops[i] = NewPopulatedDropped(popr, false)
}
b.ResetTimer()
for i := 0; i < b.N; i++ {
dAtA, err := github_com_gogo_protobuf_proto.Marshal(pops[i%10000])
if err != nil {
panic(err)
}
total += len(dAtA)
}
b.SetBytes(int64(total / b.N))
}
func BenchmarkDroppedProtoUnmarshal(b *testing.B) {
popr := math_rand.New(math_rand.NewSource(616))
total := 0
datas := make([][]byte, 10000)
for i := 0; i < 10000; i++ {
dAtA, err := github_com_gogo_protobuf_proto.Marshal(NewPopulatedDropped(popr, false))
if err != nil {
panic(err)
}
datas[i] = dAtA
}
msg := &Dropped{}
b.ResetTimer()
for i := 0; i < b.N; i++ {
total += len(datas[i%10000])
if err := github_com_gogo_protobuf_proto.Unmarshal(datas[i%10000], msg); err != nil {
panic(err)
}
}
b.SetBytes(int64(total / b.N))
}
func TestDroppedWithoutGettersProto(t *testing.T) {
seed := time.Now().UnixNano()
popr := math_rand.New(math_rand.NewSource(seed))
p := NewPopulatedDroppedWithoutGetters(popr, false)
dAtA, err := github_com_gogo_protobuf_proto.Marshal(p)
if err != nil {
t.Fatalf("seed = %d, err = %v", seed, err)
}
msg := &DroppedWithoutGetters{}
if err := github_com_gogo_protobuf_proto.Unmarshal(dAtA, msg); err != nil {
t.Fatalf("seed = %d, err = %v", seed, err)
}
littlefuzz := make([]byte, len(dAtA))
copy(littlefuzz, dAtA)
for i := range dAtA {
dAtA[i] = byte(popr.Intn(256))
}
if err := p.VerboseEqual(msg); err != nil {
t.Fatalf("seed = %d, %#v !VerboseProto %#v, since %v", seed, msg, p, err)
}
if !p.Equal(msg) {
t.Fatalf("seed = %d, %#v !Proto %#v", seed, msg, p)
}
if len(littlefuzz) > 0 {
fuzzamount := 100
for i := 0; i < fuzzamount; i++ {
littlefuzz[popr.Intn(len(littlefuzz))] = byte(popr.Intn(256))
littlefuzz = append(littlefuzz, byte(popr.Intn(256)))
}
// shouldn't panic
_ = github_com_gogo_protobuf_proto.Unmarshal(littlefuzz, msg)
}
}
func TestDroppedWithoutGettersMarshalTo(t *testing.T) {
seed := time.Now().UnixNano()
popr := math_rand.New(math_rand.NewSource(seed))
p := NewPopulatedDroppedWithoutGetters(popr, false)
size := p.Size()
dAtA := make([]byte, size)
for i := range dAtA {
dAtA[i] = byte(popr.Intn(256))
}
_, err := p.MarshalTo(dAtA)
if err != nil {
t.Fatalf("seed = %d, err = %v", seed, err)
}
msg := &DroppedWithoutGetters{}
if err := github_com_gogo_protobuf_proto.Unmarshal(dAtA, msg); err != nil {
t.Fatalf("seed = %d, err = %v", seed, err)
}
for i := range dAtA {
dAtA[i] = byte(popr.Intn(256))
}
if err := p.VerboseEqual(msg); err != nil {
t.Fatalf("seed = %d, %#v !VerboseProto %#v, since %v", seed, msg, p, err)
}
if !p.Equal(msg) {
t.Fatalf("seed = %d, %#v !Proto %#v", seed, msg, p)
}
}
func BenchmarkDroppedWithoutGettersProtoMarshal(b *testing.B) {
popr := math_rand.New(math_rand.NewSource(616))
total := 0
pops := make([]*DroppedWithoutGetters, 10000)
for i := 0; i < 10000; i++ {
pops[i] = NewPopulatedDroppedWithoutGetters(popr, false)
}
b.ResetTimer()
for i := 0; i < b.N; i++ {
dAtA, err := github_com_gogo_protobuf_proto.Marshal(pops[i%10000])
if err != nil {
panic(err)
}
total += len(dAtA)
}
b.SetBytes(int64(total / b.N))
}
func BenchmarkDroppedWithoutGettersProtoUnmarshal(b *testing.B) {
popr := math_rand.New(math_rand.NewSource(616))
total := 0
datas := make([][]byte, 10000)
for i := 0; i < 10000; i++ {
dAtA, err := github_com_gogo_protobuf_proto.Marshal(NewPopulatedDroppedWithoutGetters(popr, false))
if err != nil {
panic(err)
}
datas[i] = dAtA
}
msg := &DroppedWithoutGetters{}
b.ResetTimer()
for i := 0; i < b.N; i++ {
total += len(datas[i%10000])
if err := github_com_gogo_protobuf_proto.Unmarshal(datas[i%10000], msg); err != nil {
panic(err)
}
}
b.SetBytes(int64(total / b.N))
}
func TestKeptProto(t *testing.T) {
seed := time.Now().UnixNano()
popr := math_rand.New(math_rand.NewSource(seed))
p := NewPopulatedKept(popr, false)
dAtA, err := github_com_gogo_protobuf_proto.Marshal(p)
if err != nil {
t.Fatalf("seed = %d, err = %v", seed, err)
}
msg := &Kept{}
if err := github_com_gogo_protobuf_proto.Unmarshal(dAtA, msg); err != nil {
t.Fatalf("seed = %d, err = %v", seed, err)
}
littlefuzz := make([]byte, len(dAtA))
copy(littlefuzz, dAtA)
for i := range dAtA {
dAtA[i] = byte(popr.Intn(256))
}
if err := p.VerboseEqual(msg); err != nil {
t.Fatalf("seed = %d, %#v !VerboseProto %#v, since %v", seed, msg, p, err)
}
if !p.Equal(msg) {
t.Fatalf("seed = %d, %#v !Proto %#v", seed, msg, p)
}
if len(littlefuzz) > 0 {
fuzzamount := 100
for i := 0; i < fuzzamount; i++ {
littlefuzz[popr.Intn(len(littlefuzz))] = byte(popr.Intn(256))
littlefuzz = append(littlefuzz, byte(popr.Intn(256)))
}
// shouldn't panic
_ = github_com_gogo_protobuf_proto.Unmarshal(littlefuzz, msg)
}
}
func TestKeptMarshalTo(t *testing.T) {
seed := time.Now().UnixNano()
popr := math_rand.New(math_rand.NewSource(seed))
p := NewPopulatedKept(popr, false)
size := p.Size()
dAtA := make([]byte, size)
for i := range dAtA {
dAtA[i] = byte(popr.Intn(256))
}
_, err := p.MarshalTo(dAtA)
if err != nil {
t.Fatalf("seed = %d, err = %v", seed, err)
}
msg := &Kept{}
if err := github_com_gogo_protobuf_proto.Unmarshal(dAtA, msg); err != nil {
t.Fatalf("seed = %d, err = %v", seed, err)
}
for i := range dAtA {
dAtA[i] = byte(popr.Intn(256))
}
if err := p.VerboseEqual(msg); err != nil {
t.Fatalf("seed = %d, %#v !VerboseProto %#v, since %v", seed, msg, p, err)
}
if !p.Equal(msg) {
t.Fatalf("seed = %d, %#v !Proto %#v", seed, msg, p)
}
}
func BenchmarkKeptProtoMarshal(b *testing.B) {
popr := math_rand.New(math_rand.NewSource(616))
total := 0
pops := make([]*Kept, 10000)
for i := 0; i < 10000; i++ {
pops[i] = NewPopulatedKept(popr, false)
}
b.ResetTimer()
for i := 0; i < b.N; i++ {
dAtA, err := github_com_gogo_protobuf_proto.Marshal(pops[i%10000])
if err != nil {
panic(err)
}
total += len(dAtA)
}
b.SetBytes(int64(total / b.N))
}
func BenchmarkKeptProtoUnmarshal(b *testing.B) {
popr := math_rand.New(math_rand.NewSource(616))
total := 0
datas := make([][]byte, 10000)
for i := 0; i < 10000; i++ {
dAtA, err := github_com_gogo_protobuf_proto.Marshal(NewPopulatedKept(popr, false))
if err != nil {
panic(err)
}
datas[i] = dAtA
}
msg := &Kept{}
b.ResetTimer()
for i := 0; i < b.N; i++ {
total += len(datas[i%10000])
if err := github_com_gogo_protobuf_proto.Unmarshal(datas[i%10000], msg); err != nil {
panic(err)
}
}
b.SetBytes(int64(total / b.N))
}
func TestDroppedJSON(t *testing.T) {
seed := time.Now().UnixNano()
popr := math_rand.New(math_rand.NewSource(seed))
p := NewPopulatedDropped(popr, true)
marshaler := github_com_gogo_protobuf_jsonpb.Marshaler{}
jsondata, err := marshaler.MarshalToString(p)
if err != nil {
t.Fatalf("seed = %d, err = %v", seed, err)
}
msg := &Dropped{}
err = github_com_gogo_protobuf_jsonpb.UnmarshalString(jsondata, msg)
if err != nil {
t.Fatalf("seed = %d, err = %v", seed, err)
}
if err := p.VerboseEqual(msg); err != nil {
t.Fatalf("seed = %d, %#v !VerboseProto %#v, since %v", seed, msg, p, err)
}
if !p.Equal(msg) {
t.Fatalf("seed = %d, %#v !Json Equal %#v", seed, msg, p)
}
}
func TestDroppedWithoutGettersJSON(t *testing.T) {
seed := time.Now().UnixNano()
popr := math_rand.New(math_rand.NewSource(seed))
p := NewPopulatedDroppedWithoutGetters(popr, true)
marshaler := github_com_gogo_protobuf_jsonpb.Marshaler{}
jsondata, err := marshaler.MarshalToString(p)
if err != nil {
t.Fatalf("seed = %d, err = %v", seed, err)
}
msg := &DroppedWithoutGetters{}
err = github_com_gogo_protobuf_jsonpb.UnmarshalString(jsondata, msg)
if err != nil {
t.Fatalf("seed = %d, err = %v", seed, err)
}
if err := p.VerboseEqual(msg); err != nil {
t.Fatalf("seed = %d, %#v !VerboseProto %#v, since %v", seed, msg, p, err)
}
if !p.Equal(msg) {
t.Fatalf("seed = %d, %#v !Json Equal %#v", seed, msg, p)
}
}
func TestKeptJSON(t *testing.T) {
seed := time.Now().UnixNano()
popr := math_rand.New(math_rand.NewSource(seed))
p := NewPopulatedKept(popr, true)
marshaler := github_com_gogo_protobuf_jsonpb.Marshaler{}
jsondata, err := marshaler.MarshalToString(p)
if err != nil {
t.Fatalf("seed = %d, err = %v", seed, err)
}
msg := &Kept{}
err = github_com_gogo_protobuf_jsonpb.UnmarshalString(jsondata, msg)
if err != nil {
t.Fatalf("seed = %d, err = %v", seed, err)
}
if err := p.VerboseEqual(msg); err != nil {
t.Fatalf("seed = %d, %#v !VerboseProto %#v, since %v", seed, msg, p, err)
}
if !p.Equal(msg) {
t.Fatalf("seed = %d, %#v !Json Equal %#v", seed, msg, p)
}
}
func TestDroppedProtoText(t *testing.T) {
seed := time.Now().UnixNano()
popr := math_rand.New(math_rand.NewSource(seed))
p := NewPopulatedDropped(popr, true)
dAtA := github_com_gogo_protobuf_proto.MarshalTextString(p)
msg := &Dropped{}
if err := github_com_gogo_protobuf_proto.UnmarshalText(dAtA, msg); err != nil {
t.Fatalf("seed = %d, err = %v", seed, err)
}
if err := p.VerboseEqual(msg); err != nil {
t.Fatalf("seed = %d, %#v !VerboseProto %#v, since %v", seed, msg, p, err)
}
if !p.Equal(msg) {
t.Fatalf("seed = %d, %#v !Proto %#v", seed, msg, p)
}
}
func TestDroppedProtoCompactText(t *testing.T) {
seed := time.Now().UnixNano()
popr := math_rand.New(math_rand.NewSource(seed))
p := NewPopulatedDropped(popr, true)
dAtA := github_com_gogo_protobuf_proto.CompactTextString(p)
msg := &Dropped{}
if err := github_com_gogo_protobuf_proto.UnmarshalText(dAtA, msg); err != nil {
t.Fatalf("seed = %d, err = %v", seed, err)
}
if err := p.VerboseEqual(msg); err != nil {
t.Fatalf("seed = %d, %#v !VerboseProto %#v, since %v", seed, msg, p, err)
}
if !p.Equal(msg) {
t.Fatalf("seed = %d, %#v !Proto %#v", seed, msg, p)
}
}
func TestDroppedWithoutGettersProtoText(t *testing.T) {
seed := time.Now().UnixNano()
popr := math_rand.New(math_rand.NewSource(seed))
p := NewPopulatedDroppedWithoutGetters(popr, true)
dAtA := github_com_gogo_protobuf_proto.MarshalTextString(p)
msg := &DroppedWithoutGetters{}
if err := github_com_gogo_protobuf_proto.UnmarshalText(dAtA, msg); err != nil {
t.Fatalf("seed = %d, err = %v", seed, err)
}
if err := p.VerboseEqual(msg); err != nil {
t.Fatalf("seed = %d, %#v !VerboseProto %#v, since %v", seed, msg, p, err)
}
if !p.Equal(msg) {
t.Fatalf("seed = %d, %#v !Proto %#v", seed, msg, p)
}
}
func TestDroppedWithoutGettersProtoCompactText(t *testing.T) {
seed := time.Now().UnixNano()
popr := math_rand.New(math_rand.NewSource(seed))
p := NewPopulatedDroppedWithoutGetters(popr, true)
dAtA := github_com_gogo_protobuf_proto.CompactTextString(p)
msg := &DroppedWithoutGetters{}
if err := github_com_gogo_protobuf_proto.UnmarshalText(dAtA, msg); err != nil {
t.Fatalf("seed = %d, err = %v", seed, err)
}
if err := p.VerboseEqual(msg); err != nil {
t.Fatalf("seed = %d, %#v !VerboseProto %#v, since %v", seed, msg, p, err)
}
if !p.Equal(msg) {
t.Fatalf("seed = %d, %#v !Proto %#v", seed, msg, p)
}
}
func TestKeptProtoText(t *testing.T) {
seed := time.Now().UnixNano()
popr := math_rand.New(math_rand.NewSource(seed))
p := NewPopulatedKept(popr, true)
dAtA := github_com_gogo_protobuf_proto.MarshalTextString(p)
msg := &Kept{}
if err := github_com_gogo_protobuf_proto.UnmarshalText(dAtA, msg); err != nil {
t.Fatalf("seed = %d, err = %v", seed, err)
}
if err := p.VerboseEqual(msg); err != nil {
t.Fatalf("seed = %d, %#v !VerboseProto %#v, since %v", seed, msg, p, err)
}
if !p.Equal(msg) {
t.Fatalf("seed = %d, %#v !Proto %#v", seed, msg, p)
}
}
func TestKeptProtoCompactText(t *testing.T) {
seed := time.Now().UnixNano()
popr := math_rand.New(math_rand.NewSource(seed))
p := NewPopulatedKept(popr, true)
dAtA := github_com_gogo_protobuf_proto.CompactTextString(p)
msg := &Kept{}
if err := github_com_gogo_protobuf_proto.UnmarshalText(dAtA, msg); err != nil {
t.Fatalf("seed = %d, err = %v", seed, err)
}
if err := p.VerboseEqual(msg); err != nil {
t.Fatalf("seed = %d, %#v !VerboseProto %#v, since %v", seed, msg, p, err)
}
if !p.Equal(msg) {
t.Fatalf("seed = %d, %#v !Proto %#v", seed, msg, p)
}
}
func TestDroppedVerboseEqual(t *testing.T) {
popr := math_rand.New(math_rand.NewSource(time.Now().UnixNano()))
p := NewPopulatedDropped(popr, false)
dAtA, err := github_com_gogo_protobuf_proto.Marshal(p)
if err != nil {
panic(err)
}
msg := &Dropped{}
if err := github_com_gogo_protobuf_proto.Unmarshal(dAtA, msg); err != nil {
panic(err)
}
if err := p.VerboseEqual(msg); err != nil {
t.Fatalf("%#v !VerboseEqual %#v, since %v", msg, p, err)
}
}
func TestDroppedWithoutGettersVerboseEqual(t *testing.T) {
popr := math_rand.New(math_rand.NewSource(time.Now().UnixNano()))
p := NewPopulatedDroppedWithoutGetters(popr, false)
dAtA, err := github_com_gogo_protobuf_proto.Marshal(p)
if err != nil {
panic(err)
}
msg := &DroppedWithoutGetters{}
if err := github_com_gogo_protobuf_proto.Unmarshal(dAtA, msg); err != nil {
panic(err)
}
if err := p.VerboseEqual(msg); err != nil {
t.Fatalf("%#v !VerboseEqual %#v, since %v", msg, p, err)
}
}
func TestKeptVerboseEqual(t *testing.T) {
popr := math_rand.New(math_rand.NewSource(time.Now().UnixNano()))
p := NewPopulatedKept(popr, false)
dAtA, err := github_com_gogo_protobuf_proto.Marshal(p)
if err != nil {
panic(err)
}
msg := &Kept{}
if err := github_com_gogo_protobuf_proto.Unmarshal(dAtA, msg); err != nil {
panic(err)
}
if err := p.VerboseEqual(msg); err != nil {
t.Fatalf("%#v !VerboseEqual %#v, since %v", msg, p, err)
}
}
func TestDroppedSize(t *testing.T) {
seed := time.Now().UnixNano()
popr := math_rand.New(math_rand.NewSource(seed))
p := NewPopulatedDropped(popr, true)
size2 := github_com_gogo_protobuf_proto.Size(p)
dAtA, err := github_com_gogo_protobuf_proto.Marshal(p)
if err != nil {
t.Fatalf("seed = %d, err = %v", seed, err)
}
size := p.Size()
if len(dAtA) != size {
t.Errorf("seed = %d, size %v != marshalled size %v", seed, size, len(dAtA))
}
if size2 != size {
t.Errorf("seed = %d, size %v != before marshal proto.Size %v", seed, size, size2)
}
size3 := github_com_gogo_protobuf_proto.Size(p)
if size3 != size {
t.Errorf("seed = %d, size %v != after marshal proto.Size %v", seed, size, size3)
}
}
func BenchmarkDroppedSize(b *testing.B) {
popr := math_rand.New(math_rand.NewSource(616))
total := 0
pops := make([]*Dropped, 1000)
for i := 0; i < 1000; i++ {
pops[i] = NewPopulatedDropped(popr, false)
}
b.ResetTimer()
for i := 0; i < b.N; i++ {
total += pops[i%1000].Size()
}
b.SetBytes(int64(total / b.N))
}
func TestDroppedWithoutGettersSize(t *testing.T) {
seed := time.Now().UnixNano()
popr := math_rand.New(math_rand.NewSource(seed))
p := NewPopulatedDroppedWithoutGetters(popr, true)
size2 := github_com_gogo_protobuf_proto.Size(p)
dAtA, err := github_com_gogo_protobuf_proto.Marshal(p)
if err != nil {
t.Fatalf("seed = %d, err = %v", seed, err)
}
size := p.Size()
if len(dAtA) != size {
t.Errorf("seed = %d, size %v != marshalled size %v", seed, size, len(dAtA))
}
if size2 != size {
t.Errorf("seed = %d, size %v != before marshal proto.Size %v", seed, size, size2)
}
size3 := github_com_gogo_protobuf_proto.Size(p)
if size3 != size {
t.Errorf("seed = %d, size %v != after marshal proto.Size %v", seed, size, size3)
}
}
func BenchmarkDroppedWithoutGettersSize(b *testing.B) {
popr := math_rand.New(math_rand.NewSource(616))
total := 0
pops := make([]*DroppedWithoutGetters, 1000)
for i := 0; i < 1000; i++ {
pops[i] = NewPopulatedDroppedWithoutGetters(popr, false)
}
b.ResetTimer()
for i := 0; i < b.N; i++ {
total += pops[i%1000].Size()
}
b.SetBytes(int64(total / b.N))
}
func TestKeptSize(t *testing.T) {
seed := time.Now().UnixNano()
popr := math_rand.New(math_rand.NewSource(seed))
p := NewPopulatedKept(popr, true)
size2 := github_com_gogo_protobuf_proto.Size(p)
dAtA, err := github_com_gogo_protobuf_proto.Marshal(p)
if err != nil {
t.Fatalf("seed = %d, err = %v", seed, err)
}
size := p.Size()
if len(dAtA) != size {
t.Errorf("seed = %d, size %v != marshalled size %v", seed, size, len(dAtA))
}
if size2 != size {
t.Errorf("seed = %d, size %v != before marshal proto.Size %v", seed, size, size2)
}
size3 := github_com_gogo_protobuf_proto.Size(p)
if size3 != size {
t.Errorf("seed = %d, size %v != after marshal proto.Size %v", seed, size, size3)
}
}
func BenchmarkKeptSize(b *testing.B) {
popr := math_rand.New(math_rand.NewSource(616))
total := 0
pops := make([]*Kept, 1000)
for i := 0; i < 1000; i++ {
pops[i] = NewPopulatedKept(popr, false)
}
b.ResetTimer()
for i := 0; i < b.N; i++ {
total += pops[i%1000].Size()
}
b.SetBytes(int64(total / b.N))
}
//These tests are generated by github.com/gogo/protobuf/plugin/testgen
```
|
```python
#!/usr/bin/env python
# (c) 2009 Richard Andrews <andrews@ntop.org>
# Program to generate a n2n_edge key schedule file for twofish keys
# Each key line consists of the following element
# <from> <until> <txfrm> <opaque>
#
# where <from>, <until> are UNIX time_t values of key valid period
# <txfrm> is the transform ID (=2 for twofish)
# <opaque> is twofish-specific data as follows
# <sec_id>_<hex_key>
import os
import sys
import time
import random
NUM_KEYS=30
KEY_LIFE=300
KEY_LEN=16
now=time.time()
start_sa=random.randint( 0, 0xffffffff )
random.seed(now) # note now is a floating point time value
def rand_key():
key=str()
for i in range(0,KEY_LEN):
key += "%02x"%( random.randint( 0, 255) )
return key
for i in range(0,NUM_KEYS):
from_time = now + (KEY_LIFE * (i-1) )
until_time = now + (KEY_LIFE * (i+1) )
key = rand_key()
sa_idx = start_sa + i
transform_id = random.randint( 2, 3 )
sys.stdout.write("%d %d %d %d_%s\n"%(from_time, until_time, transform_id,sa_idx, key) )
```
|
```javascript
ace.define("ace/mode/sql_highlight_rules",["require","exports","module","ace/lib/oop","ace/mode/text_highlight_rules"], function(require, exports, module) {
"use strict";
var oop = require("../lib/oop");
var TextHighlightRules = require("./text_highlight_rules").TextHighlightRules;
var SqlHighlightRules = function() {
var keywords = (
"select|insert|update|delete|from|where|and|or|group|by|order|limit|offset|having|as|case|" +
"when|else|end|type|left|right|join|on|outer|desc|asc|union|create|table|primary|key|if|" +
"foreign|not|references|default|null|inner|cross|natural|database|drop|grant"
);
var builtinConstants = (
"true|false"
);
var builtinFunctions = (
"avg|count|first|last|max|min|sum|ucase|lcase|mid|len|round|rank|now|format|" +
"coalesce|ifnull|isnull|nvl"
);
var dataTypes = (
"int|numeric|decimal|date|varchar|char|bigint|float|double|bit|binary|text|set|timestamp|" +
"money|real|number|integer"
);
var keywordMapper = this.createKeywordMapper({
"support.function": builtinFunctions,
"keyword": keywords,
"constant.language": builtinConstants,
"storage.type": dataTypes
}, "identifier", true);
this.$rules = {
"start" : [ {
token : "comment",
regex : "--.*$"
}, {
token : "comment",
start : "/\\*",
end : "\\*/"
}, {
token : "string", // " string
regex : '".*?"'
}, {
token : "string", // ' string
regex : "'.*?'"
}, {
token : "string", // ` string (apache drill)
regex : "`.*?`"
}, {
token : "constant.numeric", // float
regex : "[+-]?\\d+(?:(?:\\.\\d*)?(?:[eE][+-]?\\d+)?)?\\b"
}, {
token : keywordMapper,
regex : "[a-zA-Z_$][a-zA-Z0-9_$]*\\b"
}, {
token : "keyword.operator",
regex : "\\+|\\-|\\/|\\/\\/|%|<@>|@>|<@|&|\\^|~|<|>|<=|=>|==|!=|<>|="
}, {
token : "paren.lparen",
regex : "[\\(]"
}, {
token : "paren.rparen",
regex : "[\\)]"
}, {
token : "text",
regex : "\\s+"
} ]
};
this.normalizeRules();
};
oop.inherits(SqlHighlightRules, TextHighlightRules);
exports.SqlHighlightRules = SqlHighlightRules;
});
ace.define("ace/mode/sql",["require","exports","module","ace/lib/oop","ace/mode/text","ace/mode/sql_highlight_rules"], function(require, exports, module) {
"use strict";
var oop = require("../lib/oop");
var TextMode = require("./text").Mode;
var SqlHighlightRules = require("./sql_highlight_rules").SqlHighlightRules;
var Mode = function() {
this.HighlightRules = SqlHighlightRules;
this.$behaviour = this.$defaultBehaviour;
};
oop.inherits(Mode, TextMode);
(function() {
this.lineCommentStart = "--";
this.$id = "ace/mode/sql";
}).call(Mode.prototype);
exports.Mode = Mode;
});
```
|
```xml
import { memo } from 'react';
import { isSameDay } from '@proton/shared/lib/date-fns-utc';
interface Props {
days: Date[];
now: Date;
date: Date;
formattedDates: string[];
onClickDate: (day: Date) => void;
}
const DayButtons = ({ days, now, date, formattedDates, onClickDate }: Props) => {
return (
<>
{days.map((day, dayIndex) => {
return (
<button
type="button"
aria-label={formattedDates[dayIndex]}
className="flex-1 text-center calendar-monthgrid-day p-1"
key={day.getUTCDate()}
aria-current={isSameDay(day, now) ? 'date' : undefined}
aria-pressed={isSameDay(day, date) ? true : undefined}
onClick={() => onClickDate(day)}
>
<span className="calendar-monthgrid-day-number flex m-auto">
<span className="m-auto">{day.getUTCDate()}</span>
</span>
</button>
);
})}
</>
);
};
const MemoedDayButtons = memo(DayButtons);
export default MemoedDayButtons;
```
|
```php
<?php
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
*/
namespace Google\Service\Document;
class GoogleCloudLocationLocation extends \Google\Model
{
/**
* @var string
*/
public $displayName;
/**
* @var string[]
*/
public $labels;
/**
* @var string
*/
public $locationId;
/**
* @var array[]
*/
public $metadata;
/**
* @var string
*/
public $name;
/**
* @param string
*/
public function setDisplayName($displayName)
{
$this->displayName = $displayName;
}
/**
* @return string
*/
public function getDisplayName()
{
return $this->displayName;
}
/**
* @param string[]
*/
public function setLabels($labels)
{
$this->labels = $labels;
}
/**
* @return string[]
*/
public function getLabels()
{
return $this->labels;
}
/**
* @param string
*/
public function setLocationId($locationId)
{
$this->locationId = $locationId;
}
/**
* @return string
*/
public function getLocationId()
{
return $this->locationId;
}
/**
* @param array[]
*/
public function setMetadata($metadata)
{
$this->metadata = $metadata;
}
/**
* @return array[]
*/
public function getMetadata()
{
return $this->metadata;
}
/**
* @param string
*/
public function setName($name)
{
$this->name = $name;
}
/**
* @return string
*/
public function getName()
{
return $this->name;
}
}
// Adding a class alias for backwards compatibility with the previous class name.
class_alias(GoogleCloudLocationLocation::class, 'Google_Service_Document_GoogleCloudLocationLocation');
```
|
```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';
// MODULES //
var tape = require( 'tape' );
var floor = require( '@stdlib/math/base/special/floor' );
var isnan = require( '@stdlib/math/base/assert/is-nan' );
var Float32Array = require( '@stdlib/array/float32' );
var sdsnanmean = require( './../lib/sdsnanmean.js' );
// TESTS //
tape( 'main export is a function', function test( t ) {
t.ok( true, __filename );
t.strictEqual( typeof sdsnanmean, 'function', 'main export is a function' );
t.end();
});
tape( 'the function has an arity of 3', function test( t ) {
t.strictEqual( sdsnanmean.length, 3, 'has expected arity' );
t.end();
});
tape( 'the function calculates the arithmetic mean of a strided array, ignoring `NaN` values', function test( t ) {
var x;
var v;
x = new Float32Array( [ 1.0, -2.0, -4.0, 5.0, NaN, 0.0, 3.0 ] );
v = sdsnanmean( x.length, x, 1 );
t.strictEqual( v, 0.5, 'returns expected value' );
x = new Float32Array( [ -4.0, NaN ] );
v = sdsnanmean( x.length, x, 1 );
t.strictEqual( v, -4.0, 'returns expected value' );
x = new Float32Array( [ NaN, NaN ] );
v = sdsnanmean( x.length, x, 1 );
t.strictEqual( isnan( v ), true, 'returns expected value' );
t.end();
});
tape( 'if provided an `N` parameter less than or equal to `0`, the function returns `NaN`', function test( t ) {
var x;
var v;
x = new Float32Array( [ 1.0, -2.0, -4.0, 5.0, 3.0 ] );
v = sdsnanmean( 0, x, 1 );
t.strictEqual( isnan( v ), true, 'returns expected value' );
v = sdsnanmean( -1, x, 1 );
t.strictEqual( isnan( v ), true, 'returns expected value' );
t.end();
});
tape( 'if provided an `N` parameter equal to `1`, the function returns the first element', function test( t ) {
var x;
var v;
x = new Float32Array( [ 1.0, -2.0, -4.0, 5.0, 3.0 ] );
v = sdsnanmean( 1, x, 1 );
t.strictEqual( v, 1.0, 'returns expected value' );
t.end();
});
tape( 'the function supports a `stride` parameter', function test( t ) {
var N;
var x;
var v;
x = new Float32Array([
1.0, // 0
2.0,
2.0, // 1
-7.0,
-2.0, // 2
3.0,
4.0, // 3
2.0,
NaN // 4
]);
N = floor( x.length / 2 );
v = sdsnanmean( N, x, 2 );
t.strictEqual( v, 1.25, 'returns expected value' );
t.end();
});
tape( 'the function supports a negative `stride` parameter', function test( t ) {
var N;
var x;
var v;
x = new Float32Array([
1.0, // 4
2.0,
2.0, // 3
-7.0,
-2.0, // 2
3.0,
4.0, // 1
2.0,
NaN // 0
]);
N = floor( x.length / 2 );
v = sdsnanmean( N, x, -2 );
t.strictEqual( v, 1.25, 'returns expected value' );
t.end();
});
tape( 'if provided a `stride` parameter equal to `0`, the function returns the first element', function test( t ) {
var x;
var v;
x = new Float32Array( [ 1.0, -2.0, -4.0, 5.0, 3.0 ] );
v = sdsnanmean( x.length, x, 0 );
t.strictEqual( v, 1.0, 'returns expected value' );
t.end();
});
tape( 'the function supports view offsets', function test( t ) {
var x0;
var x1;
var N;
var v;
x0 = new Float32Array([
2.0,
1.0, // 0
2.0,
-2.0, // 1
-2.0,
2.0, // 2
3.0,
4.0, // 3
6.0,
NaN // 4
]);
x1 = new Float32Array( x0.buffer, x0.BYTES_PER_ELEMENT*1 ); // start at 2nd element
N = floor(x1.length / 2);
v = sdsnanmean( N, x1, 2 );
t.strictEqual( v, 1.25, 'returns expected value' );
t.end();
});
```
|
The monarchy of Greece () or Greek monarchy () was the government in which a hereditary monarch was the sovereign of the Kingdom of Greece from 1832 to 1924 and 1935 to 1973.
History
The monarchy of Greece was created by the London Conference of 1832 at which the First Hellenic Republic was abolished. The Greek crown was originally offered to Prince Leopold of Saxe-Coburg and Gotha but he declined, later being elected the king of the Belgians.
In 1832, Prince Otto of Bavaria of the House of Wittelsbach was styled "His Majesty Otto I, King of Greece", over which he reigned for 30 years until he was deposed in 1862. After Otto's deposition as king, the crown was offered to many others, including the novelist and former British colonial secretary Edward Bulwer-Lytton.
A head of state referendum was held in 1862 to name a new king. The vast majority of Greek people wanted Prince Alfred, Duke of Edinburgh, to be their new king. He won the referendum by 230,016 against the Duke of Leuchtenberg. Alfred declined to be king, and so did every candidate until Prince Vilhelm of Denmark of the House of Glücksburg, who had received only six votes. Vilhelm was elected unanimously by the Greek Assembly, and became "His Majesty George I, King of the Hellenes".
There was a referendum in 1920 to restore Constantine I as monarch, but four years later the Second Hellenic Republic was established and the monarchy was abolished following a referendum in 1924. Then in 1935 the monarchy was restored after a referendum and maintained after a referendum in 1946.
In July 1973 the Greek military junta called a referendum, which abolished the monarchy for the second time in Greek history. Then in 1974, the democratically elected prime minister, Konstantinos Karamanlis, called a referendum which legitimately confirmed the abolition.
Residences
Tatoi was the private residence and 10,000-acre estate outside of Athens originally bought by King George I in the 1870s. The property was seized by the Republic following the 1974 referendum and has long been a contentious issue between the royal family and the government of the Greek republic.
The Old Royal Palace () is the first royal palace of modern Greece, completed in 1843. It has housed the Hellenic Parliament since 1934. The Old Palace is situated at the heart of modern Athens, facing onto Syntagma Square.
Kings of Greece
Royal consorts
Regents of Greece
Insignia
See also
Basileus
Greek crown jewels
Greek royal family
List of heads of state of Greece
List of heirs to the Greek throne
References
External links
Political history of Greece
1832 establishments in Greece
1973 disestablishments in Greece
|
Răzvan Marian Stanca (born 18 January 1980) is a Romanian former professional football player who played for teams such as: Sportul Studențesc, Dacia Mioveni, Pandurii Târgu Jiu or Steaua București, among others.
Career
Pandurii
In 2008, Stanca signed a contract with Liga I club, Pandurii Târgu Jiu. After 2 years, where he appeared as holder for 45 times, he was remarked and was loaned to Steaua and after to Universitatea Craiova.
Steaua
On 7 August 2010, at his Liga I debut for Steaua, against FC Brașov, he was sent off and the opposing team received a penalty kick in the 90th minute, Robert Ilyeș equalized and the match ended 1-1.
After only 2 months, because Victor Pițurcă coach resigned on round 3 of new season and the new manager no longer need his services, he was sent to the second team. Later, he was loaned to Universitatea Craiova, where he arrived after Victor Pițurcă joined the club as the general manager.
In January 2011, he returned to Steaua. He spent here 2 years and appeared as holder 13 times.
Return to Pandurii
In July 2013, Stanca returned to Pandurii.
Honours
Sportul Studențesc
Liga II: 2000–01, 2003–04
Steaua București
Cupa României: 2011
Liga I: 2012–13
References
External links
1980 births
Living people
Footballers from Bucharest
Romanian men's footballers
Romania men's international footballers
Men's association football goalkeepers
Liga I players
Liga II players
FCV Farul Constanța players
FC Sportul Studențesc București players
CS Mioveni players
CS Pandurii Târgu Jiu players
FC Steaua București players
|
Nadezda "Nadia" Kanaeva (; born 9 February 1982) is a Russian former competitive figure skater. She is the 1997 Nebelhorn Trophy bronze medalist, 1996 World Junior bronze medalist, and 1995 European Youth Olympic champion. She was coached by Elena Buianova.
As of 2020, Kanaeva worked as a skating coach at Lakewood ICE in Lakewood, California, assisting Rafael Arutyunyan.
Competitive highlights
JGP: Junior Grand Prix (also titled ISU Junior Series)
References
1982 births
Russian female single skaters
Living people
World Junior Figure Skating Championships medalists
Figure skaters from Moscow
Russian emigrants to the United States
|
Robin Courteney Nedwell (27 September 1946 – 1 February 1999) was an English actor, formally trained at Central School of Speech and Drama. He is best remembered for his role as Doctor Duncan Waring in the television comedy series Doctor in the House and its sequels including Doctor Down Under; although he was critically acclaimed for his performance in television series such as The Lovers, The Upchat Connection, The Climber and the ATV comedy-drama Shillingbury Tales. He also featured in several British films.
Biography
He was born in Birmingham, England but moved with his family at an early age to Cardiff, Wales, where he was educated at Monkton House preparatory school. After leaving school he studied at University College, Cardiff and joined a local theatre company, Everyman Theatre Cardiff, and then trained at the Central School of Speech and Drama studying Stage Acting.
Soon after finishing drama school he landed the role of Doctor Duncan Waring in the hugely popular British television comedy series Doctor in the House (1969–70). The producer, Humphrey Barclay, talking of Nedwell's audition said "I remember him bounding into the audition room in 1969, an ebullient drama student in a tweed jacket. His natural personality and sense of comedy were immediately apparent and we cast him on the spot. He was entertaining, considerate, and the greatest fun", and recalled his trademark "huge laugh".
Taking a break from the series in 1971 to pursue his interests in film-making and feature film appearances, Nedwell returned in a leading role as Dr. Waring in the sequels Doctor in Charge, Doctor at Sea, Doctor on the Go, Doctor Down Under (filmed in Australia), and Doctor at the Top. Although most of his roles were designed for television, apart from the "Doctor" series, his appearances included Vault of Horror (1973) – along with his "Doctor" co-star Geoffrey Davies – Stand Up, Virgin Soldiers (1977), The Shillingbury Blowers (1980), The Zany Adventures of Robin Hood (1984) and Cluedo (1990).
Nedwell became known later in his career for his performances on stage. He appeared in the West End in Brigadoon in 1989, and in 1992, played Max Detweiler in a British tour of The Sound of Music, a production that was also staged at Sadler's Wells. He performed with the Royal Shakespeare Company during the 1995–1996 season, appearing in that year's productions of The Taming of the Shrew (as Grumio), Richard III (as King Richard III) and Ben Jonson's comedy The Devil is an Ass.
Personal life
Nedwell had a romance with co-star Diane Keen. In 1982, Nedwell married PR agent Heather Inglis, with whom he had a daughter, Amie, although the couple later separated. His nephew Oliver is a graduate of the National Film and Television School with several credits on feature length films.
Death
Nedwell lived in Hedge End, Hampshire, England and died at his doctor's surgery in Hedge End after suffering a heart attack on 1 February 1999, aged 52.
Filmography
The Vault of Horror (1973) – Tom (segment 4 "Bargain in Death")
Stand Up, Virgin Soldiers (1977) – Lt. Grainger
The Shillingbury Blowers (1980) – Peter Higgins
A Slice of Life (1983) – Toby
The Zany Adventures of Robin Hood (1984) – Will Scarlett
References
External links
Robin Nedwell – TV Comedy People
Robin Nedwell – BBC Guide to Comedy
Robin Nedwell – Famous alumni of Canton High School (Cardiff)
1946 births
1999 deaths
Alumni of the Royal Central School of Speech and Drama
British male comedians
British male film actors
British male stage actors
British male television actors
Male actors from Birmingham, West Midlands
20th-century English male actors
Male actors from Cardiff
20th-century British comedians
People from the Borough of Eastleigh
|
Otto I (also Otho or Ottone; died 991) was the second Marquis of Montferrat briefly following his father Aleram on the throne.
Life
Otto was the son of Aleram and his first wife. Notably obscure, he did not appear with his parents and his younger brother Anselm at the foundation of the monastery of Grazzano in 961. On Aleram's death in 967, the large marca Aleramica was broken up: Montferrat went to Otto and Liguria to Anselm. Their elder brother William II had already deceased.
In his own lifetime, Otto does not appear in any document with the margravial title, but he appears in the documents of later generations cited as such. He appears in a confirmation of the possessions of the abbacy of Fruttuaria with the title in a patronymic. He probably never used the title in life, but his descendants retroactively applied it to him, as he held the same post as they.
Otto died in 991, as known by the foundation act of his son for the monastery of Spigno, which Otto himself had planned on building. By his unnamed wife, he left two sons: an eldest named William III, who succeeded him, and younger named Riprando. He also left two daughters, Otta and Waldrada (Gualderada).
References and Notes
991 deaths
Marquesses of Montferrat
Aleramici
Year of birth unknown
People from Grazzano Badoglio
|
OPzS (Operation of Short Circuit) is a type of lead-acid battery commonly used for backup power systems and renewable energy applications. Here are some key features and characteristics of OPzS batteries:
1. Tubular Plate Design: OPzS batteries feature tubular positive plates and a flat pasted negative plate. The use of tubular plates provides excellent resistance to deep discharges and a longer cycle life.
2. Deep Discharge Capability: OPzS batteries are known for their deep discharge capabilities. They can be discharged to a significant extent without causing damage, making them suitable for applications where frequent discharging is required, such as in off-grid solar systems.
3. High Durability: The tubular plate design, combined with the use of acid-immersed separators, contributes to the high durability and longer service life of OPzS batteries.
4. Ventilation and Maintenance: OPzS batteries are typically vented batteries, meaning they have a built-in ventilation system. They also require regular maintenance, including topping up with distilled water, to ensure their proper functioning.
5. Excellent Cycling Performance: These batteries are known for their excellent cycling performance, with a high number of charge and discharge cycles compared to some other battery types.
6. Standby and Deep-Cycle Use: OPzS batteries are suitable for both standby applications (providing backup power in case of outages) and deep-cycle applications (repeated deep discharging and recharging).
7. Common Use in Renewable Energy: They are often used in off-grid and grid-tied renewable energy systems, such as solar power installations and wind farms, due to their ability to handle irregular charging and discharging patterns.
8. Capacity Range: OPzS batteries come in various capacities to meet different energy storage needs, and they can be connected in series and parallel to achieve the required voltage and capacity for specific applications.
9. Safety Precautions: As with all lead-acid batteries, safety precautions should be taken when handling OPzS batteries. They contain sulfuric acid and should be handled carefully to avoid acid spills and contact.
10. Recyclability: Like other lead-acid batteries, OPzS batteries are recyclable, and their lead components can be repurposed in new batteries.
OPzS batteries are known for their reliability and longevity, making them a popular choice in applications where a robust and dependable energy storage solution is required. They are often compared to other types of lead-acid batteries, such as OPzV (Valve Regulated Lead Acid) batteries, which offer different characteristics and advantages. The choice between OPzS and OPzV batteries depends on the specific requirements of the application.
Features
They have a cell voltage of 2V and have to be connected in series to produce higher voltages. Also, they are differentiated from the other types of batteries by their upright and vertical orientation. OPzS batteries also feature High Capacity, Long lifetime, Reduced Maintenance, Low Self-Discharging, Quick and simple acid level control, Economical water consumption, Appropriate dimensions and weight, and the lowest and constant maintenance current.
Differences between OPzS and OPzV batteries
OPzV is the tubular GEL battery. And OPzS is the tubular flooded battery. OPzS is a flooded cell, meaning the electrolyte (generally sulfuric acid) is in liquid form inside the cell. And the electrolyte of OPzV within the battery is in gel form which allows for recombining the electrolyte back into the water. OPzV battery is a sealed battery and users don’t need to maintain the battery. But the OPzS battery is not sealed. Users occasionally need to add distilled water to the top of the battery to maintain the normal use of the battery. OPzS and OPzV batteries are both types of the tubular-plated battery. The differences is in the nature of their electrolytes. While the acid electrolyte of OpzS is FLA, the OPzV is VRLA. It electrolyte is made into gel by the addition of silica dust. Hence they are also referred to as "silicone batteries". Also, the OPzV is valve-regulated, sealed and thus, maintenance-free.
Specifications
Here's an example of the specs of an OPzS battery:
APPLICATION
Macro Cells
Energy Storage
Switchgear and Substation
Microgrids
Medical Standby Power
TECHNOLOGY / CHEMISTRY
Flooded lead acid
CAPACITY (MIN) - EUROPE STANDARD
216
CAPACITY (MAX) - EUROPE STANDARD
3360
CAPACITY EUROPE STANDARD
Ah / C10 / 1.8Vpc / 20 °C
CAPACITY (MIN) - US STANDARD
217
CAPACITY (MAX) - US STANDARD
3543
CAPACITY US STANDARD
Ah / 8hr / 1.75Vpc / 77 °F
VOLTAGE (MIN)
2
VOLTAGE (MAX)
2
DESIGN
Top terminal
DIN sizes
References
Battery types
|
```c
/* $OpenBSD: ct.c,v 1.10 2023/03/08 04:43:07 guenther Exp $ */
/*
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR OR HIS RELATIVES BE LIABLE FOR ANY DIRECT,
* INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF MIND, USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
* IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
* THE POSSIBILITY OF SUCH DAMAGE.
*/
/*
* All Rights Reserved
*
* Permission to use, copy, modify, and distribute this software and
* its documentation for any purpose and without fee is hereby granted,
* provided that the above copyright notice appears in all copies and
* that both the copyright notice and this permission notice appear in
* supporting documentation.
*
* OSF DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE
* INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
* FOR A PARTICULAR PURPOSE.
*
* IN NO EVENT SHALL OSF BE LIABLE FOR ANY SPECIAL, INDIRECT, OR
* CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
* LOSS OF USE, DATA OR PROFITS, WHETHER IN ACTION OF CONTRACT,
* NEGLIGENCE, OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION
* WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*
*/
#include "libsa.h"
#include <sys/param.h>
#include <sys/disklabel.h>
#include <sys/reboot.h>
#include <machine/pdc.h>
#include <machine/iomod.h>
#include "dev_hppa.h"
int
ctopen(struct open_file *f, ...)
{
struct hppa_dev *dp = f->f_devdata;
if (!(dp->pz_dev = pdc_findev(-1, PCL_SEQU)))
return (ENXIO);
return (0);
}
int
ctclose(f)
struct open_file *f;
{
free (f->f_devdata, sizeof(struct hppa_dev));
f->f_devdata = NULL;
return 0;
}
```
|
```java
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package com.roncoo.pay.permission.service;
import com.roncoo.pay.permission.entity.PmsMenu;
import java.util.List;
import java.util.Map;
/**
* service
*
* www.roncoo.com
*
* @authorshenjialong
*/
public interface PmsMenuService {
/**
*
*
* @param menu
*/
public void savaMenu(PmsMenu menu);
/**
* ID.<br/>
*
* @param parentId
* ().<br/>
* @return menuList.
*/
@SuppressWarnings("rawtypes")
public List getListByParent(Long parentId);
/**
* id
*
* @param id
*/
public void delete(Long id);
/**
* id
*
* @param roleIdsStr
* @return
*/
@SuppressWarnings("rawtypes")
public List listByRoleIds(String roleIdsStr);
/**
* ID.
*
* @param parentId
* .
* @return menuList.
*/
public List<PmsMenu> listByParentId(Long parentId);
/***
*
*
* @param isLeaf
*
* @param name
*
* @return
*/
public List<PmsMenu> getMenuByNameAndIsLeaf(Map<String, Object> map);
/**
* ID.
*
* @param pid
* @return
*/
public PmsMenu getById(Long pid);
/**
* .
*
* @param menu
*/
public void update(PmsMenu menu);
/**
* ID
*
* @param roleId
* @return
*/
public String getMenuIdsByRoleId(Long roleId);
}
```
|
The 1984 European Curling Championships were held from 9 to 14 December at the Palais des Sports arena in Morzine, France.
The Swiss men's team skipped by Peter Attinger Jr. won their fifth European title, and the German women's team skipped by Almut Hege won their first European title.
Men's
Teams
Round robin
Group A
Group B
Teams to playoffs
Teams to tiebreaker
Tiebreaker
Ranking games for 5th-14th places
Playoffs
Final standings
Women's
Teams
Round robin
Group A
Group B
Teams to playoffs
Ranking games for 5th-14th places
Playoffs
Final standings
References
European Curling Championships, 1984
European Curling Championships, 1984
European Curling Championships
Curling competitions in France
International sports competitions hosted by France
European Curling Championships
1984 European Curling Championships
|
Reem or REEM may refer to:
People
Reem (given name) means a baby deer or gazelle in Arabic
Reem (singer), Danish singer
Places
Al Reem Island, island 600 meters off the coast of Abu Dhabi island
Other
Arabian sand gazelle, also known as the reem
Reem International Circuit, venue of Motorsports in Riyadh Saudi Arabia
Re'em, a Jewish mythological creature
REEM, humanoid robot built by PAL Robotics
"Reem", a 2011 single by Joey Essex
See also
Ream (disambiguation)
Reim (disambiguation)
Rheem (disambiguation)
Riem (name), a list of people with the given name or surname
|
Kristin Fridtun (born 9 November 1987) is a Norwegian writer, author and former ski jumper who represented Elverum Hopp.
Biography
Fridtun grew up in Elverum. She has two national bronze medals, on snow and artificial (unofficial), from 2003. In the unofficial women's class at the Junior World Championships in Stryn in 2004, she was on the Norwegian team which won the team competition, and she finished 11th in the individual rankings. At the Women's Ski Jumping Week in 2004, she finished joint 17th. In March 2006, she took part in two round of the Continental Cup in Vikersund normal hill and Våler in Hedmark, her 24th and 23rd places gave her 49th place overall for the 2005/06 season.
Fridtun lives in Bergen. She has a master's degree in Norse philology from NTNU, and is a columnist in the Nynorsk newspaper Dag og Tid.
Fridtun identifies as gay and as a transperson.
Bibliography
Norsk etymologisk oppkok – Du veit ikkje kva du snakkar om. Published 2012
Nynorsk for dumskallar. Published 2013
Kjønn og ukjønn, prose, Published 2015
References
Sources
Ladies-Skijumping.com: Kristin Fridtun (Accessed 28 August 2012)
NM 2003 – Normal hill results (Accessed 28 August 2012)
National Championships placings 2003 – Normal hill results (Accessed 28 August 2012)
Aftenposten: Ordene du ikke visste at du lurte på (28 August 2012, accessed same day)
Presentation by Kristin Fridtun at Forfatterkatalogen på Forfattersentrums nettsider
External links
1987 births
Living people
21st-century Norwegian writers
Norwegian columnists
Norwegian women columnists
Norwegian female ski jumpers
People from Elverum
|
Budy Strzegowskie is a village in the administrative district of Gmina Strzegowo, within Mława County, Masovian Voivodeship, in east-central Poland.
References
Budy Strzegowskie
|
The Administration for Soviet Property in Austria, or the USIA () was formed in the Soviet zone of Allied-occupied Austria in June 1946 and operated until the withdrawal of Soviet troops in 1955. USIA operated as a de facto state corporation and controlled over four hundred expropriated Austrian factories, transportation and trading companies. USIA assets included formerly independent Austrian companies (ÖAF), factories once owned by German corporations (AEG) and former SS enterprises (DEST). At its peak in 1951 the conglomerate employed around 60 thousand people, or 10% of Austrian industrial labor. USIA was exempt from Austrian tariffs, disregarded Austrian taxation, and could easily trade with Eastern Europe despite the Iron Curtain and Western trade embargoes. The extraterritorial corporation attempted to be self-sufficient and was very weakly integrated with the rest of Austrian economy.
Establishment
Occupation of Germany and Austria by the Soviet troops was followed by large-scale dismantling of former German equipment which was shipped to the Soviet Union as war reparations. Austria lost, in 1951 dollars, 200 million dollars' worth of German industrial properties (out of total 1.5 billion). Dismantling continued until the early summer of 1946, when the Soviet policy changed from taking Austrian assets to managing them for a profit. The Soviet Department for Investigation of German Properties compiled an inventory of remaining industrial assets in the Soviet zone (Lower Austria, Burgenland and eastern districts of Upper Austria). June 27, 1945, the Soviet command transformed this Department into the Administration for Soviet Property in Eastern Austria (USIVA) and placed all industrial assets under its control. In 1947 the name was shortened to USIA. Its internal structure mimicked that of the Soviet cabinet, with nine divisions paralleling nine ministries of industries. No less than eleven ministries in Moscow had a say in USIA affairs.
Only one-tenth of USIA assets were, indeed, German. Others were historically Austrian properties, expropriated with ludicrous explanations or with no explanations at all. Expropriation of lands of the House of Esterházy was "justified" because, according to the Soviets, the knighthood of the Holy Roman Empire conferred in 1806 qualified Esterházy as Germans rather than Austrians. Austrian government was forced to accept the fact but refused to legalize the expropriations through records in land and corporate registers. The Soviets used this refusal as a pretext for not paying Austrian taxes. The exact number of businesses under USIA control is subject to different interpretations. According to Austrian 1955 sources, there were 419 enterprises, of the 300 in the industry. A different source named 160 enterprises in 1954 (excluding the oil fields, transportation companies and trading outlets). The Soviets also operated Soviet Military Bank (SMB) which evolved from the Red Army field treasury. It tried to obtain an Austrian banking license but the government denied it in fear of Soviet influence over Austrian finances.
The number of employees varied from 22 thousand in 1946 to a peak of 60 thousand in 1951 and down to 36 thousand in 1955. A disproportionately high share of USIA staff were Austrian Communists, especially after the 1950 Austrian general strikes, when communists were fired en masse from non-USIA businesses. The strikes of the 1950s were powered by organized pro-communist workers of the USIA factories in the Soviet sector of Vienna. The Soviets, however, placed business interests above "class unity" with Austrian Communists. According to Hugo Portisch, Soviet representatives in Austria were split over the 1950 strikes: some saw an opportunity to suppress the Western influence, while the USIA management had to meet production targets and opposed any disruption in the Soviet zone. Portisch wrote that Moscow intervened to defuse the situation and denied support to Austrian Communists.
Operations
USIA was initially managed by Red Army staff; after 1949 they were replaced by trained industrial managers. The organization was governed by a chief executive with three assistants for political, personnel, and commercial matters. USIA chiefs, on average, served two years before replacement. Over nine years of its history, USIA had five chiefs, SMV (Soviet oil enterprise) had four chairmen, etc. At first, the Soviets intended to integrate USIA enterprises into their own economy, but the futility of such and exercise soon became evident and they admitted the need to cooperate with the rest of the Austrian economy.
USIA accounted for only 5% of Austrian national output and 30% of the Soviet zone output but possessed significant or even monopolistic share in some industries: 60% in glass making, 43% in leather, 40% in iron and steel etc. The governments of Austria and the United States, anxious about Soviet influence, invested Marshall Plan funds into competing businesses outside of the Soviet zone and the USIA monopolists gradually lost their advantage. The Soviets had no intention to invest their own funds into Austria, the sole exception being the oil fields in Lower Austria. As a result, Soviet-occupied territories lagged behind the rest of Austria in economic growth, their plant and equipment soon became "very much substandard for Austria". Some USIA-ran Austrian companies, fed up with Soviet control, simply moved their personnel and operations to the West, leaving the Soviets with empty shells (as was the case of Porr AG).
According to an investigation of USIA business in 1946–1955, 20% of its products were traded and consumed within USIA, 38% sold to Eastern Europe, 42% sold to non-USIA Austrian customers, and only 1% to Western European customers. The United States suppressed USIA operations through a "neutralization plan" devised in 1947. An embargo imposed by the United States on exports behind the Iron Curtain prohibited other Austrian businesses from selling their products to USIA, unless it guaranteed that the finished products will stay in Austria. Dealing with USIA was problematic because a valid legal title could not be enforced when allowed by the West. Vienna City Hall informally banned municipal purchases of USIA products. Marshall Plan money was deliberately deployed against USIA interests. Despite these problems USIA had a crucial and unfair competitive advantage. It was exempt from Austrian customs and foreign trade regulations. It routinely disregarded and evaded Austrian taxes and its trucking arm engaged in outright smuggling. USIA products easily moved across the Iron Curtain and could be sold at a profit and below fair market prices inside Austria. USIA retail shops in Vienna traded below market and were frequented by many Americans of modest means.
USIA operations declined since 1951. Between 1951 and 1955, over a hundred of its enterprises were shut down or merged. In 1955 Austria became an independent state and the Soviet Union withdrew its troops. The assets of USIA were sold to the Austrian government for 150 million US dollars, paid with goods over six years. The oil fields were subject to a separate agreement, which cost the Austrians around 200 million dollars. All written documentation of USIA disappeared.
USIA profits withdrawn by the Soviets from the Austrian economy, including the final payment, agreed in the Austrian State Treaty, are estimated at 1.072 billion U.S. dollars. Estimates of Soviet reparations in full range from 1.547 to 2.647 billion U.S. dollars. Per capita, Austria paid more reparations than any other Axis state or territory. Soviet rule over the economy of Eastern Austria left a deep and lasting impression on the Austrians. The 1958 "Final Report" on USIA activities concluded that the sole purpose of USIA was "to exploit Austria's natural and human resources as possibly and systematically as possible ... exploitation in colonial style amid a highly developed European economy, the extent and economic success of which are astounding ... This economic enclave of the occupation economy in Austria was used to fortify the economic potential of its bloc, to pursue its political objectives and, finally, to function as an economic bridge positioned directly opposite Western Austria and the Western World as a whole."
Notes
References
Bader, William B. (1966). Austria Between East and West. Stanford University Press. .
Bischof, Gunther; Pelinka, Anton; Stiefel, Dietrich (2000). The Marshall Plan in Austria. Transaction Publishing. .
Williams, Warren (2007). Flashpoint Austria: The Communist-Inspired Strikes of 1950 (paid access). Journal of Cold War Studies. Summer 2007, Vol. 9, No. 3, Pages 115-136. Published by the Massachusetts Institute of Technology.
Allied occupation of Austria
Economic history of Austria
Companies of the Soviet Union
Conglomerate companies established in 1946
Companies disestablished in 1955
Austria–Soviet Union relations
1946 establishments in Austria
Foreign trade of the Soviet Union
1955 disestablishments in Austria
Government-owned companies of Austria
|
```smalltalk
// See the LICENCE file in the repository root for full licence text.
using osu.Framework.Input.StateChanges.Events;
using osu.Framework.Input.States;
namespace osu.Framework.Input.StateChanges
{
/// <summary>
/// An object which can handle <see cref="InputState"/> changes.
/// </summary>
public interface IInputStateChangeHandler
{
/// <summary>
/// Handles an input state change event.
/// </summary>
void HandleInputStateChange(InputStateChangeEvent inputStateChange);
}
}
```
|
```vue
<template>
<div ref="container">
<a-modal
:title="title"
:width="width"
:visible="visible"
:confirmLoading="confirmLoading"
:getContainer="() => $refs.container"
:maskStyle="{'top':'93px','left':'154px'}"
:wrapClassName="wrapClassNameInfo()"
:mask="isDesktop()"
:maskClosable="false"
@cancel="handleCancel"
cancelText=""
okText=""
style="top:5%;height: 90%;">
<template slot="footer">
<a-button key="back" @click="handleCancel">
</a-button>
</template>
<a-spin :spinning="confirmLoading">
<a-col :md="10" :sm="24">
<template>
<a-tree
multiple
@select='onSelect'
:selectedKeys="selectedKeys"
:checkedKeys="checkedKeys"
:treeData="roleFunctionTree"
:checkStrictly="checkStrictly"
:expandedKeys="iExpandedKeys"
:autoExpandParent="true" />
</template>
</a-col>
</a-spin>
</a-modal>
</div>
</template>
<script>
import pick from 'lodash.pick'
import {getAction} from '../../../api/manage'
import {mixinDevice} from '@/utils/mixin'
export default {
name: "FunctionTreeModal",
mixins: [mixinDevice],
data () {
return {
title:"",
width: '800px',
visible: false,
model: {},
roleId: 0,
iExpandedKeys: [],
roleFunctionTree: [],
checkedKeys: [],
selectedKeys: [],
checkStrictly: false,
hiding: true,
labelCol: {
xs: { span: 24 },
sm: { span: 5 },
},
wrapperCol: {
xs: { span: 24 },
sm: { span: 16 },
},
confirmLoading: false,
form: this.$form.createForm(this),
}
},
created () {
},
methods: {
edit (id) {
this.form.resetFields();
this.model = Object.assign({}, {});
this.visible = true;
this.$nextTick(() => {
this.form.setFieldsValue(pick(this.model,'name', 'type', 'description'))
});
this.roleId = id
this.checkedKeys = []
this.loadTree(id)
},
close () {
this.$emit('close');
this.visible = false;
},
handleCancel () {
this.close()
},
loadTree(id) {
let that = this
that.treeData = []
that.roleFunctionTree = []
let params = {};
params.id='';
getAction('/function/findRoleFunction?UBType=RoleFunctions&UBKeyId='+id).then((res) => {
if (res) {
//
this.allTreeKeys = [];
for (let i = 0; i < res.length; i++) {
let temp = res[i]
that.treeData.push(temp)
that.roleFunctionTree.push(temp)
that.setThisExpandedKeys(temp)
that.getAllKeys(temp);
}
console.log(JSON.stringify(this.checkedKeys))
this.loading = false
}
})
},
onSelect(selectedKeys, info){
let funId = info.node.value
if(funId!==0) {
getAction('/function/info?id=' + funId).then((res) => {
if(res && res.code === 200) {
if(res.data && res.data.info) {
this.$emit('ok', res.data.info.number, res.data.info.name)
}
}
})
} else {
this.$emit('ok', 0, '')
}
this.close()
},
setThisExpandedKeys(node) {
if(node.checked==true) {
this.checkedKeys.push(node.key)
}
if (node.children && node.children.length > 0) {
this.iExpandedKeys.push(node.key)
for (let a = 0; a < node.children.length; a++) {
this.setThisExpandedKeys(node.children[a])
}
}
},
getAllKeys(node) {
this.allTreeKeys.push(node.key)
if (node.children && node.children.length > 0) {
for (let a = 0; a < node.children.length; a++) {
this.getAllKeys(node.children[a])
}
}
},
}
}
</script>
<style scoped>
</style>
```
|
Vilayattasseri Mullambalath Balachandran (25 November 1924 – 9 January 2010), known as Vimcy, was a sports writer from Kerala. He is considered to be the pioneer of sports journalism in Kerala.
Biography
Balachandran was born on 25 November 1924 at Thamarassery in Kozhikode district to Dr. Narayanan Nair and Narayani. Unable to finish his intermediate education at Palakkad Victoria College due to ill health, he joined the Kozhikode newspaper Dinaprabha in 1949 as a journalist. He used to write articles in Sanjayan and Viswaroopam under the pen-name of Thampi. In 1950, he became the assistant editor at Mathrubhumi. After his retirement from Mathrubhumi in 1984, he became associate editor for Calicut Times. He continued to write sports columns for Mathrubhumi, Calicut Times and Madhyamam. His autobiography titled Valkkashnam was published in 2008. Vimcy died on 9 January 2010 at Bilathikulam in Kozhikode.
Sports journalism
At a time when Malayalam newspapers dedicated little space to sports news, Vimcy started an entire sports page with Mathrubhumi. It was under him that sports writing became a separate branch of journalism in Kerala. Vimcy was also behind the weekly sports feature page Sports Special in Mathrubhumi. He used to write extensively about Football.
Vimcy won numerous awards including one from Kerala State Sports council for lifelong contributions to the field of sports journalism. Other awards included M.P. Paily award, Neelambaran Memorial award (from Kesari Memorial Committee), T. Aboobacker award and Press Academy Silver Jubilee award.
References
1924 births
2010 deaths
Indian sports journalists
People from Kozhikode district
Malayalam-language journalists
Malayalam-language writers
Government Victoria College, Palakkad alumni
Journalists from Kerala
Indian male journalists
|
```yaml
apiVersion: extensions/v1beta1
kind: Deployment
metadata:
name: default-http-backend
namespace: nginx-ingress2
spec:
replicas: 1
template:
metadata:
labels:
app: default-http-backend
spec:
containers:
- name: default-http-backend
image: gcr.io/google_containers/defaultbackend:1.0
livenessProbe:
httpGet:
path: /healthz
port: 8080
scheme: HTTP
initialDelaySeconds: 30
timeoutSeconds: 5
ports:
- containerPort: 8080
resources:
limits:
cpu: 10m
memory: 20Mi
requests:
cpu: 10m
memory: 20Mi
```
|
```javascript
describe("Components/Dropdown", () => {
beforeEach(() => {
cy.visit("path_to_url");
});
it("has a Dropdown", () => {
cy.get(".dropdown").should("exist");
});
it("has a correct Dropdown Content", () => {
cy.get("#dropdown .dropdown-content").then(($) => {
const cs = window.getComputedStyle($[0]);
expect(cs.backgroundColor).to.equal(Cypress.env("white"));
expect(cs.borderRadius).to.equal("4px");
expect(cs.boxShadow).to.equal(
"rgba(10, 10, 10, 0.1) 0px 8px 16px -2px, rgba(10, 10, 10, 0.02) 0px 0px 0px 1px"
);
expect(cs.paddingBottom).to.equal("8px");
expect(cs.paddingTop).to.equal("8px");
});
});
it("has a correct Dropdown Menu", () => {
cy.get("#dropdown .dropdown-menu").then(($) => {
const cs = window.getComputedStyle($[0]);
expect(cs.display).to.equal("none");
expect(cs.paddingTop).to.equal("4px");
expect(cs.position).to.equal("absolute");
expect(cs.zIndex).to.equal("20");
});
cy.get("#dropdown-active .dropdown-menu").then(($) => {
const cs = window.getComputedStyle($[0]);
expect(cs.display).to.equal("block");
});
});
it("has a correct Dropdown Item", () => {
cy.get("#dropdown .dropdown-item").then(($) => {
const cs = window.getComputedStyle($[0]);
expect(cs.color).to.equal(Cypress.env("text"));
expect(cs.display).to.equal("block");
});
cy.get("#dropdown a.dropdown-item").then(($) => {
const cs = window.getComputedStyle($[0]);
expect(cs.width).to.equal("100%");
});
cy.get("#dropdown a.dropdown-item.is-active").then(($) => {
const cs = window.getComputedStyle($[0]);
expect(cs.backgroundColor).to.equal(Cypress.env("link"));
expect(cs.color).to.equal(Cypress.env("link-invert"));
});
});
it("has a correct Dropdown Divider", () => {
cy.get("#dropdown .dropdown-divider").then(($) => {
const cs = window.getComputedStyle($[0]);
expect(cs.backgroundColor).to.equal(Cypress.env("grey-lightest"));
expect(cs.height).to.equal("1px");
});
});
});
```
|
Cooma Tigers Football Club is an Australian semi-professional association football club based in Cooma, New South Wales. The club is affiliated with Capital Football and currently competes in the Community State Leagues Capital Football in the ACT. Cooma's home venue is Nijong Oval.
History
Cooma Football Club was formed in 1952 by the workforce of the Snowy Mountains Hydro Scheme which attracted people from all over the world to the Australian Alps. Cooma FC is one of the oldest continuous football clubs in Australia with a very proud tradition considering the small region in which it resides.
In 2014, Cooma won the league premiership for the first time in the club's sixty-three-year history. The Tigers defeated title rivals Belconnen United 3–0 at home to clinch the title.
In 2015, Cooma FC announced a partnership with club Brindabella Blues FC. The partnership saw Brindabella Blues administer and run the U12, U14, U16 and U18 NPL programs out of Brindabella's home at Calwell District Playing Fields while the U20 and senior NPL programs remain based in Cooma with Cooma FC. At the time the NPL games were split between Calwell playing fields and Nijong, with U12, U14 and U16 playing at Calwell and U18, U20 and first grade playing at Nijong Oval Cooma, Capital Football Board insisted that the two clubs must form a new entity, the two clubs agreed to form Tigers FC as their NPL club.
In 2016, the Tigers fell short of winning the league title by three points as Canberra Olympic claimed the premiership. In the finals series Cooma lost the major semi-final to Olympic 5–3 on penalties after the two sides drew 2–2 after 120 minutes. The Tigers had looked certain to advance to the grand final as they headed into the final minutes of the match 2–1 up but a late goal by Colombian striker Phillippe Bernabo-Madrid sent the match into extra time. Cooma advanced to the preliminary final against Canberra FC but a number of injuries in the lead up to the match saw a depleted Tigers lose the match 1–5 and end the club's season. Cooma also missed out on reaching the round of 32 of the FFA Cup in 2016 when they lost the Capital Football Federation Cup final to Olympic 1–3 at Deakin Stadium on 18 June 2016.
Staff
Club management
Club identity
Club colours
Cooma FC has traditionally used yellow and black, including at a community level.
Club Grounds
Their home ground is Nijong Oval, located in the middle of Cooma.
Honours
Womens State League 2
Premiers (1): 2014
Womens State League 3
Premiers (1): 2021
Champions (1):2021 (finals cancelled due to COVID pandemic)
Mens State League 1
Premiers (1): 2018
Mens State League 2
Premiers (1): 2016
Capital Football Federation Cup
Runner-up (5): 2005, 2006, 2012, 2013, 2016 Winners 2019 Federation Cup
Notes
References
External links
Official website
Capital Football home
NPL Capital Football home
National Premier Leagues clubs
Soccer clubs in New South Wales
Association football clubs established in 1952
1952 establishments in Australia
|
Zonosaurus aeneus, the bronze girdled lizard, is a species of lizard in the family Gerrhosauridae. The species is endemic to Madagascar.
References
Zonosaurus
Reptiles of Madagascar
Endemic fauna of Madagascar
Reptiles described in 1872
Taxa named by Alfred Grandidier
|
Horton Hospital, formerly called Horton Asylum, was a large psychiatric hospital in the Horton area of Epsom, Surrey.
History
Origins
The hospital was designed for the London County Council by George Thomas Hine, consultant architect to the Commissioners in Lunacy to the London County Council), following a Compact Arrow plan first used at Bexley Asylum at Bexley in Kent. It was opened in 1902 and was the second hospital in the Epsom Cluster, a group of five mental institutions on the Horton Estate to the west of Epsom.
During the two World Wars the hospital was commandeered as a military hospital and the existing patients were transferred elsewhere.
Malaria research
For much of the 20th century the hospital played an important role in the development of induced malaria treatment as cure for general paralysis of the insane, a form of advanced syphilis. The treatment involved infecting patients with malaria which caused a high fever meant to kill the spirochetes which caused the disease. A laboratory based in the 14-bed isolation unit became a national centre for mosquito breeding and sent infected mosquitoes to all British hospitals which used the treatment. By the 1970s the unit had become the World Health Organization's Regional Malarial Centre for Europe but was rendered obsolete in 1975 by the increasing use of penicillin to treat syphilitic symptoms. The hospital was also notable for its pioneering work in music therapy in the 1960s.
Wolvercote Clinic
In 1995 the hospital was chosen as the site of a pioneering treatment centre for sex-offenders. The Wolvercote Clinic specialised in the intensive treatment of convicted child sex offenders and gained an international reputation for effective treatment with non-reoffending rates estimated at 80%. Treatment was carried out in secure accommodation for up to 12 months at a time and involved teaching patients to acknowledge their sexual responses to children and to take control of their own behaviour. The clinic closed in 2002 following news that the Hospital site was to be sold for redevelopment.
Decline and redevelopment
At its peak in 1971, the hospital had 1,587 beds and treated 1,438 patients. By 1975, however, the number of beds had fallen to 1,200 and patient numbers continued to decline until closure. The hospital officially closed in 1997, although the Wolvercote Clinic and a small psychiatric unit known as Horton Haven remained open. The hospital was sold for development in 2002 and most of the buildings were subsequently demolished. The chapel, administration block, water tower and some wards and villas were retained for conversion and incorporation into a new village development on the site.
As of 2009 most of the site had been redeveloped as housing and apartments. The water tower, chapel and former superintendent's residence were empty awaiting conversion while the Horton Haven and original gate lodge remained in use for psychiatric treatment. By October 2012, the water tower had been demolished and a small commemorative plaque stood on the site. The superintendent's residence had become dangerously derelict and the chapel was empty but kept maintained and secured by its owners Epsom and Ewell Borough Council. The Horton Haven continues to provide psychiatric services on the site.
References
Former psychiatric hospitals in England
Hospitals in Surrey
Defunct hospitals in England
Epsom
Military hospitals in the United Kingdom
|
```c++
//CuraEngine is released under the terms of the AGPLv3 or higher.
#include "WideningBeadingStrategy.hpp"
namespace Slic3r::Arachne
{
WideningBeadingStrategy::WideningBeadingStrategy(BeadingStrategyPtr parent, const coord_t min_input_width, const coord_t min_output_width)
: BeadingStrategy(*parent)
, parent(std::move(parent))
, min_input_width(min_input_width)
, min_output_width(min_output_width)
{
}
std::string WideningBeadingStrategy::toString() const
{
return std::string("Widening+") + parent->toString();
}
WideningBeadingStrategy::Beading WideningBeadingStrategy::compute(coord_t thickness, coord_t bead_count) const
{
if (thickness < optimal_width) {
Beading ret;
ret.total_thickness = thickness;
if (thickness >= min_input_width) {
ret.bead_widths.emplace_back(std::max(thickness, min_output_width));
ret.toolpath_locations.emplace_back(thickness / 2);
ret.left_over = 0;
} else
ret.left_over = thickness;
return ret;
} else
return parent->compute(thickness, bead_count);
}
coord_t WideningBeadingStrategy::getOptimalThickness(coord_t bead_count) const
{
return parent->getOptimalThickness(bead_count);
}
coord_t WideningBeadingStrategy::getTransitionThickness(coord_t lower_bead_count) const
{
if (lower_bead_count == 0)
return min_input_width;
else
return parent->getTransitionThickness(lower_bead_count);
}
coord_t WideningBeadingStrategy::getOptimalBeadCount(coord_t thickness) const
{
if (thickness < min_input_width)
return 0;
coord_t ret = parent->getOptimalBeadCount(thickness);
if (thickness >= min_input_width && ret < 1)
return 1;
return ret;
}
coord_t WideningBeadingStrategy::getTransitioningLength(coord_t lower_bead_count) const
{
return parent->getTransitioningLength(lower_bead_count);
}
float WideningBeadingStrategy::getTransitionAnchorPos(coord_t lower_bead_count) const
{
return parent->getTransitionAnchorPos(lower_bead_count);
}
std::vector<coord_t> WideningBeadingStrategy::getNonlinearThicknesses(coord_t lower_bead_count) const
{
std::vector<coord_t> ret;
ret.emplace_back(min_output_width);
std::vector<coord_t> pret = parent->getNonlinearThicknesses(lower_bead_count);
ret.insert(ret.end(), pret.begin(), pret.end());
return ret;
}
} // namespace Slic3r::Arachne
```
|
Sentinel is the third album by Nigel Mazlyn Jones, full title "Sentinel & The Fools of the Finest Degree". The album was recorded in February and March 1979 at Millstream Studios, Cheltenham, produced by Nigel Mazlyn Jones and engineered by John Acock and Mick Dolan. It includes contributions by regular collaborator Johnny Coppin and then-members of Coppin's band (Phil Beer, Steve Hutt and Mick Candler).
The original LP was split into two sections - "Sentinel" on side one, and "Fools of the Finest Degree" on side two.
The album was reissued on CD in 2008 by Kissing Spell Records (catalogue number KSCD957) with additional tracks.
Track listing
All tracks composed by Nigel Mazlyn Jones.
"Sentinel"
"All in the Name of Love"
"Sentinel"
"Flying"
"Roll Away"
"Fools of the Finest Degree"
"Water Road"
"All in All"
"Fools"
"The Wheel"
Additional tracks on CD reissue:
"Takes Two to Make It"
"The Hills of Celt"
"Baby This Time"
"All My Friends"
"Which Way to the Sea?"
"It Was All in the Name of Love" (instrumental)
Personnel
(taken from original LP release)
Nigel Mazlyn Jones - guitars, vocals
Mick Candler - drums, percussion
Steve Hutt - bass
Pete "Bimbo" Acock - saxophone
Dik Cadbury - guitar, vocals
Johnny Coppin - piano
Rob Lloyd - guitar
Phil Beer - violin, vocals
Chris Kerridge - bass, guitar
Dave Titley - guitar, vocals
Paul Anastasi - synthesizer
Sentinel and The Fools of the Finest Degree
1979 albums
|
Paula Grogger (12 July 1892 in Öblarn - 1 January 1984 in Öblarn) was an Austrian writer.
Life
Paula Grogger was the daughter of the merchant Franz Grogger and his wife Maria from Öblarn in Styria. From 1907 to 1912, she attended the teachers training college of the Ursuline nuns in Salzburg. She was one of the few women at the time to take the Austrian matriculation examination, the Matura. She then returned to Styria and taught the Enns handicrafts until 1929.
He first novel, The Grimmingtor (1926), was a triumphant success and drew a picture of the Styrian landscape with the symbol of the mountain Grimming. The style, the criticism was simply, dialect and yet strong. Similar to the work of Enrica von Handel-Mazzetti, the novel was still independent, with hearty humor and restrained tragedy and high above the common literature. The book was repeatedly translated and republished.
Grogger belonged to the illegal Nazi Bund of German writers in Austria. After the Austrian Annexation, in 1938, she paid homage to Adolf Hitler in the Confession book of German poets. When the Gestapo, however, concerning Grogger's political stance, presented a request to the District Administrator of Gröbming, he replied on 6 November 1939: "To this day she made no positive contribution to National Socialism."
In 1952, she was awarded the Peter Rosegger Prize of the province of Styria. In 1966 she was appointed as a professor. She received honors including the Poet Steinschild of 1999, the Enrica-Handel-Mazzetti-special prize, the Silver Archduke Johann plaque, and the Ring of Honor of Styria.
She was deeply religious and interested in folklore, and was also involved in community theatre.
In 1980, she retired from literary activity at the age of 88 years, and she died at 91 years old, in her house in Öblarn, which serves today as a museum.
Works
1917 Das Christkindl im Steirerland
1926 Das Grimmingtor
1927 Die Sternsinger, Das Gleichnis von der Weberin
1929/1977 Räuberlegende
1932 Das Röcklein des Jesuskindes
1933 Das Spiel von Sonne, Mond und Sternen
1935 Der Lobenstock
1937/1967 Die Hochzeit. Ein Spiel vom Prinzen Johann (ein Stück über Erzherzog Johann)
1947/1962 Bauernjahr
1949 Der Antichrist und unsere Liebe Frau
1954 Gedichte
1958 Die Mutter,Die Reise nach Salzburg
1962 Aus meinem Paradeisgarten
1975 Späte Matura oder Pegasus im Joch
1977 Der himmlische Geburtstag, Sieben Legenden, Die Räuberlegende
1980 Der Paradeisgarten
1983 Geschichte der Kindheit
Without date:
Die Reise nach Brixen, Gestrickte Zirkuswelt, Die selige Jugendzeit, Vom Leben das Beste, Kinderszenen
Die Legende von der Mutter, Die Legende vom Rabenknaeblein, Ein Stück aus meinem Garten
Da Tag is' vorbei (Liedtext, Weise und Satz: Lorenz Maierhofer)
Awards
1936 Austrian Cross of Merit for Arts and Science and Art 1st class
December 1961 Ring of Honor of Styria
1968 Poet Steinschild of 1999 because Nazi revivalism prohibited association with the extreme right-wing cultural association poet stone Offenhausen
References
External links
1892 births
1984 deaths
20th-century Austrian writers
German-language writers
20th-century Austrian novelists
Austrian women writers
20th-century women writers
|
The siege of Inverness of 1650 was part of the Scottish Civil War that formed part of the Wars of the Three Kingdoms. Lewis Gordon, 3rd Marquess of Huntly, who was operating under the leadership of the royalist James Graham, 1st Marquess of Montrose, unsuccessfully laid siege to Inverness Castle which was being held by Covenanters of the Clan Fraser of Lovat under Sir James Fraser of Brea.
References
Inverness
Inverness
History of Inverness
1650 in Scotland
Inverness 1650
|
Relatively Speaking: Poems About Family is a young adult book of poetry by Ralph Fletcher, illustrated by Walter Lyon Krudop. It was first published in 1999.
Summary
The youngest boy describes both his family and their life together through verse. Various scenes include how the family prepare corn on the cob, his other brothers accident, the family reunion, his seldom seen cousin, and his uncle's funeral.
Style
Relatively Speaking: Poems About Family has been described as a novel-in-verse.
Reception
Kristen Oravec said in her review for School Library Journal that "the selections are striking in their simplicity, universal themes, and realistic voice. Pen-and-ink line drawings detail items ranging from a favorite quilt to a water bucket and sponge used to wash the car. Ultimately, these pieces connect throughout the book and show how individuals mesh to become a family." Rachel E. Schwedt and Janice DeLong in their book Young Adult Poetry said that "in a day when the family is struggling to find identity and purpose as a unit, Fletcher and Krudop have provided the missing piece for readers of all ages and of all families in this keepsake of a book."
Notes
External links
Ralph Fletcher's website
Walter Lyon Krudop's website
1999 children's books
1999 poetry books
American poetry collections
Young adult poetry books
Children's books about families
|
```ruby
require 'spec_helper'
require 'cfn-nag/template_discovery'
require 'tempfile'
require 'fileutils'
require 'set'
describe TemplateDiscovery do
before(:each) do
@template_discovery = TemplateDiscovery.new
end
describe '#discover_templates' do
context 'illegitimate path' do
it 'raises an error' do
expect do
@template_discovery.discover_templates input_json_path: '/an/impossible/path/to/find'
end.to raise_error '/an/impossible/path/to/find is not a proper path'
end
end
context 'input path is file' do
it 'returns array with filename' do
Tempfile.open('/foo') do |tempfile|
actual_templates = @template_discovery.discover_templates(
input_json_path: tempfile.path
)
expected_templates = [tempfile.path]
expect(actual_templates).to eq expected_templates
end
end
end
context 'input path is directory with json, template, yaml, yml' do
it 'returns array with matching files' do
begin
temp_directory = "/tmp/testing#{Time.now.to_i}"
FileUtils.mkdir_p "#{temp_directory}/secondlevel"
File.open("#{temp_directory}/secondlevel/foo1.yml", 'w+') do |f|
f.write 'foo1'
end
File.open("#{temp_directory}/secondlevel/foo2.yaml", 'w+') do |f|
f.write 'foo2'
end
File.open("#{temp_directory}/foo3.template", 'w+') do |f|
f.write 'foo3'
end
File.open("#{temp_directory}/foo4.json", 'w+') { |f| f.write 'foo4' }
File.open("#{temp_directory}/foo5", 'w+') { |f| f.write 'foo5' }
actual_templates = @template_discovery.discover_templates(
input_json_path: temp_directory
)
expected_templates = %W[
#{temp_directory}/secondlevel/foo1.yml
#{temp_directory}/secondlevel/foo2.yaml
#{temp_directory}/foo3.template
#{temp_directory}/foo4.json
]
expect(Set.new(actual_templates)).to eq Set.new(expected_templates)
ensure
FileUtils.rm_rf temp_directory
end
end
end
end
end
```
|
Buniapone is a monotypic genus of ants in the subfamily Ponerinae. Buniapone amblyops, the single described species, is found in Southern and Southeast Asia.
Etymology
The genus name is derived from orang bunian, supernatural forest-living beings in Malay folklore, with the suffix -pone from the name of subfamily.
Taxonomy
The genus was established by Schmidt & Shattuck (2014) to house the single species Ponera amblyops (at the time a junior synonym Pachycondyla amblyops), which was first described by Emery (1887) from worker specimen from the Indonesian island of Sumatra. The type species has a long and complicated taxonomic history, variously belonging to the genera Ponera, Trapeziopelta (now Myopias), Belonopelta, Pachycondyla, Pseudoponera, Euponera and Pachycondyla. One subspecies, B. amblyops oculatior from Indonesia, has been described. Molecular phylogeny by Schmidt (2013) resolved Buniapone as a sister to the strictly African genus Paltothyreus.
Distribution
The genus is distributed in Southern and Southeast Asia, from China to Indonesia and India.
Description
Little is known about their biology, but they have a subterranean lifestyle and are thought to be predators, although not strictly carnivorous. Workers are medium in size (5.5–6.5 mm), orange-colored, and have long and narrow mandibles with seven teeth. Queens are similar to the workers, but larger (9.25 mm). Buniapone is morphologically similar to some Cryptopone and Promyopias species. However, Buniapone is more closely related to other species and the similarities are deemed to have evolved through convergent evolution.
References
External links
Ponerinae
Monotypic ant genera
Hymenoptera of Asia
|
The Colt Lightning Carbine or Colt Lightning Rifle was a slide-action (pump-action) rifle manufactured by Colt from 1884 until 1904 and was originally chambered in .44-40 caliber. Colt eventually made the Lightning Rifle in three different frame sizes, to accommodate a wide range of cartridges, from .22 Short caliber and .38-40 to .50-95 Express. Its profile resembles the pump-action rimfire rifles made by the Winchester Repeating Arms Company and Remington Arms. The Lightning saw use as a sporting arm in America and was adopted for use by the San Francisco Police Department, but was never as popular or as reliable as the various lever-action rifles of its day.
Variants
The medium-frame Colt Lightning Magazine Rifle was manufactured between 1884 and 1904. It was the first slide-action rifle offered by Colt. Colt records indicate 89,777 were produced, in .32-20, .38-40, and .44-40 as a companion arm to the Colt Single Action Army revolver. Two versions were offered: a rifle with a barrel and 15-round magazine, and a carbine with a barrel and 12-round magazine. The San Francisco Police Department acquired 401 rifles all of which had round .44-40 barrels and bore S.F.P 1 through S.F.P 401 stampings on the lower tang.
The small-frame Lightning (also referred to as "Second Model Colt Lightning") was the first rimfire rifle made by Colt and was manufactured between 1887 and 1904 as a plinking and gallery gun. Colt records indicate 89,912 were made, in .22 Short and .22 Long. Barrel length was and the rifles had a blued finish, case-hardened hammer, and a walnut stock.
The large-frame Lightning (also called the "Express Model") was manufactured between 1887 and 1894. Colt records indicate 6,496 were made in different big game calibers such as .38-56 WCF, .40-60 and .50-95 Express. Barrel length was .
Modern versions
Reproduction Lightning rifles are still manufactured today by companies such as Uberti, Taurus, and Pedersoli for hunting, historical reenactment, and competition purposes such as Cowboy Action Shooting in calibers such as .38 Special/.357 Magnum, .44-40, and .45 Colt. Of these calibers, only the .44-40 was offered in the Lightning when it was originally produced by Colt.
See also
Colt-Burgess rifle
References
External links
Pedersoli Lightning page
Colt rifles
Rifles of the United States
Pump-action rifles
Guns of the American West
Carbines
|
```python
#!/usr/bin/env python2
from __future__ import print_function
import cgi
import unittest
class FuncsTest(unittest.TestCase):
def testHtmlEscape(self):
s = '<script>"This" isn\'t right</script>'
print(cgi.escape(s))
# Hm I think you're supposed to escape ' too
print(cgi.escape(s, quote=True))
# Python 3 enhanced this to take a dict
# path_to_url#str.maketrans
# We should write our own
d = {'<': '<'}
#t = string.maketrans(['a', 'b'], ['aa', 'bb'])
#print(t)
if __name__ == '__main__':
unittest.main()
```
|
Imiligaarjuk Island is one of several Canadian arctic islands in Nunavut, Canada within western Hudson Bay. The closest community is Whale Cove, to the west.
References
Islands of Hudson Bay
Uninhabited islands of Kivalliq Region
|
DC Studios (formerly known as DC Films) is an American film, television, and animation studio that is a division of Warner Bros., which is a subsidiary of Warner Bros. Discovery (WBD). It is dedicated to the production of films, series, and animations based on characters from DC Comics, among them is their flagship franchise, the DC Extended Universe (DCEU). James Gunn and Peter Safran assumed control of the company, on November 1, 2022. Previously, Walter Hamada was the president of DC Films from 2018 until his departure in October 2022.
The studio's films Aquaman (2018) and Joker (2019) are among the 50 highest-grossing films of all time, with Joker becoming the first R-rated film to gross over $1 billion. In addition to the DCU, DC Studios was also involved with the production of other DC-character film franchises that have exceeded $1 billion in North American box office revenue, including Superman, Batman and Wonder Woman multi-film franchises.
Background
National era
During DC's National era, the company licensed Superman, Batman and Wonder Woman (and other All-American Comics characters) to Republic Pictures, Paramount Pictures, 20th Century Fox and Columbia Pictures for advertising serials, shorts and feature films. Other comic characters, such as Fawcett Comics' Shazam and Quality Comics' Plastic Man (which ultimately sold to DC), also had a serial short.
Warner Communications era
After the release of the first feature-length Batman film, Kinney National Company (later Warner Communications) purchased National Comics Publications in 1967 and then Warner Bros.-Seven Arts in 1969. This purchase meant that the comic company's television and theatrical distribution turned over to Warner Bros., which led to the launch films and television series based on DC characters. In the late 1980s Warner Bros. acquired a full distribution rights after the release of the Superman and Swamp Thing films. The Batman films once again marked a return to the big screen.
History
DC Films
After the divisive reception of Batman v Superman: Dawn of Justice, Warner Bros. Pictures made moves to stabilize the direction of the DC Extended Universe. The studio reorganized in May 2016 to have genre-responsible film executives, thus DC Entertainment franchise films under Warner Bros. were placed under a newly created division, DC Films, created under Warner Bros. executive vice president Jon Berg and DC Comics chief content officer Geoff Johns. This was done in hopes of competing more directly with Marvel Studios' Marvel Cinematic Universe. Johns also kept his existing role at DC Comics. However, the division's formation was not designed to override the "director-driven" mandate.
Justice League had one of the biggest film budgets (nearly $300 million) but grossed about $96 million in its opening weekend. An analysis in The Washington Post expected that there would be a course correction again, with a possible change in leadership. Forbes contributors felt that the course correction would be for DC Films to give up on the shared universe, while continuing with the Wonder Woman films and occasionally other films, as Warner Bros. has other franchises they can work with. Despite this, in December the studio reiterated their current film slate for the unofficially titled DC Extended Universe. That same month, Warner Bros. announced that a new strategy and organization of DC Films would occur with Berg leaving his position as studio's co-president of production to form a Warner Bros.-based production company with Roy Lee, the producer of The Lego Movie and It. In January 2018, Warner Bros. executive Walter Hamada was appointed as new president of DC Films, to oversee the films in the DC Extended Universe. Hamada was closely associated with New Line Cinema, and helped develop horror films, such as It and The Conjuring film franchises.
Restructuring
In April 2022, after the merger between WarnerMedia and Discovery, Inc. to form Warner Bros. Discovery, the new CEO David Zaslav was exploring a restructuring of DC Entertainment, including having a creative leader akin to Marvel Studios president Kevin Feige to lead its film and television projects. Later in July, Toby Emmerich stepped down as the head of the Warner Bros. Motion Picture Group. The group was restructured to give DC Films, Warner Bros. Pictures, New Line Cinema, and Warner Animation Group respective leadership. Former MGM executives Michael De Luca and Pamela Abdy became the co-executives of Warner Bros. Pictures and New Line Cinema. They were also temporarily signed to oversee the remaining units of the group until the new positions were filled.
When the release of the film Batgirl was canceled by Warner Bros. Discovery in August, Hamada was reportedly not consulted regarding the decision and only learned about it when De Luca and Abdy informed him at a test screening for Black Adam (2022). Hamada was upset and considered resigning, but agreed to stay until Black Adam release. Later that month, Dan Lin entered talks to oversee DC's film and television divisions. From this position, Lin was expected to report directly to Zaslav, while Hamada would depart the studio. In September, Lin and Warner Bros. Discovery ended negotiations and agreed to part ways. During Black Adam Times Square premiere in October, star and producer Dwayne Johnson said he could be a consultant at DC Films, helping the studio find its next creative leader. Later that month, it was reported that De Luca had been effectively running DC Films in place of Walter Hamada. On October 19, Hamada departed from the company, just two days before the release of Black Adam.
DC Studios
Shortly after Hamada left the CEO position, James Gunn and Peter Safran (who previously worked together on James Gunn's PG Porn and The Suicide Squad) were revealed to serve as the co-CEOs/co-chairmen of the studio and DC Films was rebranded as "DC Studios". The duo was tasked to oversee production on films, television, and animation under the DC label, reporting directly to David Zaslav, while also working alongside but independently of heads of other divisions. Gunn oversees the creative development on DC projects, while Safran oversees the production side. Their roles began effectively on November 1 the same year.
In November, Gunn said that the studio would focus on multiple DCU live-action and animated projects, but also stated that they would acknowledge fan responses and complaints, and confirmed all subsequent DC projects would be released under the DC Studios banner, including those that were filmed prior to the rebranding. In December of the same year, Gunn and Henry Cavill announced that Cavill would no longer return as Superman in any future projects. Gunn also announced that he was writing a new Superman film, based on a younger version of the character. Ben Affleck (who previously portrayed Bruce Wayne/Batman) was also said to be in talks to direct a new DC Studios project, but Affleck himself would later state that he was not directing any film for DC. Gunn later revealed that new DC films would have an equal focus on popular and obscure characters, drawing inspiration from the DC animated series Justice League Unlimited and Young Justice.
Gunn and Safran announced the first chapter of their universe titled "Gods and Monsters" on January 31, 2023. They also assembled a writers' room featuring Drew Goddard, Jeremy Slater, Christina Hodson, Christal Henry, and Tom King. Projects that are not a part of the shared universe will be branded as "DC Elseworlds". The following month, Gunn confirmed development for animated films both within the DCU and Elseworlds brands. Gunn said in March that they were working on potentially incorporating characters from DC's Vertigo Comics imprint beyond the Swamp Thing film, and said the following month that there were plans to incorporate characters from the DC-owned Milestone Media, such as Static.
Management
Current
James Gunn: Co-chairman and Co-chief executive officer (CEO), DC Studios; Gunn serves in leadership as creative head for the company (November 2022–present).
Peter Safran: Co-chairman and Co-chief executive officer (CEO), DC Studios; Safran serves in leadership over the business aspects of the company (November 2022–present).
Chantal Nong: Executive Vice President (EVP), DC Studios (November 2022–present); formerly Senior Vice President, Feature Development and Production of DC Films, overseeing creative development and production management of DC-based films (February 2018–November 2022).
Candice McDonough: Executive Vice President (EVP), Publicity and Communications; McDonough oversees media relations, publicity, and external and employee communications (July 2023–present).
Galen Vaisman: Vice President (VP), Creative Development.
Former
Jon Berg: Former Executive Vice President (EVP), Warner Bros. Pictures, former co-chairman of DC Films, and former co-runner of the DCEU (May 2016 – December 2017).
Geoff Johns: Former Co-chairman of DC Films (May 2016 – December 2017), former president and Chief Creative Officer, DC Entertainment (February 2010 – June 2018), and former co-runner of the DCEU (2015 – June 2018).
Walter Hamada: Former President, DC-Based Film Production, Warner Bros. Pictures (January 2018 – October 2022).
Production library
Films
Live-action
Animation
Television
Live-action
Animation
Notes
See also
DC Entertainment
List of films based on DC Comics publications
List of unproduced DC Comics projects
Marvel Studios
References
External links
DC Studios
2016 establishments in California
American companies established in 2016
Companies based in Burbank, California
DC Entertainment
Warner Bros. divisions
Mass media companies established in 2016
Film production companies of the United States
|
```yaml
sample:
description: minimal sample, the smallest possible Zephyr application
name: minimal
common:
tags: footprint
harness: console
harness_config:
type: one_line
regex:
- "Hello World from minimal!"
tests:
sample.minimal.mt.arm:
extra_args: CONF_FILE='common.conf;mt.conf;arm.conf'
build_only: true
platform_allow:
- reel_board
- frdm_k64f
- mps2/an385
- nrf51dk/nrf51822
- nucleo_f429zi
- disco_l475_iot1
integration_platforms:
- frdm_k64f
sample.minimal.mt-no-preempt.arm:
extra_args: CONF_FILE='common.conf;mt.conf;no-preempt.conf;arm.conf'
build_only: true
platform_allow:
- reel_board
- frdm_k64f
- mps2/an385
- nrf51dk/nrf51822
- nucleo_f429zi
- disco_l475_iot1
sample.minimal.mt-no-preempt-no-timers.arm:
extra_args: CONF_FILE='common.conf;mt.conf;no-preempt.conf;no-timers.conf;arm.conf'
build_only: true
platform_allow:
- reel_board
- frdm_k64f
- mps2/an385
- nrf51dk/nrf51822
- nucleo_f429zi
- disco_l475_iot1
sample.minimal.no-mt.arm:
extra_args: CONF_FILE='common.conf;no-mt.conf;arm.conf'
build_only: true
platform_allow:
- reel_board
- frdm_k64f
- mps2/an385
- nrf51dk/nrf51822
- nucleo_f429zi
- disco_l475_iot1
sample.minimal.no-mt-no-timers.arm:
extra_args: CONF_FILE='common.conf;no-mt.conf;no-timers.conf;arm.conf'
build_only: true
platform_allow:
- reel_board
- frdm_k64f
- mps2/an385
- nrf51dk/nrf51822
- nucleo_f429zi
- disco_l475_iot1
sample.minimal.mt.x86:
extra_args: CONF_FILE='common.conf;mt.conf;x86.conf'
build_only: true
platform_allow: qemu_x86
sample.minimal.mt-no-preempt.x86:
extra_args: CONF_FILE='common.conf;mt.conf;no-preempt.conf;x86.conf'
build_only: true
platform_allow: qemu_x86
sample.minimal.mt-no-preempt-no-timers.x86:
extra_args: CONF_FILE='common.conf;mt.conf;no-preempt.conf;no-timers.conf;x86.conf'
build_only: true
platform_allow: qemu_x86
sample.minimal.no-mt.x86:
extra_args: CONF_FILE='common.conf;no-mt.conf;x86.conf'
build_only: true
platform_allow: qemu_x86
sample.minimal.no-mt-no-timers.x86:
extra_args: CONF_FILE='common.conf;no-mt.conf;no-timers.conf;x86.conf'
build_only: true
platform_allow: qemu_x86
sample.minimal.arc.runtime:
extra_args:
- CONF_FILE='common-runtime.conf;no-timers.conf'
arch_allow: arc
tags:
- kernel
integration_platforms:
- qemu_arc/qemu_arc_em
sample.minimal.riscv.runtime:
extra_args:
- CONF_FILE='common-runtime.conf;no-timers.conf;no-mt.conf;riscv.conf'
platform_allow: qemu_riscv32
tags:
- kernel
integration_platforms:
- qemu_riscv32
```
|
The Speaker of the Legislative Assembly of Manitoba is the presiding officer of the provincial legislature.
List of speakers of the Legislative Assembly of Manitoba
References
Biographies of Living Members
Biographies of Deceased Members
Politics of Manitoba
Manitoba
|
The Top Gun House, formerly known as the Graves House, is a historic landmark in Oceanside, California known for being the location in a scene in the 1986 action drama film Top Gun, starring Tom Cruise. It was built in 1888 and utilizes Folk Victorian styles, being one of the earliest surviving examples of it in San Diego County. As of 2023, it is in possession of the Mission Pacific Hotel and contains a pie shop.
History
The lot was first purchased in 1886 by Dr. Henry Graves, a surgeon from Ohio, for $1,050 (). It was to be used as a seasonal summer home for him and his wife Sarah and was completed in 1888. They continued to summer there until March 1905 when they sold it to Charles and Lillian Burlock. The Burlocks sold the building to Southwestern Realty in 1910 and it was purchased again in 1921 by F.C. Janssen. The Graves continued to be associated with the house until 1914, with locals still calling it the "Graves' cottage" until then. B.C. and Margaret Beers bought the building in 1926, selling it to Edward and Edith Deggendorf and Angeline G. Morgan in 1928 and 1929, respectively. Her son rented the house until 1966, sharing it with his family before selling it to an amusement park on the beach, called Pacific Holidayland, which closed in 1983.
The house soon fell into disrepair but was bought again by Lynn and William Rego in December 1975, for $75,000. They repainted the originally brown house to its signature blue color. The Regos were contacted by Paramount Pictures, who were looking for a beach cottage as a film location, in 1985. The studio rented the house and the one behind it for two weeks in June and was prepared by the crew by removing road signs and covering curbs with sand. In Top Gun, the house was used as the main love interest, Charlie Blackwood's (played by Kelly McGillis) dwelling.
The cottage was included in a Cultural Resource Survey in 1992, being noted as "one of the few 1880s beach cottages remaining in near-pristine condition." In 2001, the Save Our Heritage Organisation listed the building in its Most Endangered List of Historic Resources due to a hotel planned to be constructed on the block. In preparation for a new hotel, the block that held the house was cleared, destroying three other historic houses, including the one behind the Top Gun House that appeared in the film. A fourth, called the Pishon house, was saved by relocation. The Oceanside Historical Society helped maintain the house and put up a sign informing tourists and passersby about the historical significance of the house. A fence had to be erected in 2009 to prevent intentional damage to the house, as multiple people had been breaking in.
S.D. Malkin Properties, Inc. announced that the house was to be restored and be used as the "centerpiece" of a new resort. It was relocated and restored a block north of its original location in the courtyard of the new Mission Pacific Hotel in 2020, reopening on May 20, 2022, a week before the release of Top Gun: Maverick, the movie's sequel. The restoration cost almost $1 million. It is home to a pie shop, called High-Pie, and some Top Gun memorabilia. A replica of the Kawasaki GPZ900R Tom Cruise rides in the movie is displayed in front of the house as well.
High-Pie
High-Pie, which opened in 2022, is the pie shop located in the house. It was created by Tara Lazar, a native of Palm Springs. There, she owns three restaurants, two bars, a hotel, and a catering company. A dessert concept worked best in comparison to the shop's small size and both Lazar and Scott Malkin, the owner of the hotel, were fans of apple pie. It is open from 10AM to 8PM daily. The shop offers pies in apple, cherry, blueberry, lemon, and peach flavors, with Pie à la Modes and a variety of themed beverages. It also sells merchandise themed after the shop.
Notes
References
1888 establishments in California
Restaurants in San Diego County, California
Top Gun
Oceanside, California
|
Magne “Kris” Kristiansen (April 14, 1932 - May 9, 2017) was an electrical engineer and the P. W. Horn Professor and Emeritus Professor at Texas Tech University, formerly the C. B. Thornton Professor from 1990 to 2009. He is member of the National Society of Professional Engineers, American Physical Society, American Association for the Advancement of Science, Institute of Electrical and Electronics Engineers (Life Fellow) and Russian Academy of Science.
Early life
Born to parents Ella and Martin Kristiansen in Elverum, Norway, he joined the Royal Norwegian Air Force in 1950. Upon leaving the Air Force, he came to the US where he completed a doctorate in Electrical Engineering at the University of Texas.
References
1932 births
2017 deaths
People from Elverum
American electrical engineers
Texas Tech University faculty
Cockrell School of Engineering alumni
Royal Norwegian Air Force personnel
Fellows of the American Physical Society
|
```sqlpl
--
-- PostgreSQL database dump
--
-- Dumped from database version 10.1
-- Dumped by pg_dump version 11.1
SET statement_timeout = 0;
SET lock_timeout = 0;
SET idle_in_transaction_session_timeout = 0;
SET client_encoding = 'UTF8';
SET standard_conforming_strings = on;
SELECT pg_catalog.set_config('search_path', '', false);
SET check_function_bodies = false;
SET client_min_messages = warning;
SET row_security = off;
--
-- Name: schema-generator$prisma-3143; Type: SCHEMA; Schema: -; Owner: -
--
CREATE SCHEMA "schema-generator$prisma-3143";
SET default_tablespace = '';
SET default_with_oids = false;
--
-- Name: Story; Type: TABLE; Schema: schema-generator$prisma-3143; Owner: -
--
CREATE TABLE "schema-generator$prisma-3143"."Story" (
id character varying(25) NOT NULL,
"updatedAt" timestamp(3) without time zone NOT NULL,
"createdAt" timestamp(3) without time zone NOT NULL
);
--
-- Name: UserSpace; Type: TABLE; Schema: schema-generator$prisma-3143; Owner: -
--
CREATE TABLE "schema-generator$prisma-3143"."UserSpace" (
id character varying(25) NOT NULL,
"updatedAt" timestamp(3) without time zone NOT NULL,
"createdAt" timestamp(3) without time zone NOT NULL
);
--
-- Name: _RelayId; Type: TABLE; Schema: schema-generator$prisma-3143; Owner: -
--
CREATE TABLE "schema-generator$prisma-3143"."_RelayId" (
id character varying(36) NOT NULL,
"stableModelIdentifier" character varying(25) NOT NULL
);
--
-- Name: _StoriesByUserSpace; Type: TABLE; Schema: schema-generator$prisma-3143; Owner: -
--
CREATE TABLE "schema-generator$prisma-3143"."_StoriesByUserSpace" (
"A" character varying(25) NOT NULL,
"B" character varying(25) NOT NULL
);
--
-- Name: Story Story_pkey; Type: CONSTRAINT; Schema: schema-generator$prisma-3143; Owner: -
--
ALTER TABLE ONLY "schema-generator$prisma-3143"."Story"
ADD CONSTRAINT "Story_pkey" PRIMARY KEY (id);
--
-- Name: UserSpace UserSpace_pkey; Type: CONSTRAINT; Schema: schema-generator$prisma-3143; Owner: -
--
ALTER TABLE ONLY "schema-generator$prisma-3143"."UserSpace"
ADD CONSTRAINT "UserSpace_pkey" PRIMARY KEY (id);
--
-- Name: _RelayId pk_RelayId; Type: CONSTRAINT; Schema: schema-generator$prisma-3143; Owner: -
--
ALTER TABLE ONLY "schema-generator$prisma-3143"."_RelayId"
ADD CONSTRAINT "pk_RelayId" PRIMARY KEY (id);
--
-- Name: _StoriesByUserSpace_A; Type: INDEX; Schema: schema-generator$prisma-3143; Owner: -
--
CREATE INDEX "_StoriesByUserSpace_A" ON "schema-generator$prisma-3143"."_StoriesByUserSpace" USING btree ("A");
--
-- Name: _StoriesByUserSpace_AB_unique; Type: INDEX; Schema: schema-generator$prisma-3143; Owner: -
--
CREATE UNIQUE INDEX "_StoriesByUserSpace_AB_unique" ON "schema-generator$prisma-3143"."_StoriesByUserSpace" USING btree ("A", "B");
--
-- Name: _StoriesByUserSpace_B; Type: INDEX; Schema: schema-generator$prisma-3143; Owner: -
--
CREATE INDEX "_StoriesByUserSpace_B" ON "schema-generator$prisma-3143"."_StoriesByUserSpace" USING btree ("B");
--
-- Name: _StoriesByUserSpace _StoriesByUserSpace_A_fkey; Type: FK CONSTRAINT; Schema: schema-generator$prisma-3143; Owner: -
--
ALTER TABLE ONLY "schema-generator$prisma-3143"."_StoriesByUserSpace"
ADD CONSTRAINT "_StoriesByUserSpace_A_fkey" FOREIGN KEY ("A") REFERENCES "schema-generator$prisma-3143"."Story"(id) ON DELETE CASCADE;
--
-- Name: _StoriesByUserSpace _StoriesByUserSpace_B_fkey; Type: FK CONSTRAINT; Schema: schema-generator$prisma-3143; Owner: -
--
ALTER TABLE ONLY "schema-generator$prisma-3143"."_StoriesByUserSpace"
ADD CONSTRAINT "_StoriesByUserSpace_B_fkey" FOREIGN KEY ("B") REFERENCES "schema-generator$prisma-3143"."UserSpace"(id) ON DELETE CASCADE;
--
-- PostgreSQL database dump complete
--
```
|
```kotlin
package net.corda.core.node.services
import net.corda.core.contracts.TimeWindow
import java.time.Clock
/**
* Checks if the current instant provided by the input clock falls within the provided time-window.
*/
@Deprecated("This class is no longer used")
class TimeWindowChecker(val clock: Clock = Clock.systemUTC()) {
fun isValid(timeWindow: TimeWindow): Boolean = clock.instant() in timeWindow
}
```
|
```python
`Module`s everywhere!
`set` operations
Enhance your `tuple`s
Get the most of `float`s
Binary record packing with `bytearray`
```
|
```go
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
//go:build linux && (ppc64 || ppc64le)
// +build linux
// +build ppc64 ppc64le
package unix
//sys EpollWait(epfd int, events []EpollEvent, msec int) (n int, err error)
//sys Fadvise(fd int, offset int64, length int64, advice int) (err error) = SYS_FADVISE64
//sys Fchown(fd int, uid int, gid int) (err error)
//sys Fstat(fd int, stat *Stat_t) (err error)
//sys Fstatat(dirfd int, path string, stat *Stat_t, flags int) (err error) = SYS_NEWFSTATAT
//sys Fstatfs(fd int, buf *Statfs_t) (err error)
//sys Ftruncate(fd int, length int64) (err error)
//sysnb Getegid() (egid int)
//sysnb Geteuid() (euid int)
//sysnb Getgid() (gid int)
//sysnb Getrlimit(resource int, rlim *Rlimit) (err error) = SYS_UGETRLIMIT
//sysnb Getuid() (uid int)
//sys Ioperm(from int, num int, on int) (err error)
//sys Iopl(level int) (err error)
//sys Lchown(path string, uid int, gid int) (err error)
//sys Listen(s int, n int) (err error)
//sys Lstat(path string, stat *Stat_t) (err error)
//sys Pause() (err error)
//sys pread(fd int, p []byte, offset int64) (n int, err error) = SYS_PREAD64
//sys pwrite(fd int, p []byte, offset int64) (n int, err error) = SYS_PWRITE64
//sys Renameat(olddirfd int, oldpath string, newdirfd int, newpath string) (err error)
//sys Seek(fd int, offset int64, whence int) (off int64, err error) = SYS_LSEEK
//sys Select(nfd int, r *FdSet, w *FdSet, e *FdSet, timeout *Timeval) (n int, err error) = SYS__NEWSELECT
//sys sendfile(outfd int, infd int, offset *int64, count int) (written int, err error)
//sys setfsgid(gid int) (prev int, err error)
//sys setfsuid(uid int) (prev int, err error)
//sysnb Setregid(rgid int, egid int) (err error)
//sysnb Setresgid(rgid int, egid int, sgid int) (err error)
//sysnb Setresuid(ruid int, euid int, suid int) (err error)
//sysnb Setrlimit(resource int, rlim *Rlimit) (err error)
//sysnb Setreuid(ruid int, euid int) (err error)
//sys Shutdown(fd int, how int) (err error)
//sys Splice(rfd int, roff *int64, wfd int, woff *int64, len int, flags int) (n int64, err error)
//sys Stat(path string, stat *Stat_t) (err error)
//sys Statfs(path string, buf *Statfs_t) (err error)
//sys Truncate(path string, length int64) (err error)
//sys Ustat(dev int, ubuf *Ustat_t) (err error)
//sys accept4(s int, rsa *RawSockaddrAny, addrlen *_Socklen, flags int) (fd int, err error)
//sys bind(s int, addr unsafe.Pointer, addrlen _Socklen) (err error)
//sys connect(s int, addr unsafe.Pointer, addrlen _Socklen) (err error)
//sysnb getgroups(n int, list *_Gid_t) (nn int, err error)
//sysnb setgroups(n int, list *_Gid_t) (err error)
//sys getsockopt(s int, level int, name int, val unsafe.Pointer, vallen *_Socklen) (err error)
//sys setsockopt(s int, level int, name int, val unsafe.Pointer, vallen uintptr) (err error)
//sysnb socket(domain int, typ int, proto int) (fd int, err error)
//sysnb socketpair(domain int, typ int, proto int, fd *[2]int32) (err error)
//sysnb getpeername(fd int, rsa *RawSockaddrAny, addrlen *_Socklen) (err error)
//sysnb getsockname(fd int, rsa *RawSockaddrAny, addrlen *_Socklen) (err error)
//sys recvfrom(fd int, p []byte, flags int, from *RawSockaddrAny, fromlen *_Socklen) (n int, err error)
//sys sendto(s int, buf []byte, flags int, to unsafe.Pointer, addrlen _Socklen) (err error)
//sys recvmsg(s int, msg *Msghdr, flags int) (n int, err error)
//sys sendmsg(s int, msg *Msghdr, flags int) (n int, err error)
//sys mmap(addr uintptr, length uintptr, prot int, flags int, fd int, offset int64) (xaddr uintptr, err error)
//sys futimesat(dirfd int, path string, times *[2]Timeval) (err error)
//sysnb Gettimeofday(tv *Timeval) (err error)
//sysnb Time(t *Time_t) (tt Time_t, err error)
//sys Utime(path string, buf *Utimbuf) (err error)
//sys utimes(path string, times *[2]Timeval) (err error)
func setTimespec(sec, nsec int64) Timespec {
return Timespec{Sec: sec, Nsec: nsec}
}
func setTimeval(sec, usec int64) Timeval {
return Timeval{Sec: sec, Usec: usec}
}
func (r *PtraceRegs) PC() uint64 { return r.Nip }
func (r *PtraceRegs) SetPC(pc uint64) { r.Nip = pc }
func (iov *Iovec) SetLen(length int) {
iov.Len = uint64(length)
}
func (msghdr *Msghdr) SetControllen(length int) {
msghdr.Controllen = uint64(length)
}
func (msghdr *Msghdr) SetIovlen(length int) {
msghdr.Iovlen = uint64(length)
}
func (cmsg *Cmsghdr) SetLen(length int) {
cmsg.Len = uint64(length)
}
func (rsa *RawSockaddrNFCLLCP) SetServiceNameLen(length int) {
rsa.Service_name_len = uint64(length)
}
//sys syncFileRange2(fd int, flags int, off int64, n int64) (err error) = SYS_SYNC_FILE_RANGE2
func SyncFileRange(fd int, off int64, n int64, flags int) error {
// The sync_file_range and sync_file_range2 syscalls differ only in the
// order of their arguments.
return syncFileRange2(fd, flags, off, n)
}
//sys kexecFileLoad(kernelFd int, initrdFd int, cmdlineLen int, cmdline string, flags int) (err error)
func KexecFileLoad(kernelFd int, initrdFd int, cmdline string, flags int) error {
cmdlineLen := len(cmdline)
if cmdlineLen > 0 {
// Account for the additional NULL byte added by
// BytePtrFromString in kexecFileLoad. The kexec_file_load
// syscall expects a NULL-terminated string.
cmdlineLen++
}
return kexecFileLoad(kernelFd, initrdFd, cmdlineLen, cmdline, flags)
}
```
|
```html
<!DOCTYPE html><html class="default" lang="en"><head><meta charSet="utf-8"/><meta http-equiv="x-ua-compatible" content="IE=edge"/><title>DO_NOT_USE_OR_YOU_WILL_BE_FIRED_CALLBACK_REF_RETURN_VALUES | @xarc/react</title><meta name="description" content="Documentation for @xarc/react"/><meta name="viewport" content="width=device-width, initial-scale=1"/><link rel="stylesheet" href="../assets/style.css"/><link rel="stylesheet" href="../assets/highlight.css"/><script defer src="../assets/main.js"></script><script async src="../assets/icons.js" id="tsd-icons-script"></script><script async src="../assets/search.js" id="tsd-search-script"></script><script async src="../assets/navigation.js" id="tsd-nav-script"></script></head><body><script>document.documentElement.dataset.theme = localStorage.getItem("tsd-theme") || "os";document.body.style.display="none";setTimeout(() => app?app.showPage():document.body.style.removeProperty("display"),500)</script><header class="tsd-page-toolbar"><div class="tsd-toolbar-contents container"><div class="table-cell" id="tsd-search" data-base=".."><div class="field"><label for="tsd-search-field" class="tsd-widget tsd-toolbar-icon search no-caption"><svg width="16" height="16" viewBox="0 0 16 16" fill="none"><use href="../assets/icons.svg#icon-search"></use></svg></label><input type="text" id="tsd-search-field" aria-label="Search"/></div><div class="field"><div id="tsd-toolbar-links"></div></div><ul class="results"><li class="state loading">Preparing search index...</li><li class="state failure">The search index is not available</li></ul><a href="../index.html" class="title">@xarc/react</a></div><div class="table-cell" id="tsd-widgets"><a href="#" class="tsd-widget tsd-toolbar-icon menu no-caption" data-toggle="menu" aria-label="Menu"><svg width="16" height="16" viewBox="0 0 16 16" fill="none"><use href="../assets/icons.svg#icon-menu"></use></svg></a></div></div></header><div class="container container-main"><div class="col-content"><div class="tsd-page-title"><ul class="tsd-breadcrumb"><li><a href="../index.html">@xarc/react</a></li><li><a href="../modules/common.html">common</a></li><li><a href="../modules/common.React.html">React</a></li><li><a href="common.React.DO_NOT_USE_OR_YOU_WILL_BE_FIRED_CALLBACK_REF_RETURN_VALUES.html">DO_NOT_USE_OR_YOU_WILL_BE_FIRED_CALLBACK_REF_RETURN_VALUES</a></li></ul><h1>Interface DO_NOT_USE_OR_YOU_WILL_BE_FIRED_CALLBACK_REF_RETURN_VALUES</h1></div><div class="tsd-signature"><span class="tsd-signature-keyword">interface </span><span class="tsd-kind-interface">DO_NOT_USE_OR_YOU_WILL_BE_FIRED_CALLBACK_REF_RETURN_VALUES</span> <span class="tsd-signature-symbol">{}</span></div><aside class="tsd-sources"><ul><li>Defined in common/temp/node_modules/.pnpm/@types+react@18.3.3/node_modules/@types/react/index.d.ts:157</li></ul></aside></div><div class="col-sidebar"><div class="page-menu"><div class="tsd-navigation settings"><details class="tsd-index-accordion"><summary class="tsd-accordion-summary"><h3><svg width="20" height="20" viewBox="0 0 24 24" fill="none"><use href="../assets/icons.svg#icon-chevronDown"></use></svg>Settings</h3></summary><div class="tsd-accordion-details"><div class="tsd-filter-visibility"><h4 class="uppercase">Member Visibility</h4><form><ul id="tsd-filter-options"><li class="tsd-filter-item"><label class="tsd-filter-input"><input type="checkbox" id="tsd-filter-protected" name="protected"/><svg width="32" height="32" viewBox="0 0 32 32" aria-hidden="true"><rect class="tsd-checkbox-background" width="30" height="30" x="1" y="1" rx="6" fill="none"></rect><path class="tsd-checkbox-checkmark" d="M8.35422 16.8214L13.2143 21.75L24.6458 10.25" stroke="none" stroke-width="3.5" stroke-linejoin="round" fill="none"></path></svg><span>Protected</span></label></li><li class="tsd-filter-item"><label class="tsd-filter-input"><input type="checkbox" id="tsd-filter-private" name="private"/><svg width="32" height="32" viewBox="0 0 32 32" aria-hidden="true"><rect class="tsd-checkbox-background" width="30" height="30" x="1" y="1" rx="6" fill="none"></rect><path class="tsd-checkbox-checkmark" d="M8.35422 16.8214L13.2143 21.75L24.6458 10.25" stroke="none" stroke-width="3.5" stroke-linejoin="round" fill="none"></path></svg><span>Private</span></label></li><li class="tsd-filter-item"><label class="tsd-filter-input"><input type="checkbox" id="tsd-filter-inherited" name="inherited" checked/><svg width="32" height="32" viewBox="0 0 32 32" aria-hidden="true"><rect class="tsd-checkbox-background" width="30" height="30" x="1" y="1" rx="6" fill="none"></rect><path class="tsd-checkbox-checkmark" d="M8.35422 16.8214L13.2143 21.75L24.6458 10.25" stroke="none" stroke-width="3.5" stroke-linejoin="round" fill="none"></path></svg><span>Inherited</span></label></li><li class="tsd-filter-item"><label class="tsd-filter-input"><input type="checkbox" id="tsd-filter-external" name="external"/><svg width="32" height="32" viewBox="0 0 32 32" aria-hidden="true"><rect class="tsd-checkbox-background" width="30" height="30" x="1" y="1" rx="6" fill="none"></rect><path class="tsd-checkbox-checkmark" d="M8.35422 16.8214L13.2143 21.75L24.6458 10.25" stroke="none" stroke-width="3.5" stroke-linejoin="round" fill="none"></path></svg><span>External</span></label></li></ul></form></div><div class="tsd-theme-toggle"><h4 class="uppercase">Theme</h4><select id="tsd-theme"><option value="os">OS</option><option value="light">Light</option><option value="dark">Dark</option></select></div></div></details></div></div><div class="site-menu"><nav class="tsd-navigation"><a href="../index.html"><svg class="tsd-kind-icon" viewBox="0 0 24 24"><use href="../assets/icons.svg#icon-1"></use></svg><span>@xarc/react</span></a><ul class="tsd-small-nested-navigation" id="tsd-nav-container" data-base=".."><li>Loading...</li></ul></nav></div></div></div><footer><p class="tsd-generator">Generated using <a href="path_to_url" target="_blank">TypeDoc</a></p></footer><div class="overlay"></div></body></html>
```
|
```kotlin
/*
* This file is auto generated from apollo-rx2-support-java by rxjava3.main.kts, do not edit manually.
*/
plugins {
id("org.jetbrains.kotlin.jvm")
}
apolloLibrary(
namespace = "com.apollographql.apollo.rx3.java"
)
dependencies {
api(libs.rx.java3)
api(project(":apollo-runtime-java"))
}
```
|
```linker script
/*
*
*/
SECTIONS
{
.data.ztest_expected_result_area : ALIGN(4)
{
_ztest_expected_result_entry_list_start = .;
KEEP(*(SORT_BY_NAME(._ztest_expected_result_entry.static.*)))
_ztest_expected_result_entry_list_end = .;
}
.data.ztest_suite_node_area : ALIGN(4)
{
_ztest_suite_node_list_start = .;
KEEP(*(SORT_BY_NAME(._ztest_suite_node.static.*)))
_ztest_suite_node_list_end = .;
}
.data.ztest_unit_test_area : ALIGN(4)
{
_ztest_unit_test_list_start = .;
KEEP(*(SORT_BY_NAME(._ztest_unit_test.static.*)))
_ztest_unit_test_list_end = .;
}
.data.ztest_test_rule_area : ALIGN(4)
{
_ztest_test_rule_list_start = .;
KEEP(*(SORT_BY_NAME(._ztest_test_rule.static.*)))
_ztest_test_rule_list_end = .;
}
}
INSERT AFTER .data;
```
|
```forth
*> \brief <b> DGELSD computes the minimum-norm solution to a linear least squares problem for GE matrices</b>
*
* =========== DOCUMENTATION ===========
*
* Online html documentation available at
* path_to_url
*
*> \htmlonly
*> Download DGELSD + dependencies
*> <a href="path_to_url">
*> [TGZ]</a>
*> <a href="path_to_url">
*> [ZIP]</a>
*> <a href="path_to_url">
*> [TXT]</a>
*> \endhtmlonly
*
* Definition:
* ===========
*
* SUBROUTINE DGELSD( M, N, NRHS, A, LDA, B, LDB, S, RCOND, RANK,
* WORK, LWORK, IWORK, INFO )
*
* .. Scalar Arguments ..
* INTEGER INFO, LDA, LDB, LWORK, M, N, NRHS, RANK
* DOUBLE PRECISION RCOND
* ..
* .. Array Arguments ..
* INTEGER IWORK( * )
* DOUBLE PRECISION A( LDA, * ), B( LDB, * ), S( * ), WORK( * )
* ..
*
*
*> \par Purpose:
* =============
*>
*> \verbatim
*>
*> DGELSD computes the minimum-norm solution to a real linear least
*> squares problem:
*> minimize 2-norm(| b - A*x |)
*> using the singular value decomposition (SVD) of A. A is an M-by-N
*> matrix which may be rank-deficient.
*>
*> Several right hand side vectors b and solution vectors x can be
*> handled in a single call; they are stored as the columns of the
*> M-by-NRHS right hand side matrix B and the N-by-NRHS solution
*> matrix X.
*>
*> The problem is solved in three steps:
*> (1) Reduce the coefficient matrix A to bidiagonal form with
*> Householder transformations, reducing the original problem
*> into a "bidiagonal least squares problem" (BLS)
*> (2) Solve the BLS using a divide and conquer approach.
*> (3) Apply back all the Householder transformations to solve
*> the original least squares problem.
*>
*> The effective rank of A is determined by treating as zero those
*> singular values which are less than RCOND times the largest singular
*> value.
*>
*> \endverbatim
*
* Arguments:
* ==========
*
*> \param[in] M
*> \verbatim
*> M is INTEGER
*> The number of rows of A. M >= 0.
*> \endverbatim
*>
*> \param[in] N
*> \verbatim
*> N is INTEGER
*> The number of columns of A. N >= 0.
*> \endverbatim
*>
*> \param[in] NRHS
*> \verbatim
*> NRHS is INTEGER
*> The number of right hand sides, i.e., the number of columns
*> of the matrices B and X. NRHS >= 0.
*> \endverbatim
*>
*> \param[in,out] A
*> \verbatim
*> A is DOUBLE PRECISION array, dimension (LDA,N)
*> On entry, the M-by-N matrix A.
*> On exit, A has been destroyed.
*> \endverbatim
*>
*> \param[in] LDA
*> \verbatim
*> LDA is INTEGER
*> The leading dimension of the array A. LDA >= max(1,M).
*> \endverbatim
*>
*> \param[in,out] B
*> \verbatim
*> B is DOUBLE PRECISION array, dimension (LDB,NRHS)
*> On entry, the M-by-NRHS right hand side matrix B.
*> On exit, B is overwritten by the N-by-NRHS solution
*> matrix X. If m >= n and RANK = n, the residual
*> sum-of-squares for the solution in the i-th column is given
*> by the sum of squares of elements n+1:m in that column.
*> \endverbatim
*>
*> \param[in] LDB
*> \verbatim
*> LDB is INTEGER
*> The leading dimension of the array B. LDB >= max(1,max(M,N)).
*> \endverbatim
*>
*> \param[out] S
*> \verbatim
*> S is DOUBLE PRECISION array, dimension (min(M,N))
*> The singular values of A in decreasing order.
*> The condition number of A in the 2-norm = S(1)/S(min(m,n)).
*> \endverbatim
*>
*> \param[in] RCOND
*> \verbatim
*> RCOND is DOUBLE PRECISION
*> RCOND is used to determine the effective rank of A.
*> Singular values S(i) <= RCOND*S(1) are treated as zero.
*> If RCOND < 0, machine precision is used instead.
*> \endverbatim
*>
*> \param[out] RANK
*> \verbatim
*> RANK is INTEGER
*> The effective rank of A, i.e., the number of singular values
*> which are greater than RCOND*S(1).
*> \endverbatim
*>
*> \param[out] WORK
*> \verbatim
*> WORK is DOUBLE PRECISION array, dimension (MAX(1,LWORK))
*> On exit, if INFO = 0, WORK(1) returns the optimal LWORK.
*> \endverbatim
*>
*> \param[in] LWORK
*> \verbatim
*> LWORK is INTEGER
*> The dimension of the array WORK. LWORK must be at least 1.
*> The exact minimum amount of workspace needed depends on M,
*> N and NRHS. As long as LWORK is at least
*> 12*N + 2*N*SMLSIZ + 8*N*NLVL + N*NRHS + (SMLSIZ+1)**2,
*> if M is greater than or equal to N or
*> 12*M + 2*M*SMLSIZ + 8*M*NLVL + M*NRHS + (SMLSIZ+1)**2,
*> if M is less than N, the code will execute correctly.
*> SMLSIZ is returned by ILAENV and is equal to the maximum
*> size of the subproblems at the bottom of the computation
*> tree (usually about 25), and
*> NLVL = MAX( 0, INT( LOG_2( MIN( M,N )/(SMLSIZ+1) ) ) + 1 )
*> For good performance, LWORK should generally be larger.
*>
*> If LWORK = -1, then a workspace query is assumed; the routine
*> only calculates the optimal size of the WORK array, returns
*> this value as the first entry of the WORK array, and no error
*> message related to LWORK is issued by XERBLA.
*> \endverbatim
*>
*> \param[out] IWORK
*> \verbatim
*> IWORK is INTEGER array, dimension (MAX(1,LIWORK))
*> LIWORK >= max(1, 3 * MINMN * NLVL + 11 * MINMN),
*> where MINMN = MIN( M,N ).
*> On exit, if INFO = 0, IWORK(1) returns the minimum LIWORK.
*> \endverbatim
*>
*> \param[out] INFO
*> \verbatim
*> INFO is INTEGER
*> = 0: successful exit
*> < 0: if INFO = -i, the i-th argument had an illegal value.
*> > 0: the algorithm for computing the SVD failed to converge;
*> if INFO = i, i off-diagonal elements of an intermediate
*> bidiagonal form did not converge to zero.
*> \endverbatim
*
* Authors:
* ========
*
*> \author Univ. of Tennessee
*> \author Univ. of California Berkeley
*> \author Univ. of Colorado Denver
*> \author NAG Ltd.
*
*> \ingroup gelsd
*
*> \par Contributors:
* ==================
*>
*> Ming Gu and Ren-Cang Li, Computer Science Division, University of
*> California at Berkeley, USA \n
*> Osni Marques, LBNL/NERSC, USA \n
*
* =====================================================================
SUBROUTINE DGELSD( M, N, NRHS, A, LDA, B, LDB, S, RCOND, RANK,
$ WORK, LWORK, IWORK, INFO )
*
* -- LAPACK driver routine --
* -- LAPACK is a software package provided by Univ. of Tennessee, --
* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
*
* .. Scalar Arguments ..
INTEGER INFO, LDA, LDB, LWORK, M, N, NRHS, RANK
DOUBLE PRECISION RCOND
* ..
* .. Array Arguments ..
INTEGER IWORK( * )
DOUBLE PRECISION A( LDA, * ), B( LDB, * ), S( * ), WORK( * )
* ..
*
* =====================================================================
*
* .. Parameters ..
DOUBLE PRECISION ZERO, ONE, TWO
PARAMETER ( ZERO = 0.0D0, ONE = 1.0D0, TWO = 2.0D0 )
* ..
* .. Local Scalars ..
LOGICAL LQUERY
INTEGER IASCL, IBSCL, IE, IL, ITAU, ITAUP, ITAUQ,
$ LDWORK, LIWORK, MAXMN, MAXWRK, MINMN, MINWRK,
$ MM, MNTHR, NLVL, NWORK, SMLSIZ, WLALSD
DOUBLE PRECISION ANRM, BIGNUM, BNRM, EPS, SFMIN, SMLNUM
* ..
* .. External Subroutines ..
EXTERNAL DGEBRD, DGELQF, DGEQRF, DLACPY,
$ DLALSD,
$ DLASCL, DLASET, DORMBR, DORMLQ, DORMQR, XERBLA
* ..
* .. External Functions ..
INTEGER ILAENV
DOUBLE PRECISION DLAMCH, DLANGE
EXTERNAL ILAENV, DLAMCH, DLANGE
* ..
* .. Intrinsic Functions ..
INTRINSIC DBLE, INT, LOG, MAX, MIN
* ..
* .. Executable Statements ..
*
* Test the input arguments.
*
INFO = 0
MINMN = MIN( M, N )
MAXMN = MAX( M, N )
MNTHR = ILAENV( 6, 'DGELSD', ' ', M, N, NRHS, -1 )
LQUERY = ( LWORK.EQ.-1 )
IF( M.LT.0 ) THEN
INFO = -1
ELSE IF( N.LT.0 ) THEN
INFO = -2
ELSE IF( NRHS.LT.0 ) THEN
INFO = -3
ELSE IF( LDA.LT.MAX( 1, M ) ) THEN
INFO = -5
ELSE IF( LDB.LT.MAX( 1, MAXMN ) ) THEN
INFO = -7
END IF
*
SMLSIZ = ILAENV( 9, 'DGELSD', ' ', 0, 0, 0, 0 )
*
* Compute workspace.
* (Note: Comments in the code beginning "Workspace:" describe the
* minimal amount of workspace needed at that point in the code,
* as well as the preferred amount for good performance.
* NB refers to the optimal block size for the immediately
* following subroutine, as returned by ILAENV.)
*
MINWRK = 1
LIWORK = 1
MINMN = MAX( 1, MINMN )
NLVL = MAX( INT( LOG( DBLE( MINMN ) / DBLE( SMLSIZ+1 ) ) /
$ LOG( TWO ) ) + 1, 0 )
*
IF( INFO.EQ.0 ) THEN
MAXWRK = 1
LIWORK = 3*MINMN*NLVL + 11*MINMN
MM = M
IF( M.GE.N .AND. M.GE.MNTHR ) THEN
*
* Path 1a - overdetermined, with many more rows than columns.
*
MM = N
MAXWRK = MAX( MAXWRK, N+N*ILAENV( 1, 'DGEQRF', ' ', M, N,
$ -1, -1 ) )
MAXWRK = MAX( MAXWRK, N+NRHS*
$ ILAENV( 1, 'DORMQR', 'LT', M, NRHS, N, -1 ) )
END IF
IF( M.GE.N ) THEN
*
* Path 1 - overdetermined or exactly determined.
*
MAXWRK = MAX( MAXWRK, 3*N+( MM+N )*
$ ILAENV( 1, 'DGEBRD', ' ', MM, N, -1, -1 ) )
MAXWRK = MAX( MAXWRK, 3*N+NRHS*
$ ILAENV( 1, 'DORMBR', 'QLT', MM, NRHS, N, -1 ) )
MAXWRK = MAX( MAXWRK, 3*N+( N-1 )*
$ ILAENV( 1, 'DORMBR', 'PLN', N, NRHS, N, -1 ) )
WLALSD = 9*N+2*N*SMLSIZ+8*N*NLVL+N*NRHS+(SMLSIZ+1)**2
MAXWRK = MAX( MAXWRK, 3*N+WLALSD )
MINWRK = MAX( 3*N+MM, 3*N+NRHS, 3*N+WLALSD )
END IF
IF( N.GT.M ) THEN
WLALSD = 9*M+2*M*SMLSIZ+8*M*NLVL+M*NRHS+(SMLSIZ+1)**2
IF( N.GE.MNTHR ) THEN
*
* Path 2a - underdetermined, with many more columns
* than rows.
*
MAXWRK = M + M*ILAENV( 1, 'DGELQF', ' ', M, N, -1,
$ -1 )
MAXWRK = MAX( MAXWRK, M*M+4*M+2*M*
$ ILAENV( 1, 'DGEBRD', ' ', M, M, -1, -1 ) )
MAXWRK = MAX( MAXWRK, M*M+4*M+NRHS*
$ ILAENV( 1, 'DORMBR', 'QLT', M, NRHS, M,
$ -1 ) )
MAXWRK = MAX( MAXWRK, M*M+4*M+( M-1 )*
$ ILAENV( 1, 'DORMBR', 'PLN', M, NRHS, M,
$ -1 ) )
IF( NRHS.GT.1 ) THEN
MAXWRK = MAX( MAXWRK, M*M+M+M*NRHS )
ELSE
MAXWRK = MAX( MAXWRK, M*M+2*M )
END IF
MAXWRK = MAX( MAXWRK, M+NRHS*
$ ILAENV( 1, 'DORMLQ', 'LT', N, NRHS, M, -1 ) )
MAXWRK = MAX( MAXWRK, M*M+4*M+WLALSD )
! XXX: Ensure the Path 2a case below is triggered. The workspace
! calculation should use queries for all routines eventually.
MAXWRK = MAX( MAXWRK,
$ 4*M+M*M+MAX( M, 2*M-4, NRHS, N-3*M ) )
ELSE
*
* Path 2 - remaining underdetermined cases.
*
MAXWRK = 3*M + ( N+M )*ILAENV( 1, 'DGEBRD', ' ', M, N,
$ -1, -1 )
MAXWRK = MAX( MAXWRK, 3*M+NRHS*
$ ILAENV( 1, 'DORMBR', 'QLT', M, NRHS, N,
$ -1 ) )
MAXWRK = MAX( MAXWRK, 3*M+M*
$ ILAENV( 1, 'DORMBR', 'PLN', N, NRHS, M,
$ -1 ) )
MAXWRK = MAX( MAXWRK, 3*M+WLALSD )
END IF
MINWRK = MAX( 3*M+NRHS, 3*M+M, 3*M+WLALSD )
END IF
MINWRK = MIN( MINWRK, MAXWRK )
WORK( 1 ) = MAXWRK
IWORK( 1 ) = LIWORK
IF( LWORK.LT.MINWRK .AND. .NOT.LQUERY ) THEN
INFO = -12
END IF
END IF
*
IF( INFO.NE.0 ) THEN
CALL XERBLA( 'DGELSD', -INFO )
RETURN
ELSE IF( LQUERY ) THEN
GO TO 10
END IF
*
* Quick return if possible.
*
IF( M.EQ.0 .OR. N.EQ.0 ) THEN
RANK = 0
RETURN
END IF
*
* Get machine parameters.
*
EPS = DLAMCH( 'P' )
SFMIN = DLAMCH( 'S' )
SMLNUM = SFMIN / EPS
BIGNUM = ONE / SMLNUM
*
* Scale A if max entry outside range [SMLNUM,BIGNUM].
*
ANRM = DLANGE( 'M', M, N, A, LDA, WORK )
IASCL = 0
IF( ANRM.GT.ZERO .AND. ANRM.LT.SMLNUM ) THEN
*
* Scale matrix norm up to SMLNUM.
*
CALL DLASCL( 'G', 0, 0, ANRM, SMLNUM, M, N, A, LDA, INFO )
IASCL = 1
ELSE IF( ANRM.GT.BIGNUM ) THEN
*
* Scale matrix norm down to BIGNUM.
*
CALL DLASCL( 'G', 0, 0, ANRM, BIGNUM, M, N, A, LDA, INFO )
IASCL = 2
ELSE IF( ANRM.EQ.ZERO ) THEN
*
* Matrix all zero. Return zero solution.
*
CALL DLASET( 'F', MAX( M, N ), NRHS, ZERO, ZERO, B, LDB )
CALL DLASET( 'F', MINMN, 1, ZERO, ZERO, S, 1 )
RANK = 0
GO TO 10
END IF
*
* Scale B if max entry outside range [SMLNUM,BIGNUM].
*
BNRM = DLANGE( 'M', M, NRHS, B, LDB, WORK )
IBSCL = 0
IF( BNRM.GT.ZERO .AND. BNRM.LT.SMLNUM ) THEN
*
* Scale matrix norm up to SMLNUM.
*
CALL DLASCL( 'G', 0, 0, BNRM, SMLNUM, M, NRHS, B, LDB,
$ INFO )
IBSCL = 1
ELSE IF( BNRM.GT.BIGNUM ) THEN
*
* Scale matrix norm down to BIGNUM.
*
CALL DLASCL( 'G', 0, 0, BNRM, BIGNUM, M, NRHS, B, LDB,
$ INFO )
IBSCL = 2
END IF
*
* If M < N make sure certain entries of B are zero.
*
IF( M.LT.N )
$ CALL DLASET( 'F', N-M, NRHS, ZERO, ZERO, B( M+1, 1 ), LDB )
*
* Overdetermined case.
*
IF( M.GE.N ) THEN
*
* Path 1 - overdetermined or exactly determined.
*
MM = M
IF( M.GE.MNTHR ) THEN
*
* Path 1a - overdetermined, with many more rows than columns.
*
MM = N
ITAU = 1
NWORK = ITAU + N
*
* Compute A=Q*R.
* (Workspace: need 2*N, prefer N+N*NB)
*
CALL DGEQRF( M, N, A, LDA, WORK( ITAU ), WORK( NWORK ),
$ LWORK-NWORK+1, INFO )
*
* Multiply B by transpose(Q).
* (Workspace: need N+NRHS, prefer N+NRHS*NB)
*
CALL DORMQR( 'L', 'T', M, NRHS, N, A, LDA, WORK( ITAU ),
$ B,
$ LDB, WORK( NWORK ), LWORK-NWORK+1, INFO )
*
* Zero out below R.
*
IF( N.GT.1 ) THEN
CALL DLASET( 'L', N-1, N-1, ZERO, ZERO, A( 2, 1 ),
$ LDA )
END IF
END IF
*
IE = 1
ITAUQ = IE + N
ITAUP = ITAUQ + N
NWORK = ITAUP + N
*
* Bidiagonalize R in A.
* (Workspace: need 3*N+MM, prefer 3*N+(MM+N)*NB)
*
CALL DGEBRD( MM, N, A, LDA, S, WORK( IE ), WORK( ITAUQ ),
$ WORK( ITAUP ), WORK( NWORK ), LWORK-NWORK+1,
$ INFO )
*
* Multiply B by transpose of left bidiagonalizing vectors of R.
* (Workspace: need 3*N+NRHS, prefer 3*N+NRHS*NB)
*
CALL DORMBR( 'Q', 'L', 'T', MM, NRHS, N, A, LDA,
$ WORK( ITAUQ ),
$ B, LDB, WORK( NWORK ), LWORK-NWORK+1, INFO )
*
* Solve the bidiagonal least squares problem.
*
CALL DLALSD( 'U', SMLSIZ, N, NRHS, S, WORK( IE ), B, LDB,
$ RCOND, RANK, WORK( NWORK ), IWORK, INFO )
IF( INFO.NE.0 ) THEN
GO TO 10
END IF
*
* Multiply B by right bidiagonalizing vectors of R.
*
CALL DORMBR( 'P', 'L', 'N', N, NRHS, N, A, LDA,
$ WORK( ITAUP ),
$ B, LDB, WORK( NWORK ), LWORK-NWORK+1, INFO )
*
ELSE IF( N.GE.MNTHR .AND. LWORK.GE.4*M+M*M+
$ MAX( M, 2*M-4, NRHS, N-3*M, WLALSD ) ) THEN
*
* Path 2a - underdetermined, with many more columns than rows
* and sufficient workspace for an efficient algorithm.
*
LDWORK = M
IF( LWORK.GE.MAX( 4*M+M*LDA+MAX( M, 2*M-4, NRHS, N-3*M ),
$ M*LDA+M+M*NRHS, 4*M+M*LDA+WLALSD ) )LDWORK = LDA
ITAU = 1
NWORK = M + 1
*
* Compute A=L*Q.
* (Workspace: need 2*M, prefer M+M*NB)
*
CALL DGELQF( M, N, A, LDA, WORK( ITAU ), WORK( NWORK ),
$ LWORK-NWORK+1, INFO )
IL = NWORK
*
* Copy L to WORK(IL), zeroing out above its diagonal.
*
CALL DLACPY( 'L', M, M, A, LDA, WORK( IL ), LDWORK )
CALL DLASET( 'U', M-1, M-1, ZERO, ZERO, WORK( IL+LDWORK ),
$ LDWORK )
IE = IL + LDWORK*M
ITAUQ = IE + M
ITAUP = ITAUQ + M
NWORK = ITAUP + M
*
* Bidiagonalize L in WORK(IL).
* (Workspace: need M*M+5*M, prefer M*M+4*M+2*M*NB)
*
CALL DGEBRD( M, M, WORK( IL ), LDWORK, S, WORK( IE ),
$ WORK( ITAUQ ), WORK( ITAUP ), WORK( NWORK ),
$ LWORK-NWORK+1, INFO )
*
* Multiply B by transpose of left bidiagonalizing vectors of L.
* (Workspace: need M*M+4*M+NRHS, prefer M*M+4*M+NRHS*NB)
*
CALL DORMBR( 'Q', 'L', 'T', M, NRHS, M, WORK( IL ), LDWORK,
$ WORK( ITAUQ ), B, LDB, WORK( NWORK ),
$ LWORK-NWORK+1, INFO )
*
* Solve the bidiagonal least squares problem.
*
CALL DLALSD( 'U', SMLSIZ, M, NRHS, S, WORK( IE ), B, LDB,
$ RCOND, RANK, WORK( NWORK ), IWORK, INFO )
IF( INFO.NE.0 ) THEN
GO TO 10
END IF
*
* Multiply B by right bidiagonalizing vectors of L.
*
CALL DORMBR( 'P', 'L', 'N', M, NRHS, M, WORK( IL ), LDWORK,
$ WORK( ITAUP ), B, LDB, WORK( NWORK ),
$ LWORK-NWORK+1, INFO )
*
* Zero out below first M rows of B.
*
CALL DLASET( 'F', N-M, NRHS, ZERO, ZERO, B( M+1, 1 ), LDB )
NWORK = ITAU + M
*
* Multiply transpose(Q) by B.
* (Workspace: need M+NRHS, prefer M+NRHS*NB)
*
CALL DORMLQ( 'L', 'T', N, NRHS, M, A, LDA, WORK( ITAU ), B,
$ LDB, WORK( NWORK ), LWORK-NWORK+1, INFO )
*
ELSE
*
* Path 2 - remaining underdetermined cases.
*
IE = 1
ITAUQ = IE + M
ITAUP = ITAUQ + M
NWORK = ITAUP + M
*
* Bidiagonalize A.
* (Workspace: need 3*M+N, prefer 3*M+(M+N)*NB)
*
CALL DGEBRD( M, N, A, LDA, S, WORK( IE ), WORK( ITAUQ ),
$ WORK( ITAUP ), WORK( NWORK ), LWORK-NWORK+1,
$ INFO )
*
* Multiply B by transpose of left bidiagonalizing vectors.
* (Workspace: need 3*M+NRHS, prefer 3*M+NRHS*NB)
*
CALL DORMBR( 'Q', 'L', 'T', M, NRHS, N, A, LDA,
$ WORK( ITAUQ ),
$ B, LDB, WORK( NWORK ), LWORK-NWORK+1, INFO )
*
* Solve the bidiagonal least squares problem.
*
CALL DLALSD( 'L', SMLSIZ, M, NRHS, S, WORK( IE ), B, LDB,
$ RCOND, RANK, WORK( NWORK ), IWORK, INFO )
IF( INFO.NE.0 ) THEN
GO TO 10
END IF
*
* Multiply B by right bidiagonalizing vectors of A.
*
CALL DORMBR( 'P', 'L', 'N', N, NRHS, M, A, LDA,
$ WORK( ITAUP ),
$ B, LDB, WORK( NWORK ), LWORK-NWORK+1, INFO )
*
END IF
*
* Undo scaling.
*
IF( IASCL.EQ.1 ) THEN
CALL DLASCL( 'G', 0, 0, ANRM, SMLNUM, N, NRHS, B, LDB,
$ INFO )
CALL DLASCL( 'G', 0, 0, SMLNUM, ANRM, MINMN, 1, S, MINMN,
$ INFO )
ELSE IF( IASCL.EQ.2 ) THEN
CALL DLASCL( 'G', 0, 0, ANRM, BIGNUM, N, NRHS, B, LDB,
$ INFO )
CALL DLASCL( 'G', 0, 0, BIGNUM, ANRM, MINMN, 1, S, MINMN,
$ INFO )
END IF
IF( IBSCL.EQ.1 ) THEN
CALL DLASCL( 'G', 0, 0, SMLNUM, BNRM, N, NRHS, B, LDB,
$ INFO )
ELSE IF( IBSCL.EQ.2 ) THEN
CALL DLASCL( 'G', 0, 0, BIGNUM, BNRM, N, NRHS, B, LDB,
$ INFO )
END IF
*
10 CONTINUE
WORK( 1 ) = MAXWRK
IWORK( 1 ) = LIWORK
RETURN
*
* End of DGELSD
*
END
```
|
```swift
//
// FLTest1ViewController.swift
// TangramKit
//
// Created by yant on 28/4/16.
//
import UIKit
/**
* 1.FrameLayout - Gravity&Fill
*/
class FLTest1ViewController: UIViewController {
override func loadView() {
/*
TangramKit
1. TGBaseLayoutTangramKit7
2. 7
3.
4.
5.
6.
tg_leading,tg_trailing,tg_top,tg_bottomequalCGFloatTGWeight
1.TGLinearLayout tg_leading,tg_trailingtg_top,tg_bottom
2.TGLinearLayout tg_leading,tg_trailingtg_top,tg_bottom
3. tg_leading,tg_trailing,tg_top,tg_bottom
4.TGFrameLayout tg_leading,tg_trailing,tg_top,tg_bottom
5.TGRelativeLayout tg_leading,tg_trailing,tg_top,tg_bottom
6.TGFlowLayout tg_leading,tg_trailing,tg_top,tg_bottom
7.TGFloatLayout tg_leading,tg_trailing,tg_top,tg_bottom
8.TGPathLayout tg_leading,tg_trailing,tg_top,tg_bottom
9. tg_leading,tg_trailing,tg_top,tg_bottom
10. tg_leading,tg_trailing,tg_top,tg_bottomTangramKit
1.
2.
*/
/*
*/
self.edgesForExtendedLayout = UIRectEdge(rawValue:0) //
super.loadView()
let frameLayout = TGFrameLayout()
frameLayout.backgroundColor = .white
frameLayout.tg_margin(TGLayoutPos.tg_safeAreaMargin)
frameLayout.tg_padding = UIEdgeInsets.init(top: 20, left: 20, bottom: 20, right: 20)
self.view.addSubview(frameLayout)
// all fill subview
let fill = self.createLabel("", backgroundColor: CFTool.color(0))
fill.tg_width.equal(.fill)
fill.tg_height.equal(.fill) //
frameLayout.addSubview(fill)
// width fill subview
let horzFill = self.createLabel("horz fill", backgroundColor: CFTool.color(8))
horzFill.tg_top.equal(40) //40
horzFill.tg_width.equal(.fill)
horzFill.tg_height.equal(.wrap)
frameLayout.addSubview(horzFill)
// height fill subview
let vertFill = self.createLabel("vert fill", backgroundColor: CFTool.color(9))
vertFill.numberOfLines = 0;
vertFill.tg_leading.equal(90) //90
vertFill.tg_width.equal(10)
vertFill.tg_height.equal(.fill)
frameLayout.addSubview(vertFill)
// top leading subview
let topLeft = self.createLabel("top leading", backgroundColor: CFTool.color(5))
topLeft.tg_top.equal(0)
topLeft.tg_leading.equal(0)
frameLayout.addSubview(topLeft)
//center leading subview
let centerLeft = self.createLabel("center leading", backgroundColor: CFTool.color(5))
centerLeft.tg_centerY.equal(0)
centerLeft.tg_leading.equal(0)
frameLayout.addSubview(centerLeft)
//bottom leading subview
let bottomLeft = self.createLabel("bottom leading", backgroundColor: CFTool.color(5))
bottomLeft.tg_bottom.equal(0)
bottomLeft.tg_leading.equal(0)
frameLayout.addSubview(bottomLeft)
// top center subview
let topCenter = self.createLabel("top center", backgroundColor: CFTool.color(6))
topCenter.tg_top.equal(0)
topCenter.tg_centerX.equal(0)
frameLayout.addSubview(topCenter)
// center center subview
let centerCenter = self.createLabel("center center", backgroundColor: CFTool.color(6))
centerCenter.tg_centerY.equal(0)
centerCenter.tg_centerX.equal(0)
frameLayout.addSubview(centerCenter)
// bottom center subview
let bottomCenter = self.createLabel("bottom center", backgroundColor: CFTool.color(6))
bottomCenter.tg_bottom.equal(0)
bottomCenter.tg_centerX.equal(0)
frameLayout.addSubview(bottomCenter)
// top trailing subview
let topRight = self.createLabel("top trailing", backgroundColor: CFTool.color(7))
topRight.tg_top.equal(0)
topRight.tg_trailing.equal(0)
frameLayout.addSubview(topRight)
//center trailing subview
let centerRight = self.createLabel("center trailing", backgroundColor: CFTool.color(7))
centerRight.tg_centerY.equal(0)
centerRight.tg_trailing.equal(0)
frameLayout.addSubview(centerRight)
// bottom trailing subview
let bottomRight = self.createLabel("bottom trailing", backgroundColor: CFTool.color(7))
bottomRight.tg_bottom.equal(0)
bottomRight.tg_trailing.equal(0)
frameLayout.addSubview(bottomRight)
}
override func viewDidLoad() {
super.viewDidLoad()
// Do any additional setup after loading the view.
}
override func didReceiveMemoryWarning() {
super.didReceiveMemoryWarning()
// Dispose of any resources that can be recreated.
}
func createLabel(_ title: String, backgroundColor color: UIColor) -> UILabel {
let v = UILabel()
v.text = title
v.font = CFTool.font(15)
v.textAlignment = .center
v.backgroundColor = color
v.layer.shadowOffset = CGSize(width: CGFloat(3), height: CGFloat(3))
v.layer.shadowColor! = CFTool.color(4).cgColor
v.layer.shadowRadius = 2
v.layer.shadowOpacity = 0.3
v.sizeToFit()
return v
}
}
```
|
Kalutara electoral district was an electoral district of Sri Lanka between August 1947 and February 1989. The district was named after the town of Kalutara in Kalutara District, Western Province. The 1978 Constitution of Sri Lanka introduced the proportional representation electoral system for electing members of Parliament. The existing 160 mainly single-member electoral districts were replaced with 22 multi-member electoral districts. Kalutara electoral district was replaced by the Kalutara multi-member electoral district at the 1989 general elections, the first under the PR system, though Kalutara continues to be a polling division of the multi-member electoral district.
Members of Parliament
Key
Elections
1947 Parliamentary General Election
Results of the 1st parliamentary election held between 23 August 1947 and 20 September 1947 for the district:
1952 Parliamentary General Election
Results of the 2nd parliamentary election held between 24 May 1952 and 30 May 1952 for the district:
1956 Parliamentary General Election
Results of the 3rd parliamentary election held between 5 April 1956 and 10 April 1956 for the district:
1960 (March) Parliamentary General Election
Results of the 4th parliamentary election held on 19 March 1960 for the district:
1960 (July) Parliamentary General Election
Results of the 5th parliamentary election held on 20 July 1960 for the district:
1965 Parliamentary General Election
Results of the 6th parliamentary election held on 22 March 1965 for the district:
1970 Parliamentary General Election
Results of the 7th parliamentary election held on 27 May 1970 for the district:
1977 Parliamentary General Election
Results of the 8th parliamentary election held on 21 July 1977 for the district:
References
Former electoral districts of Sri Lanka
Politics of Kalutara District
|
Pathé Ismaël Ciss (born 16 March 1994) is a Senegalese professional footballer who plays as a central or defensive midfielder for La Liga club Rayo Vallecano.
Career
Ciss was born in Dakar, and joined the Diambars FC academy at the age of 12, joining his older brother Saliou and father Ibou, who was a coach there. He started his senior career at Diambars, before joining LigaPro side C.F. União on 31 July 2017.
Ciss made his professional debut on 13 August 2017, coming on as a late substitute for Gonçalo Abreu in a 2–0 home win against Real S.C. He scored his first goal abroad on 29 October, netting the game's only in a home defeat of U.D. Oliveirense.
On 30 August 2018, after União suffered relegation, Ciss moved to F.C. Famalicão on a one-year loan deal, still in the second division. He contributed with four goals during the campaign, as his side returned to Primeira Liga after 25 years.
On 2 September 2019, Ciss was loaned to Spanish Segunda División side CF Fuenlabrada, for one year. The following 13 July, he signed a permanent contract until 2023 with the club.
On 28 July 2021, Ciss signed a four-year deal with Rayo Vallecano, newly promoted to La Liga, along with teammate Randy Nteka.
Career statistics
Club
References
External links
1994 births
Living people
Footballers from Dakar
Senegalese men's footballers
Men's association football midfielders
Diambars FC players
Liga Portugal 2 players
C.F. União players
F.C. Famalicão players
La Liga players
Segunda División players
CF Fuenlabrada footballers
Rayo Vallecano players
2022 FIFA World Cup players
Senegalese expatriate men's footballers
Senegalese expatriate sportspeople in Portugal
Senegalese expatriate sportspeople in Spain
Expatriate men's footballers in Portugal
Expatriate men's footballers in Spain
|
The Donghae Line is a railway line connecting Busanjin station to Yeongdeok in South Korea. The literal meaning of its name, the "East Sea Line," reflects its position along the nation's East coast. It merged with the Donghae Nambu Line on December 30, 2016, and will merge with the Donghae Bukbu Line.
Stations
Major stations along the line include (in order):
Bujeon station, terminal station of the line and terminus of the Bujeon Line
Sinhaeundae station, a popular resort beach in eastern Busan
Gijang station
Taehwagang station (formerly Ulsan), major industrial city and terminus of the Jangsaengpo and Ulsanhang Lines
Gyeongju station (Singyeongju), historic city
Pohang station, seaport and industrial city
BEXCO station, where the G-Star gaming event is held
Services
KTX
Plans foresee direct KTX high-speed train service from Seoul to Pohang and Ulsan after the completion of the upgrades. From 2015, direct KTX trains are to reach Pohang from Seoul in 1 hour 50 minutes, cutting 33 minutes from the travel time with transfer at Gyeongju. Under the government's 2010 strategic plan for 2020, the entire line may see KTX service.
Busan–Ulsan commuter trains
In the Busan–Ulsan section, higher frequency commuter rail service between Bujeon and Ilgwang began on December 30, 2016. Service operates approximately every 15 minutes during the peak periods and 30 minutes during the off-peak. The line is integrated into the Busan Metro network and accepts the Hanaro Card and Digital Busan Card, as well as the T-Money card from Seoul.
Upgrade
Pohang–Samcheok extension
At the time of thawing relations between South and North Korea, when the cross-border section of the Donghae Bukbu Line was reopened in 2007, the South Korean government considered the construction of a railway for freight traffic all along the east coast to the North Korean border. As part of the corridor, a new single-track, non-electrified line for would connect Pohang and Samcheok, the end of a branch of the Yeongdong Line. new line is to connect to the existing railhead at Samcheok. Work started on the Pohang-Yeongdeok section on March 20, 2008, with a foreseen budget of 2,949.5 billion won for the entire line until Samcheok. As of 2009, progress reached 5.9% of a planned budget reduced to 2,831.749 billion won, and completion of the long project was planned for 2016. Under the government's 2010 strategic plan for 2020, the Pohang–Samcheok extension is to be further upgraded for .
See also
Korail; South Korea's national railroad operator
Transportation in South Korea
Donghae Nambu Line
Donghae Bukbu Line
References
Korail lines
Railway lines in South Korea
Standard gauge railways in South Korea
Railway lines opened in 2015
Donghae Line
|
is a Japanese modern pentathlete. He competed at the 1972 and 1976 Summer Olympics.
References
External links
1943 births
Living people
Japanese male modern pentathletes
Olympic modern pentathletes for Japan
Modern pentathletes at the 1972 Summer Olympics
Modern pentathletes at the 1976 Summer Olympics
20th-century Japanese people
21st-century Japanese people
|
```xml
import type { ISuggestionModel } from '@fluentui/react/lib/Pickers';
export class SuggestionsStore<T> {
public suggestions: ISuggestionModel<T>[];
constructor() {
this.suggestions = [];
}
public updateSuggestions(newSuggestions: T[]): void {
if (newSuggestions && newSuggestions.length > 0) {
this.suggestions = this.convertSuggestionsToSuggestionItems(newSuggestions);
} else {
this.suggestions = [];
}
}
public getSuggestions(): ISuggestionModel<T>[] {
return this.suggestions;
}
public getSuggestionAtIndex(index: number): ISuggestionModel<T> {
return this.suggestions[index];
}
public removeSuggestion(index: number): void {
this.suggestions.splice(index, 1);
}
public convertSuggestionsToSuggestionItems(suggestions: Array<ISuggestionModel<T> | T>): ISuggestionModel<T>[] {
return Array.isArray(suggestions) ? suggestions.map(this._ensureSuggestionModel) : [];
}
private _isSuggestionModel = (value: ISuggestionModel<T> | T): value is ISuggestionModel<T> => {
return (<ISuggestionModel<T>>value).item !== undefined;
};
private _ensureSuggestionModel = (suggestion: ISuggestionModel<T> | T): ISuggestionModel<T> => {
if (this._isSuggestionModel(suggestion)) {
return suggestion as ISuggestionModel<T>;
} else {
return {
item: suggestion,
selected: false,
ariaLabel: (<any>suggestion).name || (<any>suggestion).primaryText,
} as ISuggestionModel<T>;
}
};
}
```
|
Charles Finn may refer to:
Charles Finn (water polo), American water polo player
Charles C. Finn, American poet
Charles A. Finn, priest of the Archdiocese of Boston
Charlie Finn, American actor
See also
Chuck Finn, an Australian children's fantasy television series
|
```kotlin
package expo.modules.notifications.service
import android.app.PendingIntent
import android.content.BroadcastReceiver
import android.content.ComponentName
import android.content.Context
import android.content.Intent
import android.content.pm.ActivityInfo
import android.net.Uri
import android.os.*
import android.util.Log
import androidx.core.app.RemoteInput
import expo.modules.notifications.BuildConfig
import expo.modules.notifications.notifications.model.*
import expo.modules.notifications.service.delegates.ExpoCategoriesDelegate
import expo.modules.notifications.service.delegates.ExpoHandlingDelegate
import expo.modules.notifications.service.delegates.ExpoPresentationDelegate
import expo.modules.notifications.service.delegates.ExpoSchedulingDelegate
import expo.modules.notifications.service.interfaces.CategoriesDelegate
import expo.modules.notifications.service.interfaces.HandlingDelegate
import expo.modules.notifications.service.interfaces.PresentationDelegate
import expo.modules.notifications.service.interfaces.SchedulingDelegate
import kotlin.concurrent.thread
/**
* Subclass of FirebaseMessagingService, central dispatcher for all the notifications-related actions.
*/
open class NotificationsService : BroadcastReceiver() {
companion object {
const val NOTIFICATION_EVENT_ACTION = "expo.modules.notifications.NOTIFICATION_EVENT"
val SETUP_ACTIONS = listOf(
Intent.ACTION_BOOT_COMPLETED,
Intent.ACTION_REBOOT,
Intent.ACTION_MY_PACKAGE_REPLACED,
"android.intent.action.QUICKBOOT_POWERON",
"com.htc.intent.action.QUICKBOOT_POWERON"
)
const val USER_TEXT_RESPONSE_KEY = "userTextResponse"
// Event types
private const val GET_ALL_DISPLAYED_TYPE = "getAllDisplayed"
private const val PRESENT_TYPE = "present"
private const val DISMISS_SELECTED_TYPE = "dismissSelected"
private const val DISMISS_ALL_TYPE = "dismissAll"
private const val RECEIVE_TYPE = "receive"
private const val RECEIVE_RESPONSE_TYPE = "receiveResponse"
private const val DROPPED_TYPE = "dropped"
private const val GET_CATEGORIES_TYPE = "getCategories"
private const val SET_CATEGORY_TYPE = "setCategory"
private const val DELETE_CATEGORY_TYPE = "deleteCategory"
private const val SCHEDULE_TYPE = "schedule"
private const val TRIGGER_TYPE = "trigger"
private const val GET_ALL_SCHEDULED_TYPE = "getAllScheduled"
private const val GET_SCHEDULED_TYPE = "getScheduled"
private const val REMOVE_SELECTED_TYPE = "removeSelected"
private const val REMOVE_ALL_TYPE = "removeAll"
// Messages parts
const val SUCCESS_CODE = 0
const val ERROR_CODE = 1
const val EVENT_TYPE_KEY = "type"
const val EXCEPTION_KEY = "exception"
const val RECEIVER_KEY = "receiver"
// Specific messages parts
const val NOTIFICATION_KEY = "notification"
const val NOTIFICATION_RESPONSE_KEY = "notificationResponse"
const val TEXT_INPUT_NOTIFICATION_RESPONSE_KEY = "textInputNotificationResponse"
const val SUCCEEDED_KEY = "succeeded"
const val IDENTIFIERS_KEY = "identifiers"
const val IDENTIFIER_KEY = "identifier"
const val NOTIFICATION_BEHAVIOR_KEY = "notificationBehavior"
const val NOTIFICATIONS_KEY = "notifications"
const val NOTIFICATION_CATEGORY_KEY = "notificationCategory"
const val NOTIFICATION_CATEGORIES_KEY = "notificationCategories"
const val NOTIFICATION_REQUEST_KEY = "notificationRequest"
const val NOTIFICATION_REQUESTS_KEY = "notificationRequests"
const val NOTIFICATION_ACTION_KEY = "notificationAction"
/**
* A helper function for dispatching a "fetch all displayed notifications" command to the service.
*
* @param context Context where to start the service.
* @param receiver A receiver to which send the notifications
*/
fun getAllPresented(context: Context, receiver: ResultReceiver? = null) {
doWork(
context,
Intent(NOTIFICATION_EVENT_ACTION, getUriBuilder().build()).also {
it.putExtra(EVENT_TYPE_KEY, GET_ALL_DISPLAYED_TYPE)
it.putExtra(RECEIVER_KEY, receiver)
}
)
}
/**
* A helper function for dispatching a "present notification" command to the service.
*
* @param context Context where to start the service.
* @param notification Notification to present
* @param behavior Allowed notification behavior
* @param receiver A receiver to which send the result of presenting the notification
*/
fun present(context: Context, notification: Notification, behavior: NotificationBehavior? = null, receiver: ResultReceiver? = null) {
val data = getUriBuilderForIdentifier(notification.notificationRequest.identifier).appendPath("present").build()
doWork(
context,
Intent(NOTIFICATION_EVENT_ACTION, data).also { intent ->
intent.putExtra(EVENT_TYPE_KEY, PRESENT_TYPE)
intent.putExtra(NOTIFICATION_KEY, notification)
intent.putExtra(NOTIFICATION_BEHAVIOR_KEY, behavior)
intent.putExtra(RECEIVER_KEY, receiver)
}
)
}
/**
* A helper function for dispatching a "notification received" command to the service.
*
* @param context Context where to start the service.
* @param notification Notification received
* @param receiver Result receiver
*/
fun receive(context: Context, notification: Notification, receiver: ResultReceiver? = null) {
val data = getUriBuilderForIdentifier(notification.notificationRequest.identifier).appendPath("receive").build()
doWork(
context,
Intent(NOTIFICATION_EVENT_ACTION, data).also { intent ->
intent.putExtra(EVENT_TYPE_KEY, RECEIVE_TYPE)
intent.putExtra(NOTIFICATION_KEY, notification)
intent.putExtra(RECEIVER_KEY, receiver)
}
)
}
/**
* A helper function for dispatching a "dismiss notification" command to the service.
*
* @param context Context where to start the service.
* @param identifier Notification identifier
* @param receiver A receiver to which send the result of the action
*/
fun dismiss(context: Context, identifiers: Array<String>, receiver: ResultReceiver? = null) {
val data = getUriBuilder().appendPath("dismiss").build()
doWork(
context,
Intent(NOTIFICATION_EVENT_ACTION, data).also { intent ->
intent.putExtra(EVENT_TYPE_KEY, DISMISS_SELECTED_TYPE)
intent.putExtra(IDENTIFIERS_KEY, identifiers)
intent.putExtra(RECEIVER_KEY, receiver)
}
)
}
/**
* A helper function for dispatching a "dismiss notification" command to the service.
*
* @param context Context where to start the service.
* @param receiver A receiver to which send the result of the action
*/
fun dismissAll(context: Context, receiver: ResultReceiver? = null) {
val data = getUriBuilder().appendPath("dismiss").build()
doWork(
context,
Intent(NOTIFICATION_EVENT_ACTION, data).also { intent ->
intent.putExtra(EVENT_TYPE_KEY, DISMISS_ALL_TYPE)
intent.putExtra(RECEIVER_KEY, receiver)
}
)
}
/**
* A helper function for dispatching a "notifications dropped" command to the service.
*
* @param context Context where to start the service.
*/
fun handleDropped(context: Context) {
doWork(
context,
Intent(NOTIFICATION_EVENT_ACTION).also { intent ->
intent.putExtra(EVENT_TYPE_KEY, DROPPED_TYPE)
}
)
}
/**
* A helper function for dispatching a "get notification categories" command to the service.
*
* @param context Context where to start the service.
*/
fun getCategories(context: Context, receiver: ResultReceiver? = null) {
doWork(
context,
Intent(
NOTIFICATION_EVENT_ACTION,
getUriBuilder()
.appendPath("categories")
.build()
).also {
it.putExtra(EVENT_TYPE_KEY, GET_CATEGORIES_TYPE)
it.putExtra(RECEIVER_KEY, receiver)
}
)
}
/**
* A helper function for dispatching a "set notification category" command to the service.
*
* @param context Context where to start the service.
* @param category Notification category to be set
*/
fun setCategory(context: Context, category: NotificationCategory, receiver: ResultReceiver? = null) {
doWork(
context,
Intent(
NOTIFICATION_EVENT_ACTION,
getUriBuilder()
.appendPath("categories")
.appendPath(category.identifier)
.build()
).also {
it.putExtra(EVENT_TYPE_KEY, SET_CATEGORY_TYPE)
it.putExtra(NOTIFICATION_CATEGORY_KEY, category as Parcelable)
it.putExtra(RECEIVER_KEY, receiver)
}
)
}
/**
* A helper function for dispatching a "delete notification category" command to the service.
*
* @param context Context where to start the service.
* @param identifier Category Identifier
*/
fun deleteCategory(context: Context, identifier: String, receiver: ResultReceiver? = null) {
doWork(
context,
Intent(
NOTIFICATION_EVENT_ACTION,
getUriBuilder()
.appendPath("categories")
.appendPath(identifier)
.build()
).also {
it.putExtra(EVENT_TYPE_KEY, DELETE_CATEGORY_TYPE)
it.putExtra(IDENTIFIER_KEY, identifier)
it.putExtra(RECEIVER_KEY, receiver)
}
)
}
/**
* Fetches all scheduled notifications asynchronously.
*
* @param context Context this is being called from
* @param resultReceiver Receiver to be called with the results
*/
fun getAllScheduledNotifications(context: Context, resultReceiver: ResultReceiver? = null) {
doWork(
context,
Intent(NOTIFICATION_EVENT_ACTION).also { intent ->
intent.putExtra(EVENT_TYPE_KEY, GET_ALL_SCHEDULED_TYPE)
intent.putExtra(RECEIVER_KEY, resultReceiver)
}
)
}
/**
* Fetches scheduled notification asynchronously.
*
* @param context Context this is being called from
* @param identifier Identifier of the notification to be fetched
* @param resultReceiver Receiver to be called with the results
*/
fun getScheduledNotification(context: Context, identifier: String, resultReceiver: ResultReceiver? = null) {
doWork(
context,
Intent(
NOTIFICATION_EVENT_ACTION,
getUriBuilder()
.appendPath("scheduled")
.appendPath(identifier)
.build()
).also { intent ->
intent.putExtra(EVENT_TYPE_KEY, GET_SCHEDULED_TYPE)
intent.putExtra(IDENTIFIER_KEY, identifier)
intent.putExtra(RECEIVER_KEY, resultReceiver)
}
)
}
/**
* Schedule notification asynchronously.
*
* @param context Context this is being called from
* @param notificationRequest Notification request to schedule
* @param resultReceiver Receiver to be called with the result
*/
fun schedule(context: Context, notificationRequest: NotificationRequest, resultReceiver: ResultReceiver? = null) {
doWork(
context,
Intent(
NOTIFICATION_EVENT_ACTION,
getUriBuilder()
.appendPath("scheduled")
.appendPath(notificationRequest.identifier)
.build()
).also { intent ->
intent.putExtra(EVENT_TYPE_KEY, SCHEDULE_TYPE)
intent.putExtra(NOTIFICATION_REQUEST_KEY, notificationRequest as Parcelable)
intent.putExtra(RECEIVER_KEY, resultReceiver)
}
)
}
/**
* Cancel selected scheduled notification and remove it from the storage asynchronously.
*
* @param context Context this is being called from
* @param identifier Identifier of the notification to be removed
* @param resultReceiver Receiver to be called with the result
*/
fun removeScheduledNotification(context: Context, identifier: String, resultReceiver: ResultReceiver? = null) =
removeScheduledNotifications(context, listOf(identifier), resultReceiver)
/**
* Cancel selected scheduled notifications and remove them from the storage asynchronously.
*
* @param context Context this is being called from
* @param identifiers Identifiers of selected notifications to be removed
* @param resultReceiver Receiver to be called with the result
*/
fun removeScheduledNotifications(context: Context, identifiers: Collection<String>, resultReceiver: ResultReceiver? = null) {
doWork(
context,
Intent(
NOTIFICATION_EVENT_ACTION,
getUriBuilder()
.appendPath("scheduled")
.build()
).also { intent ->
intent.putExtra(EVENT_TYPE_KEY, REMOVE_SELECTED_TYPE)
intent.putExtra(IDENTIFIERS_KEY, identifiers.toTypedArray())
intent.putExtra(RECEIVER_KEY, resultReceiver)
}
)
}
/**
* Cancel all scheduled notifications and remove them from the storage asynchronously.
*
* @param context Context this is being called from
* @param resultReceiver Receiver to be called with the result
*/
fun removeAllScheduledNotifications(context: Context, resultReceiver: ResultReceiver? = null) {
doWork(
context,
Intent(NOTIFICATION_EVENT_ACTION).also { intent ->
intent.putExtra(EVENT_TYPE_KEY, REMOVE_ALL_TYPE)
intent.putExtra(RECEIVER_KEY, resultReceiver)
}
)
}
/**
* Sends the intent to the best service to handle the {@link #NOTIFICATION_EVENT_ACTION} intent
* or handles the intent immediately if the service is already up.
*
* @param context Context where to start the service
* @param intent Intent to dispatch
*/
fun doWork(context: Context, intent: Intent) {
findDesignatedBroadcastReceiver(context, intent)?.let {
intent.component = ComponentName(it.packageName, it.name)
context.sendBroadcast(intent)
return
}
Log.e("expo-notifications", "No service capable of handling notifications found (intent = ${intent.action}). Ensure that you have configured your AndroidManifest.xml properly.")
}
protected fun getUriBuilder(): Uri.Builder {
return Uri.parse("expo-notifications://notifications/").buildUpon()
}
protected fun getUriBuilderForIdentifier(identifier: String): Uri.Builder {
return getUriBuilder().appendPath(identifier)
}
fun findDesignatedBroadcastReceiver(context: Context, intent: Intent): ActivityInfo? {
val searchIntent = Intent(intent.action).setPackage(context.packageName)
return context.packageManager.queryBroadcastReceivers(searchIntent, 0).firstOrNull()?.activityInfo
}
/**
* Creates and returns a pending intent that will trigger [NotificationsService],
* which hands off the work to this class. The intent triggers notification of the given identifier.
*
* @param context Context this is being called from
* @param identifier Notification identifier
* @return [PendingIntent] triggering [NotificationsService], triggering notification of given ID.
*/
fun createNotificationTrigger(context: Context, identifier: String): PendingIntent {
val intent = Intent(
NOTIFICATION_EVENT_ACTION,
getUriBuilder()
.appendPath("scheduled")
.appendPath(identifier)
.appendPath("trigger")
.build()
).also { intent ->
findDesignatedBroadcastReceiver(context, intent)?.let {
intent.component = ComponentName(it.packageName, it.name)
}
intent.putExtra(EVENT_TYPE_KEY, TRIGGER_TYPE)
intent.putExtra(IDENTIFIER_KEY, identifier)
}
// We're defaulting to the behaviour prior API 31 (mutable) even though Android recommends immutability
val mutableFlag = if (Build.VERSION.SDK_INT >= Build.VERSION_CODES.S) PendingIntent.FLAG_MUTABLE else 0
return PendingIntent.getBroadcast(
context,
intent.component?.className?.hashCode() ?: NotificationsService::class.java.hashCode(),
intent,
PendingIntent.FLAG_UPDATE_CURRENT or mutableFlag
)
}
/**
* Creates and returns a pending intent that will trigger [NotificationsService]'s "response received"
* event.
*
* @param context Context this is being called from
* @param notification Notification being responded to
* @param action Notification action being undertaken
* @return [PendingIntent] triggering [NotificationsService], triggering "response received" event
*/
fun createNotificationResponseIntent(context: Context, notification: Notification, action: NotificationAction): PendingIntent {
val intent = Intent(
NOTIFICATION_EVENT_ACTION,
getUriBuilder()
.appendPath(notification.notificationRequest.identifier)
.appendPath("actions")
.appendPath(action.identifier)
.build()
).also { intent ->
findDesignatedBroadcastReceiver(context, intent)?.let {
intent.component = ComponentName(it.packageName, it.name)
}
intent.putExtra(EVENT_TYPE_KEY, RECEIVE_RESPONSE_TYPE)
intent.putExtra(NOTIFICATION_KEY, notification)
intent.putExtra(NOTIFICATION_ACTION_KEY, action as Parcelable)
}
// Starting from Android 12,
// [notification trampolines](path_to_url#identify-notification-trampolines)
// are not allowed. If the notification wants to open foreground app,
// we should use the dedicated Activity pendingIntent.
if (action.opensAppToForeground() && Build.VERSION.SDK_INT >= Build.VERSION_CODES.S) {
val notificationResponse = getNotificationResponseFromBroadcastIntent(intent)
return ExpoHandlingDelegate.createPendingIntentForOpeningApp(context, intent, notificationResponse)
}
// We're defaulting to the behaviour prior API 31 (mutable) even though Android recommends immutability
val mutableFlag = if (Build.VERSION.SDK_INT >= Build.VERSION_CODES.S) PendingIntent.FLAG_MUTABLE else 0
return PendingIntent.getBroadcast(
context,
intent.component?.className?.hashCode() ?: NotificationsService::class.java.hashCode(),
intent,
PendingIntent.FLAG_UPDATE_CURRENT or mutableFlag
)
}
/**
* Recreate an Intent from [createNotificationResponseIntent] extras
* for [NotificationForwarderActivity] to send broadcasts
*/
fun createNotificationResponseBroadcastIntent(context: Context, extras: Bundle?): Intent {
val notification = extras?.getParcelable<Notification>(NOTIFICATION_KEY)
val action = extras?.getParcelable<NotificationAction>(NOTIFICATION_ACTION_KEY)
if (notification == null || action == null) {
throw IllegalArgumentException("notification and action should not be null")
}
val backgroundAction = NotificationAction(action.identifier, action.title, false)
val intent = Intent(
NOTIFICATION_EVENT_ACTION,
getUriBuilder()
.appendPath(notification.notificationRequest.identifier)
.appendPath("actions")
.appendPath(backgroundAction.identifier)
.build()
).also { intent ->
findDesignatedBroadcastReceiver(context, intent)?.let {
intent.component = ComponentName(it.packageName, it.name)
}
intent.putExtra(EVENT_TYPE_KEY, RECEIVE_RESPONSE_TYPE)
intent.putExtra(NOTIFICATION_KEY, notification)
intent.putExtra(NOTIFICATION_ACTION_KEY, backgroundAction as Parcelable)
}
return intent
}
fun getNotificationResponseFromBroadcastIntent(intent: Intent): NotificationResponse {
val notification = intent.getParcelableExtra<Notification>(NOTIFICATION_KEY) ?: throw IllegalArgumentException("$NOTIFICATION_KEY not found in the intent extras.")
val action = intent.getParcelableExtra<NotificationAction>(NOTIFICATION_ACTION_KEY) ?: throw IllegalArgumentException("$NOTIFICATION_ACTION_KEY not found in the intent extras.")
val response = if (action is TextInputNotificationAction) {
val userText = RemoteInput.getResultsFromIntent(intent)?.getString(USER_TEXT_RESPONSE_KEY) ?: ""
TextInputNotificationResponse(action, notification, userText)
} else {
NotificationResponse(action, notification)
}
return response
}
fun getNotificationResponseFromOpenIntent(intent: Intent): NotificationResponse? {
intent.getByteArrayExtra(NOTIFICATION_RESPONSE_KEY)?.let { return unmarshalObject(NotificationResponse.CREATOR, it) }
intent.getByteArrayExtra(TEXT_INPUT_NOTIFICATION_RESPONSE_KEY)?.let { return unmarshalObject(TextInputNotificationResponse.CREATOR, it) }
return null
}
// Class loader used in BaseBundle when unmarshalling notification extras
// cannot handle expo.modules.notifications..NotificationResponse
// so we go around it by marshalling and unmarshalling the object ourselves.
fun setNotificationResponseToIntent(intent: Intent, notificationResponse: NotificationResponse) {
try {
val keyToPutResponseUnder = if (notificationResponse is TextInputNotificationResponse) {
TEXT_INPUT_NOTIFICATION_RESPONSE_KEY
} else {
NOTIFICATION_RESPONSE_KEY
}
intent.putExtra(keyToPutResponseUnder, marshalObject(notificationResponse))
} catch (e: Exception) {
// If we couldn't marshal the request, let's not fail the whole build process.
Log.e("expo-notifications", "Could not marshal notification response: ${notificationResponse.actionIdentifier}.")
e.printStackTrace()
}
}
/**
* Marshals [Parcelable] into to a byte array.
*
* @param notificationResponse Notification response to marshall
* @return Given request marshalled to a byte array or null if the process failed.
*/
private fun marshalObject(objectToMarshal: Parcelable): ByteArray? {
val parcel: Parcel = Parcel.obtain()
objectToMarshal.writeToParcel(parcel, 0)
val bytes: ByteArray = parcel.marshall()
parcel.recycle()
return bytes
}
/**
* UNmarshals [Parcelable] object from a byte array given a [Parcelable.Creator].
* @return Object instance or null if the process failed.
*/
private fun <T> unmarshalObject(creator: Parcelable.Creator<T>, byteArray: ByteArray?): T? {
byteArray?.let {
try {
val parcel = Parcel.obtain()
parcel.unmarshall(it, 0, it.size)
parcel.setDataPosition(0)
val unmarshaledObject = creator.createFromParcel(parcel)
parcel.recycle()
return unmarshaledObject
} catch (e: Exception) {
Log.e("expo-notifications", "Could not unmarshall NotificationResponse from Intent.extra.", e)
}
}
return null
}
}
protected open fun getPresentationDelegate(context: Context): PresentationDelegate =
ExpoPresentationDelegate(context)
protected open fun getHandlingDelegate(context: Context): HandlingDelegate =
ExpoHandlingDelegate(context)
protected open fun getCategoriesDelegate(context: Context): CategoriesDelegate =
ExpoCategoriesDelegate(context)
protected open fun getSchedulingDelegate(context: Context): SchedulingDelegate =
ExpoSchedulingDelegate(context)
override fun onReceive(context: Context, intent: Intent?) {
val pendingIntent = goAsync()
thread {
try {
handleIntent(context, intent)
} finally {
pendingIntent.finish()
}
}
}
open fun handleIntent(context: Context, intent: Intent?) {
if (intent != null && SETUP_ACTIONS.contains(intent.action)) {
onSetupScheduledNotifications(context, intent)
} else if (intent?.action === NOTIFICATION_EVENT_ACTION) {
val receiver: ResultReceiver? = intent.extras?.get(RECEIVER_KEY) as? ResultReceiver
try {
var resultData: Bundle? = null
when (val eventType = intent.getStringExtra(EVENT_TYPE_KEY)) {
GET_ALL_DISPLAYED_TYPE ->
resultData = onGetAllPresentedNotifications(context, intent)
RECEIVE_TYPE -> onReceiveNotification(context, intent)
RECEIVE_RESPONSE_TYPE -> onReceiveNotificationResponse(context, intent)
DROPPED_TYPE -> onNotificationsDropped(context, intent)
PRESENT_TYPE -> onPresentNotification(context, intent)
DISMISS_SELECTED_TYPE -> onDismissNotifications(context, intent)
DISMISS_ALL_TYPE -> onDismissAllNotifications(context, intent)
GET_CATEGORIES_TYPE ->
resultData = onGetCategories(context, intent)
SET_CATEGORY_TYPE ->
resultData = onSetCategory(context, intent)
DELETE_CATEGORY_TYPE ->
resultData = onDeleteCategory(context, intent)
GET_ALL_SCHEDULED_TYPE ->
resultData = onGetAllScheduledNotifications(context, intent)
GET_SCHEDULED_TYPE ->
resultData = onGetScheduledNotification(context, intent)
SCHEDULE_TYPE -> onScheduleNotification(context, intent)
REMOVE_SELECTED_TYPE -> onRemoveScheduledNotifications(context, intent)
REMOVE_ALL_TYPE -> onRemoveAllScheduledNotifications(context, intent)
TRIGGER_TYPE -> onNotificationTriggered(context, intent)
else -> throw IllegalArgumentException("Received event of unrecognized type: $eventType. Ignoring.")
}
// If we ended up here, the callbacks must have completed successfully
receiver?.send(SUCCESS_CODE, resultData)
} catch (e: Exception) {
if (BuildConfig.DEBUG) {
// Log stack trace for debugging
Log.e("expo-notifications", "Action ${intent.action} failed: ${e.message}\n${e.stackTraceToString()}")
} else {
Log.e("expo-notifications", "Action ${intent.action} failed: ${e.message}")
}
e.printStackTrace()
receiver?.send(ERROR_CODE, Bundle().also { it.putSerializable(EXCEPTION_KEY, e) })
}
} else {
throw IllegalArgumentException("Received intent of unrecognized action: ${intent?.action}. Ignoring.")
}
}
//region Presenting notifications
open fun onPresentNotification(context: Context, intent: Intent) =
getPresentationDelegate(context).presentNotification(
intent.extras?.getParcelable(NOTIFICATION_KEY)!!,
intent.extras?.getParcelable(NOTIFICATION_BEHAVIOR_KEY)
)
open fun onGetAllPresentedNotifications(context: Context, intent: Intent) =
Bundle().also {
it.putParcelableArrayList(
NOTIFICATIONS_KEY,
ArrayList(
getPresentationDelegate(context).getAllPresentedNotifications()
)
)
}
open fun onDismissNotifications(context: Context, intent: Intent) =
getPresentationDelegate(context).dismissNotifications(
intent.extras?.getStringArray(IDENTIFIERS_KEY)!!.asList()
)
open fun onDismissAllNotifications(context: Context, intent: Intent) =
getPresentationDelegate(context).dismissAllNotifications()
//endregion
//region Handling notifications
open fun onReceiveNotification(context: Context, intent: Intent) =
getHandlingDelegate(context).handleNotification(
intent.getParcelableExtra(NOTIFICATION_KEY)!!
)
open fun onReceiveNotificationResponse(context: Context, intent: Intent) {
val response = getNotificationResponseFromBroadcastIntent(intent)
getHandlingDelegate(context).handleNotificationResponse(response)
}
open fun onNotificationsDropped(context: Context, intent: Intent) =
getHandlingDelegate(context).handleNotificationsDropped()
//endregion
//region Category handling
open fun onGetCategories(context: Context, intent: Intent) =
Bundle().also {
it.putParcelableArrayList(
NOTIFICATION_CATEGORIES_KEY,
ArrayList(
getCategoriesDelegate(context).getCategories()
)
)
}
open fun onSetCategory(context: Context, intent: Intent) =
Bundle().also {
it.putParcelable(
NOTIFICATION_CATEGORY_KEY,
getCategoriesDelegate(context).setCategory(
intent.getParcelableExtra(NOTIFICATION_CATEGORY_KEY)!!
)
)
}
open fun onDeleteCategory(context: Context, intent: Intent) =
Bundle().also {
it.putBoolean(
SUCCEEDED_KEY,
getCategoriesDelegate(context).deleteCategory(
intent.extras?.getString(IDENTIFIER_KEY)!!
)
)
}
//endregion
//region Scheduling notifications
open fun onGetAllScheduledNotifications(context: Context, intent: Intent) =
Bundle().also {
it.putParcelableArrayList(
NOTIFICATION_REQUESTS_KEY,
ArrayList(
getSchedulingDelegate(context).getAllScheduledNotifications()
)
)
}
open fun onGetScheduledNotification(context: Context, intent: Intent) =
Bundle().also {
it.putParcelable(
NOTIFICATION_REQUEST_KEY,
getSchedulingDelegate(context).getScheduledNotification(
intent.extras?.getString(IDENTIFIER_KEY)!!
)
)
}
open fun onScheduleNotification(context: Context, intent: Intent) =
getSchedulingDelegate(context).scheduleNotification(
intent.extras?.getParcelable(NOTIFICATION_REQUEST_KEY)!!
)
open fun onNotificationTriggered(context: Context, intent: Intent) =
getSchedulingDelegate(context).triggerNotification(
intent.extras?.getString(IDENTIFIER_KEY)!!
)
open fun onRemoveScheduledNotifications(context: Context, intent: Intent) =
getSchedulingDelegate(context).removeScheduledNotifications(
intent.extras?.getStringArray(IDENTIFIERS_KEY)!!.asList()
)
open fun onRemoveAllScheduledNotifications(context: Context, intent: Intent) =
getSchedulingDelegate(context).removeAllScheduledNotifications()
open fun onSetupScheduledNotifications(context: Context, intent: Intent) =
getSchedulingDelegate(context).setupScheduledNotifications()
//endregion
}
```
|
Ollech & Wajs (O&W) is a watch company based in Zurich, Switzerland.
History
In the 1950s, Albert J. Wajs founded the company as a supplier of stainless steel bracelets. He partnered with Joseph Ollech in 1956 and expanded into the manufacture of wristwatches from retail space in Zurich. Watches were offered by mail order from Switzerland through magazine ads to customers in the United States and UK.
The company specialized in automatic and manual-wind mechanical military and dive watches. They were sold in PX's on US military bases during the 1960s. The company's M 65 military watch was popular with US soldiers. The Vietnam War era marked an all-time high in sales. Breitling Navitimer stock was used to produce Ollech & Wajs chronometer-style watches, called "Aviation". During the first season of the 1970s British television series The Professionals, actors Martin Shaw and Lewis Collins wore what appear to be Ollech & Wajs Caribbean 1000 wristwatches, which is 1,000m water-resistant.
O&W finally ended production of OW models in the early 1980s, although business continued with the Aviation chronographs. In the 1990s, the company resumed under the name A.I. Wajs. and subsequently OW. New models were successfully introduced, such as the M4 diving watch and the Mirage Valjoux 7750 chronograph.
In 2006 a collector of OW became the distributor of the brand for the French market, and in 2017, Albert J. Wajs passed the company over to him.
In 2019, the brand was revived with the launch of the OW P-101 and OW P-104 pilot models. In 2021, the company released the OW 350CI which was created to fit the design of the Condor A350 motorbikes.
See also
Automatic watch
Mechanical watch
References
External links
Official website
Chronotime home page
1969 O&W catalog
Watch manufacturing companies of Switzerland
Manufacturing companies established in 1956
Swiss watch brands
Swiss companies established in 1956
Design companies established in 1956
|
Simeona Punsalan-Tapang (July 1, 1922 – June 30, 2015) also known as Kumander Guerrero, was a Filipina war veteran. She was a commander of the Hukbalahap guerilla that fought for the country during and after World War II.
War
Before the war, Tapang worked as an organizer of the peasant organization -- Pambansang Katipunan ng mga Magsasaka ng Pilipinas (National Assembly of Farmers in the Philippines).
When the Imperial Japanese army invaded the country, Tapang learned that many local women were being kidnapped and raped to be comfort women. Because of this, she reached out to the Hukbalahap and joined the guerilla at 19 years old.
Due to her affiliations, Tapang was imprisoned by the Japanese government.
When she was released, she joined the Hukbalahap's Apalit Squadron 104 in November 1942. She served as captain until December 1943. The Apalit Squadron 104 was deemed as one of the guerilla's strongest groups, considering that it is one of the most battle-tested squadron.
In 1944, she was promoted to major under the 1st Regiment, Second Battalion Staff, Regional Command 7.
Tapang recalled an incident as a captain, wherein her second in command refused to follow her order to form a V formation. She pointed her 37-cal. gun to him and spoke that he will have to obey, and so he did.
Tapang took part in the Battle of Mandibi in Candiba, Pampanga in 1944, and it was a successful fight against the Japanese. Tapang led several successful combats against Japanese forces in Arayat, Pampanga.
Tapang's first husband, a comrade-in-arms, was killed along with his team in an encounter in Candaba. Her second husband, also a Hukbalahap fighter, died during battle too.
When the Japanese was quelled from the Philippines, the Hukbalahap evolved as Hukbong Magpalaya ng Bayan(HMB). The movement persisted during the American occupation due to the arrest and killings of Hukbalahap members that fought against Japanese colonizers—instead of being recognized for their war efforts as allies. Thus, Tapang joined the HMB's Luzon Regional Command in Bataan. It was the movement's base of operations. There, she was captured together with her infant child.
Luis Taruc, the Hukbalahap's supreme leader, spoke of Tapang as “a big-bodied woman with a man’s strength, fond of wearing men’s clothes, adept at handling an automatic rifle, and able to hold command at the firing line.”
Death
On June 30, 2015, Tapang passed away due to cardiac arrest. She was 92 years old.
References
1922 births
2015 deaths
Women in war in the Philippines
Women soldiers
Filipino women
|
```java
/*
* one or more contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright ownership.
*/
package io.camunda.zeebe.broker.system.configuration;
import java.util.Map;
import java.util.Objects;
/**
* Exporter component configuration. To be expanded eventually to allow enabling/disabling
* exporters, and other general configuration.
*/
public final class ExporterCfg implements ConfigurationEntry {
/**
* path to the JAR file containing the exporter class
*
* <p>optional field: if missing, will lookup the class in the zeebe classpath
*/
private String jarPath;
/** fully qualified class name pointing to the class implementing the exporter interface */
private String className;
/** map of arguments to use when instantiating the exporter */
private Map<String, Object> args;
@Override
public void init(final BrokerCfg globalConfig, final String brokerBase) {
if (isExternal()) {
jarPath = ConfigurationUtil.toAbsolutePath(jarPath, brokerBase);
}
}
public boolean isExternal() {
return !isEmpty(jarPath);
}
public String getJarPath() {
return jarPath;
}
public void setJarPath(final String jarPath) {
this.jarPath = jarPath;
}
public String getClassName() {
return className;
}
public void setClassName(final String className) {
this.className = className;
}
public Map<String, Object> getArgs() {
return args;
}
public void setArgs(final Map<String, Object> args) {
this.args = args;
}
private boolean isEmpty(final String value) {
return value == null || value.isEmpty();
}
@Override
public int hashCode() {
return Objects.hash(jarPath, className, args);
}
@Override
public boolean equals(final Object o) {
if (this == o) {
return true;
}
if (o == null || getClass() != o.getClass()) {
return false;
}
final ExporterCfg that = (ExporterCfg) o;
return Objects.equals(jarPath, that.jarPath)
&& Objects.equals(className, that.className)
&& Objects.equals(args, that.args);
}
@Override
public String toString() {
return "ExporterCfg{"
+ ", jarPath='"
+ jarPath
+ '\''
+ ", className='"
+ className
+ '\''
+ ", args="
+ args
+ '}';
}
}
```
|
```c++
/***
*dllsupp.c - Definitions of public constants
*
*
*Purpose:
* Provides definitions for public constants (absolutes) that are
* 'normally' defined in objects in the C library, but must be defined
* here for clients of crtdll.dll & msvcrt*.dll. These constants are:
*
* _fltused
*
*******************************************************************************/
#ifdef __cplusplus
extern "C" {
#endif /* __cplusplus */
int _fltused = 0x9875;
#ifdef __cplusplus
}
#endif /* __cplusplus */
```
|
The Mamainse Point Formation is a geologic formation in Algoma District in Northeastern Ontario, Canada. It is located north of Sault Ste. Marie along Lake Superior. The rocks comprising the Mamainse Point Formation are volcanic in origin, having been deposited by volcanism of the Midcontinent Rift System.
See also
Volcanism of Canada
Volcanism of Eastern Canada
References
Volcanism of Ontario
Geologic formations of Ontario
Mesoproterozoic volcanism
|
```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 Street, Fifth Floor, Boston, MA 02110-1301, USA */
/**
@file storage/perfschema/table_helper.cc
Performance schema table helpers (implementation).
*/
#include "my_global.h"
#include "my_pthread.h"
#include "pfs_engine_table.h"
#include "table_helper.h"
#include "pfs_host.h"
#include "pfs_user.h"
#include "pfs_account.h"
#include "pfs_instr.h"
int PFS_host_row::make_row(PFS_host *pfs)
{
m_hostname_length= pfs->m_hostname_length;
if (m_hostname_length > sizeof(m_hostname))
return 1;
if (m_hostname_length > 0)
memcpy(m_hostname, pfs->m_hostname, sizeof(m_hostname));
return 0;
}
void PFS_host_row::set_field(Field *f)
{
if (m_hostname_length > 0)
PFS_engine_table::set_field_char_utf8(f, m_hostname, m_hostname_length);
else
f->set_null();
}
int PFS_user_row::make_row(PFS_user *pfs)
{
m_username_length= pfs->m_username_length;
if (m_username_length > sizeof(m_username))
return 1;
if (m_username_length > 0)
memcpy(m_username, pfs->m_username, sizeof(m_username));
return 0;
}
void PFS_user_row::set_field(Field *f)
{
if (m_username_length > 0)
PFS_engine_table::set_field_char_utf8(f, m_username, m_username_length);
else
f->set_null();
}
int PFS_account_row::make_row(PFS_account *pfs)
{
m_username_length= pfs->m_username_length;
if (m_username_length > sizeof(m_username))
return 1;
if (m_username_length > 0)
memcpy(m_username, pfs->m_username, sizeof(m_username));
m_hostname_length= pfs->m_hostname_length;
if (m_hostname_length > sizeof(m_hostname))
return 1;
if (m_hostname_length > 0)
memcpy(m_hostname, pfs->m_hostname, sizeof(m_hostname));
return 0;
}
void PFS_account_row::set_field(uint index, Field *f)
{
switch (index)
{
case 0: /* USER */
if (m_username_length > 0)
PFS_engine_table::set_field_char_utf8(f, m_username, m_username_length);
else
f->set_null();
break;
case 1: /* HOST */
if (m_hostname_length > 0)
PFS_engine_table::set_field_char_utf8(f, m_hostname, m_hostname_length);
else
f->set_null();
break;
default:
DBUG_ASSERT(false);
break;
}
}
int PFS_digest_row::make_row(PFS_statements_digest_stat* pfs)
{
m_schema_name_length= pfs->m_digest_key.m_schema_name_length;
if (m_schema_name_length > sizeof(m_schema_name))
m_schema_name_length= 0;
if (m_schema_name_length > 0)
memcpy(m_schema_name, pfs->m_digest_key.m_schema_name, m_schema_name_length);
size_t safe_byte_count= pfs->m_digest_storage.m_byte_count;
if (safe_byte_count > pfs_max_digest_length)
safe_byte_count= 0;
/*
"0" value for byte_count indicates special entry i.e. aggregated
stats at index 0 of statements_digest_stat_array. So do not calculate
digest/digest_text as it should always be "NULL".
*/
if (safe_byte_count > 0)
{
/*
Calculate digest from MD5 HASH collected to be shown as
DIGEST in this row.
*/
MD5_HASH_TO_STRING(pfs->m_digest_storage.m_md5, m_digest);
m_digest_length= MD5_HASH_TO_STRING_LENGTH;
/*
Calculate digest_text information from the token array collected
to be shown as DIGEST_TEXT column.
*/
compute_digest_text(&pfs->m_digest_storage, &m_digest_text);
if (m_digest_text.length() == 0)
m_digest_length= 0;
}
else
{
m_digest_length= 0;
m_digest_text.length(0);
}
return 0;
}
void PFS_digest_row::set_field(uint index, Field *f)
{
switch (index)
{
case 0: /* SCHEMA_NAME */
if (m_schema_name_length > 0)
PFS_engine_table::set_field_varchar_utf8(f, m_schema_name,
m_schema_name_length);
else
f->set_null();
break;
case 1: /* DIGEST */
if (m_digest_length > 0)
PFS_engine_table::set_field_varchar_utf8(f, m_digest,
m_digest_length);
else
f->set_null();
break;
case 2: /* DIGEST_TEXT */
if (m_digest_text.length() > 0)
PFS_engine_table::set_field_longtext_utf8(f, m_digest_text.ptr(),
m_digest_text.length());
else
f->set_null();
break;
default:
DBUG_ASSERT(false);
break;
}
}
int PFS_object_row::make_row(PFS_table_share *pfs)
{
m_object_type= pfs->get_object_type();
m_schema_name_length= pfs->m_schema_name_length;
if (m_schema_name_length > sizeof(m_schema_name))
return 1;
if (m_schema_name_length > 0)
memcpy(m_schema_name, pfs->m_schema_name, sizeof(m_schema_name));
m_object_name_length= pfs->m_table_name_length;
if (m_object_name_length > sizeof(m_object_name))
return 1;
if (m_object_name_length > 0)
memcpy(m_object_name, pfs->m_table_name, sizeof(m_object_name));
return 0;
}
void PFS_object_row::set_field(uint index, Field *f)
{
switch(index)
{
case 0: /* OBJECT_TYPE */
set_field_object_type(f, m_object_type);
break;
case 1: /* SCHEMA_NAME */
PFS_engine_table::set_field_varchar_utf8(f, m_schema_name, m_schema_name_length);
break;
case 2: /* OBJECT_NAME */
PFS_engine_table::set_field_varchar_utf8(f, m_object_name, m_object_name_length);
break;
default:
DBUG_ASSERT(false);
}
}
int PFS_index_row::make_row(PFS_table_share *pfs, uint table_index)
{
if (m_object_row.make_row(pfs))
return 1;
if (table_index < MAX_INDEXES)
{
PFS_table_key *key= &pfs->m_keys[table_index];
m_index_name_length= key->m_name_length;
if (m_index_name_length > sizeof(m_index_name))
return 1;
memcpy(m_index_name, key->m_name, sizeof(m_index_name));
}
else
m_index_name_length= 0;
return 0;
}
void PFS_index_row::set_field(uint index, Field *f)
{
switch(index)
{
case 0: /* OBJECT_TYPE */
case 1: /* SCHEMA_NAME */
case 2: /* OBJECT_NAME */
m_object_row.set_field(index, f);
break;
case 3: /* INDEX_NAME */
if (m_index_name_length > 0)
PFS_engine_table::set_field_varchar_utf8(f, m_index_name, m_index_name_length);
else
f->set_null();
break;
default:
DBUG_ASSERT(false);
}
}
void PFS_statement_stat_row::set_field(uint index, Field *f)
{
switch (index)
{
case 0: /* COUNT_STAR */
case 1: /* SUM_TIMER_WAIT */
case 2: /* MIN_TIMER_WAIT */
case 3: /* AVG_TIMER_WAIT */
case 4: /* MAX_TIMER_WAIT */
m_timer1_row.set_field(index, f);
break;
case 5: /* SUM_LOCK_TIME */
PFS_engine_table::set_field_ulonglong(f, m_lock_time);
break;
case 6: /* SUM_ERRORS */
PFS_engine_table::set_field_ulonglong(f, m_error_count);
break;
case 7: /* SUM_WARNINGS */
PFS_engine_table::set_field_ulonglong(f, m_warning_count);
break;
case 8: /* SUM_ROWS_AFFECTED */
PFS_engine_table::set_field_ulonglong(f, m_rows_affected);
break;
case 9: /* SUM_ROWS_SENT */
PFS_engine_table::set_field_ulonglong(f, m_rows_sent);
break;
case 10: /* SUM_ROWS_EXAMINED */
PFS_engine_table::set_field_ulonglong(f, m_rows_examined);
break;
case 11: /* SUM_CREATED_TMP_DISK_TABLES */
PFS_engine_table::set_field_ulonglong(f, m_created_tmp_disk_tables);
break;
case 12: /* SUM_CREATED_TMP_TABLES */
PFS_engine_table::set_field_ulonglong(f, m_created_tmp_tables);
break;
case 13: /* SUM_SELECT_FULL_JOIN */
PFS_engine_table::set_field_ulonglong(f, m_select_full_join);
break;
case 14: /* SUM_SELECT_FULL_RANGE_JOIN */
PFS_engine_table::set_field_ulonglong(f, m_select_full_range_join);
break;
case 15: /* SUM_SELECT_RANGE */
PFS_engine_table::set_field_ulonglong(f, m_select_range);
break;
case 16: /* SUM_SELECT_RANGE_CHECK */
PFS_engine_table::set_field_ulonglong(f, m_select_range_check);
break;
case 17: /* SUM_SELECT_SCAN */
PFS_engine_table::set_field_ulonglong(f, m_select_scan);
break;
case 18: /* SUM_SORT_MERGE_PASSES */
PFS_engine_table::set_field_ulonglong(f, m_sort_merge_passes);
break;
case 19: /* SUM_SORT_RANGE */
PFS_engine_table::set_field_ulonglong(f, m_sort_range);
break;
case 20: /* SUM_SORT_ROWS */
PFS_engine_table::set_field_ulonglong(f, m_sort_rows);
break;
case 21: /* SUM_SORT_SCAN */
PFS_engine_table::set_field_ulonglong(f, m_sort_scan);
break;
case 22: /* SUM_NO_INDEX_USED */
PFS_engine_table::set_field_ulonglong(f, m_no_index_used);
break;
case 23: /* SUM_NO_GOOD_INDEX_USED */
PFS_engine_table::set_field_ulonglong(f, m_no_good_index_used);
break;
default:
DBUG_ASSERT(false);
break;
}
}
void PFS_connection_stat_row::set_field(uint index, Field *f)
{
switch (index)
{
case 0: /* CURRENT_CONNECTIONS */
PFS_engine_table::set_field_ulonglong(f, m_current_connections);
break;
case 1: /* TOTAL_CONNECTIONS */
PFS_engine_table::set_field_ulonglong(f, m_total_connections);
break;
default:
DBUG_ASSERT(false);
break;
}
}
void set_field_object_type(Field *f, enum_object_type object_type)
{
switch (object_type)
{
case OBJECT_TYPE_TABLE:
PFS_engine_table::set_field_varchar_utf8(f, "TABLE", 5);
break;
case OBJECT_TYPE_TEMPORARY_TABLE:
PFS_engine_table::set_field_varchar_utf8(f, "TEMPORARY TABLE", 15);
break;
default:
DBUG_ASSERT(false);
}
}
```
|
Nico Porteous (born 23 November 2001) is a New Zealand freestyle skier and an Olympic champion. He is New Zealand's youngest Olympic Games medallist, having won a bronze medal at the 2018 Winter Olympics at the age of 16. He became New Zealand's second Winter Olympic gold medallist, and first male, with his win in men's halfpipe at the Beijing 2022 Winter Olympics.
Early life and family
Porteous was introduced to skiing by his parents and learned to ski in France when he was three years old. He has had a professional coach since he was six years old. Porteous has been home-schooled through Te Aho o Te Kura Pounamu, as well as studying at Christ Church Grammar School in Perth, Western Australia. His older brother Miguel Porteous is also a freeskier and Olympian, having competed at the 2018 Winter Olympics and the 2022 Winter Olympics.
Career
When Porteous was 14, he became the youngest person in the world to land the triple cork 1440 (upside down three times, and four full spins). This has since been beaten by another skier.
Porteous was selected to compete at the 2018 Winter Olympics, making him the second-youngest Winter Olympian in the nation's history (behind Alice Robinson). In the men's halfpipe he won the bronze medal, becoming only the third New Zealander (and first male New Zealander) to win a medal at a Winter Olympics. At age 16 years 91 days, Porteous became New Zealand's youngest Olympic Games medallist, breaking the previous record of 16 years and 353 days set by Zoi Sadowski-Synnott earlier the same day, who had in turn broken the record of 17 years 100 days set by Danyon Loader at the 1992 Summer Olympics.
His best 2017–18 FIS Freestyle Ski World Cup finish is 6th at Cardrona Alpine Resort.
In 2019, Porteous claimed the bronze medal in the superpipe event at the Winter X Games in Aspen, Colorado.
At the 2019 Audi Nines Porteous performed a Switch Alley Oop Double Misty 1080.
In 2021, Porteous claimed his first X Games gold medal in the Superpipe event. In January 2022, Porteous won a gold medal in the freeski halfpipe event at the U.S. Grand Prix World Cup event in California, USA. During the 2022 X Games in Aspen, USA, Porteous defended his title by winning gold in superpipe on the final run of the competition.
On 19 February 2022, Porteous won the gold medal in the men's halfpipe event at the Beijing 2022 Winter Olympics. In the 2023 New Year Honours, he was appointed a Member of the New Zealand Order of Merit, for services to snow sports.
References
External links
Nico Porteous at Snow Sports NZ
Living people
New Zealand male freestyle skiers
2001 births
Olympic freestyle skiers for New Zealand
Freestyle skiers at the 2018 Winter Olympics
Freestyle skiers at the 2022 Winter Olympics
Olympic gold medalists for New Zealand
Olympic bronze medalists for New Zealand
Medalists at the 2018 Winter Olympics
Medalists at the 2022 Winter Olympics
Olympic medalists in freestyle skiing
Sportspeople from Hamilton, New Zealand
People from Wānaka
People educated at Te Aho o Te Kura Pounamu
X Games athletes
Members of the New Zealand Order of Merit
|
The Gulf of İzmir (), formerly known as the Gulf of Smyrna, is a gulf on the Aegean Sea, with its inlet between the Karaburun Peninsula and the mainland area of Foça. It is in length by in breadth, with an excellent anchorage. The city of İzmir, an important port city of Turkey, surrounds the end of the gulf.
Geography
The northern limit of the Gulf of İzmir is defined as a 13 nmi line running from Cape Kanlıkaya () of the Karaburun Peninsula, to Cape Aslan () of Foça. The surface area of the gulf is , while its shore length is .
Uzunada located in the Gulf of İzmir is Turkey's fourth largest island. Other islands of the gulf include Hekim Island, Foça Islands (Orak Island, Fener Ada, Incir Ada, Metalik Ada), Çiçek Islands (Yassıca Island, Pırnarlı Island, İncirli Island, Akça), Karantina Island, Yılan Island, and Büyük Ada.
Seventeen rivers empty into the gulf, most notably the Gediz and the Meles. Gediz Delta, which is a Ramsar site, is located in the northeast of the gulf.
Levent Marina is the only marina located in the gulf.
Geology
The Gulf of İzmir was formed during the Quaternary geological period. The east-west direction pit of the gulf was formed as a result of breaking the faults.
Flora and fauna
The northeastern coast of the gulf is the habitat of the Mediterranean monk seal. İzmir Birds Paradise in the north of the gulf and Çakalburnu Lagoon in the south are the breeding ground of the birds.
History
It is known that the first settlements around the gulf were in the Neolithic Age. The most known settlement is Smyrna, which was established around present-day Bayraklı in 3300s BC. Timur, who came to İzmir after the Battle of Ankara, seized İzmir Port Castle and its surroundings in December 1402 and ordered the destruction of the castle. During the First World War, naval battles occurred between Sancakburnu Castle and Urla in March 1915 and around Uzunada in May 1916.
Economy
Port of İzmir is a cargo and passenger port located to the east of the gulf. It is the seventh largest port of the country in terms of container volume and thirteenth in terms of cargo tonnage.
There are nine active passenger ferry quays in the gulf. The İZKARAY project, which envisages the joining of the two sides of the gulf with a bridge, an artificial island and a tunnel, will provide road and rail connections between Balçova and Çiğli districts.
Shipwrecks
There are five known shipwrecks in the Gulf of İzmir. At a depth of 16.4 meters off the Sancakburnu Castle, there are wrecks of two ships, one of which is 118 meters and the other is 86 meters long, which crashed into each other in 1957. There is another shipwreck located off Güzelbahçe at a depth of 42 meters, which was discovered at the beginning of 2017, thought to be a 78 meters long cargo ship that sank in the late 1800s. It is also stated that one to four ships were sunk in the gulf during the First World War. Dozens of shipwrecks off the Sancakburnu Castle were removed from the sea in 1967 and in the following years.
Pollution
In the period when 200,000 people lived around the gulf, the discharge of wastewater into the gulf did not cause any obvious problems. However, with the population exceeding 500,000 and industrialization, waste that has exceeded the capacity of the gulf to renew itself has begun to be discharged into the gulf. In this period, pollution became noticeable and the people could no longer swim in the gulf. With the population exceeding 1.7 million in the 1990s, the level of pollution has risen a lot and heavy metal traces were found in fish. In 1992, the treatment and sewage system, called the Grand Canal Project, started to be built by İZSU. Launched in October 2002, the system prevented waste water discharge to the gulf. By the 2010s, it was observed that the pollution in the gulf was removed and the marine life returned to normal. With the Gulf of İzmir Oceanographic Monitoring Project carried out by İZSU since 2000, the cleaning of the gulf is tracked.
Leisure
Sailing is supported by Karşıyaka S.K. and Göztepe S.K. in the inner gulf. Yacht, sailing, canoe, rowing and dragon boat races are held in the gulf with the İzmir Gulf Festival, which is organized annually since 2017. The gulf hosts the İnciraltı Sea Museum and the Zübeyde Hanım Education and Museum Ship. There are nine Blue Flag beaches around the gulf (four in Foça, three in Karaburun, one in Güzelbahçe and one in Urla). There is a ban on diving in twelve points in the gulf to protect cultural and natural heritage.
References
External links
Geography of İzmir
Landforms of İzmir Province
Izmir
Izmir
|
Euphrasia micrantha is a species of flowering plant belonging to the family Orobanchaceae.
Its native range is Europe.
Synonym:
Euphrasia glabrescens (Wettst.) Wiinst.
References
micrantha
Taxa named by Ludwig Reichenbach
|
Marvin Scandrick (born September 25, 1977), better known as Slim, is an American contemporary R&B singer best known as the lead singer/frontman for the group 112. His 2008 debut album Love's Crazy peaked at No. 32 on the Billboard 200. It included the hit singles "So Fly", which reached No. 49 on the Billboard Hot 100, and "Good Lovin'", which reached No. 39 on the Hot R&B/Hip-Hop Songs chart.
Discography
Albums
2008: Love's Crazy
2016: Re-Fueled
Singles
References
Living people
21st-century American singers
21st-century African-American male singers
American male singers
American hip hop singers
American contemporary R&B singers
American soul musicians
Asylum Records artists
Singers from Atlanta
Place of birth missing (living people)
112 (band)
1977 births
|
```yaml
id: 306175
update_date: Fri, 07 Feb 2020 14:07:57 UTC
unit: 288216
```
|
The Franklin Street station was a station on the demolished IRT Sixth Avenue Line in Manhattan, New York City. It was located at Franklin Street and West Broadway, and it had two tracks and two side platforms. There was space for two additional tracks in the station. South of the station there are two additional tracks that served to layup trains.
History
The station opened on June 5, 1878 as part of a line along Trinity Place, Church Avenue, West Broadway, and Sixth Avenue between Rector Street and 58th Street. The line was built by the Gilbert Elevated Railway Company, which would later come to be known as the Metropolitan Elevated Railway Company.
The station closed on December 4, 1938, with the rest of the Sixth Avenue Elevated. The Franklin Street station on the IRT Broadway–Seventh Avenue Line is the closest subway station to serve as a replacement.
References
IRT Sixth Avenue Line stations
Railway stations in the United States opened in 1878
Former elevated and subway stations in Manhattan
1878 establishments in New York (state)
1938 disestablishments in New York (state)
Railway stations in the United States closed in 1938
|
```java
package com.ctrip.xpipe.redis.core.meta.clone;
import com.ctrip.xpipe.redis.core.entity.RedisCheckRuleMeta;
import com.ctrip.xpipe.redis.core.meta.InnerMetaClone;
/**
* @author lishanglin
* date 2023/12/13
*/
public class RedisCheckRuleMetaClone implements InnerMetaClone<RedisCheckRuleMeta> {
@Override
public RedisCheckRuleMeta clone(RedisCheckRuleMeta o) {
RedisCheckRuleMeta clone = new RedisCheckRuleMeta();
clone.setId(o.getId());
clone.mergeAttributes(o);
return clone;
}
}
```
|
Eduard Sandifort (November 14, 1742 – February 12, 1814) was a Dutch physician and anatomist. He received his medical doctorate degree (Ph.D.) from Leiden University in 1763, and worked as a general practitioner in The Hague. He was fluent in Dutch, German, Swedish, and Italian. He became a professor of anatomy and surgery in 1771 at Leiden University. His most important writings are Observationes Anatomico-pathologicæ (1778), Excercitationes anatomicoacademicæ (1783–85), and the Museum Anatomicum Academiae Lugduno-Batavæ (1789–93), which was finished by his son, Gerard Sandifort (1779–1848). Sandifort translated Nils Rosén von Rosenstein's Underrättelser om barn-sjukdomar och deras botemedel (The diseases of children, and their remedies) to Dutch in 1768. Sandifort was elected in 1768 as a foreign member of the Swedish Royal Academy of Sciences in Stockholm. In 1779 he was the first to document a case of carpal coalition.
References
1742 births
1814 deaths
Dutch anatomists
18th-century Dutch anatomists
Leiden University alumni
Academic staff of Leiden University
People from Dordrecht
|
```go
package lnwire
import (
"io"
)
// UpdateFee is the message the channel initiator sends to the other peer if
// the channel commitment fee needs to be updated.
type UpdateFee struct {
// ChanID is the channel that this UpdateFee is meant for.
ChanID ChannelID
// FeePerKw is the fee-per-kw on commit transactions that the sender of
// this message wants to use for this channel.
//
// TODO(halseth): make SatPerKWeight when fee estimation is moved to
// own package. Currently this will cause an import cycle.
FeePerKw uint32
}
// NewUpdateFee creates a new UpdateFee message.
func NewUpdateFee(chanID ChannelID, feePerKw uint32) *UpdateFee {
return &UpdateFee{
ChanID: chanID,
FeePerKw: feePerKw,
}
}
// A compile time check to ensure UpdateFee implements the lnwire.Message
// interface.
var _ Message = (*UpdateFee)(nil)
// Decode deserializes a serialized UpdateFee message stored in the passed
// io.Reader observing the specified protocol version.
//
// This is part of the lnwire.Message interface.
func (c *UpdateFee) Decode(r io.Reader, pver uint32) error {
return ReadElements(r,
&c.ChanID,
&c.FeePerKw,
)
}
// Encode serializes the target UpdateFee into the passed io.Writer
// observing the protocol version specified.
//
// This is part of the lnwire.Message interface.
func (c *UpdateFee) Encode(w io.Writer, pver uint32) error {
return WriteElements(w,
c.ChanID,
c.FeePerKw,
)
}
// MsgType returns the integer uniquely identifying this message type on the
// wire.
//
// This is part of the lnwire.Message interface.
func (c *UpdateFee) MsgType() MessageType {
return MsgUpdateFee
}
// MaxPayloadLength returns the maximum allowed payload size for an UpdateFee
// complete message observing the specified protocol version.
//
// This is part of the lnwire.Message interface.
func (c *UpdateFee) MaxPayloadLength(uint32) uint32 {
// 32 + 4
return 36
}
// TargetChanID returns the channel id of the link for which this message is
// intended.
//
// NOTE: Part of peer.LinkUpdater interface.
func (c *UpdateFee) TargetChanID() ChannelID {
return c.ChanID
}
```
|
```xml
/*************************************************************
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
/**
* @fileoverview Implements the MmlMenclose node
*
* @author dpvc@mathjax.org (Davide Cervone)
*/
import {PropertyList} from '../../Tree/Node.js';
import {MmlNode, AbstractMmlNode, TEXCLASS} from '../MmlNode.js';
/*****************************************************************/
/**
* Implements the MmlEnclose node class (subclass of AbstractMmlNode)
*/
export class MmlMenclose extends AbstractMmlNode {
/**
* @override
*/
public static defaults: PropertyList = {
...AbstractMmlNode.defaults,
notation: 'longdiv'
};
/**
* TeX class is ORD
*/
protected texclass = TEXCLASS.ORD;
/**
* The menclose kind
* @override
*/
public get kind() {
return 'menclose';
}
/**
* <menclose> has an inferred mrow
* @override
*/
public get arity() {
return -1;
}
/**
* <menclose> is a linebreak container
* @override
*/
public get linebreakContininer() {
return true;
}
/**
* @override
*/
public setTeXclass(prev: MmlNode) {
prev = this.childNodes[0].setTeXclass(prev);
this.updateTeXclass(this.childNodes[0]);
return prev;
}
}
```
|
```java
package com.jimmysun.algorithms.chapter6;
import edu.princeton.cs.algs4.StdIn;
import edu.princeton.cs.algs4.StdOut;
public class LRS {
public static void main(String[] args) {
String text = StdIn.readAll();
int N = text.length();
SuffixArray sa = new SuffixArray(text);
String lrs = "";
for (int i = 1; i < N; i++) {
int length = sa.lcp(i);
if (length > lrs.length()) {
lrs = sa.select(i).substring(0, length);
}
}
StdOut.println(lrs);
}
}
```
|
ONE: Bad Blood was a Combat sport event produced by ONE Championship that took place on February 11, 2022, at the Singapore Indoor Stadium in Kallang, Singapore.
Background
Bibiano Fernandes was scheduled to make his second ONE bantamweight title defense against John Lineker in the main event. However, Lineker tested positive for COVID days before the event and the bout was pulled and However, the bout was moved to ONE: Lights Out.
An interim ONE Heavyweight World Championship bout between Anatoly Malykhin and Kiril Grishenko was scheduled for ONE: Only the Brave, but the bout was moved to this event and was promoted to the main event.
Former ONE Flyweight Muay Thai Champion Jonathan Haggerty will make his return to action when he faces #4-ranking Flyweight Muay Thai Mongkolpetch Petchyindee Academy.
A strawweight bout between former ONE Strawweight Champion Yosuke Saruta and Gustavo Balart was planned for the event. However, Saruta tested positive for COVID days before the event and the bout will be rescheduled.
A welterweight bout between former title challenger Ken Hasegawa and Murad Ramazanov was scheduled for the event. However, Hasegawa was injured and out of his clash with Murad Ramazanov, the bout is set to be rebooked.
The Filipina fighter Jenelyn Olsim was set to faces Jihin Radzuan of Malaysia in a women's atomweight bout. However, a two days before the event, Olsim withdrew from the bout, reportedly because she has suffered an injury during her training. She was replaced by Mei Yamaguchi.
Results
Bonus awards
The following fighters were awarded bonuses:
$100,000 Performance of the Night: Anatoly Malykhin
$50,000 Performance of the Night: Jonathan Haggerty and Woo Sung Hoon
See also
2022 in ONE Championship
List of ONE Championship events
List of current ONE fighters
References
Events in Singapore
ONE Championship events
2022 in mixed martial arts
Mixed martial arts in Singapore
Sports competitions in Singapore
February 2022 sports events in Singapore
|
```xml
import { ChildProcess, fork } from 'child_process';
import buildDebug from 'debug';
import fs from 'fs';
import path from 'path';
import { fromJStoYAML } from '@verdaccio/config';
import { HTTP_STATUS, TOKEN_BEARER, fileUtils } from '@verdaccio/core';
import { ConfigYaml } from '@verdaccio/types';
import { buildToken } from '@verdaccio/utils';
import { ServerQuery } from './request';
const { writeFile } = fs.promises ? fs.promises : require('fs/promises');
const buildAuthHeader = (token: string): string => {
return buildToken(TOKEN_BEARER, token);
};
const debug = buildDebug('verdaccio:registry');
const defaultOptions: Options = {
domain: 'localhost',
port: 4873,
createUser: false,
credentials: {
user: 'foo',
password: '12345',
},
debug: false,
};
type Options = {
domain: string;
port: number;
createUser: boolean;
credentials: { user: string; password: string };
debug: boolean;
};
export class Registry {
private childFork: any;
private configPath: string;
private domain: string;
private createUser: boolean;
private authstr: string | null = null;
private port: number;
private credentials;
private token: string | null = null;
private debug: boolean;
public constructor(configPath: string, options: Partial<Options> = {}) {
const _options = { ...defaultOptions, ...options };
this.configPath = configPath;
this.createUser = _options.createUser;
this.port = _options.port;
this.domain = _options.domain;
this.debug = _options.debug;
this.credentials = _options.credentials;
}
public static async fromConfigToPath(
config: Partial<ConfigYaml>
): Promise<{ tempFolder: string; configPath: string; yamlContent: string }> {
debug(`fromConfigToPath`);
const tempFolder = await fileUtils.createTempFolder('registry-');
debug(`tempFolder %o`, tempFolder);
const yamlContent = fromJStoYAML(config) as string;
const configPath = path.join(tempFolder, 'registry.yaml');
await writeFile(configPath, yamlContent);
debug(`configPath %o`, configPath);
return {
tempFolder,
configPath,
yamlContent,
};
}
public init(verdaccioPath: string): Promise<ChildProcess> {
return this._start(verdaccioPath);
}
public getToken() {
return this.token;
}
public getAuthStr() {
return this.authstr;
}
public getPort() {
return this.port;
}
public getDomain() {
return this.domain;
}
public getRegistryUrl() {
return `path_to_url{this.getDomain()}:${this.getPort()}`;
}
private _start(
verdaccioPath: string = path.join(__dirname, '../../bin/verdaccio')
): Promise<ChildProcess> {
debug('_start %o', verdaccioPath);
debug('port %o', this.port);
return new Promise((resolve, reject) => {
let childOptions = {
silent: false,
};
if (this.debug) {
const debugPort = this.port + 5;
debug('debug port %o', debugPort);
childOptions = Object.assign({}, childOptions, {
execArgv: [`--inspect=${debugPort}`],
env: {
DEBUG: process.env.DEBUG,
VERDACCIO_SERVER: process.env.VERDACCIO_SERVER,
},
});
} else {
childOptions = Object.assign({}, childOptions, {
env: {
DEBUG: process.env.DEBUG,
VERDACCIO_SERVER: process.env.VERDACCIO_SERVER,
},
});
}
const { configPath } = this;
debug('configPath %s', configPath);
debug('port %s', this.port);
this.childFork = fork(
verdaccioPath,
['-c', configPath, '-l', String(this.port)],
childOptions
);
this.childFork.on('message', async (msg: any) => {
// verdaccio_started is a message that comes from verdaccio in debug mode that
// notify has been started
try {
if ('verdaccio_started' in msg) {
const server = new ServerQuery(`path_to_url{this.domain}:` + this.port);
if (this.createUser) {
const user = await server.createUser(
this.credentials.user,
this.credentials.password
);
user.status(HTTP_STATUS.CREATED).body_ok(new RegExp(this.credentials.user));
// @ts-ignore
this.token = user?.response?.body.token;
this.authstr = buildAuthHeader(this.token as string);
}
return resolve(this.childFork);
}
} catch (e: any) {
// eslint-disable-next-line no-console
console.error(e);
// eslint-disable-next-line prefer-promise-reject-errors
return reject([e, this]);
}
});
this.childFork.on('error', (err) => {
debug('error %s', err);
// eslint-disable-next-line prefer-promise-reject-errors
reject([err, this]);
});
this.childFork.on('disconnect', (err) => {
// eslint-disable-next-line prefer-promise-reject-errors
reject([err, this]);
});
this.childFork.on('exit', (err) => {
// eslint-disable-next-line prefer-promise-reject-errors
reject([err, this]);
});
});
}
public stop(): void {
return this.childFork.kill('SIGINT');
}
}
```
|
```java
package com.wonderkiln.camerakit;
public abstract class CameraKitEventListenerAdapter implements CameraKitEventListener {
@Override
public void onEvent(CameraKitEvent event) {
}
@Override
public void onError(CameraKitError error) {
}
@Override
public void onImage(CameraKitImage image) {
}
@Override
public void onVideo(CameraKitVideo video) {
}
}
```
|
Mikhail Piskunov (21 December 1967 – 10 September 2002) was a professional rugby league footballer who played his whole club career for Paris Saint-Germain of the European Super League. He also represented France and Russia at international level.
In 2002, Piskunov died in a car accident at the age of 34.
Club
198?-1993 : Tiraspol
1993-1998 : Villefranche XIII Aveyron
1996 : Paris Saint-Germain Rugby League
1998-1999 : Stade Aurillacois Cantal Auvergne
1999-2000 : Stade Rodez Aveyron
2000-2002 : Sporting Club decazevillois
Playing career
In 1996, Piskunov made his professional debut for PSG in Round 1 against the Sheffield Eagles. This was PSG's inaugural game in club history, winning 30-24. Mikhail Piskunov scored once that game.
Despite starting his club career in 1996, Piskunov was a national representative for the Russian national team (then known as the Commonwealth of Independent States). He played 2 games for the team at the centre position in 1992, both against South Africa. Piskunov's team won 30-26 and 22-19.
He represented France in 1997 in a game against South Africa. Playing wing, his side won 30-17.
References
1967 births
2002 deaths
Expatriate rugby league players in France
Moldovan rugby league players
Villefranche XIII Aveyron players
Paris Saint-Germain Rugby League players
Road incident deaths in France
France national rugby league team players
Moldovan expatriate sportspeople in France
Soviet sportsmen
French rugby league players
Russia national rugby league team players
Rugby league centres
Naturalized citizens of France
Naturalised sports competitors
Rugby league wingers
|
```prolog
:- use_module(library(between)).
run_numlist(Upper, Head) :- numlist(1, Upper, L), L = [Head|_].
```
|
Lenacapavir, sold under the brand name Sunlenca, is an antiretroviral medication used to treat HIV/AIDS. It is taken by mouth or by subcutaneous injection.
The most common side effects include reactions at the injection site and nausea.
Lenacapavir was approved for medical use in the European Union in August 2022, in Canada in November 2022, and in the United States in December 2022.
Lenacapavir is the first of a new class of drugs called capsid inhibitors to be FDA-approved for treating HIV/AIDS. Lenacapavir works by blocking the HIV-1 viral capsid, interfering with essential steps of the virus's lifecycle. The US Food and Drug Administration (FDA) considers it to be a first-in-class medication.
Medical uses
Lenacapavir, in combination with other antiretrovirals, is indicated for the treatment of HIV/AIDS. It is used in heavily treatment-experienced adults with multiple drug resistance in whom current antiretroviral therapy is ineffective due to resistance, intolerance or safety considerations.
History
Lenacapavir is being developed by Gilead Sciences.
As of 2021, it is in phase II/III clinical trials. It is being investigated as a treatment for HIV patients infected with multidrug-resistant virus and as a twice-yearly injectable for pre-exposure prophylaxis (PrEP).
The safety and efficacy of lenacapavir were established through a multicenter clinical trial with 72 participants whose HIV infections were resistant to multiple classes of HIV medications. These participants had to have high levels of virus in their blood despite being on antiretroviral drugs. Participants were enrolled into one of two study groups. One group was randomized to receive either lenacapavir or placebo in a double-blind fashion, and the other group received open-label lenacapavir. The primary measure of efficacy was the proportion of participants in the randomized study group who achieved a certain level of reduction in virus during the initial 14 days compared to baseline.
The U.S. Food and Drug Administration (FDA) granted the application for lenacapavir priority review, fast track, and breakthrough therapy designations. The FDA granted the approval of Sunlenca to Gilead Sciences.
Society and culture
Legal status
On 23 June 2022, the Committee for Medicinal Products for Human Use (CHMP) of the European Medicines Agency (EMA) adopted a positive opinion, recommending the granting of a marketing authorization for the medicinal product Sunlenca, intended for the treatment of adults with multidrug‑resistant human immunodeficiency virus type 1 (HIV‑1) infection. The applicant for this medicinal product is Gilead Sciences Ireland UC.
Lenacapavir was approved for medical use in the European Union in August 2022, in Canada in November 2022, and in the United States in December 2022.
References
External links
Amides
Antiretroviral drugs
Breakthrough therapy
Chloroarenes
Cyclopropanes
Fluoroarenes
Gilead Sciences
Indazoles
Orphan drugs
Pyridines
Sulfonamides
Trifluoromethyl compounds
|
Hsieh Pei-chen (; born 31 January 1988) is a Taiwanese badminton player. She won gold medal at the 2010 World University Championships in the mixed doubles event partnered with Chen Hung-ling.
Achievements
East Asian Games
Women's doubles
Mixed doubles
Summer Universiade
Women's doubles
Mixed doubles
World University Championships
Women's doubles
Mixed doubles
Asian Junior Championships
Mixed doubles
BWF Grand Prix
The BWF Grand Prix has two levels, the BWF Grand Prix and Grand Prix Gold. It is a series of badminton tournaments sanctioned by the Badminton World Federation (BWF) since 2007.
Women's doubles
BWF Grand Prix Gold tournament
BWF Grand Prix tournament
BWF International Challenge/Series
Women's doubles
Mixed doubles
BWF International Challenge tournament
BWF International Series tournament
BWF Future Series tournament
References
External links
1988 births
Living people
Sportspeople from Taipei
Taiwanese female badminton players
Badminton players at the 2010 Asian Games
Badminton players at the 2014 Asian Games
Asian Games competitors for Chinese Taipei
Universiade silver medalists for Chinese Taipei
Universiade bronze medalists for Chinese Taipei
Universiade medalists in badminton
Medalists at the 2011 Summer Universiade
Medalists at the 2015 Summer Universiade
21st-century Taiwanese women
|
Jón Gunnar Árnason (1931 – 1989 in Reykjavík) was an Icelandic sculptor. After studying at the University of Iceland Reykjavík Arts and Crafts from 1944 to 1946 and the School of Visual Arts, he graduated as an engineer from the Technical University of Reykjavik in 1952. From 1965 to 1967 he continued his studies of the fine arts at the Hornsey College of Art in London.
His sculpture Sólfar () is a landmark on the seafront in Reykjavík. His works have been exhibited in galleries in Iceland, Norway, the Netherlands and Germany. He was a member of the Icelandic Sculptors Society which he established in Reykjavík in 1972 along with Hallsteinn Sigurðsson, Ragnar Kjartansson, Þorbjörg Pálsdóttir and others.
References
External links
A display of some of Jón Gunnar's artwork – UMM
Photograph of the "Solfar"
1931 births
1989 deaths
Jon Gunnar Arnason
Jon Gunnar Arnason
|
```go
// cgo -godefs types_netbsd.go | go run mkpost.go
// Code generated by the command above; see README.md. DO NOT EDIT.
// +build 386,netbsd
package unix
const (
SizeofPtr = 0x4
SizeofShort = 0x2
SizeofInt = 0x4
SizeofLong = 0x4
SizeofLongLong = 0x8
)
type (
_C_short int16
_C_int int32
_C_long int32
_C_long_long int64
)
type Timespec struct {
Sec int64
Nsec int32
}
type Timeval struct {
Sec int64
Usec int32
}
type Rusage struct {
Utime Timeval
Stime Timeval
Maxrss int32
Ixrss int32
Idrss int32
Isrss int32
Minflt int32
Majflt int32
Nswap int32
Inblock int32
Oublock int32
Msgsnd int32
Msgrcv int32
Nsignals int32
Nvcsw int32
Nivcsw int32
}
type Rlimit struct {
Cur uint64
Max uint64
}
type _Gid_t uint32
type Stat_t struct {
Dev uint64
Mode uint32
Ino uint64
Nlink uint32
Uid uint32
Gid uint32
Rdev uint64
Atim Timespec
Mtim Timespec
Ctim Timespec
Btim Timespec
Size int64
Blocks int64
Blksize uint32
Flags uint32
Gen uint32
Spare [2]uint32
}
type Statfs_t [0]byte
type Flock_t struct {
Start int64
Len int64
Pid int32
Type int16
Whence int16
}
type Dirent struct {
Fileno uint64
Reclen uint16
Namlen uint16
Type uint8
Name [512]int8
Pad_cgo_0 [3]byte
}
type Fsid struct {
X__fsid_val [2]int32
}
const (
PathMax = 0x400
)
const (
FADV_NORMAL = 0x0
FADV_RANDOM = 0x1
FADV_SEQUENTIAL = 0x2
FADV_WILLNEED = 0x3
FADV_DONTNEED = 0x4
FADV_NOREUSE = 0x5
)
type RawSockaddrInet4 struct {
Len uint8
Family uint8
Port uint16
Addr [4]byte /* in_addr */
Zero [8]int8
}
type RawSockaddrInet6 struct {
Len uint8
Family uint8
Port uint16
Flowinfo uint32
Addr [16]byte /* in6_addr */
Scope_id uint32
}
type RawSockaddrUnix struct {
Len uint8
Family uint8
Path [104]int8
}
type RawSockaddrDatalink struct {
Len uint8
Family uint8
Index uint16
Type uint8
Nlen uint8
Alen uint8
Slen uint8
Data [12]int8
}
type RawSockaddr struct {
Len uint8
Family uint8
Data [14]int8
}
type RawSockaddrAny struct {
Addr RawSockaddr
Pad [92]int8
}
type _Socklen uint32
type Linger struct {
Onoff int32
Linger int32
}
type Iovec struct {
Base *byte
Len uint32
}
type IPMreq struct {
Multiaddr [4]byte /* in_addr */
Interface [4]byte /* in_addr */
}
type IPv6Mreq struct {
Multiaddr [16]byte /* in6_addr */
Interface uint32
}
type Msghdr struct {
Name *byte
Namelen uint32
Iov *Iovec
Iovlen int32
Control *byte
Controllen uint32
Flags int32
}
type Cmsghdr struct {
Len uint32
Level int32
Type int32
}
type Inet6Pktinfo struct {
Addr [16]byte /* in6_addr */
Ifindex uint32
}
type IPv6MTUInfo struct {
Addr RawSockaddrInet6
Mtu uint32
}
type ICMPv6Filter struct {
Filt [8]uint32
}
const (
SizeofSockaddrInet4 = 0x10
SizeofSockaddrInet6 = 0x1c
SizeofSockaddrAny = 0x6c
SizeofSockaddrUnix = 0x6a
SizeofSockaddrDatalink = 0x14
SizeofLinger = 0x8
SizeofIPMreq = 0x8
SizeofIPv6Mreq = 0x14
SizeofMsghdr = 0x1c
SizeofCmsghdr = 0xc
SizeofInet6Pktinfo = 0x14
SizeofIPv6MTUInfo = 0x20
SizeofICMPv6Filter = 0x20
)
const (
PTRACE_TRACEME = 0x0
PTRACE_CONT = 0x7
PTRACE_KILL = 0x8
)
type Kevent_t struct {
Ident uint32
Filter uint32
Flags uint32
Fflags uint32
Data int64
Udata int32
}
type FdSet struct {
Bits [8]uint32
}
const (
SizeofIfMsghdr = 0x98
SizeofIfData = 0x84
SizeofIfaMsghdr = 0x18
SizeofIfAnnounceMsghdr = 0x18
SizeofRtMsghdr = 0x78
SizeofRtMetrics = 0x50
)
type IfMsghdr struct {
Msglen uint16
Version uint8
Type uint8
Addrs int32
Flags int32
Index uint16
Pad_cgo_0 [2]byte
Data IfData
Pad_cgo_1 [4]byte
}
type IfData struct {
Type uint8
Addrlen uint8
Hdrlen uint8
Pad_cgo_0 [1]byte
Link_state int32
Mtu uint64
Metric uint64
Baudrate uint64
Ipackets uint64
Ierrors uint64
Opackets uint64
Oerrors uint64
Collisions uint64
Ibytes uint64
Obytes uint64
Imcasts uint64
Omcasts uint64
Iqdrops uint64
Noproto uint64
Lastchange Timespec
}
type IfaMsghdr struct {
Msglen uint16
Version uint8
Type uint8
Addrs int32
Flags int32
Metric int32
Index uint16
Pad_cgo_0 [6]byte
}
type IfAnnounceMsghdr struct {
Msglen uint16
Version uint8
Type uint8
Index uint16
Name [16]int8
What uint16
}
type RtMsghdr struct {
Msglen uint16
Version uint8
Type uint8
Index uint16
Pad_cgo_0 [2]byte
Flags int32
Addrs int32
Pid int32
Seq int32
Errno int32
Use int32
Inits int32
Pad_cgo_1 [4]byte
Rmx RtMetrics
}
type RtMetrics struct {
Locks uint64
Mtu uint64
Hopcount uint64
Recvpipe uint64
Sendpipe uint64
Ssthresh uint64
Rtt uint64
Rttvar uint64
Expire int64
Pksent int64
}
type Mclpool [0]byte
const (
SizeofBpfVersion = 0x4
SizeofBpfStat = 0x80
SizeofBpfProgram = 0x8
SizeofBpfInsn = 0x8
SizeofBpfHdr = 0x14
)
type BpfVersion struct {
Major uint16
Minor uint16
}
type BpfStat struct {
Recv uint64
Drop uint64
Capt uint64
Padding [13]uint64
}
type BpfProgram struct {
Len uint32
Insns *BpfInsn
}
type BpfInsn struct {
Code uint16
Jt uint8
Jf uint8
K uint32
}
type BpfHdr struct {
Tstamp BpfTimeval
Caplen uint32
Datalen uint32
Hdrlen uint16
Pad_cgo_0 [2]byte
}
type BpfTimeval struct {
Sec int32
Usec int32
}
type Termios struct {
Iflag uint32
Oflag uint32
Cflag uint32
Lflag uint32
Cc [20]uint8
Ispeed int32
Ospeed int32
}
type Winsize struct {
Row uint16
Col uint16
Xpixel uint16
Ypixel uint16
}
type Ptmget struct {
Cfd int32
Sfd int32
Cn [1024]byte
Sn [1024]byte
}
const (
AT_FDCWD = -0x64
AT_SYMLINK_FOLLOW = 0x400
AT_SYMLINK_NOFOLLOW = 0x200
)
type PollFd struct {
Fd int32
Events int16
Revents int16
}
const (
POLLERR = 0x8
POLLHUP = 0x10
POLLIN = 0x1
POLLNVAL = 0x20
POLLOUT = 0x4
POLLPRI = 0x2
POLLRDBAND = 0x80
POLLRDNORM = 0x40
POLLWRBAND = 0x100
POLLWRNORM = 0x4
)
type Sysctlnode struct {
Flags uint32
Num int32
Name [32]int8
Ver uint32
X__rsvd uint32
Un [16]byte
X_sysctl_size [8]byte
X_sysctl_func [8]byte
X_sysctl_parent [8]byte
X_sysctl_desc [8]byte
}
type Utsname struct {
Sysname [256]byte
Nodename [256]byte
Release [256]byte
Version [256]byte
Machine [256]byte
}
const SizeofClockinfo = 0x14
type Clockinfo struct {
Hz int32
Tick int32
Tickadj int32
Stathz int32
Profhz int32
}
```
|
Robin Mark Richardson (born 26 June 1942) is a Canadian former politician and Vancouver Islander separatist/activist who was a Progressive Conservative member of the House of Commons of Canada. He represented the Toronto, Ontario riding of Beaches from 1979 to 1980. He is the founder and current leader of the Vancouver Island Party.
Background
Richardson's profession is an economist, once working with the Fraser Institute. At one time, he was a minister for a Christian church in Esquimalt.
Politics
Richardson represented Ontario's Beaches electoral district which he won in the 1979 federal election. After serving his only term, the 31st Canadian Parliament, he was defeated in the 1980 federal election by Neil Young of the New Democratic Party.
In September 2000, he unsuccessfully challenged incumbent Esquimalt—Juan de Fuca Member of Parliament Keith Martin for the Canadian Alliance nomination in that riding. Richardson was particularly critical of Martin's pro-choice position on abortion, while Martin had finished in fourth place during the Canadian Alliance leadership campaign earlier that year. Richardson managed Stockwell Day's successful leadership campaign within Esquimalt—Juan de Fuca.
In June 2016, he started the Vancouver Island Party and serves as leader. The party seeks to make Vancouver Island Canada's 11th province.
Electoral record
References
External links
1942 births
Living people
Canadian Protestant ministers and clergy
Canadian economists
Members of the House of Commons of Canada from Ontario
Politicians from Vancouver
Progressive Conservative Party of Canada MPs
|
```css
/* General setup */
* {
box-sizing: border-box;
}
body {
margin: 0 auto;
min-width: 1000px;
max-width: 1400px;
}
/* Layout */
section {
float: left;
width: 50%;
}
aside {
float: left;
width: 30%;
}
nav {
float: left;
width: 20%;
}
footer {
clear: both;
}
header, section, aside, nav, footer {
padding: 20px;
}
/* header and footer */
header, footer {
border-top: 5px solid #a66;
border-bottom: 5px solid #a66;
}
/* WRITE YOUR CODE BELOW HERE */
/* font imports */
/*
Lovato light font obtained from fontspring.com,
originally created by Philatype
See path_to_url
Josefin slab bold obtained from fontsquirrel.com,
originally created by Typemade
See path_to_url
*/
@font-face {
font-family: 'lovatolight';
src: url('fonts/Lovato-Light-webfont.eot');
src: url('fonts/Lovato-Light-webfont.eot?#iefix') format('embedded-opentype'),
url('fonts/Lovato-Light-webfont.woff2') format('woff2'),
url('fonts/Lovato-Light-webfont.woff') format('woff'),
url('fonts/Lovato-Light-webfont.ttf') format('truetype'),
url('fonts/Lovato-Light-webfont.svg#lovatolight') format('svg');
font-weight: normal;
font-style: normal;
}
@font-face {
font-family: 'josefin_slabbold';
src: url('fonts/josefinslab-bold-webfont.eot');
src: url('fonts/josefinslab-bold-webfont.eot?#iefix') format('embedded-opentype'),
url('fonts/josefinslab-bold-webfont.woff2') format('woff2'),
url('fonts/josefinslab-bold-webfont.woff') format('woff'),
url('fonts/josefinslab-bold-webfont.ttf') format('truetype'),
url('fonts/josefinslab-bold-webfont.svg#josefin_slabbold') format('svg');
font-weight: normal;
font-style: normal;
}
/* typography stuff */
html {
font-family: lovatolight, serif;
font-size: 10px;
}
h1, h2 {
font-family: josefin_slabbold, sans-serif;
letter-spacing: 2px;
}
h1 {
font-size: 5rem;
text-align: center;
}
h2 {
font-size: 3.2rem;
}
section h2 + p {
text-indent: 20px;
}
p, li {
font-size: 1.6rem;
line-height: 1.5;
letter-spacing: 0.5px;
word-spacing: 3px;
}
/* Link styling */
a {
outline: none;
}
a[href*="http"] {
padding-right: 19px;
background: url(external-link-52.png) no-repeat 100% 0;
background-size: 16px 16px;
}
a:link, a:visited {
color: #a66;
}
a:focus, a:hover {
text-decoration: none;
}
a:active {
color: transparent;
text-shadow: 0px 0px 1px #f00,
0px 0px 2px #f00,
0px 0px 3px black,
0px 0px 4px black;
}
/* lists: extra margin top and bottom to make it
always have the same spacing as with paragraphs */
ul, ol {
margin: 1.6rem 0;
}
ul {
list-style-type: square;
}
ol {
list-style-type: lower-latin;
}
/* nav menu */
nav ul {
padding-left: 0;
margin-top: 0.8rem;
}
nav li {
list-style-type: none;
margin-bottom: 2rem;
}
nav li a {
text-decoration: none;
display: inline-block;
width: 100%;
line-height: 3;
text-align: center;
font-size: 2.5rem;
border: 1px solid #a66;
}
nav li a:focus, nav li a:hover {
color: white;
background: #a66;
}
nav li a:active {
color: white;
background: black;
}
```
|
```c++
/*
*
* This program is free software: you can redistribute it and/or modify
* the Free Software Foundation, either version 2 or (at your option)
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
*
* along with this program. If not, see <path_to_url
*/
#include "TestCryptoHash.h"
#include "crypto/Crypto.h"
#include "crypto/CryptoHash.h"
#include <QTest>
QTEST_GUILESS_MAIN(TestCryptoHash)
void TestCryptoHash::initTestCase()
{
QVERIFY(Crypto::init());
}
void TestCryptoHash::test()
{
CryptoHash cryptoHash1(CryptoHash::Sha256);
QCOMPARE(cryptoHash1.result(),
QByteArray::fromHex(your_sha256_hash));
QByteArray source2 = QString("KeePassX").toLatin1();
QByteArray result2 = CryptoHash::hash(source2, CryptoHash::Sha256);
QCOMPARE(result2, QByteArray::fromHex(your_sha256_hash));
CryptoHash cryptoHash3(CryptoHash::Sha256);
cryptoHash3.addData(QString("KeePa").toLatin1());
cryptoHash3.addData(QString("ssX").toLatin1());
QCOMPARE(cryptoHash3.result(),
QByteArray::fromHex(your_sha256_hash));
CryptoHash cryptoHash2(CryptoHash::Sha512);
QCOMPARE(cryptoHash2.result(),
QByteArray::fromHex(your_sha256_hash47d0d13c5d85f2b0ff831"
"8d2877eec2f63b931bd47417a81a538327af927da3e"));
QByteArray result3 = CryptoHash::hash(source2, CryptoHash::Sha512);
QCOMPARE(result3,
QByteArray::fromHex(your_sha256_hash48057d59e6ff"
"d777970e282871c25a549a2763e5b724794f312c97021c42f91d"));
CryptoHash cryptoHash4(CryptoHash::Sha512);
cryptoHash4.addData(QString("KeePa").toLatin1());
cryptoHash4.addData(QString("ssX").toLatin1());
QCOMPARE(cryptoHash4.result(),
QByteArray::fromHex(your_sha256_hash48057d59e6ffd777970e2"
"82871c25a549a2763e5b724794f312c97021c42f91d"));
}
```
|
Geltsdale is a hamlet and former civil parish, now in the parish of Castle Carrock, in the Cumberland district, in the ceremonial county of Cumbria, England, to the southeast of Castle Carrock village. In 2001 the parish had a population of 6. From 1858 Geltsdale was a civil parish in its own right. On 1 April 2003 the parish was abolished and merged with Castle Carrock.
The Geltsdale Reservoir railway ran in the vicinity.
The local landscapes are under several levels of protection. Two of the protected areas cover a large area:
the North Pennines Area of Outstanding Natural Beauty
the North Pennines Moors Special Protection Area (147,276 ha)
Geltsdale & Glendue Fells Site of Special Scientific Interest has an area of 8,059 ha, and is one of the SSSIs which underlie the SPA.
Geltsdale RSPB reserve is a 5,000 ha nature reserve within the SSSI. It mainly moorland and is managed by the Royal Society for Protection of Birds for upland birds such as black grouse and hen harrier.
References
External links
Cumbria County History Trust: Geltsdale Forest (nb: provisional research only – see Talk page)
Hamlets in Cumbria
Former civil parishes in Cumbria
City of Carlisle
Protected areas of Cumbria
|
```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';
// MODULES //
var float64ToFloat32 = require( '@stdlib/number/float64/base/to-float32' );
// MAIN //
/**
* Computes the variance of a single-precision floating-point strided array using a one-pass algorithm proposed by Youngs and Cramer.
*
* ## Method
*
* - This implementation uses a one-pass algorithm, as proposed by Youngs and Cramer (1971).
*
* ## References
*
* - Youngs, Edward A., and Elliot M. Cramer. 1971. "Some Results Relevant to Choice of Sum and Sum-of-Product Algorithms." _Technometrics_ 13 (3): 65765. doi:[10.1080/00401706.1971.10488826](path_to_url
*
* @param {PositiveInteger} N - number of indexed elements
* @param {number} correction - degrees of freedom adjustment
* @param {Float32Array} x - input array
* @param {integer} stride - stride length
* @returns {number} variance
*
* @example
* var Float32Array = require( '@stdlib/array/float32' );
*
* var x = new Float32Array( [ 1.0, -2.0, 2.0 ] );
* var N = x.length;
*
* var v = svarianceyc( N, 1, x, 1 );
* // returns ~4.3333
*/
function svarianceyc( N, correction, x, stride ) {
var sum;
var ix;
var S;
var v;
var d;
var n;
var i;
n = N - correction;
if ( N <= 0 || n <= 0.0 ) {
return NaN;
}
if ( N === 1 || stride === 0 ) {
return 0.0;
}
if ( stride < 0 ) {
ix = (1-N) * stride;
} else {
ix = 0;
}
sum = x[ ix ];
ix += stride;
S = 0.0;
for ( i = 2; i <= N; i++ ) {
v = x[ ix ];
sum = float64ToFloat32( sum+v );
d = float64ToFloat32( float64ToFloat32( i*v ) - sum );
S = float64ToFloat32( S + float64ToFloat32( float64ToFloat32( float64ToFloat32( 1.0/(i*(i-1)) ) * d ) * d ) ); // eslint-disable-line max-len
ix += stride;
}
return float64ToFloat32( S/n );
}
// EXPORTS //
module.exports = svarianceyc;
```
|
```python
#
#
# path_to_url
#
# Unless required by applicable law or agreed to in writing, software
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# ==============================================================================
"""Tests for models.faster_rcnn_nas_feature_extractor."""
import unittest
import tensorflow.compat.v1 as tf
from object_detection.models import faster_rcnn_nas_feature_extractor as frcnn_nas
from object_detection.utils import tf_version
@unittest.skipIf(tf_version.is_tf2(), 'Skipping TF1.X only test.')
class FasterRcnnNASFeatureExtractorTest(tf.test.TestCase):
def _build_feature_extractor(self, first_stage_features_stride):
return frcnn_nas.FasterRCNNNASFeatureExtractor(
is_training=False,
first_stage_features_stride=first_stage_features_stride,
batch_norm_trainable=False,
reuse_weights=None,
weight_decay=0.0)
def test_extract_proposal_features_returns_expected_size(self):
feature_extractor = self._build_feature_extractor(
first_stage_features_stride=16)
preprocessed_inputs = tf.random_uniform(
[1, 299, 299, 3], maxval=255, dtype=tf.float32)
rpn_feature_map, _ = feature_extractor.extract_proposal_features(
preprocessed_inputs, scope='TestScope')
features_shape = tf.shape(rpn_feature_map)
init_op = tf.global_variables_initializer()
with self.test_session() as sess:
sess.run(init_op)
features_shape_out = sess.run(features_shape)
self.assertAllEqual(features_shape_out, [1, 19, 19, 4032])
def test_extract_proposal_features_input_size_224(self):
feature_extractor = self._build_feature_extractor(
first_stage_features_stride=16)
preprocessed_inputs = tf.random_uniform(
[1, 224, 224, 3], maxval=255, dtype=tf.float32)
rpn_feature_map, _ = feature_extractor.extract_proposal_features(
preprocessed_inputs, scope='TestScope')
features_shape = tf.shape(rpn_feature_map)
init_op = tf.global_variables_initializer()
with self.test_session() as sess:
sess.run(init_op)
features_shape_out = sess.run(features_shape)
self.assertAllEqual(features_shape_out, [1, 14, 14, 4032])
def test_extract_proposal_features_input_size_112(self):
feature_extractor = self._build_feature_extractor(
first_stage_features_stride=16)
preprocessed_inputs = tf.random_uniform(
[1, 112, 112, 3], maxval=255, dtype=tf.float32)
rpn_feature_map, _ = feature_extractor.extract_proposal_features(
preprocessed_inputs, scope='TestScope')
features_shape = tf.shape(rpn_feature_map)
init_op = tf.global_variables_initializer()
with self.test_session() as sess:
sess.run(init_op)
features_shape_out = sess.run(features_shape)
self.assertAllEqual(features_shape_out, [1, 7, 7, 4032])
def test_extract_proposal_features_dies_on_invalid_stride(self):
with self.assertRaises(ValueError):
self._build_feature_extractor(first_stage_features_stride=99)
def test_extract_proposal_features_dies_with_incorrect_rank_inputs(self):
feature_extractor = self._build_feature_extractor(
first_stage_features_stride=16)
preprocessed_inputs = tf.random_uniform(
[224, 224, 3], maxval=255, dtype=tf.float32)
with self.assertRaises(ValueError):
feature_extractor.extract_proposal_features(
preprocessed_inputs, scope='TestScope')
def test_extract_box_classifier_features_returns_expected_size(self):
feature_extractor = self._build_feature_extractor(
first_stage_features_stride=16)
proposal_feature_maps = tf.random_uniform(
[2, 17, 17, 1088], maxval=255, dtype=tf.float32)
proposal_classifier_features = (
feature_extractor.extract_box_classifier_features(
proposal_feature_maps, scope='TestScope'))
features_shape = tf.shape(proposal_classifier_features)
init_op = tf.global_variables_initializer()
with self.test_session() as sess:
sess.run(init_op)
features_shape_out = sess.run(features_shape)
self.assertAllEqual(features_shape_out, [2, 9, 9, 4032])
if __name__ == '__main__':
tf.test.main()
```
|
```php
<?php
/**
* ALIPAY API: alipay.commerce.cityfacilitator.voucher.upload request
*
* @author auto create
* @since 1.0, 2017-04-21 11:52:12
*/
class AlipayCommerceCityfacilitatorVoucherUploadRequest
{
/**
*
**/
private $bizContent;
private $apiParas = array();
private $terminalType;
private $terminalInfo;
private $prodCode;
private $apiVersion="1.0";
private $notifyUrl;
private $returnUrl;
private $needEncrypt=false;
public function setBizContent($bizContent)
{
$this->bizContent = $bizContent;
$this->apiParas["biz_content"] = $bizContent;
}
public function getBizContent()
{
return $this->bizContent;
}
public function getApiMethodName()
{
return "alipay.commerce.cityfacilitator.voucher.upload";
}
public function setNotifyUrl($notifyUrl)
{
$this->notifyUrl=$notifyUrl;
}
public function getNotifyUrl()
{
return $this->notifyUrl;
}
public function setReturnUrl($returnUrl)
{
$this->returnUrl=$returnUrl;
}
public function getReturnUrl()
{
return $this->returnUrl;
}
public function getApiParas()
{
return $this->apiParas;
}
public function getTerminalType()
{
return $this->terminalType;
}
public function setTerminalType($terminalType)
{
$this->terminalType = $terminalType;
}
public function getTerminalInfo()
{
return $this->terminalInfo;
}
public function setTerminalInfo($terminalInfo)
{
$this->terminalInfo = $terminalInfo;
}
public function getProdCode()
{
return $this->prodCode;
}
public function setProdCode($prodCode)
{
$this->prodCode = $prodCode;
}
public function setApiVersion($apiVersion)
{
$this->apiVersion=$apiVersion;
}
public function getApiVersion()
{
return $this->apiVersion;
}
public function setNeedEncrypt($needEncrypt)
{
$this->needEncrypt=$needEncrypt;
}
public function getNeedEncrypt()
{
return $this->needEncrypt;
}
}
```
|
Susana Gladis Vilca Achata (born August 11, 1959) is a Peruvian politician and was a Congresswoman representing Puno for the 2006–2011 term. Vilca belonged to the Union for Peru party.
Susana Gladis Vilca Achata is a mining engineer with a master's degree in Environmental Protection Technologies. She also has studies completed in the master's degree in Mining Management developed at Gerens Escuela de Postgrado.
She was elected Congresswoman of the Republic for the period 2006–2011, she also held the position of Vice Minister of Mines of the Ministry of Energy and Mines between the years 2011 and 2012, and was president of the board of directors of the Geological, Mining and Metallurgical Institute (Ingemmet) between the years 2012 and 2016.
She was also appointed Doctor Honoris Causa by the Universidad Nacional del Altiplano and has served as vice-president of the Asociación de Servicios de Geología y Minería Iberoamericanos – ASGMI.
Family
She is the daughter of Don José Vilca and Doña Clotilde Achata. She is the eldest of six children. She did her primary studies at School No. 1124 in the District of Cabanillas and her secondary studies at the Adventist School of Chullunquiani in the city of Juliaca.
Later, she entered the Faculty of Mining Engineering at the National University of the Altiplano in Puno. She graduates as a Mining Engineer with the thesis "Technical Economic Study for the Exploitation of Alluvial Gold", research developed in the Norma Mine in the province of Sandía in Puno.
Career
Vice President of the Association of Ibero-American Geological and Mining Services (ASGMI) (2016)
President of the Geological, Mining and Metallurgical Institute-INGEMMET (January 2012 – Set 2016)
Vice Minister of Mines of the Peruvian Government (August 2011 – January 2012)
Coordinator of the Transfer Process of the Ministry of Transport and Communications (June 2011 – July 2011)
Member of the Permanent Commission of the Congress of the Republic (August 2010 – July 2011)
Vice President of the Energy and Mines Commission of the Peruvian Congress (August 2010 – July 2011)
Coordinator of the Puno Parliamentary Group (August 2009 – July 2010)
Member of the Permanent Commission of the Congress of the Republic (August 2009 – July 2010)
President of the Transport and Communications Commission of the Peruvian Congress (August 2007 – July 2008)
Vice President of the Energy and Mines Commission of the Peruvian Congress (August 2006 – July 2007)
Regional Coordinator in Puno of the Peruvian Nationalist Party.
References
External links
Official Congressional Site
Living people
1959 births
Peruvian Ministers of Energy and Mines
Members of the Congress of the Republic of Peru
Union for Peru politicians
Women government ministers of Peru
Mining engineers
Popular Action (Peru) politicians
Peruvian Nationalist Party politicians
Universidad Nacional del Altiplano de Puno alumni
Women members of the Congress of the Republic of Peru
|
```java
package com.zheng.upms.rpc.service.impl;
import com.zheng.common.annotation.BaseService;
import com.zheng.common.base.BaseServiceImpl;
import com.zheng.upms.dao.mapper.UpmsRoleMapper;
import com.zheng.upms.dao.model.UpmsRole;
import com.zheng.upms.dao.model.UpmsRoleExample;
import com.zheng.upms.rpc.api.UpmsRoleService;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;
import org.springframework.beans.factory.annotation.Autowired;
import org.springframework.stereotype.Service;
import org.springframework.transaction.annotation.Transactional;
/**
* UpmsRoleService
* Created by shuzheng on 2017/3/20.
*/
@Service
@Transactional
@BaseService
public class UpmsRoleServiceImpl extends BaseServiceImpl<UpmsRoleMapper, UpmsRole, UpmsRoleExample> implements UpmsRoleService {
private static final Logger LOGGER = LoggerFactory.getLogger(UpmsRoleServiceImpl.class);
@Autowired
UpmsRoleMapper upmsRoleMapper;
}
```
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.