text
stringlengths 1
22.8M
|
|---|
Johannes Hendricus Heuckelbach (5 March 1893, Amsterdam – 18 June 1976, Amsterdam) was a Dutch boxer who competed in the 1920 Summer Olympics. In 1920 he was eliminated in the first round of the welterweight class after losing his fight to Ivan Schannong of Denmark.
References
External links
list of Dutch boxers
1893 births
1976 deaths
Welterweight boxers
Olympic boxers for the Netherlands
Boxers at the 1920 Summer Olympics
Boxers from Amsterdam
Dutch male boxers
|
```smalltalk
using System;
using NUnit.Framework;
using Xamarin.Forms.Core.UnitTests;
namespace Xamarin.Forms.Xaml.UnitTests
{
public partial class Bz55343 : ContentPage
{
public Bz55343()
{
InitializeComponent();
}
public Bz55343(bool useCompiledXaml)
{
//this stub will be replaced at compile time
}
[TestFixture]
class Tests
{
[SetUp]
public void Setup()
{
Device.PlatformServices = new MockPlatformServices();
}
[TearDown]
public void TearDown()
{
Device.PlatformServices = null;
}
[TestCase(true)]
[TestCase(false)]
public void OnPlatformFontConversion(bool useCompiledXaml)
{
((MockPlatformServices)Device.PlatformServices).RuntimePlatform = Device.iOS;
var layout = new Bz55343(useCompiledXaml);
Assert.That(layout.label0.FontSize, Is.EqualTo(16d));
Assert.That(layout.label1.FontSize, Is.EqualTo(64d));
}
}
}
}
```
|
The Deeply Vale Festivals were free festivals held near Bury in northwest England in 1976, 1977, 1978 and 1979 and at a different site in 1980 and 1981. They are regarded as significant events that united punk music into the festival scene. Anniversary festivals took place in March 2015 and September 2016.
History
1970s
In the 1970s Rochdale resident and associate of John Peel (through his links with the band Tractor) Chris Hewitt was one of the main organisers of the event between 1976 and 1978 along with residents of a commune further up Oldham Road in Rochdale. Hewitt's inspiration for Deeply Vale Festivals was partly triggered working on Bickershaw Festival with Jeremy Beadle in 1972 and an event at Rivington Pike in August 1976. Chris went on to produce many other festivals and concerts and start a record company Ozit/Dandelion Records.
Deeply Vale 1976–79
Starting with an audience of 300 camping for two days in 1976 watching space rockers Body and John Peel favourites Tractor, the festival grew to 3,000 in 1977 (bands including Andy McCluskey's Pegasus, a forerunner of OMD in 1977). By 1978 and 1979 there were 20,000 people watching bands and camping for six days.
Festival Welfare Services (a Home Office sponsored body) said in a 1978 report that the Deeply Vale Festival "was actually better organised than the large Bob Dylan concert at Blackbushe the same summer"; "In fact in 1978 it was a model for how festivals should be run". It was the biggest free festival in England ending its annual run in the valley of Deeply Vale after four years in 1979.
As with the 1970s festivals, Deeply Vale hoped to bring together music of all styles and has since been credited as a catalyst for many bands who have formed since the 1970s festivals. Among people who claim to have been in the audience and inspired to pursue a musical career include Andy Rourke of The Smiths, David Gedge from the Wedding Present, Dave Fielding, Mark Burgess and Reg Smithies from the Chameleons, Jimi Goodwin from the Doves, Boff Whalley from Chumbawamba Steve Cowen from the Mock Turtles and Ian Brown from the Stone Roses.
The Deeply Vale Festivals were the first of the hippie music festivals to mix punk bands on the bill in among festival stalwarts like Steve Hillage, Nik Turner, the Ruts, Misty in Roots, Tractor (who had already achieved some notoriety as a John Peel band), Here and Now, Alan Wild (now with Physical Wrecks) and The Fall.
The Fall were regulars at the festival at a young age (and Mark E. Smith held the event in high esteem), and Durutti Column played their fourth ever gig on the Deeply Vale Festival stage. Both these bands were introduced by a young Tony Wilson who had just started his own record company and offered to help his friend Chris Hewitt by appearing at Deeply Vale in 1978.
The festival resumed on a smaller scale at Pickup Bank (Edgworth/Darwen) in 1980 and 1981.
Recognition 2009
In September 2009, two buildings associated with Deeply Vale Festivals, Factory Records, Tractor and John Peel – one building formerly Tractor Sound Studios in Heywood and one in Rochdale Tractor Music / Cargo Studios – had blue plaques unveiled to commemorate the important part the buildings played in the genealogy of rock music. The blue plaques campaign was put together by Peter Hook and Chris Hewitt.
Truly, Madly, Deeply Vale
Luke Bainbridge (journalist and editor of the Observer Music Monthly and attendee of Deeply Vale Festivals as a youngster) said in the 2004 ITV documentary Truly, Madly, Deeply Vale that the festivals were far more organised than Glastonbury by 1978. In July 2007 the DVD Deeply Vale Festivals was released. It contains 3 hours 40 minutes of archive band performances and interviews and the 49-minute Truly, Madly, Deeply Vale film plus other rare interviews, crowd footage and band performances.
Festivals book
A 272-page A4 book tracing the history of the four festivals in the Deeply Vale valley 1976/77/78/79, the two (Deeply Vale 1980 and 1981) festivals at Pickup Bank, the Rivington Pike Free Festivals 1976 and 1977, and the Manchester 1978 Rock Against Racism concerts was released in October 2014. The book came in a box set and contained eight hours of Deeply Vale related music spread over 6 CDs.
Deeply Vale 2015
Following the release of the documentary, there were plans to resurrect the festival in this century. One idea was to merge with relaunching the Bickershaw Festival to become the Deeply Vale Bickershaw Festival. In the end Deeply Vale happened again after the release of the 2014 box set.
On 20 March 2015, Deeply Vale Festival 2015 took place in Heywood with Steve Hillage, with Mark E Smith from The Fall there to watch him, plus other performances from Notsensibles, Nik Turner, Segs from The Ruts, Victor Brox, George Borowski, Andy T, Graham Massey and Graham Clark, Andy Sharrocks and Accident on the East Lancs, Wilful Damage, Physical Wrecks, Movement Banned and Brian Eastwood and Pie.
Deeply Vale 2016
To mark the 40th anniversary of the first year of Deeply Vale 1976, on Saturday 17 and Sunday 18 September 2016 a festival was held at the Heywood Civic Centre in Heywood, including appearances by many of the artists who had played the original festivals: Steve Hillage, members of Here and Now and Gong, Nik Turner, Segs from The Ruts, The Drones, Victor Brox, Andy T, Mike Sweeney and the Salford Jets, Fast Cars, Andy Sharrocks and Accident on the East Lancs, Wilful Damage, Physical Wrecks, George Borowski and Gaynor Wilson with Jaki Windmill, Andy Bole, Potential Victims, Crude Oil Inc, Alchemist, Mudanzas and loads more. The festival weekend was captured on film and released as a beautiful artworked 3 DVD set.
Further reading
See also
List of punk rock festivals
List of historic rock festivals
References
External links
Deeply Vale Festival
Deeply Vale Free Festival 1976–1979, ukrockfestivals
Concerts in the United Kingdom
Counterculture
Free festivals
Counterculture festivals
Music festivals in Greater Manchester
Rock festivals in England
1976 establishments in England
1979 disestablishments in England
Recurring events disestablished in 1979
Punk rock festivals
Music festivals established in 1976
|
```rust
//! Implementation of the fragment headers from [RFC 4944 5.3].
//!
//! [RFC 4944 5.3]: path_to_url#section-5.3
use super::{DISPATCH_FIRST_FRAGMENT_HEADER, DISPATCH_FRAGMENT_HEADER};
use crate::wire::{Error, Result};
use crate::wire::{Ieee802154Address, Ieee802154Repr};
use byteorder::{ByteOrder, NetworkEndian};
/// Key used for identifying all the link fragments that belong to the same packet.
#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord)]
#[cfg_attr(feature = "defmt", derive(defmt::Format))]
pub struct Key {
pub(crate) ll_src_addr: Ieee802154Address,
pub(crate) ll_dst_addr: Ieee802154Address,
pub(crate) datagram_size: u16,
pub(crate) datagram_tag: u16,
}
/// A read/write wrapper around a 6LoWPAN Fragment header.
/// [RFC 4944 5.3] specifies the format of the header.
///
/// A First Fragment header has the following format:
/// ```txt
/// 1 2 3
/// 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
/// +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
/// |1 1 0 0 0| datagram_size | datagram_tag |
/// +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
/// ```
///
/// Subsequent fragment headers have the following format:
/// ```txt
/// 1 2 3
/// 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
/// +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
/// |1 1 1 0 0| datagram_size | datagram_tag |
/// +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
/// |datagram_offset|
/// +-+-+-+-+-+-+-+-+
/// ```
///
/// [RFC 4944 5.3]: path_to_url#section-5.3
#[derive(Debug, Clone)]
#[cfg_attr(feature = "defmt", derive(defmt::Format))]
pub struct Packet<T: AsRef<[u8]>> {
buffer: T,
}
pub const FIRST_FRAGMENT_HEADER_SIZE: usize = 4;
pub const NEXT_FRAGMENT_HEADER_SIZE: usize = 5;
mod field {
use crate::wire::field::*;
pub const DISPATCH: usize = 0;
pub const DATAGRAM_SIZE: Field = 0..2;
pub const DATAGRAM_TAG: Field = 2..4;
pub const DATAGRAM_OFFSET: usize = 4;
pub const FIRST_FRAGMENT_REST: Rest = super::FIRST_FRAGMENT_HEADER_SIZE..;
pub const NEXT_FRAGMENT_REST: Rest = super::NEXT_FRAGMENT_HEADER_SIZE..;
}
impl<T: AsRef<[u8]>> Packet<T> {
/// Input a raw octet buffer with a 6LoWPAN Fragment header structure.
pub const fn new_unchecked(buffer: T) -> Self {
Self { buffer }
}
/// Shorthand for a combination of [new_unchecked] and [check_len].
///
/// [new_unchecked]: #method.new_unchecked
/// [check_len]: #method.check_len
pub fn new_checked(buffer: T) -> Result<Self> {
let packet = Self::new_unchecked(buffer);
packet.check_len()?;
let dispatch = packet.dispatch();
if dispatch != DISPATCH_FIRST_FRAGMENT_HEADER && dispatch != DISPATCH_FRAGMENT_HEADER {
return Err(Error);
}
Ok(packet)
}
/// Ensure that no accessor method will panic if called.
/// Returns `Err(Error)` if the buffer is too short.
pub fn check_len(&self) -> Result<()> {
let buffer = self.buffer.as_ref();
if buffer.is_empty() {
return Err(Error);
}
match self.dispatch() {
DISPATCH_FIRST_FRAGMENT_HEADER if buffer.len() >= FIRST_FRAGMENT_HEADER_SIZE => Ok(()),
DISPATCH_FIRST_FRAGMENT_HEADER if buffer.len() < FIRST_FRAGMENT_HEADER_SIZE => {
Err(Error)
}
DISPATCH_FRAGMENT_HEADER if buffer.len() >= NEXT_FRAGMENT_HEADER_SIZE => Ok(()),
DISPATCH_FRAGMENT_HEADER if buffer.len() < NEXT_FRAGMENT_HEADER_SIZE => Err(Error),
_ => Err(Error),
}
}
/// Consumes the frame, returning the underlying buffer.
pub fn into_inner(self) -> T {
self.buffer
}
/// Return the dispatch field.
pub fn dispatch(&self) -> u8 {
let raw = self.buffer.as_ref();
raw[field::DISPATCH] >> 3
}
/// Return the total datagram size.
pub fn datagram_size(&self) -> u16 {
let raw = self.buffer.as_ref();
NetworkEndian::read_u16(&raw[field::DATAGRAM_SIZE]) & 0b111_1111_1111
}
/// Return the datagram tag.
pub fn datagram_tag(&self) -> u16 {
let raw = self.buffer.as_ref();
NetworkEndian::read_u16(&raw[field::DATAGRAM_TAG])
}
/// Return the datagram offset.
pub fn datagram_offset(&self) -> u8 {
match self.dispatch() {
DISPATCH_FIRST_FRAGMENT_HEADER => 0,
DISPATCH_FRAGMENT_HEADER => {
let raw = self.buffer.as_ref();
raw[field::DATAGRAM_OFFSET]
}
_ => unreachable!(),
}
}
/// Returns `true` when this header is from the first fragment of a link.
pub fn is_first_fragment(&self) -> bool {
self.dispatch() == DISPATCH_FIRST_FRAGMENT_HEADER
}
/// Returns the key for identifying the packet it belongs to.
pub fn get_key(&self, ieee802154_repr: &Ieee802154Repr) -> Key {
Key {
ll_src_addr: ieee802154_repr.src_addr.unwrap(),
ll_dst_addr: ieee802154_repr.dst_addr.unwrap(),
datagram_size: self.datagram_size(),
datagram_tag: self.datagram_tag(),
}
}
}
impl<'a, T: AsRef<[u8]> + ?Sized> Packet<&'a T> {
/// Return the payload.
pub fn payload(&self) -> &'a [u8] {
match self.dispatch() {
DISPATCH_FIRST_FRAGMENT_HEADER => {
let raw = self.buffer.as_ref();
&raw[field::FIRST_FRAGMENT_REST]
}
DISPATCH_FRAGMENT_HEADER => {
let raw = self.buffer.as_ref();
&raw[field::NEXT_FRAGMENT_REST]
}
_ => unreachable!(),
}
}
}
impl<T: AsRef<[u8]> + AsMut<[u8]>> Packet<T> {
fn set_dispatch_field(&mut self, value: u8) {
let raw = self.buffer.as_mut();
raw[field::DISPATCH] = (raw[field::DISPATCH] & !(0b11111 << 3)) | (value << 3);
}
fn set_datagram_size(&mut self, size: u16) {
let raw = self.buffer.as_mut();
let mut v = NetworkEndian::read_u16(&raw[field::DATAGRAM_SIZE]);
v = (v & !0b111_1111_1111) | size;
NetworkEndian::write_u16(&mut raw[field::DATAGRAM_SIZE], v);
}
fn set_datagram_tag(&mut self, tag: u16) {
let raw = self.buffer.as_mut();
NetworkEndian::write_u16(&mut raw[field::DATAGRAM_TAG], tag);
}
fn set_datagram_offset(&mut self, offset: u8) {
let raw = self.buffer.as_mut();
raw[field::DATAGRAM_OFFSET] = offset;
}
}
/// A high-level representation of a 6LoWPAN Fragment header.
#[derive(Debug, PartialEq, Eq, Clone, Copy)]
pub enum Repr {
FirstFragment { size: u16, tag: u16 },
Fragment { size: u16, tag: u16, offset: u8 },
}
impl core::fmt::Display for Repr {
fn fmt(&self, f: &mut core::fmt::Formatter<'_>) -> core::fmt::Result {
match self {
Repr::FirstFragment { size, tag } => {
write!(f, "FirstFrag size={size} tag={tag}")
}
Repr::Fragment { size, tag, offset } => {
write!(f, "NthFrag size={size} tag={tag} offset={offset}")
}
}
}
}
#[cfg(feature = "defmt")]
impl defmt::Format for Repr {
fn format(&self, fmt: defmt::Formatter) {
match self {
Repr::FirstFragment { size, tag } => {
defmt::write!(fmt, "FirstFrag size={} tag={}", size, tag);
}
Repr::Fragment { size, tag, offset } => {
defmt::write!(fmt, "NthFrag size={} tag={} offset={}", size, tag, offset);
}
}
}
}
impl Repr {
/// Parse a 6LoWPAN Fragment header.
pub fn parse<T: AsRef<[u8]>>(packet: &Packet<T>) -> Result<Self> {
packet.check_len()?;
let size = packet.datagram_size();
let tag = packet.datagram_tag();
match packet.dispatch() {
DISPATCH_FIRST_FRAGMENT_HEADER => Ok(Self::FirstFragment { size, tag }),
DISPATCH_FRAGMENT_HEADER => Ok(Self::Fragment {
size,
tag,
offset: packet.datagram_offset(),
}),
_ => Err(Error),
}
}
/// Returns the length of the Fragment header.
pub const fn buffer_len(&self) -> usize {
match self {
Self::FirstFragment { .. } => field::FIRST_FRAGMENT_REST.start,
Self::Fragment { .. } => field::NEXT_FRAGMENT_REST.start,
}
}
/// Emit a high-level representation into a 6LoWPAN Fragment header.
pub fn emit<T: AsRef<[u8]> + AsMut<[u8]>>(&self, packet: &mut Packet<T>) {
match self {
Self::FirstFragment { size, tag } => {
packet.set_dispatch_field(DISPATCH_FIRST_FRAGMENT_HEADER);
packet.set_datagram_size(*size);
packet.set_datagram_tag(*tag);
}
Self::Fragment { size, tag, offset } => {
packet.set_dispatch_field(DISPATCH_FRAGMENT_HEADER);
packet.set_datagram_size(*size);
packet.set_datagram_tag(*tag);
packet.set_datagram_offset(*offset);
}
}
}
}
```
|
```xml
declare module 'is-port-reachable' {
export interface IsPortReachableOptions {
timeout?: number | undefined;
host?: string;
}
export default function (
port: number | undefined,
options?: IsPortReachableOptions
): Promise<boolean>;
}
```
|
```java
/*-
* #%L
* This file is part of QuPath.
* %%
* %%
* QuPath is free software: you can redistribute it and/or modify
* published by the Free Software Foundation, either version 3 of the
*
* QuPath 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 QuPath. If not, see <path_to_url
* #L%
*/
package qupath.lib.io;
import java.io.IOException;
import java.lang.reflect.Type;
import java.util.AbstractCollection;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.stream.Collectors;
import java.util.UUID;
import com.google.gson.Strictness;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;
import com.google.gson.reflect.TypeToken;
import com.google.gson.Gson;
import com.google.gson.GsonBuilder;
import com.google.gson.JsonArray;
import com.google.gson.JsonElement;
import com.google.gson.JsonObject;
import com.google.gson.TypeAdapter;
import com.google.gson.stream.JsonReader;
import com.google.gson.stream.JsonToken;
import com.google.gson.stream.JsonWriter;
import qupath.lib.common.ColorTools;
import qupath.lib.common.LogTools;
import qupath.lib.io.GsonTools.PathClassTypeAdapter;
import qupath.lib.measurements.MeasurementList;
import qupath.lib.measurements.MeasurementList.MeasurementListType;
import qupath.lib.measurements.MeasurementListFactory;
import qupath.lib.objects.PathAnnotationObject;
import qupath.lib.objects.PathCellObject;
import qupath.lib.objects.PathDetectionObject;
import qupath.lib.objects.PathObject;
import qupath.lib.objects.PathObjects;
import qupath.lib.objects.PathRootObject;
import qupath.lib.objects.PathTileObject;
import qupath.lib.objects.TMACoreObject;
import qupath.lib.objects.classes.PathClass;
import qupath.lib.objects.hierarchy.DefaultTMAGrid;
import qupath.lib.objects.hierarchy.PathObjectHierarchy;
import qupath.lib.objects.hierarchy.TMAGrid;
import qupath.lib.roi.interfaces.ROI;
class QuPathTypeAdapters {
static Gson gson = new GsonBuilder()
.setStrictness(Strictness.LENIENT)
.serializeSpecialFloatingPointValues()
.create();
static class PathObjectCollection extends AbstractCollection<PathObject> {
private List<PathObject> pathObjects = new ArrayList<>();
PathObjectCollection(Collection<? extends PathObject> pathObjects) {
this.pathObjects.addAll(pathObjects);
}
@Override
public Iterator<PathObject> iterator() {
return pathObjects.iterator();
}
@Override
public int size() {
return pathObjects.size();
}
}
static class ROICollection extends AbstractCollection<ROI> {
private List<ROI> rois = new ArrayList<>();
ROICollection(Collection<? extends ROI> rois) {
this.rois.addAll(rois);
}
@Override
public Iterator<ROI> iterator() {
return rois.iterator();
}
@Override
public int size() {
return rois.size();
}
}
static class HierarchyTypeAdapter extends TypeAdapter<PathObjectHierarchy> {
private static final Logger logger = LoggerFactory.getLogger(HierarchyTypeAdapter.class);
static HierarchyTypeAdapter INSTANCE = new HierarchyTypeAdapter();
@Override
public void write(JsonWriter out, PathObjectHierarchy value) throws IOException {
if (value == null && out.getSerializeNulls()) {
out.nullValue();
return;
}
out.beginObject();
out.name("root");
PathObjectTypeAdapter.INSTANCE_HIERARCHY.write(out, value.getRootObject());
// Store TMA core IDs only, to avoid duplicating the objects themselves
var tmaGrid = value.getTMAGrid();
if (tmaGrid != null) {
out.name("tmaGrid");
var proxy = new TMAGridProxy(tmaGrid);
gson.toJson(proxy, proxy.getClass(), out);
}
out.endObject();
}
@Override
public PathObjectHierarchy read(JsonReader in) throws IOException {
var token = in.peek();
if (token == JsonToken.NULL)
return null;
if (token != JsonToken.BEGIN_OBJECT)
throw new IOException("Expected BEGIN_OBJECT but found " + token);
var hierarchy = new PathObjectHierarchy();
JsonObject obj = gson.fromJson(in, JsonObject.class);
if (obj.has("root")) {
PathObject rootObject = PathObjectTypeAdapter.INSTANCE_HIERARCHY.fromJsonTree(obj.get("root"));
hierarchy.getRootObject().addChildObjects(new ArrayList<>(rootObject.getChildObjects()));
}
if (obj.has("tmaGrid")) {
TMAGridProxy proxy = gson.fromJson(obj.get("tmaGrid").getAsJsonObject(), TMAGridProxy.class);
var allCores = hierarchy.getAllObjects(false).stream().collect(Collectors.toMap(c -> c.getID(), c -> c));
var sortedCores = proxy.cores
.stream()
.map(i -> (TMACoreObject)allCores.getOrDefault(i, null))
.filter(c -> c != null)
.toList();
if (sortedCores.size() == proxy.cores.size()) {
var tmaGrid = DefaultTMAGrid.create(sortedCores, proxy.width);
hierarchy.setTMAGrid(tmaGrid);
} else {
logger.warn("Cannot deserialize TMA grid - matched {}/{} cores", sortedCores.size(), allCores.size());
}
}
return hierarchy;
}
}
@SuppressWarnings("unused")
static class TMAGridProxy {
private int width;
private List<UUID> cores;
TMAGridProxy(TMAGrid grid) {
this.width = grid.getGridWidth();
cores = grid.getTMACoreList().stream().map(c -> c.getID()).toList();
}
}
static class PathObjectCollectionTypeAdapter extends TypeAdapter<FeatureCollection> {
static PathObjectCollectionTypeAdapter INSTANCE = new PathObjectCollectionTypeAdapter();
static Type TYPE = new TypeToken<Collection<PathObject>>() {}.getType();
@Override
public void write(JsonWriter out, FeatureCollection value) throws IOException {
out.beginObject();
out.name("type");
out.value("FeatureCollection");
var adapter = value.getIncludeChildren() ? PathObjectTypeAdapter.INSTANCE_HIERARCHY : PathObjectTypeAdapter.INSTANCE;
out.name("features");
out.beginArray();
for (PathObject pathObject : value.getPathObjects()) {
adapter.write(out, pathObject);
}
out.endArray();
out.endObject();
}
@Override
public FeatureCollection read(JsonReader in) throws IOException {
List<PathObject> list = new ArrayList<>();
JsonArray array = null;
var token = in.peek();
if (token == JsonToken.BEGIN_ARRAY) {
array = gson.fromJson(in, JsonArray.class);
} else {
JsonObject obj = gson.fromJson(in, JsonObject.class);
if (obj.has("features") && obj.get("features").isJsonArray()) {
array = obj.get("features").getAsJsonArray();
}
}
if (array != null) {
for (JsonElement element : array) {
list.add(PathObjectTypeAdapter.INSTANCE.fromJsonTree(element));
}
}
return FeatureCollection.wrap(list);
// in.beginObject();
//
// String name = in.nextName(); // type
// String value = in.nextString();
//
// in.nextName();
// in.beginArray();
// List<PathObject> list = new ArrayList<>();
// while (in.hasNext()) {
// PathObject pathObject = PathObjectTypeAdapter.INSTANCE.read(in);
// list.add(pathObject);
// }
// in.endArray();
//
// in.endObject();
// return list;
}
}
static class PathObjectTypeAdapter extends TypeAdapter<PathObject> {
private static final Logger logger = LoggerFactory.getLogger(PathObjectTypeAdapter.class);
/**
* Get an instance that serializes a 'flat' object, ignoring child objects
*/
static PathObjectTypeAdapter INSTANCE = new PathObjectTypeAdapter(false);
/**
* Get an instance that serializes the object hierarchy - which means including child objects
*/
static PathObjectTypeAdapter INSTANCE_HIERARCHY = new PathObjectTypeAdapter(true);
/**
* In v0.2 we unwisely stored object type in an "id" property.
*/
private static Collection<String> LEGACY_TYPE_IDS = Collections.unmodifiableSet(new HashSet<>(Arrays.asList(
"PathTileObject",
"PathCellObject",
"TMACoreObject",
"PathDetectionObject",
"PathRootObject",
"PathAnnotationObject"
)));
private static Map<Class<?>, String> MAP_TYPES = Map.of(
PathTileObject.class, "tile",
PathCellObject.class, "cell",
PathDetectionObject.class, "detection",
PathAnnotationObject.class, "annotation",
TMACoreObject.class, "tmaCore",
PathRootObject.class, "root"
);
private boolean flattenProperties = false;
private boolean doHierarchy = false;
private PathObjectTypeAdapter(boolean doHierarchy) {
this.doHierarchy = doHierarchy;
}
@Override
public void write(JsonWriter out, PathObject value) throws IOException {
out.beginObject();
out.name("type");
out.value("Feature");
// Used in v0.2 (unwisely)
// out.name("id");
// out.value(value.getClass().getSimpleName());
// Since v0.4.0
var id = value.getID();
if (id != null) {
out.name("id");
out.value(id.toString());
}
// TODO: Write cell objects as a Geometry collection to include the nucleus as well
out.name("geometry");
ROITypeAdapters.ROI_ADAPTER_INSTANCE.write(out, value.getROI());
if (value instanceof PathCellObject) {
ROI roiNucleus = ((PathCellObject)value).getNucleusROI();
if (roiNucleus != null) {
out.name("nucleusGeometry");
ROITypeAdapters.ROI_ADAPTER_INSTANCE.write(out, roiNucleus);
}
}
out.name("properties");
out.beginObject();
String objectType = MAP_TYPES.getOrDefault(value.getClass(), null);
if (objectType != null) {
// out.name("object_type"); // Switch to camelCase consistently
out.name("objectType");
out.value(objectType);
} else {
logger.warn("Unknown object type {}", value.getClass().getSimpleName());
}
String name = value.getName();
if (name != null) {
out.name("name");
out.value(name);
}
Integer color = value.getColor();
if (color != null) {
out.name("color");
out.jsonValue(String.format("[%d, %d, %d]", ColorTools.red(color), ColorTools.green(color), ColorTools.blue(color)));
}
// Write classification
PathClass pathClass = value.getPathClass();
if (pathClass != null) {
out.name("classification");
PathClassTypeAdapter.INSTANCE.write(out, pathClass);
}
// Write locked status only if locked
if (value.isLocked()) {
out.name("isLocked");
out.value(true);
}
if (value instanceof TMACoreObject) {
out.name("isMissing");
out.value(((TMACoreObject)value).isMissing());
}
MeasurementList measurements = value.getMeasurementList();
if (flattenProperties) {
// Flattening properties probably not a good idea!
// Add measurements
if (!measurements.isEmpty()) {
out.name("Measurement count");
out.value(measurements.size());
for (var m : measurements.getMeasurements()) {
out.name(m.getName());
out.value(m.getValue());
}
}
var map = value.getMetadata();
if (!map.isEmpty()) {
out.name("Metadata count");
out.value(map.size());
for (var entry : map.entrySet()) {
out.name(entry.getKey());
out.value(entry.getValue());
}
}
} else {
if (!measurements.isEmpty()) {
out.name("measurements");
MeasurementListTypeAdapter.INSTANCE.write(out, measurements);
}
Map<String, String> map = value.getMetadata();
if (!map.isEmpty()) {
out.name("metadata");
gson.toJson(map, Map.class, out);
}
}
if (doHierarchy && value.hasChildObjects()) {
out.name("childObjects");
out.beginArray();
for (var child : value.getChildObjectsAsArray()) {
write(out, child);
}
out.endArray();
}
// Write metadata (new in v0.5.0)
var metadata = value.getMetadata();
if (!metadata.isEmpty()) {
out.name("metadata");
gson.toJson(metadata, Map.class, out);
}
out.endObject(); // Properties
out.endObject(); // PathObject/Feature
}
@Override
public PathObject read(JsonReader in) throws IOException {
JsonObject obj = gson.fromJson(in, JsonObject.class);
return parseObject(obj);
}
private PathObject parseObject(JsonObject obj) {
// Object type (annotation, detection etc.)
String type = "unknown";
// Get an ID
String id = null;
UUID uuid = null;
if (obj.has("id")) {
id = obj.get("id").getAsString();
// In v0.2, we (unwisely...) stored the type in an ID
if (LEGACY_TYPE_IDS.contains(id))
type = id;
else {
// From v0.4, we use UUID
try {
uuid = UUID.fromString(id);
id = null;
} catch (Exception e) {
logger.debug("Invalid ID found in GeoJSON");
}
}
}
ROI roi = ROITypeAdapters.ROI_ADAPTER_INSTANCE.fromJsonTree(obj.get("geometry"));
PathClass pathClass = null;
boolean isMissing = false;
boolean isLocked = false;
String name = null;
Integer color = null;
List<PathObject> childObjects = null;
MeasurementList measurementList = null;
JsonObject metadata = null;
if (obj.has("properties")) {
JsonObject properties = obj.get("properties").getAsJsonObject();
if (properties.has("name")) {
name = properties.get("name").getAsString();
}
if (properties.has("color")) {
var colorObj = properties.get("color");
if (colorObj.isJsonPrimitive())
color = colorObj.getAsInt();
else if (colorObj.isJsonArray()) {
var colorArray = colorObj.getAsJsonArray();
if (colorArray.size() == 3)
color = ColorTools.packRGB(
colorArray.get(0).getAsInt(),
colorArray.get(1).getAsInt(),
colorArray.get(2).getAsInt()
);
}
}
if (properties.has("classification")) {
pathClass = PathClassTypeAdapter.INSTANCE.fromJsonTree(properties.get("classification"));
}
if (properties.has("isMissing") && properties.get("isMissing").isJsonPrimitive()) {
isMissing = properties.get("isMissing").getAsBoolean();
}
if (properties.has("isLocked") && properties.get("isLocked").isJsonPrimitive()) {
isLocked = properties.get("isLocked").getAsBoolean();
}
if (properties.has("measurements") && (properties.get("measurements").isJsonArray() || properties.get("measurements").isJsonObject())) {
measurementList = MeasurementListTypeAdapter.INSTANCE.fromJsonTree(properties.get("measurements"));
}
if (properties.has("metadata") && properties.get("metadata").isJsonObject()) {
metadata = properties.get("metadata").getAsJsonObject();
}
if (properties.has("objectType")) {
type = properties.get("objectType").getAsString();
} else if (properties.has("object_type")) {
LogTools.warnOnce(logger, "PathObject using 'object_type' property - this should be updated to 'objectType'");
type = properties.get("object_type").getAsString();
} else if (properties.has("type")) {
// Allow 'type' to be used as an alias
type = properties.get("type").getAsString();
}
var childObjectsName = properties.has("childObjects") ? "childObjects" : "children";
if (properties.has(childObjectsName) && properties.get(childObjectsName).isJsonArray()) {
var children = properties.get(childObjectsName).getAsJsonArray();
childObjects = new ArrayList<>();
for (var child : children) {
var childObject = parseObject(child.getAsJsonObject());
if (childObject != null)
childObjects.add(childObject);
}
}
}
ROI roiNucleus = null;
if (obj.has("nucleusGeometry")) {
roiNucleus = ROITypeAdapters.ROI_ADAPTER_INSTANCE.fromJsonTree(obj.get("nucleusGeometry"));
}
PathObject pathObject = null;
switch (type) {
case ("PathTileObject"):
case ("tile"):
pathObject = PathObjects.createTileObject(roi);
break;
case ("PathCellObject"):
case ("cell"):
pathObject = PathObjects.createCellObject(roi, roiNucleus, null, null);
break;
case ("TMACoreObject"):
case ("tmaCore"):
case ("tma_core"):
pathObject = PathObjects.createTMACoreObject(roi.getBoundsX(), roi.getBoundsY(), roi.getBoundsWidth(), roi.getBoundsHeight(), isMissing);
break;
case ("PathDetectionObject"):
case ("detection"):
pathObject = PathObjects.createDetectionObject(roi);
break;
case ("PathRootObject"):
case ("root"):
pathObject = new PathRootObject();
break;
case ("PathAnnotationObject"):
case ("annotation"):
case ("unknown"):
// Default is to create an annotation
pathObject = PathObjects.createAnnotationObject(roi);
break;
default:
// Should be called if the type has been specified as *something*, but not something we recognize
logger.warn("Unknown object type {}, I will create an annotation", type);
pathObject = PathObjects.createAnnotationObject(roi);
}
if (uuid != null)
pathObject.setID(uuid);
if (measurementList != null && !measurementList.isEmpty()) {
try (var ml = pathObject.getMeasurementList()) {
ml.putAll(measurementList);
}
}
if (pathClass != null)
pathObject.setPathClass(pathClass);
if (name != null)
pathObject.setName(name);
if (color != null)
pathObject.setColor(color);
if (isLocked && !pathObject.isRootObject())
pathObject.setLocked(isLocked);
if (metadata != null && !metadata.isEmpty()) {
try {
for (Entry<String, JsonElement> entry : metadata.entrySet()) {
var value = entry.getValue();
if (value.isJsonPrimitive())
pathObject.getMetadata().put(entry.getKey(), value.getAsString());
}
} catch (UnsupportedOperationException e) {
logger.warn("Exception setting metadata values: " + e.getLocalizedMessage(), e);
}
}
if (childObjects != null)
pathObject.addChildObjects(childObjects);
return pathObject;
}
}
static class MeasurementListTypeAdapter extends TypeAdapter<MeasurementList> {
private static final Logger logger = LoggerFactory.getLogger(MeasurementListTypeAdapter.class);
static MeasurementListTypeAdapter INSTANCE = new MeasurementListTypeAdapter();
@Override
public void write(JsonWriter out, MeasurementList value) throws IOException {
out.beginObject();
if (value != null) {
for (var entry : value.asMap().entrySet()) {
out.name(entry.getKey());
Number measurementValue = entry.getValue();
if (measurementValue == null || Double.isNaN(measurementValue.doubleValue()))
out.value("NaN");
else if (Double.POSITIVE_INFINITY == measurementValue.doubleValue())
out.value("Infinity");
else if (Double.NEGATIVE_INFINITY == measurementValue.doubleValue())
out.value("-Infinity");
else
out.value(measurementValue);
}
}
out.endObject();
// Approach used before v0.4.0
// out.beginArray();
// for (int i = 0; i < value.size(); i++) {
// out.beginObject();
// out.name("name");
// out.value(value.getMeasurementName(i));
//
// out.name("value");
// out.value(value.getMeasurementValue(i));
//
// out.endObject();
// }
// out.endArray();
}
@Override
public MeasurementList read(JsonReader in) throws IOException {
var token = in.peek();
if (token == JsonToken.BEGIN_ARRAY) {
JsonArray array = gson.fromJson(in, JsonArray.class);
MeasurementList list = MeasurementListFactory.createMeasurementList(array.size(), MeasurementListType.DOUBLE);
for (int i = 0; i < array.size(); i++) {
JsonObject obj = array.get(i).getAsJsonObject();
list.put(obj.get("name").getAsString(), obj.get("value").getAsDouble());
}
list.close();
return list;
} else if (token == JsonToken.BEGIN_OBJECT) {
Map<String, ?> map = gson.fromJson(in, Map.class);
MeasurementList list = MeasurementListFactory.createMeasurementList(map.size(), MeasurementListType.DOUBLE);
for (var entry : map.entrySet()) {
String key = entry.getKey();
var value = entry.getValue();
if (value instanceof Number number) {
list.put(key, number.doubleValue());
} else if (value instanceof String string) {
// Try to handle useful strings that aren't valid JSON numbers
String lower = string.toLowerCase();
if (lower.equals("nan"))
list.put(key, Double.NaN);
else if (lower.equals("inf"))
list.put(key, Double.POSITIVE_INFINITY);
else if (lower.equals("-inf"))
list.put(key, Double.NEGATIVE_INFINITY);
else
list.put(key, Double.parseDouble(string));
} else {
logger.warn("Cannot parse measurement value for key {}: {}", key, value);
}
}
list.close();
return list;
} else {
return null;
}
}
}
}
```
|
```javascript
/* eslint-disable node-core/require-common-first, node-core/required-modules */
'use strict';
const { Stream } = require('stream');
function noop() {}
// A stream to push an array into a REPL
function ArrayStream() {
this.run = function(data) {
data.forEach((line) => {
this.emit('data', `${line}\n`);
});
};
}
Object.setPrototypeOf(ArrayStream.prototype, Stream.prototype);
Object.setPrototypeOf(ArrayStream, Stream);
ArrayStream.prototype.readable = true;
ArrayStream.prototype.writable = true;
ArrayStream.prototype.pause = noop;
ArrayStream.prototype.resume = noop;
ArrayStream.prototype.write = noop;
module.exports = ArrayStream;
```
|
```objective-c
//your_sha256_hash-----------
#ifndef GlyphsH
#define GlyphsH
//your_sha256_hash-----------
#include <Classes.hpp>
#include <Controls.hpp>
#include <ImgList.hpp>
#include "PngImageList.hpp"
//your_sha256_hash-----------
class TGlyphsModule : public TDataModule
{
__published:
TPngImageList *ExplorerImages;
TPngImageList *SessionImages;
TPngImageList *QueueImages;
public:
__fastcall TGlyphsModule(TComponent * Owner);
void __fastcall SetPixelsPerInch(int PixelsPerInch);
private:
int FPixelsPerInch;
__fastcall TGlyphsModule();
};
//your_sha256_hash-----------
extern PACKAGE TGlyphsModule * GlyphsModule;
const int SiteImageIndex = 103;
const int SiteColorMaskImageIndex = 104;
const int LocalBrowserImageIndex = 114;
//your_sha256_hash-----------
#endif
```
|
Starotumbagushevo (; , İśke Tombağoş) is a rural locality (a village) and the administrative centre of Starotumbagushevsky Selsoviet, Sharansky District, Bashkortostan, Russia. The population was 289 as of 2010. There are 4 streets.
Geography
Starotumbagushevo is located 9 km north of Sharan (the district's administrative centre) by road. Novotumbagushevo is the nearest rural locality.
References
Rural localities in Sharansky District
|
```objective-c
#pragma once
class Console
{
public:
Console();
};
```
|
Errachidia (Berber language: Imetɣaren) is a province located in eastern central Morocco in the region of Dra-Tafilalt.
Errachidia is bordered by Algeria to the southeast and by the Moroccan provinces of Figig to the northeast, Midelt to the north, Tinghir to the west, and Zagura to the southwest. It is considered to be one of the most historically important regions of Morocco.
Errachidia, whose former name is Ksar Souk and Imetɣaren in the Berber language, was named Rachid, in tribute to one of the main founders of the Alaouite dynasty, the current Moroccan royal family.
Cities
Aoufous
Boudnib
Erfoud
Errachidia
Goulmima
Jorf
Moulay Ali Cherif
Rich
Rissani
Tinejdad
Subdivisions
The province is divided administratively into the following:
References
External links
Site of the region Errachidia-Tafilalet
Errachidia Province
|
```java
package com.fishercoder.thirdthousand;
import com.fishercoder.solutions.thirdthousand._2855;
import org.junit.jupiter.api.BeforeEach;
import org.junit.jupiter.api.Test;
import java.util.Arrays;
import static org.junit.jupiter.api.Assertions.assertEquals;
public class _2855Test {
private _2855.Solution1 solution1;
@BeforeEach
public void setup() {
solution1 = new _2855.Solution1();
}
@Test
public void test1() {
assertEquals(2, solution1.minimumRightShifts(Arrays.asList(3, 4, 5, 1, 2)));
}
}
```
|
```python
# -*- coding: utf-8 -*-
import sys, os
p = os.path.dirname(os.path.dirname(os.path.abspath(__file__)))
if p not in sys.path:
sys.path.insert(0, p)
import os, platform, uuid, subprocess, time
from qqbot.utf8logger import WARN, INFO, DEBUG, ERROR
from qqbot.common import StartDaemonThread, LockedValue, HasCommand, SYSTEMSTR2STR
from qqbot.qrcodeserver import QrcodeServer
from qqbot.mailagent import MailAgent
Image = None
class QrcodeManager(object):
def __init__(self, conf):
qrcodeId = uuid.uuid4().hex
self.qrcodePath = conf.QrcodePath(qrcodeId)
if conf.httpServerIP:
self.qrcodeServer = QrcodeServer(
conf.httpServerIP,
conf.httpServerPort,
self.qrcodePath,
qrcodeId
)
StartDaemonThread(self.qrcodeServer.Run)
else:
self.qrcodeServer = None
if conf.mailAccount:
self.mailAgent = MailAgent(
conf.mailAccount, conf.mailAuthCode, name='QQBot'
)
if self.qrcodeServer:
html = ('<p> QQBot QQ '
''
' <a href="{0}">{0}</a> </p>'
'<p><img src="{0}"></p>').format(self.qrcodeServer.qrcodeURL)
else:
html = ('<p> QQBot QQ '
' QQBot '
'1~2</p>'
'<p>{{png}}</p>')
html += '<p>conf.user=%r, conf.qq=%r</p>' % (conf.user, conf.qq)
self.qrcodeMail = {
'to_addr': conf.mailAccount,
'html': html,
'subject': ('%s[%s]' % ('QQBot', qrcodeId)),
'to_name': ''
}
self.qrcode = LockedValue(None)
else:
self.mailAgent = None
self.cmdQrcode = conf.cmdQrcode
if self.cmdQrcode:
global Image
try:
from PIL import Image as i
import wcwidth
Image = i
except ImportError:
ERROR(' pillow,wcwidth ')
sys.exit(1)
def Show(self, qrcode):
with open(self.qrcodePath, 'wb') as f:
f.write(qrcode)
from qqbot import _bot
if hasattr(_bot, 'onQrcode'):
_bot.onQrcode(self.qrcodePath, qrcode)
if self.cmdQrcode:
try:
showCmdQRCode(self.qrcodePath)
except Exception as e:
WARN(' file://%s %s',
SYSTEMSTR2STR(self.qrcodePath), e)
if not (self.qrcodeServer or self.mailAgent or self.cmdQrcode):
try:
showImage(self.qrcodePath)
except Exception as e:
WARN(' file://%s %s', SYSTEMSTR2STR(self.qrcodePath), e)
if self.qrcodeServer:
INFO('%s', self.qrcodeServer.qrcodeURL)
if self.mailAgent:
if self.qrcode.getVal() is None:
self.qrcode.setVal(qrcode)
# first show, start a thread to send emails
StartDaemonThread(self.sendEmail)
else:
self.qrcode.setVal(qrcode)
def sendEmail(self):
lastSubject = ''
while True:
if lastSubject != self.qrcodeMail['subject']:
qrcode = self.qrcode.getVal()
if qrcode is None:
break
qrcode = '' if self.qrcodeServer else qrcode
try:
with self.mailAgent.SMTP() as smtp:
smtp.send(png_content=qrcode, **self.qrcodeMail)
except Exception as e:
WARN('%s %s', self.mailAgent.account, e, exc_info=True)
else:
INFO('%s', self.mailAgent.account)
if self.qrcodeServer:
break
else:
lastSubject = self.qrcodeMail['subject']
else:
time.sleep(65)
qrcode = self.qrcode.getVal()
if qrcode is None:
break
try:
DEBUG(' %s ', self.mailAgent.account)
with self.mailAgent.IMAP() as imap:
lastSubject = imap.getSubject(-1)
except Exception as e:
WARN(' %s %s', self.mailAgent.account, e)
else:
DEBUG(' %s', lastSubject)
def Destroy(self):
if self.mailAgent:
self.qrcode.setVal(None)
if self.qrcodeServer:
self.qrcodeServer.Stop()
try:
os.remove(self.qrcodePath)
except OSError:
pass
def showImage(filename):
osName = platform.system()
if osName == 'Windows':
subprocess.Popen([filename], shell=True)
elif osName == 'Linux':
#TODO: should I leave it to user's config ?
LINUX_DISPLAY_COMMAND = ("xdg-open", "display", "gvfs-open", "shotwell")
commands = list(filter(HasCommand, LINUX_DISPLAY_COMMAND))
if (commands): # command found
subprocess.Popen([commands[0], filename])
else:
raise
elif osName == 'Darwin': # by @Naville
subprocess.Popen(['open', filename])
else:
raise Exception('other system')
def showCmdQRCode(filename):
global Image
import wcwidth
# 165x165 -> 33x33
size=33
padding=1
rgb=Image.open(filename).resize((size,size)).convert('RGB')
qrtext = '0' * (size + padding * 2) + '\n'
for rr in range(size):
qrtext += '0'*padding
for cc in range(size):
r,g,b = rgb.getpixel((cc,rr))
if (r > 127 or g > 127 or b > 127):
qrtext += '0'
else:
qrtext += '1'
qrtext += '0'*padding
qrtext += '\n'
qrtext = qrtext + '0' * (size + padding * 2) + '\n'
try:
b = u'\u2588'
sys.stdout.write(b + '\r')
sys.stdout.flush()
except UnicodeEncodeError:
white = 'MM'
else:
white = b
black=' '
# currently for Windows, '\u2588' is not correct. So use 'MM' for windows.
osName = platform.system()
if osName == 'Windows':
white = '@@'
blockCount = int(2/wcwidth.wcswidth(white))
white *= abs(blockCount)
sys.stdout.write(' '*50 + '\r')
sys.stdout.flush()
qr = qrtext.replace('0', white).replace('1', black)
qr = '\033[37m\033[40m\n' + qr + '\033[0m\n' # force to use white/black.
sys.stdout.write(qr)
sys.stdout.flush()
# A space-saving text QRCode
if osName != 'Windows':
charlist = [u' ', u'\u2598', u'\u259D', u'\u2580', u'\u2596', u'\u258C', u'\u259E', u'\u259B',
u'\u2597', u'\u259A', u'\u2590', u'\u259C', u'\u2584', u'\u2599', u'\u259F', u'\u2588']
qrarray = map(lambda x: map(lambda y: y, x), qrtext.split('\n'))
qrtext = ''
for rr in range(0, size + padding * 2, 2):
for cc in range(0, size + padding * 2, 2):
index = int(''.join([x for row in qrarray[rr:rr+2] for x in (row + ['0'])[cc:cc+2]][::-1]), 2)
qrtext += hex(15 - index)[-1]
qrtext += '\n'
qr = ''.join(map(lambda x: charlist[int(x, 16)] if x != '\n' else x, qrtext))
qr = '\033[37m\033[40m\n' + qr + '\033[0m\n' # force to use white/black.
sys.stdout.write(qr)
sys.stdout.flush()
if __name__ == '__main__':
from qconf import QConf
# ~/.qqbot-tmp/v2.x.conf
conf = QConf()
conf.Display()
qrm = QrcodeManager(conf)
with open('tmp.png', 'rb') as f:
qrcode = f.read()
qrm.Show(qrcode)
time.sleep(5)
qrm.Show(qrcode)
qrm.Destroy()
```
|
MV Tynwald was a roll-on-roll-off car and cargo vessel operated by the Isle of Man Steam Packet Company between 1986 and 1990, the sixth ship in the history of the line to bear the name. Built as Antrim Princess for service on the Stranraer–Larne route, she was chartered under her original name until 1986.
Construction
Antrim Princess was built by Hawthorn Leslie & Co. at Hebburn-on-Tyne in 1967. The ship was notable as being British Rail's first seagoing ship to be fitted with a bow door and therefore, was the very first Sealink drive-through ferry. She also broke with the Company's long tradition of using steam turbine propulsion for its channel vessels, a move that introduced the funnel design that was to become synonymous with British Rail and later Sealink ferries.
Service life
Antrim Princess was designed for service on the Stranraer - Larne route. Apart from a serious engine room fire in December 1983 which caused all the passengers to be airlifted to safety prior to the fire being brought under control, she had a largely uneventful career on the North Channel.
With the privatisation of Sealink UK in 1984 and the subsequent Sealink-Manxline/Isle of Man Steam Packet merger, a consolidation regarding the vessels operating to and from the Isle of Man, and the routes to be served was undertaken. Services would be concentrated on the Heysham–Douglas route with a strengthened two-ship service using the larger Mona's Isle (VI) and Antrim Princess.
After over 150 years of continuous service, the Steam Packet's year-round Liverpool–Douglas services were to be abandoned.
Following the collapse of the Sealink UK/Sealink RMT Dover–Ostend route partnership, the Isle of Man agreement provided for Sealink to charter Antrim Princess as their contribution to the new merged operation. However, the actually assumed the role, whilst trade union problems delayed the transfer of Antrim Princess from Stranraer. The Steam Packet's contribution to the year-round operations was the disastrous and expensive Mona's Isle (VI). Underpowered, dubiously rebuilt and unable to carry the expected loads, Mona's Isle lasted only one season - her operational Manx career actually lasted six months. However following a settlement with the seaman's union, Antrim Princess was finally released.
Renamed Tynwald in April 1986 and painted in the Steam Packet's traditional livery, she began service joined by Manx Viking, which remained for another season. Both vessels were then supplemented in the summer by the two side-loaders Mona's Queen (V) and Lady of Mann (II).
Tynwald continued operating on the Heysham–Douglas route until February 1990 when she was returned to Sealink after the Steam Packet had found a suitable replacement in the form of King Orry (V).
During her service with the Steam Packet, Tynwald always sailed with a pronounced list. According to several of the deck crew there were problems with the ballast tanks which made levelling the vessel when loaded impossible.
Subsequent life
Tynwald returned to Sealink in February 1990 and was laid up awaiting sale. She was sold to Linee Lauro who employed the ship on their lengthy routes between Italy, Sicily and Tunisia and renamed Lauro Express. Prior to entering service she received new cabin accommodation. For 2003, she received a black hull under the new Medmar brand, whilst in 2004 she was renamed Giuseppe D'Abundo.
Before the 2004 summer season could get into full swing however, Medmar closed their route from Sete to Palma de Mallorca, which had been operated by the Giulia d'Abundo. The displaced ship was moved round to Italy and took the place of the Giuseppe D'Abundo which was subsequently laid-up in Naples. For the 2005 summer, Medmar announced that the ship was to be re-activated for deployment on new Adriatic services based in Bari and operating to Dubrovnik and Corfu. These were however later cancelled, the ship being chartered out instead to Di Maio & Partners for their Bari-Durres run.
Disposal
In early 2006, it was reported that the ship had been sold for scrap, but she remained laid-up for a time in Naples awaiting her fate before, finally, arriving at Alang in India in February 2007 under the name Stella.
References
Ships of the Isle of Man Steam Packet Company
Ships built on the River Tyne
1967 ships
|
```toml
[package]
org = "adv_res"
name = "package_w"
version = "1.2.0"
```
|
James Maina Boi (4 April 1954 – 15 July 2004) was a Kenyan middle-distance runner. He is best known for winning the 800 metres distance at the 1978 All-Africa Games and a silver medal at the 1982 Commonwealth Games.
He also competed in 4 x 400 metres relay at the 1983 World Championships with the Kenyan team that was eliminated in the semi-finals.
Boi died in 2004 following long-term illness.
Achievements
Boi also won two gold medals at the East African Championships in 1977 and 1979.
References
External links
1954 births
2004 deaths
Athletes (track and field) at the 1978 Commonwealth Games
Athletes (track and field) at the 1982 Commonwealth Games
Kenyan male middle-distance runners
Commonwealth Games silver medallists for Kenya
Commonwealth Games medallists in athletics
African Games gold medalists for Kenya
African Games medalists in athletics (track and field)
Athletes (track and field) at the 1978 All-Africa Games
Medallists at the 1982 Commonwealth Games
|
Thomas Patrick Keating (1917–1984) was an English artist, art restorer and art forger. Considered the most prolific and versatile art forger of the 20th century, he claimed to have faked more than two thousand paintings by over a hundred and fifty different artists. Total estimated profits from his forgeries amount in today's value to more than (US) ten million dollars.
Unlike most art forgers, his aim was not material gain, but rather a crusade against art dealers he believed were only interested in fine art as a commodity, for which an impressive provenance, often dubious or wholly invented, always trumped the masterful artistry and intrinsic beauty of any particular drawing or painting.
He began flooding the London art market in the early 1950s with hundreds of consistently convincing fakes, often by giving them to friends and acquaintances, with tacit expectation that many would soon end up in a posh Bond Street auction house, or gallery.
He escalated his crusade in the late 1960s and early 1970s by directing his business partner and lover, Jane Kelly, to sell several fakes of then little known romanticist, Samuel Palmer. As a result of these sales, both Keating and Kelly ended up on trial, in 1979, at the top criminal court in Britain, charged with art fraud. Kelly pleaded guilty and received an eighteen month sentence, suspended for two years. After two days giving evidence, Keating ended up in hospital for a motorbike injury. He returned for a third day in court, during which he collapsed in the witness box, and was taken back to hospital. He was released without charge two weeks later due to failing health.
In 1982, he starred in an award-winning Channel 4 television series in which he instructed viewers in the intricately detailed painting techniques of his favourite Old Masters. A followup series, focusing on the Impressionists, began airing two days after his death, in 1984.
Early life
Keating was born into a working-class family in an overcrowded flat in South London. As a youth, living hand to mouth on his father's shilling-and-sixpence hourly wage as a house painter, he helped his mother make ends meet by collecting and selling horse manure, running errands for neighbours, and taking parcels to the local pawn shop. Growing up he worked as a delivery boy, lather boy, lift boy and bellboy before finally joining the family business as a house painter.
Art classes
He discovered his love and early talent for picture-making at Eltham College primary school in Kent. Having run away from home to visit his grandmother seven miles away, he ended up staying for three years, trading persistent poverty and grim prospects for regular home-cooked meals and a headmistress who was also an art teacher, who encouraged him to spend as much time as he liked drawing and painting owls, foxes, badgers, and a sailing ship. When his grandmother died, he returned to Forest Hill.
At the age of fourteen, he passed an entrance exam for the nearby, prestigious, St Dunstan’s College, but was crestfallen when told the impossible sum required for clothes and books needed just to start. He returned to odd jobs and house painting, developing his own talent for detailing woodwork, graining, marbling, and sign writing.
Navy tour
Keating was called up to the Royal Navy in the spring of 1940, finishing his training just in time to get a taste of combat at Dunkirk, before setting off for Singapore aboard the SS Strathmore. He spent the next three years in the South China Sea on a variety of vessels, also spending time in hospital for a range of illnesses, including shock, and injuries he attributed to the abuse of fellow crewmen and officers dubious of a sailor who spent all his free time on his own, reading and drawing, instead of carousing with the rest of them.
On 15 September 1943 he was posted to the frigate HMS Lagan as a stoker first class, and sent into the Battle of the Atlantic, escorting a convoy of merchant supply ships from Liverpool to New York. After suffering major defeats four months earlier, the German U-boat offensive had been withdrawn from the North Atlantic, awaiting tactical and technical improvements, which were now complete. In the wee small hours of 20 September 1943, the Lagan became the first Allied warship to be hit by the new T5 acoustic torpedo, which tore off her entire stern, killing over a quarter of the crew, and leaving the remainder dead in the water southwest of Iceland, about a third of the way into their journey. The Lagan was towed back to Merseyside. Nerves shattered and his back badly injured by Hedgehog shrapnel, Keating was sent home to hospital for psychiatric treatment – a fortnight in an induced coma, then discharged with a disability pension of seventeen shillings a week. He soon married his wife Ellen, with whom he had two children, Douglas, and Linda. They separated in 1952.
Self-taught
Keating always claimed he learned his most important skills as an artist through independent study and experimentation on his own. His early sources of inspiration were chiefly the father of the Renaissance, Titian, of the Venetian School; the Baroque Dutch master Rembrandt, the pioneering British portrait and landscape painter Thomas Gainsborough, and the Romanticists Goya, Turner and Constable. He divined their secrets by spending countless hours scrutinising and sketching examples of their work in Britain’s greatest museums, especially the National Gallery, The Royal Academy and the Tate.
In 1950, he was given for his service in the war a two-year course at Goldsmiths' College, and a grant from the Ministry of Labour of £4 and 5 shillings a week (£4.20 in decimal currency). He supplemented this by working nights and weekends, but was seldom able to simultaneously manage all the expenses of essential art supplies and feeding his family. He then discovered he lacked the prerequisite A-levels to qualify for a teaching certificate. This, combined with his disappointment at the calibre of technical training on offer, and a complete lack of interest in the modern art movements in vogue at the time (he was ridiculed for praising the work of Pietro Annigoni, who only a few years later was commissioned to paint a popular portrait of the Queen), led inevitably to him failing two final exams––praised for ‘painterly technique’, thwarted by his composition’s ‘insufficient originality’––and dropping out.
Never one to shy away from self-contradiction, Keating told a journalist in May 1977 he had to unlearn everything he was taught at Goldsmith’s. In his autobiography published the following month, he credited some of the training he received there with getting him started on a career.
Art restorer
While studying at Goldsmith’s, Keating secured a part-time job as a restorer, at the well-respected Hahn Brothers, in Mayfair, where he began meticulously filling thousands of tiny cracks in old pictures. The breadth of his expertise in painting techniques quickly expanded, however, when he began taking more challenging jobs on the shady fringes of the London art market, where he learned to skilfully mimic the methods of scores of lesser-known artists, in the course of figuring out how to fix them. The typical instruction he got in these establishments was along the lines of, ‘here, show us what you can do with this’.
While working in a small shop for a man called Fred Roberts, he was asked to replace a herd of grazing cattle––that had been obliterated by the repair of a large tear in a 19th-century painting by Thomas Sidney Cooper––with laughing children dancing around a maypole, dramatically enhancing the picture's charm. Roberts was so impressed with several of Keating’s ‘repairs’ that he framed them, added a forged signature, and put them up in a nearby showroom for hundreds, even thousands of pounds, all while paying Keating slave wages, generally £5 to £10 per week.
When Keating discovered some Frank Moss Bennetts he’d nearly completely repainted for Roberts, on offer at a posh West End gallery for £1,500 to £3,000, he was so disgusted he dashed back, gave Roberts an earful of expletives and quit on the spot, hurling a palette at him as a parting gesture.
When he later discovered that similar subterfuge was rampant throughout the trade, dealers raking in cash while his wife and children were stuck in a damp, dilapidated flat, with scant, tattered furniture and often little to eat, he decided he too could play at that game. A forger was born, with a sense of righteous indignation and a desire for vengeance that plagued him the rest of his life, baffling those who thought his tremendous talent could be put to far better use, landing him in the Old Bailey on charges for fraud, bringing him post-trial wealth and fame, and condemning him––through the stress on his health of violent mood swings and massive consumption of tobacco and alcohol––to an early death.
Crusade against the art world
Keating never attempted to get rich off the fakes he produced, rather he often gave them away as gifts, bartered them for food, booze, and rent, or sold them for a pittance to friends and acquaintances, even the local gas man.
His main objective was a vendetta against corrupt, predatory art dealers whom he believed victimised both artists and the buying public. Not long after finding a number of old pictures he’d been ordered to ‘enhance’, on sale nearby for inflated prices, he was taken in by an even more perfidious employer. Keating would often stay after hours painting pictures in the styles of other artists he admired, to study their techniques. One evening his boss discovered him finishing a pastiche of a wintry Canadian scene, à la Cornelius Krieghoff. The man offered to buy it from him, and asked him to do another, for which he paid him $15 each. Keating later learned they were sold at a London Gallery for over $3000.
Keating retaliated by disseminating quantities of fakes of sufficient quality to fool the experts, hoping to destabilize the system. At one point in the 1950s, so many ‘newly-discovered’ Krieghoffs had come on the market that prices were acutely depressed, over fears many were fake, neatly achieving two of Keating’s goals: to reduce the profits of greedy art dealers, and to make beautiful pictures from one of his favourite artists more affordable to the buying public. Some twenty years later, a Sotheby's expert on Canadian art lamented, due to unceasing difficulties in making a firm identification of Krieghoff's work, that instead of listing them under the artist's full name – to indicate full confidence in their authenticity – they catalogued paintings in a 1976 auction as merely, 'attributed to Krieghoff'. Prices however, had made a handsome recovery; they sold for $11,000 - $13,000.
Keating considered himself a socialist and used that mentality to rationalize his actions. He planted "time bombs" in his products. He left clues of the paintings' true nature for fellow art restorers or conservators to find. For example, he might write text onto the canvas with lead white before he began the painting, knowing that x-rays would later reveal the text. He deliberately added flaws or anachronisms, or used materials peculiar to the 20th century. Modern copyists of old masters use similar practices to guard against accusations of fraud.
In Keating's book The Fake's Progress, discussing the famous artists he forged, he stated that "it seemed disgraceful to me how many of them died in poverty". He reasoned that the poverty he had shared with these artists qualified him for the job. He added: "I flooded the market with the 'work' of Palmer and many others, not for gain, but simply as a protest against the merchants who make capital out of those I am proud to call my brother artists, both living and dead." In 1962, Keating counterfeited Edgar Degas' self-portrait.
Techniques of the old masters
Mastering an artist's style and technique, as well as getting to know the artist very well, was a priority for Keating. He bristled at being called a forger, claiming he never truly copied any pictures, rather he did new pictures that looked like they were done by others. In a 1977 BBC documentary he described a kind of hierarchy of terms for various types of imitation:
Copy – an exact duplicate, such as those often displayed in place of an original kept safe in a vault
Repaint – the result of heedless, heavy-handed restoration
Pastiche – a variation of an existing painting, or a new picture that mimics another artist’s style
Fake – a pastiche that has been doctored up to look like an original
Forgery – a fake with another artist’s signature added and false provenance provided
Though not always consistent in his own use of these distinctions, by far his favourite term for what he did was, Sexton Blake. The name of the long-running fictional detective was commonly used from the early twentieth century to mean, cake. Keating revised and popularized its use as rhyming slang for fake.
Keating's preferred approach in oil painting was a Venetian technique inspired by Titian's practice, although modified and fine-tuned along Dutch lines. The resultant paintings, while time-consuming to execute, have a richness and subtlety of colour and optical effect, and a variety of textures and depth of atmosphere unattainable in any other way. Unsurprisingly, his favourite artist was Rembrandt.
For a "Rembrandt", Keating might make pigments by boiling nuts for 10 hours and filtering the result through silk; such colouring would eventually fade, while genuine earth pigments would not. As a restorer he knew about the chemistry of cleaning fluids; so, a layer of glycerine under the paint layer ensured that when any of his forged paintings needed to be cleaned (as all oil paintings need to be, eventually), the glycerin would dissolve, the paint layer would disintegrate, and the painting – now a ruin – would stand revealed as a fake.
Occasionally, as a restorer, he would come across frames with Christie's catalogue numbers still on them. To help in establishing false provenances for his forgeries, he would call the auction house to ask whose paintings they had contained – and would then paint the pictures according to the same artist's style.
Keating also produced a number of watercolours in the style of Samuel Palmer. To create a Palmer watercolor, Keating would mix the watercolor paints with glutinous tree gum, and cover the paintings with thick coats of varnish in order to get the right consistency and texture. And oil paintings by various European masters, including François Boucher, Edgar Degas, Jean-Honoré Fragonard, Thomas Gainsborough, Amedeo Modigliani, Rembrandt, Pierre-Auguste Renoir and Kees van Dongen.
One of many artists associated with Kew, London, Keating had a strong desire to inspire more people to take up fine art painting. In the early 1960s, he started an informal school of his own, endeavouring to teach local teenagers elaborate techniques in his studio in Kew Village, in exchange for tobacco or second-hand art books.
Relationship with Jane Kelly
In the summer of 1963, forty-six year-old Keating, met sixteen-year-old Jane Kelly, in the Railway Café at Kew Gardens Station––opposite his flat, and just across an historic footbridge from her family home. Having recently relocated from Llangyndeyrn, Wales, Kelly quickly joined a group of young people she found gathered round a charming older man perched at the end of the bar, regaling them with wild stories of war, protest, and Art World treachery. Keating gave informal painting lessons to several of them, but Kelly immediately stood out. From early childhood, she'd grown up studying a number of rare sketch books her great grandfather, Thomas Farr, had made in British Ceylon in the 1890s. The pioneering tea planter, artist, and early conservationist made detailed field drawings and vivid watercolours, which inspired Kelly to become an artist. She soon became Keating's full-time student and apprentice. Four years later, the two began a life together in Suffolk, where they started an art restoration business.
Revealing the forger
In February 1970, Geraldine Norman, sale room correspondent for The Times of London, reported the sale of a rare painting from Samuel Palmer’s Shoreham period, which mainly depicted moonlit scenes of shepherds and sheep from around his home in Shoreham, Kent. A nearly life-sized photo of the picture accompanied the article. Entitled Sepham Barn, it was purchased for £9,400, by Harold Leger, of Leger Galleries, Old Bond Street in London.
A month later, The Times published a letter from art expert David Gould claiming the picture to be a fake. Mrs. Norman continued to receive reports of more new Palmer pictures appearing in the market, along with claims from David Gould that all of them were fakes. In March 1976, she began investigating them, enlisting the assistance of Palmer experts from the Ashmolean Museum, the Tate Museum, the British Museum, and the Fitzwilliam Museum, as well as author Geoffrey Grigson.
In July 1976 the first of Norman's series of articles on fake Palmers was published on page one of The Times. Thirteen previously unknown Palmers that had appeared on the market in the past decade were all declared fake. Five of them had come from a single source: Jane Kelly. Norman was unable to reach Miss Kelly but received several phone calls with tips including one from Miss Kelly's brother, who brought photos from Keating's studio, revealing that Tom Keating was the forger she was looking for.
Soon after, she drove out to the house that Kelly's brother had told her about, and met Keating. He welcomed her inside and told her all about his life as a restorer and artist, not discussing his life as a forger. He also spent much of the time ranting about his fight against the art establishment as a working-class socialist. A little over a week after their meeting (and a month after the first article), The Times published a further article written by Norman, writing about Keating's life and the many allegations of forgery against him. In response, Keating wrote: "I do not deny these allegations. In fact, I openly confess to having done them." He also declared that money was not his incentive. Though Norman was the one to expose him, Keating did not feel resentment towards her. Instead, he said that she was sympathetic, respectful of his radical politics, and appreciative of him as an artist.
When an article published in The Times discussed the auctioneer's suspicions about their provenance, Keating confessed that they were his. He also estimated that more than 2,000 of his forgeries were in circulation. He had created them, he declared, as a protest against those art traders who get rich at the artist's expense. He also refused to list the forgeries.
Trial at the Old Bailey
After Keating and Jane Kelly were finally arrested in 1977, and both accused of conspiracy to defraud and obtaining payments through deception amounting to £21,416, Kelly pleaded guilty, promising to testify against Keating. Conversely, Keating pleaded innocent, on the basis that he was never intending to defraud, rather he was simply working under the masters' guidance and in their spirit. The charges were eventually dropped due to his poor health after he was severely injured in a motorcycle accident. He then contracted bronchitis in the hospital, which was exacerbated by a heart ailment and pulmonary disease, leading the doctors to believe that he was not going to survive. The prosecutor dropped the case, declaring nolle prosequi. Since Kelly had already pleaded guilty, she received an eighteen month sentence, suspended for two years. However, Keating served no time, and shortly after the charges were dropped, Keating's health improved. Soon after, Keating was asked to star in a television show about the techniques needed to paint like the masters.
Crusader vindicated
The same year Keating was arrested (1977), he published his autobiography with Geraldine and Frank Norman. A 2005 article in The Guardian stated that after the trial was halted, "the public warmed to him, believing him a charming old rogue." Years of chain smoking and the effects of breathing in the fumes of chemicals used in art restoring, such as ammonia, turpentine and methyl alcohol, together with the stress induced by the court case, had taken their toll. Through 1982 and 1983, however, Keating rallied at the prospect of finally fulfilling a long-held ambition to be a teacher; to encourage others to paint. Though still in fragile health, he accepted a proposal to star in a (UK) Channel 4 television series called Tom Keating on Painters (see more below).
A year before he died in Colchester at the age of 66, Keating stated in a television interview, that, in his opinion, he was not an especially good painter. Keating is buried in the churchyard of the parish church of St Mary the Virgin at Dedham (a scene painted numerous times by Sir Alfred Munnings), and his last painting, The Angel of Dedham, is to be found in the Muniment Library of the church.
Even when he was alive, many art collectors and celebrities, such as the ex-heavyweight boxer Henry Cooper, had begun to collect Keating's work. After his death, his paintings became increasingly valuable collectibles. In the year of his death, Christie's auctioned 204 of his works. The amount raised from the auction was not announced, but it is said to have been considerable. Even his known forgeries, described in catalogues as "after" Gainsborough or Cézanne, attain high prices. Nowadays, Keatings sell for tens of thousands of pounds.
Keatings' work has itself been faked. The 2005 Guardian article states, "Dodgy paintings in Keating's original style, proudly bearing what-looks-like his signature, are finding their way into the market. If they manage to fool, they can claim £5,000 to £10,000. But if uncovered they are virtually worthless, much like Keating's 20 years ago. If you can pick them up for next to nothing, they may be a better investment than an original Keating counterfeit."
Works
Major restoration of the Louis Laguerre murals depicting the Battle of Blenheim in the West Staircase at Marlborough House.
The Hay Wain in Reverse, his best known painting, is a pastiche of John Constable's celebrated, The Hay Wain. It is reportedly on display in the Granary Barn and Museum in Flatford.
Turner at Greenwich, the reverse Temeraire shown in the Turner episode of Tom Keating On Painters.
A modest painting of the Greek sun god Helios in his chariot adorns a sign over The Sun Inn, in Dedham, Essex.
Television series
A Picture of Tom Keating
Subtitled An exclusive study of a master forger, this BBC1 special broadcast on 3 May 1977, featured an interview of Keating in his studio, demonstrating how he produced fakes of Renoir, Degas and Palmer. He claimed he duped the so-called experts because he wanted to expose the dubious practices of art dealers. He also discussed his relationship with Jane Kelly, and their restoration business at Wattisfield Hall, in East Anglia, and later at Vilaflor in Tenerife.
The programme was rebroadcast on BBC2 on 6 August 1979, with a new sequence which covered Keating’s trial in February.
Tom Keating On Painters
Keating's award-winning first educational series began airing on 4 November 1982, two days after the launch of Britain’s fourth television station. Channel 4 enticed viewers by inviting them to: "Watch the great 16th century Italian painter Tom Keating (who) believes the spirits of the Old Masters sometimes enter him as he works on a canvas. Tonight, in the first of a series, watch Titian paint 'Tarquin and Lucretia' through Keating."
In each half-hour episode, filmed in his private studio in Dedham, a soft-spoken Keating displayed a depth of knowledge and range of technical skills that astonished many viewers. A Times television critic commenting on the Rembrandt episode wrote, "Tom Keating does more than just break new ground in art appreciation. Other art experts limit themselves to indicating areas of great paintings and explaining this, that, and the other. Mr. Keating goes one better by first putting himself into the Old Master's shoes, then insinuating himself into their minds, and finally putting paint to canvas with an uncanny command of the original style. Instruction by example: that is the Keating approach."
He would begin each episode with a brief life history of the artist, including aesthetic influences and interactions with other famous painters, then quickly demonstrate the compositional development, sketching and painting techniques of one of his favourite mentors, each among the most revered fine artists in history. In March the following year, the programme captured the Broadcasting Press Guild’s award for ‘Best on-screen performance in a non-acting role’ for Keating. Both series were released on VHS in 1983.
Turner – "In his day people had a need, an urge to escape the ugliness of life," Keating explains. "They hid themselves in their paintings, looking at them. So he created another world of colour, magic and mystery." Keating draws and paints a reverse rendering of The Fighting Temeraire.
Titian – Keating illustrates Titian's multilayered painting techniques by creating a copy of Tarquin and Lucretia.
Constable – Keating reviews the history of the making of The Hay Wain. Then recreates another version of his Hay Wain in Reverse.
Rembrandt – Keating paints a pastiche combining a Rembrandt self-portrait with a portrait of his son Titus.
Degas – Keating demonstrates the making of The Ballet Class, in pastel.
Restoration – Louis Laguerre murals depicting the Battle of Blenheim in the West Staircase at Marlborough House.
Tom Keating On Impressionism
Rousseau, Boudin, Pissarro
Manet
Monet
Keating demonstrates the effects Monet captured by painting outdoors on the frozen River Seine
Renoir
Van Gogh
Cezanne
In popular culture
In the 2002 film The Good Thief, Nick Nolte's character claims to own a painting Picasso did for him after losing a bet, when it is exposed as a fake he claims it was painted for him by Keating after meeting in a betting shop.
The fourth track, titled "Judas Unrepentant", on progressive rock band Big Big Train's 2012 album English Electric (Part One) is based on the life of Keating as an artist. According to the blog of Big Big Train vocalist David Longdon, the song walks through Keating's artistic life from his time as a restorer to his death and posthumous fame.
Further reading
Tom Keating, Geraldine Norman and Frank Norman, The Fake's Progress: The Tom Keating Story, London: Hutchinson and Co., 1977.
Associated Press obituary for Tom Keating
Keats, Jonathon, Forged: Why Fakes Are the Great Art of Our Age, New York: Oxford University Press., 2013. (Excerpt on Tom Keating published by Forbes, 13 December 2012).
Paci, P., "A Forger's Career, Tom Keating – UK," in Masters of the Swindle: True Stories of Con Men, Cheaters & Scam Artists, edited by Gianni Morelli and Chiara Schiavano, Milano, Italy: White Star Publishers, 2016, pages 180–84.
References
1917 births
1984 deaths
Alumni of Goldsmiths, University of London
British military personnel of World War II
English art forgers
English male painters
English socialists
Conservator-restorers
House painters
Painters from London
People from Lewisham
Military personnel from London
Television personalities from London
|
Metalasia densa, the bristle bush or blombos, is a species of flowering plant in the family Asteraceae, native to South Africa and Lesotho. Aperennial shrub reaching , it is fire-adapted.
References
Gnaphalieae
Flora of the Cape Provinces
Flora of the Free State
Flora of KwaZulu-Natal
Flora of the Northern Provinces
Flora of Lesotho
Plants described in 1989
|
```yaml
commonfields:
id: DemistoLogsBundle
version: -1
name: DemistoLogsBundle
script: ''
type: javascript
tags:
- DemistoAPI
comment: Deprecated. No available replacement.
enabled: true
scripttarget: 0
dependson:
must:
- core-api-download
fromversion: 5.0.0
tests:
- no test
deprecated: true
```
|
```go
package font
import (
"encoding/binary"
"errors"
"github.com/go-text/typesetting/opentype/tables"
)
type os2 struct {
version uint16
xAvgCharWidth uint16
useTypoMetrics bool // true if the field sTypoAscender, sTypoDescender and sTypoLineGap are valid.
ySubscriptXSize float32
ySubscriptYSize float32
ySubscriptXOffset float32
ySubscriptYOffset float32
ySuperscriptXSize float32
ySuperscriptYSize float32
ySuperscriptXOffset float32
yStrikeoutSize float32
yStrikeoutPosition float32
sTypoAscender float32
sTypoDescender float32
sTypoLineGap float32
sxHeigh float32
sCapHeight float32
}
func newOs2(os tables.Os2) (os2, error) {
out := os2{
version: os.Version,
xAvgCharWidth: os.XAvgCharWidth,
ySubscriptXSize: float32(os.YSubscriptXSize),
ySubscriptYSize: float32(os.YSubscriptYSize),
ySubscriptXOffset: float32(os.YSubscriptXOffset),
ySubscriptYOffset: float32(os.YSubscriptYOffset),
ySuperscriptXSize: float32(os.YSuperscriptXSize),
ySuperscriptYSize: float32(os.YSuperscriptYSize),
ySuperscriptXOffset: float32(os.YSuperscriptXOffset),
yStrikeoutSize: float32(os.YStrikeoutSize),
yStrikeoutPosition: float32(os.YStrikeoutPosition),
sTypoAscender: float32(os.STypoAscender),
sTypoDescender: float32(os.STypoDescender),
sTypoLineGap: float32(os.STypoLineGap),
}
// add addition info for version >= 2
if os.Version >= 2 {
if len(os.HigherVersionData) < 12 {
return os2{}, errors.New("invalid table os2")
}
out.sxHeigh = float32(binary.BigEndian.Uint16(os.HigherVersionData[8:]))
out.sCapHeight = float32(binary.BigEndian.Uint16(os.HigherVersionData[10:]))
}
const useTypoMetrics = 1 << 7
use := os.FsSelection&useTypoMetrics != 0
hasData := os.USWeightClass != 0 || os.USWidthClass != 0 || os.USFirstCharIndex != 0 || os.USLastCharIndex != 0
out.useTypoMetrics = use && hasData
return out, nil
}
```
|
```xml
<?xml version="1.0" encoding="UTF-8"?>
<project xmlns="path_to_url" xmlns:xsi="path_to_url"
xsi:schemaLocation="path_to_url path_to_url">
<modelVersion>4.0.0</modelVersion>
<groupId>com.didispace</groupId>
<artifactId>SpringBoot-Learning</artifactId>
<version>1.0-SNAPSHOT</version>
<packaging>pom</packaging>
<modules>
<!-- 2.x1.xmodule -->
<module>2.x</module>
</modules>
</project>
```
|
Ellie Stewart (born 2 November 1996) is an English association football defender who most recently played for Liverpool Feds in the FA Women's National League North.
References
External links
FA player profile
Everton player profile
1996 births
Living people
Everton F.C. (women) players
English women's footballers
Women's association football defenders
Liverpool F.C. Women players
Blackburn Rovers W.F.C. players
Women's Super League players
Footballers from Liverpool
Sunderland A.F.C. Women players
England women's youth international footballers
Footballers from Rotherham
|
The Bray Road Beast is a 2018 American documentary film about the Beast of Bray Road, a purported humanoid wolf-life creature allegedly sighted in Elkhorn, Walworth County, Wisconsin. Directed and co-produced by Seth Breedlove, the film is the seventh documentary by his production company Small Town Monsters. It is narrated by Lyle Blackburn and features both animated sequences and live-action reenactments of alleged sightings of the titular cryptid. The music for the film was composed by Brandon Dalo and Underoath member Chris Dudley.
The Bray Road Beast was released on DVD and streaming services on October 5, 2018.
Production
The Bray Road Beast was financed in part by a crowdfunding campaign on the website Kickstarter, which production company Small Town Monsters launched in February 2018 in order to raise funds for both The Bray Road Beast and two other documentaries, The Flatwoods Monster: A Legacy of Fear and On the Trail of Champ.
Release and reception
The Bray Road Beast was released on DVD and streaming services on October 5, 2018. It later screened at the 14th annual Texas Frightmare Weekend in May 2019.
A reviewer for Wisconsin Frights wrote positively of the documentary, comparing its visual style to that of Hammer Horror films and calling it "unnerving and completely fascinating." Christine Burnham of PopHorror referred to the film as "overall interesting", though she criticized the special effects used to portray the titular creature as "crude and [...] a little silly".
References
External links
2018 films
2018 documentary films
2010s English-language films
|
The Baja California killifish (Fundulus lima) is a killifish in the family Fundulidae. It is native to the Baja California Peninsula region of northwestern Mexico. This fish was described by L.L. Vaillant in 1894 with the type locality given as San Ignacio de Caracamande in central Baja California.
The Baja California killifishes found in oases, springs, ponds, and creeks which have clear water with low salinity levels and relatively slow flows with substrates consisting of bedrock, sand, and gravel. Their diet is varied by season and is made up of diatoms, insect larvae, and fish scales during the dry season while in the rainy season it is mainly insect larvae, filamentous algae, and ostracods.
References
Baja California killifish
Endemic fish of Mexico
Freshwater fish of Mexico
Fauna of the Baja California Peninsula
Fish described in 1894
|
```java
package com.vladsch.flexmark.html2md.converter;
import com.vladsch.flexmark.test.util.spec.IRenderBase;
import com.vladsch.flexmark.util.ast.Node;
import com.vladsch.flexmark.util.data.DataHolder;
import org.jetbrains.annotations.NotNull;
import java.io.IOException;
class HtmlRootNodeRenderer extends IRenderBase {
final private int htmlExtensions;
public HtmlRootNodeRenderer() {
this(null);
}
public HtmlRootNodeRenderer(DataHolder options) {
super(options);
htmlExtensions = HtmlConverter.getHtmlExtensions(options);
}
@Override
public void render(@NotNull Node document, @NotNull Appendable output) {
assert document instanceof HtmlConverter.RootNode;
String text = ((HtmlConverter.RootNode) document).myRootNode;
try {
output.append(text);
} catch (IOException e) {
e.printStackTrace();
}
}
}
```
|
```css
/* gidole-400 - latin */
@font-face {
font-family: 'Gidole';
font-style: ;
font-weight: 400;
src: url('./files/gidole-400.eot'); /* IE9 Compat Modes */
src: local('Gidole Regular normal'), local('Gidole-Regularnormal'),
url('./files/gidole-400.eot?#iefix') format('embedded-opentype'), /* IE6-IE8 */
url('./files/gidole-400.woff2') format('woff2'), /* Super Modern Browsers */
url('./files/gidole-400.woff') format('woff'), /* Modern Browsers */
url('./files/gidole-400.svg#Gidole') format('svg'); /* Legacy iOS */
}
```
|
```makefile
################################################################################
#
# texinfo
#
################################################################################
# We are intentionally not using the latest version 5.x, because it
# causes issues with the documentation building process when creating
# a toolchain with the Crosstool-NG backend.
TEXINFO_VERSION = 4.13a
TEXINFO_SITE = $(BR2_GNU_MIRROR)/texinfo
TEXINFO_LICENSE = GPLv3+
TEXINFO_LICENSE_FILES = COPYING
TEXINFO_DEPENDENCIES = ncurses
$(eval $(host-autotools-package))
```
|
```go
package client
/*
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.
*/
import (
"fmt"
"github.com/apache/trafficcontrol/v8/lib/go-tc"
"github.com/apache/trafficcontrol/v8/traffic_ops/toclientlib"
)
// apiAsyncStatus is the API version-relative path for the /async_status/{id} API endpoint.
const apiAsyncStatus = "/async_status/%d"
// GetAsyncStatus gets an async_status from Traffic Ops.
func (to *Session) GetAsyncStatus(id int, opts RequestOptions) (tc.AsyncStatusResponse, toclientlib.ReqInf, error) {
route := fmt.Sprintf(apiAsyncStatus, id)
var data tc.AsyncStatusResponse
reqInf, err := to.get(route, opts, &data)
return data, reqInf, err
}
```
|
```html
<!DOCTYPE html>
<!--[if IE]><![endif]-->
<html>
<head>
<meta charset="utf-8">
<meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1">
<title>Enum StackType
| Advanced Algorithms </title>
<meta name="viewport" content="width=device-width">
<meta name="title" content="Enum StackType
| Advanced Algorithms ">
<meta name="generator" content="docfx 2.59.4.0">
<link rel="shortcut icon" href="../favicon.ico">
<link rel="stylesheet" href="../styles/docfx.vendor.css">
<link rel="stylesheet" href="../styles/docfx.css">
<link rel="stylesheet" href="../styles/main.css">
<meta property="docfx:navrel" content="">
<meta property="docfx:tocrel" content="toc.html">
<meta property="docfx:rel" content="../">
</head>
<body data-spy="scroll" data-target="#affix" data-offset="120">
<div id="wrapper">
<header>
<nav id="autocollapse" class="navbar navbar-inverse ng-scope" role="navigation">
<div class="container">
<div class="navbar-header">
<button type="button" class="navbar-toggle" data-toggle="collapse" data-target="#navbar">
<span class="sr-only">Toggle navigation</span>
<span class="icon-bar"></span>
<span class="icon-bar"></span>
<span class="icon-bar"></span>
</button>
<a class="navbar-brand" href="../index.html">
<img id="logo" class="svg" src="../logo.svg" alt="">
</a>
</div>
<div class="collapse navbar-collapse" id="navbar">
<form class="navbar-form navbar-right" role="search" id="search">
<div class="form-group">
<input type="text" class="form-control" id="search-query" placeholder="Search" autocomplete="off">
</div>
</form>
</div>
</div>
</nav>
<div class="subnav navbar navbar-default">
<div class="container hide-when-search" id="breadcrumb">
<ul class="breadcrumb">
<li></li>
</ul>
</div>
</div>
</header>
<div class="container body-content">
<div id="search-results">
<div class="search-list">Search Results for <span></span></div>
<div class="sr-items">
<p><i class="glyphicon glyphicon-refresh index-loading"></i></p>
</div>
<ul id="pagination" data-first="First" data-prev="Previous" data-next="Next" data-last="Last"></ul>
</div>
</div>
<div role="main" class="container body-content hide-when-search">
<div class="sidenav hide-when-search">
<a class="btn toc-toggle collapse" data-toggle="collapse" href="#sidetoggle" aria-expanded="false" aria-controls="sidetoggle">Show / Hide Table of Contents</a>
<div class="sidetoggle collapse" id="sidetoggle">
<div id="sidetoc"></div>
</div>
</div>
<div class="article row grid-right">
<div class="col-md-10">
<article class="content wrap" id="_content" data-uid="Advanced.Algorithms.DataStructures.Foundation.StackType">
<h1 id="Advanced_Algorithms_DataStructures_Foundation_StackType" data-uid="Advanced.Algorithms.DataStructures.Foundation.StackType" class="text-break">Enum StackType
</h1>
<div class="markdown level0 summary"><p>The stack implementation types.</p>
</div>
<div class="markdown level0 conceptual"></div>
<h6><strong>Namespace</strong>: <a class="xref" href="Advanced.Algorithms.DataStructures.Foundation.html">Advanced.Algorithms.DataStructures.Foundation</a></h6>
<h6><strong>Assembly</strong>: Advanced.Algorithms.dll</h6>
<h5 id="Advanced_Algorithms_DataStructures_Foundation_StackType_syntax">Syntax</h5>
<div class="codewrapper">
<pre><code class="lang-csharp hljs">public enum StackType</code></pre>
</div>
<h3 id="fields">Fields
</h3>
<table class="table table-bordered table-striped table-condensed">
<thead>
<tr>
<th>Name</th>
<th>Description</th>
</tr>
<thead>
<tbody>
<tr>
<td id="Advanced_Algorithms_DataStructures_Foundation_StackType_Array">Array</td>
<td></td>
</tr>
<tr>
<td id=your_sha256_hashst">LinkedList</td>
<td></td>
</tr>
</tbody>
</thead></thead></table>
</article>
</div>
<div class="hidden-sm col-md-2" role="complementary">
<div class="sideaffix">
<div class="contribution">
<ul class="nav">
<li>
<a href="path_to_url" class="contribution-link">Improve this Doc</a>
</li>
<li>
<a href="path_to_url#L78" class="contribution-link">View Source</a>
</li>
</ul>
</div>
<nav class="bs-docs-sidebar hidden-print hidden-xs hidden-sm affix" id="affix">
<h5>In This Article</h5>
<div></div>
</nav>
</div>
</div>
</div>
</div>
<footer>
<div class="grad-bottom"></div>
<div class="footer">
<div class="container">
<span class="pull-right">
<a href="#top">Back to top</a>
</span>
<span>Generated by <strong>DocFX</strong></span>
</div>
</div>
</footer>
</div>
<script type="text/javascript" src="../styles/docfx.vendor.js"></script>
<script type="text/javascript" src="../styles/docfx.js"></script>
<script type="text/javascript" src="../styles/main.js"></script>
</body>
</html>
```
|
Daniel Smart Fante (February 19, 1944 – November 23, 2015) was an American author and playwright. He was born in Los Angeles.
Biography
Fante was the son of novelist John Fante whose writing came back into vogue after Charles Bukowski declared him "my God", and wrote the introduction to the reprint of Fante's seminal novel about life in Los Angeles, Ask the Dust.
Chump Change, Mooch, 86'd and Spitting Off Tall Buildings comprise a tetralogy about Fante's hard living alter-ego Bruno Dante. Chump Change found publication in France originally, before being published in the US by Sun Dog Press. All four of the books were eventually republished in America by Harper Perennial and by United Kingdom publisher Canongate. Short Dog is a collection of short stories about Fante's life as a cab driver in LA.
Besides novels and short stories, Fante also wrote plays – "The Closer / The Boiler Room" described by the Los Angeles Times as "ferociously profane", and "Don Giovanni", about which 3:AM Magazine said: "For those who want to know what is REALLY going on in post-modern American literature right now, Don Giovanni should be essential reading". Both plays are published in book form by Long Beach publisher Burning Shore Press. He is also the author of A Gin-Pissing-Raw-Meat-Dual-Carburetor-V8-Son-Of-A-Bitch From Los Angeles, a volume of poetry on Wrecking Ball Press.
He died on November 23, 2015, in Los Angeles at the age of 71.
Bibliography
Chump Change (1998)
Mooch (2001)
Spitting Off Tall Buildings (2002)
Short Dog: Cab Driver Stories from the L. A. Streets (2002)
Gin Pissing, Raw Meat, Dual Carburettor V-8 Son-of-a-Bitch from Los Angeles (2002), poetry
Renewal, Bottle of Smoke Press (2005), Short Story
Don Giovanni: A Play (2006)
Kissed by a Fat Waitress (2008), poetry
86'd (2009)
John Fante & The Hollywood Ten, Bottle of Smoke Press (2010), Essay
Fante: A Family's Legacy of Writing, Drinking and Surviving (2011)
Point Doom (2013)
References
External links
Official homepage
Dan Fante: An American Writer (a documentary directed by Flavio Sciolé)
New York Times review of Short Dog
Interview of Dan Fante on NPR's Fresh Air with Terry Gross, September 29, 2009.
Interview with Dan Fante by Ben Myers
Interview with Dan Fante by Tony O'Neill
Interview with Dan Fante by Rob Woodard
Hand-written interview at ifpthendirt
Interview with Dan Fante by Alex Kudera
20th-century American novelists
1944 births
2015 deaths
Writers from Los Angeles
21st-century American novelists
20th-century American dramatists and playwrights
American male novelists
American male dramatists and playwrights
American male short story writers
20th-century American short story writers
21st-century American short story writers
20th-century American male writers
21st-century American male writers
|
Albert Lerat was a Belgian bobsledder who competed in the late 1940s. He won the silver medal in the four-man event at the 1947 FIBT World Championships in St. Moritz.
References
Bobsleigh four-man world championship medalists since 1930
Belgian male bobsledders
Possibly living people
Year of birth missing
Place of birth missing
20th-century Belgian people
|
```objective-c
#ifndef SRC_CONNECT_WRAP_H_
#define SRC_CONNECT_WRAP_H_
#if defined(NODE_WANT_INTERNALS) && NODE_WANT_INTERNALS
#include "env.h"
#include "req-wrap.h"
#include "async-wrap.h"
#include "v8.h"
namespace node {
class ConnectWrap : public ReqWrap<uv_connect_t> {
public:
ConnectWrap(Environment* env,
v8::Local<v8::Object> req_wrap_obj,
AsyncWrap::ProviderType provider);
size_t self_size() const override { return sizeof(*this); }
};
} // namespace node
#endif // defined(NODE_WANT_INTERNALS) && NODE_WANT_INTERNALS
#endif // SRC_CONNECT_WRAP_H_
```
|
```javascript
import { SearchPage } from '@swmansion/t-rex-ui';
export default SearchPage;
```
|
```objective-c
/*your_sha256_hash---------
*
* parse_oper.h
* handle operator things for parser
*
*
*
* src/include/parser/parse_oper.h
*
*your_sha256_hash---------
*/
#ifndef PARSE_OPER_H
#define PARSE_OPER_H
#include "access/htup.h"
#include "nodes/parsenodes.h"
#include "parser/parse_node.h"
typedef HeapTuple Operator;
/* Routines to look up an operator given name and exact input type(s) */
extern Oid LookupOperName(ParseState *pstate, List *opername,
Oid oprleft, Oid oprright,
bool noError, int location);
extern Oid LookupOperWithArgs(ObjectWithArgs *oper, bool noError);
/* Routines to find operators matching a name and given input types */
/* NB: the selected operator may require coercion of the input types! */
extern Operator oper(ParseState *pstate, List *op, Oid arg1, Oid arg2,
bool noError, int location);
extern Operator left_oper(ParseState *pstate, List *op, Oid arg,
bool noError, int location);
/* Routines to find operators that DO NOT require coercion --- ie, their */
/* input types are either exactly as given, or binary-compatible */
extern Operator compatible_oper(ParseState *pstate, List *op,
Oid arg1, Oid arg2,
bool noError, int location);
/* currently no need for compatible_left_oper/compatible_right_oper */
/* Routines for identifying "<", "=", ">" operators for a type */
extern void get_sort_group_operators(Oid argtype,
bool needLT, bool needEQ, bool needGT,
Oid *ltOpr, Oid *eqOpr, Oid *gtOpr,
bool *isHashable);
/* Convenience routines for common calls on the above */
extern Oid compatible_oper_opid(List *op, Oid arg1, Oid arg2, bool noError);
/* Extract operator OID or underlying-function OID from an Operator tuple */
extern Oid oprid(Operator op);
extern Oid oprfuncid(Operator op);
/* Build expression tree for an operator invocation */
extern Expr *make_op(ParseState *pstate, List *opname,
Node *ltree, Node *rtree, Node *last_srf, int location);
extern Expr *make_scalar_array_op(ParseState *pstate, List *opname,
bool useOr,
Node *ltree, Node *rtree, int location);
#endif /* PARSE_OPER_H */
```
|
```xml
// eslint-disable-next-line max-classes-per-file
import { inject, injectable } from 'inversify';
import { DiagnosticSeverity, l10n } from 'vscode';
import '../../../common/extensions';
import { useCommandPromptAsDefaultShell } from '../../../common/terminal/commandPrompt';
import { IConfigurationService, ICurrentProcess, IDisposableRegistry, Resource } from '../../../common/types';
import { Common } from '../../../common/utils/localize';
import { IServiceContainer } from '../../../ioc/types';
import { traceError } from '../../../logging';
import { sendTelemetryEvent } from '../../../telemetry';
import { EventName } from '../../../telemetry/constants';
import { BaseDiagnostic, BaseDiagnosticsService } from '../base';
import { IDiagnosticsCommandFactory } from '../commands/types';
import { DiagnosticCodes } from '../constants';
import { DiagnosticCommandPromptHandlerServiceId, MessageCommandPrompt } from '../promptHandler';
import { DiagnosticScope, IDiagnostic, IDiagnosticHandlerService } from '../types';
const PowershellActivationNotSupportedWithBatchFilesMessage = l10n.t(
'Activation of the selected Python environment is not supported in PowerShell. Consider changing your shell to Command Prompt.',
);
export class PowershellActivationNotAvailableDiagnostic extends BaseDiagnostic {
constructor(resource: Resource) {
super(
DiagnosticCodes.your_sha256_hashostic,
PowershellActivationNotSupportedWithBatchFilesMessage,
DiagnosticSeverity.Warning,
DiagnosticScope.Global,
resource,
undefined,
'always',
);
}
}
export const PowerShellActivationHackDiagnosticsServiceId =
your_sha256_hashostic';
@injectable()
export class PowerShellActivationHackDiagnosticsService extends BaseDiagnosticsService {
protected readonly messageService: IDiagnosticHandlerService<MessageCommandPrompt>;
constructor(
@inject(IServiceContainer) serviceContainer: IServiceContainer,
@inject(IDisposableRegistry) disposableRegistry: IDisposableRegistry,
) {
super(
[DiagnosticCodes.your_sha256_hashostic],
serviceContainer,
disposableRegistry,
true,
);
this.messageService = serviceContainer.get<IDiagnosticHandlerService<MessageCommandPrompt>>(
IDiagnosticHandlerService,
DiagnosticCommandPromptHandlerServiceId,
);
}
// eslint-disable-next-line class-methods-use-this
public async diagnose(): Promise<IDiagnostic[]> {
return [];
}
protected async onHandle(diagnostics: IDiagnostic[]): Promise<void> {
// This class can only handle one type of diagnostic, hence just use first item in list.
if (diagnostics.length === 0 || !this.canHandle(diagnostics[0])) {
return;
}
const diagnostic = diagnostics[0];
if (await this.filterService.shouldIgnoreDiagnostic(diagnostic.code)) {
return;
}
const commandFactory = this.serviceContainer.get<IDiagnosticsCommandFactory>(IDiagnosticsCommandFactory);
const currentProcess = this.serviceContainer.get<ICurrentProcess>(ICurrentProcess);
const configurationService = this.serviceContainer.get<IConfigurationService>(IConfigurationService);
const options = [
{
prompt: Common.useCommandPrompt,
command: {
diagnostic,
invoke: async (): Promise<void> => {
sendTelemetryEvent(EventName.DIAGNOSTICS_ACTION, undefined, {
action: 'switchToCommandPrompt',
});
useCommandPromptAsDefaultShell(currentProcess, configurationService).catch((ex) =>
traceError('Use Command Prompt as default shell', ex),
);
},
},
},
{
prompt: Common.ignore,
},
{
prompt: Common.alwaysIgnore,
command: commandFactory.createCommand(diagnostic, { type: 'ignore', options: DiagnosticScope.Global }),
},
{
prompt: Common.moreInfo,
command: commandFactory.createCommand(diagnostic, {
type: 'launch',
options: 'path_to_url
}),
},
];
await this.messageService.handle(diagnostic, { commandPrompts: options });
}
}
```
|
```shell
The `sticky bit` permission
Running a command as another local user
`su` vs `sudo`
```
|
Jason Douglas King (born November 18, 1993) is an American football guard who is currently a free agent. He played college football at Purdue.
Professional career
New England Patriots
King signed with the New England Patriots as an undrafted free agent on May 5, 2017. He was waived by the Patriots on September 2, 2017. He was re-signed to the practice squad on September 20, 2017. He was released on October 9, 2017.
Baltimore Ravens
On October 31, 2017, King was signed to the Baltimore Ravens' practice squad. He was released on November 14, 2017.
New England Patriots (second stint)
On November 28, 2017, King was signed to the Patriots' active roster. He was waived by the Patriots on December 2, 2017, and was re-signed to New England's practice squad on December 5, 2017. He signed a reserve/future contract with the Patriots on February 6, 2018. He was waived on May 10, 2018, but was re-signed on May 18. He was waived again on September 1, 2018.
Birmingham Iron
In November 2018, King signed with the Birmingham Iron of the Alliance of American Football.
Student-Athlete career
Pulaski Academy
King played high school football for coach Kevin Kelley at Pulaski Academy in Little Rock, Arkansas. He graduated from Pulaski Academy in the class of 2012.
Purdue
King committed to Purdue on December 26, 2011, and later signed a letter of intent to Purdue on February 1, 2012. He attended school at Purdue from 2012 until graduating in 2016, having played in 45 games during his collegiate career.
References
External links
Purdue Boilermakers bio
1993 births
Living people
Players of American football from Little Rock, Arkansas
American football offensive guards
Purdue Boilermakers football players
New England Patriots players
Baltimore Ravens players
Birmingham Iron players
|
Agalagandi is a village in the southern state of Karnataka, India. It is located in the Koppa taluk of Chikkamagaluru district in Karnataka.
See also
Chikmagalur
Districts of Karnataka
References
External links
http://Chikmagalur.nic.in/
Villages in Chikkamagaluru district
|
```smalltalk
namespace Ombi.Settings.Settings.Models.External
{
public class RadarrSettings : ExternalSettings
{
public bool Enabled { get; set; }
public string ApiKey { get; set; }
public string DefaultQualityProfile { get; set; }
public string DefaultRootPath { get; set; }
public bool AddOnly { get; set; }
public string MinimumAvailability { get; set; }
public bool ScanForAvailability { get; set; }
public int? Tag { get; set; }
public bool SendUserTags { get; set; }
}
public class Radarr4KSettings : RadarrSettings
{
// no additional properties needed
}
public class RadarrCombinedModel
{
public RadarrSettings Radarr { get; set; }
public Radarr4KSettings Radarr4K { get; set; }
}
}
```
|
Law of the Blade is a full-length studio album by German heavy metal band Paragon, released in 2002.
Track listing
"Abducted" – 03:55
"Palace of Sin" – 03:55
"Armies of the Tyrant" – 05:02
"Law of the Blade" – 03:32
"Across the Wastelands" – 07:01
"Shadow World" – 05:33
"Allied Forces" – 05:28
"Empire's Fall" – 03:38
"The Journey's End" – 05:03
"Back to Glory" – 05:08
Credits
Andreas Babuschkin – lead vocals
Martin Christian – guitars, backing vocals
Claudius Cremer – guitars
Jan Bünning – bass, backing vocals
Markus Corby – drums
All music written and arranged by Paragon.
All lyrics by Babuschkin, except "Palace of Sin" and "Empire's Fall" by Christian.
2002 albums
Paragon (band) albums
|
```objective-c
/*
* iperlsys.h - Perl's interface to the system
*
* This file defines the system level functionality that perl needs.
*
* When using C, this definition is in the form of a set of macros that can be
* #defined to the system-level function (or a wrapper provided elsewhere).
*
* GSAR 21-JUN-98
*/
#ifndef __Inc__IPerl___
#define __Inc__IPerl___
/*
* PerlXXX_YYY explained - DickH and DougL @ ActiveState.com
*
* XXX := functional group
* YYY := stdlib/OS function name
*
* Continuing with the theme of PerlIO, all OS functionality was encapsulated
* into one of several interfaces.
*
* PerlIO - stdio
* PerlLIO - low level I/O
* PerlMem - malloc, realloc, free
* PerlDir - directory related
* PerlEnv - process environment handling
* PerlProc - process control
* PerlSock - socket functions
*
*
* The features of this are:
* 1. All OS dependant code is in the Perl Host and not the Perl Core.
* (At least this is the holy grail goal of this work)
* 2. The Perl Host (see perl.h for description) can provide a new and
* improved interface to OS functionality if required.
* 3. Developers can easily hook into the OS calls for instrumentation
* or diagnostic purposes.
*
* What was changed to do this:
* 1. All calls to OS functions were replaced with PerlXXX_YYY
*
*/
/*
Interface for perl stdio functions, or whatever we are Configure-d
to use.
*/
#include "perlio.h"
typedef Signal_t (*Sighandler1_t) (int);
typedef Signal_t (*Sighandler3_t) (int, Siginfo_t*, void*);
#ifndef Sighandler_t
# ifdef PERL_USE_3ARG_SIGHANDLER
typedef Sighandler3_t Sighandler_t;
# else
typedef Sighandler1_t Sighandler_t;
# endif
#endif
#if defined(PERL_IMPLICIT_SYS)
/* IPerlStdIO */
struct IPerlStdIO;
struct IPerlStdIOInfo;
typedef FILE* (*LPStdin)(struct IPerlStdIO*);
typedef FILE* (*LPStdout)(struct IPerlStdIO*);
typedef FILE* (*LPStderr)(struct IPerlStdIO*);
typedef FILE* (*LPOpen)(struct IPerlStdIO*, const char*,
const char*);
typedef int (*LPClose)(struct IPerlStdIO*, FILE*);
typedef int (*LPEof)(struct IPerlStdIO*, FILE*);
typedef int (*LPError)(struct IPerlStdIO*, FILE*);
typedef void (*LPClearerr)(struct IPerlStdIO*, FILE*);
typedef int (*LPGetc)(struct IPerlStdIO*, FILE*);
typedef STDCHAR* (*LPGetBase)(struct IPerlStdIO*, FILE*);
typedef int (*LPGetBufsiz)(struct IPerlStdIO*, FILE*);
typedef int (*LPGetCnt)(struct IPerlStdIO*, FILE*);
typedef STDCHAR* (*LPGetPtr)(struct IPerlStdIO*, FILE*);
typedef char* (*LPGets)(struct IPerlStdIO*, char*, int, FILE*);
typedef int (*LPPutc)(struct IPerlStdIO*, int, FILE*);
typedef int (*LPPuts)(struct IPerlStdIO*, const char *, FILE*);
typedef int (*LPFlush)(struct IPerlStdIO*, FILE*);
typedef int (*LPUngetc)(struct IPerlStdIO*, int,FILE*);
typedef int (*LPFileno)(struct IPerlStdIO*, FILE*);
typedef FILE* (*LPFdopen)(struct IPerlStdIO*, int, const char*);
typedef FILE* (*LPReopen)(struct IPerlStdIO*, const char*,
const char*, FILE*);
typedef SSize_t (*LPRead)(struct IPerlStdIO*, void*, Size_t, Size_t, FILE *);
typedef SSize_t (*LPWrite)(struct IPerlStdIO*, const void*, Size_t, Size_t, FILE *);
typedef void (*LPSetBuf)(struct IPerlStdIO*, FILE*, char*);
typedef int (*LPSetVBuf)(struct IPerlStdIO*, FILE*, char*, int,
Size_t);
typedef void (*LPSetCnt)(struct IPerlStdIO*, FILE*, int);
typedef void (*LPSetPtr)(struct IPerlStdIO*, FILE*, STDCHAR*);
typedef void (*LPSetlinebuf)(struct IPerlStdIO*, FILE*);
typedef int (*LPPrintf)(struct IPerlStdIO*, FILE*, const char*,
...);
typedef int (*LPVprintf)(struct IPerlStdIO*, FILE*, const char*,
va_list);
typedef Off_t (*LPTell)(struct IPerlStdIO*, FILE*);
typedef int (*LPSeek)(struct IPerlStdIO*, FILE*, Off_t, int);
typedef void (*LPRewind)(struct IPerlStdIO*, FILE*);
typedef FILE* (*LPTmpfile)(struct IPerlStdIO*);
typedef int (*LPGetpos)(struct IPerlStdIO*, FILE*, Fpos_t*);
typedef int (*LPSetpos)(struct IPerlStdIO*, FILE*,
const Fpos_t*);
typedef void (*LPInit)(struct IPerlStdIO*);
typedef void (*LPInitOSExtras)(struct IPerlStdIO*);
typedef FILE* (*LPFdupopen)(struct IPerlStdIO*, FILE*);
struct IPerlStdIO
{
LPStdin pStdin;
LPStdout pStdout;
LPStderr pStderr;
LPOpen pOpen;
LPClose pClose;
LPEof pEof;
LPError pError;
LPClearerr pClearerr;
LPGetc pGetc;
LPGetBase pGetBase;
LPGetBufsiz pGetBufsiz;
LPGetCnt pGetCnt;
LPGetPtr pGetPtr;
LPGets pGets;
LPPutc pPutc;
LPPuts pPuts;
LPFlush pFlush;
LPUngetc pUngetc;
LPFileno pFileno;
LPFdopen pFdopen;
LPReopen pReopen;
LPRead pRead;
LPWrite pWrite;
LPSetBuf pSetBuf;
LPSetVBuf pSetVBuf;
LPSetCnt pSetCnt;
LPSetPtr pSetPtr;
LPSetlinebuf pSetlinebuf;
LPPrintf pPrintf;
LPVprintf pVprintf;
LPTell pTell;
LPSeek pSeek;
LPRewind pRewind;
LPTmpfile pTmpfile;
LPGetpos pGetpos;
LPSetpos pSetpos;
LPInit pInit;
LPInitOSExtras pInitOSExtras;
LPFdupopen pFdupopen;
};
struct IPerlStdIOInfo
{
unsigned long nCount; /* number of entries expected */
struct IPerlStdIO perlStdIOList;
};
/* These do not belong here ... NI-S, 14 Nov 2000 */
# ifdef USE_STDIO_PTR
# define PerlSIO_has_cntptr(f) 1
# ifdef STDIO_PTR_LVALUE
# ifdef STDIO_CNT_LVALUE
# define PerlSIO_canset_cnt(f) 1
# ifdef STDIO_PTR_LVAL_NOCHANGE_CNT
# define PerlSIO_fast_gets(f) 1
# endif
# else /* STDIO_CNT_LVALUE */
# define PerlSIO_canset_cnt(f) 0
# endif
# else /* STDIO_PTR_LVALUE */
# ifdef STDIO_PTR_LVAL_SETS_CNT
# define PerlSIO_fast_gets(f) 1
# endif
# endif
# else /* USE_STDIO_PTR */
# define PerlSIO_has_cntptr(f) 0
# define PerlSIO_canset_cnt(f) 0
# endif /* USE_STDIO_PTR */
# ifndef PerlSIO_fast_gets
# define PerlSIO_fast_gets(f) 0
# endif
# ifdef FILE_base
# define PerlSIO_has_base(f) 1
# else
# define PerlSIO_has_base(f) 0
# endif
/* Now take FILE * via function table */
# define PerlSIO_stdin \
(*PL_StdIO->pStdin)(PL_StdIO)
# define PerlSIO_stdout \
(*PL_StdIO->pStdout)(PL_StdIO)
# define PerlSIO_stderr \
(*PL_StdIO->pStderr)(PL_StdIO)
# define PerlSIO_fopen(x,y) \
(*PL_StdIO->pOpen)(PL_StdIO, (x),(y))
# define PerlSIO_fclose(f) \
(*PL_StdIO->pClose)(PL_StdIO, (f))
# define PerlSIO_feof(f) \
(*PL_StdIO->pEof)(PL_StdIO, (f))
# define PerlSIO_ferror(f) \
(*PL_StdIO->pError)(PL_StdIO, (f))
# define PerlSIO_clearerr(f) \
(*PL_StdIO->pClearerr)(PL_StdIO, (f))
# define PerlSIO_fgetc(f) \
(*PL_StdIO->pGetc)(PL_StdIO, (f))
# define PerlSIO_get_base(f) \
(*PL_StdIO->pGetBase)(PL_StdIO, (f))
# define PerlSIO_get_bufsiz(f) \
(*PL_StdIO->pGetBufsiz)(PL_StdIO, (f))
# define PerlSIO_get_cnt(f) \
(*PL_StdIO->pGetCnt)(PL_StdIO, (f))
# define PerlSIO_get_ptr(f) \
(*PL_StdIO->pGetPtr)(PL_StdIO, (f))
# define PerlSIO_fputc(c,f) \
(*PL_StdIO->pPutc)(PL_StdIO, (c),(f))
# define PerlSIO_fputs(s,f) \
(*PL_StdIO->pPuts)(PL_StdIO, (s),(f))
# define PerlSIO_fflush(f) \
(*PL_StdIO->pFlush)(PL_StdIO, (f))
# define PerlSIO_fgets(s, n, f) \
(*PL_StdIO->pGets)(PL_StdIO, s, n, (f))
# define PerlSIO_ungetc(c,f) \
(*PL_StdIO->pUngetc)(PL_StdIO, (c),(f))
# define PerlSIO_fileno(f) \
(*PL_StdIO->pFileno)(PL_StdIO, (f))
# define PerlSIO_fdopen(f, s) \
(*PL_StdIO->pFdopen)(PL_StdIO, (f),(s))
# define PerlSIO_freopen(p, m, f) \
(*PL_StdIO->pReopen)(PL_StdIO, (p), (m), (f))
# define PerlSIO_fread(buf,sz,count,f) \
(*PL_StdIO->pRead)(PL_StdIO, (buf), (sz), (count), (f))
# define PerlSIO_fwrite(buf,sz,count,f) \
(*PL_StdIO->pWrite)(PL_StdIO, (buf), (sz), (count), (f))
# define PerlSIO_setbuf(f,b) \
(*PL_StdIO->pSetBuf)(PL_StdIO, (f), (b))
# define PerlSIO_setvbuf(f,b,t,s) \
(*PL_StdIO->pSetVBuf)(PL_StdIO, (f),(b),(t),(s))
# define PerlSIO_set_cnt(f,c) \
(*PL_StdIO->pSetCnt)(PL_StdIO, (f), (c))
# define PerlSIO_set_ptr(f,p) \
(*PL_StdIO->pSetPtr)(PL_StdIO, (f), (p))
# define PerlSIO_setlinebuf(f) \
(*PL_StdIO->pSetlinebuf)(PL_StdIO, (f))
# define PerlSIO_printf Perl_fprintf_nocontext
# define PerlSIO_stdoutf Perl_printf_nocontext
# define PerlSIO_vprintf(f,fmt,a) \
(*PL_StdIO->pVprintf)(PL_StdIO, (f),(fmt),a)
# define PerlSIO_ftell(f) \
(*PL_StdIO->pTell)(PL_StdIO, (f))
# define PerlSIO_fseek(f,o,w) \
(*PL_StdIO->pSeek)(PL_StdIO, (f),(o),(w))
# define PerlSIO_fgetpos(f,p) \
(*PL_StdIO->pGetpos)(PL_StdIO, (f),(p))
# define PerlSIO_fsetpos(f,p) \
(*PL_StdIO->pSetpos)(PL_StdIO, (f),(p))
# define PerlSIO_rewind(f) \
(*PL_StdIO->pRewind)(PL_StdIO, (f))
# define PerlSIO_tmpfile() \
(*PL_StdIO->pTmpfile)(PL_StdIO)
# define PerlSIO_init() \
(*PL_StdIO->pInit)(PL_StdIO)
# undef init_os_extras
# define init_os_extras() \
(*PL_StdIO->pInitOSExtras)(PL_StdIO)
# define PerlSIO_fdupopen(f) \
(*PL_StdIO->pFdupopen)(PL_StdIO, (f))
#else /* ! PERL_IMPLICIT_SYS */
# define PerlSIO_stdin stdin
# define PerlSIO_stdout stdout
# define PerlSIO_stderr stderr
# define PerlSIO_fopen(x,y) fopen(x,y)
# ifdef __VOS__
/* Work around VOS bug posix-979, wrongly setting errno when at end of file. */
# define PerlSIO_fclose(f) (((errno==1025)?errno=0:0),fclose(f))
# define PerlSIO_feof(f) (((errno==1025)?errno=0:0),feof(f))
# define PerlSIO_ferror(f) (((errno==1025)?errno=0:0),ferror(f))
# else
# define PerlSIO_fclose(f) fclose(f)
# define PerlSIO_feof(f) feof(f)
# define PerlSIO_ferror(f) ferror(f)
# endif
# define PerlSIO_clearerr(f) clearerr(f)
# define PerlSIO_fgetc(f) fgetc(f)
# ifdef FILE_base
# define PerlSIO_get_base(f) FILE_base(f)
# define PerlSIO_get_bufsiz(f) FILE_bufsiz(f)
# else
# define PerlSIO_get_base(f) NULL
# define PerlSIO_get_bufsiz(f) 0
# endif
# ifdef USE_STDIO_PTR
# define PerlSIO_get_cnt(f) FILE_cnt(f)
# define PerlSIO_get_ptr(f) FILE_ptr(f)
# else
# define PerlSIO_get_cnt(f) 0
# define PerlSIO_get_ptr(f) NULL
# endif
# define PerlSIO_fputc(c,f) fputc(c,f)
# define PerlSIO_fputs(s,f) fputs(s,f)
# define PerlSIO_fflush(f) Fflush(f)
# define PerlSIO_fgets(s, n, f) fgets(s,n,f)
# if defined(__VMS)
/* Unusual definition of ungetc() here to accommodate fast_sv_gets()'
* belief that it can mix getc/ungetc with reads from stdio buffer */
START_EXTERN_C
int decc$ungetc(int __c, FILE *__stream);
END_EXTERN_C
# define PerlSIO_ungetc(c,f) ((c) == EOF ? EOF : \
((*(f) && !((*(f))->_flag & _IONBF) && \
((*(f))->_ptr > (*(f))->_base)) ? \
((*(f))->_cnt++, *(--(*(f))->_ptr) = (c)) : decc$ungetc(c,f)))
# else
# define PerlSIO_ungetc(c,f) ungetc(c,f)
# endif
# define PerlSIO_fileno(f) fileno(f)
# define PerlSIO_fdopen(f, s) fdopen(f,s)
# define PerlSIO_freopen(p, m, f) freopen(p,m,f)
# define PerlSIO_fread(buf,sz,count,f) fread(buf,sz,count,f)
# define PerlSIO_fwrite(buf,sz,count,f) fwrite(buf,sz,count,f)
# define PerlSIO_setbuf(f,b) setbuf(f,b)
# define PerlSIO_setvbuf(f,b,t,s) setvbuf(f,b,t,s)
# if defined(USE_STDIO_PTR) && defined(STDIO_CNT_LVALUE)
# define PerlSIO_set_cnt(f,c) FILE_cnt(f) = (c)
# else
# define PerlSIO_set_cnt(f,c) PerlIOProc_abort()
# endif
# if defined(USE_STDIO_PTR) && defined(STDIO_PTR_LVALUE)
# define PerlSIO_set_ptr(f,p) (FILE_ptr(f) = (p))
# else
# define PerlSIO_set_ptr(f,p) PerlIOProc_abort()
# endif
# define PerlSIO_setlinebuf(f) setlinebuf(f)
# define PerlSIO_printf fprintf
# define PerlSIO_stdoutf printf
# define PerlSIO_vprintf(f,fmt,a) vfprintf(f,fmt,a)
# define PerlSIO_ftell(f) ftell(f)
# define PerlSIO_fseek(f,o,w) fseek(f,o,w)
# define PerlSIO_fgetpos(f,p) fgetpos(f,p)
# define PerlSIO_fsetpos(f,p) fsetpos(f,p)
# define PerlSIO_rewind(f) rewind(f)
# define PerlSIO_tmpfile() tmpfile()
# define PerlSIO_fdupopen(f) (f)
#endif /* PERL_IMPLICIT_SYS */
/*
* Interface for directory functions
*/
#if defined(PERL_IMPLICIT_SYS)
/* IPerlDir */
struct IPerlDir;
struct IPerlDirInfo;
typedef int (*LPMakedir)(struct IPerlDir*, const char*, int);
typedef int (*LPChdir)(struct IPerlDir*, const char*);
typedef int (*LPRmdir)(struct IPerlDir*, const char*);
typedef int (*LPDirClose)(struct IPerlDir*, DIR*);
typedef DIR* (*LPDirOpen)(struct IPerlDir*, const char*);
typedef struct direct* (*LPDirRead)(struct IPerlDir*, DIR*);
typedef void (*LPDirRewind)(struct IPerlDir*, DIR*);
typedef void (*LPDirSeek)(struct IPerlDir*, DIR*, long);
typedef long (*LPDirTell)(struct IPerlDir*, DIR*);
# ifdef WIN32
typedef char* (*LPDirMapPathA)(struct IPerlDir*, const char*);
typedef WCHAR* (*LPDirMapPathW)(struct IPerlDir*, const WCHAR*);
# endif
struct IPerlDir
{
LPMakedir pMakedir;
LPChdir pChdir;
LPRmdir pRmdir;
LPDirClose pClose;
LPDirOpen pOpen;
LPDirRead pRead;
LPDirRewind pRewind;
LPDirSeek pSeek;
LPDirTell pTell;
# ifdef WIN32
LPDirMapPathA pMapPathA;
LPDirMapPathW pMapPathW;
# endif
};
struct IPerlDirInfo
{
unsigned long nCount; /* number of entries expected */
struct IPerlDir perlDirList;
};
# define PerlDir_mkdir(name, mode) \
(*PL_Dir->pMakedir)(PL_Dir, (name), (mode))
# define PerlDir_chdir(name) \
(*PL_Dir->pChdir)(PL_Dir, (name))
# define PerlDir_rmdir(name) \
(*PL_Dir->pRmdir)(PL_Dir, (name))
# define PerlDir_close(dir) \
(*PL_Dir->pClose)(PL_Dir, (dir))
# define PerlDir_open(name) \
(*PL_Dir->pOpen)(PL_Dir, (name))
# define PerlDir_read(dir) \
(*PL_Dir->pRead)(PL_Dir, (dir))
# define PerlDir_rewind(dir) \
(*PL_Dir->pRewind)(PL_Dir, (dir))
# define PerlDir_seek(dir, loc) \
(*PL_Dir->pSeek)(PL_Dir, (dir), (loc))
# define PerlDir_tell(dir) \
(*PL_Dir->pTell)(PL_Dir, (dir))
# ifdef WIN32
# define PerlDir_mapA(dir) \
(*PL_Dir->pMapPathA)(PL_Dir, (dir))
# define PerlDir_mapW(dir) \
(*PL_Dir->pMapPathW)(PL_Dir, (dir))
# endif
# else /* ! PERL_IMPLICIT_SYS */
# define PerlDir_mkdir(name, mode) Mkdir((name), (mode))
# ifdef VMS
# define PerlDir_chdir(n) Chdir((n))
# else
# define PerlDir_chdir(name) chdir((name))
# endif
# define PerlDir_rmdir(name) rmdir((name))
# define PerlDir_close(dir) closedir((dir))
# define PerlDir_open(name) opendir((name))
# define PerlDir_read(dir) readdir((dir))
# define PerlDir_rewind(dir) rewinddir((dir))
# define PerlDir_seek(dir, loc) seekdir((dir), (loc))
# define PerlDir_tell(dir) telldir((dir))
# ifdef WIN32
# define PerlDir_mapA(dir) dir
# define PerlDir_mapW(dir) dir
# endif
#endif /* PERL_IMPLICIT_SYS */
/*
Interface for perl environment functions
*/
#if defined(PERL_IMPLICIT_SYS)
/* IPerlEnv */
struct IPerlEnv;
struct IPerlEnvInfo;
typedef char* (*LPEnvGetenv)(struct IPerlEnv*, const char*);
typedef int (*LPEnvPutenv)(struct IPerlEnv*, const char*);
typedef char* (*LPEnvGetenv_len)(struct IPerlEnv*,
const char *varname, unsigned long *len);
typedef int (*LPEnvUname)(struct IPerlEnv*, struct utsname *name);
typedef void (*LPEnvClearenv)(struct IPerlEnv*);
typedef void* (*LPEnvGetChildenv)(struct IPerlEnv*);
typedef void (*LPEnvFreeChildenv)(struct IPerlEnv*, void* env);
typedef char* (*LPEnvGetChilddir)(struct IPerlEnv*);
typedef void (*LPEnvFreeChilddir)(struct IPerlEnv*, char* dir);
# ifdef HAS_ENVGETENV
typedef char* (*LPENVGetenv)(struct IPerlEnv*, const char *varname);
typedef char* (*LPENVGetenv_len)(struct IPerlEnv*,
const char *varname, unsigned long *len);
# endif
# ifdef WIN32
typedef unsigned long (*LPEnvOsID)(struct IPerlEnv*);
typedef char* (*LPEnvLibPath)(struct IPerlEnv*, WIN32_NO_REGISTRY_M_(const char*)
STRLEN *const len);
typedef char* (*LPEnvSiteLibPath)(struct IPerlEnv*, const char*,
STRLEN *const len);
typedef char* (*LPEnvVendorLibPath)(struct IPerlEnv*, const char*,
STRLEN *const len);
typedef void (*LPEnvGetChildIO)(struct IPerlEnv*, child_IO_table*);
# endif
struct IPerlEnv
{
LPEnvGetenv pGetenv;
LPEnvPutenv pPutenv;
LPEnvGetenv_len pGetenv_len;
LPEnvUname pEnvUname;
LPEnvClearenv pClearenv;
LPEnvGetChildenv pGetChildenv;
LPEnvFreeChildenv pFreeChildenv;
LPEnvGetChilddir pGetChilddir;
LPEnvFreeChilddir pFreeChilddir;
# ifdef HAS_ENVGETENV
LPENVGetenv pENVGetenv;
LPENVGetenv_len pENVGetenv_len;
# endif
# ifdef WIN32
LPEnvOsID pEnvOsID;
LPEnvLibPath pLibPath;
LPEnvSiteLibPath pSiteLibPath;
LPEnvVendorLibPath pVendorLibPath;
LPEnvGetChildIO pGetChildIO;
# endif
};
struct IPerlEnvInfo
{
unsigned long nCount; /* number of entries expected */
struct IPerlEnv perlEnvList;
};
# define PerlEnv_putenv(str) \
(*PL_Env->pPutenv)(PL_Env,(str))
# define PerlEnv_getenv(str) \
(*PL_Env->pGetenv)(PL_Env,(str))
# define PerlEnv_getenv_len(str,l) \
(*PL_Env->pGetenv_len)(PL_Env,(str), (l))
# define PerlEnv_clearenv() \
(*PL_Env->pClearenv)(PL_Env)
# define PerlEnv_get_childenv() \
(*PL_Env->pGetChildenv)(PL_Env)
# define PerlEnv_free_childenv(e) \
(*PL_Env->pFreeChildenv)(PL_Env, (e))
# define PerlEnv_get_childdir() \
(*PL_Env->pGetChilddir)(PL_Env)
# define PerlEnv_free_childdir(d) \
(*PL_Env->pFreeChilddir)(PL_Env, (d))
# ifdef HAS_ENVGETENV
# define PerlEnv_ENVgetenv(str) \
(*PL_Env->pENVGetenv)(PL_Env,(str))
# define PerlEnv_ENVgetenv_len(str,l) \
(*PL_Env->pENVGetenv_len)(PL_Env,(str), (l))
# else
# define PerlEnv_ENVgetenv(str) \
PerlEnv_getenv((str))
# define PerlEnv_ENVgetenv_len(str,l) \
PerlEnv_getenv_len((str),(l))
# endif
# define PerlEnv_uname(name) \
(*PL_Env->pEnvUname)(PL_Env,(name))
# ifdef WIN32
# define PerlEnv_os_id() \
(*PL_Env->pEnvOsID)(PL_Env)
# define PerlEnv_lib_path(str, lenp) \
(*PL_Env->pLibPath)(PL_Env,WIN32_NO_REGISTRY_M_(str)(lenp))
# define PerlEnv_sitelib_path(str, lenp) \
(*PL_Env->pSiteLibPath)(PL_Env,(str),(lenp))
# define PerlEnv_vendorlib_path(str, lenp) \
(*PL_Env->pVendorLibPath)(PL_Env,(str),(lenp))
# define PerlEnv_get_child_IO(ptr) \
(*PL_Env->pGetChildIO)(PL_Env, ptr)
# endif
#else /* below is ! PERL_IMPLICIT_SYS */
# ifndef USE_ITHREADS /* Threaded is an inline function in inline.h */
# define PerlEnv_putenv(str) putenv(str)
# endif
# define PerlEnv_getenv(str) mortal_getenv(str)
# define PerlEnv_getenv_len(str,l) getenv_len((str), (l))
# ifdef HAS_ENVGETENV
# define PerlEnv_ENVgetenv(str) ENVgetenv((str))
# define PerlEnv_ENVgetenv_len(str,l) ENVgetenv_len((str), (l))
# else
# define PerlEnv_ENVgetenv(str) PerlEnv_getenv((str))
# define PerlEnv_ENVgetenv_len(str,l) PerlEnv_getenv_len((str), (l))
# endif
# define PerlEnv_uname(name) uname((name))
# ifdef WIN32
# define PerlEnv_os_id() win32_os_id()
# define PerlEnv_lib_path(str, lenp) win32_get_privlib(WIN32_NO_REGISTRY_M_(str) lenp)
# define PerlEnv_sitelib_path(str, lenp) win32_get_sitelib(str, lenp)
# define PerlEnv_vendorlib_path(str, lenp) win32_get_vendorlib(str, lenp)
# define PerlEnv_get_child_IO(ptr) win32_get_child_IO(ptr)
# define PerlEnv_clearenv() win32_clearenv()
# define PerlEnv_get_childenv() win32_get_childenv()
# define PerlEnv_free_childenv(e) win32_free_childenv((e))
# define PerlEnv_get_childdir() win32_get_childdir()
# define PerlEnv_free_childdir(d) win32_free_childdir((d))
# else
# define PerlEnv_clearenv(str) (ENV_LOCK, (clearenv(str) \
? (ENV_UNLOCK, 1) \
: (ENV_UNLOCK, 0)))
# define PerlEnv_get_childenv() get_childenv()
# define PerlEnv_free_childenv(e) free_childenv((e))
# define PerlEnv_get_childdir() get_childdir()
# define PerlEnv_free_childdir(d) free_childdir((d))
# endif
#endif /* PERL_IMPLICIT_SYS */
/*
Interface for perl low-level IO functions
*/
#if defined(PERL_IMPLICIT_SYS)
struct utimbuf; /* prevent gcc warning about the use below */
/* IPerlLIO */
struct IPerlLIO;
struct IPerlLIOInfo;
typedef int (*LPLIOAccess)(struct IPerlLIO*, const char*, int);
typedef int (*LPLIOChmod)(struct IPerlLIO*, const char*, int);
typedef int (*LPLIOChown)(struct IPerlLIO*, const char*, uid_t,
gid_t);
typedef int (*LPLIOChsize)(struct IPerlLIO*, int, Off_t);
typedef int (*LPLIOClose)(struct IPerlLIO*, int);
typedef int (*LPLIODup)(struct IPerlLIO*, int);
typedef int (*LPLIODup2)(struct IPerlLIO*, int, int);
typedef int (*LPLIOFlock)(struct IPerlLIO*, int, int);
typedef int (*LPLIOFileStat)(struct IPerlLIO*, int, Stat_t*);
typedef int (*LPLIOIOCtl)(struct IPerlLIO*, int, unsigned int,
char*);
typedef int (*LPLIOIsatty)(struct IPerlLIO*, int);
typedef int (*LPLIOLink)(struct IPerlLIO*, const char*,
const char *);
typedef Off_t (*LPLIOLseek)(struct IPerlLIO*, int, Off_t, int);
typedef int (*LPLIOLstat)(struct IPerlLIO*, const char*,
Stat_t*);
typedef char* (*LPLIOMktemp)(struct IPerlLIO*, char*);
typedef int (*LPLIOOpen)(struct IPerlLIO*, const char*, int);
typedef int (*LPLIOOpen3)(struct IPerlLIO*, const char*, int, int);
typedef int (*LPLIORead)(struct IPerlLIO*, int, void*, unsigned int);
typedef int (*LPLIORename)(struct IPerlLIO*, const char*,
const char*);
typedef int (*LPLIOSetmode)(struct IPerlLIO*, int, int);
typedef int (*LPLIONameStat)(struct IPerlLIO*, const char*,
Stat_t*);
typedef char* (*LPLIOTmpnam)(struct IPerlLIO*, char*);
typedef int (*LPLIOUmask)(struct IPerlLIO*, int);
typedef int (*LPLIOUnlink)(struct IPerlLIO*, const char*);
typedef int (*LPLIOUtime)(struct IPerlLIO*, const char*, struct utimbuf*);
typedef int (*LPLIOWrite)(struct IPerlLIO*, int, const void*,
unsigned int);
typedef int (*LPLIOSymLink)(struct IPerlLIO*, const char*,
const char *);
typedef int (*LPLIOReadLink)(struct IPerlLIO*, const char*,
char *, size_t);
struct IPerlLIO
{
LPLIOAccess pAccess;
LPLIOChmod pChmod;
LPLIOChown pChown;
LPLIOChsize pChsize;
LPLIOClose pClose;
LPLIODup pDup;
LPLIODup2 pDup2;
LPLIOFlock pFlock;
LPLIOFileStat pFileStat;
LPLIOIOCtl pIOCtl;
LPLIOIsatty pIsatty;
LPLIOLink pLink;
LPLIOLseek pLseek;
LPLIOLstat pLstat;
LPLIOMktemp pMktemp;
LPLIOOpen pOpen;
LPLIOOpen3 pOpen3;
LPLIORead pRead;
LPLIORename pRename;
LPLIOSetmode pSetmode;
LPLIONameStat pNameStat;
LPLIOTmpnam pTmpnam;
LPLIOUmask pUmask;
LPLIOUnlink pUnlink;
LPLIOUtime pUtime;
LPLIOWrite pWrite;
LPLIOSymLink pSymLink;
LPLIOReadLink pReadLink;
};
struct IPerlLIOInfo
{
unsigned long nCount; /* number of entries expected */
struct IPerlLIO perlLIOList;
};
# define PerlLIO_access(file, mode) \
(*PL_LIO->pAccess)(PL_LIO, (file), (mode))
# define PerlLIO_chmod(file, mode) \
(*PL_LIO->pChmod)(PL_LIO, (file), (mode))
# define PerlLIO_chown(file, owner, group) \
(*PL_LIO->pChown)(PL_LIO, (file), (owner), (group))
# define PerlLIO_chsize(fd, size) \
(*PL_LIO->pChsize)(PL_LIO, (fd), (size))
# define PerlLIO_close(fd) \
(*PL_LIO->pClose)(PL_LIO, (fd))
# define PerlLIO_dup(fd) \
(*PL_LIO->pDup)(PL_LIO, (fd))
# define PerlLIO_dup2(fd1, fd2) \
(*PL_LIO->pDup2)(PL_LIO, (fd1), (fd2))
# define PerlLIO_flock(fd, op) \
(*PL_LIO->pFlock)(PL_LIO, (fd), (op))
# define PerlLIO_fstat(fd, buf) \
(*PL_LIO->pFileStat)(PL_LIO, (fd), (buf))
# define PerlLIO_ioctl(fd, u, buf) \
(*PL_LIO->pIOCtl)(PL_LIO, (fd), (u), (buf))
# define PerlLIO_isatty(fd) \
(*PL_LIO->pIsatty)(PL_LIO, (fd))
# define PerlLIO_link(oldname, newname) \
(*PL_LIO->pLink)(PL_LIO, (oldname), (newname))
# define PerlLIO_symlink(oldname, newname) \
(*PL_LIO->pSymLink)(PL_LIO, (oldname), (newname))
# define PerlLIO_readlink(path, buf, bufsiz) \
(*PL_LIO->pReadLink)(PL_LIO, (path), (buf), (bufsiz))
# define PerlLIO_lseek(fd, offset, mode) \
(*PL_LIO->pLseek)(PL_LIO, (fd), (offset), (mode))
# define PerlLIO_lstat(name, buf) \
(*PL_LIO->pLstat)(PL_LIO, (name), (buf))
# define PerlLIO_mktemp(file) \
(*PL_LIO->pMktemp)(PL_LIO, (file))
# define PerlLIO_open(file, flag) \
(*PL_LIO->pOpen)(PL_LIO, (file), (flag))
# define PerlLIO_open3(file, flag, perm) \
(*PL_LIO->pOpen3)(PL_LIO, (file), (flag), (perm))
# define PerlLIO_read(fd, buf, count) \
(*PL_LIO->pRead)(PL_LIO, (fd), (buf), (count))
# define PerlLIO_rename(oname, newname) \
(*PL_LIO->pRename)(PL_LIO, (oname), (newname))
# define PerlLIO_setmode(fd, mode) \
(*PL_LIO->pSetmode)(PL_LIO, (fd), (mode))
# define PerlLIO_stat(name, buf) \
(*PL_LIO->pNameStat)(PL_LIO, (name), (buf))
# define PerlLIO_tmpnam(str) \
(*PL_LIO->pTmpnam)(PL_LIO, (str))
# define PerlLIO_umask(mode) \
(*PL_LIO->pUmask)(PL_LIO, (mode))
# define PerlLIO_unlink(file) \
(*PL_LIO->pUnlink)(PL_LIO, (file))
# define PerlLIO_utime(file, time) \
(*PL_LIO->pUtime)(PL_LIO, (file), (time))
# define PerlLIO_write(fd, buf, count) \
(*PL_LIO->pWrite)(PL_LIO, (fd), (buf), (count))
#else /* ! PERL_IMPLICIT_SYS */
# define PerlLIO_access(file, mode) access((file), (mode))
# define PerlLIO_chmod(file, mode) chmod((file), (mode))
# define PerlLIO_chown(file, owner, grp) chown((file), (owner), (grp))
# if defined(HAS_TRUNCATE)
# define PerlLIO_chsize(fd, size) ftruncate((fd), (size))
# elif defined(HAS_CHSIZE)
# define PerlLIO_chsize(fd, size) chsize((fd), (size))
# else
# define PerlLIO_chsize(fd, size) my_chsize((fd), (size))
# endif
# define PerlLIO_close(fd) close((fd))
# define PerlLIO_dup(fd) dup((fd))
# define PerlLIO_dup2(fd1, fd2) dup2((fd1), (fd2))
# define PerlLIO_flock(fd, op) FLOCK((fd), (op))
# define PerlLIO_fstat(fd, buf) Fstat((fd), (buf))
# define PerlLIO_ioctl(fd, u, buf) ioctl((fd), (u), (buf))
# define PerlLIO_isatty(fd) isatty((fd))
# define PerlLIO_link(oldname, newname) link((oldname), (newname))
# define PerlLIO_symlink(oldname, newname) symlink((oldname), (newname))
# define PerlLIO_readlink(path, buf, bufsiz) readlink((path), (buf), (bufsiz))
# define PerlLIO_lseek(fd, offset, mode) lseek((fd), (offset), (mode))
# define PerlLIO_stat(name, buf) Stat((name), (buf))
# ifdef HAS_LSTAT
# define PerlLIO_lstat(name, buf) lstat((name), (buf))
# else
# define PerlLIO_lstat(name, buf) PerlLIO_stat((name), (buf))
# endif
# define PerlLIO_mktemp(file) mktemp((file))
# if defined(OEMVS)
# if (__CHARSET_LIB == 1)
int asciiopen(const char* path, int oflag);
int asciiopen3(const char* path, int oflag, int perm);
# define PerlLIO_open(file, flag) asciiopen((file), (flag))
# define PerlLIO_open3(file, flag, perm) asciiopen3((file), (flag), (perm))
# else
# define PerlLIO_open(file, flag) open((file), (flag))
# define PerlLIO_open3(file, flag, perm) open((file), (flag), (perm))
# endif
# else
# define PerlLIO_open(file, flag) open((file), (flag))
# define PerlLIO_open3(file, flag, perm) open((file), (flag), (perm))
# endif
# define PerlLIO_read(fd, buf, count) read((fd), (buf), (count))
# define PerlLIO_rename(old, new) rename((old), (new))
# define PerlLIO_setmode(fd, mode) setmode((fd), (mode))
# define PerlLIO_tmpnam(str) tmpnam((str))
# define PerlLIO_umask(mode) umask((mode))
# define PerlLIO_unlink(file) unlink((file))
# define PerlLIO_utime(file, time) utime((file), (time))
# define PerlLIO_write(fd, buf, count) write((fd), (buf), (count))
#endif /* PERL_IMPLICIT_SYS */
/*
Interface for perl memory allocation
*/
#if defined(PERL_IMPLICIT_SYS)
/* IPerlMem */
struct IPerlMem;
struct IPerlMemInfo;
typedef void* (*LPMemMalloc)(struct IPerlMem*, size_t);
typedef void* (*LPMemRealloc)(struct IPerlMem*, void*, size_t);
typedef void (*LPMemFree)(struct IPerlMem*, void*);
typedef void* (*LPMemCalloc)(struct IPerlMem*, size_t, size_t);
typedef void (*LPMemGetLock)(struct IPerlMem*);
typedef void (*LPMemFreeLock)(struct IPerlMem*);
typedef int (*LPMemIsLocked)(struct IPerlMem*);
struct IPerlMem
{
LPMemMalloc pMalloc;
LPMemRealloc pRealloc;
LPMemFree pFree;
LPMemCalloc pCalloc;
LPMemGetLock pGetLock;
LPMemFreeLock pFreeLock;
LPMemIsLocked pIsLocked;
};
struct IPerlMemInfo
{
unsigned long nCount; /* number of entries expected */
struct IPerlMem perlMemList;
};
/* Interpreter specific memory macros */
# define PerlMem_malloc(size) \
(*PL_Mem->pMalloc)(PL_Mem, (size))
# define PerlMem_realloc(buf, size) \
(*PL_Mem->pRealloc)(PL_Mem, (buf), (size))
# define PerlMem_free(buf) \
(*PL_Mem->pFree)(PL_Mem, (buf))
# define PerlMem_calloc(num, size) \
(*PL_Mem->pCalloc)(PL_Mem, (num), (size))
# define PerlMem_get_lock() \
(*PL_Mem->pGetLock)(PL_Mem)
# define PerlMem_free_lock() \
(*PL_Mem->pFreeLock)(PL_Mem)
# define PerlMem_is_locked() \
(*PL_Mem->pIsLocked)(PL_Mem)
/* Shared memory macros */
# define PerlMemShared_malloc(size) \
(*PL_MemShared->pMalloc)(PL_MemShared, (size))
# define PerlMemShared_realloc(buf, size) \
(*PL_MemShared->pRealloc)(PL_MemShared, (buf), (size))
# define PerlMemShared_free(buf) \
(*PL_MemShared->pFree)(PL_MemShared, (buf))
# define PerlMemShared_calloc(num, size) \
(*PL_MemShared->pCalloc)(PL_MemShared, (num), (size))
# define PerlMemShared_get_lock() \
(*PL_MemShared->pGetLock)(PL_MemShared)
# define PerlMemShared_free_lock() \
(*PL_MemShared->pFreeLock)(PL_MemShared)
# define PerlMemShared_is_locked() \
(*PL_MemShared->pIsLocked)(PL_MemShared)
/* Parse tree memory macros */
# define PerlMemParse_malloc(size) \
(*PL_MemParse->pMalloc)(PL_MemParse, (size))
# define PerlMemParse_realloc(buf, size) \
(*PL_MemParse->pRealloc)(PL_MemParse, (buf), (size))
# define PerlMemParse_free(buf) \
(*PL_MemParse->pFree)(PL_MemParse, (buf))
# define PerlMemParse_calloc(num, size) \
(*PL_MemParse->pCalloc)(PL_MemParse, (num), (size))
# define PerlMemParse_get_lock() \
(*PL_MemParse->pGetLock)(PL_MemParse)
# define PerlMemParse_free_lock() \
(*PL_MemParse->pFreeLock)(PL_MemParse)
# define PerlMemParse_is_locked() \
(*PL_MemParse->pIsLocked)(PL_MemParse)
#else /* ! PERL_IMPLICIT_SYS */
/* Interpreter specific memory macros */
# define PerlMem_malloc(size) malloc((size))
# define PerlMem_realloc(buf, size) realloc((buf), (size))
# define PerlMem_free(buf) free((buf))
# define PerlMem_calloc(num, size) calloc((num), (size))
# define PerlMem_get_lock()
# define PerlMem_free_lock()
# define PerlMem_is_locked() 0
/* Shared memory macros */
# define PerlMemShared_malloc(size) malloc((size))
# define PerlMemShared_realloc(buf, size) realloc((buf), (size))
# define PerlMemShared_free(buf) free((buf))
# define PerlMemShared_calloc(num, size) calloc((num), (size))
# define PerlMemShared_get_lock()
# define PerlMemShared_free_lock()
# define PerlMemShared_is_locked() 0
/* Parse tree memory macros */
# define PerlMemParse_malloc(size) malloc((size))
# define PerlMemParse_realloc(buf, size) realloc((buf), (size))
# define PerlMemParse_free(buf) free((buf))
# define PerlMemParse_calloc(num, size) calloc((num), (size))
# define PerlMemParse_get_lock()
# define PerlMemParse_free_lock()
# define PerlMemParse_is_locked() 0
#endif /* PERL_IMPLICIT_SYS */
/*
Interface for perl process functions
*/
#if defined(PERL_IMPLICIT_SYS)
# ifndef jmp_buf
# include <setjmp.h>
# endif
/* IPerlProc */
struct IPerlProc;
struct IPerlProcInfo;
typedef void (*LPProcAbort)(struct IPerlProc*);
typedef char* (*LPProcCrypt)(struct IPerlProc*, const char*,
const char*);
typedef void (*LPProcExit)(struct IPerlProc*, int)
__attribute__noreturn__;
typedef void (*LPProc_Exit)(struct IPerlProc*, int)
__attribute__noreturn__;
typedef int (*LPProcExecl)(struct IPerlProc*, const char*,
const char*, const char*, const char*,
const char*);
typedef int (*LPProcExecv)(struct IPerlProc*, const char*,
const char*const*);
typedef int (*LPProcExecvp)(struct IPerlProc*, const char*,
const char*const*);
typedef Uid_t (*LPProcGetuid)(struct IPerlProc*);
typedef Uid_t (*LPProcGeteuid)(struct IPerlProc*);
typedef Gid_t (*LPProcGetgid)(struct IPerlProc*);
typedef Gid_t (*LPProcGetegid)(struct IPerlProc*);
typedef char* (*LPProcGetlogin)(struct IPerlProc*);
typedef int (*LPProcKill)(struct IPerlProc*, int, int);
typedef int (*LPProcKillpg)(struct IPerlProc*, int, int);
typedef int (*LPProcPauseProc)(struct IPerlProc*);
typedef PerlIO* (*LPProcPopen)(struct IPerlProc*, const char*,
const char*);
typedef PerlIO* (*LPProcPopenList)(struct IPerlProc*, const char*,
IV narg, SV **args);
typedef int (*LPProcPclose)(struct IPerlProc*, PerlIO*);
typedef int (*LPProcPipe)(struct IPerlProc*, int*);
typedef int (*LPProcSetuid)(struct IPerlProc*, uid_t);
typedef int (*LPProcSetgid)(struct IPerlProc*, gid_t);
typedef int (*LPProcSleep)(struct IPerlProc*, unsigned int);
typedef int (*LPProcTimes)(struct IPerlProc*, struct tms*);
typedef int (*LPProcWait)(struct IPerlProc*, int*);
typedef int (*LPProcWaitpid)(struct IPerlProc*, int, int*, int);
typedef Sighandler_t (*LPProcSignal)(struct IPerlProc*, int, Sighandler_t);
typedef int (*LPProcFork)(struct IPerlProc*);
typedef int (*LPProcGetpid)(struct IPerlProc*);
# ifdef WIN32
typedef void* (*LPProcDynaLoader)(struct IPerlProc*, const char*);
typedef void (*LPProcGetOSError)(struct IPerlProc*,
SV* sv, DWORD dwErr);
typedef int (*LPProcSpawnvp)(struct IPerlProc*, int, const char*,
const char*const*);
# endif
typedef int (*LPProcLastHost)(struct IPerlProc*);
typedef int (*LPProcGetTimeOfDay)(struct IPerlProc*,
struct timeval*, void*);
struct IPerlProc
{
LPProcAbort pAbort;
LPProcCrypt pCrypt;
LPProcExit pExit;
LPProc_Exit p_Exit;
LPProcExecl pExecl;
LPProcExecv pExecv;
LPProcExecvp pExecvp;
LPProcGetuid pGetuid;
LPProcGeteuid pGeteuid;
LPProcGetgid pGetgid;
LPProcGetegid pGetegid;
LPProcGetlogin pGetlogin;
LPProcKill pKill;
LPProcKillpg pKillpg;
LPProcPauseProc pPauseProc;
LPProcPopen pPopen;
LPProcPclose pPclose;
LPProcPipe pPipe;
LPProcSetuid pSetuid;
LPProcSetgid pSetgid;
LPProcSleep pSleep;
LPProcTimes pTimes;
LPProcWait pWait;
LPProcWaitpid pWaitpid;
LPProcSignal pSignal;
LPProcFork pFork;
LPProcGetpid pGetpid;
# ifdef WIN32
LPProcDynaLoader pDynaLoader;
LPProcGetOSError pGetOSError;
LPProcSpawnvp pSpawnvp;
# endif
LPProcLastHost pLastHost;
LPProcPopenList pPopenList;
LPProcGetTimeOfDay pGetTimeOfDay;
};
struct IPerlProcInfo
{
unsigned long nCount; /* number of entries expected */
struct IPerlProc perlProcList;
};
# define PerlProc_abort() \
(*PL_Proc->pAbort)(PL_Proc)
# define PerlProc_crypt(c,s) \
(*PL_Proc->pCrypt)(PL_Proc, (c), (s))
# define PerlProc_exit(s) \
(*PL_Proc->pExit)(PL_Proc, (s))
# define PerlProc__exit(s) \
(*PL_Proc->p_Exit)(PL_Proc, (s))
# define PerlProc_execl(c, w, x, y, z) \
(*PL_Proc->pExecl)(PL_Proc, (c), (w), (x), (y), (z))
# define PerlProc_execv(c, a) \
(*PL_Proc->pExecv)(PL_Proc, (c), (a))
# define PerlProc_execvp(c, a) \
(*PL_Proc->pExecvp)(PL_Proc, (c), (a))
# define PerlProc_getuid() \
(*PL_Proc->pGetuid)(PL_Proc)
# define PerlProc_geteuid() \
(*PL_Proc->pGeteuid)(PL_Proc)
# define PerlProc_getgid() \
(*PL_Proc->pGetgid)(PL_Proc)
# define PerlProc_getegid() \
(*PL_Proc->pGetegid)(PL_Proc)
# define PerlProc_getlogin() \
(*PL_Proc->pGetlogin)(PL_Proc)
# define PerlProc_kill(i, a) \
(*PL_Proc->pKill)(PL_Proc, (i), (a))
# define PerlProc_killpg(i, a) \
(*PL_Proc->pKillpg)(PL_Proc, (i), (a))
# define PerlProc_pause() \
(*PL_Proc->pPauseProc)(PL_Proc)
# define PerlProc_popen(c, m) \
(*PL_Proc->pPopen)(PL_Proc, (c), (m))
# define PerlProc_popen_list(m, n, a) \
(*PL_Proc->pPopenList)(PL_Proc, (m), (n), (a))
# define PerlProc_pclose(f) \
(*PL_Proc->pPclose)(PL_Proc, (f))
# define PerlProc_pipe(fd) \
(*PL_Proc->pPipe)(PL_Proc, (fd))
# define PerlProc_setuid(u) \
(*PL_Proc->pSetuid)(PL_Proc, (u))
# define PerlProc_setgid(g) \
(*PL_Proc->pSetgid)(PL_Proc, (g))
# define PerlProc_sleep(t) \
(*PL_Proc->pSleep)(PL_Proc, (t))
# define PerlProc_times(t) \
(*PL_Proc->pTimes)(PL_Proc, (t))
# define PerlProc_wait(t) \
(*PL_Proc->pWait)(PL_Proc, (t))
# define PerlProc_waitpid(p,s,f) \
(*PL_Proc->pWaitpid)(PL_Proc, (p), (s), (f))
# define PerlProc_signal(n, h) \
(*PL_Proc->pSignal)(PL_Proc, (n), (h))
# define PerlProc_fork() \
(*PL_Proc->pFork)(PL_Proc)
# define PerlProc_getpid() \
(*PL_Proc->pGetpid)(PL_Proc)
# define PerlProc_setjmp(b, n) Sigsetjmp((b), (n))
# define PerlProc_longjmp(b, n) Siglongjmp((b), (n))
# ifdef WIN32
# define PerlProc_DynaLoad(f) \
(*PL_Proc->pDynaLoader)(PL_Proc, (f))
# define PerlProc_GetOSError(s,e) \
(*PL_Proc->pGetOSError)(PL_Proc, (s), (e))
# define PerlProc_spawnvp(m, c, a) \
(*PL_Proc->pSpawnvp)(PL_Proc, (m), (c), (a))
# endif
# define PerlProc_lasthost() \
(*PL_Proc->pLastHost)(PL_Proc)
# define PerlProc_gettimeofday(t,z) \
(*PL_Proc->pGetTimeOfDay)(PL_Proc,(t),(z))
#else /* ! PERL_IMPLICIT_SYS */
# define PerlProc_abort() abort()
# define PerlProc_crypt(c,s) crypt((c), (s))
# define PerlProc_exit(s) exit((s))
# define PerlProc__exit(s) _exit((s))
# define PerlProc_execl(c,w,x,y,z) \
execl((c), (w), (x), (y), (z))
# define PerlProc_execv(c, a) execv((c), (a))
# define PerlProc_execvp(c, a) execvp((c), (a))
# define PerlProc_getuid() getuid()
# define PerlProc_geteuid() geteuid()
# define PerlProc_getgid() getgid()
# define PerlProc_getegid() getegid()
# define PerlProc_getlogin() getlogin()
# define PerlProc_kill(i, a) kill((i), (a))
# define PerlProc_killpg(i, a) killpg((i), (a))
# define PerlProc_pause() Pause()
# define PerlProc_popen(c, m) my_popen((c), (m))
# define PerlProc_popen_list(m,n,a) my_popen_list((m),(n),(a))
# define PerlProc_pclose(f) my_pclose((f))
# define PerlProc_pipe(fd) pipe((fd))
# define PerlProc_setuid(u) setuid((u))
# define PerlProc_setgid(g) setgid((g))
# define PerlProc_sleep(t) sleep((t))
# define PerlProc_times(t) times((t))
# define PerlProc_wait(t) wait((t))
# define PerlProc_waitpid(p,s,f) waitpid((p), (s), (f))
# define PerlProc_setjmp(b, n) Sigsetjmp((b), (n))
# define PerlProc_longjmp(b, n)Siglongjmp((b), (n))
# define PerlProc_signal(n, h) signal((n), (h))
# define PerlProc_fork() my_fork()
# define PerlProc_getpid() getpid()
# define PerlProc_gettimeofday(t,z) gettimeofday((t),(z))
# ifdef WIN32
# define PerlProc_DynaLoad(f) \
win32_dynaload((f))
# define PerlProc_GetOSError(s,e) \
win32_str_os_error((s), (e))
# define PerlProc_spawnvp(m, c, a) \
win32_spawnvp((m), (c), (a))
# undef PerlProc_signal
# define PerlProc_signal(n, h) win32_signal((n), (h))
# endif
#endif /* PERL_IMPLICIT_SYS */
/*
Interface for perl socket functions
*/
#if defined(PERL_IMPLICIT_SYS)
/* PerlSock */
struct IPerlSock;
struct IPerlSockInfo;
typedef u_long (*LPHtonl)(struct IPerlSock*, u_long);
typedef u_short (*LPHtons)(struct IPerlSock*, u_short);
typedef u_long (*LPNtohl)(struct IPerlSock*, u_long);
typedef u_short (*LPNtohs)(struct IPerlSock*, u_short);
typedef SOCKET (*LPAccept)(struct IPerlSock*, SOCKET,
struct sockaddr*, int*);
typedef int (*LPBind)(struct IPerlSock*, SOCKET,
const struct sockaddr*, int);
typedef int (*LPConnect)(struct IPerlSock*, SOCKET,
const struct sockaddr*, int);
typedef void (*LPEndhostent)(struct IPerlSock*);
typedef void (*LPEndnetent)(struct IPerlSock*);
typedef void (*LPEndprotoent)(struct IPerlSock*);
typedef void (*LPEndservent)(struct IPerlSock*);
typedef int (*LPGethostname)(struct IPerlSock*, char*, int);
typedef int (*LPGetpeername)(struct IPerlSock*, SOCKET,
struct sockaddr*, int*);
typedef struct hostent* (*LPGethostbyaddr)(struct IPerlSock*, const char*,
int, int);
typedef struct hostent* (*LPGethostbyname)(struct IPerlSock*, const char*);
typedef struct hostent* (*LPGethostent)(struct IPerlSock*);
typedef struct netent* (*LPGetnetbyaddr)(struct IPerlSock*, long, int);
typedef struct netent* (*LPGetnetbyname)(struct IPerlSock*, const char*);
typedef struct netent* (*LPGetnetent)(struct IPerlSock*);
typedef struct protoent*(*LPGetprotobyname)(struct IPerlSock*, const char*);
typedef struct protoent*(*LPGetprotobynumber)(struct IPerlSock*, int);
typedef struct protoent*(*LPGetprotoent)(struct IPerlSock*);
typedef struct servent* (*LPGetservbyname)(struct IPerlSock*, const char*,
const char*);
typedef struct servent* (*LPGetservbyport)(struct IPerlSock*, int,
const char*);
typedef struct servent* (*LPGetservent)(struct IPerlSock*);
typedef int (*LPGetsockname)(struct IPerlSock*, SOCKET,
struct sockaddr*, int*);
typedef int (*LPGetsockopt)(struct IPerlSock*, SOCKET, int, int,
char*, int*);
typedef unsigned long (*LPInetAddr)(struct IPerlSock*, const char*);
typedef char* (*LPInetNtoa)(struct IPerlSock*, struct in_addr);
typedef int (*LPListen)(struct IPerlSock*, SOCKET, int);
typedef int (*LPRecv)(struct IPerlSock*, SOCKET, char*, int, int);
typedef int (*LPRecvfrom)(struct IPerlSock*, SOCKET, char*, int,
int, struct sockaddr*, int*);
typedef int (*LPSelect)(struct IPerlSock*, int, char*, char*,
char*, const struct timeval*);
typedef int (*LPSend)(struct IPerlSock*, SOCKET, const char*, int,
int);
typedef int (*LPSendto)(struct IPerlSock*, SOCKET, const char*,
int, int, const struct sockaddr*, int);
typedef void (*LPSethostent)(struct IPerlSock*, int);
typedef void (*LPSetnetent)(struct IPerlSock*, int);
typedef void (*LPSetprotoent)(struct IPerlSock*, int);
typedef void (*LPSetservent)(struct IPerlSock*, int);
typedef int (*LPSetsockopt)(struct IPerlSock*, SOCKET, int, int,
const char*, int);
typedef int (*LPShutdown)(struct IPerlSock*, SOCKET, int);
typedef SOCKET (*LPSocket)(struct IPerlSock*, int, int, int);
typedef int (*LPSocketpair)(struct IPerlSock*, int, int, int,
int*);
# ifdef WIN32
typedef int (*LPClosesocket)(struct IPerlSock*, SOCKET s);
# endif
struct IPerlSock
{
LPHtonl pHtonl;
LPHtons pHtons;
LPNtohl pNtohl;
LPNtohs pNtohs;
LPAccept pAccept;
LPBind pBind;
LPConnect pConnect;
LPEndhostent pEndhostent;
LPEndnetent pEndnetent;
LPEndprotoent pEndprotoent;
LPEndservent pEndservent;
LPGethostname pGethostname;
LPGetpeername pGetpeername;
LPGethostbyaddr pGethostbyaddr;
LPGethostbyname pGethostbyname;
LPGethostent pGethostent;
LPGetnetbyaddr pGetnetbyaddr;
LPGetnetbyname pGetnetbyname;
LPGetnetent pGetnetent;
LPGetprotobyname pGetprotobyname;
LPGetprotobynumber pGetprotobynumber;
LPGetprotoent pGetprotoent;
LPGetservbyname pGetservbyname;
LPGetservbyport pGetservbyport;
LPGetservent pGetservent;
LPGetsockname pGetsockname;
LPGetsockopt pGetsockopt;
LPInetAddr pInetAddr;
LPInetNtoa pInetNtoa;
LPListen pListen;
LPRecv pRecv;
LPRecvfrom pRecvfrom;
LPSelect pSelect;
LPSend pSend;
LPSendto pSendto;
LPSethostent pSethostent;
LPSetnetent pSetnetent;
LPSetprotoent pSetprotoent;
LPSetservent pSetservent;
LPSetsockopt pSetsockopt;
LPShutdown pShutdown;
LPSocket pSocket;
LPSocketpair pSocketpair;
# ifdef WIN32
LPClosesocket pClosesocket;
# endif
};
struct IPerlSockInfo
{
unsigned long nCount; /* number of entries expected */
struct IPerlSock perlSockList;
};
# define PerlSock_htonl(x) \
(*PL_Sock->pHtonl)(PL_Sock, x)
# define PerlSock_htons(x) \
(*PL_Sock->pHtons)(PL_Sock, x)
# define PerlSock_ntohl(x) \
(*PL_Sock->pNtohl)(PL_Sock, x)
# define PerlSock_ntohs(x) \
(*PL_Sock->pNtohs)(PL_Sock, x)
# define PerlSock_accept(s, a, l) \
(*PL_Sock->pAccept)(PL_Sock, s, a, l)
# define PerlSock_bind(s, n, l) \
(*PL_Sock->pBind)(PL_Sock, s, n, l)
# define PerlSock_connect(s, n, l) \
(*PL_Sock->pConnect)(PL_Sock, s, n, l)
# define PerlSock_endhostent() \
(*PL_Sock->pEndhostent)(PL_Sock)
# define PerlSock_endnetent() \
(*PL_Sock->pEndnetent)(PL_Sock)
# define PerlSock_endprotoent() \
(*PL_Sock->pEndprotoent)(PL_Sock)
# define PerlSock_endservent() \
(*PL_Sock->pEndservent)(PL_Sock)
# define PerlSock_gethostbyaddr(a, l, t) \
(*PL_Sock->pGethostbyaddr)(PL_Sock, a, l, t)
# define PerlSock_gethostbyname(n) \
(*PL_Sock->pGethostbyname)(PL_Sock, n)
# define PerlSock_gethostent() \
(*PL_Sock->pGethostent)(PL_Sock)
# define PerlSock_gethostname(n, l) \
(*PL_Sock->pGethostname)(PL_Sock, n, l)
# define PerlSock_getnetbyaddr(n, t) \
(*PL_Sock->pGetnetbyaddr)(PL_Sock, n, t)
# define PerlSock_getnetbyname(c) \
(*PL_Sock->pGetnetbyname)(PL_Sock, c)
# define PerlSock_getnetent() \
(*PL_Sock->pGetnetent)(PL_Sock)
# define PerlSock_getpeername(s, n, l) \
(*PL_Sock->pGetpeername)(PL_Sock, s, n, l)
# define PerlSock_getprotobyname(n) \
(*PL_Sock->pGetprotobyname)(PL_Sock, n)
# define PerlSock_getprotobynumber(n) \
(*PL_Sock->pGetprotobynumber)(PL_Sock, n)
# define PerlSock_getprotoent() \
(*PL_Sock->pGetprotoent)(PL_Sock)
# define PerlSock_getservbyname(n, p) \
(*PL_Sock->pGetservbyname)(PL_Sock, n, p)
# define PerlSock_getservbyport(port, p) \
(*PL_Sock->pGetservbyport)(PL_Sock, port, p)
# define PerlSock_getservent() \
(*PL_Sock->pGetservent)(PL_Sock)
# define PerlSock_getsockname(s, n, l) \
(*PL_Sock->pGetsockname)(PL_Sock, s, n, l)
# define PerlSock_getsockopt(s,l,n,v,i) \
(*PL_Sock->pGetsockopt)(PL_Sock, s, l, n, v, i)
# define PerlSock_inet_addr(c) \
(*PL_Sock->pInetAddr)(PL_Sock, c)
# define PerlSock_inet_ntoa(i) \
(*PL_Sock->pInetNtoa)(PL_Sock, i)
# define PerlSock_listen(s, b) \
(*PL_Sock->pListen)(PL_Sock, s, b)
# define PerlSock_recv(s, b, l, f) \
(*PL_Sock->pRecv)(PL_Sock, s, b, l, f)
# define PerlSock_recvfrom(s,b,l,f,from,fromlen) \
(*PL_Sock->pRecvfrom)(PL_Sock, s, b, l, f, from, fromlen)
# define PerlSock_select(n, r, w, e, t) \
(*PL_Sock->pSelect)(PL_Sock, n, (char*)r, (char*)w, (char*)e, t)
# define PerlSock_send(s, b, l, f) \
(*PL_Sock->pSend)(PL_Sock, s, b, l, f)
# define PerlSock_sendto(s, b, l, f, t, tlen) \
(*PL_Sock->pSendto)(PL_Sock, s, b, l, f, t, tlen)
# define PerlSock_sethostent(f) \
(*PL_Sock->pSethostent)(PL_Sock, f)
# define PerlSock_setnetent(f) \
(*PL_Sock->pSetnetent)(PL_Sock, f)
# define PerlSock_setprotoent(f) \
(*PL_Sock->pSetprotoent)(PL_Sock, f)
# define PerlSock_setservent(f) \
(*PL_Sock->pSetservent)(PL_Sock, f)
# define PerlSock_setsockopt(s, l, n, v, len) \
(*PL_Sock->pSetsockopt)(PL_Sock, s, l, n, v, len)
# define PerlSock_shutdown(s, h) \
(*PL_Sock->pShutdown)(PL_Sock, s, h)
# define PerlSock_socket(a, t, p) \
(*PL_Sock->pSocket)(PL_Sock, a, t, p)
# define PerlSock_socketpair(a, t, p, f) \
(*PL_Sock->pSocketpair)(PL_Sock, a, t, p, f)
# ifdef WIN32
# define PerlSock_closesocket(s) \
(*PL_Sock->pClosesocket)(PL_Sock, s)
# endif
#else /* ! PERL_IMPLICIT_SYS below */
# define PerlSock_htonl(x) htonl(x)
# define PerlSock_htons(x) htons(x)
# define PerlSock_ntohl(x) ntohl(x)
# define PerlSock_ntohs(x) ntohs(x)
# define PerlSock_accept(s, a, l) accept(s, a, l)
# define PerlSock_bind(s, n, l) bind(s, n, l)
# define PerlSock_connect(s, n, l) connect(s, n, l)
# define PerlSock_gethostbyaddr(a, l, t) gethostbyaddr(a, l, t)
# define PerlSock_gethostbyname(n) gethostbyname(n)
# define PerlSock_gethostent gethostent
# define PerlSock_endhostent endhostent
# define PerlSock_gethostname(n, l) gethostname(n, l)
# define PerlSock_getnetbyaddr(n, t) getnetbyaddr(n, t)
# define PerlSock_getnetbyname(n) getnetbyname(n)
# define PerlSock_getnetent getnetent
# define PerlSock_endnetent endnetent
# define PerlSock_getpeername(s, n, l) getpeername(s, n, l)
# define PerlSock_getprotobyname(n) getprotobyname(n)
# define PerlSock_getprotobynumber(n) getprotobynumber(n)
# define PerlSock_getprotoent getprotoent
# define PerlSock_endprotoent endprotoent
# define PerlSock_getservbyname(n, p) getservbyname(n, p)
# define PerlSock_getservbyport(port, p) getservbyport(port, p)
# define PerlSock_getservent getservent
# define PerlSock_endservent endservent
# define PerlSock_getsockname(s, n, l) getsockname(s, n, l)
# define PerlSock_getsockopt(s,l,n,v,i) getsockopt(s, l, n, v, i)
# define PerlSock_inet_addr(c) inet_addr(c)
# define PerlSock_inet_ntoa(i) inet_ntoa(i)
# define PerlSock_listen(s, b) listen(s, b)
# define PerlSock_recv(s, b, l, f) recv(s, b, l, f)
# define PerlSock_recvfrom(s, b, l, f, from, fromlen) \
recvfrom(s, b, l, f, from, fromlen)
# define PerlSock_select(n, r, w, e, t) select(n, r, w, e, t)
# define PerlSock_send(s, b, l, f) send(s, b, l, f)
# define PerlSock_sendto(s, b, l, f, t, tlen) \
sendto(s, b, l, f, t, tlen)
# define PerlSock_sethostent(f) sethostent(f)
# define PerlSock_setnetent(f) setnetent(f)
# define PerlSock_setprotoent(f) setprotoent(f)
# define PerlSock_setservent(f) setservent(f)
# define PerlSock_setsockopt(s, l, n, v, len) \
setsockopt(s, l, n, v, len)
# define PerlSock_shutdown(s, h) shutdown(s, h)
# define PerlSock_socket(a, t, p) socket(a, t, p)
# define PerlSock_socketpair(a, t, p, f) socketpair(a, t, p, f)
# ifdef WIN32
# define PerlSock_closesocket(s) closesocket(s)
# endif
#endif /* PERL_IMPLICIT_SYS */
#endif /* __Inc__IPerl___ */
/*
* ex: set ts=8 sts=4 sw=4 et:
*/
```
|
Amira Kiziamina, known better by his stage name Kalash Criminel, is a French rapper. He is albino and chooses to wear a balaclava, because when his musical activities began, he had to hide his face as his mother did not want him to rap. However, he received positive reactions for wearing the balaclava, and now wears it by choice. He is signed to Def Jam Recordings and Universal Music. He collaborates often with Kaaris, with whom he notably made the song "Arrêt du Cœur" on his album R.A.S.
Biography
Kalash Criminel was born in Zaïre, now known as the Democratic Republic of the Congo on 14 February 1995. Initially, he lived in Kinshasa with his family, but with the onset of the First Congo War, he and his family fled to France. He and his family arrived in Rougemont, in Sevran and have been living there since. In his youth, he began to rap, initially becoming a part of the group Hall 14 with the rappers Daystiil, Kifa, Krimo JS et Zino5. This group was later signed to the label 10/12 Records. In 2012, they released a demo, titled Traumatiser, which solidified their collaboration and work.
In 2015, Kiziamina began his solo career and released the song "10 12 14 Bureau", and subsequently released a series of freestyles titled Sauvagerie. He subsequently collaborated with rappers Ixzo, Sofiane, Kaaris et JUL.
His collaboration with Kaaris yielded the song "Arrêt du cœur" which guaranteed and launched his career in French rap. On 23 September 2016, he released his first music video titled "Sale Sonorité". This video has in excess of 10 million views on YouTube. On 26 September 2016, he announced the release of his first mixtape, titled R.A.S., which was slated for release on 28 October 2016. In its first week, R.A.S sold 2,970 copies.
On 23 November 2018, Kiziamina released his first studio album, La Fosse aux lions, under his label, Sale sonorité Records. Response was favourable, with 13,388 copies sold in the first week.
Discography
Mixtapes
Singles
*Did not appear in the official Belgian Ultratop 50 charts, but rather in the bubbling under Ultratip charts.
Other charted songs
*Did not appear in the official Belgian Ultratop 50 charts, but rather in the bubbling under Ultratip charts.
Featured in
*Did not appear in the official Belgian Ultratop 50 charts, but rather in the bubbling under Ultratip charts.
References
Living people
Black French musicians
French people of Democratic Republic of the Congo descent
French rappers
People with albinism
Rappers from Seine-Saint-Denis
Year of birth missing (living people)
|
Padre Dámaso Verdolagas is a fictional character in the novel Noli Me Tángere. The novel was written by José Rizal, one of the leaders of the Propaganda Movement in the Philippines. Noli Me Tángere (Touch Me Not or "Social Cancer") is a controversial and anticlerical novel that exposed the abuses committed by the Spanish friars (belonging to the Roman Catholic Church) and the Spanish elite in colonial Philippines during the 19th century.
The novel, according to the author, represented the state of Philippine society under Spanish colonial rule. It was intended as a liberal-nationalist wake-up call for the people of the Philippines. While the natives (indios) were trained to become secular clergy, Spanish priests in the powerful religious orders were given preferential treatment in the assignment to parishes.
Character summary
Dámaso Verdolagas, a Franciscan Spanish priest, was the former curate of the town of San Diego. He was an enemy of Don Rafael Ibarra, Crisóstomo Ibarra's father; Don Rafael refuses to conform to the friars' power. After Don Rafael's death in jail, Padre Dámaso ordered his corpse exhumed and transferred to the Chinese cemetery, which he considered was for heathens. He was later revealed to be the biological father of María Clara. María Clara's mother, Doña Pía Alba, and Don Santiago de los Santos had been trying to conceive a child when Padre Dámaso raped Doña Pia.
Near the end of the novel, he and María Clara had a dispute about her not marrying Alfonso Linares, and her going to the convent or dying. This broke Padre Dámaso's heart. By the end of the novel, he was transferred to another town to be its curate. He was later found dead due to unknown causes, possibly depression or hypertension.
Legacy
Padre Dámaso was portrayed in the following films and television series:
Oscar Keesee - Noli Me Tángere (1961)
Subas Herrero in the ABC television series Noli Me Tángere (1992)
Cristóbal Gómez - José Rizal (1998)
Arnell Ignacio - Damaso (2019)
Tirso Cruz III - Maria Clara at Ibarra (2022-2023)
The Tagalog term "anak ni Padre Dámaso" ("child of Father Dámaso") has become a stereotype or cliché in the Philippines to refer to a white or half-white (Spanish: mestizo) child whose father is unknown. It can also refer to a child whose father was (or who was suspected to be) a Spanish clergyman.
Filipino tour guide and cultural activist Carlos Celdran was arrested for shouting and bearing a sign with the word "Dámaso" at the Manila Cathedral during an ecumenical service, to protest the bishops' stance against abortion and contraception on September 30, 2010.
References
Fictional Spanish people
Fictional priests and priestesses
Noli Me Tangere (novel) characters
Literary characters introduced in 1887
|
In fluid dynamics, wave setup is the increase in mean water level due to the presence of breaking waves. Similarly, wave setdown is a wave-induced decrease of the mean water level before the waves break (during the shoaling process). For short, the whole phenomenon is often denoted as wave setup, including both increase and decrease of mean elevation. This setup is primarily present in and near the coastal surf zone. Besides a spatial variation in the (mean) wave setup, also a variation in time may be present – known as surf beat – causing infragravity wave radiation.
Wave setup can be mathematically modeled by considering the variation in radiation stress. Radiation stress is the tensor of excess horizontal-momentum fluxes due to the presence of the waves.
In and near the coastal surf zone
As a progressive wave approaches shore and the water depth decreases, the wave height increases due to wave shoaling. As a result, there is additional wave-induced flux of horizontal momentum. The horizontal momentum equations of the mean flow requires this additional wave-induced flux to be balanced: this causes a decrease in the mean water level before the waves break, called a "setdown".
After the waves break, the wave energy flux is no longer constant, but decreasing due to energy dissipation. The radiation stress therefore decreases after the break point, causing a free surface level increase to balance: wave setup. Both of the above descriptions are specifically for beaches with mild bed slope.
Wave setup is particularly of concern during storm events, when the effects of big waves generated by wind from the storm are able to increase the mean sea level (by wave setup), enhancing the risks of damage to coastal infrastructure.
Wave setup value
The radiation stress pushes the water towards the coast, and is then pushed up, causing an increase in the water level. At a given moment, that increase is such
that its hydrostratic pressure is equal to the radiation stress. From this equilibrium the wave setup can be calculated. The maximum increase in water level is then:
where Hb is the wave height at the breaker line and γ is the breaker index (wave height/water depth ratio at breaking for individual waves, usually γ = 0.7 - 0.8). Incidentally, due to this phenomenon, a small reduction in water level occurs just seaward of the breaker line, in the order of 20% of the wave set-up.
The wave setup at ocean beaches can be significant. For example, a wave with a height of 5 m (on deep water) and a period of 12 s, at perpendicular incidence and γ = 0.7, gives a wave setup of 1.2 m.
Current due to wave setup
Wave setup can lead to considerable currents along the coast. In the accompanying figure, a harbour is drawn with waves that come perpendicular to the coast. At point A, the breaking of the waves causes a water level increase. Suppose it is 1.2 m as in the example above. At point B in the harbour (suppose that is approx. 500 m from point A) there are few breaking waves due to the protection of the breakwater (there is a small amount of wave action due to diffraction).
Suppose that the wave setup at this point is only 0.2 m. Then there is a water level difference of 1 m over those 500 m, so a gradient of 0.002. If this is filled in e.g. the formula of Chézy it gives:
m/s.
This speed is not negligible, and also results in a large sand transport into the harbour. A harbour with a shape like the one outlined here is usually built this way because the predominant wave direction here comes from the left. Along this coast there is then a wave induced sediment transport from left to right, and based on this it is expected that siltation will occur on the left side of the harbour and erosion on the right side of the harbor (so from A further to the right). Based on standard longshore transport calculations, no siltation is therefore expected at this port. However, the current due to wave setup can in this case indeed cause sedimentation.
Note
Wave setup should not be confused with wave run-up (the rising of the tongue of a wave on a slope) or with wind setup (surge, raising of the water level at the coast due to wind pressure).
See also
Coastal flooding
References
Physical oceanography
Water waves
|
Glenn Bell is a former Scotland international rugby league footballer who played in the 1980s and 1990s. He played at club level for Featherstone Rovers (Heritage № 660), Dewsbury Rams and Doncaster (Heritage № 769), as a , or .
Background
Bell was born in New Zealand. He is of Scottish descent.
Playing career
Bell played for the Manukau Magpies, and is a member of the wider Bell family. He Played in England for a large majority of his career but he made a name for himself playing for various Auckland semi professional club sides. Glenn was a very respected player known for his defensive efforts.
Representative career
He won a cap for Scotland while at Dewsbury Rams in 1997 against France.
County Cup Final appearances
Glenn Bell played right-, i.e. number 10, (replaced by interchange/substitute Alan Dakin) in Featherstone Rovers' 14-20 defeat by Bradford Northern in the 1989–90 Yorkshire County Cup Final during the 1989–90 season at Headingley Rugby Stadium, Leeds on Sunday 5 November 1989.
References
1965 births
Living people
Dewsbury Rams players
Doncaster R.L.F.C. players
Featherstone Rovers players
Manukau Magpies players
New Zealand people of Scottish descent
New Zealand expatriate sportspeople in England
New Zealand rugby league players
Place of birth missing (living people)
Rugby league props
Rugby league second-rows
Scotland national rugby league team players
|
```shell
Quick `cd` tips
Repeating commands with `watch`
Execute a command without saving it in history
Aliasing ssh connections
Keep useful commands in your shell history with tags
```
|
The Southeast University-Monash University Joint Graduate School () is a postgraduate and research university in Suzhou, Jiangsu province, China. The school is situated in the Suzhou Dushu Lake Higher Education Town. It is a joint venture between the Australia-based Monash University and Southeast University (simplified Chinese: 东南大学) in Nanjing. It is the first joint graduate school in China. It consists of both a Joint Graduate School and a Joint Research Institute.
History
Australian universities, including Monash, had for many years sought to establish a physical presence in China. Although it had some teaching and research cooperation with Fudan, Nanjing, Shanghai and Beijing universities, Monash lacked the regulatory approval to operate as a fully fledged university. In 2006, it signed an agreement with Sichuan University, which promised to greatly enlarge the Monash presence in China. In May 2008, the region suffered a major earthquake. This led the region to devote its resources to on its internal recovery, with less scope for international university partnerships.
Australian universities continued to seek collaborations with and campuses in China. In 2011, it was reported that 25 Australian universities had had their applications for licences rejected in that year alone.
In April 2012, it was announced that Monash University had won a full licence to operate as a university in China. The announcement followed several years of cooperation between the two universities and many months of negotiations with the Chinese Ministry of Education.
This was the third time that a university had been granted a licence to operate in China and the first graduate school. The University of Nottingham and the University of Liverpool are the other two foreign universities, although it is widely thought that Duke University and New York University are likely to be granted licences soon.
The main University building was completed in late 2012, as it accepted its first intake of students.
Location
The School is located in Jiangsu province in the Suzhou Industrial Park(simplified Chinese: 中国—新加坡苏州工业园区; traditional Chinese: 中國—新加坡蘇州工業園區). More specifically, it is situated within the Dushu Lake Education Innovation Park.
The Park is home to several thousand foreign companies and research institutes. The School is around 25 minutes by train to Shanghai. The campus is 50 000 square metres, based in an eleven storey, purpose-built facility.
Teaching and research
The School accepts 350 Master's students and 150 PhD students per year. Its student population will grow in coming years, but is expected to be limited to 2000.
The Master's programs are in IT, business, science, engineering, health, humanities and design. The Research Institute offers PhDs in biological engineering, clean energy, drug discovery, economics, food engineering, industrial design, IT, nanotechnology, public health, stem cells, transportation and water.
Classes are conducted in English and students graduate with a degree from both Monash and Southeast University.
References
External links
Southeast University-Monash University Joint Graduate School (Suzhou) - Monash University
Southeast University-Monash University Joint Graduate School (Suzhou) - Southeast University
Industry Design | Southeast University-Monash University Joint Graduate School
Monash University
Southeast University
Universities and colleges in Suzhou
Suzhou Industrial Park
|
New York's 12th State Assembly district is one of the 150 districts in the New York State Assembly. It has been represented by Republican Keith Brown since 2021.
Geography
District 12 is in Suffolk County. It encompasses portions of the towns of Babylon, Huntington, and Islip.
Recent election results
2022
2020
2018
2016
2014
2012
References
12
Suffolk County, New York
|
Sedum villosum, known as the hairy stonecrop or purple stonecrop, is a biennial to perennial flowering plant. Its leaves, which are long and may be reddish in colour, are generally covered with hairs, although S. villosum var. glabratum may have hairless leaves. Individual flowers have five pink petals, each up to long.
It is native to Greenland, Iceland and northern and central Europe, east to Lithuania and Poland. It has also been recorded from islands in south-eastern Canada. Within Britain, it is found as far south as mid-Yorkshire. Compared to other species in the genus Sedum, it is unusual in preferring damp habitats.
References
villosum
|
```asciidoc
## Examples of Cloud Events with Spring via RSocket and Apache Kafka
### Introduction
The current example uses spring-cloud-function framework as its core which allows users to only worry about functional aspects of
their requirement while taking care-off non-functional aspects. For more information on Spring Cloud Function please visit
our path_to_url page].
The example consists of a Spring boot configuration class
path_to_url
which contains a sample function which you can interact with following via RSocket and Apache Kafka.
### From RSocket to Apache Kafka
While very similar to path_to_url example
there are few interesting variants here worth discussing.
Here were introducing a different delivery mechanism. But what really makes it even more interesting is the fact that unlike Apache Kafka or AMQP there is no protocol
binding defined for RSocket. So we will communicate Cloud Event in a structured-mode where the entire event is encoded into some type of structure (e.g., JSON).
Few implementation details are also defer in this example from the others. However these details are not relevant in any way to Cloud Event, rather
demonstration of other mechanisms you may chose to write your code. For example well be using `Consumer` instead of a `Function` and will be manually
sending an output message using `StreamBridge` component provided by Spring Cloud Stream framework.
So, here is our application code
```
@Bean
public Consumer<Person> hire(StreamBridge streamBridge) {
return person -> {
Employee employee = new Employee(person);
streamBridge.send("hire-out-0", CloudEventMessageBuilder.withData(employee)
.setSource("path_to_url")
.setId("1234567890")
.build());
};
}
```
Note how were utiliziing CloudEventMessageBuilder to generate output Message as Cloud Event.
What we will be sending over RSocket is structured representation of Cloud Event:
```
String payload = "{\n" +
" \"specversion\" : \"1.0\",\n" +
" \"type\" : \"org.springframework\",\n" +
" \"source\" : \"path_to_url",\n" +
" \"id\" : \"A234-1234-1234\",\n" +
" \"datacontenttype\" : \"application/json\",\n" +
" \"data\" : {\n" +
" \"firstName\" : \"John\",\n" +
" \"lastName\" : \"Doe\"\n" +
" }\n" +
"}";
```
So, the entire Cloud Event is represented as JSON sent over RSocket to the hire() function.
```
rsocketRequesterBuilder.tcp("localhost", 55555)
.route("hire") // target function
.data(payload). // data we're sending
.send()
```
You can run the demo using path_to_url
```
|
```c++
// your_sha256_hash------------
// - Open3D: www.open3d.org -
// your_sha256_hash------------
// your_sha256_hash------------
#include "open3d/core/kernel/IndexReduction.h"
#include "open3d/utility/Logging.h"
namespace open3d {
namespace core {
namespace kernel {
void IndexAdd_(int64_t dim,
const Tensor& index,
const Tensor& src,
Tensor& dst) {
// Permute the reduction dimension to the first.
SizeVector permute = {};
for (int64_t d = 0; d <= dim; ++d) {
if (d == 0) {
permute.push_back(dim);
} else {
permute.push_back(d - 1);
}
}
for (int64_t d = dim + 1; d < src.NumDims(); ++d) {
permute.push_back(d);
}
auto src_permute = src.Permute(permute);
auto dst_permute = dst.Permute(permute);
if (dst.IsCPU()) {
IndexAddCPU_(dim, index, src_permute, dst_permute);
} else if (dst.IsCUDA()) {
#ifdef BUILD_CUDA_MODULE
IndexAddCUDA_(dim, index, src_permute, dst_permute);
#endif
} else {
utility::LogError("IndexAdd_: Unimplemented device");
}
}
} // namespace kernel
} // namespace core
} // namespace open3d
```
|
```xml
Version 2.0, January 2004
path_to_url
TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
1. Definitions.
"Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
"Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files.
"Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types.
"Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution."
"Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work.
4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions:
(b) You must cause any modified files to carry prominent notices stating that You changed the files; and
(c) You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and
END OF TERMS AND CONDITIONS
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.
--><LWM2M xmlns:xsi="path_to_url" xsi:noNamespaceSchemaLocation="path_to_url">
<Object ObjectType="MODefinition">
<Name>plmnSearchEvent</Name>
<Description1><![CDATA[List of all PLMNs found during the initial search/scan]]></Description1>
<ObjectID>3352</ObjectID>
<ObjectURN>urn:oma:lwm2m:ext:3352</ObjectURN>
<LWM2MVersion>1.0</LWM2MVersion>
<ObjectVersion>1.0</ObjectVersion>
<MultipleInstances>Multiple</MultipleInstances>
<Mandatory>Optional</Mandatory>
<Resources>
<Item ID="0"><Name>timeScanStart</Name>
<Operations>R</Operations>
<MultipleInstances>Single</MultipleInstances>
<Mandatory>Mandatory</Mandatory>
<Type>Integer</Type>
<RangeEnumeration></RangeEnumeration>
<Units></Units>
<Description><![CDATA[Modem time when PLMN search is initiated]]></Description>
</Item>
<Item ID="6030"><Name>plmnID</Name>
<Operations>R</Operations>
<MultipleInstances>Single</MultipleInstances>
<Mandatory>Mandatory</Mandatory>
<Type>Integer</Type>
<RangeEnumeration></RangeEnumeration>
<Units></Units>
<Description><![CDATA[PLMN - mcc/mnc]]></Description>
</Item>
<Item ID="6031"><Name>BandIndicator</Name>
<Operations>R</Operations>
<MultipleInstances>Single</MultipleInstances>
<Mandatory>Mandatory</Mandatory>
<Type>Integer</Type>
<RangeEnumeration></RangeEnumeration>
<Units></Units>
<Description><![CDATA[Band Indicator]]></Description>
</Item>
<Item ID="6032"><Name>dlEarfcn</Name>
<Operations>R</Operations>
<MultipleInstances>Single</MultipleInstances>
<Mandatory>Mandatory</Mandatory>
<Type>Integer</Type>
<RangeEnumeration></RangeEnumeration>
<Units></Units>
<Description><![CDATA[EARFCN - frequency]]></Description>
</Item>
</Resources>
<Description2 />
</Object>
</LWM2M>
```
|
```smalltalk
/*
*
* This software may be modified and distributed under the terms
* of the MIT license. See the LICENSE file for details.
*
* path_to_url
*
*/
using Piranha.Extend.Fields;
using Piranha.Extend.Serializers;
using Piranha.Runtime;
using Xunit;
namespace Piranha.Tests;
public class Serializers
{
public enum ColorType
{
Red,
Green,
Blue
}
public SerializerManager Register() {
var manager = new SerializerManager();
manager.Register<TextField>(new StringFieldSerializer<TextField>());
return manager;
}
[Fact]
public void GetSerializer() {
var manager = Register();
var serializer = manager[typeof(TextField)];
Assert.NotNull(serializer);
}
[Fact]
public void UnRegister() {
var manager = Register();
manager.UnRegister<TextField>();
Assert.Null(manager[typeof(TextField)]);
}
[Fact]
public void SerializeCheckBoxField()
{
var serializer = new CheckBoxFieldSerializer<CheckBoxField>();
var value = true;
var str = serializer.Serialize(new CheckBoxField
{
Value = value
});
Assert.Equal(value.ToString(), str);
}
[Fact]
public void DeserializeCheckBoxField()
{
var serializer = new CheckBoxFieldSerializer<CheckBoxField>();
var value = true;
var field = (CheckBoxField)serializer.Deserialize(value.ToString());
Assert.Equal(value, field.Value);
}
[Fact]
public void WrongInputCheckBoxField()
{
var serializer = new CheckBoxFieldSerializer<CheckBoxField>();
Assert.Throws<ArgumentException>(() => serializer.Serialize(new DateField
{
Value = DateTime.Now
}));
}
[Fact]
public void SerializeDateField() {
var serializer = new DateFieldSerializer();
var str = serializer.Serialize(new DateField
{
Value = new DateTime(2001, 1, 5, 16, 0, 0)
});
Assert.Equal("2001-01-05", str);
}
[Fact]
public void SerializeEmptyDateField() {
var serializer = new DateFieldSerializer();
var str = serializer.Serialize(new DateField());
Assert.Null(str);
}
[Fact]
public void DeserializeDateField() {
var serializer = new DateFieldSerializer();
var date = new DateTime(2001, 1, 5, 16, 0, 0);
var str = "2001-01-05 16:00:00";
var field = (DateField)serializer.Deserialize(str);
Assert.NotNull(field);
Assert.Equal(date, field.Value.Value);
}
[Fact]
public void DeserializeEmptyDateField() {
var serializer = new DateFieldSerializer();
var field = (DateField)serializer.Deserialize(null);
Assert.False(field.Value.HasValue);
}
[Fact]
public void WrongInputToDateField() {
var serializer = new DateFieldSerializer();
Assert.Throws<ArgumentException>(() => serializer.Serialize(new StringField
{
Value = "Exception"
}));
}
[Fact]
public void SerializeImageField() {
var serializer = new ImageFieldSerializer();
var id = Guid.NewGuid();
var str = serializer.Serialize(new ImageField
{
Id = id
});
Assert.Equal(id.ToString(), str);
}
[Fact]
public void DeserializeImageField() {
var serializer = new ImageFieldSerializer();
var id = Guid.NewGuid();
var field = (ImageField)serializer.Deserialize(id.ToString());
Assert.Equal(id, field.Id.Value);
}
[Fact]
public void DeserializeEmptyImageField() {
var serializer = new ImageFieldSerializer();
var field = (ImageField)serializer.Deserialize(null);
Assert.False(field.HasValue);
}
[Fact]
public void WrongInputToImageField() {
var serializer = new ImageFieldSerializer();
Assert.Throws<ArgumentException>(() => serializer.Serialize(new StringField
{
Value = "Exception"
}));
}
[Fact]
public void SerializeDocumentField() {
var serializer = new DocumentFieldSerializer();
var id = Guid.NewGuid();
var str = serializer.Serialize(new DocumentField
{
Id = id
});
Assert.Equal(id.ToString(), str);
}
[Fact]
public void DeserializeDocumentField() {
var serializer = new DocumentFieldSerializer();
var id = Guid.NewGuid();
var field = (DocumentField)serializer.Deserialize(id.ToString());
Assert.Equal(id, field.Id.Value);
}
[Fact]
public void DeserializeEmptyDocumentField() {
var serializer = new DocumentFieldSerializer();
var field = (DocumentField)serializer.Deserialize(null);
Assert.False(field.HasValue);
}
[Fact]
public void WrongInputToDocumentField() {
var serializer = new DocumentFieldSerializer();
Assert.Throws<ArgumentException>(() => serializer.Serialize(new StringField
{
Value = "Exception"
}));
}
[Fact]
public void SerializeVideoField() {
var serializer = new VideoFieldSerializer();
var id = Guid.NewGuid();
var str = serializer.Serialize(new VideoField
{
Id = id
});
Assert.Equal(id.ToString(), str);
}
[Fact]
public void DeserializeVideoField() {
var serializer = new VideoFieldSerializer();
var id = Guid.NewGuid();
var field = (VideoField)serializer.Deserialize(id.ToString());
Assert.Equal(id, field.Id.Value);
}
[Fact]
public void DeserializeEmptyVideoField() {
var serializer = new VideoFieldSerializer();
var field = (VideoField)serializer.Deserialize(null);
Assert.False(field.HasValue);
}
[Fact]
public void WrongInputToVideoField() {
var serializer = new VideoFieldSerializer();
Assert.Throws<ArgumentException>(() => serializer.Serialize(new StringField
{
Value = "Exception"
}));
}
// START AUDIO
[Fact]
public void SerializeAudioField()
{
var serializer = new AudioFieldSerializer();
var id = Guid.NewGuid();
var str = serializer.Serialize(new AudioField
{
Id = id
});
Assert.Equal(id.ToString(), str);
}
[Fact]
public void DeserializeAudioField()
{
var serializer = new AudioFieldSerializer();
var id = Guid.NewGuid();
var field = (AudioField)serializer.Deserialize(id.ToString());
Assert.Equal(id, field.Id.Value);
}
[Fact]
public void DeserializeEmptyAudioField()
{
var serializer = new AudioFieldSerializer();
var field = (AudioField)serializer.Deserialize(null);
Assert.False(field.HasValue);
}
[Fact]
public void WrongInputToAudioField()
{
var serializer = new AudioFieldSerializer();
Assert.Throws<ArgumentException>(() => serializer.Serialize(new StringField
{
Value = "Exception"
}));
}
// END AUDIO
[Fact]
public void SerializeMediaField() {
var serializer = new MediaFieldSerializer();
var id = Guid.NewGuid();
var str = serializer.Serialize(new MediaField
{
Id = id
});
Assert.Equal(id.ToString(), str);
}
[Fact]
public void DeserializeMediaField() {
var serializer = new MediaFieldSerializer();
var id = Guid.NewGuid();
var field = (MediaField)serializer.Deserialize(id.ToString());
Assert.Equal(id, field.Id.Value);
}
[Fact]
public void DeserializeEmptyMediaField() {
var serializer = new MediaFieldSerializer();
var field = (MediaField)serializer.Deserialize(null);
Assert.False(field.HasValue);
}
[Fact]
public void WrongInputToMediaField() {
var serializer = new MediaFieldSerializer();
Assert.Throws<ArgumentException>(() => serializer.Serialize(new StringField
{
Value = "Exception"
}));
}
[Fact]
public void SerializeNumberField() {
var serializer = new IntegerFieldSerializer<NumberField>();
var str = serializer.Serialize(new NumberField
{
Value = 25
});
Assert.Equal("25", str);
}
[Fact]
public void SerializeEmptyNumberField() {
var serializer = new IntegerFieldSerializer<NumberField>();
var str = serializer.Serialize(new NumberField());
Assert.Null(str);
}
[Fact]
public void DeserializeNumberField() {
var serializer = new IntegerFieldSerializer<NumberField>();
var number = new NumberField
{
Value = 25
};
var str = "25";
var field = (NumberField)serializer.Deserialize(str);
Assert.NotNull(field);
Assert.Equal(number.Value, field.Value);
}
[Fact]
public void DeserializeEmptyNumberField() {
var serializer = new IntegerFieldSerializer<NumberField>();
var field = (NumberField)serializer.Deserialize(null);
Assert.False(field.Value.HasValue);
}
[Fact]
public void WrongInputToNumberField() {
var serializer = new IntegerFieldSerializer<NumberField>();
Assert.Throws<ArgumentException>(() => serializer.Serialize(new StringField
{
Value = "Exception"
}));
}
[Fact]
public void SerializeStringField() {
var serializer = new StringFieldSerializer<StringField>();
var ipsum = "Integer posuere erat a ante venenatis dapibus posuere velit aliquet.";
var str = serializer.Serialize(new StringField
{
Value = ipsum
});
Assert.Equal(ipsum, str);
}
[Fact]
public void DeserializeStringField() {
var serializer = new StringFieldSerializer<StringField>();
var ipsum = "Integer posuere erat a ante venenatis dapibus posuere velit aliquet.";
var field = (StringField)serializer.Deserialize(ipsum);
Assert.Equal(ipsum, field.Value);
}
[Fact]
public void WrongInputStringField() {
var serializer = new StringFieldSerializer<StringField>();
Assert.Throws<ArgumentException>(() => serializer.Serialize(new DateField
{
Value = DateTime.Now
}));
}
[Fact]
public void SerializePageField() {
var serializer = new PageFieldSerializer();
var pageId = Guid.NewGuid();
var str = serializer.Serialize(new PageField
{
Id = pageId
});
Assert.Equal(pageId.ToString(), str);
}
[Fact]
public void DeserializePageField() {
var serializer = new PageFieldSerializer();
var pageId = Guid.NewGuid();
var field = (PageField)serializer.Deserialize(pageId.ToString());
Assert.Equal(pageId, field.Id);
}
[Fact]
public void WrongInputPageField() {
var serializer = new PageFieldSerializer();
Assert.Throws<ArgumentException>(() => serializer.Serialize(new DateField
{
Value = DateTime.Now
}));
}
[Fact]
public void SerializePostField() {
var serializer = new PostFieldSerializer();
var postId = Guid.NewGuid();
var str = serializer.Serialize(new PostField
{
Id = postId
});
Assert.Equal(postId.ToString(), str);
}
[Fact]
public void DeserializePostField() {
var serializer = new PostFieldSerializer();
var postId = Guid.NewGuid();
var field = (PostField)serializer.Deserialize(postId.ToString());
Assert.Equal(postId, field.Id);
}
[Fact]
public void WrongInputPostField() {
var serializer = new PostFieldSerializer();
Assert.Throws<ArgumentException>(() => serializer.Serialize(new DateField
{
Value = DateTime.Now
}));
}
[Fact]
public void SerializeSelectField() {
var serializer = new SelectFieldSerializer<SelectField<ColorType>>();
var str = serializer.Serialize(new SelectField<ColorType>
{
EnumValue = ColorType.Green.ToString()
});
Assert.Equal("Green", str);
}
[Fact]
public void DeserializeSelectField() {
var serializer = new SelectFieldSerializer<SelectField<ColorType>>();
var field = (SelectField<ColorType>)serializer.Deserialize("Blue");
Assert.Equal(ColorType.Blue.ToString(), field.EnumValue);
}
[Fact]
public void DeserializeEmptySelectField() {
var serializer = new SelectFieldSerializer<SelectField<ColorType>>();
var field = (SelectField<ColorType>)serializer.Deserialize(null);
// Default value of the enum sequence
Assert.Equal("Red", field.EnumValue);
}
}
```
|
```rust
#[macro_use] extern crate rocket;
struct Unknown;
#[derive(FromForm)]
struct BadType3 {
field: Unknown,
}
struct Foo<T>(T);
#[derive(FromForm)]
struct Other {
field: Foo<usize>,
}
fn main() { }
```
|
The Bolivarian Museum (Spanish: Museo Bolivariano) is dedicated to Simón Bolívar, the hero of Latin American independence. It is situated in Caracas, Venezuela.
The museum is run in tandem with the birthplace of Simón Bolívar next door.
The collections include items related to Bolivar and Venezuelan independence.
History of the Museum
Many of the items in the museum were collected in the nineteenth century, and some of them were put on display in 1883 when President Guzmán Blanco organised an exhibition to celebrate the centenary of Bolívar's birth. In the twentieth century they were housed in a museum.
President Rómulo Betancourt took the decision to move the museum to its present site near the Plaza El Venezolano. The design of the single-storey structure was commissioned from the architect, Graziano Gasparini, who was already known for restoration work on Venezuela's Spanish Colonial church buildings. For the museum building he reconstructed a Spanish Colonial facade in keeping with the adjacent birthplace of Bolívar. It was inaugurated in 1960.
Collections
The collections include the coffin in which Bolívar's remains were brought from Santa Marta to Caracas.
See also
There are other museums named after Bolivar including a museum at Ziortza-Bolibar, Basque Country, Spain.
See List of places and things named after Simón Bolivar for more places associated with Bolivar.
References
External links
Official website Red Museos Bolivarianos (Casa Natal-Museo Bolivariano)
Museums in Caracas
Spanish Colonial architecture in Venezuela
|
```yaml
rules:
- id: rbs.no_arg
pattern:
regexp: arg\d+
message: |
Stop using parameter names like `arg0` or `arg1`
The parameter names like `arg0` or `arg1` is not informative enough.
Try finding good parameter names from documents or arglists.
If you cannot find a good name, just delete the name of the parameters.
justification:
- Documents (comments) may contain that pattern.
glob:
- "{core,stdlib}/**/*.rbs"
fail:
- "def `send`: (String | Symbol arg0, *untyped arg1) -> untyped"
pass:
- "def `send`: (String | Symbol, *untyped) -> untyped"
- id: rbs.prefer_boolish
pattern:
- regexp: '\([^(]*\bbool\b[^\n]*\)'
- token: "-> bool }"
message: |
Prefer `boolish` over `bool` for method arguments and block return values
See the doc below:
path_to_url#bool-or-boolish
glob:
- "**/*.rbs"
justification:
- When you strictly want `true | false`. Use `bool` in this case.
pass:
- "(arg: boolish)"
- "{ () -> boolish }"
fail:
- "(arg: bool)"
- "{ () -> bool }"
- id: deprecate_stdlib_test
pattern:
token: < StdlibTest
message: |
StdlibTest is deprecated
We recommend writing tests based on `TypeAssertions` and `#assert_send_type`.
justification:
- When you are updating existing tests.
- When you are writing tests for callback, which cannot be done with `#assert_send_type`.
glob:
- "test/stdlib/**/*_test.rb"
fail:
- |
class IntegerTest < StdlibTest
target Integer
def test_plus
1 + 2
end
end
pass:
- |
class IntegerTest < Test::Unit::TestCase
include TypeAssertions
testing "Integer"
def test_plus
assert_send_type "(::Integer) -> ::Integer",
1, :+, 2
end
end
- id: no_trailing_whitespace
pattern:
regexp: '[ \t]+$'
message: |
Trim trailing whitespaces
glob:
- '**/*.rb'
- '**/*.rbs'
- '**/*.md'
justification:
- Let the maintainers know if it is an autogenerated files.
pass:
- "Hello world"
- "Hello\nworld"
- "Hello\n\nworld"
fail:
- "Hello world "
- "Hello \nworld"
```
|
```xml
import { FunctionComponent } from 'react'
type Props = {
day: number
isToday: boolean
onClick: () => void
type: 'empty' | 'item' | 'template'
isLastMonth: boolean
}
const CalendarDay: FunctionComponent<Props> = ({ day, type, isToday, onClick, isLastMonth }) => {
let classNames = ''
if (isToday) {
classNames += 'bg-danger text-danger-contrast font-bold'
} else if (isLastMonth) {
classNames += 'text-passive-3'
} else {
if (type === 'empty') {
classNames += 'bg-transparent hover:bg-contrast'
} else if (type === 'item') {
classNames += 'bg-danger-light text-danger font-bold'
} else {
classNames += 'bg-contrast'
}
}
return (
<div className="h-7 w-[14.2%] p-0.5">
<div
className={`${classNames} flex h-full w-full cursor-pointer items-center justify-center rounded`}
key={day}
onClick={onClick}
>
{day}
</div>
</div>
)
}
export default CalendarDay
```
|
The men's 1 metre springboard was part of the Diving at the 2006 Commonwealth Games program. The competition was held on 22 March 2006 at Melbourne Sports and Aquatic Centre in Melbourne, Australia.
Format
The competition was held in two rounds:
Preliminary round: All 12 divers perform six dives, and as there are only 12 competitors, they all advance to the final.
Final: The 12 divers perform six dives; these are added onto the preliminary round scores and the top three divers win the gold, silver and bronze medals accordingly.
Schedule
All times are Australian Eastern Daylight Time (UTC+11).
Results
Results:
References
Diving at the 2006 Commonwealth Games
|
Niederstaufenbach is an Ortsgemeinde – a municipality belonging to a Verbandsgemeinde, a kind of collective municipality – in the Kusel district in Rhineland-Palatinate, Germany. It belongs to the Verbandsgemeinde of Kusel-Altenglan, whose seat is in Kusel.
Geography
Location
Niederstaufenbach lies in the Western Palatinate between the Walbersberg and the Krämel (mountains), on both sides of the Reichenbach in a broad hollow roughly a kilometre and a half up from where the Bosenbach empties into the Reichenbach. The village sits at an elevation of roughly 240 m above sea level between the villages of Oberstaufenbach and Friedelhausen. On the dale’s west side, the ground climbs up steeply to the Potzberg (hill) and to the neighbouring village of Föckelberg. Stretching east of the dale is a somewhat higher mountain ridge (Hertelwald 338 m) between the Reichenbach valley and the Walsbach and Bosenbach valleys. Rising in the south, within neighbouring Oberstaufenbach’s limits, is the mountain Heidenburg, from which the village might have got its name (see Municipality’s name below). The municipal area measures 201 ha, of which 31 ha is wooded and roughly 6 ha is settled.
Neighbouring municipalities
Niederstaufenbach borders in the north on the municipality of Bosenbach, in the east on the municipality of Reichenbach-Steegen, in the south on the municipality of Oberstaufenbach and in the west on the municipality of Föckelberg.
Municipality’s layout
Niederstaufenbach’s old village core lies on the Reichenbach’s left bank on a small side brook known in old border descriptions as the Limbach, but it is not to be confused with another stream by that name near Oberstaufenbach. The Limbach at Niederstaufenbach rises near Föckelberg on the slope of the Potzberg. In this part of the village stand Einfirsthäuser (“single-roof-ridge houses”), a kind of farmhouse found throughout the Westrich, an historic region that encompasses areas in both Germany and France. An extensive new building zone stretches out on the brook’s right bank next to the road going towards Bosenbach. The Niederstaufenbacher Mühle (mill) stands down the dale, likewise on the right bank at the old millrace. Towards the end of the 20th century, the municipality opened a building zone on the way to Friedelhausen. A further new building zone was laid out up from the graveyard.
History
Antiquity
The area around what is now Niederstaufenbach was already settled in prehistoric times, for around the plateau of the Heidenburg ran a Celtic ringwall, although owing to quarrying, nothing of it can now be made out. Indeed, the mountain’s name, Heidenburg, means “heathen castle” in German. Thus far, no Roman or pre-Roman archaeological finds have been unearthed right near the village.
Middle Ages
Just when Niederstaufenbach was founded cannot now be said, although the placename ending —bach offers a clue, for villages whose names end thus usually date back to sometime in the 8th or 9th century. At the time of its founding, the village still lay in the Imperially immediate Reichsland of the Vosagus (the Vosges) lying in a broad area around the royal estate at Lautern (Kaiserslautern). No later than sometime during the 14th century, the Imperially immediate areas around Kaiserslautern were given to counties that bordered on the Reichsland as Imperial pledges. Thus Niederstaufenbach, together with Bosenbach, Elzweiler, Horschbach and all the villages in the Eßweiler Tal (dale), passed into the ownership of the Waldgraves and Rhinegraves of Grumbach, whereas the villages of the Amt of Reichenbach passed to the County of Veldenz. Since in the Niederstaufenbach area the Limbach and, upstream, the Reichenbach formed the boundary between these two Ämter, the part of the village of Niederstaufenbach on the wedge of land between the two brooks must have belonged to the Amt of Reichenbach (see the mention of “Mittelstaufenbach” under Municipality’s name).
Modern times
In 1595, the Waldgraves and Rhinegraves gave Niederstaufenbach, together with Hachenbach, Horschbach, Elzweiler and Bosenbach, in an exchange for Kirchenbollenbach to the Duchy of Palatinate-Zweibrücken. These villages then became the new Amt of Bosenbach, which remained in existence within Palatinate-Zweibrücken until the French Revolution.
Recent times
During the time of French rule from 1801 to 1814, Niederstaufenbach belonged to the Mairie (“Mayoralty”) of Bosenbach, the Canton of Wolfstein, the Arrondissement of Kaiserslautern and the Department of Mont-Tonnerre (or Donnersberg in German). In 1816, under terms laid out by the Congress of Vienna, the Baierischer Rheinkreis (“Bavarian Rhine District”) was founded, a new exclave of the Kingdom of Bavaria. Niederstaufenbach now lay in the Landcommissariat (later Bezirksamt and then Landkreis or district) of Kusel, but still in the Canton of Wolfstein. The Palatinate was held by Bavaria until 1945. Indeed, Niederstaufenbach belongs to the Kusel district even today. The Bürgermeisterei (“Mayoralty”) of Bosenbach was dissolved in the course of administrative restructuring in Rhineland-Palatinate in 1968. Since 1 January 1972, Niederstaufenbach has belonged as an Ortsgemeinde to the Verbandsgemeinde of Altenglan.
Population development
At the time of the 1609 Oberamt of Lichtenberg ecclesiastical visitation, 11 families lived in Niederstaufenbach, made up of 22 married people, 30 children, one widower, one maid and one manservant, and thus 55 inhabitants all together. At that time, no distinction was made between Niederstaufenbach and “Mittelstaufenbach”.
The following table shows population development over the centuries for Niederstaufenbach, with some figures broken down by religious denomination:
*This figure dates from before the 1818 Protestant Union and thus actually represents Lutherans and Calvinists.
Municipality’s name
The word Stauf can mean either “chalice” or “crag”/“cliff”/“mountain”. In Niederstaufenbach’s and Oberstaufenbach’s case, the word obviously refers to the mountain called the Heidenburg within Oberstaufenbach’s limits. It is likely that the Reichenbach in the Heidenburg area was once called the “Staufenbach”. Thus, the brook drew its name from the mountain, and then the villages were named after the brook. Besides the two villages of Niederstaufenbach and Oberstaufenbach (whose prefixes mean “nether”/“lower” and “upper” respectively), old documents sometimes mentioned Mittelstaufenbach (whose prefix means “middle”). This was not a village as such, but rather a smaller part of the village of Niederstaufenbach that did not belong to the Amt of Bosenbach, but rather to the Amt of Reichenbach. The village was mentioned as Stauffenbach in 1322 and 1377, as nieder Stauffenbach in 1393 and as Loch Stauffenbach in 1567. The word Loch that appears before the name in that last mention is most likely not the current German word Loch (generally understood to mean “hole”, and not related to the Gaelic word loch), but rather an old word meaning “light forest”. This may have been the way that Niederstaufenbach and Oberstaufenbach were distinguished from each other in the Late Middle Ages. According to another version of events, Lochstaufenbach was the part of the village that had belonged to the Duchy of Palatinate-Veldenz, but passed to the Duchy of Palatinate-Zweibrücken in a “regional reform” in 1600.
Religion
Beginning with the Reformation and until the Thirty Years' War ended, all Niederstaufenbach’s inhabitants belonged first to the Lutheran faith, and then as of 1588 to the Calvinist (Reformed) faith. Only after the war were members of other denominations once again allowed to settle here. The settling of Catholic Christians was encouraged during French King Louis XIV’s wars of conquest through his Politique des Réunions. The village’s Protestant Christians originally belonged to the parish of Deinsberg (Theißberg). When Bosenbach was raised to parish in its own right after the Reformation, Niederstaufenbach was grouped into it as a branch. Alongside the Reformed parish, there was also as of 1709 also once again a Lutheran parish in Bosenbach. The Lutherans and Calvinists were united by the 1818 Palatine Union. The united Protestant parish of Bosenbach remained in existence until 1971. The Protestants of Niederstaufenbach and Bosenbach nowadays belong to the Evangelical parish of Jettenbach. The village’s Catholics have belonged to the Catholic parish of Reichenbach ever since it was resurrected about 1700.
Politics
Municipal council
The council is made up of 6 council members, who were elected by majority vote at the municipal election held on 7 June 2009, and the honorary mayor as chairman.
Mayor
Niederstaufenbach’s mayor is Karl Hahnenberger.
Coat of arms
The municipality’s arms might be described thus: Or issuant from base and dexter crags sable and to sinister a lion rampant crowned gules armed and langued azure, on a chief of the second a fess wavy of the first.
Niederstaufenbach’s arms bear the same charges in the same composition as Oberstaufenbach’s. This was apparently done on purpose. The only heraldic difference lies in the tinctures. The tinctures sable and Or (black and gold) are a reference to the village’s former allegiance to the Counts of Veldenz or Palatinate-Zweibrücken, depending on the source, while the lion in gules (red) refers to another former lord, the Duchy of Palatinate-Zweibrücken or the Rhinegraves of Grumbach, again, depending on the source. The crags and the wavy fess on the chief are canting charges for the municipality’s name, Stauf being an archaic word for “crag” in German (the usual word is Fels or Felsen), and the wavy fess standing for a brook, or in German, Bach, namely the Reichenbach. The crags to which the arms refer are the Heidenburg. Nieder means the same as its English cognate “nether”, namely “lower”.
The arms have been borne since 1976 when they were approved by the now defunct Rheinhessen-Pfalz Regierungsbezirk administration in Neustadt an der Weinstraße.
Culture and sightseeing
Regular events
Niederstaufenbach holds its kermis (church consecration festival) on the first weekend in August. Otherwise, the village has no customs that set it apart from neighbouring villages.
Clubs
As of 2000, Niederstaufenbach has a music club (no longer active), a men’s singing club, a local history club, a women’s choir and a Stammtisch.
Economy and infrastructure
Economic structure
Originally, there were only a few well off farmers living in Niederstaufenbach. The Niederstaufenbacher Mühle (mill), which has been shut down, was named in 1743 and mentioned as having two overshot waterwheels, and the rental price for each wheel was two Malter of corn (wheat or rye) and oats. Alongside the few farmers, few could claim to be craftsmen. As agriculture lost its importance, the number of workers rose. Beginning in the late 18th century, the Potzberg’s outlying hills were being prospected for quicksilver. Furthermore, a coal mine was being worked in Niederstaufenbach. In the 19th and 20th centuries, many villagers were employed as quarrymen at the Heidenburg quarry near Oberstaufenbach and at the quarries on the Schneeweiderhof. Today, the village’s businesses are an automobile repair shop, a window manufacturing company, a private engineering company for construction and two inns.
Education
Until the 18th century, Niederstaufenbach’s schoolchildren had to attend school in Bosenbach. Both the Protestants’ and the Catholics’ efforts to hire their own schoolteacher for Niederstaufenbach failed. Several times in records, clues crop up suggesting that both denominations had, for short terms only, hired so-called Schulmeister. These cannot be considered scholastic institutions, however. Only in 1833 did Niederstaufenbach build its own schoolhouse. By that time, the Catholics already had their own schoolteacher, and meanwhile, the Protestant schoolchildren had still been attending classes in Bosenbach. The new schoolhouse in Niederstaufenbach, however, was to be run as a denominationally communal school. A new schoolhouse was built in Niederstaufenbach about 1960. Nowadays, those from Niederstaufenbach attending school go to either the primary school in Rammelsbach or the Hauptschule (Regionale Schule) in Altenglan.
Transport
Running through the bedroom community of Niederstaufenbach is Landesstraße 367, which was expanded in the mid 19th century. In the village centre, a linking road, Kreisstraße 34, branches off to Bosenbach. To the southwest runs the Autobahn A 62 (Kaiserslautern–Trier). The nearest Autobahn interchanges lie 15 and 25 km away. Serving Altenglan 5 km away is Altenglan station, which is on the Landstuhl–Kusel railway and is served by Regionalbahn service RB 67, called the Glantalbahn (the name of which refers to the Glan Valley Railway, which shared some of the route of the Landstuhl–Kusel line, including the former railway junction at Altenglan). The station in Kaiserslautern lies 30 km away.
References
External links
Niederstaufenbach in the collective municipality’s webpages
Municipalities in Rhineland-Palatinate
Kusel (district)
|
Wang Lina (; born 5 February 1978 in Heilongjiang) is the Former China women's national volleyball team Outside Hitter. She won the 2003 World Cup and 2004 Olympics gold medal.
Clubs
Bayi (Army)(1995-2008)
Guangzhou Jianlong (2009–2010)
Guangdong Evergrande (2011–)
References
External links
FIVB Profile
1978 births
Living people
Chinese women's volleyball players
Olympic volleyball players for China
Volleyball players at the 1996 Summer Olympics
Volleyball players at the 2000 Summer Olympics
Volleyball players at the 2004 Summer Olympics
Olympic gold medalists for China
Olympic silver medalists for China
Olympic medalists in volleyball
People from Yichun, Heilongjiang
Medalists at the 2004 Summer Olympics
Asian Games medalists in volleyball
Volleyball players at the 1998 Asian Games
Medalists at the 1996 Summer Olympics
Asian Games gold medalists for China
Volleyball players from Heilongjiang
Medalists at the 1998 Asian Games
Outside hitters
|
```c++
/*
* (C) 1999 Antti Koivisto (koivisto@kde.org)
* (C) 2001 Dirk Mueller (mueller@kde.org)
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
*
* along with this library; see the file COPYING.LIB. If not, write to
* the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*/
#include "config.h"
#include "core/dom/DocumentType.h"
#include "core/dom/Document.h"
#include "core/dom/NamedNodeMap.h"
namespace blink {
DocumentType::DocumentType(Document* document, const String& name, const String& publicId, const String& systemId)
: Node(document, CreateOther)
, m_name(name)
, m_publicId(publicId)
, m_systemId(systemId)
{
}
KURL DocumentType::baseURI() const
{
return KURL();
}
String DocumentType::nodeName() const
{
return name();
}
Node::NodeType DocumentType::nodeType() const
{
return DOCUMENT_TYPE_NODE;
}
PassRefPtrWillBeRawPtr<Node> DocumentType::cloneNode(bool /*deep*/)
{
return create(&document(), m_name, m_publicId, m_systemId);
}
Node::InsertionNotificationRequest DocumentType::insertedInto(ContainerNode* insertionPoint)
{
Node::insertedInto(insertionPoint);
// DocumentType can only be inserted into a Document.
ASSERT(parentNode()->isDocumentNode());
document().setDoctype(this);
return InsertionDone;
}
void DocumentType::removedFrom(ContainerNode* insertionPoint)
{
document().setDoctype(nullptr);
Node::removedFrom(insertionPoint);
}
}
```
|
```smalltalk
using AppKit;
namespace Xamarin.Forms.ControlGallery.MacOS
{
static class MainClass
{
static void Main(string[] args)
{
NSApplication.Init();
NSApplication.Main(args);
}
}
}
```
|
```smalltalk
using System.Threading.Tasks;
using Microsoft.CodeAnalysis;
using Roslynator.Formatting.CodeFixes.CSharp;
using Roslynator.Testing.CSharp;
using Xunit;
namespace Roslynator.Formatting.CSharp.Tests;
public class RCS0061BlankLineBetweenSwitchSectionsTests : AbstractCSharpDiagnosticVerifier<BlankLineBetweenSwitchSectionsAnalyzer, SwitchSectionCodeFixProvider>
{
public override DiagnosticDescriptor Descriptor { get; } = DiagnosticRules.BlankLineBetweenSwitchSections;
[Fact, Trait(Traits.Analyzer, DiagnosticIdentifiers.BlankLineBetweenSwitchSections)]
public async Task Test_Statement_Include()
{
await VerifyDiagnosticAndFixAsync("""
class C
{
string M()
{
string s = string.Empty;
switch (s)
{
case "a":
return "a";[||]
case "b":
return "b";[||]
default:
return null;
}
}
}
""", """
class C
{
string M()
{
string s = string.Empty;
switch (s)
{
case "a":
return "a";
case "b":
return "b";
default:
return null;
}
}
}
""", options: Options.AddConfigOption(ConfigOptionKeys.BlankLineBetweenSwitchSections, ConfigOptionValues.BlankLineBetweenSwitchSections_Include));
}
[Fact, Trait(Traits.Analyzer, DiagnosticIdentifiers.BlankLineBetweenSwitchSections)]
public async Task Test_Statement_Omit()
{
await VerifyDiagnosticAndFixAsync("""
class C
{
string M()
{
string s = string.Empty;
switch (s)
{
case "a":
return "a";
[||]
case "b":
return "b";
[||]
default:
return null;
}
}
}
""", """
class C
{
string M()
{
string s = string.Empty;
switch (s)
{
case "a":
return "a";
case "b":
return "b";
default:
return null;
}
}
}
""", options: Options.AddConfigOption(ConfigOptionKeys.BlankLineBetweenSwitchSections, ConfigOptionValues.BlankLineBetweenSwitchSections_Omit));
}
[Fact, Trait(Traits.Analyzer, DiagnosticIdentifiers.BlankLineBetweenSwitchSections)]
public async Task Test_Statement_OmitAfterBlock()
{
await VerifyDiagnosticAndFixAsync("""
class C
{
string M()
{
string s = string.Empty;
switch (s)
{
case "a":
{
return "a";
}
[||]
case "b":
{
return "b";
}
[||]
default:
return null;
}
}
}
""", """
class C
{
string M()
{
string s = string.Empty;
switch (s)
{
case "a":
{
return "a";
}
case "b":
{
return "b";
}
default:
return null;
}
}
}
""", options: Options.AddConfigOption(ConfigOptionKeys.BlankLineBetweenSwitchSections, ConfigOptionValues.BlankLineBetweenSwitchSections_OmitAfterBlock));
}
[Fact, Trait(Traits.Analyzer, DiagnosticIdentifiers.BlankLineBetweenSwitchSections)]
public async Task Test_Block_Include()
{
await VerifyDiagnosticAndFixAsync("""
class C
{
string M()
{
string s = string.Empty;
switch (s)
{
case "a":
{
return "a";
}[||]
case "b":
{
return "b";
}[||]
default:
return null;
}
}
}
""", """
class C
{
string M()
{
string s = string.Empty;
switch (s)
{
case "a":
{
return "a";
}
case "b":
{
return "b";
}
default:
return null;
}
}
}
""", options: Options.AddConfigOption(ConfigOptionKeys.BlankLineBetweenSwitchSections, ConfigOptionValues.BlankLineBetweenSwitchSections_Include));
}
[Fact, Trait(Traits.Analyzer, DiagnosticIdentifiers.BlankLineBetweenSwitchSections)]
public async Task Test_Block_Omit()
{
await VerifyDiagnosticAndFixAsync("""
class C
{
string M()
{
string s = string.Empty;
switch (s)
{
case "a":
{
return "a";
}
[||]
case "b":
{
return "b";
}
[||]
default:
return null;
}
}
}
""", """
class C
{
string M()
{
string s = string.Empty;
switch (s)
{
case "a":
{
return "a";
}
case "b":
{
return "b";
}
default:
return null;
}
}
}
""", options: Options.AddConfigOption(ConfigOptionKeys.BlankLineBetweenSwitchSections, ConfigOptionValues.BlankLineBetweenSwitchSections_Omit));
}
[Fact, Trait(Traits.Analyzer, DiagnosticIdentifiers.BlankLineBetweenSwitchSections)]
public async Task Test_Block_OmitAfterBlock()
{
await VerifyDiagnosticAndFixAsync("""
class C
{
string M()
{
string s = string.Empty;
switch (s)
{
case "a":
{
return "a";
}
[||]
case "b":
{
return "b";
}
[||]
default:
return null;
}
}
}
""", """
class C
{
string M()
{
string s = string.Empty;
switch (s)
{
case "a":
{
return "a";
}
case "b":
{
return "b";
}
default:
return null;
}
}
}
""", options: Options.AddConfigOption(ConfigOptionKeys.BlankLineBetweenSwitchSections, ConfigOptionValues.BlankLineBetweenSwitchSections_OmitAfterBlock));
}
[Fact, Trait(Traits.Analyzer, DiagnosticIdentifiers.BlankLineBetweenSwitchSections)]
public async Task TestNoDiagnostic_IfDirective()
{
await VerifyNoDiagnosticAsync("""
#define FOO
class C
{
string M()
{
string s = string.Empty;
switch (s)
{
case "a":
{
return "a";
}
#if FOO
default:
return null;
#endif
}
}
}
""", options: Options.AddConfigOption(ConfigOptionKeys.BlankLineBetweenSwitchSections, ConfigOptionValues.BlankLineBetweenSwitchSections_Include));
}
}
```
|
```javascript
/**
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
'use strict';
var randu = require( '@stdlib/random/base/randu' );
var logpdf = require( './../lib' );
var v;
var x;
var y;
var i;
for ( i = 0; i < 10; i++ ) {
x = (randu() * 6.0) - 3.0;
v = randu() * 10.0;
y = logpdf( x, v );
console.log( 'x: %d, v: %d, ln(f(x;v)): %d', x, v, y );
}
```
|
Thomas Olsen may refer to:
Thomas Olsen (soccer) (born 1995), American soccer player
Thomas David Lukas Olsen (born 1975), German murderer
Thomas Lehne Olsen (born 1991), Norwegian footballer
Thomas Fredrik Olsen (1897–1969), Norwegian ship-owner
Thomas R. Olsen (1934–2014), United States Air Force general
Thomas Valkvæ Olsen (born 1993), Norwegian ice hockey player
Tom Strømstad Olsen (born 1971), Norwegian politician
Tommy Olsen (born 1973), Danish football manager and former player
Tommy Olsen (orienteer), Norwegian ski-orienteering competitor
Thomas Kjær Olsen (born 1997), Danish motocross rider
|
Lennart Möller (24 September 1954 – 19 November 2021) was a professor of environmental medicine at the Karolinska Institute in Stockholm, Sweden. He received a doctorate in Medical sciences from the Karolinska Institute in 1988, with a thesis "2-nitrofluorene, in vivo metabolism and assessment of cancer risk of an air pollutant." He was the editor and author of several books in popular sciences and theology covering urban air quality, cancer, environmental medicine, ethics, and photography. He was the deputy chairman of the board for the Lennart Nilsson Award, an international prize in scientific photography.
He was a signatory to the A Scientific Dissent From Darwinism statement issued in 2001 by the Discovery Institute, a conservative Christian think tank based in Seattle, Washington, US, best known for its advocacy of intelligent design. The statement expresses skepticism about the ability of random mutations and natural selection to account for the complexity of life, and encourages careful examination of the evidence for "Darwinism", a term intelligent design proponents use to refer to evolution. Its claims have been rejected by the scientific community.
Möller was the author of The Exodus Case, a 448-page book based on findings of Ron Wyatt published in 2002 and revised and expanded in 2008. The book expounds Möller's theory about the route of the biblical Exodus from Egypt, in particular that a mountain called Jabal al-Lawz in Saudi Arabia is the biblical Mount Sinai. A review by Swedish archaeologist Martin Rundkvist states that "Möller emphasizes that he is neither a theologian, a historian nor an archaeologist" and concludes with, "The Exodus Case is such an extreme example of pseudo-science that any reasonably well-informed reader will wonder if Möller is joking." A review on the Studiengemeinschaft Wort und Wissen (Word and Knowledge Study Community) website, whose members take a literal approach to the Bible, stated that it contained such "serious substantive and methodological errors" that it could not be recommended while agreeing that the Exodus took place. Peter van der Veen and Uwe Zerbst specifically criticized his identification of Jabal al-Lawz with Mount Sinai and a number of the geographical locations he thought to be part of the Exodus route.
biographical details
Möller was born 24 September 1954 in Stockholm and died 19 November 2021 in Stallarholmen
External links
PubMed search for Lennart Möller
References
1954 births
2021 deaths
Academic staff of the Karolinska Institute
Karolinska Institute alumni
Physicians from Stockholm
Academics from Stockholm
Pseudoarchaeologists
Swedish medical researchers
|
```javascript
CKEDITOR.plugins.setLang("preview","da",{preview:"Vis eksempel"});
```
|
Mao Jiangsen (; 15 January 1934 – 18 May 2023) was a Chinese virologist, and an academician of the Chinese Academy of Sciences.
He was a representative of the 14th and 15th National Congress of the Chinese Communist Party.
Biography
Mao was born Mao Weishu () into a family of farming background in Jiangshan County (now Jiangshan), Jiangsu, on 15 January 1934. He attended Hecang Village Primary School (), Qinghu Central Primary School (), Jiangshan County Middle School (), Hangzhou Xinqun High School (), and Zhejiang Provincial Hangzhou High school (). He joined the Communist Youth League of China in January 1951 and in September enrolled at the National Shanghai Medical College (now Shanghai Medical College, Fudan University). He became a member of the Chinese Communist Party in October 1953.
After university in 1957, he was despatched to the Department of Virology, Chinese Academy of Medical Sciences. In early 1958, he was sent to a natural village in Shangyuan Township, Changping County (now Changping District of Beijing) to do farm works, and returned to the Chinese Academy of Medical Sciences in May 1963.
In 1966, the Cultural Revolution broke out, he was transferred to Anmenkou Commune Health Center in Kang County, northwest China's Gansu province. In September 1972, he became a member of the Gansu Provincial Health and Epidemic Prevention Station. He went with the medical and health team of Gansu to the 1976 Tangshan earthquake disaster area for medical assistance in 1976.
In January 1978, he was transferred to Zhejiang Provincial People's Health Experimental Institute (now Zhejiang Academy of Medical Sciences). In March 1987, he became a researcher at Zhejiang Medical Research Institute, and served as vice president in June of that same year. He moved up the rank to become president in July 1991. He retired in July 2018.
He died of an illness in Hangzhou, Zhejiang, on 18 May 2023, aged 89.
Honours and awards
November 1991 Member of the Chinese Academy of Sciences (CAS)
2001 State Science and Technology Progress Award (Second Class) for the protective effect and immune strategy of live attenuated hepatitis a vaccine.
References
1934 births
2023 deaths
People from Jiangshan
Scientists from Zhejiang
Fudan University alumni
Chinese virologists
Members of the Chinese Academy of Sciences
20th-century Chinese scientists
21st-century Chinese scientists
|
```yaml
steps:
- download: none
- template: release-SetReleaseTagAndContainerName.yml
- pwsh: |
az login --service-principal -u $(az_url) -p $(az_key) --tenant $(az_name)
displayName: az login
- pwsh: |
az storage container set-permission --account-name $(StorageAccount) --name $(azureVersion) --public-access blob
displayName: Make container public
- pwsh: |
az storage container set-permission --account-name $(StorageAccount) --name $(azureVersion)-gc --public-access blob
displayName: Make guest configuration miminal package container public
- pwsh: |
az logout
displayName: az logout
```
|
Palazzo Scanderbeg or Palazzetto Scanderbeg is a Roman palazzo, located on the Piazza Scanderbeg (Num. 117) near the Trevi Fountain. It takes its name from its fifteenth-century host, the Albanian national hero Skanderbeg. The Palazzo was host of the National Museum of Pasta Foods (Museo Nazionale delle Paste Alimentari). Recently re-opened it is the host of a residence - Palazzo Scanderbeg Townhouse and Palazzo Scanderbeg Suites.
References
Palaces in Rome
Museums in Rome
Food museums in Italy
Rome R. II Trevi
Skanderbeg
|
Nasigram is a village in Bhatar CD block in Bardhaman Sadar North subdivision of Purba Bardhaman district in the state of West Bengal, India with total 1,708 families residing. It is located about from West Bengal on National Highway towards Purba Bardhaman.
History
Census 2011 Nasigram Village Location Code or Village Code 319845. The village of Nasigram is located in the Bhatar tehsil of Burdwan district in West Bengal, India.
Transport
At around from Purba Bardhaman, the journey to Nasigram from the town can be made by bus and the nearest rail station bhatar.
Population
Nasigram village, most of the villagers are from Schedule Caste (SC). Schedule Caste (SC) constitutes 38.81% while Schedule Tribe (ST) were 0.63% of total population in Nasigram village.
Population and house data
Healthcare
Nearest Rural Hospital at Bhatar (with 60 beds) is the main medical facility in Bhatar CD block. There are primary health centres.
School
NASIGRAM HIGH SCHOOL (H.S)
NASIGRAM GIRLS F.P. SCHOOL.
References
Villages in Purba Bardhaman district
|
Jo Yong-son (born 23 June 1970) is a North Korean wrestler. He competed in the men's freestyle 63 kg at the 2000 Summer Olympics.
References
1970 births
Living people
North Korean male sport wrestlers
Olympic wrestlers for North Korea
Wrestlers at the 2000 Summer Olympics
Place of birth missing (living people)
21st-century North Korean people
|
```objective-c
//
// UIView+YYAdd.h
// YYKit <path_to_url
//
// Created by ibireme on 13/4/3.
//
// This source code is licensed under the MIT-style license found in the
// LICENSE file in the root directory of this source tree.
//
#import <UIKit/UIKit.h>
NS_ASSUME_NONNULL_BEGIN
/**
Provides extensions for `UIView`.
*/
@interface UIView (YYAdd)
/**
Create a snapshot image of the complete view hierarchy.
*/
- (nullable UIImage *)snapshotImage;
/**
Create a snapshot image of the complete view hierarchy.
@discussion It's faster than "snapshotImage", but may cause screen updates.
See -[UIView drawViewHierarchyInRect:afterScreenUpdates:] for more information.
*/
- (nullable UIImage *)snapshotImageAfterScreenUpdates:(BOOL)afterUpdates;
/**
Create a snapshot PDF of the complete view hierarchy.
*/
- (nullable NSData *)snapshotPDF;
/**
Shortcut to set the view.layer's shadow
@param color Shadow Color
@param offset Shadow offset
@param radius Shadow radius
*/
- (void)setLayerShadow:(nullable UIColor*)color offset:(CGSize)offset radius:(CGFloat)radius;
/**
Remove all subviews.
@warning Never call this method inside your view's drawRect: method.
*/
- (void)removeAllSubviews;
/**
Returns the view's view controller (may be nil).
*/
@property (nullable, nonatomic, readonly) UIViewController *viewController;
/**
Returns the visible alpha on screen, taking into account superview and window.
*/
@property (nonatomic, readonly) CGFloat visibleAlpha;
/**
Converts a point from the receiver's coordinate system to that of the specified view or window.
@param point A point specified in the local coordinate system (bounds) of the receiver.
@param view The view or window into whose coordinate system point is to be converted.
If view is nil, this method instead converts to window base coordinates.
@return The point converted to the coordinate system of view.
*/
- (CGPoint)convertPoint:(CGPoint)point toViewOrWindow:(nullable UIView *)view;
/**
Converts a point from the coordinate system of a given view or window to that of the receiver.
@param point A point specified in the local coordinate system (bounds) of view.
@param view The view or window with point in its coordinate system.
If view is nil, this method instead converts from window base coordinates.
@return The point converted to the local coordinate system (bounds) of the receiver.
*/
- (CGPoint)convertPoint:(CGPoint)point fromViewOrWindow:(nullable UIView *)view;
/**
Converts a rectangle from the receiver's coordinate system to that of another view or window.
@param rect A rectangle specified in the local coordinate system (bounds) of the receiver.
@param view The view or window that is the target of the conversion operation. If view is nil, this method instead converts to window base coordinates.
@return The converted rectangle.
*/
- (CGRect)convertRect:(CGRect)rect toViewOrWindow:(nullable UIView *)view;
/**
Converts a rectangle from the coordinate system of another view or window to that of the receiver.
@param rect A rectangle specified in the local coordinate system (bounds) of view.
@param view The view or window with rect in its coordinate system.
If view is nil, this method instead converts from window base coordinates.
@return The converted rectangle.
*/
- (CGRect)convertRect:(CGRect)rect fromViewOrWindow:(nullable UIView *)view;
@property (nonatomic) CGFloat left; ///< Shortcut for frame.origin.x.
@property (nonatomic) CGFloat top; ///< Shortcut for frame.origin.y
@property (nonatomic) CGFloat right; ///< Shortcut for frame.origin.x + frame.size.width
@property (nonatomic) CGFloat bottom; ///< Shortcut for frame.origin.y + frame.size.height
@property (nonatomic) CGFloat width; ///< Shortcut for frame.size.width.
@property (nonatomic) CGFloat height; ///< Shortcut for frame.size.height.
@property (nonatomic) CGFloat centerX; ///< Shortcut for center.x
@property (nonatomic) CGFloat centerY; ///< Shortcut for center.y
@property (nonatomic) CGPoint origin; ///< Shortcut for frame.origin.
@property (nonatomic) CGSize size; ///< Shortcut for frame.size.
@end
NS_ASSUME_NONNULL_END
```
|
```xml
/*
*
* See the LICENSE file at the top-level directory of this distribution
* for licensing information.
*
* Unless otherwise agreed in a custom licensing agreement with the Lisk Foundation,
* no part of this software, including this file, may be copied, modified,
* propagated, or distributed except according to the terms contained in the
* LICENSE file.
*
* Removal or modification of this copyright notice is prohibited.
*/
import { utils } from '@liskhq/lisk-cryptography';
import { SupportedNFTsStore } from '../../../../../src/modules/nft/stores/supported_nfts';
import { PrefixedStateReadWriter } from '../../../../../src/state_machine/prefixed_state_read_writer';
import { InMemoryPrefixedStateDB } from '../../../../../src/testing';
import { createStoreGetter } from '../../../../../src/testing/utils';
import { LENGTH_CHAIN_ID, LENGTH_COLLECTION_ID } from '../../../../../src/modules/nft/constants';
import { Modules } from '../../../../../src';
describe('NFTStore', () => {
let store: SupportedNFTsStore;
let context: Modules.StoreGetter;
beforeEach(() => {
store = new SupportedNFTsStore('NFT', 5);
const db = new InMemoryPrefixedStateDB();
const stateStore = new PrefixedStateReadWriter(db);
context = createStoreGetter(stateStore);
});
describe('save', () => {
it('should order supported NFT collection of a chain', async () => {
const chainID = Buffer.alloc(Modules.Interoperability.CHAIN_ID_LENGTH, 0);
const unsortedSupportedCollections = [
{
collectionID: Buffer.alloc(LENGTH_COLLECTION_ID, 1),
},
{
collectionID: Buffer.alloc(LENGTH_COLLECTION_ID, 0),
},
{
collectionID: Buffer.from([0, 1, 1, 0]),
},
];
const sortedSupportedCollections = unsortedSupportedCollections.sort((a, b) =>
a.collectionID.compare(b.collectionID),
);
const data = {
supportedCollectionIDArray: unsortedSupportedCollections,
};
await store.save(context, chainID, data);
await expect(store.get(context, chainID)).resolves.toEqual({
supportedCollectionIDArray: sortedSupportedCollections,
});
});
});
describe('getAll', () => {
it('should retrieve all NFTs with key between 0 and maximum value for Buffer of length LENGTH_CHAIN_ID', async () => {
await store.save(context, Buffer.alloc(LENGTH_CHAIN_ID, 0), {
supportedCollectionIDArray: [],
});
await store.save(context, Buffer.alloc(LENGTH_CHAIN_ID, 1), {
supportedCollectionIDArray: [],
});
await store.save(context, utils.getRandomBytes(LENGTH_CHAIN_ID), {
supportedCollectionIDArray: [],
});
const allSupportedNFTs = await store.getAll(context);
expect([...allSupportedNFTs.keys()]).toHaveLength(3);
});
});
});
```
|
```smalltalk
using System;
namespace DSharpPlus.SlashCommands;
/// <summary>
/// Marks this class a slash command group.
/// </summary>
[AttributeUsage(AttributeTargets.Class, AllowMultiple = false)]
public sealed class SlashCommandGroupAttribute : Attribute
{
/// <summary>
/// Gets the name of this slash command group.
/// </summary>
public string Name { get; }
/// <summary>
/// Gets the description of this slash command group.
/// </summary>
public string Description { get; }
/// <summary>
/// Gets whether this command is enabled on default.
/// </summary>
public bool DefaultPermission { get; }
/// <summary>
/// Gets whether this command is age restricted.
/// </summary>
public bool NSFW { get; }
/// <summary>
/// Marks this class as a slash command group.
/// </summary>
/// <param name="name">Sets the name of this command group.</param>
/// <param name="description">Sets the description of this command group.</param>
/// <param name="defaultPermission">Sets whether this command group is enabled on default.</param>
/// <param name="nsfw">Sets whether the command group is age restricted.</param>
public SlashCommandGroupAttribute(string name, string description, bool defaultPermission = true, bool nsfw = false)
{
this.Name = name.ToLower();
this.Description = description;
this.DefaultPermission = defaultPermission;
this.NSFW = nsfw;
}
}
```
|
Daniel Noce (1894−1976) was a U.S. Army Lieutenant General who served in both world wars.
Over his decorated military career he rose to the position of Inspector General of the Army. Following his retirement from the armed forces, he served as an executive at Michigan's Donnelly-Kelley Glass Company.
Noce died in Sperryville, Virginia on February 17, 1976.
Early life
He was born on November 3, 1894, in Denver, Colorado. His father was Angelo Noce, who founded the first Italian newspaper in Colorado (La Stella) and led the push for the Columbus Day holiday. Daniel learned woodworking and carpentry in high school and made furniture as a hobby throughout his life. He received an appointment to West Point and took up boxing, breaking his nose twice. He graduated from the United States Military Academy at West Point in April 1917, and dropped his first name of Angelo shortly thereafter. He was appointed a Second Lieutenant.
Upon graduation he was in the Cavalry, later transferring into the Army Corps of Engineers.
From June to December, 1917 he served with the 4th Engineer Regiment at Vancouver Barracks, Washington, Camp Greene, North Carolina and Camp Humphreys, Virginia.
He married Mildred Newcomb Wilson, the granddaughter of Astronomer Simon Newcomb, in 1918 in Washington DC.
Military career
World War I
Noce served in France during World War I. In March, 1918 he was appointed Adjutant of the 602nd Engineer Regiment, and he advanced to regimental commander in August. He commanded the regiment during the Saint-Mihiel and Meuse-Argonne Offensives, and remained in Germany on occupation duty until 1919.
Post-World War I
In 1920 Noce sued in the U.S. Court of Claims for longevity pay he claimed was due to him. His claim was based on the argument that his time in service should count from when he entered West Point, and not when he received his commission. He prevailed in the lower court in a decision that could have affected the pay of thousands of Army officers, but the U.S. Supreme Court reversed the decision.
In 1921 Noce received a bachelor's degree in civil engineering from the Massachusetts Institute of Technology. In the 1920s and early 1930s he served in a variety of Engineer assignments, including postings to New York City, Fort Gordon, Georgia and the Office of the Chief of Engineers. He also graduated from the Command and General Staff College and the Army War College.
In the 1930s he and his young family were stationed in the Philippines.
From 1937 to 1939 he was District Engineer in Memphis, Tennessee, supervising Mississippi River levee and dam maintenance and flood control. From 1940 to 1941 he was District Engineer in Los Angeles, California, overseeing harbor expansion and defense in anticipation of World War II.
World War II
Noce served throughout World War II. In 1942 he was named to command the Engineer Amphibian Command at Camp Edwards, Massachusetts as a brigadier general. In this assignment he developed organizations, equipment, and techniques used in the D-Day invasion and the Allied offensive in the Pacific Islands.
From 1943 to 1944 he was Deputy Chief of Staff for U.S. forces in the European Theater of Operations, receiving promotion to major general as planner and overseer of the engineer effort that supported military operations in North Africa and Italy. From 1944 to 1945 he performed a similar function in the Mediterranean Theater of Operations.
From 1945 to 1946 Noce was Director of Plans and Operations at Headquarters, Army Service Forces in Washington, D.C.
Post World War II
In 1946 Noce he was appointed Director of the War Department's Civil Affairs Division, serving until 1948 and receiving promotion to lieutenant general. In this assignment he led a mission to expand cultural and economic relations between the Philippines and China, and the Philippines and Japan following World War II.
From 1949 to 1952 he was Chief of Staff for the U.S. European Command in Germany, and played an important part in implementing rebuilding efforts undertaken as part of the Marshall Plan.
In 1952 he was appointed Inspector General of the Army, where he served until his 1954 retirement.
General Noce's decorations included five awards of the Distinguished Service Medal and the Legion of Merit.
Civilian career
After retiring from the Army he was an executive with Michigan's Donnelly-Kelley Glass Company.
Retirement and death
Upon his retirement in 1955, Lt. General Daniel Noce purchased a 1200-acre farm near Sperryville, Virginia and produced award-winning yields of corn and prized Black Angus beef.
He served on the Rappahannock River Basin Advisory Committee, which advised state and local governments about water use and long term planning, including construction of the proposed Salem Church Dam.
Noce died in Sperryville, Virginia on February 17, 1976.
Personal
General Noce was the father of Mildred Wilson Noce (1922–1968) and Colonel Robert Wilson Noce (1926–2005), a 1949 West Point graduate who commanded a squadron of armored cavalry (1st Squadron, 10th Cavalry Regiment) of the 4th Infantry Division during the Vietnam War.
References
Sources
Biographical Register of the Officers and Graduates of the U.S. Military Academy, George W. Cullum, 1920, Volume VI-B, page 1864
Open Jurist web site, 268 US 13, U.S. Vs. Noce, http://openjurist.org/268/us/613/united-states-v-noce
U.S. Army Register, U.S. Army Adjutant General's Office, 1922, page 304
Newspaper article, South Harassed by Flood Waters, Kingsport (Tennessee) Times, February 20, 1938
Omaha Beach: A Flawed Victory, Adrian R. Lewis, 2003, page 70
Official Register of the United States, U.S. Civil Service Commission, 1940, Page 39
Newspaper article, General Awarded Military Medal, Associated Press, printed in the Salt Lake Tribune, January 28, 1943
Newspaper article, Invasion of Europe Moves Step Nearer, Kingston (Jamaica) Gleaner, May 31, 1943
Newspaper article, General Noce Takes Staff Post in London, Hartford Courant, May 31, 1943
Newspaper article, Forces Ready When Needed, Ironwood (Michigan) Daily Globe, June 8, 1943
Newspaper article, Five Generals Named for Three-Star Rank, Los Angeles Times, March 4, 1944
Newspaper article, Gen. Noce Is Elevated; Amphibian Expert Appointed to Civil Affairs Post, New York Times, December 11, 1946
Newspaper article, Air Forces Given Half of Top Jobs, Berkshire (Massachusetts) Evening Eagle, January 20, 1947
Newspaper article, Trade Survey Slated in P.I. by Noce Group, Pacific Stars and Stripes, May 4, 1948
Newspaper article, Americans Anxious To Industrialise Japan, Canberra (Australia) Times, May 5, 1948
Newspaper article, Gen. Noce to Succeed Taylor as Chief of Staff, European Stars and Stripes, August 9, 1949
Newspaper article, Noce Named New Army IG, European Stars and Stripes, May 1, 1952
Newspaper article, EUCOM bids Farewell to Gen. Noce, European Stars and Stripes, June 8, 1952
Military Times, Hall of Heroes, Index of Recipients of Major Military Awards, http://www.homeofheroes.com/verify/recipients_n.html
Newspaper article, Retired General Accepts Position at Glass Company, Holland (Michigan) Evening Sentinel, July 11, 1955
Newspaper article, Committee Launches into Study On Big River Basin Plans, Fredericksburg Free Lance-Star, June 4, 1966
Newspaper article, River Group Will Hear Engineer, Fredericksburg Free Lance-Star, July 18, 1969
Newspaper article, Rivers Act Concern Shown, Fredericksburg Free Lance-Star February 5, 1970
Armored Combat in Vietnam, Donn A. Starry, 1982, page 228
Army R, D & A magazine, published by U.S. Army Materiel Development and Readiness Command, 1978, volume 19, number 6, page 25
Newspaper article, Obituary, Robert W. Noce, Quad Cities (Illinois) Dispatch, December 1, 2005
External links
Generals of World War II
1894 births
1976 deaths
United States Army Corps of Engineers personnel
Military personnel from Denver
United States Military Academy alumni
United States Army personnel of World War I
MIT School of Engineering alumni
United States Army generals
Recipients of the Distinguished Service Medal (US Army)
Recipients of the Legion of Merit
United States Army generals of World War II
United States Army Command and General Staff College alumni
United States Army War College alumni
|
A mandapa or mantapa () is a pillared hall or pavilion for public rituals in Indian architecture, especially featured in Hindu temple architecture.
Mandapas are described as "open" or "closed" depending on whether they have walls. In temples, one or more mandapas very often lie between the sanctuary and the temple entrance, on the same axis. In a large temple other mandapas may be placed to the sides, or detached within the temple compound.
Temple architecture
In the Hindu temple the mandapa is a porch-like structure through the (gopuram) (ornate gateway) and leading to the temple. It is used for religious dancing and music and is part of the basic temple compound. The prayer hall was generally built in front of the temple's sanctum sanctorum (garbhagriha). A large temple would have many mandapa.
If a temple has more than one mandapa, each one is allocated for a different function and given a name to reflect its use. For example, a mandapa dedicated to divine marriage is referred to as a kalyana mandapa.
Often the hall was pillared and the pillars adorned with intricate carvings. In contemporary terms, it also represents a structure within which a Hindu wedding is performed. The bride and groom encircle a holy fire lit by the officiating priest in the center of the mandapa.
Classifications
When a temple has more than one mandapa, they are given different names.
Artha Mandapam or Ardh Mandapam – intermediary space between the temple exterior and the sanctum sanctorum or the other mandapa of the temple
Asthana Mandapam – assembly hall
Kalyana Mandapam – dedicated to ritual marriage celebration of the Lord with Goddess
Maha Mandapam – (Maha=big) when there are several mandapa in the temple, it is the biggest and the tallest. It is used for conducting religious discourses. Sometimes, the maha mandapa is also built along a transversal axis with a transept (bumped-out portions along this transversal axis). At the exterior, the transept ends by a large window which brings light and freshness into the temple.
Nandi Mandapam (or Nandi mandir) – in the Shiva temples, pavilion with a statue of the sacred bull Nandi, looking at the statue or the lingam of Shiva.
Ranga Mandapa or rangamandapa – a larger mandapa, which can be used for dance or drama, with music
Meghanath Mandapa
Namaskara Mandapa
Open Mandapa
Nomenclature
In Burmese, the term mandat (), which has etymological origins in Pali maṇḍapa, is an open platform or pavilion from which people spray water to passers-by during the Buddhist festival Thingyan.
In Javanese, the mandapa is known as a pendhapa (). Unusually, Indonesian pendopos are built mostly for Muslim communities. Many mosques follow the pendopo design, with a layered roof to resemble Mount Meru.
In Khmer, Mandapa is pronounced to be Mondup (), means pavilion. Khmer people often refer it as a small shrine with high crown-shaped like tower, decorated with exquisite ornaments in various styles. In Khmer temples during Angkor era, A Mandapa is generally attached to the central tower of a temple and lied longitudinally to one of each main direction.
In Tamil, this platform is the Aayiram Kaal Mandapam – a distinctly thousand pillared hall close to the vimana of the Koil which forms a distinct part of the site plan of classical Dravidian architecture.
In Thai, it is called a mondop'' (). It features often in Thai temple art and architecture, either in the form of a Hor Trai (a temple library) or as an altar shrine such as the one in Wat Chiang Man in Chiang Mai.
Gallery
Notes
See also
Pendopo
Wedding mandapa
Zayat
External links
Photo of four-pillared Kakatiya mandapa
Photo of relief in a mandapa
Floor plan of North Indian temple with mandapa
Hindu temple architecture
|
```shell
How to change your most recent commit
Finding a tag
The three states in git
Use `short` status to make output more compact
How to write a git commit message
```
|
```go
// +build !ignore_autogenerated
/*
path_to_url
Unless required by applicable law or agreed to in writing, software
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
// This file was autogenerated by conversion-gen. Do not edit it manually!
package v1beta1
import (
conversion "k8s.io/apimachinery/pkg/conversion"
runtime "k8s.io/apimachinery/pkg/runtime"
authorization "k8s.io/client-go/pkg/apis/authorization"
unsafe "unsafe"
)
func init() {
SchemeBuilder.Register(RegisterConversions)
}
// RegisterConversions adds conversion functions to the given scheme.
// Public to allow building arbitrary schemes.
func RegisterConversions(scheme *runtime.Scheme) error {
return scheme.AddGeneratedConversionFuncs(
your_sha256_hashubjectAccessReview,
your_sha256_hashubjectAccessReview,
your_sha256_hashceAttributes,
your_sha256_hashceAttributes,
your_sha256_hashibutes,
your_sha256_hashibutes,
your_sha256_hashjectAccessReview,
your_sha256_hashjectAccessReview,
your_sha256_hashfSubjectAccessReviewSpec,
your_sha256_hashfSubjectAccessReviewSpec,
your_sha256_hashssReview,
your_sha256_hashssReview,
your_sha256_hashAccessReviewSpec,
your_sha256_hashAccessReviewSpec,
your_sha256_hashctAccessReviewStatus,
your_sha256_hashctAccessReviewStatus,
)
}
func your_sha256_hashcalSubjectAccessReview(in *LocalSubjectAccessReview, out *authorization.LocalSubjectAccessReview, s conversion.Scope) error {
out.ObjectMeta = in.ObjectMeta
if err := your_sha256_hashAccessReviewSpec(&in.Spec, &out.Spec, s); err != nil {
return err
}
if err := your_sha256_hashctAccessReviewStatus(&in.Status, &out.Status, s); err != nil {
return err
}
return nil
}
// your_sha256_hashubjectAccessReview is an autogenerated conversion function.
func your_sha256_hashubjectAccessReview(in *LocalSubjectAccessReview, out *authorization.LocalSubjectAccessReview, s conversion.Scope) error {
return your_sha256_hashcalSubjectAccessReview(in, out, s)
}
func your_sha256_hashcalSubjectAccessReview(in *authorization.LocalSubjectAccessReview, out *LocalSubjectAccessReview, s conversion.Scope) error {
out.ObjectMeta = in.ObjectMeta
if err := your_sha256_hashAccessReviewSpec(&in.Spec, &out.Spec, s); err != nil {
return err
}
if err := your_sha256_hashctAccessReviewStatus(&in.Status, &out.Status, s); err != nil {
return err
}
return nil
}
// your_sha256_hashubjectAccessReview is an autogenerated conversion function.
func your_sha256_hashubjectAccessReview(in *authorization.LocalSubjectAccessReview, out *LocalSubjectAccessReview, s conversion.Scope) error {
return your_sha256_hashcalSubjectAccessReview(in, out, s)
}
func your_sha256_hashsourceAttributes(in *NonResourceAttributes, out *authorization.NonResourceAttributes, s conversion.Scope) error {
out.Path = in.Path
out.Verb = in.Verb
return nil
}
// your_sha256_hashceAttributes is an autogenerated conversion function.
func your_sha256_hashceAttributes(in *NonResourceAttributes, out *authorization.NonResourceAttributes, s conversion.Scope) error {
return your_sha256_hashsourceAttributes(in, out, s)
}
func your_sha256_hashsourceAttributes(in *authorization.NonResourceAttributes, out *NonResourceAttributes, s conversion.Scope) error {
out.Path = in.Path
out.Verb = in.Verb
return nil
}
// your_sha256_hashceAttributes is an autogenerated conversion function.
func your_sha256_hashceAttributes(in *authorization.NonResourceAttributes, out *NonResourceAttributes, s conversion.Scope) error {
return your_sha256_hashsourceAttributes(in, out, s)
}
func your_sha256_hashAttributes(in *ResourceAttributes, out *authorization.ResourceAttributes, s conversion.Scope) error {
out.Namespace = in.Namespace
out.Verb = in.Verb
out.Group = in.Group
out.Version = in.Version
out.Resource = in.Resource
out.Subresource = in.Subresource
out.Name = in.Name
return nil
}
// your_sha256_hashibutes is an autogenerated conversion function.
func your_sha256_hashibutes(in *ResourceAttributes, out *authorization.ResourceAttributes, s conversion.Scope) error {
return your_sha256_hashAttributes(in, out, s)
}
func your_sha256_hashAttributes(in *authorization.ResourceAttributes, out *ResourceAttributes, s conversion.Scope) error {
out.Namespace = in.Namespace
out.Verb = in.Verb
out.Group = in.Group
out.Version = in.Version
out.Resource = in.Resource
out.Subresource = in.Subresource
out.Name = in.Name
return nil
}
// your_sha256_hashibutes is an autogenerated conversion function.
func your_sha256_hashibutes(in *authorization.ResourceAttributes, out *ResourceAttributes, s conversion.Scope) error {
return your_sha256_hashAttributes(in, out, s)
}
func your_sha256_hashfSubjectAccessReview(in *SelfSubjectAccessReview, out *authorization.SelfSubjectAccessReview, s conversion.Scope) error {
out.ObjectMeta = in.ObjectMeta
if err := your_sha256_hashfSubjectAccessReviewSpec(&in.Spec, &out.Spec, s); err != nil {
return err
}
if err := your_sha256_hashctAccessReviewStatus(&in.Status, &out.Status, s); err != nil {
return err
}
return nil
}
// your_sha256_hashjectAccessReview is an autogenerated conversion function.
func your_sha256_hashjectAccessReview(in *SelfSubjectAccessReview, out *authorization.SelfSubjectAccessReview, s conversion.Scope) error {
return your_sha256_hashfSubjectAccessReview(in, out, s)
}
func your_sha256_hashfSubjectAccessReview(in *authorization.SelfSubjectAccessReview, out *SelfSubjectAccessReview, s conversion.Scope) error {
out.ObjectMeta = in.ObjectMeta
if err := your_sha256_hashfSubjectAccessReviewSpec(&in.Spec, &out.Spec, s); err != nil {
return err
}
if err := your_sha256_hashctAccessReviewStatus(&in.Status, &out.Status, s); err != nil {
return err
}
return nil
}
// your_sha256_hashjectAccessReview is an autogenerated conversion function.
func your_sha256_hashjectAccessReview(in *authorization.SelfSubjectAccessReview, out *SelfSubjectAccessReview, s conversion.Scope) error {
return your_sha256_hashfSubjectAccessReview(in, out, s)
}
func your_sha256_hash_SelfSubjectAccessReviewSpec(in *SelfSubjectAccessReviewSpec, out *authorization.SelfSubjectAccessReviewSpec, s conversion.Scope) error {
out.ResourceAttributes = (*authorization.ResourceAttributes)(unsafe.Pointer(in.ResourceAttributes))
out.NonResourceAttributes = (*authorization.NonResourceAttributes)(unsafe.Pointer(in.NonResourceAttributes))
return nil
}
// your_sha256_hashfSubjectAccessReviewSpec is an autogenerated conversion function.
func your_sha256_hashfSubjectAccessReviewSpec(in *SelfSubjectAccessReviewSpec, out *authorization.SelfSubjectAccessReviewSpec, s conversion.Scope) error {
return your_sha256_hash_SelfSubjectAccessReviewSpec(in, out, s)
}
func your_sha256_hash_SelfSubjectAccessReviewSpec(in *authorization.SelfSubjectAccessReviewSpec, out *SelfSubjectAccessReviewSpec, s conversion.Scope) error {
out.ResourceAttributes = (*ResourceAttributes)(unsafe.Pointer(in.ResourceAttributes))
out.NonResourceAttributes = (*NonResourceAttributes)(unsafe.Pointer(in.NonResourceAttributes))
return nil
}
// your_sha256_hashfSubjectAccessReviewSpec is an autogenerated conversion function.
func your_sha256_hashfSubjectAccessReviewSpec(in *authorization.SelfSubjectAccessReviewSpec, out *SelfSubjectAccessReviewSpec, s conversion.Scope) error {
return your_sha256_hash_SelfSubjectAccessReviewSpec(in, out, s)
}
func your_sha256_hashAccessReview(in *SubjectAccessReview, out *authorization.SubjectAccessReview, s conversion.Scope) error {
out.ObjectMeta = in.ObjectMeta
if err := your_sha256_hashAccessReviewSpec(&in.Spec, &out.Spec, s); err != nil {
return err
}
if err := your_sha256_hashctAccessReviewStatus(&in.Status, &out.Status, s); err != nil {
return err
}
return nil
}
// your_sha256_hashssReview is an autogenerated conversion function.
func your_sha256_hashssReview(in *SubjectAccessReview, out *authorization.SubjectAccessReview, s conversion.Scope) error {
return your_sha256_hashAccessReview(in, out, s)
}
func your_sha256_hashAccessReview(in *authorization.SubjectAccessReview, out *SubjectAccessReview, s conversion.Scope) error {
out.ObjectMeta = in.ObjectMeta
if err := your_sha256_hashAccessReviewSpec(&in.Spec, &out.Spec, s); err != nil {
return err
}
if err := your_sha256_hashctAccessReviewStatus(&in.Status, &out.Status, s); err != nil {
return err
}
return nil
}
// your_sha256_hashssReview is an autogenerated conversion function.
func your_sha256_hashssReview(in *authorization.SubjectAccessReview, out *SubjectAccessReview, s conversion.Scope) error {
return your_sha256_hashAccessReview(in, out, s)
}
func your_sha256_hashjectAccessReviewSpec(in *SubjectAccessReviewSpec, out *authorization.SubjectAccessReviewSpec, s conversion.Scope) error {
out.ResourceAttributes = (*authorization.ResourceAttributes)(unsafe.Pointer(in.ResourceAttributes))
out.NonResourceAttributes = (*authorization.NonResourceAttributes)(unsafe.Pointer(in.NonResourceAttributes))
out.User = in.User
out.Groups = *(*[]string)(unsafe.Pointer(&in.Groups))
out.Extra = *(*map[string]authorization.ExtraValue)(unsafe.Pointer(&in.Extra))
return nil
}
// your_sha256_hashAccessReviewSpec is an autogenerated conversion function.
func your_sha256_hashAccessReviewSpec(in *SubjectAccessReviewSpec, out *authorization.SubjectAccessReviewSpec, s conversion.Scope) error {
return your_sha256_hashjectAccessReviewSpec(in, out, s)
}
func your_sha256_hashjectAccessReviewSpec(in *authorization.SubjectAccessReviewSpec, out *SubjectAccessReviewSpec, s conversion.Scope) error {
out.ResourceAttributes = (*ResourceAttributes)(unsafe.Pointer(in.ResourceAttributes))
out.NonResourceAttributes = (*NonResourceAttributes)(unsafe.Pointer(in.NonResourceAttributes))
out.User = in.User
out.Groups = *(*[]string)(unsafe.Pointer(&in.Groups))
out.Extra = *(*map[string]ExtraValue)(unsafe.Pointer(&in.Extra))
return nil
}
// your_sha256_hashAccessReviewSpec is an autogenerated conversion function.
func your_sha256_hashAccessReviewSpec(in *authorization.SubjectAccessReviewSpec, out *SubjectAccessReviewSpec, s conversion.Scope) error {
return your_sha256_hashjectAccessReviewSpec(in, out, s)
}
func your_sha256_hashubjectAccessReviewStatus(in *SubjectAccessReviewStatus, out *authorization.SubjectAccessReviewStatus, s conversion.Scope) error {
out.Allowed = in.Allowed
out.Reason = in.Reason
out.EvaluationError = in.EvaluationError
return nil
}
// your_sha256_hashctAccessReviewStatus is an autogenerated conversion function.
func your_sha256_hashctAccessReviewStatus(in *SubjectAccessReviewStatus, out *authorization.SubjectAccessReviewStatus, s conversion.Scope) error {
return your_sha256_hashubjectAccessReviewStatus(in, out, s)
}
func your_sha256_hashubjectAccessReviewStatus(in *authorization.SubjectAccessReviewStatus, out *SubjectAccessReviewStatus, s conversion.Scope) error {
out.Allowed = in.Allowed
out.Reason = in.Reason
out.EvaluationError = in.EvaluationError
return nil
}
// your_sha256_hashctAccessReviewStatus is an autogenerated conversion function.
func your_sha256_hashctAccessReviewStatus(in *authorization.SubjectAccessReviewStatus, out *SubjectAccessReviewStatus, s conversion.Scope) error {
return your_sha256_hashubjectAccessReviewStatus(in, out, s)
}
```
|
```objective-c
/*your_sha256_hash---------
*
* tlist.h
* prototypes for tlist.c.
*
*
*
* src/include/optimizer/tlist.h
*
*your_sha256_hash---------
*/
#ifndef TLIST_H
#define TLIST_H
#include "nodes/pathnodes.h"
extern TargetEntry *tlist_member(Expr *node, List *targetlist);
extern List *add_to_flat_tlist(List *tlist, List *exprs);
extern List *get_tlist_exprs(List *tlist, bool includeJunk);
extern bool tlist_same_exprs(List *tlist1, List *tlist2);
extern bool tlist_same_datatypes(List *tlist, List *colTypes, bool junkOK);
extern bool tlist_same_collations(List *tlist, List *colCollations, bool junkOK);
extern void apply_tlist_labeling(List *dest_tlist, List *src_tlist);
extern Oid *extract_grouping_ops(List *groupClause);
extern Oid *extract_grouping_collations(List *groupClause, List *tlist);
extern AttrNumber *extract_grouping_cols(List *groupClause, List *tlist);
extern bool grouping_is_sortable(List *groupClause);
extern bool grouping_is_hashable(List *groupClause);
extern PathTarget *make_pathtarget_from_tlist(List *tlist);
extern List *make_tlist_from_pathtarget(PathTarget *target);
extern PathTarget *copy_pathtarget(PathTarget *src);
extern PathTarget *create_empty_pathtarget(void);
extern void add_column_to_pathtarget(PathTarget *target,
Expr *expr, Index sortgroupref);
extern void add_new_column_to_pathtarget(PathTarget *target, Expr *expr);
extern void add_new_columns_to_pathtarget(PathTarget *target, List *exprs);
extern void apply_pathtarget_labeling_to_tlist(List *tlist, PathTarget *target);
extern void split_pathtarget_at_srfs(PlannerInfo *root,
PathTarget *target, PathTarget *input_target,
List **targets, List **targets_contain_srfs);
/* Convenience macro to get a PathTarget with valid cost/width fields */
#define create_pathtarget(root, tlist) \
set_pathtarget_cost_width(root, make_pathtarget_from_tlist(tlist))
#endif /* TLIST_H */
```
|
```smalltalk
using System.Threading.Tasks;
namespace EspionSpotify.Spotify
{
public interface ISpotifyProcess
{
Task<ISpotifyStatus> GetSpotifyStatus();
}
}
```
|
```ruby
module Sorcery
module TestHelpers
module Rails
module Controller
def login_user(user = nil, _test_context = {})
user ||= @user
@controller.send(:auto_login, user)
@controller.send(:after_login!, user, [user.send(user.sorcery_config.username_attribute_names.first), 'secret'])
end
def logout_user
@controller.send(:logout)
end
def logged_in?
@controller.send(:logged_in?)
end
end
end
end
end
```
|
```pod
=pod
=head1 NAME
RSA_blinding_on, RSA_blinding_off - protect the RSA operation from timing attacks
=head1 SYNOPSIS
#include <openssl/rsa.h>
int RSA_blinding_on(RSA *rsa, BN_CTX *ctx);
void RSA_blinding_off(RSA *rsa);
=head1 DESCRIPTION
RSA is vulnerable to timing attacks. In a setup where attackers can
measure the time of RSA decryption or signature operations, blinding
must be used to protect the RSA operation from that attack.
RSA_blinding_on() turns blinding on for key B<rsa> and generates a
random blinding factor. B<ctx> is B<NULL> or a pre-allocated and
initialized B<BN_CTX>. The random number generator must be seeded
prior to calling RSA_blinding_on().
RSA_blinding_off() turns blinding off and frees the memory used for
the blinding factor.
=head1 RETURN VALUES
RSA_blinding_on() returns 1 on success, and 0 if an error occurred.
RSA_blinding_off() returns no value.
=head1 COPYRIGHT
in the file LICENSE in the source distribution or at
L<path_to_url
=cut
```
|
Lepidagathis dalzelliana is a species of flowering plant.
Description
Range
Habitat
Ecology
Lepidagathis dalzelliana grows on high-altitude lateritic plateaus from 1000 to 1298 m a.s.l., in accumulated soil and among small stone boulders in association with Ischaemum impressum, Lepidagathis mahakassapae, Justicia trinervia and Blumea malcolmii. It was also observed that Crematogaster sp. ants were feeding and passing the nectar droplets to each other.
Etymology
Taxonomy
References
Acanthaceae
|
```c
/*
* VP8 DSP functions x86-optimized
*
* This file is part of FFmpeg.
*
* FFmpeg is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
*
* FFmpeg is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
*
* You should have received a copy of the GNU Lesser General Public
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include "libavutil/attributes.h"
#include "libavutil/cpu.h"
#include "libavutil/mem.h"
#include "libavutil/x86/cpu.h"
#include "libavcodec/vp8dsp.h"
#if HAVE_YASM
/*
* MC functions
*/
void ff_put_vp8_epel4_h4_mmxext(uint8_t *dst, ptrdiff_t dststride,
uint8_t *src, ptrdiff_t srcstride,
int height, int mx, int my);
void ff_put_vp8_epel4_h6_mmxext(uint8_t *dst, ptrdiff_t dststride,
uint8_t *src, ptrdiff_t srcstride,
int height, int mx, int my);
void ff_put_vp8_epel4_v4_mmxext(uint8_t *dst, ptrdiff_t dststride,
uint8_t *src, ptrdiff_t srcstride,
int height, int mx, int my);
void ff_put_vp8_epel4_v6_mmxext(uint8_t *dst, ptrdiff_t dststride,
uint8_t *src, ptrdiff_t srcstride,
int height, int mx, int my);
void ff_put_vp8_epel8_h4_sse2 (uint8_t *dst, ptrdiff_t dststride,
uint8_t *src, ptrdiff_t srcstride,
int height, int mx, int my);
void ff_put_vp8_epel8_h6_sse2 (uint8_t *dst, ptrdiff_t dststride,
uint8_t *src, ptrdiff_t srcstride,
int height, int mx, int my);
void ff_put_vp8_epel8_v4_sse2 (uint8_t *dst, ptrdiff_t dststride,
uint8_t *src, ptrdiff_t srcstride,
int height, int mx, int my);
void ff_put_vp8_epel8_v6_sse2 (uint8_t *dst, ptrdiff_t dststride,
uint8_t *src, ptrdiff_t srcstride,
int height, int mx, int my);
void ff_put_vp8_epel4_h4_ssse3 (uint8_t *dst, ptrdiff_t dststride,
uint8_t *src, ptrdiff_t srcstride,
int height, int mx, int my);
void ff_put_vp8_epel4_h6_ssse3 (uint8_t *dst, ptrdiff_t dststride,
uint8_t *src, ptrdiff_t srcstride,
int height, int mx, int my);
void ff_put_vp8_epel4_v4_ssse3 (uint8_t *dst, ptrdiff_t dststride,
uint8_t *src, ptrdiff_t srcstride,
int height, int mx, int my);
void ff_put_vp8_epel4_v6_ssse3 (uint8_t *dst, ptrdiff_t dststride,
uint8_t *src, ptrdiff_t srcstride,
int height, int mx, int my);
void ff_put_vp8_epel8_h4_ssse3 (uint8_t *dst, ptrdiff_t dststride,
uint8_t *src, ptrdiff_t srcstride,
int height, int mx, int my);
void ff_put_vp8_epel8_h6_ssse3 (uint8_t *dst, ptrdiff_t dststride,
uint8_t *src, ptrdiff_t srcstride,
int height, int mx, int my);
void ff_put_vp8_epel8_v4_ssse3 (uint8_t *dst, ptrdiff_t dststride,
uint8_t *src, ptrdiff_t srcstride,
int height, int mx, int my);
void ff_put_vp8_epel8_v6_ssse3 (uint8_t *dst, ptrdiff_t dststride,
uint8_t *src, ptrdiff_t srcstride,
int height, int mx, int my);
void ff_put_vp8_bilinear4_h_mmxext(uint8_t *dst, ptrdiff_t dststride,
uint8_t *src, ptrdiff_t srcstride,
int height, int mx, int my);
void ff_put_vp8_bilinear8_h_sse2 (uint8_t *dst, ptrdiff_t dststride,
uint8_t *src, ptrdiff_t srcstride,
int height, int mx, int my);
void ff_put_vp8_bilinear4_h_ssse3 (uint8_t *dst, ptrdiff_t dststride,
uint8_t *src, ptrdiff_t srcstride,
int height, int mx, int my);
void ff_put_vp8_bilinear8_h_ssse3 (uint8_t *dst, ptrdiff_t dststride,
uint8_t *src, ptrdiff_t srcstride,
int height, int mx, int my);
void ff_put_vp8_bilinear4_v_mmxext(uint8_t *dst, ptrdiff_t dststride,
uint8_t *src, ptrdiff_t srcstride,
int height, int mx, int my);
void ff_put_vp8_bilinear8_v_sse2 (uint8_t *dst, ptrdiff_t dststride,
uint8_t *src, ptrdiff_t srcstride,
int height, int mx, int my);
void ff_put_vp8_bilinear4_v_ssse3 (uint8_t *dst, ptrdiff_t dststride,
uint8_t *src, ptrdiff_t srcstride,
int height, int mx, int my);
void ff_put_vp8_bilinear8_v_ssse3 (uint8_t *dst, ptrdiff_t dststride,
uint8_t *src, ptrdiff_t srcstride,
int height, int mx, int my);
void ff_put_vp8_pixels8_mmx (uint8_t *dst, ptrdiff_t dststride,
uint8_t *src, ptrdiff_t srcstride,
int height, int mx, int my);
void ff_put_vp8_pixels16_mmx(uint8_t *dst, ptrdiff_t dststride,
uint8_t *src, ptrdiff_t srcstride,
int height, int mx, int my);
void ff_put_vp8_pixels16_sse(uint8_t *dst, ptrdiff_t dststride,
uint8_t *src, ptrdiff_t srcstride,
int height, int mx, int my);
#define TAP_W16(OPT, FILTERTYPE, TAPTYPE) \
static void ff_put_vp8_ ## FILTERTYPE ## 16_ ## TAPTYPE ## _ ## OPT( \
uint8_t *dst, ptrdiff_t dststride, uint8_t *src, \
ptrdiff_t srcstride, int height, int mx, int my) \
{ \
ff_put_vp8_ ## FILTERTYPE ## 8_ ## TAPTYPE ## _ ## OPT( \
dst, dststride, src, srcstride, height, mx, my); \
ff_put_vp8_ ## FILTERTYPE ## 8_ ## TAPTYPE ## _ ## OPT( \
dst + 8, dststride, src + 8, srcstride, height, mx, my); \
}
#define TAP_W8(OPT, FILTERTYPE, TAPTYPE) \
static void ff_put_vp8_ ## FILTERTYPE ## 8_ ## TAPTYPE ## _ ## OPT( \
uint8_t *dst, ptrdiff_t dststride, uint8_t *src, \
ptrdiff_t srcstride, int height, int mx, int my) \
{ \
ff_put_vp8_ ## FILTERTYPE ## 4_ ## TAPTYPE ## _ ## OPT( \
dst, dststride, src, srcstride, height, mx, my); \
ff_put_vp8_ ## FILTERTYPE ## 4_ ## TAPTYPE ## _ ## OPT( \
dst + 4, dststride, src + 4, srcstride, height, mx, my); \
}
#if ARCH_X86_32
TAP_W8 (mmxext, epel, h4)
TAP_W8 (mmxext, epel, h6)
TAP_W16(mmxext, epel, h6)
TAP_W8 (mmxext, epel, v4)
TAP_W8 (mmxext, epel, v6)
TAP_W16(mmxext, epel, v6)
TAP_W8 (mmxext, bilinear, h)
TAP_W16(mmxext, bilinear, h)
TAP_W8 (mmxext, bilinear, v)
TAP_W16(mmxext, bilinear, v)
#endif
TAP_W16(sse2, epel, h6)
TAP_W16(sse2, epel, v6)
TAP_W16(sse2, bilinear, h)
TAP_W16(sse2, bilinear, v)
TAP_W16(ssse3, epel, h6)
TAP_W16(ssse3, epel, v6)
TAP_W16(ssse3, bilinear, h)
TAP_W16(ssse3, bilinear, v)
#define HVTAP(OPT, ALIGN, TAPNUMX, TAPNUMY, SIZE, MAXHEIGHT) \
static void ff_put_vp8_epel ## SIZE ## _h ## TAPNUMX ## v ## TAPNUMY ## _ ## OPT( \
uint8_t *dst, ptrdiff_t dststride, uint8_t *src, \
ptrdiff_t srcstride, int height, int mx, int my) \
{ \
LOCAL_ALIGNED(ALIGN, uint8_t, tmp, [SIZE * (MAXHEIGHT + TAPNUMY - 1)]); \
uint8_t *tmpptr = tmp + SIZE * (TAPNUMY / 2 - 1); \
src -= srcstride * (TAPNUMY / 2 - 1); \
ff_put_vp8_epel ## SIZE ## _h ## TAPNUMX ## _ ## OPT( \
tmp, SIZE, src, srcstride, height + TAPNUMY - 1, mx, my); \
ff_put_vp8_epel ## SIZE ## _v ## TAPNUMY ## _ ## OPT( \
dst, dststride, tmpptr, SIZE, height, mx, my); \
}
#if ARCH_X86_32
#define HVTAPMMX(x, y) \
HVTAP(mmxext, 8, x, y, 4, 8) \
HVTAP(mmxext, 8, x, y, 8, 16)
HVTAP(mmxext, 8, 6, 6, 16, 16)
#else
#define HVTAPMMX(x, y) \
HVTAP(mmxext, 8, x, y, 4, 8)
#endif
HVTAPMMX(4, 4)
HVTAPMMX(4, 6)
HVTAPMMX(6, 4)
HVTAPMMX(6, 6)
#define HVTAPSSE2(x, y, w) \
HVTAP(sse2, 16, x, y, w, 16) \
HVTAP(ssse3, 16, x, y, w, 16)
HVTAPSSE2(4, 4, 8)
HVTAPSSE2(4, 6, 8)
HVTAPSSE2(6, 4, 8)
HVTAPSSE2(6, 6, 8)
HVTAPSSE2(6, 6, 16)
HVTAP(ssse3, 16, 4, 4, 4, 8)
HVTAP(ssse3, 16, 4, 6, 4, 8)
HVTAP(ssse3, 16, 6, 4, 4, 8)
HVTAP(ssse3, 16, 6, 6, 4, 8)
#define HVBILIN(OPT, ALIGN, SIZE, MAXHEIGHT) \
static void ff_put_vp8_bilinear ## SIZE ## _hv_ ## OPT( \
uint8_t *dst, ptrdiff_t dststride, uint8_t *src, \
ptrdiff_t srcstride, int height, int mx, int my) \
{ \
LOCAL_ALIGNED(ALIGN, uint8_t, tmp, [SIZE * (MAXHEIGHT + 2)]); \
ff_put_vp8_bilinear ## SIZE ## _h_ ## OPT( \
tmp, SIZE, src, srcstride, height + 1, mx, my); \
ff_put_vp8_bilinear ## SIZE ## _v_ ## OPT( \
dst, dststride, tmp, SIZE, height, mx, my); \
}
HVBILIN(mmxext, 8, 4, 8)
#if ARCH_X86_32
HVBILIN(mmxext, 8, 8, 16)
HVBILIN(mmxext, 8, 16, 16)
#endif
HVBILIN(sse2, 8, 8, 16)
HVBILIN(sse2, 8, 16, 16)
HVBILIN(ssse3, 8, 4, 8)
HVBILIN(ssse3, 8, 8, 16)
HVBILIN(ssse3, 8, 16, 16)
void ff_vp8_idct_dc_add_mmx(uint8_t *dst, int16_t block[16],
ptrdiff_t stride);
void ff_vp8_idct_dc_add_sse4(uint8_t *dst, int16_t block[16],
ptrdiff_t stride);
void ff_vp8_idct_dc_add4y_mmx(uint8_t *dst, int16_t block[4][16],
ptrdiff_t stride);
void ff_vp8_idct_dc_add4y_sse2(uint8_t *dst, int16_t block[4][16],
ptrdiff_t stride);
void ff_vp8_idct_dc_add4uv_mmx(uint8_t *dst, int16_t block[2][16],
ptrdiff_t stride);
void ff_vp8_luma_dc_wht_mmx(int16_t block[4][4][16], int16_t dc[16]);
void ff_vp8_luma_dc_wht_sse(int16_t block[4][4][16], int16_t dc[16]);
void ff_vp8_idct_add_mmx(uint8_t *dst, int16_t block[16], ptrdiff_t stride);
void ff_vp8_idct_add_sse(uint8_t *dst, int16_t block[16], ptrdiff_t stride);
#define DECLARE_LOOP_FILTER(NAME) \
void ff_vp8_v_loop_filter_simple_ ## NAME(uint8_t *dst, \
ptrdiff_t stride, \
int flim); \
void ff_vp8_h_loop_filter_simple_ ## NAME(uint8_t *dst, \
ptrdiff_t stride, \
int flim); \
void ff_vp8_v_loop_filter16y_inner_ ## NAME (uint8_t *dst, \
ptrdiff_t stride, \
int e, int i, int hvt); \
void ff_vp8_h_loop_filter16y_inner_ ## NAME (uint8_t *dst, \
ptrdiff_t stride, \
int e, int i, int hvt); \
void ff_vp8_v_loop_filter8uv_inner_ ## NAME (uint8_t *dstU, \
uint8_t *dstV, \
ptrdiff_t s, \
int e, int i, int hvt); \
void ff_vp8_h_loop_filter8uv_inner_ ## NAME (uint8_t *dstU, \
uint8_t *dstV, \
ptrdiff_t s, \
int e, int i, int hvt); \
void ff_vp8_v_loop_filter16y_mbedge_ ## NAME(uint8_t *dst, \
ptrdiff_t stride, \
int e, int i, int hvt); \
void ff_vp8_h_loop_filter16y_mbedge_ ## NAME(uint8_t *dst, \
ptrdiff_t stride, \
int e, int i, int hvt); \
void ff_vp8_v_loop_filter8uv_mbedge_ ## NAME(uint8_t *dstU, \
uint8_t *dstV, \
ptrdiff_t s, \
int e, int i, int hvt); \
void ff_vp8_h_loop_filter8uv_mbedge_ ## NAME(uint8_t *dstU, \
uint8_t *dstV, \
ptrdiff_t s, \
int e, int i, int hvt);
DECLARE_LOOP_FILTER(mmx)
DECLARE_LOOP_FILTER(mmxext)
DECLARE_LOOP_FILTER(sse2)
DECLARE_LOOP_FILTER(ssse3)
DECLARE_LOOP_FILTER(sse4)
#endif /* HAVE_YASM */
#define VP8_LUMA_MC_FUNC(IDX, SIZE, OPT) \
c->put_vp8_epel_pixels_tab[IDX][0][2] = ff_put_vp8_epel ## SIZE ## _h6_ ## OPT; \
c->put_vp8_epel_pixels_tab[IDX][2][0] = ff_put_vp8_epel ## SIZE ## _v6_ ## OPT; \
c->put_vp8_epel_pixels_tab[IDX][2][2] = ff_put_vp8_epel ## SIZE ## _h6v6_ ## OPT
#define VP8_MC_FUNC(IDX, SIZE, OPT) \
c->put_vp8_epel_pixels_tab[IDX][0][1] = ff_put_vp8_epel ## SIZE ## _h4_ ## OPT; \
c->put_vp8_epel_pixels_tab[IDX][1][0] = ff_put_vp8_epel ## SIZE ## _v4_ ## OPT; \
c->put_vp8_epel_pixels_tab[IDX][1][1] = ff_put_vp8_epel ## SIZE ## _h4v4_ ## OPT; \
c->put_vp8_epel_pixels_tab[IDX][1][2] = ff_put_vp8_epel ## SIZE ## _h6v4_ ## OPT; \
c->put_vp8_epel_pixels_tab[IDX][2][1] = ff_put_vp8_epel ## SIZE ## _h4v6_ ## OPT; \
VP8_LUMA_MC_FUNC(IDX, SIZE, OPT)
#define VP8_BILINEAR_MC_FUNC(IDX, SIZE, OPT) \
c->put_vp8_bilinear_pixels_tab[IDX][0][1] = ff_put_vp8_bilinear ## SIZE ## _h_ ## OPT; \
c->put_vp8_bilinear_pixels_tab[IDX][0][2] = ff_put_vp8_bilinear ## SIZE ## _h_ ## OPT; \
c->put_vp8_bilinear_pixels_tab[IDX][1][0] = ff_put_vp8_bilinear ## SIZE ## _v_ ## OPT; \
c->put_vp8_bilinear_pixels_tab[IDX][1][1] = ff_put_vp8_bilinear ## SIZE ## _hv_ ## OPT; \
c->put_vp8_bilinear_pixels_tab[IDX][1][2] = ff_put_vp8_bilinear ## SIZE ## _hv_ ## OPT; \
c->put_vp8_bilinear_pixels_tab[IDX][2][0] = ff_put_vp8_bilinear ## SIZE ## _v_ ## OPT; \
c->put_vp8_bilinear_pixels_tab[IDX][2][1] = ff_put_vp8_bilinear ## SIZE ## _hv_ ## OPT; \
c->put_vp8_bilinear_pixels_tab[IDX][2][2] = ff_put_vp8_bilinear ## SIZE ## _hv_ ## OPT
av_cold void ff_vp78dsp_init_x86(VP8DSPContext *c)
{
#if HAVE_YASM
int cpu_flags = av_get_cpu_flags();
if (EXTERNAL_MMX(cpu_flags)) {
#if ARCH_X86_32
c->put_vp8_epel_pixels_tab[0][0][0] =
c->put_vp8_bilinear_pixels_tab[0][0][0] = ff_put_vp8_pixels16_mmx;
#endif
c->put_vp8_epel_pixels_tab[1][0][0] =
c->put_vp8_bilinear_pixels_tab[1][0][0] = ff_put_vp8_pixels8_mmx;
}
/* note that 4-tap width=16 functions are missing because w=16
* is only used for luma, and luma is always a copy or sixtap. */
if (EXTERNAL_MMXEXT(cpu_flags)) {
VP8_MC_FUNC(2, 4, mmxext);
VP8_BILINEAR_MC_FUNC(2, 4, mmxext);
#if ARCH_X86_32
VP8_LUMA_MC_FUNC(0, 16, mmxext);
VP8_MC_FUNC(1, 8, mmxext);
VP8_BILINEAR_MC_FUNC(0, 16, mmxext);
VP8_BILINEAR_MC_FUNC(1, 8, mmxext);
#endif
}
if (EXTERNAL_SSE(cpu_flags)) {
c->put_vp8_epel_pixels_tab[0][0][0] =
c->put_vp8_bilinear_pixels_tab[0][0][0] = ff_put_vp8_pixels16_sse;
}
if (HAVE_SSE2_EXTERNAL && cpu_flags & (AV_CPU_FLAG_SSE2 | AV_CPU_FLAG_SSE2SLOW)) {
VP8_LUMA_MC_FUNC(0, 16, sse2);
VP8_MC_FUNC(1, 8, sse2);
VP8_BILINEAR_MC_FUNC(0, 16, sse2);
VP8_BILINEAR_MC_FUNC(1, 8, sse2);
}
if (EXTERNAL_SSSE3(cpu_flags)) {
VP8_LUMA_MC_FUNC(0, 16, ssse3);
VP8_MC_FUNC(1, 8, ssse3);
VP8_MC_FUNC(2, 4, ssse3);
VP8_BILINEAR_MC_FUNC(0, 16, ssse3);
VP8_BILINEAR_MC_FUNC(1, 8, ssse3);
VP8_BILINEAR_MC_FUNC(2, 4, ssse3);
}
#endif /* HAVE_YASM */
}
av_cold void ff_vp8dsp_init_x86(VP8DSPContext *c)
{
#if HAVE_YASM
int cpu_flags = av_get_cpu_flags();
if (EXTERNAL_MMX(cpu_flags)) {
c->vp8_idct_dc_add = ff_vp8_idct_dc_add_mmx;
c->vp8_idct_dc_add4uv = ff_vp8_idct_dc_add4uv_mmx;
#if ARCH_X86_32
c->vp8_idct_dc_add4y = ff_vp8_idct_dc_add4y_mmx;
c->vp8_idct_add = ff_vp8_idct_add_mmx;
c->vp8_luma_dc_wht = ff_vp8_luma_dc_wht_mmx;
c->vp8_v_loop_filter_simple = ff_vp8_v_loop_filter_simple_mmx;
c->vp8_h_loop_filter_simple = ff_vp8_h_loop_filter_simple_mmx;
c->vp8_v_loop_filter16y_inner = ff_vp8_v_loop_filter16y_inner_mmx;
c->vp8_h_loop_filter16y_inner = ff_vp8_h_loop_filter16y_inner_mmx;
c->vp8_v_loop_filter8uv_inner = ff_vp8_v_loop_filter8uv_inner_mmx;
c->vp8_h_loop_filter8uv_inner = ff_vp8_h_loop_filter8uv_inner_mmx;
c->vp8_v_loop_filter16y = ff_vp8_v_loop_filter16y_mbedge_mmx;
c->vp8_h_loop_filter16y = ff_vp8_h_loop_filter16y_mbedge_mmx;
c->vp8_v_loop_filter8uv = ff_vp8_v_loop_filter8uv_mbedge_mmx;
c->vp8_h_loop_filter8uv = ff_vp8_h_loop_filter8uv_mbedge_mmx;
#endif
}
/* note that 4-tap width=16 functions are missing because w=16
* is only used for luma, and luma is always a copy or sixtap. */
if (EXTERNAL_MMXEXT(cpu_flags)) {
#if ARCH_X86_32
c->vp8_v_loop_filter_simple = ff_vp8_v_loop_filter_simple_mmxext;
c->vp8_h_loop_filter_simple = ff_vp8_h_loop_filter_simple_mmxext;
c->vp8_v_loop_filter16y_inner = ff_vp8_v_loop_filter16y_inner_mmxext;
c->vp8_h_loop_filter16y_inner = ff_vp8_h_loop_filter16y_inner_mmxext;
c->vp8_v_loop_filter8uv_inner = ff_vp8_v_loop_filter8uv_inner_mmxext;
c->vp8_h_loop_filter8uv_inner = ff_vp8_h_loop_filter8uv_inner_mmxext;
c->vp8_v_loop_filter16y = ff_vp8_v_loop_filter16y_mbedge_mmxext;
c->vp8_h_loop_filter16y = ff_vp8_h_loop_filter16y_mbedge_mmxext;
c->vp8_v_loop_filter8uv = ff_vp8_v_loop_filter8uv_mbedge_mmxext;
c->vp8_h_loop_filter8uv = ff_vp8_h_loop_filter8uv_mbedge_mmxext;
#endif
}
if (EXTERNAL_SSE(cpu_flags)) {
c->vp8_idct_add = ff_vp8_idct_add_sse;
c->vp8_luma_dc_wht = ff_vp8_luma_dc_wht_sse;
}
if (HAVE_SSE2_EXTERNAL && cpu_flags & (AV_CPU_FLAG_SSE2 | AV_CPU_FLAG_SSE2SLOW)) {
c->vp8_v_loop_filter_simple = ff_vp8_v_loop_filter_simple_sse2;
c->vp8_v_loop_filter16y_inner = ff_vp8_v_loop_filter16y_inner_sse2;
c->vp8_v_loop_filter8uv_inner = ff_vp8_v_loop_filter8uv_inner_sse2;
c->vp8_v_loop_filter16y = ff_vp8_v_loop_filter16y_mbedge_sse2;
c->vp8_v_loop_filter8uv = ff_vp8_v_loop_filter8uv_mbedge_sse2;
}
if (EXTERNAL_SSE2(cpu_flags)) {
c->vp8_idct_dc_add4y = ff_vp8_idct_dc_add4y_sse2;
c->vp8_h_loop_filter_simple = ff_vp8_h_loop_filter_simple_sse2;
c->vp8_h_loop_filter16y_inner = ff_vp8_h_loop_filter16y_inner_sse2;
c->vp8_h_loop_filter8uv_inner = ff_vp8_h_loop_filter8uv_inner_sse2;
c->vp8_h_loop_filter16y = ff_vp8_h_loop_filter16y_mbedge_sse2;
c->vp8_h_loop_filter8uv = ff_vp8_h_loop_filter8uv_mbedge_sse2;
}
if (EXTERNAL_SSSE3(cpu_flags)) {
c->vp8_v_loop_filter_simple = ff_vp8_v_loop_filter_simple_ssse3;
c->vp8_h_loop_filter_simple = ff_vp8_h_loop_filter_simple_ssse3;
c->vp8_v_loop_filter16y_inner = ff_vp8_v_loop_filter16y_inner_ssse3;
c->vp8_h_loop_filter16y_inner = ff_vp8_h_loop_filter16y_inner_ssse3;
c->vp8_v_loop_filter8uv_inner = ff_vp8_v_loop_filter8uv_inner_ssse3;
c->vp8_h_loop_filter8uv_inner = ff_vp8_h_loop_filter8uv_inner_ssse3;
c->vp8_v_loop_filter16y = ff_vp8_v_loop_filter16y_mbedge_ssse3;
c->vp8_h_loop_filter16y = ff_vp8_h_loop_filter16y_mbedge_ssse3;
c->vp8_v_loop_filter8uv = ff_vp8_v_loop_filter8uv_mbedge_ssse3;
c->vp8_h_loop_filter8uv = ff_vp8_h_loop_filter8uv_mbedge_ssse3;
}
if (EXTERNAL_SSE4(cpu_flags)) {
c->vp8_idct_dc_add = ff_vp8_idct_dc_add_sse4;
c->vp8_h_loop_filter_simple = ff_vp8_h_loop_filter_simple_sse4;
c->vp8_h_loop_filter16y = ff_vp8_h_loop_filter16y_mbedge_sse4;
c->vp8_h_loop_filter8uv = ff_vp8_h_loop_filter8uv_mbedge_sse4;
}
#endif /* HAVE_YASM */
}
```
|
```xml
<?xml version="1.0" encoding="UTF-8" ?>
<!DOCTYPE mapper PUBLIC "-//mybatis.org//DTD Mapper 3.0//EN" "path_to_url" >
<mapper namespace="com.crossoverjie.kafka.orderconsumer.mapper.StockMapper" >
<resultMap id="BaseResultMap" type="com.crossoverjie.kafka.orderconsumer.pojo.Stock" >
<!--
WARNING - @mbg.generated
-->
<id column="id" property="id" jdbcType="INTEGER" />
<result column="name" property="name" jdbcType="VARCHAR" />
<result column="count" property="count" jdbcType="INTEGER" />
<result column="sale" property="sale" jdbcType="INTEGER" />
<result column="version" property="version" jdbcType="INTEGER" />
</resultMap>
</mapper>
```
|
```yaml
category: Data Enrichment & Threat Intelligence
commonfields:
id: Xpanse Feed
version: -1
sectionOrder:
- Connect
- Collect
configuration:
- additionalinfo: The web UI with `api-` appended to front (e.g., path_to_url For more information, see path_to_url
display: Server URL
name: url
required: true
type: 0
- additionalinfo: For more information, see path_to_url Only standard API key type is supported.
display: API Key ID
displaypassword: API Key
name: credentials
required: true
type: 9
- defaultvalue: 'true'
display: Fetch indicators
name: feed
type: 8
section: Collect
required: false
- additionalinfo: Indicators from this integration instance will be marked with this reputation.
section: Collect
display: Indicator Reputation
name: feedReputation
defaultvalue: Good
options:
- None
- Good
- Suspicious
- Bad
type: 18
required: false
- additionalinfo: Reliability of the source providing the intelligence data.
defaultvalue: A - Completely reliable
display: Source Reliability
name: feedReliability
options:
- A - Completely reliable
- B - Usually reliable
- C - Fairly reliable
- D - Not usually reliable
- E - Unreliable
- F - Reliability cannot be judged
required: true
type: 15
section: Collect
- additionalinfo: The Traffic Light Protocol (TLP) designation to apply to indicators fetched from the feed.
defaultvalue: CLEAR
display: Traffic Light Protocol Color
name: tlp_color
options:
- RED
- AMBER+STRICT
- AMBER
- GREEN
- CLEAR
type: 15
section: Collect
required: false
- defaultvalue: '20160'
display: ''
name: feedExpirationInterval
type: 1
required: false
- additionalinfo: When selected, the exclusion list is ignored for indicators from this feed. This means that if an indicator from this feed is on the exclusion list, the indicator might still be added to the system.
defaultvalue: 'false'
display: Bypass exclusion list
name: feedBypassExclusionList
type: 8
section: Collect
advanced: true
required: false
- display: Use system proxy settings
name: proxy
type: 8
section: Connect
advanced: true
required: false
- defaultvalue: 'false'
display: Trust any certificate (not secure)
name: insecure
type: 8
section: Connect
advanced: true
required: false
- additionalinfo: Supports CSV values.
display: Tags
name: feedTags
type: 0
section: Collect
advanced: true
required: false
- name: feedExpirationPolicy
defaultvalue: suddenDeath
display: ''
type: 17
options:
- never
- interval
- indicatorType
- suddenDeath
section: Collect
required: false
- defaultvalue: '1440'
name: feedFetchInterval
display: Feed Fetch Interval
type: 19
section: Collect
advanced: true
required: false
description: Use this feed to retrieve the discovered IPs/Domains/Certificates from Cortex Xpanse asset database.
display: 'Xpanse Feed'
name: Xpanse Feed
script:
commands:
- arguments:
- description: The maximum number of indicators to return.
name: limit
required: true
- defaultValue: yes
description: Retrieve discovered IPs.
name: ip
- defaultValue: yes
description: Retrieve discovered domains.
name: domain
- defaultValue: yes
description: Retrieve discovered certificates.
name: certificate
description: Retrieves a limited number of indicators.
name: xpanse-get-indicators
outputs:
- contextPath: ASM.Indicators.Name
description: The name of the indicator.
type: String
- contextPath: ASM.Indicators.Description
description: The description of the indicator.
type: String
- contextPath: ASM.Indicators.Type
description: The type of the indicator.
type: String
feed: true
script: '-'
type: python
subtype: python3
dockerimage: demisto/python3:3.10.14.96411
fromversion: 6.10.0
tests:
- No tests (auto formatted)
```
|
Party pills, also known as "herbal highs", "pep pills" "dance pills" and "natural power", is a colloquialism for a type of recreational drug whose main ingredient was originally benzylpiperazine (BZP), but has expanded to a wide range of compounds with a variety of effects. BZP is banned in a few countries, including the USA, Republic of Ireland, Australia and New Zealand, but is available on a more or less restricted basis in many jurisdictions. A range of other piperazine derivatives have also been sold as ingredients in party pills, and many of these branded "proprietary blends" have subsequently been sold in countries around the world.
Piperazine derivatives sold in this way include BZP, TFMPP, MeOPP, pFPP and several others. mCPP has rarely been sold as a party pill ingredient due to its tendency to cause migraine headaches. These piperazines are usually mixed with other ingredients such as caffeine, 5-HTP, Oxedrine (which has close effects to ephedrine), Camelia sinensis and a range of vitamins, minerals, amino acids and binders to make party pills.
In countries such as New Zealand where BZP and related piperazines have been made illegal, there is now increasing commercial interest in piperazine-free "party pills" which are purported to produce similar effects with ingredients that will circumvent the ban. Common active ingredients (among many others) include caffeine, theobromine, other stimulant alkaloids, octopamine, blue lotus extract (Nymphaea caerulea), natural sources of the LSD precursor and weak psychedelic agent lysergic acid amide (illegal in many countries), passionflower (sedative which contains monoamine oxidase inhibitors), Citrus aurantium (contains small amounts of the stimulant synephrine), glaucine (plant derived compound usually used as cough medicine), and geranamine (alkylamine compound found in geranium oil).
News and legality
Party pills and their legal status are often in the news. Matt Bowden, one of the original distributors of such pills was interviewed when issues involving party pills arose in the media. A clinical trial by ClubStargate for a pill named Ease was suspended because it contained methylone, which was claimed by the Ministry of Health to fall under New Zealand controlled drug analogue laws (although this was never proven in court).
New Zealand has classified BZP-based party pills as a "Restricted Substance" by the Misuse of Drugs Act and restricted to those over 18 years. For more on the legal issues posed by party pills, see benzylpiperazine.
In late June 2007, BZP was classed as a Class C drug in New Zealand and its availability was banned by a law passed on 13 March 2008, with a six-month amnesty period. It was not long before BZP-free alternatives appeared. Despite this, the ingredients used in the new products lacked the potency of the BZP based pills. This subsequently led to a decline in the popularity of party pills.
See also
Benzylpiperazine
Methylhexanamine
TFMPP
MeOPP
pFPP
Ecstasy (drug)
Drug abuse
Recreational drug use
Designer drug
Spice (drug)
Club drug
References
Drug culture
|
Abdihakim Luqman is a Somali politician and current Speaker of Hirshabelle State Parliament.
References
Somalian politicians
1979 births
Living people
|
```java
/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
*
* Subject to the condition set forth below, permission is hereby granted to any
* person obtaining a copy of this software, associated documentation and/or
* data (collectively the "Software"), free of charge and under any and all
* copyright rights in the Software, and any and all patent rights owned or
* freely licensable by each licensor hereunder covering either (i) the
* unmodified Software as contributed to or provided by such licensor, or (ii)
* the Larger Works (as defined below), to deal in both
*
* (a) the Software, and
*
* (b) any piece of software and/or hardware listed in the lrgrwrks.txt file if
* one is included with the Software each a "Larger Work" to which the Software
* is contributed by such licensors),
*
* without restriction, including without limitation the rights to copy, create
* derivative works of, display, perform, and distribute the Software and make,
* use, sell, offer for sale, import, export, have made, and have sold the
* Software and the Larger Work(s), and to sublicense the foregoing rights on
* either these or other terms.
*
* This license is subject to the following condition:
*
* The above copyright notice and either this complete permission notice or at a
* minimum a reference to the UPL must be included in all copies or substantial
* portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
package org.graalvm.wasm.predefined.emscripten;
import org.graalvm.wasm.WasmConstant;
import org.graalvm.wasm.WasmContext;
import org.graalvm.wasm.WasmInstance;
import org.graalvm.wasm.WasmLanguage;
import org.graalvm.wasm.WasmModule;
import org.graalvm.wasm.predefined.WasmBuiltinRootNode;
import com.oracle.truffle.api.frame.VirtualFrame;
public class EmscriptenNotifyMemoryGrowthNode extends WasmBuiltinRootNode {
public EmscriptenNotifyMemoryGrowthNode(WasmLanguage language, WasmModule module) {
super(language, module);
}
@Override
public Object executeWithContext(VirtualFrame frame, WasmContext context, WasmInstance instance) {
return WasmConstant.VOID;
}
@Override
public String builtinNodeName() {
return "_emscripten_notify_memory_growth";
}
}
```
|
```yaml
zeebe:
broker:
exporters:
# Elasticsearch Exporter ----------
# An example configuration for the elasticsearch exporter:
#
# These setting can also be overridden using the environment variables "ZEEBE_BROKER_EXPORTERS_ELASTICSEARCH_..."
#
elasticsearch:
className: io.camunda.zeebe.exporter.ElasticsearchExporter
#
args:
url: path_to_url
#
# bulk:
# delay: 5
# size: 1000
# memoryLimit: 10485760
#
authentication:
username: elastic
password: changeme
#
# index:
# prefix: zeebe-record
# createTemplate: true
#
# numberOfShards: 3
# numberOfReplicas: 0
#
# command: false
# event: true
# rejection: false
#
# deployment: false
# process: true
# error: true
# incident: true
# job: true
# jobBatch: false
# message: false
# messageSubscription: false
# variable: true
# variableDocument: true
# processInstance: true
# processInstanceCreation: true
# processMessageSubscription: false
```
|
```xml
<!-- drawable/gauge.xml -->
<vector xmlns:android="path_to_url"
android:height="24dp"
android:width="24dp"
android:viewportWidth="24"
android:viewportHeight="24">
<path android:fillColor="#000" android:pathData="M12,2A10,10 0 0,0 2,12A10,10 0 0,0 12,22A10,10 0 0,0 22,12A10,10 0 0,0 12,2M12,4A8,8 0 0,1 20,12C20,14.4 19,16.5 17.3,18C15.9,16.7 14,16 12,16C10,16 8.2,16.7 6.7,18C5,16.5 4,14.4 4,12A8,8 0 0,1 12,4M14,5.89C13.62,5.9 13.26,6.15 13.1,6.54L11.81,9.77L11.71,10C11,10.13 10.41,10.6 10.14,11.26C9.73,12.29 10.23,13.45 11.26,13.86C12.29,14.27 13.45,13.77 13.86,12.74C14.12,12.08 14,11.32 13.57,10.76L13.67,10.5L14.96,7.29L14.97,7.26C15.17,6.75 14.92,6.17 14.41,5.96C14.28,5.91 14.15,5.89 14,5.89M10,6A1,1 0 0,0 9,7A1,1 0 0,0 10,8A1,1 0 0,0 11,7A1,1 0 0,0 10,6M7,9A1,1 0 0,0 6,10A1,1 0 0,0 7,11A1,1 0 0,0 8,10A1,1 0 0,0 7,9M17,9A1,1 0 0,0 16,10A1,1 0 0,0 17,11A1,1 0 0,0 18,10A1,1 0 0,0 17,9Z" />
</vector>
```
|
Gunthoti Venkata Subbaiah was an Indian politician from YSR Congress Party. He was elected as a member of the Andhra Pradesh Legislative Assembly from Badvel. On March 28, 2021, Venkata Subbaiah died in a private hospital at Kadapa after suffering from protracted illness for a long time.
References
1950s births
2021 deaths
Year of birth missing
21st-century Indian politicians
People from Darbhanga district
YSR Congress Party politicians
Andhra Pradesh MLAs 2019–2024
|
```smalltalk
using System.Collections.Generic;
using System.Diagnostics.Contracts;
namespace Microsoft.Dafny;
/// <summary>
/// An ExprDotName desugars into either an IdentifierExpr (if the Lhs is a static name) or a MemberSelectExpr (if the Lhs is a computed expression).
/// </summary>
public class ExprDotName : SuffixExpr, ICloneable<ExprDotName> {
public readonly string SuffixName;
public readonly List<Type> OptTypeArguments;
/// <summary>
/// Because the resolved expression only points to the final resolved declaration,
/// but not the declaration of the Lhs, we must also include the Lhs.
/// </summary>
public override IEnumerable<INode> Children => ResolvedExpression == null
? new[] { Lhs }
: new[] { Lhs, ResolvedExpression };
[ContractInvariantMethod]
void ObjectInvariant() {
Contract.Invariant(SuffixName != null);
}
public ExprDotName Clone(Cloner cloner) {
return new ExprDotName(cloner, this);
}
public ExprDotName(Cloner cloner, ExprDotName original) : base(cloner, original) {
SuffixName = original.SuffixName;
OptTypeArguments = original.OptTypeArguments?.ConvertAll(cloner.CloneType);
}
public ExprDotName(IToken tok, Expression obj, string suffixName, List<Type> optTypeArguments)
: base(tok, obj) {
Contract.Requires(tok != null);
Contract.Requires(obj != null);
Contract.Requires(suffixName != null);
this.SuffixName = suffixName;
OptTypeArguments = optTypeArguments;
}
}
```
|
```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 resolve = require( 'path' ).resolve;
var tape = require( 'tape' );
var IS_BROWSER = require( '@stdlib/assert/is-browser' );
var headerDir = require( './../lib' );
// VARIABLES //
var opts = {
'skip': IS_BROWSER
};
// TESTS //
tape( 'main export is a string', opts, function test( t ) {
t.ok( true, __filename );
t.strictEqual( typeof headerDir, 'string', 'main export is a string' );
t.end();
});
tape( 'the exported value corresponds to the package directory containing header files', opts, function test( t ) {
var dir = resolve( __dirname, '..', 'include' );
t.strictEqual( headerDir, dir, 'exports expected value' );
t.end();
});
```
|
At least two ships of the French Navy have been named Brestois:
, a launched in 1927 and sunk in 1942.
, a launched in 1952 and expended as a target in 1976 .
French Navy ship names
|
Patricia Lorenz (born 18 September 1963) is an Austrian field hockey player. She competed in the women's tournament at the 1980 Summer Olympics.
References
External links
1963 births
Living people
Austrian female field hockey players
Olympic field hockey players for Austria
Field hockey players at the 1980 Summer Olympics
Field hockey players from Vienna
|
The Many Faces of Oliver Hart is a studio album by Eyedea, released under the pseudonym Oliver Hart. It was released on Rhymesayers Entertainment in 2002. In 2014, a vinyl edition of the album was released as a Record Store Day exclusive. The Village Voice included it on the "10 Must-Have Record Store Day Releases" list.
In 2011, Complex placed "Bottle Dreams" at number 11 on the "25 Best Rhymesayers Songs" list. In 2015, City Pages placed "Forget Me" at number 4 on the "Slug's 10 Best Deep Cuts" list.
Track listing
References
External links
2002 debut albums
Rhymesayers Entertainment albums
|
```c
/**
* @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.
*/
#include "stdlib/stats/base/dsvariance.h"
#include <stdlib.h>
#include <stdio.h>
#include <math.h>
#include <time.h>
#include <sys/time.h>
#define NAME "dsvariance"
#define ITERATIONS 1000000
#define REPEATS 3
#define MIN 1
#define MAX 6
/**
* Prints the TAP version.
*/
static void print_version( void ) {
printf( "TAP version 13\n" );
}
/**
* Prints the TAP summary.
*
* @param total total number of tests
* @param passing total number of passing tests
*/
static void print_summary( int total, int passing ) {
printf( "#\n" );
printf( "1..%d\n", total ); // TAP plan
printf( "# total %d\n", total );
printf( "# pass %d\n", passing );
printf( "#\n" );
printf( "# ok\n" );
}
/**
* Prints benchmarks results.
*
* @param iterations number of iterations
* @param elapsed elapsed time in seconds
*/
static void print_results( int iterations, double elapsed ) {
double rate = (double)iterations / elapsed;
printf( " ---\n" );
printf( " iterations: %d\n", iterations );
printf( " elapsed: %0.9f\n", elapsed );
printf( " rate: %0.9f\n", rate );
printf( " ...\n" );
}
/**
* Returns a clock time.
*
* @return clock time
*/
static double tic( void ) {
struct timeval now;
gettimeofday( &now, NULL );
return (double)now.tv_sec + (double)now.tv_usec/1.0e6;
}
/**
* Generates a random number on the interval [0,1).
*
* @return random number
*/
static float rand_float( void ) {
int r = rand();
return (float)r / ( (float)RAND_MAX + 1.0f );
}
/**
* Runs a benchmark.
*
* @param iterations number of iterations
* @param len array length
* @return elapsed time in seconds
*/
static double benchmark( int iterations, int len ) {
double elapsed;
float x[ len ];
double v;
double t;
int i;
for ( i = 0; i < len; i++ ) {
x[ i ] = ( rand_float() * 20000.0f ) - 10000.0f;
}
v = 0.0;
t = tic();
for ( i = 0; i < iterations; i++ ) {
v = stdlib_strided_dsvariance( len, 1.0f, x, 1 );
if ( v != v ) {
printf( "should not return NaN\n" );
break;
}
}
elapsed = tic() - t;
if ( v != v ) {
printf( "should not return NaN\n" );
}
return elapsed;
}
/**
* Main execution sequence.
*/
int main( void ) {
double elapsed;
int count;
int iter;
int len;
int i;
int j;
// Use the current time to seed the random number generator:
srand( time( NULL ) );
print_version();
count = 0;
for ( i = MIN; i <= MAX; i++ ) {
len = pow( 10, i );
iter = ITERATIONS / pow( 10, i-1 );
for ( j = 0; j < REPEATS; j++ ) {
count += 1;
printf( "# c::%s:len=%d\n", NAME, len );
elapsed = benchmark( iter, len );
print_results( iter, elapsed );
printf( "ok %d benchmark finished\n", count );
}
}
print_summary( count, count );
}
```
|
```smalltalk
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
/// <summary>
/// Nothing - just priny void
/// </summary>
internal class VoidType : BaseType
{
public override string TypeName => $"void";
public override string TypeNameFrom => $"void";
public override string Return( string varname ) => "";
public override bool IsVoid => true;
}
```
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.