text stringlengths 1 22.8M |
|---|
```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, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package org.apache.beam.runners.dataflow;
import static org.apache.beam.vendor.guava.v32_1_2_jre.com.google.common.base.MoreObjects.toStringHelper;
import java.util.ArrayDeque;
import org.apache.beam.sdk.Pipeline;
import org.apache.beam.sdk.runners.AppliedPTransform;
import org.apache.beam.sdk.runners.PTransformMatcher;
import org.apache.beam.sdk.runners.TransformHierarchy;
import org.apache.beam.sdk.transforms.Combine;
import org.apache.beam.sdk.transforms.PTransform;
/**
* A set of {@link PTransformMatcher PTransformMatchers} that are used in the Dataflow Runner and
* not general enough to be shared between runners.
*/
@SuppressWarnings({
"nullness" // TODO(path_to_url
})
class DataflowPTransformMatchers {
private DataflowPTransformMatchers() {}
/**
* Matches {@link PTransform}s of class {@link Combine.GroupedValues} that have no side inputs.
*/
static class CombineValuesWithoutSideInputsPTransformMatcher implements PTransformMatcher {
@Override
public boolean matches(AppliedPTransform<?, ?, ?> application) {
return application.getTransform().getClass().equals(Combine.GroupedValues.class)
&& ((Combine.GroupedValues<?, ?, ?>) application.getTransform())
.getSideInputs()
.isEmpty();
}
@Override
public String toString() {
return toStringHelper(CombineValuesWithoutSideInputsPTransformMatcher.class).toString();
}
}
/**
* Matches {@link PTransform}s of class {@link Combine.GroupedValues} that have no side inputs and
* are direct subtransforms of a {@link Combine.PerKey}.
*/
static class CombineValuesWithParentCheckPTransformMatcher implements PTransformMatcher {
@Override
public boolean matches(AppliedPTransform<?, ?, ?> application) {
return application.getTransform().getClass().equals(Combine.GroupedValues.class)
&& ((Combine.GroupedValues<?, ?, ?>) application.getTransform()).getSideInputs().isEmpty()
&& parentIsCombinePerKey(application);
}
private boolean parentIsCombinePerKey(AppliedPTransform<?, ?, ?> application) {
// We want the PipelineVisitor below to change the parent, but the parent must be final to
// be captured in there. To work around this issue, wrap the parent in a one element array.
final TransformHierarchy.Node[] parent = new TransformHierarchy.Node[1];
// Traverse the pipeline to find the parent transform to application. Do this by maintaining
// a stack of each composite transform being entered, and grabbing the top transform of the
// stack once the target node is visited.
Pipeline pipeline = application.getPipeline();
pipeline.traverseTopologically(
new Pipeline.PipelineVisitor.Defaults() {
private ArrayDeque<TransformHierarchy.Node> parents = new ArrayDeque<>();
@Override
public CompositeBehavior enterCompositeTransform(TransformHierarchy.Node node) {
CompositeBehavior behavior = CompositeBehavior.ENTER_TRANSFORM;
// Combine.GroupedValues is a composite transform in the hierarchy, so when entering
// a composite first we check if we found our target node.
if (!node.isRootNode()
&& node.toAppliedPTransform(getPipeline()).equals(application)) {
// If we found the target node grab the node's parent.
if (parents.isEmpty()) {
parent[0] = null;
} else {
parent[0] = parents.peekFirst();
}
behavior = CompositeBehavior.DO_NOT_ENTER_TRANSFORM;
}
// Even if we found the target node we must add it to the list to maintain parity
// with the number of removeFirst calls.
parents.addFirst(node);
return behavior;
}
@Override
public void leaveCompositeTransform(TransformHierarchy.Node node) {
if (!node.isRootNode()) {
parents.removeFirst();
}
}
});
if (parent[0] == null) {
return false;
}
// If the parent transform cannot be converted to an appliedPTransform it's definitely not
// a CombinePerKey.
AppliedPTransform<?, ?, ?> appliedParent;
try {
appliedParent = parent[0].toAppliedPTransform(pipeline);
} catch (NullPointerException e) {
return false;
}
return appliedParent.getTransform().getClass().equals(Combine.PerKey.class);
}
@Override
public String toString() {
return toStringHelper(CombineValuesWithParentCheckPTransformMatcher.class).toString();
}
}
}
``` |
Hindu Samaj of Hamilton & Region is a non-profit, religious organization based in Hamilton, Ontario, Canada, registered with Canada Customs and Revenue Agency. The organization, whose main operation is the Hindu Samaj Temple, has been serving the community in the new city of Hamilton and vicinity (formerly the regional municipality of Hamilton) since 1975.
History
The organization was formed in 1975 and received the charter as a charitable religious organization in February 1976. In 1984, the samaj purchased an old church and began converting it into a temple; Hindu deities were established, the last being in April 1993. The Temple is a centre of worship and focal point for cultural events for Hindus in the Golden Horseshoe area of Southern Ontario. The major Hindu festivals are organised and celebrated at the temple in accordance with Karma Kand of Sanātana Dharma. The temple also invites and hosts Hindu religious and spiritual leaders from around the world, including India.
The temple was the victim of arson on September 15, 2001. The temple was eventually rebuilt by the local community with assistance from government, and bank loans. The arson and subsequent rebuilding attracted national and international sympathy, and was covered by several international news organisations.
The temple was reopened in 2005. To commemorate the event the City of Hamilton recognised the Temple as a site of historic importance and installed a commemorative plaque. As a direct response to the arson, the city developed the Strengthening Hamilton Community Initiative . The Hamilton Centre for Civic Inclusion (HCCI) was set up in 2006 to act as a centralized hub for access to the knowledge and resources needed to build a strong, racially diverse and welcoming city. After years of investigation, on November 27, 2013, Hamilton Police arrested three men in connection with the arson.
Operations
The temple serves as a religious and a cultural centre for the Hindus in the area. A number of religious ceremonies are regularly performed. Major events that are routinely held at the temple or performed by the priests are: Engagement Ceremony, Marriage (priests are licensed to perform marriages in Ontario), Namakaran, Annaprashana, Mundan Sanskar, Havan, Bhumi Puja, Vastu Shanti/Griha Pravesh, Satyanarayan Puja, Navagraha Puja, Mata Ki Chowki.
See also
List of Hinduism-related articles
References
Hindu temples in Canada
Organizations based in Hamilton, Ontario |
```smalltalk
using UnityEngine;
using System.Collections;
using UnityEngine.UI;
using System.Collections.Generic;
public class InputNetworkEventProxy : IInputProxyBase
{
const int c_msgPoolSize = 5; //
const int c_connectMsgPool = 2; //
public static void DispatchStatusEvent(NetworkState status)
{
//
if (IsActive)
{
InitPool();
InputNetworkConnectStatusEvent e = GetConnectMsgEvent(status);
InputManager.Dispatch("InputNetworkConnectStatusEvent",e);
}
}
public static void DispatchMessageEvent(string massageType, Dictionary<string, object> data)
{
//
if (IsActive)
{
InitPool();
InputNetworkMessageEvent e = GetMsgEvent();
e.m_MessgaeType = massageType;
e.Data = data;
InputManager.Dispatch("InputNetworkMessageEvent",e);
}
}
#region
static InputNetworkMessageEvent[] m_msgPool;
static InputNetworkConnectStatusEvent[] m_connectMsgPool;
static int m_connectIndex = 0;
static int m_msgIndex = 0;
static bool isInit = false;
static void InitPool()
{
if (!isInit)
{
isInit = true;
m_connectMsgPool = new InputNetworkConnectStatusEvent[c_connectMsgPool];
for (int i = 0; i < c_connectMsgPool; i++)
{
m_connectMsgPool[i] = new InputNetworkConnectStatusEvent();
}
m_msgPool = new InputNetworkMessageEvent[c_msgPoolSize];
for (int i = 0; i < c_msgPoolSize; i++)
{
m_msgPool[i] = new InputNetworkMessageEvent();
}
}
}
static InputNetworkMessageEvent GetMsgEvent()
{
InputNetworkMessageEvent msg = m_msgPool[m_msgIndex];
msg.Reset();
m_msgIndex++;
if (m_msgIndex >= m_msgPool.Length)
{
m_msgIndex = 0;
}
return msg;
}
static InputNetworkConnectStatusEvent GetConnectMsgEvent(NetworkState status)
{
InputNetworkConnectStatusEvent msg = m_connectMsgPool[m_connectIndex];
msg.Reset();
msg.m_status = status;
m_connectIndex++;
if (m_connectIndex >= m_connectMsgPool.Length)
{
m_connectIndex = 0;
}
return msg;
}
#endregion
}
``` |
NOLF may refer to:
The Operative: No One Lives Forever, a 2000 video game
Naval outlying landing field, a type of U.S. Navy military airfield |
The 1968 Meath Intermediate Football Championship is the 42nd edition of the Meath GAA's premier club Gaelic football tournament for intermediate graded teams in County Meath, Ireland. The tournament consists of 18 teams. The championship starts with a group stage and then progresses to a knock out stage.
No team was regraded from the S.F.C. the previous year.
This year marked United Gaels first year in existence as a result of the amalgamation of Junior 'A' clubs Drumconrath and Meath Hill.
Dunshaughlin and Athboy were promoted after claiming the 1967 Meath Junior Football Championship title and Junior 'A' Divisional runners-up spot respectively. Dunderry were also promoted after their application to be promoted was granted by the County Board.
At the end of the season United Gaels applied to be regraded to the 1969 J.F.C.
On 20 October 1968, Slane claimed their 1st Intermediate championship title when they defeated Bohermeen 1-9 to 1-7 in the final in Pairc Tailteann.
Team changes
The following teams have changed division since the 1967 championship season.
From I.F.C.
Promoted to S.F.C.
Seneschalstown - (Intermediate Champions)
Oldcastle - (Application to be promoted granted by the County Board)
Relegated to 1968 J.A.F.C.
Ballinabrackey
Garryowen
Rathmolyon
To I.F.C.
Regraded from S.F.C.
None
Promoted from 1967 J.A.F.C. & J.B.F.C.
Dunshaughlin - (Junior Champions)
Athboy - (Junior 'A' Divisional Runners-Up)
Dunderry - (Application to be promoted granted by the County Board)
United Gaels - (Amalgamation of Junior clubs Drumconrath and Meath Hill)
Group stage
There are 4 groups called Group A, B, C and D. The top finisher in each group will qualify for the Semi-Finals. Many results were unavailable.
Group A
Round 1:
Dunderry w, l Martry, Athboy, 21/4/1968,
Dunshaughlin w, l Kilallon, Athboy, 21/4/1968,
Bohermeen - Bye,
Round 2:
Martry w, l Kilallon, Athboy, 19/5/1968,
Dunshaughlin w, l Bohermeen, Kilmessan, 19/5/1968,
Dunderry - Bye,
Round 3:
Dunderry w, l Kilallon, Athboy, 2/6/1968,
Bohermeen w, l Martry, Kells, 16/6/1968,
Dunshaughlin - Bye,
Round 4:
Dunderry 3-6, 0-9 Dunshaughlin, Skryne, 16/6/1968,
Bohermeen 1-10, 0-7 Kilallon, Kells, 23/6/1968,
Martry - Bye,
Round 5:
Bohermeen 2-9, 1-6 Dunderry, Pairc Tailteann, 14/7/1968,
Dunshaughlin w/o, scr Martry,
Kilallon - Bye,
Semi-Final Playoff:
Dunshaughlin 0-6, 1-3 Dunderry, Kilmessan, 28/7/1968,
Dunshaughlin 1-9, 2-5 Dunderry, Trim, 7/9/1968,
Bohermeen 2-11, 0-5 Dunshaughlin, Pairc Tailteann, 15/9/1968,
Group B
Round 1:
Syddan w, l Castletown, Kilberry, 21/4/1968,
Slane 1-6, 0-7 Rathkenny, Pairc Tailteann, 21/4/1968,
United Gaels - Bye,
Round 2:
Syddan w, l United Gaels, Castletown, 28/4/1968,
Rathkenny 2-11, 2-7 Castletown, Gibbstown, 5/5/1968,
Slane - Bye,
Round 3:
Slane w, l Castletown, Gibbstown, 19/5/1968,
Rathkenny w, l United Gaels, Castletown, 19/5/1968,
Syddan - Bye,
Round 4:
Slane v Syddan, Castletown, 26/5/1968,
Castletown w, l United Gaels, Cross Guns, 9/6/1968,
Rathkenny - Bye,
Round 5:
Slane w, l United Gaels,
Syddan v Rathkenny,
Castletown - Bye,
Group C
Round 1:
Ballivor w, l Athboy, Kildalkey, 5/5/1968,
Enfield 1-11, 2-7 Summerhill, Trim, 23/6/1968,
Round 2:
Enfield w, l Athboy, Trim, 19/5/1968,
Ballivor w, l Summerhill, Trim, 19/5/1968,
Round 3:
Ballivor d, d Enfield, Summerhill, 16/6/1968,
Summerhill w/o, scr Athboy,
Semi-Final Playoff:
Enfield d, d Ballivor, Trim, 14/7/1968,
Enfield w, l Ballivor, Trim, 25/8/1968,
Group D
Round 1:
Drumree w/o, scr Gaeil Colmcille 'B', Athboy, 5/5/1968,
Warrenstown w, l St. Peter's Dunboyne, Kilcloon, 5/5/1968,
Round 2:
Drumree w, l St. Peter's Dunboyne, Kilcloon, 19/5/1968,
Warrenstown w/o, scr Gaeil Colmcille 'B',
Round 3:
Drumree w, l Warrenstown, Drumree, 16/6/1968,
St. Peter's Dunboyne w/o, scr Gaeil Colmcille ' B',
Knock-out Stages
The teams in the Semi-Finals are the first and second placed teams from each group.
Semi-Final:
Slane w, l Drumree, Skryne, 28/7/1968,
Bohermeen w, l Enfield, Trim, 6/10/1968,
Final:
Slane 1-9, 1-7 Bohermeen, Pairc Tailteann, 20/10/1968,
References
External links
Meath Intermediate Football Championship
Meath Intermediate Football Championship |
Lemberg pri Novi Cerkvi () is a village in the Municipality of Vojnik in eastern Slovenia. The area is part of the traditional region of Styria. It is now included with the rest of the municipality in the Savinja Statistical Region.
Name
The name of the settlement was changed from Lemberg to Lemberg pri Strmcu (literally, 'Lemberg near Strmec') in 1953. The name was changed again, from Lemberg pri Strmcu to Lemberg pri Novi Cerkvi (literally, 'Lemberg near Nova Cerkev'), in 1992. The 1953 and 1992 changes corresponded to the name changes of the neighboring settlement of Nova Cerkev (literally, 'New Church'), which was renamed Strmec in 1952 and then restored to Nova Cerkev in 1992. The name changes were based on the 1948 Law on Names of Settlements and Designations of Squares, Streets, and Buildings as part of efforts by Slovenia's postwar communist government to remove religious elements from toponyms.
Church
The local church is dedicated to Saint Catherine and belongs to the Parish of Nova Cerkev. It was built in 1841. Lemberg Castle is a 13th-century castle with a 15th-century extension that stands just above the village.
References
External links
Lemberg pri Novi Cerkvi on Geopedia
Populated places in the Municipality of Vojnik |
Mary-Alice Daniel (born in 1986 in Maiduguri) is a Nigerian-American writer. She won the Yale Series of Younger Poets Prize in 2022 for her first book of poetry, Mass for Shut-Ins.
Personal life and education
Daniel was born in Maiduguri, Nigeria, in a predominantly Islamic Sharia state in 1986. Daniel identifies as Hausa–Fulani and was raised in a Christian minority tradition. In childhood, she emigrated to Reading, England, and Nashville, Tennessee, but returned intermittently to northern Nigeria.
She received a Bachelor of Arts from Yale University in 2008, a Master of Fine Arts from the Helen Zell Writers’ Program at the University of Michigan in 2013, and a Doctor of Philosophy in English literature and creative writing from the University of Southern California in 2021, after which she began a postdoctoral fellowship at Brown University. In 2023, Daniel became the inaugural Visiting Writer-in-Residence at the Center for the Literary Arts at Washington University in St. Louis. She was appointed as the 2024 Mary Routt Endowed Chair of Writing at Scripps College.
Literary career
In March 2022, Rae Armantrout selected Daniel's Mass for Shut-Ins manuscript as the 117th winner of the Yale Series of Younger Poets Prize. Armantrout commented, “Daniel draws on animistic, Islamic, and syncretic Christian traditions from her native Nigeria to unleash potent incantations, rituals, and spells, electric as St. Elmo's fire. This is Flowers of Evil for the 21st century.” Yale University Press published the Mass for Shut-Ins collection in March 2023. The Poetry Foundation describes the collection as “eclectically rigorous poems that reverberate with a Plathian edge and ear.”
In November 2022, Ecco Press published A Coastline Is an Immeasurable Thing: A Memoir Across Three Continents. In a starred review, Publishers Weekly outlines the memoir interspersing accounts of Nigerian history as the author reflects upon “her life on three continents, surrounded by stories that made up the fabric of her African upbringing.” The New York Times Book Review told subscribers to “read this book once for the furious beauty of Daniel's prose," then to "read it again for a master class in how we might finally come to tell our stories on our own terms.” It was named People’s Book of the Week and one of the Best Nonfiction Books of the Year by Kirkus Reviews, who called it “an absolutely fascinating work from a gifted storyteller” in their starred review.
Daniel's poetry has appeared in The Yale Review, The American Poetry Review, The Iowa Review, Indiana Review, Callaloo, New England Review, Prairie Schooner, Best New Poets, and elsewhere.
A Cave Canem Fellow, Daniel was twice shortlisted for the Brunel University African Poetry Prize. She is represented by the Wylie Agency
Publications
Mass for Shut-Ins (Yale University Press, 2023) ISBN 9780300267990.
A Coastline Is an Immeasurable Thing: A Memoir Across Three Continents (Ecco, 2022) ISBN 9780062960047.
References
1985 births
Living people |
```forth
*> \brief <b> DPTSVX computes the solution to system of linear equations A * X = B for PT matrices</b>
*
* =========== DOCUMENTATION ===========
*
* Online html documentation available at
* path_to_url
*
*> \htmlonly
*> Download DPTSVX + dependencies
*> <a href="path_to_url">
*> [TGZ]</a>
*> <a href="path_to_url">
*> [ZIP]</a>
*> <a href="path_to_url">
*> [TXT]</a>
*> \endhtmlonly
*
* Definition:
* ===========
*
* SUBROUTINE DPTSVX( FACT, N, NRHS, D, E, DF, EF, B, LDB, X, LDX,
* RCOND, FERR, BERR, WORK, INFO )
*
* .. Scalar Arguments ..
* CHARACTER FACT
* INTEGER INFO, LDB, LDX, N, NRHS
* DOUBLE PRECISION RCOND
* ..
* .. Array Arguments ..
* DOUBLE PRECISION B( LDB, * ), BERR( * ), D( * ), DF( * ),
* $ E( * ), EF( * ), FERR( * ), WORK( * ),
* $ X( LDX, * )
* ..
*
*
*> \par Purpose:
* =============
*>
*> \verbatim
*>
*> DPTSVX uses the factorization A = L*D*L**T to compute the solution
*> to a real system of linear equations A*X = B, where A is an N-by-N
*> symmetric positive definite tridiagonal matrix and X and B are
*> N-by-NRHS matrices.
*>
*> Error bounds on the solution and a condition estimate are also
*> provided.
*> \endverbatim
*
*> \par Description:
* =================
*>
*> \verbatim
*>
*> The following steps are performed:
*>
*> 1. If FACT = 'N', the matrix A is factored as A = L*D*L**T, where L
*> is a unit lower bidiagonal matrix and D is diagonal. The
*> factorization can also be regarded as having the form
*> A = U**T*D*U.
*>
*> 2. If the leading principal minor of order i is not positive,
*> then the routine returns with INFO = i. Otherwise, the factored
*> form of A is used to estimate the condition number of the matrix
*> A. If the reciprocal of the condition number is less than machine
*> precision, INFO = N+1 is returned as a warning, but the routine
*> still goes on to solve for X and compute error bounds as
*> described below.
*>
*> 3. The system of equations is solved for X using the factored form
*> of A.
*>
*> 4. Iterative refinement is applied to improve the computed solution
*> matrix and calculate error bounds and backward error estimates
*> for it.
*> \endverbatim
*
* Arguments:
* ==========
*
*> \param[in] FACT
*> \verbatim
*> FACT is CHARACTER*1
*> Specifies whether or not the factored form of A has been
*> supplied on entry.
*> = 'F': On entry, DF and EF contain the factored form of A.
*> D, E, DF, and EF will not be modified.
*> = 'N': The matrix A will be copied to DF and EF and
*> factored.
*> \endverbatim
*>
*> \param[in] N
*> \verbatim
*> N is INTEGER
*> The order of the matrix A. N >= 0.
*> \endverbatim
*>
*> \param[in] NRHS
*> \verbatim
*> NRHS is INTEGER
*> The number of right hand sides, i.e., the number of columns
*> of the matrices B and X. NRHS >= 0.
*> \endverbatim
*>
*> \param[in] D
*> \verbatim
*> D is DOUBLE PRECISION array, dimension (N)
*> The n diagonal elements of the tridiagonal matrix A.
*> \endverbatim
*>
*> \param[in] E
*> \verbatim
*> E is DOUBLE PRECISION array, dimension (N-1)
*> The (n-1) subdiagonal elements of the tridiagonal matrix A.
*> \endverbatim
*>
*> \param[in,out] DF
*> \verbatim
*> DF is DOUBLE PRECISION array, dimension (N)
*> If FACT = 'F', then DF is an input argument and on entry
*> contains the n diagonal elements of the diagonal matrix D
*> from the L*D*L**T factorization of A.
*> If FACT = 'N', then DF is an output argument and on exit
*> contains the n diagonal elements of the diagonal matrix D
*> from the L*D*L**T factorization of A.
*> \endverbatim
*>
*> \param[in,out] EF
*> \verbatim
*> EF is DOUBLE PRECISION array, dimension (N-1)
*> If FACT = 'F', then EF is an input argument and on entry
*> contains the (n-1) subdiagonal elements of the unit
*> bidiagonal factor L from the L*D*L**T factorization of A.
*> If FACT = 'N', then EF is an output argument and on exit
*> contains the (n-1) subdiagonal elements of the unit
*> bidiagonal factor L from the L*D*L**T factorization of A.
*> \endverbatim
*>
*> \param[in] B
*> \verbatim
*> B is DOUBLE PRECISION array, dimension (LDB,NRHS)
*> The N-by-NRHS right hand side matrix B.
*> \endverbatim
*>
*> \param[in] LDB
*> \verbatim
*> LDB is INTEGER
*> The leading dimension of the array B. LDB >= max(1,N).
*> \endverbatim
*>
*> \param[out] X
*> \verbatim
*> X is DOUBLE PRECISION array, dimension (LDX,NRHS)
*> If INFO = 0 of INFO = N+1, the N-by-NRHS solution matrix X.
*> \endverbatim
*>
*> \param[in] LDX
*> \verbatim
*> LDX is INTEGER
*> The leading dimension of the array X. LDX >= max(1,N).
*> \endverbatim
*>
*> \param[out] RCOND
*> \verbatim
*> RCOND is DOUBLE PRECISION
*> The reciprocal condition number of the matrix A. If RCOND
*> is less than the machine precision (in particular, if
*> RCOND = 0), the matrix is singular to working precision.
*> This condition is indicated by a return code of INFO > 0.
*> \endverbatim
*>
*> \param[out] FERR
*> \verbatim
*> FERR is DOUBLE PRECISION array, dimension (NRHS)
*> The forward error bound for each solution vector
*> X(j) (the j-th column of the solution matrix X).
*> If XTRUE is the true solution corresponding to X(j), FERR(j)
*> is an estimated upper bound for the magnitude of the largest
*> element in (X(j) - XTRUE) divided by the magnitude of the
*> largest element in X(j).
*> \endverbatim
*>
*> \param[out] BERR
*> \verbatim
*> BERR is DOUBLE PRECISION array, dimension (NRHS)
*> The componentwise relative backward error of each solution
*> vector X(j) (i.e., the smallest relative change in any
*> element of A or B that makes X(j) an exact solution).
*> \endverbatim
*>
*> \param[out] WORK
*> \verbatim
*> WORK is DOUBLE PRECISION array, dimension (2*N)
*> \endverbatim
*>
*> \param[out] INFO
*> \verbatim
*> INFO is INTEGER
*> = 0: successful exit
*> < 0: if INFO = -i, the i-th argument had an illegal value
*> > 0: if INFO = i, and i is
*> <= N: the leading principal minor of order i of A
*> is not positive, so the factorization could not
*> be completed, and the solution has not been
*> computed. RCOND = 0 is returned.
*> = N+1: U is nonsingular, but RCOND is less than machine
*> precision, meaning that the matrix is singular
*> to working precision. Nevertheless, the
*> solution and error bounds are computed because
*> there are a number of situations where the
*> computed solution can be more accurate than the
*> value of RCOND would suggest.
*> \endverbatim
*
* Authors:
* ========
*
*> \author Univ. of Tennessee
*> \author Univ. of California Berkeley
*> \author Univ. of Colorado Denver
*> \author NAG Ltd.
*
*> \ingroup ptsvx
*
* =====================================================================
SUBROUTINE DPTSVX( FACT, N, NRHS, D, E, DF, EF, B, LDB, X, LDX,
$ RCOND, FERR, BERR, WORK, INFO )
*
* -- LAPACK driver routine --
* -- LAPACK is a software package provided by Univ. of Tennessee, --
* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
*
* .. Scalar Arguments ..
CHARACTER FACT
INTEGER INFO, LDB, LDX, N, NRHS
DOUBLE PRECISION RCOND
* ..
* .. Array Arguments ..
DOUBLE PRECISION B( LDB, * ), BERR( * ), D( * ), DF( * ),
$ E( * ), EF( * ), FERR( * ), WORK( * ),
$ X( LDX, * )
* ..
*
* =====================================================================
*
* .. Parameters ..
DOUBLE PRECISION ZERO
PARAMETER ( ZERO = 0.0D+0 )
* ..
* .. Local Scalars ..
LOGICAL NOFACT
DOUBLE PRECISION ANORM
* ..
* .. External Functions ..
LOGICAL LSAME
DOUBLE PRECISION DLAMCH, DLANST
EXTERNAL LSAME, DLAMCH, DLANST
* ..
* .. External Subroutines ..
EXTERNAL DCOPY, DLACPY, DPTCON, DPTRFS, DPTTRF,
$ DPTTRS,
$ XERBLA
* ..
* .. Intrinsic Functions ..
INTRINSIC MAX
* ..
* .. Executable Statements ..
*
* Test the input parameters.
*
INFO = 0
NOFACT = LSAME( FACT, 'N' )
IF( .NOT.NOFACT .AND. .NOT.LSAME( FACT, 'F' ) ) THEN
INFO = -1
ELSE IF( N.LT.0 ) THEN
INFO = -2
ELSE IF( NRHS.LT.0 ) THEN
INFO = -3
ELSE IF( LDB.LT.MAX( 1, N ) ) THEN
INFO = -9
ELSE IF( LDX.LT.MAX( 1, N ) ) THEN
INFO = -11
END IF
IF( INFO.NE.0 ) THEN
CALL XERBLA( 'DPTSVX', -INFO )
RETURN
END IF
*
IF( NOFACT ) THEN
*
* Compute the L*D*L**T (or U**T*D*U) factorization of A.
*
CALL DCOPY( N, D, 1, DF, 1 )
IF( N.GT.1 )
$ CALL DCOPY( N-1, E, 1, EF, 1 )
CALL DPTTRF( N, DF, EF, INFO )
*
* Return if INFO is non-zero.
*
IF( INFO.GT.0 )THEN
RCOND = ZERO
RETURN
END IF
END IF
*
* Compute the norm of the matrix A.
*
ANORM = DLANST( '1', N, D, E )
*
* Compute the reciprocal of the condition number of A.
*
CALL DPTCON( N, DF, EF, ANORM, RCOND, WORK, INFO )
*
* Compute the solution vectors X.
*
CALL DLACPY( 'Full', N, NRHS, B, LDB, X, LDX )
CALL DPTTRS( N, NRHS, DF, EF, X, LDX, INFO )
*
* Use iterative refinement to improve the computed solutions and
* compute error bounds and backward error estimates for them.
*
CALL DPTRFS( N, NRHS, D, E, DF, EF, B, LDB, X, LDX, FERR, BERR,
$ WORK, INFO )
*
* Set INFO = N+1 if the matrix is singular to working precision.
*
IF( RCOND.LT.DLAMCH( 'Epsilon' ) )
$ INFO = N + 1
*
RETURN
*
* End of DPTSVX
*
END
``` |
See also
Virginia's 17th congressional district special election, 1808
Virginia's 21st congressional district special election, 1809
United States House of Representatives elections, 1808 and 1809
List of United States representatives from Virginia
Notes
References
1809
Virginia
United States House of Representatives |
```xml
<vector xmlns:android="path_to_url" android:height="34.0dp" android:tint="?attr/colorControlNormal" android:viewportHeight="15" android:viewportWidth="15" android:width="34.0dp">
<path android:fillColor="@android:color/white" android:pathData="M3 2L4 0L11 0L12 2L12.5 2C12.78 2 13 2.22 13 2.5L13 3.5C13 3.78 12.78 4 12.5 4L12 4L11 15L4 15L3 4L2.5 4C2.22 4 2 3.78 2 3.5L2 2.5C2 2.22 2.22 2 2.5 2L3 2L3 2ZM10.82 6L11 4L4 4L4.19 6L10.82 6L10.82 6ZM10.27 12L4.73 12L4.91 14L10.09 14L10.27 12L10.27 12Z"/>
</vector>
``` |
Paul Marie Félix Jacques René Arnaud de Foïard (9 September 1921 – 7 August 2005) was a général of the French Army who served primarily in the French Foreign Legion taking part in World War II and the conflicts of Indochina and Algeria.
Military career
Paul Arnaud de Foïard commenced his arms in the resistance where he was captured and interned on 4 December 1942 until 3 June 1943. Escaped, he disembarked in Spain where he was interned at Figueras. He was liberated at Setubal in Portugal, and embarked to Morocco on 21 August.
During this time, he registered an engagement for the duration of the war by joining the 501e Régiment de chars de combat 501e RCC. His services counted as retroactive, counting from 4 December 1942. He passed to the instruction depot of Dellys, then joined the school of Cherchell as an aspirant. He was assigned to the Marching Regiment of the Foreign Legion RMLE with the rank of aspirant on 1 April 1944. With his unit, he participated to the disembarking at Saint-Raphaël in September then to the offensive of the Ist Army, an offensive during which he was wounded by a mine. He was evacuated on 28 November 1944 and cited at the orders of the brigade with his first croix de guerre 1939–1945. It was at the head of his section, in Germany, that he was awarded the Médaille militaire in 1945.
On 8 February 1945 he was assigned to the 11th company of the RMLE. Leading a section (platoon), he distinguished leadership on 20 March 1945, at the crossroad south of Buchelberg; during the siege of Mulhausen, on 4 April, on the bridge of Enns, the 7; then in Herrenberg, the 18; at Hattingen, the 25; at Immendingen the 26; accordingly being awarded three citations at the orders of the armed forces and the Médaille militaire in one trimester. At the end of the war, he was sent to the École militaire interarmes, since September 1945, to validate his connaissances of an officer.
The RMLE was dissolved. Accordingly, Paul joined the 3rd Foreign Infantry Regiment 3e REI on 20 December 1945. A decree of February 1946 designated him as sous-lieutenant, to be effective starting 1 February 1944. He was then promoted to the rank of lieutenant on 1 February 1946.
He participated to the campaigns of Indochina, he disembarked at Saigon and joined the 11th company of the 3e REI on 11 June 1946. He was wounded by a machine gun, at My Duc Thay, on 22 January 1947. On 23 October 1947 he was assigned the company of camions bennes CCB. Accordingly, he was awarded a new citation at the orders of the armed forces and the knight croix of the Légion d’honneur, bestowed on 14 July 1947. This last one was matched with the croix de guerre des TOE, for his personal action in Cai Lay in Cochinchine; at Am Thai Dong in the province of Mytho.
During the creation of the Parachute Company of the 3rd Foreign Infantry Regiment, Co. Para du 3e REI, on 1 April 1948, he assumed the command of a platoon section under the order of lieutenant Jacques Morin. On 16 May he was awarded a citation at the orders of the division during a combat exchange battle at the fortified village of Tho Truong. Repatriated sanitary, he disembarked in Marseille, was hospitalized and benefitted of a break. He was assigned to the regional administrative company of Versailles.
Promoted to captain on 2 January 1952, he reassumed the service on 14 October 1952. He was entrusted with the command of the 2nd company of the 1st battalion of the 1st Foreign Infantry Regiment 1er REI on the 20. On 13 March 1953 he commanded the platoons of the 1e REI at Saida. In November he joined the moral service of the legion as editor-in-chief of Képi Blanc in Sidi Bel Abbès until dissolution in July 1955. He was then assigned in the qualities of a commandant of the 5th company of the 2nd battalion of the 4th Foreign Infantry Regiment 4e REI at Fes in Morocco. The 5e du 2/4e REI became the 6e CP du 4e REI, on 16 November 1956. At the corps of this unit, he partook to operations of maintaining order in the Rif and notably at Hibel, Tembouzid, and Zoua Ouah. He was cited at the orders of the division with croix de la Valeur militaire on 11 July 1956. He joined metropole in 1957 and was assigned to the depot of the legion.
Detached the provisionary commando group, in qualities of an instructor in garrison at El Hadjeb from 16 February to 4 July 1956, he was awarded a citation at the orders of the armed corps. Another citation at the orders of the armed corps, was conferred for another engagement. On 1 August 1957 he was assigned to the depot of the Legion in Marseille. He was promoted officer in the order of the Légion d’honneur on 18 December 1958. He joined the ESMIA de Coëtquidan groupment, on 1 June 1959. He was accordingly promoted to on 1 October 1959.
He integrated the 74 promotion of the école supérieure de guerre in August 1960. Following, he was assigned to the operation means bureau of the 2nd Foreign Parachute Regiment 2e REP, on 1 July 1962. On 1 October 1963 he was assigned to EMAT bureau, where he was promoted to the rank of lieutenant-colonel, on 1 October 1964. Designated during his command time, he embarked to Mers el Kebir and became regimental commander of the 2e REP, on 1 June 1965 at Bou Sfer.
On 15 June 1967 the REP was repatriated on Corsica. With the finalization of this command tenure, he joined the EMA on 1 July. Accordingly, he was promoted to commander of the Légion d’honneur, on 14 July and to the rank of colonel, on 1 October. He was designated to serve at the 1st Parachute Brigade 1re BP and placed in subsistence at the 420th command and service battalion on 1 August 1972. The following January he was promoted to rank of brigadier general.
In August 1974 he was designated in a director quality, hors-cadre, of the Secrétariat général de la défense et de la sécurité nationale, under the orders of the Prime Minister of France and occupied the vice-presidency of the permanent council for military service in 1975. Reintegrated, he joined the 11th Parachute Division 11e DP and was division commander on 29 November 1975. He was promoted to division general, in December 1976.
Promoted to the rank and designation of a général de corps d’armée on 1 August 1979, he became director of the enseignement militaire supérieur of the French Army in October. On 17 September 1981 he was nominated as a grand officier de la Légion d’honneur. Attained by the reglementary age limit of his rank to the section of officer generals, on 10 September 1981.
Decorations
Grand Officier of the Légion d'Honneur
Commandeur of the Légion d'Honneur (1967)
Officier of the Légion d'Honneur (1958)
Chevalier of the Légion d'Honneur (1947)
Médaille militaire (1945)
Grand Croix of the Ordre national du Mérite (1966)
Croix de guerre 1939-1945 (3 palms, 1 star)
Croix de guerre des Théatres d'Opérations Exterieures
Croix de la Valeur Militaire
Médaille des Evades
Croix du combattant volontaire (1939–1945)
Croix du combattant
Médaille coloniale with agrafe (clasp) « E.O »
Knight of the Ordre des Palmes Académiques
Médaille de la Jeunesse et des Sports
Indochina Campaign commemorative medal
North Africa Security and Order Operations Commemorative Medal with agrafes (clasps) « Algérie » and « Maroc »
Bronze Star Medal, U.S. Army (U.S.)
Officer of the Order of Ouissam Alaouite (Morocco)
He totalized 9 citations.
See also
Major (France)
French Foreign Legion Music Band (MLE)
Pierre Segretain
Pierre Jeanpierre
Helie de Saint Marc
Roger Faulques
Jacques Lefort, regimental commander 2nd Foreign Parachute Regiment 2e REP (1958)
Pierre Darmuzai, 2e REP (1960)
Saharan Méharistes Companies (méharistes sahariennes)
Jeannou Lacaze, 2e REP (1967)
Bernard Goupil, 2e REP (1972)
Jean Brette, 2e REP (1974)
Philippe Erulin, 2e REP (1976)
Jean Louis Roué, 2e REP (1978)
Bruno Dary, 2e REP (1994)
Benoît Puga, 2e REP (1996)
References
Sources
Képi blanc History and Patrimony Division of the French Foreign Legion ()
1921 births
2005 deaths
People from Meudon
French military personnel of World War II
French military personnel of the First Indochina War
French military personnel of the Algerian War
French generals
Soldiers of the French Foreign Legion
Officers of the French Foreign Legion
Grand Officers of the Legion of Honour
Grand Cross of the Ordre national du Mérite
Recipients of the Croix de Guerre 1939–1945 (France)
Recipients of the Croix de guerre des théâtres d'opérations extérieures
Recipients of the Cross for Military Valour
Chevaliers of the Ordre des Palmes Académiques |
```php
<?php
namespace PragmaRX\Health\Tests\PhpUnit\Service;
use PragmaRX\Health\Support\Timer;
use PragmaRX\Health\Tests\PhpUnit\TestCase;
class TimerTest extends TestCase
{
public function testCanStartTimer()
{
Timer::start();
sleep(1);
$this->assertEquals(1, (int) Timer::stop());
}
}
``` |
Alfarrábios is a historical novel by the Brazilian writer José de Alencar, first published in 1873. It is composed of three minor narratives: "O Garatuja", "O Ermitão da Glória" and "Alma de Lázaro".
Adaptations
"O Garatuja" was adapted into an opera by Ernst Mahle.
1873 Brazilian novels
Novels by José de Alencar
Portuguese-language novels |
The Peloponnese slowworm (Anguis cephalonnica) is a species of lizard in the family Anguidae endemic to Greece. Its natural habitats are temperate forests, temperate shrubland, Mediterranean-type shrubby vegetation, temperate grassland, arable land, pastureland, plantations, and rural gardens.
References
Anguis
Reptiles described in 1894
Lizards of Europe
Endemic fauna of Greece
Taxa named by Franz Werner
Taxonomy articles created by Polbot
Taxobox binomials not recognized by IUCN |
```asciidoc
``` |
Pullaigudem is a village in Nalgonda district in Telangana, India. It falls under Atmakur mandal.
References
Villages in Nalgonda district |
Larry Earnest Wright (born April 17, 1949), better known under alias L. W. Wright, is an American confidence trickster. In 1982, he posed as a stock car racing driver to compete in the Winston 500, a NASCAR Winston Cup Series race at Talladega Superspeedway.
Biography
Early life
Larry Earnest Wright was born on April 17, 1949, and grew up in Richlands, Virginia, United States. He had seven siblings, including five brothers and two sisters. According to Wright, he dropped out of school in the seventh grade, to help his family financially, after his father, a coalminer, broke his back at work. At seventeen, according to his statements, he was illegally rum-running a moonshine during the Prohibition era.
In an interview Wright stated that he had volunteered into the United States Army, to fight in the Vietnam War, however, he was never shipped to the frontlines. On April 18, 1968, his older brother, Grover C. Wright Jr. was killed in action during the conflict, in Biên Hòa Province, South Vietnam (now part of Vietnam). Larry cited it as a reason why he was never shipped there. Despite that, in another interview, he falsely stated, that he served three tours in Vietnam War, in the United States Army Special Forces.
1982 Winston 500
In April 1982, William Dunaway of Hendersonville, Tennessee, contacted a Nashville newspaper to promote a driver named L. W. Wright, an alias of Larry Wright, who declared he was entering the Winston 500 with Music City Racing. Claiming to be a 33-year-old driver with 43 NASCAR Busch Grand National Series starts, Wright also announced country artists Merle Haggard, T. G. Sheppard, and Waylon Jennings were to sponsor his team. To participate in the race, Wright submitted a check worth $115 to NASCAR for a competition license; although sanctioning body officials were skeptical of his background, right-to-work laws required NASCAR to allow him to race if he could pay for the license and $100 entry fee and provide a capable car. As part of Music City Racing, Lloyd Barber and Rick Wright also applied for drivers permits, while Dunaway, Freddy Case, Willis Judd, Michael Smith, and Ellis White requested mechanics licenses.
Wright approached B. W. "Bernie" Terrell, head of Nashville-based Space Age Marketing, for assistance in buying and sponsoring a car. In addition to $30,000 to purchase the vehicle, Terrell gave him a semi-trailer truck and $7,500 to cover expenses. He eventually bought a Chevrolet Monte Carlo from Sterling Marlin for $20,700 with $17,000 in cash and a check for the remainder; suspicious of the excessively high money spending, Marlin followed Wright to Talladega to serve as his crew chief. Other payments included $1,500–1,800 to Goodyear for tires, $1,200 to driver Travis Tiller for parts, and $168 to the Southern Textile Association's Wayne Wilson for racing jackets.
After Wright conducted a newspaper interview to promote his entry, Sheppard denied his involvement in the effort, with Nashville Speedway co-owner and Sheppard's tax attorney Gary Baker adding he "had never even heard of the guy". When he was questioned at Talladega about Sheppard and his racing career, Wright claimed the Sheppard sponsorship was "premature" and admitted he had participated in Sportsman class races that took place at Grand National tracks, but not in a Grand National race. Marlin expressed further suspicion at Wright's behavior at the track, who regularly asked "questions any driver should have known". Wright crashed in practice, but was able to repair his car and qualified 36th. In the race, he was ordered to exit after 13 laps for being too slow and finished 39th. He received $1,545 in prize money but no points in the Cup standings as a late entrant.
Aftermath
Following the race, Wright disappeared and left the car at the speedway, where Terrell recovered it. While missing, he was announced as having failed to qualify for the next race, the Cracker Barrel Country Store 420 at Nashville Speedway. It was later revealed that the checks which Wright gave were invalid; South Central Bell and Wright's landlord received bad checks worth $700 and $4,500, respectively, while United Trappers Marketing Association owner Dean McIntire lost over $10,000 to Wright. Marlin commented the bounced check "didn't really surprise me. I sort of expected it."
NASCAR arranged for arrest warrants, while Terrell hired a private investigator to search for Wright. Wright was referred to as the "D. B. Cooper of NASCAR" by a Racing-Reference writer and in a documentary aired on NASCAR Race Hub for his immediate disappearance and unknown whereabouts.
Discovery
On April 29, 2022, Rick Houston of the Scene Vault Podcast announced that they had found Wright, releasing a podcast interview with him on May 2, 2022, the 40th anniversary of Wright's infamous race and disappearance. The podcast announcement included an audio clip of Wright identifying himself.
Arrest
On February 13, 2023, Wright was arrested in Knox County, Tennessee by the United States Marshals Fugitive Task Force. He was charged with theft, burglary, and evading arrest.
Motorsports career results
NASCAR
(key) (Bold – Pole position awarded by qualifying time. Italics – Pole position earned by points standings or practice time. * – Most laps led.)
Winston Cup Series
References
External links
NASCAR drivers
American confidence tricksters
Living people
1949 births
20th-century American criminals
NASCAR controversies
Criminals from Virginia
American male criminals
People from Richlands, Virginia
American racing drivers
Formerly missing people
American people convicted of burglary
American people convicted of theft
American people convicted of fraud
Racing drivers from Virginia |
Polondava (Polonda, ) was a Dacian town, north of Dinogetia.
See also
Dacian davae
List of ancient cities in Thrace and Dacia
Dacia
Roman Dacia
References
Sources
Further reading
Dacian towns |
Pandikkad is a town located in the Eranad Taluk, Malappuram district, Kerala, India.
References
Cities and towns in Malappuram district
Manjeri |
Shenqiu County () is a county in the east of Henan province, China, bordering Anhui province to the south and east. It is under the administration of Zhoukou City. The county seat is the town of Shenqiu, which is situated on the Ying River, a tributary of the Huai River. This river traverses the county from Zhoukou in the west to the Henan state border with Anhui in the east at Jieshou,
The county includes the two streets, 10 towns, 10 townships. Population is made up of nine (Han, Hui, Manchu, Mongolian, Tibetan, Zhuang, Daur) ethnic groups. Han ethnic group is the largest comprising more than 956,000 Han.
Administrative divisions
As 2012, this county is divided to 2 subdistricts, 9 towns, 1 ethnic town and 10 townships.
Subdistricts
Dongcheng Subdistrict ()
Beicheng Subdistrict ()
Towns
Ethnic Towns
Huaidian Hui Town ()
Townships
Climate
References
County-level divisions of Henan
Zhoukou |
Thunderbolts is the name of several comic book titles featuring the team the Thunderbolts and published by Marvel Comics, beginning with the original Thunderbolts comic book series which debuted in 1997.
Publication history
The Thunderbolts first appeared in The Incredible Hulk (vol. 2) #449 (January 1997) and were created by Kurt Busiek and Mark Bagley.
The Thunderbolts were first presented, both to readers and to the Marvel Universe, as a group of super-powered figures who became heroes to help protect the world when the Avengers were declared dead after the events of the 1996 "Onslaught" crossover. The final page of the first issue of their comic book, however, revealed that the Thunderbolts were actually the Masters of Evil in disguise, a surprise twist carefully guarded by Marvel.
Themes of redemption and the nature of heroism are often featured in Thunderbolts comics. The book has also garnered critical praise for its use of secondary characters from other Marvel Comics and its use of continuity-themed storytelling.
The Thunderbolts was an original concept created for Marvel by Busiek and Bagley. Most of the characters used in the final concept were reimagined versions of existing Marvel characters, with additional original characters for the series developed by Busiek and designed by Bagley. The pair also created the new heroic identities for the Masters of Evil. Busiek recalled:
The actual origin of Thunderbolts came when I used to live in New Jersey and drive to New England to visit my parents. To keep myself awake, I'd give myself books to write, and work out about two to three years of continuity. One trip, I assigned myself Avengers, and came up with the plan that the Masters of Evil would ultimately conquer them by posing as new heroes and slowly replacing them. At the time, I thought it was a neat idea, and filed it away.
While Busiek's original reluctance was because he deemed readers would not have liked replacing the established characters and then having the new ones being villains – "doing that with one character, like what Marv Wolfman did with Terra, made a great sting, but doing it on a team-wide scale wouldn't work" – seeing a world devoid of many heroes following "Onslaught" made him revive the concept. The Thunderbolts first appeared as a team in The Incredible Hulk (vol. 2) #449 (January 1997), written by Peter David and illustrated by Mike Deodato. Originally intended to be a similar team known as the "Echelon", the synchronization of the plans led to the Thunderbolts being used instead as a "teaser" for their own series. No mention was made of the connection between the Thunderbolts and the Masters of Evil in this appearance, save perhaps for the Hulk almost recognizing Meteorite's voice (having fought Moonstone before). The team also appeared in a one-shot called Tales of the Marvel Universe. The twist would not be revealed until the first issue of their own series.
Soon after the publication of The Incredible Hulk (vol. 2) #449, the team's own series premiered. The first issue, cover dated April 1997, was played largely as a straight superhero story, until the revelation of the Thunderbolts' true nature on the last page of the comic. This is considered one of the most well-conceived plot twists in the history of American comic books, with Wizard magazine readers voting it "Comics' Greatest Moment of 1997" and later, in 1998, placing it at #11 on a list of "The 25 Greatest Comic Moments Ever". Marvel managed to keep the secret of the Thunderbolts' true villainous identities tightly under wraps before the book launched. When word got out, the first issue sold out so quickly that Marvel not only offered a second printing, but also did a "mini-trade paperback" collecting the first two issues. Fabian Nicieza replaced Busiek in issue #34. Patrick Zircher, after a couple of fill-ins, replaced Bagley in issue #51.
Despite critical acclaim, the book was reformatted with Thunderbolts #76 (March 2003), removing the entire cast and creative team and replacing it with a brand new set of characters, along with a new writer, John Arcudi. The move was done in part due to Marvel Editor-in-Chief Joe Quesada's desire to emulate the success he had with X-Force, which was reformatted with a new cast of characters and status quo that was successful in sales and popularity. However, the new direction for the series—an underground fighting circuit that employed predominantly newly created super-villain characters—was a commercial failure and canceled after six issues.
In 2004, Marvel Comics launched a limited series titled Avengers/Thunderbolts, which continued one year after the events of issue #75. The limited series ran for the same number of issues as the reformatted Thunderbolts arc.
Soon after the completion of Avengers/Thunderbolts, Marvel Comics launched a second series featuring the characters with New Thunderbolts #1 (January 2005). The storyline continued the events from Avengers/Thunderbolts as well as the fall-out of "Avengers Disassembled" and returned to the original series concept, though with a roster that lacked many fan favorites (such as Baron Zemo, Moonstone, and Techno). With the combination of the eighty-one issues of the first series and the first eighteen issues of New Thunderbolts, the series reverted to its original numbering with Thunderbolts #100.
Thunderbolts #110 saw another change to the direction of the series, with writer Warren Ellis introducing a new team of Thunderbolts, villains working for the government, tasked with capturing unregistered superheroes. Ellis has stated that he chose to approach the series "gently, but directly from a political agenda" and the relaunch was closely tied to Marvel's commercially successful Civil War event, with the team serving as a dark reflection of the event's controversial ending.
Ellis stepped aside in issue #121 and was replaced by Christos Gage, who wrote three one-shots and a four-issue tie-in with Secret Invasion. At the 2008 San Diego Comic Con, Andy Diggle was announced as the new ongoing writer, starting in issue #126 (November 2008) with a two issue story "Burning Down the House" which cleared the way for the introduction of a new team line-up. This team debuted in Thunderbolts #128-129, a story that dealt with "Dark Reign", the Secret Invasion aftermath, which was followed by "Magnum Opus", a 4-issue crossover with Deadpool (vol. 2). Miguel Sepulvida took over art duties with Thunderbolts #133 and Jeff Parker became the new writer with issue #138. Parker then piloted the title through the end of "Dark Reign", featuring a crossover with the Agents of Atlas team he was also writing, and into "Siege", following which the team was revamped again. Parker announced that "the status quo of the team undergoes a major overhaul for the new era to come. It's going to synthesize a lot of what readers like about recent history and re-instill some elements from the early days of the book."
The Heroic Age team debuted in Thunderbolts #144 with a new main artist, Kev Walker. The title crossed over with Avengers Academy in issue #147, which was bookended by Avengers Academy #3 and #4. The series then went on to cross over with the Daredevil storyline "Shadowland" in issues #148-149, with artist Declan Shalvey stepping in for the two issues. The series then crossed over with the "Fear Itself" storyline in issues #158-163.
The Thunderbolts comic book was renamed Dark Avengers beginning with issue #175, but the creative team remained unchanged. Dark Avengers ended with issue #190.
As part of Marvel NOW!, a new Thunderbolts series was launched featuring a new team. This series ended in October 2014 with issue #32.
In July 2023, a new Thunderbolts series was announced for a December release and will be written by Collin Kelly and Jackson Lanzing and illustrated by Geraldo Borges.
Collected editions
The Thunderbolts' stories have been collected in a number of Marvel Omnibus oversized hardcovers and trade paperbacks:
Marvel Omnibus
Thunderbolts Omnibus:
Volume 1 (collects Thunderbolts (1997) #0, 1-33, Thunderbolts Annual 1997, Thunderbolts: Distant Rumblings (1997) #-1, Incredible Hulk (1968) #449, Spider-Man Team-Up (1995) #7, Heroes For Hire (1997) #7, Captain America & Citizen V Annual 1998, Avengers (1998) #12, and the Thunderbolts story from Tales of the Marvel Universe (1997) #1)
Volume 2 (collects Thunderbolts (1997) #34-63, Thunderbolts Annual 2000, Avengers (1998) #31-34, Avengers Annual 2000, Thunderbolts: Life Sentences (2001) #1, Thunderbolts: From the Marvel Vault (2011) #1, Citizen V and the V-Battalion (2001) #1-3, Citizen V and the V-Battalion: The Everlasting (2002) #1-4)
Volume 3 (collects Thunderbolts (1997) #64-75 and #100-109, Avengers/Thunderbolts #1-6, New Thunderbolts #1-18 and Thunderbolts Presents: Zemo - Born Better #1-4)
Thunderbolts: Uncaged Omnibus (collects Thunderbolts (2006) #144-174 and #163.1, Dark Avengers #175-190, and the Thunderbolts story from Enter the Heroic Age #1)
Epic Collection
Vol 1: Justice, Like Lighting - Thunderbolts #1-12, -1, Thunderbolts '97 Annual, The Incredible Hulk #449, Spider-Man Team-Up #7, Heroes For Hire #7 material from Tales of the Marvel Universe special
Vol 3: Wanted Dead of Alive - Thunderbolts #13-25, 0; Captain America and Citizen V Annual 1998, Avengers #12
The Classic era
Thunderbolts: Marvel's Most Wanted (collects the first appearances of the six original members from Captain America vol. 1 #168, The Incredible Hulk vol. 1 #228-229, Marvel Two-in-One #56, Strange Tales #123 and 141–143, Avengers vol. 1 #21-22, 176 pages, softcover, February 1998, )
Thunderbolts: First Strikes (collects Thunderbolts #1-2, 48 pages, softcover, December 1997, )
Thunderbolts: Justice Like Lightning... (collects Thunderbolts #1-4, Thunderbolts '97 Annual, The Incredible Hulk #449, Tales of the Marvel Universe special and Spider-Man Team-Up #7, 224 pages, softcover, December 2001, )
Thunderbolts Classic:
Volume 1 (collects Thunderbolts #1-5, Thunderbolts: Distant Rumblings #-1, Thunderbolts '97 Annual, The Incredible Hulk #449, Tales of the Marvel Universe one-shot and Spider-Man Team-Up #7, 296 pages, April 2011, )
Volume 2 (collects Thunderbolts #6-14, and Heroes for Hire #7, 256 pages, March 2012, )
Volume 3 (collects Thunderbolts #15-22, 0, and Captain America & Citizen V Annual '98; Avengers Vol. 3 #12, 288 pages, softcover, August 15, 2012, )
Hawkeye and the Thunderbolts:
Volume 1 (collects Thunderbolts #23-37, Thunderbolts Annual 2000, Avengers Annual 2000, 456 pages, softcover, May 3, 2016, )
Volume 2 (collects Thunderbolts #38-50, Avengers Vol. 3 #31-34; 440 pages July 2016 )
The Avengers/Thunderbolts:
Volume 1: The Nefaria Protocols (collects The Avengers #31-34 and Thunderbolts #42-44, 184 pages, softcover, March 2004, )
Volume 2: Best Intentions (collects Avengers/Thunderbolts #1-6, 144 pages, softcover, November 2004, )
The "Fightbolts" era
Thunderbolts: How to Lose (by John Arcudi, collects Thunderbolts #76-81, 120 pages, softcover, November 2003, )
The New Thunderbolts era
New Thunderbolts:
Volume 1: One Step Forward (collects New Thunderbolts #1-6, 144 pages, softcover, June 2005, )
Volume 2: Modern Marvels (collects New Thunderbolts #7-12, 144 pages, softcover, November 2005, )
Volume 3: Right of Power (collects New Thunderbolts #13-18 and Thunderbolts #100, 184 pages, softcover, June 2006, )
Civil War: Thunderbolts (collects Thunderbolts #101-105, 120 pages, softcover, May 2007, )
Thunderbolts: The Guardian Protocols (collects Thunderbolts #106-109, 96 pages, July 2007, )
Thunderbolts Presents: Zemo - Born Better (by Fabian Nicieza, collects 4-issue mini-series, 96 pages, August 2007, )
The post-Civil War era
Thunderbolts by Warren Ellis and Mike Deodato Ultimate Collection (collects Thunderbolts #110-121 and material from Civil War: The Initiative one-shot, 296 pages, softcover, September 2011, ) covers the same core series issues as:
Thunderbolts: Faith in Monsters (collects Thunderbolts #110-115, "Thunderbolts: Desperate Measures", Civil War: Choosing Sides and Civil War: The Initiative, 192 pages, hardcover, September 2007, , softcover, January 2008, )
Thunderbolts: Caged Angels (collects Thunderbolts #116-121, 144 pages, hardcover, September 2008, , softcover, December 2008, )
Thunderbolts: Secret Invasion (collects Thunderbolts: Breaking Point one-shot, Thunderbolts: International Incident one-shot, Thunderbolts: Reason in Madness and Thunderbolts #122-125, 168 pages, Marvel Comics, softcover, March 2009, )
Penance: Relentless (by Paul Jenkins, collects 5-issue limited series, 120 pages, July 2008, )
The Dark Reign era
Thunderbolts: Burning Down The House (collects Thunderbolts #126-129 and 132, 112 pages, hardcover, August 2009, , softcover, November 2009, )
Dark Reign: Deadpool/Thunderbolts (collects Thunderbolts #130-131 and Deadpool vol. 2, #8-9, 96 pages, softcover, July 2009, )
Thunderbolts: Widowmaker (collects Thunderbolts #133-137, premiere hardcover, 120 pages, December 2009, , softcover, May 2010, )
Siege: Thunderbolts (collects Thunderbolts #138-143, 144 pages, premiere hardcover, September 2010, , softcover, January 2011, )
The Heroic Age era
Thunderbolts: Cage (collects Thunderbolts #144-147 and stories from Enter the Heroic Age one-shot, 112 pages, hardcover, October 2010, , softcover, March 2011, )
Shadowland: Thunderbolts (collects Thunderbolts #148-151, 144 pages, hardcover, April 2011, )
Thunderbolts: Violent Rejection (collects Thunderbolts #152-157, 280 pages, softcover, August 2011, )
Fear Itself: Thunderbolts (collects Thunderbolts #158-162, 120 pages, hardcover, February 2012, )
Thunderbolts: The Great Escape (collects Thunderbolts #163, #163.1, 164–168, 168 pages, softcover, March 2012, )
Thunderbolts: Like Lightning (collects Thunderbolts #169-174, 144 pages, softcover, September 2012, )
Dark Avengers: The End is the Beginning (collects Dark Avengers #175-183, 208 pages, softcover, February 2013, )
Dark Avengers: Masters of Evil (collects Dark Avengers #184-190, 168 pages, softcover, July 2013, )
The Marvel Now Era
Thunderbolts Volume 1: No Quarter (collects Thunderbolts vol. 2 #1-6, 136, softcover, May 2013, )
Thunderbolts Volume 2: Red Scare (collects Thunderbolts vol. 2 #7-12, 136, softcover, October 2013, )
Thunderbolts Volume 3: Infinity (collects Thunderbolts vol. 2 #13-19, 136, softcover, January 2014, )
Thunderbolts Volume 4: No Mercy (collects Thunderbolts vol. 2 #20-26, 160, softcover, August 2014, )
Thunderbolts Volume 5: Punisher vs. the Thunderbolts (collects Thunderbolts Vol. 2 27–32, 168, softcover, January 2015, )
References
External links
Thunderbolts at the Unofficial Handbook of Marvel Comics Creators
1997 comics debuts
Comics by Fabian Nicieza
Comics by Jim Zub
Comics by Kurt Busiek
Comics by Warren Ellis
Marvel Comics titles |
```objective-c
/* Make a string describing file modes.
Inc.
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 */
#ifndef FILEMODE_H_
# include <sys/types.h>
# include <sys/stat.h>
/* Get the declaration of strmode. */
# if HAVE_DECL_STRMODE
# include <string.h> /* Mac OS X, FreeBSD, OpenBSD */
# include <unistd.h> /* NetBSD */
# endif
# ifdef __cplusplus
extern "C" {
# endif
# if !HAVE_DECL_STRMODE
extern void strmode (mode_t mode, char *str);
# endif
extern void filemodestring (struct stat const *statp, char *str);
# ifdef __cplusplus
}
# endif
#endif
``` |
Rzhanaya Polyana () is a natural area in Krasnodar Krai, Russia, located not far from Krasnaya Polyana.
Home of the Sliding Center Sanki, it hosted bobsleigh, luge, and skeleton events for the 2014 Winter Olympics held in Sochi.
References
Bobsleigh and luge track for Sochi will be built in Rzhanaya Polyana. at the Fédération Internationale de Luge de Course (20 May 2009 article accessed 23 September 2009.)
Venues of the 2014 Winter Olympics
Sochi
Ski areas and resorts in Russia
Adlersky City District
Geography of Russia |
```objective-c
#ifndef TACO_ITERATION_GRAPH_H
#define TACO_ITERATION_GRAPH_H
#include <memory>
#include <vector>
namespace taco {
class TensorVar;
class IndexVar;
class IndexExpr;
class Assignment;
class TensorPath;
enum class IndexVarType {
Free,
Sum
};
/// An iteration graph constist of index variables arranged in a forest
/// together with tensor paths super-imposed on the forest.
/// - The iteration graph is arranged in a forest decomposition where all
/// tensor paths move from index variables higher in the tree to index
/// variables strictly lower in the tree.
/// - The tensor paths describe how to iterate over the index variables through
/// the indices of the corresponding (sparse or dense) tensors.
class IterationGraph {
public:
IterationGraph();
/// Creates an iteration graph for a tensor with a defined expression.
static IterationGraph make(Assignment);
/// Returns the iteration graph roots; the index variables with no parents.
const std::vector<IndexVar>& getRoots() const;
/// Returns the children of the index variable
const std::vector<IndexVar>& getChildren(const IndexVar&) const;
/// Returns the parent of the index variable
const IndexVar& getParent(const IndexVar&) const;
/// Returns the ancestors of the index variable including itself.
std::vector<IndexVar> getAncestors(const IndexVar&) const;
/// Returns all descendant of the index variable, including itself.
std::vector<IndexVar> getDescendants(const IndexVar&) const;
/// Returns the tensor paths of the operand tensors in the iteration graph.
const std::vector<TensorPath>& getTensorPaths() const;
/// Returns the tensor path corresponding to a tensor read expression.
const TensorPath& getTensorPath(const IndexExpr&) const;
/// Returns the tensor path of the result tensor.
const TensorPath& getResultTensorPath() const;
/// Returns the index variable type.
IndexVarType getIndexVarType(const IndexVar&) const;
/// Returns true iff the index variable is free.
bool isFree(const IndexVar&) const;
/// Returns true iff the index variable is a reduction.
bool isReduction(const IndexVar&) const;
/// Returns true if the index variable is the only free var in its subtree.
bool isLastFreeVariable(const IndexVar&) const;
/// Returns true if the index variable is the ancestor of any free variable.
bool hasFreeVariableDescendant(const IndexVar&) const;
/// Returns true if the index variable has a reduction variable ancestor.
bool hasReductionVariableAncestor(const IndexVar&) const;
/// Returns the index expression at the given index variable.
const IndexExpr& getIndexExpr(const IndexVar&) const;
/// Print an iteration graph as a dot file.
void printAsDot(std::ostream&);
/// Print an iteration graph.
friend std::ostream& operator<<(std::ostream&, const IterationGraph&);
private:
struct Content;
std::shared_ptr<Content> content;
};
}
#endif
``` |
Daviess County is a county in the U.S. state of Indiana. As of the 2020 United States Census, the population was 33,381. The county seat is Washington. About 15% of the county's population is Amish of Swiss origin, as of 2017.
History
After the American Revolutionary War was settled, the fledgling nation created the Northwest Territory, tentatively divided into two counties. The area that would become the state of Indiana in 1816 was included in the original Knox County. As the area became more settled, Knox was partitioned into smaller counties, the last of which was the present-day Daviess, authorized on 2 February 1818. The boundaries of Daviess were reduced on 21 December 1818 by the formation of Owen County, and on 17 January 1820 by the formation of Martin County. It has retained its present boundary since 1820.
Daviess County was named for Major Joseph Hamilton Daveiss, U.S. District Attorney for Kentucky, killed at the Battle of Tippecanoe in 1811. The earliest settlements were along the White River, which allowed crops and timber to be transported to distant markets. The northeast part of the county was heavily forested, and timber industry flourished in the first half of the nineteenth century. Daviess County shares its namesake with another nearby Daviess County of Kentucky. Both Counties are in the Illinois-Indiana-Kentucky Tri-State Area.
Geography
The terrain of Daviess County is hilly, with its area completely devoted to agriculture or urban development. Its highest elevation ( ASL) is a rise NNE of Farlen. The county is drained by the White River flowing to the southwest, whose two main forks (East White and West White) come together at the county's SW corner. The county's west boundary is defined by the West White River's course and its south boundary is defined by the East White River's course; their confluence defines the county's corner point.
According to the 2010 census, Daviess County has a total area of , of which (or 98.31%) is land and (or 1.69%) is water.
Adjacent counties
Greene County - north
Martin County - east
Dubois County - southeast
Pike County - southwest
Knox County - west
Transit
Washington Transit System
Major highways
Climate and weather
In recent years, average temperatures in Washington have ranged from a low of in January to a high of in July, although a record low of was recorded in December 1989 and a record high of was recorded in July 1930. Average monthly precipitation ranged from in February to in May.
Demographics
As of the 2010 United States Census, there were 31,648 people, 11,329 households, and 8,116 families in the county. The population density was . There were 12,471 housing units at an average density of . The racial makeup of the county was 95.0% white, 0.5% black or African American, 0.5% Asian, 0.2% American Indian, 2.6% from other races, and 1.1% from two or more races. Those of Hispanic or Latino origin made up 4.2% of the population. In terms of ancestry, 31.4% were German, 13.1% were Irish, 10.8% were American, and 10.6% were English.
Of the 11,329 households, 36.8% had children under the age of 18 living with them, 57.1% were married couples living together, 10.0% had a female householder with no husband present, 28.4% were non-families, and 24.6% of all households were made up of individuals. The average household size was 2.74 and the average family size was 3.29. The median age was 35.4 years.
The median income for a household in the county was $47,697 and the median income for a family was $53,769. Males had a median income of $36,405 versus $29,652 for females. The per capita income for the county was $20,254. About 7.6% of families and 12.3% of the population were below the poverty line, including 16.7% of those under age 18 and 7.6% of those age 65 or over.
2020 census
Amish community
The Amish (Swiss Amish) community in Daviess County, established in 1868, had a total population of 4,855 people (in 29 congregations) in 2017 or 14.6% of the county's population, stretching along the eastern side of the county from Alfordsville, to Cannelburg and Montgomery to Odon.
Religion
*"Nones" is an unclear category. It is a heterogenous group of the not religious and intermittently religious. Researchers argue that most of the "Nones" should be considered "unchurched", rather than objectively nonreligious; especially since most "Nones" do hold some religious-spiritual beliefs and a notable amount participate in behaviors. For example, 72% of American "Nones" believe in God or a Higher Power.
Communities
City
Washington
Towns
Alfordsville
Cannelburg
Elnora
Montgomery
Odon
Plainville
Census-designated place
Raglesville
Other unincorporated places
Black Oak
Capehart
Cornettsville
Corning
Epsom
Farlen
Glendale
Graham
Hudsonville
Jordan
Maysville
Pennyville
South Washington
Townships
Barr
Bogard
Elmore
Harrison
Madison
Reeve
Steele
Van Buren
Veale
Washington
Government
The county government is a constitutional body, and is granted specific powers by the Constitution of Indiana, and by the Indiana Code. The county council is the legislative branch of the county government and controls spending and revenue collection in the county. Representatives are elected from county districts. The council members serve four-year terms. They are responsible for setting salaries, the annual budget, and special spending. The council also has limited authority to impose local taxes, in the form of an income and property tax that is subject to state level approval, excise taxes, and service taxes.
A board of commissioners constitutes the county's executive body. Commissioners are elected county-wide, in staggered four-year terms. One commissioner serves as president. The board executes the council's legislative acts, collects revenue, and manages the county's government functions.
The county maintains a small claims court that can handle some civil cases. The judge on the court is elected to a term of four years and must be a member of the Indiana Bar Association. The judge is assisted by a constable who is also elected to a four-year term. In some cases, court decisions can be appealed to the state level circuit court.
The county has other elected offices, including sheriff, coroner, auditor, treasurer, recorder, surveyor, and circuit court clerk. Each of these elected officers serves a term of four years and oversees a different part of county government. Members elected to county government positions are required to declare party affiliations and to be residents of the county.
Each township has a trustee who administers rural fire protection and ambulance service, provides poor relief, manages cemetery care, and performs farm assessment, among other duties. The trustee is assisted in these duties by a three-member township board. The trustees and board members are elected to four-year terms.
Daviess County is part of Indiana's 8th congressional district; Indiana Senate districts 39 and 48; and Indiana House of Representatives districts 45, 63 and 64.
Political culture
Daviess County is a Republican stronghold in presidential elections and is consistently one of the most Republican counties in Indiana, giving John McCain 67% of the vote in 2008 and Mitt Romney nearly 75% of the vote in 2012.
See also
National Register of Historic Places listings in Daviess County, Indiana
References
Indiana counties
1818 establishments in Indiana
Populated places established in 1818
Southwestern Indiana |
Prisoner reentry is the process by which prisoners who have been released return to the community. Many types of programs have been implemented with the goal of reducing recidivism and have been found to be effective for this purpose. Consideration for the conditions of the communities formerly incarcerated individuals are re-entering, which are often disadvantaged, is a fundamental part of successful re-entry.
A 2006 study done by the Manpower Demonstration Research Corporation statistically evaluated the effectiveness of prisoner reentry programs on the criteria scale of working, not working, promising, and unknown. Findings classify employment-oriented programs as working, drug rehabilitation programs as working, educational programs as promising, and halfway house programs as working.
A 2015 article from The New York Times Magazine commented, "It wasn't until the mid-2000s that this looming 'prisoner re-entry crisis' became a fixation of sociologists and policy makers, generating a torrent of research, government programs, task forces, nonprofit initiatives and conferences now known as the 're-entry movement'." At the end of 2001, there were approximately 5.6 million U.S. adults who had been in the incarceration system. By the end of 2004, more than 3% of U.S. adults were incarcerated or on probation or parole. With prisons becoming overcrowded, there is more political focus on depopulating prisons. In 2016, approximately 600,000 individuals were released from prison and millions were in and out of county jail systems.
The abrupt re-entrance into society means formerly incarcerated individuals require support to reintegrate. The United States federal government allocates some funding for re-entry programs, but there is currently a lack of sufficient resources. Re-entry programs are now receiving more attention from public policy and criminal justice scholars.
Resources for prisoner re-entry programs
In the past few decades, correctional institutions have seen a shift, with prisoners serving indeterminate sentences and release being assessed by parole boards, to offenders being released from prison after serving determinate sentences. However, those released are not receiving sufficient preparation for returning to their communities due to limited in-prison and post-release reentry programs; this inadequate structure for re-entry directly influences the possibility of recidivism, also referred to as the "revolving door". United States spending for corrections is approximately $80 billion a year, with re-entry receiving the least amount of fiscal attention relative to other parts of the criminal justice system process. From 2001 to 2004, the United States' federal government allocated over $100 million for reentry programs. Without increased resources for this target area proportional to that spent on control-oriented aspects of incarceration, the issue that remains is the expansion of access and participation for inmates. While the area of reentry program development is still growing, assessments demonstrate their efficacy for transitioning ex-offenders back into society and reducing recidivism. The potential for well-resourced reentry program has yet to be realized, but public policy and criminal justice scholars believe this to be a deserving area for funding to be re-allocated and prioritized.
Kinds of re-entry programs
There are different types of re-entry programs. They can focus on assisting with employment, securing stable housing, or providing healthcare services. Some programs serve sub-sectors of the formerly incarcerated population such as women or juveniles.
Employment
With approximately 2 million people incarcerated, the prison population constitutes a large portion of the U.S. labor force. An essential argument for putting prisoners to work is in-prison productivity translating to preparation for entering the workforce post-release. Prison labor is cost-effective for tax payers, allows prisoners to contribute to their families from inside through the generation of income, and can be a form of restorative justice for victims. Poor resources and a prison infrastructure unfit for large-scale labor serve as barriers for establishing effective employment re-entry programs in-prison and post-release, which would include making livable wages, vocational training, education, and skill development accessible to the U.S. prison population. Current funding levels only have the capacity to provide a small percentage of prisoners the opportunity to engage in "commercially rewarding work."
The "Returning Home Study" conducted by the Urban Institute from 2001 to 2006 found that ex-prisoners who worked before imprisonment, and those who find employment soon after release, are less likely to be re-incarcerated within a year of release. The same study found that releasing prisoners to parole supervision both reduces the likelihood that they will engage in substance use and makes it easier for them to find employment after release.
Programs assisting ex-offenders to find employment
The Safer Foundation
Project RIO (Re-Integration of Offenders)
The Corrections Clearinghouse
The Center for Employment Opportunities
Housing
In a study from New Zealand, the ability to secure stable housing was found to reduce the likeliness of recidivism by 20 percent. Housing providers struggle to make housing available to ex-offenders because of safety concerns and failure to accommodate to the specific needs of formerly individuals without guaranteed income or access to social welfare support. In New York City, "more than 54 percent of people released from prison moved straight into the city's shelter system in 2017."
Across the country, initiatives are being made to assist ex-offenders find housing.
In Alameda County, California, homeowners are partnering with formerly incarcerated individuals and allowing them to rent. At Impact Justice, ex-offenders are paired with homeowners for housing and guidance for reintegration.
In Delaware, a commission was created to increase access and support for Delaware state inmates to secure housing and employment.
In Washington state, the Tacoma Housing Authority is offering housing assistance for ex-offender, at-risk college students.
In Seattle and Washington D.C., landlords are no longer allowed to screen for felony convictions on rental applications.
Healthcare
Other reentry programs focus on improving health among ex-prisoners, which tends to be significantly worse than that of people who have never been imprisoned. While incarcerated, prisoners face higher rates of chronic and infectious diseases, mental illness, and substance use disorders. After release, the difficulties faced during reentry exacerbate these health conditions, which is demonstrated by a link between incarceration history and poorer physical and mental health. Formerly incarcerated individuals face a lack of access to primary care services, mental health conditions, low health literacy, and difficulty obtaining medication access after release. Along with these reintegration barriers, formerly incarcerated individuals also face toxic social stress since they have to adjust to a new life and the transitional period is very unstable. The challenges reconnecting with their communities lead to a lack of social support, which is usually crucial to preventing negative health outcomes. These factors create a specific need for healthcare services during the period of reentry. A 2007 study found that, during the first two weeks after release, the risk of death for formerly incarcerated individuals was 12.7 times that of general community members.
Healthcare-focused reentry programs are designed to aid in the transition back to society, improve health outcomes for the formerly incarcerated population, and reduce recidivism.
Healthcare reentry programs can focus on factors such as discharge planning, substance use disorder treatment, or mental health. A 2020 study evaluated three types of healthcare reentry programs: a swift, certain, fair (SCF) program for drug-involved probationers; an aftercare program for drug-involved offenders; and, a comprehensive reentry program. In the SCF approach, patients were given graduated punishments that target abstinence through frequent drug tests and monitoring, and this model was found to be less effective in reducing recidivism. The second program was a residential program of recovery homes for individuals dealing with substance use disorder. Residents live together and provide a supportive, sober social network. This program increased employment and reduced substance use, but it did not affect incarceration levels. The third program provided holistic health services through institutional caseworkers and supervision agents in the community. It provided planning, support, and direction for individuals to address their needs. This type of program was found to be most effective in reducing recidivism.
Additionally, healthcare reentry programs vary in their timing. Some begin only after release, while others begin while the individual is still incarcerated. A 2013 study evaluating best practices in healthcare-focused reentry programs found that programs that began discharge planning prior to release and were based in the individual's community were more successful in improving health outcomes. Discharge planning aids in continuity of care since individuals are transitioning from the prison healthcare system to their community healthcare system. Success of this practice was seen in the Connecticut Building Bridges Community Reentry Initiative (CRI) in 2004. The program included personal meetings with case managers months before release to discuss the individual’s goals for their health and to assess any potential risk factors for health issues after reentry. By addressing holistic health needs one month before release, the program had over 60% of its participants meet goals related to health supports and their recidivism rate was only 16%.
Since healthcare during incarceration is managed by the government, there is debate surrounding responsibility for healthcare during the reentry period. In 1976, the U.S. Supreme Court ruling in Estelle v. Gamble stated that the government has an obligation and responsibility to provide adequate medical care to the incarcerated population, but there was no mention made of responsibility for healthcare on discharge or after release. One perspective is that the government does have an obligation to ensure continuity of care after release. Another perspective is that reentry should be based in the community and supported by private providers. Private providers have greater independence to make quick decisions since they can avoid bureaucracy. Private providers are also “not constrained by civil service rules and salary scales”. One compromise position in this debate is to use government funding and grants to establish connections to private/community-based programs upon release.
Some healthcare reentry programs are independent organizations, while others are directly integrated in healthcare systems. One example of a healthcare-focused reentry program is the Transitions Clinic Network. Funding for this program is from a variety of sources, including different government funds and grants. This organization aims to build a healthcare model for individuals returning to the community from incarceration. They work with primary care clinics across the country to adopt a model of healthcare that improves health and reentry outcomes. They employ community health workers with a history of incarceration to work with patients, which helps ensure that the lived experiences of the incarcerated community are incorporated in the development of the program.
Some existing healthcare organizations and hospitals offer healthcare reentry services:
Health Right 360
RISE Reentry Program
Re-entry for women prisoners
Women prisoners and formerly incarcerated women are advocating for the need for gender-specific re-entry programs in-prison and post-release, specifically focused on healthcare, substance abuse, mental illness, and family reunification.
For women prisoners concerned about family reunification post-release, comes with challenges of securing housing and employment, necessary for meeting child welfare requirements. In cases where these requirements cannot be met, women ex-offenders claim to benefit from rehabilitative counseling to deal with the strain incarceration has on the relationship between mothers and children.
Juvenile Re-entry
Juveniles in the justice system often require different treatment and consideration than their adult counterparts. While there is constantly ongoing debate about the ways in which juvenile punishment should be given (whether it should be the same level of severity or differ in approach), often in the form of policy and moral debate, one of the most common methods of responding to juvenile offense is placing juveniles in re-entry programs.
Juvenile Reentry is a culmination of services, often presented in the form of programs, that help to reintegrate displaced juveniles back into the community. These programs are often designed to discourage juvenile delinquency and prevent such crimes from happening again.
Juvenile Re-entry programs involve many stages with each stage playing its own role in helping the juvenile to reform. There is the entry phase, placement phase, transitional phase, and community-based aftercare phase. Each of these stages involves varying degrees of supervision over the juvenile while the delinquent is given safer surroundings and taught valuable lessons and ways of life that ultimately will help them to be a more valuable and safe addition to the community.
See also
Collateral consequences of criminal conviction
United States incarceration rate
Incarceration in the United States
Incarceration prevention in the United States
Incarceration of women in the United States
Penal labor in the United States
Prison healthcare
References
Further reading
Penal system in the United States |
Bayfair Center (orig. Bay-Fair, later Bay Fair, Bayfair Mall) is a regional shopping mall and power center in San Leandro, California. It was among the first malls in the East Bay of the San Francisco Bay Area. Anchor stores are Macy's, Target, Kohl's, Staples, Old Navy, PetSmart, Bed Bath & Beyond, Cinemark, and 24 Hour Fitness.
History
Launch (1950s)
Announced in April 1953, the shopping center was built on the 48-acre site of the former Oakland Speedway automobile racing stadium, and cost $25 million to build, and an additional $6 million to build the anchor department store, a , three-story Macy's. The mall construction did not begin until 1956.
The architect (including for the interior) for the Macy's store was John Savage Bolles, who had designed Candlestick Park and also designed interiors for Macy's Hilltop Mall in Richmond, Hillsdale Shopping Center in San Mateo, and Valley Fair in San Jose, and interiors for the renovation of the Macy's Union Square San Francisco flagship store.
Macy's was the first unit to open, on August 8, 1957, with mall shops opening in the months following. On November 8, 1957, 19 new stores (besides Macy's), including a supermarket, celebrated their grand opening.
The mall shop area (outside Macy's) was open-air and in an L-shape, split-level (i.e. on two levels, but not two stories one on top of another). It claimed to be the first shopping center in the Western United States to be built across two stories.
Expansion (1960s–1990s)
The mall continued to expand, and a new department store anchor, Montgomery Ward opened a two-story, store and auto center on August 4, 1971. With Ward's the mall had grown to in size and had 62 stores.
In 1972, Bay Area Rapid Transit opened Bay Fair station adjacent to the mall to the south, providing access via rapid rail transit.
In 1977, owner Macy's announced a major renovation of the mall. It was enclosed and added escalators, air conditioning and carpeting. On the ground level, of retail space was added on and a further atrium and "specialty court" for boutiques and restaurants. On the new second level, of retail space was added. In a second pase, of retail space was adjacent to Macy's and elsewhere. In total, of space was added for about 40 additional shops, for a total of about 100 shops.
A T.J. Maxx anchor opened April 28, 1994.
Hybrid power center (2000s–present)
In 2001, Montgomery Ward went bankrupt and closed its stores nationwide. The abandoned Ward's store was demolished and in October 2002, a Target Greatland opened on the site.
Also In late 2002, the mall was acquired by Chicago-based M & J Wilkow Ltd. The updated shopping center measured . Bayfair's owner planned to remodel the ailing center into an open-air power center, renamed "Bayfair/580," which would have several big-box tenants and upscale "lifestyle-oriented" stores. The plan never came to fruition, however, and the mall was sold to Madison Marquette in late 2003.
The Macy's continues to operate and the mall is enclosed, but by 2012, the other anchors were more typical of those in a power center: big box stores Kohl's, Staples, Old Navy, PetSmart, Bed Bath & Beyond, and 24 Hour Fitness. There was also a Cinemark cinema multiplex. According to the city of San Leandro in a 2016 study, Bayfair has been successful in transforming itself to a tenant mix that meets with current needs.
Plans for transit-oriented village
In 2018, the city of San Leandro adopted a plan to transform the Bay Fair neighborhood, including the mall and areas around it, into a transit-oriented "village", a high-density, mixed-use neighborhood with a street grid of small blocks to encourage walking and cycling, and including small parks and space for community events.
References
External links
"Market Analysis, Bay Fair BART TOD Specific Plan", City of San Leandro, 2016
Shopping malls in the San Francisco Bay Area
Shopping malls in Alameda County, California
San Leandro, California |
The 2010 Gulf Ice Hockey Championship was the first Gulf Ice Hockey Championship. It took place between 25 May and 30 May 2010 in Kuwait City, Kuwait. The United Arab Emirates won the tournament winning all three of their games and finishing first in the standings. Kuwait finished second and Saudi Arabia finished in third place.
Overview
The 2010 Gulf Ice Hockey Championship began on 25 May 2010 in Kuwait City, Kuwait with the games being played at the National Ice Skating Rink. The Oman and Saudi Arabia their made their debut in international competition. The event was organised by the Kuwait Ice Hockey Association and supervised by the International Ice Hockey Federation who also provided referees. The United Arab Emirates won the tournament, winning all three games and finishing first in the standings. Kuwait finished second after losing only to the United Arab Emirates and Saudi Arabia finished in third place.
Standings
Fixtures
References
Gulf
Gulf Ice Hockey Championship
Gulf Ice Hockey Championship
International ice hockey competitions hosted by Kuwait |
Ecoblock or Eco-block can refer to:
Compressed earth block, a building material sometimes called "Ecoblock" when mixed with cement
Eco-Block, a type of paving stone
Ecology block, a large stone for retaining walls
See also
Eco-Brick (disambiguation) |
```c++
/**
* Before running this C++ code example, set up your development environment, including your credentials.
*
* For more information, see the following documentation topic:
*
* path_to_url
*
* For information on the structure of the code examples and how to build and run the examples, see
* path_to_url
*
**/
#include <aws/core/Aws.h>
#include <aws/iot/IoTClient.h>
#include <aws/iot/model/DescribeThingRequest.h>
#include <iostream>
#include "iot_samples.h"
// snippet-start:[cpp.example_code.iot.DescribeThing]
//! Describe an AWS IoT thing.
/*!
\param thingName: The name for the thing.
\param clientConfiguration: AWS client configuration.
\return bool: Function succeeded.
*/
bool AwsDoc::IoT::describeThing(const Aws::String &thingName,
const Aws::Client::ClientConfiguration &clientConfiguration) {
Aws::IoT::IoTClient iotClient(clientConfiguration);
Aws::IoT::Model::DescribeThingRequest request;
request.SetThingName(thingName);
Aws::IoT::Model::DescribeThingOutcome outcome = iotClient.DescribeThing(request);
if (outcome.IsSuccess()) {
const Aws::IoT::Model::DescribeThingResult &result = outcome.GetResult();
std::cout << "Retrieved thing '" << result.GetThingName() << "'" << std::endl;
std::cout << "thingArn: " << result.GetThingArn() << std::endl;
std::cout << result.GetAttributes().size() << " attribute(s) retrieved"
<< std::endl;
for (const auto &attribute: result.GetAttributes()) {
std::cout << " attribute: " << attribute.first << "=" << attribute.second
<< std::endl;
}
}
else {
std::cerr << "Error describing thing " << thingName << ": " <<
outcome.GetError().GetMessage() << std::endl;
}
return outcome.IsSuccess();
}
// snippet-end:[cpp.example_code.iot.DescribeThing]
/*
*
* main function
*
* Usage: 'run_describe_thing <thing_name>'
*
*/
#ifndef EXCLUDE_ACTION_MAIN
int main(int argc, char **argv) {
if (argc != 2) {
std::cout << "Usage: 'run_describe_thing <thing_name>'" << std::endl;
return 1;
}
Aws::SDKOptions options;
Aws::InitAPI(options);
{
const Aws::String thingName(argv[1]);
Aws::Client::ClientConfiguration clientConfig;
// Optional: Set to the AWS Region (overrides config file).
// clientConfig.region = "us-east-1";
AwsDoc::IoT::describeThing(thingName, clientConfig);
}
Aws::ShutdownAPI(options);
return 0;
}
#endif // EXCLUDE_ACTION_MAIN
``` |
Ettore Simonetti (1857, Rome - 1909, Rome) was an Italian painter and watercolorist, who specialized in Orientalist works and historical genre scenes.
Biography
His father, Francesco, was a goldsmith and carver. His mother, Carolina, née Raffaelli, came from a family of mosaic artists, with a workshop in Rome. One of his ancestors, Giacomo Raffaelli, helped to develop the modern micromosaic technique. In 1869, he attended a course on geometry at the Accademia di San Luca, and was awarded a prize for perspective. Ettore was brother of the painter and antique dealer Attilio Simonetti.
He was part of a group of watercolorists that included Enrico Tarenghi, Giuseppe Aureli, and Giulio Rosati. Although it would appear that they never travelled to North Africa or the Middle East, they created Orientalist works, based on photographs, other artists' illustrations, and traveler's descriptions.
Much if his work was heavily influenced by his older brother, Attilio who, in 1875, was one of the cofounders of the . A follower of the Spanish artist, Mariano Fortuny and an organizer of festivals, Attilio had a large collection of carpets, dresses, damask fabrics, silks, slippers, brass, ceramic and copper objects, all original and from the Near East. With these accessories, Ettore was able to reconstruct the scenes for his paintings. Many of his works employed the same figures; rearranged or in different settings.
He also had a passion for the Eighteenth Century, with counts, musketeers, cardinals and ladies in period costumes. His influences, in this case, came from the Baroque painter, Pietro Longhi.
In 1882, he participated in an exhibition of the "Associazione Artistica Internazionale" followed, in 1899, by one at the "Società degli Amatori e Cultori di belle Arti" and, in 1900 at the "Società degli acquarellisti". He occasionally taught at the nude drawing school at the Accademia di Belle Arti di Roma.
His nephew Amedeo, studied with him and also became an Orientalist painter.
References
Further reading
Renato Mammucari, La Società degli acquarellisti in Roma, Vela, 1987
Gian Francesco Lomonaco, Acquerelli dell'Ottocento. La Società degli Acquarellisti a Roma, Fratelli Palombi, 1987
Giancarlo Belardi and Silvia Rumor, Associazione degli acquarellisti in Roma: mostra di acquerelli dalla fine dell'800 all'inizio del '900, Belardi Rumor Galleria antiquaria, 1992
External links
More works by Simonetti @ ArtNet
1857 births
1909 deaths
Italian painters
Italian genre painters
Italian orientalists
Italian watercolourists
Painters from Rome |
Minioniella is a genus of sea snails, marine gastropod mollusks in the family Prodotiidae.
Species
Minioniella heleneae Fraussen & Stahlschmidt, 2016
References
Fraussen K. & Stahlschmidt P. (2016). Revision of the Clivipollia group (Gastropoda: Buccinidae: Pisaniinae) with description of two new genera and three new species. Novapex. 17(2-3): 29-46
Prodotiidae |
Pain management is an aspect of medicine and health care involving relief of pain (pain relief, analgesia, pain control) in various dimensions, from acute and simple to chronic and challenging. Most physicians and other health professionals provide some pain control in the normal course of their practice, and for the more complex instances of pain, they also call on additional help from a specific medical specialty devoted to pain, which is called pain medicine.
Pain management often uses a multidisciplinary approach for easing the suffering and improving the quality of life of anyone experiencing pain, whether acute pain or chronic pain. Relief of pain in general (analgesia) is often an acute affair, whereas managing chronic pain requires additional dimensions.
A typical multidisciplinary pain management team may include: medical practitioners, pharmacists, clinical psychologists, physiotherapists, occupational therapists, recreational therapists, physician assistants, nurses, and dentists. The team may also include other mental health specialists and massage therapists. Pain sometimes resolves quickly once the underlying trauma or pathology has healed, and is treated by one practitioner, with drugs such as pain relievers (analgesics) and occasionally also anxiolytics.
Effective management of chronic (long-term) pain, however, frequently requires the coordinated efforts of the pain management team. Effective pain management does not always mean total eradication of all pain. Rather, it often means achieving adequate quality of life in the presence of pain, through any combination of lessening the pain and/or better understanding it and being able to live happily despite it. Medicine treats injuries and diseases to support and speed healing. It treats distressing symptoms such as pain and discomfort to reduce any suffering during treatment, healing, and dying.
The task of medicine is to relieve suffering under three circumstances. The first is when a painful injury or pathology is resistant to treatment and persists. The second is when pain persists after the injury or pathology has healed. Finally, the third circumstance is when medical science cannot identify the cause of pain. Treatment approaches to chronic pain include pharmacological measures, such as analgesics (pain killer drugs), antidepressants, and anticonvulsants; interventional procedures, physical therapy, physical exercise, application of ice or heat; and psychological measures, such as biofeedback and cognitive behavioral therapy.
Defining pain
In the nursing profession, one common definition of pain is any problem that is "whatever the experiencing person says it is, existing whenever the experiencing person says it does".
Pain management includes patient and communication about the pain problem. To define the pain problem, a health care provider will likely ask questions such as:
How intense is the pain?
How does the pain feel?
Where is the pain?
What, if anything, makes the pain lessen?
What, if anything, makes the pain increase?
When did the pain start?
After asking such questions, the health care provider will have a description of the pain. Pain management will then be used to address that pain.
Adverse effects
There are many types of pain management. Each have their own benefits, drawbacks, and limits.
A common challenge in pain management is communication between the health care provider and the person experiencing pain. People experiencing pain may have difficulty recognizing or describing what they feel and how intense it is. Health care providers and patients may have difficulty communicating with each other about how pain responds to treatments. There is a risk in many types of pain management for the patient to take treatment that is less effective than needed or which causes other difficulties and side effects. Some treatments for pain can be harmful if overused. A goal of pain management for the patient and their health care provider is to identify the amount of treatment needed to address the pain without going beyond that limit.
Another problem with pain management is that pain is the body's natural way of communicating a problem. Pain is supposed to resolve as the body heals itself with time and pain management. Sometimes pain management covers a problem, and the patient might be less aware that they need treatment for a deeper problem.
Physical approach
Physical medicine and rehabilitation
Physical medicine and rehabilitation uses a range of physical techniques such as heat and electrotherapy, as well as therapeutic exercises and behavioral therapy. These techniques are usually part of an interdisciplinary or multidisciplinary program that might also include pharmaceutical medicines. Spa therapy has showed positive effects in reducing pain among patients with chronic low back pain. However, there are limited studies looking at this approach. Studies have shown that kinesiotape could be used on individuals with chronic low back pain to reduce pain. The Center for Disease Control recommends that physical therapy and exercise can be prescribed as a positive alternative to opioids for decreasing one's pain in multiple injuries, illnesses, or diseases. This can include chronic low back pain, osteoarthritis of the hip and knee, or fibromyalgia. Exercise alone or with other rehabilitation disciplines (such as psychologically based approaches) can have a positive effect on reducing pain. In addition to improving pain, exercise also can improve one's well-being and general health.
Manipulative and mobilization therapy are safe interventions that likely reduce pain for patients with chronic low back pain. However, manipulation produces a larger effect than mobilization.
Specifically in chronic low back pain, education about the way the brain processes pain in conjunction with routine physiotherapy interventions may provide short term relief of disability and pain.
Exercise interventions
Physical activity interventions, such as tai chi, yoga and Pilates, promote harmony of the mind and body through total body awareness. These practices incorporate breathing techniques, meditation and a wide variety of movements, while training the body to perform functionally by increasing strength, flexibility, and range of motion. Physical activity and exercise may improve chronic pain (pain lasting more than 12 weeks), and overall quality of life, while minimizing the need for pain medications. More specifically, walking has been effective in improving pain management in chronic low back pain.
TENS
Transcutaneous electrical nerve stimulation (TENS) is a self-operated portable device intended to help regulate and control chronic pain via electrical impulses. Limited research has explored the effectiveness of TENS in relation to pain management of multiple sclerosis (MS). MS is a chronic autoimmune neurological disorder, which consists of the demyelination of the nerve axons and disruption of nerve conduction velocity and efficiency. In one study, electrodes were placed over the lumbar spine and participants received treatment twice a day and at any time when they experienced a painful episode. This study found that TENS would be beneficial to MS patients who reported localized or limited symptoms to one limb. The research is mixed with whether or not TENS helps manage pain in MS patients.
Transcutaneous electrical nerve stimulation has been found to be ineffective for lower back pain. However, it might help with diabetic neuropathy as well as other illnesses.
tDCS
Transcranial direct current stimulation (tDCS) is a non-invasive technique of brain stimulation that can modulate activity in specific brain cortex regions, and it involves the application of low-intensity (up to 2 mA) constant direct current to the scalp through electrodes in order to modulate excitability of large cortical areas. tDCS may have a role in pain assessment by contributing to efforts in distinguishing between somatic and affective aspects of pain experience. Zaghi and colleagues (2011) found that the motor cortex, when stimulated with tDCS, increases the threshold for both the perception of non-painful and painful stimuli. Although there is a greater need for research examining the mechanism of electrical stimulation in relation to pain treatment, one theory suggests that the changes in thalamic activity may be due the influence of motor cortex stimulation on the decrease in pain sensations.
In relation to MS, a study found that after daily tDCS sessions resulted in an individual's subjective report of pain to decrease when compared to a sham condition. In addition, the study found a similar improvement at 1 to 3 days before and after each tDCS session.
Fibromyalgia is a disorder in which an individual experiences dysfunctional brain activity, musculoskeletal pain, fatigue, and tenderness in localized areas. Research examining tDCS for pain treatment in fibromyalgia has found initial evidence for pain decreases. Specifically, the stimulation of the primary motor cortex resulted in significantly greater pain improvement in comparison to the control group (e.g., sham stimulation, stimulation of the DLPFC). However, this effect decreased after treatment ended, but remained significant for three weeks following the extinction of treatment.
Acupuncture
Acupuncture involves the insertion and manipulation of needles into specific points on the body to relieve pain or for therapeutic purposes. An analysis of the 13 highest quality studies of pain treatment with acupuncture, published in January 2009 in the British Medical Journal, was unable to quantify the difference in the effect on pain of real, sham and no acupuncture. A systematic review in 2019 reported that acupuncture injection therapy was an effective treatment for patients with nonspecific chronic low back pain, and is widely used in Southeast Asian countries.
Light therapy
Research has not found evidence that light therapy such as low level laser therapy is an effective therapy for relieving low back pain.
Sound therapy
Audioanalgesia and music therapy are both examples of using auditory stimuli to manage pain or other distress. They are generally viewed as insufficient when used alone, but also as helpful adjuncts to other forms of therapy.
Interventional procedures
Interventional radiology procedures for pain control, typically used for chronic back pain, include epidural steroid injections, facet joint injections, neurolytic blocks, spinal cord stimulators and intrathecal drug delivery system implants.
Pulsed radiofrequency, neuromodulation, direct introduction of medication and nerve ablation may be used to target either the tissue structures and organ/systems responsible for persistent nociception or the nociceptors from the structures implicated as the source of chronic pain. Radiofrequency treatment has been seen to improve pain in patients for facet joint low back pain. However, continuous radiofrequency is more effective in managing pain than pulsed radiofrequency.
An intrathecal pump used to deliver very small quantities of medications directly to the spinal fluid. This is similar to epidural infusions used in labour and postoperatively. The major differences are that it is much more common for the drug to be delivered into the spinal fluid (intrathecal) rather than epidurally, and the pump can be fully implanted under the skin.
A spinal cord stimulator is an implantable medical device that creates electric impulses and applies them near the dorsal surface of the spinal cord provides a paresthesia ("tingling") sensation that alters the perception of pain by the patient.
Intra-articular ozone therapy
Intra-articular ozone therapy has been seen to efficiently alleviate chronic pain in patients with knee osteoarthritis.
Psychological approach
Acceptance and commitment therapy
Acceptance and Commitment Therapy (ACT) is a form of cognitive behavioral therapy that focuses on behavior change rather than symptom change, includes methods designed to alter the context around psychological experiences rather than to alter the makeup of the experiences, and emphasizes the use of experiential behavior change methods. The central process in ACT revolves around psychological flexibility, which in turn includes processes of acceptance, awareness, a present-oriented quality in interacting with experiences, an ability to persist or change behavior, and an ability to be guided by one's values. ACT has an increased evidence base for range of health and behavior problems, including chronic pain. ACT influences patients to adopt a tandem process to acceptance and change, which allows for a greater flexibility in the focus of treatment.
Recent research has applied ACT successfully to chronic pain in older adults due to in part of its direction from individual values and being highly customizable to any stage of life. In line with the therapeutic model of ACT, significant increases in process variables, pain acceptance, and mindfulness were also observed in a study applying ACT to chronic pain in older adults. In addition, these primary results suggested that an ACT based treatment may significantly improve levels of physical disability, psychosocial disability, and depression post-treatment and at a three-month follow-up for older adults with chronic pain.
Cognitive behavioral therapy
Cognitive behavioral therapy (CBT) helps patients with pain to understand the relationship between their pain, thoughts, emotions, and behaviors. A main goal in treatment is cognitive (thinking, reasoning or remembering) restructuring to encourage helpful thought patterns. This will target healthy activities such as regular exercise and pacing. Lifestyle changes are also trained to improve sleep patterns and to develop better coping skills for pain and other stressors using various techniques (e.g., relaxation, diaphragmatic breathing, and even biofeedback).
Studies have demonstrated the usefulness of cognitive behavioral therapy in the management of chronic low back pain, producing significant decreases in physical and psychosocial disability. CBT is significantly more effective than standard care in treatment of people with body-wide pain, like fibromyalgia. Evidence for the usefulness of CBT in the management of adult chronic pain is generally poorly understood, due partly to the proliferation of techniques of doubtful quality, and the poor quality of reporting in clinical trials. The crucial content of individual interventions has not been isolated and the important contextual elements, such as therapist training and development of treatment manuals, have not been determined. The widely varying nature of the resulting data makes useful systematic review and meta-analysis within the field very difficult.
In 2020, a systematic review of randomized controlled trials (RCTs) evaluated the clinical effectiveness of psychological therapies for the management of adult chronic pain (excluding headaches). There is no evidence that behaviour therapy (BT) is effective for reducing this type of pain, however BT may be useful for improving a person's mood immediately after treatment. This improvement appears to be small, and is short term in duration. CBT may have a small positive short-term effect on pain immediately following treatment. CBT may also have a small effect on reducing disability and potential catastrophizing that may be associated with adult chronic pain. These benefits do not appear to last very long following the therapy. CBT may contribute towards improving the mood of an adult who experiences chronic pain, which could possibility be maintained for longer periods of time.
For children and adolescents, a review of RCTs evaluating the effectiveness of psychological therapy for the management of chronic and recurrent pain found that psychological treatments are effective in reducing pain when people under 18 years old have headaches. This beneficial effect may be maintained for at least three months following the therapy. Psychological treatments may also improve pain control for children or adolescents who experience pain not related to headaches. It is not known if psychological therapy improves a child or adolescents mood and the potential for disability related to their chronic pain.
Hypnosis
A 2007 review of 13 studies found evidence for the efficacy of hypnosis in the reduction of pain in some conditions. However the studies had some limitations like small study sizes, bringing up issues of power to detect group differences, and lacking credible controls for placebo or expectation. The authors concluded that "although the findings provide support for the general applicability of hypnosis in the treatment of chronic pain, considerably more research will be needed to fully determine the effects of hypnosis for different chronic-pain conditions."
Hypnosis has reduced the pain of some harmful medical procedures in children and adolescents. In clinical trials addressing other patient groups, it has significantly reduced pain compared to no treatment or some other non-hypnotic interventions. The effects of self hypnosis on chronic pain are roughly comparable to those of progressive muscle relaxation.
Hypnosis with analgesic (painkiller) has been seen to relieve chronic pain for most people and may be a safe and effective alternative to medications. However, high quality clinical data is needed to generalize to the whole chronic pain population.
Mindfulness meditation
A 2013 meta-analysis of studies that used techniques centered around the concept of mindfulness, concluded, "that MBIs [mindfulness-based interventions] decrease the intensity of pain for chronic pain patients." A 2019 review of studies of brief mindfulness-based interventions (BMBI) concluded that BMBI are not recommended as a first-line treatment and could not confirm their efficacy in managing chronic or acute pain.
Mindfulness-based pain management
Mindfulness-based pain management (MBPM) is a mindfulness-based intervention (MBI) providing specific applications for people living with chronic pain and illness. Adapting the core concepts and practices of mindfulness-based stress reduction (MBSR) and mindfulness-based cognitive therapy (MBCT), MBPM includes a distinctive emphasis on the practice of 'loving-kindness', and has been seen as sensitive to concerns about removing mindfulness teaching from its original ethical framework within Buddhism. It was developed by Vidyamala Burch and is delivered through the programs of Breathworks. It has been subject to a range of clinical studies demonstrating its effectiveness.
Medications
The World Health Organization (WHO) recommends a pain ladder for managing pain relief with pharmaceutical medicine. It was first described for use in cancer pain. However it can be used by medical professionals as a general principle when managing any type of pain. In the treatment of chronic pain, the three-step WHO Analgesic Ladder provides guidelines for selecting the appropriate medicine. The exact medications recommended will vary by country and the individual treatment center, but the following gives an example of the WHO approach to treating chronic pain with medications. If, at any point, treatment fails to provide adequate pain relief, then the doctor and patient move onto the next step.
Mild pain
Paracetamol (acetaminophen), or a nonsteroidal anti-inflammatory drug (NSAID) such as ibuprofen will relieve mild pain.
Mild to moderate pain
Paracetamol, an NSAID or paracetamol in a combination product with a weak opioid such as tramadol, may provide greater relief than their separate use. A combination of opioid with acetaminophen can be frequently used such as Percocet, Vicodin, or Norco.
Moderate to severe pain
When treating moderate to severe pain, the type of the pain, acute or chronic, needs to be considered. The type of pain can result in different medications being prescribed. Certain medications may work better for acute pain, others for chronic pain, and some may work equally well on both. Acute pain medication is for rapid onset of pain such as from an inflicted trauma or to treat post-operative pain. Chronic pain medication is for alleviating long-lasting, ongoing pain.
Morphine is the gold standard to which all narcotics are compared. Semi-synthetic derivatives of morphine such as hydromorphone (Dilaudid), oxymorphone (Numorphan, Opana), nicomorphine (Vilan), hydromorphinol and others vary in such ways as duration of action, side effect profile and milligramme potency. Fentanyl has the benefit of less histamine release and thus fewer side effects. It can also be administered via transdermal patch which is convenient for chronic pain management. In addition to the intrathecal patch and injectable fentanyl formulations, the FDA (Food and Drug Administration) has approved various immediate release fentanyl products for breakthrough cancer pain (Actiq/OTFC/Fentora/Onsolis/Subsys/Lazanda/Abstral). Oxycodone is used across the Americas and Europe for relief of serious chronic pain. Its main slow-release formula is known as OxyContin. Short-acting tablets, capsules, syrups and ampules which contain oxycodone are available making it suitable for acute intractable pain or breakthrough pain. Diamorphine, and methadone are used less frequently. Clinical studies have shown that transdermal buprenorphine is effective at reducing chronic pain. Pethidine, known in North America as meperidine, is not recommended for pain management due to its low potency, short duration of action, and toxicity associated with repeated use. Pentazocine, dextromoramide and dipipanone are also not recommended in new patients except for acute pain where other analgesics are not tolerated or are inappropriate, for pharmacological and misuse-related reasons. In some countries potent synthetics such as piritramide and ketobemidone are used for severe pain. Tapentadol is a newer agent introduced in the last decade.
For moderate pain, tramadol, codeine, dihydrocodeine, and hydrocodone are used, with nicocodeine, ethylmorphine and propoxyphene or dextropropoxyphene (less commonly).
Drugs of other types can be used to help opioids combat certain types of pain. Amitriptyline is prescribed for chronic muscular pain in the arms, legs, neck and lower back with an opiate, or sometimes without it or with an NSAID.
While opiates are often used in the management of chronic pain, high doses are associated with an increased risk of opioid overdose.
Opioids
In 2009, the Food and Drug Administration stated: "According to the National Institutes of Health, studies have shown that properly managed medical use of opioid analgesic compounds (taken exactly as prescribed) is safe, can manage pain effectively, and rarely causes addiction." In 2013, the FDA stated that "abuse and misuse of these products have created a serious and growing public health problem".
Opioid medications can provide short, intermediate or long acting analgesia depending upon the specific properties of the medication and whether it is formulated as an extended release drug. Opioid medications may be administered orally, by injection, via nasal mucosa or oral mucosa, rectally, transdermally, intravenously, epidurally and intrathecally. In chronic pain conditions that are opioid responsive, a combination of a long-acting (OxyContin, MS Contin, Opana ER, Exalgo and Methadone) or extended release medication is often prescribed along with a shorter-acting medication (oxycodone, morphine or hydromorphone) for breakthrough pain, or exacerbations.
Most opioid treatment used by patients outside of healthcare settings is oral (tablet, capsule or liquid), but suppositories and skin patches can be prescribed. An opioid injection is rarely needed for patients with chronic pain.
Although opioids are strong analgesics, they do not provide complete analgesia regardless of whether the pain is acute or chronic in origin. Opioids are effective analgesics in chronic malignant pain and modestly effective in nonmalignant pain management. However, there are associated adverse effects, especially during the commencement or change in dose. When opioids are used for prolonged periods drug tolerance will occur. Other risks can include chemical dependency, diversion and addiction.
Clinical guidelines for prescribing opioids for chronic pain have been issued by the American Pain Society and the American Academy of Pain Medicine. Included in these guidelines is the importance of assessing the patient for the risk of substance abuse, misuse, or addiction. Factors correlated with an elevated risk of opioid misuse include a history of substance use disorder, younger age, major depression, and the use of psychotropic medications. Physicians who prescribe opioids should integrate this treatment with any psychotherapeutic intervention the patient may be receiving. The guidelines also recommend monitoring not only the pain but also the level of functioning and the achievement of therapeutic goals. The prescribing physician should be suspicious of abuse when a patient reports a reduction in pain but has no accompanying improvement in function or progress in achieving identified goals.
The list below consists of commonly used opioid analgesics which have long-acting formulations. Common brand names for the extended release formulation are in parentheses.
Oxycodone (OxyContin)
Hydromorphone (Exalgo, Hydromorph Contin)
Morphine (M-Eslon, MS Contin)
Oxymorphone (Opana ER)
Fentanyl, transdermal (Duragesic)
Buprenorphine*, transdermal (Butrans)
Tramadol (Ultram ER)
Tapentadol (Nucynta ER)
Methadone* (Metadol, Methadose)
Hydrocodone bitartrate (Hysingla ER) and bicarbonate (Zohydro ER)
*Methadone and buprenorphine are each used both for the treatment of opioid addiction and as analgesics
Nonsteroidal anti-inflammatory drugs
The other major group of analgesics are nonsteroidal anti-inflammatory drugs (NSAID). They work by inhibiting the release of prostaglandins, which cause inflammatory pain. Acetaminophen/paracetamol is not always included in this class of medications. However, acetaminophen may be administered as a single medication or in combination with other analgesics (both NSAIDs and opioids). The alternatively prescribed NSAIDs such as ketoprofen and piroxicam have limited benefit in chronic pain disorders and with long-term use are associated with significant adverse effects. The use of selective NSAIDs designated as selective COX-2 inhibitors have significant cardiovascular and cerebrovascular risks which have limited their utilization. Common NSAIDs include aspirin, ibuprofen, and naproxen. There are many NSAIDs such as parecoxib (selective COX-2 inhibitor) with proven effectiveness after different surgical procedures. Wide use of non-opioid analgesics can reduce opioid-induced side-effects.
Antidepressants and antiepileptic drugs
Some antidepressant and antiepileptic drugs are used in chronic pain management and act primarily within the pain pathways of the central nervous system, though peripheral mechanisms have been attributed as well. They are generally used to treat nerve brain that results from injury to the nervous system. Neuropathy can be due to chronic high blood sugar levels (diabetic neuropathy). These drugs also reduce pain from viruses such as shingles, phantom limb pain and post-stroke pain. These mechanisms vary and in general are more effective in neuropathic pain disorders as well as complex regional pain syndrome. A common anti-epileptic drug is gabapentin, and an example of an antidepressant would be amitriptyline.
Cannabinoids
Evidence of medical marijuana's effect on reducing pain is generally conclusive. Detailed in a 1999 report by the Institute of Medicine, "the available evidence from animal and human studies indicates that cannabinoids can have a substantial analgesic effect". In a 2013 review study published in Fundamental & Clinical Pharmacology, various studies were cited in demonstrating that cannabinoids exhibit comparable effectiveness to opioids in models of acute pain and even greater effectiveness in models of chronic pain. It is mainly the THC strain of medical marijuana that provide analgesic benefits, as opposed to the CBD strain.
Ketamine
Low-dose ketamine is sometimes used as an alternative to opioids for the treatment of acute pain in hospital emergency departments. Ketamine probably? reduces pain more than opioids and with less nausea and vomiting.
Other analgesics
Other drugs which can potentiate conventional analgesics or have analgesic properties in certain circumstances are called analgesic adjuvant medications. Gabapentin, an anticonvulsant, can reduce neuropathic pain itself and can also potentiate opiates. Drugs with anticholinergic activity, such as orphenadrine and cyclobenzaprine, are given in conjunction with opioids for neuropathic pain. Orphenadrine and cyclobenzaprine are also muscle relaxants, and are useful in painful musculoskeletal conditions. Clonidine, an alpha-2 receptor agonist, is another drug that has found use as an analgesic adjuvant. In 2021, researchers described a novel type of pain therapy a CRISPR-dCas9 epigenome editing method for repressing Nav1.7 gene expression which showed therapeutic potential in three mouse models of chronic pain.
Self-management
Self-management of chronic pain has been described as the individual's ability to manage various aspects of their chronic pain. Self-management can include building self-efficacy, monitoring one's own symptoms, goal setting and action planning. It also includes patient-physician shared decision-making, among others. The benefits of self-management vary depending on self-management techniques used. They only have marginal benefits in management of chronic musculoskeletal pain. Some research has shown that self-management of pain can use different approaches. Those approaches can range from different therapies such as yoga, acupuncture,exercise and other relaxation techniques. Patients could also take a more natural approach by taking different minerals, vitamins or herbs. However, research has shown there is a difference between rural patients and non-rural patients having more access to different self-management approaches. Physicians in these areas may be readily prescribing more pain medication in these rural cities due to being less experienced with pain management. Simply put, it is sometimes easier for rural patients to get a prescription that insurance pays for instead of natural approaches that cost more money than they can afford to spend on their pain management. Self-management may be a more expensive alternative.
Society and culture
The medical treatment of pain as practiced in Greece and Turkey is called algology (from the Greek άλγος, algos, "pain"). The Hellenic Society of Algology and the Turkish Algology-Pain Society are the relevant local bodies affiliated to the International Association for the Study of Pain (IASP).
Undertreatment
Undertreatment of pain is the absence of pain management therapy for a person in pain when treatment is indicated.
Consensus in evidence-based medicine and the recommendations of medical specialty organizations establish guidelines to determine the treatment for pain which health care providers ought to offer. For various social reasons, persons in pain may not seek or may not be able to access treatment for their pain. Health care providers may not provide the treatment which authorities recommend. Some studies about gender biases have concluded that female pain recipients are often overlooked when it comes to the perception of their pain. Whether they appeared to be in high levels of pain didn't make a difference for their observers. The women participants in the studies were still perceived to be in less pain than they actually were. Men participants on the other hand were offered pain relief while their self reporting indicated that their pain levels didn't necessarily warrant treatment. Biases exist when it comes to gender. Prescribers have been seen over and under prescribing treatment to individuals based on them being male or female .There are other prevalent reasons that undertreatment of pain occurs. Gender is a factor as well as race. When it comes to prescribers treating patients racial disparities has become a real factor. Research has shown that non-white individuals pain perception has affected their pain treatment. The African-American community has been shown to suffer significantly when it comes to trusting the medical community to treat them. Oftentimes medication although available to be prescribed is dispensed in less quantities due to their pain being perceived on a smaller scale. The black community could be undermined by physicians thinking they are not in as much pain as they are reporting. Another occurrence may be physicians simply making the choice not to treat the patient accordingly in spite of the self-reported pain level. Racial disparity is definitely a real issue in the world of pain management.
In children
Acute pain is common in children and adolescents as a result of injury, illness, or necessary medical procedures. Chronic pain is present in approximately 15–25% of children and adolescents. It may be caused by an underlying disease, such as sickle cell anemia, cystic fibrosis, rheumatoid arthritis. Cancer or functional disorders such as migraines, fibromyalgia, and complex regional pain could also cause chronic pain in children.
Pain assessment in children is often challenging due to limitations in developmental level, cognitive ability, or their previous pain experiences. Clinicians must observe physiological and behavioral cues exhibited by the child to make an assessment. Self-report, if possible, is the most accurate measure of pain. Self-report pain scales involve younger kids matching their pain intensity to photographs of other children's faces, such as the Oucher Scale, pointing to schematics of faces showing different pain levels, or pointing out the location of pain on a body outline. Questionnaires for older children and adolescents include the Varni-Thompson Pediatric Pain Questionnaire (PPQ) and the Children's Comprehensive Pain Questionnaire. They are often utilized for individuals with chronic or persistent pain.
Acetaminophen, nonsteroidal anti-inflammatory agents, and opioid analgesics are commonly used to treat acute or chronic pain symptoms in children and adolescents. However a pediatrician should be consulted before administering any medication.
Caregivers may provide nonpharmacological treatment for children and adolescents because it carries minimal risk and is cost effective compared to pharmacological treatment. Nonpharmacologic interventions vary by age and developmental factors. Physical interventions to ease pain in infants include swaddling, rocking, or sucrose via a pacifier. For children and adolescents physical interventions include hot or cold application, massage, or acupuncture. Cognitive behavioral therapy (CBT) aims to reduce the emotional distress and improve the daily functioning of school-aged children and adolescents with pain by changing the relationship between their thoughts and emotions. In addition this therapy teaches them adaptive coping strategies. Integrated interventions in CBT include relaxation technique, mindfulness, biofeedback, and acceptance (in the case of chronic pain). Many therapists will hold sessions for caregivers to provide them with effective management strategies.
Professional certification
Pain management practitioners come from all fields of medicine. In addition to medical practitioners, a pain management team may often benefit from the input of pharmacists, physiotherapists, clinical psychologists and occupational therapists, among others. Together the multidisciplinary team can help create a package of care suitable to the patient.
Pain medicine in the United States
Pain physicians are often fellowship-trained board-certified anesthesiologists, neurologists, physiatrists, emergency physicians, or psychiatrists. Palliative care doctors are also specialists in pain management. The American Society of Interventional Pain Physicians, the American Board of Anesthesiology, the American Osteopathic Board of Anesthesiology (recognized by the AOABOS), the American Board of Physical Medicine and Rehabilitation, the American Board of Emergency Medicine and the American Board of Psychiatry and Neurology each provide certification for a subspecialty in pain management following fellowship training. The fellowship training is recognized by the American Board of Medical Specialties (ABMS) or the American Osteopathic Association Bureau of Osteopathic Specialists (AOABOS). As the field of pain medicine has grown rapidly, many practitioners have entered the field, some non-ACGME board-certified.
See also
Equianalgesic
Opioid comparison, an example of an equianalgesic chart
Pain Catastrophizing Scale
Pain ladder
Pain management during childbirth
Pain psychology
References
Further reading
External links
World Health Organization (WHO) Treatment Guidelines on Pain
Palliative care
Acute pain |
```python
from routersploit.core.exploit import *
from routersploit.modules.creds.generic.ftp_default import Exploit as FTPDefault
class Exploit(FTPDefault):
__info__ = {
"name": "Grandstream Camera Default FTP Creds",
"description": "Module performs dictionary attack against Grandstream Camera FTP service. "
"If valid credentials are found, they are displayed to the user.",
"authors": (
"Marcin Bury <marcin[at]threat9.com>", # routersploit module
),
"devices": (
"Grandstream Camera",
)
}
target = OptIP("", "Target IPv4, IPv6 address or file with ip:port (file://)")
port = OptPort(21, "Target FTP port")
threads = OptInteger(1, "Number of threads")
defaults = OptWordlist("admin:admin", "User:Pass or file with default credentials (file://)")
``` |
```xml
import * as React from 'react';
import ComponentExample from '../../../../components/ComponentDoc/ComponentExample';
import ExampleSection from '../../../../components/ComponentDoc/ExampleSection';
const Content = () => (
<ExampleSection title="Content">
<ComponentExample
title="Actions"
description="A chat message can contain actions."
examplePath="components/Chat/Content/ChatExampleActions"
/>
<ComponentExample
title="Reaction group"
description="A chat message can contain group of reactions."
examplePath="components/Chat/Content/ChatExampleReactionGroup"
/>
<ComponentExample
title="Header"
description="A chat message can have a custom header."
examplePath="components/Chat/Content/ChatExampleHeader"
/>
<ComponentExample
title="Override Header Styles"
description="A chat message header can have styles override to fit one line."
examplePath="components/Chat/Content/ChatExampleHeaderOverride"
/>
<ComponentExample
title="Read Status"
description="A chat message can have a read status indicator"
examplePath="components/Chat/Content/ChatExampleReadStatus"
/>
</ExampleSection>
);
export default Content;
``` |
Juan María de la Cruz, S.C.I. (born Mariano García Méndez, San Esteban de los Patos, Province of Ávila, 25 September 1891 – Silla, Valencia, 23 August 1936) was a Spanish Roman Catholic priest.
The Roman Catholic Church considers him a martyr. He was beatified by Pope John Paul II in 2001, together with his fellow martyrs killed in the Spanish Civil War.
References
External links
Celebration at St Peter's Square
1891 births
1936 deaths
People from the Province of Ávila
20th-century Spanish Roman Catholic priests
Spanish beatified people
Martyred Roman Catholic priests
Martyrs of the Spanish Civil War
People executed by Spain by firing squad
Beatifications by Pope John Paul II |
So Cool is the debut studio album by South Korean girl group Sistar. It was released on August 9, 2011, by Starship Entertainment. The song of the same name was released as the title track. The album consists of 12 songs, 5 new songs and a special version of the song "Ma Boy", released by the sub-unit Sistar19. The album was also released worldwide through iTunes.
The album was a commercial success peaking at number 10 on the Gaon Album Chart. The album has sold 22,315 physical copies as of February 2012.
Release and promotion
So Cool was released on August 9, 2011 through Starship Entertainment and LOEN Entertainment in South Korea physically and digitally and worldwide for digital download. Promotions for the album started on August 11, in KBS's Music Bank. The girls also promoted on MBC's Show! Music Core, SBS's Inkigayo and Mnet's M Countdown. The song "Girls Do It" was the first promotional single of the album. After one month of promotions, on September 11, the group won a Mutizen for the song "So Cool", on the show Inkigayo for the win the group released "Follow Me" as second single of the album. On September 23, the girls performed the title song in a remix version until September 25. The promotions of the song ended on October 2, in the special episode "Save the Green Earth" of Inkigayo.
Controversy
One day after the release of the album and music video, Starship Entertainment made some changes in the choreography of the title song "So Cool" to avoid controversies. The song "Girls Do It" was deemed inappropriate for broadcast due to a seemingly-offensive line. "Girls Do It" was set for the album's fifth single, however due to the controversy that followed the track, promotions were cancelled. The girls released "Hot Place" in its place.
Singles
"" was released as Sistar's debut single on June 3, 2010. A music video for the song was also released on June 3. The song was released as a digital single and as a physical single album, containing a total of four songs: the song of the same name, two b-sides ("Here We Come", "Oh Baby") and an instrumental of the title track. The title track was composed and produced by Brave Brothers. "Push Push" was first performed on Music Bank on June 4. The song entered at number 73 on the Gaon Digital Chart on the chart issue dated May 30 - June 5, 2010, and peaked at number 9 three weeks later. The physical single entered and peaked at number 63 on the Gaon Album Chart. The song placed at number 74 for the year 2010.
"" was released as the group's second single on August 25, 2010. The music video was released on the same day and features Super Junior's Kim Heechul. The song was released as a digital single and as a physical single album, including b-sides "Drop the Beat" featuring B2K, "I Don't Want a Weak Man" and an instrumental of the title track for a total of four tracks. The song was composed and produced by Brave Brothers. "Shady Girl" was first performed on Music Bank on August 27. The song entered at number 14 on the Gaon Digital Chart on the chart issue dated August 22–28, 2010, and peaked at number 4 on the following week. The physical single entered and peaked at number 9 on the Gaon Album Chart. The song placed at number 67 for the year 2010.
"" was released as the group's third single on December 3, 2010. A music video was released on the same day. It was released as a digital single and as a physical single album, containing a total of four songs, two b-sides ("Mighty Sistar", "Over") and an instrumental of the title track. The title track was written and produced by Brave Brothers. Sistar first performed the song on Music Bank on December 3. On December 9, Sistar released rehearsal videos for "Over" and "How Dare You", and their homepage crashed due to congestion. On December 17, they won their first music show award on Music Bank for "How Dare You". The song entered at number 21 on the Gaon Digital Chart on the chart issue dated November 28 - December 4, 2010, and peaked at number 2 the following week. The physical single entered and peaked at number 8 on the Gaon Album Chart. The song placed at number 91 for the year 2010.
"" was released as the title track from the album on August 9, 2011, in conjunction with the album. The official music video was released on the same day. The song debuted atop the Gaon Digital Chart on the chart issue dated August 7–13, 2011, topping the componing Download Chart with 570,309 downloads sold. This marked the first number one single from the group. The song placed in the Top 10 for five consecutive weeks. The song sold 3,334,222 digitals downloads and accumulated 18,703,636 streams in 2011, placing the song at number 26 for the year 2011.
Commercial performance
So Cool entered at number 15 on the Gaon Album Chart on the chart issue dated August 14–20, 2011. In its second week, the album fell to number 39 and climbed to number 11 in its third week. In its fifth week, the album peaked at number 10.
The album entered at number 10 on the Gaon Album Chart for the month of August 2011 with 9,000 physical copies sold. The album charted on the monthly chart since its release to December 2011, for a total of 18,818 physical copies sold. In January 2012, the album charted at number 86 with 1,155 copies sold and at 73 for February with 2,342 copies sold, for a total of 22,315 physical copies sold.
The album charted at number 84 on the Gaon Album Chart for the year-end 2011, with 18,815 physical copies sold in the year.
Track listing
Credits from Melon
Charts
Weekly charts
Monthly charts
Year-end charts
Music program wins
Release history
References
2011 debut albums
Korean-language albums
Sistar albums
Kakao M albums
Starship Entertainment albums |
Dessalines () is an arrondissement in the Artibonite department of Haiti. The arrondissement is named after its main city, Dessalines. The city, in turn, is named after the Haitian Revolution leader Jean-Jacques Dessalines. The arrondissement contains four communes: the city of Dessalines, Desdunes, Grande Saline, and Petite Rivière de l'Artibonite.
Arrondissements of Haiti
Artibonite (department) |
```objective-c
//===- llvm/ADT/SparseBitVector.h - Efficient Sparse BitVector --*- C++ -*-===//
//
// See path_to_url for license information.
//
//===your_sha256_hash------===//
///
/// \file
/// This file defines the SparseBitVector class. See the doxygen comment for
/// SparseBitVector for more details on the algorithm used.
///
//===your_sha256_hash------===//
#ifndef LLVM_ADT_SPARSEBITVECTOR_H
#define LLVM_ADT_SPARSEBITVECTOR_H
#include "llvm/Support/ErrorHandling.h"
#include "llvm/Support/MathExtras.h"
#include "llvm/Support/raw_ostream.h"
#include <cassert>
#include <climits>
#include <cstring>
#include <iterator>
#include <list>
namespace llvm {
/// SparseBitVector is an implementation of a bitvector that is sparse by only
/// storing the elements that have non-zero bits set. In order to make this
/// fast for the most common cases, SparseBitVector is implemented as a linked
/// list of SparseBitVectorElements. We maintain a pointer to the last
/// SparseBitVectorElement accessed (in the form of a list iterator), in order
/// to make multiple in-order test/set constant time after the first one is
/// executed. Note that using vectors to store SparseBitVectorElement's does
/// not work out very well because it causes insertion in the middle to take
/// enormous amounts of time with a large amount of bits. Other structures that
/// have better worst cases for insertion in the middle (various balanced trees,
/// etc) do not perform as well in practice as a linked list with this iterator
/// kept up to date. They are also significantly more memory intensive.
template <unsigned ElementSize = 128> struct SparseBitVectorElement {
public:
using BitWord = unsigned long;
using size_type = unsigned;
enum {
BITWORD_SIZE = sizeof(BitWord) * CHAR_BIT,
BITWORDS_PER_ELEMENT = (ElementSize + BITWORD_SIZE - 1) / BITWORD_SIZE,
BITS_PER_ELEMENT = ElementSize
};
private:
// Index of Element in terms of where first bit starts.
unsigned ElementIndex;
BitWord Bits[BITWORDS_PER_ELEMENT];
SparseBitVectorElement() {
ElementIndex = ~0U;
memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
}
public:
explicit SparseBitVectorElement(unsigned Idx) {
ElementIndex = Idx;
memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
}
// Comparison.
bool operator==(const SparseBitVectorElement &RHS) const {
if (ElementIndex != RHS.ElementIndex)
return false;
for (unsigned i = 0; i < BITWORDS_PER_ELEMENT; ++i)
if (Bits[i] != RHS.Bits[i])
return false;
return true;
}
bool operator!=(const SparseBitVectorElement &RHS) const {
return !(*this == RHS);
}
// Return the bits that make up word Idx in our element.
BitWord word(unsigned Idx) const {
assert(Idx < BITWORDS_PER_ELEMENT);
return Bits[Idx];
}
unsigned index() const {
return ElementIndex;
}
bool empty() const {
for (unsigned i = 0; i < BITWORDS_PER_ELEMENT; ++i)
if (Bits[i])
return false;
return true;
}
void set(unsigned Idx) {
Bits[Idx / BITWORD_SIZE] |= 1L << (Idx % BITWORD_SIZE);
}
bool test_and_set(unsigned Idx) {
bool old = test(Idx);
if (!old) {
set(Idx);
return true;
}
return false;
}
void reset(unsigned Idx) {
Bits[Idx / BITWORD_SIZE] &= ~(1L << (Idx % BITWORD_SIZE));
}
bool test(unsigned Idx) const {
return Bits[Idx / BITWORD_SIZE] & (1L << (Idx % BITWORD_SIZE));
}
size_type count() const {
unsigned NumBits = 0;
for (unsigned i = 0; i < BITWORDS_PER_ELEMENT; ++i)
NumBits += llvm::popcount(Bits[i]);
return NumBits;
}
/// find_first - Returns the index of the first set bit.
int find_first() const {
for (unsigned i = 0; i < BITWORDS_PER_ELEMENT; ++i)
if (Bits[i] != 0)
return i * BITWORD_SIZE + countTrailingZeros(Bits[i]);
llvm_unreachable("Illegal empty element");
}
/// find_last - Returns the index of the last set bit.
int find_last() const {
for (unsigned I = 0; I < BITWORDS_PER_ELEMENT; ++I) {
unsigned Idx = BITWORDS_PER_ELEMENT - I - 1;
if (Bits[Idx] != 0)
return Idx * BITWORD_SIZE + BITWORD_SIZE -
countLeadingZeros(Bits[Idx]) - 1;
}
llvm_unreachable("Illegal empty element");
}
/// find_next - Returns the index of the next set bit starting from the
/// "Curr" bit. Returns -1 if the next set bit is not found.
int find_next(unsigned Curr) const {
if (Curr >= BITS_PER_ELEMENT)
return -1;
unsigned WordPos = Curr / BITWORD_SIZE;
unsigned BitPos = Curr % BITWORD_SIZE;
BitWord Copy = Bits[WordPos];
assert(WordPos <= BITWORDS_PER_ELEMENT
&& "Word Position outside of element");
// Mask off previous bits.
Copy &= ~0UL << BitPos;
if (Copy != 0)
return WordPos * BITWORD_SIZE + countTrailingZeros(Copy);
// Check subsequent words.
for (unsigned i = WordPos+1; i < BITWORDS_PER_ELEMENT; ++i)
if (Bits[i] != 0)
return i * BITWORD_SIZE + countTrailingZeros(Bits[i]);
return -1;
}
// Union this element with RHS and return true if this one changed.
bool unionWith(const SparseBitVectorElement &RHS) {
bool changed = false;
for (unsigned i = 0; i < BITWORDS_PER_ELEMENT; ++i) {
BitWord old = changed ? 0 : Bits[i];
Bits[i] |= RHS.Bits[i];
if (!changed && old != Bits[i])
changed = true;
}
return changed;
}
// Return true if we have any bits in common with RHS
bool intersects(const SparseBitVectorElement &RHS) const {
for (unsigned i = 0; i < BITWORDS_PER_ELEMENT; ++i) {
if (RHS.Bits[i] & Bits[i])
return true;
}
return false;
}
// Intersect this Element with RHS and return true if this one changed.
// BecameZero is set to true if this element became all-zero bits.
bool intersectWith(const SparseBitVectorElement &RHS,
bool &BecameZero) {
bool changed = false;
bool allzero = true;
BecameZero = false;
for (unsigned i = 0; i < BITWORDS_PER_ELEMENT; ++i) {
BitWord old = changed ? 0 : Bits[i];
Bits[i] &= RHS.Bits[i];
if (Bits[i] != 0)
allzero = false;
if (!changed && old != Bits[i])
changed = true;
}
BecameZero = allzero;
return changed;
}
// Intersect this Element with the complement of RHS and return true if this
// one changed. BecameZero is set to true if this element became all-zero
// bits.
bool intersectWithComplement(const SparseBitVectorElement &RHS,
bool &BecameZero) {
bool changed = false;
bool allzero = true;
BecameZero = false;
for (unsigned i = 0; i < BITWORDS_PER_ELEMENT; ++i) {
BitWord old = changed ? 0 : Bits[i];
Bits[i] &= ~RHS.Bits[i];
if (Bits[i] != 0)
allzero = false;
if (!changed && old != Bits[i])
changed = true;
}
BecameZero = allzero;
return changed;
}
// Three argument version of intersectWithComplement that intersects
// RHS1 & ~RHS2 into this element
void intersectWithComplement(const SparseBitVectorElement &RHS1,
const SparseBitVectorElement &RHS2,
bool &BecameZero) {
bool allzero = true;
BecameZero = false;
for (unsigned i = 0; i < BITWORDS_PER_ELEMENT; ++i) {
Bits[i] = RHS1.Bits[i] & ~RHS2.Bits[i];
if (Bits[i] != 0)
allzero = false;
}
BecameZero = allzero;
}
};
template <unsigned ElementSize = 128>
class SparseBitVector {
using ElementList = std::list<SparseBitVectorElement<ElementSize>>;
using ElementListIter = typename ElementList::iterator;
using ElementListConstIter = typename ElementList::const_iterator;
enum {
BITWORD_SIZE = SparseBitVectorElement<ElementSize>::BITWORD_SIZE
};
ElementList Elements;
// Pointer to our current Element. This has no visible effect on the external
// state of a SparseBitVector, it's just used to improve performance in the
// common case of testing/modifying bits with similar indices.
mutable ElementListIter CurrElementIter;
// This is like std::lower_bound, except we do linear searching from the
// current position.
ElementListIter FindLowerBoundImpl(unsigned ElementIndex) const {
// We cache a non-const iterator so we're forced to resort to const_cast to
// get the begin/end in the case where 'this' is const. To avoid duplication
// of code with the only difference being whether the const cast is present
// 'this' is always const in this particular function and we sort out the
// difference in FindLowerBound and FindLowerBoundConst.
ElementListIter Begin =
const_cast<SparseBitVector<ElementSize> *>(this)->Elements.begin();
ElementListIter End =
const_cast<SparseBitVector<ElementSize> *>(this)->Elements.end();
if (Elements.empty()) {
CurrElementIter = Begin;
return CurrElementIter;
}
// Make sure our current iterator is valid.
if (CurrElementIter == End)
--CurrElementIter;
// Search from our current iterator, either backwards or forwards,
// depending on what element we are looking for.
ElementListIter ElementIter = CurrElementIter;
if (CurrElementIter->index() == ElementIndex) {
return ElementIter;
} else if (CurrElementIter->index() > ElementIndex) {
while (ElementIter != Begin
&& ElementIter->index() > ElementIndex)
--ElementIter;
} else {
while (ElementIter != End &&
ElementIter->index() < ElementIndex)
++ElementIter;
}
CurrElementIter = ElementIter;
return ElementIter;
}
ElementListConstIter FindLowerBoundConst(unsigned ElementIndex) const {
return FindLowerBoundImpl(ElementIndex);
}
ElementListIter FindLowerBound(unsigned ElementIndex) {
return FindLowerBoundImpl(ElementIndex);
}
// Iterator to walk set bits in the bitmap. This iterator is a lot uglier
// than it would be, in order to be efficient.
class SparseBitVectorIterator {
private:
bool AtEnd;
const SparseBitVector<ElementSize> *BitVector = nullptr;
// Current element inside of bitmap.
ElementListConstIter Iter;
// Current bit number inside of our bitmap.
unsigned BitNumber;
// Current word number inside of our element.
unsigned WordNumber;
// Current bits from the element.
typename SparseBitVectorElement<ElementSize>::BitWord Bits;
// Move our iterator to the first non-zero bit in the bitmap.
void AdvanceToFirstNonZero() {
if (AtEnd)
return;
if (BitVector->Elements.empty()) {
AtEnd = true;
return;
}
Iter = BitVector->Elements.begin();
BitNumber = Iter->index() * ElementSize;
unsigned BitPos = Iter->find_first();
BitNumber += BitPos;
WordNumber = (BitNumber % ElementSize) / BITWORD_SIZE;
Bits = Iter->word(WordNumber);
Bits >>= BitPos % BITWORD_SIZE;
}
// Move our iterator to the next non-zero bit.
void AdvanceToNextNonZero() {
if (AtEnd)
return;
while (Bits && !(Bits & 1)) {
Bits >>= 1;
BitNumber += 1;
}
// See if we ran out of Bits in this word.
if (!Bits) {
int NextSetBitNumber = Iter->find_next(BitNumber % ElementSize) ;
// If we ran out of set bits in this element, move to next element.
if (NextSetBitNumber == -1 || (BitNumber % ElementSize == 0)) {
++Iter;
WordNumber = 0;
// We may run out of elements in the bitmap.
if (Iter == BitVector->Elements.end()) {
AtEnd = true;
return;
}
// Set up for next non-zero word in bitmap.
BitNumber = Iter->index() * ElementSize;
NextSetBitNumber = Iter->find_first();
BitNumber += NextSetBitNumber;
WordNumber = (BitNumber % ElementSize) / BITWORD_SIZE;
Bits = Iter->word(WordNumber);
Bits >>= NextSetBitNumber % BITWORD_SIZE;
} else {
WordNumber = (NextSetBitNumber % ElementSize) / BITWORD_SIZE;
Bits = Iter->word(WordNumber);
Bits >>= NextSetBitNumber % BITWORD_SIZE;
BitNumber = Iter->index() * ElementSize;
BitNumber += NextSetBitNumber;
}
}
}
public:
SparseBitVectorIterator() = default;
SparseBitVectorIterator(const SparseBitVector<ElementSize> *RHS,
bool end = false):BitVector(RHS) {
Iter = BitVector->Elements.begin();
BitNumber = 0;
Bits = 0;
WordNumber = ~0;
AtEnd = end;
AdvanceToFirstNonZero();
}
// Preincrement.
inline SparseBitVectorIterator& operator++() {
++BitNumber;
Bits >>= 1;
AdvanceToNextNonZero();
return *this;
}
// Postincrement.
inline SparseBitVectorIterator operator++(int) {
SparseBitVectorIterator tmp = *this;
++*this;
return tmp;
}
// Return the current set bit number.
unsigned operator*() const {
return BitNumber;
}
bool operator==(const SparseBitVectorIterator &RHS) const {
// If they are both at the end, ignore the rest of the fields.
if (AtEnd && RHS.AtEnd)
return true;
// Otherwise they are the same if they have the same bit number and
// bitmap.
return AtEnd == RHS.AtEnd && RHS.BitNumber == BitNumber;
}
bool operator!=(const SparseBitVectorIterator &RHS) const {
return !(*this == RHS);
}
};
public:
using iterator = SparseBitVectorIterator;
SparseBitVector() : Elements(), CurrElementIter(Elements.begin()) {}
SparseBitVector(const SparseBitVector &RHS)
: Elements(RHS.Elements), CurrElementIter(Elements.begin()) {}
SparseBitVector(SparseBitVector &&RHS)
: Elements(std::move(RHS.Elements)), CurrElementIter(Elements.begin()) {}
// Clear.
void clear() {
Elements.clear();
}
// Assignment
SparseBitVector& operator=(const SparseBitVector& RHS) {
if (this == &RHS)
return *this;
Elements = RHS.Elements;
CurrElementIter = Elements.begin();
return *this;
}
SparseBitVector &operator=(SparseBitVector &&RHS) {
Elements = std::move(RHS.Elements);
CurrElementIter = Elements.begin();
return *this;
}
// Test, Reset, and Set a bit in the bitmap.
bool test(unsigned Idx) const {
if (Elements.empty())
return false;
unsigned ElementIndex = Idx / ElementSize;
ElementListConstIter ElementIter = FindLowerBoundConst(ElementIndex);
// If we can't find an element that is supposed to contain this bit, there
// is nothing more to do.
if (ElementIter == Elements.end() ||
ElementIter->index() != ElementIndex)
return false;
return ElementIter->test(Idx % ElementSize);
}
void reset(unsigned Idx) {
if (Elements.empty())
return;
unsigned ElementIndex = Idx / ElementSize;
ElementListIter ElementIter = FindLowerBound(ElementIndex);
// If we can't find an element that is supposed to contain this bit, there
// is nothing more to do.
if (ElementIter == Elements.end() ||
ElementIter->index() != ElementIndex)
return;
ElementIter->reset(Idx % ElementSize);
// When the element is zeroed out, delete it.
if (ElementIter->empty()) {
++CurrElementIter;
Elements.erase(ElementIter);
}
}
void set(unsigned Idx) {
unsigned ElementIndex = Idx / ElementSize;
ElementListIter ElementIter;
if (Elements.empty()) {
ElementIter = Elements.emplace(Elements.end(), ElementIndex);
} else {
ElementIter = FindLowerBound(ElementIndex);
if (ElementIter == Elements.end() ||
ElementIter->index() != ElementIndex) {
// We may have hit the beginning of our SparseBitVector, in which case,
// we may need to insert right after this element, which requires moving
// the current iterator forward one, because insert does insert before.
if (ElementIter != Elements.end() &&
ElementIter->index() < ElementIndex)
++ElementIter;
ElementIter = Elements.emplace(ElementIter, ElementIndex);
}
}
CurrElementIter = ElementIter;
ElementIter->set(Idx % ElementSize);
}
bool test_and_set(unsigned Idx) {
bool old = test(Idx);
if (!old) {
set(Idx);
return true;
}
return false;
}
bool operator!=(const SparseBitVector &RHS) const {
return !(*this == RHS);
}
bool operator==(const SparseBitVector &RHS) const {
ElementListConstIter Iter1 = Elements.begin();
ElementListConstIter Iter2 = RHS.Elements.begin();
for (; Iter1 != Elements.end() && Iter2 != RHS.Elements.end();
++Iter1, ++Iter2) {
if (*Iter1 != *Iter2)
return false;
}
return Iter1 == Elements.end() && Iter2 == RHS.Elements.end();
}
// Union our bitmap with the RHS and return true if we changed.
bool operator|=(const SparseBitVector &RHS) {
if (this == &RHS)
return false;
bool changed = false;
ElementListIter Iter1 = Elements.begin();
ElementListConstIter Iter2 = RHS.Elements.begin();
// If RHS is empty, we are done
if (RHS.Elements.empty())
return false;
while (Iter2 != RHS.Elements.end()) {
if (Iter1 == Elements.end() || Iter1->index() > Iter2->index()) {
Elements.insert(Iter1, *Iter2);
++Iter2;
changed = true;
} else if (Iter1->index() == Iter2->index()) {
changed |= Iter1->unionWith(*Iter2);
++Iter1;
++Iter2;
} else {
++Iter1;
}
}
CurrElementIter = Elements.begin();
return changed;
}
// Intersect our bitmap with the RHS and return true if ours changed.
bool operator&=(const SparseBitVector &RHS) {
if (this == &RHS)
return false;
bool changed = false;
ElementListIter Iter1 = Elements.begin();
ElementListConstIter Iter2 = RHS.Elements.begin();
// Check if both bitmaps are empty.
if (Elements.empty() && RHS.Elements.empty())
return false;
// Loop through, intersecting as we go, erasing elements when necessary.
while (Iter2 != RHS.Elements.end()) {
if (Iter1 == Elements.end()) {
CurrElementIter = Elements.begin();
return changed;
}
if (Iter1->index() > Iter2->index()) {
++Iter2;
} else if (Iter1->index() == Iter2->index()) {
bool BecameZero;
changed |= Iter1->intersectWith(*Iter2, BecameZero);
if (BecameZero) {
ElementListIter IterTmp = Iter1;
++Iter1;
Elements.erase(IterTmp);
} else {
++Iter1;
}
++Iter2;
} else {
ElementListIter IterTmp = Iter1;
++Iter1;
Elements.erase(IterTmp);
changed = true;
}
}
if (Iter1 != Elements.end()) {
Elements.erase(Iter1, Elements.end());
changed = true;
}
CurrElementIter = Elements.begin();
return changed;
}
// Intersect our bitmap with the complement of the RHS and return true
// if ours changed.
bool intersectWithComplement(const SparseBitVector &RHS) {
if (this == &RHS) {
if (!empty()) {
clear();
return true;
}
return false;
}
bool changed = false;
ElementListIter Iter1 = Elements.begin();
ElementListConstIter Iter2 = RHS.Elements.begin();
// If either our bitmap or RHS is empty, we are done
if (Elements.empty() || RHS.Elements.empty())
return false;
// Loop through, intersecting as we go, erasing elements when necessary.
while (Iter2 != RHS.Elements.end()) {
if (Iter1 == Elements.end()) {
CurrElementIter = Elements.begin();
return changed;
}
if (Iter1->index() > Iter2->index()) {
++Iter2;
} else if (Iter1->index() == Iter2->index()) {
bool BecameZero;
changed |= Iter1->intersectWithComplement(*Iter2, BecameZero);
if (BecameZero) {
ElementListIter IterTmp = Iter1;
++Iter1;
Elements.erase(IterTmp);
} else {
++Iter1;
}
++Iter2;
} else {
++Iter1;
}
}
CurrElementIter = Elements.begin();
return changed;
}
bool intersectWithComplement(const SparseBitVector<ElementSize> *RHS) const {
return intersectWithComplement(*RHS);
}
// Three argument version of intersectWithComplement.
// Result of RHS1 & ~RHS2 is stored into this bitmap.
void intersectWithComplement(const SparseBitVector<ElementSize> &RHS1,
const SparseBitVector<ElementSize> &RHS2)
{
if (this == &RHS1) {
intersectWithComplement(RHS2);
return;
} else if (this == &RHS2) {
SparseBitVector RHS2Copy(RHS2);
intersectWithComplement(RHS1, RHS2Copy);
return;
}
Elements.clear();
CurrElementIter = Elements.begin();
ElementListConstIter Iter1 = RHS1.Elements.begin();
ElementListConstIter Iter2 = RHS2.Elements.begin();
// If RHS1 is empty, we are done
// If RHS2 is empty, we still have to copy RHS1
if (RHS1.Elements.empty())
return;
// Loop through, intersecting as we go, erasing elements when necessary.
while (Iter2 != RHS2.Elements.end()) {
if (Iter1 == RHS1.Elements.end())
return;
if (Iter1->index() > Iter2->index()) {
++Iter2;
} else if (Iter1->index() == Iter2->index()) {
bool BecameZero = false;
Elements.emplace_back(Iter1->index());
Elements.back().intersectWithComplement(*Iter1, *Iter2, BecameZero);
if (BecameZero)
Elements.pop_back();
++Iter1;
++Iter2;
} else {
Elements.push_back(*Iter1++);
}
}
// copy the remaining elements
std::copy(Iter1, RHS1.Elements.end(), std::back_inserter(Elements));
}
void intersectWithComplement(const SparseBitVector<ElementSize> *RHS1,
const SparseBitVector<ElementSize> *RHS2) {
intersectWithComplement(*RHS1, *RHS2);
}
bool intersects(const SparseBitVector<ElementSize> *RHS) const {
return intersects(*RHS);
}
// Return true if we share any bits in common with RHS
bool intersects(const SparseBitVector<ElementSize> &RHS) const {
ElementListConstIter Iter1 = Elements.begin();
ElementListConstIter Iter2 = RHS.Elements.begin();
// Check if both bitmaps are empty.
if (Elements.empty() && RHS.Elements.empty())
return false;
// Loop through, intersecting stopping when we hit bits in common.
while (Iter2 != RHS.Elements.end()) {
if (Iter1 == Elements.end())
return false;
if (Iter1->index() > Iter2->index()) {
++Iter2;
} else if (Iter1->index() == Iter2->index()) {
if (Iter1->intersects(*Iter2))
return true;
++Iter1;
++Iter2;
} else {
++Iter1;
}
}
return false;
}
// Return true iff all bits set in this SparseBitVector are
// also set in RHS.
bool contains(const SparseBitVector<ElementSize> &RHS) const {
SparseBitVector<ElementSize> Result(*this);
Result &= RHS;
return (Result == RHS);
}
// Return the first set bit in the bitmap. Return -1 if no bits are set.
int find_first() const {
if (Elements.empty())
return -1;
const SparseBitVectorElement<ElementSize> &First = *(Elements.begin());
return (First.index() * ElementSize) + First.find_first();
}
// Return the last set bit in the bitmap. Return -1 if no bits are set.
int find_last() const {
if (Elements.empty())
return -1;
const SparseBitVectorElement<ElementSize> &Last = *(Elements.rbegin());
return (Last.index() * ElementSize) + Last.find_last();
}
// Return true if the SparseBitVector is empty
bool empty() const {
return Elements.empty();
}
unsigned count() const {
unsigned BitCount = 0;
for (ElementListConstIter Iter = Elements.begin();
Iter != Elements.end();
++Iter)
BitCount += Iter->count();
return BitCount;
}
iterator begin() const {
return iterator(this);
}
iterator end() const {
return iterator(this, true);
}
};
// Convenience functions to allow Or and And without dereferencing in the user
// code.
template <unsigned ElementSize>
inline bool operator |=(SparseBitVector<ElementSize> &LHS,
const SparseBitVector<ElementSize> *RHS) {
return LHS |= *RHS;
}
template <unsigned ElementSize>
inline bool operator |=(SparseBitVector<ElementSize> *LHS,
const SparseBitVector<ElementSize> &RHS) {
return LHS->operator|=(RHS);
}
template <unsigned ElementSize>
inline bool operator &=(SparseBitVector<ElementSize> *LHS,
const SparseBitVector<ElementSize> &RHS) {
return LHS->operator&=(RHS);
}
template <unsigned ElementSize>
inline bool operator &=(SparseBitVector<ElementSize> &LHS,
const SparseBitVector<ElementSize> *RHS) {
return LHS &= *RHS;
}
// Convenience functions for infix union, intersection, difference operators.
template <unsigned ElementSize>
inline SparseBitVector<ElementSize>
operator|(const SparseBitVector<ElementSize> &LHS,
const SparseBitVector<ElementSize> &RHS) {
SparseBitVector<ElementSize> Result(LHS);
Result |= RHS;
return Result;
}
template <unsigned ElementSize>
inline SparseBitVector<ElementSize>
operator&(const SparseBitVector<ElementSize> &LHS,
const SparseBitVector<ElementSize> &RHS) {
SparseBitVector<ElementSize> Result(LHS);
Result &= RHS;
return Result;
}
template <unsigned ElementSize>
inline SparseBitVector<ElementSize>
operator-(const SparseBitVector<ElementSize> &LHS,
const SparseBitVector<ElementSize> &RHS) {
SparseBitVector<ElementSize> Result;
Result.intersectWithComplement(LHS, RHS);
return Result;
}
// Dump a SparseBitVector to a stream
template <unsigned ElementSize>
void dump(const SparseBitVector<ElementSize> &LHS, raw_ostream &out) {
out << "[";
typename SparseBitVector<ElementSize>::iterator bi = LHS.begin(),
be = LHS.end();
if (bi != be) {
out << *bi;
for (++bi; bi != be; ++bi) {
out << " " << *bi;
}
}
out << "]\n";
}
} // end namespace llvm
#endif // LLVM_ADT_SPARSEBITVECTOR_H
``` |
Below are the squads for the 2016 AFC Solidarity Cup in Malaysia, which took place between 2 and 15 November 2016. The players' listed age is their age on the tournament's opening day.
Group A
Nepal
Head coach: Koji Gyotoku
Brunei
Head coach: Kwon Oh-son
Timor-Leste
Head coach: Fábio Magrão
Group B
Sri Lanka
Head coach: Dudley Steinwall
Macau
Head coach: Tam Iao San
Mongolia
Head coach: Toshiaki Imai
Laos
Head coach: Valakone Phomphakdy
References
2016 AFC Solidarity Cup |
Verses of Steel is the twelfth studio album by the Polish thrash metal band Acid Drinkers. It was released on 7 July 2008 in Poland through Mystic Production. It is the only album to feature Alex "Olass" Mendyk due to his death in late November 2008.
The album was recorded from March to April 2008 (drums & vocals were recorded at the Perlazza studio in Opalenica while guitar & bass were recorded at Jet studio in Nowy Dwór). It was mixed at Chimp Studio, London, and Tower Studio, Wrocław. The cover art was created by Mentalporn.com and fotos by Paulina Mencel.
Track listing
Reception
The album was well received in their country, gaining three nominations for the Fryderyk Musical Awards (Poland) for production, composition and best Heavy Metal album.
It was described as a traditional European thrash metal album with a few crossover elements.
Personnel
Tomasz "Titus" Pukacki – vocals, bass
Alex "Olass" Mendyk – guitar, vocals
Dariusz "Popcorn" Popowicz – guitar, vocals
Maciej "Ślimak" Starosta – drums
Music and lyrics – Acid Drinkers
Engineered – Maciej Feddek, Aleksander Mendyk
Vocal co-producer – Przemysław "Perła" Wjemann
Bartek Dębicki – solo in "Blues Beatdown"
Charts
Release history
References
Acid Drinkers albums
2008 albums
Mystic Production albums |
Barbara Ovstedal (3 October 1921 – 23 November 2012) was an author who wrote under the pseudonyms Barbara Paul and Barbara Douglas. She later changed to Rosalind Laker when Barbara Paul gained recognition.
Her many books include The Sugar Pavilion and To Dance with Kings.
Bibliography
Sovereign’s Key (1970)
Far Seeks the Heart (1970)
Sail a Jewelled Ship (1971)
The Shripney Lady (1972)
Fair Wind of Love (1974) (published under the pseudonym Barbara Douglas by Doubleday U.S.A, 1980)
The Smuggler's Bride (1975)
Ride the Blue Ribband (1976)
Warwyck's Wife (1979 in the UK), also as Warwyck's Woman (1978 in the US)
Claudine's Daughter (1979)
Warwyck's Choice (1980 in the US), also as The Warwycks of Easthampton (1980 in the UK)
Banners of Silk (1981)
Gilded Splendour (1982)
Jewelled Path (1983)
What the Heart Keeps (1984)
This Shining Land (1984)
Tree of Gold (1986)
The Silver Touch (1987)
To Dance with Kings (1989)
Circle of Pearls (1990)
The Golden Tulip
The Venetian Mask (1992)
The Sugar Pavilion (1993)
The Fortuny Gown (1994)
The Fragile Hour (1996)
New World, New Love (2003)
To Dream of Snow
Brilliance (2007)
Garlands of Gold (2008)
The House by the Fjord (2011)
Sources
Rosalind Laker bibliography
Homepage of writer Barbara Paul on the confusion of names.
Her obituary.
2012 deaths
1921 births
British women writers |
Daniel Venables (born 19 November 1998) is a former professional Australian rules footballer who played for the West Coast Eagles in the Australian Football League (AFL). He was the youngest member of the Eagles 2018 premiership side.
Junior career
Venables originally represented Keilor Football Club and his school Penleigh and Essendon Grammar. Throughout his junior career, he mainly played as a midfielder or forward. In 2015, he played for Vic Metro in the 2015 under-16 national championships, breaking his leg against South Australia in the opening game after landing awkwardly in a marking contest. The same year, Venables had surgery on his shoulder. In 2016, he was named in the under-18 All-Australian side after a strong performance for Vic Metro in the national championships. Venables kicked six goals over four matches while averaging 13 disposals, 5.5 tackles and 6.3 contested possessions. He played three TAC Cup games for the Western Jets, limited by school football duties. Venables was unable to test at the AFL Draft Combine due to a foot injury, but was still considered a likely first-round pick at the upcoming 2016 national draft.
AFL career
Venables was drafted by West Coast with their first selection and thirteenth overall in the 2016 national draft. His foot injury prevented him from participating in the 2017 preseason, but he recovered in time for a March reserves match with West Coast's West Australian Football League (WAFL) affiliate East Perth. At the start of the 2017 WAFL season, Venables was restricted to reserves matches on limited minutes, but built up form and played eight league games, averaging over one goal and 13 disposals. He was about to play his first AFL match against the Geelong Cats in round 13, but suffered turf toe in training, ruling him out for the season. Nevertheless, Venables extended his contract in July by two years (until 2020). He made his debut in the opening round of the 2018 AFL season in a twenty-nine point loss to at Perth Stadium. Venables played four games before injuring his ankle against Gold Coast. He was kept out for two months, and played another eight games before his first AFL final against Collingwood, where he recorded seven tackles. Venables impressed against Melbourne in the preliminary final, accumulating 17 disposals and kicking a goal. He was part of West Coast's premiership side, but had little impact on the Grand Final, recording only three disposals.
During Round 9 of the 2019 season, Venables suffered a severe concussion in the match versus Melbourne in which his head hit the hip of opponent Tim Smith during a marking contest, and despite being on the clubs list for both the 2020 and 2021 season, he formally announced his retirement due to the ongoing symptoms.
Statistics
Statistics are correct to the end of round 9, 2019
|- style="background-color: #EAEAEA"
|style="text-align:center;background:#afe6ba;"|2018†
|style="text-align:center;"|
| 18 || 15 || 9 || 9 || 75 || 69 || 144 || 42 || 38 || 0.6 || 0.6 || 5.0 || 4.6 || 9.6 || 2.8 || 2.5
|-
! scope="row" style="text-align:center" | 2019
|style="text-align:center;"|
| 18 || 6 || 2 || 1 || 27 || 29 || 56 || 18 || 16 || 0.3 || 0.2 || 4.5 || 4.8 || 9.3 || 3.0 || 2.7
|- class="sortbottom"
! colspan=3| Career
! 21 !! 11 !! 10 !! 102 !! 98 !! 200 !! 60 !! 54 !! 0.5 !! 0.5 !! 4.9 !! 4.7 !! 9.5 !! 2.9 !! 2.6
|}
Personal life
Venables is the grandson of North Melbourne footballer Fred Robinson and the great-grandson of Australian Football Hall of Fame inductee Johnny Lewis. Venables became engaged to Nine News Perth weather presenter Scherri-Lee Biggs in December 2022.
References
External links
1998 births
Living people
West Coast Eagles players
West Coast Eagles premiership players
Western Jets players
Australian rules footballers from Victoria (state)
Keilor Football Club players
West Coast Eagles (WAFL) players
East Perth Football Club players
People educated at Penleigh and Essendon Grammar School
VFL/AFL premiership players |
The King Edward VII Memorial Fountain is a fountain in Vancouver, British Columbia, Canada. Next To The Vancouver Art Gallery,
History
It was erected in 1912 to commemorate the King’s passing. Members of the Imperial Order of Daughters of the Empire commissioned sculptor Charles Marega to create the feature. It stood outside the courthouse, now the Vancouver Art Gallery in a prominent location until 1966. In 1966 it was moved into storage to make way for a new feature, the B.C Centennial Fountain. The fountain was supposed to be moved to King Edward Street and Cambie Street but the Vancouver Parks Board did not have the budget for cleaning, moving and installing the King Edward fountain and so it ended up in storage until 1983. It now resides on the west side of the Vancouver Art Gallery, facing Hornby Street.
Notes
Buildings and structures completed in 1912
Fountains in Canada
Buildings and structures in Vancouver
1912 establishments in British Columbia
Cultural depictions of Edward VII
Monuments and memorials in Vancouver
Edward VII
Outdoor sculptures in Vancouver |
```php
<?php
namespace PhpOffice\PhpSpreadsheet\Calculation\Database;
use PhpOffice\PhpSpreadsheet\Calculation\Calculation;
use PhpOffice\PhpSpreadsheet\Calculation\Functions;
use PhpOffice\PhpSpreadsheet\Calculation\Internal\WildcardMatch;
abstract class DatabaseAbstract
{
abstract public static function evaluate(array $database, array|null|int|string $field, array $criteria): null|float|int|string;
/**
* fieldExtract.
*
* Extracts the column ID to use for the data field.
*
* @param mixed[] $database The range of cells that makes up the list or database.
* A database is a list of related data in which rows of related
* information are records, and columns of data are fields. The
* first row of the list contains labels for each column.
* @param mixed $field Indicates which column is used in the function. Enter the
* column label enclosed between double quotation marks, such as
* "Age" or "Yield," or a number (without quotation marks) that
* represents the position of the column within the list: 1 for
* the first column, 2 for the second column, and so on.
*/
protected static function fieldExtract(array $database, mixed $field): ?int
{
$field = strtoupper(Functions::flattenSingleValue($field) ?? '');
if ($field === '') {
return null;
}
$fieldNames = array_map('strtoupper', array_shift($database));
if (is_numeric($field)) {
$field = (int) $field - 1;
if ($field < 0 || $field >= count($fieldNames)) {
return null;
}
return $field;
}
$key = array_search($field, array_values($fieldNames), true);
return ($key !== false) ? (int) $key : null;
}
/**
* filter.
*
* Parses the selection criteria, extracts the database rows that match those criteria, and
* returns that subset of rows.
*
* @param mixed[] $database The range of cells that makes up the list or database.
* A database is a list of related data in which rows of related
* information are records, and columns of data are fields. The
* first row of the list contains labels for each column.
* @param mixed[] $criteria The range of cells that contains the conditions you specify.
* You can use any range for the criteria argument, as long as it
* includes at least one column label and at least one cell below
* the column label in which you specify a condition for the
* column.
*
* @return mixed[]
*/
protected static function filter(array $database, array $criteria): array
{
$fieldNames = array_shift($database);
$criteriaNames = array_shift($criteria);
// Convert the criteria into a set of AND/OR conditions with [:placeholders]
$query = self::buildQuery($criteriaNames, $criteria);
// Loop through each row of the database
return self::executeQuery($database, $query, $criteriaNames, $fieldNames);
}
protected static function getFilteredColumn(array $database, ?int $field, array $criteria): array
{
// reduce the database to a set of rows that match all the criteria
$database = self::filter($database, $criteria);
$defaultReturnColumnValue = ($field === null) ? 1 : null;
// extract an array of values for the requested column
$columnData = [];
foreach ($database as $rowKey => $row) {
$keys = array_keys($row);
$key = $keys[$field] ?? null;
$columnKey = $key ?? 'A';
$columnData[$rowKey][$columnKey] = $row[$key] ?? $defaultReturnColumnValue;
}
return $columnData;
}
private static function buildQuery(array $criteriaNames, array $criteria): string
{
$baseQuery = [];
foreach ($criteria as $key => $criterion) {
foreach ($criterion as $field => $value) {
$criterionName = $criteriaNames[$field];
if ($value !== null) {
$condition = self::buildCondition($value, $criterionName);
$baseQuery[$key][] = $condition;
}
}
}
$rowQuery = array_map(
fn ($rowValue): string => (count($rowValue) > 1) ? 'AND(' . implode(',', $rowValue) . ')' : ($rowValue[0] ?? ''),
$baseQuery
);
return (count($rowQuery) > 1) ? 'OR(' . implode(',', $rowQuery) . ')' : ($rowQuery[0] ?? '');
}
private static function buildCondition(mixed $criterion, string $criterionName): string
{
$ifCondition = Functions::ifCondition($criterion);
// Check for wildcard characters used in the condition
$result = preg_match('/(?<operator>[^"]*)(?<operand>".*[*?].*")/ui', $ifCondition, $matches);
if ($result !== 1) {
return "[:{$criterionName}]{$ifCondition}";
}
$trueFalse = ($matches['operator'] !== '<>');
$wildcard = WildcardMatch::wildcard($matches['operand']);
$condition = "WILDCARDMATCH([:{$criterionName}],{$wildcard})";
if ($trueFalse === false) {
$condition = "NOT({$condition})";
}
return $condition;
}
private static function executeQuery(array $database, string $query, array $criteria, array $fields): array
{
foreach ($database as $dataRow => $dataValues) {
// Substitute actual values from the database row for our [:placeholders]
$conditions = $query;
foreach ($criteria as $criterion) {
$conditions = self::processCondition($criterion, $fields, $dataValues, $conditions);
}
// evaluate the criteria against the row data
$result = Calculation::getInstance()->_calculateFormulaValue('=' . $conditions);
// If the row failed to meet the criteria, remove it from the database
if ($result !== true) {
unset($database[$dataRow]);
}
}
return $database;
}
private static function processCondition(string $criterion, array $fields, array $dataValues, string $conditions): string
{
$key = array_search($criterion, $fields, true);
$dataValue = 'NULL';
if (is_bool($dataValues[$key])) {
$dataValue = ($dataValues[$key]) ? 'TRUE' : 'FALSE';
} elseif ($dataValues[$key] !== null) {
$dataValue = $dataValues[$key];
// escape quotes if we have a string containing quotes
if (is_string($dataValue) && str_contains($dataValue, '"')) {
$dataValue = str_replace('"', '""', $dataValue);
}
$dataValue = (is_string($dataValue)) ? Calculation::wrapResult(strtoupper($dataValue)) : $dataValue;
}
return str_replace('[:' . $criterion . ']', $dataValue, $conditions);
}
}
``` |
USS LST-931/LST(H)-931 was an in the United States Navy. Like many of her class, she was not named and is properly referred to by her hull designation.
Construction
LST-931 was laid down on 13 June 1944, at Hingham, Massachusetts, by the Bethlehem-Hingham Shipyard; launched on 19 July 1944; and commissioned on 11 August 1944.
Service history
During World War II, LST-931 was assigned to the Asiatic-Pacific theater and participated in the assault and occupation of Iwo Jima in February 1945, and the assault and occupation of Okinawa Gunto from April through June 1945.
On 15 September 1945, she was redesignated LST(H)-931 and performed occupation duty in the Far East until late October 1945. The tank landing ship was decommissioned on 26 June 1946, and struck from the Navy list on 31 July, that same year. On 12 June 1948, she was sold to the Walter W. Johnson Co., for scrapping.
Awards
LST-931 earned two battle star for World War II service.
Notes
Citations
Bibliography
Online resources
External links
LST-542-class tank landing ships
World War II amphibious warfare vessels of the United States
Ships built in Hingham, Massachusetts
1944 ships |
The Djokovic–Murray rivalry is a modern-day tennis rivalry between Novak Djokovic and Andy Murray. They have met 36 times, and Djokovic leads 25–11 overall and 11–8 in finals. Ten of their encounters were played in majors, with Djokovic leading 8–2. Djokovic and Murray are one of two male pairs to have contested the finals of each of the four majors (Djokovic–Nadal is the other pair).
Djokovic leads on hard courts 20–8 and 5–1 on clay, while Murray has won their two matches played on grass. The rivalry began highly competitive and remained so for many years. However, since Murray won the 2013 Wimbledon Championships, Djokovic has taken a commanding lead, winning 14 of their last 17 encounters.
The two are almost the same age, Murray being a week older than Djokovic. They went to training camp together, and as juniors, Murray won the first match they played together. In 2006, both aged 19, Djokovic and Murray partnered in Doubles at the Australian Open, losing in the first round. The rivalry has become an important part of both men's careers. Between May and August 2013 and between May 2016 and June 2017, they were the world No. 1 and 2 in ATP rankings; Djokovic held the top spot throughout the entire first period and the second period until November 2016, when Murray claimed it. They were the 2015 and 2016 year-end top two players in the world. They subsequently have not played each other for over six years (since January 2017 at the Qatar Open), mainly due to Murray's string of injuries.
Djokovic and Murray met each other a record four times in the final of the Australian Open, but their most notable encounter there was in the 2012 semifinals. Other notable matches contested include the 2011 Italian Open semifinals, 2012 US Open final, 2012 Shanghai Masters final, 2015 French Open semifinals and 2017 Qatar Open final.
Notable matches
2006 Madrid Masters round of 16
This was the first professional match between Djokovic and Murray, in the round of 16 at the 2006 Madrid Masters. This was the first of 20 matches at ATP Tour Masters 1000 tournaments the two would play, with Djokovic being the winner here in three sets.
2008 Cincinnati Masters final
The first tour-level final the two played came at the 2008 Western & Southern Open. This was Murray's first ATP 1000 final, and Djokovic's 6th. Murray beat Djokovic in straight sets, both in tiebreaks, to claim his first ATP World Tour Masters 1000 title.
2011 Australian Open final
Djokovic and Murray first met in a Grand Slam tournament at the final of the 2011 Australian Open. Djokovic beat Murray in straight sets to win his second Australian Open title in just over 2 and a half hours.
2011 Italian Open semi-final
Their second professional meeting on clay came at the 2011 Italian Open. Djokovic was dominant in the first set, breaking Murray three times and winning 6–1. Murray then held his serve and broke Djokovic to win the second set 6 games to 3. Djokovic then rallied to a 3 to 1 lead in the deciding set but Murray rallied back to serve for the match at 5 games to 4, giving him the chance to inflict Djokovic's first defeat of the year and to snap Djokovic's 38 match winning streak. However, two double faults from Murray allowed Djokovic to break back and win the match in a deciding tiebreak.
2012 Australian Open semi-final
Djokovic and Murray met each other in the semifinals of the 2012 Australian Open, in one of the longest and closest fought matches the two have ever played, at 4 hours and 50 minutes long. Murray took a two sets to one lead in the third set, before Djokovic came back in the last two, claiming victory in five sets. It was the closest that Murray came to beating Djokovic at the Australian Open. Djokovic later went on to defend his title against Rafael Nadal in another marathon match.
2012 US Open final
This was the second Grand Slam final the two played, and the first time the two had met at the US Open. After a 4-hour, 54 minute long final, Murray defeated Djokovic to claim his first ever major title, making him the first British man to win a Grand Slam title since Fred Perry in 1936. Murray claimed the first two sets, the first in a 24-minute tiebreak, and the second by 7 games to 5 after being 4–0 up at one point, before Djokovic levelled the scoring to take the match into a deciding fifth set, in which Murray regained his prior momentum and emerged victorious. This match equals the record set by Ivan Lendl and Mats Wilander as the longest US Open final in history, as well as the second longest major final in the Open Era at the time, behind the 2012 Australian Open final earlier that year (which also featured Djokovic). It also featured the longest ever tie-break in a US Open final, with a 12–10 final score in the first set.
2012 Shanghai Masters final
Murray was the two-time defending champion in Shanghai and was going for his third successive title, whilst Djokovic had just won the China Open the previous week. Andy Murray took a close first set before the second set went to a tiebreak. Murray had five championship points in the second set, but Djokovic saved them all, and won the tiebreak 13–11, going on to win the final set and claim the title. It has been described as an epic and one of the best matches in their rivalry, lasting 3 hours and 21 minutes.
2013 Australian Open final
This was the second time (after 2011) Djokovic and Murray met in an Australian Open final. Djokovic was the two-time defending champion (having beaten Murray in 2011 and Nadal in 2012), while Murray looked to win his 2nd consecutive Grand Slam. Murray was coming off an exhausting five-set win over Roger Federer in the semifinals, while Djokovic breezed to an easy 89 minute, straight sets victory over David Ferrer. The first set was a tightly contested one. Djokovic had 5 break points, but failed to convert any of them, as Murray won the 1st set. Murray and Djokovic again went to a tiebreak in the next set, but Djokovic capitalized on a key double fault by Murray to win the 2nd set. The first two sets lasted a combined 2 hours and 13 minutes. From there, Djokovic took control and won in four sets, becoming the first man in the Open Era to win 3 straight Australian Open championships. The trophy was presented by former Australian Open winner Andre Agassi, whose record of four Australian Open titles overall Djokovic had matched.
2013 Wimbledon final
Just 12 months after his loss to Roger Federer at the previous year's tournament, Murray made it through to his second consecutive final at Wimbledon, where he would face Djokovic in their fourth Grand Slam final. Murray fought back from a break down in both the second and third sets, winning the last 4 games of the match after being down by 4 games to 2. Leading by two sets and 5 games to 4 in the third, Murray raced into a 40–0 lead in the final game, gaining three championship points. However, not to be outdone, Djokovic fought back strongly, first to deuce, after which he held three separate break point opportunities. Murray saved each of these to claim the title, the first by any British man since Fred Perry in 1936. The victory meant Murray tied Djokovic at 2 wins each in Grand Slam finals, leading by 5 to 4 in their total finals head-to-head. In addition, the loss marked the first time in 80 Grand Slam matches that Djokovic had failed to win a set, his previous straight sets defeat coming against Tomas Berdych at Wimbledon in 2010. In the trophy ceremony immediately after the final, Murray said in his speech that the final game was "the toughest I've ever had to play in my career", and that his concentration was "so high" during the closing minutes of the match. Djokovic conceded that Murray was the better player on the day, and that he "absolutely deserved to win today".
2014 US Open quarterfinal
This was the second time the two met at the US Open. The first two sets were tightly contested and split between each, both in tiebreaks after Murray made comebacks when down 4 games to 1 in the first set and 3 games to 1 in the second set. However, Murray's fitness dropped in the third set with stiffness in his back and hips, allowing Djokovic to break Murray twice and take the third set 6 games to 2. Both players held their serve in the fourth set until Djokovic broke Murray's serve when leading 5 games to 4, winning the match in four sets and advancing onto the semifinals. This loss resulted in Murray dropping out of the top 10 for the first time since 2008.
2015 Australian Open final
This was the third time (after 2011 and 2013) that Djokovic and Murray met in an Australian Open final. Djokovic was the four-time champion (having won in 2008, 2011, 2012, 2013), while Murray had made his 4th Australian Open final. Djokovic was coming off an exhausting five-set win over Stanislas Wawrinka in the semifinals, while Murray beat Tomas Berdych in 4 sets. The first two sets were tightly contested. Djokovic took the first set in a tiebreak as a Murray backhand sailed long. In the second set, Murray made the push taking the set in a tiebreak, after failing to convert a set point earlier in the set. After Murray broke early in the third set, Djokovic would win twelve of the next thirteen games, including the last nine in a row, to take the match and the championship in four sets, becoming the first man in the Open era to win 5 Australian Open championships. The trophy was presented to him by six-time Australian Open champion Roy Emerson, who held the then-record of Australian Open titles.
2015 French Open semi-final
This was their first meeting in the French Open. It was a five-set match played over the course of two days. Djokovic had ended Rafael Nadal's run of 39 consecutive victories in the French Open with a straight sets victory while Murray came off a four set victory against David Ferrer. With Nadal and Roger Federer's quarterfinal defeats guaranteeing a first time champion at the tournament, both players each had winning streaks entering the match, Djokovic with an overall 27 match winning streak while Murray with a 15 match winning streak on Clay. Djokovic broke Murray's serve once to win the first set and then broke Murray twice in the second set for a two set to love lead. However, despite Djokovic having break points in the third set for a possible straight sets victory, Murray battled back and broke Djokovic's serve at 5 games all to win the third set on serve. After two breaks of serve in the fourth set, the match was suspended for the day at 3 games all due to an approaching thunderstorm. The match then resumed the following day and Murray again broke Djokovic's serve at 5 games all and closed the set on serve to take it into a fifth set. However, with the match being similar to their one in the 2012 US Open, Djokovic won the fifth set comfortably, winning 6 of the last 7 games to reach his third final in the French Open, ending Murray's winning streak on clay and denying him a place for his first French Open final. Djokovic would then lose the final to Stan Wawrinka in four sets.
2015 Canadian Open final
Djokovic headed into the Montreal final on an eight match winning streak against Murray, who had not beaten Djokovic since the 2013 Wimbledon final. Djokovic was seeking his fourth Canadian title (after 2007, 2011, 2012) with Murray looking for his third (after 2009 and 2010). The world No. 1 had also won the last 12 Masters finals in which he had competed, including wins at Indian Wells, Miami, Monte Carlo and Rome this year. Both players started strong, with Murray taking a lead, squandering it, and breaking back to win the set. Djokovic broke early to win set two. In the final set, Murray took an early lead which set up the pivotal fifth game. It lasted 15 minutes and had ten deuces, but Murray held on to extend his lead. Murray had three match points on Djokovic's serve but failed to convert, and he sealed the match on his own serve for a three set victory. This ended Djokovic's two year winning streak with Murray, who rose to world No. 2 again, overtaking Roger Federer.
2016: The battle for the world number one
Djokovic and Murray met five times in 2016 and created history by taking the battle for world number 1 to the final match of the season. Djokovic and Murray contested the finals at both the Madrid and Rome Masters in May; these were the first two times that they contested a final on clay. Both dethroned each other as the defending champion, with Djokovic defeating Murray in Madrid by way of a three-set win and Murray reversing the result in Rome with a straight-sets victory. By winning in Rome, Murray became the first player other than Djokovic or any Spanish player to win in the Italian capital since Andre Agassi in 2002, and the first British male champion since Pat Hughes in 1931. After losing to Djokovic in Madrid, Murray trailed him by 9,025 points. Murray then went on a 58-4 streak for the rest of the season, including a loss to Djokovic at the French Open final 3–6, 6–1, 6–2, 6–4 who became the first man since 1969 to win 4 Grand Slam titles consecutively, completing the "Nole Slam". This was the first Major final since the 1984 French Open where the top 2 seeds met and neither had won the title yet.
Murray then went on to win two more Masters finals, three 500 series events and Wimbledon, plus a further Masters final appearance.
Djokovic and Murray met for the first time since the French Open final in the championship match of the season-concluding ATP World Tour Finals in London in November. Of the five meetings (all in championship matches) that took place between the pair in 2016, this one had added significance, as the winner would be the year-end world number one. The stakes were high in Djokovic's case, as a win would have seen him win his fifth overall year-end title, just one short of the overall record held by Roger Federer and Peter Sampras; Murray, on the other hand, was shooting for his first year-end title, having reached the championship match for the first time. Ultimately, Murray won in straight sets, becoming the first man other than Djokovic, Federer or Nadal to finish the year at the top of the rankings since Andy Roddick in 2003.
2017: Qatar Open final
Djokovic and Murray met each other for the last time in a final at the 2017 Qatar Open. They were the top 2 players in the world at the time, with Murray being No. 1 and Djokovic No. 2. The final was a 3-hour thriller where both were going for their shots and had to dig deep to stay in the match. Murray saved multiple match points in the second set to force a decider but in the end it was not enough as Djokovic sealed the victory in the third ending Murray's 28-match win streak. "It was a really, really thrilling performance from both of us. Just a great way to start the year.", Djokovic said after the match. Djokovic and Murray have not played a match against each other since then.
List of all matches
Singles (36)
Djokovic 25 – Murray 11
Analysis
Head-to-head tallies
All matches: (36) Djokovic, 25–11
All finals: Djokovic, 11–8
Grand Slam matches: Djokovic, 8–2
ATP World Tour Finals matches: Tied, 1–1
ATP World Tour Masters 1000 matches: Djokovic, 14–6
Olympic matches: Murray, 1–0
Best of 3 sets matches: Djokovic, 17–9
Best of 5 sets matches: Djokovic, 8–2
Matches lasting 5 sets: Djokovic, 2–1
Grand Slam finals: Djokovic, 5–2
ATP World Tour Masters 1000 finals: Tied, 5–5
ATP World Tour Finals finals: Murray, 1–0
Results on each court surface
Clay courts: Djokovic, 5–1
Hard courts: Djokovic, 20–8
Outdoor: Djokovic, 16–7
Indoor: Djokovic, 4–1
Grass courts: Murray, 2–0
Exhibition matches
Djokovic—Murray (3–0)
Performance timeline comparison (Grand Slam tournaments)
Bold = players met during this tournament
2005–2010
2011–2016
2017–2022
2023–Present
Djokovic–Murray Grand Slam tournament era (2008–present)
*
Combined singles performance timeline (best result)
ATP rankings
Year-end ranking timeline
Career evolution
Novak Djokovic and Andy Murray were born one week apart (22 and 15 May 1987, respectively). Therefore, they have the same age at the end of a season.
updated Monday 11 September 2023
See also
Big Four
Djokovic–Federer rivalry
Djokovic–Nadal rivalry
List of tennis rivalries
Andy Murray career statistics
Novak Djokovic career statistics
References
External links
Djokovic–Murray head-to-head
Novak and Andy The Rivalry
Tennis rivalries
Novak Djokovic
Andy Murray |
```go
package docker
import (
"context"
"encoding/json"
"net/http"
)
// VolumeUsageData represents usage data from the docker system api
// More Info Here path_to_url
type VolumeUsageData struct {
// The number of containers referencing this volume. This field
// is set to `-1` if the reference-count is not available.
//
// Required: true
RefCount int64 `json:"RefCount"`
// Amount of disk space used by the volume (in bytes). This information
// is only available for volumes created with the `"local"` volume
// driver. For volumes created with other volume drivers, this field
// is set to `-1` ("not available")
//
// Required: true
Size int64 `json:"Size"`
}
// ImageSummary represents data about what images are
// currently known to docker
// More Info Here path_to_url
type ImageSummary struct {
Containers int64 `json:"Containers"`
Created int64 `json:"Created"`
ID string `json:"Id"`
Labels map[string]string `json:"Labels"`
ParentID string `json:"ParentId"`
RepoDigests []string `json:"RepoDigests"`
RepoTags []string `json:"RepoTags"`
SharedSize int64 `json:"SharedSize"`
Size int64 `json:"Size"`
VirtualSize int64 `json:"VirtualSize"`
}
// DiskUsage holds information about what docker is using disk space on.
// More Info Here path_to_url
type DiskUsage struct {
LayersSize int64
Images []*ImageSummary
Containers []*APIContainers
Volumes []*Volume
}
// DiskUsageOptions only contains a context for canceling.
type DiskUsageOptions struct {
Context context.Context
}
// DiskUsage returns a *DiskUsage describing what docker is using disk on.
//
// More Info Here path_to_url
func (c *Client) DiskUsage(opts DiskUsageOptions) (*DiskUsage, error) {
path := "/system/df"
resp, err := c.do(http.MethodGet, path, doOptions{context: opts.Context})
if err != nil {
return nil, err
}
defer resp.Body.Close()
var du *DiskUsage
if err := json.NewDecoder(resp.Body).Decode(&du); err != nil {
return nil, err
}
return du, nil
}
``` |
Ngarra (1920–2008) was an Aboriginal Australian artist of the Andinyin and Gija peoples, known for his paintings on canvas and paper which depicted his homelands in the Kimberley region of Western Australia, along with events from the ancestral and colonial past. Among Aboriginal people in the central and east Kimberley he was revered for his deep knowledge of Aboriginal ceremonial practices which he learned from his grandparents Muelbyne and Larlgarlbyne while living nomadically in the remote Mornington Range.
Early life
Ngarra was born in 1920 on Glenroy Station in the west Kimberley. An orphan, he ran away from the station and went to live with his grandparents Muebyne and Larlgarbyne.
Career
Ngarra started painting in 1994. His work was facilitated and documented by the anthropologist Kevin Shaw.
Ngarra's late paintings are defined by his use of vibrant colour contrast, which he achieved by mixing Ara acrylic paints to create his own palette. Ngarra's paintings contain many references to pre-colonial Aboriginal traditions. His works were exhibited at the Western Australian Museum in 2000, and some are held in the National Gallery of Victoria, the Art Gallery of Western Australia and Museum Victoria.
In 2015, sixteen of Ngarra's works were included in the exhibition No Boundaries: Aboriginal Australian Contemporary Abstract Painting. Organised by William Fox and Henry Skerritt for the Nevada Museum of Art, the exhibition toured to five museums across the United States. A tribute to the artist was included in the inaugural Tarnanthi exhibition in 2015 at the Art Gallery of South Australia.
Collections
Artbank
Art Gallery of Western Australia
Berndt Museum of Anthropology, University of Western Australia
Edith Cowan University
Kluge-Ruhe Aboriginal Art Collection of the University of Virginia
Museum Victoria
Redland City Art Gallery
Western Australian Museum
Significant Exhibitions
2000: Ngarra, Images of His Country. Katta Djinoong Gallery, Western Australian Museum, Perth, Western Australia, Australia
2000: National Indigenous Heritage Award., Australian Heritage Commission, Canberra, Australian Capital Territory, Australia
2014: The World is Not a Foreign Land. Ian Potter Museum of Art, University of Melbourne, Melbourne, Victoria, Australia
2015 No Boundaries: Aboriginal Australian Contemporary Abstract Painting. Nevada Museum of Art, Reno, Nevada, USA
2015: Tarnanthi. Art Gallery of South Australia, Adelaide, South Australia, Australia.
References
Further reading
Coslovich, Gabriella Ngarra finds his art through the hands of time. The Age, Oct 05, 2002.
Late bloomer's broad palette. 2008. The Canberra Times, 11 December 2008.
Sprague, Quentin. "Outside history-Mick Jawalji and Ngarra." Art Monthly Australia 244 (2011): 80.
Skerritt, Henry F. "Ngarra, Andinyin/Kitja, Artist, c. 1920-2008." Art Monthly Australia 216 (2008): 42.
Skerritt, Henry F. Culture mirrored in art. The Courier-Mail, Dec 30, 2008.
Skerritt, Henry F. A master of tradition and innovation. Sydney Morning Herald, Dec 06, 2008.
20th-century Australian painters
21st-century Australian painters
Artists from Western Australia
Australian Aboriginal artists
2008 deaths
Year of birth uncertain |
The Kentucky High School Athletic Association (KHSAA) is the governing body of athletic programs for junior and senior high schools in the state of Kentucky. It conducts state championship competitions in all the KHSAA-sanctioned sports.
Fall sports
Cross country
Field hockey
Football
Golf
Soccer
Volleyball
Winter sports
Boys' basketball
Girls' basketball
Swimming and diving
Wrestling
Spring sports
Baseball
Softball
Tennis
Track and field
See also
List of high schools in Kentucky
Kentucky High School Athletic Association
External links
Kentucky High School Athletic Association official website
References
High school sports in Kentucky |
Zemun railway station (, ) is a rail station in the neighborhood and municipality of Zemun in Belgrade, the capital of Serbia. It is served by BG Voz and by Regio class trains. The railroad continues to Zemun Polje in one direction, and Tošin Bunar in the other direction. Zemun railway station spans 9 railway tracks.
After the station was selected as Belgrade's main freight station within the Belgrade railway junction, a massive expansion and reconstruction of the complex began in 2019.
Old station
The original Zemun railway station was located next to where the modern Hotel Jugoslavija is. It was built in 1883 during the rule of Austria-Hungary, when the railway, which connected Zemun to Novi Sad, was finished. The first train from the station departed on 10 December 1883. In 1884 the railway was extended across the Sava into the Kingdom of Serbia as the first railway in the country. The very first train from Serbia, with the passengers including King Milan, Queen Natalija and Crown Prince Alexander, stopped at this station on its way to Vienna in 1884. Via the Old Railway Bridge, the Zemun station was connected to the Belgrade Main railway station.
Due to its location at the proximity of the border, the station also served as the customs house, colloquially called "Old Austrian Custom". The station complex also included classification yard. Later, when Zemun and Belgrade became part of the same state, and then joined into one city, Zemun's station became the classification yard for the entire Belgrade railway junction, as it was conceived at that time - Belgrade Main railway station-Zemun railway station-Beograd Dunav station. This has done as after World War I Belgrade's main station became overloaded. The Zemun station, however, also had no capacity to serve properly as the classification yard for much enlarged number of trains.
During World War II occupation, the classification yard was massively enlarged. In this period, new tracks were built to connect the station with Bežanija airport, and to Zemun port. After the war, the station was constantly overloaded with the expanding traffic. In 1960, the yard received 19,029 freight trains with 964,996 cars. As the yard had only of tracks, or 60% of needed number, the cars were spending in the station 8 to 10 hours.
In 1967, it was decided to relocate the tracks, so the railway Zemun Novi Grad-New Belgrade-Sava bridge was projected. It included tunnel through Bežanijska Kosa. Also, a massive classification yard in Makiš was built, and took over as the main such facility in Belgrade. With these projects finished, and the first train passing via the new route in 1970, a demolition of the former station and dismantling of the tracks began that same year. The boiler room was already demolished a bit earlier. The station's building, "pride of Zemun", was demolished and replaced with new urban blocks along the modern municipal border between Zemun and New Belgrade. Demolition of the building itself, and the surrounding warehouses lasted for several years.
To commemorate the old station, architect Milun Stambolić designed a memorial complex which consists of 5 pillars and several meters of railroad tracks. The pillars used to hold the station's overhang on the platform side of the building. The complex is placed on the plateau next to Hotel Jugoslavija, on the small elevation above the promenade along the Danube. The memorial was dedicated on 22 October 1984.
New station
Construction of the new station began in 1977. It became operational in 1981, but was never fully finished. In 1982 the double-track railway Zemun-Zemun Polje was finished. This was just a fraction of the project envisioned at the time for the new station.
Railway reconstruction
In 2016 a contract was signed in Riga, Latvia, with Chinese companies China Communications Construction Company and China Railways International for the modernization of the Belgrade-Stara Pazova section. The section is long and the works envisioned leveling of all crossings, uniforming of platforms, renovation of all stations along the route, underground passages, formation of the green areas, etc. Stations planned for reconstruction or adaptation included New Belgrade, Tošin Bunar (which should be relocated a bit), Zemun, Zemun Polje, Batajnica, Nova Pazova and Stara Pazova, while stations at Altina and Kamendin, also in the Zemun territory, will be built. It was announced that the railway will be finished by 2018.
The reconstruction had three phases: Prokop-Zemun, Zemun-Batajnica and Batajnica-Stara Pazova. Phase I and III was done first. The freight and passenger tracks were separated in the Batajnica-Stara Pazova section. Works started in November 2017 and the entire project was to be finished in 36 months, by November 2020. When everything is said and done, the train speed in the Belgrade-Batajnica section will be and in Batajnica-Stara Pazova section up to .
After numerous delays, and four and a half years of discontinuation of railway traffic between Belgrade and Novi Sad, the railway was reopened on 19 March 2022.
2010s diffusion of traffic
By 2018, the system of Belgrade Railway Junction was envisioned to be centered around the Prokop (passenger traffic), Zemun (freight traffic) and Makiš (Belgrade marshalling yard) stations. Gradual moving of trains from the Belgrade Main railway station to Prokop station began in the early 2016. In December 2017, all but two national trains were dislocated to "Belgrade Center".
Problems arose immediately. The Prokop was still unfinished, had no station building nor a proper access road and public transportation connections with the rest of the city. Additionally, it had no facilities for loading and unloading cars from the auto trains nor was ever planned to have one. Still, in January 2018 it was announced that the old station will be completely closed for traffic on 1 July 2018, even though none of the projects needed for a complete removal of the railway traffic were finished. The Prokop was incomplete, a projected main freight station in Zemun was not adapted at all (including car loading platform), while there was even no project for the Belgrade railway beltway.
A series of temporary solutions was applied. A defunct and deteriorated Topčider railway station was partially revitalized and adapted for auto trains. Its major flaw was a bad public transportation connection (only one tram line, No. 3), so the railway company asked officially for this problem to be solved. It was announced that the official deadline for the construction of the station building in Prokop is 2 years, however there are no funds for it. A second part of the Kuwaiti loan (€50 million) is still not approved and the needed public procurements will be finished by the end of 2018.
Freight station in Zemun will be located between the existing stations Zemun and Zemun Polje, on the area of . Revitalization of the existing of tracks and of buildings will be followed by the construction of the of new tracks and additional of edifices. Deadline was also 2 years, but the works should start only at the end of 2018. That way the planned Belgrade railway junction won't be finished before 2021, at best. However, minister for transportation, Zorana Mihajlović, in December 2017 gave conflicting deadlines. She said that the station building in Prokop will be built from April 2018 to April 2019 and that freight station Zemun should be finished by the end of 2018.
Expansion
The works on the Zemun railway station complex began on 9 September 2019, and the deadline was set for 11 November 2021. The finished station should spread on 17 tracks, with varying lengths (), and on five, long platforms. They will be connected with the central pedestrian underpass, and two additional freight and luggage underpasses. The new station building is also being built.
In October 2018 a deadline for finishing the Zemun station was extended to early 2022. The works were quite slow for the first few years, but then were accelerated, especially in 2022. In late March 2022, the station was re-opened as part of the opening of the reconstructed Belgrade–Novi Sad railway. The new station building was built on the opposite side of the tracks, however the platform and track numbering starts from the side of the old building. Four island platforms serve eight out of nine tracks, while the central track (number 5) runs through. Platform are accessed through an underground passageway.
In June 2022, deadline for completion of the entire complex was moved to 30 September 2022. The works continued to drag on, so the Chinese investor replaced the sub-contractors. The station was equipped with elevators in March 2023.
Gallery
See also
Srbija voz
Beovoz
BG Voz
References
Railway stations in Belgrade
Zemun |
Abū al-Ḥasan Muḥammad bin al-Ḥusayn bin Mūsā al-Abrash al-Mūsawī (; 970 – 1015), also known as al-Sharīf al-Raḍī (; ) was a Shia scholar and poet.
Al-Radi wrote several books on Islamic issues and interpretation of the Quran. His most well-known book is Nahj al-Balagha.
His elder brother al-Sharif al-Murtada was also a theologian and poet. His work is still published in the universities of Cairo and Beirut, and is part of the course of Arabic literature.
Family tree
Al-Radi was a descendant of Ibrahim al-Asghar, the son of the seventh Shia imam, Musa al-Kazim. There are also claims that he is the descendant of Ibrahim al-Mujab, the grandson of al-Kazim. His mother was the granddaughter of Hasan al-Utrush, a descendant of the fourth Shia imam, Ali Zayn al-Abidin. For this reason, he was also known as thil hasabayn (the possessor of two lineages), since he relates back to the Ahl al-Bayt paternally and maternally.
Biography
Al-Radi was born in 970 in the Abbasid capital, Baghdad, and died in 1015 in his hometown. His grave is located in Kadhimiya, Baghdad. Al-Radi was the third of four children, having two sisters and a brother. For a long time, his father, Husayn, occupied the post of naqib of the Talibids of Iraq. After his father's death, he took the post.
Al-Radi's family was affluent, as his mother Fatima inherited a good fortune from her father. She sponsored the family when the property of her husband was confiscated by the Buyid prince 'Adud al-Dawla.
Education and teaching
After al-Radi completed primary education, his mother took her two sons to al-Shaykh al-Mufid for their education. He started teaching at the young age of 17 when he was himself studying. In addition to al-Mufid, he also studied Arabic under Abu Sa'id al-Hasan ibn 'Abd Allah ibn Marzban al-Sirafi, an expert in Arabic language and literature. His teacher in fiqh was Muhammad ibn al-Abbas al-Khwarizmi.
He also founded a school named Dar ul'Ilm (, literally House of knowledge) in which he trained many students.
Character and literary status
In al-Radi's lifetime, Abbasid rulers of Baghdad were at war with the Fatimid Caliphate of Egypt, and attempted to have all important Sunni and Shia figures sign a mahzur (public attestation decree) in favour of the legitimacy of war with the Egyptian rulers; al-Radi, his father, and brother were also coerced to sign it, but refused to sign. He devoted twenty years of his life in compiling Nahj al-Balaghah, and traveled to many libraries to collect texts that had recorded the lectures, letters, and sayings that Ali had written or delivered on different occasions.
Works
The Nahj al-Balagha (Peak of Eloquence) is considered a masterpiece of literature in Shia Islam. The book is a collection of sermons, precepts, prayers, epistles, and aphorisms of Ali and compiled by al-Radi in the tenth century. As the reference material came to his attention at different times, the materials have no chronological sequence with respect to content or topic. A number of his contemporaries wrote commentaries on al-Radi's compilation.
Extent and scope of compilation
Ali's sermons were compiled, read, and taught before al-Radi was born. The services of al-Radi are now regarded as significant in the philosophy of monotheism.
Collected sermons in the Nahj al-Balagha mainly cover Islam and the Quran; humans and humanity; theology and metaphysics; path and worship, including prayers; social justice and administration; wisdom and admonition; prophecies; philosophy and critique over contemporary society; Ahl al-Bayt; and piety and the afterlife.
However, critics of the Nahj al-Balagha generally raise two objections: they claim that al-Murtada is the actual author, and most of the contents are falsely attributed to Ali.
Offspring and death
Some historians believe al-Radi died at 47 years of age on the sixth of Muharram, 406 A.H (1015 AD), while others his death at 45 years of age in 404 Hijri (1013 AD). His funeral prayer was performed by the Abu Ghalib Fukhrul Mulk, then vizier in the kingdom of Sultan al-Dawla.
Abu Ahmad Adnan was the only son of al-Radi. His son was also a prominent scholar of his time and after death of his uncle the official post of Naqib al-Nuqqab was entrawarded to his grandfather. Adnan died without progeny in 449 Hijri Calendar, and consequently the physical line of al-Radi came to an end.
See also
Fakhrul Mulk
Islamic scholars
List of deceased Maraji
References
External links
hadith.net
For study: al-Radhi glimpses of his life and his contributions to cognitive
970 births
1015 deaths
10th-century Arab people
10th-century Muslim scholars of Islam
Al-Moussawi family
Iraqi Shia Muslims
Shia scholars of Islam
Writers from Baghdad |
The 2012–13 SV Wacker Burghausen season is the 83rd season in club history. The season started on 21 July 2012 and will finish on 18 May 2013. The club is participating in the 3. Liga, DFB-Pokal and Bavarian Cup. They play their home matches at Wacker Arena.
Review and events
The 2012–13 SV Wacker Burghausen season started on 21 July 2012 with a home loss to Preußen Münster and will end at home on 18 May 2013 against Arminia Bielefeld. The club is the participating in the 3. Liga, DFB-Pokal and Bavarian Cup.
Competitions
3. Liga
League table
Matches
DFB-Pokal
Bavarian Cup
Notes
References
Wacker Burghausen
SV Wacker Burghausen seasons |
Michał Pytkowski (born April 20, 1989 in Warsaw) is a Polish footballer who currently plays for Nielba Wągrowiec on loan from Widzew Łódź.
Career
Club
In July 2011, he was loaned to Pelikan Łowicz.
References
External links
1989 births
Living people
Polish men's footballers
Men's association football goalkeepers
Sokół Pniewy players
Widzew Łódź players
Footballers from Warsaw |
The Australian Fire Service Medal (AFSM) is awarded for distinguished service by a member of an Australian fire service.
The AFSM was introduced in 1988, and replaced the Imperial awards of the Queen's Fire Service Medal for Gallantry and the Queen's Fire Service Medal for Distinguished Service. Recipients of the Australian Fire Service Medal are entitled to use the post-nominal letters "AFSM".
Awards are made by the Governor-General, on the nomination of the responsible minister in each state or territory, and at the federal level. The total number of awards each year must not exceed the following quota:
one award for each 1,000, or part of 1,000, full-time permanent members of the combined fire services of each state;
one award for each 5,000, or part of 5,000, part-time, volunteer or auxiliary members of the combined fire services of each state; and one additional award in each state;
one award of the Medal shall be made in each calendar year in respect of the combined fire services in each of the Australian Capital Territory and the Northern Territory of Australia;
one award of the Medal shall be made in each calendar year in respect of a Commonwealth fire service; and
an occasional award (not exceeding one per calendar year) may be made in respect of the fire service of an External Territory as determined by the responsible Minister.
Description
The AFSM is a circular copper-nickel medal. It is ensigned with the Crown of St Edward. The obverse displays an image of The Queen superimposed over a seven-pointed star of flames.
The reverse is inscribed with the words ‘Australian Fire Service Medal’, and ‘For Distinguished Service’ on a background of flames.
The 32 millimetre-wide ribbon has a central vertical band of gold, which is superimposed with a red pattern symbolising flames. The two outer vertical bands are green.
See also
Australian Honours Order of Precedence
References
Australian Fire Service Medal, It's an Honour, Department of Prime Minister and Cabinet, Australian Government
Civil awards and decorations of Australia
Fire service awards and honors
1988 establishments in Australia
Awards established in 1988
Long and Meritorious Service Medals of Britain and the Commonwealth |
Sleep Party People is the alias of musician Brian Batz, hailing from Denmark.
History
Sleep Party People was formed in 2008 as a project of Brian Batz, influenced by artists like Boards of Canada, David Lynch and Erik Satie, starting a unique proposal of the Danish music scene. Since its beginning, the one-man project has been characterized by wearing rabbit masks in his photoshoots and live performances.
Contrary to the misconception that Sleep Party People is a band, Brian Batz is the sole member of Sleep Party People. Kaspar Kaae, Jacob Høegh, Ask Bock, Casper Hegstrup, Anders Stig Møller, Hans Hvidberg, Per Lyhne, Rasmus Lindahl, Line Felding, and Frederik Thybo have all performed with Batz in live shows. Batz explains in an interview with Motion Pikczer, "It's a bunch of good friends that's playing with me. So, it's not a band, it's just me and my bunnies, in a way."
Quickly gaining acceptance, Sleep Party People was featured in Soundvenue, a magazine covering the Danish music scene. After this, the record label Neh-Owh Records chose two of his songs to be featured in a compilation EP. In the end of 2009, Batz signed with the label A:larm Music. In 2010, he released his self-titled debut album with 10 songs.
With this success, Batz was featured in Dutch and British magazines.
In April 2012, Sleep Party People released a new album titled We Were Drifting on a Sad Song. In 2013, they toured the United Kingdom.
In 2013, Batz traveled to San Francisco to start to craft the third album in the company of producers Jeff Saltzman and Mikael Johnston. Batz recorded and wrote everything there and returned to Denmark with a nearly finished album. The album, Floating, was released in Scandinavia and Asia on May 30, 2014, and worldwide on June 2, 2014.
Sleep Party People was signed by Joyful Noise Recordings in February 2017.
Discography
Studio albums
Sleep Party People (2010)
We Were Drifting on a Sad Song (2012)
Floating (2014)
Lingering (2017)
Lingering Pt. II (2018)
Heap of Ashes (2022)
Singles
"A Dark God Heart" (2010)
"Remixes" (2011)
"Chin" (2012)
"Gazing at the Moon" (2012)
"In Another World" (2014)
"Floating Blood of Mine" (2014)
"The Missing Steps" (2017)
"Fainting Spell" (2017)
"The Sun Will Open Its Core" (2017)
"4th Drawer Down" (2018)
"The Mind Still Travels" (2018)
"The Fallen Barriers Parade" (2018)
"Moving Cluster" (2018)
"Renhoh 93" (2018)
"Outcast Gatherings" (2018)
"Tide" (2022)
"Spider Cracks" (2022)
"It Won't Be Cinematic" (2022)
Critical notes
The Current wrote: "As band names go, Sleep Party People is pretty apt. This Danish five-piece – who wear rabbit masks on stage to overcome shyness – create music for the early hours, when you're about to go to sleep but you've got a nice mug of tea to finish first. Combining a love of ambient music and old instruments, Sleep Party People draw on the post-rock soundscapes of Mogwai and Sigur Ros, with pretty melodies building to brutal climaxes."
References
External links
Myspace
Speed of Sound Label
Musical groups established in 2008
Danish alternative rock groups
Joyful Noise Recordings artists |
Frank Soo (8 March 1914 – 25 January 1991) was an English professional football player and manager of mixed Chinese and English parentage. He was the first player of Chinese origin to play in the English Football League, and the first player of an ethnic minority background to represent England, though in unofficial wartime matches.
He initially began his career at inside-left, though later became more established at half-back. A quick and intelligent player, he was an excellent passer of the ball. He grew up in Liverpool and began his playing career with Prescot Cables, before he joined Stoke City for a £400 fee in January 1933. He made his first team debut in November 1933, and became established in the first team by the 1935–36 season. He lost most of his best playing years to World War II, leaving him only able to serve in the Royal Air Force and play for Stoke and England in unofficial wartime games, as well as guest for numerous other clubs. He was sold on to Leicester City for a fee of £4,600 in September 1945, and then moved on to Luton Town 10 months later for £5,000. He joined Chelmsford City of the Southern League in May 1948, and retired as a player after two seasons.
A stern task-master, he began to coach for European clubs in the 1950s and early 1960s. He briefly coached Finnish club Helsingin Palloseura in 1949, before taking charge at Isthmian League side St Albans City for the 1950–51 season. He was appointed manager of Italian Serie A club Padova in April 1951, but left the club 11 months later following the sudden death of his wife. He then coached Norway at the 1952 Summer Olympics, then led Eskilstuna to promotion out of the Swedish Division 3 Östra in 1952–53. He briefly managed Örebro, before he coached Djurgården to the Allsvenskan title in 1954–55. He then returned to lower league football with Oddevold, securing promotion out of Division 3 Nordvästra Götaland in 1955–56. He coached at AIK in 1958, before returning to England to manage Scunthorpe United in June 1959. He took Scunthorpe to 15th in the Second Division in the 1959–60 season, before he resigned in May 1960. From there he struggled to find work, spending short periods in charge at Frigg (Norway), IFK Stockholm (Sweden), Fredrikstad (Norway), and Akademisk Boldklub (Denmark).
Life
Frank Soo was born in Buxton, Derbyshire on 8 March 1914, and brought up in Liverpool. His parents, a Liverpool-based Chinese sailor father, Our Quong-Soo (; also Ah Kwong-Soo), and an English mother, Beatrice Whittam, had married in Chorlton, Manchester in 1908. The couple had moved to the village of Fairfield to open a laundry, as was commonly done by Chinese emigrants in England at the time, before eventually moving premises to West Derby, Liverpool around 1920. He had an elder brother, Norman, and several younger siblings: Phyllis, Ronald, Jack, Harold and Kenneth. His brother, Ronald, was killed on 14 January 1944, while serving as an air gunner in No. 166 Squadron.
Soo married hairdressing salon proprietor Beryl Freda Lunt in Stoke-on-Trent on 12 June 1938, and the couple honeymooned in Bournemouth. Freda, as she was known, was a keen autograph hunter, and had initially introduced herself to Soo simply to ask for his signature. The couple separated in 1951, and Freda died as a result of a barbiturate overdose on 10 March 1952; it was not known whether her death was intentional or accidental.
Playing career
Stoke City
Soo played for Norwood, West Derby and West Derby Boys' Club, and was scouted by both Everton and Liverpool without ever being signed by either club. He instead began his senior career with Cheshire League side Prescot Cables in late 1932, whilst working as an office clerk. He was quickly signed by Stoke City for a £400 fee on 25 January 1933, after being spotted by the club's scouts. Tom Mather handed Soo his debut at the expense of Harry Ware after picking him to play inside-left against Middlesbrough at Ayresome Park on 4 November 1933, making him the first player of Chinese descent to play in the Football League; the match ended in a 6–1 defeat. Despite the heavy defeat he was praised as Stoke's stand out performer, and kept his place for the 1–0 defeat to Manchester City at the Victoria Ground seven days later. He made a third appearance in a loss to Arsenal at Highbury, before being dropped for six matches. He scored his first goal in professional football on 3 January 1934, as Stoke beat Bradford Park Avenue 3–0 in the third round of the FA Cup, and then scored again as Stoke defeated Blackpool by the same scoreline in the following round 24 days later. He scored his first league goal for the "Potters" on 29 January, concluding the scoring in a 3–0 victory over Huddersfield Town. He made a total of 16 appearances during the 1933–34 season, scoring three goals, as Stoke posted a 12th-place finish in the First Division.
Soo featured mainly for the Reserves during the 1934–35 campaign, as the forward line of Harry Davies, Joe Johnson, Bobby Liddle, Stanley Matthews and Tommy Sale proved to be highly effective, scoring 60 of the club's 71 league goals on the way to a tenth-place finish. He failed to make a first team appearance between September and 9 March, only returning to the side following a run of three consecutive defeats. He broke his leg during 1935–36 pre-season training, but made a speedy recovery to feature in a 2–0 defeat to Liverpool at Anfield on 18 September. He found himself a first team regular under new manager Bob McGrory, who utilised him as a left-sided half-back in the place of ageing veteran Harry Sellars. Playing alongside Arthur Turner and Arthur Tutin, Soo would be a part of one of the club's great half-back lines. He played a total of 40 matches that season, helping Stoke to a fourth-place finish, the highest in the club's history.
Stoke were inconsistent across the 1936–37 season, recording a 10–3 victory over West Bromwich Albion (a game which Soo missed due to injury) in the middle of a run of eight defeats in 11 league fixtures. Soo made 31 appearances, as City finished in tenth-place. Soo scored four goals from 45 appearances during the 1937–38 campaign, and played at centre-forward on two occasions in November due to injuries to Freddie Steele and James Westland. However Stoke struggled again, falling to 17th-place in the league and being knocked out of the FA Cup by Bradford Park Avenue. Soo succeeded Turner as acting club captain in March 1938, and was formally named as captain in the summer.
In October 1938, Stoke rejected a bid from Brentford of £5,000 for Soo. Stoke recovered from a poor start to the 1938–39 season to finish in seventh-place, with Soo scoring three goals from 44 appearances, sometimes being asked to play out of position due to injuries to other players. His name was put forward in numerous newspapers for selection in the England team, with the Daily Express stating that "Soo, of Stoke, is one of the finest halves in the game, and it would be no less than he was worth if they put him in". However he lost the chance to represent England due to the outbreak of World War II, which had also caused Stoke City to cancel their planned 1939 summer tour of Germany and Poland, and then led the Football League to cancel the 1939–40 season after just three matches. Before the league was suspended, Soo's midfield partnership with Turner and Tutin – with Matthews and Steele in attack – had made Stoke one of the favourites for that season's league title.
World War II
Soo initially found work in the engineering department of the Michelin tyre company in Stoke-on-Trent, which allowed him to play wartime matches for Stoke City. Throughout the war he played at full-back, right half-back, left-half-back and inside-left, filling in as need be as team-mates would be unavailable for selection due to service or work commitments. He also appeared for Newcastle United, Blackburn Rovers, Everton, Chelsea, Reading, Brentford, Port Vale, Crewe Alexandra, Millwall, and Burnley, and played nine times for the England national football team between 1942 and 1945 (in Wartime and Victory Internationals), the first non-white person ever to play for the national team (albeit in semi-official matches only) and the only person of East Asian descent to date. He also played for several FA representative teams not officially described as "England". He played mainly for Stoke City however, scoring three goals in 28 appearances in the 1939–40 season as Stoke won the War League West Regional Championship. He then scored four goals from 18 matches in 1940–41.
He was called up to the Royal Air Force (RAF) on 28 July 1941, and spent most of his time in the RAF working in the technical training of aircrews. As time went on he was based further away from Stoke and became unable to play for the club, he scored three goals from 12 appearances in 1941–42 and four goals from 13 matches in 1942–43, before he was stripped of the captaincy. He played just two games for Stoke in 1943–44, and scored three goals from eight games in 1944–45. In April 1945, Soo submitted a transfer request after growing tensions between himself and McGrory due to his lack of availability and his frustrations at being played out of position by McGrory, who also had a similarly tense relationship with star player Stanley Matthews.
Leicester City
On 27 September 1945, Soo was sold to Leicester City for a fee of £4,600, rejoining the manager who had signed him for Stoke, Tom Mather. He was named as the "Foxes" new club captain less than two weeks later. However Leicester struggled in the 1945–46 season, and he was transfer-listed in January despite being one of the better performers at Filbert Street. He was demobilised from the RAF on 26 April 1946.
Luton Town
Soo joined Luton Town in July 1946 for a fee of £5,000. The "Hatters" started the 1946–47 season poorly, losing eight matches by mid-November. However, after going three goals down to league leaders Newcastle United, manager George Martin gave what Soo described as "the most unusual pep talk I have ever heard" and inspired a 4–3 comeback victory. Luton went on to finish the season 13th in the Second Division, with Soo making 38 league and four FA Cup appearances. He then scored five goals in 36 appearances in the 1947–48 season, though new manager Dally Duncan could not take Luton above 13th-place, and he allowed Soo to leave Kenilworth Road in the summer.
Chelmsford City
On 28 May 1948, Soo signed with Chelmsford City from Luton for a reported "substantial transfer fee". He was appointed as club captain and as a coach and helped Arthur Rowe's "Clarets" to finish second in the Southern League in 1948–49, before being transfer-listed in the summer after failing to agree terms with the club. He spent the summer coaching Finnish club Helsingin Palloseura. Rowe left to manage Tottenham Hotspur and Soo applied to succeed him as Chelmsford manager, but lost out to Jack Tresadern. He submitted a transfer request in November 1949 so as to try and find a club closer to his wife's family home in Stoke-on-Trent following her father's death, and also due to increasing tensions between himself, Tresadern, and the club's board of directors. Kidderminster Harriers offered Chelmsford £1,000 for his services, but Soo refused to join the club. He was forced to play for Chelmsford Reserves as the dispute rumbled on, before he was reinstated in the first team in January following outcry from the club's supporters. City finished in fourth-place at the end of the 1949–50 season, and though Soo was named on the club's retained list he instead retired as a player to join St Albans City as manager on 30 May 1950.
Style of play
Soo was quick and intelligent, and was noted for his ability to deliver perfectly placed passes. Stan Mortensen wrote in his autobiography, Football Is My Game, that Soo was one of the four best wing-halves he ever played with (alongside George Farrow, Billy Wright and Harry Sellars), and "seemed incapable of a clumsy movement". Arsenal's Alex James described him as "modern for his time".
Managerial career
Padova
Soo had spent the summer of 1949 coaching Finnish club Helsingin Palloseura, before entering management full-time at Isthmian League side St Albans City in May 1950. He led the "Saints" to a ninth-place finish at the end of the 1950–51 season, and on 12 April 1951 he was appointed as manager of Italian club Padova following Giovanni Ferrari's dismissal as manager. The press had accused the "Patavini" players of laziness, and Soo's reputation as a stern taskmaster was seen as a good solution. Padova beat Napoli 2–0 on the final day of the 1950–51 season to avoid relegation out of Serie A, and finished just a point ahead of 19th-placed Roma. His main summer signing was Norwegian player Knut Andersen, though the transfer was only completed in December when clearance from the Scandinavian Federation was confirmed; on Andersen's debut Padova managed to beat reigning champions Milan 5–2 at the Stadio Silvio Appiani. However the team struggled in the second half of the 1951–52 season, and Soo left the club on 13 March to return to England following his wife's death; Gastone Prendato was named as his successor at Padova, but could not keep the club out of the relegation zone by the end of the season.
Scandinavia
He signed a one-year contract to manage Swedish club Eskilstuna in May 1952, but took charge of the side after first working as head coach of the Norway national football team for the 1952 Summer Olympics in Helsinki. He took charge of just one match, as Norway were defeated 4–1 by neighbours and reigning gold medallists Sweden in the first round of the tournament. Returning to Eskilstuna, he told the press that he wanted to initiate a new playing style of "long, sweeping passes", and in addition to coaching the first team he also took charge of the youth team and coached at local Eskilstuna schools. He also initiated a total ban on alcohol for his players, which some in the media criticised as totalitarian and unnecessary. The club finished third in the Östra region of Division 3 in 1952–53, but were promoted into Division 2 due to a re-organisation of the league system.
Soo was appointed manager of newly relegated Division 2 Svealand club Örebro in 1953, however soon became unpopular with some players in his new dressing room due to his strict training methods. Despite his apparent unpopularity, he still managed to take the club to a second-place finish at the end of the 1953–54 season, one place ahead of Eskilstuna. He again did not stay long though, and was appointed as manager at Allsvenskan club Djurgården in June 1954, succeeding Welshman Dai Astley. He was also linked with the Swedish national team job, but the SvFF opted not to appoint a full-time manager following failure to qualify for the 1954 FIFA World Cup. He instead accepted a post as part-time coach of Sweden, still to be officially managed by a committee, but left the post following heavy defeats to the Soviet Union and Hungary. Back at Djurgården, his physical style of play proved to be highly effective and he led the "Blåränderna" to the league title at the end of the 1954–55 season, after which he tendered his resignation.
Soo was appointed manager of Division 3 Nordvästra Götaland club Oddevold on 21 February 1956, and led the club to promotion as runners-up of their region in 1955–56. However the team struggled in the Västra Götaland region of Division 2 in the 1956–57 campaign, and Soo left the club in February 1957; his successor, Sven-Ove Svensson, led the club to an eighth-place finish. In December 1957, he was appointed as trainer at Allsvenskan club AIK, working alongside former Sweden selection committee chairman Putte Kock. However he soon caused controversy after trying to focus his players primarily on football, which angered bandy playing twins Bengt and Björn Anlert. The "Gnaget" finished ninth in 1957–58, and Soo and the players suffered a difficult relationship.
Scunthorpe United
On 8 June 1959, Soo returned to England and was appointed manager of Second Division club Scunthorpe United, and immediately came under fire from vice-chairman Doug Drury, who said the club could not afford Soo's £1,600-a-year salary. He signed defender Dennis John, winger Martin Bakes and centre-forward Barrie Thomas; Thomas went on to score 26 goals as the "Iron" recorded a 15th-place finish at the end of the 1959–60 season. Writing in February 1960, Ipswich Town manager Alf Ramsey described Scunthorpe as "one of the most improved clubs in the country, since manager Frank Soo took over the reins at the Old Showground at the start of the season, the football produced by this little club has at times matched the best". However, Soo resigned in May 1960.
Later career
In 1961, Soo returned to Scandinavia and managed Frigg in Oslo, the capital of Norway for one season. Two years later Soo was appointed manager of the Israel national team and was due to take charge in October 1963, but a last-minute disagreement between himself and the Israel Football Association meant that he never formally took charge of the team, and the job instead went to George Ainsley. He subsequently returned to Scandinavia, and briefly took charge at IFK Stockholm, before he was appointed manager of Norwegian First Division club Fredrikstad in January 1964. He had a "short and turbulent" reign, again finding his players resentful of his prohibition of alcohol, and led the club to a second-place finish in 1964, before he resigned on 15 December 1964. In November 1965, he was appointed manager of Danish 1st Division club Akademisk Boldklub, and led the "Akademikerne" to fifth-place and sixth-place finishes in 1965 and 1966. However, by this time he had established a reputation as a manager who was difficult to work with, highly demanding both in what he asked of his players and what he asked for financially, and someone who very quickly moved on. He remained in Sweden for the rest of the 1960s, though nearly made a return to coaching with the Hong Kong national team in April 1972, though did not take up the post as the HKFA were only prepared to offer him a one-year contract. He returned to Stoke-on-Trent by the 1980s, and later died due to complications of dementia at a cottage hospital in Cheadle on 25 January 1991.
Style of management
In an interview with Swedish newspaper Fotboll, Soo said that "usually I run with the boys for 90-minutes. Then I try to make that time as intense as possible... I want them to be tired after training". He was described as a slavdrivare (slave driver).
Legacy
A street was named after him on what used to be the site of the Victoria Ground in Stoke. The Frank Soo Foundation was created in Soo's honour in 2016, the aim of which is to promote his story and continue his legacy. An annual five-a-side charity football tournament is held in his honour, with the Player of the Tournament award being named after him. The foundation also promotes and encourages more participation for people from East and South East Asian backgrounds in football.
On 8 May 2020, to commemorate the anniversary of his first England cap, Soo was honoured by Google with a Doodle.
Career statistics
Playing statistics
Source:
Managerial statistics
Source:
Honours
Eskilstuna
Division 3 Östra promotion: 1952–53
Djurgården
Allsvenskan: 1954–55
Oddevold
Division 3 Nordvästra Götaland promotion: 1955–56
References
Specific
General
1914 births
1991 deaths
Footballers from Buxton
Footballers from Liverpool
English people of Chinese descent
British sportspeople of Chinese descent
British Asian footballers
English men's footballers
England men's wartime international footballers
Men's association football midfielders
Men's association football forwards
Prescot Cables F.C. players
Stoke City F.C. players
Newcastle United F.C. wartime guest players
Blackburn Rovers F.C. wartime guest players
Everton F.C. wartime guest players
Chelsea F.C. wartime guest players
Reading F.C. wartime guest players
Brentford F.C. wartime guest players
Port Vale F.C. wartime guest players
Crewe Alexandra F.C. wartime guest players
Millwall F.C. wartime guest players
Burnley F.C. wartime guest players
Leicester City F.C. players
Luton Town F.C. players
Chelmsford City F.C. players
English Football League players
Southern Football League players
Association football coaches
Chelmsford City F.C. non-playing staff
English football managers
English expatriate football managers
St Albans City F.C. managers
Calcio Padova managers
Norway national football team managers
IFK Eskilstuna managers
Örebro SK managers
Djurgårdens IF Fotboll managers
IK Oddevold managers
AIK Fotboll managers
Scunthorpe United F.C. managers
IFK Stockholm managers
Fredrikstad FK managers
Serie A managers
English Football League managers
Isthmian League managers
Royal Air Force personnel of World War II
English expatriate sportspeople in Finland
Expatriate football managers in Finland
English expatriate sportspeople in Italy
Expatriate football managers in Italy
Expatriate football managers in Norway
English expatriate sportspeople in Sweden
Expatriate football managers in Sweden
English expatriate sportspeople in Denmark
Expatriate football managers in Denmark
Deaths from dementia in England |
Bekbol Sagyn (, Bekbol Ubaıdollauly Saģyn; born in 1972) Kazakh statesman.
Biography
Sagyn was born in 1972 in Aktobe. He enrolled in the Kazakh State Academy of Management. He did not graduate but transferred to the Kazakh Humanitarian Law University, and later graduated from the Kazakh Engineering and Technical Academy with an undergraduate degree. Sagyn later received a graduate degree in economic sciences.
He began his professional career in 1993 by working in the financial systems of the region. From 1998 to 2003, he was employed in numerous tax departments of the Aktobe region. He also served as deputy head of education for the entire Aktobe region from 2003 to 2004. In addition, he served as the deputy akim (mayor) of the Aktobe region from February 2004 to August later that year.
Sagyn was appointed to the position of Akim Aktobe in October 2015. His predecessor Erkhan Umarov had decided to move to a new employment, thus leaving the mayor position empty. In Kazakhstan, akims are not elected locally, but are appointed by the regional governor of the Aktobe. The governor Berdibek Saparbayev accepted the resignation of the predecessor and, on the advice of the president, appointed Sagyn. In July 2016, he left the post of akim.
He delivered remarks on the state of the district and a plan of the future, an open forum hosted by the Akim of Alamty at the Eurasian National University. There, he laid out a vision for 2020 and laid out the future of the region, and later listening to and answering the questions regarding the needs of the people, especially the elderly.
Sagyn helped sponsor the construction of the largest ice rink in Astana in 2015.
References
Kazakhstani politicians
Living people
1972 births |
Agathymus aryxna, the Arizona giant skipper, is a butterfly in the family Hesperiidae described by Harrison Gray Dyar Jr. in 1905. Its range includes Central and North America.
The MONA or Hodges number for Agathymus aryxna is 4132.
References
Further reading
Arnett, Ross H. (2000). American Insects: A Handbook of the Insects of America North of Mexico. CRC Press.
Hodges, Ronald W., et al., eds. (1983). Check List of the Lepidoptera of America North of Mexico, xxiv + 284.
Opler, Paul A. (1999). A Field Guide to Western Butterflies. Second edition, xiv + 540.
Pelham, Jonathan P. (2008). "A catalogue of the butterflies of the United States and Canada with a complete bibliography of the descriptive and systematic literature". Journal of Research on the Lepidoptera, vol. 40, xiv + 658.
External links
Butterflies and Moths of North America
Megathyminae
Butterflies described in 1905 |
"Sweet As Sugar" is the only single released by Australian rock band Grinspoon from their compilation album Best In Show. It was released in October 2005 as a digital download by Universal Music Australia. The song polled at number 42 on Triple J's Hottest 100 for 2005.
The band's bass player, Joe Hansen describes the song as a "pretty-straight-ahead, good rockin' tune."
Reception
Australian music website, Faster Louder, described "Sweet As Sugar" as being reminiscent of Thrills, Kills & Sunday Pills with its pop/rock sound. The review goes on to state that it "isn’t a slow song and is full of that constant bass guitar strum and hammering drums that we have all come to associate with Grinspoon, and is without those screaming vocals from Phil Jamieson but still maintains a strong and steady performance." "It’s one of those infectious songs that stays in your head after you hear it where you will find yourself constantly singing the chorus."
Rob Smith of The Dwarf is more critical, stating that "Sweet As Sugar" "is not as the name suggests. It fails to stand out in the crowd of Grinspoon hits that proceed it."
Music video
The music video for "Sweet As Sugar" was directed by James Barr and produced by James Moore.
Track listing
External links
Music Video "Sweet as Sugar" - YouTube
References
2005 singles
Grinspoon songs
2005 songs
Universal Music Group singles
Songs written by Pat Davern
Songs written by Phil Jamieson |
```xml
import * as React from 'react';
import { Dropdown } from '@fluentui/react-northstar';
const inputItems = [
'Robert Tolbert',
'Wanda Howard',
'Tim Deboer',
'Amanda Brady',
'Ashley McCarthy',
'Cameron Evans',
'Carlos Slattery',
'Carole Poland',
'Robin Counts',
];
const DropdownExampleSearchMultipleFluid = () => (
<Dropdown
multiple
search
fluid
items={inputItems}
placeholder="Start typing a name"
getA11ySelectionMessage={getA11ySelectionMessage}
noResultsMessage="We couldn't find any matches."
a11ySelectedItemsMessage="Press Delete or Backspace to remove"
/>
);
const getA11ySelectionMessage = {
onAdd: item => `${item} selected. Press left or right arrow keys to navigate selected items.`,
onRemove: item => `${item} has been removed.`,
};
export default DropdownExampleSearchMultipleFluid;
``` |
"Maware Maware" (lit. "Spin, Spin", stylized as "MAWARE MAWARE" in Japan) is a song recorded by Japanese singer Misia featuring Muro and JP, credited under the pseudonym M2J, and French-Cameroonian singer Francis Jocky. The song was released through the official soundtrack of the 2010 FIFA World Cup, Listen Up! The Official 2010 FIFA World Cup Album, making Misia the first Asian artist to contribute a song for a FIFA album.
Release
The song was first released on the Listen Up! The Official 2010 FIFA World Cup Album on May 31, 2010. It was later included on Misia's tenth studio album, Soul Quest (2011). A remix by DJ Gomi was released digitally on May 25, 2011, simultaneously with the single "Kioku", on which it is included as a first pressing bonus track.
Composition
"Maware Maware" is primarily sung by Misia in English. Jocky sings the bridge in Duala, one of the various languages of Cameroon. The chorus features Misia incorporating six greetings in various languages, including English ("Hello"), Japanese ("Konnichiwa"), Swahili ("Jambo!"), Spanish ("Hola"), French ("Bonjour"), and Zulu ("Sawubona"). The music video also features this greeting motif and other greetings in Portuguese ("Boa Tarde") and Chinese ("Ni Hao") shown in 3D art.
Performances
The first performance of "Maware Maware" was held at a Sony make.believe showcase in Roppongi Hills in Tokyo on May 10, 2010. The song was later performed in another Sony showcase held in South Africa, right before the Japan vs Cameroon match on June 14, 2010. The music video premiered the following day. Misia opened every show of her Hoshizora no Live VI Encore 2010 International Year of Biodiversity concert tour with "Maware Maware". She also performed the song during her The Tour of Misia Soul Quest tour.
Chart performance
"Maware Maware" debuted at number 87 on the Billboard Japan Billboard Japan Hot 100 chart. The song peaked the following week at number 55.
Credits and personnel
Personnel
Vocals – Misia
Backing vocals – Misia, Francis Jocky, JP, Hiroto Tanigawa, Mitsuo Shindō
Songwriting – Misia, JP
Production, programming – M2J
Guitar – Francis Jocky
Strings arrangement – Gen Ittetsu
Strings – Gen Ittetsu Strings
Mixing – Masashi Hashimoto
Engineering – Ken Nishi, Noriyasu Murase, Mike Freyer
Mastering – Herb Powers Jr.
Charts
Japanese version
In 2013, Misia recorded a Japanese version of "Maware Maware" featuring Senegalese drummer Doudou N'Diaye Rose. The song was released in support of the fifth Tokyo International Conference on African Development (TICAD-V) on May 29, 2013. A portion of the proceeds from the song went towards providing mosquito nets to children for malaria prevention.
References
2013 singles
2010 songs
Misia songs
FIFA World Cup songs
Songs written by Misia |
Dulice Liecier (born 7 April 1965, Stepney, London), is a British actress. Liecier played Precious Matthews in the Children's BBC serial Grange Hill, and Ava in the 1987 James Bond film, “Living Daylights”.
Career
Liecier was one of the children who sang on Pink Floyd’s 1979 hit single "Another Brick In The Wall" when at Islington Green School. Liecier started her acting career in Grange Hill as Precious Matthews, who she played for 35 episodes over a period of four years. In 1985, she appeared in nine episodes of EastEnders as a stripper, Sheena Mennell, who appears in Walford when her cab breaks down and befriends punk Mary Smith (Linda Davidson).
She also appeared in the television series Call Me Mister as Julie Columbus in 1986. She has had roles in the films My Beautiful Laundrette (1985), Half Moon Street (1986) and Stormy Monday (1988), and in 1987 she played a CIA agent, Ava, in the James Bond film The Living Daylights.
Filmography
My Beautiful Laundrette (1985) - Girl in Disco
Half Moon Street (1986) - Jamaican Escort-girl
The Living Daylights (1987) - Ava
Stormy Monday (1988) - Carol
References
External links
Living people
English soap opera actresses
1965 births
Actors from Stepney
Actresses from London |
"Can U Dig It?" is a single by British band Pop Will Eat Itself, released in 1989 from the band's second album This Is the Day...This Is the Hour...This Is This! and it peaked at #38 in the UK Charts.
The lyrics include a litany of references to movies, comics, music, and television. The sample in which a male voice is heard yelling "Can you dig it?" several times and the female voice at the beginning of the track saying "Let's get down to it, boppers..." were taken from the cult classic 1979 U.S. action film The Warriors.
Music video
An accompanying music video was made for the single. It features Clint Mansell and Graham Crabb singing the song against various changing backgrounds (many of which reference the song lyrics) while in other parts the rest of the band members perform the song with stacks of TVs behind them.
Track listing
All songs written by Pop Will Eat Itself
12"
7"
CD
Charts
Personnel
Clint Mansell - Vocals
Graham Crabb - Vocals
Adam Mole - Guitar
Richard March - Guitar
"The Buzzard" - Wild Guitar
References
External links
(official PopWillEatItselfVEVO channel)
1989 singles
List songs
1989 songs
RCA Records singles
Pop Will Eat Itself songs
Songs written by Clint Mansell
Song recordings produced by Flood (producer) |
9–10th & Locust station is an underground rapid transit station on the PATCO Speedline, operated by the Delaware River Port Authority. It is located in the Washington Square West neighborhood of Center City Philadelphia, under Locust Street between 9th and 10th Streets.
This station is one of PATCO stations that does not have 24-hour service; the station is closed daily between 12:15 am and 4:15 am.
Notable places nearby
The station is within walking distance of the following notable places:
Jefferson Hospital for Neuroscience
Thomas Jefferson University Hospital
Pennsylvania Hospital
Walnut Street Theatre
Wills Eye Hospital
References
External links
9th-10th & Locust (PATCO)
PATCO Speedline stations in Philadelphia
Railway stations in Philadelphia
Railway stations in the United States opened in 1953
Railway stations located underground in Pennsylvania |
This was the first edition of the tournament.
Holger Rune won the title after defeating Nino Serdarušić 6–4, 6–2 in the final.
Seeds
Draw
Finals
Top half
Bottom half
References
External links
Main draw
Qualifying draw
Internazionali di Tennis Città di Verona - 1 |
```java
package com.example.filters;
import android.support.v7.widget.RecyclerView;
import android.util.Log;
import android.view.LayoutInflater;
import android.view.View;
import android.view.ViewGroup;
import android.widget.ImageView;
import com.nineoldandroids.view.ViewHelper;
import java.util.List;
/**
* @author Varun on 01/07/15.
*/
public class ThumbnailsAdapter extends RecyclerView.Adapter<RecyclerView.ViewHolder> {
private static final String TAG = "THUMBNAILS_ADAPTER";
private static int lastPosition = -1;
private ThumbnailCallback thumbnailCallback;
private List<ThumbnailItem> dataSet;
public ThumbnailsAdapter(List<ThumbnailItem> dataSet, ThumbnailCallback thumbnailCallback) {
Log.v(TAG, "Thumbnails Adapter has " + dataSet.size() + " items");
this.dataSet = dataSet;
this.thumbnailCallback = thumbnailCallback;
}
@Override
public RecyclerView.ViewHolder onCreateViewHolder(ViewGroup viewGroup, int i) {
Log.v(TAG, "On Create View Holder Called");
View itemView = LayoutInflater.
from(viewGroup.getContext()).
inflate(R.layout.list_thumbnail_item, viewGroup, false);
return new ThumbnailsViewHolder(itemView);
}
@Override
public void onBindViewHolder(RecyclerView.ViewHolder holder, final int i) {
final ThumbnailItem thumbnailItem = dataSet.get(i);
Log.v(TAG, "On Bind View Called");
ThumbnailsViewHolder thumbnailsViewHolder = (ThumbnailsViewHolder) holder;
thumbnailsViewHolder.thumbnail.setImageBitmap(thumbnailItem.image);
thumbnailsViewHolder.thumbnail.setScaleType(ImageView.ScaleType.FIT_START);
setAnimation(thumbnailsViewHolder.thumbnail, i);
thumbnailsViewHolder.thumbnail.setOnClickListener(new View.OnClickListener() {
@Override
public void onClick(View v) {
if (lastPosition != i) {
thumbnailCallback.onThumbnailClick(thumbnailItem.filter);
lastPosition = i;
}
}
});
}
private void setAnimation(View viewToAnimate, int position) {
{
ViewHelper.setAlpha(viewToAnimate, .0f);
com.nineoldandroids.view.ViewPropertyAnimator.animate(viewToAnimate).alpha(1).setDuration(250).start();
lastPosition = position;
}
}
@Override
public int getItemCount() {
return dataSet.size();
}
public static class ThumbnailsViewHolder extends RecyclerView.ViewHolder {
public ImageView thumbnail;
public ThumbnailsViewHolder(View v) {
super(v);
this.thumbnail = (ImageView) v.findViewById(R.id.thumbnail);
}
}
}
``` |
```c++
///////////////////////////////////////////////////////////////////////////////
/// \file expr.hpp
/// Contains definition of expr\<\> class template.
//
// LICENSE_1_0.txt or copy at path_to_url
template<typename Tag, typename Arg0>
struct expr<Tag, term<Arg0>, 0>
{
typedef Tag proto_tag;
static const long proto_arity_c = 0;
typedef mpl::long_<0 > proto_arity;
typedef expr proto_base_expr;
typedef term<Arg0> proto_args;
typedef basic_expr<Tag, proto_args, 0 > proto_grammar;
typedef default_domain proto_domain;
typedef default_generator proto_generator;
typedef proto::tag::proto_expr<Tag, proto_domain> fusion_tag;
typedef expr proto_derived_expr;
typedef void proto_is_expr_;
typedef Arg0 proto_child0; proto_child0 child0;
typedef void proto_child1; typedef void proto_child2; typedef void proto_child3; typedef void proto_child4; typedef void proto_child5; typedef void proto_child6; typedef void proto_child7; typedef void proto_child8; typedef void proto_child9;
BOOST_FORCEINLINE
expr const &proto_base() const
{
return *this;
}
BOOST_FORCEINLINE
expr &proto_base()
{
return *this;
}
template<typename A0>
BOOST_FORCEINLINE
static expr const make(A0 &a0)
{
return detail::make_terminal(a0, static_cast<expr *>(0), static_cast<proto_args *>(0));
}
template<typename A0>
BOOST_FORCEINLINE
static expr const make(A0 const &a0)
{
return detail::make_terminal(a0, static_cast<expr *>(0), static_cast<proto_args *>(0));
}
typedef detail::not_a_valid_type address_of_hack_type_;
BOOST_FORCEINLINE
proto::expr<
proto::tag::assign
, list2<expr &, expr const &>
, 2
> const
operator =(expr const &a)
{
proto::expr<
proto::tag::assign
, list2<expr &, expr const &>
, 2
> that = {*this, a};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> const
operator =(A &a) const
{
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> const
operator =(A const &a) const
{
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::assign
, list2<expr &, typename result_of::as_child<A>::type>
, 2
> const
operator =(A &a)
{
proto::expr<
proto::tag::assign
, list2<expr &, typename result_of::as_child<A>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::assign
, list2<expr &, typename result_of::as_child<A const>::type>
, 2
> const
operator =(A const &a)
{
proto::expr<
proto::tag::assign
, list2<expr &, typename result_of::as_child<A const>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> const
operator [](A &a) const
{
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> const
operator [](A const &a) const
{
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::subscript
, list2<expr &, typename result_of::as_child<A>::type>
, 2
> const
operator [](A &a)
{
proto::expr<
proto::tag::subscript
, list2<expr &, typename result_of::as_child<A>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::subscript
, list2<expr &, typename result_of::as_child<A const>::type>
, 2
> const
operator [](A const &a)
{
proto::expr<
proto::tag::subscript
, list2<expr &, typename result_of::as_child<A const>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename Sig>
struct result
{
typedef typename result_of::funop<Sig, expr, default_domain>::type const type;
};
BOOST_FORCEINLINE
proto::expr<proto::tag::function, list1<expr const &>, 1> const
operator ()() const
{
proto::expr<proto::tag::function, list1<expr const &>, 1> that = {*this};
return that;
}
BOOST_FORCEINLINE
proto::expr<proto::tag::function, list1<expr &>, 1> const
operator ()()
{
proto::expr<proto::tag::function, list1<expr &>, 1> that = {*this};
return that;
}
template<typename A0>
BOOST_FORCEINLINE
typename result_of::funop1<
expr const
, default_domain , const A0
>::type const
operator ()(A0 const &a0) const
{
return result_of::funop1<
expr const
, default_domain , const A0
>::call(*this , a0);
}
template<typename A0>
BOOST_FORCEINLINE
typename result_of::funop1<
expr
, default_domain , const A0
>::type const
operator ()(A0 const &a0)
{
return result_of::funop1<
expr
, default_domain , const A0
>::call(*this , a0);
}
template<typename A0 , typename A1>
BOOST_FORCEINLINE
typename result_of::funop2<
expr const
, default_domain , const A0 , const A1
>::type const
operator ()(A0 const &a0 , A1 const &a1) const
{
return result_of::funop2<
expr const
, default_domain , const A0 , const A1
>::call(*this , a0 , a1);
}
template<typename A0 , typename A1>
BOOST_FORCEINLINE
typename result_of::funop2<
expr
, default_domain , const A0 , const A1
>::type const
operator ()(A0 const &a0 , A1 const &a1)
{
return result_of::funop2<
expr
, default_domain , const A0 , const A1
>::call(*this , a0 , a1);
}
template<typename A0 , typename A1 , typename A2>
BOOST_FORCEINLINE
typename result_of::funop3<
expr const
, default_domain , const A0 , const A1 , const A2
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2) const
{
return result_of::funop3<
expr const
, default_domain , const A0 , const A1 , const A2
>::call(*this , a0 , a1 , a2);
}
template<typename A0 , typename A1 , typename A2>
BOOST_FORCEINLINE
typename result_of::funop3<
expr
, default_domain , const A0 , const A1 , const A2
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2)
{
return result_of::funop3<
expr
, default_domain , const A0 , const A1 , const A2
>::call(*this , a0 , a1 , a2);
}
template<typename A0 , typename A1 , typename A2 , typename A3>
BOOST_FORCEINLINE
typename result_of::funop4<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3) const
{
return result_of::funop4<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3
>::call(*this , a0 , a1 , a2 , a3);
}
template<typename A0 , typename A1 , typename A2 , typename A3>
BOOST_FORCEINLINE
typename result_of::funop4<
expr
, default_domain , const A0 , const A1 , const A2 , const A3
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3)
{
return result_of::funop4<
expr
, default_domain , const A0 , const A1 , const A2 , const A3
>::call(*this , a0 , a1 , a2 , a3);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4>
BOOST_FORCEINLINE
typename result_of::funop5<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4) const
{
return result_of::funop5<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4
>::call(*this , a0 , a1 , a2 , a3 , a4);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4>
BOOST_FORCEINLINE
typename result_of::funop5<
expr
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4)
{
return result_of::funop5<
expr
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4
>::call(*this , a0 , a1 , a2 , a3 , a4);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5>
BOOST_FORCEINLINE
typename result_of::funop6<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5) const
{
return result_of::funop6<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5>
BOOST_FORCEINLINE
typename result_of::funop6<
expr
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5)
{
return result_of::funop6<
expr
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6>
BOOST_FORCEINLINE
typename result_of::funop7<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6) const
{
return result_of::funop7<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5 , a6);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6>
BOOST_FORCEINLINE
typename result_of::funop7<
expr
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6)
{
return result_of::funop7<
expr
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5 , a6);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6 , typename A7>
BOOST_FORCEINLINE
typename result_of::funop8<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6 , A7 const &a7) const
{
return result_of::funop8<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5 , a6 , a7);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6 , typename A7>
BOOST_FORCEINLINE
typename result_of::funop8<
expr
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6 , A7 const &a7)
{
return result_of::funop8<
expr
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5 , a6 , a7);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6 , typename A7 , typename A8>
BOOST_FORCEINLINE
typename result_of::funop9<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7 , const A8
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6 , A7 const &a7 , A8 const &a8) const
{
return result_of::funop9<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7 , const A8
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5 , a6 , a7 , a8);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6 , typename A7 , typename A8>
BOOST_FORCEINLINE
typename result_of::funop9<
expr
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7 , const A8
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6 , A7 const &a7 , A8 const &a8)
{
return result_of::funop9<
expr
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7 , const A8
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5 , a6 , a7 , a8);
}
};
template<typename Tag , typename Arg0>
struct expr<Tag, list1<Arg0>, 1 >
{
typedef Tag proto_tag;
static const long proto_arity_c = 1;
typedef mpl::long_<1 > proto_arity;
typedef expr proto_base_expr;
typedef list1<Arg0> proto_args;
typedef basic_expr<Tag, proto_args, 1 > proto_grammar;
typedef default_domain proto_domain;
typedef default_generator proto_generator;
typedef proto::tag::proto_expr<Tag, proto_domain> fusion_tag;
typedef expr proto_derived_expr;
typedef void proto_is_expr_;
typedef Arg0 proto_child0; proto_child0 child0;
typedef void proto_child1; typedef void proto_child2; typedef void proto_child3; typedef void proto_child4; typedef void proto_child5; typedef void proto_child6; typedef void proto_child7; typedef void proto_child8; typedef void proto_child9;
BOOST_FORCEINLINE
expr const &proto_base() const
{
return *this;
}
BOOST_FORCEINLINE
expr &proto_base()
{
return *this;
}
template<typename A0>
BOOST_FORCEINLINE
static expr const make(A0 const &a0)
{
expr that = {a0};
return that;
}
typedef typename detail::address_of_hack<Tag, proto_child0>::type address_of_hack_type_;
BOOST_FORCEINLINE
operator address_of_hack_type_() const
{
return boost::addressof(this->child0);
}
BOOST_FORCEINLINE
proto::expr<
proto::tag::assign
, list2<expr &, expr const &>
, 2
> const
operator =(expr const &a)
{
proto::expr<
proto::tag::assign
, list2<expr &, expr const &>
, 2
> that = {*this, a};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> const
operator =(A &a) const
{
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> const
operator =(A const &a) const
{
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> const
operator [](A &a) const
{
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> const
operator [](A const &a) const
{
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename Sig>
struct result
{
typedef typename result_of::funop<Sig, expr, default_domain>::type const type;
};
BOOST_FORCEINLINE
proto::expr<proto::tag::function, list1<expr const &>, 1> const
operator ()() const
{
proto::expr<proto::tag::function, list1<expr const &>, 1> that = {*this};
return that;
}
template<typename A0>
BOOST_FORCEINLINE
typename result_of::funop1<
expr const
, default_domain , const A0
>::type const
operator ()(A0 const &a0) const
{
return result_of::funop1<
expr const
, default_domain , const A0
>::call(*this , a0);
}
template<typename A0 , typename A1>
BOOST_FORCEINLINE
typename result_of::funop2<
expr const
, default_domain , const A0 , const A1
>::type const
operator ()(A0 const &a0 , A1 const &a1) const
{
return result_of::funop2<
expr const
, default_domain , const A0 , const A1
>::call(*this , a0 , a1);
}
template<typename A0 , typename A1 , typename A2>
BOOST_FORCEINLINE
typename result_of::funop3<
expr const
, default_domain , const A0 , const A1 , const A2
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2) const
{
return result_of::funop3<
expr const
, default_domain , const A0 , const A1 , const A2
>::call(*this , a0 , a1 , a2);
}
template<typename A0 , typename A1 , typename A2 , typename A3>
BOOST_FORCEINLINE
typename result_of::funop4<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3) const
{
return result_of::funop4<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3
>::call(*this , a0 , a1 , a2 , a3);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4>
BOOST_FORCEINLINE
typename result_of::funop5<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4) const
{
return result_of::funop5<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4
>::call(*this , a0 , a1 , a2 , a3 , a4);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5>
BOOST_FORCEINLINE
typename result_of::funop6<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5) const
{
return result_of::funop6<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6>
BOOST_FORCEINLINE
typename result_of::funop7<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6) const
{
return result_of::funop7<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5 , a6);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6 , typename A7>
BOOST_FORCEINLINE
typename result_of::funop8<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6 , A7 const &a7) const
{
return result_of::funop8<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5 , a6 , a7);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6 , typename A7 , typename A8>
BOOST_FORCEINLINE
typename result_of::funop9<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7 , const A8
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6 , A7 const &a7 , A8 const &a8) const
{
return result_of::funop9<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7 , const A8
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5 , a6 , a7 , a8);
}
};
template<typename Tag , typename Arg0 , typename Arg1>
struct expr<Tag, list2<Arg0 , Arg1>, 2 >
{
typedef Tag proto_tag;
static const long proto_arity_c = 2;
typedef mpl::long_<2 > proto_arity;
typedef expr proto_base_expr;
typedef list2<Arg0 , Arg1> proto_args;
typedef basic_expr<Tag, proto_args, 2 > proto_grammar;
typedef default_domain proto_domain;
typedef default_generator proto_generator;
typedef proto::tag::proto_expr<Tag, proto_domain> fusion_tag;
typedef expr proto_derived_expr;
typedef void proto_is_expr_;
typedef Arg0 proto_child0; proto_child0 child0; typedef Arg1 proto_child1; proto_child1 child1;
typedef void proto_child2; typedef void proto_child3; typedef void proto_child4; typedef void proto_child5; typedef void proto_child6; typedef void proto_child7; typedef void proto_child8; typedef void proto_child9;
BOOST_FORCEINLINE
expr const &proto_base() const
{
return *this;
}
BOOST_FORCEINLINE
expr &proto_base()
{
return *this;
}
template<typename A0 , typename A1>
BOOST_FORCEINLINE
static expr const make(A0 const &a0 , A1 const &a1)
{
expr that = {a0 , a1};
return that;
}
typedef detail::not_a_valid_type address_of_hack_type_;
BOOST_FORCEINLINE
proto::expr<
proto::tag::assign
, list2<expr &, expr const &>
, 2
> const
operator =(expr const &a)
{
proto::expr<
proto::tag::assign
, list2<expr &, expr const &>
, 2
> that = {*this, a};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> const
operator =(A &a) const
{
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> const
operator =(A const &a) const
{
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> const
operator [](A &a) const
{
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> const
operator [](A const &a) const
{
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename Sig>
struct result
{
typedef typename result_of::funop<Sig, expr, default_domain>::type const type;
};
BOOST_FORCEINLINE
proto::expr<proto::tag::function, list1<expr const &>, 1> const
operator ()() const
{
proto::expr<proto::tag::function, list1<expr const &>, 1> that = {*this};
return that;
}
template<typename A0>
BOOST_FORCEINLINE
typename result_of::funop1<
expr const
, default_domain , const A0
>::type const
operator ()(A0 const &a0) const
{
return result_of::funop1<
expr const
, default_domain , const A0
>::call(*this , a0);
}
template<typename A0 , typename A1>
BOOST_FORCEINLINE
typename result_of::funop2<
expr const
, default_domain , const A0 , const A1
>::type const
operator ()(A0 const &a0 , A1 const &a1) const
{
return result_of::funop2<
expr const
, default_domain , const A0 , const A1
>::call(*this , a0 , a1);
}
template<typename A0 , typename A1 , typename A2>
BOOST_FORCEINLINE
typename result_of::funop3<
expr const
, default_domain , const A0 , const A1 , const A2
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2) const
{
return result_of::funop3<
expr const
, default_domain , const A0 , const A1 , const A2
>::call(*this , a0 , a1 , a2);
}
template<typename A0 , typename A1 , typename A2 , typename A3>
BOOST_FORCEINLINE
typename result_of::funop4<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3) const
{
return result_of::funop4<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3
>::call(*this , a0 , a1 , a2 , a3);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4>
BOOST_FORCEINLINE
typename result_of::funop5<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4) const
{
return result_of::funop5<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4
>::call(*this , a0 , a1 , a2 , a3 , a4);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5>
BOOST_FORCEINLINE
typename result_of::funop6<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5) const
{
return result_of::funop6<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6>
BOOST_FORCEINLINE
typename result_of::funop7<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6) const
{
return result_of::funop7<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5 , a6);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6 , typename A7>
BOOST_FORCEINLINE
typename result_of::funop8<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6 , A7 const &a7) const
{
return result_of::funop8<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5 , a6 , a7);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6 , typename A7 , typename A8>
BOOST_FORCEINLINE
typename result_of::funop9<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7 , const A8
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6 , A7 const &a7 , A8 const &a8) const
{
return result_of::funop9<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7 , const A8
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5 , a6 , a7 , a8);
}
};
template<typename Tag , typename Arg0 , typename Arg1 , typename Arg2>
struct expr<Tag, list3<Arg0 , Arg1 , Arg2>, 3 >
{
typedef Tag proto_tag;
static const long proto_arity_c = 3;
typedef mpl::long_<3 > proto_arity;
typedef expr proto_base_expr;
typedef list3<Arg0 , Arg1 , Arg2> proto_args;
typedef basic_expr<Tag, proto_args, 3 > proto_grammar;
typedef default_domain proto_domain;
typedef default_generator proto_generator;
typedef proto::tag::proto_expr<Tag, proto_domain> fusion_tag;
typedef expr proto_derived_expr;
typedef void proto_is_expr_;
typedef Arg0 proto_child0; proto_child0 child0; typedef Arg1 proto_child1; proto_child1 child1; typedef Arg2 proto_child2; proto_child2 child2;
typedef void proto_child3; typedef void proto_child4; typedef void proto_child5; typedef void proto_child6; typedef void proto_child7; typedef void proto_child8; typedef void proto_child9;
BOOST_FORCEINLINE
expr const &proto_base() const
{
return *this;
}
BOOST_FORCEINLINE
expr &proto_base()
{
return *this;
}
template<typename A0 , typename A1 , typename A2>
BOOST_FORCEINLINE
static expr const make(A0 const &a0 , A1 const &a1 , A2 const &a2)
{
expr that = {a0 , a1 , a2};
return that;
}
typedef detail::not_a_valid_type address_of_hack_type_;
BOOST_FORCEINLINE
proto::expr<
proto::tag::assign
, list2<expr &, expr const &>
, 2
> const
operator =(expr const &a)
{
proto::expr<
proto::tag::assign
, list2<expr &, expr const &>
, 2
> that = {*this, a};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> const
operator =(A &a) const
{
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> const
operator =(A const &a) const
{
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> const
operator [](A &a) const
{
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> const
operator [](A const &a) const
{
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename Sig>
struct result
{
typedef typename result_of::funop<Sig, expr, default_domain>::type const type;
};
BOOST_FORCEINLINE
proto::expr<proto::tag::function, list1<expr const &>, 1> const
operator ()() const
{
proto::expr<proto::tag::function, list1<expr const &>, 1> that = {*this};
return that;
}
template<typename A0>
BOOST_FORCEINLINE
typename result_of::funop1<
expr const
, default_domain , const A0
>::type const
operator ()(A0 const &a0) const
{
return result_of::funop1<
expr const
, default_domain , const A0
>::call(*this , a0);
}
template<typename A0 , typename A1>
BOOST_FORCEINLINE
typename result_of::funop2<
expr const
, default_domain , const A0 , const A1
>::type const
operator ()(A0 const &a0 , A1 const &a1) const
{
return result_of::funop2<
expr const
, default_domain , const A0 , const A1
>::call(*this , a0 , a1);
}
template<typename A0 , typename A1 , typename A2>
BOOST_FORCEINLINE
typename result_of::funop3<
expr const
, default_domain , const A0 , const A1 , const A2
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2) const
{
return result_of::funop3<
expr const
, default_domain , const A0 , const A1 , const A2
>::call(*this , a0 , a1 , a2);
}
template<typename A0 , typename A1 , typename A2 , typename A3>
BOOST_FORCEINLINE
typename result_of::funop4<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3) const
{
return result_of::funop4<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3
>::call(*this , a0 , a1 , a2 , a3);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4>
BOOST_FORCEINLINE
typename result_of::funop5<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4) const
{
return result_of::funop5<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4
>::call(*this , a0 , a1 , a2 , a3 , a4);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5>
BOOST_FORCEINLINE
typename result_of::funop6<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5) const
{
return result_of::funop6<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6>
BOOST_FORCEINLINE
typename result_of::funop7<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6) const
{
return result_of::funop7<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5 , a6);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6 , typename A7>
BOOST_FORCEINLINE
typename result_of::funop8<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6 , A7 const &a7) const
{
return result_of::funop8<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5 , a6 , a7);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6 , typename A7 , typename A8>
BOOST_FORCEINLINE
typename result_of::funop9<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7 , const A8
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6 , A7 const &a7 , A8 const &a8) const
{
return result_of::funop9<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7 , const A8
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5 , a6 , a7 , a8);
}
};
template<typename Tag , typename Arg0 , typename Arg1 , typename Arg2 , typename Arg3>
struct expr<Tag, list4<Arg0 , Arg1 , Arg2 , Arg3>, 4 >
{
typedef Tag proto_tag;
static const long proto_arity_c = 4;
typedef mpl::long_<4 > proto_arity;
typedef expr proto_base_expr;
typedef list4<Arg0 , Arg1 , Arg2 , Arg3> proto_args;
typedef basic_expr<Tag, proto_args, 4 > proto_grammar;
typedef default_domain proto_domain;
typedef default_generator proto_generator;
typedef proto::tag::proto_expr<Tag, proto_domain> fusion_tag;
typedef expr proto_derived_expr;
typedef void proto_is_expr_;
typedef Arg0 proto_child0; proto_child0 child0; typedef Arg1 proto_child1; proto_child1 child1; typedef Arg2 proto_child2; proto_child2 child2; typedef Arg3 proto_child3; proto_child3 child3;
typedef void proto_child4; typedef void proto_child5; typedef void proto_child6; typedef void proto_child7; typedef void proto_child8; typedef void proto_child9;
BOOST_FORCEINLINE
expr const &proto_base() const
{
return *this;
}
BOOST_FORCEINLINE
expr &proto_base()
{
return *this;
}
template<typename A0 , typename A1 , typename A2 , typename A3>
BOOST_FORCEINLINE
static expr const make(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3)
{
expr that = {a0 , a1 , a2 , a3};
return that;
}
typedef detail::not_a_valid_type address_of_hack_type_;
BOOST_FORCEINLINE
proto::expr<
proto::tag::assign
, list2<expr &, expr const &>
, 2
> const
operator =(expr const &a)
{
proto::expr<
proto::tag::assign
, list2<expr &, expr const &>
, 2
> that = {*this, a};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> const
operator =(A &a) const
{
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> const
operator =(A const &a) const
{
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> const
operator [](A &a) const
{
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> const
operator [](A const &a) const
{
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename Sig>
struct result
{
typedef typename result_of::funop<Sig, expr, default_domain>::type const type;
};
BOOST_FORCEINLINE
proto::expr<proto::tag::function, list1<expr const &>, 1> const
operator ()() const
{
proto::expr<proto::tag::function, list1<expr const &>, 1> that = {*this};
return that;
}
template<typename A0>
BOOST_FORCEINLINE
typename result_of::funop1<
expr const
, default_domain , const A0
>::type const
operator ()(A0 const &a0) const
{
return result_of::funop1<
expr const
, default_domain , const A0
>::call(*this , a0);
}
template<typename A0 , typename A1>
BOOST_FORCEINLINE
typename result_of::funop2<
expr const
, default_domain , const A0 , const A1
>::type const
operator ()(A0 const &a0 , A1 const &a1) const
{
return result_of::funop2<
expr const
, default_domain , const A0 , const A1
>::call(*this , a0 , a1);
}
template<typename A0 , typename A1 , typename A2>
BOOST_FORCEINLINE
typename result_of::funop3<
expr const
, default_domain , const A0 , const A1 , const A2
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2) const
{
return result_of::funop3<
expr const
, default_domain , const A0 , const A1 , const A2
>::call(*this , a0 , a1 , a2);
}
template<typename A0 , typename A1 , typename A2 , typename A3>
BOOST_FORCEINLINE
typename result_of::funop4<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3) const
{
return result_of::funop4<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3
>::call(*this , a0 , a1 , a2 , a3);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4>
BOOST_FORCEINLINE
typename result_of::funop5<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4) const
{
return result_of::funop5<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4
>::call(*this , a0 , a1 , a2 , a3 , a4);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5>
BOOST_FORCEINLINE
typename result_of::funop6<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5) const
{
return result_of::funop6<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6>
BOOST_FORCEINLINE
typename result_of::funop7<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6) const
{
return result_of::funop7<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5 , a6);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6 , typename A7>
BOOST_FORCEINLINE
typename result_of::funop8<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6 , A7 const &a7) const
{
return result_of::funop8<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5 , a6 , a7);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6 , typename A7 , typename A8>
BOOST_FORCEINLINE
typename result_of::funop9<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7 , const A8
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6 , A7 const &a7 , A8 const &a8) const
{
return result_of::funop9<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7 , const A8
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5 , a6 , a7 , a8);
}
};
template<typename Tag , typename Arg0 , typename Arg1 , typename Arg2 , typename Arg3 , typename Arg4>
struct expr<Tag, list5<Arg0 , Arg1 , Arg2 , Arg3 , Arg4>, 5 >
{
typedef Tag proto_tag;
static const long proto_arity_c = 5;
typedef mpl::long_<5 > proto_arity;
typedef expr proto_base_expr;
typedef list5<Arg0 , Arg1 , Arg2 , Arg3 , Arg4> proto_args;
typedef basic_expr<Tag, proto_args, 5 > proto_grammar;
typedef default_domain proto_domain;
typedef default_generator proto_generator;
typedef proto::tag::proto_expr<Tag, proto_domain> fusion_tag;
typedef expr proto_derived_expr;
typedef void proto_is_expr_;
typedef Arg0 proto_child0; proto_child0 child0; typedef Arg1 proto_child1; proto_child1 child1; typedef Arg2 proto_child2; proto_child2 child2; typedef Arg3 proto_child3; proto_child3 child3; typedef Arg4 proto_child4; proto_child4 child4;
typedef void proto_child5; typedef void proto_child6; typedef void proto_child7; typedef void proto_child8; typedef void proto_child9;
BOOST_FORCEINLINE
expr const &proto_base() const
{
return *this;
}
BOOST_FORCEINLINE
expr &proto_base()
{
return *this;
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4>
BOOST_FORCEINLINE
static expr const make(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4)
{
expr that = {a0 , a1 , a2 , a3 , a4};
return that;
}
typedef detail::not_a_valid_type address_of_hack_type_;
BOOST_FORCEINLINE
proto::expr<
proto::tag::assign
, list2<expr &, expr const &>
, 2
> const
operator =(expr const &a)
{
proto::expr<
proto::tag::assign
, list2<expr &, expr const &>
, 2
> that = {*this, a};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> const
operator =(A &a) const
{
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> const
operator =(A const &a) const
{
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> const
operator [](A &a) const
{
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> const
operator [](A const &a) const
{
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename Sig>
struct result
{
typedef typename result_of::funop<Sig, expr, default_domain>::type const type;
};
BOOST_FORCEINLINE
proto::expr<proto::tag::function, list1<expr const &>, 1> const
operator ()() const
{
proto::expr<proto::tag::function, list1<expr const &>, 1> that = {*this};
return that;
}
template<typename A0>
BOOST_FORCEINLINE
typename result_of::funop1<
expr const
, default_domain , const A0
>::type const
operator ()(A0 const &a0) const
{
return result_of::funop1<
expr const
, default_domain , const A0
>::call(*this , a0);
}
template<typename A0 , typename A1>
BOOST_FORCEINLINE
typename result_of::funop2<
expr const
, default_domain , const A0 , const A1
>::type const
operator ()(A0 const &a0 , A1 const &a1) const
{
return result_of::funop2<
expr const
, default_domain , const A0 , const A1
>::call(*this , a0 , a1);
}
template<typename A0 , typename A1 , typename A2>
BOOST_FORCEINLINE
typename result_of::funop3<
expr const
, default_domain , const A0 , const A1 , const A2
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2) const
{
return result_of::funop3<
expr const
, default_domain , const A0 , const A1 , const A2
>::call(*this , a0 , a1 , a2);
}
template<typename A0 , typename A1 , typename A2 , typename A3>
BOOST_FORCEINLINE
typename result_of::funop4<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3) const
{
return result_of::funop4<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3
>::call(*this , a0 , a1 , a2 , a3);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4>
BOOST_FORCEINLINE
typename result_of::funop5<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4) const
{
return result_of::funop5<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4
>::call(*this , a0 , a1 , a2 , a3 , a4);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5>
BOOST_FORCEINLINE
typename result_of::funop6<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5) const
{
return result_of::funop6<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6>
BOOST_FORCEINLINE
typename result_of::funop7<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6) const
{
return result_of::funop7<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5 , a6);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6 , typename A7>
BOOST_FORCEINLINE
typename result_of::funop8<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6 , A7 const &a7) const
{
return result_of::funop8<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5 , a6 , a7);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6 , typename A7 , typename A8>
BOOST_FORCEINLINE
typename result_of::funop9<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7 , const A8
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6 , A7 const &a7 , A8 const &a8) const
{
return result_of::funop9<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7 , const A8
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5 , a6 , a7 , a8);
}
};
template<typename Tag , typename Arg0 , typename Arg1 , typename Arg2 , typename Arg3 , typename Arg4 , typename Arg5>
struct expr<Tag, list6<Arg0 , Arg1 , Arg2 , Arg3 , Arg4 , Arg5>, 6 >
{
typedef Tag proto_tag;
static const long proto_arity_c = 6;
typedef mpl::long_<6 > proto_arity;
typedef expr proto_base_expr;
typedef list6<Arg0 , Arg1 , Arg2 , Arg3 , Arg4 , Arg5> proto_args;
typedef basic_expr<Tag, proto_args, 6 > proto_grammar;
typedef default_domain proto_domain;
typedef default_generator proto_generator;
typedef proto::tag::proto_expr<Tag, proto_domain> fusion_tag;
typedef expr proto_derived_expr;
typedef void proto_is_expr_;
typedef Arg0 proto_child0; proto_child0 child0; typedef Arg1 proto_child1; proto_child1 child1; typedef Arg2 proto_child2; proto_child2 child2; typedef Arg3 proto_child3; proto_child3 child3; typedef Arg4 proto_child4; proto_child4 child4; typedef Arg5 proto_child5; proto_child5 child5;
typedef void proto_child6; typedef void proto_child7; typedef void proto_child8; typedef void proto_child9;
BOOST_FORCEINLINE
expr const &proto_base() const
{
return *this;
}
BOOST_FORCEINLINE
expr &proto_base()
{
return *this;
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5>
BOOST_FORCEINLINE
static expr const make(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5)
{
expr that = {a0 , a1 , a2 , a3 , a4 , a5};
return that;
}
typedef detail::not_a_valid_type address_of_hack_type_;
BOOST_FORCEINLINE
proto::expr<
proto::tag::assign
, list2<expr &, expr const &>
, 2
> const
operator =(expr const &a)
{
proto::expr<
proto::tag::assign
, list2<expr &, expr const &>
, 2
> that = {*this, a};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> const
operator =(A &a) const
{
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> const
operator =(A const &a) const
{
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> const
operator [](A &a) const
{
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> const
operator [](A const &a) const
{
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename Sig>
struct result
{
typedef typename result_of::funop<Sig, expr, default_domain>::type const type;
};
BOOST_FORCEINLINE
proto::expr<proto::tag::function, list1<expr const &>, 1> const
operator ()() const
{
proto::expr<proto::tag::function, list1<expr const &>, 1> that = {*this};
return that;
}
template<typename A0>
BOOST_FORCEINLINE
typename result_of::funop1<
expr const
, default_domain , const A0
>::type const
operator ()(A0 const &a0) const
{
return result_of::funop1<
expr const
, default_domain , const A0
>::call(*this , a0);
}
template<typename A0 , typename A1>
BOOST_FORCEINLINE
typename result_of::funop2<
expr const
, default_domain , const A0 , const A1
>::type const
operator ()(A0 const &a0 , A1 const &a1) const
{
return result_of::funop2<
expr const
, default_domain , const A0 , const A1
>::call(*this , a0 , a1);
}
template<typename A0 , typename A1 , typename A2>
BOOST_FORCEINLINE
typename result_of::funop3<
expr const
, default_domain , const A0 , const A1 , const A2
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2) const
{
return result_of::funop3<
expr const
, default_domain , const A0 , const A1 , const A2
>::call(*this , a0 , a1 , a2);
}
template<typename A0 , typename A1 , typename A2 , typename A3>
BOOST_FORCEINLINE
typename result_of::funop4<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3) const
{
return result_of::funop4<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3
>::call(*this , a0 , a1 , a2 , a3);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4>
BOOST_FORCEINLINE
typename result_of::funop5<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4) const
{
return result_of::funop5<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4
>::call(*this , a0 , a1 , a2 , a3 , a4);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5>
BOOST_FORCEINLINE
typename result_of::funop6<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5) const
{
return result_of::funop6<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6>
BOOST_FORCEINLINE
typename result_of::funop7<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6) const
{
return result_of::funop7<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5 , a6);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6 , typename A7>
BOOST_FORCEINLINE
typename result_of::funop8<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6 , A7 const &a7) const
{
return result_of::funop8<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5 , a6 , a7);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6 , typename A7 , typename A8>
BOOST_FORCEINLINE
typename result_of::funop9<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7 , const A8
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6 , A7 const &a7 , A8 const &a8) const
{
return result_of::funop9<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7 , const A8
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5 , a6 , a7 , a8);
}
};
template<typename Tag , typename Arg0 , typename Arg1 , typename Arg2 , typename Arg3 , typename Arg4 , typename Arg5 , typename Arg6>
struct expr<Tag, list7<Arg0 , Arg1 , Arg2 , Arg3 , Arg4 , Arg5 , Arg6>, 7 >
{
typedef Tag proto_tag;
static const long proto_arity_c = 7;
typedef mpl::long_<7 > proto_arity;
typedef expr proto_base_expr;
typedef list7<Arg0 , Arg1 , Arg2 , Arg3 , Arg4 , Arg5 , Arg6> proto_args;
typedef basic_expr<Tag, proto_args, 7 > proto_grammar;
typedef default_domain proto_domain;
typedef default_generator proto_generator;
typedef proto::tag::proto_expr<Tag, proto_domain> fusion_tag;
typedef expr proto_derived_expr;
typedef void proto_is_expr_;
typedef Arg0 proto_child0; proto_child0 child0; typedef Arg1 proto_child1; proto_child1 child1; typedef Arg2 proto_child2; proto_child2 child2; typedef Arg3 proto_child3; proto_child3 child3; typedef Arg4 proto_child4; proto_child4 child4; typedef Arg5 proto_child5; proto_child5 child5; typedef Arg6 proto_child6; proto_child6 child6;
typedef void proto_child7; typedef void proto_child8; typedef void proto_child9;
BOOST_FORCEINLINE
expr const &proto_base() const
{
return *this;
}
BOOST_FORCEINLINE
expr &proto_base()
{
return *this;
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6>
BOOST_FORCEINLINE
static expr const make(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6)
{
expr that = {a0 , a1 , a2 , a3 , a4 , a5 , a6};
return that;
}
typedef detail::not_a_valid_type address_of_hack_type_;
BOOST_FORCEINLINE
proto::expr<
proto::tag::assign
, list2<expr &, expr const &>
, 2
> const
operator =(expr const &a)
{
proto::expr<
proto::tag::assign
, list2<expr &, expr const &>
, 2
> that = {*this, a};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> const
operator =(A &a) const
{
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> const
operator =(A const &a) const
{
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> const
operator [](A &a) const
{
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> const
operator [](A const &a) const
{
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename Sig>
struct result
{
typedef typename result_of::funop<Sig, expr, default_domain>::type const type;
};
BOOST_FORCEINLINE
proto::expr<proto::tag::function, list1<expr const &>, 1> const
operator ()() const
{
proto::expr<proto::tag::function, list1<expr const &>, 1> that = {*this};
return that;
}
template<typename A0>
BOOST_FORCEINLINE
typename result_of::funop1<
expr const
, default_domain , const A0
>::type const
operator ()(A0 const &a0) const
{
return result_of::funop1<
expr const
, default_domain , const A0
>::call(*this , a0);
}
template<typename A0 , typename A1>
BOOST_FORCEINLINE
typename result_of::funop2<
expr const
, default_domain , const A0 , const A1
>::type const
operator ()(A0 const &a0 , A1 const &a1) const
{
return result_of::funop2<
expr const
, default_domain , const A0 , const A1
>::call(*this , a0 , a1);
}
template<typename A0 , typename A1 , typename A2>
BOOST_FORCEINLINE
typename result_of::funop3<
expr const
, default_domain , const A0 , const A1 , const A2
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2) const
{
return result_of::funop3<
expr const
, default_domain , const A0 , const A1 , const A2
>::call(*this , a0 , a1 , a2);
}
template<typename A0 , typename A1 , typename A2 , typename A3>
BOOST_FORCEINLINE
typename result_of::funop4<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3) const
{
return result_of::funop4<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3
>::call(*this , a0 , a1 , a2 , a3);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4>
BOOST_FORCEINLINE
typename result_of::funop5<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4) const
{
return result_of::funop5<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4
>::call(*this , a0 , a1 , a2 , a3 , a4);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5>
BOOST_FORCEINLINE
typename result_of::funop6<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5) const
{
return result_of::funop6<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6>
BOOST_FORCEINLINE
typename result_of::funop7<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6) const
{
return result_of::funop7<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5 , a6);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6 , typename A7>
BOOST_FORCEINLINE
typename result_of::funop8<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6 , A7 const &a7) const
{
return result_of::funop8<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5 , a6 , a7);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6 , typename A7 , typename A8>
BOOST_FORCEINLINE
typename result_of::funop9<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7 , const A8
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6 , A7 const &a7 , A8 const &a8) const
{
return result_of::funop9<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7 , const A8
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5 , a6 , a7 , a8);
}
};
template<typename Tag , typename Arg0 , typename Arg1 , typename Arg2 , typename Arg3 , typename Arg4 , typename Arg5 , typename Arg6 , typename Arg7>
struct expr<Tag, list8<Arg0 , Arg1 , Arg2 , Arg3 , Arg4 , Arg5 , Arg6 , Arg7>, 8 >
{
typedef Tag proto_tag;
static const long proto_arity_c = 8;
typedef mpl::long_<8 > proto_arity;
typedef expr proto_base_expr;
typedef list8<Arg0 , Arg1 , Arg2 , Arg3 , Arg4 , Arg5 , Arg6 , Arg7> proto_args;
typedef basic_expr<Tag, proto_args, 8 > proto_grammar;
typedef default_domain proto_domain;
typedef default_generator proto_generator;
typedef proto::tag::proto_expr<Tag, proto_domain> fusion_tag;
typedef expr proto_derived_expr;
typedef void proto_is_expr_;
typedef Arg0 proto_child0; proto_child0 child0; typedef Arg1 proto_child1; proto_child1 child1; typedef Arg2 proto_child2; proto_child2 child2; typedef Arg3 proto_child3; proto_child3 child3; typedef Arg4 proto_child4; proto_child4 child4; typedef Arg5 proto_child5; proto_child5 child5; typedef Arg6 proto_child6; proto_child6 child6; typedef Arg7 proto_child7; proto_child7 child7;
typedef void proto_child8; typedef void proto_child9;
BOOST_FORCEINLINE
expr const &proto_base() const
{
return *this;
}
BOOST_FORCEINLINE
expr &proto_base()
{
return *this;
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6 , typename A7>
BOOST_FORCEINLINE
static expr const make(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6 , A7 const &a7)
{
expr that = {a0 , a1 , a2 , a3 , a4 , a5 , a6 , a7};
return that;
}
typedef detail::not_a_valid_type address_of_hack_type_;
BOOST_FORCEINLINE
proto::expr<
proto::tag::assign
, list2<expr &, expr const &>
, 2
> const
operator =(expr const &a)
{
proto::expr<
proto::tag::assign
, list2<expr &, expr const &>
, 2
> that = {*this, a};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> const
operator =(A &a) const
{
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> const
operator =(A const &a) const
{
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> const
operator [](A &a) const
{
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> const
operator [](A const &a) const
{
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename Sig>
struct result
{
typedef typename result_of::funop<Sig, expr, default_domain>::type const type;
};
BOOST_FORCEINLINE
proto::expr<proto::tag::function, list1<expr const &>, 1> const
operator ()() const
{
proto::expr<proto::tag::function, list1<expr const &>, 1> that = {*this};
return that;
}
template<typename A0>
BOOST_FORCEINLINE
typename result_of::funop1<
expr const
, default_domain , const A0
>::type const
operator ()(A0 const &a0) const
{
return result_of::funop1<
expr const
, default_domain , const A0
>::call(*this , a0);
}
template<typename A0 , typename A1>
BOOST_FORCEINLINE
typename result_of::funop2<
expr const
, default_domain , const A0 , const A1
>::type const
operator ()(A0 const &a0 , A1 const &a1) const
{
return result_of::funop2<
expr const
, default_domain , const A0 , const A1
>::call(*this , a0 , a1);
}
template<typename A0 , typename A1 , typename A2>
BOOST_FORCEINLINE
typename result_of::funop3<
expr const
, default_domain , const A0 , const A1 , const A2
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2) const
{
return result_of::funop3<
expr const
, default_domain , const A0 , const A1 , const A2
>::call(*this , a0 , a1 , a2);
}
template<typename A0 , typename A1 , typename A2 , typename A3>
BOOST_FORCEINLINE
typename result_of::funop4<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3) const
{
return result_of::funop4<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3
>::call(*this , a0 , a1 , a2 , a3);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4>
BOOST_FORCEINLINE
typename result_of::funop5<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4) const
{
return result_of::funop5<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4
>::call(*this , a0 , a1 , a2 , a3 , a4);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5>
BOOST_FORCEINLINE
typename result_of::funop6<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5) const
{
return result_of::funop6<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6>
BOOST_FORCEINLINE
typename result_of::funop7<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6) const
{
return result_of::funop7<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5 , a6);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6 , typename A7>
BOOST_FORCEINLINE
typename result_of::funop8<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6 , A7 const &a7) const
{
return result_of::funop8<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5 , a6 , a7);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6 , typename A7 , typename A8>
BOOST_FORCEINLINE
typename result_of::funop9<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7 , const A8
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6 , A7 const &a7 , A8 const &a8) const
{
return result_of::funop9<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7 , const A8
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5 , a6 , a7 , a8);
}
};
template<typename Tag , typename Arg0 , typename Arg1 , typename Arg2 , typename Arg3 , typename Arg4 , typename Arg5 , typename Arg6 , typename Arg7 , typename Arg8>
struct expr<Tag, list9<Arg0 , Arg1 , Arg2 , Arg3 , Arg4 , Arg5 , Arg6 , Arg7 , Arg8>, 9 >
{
typedef Tag proto_tag;
static const long proto_arity_c = 9;
typedef mpl::long_<9 > proto_arity;
typedef expr proto_base_expr;
typedef list9<Arg0 , Arg1 , Arg2 , Arg3 , Arg4 , Arg5 , Arg6 , Arg7 , Arg8> proto_args;
typedef basic_expr<Tag, proto_args, 9 > proto_grammar;
typedef default_domain proto_domain;
typedef default_generator proto_generator;
typedef proto::tag::proto_expr<Tag, proto_domain> fusion_tag;
typedef expr proto_derived_expr;
typedef void proto_is_expr_;
typedef Arg0 proto_child0; proto_child0 child0; typedef Arg1 proto_child1; proto_child1 child1; typedef Arg2 proto_child2; proto_child2 child2; typedef Arg3 proto_child3; proto_child3 child3; typedef Arg4 proto_child4; proto_child4 child4; typedef Arg5 proto_child5; proto_child5 child5; typedef Arg6 proto_child6; proto_child6 child6; typedef Arg7 proto_child7; proto_child7 child7; typedef Arg8 proto_child8; proto_child8 child8;
typedef void proto_child9;
BOOST_FORCEINLINE
expr const &proto_base() const
{
return *this;
}
BOOST_FORCEINLINE
expr &proto_base()
{
return *this;
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6 , typename A7 , typename A8>
BOOST_FORCEINLINE
static expr const make(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6 , A7 const &a7 , A8 const &a8)
{
expr that = {a0 , a1 , a2 , a3 , a4 , a5 , a6 , a7 , a8};
return that;
}
typedef detail::not_a_valid_type address_of_hack_type_;
BOOST_FORCEINLINE
proto::expr<
proto::tag::assign
, list2<expr &, expr const &>
, 2
> const
operator =(expr const &a)
{
proto::expr<
proto::tag::assign
, list2<expr &, expr const &>
, 2
> that = {*this, a};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> const
operator =(A &a) const
{
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> const
operator =(A const &a) const
{
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> const
operator [](A &a) const
{
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> const
operator [](A const &a) const
{
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename Sig>
struct result
{
typedef typename result_of::funop<Sig, expr, default_domain>::type const type;
};
BOOST_FORCEINLINE
proto::expr<proto::tag::function, list1<expr const &>, 1> const
operator ()() const
{
proto::expr<proto::tag::function, list1<expr const &>, 1> that = {*this};
return that;
}
template<typename A0>
BOOST_FORCEINLINE
typename result_of::funop1<
expr const
, default_domain , const A0
>::type const
operator ()(A0 const &a0) const
{
return result_of::funop1<
expr const
, default_domain , const A0
>::call(*this , a0);
}
template<typename A0 , typename A1>
BOOST_FORCEINLINE
typename result_of::funop2<
expr const
, default_domain , const A0 , const A1
>::type const
operator ()(A0 const &a0 , A1 const &a1) const
{
return result_of::funop2<
expr const
, default_domain , const A0 , const A1
>::call(*this , a0 , a1);
}
template<typename A0 , typename A1 , typename A2>
BOOST_FORCEINLINE
typename result_of::funop3<
expr const
, default_domain , const A0 , const A1 , const A2
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2) const
{
return result_of::funop3<
expr const
, default_domain , const A0 , const A1 , const A2
>::call(*this , a0 , a1 , a2);
}
template<typename A0 , typename A1 , typename A2 , typename A3>
BOOST_FORCEINLINE
typename result_of::funop4<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3) const
{
return result_of::funop4<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3
>::call(*this , a0 , a1 , a2 , a3);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4>
BOOST_FORCEINLINE
typename result_of::funop5<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4) const
{
return result_of::funop5<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4
>::call(*this , a0 , a1 , a2 , a3 , a4);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5>
BOOST_FORCEINLINE
typename result_of::funop6<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5) const
{
return result_of::funop6<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6>
BOOST_FORCEINLINE
typename result_of::funop7<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6) const
{
return result_of::funop7<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5 , a6);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6 , typename A7>
BOOST_FORCEINLINE
typename result_of::funop8<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6 , A7 const &a7) const
{
return result_of::funop8<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5 , a6 , a7);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6 , typename A7 , typename A8>
BOOST_FORCEINLINE
typename result_of::funop9<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7 , const A8
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6 , A7 const &a7 , A8 const &a8) const
{
return result_of::funop9<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7 , const A8
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5 , a6 , a7 , a8);
}
};
template<typename Tag , typename Arg0 , typename Arg1 , typename Arg2 , typename Arg3 , typename Arg4 , typename Arg5 , typename Arg6 , typename Arg7 , typename Arg8 , typename Arg9>
struct expr<Tag, list10<Arg0 , Arg1 , Arg2 , Arg3 , Arg4 , Arg5 , Arg6 , Arg7 , Arg8 , Arg9>, 10 >
{
typedef Tag proto_tag;
static const long proto_arity_c = 10;
typedef mpl::long_<10 > proto_arity;
typedef expr proto_base_expr;
typedef list10<Arg0 , Arg1 , Arg2 , Arg3 , Arg4 , Arg5 , Arg6 , Arg7 , Arg8 , Arg9> proto_args;
typedef basic_expr<Tag, proto_args, 10 > proto_grammar;
typedef default_domain proto_domain;
typedef default_generator proto_generator;
typedef proto::tag::proto_expr<Tag, proto_domain> fusion_tag;
typedef expr proto_derived_expr;
typedef void proto_is_expr_;
typedef Arg0 proto_child0; proto_child0 child0; typedef Arg1 proto_child1; proto_child1 child1; typedef Arg2 proto_child2; proto_child2 child2; typedef Arg3 proto_child3; proto_child3 child3; typedef Arg4 proto_child4; proto_child4 child4; typedef Arg5 proto_child5; proto_child5 child5; typedef Arg6 proto_child6; proto_child6 child6; typedef Arg7 proto_child7; proto_child7 child7; typedef Arg8 proto_child8; proto_child8 child8; typedef Arg9 proto_child9; proto_child9 child9;
BOOST_FORCEINLINE
expr const &proto_base() const
{
return *this;
}
BOOST_FORCEINLINE
expr &proto_base()
{
return *this;
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6 , typename A7 , typename A8 , typename A9>
BOOST_FORCEINLINE
static expr const make(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6 , A7 const &a7 , A8 const &a8 , A9 const &a9)
{
expr that = {a0 , a1 , a2 , a3 , a4 , a5 , a6 , a7 , a8 , a9};
return that;
}
typedef detail::not_a_valid_type address_of_hack_type_;
BOOST_FORCEINLINE
proto::expr<
proto::tag::assign
, list2<expr &, expr const &>
, 2
> const
operator =(expr const &a)
{
proto::expr<
proto::tag::assign
, list2<expr &, expr const &>
, 2
> that = {*this, a};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> const
operator =(A &a) const
{
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> const
operator =(A const &a) const
{
proto::expr<
proto::tag::assign
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> const
operator [](A &a) const
{
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename A>
BOOST_FORCEINLINE
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> const
operator [](A const &a) const
{
proto::expr<
proto::tag::subscript
, list2<expr const &, typename result_of::as_child<A const>::type>
, 2
> that = {*this, proto::as_child(a)};
return that;
}
template<typename Sig>
struct result
{
typedef typename result_of::funop<Sig, expr, default_domain>::type const type;
};
BOOST_FORCEINLINE
proto::expr<proto::tag::function, list1<expr const &>, 1> const
operator ()() const
{
proto::expr<proto::tag::function, list1<expr const &>, 1> that = {*this};
return that;
}
template<typename A0>
BOOST_FORCEINLINE
typename result_of::funop1<
expr const
, default_domain , const A0
>::type const
operator ()(A0 const &a0) const
{
return result_of::funop1<
expr const
, default_domain , const A0
>::call(*this , a0);
}
template<typename A0 , typename A1>
BOOST_FORCEINLINE
typename result_of::funop2<
expr const
, default_domain , const A0 , const A1
>::type const
operator ()(A0 const &a0 , A1 const &a1) const
{
return result_of::funop2<
expr const
, default_domain , const A0 , const A1
>::call(*this , a0 , a1);
}
template<typename A0 , typename A1 , typename A2>
BOOST_FORCEINLINE
typename result_of::funop3<
expr const
, default_domain , const A0 , const A1 , const A2
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2) const
{
return result_of::funop3<
expr const
, default_domain , const A0 , const A1 , const A2
>::call(*this , a0 , a1 , a2);
}
template<typename A0 , typename A1 , typename A2 , typename A3>
BOOST_FORCEINLINE
typename result_of::funop4<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3) const
{
return result_of::funop4<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3
>::call(*this , a0 , a1 , a2 , a3);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4>
BOOST_FORCEINLINE
typename result_of::funop5<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4) const
{
return result_of::funop5<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4
>::call(*this , a0 , a1 , a2 , a3 , a4);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5>
BOOST_FORCEINLINE
typename result_of::funop6<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5) const
{
return result_of::funop6<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6>
BOOST_FORCEINLINE
typename result_of::funop7<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6) const
{
return result_of::funop7<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5 , a6);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6 , typename A7>
BOOST_FORCEINLINE
typename result_of::funop8<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6 , A7 const &a7) const
{
return result_of::funop8<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5 , a6 , a7);
}
template<typename A0 , typename A1 , typename A2 , typename A3 , typename A4 , typename A5 , typename A6 , typename A7 , typename A8>
BOOST_FORCEINLINE
typename result_of::funop9<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7 , const A8
>::type const
operator ()(A0 const &a0 , A1 const &a1 , A2 const &a2 , A3 const &a3 , A4 const &a4 , A5 const &a5 , A6 const &a6 , A7 const &a7 , A8 const &a8) const
{
return result_of::funop9<
expr const
, default_domain , const A0 , const A1 , const A2 , const A3 , const A4 , const A5 , const A6 , const A7 , const A8
>::call(*this , a0 , a1 , a2 , a3 , a4 , a5 , a6 , a7 , a8);
}
};
``` |
Siobhan O'Sullivan (19 March 1974 – 17 June 2023) was an Australian political scientist and political theorist. She was an associate professor in the School of Social Sciences, University of New South Wales. Her research focused, among other things, on animal welfare policy and the welfare state. She was the author of Animals, Equality and Democracy (2011, Palgrave Macmillan) and a coauthor of Getting Welfare to Work (2015, Oxford University Press) and Buying and Selling the Poor (2022, Sydney University Press). She co-edited Contracting-out Welfare Services (2015, Wiley) and The Political Turn in Animal Ethics (2016, Rowman & Littlefield International). She was the founding host of the regular animal studies podcast Knowing Animals.
Life and career
Siobhan O'Sullivan read for a PhD in government and international relations in the Faculty of Economics and Business, University of Sydney, where she was supervised by Lyn Carson. Her thesis, entitled Animal Visibility and Equality in Liberal Democratic States: A Study Into Animal Ethics and the Nature of Bias in Animal Protection Regulation, was submitted in May 2007. It was examined by Denise Russell and Robert Garner. O'Sullivan graduated in 2008. In that same year, she became a research fellow at the School of Social and Political Sciences at the University of Melbourne, spending some time at Clark University, Massachusetts, as a part of the Human-Animal Studies Fellowship program. The research that went into her PhD project subsequently formed the basis of her 2011 book Animals, Equality and Democracy, published by Palgrave Macmillan in conjunction with the Oxford Centre for Animal Ethics as part of the Palgrave Macmillan Animal Ethics Series, edited by Andrew Linzey and Priscilla Cohn.
O'Sullivan was based at the University of Melbourne for seven years, and subsequently became a lecturer in social policy in the School of Social Sciences, University of New South Wales. In 2015, her Getting Welfare to Work: Street Level Governance in Australia, the UK and the Netherlands (coauthored with Mark Considine, Jenny M. Lewis and Els Sol) was published with Oxford University Press, and the edited collection Contracting-out Welfare Services: Comparing National Policy Designs for Unemployment Assistance, edited by O'Sullivan and Considine, was published with Wiley. Another collection, The Political Turn in Animal Ethics, co-edited by O'Sullivan and Robert Garner, was published by Rowman & Littlefield in 2016.
In August 2020, O'Sullivan was diagnosed with ovarian cancer. She became a spokesperson for the Ovarian Cancer Research Foundation and established animal studies prizes with the Australasian Animal Studies Association. In 2022, she published Buying and Selling the Poor, co-authored with Michael McGann and Mark Considine, with Sydney University Press. While living with cancer, O'Sullivan publicly campaigned for the legalisation of assisted dying in New South Wales; Alex Greenwich's Voluntary Assisted Dying Bill 2021 was passed in May 2022.
She died on 17 June 2023 at age 49 from ovarian cancer.
Research
On the website of the University of New South Wales, O'Sullivan was listed as conducting research into "the delivery of contracted employment services in Australia, the UK, and around the world". Her research interests were listed as the welfare state, "mission drift", animal welfare policy and environmental ethics. In addition to her published work, she contributed to research reports on social services and the welfare state for Australasian and European audiences. She also published in the popular press, and, for several years, produced Knowing Animals, a fortnightly podcast in which she talked to animal studies scholars about their research. Knowing Animals, which was launched in 2015, includes the main Knowing Animals series and a second series called Protecting Animals, which features interviews with animal advocates about their practical work for animals. The podcast was subsequently taken over by Josh Milburn.
O'Sullivan was a key figure in the "political turn" in animal ethics (i.e., the emergence of animal ethics informed by political theory rather than moral philosophy). In her Animals, Equality and Democracy, O'Sullivan explored the issue of the unequal treatment of members of different species in contemporary societies. However, she drew a distinction between the "external inconsistency" and the "internal inconsistency", with the former being the inconsistency between the treatment of humans and other animals, and the latter being the inconsistency between the treatment of different nonhuman animals. While traditional analyses of the issue have focused on the external inconsistency, O'Sullivan looks to the internal inconsistency. In particular, O'Sullivan argued that those animals who are more visible are offered greater protection under the law. So, for example, while animals used in agriculture are shielded from public view, animals used in sport have relatively high levels of public visibility. In order to illustrate the difference between the visibility of different animals, O'Sullivan examined interviews with animal activists and offered a media content analysis of Australian newspapers. In order to explore legal differences, she examined the legal protection offered to animals in New South Wales, which she compared with the legal protection offered to animals in 19th century England.
This internal inconsistency caused by differential visibility is, O'Sullivan argued, not only unjust and morally arbitrary, but also contrary to "the important liberal democratic values of equity and informed public decision making". She proposed a new approach to animal advocacy, suggesting that advocates focus on the internal inconsistency rather than the external inconsistency. Nina Varsava, publishing in the Journal for Critical Animal Studies, offered an unfavourable review of the book, saying that O'Sullivan's criticism of legal protection of animals through the lens of the internal, but not external, inconsistency might make for "good liberal politics", but it made for "bad animal ethics". "O'Sullivan", she said, "chooses political expediency over moral, or, for that matter, logical, integrity". Alasdair Cochrane was more complimentary. He expressed concern that O'Sullivan's "call for liberal principles to be applied consistently to animals is vulnerable to the charge that these principles are not meant for animals", meaning that O'Sullivan would have to respond to the external inconsistency first. Nonetheless, he praised Animals, Equality and Democracy as offering "rigorous analysis, compelling insights, and a persuasive basis on which to build an animal protection strategy that is progressive, nondiscriminatory, and attuned to widely held political beliefs and practices". The book's preface was written by Garner, who praised O'Sullivan's innovative approach.
Selected publications
Books
Edited collections
References
Further reading
External links
Siobhan O'Sullivan at the University of New South Wales
Knowing Animals podcast
Siobhan O'Sullivan at the New Zealand Centre for Human-Animal Studies
1974 births
2023 deaths
Australian animal welfare scholars
Australian political scientists
Australian political philosophers
Academic staff of the University of New South Wales
Australian podcasters
Deaths from ovarian cancer
University of Sydney alumni
Women political scientists
Deaths from cancer in Australia |
Phillips W. Rockefeller (born November 20, 1938) is an American lawyer and politician who served as a Washington State Senator (Democrat) for the 23rd legislative district, which includes Bainbridge Island, Keyport, Poulsbo, Kingston, Hansville, Silverdale, and most of East Bremerton.
Phil received his undergraduate degree from Yale University and his J.D. degree from Harvard. Before winning election to the legislature, he was education aide to Gov. John Spellman and Regional Commissioner of the U.S. Office of Education. Phil served as the assistant majority floor leader and chair of the Water, Energy & Telecommunications Committee (formerly the Water, Energy & Environment Committee, to which he was vice chair), and was a member of both the Natural Resources, Ocean & Recreation Committee (formerly vice chair) and the Ways & Means Committee.
In a district defined by its unique geography and quality of life, he is a strong advocate for clean air and water, as well as quality jobs, schools and health care.
Boards and Committees: Legislative: Capital Projects Advisory Review Board (CPARB), Council of State Governments-WEST Western Water and Environment Committee, Joint Subcommittee on the Statutory Duties of the State Board of Education, Joint Legislative Audit and Review Committee (JLARC), National Conference of State Legislatures Clean Energy and Air Quality Working Group, National Conference of State Legislatures Environment and Natural Resources Committee, Puget Sound Partnership, Statute Law Committee. Non-Legislative: Kitsap Area Agency on Aging board member, Kitsap Community Resources board member
Phil and his wife, Anita, live on Bainbridge Island and have three daughters.
He resigned from the state senate in 2011 to accept an appointment to the Northwest Power and Conservation council.
Recognition
Senator Phil Rockefeller was chosen as Washington Conservation Voters' 2007 Legislator of the Year and was an environmental champion in the 2005-2006 Legislative Scorecard.
See also
Washington State Legislature
References
Washington (state) state senators
Living people
Harvard Law School alumni
Yale University alumni
1938 births |
The Bidwell House Museum is a historic house and museum on Art School Road in Monterey, Massachusetts, United States.
The Bidwell House
The house was built in the 1760s by the Reverend Adonijah Bidwell, the first minister in what was then Township No. 1. At that time, the house was the demographic center of the township and was located on the route of the Boston-Albany Post Road. It is a classic Georgian Saltbox built around a central chimney. Four fireplaces and two beehive ovens feed into the chimney structure, which is supported by a classical Roman Arch in the basement. The house has two additions, the Ell Addition (1820s) and a Greek Revival/Carriage Barn addition (1840s).
History
Henry Knox
Reverend Bidwell, a patriot, was an active supporter of the United States Army. Henry Knox, famous for his leadership of the expedition that carried strategically crucial cannons from Fort Ticonderoga to Dorchester Heights, passed through Monterey on that famous mission, most likely on the post road. Historical evidence suggests that Knox may have passed through the Bidwell property on his famous journey, now the basis for books, films, and the historic Henry Knox Trail. He may have even stopped at the house in the middle of winter, possibly to stay a night or obtain supplies.
Ownership
The Reverend died in 1784 and left the house to his son, Adonijah the Younger. Adonijah the Younger utilized the house and grounds (approximately at the time) as a family farm, before selling the house in his old age to his son, John Devotion Bidwell, for "love and affection and one dollar." In 1853, John Devotion Bidwell sold the house to the Carrington family after 103 years of Bidwell ownership. At the time, John Bidwell was a selectman, justice of the peace, and prominent personality in the newly incorporated town of Monterey, Massachusetts (1847).
The house remained with the Carrington family for three generations and 61 years until they sold it to a lumber company in 1914. After using the house as a base for local operations, the company sold it to an Art School. It was used as a faculty house by the school until 1935. By this time it had acquired the name "Deepwood Manse." By the 1950s, the house was in an increasing state of disrepair.
Restoration
In 1960, it was purchased by Jack Hargis and David Brush, two fashion designers from New York City. They bought it and surrounding for the sum of $30,000 and proceeded to spend the next 25 years restoring the house. They were fortunate enough to come across the inventory of the Rev. Bidwell's estate, which listed all his worldly possessions at the time of his death. Hargis and Brush proceeded to fill the restored house with dated pieces of furniture, artwork, and other objects, many of them originally owned by the Reverend.
Today
It was added to the National Register of Historic Places in 1982. In 1990, the house became a museum, the result of a death request by David Brush. It is open for tours from Thursday through Monday between Memorial Day and Columbus Day, as well as for special events. It is open from 11:00 AM to 4:00 PM, with guided tours of the house starting on the hour.
See also
National Register of Historic Places listings in Berkshire County, Massachusetts
References
External links
Bidwell House Museum - official site
Berkshire Web listing
Saltbox architecture in Massachusetts
Houses completed in 1750
Historic house museums in Massachusetts
Museums in Berkshire County, Massachusetts
Museums established in 1990
Monterey, Massachusetts
Houses on the National Register of Historic Places in Berkshire County, Massachusetts |
This is a list of historical events and publications of Australian literature during 2019.
Major publications
Literary fiction
Debra Adelaide, Zebra and other stories
Tony Birch, The White Girl
David Brooks, The Grass Library
Steven Carroll, The Year of the Beast
Melanie Cheng, Room for a Stranger
Peggy Frew, Islands
Peter Goldsworthy, Minotaur
John Hughes, No One
Anna Krien, Act of Grace
Vicki Laveau-Harvie, The Erratics
Melina Marchetta, The Place on Dalhousie
Andrew McGahan, The Rich Man's House (posthumous)
Gerald Murnane, A Season on Earth
Favel Parrett, There Was Still Love
Heather Rose, Bruny
Philip Slalom, The Returns
Carrie Tiffany, Exploded View
Lucy Treloar, Wolfe Island
Christos Tsiolkas, Damascus
Tara June Winch, The Yield
Charlotte Wood, The Weekend
Short stories
Josephine Rowe, Here Until August
Children's and young adult fiction
Mem Fox, The Tiny Star
Helena Fox, How It Feels to Float
Will Kostakis, Monuments
Tania McCartney – Fauna: Australia's Most Curious Creatures
Meg McKinlay, Catch a Falling Star
Bruce Pascoe, Young Dark Emu
Holden Sheppard, Invisible Boys
Vikki Wakefield, This is How We Change the Ending
Crime
Matthew Condon, The Night Dragon
Candice Fox, Gone By Midnight
Tara Moss, Dead Man Switch
Science fiction
Claire G. Coleman, The Old Lie
Poetry
Louise Crisp, Yuiquimbiang
Charmaine Papertalk Green, Nganajungu Yagu
L. K. Holt, Birth Plan
Gerald Murnane, Green Shadows and Other Poems
Pi O, Heide
Non-fiction
Jane Caro, Accidental Feminists
Maxine Beneba Clarke, with Magan Magan and Ahmed Yussuf (editors), Growing Up African in Australia
Stan Grant
Australia Day
On Identity
Nicholas Hasluck, Beyond the Equator: An Australian Memoir
Jess Hill, See What You Made Me Do
Jacqueline Kent, Beyond Words: A Year with Kenneth Cook
Caro Llewellyn, Diving into Glass
Emily Maguire, This is What a Feminist Looks Like
Bianca Nogrady (editor), The Best Australian Science Writing 2019
Christina Thompson, Sea People: The Puzzle of Polynesia
Awards and honours
Note: these awards were presented in the year in question.
Lifetime achievement
Fiction
National
Children and Young Adult
National
Crime and Mystery
National
Science fiction
Non-Fiction
Poetry
Drama
Deaths
20 January – Mudrooroo, 80, novelist, poet and playwright (pen name of Colin Thomas Johnson)
1 February – Andrew McGahan, 52, novelist
4 March – Les Carlyon, 76, newspaper editor
13 March – Edmund Capon, 78, art historian
15 March – Rudi Krausmann, 85, playwright and poet
22 March – Jack Absalom, 91, artist, author and adventurer
29 April – Les Murray, 80, poet, anthologist and critic
19 May – John Millett, poet, reviewer and poetry editor (born 1921)
1 June – Christobel Mattingley, 87, writer for children and young adults
13 July – Kerry Reed-Gilbert, 62, poet and author
21 July –
Laurie Hergenhan, 88, literary scholar
Ann Moyal, 93, historian
10 September – Hal Colebatch, 73, poet and novelist
30 October – Beatrice Faust, 80, co-founder of Women's Electoral Lobby, journalist and author
24 November – Clive James, 80, poet, novelist and critic
See also
2019 in Australia
2019 in literature
2019 in poetry
List of years in Australian literature
List of years in literature
List of Australian literary awards
References
Literature
Australian literature by year
Years of the 21st century in Australia
Years of the 21st century in literature |
```html
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>adjacent_filtered</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="Chapter 1. Range 2.0">
<link rel="up" href="../reference.html" title="Reference">
<link rel="prev" href="../reference.html" title="Reference">
<link rel="next" href="copied.html" title="copied">
</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="../reference.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.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="copied.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="range.reference.adaptors.reference.adjacent_filtered"></a><a class="link" href="adjacent_filtered.html" title="adjacent_filtered">adjacent_filtered</a>
</h5></div></div></div>
<div class="toc"><dl class="toc"><dt><span class="section"><a href="adjacent_filtered.html#range.reference.adaptors.reference.adjacent_filtered.adjacent_filtered_example">adjacent_filtered
example</a></span></dt></dl></div>
<div class="informaltable"><table class="table">
<colgroup>
<col>
<col>
</colgroup>
<thead><tr>
<th>
<p>
Syntax
</p>
</th>
<th>
<p>
Code
</p>
</th>
</tr></thead>
<tbody>
<tr>
<td>
<p>
Pipe
</p>
</td>
<td>
<p>
<code class="computeroutput"><span class="identifier">rng</span> <span class="special">|</span>
<span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">adjacent_filtered</span><span class="special">(</span><span class="identifier">bi_pred</span><span class="special">)</span></code>
</p>
</td>
</tr>
<tr>
<td>
<p>
Function
</p>
</td>
<td>
<p>
<code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">adjacent_filter</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span>
<span class="identifier">bi_pred</span><span class="special">)</span></code>
</p>
</td>
</tr>
</tbody>
</table></div>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
<span class="bold"><strong>Precondition:</strong></span> The <code class="computeroutput"><span class="identifier">value_type</span></code> of the range is convertible
to both argument types of <code class="computeroutput"><span class="identifier">bi_pred</span></code>.
</li>
<li class="listitem">
<span class="bold"><strong>Postcondition:</strong></span> For all adjacent
elements <code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code> in the returned range, <code class="computeroutput"><span class="identifier">bi_pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">)</span></code>
is <code class="computeroutput"><span class="keyword">true</span></code>.
</li>
<li class="listitem">
<span class="bold"><strong>Throws:</strong></span> Whatever the copy constructor
of <code class="computeroutput"><span class="identifier">bi_pred</span></code> might
throw.
</li>
<li class="listitem">
<span class="bold"><strong>Range Category:</strong></span> <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
Range</a>
</li>
<li class="listitem">
<span class="bold"><strong>Return Type:</strong></span> <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adjacent_filtered_range</span><span class="special"><</span><span class="keyword">decltype</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="keyword">decltype</span><span class="special">(</span><span class="identifier">bi_pred</span><span class="special">)></span></code>
</li>
<li class="listitem">
<span class="bold"><strong>Returned Range Category:</strong></span> The minimum
of the range category of <code class="computeroutput"><span class="identifier">rng</span></code>
and <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
</li>
</ul></div>
<div class="section">
<div class="titlepage"><div><div><h6 class="title">
<a name="range.reference.adaptors.reference.adjacent_filtered.adjacent_filtered_example"></a><a class="link" href="adjacent_filtered.html#range.reference.adaptors.reference.adjacent_filtered.adjacent_filtered_example" title="adjacent_filtered example">adjacent_filtered
example</a>
</h6></div></div></div>
<p>
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">adjacent_filtered</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">assign</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">iterator</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">functional</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">iostream</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">vector</span><span class="special">></span>
<span class="keyword">int</span> <span class="identifier">main</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">argc</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">argv</span><span class="special">[])</span>
<span class="special">{</span>
<span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">assign</span><span class="special">;</span>
<span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span> <span class="identifier">input</span><span class="special">;</span>
<span class="identifier">input</span> <span class="special">+=</span> <span class="number">1</span><span class="special">,</span><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">;</span>
<span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span>
<span class="identifier">input</span> <span class="special">|</span> <span class="identifier">adjacent_filtered</span><span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">not_equal_to</span><span class="special"><</span><span class="keyword">int</span><span class="special">>()),</span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">ostream_iterator</span><span class="special"><</span><span class="keyword">int</span><span class="special">>(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span><span class="special">,</span> <span class="string">","</span><span class="special">));</span>
<span class="keyword">return</span> <span class="number">0</span><span class="special">;</span>
<span class="special">}</span>
</pre>
<p>
</p>
</div>
<p>
This would produce the output:
</p>
<pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">,</span>
</pre>
<p>
</p>
</div>
<table xmlns:rev="path_to_url~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
Neil Groves<p>
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="../reference.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.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="copied.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
``` |
```xml
import { Providers } from 'expo-maps/build/Map.types';
import { createContext } from 'react';
const ProviderContext = createContext<Providers>('google');
export default ProviderContext;
``` |
Gyuu is the first studio album by Masami Okui, released on April 21, 1995.
Information
Includes a self-cover of the first song that Masami Okui composed and wrote the lyrics herself .
Track listing
Reincarnation
OVA Tekkaman Blade II opening song
Lyrics: Satomi Arimori
Composition: Takashi Kudo
Arrangement: Toshiro Yabuki
Cover of Mariko Koda's character song in OVA Tekkaman Blade II
Lyrics, composition: Masami Okui
Arrangement: Toshiro Yabuki
I Was Born to Fall In Love
OVA Compiler opening song
Lyrics: Satomi Arimori
Composition, arrangement: Hideya Nakazaki
OVA Tekkaman Blade II image song
Lyrics: Satomi Arimori
Composition: Takashi Kudo
Arrangement: Masami Okui
Full Up Mind
OVA Compiler ending song
Lyrics: Satomi Arimori
Composition, arrangement: Hideya Nakazaki
Beats the Band
Anime film Ghost Sweeper Mikami soundtrack
Lyrics: Mamie D. Lee
Composition: Makoto Ikenaga
Arrangement: Vink
Face
Cover for Saeko Shimazu's character song in OVA All Purpose Cultural Cat Girl Nuku Nuku
Lyrics: Satomi Arimori
Composition, arrangement: Tsutomu Ohira
Original song Okui made specially for this album
Lyrics, composition: Masami Okui
Arrangement: Toshiro Yabuki
My Jolly Days
Anime film Ghost Sweeper Mikami ending song
Lyrics: Keiko Kimoto
Composition: Tsutomu Ohira
Arrangement: Vink
OVA Tekkaman Blade II ending song
Lyrics: Satomi Arimori
Composition: Takashi Kudo
Arrangement: Toshiro Yabuki
Energy
OVA Megami Paradise image song
Lyrics, composition: Masami Okui
Arrangement: Toshiro Yabuki
OVA Tekkaman Blade II ending song
Lyrics: Satomi Arimori
Composition: Takashi Kudo
Arrangement: Toshiro Yabuki
OVA Girl from Fantasia theme song
Lyrics: Satomi Arimori
Composition, arrangement: Toshiyuki Watanabe
Bay side love story -from tokyo-
Lyrics, composition: Masami Okui
Arrangement: Toshiro Yabuki, Tsutomu Ohira
TV anime Neon Genesis Evangelion (anime) insert song
Sources
Official website: Makusonia
1995 debut albums
Masami Okui albums |
Marcus Richard Einfeld (born 22 September 1938) is an Australian former judge of the Federal Court of Australia and was the inaugural president of the Human Rights and Equal Opportunity Commission. He was convicted of perjury and perverting the course of justice and served two years in prison.
Einfeld studied law at the University of Sydney. His father Syd Einfeld was a federal MP. He was called to the bar in 1962, and appointed Queen's Counsel (QC) in 1977. From 1972 to 1976, Einfeld was a director of the World Jewish Congress, based in London. After returning to Australia he became one of Sydney's most prominent barristers. Einfeld was appointed to the Federal Court in 1986, serving until 2001. In the same year he was made the inaugural president of the Human Rights and Equal Opportunity Commission, serving until 1989. He was also the inaugural president of the Australian Paralympic Committee from 1990 to 1992.
In 2006, Einfeld was issued a A$77 speeding ticket for travelling 10 km/h (6.2 mph) over the limit. He appealed the ticket, claiming that he had not been driving. Journalists subsequently discovered that he had made a number of false statements under oath; the woman he had said was driving had in fact died several years earlier. Einfeld was arrested in 2007, and the following year pleaded guilty to perjury and perverting the course of justice. He was sentenced to three years' imprisonment. As a result of his actions, Einfeld was expelled from the legal profession and stripped of many of the honours he had previously accumulated, including his status as a Queen's Counsel, appointment of the Order of Australia, and his status as a National Living Treasure.
Early life
Einfeld was born in Sydney, and was named after his paternal grandfather who had died a year earlier. He has a sister. His parents were the Labor Party politician Syd Einfeld and his wife Billie Rose (née Appelboom), who married in June 1934. His father served in both Federal Parliament and the Parliament of New South Wales. Einfeld's paternal grandfather was the Reverend Marcus Einfeld (1874-1937), who came to Australia in 1909 (becoming the chazan and the Second Minister of the Great Synagogue) by way of London, England, to which he had immigrated from Jarosław in Galicia with his wife Deborah (née Gabel; d. 1957).
Einfeld attended Sydney Boys High School from 1951 to 1955. He then obtained his Bachelor of Laws degree from the University of Sydney in 1962. At some point, Einfeld began claiming that he held doctorates from both "Century University" and "Pacific Western University"; both are U.S.-based diploma mills without any accreditation as law schools. Those qualifications were referred to by Attorney-General Lionel Bowen when Einfeld was added to the Federal Court in 1987, and were listed in his Who's Who in Australia entry until 2007. His updated Who's Who entry, which was published after he had been arrested and charged with perjury, also corrected his year of birth (previously listed as 1939) and removed a claim that he had once been a director of the multinational firm Marks & Spencer in the 1970s.
Marriages and children
Einfeld has four children, two from each of two marriages. He married his first wife Yetta, a teacher, in 1963 and that had two children before they divorced in 1977. He married his second wife Anne, an attorney, in 1982 and they had two children before they divorced in 1996.
He was subsequently in a long-term relationship with Sylvia Eisman.
Legal and judicial career
Einfeld became a barrister in 1962. He was appointed a Queen's Counsel (QC) in 1977, aged 39. He represented High Court Justice Lionel Murphy in his legal challenge to the Parliamentary Commission of Inquiry which had been established to examine whether Murphy had perverted the course of justice; the inquiry was suspended when Murphy became terminally ill.
Einfeld was appointed to the Federal Court in 1986. Einfeld was also an additional Justice of the Australian Capital Territory. He retired as a judge in April 2001. Einfeld was the founding president of the Australian Human Rights and Equal Opportunity Commission. He was appointed to a seven-year term in December 1986, but resigned after three years citing an inability to combine the role with his judicial duties. In 1987 he led the commission's enquiry into the living conditions of Aborigines in the border area of New South Wales and Queensland. An Aboriginal elder praised his work with indigenous communities when he was Human Rights Commissioner.
Community and social involvement
Einfeld has served as Austcare's "Ambassador for Refugees", and as a UNICEF "Ambassador for Children". In 1997, he was named by the National Trust of Australia as an Australian Living Treasure, one of up to 100 living people selected by popular vote for having made outstanding contributions to Australian society. In 2002 he was granted the United Nations Peace Award. He has also served as National Vice President of the International Commission of Jurists (Australian Section). In 2002, he was presented a United Nations Association of Australia Founder's Award for his contribution to justice and human rights. He served as Chairman of Legal Resources International Inc., a non-government organisation funded by lawyers and the World Bank and Commonwealth Secretariat, dedicated to advising developing countries on establishing proper systems for democracy and justice.
He was made an Officer in the Order of Australia for services to international affairs and the protection of human rights in 1998. He was also the inaugural President of the Australian Paralympic Federation.
Einfeld has served as an executive member of the New South Wales Jewish Board of Deputies and as a Councillor on the Executive Council of Australian Jewry. He also started and served as the first chairman of the Australian Campaign for the Rescue of Soviet Jewry, following his earlier establishment of the London-based National Campaign for Soviet Jewry of the United Kingdom and Ireland. Einfeld has been a spokesperson for Israeli and Jewish causes, and has contributed to public debate on Palestine, the media, the United Nations, universities, and other institutions. In 1997 President of the Palestinian National Authority Yassar Arafat chose him to assist in overhauling the Palestinian Authority's legal system. He was an invited speaker at United Israel Appeal (UIA) functions in Britain, the United States, Europe, Canada, and Australia. He is patron of the Australian Association of Jewish Holocaust Survivors and Descendants and of the Sydney Jewish Museum.
Controversies
In a March 2006 address on the war on terror and civil liberties at the University of Western Sydney, he stated that Western powers, including Australia, had supported terrorist regimes financially, and that new sedition laws showed that Australia was "leaning towards an autocratic framework".
Einfeld was the President of Australian Legal Resources International, a non-profit independent group of lawyers that supported democracy, human rights, and the rule of law in developing countries. In August 2006, this organisation collapsed, leaving creditors, including AusAID, the Australian Taxation Office, and St.George Bank "thousands of dollars out of pocket."
Criminal conviction
On 7 August 2006, Einfeld contested a A$77 speeding ticket. His car had been caught by a speed camera, traveling at 60 km/h in a 50 km/h zone (10 km/h (6.2 mph) over the speed limit) in the Sydney suburb of Mosman on 8 January 2006. The BBC noted: "the judge was only 6 mph over the limit, which scarcely made him a boy racer."
He contested the ticket in Downing Centre Local Court by claiming he had on that day lent his car to an old friend, Professor Teresa Brennan, who was visiting from the United States. By making his claim Einfeld was avoiding a A$75 fine, and avoiding losing three of his four remaining demerit points.
He gave evidence under oath in the Local Court, and signed a statutory declaration to that effect, and the magistrate dismissed the charge as "not proved." However, a junior reporter for the Sydney daily tabloid The Daily Telegraph filed a brief story which caught the attention of assistant editor Michael Beach, who discovered that Brennan had died in the United States three years before Einfeld claimed she had been driving his car, and on Beach's instruction the reporter called Einfeld to obtain his reaction. This was the basis for Einfeld's later conviction for knowingly making a false statement under oath.
When challenged by the journalist concerning Brennan's death, Einfeld claimed that he had lent his car on that day to a different Terese or Therese Brennan, who he claimed also lived in the US, and who had also died after returning to the US. On 10 August 2006 a police investigation commenced into whether Einfeld had committed perjury in giving his evidence. On 23 August 2006, Einfeld produced a detailed 20-page statement describing the fictitious second Teresa Brennan and his supposed dealings with her. This was the basis for his conviction for attempting to pervert the course of justice.
Matters took an unusual turn when on 10 August 2006 Angela Liati, a 55-year-old Sydney woman unknown to Einfeld but who wanted to meet him, came forward and claimed that she had met Einfeld and had driven in his car with "Theahresa Brennan" (whom she had met on a meditation retreat) on a shopping expedition on the day in question. Liati said "He has given his life to good causes and has been a brilliant judge ... a brilliant man ... and he deserves all the respect a country will give him". Liati represented herself during an eight-day District Court jury trial and claimed that she was only endeavouring to make contact with Einfeld through her admission. However, she was found guilty on 12 February 2009 of perverting the course of justice and was subsequently sentenced to 200 hours' community service; later changed to a 12-month good behaviour bond.
On 29 March 2007, Einfeld was arrested by the New South Wales Police. He was initially charged by the Director of Public Prosecutions (New South Wales) with 13 offences, including perjury, perverting the course of justice, and making and using false statutory declarations. The charges had maximum penalties totalling 154 years in jail.
Einfeld's committal hearing was held in December 2007. The prosecution suggested the reason he lied under oath was that, had he gained the demerit points for the speeding offence, he would have been close to losing his licence. However, Einfeld denied he was aware his points were so high. One charge (hindering an investigation) was dropped. Einfeld was committed to stand trial on charges of perjury, perverting the course of justice, and traffic offences.
On 19 October 2008 the Court of Criminal Appeal dismissed another five of the charges against Einfeld, leaving only two.
On 31 October 2008, Einfeld pleaded guilty to the two remaining charges—to perjury, and to perverting the course of justice—just before his trial was to commence. It was also revealed that he had been battling prostate cancer for several months. The pre-sentence report to the court stated that Einfeld accepted responsibility for his actions. The head of the NSW Fraud Squad and commander of the Strike Force said its two-and-a-half-year investigation of the matter was "very lengthy, very protracted, very intricate". After his speeding fine case came to the attention of the Australian media, Einfeld was the subject of media reports alleging various other improprieties, including padding his curriculum vitae, purchasing doctorates from US diploma mills, and plagiarism.
On 20 March 2009, the 70-year-old retired judge Einfeld was sentenced to the maximum three years in prison for knowingly making a false statement under oath and for attempting to pervert the course of justice, with a non-parole period of two years. Supreme Court Justice Bruce James found Einfeld had committed "deliberate, premeditated perjury" that was "part of planned criminal activity". He served two years, and was released on parole on 19 March 2011.
Reactions
Einfeld said "I'm desperately sorry for what I did. I'm sorry to my family, my elderly mother and my children. I'm sorry to the public at large.... I lied. I can't say it any simpler than that. I told a lie, which was a disgraceful thing to do and for which I have been paying ever since." When Einfeld was asked if he was a dishonest man, he said: "No, I'm not dishonest, no... I don't think I'm the slightest bit dishonest. I just made a mistake."
On 5 November 2008, the President of the New South Wales Bar Association applied to the New South Wales Court of Appeal to withdraw Einfeld's commission as Queen's Counsel, on the basis that his conduct had brought shame upon the legal profession as well as on himself. On 26 November, Einfeld's commission as a Queen's Counsel was revoked. His membership of the Order of Australia was rescinded in April 2009.
NSW Law Society president Joe Catanzariti said that the three-year sentence for the former judge demonstrated that "the legal profession did not protect its own", but that it was tragic to see Einfeld's reputation ruined because "the sad thing in all of this is you do have a great man who has done great works, and ... the substantive thing that started it is so trivial." Reacting to a call to strip Einfeld of his pension, Chief Justice of New South Wales Jim Spigelman wrote in an April 2009 letter to NSW Attorney General John Hatzistergos that pensions should be safe when judges were already retired, they were a deferred part of their salary, criminal law was sufficient punishment, and that it would be even more unusual if the offence "bears no relationship" to the judge's former duties. Spigelman continued that then-federal Attorney General Robert McClelland and state attorneys-general should "impose a cooling off period on themselves" for reacting to vehement short-term ad hoc media campaigns."
Sydney barrister and author Charles Waterstreet observed: "at the time ... Einfeld wrote a false name for the driver ... at the heart of the sorry case ... the maximum, I repeat, the maximum fine for making a false declaration of that nature was $1,000." Former Australian Minister for Home Affairs, the Environment, and Arts Barry Cohen noted that: "many journalists ... feel it is beholden upon them to mention that a person is Jewish, particularly if they have been naughty... He received three years in custody... By comparison ... a young lady living in Canberra got four years for killing her boyfriend. Shortly after Marcus Einfeld was sentenced, Stephen Linnell, one of the top advisers to Victoria police commissioner Christine Nixon, pleaded guilty to three counts of perjury and disclosing confidential information of the Office of Police Integrity. He received an eight-month suspended sentence and a $5,000 fine. The glaring difference between these crimes and the punishments incurred is extraordinary."
Removal from the roll
On 23 July 2009, the New South Wales Court of Appeal ordered that Einfeld's name be struck out from the roll of lawyers. On 28 August 2009, the Court of Appeal delivered its reasons for making those declarations and orders, finding proven allegations that, in addition to the 2006 statutory declaration in respect of which he had been convicted, Einfeld had also sworn a series of statutory declarations in 1999, 2003, and 2004 falsely nominating other persons as the drivers of his car who he knew had not been driving the car so as to avoid traffic infringements. Einfeld agreed not to apply for re-admission. The court also considered the circumstances in which Einfeld had produced the 20-page statement describing the fictitious Teresa Brennan, and found that:
This statement reflects a studied, careful and premeditated attempt through a series of direct lies to influence the outcome of the administration of justice. It involves not a passing mistake, not an unfortunate and apparently uncharacteristic lapse but a studied and deliberate attempt to avoid the consequences of his actions and to deflect and pervert the course of justice. It may well be that the course of justice was in relation to a minor matter, standing alone. That, however, is not the point... All these facts ... when taken as a whole reflect deeply on the character of the defendant. Some of his falsehoods were committed at a time when he held high judicial office in the administration of justice in this country. Some were committed when he held the position as a practitioner... These matters, having taken place over a period of some seven years ... reveal a clear unfitness to remain on the Roll of Local Lawyers.
Later life
In 2011, Einfeld was devoting his time to community works, including working on Australian prison reform.
Honours
Queen's Counsel (QC): Letters Patent granted 1977. Revoked 26 November 2008.
Officer of the Order of Australia (AO): June 1998, "for service to international affairs and to the promotion and protection of human rights". Terminated by the Governor-General on 24 April 2009.
Australian Sports Medal: November 2000, as "Chairman of Fundraising Committee for 1988 Paralympic Team; President of APC 1990–1992". Subsequently terminated.
Centenary Medal: January 2001, "for service to the Centenary of Federation celebrations".
Literature
Marcus Einfeld, A Bill of Rights for the Australian People, Debrett's (2001)
Marcus Einfeld, Evidence Illegally and Improperly Obtained: Has the Pendulum Swung Too Far?, Seventh National Conference of Labor Lawyers (1985).
References
External links
Marcus Einfeld "The Great Australian Brain Robbery; The hijacking of the Australian conscience," Annual Human Rights and Social Justice Lecture, Richardson Theatre, University of Newcastle (19 September 2002)
1938 births
Australian Jews
Australian perjurers
Australian prisoners and detainees
Human rights in Australia
Human rights lawyers
Judges of the Federal Court of Australia
Judges of the Supreme Court of the Australian Capital Territory
Living people
Perverting the course of justice
UNICEF Goodwill Ambassadors
Sydney Law School alumni
People educated at Sydney Boys High School
Former Officers of the Order of Australia
People of Galician-Jewish descent
Australian barristers
People educated at Moriah College
Judges convicted of crimes
Disbarred lawyers |
The FIS Ski Flying World Championships 2014 took place from 14 to 16 March 2014 in Harrachov, Czech Republic for the fourth time. Harrachov hosted the event previously in 1983, 1992 and 2002. Individually Robert Kranjec was the defending champion. Austrian teammates Thomas Morgenstern. Andreas Kofler, Gregor Schlierenzauer and Martin Koch were the defending team champions.
The venue as the FIS Ski Flying World Championships 2014 was chosen at the 47th International Ski Congress in Antalya, Turkey on 3 June 2010.
Severin Freund of Germany became the individual champion after two series of jumps, since the last two series were cancelled due to bad weather conditions. Because of the same reason, the team event was cancelled as well.
Schedule
Results
Qualifying
Individual
References
External links
Official website
FIS Ski Flying World Championships
Sport in Harrachov
2014 in ski jumping
2014 in Czech sport
Ski jumping competitions in the Czech Republic
International sports competitions hosted by the Czech Republic
March 2014 sports events in Europe |
Violencia Musical ("Musical Violence") is the debut album by Hector & Tito, released in 1998.
Track list
References
1998 debut albums
Héctor & Tito albums |
Rodrigo Manrique de Lara (1406 – November 11, 1476, Ocaña, Spain) was a rebellious Spanish noble who gained notoriety for his prowess in the Reconquista battles against the Muslim invaders. He sided with the Infantes of Aragon during their war against John II of Castile and Álvaro de Luna. He held the title of the first Count of Paredes de Nava and was the Grand Master of the Order of Santiago for the Kingdom of Castile.
Family Origins
Rodrigo was the son of Pedro Manrique de Lara y Mendoza, VIII Señor of Amusco and Treviño and Adelantado Mayor of Castile, and his wife, Leonor de Castilla y Alburquerque. His brother was Gómez Manrique, the poet and playwright.
The Manrique line of the House of Lara, also known as the House of Manrique de Lara constituted one of the most powerful noble families in Medieval Spain, holding amongst their titles the Dukedom of Nájera and the Marquesado de Aguilar de Campoo. In 1520, when Charles I of Spain first recognized the original 25 Grandes de Espana, their house was amply represented amongst the list.
Biography
Rodrigo spent the bulk of his life in conflict with his arch enemy, Álvaro de Luna, in defense of his possessions and titles.
He entered into the Order of Santiago in 1418 at the age of 12. In 1434, he assisted in the taking of the city of Huéscar and was one of the ranking thirteen members of the order by 1440. In May 1452, he was named the first Count of Paredes de Nava by order of King John II of Castile.
After John II's death in 1454, he began to actively participate in the noble league fighting against Henry IV of Castile. In 1445, he fought in the First Battle of Olmedo against Alvaro de Luna who supported Henry IV. A year later in 1465, he participated in the so-called Farce of Ávila where a group of Castilian nobles symbolically executed an effigy of Henry IV and proclaimed his half brother, Alfonso of Castile, better known as "Alfonso the Innocent", to be the lawful king. The ceremony was called the "Farce of Avila" by contemporary critics and the name has thus passed into history. For his participation in the "Farce", he received the title of Constable of Castile.
After the death of Alfonso the Innocent in 1468, Rodrigo, being the constant rebel, supported the claim of princess Isabella who would later become Isabella I of Castile. He was present for the signing of the Treaty of the Bulls of Guisando which officially recognized Henry IV of Castile as the lawful king and his sister Isabella as the heir to the throne. However, this treaty also ousted Joanna la Beltraneja from the line of succession, a move that would later lay the foundation for the Castilian War of Succession.
In 1474, with the ascension to the throne of his patron, Isabella I of Castile, Rodrigo was named Grand Master of the Order of Santiago in the town of Uclés. The title of Grand Mastership over the order had been split into two halves that year after their predecessor, Juan Pacheco, the Marquis of Villena, renounced his title in favor of his son, Diego López de Pacheco y Portocarrero. This type of succession for the Grand Mastership of Santiago was incorrect as the title was traditionally one obtained by election and not by inheritance. This kicked off a power struggle amongst the nobles of the order and led to a confrontation between Rodrigo Manrique de Lara, and Don Alonso de Cárdenas. The result of this power struggle was a period of time in which the order had two different Grand Masters, one for Castile and one for Leon. King Ferdinand II of Aragon stepped into the argument and mediated this division which ended upon the death of Pedro Manrique two years later in 1476.
Marriage and Descendants
In 1431, Rodrigo Manrique married Mencía de Figueroa Laso de Vega, a member of the House of Lasso de la Vega and the House of Figueroa. She was the daughter of Gómez I Suárez de Figueroa and the granddaughter of Lorenzo I Suárez de Figueroa, a previous Grand Master of the Order of Santiago.
Pedro Manrique de Lara y Figueroa: Primary heir to his father's titles, Second Conde of Paredes de Nava, Señor of Villapalacios, Villaverde de Guadalimar, Bienservida, Riópar, Cotillas and San Vicente, Commander of Segura and one of the thirteen leading members of the Order of Santiago.
Rodrigo Manrique de Lara y Figueroa: Señor of Ibros, Commander of Yeste and Taibilla, One of the thirteen ruling members of the Order of Santiago, alcaide of Pucherna, Corregidor of the cities of Baza, Guadix, Almería, Purchena and Vera, Ambassador to Portugal, and Mayordomo Mayor of Queen Juana, whilst she was an infanta.
Diego Manrique de Lara y Figueroa: Died young.
Jorge Manrique de Lara y Figueroa: Señor of Belmontejo, Commander of Montizón and Chiclana, one of the thirteen ruling members of the Order of Santiago, Captain of the men at arms of the Guardia de Castilla, universal poet, and writer of the "Coplas a la muerte de su padre", about his father Rodrigo.
Fadrique Manrique de Lara y Figueroa: Captain of the men at arms of the Guardia de Castilla, Chief Justice of Úbeda.
Leonor Manrique de Lara y Figueroa: Señora of the villa of San Román.
Elvira Manrique de Lara y Figueroa: Señora of Frómista.
Death and legacy
Rodrigo Manrique died on November 11, 1476, in the town of Ocaña, Spain.
His epitaph reads "Here lies a man, who left his name alive". The Spanish reads as follows:
Aquí yace un hombre / que vivo dejó su nombre
Aside from his own prominent position in history, Rodrigo Manrique remains immortalized by the poem written by his son, Jorge Manrique de Lara, the "Coplas por la muerte de su padre".
In the 18th century, the Condado of Paredes de Nava was joined with many others under the House of Manrique de Lara including the Dukedom of Nájera and the Marquesado de Aguilar de Campóo.
See also
Order of Santiago
List of Grand Masters of the Order of Santiago
House of Lara
House of Manrique de Lara
House of Figueroa
References
Vilar y Pascual, Luis; Vilar Psayla, Juan José. Diccionario histórico, genealógico y heráldico de las familias ilustres de la monarquía española. Madrid: Sánchez, 1864, Vol. 7
1406 births
1476 deaths
15th-century Castilians
Grand Masters of the Order of Santiago
Counts of Spain
Knights of Santiago
Rodrigo |
Antonio's Revenge is a late Elizabethan play written by
John Marston and performed by the Children of Paul's. It is a sequel to Marston's comic play Antonio and Mellida, and it chronicles the conflict and violence between Piero Sforza, the Duke of Venice, and Antonio, who is determined to take revenge against Piero for the death of his father and the slander of his fiancée (Piero's daughter Mellida, to whom he is bethrothed at the end of Antonio and Mellida). While it has much in common with other revenge tragedies (particularly Shakespeare's Hamlet), it is sometimes read as a hyperbolic parody of the genre.
Characters
Ghost of ANDRUGIO, formerly Duke of Genoa
ANTONIO, Andrugio's son
MARIA, widow of Andrugio, mother of Antonio
LUCIO, a servant to Maria
NUTRICHE, a servant to Maria
PIERO SFORZA, duke of Venice
MELLIDA, Piero's daughter
JULIO, Piero's young son
STROTZO, a servant to Piero
PANDULPHO, a gentleman of the Venetian court
FELICHE, dead son of Pandulpho
BALURDO, a gentleman of the Venetian court
ALBERTO, a gentleman of the Venetian court
CASTILIO, a gentleman of the Venetian court
FOROBOSCO, a gentleman of the Venetian court
MATZAGENTE, son of the Duke of Milan
GALEATZO, son of the Duke of Florence
2 SENATORS
Pages, attendants, ladies, heralds, mourners, and others
Synopsis
Act I: Piero reveals that he has poisoned his former rival, Andrugio, after pretending to reconcile with him and betrothing his daughter Mellida to Andrugio's son Antonio. Maria, Andrugio's wife, returns to Venice to see her son's wedding solemnized. Antonio recounts a dream in which his father's ghost clamors for revenge. He and his mother are reunited moments before the body of Feliche is revealed in Mellida's window. Piero confesses to the murder, claiming to have caught Feliche and Mellida in bed together. Strotzo enters, announcing that Andrugio is dead. Antonio and Maria depart in grief, while Alberto and Pandulpho remain, the latter promising not to succumb to passion.
Act II: Piero gives orders for Mellida to be imprisoned in the castle vault, telling Pandulpho he means to execute her. He then attempts to persuade Pandulpho that Antontio is responsible for Andrugio's death and begs his assistance to bring him to justice. Pandulpho refuses. Antonio and Mellida converse through a vent, Antonio affirming his belief in her innocence when she informs him of her death sentence. Piero attempts to woo Maria but is rebuffed. He then hatches a plot with Strotzo, who agrees to testify that Antonio bribed him to slander Mellida and kill Andrugio. Piero promises to pardon him for his supposed crimes on account of the remorse he will feign.
Act III: Antonio visits his father's tomb and encounters Andrugio's ghost, who tells him that he was poisoned by Piero, whom Maria has consented to marry. At the ghost's urging, Antonio murders Piero's young son Julio. The ghost then appears to Maria, revealing the truth of his death to her. Antonio enters, still bloody from the murder of Julio. Andrugio's ghost bids him disguise himself and return to court until their revenge is complete.
Act IV: Antonio attends Mellida's trial disguised as a jester. Strotzo confesses, as he and Piero plotted, that he murdered Andrugio and framed Mellida on Antonio's orders; instead of the pardon Strotzo expects to receive, Piero strangles him with Castilio's assistance. Alberto, sent to summon Antonio, returns and announces that he has drowned. Mellida swoons and is carried out. Piero declares his intention to marry his daughter off to Galeatzo and to marry Maria himself. Maria returns from Mellida's bedside to inform the court that Mellida has died of grief. Piero postpones his own wedding by two days. Alberto and Antonio help to bury Feliche, and make a pact with Pandulpho to take revenge upon Piero.
Act V: The conspirators release Balurdo from imprisonment on the condition that he participate in their plot. Andrugio's ghost enters to observe Piero and Maria's wedding feast. Alberto, Antonio, Pandulpho, and Balurdo, disguised as masquers, overpower Piero, bind him, and pluck out his tongue. They reveal Julio's body, then stab Piero to death. Galeatzo enters with a pair of senators, who commend the murderers for their noble deed. The Dukedom of Venice is offered to Antonio, who refuses and vows to live a religious life and remain celibate in honor of Mellida's memory.
Date and Text
Usually dated 1600 or 1601, Antonio’s Revenge is one of a number of revenge tragedies written around the same time. Emma Smith has suggested that some of these plays may have been written partly in response to the popularity of The Spanish Tragedy and disputes over its performance rights. Antonio's Revenge was entered into the Stationer's Register in October 1601 by Matthew Lownes and Thomas Fisher, and it was printed in quarto the following year. Stage directions within the 1602 Quarto refer to two of the original actors by surname rather than character, which seems to indicate that—like Antonio and Mellida—the source for the printed text may have been a prompt book. In 1633 a collection of Marston's plays which included both Antonio’s Revenge and Antonio and Mellida was printed by William Sheares, who may have done so without Marston's permission, as there is no reference to Sheares having any rights to his plays in the Stationer's Register. Since then, the play has been reprinted only sporadically.
Relationship to Hamlet
There is some critical controversy over the date of Antonio’s Revenge in relation to Shakespeare's Hamlet. Two inscriptions that appear on a pair of portraits in Antonio and Mellida, which seem to indicate the date of the play's first performance (1599) and the age of the author (24), and the prologue to Antonio’s Revenge, which indicates a change of season—from summer to early winter—between the two productions, led E. K. Chambers to conclude, based on R. E. Brettle's evidence for Marston's birth in 1575, that Antonio’s Revenge could be dated to the early winter of 1599. However, more recent findings indicate that Marston was actually born in 1576, which would place Antonio’s Revenge after Hamlet. An abundance of highly similar plot devices—including Piero's murder of his romantic rival by poison and the appearance of Andrugio's ghost—has invited criticism of the play as being derivative. However, other critics have contended that Shakespeare and Marston were working at roughly the same time on competing revenge plays and may have both used the supposed Ur-Hamlet for their source material, making similarities probable. Because there are narrative parallels but few verbal ones, the likeness of the two plays may be coincidental.
Genre
As revenge tragedy
Antonio's Revenge is a notable example of the early modern revenge tragedy. The play critiques the failings of the legal system by demonstrating how easily it may be abused by powerful political figures. Marston also follows the generic tradition of forcing the revenger to compromise his own morality in the process of exacting revenge. Eric Hobsbawm characterizes this didactic paradox as "banditry," or the necessity of individual transgression in the face of unjust rule and the popular elevation of such individuals to the status of "folk hero." This moral quandary is further complicated by the religious ethics of the early modern period, including conflicting Protestant and Catholic ideas about the relationship between the living and the dead. Andrugio, like the ghosts of Shakespeare's Hamlet and Kyd's Spanish Tragedy, personifies the period of unrest between death and interment, sometimes interpreted as an allusion to Catholic purgatory. The play is also fraught with physical violence, including the display of Feliche's mutilated body, the strangulation of Strotzo, the murder of the child Julio and subsequent revelation of his body at the banquet table, and the forcible removal of Piero's tongue. Piero makes his first entrance with "his arms bare, smeared in blood, a poniard in one hand bloody, and a torch in the other" (1.1, s.d.) and Antonio enters in an almost identical manner after his murder of Julio, "his arms bloody, [with] a torch and poniard" (3.5, s.d.). This dramaturgical parallel is not only a visual representation of culpability but a means of foregrounding one of the other common themes of revenge tragedy, namely the inevitable mirroring of the villain and the tragic hero. At stake here is a physical manifestation of what Jonathan Dollimore describes as "discontinuous identity," or the plight of characters experiencing social and psychic dislocation as they struggle against an inherently corrupt society. The theme of disorientation is further complicated by extreme feelings of grief which lead to distraction and madness, another common feature of revenge tragedy, displayed in Antonio's Revenge both by Maria's running onstage with "her hair about her ears" (3.1, s.d.) and Pandulpho's inability to adhere to his stoic philosophy after his son's murder. Antonio's Revenge is typical of its genre in depicting the fatal consequences of socio-political and moral confusion. However, unlike most revenge tragedies, the revenger himself survives the play.
As parody
Though Antonio's Revenge is often criticized or compared unfavorably with Hamlet due to its hyperbolic style, some critics have posited that this is not an artistic failing on Marston's part but rather a deliberate mockery of the revenge tragedy genre. The play is metatheatrically self-aware, commencing with Piero's demand that Strotzo applaud his bloody deeds. The conceit continues with Strotzo's performance of guilt and grief before the court at Mellida's mock-trial, and with Antonio's various disguises—first as a fool, and then as a masquer in the company of Alberto, Pandulpho, and Balurdo. The language of the play is similarly self-conscious and possibly parodic, the stoic Pandulpho forswearing "apish action, player-like" (1.5.84) and Antonio promising that he "will not swell like a tragedian" (2.3.112) in response to grief, before both proceed to demonstrate exactly the fits of passion which they have renounced. The extravagantly violent spectacles of the final scene have been subjected to the severest criticism, but even this excess is possibly deliberate: Piero's death is almost a play-within-a-play, with Andrugio looking on like an audience, while the inherent theatricality of the masquers and the spectacle of the banquet table call attention to the performative nature of Piero's political power. The end is equally self-aware, with Antonio challenging any playwright who intends to write about Mellida to mount "some black tragedy" (5.6.65) on her behalf.
Performance
Antonio's Revenge was originally performed by the Children of Paul's, a popular boys' company of the time. While the playing space at St. Paul's was rather small (probably not more than 500 square feet were available for seating and performance, though the actual shape and dimensions are unknown), the play makes use of at least two separate entrances, a gallery, a trap large enough to be used as a grave, and a "discovery space" which was probably utilized to reveal, at various points in the play, Feliche's body, Andrugio's ghost, and the banquet table. Antonio's Revenge relies not only on these grim tableaux but also on extensive miming and several dumb shows. In addition to these visual devices, the play includes a number of songs and stage directions requiring music and other sound effects.
References
1600s plays
Plays by John Marston
English Renaissance plays
Revenge plays
Tragedy plays |
Rachi () is a rural locality (a station) in Urilsky Selsoviet of Arkharinsky District, Amur Oblast, Russia. The population was 1 as of 2018. There is 1 street.
Geography
The village is located on Trans-Siberian Railway, 40 km east from Arkhara and 10 km west from Uril.
References
Rural localities in Arkharinsky District |
François Nordmann (born 1942 in Fribourg) is a Swiss diplomat and a columnist who writes on foreign affairs.
Training
Nordmann studied law at the University of Fribourg and the Graduate Institute of International Studies in Geneva.
Career
From 1974 to 1980, Nordmann was an elected member of the Grand Council of Fribourg, the legislature of the canton of Fribourg, in Switzerland.
He then joined the Swiss Department of Foreign Affairs and in 1984 he was made ambassador to Guatemala, Costa Rica, Honduras, Nicaragua, Salvador et Panama. In 1987, he became head of the Swiss delegation to UNESCO. He then headed the International Organizations Directorate of the Swiss Department of Foreign Affairs. Starting in 1994, he became the Swiss ambassador to Great Britain. In 2000, he became the permanent representative of Switzerland to the United Nations in Geneva. He fought for the maintenance of the GATT (now the World Trade Organization) in Geneva. He was the Swiss ambassador to France from 2003 to 2007. There, he collaborated with the French authorities to hold the G8 summit in Evian.
After his diplomatic career, Nordmann was president of the Fribourg International Film Festival from 2016 to 2018. He held that position until 2018.
In 2022, he started writing a regular column on foreign affairs for French-language newspaper Le Temps. Nordmann is regularly quoted in Swiss news media for his analysis of foreign affairs.
Recognition
In 2021, the University of Fribourg awarded him an honorary doctorate.
References
Graduate Institute of International and Development Studies alumni
Living people
1942 births |
Tenderness may refer to:
Films
Tenderness (2009 film), a 2009 American crime film
Tenderness (2017 film), a 2017 Italian film also known as La tenerezza
Medicine
Rebound tenderness, a clinical sign that a doctor may detect in physical examination of a patient's abdomen
Tenderness (medicine), pain or discomfort when an affected area is touched
Music
Songs
"Tenderness" (song), a song by General Public from their 1984 album All the Rage
"Tenderness", a song by Steppenwolf from the 1971 album For Ladies Only
"Tenderness", a song by Paul Simon from the 1973 album There Goes Rhymin' Simon
"Tenderness", a song by Diana Ross from the 1980 album diana
"Tenderness", a song by Laura Branigan from the 1985 album Hold Me
"Tenderness", a song by Janis Ian from the 1995 album Revenge
Albums
Tenderness (Blue Hawaii album), 2017
Tenderness (Walt Dickerson and Richard Davis album), 1985
Tenderness (Kip Hanrahan album), 1990
Tenderness (Al Jarreau album), 1994
Tenderness (Duff McKagan album), 2019
Tenderness (J. D. Souther album), 2015
Tenderness, a 1981 album by the Ohio Players
Tenderness, a 1998 album by Kristine
Other uses
Hardiness (plants) (in)ability to withstand freezing temperatures
Meat tenderness, a gauge of meat palatability
Tenderness (novel), by Robert Cormier
Tenderness (sculpture), a marble sculpture by Canadian Paul Lancz
See also
Tender (disambiguation)
Term of endearment
Affection
Care (disambiguation)
Kindness
Love |
```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, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package org.apache.beam.sdk.nexmark.model;
import com.fasterxml.jackson.annotation.JsonProperty;
import com.fasterxml.jackson.core.JsonProcessingException;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.Serializable;
import org.apache.beam.sdk.coders.Coder;
import org.apache.beam.sdk.coders.CoderException;
import org.apache.beam.sdk.coders.CustomCoder;
import org.apache.beam.sdk.coders.StringUtf8Coder;
import org.apache.beam.sdk.nexmark.NexmarkUtils;
import org.apache.beam.vendor.guava.v32_1_2_jre.com.google.common.base.Objects;
import org.checkerframework.checker.nullness.qual.Nullable;
/** Result of query 10. */
@SuppressWarnings({
"nullness" // TODO(path_to_url
})
public class Done implements KnownSize, Serializable {
private static final Coder<String> STRING_CODER = StringUtf8Coder.of();
public static final Coder<Done> CODER =
new CustomCoder<Done>() {
@Override
public void encode(Done value, OutputStream outStream) throws CoderException, IOException {
STRING_CODER.encode(value.message, outStream);
}
@Override
public Done decode(InputStream inStream) throws CoderException, IOException {
String message = STRING_CODER.decode(inStream);
return new Done(message);
}
@Override
public void verifyDeterministic() throws NonDeterministicException {}
@Override
public Object structuralValue(Done v) {
return v;
}
};
@JsonProperty private final String message;
// For Avro only.
@SuppressWarnings("unused")
public Done() {
message = null;
}
public Done(String message) {
this.message = message;
}
@Override
public long sizeInBytes() {
return message.length();
}
@Override
public String toString() {
try {
return NexmarkUtils.MAPPER.writeValueAsString(this);
} catch (JsonProcessingException e) {
throw new RuntimeException(e);
}
}
@Override
public boolean equals(@Nullable Object o) {
if (this == o) {
return true;
}
if (o == null || getClass() != o.getClass()) {
return false;
}
Done done = (Done) o;
return Objects.equal(message, done.message);
}
@Override
public int hashCode() {
return Objects.hashCode(message);
}
}
``` |
The Tribune of Galileo () is a Neoclassic architectural addition, built to commemorate the famous Florentine scientist, Galileo Galilei and to house some of his scientific instruments.
Description
The tribune was completed in 1841 and built within the first floor of the Science Museum of La Specola in Florence. The tribune was built by orders of Leopold II (1797-1870). The House of Lorraine-Habsburg was foreign to Tuscany; and the embrace of Galileo can be seen as an attempt to co-opt local patriotism. It contains a large statue of Galileo and a series of lunettes and frescoes depicting events in scientific history relating to Florence. It once contained some of his original instruments such as his geometric and military compass, an armed loadstone, two telescopes, and the objective lens of the telescope with which Galileo discovered the four largest moons of Jupiter. The tribune is generally not open to the public.
The tribune consists mainly of two rooms: a square vaulted hall, and an adjacent square room glass-metal dome. The dome allows light to shine over a marble statue of Galileo by Aristodemo Costoli. The surrounding niches have busts of famous pupils of Galileo: Benedetto Castelli, Bonaventura Cavalieri, Evangelista Torricelli, and Vincenzo Viviani. Medallions in the adjacent hall commemorate the patrons. The frescoes on the walls depict:
Leonardo da Vinci before the Duke of Milan, Ludovico Sforza (by Nicola Cianfanelli)
Galileo demonstrates the Laws of Gravity to the Medici (by Giuseppe Bezzuoli)
Galileo observes the lamp-pendulum of the Duomo of Pisa (by Luigi Sabatelli)
Galileo presents the telescope to the Senate of Venice (by Luigi Sabatelli)
Galileo, blind and old, converses with disciples (by Luigi Sabatelli)
Session of Experiments at the Accademia del Cimento (by Gasparo Martellini)
Alessandro Volta demonstrates his experimental battery to Napoleon (design by Cianfanelli, completed by Martellini).
Ultimately, this is an odd architectural assembly. The layout has a distant resemblance to a church dome and nave; however, if so, this is a temple granting hagiographical attention to a secular scientist. It contains modern touches, such as the iron dome, but it also adheres to retardataire Neoclassic elements in the niches, arches, and columns. The arrangement suggests a tardy apology to Galileo by an aristocracy which had been slow to freely embrace his pioneering spirit of Enlightenment. It took two centuries for Florentines to honor their greatest scientist with a building. But that is not surprising, they had also been slow to bury Galileo inside a church. After his death in 1642, his interment in the main body of the Basilica of Santa Croce, next to the tombs of his father and other ancestors, was abandoned when papal authorities protested.
Gallery
References
External links
Neoclassical architecture in Florence
Infrastructure completed in 1841
Museums in Florence
Science museums in Italy
Museo di Storia Naturale di Firenze
Cultural depictions of Galileo Galilei
Monuments and memorials in Florence
pt:Palazzo Torrigiani (Via Romana)#A Tribuna de Galileu |
John Trailly (died 18 June 1400), Lord of Furnells and Yeldon, Seneschal of Gascony, Mayor of Bordeaux, was an English soldier and diplomat.
Life
Trailly was the eldest son of John Trailly (died 1360) and Elizabeth. John was involved in the French campaigns of Kings Richard II and Henry IV of England during the Hundred Years' War. He was member of Parliament for Bedfordshire in 1377 and 1381. He was a member of Thomas of Woodstock, Earl of Buckingham's retinue in 1377 and went with John of Gaunt, Duke of Lancaster to Spain in 1386. John was Seneschal of Gascony between 1389 and 1390 and in 1397 and was Mayor of Bordeaux between 1389 and 1400.
Marriage and issue
John married Joan, daughter of Thomas Aylesbury and Joan Basset, they had the following known issue:
Reynold Trailly (died 1401), without issue.
Citations
References
Year of birth unknown
1400 deaths
14th-century English people
15th-century English people
Medieval English knights
Seneschals of Gascony |
Ski jumping at the 1996 Asian Winter Games took place in the city of Harbin, China with only two events being contested — both of them men's events. Both events were only for demonstration; the medals gained here did not officially count towards the final medal tally.
Medalists
Medal table
References
External links
FIS official website
1996 Asian Winter Games events
1996
Asian Winter Games |
```yaml
version: '3.8'
networks:
web:
services:
nginx:
image: nginx
ports:
- 80:80
networks:
- web
``` |
Davidson County is a county located in the U.S. state of North Carolina. As of the 2020 census, the population was 168,930. Its county seat is Lexington, and its largest community is Thomasville.
Davidson County is included in the Winston-Salem, NC Metropolitan Statistical Area, which is also included in the Greensboro–Winston-Salem–High Point, NC Combined Statistical Area.
Parts of Davidson County are in the Yadkin Valley AVA.
History
The original North Carolina county of this name was created in 1786 what was then the far western portion of North Carolina, with its county seat at Nashville and a territory covering most of what is now Middle Tennessee. When Tennessee was established as a separate state in 1796, this county became Davidson County, Tennessee.
The current North Carolina county was formed in 1822 from Rowan County. It was named after Brigadier General William Lee Davidson, an American Revolutionary War general killed at the Battle of Cowan's Ford on the Catawba River in 1781.
In 1911, a new county called Piedmont County was proposed, with High Point as its county seat, to be created from Guilford, Davidson and Randolph Counties. Many people appeared at the Guilford County courthouse to oppose the plan, vowing to go to the state legislature to protest. The state legislature voted down the plan in February 1911.
Geography
According to the U.S. Census Bureau, the county has a total area of , of which is land and (2.56%) is water.
Davidson County is located entirely within the Piedmont region of central North Carolina. The Piedmont consists of gently rolling terrain frequently broken by hills or shallow valleys formed by rivers and streams. An exception to this terrain are the Uwharrie Mountains in the county's western and southwestern sections. The Uwharries are the oldest mountain range in North America, and at one time they rose to nearly above sea level. However, time has worn them down to little more than high hills; yet due to the relative flatness of the surrounding countryside they still rise from 250 to above their base. The highest point in the Uwharries - and the highest point in Davidson County - is High Rock Mountain in the county's southwestern corner. It has an elevation of above sea level.
National protected area
Uwharrie National Forest (part)
State and local protected areas
Boone's Cave Park
Lake Thom-A-Lex Park
Uwharrie Game Land (part)
Yadkin River Game Land (part)
Major water bodies
Abbotts Creek
Badin Lake
High Rock Lake
Lake Thom-A-Lex
South Potts Creek
Tuckertown Reservoir
Yadkin River
Adjacent counties
Forsyth County – north
Guilford County – northeast
Randolph County – east
Montgomery County – south
Stanly County – southwest
Rowan County – southwest
Davie County – west
Major highways
Major infrastructure
Davidson County Airport
Lexington Station
Demographics
2020 census
As of the 2020 census, there were 168,930 people, 69,938 households, and 49,037 families residing in the county.
2010 census
At the 2010 census, there were 149,331 people, 58,156 households, and 42,512 families residing in the county. The population density was . There were 62,432 housing units at an average density of . The racial makeup of the county was 84.05% White, 11.14% Black or African American, 0.37% Native American, 0.82% Asian, 0.01% Pacific Islander, 1.66% from other races, and 0.94% from two or more races. 3.24% of the population were Hispanic or Latino of any race.
There were 58,156 households, out of which 32.70% had children under the age of 18 living with them, 58.00% were married couples living together, 10.80% had a female householder with no husband present, and 26.90% were non-families. 22.90% of all households were made up of individuals, and 8.80% had someone living alone who was 65 years of age or older. The average household size was 2.50 and the average family size was 2.92.
In the county, the population was spread out, with 24.30% under the age of 18, 7.60% from 18 to 24, 31.20% from 25 to 44, 24.10% from 45 to 64, and 12.80% who were 65 years of age or older. The median age was 37 years. For every 100 females there were 96.00 males. For every 100 females age 18 and over, there were 93.70 males.
The median income for a household in the county was $38,640, and the median income for a family was $46,241. Males had a median income of $31,287 versus $23,622 for females. The per capita income for the county was $18,703. About 7.00% of families and 10.10% of the population were below the poverty line, including 13.30% of people under age 18 and 12.10% of those age 65 or over.
Government and politics
Davidson County was one of the first areas of North Carolina to turn Republican, doing so long before other areas of conservative white voters shifted away from the Democrats. No Democratic presidential nominee has carried the county since Franklin D. Roosevelt defeated Thomas E. Dewey by a mere ten votes out of almost 19,000 in 1944. It was one of only 13 counties out of 100 in the state to vote for Barry Goldwater over Lyndon Johnson in 1964, and the last Democrat to garner even one-third of the county's vote was Jimmy Carter in 1980.
Davidson County is a member of the regional Piedmont Triad Council of Governments.
Davidson County gained national attention when Gerald Hege, Sheriff from 1994 to 2003, became a minor celebrity for his unconventional prisoner treatment methods.
Education
Davidson County is served by Davidson County Schools; however, the cities of Thomasville and Lexington have their own school districts. Davidson County Schools is one of the county's largest employers.
Davidson County is also served by Davidson-Davie Community College, a comprehensive community college that is a member school of the North Carolina Community College System. Davidson-Davie Community College was chartered in 1958 as an Industrial Education Center designed to provide adults with the education and skills needed to move from an agricultural to a manufacturing-based economy.
In 1965, the institution was chartered as Davidson County Community College. The Associate in Arts and Associate in Science degrees were added to the existing Associate in Applied Science degree, Diploma, and Certificate programs. University transfer courses were added in 1966. In 1997, the college participated in the Comprehensive Articulation Agreement (CAA) that allows college transfer students to move easily to the 16 UNC schools, as well as many independent college and universities. Presently the Davidson Campus has grown to 11 buildings and two emergency services training facilities on approximately .
Attractions
Festivals
One of the county's most famous attractions is the yearly Lexington Barbecue Festival, held in the city of Lexington during the month of October, bringing in over 100,000 visitors from all over the southeastern U.S. There is also a yearly Davidson County Agriculture Fair held in September. Thomasville hosts an annual "Everybody's Day Festival", the longest running festival in the state. The "Southeastern Old Threshers Reunion" is held every year at the Denton Farmpark.
Landmarks
There are many year-long attractions in Davidson County. Some of which include Historic Uptown Lexington, which consists of the Davidson County Historical Museum located in the old courthouse. Alongside the Yadkin River sits Boone's Cave Park where according to legend, a young Daniel Boone and his family once lived. Other attractions include Denton Farm Park, Walter Johnson Camp and Conference Center, and the North Carolina Vietnam Veterans Memorial. The historic Wil-Cox Bridge spanning the Yadkin River has been preserved for pedestrian traffic and is now part of the Yadkin River Park. The Big Chair in Thomasville is also a major landmark.
Art
Pigs in the City is an art initiative held each summer in Lexington, and attracts tens of thousands of visitors.
In 2005, Davidson County Community College and the City of Thomasville formed a partnership for the creation of the Thomasville Artisan Center. This art studio allowed the college to reinvigorate its Associate in Fine Arts Degree and offer both university transfer classes as well as adult community interest classes in painting, drawing, and sculpting. The Artisan Center is part of the college's Thomasville Education Center complex which is part of the college's outreach to the community. The college has a second campus in Davie County in the city of Mocksville, as well as the Uptown Lexington Education Center, located within a few blocks of the Arts Center of Davidson County and the historic Court House.
Barbecue
One of the two major styles of North Carolina barbecue originated in Lexington, the county seat and home to the annual Lexington Barbecue Festival. Therefore, many Lexington-style barbecue restaurants are found throughout the county. Some include Lexington BBQ ("Honeymonk's"), The BBQ Center, Jimmy's (closed and torn down in 2016), Whitley's BBQ Restaurant, Smokey Joe's, Backcountry, Speedy's, Smiley's, Tarheel Q, Stamey's, Kerley's, Rick's BBQ, and Cook's.
Richard Childress
Davidson County is home to many supporting race fans and the famous Richard Childress. It includes his personal Childress Vineyards and Richard Childress Racing Museum.
The Big Chair
Davidson County is also known for its oversized chair, "The Big Chair." This chair is located in central Thomasville and is a symbol of Davidson County's furniture industry.
High Rock Lake
High Rock Lake is the northernmost of the Uwharrie Lakes and the second largest lake in North Carolina behind Lake Norman. Its water surface covers and there are of shoreline. It begins at the confluence of the Yadkin River and the South Yadkin River. It has been the host of the Bassmaster Classic in 1994, 1995 and 1998. and is the site of frequent other local angling competitions. Lexington is just north of the Abbotts Creek section of the lake.
Communities
Cities
High Point (part)
Lexington (county seat)
Thomasville (largest community)
Towns
Denton
Midway
Wallburg
Townships
Abbotts Creek
Alleghany
Arcadia
Boone
Conrad Hill
Cotton Grove
Emmons
Hampton
Healing Spring
Jackson Hill
Lexington
Midway
Reedy Creek
Silver Hill
Thomasville
Tyro
Yadkin College
Census-designated places
Southmont
Tyro
Welcome
Yadkin College
Unincorporated communities
Arcadia
Churchland
Gordontown
Holly Grove
Reeds
Silver Hill
Silver Valley
Notable people
Nia Franklin, Miss America 2019
Wilmer "Vinegar Bend" Mizell, Professional Baseball player for the Pirates and Cardinals, and a Congressman who served three terms. (1930–1999)
Max Lanier and son Hal Lanier, both Major League Baseball players are from Denton.
Eddie Mathews, Hall of Fame baseball player, played for Thomasville in 1949 before going
Perry Tuttle, Former NFL & CFL wide receiver.
Shy Tuttle, Defensive tackle for the New Orleans Saints
See also
List of counties in North Carolina
National Register of Historic Places listings in Davidson County, North Carolina
References
External links
1822 establishments in North Carolina
Populated places established in 1822 |
Haryana Staff Selection Commission (HSSC) (Earlier Subordinate Services Selection Board) is an organisation under Government of Haryana to recruit staff for various posts of Group B, C, D in the various Departments of the Government of Haryana and in the subordinate offices.
HSSC was established on 28 January 1970 in Haryana.
The Organization recruits the candidates to fill the posts under State Police, Town Improvement, Trust, Zila Parishad or Panchayat Samiti, Municipality, Municipal Corporation and under State Govt. Local bodies or Cooperative Institutions.
The Secretary of Haryana Staff Selection Commission changes from August 2022
Now HCS officer Sh. Virat is new secretary of HSSC and Sh. Daljit Singh is new Controller of Exams.
References
External links
Official website
State agencies of Haryana
State public service commissions of India
1970 establishments in Haryana
Government agencies established in 1970 |
```css
.myClass {
display: block;
}
``` |
Willy Geertje van Ammelrooij (born 5 April 1944), known as Willeke van Ammelrooy, is a Dutch actress.
Life and career
Willeke van Ammelrooy was born in Amsterdam, where she also attended drama school.
Van Ammelrooy has acted on stage as well as in films. She participated in 27 movies. Her first film was Mira in 1971.
Success with Antonia's Line
She later starred in the award-winning feminist film Antonia's Line, which tells the story of an independent woman who, after returning to the anonymous Dutch village of her birth, establishes and nurtures a close-knit matriarchal community.
She received positive reviews and the Golden Calf for Best Actress for her performance and the film enjoyed critical success, including the Academy Award for Best Foreign Language Film at the 68th Academy Awards. Emanuel Levy, writing for The Advocate, wrote "It's easy to see why" the film was winning awards in festivals, calling it "an enchanting fairy tale that maintains a consistently warm, lighthearted feel," and Willeke van Ammelrooy wonderful. Janet Maslin of The New York Times called it "a work of magical feminism." The film also screened at the Toronto International Film Festival, where it won the People's Choice Award.
According to Box Office Mojo, the film completed its run grossing $4,228,275 in North America, 1,660,901 admissions in the European Union, and $21,046 in South Korea.
Other work
In 2017, van Ammelrooy was announced as a member of the film jury for ShortCutz Amsterdam, an annual film festival promoting short films in Amsterdam.
Personal life
Van Ammelrooy is married to the Dutch opera singer .
Filmography
Film
Mira (1971)Mira
(1972)Louisa
The Burglar (1972)Fanny
The Killer Is on the Phone (1972)Dorothy
Frank en Eva (1973)Eva
(1974)Laura
Help! The Doctor Is Drowning (1974)Katja
(1974)Alicia
Mijn nachten met Susan, Olga, Julie, Piet en Sandra (1975)Susan
L'amour aux trousses (1975)Laurence
Het Jaar van de Kreeft (1975)Toni
Wan Pipel (1976)Karina
De Mantel der Liefde (1978)Maria
Grijpstra & De Gier (1979)Constanze
(1981)Martha
On Top of the Whale (1982)Eva
De Lift (1983)Mieke
(1983)Leonie
Ciske de Rat (1984)Marie
Andre Handles Them All (1985)Charlie
(1986)Mathilde
Koko Flanel (1990)Germaine
Antonia's Line (1995)Antonia
Lijmen/Het Been (2001)Mrs. Lauwereyssen
De Schippers van de Kameleon (2003)Mevrouw
(2004)Clara
The Lake House (2006)Mrs. Forster
Bride Flight (2008)Old Esther Cahn
The Hell of '63 (2009)Moeder Will
Life Is Wonderful (2018)Rosa
Television
(2004–2005)
References
External links
1944 births
Living people
Dutch expatriates in the United States
Dutch film actresses
Dutch television actresses
Actresses from Amsterdam
Golden Calf winners
20th-century Dutch actresses
21st-century Dutch actresses |
```php
<?php
use PhpOffice\PhpSpreadsheet\IOFactory;
use PhpOffice\PhpSpreadsheet\Writer\Xlsx;
require __DIR__ . '/../Header.php';
// Create temporary file that will be read
$sampleSpreadsheet = require __DIR__ . '/../templates/sampleSpreadsheet.php';
$filename = $helper->getTemporaryFilename();
$writer = new Xlsx($sampleSpreadsheet);
$writer->save($filename);
$callStartTime = microtime(true);
$spreadsheet = IOFactory::load($filename);
$helper->logRead('Xlsx', $filename, $callStartTime);
// Save
$helper->write($spreadsheet, __FILE__);
unlink($filename);
``` |
Essex is a county in the East of England which originated as the ancient Kingdom of Essex and one of the seven kingdoms, or heptarchy, that went on to form the Kingdom of England.
Origins
The name Essex derives from the Kingdom of the East Seaxe or Kingdom of Essex which was traditionally founded by Aescwine in AD 527, occupying territory to the north of the River Thames and east of the River Lea.
In AD 825 it became part of the Kingdom of Wessex and was later ceded under the Treaty of Wedmore to the Danelaw under the Kingdom of East Anglia. In AD 991 the Battle of Maldon resulted in complete defeat of the Anglo-Saxons by the Vikings, and is commemorated in the poem The Battle of Maldon.
Hundreds
The county was divided into the hundreds of:
Barstable
Becontree
Chafford
Chelmsford
Clavering
Dengie
Dunmow
Freshwell
Harlow
Havering Liberty
Hinkford
Lexden
Ongar
Rochford
Tendring
Thurstable
Uttlesford
Waltham
Winstree
Witham
Pre-Roman
The area which Essex now occupies was ruled before Roman settlement by the Celtic Trinovantes tribe. A dispute between them and the Catuvellauni was used as an excuse for a Roman invasion in 54 BC, and they allied with Rome when Claudius returned in AD 43. This led to Camulodunum (Colchester) becoming the capital of Roman Britain. The Trinovantes later fought with the Iceni tribe against Roman rule.
The coast and river estuaries of Iron Age Essex were home to many Red hill sites for evaporating sea water to obtain salt, many of which are still visible in the coastal landscape.
Norman Essex
Following the Norman conquest the Saxon kingdom formed the basis of a county in 1139 under the first Earl of Essex, Geoffrey de Mandeville. As a county Essex had administrative, political and legal functions.
Victorian era
Much of the development of the county was caused by the railway. By 1843 the Eastern Counties Railway had connected Bishopsgate station in London with Brentwood and Colchester. In 1856, they opened a branch to Loughton (later extended to Ongar) and by 1884 the London, Tilbury and Southend Railway had connected Fenchurch Street railway station in the City of London to Grays, Tilbury, Southend-on-Sea and Shoeburyness. Some of the railways were built primarily to transport goods but some (e.g. the Loughton branch) were to cater for commuter traffic; they unintentionally created the holiday resorts of Southend, Clacton and Frinton-on-Sea.
County councils were created in England in 1889. Essex County Council was based in Chelmsford, although it met in London until 1938. Its control did not cover the entire county. The London suburb of West Ham and later East Ham and the resort of Southend-on-Sea became county boroughs independent of county council control.
Districts in 1894
Post war
Much of Essex is protected from development near to its boundary with Greater London and forms part of the Metropolitan Green Belt. In 1949 the new towns of Harlow and Basildon were created. These developments were intended to address the chronic housing shortage in London but were not intended to become dormitory towns, rather it was hoped the towns would form an economy independent of the capital. The railway station at Basildon, with a direct connection to the City, was not opened until 1974 after pressure from residents.
The proximity of London and its economic magnetism has caused many places in Essex to become desirable places for workers in the City of London to live. As London grew in the east places such as Barking and Romford were given greater autonomy and created as municipal boroughs.
Finally in 1965 under the London Government Act 1963 the County Borough of West Ham and the County Borough of East Ham were abolished and their area transferred to Greater London to form the London Borough of Newham.
Also at this time the Municipal Borough of Ilford and the Municipal Borough of Wanstead and Woodford were abolished and their area, plus part of the area of Chigwell Urban District (but not including Chigwell itself), were transferred to Greater London to form the London Borough of Redbridge. The Municipal Borough of Romford and Hornchurch Urban District were abolished and their area transferred to Greater London to form the London Borough of Havering.
The Municipal Borough of Leyton, the Municipal Borough of Chingford and the Municipal Borough of Walthamstow were abolished and their area transferred to Greater London to form the London Borough of Waltham Forest. The Municipal Borough of Barking and the Municipal Borough of Dagenham were abolished and their area transferred to Greater London to form the London Borough of Barking and Dagenham.
Recent history
Essex became part of the East of England Government Office Region in 1994 and was statistically counted as part of that region from 1999, having previously been part of the South East England region.
In 1998 the boroughs of Thurrock and Southend-on-Sea were given unitary authority status and ceased to be under county council control. They remain part of the ceremonial county.
Historical buildings
The importance of the Anglo-Saxon culture in Essex was only emphasized by the rich burial discovered at Prittlewell recently. But the important Anglo-Saxon remains in Essex are mostly churches. St.Peter's straddles the wall of a Roman seafort at Bradwell (Othona), and is one of the early Anglo-Saxon, "Kentish" series of churches made famous by its documentation by Bede. Later Anglo-Saxon work may be seen in an important church tower at Holy Trinity, Colchester, an intact church at Hadstock, and elsewhere. At Greensted the walls of the nave are made of halved logs; although still the oldest church timber known in England, it is now thought to be early Norman.
Being a relatively stone-less County, it is unsurprising that some of the earliest examples of the mediaeval revival of brick-making can be found in Essex; Layer Marney Tower, Ingatestone Hall, and numerous parish churches exhibit the brickmakers' and bricklayers' skills in Essex. A two-volume typology of bricks, based entirely on Essex examples, has been published. Similarly, spectacular early-mediaeval timber construction is to be found in Essex, with perhaps the two Templars' barns at Cressing Temple being pre-eminent in the whole of England. There is a complete
tree-ring dating series for Essex timber, much due to the work of Dr. Tyers at the University of Sheffield.
Mediaeval "gothic" architecture in timber, brick, rubble, and stone is to be found all over Essex. These range from the large churches at Chelmsford, Saffron Walden and Thaxted, to the little gem at Tilty. The ruined abbeys, however, such as the two in Colchester and that at Barking, are disappointing in comparison to those that can be found in other counties; Waltham is the exception.
While the truncated remnant of Waltham Abbey was considered as a potential cathedral, elevation of the large parish church at Chelmsford was eventually preferred because of its location at the centre of the new diocese of Essex c.1908. Waltham Abbey remains the County's most impressive piece of mediaeval architecture.
Quite apart from important towns like Colchester or Chelmsford, many smaller places in Essex exhibit continuity from ancient times. Perhaps the most amusing is the Anglo-Saxon church at Rivenhall, just north of Witham. A nearby, ruined Roman villa probably served as a source for its building materials, and the age of this church was underestimated by Pevsner by about a thousand years.
The villages of Wanstead and Woodford saw the French family setting up a brick making works adjacent to the road from Chelmsford to London, now known as Chigwell Road. This industry closed in 1952.
References
Further reading
Pevsner (the "Buildings of England" series, Penguin) is the best general introduction to the County's architecture. In the new editions, 'London over the border' will now appear with London: East, instead of with the rest of the County, as formerly.
Hidden Heritage – Discovering Ancient Essex, by Terry Johnson
by Terry Johnson
Whilst major sites such as Stonehenge and Avebury are well known, few people realise how rich in ancient sites are other areas of Britain. Terry first examines features of the landscape and unusual church carvings in general, then gives a detailed listing of interesting sites in Essex with associated legends and folklore, in addition to examining possible leys.
Essex |
Opogona fumiceps is a moth of the family Tineidae first described by Felder in 1875. It is found in Sri Lanka and India.
References
Moths of Asia
Moths described in 1875
Tineidae
Hieroxestinae |
```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 utils
import (
"context"
"net"
"net/http"
"os"
"path/filepath"
"strconv"
"strings"
"sync"
"time"
"github.com/gin-gonic/gin"
"github.com/pingcap/kvproto/pkg/diagnosticspb"
"github.com/pingcap/log"
"github.com/prometheus/client_golang/prometheus"
"github.com/prometheus/client_golang/prometheus/promhttp"
"github.com/soheilhy/cmux"
"github.com/tikv/pd/pkg/errs"
"github.com/tikv/pd/pkg/mcs/discovery"
"github.com/tikv/pd/pkg/mcs/utils/constant"
"github.com/tikv/pd/pkg/utils/apiutil"
"github.com/tikv/pd/pkg/utils/apiutil/multiservicesapi"
"github.com/tikv/pd/pkg/utils/etcdutil"
"github.com/tikv/pd/pkg/utils/grpcutil"
"github.com/tikv/pd/pkg/utils/logutil"
"github.com/tikv/pd/pkg/versioninfo"
etcdtypes "go.etcd.io/etcd/client/pkg/v3/types"
clientv3 "go.etcd.io/etcd/client/v3"
"go.uber.org/zap"
"google.golang.org/grpc"
"google.golang.org/grpc/keepalive"
)
// InitClusterID initializes the cluster ID.
func InitClusterID(ctx context.Context, client *clientv3.Client) (id uint64, err error) {
ticker := time.NewTicker(constant.RetryInterval)
defer ticker.Stop()
retryTimes := 0
for {
if clusterID, err := etcdutil.GetClusterID(client, constant.ClusterIDPath); err == nil && clusterID != 0 {
return clusterID, nil
}
select {
case <-ctx.Done():
return 0, err
case <-ticker.C:
retryTimes++
if retryTimes/500 > 0 {
log.Warn("etcd is not ready, retrying", errs.ZapError(err))
retryTimes /= 500
}
}
}
}
// PromHandler is a handler to get prometheus metrics.
func PromHandler() gin.HandlerFunc {
return func(c *gin.Context) {
// register promhttp.HandlerOpts DisableCompression
promhttp.InstrumentMetricHandler(prometheus.DefaultRegisterer, promhttp.HandlerFor(prometheus.DefaultGatherer, promhttp.HandlerOpts{
DisableCompression: true,
})).ServeHTTP(c.Writer, c.Request)
}
}
// StatusHandler is a handler to get status info.
func StatusHandler(c *gin.Context) {
svr := c.MustGet(multiservicesapi.ServiceContextKey).(server)
version := versioninfo.Status{
BuildTS: versioninfo.PDBuildTS,
GitHash: versioninfo.PDGitHash,
Version: versioninfo.PDReleaseVersion,
StartTimestamp: svr.StartTimestamp(),
}
c.IndentedJSON(http.StatusOK, version)
}
type server interface {
GetAdvertiseListenAddr() string
GetBackendEndpoints() string
Context() context.Context
GetTLSConfig() *grpcutil.TLSConfig
GetClientConns() *sync.Map
GetDelegateClient(ctx context.Context, tlsCfg *grpcutil.TLSConfig, forwardedHost string) (*grpc.ClientConn, error)
ServerLoopWgDone()
ServerLoopWgAdd(int)
IsClosed() bool
GetHTTPServer() *http.Server
GetGRPCServer() *grpc.Server
SetGRPCServer(*grpc.Server)
SetHTTPServer(*http.Server)
GetEtcdClient() *clientv3.Client
SetEtcdClient(*clientv3.Client)
SetHTTPClient(*http.Client)
IsSecure() bool
RegisterGRPCService(*grpc.Server)
SetUpRestHandler() (http.Handler, apiutil.APIServiceGroup)
diagnosticspb.DiagnosticsServer
StartTimestamp() int64
Name() string
}
// InitClient initializes the etcd and http clients.
func InitClient(s server) error {
tlsConfig, err := s.GetTLSConfig().ToTLSConfig()
if err != nil {
return err
}
backendUrls, err := etcdtypes.NewURLs(strings.Split(s.GetBackendEndpoints(), ","))
if err != nil {
return err
}
etcdClient, err := etcdutil.CreateEtcdClient(tlsConfig, backendUrls, "mcs-etcd-client")
if err != nil {
return err
}
s.SetEtcdClient(etcdClient)
s.SetHTTPClient(etcdutil.CreateHTTPClient(tlsConfig))
return nil
}
func startGRPCServer(s server, l net.Listener) {
defer logutil.LogPanic()
defer s.ServerLoopWgDone()
log.Info("grpc server starts serving", zap.String("address", l.Addr().String()))
err := s.GetGRPCServer().Serve(l)
if s.IsClosed() {
log.Info("grpc server stopped")
} else {
log.Fatal("grpc server stopped unexpectedly", errs.ZapError(err))
}
}
func startHTTPServer(s server, l net.Listener) {
defer logutil.LogPanic()
defer s.ServerLoopWgDone()
log.Info("http server starts serving", zap.String("address", l.Addr().String()))
err := s.GetHTTPServer().Serve(l)
if s.IsClosed() {
log.Info("http server stopped")
} else {
log.Fatal("http server stopped unexpectedly", errs.ZapError(err))
}
}
// StartGRPCAndHTTPServers starts the grpc and http servers.
func StartGRPCAndHTTPServers(s server, serverReadyChan chan<- struct{}, l net.Listener) {
defer logutil.LogPanic()
defer s.ServerLoopWgDone()
mux := cmux.New(l)
// Don't hang on matcher after closing listener
mux.SetReadTimeout(3 * time.Second)
grpcL := mux.MatchWithWriters(cmux.HTTP2MatchHeaderFieldSendSettings("content-type", "application/grpc"))
var httpListener net.Listener
if s.IsSecure() {
httpListener = mux.Match(cmux.Any())
} else {
httpListener = mux.Match(cmux.HTTP1())
}
grpcServer := grpc.NewServer(
// Allow clients send consecutive pings in every 5 seconds.
// The default value of MinTime is 5 minutes,
// which is too long compared with 10 seconds of TiKV's pd client keepalive time.
grpc.KeepaliveEnforcementPolicy(keepalive.EnforcementPolicy{
MinTime: 5 * time.Second,
}),
)
s.SetGRPCServer(grpcServer)
s.RegisterGRPCService(grpcServer)
diagnosticspb.RegisterDiagnosticsServer(grpcServer, s)
s.ServerLoopWgAdd(1)
go startGRPCServer(s, grpcL)
handler, _ := s.SetUpRestHandler()
s.SetHTTPServer(&http.Server{
Handler: handler,
ReadTimeout: 3 * time.Second,
})
s.ServerLoopWgAdd(1)
go startHTTPServer(s, httpListener)
serverReadyChan <- struct{}{}
if err := mux.Serve(); err != nil {
if s.IsClosed() {
log.Info("mux stopped serving", errs.ZapError(err))
} else {
log.Fatal("mux stopped serving unexpectedly", errs.ZapError(err))
}
}
}
// StopHTTPServer stops the http server.
func StopHTTPServer(s server) {
log.Info("stopping http server")
defer log.Info("http server stopped")
ctx, cancel := context.WithTimeout(context.Background(), constant.DefaultHTTPGracefulShutdownTimeout)
defer cancel()
// First, try to gracefully shutdown the http server
ch := make(chan struct{})
go func() {
defer close(ch)
if err := s.GetHTTPServer().Shutdown(ctx); err != nil {
log.Error("http server graceful shutdown failed", errs.ZapError(err))
}
}()
select {
case <-ch:
case <-ctx.Done():
// Took too long, manually close open transports
log.Warn("http server graceful shutdown timeout, forcing close")
if err := s.GetHTTPServer().Close(); err != nil {
log.Warn("http server close failed", errs.ZapError(err))
}
// concurrent Graceful Shutdown should be interrupted
<-ch
}
}
// StopGRPCServer stops the grpc server.
func StopGRPCServer(s server) {
log.Info("stopping grpc server")
defer log.Info("grpc server stopped")
// Do not grpc.Server.GracefulStop with TLS enabled etcd server
// See path_to_url#issuecomment-317124531
// and path_to_url
if s.IsSecure() {
s.GetGRPCServer().Stop()
return
}
ctx, cancel := context.WithTimeout(context.Background(), constant.DefaultGRPCGracefulStopTimeout)
defer cancel()
// First, try to gracefully shutdown the grpc server
ch := make(chan struct{})
go func() {
defer close(ch)
// Close listeners to stop accepting new connections,
// will block on any existing transports
s.GetGRPCServer().GracefulStop()
}()
// Wait until all pending RPCs are finished
select {
case <-ch:
case <-ctx.Done():
// Took too long, manually close open transports
// e.g. watch streams
log.Warn("grpc server graceful shutdown timeout, forcing close")
s.GetGRPCServer().Stop()
// concurrent GracefulStop should be interrupted
<-ch
}
}
// Register registers the service.
func Register(s server, serviceName string) (uint64, *discovery.ServiceRegistryEntry, *discovery.ServiceRegister, error) {
var (
clusterID uint64
err error
)
if clusterID, err = InitClusterID(s.Context(), s.GetEtcdClient()); err != nil {
return 0, nil, nil, err
}
log.Info("init cluster id", zap.Uint64("cluster-id", clusterID))
execPath, err := os.Executable()
deployPath := filepath.Dir(execPath)
if err != nil {
deployPath = ""
}
serviceID := &discovery.ServiceRegistryEntry{
ServiceAddr: s.GetAdvertiseListenAddr(),
Version: versioninfo.PDReleaseVersion,
GitHash: versioninfo.PDGitHash,
DeployPath: deployPath,
StartTimestamp: s.StartTimestamp(),
Name: s.Name(),
}
serializedEntry, err := serviceID.Serialize()
if err != nil {
return 0, nil, nil, err
}
serviceRegister := discovery.NewServiceRegister(s.Context(), s.GetEtcdClient(), strconv.FormatUint(clusterID, 10),
serviceName, s.GetAdvertiseListenAddr(), serializedEntry, discovery.DefaultLeaseInSeconds)
if err := serviceRegister.Register(); err != nil {
log.Error("failed to register the service", zap.String("service-name", serviceName), errs.ZapError(err))
return 0, nil, nil, err
}
return clusterID, serviceID, serviceRegister, nil
}
// Exit exits the program with the given code.
func Exit(code int) {
log.Sync()
os.Exit(code)
}
``` |
Ambia pedionoma is a moth in the family Crambidae. It is found in the Philippines (Palawan).
References
Moths described in 1931
Musotiminae
Moths of Asia |
is a Japanese martial artist and veteran of the Soviet-Afghan war. Tanaka wanted to leave his dull job and see if he would ever fear death. He travelled to the Democratic Republic of Afghanistan and joined Jamiat-e Islami, taking up arms against the Soviet and Afghan armies.
Early life
Koshiro Tanaka was born in 1940 in Tagawa (Fukuoka Prefecture). He studied karate from childhood, and then judo and kendo. Growing up, Tanaka became a businessman, but gradually came to the idea that the business of his life was martial arts. He graduated from Kanagawa University Faculty of Law and Economics. He decided the best “test site” for his spirit and body would be civil war-torn Afghanistan.
Afghanistan
In 1985, while sitting in his office at Tokyo's Shinjuku district he talked of preparations to go to Afghanistan. He would finance himself. He traveled to Peshawar, the capital of Pakistan's Northwest Frontier Province. He carried 10 thousand dollars to distribute to the mujahideen. He raised the money from his company. Peshawar was the seat of the Afghanistan resistance movement. Seven Muslim guerilla parties had their headquarters there. Peshawar was then home to more than 3 million Afghan refugees. Tanaka joined Jamiat-e Islam which was the second largest mujahideen group, headed by Burhanuddin Rabbani. As he prepared to depart to Afghanistan, his wife Takiko stood beside him and showed support but wanted him to stay. She admitted she didn't understand her husband's attraction to the mujahideen.
The mujahideen, he said, "need help, any kind of help. They need weapons, bread, food, anything". When Koshiro Tanaka arrived in Afghanistan, he exchanged his black uniform suit for a salwar kameez and proceeded to convert to Islam. He had no battlefield experience but nonetheless, he began to teach the mujahideen hand-to-hand combat. In February 1985, he took part in a battle against the Soviet and Afghan armies. Many journalists around the world reported on the so-called "Afghan samurai".
Reaction from Japan
The Japanese government disapproved of his activities. The Japanese Embassy in Islamabad officially warned Tanaka about the inappropriateness of involvement in the Afghan conflict. Tanaka ignored this warning and began to train the Dushmans of the second largest group headed by Rabbani. He eventually viewed himself as a martyr for Japan, which had an Island dispute with the Soviet Union.
Tanaka was strongly against the government and Constitution for denying Japanese people the chance to fight the Russians off the Kuril Islands to which Japan had historical ties to. The Islands were lost to the Soviets.
Post-Afghanistan
He later became the managing director of the Japan Freedom Afghanistan Association, the secretary general of the International Refugee Relief Committee, and succeeded the second Soke of Fuji Fluid Art in 1991, serving until 2007. In 2008, he launched his own school, "Hiko School".
Tanaka wrote an autobiography based on his experience fighting Soviet and pro-communist Afghan troops in "Soviet Soldiers in a Gun Sight, My Battle in Afghanistan".
References
1940 births
Living people |
```java
/*
* All Rights Reserved.
*/
package me.zhanghai.android.douya.network.api.info.frodo;
import android.os.Parcel;
import com.google.gson.annotations.SerializedName;
import java.util.ArrayList;
public class Game extends SimpleGame {
@SerializedName("aliases")
public ArrayList<String> alternativeTitles = new ArrayList<>();
public ArrayList<String> developers = new ArrayList<>();
@SerializedName("info_url")
public String informationUrl;
public ArrayList<String> publishers = new ArrayList<>();
public static final Creator<Game> CREATOR = new Creator<Game>() {
@Override
public Game createFromParcel(Parcel source) {
return new Game(source);
}
@Override
public Game[] newArray(int size) {
return new Game[size];
}
};
public Game() {}
protected Game(Parcel in) {
super(in);
alternativeTitles = in.createStringArrayList();
developers = in.createStringArrayList();
informationUrl = in.readString();
publishers = in.createStringArrayList();
}
@Override
public int describeContents() {
return 0;
}
@Override
public void writeToParcel(Parcel dest, int flags) {
super.writeToParcel(dest, flags);
dest.writeStringList(alternativeTitles);
dest.writeStringList(developers);
dest.writeString(informationUrl);
dest.writeStringList(publishers);
}
}
``` |
The Unbreakable World Tour was the seventh concert tour by American recording artist Janet Jackson. It was in support of her eleventh studio album Unbreakable (2015). In addition to Live Nation and Rhythm Nation, the tour is also sponsored by Nederlander Concerts, Jam Productions, Another Planet Entertainment, Bamp and Tommy Meharey. When the tour was announced in June 2015, multiple legs were planned for North America, Asia and Europe. However, in December 2015, Jackson announced that tour dates beginning in 2016 would be postponed due to surgery and in April 2016 announced the summer dates would be rescheduled due to her pregnancy. In May 2017, she announced the tour would resume beginning in September, renamed as the State of the World Tour.
Background
In August 2014, producer and engineer Ian Cross, who worked on her last three studio albums, confirmed to Barefoot Sound that he was working on Jackson's new album, stating they worked in recording studios in Qatar, Paris and Middle East. After his declarations, Jackson herself responded to the rumor, neither confirming nor denying the works: "If there is a new project, you'll hear it from my lips", she tweeted. On April 22, 2015, she tweeted, "Letting go doesn't mean you stop", after a fan created a mock Missing Persons poster of Jackson, which had begun circulating the internet, prompting Jackson to retweet it herself, adding to further speculation of a new album.
On May 15, 2015, Jackson announced a new album and world tour. She will release her forthcoming eleventh album in the fall of 2015 through her own record label, Rhythm Nation, distributed by BMG Rights Management. Later in June 2015, the first 36 dates of the Unbreakable World Tour in North America were announced. Pre-sale tickets were made available exclusively to American Express and Citibank cardholders prior to general admission tickets going on sale on June 22, 2015. Jackson's forthcoming album was also made available for pre-order, along with vinyl copies of the album's lead single "No Sleeep."
Jackson enlisted designer Giuseppe Zanotti to create custom shoes for the tour. In an interview with Women's Wear Daily Zanotti stated that "Janet will be dancing a lot on stage as well as singing, so I wanted her to be very comfortable and able to move around easily ... The shoe has to be light but practical and provide support to her feet." Zanotti also noted Unbreakable will be the first tour in which he makes custom designs for the entire cast.
Commercial reception
According to Forbes, Jackson's absence since her previous tour coupled with the social media campaign to have her return to recording music and performing generated high ticket prices, averaging $167.20 on the secondary market. The most expensive shows for the first leg of the tour include The Forum in Inglewood, California and the Chicago Theatre, while the Delta Classic Chastain Park Amphitheater in Atlanta will host the least expensive show on the tour.
According to sales reports from Live Nation, "88 percent of the tickets on the trek's first leg (Aug. 31 to Nov. 15) were purchased two weeks after going on sale; nearly 80 percent of the tickets for the second leg (Jan. 12 to March 9) were gone in two days." Due to immediate sell-outs, additional concert dates were added to the Neal S. Blaisdell Center in Honolulu and at the Chicago Theatre. The tour also set a record for the fastest sell-out in the history of Sands Bethlehem Event Center in Bethlehem, Pennsylvania, selling 2,400 tickets within 30 minutes.
According to StubHub, a ticket resale site, the Unbreakable World Tour ranked the tenth most popular concert tour of the fall of 2015.
At the end of 2015, the tour placed at number 74 on Pollstar's "2015 Year-End Top 200 North American Tours" list, grossing $15.0 million from 33 shows with a total attendance of 179,340.
Critical reception
Writing for E!, Zach Johnson wrote that "Janet Jackson made a welcome return to the stage" for the tour's opening concert at the Rogers Arena in Vancouver, British Columbia. She started the concert with a new song, "Burn It Up", featuring rapper Missy Elliott. The remainder of the setlist included new material from Unbreakable as well as numerous classic songs from her catalog. Jon Pareles of The New York Times observed that songs on the setlist were arranged by "persona and tempo. She was the woman taking charge (funk), the joyfully loyal lover (upbeat pop), the ballad singer, the woman left lonely (midtempo R&B), the party girl (dance-club beats), the rocker (with guitar up front) and, in the end, the idealist." He complimented her vocal technique, stating it was "never as delicate as she could make it sound. The rock songs included "Scream" as a duet with the voice of Michael Jackson; she belted it with a raw urgency." He noted that as the concert neared its end, Jackson focused the show on socially conscious messages, including "Rhythm Nation" and a new song from Unbreakable, "a ballad that marched its way toward an anthem, part U2 and part trance music ... It was the virtuous Janet Jackson, the one that was always there." Fish Griwkowsky of the Edmonton Journal said the show "was a dazzling concert, an energetic temple of love with few hits left unturned", adding that "Jackson is ready for the world again".
Postponement
In December 2015, Jackson announced that the upcoming second North American leg of the tour that was set to start in January 2016 would be postponed due to needing surgery. All dates were rescheduled except for one date in Lexington, Kentucky, as the venue would go through renovations.
In March 2016, the European leg of the tour was postponed. On April 6, 2016, Jackson announced that due to family planning, she is postponing all remaining dates of the tour. She stated: "Please, if you can try and understand that it's important that I do this now. I have to rest up, doctor's orders. But I have not forgotten about you. I will continue the tour as soon as I possibly can." According to concert promoter Live Nation, the tour will resume in 2017 and tickets will be honored with rescheduled dates; refunds will also be available.
State of the World Tour
On May 1, 2017, Jackson announced she would resume the tour, now known as the State of the World Tour; the tour kicked off on September 7, 2017.
Set list
This set list is representative of the show on August 31, 2015 in Vancouver, Canada. It does not represent all shows during the tour.
"Video Introduction" (contains elements from "Funny How Time Flies (When You're Having Fun)", "Nasty", "Rock with U", "Every Time", "Rhythm Nation", and "Scream")
"BURNITUP!"
"Nasty"
"Feedback"
"Miss You Much" / "Alright" / "You Want This"
"Control" / "What Have You Done for Me Lately" / "The Pleasure Principle"
"Escapade"
"When I Think of You" / "All for You"
"All Nite (Don't Stop)"
"Love Will Never Do (Without You)"
"After You Fall"
"Again" / "Come Back to Me" / "Let's Wait Awhile"
"I Get Lonely"
"Any Time, Any Place"
"No Sleeep"
"Got 'til It's Gone"
"That's the Way Love Goes"
"Together Again"
"The Best Things in Life Are Free"
"Throb"
"Black Cat"
"If"
"Scream" / "Rhythm Nation"
Encore
"Shoulda Known Better"
"Unbreakable"
Notes
"Night" was added to the set list, starting with the third night in Honolulu.
Shows
Cancelled shows
References
Notes
Citations
External links
Official website
2015 concert tours
2016 concert tours
Janet Jackson concert tours |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.