text
stringlengths 1
22.8M
|
|---|
```java
//your_sha256_hash--------------------------------//
// //
// S l u r s B u i l d e r //
// //
//your_sha256_hash--------------------------------//
// <editor-fold defaultstate="collapsed" desc="hdr">
//
//
// This program is free software: you can redistribute it and/or modify it under the terms of the
//
// This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
// without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
//
// program. If not, see <path_to_url
//your_sha256_hash--------------------------------//
// </editor-fold>
package org.audiveris.omr.sheet.curve;
import org.audiveris.omr.constant.Constant;
import org.audiveris.omr.constant.ConstantSet;
import org.audiveris.omr.math.Circle;
import org.audiveris.omr.score.Page;
import org.audiveris.omr.sheet.Part;
import org.audiveris.omr.sheet.Scale;
import org.audiveris.omr.sheet.Staff;
import org.audiveris.omr.sheet.SystemInfo;
import org.audiveris.omr.sheet.SystemManager;
import static org.audiveris.omr.sheet.curve.ArcShape.STAFF_ARC;
import org.audiveris.omr.sheet.grid.LineInfo;
import org.audiveris.omr.sig.GradeImpacts;
import org.audiveris.omr.sig.SIGraph;
import org.audiveris.omr.sig.inter.HeadChordInter;
import org.audiveris.omr.sig.inter.HeadInter;
import org.audiveris.omr.sig.inter.Inter;
import org.audiveris.omr.sig.inter.Inters;
import org.audiveris.omr.sig.inter.SlurInter;
import org.audiveris.omr.sig.relation.Relation;
import org.audiveris.omr.sig.relation.SlurHeadRelation;
import org.audiveris.omr.ui.util.UIUtil;
import org.audiveris.omr.util.Dumping;
import org.audiveris.omr.util.HorizontalSide;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;
import java.awt.BasicStroke;
import java.awt.Color;
import java.awt.Graphics2D;
import java.awt.Point;
import java.awt.Rectangle;
import java.awt.Stroke;
import java.awt.geom.CubicCurve2D;
import java.awt.geom.Line2D;
import java.awt.geom.Point2D;
import static java.lang.Math.PI;
import static java.lang.Math.abs;
import static java.lang.Math.max;
import static java.lang.Math.min;
import static java.lang.Math.toRadians;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.Iterator;
import java.util.LinkedHashMap;
import java.util.LinkedHashSet;
import java.util.List;
import java.util.Map;
import java.util.Set;
/**
* Class <code>SlursBuilder</code> builds all slur curves from a sheet skeleton.
*
* @author Herv Bitteur
*/
public class SlursBuilder
extends CurvesBuilder
{
//~ Static fields/initializers your_sha256_hash-
private static final Constants constants = new Constants();
private static final Logger logger = LoggerFactory.getLogger(SlursBuilder.class);
private static final Color SLUR_POINTS = new Color(255, 0, 0, 50);
private static final Color SLUR_CURVES = new Color(0, 255, 0, 100);
private static final Color SLUR_MODELS = new Color(255, 255, 0, 100);
//~ Instance fields your_sha256_hash------------
/** Scale-dependent parameters. */
private final Parameters params;
/** Companion for slur-heads connections. */
private final ClumpPruner clumpPruner;
/** All slur informations created. */
private final List<SlurInfo> pageInfos = new ArrayList<>();
/** All slur inters retrieved. */
private final List<SlurInter> pageSlurs = new ArrayList<>();
/** Current maximum length for arcs to be tried. */
private Integer maxLength = null;
//~ Constructors your_sha256_hash---------------
/**
* Creates a new SlursBuilder object.
*
* @param curves curves environment
*/
public SlursBuilder (Curves curves)
{
super(curves);
clumpPruner = new ClumpPruner(sheet);
params = new Parameters(sheet.getScale());
}
//~ Methods your_sha256_hash--------------------
//--------//
// addArc //
//--------//
@Override
protected Curve addArc (ArcView arcView,
Curve curve)
{
final Arc arc = arcView.getArc();
if ((maxLength != null) && (arc.getLength() > maxLength)) {
return null;
}
SlurInfo slur = (SlurInfo) curve;
// Check extension is compatible with slur (side) circle
// Use slur side circle to check position of arc WRT circle
// If OK, allocate a new slur
Model sideModel = slur.getSideModel(reverse);
if (sideModel == null) {
return null;
}
// Check arc roughly goes in curve end direction
double projection = projection(arcView, sideModel);
if (projection < params.minProjection) {
logger.debug("{} not extended by {} projection:{}", slur, arc, projection);
return null;
}
double dist = arcDistance(sideModel, arcView);
if (dist <= params.maxExtDistance) {
// Check new side model (computed on slur side + arc)
Model newSideModel = null;
List<Point> pts = curve.getAllPoints(arcView, reverse);
if (pts.size() >= params.sideLength) {
// Side CCW cannot change with respect to slur CCW
newSideModel = slur.computeSideModel(pts, reverse);
if (newSideModel == null) {
return null;
}
if (slur.getModel() != null) {
if ((newSideModel.ccw() * slur.getModel().ccw()) < 0) {
return null;
}
}
}
SlurInfo s = (SlurInfo) createCurve(slur, arcView, pts, newSideModel);
logger.debug("Slur#{} extended as {} dist:{}", slur.getId(), s, dist);
if (newSideModel != null) {
s.setSideModel(newSideModel, reverse);
}
if (slur.hasSideModel(!reverse)) {
s.setSideModel(slur.getSideModel(!reverse), !reverse);
}
Model sModel = computeModel(pts, false);
s.setModel(sModel);
return s;
} else {
logger.debug("Slur#{} could not add {} dist:{}", slur.getId(), arc, dist);
return null;
}
}
//------------//
// buildSlurs //
//------------//
/**
* Build slurs for the system.
*/
public void buildSlurs ()
{
try {
final List<Arc> relevants = getSeedArcs();
maxLength = null;
// Build slurs from initial SLUR seed
// Extend slur seeds as much as possible through junction points & small gaps
for (Arc arc : relevants) {
if (!arc.isAssigned() && (arc.getShape() == ArcShape.SLUR)) {
buildCurve(arc);
}
}
// Build slurs from NO initial SLUR seed
// Since arcs are sorted by decreasing length, extension should
// never try to include an arc longer than the initial one.
for (Arc arc : relevants) {
if (!arc.isAssigned() && (arc.getShape() != ArcShape.SLUR)) {
maxLength = arc.getLength();
buildCurve(arc);
}
}
// Handle tie collisions on same chord, although ties are not fully known
// (because alterations & clefs have not been handled yet)
handleTieCollisions();
logger.info("Slurs: {}", pageSlurs.size());
logger.debug("Slur maxClumpSize: {}", maxClumpSize);
// Dispatch slurs to their containing parts
dispatchToParts();
// Try to connect orphans across systems (and purge the ones that don't connect)
for (Page page : sheet.getPages()) {
page.connectOrphanSlurs();
}
// Handle slurs collision on same head (TODO: just for information right now)
handleCollisions();
} catch (Throwable ex) {
logger.warn("Error in SlursBuilder: " + ex, ex);
}
}
//----------------//
// computeImpacts //
//----------------//
/**
* Compute impacts for slur candidate.
*
* @param curve curve information
* @param bothSides true for both sides, false for current side
* @return grade impacts
*/
@Override
protected SlurInter.Impacts computeImpacts (Curve curve,
boolean bothSides)
{
SlurInfo slur = (SlurInfo) curve;
Model global = needGlobalModel(slur);
if (!(global instanceof CircleModel)) {
return null;
}
// Distance to model (both side models or just a single side model)
double dist;
if (bothSides) {
double sum = 0;
for (boolean bool : new boolean[]
{ true, false }) {
Model sideModel = slur.getSideModel(bool);
if (sideModel == null) {
return null;
}
double d = sideModel.computeDistance(slur.getSidePoints(bool));
sideModel.setDistance(d);
sum += d;
}
dist = sum / 2;
} else {
Model sideModel = slur.getSideModel(reverse);
if (sideModel == null) {
return null;
}
dist = sideModel.computeDistance(slur.getSidePoints(reverse));
}
// Distance to model
if (dist > params.maxSlurDistance) {
return null;
}
double distImpact = 1 - (dist / params.maxSlurDistance);
// Max arc angle value
Circle circle = ((CircleModel) global).getCircle();
double arcAngle = circle.getArcAngle();
if (arcAngle > params.maxArcAngleHigh) {
logger.debug("Slur too curved {} {}", arcAngle, this);
return null;
}
double angleImpact = (params.maxArcAngleHigh - arcAngle) / (params.maxArcAngleHigh
- params.maxArcAngleLow);
// Features below are relevant only for full slur evaluations
if (!bothSides) {
return new SlurInter.Impacts(distImpact, angleImpact, 1, 1, 1);
}
// No vertical slur (mid angle close to 0 or PI)
double midAngle = circle.getMidAngle();
if (midAngle < 0) {
midAngle += (2 * PI);
}
midAngle %= PI;
double fromVertical = min(abs(midAngle), abs(PI - midAngle));
if (fromVertical < params.minAngleFromVerticalLow) {
logger.debug("Slur too vertical {} {}", midAngle, circle);
return null;
}
double vertImpact = (fromVertical - params.minAngleFromVerticalLow)
/ (params.minAngleFromVerticalHigh - params.minAngleFromVerticalLow);
List<Point> points = slur.getPoints();
Point p0 = points.get(0);
Point p1 = points.get(points.size() / 2);
Point p2 = points.get(points.size() - 1);
// Slur wide enough
int width = abs(p2.x - p0.x);
if (width < params.minSlurWidthLow) {
logger.debug("Slur too narrow {} at {}", width, p0);
return null;
}
double widthImpact = (width - params.minSlurWidthLow) / (params.minSlurWidthHigh
- params.minSlurWidthLow);
// Slur high enough (bent enough)
double height = Line2D.ptLineDist(p0.x, p0.y, p2.x, p2.y, p1.x, p1.y);
if (height < params.minSlurHeightLow) {
logger.debug("Slur too flat {} at {}", height, p0);
return null;
}
double heightImpact = (height - params.minSlurHeightLow) / (params.minSlurHeightHigh
- params.minSlurHeightLow);
return new SlurInter.Impacts(
distImpact,
angleImpact,
widthImpact,
heightImpact,
vertImpact);
}
//--------------//
// computeModel //
//--------------//
@Override
protected Model computeModel (List<Point> points,
boolean isSeed)
{
Point p0 = points.get(0);
Point p1 = points.get(points.size() / 2);
Point p2 = points.get(points.size() - 1);
// Compute rough circle values for quick tests
Circle rough = new Circle(p0, p1, p2);
// Minimum circle radius
double radius = rough.getRadius();
double minRadius = isSeed ? params.minSeedCircleRadius : params.minCircleRadius;
if (radius < minRadius) {
logger.debug("Arc radius too small {} at {}", radius, p0);
return null;
}
if (!Double.isInfinite(radius)) {
// Max arc angle value
double arcAngle = rough.getArcAngle();
if (arcAngle > params.maxArcAngleHigh) {
logger.debug("Arc angle too large {} at {}", arcAngle, p0);
return null;
}
}
// Now compute "precise" circle
try {
Circle fitted = new Circle(points);
// Check circle radius is rather similar to rough radius. If not, keep the rough one.
// (because algebraic circle are sometimes fancy on short slurs).
final Circle circle;
final double dist;
final double r1 = rough.getRadius();
final double r2 = fitted.getRadius();
if (Double.isInfinite(r1) || ((abs(r1 - r2) / (max(
r1,
r2))) <= params.similarRadiusRatio)) {
circle = fitted;
dist = circle.getDistance();
} else {
circle = rough;
dist = rough.computeDistance(points);
rough.setDistance(dist);
}
if (dist > params.maxArcsDistance) {
logger.debug("Bad circle fit {} at {}", dist, p0);
return null;
} else {
logger.debug("{} to {} Circle {}", p0, p2, circle);
return new CircleModel(circle);
}
} catch (Exception ex) {
logger.debug("Could not compute circle at {}", p0);
return null;
}
}
//----------------//
// createInstance //
//----------------//
@Override
protected Curve createInstance (Point firstJunction,
Point lastJunction,
List<Point> points,
Model model,
Collection<Arc> parts)
{
SlurInfo slur = new SlurInfo(
++globalId,
firstJunction,
lastJunction,
points,
model,
parts,
params.sideLength);
pageInfos.add(slur);
return slur;
}
//-------------//
// createInter //
//-------------//
@Override
protected void createInter (Curve seq,
Set<Inter> inters)
{
SlurInfo slur = (SlurInfo) seq;
GradeImpacts impacts = computeImpacts(slur, true);
if ((impacts != null) && (impacts.getGrade() >= SlurInter.getMinGrade()) && (slur
.getCurve() != null)) {
slur.retrieveGlyph(sheet, params.maxRunDistance, params.minRunRatio);
if (slur.getGlyph() != null) {
inters.add(new SlurInter(slur, impacts));
}
}
}
//-----------------//
// dispatchToParts //
//-----------------//
/**
* Dispatch each slur to its containing part.
*/
private void dispatchToParts ()
{
for (SystemInfo system : sheet.getSystems()) {
final List<Inter> slurs = system.getSig().inters(SlurInter.class);
for (Inter inter : slurs) {
SlurInter slur = (SlurInter) inter;
Part slurPart = null;
for (HorizontalSide side : HorizontalSide.values()) {
HeadInter head = slur.getHead(side);
if (head != null) {
Part headPart = head.getStaff().getPart();
if (slurPart == null) {
slurPart = headPart;
slurPart.addSlur(slur);
slur.setPart(slurPart);
} else if (slurPart != headPart) {
logger.warn("Slur crosses parts " + slur);
}
}
}
}
}
}
//-------------------//
// getArcCheckLength //
//-------------------//
@Override
protected Integer getArcCheckLength ()
{
return params.arcCheckLength;
}
//-----------//
// getBounds //
//-----------//
/**
* Report the bounding box of a collection of slurs
*
* @param slurs the collection
* @return the bounding box
*/
private Rectangle getBounds (Set<SlurInter> slurs)
{
Rectangle box = null;
for (SlurInter slur : slurs) {
Rectangle b = slur.getInfo().getBounds();
if (box == null) {
box = b;
} else {
box.add(b);
}
}
return box;
}
//--------------//
// getEndVector //
//--------------//
@Override
protected Point2D getEndVector (Curve seq)
{
SlurInfo info = (SlurInfo) seq;
Model model = needGlobalModel(info);
if (model == null) {
return null;
} else {
return model.getEndVector(reverse);
}
}
//-------------//
// getSeedArcs //
//-------------//
/**
* Build the arcs that can be used to start slur building.
* They contain only arcs with relevant shape and of sufficient length.
*
* @return the collection sorted by decreasing length
*/
private List<Arc> getSeedArcs ()
{
Set<Arc> set = new LinkedHashSet<>();
for (Arc arc : skeleton.arcsMap.values()) {
if (arc.getLength() >= params.arcMinSeedLength) {
set.add(arc);
}
}
List<Arc> list = new ArrayList<>(set);
Collections.sort(list, Arc.byReverseLength);
return list;
}
//------------------//
// handleCollisions //
//------------------//
/**
* In crowded areas, a head may got linked to more than one slur on the same side.
* Note however that having both a tie and a slur on same head side is legal.
*/
private void handleCollisions ()
{
for (SystemInfo system : sheet.getSystems()) {
SIGraph sig = system.getSig();
List<Inter> slurs = sig.inters(SlurInter.class);
for (Inter inter : slurs) {
SlurInter slur = (SlurInter) inter;
// Check on both sides of this slur
for (HorizontalSide side : HorizontalSide.values()) {
HeadInter head = slur.getHead(side);
if (head != null) {
// Check this head for colliding slur links
Set<Relation> rels = sig.getRelations(head, SlurHeadRelation.class);
for (Relation rel : rels) {
SlurHeadRelation shRel = (SlurHeadRelation) rel;
HorizontalSide relSide = shRel.getSide();
if (relSide == side) {
SlurInter s = (SlurInter) sig.getOppositeInter(head, rel);
if ((slur != s) && (slur.isTie() == s.isTie())) {
logger.debug("{} collision {} & {} @ {}", side, slur, s, head);
// TODO: handle collision ???
}
}
}
}
}
}
}
}
//---------------------//
// handleTieCollisions //
//---------------------//
/**
* Check and resolve collisions of ties on a chord.
* <p>
* Assumption: Incoming ties may originate from different chords, but not departing ties.
* <p>
* A significant problem is that heads & stems are rather reliable, whereas slurs are not.
*/
private void handleTieCollisions ()
{
for (SystemInfo system : sheet.getSystems()) {
final SIGraph sig = system.getSig();
final List<Inter> chords = sig.inters(HeadChordInter.class);
for (Inter cInter : chords) {
final HeadChordInter chord = (HeadChordInter) cInter;
if (chord.isVip()) {
logger.info("VIP handleTieCollisions on {}", chord);
}
if (chord.getNotes().size() < 2) {
continue;
}
for (HorizontalSide slurSide : HorizontalSide.values()) {
// Count ties for this chord on selected *slur* side
final Set<SlurInter> ties = new LinkedHashSet<>();
for (Inter nInter : chord.getNotes()) {
for (Relation rel : sig.getRelations(nInter, SlurHeadRelation.class)) {
final SlurHeadRelation shRel = (SlurHeadRelation) rel;
if (shRel.getSide() == slurSide) {
SlurInter slur = (SlurInter) sig.getOppositeInter(nInter, rel);
if (slur.isTie()) {
ties.add(slur);
}
}
}
}
if (ties.size() > 1) {
HorizontalSide oppSide = slurSide.opposite();
Map<HeadChordInter, List<SlurInter>> origins;
origins = new LinkedHashMap<>();
// Check whether the ties are linked to different chords
for (SlurInter tie : ties) {
for (Relation rel : sig.getRelations(tie, SlurHeadRelation.class)) {
if (((SlurHeadRelation) rel).getSide() == oppSide) {
Inter head = sig.getOppositeInter(tie, rel);
HeadChordInter ch = (HeadChordInter) head.getEnsemble();
if (ch != null) {
List<SlurInter> list = origins.get(ch);
if (list == null) {
origins.put(ch, list = new ArrayList<>());
}
list.add(tie);
}
}
}
}
logger.debug("origins: {}", origins);
if (origins.keySet().size() > 1) {
// This may result from a mirrored head
HeadInter mirror = (HeadInter) chord.getLeadingNote().getMirror();
if (mirror != null) {
// TODO: what to do???
} else {
new ChordSplitter(chord, slurSide, origins).split();
}
}
}
}
}
}
}
//------------//
// pruneClump //
//------------//
@Override
protected void pruneClump (Set<Inter> clump)
{
// Delegate final selection to ClumpPruner
SlurInter selected = clumpPruner.prune(clump);
if (selected != null) {
selected.getInfo().assign(); // Assign arcs
pageSlurs.add(selected);
}
}
//-----------------------//
// purgeIdenticalEndings //
//-----------------------//
/**
* Purge the inters with identical ending point (keeping the best grade)
*
* @param inters the collection to purge
*/
private void purgeIdenticalEndings (List<SlurInter> inters)
{
Collections.sort(inters, Inters.byReverseGrade);
for (int i = 0; i < inters.size(); i++) {
SlurInter slur = inters.get(i);
Point end = slur.getInfo().getEnd(reverse);
List<SlurInter> toDelete = new ArrayList<>();
for (SlurInter otherSlur : inters.subList(i + 1, inters.size())) {
Point otherEnd = otherSlur.getInfo().getEnd(reverse);
if (end.equals(otherEnd)) {
toDelete.add(otherSlur);
}
}
if (!toDelete.isEmpty()) {
inters.removeAll(toDelete);
}
}
}
//----------------//
// purgeShortests //
//----------------//
/**
* Discard the inters with shortest extension.
*
* @param inters the collection to purge
* @return the longest inter
*/
private SlurInter purgeShortests (List<SlurInter> inters)
{
int maxExt2 = 0;
SlurInter longest = null;
for (SlurInter slur : inters) {
int ext2 = slur.getInfo().getSegmentSq();
if (maxExt2 < ext2) {
maxExt2 = ext2;
longest = slur;
}
}
if (longest == null) {
return null;
}
int quorum = (int) Math.ceil(params.quorumRatio * params.quorumRatio * maxExt2);
for (Iterator<SlurInter> it = inters.iterator(); it.hasNext();) {
SlurInfo slur = it.next().getInfo();
if (slur.getSegmentSq() < quorum) {
it.remove();
}
}
return longest;
}
//-----------------//
// purgeStaffLines //
//-----------------//
/**
* Purge the clump candidates that end as a portion of staff line.
* <p>
* First, check that slur end point is very close to a staff line.
* Second, check the model is a LineModel (or a CircleModel with a huge radius).
* Third, check incidence angle with staff line.
*
* @param inters the candidates to weed
*/
private void purgeStaffLines (List<SlurInter> inters)
{
List<SlurInter> toDelete = new ArrayList<>();
for (SlurInter inter : inters) {
SlurInfo slur = inter.getInfo();
Point end = slur.getEnd(reverse);
if (debugArc) {
curves.selectPoint(end);
logger.info("purgeStaffLines {} {} at {}", inter, slur, end);
}
// Vertical distance from slur end to closest staff line
Staff staff = sheet.getStaffManager().getClosestStaff(end);
if (!staff.isTablature()) {
final LineInfo line = staff.getClosestStaffLine(end);
final double toLine = line.yAt(end.x) - end.y;
if (abs(toLine) > params.maxStaffLineDy) {
continue;
}
}
// Delete slur ending as a STAFF_ARC
Arc endPart = slur.getPartAt(end);
if ((endPart != null) && (endPart.getShape() == STAFF_ARC)) {
if (debugArc) {
logger.info("{} ending as STAFF_ARC", slur);
}
toDelete.add(inter);
continue;
}
// Check straightness & incidence angle
// final Model model = slur.getSideModel(reverse);
//
// if (model instanceof CircleModel) {
//
// CircleModel circleModel = (CircleModel) model;
// double radius = circleModel.getCircle().getRadius();
//
// if (Double.isInfinite(radius)) {
// List<Point> pts = slur.getSidePoints(reverse);
// Point p1 = reverse ? pts.get(pts.size() - 1) : pts.get(0);
// Point p2 = reverse ? pts.get(0) : pts.get(pts.size() - 1);
// double dx = Math.abs(p2.x - p1.x);
//
// if (dx < 1) {
// continue; // dx < 1 pixel, so the segment is vertical (angle is 90 degrees)
// }
//
// double dy = Math.abs(p2.y - p1.y);
// incidence = Math.atan(dy / dx);
// } else {
// incidence = model.getAngle(reverse) - ((model.ccw() * PI) / 2);
// }
// } else if (model instanceof LineModel) {
// incidence = model.getAngle(reverse);
// }
// Check incidence of last points before slur end
List<Point> pts = slur.getSidePoints(reverse, params.tangentLength);
Point p1 = reverse ? pts.get(pts.size() - 1) : pts.get(0);
Point p2 = reverse ? pts.get(0) : pts.get(pts.size() - 1);
double dx = Math.abs(p2.x - p1.x);
if (dx < 1) {
continue; // dx < 1 pixel, so the segment is vertical (angle is 90 degrees)
}
double dy = Math.abs(p2.y - p1.y);
double incidence = Math.atan(dy / dx);
// Check incidence
if (abs(incidence) > params.maxIncidence) {
continue;
}
if (debugArc) {
logger.info("{} ending as staff line", slur);
}
toDelete.add(inter);
}
if (!toDelete.isEmpty()) {
inters.removeAll(toDelete);
}
}
//----------//
// register //
//----------//
/**
* Register the slurs of clump into their containing systems.
* NOTA: This method is kept available only for debug manual action
*
* @param clump the clump of slurs
*/
private void register (Set<SlurInter> clump)
{
for (SlurInter slur : clump) {
pageSlurs.add(slur);
}
// Dispatch slurs
Rectangle clumpBounds = getBounds(clump);
SystemManager mgr = sheet.getSystemManager();
for (SystemInfo system : mgr.getSystemsOf(clumpBounds, null)) {
SIGraph sig = system.getSig();
for (SlurInter slur : clump) {
sig.addVertex(slur);
}
}
}
//-------------//
// renderItems //
//-------------//
@Override
public void renderItems (Graphics2D g)
{
final Rectangle clip = g.getClipBounds();
// Render info attachments
Stroke oldStroke = UIUtil.setAbsoluteStroke(g, 1f);
for (SlurInfo info : pageInfos) {
info.renderAttachments(g);
}
g.setStroke(oldStroke);
// Render slurs points
g.setColor(SLUR_POINTS);
for (SlurInter slur : pageSlurs) {
for (Point p : slur.getInfo().getPoints()) {
g.fillRect(p.x, p.y, 1, 1);
}
}
// Render slurs curves
g.setColor(SLUR_CURVES);
Stroke lineStroke = new BasicStroke(
sheet.getScale().getFore(),
BasicStroke.CAP_ROUND,
BasicStroke.JOIN_ROUND);
g.setStroke(lineStroke);
for (SlurInter slur : pageSlurs) {
CubicCurve2D curve = slur.getCurve();
if (curve != null) {
if ((clip == null) || clip.intersects(curve.getBounds())) {
g.draw(curve);
}
}
// Draw osculatory portions, if any
SlurInfo info = slur.getInfo();
if (info.getSideModel(true) != info.getSideModel(false)) {
Color oldColor = g.getColor();
g.setColor(SLUR_MODELS);
for (boolean rev : new boolean[]
{ true, false }) {
Model sideModel = info.getSideModel(rev);
if (sideModel != null) {
g.draw(sideModel.getCurve());
}
}
g.setColor(oldColor);
}
}
}
//------//
// weed //
//------//
@Override
protected void weed (Set<Curve> clump)
{
// Compute grades
List<SlurInter> inters = new ArrayList<>();
for (Curve seq : clump) {
SlurInfo slur = (SlurInfo) seq;
GradeImpacts impacts = computeImpacts(slur, false);
if (impacts != null) {
try {
inters.add(new SlurInter(slur, impacts));
} catch (Exception ex) {
logger.warn("Could not create SlurInter from {}", slur, ex);
}
}
}
clump.clear();
// In the provided clump, all candidates start from the same point.
// If several candidates stop at the same point, keep the one with best grade.
purgeIdenticalEndings(inters);
// Discard candidates that end as a portion of staff line
purgeStaffLines(inters);
// Discard the ones with too short distance from one end to the other
SlurInter longest = purgeShortests(inters);
if (longest == null) {
return;
}
// Discard those with grade lower than grade of longest candidate
double longestGrade = longest.getGrade();
for (Iterator<SlurInter> it = inters.iterator(); it.hasNext();) {
if (it.next().getGrade() < longestGrade) {
it.remove();
}
}
for (SlurInter slur : inters) {
clump.add(slur.getInfo());
}
}
//~ Inner Classes your_sha256_hash--------------
//-----------//
// Constants //
//-----------//
private static class Constants
extends ConstantSet
{
private final Constant.Ratio similarRadiusRatio = new Constant.Ratio(
0.25,
"Maximum difference ratio between radius of similar circles");
private final Constant.Double maxIncidence = new Constant.Double(
"degree",
15,
"Maximum incidence angle (in degrees) for staff tangency");
private final Scale.Fraction arcMinSeedLength = new Scale.Fraction(
0.5,
"Minimum arc length for starting a slur build");
private final Scale.Fraction maxStaffLineDy = new Scale.Fraction(
0.2,
"Vertical distance to closest staff line to detect tangency");
private final Scale.Fraction maxSlurDistance = new Scale.Fraction(
0.1,
"Maximum circle distance for private final slur");
private final Scale.Fraction maxExtDistance = new Scale.Fraction(
0.45,
"Maximum circle distance for extension arc");
private final Scale.Fraction maxArcsDistance = new Scale.Fraction(
0.15,
"Maximum circle distance for intermediate arcs");
private final Scale.Fraction arcCheckLength = new Scale.Fraction(
2,
"Length checked for extension arc");
private final Scale.Fraction tangentLength = new Scale.Fraction(
0.5,
"Length for checking staff line tangency");
private final Scale.Fraction sideModelLength = new Scale.Fraction(
6,
"Length for side osculatory model");
private final Scale.Fraction minCircleRadius = new Scale.Fraction(
0.4,
"Minimum circle radius for a slur");
private final Scale.Fraction minSeedCircleRadius = new Scale.Fraction(
0.3,
"Minimum circle radius for a slur seed");
private final Scale.Fraction minSlurWidthLow = new Scale.Fraction(
0.7,
"Low minimum width for a slur");
private final Scale.Fraction minSlurWidthHigh = new Scale.Fraction(
1.5,
"High minimum width for a slur");
private final Scale.Fraction minSlurHeightLow = new Scale.Fraction(
0.07,
"Low minimum height for a slur");
private final Scale.Fraction minSlurHeightHigh = new Scale.Fraction(
1.0,
"High minimum height for a slur");
private final Constant.Double maxArcAngleHigh = new Constant.Double(
"degree",
190.0,
"High maximum angle (in degrees) of slur arc");
private final Constant.Double maxArcAngleLow = new Constant.Double(
"degree",
170.0,
"Low maximum angle (in degrees) of slur arc");
private final Constant.Double minAngleFromVerticalLow = new Constant.Double(
"degree",
10.0,
"Low minimum angle (in degrees) between slur and vertical");
private final Constant.Double minAngleFromVerticalHigh = new Constant.Double(
"degree",
25.0,
"High minimum angle (in degrees) between slur and vertical");
private final Constant.Ratio quorumRatio = new Constant.Ratio(
0.5,
"Minimum length expressed as ratio of longest in clump");
private final Scale.Fraction minProjection = new Scale.Fraction(
-1.0,
"Minimum projection on curve for arc extension");
private final Scale.Fraction maxRunDistance = new Scale.Fraction(
0.25,
"Maximum distance from any run end to curve points");
private final Constant.Ratio minRunRatio = new Constant.Ratio(
0.75,
"Minimum runs count as ratio of slur width");
}
//------------//
// Parameters //
//------------//
/**
* All pre-scaled constants.
*/
private static class Parameters
{
final double similarRadiusRatio;
final int tangentLength;
final int sideLength;
final int arcCheckLength;
final int arcMinSeedLength;
final double maxStaffLineDy;
final double maxIncidence;
final double maxSlurDistance;
final double maxExtDistance;
final double maxArcsDistance;
final double minSeedCircleRadius;
final double minCircleRadius;
final double minSlurWidthLow;
final double minSlurWidthHigh;
final double minSlurHeightLow;
final double minSlurHeightHigh;
final double maxArcAngleLow;
final double maxArcAngleHigh;
final double minAngleFromVerticalLow;
final double minAngleFromVerticalHigh;
final double quorumRatio;
final double minProjection;
final double maxRunDistance;
final double minRunRatio;
/**
* Creates a new Parameters object.
*
* @param scale the scaling factor
*/
Parameters (Scale scale)
{
similarRadiusRatio = constants.similarRadiusRatio.getValue();
tangentLength = scale.toPixels(constants.tangentLength);
sideLength = scale.toPixels(constants.sideModelLength);
arcCheckLength = scale.toPixels(constants.arcCheckLength);
arcMinSeedLength = scale.toPixels(constants.arcMinSeedLength);
maxStaffLineDy = scale.toPixelsDouble(constants.maxStaffLineDy);
maxIncidence = toRadians(constants.maxIncidence.getValue());
maxSlurDistance = scale.toPixelsDouble(constants.maxSlurDistance);
maxExtDistance = scale.toPixelsDouble(constants.maxExtDistance);
maxArcsDistance = scale.toPixelsDouble(constants.maxArcsDistance);
minSeedCircleRadius = scale.toPixelsDouble(constants.minSeedCircleRadius);
minCircleRadius = scale.toPixelsDouble(constants.minCircleRadius);
minSlurWidthLow = scale.toPixelsDouble(constants.minSlurWidthLow);
minSlurWidthHigh = scale.toPixelsDouble(constants.minSlurWidthHigh);
minSlurHeightLow = scale.toPixelsDouble(constants.minSlurHeightLow);
minSlurHeightHigh = scale.toPixelsDouble(constants.minSlurHeightHigh);
maxArcAngleHigh = toRadians(constants.maxArcAngleHigh.getValue());
maxArcAngleLow = toRadians(constants.maxArcAngleLow.getValue());
minAngleFromVerticalLow = toRadians(constants.minAngleFromVerticalLow.getValue());
minAngleFromVerticalHigh = toRadians(constants.minAngleFromVerticalHigh.getValue());
quorumRatio = constants.quorumRatio.getValue();
minProjection = scale.toPixelsDouble(constants.minProjection);
maxRunDistance = scale.toPixelsDouble(constants.maxRunDistance);
minRunRatio = constants.minRunRatio.getValue();
if (logger.isDebugEnabled()) {
new Dumping().dump(this);
}
}
}
}
```
|
Stefan Tait (born 14 March 1996) is a South African cricketer. He made his List A debut for South Western Districts in the 2018–19 CSA Provincial One-Day Challenge on 28 October 2018. He made his first-class debut for South Western Districts in the 2018–19 CSA 3-Day Provincial Cup on 1 November 2018. He was the leading wicket-taker for South Western Districts in the 2018–19 CSA Provincial One-Day Challenge, with 16 dismissals in nine matches.
In April 2021, Tait was named in the South Africa Emerging Men's squad for their six-match tour of Namibia. He made his Twenty20 debut on 12 February 2022, for Warriors in the 2021–22 CSA T20 Challenge.
References
External links
1996 births
Living people
South African cricketers
South Western Districts cricketers
Warriors cricketers
Place of birth missing (living people)
|
```c++
/*
* Sending VK_PAUSE to the console window almost works as a mechanism for
* pausing it, but it doesn't because the console could turn off the
* ENABLE_LINE_INPUT console mode flag.
*/
#define _WIN32_WINNT 0x0501
#include <stdio.h>
#include <stdlib.h>
#include <windows.h>
CALLBACK DWORD pausingThread(LPVOID dummy)
{
if (1) {
Sleep(1000);
HWND hwnd = GetConsoleWindow();
SendMessage(hwnd, WM_KEYDOWN, VK_PAUSE, 1);
Sleep(1000);
SendMessage(hwnd, WM_KEYDOWN, VK_ESCAPE, 1);
}
if (0) {
INPUT_RECORD ir;
memset(&ir, 0, sizeof(ir));
ir.EventType = KEY_EVENT;
ir.Event.KeyEvent.bKeyDown = TRUE;
ir.Event.KeyEvent.wVirtualKeyCode = VK_PAUSE;
ir.Event.KeyEvent.wRepeatCount = 1;
}
return 0;
}
int main()
{
HANDLE hin = GetStdHandle(STD_INPUT_HANDLE);
HANDLE h = GetStdHandle(STD_OUTPUT_HANDLE);
COORD c = { 0, 0 };
DWORD mode;
GetConsoleMode(hin, &mode);
SetConsoleMode(hin, mode &
~(ENABLE_LINE_INPUT));
CreateThread(NULL, 0,
pausingThread, NULL,
0, NULL);
int i = 0;
while (true) {
Sleep(100);
printf("%d\n", ++i);
}
return 0;
}
```
|
```javascript
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following
// disclaimer in the documentation and/or other materials provided
// with the distribution.
// * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived
// from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
Debug = debug.Debug
// Simple debug event handler which counts the number of breaks hit and steps.
var break_break_point_hit_count = 0;
function listener(event, exec_state, event_data, data) {
if (event == Debug.DebugEvent.Break) {
break_break_point_hit_count++;
// Continue stepping until returned to bottom frame.
if (exec_state.frameCount() > 1) {
exec_state.prepareStep(Debug.StepAction.StepIn);
}
}
};
// Add the debug event listener.
Debug.setListener(listener);
// Test step into constructor with simple constructor.
function X() {
}
function f() {
debugger;
new X();
};
break_break_point_hit_count = 0;
f();
assertEquals(5, break_break_point_hit_count);
f();
assertEquals(10, break_break_point_hit_count);
f();
assertEquals(15, break_break_point_hit_count);
// Test step into constructor with builtin constructor.
function g() {
debugger;
new Date();
};
break_break_point_hit_count = 0;
g();
assertEquals(4, break_break_point_hit_count);
// Get rid of the debug event listener.
Debug.setListener(null);
```
|
Route 204 is a finite two-lane east/west highway on the south shore of the Saint Lawrence River in Quebec. It is one of the longest secondary highways in the province. Its eastern terminus is in Saint-Jean-Port-Joli at the junction of Route 132 and the western terminus is in Lac-Mégantic at the junction of Route 161. Although it is numbered as an east/west highway, the road follows a north/south course from Saint-Jean-Port-Joli to Saint-Pamphile, where it then follows a mostly southwest/northeast course until Saint-Georges, where after crossing the Chaudière River, follows it in a north/south course until the source of the Chaudiere in Megantic Lake, in Lac-Mégantic.
Municipalities along Route 204
Lac-Mégantic
Frontenac
Audet
Saint-Ludger
Saint-Gédéon-de-Beauce
Saint-Martin
Saint-Georges
Saint-Prosper
Sainte-Rose-de-Watford
Sainte-Justine
Saint-Camille-de-Lellis
Saint-Just-de-Bretenières
Saint-Fabien-de-Panet
Sainte-Lucie-de-Beauregard
Saint-Adalbert
Saint-Pamphile
Sainte-Perpétue
Tourville
Saint-Damase-de-L'Islet
Saint-Aubert
Saint-Jean-Port-Joli
Major intersections
See also
List of Quebec provincial highways
References
External links
Provincial Route Map (Courtesy of the Quebec Ministry of Transportation)
Route 204 on Google Maps
204
Saint-Georges, Quebec
|
The East Carolina Pirates baseball team is an intercollegiate baseball team representing East Carolina University in NCAA Division I college baseball and participates as a full member of the American Athletic Conference. The Pirates have made regular appearances in the NCAA tournament. As of 2023, they have the most NCAA tournament appearances without a College World Series appearance.
The Pirates are coached by Cliff Godwin and play their home games at Clark-LeClair Stadium, named after donor and alumnus Bill Clark and former coach Keith LeClair. Every year, the Pirates host a baseball tournament in Greenville in honor of Coach LeClair called the Keith LeClair Classic.
History
Conference
1948–1962: North State
1963–1965: Independent
1966–1977: Southern Conference
1978–1981: Independent
1982–1985: Eastern College Athletic Conference
1986–2001: Colonial Athletic Association
2002–2014: Conference USA
2015–present: American Athletic Conference
Head coaches
* 1942, 1946–1949 No Records Available
* 1943–1945 No Games Played
Stadium
Clark-LeClair Stadium is the home of Pirate baseball at East Carolina University in Greenville, North Carolina. The stadium was named after Pirate alumnus and key contributor Bill Clark and former Pirate skipper Keith LeClair.
The stadium has 3,000 Stadium bleacher seats, plus space for several thousand more spectators in "The Jungle". There are concession and restroom facilities at the stadium plus a family picnic area. Amenities include the Pirate Club fundraising and hospitality suite and a private suite for the LeClair family.
The stadium is home to the ECU Invitational and the Keith LeClair Classic.
Year-by-year results
* Division I only
NAIA tournament
In 1961, the ECU Pirates won the NAIA Baseball World Series championship to claim East Carolina's first national championship in baseball. The East Carolina Pirates won 13–7 over the Sacramento State Hornets. Since then, the Pirates have yet to make it to a national championship.
NCAA tournament
The NCAA Division I baseball tournament started in 1947.
The format of the tournament has changed through the years.
Pirates in the Major Leagues
Over the 5-year tenure of current head coach Cliff Godwin, 14 Pirates have been drafted.
Since the MLB draft began in 1965, 2 Pirates have been selected in the first round: Pat Watkins was selected 32nd in 1993 and Jeff Hoffman was selected 9th in 2014.
A total of 20 Pirates have gone on to play in the MLB, 3 of which are active players.
See also
List of NCAA Division I baseball programs
Conference USA baseball tournament
American Athletic Conference baseball tournament
References
|
In some schools of Buddhism, bardo ( Wylie: bar do) or antarābhava (Sanskrit, Chinese and Japanese: 中有, romanized in Chinese as zhōng yǒu and in Japanese as chū'u) is an intermediate, transitional, or liminal state between death and rebirth. The concept arose soon after Gautama Buddha's death, with a number of earlier Buddhist schools accepting the existence of such an intermediate state, while other schools rejected it. The concept of antarābhava, an intervening state between death and rebirth, was brought into Buddhism from the Vedic-Upanishadic (later Hindu) philosophical tradition. Later Buddhism expanded the bardo concept to six or more states of consciousness covering every stage of life and death. In Tibetan Buddhism, bardo is the central theme of the Bardo Thodol (literally Liberation Through Hearing During the Intermediate State), the Tibetan Book of the Dead, a text intended to both guide the recently deceased person through the death bardo to gain a better rebirth and also to help their loved ones with the grieving process.
Used without qualification, "bardo" is the state of existence intermediate between two lives on earth. According to Tibetan tradition, after death and before one's next birth, when one's consciousness is not connected with a physical body, one experiences a variety of phenomena. These usually follow a particular sequence of degeneration from, just after death, the clearest experiences of reality of which one is spiritually capable, and then proceeding to terrifying hallucinations that arise from the impulses of one's previous unskillful actions. For the prepared and appropriately trained individuals, the bardo offers a state of great opportunity for liberation, since transcendental insight may arise with the direct experience of reality; for others, it can become a place of danger as the karmically created hallucinations can impel one into a less than desirable rebirth.
Metaphorically, bardo can be used to describe times when the usual way of life becomes suspended, as, for example, during a period of illness or during a meditation retreat. Such times can prove fruitful for spiritual progress because external constraints diminish. However, they can also present challenges because our less skillful impulses may come to the foreground, just as in the sidpa bardo.
Intermediate state in Indian Buddhism
From the records of early Buddhist schools, it appears that at least six different groups accepted the notion of an intermediate existence (antarabhāva), namely, the Sarvāstivāda, Darṣṭāntika, Vātsīputrīyas, Saṃmitīya, Pūrvaśaila and late Mahīśāsaka. The first four of these are closely related schools. Opposing them were the Mahāsāṃghika, early Mahīśāsaka, Theravāda, Vibhajyavāda and the Śāriputrābhidharma (possibly Dharmagupta).
Some of the earliest references to an "intermediate existence" are to be found in the Sarvāstivādin text the Mahāvibhāṣa (阿毘達磨大毘婆沙論). For instance, the Mahāvibhāṣa indicates a "basic existence" (本有), an "intermediate existence" (中有), a "birth existence" (生有) and a "death existence" (死有) (CBETA, T27, no. 1545, p. 959, etc.). André Bareau's Les sectes bouddhiques du Petit Véhicule provides the arguments of the Sarvāstivāda schools as follows:
The intermediate being who makes the passage in this way from one existence to the next is formed, like every living being, of the five aggregates (skandha). His existence is demonstrated by the fact that it cannot have any discontinuity in time and space between the place and moment of death and those of rebirth, and therefore it must be that the two existences belonging to the same series are linked in time and space by an intermediate stage. The intermediate being is the Gandharva, the presence of which is as necessary at conception as the fecundity and union of the parents. Furthermore, the Antarāparinirvāyin is an Anāgamin who obtains parinirvāṇa during the intermediary existence. As for the heinous criminal guilty of one of the five crimes without interval (ānantarya), he passes in quite the same way by an intermediate existence at the end of which he is reborn necessarily in hell.
Deriving from a later period of the same school, though with some differences, Vasubandhu’s Abhidharmakośa explains (English trs. p. 383ff):
What is an intermediate being, and an intermediate existence? Intermediate existence, which inserts itself between existence at death and existence at birth, not having arrived at the location where it should go, cannot be said to be born. Between death—that is, the five skandhas of the moment of death—and arising—that is, the five skandhas of the moment of rebirth—there is found an existence—a "body" of five skandhas—that goes to the place of rebirth. This existence between two realms of rebirth (gatī) is called intermediate existence.
He cites a number of texts and examples to defend the notion against other schools which reject it and claim that death in one life is immediately followed by rebirth in the next, without any intermediate state in between the two. Both the Mahāvibhāṣa and the Abhidharmakośa have the notion of the intermediate state lasting "seven times seven days" (i.e. 49 days) at most. This is one view, though, and there were also others.
Similar arguments were also used in Harivarman’s *Satyasiddhi Śāstra, and the Upadeśa commentary on the Prajñāpāramitā Sūtras, both of which have strong influence from the Sarvāstivāda school. Both of these texts had powerful influence in Chinese Buddhism, which also accepts this idea as a rule.
The Saddharma-smṛty-upasthāna Sūtra (正法念處經) classifies 17 intermediate states with different experiences.
Six bardos in Tibetan Buddhism
Fremantle (2001) states that there are six traditional bardo states known as the Six Bardos: the Bardo of This Life (p. 55); the Bardo of Meditation (p. 58); the Bardo of Dream (p. 62); the Bardo of Dying (p. 64); the Bardo of Dharmata (p. 65); and the Bardo of Existence (p. 66).
Shugchang, et al. (2000: p. 5) discuss the Zhitro (Tibetan: Zhi-khro) cycle of teachings of Karma Lingpa which includes the Bardo Thodol and list the Six Bardo: "The first bardo begins when we take birth and endures as long as we live. The second is the bardo of dreams. The third is the bardo of concentration or meditation. The fourth occurs at the moment of death. The fifth is known as the bardo of the luminosity of the true nature. The sixth is called the bardo of transmigration or karmic becoming.
Kyenay bardo (skye gnas bar do) is the first bardo of birth and life. This bardo commences from conception until the last breath, when the mindstream withdraws from the body.
Milam bardo (rmi lam bar do) is the second bardo of the dream state. The Milam Bardo is a subset of the first Bardo. Dream Yoga develops practices to integrate the dream state into Buddhist sadhana.
Samten bardo (bsam gtan bar do) is the third bardo of meditation. This bardo is generally only experienced by meditators, though individuals may have spontaneous experience of it. Samten Bardo is a subset of the Kyenay Bardo.
Chikhai bardo ('chi kha'i bar do) is the fourth bardo of the moment of death. According to tradition, this bardo is held to commence when the outer and inner signs presage that the onset of death is nigh, and continues through the dissolution or transmutation of the Mahabhuta until the external and internal breath has completed.
Chönyi bardo (chos nyid bar do) is the fifth bardo of the luminosity of the true nature which commences after the final 'inner breath' (Sanskrit: prana, vayu; Tibetan: rlung). It is within this Bardo that visions and auditory phenomena occur. In the Dzogchen teachings, these are known as the spontaneously manifesting Tögal (Tibetan: thod-rgal) visions. Concomitant to these visions, there is a welling of profound peace and pristine awareness. Sentient beings who have not practiced during their lived experience and/or who do not recognize the clear light (Tibetan: 'od gsal) at the moment of death are usually deluded throughout the fifth bardo of luminosity.
Sidpa bardo (srid pa bar do) is the sixth bardo of becoming or transmigration. This bardo endures until the inner-breath commences in the new transmigrating form determined by the "karmic seeds" within the storehouse consciousness.
History
Since the Bardo Thodol was translated into English, different conceptions of the bardo have emerged over the years (Lopez, 1998: p. 43 and 83). In the translation of Walter Y. Evans-Wentz in 1927, the description of the bardo was an “esoteric” view of rebirth as an evolutionary system in which regression to the brutish realms was impossible. Almost four decades later, in 1964, Timothy Leary, Ralph Metzner and Richard Alpert saw the intermediate states as being really about life, profitable as an account of an eight-hour acid trip. Chögyam Trungpa portrays the realms of rebirth as psychological states in 1975, and Sogyal Rinpoche uses his discussion of the six realms as an opportunity to lampoon California surfers and New York bankers, in the translation that was published in 1992. Two years later Robert Thurman (1994) interpreted the bardo, which is described originally as a Nyingma text, from a Geluk frame.
Fremantle (2001: p. 53–54) charts the development of the bardo concept through the Himalayan tradition:
Originally bardo referred only to the period between one life and the next, and this is still its normal meaning when it is mentioned without any qualification. There was considerable dispute over this theory during the early centuries of Buddhism, with one side arguing that rebirth (or conception) follows immediately after death, and the other saying that there must be an interval between the two. With the rise of mahayana, belief in a transitional period prevailed. Later Buddhism expanded the whole concept to distinguish six or more similar states, covering the whole cycle of life, death, and rebirth. But it can also be interpreted as any transitional experience, any state that lies between two other states. Its original meaning, the experience of being between death and rebirth, is the prototype of the bardo experience, while the six traditional bardos show how the essential qualities of that experience are also present in other transitional periods. By refining even further the understanding of the essence of bardo, it can then be applied to every moment of existence. The present moment, the now, is a continual bardo, always suspended between the past and the future. Yongey Mingur Rinpoche (2021, p. 66) adds another modern view and emphasises on the bardo of becoming: “When we move past the convenience of language and categories, every second manifests the bardo of becoming. Becoming and becoming. All phenomena always just become [...] When we sensitize ourselves to the subtle transitions of emotions, or of bodily change, or shifts in social circumstances, or environmental transformations such as differences in landscape and light, or developments in language, art, or politics-we see that it’s all always changing, dying, and becoming.”
Intermediate state in Theravāda
Theravāda Abhidhamma texts like the Kathavatthu traditionally reject the view that there is an intermediate or transitional state (antarabhāva) between rebirths, they hold that rebirth happens instantaneously (in one mind moment) through the re-linking consciousness (patisandhi citta).
However, as has been noted by various modern scholars like Bhikkhu Sujato, there are passages in the Theravāda Pali Canon which support the idea of an intermediate state, the most explicit of which is the Kutuhalasāla Sutta.
This sutta states: [The Buddha:] "Vaccha, I declare that there is rebirth for one with fuel [with grasping], not for one without fuel. Vaccha, just as fire burns with fuel, not without fuel, even so, Vaccha, I declare that there is rebirth for one with fuel [with grasping], not for one without fuel."
[Vaccha replies:] "But, master Gotama, when a flame is tossed by the wind and goes a long way, what does master Gotama declare to be its fuel?"
[Buddha:] "Vaccha, when a flame is tossed by the wind and goes a long way, I declare that it is fueled by the air. For, Vaccha, at that time, the air is the fuel."
[Vaccha:] "Master Gotama, when a being has laid down this body, but has not yet been reborn in another body, what does the master Gotama declare to be the fuel?"
[Buddha:] "Vaccha, when a being has laid down this body, but has not yet been reborn in another body, it is fuelled by craving, I say. For, Vaccha, at that time, craving is the fuel." Furthermore, some Theravāda scholars (such as Balangoda Ananda Maitreya) have defended the idea of an intermediate state and it is also a very common belief among some monks and laypersons in the Theravāda world (where it is commonly referred to as the gandhabba or antarabhāva). According to Sujato, it is also widely accepted among Thai forest tradition teachers.
In East Asian Buddhism
East Asian Buddhism generally accepts the main doctrines of the Yogacara tradition as taught by Vasubandhu and Asanga. This includes the acceptance of the intermediate existence (中有, Chinese romanization: zhōng yǒu, Japanese: chūu). The doctrine of the intermediate existence is mentioned in various Chinese Buddhist scholastic works, such as Xuanzang's Cheng Weishi Lun (Discourse on the Perfection of Consciousness-only).
The Chinese Buddhist Canon contains a text called the Antarabhava sutra, which is used in funerary rituals.
The founder of Soto Zen, Dogen, wrote the following regarding how to navigate the intermediate state:“When you leave this life, and before you enter the next life, there is a place called an intermediary realm. You stay there for seven days. You should resolve to keep chanting the names of the three treasures without ceasing while you are there. After seven days you die in the intermediary realm and remain there for no more than seven days. At this time you can see and hear without hindrance, like having a celestial eye. Resolve to encourage yourself to keep chanting the names of the three treasures without ceasing: ‘I take refuge in the Buddha. I take refuge in the Dharma. I take refuge in the Sangha.’ After passing through the intermediary realm, when you approach your parents to be conceived, resolve to maintain authentic wisdom. Keep chanting refuge in the three treasures in your mother’s womb. Do not neglect chanting while you are given birth. Resolve deeply to dedicate yourself to chant and take refuge in the three treasures through the six sense roots. When your life ends, your eye sight will suddenly become dark. Know that this is the end of your life and be determined to chant, ‘I take refuge in the buddha.’ Then, all buddhas in the ten directions will show compassion to you. Even if due to conditions you are bound to an unwholesome realm, you will be able to be born in the deva realm or in the presence of the Buddha. Bow and listen to the Buddha.”
--- Shobogenzo, section 94, "Mind of the Way”, translated by Peter Levitt & Kazuaki Tanahashi (2013):
See also
Aether
Bardo, False Chronicle of a Handful of Truths, Mexican film
Bardo Thodol
Barzakh, a somewhat related concept in Islam
Desire realm
Dzogchen
Intermediate state, a somewhat related concept in Christianity
Limbo
Liminality
Lucid dreaming
Lincoln in the Bardo, a 2017 novel by George Saunders.
Matarta in Mandaeism
Sanzu River
Six Yogas of Naropa
Zhitro
References
Further reading
American Book of the Dead. 1987. E.J. Gold. Nevada City: IDHHB.
Bardo Teachings: The Way of Death and Rebirth. 1987. By Venerable Lama Lodo. Ithaca, NY: Snow Lion Publications
The Bardo Thodol: A Golden Opportunity. 2008. Mark Griffin. Los Angeles: HardLight Publishing.
Death, Intermediate State, and Rebirth. 1981. Lati Rinpoche. Snow Lion Publications.
The Hidden History of the Tibetan Book of the Dead. 2003. Bryan J. Cuevas. New York: Oxford University Press.
Mirror of Mindfulness: The Cycle of the Four Bardos, Tsele Natsok Rangdrol, translated by Erik Pema Kunsang (Rangjung Yeshe Publications).
Natural Liberation. 1998. Padmasambhava. The text is translated by B. Alan Wallace, with a commentary by Gyatrul Rinpoche. Somerville, Wisdom Publications.
The Tibetan Book of the Dead: Awakening Upon Dying. 2013. by Padmasambhava (Author), Chögyal Namkhai Norbu (Commentary), Karma Lingpa (Author), Elio Guarisco (Translator). Shang Shung Publications & North Atlantic Books.
The Tibetan Book of Living and Dying. 1993. Sogyal Rinpoche. New York: HarperCollins
External links
Public domain PDF and audio versions of the Tibetan Book of the Dead
The Eight Bardos, Khenchen Konchog Gyaltshen, Lion’s Roar magazine
Soto Zen preparations for dying
A modern commentary on Karma Lingpa’s Zhi-khro teachings on the peaceful and wrathful deities
The Psychedelic Experience: A manual based on the Tibetan Book of the Dead, 1967. By Timothy Leary, Ph.D.; Ralph Metzner, Ph.D.; & Richard Alpert, Ph.D. (later known as Ram Das)
Tibetan Buddhism and the resolution of grief: The Bardo-Thodol for the dying and the grieving, by Robert Goss, Death Studies, Vol. 21 Issue 4 Jul/Aug.1997, Pp.377-395
Buddhist philosophical concepts
Tibetan Buddhist philosophical concepts
Buddhist belief and doctrine
Sarvāstivāda
Buddhism and death
Tibetan words and phrases
|
```objective-c
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
//
// path_to_url
//
// Unless required by applicable law or agreed to in writing,
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
// specific language governing permissions and limitations
#pragma once
#include "codegen/llvm-codegen.h"
#include <unistd.h>
#include <mutex>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include "common/status.h"
#include "kudu/util/slice.h"
#include "thirdparty/datasketches/MurmurHash3.h"
#include "util/cache/cache.h"
#include "util/histogram-metric.h"
#include "util/metrics.h"
namespace impala {
/// The key to a CodeGen Cache entry.
/// It contains a hash code at the first of sizeof(struct HashCode) bytes. If the
/// cache is in NORMAL mode, the content of the key will be after the hash code,
/// which could be a combination of several keys, otherwise, in OPTIMAL mode, the
/// CodeGenCacheKey to be stored to the cache would only contain a hash code and
/// the total length to reduce the memory consumption.
/// For a key in the NORMAL mode, it would be like:
/// Hash Code| Total Length| Length of Key 1| Data of Key 1| Length of Key 2
/// | Data of Key 2| ... | Length of Key N| Data of Key N.
/// The key is constructed by CodeGenCacheKeyConstructor.
/// Functions are NOT thread-safe.
class CodeGenCacheKey {
public:
/// The type of a hashcode for the codegen cache key.
struct HashCode {
HashCode() { memset(&hash_code, 0, sizeof(HashState)); }
// This function is used by unordered_set to compare elements of HashCode.
bool operator==(const HashCode& h) const {
return (this->hash_code.h1 == h.hash_code.h1)
&& (this->hash_code.h2 == h.hash_code.h2);
}
friend std::ostream& operator<<(std::ostream& o, const HashCode& h) {
return o << std::hex << std::setfill('0') << std::setw(16) << h.hash_code.h1 << ":"
<< std::setw(16) << h.hash_code.h2;
}
string str() {
std::stringstream out;
out << *this;
return out.str();
}
HashState hash_code;
};
/// Used as the hash function in unordered_set for struct HashCode.
/// It is required by the unordered_set to generate a hash code for a
/// customized structure.
struct HashCodeHash {
uint64_t operator()(const HashCode& h) const {
// Return the first 64bits for the hash.
return h.hash_code.h1;
}
};
/// The type of the length of a general element in the codegen cache key.
typedef int ElementLengthType;
/// Construct an empty key.
CodeGenCacheKey() {}
/// Construct the key from a string. Uses move to fasten the process.
CodeGenCacheKey(string key) : key_(std::move(key)) {}
/// Set the data of the key. Uses swap to fasten the process.
void set_key(string key) { key_.swap(key); }
/// Return the hash code of the key.
HashCode hash_code() const {
DCHECK(!key_.empty());
DCHECK(key_.length() >= sizeof(HashCode));
return *(const HashCode*)key_.c_str();
}
/// Return the slice of the hash code of the key.
Slice hash_code_slice() const {
DCHECK_LE(sizeof(HashCode), key_.size());
return Slice(key_.c_str(), sizeof(HashCode));
}
/// Return the size of a key in optimal mode.
static constexpr size_t OptimalKeySize = sizeof(HashCode) + sizeof(ElementLengthType);
/// Return the slice of key in optimal mode, which is the hash code plus the total
/// length of a full key.
Slice optimal_key_slice() const {
DCHECK_LE(OptimalKeySize, key_.size());
return Slice(key_.c_str(), OptimalKeySize);
}
/// Return the hash code from a key of type Slice.
static HashCode hash_code(Slice key) {
DCHECK(!key.empty());
DCHECK_LE(sizeof(HashCode), key.size());
return *(const HashCode*)key.data();
;
}
/// Return the data of the key.
string& data() { return key_; }
Slice data_slice() const { return Slice(key_.c_str(), key_.size()); }
/// Return if the key is empty.
bool empty() const { return key_.empty(); }
private:
/// The data of the key.
std::string key_;
};
/// The class helps to construct a CodeGenCacheKey.
class CodeGenCacheKeyConstructor {
public:
/// Construct a CodeGenCacheKey from a string.
/// It could be in future to construct from a list of string keys.
static void construct(std::string&, CodeGenCacheKey*);
/// An arbitrary constant used to seed the hash.
static constexpr uint64_t CODEGEN_CACHE_HASH_SEED_CONST = 0x6b8b4567327b23c6;
};
/// The class helps to analyze the codegen cache mode.
class CodeGenCacheModeAnalyzer {
public:
// The mask should follow the definition of TCodeGenCacheMode.
// The lowest byte of the TCodeGenCacheMode is used to define the type NORMAL
// or OPTIMAL.
// The nineth bit (bit 8) is used to define whether it is a debug mode. If it is 1,
// then it is a debug mode.
static const uint64_t CODEGEN_CACHE_MODE_MASK = 0xFF;
static const uint64_t CODEGEN_CACHE_MODE_BITS = 8;
static bool is_optimal(const TCodeGenCacheMode::type& mode) {
return (mode & CODEGEN_CACHE_MODE_MASK) == TCodeGenCacheMode::OPTIMAL;
}
static bool is_debug(const TCodeGenCacheMode::type& mode) {
return (mode >> CODEGEN_CACHE_MODE_BITS) != 0;
}
};
struct CodeGenCacheEntry {
CodeGenCacheEntry() : cached_engine_pointer(nullptr) {}
// When Empty, no guarantees are made about the content of other fields.
bool Empty() { return cached_engine_pointer == nullptr; }
void Reset() { cached_engine_pointer = nullptr; }
void Reset(CodeGenObjectCache* cached_engine_ptr, int64_t num_funcs,
int64_t num_instrucs, int64_t num_opt_funcs, int64_t num_opt_instrucs,
uint64_t names_hashcode, int64_t charge, TCodeGenOptLevel::type opt) {
cached_engine_pointer = cached_engine_ptr;
num_functions = num_funcs;
num_instructions = num_instrucs;
num_opt_functions = num_opt_funcs;
num_opt_instructions = num_opt_instrucs;
function_names_hashcode = names_hashcode;
total_bytes_charge = charge;
opt_level = opt;
}
CodeGenObjectCache* cached_engine_pointer;
/// Number of functions before optimization.
int64_t num_functions;
/// Number of instructions before optimization.
int64_t num_instructions;
/// Number of functions after optimization.
int64_t num_opt_functions;
/// Number of instructions after optimization.
int64_t num_opt_instructions;
/// The hashcode of function names in the entry.
uint64_t function_names_hashcode;
/// Bytes charge including the key and the entry.
int64_t total_bytes_charge;
/// CodeGen optimization level used to generate this entry.
TCodeGenOptLevel::type opt_level;
};
/// Each CodeGenCache is supposed to be a singleton in the daemon, manages the codegen
/// cache entries, including providing the function of entry storage and look up, and
/// entry eviction if capacity limit is met.
class CodeGenCache {
public:
CodeGenCache(MetricGroup*);
~CodeGenCache() {
is_closed_ = true;
ReleaseResources();
}
/// Initilization for the codegen cache, including cache and metrics allocation.
Status Init(int64_t capacity);
/// Release the resources that occupied by the codegen cache before destruction.
void ReleaseResources();
/// Lookup the specific cache key for the cache entry. If the key doesn't exist, the
/// entry will be reset to empty.
/// Return Status::Okay unless there is any internal error to throw.
Status Lookup(const CodeGenCacheKey& key, const TCodeGenCacheMode::type& mode,
CodeGenCacheEntry* entry, std::shared_ptr<CodeGenObjectCache>* cached_engine);
bool Lookup(const CodeGenCacheKey& key, const TCodeGenCacheMode::type& mode);
/// Store the cache entry with the specific cache key.
Status Store(const CodeGenCacheKey& key, LlvmCodeGen* codegen,
TCodeGenCacheMode::type mode, TCodeGenOptLevel::type opt_level);
/// Store the shared pointer of CodeGenObjectCache to keep the compiled module cache
/// alive.
void StoreEngine(LlvmCodeGen* codegen);
/// Look up the shared pointer of the CodeGenObjectCache by its raw pointer.
/// If found, return true. Ohterwise, return false.
bool LookupEngine(const CodeGenObjectCache* cached_engine_raw_ptr,
std::shared_ptr<CodeGenObjectCache>* cached_engine = nullptr);
/// Remove the shared pointer of CodeGenObjectCache from the cache by its raw pointer
/// address.
void RemoveEngine(const CodeGenObjectCache* cached_engine_raw_ptr);
/// Increment a hit count or miss count.
void IncHitOrMissCount(bool hit) {
DCHECK(codegen_cache_hits_ && codegen_cache_misses_);
if (hit) {
codegen_cache_hits_->Increment(1);
} else {
codegen_cache_misses_->Increment(1);
}
}
/// EvictionCallback for the codegen cache.
class EvictionCallback : public Cache::EvictionCallback {
public:
EvictionCallback(CodeGenCache* cache, IntCounter* entries_evicted,
IntGauge* entries_in_use, IntGauge* entries_in_use_bytes)
: cache_(cache),
codegen_cache_entries_evicted_(entries_evicted),
codegen_cache_entries_in_use_(entries_in_use),
codegen_cache_entries_in_use_bytes_(entries_in_use_bytes) {}
virtual void EvictedEntry(Slice key, Slice value) override;
private:
CodeGenCache* cache_;
/// Metrics for the codegen cache in the process level.
IntCounter* codegen_cache_entries_evicted_;
IntGauge* codegen_cache_entries_in_use_;
IntGauge* codegen_cache_entries_in_use_bytes_;
};
private:
friend class LlvmCodeGenCacheTest;
/// Helper function to store the entry to the cache.
Status StoreInternal(const CodeGenCacheKey& key, LlvmCodeGen* codegen,
TCodeGenCacheMode::type mode, TCodeGenOptLevel::type opt_level);
/// Indicate if the cache is closed. If is closed, no call is allowed for any functions
/// other than ReleaseResources().
bool is_closed_;
/// The instance of the cache.
std::unique_ptr<Cache> cache_;
/// Metrics for the codegen cache in the process level.
IntCounter* codegen_cache_hits_;
IntCounter* codegen_cache_misses_;
IntCounter* codegen_cache_entries_evicted_;
IntGauge* codegen_cache_entries_in_use_;
IntGauge* codegen_cache_entries_in_use_bytes_;
/// Statistics for the buffer sizes allocated from the system allocator.
HistogramMetric* codegen_cache_entry_size_stats_;
/// Eviction Callback function.
std::unique_ptr<CodeGenCache::EvictionCallback> evict_callback_;
/// Protects to the to insert hash set below.
std::mutex to_insert_set_lock_;
/// The keys of codegen entries that are going to insert to the system cache.
/// The purpose of it is to prevent the same key simultaneously to be inserted.
std::unordered_set<CodeGenCacheKey::HashCode, CodeGenCacheKey::HashCodeHash>
keys_to_insert_;
/// Protects to the map of cached engines.
std::mutex cached_engines_lock_;
/// Stores shared pointers to CodeGenObjectCaches to keep the jitted functions
/// alive. The shared pointer entries could be removed when the cache entry is evicted
/// or when the whole cache is destructed.
std::unordered_map<const CodeGenObjectCache*, std::shared_ptr<CodeGenObjectCache>>
cached_engines_;
};
} // namespace impala
```
|
Peña Adobe (Vaca-Peña Adobe) is a historic park and building in Vacaville, California, Solano Count, United States.
History
It was built in 1842 by the Californios. It was designed by Juan Felipe Peña. It was located on the Rancho Los Putos. It is situated on 1.5 acres. It is owned by the Peña Adobe Historical Society and is open to the public on the first Saturday of the month.
The Peña Adobe is now part of the city's Peña Adobe Park, which includes the Mowers-Goheen Museum, the Willis Linn Jepson Memorial Garden, Indian Council Ground and picnic and recreation facilities.
See also
California Historical Landmarks in Solano County
National Register of Historic Places listings in Solano County, California
References
External links
Peña Adobe Historical Society
Museums in Solano County, California
Buildings and structures in Vacaville, California
Historic house museums in California
Adobe buildings and structures in California
Buildings and structures completed in 1842
1842 establishments in Alta California
California Historical Landmarks
|
```html
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Unicode Regular Expression Algorithms</title>
<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
<link rel="home" href="../../../../index.html" title="Boost.Regex 5.1.3">
<link rel="up" href="../icu.html" title="Working With Unicode and ICU String Types">
<link rel="prev" href="unicode_types.html" title="Unicode regular expression types">
<link rel="next" href="unicode_iter.html" title="Unicode Aware Regex Iterators">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
<td align="center"><a href="../../../../../../../../index.html">Home</a></td>
<td align="center"><a href="../../../../../../../../libs/libraries.htm">Libraries</a></td>
<td align="center"><a href="path_to_url">People</a></td>
<td align="center"><a href="path_to_url">FAQ</a></td>
<td align="center"><a href="../../../../../../../../more/index.htm">More</a></td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="unicode_types.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../icu.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="unicode_iter.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_regex.ref.non_std_strings.icu.unicode_algo"></a><a class="link" href="unicode_algo.html" title="Unicode Regular Expression Algorithms">Unicode
Regular Expression Algorithms</a>
</h5></div></div></div>
<p>
The regular expression algorithms <a class="link" href="../../regex_match.html" title="regex_match"><code class="computeroutput"><span class="identifier">regex_match</span></code></a>, <a class="link" href="../../regex_search.html" title="regex_search"><code class="computeroutput"><span class="identifier">regex_search</span></code></a> and <a class="link" href="../../regex_replace.html" title="regex_replace"><code class="computeroutput"><span class="identifier">regex_replace</span></code></a> all expect that
the character sequence upon which they operate, is encoded in the same
character encoding as the regular expression object with which they are
used. For Unicode regular expressions that behavior is undesirable: while
we may want to process the data in UTF-32 "chunks", the actual
data is much more likely to encoded as either UTF-8 or UTF-16. Therefore
the header <boost/regex/icu.hpp> provides a series of thin wrappers
around these algorithms, called <code class="computeroutput"><span class="identifier">u32regex_match</span></code>,
<code class="computeroutput"><span class="identifier">u32regex_search</span></code>, and
<code class="computeroutput"><span class="identifier">u32regex_replace</span></code>. These
wrappers use iterator-adapters internally to make external UTF-8 or UTF-16
data look as though it's really a UTF-32 sequence, that can then be passed
on to the "real" algorithm.
</p>
<h5>
<a name="boost_regex.ref.non_std_strings.icu.unicode_algo.h0"></a>
<span class="phrase"><a name="boost_regex.ref.non_std_strings.icu.unicode_algo.u32regex_match"></a></span><a class="link" href="unicode_algo.html#boost_regex.ref.non_std_strings.icu.unicode_algo.u32regex_match">u32regex_match</a>
</h5>
<p>
For each <a class="link" href="../../regex_match.html" title="regex_match"><code class="computeroutput"><span class="identifier">regex_match</span></code></a>
algorithm defined by <code class="computeroutput"><span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">regex</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code>,
then <code class="computeroutput"><span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">regex</span><span class="special">/</span><span class="identifier">icu</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code> defines an overloaded algorithm that
takes the same arguments, but which is called <code class="computeroutput"><span class="identifier">u32regex_match</span></code>,
and which will accept UTF-8, UTF-16 or UTF-32 encoded data, as well as
an ICU UnicodeString as input.
</p>
<p>
Example: match a password, encoded in a UTF-16 UnicodeString:
</p>
<pre class="programlisting"><span class="comment">//</span>
<span class="comment">// Find out if *password* meets our password requirements,</span>
<span class="comment">// as defined by the regular expression *requirements*.</span>
<span class="comment">//</span>
<span class="keyword">bool</span> <span class="identifier">is_valid_password</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">UnicodeString</span><span class="special">&</span> <span class="identifier">password</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">UnicodeString</span><span class="special">&</span> <span class="identifier">requirements</span><span class="special">)</span>
<span class="special">{</span>
<span class="keyword">return</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">u32regex_match</span><span class="special">(</span><span class="identifier">password</span><span class="special">,</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">make_u32regex</span><span class="special">(</span><span class="identifier">requirements</span><span class="special">));</span>
<span class="special">}</span>
</pre>
<p>
Example: match a UTF-8 encoded filename:
</p>
<pre class="programlisting"><span class="comment">//</span>
<span class="comment">// Extract filename part of a path from a UTF-8 encoded std::string and return the result</span>
<span class="comment">// as another std::string:</span>
<span class="comment">//</span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="identifier">get_filename</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">&</span> <span class="identifier">path</span><span class="special">)</span>
<span class="special">{</span>
<span class="identifier">boost</span><span class="special">::</span><span class="identifier">u32regex</span> <span class="identifier">r</span> <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">make_u32regex</span><span class="special">(</span><span class="string">"(?:\\A|.*\\\\)([^\\\\]+)"</span><span class="special">);</span>
<span class="identifier">boost</span><span class="special">::</span><span class="identifier">smatch</span> <span class="identifier">what</span><span class="special">;</span>
<span class="keyword">if</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">u32regex_match</span><span class="special">(</span><span class="identifier">path</span><span class="special">,</span> <span class="identifier">what</span><span class="special">,</span> <span class="identifier">r</span><span class="special">))</span>
<span class="special">{</span>
<span class="comment">// extract $1 as a std::string:</span>
<span class="keyword">return</span> <span class="identifier">what</span><span class="special">.</span><span class="identifier">str</span><span class="special">(</span><span class="number">1</span><span class="special">);</span>
<span class="special">}</span>
<span class="keyword">else</span>
<span class="special">{</span>
<span class="keyword">throw</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">runtime_error</span><span class="special">(</span><span class="string">"Invalid pathname"</span><span class="special">);</span>
<span class="special">}</span>
<span class="special">}</span>
</pre>
<h5>
<a name="boost_regex.ref.non_std_strings.icu.unicode_algo.h1"></a>
<span class="phrase"><a name="boost_regex.ref.non_std_strings.icu.unicode_algo.u32regex_search"></a></span><a class="link" href="unicode_algo.html#boost_regex.ref.non_std_strings.icu.unicode_algo.u32regex_search">u32regex_search</a>
</h5>
<p>
For each <a class="link" href="../../regex_search.html" title="regex_search"><code class="computeroutput"><span class="identifier">regex_search</span></code></a>
algorithm defined by <code class="computeroutput"><span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">regex</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code>,
then <code class="computeroutput"><span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">regex</span><span class="special">/</span><span class="identifier">icu</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code> defines an overloaded algorithm that
takes the same arguments, but which is called <code class="computeroutput"><span class="identifier">u32regex_search</span></code>,
and which will accept UTF-8, UTF-16 or UTF-32 encoded data, as well as
an ICU UnicodeString as input.
</p>
<p>
Example: search for a character sequence in a specific language block:
</p>
<pre class="programlisting"><span class="identifier">UnicodeString</span> <span class="identifier">extract_greek</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">UnicodeString</span><span class="special">&</span> <span class="identifier">text</span><span class="special">)</span>
<span class="special">{</span>
<span class="comment">// searches through some UTF-16 encoded text for a block encoded in Greek,</span>
<span class="comment">// this expression is imperfect, but the best we can do for now - searching</span>
<span class="comment">// for specific scripts is actually pretty hard to do right.</span>
<span class="comment">//</span>
<span class="comment">// Here we search for a character sequence that begins with a Greek letter,</span>
<span class="comment">// and continues with characters that are either not-letters ( [^[:L*:]] )</span>
<span class="comment">// or are characters in the Greek character block ( [\\x{370}-\\x{3FF}] ).</span>
<span class="comment">//</span>
<span class="identifier">boost</span><span class="special">::</span><span class="identifier">u32regex</span> <span class="identifier">r</span> <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">make_u32regex</span><span class="special">(</span>
<span class="identifier">L</span><span class="string">"[\\x{370}-\\x{3FF}](?:[^[:L*:]]|[\\x{370}-\\x{3FF}])*"</span><span class="special">);</span>
<span class="identifier">boost</span><span class="special">::</span><span class="identifier">u16match</span> <span class="identifier">what</span><span class="special">;</span>
<span class="keyword">if</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">u32regex_search</span><span class="special">(</span><span class="identifier">text</span><span class="special">,</span> <span class="identifier">what</span><span class="special">,</span> <span class="identifier">r</span><span class="special">))</span>
<span class="special">{</span>
<span class="comment">// extract $0 as a UnicodeString:</span>
<span class="keyword">return</span> <span class="identifier">UnicodeString</span><span class="special">(</span><span class="identifier">what</span><span class="special">[</span><span class="number">0</span><span class="special">].</span><span class="identifier">first</span><span class="special">,</span> <span class="identifier">what</span><span class="special">.</span><span class="identifier">length</span><span class="special">(</span><span class="number">0</span><span class="special">));</span>
<span class="special">}</span>
<span class="keyword">else</span>
<span class="special">{</span>
<span class="keyword">throw</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">runtime_error</span><span class="special">(</span><span class="string">"No Greek found!"</span><span class="special">);</span>
<span class="special">}</span>
<span class="special">}</span>
</pre>
<h5>
<a name="boost_regex.ref.non_std_strings.icu.unicode_algo.h2"></a>
<span class="phrase"><a name="boost_regex.ref.non_std_strings.icu.unicode_algo.u32regex_replace"></a></span><a class="link" href="unicode_algo.html#boost_regex.ref.non_std_strings.icu.unicode_algo.u32regex_replace">u32regex_replace</a>
</h5>
<p>
For each <a class="link" href="../../regex_replace.html" title="regex_replace"><code class="computeroutput"><span class="identifier">regex_replace</span></code></a> algorithm defined
by <code class="computeroutput"><span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">regex</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code>, then <code class="computeroutput"><span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">regex</span><span class="special">/</span><span class="identifier">icu</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code>
defines an overloaded algorithm that takes the same arguments, but which
is called <code class="computeroutput"><span class="identifier">u32regex_replace</span></code>,
and which will accept UTF-8, UTF-16 or UTF-32 encoded data, as well as
an ICU UnicodeString as input. The input sequence and the format string
specifier passed to the algorithm, can be encoded independently (for
example one can be UTF-8, the other in UTF-16), but the result string
/ output iterator argument must use the same character encoding as the
text being searched.
</p>
<p>
Example: Credit card number reformatting:
</p>
<pre class="programlisting"><span class="comment">//</span>
<span class="comment">// Take a credit card number as a string of digits, </span>
<span class="comment">// and reformat it as a human readable string with "-"</span>
<span class="comment">// separating each group of four digit;, </span>
<span class="comment">// note that we're mixing a UTF-32 regex, with a UTF-16</span>
<span class="comment">// string and a UTF-8 format specifier, and it still all </span>
<span class="comment">// just works:</span>
<span class="comment">//</span>
<span class="keyword">const</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">u32regex</span> <span class="identifier">e</span> <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">make_u32regex</span><span class="special">(</span>
<span class="string">"\\A(\\d{3,4})[- ]?(\\d{4})[- ]?(\\d{4})[- ]?(\\d{4})\\z"</span><span class="special">);</span>
<span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">human_format</span> <span class="special">=</span> <span class="string">"$1-$2-$3-$4"</span><span class="special">;</span>
<span class="identifier">UnicodeString</span> <span class="identifier">human_readable_card_number</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">UnicodeString</span><span class="special">&</span> <span class="identifier">s</span><span class="special">)</span>
<span class="special">{</span>
<span class="keyword">return</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">u32regex_replace</span><span class="special">(</span><span class="identifier">s</span><span class="special">,</span> <span class="identifier">e</span><span class="special">,</span> <span class="identifier">human_format</span><span class="special">);</span>
<span class="special">}</span>
</pre>
</div>
<table xmlns:rev="path_to_url~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
file LICENSE_1_0.txt or copy at <a href="path_to_url" target="_top">path_to_url
</p>
</div></td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="unicode_types.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../icu.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="unicode_iter.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
```
|
```go
//
//
// path_to_url
//
// Unless required by applicable law or agreed to in writing, software
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
package endpoint
import (
"bytes"
"context"
"encoding/json"
"fmt"
"net"
"net/http"
"os"
"strconv"
"strings"
"time"
"github.com/google/uuid"
"google.golang.org/grpc"
"google.golang.org/grpc/admin"
"google.golang.org/grpc/credentials"
"google.golang.org/grpc/credentials/insecure"
xdscreds "google.golang.org/grpc/credentials/xds"
"google.golang.org/grpc/health"
grpcHealth "google.golang.org/grpc/health/grpc_health_v1"
"google.golang.org/grpc/keepalive"
"google.golang.org/grpc/metadata"
"google.golang.org/grpc/peer"
"google.golang.org/grpc/reflection"
"google.golang.org/grpc/xds"
"istio.io/istio/pkg/env"
"istio.io/istio/pkg/test/echo"
"istio.io/istio/pkg/test/echo/common"
"istio.io/istio/pkg/test/echo/proto"
"istio.io/istio/pkg/test/echo/server/forwarder"
"istio.io/istio/pkg/test/util/retry"
)
var _ Instance = &grpcInstance{}
// grpcServer is the intersection of used methods for grpc.Server and xds.GRPCServer
type grpcServer interface {
reflection.GRPCServer
Serve(listener net.Listener) error
Stop()
}
type grpcInstance struct {
Config
server grpcServer
cleanups []func()
f *forwarder.Instance
}
func newGRPC(config Config) Instance {
return &grpcInstance{
Config: config,
f: forwarder.New(),
}
}
func (s *grpcInstance) GetConfig() Config {
return s.Config
}
func (s *grpcInstance) newServer(opts ...grpc.ServerOption) grpcServer {
if s.Port.XDSServer {
if len(s.Port.XDSTestBootstrap) > 0 {
opts = append(opts, xds.BootstrapContentsForTesting(s.Port.XDSTestBootstrap))
}
epLog.Infof("Using xDS for serverside gRPC on %d", s.Port.Port)
grpcServer, err := xds.NewGRPCServer(opts...)
if err != nil {
return nil
}
return grpcServer
}
return grpc.NewServer(opts...)
}
func (s *grpcInstance) Start(onReady OnReadyFunc) error {
// Listen on the given port and update the port if it changed from what was passed in.
listener, p, err := listenOnAddress(s.ListenerIP, s.Port.Port)
if err != nil {
return err
}
// Store the actual listening port back to the argument.
s.Port.Port = p
opts := []grpc.ServerOption{
grpc.KeepaliveParams(keepalive.ServerParameters{
MaxConnectionIdle: idleTimeout,
}),
}
if s.Port.TLS {
epLog.Infof("Listening GRPC (over TLS) on %v", p)
// Create the TLS credentials
creds, errCreds := credentials.NewServerTLSFromFile(s.TLSCert, s.TLSKey)
if errCreds != nil {
epLog.Errorf("could not load TLS keys: %s", errCreds)
}
opts = append(opts, grpc.Creds(creds))
} else if s.Port.XDSServer {
epLog.Infof("Listening GRPC (over xDS-configured mTLS) on %v", p)
creds, err := xdscreds.NewServerCredentials(xdscreds.ServerOptions{
FallbackCreds: insecure.NewCredentials(),
})
if err != nil {
return err
}
opts = append(opts, grpc.Creds(creds))
} else {
epLog.Infof("Listening GRPC on %v", p)
}
s.server = s.newServer(opts...)
// add the standard grpc health check
healthServer := health.NewServer()
grpcHealth.RegisterHealthServer(s.server, healthServer)
proto.RegisterEchoTestServiceServer(s.server, &EchoGrpcHandler{
Config: s.Config,
Forwarder: s.f,
})
reflection.Register(s.server)
if val := env.Register("EXPOSE_GRPC_ADMIN", false, "").Get(); val {
cleanup, err := admin.Register(s.server)
if err != nil {
return err
}
s.cleanups = append(s.cleanups, cleanup)
}
// Start serving GRPC traffic.
go func() {
err := s.server.Serve(listener)
epLog.Warnf("Port %d listener terminated with error: %v", p, err)
}()
// Notify the WaitGroup once the port has transitioned to ready.
go s.awaitReady(func() {
healthServer.SetServingStatus("", grpcHealth.HealthCheckResponse_SERVING)
onReady()
}, listener)
return nil
}
func (s *grpcInstance) awaitReady(onReady OnReadyFunc, listener net.Listener) {
defer onReady()
err := retry.UntilSuccess(func() error {
cert, key, ca, err := s.certsFromBootstrapForReady()
if err != nil {
return err
}
req := &proto.ForwardEchoRequest{
Url: "grpc://" + listener.Addr().String(),
Message: "hello",
TimeoutMicros: common.DurationToMicros(readyInterval),
}
if s.Port.XDSReadinessTLS {
// TODO: using the servers key/cert is not always valid, it may not be allowed to make requests to itself
req.CertFile = cert
req.KeyFile = key
req.CaCertFile = ca
req.InsecureSkipVerify = true
}
_, err = s.f.ForwardEcho(context.Background(), &forwarder.Config{
XDSTestBootstrap: s.Port.XDSTestBootstrap,
Request: req,
})
return err
}, retry.Timeout(readyTimeout), retry.Delay(readyInterval))
if err != nil {
epLog.Errorf("readiness failed for GRPC endpoint %s: %v", listener.Addr().String(), err)
} else {
epLog.Infof("ready for GRPC endpoint %s", listener.Addr().String())
}
}
// TODO (hack) we have to send certs OR use xds:///fqdn. We don't know our own fqdn, and even if we did
// we could send traffic to another instance. Instead we look into gRPC internals to authenticate with ourself.
func (s *grpcInstance) certsFromBootstrapForReady() (cert string, key string, ca string, err error) {
if !s.Port.XDSServer {
return
}
var bootstrapData []byte
if data := s.Port.XDSTestBootstrap; len(data) > 0 {
bootstrapData = data
} else if path := os.Getenv("GRPC_XDS_BOOTSTRAP"); len(path) > 0 {
bootstrapData, err = os.ReadFile(path)
} else if data := os.Getenv("GRPC_XDS_BOOTSTRAP_CONFIG"); len(data) > 0 {
bootstrapData = []byte(data)
}
var bootstrap Bootstrap
if uerr := json.Unmarshal(bootstrapData, &bootstrap); uerr != nil {
err = uerr
return
}
certs := bootstrap.FileWatcherProvider()
if certs == nil {
err = fmt.Errorf("no certs found in bootstrap")
return
}
cert = certs.CertificateFile
key = certs.PrivateKeyFile
ca = certs.CACertificateFile
return
}
func (s *grpcInstance) Close() error {
if s.server != nil {
s.server.Stop()
}
if s.f != nil {
_ = s.f.Close()
}
for _, cleanup := range s.cleanups {
cleanup()
}
return nil
}
type EchoGrpcHandler struct {
proto.UnimplementedEchoTestServiceServer
Config
Forwarder *forwarder.Instance
}
func (h *EchoGrpcHandler) Echo(ctx context.Context, req *proto.EchoRequest) (*proto.EchoResponse, error) {
h.ReportRequest()
defer common.Metrics.GrpcRequests.With(common.PortLabel.Value(strconv.Itoa(h.Port.Port))).Increment()
body := bytes.Buffer{}
md, ok := metadata.FromIncomingContext(ctx)
if ok {
for key, values := range md {
if strings.HasSuffix(key, "-bin") {
// Skip binary headers.
continue
}
field := key
if key == ":authority" {
for _, value := range values {
echo.HostField.Write(&body, value)
}
}
for _, value := range values {
echo.RequestHeaderField.WriteKeyValue(&body, field, value)
}
}
}
id := uuid.New()
epLog.WithLabels("message", req.GetMessage(), "headers", md, "id", id).Infof("GRPC Request")
portNumber := 0
if h.Port != nil {
portNumber = h.Port.Port
}
ip := "0.0.0.0"
if peerInfo, ok := peer.FromContext(ctx); ok {
ip, _, _ = net.SplitHostPort(peerInfo.Addr.String())
}
echo.StatusCodeField.Write(&body, strconv.Itoa(http.StatusOK))
echo.ServiceVersionField.Write(&body, h.Version)
echo.ServicePortField.Write(&body, strconv.Itoa(portNumber))
echo.ClusterField.WriteNonEmpty(&body, h.Cluster)
echo.NamespaceField.WriteNonEmpty(&body, h.Namespace)
echo.IPField.Write(&body, ip)
echo.IstioVersionField.WriteNonEmpty(&body, h.IstioVersion)
echo.ProtocolField.Write(&body, "GRPC")
echo.Field("Echo").Write(&body, req.GetMessage())
if hostname, err := os.Hostname(); err == nil {
echo.HostnameField.Write(&body, hostname)
}
epLog.WithLabels("id", id).Infof("GRPC Response")
return &proto.EchoResponse{Message: body.String()}, nil
}
func (h *EchoGrpcHandler) ForwardEcho(ctx context.Context, req *proto.ForwardEchoRequest) (*proto.ForwardEchoResponse, error) {
id := uuid.New()
l := epLog.WithLabels("url", req.Url, "id", id)
l.Infof("ForwardEcho request")
t0 := time.Now()
ret, err := h.Forwarder.ForwardEcho(ctx, &forwarder.Config{Request: req})
if err == nil {
l.WithLabels("latency", time.Since(t0)).Infof("ForwardEcho response complete: %v", ret.GetOutput())
} else {
l.WithLabels("latency", time.Since(t0)).Infof("ForwardEcho response failed: %v", err)
}
return ret, err
}
```
|
G. Loganathan is an Indian politician. He serves as the Vellore ADMK party general secretary and Member of the Legislative Assembly (MLA). In 2016, he was selected as MLA candidate (KV Kuppam constituency) by CM Jayalalitha. He won that election by 9,746 votes, defeating the DMK MLA candidate V. Amalu. He served in the Indian Army.
References
Living people
Year of birth missing (living people)
Indian politicians
Tamil Nadu MLAs 2016–2021
|
Omega (named Drumcliff until 1898) was a four-masted, steel-hulled barque built in Greenock, Scotland in 1887. In 1957 Omega became the last working cargo-carrying square-rigger afloat. She carried oil, guano, nitrate, wheat, and other goods. She sank in 1958, ending that age of sail.
History
Drumcliff was built at the shipyard of J. Russell & Co. in Greenock, Scotland, for Gillison & Chadwick, Liverpool, England. After her launching in 1887 she was placed under the command of Captain H. Davies.
On 28 July 1898, Drumcliff was sold to the Hamburger Reederei AG, which renamed her Omega. From 1898 until 1905 she sailed under Captain H. Krause, who was in command for her first great trip around the world. In 1898 she left the Lizard in the south of England for Adelaide, Australia. The following year she sailed to Newcastle, Australia, putting in at the Chilean harbours of Tocopilla and Iquique, before returning to the Lizard.
From 1906 until 1907 she sailed under Captain M. Ratzsch, followed by Captain A. Schellhas from 1908 until 1920. Under his command the ship also made long passages between Europe, South America (Pisagua and Tocopilla in Chile), Africa (Port Nolloth in South Africa) and Australia (Newcastle). From 1910 until 1912, under Captain G. Oellrich, she sailed to harbors on the West Coast of the US (San Diego, Portland, Oregon), in Europe (Hamburg, Rotterdam), Australia (Sydney, Newcastle), and South America (Chile). From 1913 until 1914 Captain P. Hammer assumed command.
During the First World War, the ship was interned in Peru. In 1918, she became a sail training ship.
In 1920, Omega was released to Peru as a war reparation, and in 1926 she was transferred to the guano firm Compañia Administradora del Guano in Callao, Peru. From then on, the ship was used to transport guano from outlying islands to the Peruvian mainland.
Over the course of the following decades, as all the large sailing ships were gradually removed from service, in the wake of the sinking of and the end of service of , Omega remained.
"The only commercial square-rigged sailing ships still operating anywhere in the world, in the year 1953, were the Peruvian guano barques: the three-masters Tellus and Maipo, and the four-master Omega'."
In 1957 Omega became the last. On 26 June 1958 she embarked on a voyage from the Pachamac Islands to Huacho, both in the Lima region along the Peruvian coast, with a load of 3,000 tons of guano. She sprang a leak and sank, ending her era of sail. Her captain, Juan Anibal Escobar Hurtado from Callao, was charged with sinking the ship and had his license suspended. In spite of paying divers to photograph the wreck in order to show that Omega sank due to age and poor maintenance, he was never cleared and died six years after the sinking, on 16 August 1964.
References and notes
Bibliography
According to Bruzelius, there are discrepancies regarding the measurements of Drumcliff/Omega. 94.86 m × 13.15 m × 7.36 m (311'3 × 43'2 × 24'2 in feet), with another source indicating 90.96 m × 13.16 m ×7.47 m.
Ageofsail.net, Nov. 15, 2006
Further reading
External links
Drumcliff, gelatin silver photograph , State Library of Victoria, Australia
Omega, cover of Sea Breezes'', Christmas 1955
Barques
Windjammers
Individual sailing vessels
Sailing ships of the German Empire
Merchant ships of the German Empire
World War I merchant ships of the German Empire
Ships built on the River Clyde
Training ships
Four-masted ships
Guano trade
Ships of Peru
World War II merchant ships of Peru
Maritime incidents in 1958
1887 ships
|
```yaml
title: 'Vuexy - Admin Dashboard'
type: 'dashboard'
category: 'Admin & Dashboard'
img: 'path_to_url
href: 'path_to_url
description: 'Vuexy is a production ready, carefully crafted, extensive Admin Dashboard. It is mainly powered by BootstrapVue and the Vue.js Composition API. The dashboard is API powered with JWT Authentication and ability based access control.'
provider: 'PIXINVENT'
price: '$32.00'
```
|
Yegor Vyacheslavovich Kiryakov (; born 4 February 1974) is a former Russian professional footballer.
Club career
He made his professional debut in the Soviet Second League B in 1991 for FC Spartak Oryol.
Personal life
He is the younger brother of Sergei Kiriakov.
Honours
Russian Premier League bronze: 1992.
References
1974 births
Sportspeople from Oryol
Living people
Soviet men's footballers
Russian men's footballers
Men's association football midfielders
FC Dynamo Moscow players
FC Chernomorets Novorossiysk players
FC Kuban Krasnodar players
FC Oryol players
Russian Premier League players
|
```shell
Intro to `iptables`
Quick port test with `netcat`
Find services running on your host
List your IPv6 configuration
Make use of `netstat`
```
|
```scala
package org.thp.thehive.services
import java.io.{File, InputStream}
import java.nio.file.{Path, Files => JFiles}
import java.util.UUID
import org.thp.scalligraph.EntityName
import org.thp.scalligraph.auth.AuthContext
import org.thp.scalligraph.controllers.FFile
import org.thp.scalligraph.models._
import org.thp.scalligraph.traversal.TraversalOps._
import org.thp.thehive.TestAppBuilder
import play.api.libs.Files
import play.api.libs.Files.TemporaryFileCreator
import play.api.test.{NoTemporaryFileCreator, PlaySpecification}
import scala.annotation.tailrec
class AttachmentSrvTest extends PlaySpecification with TestAppBuilder {
implicit val authContext: AuthContext = DummyUserSrv(userId = "certuser@thehive.local", organisation = "cert").getSystemAuthContext
@tailrec
private def streamCompare(is1: InputStream, is2: InputStream): Boolean = {
val n1 = is1.read()
val n2 = is2.read()
if (n1 == -1 || n2 == -1) n1 == n2
else (n1 == n2) && streamCompare(is1, is2)
}
"attachment service" should {
"create an attachment from a file" in testApp { app =>
WithFakeScalligraphFile { tempFile =>
val r =
app[Database].tryTransaction(implicit graph => app[AttachmentSrv].create(FFile("test.txt", tempFile.path, "text/plain")))
r must beSuccessfulTry.which { a =>
a.name shouldEqual "test.txt"
a.contentType shouldEqual "text/plain"
a.size shouldEqual JFiles.size(tempFile.path)
a.hashes must containAllOf(app[AttachmentSrv].hashers.fromPath(tempFile.path))
}
}
}
"create an attachment from file data" in testApp { app =>
WithFakeScalligraphFile { tempFile =>
val r = app[Database].tryTransaction(implicit graph => app[AttachmentSrv].create("test2.txt", "text/plain", JFiles.readAllBytes(tempFile)))
r must beSuccessfulTry.which { a =>
a.name shouldEqual "test2.txt"
a.contentType shouldEqual "text/plain"
a.size shouldEqual JFiles.size(tempFile.path)
a.hashes must containAllOf(app[AttachmentSrv].hashers.fromPath(tempFile.path))
}
}
}
"get an attachment" in testApp { app =>
val allAttachments = app[Database].roTransaction(implicit graph => app[AttachmentSrv].startTraversal.toSeq)
allAttachments must not(beEmpty)
app[Database].roTransaction { implicit graph =>
app[AttachmentSrv].get(EntityName(allAttachments.head.attachmentId)).exists must beTrue
}
}
}
}
object WithFakeScalligraphFile {
def apply[A](body: Files.TemporaryFile => A): A = {
val tempFile = File.createTempFile("thehive-", "-test")
JFiles.write(tempFile.toPath, s"hello ${UUID.randomUUID()}".getBytes)
val fakeTempFile = new Files.TemporaryFile {
override def path: Path = tempFile.toPath
override def file: File = tempFile
override def temporaryFileCreator: TemporaryFileCreator = NoTemporaryFileCreator
}
try body(fakeTempFile)
finally {
JFiles.deleteIfExists(tempFile.toPath)
()
}
}
}
```
|
```html
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "path_to_url">
<html xmlns="path_to_url">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.17"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Jetson Inference: imageWriter Class Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectlogo"><img alt="Logo" src="NVLogo_2D.jpg"/></td>
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Jetson Inference
</div>
<div id="projectbrief">DNN Vision Library</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.17 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "search",false,'Search');
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('classimageWriter.html',''); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="summary">
<a href="#pub-methods">Public Member Functions</a> |
<a href="#pub-static-methods">Static Public Member Functions</a> |
<a href="#pub-static-attribs">Static Public Attributes</a> |
<a href="#pro-methods">Protected Member Functions</a> |
<a href="#pro-attribs">Protected Attributes</a> |
<a href="classimageWriter-members.html">List of all members</a> </div>
<div class="headertitle">
<div class="title">imageWriter Class Reference<div class="ingroups"><a class="el" href="group__util.html">Utilities Library (jetson-utils)</a> » <a class="el" href="group__image.html">Image I/O</a></div></div> </div>
</div><!--header-->
<div class="contents">
<p>Save an image or set of images to disk.
<a href="classimageWriter.html#details">More...</a></p>
<p><code>#include <<a class="el" href="imageWriter_8h_source.html">imageWriter.h</a>></code></p>
<div class="dynheader">
Inheritance diagram for imageWriter:</div>
<div class="dyncontent">
<div class="center">
<img src="classimageWriter.png" usemap="#imageWriter_map" alt=""/>
<map id="imageWriter_map" name="imageWriter_map">
<area href="classvideoOutput.html" title="The videoOutput API is for rendering and transmitting frames to video input devices such as display w..." alt="videoOutput" shape="rect" coords="0,0,80,24"/>
</map>
</div></div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:a0038555473cca96319845f4e67c92882"><td class="memItemLeft" align="right" valign="top">virtual </td><td class="memItemRight" valign="bottom"><a class="el" href="classimageWriter.html#a0038555473cca96319845f4e67c92882">~imageWriter</a> ()</td></tr>
<tr class="memdesc:a0038555473cca96319845f4e67c92882"><td class="mdescLeft"> </td><td class="mdescRight">Destructor. <a href="classimageWriter.html#a0038555473cca96319845f4e67c92882">More...</a><br /></td></tr>
<tr class="separator:a0038555473cca96319845f4e67c92882"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a63ca941281c3fff61025a5d0c5bf824e"><td class="memTemplParams" colspan="2">template<typename T > </td></tr>
<tr class="memitem:a63ca941281c3fff61025a5d0c5bf824e"><td class="memTemplItemLeft" align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classimageWriter.html#a63ca941281c3fff61025a5d0c5bf824e">Render</a> (T *image, uint32_t width, uint32_t height)</td></tr>
<tr class="memdesc:a63ca941281c3fff61025a5d0c5bf824e"><td class="mdescLeft"> </td><td class="mdescRight">Save the next frame. <a href="classimageWriter.html#a63ca941281c3fff61025a5d0c5bf824e">More...</a><br /></td></tr>
<tr class="separator:a63ca941281c3fff61025a5d0c5bf824e"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a6867f5326a09025d9a21bf3932314635"><td class="memItemLeft" align="right" valign="top">virtual bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classimageWriter.html#a6867f5326a09025d9a21bf3932314635">Render</a> (void *image, uint32_t width, uint32_t height, <a class="el" href="group__imageFormat.html#ga931c48e08f361637d093355d64583406">imageFormat</a> format)</td></tr>
<tr class="memdesc:a6867f5326a09025d9a21bf3932314635"><td class="mdescLeft"> </td><td class="mdescRight">Save the next frame. <a href="classimageWriter.html#a6867f5326a09025d9a21bf3932314635">More...</a><br /></td></tr>
<tr class="separator:a6867f5326a09025d9a21bf3932314635"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ae5d8c048302526edb9e6a84edbc4cb97"><td class="memItemLeft" align="right" valign="top">virtual uint32_t </td><td class="memItemRight" valign="bottom"><a class="el" href="classimageWriter.html#ae5d8c048302526edb9e6a84edbc4cb97">GetType</a> () const</td></tr>
<tr class="memdesc:ae5d8c048302526edb9e6a84edbc4cb97"><td class="mdescLeft"> </td><td class="mdescRight">Return the interface type (<a class="el" href="classimageWriter.html#af767ee4c3dfbedd450b5e3c7f86b326a" title="Unique type identifier of imageWriter class.">imageWriter::Type</a>) <a href="classimageWriter.html#ae5d8c048302526edb9e6a84edbc4cb97">More...</a><br /></td></tr>
<tr class="separator:ae5d8c048302526edb9e6a84edbc4cb97"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="inherit_header pub_methods_classvideoOutput"><td colspan="2" onclick="javascript:toggleInherit('pub_methods_classvideoOutput')"><img src="closed.png" alt="-"/> Public Member Functions inherited from <a class="el" href="classvideoOutput.html">videoOutput</a></td></tr>
<tr class="memitem:a2186412156484860e31d827c10becf96 inherit pub_methods_classvideoOutput"><td class="memItemLeft" align="right" valign="top">virtual </td><td class="memItemRight" valign="bottom"><a class="el" href="classvideoOutput.html#a2186412156484860e31d827c10becf96">~videoOutput</a> ()</td></tr>
<tr class="memdesc:a2186412156484860e31d827c10becf96 inherit pub_methods_classvideoOutput"><td class="mdescLeft"> </td><td class="mdescRight">Destroy interface and release all resources. <a href="classvideoOutput.html#a2186412156484860e31d827c10becf96">More...</a><br /></td></tr>
<tr class="separator:a2186412156484860e31d827c10becf96 inherit pub_methods_classvideoOutput"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ac63d627d52174400c01c28bb0de82993 inherit pub_methods_classvideoOutput"><td class="memTemplParams" colspan="2">template<typename T > </td></tr>
<tr class="memitem:ac63d627d52174400c01c28bb0de82993 inherit pub_methods_classvideoOutput"><td class="memTemplItemLeft" align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classvideoOutput.html#ac63d627d52174400c01c28bb0de82993">Render</a> (T *image, uint32_t width, uint32_t height)</td></tr>
<tr class="memdesc:ac63d627d52174400c01c28bb0de82993 inherit pub_methods_classvideoOutput"><td class="mdescLeft"> </td><td class="mdescRight">Render and output the next frame to the stream. <a href="classvideoOutput.html#ac63d627d52174400c01c28bb0de82993">More...</a><br /></td></tr>
<tr class="separator:ac63d627d52174400c01c28bb0de82993 inherit pub_methods_classvideoOutput"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a58d163c8d3e54f336bf2dda4a759750e inherit pub_methods_classvideoOutput"><td class="memItemLeft" align="right" valign="top">virtual bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classvideoOutput.html#a58d163c8d3e54f336bf2dda4a759750e">Open</a> ()</td></tr>
<tr class="memdesc:a58d163c8d3e54f336bf2dda4a759750e inherit pub_methods_classvideoOutput"><td class="mdescLeft"> </td><td class="mdescRight">Begin streaming the device. <a href="classvideoOutput.html#a58d163c8d3e54f336bf2dda4a759750e">More...</a><br /></td></tr>
<tr class="separator:a58d163c8d3e54f336bf2dda4a759750e inherit pub_methods_classvideoOutput"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a552252a397249335e77755e0b911225e inherit pub_methods_classvideoOutput"><td class="memItemLeft" align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="classvideoOutput.html#a552252a397249335e77755e0b911225e">Close</a> ()</td></tr>
<tr class="memdesc:a552252a397249335e77755e0b911225e inherit pub_methods_classvideoOutput"><td class="mdescLeft"> </td><td class="mdescRight">Stop streaming the device. <a href="classvideoOutput.html#a552252a397249335e77755e0b911225e">More...</a><br /></td></tr>
<tr class="separator:a552252a397249335e77755e0b911225e inherit pub_methods_classvideoOutput"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a2a3cf8d6230e26e27c5d22b29a150bdc inherit pub_methods_classvideoOutput"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classvideoOutput.html#a2a3cf8d6230e26e27c5d22b29a150bdc">IsStreaming</a> () const</td></tr>
<tr class="memdesc:a2a3cf8d6230e26e27c5d22b29a150bdc inherit pub_methods_classvideoOutput"><td class="mdescLeft"> </td><td class="mdescRight">Check if the device is actively streaming or not. <a href="classvideoOutput.html#a2a3cf8d6230e26e27c5d22b29a150bdc">More...</a><br /></td></tr>
<tr class="separator:a2a3cf8d6230e26e27c5d22b29a150bdc inherit pub_methods_classvideoOutput"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:afaba8521f7ff078293ee4052a28ee71c inherit pub_methods_classvideoOutput"><td class="memItemLeft" align="right" valign="top">uint32_t </td><td class="memItemRight" valign="bottom"><a class="el" href="classvideoOutput.html#afaba8521f7ff078293ee4052a28ee71c">GetWidth</a> () const</td></tr>
<tr class="memdesc:afaba8521f7ff078293ee4052a28ee71c inherit pub_methods_classvideoOutput"><td class="mdescLeft"> </td><td class="mdescRight">Return the width of the stream, in pixels. <a href="classvideoOutput.html#afaba8521f7ff078293ee4052a28ee71c">More...</a><br /></td></tr>
<tr class="separator:afaba8521f7ff078293ee4052a28ee71c inherit pub_methods_classvideoOutput"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aa225fb199069cf2a4b30f467e237da73 inherit pub_methods_classvideoOutput"><td class="memItemLeft" align="right" valign="top">uint32_t </td><td class="memItemRight" valign="bottom"><a class="el" href="classvideoOutput.html#aa225fb199069cf2a4b30f467e237da73">GetHeight</a> () const</td></tr>
<tr class="memdesc:aa225fb199069cf2a4b30f467e237da73 inherit pub_methods_classvideoOutput"><td class="mdescLeft"> </td><td class="mdescRight">Return the height of the stream, in pixels. <a href="classvideoOutput.html#aa225fb199069cf2a4b30f467e237da73">More...</a><br /></td></tr>
<tr class="separator:aa225fb199069cf2a4b30f467e237da73 inherit pub_methods_classvideoOutput"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a26c37f79e965f1b9741b4d9b3923bd6b inherit pub_methods_classvideoOutput"><td class="memItemLeft" align="right" valign="top">float </td><td class="memItemRight" valign="bottom"><a class="el" href="classvideoOutput.html#a26c37f79e965f1b9741b4d9b3923bd6b">GetFrameRate</a> () const</td></tr>
<tr class="memdesc:a26c37f79e965f1b9741b4d9b3923bd6b inherit pub_methods_classvideoOutput"><td class="mdescLeft"> </td><td class="mdescRight">Return the framerate, in Hz or FPS. <a href="classvideoOutput.html#a26c37f79e965f1b9741b4d9b3923bd6b">More...</a><br /></td></tr>
<tr class="separator:a26c37f79e965f1b9741b4d9b3923bd6b inherit pub_methods_classvideoOutput"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ab38d8fb1ad7855cf428d9f8cf5806bb4 inherit pub_methods_classvideoOutput"><td class="memItemLeft" align="right" valign="top">uint64_t </td><td class="memItemRight" valign="bottom"><a class="el" href="classvideoOutput.html#ab38d8fb1ad7855cf428d9f8cf5806bb4">GetFrameCount</a> () const</td></tr>
<tr class="memdesc:ab38d8fb1ad7855cf428d9f8cf5806bb4 inherit pub_methods_classvideoOutput"><td class="mdescLeft"> </td><td class="mdescRight">Return the number of frames output. <a href="classvideoOutput.html#ab38d8fb1ad7855cf428d9f8cf5806bb4">More...</a><br /></td></tr>
<tr class="separator:ab38d8fb1ad7855cf428d9f8cf5806bb4 inherit pub_methods_classvideoOutput"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a47edea2ad237e50cfbd6d0a192280ee5 inherit pub_methods_classvideoOutput"><td class="memItemLeft" align="right" valign="top">const <a class="el" href="structURI.html">URI</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="classvideoOutput.html#a47edea2ad237e50cfbd6d0a192280ee5">GetResource</a> () const</td></tr>
<tr class="memdesc:a47edea2ad237e50cfbd6d0a192280ee5 inherit pub_methods_classvideoOutput"><td class="mdescLeft"> </td><td class="mdescRight">Return the resource <a class="el" href="structURI.html" title="Resource URI of a video device, IP stream, or file/directory.">URI</a> of the stream. <a href="classvideoOutput.html#a47edea2ad237e50cfbd6d0a192280ee5">More...</a><br /></td></tr>
<tr class="separator:a47edea2ad237e50cfbd6d0a192280ee5 inherit pub_methods_classvideoOutput"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a59f21f27a0efe56541fbe15f1d5f46ce inherit pub_methods_classvideoOutput"><td class="memItemLeft" align="right" valign="top">const <a class="el" href="structvideoOptions.html">videoOptions</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="classvideoOutput.html#a59f21f27a0efe56541fbe15f1d5f46ce">GetOptions</a> () const</td></tr>
<tr class="memdesc:a59f21f27a0efe56541fbe15f1d5f46ce inherit pub_methods_classvideoOutput"><td class="mdescLeft"> </td><td class="mdescRight">Return the <a class="el" href="structvideoOptions.html" title="The videoOptions struct contains common settings that are used to configure and query videoSource and...">videoOptions</a> of the stream. <a href="classvideoOutput.html#a59f21f27a0efe56541fbe15f1d5f46ce">More...</a><br /></td></tr>
<tr class="separator:a59f21f27a0efe56541fbe15f1d5f46ce inherit pub_methods_classvideoOutput"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ad2da4bab42fbd19a851e205647443ea5 inherit pub_methods_classvideoOutput"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classvideoOutput.html#ad2da4bab42fbd19a851e205647443ea5">AddOutput</a> (<a class="el" href="classvideoOutput.html">videoOutput</a> *output)</td></tr>
<tr class="memdesc:ad2da4bab42fbd19a851e205647443ea5 inherit pub_methods_classvideoOutput"><td class="mdescLeft"> </td><td class="mdescRight">Add an output sub-stream. <a href="classvideoOutput.html#ad2da4bab42fbd19a851e205647443ea5">More...</a><br /></td></tr>
<tr class="separator:ad2da4bab42fbd19a851e205647443ea5 inherit pub_methods_classvideoOutput"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:adc630f31a8d55dc852ac1e01c1f7dc58 inherit pub_methods_classvideoOutput"><td class="memItemLeft" align="right" valign="top">uint32_t </td><td class="memItemRight" valign="bottom"><a class="el" href="classvideoOutput.html#adc630f31a8d55dc852ac1e01c1f7dc58">GetNumOutputs</a> () const</td></tr>
<tr class="memdesc:adc630f31a8d55dc852ac1e01c1f7dc58 inherit pub_methods_classvideoOutput"><td class="mdescLeft"> </td><td class="mdescRight">Return the number of sub-streams. <a href="classvideoOutput.html#adc630f31a8d55dc852ac1e01c1f7dc58">More...</a><br /></td></tr>
<tr class="separator:adc630f31a8d55dc852ac1e01c1f7dc58 inherit pub_methods_classvideoOutput"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aa1a64933421c48f1af63ea12a8217421 inherit pub_methods_classvideoOutput"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classvideoOutput.html">videoOutput</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="classvideoOutput.html#aa1a64933421c48f1af63ea12a8217421">GetOutput</a> (uint32_t index) const</td></tr>
<tr class="memdesc:aa1a64933421c48f1af63ea12a8217421 inherit pub_methods_classvideoOutput"><td class="mdescLeft"> </td><td class="mdescRight">Return a sub-stream. <a href="classvideoOutput.html#aa1a64933421c48f1af63ea12a8217421">More...</a><br /></td></tr>
<tr class="separator:aa1a64933421c48f1af63ea12a8217421 inherit pub_methods_classvideoOutput"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a7968711adc8814a9ec4e127e7b3a8bb2 inherit pub_methods_classvideoOutput"><td class="memItemLeft" align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="classvideoOutput.html#a7968711adc8814a9ec4e127e7b3a8bb2">SetStatus</a> (const char *str)</td></tr>
<tr class="memdesc:a7968711adc8814a9ec4e127e7b3a8bb2 inherit pub_methods_classvideoOutput"><td class="mdescLeft"> </td><td class="mdescRight">Set a status string (i.e. <a href="classvideoOutput.html#a7968711adc8814a9ec4e127e7b3a8bb2">More...</a><br /></td></tr>
<tr class="separator:a7968711adc8814a9ec4e127e7b3a8bb2 inherit pub_methods_classvideoOutput"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a0a3ed32e27da1e996dc21c0339dc5a95 inherit pub_methods_classvideoOutput"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classvideoOutput.html#a0a3ed32e27da1e996dc21c0339dc5a95">IsType</a> (uint32_t type) const</td></tr>
<tr class="memdesc:a0a3ed32e27da1e996dc21c0339dc5a95 inherit pub_methods_classvideoOutput"><td class="mdescLeft"> </td><td class="mdescRight">Check if this stream is of a particular type. <a href="classvideoOutput.html#a0a3ed32e27da1e996dc21c0339dc5a95">More...</a><br /></td></tr>
<tr class="separator:a0a3ed32e27da1e996dc21c0339dc5a95 inherit pub_methods_classvideoOutput"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aa5463fc78e3d259fa18ea2e6349e21c8 inherit pub_methods_classvideoOutput"><td class="memTemplParams" colspan="2">template<typename T > </td></tr>
<tr class="memitem:aa5463fc78e3d259fa18ea2e6349e21c8 inherit pub_methods_classvideoOutput"><td class="memTemplItemLeft" align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classvideoOutput.html#aa5463fc78e3d259fa18ea2e6349e21c8">IsType</a> () const</td></tr>
<tr class="memdesc:aa5463fc78e3d259fa18ea2e6349e21c8 inherit pub_methods_classvideoOutput"><td class="mdescLeft"> </td><td class="mdescRight">Check if a this stream is of a particular type. <a href="classvideoOutput.html#aa5463fc78e3d259fa18ea2e6349e21c8">More...</a><br /></td></tr>
<tr class="separator:aa5463fc78e3d259fa18ea2e6349e21c8 inherit pub_methods_classvideoOutput"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a5a6c66bde88abdfa857bc9715acb8314 inherit pub_methods_classvideoOutput"><td class="memItemLeft" align="right" valign="top">const char * </td><td class="memItemRight" valign="bottom"><a class="el" href="classvideoOutput.html#a5a6c66bde88abdfa857bc9715acb8314">TypeToStr</a> () const</td></tr>
<tr class="memdesc:a5a6c66bde88abdfa857bc9715acb8314 inherit pub_methods_classvideoOutput"><td class="mdescLeft"> </td><td class="mdescRight">Convert this stream's class type to string. <a href="classvideoOutput.html#a5a6c66bde88abdfa857bc9715acb8314">More...</a><br /></td></tr>
<tr class="separator:a5a6c66bde88abdfa857bc9715acb8314 inherit pub_methods_classvideoOutput"><td class="memSeparator" colspan="2"> </td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-static-methods"></a>
Static Public Member Functions</h2></td></tr>
<tr class="memitem:a4729467d9c95d3e4d92cac3a98a6e96c"><td class="memItemLeft" align="right" valign="top">static <a class="el" href="classimageWriter.html">imageWriter</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="classimageWriter.html#a4729467d9c95d3e4d92cac3a98a6e96c">Create</a> (const char *path, const <a class="el" href="structvideoOptions.html">videoOptions</a> &options=<a class="el" href="structvideoOptions.html">videoOptions</a>())</td></tr>
<tr class="memdesc:a4729467d9c95d3e4d92cac3a98a6e96c"><td class="mdescLeft"> </td><td class="mdescRight">Create an <a class="el" href="classimageWriter.html" title="Save an image or set of images to disk.">imageWriter</a> instance from a path and optional <a class="el" href="structvideoOptions.html" title="The videoOptions struct contains common settings that are used to configure and query videoSource and...">videoOptions</a>. <a href="classimageWriter.html#a4729467d9c95d3e4d92cac3a98a6e96c">More...</a><br /></td></tr>
<tr class="separator:a4729467d9c95d3e4d92cac3a98a6e96c"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ad057d8191dbaad70f8a6fdb27d690197"><td class="memItemLeft" align="right" valign="top">static <a class="el" href="classimageWriter.html">imageWriter</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="classimageWriter.html#ad057d8191dbaad70f8a6fdb27d690197">Create</a> (const <a class="el" href="structvideoOptions.html">videoOptions</a> &options)</td></tr>
<tr class="memdesc:ad057d8191dbaad70f8a6fdb27d690197"><td class="mdescLeft"> </td><td class="mdescRight">Create an <a class="el" href="classimageWriter.html" title="Save an image or set of images to disk.">imageWriter</a> instance from the provided video options. <a href="classimageWriter.html#ad057d8191dbaad70f8a6fdb27d690197">More...</a><br /></td></tr>
<tr class="separator:ad057d8191dbaad70f8a6fdb27d690197"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ae3f60a3765942132ffdfb27c72153359"><td class="memItemLeft" align="right" valign="top">static bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classimageWriter.html#ae3f60a3765942132ffdfb27c72153359">IsSupportedExtension</a> (const char *ext)</td></tr>
<tr class="memdesc:ae3f60a3765942132ffdfb27c72153359"><td class="mdescLeft"> </td><td class="mdescRight">Return true if the extension is in the list of SupportedExtensions. <a href="classimageWriter.html#ae3f60a3765942132ffdfb27c72153359">More...</a><br /></td></tr>
<tr class="separator:ae3f60a3765942132ffdfb27c72153359"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="inherit_header pub_static_methods_classvideoOutput"><td colspan="2" onclick="javascript:toggleInherit('pub_static_methods_classvideoOutput')"><img src="closed.png" alt="-"/> Static Public Member Functions inherited from <a class="el" href="classvideoOutput.html">videoOutput</a></td></tr>
<tr class="memitem:aa2754b5d31e5466ad35db3f2832209f1 inherit pub_static_methods_classvideoOutput"><td class="memItemLeft" align="right" valign="top">static <a class="el" href="classvideoOutput.html">videoOutput</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="classvideoOutput.html#aa2754b5d31e5466ad35db3f2832209f1">Create</a> (const <a class="el" href="structvideoOptions.html">videoOptions</a> &options)</td></tr>
<tr class="memdesc:aa2754b5d31e5466ad35db3f2832209f1 inherit pub_static_methods_classvideoOutput"><td class="mdescLeft"> </td><td class="mdescRight">Create <a class="el" href="classvideoOutput.html" title="The videoOutput API is for rendering and transmitting frames to video input devices such as display w...">videoOutput</a> interface from a <a class="el" href="structvideoOptions.html" title="The videoOptions struct contains common settings that are used to configure and query videoSource and...">videoOptions</a> struct that's already been filled out. <a href="classvideoOutput.html#aa2754b5d31e5466ad35db3f2832209f1">More...</a><br /></td></tr>
<tr class="separator:aa2754b5d31e5466ad35db3f2832209f1 inherit pub_static_methods_classvideoOutput"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a461077573ce4c48ef632956251b64c0a inherit pub_static_methods_classvideoOutput"><td class="memItemLeft" align="right" valign="top">static <a class="el" href="classvideoOutput.html">videoOutput</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="classvideoOutput.html#a461077573ce4c48ef632956251b64c0a">Create</a> (const char *<a class="el" href="structURI.html">URI</a>, const <a class="el" href="structvideoOptions.html">videoOptions</a> &options=<a class="el" href="structvideoOptions.html">videoOptions</a>())</td></tr>
<tr class="memdesc:a461077573ce4c48ef632956251b64c0a inherit pub_static_methods_classvideoOutput"><td class="mdescLeft"> </td><td class="mdescRight">Create <a class="el" href="classvideoOutput.html" title="The videoOutput API is for rendering and transmitting frames to video input devices such as display w...">videoOutput</a> interface from a resource <a class="el" href="structURI.html" title="Resource URI of a video device, IP stream, or file/directory.">URI</a> string and optional <a class="el" href="structvideoOptions.html" title="The videoOptions struct contains common settings that are used to configure and query videoSource and...">videoOptions</a>. <a href="classvideoOutput.html#a461077573ce4c48ef632956251b64c0a">More...</a><br /></td></tr>
<tr class="separator:a461077573ce4c48ef632956251b64c0a inherit pub_static_methods_classvideoOutput"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:acc89d40f9294ffbd096aa2e9bcc9a4fb inherit pub_static_methods_classvideoOutput"><td class="memItemLeft" align="right" valign="top">static <a class="el" href="classvideoOutput.html">videoOutput</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="classvideoOutput.html#acc89d40f9294ffbd096aa2e9bcc9a4fb">Create</a> (const char *<a class="el" href="structURI.html">URI</a>, const <a class="el" href="classcommandLine.html">commandLine</a> &cmdLine)</td></tr>
<tr class="memdesc:acc89d40f9294ffbd096aa2e9bcc9a4fb inherit pub_static_methods_classvideoOutput"><td class="mdescLeft"> </td><td class="mdescRight">Create <a class="el" href="classvideoOutput.html" title="The videoOutput API is for rendering and transmitting frames to video input devices such as display w...">videoOutput</a> interface from a resource <a class="el" href="structURI.html" title="Resource URI of a video device, IP stream, or file/directory.">URI</a> string and parsing command line arguments. <a href="classvideoOutput.html#acc89d40f9294ffbd096aa2e9bcc9a4fb">More...</a><br /></td></tr>
<tr class="separator:acc89d40f9294ffbd096aa2e9bcc9a4fb inherit pub_static_methods_classvideoOutput"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a343fb7daf02469fa5d5e604b638b81ff inherit pub_static_methods_classvideoOutput"><td class="memItemLeft" align="right" valign="top">static <a class="el" href="classvideoOutput.html">videoOutput</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="classvideoOutput.html#a343fb7daf02469fa5d5e604b638b81ff">Create</a> (const char *<a class="el" href="structURI.html">URI</a>, const int argc, char **argv)</td></tr>
<tr class="memdesc:a343fb7daf02469fa5d5e604b638b81ff inherit pub_static_methods_classvideoOutput"><td class="mdescLeft"> </td><td class="mdescRight">Create <a class="el" href="classvideoOutput.html" title="The videoOutput API is for rendering and transmitting frames to video input devices such as display w...">videoOutput</a> interface from a resource <a class="el" href="structURI.html" title="Resource URI of a video device, IP stream, or file/directory.">URI</a> string and parsing command line arguments. <a href="classvideoOutput.html#a343fb7daf02469fa5d5e604b638b81ff">More...</a><br /></td></tr>
<tr class="separator:a343fb7daf02469fa5d5e604b638b81ff inherit pub_static_methods_classvideoOutput"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a7a346028a278dd67f6b1d69a69cd496e inherit pub_static_methods_classvideoOutput"><td class="memItemLeft" align="right" valign="top">static <a class="el" href="classvideoOutput.html">videoOutput</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="classvideoOutput.html#a7a346028a278dd67f6b1d69a69cd496e">Create</a> (const int argc, char **argv, int positionArg=-1)</td></tr>
<tr class="memdesc:a7a346028a278dd67f6b1d69a69cd496e inherit pub_static_methods_classvideoOutput"><td class="mdescLeft"> </td><td class="mdescRight">Create <a class="el" href="classvideoOutput.html" title="The videoOutput API is for rendering and transmitting frames to video input devices such as display w...">videoOutput</a> interface by parsing command line arguments, including the resource <a class="el" href="structURI.html" title="Resource URI of a video device, IP stream, or file/directory.">URI</a>. <a href="classvideoOutput.html#a7a346028a278dd67f6b1d69a69cd496e">More...</a><br /></td></tr>
<tr class="separator:a7a346028a278dd67f6b1d69a69cd496e inherit pub_static_methods_classvideoOutput"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a754e0468210780b75641e08aff6604de inherit pub_static_methods_classvideoOutput"><td class="memItemLeft" align="right" valign="top">static <a class="el" href="classvideoOutput.html">videoOutput</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="classvideoOutput.html#a754e0468210780b75641e08aff6604de">Create</a> (const <a class="el" href="classcommandLine.html">commandLine</a> &cmdLine, int positionArg=-1)</td></tr>
<tr class="memdesc:a754e0468210780b75641e08aff6604de inherit pub_static_methods_classvideoOutput"><td class="mdescLeft"> </td><td class="mdescRight">Create <a class="el" href="classvideoOutput.html" title="The videoOutput API is for rendering and transmitting frames to video input devices such as display w...">videoOutput</a> interface by parsing command line arguments, including the resource <a class="el" href="structURI.html" title="Resource URI of a video device, IP stream, or file/directory.">URI</a>. <a href="classvideoOutput.html#a754e0468210780b75641e08aff6604de">More...</a><br /></td></tr>
<tr class="separator:a754e0468210780b75641e08aff6604de inherit pub_static_methods_classvideoOutput"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a0122813d68dd88f0e1d1d92fbbc7edd1 inherit pub_static_methods_classvideoOutput"><td class="memItemLeft" align="right" valign="top">static <a class="el" href="classvideoOutput.html">videoOutput</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="classvideoOutput.html#a0122813d68dd88f0e1d1d92fbbc7edd1">CreateNullOutput</a> ()</td></tr>
<tr class="memdesc:a0122813d68dd88f0e1d1d92fbbc7edd1 inherit pub_static_methods_classvideoOutput"><td class="mdescLeft"> </td><td class="mdescRight">Create <a class="el" href="classvideoOutput.html" title="The videoOutput API is for rendering and transmitting frames to video input devices such as display w...">videoOutput</a> interface that acts as a NULL output and does nothing with incoming frames. <a href="classvideoOutput.html#a0122813d68dd88f0e1d1d92fbbc7edd1">More...</a><br /></td></tr>
<tr class="separator:a0122813d68dd88f0e1d1d92fbbc7edd1 inherit pub_static_methods_classvideoOutput"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a4ffc51285e0dc05addf926b5f4598b88 inherit pub_static_methods_classvideoOutput"><td class="memItemLeft" align="right" valign="top">static const char * </td><td class="memItemRight" valign="bottom"><a class="el" href="classvideoOutput.html#a4ffc51285e0dc05addf926b5f4598b88">Usage</a> ()</td></tr>
<tr class="memdesc:a4ffc51285e0dc05addf926b5f4598b88 inherit pub_static_methods_classvideoOutput"><td class="mdescLeft"> </td><td class="mdescRight">Usage string for command line arguments to <a class="el" href="classvideoOutput.html#aa2754b5d31e5466ad35db3f2832209f1" title="Create videoOutput interface from a videoOptions struct that's already been filled out.">Create()</a> <a href="classvideoOutput.html#a4ffc51285e0dc05addf926b5f4598b88">More...</a><br /></td></tr>
<tr class="separator:a4ffc51285e0dc05addf926b5f4598b88 inherit pub_static_methods_classvideoOutput"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a1b8d053b9564bb2ec042ef9760de23bb inherit pub_static_methods_classvideoOutput"><td class="memItemLeft" align="right" valign="top">static const char * </td><td class="memItemRight" valign="bottom"><a class="el" href="classvideoOutput.html#a1b8d053b9564bb2ec042ef9760de23bb">TypeToStr</a> (uint32_t type)</td></tr>
<tr class="memdesc:a1b8d053b9564bb2ec042ef9760de23bb inherit pub_static_methods_classvideoOutput"><td class="mdescLeft"> </td><td class="mdescRight">Convert a class type to a string. <a href="classvideoOutput.html#a1b8d053b9564bb2ec042ef9760de23bb">More...</a><br /></td></tr>
<tr class="separator:a1b8d053b9564bb2ec042ef9760de23bb inherit pub_static_methods_classvideoOutput"><td class="memSeparator" colspan="2"> </td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-static-attribs"></a>
Static Public Attributes</h2></td></tr>
<tr class="memitem:af767ee4c3dfbedd450b5e3c7f86b326a"><td class="memItemLeft" align="right" valign="top">static const uint32_t </td><td class="memItemRight" valign="bottom"><a class="el" href="classimageWriter.html#af767ee4c3dfbedd450b5e3c7f86b326a">Type</a> = (1 << 5)</td></tr>
<tr class="memdesc:af767ee4c3dfbedd450b5e3c7f86b326a"><td class="mdescLeft"> </td><td class="mdescRight">Unique type identifier of <a class="el" href="classimageWriter.html" title="Save an image or set of images to disk.">imageWriter</a> class. <a href="classimageWriter.html#af767ee4c3dfbedd450b5e3c7f86b326a">More...</a><br /></td></tr>
<tr class="separator:af767ee4c3dfbedd450b5e3c7f86b326a"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a3d0b61d9546c58044cfa200b4126edda"><td class="memItemLeft" align="right" valign="top">static const char * </td><td class="memItemRight" valign="bottom"><a class="el" href="classimageWriter.html#a3d0b61d9546c58044cfa200b4126edda">SupportedExtensions</a> []</td></tr>
<tr class="memdesc:a3d0b61d9546c58044cfa200b4126edda"><td class="mdescLeft"> </td><td class="mdescRight">String array of supported image file extensions, terminated with a NULL sentinel value. <a href="classimageWriter.html#a3d0b61d9546c58044cfa200b4126edda">More...</a><br /></td></tr>
<tr class="separator:a3d0b61d9546c58044cfa200b4126edda"><td class="memSeparator" colspan="2"> </td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pro-methods"></a>
Protected Member Functions</h2></td></tr>
<tr class="memitem:ac6668cfccd5a5d9b93249cfc4f97fe96"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="classimageWriter.html#ac6668cfccd5a5d9b93249cfc4f97fe96">imageWriter</a> (const <a class="el" href="structvideoOptions.html">videoOptions</a> &options)</td></tr>
<tr class="separator:ac6668cfccd5a5d9b93249cfc4f97fe96"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="inherit_header pro_methods_classvideoOutput"><td colspan="2" onclick="javascript:toggleInherit('pro_methods_classvideoOutput')"><img src="closed.png" alt="-"/> Protected Member Functions inherited from <a class="el" href="classvideoOutput.html">videoOutput</a></td></tr>
<tr class="memitem:a02b39780efc6480ab424764dafe082ba inherit pro_methods_classvideoOutput"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="classvideoOutput.html#a02b39780efc6480ab424764dafe082ba">videoOutput</a> (const <a class="el" href="structvideoOptions.html">videoOptions</a> &options)</td></tr>
<tr class="separator:a02b39780efc6480ab424764dafe082ba inherit pro_methods_classvideoOutput"><td class="memSeparator" colspan="2"> </td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pro-attribs"></a>
Protected Attributes</h2></td></tr>
<tr class="memitem:a54cb8c71e88cd68fc9738486679fd304"><td class="memItemLeft" align="right" valign="top">uint32_t </td><td class="memItemRight" valign="bottom"><a class="el" href="classimageWriter.html#a54cb8c71e88cd68fc9738486679fd304">mFileCount</a></td></tr>
<tr class="separator:a54cb8c71e88cd68fc9738486679fd304"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:afc478c1ac925683ca2709668775bbc7d"><td class="memItemLeft" align="right" valign="top">char </td><td class="memItemRight" valign="bottom"><a class="el" href="classimageWriter.html#afc478c1ac925683ca2709668775bbc7d">mFileOut</a> [1024]</td></tr>
<tr class="separator:afc478c1ac925683ca2709668775bbc7d"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="inherit_header pro_attribs_classvideoOutput"><td colspan="2" onclick="javascript:toggleInherit('pro_attribs_classvideoOutput')"><img src="closed.png" alt="-"/> Protected Attributes inherited from <a class="el" href="classvideoOutput.html">videoOutput</a></td></tr>
<tr class="memitem:a473772043b363d7c8dc00cddb70b0aa9 inherit pro_attribs_classvideoOutput"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classvideoOutput.html#a473772043b363d7c8dc00cddb70b0aa9">mStreaming</a></td></tr>
<tr class="separator:a473772043b363d7c8dc00cddb70b0aa9 inherit pro_attribs_classvideoOutput"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:af749bcbea4200ea33a1135f4f040879d inherit pro_attribs_classvideoOutput"><td class="memItemLeft" align="right" valign="top"><a class="el" href="structvideoOptions.html">videoOptions</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classvideoOutput.html#af749bcbea4200ea33a1135f4f040879d">mOptions</a></td></tr>
<tr class="separator:af749bcbea4200ea33a1135f4f040879d inherit pro_attribs_classvideoOutput"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a583b2977fc4b9e1747f1b9199bc583ea inherit pro_attribs_classvideoOutput"><td class="memItemLeft" align="right" valign="top">std::vector< <a class="el" href="classvideoOutput.html">videoOutput</a> * > </td><td class="memItemRight" valign="bottom"><a class="el" href="classvideoOutput.html#a583b2977fc4b9e1747f1b9199bc583ea">mOutputs</a></td></tr>
<tr class="separator:a583b2977fc4b9e1747f1b9199bc583ea inherit pro_attribs_classvideoOutput"><td class="memSeparator" colspan="2"> </td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Save an image or set of images to disk. </p>
<p>Supported image formats for saving are JPG, PNG, TGA, and BMP. Internally, <a class="el" href="classimageLoader.html" title="Load an image or set of images from disk into GPU memory.">imageLoader</a> uses the <a class="el" href="group__image.html#gaaf663c71c391842c1aadcadbdfb6f70d" title="Save an image in CPU/GPU shared memory to disk.">saveImage()</a> function to save the images, so the supported formats are the same.</p>
<p><a class="el" href="classimageWriter.html" title="Save an image or set of images to disk.">imageWriter</a> has the ability to write a sequence of images to a directory, for example <code>images/i.jpg</code> (where <code>i</code> becomes the image number), or just a single image with a static filename (e.g. <code>images/my_image.jpg</code>). When given just the path of a directory as output, it will default to incremental <code>i.jpg</code> sequencing and save in JPG format.</p>
<dl class="section note"><dt>Note</dt><dd><a class="el" href="classimageWriter.html" title="Save an image or set of images to disk.">imageWriter</a> implements the <a class="el" href="classvideoOutput.html" title="The videoOutput API is for rendering and transmitting frames to video input devices such as display w...">videoOutput</a> interface and is intended to be used through that as opposed to directly. <a class="el" href="classvideoOutput.html" title="The videoOutput API is for rendering and transmitting frames to video input devices such as display w...">videoOutput</a> implements additional command-line parsing of <a class="el" href="structvideoOptions.html" title="The videoOptions struct contains common settings that are used to configure and query videoSource and...">videoOptions</a> to construct instances.</dd></dl>
<dl class="section see"><dt>See also</dt><dd><a class="el" href="classvideoOutput.html" title="The videoOutput API is for rendering and transmitting frames to video input devices such as display w...">videoOutput</a> </dd></dl>
</div><h2 class="groupheader">Constructor & Destructor Documentation</h2>
<a id="a0038555473cca96319845f4e67c92882"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0038555473cca96319845f4e67c92882">◆ </a></span>~imageWriter()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">virtual imageWriter::~imageWriter </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">virtual</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Destructor. </p>
</div>
</div>
<a id="ac6668cfccd5a5d9b93249cfc4f97fe96"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac6668cfccd5a5d9b93249cfc4f97fe96">◆ </a></span>imageWriter()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">imageWriter::imageWriter </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="structvideoOptions.html">videoOptions</a> & </td>
<td class="paramname"><em>options</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
</div>
</div>
<h2 class="groupheader">Member Function Documentation</h2>
<a id="a4729467d9c95d3e4d92cac3a98a6e96c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a4729467d9c95d3e4d92cac3a98a6e96c">◆ </a></span>Create() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static <a class="el" href="classimageWriter.html">imageWriter</a>* imageWriter::Create </td>
<td>(</td>
<td class="paramtype">const char * </td>
<td class="paramname"><em>path</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="structvideoOptions.html">videoOptions</a> & </td>
<td class="paramname"><em>options</em> = <code><a class="el" href="structvideoOptions.html">videoOptions</a>()</code> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Create an <a class="el" href="classimageWriter.html" title="Save an image or set of images to disk.">imageWriter</a> instance from a path and optional <a class="el" href="structvideoOptions.html" title="The videoOptions struct contains common settings that are used to configure and query videoSource and...">videoOptions</a>. </p>
</div>
</div>
<a id="ad057d8191dbaad70f8a6fdb27d690197"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad057d8191dbaad70f8a6fdb27d690197">◆ </a></span>Create() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static <a class="el" href="classimageWriter.html">imageWriter</a>* imageWriter::Create </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="structvideoOptions.html">videoOptions</a> & </td>
<td class="paramname"><em>options</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Create an <a class="el" href="classimageWriter.html" title="Save an image or set of images to disk.">imageWriter</a> instance from the provided video options. </p>
</div>
</div>
<a id="ae5d8c048302526edb9e6a84edbc4cb97"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae5d8c048302526edb9e6a84edbc4cb97">◆ </a></span>GetType()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">virtual uint32_t imageWriter::GetType </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">virtual</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Return the interface type (<a class="el" href="classimageWriter.html#af767ee4c3dfbedd450b5e3c7f86b326a" title="Unique type identifier of imageWriter class.">imageWriter::Type</a>) </p>
<p>Reimplemented from <a class="el" href="classvideoOutput.html#aaedce68dfff9bd5c3e76c32468632512">videoOutput</a>.</p>
</div>
</div>
<a id="ae3f60a3765942132ffdfb27c72153359"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae3f60a3765942132ffdfb27c72153359">◆ </a></span>IsSupportedExtension()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static bool imageWriter::IsSupportedExtension </td>
<td>(</td>
<td class="paramtype">const char * </td>
<td class="paramname"><em>ext</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Return true if the extension is in the list of SupportedExtensions. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">ext</td><td>string containing the extension to be checked (should not contain leading dot) </td></tr>
</table>
</dd>
</dl>
<dl class="section see"><dt>See also</dt><dd><a class="el" href="classimageWriter.html#a3d0b61d9546c58044cfa200b4126edda" title="String array of supported image file extensions, terminated with a NULL sentinel value.">SupportedExtensions</a> for the list of supported <a class="el" href="group__video.html" title="videoSource and videoOutput APIs for input and output video streams.">Video Streaming</a> file extensions. </dd></dl>
</div>
</div>
<a id="a63ca941281c3fff61025a5d0c5bf824e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a63ca941281c3fff61025a5d0c5bf824e">◆ </a></span>Render() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename T > </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">bool imageWriter::Render </td>
<td>(</td>
<td class="paramtype">T * </td>
<td class="paramname"><em>image</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">uint32_t </td>
<td class="paramname"><em>width</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">uint32_t </td>
<td class="paramname"><em>height</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Save the next frame. </p>
<dl class="section see"><dt>See also</dt><dd><a class="el" href="classvideoOutput.html#ac63d627d52174400c01c28bb0de82993" title="Render and output the next frame to the stream.">videoOutput::Render()</a> </dd></dl>
</div>
</div>
<a id="a6867f5326a09025d9a21bf3932314635"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a6867f5326a09025d9a21bf3932314635">◆ </a></span>Render() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">virtual bool imageWriter::Render </td>
<td>(</td>
<td class="paramtype">void * </td>
<td class="paramname"><em>image</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">uint32_t </td>
<td class="paramname"><em>width</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">uint32_t </td>
<td class="paramname"><em>height</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="group__imageFormat.html#ga931c48e08f361637d093355d64583406">imageFormat</a> </td>
<td class="paramname"><em>format</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">virtual</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Save the next frame. </p>
<dl class="section see"><dt>See also</dt><dd><a class="el" href="classvideoOutput.html#ac63d627d52174400c01c28bb0de82993" title="Render and output the next frame to the stream.">videoOutput::Render()</a> </dd></dl>
<p>Reimplemented from <a class="el" href="classvideoOutput.html#a8e53017c0e49212405391f82fbac876f">videoOutput</a>.</p>
</div>
</div>
<h2 class="groupheader">Member Data Documentation</h2>
<a id="a54cb8c71e88cd68fc9738486679fd304"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a54cb8c71e88cd68fc9738486679fd304">◆ </a></span>mFileCount</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">uint32_t imageWriter::mFileCount</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
</div>
</div>
<a id="afc478c1ac925683ca2709668775bbc7d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#afc478c1ac925683ca2709668775bbc7d">◆ </a></span>mFileOut</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">char imageWriter::mFileOut[1024]</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
</div>
</div>
<a id="a3d0b61d9546c58044cfa200b4126edda"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a3d0b61d9546c58044cfa200b4126edda">◆ </a></span>SupportedExtensions</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">const char* imageWriter::SupportedExtensions[]</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>String array of supported image file extensions, terminated with a NULL sentinel value. </p>
<p>The supported extension are:</p>
<ul>
<li>JPG / JPEG</li>
<li>PNG</li>
<li>TGA / TARGA</li>
<li>BMP</li>
</ul>
<dl class="section see"><dt>See also</dt><dd><a class="el" href="classimageWriter.html#ae3f60a3765942132ffdfb27c72153359" title="Return true if the extension is in the list of SupportedExtensions.">IsSupportedExtension()</a> to check a string against this list. </dd></dl>
</div>
</div>
<a id="af767ee4c3dfbedd450b5e3c7f86b326a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af767ee4c3dfbedd450b5e3c7f86b326a">◆ </a></span>Type</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">const uint32_t imageWriter::Type = (1 << 5)</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Unique type identifier of <a class="el" href="classimageWriter.html" title="Save an image or set of images to disk.">imageWriter</a> class. </p>
</div>
</div>
<hr/>The documentation for this class was generated from the following file:<ul>
<li>jetson-utils/<a class="el" href="imageWriter_8h_source.html">imageWriter.h</a></li>
</ul>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="classimageWriter.html">imageWriter</a></li>
<li class="footer">Generated on Fri Mar 17 2023 14:29:30 for Jetson Inference by
<a href="path_to_url">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.17 </li>
</ul>
</div>
</body>
</html>
```
|
```groff
.\" $OpenBSD: bdpmic.4,v 1.1 2020/03/20 09:25:42 patrick Exp $
.\"
.\"
.\" Permission to use, copy, modify, and distribute this software for any
.\" purpose with or without fee is hereby granted, provided that the above
.\" copyright notice and this permission notice appear in all copies.
.\"
.\" THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
.\" WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
.\" MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
.\" ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
.\" WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
.\" ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
.\" OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
.\"
.Dd $Mdocdate: March 20 2020 $
.Dt BDPMIC 4
.Os
.Sh NAME
.Nm bdpmic
.Nd ROHM BD718x7 Power Management IC
.Sh SYNOPSIS
.Cd "bdpmic* at iic?"
.Sh DESCRIPTION
The
.Nm
driver provides support for the voltage regulators in the ROHM BD71837
and BD71847 Power Management ICs.
.Sh SEE ALSO
.Xr iic 4 ,
.Xr intro 4
.Sh HISTORY
The
.Nm
driver first appeared in
.Ox 6.7 .
.Sh AUTHORS
.An -nosplit
The
.Nm
driver was written by
.An Patrick Wildt Aq Mt patrick@blueri.se .
```
|
```html
<?xml version="1.0" encoding="utf-8" ?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "path_to_url">
<html xmlns="path_to_url" xml:lang="en" lang="en">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
<meta name="generator" content="Docutils 0.6: path_to_url" />
<title>Parallel BGL Connected Components</title>
<link rel="stylesheet" href="../../../../rst.css" type="text/css" />
</head>
<body>
<div class="document" id="logo-connected-components">
<h1 class="title"><a class="reference external" href="path_to_url"><img align="middle" alt="Parallel BGL" class="align-middle" src="pbgl-logo.png" /></a> Connected Components</h1>
Use, modification and distribution is subject to the Boost Software
path_to_url -->
<pre class="literal-block">
template<typename Graph, typename ComponentMap>
inline typename property_traits<ComponentMap>::value_type
strong_components( const Graph& g, ComponentMap c);
namespace graph {
template<typename Graph, typename VertexComponentMap>
void
fleischer_hendrickson_pinar_strong_components(const Graph& g, VertexComponentMap r);
template<typename Graph, typename ReverseGraph,
typename ComponentMap, typename IsoMapFR, typename IsoMapRF>
inline typename property_traits<ComponentMap>::value_type
fleischer_hendrickson_pinar_strong_components(const Graph& g,
ComponentMap c,
const ReverseGraph& gr,
IsoMapFR fr, IsoMapRF rf);
}
</pre>
<p>The <tt class="docutils literal"><span class="pre">strong_components()</span></tt> function computes the strongly connected
components of a directed graph. The distributed strong components
algorithm uses the <a class="reference external" href="path_to_url">sequential strong components</a> algorithm to
identify components local to a processor. The distributed portion of
the algorithm is built on the <a class="reference external" href="breadth_first_search.html">distributed breadth first search</a>
algorithm and is based on the work of Fleischer, Hendrickson, and
Pinar <a class="citation-reference" href="#fhp00" id="id1">[FHP00]</a>. The interface is a superset of the interface to the
BGL <a class="reference external" href="path_to_url">sequential strong components</a> algorithm. The number of
strongly-connected components in the graph is returned to all
processes.</p>
<p>The distributed strong components algorithm works on both <tt class="docutils literal"><span class="pre">directed</span></tt>
and <tt class="docutils literal"><span class="pre">bidirectional</span></tt> graphs. In the bidirectional case, a reverse
graph adapter is used to produce the required reverse graph. In
the directed case, a separate graph is constructed in which all the
edges are reversed.</p>
<div class="contents topic" id="contents">
<p class="topic-title first">Contents</p>
<ul class="simple">
<li><a class="reference internal" href="#where-defined" id="id2">Where Defined</a></li>
<li><a class="reference internal" href="#parameters" id="id3">Parameters</a></li>
<li><a class="reference internal" href="#complexity" id="id4">Complexity</a></li>
<li><a class="reference internal" href="#algorithm-description" id="id5">Algorithm Description</a></li>
<li><a class="reference internal" href="#bibliography" id="id6">Bibliography</a></li>
</ul>
</div>
<div class="section" id="where-defined">
<h1><a class="toc-backref" href="#id2">Where Defined</a></h1>
<p><<tt class="docutils literal"><span class="pre">boost/graph/distributed/strong_components.hpp</span></tt>></p>
<p>also accessible from</p>
<p><<tt class="docutils literal"><span class="pre">boost/graph/strong_components.hpp</span></tt>></p>
</div>
<div class="section" id="parameters">
<h1><a class="toc-backref" href="#id3">Parameters</a></h1>
<dl class="docutils">
<dt>IN: <tt class="docutils literal"><span class="pre">const</span> <span class="pre">Graph&</span> <span class="pre">g</span></tt></dt>
<dd>The graph type must be a model of <a class="reference external" href="DistributedGraph.html">Distributed Graph</a>. The graph
type must also model the <a class="reference external" href="path_to_url">Incidence Graph</a> and be directed.</dd>
<dt>OUT: <tt class="docutils literal"><span class="pre">ComponentMap</span> <span class="pre">c</span></tt></dt>
<dd>The algorithm computes how many strongly connected components are in the
graph, and assigns each component an integer label. The algorithm
then records to which component each vertex in the graph belongs by
recording the component number in the component property map. The
<tt class="docutils literal"><span class="pre">ComponentMap</span></tt> type must be a <a class="reference external" href="distributed_property_map.html">Distributed Property Map</a>. The
value type must be the <tt class="docutils literal"><span class="pre">vertices_size_type</span></tt> of the graph. The key
type must be the graph's vertex descriptor type.</dd>
<dt>UTIL: <tt class="docutils literal"><span class="pre">VertexComponentMap</span> <span class="pre">r</span></tt></dt>
<dd>The algorithm computes a mapping from each vertex to the
representative of the strong component, stored in this property map.
The <tt class="docutils literal"><span class="pre">VertexComponentMap</span></tt> type must be a <a class="reference external" href="distributed_property_map.html">Distributed Property Map</a>.
The value and key types must be the vertex descriptor of the graph.</dd>
<dt>IN: <tt class="docutils literal"><span class="pre">const</span> <span class="pre">ReverseGraph&</span> <span class="pre">gr</span></tt></dt>
<dd><p class="first">The reverse (or transpose) graph of <tt class="docutils literal"><span class="pre">g</span></tt>, such that for each
directed edge <em>(u, v)</em> in <tt class="docutils literal"><span class="pre">g</span></tt> there exists a directed edge
<em>(fr(v), fr(u))</em> in <tt class="docutils literal"><span class="pre">gr</span></tt> and for each edge <em>(v', u')</em> in <em>gr</em>
there exists an edge <em>(rf(u'), rf(v'))</em> in <tt class="docutils literal"><span class="pre">g</span></tt>. The functions
<em>fr</em> and <em>rf</em> map from vertices in the graph to the reverse graph
and vice-verse, and are represented as property map arguments. The
concept requirements on this graph type are equivalent to those on
the <tt class="docutils literal"><span class="pre">Graph</span></tt> type, but the types need not be the same.</p>
<p class="last"><strong>Default</strong>: Either a <tt class="docutils literal"><span class="pre">reverse_graph</span></tt> adaptor over the original
graph (if the graph type is bidirectional, i.e., models the
<a class="reference external" href="path_to_url">Bidirectional Graph</a> concept) or a <a class="reference external" href="distributed_adjacency_list.html">distributed adjacency list</a>
constructed from the input graph.</p>
</dd>
<dt>IN: <tt class="docutils literal"><span class="pre">IsoMapFR</span> <span class="pre">fr</span></tt></dt>
<dd><p class="first">A property map that maps from vertices in the input graph <tt class="docutils literal"><span class="pre">g</span></tt> to
vertices in the reversed graph <tt class="docutils literal"><span class="pre">gr</span></tt>. The type <tt class="docutils literal"><span class="pre">IsoMapFR</span></tt> must
model the <a class="reference external" href="path_to_url">Readable Property Map</a> concept and have the graph's
vertex descriptor as its key type and the reverse graph's vertex
descriptor as its value type.</p>
<p class="last"><strong>Default</strong>: An identity property map (if the graph type is
bidirectional) or a distributed <tt class="docutils literal"><span class="pre">iterator_property_map</span></tt> (if the
graph type is directed).</p>
</dd>
<dt>IN: <tt class="docutils literal"><span class="pre">IsoMapRF</span> <span class="pre">rf</span></tt></dt>
<dd><p class="first">A property map that maps from vertices in the reversed graph <tt class="docutils literal"><span class="pre">gr</span></tt>
to vertices in the input graph <tt class="docutils literal"><span class="pre">g</span></tt>. The type <tt class="docutils literal"><span class="pre">IsoMapRF</span></tt> must
model the <a class="reference external" href="path_to_url">Readable Property Map</a> concept and have the reverse
graph's vertex descriptor as its key type and the graph's vertex
descriptor as its value type.</p>
<p class="last"><strong>Default</strong>: An identity property map (if the graph type is
bidirectional) or a distributed <tt class="docutils literal"><span class="pre">iterator_property_map</span></tt> (if the
graph type is directed).</p>
</dd>
</dl>
</div>
<div class="section" id="complexity">
<h1><a class="toc-backref" href="#id4">Complexity</a></h1>
<p>The local phase of the algorithm is <em>O(V + E)</em>. The parallel phase of
the algorithm requires at most <em>O(V)</em> supersteps each containing two
breadth first searches which are <em>O(V + E)</em> each.</p>
</div>
<div class="section" id="algorithm-description">
<h1><a class="toc-backref" href="#id5">Algorithm Description</a></h1>
<p>Prior to executing the sequential phase of the algorithm, each process
identifies any completely local strong components which it labels and
removes from the vertex set considered in the parallel phase of the
algorithm.</p>
<p>The parallel phase of the distributed strong components algorithm
consists of series of supersteps. Each superstep starts with one
or more vertex sets which are guaranteed to completely contain
any remaining strong components. A <a class="reference external" href="breadth_first_search.html">distributed breadth first search</a>
is performed starting from the first vertex in each vertex set.
All of these breadth first searches are performed in parallel by having
each processor call <tt class="docutils literal"><span class="pre">breadth_first_search()</span></tt> with a different starting
vertex, and if necessary inserting additional vertices into the
<tt class="docutils literal"><span class="pre">distributed</span> <span class="pre">queue</span></tt> used for breadth first search before invoking
the algorithm. A second <a class="reference external" href="breadth_first_search.html">distributed breadth first search</a> is
performed on the reverse graph in the same fashion. For each initial
vertex set, the successor set (the vertices reached in the forward
breadth first search), and the predecessor set (the vertices reached
in the backward breadth first search) is computed. The intersection
of the predecessor and successor sets form a strongly connected
component which is labeled as such. The remaining vertices in the
initial vertex set are partitioned into three subsets each guaranteed
to completely contain any remaining strong components. These three sets
are the vertices in the predecessor set not contained in the identified
strongly connected component, the vertices in the successor set not
in the strongly connected component, and the remaing vertices in the
initial vertex set not in the predecessor or successor sets. Once
new vertex sets are identified, the algorithm begins a new superstep.
The algorithm halts when no vertices remain.</p>
<p>To boost performance in sparse graphs when identifying small components,
when less than a given portion of the initial number of vertices
remain in active vertex sets, a filtered graph adapter is used
to limit the graph seen by the breadth first search algorithm to the
active vertices.</p>
</div>
<div class="section" id="bibliography">
<h1><a class="toc-backref" href="#id6">Bibliography</a></h1>
<table class="docutils citation" frame="void" id="fhp00" rules="none">
<colgroup><col class="label" /><col /></colgroup>
<tbody valign="top">
<tr><td class="label"><a class="fn-backref" href="#id1">[FHP00]</a></td><td>Lisa Fleischer, Bruce Hendrickson, and Ali Pinar. On
Identifying Strongly Connected Components in Parallel. In Parallel and
Distributed Processing (IPDPS), volume 1800 of Lecture Notes in
Computer Science, pages 505--511, 2000. Springer.</td></tr>
</tbody>
</table>
<hr class="docutils" />
<p>Authors: Nick Edmonds, Douglas Gregor, and Andrew Lumsdaine</p>
<!-- -->
</div>
</div>
<div class="footer">
<hr class="footer" />
Generated on: 2009-05-31 00:21 UTC.
Generated by <a class="reference external" href="path_to_url">Docutils</a> from <a class="reference external" href="path_to_url">reStructuredText</a> source.
</div>
</body>
</html>
```
|
```xml
import asyncComponent from "@erxes/ui/src/components/AsyncComponent";
import queryString from "query-string";
import React from "react";
import { Route, Routes, useLocation } from "react-router-dom";
const WorkList = asyncComponent(
() => import(/* webpackChunkName: "WorkList" */ "./containers/WorkList")
);
const WorkListComponent = () => {
const location = useLocation();
return <WorkList queryParams={queryString.parse(location.search)} />;
};
const routes = () => {
return (
<Routes>
<Route
path="/processes/works"
key="/processes/works"
element={<WorkListComponent />}
/>
</Routes>
);
};
export default routes;
```
|
Bongal is a term used in Assam to refer to outsiders. The people of East Bengal, which is to the immediate southwest of historical Assam, self-identify as Bangal; whereas the Bengali people from the west are called Ghoti. Assam has been settled by colonial officials (amlahs) from Bengal pre-Independence and Hindu Bengali refugees in the post-Independence periods. The Muslims peasants from East Bengal settled in Assam are now referred to as Miya. The term lent the name to the Bongal Kheda movement of the 1950s and 1960s which sought to drive out non-Assamese competitors and to secure jobs for the natives.
History
The term Bongal came into prominence in the Buranjis, where they were used to describe foreigners from the west of the Ahom kingdom. The term may have been derived from 'Bangala', the name of the Mughal province of Bengal. Initially the term might have stood for the people of Bengal, but later it is said to have stood for any foreigner. Because of its geographic location, the approach to the Ahom kingdom from mainland India was through Bengal. The British came to be known as Boga Bongal (white Bongal). Ahom general Lachit Borphukan is said to have referred to the Mughals as Bongals. Over years of political seclusion, 'Bongal' became a term of suspicion, reproach and contempt. When the British annexed Assam to its Indian territories, many Bengali Hindus arrived in Assam by taking up administrative jobs in the government. The Britishers and the Bengali Hindus alike were referred to as Bongals. After the independence of India, the amount of increasing refugees arriving from the region of East Bengal and newly formed East Pakistan escalated tension among the Assamese people and the tribes in the state. By May 1949 the number of total refugees reached two-and-half lakhs increasing up to 2,740,455.
The Assamese people viewed Bongal was someone who didn't belong Assam, an intruder whose presence threatened to marginalize them socially and politically. The Britishers were called Boga Bongal, literally meaning 'the white foreigner' and the Bengali Hindus were called 'Kola Bongal' literally meaning 'the black foreigner'. In the 19th century Assamese intellectual discourse, anyone other than the people of Assam or the Hill tribes were called Bongals. They were described to be foreigners, uncivilized and filthy. An 1872 Assamese play by Rudra Ram Bordoloi titled 'Bongal Bongalini' lampooned the social problems created by the outsiders i.e. the Bongals, especially who came during the British rule. The Assamese women who preferred to marry the Bongals, referred to as 'Bongalini's (feminine of Bongal), were described as promiscuous women and concubines of the Bongals.
After the Independence, the term continued to be used for the Bengali Hindus. However, it was not used for the Bengalis only. In a broader sense, it was used to refer to any group that was perceived to be an outsider. West Bengal was described as Bongal Desh, literally meaning 'the land of the Bongals' in Assamese.
Bongal Kheda
In the colonial period, the British proclaimed Bengali as the official language of assam even though both Assamese and Bengali were very different in nature and most of the populus were not familiar or knew the language. This was resented by the Assamese population as they saw it as a threat to their language and culture, this also led to Bengali people working in assam as most of the teacher's who came to assam were unfamiliar with the native Assamese language leading to illiteracy in the Assamese community and resentment for the Bengali Hindu's residing in assam. The resentment grew even further as After the Independence of India, the Assamese political leadership promoted the concept of Assam for Assamese which soon led to the demand of Assamese to be the sole official language of the state. Soon as the growing middle class populus of assam were still not getting jobs having a suitable educational background in their own state a resentment for Bengali population of assam grew as they made up a huge chunk of Assamese job market as they were seen as more educated and had a better image in India than the Assamese people even though the Assamese populus was at par or even more capable than the Bengali population in their state. This grew resentment in the Assamese community and after many Instances of Bengali-assamese feuds this resentment soon led to the movement called 'Bongal Kheda', literally meaning 'drive away the outsiders(here referring to the Bengali populus)', which resulted in many protest, vandalisation of property and attack on the Bengali Hindus state-wide. The movement that started in the early 1960s started again in different years throughout the sixties into the seventies and eighties leading to the even wider Assam movement. In the seventies it spread to other tribal northeastern parts of assam with significant Bengali population with similar condition likes Meghalaya and Tripura mostly under Assamese influence.
See also
Malaun
Dkhar
References
Sources
Racism in India
Anti-immigration politics in Asia
Assamese nationalism
Persecution of Bengali Hindus
|
Miguel Rafael Martos Sánchez (born 5 May 1943), often simply referred to as Raphael, is a Spanish singer. Raphael is recognized as one of the most successful Spanish singers in the world, having sold more than 70 million records worldwide in 7 languages. Currently, he is considered one of the most active singers of the so-called "divos of the romantic ballad", touring throughout America and Europe, transmitting for 60 years of artistic career, a repertoire full of novelty, for which his oldest songs are being recorded again, thus remastering with modern sounds closer to today's youth.
Childhood
Raphael was born Miguel Rafael Martos Sánchez in Linares, province of Jaén (Spain). As a consequence, he is nicknamed both "El Ruiseñor de Linares" ("Nightingale of Linares") and "El Divo de Linares" ("The Divo from Linares") but is also known as "El Niño". His family moved to Madrid when he was nine months old, and he started singing when he was just three years-old. He joined a children's choir at age four. When he was 9, he was recognized as the best child voice in Europe at a contest in Salzburg, Austria. His two idols, when he was growing up, and with whom he announced, on 6 October 2014, his plans to record posthumous duets with, were said to be US singer Elvis Presley and French diva Edith Piaf.
Career
First recordings
Raphael began his professional career by singing with the Dutch record label Philips. To distinguish himself, he adopted the "ph" of the company's name and christened himself 'Raphael'. His first singles were "Te voy a contar mi vida" and "A pesar de todo", among others. Raphael adopted his own peculiar singing style from the beginning; he is known for acting each one of his songs while on stage, emphasizing his gestures with high dramatic effect. It is not unusual for Raphael to ad lib lyrics as to localize a song depending on the venue he's singing at, wear Latin American peasant costumes and dance folk dances within a song, kicking and demolishing a mirror, or doing the moves of a flamenco dancer or a bullfighter onstage. He also possesses a wide vocal range, which he often used in the beginning of his career as to evoke a choirboy approach to some songs.
From Benidorm and Eurovision to becoming an international star
When he was nineteen, he won first, second and third awards at the famous Benidorm International Song Festival, Spain, in 1962 and 1963 with the songs: "Llevan", "Inmensidad" and "Tu Conciencia". After a brief relation with Barclay record label, who produced just an EP, he signed a contract with Hispavox recording company, and began a long artistic relationship with the musical director of this label, the late, talented Argentinian orchestrator Waldo de los Ríos and intensify the partnership with outstanding Spanish songwriter Manuel Alejandro.
Raphael represented Spain at the and Eurovision Song Contests singing "Yo soy aquél" in Luxembourg, and "Hablemos del amor" in Vienna, placing seventh and sixth, respectively. This marked Spain's strongest showing in the contest at the time, leaving the door open for victory the following year, which Spain achieved with "La, la, la" performed by Massiel. This served as a turning point in Raphael's career, making him an international star. He traveled and performed worldwide in Europe, Latin America, Puerto Rico, the United States, Russia and Japan. Songs such as "Yo soy aquel" (his signature song), "Cuando tú no estás", "Mi gran noche", "Digan lo que digan", "Tema de amor", "Estuve enamorado" and "Desde aquel día" cemented his status as a major international singing star.
Raphael also began a lucrative film career, appearing in, Cuando tú no estás (Mario Camus, 1966), which was followed by Al ponerse el Sol (Mario Camus, 1967) Digan lo que digan (Mario Camus, 1968, filmed in Argentina), El golfo (1969, filmed in México), El ángel (1969), Sin Un Adiós (1970, partially filmed in England) and Volveré a nacer (1972).
Latin American popularity
As Raphael became a success in Latin America, he made a habit of recording Latin American folk standards including "Huapango torero", "Sandunga" and "Llorona"; they were hits in Mexico. In 1967 Raphael began a tour throughout America.
American and Spanish television appearances
He appeared live on The Ed Sullivan Show with great success on 25 October 1970, singing (in Spanish, English and Italian) "Hallelujah" and "Hava Nagila". He appeared again on 27 December 1970, with the songs "Maybe" (Somos), "When my love is around" (Cuando llega mi amor) and "The sound of the trumpet" (Balada de la trompeta).
In 1975, Raphael began his own successful program on Spanish Television called El Mundo de Raphael, where he sang with international stars. He also had a radio program, where he and his wife spoke with and interviewed outstanding personalities, and he starred in soap operas, starting with the Mexican production Donde termina el camino, shown in the spring of 1978 and later in other countries like Peru and Chile.
Golden 80s
Raphael succeeded in the early 1980s with songs such as "¿Qué tal te va sin mí?", "Como yo te amo", "En carne viva" and "Estar enamorado".
In 1980 Raphael receives a Uranium disc, in recognition of his fifty million copies sold throughout his recording career.
During 1984 and 1985 he recorded two albums with songs written by José Luis Perales like "Ámame", "Yo sigo siendo aquel", "Dile que vuelva", "Y... Cómo es él" and "Estoy llorando hoy por ti".
In 1984 a parody of "Yo soy aquél" was used in a radio spot in Puerto Rico's gubernatorial race. Then-governor Carlos Romero Barceló used the parody (complete with a Raphael sound-alike) namely as a jab against opponent, Raphael's namesake, (and noted Spanophile), former governor Rafael Hernández Colón. Raphael was surprised by the unauthorized use of the music, but was highly amused by the reference.
In 1987 he left Hispavox and signed a contract with Columbia (now Sony Music), where he again recorded songs written by Roberto Livi like "Toco madera" and "Maravilloso corazón". In 1991 he had a hit with "Escándalo" in Spain, Latin America, and in Japan, where it reached number one. At the end of the 1990s, after ending a contract with PolyGram, he went back to EMI. In 1998 the artist published the first part of his memoirs titled ¿Y mañana qué?, from his childhood until his marriage in 1972.
Raphael took part in the 2000 Spanish version of the stage musical Jekyll & Hyde for seven months, with great success.
Personal life
He married aristocrat, journalist and writer Natalia Figueroa, in Venice (Italy) on 14 July 1972. They have three children: Jacobo, Alejandra and Manuel.
Raphael's health faced a major setback in 2003, when his liver started failing due to a latent bout with hepatitis B; he recovered successfully after a transplant. Since then he is an active organ donation promoter.
Awards and accomplishments
Raphael has received numerous awards.
He was inducted into the International Latin Music Hall of Fame in 2003.
Recently Raphael received the Lifetime Achievement Award at the 2022 Billboard Latin Music Awards.
Discography
Raphael (1965)
Raphael Canta (1966)
Al Ponerse El Sol (1967)
Digan Lo Que Digan (1967)
El Golfo (1968)
Huapango Torero + 3 (EP – México) (1969)
El Angel (1969) – Ecuador Only
Raphael – El Idolo (Philips EP's Compilation) (1969)
Aqui! (1969)
Corazón, Corazón (1970) México
Live at the Talk of the Town (1970) (recorded at the London Talk of the Town)
Aleluya... (1970)
Algo Más (1971)
Háblame De Amor (From 'Top Star Festival' LP) (1971)
Volveré A Nacer (1972)
Le Llaman Jesús! (1973)
From Here On... (1973) – English Album
Raphael (A La Huella...) (1974)
Raphael (De... Para...) (1974)
Qué Dirán De Mí (1974)
Sombras + 3 (1974) (EP. – Ecuador)
No Eches La Culpa Al Gitano (From "Juntos Para Ayudarte" LP) (1974)
Recital Hispanoamericano (1975) – With Los Gemelos
Con El Sol De La Mañana (1976)
Raphael Canta... (1976)
El Cantor (1977) (México)
Una Forma Muy Mía De Amar (1978)
Y... Sigo Mi Camino (1980)
Vivo Live Direct – 20th Anniversary (Live Double Album) (1980)
En Carne Viva (1981)
Raphael: Ayer, Hoy y Siempre (1982)
Enamorado De La Vida (1983)
Eternamente Tuyo (1984)
Yo Sigo Siendo Aquel – 25th Anniversary (1985)
Todo Una Vida (1986)
Las Apariencias Engañan (1988)
Maravilloso Corazón, Maravilloso (1989)
Andaluz (1990)
Ave Fénix (1992)
Fantasía (1994)
Desde el fondo de mi alma (1995)
Punto y Seguido (1997)
Vete (1997) – Duet with Nino Bravo
Jekyll & Hyde (2001)
Maldito Raphael (2001)
De Vuelta (2003)
Vuelve Por Navidad (2004)
A Que No Te Vas (2006) – Duet with Rocio Jurado
Cerca de ti (2006)
Maravilloso Raphael (2007)
Raphael 50 Anos Después (CD + DVD) (2008)
Viva Raphael! (2009)
50 Años Después – En Directo y Al Completo (3 CD + DVD) (2009)
Te Llevo En El Corazón (3 CD + DVD) (2010)
Te Llevo En El Corazón. Essential (2011)
El Reencuentro (2012)
El Reencuentro En Directo (CD + DVD) (2012)
Mi Gran Noche (2013)
50 Exitos De Mi Vida (3 CD + DVD) (2013)
De Amor & Desamor (LP + CD) (2014)
Raphael Sinphónico (CD + DVD) (2015)
Ven A Mi Casa Esta Navidad (CD) (2015)
Infinitos Bailes (LP + CD) (2016)
6.0 En Concierto (2021)
Victoria (2022)
Filmography
Las Gemelas (1963) – As Alberto
Cuando Tú No Estás (1966) – As Rafael
Al Ponerse El Sol (1967) – As David Alonso
Digan lo que digan (1968) – As Rafael Gandía
El Golfo (1968)- As Pancho
El Ángel (1969)- As El Angel
Sin Un Adiós (1970) – As Mario Leiva
Volveré A Nacer (1973) – As Alex
Rafael en Raphael (Documentary) (1974) – As himself
Donde Termina El Camino (TV) (1978)- As Manuel
Ritmo, Amor y Primavera (1981) – As himself
Jekyll & Hyde (Musical) (2000) – As Dr. Jekyll and Mr. Hyde
Balada Triste de Trompeta" (The Last Circus) (2010) – As himself, through use of Sin Un Adiós footage
Mi Gran Noche'' (2015) – As Alphonso
Tours
De vuelta Tour (2003-2004)
Raphael Para todos Tour (2005)
Más cerca de ti Tour (2007-2008)
50 años después Tour (2009-2010)
Te llevo en el corazón Tour (2010-2011)
El reencuentro Tour (2012)
Mi gran noche Tour (2013–2014)
De Amor y Desamor Tour (2014–2015)
Raphael Sinphonico World Tour (2015–2016)
Loco por Cantar World Tour (2017-2018)
Raphael RESinphónico World Tour (2018–2020)
Raphael 6.0: 60 años sobre los escenarios (2020-2022)
Raphael Tour 6.0 In America (2022)
Tour Victoria (2022-)
Raphael Museum
The Raphael Museum is located in El Pósito, a very beautiful building in the centre of Linares. It houses more than 400 pieces and original documents from the artist.
See also
List of best-selling Latin music artists
Notes
References
External links
Raphael's official site
Raphael's Worldwide site
Raphael's Russian site, the biggest in the world
Letra de su canción Yo Soy Aquél (Spanish and English)
Letra de su canción Hablemos Del Amor (Spanish and English)
1943 births
Living people
People from Linares, Jaén
Eurovision Song Contest entrants for Spain
Eurovision Song Contest entrants of 1966
Eurovision Song Contest entrants of 1967
Spanish male singers
Singers from Andalusia
EMI Latin artists
Sony Music Latin artists
|
Devil Diver (1939–1961) was an American Thoroughbred racehorse. He was twice voted American Champion Older Male Horse.
Background
Devil Diver was foaled at Mrs. Payne Whitney's Greentree Stable in Lexington, Kentucky. A bay colt by Sir Germans, he was out of Dabchick, and a member of the same foal crop as Shut Out. Devil Diver was trained by the Hall of Fame conditioner John M. Gaver, Sr., who also trained Shut Out.
Racing career
Both Shut Out and Devil Diver were pointed towards the 1942 Kentucky Derby, especially as Devil Diver had opened his three-year-old season winning the Phoenix Handicap and in the process beating Whirlaway who only the year before had won the United States Triple Crown of Thoroughbred Racing.
The Hall of Fame jockey Eddie Arcaro believed Devil Diver to be the superior horse (he hadn't been out of the money in 13 starts), and so chose to ride him in the Derby only to come in sixth as Shut Out won the prestigious race under jockey Wayne Wright by two lengths over Alsab. At three, of the two best Whitney colts, Shut Out prevailed. But at four, Devil Diver came into his own, living up to the promise of his two-and-three-year-old seasons. At the end of 1943 he was named Champion Handicap Horse by the Daily Racing Form although the rival Turf & Sports Digest award went to Market Wise. In 1944 he was named Champion Handicap Horse in both major polls. In 1944, he came close to American Horse of the Year but lost the Pimlico Special to the filly Twilight Tear in a three horse race that included the very good Megogo.
Devil Diver holds a record that has so far never been broken. He won the Metropolitan Handicap in three consecutive years: 1943, 1944, and 1945. One of those wins, 1944, was accomplished under an unbroken record weight of 134 pounds. In his Suburban Handicap win, he gave the champion Stymie thirteen pounds. In 1944, the five-year-old Devil Diver won seven stakes race and in each he carried more than 130 pounds. Better with age, at five he competed at a variety of distances under a variety of weights, all heavy. In his last year, he was voted handicap horse of the season in both polls.
Stud record
Devil Diver stood at stud at Greentree Farm. He was not outstanding, but over the years sired 18 stakes winners including Beau Diable, Call Over, Lotowhite, and the good broodmare Anchors Aweigh.
Devil Diver died in 1961.
References
Devil Diver in the Hall of Fame
1939 racehorse births
1961 racehorse deaths
Racehorses bred in Kentucky
Racehorses bred in the United States
United States Thoroughbred Racing Hall of Fame inductees
Whitney racehorses
Thoroughbred family 13-c
|
Group E of the 2013 FIBA Asia Championship will take place from 5 to 7 August 2013. This is the second round of the 2013 FIBA Asia Championship. The four teams with the best record advance to 2013 FIBA Asia Championship final round.
All games will be played at the Mall of Asia Arena in Pasay, Philippines. The competing teams are top three teams in Group A and Group B.
Group A
Group B
Standings
The results and the points of the matches between the same teams that were already played during the preliminary round shall be taken into account for the second round.
|}
All times are local (UTC+8).
August 5
Qatar vs. Jordan
|-
|4 ||align=left|Mansour El Hadary || 16:57 || 4/7 || 57 || 1/2 || 50 || 1/2 || 50 || 0 || 3 || 3 || 1 || 0 || 0 || 0 || 3 || 10
|-
|5 ||align=left|Jarvis Hayes || 32:36|| 6/14 || 43 || 2/6 || 33 || 1/2 || 50 || 1 || 3 || 4 || 3 || 1 || 1 || 0 || 4 || 15
|-
|6 ||align=left|Abdulrahman Saad || 1:39 || 0/1 || 0 || 0/1 || 0 || 0/0 || 0 || 0 || 1 || 1 || 0 || 0 || 0 || 0 || 0 || 0
|-
|7 ||align=left|Daoud Musa || 29:19 || 4/8 || 50 || 2/6 || 33 || 3/3 || 100 || 2 || 1 || 3 || 5 || 2 || 0 || 1 || 2 || 13
|-
|8 ||align=left|Khalid Suliman || 19:14 || 1/4 || 25 || 0/2 || 0 || 0/2 || 0 || 0 || 4 || 4 || 1 || 1 || 1 || 1 || 0 || 2
|-
|9 ||align=left|Ali Turki Ali || 19:53 || 1/6 || 17 || 1/5 || 20 || 2/2 || 100 || 1 || 2 || 3 || 1 || 1 || 0 || 0 || 2 || 5
|-
|10 ||align=left|Yasseen Musa || 31:56 || 6/11 || 55 || 0/1 || 0 || 2/4 || 50 || 2 || 5 || 7 || 3 || 0 || 0 || 0 || 1 || 14
|-
|11 ||align=left|Erfan Ali Saeed || 32:52 || 4/10 || 40 || 0/1 || 0 || 3/4 || 75 || 3 || 4 || 7 || 2 || 1 || 0 || 2 || 1 || 11
|-
|12 ||align=left|Mohammed Saleem Abdulla || 05:03 || 1/1 || 100 || 0/0 || 0 || 0/1 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 1 || 2
|-
|13 ||align=left|Mohammed Yousef || 08:23 || 1/3 || 3 || 1/3 || 33 || 0/0 || 0 || 0 || 2 || 2 || 0 || 0 || 0 || 0 || 2 || 3
|-
|14 ||align=left|Malek Saleem || 2:04 || 0/0 || 0 || 0/0 || 0 || 0/0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 0
|-
|15 ||align=left|Baker Ahmad Mohammed || colspan=16 align=left|Did not play
|-
|align=left colspan=2|Totals || || 28/65 || 43 || 7-27 || 26 || 12/20 || 60 || 9 || 25 || 34 || 16 || 6 || 2 || 4 || 16 || 75
|}
|-
|4 ||align=left|Fadel Alnajjar || 5:32 || 0/0 || 0 || 0/0 || 0 || 0/0 || 0 || 1 || 0 || 1 || 1 || 1 || 0 || 0 || 0 || 0
|-
|5 ||align=left|Ahmad Al-Dwairi || 9:21 || 0/2 || 0 || 0/0 || 0 || 2/4 || 50 || 2 || 1 || 3 || 0 || 0 || 0 || 1 || 0 || 2
|-
|6 ||align=left|Hani Alfaraj || 15:32 || 2/3 || 67 || 1/1 || 100 || 0/0 || 0 || 0 || 1 || 1 || 0 || 0 || 1 || 0 || 2 || 5
|-
|7 ||align=left|Ahmad Alhamarsheh || 30:32 || 1/3 || 33 || 0/1 || 0 || 0/0 || 0 || 2 || 5 || 7 || 1 || 3 || 1 || 0 || 2 || 2
|-
|8 ||align=left|Jimmy Baxter || 38:14 || 5/17 || 29 || 1/4 || 25 || 1/2 || 50 || 1 || 3 || 4 || 2 || 0 || 0 || 0 || 0 || 12
|-
|9 ||align=left|Khaldoon Abu-Ruqayyah || 9:08 || 1/3 || 33 || 1/3 || 33 || 0/0 || 0 || 1 || 1 || 2 || 0 || 1 || 0 || 0 || 2 || 3
|-
|10 ||align=left|Abdallah AbuQoura || colspan=16 align=left|Did not play
|-
|11 ||align=left|Wesam Al-Sous || 29:52 || 4/9 || 44 || 4/8 || 50 || 2/2 || 100 || 2 || 5 || 7 || 6 || 0 || 0 || 0 || 2 || 14
|-
|12 ||align=left|Mahmoud Abdeen || 4:35 || 0/1 || 0 || 0/1 || 0 || 0/0 || 0 || 0 || 1 || 1 || 1 || 0 || 0 || 0 || 0 || 1
|-
|13 ||align=left|Mohammad Shaher Hussein || 12:25 || 1/4 || 25 || 0/1 || 0 || 1/2 || 50 || 0 || 4 || 4 || 0 || 1 || 0 || 0 || 1 || 3
|-
|14 ||align=left|Mohammad Hadrab || 28:18 || 6/16 || 38 || 0/3 || 0 || 4/4 || 100 || 2 || 2 || 4 || 1 || 1 || 0 || 2 || 5 || 16
|-
|15 ||align=left|Ali Jamal Zaghab || 16:26 || 2/4 || 50 || 0/0 || 0 || 0/0 || 0 || 1 || 3 || 4 || 0 || 0 || 0 || 0 || 1 || 4
|-
|align=left colspan=2|Totals || || 22/62 || 35 || 7/22 || 32 || 10/14 || 71 || 12 || 26 || 38 || 12 || 10 || 2 || 3 || 17 || 61
|}
Chinese Taipei vs. Hong Kong
|-
|4 ||align=left|Tseng Wen-ting || 6:50 || 1/2 || 50 || 0/1 || 0 || 0/0 || 0 || 0 || 0 || 0 || 0 || 2 || 0 || 0 || 2 || 2
|-
|5 ||align=left|Quincy Davis || 20:50 || 3/4 || 75 || 0/0 || 0 || 3/4 || 75 || 1 || 6 || 7 || 1 || 4 || 1 || 3 || 0 || 9
|-
|6 ||align=left|Lee Hsueh-lin || colspan=16 align=left|Did not play
|-
|7 ||align=left|Tien Lei || 20:00 || 5/9 || 56 || 2/4 || 50 || 0/0 || 0 || 0 || 4 || 4 || 3 || 2 || 0 || 0 || 1 || 12
|-
|8 ||align=left|Chen Shih-chieh || 18:46 || 4/5 || 80 || 1/1 || 100 || 4/4 || 100 || 0 || 3 || 3 || 4 || 0 || 3 || 0 || 1 || 13
|-
|9 ||align=left|Hung Chih-shan || 21:13 || 3/7 || 43 || 1/4 || 25 || 0/0 || 0 || 0 || 6 || 6 || 1 || 1 || 1 || 0 || 4 || 7
|-
|10 ||align=left|Chou Po-Chen || 14:47 || 3-4 || 75 || 1-1 || 100 || 0-1 || 0 || 0 || 2 || 2 || 1 || 2 || 2 || 2 || 3 || 7
|-
|11 ||align=left|Yang Chin-min || 26:24 || 4-9 || 44 || 2-4 || 50 || 0-0 || 0 || 0 || 3 || 3 || 3 || 1 || 0 || 0 || 3 || 10
|-
|12 ||align=left|Lin Chih-chieh || 13:35 || 2-5 || 40 || 1-4 || 25 || 1-2 || 50 || 0 || 3 || 3 || 6 || 0 || 0 || 0 || 0 || 6
|-
|13 ||align=left|Lu Cheng-ju || 16:55 || 3-5 || 60 || 3-4 || 75 || 2-2 || 100 || 0 || 1 || 1 || 2 || 1 || 0 || 0 || 0 || 11
|-
|14 ||align=left|Tsai Wen-cheng || 23:04 || 2-4 || 50 || 0-0 || 0 || 2-3 || 67 || 2 || 2 || 4 || 1 || 1 || 0 || 0 || 1 || 6
|-
|15 ||align=left|Douglas Creighton || 17:31 || 4-5 || 80 || 3-4 || 75 || 0-0 || 0 || 1 || 6 || 7 || 2 || 0 || 0 || 0 || 0 || 11
|-
|align=left colspan=2|Totals || || 34-59 || 58 || 14-27 || 52 || 12-16 || 75 || 4 || 36 || 40 || 24 || 14 || 7 || 5 || 15 || 94
|}
|-
|4 ||align=left|Man Chun Lam || 06:38 || 1-2 || 50 || 0-1 || 0 || 1-2 || 50 || 0 || 0 || 0 || 1 || 0 || 0 || 0 || 1 || 3
|-
|5 ||align=left|Tsz Lai Lau || 19:09 || 1-6 || 17 || 1-6 || 17 || 0-0 || 0 || 0 || 1 || 1 || 1 || 0 || 0 || 0 || 1 || 3
|-
|6 ||align=left|Ki Lee || 15:48 || 2-8 || 25 || 1-3 || 33 || 0-0 || 0 || 0 || 1 || 1 || 1 || 1 || 0 || 0 || 2 || 5
|-00
|7 ||align=left|Kim Wong Li || 27:56 || 2-8 || 25 || 0-3 || 0 || 0-2 || 0 || 2 || 1 || 3 || 2 || 4 || 0 || 0 || 3 || 4
|-
|8 ||align=left|Siu Wing Chan || 24:58 || 1-6 || 17 || 1-5 || 20 || 0-0 || 0 || 1 || 4 || 5 || 2 || 1 || 1 || 0 || 1 || 3
|-
|9 ||align=left|Tung Leung Lau || 11:12 || 2-3 || 67 || 0-0 || 0 || 0-0 || 0 || 0 || 0 || 0 || 0 || 3 || 0 || 0 || 1 || 4
|-
|10 ||align=left|Yik Lun Chan || 21:04 || 3-7 || 43 || 3-5 || 60 || 0-0 || 0 || 0 || 1 || 1 || 1 || 0 || 0 || 0 || 1 || 9
|-
|11 ||align=left|Chi Ho Poon || colspan=16 align=left|Did not play
|-
|12 ||align=left|Shing Yee Fong || 24:12 || 5-13 || 38 || 1-2 || 50 || 2-2 || 100 || 7 || 8 || 15 || 2 || 2 || 0 || 0 || 3 || 13
|-
|13 ||align=left|Chun Wai Wong || 19:49 || 1-8 || 13 || 0-4 || 0 || 0-0 || 0 || 0 || 4 || 4 || 1 || 1 || 1 || 0 || 4 || 2
|-
|14 ||align=left|Duncan Overbeck Reid || 29:08 || 3-10 || 30 || 0-0 || 0 || 3-4 || 75 || 1 || 3 || 4 || 1 || 3 || 1 || 0 || 0 || 9
|-
|15 ||align=left|Wai Kit Szeto || colspan=16 align=left|Did not play
|-
|align=left colspan=2|Totals || || 21-71 || 30 || 7-29 || 24 || 6-10 || 60 || 11 || 23 || 34 || 12 || 15 || 3 || 0 || 17 || 55
|}
Philippines vs. Japan
|-
|4 ||align=left|Jimmy Alapag ||15 ||2/3 ||67 ||2/3 ||67 ||0/0 ||0 ||0 ||3 ||3 ||6 ||2 ||1 ||0 ||0 ||6
|-
|5 ||align=left|LA Tenorio ||15 ||1/7 ||14 ||1/3 ||33 ||6/7 ||88 ||0 ||3 ||3 ||2 ||1 ||2 ||2 ||0 ||9
|-
|6 ||align=left|Jeffrei Chan ||19 ||6/7 ||86 ||4/5 ||80 ||0/0 ||0 ||0 ||1 ||1 ||1 ||2 ||3 ||0 ||0 ||16
|-
|7 ||align=left|Jayson William ||18 ||2/9 ||22 ||0/1 ||0 ||3/3 ||100 ||0 ||0 ||0 ||3 ||2 ||0 ||2 ||0 ||7
|-
|8 ||align=left|Gary David ||12 ||2/5 ||40 ||1-3 ||33 ||0/0 ||0 ||0 ||0 ||0 ||0 ||1 ||0 ||0 ||0 ||5
|-
|9 ||align=left|Ranidel de Ocampo ||11 ||3/4 ||75 ||0/3 ||0 ||0/0 ||0 ||1 ||1 ||2 ||2 ||0 ||0 ||2 ||0 ||9
|-
|10 ||align=left|Gabe Norwood ||18 ||0/0 ||0 ||2/2 ||100 ||3/4 ||75 ||0 ||3 ||3 ||2 ||3 ||0 ||1 ||0 ||7
|-
|11 ||align=left|Marcus Douthit ||25 ||0/0 ||0 ||7/14 ||50 ||5/5 ||100 ||0 ||10 ||10 ||3 ||2 ||2 ||2 ||2 ||19
|-
|12 ||align=left|Larry Fonacier ||23 ||1/1 ||100 ||0/1 ||0 ||0/0 ||0 ||1 ||3 ||4 ||2 ||1 ||0 ||0 ||0 ||3
|-
|13 ||align=left|June Mar Fajardo ||04 ||0/0 ||0 ||0/1 ||0 ||0/0 ||0 ||0 ||0 ||0 ||0 ||2 ||0 ||0 ||1 ||0
|-
|14 ||align=left|Japeth Aguilar ||17 ||3/3 ||75 ||0 ||100 ||1/2 ||50 ||1 ||0 ||1 ||0 ||3 ||0 ||0 ||1 ||7
|-
|15 ||align=left|Marc Pingris ||22 ||0/0 ||0 ||1/1 ||100 ||0/0 ||0 ||1 ||1 ||2 ||3 ||3 ||1 ||2 ||1 ||2
|-
|align=left colspan=2|Totals ||200 ||30/61 ||49 ||12/20 ||44 ||18/21 ||86 ||5 ||25 ||30 ||24 ||22 ||10 ||11 ||5 ||90
|}
|-
|4 ||align=left|Keijuro Matsui ||14 ||2/5 ||40 ||2/5 ||20 ||0/0 ||0 ||0 ||2 ||2 ||1 ||0 ||1 ||0 ||0 ||6
|-
|5 ||align=left|Daiki Tanaka ||02 ||0/0 ||0 ||0/0 ||0 ||0/0 ||0 ||0 ||0 ||0 ||0 ||0 ||1 ||0 ||0 ||0
|-
|6 ||align=left|Makoto Hiejima ||18 ||3/11 ||27 ||1/3 ||33 ||2/2 ||100 ||3 ||2 ||5 ||3 ||3 ||1 ||2 ||0 ||9
|-
|7 ||align=left|Atsuya Ota ||6 ||1/4 ||25 ||0/0 ||0 ||0/0 ||0 ||3 ||1 ||4 ||1 ||0 ||2 ||0 ||0 ||2
|-
|8 ||align=left|Yuta Watanabe ||5 ||1/3 ||33 ||0/0 ||0 ||0/0 ||0 ||0 ||0 ||0 ||0 ||1 ||0 ||0 ||0 ||2
|-
|9 ||align=left|Takahiro Kurihara ||22 ||1/4 ||25 ||0/1 ||0 ||0/0 ||0 ||0 ||1 ||1 ||3 ||3 ||0 ||0 ||0 ||2
|-
|10 ||align=left|Kosuke Takeuchi ||32 ||7/11 ||64 ||0/1 ||0 ||3/4 ||75 ||2 ||7 ||9 ||0 ||2 ||2 ||0 ||2 ||17
|-
|11 ||align=left|Ryota Sakurai ||16 ||0/2 ||0 ||0/0 ||0 ||2/2 ||100 ||1 ||2 ||3 ||0 ||4 ||3 ||0 ||0 ||2
|-
|12 ||align=left|J.R. Sakuragi ||30 ||6/14 ||43 ||1/1 ||100 ||6/7 ||86 ||6 ||7 ||13 ||3 ||1 ||2 ||0 ||1 ||19
|-
|13 ||align=left|Naoto Tsuji ||27 ||3/7 ||43 ||2/4 ||50 ||0/0 ||0 ||0 ||1 ||1 ||1 ||1 ||4 ||0 ||0 ||8
|-
|14 ||align=left|Kosuke Kanamaru ||22 ||2/8 ||25 ||0/3 ||0 ||0/0 ||0 ||1 ||1 ||2 ||0 ||1 ||2 ||0 ||0 ||4
|-
|15 ||align=left|Hiroshi Ichioka ||7 ||0/1 ||0 ||0/0 ||0 ||0/0 ||0 ||1 ||1 ||2 ||0 ||3 ||0 ||0 ||1 ||0
|-
|align=left colspan=2|Totals ||200 ||26/70 ||37 ||6/18 ||33 ||13/15 ||87 ||21 ||27 ||48 ||12 ||19 ||19 ||2 ||4 ||71
|}
August 6
Jordan vs. Hong Kong
|-
|4 ||align=left|Fadel Alnajjar || 22:34 || 3-10 || 30 || 0-7 || 0 || 1-4 || 25 || 0 || 5 || 5 || 5 || 1 || 1 || 0 || 2 || 7
|-
|5 ||align=left|Ahmad Al-Dwairi || 18:35 || 1-1 || 100 || 0-0 || 0 || 2-2 || 100 || 4 || 4 || 8 || 0 || 2 || 0 || 1 || 4 || 4
|-
|6 ||align=left|Hani Alfaraj || 17:21 || 2-4 || 50 || 0-2 || 0 || 0-0 || 0 || 3 || 1 || 4 || 0 || 2 || 1 || 0 || 0 || 4
|-
|7 ||align=left|Ahmad Alhamarsheh || 18:51 || 2-4 || 50 || 1-2 || 50 || 2-2 || 100 || 0 || 4 || 4 || 4 || 2 || 0 || 0 || 0 || 7
|-
|8 ||align=left|Jimmy Baxter || 21:11 || 1-6 || 17 || 0-3 || 0 || 0-0 || 0 || 0 || 2 || 2 || 3 || 3 || 1 || 0 || 0 || 2
|-
|9 ||align=left|Khaldoon Abu-Ruqayyah || colspan=16 align=left|Did not play
|-
|10 ||align=left|Abdallah AbuQoura || 19:34 || 3-6 || 50 || 0-1 || 0 || 0-0 || 0 || 3 || 1 || 4 || 0 || 1 || 0 || 0 || 0 || 6
|-
|11 ||align=left|Wesam Al-Sous || 16:18 || 3-8 || 38 || 2-5 || 40 || 0-0 || 0 || 0 || 4 || 4 || 1 || 2 || 0 || 0 || 1 || 8
|-
|12 ||align=left|Mahmoud Abdeen || 23:41 || 5-12 || 42 || 2-5 || 40 || 1-1 || 100 || 1 || 3 || 4 || 1 || 2 || 1 || 0 || 3 || 13
|-
|13 ||align=left|Mohammad Shaher Hussein || 21:24 || 3-8 || 38 || 0-1 || 0 || 2-2 || 100 || 4 || 4 || 8 || 1 || 2 || 2 || 0 || 1 || 8
|-
|14 ||align=left|Mohammad Hadrab || 20:25 || 7-10 || 70 || 2-2 || 100 || 5-6 || 83 || 3 || 4 || 7 || 2 || 0 || 0 || 0 || 1 || 21
|-
|15 ||align=left|Ali Jamal Zaghab || colspan=16 align=left|Did not play
|-
|align=left colspan=2|Totals || || 30-69 || 43 || 7-28 || 25 || 13-17 || 76 || 18 || 32 || 50 || 17 || 17 || 6 || 1 || 12 || 80
|}
|-
|4 ||align=left|Man Chun Lam || 18:30 || 2-5 || 40 || 1-3 || 33 || 2-2 || 100 || 3 || 2 || 5 || 2 || 2 || 0 || 0 || 3 || 7
|-
|5 ||align=left|Tsz Lai Lau || 16:11 || 2-6 || 33 || 2-4 || 50 || 0-0 || 0 || 1 || 1 || 2 || 2 || 1 || 0 || 0 || 0 || 6
|-
|6 ||align=left|Ki Lee || 24:09 || 3-8 || 38 || 1-5 || 20 || 0-0 || 0 || 2 || 1 || 3 || 2 || 1 || 0 || 0 || 3 || 7
|-00
|7 ||align=left|Kim Wong Li || 18:07 || 1-4 || 25 || 0-1 || 0 || 2-2 || 100 || 0 || 1 || 1 || 1 || 4 || 0 || 0 || 1 || 4
|-
|8 ||align=left|Siu Wing Chan || 24:59 || 2-7 || 29 || 1-4 || 25 || 0-0 || 0 || 1 || 1 || 2 || 3 || 1 || 3 || 0 || 0 || 5
|-
|9 ||align=left|Tung Leung Lau || 21:31 || 3-8 || 38 || 0-0 || 0 || 2-2 || 100 || 2 || 2 || 4 || 1 || 4 || 0 || 0 || 1 || 8
|-
|10 ||align=left|Yik Lun Chan || 04:49 || 0-4 || 0 || 0-2 || 0 || 0-0 || 0 || 1 || 2 || 3 || 0 || 0 || 0 || 0 || 0 || 0
|-
|11 ||align=left|Chi Ho Poon || colspan=16 align=left|Did not play
|-
|12 ||align=left|Shing Yee Fong || 24:26 || 5-10 || 50 || 0-0 || 0 || 0-0 || 0 || 1 || 2 || 3 || 1 || 4 || 1 || 1 || 5 || 10
|-
|13 ||align=left|Chun Wai Wong || 23:52 || 1-6 || 17 || 0-2 || 0 || 0-1 || 0 || 1 || 5 || 6 || 1 || 1 || 0 || 0 || 3 || 2
|-
|14 ||align=left|Duncan Overbeck Reid || 19:34 || 2-6 || 33 || 0-0 || 0 || 1-2 || 50 || 1 || 0 || 1 || 0 || 0 || 0 || 1 || 0 || 5
|-
|15 ||align=left|Wai Kit Szeto || 03:46 || 0-0 || 0 || 0-0 || 0 || 0-0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 0
|-
|align=left colspan=2|Totals || || 21-64 || 33 || 5-21 || 24 || 7-9 || 78 || 13 || 17 || 30 || 13 || 18 || 4 || 2 || 16 || 54
|}
Japan vs. Chinese Taipei
|-
|4 ||align=left|Keijuro Matsui || colspan=16 align=left|Did not play
|-
|5 ||align=left|Daiki Tanaka || 17:02 || 3-6 || 50 || 2-2 || 100 || 0-0 || 0 || 1 || 1 || 2 || 0 || 0 || 0 || 0 || 3 || 8
|-
|6 ||align=left|Makoto Hiejima || 04:04 || 0-1 || 0 || 0-1 || 0 || 0-0 || 0 || 0 || 0 || 0 || 1 || 1 || 0 || 0 || 2 || 0
|-
|7 ||align=left|Atsuya Ota || 04:03 || 1-1 || 100 || 0-0 || 0 || 0-0 || 0 || 1 || 0 || 1 || 0 || 0 || 0 || 0 || 0 || 2
|-
|8 ||align=left|Yuta Watanabe || colspan=16 align=left|Did not play
|-
|9 ||align=left|Takahiro Kurihara || 15:16 || 2-2 || 100 || 0-0 || 0 || 1-2 || 50 || 2 || 0 || 2 || 0 || 0 || 1 || 0 || 1 || 5
|-
|10 ||align=left|Kosuke Takeuchi || 35:56 || 7-17 || 41 || 0-1 || 0 || 3-5 || 60 || 2 || 5 || 7 || 2 || 2 || 1 || 1 || 2 || 17
|-
|11 ||align=left|Ryota Sakurai || 34:08 || 5-7 || 71 || 1-2 || 50 || 2-2 || 100 || 1 || 3 || 4 || 8 || 3 || 0 || 1 || 2 || 13
|-
|12 ||align=left|J.R. Sakuragi || 32:49 || 5-11 || 45 || 0-1 || 0 || 0-0 || 0 || 2 || 10 || 12 || 4 || 3 || 0 || 0 || 4 || 10
|-
|13 ||align=left|Naoto Tsuji || 17:09 || 1-7 || 14 || 1-6 || 17 || 3-3 || 100 || 0 || 1 || 1 || 2 || 0 || 1 || 0 || 4 || 6
|-
|14 ||align=left|Kosuke Kanamaru || 32:18 || 5-12 || 42 || 1-6 || 17 || 3-4 || 75 || 0 || 2 || 2 || 1 || 1 || 1 || 0 || 0 || 14
|-
|15 ||align=left|Hiroshi Ichioka || 07:10 || 0-0 || 0 || 0-0 || 0 || 1-2 || 50 || 1 || 1 || 2 || 1 || 0 || 0 || 0 || 4 || 1
|-
|align=left colspan=2|Totals || || 29-64 || 45 || 5-19 || 26 || 13-18 || 72 || 10 || 23 || 33 || 19 || 10 || 4 || 2 || 22 || 76
|}
|-
|4 ||align=left|Tseng Wen-ting || 22:26 || 6-10 || 60 || 2-3 || 67 || 5-7 || 71 || 2 || 2 || 4 || 1 || 2 || 0 || 1 || 0 || 19
|-
|5 ||align=left|Quincy Davis || 29:58 || 3-10 || 30 || 0-0 || 0 || 2-2 || 100 || 4 || 8 || 12 || 1 || 1 || 0 || 0 || 0 || 8
|-
|6 ||align=left|Lee Hsueh-lin || 16:21 || 0-0 || 0 || 0-0 || 0 || 0-0 || 0 || 1 || 2 || 3 || 1 || 0 || 0 || 0 || 3 || 0
|-
|7 ||align=left|Tien Lei || 27:29 || 5-12 || 42 || 0-3 || 0 || 0-0 || 0 || 1 || 5 || 6 || 5 || 0 || 1 || 0 || 4 || 10
|-
|8 ||align=left|Chen Shih-chieh || 21:17 || 3-12 || 25 || 0-3 || 0 || 4-4 || 100 || 3 || 2 || 5 || 1 || 0 || 1 || 0 || 0 || 10
|-
|9 ||align=left|Hung Chih-shan || 02:24 || 0-1 || 0 || 0-0 || 0 || 0-0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 1 || 0
|-
|10 ||align=left|Chou Po-Chen || 00:02 || 0-0 || 0 || 0-0 || 0 || 0-0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 0
|-
|11 ||align=left|Yang Chin-min || 23:31 || 1-4 || 25 || 1-2 || 50 || 0-0 || 0 || 1 || 2 || 3 || 2 || 0 || 1 || 0 || 4 || 3
|-
|12 ||align=left|Lin Chih-chieh || 27:24 || 5-11 || 45 || 2-7 || 29 || 4-5 || 80 || 2 || 4 || 6 || 1 || 5 || 0 || 0 || 2 || 16
|-
|13 ||align=left|Lu Cheng-ju || 12:56 || 2-4 || 50 || 1-3 || 33 || 1-1 || 100 || 0 || 0 || 0 || 0 || 3 || 2 || 0 || 3 || 6
|-
|14 ||align=left|Tsai Wen-cheng || 16:03 || 1-3 || 33 || 0-0 || 0 || 5-5 || 100 || 3 || 2 || 5 || 0 || 2 || 1 || 0 || 1 || 7
|-
|15 ||align=left|Douglas Creighton || 00:02 || 0-0 || 0 || 0-0 || 0 || 0-0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 0
|-
|align=left colspan=2|Totals || || 26-67 || 39 || 6-21 || 29 || 21-24 || 88 || 17 || 27 || 44 || 12 || 13 || 6 || 1 || 18 || 79
|}
Philippines vs. Qatar
|-
|4 ||align=left|Jimmy Alapag || 09:27 || 1-5 || 20 || 1-4 || 25 || 2-2 || 100 || 0 || 2 || 2 || 2 || 2 || 0 || 0 || 2 || 5
|-
|5 ||align=left|LA Tenorio || 16:16 || 2-7 || 29 || 1-5 || 20 || 2-2 || 100 || 1 || 3 || 4 || 3 || 0 || 0 || 0 || 3 || 7
|-
|6 ||align=left|Jeffrei Chan || 27:23 || 4-7 || 57 || 3-5 || 60 || 1-2 || 50 || 0 || 6 || 6 || 1 || 0 || 0 || 0 || 1 || 12
|-
|7 ||align=left|Jayson William || 14:22 || 1-4 || 25 || 0-1 || 0 || 5-5 || 100 || 1 || 3 || 4 || 1 || 1 || 0 || 0 || 0 || 7
|-
|8 ||align=left|Gary David || 08:35 || 2-7 || 29 || 1-2 || 50 || 0-0 || 0 || 2 || 3 || 5 || 1 || 0 || 0 || 0 || 0 || 5
|-
|9 ||align=left|Ranidel de Ocampo || 16:51 || 2-6 || 33 || 0-2 || 0 || 0-0 || 0 || 0 || 2 || 2 || 0 || 1 || 0 || 0 || 1 || 4
|-
|10 ||align=left|Gabe Norwood || 27:49 || 1-3 || 33 || 1-2 || 50 || 0-0 || 0 || 0 || 2 || 2 || 1 || 1 || 0 || 2 || 0 || 3
|-
|11 ||align=left|Marcus Douthit || 28:33 || 7-13 || 54 || 0-0 || 0 || 5-6 || 83 || 3 || 11 || 14 || 4 || 4 || 0 || 1 || 3 || 19
|-
|12 ||align=left|Larry Fonacier || 11:32 || 0-4 || 0 || 0-3 || 0 || 2-2 || 100 || 0 || 1 || 1 || 0 || 1 || 0 || 0 || 2 || 2
|-
|13 ||align=left|June Mar Fajardo || 02:08 || 0-0 || 0 || 0-0 || 0 || 0-0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 1 || 0
|-
|14 ||align=left|Japeth Aguilar || 17:35 || 5-6 || 83 || 0-0 || 0 || 4-5 || 80 || 2 || 5 || 7 || 0 || 0 || 0 || 1 || 3 || 14
|-
|15 ||align=left|Marc Pingris || 19:23 || 1-3 || 33 || 0-0 || 0 || 0-0 || 0 || 1 || 5 || 6 || 0 || 2 || 0 || 1 || 2 || 2
|-
|align=left colspan=2|Totals || || 26-65 || 40 || 7-24 || 29 || 21-24 || 88 || 10 || 43 || 53 || 13 || 12 || 0 || 5 || 18 || 80
|}
|-
|4 ||align=left|Mansour El Hadary || 25:51 || 2-8 || 25 || 0-2 || 0 || 1-2 || 50 || 1 || 3 || 4 || 5 || 1 || 0 || 0 || 4 || 5
|-
|5 ||align=left|Jarvis Hayes || 35:18 || 7-17 || 41 || 2-4 || 50 || 1-4 || 25 || 2 || 9 || 11 || 1 || 1 || 0 || 0 || 0 || 17
|-
|6 ||align=left|Abdulrahman Saad || 02:45 || 0-1 || 0 || 0-1 || 0 || 0-0 || 0 || 0 || 2 || 2 || 0 || 0 || 0 || 0 || 3 || 0
|-
|7 ||align=left|Daoud Musa || 23:16 || 3-10 || 30 || 1-5 || 20 || 1-1 || 100 || 0 || 4 || 4 || 3 || 0 || 1 || 0 || 1 || 8
|-
|8 ||align=left|Khalid Suliman || 17:13 || 2-9 || 22 || 2-4 || 50 || 3-6 || 50 || 4 || 0 || 4 || 1 || 2 || 0 || 0 || 3 || 9
|-
|9 ||align=left|Ali Turki Ali || 09:47 || 0-4 || 0 || 0-3 || 0 || 0-0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 0
|-
|10 ||align=left|Yasseen Musa || 23:56 || 3-7 || 43 || 0-2 || 0 || 2-2 || 100 || 2 || 5 || 7 || 0 || 1 || 1 || 0 || 2 || 8
|-
|11 ||align=left|Erfan Ali Saeed || 28:46 || 6-14 || 43 || 0-4 || 0 || 1-1 || 100 || 2 || 2 || 4 || 1 || 0 || 1 || 1 || 2 || 13
|-
|12 ||align=left|Mohammed Saleem Abdulla || 06:07 || 1-2 || 50 || 0-0 || 0 || 0-0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 1 || 2
|-
|13 ||align=left|Mohammed Yousef || 10:26 || 1-1 || 100 || 0-0 || 0 || 2-2 || 100 || 1 || 2 || 3 || 1 || 0 || 1 || 0 || 3 || 4
|-
|14 ||align=left|Malek Saleem || 06:04 || 0-1 || 0 || 0-1 || 0 || 0-0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 0
|-
|15 ||align=left|Baker Ahmad Mohammed || 10:27 || 1-5 || 20 || 0-0 || 0 || 2-2 || 100 || 0 || 2 || 2 || 1 || 1 || 0 || 0 || 0 || 4
|-
|align=left colspan=2|Totals || || 26-79 || 33 || 5-26 || 19 || 13-20 || 65 || 12 || 29 || 41 || 13 || 6 || 4 || 1 || 19 || 70
|}
August 7
Japan vs. Jordan
|-
|4 ||align=left|Keijuro Matsui || 02:57 || 0-1 || 0 || 0-0 || 0 || 0-0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 2 || 0
|-
|5 ||align=left|Daiki Tanaka || 08:37 || 1-2 || 50 || 0-1 || 0 || 0-0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 2
|-
|6 ||align=left|Makoto Hiejima || 20:25 || 1-6 || 17 || 0-0 || 0 || 2-2 || 100 || 0 || 2 || 2 || 4 || 0 || 2 || 0 || 1 || 4
|-
|7 ||align=left|Atsuya Ota || colspan=16 align=left|Did not play
|-
|8 ||align=left|Yuta Watanabe || colspan=16 align=left|Did not play
|-
|9 ||align=left|Takahiro Kurihara || 25:55 || 4-8 || 50 || 0-1 || 0 || 0-0 || 0 || 1 || 1 || 2 || 0 || 3 || 0 || 0 || 4 || 8
|-
|10 ||align=left|Kosuke Takeuchi || 33:05 || 2-8 || 25 || 0-0 || 0 || 3-4 || 75 || 1 || 4 || 5 || 3 || 1 || 1 || 2 || 3 || 7
|-
|11 ||align=left|Ryota Sakuragi || 22:23 || 1-2 || 50 || 0-1 || 0 || 2-6 || 33 || 2 || 1 || 3 || 3 || 2 || 0 || 0 || 4 || 4
|-
|12 ||align=left|J.R. Sakuragi || 33:42 || 1-10 || 10 || 0-1 || 0 || 3-4 || 75 || 1 || 9 || 10 || 2 || 3 || 1 || 0 || 3 || 5
|-
|13 ||align=left|Naoto Tsuji || 18:01 || 5-12 || 42 || 4-10 || 40 || 0-0 || 0 || 0 || 0 || 0 || 0 || 0 || 1 || 0 || 1 || 14
|-
|14 ||align=left|Kosuke Kanamaru || 21:38 || 2-9 || 22 || 1-5 || 20 || 0-0 || 0 || 1 || 3 || 4 || 0 || 1 || 0 || 0 || 2 || 5
|-
|15 ||align=left|Hiroshi Ichioka || 13:11 || 3-7 || 43 || 0-0 || 0 || 1-2 || 50 || 4 || 1 || 5 || 0 || 0 || 0 || 2 || 1 || 7
|-
|align=left colspan=2|Totals || || 20-65 || 31 || 5-19 || 26 || 11-18 || 61 || 10 || 21 || 31 || 12 || 10 || 5 || 4 || 21 || 56
|}
|-
|4 ||align=left|Fadel Alnajjar || 00:40 || 0-0 || 0 || 0-0 || 0 || 1-2 || 50 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 1
|-
|5 ||align=left|Ahmad Al-Dwairi || 08:24 || 1-1 || 100 || 0-0 || 0 || 0-0 || 0 || 0 || 1 || 1 || 0 || 2 || 0 || 0 || 4 || 2
|-
|6 ||align=left|Hani Alfaraj || 09:30 || 0-0 || 0 || 0-0 || 0 || 1-2 || 50 || 0 || 0 || 0 || 1 || 1 || 0 || 1 || 1 || 1
|-
|7 ||align=left|Ahmad Alhamarsheh || 33:06 || 3-4 || 75 || 2-3 || 67 || 2-2 || 100 || 1 || 5 || 6 || 1 || 0 || 0 || 0 || 3 || 10
|-
|8 ||align=left|Jimmy Baxter || 37:15 || 6-16 || 38 || 1-5 || 20 || 3-4 || 75 || 0 || 6 || 6 || 1 || 3 || 3 || 0 || 0 || 16
|-
|9 ||align=left|Khaldoon Abu-Ruqayyah || 00:40 || 0-0 || 0 || 0-0 || 0 || 0-0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 0
|-
|10 ||align=left|Abdallah AbuQoura || colspan=16 align=left|Did not play
|-
|11 ||align=left|Wesam Al-Sous || 30:42 || 3-11 || 27 || 1-8 || 13 || 2-4 || 50 || 0 || 4 || 4 || 5 || 3 || 0 || 0 || 2 || 9
|-
|12 ||align=left|Mahmoud Abdeen || 08:45 || 0-2 || 0 || 0-2 || 0 || 1-2 || 50 || 0 || 2 || 2 || 0 || 2 || 0 || 0 || 0 || 1
|-
|13 ||align=left|Mohammad Shaher Hussein || 30:31 || 7-11 || 64 || 0-0 || 0 || 1-3 || 33 || 12 || 7 || 19 || 1 || 3 || 1 || 0 || 1 || 15
|-
|14 ||align=left|Mohammad Hadrab || 24:22 || 2-7 || 29 || 1-3 || 33 || 1-2 || 50 || 1 || 7 || 8 || 0 || 1 || 0 || 3 || 4 || 6
|-
|15 ||align=left|Ali Jamal Zaghab || 16:00 || 2-6 || 33 || 0-1 || 0 || 0-0 || 0 || 0 || 2 || 2 || 0 || 4 || 0 || 0 || 2 || 4
|-
|align=left colspan=2|Totals || || 24-58 || 41 || 5-22 || 23 || 12-21 || 57 || 14 || 34 || 48 || 9 || 19 || 4 || 4 || 17 || 65
|}
Chinese Taipei vs. Qatar
|-
|4 ||align=left|Tseng Wen-ting || 25:24 || 1-4 || 25 || 0-2 || 0 || 1-2 || 50 || 1 || 2 || 3 || 3 || 3 || 3 || 3 || 0 || 3
|-
|5 ||align=left|Quincy Davis || 32:26 || 7-11 || 64 || 0-0 || 0 || 9-11 || 82 || 1 || 7 || 8 || 0 || 1 || 0 || 0 || 0 || 23
|-
|6 ||align=left|Lee Hsueh-lin || 24:19 || 2-5 || 40 || 1-2 || 50 || 0-0 || 0 || 0 || 3 || 3 || 2 || 1 || 2 || 2 || 0 || 5
|-
|7 ||align=left|Tien Lei || 20:19 || 3-11 || 27 || 0-3 || 0 || 0-0 || 0 || 2 || 5 || 7 || 0 || 1 || 1 || 1 || 0 || 6
|-
|8 ||align=left|Chen Shih-chieh || 20:25 || 6-7 || 86 || 1-1 || 100 || 0-2 || 0 || 0 || 0 || 0 || 1 || 1 || 1 || 1 || 0 || 13
|-
|9 ||align=left|Hung Chih-shan || colspan=16 align=left|Did not play
|-
|10 ||align=left|Chou Po-Chen || 00:08 || 0-0 || 0 || 0-0 || 0 || 0-0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 0
|-
|11 ||align=left|Yang Chin-min || 11:52 || 2-3 || 67 || 0-1 || 0 || 3-4 || 75 || 1 || 0 || 1 || 0 || 1 || 0 || 0 || 0 || 7
|-
|12 ||align=left|Lin Chih-chieh || 19:03 || 0-5 || 0 || 0-5 || 0 || 0-0 || 0 || 0 || 1 || 1 || 4 || 4 || 0 || 0 || 0 || 0
|-
|13 ||align=left|Lu Cheng-ju || 26:36 || 2-8 || 25 || 2-6 || 33 || 0-0 || 0 || 0 || 4 || 4 || 1 || 2 || 1 || 0 || 0 || 6
|-
|14 ||align=left|Tsai Wen-cheng || 04:19 || 0-0 || 0 || 0-0 || 0 || 0-0 || 0 || 2 || 0 || 2 || 0 || 0 || 0 || 0 || 0 || 0
|-
|15 ||align=left|Douglas Creighton || 15:03 || 2-5 || 40 || 1-3 || 33 || 0-0 || 0 || 1 || 2 || 3 || 0 || 1 || 1 || 1 || 0 || 5
|-
|align=left colspan=2|Totals || || 25-59 || 42 || 5-23 || 22 || 13-19 || 68 || 8 || 24 || 32 || 11 || 15 || 9 || 9 || 0 || 68
|}
|-
|4 ||align=left|Mansour El Hadary || 12:48 || 1-3 || 33 || 0-0 || 0 || 0-0 || 0 || 0 || 1 || 1 || 1 || 1 || 0 || 0 || 5 || 2
|-
|5 ||align=left|Jarvis Hayes || 36:49 || 6-15 || 40 || 0-5 || 0 || 1-2 || 50 || 3 || 4 || 7 || 2 || 4 || 0 || 0 || 3 || 13
|-
|6 ||align=left|Abdulrahman Saad || colspan=16 align=left|Did not play
|-
|7 ||align=left|Daoud Musa || 31:26 || 4-12 || 33 || 2-8 || 25 || 0-0 || 0 || 1 || 5 || 6 || 4 || 2 || 2 || 0 || 4 || 10
|-
|8 ||align=left|Khalid Suliman || 20:16 || 0-5 || 0 || 0-1 || 0 || 4-4 || 100 || 1 || 0 || 1 || 2 || 1 || 0 || 0 || 1 || 4
|-
|9 ||align=left|Ali Turki Ali || 21:25 || 2-6 || 33 || 1-4 || 25 || 2-2 || 100 || 1 || 3 || 4 || 1 || 1 || 0 || 0 || 1 || 7
|-
|10 ||align=left|Yasseen Musa || 35:27 || 9-15 || 60 || 0-2 || 0 || 2-2 || 100 || 9 || 10 || 19 || 2 || 2 || 0 || 0 || 1 || 20
|-
|11 ||align=left|Erfan Ali Saeed || 18:01 || 2-6 || 33 || 1-2 || 50 || 3-4 || 75 || 3 || 3 || 6 || 0 || 1 || 0 || 0 || 1 || 8
|-
|12 ||align=left|Mohammed Saleem Abdulla || 03:28 || 0-1 || 0 || 0-0 || 0 || 0-0 || 0 || 0 || 1 || 1 || 0 || 1 || 0 || 0 || 1 || 0
|-
|13 ||align=left|Mohammed Yousef || 19:20 || 3-9 || 33 || 1-3 || 33 || 0-0 || 0 || 1 || 2 || 3 || 0 || 1 || 2 || 1 || 5 || 7
|-
|14 ||align=left|Malek Saleem || colspan=16 align=left|Did not play
|-
|15 ||align=left|Baker Ahmad Mohammed || 00:55 || 0-0 || 0 || 0-0 || 0 || 0-0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 0 || 0
|-
|align=left colspan=2|Totals || || 27-72 || 38 || 5-25 || 20 || 12-14 || 86 || 19 || 29 || 48 || 12 || 14 || 4 || 1 || 22 || 71
|}
Hong Kong vs. Philippines
|-
|4 ||align=left|Man Chun Lam ||12||2/3||67||1/2||50||1/1||100||0||1||1||0||2||0||0||0||6
|-
|5 ||align=left|Tsz Lai Lau ||2||0/1||0||0/1||0||0/0||0||0||0||0||0||0||0||0||0||0
|-
|6 ||align=left|Ki Lee ||18||0/4||0||0/1||0||0/0||0||1||2||3||3||1||1||0||0||0
|-
|7 ||align=left|Kim Wong Li ||33||2/14||14||1/4||25||1/1||100||4||2||6||3||0||0||0||0||6
|-
|8 ||align=left|Siu Wing Chan ||21||6/12||50||4/9||44||0/0||0||1||2||3||0||4||2||0||0||16
|-
|9 ||align=left|Tung Leung Lau ||11||1/2||50||0/0||0||1/2||50||1||1||2||0||2||1||0||0||3
|-
|10 ||align=left|Yik Lun Chan ||18||1/8||13||0/4||0||0/0||0||0||1||1||1||3||1||2||0||2
|-
|11 ||align=left|Chi Ho Poon ||colspan=16 align=left|Did not play
|-
|12 ||align=left|Shing Yee Fong ||17||2/6||33||0/1||0||0/0||0||0||4||4||1||5||0||0||0||4
|-
|13 ||align=left|Chun Wai Wong ||29||2/10||20||1/9||11||1/2||50||0||6||6||0||3||1||1||0||6
|-
|14 ||align=left|Duncan Overbeck Reid ||35||5/15||33||0/1||0||2/4||50||7||12||19||2||1||4||1||0||12
|-
|15 ||align=left|Wai Kit Szeto ||colspan=16 align=left|Did not play
|-
|align=left colspan=2|Totals ||200||21/75||28||7/32||22||6/10||60||14||31||45||10||21||10||4||0||55
|}
|-
|4 ||align=left|Jimmy Alapag ||13||0/4||0||0/4||0||1/2||50||0||2||2||1||0||0||0||1||1
|-
|5 ||align=left|LA Tenorio ||17||3/7||43||1/4||25||2/2||100||1||0||1||1||2||2||0||0||9
|-
|6 ||align=left|Jeffrei Chan ||21||4/8||50||3/5||60||1/1||100||0||1||1||0||0||0||0||0||12
|-
|7 ||align=left|Jayson William ||25||2/3||67||0/0||0||7/8||88||2||4||6||5||0||0||1||0||11
|-
|8 ||align=left|Gary David ||12||0/2||0||0/2||0||0/0||0||1||0||1||1||2||0||0||0||0
|-
|9 ||align=left|Ranidel de Ocampo ||11||1/6||17||0/3||0||0/0||0||0||3||3||0||2||1||0||0||2
|-
|10 ||align=left|Gabe Norwood ||28||4/6||67||1/2||50||2/3||67||2||8||10||1||3||1||1||1||11
|-
|11 ||align=left|Marcus Douthit ||31||6/14||43||0/0||0||1/1||100||0||8||8||1||2||3||0||2||13
|-
|12 ||align=left|Larry Fonacier ||14||1/5||20||0/4||0||0/0||0||0||0||0||0||0||0||0||0||2
|-
|13 ||align=left|June Mar Fajardo ||2||0||0||0||0||0||0||0||0||0||0||0||0||0||0||0
|-
|14 ||align=left|Japeth Aguilar ||7||0/2||0||0/2||0||0||0||0||0||0||0||0||0||0||0||0
|-
|15 ||align=left|Marc Pingris ||14||2/3||67||0/0||0||2/2||100||2||2||4||1||2||1||0||0||6
|-
|align=left colspan=2|Totals ||200||23/60||38||5/24||21||16/19||84.21||8||28||36||11||13||8||2||4||67
|}
Group E
2013–14 in Jordanian basketball
Group
2013–14 in Taiwanese basketball
2013–14 in Hong Kong basketball
2013 in Qatari sport
2013 in Japanese sport
|
The Denham Springs City Hall, also known as the Old Denham Springs City Hall, is a historic building located at 115 Mattie Street in Denham Springs, Louisiana.
Built in the late 1930s by the WPA and last used in the 1980s, the building is a two-story concrete structure in Art Deco style. A complete restoration, costing some $695,000, was completed in late 2008 and rededication ceremonies held on April 17. The building now serves as a tourism office, where maps and information are distributed to people visiting the Antique Village. The original building housed the mayor and sheriff's offices, library, and the jail.
The building was listed in the National Register of Historic Places listings in Louisiana on April 16, 1993.
See also
National Register of Historic Places listings in Livingston Parish, Louisiana
References
External links
Detailed Description
Photos on Livingston Parish website 1
Photos on Livingston Parish website 2
Slide show photos after renovation
3D photo and rotating image
City and town halls on the National Register of Historic Places in Louisiana
Art Deco architecture in Louisiana
Buildings and structures in Livingston Parish, Louisiana
National Register of Historic Places in Livingston Parish, Louisiana
Government buildings completed in 1940
1940 establishments in Louisiana
|
```php
<?php
/*
* This file is part of Piplin.
*
*
* For the full copyright and license information, please view the LICENSE
* file that was distributed with this source code.
*/
return [
'label' => 'Cabinets',
'create' => 'Add Cabinet',
'create_success' => 'Cabinet added.',
'edit' => 'Edit',
'edit_success' => 'Cabinet updated.',
'delete' => 'Leave',
'delete_success' => 'The cabinet has been deleted.',
'none' => 'No cabinets have been added to this environment.',
'warning' => 'There were some problems with your input.',
'name' => 'Name',
'name_placeholder' => 'Database',
'servers' => 'Servers',
'description' => 'Description',
'key' => 'Key',
'status' => 'Status',
'enabled' => 'Enabled',
'link' => 'Link Cabinets',
'search' => 'Search a cabinet',
'help' => 'Directly press the space key to list 10 recently added cabinets.',
'manage' => 'Manage cabinets',
];
```
|
```rust
extern crate skim;
use skim::prelude::*;
use std::io::Cursor;
pub fn main() {
let options = SkimOptionsBuilder::default()
.height(Some("50%"))
.multi(true)
.build()
.unwrap();
let item_reader = SkimItemReader::default();
//==================================================
// first run
let input = "aaaaa\nbbbb\nccc";
let items = item_reader.of_bufread(Cursor::new(input));
let selected_items = Skim::run_with(&options, Some(items))
.map(|out| out.selected_items)
.unwrap_or_else(Vec::new);
for item in selected_items.iter() {
println!("{}", item.output());
}
//==================================================
// second run
let input = "11111\n22222\n333333333";
let items = item_reader.of_bufread(Cursor::new(input));
let selected_items = Skim::run_with(&options, Some(items))
.map(|out| out.selected_items)
.unwrap_or_else(Vec::new);
for item in selected_items.iter() {
println!("{}", item.output());
}
}
```
|
```yaml
nginx:
build: "nginx"
ports:
- "5000:5000"
- "5002:5002"
- "5440:5440"
- "5441:5441"
- "5442:5442"
- "5443:5443"
- "5444:5444"
- "5445:5445"
- "5446:5446"
- "5447:5447"
- "5448:5448"
- "5554:5554"
- "5555:5555"
- "5556:5556"
- "5557:5557"
- "5558:5558"
- "5559:5559"
- "5600:5600"
- "6666:6666"
links:
- registryv2:registryv2
- malevolent:malevolent
- registryv2token:registryv2token
- tokenserver:tokenserver
- registryv2tokenoauth:registryv2tokenoauth
- registryv2tokenoauthnotls:registryv2tokenoauthnotls
- tokenserveroauth:tokenserveroauth
registryv2:
image: golem-distribution:latest
ports:
- "5000"
registryv2token:
image: golem-distribution:latest
ports:
- "5000"
volumes:
- ./tokenserver/registry-config.yml:/etc/docker/registry/config.yml
- ./tokenserver/certs/localregistry.cert:/etc/docker/registry/localregistry.cert
- ./tokenserver/certs/localregistry.key:/etc/docker/registry/localregistry.key
- ./tokenserver/certs/signing.cert:/etc/docker/registry/tokenbundle.pem
tokenserver:
build: "tokenserver"
command: "--debug -addr 0.0.0.0:5556 -issuer registry-test -passwd .htpasswd -tlscert tls.cert -tlskey tls.key -key sign.key -realm path_to_url"
ports:
- "5556"
registryv2tokenoauth:
image: golem-distribution:latest
ports:
- "5000"
volumes:
- ./tokenserver-oauth/registry-config.yml:/etc/docker/registry/config.yml
- ./tokenserver-oauth/certs/localregistry.cert:/etc/docker/registry/localregistry.cert
- ./tokenserver-oauth/certs/localregistry.key:/etc/docker/registry/localregistry.key
- ./tokenserver-oauth/certs/signing.cert:/etc/docker/registry/tokenbundle.pem
registryv2tokenoauthnotls:
image: golem-distribution:latest
ports:
- "5000"
volumes:
- ./tokenserver-oauth/registry-config-notls.yml:/etc/docker/registry/config.yml
- ./tokenserver-oauth/certs/signing.cert:/etc/docker/registry/tokenbundle.pem
tokenserveroauth:
build: "tokenserver-oauth"
command: "--debug -addr 0.0.0.0:5559 -issuer registry-test -passwd .htpasswd -tlscert tls.cert -tlskey tls.key -key sign.key -realm path_to_url -enforce-class"
ports:
- "5559"
malevolent:
image: "dmcgowan/malevolent:0.1.0"
command: "-l 0.0.0.0:6666 -r path_to_url -c /certs/localregistry.cert -k /certs/localregistry.key"
links:
- registryv2:registryv2
volumes:
- ./malevolent-certs:/certs:ro
ports:
- "6666"
docker:
image: golem-dind:latest
container_name: dockerdaemon
command: "docker daemon --debug -s $DOCKER_GRAPHDRIVER"
privileged: true
environment:
DOCKER_GRAPHDRIVER:
volumes:
- /etc/generated_certs.d:/etc/docker/certs.d
- /var/lib/docker
links:
- nginx:localregistry
- nginx:auth.localregistry
```
|
```html
<html lang="en">
<head>
<title>Basic Statements - GNU Compiler Collection (GCC) Internals</title>
<meta http-equiv="Content-Type" content="text/html">
<meta name="description" content="GNU Compiler Collection (GCC) Internals">
<meta name="generator" content="makeinfo 4.8">
<link title="Top" rel="start" href="index.html#Top">
<link rel="up" href="Statements.html#Statements" title="Statements">
<link rel="next" href="Blocks.html#Blocks" title="Blocks">
<link href="path_to_url" rel="generator-home" title="Texinfo Homepage">
<!--
Permission is granted to copy, distribute and/or modify this document
any later version published by the Free Software Foundation; with the
Invariant Sections being ``Funding Free Software'', the Front-Cover
Texts being (a) (see below), and with the Back-Cover Texts being (b)
(see below). A copy of the license is included in the section entitled
(a) The FSF's Front-Cover Text is:
A GNU Manual
(b) The FSF's Back-Cover Text is:
You have freedom to copy and modify this GNU Manual, like GNU
software. Copies published by the Free Software Foundation raise
funds for GNU development.-->
<meta http-equiv="Content-Style-Type" content="text/css">
<style type="text/css"><!--
pre.display { font-family:inherit }
pre.format { font-family:inherit }
pre.smalldisplay { font-family:inherit; font-size:smaller }
pre.smallformat { font-family:inherit; font-size:smaller }
pre.smallexample { font-size:smaller }
pre.smalllisp { font-size:smaller }
span.sc { font-variant:small-caps }
span.roman { font-family:serif; font-weight:normal; }
span.sansserif { font-family:sans-serif; font-weight:normal; }
--></style>
</head>
<body>
<div class="node">
<p>
<a name="Basic-Statements"></a>
Next: <a rel="next" accesskey="n" href="Blocks.html#Blocks">Blocks</a>,
Up: <a rel="up" accesskey="u" href="Statements.html#Statements">Statements</a>
<hr>
</div>
<h4 class="subsection">10.7.1 Basic Statements</h4>
<p><a name="index-Basic-Statements-1937"></a>
<dl>
<dt><code>ASM_EXPR</code><dd>
Used to represent an inline assembly statement. For an inline assembly
statement like:
<pre class="smallexample"> asm ("mov x, y");
</pre>
<p>The <code>ASM_STRING</code> macro will return a <code>STRING_CST</code> node for
<code>"mov x, y"</code>. If the original statement made use of the
extended-assembly syntax, then <code>ASM_OUTPUTS</code>,
<code>ASM_INPUTS</code>, and <code>ASM_CLOBBERS</code> will be the outputs, inputs,
and clobbers for the statement, represented as <code>STRING_CST</code> nodes.
The extended-assembly syntax looks like:
<pre class="smallexample"> asm ("fsinx %1,%0" : "=f" (result) : "f" (angle));
</pre>
<p>The first string is the <code>ASM_STRING</code>, containing the instruction
template. The next two strings are the output and inputs, respectively;
this statement has no clobbers. As this example indicates, “plain”
assembly statements are merely a special case of extended assembly
statements; they have no cv-qualifiers, outputs, inputs, or clobbers.
All of the strings will be <code>NUL</code>-terminated, and will contain no
embedded <code>NUL</code>-characters.
<p>If the assembly statement is declared <code>volatile</code>, or if the
statement was not an extended assembly statement, and is therefore
implicitly volatile, then the predicate <code>ASM_VOLATILE_P</code> will hold
of the <code>ASM_EXPR</code>.
<br><dt><code>DECL_EXPR</code><dd>
Used to represent a local declaration. The <code>DECL_EXPR_DECL</code> macro
can be used to obtain the entity declared. This declaration may be a
<code>LABEL_DECL</code>, indicating that the label declared is a local label.
(As an extension, GCC allows the declaration of labels with scope.) In
C, this declaration may be a <code>FUNCTION_DECL</code>, indicating the
use of the GCC nested function extension. For more information,
see <a href="Functions.html#Functions">Functions</a>.
<br><dt><code>LABEL_EXPR</code><dd>
Used to represent a label. The <code>LABEL_DECL</code> declared by this
statement can be obtained with the <code>LABEL_EXPR_LABEL</code> macro. The
<code>IDENTIFIER_NODE</code> giving the name of the label can be obtained from
the <code>LABEL_DECL</code> with <code>DECL_NAME</code>.
<br><dt><code>GOTO_EXPR</code><dd>
Used to represent a <code>goto</code> statement. The <code>GOTO_DESTINATION</code> will
usually be a <code>LABEL_DECL</code>. However, if the “computed goto” extension
has been used, the <code>GOTO_DESTINATION</code> will be an arbitrary expression
indicating the destination. This expression will always have pointer type.
<br><dt><code>RETURN_EXPR</code><dd>
Used to represent a <code>return</code> statement. Operand 0 represents the
value to return. It should either be the <code>RESULT_DECL</code> for the
containing function, or a <code>MODIFY_EXPR</code> or <code>INIT_EXPR</code>
setting the function's <code>RESULT_DECL</code>. It will be
<code>NULL_TREE</code> if the statement was just
<pre class="smallexample"> return;
</pre>
<br><dt><code>LOOP_EXPR</code><dd>These nodes represent “infinite” loops. The <code>LOOP_EXPR_BODY</code>
represents the body of the loop. It should be executed forever, unless
an <code>EXIT_EXPR</code> is encountered.
<br><dt><code>EXIT_EXPR</code><dd>These nodes represent conditional exits from the nearest enclosing
<code>LOOP_EXPR</code>. The single operand is the condition; if it is
nonzero, then the loop should be exited. An <code>EXIT_EXPR</code> will only
appear within a <code>LOOP_EXPR</code>.
<br><dt><code>SWITCH_STMT</code><dd>
Used to represent a <code>switch</code> statement. The <code>SWITCH_STMT_COND</code>
is the expression on which the switch is occurring. See the documentation
for an <code>IF_STMT</code> for more information on the representation used
for the condition. The <code>SWITCH_STMT_BODY</code> is the body of the switch
statement. The <code>SWITCH_STMT_TYPE</code> is the original type of switch
expression as given in the source, before any compiler conversions.
<br><dt><code>CASE_LABEL_EXPR</code><dd>
Use to represent a <code>case</code> label, range of <code>case</code> labels, or a
<code>default</code> label. If <code>CASE_LOW</code> is <code>NULL_TREE</code>, then this is a
<code>default</code> label. Otherwise, if <code>CASE_HIGH</code> is <code>NULL_TREE</code>, then
this is an ordinary <code>case</code> label. In this case, <code>CASE_LOW</code> is
an expression giving the value of the label. Both <code>CASE_LOW</code> and
<code>CASE_HIGH</code> are <code>INTEGER_CST</code> nodes. These values will have
the same type as the condition expression in the switch statement.
<p>Otherwise, if both <code>CASE_LOW</code> and <code>CASE_HIGH</code> are defined, the
statement is a range of case labels. Such statements originate with the
extension that allows users to write things of the form:
<pre class="smallexample"> case 2 ... 5:
</pre>
<p>The first value will be <code>CASE_LOW</code>, while the second will be
<code>CASE_HIGH</code>.
</dl>
</body></html>
```
|
```java
package com.brianway.learning.java.multithread.synchronize.example8;
/**
* Created by Brian on 2016/4/12.
*/
public class TaskA {
private String getData1;
private String getData2;
public synchronized void doLongTimeTask() {
try {
System.out.println("begin task");
Thread.sleep(3000);
getData1 = "1 threadName=" + Thread.currentThread().getName();
getData2 = "2 threadName=" + Thread.currentThread().getName();
System.out.println(getData1);
System.out.println(getData2);
System.out.println("end task");
} catch (InterruptedException e) {
e.printStackTrace();
}
}
}
```
|
```smalltalk
/*
Problem: path_to_url
C# Language Version: 7.0
.Net Framework Version: 4.7
Tool Version : Visual Studio Community 2017
Thoughts :
1. Let the input values of hours and minutes be h and m respectively.
2. Declare an array hw containing string values of numbers from 1 to 11.
3. Declare an array mw containing string values of numbers from 1 to 29.
4. Print the appropriate string representation of time using hw and mw arrays based on the values of h and m.
Time Complexity: O(1) //there are no loops at all.
Space Complexity: O(1) //number of dynamically allocated variables remain constant for any input.
*/
using System;
class Solution
{
static void Main(String[] args)
{
var h = int.Parse(Console.ReadLine());
var m = int.Parse(Console.ReadLine());
var hourWords = new[] { "one", "two", "three", "four", "five", "six", "seven", "eight", "nine", "ten", "eleven" };
var minuteWords = new[] { "one", "two", "three", "four", "five", "six", "seven", "eight", "nine", "ten"
, "eleven", "twelve","thirteen","fourteen","fifteen","sixteen","seventeen","eighteen","nineteen","twenty"
, "twenty one", "twenty two", "twenty three", "twenty four", "twenty five", "twenty six", "twenty seven", "twenty eight","twenty nine" };
if (m == 0)
Console.Write($"{hourWords[h - 1]} o' clock");
if ((m > 0 && m < 15) || (m > 15 && m < 30))
Console.Write($"{minuteWords[m - 1]} minutes past {hourWords[h - 1]}");
if ((m > 30 && m < 45) || (m > 45 && m < 60))
Console.Write($"{minuteWords[60 - m - 1]} minutes to {hourWords[h]}");
if (m == 15)
Console.Write($"quarter past {hourWords[h - 1]}");
if (m == 30)
Console.Write($"half past {hourWords[h - 1]}");
if (m == 45)
Console.Write($"quarter to {hourWords[h]}");
}
}
```
|
```python
#!/usr/local/bin/python3
print("ping6 fragment with m=0 that overlaps the last fragment at beginning")
# |---------|
# |XXXXXXXXX|
# |---------|
import os
from addr import *
from scapy.all import *
pid=os.getpid()
eid=pid & 0xffff
payload=b"ABCDEFGHIJKLMNOPQRSTUVWX"
packet=IPv6(src=LOCAL_ADDR6, dst=REMOTE_ADDR6)/ \
ICMPv6EchoRequest(id=eid, data=payload)
frag=[]
fid=pid & 0xffffffff
frag.append(IPv6ExtHdrFragment(nh=58, id=fid, offset=2)/bytes(packet)[56:72])
frag.append(IPv6ExtHdrFragment(nh=58, id=fid, offset=1)/bytes(packet)[48:64])
frag.append(IPv6ExtHdrFragment(nh=58, id=fid, m=1)/bytes(packet)[40:56])
eth=[]
for f in frag:
pkt=IPv6(src=LOCAL_ADDR6, dst=REMOTE_ADDR6)/f
eth.append(Ether(src=LOCAL_MAC, dst=REMOTE_MAC)/pkt)
if os.fork() == 0:
time.sleep(1)
sendp(eth, iface=LOCAL_IF)
os._exit(0)
ans=sniff(iface=LOCAL_IF, timeout=3, filter=
"ip6 and src "+REMOTE_ADDR6+" and dst "+LOCAL_ADDR6+" and icmp6")
for a in ans:
if a and a.type == ETH_P_IPV6 and \
ipv6nh[a.payload.nh] == 'ICMPv6' and \
icmp6types[a.payload.payload.type] == 'Echo Reply':
id=a.payload.payload.id
print("id=%#x" % (id))
if id != eid:
print("WRONG ECHO REPLY ID")
exit(2)
data=a.payload.payload.data
print("payload=%s" % (data))
if data == payload:
print("ECHO REPLY")
exit(1)
print("PAYLOAD!=%s" % (payload))
exit(2)
print("no echo reply")
exit(0)
```
|
```groovy
package org.gradle.profiler
class BenchmarkIntegrationTest extends AbstractProfilerIntegrationTest {
def "recovers from measured build failure running benchmarks"() {
given:
brokenBuild(8)
when:
new Main().run("--project-dir", projectDir.absolutePath, "--output-dir", outputDir.absolutePath, "--gradle-version", minimalSupportedGradleVersion, "--gradle-version", "5.0", "--benchmark", "assemble")
then:
def e = thrown(Main.ScenarioFailedException)
logFile.containsOne(e.cause.message)
output.contains(e.cause.message)
logFile.containsOne("java.lang.RuntimeException: broken!")
output.contains("java.lang.RuntimeException: broken!")
// Probe version, 6 warm up, 10 builds
logFile.find("<gradle-version: $minimalSupportedGradleVersion>").size() == 10
logFile.find("<gradle-version: 5.0>").size() == 17
logFile.find("<tasks: [:help]>").size() == 2
logFile.find("<tasks: [assemble]>").size() == 9 + 16
def lines = resultFile.lines
lines.size() == totalLinesForExecutions(16)
lines.get(0) == "scenario,default,default"
lines.get(1) == "version,Gradle ${minimalSupportedGradleVersion},Gradle 5.0"
lines.get(2) == "tasks,assemble,assemble"
lines.get(3) == "value,total execution time,total execution time"
lines.get(4).matches("warm-up build #1,$SAMPLE,$SAMPLE")
lines.get(9).matches("warm-up build #6,$SAMPLE,$SAMPLE")
lines.get(10).matches("measured build #1,$SAMPLE,$SAMPLE")
lines.get(11).matches("measured build #2,$SAMPLE,$SAMPLE")
lines.get(12).matches("measured build #3,,$SAMPLE")
lines.get(19).matches("measured build #10,,$SAMPLE")
}
def "recovers from failure in warm-up build while running benchmarks"() {
given:
brokenBuild(3)
when:
new Main().run("--project-dir", projectDir.absolutePath, "--output-dir", outputDir.absolutePath, "--gradle-version", minimalSupportedGradleVersion, "--gradle-version", "5.0", "--benchmark", "assemble")
then:
def e = thrown(Main.ScenarioFailedException)
logFile.containsOne(e.cause.message)
output.contains(e.cause.message)
logFile.containsOne("java.lang.RuntimeException: broken!")
output.contains("java.lang.RuntimeException: broken!")
// Probe version, 6 warm up, 10 builds
logFile.find("<gradle-version: $minimalSupportedGradleVersion>").size() == 5
logFile.find("<gradle-version: 5.0>").size() == 17
logFile.find("<tasks: [:help]>").size() == 2
logFile.find("<tasks: [assemble]>").size() == 4 + 16
def lines = resultFile.lines
lines.size() == totalLinesForExecutions(16)
lines.get(0) == "scenario,default,default"
lines.get(1) == "version,Gradle ${minimalSupportedGradleVersion},Gradle 5.0"
lines.get(2) == "tasks,assemble,assemble"
lines.get(3) == "value,total execution time,total execution time"
lines.get(4).matches("warm-up build #1,$SAMPLE,$SAMPLE")
lines.get(5).matches("warm-up build #2,$SAMPLE,$SAMPLE")
lines.get(6).matches("warm-up build #3,$SAMPLE,$SAMPLE")
lines.get(7).matches("warm-up build #4,,$SAMPLE")
lines.get(8).matches("warm-up build #5,,$SAMPLE")
lines.get(9).matches("warm-up build #6,,$SAMPLE")
lines.get(10).matches("measured build #1,,$SAMPLE")
lines.get(11).matches("measured build #2,,$SAMPLE")
lines.get(19).matches("measured build #10,,$SAMPLE")
}
def "recovers from failure to run any builds while running benchmarks"() {
given:
brokenBuild(0)
when:
new Main().run("--project-dir", projectDir.absolutePath, "--output-dir", outputDir.absolutePath, "--gradle-version", minimalSupportedGradleVersion, "--gradle-version", "5.0", "--benchmark", "assemble")
then:
def e = thrown(Main.ScenarioFailedException)
logFile.containsOne(e.cause.message)
output.contains(e.cause.message)
logFile.containsOne("java.lang.RuntimeException: broken!")
output.contains("java.lang.RuntimeException: broken!")
// Probe version, 6 warm up, 10 builds
logFile.find("<gradle-version: $minimalSupportedGradleVersion>").size() == 2
logFile.find("<gradle-version: 5.0>").size() == 17
logFile.find("<tasks: [:help]>").size() == 2
logFile.find("<tasks: [assemble]>").size() == 1 + 16
def lines = resultFile.lines
lines.size() == totalLinesForExecutions(16)
lines.get(0) == "scenario,default,default"
lines.get(1) == "version,Gradle ${minimalSupportedGradleVersion},Gradle 5.0"
lines.get(2) == "tasks,assemble,assemble"
lines.get(3) == "value,total execution time,total execution time"
lines.get(4).matches("warm-up build #1,,$SAMPLE")
lines.get(5).matches("warm-up build #2,,$SAMPLE")
lines.get(6).matches("warm-up build #3,,$SAMPLE")
lines.get(10).matches("measured build #1,,$SAMPLE")
lines.get(11).matches("measured build #2,,$SAMPLE")
lines.get(19).matches("measured build #10,,$SAMPLE")
}
def brokenBuild(int successfulIterations) {
instrumentedBuildScript()
buildFile << """
class Holder {
static int counter
}
assemble.doFirst {
if (gradle.gradleVersion == "${minimalSupportedGradleVersion}" && Holder.counter++ >= ${successfulIterations}) {
throw new RuntimeException("broken!")
}
}
"""
}
}
```
|
```javascript
CKEDITOR.plugins.setLang("showblocks","sq",{toolbar:"Shfaq Blloqet"});
```
|
Charles Young (30 April 1812 – after 1875) was a Scottish-born lawyer, judge and political figure in Prince Edward Island. He served as administrator for Prince Edward Island in 1859.
He was born in Glasgow, the son of John Young and Agnes Renny, and came to Halifax with his family in 1814. He was educated at Dalhousie College and was called to the Nova Scotia and Prince Edward Island bars in 1838. Young entered practice with his brothers William and George. He served as a member of the Legislative Council of Prince Edward Island for 23 years. In 1847, he was named Queen's Counsel. Young was the province's attorney general from 1851 to 1853 and from 1858 to 1859. He was named a judge of probate in 1852 and was a judge in bankruptcy from 1868 to 1875. Young was one of the first persons to publicly support responsible government for Prince Edward Island.
References
Administrator Charles Young, Lieutenant Governors Gallery, Government of Prince Edward Island
1812 births
Year of death missing
Lieutenant Governors of the Colony of Prince Edward Island
Judges in Prince Edward Island
Members of the Legislative Council of Prince Edward Island
Scottish emigrants to pre-Confederation Prince Edward Island
Colony of Prince Edward Island judges
Attorneys General of the Colony of Prince Edward Island
|
```python
#
#
# path_to_url
#
# Unless required by applicable law or agreed to in writing, software
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
#
"""Common logic for instantiating the Mycroft Skills Manager.
The Mycroft Skills Manager (MSM) does a lot of interactions with git. The
more skills that are installed on a device, the longer these interactions
take. This is especially true at boot time when MSM is instantiated
frequently. To improve performance, the MSM instance is cached.
"""
from collections import namedtuple
from functools import lru_cache
from os import path, makedirs
from msm import MycroftSkillsManager, SkillRepo
from mycroft.util.combo_lock import ComboLock
from mycroft.util.log import LOG
from mycroft.util.file_utils import get_temp_path
MsmConfig = namedtuple(
'MsmConfig',
[
'platform',
'repo_branch',
'repo_cache',
'repo_url',
'skills_dir',
'versioned'
]
)
def _init_msm_lock():
msm_lock = None
try:
msm_lock = ComboLock(get_temp_path('mycroft-msm.lck'))
LOG.debug('mycroft-msm combo lock instantiated')
except Exception:
LOG.exception('Failed to create msm lock!')
return msm_lock
def build_msm_config(device_config: dict) -> MsmConfig:
"""Extract from the device configs values needed to instantiate MSM
Why not just pass the device_config to the create_msm function, you ask?
Rationale is that the create_msm function is cached. The lru_cached
decorator will instantiate MSM anew each time it is called with a different
configuration argument. Calling this function before create_msm will
ensure that changes to configs not related to MSM will not result in new
instances of MSM being created.
"""
msm_config = device_config['skills']['msm']
msm_repo_config = msm_config['repo']
enclosure_config = device_config['enclosure']
data_dir = path.expanduser(device_config['data_dir'])
return MsmConfig(
platform=enclosure_config.get('platform', 'default'),
repo_branch=msm_repo_config['branch'],
repo_cache=path.join(data_dir, msm_repo_config['cache']),
repo_url=msm_repo_config['url'],
skills_dir=path.join(data_dir, msm_config['directory']),
versioned=msm_config['versioned']
)
@lru_cache()
def create_msm(msm_config: MsmConfig) -> MycroftSkillsManager:
"""Returns an instantiated MSM object.
This function is cached because it can take as long as 15 seconds to
instantiate MSM. Caching the instance improves performance significantly,
especially during the boot sequence when this function is called multiple
times.
"""
if msm_config.repo_url != "path_to_url":
LOG.warning("You have enabled a third-party skill store.\n"
"Unable to guarantee the safety of skills from "
"sources other than the Mycroft Marketplace.\n"
"Proceed with caution.")
msm_lock = _init_msm_lock()
LOG.info('Acquiring lock to instantiate MSM')
with msm_lock:
if not path.exists(msm_config.skills_dir):
makedirs(msm_config.skills_dir)
msm_skill_repo = SkillRepo(
msm_config.repo_cache,
msm_config.repo_url,
msm_config.repo_branch
)
msm_instance = MycroftSkillsManager(
platform=msm_config.platform,
skills_dir=msm_config.skills_dir,
repo=msm_skill_repo,
versioned=msm_config.versioned
)
LOG.info('Releasing MSM instantiation lock.')
return msm_instance
```
|
```javascript
Check if an argument is a number
Using the double tilde `~~`
`String.replace`
Truthiness
Avoid using `with`
```
|
```objective-c
/*
*
*/
#pragma once
#include "esp_err.h"
#include "esp_intr_alloc.h"
#ifdef __cplusplus
extern "C" {
#endif
#define DAC_DMA_EOF_INTR 0x01
#define DAC_DMA_TEOF_INTR 0x02
/**
* @brief Initialize DAC DMA peripheral
*
* @param[in] freq_hz DAC data frequency per channel
* @param[in] is_alternate Transmit data alternate between two channels or simultaneously
* @param[in] is_apll Whether use APLL as DAC digital controller clock source
* @return
* - ESP_ERR_NOT_FOUND The DMA peripheral has been occupied
* - ESP_ERR_NO_MEM No memory for the DMA peripheral struct
* - ESP_ERR_INVALID_ARG The frequency is out of range
* - ESP_OK Initialize DAC DMA peripheral success
*/
esp_err_t dac_dma_periph_init(uint32_t freq_hz, bool is_alternate, bool is_apll);
/**
* @brief Deinitialize DAC DMA peripheral
*
* @return
* - ESP_ERR_INVALID_STATE The DAC DMA has been de-initialized already
* or the interrupt has not been de-registered
* - ESP_OK Deinitialize DAC DMA peripheral success
*/
esp_err_t dac_dma_periph_deinit(void);
/**
* @brief Get the DMA interrupt signal id
*
* @return
* - int DMA interrupt signal id
*/
int dac_dma_periph_get_intr_signal(void);
/**
* @brief Enable the DMA and interrupt of the DAC DMA peripheral
*
*/
void dac_dma_periph_enable(void);
/**
* @brief Disable the DMA and interrupt of the DAC DMA peripheral
*
*/
void dac_dma_periph_disable(void);
/**
* @brief Whether the TX_EOF interrupt is triggered
*
* @return
* - uint32_t Mask of the triggered interrupt: DAC_DMA_EOF_INTR, DAC_DMA_EOF_INTR
*/
uint32_t dac_dma_periph_intr_is_triggered(void);
/**
* @brief Get the descriptor that just finished sending data
*
* @return
* - uint32_t The address of the EOF descriptor
*/
uint32_t dac_dma_periph_intr_get_eof_desc(void);
/**
* @brief Start a DMA transaction
* @note DMA transaction will stop when reaches the tail of the descriptor link
*
* @param[in] desc_addr Descriptor address
*/
void dac_dma_periph_dma_trans_start(uint32_t desc_addr);
#ifdef __cplusplus
}
#endif
```
|
```c++
/*
*
* This program is free software: you can redistribute it and/or modify
* the Free Software Foundation, either version 2 or (at your option)
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
*
* along with this program. If not, see <path_to_url
*/
#include "PasswordEditWidget.h"
#include "ui_KeyComponentWidget.h"
#include "ui_PasswordEditWidget.h"
#include "keys/CompositeKey.h"
#include "keys/PasswordKey.h"
PasswordEditWidget::PasswordEditWidget(QWidget* parent)
: KeyComponentWidget(parent)
, m_compUi(new Ui::PasswordEditWidget())
{
initComponent();
// Explicitly clear password on cancel
connect(this, &PasswordEditWidget::editCanceled, this, [this] { setPassword({}); });
}
PasswordEditWidget::~PasswordEditWidget() = default;
bool PasswordEditWidget::addToCompositeKey(QSharedPointer<CompositeKey> key)
{
QString pw = m_compUi->enterPasswordEdit->text();
if (!pw.isEmpty()) {
key->addKey(QSharedPointer<PasswordKey>::create(pw));
return true;
}
return false;
}
/**
* @param visible changed password visibility state
*/
void PasswordEditWidget::setPasswordVisible(bool visible)
{
m_compUi->enterPasswordEdit->setShowPassword(visible);
}
/**
* @return password visibility state
*/
bool PasswordEditWidget::isPasswordVisible() const
{
return m_compUi->enterPasswordEdit->isPasswordVisible();
}
bool PasswordEditWidget::isEmpty() const
{
return m_compUi->enterPasswordEdit->text().isEmpty();
}
PasswordHealth::Quality PasswordEditWidget::getPasswordQuality() const
{
QString pwd = m_compUi->enterPasswordEdit->text();
PasswordHealth passwordHealth(pwd);
return passwordHealth.quality();
}
QWidget* PasswordEditWidget::componentEditWidget()
{
m_compEditWidget = new QWidget();
m_compUi->setupUi(m_compEditWidget);
m_compUi->enterPasswordEdit->enablePasswordGenerator();
m_compUi->enterPasswordEdit->setRepeatPartner(m_compUi->repeatPasswordEdit);
return m_compEditWidget;
}
void PasswordEditWidget::initComponentEditWidget(QWidget* widget)
{
Q_UNUSED(widget);
Q_ASSERT(m_compEditWidget);
setFocusProxy(m_compUi->enterPasswordEdit);
m_compUi->enterPasswordEdit->setQualityVisible(true);
m_compUi->repeatPasswordEdit->setQualityVisible(false);
}
void PasswordEditWidget::initComponent()
{
// These need to be set in total for each credential type for translation purposes
m_ui->groupBox->setTitle(tr("Password"));
m_ui->addButton->setText(tr("Add Password"));
m_ui->changeButton->setText(tr("Change Password"));
m_ui->removeButton->setText(tr("Remove Password"));
m_ui->changeOrRemoveLabel->setText(tr("Password set, click to change or remove"));
m_ui->componentDescription->setText(
tr("<p>A password is the primary method for securing your database.</p>"
"<p>Good passwords are long and unique. KeePassXC can generate one for you.</p>"));
}
bool PasswordEditWidget::validate(QString& errorMessage) const
{
if (m_compUi->enterPasswordEdit->text() != m_compUi->repeatPasswordEdit->text()) {
errorMessage = tr("Passwords do not match.");
return false;
}
return true;
}
void PasswordEditWidget::setPassword(const QString& password)
{
Q_ASSERT(m_compEditWidget);
m_compUi->enterPasswordEdit->setText(password);
m_compUi->repeatPasswordEdit->setText(password);
}
```
|
René Farwig (born 30 September 1935) is a Bolivian alpine skier. He competed in two events at the 1956 Winter Olympics.
References
1935 births
Living people
Bolivian male alpine skiers
Olympic alpine skiers for Bolivia
Alpine skiers at the 1956 Winter Olympics
Sportspeople from Valencia
|
Taxes provide the most important revenue source for the Government of the People's Republic of China. Tax is a key component of macro-economic policy, and greatly affects China's economic and social development. With the changes made since the 1994 tax reform, China has sought to set up a streamlined tax system geared to a socialist market economy.
China's tax revenue came to 11.05 trillion yuan (1.8 trillion U.S. dollars) in 2013, up 9.8 per cent over 2012. Tax revenue in 2015 was 12,488.9 billion yuan. In 2016, tax revenue was 13,035.4 billion yuan. Tax revenue in 2017 was 14,436 billion yuan. In 2018, tax revenue was 15,640.1 billion yuan, an increase of 1204.1 billion yuan over the previous year. Tax revenue in 2019 was 15799.2 billion yuan. In 2020 and 2021, the total tax revenues were respectively 15431 billion and 17273.1 billion Chinese yuan. The 2017 World Bank "Doing Business" rankings estimated that China's total tax rate for corporations was 68% as a percentage of profits through direct and indirect tax. As a percentage of GDP, according to the State Administration of Taxation, overall tax revenues were 30% in China.
The government agency in charge of tax policy is the Ministry of Finance. For tax collection, it is the State Administration of Taxation.
As part of a US$586 billion economic stimulus package in November 2008, the government planned to reform VAT, stating that the plan could cut corporate taxes by 120 billion yuan.
Types of taxes
Under the current tax system in China, there are 26 types of taxes, which, according to their nature and function, can be divided into the following 8 categories:
Turnover taxes. This includes three kinds of taxes, namely, Value-Added Tax, Consumption Tax and Business Tax. The levy of these taxes are normally based on the volume of turnover or sales of the taxpayers in the manufacturing, circulation or service sectors.
Income taxes. This includes Enterprise Income Tax (effective prior to 2008, applicable to such domestic enterprises as state-owned enterprises, collectively owned enterprises, private enterprises, joint operation enterprises and joint equity enterprises) and Individual Income Tax. These taxes are levied on the basis of the profits gained by producers or dealers, or the income earned by individuals. Please note that the new Enterprise Income Tax Law of the People's Republic of China has replaced the above two enterprise taxes as of 1 January 2008.
The enterprise income tax shall be levied at the rate of 25%. 15% tax rate is a concession rate for high-tech companies.
Resource taxes. This consists of Resource Tax and Urban and Township Land Use Tax. These taxes are applicable to the exploiters engaged in natural resource exploitation or to the users of urban and township land. These taxes reflect the chargeable use of state-owned natural resources, and aim to adjust the different profits derived by taxpayers who have access to different availability of natural resources.
Taxes for special purposes. These taxes are City Maintenance and Construction Tax, Farmland Occupation Tax, Fixed Asset Investment Orientation Regulation Tax, Land Appreciation Tax, and Vehicle Acquisition Tax. These taxes are levied on specific items for special regulative purposes.
Property taxes. This encompasses House Property Tax, Urban Real Estate Tax, and Inheritance Tax (not yet levied). China is preparing to roll out a new property tax. Two of China’s largest cities, Chongqing and Shanghai have trialed property taxes between 0.4% and 1.2% since 2011, mainly targeting second homes, luxury properties, and purchases by non-residents. The new tax is expected to cover a much wider range of properties.
Behavioural taxes. This includes Vehicle and Vessel Usage Tax, Vehicle and Vessel Usage License Plate Tax, Stamp Tax, Deed Tax, Securities Exchange Tax (not yet levied), Slaughter Tax and Banquet Tax. These taxes are levied on specified behaviour.
Agricultural taxes. Taxes belonging to this category are Agriculture Tax (including Agricultural Specialty Tax) and Animal Husbandry Tax which are levied on the enterprises, units and/or individuals receiving income from agriculture and animal husbandry activities.
Customs duties. Customs duties are imposed on the goods and articles imported into and exported out of the territory of the People's Republic of China, including Excise Tax.
Tax characteristics
Compared with other forms of distribution, taxation has the characteristics of compulsory, gratuitous and fixed, which are customarily called the "three characteristics" of taxation.
Compulsory
The compulsory nature of taxation means that taxation is imposed by the state as a social administrator, by virtue of its power and political authority, through the enactment of laws or decrees. The social groups and members who are obliged to pay taxes must comply with the compulsory tax decree of the state. Within the limits stipulated by the national tax law, taxpayers must pay taxes according to the law, otherwise they will be sanctioned by the law, which is the embodiment of the legal status of taxes. The compulsory character is reflected in two aspects: on the one hand, the establishment of tax distribution relations is compulsory, i.e. tax collection is entirely by virtue of the political power of the state; on the other hand, the process of tax collection is compulsory, i.e. if there is a tax violation, the state can impose punishment according to the law.
Gratuitousness
The gratuitous nature of taxation means that through taxation, a part of the income of social groups and members of society is transferred to the state, and the state does not pay any remuneration or consideration to the taxpayer. This gratuitous nature of taxation is connected with the essence of income distribution by the state by virtue of its political power. The gratuitousness is reflected in two aspects: on the one hand, it means that the government does not have to pay any remuneration directly to the taxpayers after receiving the tax revenues; on the other hand, it means that the tax revenues collected by the government are no longer returned directly to the taxpayers. The gratuitous nature of taxation is the essence of taxation, which reflects a unilateral transfer of ownership and dominance of social products, rather than an exchange relationship of equal value. The gratuitous nature of taxation is an important characteristic that distinguishes tax revenue from other forms of fiscal revenue.
Fixedness
The fixed nature of taxation refers to the fact that taxation is levied in accordance with the standards stipulated by the state law, i.e. the taxpayers, tax objects, tax items, tax rates, valuation methods and time periods are pre-defined by the taxation law and have a relatively stable trial period, which is a fixed continuous income. For the pre-defined standard of taxation, both the taxing and tax-paying parties must jointly abide by it, and neither the taxing nor the tax-paying parties can violate or change this fixed rate or amount or other institutional provisions unless it is revised or adjusted by the state law.
Summing up
The three basic features of taxation are a unified whole. Among them, compulsory is the strong guarantee to realize the gratuitous collection of tax, gratuitous is the embodiment of the essence of taxation, and fixed is the inevitable requirement of compulsory and gratuitous.
Taxation Functions
Taxation is divided into national tax and local tax. Local taxes are further divided into: resource tax, personal income tax, individual incidental income tax, land value-added tax, urban maintenance and construction tax, vehicle and vessel use tax, property tax, slaughter tax, urban land use tax, fixed asset investment direction adjustment tax, enterprise income tax, stamp duty, etc.
Taxes are mainly used for national defense and military construction, national civil servants' salary payment, road traffic and urban infrastructure construction, scientific research, medical and health epidemic prevention, culture and education, disaster relief, environmental protection and other fields.
The functions and roles of taxation are the concrete manifestation of the essence of taxation functions. Generally speaking, taxation has several important basic functions as follows:
Organizing finance
Taxation is a form of distribution in which the government participates in social distribution by virtue of state coercive power and concentrates part of the surplus products (whether in monetary form or in physical form). The organization of state revenue is the most basic function of taxation.
Regulating the economy
The participation of the government in social distribution by means of state coercive power necessarily changes the share of social groups and their members in the distribution of national income, reducing their disposable income, but this reduction is not equal, and this gain or loss of interest will affect the economic activity capacity and behavior of taxpayers, which in turn has an impact on the social and economic structure. The government uses this influence to purposefully guide the socio-economic activities and thus rationalize the socio-economic structure.
Monitoring the economy
In the process of collecting and obtaining revenues, the state must build on the basis of intensive daily tax administration, specifically grasp the sources of taxes, understand the situation, find out problems, supervise taxpayers paying taxes in accordance with the law, and fight against violations of tax laws and regulations, thus supervising the direction of social and economic activities and maintaining the order of social life.
The role of taxation is the effect of the tax function under certain economic conditions. The role of taxation is to reflect the fair tax burden and promote equal competition; to regulate the total economic volume and maintain economic stability; to reflect the industrial policy and promote structural adjustment; to reasonably adjust the distribution and promote common prosperity; to safeguard the rights and interests of the country and promote the opening up to the outside world, etc.
Tax legislation
Tax law, that is, the legal system of taxation, is the general name of the legal norms that adjust tax relations and is an important part of the national law. It is a legal code based on the Constitution, which adjusts the relationship between the state and members of the society in terms of rights and obligations in taxation, maintains the social and economic order and taxation order, protects the national interests and the legitimate rights and interests of taxpayers, and is a rule of conduct for the state taxation authorities and all tax units and individuals to collect taxes according to the law.
Tax laws can be classified in different ways according to their legislative purposes, taxation objects, rights and interests, scope of application and functional roles. Generally, tax laws are divided into two categories: substantive tax laws and procedural tax laws according to the different functions of tax laws.
Tax legal relationship is reflected as the relationship between state tax collection and taxpayers' benefit distribution. In general, tax legal relations, like other legal relations, are composed of three aspects: subject, object and content.
The elements of tax law are the basic elements of the taxation system, which are reflected in the various basic laws enacted by the state. They mainly include taxpayers, tax objects, tax items, tax rates, tax deductions and exemptions, tax links, tax deadlines and violations. Among them, taxpayers, tax objects and tax rates are the basic factors of a taxation system or a basic composition of taxation.
The Law of the People's Republic of China on Tax Collection and Administration stipulates that taxpayers must apply for tax declaration at taxation authorities within the prescribed declaration period. By virtue of the power granted by the state power, the tax authorities collect taxes from taxpayers in the name of the state power. If a taxpayer steals tax, owes tax, cheats tax or resists tax, the tax authorities shall recover the tax, late payment and impose fines according to the law, and those who violate the criminal law shall also be criminally punished by the judicial authorities.
Tax evasion is a taxpayer's intentional violation of the tax law by deception, concealment and other means (such as forgery, alteration, concealment, unauthorized destruction of books and bookkeeping vouchers, false tax declaration, etc.) to not pay or underpay the tax due.
Tax arrears is the act that the taxpayer fails to pay tax on time and defaults on the tax payment beyond the approved tax payment period by the taxation authority.
Tax fraud is the act of taxpayers or personnel cheating the state export tax refund by false export declaration or other deceptive means. In China, export tax refund is to refund or exempt the VAT and consumption tax paid or payable by the taxpayer for the exported goods in the domestic production and circulation links. Export tax refund is an international practice.
Tax resistance is the refusal of a taxpayer to pay tax by violence or threat. Those who gather a crowd, threaten or besiege taxation authorities and beat taxation cadres, and refuse to pay taxes, are tax resisters.
State organs that have the authority to formulate tax laws or tax policy include the National People's Congress and its Standing Committee, the State Council, the Ministry of Finance, the State Administration of Taxation, the Tariff and Classification Committee of the State Council, and the General Administration of Customs.
Tax laws are enacted by the National People's Congress, e.g., the Individual Income Tax Law of the People's Republic of China; or enacted by the Standing Committee of the National People's Congress, e.g., the Tax Collection and Administration Law of the People's Republic of China.
The administrative regulations and rules concerning taxation are formulated by the State Council, e.g., the Detailed Rules for the Implementation of the Tax Collection and Administration Law of the People' s Republic of China, the Detailed Regulations for the Implementation of the Individual Income Tax Law of the People's Republic of China, the Provisional Regulations of the People's Republic of China on Value Added Tax.
The departmental rules concerning taxation are formulated by the Ministry of Finance, the State Administration of Taxation, the Tariff and Classification Committee of the State Council, and the General Administration of Customs, e.g., the Detailed Rules for the Implementation of the Provisional Regulations of the People's Republic of China on Value Added Tax, the Provisional Measures for Voluntary Reporting of the Individual Income Tax.
The formulation of tax laws follow four steps: drafting, examination, voting and promulgation. The four steps for the formulation of tax administrative regulations and rules are: planning, drafting, verification and promulgation. The four steps mentioned above take place in accordance with laws, regulations and rules.
Besides, the laws of China stipulates that within the framework of the national tax laws and regulations, some local tax regulations and rules may be formulated by the People's Congress at the provincial level and its Standing Committee, the People's Congress of minority nationality autonomous prefectures and the People's Government at provincial level.
The following table summarises up the current tax laws, regulations and rules and relevant legislation in China.
Current Tax Legislation Table
Note: The provisions of criminal responsibilities in Supplementary Rules of the Standing Committee of NPC of the People's Republic of China on Penalizing Tax Evasions and Refusal to Pay Taxes and Resolutions of the Standing Committee of NPC of the People's Republic of China on Penalizing Any False Issuance, Forgery and/or Illegal Sales of VAT Invoices have been integrated into the Criminal Law of the People's Republic of China revised and promulgated on 14 March 1997.
Tax Filing and Payment
Depending on the form of tax, taxpayers in China are required to file tax returns periodically or annually. Filing tax returns often entails giving detailed information about taxpayers’ income, expenses, deductions, and credits. The information provided is used by the tax authorities to assess the taxpayer's compliance with tax laws and regulations and to calculate the taxpayer's tax due. Taxpayers in China are subject to stringent filing and payment deadlines that must be met in order to avoid penalties and enforcement measures.
Monthly and quarterly filing of tax returns
Payment and filing deadlines may be established every day, every three days, every five days, every ten days, every fifteen days, every month, or every quarter. The competent tax authorities decide when a taxpayer must make a specific tax payment based on the type and amount of tax payable.
Value Added Tax(VAT), Corporate Income Tax(CIT), Consumption Tax (CT), Resource Tax, and Environmental Protection Tax are taxes that are paid on a monthly or quarterly basis. If taxpayers must file and pay taxes on a monthly basis, they are obligated to do so within the first 15 days of the following month. They must also ensure that the tax authorities must receive tax returns and payments on or before this date. This deadline is set out in the "Provisions of the State Administration of Taxation on the Time Limit for Tax Declaration and Payment”. The main types of monthly taxes include Individual Income Tax(IIT), Value Added Tax, Resource Tax, and Corporate Income Tax.
The deadline is postponed to the following business day if the fifteenth day falls on a weekend or a holiday. Taxpayers can check the pertinent instructions from the State Administration of Taxation or their local tax bureau to guarantee compliance with the tax rules and regulations connected to monthly tax filings. The SAT gives detailed instructions on how to complete monthly tax forms, including how to use electronic tax filing systems.
In China, several taxes have a quarterly reporting requirement. The quarterly tax filings are usually required for CIT and VAT, among others. Taxpayers with quarterly filing deadlines must submit their tax returns within the first 15 days of the month following the end of each quarter (April, July, October, and January). Urban Maintenance And Construction Tax(UMCT), the Education Surcharge, and the Local Education Surcharge are taxes that are due at the same time as the VAT and CT and are paid at the same time, respectively your tax filing frequency.
Annually tax settlement
In China, the tax year begins on January 1 and finishes on December 31. The annually reconciliation tax return must be filed between March 1 and June 30 of the following year. If an individual's consolidated income exceeds RMB 120,000, he must file an annual final tax settlement. In order to obtain tax deductions and exemptions, if eligible, a person may still choose to file an IIT return even though their taxable income is below the threshold. Taxpayers who reside in China have three options for preparing their annual IIT settlement: self-declaration, declaration through an authorised withholding agent, or declaration through an authorised tax agency. The annual corporate income tax filing deadline is May 31.
Consequences of tax-related offences
Late filing and payment penalties
In China, evading taxes is a serious offense that carries legal repercussions. To prevent and penalise tax evasion, the Chinese government has put severe laws in place. In China, tax evasion is punishable by fines, imprisonment, and potentially asset confiscation.
Tax authorities can levy penalties and take other enforcement actions against taxpayers who don't file their returns or pay their taxes by the dates specified. The severity of the violation, the kind of tax, the duration of the delay, and the taxpayer's compliance history can all affect the penalties for filing and paying taxes late. On the amount of tax that has not been paid as of the first day of the delay, penalties for late payment are assessed at a rate of 0.05% each day. Additionally, a fine of no more than 2,000 RMB may be assessed for failure to submit and pay tax within the allotted time frame. A further fine of 2,000 RMB to 10,000 RMB may be applied if the taxpayer doesn't take action to correct the problem. In addition to penalties and interest rates, late filing and payment of taxes may have further repercussions, including limitations on corporate activities, inclusion on a blacklist, and legal actions.
In some circumstances, failing to pay tax fines could lead to imprisonment. The taxing authorities may take additional legal action, such as suing the taxpayer to recoup the debt, if the taxpayer persists in refusing to pay the taxes or penalties. The circumstances of the case, including the sum of taxes or fines owed, will determine the length of the sentence.
Any taxpayer who fails to pay or underpays the amount of taxes payable and is found guilty of tax evasion, If the amount is tax evaded is between 10,000 RMB and 100,000 RMB and the amount of tax evaded is between 10% and 30% of the taxable income, or if he commits tax evasion again after having been twice subjected to administrative sanctions by the tax authorities for tax evasion, will be subject to a sentence of not exceeding 3 years or criminal detention and shall also be fined not less than one time but not more than five times the amount of tax evaded. If the amount involved is over 100,000 RMB or the amount of tax evaded accounts for over 30 percent of the total of taxes payable, he will be sentenced to fixed-term imprisonment of not less than three years, but not more than seven years, and a fine of not less than 100%, but not more than 500% the amount owed in taxes.
Blacklist system
China's government has implemented a system known as the "Blacklist System" that seeks to criminalize people and organizations who violate laws and regulations in a variety of sectors, including tax evasion, fraud, and other offenses involving taxes. In 2016, a Blacklist System to prevent fraud in taxation went into place. The name of the taxpayer may be added to the Blacklist by the tax authorities if the taxpayer persists in breaking the law or refuses to pay taxes. A taxpayer's name and other pertinent information, such as their business registration number, may be made public when they are put to the Blacklist on a government website or in other public documents. This is done to make the general public and prospective business partners aware of the taxpayer's breaking of the law. An organization that is listed on the Blacklist could not be allowed to participate in government procurements, submit a bid for a contract with the government, or issue corporate bonds. Delinquent taxpayers have the opportunity to erase their records by repaying back taxes and penalties.
Foreign investment taxation
There are 14 kinds of taxes currently applicable to the enterprises with foreign investment, foreign enterprises and/or foreigners, namely: Value Added Tax, Consumption Tax, Business Tax, Income Tax on Enterprises with Foreign Investment and Foreign Enterprises, Individual Income Tax, Resource Tax, Land Appreciation Tax, Urban Real Estate Tax, Vehicle and Vessel Usage License Plate Tax, Stamp Tax, Deed Tax, Slaughter Tax, Agriculture Tax, and Customs Duties.
Hong Kong, Macau and Taiwan and overseas Chinese and the enterprises with their investment are taxed in reference to the taxation on foreigners, enterprises with foreign investment and/or foreign enterprises. In an effort to encourage inward flow of funds, technology and information, China provides numerous preferential treatments in foreign taxation, and has successively concluded tax treaties with 60 countries (by July 1999): Japan, the US, France, UK, Belgium, Germany, Malaysia, Norway, Denmark, Singapore, Finland, Canada, Sweden, New Zealand, Thailand, Italy, the Netherlands, Poland, Australia, Bulgaria, Pakistan, Kuwait, Switzerland, Cyprus, Spain, Romania, Austria, Brazil, Mongolia, Hungary, Malta, the UAE, Luxembourg, South Korea, Russia, Papua New Guinea, India, Mauritius, Croatia, Belarus, Slovenia, Israel, Vietnam, Turkey, Ukraine, Armenia, Jamaica, Iceland, Lithuania, Latvia, Uzbekistan, Bangladesh, Yugoslavia, Sudan, Macedonia, Egypt, Portugal, Estonia, and Laos, 51 of which have been in force.
Urban and Township Land Use Tax
(1) Taxpayers
The taxpayers of Urban and Township Land Use Tax include all enterprises, units, individual household businesses and other individuals (excluding enterprises with foreign investment, foreign enterprises and foreigners).
(2) Tax payable per unit
Urban Land Use Tax in China applies regional range differential fixed Tax Rate i.e, the annual amount of tax payable per square meter is: 1.5-30 yuan for large cities, 1.2-24 yuan for medium-size cities, 0.9-18 yuan for small cities, or 0.6-12 yuan for mining districts. Upon approval, the tax payable per unit for poor area may be lowered or that for developed area may be raised to some extent.
(3) Computation
The amount of tax payable is computed on the basis of the actual size of the land occupied by the taxpayers and by applying the specified applicable tax payable per unit. The formula is:
Tax payable = Size of land occupied ×Tax payable per unit
(4) Major exemptions
Tax exemptions may be given on land occupied by governmental organs, people's organizations and military units for their own use; land occupied by units for their own use which are financed by the institutional allocation of funds from financial departments of the State; land occupied by religious temples, parks and historic scenic spots for their own use; land for public use occupied by Municipal Administration, squares and green land; land directly utilized for production in the fields of agriculture, forestry, animal husbandry and fishery industries; land used for water reservation and protection; and land occupied for energy and transportation development upon approval of the State.
City Maintenance and Construction Tax
(1) Taxpayers
The enterprises of any nature, units, individual household businesses and other individuals (excluding enterprises with foreign investment, foreign enterprises and foreigners) who are obliged to pay Value Added Tax, consumption Tax and/or Business Tax are the taxpayers of City Maintenance and Construction Tax.
(2) Tax rates and computation of tax payable
Differential rates are adopted: 7% rate for city area, 5% rate for county and township area and 1% rate for other area. The tax is based on the actual amount of VAT, Consumption Tax and/or Business Tax paid by the taxpayers, and paid together with the three taxes mentioned above. The formula for calculating the amount of the tax payable:
Tax payable = Tax base × tax rate Applicable.
Fixed Assets Investment Orientation Regulation Tax
(1) Taxpayers
This tax is imposed on enterprises, units, individual household businesses and other individuals who invest into fixed assets within the territory of the People's Republic of China (excluding enterprises with foreign investment, foreign enterprises and foreigners).
(2) Taxable items and tax rates
Table of Taxable Items and Tax Rates:
(* For some residential building investment projects, the rate is 5%.)
(3) Computation of tax payable
This tax is based on the total investment actually put into fixed assets. For renewal and transformation projects, the tax is imposed on the investment of the completed part of the construction project. The formula for calculating the tax payable is:
Tax payable - Amount of investment completed or amount of investment in construction project × Applicable rate
Land Appreciation Tax
(3) Computation of tax payable in china
To calculate the amount of Land Appreciation Tax payable, the first step is to arrive at the appreciation amount derived by the taxpayer from the transfer of real estate, which equals to the balance of proceeds received by the taxpayer on the transfer of real estate after deducting the sum of relevant deductible items. Then the amount of tax payable shall be calculated respectively for different parts of the appreciation by applying the applicable tax rates in line with the percentages of the appreciation amount over the sum of the deductible items. The sum of the amount of tax payable for different parts of the appreciation shall be the full amount of tax payable by the taxpayers. The formula is:
Tax payable = Σ (Part of appreciation ×Applicable rate)
(4) Major exemptions
The Land Appreciation Tax shall be exempt in situations where the appreciation amount on the sale of ordinary standard residential buildings construction by taxpayers for sale does not exceed 20% of the sum of deductible items and when the real estate is taken over or repossessed in accordance to the laws due to the construction requirements of the State.
Urban Real Estate Tax
(1) Taxpayers
-At present, this tax is only applied to enterprises with foreign investment, foreign enterprises and foreigners, and levied on house property only.
Taxpayers are owners, mortgagees custodians and/or users of house property.
(2) Tax base, tax rates and computation of tax payable
-Two different rates are applied to two different bases: one rate of 1. 2% is applied to the value of house property, and the other rate of 18% is applied to the rental income from the property. The formula for calculating House Property Tax payable is:
Tax payable = Tax base ×Applicable rate
(3) Major exemptions and reductions
-Newly constructed buildings shall be exempt from the tax for three years commencing from the month in which the construction is completed. Renovated buildings for which the renovation expenses exceed one half of the expenses of the new construction of such buildings shall be exempt from the tax for two years commencing from the month in which the renovation is completed. Other house property may be granted tax exemption or reduction for special reasons by the People's Government at provincial level or above.
Vehicle and Vessel Usage License Plate Tax
(1) Taxpayers
At this moment, this tax is only applied to the enterprises with foreign investment, foreign enterprises, and foreigners. The users of the taxable vehicles and vessels are taxpayers of this tax.
(2) Tax amount per unit
The tax amount per unit is different for vehicles and vessels:
a. Tax amount per unit for vehicles: 15-80 yuan per passenger vehicle per quarter; 4-15 yuan per net tonnage per quarter for cargo vehicles; 5-20 yuan per motorcycle per quarter. 0.3-8 yuan per non-motored vehicle per quarter.
b. Tax amount per unit for vessels: 0.3- 1.1 yuan per net tonnage per quarter for motorized vessels; 0.15-0.35 yuan per non-motorized vessel.
(3) Computation
The tax base for vehicles is the quantity or the net tonnage of taxable vehicles The tax base for vessels is the net-tonnage or the deadweight tonnage of the taxable vessels. The formula for computing the tax payable is:
a. Tax payable = Quantity (or net-tonnage) of taxable vehicles × Applicable tax amount per unit
b. Tax payable = Net-tonnage (or deadweight tonnage) of taxable vessels × Applicable tax amount per unit
(4) Exemptions
a. Tax exemptions may be given on the vehicles used by Embassies and Consulates in China; the vehicles used by diplomatic representatives, consuls, administrative and technical staffs and their spouses and non-grown-up children living together with them.
b. Tax exemptions may be given as stipulated in some provinces and municipalities on the fire vehicles, ambulances, water sprinkling vehicles and similar vehicles of enterprises with foreign investment and foreign enterprises.
Individual income tax
From October 1, 2018
Tax exemption: 5000 RMB for both residents and not residents.
Taxable income = income - tax exemption
Monthly tax formula: (taxable income * tax rate) - quick deduction = tax
Example: ((10000 - 5000) * 10%) - 210 = 290 RMB in taxes
Note that both, tax rate and quick deduction, are based on the 'income' AFTER the 'tax exemption': the 'taxable income'.
New Package of Tax-and-fee policies
Chinese government will implement a new package of tax-and-fee policies to support enterprises, as illustrated in Report on the Work of the Government in 2022. The Chinese government will continue to take temporary steps and institutional measures and apply policies for both tax reductions and refunds.
The State Administration of Taxation said that tax reduction and fee reduction are the fairest, most direct and most effective measures to help enterprises relieve their difficulties. In 2022, Chinese economic development is facing the triple pressure of demand contraction, supply shock, and weakening expectations. The Party Central Committee and the State Council have deployed and implemented a new package of tax-and-fee supporting policies, which include both phased measures and institutional arrangements. There are deferred tax rebate measures; there are generally applicable burden reduction policies and special assistance measures in specific fields; there are continuous arrangements and new deployments; there are policies uniformly implemented by the central government, and there are local autonomous implementations in accordance with the law.
On the basis of 2021, it is expected that year 2022's tax rebate will be about 2.5 trillion Chinese yuan, which will be the largest scale in history, exceeding the general expectations of the society before. Manufacturing is the foundation of the real economy and national competitiveness, and the main players in the small, medium and micro market are the key to ensuring people's livelihood and stabilizing employment. The tax and fee reduction policies implemented in recent years, regardless of the scale or magnitude, are the main beneficiary groups and industries for small, medium and micro market entities and the manufacturing industry. In 2022, the new package of tax-and-fee policies will continue to focus on this key point, maintain the continuity and stability of the policy, and show the characteristics of annual intensification, step-by-step expansion, and gradual progress. Scope of application, a series of policies, such as phased exemption of small-scale taxpayers' value-added tax, and increased income tax reduction for small and low-profit enterprises, will help manufacturing enterprises to go into battle lightly and develop better, and support small, medium and micro market players to overcome difficulties and continue to development and play an important supporting role.
Affected by uncertain factors such as the international environment, many companies are currently facing difficulties such as shortage of funds. In 2022, China has made great efforts to improve the VAT credit and refund system, and implemented large-scale tax refunds for the remaining tax credits. Priority is given to small and micro enterprises. The existing tax credits for small and micro enterprises will be refunded in one go before the end of June, and the incremental tax credits will be sufficient. The Chinese government focuses on supporting the manufacturing industry, and comprehensively solve the problem of tax refunds for industries such as manufacturing, scientific research and technical services, ecological and environmental protection, electricity and gas, and transportation.
In 2022, China will further increase the implementation of the super-deduction policy for R&D expenses, increase the super-deduction ratio of technology-based SMEs from 75% to 100%, implement tax incentives for enterprises investing in basic research, improve the accelerated depreciation of equipment and appliances, and the income tax for high-tech enterprises. Preferential policies and other policies to encourage enterprises to increase investment in research and development, cultivate and strengthen innovation momentum, and better promote high-quality development.
Statistics from the State Administration of Taxation show that in 2021, the country will add a total of 1,008.8 billion yuan in new tax cuts, and a total of 164.7 billion yuan in new fee reductions. From the perspective of different entities, the tax incentives for helping small and micro enterprises have continued to increase. In 2021, the tax incentives to support the development of small and micro enterprises will add 295.1 billion yuan in tax reduction, accounting for 29.3% of the new tax reduction nationwide. The "double" deduction of R&D expenses is beneficial to encourage innovation. In the whole year, 320,000 enterprises enjoyed the super deduction policy in advance, with a tax reduction of 333.3 billion yuan. Enterprises can enjoy more policy dividends earlier and more conveniently. The VAT retained tax refund system was optimized to support the real economy, continued to implement the incremental value-added tax retained tax refund policy, and processed 132.2 billion yuan in tax refunds for the manufacturing industry throughout the year, benefiting 31,000 enterprises. Among them, advanced manufacturing enterprises will fully refund the incremental value-added tax credits on a monthly basis, with an additional tax refund of 16.8 billion yuan in the whole year. The phased tax relief measures were implemented precisely to relieve difficulties. The reduction, refund and delay of tax of coal power and heating enterprises was 27.1 billion yuan, benefiting about 4,800 coal power and heating enterprises. The tax payment for small, medium and micro enterprises in the manufacturing industry was delayed and this fee exceeds 210 billion yuan.
In 2021, the macro tax burden, that is, the proportion of tax revenue in the national general public budget revenue to GDP, was 15.1%, a decrease of 0.1 percentage points from 2020 and a decrease of 3 percentage points from 2015 (18.1%). The income tax burden of key tax source enterprises operation for per 100 yuan decreased by 3.8% compared with 2020, and the cumulative decrease compared with 2015 was 21.7%. Thanks to various policies such as tax reduction and fee reduction, in 2021, the sales revenue of national enterprises increased by 21.1% year-on-year, 30.4% higher than that in 2019, and an average increase of 14.2% in the two years, maintaining a relatively rapid growth overall. The amount of equipment purchased by manufacturing enterprises across the country increased by 24.6% year-on-year, with an average increase of 14.3% in the two years.
General anti-avoidance rules (GAAR)
To combat tax evasion and other forms of tax avoidance, China has implemented the General Anti-Avoidance of Tax Evasion Regulations (GAAR). The GAAR was introduced for the first time in China in 2008 in the PRC Enterprise Income Tax Law and has subsequently undergone numerous updates and revisions. GAAR's foundational objective is to prevent taxpayers from employing aggressive tax planning techniques to reduce or eliminate their tax obligations. Any tax avoidance arrangement by an enterprise in China is subject to the General Anti-Avoidance Rule, which attempts to guarantee that the arrangement serves legitimate commercial goals and not solely to achieve tax benefits. Investigating whether the company's intention for the tax arrangement is reasonable and legal, as opposed to an illegal attempt to acquire tax benefits, is the goal. Tax authorities can disregard or recharacterize transactions that they deem to be artificial or to lack economic substance under the Chinese GAAR regulations. If a GAAR investigation is to be initiated, the local tax authorities must first obtain approval from the State Administration of Taxation. The request must be elevated through the several higher level tax authorities, which are above the local tax authority, in order to receive this approval. Taxpayers subject to the GAAR provisions in China must provide sufficient documentation to back up the commercial purpose of their transactions, transaction documentation, communications between the taxpayer and parties involved in the transaction, and documentation that can demonstrate that the arrangement has a non-tax avoidance purpose. The tax authorities in China must inform the taxpayer in writing of any challenges made to a transaction under the GAAR provisions and state their justifications.
Five year rule
The "Five Year Rule" in China refers to the tax regulations controlling the taxation of foreign citizens who stay in China for at least 183 days in a tax year and who do not leave the country for longer than thirty days in a row or 90 days cumulatively in any of the five years preceding. The five-year period restarts if a person spends the required amount of time outside of the country. To break the five-year period, an expatriate must stay less than 90 days within China for any one-year period following the sixth year if he or she has already been in China for five full consecutive years. The "Five Year Rule" clearly states that foreign nationals are subject to Chinese Individual Income Tax on their worldwide income after five years of continuous citizenship in China. According to this regulation, foreign nationals who have lived in China for less than five years are solely taxed on their income earned within China.
Tax governance
As of 2007, a paper reported that about two-thirds of tax revenue was spent at the local level and that "the ratio of central revenue to total tax revenues reached a low of 22 per cent in 1993, before rising to the 50 per cent level following the 1994 tax reform".
Malware
Companies operating in China are required to use tax software from either Baiwang or Aisino (subsidiary of China Aerospace Science and Industry Corporation), highly sophisticated malware has been found in products from both vendors. Both sets of malware allowed for the theft of corporate secrets and other industrial espionage.
GoldenSpy
GoldenSpy was discovered in 2020 inside Aisino's Intelligent Tax Software, it allows system level access allowing an attacker nearly full control over an infected system. It was discovered that the Intelligent Tax software's uninstall feature would leave the malware in place if used.
After GoldenSpy was discovered its creator's attempted to scrub it from infected systems in an attempt to cover their tracks. The uninstaller was delivered directly through the tax software. A second more sophisticated version of the uninstaller was later deployed as well.
GoldenHelper
GoldenHelper was discovered after GoldenSpy and is an equally sophisticated malware program which was part of the Golden Tax Invoicing software from Baiwang which is used by all companies in China to pay VAT. While it was discovered after GoldenSpy GoldenHelper had been operating for longer. This discovery indicated that Chinese tax software was harboring malware for much longer than suspected.
See also
State Administration of Taxation
General Administration of Customs
Ministry of Finance
List of Chinese administrative divisions by tax revenues
Tax-Sharing Reform of China in 1994
References
An Overview of China's Tax System. 10-27-2007. State Administration of Taxation.
Tax System of the People's Republic of China. Beijing Local Taxation Bureau.
Further reading
Denis V. Kadochnikov (2019) Fiscal decentralization and regional budgets’ changing roles: a comparative case study of Russia and China, Area Development and Policy, DOI: 10.1080/23792949.2019.1705171
History
Huang, R. Taxation and Governmental Finance in Sixteenth Century Ming China (Cambridge U. Press, 1974)
External links
The Economist. China's tax system. April 12, 2007.
|
Rock Sound is a British magazine that covers rock music. The magazine aims at being more "underground" and less commercial, while also giving coverage to better-known acts. It generally focuses on pop punk, post-hardcore, metalcore, punk, emo, hardcore, heavy metal and extreme metal genres of rock music, rarely covering indie rock music at all. The tag-line "For those who like their music loud, extreme and non-conformist" is sometimes used. Although primarily aimed at the British market, the magazine is also sold in Australia, Canada and the United States.
History
The British edition of Rock Sound was launched in March 1999 by the French publisher Editions Freeway. The magazine was bought out by its director, Patrick Napier, in December 2004. The magazines offices are in London. Separate titles with the same name have been published under the same umbrella company in France since 1993, and in Spain since 1998.
The first issue was published in April 1999. Issue 2 featured British band Reef on the front cover, and later issues 3 and 8 featured Terrorvision and Foo Fighters respectively. In July 2011 a host of "Through The Years" articles were written to celebrate the 150th issue of the magazine. 2017 witnessed the first annual Rock Sound Awards where £1 from every magazine bundle sold was donated to the One More Light Fund in memory of Chester Bennington.
The magazine was known for including a free CD in most issues, which had tracks from bands' new albums that have not been released as singles. These were called '100% Volume' or 'The Volumes', with other past compilations named 'Music With Attitude', 'Bugging Your Ears!', 'Sound Check' and 'Punk Rawk Explosion'. Sometimes whole albums were included with the magazine, particularly from bands wanting to gain exposure, including Futures' debut album The Holiday in March 2010, and Burn The Fleet's debut album The Modern Shape in May 2012.
In more recent years, exclusive artist merchandise including t-shirts have been sold alongside the magazine via the Rock Sound web store.
In 2023, Rock Sound became part of WhyNow media group and a special edition magazine was published in partnership with Slam Dunk Festival featuring headliners Enter Shikari and The Offspring on the cover. A weekly digital cover feature, The Album Story, was also launched on ROCKSOUND.TV.
Rock Sound's 300th issue was published in September 2023 with Fall Out Boy, Corey Taylor and Motionless In White appearing on the cover. The magazine will celebrate its 25th anniversary in 2024.
Audience
The magazine had a circulation figure of 15,005 from January to December 2010 auditored by ABC. This includes 10,162 sales in the United Kingdom and Ireland, and 4,843 from Other Countries. The same auditing body said the magazine had a slightly lower circulation figure of 14,227 from January to December 2011, with sales of 10,053 from the United Kingdom and Ireland, and 4,174 from Other Countries. The majority of sales come from newstrade, with some coming from subscriptions.
The main rival to the magazine in Britain is Kerrang! because of the similar types of music both magazines cover.
Album of the Year
At the end of every year the magazine lists their favourite 75 albums released in the previous twelve months.
1999 – Filter – Title of Record
2000 – A Perfect Circle – Mer de Noms
2001 – System of a Down – Toxicity
2002 – Isis – Oceanic
2003 – Hell Is for Heroes – The Neon Handshake
2004 – Isis – Panopticon
2005 – Coheed and Cambria – Good Apollo, I'm Burning Star IV, Volume One: From Fear Through the Eyes of Madness
2006 – The Bronx – The Bronx
2007 – Biffy Clyro – Puzzle
2008 – Genghis Tron – Board Up the House
2009 – Mastodon – Crack the Skye
2010 – Bring Me the Horizon – There Is a Hell Believe Me I've Seen It. There Is a Heaven Let's Keep It a Secret
2011 – Mastodon – The Hunter
2012 – The Menzingers – On the Impossible Past
2013 – letlive – The Blackest Beautiful
2014 – Lower Than Atlantis – Lower Than Atlantis
2015 – Bring Me the Horizon – That's the Spirit
2016 – Panic! at the Disco – Death of a Bachelor
2017 – All Time Low – Last Young Renegade
2018 – Twenty One Pilots – Trench
2019 – Waterparks Fandom
2020 – Yungblud - Weird!
2021 – Twenty One Pilots - Scaled and Icy
Hall of Fame/Throwback
Rock Sound inducted numerous albums into its Hall of Fame, as part of a long-running feature. The main criterion for inclusion was thought to be influence – even within a particular genre – and for that reason many of the albums have been commercially successful as well as critically successful because they have then gone on to influence large numbers of bands or the music scene. Thus this differs from the Yearly Top Albums lists which do not take influence into account. In each article there was normally an interview with band members, a commentary on the album's release, a look at its initial success, and reaction from other musicians or participants in the album's creation - such as producers, engineers, and music video directors. Towards the end of this section's run it was renamed to "Throwback".
Rock Sound Records
In 2019, Rock Sound introduced a new venture titled Rock Sound Records, a sub-brand of Rock Sound offering and distributing music in limited physical formats, such as cassette tapes and vinyl records. Generally, this involves the exclusive physical release of a record released by a band that's signed to a different (major) record label. For instance, the first Rock Sound Records release was a cassette tape version of Simple Creatures′ debut EP Strange Love, while the band is currently signed to BMG.
Discography
See also
Kerrang!
NME
Metal Hammer
Alternative Press
References
Citations
Sources
External links
Official website
1999 establishments in the United Kingdom
Monthly magazines published in the United Kingdom
Music magazines published in the United Kingdom
Magazines established in 1999
|
Sophia Hawthorne (1976 – 17 February 2016) was a New Zealand actress. She was the daughter of actors Elizabeth and Raymond Hawthorne, and sister of actress Emmeline Hawthorne.
In 2004 she starred in The Insider's Guide To Happiness, a New Zealand-produced drama series, and in 2005 she was seen in The Insider's Guide To Love.
She was born in 1976 and died on 17 February 2016 in New Zealand after a long battle with depression.
Filmography
Theatre
References
External links
1976 births
2016 deaths
New Zealand actresses
|
Beata Falk (born February 17, 1989) is a Swedish orienteering competitor, and junior world champion.
She became Junior World Champion in the relay in Gothenburg in 2008, together with Jenny Lönnkvist and Lina Strand, and received silver medals in the middle distance (behind Venla Niemi) and in the long course (behind Jenny Lönnkvist).
She competed at the 2010 World Orienteering Championships in Trondheim, where she qualified for the sprint final.
References
External links
1989 births
Living people
Swedish orienteers
Female orienteers
Foot orienteers
21st-century Swedish people
Junior World Orienteering Championships medalists
|
Hunza, Pakistan, has been famous for its practices in Shamanism. Shaman in the local language (Burushaski) are referred as 'Bitan'. Shamanism in the area has been linked to its dynamic history.
Bitan
Bitan is the Burushaski equivalent of Shaman. Bitans are not like the Eurasian Shamans, as the Eurasian Shamans have some special physical qualities like extra teeth, a sixth finger, or other physical signs. Dayals are normal beings who are selected by the Pari (the fairy, plural ).
Pariting descends to the earth during the cherry and apricot blossom seasons. Pariting choose the dayal from new borns by smelling their noses and mouths. It is not apparent who is a dayal during the childhood. Bitans grow distinct characteristics when they reach teenage. These characteristics includes becoming unconscious, going into a state of ecstasy, or sickness for days or sometimes weeks. A Bitan may die if he (his spirit) resists to be one during the period when the shamanist's characteristics start to appear.
Dayal have craving for music (a special tune/composition); on listening to such music they can go into a state of trance where they meet with the pari. Bitans dance to the music during festivals like Ginani (crop harvesting festival). During the dance, dayal also foretell the next year's crop production.
Shamanic Practices
Shamans or the Dayals are believed to have foresight. This foresight is a result of Dayal's interactions with the spirits. These spirits are fairies, pari (plural ) as called in the local language. The paris tell the dayals about the future when they are in an ecstatic/trance state. Thus they foretell the future.
The Ritual
The ritual to get the dayal into the shamanistic or the ecstatic state, need music, smoke and blood of goat. Music is played by the musicians (). The orchestra has three instruments, namely Dadang (Drum), Daamal (two hemi-spherical drums) and Surnai (Shenai) or Gabi (local variant of reed pipe). For the smoke juniper leaves and Syrian rue (local name Supandur) are put on fire. For blood the dayal drinks it from the recently chopped head of a goat (Chati).
Dayal starts to dance to the music. While dancing dayal inhales the smoke of juniper leaves simultaneously. Then drinking the blood from Chati. Dayal gets into a higher state as he continues to dance to the music. Reaching the state the dayal starts to speak in Shina (language of Gilgit). Dayal converses/argues/ask the pari regarding the concern he has. During the process dayal may pass out. Dayal can go to such state for at most two or three times before he passes out.
History
Historians like M.H. Sidky, have done extensive research on the topic of Shamanism. Sidky had published a paper on Shamanism in Hunza. Where the author had mentioned the famous Bitans (shamans) of the area, including Huk Mamu and Shon Gakur.
Bitans of Hunza used to tell future by doing the shamanic practices. Bitans were summoned by the Thum/Mir to predict any calamity, famine or any disaster expected in near future.
References
Hunza
Religion in Pakistan
Shamanism
|
Jacobine Veenhoven (born 30 January 1984, Laren) is a Dutch female rower. She won the bronze medal at the 2012 Summer Olympics in the women's eight event.
References
1984 births
Living people
Dutch female rowers
Olympic rowers for the Netherlands
Rowers at the 2012 Summer Olympics
Olympic bronze medalists for the Netherlands
Olympic medalists in rowing
Sportspeople from Laren, North Holland
Medalists at the 2012 Summer Olympics
20th-century Dutch women
21st-century Dutch women
|
```java
/*
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing,
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* specific language governing permissions and limitations
*/
package org.apache.pulsar.client.api;
import io.netty.util.HashedWheelTimer;
import lombok.Cleanup;
import org.apache.pulsar.client.impl.PulsarClientImpl;
import org.testng.Assert;
import org.testng.annotations.AfterClass;
import org.testng.annotations.BeforeClass;
import org.testng.annotations.DataProvider;
import org.testng.annotations.Test;
import java.util.UUID;
@Test(groups = "broker-api")
public class ConsumerCleanupTest extends ProducerConsumerBase {
@BeforeClass
@Override
protected void setup() throws Exception {
super.internalSetup();
super.producerBaseSetup();
}
@AfterClass(alwaysRun = true)
@Override
protected void cleanup() throws Exception {
super.internalCleanup();
}
@DataProvider(name = "ackReceiptEnabled")
public Object[][] ackReceiptEnabled() {
return new Object[][] { { true }, { false } };
}
@Test(dataProvider = "ackReceiptEnabled")
public void testAllTimerTaskShouldCanceledAfterConsumerClosed(boolean ackReceiptEnabled)
throws PulsarClientException, InterruptedException {
@Cleanup
PulsarClient pulsarClient = newPulsarClient(lookupUrl.toString(), 1);
Consumer<byte[]> consumer = pulsarClient.newConsumer()
.topic("persistent://public/default/" + UUID.randomUUID().toString())
.subscriptionName("test")
.isAckReceiptEnabled(ackReceiptEnabled)
.subscribe();
consumer.close();
Thread.sleep(2000);
HashedWheelTimer timer = (HashedWheelTimer) ((PulsarClientImpl) pulsarClient).timer();
Assert.assertEquals(timer.pendingTimeouts(), 0);
}
}
```
|
```java
package com.ashokvarma.bottomnavigation.utils;
import android.content.Context;
import android.content.res.TypedArray;
import android.graphics.Color;
import android.graphics.Point;
import android.util.TypedValue;
import android.view.WindowManager;
/**
* Class description : These are common utils and can be used for other projects as well
*
* @author ashokvarma
* @version 1.0
* @since 19 Mar 2016
*/
public class Utils {
public static final int NO_COLOR = Color.TRANSPARENT;
private Utils() {
}
/**
* @param context used to get system services
* @return screenWidth in pixels
*/
public static int getScreenWidth(Context context) {
WindowManager wm = (WindowManager) context.getSystemService(Context.WINDOW_SERVICE);
Point size = new Point();
wm.getDefaultDisplay().getSize(size);
return size.x;
}
/**
* This method can be extended to get all android attributes color, string, dimension ...etc
*
* @param context used to fetch android attribute
* @param androidAttribute attribute codes like R.attr.colorAccent
* @return in this case color of android attribute
*/
public static int fetchContextColor(Context context, int androidAttribute) {
TypedValue typedValue = new TypedValue();
TypedArray a = context.obtainStyledAttributes(typedValue.data, new int[]{androidAttribute});
int color = a.getColor(0, 0);
a.recycle();
return color;
}
/**
* @param context used to fetch display metrics
* @param dp dp value
* @return pixel value
*/
public static int dp2px(Context context, float dp) {
float px = TypedValue.applyDimension(TypedValue.COMPLEX_UNIT_DIP, dp, context.getResources().getDisplayMetrics());
return Math.round(px);
}
}
```
|
```javascript
"use strict";
var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
Object.defineProperty(exports, "__esModule", {
value: true
});
exports.getReplicationHandlerByCollection = getReplicationHandlerByCollection;
exports.startSocketServer = startSocketServer;
exports.startWebsocketServer = startWebsocketServer;
var _isomorphicWs = _interopRequireDefault(require("isomorphic-ws"));
var _index = require("../../replication-protocol/index.js");
var _index2 = require("../../plugins/utils/index.js");
var _rxjs = require("rxjs");
var {
WebSocketServer
} = _isomorphicWs.default;
function startSocketServer(options) {
var wss = new WebSocketServer(options);
var closed = false;
function closeServer() {
if (closed) {
return _index2.PROMISE_RESOLVE_VOID;
}
closed = true;
onConnection$.complete();
return new Promise((res, rej) => {
/**
* We have to close all client connections,
* otherwise wss.close() will never call the callback.
* @link path_to_url#issuecomment-360594458
*/
for (var ws of wss.clients) {
ws.close();
}
wss.close(err => {
if (err) {
rej(err);
} else {
res();
}
});
});
}
var onConnection$ = new _rxjs.Subject();
wss.on('connection', ws => onConnection$.next(ws));
return {
server: wss,
close: closeServer,
onConnection$: onConnection$.asObservable()
};
}
var REPLICATION_HANDLER_BY_COLLECTION = new Map();
function getReplicationHandlerByCollection(database, collectionName) {
if (!database.collections[collectionName]) {
throw new Error('collection ' + collectionName + ' does not exist');
}
var collection = database.collections[collectionName];
var handler = (0, _index2.getFromMapOrCreate)(REPLICATION_HANDLER_BY_COLLECTION, collection, () => {
return (0, _index.rxStorageInstanceToReplicationHandler)(collection.storageInstance, collection.conflictHandler, database.token);
});
return handler;
}
function startWebsocketServer(options) {
var {
database,
...wsOptions
} = options;
var serverState = startSocketServer(wsOptions);
// auto close when the database gets destroyed
database.onDestroy.push(() => serverState.close());
serverState.onConnection$.subscribe(ws => {
var onCloseHandlers = [];
ws.onclose = () => {
onCloseHandlers.map(fn => fn());
};
ws.on('message', async messageString => {
var message = JSON.parse(messageString);
var handler = getReplicationHandlerByCollection(database, message.collection);
if (message.method === 'auth') {
return;
}
var method = handler[message.method];
/**
* If it is not a function,
* it means that the client requested the masterChangeStream$
*/
if (typeof method !== 'function') {
var changeStreamSub = handler.masterChangeStream$.subscribe(ev => {
var streamResponse = {
id: 'stream',
collection: message.collection,
result: ev
};
ws.send(JSON.stringify(streamResponse));
});
onCloseHandlers.push(() => changeStreamSub.unsubscribe());
return;
}
var result = await method(...message.params);
var response = {
id: message.id,
collection: message.collection,
result
};
ws.send(JSON.stringify(response));
});
});
return serverState;
}
//# sourceMappingURL=websocket-server.js.map
```
|
```go
//go:build windows
// +build windows
package common
import (
"context"
"fmt"
"path/filepath"
"reflect"
"strings"
"syscall"
"unsafe"
"github.com/yusufpapurcu/wmi"
"golang.org/x/sys/windows"
)
// for double values
type PDH_FMT_COUNTERVALUE_DOUBLE struct {
CStatus uint32
DoubleValue float64
}
// for 64 bit integer values
type PDH_FMT_COUNTERVALUE_LARGE struct {
CStatus uint32
LargeValue int64
}
// for long values
type PDH_FMT_COUNTERVALUE_LONG struct {
CStatus uint32
LongValue int32
padding [4]byte
}
// windows system const
const (
ERROR_SUCCESS = 0
ERROR_FILE_NOT_FOUND = 2
DRIVE_REMOVABLE = 2
DRIVE_FIXED = 3
HKEY_LOCAL_MACHINE = 0x80000002
RRF_RT_REG_SZ = 0x00000002
RRF_RT_REG_DWORD = 0x00000010
PDH_FMT_LONG = 0x00000100
PDH_FMT_DOUBLE = 0x00000200
PDH_FMT_LARGE = 0x00000400
PDH_INVALID_DATA = 0xc0000bc6
PDH_INVALID_HANDLE = 0xC0000bbc
PDH_NO_DATA = 0x800007d5
STATUS_BUFFER_OVERFLOW = 0x80000005
STATUS_BUFFER_TOO_SMALL = 0xC0000023
STATUS_INFO_LENGTH_MISMATCH = 0xC0000004
)
const (
ProcessBasicInformation = 0
ProcessWow64Information = 26
ProcessQueryInformation = windows.PROCESS_DUP_HANDLE | windows.PROCESS_QUERY_INFORMATION
SystemExtendedHandleInformationClass = 64
)
var (
Modkernel32 = windows.NewLazySystemDLL("kernel32.dll")
ModNt = windows.NewLazySystemDLL("ntdll.dll")
ModPdh = windows.NewLazySystemDLL("pdh.dll")
ModPsapi = windows.NewLazySystemDLL("psapi.dll")
ProcGetSystemTimes = Modkernel32.NewProc("GetSystemTimes")
ProcNtQuerySystemInformation = ModNt.NewProc("NtQuerySystemInformation")
ProcRtlGetNativeSystemInformation = ModNt.NewProc("RtlGetNativeSystemInformation")
ProcRtlNtStatusToDosError = ModNt.NewProc("RtlNtStatusToDosError")
ProcNtQueryInformationProcess = ModNt.NewProc("NtQueryInformationProcess")
ProcNtReadVirtualMemory = ModNt.NewProc("NtReadVirtualMemory")
ProcNtWow64QueryInformationProcess64 = ModNt.NewProc("NtWow64QueryInformationProcess64")
ProcNtWow64ReadVirtualMemory64 = ModNt.NewProc("NtWow64ReadVirtualMemory64")
PdhOpenQuery = ModPdh.NewProc("PdhOpenQuery")
PdhAddEnglishCounterW = ModPdh.NewProc("PdhAddEnglishCounterW")
PdhCollectQueryData = ModPdh.NewProc("PdhCollectQueryData")
PdhGetFormattedCounterValue = ModPdh.NewProc("PdhGetFormattedCounterValue")
PdhCloseQuery = ModPdh.NewProc("PdhCloseQuery")
procQueryDosDeviceW = Modkernel32.NewProc("QueryDosDeviceW")
)
type FILETIME struct {
DwLowDateTime uint32
DwHighDateTime uint32
}
// borrowed from net/interface_windows.go
func BytePtrToString(p *uint8) string {
a := (*[10000]uint8)(unsafe.Pointer(p))
i := 0
for a[i] != 0 {
i++
}
return string(a[:i])
}
// CounterInfo struct is used to track a windows performance counter
// copied from path_to_url
type CounterInfo struct {
PostName string
CounterName string
Counter windows.Handle
}
// CreateQuery with a PdhOpenQuery call
// copied from path_to_url
func CreateQuery() (windows.Handle, error) {
var query windows.Handle
r, _, err := PdhOpenQuery.Call(0, 0, uintptr(unsafe.Pointer(&query)))
if r != 0 {
return 0, err
}
return query, nil
}
// CreateCounter with a PdhAddEnglishCounterW call
func CreateCounter(query windows.Handle, pname, cname string) (*CounterInfo, error) {
var counter windows.Handle
r, _, err := PdhAddEnglishCounterW.Call(
uintptr(query),
uintptr(unsafe.Pointer(windows.StringToUTF16Ptr(cname))),
0,
uintptr(unsafe.Pointer(&counter)))
if r != 0 {
return nil, err
}
return &CounterInfo{
PostName: pname,
CounterName: cname,
Counter: counter,
}, nil
}
// GetCounterValue get counter value from handle
// adapted from path_to_url
func GetCounterValue(counter windows.Handle) (float64, error) {
var value PDH_FMT_COUNTERVALUE_DOUBLE
r, _, err := PdhGetFormattedCounterValue.Call(uintptr(counter), PDH_FMT_DOUBLE, uintptr(0), uintptr(unsafe.Pointer(&value)))
if r != 0 && r != PDH_INVALID_DATA {
return 0.0, err
}
return value.DoubleValue, nil
}
type Win32PerformanceCounter struct {
PostName string
CounterName string
Query windows.Handle
Counter windows.Handle
}
func NewWin32PerformanceCounter(postName, counterName string) (*Win32PerformanceCounter, error) {
query, err := CreateQuery()
if err != nil {
return nil, err
}
counter := Win32PerformanceCounter{
Query: query,
PostName: postName,
CounterName: counterName,
}
r, _, err := PdhAddEnglishCounterW.Call(
uintptr(counter.Query),
uintptr(unsafe.Pointer(windows.StringToUTF16Ptr(counter.CounterName))),
0,
uintptr(unsafe.Pointer(&counter.Counter)),
)
if r != 0 {
return nil, err
}
return &counter, nil
}
func (w *Win32PerformanceCounter) GetValue() (float64, error) {
r, _, err := PdhCollectQueryData.Call(uintptr(w.Query))
if r != 0 && err != nil {
if r == PDH_NO_DATA {
return 0.0, fmt.Errorf("%w: this counter has not data", err)
}
return 0.0, err
}
return GetCounterValue(w.Counter)
}
func ProcessorQueueLengthCounter() (*Win32PerformanceCounter, error) {
return NewWin32PerformanceCounter("processor_queue_length", `\System\Processor Queue Length`)
}
// WMIQueryWithContext - wraps wmi.Query with a timed-out context to avoid hanging
func WMIQueryWithContext(ctx context.Context, query string, dst interface{}, connectServerArgs ...interface{}) error {
if _, ok := ctx.Deadline(); !ok {
ctxTimeout, cancel := context.WithTimeout(ctx, Timeout)
defer cancel()
ctx = ctxTimeout
}
errChan := make(chan error, 1)
go func() {
errChan <- wmi.Query(query, dst, connectServerArgs...)
}()
select {
case <-ctx.Done():
return ctx.Err()
case err := <-errChan:
return err
}
}
// Convert paths using native DOS format like:
//
// "\Device\HarddiskVolume1\Windows\systemew\file.txt"
//
// into:
//
// "C:\Windows\systemew\file.txt"
func ConvertDOSPath(p string) string {
rawDrive := strings.Join(strings.Split(p, `\`)[:3], `\`)
for d := 'A'; d <= 'Z'; d++ {
szDeviceName := string(d) + ":"
szTarget := make([]uint16, 512)
ret, _, _ := procQueryDosDeviceW.Call(uintptr(unsafe.Pointer(syscall.StringToUTF16Ptr(szDeviceName))),
uintptr(unsafe.Pointer(&szTarget[0])),
uintptr(len(szTarget)))
if ret != 0 && windows.UTF16ToString(szTarget[:]) == rawDrive {
return filepath.Join(szDeviceName, p[len(rawDrive):])
}
}
return p
}
type NtStatus uint32
func (s NtStatus) Error() error {
if s == 0 {
return nil
}
return fmt.Errorf("NtStatus 0x%08x", uint32(s))
}
func (s NtStatus) IsError() bool {
return s>>30 == 3
}
type SystemExtendedHandleTableEntryInformation struct {
Object uintptr
UniqueProcessId uintptr
HandleValue uintptr
GrantedAccess uint32
CreatorBackTraceIndex uint16
ObjectTypeIndex uint16
HandleAttributes uint32
Reserved uint32
}
type SystemExtendedHandleInformation struct {
NumberOfHandles uintptr
Reserved uintptr
Handles [1]SystemExtendedHandleTableEntryInformation
}
// CallWithExpandingBuffer path_to_url
func CallWithExpandingBuffer(fn func() NtStatus, buf *[]byte, resultLength *uint32) NtStatus {
for {
if st := fn(); st == STATUS_BUFFER_OVERFLOW || st == STATUS_BUFFER_TOO_SMALL || st == STATUS_INFO_LENGTH_MISMATCH {
if int(*resultLength) <= cap(*buf) {
(*reflect.SliceHeader)(unsafe.Pointer(buf)).Len = int(*resultLength)
} else {
*buf = make([]byte, int(*resultLength))
}
continue
} else {
if !st.IsError() {
*buf = (*buf)[:int(*resultLength)]
}
return st
}
}
}
func NtQuerySystemInformation(
SystemInformationClass uint32,
SystemInformation *byte,
SystemInformationLength uint32,
ReturnLength *uint32,
) NtStatus {
r0, _, _ := ProcNtQuerySystemInformation.Call(
uintptr(SystemInformationClass),
uintptr(unsafe.Pointer(SystemInformation)),
uintptr(SystemInformationLength),
uintptr(unsafe.Pointer(ReturnLength)))
return NtStatus(r0)
}
```
|
```c
/* tc-mn10300.c -- Assembler code for the Matsushita 10300
Free Software Foundation, Inc.
This file is part of GAS, the GNU Assembler.
GAS is free software; you can redistribute it and/or modify
the Free Software Foundation; either version 2, or (at your option)
any later version.
GAS is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
along with GAS; see the file COPYING. If not, write to
the Free Software Foundation, 59 Temple Place - Suite 330,
Boston, MA 02111-1307, USA. */
#include <stdio.h>
#include "as.h"
#include "safe-ctype.h"
#include "subsegs.h"
#include "opcode/mn10300.h"
#include "dwarf2dbg.h"
/* Structure to hold information about predefined registers. */
struct reg_name
{
const char *name;
int value;
};
/* Generic assembler global variables which must be defined by all
targets. */
/* Characters which always start a comment. */
const char comment_chars[] = "#";
/* Characters which start a comment at the beginning of a line. */
const char line_comment_chars[] = ";#";
/* Characters which may be used to separate multiple commands on a
single line. */
const char line_separator_chars[] = ";";
/* Characters which are used to indicate an exponent in a floating
point number. */
const char EXP_CHARS[] = "eE";
/* Characters which mean that a number is a floating point constant,
as in 0d1.0. */
const char FLT_CHARS[] = "dD";
const relax_typeS md_relax_table[] = {
/* bCC relaxing */
{0x7f, -0x80, 2, 1},
{0x7fff, -0x8000, 5, 2},
{0x7fffffff, -0x80000000, 7, 0},
/* bCC relaxing (uncommon cases) */
{0x7f, -0x80, 3, 4},
{0x7fff, -0x8000, 6, 5},
{0x7fffffff, -0x80000000, 8, 0},
/* call relaxing */
{0x7fff, -0x8000, 5, 7},
{0x7fffffff, -0x80000000, 7, 0},
/* calls relaxing */
{0x7fff, -0x8000, 4, 9},
{0x7fffffff, -0x80000000, 6, 0},
/* jmp relaxing */
{0x7f, -0x80, 2, 11},
{0x7fff, -0x8000, 3, 12},
{0x7fffffff, -0x80000000, 5, 0},
/* fbCC relaxing */
{0x7f, -0x80, 3, 14},
{0x7fff, -0x8000, 6, 15},
{0x7fffffff, -0x80000000, 8, 0},
};
/* Local functions. */
static void mn10300_insert_operand PARAMS ((unsigned long *, unsigned long *,
const struct mn10300_operand *,
offsetT, char *, unsigned,
unsigned));
static unsigned long check_operand PARAMS ((unsigned long,
const struct mn10300_operand *,
offsetT));
static int reg_name_search PARAMS ((const struct reg_name *, int, const char *));
static bfd_boolean data_register_name PARAMS ((expressionS *expressionP));
static bfd_boolean address_register_name PARAMS ((expressionS *expressionP));
static bfd_boolean other_register_name PARAMS ((expressionS *expressionP));
static bfd_boolean r_register_name PARAMS ((expressionS *expressionP));
static bfd_boolean xr_register_name PARAMS ((expressionS *expressionP));
static void set_arch_mach PARAMS ((int));
/* Set linkrelax here to avoid fixups in most sections. */
int linkrelax = 1;
static int current_machine;
/* Fixups. */
#define MAX_INSN_FIXUPS (5)
struct mn10300_fixup
{
expressionS exp;
int opindex;
bfd_reloc_code_real_type reloc;
};
struct mn10300_fixup fixups[MAX_INSN_FIXUPS];
static int fc;
/* We must store the value of each register operand so that we can
verify that certain registers do not match. */
int mn10300_reg_operands[MN10300_MAX_OPERANDS];
const char *md_shortopts = "";
struct option md_longopts[] = {
{NULL, no_argument, NULL, 0}
};
size_t md_longopts_size = sizeof (md_longopts);
/* The target specific pseudo-ops which we support. */
const pseudo_typeS md_pseudo_table[] =
{
{ "am30", set_arch_mach, AM30 },
{ "am33", set_arch_mach, AM33 },
{ "am33_2", (void (*) PARAMS ((int))) set_arch_mach, AM33_2 },
{ "mn10300", set_arch_mach, MN103 },
{NULL, 0, 0}
};
#define HAVE_AM33_2 (current_machine == AM33_2)
#define HAVE_AM33 (current_machine == AM33 || HAVE_AM33_2)
#define HAVE_AM30 (current_machine == AM30)
/* Opcode hash table. */
static struct hash_control *mn10300_hash;
/* This table is sorted. Suitable for searching by a binary search. */
static const struct reg_name data_registers[] =
{
{ "d0", 0 },
{ "d1", 1 },
{ "d2", 2 },
{ "d3", 3 },
};
#define DATA_REG_NAME_CNT \
(sizeof (data_registers) / sizeof (struct reg_name))
static const struct reg_name address_registers[] =
{
{ "a0", 0 },
{ "a1", 1 },
{ "a2", 2 },
{ "a3", 3 },
};
#define ADDRESS_REG_NAME_CNT \
(sizeof (address_registers) / sizeof (struct reg_name))
static const struct reg_name r_registers[] =
{
{ "a0", 8 },
{ "a1", 9 },
{ "a2", 10 },
{ "a3", 11 },
{ "d0", 12 },
{ "d1", 13 },
{ "d2", 14 },
{ "d3", 15 },
{ "e0", 0 },
{ "e1", 1 },
{ "e10", 10 },
{ "e11", 11 },
{ "e12", 12 },
{ "e13", 13 },
{ "e14", 14 },
{ "e15", 15 },
{ "e2", 2 },
{ "e3", 3 },
{ "e4", 4 },
{ "e5", 5 },
{ "e6", 6 },
{ "e7", 7 },
{ "e8", 8 },
{ "e9", 9 },
{ "r0", 0 },
{ "r1", 1 },
{ "r10", 10 },
{ "r11", 11 },
{ "r12", 12 },
{ "r13", 13 },
{ "r14", 14 },
{ "r15", 15 },
{ "r2", 2 },
{ "r3", 3 },
{ "r4", 4 },
{ "r5", 5 },
{ "r6", 6 },
{ "r7", 7 },
{ "r8", 8 },
{ "r9", 9 },
};
#define R_REG_NAME_CNT \
(sizeof (r_registers) / sizeof (struct reg_name))
static const struct reg_name xr_registers[] =
{
{ "mcrh", 2 },
{ "mcrl", 3 },
{ "mcvf", 4 },
{ "mdrq", 1 },
{ "sp", 0 },
{ "xr0", 0 },
{ "xr1", 1 },
{ "xr10", 10 },
{ "xr11", 11 },
{ "xr12", 12 },
{ "xr13", 13 },
{ "xr14", 14 },
{ "xr15", 15 },
{ "xr2", 2 },
{ "xr3", 3 },
{ "xr4", 4 },
{ "xr5", 5 },
{ "xr6", 6 },
{ "xr7", 7 },
{ "xr8", 8 },
{ "xr9", 9 },
};
#define XR_REG_NAME_CNT \
(sizeof (xr_registers) / sizeof (struct reg_name))
/* We abuse the `value' field, that would be otherwise unused, to
encode the architecture on which (access to) the register was
introduced. FIXME: we should probably warn when we encounter a
register name when assembling for an architecture that doesn't
support it, before parsing it as a symbol name. */
static const struct reg_name other_registers[] =
{
{ "epsw", AM33 },
{ "mdr", 0 },
{ "pc", AM33 },
{ "psw", 0 },
{ "sp", 0 },
};
#define OTHER_REG_NAME_CNT \
(sizeof (other_registers) / sizeof (struct reg_name))
static const struct reg_name float_registers[] =
{
{ "fs0", 0 },
{ "fs1", 1 },
{ "fs10", 10 },
{ "fs11", 11 },
{ "fs12", 12 },
{ "fs13", 13 },
{ "fs14", 14 },
{ "fs15", 15 },
{ "fs16", 16 },
{ "fs17", 17 },
{ "fs18", 18 },
{ "fs19", 19 },
{ "fs2", 2 },
{ "fs20", 20 },
{ "fs21", 21 },
{ "fs22", 22 },
{ "fs23", 23 },
{ "fs24", 24 },
{ "fs25", 25 },
{ "fs26", 26 },
{ "fs27", 27 },
{ "fs28", 28 },
{ "fs29", 29 },
{ "fs3", 3 },
{ "fs30", 30 },
{ "fs31", 31 },
{ "fs4", 4 },
{ "fs5", 5 },
{ "fs6", 6 },
{ "fs7", 7 },
{ "fs8", 8 },
{ "fs9", 9 },
};
#define FLOAT_REG_NAME_CNT \
(sizeof (float_registers) / sizeof (struct reg_name))
static const struct reg_name double_registers[] =
{
{ "fd0", 0 },
{ "fd10", 10 },
{ "fd12", 12 },
{ "fd14", 14 },
{ "fd16", 16 },
{ "fd18", 18 },
{ "fd2", 2 },
{ "fd20", 20 },
{ "fd22", 22 },
{ "fd24", 24 },
{ "fd26", 26 },
{ "fd28", 28 },
{ "fd30", 30 },
{ "fd4", 4 },
{ "fd6", 6 },
{ "fd8", 8 },
};
#define DOUBLE_REG_NAME_CNT \
(sizeof (double_registers) / sizeof (struct reg_name))
/* reg_name_search does a binary search of the given register table
to see if "name" is a valid regiter name. Returns the register
number from the array on success, or -1 on failure. */
static int
reg_name_search (regs, regcount, name)
const struct reg_name *regs;
int regcount;
const char *name;
{
int middle, low, high;
int cmp;
low = 0;
high = regcount - 1;
do
{
middle = (low + high) / 2;
cmp = strcasecmp (name, regs[middle].name);
if (cmp < 0)
high = middle - 1;
else if (cmp > 0)
low = middle + 1;
else
return regs[middle].value;
}
while (low <= high);
return -1;
}
/* Summary of register_name().
*
* in: Input_line_pointer points to 1st char of operand.
*
* out: An expressionS.
* The operand may have been a register: in this case, X_op == O_register,
* X_add_number is set to the register number, and truth is returned.
* Input_line_pointer->(next non-blank) char after operand, or is in
* its original state.
*/
static bfd_boolean
r_register_name (expressionP)
expressionS *expressionP;
{
int reg_number;
char *name;
char *start;
char c;
/* Find the spelling of the operand. */
start = name = input_line_pointer;
c = get_symbol_end ();
reg_number = reg_name_search (r_registers, R_REG_NAME_CNT, name);
/* Put back the delimiting char. */
*input_line_pointer = c;
/* Look to see if it's in the register table. */
if (reg_number >= 0)
{
expressionP->X_op = O_register;
expressionP->X_add_number = reg_number;
/* Make the rest nice. */
expressionP->X_add_symbol = NULL;
expressionP->X_op_symbol = NULL;
return TRUE;
}
/* Reset the line as if we had not done anything. */
input_line_pointer = start;
return FALSE;
}
/* Summary of register_name().
*
* in: Input_line_pointer points to 1st char of operand.
*
* out: An expressionS.
* The operand may have been a register: in this case, X_op == O_register,
* X_add_number is set to the register number, and truth is returned.
* Input_line_pointer->(next non-blank) char after operand, or is in
* its original state.
*/
static bfd_boolean
xr_register_name (expressionP)
expressionS *expressionP;
{
int reg_number;
char *name;
char *start;
char c;
/* Find the spelling of the operand. */
start = name = input_line_pointer;
c = get_symbol_end ();
reg_number = reg_name_search (xr_registers, XR_REG_NAME_CNT, name);
/* Put back the delimiting char. */
*input_line_pointer = c;
/* Look to see if it's in the register table. */
if (reg_number >= 0)
{
expressionP->X_op = O_register;
expressionP->X_add_number = reg_number;
/* Make the rest nice. */
expressionP->X_add_symbol = NULL;
expressionP->X_op_symbol = NULL;
return TRUE;
}
/* Reset the line as if we had not done anything. */
input_line_pointer = start;
return FALSE;
}
/* Summary of register_name().
*
* in: Input_line_pointer points to 1st char of operand.
*
* out: An expressionS.
* The operand may have been a register: in this case, X_op == O_register,
* X_add_number is set to the register number, and truth is returned.
* Input_line_pointer->(next non-blank) char after operand, or is in
* its original state.
*/
static bfd_boolean
data_register_name (expressionP)
expressionS *expressionP;
{
int reg_number;
char *name;
char *start;
char c;
/* Find the spelling of the operand. */
start = name = input_line_pointer;
c = get_symbol_end ();
reg_number = reg_name_search (data_registers, DATA_REG_NAME_CNT, name);
/* Put back the delimiting char. */
*input_line_pointer = c;
/* Look to see if it's in the register table. */
if (reg_number >= 0)
{
expressionP->X_op = O_register;
expressionP->X_add_number = reg_number;
/* Make the rest nice. */
expressionP->X_add_symbol = NULL;
expressionP->X_op_symbol = NULL;
return TRUE;
}
/* Reset the line as if we had not done anything. */
input_line_pointer = start;
return FALSE;
}
/* Summary of register_name().
*
* in: Input_line_pointer points to 1st char of operand.
*
* out: An expressionS.
* The operand may have been a register: in this case, X_op == O_register,
* X_add_number is set to the register number, and truth is returned.
* Input_line_pointer->(next non-blank) char after operand, or is in
* its original state.
*/
static bfd_boolean
address_register_name (expressionP)
expressionS *expressionP;
{
int reg_number;
char *name;
char *start;
char c;
/* Find the spelling of the operand. */
start = name = input_line_pointer;
c = get_symbol_end ();
reg_number = reg_name_search (address_registers, ADDRESS_REG_NAME_CNT, name);
/* Put back the delimiting char. */
*input_line_pointer = c;
/* Look to see if it's in the register table. */
if (reg_number >= 0)
{
expressionP->X_op = O_register;
expressionP->X_add_number = reg_number;
/* Make the rest nice. */
expressionP->X_add_symbol = NULL;
expressionP->X_op_symbol = NULL;
return TRUE;
}
/* Reset the line as if we had not done anything. */
input_line_pointer = start;
return FALSE;
}
/* Summary of register_name().
*
* in: Input_line_pointer points to 1st char of operand.
*
* out: An expressionS.
* The operand may have been a register: in this case, X_op == O_register,
* X_add_number is set to the register number, and truth is returned.
* Input_line_pointer->(next non-blank) char after operand, or is in
* its original state.
*/
static bfd_boolean
other_register_name (expressionP)
expressionS *expressionP;
{
int reg_number;
char *name;
char *start;
char c;
/* Find the spelling of the operand. */
start = name = input_line_pointer;
c = get_symbol_end ();
reg_number = reg_name_search (other_registers, OTHER_REG_NAME_CNT, name);
/* Put back the delimiting char. */
*input_line_pointer = c;
/* Look to see if it's in the register table. */
if (reg_number == 0
|| (reg_number == AM33 && HAVE_AM33))
{
expressionP->X_op = O_register;
expressionP->X_add_number = 0;
/* Make the rest nice. */
expressionP->X_add_symbol = NULL;
expressionP->X_op_symbol = NULL;
return TRUE;
}
/* Reset the line as if we had not done anything. */
input_line_pointer = start;
return FALSE;
}
static bfd_boolean double_register_name PARAMS ((expressionS *));
static bfd_boolean float_register_name PARAMS ((expressionS *));
/* Summary of float_register_name:
in: Input_line_pointer points to 1st char of operand.
out: A expressionS.
The operand may have been a register: in this case, X_op == O_register,
X_add_number is set to the register number, and truth is returned.
Input_line_pointer->(next non-blank) char after operand, or is in
its original state. */
static bfd_boolean
float_register_name (expressionP)
expressionS *expressionP;
{
int reg_number;
char *name;
char *start;
char c;
/* Find the spelling of the operand. */
start = name = input_line_pointer;
c = get_symbol_end ();
reg_number = reg_name_search (float_registers, FLOAT_REG_NAME_CNT, name);
/* Put back the delimiting char. */
* input_line_pointer = c;
/* Look to see if it's in the register table. */
if (reg_number >= 0)
{
expressionP->X_op = O_register;
expressionP->X_add_number = reg_number;
/* Make the rest nice. */
expressionP->X_add_symbol = NULL;
expressionP->X_op_symbol = NULL;
return TRUE;
}
/* Reset the line as if we had not done anything. */
input_line_pointer = start;
return FALSE;
}
/* Summary of double_register_name:
in: Input_line_pointer points to 1st char of operand.
out: A expressionS.
The operand may have been a register: in this case, X_op == O_register,
X_add_number is set to the register number, and truth is returned.
Input_line_pointer->(next non-blank) char after operand, or is in
its original state. */
static bfd_boolean
double_register_name (expressionP)
expressionS *expressionP;
{
int reg_number;
char *name;
char *start;
char c;
/* Find the spelling of the operand. */
start = name = input_line_pointer;
c = get_symbol_end ();
reg_number = reg_name_search (double_registers, DOUBLE_REG_NAME_CNT, name);
/* Put back the delimiting char. */
* input_line_pointer = c;
/* Look to see if it's in the register table. */
if (reg_number >= 0)
{
expressionP->X_op = O_register;
expressionP->X_add_number = reg_number;
/* Make the rest nice. */
expressionP->X_add_symbol = NULL;
expressionP->X_op_symbol = NULL;
return TRUE;
}
/* Reset the line as if we had not done anything. */
input_line_pointer = start;
return FALSE;
}
void
md_show_usage (stream)
FILE *stream;
{
fprintf (stream, _("MN10300 options:\n\
none yet\n"));
}
int
md_parse_option (c, arg)
int c ATTRIBUTE_UNUSED;
char *arg ATTRIBUTE_UNUSED;
{
return 0;
}
symbolS *
md_undefined_symbol (name)
char *name ATTRIBUTE_UNUSED;
{
return 0;
}
char *
md_atof (type, litp, sizep)
int type;
char *litp;
int *sizep;
{
int prec;
LITTLENUM_TYPE words[4];
char *t;
int i;
switch (type)
{
case 'f':
prec = 2;
break;
case 'd':
prec = 4;
break;
default:
*sizep = 0;
return "bad call to md_atof";
}
t = atof_ieee (input_line_pointer, type, words);
if (t)
input_line_pointer = t;
*sizep = prec * 2;
for (i = prec - 1; i >= 0; i--)
{
md_number_to_chars (litp, (valueT) words[i], 2);
litp += 2;
}
return NULL;
}
void
md_convert_frag (abfd, sec, fragP)
bfd *abfd ATTRIBUTE_UNUSED;
asection *sec;
fragS *fragP;
{
static unsigned long label_count = 0;
char buf[40];
subseg_change (sec, 0);
if (fragP->fr_subtype == 0)
{
fix_new (fragP, fragP->fr_fix + 1, 1, fragP->fr_symbol,
fragP->fr_offset + 1, 1, BFD_RELOC_8_PCREL);
fragP->fr_var = 0;
fragP->fr_fix += 2;
}
else if (fragP->fr_subtype == 1)
{
/* Reverse the condition of the first branch. */
int offset = fragP->fr_fix;
int opcode = fragP->fr_literal[offset] & 0xff;
switch (opcode)
{
case 0xc8:
opcode = 0xc9;
break;
case 0xc9:
opcode = 0xc8;
break;
case 0xc0:
opcode = 0xc2;
break;
case 0xc2:
opcode = 0xc0;
break;
case 0xc3:
opcode = 0xc1;
break;
case 0xc1:
opcode = 0xc3;
break;
case 0xc4:
opcode = 0xc6;
break;
case 0xc6:
opcode = 0xc4;
break;
case 0xc7:
opcode = 0xc5;
break;
case 0xc5:
opcode = 0xc7;
break;
default:
abort ();
}
fragP->fr_literal[offset] = opcode;
/* Create a fixup for the reversed conditional branch. */
sprintf (buf, ".%s_%ld", FAKE_LABEL_NAME, label_count++);
fix_new (fragP, fragP->fr_fix + 1, 1,
symbol_new (buf, sec, 0, fragP->fr_next),
fragP->fr_offset + 1, 1, BFD_RELOC_8_PCREL);
/* Now create the unconditional branch + fixup to the
final target. */
fragP->fr_literal[offset + 2] = 0xcc;
fix_new (fragP, fragP->fr_fix + 3, 2, fragP->fr_symbol,
fragP->fr_offset + 1, 1, BFD_RELOC_16_PCREL);
fragP->fr_var = 0;
fragP->fr_fix += 5;
}
else if (fragP->fr_subtype == 2)
{
/* Reverse the condition of the first branch. */
int offset = fragP->fr_fix;
int opcode = fragP->fr_literal[offset] & 0xff;
switch (opcode)
{
case 0xc8:
opcode = 0xc9;
break;
case 0xc9:
opcode = 0xc8;
break;
case 0xc0:
opcode = 0xc2;
break;
case 0xc2:
opcode = 0xc0;
break;
case 0xc3:
opcode = 0xc1;
break;
case 0xc1:
opcode = 0xc3;
break;
case 0xc4:
opcode = 0xc6;
break;
case 0xc6:
opcode = 0xc4;
break;
case 0xc7:
opcode = 0xc5;
break;
case 0xc5:
opcode = 0xc7;
break;
default:
abort ();
}
fragP->fr_literal[offset] = opcode;
/* Create a fixup for the reversed conditional branch. */
sprintf (buf, ".%s_%ld", FAKE_LABEL_NAME, label_count++);
fix_new (fragP, fragP->fr_fix + 1, 1,
symbol_new (buf, sec, 0, fragP->fr_next),
fragP->fr_offset + 1, 1, BFD_RELOC_8_PCREL);
/* Now create the unconditional branch + fixup to the
final target. */
fragP->fr_literal[offset + 2] = 0xdc;
fix_new (fragP, fragP->fr_fix + 3, 4, fragP->fr_symbol,
fragP->fr_offset + 1, 1, BFD_RELOC_32_PCREL);
fragP->fr_var = 0;
fragP->fr_fix += 7;
}
else if (fragP->fr_subtype == 3)
{
fix_new (fragP, fragP->fr_fix + 2, 1, fragP->fr_symbol,
fragP->fr_offset + 2, 1, BFD_RELOC_8_PCREL);
fragP->fr_var = 0;
fragP->fr_fix += 3;
}
else if (fragP->fr_subtype == 4)
{
/* Reverse the condition of the first branch. */
int offset = fragP->fr_fix;
int opcode = fragP->fr_literal[offset + 1] & 0xff;
switch (opcode)
{
case 0xe8:
opcode = 0xe9;
break;
case 0xe9:
opcode = 0xe8;
break;
case 0xea:
opcode = 0xeb;
break;
case 0xeb:
opcode = 0xea;
break;
default:
abort ();
}
fragP->fr_literal[offset + 1] = opcode;
/* Create a fixup for the reversed conditional branch. */
sprintf (buf, ".%s_%ld", FAKE_LABEL_NAME, label_count++);
fix_new (fragP, fragP->fr_fix + 2, 1,
symbol_new (buf, sec, 0, fragP->fr_next),
fragP->fr_offset + 2, 1, BFD_RELOC_8_PCREL);
/* Now create the unconditional branch + fixup to the
final target. */
fragP->fr_literal[offset + 3] = 0xcc;
fix_new (fragP, fragP->fr_fix + 4, 2, fragP->fr_symbol,
fragP->fr_offset + 1, 1, BFD_RELOC_16_PCREL);
fragP->fr_var = 0;
fragP->fr_fix += 6;
}
else if (fragP->fr_subtype == 5)
{
/* Reverse the condition of the first branch. */
int offset = fragP->fr_fix;
int opcode = fragP->fr_literal[offset + 1] & 0xff;
switch (opcode)
{
case 0xe8:
opcode = 0xe9;
break;
case 0xea:
opcode = 0xeb;
break;
case 0xeb:
opcode = 0xea;
break;
default:
abort ();
}
fragP->fr_literal[offset + 1] = opcode;
/* Create a fixup for the reversed conditional branch. */
sprintf (buf, ".%s_%ld", FAKE_LABEL_NAME, label_count++);
fix_new (fragP, fragP->fr_fix + 2, 1,
symbol_new (buf, sec, 0, fragP->fr_next),
fragP->fr_offset + 2, 1, BFD_RELOC_8_PCREL);
/* Now create the unconditional branch + fixup to the
final target. */
fragP->fr_literal[offset + 3] = 0xdc;
fix_new (fragP, fragP->fr_fix + 4, 4, fragP->fr_symbol,
fragP->fr_offset + 1, 1, BFD_RELOC_32_PCREL);
fragP->fr_var = 0;
fragP->fr_fix += 8;
}
else if (fragP->fr_subtype == 6)
{
int offset = fragP->fr_fix;
fragP->fr_literal[offset] = 0xcd;
fix_new (fragP, fragP->fr_fix + 1, 2, fragP->fr_symbol,
fragP->fr_offset + 1, 1, BFD_RELOC_16_PCREL);
fragP->fr_var = 0;
fragP->fr_fix += 5;
}
else if (fragP->fr_subtype == 7)
{
int offset = fragP->fr_fix;
fragP->fr_literal[offset] = 0xdd;
fragP->fr_literal[offset + 5] = fragP->fr_literal[offset + 3];
fragP->fr_literal[offset + 6] = fragP->fr_literal[offset + 4];
fix_new (fragP, fragP->fr_fix + 1, 4, fragP->fr_symbol,
fragP->fr_offset + 1, 1, BFD_RELOC_32_PCREL);
fragP->fr_var = 0;
fragP->fr_fix += 7;
}
else if (fragP->fr_subtype == 8)
{
int offset = fragP->fr_fix;
fragP->fr_literal[offset] = 0xfa;
fragP->fr_literal[offset + 1] = 0xff;
fix_new (fragP, fragP->fr_fix + 2, 2, fragP->fr_symbol,
fragP->fr_offset + 2, 1, BFD_RELOC_16_PCREL);
fragP->fr_var = 0;
fragP->fr_fix += 4;
}
else if (fragP->fr_subtype == 9)
{
int offset = fragP->fr_fix;
fragP->fr_literal[offset] = 0xfc;
fragP->fr_literal[offset + 1] = 0xff;
fix_new (fragP, fragP->fr_fix + 2, 4, fragP->fr_symbol,
fragP->fr_offset + 2, 1, BFD_RELOC_32_PCREL);
fragP->fr_var = 0;
fragP->fr_fix += 6;
}
else if (fragP->fr_subtype == 10)
{
fragP->fr_literal[fragP->fr_fix] = 0xca;
fix_new (fragP, fragP->fr_fix + 1, 1, fragP->fr_symbol,
fragP->fr_offset + 1, 1, BFD_RELOC_8_PCREL);
fragP->fr_var = 0;
fragP->fr_fix += 2;
}
else if (fragP->fr_subtype == 11)
{
int offset = fragP->fr_fix;
fragP->fr_literal[offset] = 0xcc;
fix_new (fragP, fragP->fr_fix + 1, 4, fragP->fr_symbol,
fragP->fr_offset + 1, 1, BFD_RELOC_16_PCREL);
fragP->fr_var = 0;
fragP->fr_fix += 3;
}
else if (fragP->fr_subtype == 12)
{
int offset = fragP->fr_fix;
fragP->fr_literal[offset] = 0xdc;
fix_new (fragP, fragP->fr_fix + 1, 4, fragP->fr_symbol,
fragP->fr_offset + 1, 1, BFD_RELOC_32_PCREL);
fragP->fr_var = 0;
fragP->fr_fix += 5;
}
else if (fragP->fr_subtype == 13)
{
fix_new (fragP, fragP->fr_fix + 2, 1, fragP->fr_symbol,
fragP->fr_offset + 2, 1, BFD_RELOC_8_PCREL);
fragP->fr_var = 0;
fragP->fr_fix += 3;
}
else if (fragP->fr_subtype == 14)
{
/* Reverse the condition of the first branch. */
int offset = fragP->fr_fix;
int opcode = fragP->fr_literal[offset + 1] & 0xff;
switch (opcode)
{
case 0xd0:
opcode = 0xd1;
break;
case 0xd1:
opcode = 0xd0;
break;
case 0xd2:
opcode = 0xdc;
break;
case 0xd3:
opcode = 0xdb;
break;
case 0xd4:
opcode = 0xda;
break;
case 0xd5:
opcode = 0xd9;
break;
case 0xd6:
opcode = 0xd8;
break;
case 0xd7:
opcode = 0xdd;
break;
case 0xd8:
opcode = 0xd6;
break;
case 0xd9:
opcode = 0xd5;
break;
case 0xda:
opcode = 0xd4;
break;
case 0xdb:
opcode = 0xd3;
break;
case 0xdc:
opcode = 0xd2;
break;
case 0xdd:
opcode = 0xd7;
break;
default:
abort ();
}
fragP->fr_literal[offset + 1] = opcode;
/* Create a fixup for the reversed conditional branch. */
sprintf (buf, ".%s_%ld", FAKE_LABEL_NAME, label_count++);
fix_new (fragP, fragP->fr_fix + 2, 1,
symbol_new (buf, sec, 0, fragP->fr_next),
fragP->fr_offset + 2, 1, BFD_RELOC_8_PCREL);
/* Now create the unconditional branch + fixup to the
final target. */
fragP->fr_literal[offset + 3] = 0xcc;
fix_new (fragP, fragP->fr_fix + 4, 2, fragP->fr_symbol,
fragP->fr_offset + 1, 1, BFD_RELOC_16_PCREL);
fragP->fr_var = 0;
fragP->fr_fix += 6;
}
else if (fragP->fr_subtype == 15)
{
/* Reverse the condition of the first branch. */
int offset = fragP->fr_fix;
int opcode = fragP->fr_literal[offset + 1] & 0xff;
switch (opcode)
{
case 0xd0:
opcode = 0xd1;
break;
case 0xd1:
opcode = 0xd0;
break;
case 0xd2:
opcode = 0xdc;
break;
case 0xd3:
opcode = 0xdb;
break;
case 0xd4:
opcode = 0xda;
break;
case 0xd5:
opcode = 0xd9;
break;
case 0xd6:
opcode = 0xd8;
break;
case 0xd7:
opcode = 0xdd;
break;
case 0xd8:
opcode = 0xd6;
break;
case 0xd9:
opcode = 0xd5;
break;
case 0xda:
opcode = 0xd4;
break;
case 0xdb:
opcode = 0xd3;
break;
case 0xdc:
opcode = 0xd2;
break;
case 0xdd:
opcode = 0xd7;
break;
default:
abort ();
}
fragP->fr_literal[offset + 1] = opcode;
/* Create a fixup for the reversed conditional branch. */
sprintf (buf, ".%s_%ld", FAKE_LABEL_NAME, label_count++);
fix_new (fragP, fragP->fr_fix + 2, 1,
symbol_new (buf, sec, 0, fragP->fr_next),
fragP->fr_offset + 2, 1, BFD_RELOC_8_PCREL);
/* Now create the unconditional branch + fixup to the
final target. */
fragP->fr_literal[offset + 3] = 0xdc;
fix_new (fragP, fragP->fr_fix + 4, 4, fragP->fr_symbol,
fragP->fr_offset + 1, 1, BFD_RELOC_32_PCREL);
fragP->fr_var = 0;
fragP->fr_fix += 8;
}
else
abort ();
}
valueT
md_section_align (seg, addr)
asection *seg;
valueT addr;
{
int align = bfd_get_section_alignment (stdoutput, seg);
return ((addr + (1 << align) - 1) & (-1 << align));
}
void
md_begin ()
{
char *prev_name = "";
register const struct mn10300_opcode *op;
mn10300_hash = hash_new ();
/* Insert unique names into hash table. The MN10300 instruction set
has many identical opcode names that have different opcodes based
on the operands. This hash table then provides a quick index to
the first opcode with a particular name in the opcode table. */
op = mn10300_opcodes;
while (op->name)
{
if (strcmp (prev_name, op->name))
{
prev_name = (char *) op->name;
hash_insert (mn10300_hash, op->name, (char *) op);
}
op++;
}
/* Set the default machine type. */
#ifdef TE_LINUX
if (!bfd_set_arch_mach (stdoutput, bfd_arch_mn10300, AM33_2))
as_warn (_("could not set architecture and machine"));
current_machine = AM33_2;
#else
if (!bfd_set_arch_mach (stdoutput, bfd_arch_mn10300, MN103))
as_warn (_("could not set architecture and machine"));
current_machine = MN103;
#endif
}
static symbolS *GOT_symbol;
static inline int mn10300_check_fixup PARAMS ((struct mn10300_fixup *));
static inline int mn10300_PIC_related_p PARAMS ((symbolS *));
static inline int
mn10300_PIC_related_p (sym)
symbolS *sym;
{
expressionS *exp;
if (! sym)
return 0;
if (sym == GOT_symbol)
return 1;
exp = symbol_get_value_expression (sym);
return (exp->X_op == O_PIC_reloc
|| mn10300_PIC_related_p (exp->X_add_symbol)
|| mn10300_PIC_related_p (exp->X_op_symbol));
}
static inline int
mn10300_check_fixup (fixup)
struct mn10300_fixup *fixup;
{
expressionS *exp = &fixup->exp;
repeat:
switch (exp->X_op)
{
case O_add:
case O_subtract: /* If we're sufficiently unlucky that the label
and the expression that references it happen
to end up in different frags, the subtract
won't be simplified within expression(). */
/* The PIC-related operand must be the first operand of a sum. */
if (exp != &fixup->exp || mn10300_PIC_related_p (exp->X_op_symbol))
return 1;
if (exp->X_add_symbol && exp->X_add_symbol == GOT_symbol)
fixup->reloc = BFD_RELOC_32_GOT_PCREL;
exp = symbol_get_value_expression (exp->X_add_symbol);
goto repeat;
case O_symbol:
if (exp->X_add_symbol && exp->X_add_symbol == GOT_symbol)
fixup->reloc = BFD_RELOC_32_GOT_PCREL;
break;
case O_PIC_reloc:
fixup->reloc = exp->X_md;
exp->X_op = O_symbol;
if (fixup->reloc == BFD_RELOC_32_PLT_PCREL
&& fixup->opindex >= 0
&& (mn10300_operands[fixup->opindex].flags
& MN10300_OPERAND_RELAX))
return 1;
break;
default:
return (mn10300_PIC_related_p (exp->X_add_symbol)
|| mn10300_PIC_related_p (exp->X_op_symbol));
}
return 0;
}
void
mn10300_cons_fix_new (frag, off, size, exp)
fragS *frag;
int off, size;
expressionS *exp;
{
struct mn10300_fixup fixup;
fixup.opindex = -1;
fixup.exp = *exp;
fixup.reloc = BFD_RELOC_UNUSED;
mn10300_check_fixup (&fixup);
if (fixup.reloc == BFD_RELOC_MN10300_GOT32)
switch (size)
{
case 2:
fixup.reloc = BFD_RELOC_MN10300_GOT16;
break;
case 3:
fixup.reloc = BFD_RELOC_MN10300_GOT24;
break;
case 4:
break;
default:
goto error;
}
else if (fixup.reloc == BFD_RELOC_UNUSED)
switch (size)
{
case 1:
fixup.reloc = BFD_RELOC_8;
break;
case 2:
fixup.reloc = BFD_RELOC_16;
break;
case 3:
fixup.reloc = BFD_RELOC_24;
break;
case 4:
fixup.reloc = BFD_RELOC_32;
break;
default:
goto error;
}
else if (size != 4)
{
error:
as_bad (_("unsupported BFD relocation size %u"), size);
fixup.reloc = BFD_RELOC_UNUSED;
}
fix_new_exp (frag, off, size, &fixup.exp, 0, fixup.reloc);
}
void
md_assemble (str)
char *str;
{
char *s;
struct mn10300_opcode *opcode;
struct mn10300_opcode *next_opcode;
const unsigned char *opindex_ptr;
int next_opindex, relaxable;
unsigned long insn, extension, size = 0;
char *f;
int i;
int match;
/* Get the opcode. */
for (s = str; *s != '\0' && !ISSPACE (*s); s++)
;
if (*s != '\0')
*s++ = '\0';
/* Find the first opcode with the proper name. */
opcode = (struct mn10300_opcode *) hash_find (mn10300_hash, str);
if (opcode == NULL)
{
as_bad (_("Unrecognized opcode: `%s'"), str);
return;
}
str = s;
while (ISSPACE (*str))
++str;
input_line_pointer = str;
for (;;)
{
const char *errmsg;
int op_idx;
char *hold;
int extra_shift = 0;
errmsg = _("Invalid opcode/operands");
/* Reset the array of register operands. */
memset (mn10300_reg_operands, -1, sizeof (mn10300_reg_operands));
relaxable = 0;
fc = 0;
match = 0;
next_opindex = 0;
insn = opcode->opcode;
extension = 0;
/* If the instruction is not available on the current machine
then it can not possibly match. */
if (opcode->machine
&& !(opcode->machine == AM33_2 && HAVE_AM33_2)
&& !(opcode->machine == AM33 && HAVE_AM33)
&& !(opcode->machine == AM30 && HAVE_AM30))
goto error;
for (op_idx = 1, opindex_ptr = opcode->operands;
*opindex_ptr != 0;
opindex_ptr++, op_idx++)
{
const struct mn10300_operand *operand;
expressionS ex;
if (next_opindex == 0)
{
operand = &mn10300_operands[*opindex_ptr];
}
else
{
operand = &mn10300_operands[next_opindex];
next_opindex = 0;
}
while (*str == ' ' || *str == ',')
++str;
if (operand->flags & MN10300_OPERAND_RELAX)
relaxable = 1;
/* Gather the operand. */
hold = input_line_pointer;
input_line_pointer = str;
if (operand->flags & MN10300_OPERAND_PAREN)
{
if (*input_line_pointer != ')' && *input_line_pointer != '(')
{
input_line_pointer = hold;
str = hold;
goto error;
}
input_line_pointer++;
goto keep_going;
}
/* See if we can match the operands. */
else if (operand->flags & MN10300_OPERAND_DREG)
{
if (!data_register_name (&ex))
{
input_line_pointer = hold;
str = hold;
goto error;
}
}
else if (operand->flags & MN10300_OPERAND_AREG)
{
if (!address_register_name (&ex))
{
input_line_pointer = hold;
str = hold;
goto error;
}
}
else if (operand->flags & MN10300_OPERAND_SP)
{
char *start = input_line_pointer;
char c = get_symbol_end ();
if (strcasecmp (start, "sp") != 0)
{
*input_line_pointer = c;
input_line_pointer = hold;
str = hold;
goto error;
}
*input_line_pointer = c;
goto keep_going;
}
else if (operand->flags & MN10300_OPERAND_RREG)
{
if (!r_register_name (&ex))
{
input_line_pointer = hold;
str = hold;
goto error;
}
}
else if (operand->flags & MN10300_OPERAND_XRREG)
{
if (!xr_register_name (&ex))
{
input_line_pointer = hold;
str = hold;
goto error;
}
}
else if (operand->flags & MN10300_OPERAND_FSREG)
{
if (!float_register_name (&ex))
{
input_line_pointer = hold;
str = hold;
goto error;
}
}
else if (operand->flags & MN10300_OPERAND_FDREG)
{
if (!double_register_name (&ex))
{
input_line_pointer = hold;
str = hold;
goto error;
}
}
else if (operand->flags & MN10300_OPERAND_FPCR)
{
char *start = input_line_pointer;
char c = get_symbol_end ();
if (strcasecmp (start, "fpcr") != 0)
{
*input_line_pointer = c;
input_line_pointer = hold;
str = hold;
goto error;
}
*input_line_pointer = c;
goto keep_going;
}
else if (operand->flags & MN10300_OPERAND_USP)
{
char *start = input_line_pointer;
char c = get_symbol_end ();
if (strcasecmp (start, "usp") != 0)
{
*input_line_pointer = c;
input_line_pointer = hold;
str = hold;
goto error;
}
*input_line_pointer = c;
goto keep_going;
}
else if (operand->flags & MN10300_OPERAND_SSP)
{
char *start = input_line_pointer;
char c = get_symbol_end ();
if (strcasecmp (start, "ssp") != 0)
{
*input_line_pointer = c;
input_line_pointer = hold;
str = hold;
goto error;
}
*input_line_pointer = c;
goto keep_going;
}
else if (operand->flags & MN10300_OPERAND_MSP)
{
char *start = input_line_pointer;
char c = get_symbol_end ();
if (strcasecmp (start, "msp") != 0)
{
*input_line_pointer = c;
input_line_pointer = hold;
str = hold;
goto error;
}
*input_line_pointer = c;
goto keep_going;
}
else if (operand->flags & MN10300_OPERAND_PC)
{
char *start = input_line_pointer;
char c = get_symbol_end ();
if (strcasecmp (start, "pc") != 0)
{
*input_line_pointer = c;
input_line_pointer = hold;
str = hold;
goto error;
}
*input_line_pointer = c;
goto keep_going;
}
else if (operand->flags & MN10300_OPERAND_EPSW)
{
char *start = input_line_pointer;
char c = get_symbol_end ();
if (strcasecmp (start, "epsw") != 0)
{
*input_line_pointer = c;
input_line_pointer = hold;
str = hold;
goto error;
}
*input_line_pointer = c;
goto keep_going;
}
else if (operand->flags & MN10300_OPERAND_PLUS)
{
if (*input_line_pointer != '+')
{
input_line_pointer = hold;
str = hold;
goto error;
}
input_line_pointer++;
goto keep_going;
}
else if (operand->flags & MN10300_OPERAND_PSW)
{
char *start = input_line_pointer;
char c = get_symbol_end ();
if (strcasecmp (start, "psw") != 0)
{
*input_line_pointer = c;
input_line_pointer = hold;
str = hold;
goto error;
}
*input_line_pointer = c;
goto keep_going;
}
else if (operand->flags & MN10300_OPERAND_MDR)
{
char *start = input_line_pointer;
char c = get_symbol_end ();
if (strcasecmp (start, "mdr") != 0)
{
*input_line_pointer = c;
input_line_pointer = hold;
str = hold;
goto error;
}
*input_line_pointer = c;
goto keep_going;
}
else if (operand->flags & MN10300_OPERAND_REG_LIST)
{
unsigned int value = 0;
if (*input_line_pointer != '[')
{
input_line_pointer = hold;
str = hold;
goto error;
}
/* Eat the '['. */
input_line_pointer++;
/* We used to reject a null register list here; however,
we accept it now so the compiler can emit "call"
instructions for all calls to named functions.
The linker can then fill in the appropriate bits for the
register list and stack size or change the instruction
into a "calls" if using "call" is not profitable. */
while (*input_line_pointer != ']')
{
char *start;
char c;
if (*input_line_pointer == ',')
input_line_pointer++;
start = input_line_pointer;
c = get_symbol_end ();
if (strcasecmp (start, "d2") == 0)
{
value |= 0x80;
*input_line_pointer = c;
}
else if (strcasecmp (start, "d3") == 0)
{
value |= 0x40;
*input_line_pointer = c;
}
else if (strcasecmp (start, "a2") == 0)
{
value |= 0x20;
*input_line_pointer = c;
}
else if (strcasecmp (start, "a3") == 0)
{
value |= 0x10;
*input_line_pointer = c;
}
else if (strcasecmp (start, "other") == 0)
{
value |= 0x08;
*input_line_pointer = c;
}
else if (HAVE_AM33
&& strcasecmp (start, "exreg0") == 0)
{
value |= 0x04;
*input_line_pointer = c;
}
else if (HAVE_AM33
&& strcasecmp (start, "exreg1") == 0)
{
value |= 0x02;
*input_line_pointer = c;
}
else if (HAVE_AM33
&& strcasecmp (start, "exother") == 0)
{
value |= 0x01;
*input_line_pointer = c;
}
else if (HAVE_AM33
&& strcasecmp (start, "all") == 0)
{
value |= 0xff;
*input_line_pointer = c;
}
else
{
input_line_pointer = hold;
str = hold;
goto error;
}
}
input_line_pointer++;
mn10300_insert_operand (&insn, &extension, operand,
value, (char *) NULL, 0, 0);
goto keep_going;
}
else if (data_register_name (&ex))
{
input_line_pointer = hold;
str = hold;
goto error;
}
else if (address_register_name (&ex))
{
input_line_pointer = hold;
str = hold;
goto error;
}
else if (other_register_name (&ex))
{
input_line_pointer = hold;
str = hold;
goto error;
}
else if (HAVE_AM33 && r_register_name (&ex))
{
input_line_pointer = hold;
str = hold;
goto error;
}
else if (HAVE_AM33 && xr_register_name (&ex))
{
input_line_pointer = hold;
str = hold;
goto error;
}
else if (HAVE_AM33_2 && float_register_name (&ex))
{
input_line_pointer = hold;
str = hold;
goto error;
}
else if (HAVE_AM33_2 && double_register_name (&ex))
{
input_line_pointer = hold;
str = hold;
goto error;
}
else if (*str == ')' || *str == '(')
{
input_line_pointer = hold;
str = hold;
goto error;
}
else
{
expression (&ex);
}
switch (ex.X_op)
{
case O_illegal:
errmsg = _("illegal operand");
goto error;
case O_absent:
errmsg = _("missing operand");
goto error;
case O_register:
{
int mask;
mask = MN10300_OPERAND_DREG | MN10300_OPERAND_AREG;
if (HAVE_AM33)
mask |= MN10300_OPERAND_RREG | MN10300_OPERAND_XRREG;
if (HAVE_AM33_2)
mask |= MN10300_OPERAND_FSREG | MN10300_OPERAND_FDREG;
if ((operand->flags & mask) == 0)
{
input_line_pointer = hold;
str = hold;
goto error;
}
if (opcode->format == FMT_D1 || opcode->format == FMT_S1)
extra_shift = 8;
else if (opcode->format == FMT_D2
|| opcode->format == FMT_D4
|| opcode->format == FMT_S2
|| opcode->format == FMT_S4
|| opcode->format == FMT_S6
|| opcode->format == FMT_D5)
extra_shift = 16;
else if (opcode->format == FMT_D7)
extra_shift = 8;
else if (opcode->format == FMT_D8 || opcode->format == FMT_D9)
extra_shift = 8;
else
extra_shift = 0;
mn10300_insert_operand (&insn, &extension, operand,
ex.X_add_number, (char *) NULL,
0, extra_shift);
/* And note the register number in the register array. */
mn10300_reg_operands[op_idx - 1] = ex.X_add_number;
break;
}
case O_constant:
/* If this operand can be promoted, and it doesn't
fit into the allocated bitfield for this insn,
then promote it (ie this opcode does not match). */
if (operand->flags
& (MN10300_OPERAND_PROMOTE | MN10300_OPERAND_RELAX)
&& !check_operand (insn, operand, ex.X_add_number))
{
input_line_pointer = hold;
str = hold;
goto error;
}
mn10300_insert_operand (&insn, &extension, operand,
ex.X_add_number, (char *) NULL,
0, 0);
break;
default:
/* If this operand can be promoted, then this opcode didn't
match since we can't know if it needed promotion! */
if (operand->flags & MN10300_OPERAND_PROMOTE)
{
input_line_pointer = hold;
str = hold;
goto error;
}
/* We need to generate a fixup for this expression. */
if (fc >= MAX_INSN_FIXUPS)
as_fatal (_("too many fixups"));
fixups[fc].exp = ex;
fixups[fc].opindex = *opindex_ptr;
fixups[fc].reloc = BFD_RELOC_UNUSED;
if (mn10300_check_fixup (& fixups[fc]))
goto error;
++fc;
break;
}
keep_going:
str = input_line_pointer;
input_line_pointer = hold;
while (*str == ' ' || *str == ',')
++str;
}
/* Make sure we used all the operands! */
if (*str != ',')
match = 1;
/* If this instruction has registers that must not match, verify
that they do indeed not match. */
if (opcode->no_match_operands)
{
int i;
/* Look at each operand to see if it's marked. */
for (i = 0; i < MN10300_MAX_OPERANDS; i++)
{
if ((1 << i) & opcode->no_match_operands)
{
int j;
/* operand I is marked. Check that it does not match any
operands > I which are marked. */
for (j = i + 1; j < MN10300_MAX_OPERANDS; j++)
{
if (((1 << j) & opcode->no_match_operands)
&& mn10300_reg_operands[i] == mn10300_reg_operands[j])
{
errmsg = _("Invalid register specification.");
match = 0;
goto error;
}
}
}
}
}
error:
if (match == 0)
{
next_opcode = opcode + 1;
if (!strcmp (next_opcode->name, opcode->name))
{
opcode = next_opcode;
continue;
}
as_bad ("%s", errmsg);
return;
}
break;
}
while (ISSPACE (*str))
++str;
if (*str != '\0')
as_bad (_("junk at end of line: `%s'"), str);
input_line_pointer = str;
/* Determine the size of the instruction. */
if (opcode->format == FMT_S0)
size = 1;
if (opcode->format == FMT_S1 || opcode->format == FMT_D0)
size = 2;
if (opcode->format == FMT_S2 || opcode->format == FMT_D1)
size = 3;
if (opcode->format == FMT_D6)
size = 3;
if (opcode->format == FMT_D7 || opcode->format == FMT_D10)
size = 4;
if (opcode->format == FMT_D8)
size = 6;
if (opcode->format == FMT_D9)
size = 7;
if (opcode->format == FMT_S4)
size = 5;
if (opcode->format == FMT_S6 || opcode->format == FMT_D5)
size = 7;
if (opcode->format == FMT_D2)
size = 4;
if (opcode->format == FMT_D3)
size = 5;
if (opcode->format == FMT_D4)
size = 6;
if (relaxable && fc > 0)
{
int type;
/* We want to anchor the line info to the previous frag (if
there isn't one, create it), so that, when the insn is
resized, we still get the right address for the beginning of
the region. */
f = frag_more (0);
dwarf2_emit_insn (0);
/* bCC */
if (size == 2)
{
/* Handle bra specially. Basically treat it like jmp so
that we automatically handle 8, 16 and 32 bit offsets
correctly as well as jumps to an undefined address.
It is also important to not treat it like other bCC
instructions since the long forms of bra is different
from other bCC instructions. */
if (opcode->opcode == 0xca00)
type = 10;
else
type = 0;
}
/* call */
else if (size == 5)
type = 6;
/* calls */
else if (size == 4)
type = 8;
/* jmp */
else if (size == 3 && opcode->opcode == 0xcc0000)
type = 10;
else if (size == 3 && (opcode->opcode & 0xfff000) == 0xf8d000)
type = 13;
/* bCC (uncommon cases) */
else
type = 3;
f = frag_var (rs_machine_dependent, 8, 8 - size, type,
fixups[0].exp.X_add_symbol,
fixups[0].exp.X_add_number,
(char *)fixups[0].opindex);
/* This is pretty hokey. We basically just care about the
opcode, so we have to write out the first word big endian.
The exception is "call", which has two operands that we
care about.
The first operand (the register list) happens to be in the
first instruction word, and will be in the right place if
we output the first word in big endian mode.
The second operand (stack size) is in the extension word,
and we want it to appear as the first character in the extension
word (as it appears in memory). Luckily, writing the extension
word in big endian format will do what we want. */
number_to_chars_bigendian (f, insn, size > 4 ? 4 : size);
if (size > 8)
{
number_to_chars_bigendian (f + 4, extension, 4);
number_to_chars_bigendian (f + 8, 0, size - 8);
}
else if (size > 4)
number_to_chars_bigendian (f + 4, extension, size - 4);
}
else
{
/* Allocate space for the instruction. */
f = frag_more (size);
/* Fill in bytes for the instruction. Note that opcode fields
are written big-endian, 16 & 32bit immediates are written
little endian. Egad. */
if (opcode->format == FMT_S0
|| opcode->format == FMT_S1
|| opcode->format == FMT_D0
|| opcode->format == FMT_D6
|| opcode->format == FMT_D7
|| opcode->format == FMT_D10
|| opcode->format == FMT_D1)
{
number_to_chars_bigendian (f, insn, size);
}
else if (opcode->format == FMT_S2
&& opcode->opcode != 0xdf0000
&& opcode->opcode != 0xde0000)
{
/* A format S2 instruction that is _not_ "ret" and "retf". */
number_to_chars_bigendian (f, (insn >> 16) & 0xff, 1);
number_to_chars_littleendian (f + 1, insn & 0xffff, 2);
}
else if (opcode->format == FMT_S2)
{
/* This must be a ret or retf, which is written entirely in
big-endian format. */
number_to_chars_bigendian (f, insn, 3);
}
else if (opcode->format == FMT_S4
&& opcode->opcode != 0xdc000000)
{
/* This must be a format S4 "call" instruction. What a pain. */
unsigned long temp = (insn >> 8) & 0xffff;
number_to_chars_bigendian (f, (insn >> 24) & 0xff, 1);
number_to_chars_littleendian (f + 1, temp, 2);
number_to_chars_bigendian (f + 3, insn & 0xff, 1);
number_to_chars_bigendian (f + 4, extension & 0xff, 1);
}
else if (opcode->format == FMT_S4)
{
/* This must be a format S4 "jmp" instruction. */
unsigned long temp = ((insn & 0xffffff) << 8) | (extension & 0xff);
number_to_chars_bigendian (f, (insn >> 24) & 0xff, 1);
number_to_chars_littleendian (f + 1, temp, 4);
}
else if (opcode->format == FMT_S6)
{
unsigned long temp = ((insn & 0xffffff) << 8)
| ((extension >> 16) & 0xff);
number_to_chars_bigendian (f, (insn >> 24) & 0xff, 1);
number_to_chars_littleendian (f + 1, temp, 4);
number_to_chars_bigendian (f + 5, (extension >> 8) & 0xff, 1);
number_to_chars_bigendian (f + 6, extension & 0xff, 1);
}
else if (opcode->format == FMT_D2
&& opcode->opcode != 0xfaf80000
&& opcode->opcode != 0xfaf00000
&& opcode->opcode != 0xfaf40000)
{
/* A format D2 instruction where the 16bit immediate is
really a single 16bit value, not two 8bit values. */
number_to_chars_bigendian (f, (insn >> 16) & 0xffff, 2);
number_to_chars_littleendian (f + 2, insn & 0xffff, 2);
}
else if (opcode->format == FMT_D2)
{
/* A format D2 instruction where the 16bit immediate
is really two 8bit immediates. */
number_to_chars_bigendian (f, insn, 4);
}
else if (opcode->format == FMT_D3)
{
number_to_chars_bigendian (f, (insn >> 16) & 0xffff, 2);
number_to_chars_littleendian (f + 2, insn & 0xffff, 2);
number_to_chars_bigendian (f + 4, extension & 0xff, 1);
}
else if (opcode->format == FMT_D4)
{
unsigned long temp = ((insn & 0xffff) << 16) | (extension & 0xffff);
number_to_chars_bigendian (f, (insn >> 16) & 0xffff, 2);
number_to_chars_littleendian (f + 2, temp, 4);
}
else if (opcode->format == FMT_D5)
{
unsigned long temp = (((insn & 0xffff) << 16)
| ((extension >> 8) & 0xffff));
number_to_chars_bigendian (f, (insn >> 16) & 0xffff, 2);
number_to_chars_littleendian (f + 2, temp, 4);
number_to_chars_bigendian (f + 6, extension & 0xff, 1);
}
else if (opcode->format == FMT_D8)
{
unsigned long temp = ((insn & 0xff) << 16) | (extension & 0xffff);
number_to_chars_bigendian (f, (insn >> 8) & 0xffffff, 3);
number_to_chars_bigendian (f + 3, (temp & 0xff), 1);
number_to_chars_littleendian (f + 4, temp >> 8, 2);
}
else if (opcode->format == FMT_D9)
{
unsigned long temp = ((insn & 0xff) << 24) | (extension & 0xffffff);
number_to_chars_bigendian (f, (insn >> 8) & 0xffffff, 3);
number_to_chars_littleendian (f + 3, temp, 4);
}
/* Create any fixups. */
for (i = 0; i < fc; i++)
{
const struct mn10300_operand *operand;
operand = &mn10300_operands[fixups[i].opindex];
if (fixups[i].reloc != BFD_RELOC_UNUSED
&& fixups[i].reloc != BFD_RELOC_32_GOT_PCREL
&& fixups[i].reloc != BFD_RELOC_32_GOTOFF
&& fixups[i].reloc != BFD_RELOC_32_PLT_PCREL
&& fixups[i].reloc != BFD_RELOC_MN10300_GOT32)
{
reloc_howto_type *reloc_howto;
int size;
int offset;
fixS *fixP;
reloc_howto = bfd_reloc_type_lookup (stdoutput,
fixups[i].reloc);
if (!reloc_howto)
abort ();
size = bfd_get_reloc_size (reloc_howto);
if (size < 1 || size > 4)
abort ();
offset = 4 - size;
fixP = fix_new_exp (frag_now, f - frag_now->fr_literal + offset,
size, &fixups[i].exp,
reloc_howto->pc_relative,
fixups[i].reloc);
}
else
{
int reloc, pcrel, reloc_size, offset;
fixS *fixP;
reloc = BFD_RELOC_NONE;
if (fixups[i].reloc != BFD_RELOC_UNUSED)
reloc = fixups[i].reloc;
/* How big is the reloc? Remember SPLIT relocs are
implicitly 32bits. */
if ((operand->flags & MN10300_OPERAND_SPLIT) != 0)
reloc_size = 32;
else if ((operand->flags & MN10300_OPERAND_24BIT) != 0)
reloc_size = 24;
else
reloc_size = operand->bits;
/* Is the reloc pc-relative? */
pcrel = (operand->flags & MN10300_OPERAND_PCREL) != 0;
if (reloc != BFD_RELOC_NONE)
pcrel = bfd_reloc_type_lookup (stdoutput, reloc)->pc_relative;
offset = size - (reloc_size + operand->shift) / 8;
/* Choose a proper BFD relocation type. */
if (reloc != BFD_RELOC_NONE)
;
else if (pcrel)
{
if (reloc_size == 32)
reloc = BFD_RELOC_32_PCREL;
else if (reloc_size == 16)
reloc = BFD_RELOC_16_PCREL;
else if (reloc_size == 8)
reloc = BFD_RELOC_8_PCREL;
else
abort ();
}
else
{
if (reloc_size == 32)
reloc = BFD_RELOC_32;
else if (reloc_size == 16)
reloc = BFD_RELOC_16;
else if (reloc_size == 8)
reloc = BFD_RELOC_8;
else
abort ();
}
/* Convert the size of the reloc into what fix_new_exp wants. */
reloc_size = reloc_size / 8;
if (reloc_size == 8)
reloc_size = 0;
else if (reloc_size == 16)
reloc_size = 1;
else if (reloc_size == 32)
reloc_size = 2;
fixP = fix_new_exp (frag_now, f - frag_now->fr_literal + offset,
reloc_size, &fixups[i].exp, pcrel,
((bfd_reloc_code_real_type) reloc));
if (pcrel)
fixP->fx_offset += offset;
}
}
dwarf2_emit_insn (size);
}
}
/* If while processing a fixup, a reloc really needs to be created
then it is done here. */
arelent *
tc_gen_reloc (seg, fixp)
asection *seg ATTRIBUTE_UNUSED;
fixS *fixp;
{
arelent *reloc;
reloc = (arelent *) xmalloc (sizeof (arelent));
reloc->howto = bfd_reloc_type_lookup (stdoutput, fixp->fx_r_type);
if (reloc->howto == (reloc_howto_type *) NULL)
{
as_bad_where (fixp->fx_file, fixp->fx_line,
_("reloc %d not supported by object file format"),
(int) fixp->fx_r_type);
return NULL;
}
reloc->address = fixp->fx_frag->fr_address + fixp->fx_where;
if (fixp->fx_subsy
&& S_GET_SEGMENT (fixp->fx_subsy) == absolute_section)
{
fixp->fx_offset -= S_GET_VALUE (fixp->fx_subsy);
fixp->fx_subsy = 0;
}
if (fixp->fx_addsy && fixp->fx_subsy)
{
reloc->sym_ptr_ptr = NULL;
/* If we got a difference between two symbols, and the
subtracted symbol is in the current section, use a
PC-relative relocation. If both symbols are in the same
section, the difference would have already been simplified
to a constant. */
if (S_GET_SEGMENT (fixp->fx_subsy) == seg)
{
reloc->sym_ptr_ptr = (asymbol **) xmalloc (sizeof (asymbol *));
*reloc->sym_ptr_ptr = symbol_get_bfdsym (fixp->fx_addsy);
reloc->addend = (reloc->address - S_GET_VALUE (fixp->fx_subsy)
+ fixp->fx_offset);
switch (fixp->fx_r_type)
{
case BFD_RELOC_8:
reloc->howto = bfd_reloc_type_lookup (stdoutput,
BFD_RELOC_8_PCREL);
return reloc;
case BFD_RELOC_16:
reloc->howto = bfd_reloc_type_lookup (stdoutput,
BFD_RELOC_16_PCREL);
return reloc;
case BFD_RELOC_24:
reloc->howto = bfd_reloc_type_lookup (stdoutput,
BFD_RELOC_24_PCREL);
return reloc;
case BFD_RELOC_32:
reloc->howto = bfd_reloc_type_lookup (stdoutput,
BFD_RELOC_32_PCREL);
return reloc;
default:
/* Try to compute the absolute value below. */
break;
}
}
if ((S_GET_SEGMENT (fixp->fx_addsy) != S_GET_SEGMENT (fixp->fx_subsy))
|| S_GET_SEGMENT (fixp->fx_addsy) == undefined_section)
{
as_bad_where (fixp->fx_file, fixp->fx_line,
"Difference of symbols in different sections is not supported");
}
else
{
char *fixpos = fixp->fx_where + fixp->fx_frag->fr_literal;
reloc->addend = (S_GET_VALUE (fixp->fx_addsy)
- S_GET_VALUE (fixp->fx_subsy) + fixp->fx_offset);
switch (fixp->fx_r_type)
{
case BFD_RELOC_8:
md_number_to_chars (fixpos, reloc->addend, 1);
break;
case BFD_RELOC_16:
md_number_to_chars (fixpos, reloc->addend, 2);
break;
case BFD_RELOC_24:
md_number_to_chars (fixpos, reloc->addend, 3);
break;
case BFD_RELOC_32:
md_number_to_chars (fixpos, reloc->addend, 4);
break;
default:
reloc->sym_ptr_ptr = (asymbol **) &bfd_abs_symbol;
return reloc;
}
}
if (reloc->sym_ptr_ptr)
free (reloc->sym_ptr_ptr);
free (reloc);
return NULL;
}
else
{
reloc->sym_ptr_ptr = (asymbol **) xmalloc (sizeof (asymbol *));
*reloc->sym_ptr_ptr = symbol_get_bfdsym (fixp->fx_addsy);
reloc->addend = fixp->fx_offset;
}
return reloc;
}
int
md_estimate_size_before_relax (fragp, seg)
fragS *fragp;
asection *seg;
{
if (fragp->fr_subtype == 6
&& (!S_IS_DEFINED (fragp->fr_symbol)
|| seg != S_GET_SEGMENT (fragp->fr_symbol)))
fragp->fr_subtype = 7;
else if (fragp->fr_subtype == 8
&& (!S_IS_DEFINED (fragp->fr_symbol)
|| seg != S_GET_SEGMENT (fragp->fr_symbol)))
fragp->fr_subtype = 9;
else if (fragp->fr_subtype == 10
&& (!S_IS_DEFINED (fragp->fr_symbol)
|| seg != S_GET_SEGMENT (fragp->fr_symbol)))
fragp->fr_subtype = 12;
if (fragp->fr_subtype == 13)
return 3;
if (fragp->fr_subtype >= sizeof (md_relax_table) / sizeof (md_relax_table[0]))
abort ();
return md_relax_table[fragp->fr_subtype].rlx_length;
}
long
md_pcrel_from (fixp)
fixS *fixp;
{
if (fixp->fx_addsy != (symbolS *) NULL && !S_IS_DEFINED (fixp->fx_addsy))
{
/* The symbol is undefined. Let the linker figure it out. */
return 0;
}
return fixp->fx_frag->fr_address + fixp->fx_where;
}
void
md_apply_fix3 (fixP, valP, seg)
fixS * fixP;
valueT * valP;
segT seg;
{
char * fixpos = fixP->fx_where + fixP->fx_frag->fr_literal;
int size = 0;
int value = (int) * valP;
assert (fixP->fx_r_type < BFD_RELOC_UNUSED);
/* This should never happen. */
if (seg->flags & SEC_ALLOC)
abort ();
/* The value we are passed in *valuep includes the symbol values.
Since we are using BFD_ASSEMBLER, if we are doing this relocation
the code in write.c is going to call bfd_install_relocation, which
is also going to use the symbol value. That means that if the
reloc is fully resolved we want to use *valuep since
bfd_install_relocation is not being used.
However, if the reloc is not fully resolved we do not want to use
*valuep, and must use fx_offset instead. However, if the reloc
is PC relative, we do want to use *valuep since it includes the
result of md_pcrel_from. */
if (fixP->fx_addsy != (symbolS *) NULL && ! fixP->fx_pcrel)
value = fixP->fx_offset;
/* If the fix is relative to a symbol which is not defined, or not
in the same segment as the fix, we cannot resolve it here. */
if (fixP->fx_addsy != NULL
&& (! S_IS_DEFINED (fixP->fx_addsy)
|| (S_GET_SEGMENT (fixP->fx_addsy) != seg)))
{
fixP->fx_done = 0;
return;
}
switch (fixP->fx_r_type)
{
case BFD_RELOC_8:
case BFD_RELOC_8_PCREL:
size = 1;
break;
case BFD_RELOC_16:
case BFD_RELOC_16_PCREL:
size = 2;
break;
case BFD_RELOC_32:
case BFD_RELOC_32_PCREL:
size = 4;
break;
case BFD_RELOC_VTABLE_INHERIT:
case BFD_RELOC_VTABLE_ENTRY:
fixP->fx_done = 0;
return;
case BFD_RELOC_NONE:
default:
as_bad_where (fixP->fx_file, fixP->fx_line,
_("Bad relocation fixup type (%d)"), fixP->fx_r_type);
}
md_number_to_chars (fixpos, value, size);
/* If a symbol remains, pass the fixup, as a reloc, onto the linker. */
if (fixP->fx_addsy == NULL)
fixP->fx_done = 1;
}
/* Return zero if the fixup in fixp should be left alone and not
adjusted. */
bfd_boolean
mn10300_fix_adjustable (fixp)
struct fix *fixp;
{
if (! TC_RELOC_RTSYM_LOC_FIXUP (fixp))
return 0;
if (fixp->fx_r_type == BFD_RELOC_VTABLE_INHERIT
|| fixp->fx_r_type == BFD_RELOC_VTABLE_ENTRY)
return 0;
/* Do not adjust relocations involving symbols in code sections,
because it breaks linker relaxations. This could be fixed in the
linker, but this fix is simpler, and it pretty much only affects
object size a little bit. */
if (S_GET_SEGMENT (fixp->fx_addsy)->flags & SEC_CODE)
return 0;
return 1;
}
/* Insert an operand value into an instruction. */
static void
mn10300_insert_operand (insnp, extensionp, operand, val, file, line, shift)
unsigned long *insnp;
unsigned long *extensionp;
const struct mn10300_operand *operand;
offsetT val;
char *file;
unsigned int line;
unsigned int shift;
{
/* No need to check 32bit operands for a bit. Note that
MN10300_OPERAND_SPLIT is an implicit 32bit operand. */
if (operand->bits != 32
&& (operand->flags & MN10300_OPERAND_SPLIT) == 0)
{
long min, max;
offsetT test;
int bits;
bits = operand->bits;
if (operand->flags & MN10300_OPERAND_24BIT)
bits = 24;
if ((operand->flags & MN10300_OPERAND_SIGNED) != 0)
{
max = (1 << (bits - 1)) - 1;
min = - (1 << (bits - 1));
}
else
{
max = (1 << bits) - 1;
min = 0;
}
test = val;
if (test < (offsetT) min || test > (offsetT) max)
{
const char *err =
_("operand out of range (%s not between %ld and %ld)");
char buf[100];
sprint_value (buf, test);
if (file == (char *) NULL)
as_warn (err, buf, min, max);
else
as_warn_where (file, line, err, buf, min, max);
}
}
if ((operand->flags & MN10300_OPERAND_SPLIT) != 0)
{
*insnp |= (val >> (32 - operand->bits)) & ((1 << operand->bits) - 1);
*extensionp |= ((val & ((1 << (32 - operand->bits)) - 1))
<< operand->shift);
}
else if ((operand->flags & MN10300_OPERAND_24BIT) != 0)
{
*insnp |= (val >> (24 - operand->bits)) & ((1 << operand->bits) - 1);
*extensionp |= ((val & ((1 << (24 - operand->bits)) - 1))
<< operand->shift);
}
else if ((operand->flags & (MN10300_OPERAND_FSREG | MN10300_OPERAND_FDREG)))
{
/* See devo/opcodes/m10300-opc.c just before #define FSM0 for an
explanation of these variables. Note that FMT-implied shifts
are not taken into account for FP registers. */
unsigned long mask_low, mask_high;
int shl_low, shr_high, shl_high;
switch (operand->bits)
{
case 5:
/* Handle regular FP registers. */
if (operand->shift >= 0)
{
/* This is an `m' register. */
shl_low = operand->shift;
shl_high = 8 + (8 & shl_low) + (shl_low & 4) / 4;
}
else
{
/* This is an `n' register. */
shl_low = -operand->shift;
shl_high = shl_low / 4;
}
mask_low = 0x0f;
mask_high = 0x10;
shr_high = 4;
break;
case 3:
/* Handle accumulators. */
shl_low = -operand->shift;
shl_high = 0;
mask_low = 0x03;
mask_high = 0x04;
shr_high = 2;
break;
default:
abort ();
}
*insnp |= ((((val & mask_high) >> shr_high) << shl_high)
| ((val & mask_low) << shl_low));
}
else if ((operand->flags & MN10300_OPERAND_EXTENDED) == 0)
{
*insnp |= (((long) val & ((1 << operand->bits) - 1))
<< (operand->shift + shift));
if ((operand->flags & MN10300_OPERAND_REPEATED) != 0)
*insnp |= (((long) val & ((1 << operand->bits) - 1))
<< (operand->shift + shift + operand->bits));
}
else
{
*extensionp |= (((long) val & ((1 << operand->bits) - 1))
<< (operand->shift + shift));
if ((operand->flags & MN10300_OPERAND_REPEATED) != 0)
*extensionp |= (((long) val & ((1 << operand->bits) - 1))
<< (operand->shift + shift + operand->bits));
}
}
static unsigned long
check_operand (insn, operand, val)
unsigned long insn ATTRIBUTE_UNUSED;
const struct mn10300_operand *operand;
offsetT val;
{
/* No need to check 32bit operands for a bit. Note that
MN10300_OPERAND_SPLIT is an implicit 32bit operand. */
if (operand->bits != 32
&& (operand->flags & MN10300_OPERAND_SPLIT) == 0)
{
long min, max;
offsetT test;
int bits;
bits = operand->bits;
if (operand->flags & MN10300_OPERAND_24BIT)
bits = 24;
if ((operand->flags & MN10300_OPERAND_SIGNED) != 0)
{
max = (1 << (bits - 1)) - 1;
min = - (1 << (bits - 1));
}
else
{
max = (1 << bits) - 1;
min = 0;
}
test = val;
if (test < (offsetT) min || test > (offsetT) max)
return 0;
else
return 1;
}
return 1;
}
static void
set_arch_mach (mach)
int mach;
{
if (!bfd_set_arch_mach (stdoutput, bfd_arch_mn10300, mach))
as_warn (_("could not set architecture and machine"));
current_machine = mach;
}
static inline char * mn10300_end_of_match PARAMS ((char *, char *));
static inline char *
mn10300_end_of_match (cont, what)
char *cont, *what;
{
int len = strlen (what);
if (strncmp (cont, what, strlen (what)) == 0
&& ! is_part_of_name (cont[len]))
return cont + len;
return NULL;
}
int
mn10300_parse_name (name, exprP, nextcharP)
char const *name;
expressionS *exprP;
char *nextcharP;
{
char *next = input_line_pointer;
char *next_end;
int reloc_type;
segT segment;
exprP->X_op_symbol = NULL;
if (strcmp (name, GLOBAL_OFFSET_TABLE_NAME) == 0)
{
if (! GOT_symbol)
GOT_symbol = symbol_find_or_make (name);
exprP->X_add_symbol = GOT_symbol;
no_suffix:
/* If we have an absolute symbol or a reg,
then we know its value now. */
segment = S_GET_SEGMENT (exprP->X_add_symbol);
if (segment == absolute_section)
{
exprP->X_op = O_constant;
exprP->X_add_number = S_GET_VALUE (exprP->X_add_symbol);
exprP->X_add_symbol = NULL;
}
else if (segment == reg_section)
{
exprP->X_op = O_register;
exprP->X_add_number = S_GET_VALUE (exprP->X_add_symbol);
exprP->X_add_symbol = NULL;
}
else
{
exprP->X_op = O_symbol;
exprP->X_add_number = 0;
}
return 1;
}
exprP->X_add_symbol = symbol_find_or_make (name);
if (*nextcharP != '@')
goto no_suffix;
else if ((next_end = mn10300_end_of_match (next + 1, "GOTOFF")))
reloc_type = BFD_RELOC_32_GOTOFF;
else if ((next_end = mn10300_end_of_match (next + 1, "GOT")))
reloc_type = BFD_RELOC_MN10300_GOT32;
else if ((next_end = mn10300_end_of_match (next + 1, "PLT")))
reloc_type = BFD_RELOC_32_PLT_PCREL;
else
goto no_suffix;
*input_line_pointer = *nextcharP;
input_line_pointer = next_end;
*nextcharP = *input_line_pointer;
*input_line_pointer = '\0';
exprP->X_op = O_PIC_reloc;
exprP->X_add_number = 0;
exprP->X_md = reloc_type;
return 1;
}
```
|
Jeon Sang-seok (born 21 February 1970) is a South Korean weightlifter. He competed at the 1992 Summer Olympics and the 1996 Summer Olympics.
References
1970 births
Living people
South Korean male weightlifters
Olympic weightlifters for South Korea
Weightlifters at the 1992 Summer Olympics
Weightlifters at the 1996 Summer Olympics
Place of birth missing (living people)
Asian Games medalists in weightlifting
Weightlifters at the 1990 Asian Games
Weightlifters at the 1994 Asian Games
Asian Games silver medalists for South Korea
Medalists at the 1990 Asian Games
20th-century South Korean people
21st-century South Korean people
|
The Other Queen is a 2008 historical novel by British author Philippa Gregory which chronicles the long imprisonment in England of Mary, Queen of Scots. The story is told from three points of view: Mary Stuart, Queen of Scots; Elizabeth Talbot, Countess of Shrewsbury, also known as Bess of Hardwick; and George Talbot, the 6th Earl of Shrewsbury.
According to Gregory, "The Other Queen has been a wonderful book to research and write – I have quite transformed my view of Mary Queen of Scots and to research Bess of Hardwick, her rival and gaoler, has been enormously interesting."
Plot
Mary Stuart, cousin to Queen Elizabeth, has fled to England after she has lost the support of the Scots after marrying Bothwell, whom the people believe murdered her second husband, Henry Stuart, Lord Darnley. She has left her son in Scotland in the hands of the Protestants and expects her cousin to restore her to her throne. Secretly, however, Mary recognizes herself as Queen of Scotland (since she was born to it), France (since she married to it), and England (since Elizabeth's paternity and her mother's marriage to her father is questionable). As Mary plots to overthrow Elizabeth, Elizabeth puts her in the custody of George Talbot and his wife, Bess of Hardwicke, in response to Mary's repeated attempts to claim the English throne. Mary is indignant at the captivity, repeatedly stating her royal status, and is upset when she is given some of the reigning queen's gowns to wear, saying that they are "hand-me-downs." She is unafraid of punishment for any reckless or insulting behavior she makes to her cousin, believing that one would never execute a fellow monarch. Most of the novel centers around the first few years of Mary's Stuart's imprisonment, during which time she makes several failed escape attempts and almost immediately begins to seduce the earl. George slowly begins to feel his loyalty to Elizabeth fade, replaced by a strong attachment to the captive queen. This results in marital problems with Bess, who ultimately separates from him.
The last chapter takes place fifteen years after the previous one. It is narrated by Bess, who reveals that Mary has recently been executed for participating in a plot to steal the throne of England. George watched the beheading in tears and was bankrupt from the years of expense to house her. Bess ends the book saying that she is well off, wealthy and prosperous, and that her granddaughter Arbella is an heir to the English throne. (However, this claim was not acknowledged, and Mary's son James I was crowned after Elizabeth's death in 1603.)
Critical reception
AudioFile magazine praised the narrators of the audiobook recording (Dagmara Dominczyk as Mary, Graeme Malcolm as George and Bianca Amato as Bess), writing:
References
External links
2008 British novels
Novels set in Tudor England
Novels by Philippa Gregory
Mary, Queen of Scots
HarperCollins books
|
Hubert Abold (born 13 June 1958) is a retired German professional Grand Prix motorcycle road racer. He won the 80 cc European Championship in 1983. He was runner-up in the 80 cc World Championship, as teammate to Champion Stefan Dörflinger in 1984.
References
External links
Wildeman-Zündapp
German motorcycle racers
125cc World Championship riders
1958 births
Living people
Place of birth missing (living people)
80cc World Championship riders
|
This is a list of the Chairpersons of the College Republican National Committee. This list includes those persons who served as national chairman of College Republican National Committee and its predecessor organizations, including the American Republican College League, and the Associated University Republican Clubs. The Chairperson of the College Republican National Committee is elected at the organization's bi-annual meeting. Unlike the organization's Democratic counterpart, the College Republican National Committee is entirely independent of both the Republican National Committee and the Young Republican National Federation.
Chairpersons of the College Republican National Committee
See also
College Republican National Committee
Republican National Committee
References
External links
Official website
College Republican chairs
Chairpersons
College Republicans chairpersons
College Republicans
|
Annie Elizabeth Helme (1874-1963) was the first female mayor of the City of Lancaster in the United Kingdom (per her appointment in 1932). She was a widow and supporter of peace who took her daughter as her lady mayoress. She insisted on being called Mr Mayor.
Early life
She was born Annie Elizabeth Smith in Bradford on 18 February 1874 into a Liberal family, her father was Isaac Smith, who was Mayor of Bradford in 1883 and 1885. She married Walter C Helme, a physician. They had a house in Queens Square; her brother-in-law was Norval Helme (Lancaster MP).
Suffragist activity
In 1911 Helme helped organize Lancaster Suffrage Society and was its joint secretary. They invited Miss Corbett, a London suffragette, to speak at their monthly meeting. With the war, her attention expanded to include war relief work. She was a committee person and served on the Board of Guardians. She was appointed as Secretary of a Central Committee of Ladies. She became a member of the Education Committee.
Education and council service
She was the first woman to be elected onto Lancaster Borough Council in 1919, winning Castle Ward against a discharged military man. She was already well known. She was the first woman to become an alderman, becoming in 1932 Lancaster's first female mayor.
See also
List of suffragists and suffragettes#United Kingdom
References
People from Lancaster, Lancashire
British suffragists
1874 births
1963 deaths
English feminists
Politicians from Bradford
|
The Irvine New Town Trail is a recreational cycleway and footpath around Irvine, North Ayrshire, Scotland. The route is long.
The trail is used by many dog walkers and cyclists in the area.
The route forms a ring with no specific start and end points. Taken in a clockwise direction from the town's main Rivergate Centre, the trail runs beside the River Irvine through Irvine's Low Green, continues north beside the railway line past the Towns Moor and the Garnock Floods wildlife reserve, then goes along beside the River Garnock towards Kilwinning's Woodwynd and Blacklands area. At this point, it diverges from the Ayrshire Coastal Path, crossing the river along the route of the former Doura colliery branch line of the Ardrossan Railway before following the Lugton Water eastwards through Eglinton Country Park: a very popular area for recreational activities, with historical interest at Eglinton Castle.
The trail rejoins the disused Ardrossan Railway line at Sourlie Wood nature reserve, and follows the old track south through Girdle Toll in a cutting which formerly led to the Perceton colliery. The trail then runs beside the Annick Water, initially southwards through parkland and countryside to the east of Bourtreehill. It follows the river west in parkland between Broomlands and Dreghorn, using the disused Glasgow, Paisley, Kilmarnock and Ayr Railway trackbed past the site of the former Dreghorn railway station, then rejoins the River Irvine riverbank heading north back to the Rivergate shopping mall.
The route forms part of the national cycle network with routes 7 and 73 forming part of the route.
External links
Irvine and Kilwinning New Town Trail (pdf)
Geography of North Ayrshire
Cycling in Scotland
Transport in North Ayrshire
Tourist attractions in North Ayrshire
|
Igbo Etiti is a local government area of Enugu State, Nigeria. Its headquarters are in the town of Ogbede. It has an area of 325 km and a population of 209,248 at the 2006 census. The postal code of the area is 411.
Geography
Igbo Etiti LGA is 325 square kilometers in size and has an average temperature of 27 degrees Celsius. The region has two primary seasons: dry and wet, with total recorded rainfall in the LGA averaging 1900 mm per year. In Igbo Etiti, the average wind speed is 10 km/h.
Economy
Farming is a primary source of income in the Igbo Etiti LGA, with products including as yam, cassava, kolanut, and cocoyam being farmed in great amounts. The LGA hosts a number of marketplaces where a range of goods are bought and sold, indicating that trade is booming in the region. Palm wine tapping, woodwork, and handcraft are other key economic activity in the Igbo Etiti LGA. Igbo Etiti is known for Agriculture
Government
Wards
Aku I
Aku Ii
Aku Iii
Aku Iv
Aku V (idueme)
Diogbe/umunko
Ejuoha/udeme
Ekwegbe I
Ekwegbe Ii
Ikolo/ohebe
Ohaodo I
Ohaodo Ii
Onyohor
Ochima
Idoha
Ozalla I
Ozalla Ii
Ukehe I
Ukehe Ii
Ukehe Iii
Ukehe Iv
Ukehe V
References
Local Government Areas in Enugu State
Local Government Areas in Igboland
|
Skinnskattberget is a mountain of Viken, in southern Norway.
References
Mountains of Viken
|
```python
#!/usr/bin/env python3
#
# This software may be used and distributed according to the terms of the
# pyre-unsafe
import os
from eden.integration.hg.lib.hg_extension_test_base import EdenHgTestCase, hg_test
from eden.integration.lib import hgrepo
@hg_test
# pyre-ignore[13]: T62487924
class NonEdenOperationTest(EdenHgTestCase):
def populate_backing_repo(self, repo: hgrepo.HgRepository) -> None:
repo.write_file("hello.txt", "hola")
def test_hg_clone_non_eden_repo_within_eden_repo(self) -> None:
"""Regression test to ensure that running `hg` commands from an
Eden-backed Hg repo on a non-Eden-backed Hg repo work as expected."""
non_eden_hg_repo = os.path.join(self.tmp_dir, "non-eden-hg-repo")
os.mkdir(non_eden_hg_repo)
# Create the non-Eden Hg repo to clone.
self.hg("init", "--config=format.use-eager-repo=True", cwd=non_eden_hg_repo)
first_file = os.path.join(non_eden_hg_repo, "first.txt")
with open(first_file, "w") as f:
f.write("First file in non-Eden-backed Hg repo.\n")
self.hg(
"commit",
"--config",
"ui.username=Kevin Flynn <lightcyclist@example.com>",
"--config=remotefilelog.reponame=dummy",
"-Am",
"first commit",
cwd=non_eden_hg_repo,
)
self.hg(
"bookmark",
"main",
cwd=non_eden_hg_repo,
)
# Run `hg clone` from the Eden repo.
clone_of_non_eden_hg_repo = os.path.join(self.tmp_dir, "clone-target")
self.hg(
"clone",
f"--config=remotefilelog.cachepath={os.path.join(self.tmp_dir, 'hgcache')}",
non_eden_hg_repo,
clone_of_non_eden_hg_repo,
cwd=self.repo.path,
)
self.hg(
"goto",
"remote/main",
f"--config=remotefilelog.cachepath={os.path.join(self.tmp_dir, 'hgcache')}",
cwd=clone_of_non_eden_hg_repo,
)
dest_first_file = os.path.join(clone_of_non_eden_hg_repo, "first.txt")
with open(dest_first_file, "r") as f:
contents = f.read()
self.assertEqual("First file in non-Eden-backed Hg repo.\n", contents)
```
|
```c
/*
* (C) 2007-22 - ntop.org and contributors
*
* This program is free software; you can redistribute it and/or modify
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
*
* along with this program; if not, see <path_to_url
*
*/
#include <assert.h> // for assert
#include <inttypes.h> // for PRIx64
#include <stdint.h> // for uint8_t
#include <stdio.h> // for printf, fprintf, stderr, stdout, NULL
#include <stdlib.h> // for exit
#include <string.h> // for memcmp
#include "hexdump.h" // for fhexdump
#include "minilzo.h" // for lzo1x_1_compress, lzo1x_decompress, LZO1X_1_ME...
#include "n2n.h" // for N2N_PKT_BUF_SIZE, TRACE_ERROR, traceEvent
/* heap allocation for compression as per lzo example doc */
#define HEAP_ALLOC(var,size) lzo_align_t __LZO_MMODEL var [ ((size) + (sizeof(lzo_align_t) - 1)) / sizeof(lzo_align_t) ]
static HEAP_ALLOC(wrkmem, LZO1X_1_MEM_COMPRESS);
uint8_t PKT_CONTENT[]={
0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15, 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,
0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15, 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,
0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15, 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,
0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15, 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,
0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15, 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,
0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15, 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,
0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15, 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,
0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15, 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,
0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15, 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,
0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15, 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,
0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15, 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,
0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15, 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,
0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15, 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,
0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15, 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,
0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15, 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,
0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15, 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15
};
static void init_compression_for_benchmark (void) {
if(lzo_init() != LZO_E_OK) {
traceEvent(TRACE_ERROR, "LZO compression init error");
exit(1);
}
#ifdef N2N_HAVE_ZSTD
// zstd does not require initialization. if it were required, this would be a good place
#endif
}
static void deinit_compression_for_benchmark (void) {
// lzo1x does not require de-initialization. if it were required, this would be a good place
#ifdef N2N_HAVE_ZSTD
// zstd does not require de-initialization. if it were required, this would be a good place
#endif
}
void test_lzo1x () {
char *test_name = "lzo1x";
uint8_t compression_buffer[N2N_PKT_BUF_SIZE]; // size allows enough of a reserve required for compression
lzo_uint compression_len = sizeof(compression_buffer);
if(lzo1x_1_compress(PKT_CONTENT, sizeof(PKT_CONTENT), compression_buffer, &compression_len, wrkmem) != LZO_E_OK) {
fprintf(stderr, "%s: compression error\n", test_name);
exit(1);
}
assert(compression_len == 47);
printf("%s: output size = 0x%" PRIx64 "\n", test_name, compression_len);
fhexdump(0, compression_buffer, compression_len, stdout);
uint8_t deflation_buffer[N2N_PKT_BUF_SIZE];
lzo_uint deflated_len;
lzo1x_decompress(compression_buffer, compression_len, deflation_buffer, &deflated_len, NULL);
assert(deflated_len == sizeof(PKT_CONTENT));
if(memcmp(PKT_CONTENT, deflation_buffer, deflated_len)!=0) {
fprintf(stderr, "%s: round-trip buffer mismatch\n", test_name);
exit(1);
}
fprintf(stderr, "%s: tested\n", test_name);
printf("\n");
}
void test_zstd () {
char *test_name = "zstd";
#ifdef N2N_HAVE_ZSTD
uint8_t compression_buffer[N2N_PKT_BUF_SIZE]; // size allows enough of a reserve required for compression
lzo_uint compression_len = sizeof(compression_buffer);
compression_len = N2N_PKT_BUF_SIZE;
compression_len = ZSTD_compress(compression_buffer, compression_len, PKT_CONTENT, sizeof(PKT_CONTENT), ZSTD_COMPRESSION_LEVEL);
if(ZSTD_isError(compression_len)) {
fprintf(stderr, "%s: compression error\n", test_name);
exit(1);
}
assert(compression_len == 33);
printf("%s: output size = 0x%" PRIx64 "\n", test_name, compression_len);
fhexdump(0, compression_buffer, compression_len, stdout);
uint8_t deflation_buffer[N2N_PKT_BUF_SIZE];
int64_t deflated_len = sizeof(deflation_buffer);
deflated_len = (int32_t)ZSTD_decompress(deflation_buffer, deflated_len, compression_buffer, compression_len);
if(ZSTD_isError(deflated_len)) {
fprintf(stderr, "%s: decompression error '%s'\n",
test_name, ZSTD_getErrorName(deflated_len));
exit(1);
}
assert(deflated_len == sizeof(PKT_CONTENT));
if(memcmp(PKT_CONTENT, deflation_buffer, deflated_len)!=0) {
fprintf(stderr, "%s: round-trip buffer mismatch\n", test_name);
exit(1);
}
fprintf(stderr, "%s: tested\n", test_name);
#else
// FIXME - output dummy data to the stdout for easy comparison
printf("zstd: output size = 0x21\n");
printf("000: 28 b5 2f fd 60 00 01 bd 00 00 80 00 01 02 03 04 |( / ` |\n");
printf("010: 05 06 07 08 09 0a 0b 0c 0d 0e 0f 01 00 da 47 9d | G |\n");
printf("020: 4b |K|\n");
fprintf(stderr, "%s: not compiled - dummy data output\n", test_name);
#endif
printf("\n");
}
int main (int argc, char * argv[]) {
/* Also for compression (init moved here for ciphers get run before in case of lzo init error) */
init_compression_for_benchmark();
printf("%s: input size = 0x%" PRIx64 "\n", "original", sizeof(PKT_CONTENT));
fhexdump(0, PKT_CONTENT, sizeof(PKT_CONTENT), stdout);
printf("\n");
test_lzo1x();
test_zstd();
deinit_compression_for_benchmark();
return 0;
}
```
|
```python
"""
Get activities for a given user
path_to_url
"""
from office365.graph_client import GraphClient
from tests import test_client_id, test_password, test_tenant, test_username
client = GraphClient.with_username_and_password(
test_tenant, test_client_id, test_username, test_password
)
activities = client.me.activities.get().top(5).execute_query()
for activity in activities:
print(activity)
```
|
Zororo Makamba (17 January 1990 – 23 March 2020) was a Zimbabwean journalist and the son of Irene and James Makamba.
Biography
Makamba posted commentary on Zimbabwean politics and society online under the heading "State of the Nation", and hosted current affairs programs on ZiFM Stereo and M-Net television affiliate Zambezi Magic.
He had myasthenia gravis, a neuroskeletomuscular autoimmune disease, and underwent surgery to remove a thymoma gland tumour in November 2019. He was diagnosed on 21 March 2020 with COVID-19, twelve days after returning from New York City and five days after going to a doctor with a cough and fever. He died in Harare two days later, the first death in the country due to the disease.
See also
COVID-19 pandemic in Zimbabwe
References
1990 births
2020 deaths
Zimbabwean journalists
Place of birth missing
Deaths from the COVID-19 pandemic in Zimbabwe
21st-century journalists
Impact of the COVID-19 pandemic on journalism
Male journalists
|
```javascript
'use strict';
module.exports = function(messageObject) {
if (messageObject && messageObject.user_id)
return {
sender: messageObject.user_id,
text: messageObject.text || '',
originalRequest: messageObject,
type: 'slack-slash-command'
};
if (messageObject && messageObject.user && messageObject.actions)
return {
sender: messageObject.user.id,
text: '',
originalRequest: messageObject,
type: 'slack-message-action',
postback: true
};
if (messageObject && messageObject.user && (messageObject.type === 'dialog_submission' || messageObject.type === 'dialog_cancellation'))
return {
sender: messageObject.user.id,
text: '',
originalRequest: messageObject,
type: messageObject.type === 'dialog_submission' ? 'slack-dialog-confirm' : 'slack-dialog-cancel',
postback: true
};
};
```
|
```xml
<annotation>
<folder>toy_images</folder>
<filename>toy9.jpg</filename>
<path>/home/animesh/Documents/grocery_detection/toy_exptt/toy_images/toy9.jpg</path>
<source>
<database>Unknown</database>
</source>
<size>
<width>500</width>
<height>300</height>
<depth>3</depth>
</size>
<segmented>0</segmented>
<object>
<name>toy</name>
<pose>Unspecified</pose>
<truncated>0</truncated>
<difficult>0</difficult>
<bndbox>
<xmin>296</xmin>
<ymin>58</ymin>
<xmax>453</xmax>
<ymax>258</ymax>
</bndbox>
</object>
</annotation>
```
|
"Don't Be Ridiculous" is the second episode of the third season of the HBO drama television series The Leftovers, and the 22nd overall. The episode was written by showrunners Tom Perrotta and Damon Lindelof and directed by Keith Gordon. It aired in the United States on April 23, 2017.
The episode focuses on Nora Durst as she travels to St. Louis to investigate an unusual proposal as part of her job at the Departure of Sudden Departures' fraud investigation team. It also provides details on Nora's life in the three years since the end of the second season.
The episode became notable for the guest appearance of actor Mark Linn-Baker, former star of the sitcom Perfect Strangers, as a fictional version of himself who lost his co-stars to the Departure. Critics lauded "Don't Be Ridiculous" for its unexpected yet poignant inclusion of Perfect Strangers in its narrative, as well as the episode's script, emotional resonance, and Carrie Coon's central performance.
Plot
Edward, the man living atop the pillar in Jarden's town square, dies of a heart attack in the middle of the night. Nora interviews his wife, Sandy - the same woman from the town's outskirts that paid Matt to beat her son with an oar - given Sandy's spurious claims that Edward departed rather than died. Nora also interviews various witnesses to Edward's apparent disappearance, one of whom mentions seeing Sandy with Matt the morning after Edward's "departure." Nora confronts Matt, who admits that he and Sandy quietly buried Edward to honor her unending devotion to her husband. Nora wants to expose Sandy's deception to the public, but Kevin advises her not to anger the townsfolk in light of the upcoming seventh anniversary of the Departure.
Nora visits the hospital to get her arm cast removed. The doctor notes that Nora was spotted inflicting the injury upon herself with her car door during her initial arrival at the hospital, but Nora evades the question. She receives a phone call from actor Mark Linn-Baker, who claims to be calling on behalf of a "third party" and offers Nora a chance to see her children again. Nora assumes the call to be fraudulent, but Linn-Baker mentions her children by name, and invites her to discuss his proposal at a hotel in St. Louis within the next 24 hours. A curious Nora receives approval from DSD colleague George Brevity to investigate the matter as a fraud case, and hastily packs for her trip.
Linn-Baker meets Nora at the hotel and explains that he represents a group of physicists investigating low-amplitude Denziger radiation (LADR), trace amounts of which were observed at various Departure sites. The scientists have since built a machine that blasts subjects with LADR, supposedly "reuniting" them with those who vanished on October 14. A skeptical Nora believes that Linn-Baker is suicidal, and that without proof of the subjects' departure, the scientists are merely incinerating them. Linn-Baker, who was the only Perfect Strangers series regular not to have departed (and was later found to have faked his own Departure), confides to Nora his torment over the improbability of his survival among his co-stars, and argues that he and the other research subjects are regaining control of their lives.
The next day, Nora takes a detour to Kentucky to check in on Lily, who has since been returned to Christine's custody and does not recognize Nora. Dismayed, Nora visits Erika, who is living contently in a new house by herself in Jarden. Nora reveals to Erika that her self-inflicted arm injury was an attempt to cover up her recently acquired tattoo of the Wu-Tang Clan's logo, which itself is covering up a previous tattoo bearing her children's names. The two bond by jumping on Erika's newly purchased trampoline while listening to the Wu-Tang Clan's music.
While driving into Jarden, Nora is pulled over by Tommy, who simply wants to chat, and he passively informs her he knows of her visit to Christine and Lily. Nora, destabilized by the reminder of having to give Lily away, goes to a print shop and produces a poster-size photo of Edward's exhumed corpse. She places the photo at the center of Edward's shrine in the Jarden town square, infuriating Sandy. Nora returns home and finds Kevin suffocating himself with a plastic bag; he explains he is not suicidal but merely trying to feel pain, and Nora reacts with understanding. Kevin tells Nora he wants to have a child with her, but Nora bursts out laughing in response. Linn-Baker's benefactors call Nora asking her to meet them in Melbourne with $20,000. She agrees, ostensibly to uncover the fraud without intending to enter the machine, and Kevin asks to join her.
In rural Australia, local police chief Kevin Yarborough is confronted by four women on horseback, one of whom introduces herself as Grace Playford. Grace, having read the Book of Kevin and believing Yarborough to be its eponymous police chief, asks Yarborough to join her group. When Yarborough refuses, the women kidnap and drown him, expecting Yarborough to return to life. As the women discover that Yarborough has died, Kevin Sr. emerges from Grace's house to ask what they are doing.
Production
During development of the first season, writer-producer Jacqueline Hoyt proposed that the series incorporate the sitcom Perfect Strangers, of which Lindelof is a fan, into its narrative to help illustrate the real-world impact of the Sudden Departure. This led to an offhand detail in the first season mentioning that the entire cast of the sitcom had vanished, followed by a brief cameo from Perfect Strangers star Mark Linn-Baker in the season 2 premiere "Axis Mundi" where a televised news report reveals that he faked his departure. Linn-Baker had previously auditioned for the role of Nora's supervisor at the Department of Sudden Departures in the first season, but was turned down since the writers had established that the real Linn-Baker exists within the show's universe. Linn-Baker had consented to the series' usage of Perfect Strangers clips and references prior to his own appearance in the show, and instantly agreed to play a fictional version of himself when asked by Lindelof.
Linn-Baker returns for a more prominent guest appearance in "Don't Be Ridiculous", and was offered the part by Lindelof before the episode's script was written. Linn-Baker, a fan of The Leftovers, was "flattered" that he and Perfect Strangers were to play an integral role in the third season, and saw the role as an opportunity for him to play against type as a dramatic character. Lindelof and Perrotta approached Linn-Baker's appearance as a means of conveying Nora's desire to reunite with her children - the episode draws a parallel between Nora and Linn-Baker as the sole survivors of the Departure among those closest to them. Perrotta opined that the scenario lent more credibility to the idea of a machine that can replicate the Departure, stating that the fictional Linn-Baker was "vibrating on a frequency that Nora kind of gets." Lindelof elaborated: "The idea was so ludicrous, we were like, ‘Who should present it to Nora? Maybe the messenger should be as ridiculous as the idea itself?'"
The episode's opening titles make use of "Nothing's Gonna Stop Me Now," the main theme of Perfect Strangers by David Pomeranz, while utilizing the same images from the season 2 opening credits. Critics observed that the episode derives the name "Don't Be Ridiculous" from the catchphrase of Perfect Strangers protagonist Balki Bartokomous, played by Bronson Pinchot.
Regina King makes her sole appearance in the season, and final appearance in the show, as Erika Murphy. Additionally, Annie Q. reprises her role as Christine in a guest role after starring as series regular in the first season.
During the scene between Erika and Nora, the latter reveals a tattoo of the Wu-Tang Clan that she received on her arm to cover up the names of her departed children. Lindelof had tasked writers with coming up with tattoo ideas for the episode, with the winning pitch of a Wu-Tang Clan tattoo coming from writer Tamara Carter. Carter found a parallel between Nora's character development and the philosophy of the Wu-Tang Clan, stating, "To me it represents the most absurd ideology, but also the most progressive when it comes to personal freedom and, also, pain. Nora was just in so much pain, and she carries it like a samurai. You don’t see what’s underneath much. So I was like, wow, if I were her, I would probably connect with the ideology of the Wu-Tang Clan." Carter also conceived of the scene where Nora and Erika jump on the latter's backyard trampoline while listening to the Wu-Tang Clan's debut single "Protect Ya Neck".
Perrotta and Lindelof are credited in the opening titles as "Tha Lonely Donkey Kong" and "Specialist Contagious" respectively, which resulted from the two entering their names into a Wu-Tang Clan name generator.
Reception
Ratings
Upon airing, the episode was watched by 0.776 million viewers with an 18-49 rating of 0.3.
Critical reception
"Don't Be Ridiculous" received widespread acclaim from critics, who particularly praised Coon's performance and expressed pleasant surprise at the role of Perfect Strangers in the episode's plot and themes. On Rotten Tomatoes, the episode has an approval rating of 100% based on 17 reviews, with an average rating of 9.00 out of 10, with the critics' consensus stating, "'Don't Be Ridiculous' cleverly utilizes 1980s sitcom humor to offer a bleak outlook on the fate of The Leftovers characters, led by a stupendous turn from a newly emboldened cast regular."
Matt Fowler of IGN rated the episode a 9.5 out of 10, calling it a "splendidly odd chapter that perfectly showcased The Leftovers unique tone and themes." Fowler praised the episode for placing Nora "back in her fantastically damaged and feisty mode," noting how her character development was increasingly imbued with dramatic tension over the course of the episode, and singled out the "transcendent" scene between Nora and Erika on the trampoline. Joshua Alston of The A.V. Club gave the episode an A−, calling Linn-Baker's appearance "extremely effective" for examining the "real emotion behind what seemed like just an absurd post-Departure headline." Alston felt the episode's script reflected the series' multidimensional exploration of the emotional consequences of the Departure, praising Lindelof and Perrotta for "constantly displaying how much thought and consideration they’ve put into this universe." However, Alston was less enthusiastic about the epilogue set in Australia, remarking, "a story that puts two timelines on a collision course will eventually require spending time with unfamiliar characters or in new terrain, and that always feels like homework."
Alan Sepinwall, writing for Uproxx, exalted the episode for the incorporation of Perfect Strangers in its narrative, stating, "'Don’t Be Ridiculous' did that miraculous thing that The Leftovers somehow makes look routine: it turned this silly little joke about a goofy ’80s sitcom into the devastating emotional core of another incredibly powerful episode." Sepinwall praised Linn-Baker for delivering "a monologue that’s drowning in technobabble as something understandable and incredibly vital and raw," and called Coon's performance "incredible." Emily St. James of Vox also reserved praise for Coon, remarking, "what she does beautifully here is underline how Nora is spiraling, grasping at straws, trying to avoid discussing the hole at the center of her life." Caroline Framke, who co-authored the review, felt the episode underscored the series' ability to "make it plain how searching for something concrete inevitably raises more questions than anyone knows how to answer."
References
External links
"Don't Be Ridiculous" at HBO
2017 American television episodes
Television episodes directed by Keith Gordon
Television episodes written by Damon Lindelof
The Leftovers (TV series) episodes
Television episodes set in Missouri
Television episodes set in Kentucky
Television episodes set in Australia
|
```css
Position elements with `position: sticky`
Clearfix for layouts
Controlling cellpadding and cellspacing in CSS
Vertically-center anything
Equal width table cells
```
|
```kotlin
package com.wix.detox.espresso
import androidx.test.espresso.ViewAction
// Interface for actions that return a result.
interface ViewActionWithResult<R: Any?> : ViewAction {
fun getResult(): R
}
```
|
Antonio Garcia Martinez (born 24 December 1956 in Sevilla) is a Spanish cyclist. He is LC3 type cyclist. He is a chemical engineer. He competed at the 1996 Summer Paralympics, the 2000 Summer Paralympics, the 2004 Summer Paralympics, and the 2008 Summer Paralympics. He finished first in the Combined Road (Pursuit / Time Trial) LC3 race.
References
External links
1956 births
Living people
Spanish male cyclists
Paralympic cyclists for Spain
Paralympic gold medalists for Spain
Paralympic medalists in cycling
Cyclists at the 1992 Summer Paralympics
Cyclists at the 1996 Summer Paralympics
Cyclists at the 2000 Summer Paralympics
Cyclists at the 2004 Summer Paralympics
Cyclists at the 2008 Summer Paralympics
Medalists at the 1992 Summer Paralympics
Medalists at the 2004 Summer Paralympics
Sportspeople from Seville
Cyclists from Andalusia
|
```yaml
image: Visual Studio 2022
version: 1.0.{build}
configuration:
- Release
before_build:
- nuget restore
- dotnet restore
assembly_info:
patch: false
file: AssemblyInfo.cs
assembly_version: '{version}'
assembly_file_version: '{version}'
build:
project: LiteNetLib.sln
test:
assemblies:
- '**\*.Tests.dll'
artifacts:
- path: LiteNetLib/bin/Release/net471
name: LiteNetLib-$(appveyor_build_version)
type: Zip
- path: LiteNetLib/bin/Release/netstandard2.0
name: LiteNetLibStandard-$(appveyor_build_version)
type: Zip
- path: LiteNetLib/bin/Release/netcoreapp3.1
name: LiteNetLibNetCore-$(appveyor_build_version)
type: Zip
```
|
Admiral Nicholas Haddock (1686 – 26 September 1746) was an admiral in the Royal Navy and Commander-in-Chief of Britain's naval forces in the Mediterranean between 1738 and 1742. Despite an active and successful early and middle career, his reputation was tarnished in 1740 when he failed to prevent the Spanish and French fleets from combining to support an invasion of Italy. Amid public outcry he was forced to resign his naval responsibilities and return to England, where he fell into a melancholic state.
Haddock never returned to sea. He held public office as the Member of Parliament for Rochester, but there is no record of him attending parliament or casting a vote. He died at Wrotham Place in Kent, in 1746.
Early life
Haddock was born in 1686, the third and youngest son of Sir Richard Haddock, then Controller of the Navy, and his wife Elizabeth. He joined the Royal Navy at thirteen as a volunteer-per-order and was promoted to midshipman three years later. At around this time he also saw his first active service at sea, being present at the Battle of Vigo Bay off Spain in 1702. Promoted to lieutenant, he served at the relief of Barcelona in 1706. On 6 April 1707 he was promoted to the rank of captain and placed in command of the 42-gun fifth-rate HMS Ludlow Castle.
England was at war with France, and Haddock's orders were to hunt for enemy privateers. On 30 December he brought Ludlow Castle into range with two such vessels, Nightingale and Squirrel, both former English merchantmen captured and refitted by the French. Haddock ordered that Ludlow Castle give chase, and was rewarded with the capture of Nightingale. This vessel, Haddock's first prize ship, was returned to England along with her crew. Haddock was also present at the Battle of Cape Passaro off Sicily in 1718; he was Captain of the 70-gun Grafton, and led the attack.
Later career
In 1723 he purchased the estate of Wrotham Place in Kent. In 1732 he was appointed to command of The Nore. He was Commander-in-Chief in the Mediterranean Fleet from 1738 to 1742. After the outbreak of the War of Austrian Succession, with only 10 ships at his disposal, he was unable to prevent the crossing of two Spanish armies from Barcelona to Italy. In November 1741, a Spanish fleet with 14,000 troops sailed to Orbetello and in mid-December, 52 ships carrying almost 12,800 men successfully crossed towards La Spezia. Only with the arrival of additional ships from Britain in February 1742, he was able to successfully blockaded the Spanish coast and take valuable prizes including two treasure ships, but failed to force the Spanish fleet into an action. He was recalled from the Mediterranean in December 1741 and succeeded first by Richard Lestock and then Thomas Mathews.
He was promoted to the rank of rear admiral in 1734 and promptly took up a political career, obtaining the Admiralty-controlled rotten borough of Rochester in the elections in that year. Although no longer a serving sea officer he continued to progress through seniority, reaching the rank of vice-admiral in 1744 and Admiral of the Blue in 1744. He remained in Parliament as Member for Rochester until his death in 1746.
His estate, comprising Wrotham Place and a fortune in South Sea and East India Company shares, was inherited by his eldest son Nicholas.
References
Further reading
Concise Dictionary of National Biography (1930)
Robert Beatson, A Chronological Register of Both Houses of Parliament (London: Longman, Hurst, Res & Orme, 1807)
The History and Topographical Survey of the County of Kent: Volume 5 (1798)
External links
Portrait of Nicholas Haddock, at the National Maritime Museum
Portrait of Nicholas Haddock, at the National Portrait Gallery
1746 deaths
1686 births
Members of the Parliament of Great Britain for English constituencies
British military personnel of the War of the Spanish Succession
Royal Navy personnel of the War of the Austrian Succession
Royal Navy admirals
British MPs 1734–1741
British MPs 1741–1747
People from Wrotham
British military personnel of the War of the Quadruple Alliance
|
```scss
.cv-badge {
background-color: var(--cv-theme-negative);
border-radius: 11px;
box-sizing: border-box;
color: var(--cv-theme-on-negative);
display: inline-block;
font-family: var(--mdc-typography-caption-font-family);
font-size: var(--mdc-typography-caption-font-size);
font-weight: var(--mdc-typography-caption-font-weight);
line-height: var(--mdc-typography-caption-line-height);
height: 16px;
min-width: 16px;
padding: 0 4px;
position: absolute;
text-align: center;
&.small {
height: 2px;
padding: 2px;
min-width: 2px;
}
&.top-right {
top: -2px;
right: -2px;
}
&.top-left {
top: -2px;
left: -2px;
}
&.bottom-right {
bottom: -2px;
right: -2px;
}
&.bottom-left {
bottom: -2px;
left: -2px;
}
&.isolated {
position: relative;
inset: 0;
}
}
.cv-badge-container {
position: relative;
display: inline-flex;
}
.wrapped-content {
flex-grow: 1;
}
.hidden {
display: none;
}
```
|
```kotlin
/*
* Use of this source code is governed by the Apache 2.0 license that can be found in the license/LICENSE.txt file.
*/
package kotlin
/**
* Creates a Char with the specified [code].
*
* @sample samples.text.Chars.charFromCode
*/
@OptIn(ExperimentalUnsignedTypes::class)
@ExperimentalStdlibApi
@SinceKotlin("1.4")
@kotlin.internal.InlineOnly
public actual inline fun Char(code: UShort): Char {
return code.toInt().toChar()
}
```
|
The Jam at the BBC is a collection of Jam tracks that were performed in session at the BBC.
Disc 1
Tracks 1 to 4 recorded for John Peel 26 April 1977
Tracks 5 to 8 recorded for John Peel 19 July 1977
Tracks 9 to 18 recorded in concert at the Paris Theatre, London 1 Jun 1978
Disc 2
Tracks 1 to 4 recorded for John Peel 29 October 1979
Tracks 5 to 8 recorded for 'Studio B15' live 25 October 1981
Tracks 9 to 20 performed in concert at the Hippodrome, Golders Green 19 December 1981
Limited edition bonus disc
Recorded in concert at the Rainbow Theatre, London, 4 December 1979
Track listing
Disc one
"In the City"
"Art School"
"I've Changed My Address"
"The Modern World"
"All Around the World"
"London Girl"
"Bricks And Mortar"
"Carnaby Street"
"Billy Hunt"
"In The Street Today"
"The Combine"
"Sounds From The Street"
"Don't Tell Them You're Sane"
"The Modern World"
"'A' Bomb in Wardour Street"
"News of the World"
"Here Comes The Weekend"
"All Around the World"
Disc two
"Thick As Thieves"
"The Eton Rifles"
"Saturday's Kids"
"When You're Young"
"Absolute Beginners"
"Tales From The Riverbank"
"Funeral Pyre"
"Sweet Soul Music"
"The Gift" (Live)
"Down in the Tube Station at Midnight"
"Ghosts"
"Absolute Beginners"
"Tales From The Riverbank"
"Precious"
"Town Called Malice"
"In The Crowd"
"Circus"
"Pretty Green"
"Start!"
"Boy About Town"
Limited edition bonus disc
"Girl on the Phone"
"To Be Someone (Didn't We Have A Nice Time)"
"It's Too Bad"
"Burning Sky"
"Away From The Numbers"
"Smithers-Jones"
"The Modern World"
"Mr. Clean"
"The Butterfly Collector"
"Private Hell"
"Thick As Thieves"
"When You're Young"
"Strange Town"
"The Eton Rifles"
"Down in the Tube Station at Midnight"
"Saturday's Kids"
"All Mod Cons"
"David Watts"
References
The Jam albums
BBC Radio recordings
2002 live albums
2002 compilation albums
|
Ultra Bust-a-Move is a puzzle video game developed by Taito and published by Majesco Entertainment for Xbox in 2004. The game was later ported to PlayStation Portable as in Japan, Bust-a-Move Ghost in the PAL region, and Bust-a-Move Deluxe in North America in 2006.
Reception
Ultra Bust-a-Move and Bust-a-Move Deluxe received "average" reviews according to the review aggregation website Metacritic. In Japan, Famitsu gave both the Xbox and PSP versions each a score of 24 out of 40.
References
Notes
External links
2004 video games
505 Games games
Bubble Bobble
Majesco Entertainment games
Multiplayer and single-player video games
PlayStation Portable games
Puzzle video games
Taito games
Xbox games
Video games developed in Japan
|
```smalltalk
// The .NET Foundation licenses this file to you under the MIT license.
namespace Microsoft.NET.Sdk.Razor.Tool.CommandLineUtils
{
internal class CommandOption
{
public CommandOption(string template, CommandOptionType optionType)
{
Template = template;
OptionType = optionType;
Values = new List<string>();
foreach (var part in Template.Split(new[] { ' ', '|' }, StringSplitOptions.RemoveEmptyEntries))
{
if (part.StartsWith("--", StringComparison.Ordinal))
{
LongName = part.Substring(2);
}
else if (part.StartsWith("-", StringComparison.Ordinal))
{
var optName = part.Substring(1);
// If there is only one char and it is not an English letter, it is a symbol option (e.g. "-?")
if (optName.Length == 1 && !IsEnglishLetter(optName[0]))
{
SymbolName = optName;
}
else
{
ShortName = optName;
}
}
else if (part.StartsWith("<", StringComparison.Ordinal) && part.EndsWith(">", StringComparison.Ordinal))
{
ValueName = part.Substring(1, part.Length - 2);
}
else
{
throw new ArgumentException($"Invalid template pattern '{template}'", nameof(template));
}
}
if (string.IsNullOrEmpty(LongName) && string.IsNullOrEmpty(ShortName) && string.IsNullOrEmpty(SymbolName))
{
throw new ArgumentException($"Invalid template pattern '{template}'", nameof(template));
}
}
public string Template { get; set; }
public string ShortName { get; set; }
public string LongName { get; set; }
public string SymbolName { get; set; }
public string ValueName { get; set; }
public string Description { get; set; }
public List<string> Values { get; private set; }
public CommandOptionType OptionType { get; private set; }
public bool ShowInHelpText { get; set; } = true;
public bool Inherited { get; set; }
public bool TryParse(string value)
{
switch (OptionType)
{
case CommandOptionType.MultipleValue:
Values.Add(value);
break;
case CommandOptionType.SingleValue:
if (Values.Any())
{
return false;
}
Values.Add(value);
break;
case CommandOptionType.NoValue:
if (value != null)
{
return false;
}
// Add a value to indicate that this option was specified
Values.Add("on");
break;
default:
break;
}
return true;
}
public bool HasValue()
{
return Values.Any();
}
public string Value()
{
return HasValue() ? Values[0] : null;
}
private bool IsEnglishLetter(char c)
{
return (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z');
}
}
}
```
|
A Whole Lott More is a feature length documentary film that follows three individuals, TJ, Wanda and Kevin, who each have a different disability and very different attitudes toward work. The film surrounds Lott Industriesa which employs 1200 workers with disabilities. The company has successfully competed for auto industry contracts for decades but with the collapse of the local auto industry in neighboring Detroit, Lott has now struggled to keep its doors open.
Director, Victor Buhler, came to the idea of A Whole Lott More when he was in a nearly fatal car accident that left him unable to walk for 15 months. He began to research what life was like for those with developmental and physical disabilities and came across the story of Lott Industries.
The film premiered at the 2013 Hot Docs Canadian International Documentary Festival.
References
External links
2013 films
American documentary films
2013 documentary films
2010s English-language films
2010s American films
Films about disability in the United States
|
Ilya Matveyevich Konkov (; 1872 – 16 October 1920) was a Russian stage actor better known under his stage name Uralov (Уралов).
Biography
Born in Orsk to the family of Orenburg Cossacks, Konkov spent his youth travelling all over Russia, undertaking menial jobs. While in Ashkhabad, in late 1890s he joined a visiting Ukrainian theatre troupe. In 1904 he was invited to the Komissarzhevskaya Theatre in Saint Petersburg where he made himself a name in plays by Maxim Gorky, in particular, Summerfolk (as Dvoyetochiye, 1904) and Children of the Sun (Chepurnoy, 1905).
In 1907 Ilya Uralov (as he was now known) joined the Moscow Art Theatre where his premiere parts included Varlaam (in Alexander Pushkin's Boris Godunov, 1907), Someone in Grey (The Life of Man, 1907), the Mayor (Revizor, 1908), Bolshintsov (A Month in the Country, Ivan Turgenev, 1909) and Grigory (The Karamazov Brothers, after Dostoyevsky's novel, 1910). In 1911 Uralov left the theatre to join Alexandrinka; Stanislavsky later called MAT's decision to let him go a 'regrettable mistake'.
During his eight years stint with the Alexanrinsky Theatre (which he in 1918 became one of the administrators of), Uralov has made his mark with his "juicy, fulsome realism"; his acclaimed work included Peter the Great (The Assembly by Pyotr Gnedich), Dikoy (The Storm by Alexander Ostrovsky), Varavvin (The Case and Rasplyuyev's Merry Days by Aleksandr Sukhovo-Kobylin), Knurov (Without a Dowry by Ostrovsky), Bessemenov (The Philistines by Gorky), and Skotinin (The Minor by Denis Fonvizin).
Ilya Uralov died in 1920 in Novhorod-Siverskyi, Chernihiv, Ukraine (then Soviet Russia). The Soviet actor Yakov Malyutin left a memoir on Uralov in a book called The Actors of My Generation.
References
Moscow Art Theatre
Male actors from the Russian Empire
People from Orsk
1872 births
1920 deaths
|
Banban Bridge is a highway bridge in Central Luzon, Philippines which is part of the MacArthur Highway (N2).
The bridge was constructed from 1996 to 1998 as part of the rehabilitation efforts on National Highway 3 following the 1991 eruption of Mount Pinatubo. It is one of the longest basket handle Nielsen-Lohse bridges in the world spanning a long and is one of the first of its kind in the Philippines.
References
Buildings and structures in Tarlac
Through arch bridges in the Philippines
|
Princes Park is a sports ground in Auburn, Sydney, New South Wales, Australia. It was the home of the New South Wales Gaelic football and hurling teams. The ground has an undefined capacity with four temporary stands acting as makeshift seating with plenty of standing room available around the pitches four sides. Gaelic football, hurling and camogie were played in league and championship format there between the months of March and September.
On Sunday 2 November 2008 an Australasian gaelic football Select IX played the Irish International Rules football squad
in a game of gaelic football at Princes Park. The game finished in a draw.
It has since 2011 been used as an amateur football pitch.
See also
List of GAA Stadiums by Capacity
Stadiums of Ireland
References
External links
GAA New South Wales Website
Gaelic Football & Hurling Association of Australasia Website
Cumberland Council Website
Austadiums.com - Australian Stadiums
Sports venues in Sydney
|
The Atlanta Transit Company (ATC) was a public transport operator based in Atlanta, Georgia, which existed from 1950 to 1972. It was the immediate predecessor of the Metropolitan Atlanta Rapid Transit Authority (MARTA).
History
Since the 1920s, the Georgia Railway and Power Company (now Georgia Power, a part of Southern Company), had been losing money on transit. It commissioned a study from Beeler in 1926, but the suggestions were not enough to help. In the late-1940s most years saw double-digit percentage losses of ridership: from 125 million in 1946 down to 100 million in 1948 and finally 86 million in 1949.
In April 1949, Georgia Power ran the last streetcar on Atlanta's original network, and in May of the next year its drivers went on strike. During the five-week-long work stoppage, Georgia Power sought for a buyer for its increasingly troubled transit business. In response to this, Atlanta businessmen Clement Evans, Granger Hansell and Inman Brandon, along with Leland Anderson of Columbus, Georgia, formed the ATC and purchased the transportation properties on June 23, 1950, just over a month into the strike. More than 1,300 employees signed on to the new company and ended their strike. Anderson became the president of the ATC, and in September 1950 a Georgia Power vice president, Jackson Dick, joined to become the chairman of the board.
The system consisted of the trolleybus (trackless trolley) system as well as regular (diesel) transit buses. The former was phased out in 1963, allowing the city to remove its overhead wires. The city's drivers and mechanics were part of Amalgamated Street Car Union Local 732. One of the company's promotional drives was called Orchids for Operators, in which customers could nominate a helpful or courteous employee for that honor.
In 1965, the newly formed MARTA began plans for a new rapid transit system. By 1972, when planning was mostly finished, Fulton and DeKalb counties had signed on to the new rail system. As a result, MARTA purchased ATC for US$13 million, making it the sole mass transit entity in the area.
See also
Streetcars in Atlanta
Trolleybuses in Atlanta
References
Forty Years on the Force (1972), Herbert Jenkins
History of the Georgia Power Company 1855-1956 (1957), Wade H. Wright, Foote and Davies
Mule to MARTA vol 2 (1976), Jean Martin, Atlanta Historical Society
History of Atlanta
Defunct public transport operators in the United States
Companies based in Atlanta
Defunct companies based in Georgia (U.S. state)
|
```ruby
# frozen_string_literal: true
require "cmd/uninstall"
require "cmd/shared_examples/args_parse"
RSpec.describe Homebrew::Cmd::UninstallCmd do
it_behaves_like "parseable arguments"
it "uninstalls a given Formula", :integration_test do
install_test_formula "testball"
expect { brew "uninstall", "--force", "testball" }
.to output(/Uninstalling testball/).to_stdout
.and not_to_output.to_stderr
.and be_a_success
end
end
```
|
```go
/*
path_to_url
Unless required by applicable law or agreed to in writing, software
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
// Code generated by client-gen. DO NOT EDIT.
package fake
import (
"context"
json "encoding/json"
"fmt"
v1 "k8s.io/api/core/v1"
metav1 "k8s.io/apimachinery/pkg/apis/meta/v1"
labels "k8s.io/apimachinery/pkg/labels"
types "k8s.io/apimachinery/pkg/types"
watch "k8s.io/apimachinery/pkg/watch"
corev1 "k8s.io/client-go/applyconfigurations/core/v1"
testing "k8s.io/client-go/testing"
)
// FakeSecrets implements SecretInterface
type FakeSecrets struct {
Fake *FakeCoreV1
ns string
}
var secretsResource = v1.SchemeGroupVersion.WithResource("secrets")
var secretsKind = v1.SchemeGroupVersion.WithKind("Secret")
// Get takes name of the secret, and returns the corresponding secret object, and an error if there is any.
func (c *FakeSecrets) Get(ctx context.Context, name string, options metav1.GetOptions) (result *v1.Secret, err error) {
obj, err := c.Fake.
Invokes(testing.NewGetAction(secretsResource, c.ns, name), &v1.Secret{})
if obj == nil {
return nil, err
}
return obj.(*v1.Secret), err
}
// List takes label and field selectors, and returns the list of Secrets that match those selectors.
func (c *FakeSecrets) List(ctx context.Context, opts metav1.ListOptions) (result *v1.SecretList, err error) {
obj, err := c.Fake.
Invokes(testing.NewListAction(secretsResource, secretsKind, c.ns, opts), &v1.SecretList{})
if obj == nil {
return nil, err
}
label, _, _ := testing.ExtractFromListOptions(opts)
if label == nil {
label = labels.Everything()
}
list := &v1.SecretList{ListMeta: obj.(*v1.SecretList).ListMeta}
for _, item := range obj.(*v1.SecretList).Items {
if label.Matches(labels.Set(item.Labels)) {
list.Items = append(list.Items, item)
}
}
return list, err
}
// Watch returns a watch.Interface that watches the requested secrets.
func (c *FakeSecrets) Watch(ctx context.Context, opts metav1.ListOptions) (watch.Interface, error) {
return c.Fake.
InvokesWatch(testing.NewWatchAction(secretsResource, c.ns, opts))
}
// Create takes the representation of a secret and creates it. Returns the server's representation of the secret, and an error, if there is any.
func (c *FakeSecrets) Create(ctx context.Context, secret *v1.Secret, opts metav1.CreateOptions) (result *v1.Secret, err error) {
obj, err := c.Fake.
Invokes(testing.NewCreateAction(secretsResource, c.ns, secret), &v1.Secret{})
if obj == nil {
return nil, err
}
return obj.(*v1.Secret), err
}
// Update takes the representation of a secret and updates it. Returns the server's representation of the secret, and an error, if there is any.
func (c *FakeSecrets) Update(ctx context.Context, secret *v1.Secret, opts metav1.UpdateOptions) (result *v1.Secret, err error) {
obj, err := c.Fake.
Invokes(testing.NewUpdateAction(secretsResource, c.ns, secret), &v1.Secret{})
if obj == nil {
return nil, err
}
return obj.(*v1.Secret), err
}
// Delete takes name of the secret and deletes it. Returns an error if one occurs.
func (c *FakeSecrets) Delete(ctx context.Context, name string, opts metav1.DeleteOptions) error {
_, err := c.Fake.
Invokes(testing.NewDeleteActionWithOptions(secretsResource, c.ns, name, opts), &v1.Secret{})
return err
}
// DeleteCollection deletes a collection of objects.
func (c *FakeSecrets) DeleteCollection(ctx context.Context, opts metav1.DeleteOptions, listOpts metav1.ListOptions) error {
action := testing.NewDeleteCollectionAction(secretsResource, c.ns, listOpts)
_, err := c.Fake.Invokes(action, &v1.SecretList{})
return err
}
// Patch applies the patch and returns the patched secret.
func (c *FakeSecrets) Patch(ctx context.Context, name string, pt types.PatchType, data []byte, opts metav1.PatchOptions, subresources ...string) (result *v1.Secret, err error) {
obj, err := c.Fake.
Invokes(testing.NewPatchSubresourceAction(secretsResource, c.ns, name, pt, data, subresources...), &v1.Secret{})
if obj == nil {
return nil, err
}
return obj.(*v1.Secret), err
}
// Apply takes the given apply declarative configuration, applies it and returns the applied secret.
func (c *FakeSecrets) Apply(ctx context.Context, secret *corev1.SecretApplyConfiguration, opts metav1.ApplyOptions) (result *v1.Secret, err error) {
if secret == nil {
return nil, fmt.Errorf("secret provided to Apply must not be nil")
}
data, err := json.Marshal(secret)
if err != nil {
return nil, err
}
name := secret.Name
if name == nil {
return nil, fmt.Errorf("secret.Name must be provided to Apply")
}
obj, err := c.Fake.
Invokes(testing.NewPatchSubresourceAction(secretsResource, c.ns, *name, types.ApplyPatchType, data), &v1.Secret{})
if obj == nil {
return nil, err
}
return obj.(*v1.Secret), err
}
```
|
Adam John Crosthwaite (born 22 September 1984) is an Australian former professional cricketer who played for Victoria, New South Wales and South Australia as a wicket keeper. He was part of Australia's Under-19 World Cup win in 2002.
Due to the emergence of Matthew Wade in the Victorian Side in 2010 Crosthwaite moved to New South Wales. He played for the Adelaide Strikers in the inaugural Twenty20 Big Bash League and moved to play for South Australia. He was member of the 2011–12 Ryobi One-Day Cup winning team for South Australia.
External links
1984 births
Australian cricketers
Living people
Victoria cricketers
Adelaide Strikers cricketers
Cricketers from Melbourne
South Australia cricketers
Wicket-keepers
|
```c
/* Checking memcpy.
This file is part of GCC.
GCC is free software; you can redistribute it and/or modify it under
Software Foundation; either version 2, or (at your option) any later
version.
Free Software Foundation gives you unlimited permission to link the
compiled version of this file into combinations with other programs,
and to distribute those combinations without any restriction coming
do apply in other respects; for example, they cover modification of
the file, and distribution when not linked into a combine
executable.)
GCC is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or
for more details.
along with GCC; see the file COPYING. If not, write to the Free
Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301, USA. */
/* As a special exception, if you link this library with files compiled with
GCC to produce an executable, this does not cause the resulting executable
however invalidate any other reasons why the executable file might be
#include "config.h"
#include <ssp/ssp.h>
#ifdef HAVE_STRING_H
# include <string.h>
#endif
extern void __chk_fail (void) __attribute__((__noreturn__));
void *
__memcpy_chk (void *__restrict__ dest, const void *__restrict__ src,
size_t len, size_t slen)
{
if (len > slen)
__chk_fail ();
return memcpy (dest, src, len);
}
```
|
Carpophilus melanopterus is a species of sap-feeding beetles in the family Nitidulidae. It is found in Central America and North America.
References
Parsons, Carl T. (1943). "A revision of Nearctic Nitidulidae (Coleoptera)". Bulletin of the Museum of Comparative Zoology, vol. 92, no. 3, 121–278.
Price, Michele B., and Daniel K. Young (2006). "An annotated checklist of Wisconsin sap and short-winged flower beetles (Coleoptera: Nitidulidae, Kateretidae)". Insecta Mundi, vol. 20, no. 1-2, 69–84.
Further reading
NCBI Taxonomy Browser, Carpophilus melanopterus
Arnett, R.H. Jr., M. C. Thomas, P. E. Skelley and J. H. Frank. (eds.). (2002). American Beetles, Volume II: Polyphaga: Scarabaeoidea through Curculionoidea. CRC Press LLC, Boca Raton, FL.
Arnett, Ross H. (2000). American Insects: A Handbook of the Insects of America North of Mexico. CRC Press.
Richard E. White. (1983). Peterson Field Guides: Beetles. Houghton Mifflin Company.
Nitidulidae
Beetles described in 1843
|
```less
/*
* Component: Main Header
* ----------------------
*/
.main-header {
position: relative;
max-height: 100px;
z-index: 1030;
//Navbar
.navbar {
.transition(margin-left @transition-speed @transition-fn);
margin-bottom: 0;
margin-left: @sidebar-width;
border: none;
min-height: @navbar-height;
border-radius: 0;
.layout-top-nav & {
margin-left: 0;
}
}
//Navbar search text input
#navbar-search-input.form-control {
background: rgba(255, 255, 255, .2);
border-color: transparent;
&:focus,
&:active {
border-color: rgba(0, 0, 0, .1);
background: rgba(255, 255, 255, .9);
}
&::-moz-placeholder {
color: #ccc;
opacity: 1;
}
&:-ms-input-placeholder {
color: #ccc;
}
&::-webkit-input-placeholder {
color: #ccc;
}
}
//Navbar Right Menu
.navbar-custom-menu,
.navbar-right {
float: right;
@media (max-width: @screen-sm-max) {
a {
color: inherit;
background: transparent;
}
}
}
.navbar-right {
@media (max-width: @screen-header-collapse) {
float: none;
.navbar-collapse & {
margin: 7.5px -15px;
}
> li {
color: inherit;
border: 0;
}
}
}
//Navbar toggle button
.sidebar-toggle {
float: left;
background-color: transparent;
background-image: none;
padding: @navbar-padding-vertical @navbar-padding-horizontal;
//Add the fontawesome bars icon
font-family: fontAwesome;
&:before {
content: "\f0c9";
}
&:hover {
color: #fff;
}
&:focus,
&:active {
background: transparent;
}
}
.sidebar-toggle .icon-bar {
display: none;
}
.btn-navbar {
color: #fff;
float: left;
background-color: transparent;
background-image: none;
padding: @navbar-padding-vertical @navbar-padding-horizontal;
//Add the fontawesome bars icon
font-family: fontAwesome;
&:hover {
color: #fff;
background-color: rgba(0, 0, 0, 0.12);
}
&:focus,
&:active {
background: transparent;
}
}
//Navbar User Menu
.navbar .nav > li.user > a {
> .fa,
> .glyphicon,
> .ion {
margin-right: 5px;
}
}
//Labels in navbar
.navbar .nav > li > a > .label {
position: absolute;
top: 9px;
right: 7px;
text-align: center;
font-size: 9px;
padding: 2px 3px;
line-height: .9;
}
//Logo bar
.logo {
.transition(width @transition-speed @transition-fn);
display: block;
float: left;
height: @navbar-height;
font-size: 20px;
line-height: 50px;
text-align: center;
width: @sidebar-width;
font-family: "Helvetica Neue", Helvetica, Arial, sans-serif;
padding: 0 15px;
font-weight: 300;
overflow: hidden;
//Add support to sidebar mini by allowing the user to create
//2 logo designs. mini and lg
.logo-lg {
//should be visibile when sidebar isn't collapsed
display: block;
}
.logo-mini {
display: none;
}
}
//Navbar Brand. Alternative logo with layout-top-nav
.navbar-brand {
color: #fff;
}
}
// Content Header
.content-header {
position: relative;
padding: 15px 15px 0 15px;
// Header Text
> h1 {
margin: 0;
font-size: 24px;
> small {
font-size: 15px;
display: inline-block;
padding-left: 4px;
font-weight: 300;
}
}
> .breadcrumb {
float: right;
background: transparent;
margin-top: 0;
margin-bottom: 0;
font-size: 12px;
padding: 7px 5px;
position: absolute;
top: 15px;
right: 10px;
.border-radius(2px);
> li > a {
color: #444;
text-decoration: none;
display: inline-block;
> .fa, > .glyphicon, > .ion {
margin-right: 5px;
}
}
> li + li:before {
content: '>\00a0';
}
}
@media (max-width: @screen-sm-max) {
> .breadcrumb {
position: relative;
margin-top: 5px;
top: 0;
right: 0;
float: none;
background: @gray;
padding-left: 10px;
li:before {
color: darken(@gray, 20%);
}
}
}
}
.navbar-toggle {
color: #fff;
border: 0;
margin: 0;
padding: @navbar-padding-vertical @navbar-padding-horizontal;
}
//Control navbar scaffolding on x-small screens
@media (max-width: @screen-sm-max) {
.navbar-custom-menu .navbar-nav > li {
float: left;
}
//Dont't let links get full width
.navbar-custom-menu .navbar-nav {
margin: 0;
float: left;
}
.navbar-custom-menu .navbar-nav > li > a {
padding-top: 15px;
padding-bottom: 15px;
line-height: 20px;
}
}
// Collapse header
@media (max-width: @screen-header-collapse) {
.main-header {
position: relative;
.logo,
.navbar {
width: 100%;
float: none;
}
.navbar {
margin: 0;
}
.navbar-custom-menu {
float: right;
}
}
}
.navbar-collapse.pull-left {
@media (max-width: @screen-sm-max) {
float: none !important;
+ .navbar-custom-menu {
display: block;
position: absolute;
top: 0;
right: 40px;
}
}
}
.headerElems {
float: right;
display: block;
margin-top: -28px;
position: relative;
}
.headerElems .btn {
padding: 3px 8px;
font-size: 14px;
font-weight: 600;
}
```
|
```html
---
layout: cypress
title: Layout/Hero
---
{% capture content %}
<div class="hero-body">
<p class="title">
Hero title
</p>
<p class="subtitle">
Hero subtitle
</p>
</div>
{% endcapture %}
<section id="hero" class="hero">
{{ content }}
</section>
{% for color in site.data.colors.justColors %}
<section id="hero-{{ color }}" class="hero is-{{ color }}">
{{ content }}
</section>
{% endfor %}
<section id="hero-small" class="hero is-small">
{{ content }}
</section>
<section id="hero-medium" class="hero is-medium">
{{ content }}
</section>
<section id="hero-large" class="hero is-large">
{{ content }}
</section>
<section id="hero-halfheight" class="hero is-halfheight">
{{ content }}
</section>
<section id="hero-fullheight" class="hero is-fullheight">
{{ content }}
</section>
<section id="hero-with-container" class="hero is-halfheight">
<div class="container">
{{ content }}
</div>
</section>
<div id="hero-buttons" class="hero-buttons"></div>
<div id="hero-head" class="hero-head"></div>
<div id="hero-foot" class="hero-foot"></div>
<div id="hero-body" class="hero-body"></div>
```
|
```python
#!/usr/bin/env python3
#
# All rights reserved.
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are met:
# 1. Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
# 2. Redistributions in binary form must reproduce the above copyright
# notice, this list of conditions and the following disclaimer in the
# documentation and/or other materials provided with the distribution.
# 3. Neither the name of the copyright holder nor the
# names of its contributors may be used to endorse or promote products
# derived from this software without specific prior written permission.
#
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
# ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
# LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
# POSSIBILITY OF SUCH DAMAGE.
import wpan
from wpan import verify
# your_sha256_hash-------------------------------------------------------
# Test description: Test MeshCop Joiner, Commissioner and Joiner-router behavior
#
# This test covers Thread commissioning with a commissioner, a joiner-router and
# joiner device.
test_name = __file__[:-3] if __file__.endswith('.py') else __file__
print('-' * 120)
print('Starting \'{}\''.format(test_name))
# your_sha256_hash-------------------------------------------------------
# Creating `wpan.Nodes` instances
speedup = 4
wpan.Node.set_time_speedup_factor(speedup)
r1 = wpan.Node()
r2 = wpan.Node()
c2 = wpan.Node()
joiner = wpan.Node()
# your_sha256_hash-------------------------------------------------------
# Init all nodes
wpan.Node.init_all_nodes()
# your_sha256_hash-------------------------------------------------------
# Build network topology
#
# r1 ---------- r2
# (commissioner) (joiner-router)
# |
# |
# joiner
r1.form('jr-meshcop')
r1.allowlist_node(r2)
r2.join_node(r1, wpan.JOIN_TYPE_ROUTER)
c2.join_node(r2, wpan.JOIN_TYPE_END_DEVICE)
# your_sha256_hash-------------------------------------------------------
# Test implementation
WAIT_TIME = 2 # seconds
verify(r2.get(wpan.WPAN_NODE_TYPE) == wpan.NODE_TYPE_ROUTER)
PSKd = '123456'
joiner_hw_addr = joiner.get(wpan.WPAN_HW_ADDRESS)[1:-1] # Remove the `[]`
# Start the commissioner and add joiner hw address along with PSKd
r1.commissioner_start()
r1.commissioner_add_joiner(joiner_hw_addr, PSKd)
# Start Joiner
joiner.joiner_join(PSKd)
# Verify that Joiner succeeded
verify(joiner.get(wpan.WPAN_STATE) == wpan.STATE_COMMISSIONED)
joiner.joiner_attach()
def joiner_is_associated():
verify(joiner.is_associated())
wpan.verify_within(joiner_is_associated, WAIT_TIME)
# your_sha256_hash-------------------------------------------------------
# Test finished
wpan.Node.finalize_all_nodes()
print('\'{}\' passed.'.format(test_name))
```
|
"Higher and Higher" is the opening track of the Moody Blues 1969 album To Our Children's Children's Children, a concept album about space travel.
The verses of the song are spoken by Mike Pinder, rather than sung. Sound effects of a rocket launching begin the song and last for the first minute.
"Higher and Higher" was also the Moody Blues' first full length song that was written by the band's drummer Graeme Edge. Edge was usually the writer of short spoken-word interludes that appeared at the beginning and end of previous albums. In the recordings, they were usually recited by Mike Pinder.
The album was one of those listened to, on cassette tape, by the crew of Apollo 15 in 1971.
Personnel
Mike Pinder – Mellotron, Hammond Organ, EMS VCS 3, vocals
Justin Hayward – acoustic and electric guitars, backing vocals
John Lodge – bass guitar, backing vocals
Ray Thomas – tambourine, backing vocals
Graeme Edge – drums, percussion
References
External links
1969 songs
The Moody Blues songs
Songs written by Graeme Edge
|
Novo Nevesinje (, ) is a settlement in the region of Baranja, Croatia. Administratively, it is located in the Petlovac municipality within the Osijek-Baranja County. Population is 63 people.
History
Novo Nevesinje has existed as part of the settlement from 1880. Its name was Piskora from 1880–1931. It was formally established as an independent settlement in 1991, when it was separated from the territory of Baranjsko Petrovo Selo.
Population
Ethnic composition, 1991. census
References
Literature
Book: "Narodnosni i vjerski sastav stanovništva Hrvatske, 1880–1991: po naseljima, author: Jakov Gelo, izdavač: Državni zavod za statistiku Republike Hrvatske, 1998., , ;
See also
Osijek-Baranja county
Baranja
Populated places in Osijek-Baranja County
Baranya (region)
1991 establishments in Croatia
Serb communities in Croatia
|
```java
Default values for unassigned data types
Using `enum` in Java
Converting a string to upper or lower case
`StringBuffer` vs `StringBuilder`
Retrieve the component type of an array
```
|
```html
<a href="{ID}" class="thumbnail example-container">
<img src="{ID}-thumbnail.png" alt="Thumbnail" class="img-rounded example-image" loading="lazy">
<div class="caption">
<p class="example-title">{TITLE}</p>
<p class="example-contributor">{CONTRIBUTORS}</p>
</div>
</a>
```
|
This is a list of the queen consorts of the major kingdoms and states that existed in present-day Philippines. Only the senior queens—i.e. those with the rank of Dayang ("Lady") and Lakambini ("Queen")—are listed.
Rankings of consorts
Prior to the Archaic epoch (c. 900–1565), the consorts of the Filipino monarchs were organized in three general tiers: Dayang (), Lakambini (), and Binibini (), or even the word Hara () is a Malayo-Sanskrit terms in which referred to a Queen in western sense, also meant the chief queen of the states and polities which is in the influence of India or Animist states (see also Indianized kingdoms).
The title Sultana or sultanah is an Islamic title and a feminine form of the word Sultan. This term has been legally used for some Muslim women monarchs and sultan's consorts. Nevertheless, westerners have used the title to refer to Muslim women monarchs specially in the southern part of the Philippines, which is in the Islamic influence (like Sulu and Maguindanao), sultan's women relatives who don't hold this title officially.
List of consorts
Legendary consorts
Legendary consorts and their husbands are mentioned in the folktales and oral traditions.
Some of the Queen consorts are claimed to be mythical, but proven to be a historic figure according in the written documents like Queen Urduja for example, she is mentioned historically as the Queen of Caboloan in Chinese accounts, but also mentioned as the Queen of the legendary kingdom of Tawalisi, found in the travel account of Ibn Battuta.
Historical consorts
Caboloan (Pangasinan Wangdom)
Tondo Dynasty
Tondo have a personal union with Namayan through the traditional lineage of Kalangitan and Bagtas.
Namayan
Namayan have a personal union with Tondo through the traditional lineage of Kalangitan and Bagtas. (Legendary antiquity)
Maynila
According to Bruneian oral tradition, a city with the Malay name of Selurong, which would later become the city of Maynila) was formed around the year 1500. According to some of these oral traditions, the Sultanate of Brunei under Sultan Bolkiah attacked the Kingdom of Tondo, and established Selurong.
Rajahnate of Cebu
Kedatuan of Dapitan
Sultanate of Maguindanao
Sultanate of Sulu
See also
First Lady or First Gentleman of the Philippines
Binukot - Filipino cultural practice that secludes a young person (usually a young woman)
History of the Philippines (900–1521)
List of sovereign state leaders in the Philippines
List of recorded Datus in the Philippines
Filipino styles and honorifics
Greater India
References
External links
http://www.philstar.com/nation/196317/pangasinan-government-almost-lost-urduja-house-lot
Hector Santos' A Philippine Document from 900 A.D.
Paul Morrow's THE LAGUNA COPPERPLATE INSCRIPTION
RAJAH HUMABON (Ca. 1521) King of Cebu
Cebu eskrima
The official website of Boholchronicle
15th-century monarchs in Asia
Filipino datus, rajas and sultans
History of the Philippines (900–1565)
Queens consort
Ancient Philippines, List of royal consorts of
|
Shiroko pole is a village in Kardzhali Municipality, Kardzhali Province, southern Bulgaria.
References
Villages in Kardzhali Province
|
A Cure for Suffragettes is a 1913 American silent comedy film. It was written by Anita Loos and directed by Edward Dillon for Biograph Company. It stars Dorothy Bernard, Kathleen Butler, and Dorothy Gish.
Plot
References
External links
A Cure for Suffragettes at the British Film Institute
1913 films
|
Wolfgang Weisbrod-Weber (born in Germany in 1955) was the United Nations Secretary-General's Special Representative and Head of the United Nations Mission for the Referendum in Western Sahara (MINURSO) on 15 June 2012.
Weisbrod-Weber has extensive experience in United Nations peacekeeping operations (Namibia, Iraq, Bosnia-Herzegovina, Timor-Leste, etc). Since 2008, he has been the Director in charge of Asia and the Middle East in the Department of Peacekeeping Operations of the UN.
Weisbrod-Weber was twice the interim head of UNAMA in Afghanistan, in 2009 and 2010.
References
1955 births
Living people
German officials of the United Nations
|
Whitefoot is an electoral ward in the London Borough of Lewisham. It is located south-east of Charing Cross, and is north of Downham, south of Catford, west of Grove Park, and east of Bellingham. It is long east to west following Whitefoot Lane, the local main road, making it about at its longest point. Whitefoot is also on the Prime Meridian.
Part of the South Eastern Main Line railway between Hither Green and Grove Park stations marks the whole eastern border of the ward. The western border is marked partly by some of the Catford Loop Line, between Bellingham and Beckenham Hill stations, and small parts of two A roads, South End Lane (A2218 road) and Bromley Road (A21 road). Although railway lines make much of the wards boundaries, no train stations are located within Whitefoot.
Whitefoot is covered by two postcode districts, covering the south and covering the north; most of their common boundary follows Whitefoot Lane. Hither Green Cemetery is located on the east side of the ward, and Forster Memorial Park in the west.
One of the ward's councillors from 2010 to 2019 was Labour's Janet Daby, who resigned to concentrate on her role as the MP for Lewisham East, which includes Whitefoot in its boundaries. She won the parliamentary seat at a 2018 by-election. In 2006, the Liberal Democrats won all three ward seats. Daby gained one in 2010, before the other two seats were gained by Labour in 2014. , all three seats are held by Labour.
From 2022, Whitefoot will be replaced by the new Catford South, Hither Green and Downham wards.
References
Wards of the London Borough of Lewisham
Grove Park, Lewisham
Hither Green
Downham, London
Catford
|
```java
package com.yahoo.search.schema;
import com.yahoo.container.QrSearchersConfig;
import com.yahoo.search.config.SchemaInfoConfig;
import java.util.ArrayList;
import java.util.List;
/**
* Translation between schema info configuration and schema objects.
*
* @author bratseth
*/
class SchemaInfoConfigurer {
static List<Schema> toSchemas(SchemaInfoConfig schemaInfoConfig) {
return schemaInfoConfig.schema().stream().map(SchemaInfoConfigurer::toSchema).toList();
}
static Schema toSchema(SchemaInfoConfig.Schema schemaInfoConfig) {
Schema.Builder schemaBuilder = new Schema.Builder(schemaInfoConfig.name());
for (var fieldConfig : schemaInfoConfig.field()) {
Field.Builder fieldBuilder = new Field.Builder(fieldConfig.name(), fieldConfig.type());
fieldBuilder.setAttribute(fieldConfig.attribute());
fieldBuilder.setIndex(fieldConfig.index());
for (var alias : fieldConfig.alias())
fieldBuilder.addAlias(alias);
schemaBuilder.add(fieldBuilder.build());
}
for (var profileConfig : schemaInfoConfig.rankprofile()) {
RankProfile.Builder profileBuilder = new RankProfile.Builder(profileConfig.name())
.setHasSummaryFeatures(profileConfig.hasSummaryFeatures())
.setHasRankFeatures(profileConfig.hasRankFeatures())
.setUseSignificanceModel(profileConfig.significance().useModel());
for (var inputConfig : profileConfig.input())
profileBuilder.addInput(inputConfig.name(), RankProfile.InputType.fromSpec(inputConfig.type()));
schemaBuilder.add(profileBuilder.build());
}
for (var summaryConfig : schemaInfoConfig.summaryclass()) {
DocumentSummary.Builder summaryBuilder = new DocumentSummary.Builder(summaryConfig.name());
for (var field : summaryConfig.fields()) {
if (field.dynamic())
summaryBuilder.setDynamic(true);
summaryBuilder.add(new DocumentSummary.Field(field.name(), field.type()));
}
schemaBuilder.add(summaryBuilder.build());
}
return schemaBuilder.build();
}
static List<Cluster> toClusters(QrSearchersConfig config) {
List<Cluster> clusters = new ArrayList<>();
for (var searchCluster : config.searchcluster()) {
String clusterName = searchCluster.name();
var clusterInfo = new Cluster.Builder(clusterName);
clusterInfo.setStreaming(searchCluster.indexingmode() == QrSearchersConfig.Searchcluster.Indexingmode.Enum.STREAMING);
for (var schemaDef : searchCluster.searchdef())
clusterInfo.addSchema(schemaDef);
clusters.add(clusterInfo.build());
}
return clusters;
}
}
```
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.