text stringlengths 1 22.8M |
|---|
Pavel Kharitonov (born 25 July 1989 in Moscow, Russia) is a Russian snowboarder. He has competed at the 2014 Winter Olympics in Sochi.
References
1989 births
Snowboarders at the 2014 Winter Olympics
Living people
Olympic snowboarders for Russia
Russian male snowboarders
Sportspeople from Moscow
21st-century Russian people |
Trai Jamar Essex (born December 5, 1982) is a former American football offensive guard who played eight seasons in the National Football League (NFL) with the Pittsburgh Steelers and Indianapolis Colts.
Early years
Essex grew up in Fort Wayne, Indiana where he attended Paul Harding High School and lettered in football and basketball. In football, he was a standout tight end. He played in the first ever U.S. Army All-American Bowl (a high school football national all-star game) on December 30, 2000.
In basketball, he was a member of the 2001 class 2A Indiana boys high school championship team. His 14 rebounds ties for 3rd best ever in the class 2A championship game. Essex was an All-Conference honoree as a junior.
College years
Essex attended Northwestern University, where he majored in African-American studies and was a letterman in football. He started every game as a true freshman at tight end, catching three passes for 24 yards and a touchdown. He was named to the Big Ten All-Freshman team by The Sporting News magazine. He was moved from tight end to offensive tackle prior to his sophomore season and started 37 consecutive games at left tackle for the Wildcats in his final three seasons. He was named to ESPN's All-Bowl team following his performance in the 2003 Motor City Bowl.
Professional career
Essex was selected in the third round of the 2005 NFL Draft by the Pittsburgh Steelers. He signed a $1.385 million three-year contract which included a $460,000 signing bonus. After being held out of action through the first nine games of his rookie season, he started at left tackle in four games in place of an injured Marvel Smith. The Steelers' 2005 season ended with a victory in Super Bowl XL.
Essex did not make a start in the next two seasons, though he did suit up for 18 games. After the 2007 season he signed a restricted free agent tender which bound him to the team through for just over $900,000.
Essex's fifth career start came when he again subbed for Smith at left tackle in a playoff game on January 5, 2008, which was a narrow loss to the Jacksonville Jaguars.
Essex showed promise in with strong performances in place of starting right guard Darnell Stapleton against the Chicago Bears and Minnesota Vikings. Once again the team finished the season as Super Bowl champions, making Essex one of 21 players who were members of both of the Steelers' championship teams in the 2000s.
Following the Steelers' victory in Super Bowl XLIII, Essex signed a $1.92 million, two-year contract with the team, which included a $500,000 signing bonus. Before re-signing with Pittsburgh he fielded offers from the New York Jets and Tennessee Titans but was persuaded to return to the Steelers when he received assurances from the team that he would be given the opportunity to win a starting spot.
Essex started at right guard for the entire 2009 season. He picked up where he left off in as the starting right guard. However, he was sidelined in the second game of the year with a high-ankle sprain. He eventually returned as the starter at right guard, but was replaced by Ramon Foster after getting three more starts. The Steelers once again earned a trip to the Super Bowl XLV where they fell to the Green Bay Packers.
Essex was an unrestricted free agent following the 2010 NFL season. He was unable to sign a new contract due to the 2011 NFL lockout which canceled normal off-season team activities. During the lockout, Essex ballooned to 380 pounds, fifty pounds over his playing weight. Team personnel saw Essex at quarterback Ben Roethlisberger's wedding in July 2011, and were hesitant to extend a contract or invite Essex to training camp due to his lack of conditioning. The team eventually re-signed him toward the end of camp at Roethlisberger's urging after Essex had worked on his own to bring his weight under control. He said at the time that he had lost an amount equivalent to the weight of "a couple newborn babies." He was signed for the veteran minimum of $810,000.
Essex's "position flexibility" (i.e. the ability to play more than one role on the team) was key to his re-signing and was pressed to new heights in the 2011 season during which he played at all five offensive line positions. He played a good portion of the team's third game at right tackle when the starter, rookie Marcus Gilbert, was injured. He started the team's next game at left tackle in place of Jonathan Scott, who had also been injured in week three. He spent some time over the next few weeks at left guard because of yet more injuries. In week 13 he spent significant time at left guard and started at that position in week 15.
When backup center Doug Legursky (who was starting due to an injury to Maurkice Pouncey) was injured early in the team's week 16 game against the St. Louis Rams Essex was forced to play center for the first time in his career. The Steelers shut out the Rams 27–0 in that game and coach Mike Tomlin presented Essex with a game ball as recognition of the magnitude of his contributions.
Essex was released by the Steelers at the end of the 2012 training camp.
References
External links
1982 births
Living people
Players of American football from Fort Wayne, Indiana
American football offensive tackles
American football offensive guards
Northwestern Wildcats football players
Pittsburgh Steelers players
Indianapolis Colts players |
Iván Darío López (August 25, 1980 in Bogotá, Colombia), is a Colombian television actor. He is best known for his telenovelas.
Filmography
Film
Television roles
Awards and nominations
References
External links
1980 births
Colombian male telenovela actors
Colombian male television actors
21st-century Colombian male actors
Living people |
```objective-c
#import <Foundation/Foundation.h>
@interface PodsDummy_SubtleVolume : NSObject
@end
@implementation PodsDummy_SubtleVolume
@end
``` |
```scss
html.rtl {
#loadingmodal .modal-card .modal-card-icon, #ajaxerr .modal-card .modal-card-icon {
float: right;
}
#loadingmodal .modal-card .modal-card-content, #ajaxerr .modal-card .modal-card-content {
margin-right: 160px;
margin-left: 0;
text-align: right;
}
.alert-success, .alert-danger, .alert-info, .alert-warning, .alert-legal {
padding-right: 65px;
padding-left: 15px;
}
.alert {
text-align: right;
}
.alert-success::before, .alert-danger::before, .alert-info::before, .alert-warning::before, .alert-legal::before {
left: inherit;
right: 0;
}
}
@media(min-width: $screen-sm-min) {
html.rtl .nameparts-form-group {
input, select {
border-radius: $border-radius-base;
}
input:not(:first-child), select:not(:first-child) {
border-bottom-right-radius: 0;
border-top-right-radius: 0;
}
input:not(:last-child), select:not(:last-child) {
border-bottom-left-radius: 0;
border-top-left-radius: 0;
}
}
}
@media (max-width: 700px) {
html.rtl {
#loadingmodal .modal-card .modal-card-content, #ajaxerr .modal-card .modal-card-content {
margin-right: 0;
}
}
}
``` |
Austinn Gregg "Aussie" Jones (born 28 September 1976) is a former Australian rules footballer who played with St Kilda in the Australian Football League (AFL).
The 176 cm Jones played for the Collingwood reserves in the mid-1990s, but they were afraid to recruit him due to him weighing just 64 kilograms. "Aussie", as he is more commonly known, refused to give up on his dream to play AFL football, and was recruited to St Kilda in the 1994 AFL Draft. He made his debut in 1995 still weighing in at the high 60s.
In 1996 and 1997, Jones established himself as one of the league's better wingers/half-back flankers, with his pace and hard-running a big advantage for the Saints.
Jones played in St Kilda's 1996 pre-season final winning side – the club's first pre-season win.
Jones played in 22 of 22 matches in the 1997 home and away rounds in which St Kilda qualified in first position for the 1997 AFL finals, winning the club's second minor premiership.
In 1997 he had a stellar year, Jones winning All-Australian selection.
In fact, Jones put the Saints in a very strong position, kicking a Goal of the Year contender with a magnificent long run and goal. At that stage the Saints had a comfortable lead and the Jones goal looked like the team would run away with the game. It was not to be, however, with the Saints forfeiting a half-time lead to lose the match.
Jones played in St Kilda's 2004 pre-season final winning side – St Kilda's second pre-season final win.
Jones career suffered from inconsistency in the following years, however in 2004, the first year St Kilda made the finals since 1998, Jones again won All-Australian selection and was back to his best. However Jones, even then, doubted whether he would be able to cope with the mental pressures of AFL football, and was even considering retirement.
In 2005 he suffered a major setback when he was dropped to the Victorian Football League midway through the year. Although he regained his form, Jones admitted that he was at his lowest ebb as a player at this stage. He fought his way back into the seniors and performed admirably during the Saints' late-season charge into the top four.
Despite hinting at his retirement previously, it was a huge shock when Jones called it quits from the game with one year to run on his contract, and having just turned 29. He cited the mental pressures, more than the physical toll, as the reason for his retirement. In 2006 he was the contracted as the playing coach at country football club, the Narre Warren Magpies. His venture as coach was a successful one; in his first year as coach the team won the Casey Cardinia Football League grand final. Jones coached Narre Warren again in 2007.
Narre Warren, under the guidance of Aussie Jones in his last game as playing coach, won back to back premierships on 22 September 2007. He coached Gippsland Power in the 2008 TAC Cup season.
In July 2012, Jones was appointed as head coach of the newly formed standalone VFL team Bendigo Gold, with his coaching stint to commence in Gold's inaugural year as a standalone VFL side in 2013.
Statistics
|-
|- style="background-color: #EAEAEA"
! scope="row" style="text-align:center" | 1995
|style="text-align:center;"|
| 29 || 19 || 10 || 7 || 134 || 82 || 216 || 33 || 20 || 0.5 || 0.4 || 7.1 || 4.3 || 11.4 || 1.7 || 1.1 || 0
|-
! scope="row" style="text-align:center" | 1996
|style="text-align:center;"|
| 29 || 22 || 25 || 25 || 259 || 129 || 388 || 75 || 22 || 1.1 || 1.1 || 11.8 || 5.9 || 17.6 || 3.4 || 1.0 || 1
|- style="background-color: #EAEAEA"
! scope="row" style="text-align:center" | 1997
|style="text-align:center;"|
| 5 || 25 || 22 || 9 || 323 || 167 || 490 || 77 || 32 || 0.9 || 0.4 || 12.9 || 6.7 || 19.6 || 3.1 || 1.3 || 5
|-
! scope="row" style="text-align:center" | 1998
|style="text-align:center;"|
| 5 || 23 || 23 || 13 || 238 || 101 || 339 || 63 || 32 || 1.0 || 0.6 || 10.3 || 4.4 || 14.7 || 2.7 || 1.4 || 1
|- style="background-color: #EAEAEA"
! scope="row" style="text-align:center" | 1999
|style="text-align:center;"|
| 5 || 19 || 12 || 18 || 180 || 82 || 262 || 72 || 18 || 0.6 || 0.9 || 9.5 || 4.3 || 13.8 || 3.8 || 0.9 || 2
|-
! scope="row" style="text-align:center" | 2000
|style="text-align:center;"|
| 5 || 17 || 9 || 7 || 182 || 60 || 242 || 47 || 18 || 0.5 || 0.4 || 10.7 || 3.5 || 14.2 || 2.8 || 1.1 || 1
|- style="background-color: #EAEAEA"
! scope="row" style="text-align:center" | 2001
|style="text-align:center;"|
| 5 || 16 || 4 || 3 || 206 || 80 || 286 || 46 || 20 || 0.3 || 0.2 || 12.9 || 5.0 || 17.9 || 2.9 || 1.3 || 5
|-
! scope="row" style="text-align:center" | 2002
|style="text-align:center;"|
| 5 || 16 || 6 || 2 || 208 || 95 || 303 || 46 || 12 || 0.4 || 0.1 || 13.0 || 5.9 || 18.9 || 2.9 || 0.8 || 2
|- style="background-color: #EAEAEA"
! scope="row" style="text-align:center" | 2003
|style="text-align:center;"|
| 5 || 22 || 7 || 3 || 317 || 108 || 425 || 85 || 30 || 0.3 || 0.1 || 14.4 || 4.9 || 19.3 || 3.9 || 1.4 || 3
|-
! scope="row" style="text-align:center" | 2004
|style="text-align:center;"|
| 5 || 25 || 3 || 6 || 346 || 120 || 466 || 85 || 37 || 0.1 || 0.2 || 13.8 || 4.8 || 18.6 || 3.4 || 1.5 || 11
|- style="background-color: #EAEAEA"
! scope="row" style="text-align:center" | 2005
|style="text-align:center;"|
| 5 || 22 || 6 || 3 || 252 || 93 || 345 || 73 || 31 || 0.3 || 0.1 || 11.5 || 4.2 || 15.7 || 3.3 || 1.4 || 1
|- class="sortbottom"
! colspan=3| Career
! 226
! 127
! 96
! 2645
! 1117
! 3762
! 702
! 272
! 0.6
! 0.4
! 11.7
! 4.9
! 16.6
! 3.1
! 1.2
! 32
|}
References
External links
1976 births
Living people
Australian rules footballers from Victoria (state)
St Kilda Football Club players
All-Australians (AFL)
Dandenong Stingrays players
Victorian State of Origin players
Australia international rules football team players |
```python
Following PEP 8 styling guideline.
`Module`s everywhere!
Get the most of `int`s
Get the most of `float`s
`bytearray` objects
``` |
```ruby
class Direnv < Formula
desc "Load/unload environment variables based on $PWD"
homepage "path_to_url"
url "path_to_url"
sha256 your_sha256_hash
license "MIT"
head "path_to_url", branch: "master"
bottle do
sha256 arm64_sonoma: your_sha256_hash
sha256 arm64_ventura: your_sha256_hash
sha256 arm64_monterey: your_sha256_hash
sha256 sonoma: your_sha256_hash
sha256 ventura: your_sha256_hash
sha256 monterey: your_sha256_hash
sha256 x86_64_linux: your_sha256_hash
end
depends_on "go" => :build
depends_on "bash"
def install
system "make", "install", "PREFIX=#{prefix}", "BASH_PATH=#{Formula["bash"].opt_bin}/bash"
end
test do
system bin/"direnv", "status"
end
end
``` |
Laphystia litoralis is a species of robber flies in the family Asilidae.
References
External links
litoralis
Articles created by Qbugbot
Insects described in 1931 |
Joseph Currie Hanna (May 19, 1920 – July 26, 2003) was an American politician who served in the Texas House of Representatives from 1971 to 1985.
Biography
Hanna attended John Tarleton Agricultural College in 1940 and later transferred to University of Texas at Austin, studying Pre-law. He served as a fighter pilot in the United States Navy during World War II. He was elected to the Texas House of Representatives in 1984 and served a total of seven terms. Hanna died on July 26, 2003, in Breckenridge, Texas.
References
External links
|-
|-
1920 births
2003 deaths
Democratic Party members of the Texas House of Representatives
United States Navy personnel of World War II |
Stadium Perica-Pero Pavlović is a multi-use stadium in Gabela, Bosnia and Herzegovina. It is the home ground of Bosnian Premier League club NK GOŠK Gabela. The stadium has a capacity to hold 3,000 seated spectators.
In December 2016, the stadium was renamed from Stadium Podavala to Stadium Perica-Pero Pavlović.
References
External links
Stadion Perica-Pero Pavlović at Football-Lineups.com
NK GOŠK Gabela
p
Multi-purpose stadiums in Bosnia and Herzegovina |
Barik Ab (, also Romanized as Bārīk Āb; also known as Barkāb and Barkoud) is a village in Ijrud-e Bala Rural District, in the Central District of Ijrud County, Zanjan Province, Iran. At the 2006 census, its population was 715, in 181 families.
References
Populated places in Ijrud County |
Michael Triplett (April 20, 1964, St. Louis, Missouri - January 17, 2013, Madison, Alabama) was an American journalist and president of the National Lesbian and Gay Journalists Association from August 2012 until his death. Most recently, Triplett had worked for the Daily Tax Report for Bloomberg BNA, as an assistant managing editor.
He was born in St. Louis and graduated from University of Missouri in 1986, and also later graduated from American University Law School in 1998. Before becoming a full-time journalist, he served as a former director at Ohio State University and University of Kansas.
Triplett died on January 17, 2013, of cancer at his mother's house in Madison, Alabama. He is survived by his partner Jack Squier, his mother, and a sister.
References
1964 births
2013 deaths
American LGBT rights activists
American male journalists
Writers from St. Louis
University of Missouri alumni
Washington College of Law alumni
Deaths from cancer in Alabama
Ohio State University people
University of Kansas people
American LGBT journalists
LGBT people from Missouri |
Zosia is a given name or popular diminutive of name Zofia. Notable people with the name include:
Zosia Karbowiak (born 1980), Polish singer-songwriter
Zosia Mamet (born 1988), American actress and musician
Gila Golan (born 1940, originally Zosia Zawadzka), Israeli former model and actress
Zosia March, a fictional character from the BBC medical drama Holby City
Zosia, a character from the Polish epic poem Pan Tadeusz
Zosia Boski, a character from the Polish historical novel Fire in the Steppe
See also
Zosia, crater on Venus
Polish feminine given names
Feminine given names |
```objective-c
// This file is part of Eigen, a lightweight C++ template library
// for linear algebra.
//
//
// This Source Code Form is subject to the terms of the Mozilla
// with this file, You can obtain one at the mozilla.org home page
#ifndef EIGEN_SPARSEMATRIX_H
#define EIGEN_SPARSEMATRIX_H
namespace Eigen {
/** \ingroup SparseCore_Module
*
* \class SparseMatrix
*
* \brief A versatible sparse matrix representation
*
* This class implements a more versatile variants of the common \em compressed row/column storage format.
* Each colmun's (resp. row) non zeros are stored as a pair of value with associated row (resp. colmiun) index.
* All the non zeros are stored in a single large buffer. Unlike the \em compressed format, there might be extra
* space inbetween the nonzeros of two successive colmuns (resp. rows) such that insertion of new non-zero
* can be done with limited memory reallocation and copies.
*
* A call to the function makeCompressed() turns the matrix into the standard \em compressed format
* compatible with many library.
*
* More details on this storage sceheme are given in the \ref TutorialSparse "manual pages".
*
* \tparam _Scalar the scalar type, i.e. the type of the coefficients
* \tparam _Options Union of bit flags controlling the storage scheme. Currently the only possibility
* is ColMajor or RowMajor. The default is 0 which means column-major.
* \tparam _StorageIndex the type of the indices. It has to be a \b signed type (e.g., short, int, std::ptrdiff_t). Default is \c int.
*
* \warning In %Eigen 3.2, the undocumented type \c SparseMatrix::Index was improperly defined as the storage index type (e.g., int),
* whereas it is now (starting from %Eigen 3.3) deprecated and always defined as Eigen::Index.
* Codes making use of \c SparseMatrix::Index, might thus likely have to be changed to use \c SparseMatrix::StorageIndex instead.
*
* This class can be extended with the help of the plugin mechanism described on the page
* \ref TopicCustomizing_Plugins by defining the preprocessor symbol \c EIGEN_SPARSEMATRIX_PLUGIN.
*/
namespace internal {
template<typename _Scalar, int _Options, typename _StorageIndex>
struct traits<SparseMatrix<_Scalar, _Options, _StorageIndex> >
{
typedef _Scalar Scalar;
typedef _StorageIndex StorageIndex;
typedef Sparse StorageKind;
typedef MatrixXpr XprKind;
enum {
RowsAtCompileTime = Dynamic,
ColsAtCompileTime = Dynamic,
MaxRowsAtCompileTime = Dynamic,
MaxColsAtCompileTime = Dynamic,
Flags = _Options | NestByRefBit | LvalueBit | CompressedAccessBit,
SupportedAccessPatterns = InnerRandomAccessPattern
};
};
template<typename _Scalar, int _Options, typename _StorageIndex, int DiagIndex>
struct traits<Diagonal<SparseMatrix<_Scalar, _Options, _StorageIndex>, DiagIndex> >
{
typedef SparseMatrix<_Scalar, _Options, _StorageIndex> MatrixType;
typedef typename ref_selector<MatrixType>::type MatrixTypeNested;
typedef typename remove_reference<MatrixTypeNested>::type _MatrixTypeNested;
typedef _Scalar Scalar;
typedef Dense StorageKind;
typedef _StorageIndex StorageIndex;
typedef MatrixXpr XprKind;
enum {
RowsAtCompileTime = Dynamic,
ColsAtCompileTime = 1,
MaxRowsAtCompileTime = Dynamic,
MaxColsAtCompileTime = 1,
Flags = LvalueBit
};
};
template<typename _Scalar, int _Options, typename _StorageIndex, int DiagIndex>
struct traits<Diagonal<const SparseMatrix<_Scalar, _Options, _StorageIndex>, DiagIndex> >
: public traits<Diagonal<SparseMatrix<_Scalar, _Options, _StorageIndex>, DiagIndex> >
{
enum {
Flags = 0
};
};
} // end namespace internal
template<typename _Scalar, int _Options, typename _StorageIndex>
class SparseMatrix
: public SparseCompressedBase<SparseMatrix<_Scalar, _Options, _StorageIndex> >
{
typedef SparseCompressedBase<SparseMatrix> Base;
using Base::convert_index;
friend class SparseVector<_Scalar,0,_StorageIndex>;
public:
using Base::isCompressed;
using Base::nonZeros;
EIGEN_SPARSE_PUBLIC_INTERFACE(SparseMatrix)
using Base::operator+=;
using Base::operator-=;
typedef MappedSparseMatrix<Scalar,Flags> Map;
typedef Diagonal<SparseMatrix> DiagonalReturnType;
typedef Diagonal<const SparseMatrix> ConstDiagonalReturnType;
typedef typename Base::InnerIterator InnerIterator;
typedef typename Base::ReverseInnerIterator ReverseInnerIterator;
using Base::IsRowMajor;
typedef internal::CompressedStorage<Scalar,StorageIndex> Storage;
enum {
Options = _Options
};
typedef typename Base::IndexVector IndexVector;
typedef typename Base::ScalarVector ScalarVector;
protected:
typedef SparseMatrix<Scalar,(Flags&~RowMajorBit)|(IsRowMajor?RowMajorBit:0)> TransposedSparseMatrix;
Index m_outerSize;
Index m_innerSize;
StorageIndex* m_outerIndex;
StorageIndex* m_innerNonZeros; // optional, if null then the data is compressed
Storage m_data;
public:
/** \returns the number of rows of the matrix */
inline Index rows() const { return IsRowMajor ? m_outerSize : m_innerSize; }
/** \returns the number of columns of the matrix */
inline Index cols() const { return IsRowMajor ? m_innerSize : m_outerSize; }
/** \returns the number of rows (resp. columns) of the matrix if the storage order column major (resp. row major) */
inline Index innerSize() const { return m_innerSize; }
/** \returns the number of columns (resp. rows) of the matrix if the storage order column major (resp. row major) */
inline Index outerSize() const { return m_outerSize; }
/** \returns a const pointer to the array of values.
* This function is aimed at interoperability with other libraries.
* \sa innerIndexPtr(), outerIndexPtr() */
inline const Scalar* valuePtr() const { return m_data.valuePtr(); }
/** \returns a non-const pointer to the array of values.
* This function is aimed at interoperability with other libraries.
* \sa innerIndexPtr(), outerIndexPtr() */
inline Scalar* valuePtr() { return m_data.valuePtr(); }
/** \returns a const pointer to the array of inner indices.
* This function is aimed at interoperability with other libraries.
* \sa valuePtr(), outerIndexPtr() */
inline const StorageIndex* innerIndexPtr() const { return m_data.indexPtr(); }
/** \returns a non-const pointer to the array of inner indices.
* This function is aimed at interoperability with other libraries.
* \sa valuePtr(), outerIndexPtr() */
inline StorageIndex* innerIndexPtr() { return m_data.indexPtr(); }
/** \returns a const pointer to the array of the starting positions of the inner vectors.
* This function is aimed at interoperability with other libraries.
* \sa valuePtr(), innerIndexPtr() */
inline const StorageIndex* outerIndexPtr() const { return m_outerIndex; }
/** \returns a non-const pointer to the array of the starting positions of the inner vectors.
* This function is aimed at interoperability with other libraries.
* \sa valuePtr(), innerIndexPtr() */
inline StorageIndex* outerIndexPtr() { return m_outerIndex; }
/** \returns a const pointer to the array of the number of non zeros of the inner vectors.
* This function is aimed at interoperability with other libraries.
* \warning it returns the null pointer 0 in compressed mode */
inline const StorageIndex* innerNonZeroPtr() const { return m_innerNonZeros; }
/** \returns a non-const pointer to the array of the number of non zeros of the inner vectors.
* This function is aimed at interoperability with other libraries.
* \warning it returns the null pointer 0 in compressed mode */
inline StorageIndex* innerNonZeroPtr() { return m_innerNonZeros; }
/** \internal */
inline Storage& data() { return m_data; }
/** \internal */
inline const Storage& data() const { return m_data; }
/** \returns the value of the matrix at position \a i, \a j
* This function returns Scalar(0) if the element is an explicit \em zero */
inline Scalar coeff(Index row, Index col) const
{
eigen_assert(row>=0 && row<rows() && col>=0 && col<cols());
const Index outer = IsRowMajor ? row : col;
const Index inner = IsRowMajor ? col : row;
Index end = m_innerNonZeros ? m_outerIndex[outer] + m_innerNonZeros[outer] : m_outerIndex[outer+1];
return m_data.atInRange(m_outerIndex[outer], end, StorageIndex(inner));
}
/** \returns a non-const reference to the value of the matrix at position \a i, \a j
*
* If the element does not exist then it is inserted via the insert(Index,Index) function
* which itself turns the matrix into a non compressed form if that was not the case.
*
* This is a O(log(nnz_j)) operation (binary search) plus the cost of insert(Index,Index)
* function if the element does not already exist.
*/
inline Scalar& coeffRef(Index row, Index col)
{
eigen_assert(row>=0 && row<rows() && col>=0 && col<cols());
const Index outer = IsRowMajor ? row : col;
const Index inner = IsRowMajor ? col : row;
Index start = m_outerIndex[outer];
Index end = m_innerNonZeros ? m_outerIndex[outer] + m_innerNonZeros[outer] : m_outerIndex[outer+1];
eigen_assert(end>=start && "you probably called coeffRef on a non finalized matrix");
if(end<=start)
return insert(row,col);
const Index p = m_data.searchLowerIndex(start,end-1,StorageIndex(inner));
if((p<end) && (m_data.index(p)==inner))
return m_data.value(p);
else
return insert(row,col);
}
/** \returns a reference to a novel non zero coefficient with coordinates \a row x \a col.
* The non zero coefficient must \b not already exist.
*
* If the matrix \c *this is in compressed mode, then \c *this is turned into uncompressed
* mode while reserving room for 2 x this->innerSize() non zeros if reserve(Index) has not been called earlier.
* In this case, the insertion procedure is optimized for a \e sequential insertion mode where elements are assumed to be
* inserted by increasing outer-indices.
*
* If that's not the case, then it is strongly recommended to either use a triplet-list to assemble the matrix, or to first
* call reserve(const SizesType &) to reserve the appropriate number of non-zero elements per inner vector.
*
* Assuming memory has been appropriately reserved, this function performs a sorted insertion in O(1)
* if the elements of each inner vector are inserted in increasing inner index order, and in O(nnz_j) for a random insertion.
*
*/
Scalar& insert(Index row, Index col);
public:
/** Removes all non zeros but keep allocated memory
*
* This function does not free the currently allocated memory. To release as much as memory as possible,
* call \code mat.data().squeeze(); \endcode after resizing it.
*
* \sa resize(Index,Index), data()
*/
inline void setZero()
{
m_data.clear();
memset(m_outerIndex, 0, (m_outerSize+1)*sizeof(StorageIndex));
if(m_innerNonZeros)
memset(m_innerNonZeros, 0, (m_outerSize)*sizeof(StorageIndex));
}
/** Preallocates \a reserveSize non zeros.
*
* Precondition: the matrix must be in compressed mode. */
inline void reserve(Index reserveSize)
{
eigen_assert(isCompressed() && "This function does not make sense in non compressed mode.");
m_data.reserve(reserveSize);
}
#ifdef EIGEN_PARSED_BY_DOXYGEN
/** Preallocates \a reserveSize[\c j] non zeros for each column (resp. row) \c j.
*
* This function turns the matrix in non-compressed mode.
*
* The type \c SizesType must expose the following interface:
\code
typedef value_type;
const value_type& operator[](i) const;
\endcode
* for \c i in the [0,this->outerSize()[ range.
* Typical choices include std::vector<int>, Eigen::VectorXi, Eigen::VectorXi::Constant, etc.
*/
template<class SizesType>
inline void reserve(const SizesType& reserveSizes);
#else
template<class SizesType>
inline void reserve(const SizesType& reserveSizes, const typename SizesType::value_type& enableif =
#if (!EIGEN_COMP_MSVC) || (EIGEN_COMP_MSVC>=1500) // MSVC 2005 fails to compile with this typename
typename
#endif
SizesType::value_type())
{
EIGEN_UNUSED_VARIABLE(enableif);
reserveInnerVectors(reserveSizes);
}
#endif // EIGEN_PARSED_BY_DOXYGEN
protected:
template<class SizesType>
inline void reserveInnerVectors(const SizesType& reserveSizes)
{
if(isCompressed())
{
Index totalReserveSize = 0;
// turn the matrix into non-compressed mode
m_innerNonZeros = static_cast<StorageIndex*>(std::malloc(m_outerSize * sizeof(StorageIndex)));
if (!m_innerNonZeros) internal::throw_std_bad_alloc();
// temporarily use m_innerSizes to hold the new starting points.
StorageIndex* newOuterIndex = m_innerNonZeros;
StorageIndex count = 0;
for(Index j=0; j<m_outerSize; ++j)
{
newOuterIndex[j] = count;
count += reserveSizes[j] + (m_outerIndex[j+1]-m_outerIndex[j]);
totalReserveSize += reserveSizes[j];
}
m_data.reserve(totalReserveSize);
StorageIndex previousOuterIndex = m_outerIndex[m_outerSize];
for(Index j=m_outerSize-1; j>=0; --j)
{
StorageIndex innerNNZ = previousOuterIndex - m_outerIndex[j];
for(Index i=innerNNZ-1; i>=0; --i)
{
m_data.index(newOuterIndex[j]+i) = m_data.index(m_outerIndex[j]+i);
m_data.value(newOuterIndex[j]+i) = m_data.value(m_outerIndex[j]+i);
}
previousOuterIndex = m_outerIndex[j];
m_outerIndex[j] = newOuterIndex[j];
m_innerNonZeros[j] = innerNNZ;
}
if(m_outerSize>0)
m_outerIndex[m_outerSize] = m_outerIndex[m_outerSize-1] + m_innerNonZeros[m_outerSize-1] + reserveSizes[m_outerSize-1];
m_data.resize(m_outerIndex[m_outerSize]);
}
else
{
StorageIndex* newOuterIndex = static_cast<StorageIndex*>(std::malloc((m_outerSize+1)*sizeof(StorageIndex)));
if (!newOuterIndex) internal::throw_std_bad_alloc();
StorageIndex count = 0;
for(Index j=0; j<m_outerSize; ++j)
{
newOuterIndex[j] = count;
StorageIndex alreadyReserved = (m_outerIndex[j+1]-m_outerIndex[j]) - m_innerNonZeros[j];
StorageIndex toReserve = std::max<StorageIndex>(reserveSizes[j], alreadyReserved);
count += toReserve + m_innerNonZeros[j];
}
newOuterIndex[m_outerSize] = count;
m_data.resize(count);
for(Index j=m_outerSize-1; j>=0; --j)
{
Index offset = newOuterIndex[j] - m_outerIndex[j];
if(offset>0)
{
StorageIndex innerNNZ = m_innerNonZeros[j];
for(Index i=innerNNZ-1; i>=0; --i)
{
m_data.index(newOuterIndex[j]+i) = m_data.index(m_outerIndex[j]+i);
m_data.value(newOuterIndex[j]+i) = m_data.value(m_outerIndex[j]+i);
}
}
}
std::swap(m_outerIndex, newOuterIndex);
std::free(newOuterIndex);
}
}
public:
//--- low level purely coherent filling ---
/** \internal
* \returns a reference to the non zero coefficient at position \a row, \a col assuming that:
* - the nonzero does not already exist
* - the new coefficient is the last one according to the storage order
*
* Before filling a given inner vector you must call the statVec(Index) function.
*
* After an insertion session, you should call the finalize() function.
*
* \sa insert, insertBackByOuterInner, startVec */
inline Scalar& insertBack(Index row, Index col)
{
return insertBackByOuterInner(IsRowMajor?row:col, IsRowMajor?col:row);
}
/** \internal
* \sa insertBack, startVec */
inline Scalar& insertBackByOuterInner(Index outer, Index inner)
{
eigen_assert(Index(m_outerIndex[outer+1]) == m_data.size() && "Invalid ordered insertion (invalid outer index)");
eigen_assert( (m_outerIndex[outer+1]-m_outerIndex[outer]==0 || m_data.index(m_data.size()-1)<inner) && "Invalid ordered insertion (invalid inner index)");
Index p = m_outerIndex[outer+1];
++m_outerIndex[outer+1];
m_data.append(Scalar(0), inner);
return m_data.value(p);
}
/** \internal
* \warning use it only if you know what you are doing */
inline Scalar& insertBackByOuterInnerUnordered(Index outer, Index inner)
{
Index p = m_outerIndex[outer+1];
++m_outerIndex[outer+1];
m_data.append(Scalar(0), inner);
return m_data.value(p);
}
/** \internal
* \sa insertBack, insertBackByOuterInner */
inline void startVec(Index outer)
{
eigen_assert(m_outerIndex[outer]==Index(m_data.size()) && "You must call startVec for each inner vector sequentially");
eigen_assert(m_outerIndex[outer+1]==0 && "You must call startVec for each inner vector sequentially");
m_outerIndex[outer+1] = m_outerIndex[outer];
}
/** \internal
* Must be called after inserting a set of non zero entries using the low level compressed API.
*/
inline void finalize()
{
if(isCompressed())
{
StorageIndex size = internal::convert_index<StorageIndex>(m_data.size());
Index i = m_outerSize;
// find the last filled column
while (i>=0 && m_outerIndex[i]==0)
--i;
++i;
while (i<=m_outerSize)
{
m_outerIndex[i] = size;
++i;
}
}
}
//---
template<typename InputIterators>
void setFromTriplets(const InputIterators& begin, const InputIterators& end);
template<typename InputIterators,typename DupFunctor>
void setFromTriplets(const InputIterators& begin, const InputIterators& end, DupFunctor dup_func);
void sumupDuplicates() { collapseDuplicates(internal::scalar_sum_op<Scalar,Scalar>()); }
template<typename DupFunctor>
void collapseDuplicates(DupFunctor dup_func = DupFunctor());
//---
/** \internal
* same as insert(Index,Index) except that the indices are given relative to the storage order */
Scalar& insertByOuterInner(Index j, Index i)
{
return insert(IsRowMajor ? j : i, IsRowMajor ? i : j);
}
/** Turns the matrix into the \em compressed format.
*/
void makeCompressed()
{
if(isCompressed())
return;
eigen_internal_assert(m_outerIndex!=0 && m_outerSize>0);
Index oldStart = m_outerIndex[1];
m_outerIndex[1] = m_innerNonZeros[0];
for(Index j=1; j<m_outerSize; ++j)
{
Index nextOldStart = m_outerIndex[j+1];
Index offset = oldStart - m_outerIndex[j];
if(offset>0)
{
for(Index k=0; k<m_innerNonZeros[j]; ++k)
{
m_data.index(m_outerIndex[j]+k) = m_data.index(oldStart+k);
m_data.value(m_outerIndex[j]+k) = m_data.value(oldStart+k);
}
}
m_outerIndex[j+1] = m_outerIndex[j] + m_innerNonZeros[j];
oldStart = nextOldStart;
}
std::free(m_innerNonZeros);
m_innerNonZeros = 0;
m_data.resize(m_outerIndex[m_outerSize]);
m_data.squeeze();
}
/** Turns the matrix into the uncompressed mode */
void uncompress()
{
if(m_innerNonZeros != 0)
return;
m_innerNonZeros = static_cast<StorageIndex*>(std::malloc(m_outerSize * sizeof(StorageIndex)));
for (Index i = 0; i < m_outerSize; i++)
{
m_innerNonZeros[i] = m_outerIndex[i+1] - m_outerIndex[i];
}
}
/** Suppresses all nonzeros which are \b much \b smaller \b than \a reference under the tolerence \a epsilon */
void prune(const Scalar& reference, const RealScalar& epsilon = NumTraits<RealScalar>::dummy_precision())
{
prune(default_prunning_func(reference,epsilon));
}
/** Turns the matrix into compressed format, and suppresses all nonzeros which do not satisfy the predicate \a keep.
* The functor type \a KeepFunc must implement the following function:
* \code
* bool operator() (const Index& row, const Index& col, const Scalar& value) const;
* \endcode
* \sa prune(Scalar,RealScalar)
*/
template<typename KeepFunc>
void prune(const KeepFunc& keep = KeepFunc())
{
// TODO optimize the uncompressed mode to avoid moving and allocating the data twice
makeCompressed();
StorageIndex k = 0;
for(Index j=0; j<m_outerSize; ++j)
{
Index previousStart = m_outerIndex[j];
m_outerIndex[j] = k;
Index end = m_outerIndex[j+1];
for(Index i=previousStart; i<end; ++i)
{
if(keep(IsRowMajor?j:m_data.index(i), IsRowMajor?m_data.index(i):j, m_data.value(i)))
{
m_data.value(k) = m_data.value(i);
m_data.index(k) = m_data.index(i);
++k;
}
}
}
m_outerIndex[m_outerSize] = k;
m_data.resize(k,0);
}
/** Resizes the matrix to a \a rows x \a cols matrix leaving old values untouched.
*
* If the sizes of the matrix are decreased, then the matrix is turned to \b uncompressed-mode
* and the storage of the out of bounds coefficients is kept and reserved.
* Call makeCompressed() to pack the entries and squeeze extra memory.
*
* \sa reserve(), setZero(), makeCompressed()
*/
void conservativeResize(Index rows, Index cols)
{
// No change
if (this->rows() == rows && this->cols() == cols) return;
// If one dimension is null, then there is nothing to be preserved
if(rows==0 || cols==0) return resize(rows,cols);
Index innerChange = IsRowMajor ? cols - this->cols() : rows - this->rows();
Index outerChange = IsRowMajor ? rows - this->rows() : cols - this->cols();
StorageIndex newInnerSize = convert_index(IsRowMajor ? cols : rows);
// Deals with inner non zeros
if (m_innerNonZeros)
{
// Resize m_innerNonZeros
StorageIndex *newInnerNonZeros = static_cast<StorageIndex*>(std::realloc(m_innerNonZeros, (m_outerSize + outerChange) * sizeof(StorageIndex)));
if (!newInnerNonZeros) internal::throw_std_bad_alloc();
m_innerNonZeros = newInnerNonZeros;
for(Index i=m_outerSize; i<m_outerSize+outerChange; i++)
m_innerNonZeros[i] = 0;
}
else if (innerChange < 0)
{
// Inner size decreased: allocate a new m_innerNonZeros
m_innerNonZeros = static_cast<StorageIndex*>(std::malloc((m_outerSize+outerChange+1) * sizeof(StorageIndex)));
if (!m_innerNonZeros) internal::throw_std_bad_alloc();
for(Index i = 0; i < m_outerSize; i++)
m_innerNonZeros[i] = m_outerIndex[i+1] - m_outerIndex[i];
}
// Change the m_innerNonZeros in case of a decrease of inner size
if (m_innerNonZeros && innerChange < 0)
{
for(Index i = 0; i < m_outerSize + (std::min)(outerChange, Index(0)); i++)
{
StorageIndex &n = m_innerNonZeros[i];
StorageIndex start = m_outerIndex[i];
while (n > 0 && m_data.index(start+n-1) >= newInnerSize) --n;
}
}
m_innerSize = newInnerSize;
// Re-allocate outer index structure if necessary
if (outerChange == 0)
return;
StorageIndex *newOuterIndex = static_cast<StorageIndex*>(std::realloc(m_outerIndex, (m_outerSize + outerChange + 1) * sizeof(StorageIndex)));
if (!newOuterIndex) internal::throw_std_bad_alloc();
m_outerIndex = newOuterIndex;
if (outerChange > 0)
{
StorageIndex last = m_outerSize == 0 ? 0 : m_outerIndex[m_outerSize];
for(Index i=m_outerSize; i<m_outerSize+outerChange+1; i++)
m_outerIndex[i] = last;
}
m_outerSize += outerChange;
}
/** Resizes the matrix to a \a rows x \a cols matrix and initializes it to zero.
*
* This function does not free the currently allocated memory. To release as much as memory as possible,
* call \code mat.data().squeeze(); \endcode after resizing it.
*
* \sa reserve(), setZero()
*/
void resize(Index rows, Index cols)
{
const Index outerSize = IsRowMajor ? rows : cols;
m_innerSize = IsRowMajor ? cols : rows;
m_data.clear();
if (m_outerSize != outerSize || m_outerSize==0)
{
std::free(m_outerIndex);
m_outerIndex = static_cast<StorageIndex*>(std::malloc((outerSize + 1) * sizeof(StorageIndex)));
if (!m_outerIndex) internal::throw_std_bad_alloc();
m_outerSize = outerSize;
}
if(m_innerNonZeros)
{
std::free(m_innerNonZeros);
m_innerNonZeros = 0;
}
memset(m_outerIndex, 0, (m_outerSize+1)*sizeof(StorageIndex));
}
/** \internal
* Resize the nonzero vector to \a size */
void resizeNonZeros(Index size)
{
m_data.resize(size);
}
/** \returns a const expression of the diagonal coefficients. */
const ConstDiagonalReturnType diagonal() const { return ConstDiagonalReturnType(*this); }
/** \returns a read-write expression of the diagonal coefficients.
* \warning If the diagonal entries are written, then all diagonal
* entries \b must already exist, otherwise an assertion will be raised.
*/
DiagonalReturnType diagonal() { return DiagonalReturnType(*this); }
/** Default constructor yielding an empty \c 0 \c x \c 0 matrix */
inline SparseMatrix()
: m_outerSize(-1), m_innerSize(0), m_outerIndex(0), m_innerNonZeros(0)
{
check_template_parameters();
resize(0, 0);
}
/** Constructs a \a rows \c x \a cols empty matrix */
inline SparseMatrix(Index rows, Index cols)
: m_outerSize(0), m_innerSize(0), m_outerIndex(0), m_innerNonZeros(0)
{
check_template_parameters();
resize(rows, cols);
}
/** Constructs a sparse matrix from the sparse expression \a other */
template<typename OtherDerived>
inline SparseMatrix(const SparseMatrixBase<OtherDerived>& other)
: m_outerSize(0), m_innerSize(0), m_outerIndex(0), m_innerNonZeros(0)
{
EIGEN_STATIC_ASSERT((internal::is_same<Scalar, typename OtherDerived::Scalar>::value),
your_sha256_hashOD_OF_MATRIXBASE_TO_CAST_NUMERIC_TYPES_EXPLICITLY)
check_template_parameters();
const bool needToTranspose = (Flags & RowMajorBit) != (internal::evaluator<OtherDerived>::Flags & RowMajorBit);
if (needToTranspose)
*this = other.derived();
else
{
#ifdef EIGEN_SPARSE_CREATE_TEMPORARY_PLUGIN
EIGEN_SPARSE_CREATE_TEMPORARY_PLUGIN
#endif
internal::call_assignment_no_alias(*this, other.derived());
}
}
/** Constructs a sparse matrix from the sparse selfadjoint view \a other */
template<typename OtherDerived, unsigned int UpLo>
inline SparseMatrix(const SparseSelfAdjointView<OtherDerived, UpLo>& other)
: m_outerSize(0), m_innerSize(0), m_outerIndex(0), m_innerNonZeros(0)
{
check_template_parameters();
Base::operator=(other);
}
/** Copy constructor (it performs a deep copy) */
inline SparseMatrix(const SparseMatrix& other)
: Base(), m_outerSize(0), m_innerSize(0), m_outerIndex(0), m_innerNonZeros(0)
{
check_template_parameters();
*this = other.derived();
}
/** \brief Copy constructor with in-place evaluation */
template<typename OtherDerived>
SparseMatrix(const ReturnByValue<OtherDerived>& other)
: Base(), m_outerSize(0), m_innerSize(0), m_outerIndex(0), m_innerNonZeros(0)
{
check_template_parameters();
initAssignment(other);
other.evalTo(*this);
}
/** \brief Copy constructor with in-place evaluation */
template<typename OtherDerived>
explicit SparseMatrix(const DiagonalBase<OtherDerived>& other)
: Base(), m_outerSize(0), m_innerSize(0), m_outerIndex(0), m_innerNonZeros(0)
{
check_template_parameters();
*this = other.derived();
}
/** Swaps the content of two sparse matrices of the same type.
* This is a fast operation that simply swaps the underlying pointers and parameters. */
inline void swap(SparseMatrix& other)
{
//EIGEN_DBG_SPARSE(std::cout << "SparseMatrix:: swap\n");
std::swap(m_outerIndex, other.m_outerIndex);
std::swap(m_innerSize, other.m_innerSize);
std::swap(m_outerSize, other.m_outerSize);
std::swap(m_innerNonZeros, other.m_innerNonZeros);
m_data.swap(other.m_data);
}
/** Sets *this to the identity matrix.
* This function also turns the matrix into compressed mode, and drop any reserved memory. */
inline void setIdentity()
{
eigen_assert(rows() == cols() && "ONLY FOR SQUARED MATRICES");
this->m_data.resize(rows());
Eigen::Map<IndexVector>(this->m_data.indexPtr(), rows()).setLinSpaced(0, StorageIndex(rows()-1));
Eigen::Map<ScalarVector>(this->m_data.valuePtr(), rows()).setOnes();
Eigen::Map<IndexVector>(this->m_outerIndex, rows()+1).setLinSpaced(0, StorageIndex(rows()));
std::free(m_innerNonZeros);
m_innerNonZeros = 0;
}
inline SparseMatrix& operator=(const SparseMatrix& other)
{
if (other.isRValue())
{
swap(other.const_cast_derived());
}
else if(this!=&other)
{
#ifdef EIGEN_SPARSE_CREATE_TEMPORARY_PLUGIN
EIGEN_SPARSE_CREATE_TEMPORARY_PLUGIN
#endif
initAssignment(other);
if(other.isCompressed())
{
internal::smart_copy(other.m_outerIndex, other.m_outerIndex + m_outerSize + 1, m_outerIndex);
m_data = other.m_data;
}
else
{
Base::operator=(other);
}
}
return *this;
}
#ifndef EIGEN_PARSED_BY_DOXYGEN
template<typename OtherDerived>
inline SparseMatrix& operator=(const EigenBase<OtherDerived>& other)
{ return Base::operator=(other.derived()); }
#endif // EIGEN_PARSED_BY_DOXYGEN
template<typename OtherDerived>
EIGEN_DONT_INLINE SparseMatrix& operator=(const SparseMatrixBase<OtherDerived>& other);
friend std::ostream & operator << (std::ostream & s, const SparseMatrix& m)
{
EIGEN_DBG_SPARSE(
s << "Nonzero entries:\n";
if(m.isCompressed())
{
for (Index i=0; i<m.nonZeros(); ++i)
s << "(" << m.m_data.value(i) << "," << m.m_data.index(i) << ") ";
}
else
{
for (Index i=0; i<m.outerSize(); ++i)
{
Index p = m.m_outerIndex[i];
Index pe = m.m_outerIndex[i]+m.m_innerNonZeros[i];
Index k=p;
for (; k<pe; ++k) {
s << "(" << m.m_data.value(k) << "," << m.m_data.index(k) << ") ";
}
for (; k<m.m_outerIndex[i+1]; ++k) {
s << "(_,_) ";
}
}
}
s << std::endl;
s << std::endl;
s << "Outer pointers:\n";
for (Index i=0; i<m.outerSize(); ++i) {
s << m.m_outerIndex[i] << " ";
}
s << " $" << std::endl;
if(!m.isCompressed())
{
s << "Inner non zeros:\n";
for (Index i=0; i<m.outerSize(); ++i) {
s << m.m_innerNonZeros[i] << " ";
}
s << " $" << std::endl;
}
s << std::endl;
);
s << static_cast<const SparseMatrixBase<SparseMatrix>&>(m);
return s;
}
/** Destructor */
inline ~SparseMatrix()
{
std::free(m_outerIndex);
std::free(m_innerNonZeros);
}
/** Overloaded for performance */
Scalar sum() const;
# ifdef EIGEN_SPARSEMATRIX_PLUGIN
# include EIGEN_SPARSEMATRIX_PLUGIN
# endif
protected:
template<typename Other>
void initAssignment(const Other& other)
{
resize(other.rows(), other.cols());
if(m_innerNonZeros)
{
std::free(m_innerNonZeros);
m_innerNonZeros = 0;
}
}
/** \internal
* \sa insert(Index,Index) */
EIGEN_DONT_INLINE Scalar& insertCompressed(Index row, Index col);
/** \internal
* A vector object that is equal to 0 everywhere but v at the position i */
class SingletonVector
{
StorageIndex m_index;
StorageIndex m_value;
public:
typedef StorageIndex value_type;
SingletonVector(Index i, Index v)
: m_index(convert_index(i)), m_value(convert_index(v))
{}
StorageIndex operator[](Index i) const { return i==m_index ? m_value : 0; }
};
/** \internal
* \sa insert(Index,Index) */
EIGEN_DONT_INLINE Scalar& insertUncompressed(Index row, Index col);
public:
/** \internal
* \sa insert(Index,Index) */
EIGEN_STRONG_INLINE Scalar& insertBackUncompressed(Index row, Index col)
{
const Index outer = IsRowMajor ? row : col;
const Index inner = IsRowMajor ? col : row;
eigen_assert(!isCompressed());
eigen_assert(m_innerNonZeros[outer]<=(m_outerIndex[outer+1] - m_outerIndex[outer]));
Index p = m_outerIndex[outer] + m_innerNonZeros[outer]++;
m_data.index(p) = convert_index(inner);
return (m_data.value(p) = Scalar(0));
}
private:
static void check_template_parameters()
{
EIGEN_STATIC_ASSERT(NumTraits<StorageIndex>::IsSigned,THE_INDEX_TYPE_MUST_BE_A_SIGNED_TYPE);
EIGEN_STATIC_ASSERT((Options&(ColMajor|RowMajor))==Options,INVALID_MATRIX_TEMPLATE_PARAMETERS);
}
struct default_prunning_func {
default_prunning_func(const Scalar& ref, const RealScalar& eps) : reference(ref), epsilon(eps) {}
inline bool operator() (const Index&, const Index&, const Scalar& value) const
{
return !internal::isMuchSmallerThan(value, reference, epsilon);
}
Scalar reference;
RealScalar epsilon;
};
};
namespace internal {
template<typename InputIterator, typename SparseMatrixType, typename DupFunctor>
void set_from_triplets(const InputIterator& begin, const InputIterator& end, SparseMatrixType& mat, DupFunctor dup_func)
{
enum { IsRowMajor = SparseMatrixType::IsRowMajor };
typedef typename SparseMatrixType::Scalar Scalar;
typedef typename SparseMatrixType::StorageIndex StorageIndex;
SparseMatrix<Scalar,IsRowMajor?ColMajor:RowMajor,StorageIndex> trMat(mat.rows(),mat.cols());
if(begin!=end)
{
// pass 1: count the nnz per inner-vector
typename SparseMatrixType::IndexVector wi(trMat.outerSize());
wi.setZero();
for(InputIterator it(begin); it!=end; ++it)
{
eigen_assert(it->row()>=0 && it->row()<mat.rows() && it->col()>=0 && it->col()<mat.cols());
wi(IsRowMajor ? it->col() : it->row())++;
}
// pass 2: insert all the elements into trMat
trMat.reserve(wi);
for(InputIterator it(begin); it!=end; ++it)
trMat.insertBackUncompressed(it->row(),it->col()) = it->value();
// pass 3:
trMat.collapseDuplicates(dup_func);
}
// pass 4: transposed copy -> implicit sorting
mat = trMat;
}
}
/** Fill the matrix \c *this with the list of \em triplets defined by the iterator range \a begin - \a end.
*
* A \em triplet is a tuple (i,j,value) defining a non-zero element.
* The input list of triplets does not have to be sorted, and can contains duplicated elements.
* In any case, the result is a \b sorted and \b compressed sparse matrix where the duplicates have been summed up.
* This is a \em O(n) operation, with \em n the number of triplet elements.
* The initial contents of \c *this is destroyed.
* The matrix \c *this must be properly resized beforehand using the SparseMatrix(Index,Index) constructor,
* or the resize(Index,Index) method. The sizes are not extracted from the triplet list.
*
* The \a InputIterators value_type must provide the following interface:
* \code
* Scalar value() const; // the value
* Scalar row() const; // the row index i
* Scalar col() const; // the column index j
* \endcode
* See for instance the Eigen::Triplet template class.
*
* Here is a typical usage example:
* \code
typedef Triplet<double> T;
std::vector<T> tripletList;
triplets.reserve(estimation_of_entries);
for(...)
{
// ...
tripletList.push_back(T(i,j,v_ij));
}
SparseMatrixType m(rows,cols);
m.setFromTriplets(tripletList.begin(), tripletList.end());
// m is ready to go!
* \endcode
*
* \warning The list of triplets is read multiple times (at least twice). Therefore, it is not recommended to define
* an abstract iterator over a complex data-structure that would be expensive to evaluate. The triplets should rather
* be explicitely stored into a std::vector for instance.
*/
template<typename Scalar, int _Options, typename _StorageIndex>
template<typename InputIterators>
void SparseMatrix<Scalar,_Options,_StorageIndex>::setFromTriplets(const InputIterators& begin, const InputIterators& end)
{
internal::set_from_triplets<InputIterators, SparseMatrix<Scalar,_Options,_StorageIndex> >(begin, end, *this, internal::scalar_sum_op<Scalar,Scalar>());
}
/** The same as setFromTriplets but when duplicates are met the functor \a dup_func is applied:
* \code
* value = dup_func(OldValue, NewValue)
* \endcode
* Here is a C++11 example keeping the latest entry only:
* \code
* mat.setFromTriplets(triplets.begin(), triplets.end(), [] (const Scalar&,const Scalar &b) { return b; });
* \endcode
*/
template<typename Scalar, int _Options, typename _StorageIndex>
template<typename InputIterators,typename DupFunctor>
void SparseMatrix<Scalar,_Options,_StorageIndex>::setFromTriplets(const InputIterators& begin, const InputIterators& end, DupFunctor dup_func)
{
internal::set_from_triplets<InputIterators, SparseMatrix<Scalar,_Options,_StorageIndex>, DupFunctor>(begin, end, *this, dup_func);
}
/** \internal */
template<typename Scalar, int _Options, typename _StorageIndex>
template<typename DupFunctor>
void SparseMatrix<Scalar,_Options,_StorageIndex>::collapseDuplicates(DupFunctor dup_func)
{
eigen_assert(!isCompressed());
// TODO, in practice we should be able to use m_innerNonZeros for that task
IndexVector wi(innerSize());
wi.fill(-1);
StorageIndex count = 0;
// for each inner-vector, wi[inner_index] will hold the position of first element into the index/value buffers
for(Index j=0; j<outerSize(); ++j)
{
StorageIndex start = count;
Index oldEnd = m_outerIndex[j]+m_innerNonZeros[j];
for(Index k=m_outerIndex[j]; k<oldEnd; ++k)
{
Index i = m_data.index(k);
if(wi(i)>=start)
{
// we already meet this entry => accumulate it
m_data.value(wi(i)) = dup_func(m_data.value(wi(i)), m_data.value(k));
}
else
{
m_data.value(count) = m_data.value(k);
m_data.index(count) = m_data.index(k);
wi(i) = count;
++count;
}
}
m_outerIndex[j] = start;
}
m_outerIndex[m_outerSize] = count;
// turn the matrix into compressed form
std::free(m_innerNonZeros);
m_innerNonZeros = 0;
m_data.resize(m_outerIndex[m_outerSize]);
}
template<typename Scalar, int _Options, typename _StorageIndex>
template<typename OtherDerived>
EIGEN_DONT_INLINE SparseMatrix<Scalar,_Options,_StorageIndex>& SparseMatrix<Scalar,_Options,_StorageIndex>::operator=(const SparseMatrixBase<OtherDerived>& other)
{
EIGEN_STATIC_ASSERT((internal::is_same<Scalar, typename OtherDerived::Scalar>::value),
your_sha256_hashOD_OF_MATRIXBASE_TO_CAST_NUMERIC_TYPES_EXPLICITLY)
#ifdef EIGEN_SPARSE_CREATE_TEMPORARY_PLUGIN
EIGEN_SPARSE_CREATE_TEMPORARY_PLUGIN
#endif
const bool needToTranspose = (Flags & RowMajorBit) != (internal::evaluator<OtherDerived>::Flags & RowMajorBit);
if (needToTranspose)
{
#ifdef EIGEN_SPARSE_TRANSPOSED_COPY_PLUGIN
EIGEN_SPARSE_TRANSPOSED_COPY_PLUGIN
#endif
// two passes algorithm:
// 1 - compute the number of coeffs per dest inner vector
// 2 - do the actual copy/eval
// Since each coeff of the rhs has to be evaluated twice, let's evaluate it if needed
typedef typename internal::nested_eval<OtherDerived,2,typename internal::plain_matrix_type<OtherDerived>::type >::type OtherCopy;
typedef typename internal::remove_all<OtherCopy>::type _OtherCopy;
typedef internal::evaluator<_OtherCopy> OtherCopyEval;
OtherCopy otherCopy(other.derived());
OtherCopyEval otherCopyEval(otherCopy);
SparseMatrix dest(other.rows(),other.cols());
Eigen::Map<IndexVector> (dest.m_outerIndex,dest.outerSize()).setZero();
// pass 1
// FIXME the above copy could be merged with that pass
for (Index j=0; j<otherCopy.outerSize(); ++j)
for (typename OtherCopyEval::InnerIterator it(otherCopyEval, j); it; ++it)
++dest.m_outerIndex[it.index()];
// prefix sum
StorageIndex count = 0;
IndexVector positions(dest.outerSize());
for (Index j=0; j<dest.outerSize(); ++j)
{
StorageIndex tmp = dest.m_outerIndex[j];
dest.m_outerIndex[j] = count;
positions[j] = count;
count += tmp;
}
dest.m_outerIndex[dest.outerSize()] = count;
// alloc
dest.m_data.resize(count);
// pass 2
for (StorageIndex j=0; j<otherCopy.outerSize(); ++j)
{
for (typename OtherCopyEval::InnerIterator it(otherCopyEval, j); it; ++it)
{
Index pos = positions[it.index()]++;
dest.m_data.index(pos) = j;
dest.m_data.value(pos) = it.value();
}
}
this->swap(dest);
return *this;
}
else
{
if(other.isRValue())
{
initAssignment(other.derived());
}
// there is no special optimization
return Base::operator=(other.derived());
}
}
template<typename _Scalar, int _Options, typename _StorageIndex>
typename SparseMatrix<_Scalar,_Options,_StorageIndex>::Scalar& SparseMatrix<_Scalar,_Options,_StorageIndex>::insert(Index row, Index col)
{
eigen_assert(row>=0 && row<rows() && col>=0 && col<cols());
const Index outer = IsRowMajor ? row : col;
const Index inner = IsRowMajor ? col : row;
if(isCompressed())
{
if(nonZeros()==0)
{
// reserve space if not already done
if(m_data.allocatedSize()==0)
m_data.reserve(2*m_innerSize);
// turn the matrix into non-compressed mode
m_innerNonZeros = static_cast<StorageIndex*>(std::malloc(m_outerSize * sizeof(StorageIndex)));
if(!m_innerNonZeros) internal::throw_std_bad_alloc();
memset(m_innerNonZeros, 0, (m_outerSize)*sizeof(StorageIndex));
// pack all inner-vectors to the end of the pre-allocated space
// and allocate the entire free-space to the first inner-vector
StorageIndex end = convert_index(m_data.allocatedSize());
for(Index j=1; j<=m_outerSize; ++j)
m_outerIndex[j] = end;
}
else
{
// turn the matrix into non-compressed mode
m_innerNonZeros = static_cast<StorageIndex*>(std::malloc(m_outerSize * sizeof(StorageIndex)));
if(!m_innerNonZeros) internal::throw_std_bad_alloc();
for(Index j=0; j<m_outerSize; ++j)
m_innerNonZeros[j] = m_outerIndex[j+1]-m_outerIndex[j];
}
}
// check whether we can do a fast "push back" insertion
Index data_end = m_data.allocatedSize();
// First case: we are filling a new inner vector which is packed at the end.
// We assume that all remaining inner-vectors are also empty and packed to the end.
if(m_outerIndex[outer]==data_end)
{
eigen_internal_assert(m_innerNonZeros[outer]==0);
// pack previous empty inner-vectors to end of the used-space
// and allocate the entire free-space to the current inner-vector.
StorageIndex p = convert_index(m_data.size());
Index j = outer;
while(j>=0 && m_innerNonZeros[j]==0)
m_outerIndex[j--] = p;
// push back the new element
++m_innerNonZeros[outer];
m_data.append(Scalar(0), inner);
// check for reallocation
if(data_end != m_data.allocatedSize())
{
// m_data has been reallocated
// -> move remaining inner-vectors back to the end of the free-space
// so that the entire free-space is allocated to the current inner-vector.
eigen_internal_assert(data_end < m_data.allocatedSize());
StorageIndex new_end = convert_index(m_data.allocatedSize());
for(Index k=outer+1; k<=m_outerSize; ++k)
if(m_outerIndex[k]==data_end)
m_outerIndex[k] = new_end;
}
return m_data.value(p);
}
// Second case: the next inner-vector is packed to the end
// and the current inner-vector end match the used-space.
if(m_outerIndex[outer+1]==data_end && m_outerIndex[outer]+m_innerNonZeros[outer]==m_data.size())
{
eigen_internal_assert(outer+1==m_outerSize || m_innerNonZeros[outer+1]==0);
// add space for the new element
++m_innerNonZeros[outer];
m_data.resize(m_data.size()+1);
// check for reallocation
if(data_end != m_data.allocatedSize())
{
// m_data has been reallocated
// -> move remaining inner-vectors back to the end of the free-space
// so that the entire free-space is allocated to the current inner-vector.
eigen_internal_assert(data_end < m_data.allocatedSize());
StorageIndex new_end = convert_index(m_data.allocatedSize());
for(Index k=outer+1; k<=m_outerSize; ++k)
if(m_outerIndex[k]==data_end)
m_outerIndex[k] = new_end;
}
// and insert it at the right position (sorted insertion)
Index startId = m_outerIndex[outer];
Index p = m_outerIndex[outer]+m_innerNonZeros[outer]-1;
while ( (p > startId) && (m_data.index(p-1) > inner) )
{
m_data.index(p) = m_data.index(p-1);
m_data.value(p) = m_data.value(p-1);
--p;
}
m_data.index(p) = convert_index(inner);
return (m_data.value(p) = 0);
}
if(m_data.size() != m_data.allocatedSize())
{
// make sure the matrix is compatible to random un-compressed insertion:
m_data.resize(m_data.allocatedSize());
this->reserveInnerVectors(Array<StorageIndex,Dynamic,1>::Constant(m_outerSize, 2));
}
return insertUncompressed(row,col);
}
template<typename _Scalar, int _Options, typename _StorageIndex>
EIGEN_DONT_INLINE typename SparseMatrix<_Scalar,_Options,_StorageIndex>::Scalar& SparseMatrix<_Scalar,_Options,_StorageIndex>::insertUncompressed(Index row, Index col)
{
eigen_assert(!isCompressed());
const Index outer = IsRowMajor ? row : col;
const StorageIndex inner = convert_index(IsRowMajor ? col : row);
Index room = m_outerIndex[outer+1] - m_outerIndex[outer];
StorageIndex innerNNZ = m_innerNonZeros[outer];
if(innerNNZ>=room)
{
// this inner vector is full, we need to reallocate the whole buffer :(
reserve(SingletonVector(outer,std::max<StorageIndex>(2,innerNNZ)));
}
Index startId = m_outerIndex[outer];
Index p = startId + m_innerNonZeros[outer];
while ( (p > startId) && (m_data.index(p-1) > inner) )
{
m_data.index(p) = m_data.index(p-1);
m_data.value(p) = m_data.value(p-1);
--p;
}
eigen_assert((p<=startId || m_data.index(p-1)!=inner) && "you cannot insert an element that already exists, you must call coeffRef to this end");
m_innerNonZeros[outer]++;
m_data.index(p) = inner;
return (m_data.value(p) = Scalar(0));
}
template<typename _Scalar, int _Options, typename _StorageIndex>
EIGEN_DONT_INLINE typename SparseMatrix<_Scalar,_Options,_StorageIndex>::Scalar& SparseMatrix<_Scalar,_Options,_StorageIndex>::insertCompressed(Index row, Index col)
{
eigen_assert(isCompressed());
const Index outer = IsRowMajor ? row : col;
const Index inner = IsRowMajor ? col : row;
Index previousOuter = outer;
if (m_outerIndex[outer+1]==0)
{
// we start a new inner vector
while (previousOuter>=0 && m_outerIndex[previousOuter]==0)
{
m_outerIndex[previousOuter] = convert_index(m_data.size());
--previousOuter;
}
m_outerIndex[outer+1] = m_outerIndex[outer];
}
// here we have to handle the tricky case where the outerIndex array
// starts with: [ 0 0 0 0 0 1 ...] and we are inserted in, e.g.,
// the 2nd inner vector...
bool isLastVec = (!(previousOuter==-1 && m_data.size()!=0))
&& (std::size_t(m_outerIndex[outer+1]) == m_data.size());
std::size_t startId = m_outerIndex[outer];
// FIXME let's make sure sizeof(long int) == sizeof(std::size_t)
std::size_t p = m_outerIndex[outer+1];
++m_outerIndex[outer+1];
double reallocRatio = 1;
if (m_data.allocatedSize()<=m_data.size())
{
// if there is no preallocated memory, let's reserve a minimum of 32 elements
if (m_data.size()==0)
{
m_data.reserve(32);
}
else
{
// we need to reallocate the data, to reduce multiple reallocations
// we use a smart resize algorithm based on the current filling ratio
// in addition, we use double to avoid integers overflows
double nnzEstimate = double(m_outerIndex[outer])*double(m_outerSize)/double(outer+1);
reallocRatio = (nnzEstimate-double(m_data.size()))/double(m_data.size());
// furthermore we bound the realloc ratio to:
// 1) reduce multiple minor realloc when the matrix is almost filled
// 2) avoid to allocate too much memory when the matrix is almost empty
reallocRatio = (std::min)((std::max)(reallocRatio,1.5),8.);
}
}
m_data.resize(m_data.size()+1,reallocRatio);
if (!isLastVec)
{
if (previousOuter==-1)
{
// oops wrong guess.
// let's correct the outer offsets
for (Index k=0; k<=(outer+1); ++k)
m_outerIndex[k] = 0;
Index k=outer+1;
while(m_outerIndex[k]==0)
m_outerIndex[k++] = 1;
while (k<=m_outerSize && m_outerIndex[k]!=0)
m_outerIndex[k++]++;
p = 0;
--k;
k = m_outerIndex[k]-1;
while (k>0)
{
m_data.index(k) = m_data.index(k-1);
m_data.value(k) = m_data.value(k-1);
k--;
}
}
else
{
// we are not inserting into the last inner vec
// update outer indices:
Index j = outer+2;
while (j<=m_outerSize && m_outerIndex[j]!=0)
m_outerIndex[j++]++;
--j;
// shift data of last vecs:
Index k = m_outerIndex[j]-1;
while (k>=Index(p))
{
m_data.index(k) = m_data.index(k-1);
m_data.value(k) = m_data.value(k-1);
k--;
}
}
}
while ( (p > startId) && (m_data.index(p-1) > inner) )
{
m_data.index(p) = m_data.index(p-1);
m_data.value(p) = m_data.value(p-1);
--p;
}
m_data.index(p) = inner;
return (m_data.value(p) = Scalar(0));
}
namespace internal {
template<typename _Scalar, int _Options, typename _StorageIndex>
struct evaluator<SparseMatrix<_Scalar,_Options,_StorageIndex> >
: evaluator<SparseCompressedBase<SparseMatrix<_Scalar,_Options,_StorageIndex> > >
{
typedef evaluator<SparseCompressedBase<SparseMatrix<_Scalar,_Options,_StorageIndex> > > Base;
typedef SparseMatrix<_Scalar,_Options,_StorageIndex> SparseMatrixType;
evaluator() : Base() {}
explicit evaluator(const SparseMatrixType &mat) : Base(mat) {}
};
}
} // end namespace Eigen
#endif // EIGEN_SPARSEMATRIX_H
``` |
Geranoididae is a clade of extinct birds from the early to late Eocene and possibly early Oligocene of North America and Europe. These were mid-sized, long-legged flightless birds. Recent research shows that these birds may actually be palaeognaths related to ostriches.
Classification
It is rather unambiguous that geranoidids are either part of or stem representatives of Gruoidea, the clade that includes modern cranes, limpkins and trumpeters, though their precise relationship varies among studies, some recovering them as sister taxa to another clade of flightless ratite-like birds, the eogruiids. The most recent consensus appears to be that geranoidids are outside of Gruoidea, with eogruiids being more closely related to modern cranes. However, Mayr (2019) argued that close affinities between Geranoididae and the palaeognathous family Palaeotididae are at least as well supported as the classification of geranoidids into the Gruiformes.
Taxonomy
The exact number of genera and species are also somewhat controversial. For instance, a recent study recovers Geranoides as possibly synonymous with Palaeophasianus and Eogeranoides as possibly synonymous with Paragrus.
Paleobiology
Most geranoidids appear to have been flightless, with long legs and short wings, and presumably with herbivorous habits, giving them a profile and lifestyle similar to that of modern ratites. Most if not all of them were forest dwellers, a lifestyle also present in contemporaneous ratites such as Palaeotis and Remiornis. While competition and lack thereof between ratites and eogruiids has been examined extensively, niche partitioning between geranoidids and ratites has currently not, in spite of factors like geranoidids being most common in North America, where there are no ratites, or the fact that some European ratites were carnivorous.
Paleoecology and distribution
Geranoidids are most common in Eocene fossil sites in North America, particularly in the Willwood Formation were up to six species are known. Galligeranoides occurs in the Eocene of France in association with another flightless bird, Gastornis, potentially indicating that geranoidids took advantage of land bridges to arrive to Europe. However, Mayr (2019) considered Galligeranoides to be a member of Palaeognathae closely related to Palaeotis, and formally transferred Galligeranoides from the family Geranoididae to the family Palaeotididae. This transfer restricts the fossil record of the family Geranoididae to North America.
References
Prehistoric bird families
Extinct flightless birds
Prehistoric birds of North America
Struthioniformes
Paleogene birds of North America
Prehistoric birds of Europe |
Immersion baptism (also known as baptism by immersion or baptism by submersion) is a method of baptism that is distinguished from baptism by affusion (pouring) and by aspersion (sprinkling), sometimes without specifying whether the immersion is total or partial, but very commonly with the indication that the person baptized is immersed in water completely. The term is also, though less commonly, applied exclusively to modes of baptism that involve only partial immersion (see Terminology, below).
Terminology
Baptism by immersion is understood by some to imply submersion of the whole body beneath the surface of the water.
Others speak of baptismal immersion as either complete or partial, and do not find it tautologous to describe a particular form of immersion baptism as "full" or "total".
Still others use the term "immersion baptism" to mean a merely partial immersion by dipping the head in the water or by pouring water over the head of a person standing in a baptismal pool, and use instead for baptism that involves total immersion of the body beneath the water the term "submersion baptism".
Early Christianity
Scholars generally agree that the early church baptized by immersion. It also used other forms. Immersion was probably the norm, but at various times and places immersion, whether full or partial, and also affusion were probably in use. Baptism of the sick or dying was usually by means other than even partial immersion and was still considered valid.
Some writers speak of early Christians baptizing by total immersion (i.e., submerging the person being baptized), or say only that total immersion was preferred. Others speak of early Christians as baptizing either by submersion or by immersion. In one form of early Christian baptism, the candidate stood in water and water was poured over the upper body, and the Oxford Dictionary of the Christian Church says that at least from the 2nd century baptism was administered by a method "whereby part of the candidate's body was submerged in the baptismal water which was poured over the remainder".
Archaeological evidence
William Sanford La Sor, Lothar Heiser, Jean-Charles Picard, Malka Ben Pechat, and Everett Ferguson agree that early Christian baptism was normally by total immersion. Sanford La Sor (1987) considers it likely that the archaeological evidence favours total immersion. Lothar Heiser (1986), likewise understands the literary and pictorial evidence to indicate total immersion. Jean-Charles Picard (1989), reaches the same conclusion, and so does Malka Ben Pechat (1989). The study by Everett Ferguson (2009) supports the view of La Sor, Heiser, Picard, and Pechat. Frank K. Flinn also says that the immersion was total, saying that the preference of the Early Church was total immersion in a stream or the sea or, if these were not available, in a fountain or bath-sized tank,
Commenting on early church practice, other reference works speak of immersion without specifying whether it was total or partial. A recent Bible encyclopedia speaks of the "consensus of scholarly opinion" that the baptismal practice of John the Baptist and the apostles was by immersion. A standard Bible dictionary says that baptism was normally by immersion. Among other sources, Old says that immersion (though not the only form), was normally used, Grimes says "There is little doubt that early Christian baptism was adult baptism by immersion.", Howard Marshall says that immersion was the general rule, but affusion and even sprinkling were also practiced, since "archaeological evidence supports the view that in some areas Christian baptism was administered by affusion". His presentation of this view has been described by Porter and Cross as "a compelling argument". Laurie Guy says immersion was probably the norm, but that at various times and places full immersion, partial immersion and affusion were probably in use. Tischler says that total immersion seems to have been most commonly used. Stander and Louw argue that immersion was the prevailing practice of the Early Church. Grenz says that the New Testament does not state specifically what action the baptizer did to the person baptized, when both were in the water, but adds: "Nevertheless, we conclude that of the three modes immersion carries the strongest case – exegetically, historically, and theologically. Therefore, under normal circumstances it ought to be the preferred, even the sole, practice of the church." Most scholars agree that immersion was the practice of the New Testament church.
The Oxford Dictionary of the Bible (2004) says "Archaeological evidence from the early centuries shows that baptism was sometimes administered by submersion or immersion… but also by affusion from a vessel when water was poured on the candidate's head…"
The Cambridge History of Christianity (2006) also concludes from the archaeological evidence that pouring water three times over the head was a frequent arrangement.
Robin Jensen writes: "Historians have sometimes assumed that baptism was usually accomplished by full immersion – or submersion – of the body (dunking). However, the archaeological and iconographic evidence is ambiguous on this point. Many – if not most – surviving baptismal fonts are too shallow to have allowed submersion. In addition, a significant number of depictions show baptismal water being poured over the candidate's head (affusion), either from a waterfall, an orb or some kind of liturgical vessel." Eerdman's Dictionary of the Bible, also casts doubt on "the usual assumption that all NT baptisms were by immersion", stating that some early baptisteries were deep enough to stand in but not broad enough to lie down in, and mentioning that ancient representation of Christ at his baptism show him standing in waist-deep water. The immersion used by early Christians in baptizing "need not have meant full submersion in the water" and, while it may have been normal practice, it was not seen as a necessary mode of baptism, so that other modes also may have been used. Submersion, as opposed to partial immersion, may even have been a minority practice in early Christianity.
Earliest description of Christian baptism outside the New Testament
The Didache or Teaching of the Twelve Apostles, an anonymous book of 16 short chapters, is probably the earliest known written instructions, outside of the Bible, for administering baptism. The first version of it was written . The second, with insertions and additions, was written . This work, rediscovered in the 19th century, provides a unique look at Christianity in the Apostolic Age. Its instructions on baptism are as follows:
Commentaries, including those that distinguish immersion from submersion, typically understand that the Didache indicates a preference for baptizing by immersion, in "living water" (i.e., running water, seen as symbolic of life). Barclay observes that the Didache shows that baptism in the early church was by total immersion, if possible, Barton describes the immersion of the Didache as "ideally by total immersion", and Welch says it was by "complete immersion". In cases of insufficient water it permits pouring (affusion), which it differentiates from immersion, using the Greek word ekcheō, ("pour", in the English translation) and not baptizō ("baptize", in the English translation), but which it still considers to be a form of baptism (baptisma).
Martin and Davids say the Didache envisages "some form of immersion", and the Oxford Dictionary of the Christian Church refers its readers to its entry on immersion, which it distinguishes from submersion and affusion.
The Didache gives "the first explicit reference to baptism by pouring, although the New Testament does not exclude the possibility of this practice" Brownson says that the Didache does not state whether pouring or immersion was recommended when using running water, and Sinclair B. Ferguson argues that the only mode that the Didache mentions is affusion. Lane says that "it is probable that immersion was in fact the normal practice of baptism in the early church, but it was not regarded as an important issue", and states that the Didache does not suggest that the pouring of water was any less valid than immersion.
The Jewish-Christian sect known as the Ebionites were known to immerse themselves in a ritual bath (Hebrew: mikveh) while they were fully clothed.
New Testament studies
Christian theologians such as John Piper use several parts of the New Testament to support full immersion (submersion) as the intended symbol:
Piper asserts that baptism refers to the physical lowering into the water and rising in faith in part because of the reflection of this symbol in which says "having been buried with him in baptism and raised with him through your faith in the power of God, who raised him from the dead through the glory of the Father, so we too might walk in newness of life." Others hold that there is no evidence in the New Testament that any one mode of baptism was used.
Criticism of the total immersion (submersion) view
Grammatical criticism
As criticism of the claim that, in , which is the only reference in the New Testament to Christian baptism being administered in the open, the actions of "going down into the water" and "coming up out of the water" indicate that this baptism was by immersion, it is pointed out that "going down into" and "coming up out of" a river or a store of still water, actions there ascribed to both the baptizer and the baptized, do not necessarily involve immersion in the water. In the nineteenth century, anti-immersionist Rev. W. A. McKay wrote a polemic work against immersion baptism, arguing that it was a theological invention of the Roman Catholic Church. Differentiating between immersion and affusion, McKay held that βαπτίζω referred to affusion (which McKay understood as standing in water and having water poured over the head), as opposed to immersion. Challenging immersion baptism, he wrote:
In the same passage the act of baptizing is distinguished from the going down into the water: "They both went down into the water, Philip and the eunuch, and he baptized him. And when they came up out of the water…"
As McKay and others also pointed out, the Greek preposition εἰς, here translated as "into", is the same as is used when Peter is told to go to the sea and take the first fish that came up () and in other passages where it obviously did not imply entry of the kind that submersion involves. In fact, in the same chapter 8 of the Acts of the Apostles, the preposition εἰς appears 11 times, but only once is it commonly translated as "into"; in the other verses in which it appears it is best translated as "to". The same ambiguity pertains to the preposition ἐκ.
Lexical criticism
John Calvin (1509–1564) wrote that "it is evident that the term baptise means to immerse, and that this was the form used by the primitive Church", but in the same context (Institutes of the Christian Religion IV, xv, 19), using the same verb "immerse", but indicating that it does not necessarily mean immersing "wholly", he also wrote: "Whether the person who is baptised be wholly immersed, and whether thrice or once, or whether water be only poured or sprinkled upon him, is of no importance; Churches ought to be left at liberty in this respect, to act according to the difference of countries." Modern, professional lexicography defines βαπτίζω as dip, plunge or immerse, while giving examples of its use for merely partial immersion.
Syntactical criticism
and are two instances of New Testament uses of the verb baptizo outside the context of Christian baptism. One speaks of how the Pharisees do not eat unless they "wash their hands" thoroughly (nipto, the ordinary word for washing something), and, after coming from the market place, do not eat unless they "wash themselves" (literally, "baptize themselves", passive or middle voice of baptizo). The other tells how a Pharisee, at whose house Jesus ate, "was astonished to see that he did not first "wash himself" (literally, "baptize himself", aorist passive of baptizo) before dinner". Some commentaries claim that these two passages show that the word baptizo in the New Testament cannot be assumed to have the meaning "immerse".
In the first of the two passages, it is actually the hands that are specifically identified as "washed" (), not the entire persons, who are described as having (literally) "baptized themselves" – ). Zodhiates identifies the meaning of baptizo here as 'immerse', even if not totally ("wash part of the body such as the hands"). but the word is rendered "wash themselves" or "purify themselves", not "baptize themselves" or "immerse themselves", by modern English Bible translations, professional commentaries, and translation guides. For the same reason, the Liddell-Scott-Jones Greek–English Lexicon (1996) cites the other passage () as an instance of the use of the word baptizo to mean "perform ablutions", not "baptize", "dip", "plunge", "immerse", and the standard lexicon of Bauer and Danker treats it as an instance of a derived meaning, "wash ceremonially for the purpose of purification", distinct from the basic meaning ("immerse") of the verb baptizo, in line with the view that cannot refer to a total immersion of the person. References to the cleaning of vessels which use baptizo also refer to immersion,.
Hermeneutical criticism
The burial symbolism of and is seen by some Christians as a reference not to the manner of baptism in water but to "a spiritual death, burial, resurrection, and new life".
Views within Christianity
Forms of baptismal immersion differ widely between Christian groups. In the view of many, baptismal immersion can be either complete or partial, and adjectives such as "full", and "partial" serve to differentiate between immersion of the whole body or only of a part.
Eastern Churches
The Eastern Orthodox hold that baptism has always been by immersion and it is not proper to perform baptism by way of sprinkling of water. The immersion is done three times and is referred to as "total" or "full". Modern practice may vary within the Eastern Rite; Everett Ferguson cites Lothar Heiser as acknowledging: "In the present practice of infant baptism in the Greek church the priest holds the child as far under the water as possible and scoops water over the head so as to be fully covered with water", and the Oxford Dictionary of the Christian Church states that the rite "whereby part of the candidate's body was submerged in the baptismal water which was poured over the remainder ... is still found in the Eastern Church". Eastern Orthodox consider the form of baptism in which the person is placed in water as normative; only in exceptional circumstances, such as if a child is in imminent danger of death, may they baptize by affusion or, since there is always some moisture in air, perform "air baptism".
However, this radical stance appears to be nowadays increasingly nuanced in practice in several Orthodox Churches, with baptisms by pouring outside of any emergency carried out routinely for example in the Serbian Orthodox Church or occasionally by the Russian Orthodox Church, including Patriarch Kirill of Moscow himself, out of mere practical concerns.
Armenian Baptists
Baptism by partial immersion, a mode of baptism that, according to the Oxford Dictionary of the Christian Church is still found in the Eastern Church, is also the form presented in the Key of Truth, the text described as the manual of the old Armenian Baptists, which lays down that the person to be baptized "shall come on his knees into the midst of the water" and there make a profession of faith to "the elect one", who "instantly takes the water into his hands, and ... shall directly or indirectly empty out the water over the head".
Saint Thomas Christians
The Saint Thomas Christians, who trace their origin to Thomas the Apostle, used to practise immersion baptism in baptismal font. Presently, pouring is also practiced in Syro-Malabar Church along with immersion.
Roman Catholicism
According to the Catechism of the Catholic Church,
"Baptism is performed in the most expressive way by triple immersion in the baptismal water. However, from ancient times it has also been able to be conferred by pouring the water three times over the candidate's head"
Protestantism
Anabaptists
Anabaptists ("re-baptizers") practice adult baptism, or "believer's baptism".
Anabaptists were given that name because of performing baptism on people whom others, but not the Anabaptists, considered to be already baptized. They did not accept infant baptism as true baptism. Anabaptists perform baptisms indoors in a baptismal font, baptistry, or outdoors in a creek or river. The mode of believer's baptism for most Anabaptists is by pouring (which is normative in Mennonite, Amish and Hutterite churches). Some, however, such as the Mennonite Brethren Church, Schwarzenau Brethren and River Brethren use immersion. The Schwarzenau Brethren, an Anabaptist denomination, teach that the ordinance "be trine immersion, that is, dipping three times forward in the name of the Father, the Son, and the Holy Spirit." The three plunges in the forward position, for each person of the Holy Trinity, also represent the "three days of Christ's burial." Immersion baptism is done falling forward by the Schwarzenau Brethren because "the Bible says Jesus bowed his head (letting it fall forward) and died. Baptism represents a dying of the old, sinful self."
Conservative Mennonite Anabaptists count baptism to be one of the seven ordinances. In Anabaptist theology, baptism is a part of the process of salvation. For Anabaptists, "believer's baptism consists of three parts, the Spirit, the water, and the blood—these three witnesses on earth." According to Anabaptist theology: (1) In believer's baptism, the Holy Spirit witnesses the candidate entering into a covenant with God. (2) God, in believer's baptism, "grants a baptized believer the water of baptism as a sign of His covenant with them—that such a one indicates and publicly confesses that he wants to live in true obedience towards God and fellow believers with a blameless life." (3) Integral to believer's baptism is the candidate's mission to witness to the world even unto martyrdom, echoing Jesus' words that “they would be baptized with His baptism, witnessing to the world when their blood was spilt.”
Baptists
Immersion baptism, understood as demanding total submersion of the body, is required by Baptists, as enunciated in the 1689 Baptist Catechism: "Baptism is rightly administered by immersion, or dipping the whole body of the person in water, in the name of the Father, and of the Son, and of the Holy Spirit", indicating that the whole body must be immersed, not just the head.
Baptism, they believe, does not accomplish anything in itself, but is an outward personal sign or testimony that the person's sins have already been washed away by the blood of Christ shed on the cross. It is considered a covenantal act, signifying entrance into the New Covenant of Christ.
Disciples of Christ and Churches of Christ
Baptism by submersion is practised by the Christian Church (Disciples of Christ), but most of them do not suggest rebaptism of those who have undergone a baptism of a different Christian tradition. Baptism in Churches of Christ, which also have roots in the Restoration Movement, is performed only by bodily immersion. This is based on their understanding of the meaning of the word baptizo as used in the New Testament, a belief that it more closely conforms to the death, burial and resurrection of Jesus, and that historically immersion was the mode used in the 1st century, and that pouring and sprinkling later emerged as secondary modes when immersion was not possible.
Pentecostalism
Pentecostalism, which emerged around 1906, practice the believer's baptism by full-immersion.
Seventh-day Adventists
Seventh-day Adventists believe that "baptism symbolizes dying to self and coming alive in Jesus." Seventh-day Adventists teach that it symbolizes and declares a member's new faith in Christ and trust in His forgiveness. Buried in the water, the member arises to a new life in Jesus, empowered by the Holy Spirit. Adventists practice full immersion baptism. In full immersion, baptism is representative of a death to self and a rise into new life in Christ and a cleansing from sin. It is a public declaration of a changed life, a relationship with Jesus, and a desire to follow Him fully.
Sabbath Rest Adventists
Sabbath Rest Adventists adhere to full immersion in baptism as a symbol of the death of "the old man".
Optional immersion baptism
Major Protestant groups in which baptism by total or partial immersion is optional, although not typical, include Anglicans, Lutherans, Presbyterians, Methodists, and the Church of the Nazarene.
Other denominations
The Church of Jesus Christ of Latter-day Saints
Official explanations concerning baptism state: “we are baptized by being lowered under water and raised back up by a person who has authority from God to do so. This action symbolizes Jesus Christ's death, burial, and resurrection, and it also represents the end of our old lives and beginning a new life as His disciples.” Doctrine and Covenants 20:72-74) gives the authoritative declaration on mode:72 Baptism is to be administered in the following manner unto all those who repent–
73 The person who is called of God and has authority from Jesus Christ to baptize, shall go down into the water with the person who has presented himself or herself for baptism, and shall say, calling him or her by name: Having been commissioned of Jesus Christ, I baptize you in the name of the Father, and of the Son, and of the Holy Ghost. Amen.
74 Then shall he immerse him or her in the water, and come forth again out of the water.Baptism by immersion is the only way to be completely accepted as a member, either converted to or raised in the church; no other form is accepted in The Church of Jesus Christ of Latter-day Saints. Baptism for the dead is also performed in their temples, to provide this ordinance to those who did not have the opportunity in life, or were physically unable, post mortem, for them to accept as they will. It is performed the same way there.
The Community of Christ
The Community of Christ, formerly known as the Reorganized Church of Jesus Christ of Latter Day Saints, practices baptism by submersion.
Jehovah's Witnesses
Complete immersion of the person in water is considered necessary by Jehovah's Witnesses.
Mandaean baptism
Mandaeans revere John the Baptist and practice frequent baptism (masbuta) as a ritual of purification, not of initiation. They are possibly the earliest people to practice baptism. Mandaeans undergo baptism on Sundays (Habshaba), wearing a white sacral robe (rasta). Baptism for Mandaeans consists of a triple full immersion in water, a triple signing of the forehead with water and a triple drinking of water. The priest (rabbi) then removes a ring made of myrtle worn by the baptized and places it on their forehead. This is then followed by a handshake (kushta- hand of truth) with the priest. The final blessing involves the priest laying his right hand on the baptized person's head. Living water (fresh, natural, flowing water) is a requirement for baptism, therefore can only take place in rivers. All rivers are named Jordan (Yardena) and are believed to be nourished by the World of Light. By the river bank, a Mandaean's forehead is anointed with sesame oil (misha) and partakes in a communion of bread (pihta) and water. Baptism for Mandaeans allows for salvation by connecting with the World of Light and for forgiveness of sins.
Sethian Five Seals
While some scholars consider the Five Seals mentioned in Sethian Gnostic texts, to be literary symbolism rather than an actual religious ritual, Birger A. Pearson believes that the Five Seals refer to an actual ritual in which the initiate was ritually immersed in water five times. Pearson also finds many parallels between the Sethian ritual of the Five Seals and the Mandaean baptismal ritual of masbuta.
Immersion in other religious groups
In Judaism, self-administered immersion is used for ritual cleansing, and as a rite of passage for proselytes.
See also
Masbuta
Ritual purification
References
External links
WELS Question & Answers: Baptism by Immersion (a Confessional Lutheran perspective)
John Benton Briney, Joseph L. Tucker, The form of baptism: an argument designed to prove conclusively that immersion is the only baptism authorized by the Bible (Christian Publishing Company: St. Louis, MO, 1892)
David A. Banks, The Church and Baptism – Modes and Symbolism
C.F. Rogers, Baptism and Christian Archaeology (Gorgias Books reprint 2006 )
Eastern Orthodox article on baptism
Baptism
Christian terminology
Mandaean rituals |
Race the Train () is an annual cross country running event that takes place in Tywyn, Mid Wales. The race is organised by Tywyn Rotary Club, and attracts runners from all over the world. In the main event, runners compete to beat a steam train on the preserved Talyllyn Railway over a distance of . The event has featured both in local and national media, including the BBC's Countryfile programme.
History
The event was the idea of local dentist, Godfrey Worsey, and was first run in 1984 with around 48 runners. The following year, this had increased to 250 runners. In 2008, there were 822 runners in the main race; the winner completing the course in just over 1 hour 18 minutes, a course record.The time beat the previous record, set in 2005:
Route
The full race of is from Tywyn to Abergynolwyn and back. The course is mostly over public footpaths and local privately owned farmland, with the permission of the landowners, though the first and last sections are on public roads. Although only the elite runners stay ahead of the train for the full distance, the train stops in various locations to take on water, pass other trains or to run round at Abergynolwyn, allowing other runners to overtake.
Additionally, there are shorter races in the morning, as follows:
Quarry Challenge - from Quarry Siding Halt to Tywyn.
Dolgoch Challenge - from to Tywyn.
Tynllwynhen Challenge - from Tynllwynhen Halt to Tywyn.
Toddlers trot for children round the perimeter of the race field.
Event under threat
In March 2009, it was announced that the August race may be the last, unless more volunteers can be found to help organise the event. Due to a strong response from the local community, these fears have been allayed and it was announced in the 2009 Race Programme, that the event's future was secured for a number of years.
References
External links
Talyllyn Railway website
Race the Train website
Talyllyn Railway
Athletics competitions in Wales
Cross country running competitions
Cross country running in the United Kingdom
Annual events in Wales
Annual sporting events in the United Kingdom |
```markdown
TSG036 - Controller logs
========================
Get the last ‘n’ hours of controller logs.
Steps
-----
### Parameters```
```python
import re
from datetime import datetime
tail_lines = 500
# The controller log files are kept in a yyyy-mm-dd folder structure
#
d = datetime.utcnow()
date = "{0}-{1:02d}-{2:02d}".format(d.year, d.month, d.day)
folder = f"/var/log/controller/{date}"
pod = None # All
container = 'controller'
log_files = [ f'{folder}/controller.log', f'{folder}/kube.log', f'{folder}/controller.out', f'{folder}/access.log' ]
expressions_to_analyze = [
re.compile(".{26} WARN "),
re.compile(".{26} ERROR ")
]
print("Log files to get:")
print(log_files)
```
```markdown
### Instantiate Kubernetes client```
```python
# Instantiate the Python Kubernetes client into 'api' variable
import os
try:
from kubernetes import client, config
from kubernetes.stream import stream
if "KUBERNETES_SERVICE_PORT" in os.environ and "KUBERNETES_SERVICE_HOST" in os.environ:
config.load_incluster_config()
else:
try:
config.load_kube_config()
except:
display(Markdown(f'HINT: Use [TSG118 - Configure Kubernetes config](../repair/tsg118-configure-kube-config.ipynb) to resolve this issue.'))
raise
api = client.CoreV1Api()
print('Kubernetes client instantiated')
except ImportError:
from IPython.display import Markdown
display(Markdown(f'HINT: Use [SOP059 - Install Kubernetes Python module](../install/sop059-install-kubernetes-module.ipynb) to resolve this issue.'))
raise
```
```markdown
### Get the namespace for the big data cluster
Get the namespace of the Big Data Cluster from the Kuberenetes API.
**NOTE:**
If there is more than one Big Data Cluster in the target Kubernetes
cluster, then either:
- set \[0\] to the correct value for the big data cluster.
- set the environment variable AZDATA\_NAMESPACE, before starting
Azure Data Studio.```
```python
# Place Kubernetes namespace name for BDC into 'namespace' variable
if "AZDATA_NAMESPACE" in os.environ:
namespace = os.environ["AZDATA_NAMESPACE"]
else:
try:
namespace = api.list_namespace(label_selector='MSSQL_CLUSTER').items[0].metadata.name
except IndexError:
from IPython.display import Markdown
display(Markdown(f'HINT: Use [TSG081 - Get namespaces (Kubernetes)](../monitor-k8s/tsg081-get-kubernetes-namespaces.ipynb) to resolve this issue.'))
display(Markdown(f'HINT: Use [TSG010 - Get configuration contexts](../monitor-k8s/tsg010-get-kubernetes-contexts.ipynb) to resolve this issue.'))
display(Markdown(f'HINT: Use [SOP011 - Set kubernetes configuration context](../common/sop011-set-kubernetes-context.ipynb) to resolve this issue.'))
raise
print('The kubernetes namespace for your big data cluster is: ' + namespace)
```
```markdown
### Get tail for log```
```python
# Display the last 'tail_lines' of files in 'log_files' list
pods = api.list_namespaced_pod(namespace)
entries_for_analysis = []
for p in pods.items:
if pod is None or p.metadata.name == pod:
for c in p.spec.containers:
if container is None or c.name == container:
for log_file in log_files:
print (f"- LOGS: '{log_file}' for CONTAINER: '{c.name}' in POD: '{p.metadata.name}'")
try:
output = stream(api.connect_get_namespaced_pod_exec, p.metadata.name, namespace, command=['/bin/sh', '-c', f'tail -n {tail_lines} {log_file}'], container=c.name, stderr=True, stdout=True)
except Exception:
print (f"FAILED to get LOGS for CONTAINER: {c.name} in POD: {p.metadata.name}")
else:
for line in output.split('
'):
for expression in expressions_to_analyze:
if expression.match(line):
entries_for_analysis.append(line)
print(line)
print("")
print(f"{len(entries_for_analysis)} log entries found for further analysis.")
```
```markdown
### Analyze log entries and suggest relevant Troubleshooting Guides```
```python
# Analyze log entries and suggest further relevant troubleshooting guides
from IPython.display import Markdown
import os
import json
import requests
import ipykernel
import datetime
from urllib.parse import urljoin
from notebook import notebookapp
def get_notebook_name():
"""Return the full path of the jupyter notebook. Some runtimes (e.g. ADS)
have the kernel_id in the filename of the connection file. If so, the
notebook name at runtime can be determined using `list_running_servers`.
Other runtimes (e.g. azdata) do not have the kernel_id in the filename of
the connection file, therefore we are unable to establish the filename
"""
connection_file = os.path.basename(ipykernel.get_connection_file())
# If the runtime has the kernel_id in the connection filename, use it to
# get the real notebook name at runtime, otherwise, use the notebook
# filename from build time.
try:
kernel_id = connection_file.split('-', 1)[1].split('.')[0]
except:
pass
else:
for servers in list(notebookapp.list_running_servers()):
try:
response = requests.get(urljoin(servers['url'], 'api/sessions'), params={'token': servers.get('token', '')}, timeout=.01)
except:
pass
else:
for nn in json.loads(response.text):
if nn['kernel']['id'] == kernel_id:
return nn['path']
def load_json(filename):
with open(filename, encoding="utf8") as json_file:
return json.load(json_file)
def get_notebook_rules():
"""Load the notebook rules from the metadata of this notebook (in the .ipynb file)"""
file_name = get_notebook_name()
if file_name == None:
return None
else:
j = load_json(file_name)
if "azdata" not in j["metadata"] or \
"expert" not in j["metadata"]["azdata"] or \
"log_analyzer_rules" not in j["metadata"]["azdata"]["expert"]:
return []
else:
return j["metadata"]["azdata"]["expert"]["log_analyzer_rules"]
rules = get_notebook_rules()
if rules == None:
print("")
print(f"Log Analysis only available when run in Azure Data Studio. Not available when run in azdata.")
else:
print(f"Applying the following {len(rules)} rules to {len(entries_for_analysis)} log entries for analysis, looking for HINTs to further troubleshooting.")
print(rules)
hints = 0
if len(rules) > 0:
for entry in entries_for_analysis:
for rule in rules:
if entry.find(rule[0]) != -1:
print (entry)
display(Markdown(f'HINT: Use [{rule[2]}]({rule[3]}) to resolve this issue.'))
hints = hints + 1
print("")
print(f"{len(entries_for_analysis)} log entries analyzed (using {len(rules)} rules). {hints} further troubleshooting hints made inline.")
```
```python
print('Notebook execution complete.')
```
```markdown
Related
-------
- [TSG027 - Observe cluster
deployment](../diagnose/tsg027-observe-bdc-create.ipynb)``` |
Charles I of England left Oxford on 27 April 1646 and travelled by a circuitous route through enemy-held territory to arrive at the Scottish army camp located close to Southwell near Newark-on-Trent on 5 May 1646. He undertook this journey because military Royalism was all but defeated. It was only a matter of days before Oxford (the Royalist First English Civil War capital) would be fully invested and would fall to the English Parliamentarian New Model Army commanded by Lord General Thomas Fairfax (see Third Siege of Oxford). Once fully invested it was unlikely that Charles would be able to leave Oxford without being captured by soldiers of the New Model Army. Charles had been in contact with the various parties that were fielding armies against him seeking a political compromise. In late April he thought that the Scottish Presbyterian party were offering him the most acceptable terms, but to gain their protection and finalise an agreement Charles had to travel to the Scottish army that was besieging the Royalist-held town of Newark. When he had arrived there he was put under close guard in Kelham House.
Prelude
Towards the end of the First English Civil War, Charles I had continued to contact the parties that were opposed to him, hoping to split them apart and gain politically what he was losing militarily.
When it looked likely that the Royalists (Cavaliers) would lose the English Civil War, the Scots, who were then allied with the English Parliamentarians (Roundheads), looked to Cardinal Mazarin, by then the chief minister of France, for help in securing Charles I's position as king, but on terms acceptable to the Scots. In response, Mazarin appointed Jean de Montreuil (or Montereul) as French resident in Scotland. He was to act as a go-between and in doing so he was able to inform Cardinal Mazarin of the political machinations of the various parties in the civil war.
Montreuil arrived in London in August 1645. Once there he opened a dialogue with English Presbyterians such as the Earl of Holland who were sympathetic to the Scots who too were Presbyterians and formally allied with the Roundheads through the Solemn League and Covenant, but which was disliked by non-Presbyterian Roundheads such as Oliver Cromwell and other religious Independents. There were Scottish commissioners in London who were looking after Scottish interests in the alliance and during talks with them and English Presbyterians, the idea arose that if Charles I were to place himself under the protection of the Scottish army, then the Presbyterian party could advance their interests.
Montreuil strived to extract from the Scottish Commissioners to the Committee of Both Kingdoms (the body set up to oversee the Solemn League and Covenant)—most of whom were usually located in London—the most moderate terms upon which they would receive Charles: accept three proposition touching on the Church, the militia and Ireland, and sign the Covenant. If Charles accepted those terms, they would intercede with English Parliament and banish only five or six prominent Royalists. Montreuil told Sir Robert Moray—who was delegated to act for the Earl of Loudoun (High Chancellor of Scotland) in his absence from London and continued to be his delegate upon his return—that Charles would not accept those terms; he obtain a modified Scottish offer on 16 March from Sir Robert Moray, in which the Scots would instead be satisfied with a promise from Charles to accept the church settlement which had already been made by the English and Scottish parliaments, and that Charles was to express his general agreement of the Covenant in letters to the two parliaments in which he accepted the church settlement.
However, the late Victorian historian S. R. Gardiner suggests that Montreuil did not have a full understanding of Charles' mind. He would promise anything, providing the wording could be so construed by Charles that he could disregard it in the future, and consequently Charles would at this juncture never agree to wording that was an unambiguous legal contract.
On 17 March, Montreuil set out for Oxford, the King's headquarters. Along with the offer, he carried intelligence that the English Presbyterians would field an army of 25,000 men to support the Scots if the Independents in the New Model Army tried to oppose the reconciliation.
Gardiner wrote:
Since he had received Montreuil's communication, the Scots had been out of favour with him, and on 23 March, upon the arrival of the bad news of the defeat of the last Royalist field army at the Battle of Stow-on-the-Wold, he despatched a request to the English Parliament for permission to return to Westminster, on the understanding that an act of oblivion was to be passed and all sequestrations to be reversed. Even had this offer been straightforward, it implied that the central achievement of his opponents in the winning the war should be set aside, and that Charles should be allowed to step back on the throne, free to refuse to assent to any legislation which displeased him. This proposition was rejected by the English Parliament and the Scots. All Charles had achieved by this proposal was to reconcile the factions opposed to him, so thwarting his tactics of division.
On 27 March, Montreuil, in the king's name, pressured the Scots for a reply. They informed Montreuil that they would not accept Charles' terms, but—without putting anything in writing—if he were to hand himself over to the Scottish army, they would protect his honour and conscience.
On 1 April, Montreuil wrote to Charles, and engagements were exchanged between them. The French Agent promised
Charles for his part promised to take no companions with him except his two nephews and John Ashburnham.
On 3 April, Montreuil left London for Southwell (a town near the camp of the Scottish army which, along with a contingent of the New Model Army, was besieging Newark-on-Trent), arriving at the King's Arms Inn (now the Saracen's Head). Montreuil was delegated by Charles to arrange terms. Montreuil took up lodgings in the large apartment (divided into a dining-room and bedroom) of the inn to the left of the gateway, while the Scots, possibly on the instigation of Edward Cludd, a leading Parliamentarian, made the archbishop's palace their headquarters. The hostelry is an ancient one, being mentioned in deeds as far back as 1396. The French Agent is described by Clarendon as a young gentleman of parts very equal to the trust reposed in him, and not inclined to be made use of in ordinary dissimulation and cozenage. On visiting the Commissioners, he found them apparently pleased that the King desired to come to them, and accordingly drew up a document, of which he said they approved, assuring the King of full protection and assistance. Arrangements were to be made for the Scottish horse to receive Charles at Market Harborough, but not feeling sure of the compact being kept, Charles asked Michael Hudson (a chaplain and during the war a military scout) to go in his stead.
Hudson went to Harborough, and finding no troops there, proceeded to Southwell, where Montreuil told him that the Scots were fearful of creating jealousy with Parliament. In no hopeful mood, and with no tidings except that Scots had promised to send a party of horse to Burton upon Trent, Hudson returned to Oxford, where further letters from Montreuil were anxiously awaited. In one of these, dated Southwell, 10 April, these words occur:
Charles, however, felt he had no alternative. Ashburnham, who was in constant attendance upon him, said in a letter that the king felt he could not refrain from trying to reach the Scots, "first on account of his low condition in point of force, and the strong necessity he is brought into, not being able to supply his table. Secondly, because of the little hope he had of succour, and the certainty of being blocked up". Charles explained the motives by which he was animated in a letter to the Marquis of Ormond, in which he stated that having sent many gracious messages to Parliament without effect, and having received very good security that he and his friends would be safe with the Scots, who would assist with their forces in procuring peace, he had resolved to put himself to the hazard of passing into the Scots army now before Newark. This letter is dated Oxford, 13 April 1646; on 25 April, a letter was received from Montreuil, stating that the disposition of the Scotch commanders was now all that could be desired. The King left secretly on 26 April, accompanied only by John Ashburnham and Michael Hudson, the latter being familiar with the country and able to conduct the little party by the safest route.
Journey
At midnight on 27 April, Charles came with the Duke of Richmond to Ashburnham's apartment. Scissors were used to cut the King's tresses and lovelock, and the peak of his beard was clipped off, so that he no longer looked like the man familiar to any who have seen his portraits by Anthony van Dyck.
Hudson had persuaded the King that it was not possible to travel directly from Oxford to the Scottish camp outside Newark-on-Trent, and that it would be better to go by a circuitous route, first towards London, then north-east, before turning north-west towards Newark. As a cover for part of the journey, Hudson had an old pass for a captain who was ostensibly to go to London to discuss his composition with Parliament. Dressed in a scarlet cloak, Hudson represented the military bearer.
At 2:00 am, Hudson went to the governor of Oxford, Sir Thomas Glemham, who brought the keys to the gates. The clock struck three as they crossed the Magdalen Bridge. As they approached the start of the London-road, the Governor took his leave with a "Farewell, Harry"—for to that name Charles was now to answer. He was riding disguised as Ashburnham's servant, wearing a montero cap and carrying a cloak bag.
Charles was still hoping to hear from parties in London who would be willing to treat with him, but nothing was heard from that direction. Arriving at Hillingdon, at that time a village near Uxbridge and now in Greater London, the party dallied at the inn for several hours, debating on their future course. Three options were considered. The first was to continue to London, which was ruled out because there had been no word from there. The second option was to head north to the Scots, and a third option was to head for a port and seek a ship for the continent. They chose to head towards King's Lynn in Norfolk, which if it proved difficult to reach, or if no ships were available, left the Scottish option still open.
They proceeded on their way amidst risks and dangers. They passed through fourteen garrisons of the enemy, and in trying to avoid detection, the party had many narrow escapes.
On 30 April, Charles and Ashburnham decided to halt at Downham Market, in Norfolk, while Hudson went on to Southwell to finalise the arrangements. In his statement to Parliament, Hudson said: "The business was concluded, and I returned with the consent of the Scotch Commissioners to the King, whom I found at the sign of the White Swan at Downham. I related all to his Majesty, and he resolved the next morning to go to them". Hudson later related the contents (when examined by the English Parliament) of the paper he carried (written by Montreuil, in French, because the Scots would not write down their terms):
Gardiner makes several points about this Scottish offer. The first is that the Scots were keen to gain physical possession of Charles, so their wording was on the edge of what they were willing to agree to. However, it is unlikely that the Scots realised just how strongly Charles disliked Presbyterianism (because of his belief that from "no bishops" it was but a small step to "no king"), and that although on 23 March he had promised that would agree to a Presbyterian church, he could always fall back on "contrary to his conscience" when later pressed on this issue. The second point was that not having put their terms in writing, the phrase in the fourth term "upon sending a message", if indeed that is what Montreuil's French original contained, is open to misinterpretation, as the King could send any message, no matter how indirect (Gardiner gives an example of "It had been raining in Oxford") and then demand Scottish armed support. It is more likely that the Scots meant "the message" containing the terms they had previously discussed with the King about Presbyterian becoming the official church in both kingdoms.
Before setting out again, as the King's disguise was by then known, it was thought necessary he should change it. So Charles changed into a clergyman's attire, and being called "Doctor", was to pass for Hudson's tutor.
The small party arrived at Stamford, Lincolnshire on the evening of 3 May and stayed with Alderman Richard Wolph. Charles and his two companions left there between 10:00 pm and midnight on 4 May. Travelling all night, they went towards Allington and crossed the Trent at Gotham.
Early on 5 May 1646, Charles reached the King's Arms Inn in Southwell, where Montreuil was still residing. Charles stayed there during the morning, leaving after lunch. His arrival caused a stir, and among those who visited him was the Earl of Lothian. Lothian expressed surprise at "conditions" that Charles thought he had obtained before his arrival and denied them, adding that they could not be responsible for what their Commissioners in London might have agreed to. Lothian presented a series of demands to Charles: the surrender of Newark, that he sign the Covenant and order the establishment of Presbyterianism in England and Ireland, and to direct the commander of the Royalist Scottish field army, James Graham, Marquess of Montrose, to lay down his arms. Charles refused all three requests and replied "He that made you an earl, made James Graham a marquess".
Among others who arrived at the inn were two of the Scottish Commissioners, who stayed and dined with the King. After lunch, the King went via Upton across Kelham bridge to the headquarters of General David Leslie.
General David Leslie was in command of the Scottish army besieging Newark because Alexander Leslie, 1st Earl of Leven, had left for Newcastle-upon-Tyne. When Charles presented himself before General Leslie (his headquarters were located in a large fortified camp which had been given the name Edinburgh), the Scottish general professed the greatest astonishment, because as Disraeli explained:
Whether this was or was not true, the Scots persisted in affirming that the arrival of Charles at their headquarters was wholly unexpected. The first letter on the subject was to the English Commissioners at Newark, in which they said they felt it their duty to acquaint them that the King had come into their army that morning, which they said "has overtaken us unexpectedly, filled us with amazement, and made us like men that dream". Their next letter on the subject was to the Committee of Both Kingdoms in London, and in it they affirmed that
W. D. Hamilton was of the opinion that the King's reply at Southwell to Lord Lothian settled the matter of his status: "He was no longer regarded as the guest of M. Montreuil, but as their prisoner"; and when the interview with David Leslie came to an end, the King was escorted to Kelham House, where he was to reside while staying with the Scottish army at Newark.
Immediate aftermath
At Kelham House, Charles was closely watched by a guard dignified by the name of "a guard of honour" while communications were passing with Parliament and negotiations were proceeding between the English and Scottish Commissioners, who met for the purpose in the fields between Kelham and Farndon, an area called Faringdon. Montreuil, Ashburnham, and Hudson were still there, and from Ashburnham's narrative, it seems that Charles felt it wise to try the effect of a little negotiation on his own account. Ashburnham says "the King, recognising his difficulty, turned his thoughts another way, and resolved to come to the English if terms could be arranged".
Ashburnham took steps to effect this, nominating as negotiators Lord Belasyse, governor of Newark, and Francis Pierrepont (MP), and requested that they communicate with him, but Lord Belasyse told him, when they conversed together after the surrender of Newark, that Pierrepont "would by no means admit any discourse with me in the condition I then stood, the action of waiting on the King to the Scots army rendering me more obnoxious to the Parliament than any man living, and so those thoughts of his Majesty going to the English vanished".
If Ashburnham had succeeded in his negotiations at Kelham, the whole course of events would have been changed. As it was, the Scots held their prize securely. In the records of the House of Lords, there is a document signed by eight noblemen who had heard of the jealous way in which the King was watched, protesting against "strict guard being kept by the Scots army about the house where the King then was", and none being suffered to have access to his person without their permission.
See also
Escape of Charles II (3 September – 16 October 1651) after the Royalist defeat at the Battle of Worcester
Notes
References
Attribution:
Further reading
First English Civil War
Charles I of England |
The Changan Alsvin V3 is a subcompact sedan produced by Chinese auto maker Changan Automobile.
Overview
Previewed by the Changan B501 concept, the production version Alsvin V3 subcompact sedan debuted at the 2011 Guangzhou Auto Show. Later actually listed as the Alsvin 100 or Yuexiang 100, and finally with the confirmed name of Alsvin V3 when launched on to the market in June 2012. Price ranges from 43.900 to 48.900 yuan.
The Changan Alsvin V3 is a subcompact sedan slightly smaller and positioned under the Changan Alsvin/Changan Alsvin V5 in the market, and is built on a different platform employing multi-link independent suspension in the rear. The Alsvin V3 is powered by a 1.3 liter inline-4 16V DOHC engine producing 69kW and 121Nm with a 5-speed manual transmission as the only gearbox option.
Deliveries of the Alsvin V3 started on June 20, 2012. In 2013, 76,858 units were sold and 70,143 deliveries were made in 2014.
Facelift
A facelift debuted on the 2014 Guangzhou Auto Show with a launch on the Chinese car market at Q1 2015. The facelift focuses on the front with a new grille similar to the ones on the Alsvin V7. The post-facelift model adds a 1.4 liter EA14 inline-four engine and a 5-speed automatic transmission as additional options.
References
External links
– Changan Official website
Cars introduced in 2012
2010s cars
Cars of China
Front-wheel-drive vehicles
Alsvin V3
Subcompact cars
Sedans |
Davus, also known as the tiger rump tarantulas, is a genus of spiders in the family Theraphosidae (tarantulas). It was formerly included in Cyclosternum. They are medium to large tarantulas, found in Central America and Mexico.
Diagnosis
They are characterized by the opisthosomal pattern which are made of several red-orange stripes. Though further identification between species is decided mainly on the palpal bulb and spermatheca morphology. As Davus pentaloris owns a high variations of size, patterning and morphology.
Species
, the World Spider Catalog accepted the following species:
Davus fasciatus O. Pickard-Cambridge, 1892 (type species) – Costa Rica, Panama
Davus pentaloris (Simon, 1888) – Mexico, Guatemala
Davus ruficeps (Simon, 1891) – Mexico, Guatemala, El Salvador, Honduras
Davus santos Gabriel, 2016 – Panama
In synonymy
Davus drymusetes (Valerio, 1982) = Davus fasciatus
Davus morosum (Banks, 1909) = Davus ruficeps
Davus mozinno Estrada-Alvarez, 2014 = Davus pentaloris
Davus zebratum (Banks, 1909) = Davus ruficeps
References
Theraphosidae
Theraphosidae genera
Spiders of Mexico
Spiders of Central America |
The Box Butte Formation is a geologic formation in Nebraska. It preserves fossils dating back to the Neogene period.
See also
List of fossiliferous stratigraphic units in Nebraska
Paleontology in Nebraska
References
Neogene geology of Nebraska |
```javascript
/*
* JQuery zTree exHideNodes v3.5.23
* path_to_url
*
*
* path_to_url
*
* email: hunter.z@263.net
* Date: 2016-04-01
*/
(function(i){i.extend(!0,i.fn.zTree._z,{view:{clearOldFirstNode:function(c,a){for(var b=a.getNextNode();b;){if(b.isFirstNode){b.isFirstNode=!1;d.setNodeLineIcos(c,b);break}if(b.isLastNode)break;b=b.getNextNode()}},clearOldLastNode:function(c,a,b){for(a=a.getPreNode();a;){if(a.isLastNode){a.isLastNode=!1;b&&d.setNodeLineIcos(c,a);break}if(a.isFirstNode)break;a=a.getPreNode()}},makeDOMNodeMainBefore:function(c,a,b){c.push("<li ",b.isHidden?"style='display:none;' ":"","id='",b.tId,"' class='",l.className.LEVEL,
b.level,"' tabindex='0' hidefocus='true' treenode>")},showNode:function(c,a){a.isHidden=!1;f.initShowForExCheck(c,a);j(a,c).show()},showNodes:function(c,a,b){if(a&&a.length!=0){var e={},g,k;for(g=0,k=a.length;g<k;g++){var h=a[g];if(!e[h.parentTId]){var i=h.getParentNode();e[h.parentTId]=i===null?f.getRoot(c):h.getParentNode()}d.showNode(c,h,b)}for(var j in e)a=e[j][c.data.key.children],d.setFirstNodeForShow(c,a),d.setLastNodeForShow(c,a)}},hideNode:function(c,a){a.isHidden=!0;a.isFirstNode=!1;a.isLastNode=
!1;f.initHideForExCheck(c,a);d.cancelPreSelectedNode(c,a);j(a,c).hide()},hideNodes:function(c,a,b){if(a&&a.length!=0){var e={},g,k;for(g=0,k=a.length;g<k;g++){var h=a[g];if((h.isFirstNode||h.isLastNode)&&!e[h.parentTId]){var i=h.getParentNode();e[h.parentTId]=i===null?f.getRoot(c):h.getParentNode()}d.hideNode(c,h,b)}for(var j in e)a=e[j][c.data.key.children],d.setFirstNodeForHide(c,a),d.setLastNodeForHide(c,a)}},setFirstNode:function(c,a){var b=c.data.key.children,e=a[b].length;e>0&&!a[b][0].isHidden?
a[b][0].isFirstNode=!0:e>0&&d.setFirstNodeForHide(c,a[b])},setLastNode:function(c,a){var b=c.data.key.children,e=a[b].length;e>0&&!a[b][0].isHidden?a[b][e-1].isLastNode=!0:e>0&&d.setLastNodeForHide(c,a[b])},setFirstNodeForHide:function(c,a){var b,e,g;for(e=0,g=a.length;e<g;e++){b=a[e];if(b.isFirstNode)break;if(!b.isHidden&&!b.isFirstNode){b.isFirstNode=!0;d.setNodeLineIcos(c,b);break}else b=null}return b},setFirstNodeForShow:function(c,a){var b,e,g,f,h;for(e=0,g=a.length;e<g;e++)if(b=a[e],!f&&!b.isHidden&&
b.isFirstNode){f=b;break}else if(!f&&!b.isHidden&&!b.isFirstNode)b.isFirstNode=!0,f=b,d.setNodeLineIcos(c,b);else if(f&&b.isFirstNode){b.isFirstNode=!1;h=b;d.setNodeLineIcos(c,b);break}return{"new":f,old:h}},setLastNodeForHide:function(c,a){var b,e;for(e=a.length-1;e>=0;e--){b=a[e];if(b.isLastNode)break;if(!b.isHidden&&!b.isLastNode){b.isLastNode=!0;d.setNodeLineIcos(c,b);break}else b=null}return b},setLastNodeForShow:function(c,a){var b,e,g,f;for(e=a.length-1;e>=0;e--)if(b=a[e],!g&&!b.isHidden&&
b.isLastNode){g=b;break}else if(!g&&!b.isHidden&&!b.isLastNode)b.isLastNode=!0,g=b,d.setNodeLineIcos(c,b);else if(g&&b.isLastNode){b.isLastNode=!1;f=b;d.setNodeLineIcos(c,b);break}return{"new":g,old:f}}},data:{initHideForExCheck:function(c,a){if(a.isHidden&&c.check&&c.check.enable){if(typeof a._nocheck=="undefined")a._nocheck=!!a.nocheck,a.nocheck=!0;a.check_Child_State=-1;d.repairParentChkClassWithSelf&&d.repairParentChkClassWithSelf(c,a)}},initShowForExCheck:function(c,a){if(!a.isHidden&&c.check&&
c.check.enable){if(typeof a._nocheck!="undefined")a.nocheck=a._nocheck,delete a._nocheck;if(d.setChkClass){var b=j(a,l.id.CHECK,c);d.setChkClass(c,b,a)}d.repairParentChkClassWithSelf&&d.repairParentChkClassWithSelf(c,a)}}}});var i=i.fn.zTree,m=i._z.tools,l=i.consts,d=i._z.view,f=i._z.data,j=m.$;f.addInitNode(function(c,a,b){if(typeof b.isHidden=="string")b.isHidden=m.eqs(b.isHidden,"true");b.isHidden=!!b.isHidden;f.initHideForExCheck(c,b)});f.addBeforeA(function(){});f.addZTreeTools(function(c,a){a.showNodes=
function(a,b){d.showNodes(c,a,b)};a.showNode=function(a,b){a&&d.showNodes(c,[a],b)};a.hideNodes=function(a,b){d.hideNodes(c,a,b)};a.hideNode=function(a,b){a&&d.hideNodes(c,[a],b)};var b=a.checkNode;if(b)a.checkNode=function(c,d,f,h){(!c||!c.isHidden)&&b.apply(a,arguments)}});var n=f.initNode;f.initNode=function(c,a,b,e,g,i,h){var j=(e?e:f.getRoot(c))[c.data.key.children];f.tmpHideFirstNode=d.setFirstNodeForHide(c,j);f.tmpHideLastNode=d.setLastNodeForHide(c,j);h&&(d.setNodeLineIcos(c,f.tmpHideFirstNode),
d.setNodeLineIcos(c,f.tmpHideLastNode));g=f.tmpHideFirstNode===b;i=f.tmpHideLastNode===b;n&&n.apply(f,arguments);h&&i&&d.clearOldLastNode(c,b,h)};var o=f.makeChkFlag;if(o)f.makeChkFlag=function(c,a){(!a||!a.isHidden)&&o.apply(f,arguments)};var p=f.getTreeCheckedNodes;if(p)f.getTreeCheckedNodes=function(c,a,b,e){if(a&&a.length>0){var d=a[0].getParentNode();if(d&&d.isHidden)return[]}return p.apply(f,arguments)};var q=f.getTreeChangeCheckedNodes;if(q)f.getTreeChangeCheckedNodes=function(c,a,b){if(a&&
a.length>0){var d=a[0].getParentNode();if(d&&d.isHidden)return[]}return q.apply(f,arguments)};var r=d.expandCollapseSonNode;if(r)d.expandCollapseSonNode=function(c,a,b,e,f){(!a||!a.isHidden)&&r.apply(d,arguments)};var s=d.setSonNodeCheckBox;if(s)d.setSonNodeCheckBox=function(c,a,b,e){(!a||!a.isHidden)&&s.apply(d,arguments)};var t=d.repairParentChkClassWithSelf;if(t)d.repairParentChkClassWithSelf=function(c,a){(!a||!a.isHidden)&&t.apply(d,arguments)}})(jQuery);
``` |
The 1987 Croke Cup was the 36th staging of the Croke Cup since its establishment by the Gaelic Athletic Association in 1944. The competition ran from 12 April to 10 May 1987.
St Brendan's Community School were the defending champions, however, they were beaten by St Kieran's College in the Leinster final.
The final was played on 10 May 1987 at St Brendan's Park, Birr, between St Flannan's College and St Kieran's College, in what was their fourth meeting in the final overall and a first meeting in 29 years. St Flannan's College won the match by 4–11 to 1–07 to claim their 10th Croke Cup title overall and a first title in four years.
Tim Canny was the top scorer wuth 0-12.
Qualification
Results
Semi-final
Final
Statistics
Top scorers
Overall
References
1987 in Irish sport
Croke Cup |
Eromosele Albert (born 27 July 1974) is a Nigerian former professional boxer. As an amateur, he competed at the 1996 and 2000 Summer Olympics.
Professional boxing record
References
External links
Eromosele Albert at BoxStat.co
1974 births
Living people
Nigerian male boxers
Olympic boxers for Nigeria
Boxers at the 1996 Summer Olympics
Boxers at the 2000 Summer Olympics
Commonwealth Games silver medallists for Nigeria
Commonwealth Games medallists in boxing
Boxers at the 1994 Commonwealth Games
Middleweight boxers
African Games medalists in boxing
Sportspeople from Benin City
African Games silver medalists for Nigeria
Competitors at the 1999 All-Africa Games
Medallists at the 1994 Commonwealth Games |
```css
Position elements with `position: sticky`
Vertical percentages are relative to container width, not height
Vertically center text
Use `float` to allow an element to be placed to the left or right of the container
Vertically-center anything
``` |
Briatexte (; ) is a commune in the Tarn department in southern France.
Geography
The river Dadou flows westward through the northern part of the commune and crosses the village.
See also
Communes of the Tarn department
References
Communes of Tarn (department) |
Science Fiction in Old San Francisco: Volume One, History of the Movement From 1854 to 1890 is a history of science fiction writers in San Francisco in the period following the American Civil War by Sam Moskowitz. It was first published by Donald M. Grant, Publisher, Inc. in 1980 in an edition of 1,500 copies. This book with its companion volume Into the Sun & Other Stories won a Pilgrim Award for the author in 1981.
Notes
References
1980 non-fiction books
20th-century history books
American history books
American science fiction
Books about books
Books about the San Francisco Bay Area
History of San Francisco
Science fiction studies
Donald M. Grant, Publisher books |
```c++
// tuple_basic.hpp -----------------------------------------------------
//
// accompanying file LICENSE_1_0.txt or copy at
// path_to_url
// For more information, see path_to_url
// Outside help:
// This and that, Gary Powell.
// Fixed return types for get_head/get_tail
// ( and other bugs ) per suggestion of Jens Maurer
// simplified element type accessors + bug fix (Jeremy Siek)
// Several changes/additions according to suggestions by Douglas Gregor,
// William Kempf, Vesa Karvonen, John Max Skaller, Ed Brey, Beman Dawes,
// David Abrahams.
// Revision history:
// 2002 05 01 Hugo Duncan: Fix for Borland after Jaakko's previous changes
// 2002 04 18 Jaakko: tuple element types can be void or plain function
// types, as long as no object is created.
// Tuple objects can no hold even noncopyable types
// such as arrays.
// 2001 10 22 John Maddock
// Fixes for Borland C++
// 2001 08 30 David Abrahams
// Added default constructor for cons<>.
// your_sha256_hash-
#ifndef BOOST_TUPLE_BASIC_HPP
#define BOOST_TUPLE_BASIC_HPP
#include <utility> // needed for the assignment from pair to tuple
#include <boost/type_traits/cv_traits.hpp>
#include <boost/type_traits/function_traits.hpp>
#include <boost/type_traits/integral_constant.hpp>
#include <boost/utility/swap.hpp>
#include <boost/detail/workaround.hpp> // needed for BOOST_WORKAROUND
#if defined(BOOST_GCC) && (BOOST_GCC >= 40700)
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-local-typedefs"
#endif
namespace boost {
namespace tuples {
// -- null_type --------------------------------------------------------
struct null_type {};
// a helper function to provide a const null_type type temporary
namespace detail {
inline const null_type cnull() { return null_type(); }
// -- if construct ------------------------------------------------
// Proposed by Krzysztof Czarnecki and Ulrich Eisenecker
template <bool If, class Then, class Else> struct IF { typedef Then RET; };
template <class Then, class Else> struct IF<false, Then, Else> {
typedef Else RET;
};
} // end detail
// - cons forward declaration -----------------------------------------------
template <class HT, class TT> struct cons;
// - tuple forward declaration -----------------------------------------------
template <
class T0 = null_type, class T1 = null_type, class T2 = null_type,
class T3 = null_type, class T4 = null_type, class T5 = null_type,
class T6 = null_type, class T7 = null_type, class T8 = null_type,
class T9 = null_type>
class tuple;
// tuple_length forward declaration
template<class T> struct length;
namespace detail {
// -- generate error template, referencing to non-existing members of this
// template is used to produce compilation errors intentionally
template<class T>
class generate_error;
template<int N>
struct drop_front {
template<class Tuple>
struct apply {
typedef BOOST_DEDUCED_TYPENAME drop_front<N-1>::BOOST_NESTED_TEMPLATE
apply<Tuple> next;
typedef BOOST_DEDUCED_TYPENAME next::type::tail_type type;
static const type& call(const Tuple& tup) {
return next::call(tup).tail;
}
};
};
template<>
struct drop_front<0> {
template<class Tuple>
struct apply {
typedef Tuple type;
static const type& call(const Tuple& tup) {
return tup;
}
};
};
} // end of namespace detail
// -cons type accessors ----------------------------------------
// typename tuples::element<N,T>::type gets the type of the
// Nth element ot T, first element is at index 0
// -------------------------------------------------------
#ifndef BOOST_NO_CV_SPECIALIZATIONS
template<int N, class T>
struct element
{
typedef BOOST_DEDUCED_TYPENAME detail::drop_front<N>::BOOST_NESTED_TEMPLATE
apply<T>::type::head_type type;
};
template<int N, class T>
struct element<N, const T>
{
private:
typedef BOOST_DEDUCED_TYPENAME detail::drop_front<N>::BOOST_NESTED_TEMPLATE
apply<T>::type::head_type unqualified_type;
public:
#if BOOST_WORKAROUND(BOOST_BORLANDC,<0x600)
typedef const unqualified_type type;
#else
typedef BOOST_DEDUCED_TYPENAME boost::add_const<unqualified_type>::type type;
#endif
};
#else // def BOOST_NO_CV_SPECIALIZATIONS
namespace detail {
template<int N, class T, bool IsConst>
struct element_impl
{
typedef BOOST_DEDUCED_TYPENAME detail::drop_front<N>::BOOST_NESTED_TEMPLATE
apply<T>::type::head_type type;
};
template<int N, class T>
struct element_impl<N, T, true /* IsConst */>
{
typedef BOOST_DEDUCED_TYPENAME detail::drop_front<N>::BOOST_NESTED_TEMPLATE
apply<T>::type::head_type unqualified_type;
typedef const unqualified_type type;
};
} // end of namespace detail
template<int N, class T>
struct element:
public detail::element_impl<N, T, ::boost::is_const<T>::value>
{
};
#endif
// -get function templates -----------------------------------------------
// Usage: get<N>(aTuple)
// -- some traits classes for get functions
// access traits lifted from detail namespace to be part of the interface,
// (Joel de Guzman's suggestion). Rationale: get functions are part of the
// interface, so should the way to express their return types be.
template <class T> struct access_traits {
typedef const T& const_type;
typedef T& non_const_type;
typedef const typename boost::remove_cv<T>::type& parameter_type;
// used as the tuple constructors parameter types
// Rationale: non-reference tuple element types can be cv-qualified.
// It should be possible to initialize such types with temporaries,
// and when binding temporaries to references, the reference must
// be non-volatile and const. 8.5.3. (5)
};
template <class T> struct access_traits<T&> {
typedef T& const_type;
typedef T& non_const_type;
typedef T& parameter_type;
};
// get function for non-const cons-lists, returns a reference to the element
template<int N, class HT, class TT>
inline typename access_traits<
typename element<N, cons<HT, TT> >::type
>::non_const_type
get(cons<HT, TT>& c) {
typedef BOOST_DEDUCED_TYPENAME detail::drop_front<N>::BOOST_NESTED_TEMPLATE
apply<cons<HT, TT> > impl;
typedef BOOST_DEDUCED_TYPENAME impl::type cons_element;
return const_cast<cons_element&>(impl::call(c)).head;
}
// get function for const cons-lists, returns a const reference to
// the element. If the element is a reference, returns the reference
// as such (that is, can return a non-const reference)
template<int N, class HT, class TT>
inline typename access_traits<
typename element<N, cons<HT, TT> >::type
>::const_type
get(const cons<HT, TT>& c) {
typedef BOOST_DEDUCED_TYPENAME detail::drop_front<N>::BOOST_NESTED_TEMPLATE
apply<cons<HT, TT> > impl;
return impl::call(c).head;
}
// -- the cons template --------------------------------------------------
namespace detail {
// These helper templates wrap void types and plain function types.
// The reationale is to allow one to write tuple types with those types
// as elements, even though it is not possible to instantiate such object.
// E.g: typedef tuple<void> some_type; // ok
// but: some_type x; // fails
template <class T> class non_storeable_type {
non_storeable_type();
};
template <class T> struct wrap_non_storeable_type {
typedef typename IF<
::boost::is_function<T>::value, non_storeable_type<T>, T
>::RET type;
};
template <> struct wrap_non_storeable_type<void> {
typedef non_storeable_type<void> type;
};
} // detail
template <class HT, class TT>
struct cons {
typedef HT head_type;
typedef TT tail_type;
typedef typename
detail::wrap_non_storeable_type<head_type>::type stored_head_type;
stored_head_type head;
tail_type tail;
typename access_traits<stored_head_type>::non_const_type
get_head() { return head; }
typename access_traits<tail_type>::non_const_type
get_tail() { return tail; }
typename access_traits<stored_head_type>::const_type
get_head() const { return head; }
typename access_traits<tail_type>::const_type
get_tail() const { return tail; }
cons() : head(), tail() {}
// cons() : head(detail::default_arg<HT>::f()), tail() {}
// the argument for head is not strictly needed, but it prevents
// array type elements. This is good, since array type elements
// cannot be supported properly in any case (no assignment,
// copy works only if the tails are exactly the same type, ...)
cons(typename access_traits<stored_head_type>::parameter_type h,
const tail_type& t)
: head (h), tail(t) {}
template <class T1, class T2, class T3, class T4, class T5,
class T6, class T7, class T8, class T9, class T10>
cons( T1& t1, T2& t2, T3& t3, T4& t4, T5& t5,
T6& t6, T7& t7, T8& t8, T9& t9, T10& t10 )
: head (t1),
tail (t2, t3, t4, t5, t6, t7, t8, t9, t10, detail::cnull())
{}
template <class T2, class T3, class T4, class T5,
class T6, class T7, class T8, class T9, class T10>
cons( const null_type& /*t1*/, T2& t2, T3& t3, T4& t4, T5& t5,
T6& t6, T7& t7, T8& t8, T9& t9, T10& t10 )
: head (),
tail (t2, t3, t4, t5, t6, t7, t8, t9, t10, detail::cnull())
{}
cons( const cons& u ) : head(u.head), tail(u.tail) {}
template <class HT2, class TT2>
cons( const cons<HT2, TT2>& u ) : head(u.head), tail(u.tail) {}
template <class HT2, class TT2>
cons& operator=( const cons<HT2, TT2>& u ) {
head=u.head; tail=u.tail; return *this;
}
// must define assignment operator explicitly, implicit version is
// illformed if HT is a reference (12.8. (12))
cons& operator=(const cons& u) {
head = u.head; tail = u.tail; return *this;
}
template <class T1, class T2>
cons& operator=( const std::pair<T1, T2>& u ) {
BOOST_STATIC_ASSERT(length<cons>::value == 2); // check length = 2
head = u.first; tail.head = u.second; return *this;
}
// get member functions (non-const and const)
template <int N>
typename access_traits<
typename element<N, cons<HT, TT> >::type
>::non_const_type
get() {
return boost::tuples::get<N>(*this); // delegate to non-member get
}
template <int N>
typename access_traits<
typename element<N, cons<HT, TT> >::type
>::const_type
get() const {
return boost::tuples::get<N>(*this); // delegate to non-member get
}
};
template <class HT>
struct cons<HT, null_type> {
typedef HT head_type;
typedef null_type tail_type;
typedef cons<HT, null_type> self_type;
typedef typename
detail::wrap_non_storeable_type<head_type>::type stored_head_type;
stored_head_type head;
typename access_traits<stored_head_type>::non_const_type
get_head() { return head; }
null_type get_tail() { return null_type(); }
typename access_traits<stored_head_type>::const_type
get_head() const { return head; }
const null_type get_tail() const { return null_type(); }
// cons() : head(detail::default_arg<HT>::f()) {}
cons() : head() {}
cons(typename access_traits<stored_head_type>::parameter_type h,
const null_type& = null_type())
: head (h) {}
template<class T1>
cons(T1& t1, const null_type&, const null_type&, const null_type&,
const null_type&, const null_type&, const null_type&,
const null_type&, const null_type&, const null_type&)
: head (t1) {}
cons(const null_type&,
const null_type&, const null_type&, const null_type&,
const null_type&, const null_type&, const null_type&,
const null_type&, const null_type&, const null_type&)
: head () {}
cons( const cons& u ) : head(u.head) {}
template <class HT2>
cons( const cons<HT2, null_type>& u ) : head(u.head) {}
template <class HT2>
cons& operator=(const cons<HT2, null_type>& u )
{ head = u.head; return *this; }
// must define assignment operator explicitely, implicit version
// is illformed if HT is a reference
cons& operator=(const cons& u) { head = u.head; return *this; }
template <int N>
typename access_traits<
typename element<N, self_type>::type
>::non_const_type
get() {
return boost::tuples::get<N>(*this);
}
template <int N>
typename access_traits<
typename element<N, self_type>::type
>::const_type
get() const {
return boost::tuples::get<N>(*this);
}
};
// templates for finding out the length of the tuple -------------------
template<class T>
struct length: boost::integral_constant<int, 1 + length<typename T::tail_type>::value>
{
};
template<>
struct length<tuple<> >: boost::integral_constant<int, 0>
{
};
template<>
struct length<tuple<> const>: boost::integral_constant<int, 0>
{
};
template<>
struct length<null_type>: boost::integral_constant<int, 0>
{
};
template<>
struct length<null_type const>: boost::integral_constant<int, 0>
{
};
namespace detail {
// Tuple to cons mapper --------------------------------------------------
template <class T0, class T1, class T2, class T3, class T4,
class T5, class T6, class T7, class T8, class T9>
struct map_tuple_to_cons
{
typedef cons<T0,
typename map_tuple_to_cons<T1, T2, T3, T4, T5,
T6, T7, T8, T9, null_type>::type
> type;
};
// The empty tuple is a null_type
template <>
struct map_tuple_to_cons<null_type, null_type, null_type, null_type, null_type, null_type, null_type, null_type, null_type, null_type>
{
typedef null_type type;
};
} // end detail
// your_sha256_hash---
// -- tuple ------------------------------------------------------
template <class T0, class T1, class T2, class T3, class T4,
class T5, class T6, class T7, class T8, class T9>
class tuple :
public detail::map_tuple_to_cons<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9>::type
{
public:
typedef typename
detail::map_tuple_to_cons<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9>::type inherited;
typedef typename inherited::head_type head_type;
typedef typename inherited::tail_type tail_type;
// access_traits<T>::parameter_type takes non-reference types as const T&
tuple() {}
explicit tuple(typename access_traits<T0>::parameter_type t0)
: inherited(t0, detail::cnull(), detail::cnull(), detail::cnull(),
detail::cnull(), detail::cnull(), detail::cnull(),
detail::cnull(), detail::cnull(), detail::cnull()) {}
tuple(typename access_traits<T0>::parameter_type t0,
typename access_traits<T1>::parameter_type t1)
: inherited(t0, t1, detail::cnull(), detail::cnull(),
detail::cnull(), detail::cnull(), detail::cnull(),
detail::cnull(), detail::cnull(), detail::cnull()) {}
tuple(typename access_traits<T0>::parameter_type t0,
typename access_traits<T1>::parameter_type t1,
typename access_traits<T2>::parameter_type t2)
: inherited(t0, t1, t2, detail::cnull(), detail::cnull(),
detail::cnull(), detail::cnull(), detail::cnull(),
detail::cnull(), detail::cnull()) {}
tuple(typename access_traits<T0>::parameter_type t0,
typename access_traits<T1>::parameter_type t1,
typename access_traits<T2>::parameter_type t2,
typename access_traits<T3>::parameter_type t3)
: inherited(t0, t1, t2, t3, detail::cnull(), detail::cnull(),
detail::cnull(), detail::cnull(), detail::cnull(),
detail::cnull()) {}
tuple(typename access_traits<T0>::parameter_type t0,
typename access_traits<T1>::parameter_type t1,
typename access_traits<T2>::parameter_type t2,
typename access_traits<T3>::parameter_type t3,
typename access_traits<T4>::parameter_type t4)
: inherited(t0, t1, t2, t3, t4, detail::cnull(), detail::cnull(),
detail::cnull(), detail::cnull(), detail::cnull()) {}
tuple(typename access_traits<T0>::parameter_type t0,
typename access_traits<T1>::parameter_type t1,
typename access_traits<T2>::parameter_type t2,
typename access_traits<T3>::parameter_type t3,
typename access_traits<T4>::parameter_type t4,
typename access_traits<T5>::parameter_type t5)
: inherited(t0, t1, t2, t3, t4, t5, detail::cnull(), detail::cnull(),
detail::cnull(), detail::cnull()) {}
tuple(typename access_traits<T0>::parameter_type t0,
typename access_traits<T1>::parameter_type t1,
typename access_traits<T2>::parameter_type t2,
typename access_traits<T3>::parameter_type t3,
typename access_traits<T4>::parameter_type t4,
typename access_traits<T5>::parameter_type t5,
typename access_traits<T6>::parameter_type t6)
: inherited(t0, t1, t2, t3, t4, t5, t6, detail::cnull(),
detail::cnull(), detail::cnull()) {}
tuple(typename access_traits<T0>::parameter_type t0,
typename access_traits<T1>::parameter_type t1,
typename access_traits<T2>::parameter_type t2,
typename access_traits<T3>::parameter_type t3,
typename access_traits<T4>::parameter_type t4,
typename access_traits<T5>::parameter_type t5,
typename access_traits<T6>::parameter_type t6,
typename access_traits<T7>::parameter_type t7)
: inherited(t0, t1, t2, t3, t4, t5, t6, t7, detail::cnull(),
detail::cnull()) {}
tuple(typename access_traits<T0>::parameter_type t0,
typename access_traits<T1>::parameter_type t1,
typename access_traits<T2>::parameter_type t2,
typename access_traits<T3>::parameter_type t3,
typename access_traits<T4>::parameter_type t4,
typename access_traits<T5>::parameter_type t5,
typename access_traits<T6>::parameter_type t6,
typename access_traits<T7>::parameter_type t7,
typename access_traits<T8>::parameter_type t8)
: inherited(t0, t1, t2, t3, t4, t5, t6, t7, t8, detail::cnull()) {}
tuple(typename access_traits<T0>::parameter_type t0,
typename access_traits<T1>::parameter_type t1,
typename access_traits<T2>::parameter_type t2,
typename access_traits<T3>::parameter_type t3,
typename access_traits<T4>::parameter_type t4,
typename access_traits<T5>::parameter_type t5,
typename access_traits<T6>::parameter_type t6,
typename access_traits<T7>::parameter_type t7,
typename access_traits<T8>::parameter_type t8,
typename access_traits<T9>::parameter_type t9)
: inherited(t0, t1, t2, t3, t4, t5, t6, t7, t8, t9) {}
template<class U1, class U2>
tuple(const cons<U1, U2>& p) : inherited(p) {}
template <class U1, class U2>
tuple& operator=(const cons<U1, U2>& k) {
inherited::operator=(k);
return *this;
}
template <class U1, class U2>
tuple& operator=(const std::pair<U1, U2>& k) {
BOOST_STATIC_ASSERT(length<tuple>::value == 2);// check_length = 2
this->head = k.first;
this->tail.head = k.second;
return *this;
}
};
// The empty tuple
template <>
class tuple<null_type, null_type, null_type, null_type, null_type, null_type, null_type, null_type, null_type, null_type> :
public null_type
{
public:
typedef null_type inherited;
};
// Swallows any assignment (by Doug Gregor)
namespace detail {
struct swallow_assign;
typedef void (detail::swallow_assign::*ignore_t)();
struct swallow_assign {
swallow_assign(ignore_t(*)(ignore_t)) {}
template<typename T>
swallow_assign const& operator=(const T&) const {
return *this;
}
};
} // namespace detail
// "ignore" allows tuple positions to be ignored when using "tie".
inline detail::ignore_t ignore(detail::ignore_t) { return 0; }
// your_sha256_hash-----------
// The call_traits for make_tuple
// Honours the reference_wrapper class.
// Must be instantiated with plain or const plain types (not with references)
// from template<class T> foo(const T& t) : make_tuple_traits<const T>::type
// from template<class T> foo(T& t) : make_tuple_traits<T>::type
// Conversions:
// T -> T,
// references -> compile_time_error
// reference_wrapper<T> -> T&
// const reference_wrapper<T> -> T&
// array -> const ref array
template<class T>
struct make_tuple_traits {
typedef T type;
// commented away, see below (JJ)
// typedef typename IF<
// boost::is_function<T>::value,
// T&,
// T>::RET type;
};
// The is_function test was there originally for plain function types,
// which can't be stored as such (we must either store them as references or
// pointers). Such a type could be formed if make_tuple was called with a
// reference to a function.
// But this would mean that a const qualified function type was formed in
// the make_tuple function and hence make_tuple can't take a function
// reference as a parameter, and thus T can't be a function type.
// So is_function test was removed.
// (14.8.3. says that type deduction fails if a cv-qualified function type
// is created. (It only applies for the case of explicitly specifying template
// args, though?)) (JJ)
template<class T>
struct make_tuple_traits<T&> {
typedef typename
detail::generate_error<T&>::
do_not_use_with_reference_type error;
};
// Arrays can't be stored as plain types; convert them to references.
// All arrays are converted to const. This is because make_tuple takes its
// parameters as const T& and thus the knowledge of the potential
// non-constness of actual argument is lost.
template<class T, int n> struct make_tuple_traits <T[n]> {
typedef const T (&type)[n];
};
template<class T, int n>
struct make_tuple_traits<const T[n]> {
typedef const T (&type)[n];
};
template<class T, int n> struct make_tuple_traits<volatile T[n]> {
typedef const volatile T (&type)[n];
};
template<class T, int n>
struct make_tuple_traits<const volatile T[n]> {
typedef const volatile T (&type)[n];
};
template<class T>
struct make_tuple_traits<reference_wrapper<T> >{
typedef T& type;
};
template<class T>
struct make_tuple_traits<const reference_wrapper<T> >{
typedef T& type;
};
template<>
struct make_tuple_traits<detail::ignore_t(detail::ignore_t)> {
typedef detail::swallow_assign type;
};
namespace detail {
// a helper traits to make the make_tuple functions shorter (Vesa Karvonen's
// suggestion)
template <
class T0 = null_type, class T1 = null_type, class T2 = null_type,
class T3 = null_type, class T4 = null_type, class T5 = null_type,
class T6 = null_type, class T7 = null_type, class T8 = null_type,
class T9 = null_type
>
struct make_tuple_mapper {
typedef
tuple<typename make_tuple_traits<T0>::type,
typename make_tuple_traits<T1>::type,
typename make_tuple_traits<T2>::type,
typename make_tuple_traits<T3>::type,
typename make_tuple_traits<T4>::type,
typename make_tuple_traits<T5>::type,
typename make_tuple_traits<T6>::type,
typename make_tuple_traits<T7>::type,
typename make_tuple_traits<T8>::type,
typename make_tuple_traits<T9>::type> type;
};
} // end detail
// -make_tuple function templates -----------------------------------
inline tuple<> make_tuple() {
return tuple<>();
}
template<class T0>
inline typename detail::make_tuple_mapper<T0>::type
make_tuple(const T0& t0) {
typedef typename detail::make_tuple_mapper<T0>::type t;
return t(t0);
}
template<class T0, class T1>
inline typename detail::make_tuple_mapper<T0, T1>::type
make_tuple(const T0& t0, const T1& t1) {
typedef typename detail::make_tuple_mapper<T0, T1>::type t;
return t(t0, t1);
}
template<class T0, class T1, class T2>
inline typename detail::make_tuple_mapper<T0, T1, T2>::type
make_tuple(const T0& t0, const T1& t1, const T2& t2) {
typedef typename detail::make_tuple_mapper<T0, T1, T2>::type t;
return t(t0, t1, t2);
}
template<class T0, class T1, class T2, class T3>
inline typename detail::make_tuple_mapper<T0, T1, T2, T3>::type
make_tuple(const T0& t0, const T1& t1, const T2& t2, const T3& t3) {
typedef typename detail::make_tuple_mapper<T0, T1, T2, T3>::type t;
return t(t0, t1, t2, t3);
}
template<class T0, class T1, class T2, class T3, class T4>
inline typename detail::make_tuple_mapper<T0, T1, T2, T3, T4>::type
make_tuple(const T0& t0, const T1& t1, const T2& t2, const T3& t3,
const T4& t4) {
typedef typename detail::make_tuple_mapper<T0, T1, T2, T3, T4>::type t;
return t(t0, t1, t2, t3, t4);
}
template<class T0, class T1, class T2, class T3, class T4, class T5>
inline typename detail::make_tuple_mapper<T0, T1, T2, T3, T4, T5>::type
make_tuple(const T0& t0, const T1& t1, const T2& t2, const T3& t3,
const T4& t4, const T5& t5) {
typedef typename detail::make_tuple_mapper<T0, T1, T2, T3, T4, T5>::type t;
return t(t0, t1, t2, t3, t4, t5);
}
template<class T0, class T1, class T2, class T3, class T4, class T5, class T6>
inline typename detail::make_tuple_mapper<T0, T1, T2, T3, T4, T5, T6>::type
make_tuple(const T0& t0, const T1& t1, const T2& t2, const T3& t3,
const T4& t4, const T5& t5, const T6& t6) {
typedef typename detail::make_tuple_mapper
<T0, T1, T2, T3, T4, T5, T6>::type t;
return t(t0, t1, t2, t3, t4, t5, t6);
}
template<class T0, class T1, class T2, class T3, class T4, class T5, class T6,
class T7>
inline typename detail::make_tuple_mapper<T0, T1, T2, T3, T4, T5, T6, T7>::type
make_tuple(const T0& t0, const T1& t1, const T2& t2, const T3& t3,
const T4& t4, const T5& t5, const T6& t6, const T7& t7) {
typedef typename detail::make_tuple_mapper
<T0, T1, T2, T3, T4, T5, T6, T7>::type t;
return t(t0, t1, t2, t3, t4, t5, t6, t7);
}
template<class T0, class T1, class T2, class T3, class T4, class T5, class T6,
class T7, class T8>
inline typename detail::make_tuple_mapper
<T0, T1, T2, T3, T4, T5, T6, T7, T8>::type
make_tuple(const T0& t0, const T1& t1, const T2& t2, const T3& t3,
const T4& t4, const T5& t5, const T6& t6, const T7& t7,
const T8& t8) {
typedef typename detail::make_tuple_mapper
<T0, T1, T2, T3, T4, T5, T6, T7, T8>::type t;
return t(t0, t1, t2, t3, t4, t5, t6, t7, t8);
}
template<class T0, class T1, class T2, class T3, class T4, class T5, class T6,
class T7, class T8, class T9>
inline typename detail::make_tuple_mapper
<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9>::type
make_tuple(const T0& t0, const T1& t1, const T2& t2, const T3& t3,
const T4& t4, const T5& t5, const T6& t6, const T7& t7,
const T8& t8, const T9& t9) {
typedef typename detail::make_tuple_mapper
<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9>::type t;
return t(t0, t1, t2, t3, t4, t5, t6, t7, t8, t9);
}
namespace detail {
template<class T>
struct tie_traits {
typedef T& type;
};
template<>
struct tie_traits<ignore_t(ignore_t)> {
typedef swallow_assign type;
};
template<>
struct tie_traits<void> {
typedef null_type type;
};
template <
class T0 = void, class T1 = void, class T2 = void,
class T3 = void, class T4 = void, class T5 = void,
class T6 = void, class T7 = void, class T8 = void,
class T9 = void
>
struct tie_mapper {
typedef
tuple<typename tie_traits<T0>::type,
typename tie_traits<T1>::type,
typename tie_traits<T2>::type,
typename tie_traits<T3>::type,
typename tie_traits<T4>::type,
typename tie_traits<T5>::type,
typename tie_traits<T6>::type,
typename tie_traits<T7>::type,
typename tie_traits<T8>::type,
typename tie_traits<T9>::type> type;
};
}
// Tie function templates -------------------------------------------------
template<class T0>
inline typename detail::tie_mapper<T0>::type
tie(T0& t0) {
typedef typename detail::tie_mapper<T0>::type t;
return t(t0);
}
template<class T0, class T1>
inline typename detail::tie_mapper<T0, T1>::type
tie(T0& t0, T1& t1) {
typedef typename detail::tie_mapper<T0, T1>::type t;
return t(t0, t1);
}
template<class T0, class T1, class T2>
inline typename detail::tie_mapper<T0, T1, T2>::type
tie(T0& t0, T1& t1, T2& t2) {
typedef typename detail::tie_mapper<T0, T1, T2>::type t;
return t(t0, t1, t2);
}
template<class T0, class T1, class T2, class T3>
inline typename detail::tie_mapper<T0, T1, T2, T3>::type
tie(T0& t0, T1& t1, T2& t2, T3& t3) {
typedef typename detail::tie_mapper<T0, T1, T2, T3>::type t;
return t(t0, t1, t2, t3);
}
template<class T0, class T1, class T2, class T3, class T4>
inline typename detail::tie_mapper<T0, T1, T2, T3, T4>::type
tie(T0& t0, T1& t1, T2& t2, T3& t3,
T4& t4) {
typedef typename detail::tie_mapper<T0, T1, T2, T3, T4>::type t;
return t(t0, t1, t2, t3, t4);
}
template<class T0, class T1, class T2, class T3, class T4, class T5>
inline typename detail::tie_mapper<T0, T1, T2, T3, T4, T5>::type
tie(T0& t0, T1& t1, T2& t2, T3& t3,
T4& t4, T5& t5) {
typedef typename detail::tie_mapper<T0, T1, T2, T3, T4, T5>::type t;
return t(t0, t1, t2, t3, t4, t5);
}
template<class T0, class T1, class T2, class T3, class T4, class T5, class T6>
inline typename detail::tie_mapper<T0, T1, T2, T3, T4, T5, T6>::type
tie(T0& t0, T1& t1, T2& t2, T3& t3,
T4& t4, T5& t5, T6& t6) {
typedef typename detail::tie_mapper
<T0, T1, T2, T3, T4, T5, T6>::type t;
return t(t0, t1, t2, t3, t4, t5, t6);
}
template<class T0, class T1, class T2, class T3, class T4, class T5, class T6,
class T7>
inline typename detail::tie_mapper<T0, T1, T2, T3, T4, T5, T6, T7>::type
tie(T0& t0, T1& t1, T2& t2, T3& t3,
T4& t4, T5& t5, T6& t6, T7& t7) {
typedef typename detail::tie_mapper
<T0, T1, T2, T3, T4, T5, T6, T7>::type t;
return t(t0, t1, t2, t3, t4, t5, t6, t7);
}
template<class T0, class T1, class T2, class T3, class T4, class T5, class T6,
class T7, class T8>
inline typename detail::tie_mapper
<T0, T1, T2, T3, T4, T5, T6, T7, T8>::type
tie(T0& t0, T1& t1, T2& t2, T3& t3,
T4& t4, T5& t5, T6& t6, T7& t7,
T8& t8) {
typedef typename detail::tie_mapper
<T0, T1, T2, T3, T4, T5, T6, T7, T8>::type t;
return t(t0, t1, t2, t3, t4, t5, t6, t7, t8);
}
template<class T0, class T1, class T2, class T3, class T4, class T5, class T6,
class T7, class T8, class T9>
inline typename detail::tie_mapper
<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9>::type
tie(T0& t0, T1& t1, T2& t2, T3& t3,
T4& t4, T5& t5, T6& t6, T7& t7,
T8& t8, T9& t9) {
typedef typename detail::tie_mapper
<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9>::type t;
return t(t0, t1, t2, t3, t4, t5, t6, t7, t8, t9);
}
template <class T0, class T1, class T2, class T3, class T4,
class T5, class T6, class T7, class T8, class T9>
void swap(tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9>& lhs,
tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9>& rhs);
inline void swap(null_type&, null_type&) {}
template<class HH>
inline void swap(cons<HH, null_type>& lhs, cons<HH, null_type>& rhs) {
::boost::swap(lhs.head, rhs.head);
}
template<class HH, class TT>
inline void swap(cons<HH, TT>& lhs, cons<HH, TT>& rhs) {
::boost::swap(lhs.head, rhs.head);
::boost::tuples::swap(lhs.tail, rhs.tail);
}
template <class T0, class T1, class T2, class T3, class T4,
class T5, class T6, class T7, class T8, class T9>
inline void swap(tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9>& lhs,
tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9>& rhs) {
typedef tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> tuple_type;
typedef typename tuple_type::inherited base;
::boost::tuples::swap(static_cast<base&>(lhs), static_cast<base&>(rhs));
}
} // end of namespace tuples
} // end of namespace boost
#if defined(BOOST_GCC) && (BOOST_GCC >= 40700)
#pragma GCC diagnostic pop
#endif
#endif // BOOST_TUPLE_BASIC_HPP
``` |
The 2023–24 season is the 115th season in the history of Blackpool F.C., and their first season back in League One since the 2020–21 season following their relegation the previous season. The club are participating in League One, the FA Cup and the 2023–24 EFL Trophy. They were knocked out of the EFL Cup in the second round.
It is the club's 100th season in tangerine.
Pre-season
On 2 June, Blackpool confirmed their first three pre-season friendlies, against Southport, Barrow and Morecambe. A fourth fixture was later added, versus Hibernian.
Blackpool made two signings which became official on 1 July: midfielder Albie Morgan and defender Matthew Pennington both arrived on free transfers, upon the expiration of their contracts with their previous clubs.
On 7 July, Blackpool travelled down the coast to Southport for their opening friendly. Goals from Kenny Dougall, Brad Holmes and Matty Virtue gave the visitors victory.
Blackpool hosted newly promoted Championship side Plymouth Argyle on 15 July. Plymouth won 2–1. Blackpool's goal came from Shayne Lavery's penalty.
Four days later, the Seasiders faced a Wolverhampton Wanderers XI at Compton Park Training Ground in a behind-closed-doors fixture. Blackpool won 4–2, with goals from Shayne Lavery (two) and Albie Morgan, as well as an own-goal.
Barrow was the destination on 22 July. Blackpool won 5–0, with goals from Matty Virtue, Shayne Lavery, Jake Beesley and Sonny Carey (two).
Fixtures and results
Season proper
August
Blackpool opened their league campaign on 5 August with a 2–0 victory over Burton Albion at Bloomfield Road, in what was Neil Critchley's first competitive fixture back in charge of the team. A double from Shayne Lavery midway through the first half proved to be the difference.
Three days later, they booked their place in the second round of the EFL Cup after a 2–0 win at Derby County. Jake Beesley scored both Blackpool goals. They will face Wolverhampton Wanderers at Molineux Stadium in the week commencing 28 August.
The club brought in midfielder Jensen Weir from Brighton & Hove Albion on a season-long loan on 11 August.
A long trip to Exeter City on 12 August resulted in a point after a goalless draw. Blackpool dropped four places to eighth with the point.
Port Vale were the visitors to Bloomfield Road on 15 August in a match that finished goalless. Blackpool remained eighth.
The following day, midfielder Tashan Oakley-Boothe joined on a free transfer.
A third-successive scoreless match occurred on 19 August, when Blackpool hosted Leyton Orient. The Tangerines, still undefeated, dropped three places to eleventh.
On 25 August, striker Jordan Rhodes joined the club, on loan from Huddersfield Town, for the remainder of the season.
The club's first defeat occurred on 26 August, at Lincoln City, with a 3–0 scoreline for the hosts. Oliver Norburn was sent off for the visitors in the second half. Blackpool dropped four places to fifteenth.
Blackpool were knocked out of the EFL Cup at the second-round stage by Wolverhampton Wanderers on 29 August, after a 5–0 scoreline at Molineux. It was their fifth-consecutive game without a goal, a total of 450 minutes.
On 30 August, winger Karamoko Dembélé joined on a season-long loan from Brest. Tom Trybull was released by mutual consent the following day.
September
On 2 September, Blackpool beat Wigan Athletic 2–1, with goals from Jordan Rhodes (on his home debut) and Kenny Dougall (a 94th-minute winner). Blackpool climbed three places to twelfth with the victory.
Three days later, Blackpool travelled up the coast to face Barrow in the EFL Trophy. Goals from Sonny Carey and new arrival Kylian Kouassi gave Blackpool the three points.
After an eleven-day international break, Blackpool visited Wycombe Wanderers. They were beaten 2–0, and dropped two places to fourteenth in the table.
On 23 September, Blackpool beat Reading 4–1 at Bloomfield Road. Jordan Rhodes scored a hat-trick (the first Blackpool player to do so since Nathan Delfouneso in 2018); the other goal came from Kylian Kouassi on his starting debut. Blackpool remained fourteenth.
A second-successive victory followed on 30 September with a 1–0 scoreline at Barnsley. Jordan Rhodes scored from the penalty spot, his fifth goal in three games. Blackpool climbed three places to eleventh.
October
Derby County beat Blackpool 3–1 at Bloomfield Road on 3 October, inflicting the Seasiders' first home defeat of the campaign. The hosts dropped two places to thirteenth.
On 7 October, Blackpool travelled to London to face Charlton Athletic. The visitors let slip a two-goal lead and had to settle for a draw. Jordan Rhodes (with his sixth goal of the campaign) and Kylian Kouassi, with his first for the club, were Blackpool's goal scorers. They climbed three places to tenth with the point.
Blackpool made it two wins out of two in the EFL Trophy on 10 October, with a 5–2 scoreline against Liverpool F.C. Academy. Kylian Kouassi scored a hat-trick; the other two goals came from Albie Morgan and Andy Lyons, on his return to the team following a family bereavement.
Blackpool beat Stevenage Borough 3–0 at Bloomfield Road on 14 October, the goals coming from Jordan Rhodes, Owen Dale and CJ Hamilton. Blackpool climbed three places to seventh, although several teams around them had their matches postponed due to international call-ups.
A trip to Oxford United a week later resulted in a 1–1 draw, with Blackpool equalising in stoppage time through Jordan Rhodes. They remained seventh.
Blackpool climbed into the play-off places with a 3–2 victory at home to Cheltenham Town on 24 August. The hosts' goals came from Shayne Lavery, Jordan Rhodes (his ninth goal in ten appearances) and Karamoko Dembélé (his first goal for the club).
October ended with a 4–2 defeat to Peterborough United at Bloomfield Road. Oliver Casey was dismissed early in the second half. Blackpool went 3–0 down from the subsequent free-kick but fought back to 3–2, with goals from Kenny Dougall and Sonny Carey, but conceded again in stoppage time. Blackpool dropped one place to seventh.
League One
League table
Results summary
Results
On 22 June, the EFL League One fixtures were released.
FA Cup
The Tangerines were drawn away to Bromley in the first round.
EFL Cup
Blackpool were drawn away to Derby County in the first round and to Wolverhampton Wanderers in the second round.
EFL Trophy
In the group stage, Blackpool were drawn into Northern Group A alongside Barrow, Morecambe and Liverpool U21.
Transfers
In
Out
Loaned in
Loaned out
References
Blackpool
Blackpool F.C. seasons
English football clubs 2023–24 season |
Darren Stanley Hayes (born 8 May 1972) is an Australian singer, songwriter, music producer and composer. He was the frontman and singer of the pop duo Savage Garden until their disbandment. Their 1997 album Savage Garden peaked at number 1 in Australia, number 2 in the United Kingdom and number 3 in the United States. It spawned the singles "I Want You", "To the Moon and Back", and Australian and US number 1 "Truly Madly Deeply". The duo followed the success of their debut album with Affirmation (1999), which provided additional hits such as Australian and US number 1 "I Knew I Loved You", and Australian number 3 "The Animal Song". Savage Garden parted ways in 2001.
Hayes released his first solo album Spin in 2002. The album sold two million copies worldwide, debuted at Number 2 in the UK and number 3 in Australia. It delivered the hit single "Insatiable". Hayes's second album, The Tension and the Spark, preceded by single "Pop!ular", was released in 2004. Hayes parted ways with his record label Columbia Records in 2006 and started his own independent record label, Powdered Sugar, from which he would release his third and fourth solo albums, 2007's double-album This Delicate Thing We've Made and 2011's Secret Codes and Battleships. After a decade-long hiatus, Hayes returned in 2022 with his fifth studio album; Homosexual, which was released in October 2022, spawned the singles "Let's Try Being in Love", "Do You Remember?", "Poison Blood", "All You Pretty Things" and "Feels Like It's Over".
Early life and education
At school, Hayes was bullied and physically and verbally abused. He described himself as "a big-hearted, emotional, and excitable" teenager, with an obsession for Star Wars and E.T. Hayes ' father was an alcoholic, and regularly subjected Hayes and his mother to violence.
In late 1987, he got the chance to see his hero Michael Jackson performing live in Brisbane as part of the Bad Tour. He credits this as encouraging him to pursue a career in entertainment. His other acknowledged influences are Stevie Nicks, Madonna, Peter Gabriel, Kate Bush, Annie Lennox, Prince and Marvin Gaye, and he has cited U2's "With or Without You" as the most touching song he has ever heard.
Music career
1993–2001: Savage Garden
In 1993, Hayes answered an advertisement in a Brisbane music magazine, Time Off, placed by Daniel Jones, for a lead vocalist position in the band called Red Edge. Hayes was successful, despite his voice breaking in the audition, as he mentioned in an interview with Rosie O'Donnell. The cover band broke up in 1994 and Hayes formed a partnership with Jones, a duo band initially called Crush. However, another band in the UK already owned the rights to the name. Hayes and Jones submitted their first demo tape to record companies under the name Bliss, before they eventually changed their name to Savage Garden, a phrase used by Anne Rice to describe the world through the eyes of Lestat de Lioncourt in her novel The Vampire Lestat. The Savage Garden is a vision of Earth in which the natural laws of the world govern over anything aesthetic or civil.
Savage Garden started recording their debut album in 1995 with producer Charles Fisher. Their first single, "I Want You", was released in 1996 and was the best selling single by an Australian artist that year. The second single, "To the Moon and Back", topped the Australian charts at the end of 1996. The third single, "Truly Madly Deeply", was their second number one and was the best-selling Australian single of 1997. Their debut album, Savage Garden, was the best-selling album in Australia during 1997 and the duo won ten ARIA awards.
Hayes moved to New York City to promote Savage Garden internationally, while Daniel Jones stayed in Brisbane. The move proved to be successful, with "Truly Madly Deeply" going to the top of the American charts in 1998. The Savage Garden album sold seven million copies in the US on the back of this success.
In New York City, Hayes wrote Affirmation. He had recently divorced his wife of several years. Parts of the album reflected the pain from the end of the relationship. Affirmation was released in 1999 and proved to be another hit, with lead single "I Knew I Loved You" going to number one in the United States, and the album selling six million copies worldwide by the end of 2000. The pair played the title track of the album at the closing ceremony of the 2000 Sydney Olympics.
Hayes moved to Sausalito in 2000. He became the public face of the duo, doing most of the media. Hayes announced that Savage Garden had broken up in October 2001 during a chat with an Australian journalist. Hayes thought the information would be saved for a later article; it was not. When confronted with this information during the early morning hours, before an unrelated interview, Jones denied the break-up of the band. However, it appears that Jones did not believe the reporter was accurately quoting Hayes and denied what he thought was yet another break-up rumour. Still, the fact that Jones took a back seat in all promotional activities for Affirmation seems indicative that Jones was not content to remain within Savage Garden as it had operated in the past. Savage Garden had sold over 23 million albums by that stage.
Luciano Pavarotti and Darren Hayes sang "O Sole Mio" together in a concert in 2000.
In 2005, manager of Savage Garden, John Woodruff confirmed that Jones had announced his intention of leaving Savage Garden prior to the promotion for Affirmation. Woodruff criticised the media for their treatment of Hayes. The duo have never issued a united statement regarding the situation, yet Hayes has guaranteed that the group will "never, by any chance" reunite, adding in 2020, "Imagine if you had come out and survived a really dysfunctional and toxic relationship, and then for years later people would ask you to please get back in that relationship [...] "I once said I'd only do it if it cured cancer and that's still how I feel."
2002–2004: Spin and The Tension and the Spark
Hayes recorded his first solo album, Spin, which was released in 2002. The album was produced by Walter Afanasieff, the producer of Affirmation. Spin carried on in the same musical vein as Savage Garden, with a less soft rock sound and more edgy R&B vibe, although the first single "Insatiable" was a ballad, reaching Number 3 in Australia. Other singles "Strange Relationship", "Crush (1980 Me)" and "I Miss You" also performed well in charts. The album reached the Top 5 in Australia at Number 3, and in the UK at Number 2. It also reached the top ten in Denmark, Sweden and Finland. In the United States, the album failed to make the same impact as Savage Garden's previous releases, reaching Number 35 on Billboard. It was later re-issued with a bonus disc consisting of some live and studio tracks.
Hayes spent two years working on his second solo album, The Tension and the Spark. Other than the track "I Forgive You", which was produced with Madonna collaborator Marius De Vries, the entire album was produced by Hayes and Robert Conley (with whom he had previously toured and recorded "Crush (1980 Me)" for Spin and "Do You Believe" for Specificus). The album marked a bold change of direction for Hayes. Conley's production was almost entirely electronic, with acoustic instruments buried under walls of sequenced sounds. Although artistically this was a huge step forward and earned Hayes the strongest praise of his career, it alienated a large portion of his audience, who were expecting another album of radio-friendly pop songs. The first single, "Pop!ular", was released on 12 July 2004. This single reached Number One on the US Dance Charts, and fared well in the UK. Hayes's follow-up single, "Darkness", charted in the lower regions of the ARIA top 50 charts.
One of his out-takes from the Spin sessions, "When You Say You Love Me", was recorded by Clay Aiken in 2003 for his Measure of a Man album. It was later covered by Human Nature, resulting in an Australian top 20 single in April 2004 off their Walk The Tightrope album, and was then re-recorded in 2008 featuring Hayes himself.
2005–2006: Truly Madly Completely and parting ways with Columbia
In 2005, Hayes recorded a track he wrote with Robert Conley called "So Beautiful", which was included on the Savage Garden greatest hits compilation, Truly Madly Completely: The Best of Savage Garden. The compilation also includes a second track by Hayes called "California". Both of these tracks hark back to Hayes's early sound, although still retaining some of the electronic flourishes from The Tension and the Spark.
On 9 July 2006, Hayes announced that he had parted ways with Columbia Records after ten years and 24 million album sales together.
The tour following this release saw Hayes play the iconic Sydney Opera House. The performance was recorded and released on a DVD titled A Big Night in with Darren Hayes.
2007–2010: This Delicate Thing We've Made and We Are Smug
Hayes finished recording his third solo album, This Delicate Thing We've Made, in 2007. The album was a double-disc, with 25 tracks. Many of the tracks were co-written with Robert Conley, and a great deal of the album was written with and produced by Justin Shave, who played keyboards for part of Hayes's Time Machine tour. The album was released on 20 August 2007 on Hayes's own independent record label, Powdered Sugar, while the first single, "On the Verge of Something Wonderful", was released in Australia on 28 July 2007, and in the UK and online on 6 August 2007.
On 9 April 2007, Hayes released the album track "Who Would Have Thought" from This Delicate Thing We've Made as a teaser track on his official website, as well as his MySpace profile. This was accompanied by an animation for the song created by his partner, animator and director, Richard Cullen. Around April 2007, remixes of the album track "Step into the Light" were being played in clubs around the world. The album version of "Step into the Light" was released as a teaser on Hayes's official website and MySpace on 30 April 2007.
During the first half of 2007, Hayes performed selected songs from the album in The Time Machine World Tour small, exclusive gigs around the world. Tickets for several of these much sought after shows sold out in under ten minutes. In June 2007, Hayes embarked on a small tour of USA and Canada, stopping in New York, Toronto, Chicago, San Francisco and Los Angeles, along with the band Temposhark. The shows were well received with very positive reviews.
On 30 June 2007, Hayes headlined the London Gay Pride at Trafalgar Square. He performed "I Want You" and "On the Verge of Something Wonderful", as well as a medley that included "Pop!ular".
In July 2007, Hayes announced The Time Machine Tour that would start out in the UK, and then move on to Hayes's home country Australia. On 29 July 2007, "On the Verge of Something Wonderful" was the most selected music video on The Box in the UK. On 20 August 2007, This Delicate Thing We've Made was released in the UK, America and Australia. 'The Time Machine Tour' included venues such as The Royal Albert Hall and the State Theatre in Sydney. His stage was again designed by Willie Williams and included a large bridge that could extend over the first few rows of seats. On the final night, at the Queensland Performing Arts Centre in Hayes's hometown of Brisbane, the performance was recorded in HD for a DVD release. The Time Machine Tour DVD came out in two editions: the special edition which was limited to 2000 copies and contained a four-panel, fold-out, gleaming white box, a thirty-two-page color booklet with 300 photos and notes from the artist, and the regular edition. The special edition DVD, which was only available from Hayes' website, was shipped to purchasers on 1 July, and the regular edition, which was available in shops, was released on 22 July.
Hayes did a mini tour in the US in November and December 2007, making appearances at Borders stores and performing two shows in New York City and Philadelphia.
On 18 December 2007, Hayes announced "The Side Two Tour". The show toured the UK in February 2008 and featured Hayes performing songs from This Delicate Thing We've Made that were not featured on "The Time Machine Tour", in a more intimate setting. In late 2008, the DVD This Delicate Film We've Made was announced. The DVD featured selected songs from the album, arranged in a new sequence, and set to visuals that told a loose, abstract animated narrative. The DVD entered the UK music DVD charts at Number 1.
On 19 April 2009, Hayes teased via Twitter that he was preparing another album. On 8 May, Hayes announced, via his MySpace page, that he and Robert Conley had produced an album together titled We Are Smug. The ten-track album, with a fair amount of experimentation with both lyrics and music, was made available via a link from his MySpace page, and was made free to download to gauge acceptability of Hayes's shifting musical styles. The album is heavily electronic with some heavy beats. It also contains some explicit content. Both Hayes and Conley share vocal duties on this album.
Hayes signed to Sony ATV Music Publishing for a worldwide deal in August 2009. Emma Banks from CAA UK came on board October 2009 to represent Hayes for his touring plans around the new album.
Although the album was completed before the holidays in 2009, Hayes announced in early 2010 that he had more song ideas and he was going back into the studio, which delayed the album another year. Hayes completely finished his fourth solo album in mid-2010, working with top writer/producers from around the world and having the record mixed by Robert Orton.
Hayes also recorded a song for the Finn tribute album He Will Have His Way, a cover of "Not Even Close". It was released on Halloween 2010.
2011–2021: Secret Codes and Battleships and hiatus
On 17 April 2011, Hayes announced that he had signed a record deal with Mercury Records/Universal Music Australia and signed to EMI Services UK /Europe. He released his fourth studio album in October 2011. The first single titled "Talk Talk Talk" was announced in May and was released on 24 June. The single contains a cover version of Madonna's "Angel" as the B-side.
It was announced on 20 June, via Hayes's Facebook page, that his new album would be titled Secret Codes and Battleships.
Hayes announced on Twitter on 22 July that he was shooting a second music video from the album. On 14 August, he revealed in a radio interview that "Black Out the Sun" will be the second single from Secret Codes and Battleships. Since its release in the UK, BBC Radio 2 has selected the track to feature on their A list the week commencing 1 October 2011. He later confirmed, on Twitter, that this song will be the single for the UK and other international markets, while "Bloodstained Heart" would be the second single in Australia. Hayes played dates on "The Secret" Tour in the UK and Australia beginning on 15 October in Liverpool. Hayes tweeted, on 2 March 2012, that he would be shooting another music video the week after. He later confirmed the music video was being shot for "Stupid Mistake", which was released as the album's fourth single in May 2012.
Since 2013, Hayes stopped his music career and tried to build a stand-up comedy career. At the same time, he kept creating short singing videos in his social media accounts for his fans. In an 2022 interview with Queerty, Hayes said that he had actually planned to retire at that point. In 2018 Hayes briefly returned on stage with one-off performance of two songs, including "I Knew I Loved You". In 2019, Hayes featured on Cub Sport's single "I Never Cried So Much in My Whole Life". He did not appear in the official video. In 2020 he recorded a new version of "Truly Madly Deeply" with slightly modified lyrics. The video of his studio performance was released on YouTube on 24 April.
2022–present: Homosexual and Do You Remember? tour
On 26 January 2022, Hayes released the single, "Let's Try Being in Love". A music video for the song was released the same day, starring Hayes and featuring actor Scott Evans. The video was directed by Andrew Putschoegl. Referred to as a "queer anthem" by NME, in promotional interviews, Hayes explained "I've been married to Richard [Cullen] for almost 17 years, [and] I'm in this really comfortable place in my life. But at the same time at mid-life I'm grieving the fact I never got to celebrate who I really was at the period of my life where I was most famous. I look at this world we live in now where someone like Lil Nas X can push forward his true self, full of pride and self-love and have the chance to be loved for who he truly is [...] A lot of the time I was my most famous, I was deeply sad." Less than 24 hours of release, "Let's Try Being in Love" debuted at number 96 on the Official UK Singles Download Chart Top 100 and at number 98 on the Official UK Singles Sales Chart Top 100. The single also peaked at number 9 on the Australian Independent singles chart. "I wanted to show I love the feminine in me, be proud of the gay me. There's a dance scene that is so passionate, everything's alive and thriving and blooming. That's how I feel in general about music. And that's a hugely sharp contrast to how I felt 10 years ago."
On 27 January 2022, Hayes announced he would be headlining the 2022 Sydney Gay and Lesbian Mardi Gras Parade and would be performing on 5 March 2022. Hayes performed "The Animal Song", "I Want You", "Affirmation" plus, live for the very first time, "Let's Try Being in Love".
On 2 March 2022, Hayes announced the Do You Remember? Tour that would be performed in six Australian cities between January and February 2023 and would feature songs from his musical career as part of Savage Garden and as a solo artist. On 10 March 2022, Hayes released the single "Do You Remember?", following with the official video on 16 March 2022. In June 2022, Hayes released "Poison Blood", which details his life living with depression, and others affected by it. Hayes released the official "Poison Blood" music video on 26 June 2022, announcing UK Tour dates on the same day. A remix of "Let's Try Being in Love" was released on 15 July 2022, with production helmed by Louis La Roche. This was followed on 29 July by Roche's remix to "Do You Remember?".
On 18 August 2022, Hayes announced that Homosexual, his fifth studio album, would be released that October. A fourth single, "All You Pretty Things", was released on 19 August 2022. When the album was released on 7 October 2022, Hayes said "My new album was born from a desire to rid myself of the grief I developed over the years I lost to shame growing up in a world where being gay was met with rejection and condemnation. I wanted to revisit my teenage years with the wisdom of a proud 50-year-old gay man and revisit my youthful memories and view them through this new peach-tinted lens of joy. I imagined an adolescence where I could be loved for who I truly am today. Through this music, my goal was to reclaim my happiness and reclaim my identity. That confidence gave me the courage to explore deep wounds in my life and explore old trauma from the perspective of an effervescent endless summer." Homosexual debuted at number 6 on the Australian Digital Albums and number 16 on the Australian Artist Albums Chart. The album debuted at number 82 on the UK Albums Chart, also placing on the UK Download and Album Sales charts, placing at numbers 3 and 13, respectively.
In April 2023, Hayes graced the cover of Washington, DC’s Metro Weekly. The magazine featured a 13-page pictorial and Q&A about Hayes’ past career and recently-concluded Do You Remember? tour. On 10 February 2023, Peking Duk released a version of "I Want You" featuring re-recorded vocals by Hayes. On 1 May 2023, Hayes released an official music video for "Feels Like It's Over", directed by Andrew Huebscher. An edited version of the song was released as the fifth single from Homosexual on 12 May 2023.
Other media
In December 2014, Hayes announced a comedy podcast "The He Said, He Said Show".[16] The podcast debuted on 10 February 2015.[4] Rosie O'Donnell has appeared as a guest.[17] The podcast ended its run at the end of the year. Hayes has co-hosted a comedic movie review podcast with writer and comedian Anthony Armentano called "We Paid To See This". Some of Hayes' sketch comedy can be found on his YouTube page including a Star Wars spoof documentary and several of his sketches he wrote and performed during his time studying at The Groundlings Theatre and School. On 13 March 2016, Hayes announced he had been writing an original musical with writer and comedian Johnny Menke. As of March 2022, the musical has yet to be publicly performed or recorded.
Personal life
Hayes married his childhood sweetheart, makeup artist Colby Taylor, in 1994. They were still married when Savage Garden "skyrocketed to fame around the globe in the late 1990s." They separated in 1998 and were divorced in 2000. Much of the lyrics for the band's second album, Affirmation, dealt with his divorce. He recorded Affirmation in San Francisco mid-1999 and eventually bought a house there. He also maintained a base in London since 2004. In 2013, Hayes moved to Los Angeles.
Hayes started coming out as gay to friends and the head of his label, Sony, in the early 2000s. He entered into a private marriage ceremony with his boyfriend of two years, Richard Cullen, on 23 July 2005 in London. On 19 June 2006, also in London, they entered into a formal civil partnership. Hayes and Cullen applied for a marriage licence in California, and were married on 15 July 2013, to show their support for those fighting for same-sex marriage. Though public speculation about his sexual orientation had been present throughout his career, he kept his personal life private. He announced the event the day prior on his official website. Before the announcement, Cullen's name had appeared on the website as the designer of the cover for Hayes's single "So Beautiful". In a 2017 interview with Attitude, Hayes commented, "I don't regret [publicly coming out] for a second. It wasn't that I was blacklisted, but it was that I became a 'niche' artist purely based on my sexuality. There was a kind of unintentionally patronizing view of me. No longer a sexual object, but more of someone you might take home to Mom [...] I was suddenly your gay uncle. That was frustrating. My sexuality was used as a descriptor, and if you think about it, that's nuts. No one says 'Openly heterosexual singer Adele.' "
In May 2023, Hayes shared a statement confirming his separation from Cullen, in which he said:
"After 17 years of marriage to the best person I ever met, Richard and I have chosen to accept that our union has gently and beautifully come to rest. In honour of this realisation, we separated earlier this year and have been supporting each other emotionally throughout this massive change in our lives. Because people will ask, let me answer the ugly questions to get them out of the way forever – no, there’s no scandal to report, no infidelity, guilty or third party. It's just life. We adore each other and always will. We view our marriage as our greatest collaboration. Nobody can ever take away what we achieved together. We are still best friends. We always will be."
Hayes has often been open about his mental health struggles, namely with depression, that go back to his childhood, and his depression with hiding his sexuality whilst in Savage Garden. "I was deeply unhappy, barely containing secrets that would soon devastate me emotionally and send me to the brink of suicide at the height of my fame." Whilst promoting his 2022 single "Poison Blood", Hares told Retro Pop Magazine: "I describe my depression as a blessing, a gift and a curse all at once. I wouldn't wish it upon my worst enemy and yet I’m aware I am a deeply sensitive person, and that my unique brain allows me to feel depths of emotions that many people don’t experience [...] I have learned to use those moments to channel melodies and stories that I hope are so real and so relatable they might reach someone else who is in pain, like me, and remind them to stay, like I choose to, every single day." In 2023, Hayes elaborated, "I think we always have to remember that each one of us is essential and that we change and improve everybody's lives. Everybody is affected positively by our place on this earth. Every time that I've had a thought about wishing that I wasn't here, when the mood passes, the next day, something trivial will happen, and I think, "I'm so glad I was here to witness that." And that trivial moment can be as simple as having the best mac and cheese ever, or as brilliant as Madonna releasing a new song."
Hayes is a Star Wars fan, and has been since childhood. He also collects Star Wars memorabilia, and he even auditioned for a role in Star Wars: Episode III – Revenge of the Sith. After JoJo's Bizarre Adventure licensed the Savage Garden song "I Want You" to be used in the television adaptation of Diamond Is Unbreakable, Hayes expressed his gratitude and also revealed that he is a fan of the series.
Discography
Studio albums
Spin (2002)
The Tension and the Spark (2004)
This Delicate Thing We've Made (2007)
Secret Codes and Battleships (2011)
Homosexual (2022)
Awards and nominations
References
External links
1972 births
20th-century Australian male singers
21st-century Australian male singers
APRA Award winners
Australian expatriates in the United States
Australian expatriates in England
Australian pop singers
Australian male singer-songwriters
Australian singer-songwriters
Australian tenors
Gay singers
Australian gay musicians
Australian LGBT singers
Australian LGBT songwriters
Gay songwriters
Living people
People from Brisbane
Musicians from Brisbane
20th-century Australian LGBT people
21st-century Australian LGBT people
Columbia Records artists
Mercury Records artists |
TCG Kocatepe may refer to a number of warships operated by the Turkish Naval Forces:
TCG Kocatepe (D 354), an American Gearing-class destroyer, in operation from 1971 to 1974
TCG Kocatepe (1945), an American Gearing-class destroyer, in operation from 1974 to 1994
TCG Kocatepe (F-252), an American Knox-class frigate, in operation from 2002 to 2005
See also
Kocatepe (disambiguation)
Turkish Navy ship names |
```java
package tech.tablesaw.io;
import java.util.*;
import java.util.concurrent.CopyOnWriteArrayList;
import tech.tablesaw.api.ColumnType;
import tech.tablesaw.columns.AbstractColumnParser;
public class ColumnTypeDetector {
/** Consider using TextColumn instead of StringColumn for string data after this many rows */
private static final int STRING_COLUMN_ROW_COUNT_CUTOFF = 50_000;
/**
* Use a TextColumn if at least this proportion of values are found to be unique in the type
* detection sample
*
* <p>Note: This number is based on an assumption that as more records are considered, a smaller
* proportion of these new records will be found to be unique
*
* <p>Sample calculation; 10 character string = 2 bytes * 10 + 38 extra bytes = 58; rounded up to
* 64 so it's a multiple of 8
*
* <p>With dictionary encoding, we have 2*64 + 2*4 = 136 byte per unique value plus 4 bytes for
* each value For text columns we have 64 bytes per string
*
* <p>So, if every value is unique, using dictionary encoding wastes about 70 bytes per value. If
* there are only two unique values, dictionary encoding saves about 62 bytes per value.
*
* <p>Of course, it all depends on the lengths of the strings.
*/
private static final double STRING_COLUMN_CUTOFF = 0.50;
private final List<ColumnType> typeArray;
/**
* @param typeArray Types to choose from. When more than one would work, we pick the first of the
* options. The order these appear in is critical. The broadest must go last, so String must
* be at the end of the list. Any String read from the input will match string. If it were
* first on the list, you would get nothing but strings in your table. As another example, an
* integer type, should go before double. Otherwise double would match integers so the integer
* test would never be evaluated and all the ints would be read as doubles.
*/
public ColumnTypeDetector(List<ColumnType> typeArray) {
this.typeArray = typeArray;
}
/**
* Estimates and returns the type for each column in the input text
*
* <p>The type is determined by checking a sample of the data. Because only a sample of the data
* is checked, the types may be incorrect. If that is the case a Parse Exception will be thrown.
*
* <p>The method {@code printColumnTypes()} can be used to print a list of the detected columns
* that can be corrected and used to explicitly specify the correct column types.
*/
public ColumnType[] detectColumnTypes(Iterator<String[]> rows, ReadOptions options) {
boolean useSampling = options.sample();
// to hold the results
List<ColumnType> columnTypes = new ArrayList<>();
// to hold the data read from the file
List<List<String>> columnData = new ArrayList<>();
int rowCount = 0; // make sure we don't go over maxRows
int nextRow = 0;
String[] nextLine = new String[0];
while (rows.hasNext()) {
try {
nextLine = rows.next();
// initialize the arrays to hold the strings. we don't know how many we need until we read
// the
// first row
if (rowCount == 0) {
for (int i = 0; i < nextLine.length; i++) {
columnData.add(new ArrayList<>());
}
}
int columnNumber = 0;
if (rowCount == nextRow) {
for (String field : nextLine) {
columnData.get(columnNumber).add(field);
columnNumber++;
}
if (useSampling) {
nextRow = nextRow(nextRow);
} else {
nextRow = nextRowWithoutSampling(nextRow);
}
}
rowCount++;
} catch (IndexOutOfBoundsException e) {
throw new ColumnIndexOutOfBoundsException(e, nextRow, nextLine);
}
}
// now detect
for (List<String> valuesList : columnData) {
ColumnType detectedType = detectType(valuesList, options);
/*
if (detectedType.equals(STRING) && rowCount > STRING_COLUMN_ROW_COUNT_CUTOFF
&& options.columnTypesToDetect().contains(TEXT)
) {
HashSet<String> unique = new HashSet<>(valuesList);
double uniquePct = unique.size() / (valuesList.size() * 1.0);
if (uniquePct > STRING_COLUMN_CUTOFF) {
detectedType = TEXT;
}
}
*/
columnTypes.add(detectedType);
}
return columnTypes.toArray(new ColumnType[0]);
}
private int nextRowWithoutSampling(int nextRow) {
return nextRow + 1;
}
private int nextRow(int nextRow) {
if (nextRow < 10_000) {
return nextRow + 1;
}
if (nextRow < 100_000) {
return nextRow + 1000;
}
if (nextRow < 1_000_000) {
return nextRow + 10_000;
}
if (nextRow < 10_000_000) {
return nextRow + 100_000;
}
if (nextRow < 100_000_000) {
return nextRow + 1_000_000;
}
return nextRow + 10_000_000;
}
/**
* Returns a predicted ColumnType derived by analyzing the given list of undifferentiated strings
* read from a column in the file and applying the given Locale and options
*/
private ColumnType detectType(List<String> valuesList, ReadOptions options) {
CopyOnWriteArrayList<AbstractColumnParser<?>> parsers =
new CopyOnWriteArrayList<>(getParserList(typeArray, options));
CopyOnWriteArrayList<ColumnType> typeCandidates = new CopyOnWriteArrayList<>(typeArray);
boolean hasNonMissingValues = false;
for (String s : valuesList) {
for (AbstractColumnParser<?> parser : parsers) {
if (!parser.isMissing(s)) {
hasNonMissingValues = true;
if (!parser.canParse(s)) { // we can skip this test if we know the value is missing
typeCandidates.remove(parser.columnType());
parsers.remove(parser);
}
}
}
}
if (hasNonMissingValues) {
return selectType(typeCandidates);
} else {
// the last type in the typeArray is the default
return typeArray.get(typeArray.size() - 1);
}
}
/**
* Returns the selected candidate for a column of data, by picking the first value in the given
* list
*
* @param typeCandidates a possibly empty list of candidates. This list should be sorted in order
* of preference
*/
private ColumnType selectType(List<ColumnType> typeCandidates) {
return typeCandidates.get(0);
}
/**
* Returns the list of parsers to use for type detection
*
* @param typeArray Array of column types. The order specifies the order the types are applied
* @param options CsvReadOptions to use to modify the default parsers for each type
* @return A list of parsers in the order they should be used for type detection
*/
private List<AbstractColumnParser<?>> getParserList(
List<ColumnType> typeArray, ReadOptions options) {
// Types to choose from. When more than one would work, we pick the first of the options
List<AbstractColumnParser<?>> parsers = new ArrayList<>();
for (ColumnType type : typeArray) {
parsers.add(type.customParser(options));
}
return parsers;
}
}
``` |
Jose Romeo Bustillos Diaz (November 28, 1940 – May 10, 2005) was a Filipino actor.
He performed in films such as Ang Maestro (1981), The Impossible Kid (1982), Gising Na... Ang Higanteng Natutulog (1995) and Si Samson at Si Delilah (1983). Other notable roles were in films like Kalawang sa Bakal (1987), Don Pepe (1988), Pambato (1993), Tunay na Magkaibigan Peksman (1994) and Jacob C.I.S. (1997).
Biography
His father was a Mexican American of Spanish descent. Diaz was the younger brother of Paquito Diaz and uncle of Joko Diaz, who are both actors.
Prior to his acting career, Diaz played collegiate basketball for the FEU Tamaraws and briefly for the Crispa Redmanizers and the Ysmael Steel Admirals in the 1960s.
Diaz died on May 10, 2005, due to tongue cancer caused by heavy smoking, five months after the death of his longtime friend Fernando Poe Jr.
Filmography
Film
Television
Yagit (1983–1985) as Chito
References
External links
1941 births
2005 deaths
20th-century comedians
Basketball players from Pampanga
Crispa Redmanizers players
Deaths from cancer in the Philippines
Deaths from tongue cancer
Romy
FEU Tamaraws basketball players
Filipino male comedians
Filipino male film actors
Filipino male television actors
Filipino men's basketball players
Filipino people of American descent
Filipino people of Mexican descent
Filipino people of Spanish descent
Filipino television personalities
Kapampangan people
Male actors from Pampanga |
Michael Stone (born Michael John Goodban in 1960) is a British man who was convicted of the 1996 murders of Lin and Megan Russell and the attempted murder of Josie Russell. He was sentenced to three life sentences with a tariff of 25 years for the Russell killings.
Stone maintains his innocence and continues to contest his conviction. His legal team argues that the serial killer Levi Bellfield could possibly be the true perpetrator of the attack. In February 2022, Stone's solicitor said that Bellfield had confessed to the murder of both Lin and Megan, although the truthfulness of the confession remained in doubt and Bellfield later claimed that he had confessed for a cash payment. In July 2023 the Criminal Cases Review Commission declined to refer Stone's case to the Court of Appeal, saying that it had "identified no credible new evidence or information".
Police suspect Stone may be responsible for an unsolved murder that occurred in Maidstone in 1976, and prior to the Russell murders he had spent time in prison for violent assaults and armed robbery.
Early life
Stone was born as Michael John Goodban in Royal Tunbridge Wells, Kent in 1960, one of five children. Although the name of his father was registered, and therefore given on his birth certificate, as "Ivor Goodban", there was uncertainty over the true identity of his father and Stone regarded a different partner of his mother, Peter Stone, as having been his father. Both men denied that he was their son. Stone had a turbulent childhood, suffering domestic violence in his family home before he was placed in a care home, where he was abused. As a boy, he had also been beaten with a hammer, and witnessed his mother's former partner attack another man with a meat cleaver in his home. He was known to be prone to uncontrolled outbursts and aggressive mood swings. From the age of nine, he began using drugs and committing crimes.
Stone's police record dates back to 1972 at the age of 12 and continued into adulthood. Once leaving the care system, Stone began using heroin, and soon developed a £1,500 a week heroin addiction. He served three prison sentences in the 1980s and 1990s for robbery, burglary, grievous bodily harm and assault occasioning actual bodily harm. He was known to carry weapons, including knives and guns, and would also attack victims with ammonia squirted from a Jif lemon bottle. He became a figure in the criminal underworld of the Medway towns of Kent.
Stone was sentenced to two years' imprisonment in 1981 for attacking a man with a hammer during a robbery. He then received a four-and-a-half year sentence for stabbing a friend while he slept in 1983, an attack that penetrated the friend's lung and nearly killed him, and he tried to wound a police officer in the eye after this arrest. When he was sentenced for this crime, the sentencing judge remarked that Stone's violent nature could lead to him killing someone in the future. He was then sentenced to 10 years' imprisonment for two armed robberies in Maidstone and Brighton respectively during the same week in 1986. The first robbery was at Maidstone's Hazlitt Theatre, and the second was at the Leeds Permanent Building Society branch in Brighton, where he stole £577. Throughout his criminal career, Stone would steal from garden sheds, taking anything he could sell, and would mug people at cash dispensers, in part to fund his heroin addiction. In prison, he attacked various prison officers.
Stone was known to have been violent towards his partners. His former girlfriend, Rachel Marcroft, recounted that he had once beaten her so badly that she went to the police, who took photos of her injuries as evidence, although the charges were later dropped as she refused to give evidence against him. She had received two black eyes, a swollen mouth and heavy bruising from where he had held her down, injuries which the police later said bore a striking resemblance to those on the bodies of the Russells, whom he was later convicted of murdering. Marcroft said that the way the Russells were tied up was similar to how she was tied up by Stone. She said that whenever he was violent towards her, Stone would not afterwards remember what he had done.
Stone was released from prison in 1993. Prior to the murders, he had received support for his drug addiction and mental health problems and was under the supervision of the National Probation Service. He had a history of severe mental illness. Stone had been sectioned to a mental hospital in Hull in 1994, and was diagnosed with personality disorder and paranoid psychosis. His conditions were controlled by regular injections of medication, but his treatment was affected by his overuse of heroin. The hospital at which he was detained had to pass him into the care of another health authority as they found him "too dangerous". It was then that he was passed into the care of West Kent health authority.
Suspect in 1976 murder
Police suspect Stone of having killed Francis Jegou, who was found stabbed to death in a park in Maidstone in 1976. Jegou was a 65-year-old Guernsey man who was a former special constable. The motive for the murder appeared to be robbery, since Jegou always carried around large amounts of cash yet only had £3 on him when his body was discovered. He died from multiple stab wounds to the stomach and of head injuries inflicted by being kicked repeatedly. His body was discovered near Maidstone East railway station, very close to the Stone family home at the time, and very close to the probation hostel Stone was then staying in. Stone allegedly later told a psychiatrist that he was responsible for the robbery and murder of Jegou.
Stone was a suspect and was questioned about the crime in the aftermath, and he was again questioned about the murder immediately before being charged with the Russell killings in 1997. At the time of Jegou's murder, police announced that they wanted to speak to four youths who they thought could have seen Jegou or his murderer. Stone was 16 at the time, and a prolific offender. Stone has been known to attack policemen. In 1983 he stabbed a man then attacked and almost blinded an officer, for which he received a four-and-a-half-year sentence.
Stone's sister Barbara, who has always protested her brother's innocence of the Russell murders, said in 1998 that she believed he had indeed killed Jegou, stating: "I don't think he killed Lin and Megan Russell. But I do think he did that murder when he was younger." Explaining, she commented: "When I was about 14 Mick came up to me with a knife in a sheath. He said I was to hide it for him and I buried it. At the time I was just a kid and did what my big brother told me. Years later he said he knew something about the murder. I knew he was up to no good. The killing was his style – it was done by two or more people and Mick never acted alone. It would have been done to get money and, again, that's something he'd have done."
Links to other deaths
Stone is known to have accidentally killed his partner by injecting him with too much heroin, causing an overdose. Police also questioned him about the death of a friend who fell under a London Tube train as he stood next to Stone. Stone later boasted of pushing the man underneath the train. He was also initially questioned on the murder of 64-year-old Mary Town, who was found dead in a disused warehouse in Maidstone in 1977, although another man was later convicted of the murder.
Russell murders
On 9 July 1996, in a country lane in Chillenden, Kent, England, Lin Russell, aged 45, her two daughters, six-year-old Megan and nine-year-old Josie and their dog Lucy, were tied up and savagely beaten with a hammer while walking home from a swimming gala. Lin, Megan and their dog Lucy were killed during the frenzied 15-minute attack, but Josie survived and made a recovery. The trio had walked past a parked car on the lane before a man got out wielding a claw hammer and then demanded money. Lin said that they didn't have any and offered to go home and get some, but the man refused before tying them up and bludgeoning them. Lin urged Josie to run home and get help but the attacker caught her, blindfolded her with strips of her swimming towel and tied her to a tree before hitting her until she passed out. Lin had also been blindfolded. After attacking the Russells, the attacker then drove off in his car.
In the week after the murders, Stone and an accomplice were known to have carried out a robbery in Gillingham.
Josie's recovery and the way she and her father, Shaun Russell, coped with the aftermath of the tragedy were the subject of a BBC documentary.
Conviction for Russell murders
Arrest
In July 1997, police arrested 37-year-old Michael Stone for the crimes after tip-offs resulting from a reconstruction on the Crimewatch television programme. A psychiatrist called to report his suspicions of Stone, and another two nursing staff called in also naming Stone. These medical workers, who had worked with Stone before the attacks, reported that by 4 July, five days before the murders, Stone was becoming increasingly enraged and had aggressively threatened to kill people and their families. The psychiatrist further recalled that Stone had threatened his probation officer with a hammer. The psychiatrist also told police that the threats were so aggressive that they had made him fear for his own safety and for the safety of other employees, and that the fantasies related by Stone seemed to tally with the nature of the attacks on the Russells.
Stone had told a psychiatric nurse that he dreamt about torturing people and that he fantasised about killing children and running about in woods. He further added that he felt like killing children while walking in woods and that when he passed by children he felt like killing them, and also claimed to have attacked people with hammers. He had also said that he was angry at the world and was going to do "something bad". Stone had also apparently begged to be admitted as an in-patient to a psychiatric unit at the time, but he was refused as he was seen as "too dangerous". In his outbursts to medical staff, Stone had asserted his own dangerousness, saying he was too violent to be held in prison and would need to be admitted to Broadmoor Hospital, with notions of achieving "fame and glory" for his crimes. It was known that Stone had also tried to admit himself to a psychiatric ward the day after the killings. The psychiatrist told police that Stone fitted the E-fit and the police description of the murderer.
A friend also rang police after the reconstruction to say he believed Stone looked like the E-fit shown on the programme and reported that he had recently been acting strangely. Another friend said he had seen him wearing blood-soaked clothes on the day of the murders, although Stone said that this was because he had been in a fight.
Shortly before his arrest for the murders in 1997, Stone had threatened to kill his sister and one of her children, and smashed up her car. Stone attempted suicide at least twice while on remand.
Evidence
Stone had no alibi for the day of the murders, saying he could not remember where he was as he had been taking so many drugs and because more than a year had passed. He said that he could recall the week before the murders and the day following them, but not what he was doing on the day itself. He continued to maintain that he could not remember where he was on 9 July during both his trials. A receipt shows that he was definitely at a Cash Converters in Chatham at 12.21 pm on the day, putting him 40 miles away, although he could have travelled to Chillenden by the time of the murders which occurred at approximately 4.30 pm. A detective from the case later stated that it was possible that, in a haze of drugs, Stone could have forgotten carrying out the attack at all.
Stone told police he had never heard of Chillenden, but friends testified that he knew the Chillenden area "like the back of his hand". Stone had spent time at the Eastry children's home from the murder scene as a child. A reason for Stone being in woods near Chillenden on the day of the murder could not be established, as Stone lived away in Gillingham, but police said that, as Stone financed his drug habit by burgling homes, stealing lawnmowers, mobile generators and other items that he hoped to sell on, he could have been in Chillenden in order to steal something.
Police discovered that a lawnmower had been stolen from a cottage in Chillenden on the same day of the murders, only away from the scene of the attacks, and believed that Stone was responsible for this theft. He was known to have tried to sell a lawnmower to a relative shortly after the murders. It was also speculated that Stone could have decided to rob Lin Russell in a desperate need for money to buy heroin. Stone was known to have always carried a hammer in his car.
A key witness in the case was a woman driving on the adjacent road, who said she had seen a man hurriedly emerging out of the junction by the murder site in a beige car. She said she "could tell he was angry" and that he kept looking back at her in his wing mirrors. It was this woman who later helped police create the E-fit of the suspected killer. Another witness recounted driving past a man acting strangely nearby, not in a vehicle but holding a claw hammer in his hand and looking agitated (a claw hammer was found to have been the weapon used in the attacks). A third witness also testified seeing a beige car parked by bushes nearby, a Ford Escort, and said that when he took his dog for a walk to the same spot half an hour later he found a string bag with the strips of towel in it that had been used to restrain the Russells, and which were smeared with their blood. Curiously, Stone owned a white Toyota Tercel at the time of the crime, and there are no records showing Stone as the owner of a beige car like that which various witnesses had reported seeing. However, some of his friends claimed that Stone did once drive a beige car that matched the one seen near the scene. Despite this, the only witness who is known to have definitely seen the attacker, surviving victim Josie Russell, maintained that the attacker had been in a red car, and Stone himself said that he had owned a red car.
At the crime scene, a fingerprint impressed in blood was found on the lid of Josie's lunchbox (which was inside a zipped-up bag) and hairs were found that did not belong to any of the victims. A black bootlace that was bloodstained had been used in the attack. Stone was known to use a bootlace as a tourniquet to raise the veins in his arms when injecting drugs. These items were scientifically tested using the techniques then available, and no link was found to Stone. The bloodstained strips of towel and string bag were also scientifically examined, and no link was found on these to Stone either. The fingerprint on the lunchbox was conclusively found not to belong to Stone as it did not share his distinctive fingerprint pattern, although it was determined that it could have been Lin's fingerprint, yet this scenario would have meant that the victim would have had to have left the fingerprint on the lunchbox before the attacker zipped-up the lunchbox bag again as the box was found zipped-up and closed when the police arrived at the scene. A full DNA profile was compiled from the hairs found at the scene by the police, but no match was made with any known person. It is not known for certain whether the hairs belonged to the attacker, as they could have got onto the girls' clothing when they were at the swimming gala.
A hammer was found near the scene of the murders, although it could not be conclusively determined whether it had been the hammer used in the attack.
The day after the attack, friends noticed that Stone's clothing was bloodstained and that he refused to enter their home as usual. They also noticed bloodstains on his toolbox in his car, and on a blue sweatshirt. Stone claimed this was as a result of him being in a fight, although no marks on Stone were seen. Shortly after this, friends alleged that Stone removed the bloodstained items from his car and changed his clothes. He later told police that he then burned all his clothes.
First trial
Stone pleaded not guilty at his original trial in 1998, but his conviction was primarily based on the testimony from a witness, Damian Daley, who claimed that Stone had confessed to him while in prison during a conversation through a heating pipe at the back of their cells. Stone was known to have attempted suicide at least twice in prison around the time the confession was supposed to have taken place. Another two prisoners, Mark Jennings and Barry Thompson, also testified at the trial that Stone had suggested to them an involvement in the crimes. The court also heard that Stone was unable to present any of the clothes he was wearing at the time for analysis, as he said he had burned them because he was "too fat".
As a result, the conviction hinged upon the alleged cell confession to Damian Daley, because there was no forensic evidence linking Stone to the crime. The confession however merely repeated facts that had been published in the national press on 23 September 1997. The case was otherwise simply circumstantial. The jury took nearly 15 hours over two days to find Stone guilty by a 10–2 majority verdict.
Some evidence against Stone was not able to be presented in court, such as his long record of violent crime and of severe mental illness. The statements from the psychiatrist and nurses who had named Stone as a suspect after the Crimewatch reconstruction, in which they told of Stone's threats to kill and of his irrational and dangerous behaviour only days before the murders, were also not heard by the jury. After the arrest of Stone, surviving victim Josie Russell had said that she recognised him from newspaper pictures in articles covering the story, but evidence admissibility laws prevented this from being heard in court. Police were also unable to present their suspicions that Stone was responsible for the theft of a lawnmower yards from the murder site on the day of the murder.
Successful appeal, second guilty verdict
The Court of Appeal ordered a retrial in February 2001, after two out of the three prisoners had their evidence discredited. Within 24 hours of the first trial one of the prisoners who gave key evidence, Barry Thompson, admitted he had lied about Stone confessing to him and retracted his evidence. It was also found that a second prisoner who gave evidence, Mark Jennings, had been paid £5,000 by The Sun newspaper and promised a further £10,000 before he gave his evidence, and so his statement was deemed unreliable.
However, Stone was convicted a second time in 2001, the jury taking less time than in the first trial to find him guilty. As part of the trial, the jury visited the prison cells where Stone's confession to Daley was alleged to have taken place, and listened as a book was read through the pipe joining the two cells to judge whether the confession was plausible.
Later court decisions
Stone was granted leave to appeal again in 2004, with his lawyers claiming Daley's testimony was unreliable. However, this second appeal was rejected in 2005, with the judge saying that he was "unpersuaded" by evidence which Stone's lawyers said undermined Daley's evidence. On 21 December 2006, a High Court judge decided that Stone should spend at least 25 years in prison before being considered for parole, meaning he is likely to remain in prison until at least 2023 and the age of 63. The judge had said that imposing a whole-life order was appropriate, but that 25 years was the longest tariff he was "legally entitled" to impose.
Mental health inquiry
Following Stone's conviction, an inquiry was held into the care he received for his drug addiction and mental health problems. Stone had threatened to kill his probation officer, his family, and criminal justice staff in an "aggressive outburst" with a psychiatric nurse five days before the murders of Lin and Megan Russell. The inquiry, led by Sir Robert Francis QC, found failings in his care, but said that Stone's case was "emphatically not a case of a man with a dangerous personality disorder being generally ignored by agencies or left at large". Shaun Russell disagreed with the report's conclusion that the murders could not have been prevented.
In response to Stone's conviction, Alan Milburn (then Health Secretary) proposed a reform of the Mental Health Act 1983. The White Paper proposal sought to reform the 1983 MHA's "treatability test", which stated that only patients whose mental disorders were considered treatable could be detained. Individuals diagnosed as psychopathic or with anti-social personality disorder, such as Stone, could not be detained because these conditions were not considered treatable. The proposed changes were intended to allow the government to detain individuals who had not committed a crime. The proposed measures were described as "draconian" by Nacro and a number of changes were made before the bill was finally passed as the Mental Health Act 2007.
Claim of innocence
Stone continues to argue that his conviction is a miscarriage of justice on the grounds that the evidence against him came from another prisoner, who was described as a "career criminal" who the Crown acknowledged "would lie when it suited him". Stone's sister, who originally thought Stone could indeed be guilty of the crime, said in 1998 that she had changed her mind and been persuaded that her brother was not guilty. However, she said that she suspected her brother had killed before.
In 2010, the Criminal Cases Review Commission (CCRC) announced that it would not refer the case back to the Court of Appeal because it had found no new evidence to justify making a referral. As part of its investigations, the CCRC had carried out a number of forensic tests on the materials found at the crime scene at the request of Stone's legal team.
Subsequently, Stone's legal team applied in 2011 for a judicial review, seeking court orders which would force the CCRC to reconsider their decision. As part of this, Stone's team cited the dismissal of the testimony of a new witness, prisoner Alan King, who had come forward to say that the prisoner Stone allegedly confessed to was lying. The Court of Appeal found that the CCRC was entitled not to find the new witness's evidence credible based on the length of time it had taken the witness to come forward.
Stone's legal team had asked the CCRC to re-examine a long boot lace which had been used in the attacks and had been dropped at the scene of the crime by the murderer. With the advance of DNA testing, Stone's team requested that the lace be examined using more modern forensic techniques to see if the attackers DNA could now be found on it. However, the police said the lace could not be located.
Stone's legal team have argued that Levi Bellfield could be responsible for the killings. However, Bellfield's partner at the time, Johanna Collings, has insisted that she was with him on the day of the murders as it was her birthday. She had told investigators this, and it was an alibi that detectives found credible. Collings had helped detectives convict Bellfield for his previous murders, such as in the Milly Dowler murder, giving evidence that he knew well the area where her body was left. In regards to the Russell murders, however, she commented in a BBC documentary in 2017:
In 2013, criminologist David Wilson investigated the possibility that Levi Bellfield could be responsible for the murders in an episode of his Killers Behind Bars: The Untold Story series. He stated that he doubted the strength of Stone's conviction, in particular highlighting that "cell confessions" are notoriously unreliable, and conveyed his surprise that this was the basis for Stone's conviction. He also cited a letter from the prisoner Alan King (whose claims had previously been cited by Stone's legal team in his 2010 appeal and which had been deemed discredited) which said that Damien Daley had admitted to him that Stone had never confessed to him, and that he had only claimed this as he imagined it might win him an earlier release. Wilson also concluded in the programme that it was unlikely that Bellfield was responsible for the murders, citing a number of differences in the way the crimes were carried out from Bellfield's previous murders, particularly how Bellfield's known crimes occurred in urban London while the murders of the Russells occurred in rural Kent.
In May and June 2017, the case was scrutinised in a two-part BBC Two programme, The Chillenden Murders, in which a team of independent experts re-examined the evidence, and suggested that the wrong man might have been convicted. Two of the legal experts who took part in the programme – defence barrister Stephen Kamlish QC and legal expert Sheryl Nwosu – stated that there are significant doubts regarding the conviction and are now working on Stone's behalf to have the case re-examined with the aim of launching a third appeal against the conviction.
On 29 November 2017, BBC Wales reported that Levi Bellfield had allegedly confessed to the murders to a fellow prisoner, giving details that "would only be known by the killer". Bellfield denied that he committed the murders and denied making the confession.
In February 2022 Stone's solicitor, Paul Bacon, stated that Bellfield had confessed to the murders in a four-page statement, with details only the killer would know. However, a member of Stone's legal team stated that there was nothing in Bellfield's statement which was not already in the public domain, suggesting he could have fabricated it using known evidence. The detective responsible for investigating Bellfield's known crimes also stated to the press: "Knowing Bellfield as I do, this could be him playing mind games". The Metropolitan Police previously investigated allegations that Bellfield was involved in the Russell murders and found no evidence to support the suggestion.
In 2023 Bellfield's lawyer claimed that Bellfield had admitted to the murders during a conversation with a prison psychologist. Stone's lawyer declared that a signed confession by Bellfield had been handed over to the CCRC. However, Bellfield later retracted the confessions, and it was reported that he had then sent a letter to Kent Police explaining that he had only confessed for a £5,000 cash payment. Bellfield had previously stated in 2017 that he had been repeatedly offered money by Stone's defence team to confess to the killings. The senior investigating officer on the Bellfield case Colin Sutton commented: "My view is that Bellfield knows he is in prison forever, that he has somehow joined up with Stone and offered to lie on his behalf for payment". Bellfield's 2023 letter claiming he had been offered £5,000 to confess was also passed to the CCRC. Ultimately, in July 2023 the CCRC announced that Stone's case would not be referred to the Court of Appeal as there was "no real possibility" that the court would overturn his conviction. It explained that it had "identified no credible new evidence or information" and "considered whether there are any further proportionate lines of inquiry with the prospect of yielding new evidence capable of making a difference to the safety of Mr Stone’s conviction", but "has not identified any".
In October the CCRC announced that it was conducting a fresh review of Stone's case. The decision followed a statement by Stone's legal team that they would seek judicial review of the previous decision not to refer the case. The CCRC commented: "While we can’t comment on the specifics of an investigation, it is not unusual for different reviews to focus on different arguments or evidence". It added that: "the CCRC’s previous reviews found no credible evidence or argument that raised a real possibility of the convictions being quashed – these conclusions are not affected by the new review".
2021 retrieval of murder weapon
In May 2021, it came to light that Kent Police had relocated the lace found at the scene of
the attacks, which had been mislaid, and that Stone's defence team had asked for it to be analysed for DNA traces, hoping it could lead to the overturning of his conviction.
See also
Murders of Kate Bushell and Lyn Bryant – unsolved similar murders of a child in 1997 and a woman in 1998
Colin Norris – subject of a similarly high-profile miscarriage-of-justice campaign
Simon Hall – convicted murderer who maintained his innocence for years but later confessed
Ernest Barrie – UK killer whose conviction was quashed after a Rough Justice campaign, and who later killed a man
Michael Weir – UK man who had his murder conviction quashed but who was found guilty on retrial
References
External links
Timeline: the Russell murders at BBC, published 25 September 2006
Justice Files: R v Michael John Stone at www.michaelstone.co.uk
1960 births
20th-century English criminals
20th-century English LGBT people
21st-century English LGBT people
British people convicted of burglary
British people convicted of robbery
Criminals from Kent
English people convicted of murder
English prisoners sentenced to life imprisonment
Hammer assaults
Living people
People convicted of assault occasioning actual bodily harm
People convicted of murder by England and Wales
People from Royal Tunbridge Wells
Prisoners sentenced to life imprisonment by England and Wales |
North Point Park may refer to:
North Point Park (Van Buren County, Michigan)
North Point Park (Massachusetts)
North Point State Park, Maryland |
Josip Landeka (born 28 April 1987) is a retired professional footballer who played as midfielder. Born in Germany, he represented Croatia at under-19 international level.
Early life
Landeka was born in Offenbach, West Germany on 20 April 1987.
Club career
Landeka was with 1. FSV Mainz 05 II from July 2006 to June 2008. He scored two goals in 28 matches during the 2006–07 season and a goal in 27 matches during the 2007–08 season. He was with the first team for the 2007–08 season. However, he didn't make any appearances. He then joined Stuttgarter Kickers for the 2008–09 season. He scored three goals in 23 appearances. He then moved on a free transfer to Wehen Wiesbaden prior to the 2009–10 season. He failed to score any goals in 11 league appearances and one German Cup appearance. He also failed to score any goals in nine appearances for the reserve team.
Career statistics
Notes
External links
1987 births
Living people
Footballers from Offenbach am Main
German people of Croatian descent
Men's association football midfielders
German men's footballers
Croatian men's footballers
Croatia men's youth international footballers
Croatian expatriate sportspeople in Germany
1. FSV Mainz 05 II players
Stuttgarter Kickers players
Stuttgarter Kickers II players
SV Wehen Wiesbaden players
FC Carl Zeiss Jena players
Chemnitzer FC players
SV Darmstadt 98 players
SG Sonnenhof Großaspach players
3. Liga players
Regionalliga players |
, also known as EBC, is a Japanese broadcast network affiliated with the FNN/FNS . Their headquarters are located in Matsuyama, Ehime Prefecture.
History
1969 December 10: It was set up as Ehime Prefecture's second broadcasting station.
2006 October 1: Digital transmission was started from their Matsuyama Main Station.
In 1964, 14 companies applied for a broadcast license for the second commercial broadcaster in Ehime Prefecture.In July 1968, these applications were later merged by the Prefectural Government which was later approved in October of the same year.On October 26, 1969, TV Ehime started trial broadcasts and followed by its first official broadcast on December 10 of the same year.
TV Ehime won its first Triple Crown Ratings in October 1976 with an average rating of 16% for all day and 29.9% for primetime.
Stations
Analog Stations
Matsuyama (Main Station) JOEI-TV 37ch
Digital Stations (ID:8)
Matsuyama (Main Station) JOEI-DTV 27ch
Rival Stations
Nankai Broadcasting (RNB)
i-Television (ITV)
Ehime Asahi Television (eat)
References
External Links
Television Ehime official site
Companies based in Ehime Prefecture
Fuji News Network
Television stations in Japan
Television channels and stations established in 1969
Mass media in Matsuyama, Ehime |
Prolecanitida is an order of extinct ammonoid cephalopods, the major Late Paleozoic group of ammonoids alongside the order Goniatitida. Prolecanitids had narrow shells, discoidal (disc-shaped) to thinly lenticular (lens-shaped). They retained a retrochoanitic siphuncle, a simple form with septal necks extending backwards. As is typical for ammonoids, the siphuncle sits along the ventral margin of the shell.
Prolecanitids form a relatively small and stable order within the Ammonoidea, with 43 named genera and about 1250 species. They were a long-ranging lineage, surviving for about 108 m.y. stretching from the Devonian–Carboniferous boundary to the Early Triassic. Although not as diverse as their goniatitid contemporaries, the Prolecanatida provided the stock from which all later Mesozoic ammonoids were derived.
Most prolecanitids had goniatitic sutures. The sutures start at a narrow ventral lobe, which can range from undivided to tridentate (three-pointed). The saddles are generally rounded, with the first umbilical (or second lateral) saddle often the largest in the suture line. The lobes are usually pointed, though members of the family Daraelitidae acquire a few finely serrated lobes (as characteristic for ceratitic sutures). The first lateral saddle is proportionally small, though its corresponding lateral lobe is broad and typically bifid (two-pointed).
Evolution and phylogeny
The origin of the Prolecanitida may be found in the Prolobitidae, a family which was originally included in the Anarcestida but recently removed to the Goniatitida. Following their inception, the Prolecanitida divided into two lineages, ranked as superfamilies. In the earlier (Lower Mississippian – Middle Permian) Prolecanitoidea, the shells are fairly smooth and characteristically have a large umbilicus and a generally evolute form. In the later (Upper Mississippian – Triassic) Medlicottioidea, the umbilicus is small, shells tend to be involute, and there is moderate sculpture along the flanks.
The oldest known prolecanitids were the family Prolecanitidae, which appeared around the Devonian–Carboniferous boundary and diversified in the Tournaisian stage. One of the most basal members of the order was Protocanites, which has been (likely erroneously) reported from the latest Devonian Louisiana Limestone of Missouri. The prolecanitoid family Daraelitidae is the probable source for the order Ceratitida, beginning with the family Xenodiscidae in the Middle Permian. Not counting their ceratite descendants, the youngest known prolecanitids were Episageceras and Latisageceras, two Early Triassic medlicottioid genera in the subfamily Episageceratinae.
Prolecanitids showed long-term, gradual changes in shell geometry. Likewise, they utilized a more limited set of available forms (a smaller morphospace) as compared to the dominant goniatitids. Prolecanitid genera averaged 14.7 million years in duration, as compared to 5.7 million years for Upper Carboniferous goniatitids.
Suture morphology in the Prolecanitida changed dramatically over time, from very simple sutures in the earliest genera to much more complex-sutured genera in the late Paleozoic. The increase in suture complexity over the 108 m.y. duration resulted from the iterative of addition of umbilical lobes, increasing serration of lobes, and the subdivision of lateral and ventral lobes. As many as 12–15 replicate, U-shaped umbilical lobes were added to the sutures during both ontogeny and phylogeny, originating at the umbilicus and migrating outward across the flanks.
Suture patterns in Prolecanitida evolved differently than in the Goniatitda, by increasing the number of umbilical lobes rather than by subdivision of the lateral saddle. Moreover, the body chamber in Prolecanitida was comparatively short, taking up only about half of the largest whorl. This complicates the question of the relationship between the Goniatitida and the Prolecanitida and their Mesozoic descendants.
References
Miller, Furnish, and Schindewolf, 1957; Paleozoic Ammonoidea, Suborder Prolecanitina, L69, in The Treatise on Invertebrate Paleontology, Part L, Ammonoidea.
Species and Genus Level Evolution in the Fossil Record
Cephalopod orders
Late Devonian first appearances
Late Devonian animals
Triassic extinctions |
The Berlin Motor Show originally started in 1897 in the German capital Berlin as the home of the International Motor Show (Internationale Automobil-Ausstellung, IAA) and ran until 1939. From 1951 the IAA eventually became established in Frankfurt.
A new bi-annual Motor Show, called Autos, Avus, Attraktionen (AAA), was established by the Messe Berlin company in 1978. The last show was held in 2000, with the 2002 show cancelled four months prior to the expected 2002 exhibition.
History
On 30 September 1897, the first IAA was held by the Mitteleuropäischer Motorwagenverein ("Central European Motor Vehicle Association") at the Hotel Bristol on the Unter den Linden boulevard in Berlin. A total of eight Benz Velo, Lutzmann, Kühlstein, and Daimler motor vehicles were on display. A second motor show was held in 1898 at the exhibition grounds near Lehrter Bahnhof; in 1899 more than 100 exhibitors participated in the third motor show .
As the automobile became more known and accepted, the IAA became a fixed event in Germany, with at least one held every year, usually in Berlin. In 1902 the show was held for the first time by the Association of German Automotive Industrialists (Verein Deutscher Motorfahrzeug-Industrieller) at Berlin Friedrichstraße station. The 7th exhibition in 1905 was inaugurated by Emperor Wilhelm II and until 1907, there were even two shows per year, as production had increased to an industrial level. In the next years, however, the show was suspended, due to the outbreak of World War I.
With a pause after the war, the IAA was then reinstated and returned to a newly built exhibition hall in Berlin Westend in 1921, with 67 German automobile manufacturers displaying 90 vehicles under the motto "comfort", including the Rumpler Tropfenwagen and a Bosch electric car horn. More than 600 exhibitors participated in the 15th IAA in 1923 and the next year's show saw the premiere of economy cars like the Hanomag 2/10 PS or the Opel 4 PS (Laubfrosch). The 1927 IAA was held at Cologne (under pressure from Mayor Konrad Adenauer), followed by the 20th IAA in Leipzig in March 1928, nevertheless, the 21st exhibition was again held in Berlin in November. It featured the first German vehicle with a rack steering and independent suspension (Röhr 8) as well as the eight-cylinder Opel Regent luxury car and a crank operated window by Brose. The 1929, 1930, and 1932 IAA were cancelled due to the Great Depression. Despite the still perceptible after-effects of the global recession, the 22nd IAA was held in Berlin in 1931 with a total of 295,000 visitors. For the first time the exhibition included front-wheel drive vehicles like the DKW F1.
The 23rd IAA was held from 11 to 23 February 1933, a few days after the Nazi seizure of power. It was inaugurated by Chancellor Adolf Hitler, who announced tax benefits for car owners, a major road construction programme and state-funded motorsport events. New models introduced included the Ford Köln, the Standard Superior, as well as the twelve-cylinder Maybach Zeppelin DS 8, then the most expensive German car ever built. In the following years, the annual exhibition developed to a national hall of fame of German engineering skill, essentially influenced by Nazi propaganda. Pushed by extensive billboard and screen advertising, the IAA finally became a mass event, with more than 600,000 visitors in 1934. In his inaugural speech, Hitler promised the construction of a cheap, simple car for the masses. He also proclaimed the idea of economic autarky, illustrated by the display of wood gas generators based on the patent of Georges Imbert or a steam car designed by Henschel. Nevertheless, the launch of the stream-lined Tatra 77 attracted greater attention.
The manufacturing of the people's car (Volkswagen) remained the central issue of the following exhibitions. Finally in 1939, the KdF-car was presented for the first time, which later came to be known as the Beetle. The 29th installation of the event gathered a total of 825,000 visitors - an all-time record at that time. This was the last IAA before it was again suspended during World War II.
2000
The 2000 show was the last Berlin Motor Show, with over 200,000 visitors.
Audi A4 Sedan
Opel Zafira 1.6 CNG
1998
In 1998, the AAA was held at the Berlin exposition area between October 17 and 25.
1996
Audi A4 Avant Duo
Ford Ka "Step 1" Concept
References
Auto shows in Germany
Events in Berlin |
Acropora pharaonis is a species of acroporid coral that was first described by Milne-Edwards and Haime in 1860. Found in marine, tropical, reefs on slopes sheltered from wave action, it occurs at depths of between . It is classed as a vulnerable species on the IUCN Red List, and it has a decreasing population. It is common and found over a large area and is classified under CITES Appendix II.
Description
Acropora pharaonis is found in colonies of flat table-like structures, or simply in structures of clumped vertical or horizontal twisted branches. Colonies can have heights over and they are orderly and symmetrical. Branchlets are of lengths up to with diameters of and branchlets can reach long and have diameters. Brown-grey in colour with branches having pale tips, the branches become thinner towards the ends and contain many small branchlets, which contain axial, incipient axial, and radial corallites. The axial corallites, located on the ends of the branchlets, are small with outer diameters of between 1.5 and 2.6mm and inner diameters of 0.6-1.5mm. Incipient axial corallites frequently occur on the branchlets, giving them a spikey surface. The radial corallites are located in close proximity and contain small nose-shaped openings and randomly placed spinules. This species looks similar to Acropora clathrata, Acropora parapharaonis, and Acropora plumosa. It is found in a marine environment on the slopes of tropical reefs at depths between . Its mineralised tissue is composed of aragonite (calcium carbonate).
Distribution
Acropora pharaonis is common and found over a large range; the Indian Ocean, the Red Sea, the Persian Gulf, the Gulf of Aden, New Caledonia, Fiji, American Samoa, and potentially in Cocos-Keeling. It is threatened by climate change, coral disease, rising sea temperatures leading to bleaching, reef destruction, being prey to Acanthaster planci, and human activity. It is rated as a vulnerable species on the IUCN Red List, is listed CITES Appendix II, and could occur within Marine Protected Areas.
Taxonomy
It was first described by Haime and Henri Milne-Edwards in 1860 in genus Madrepora.
References
Acropora
Cnidarians of the Pacific Ocean
Fauna of the Indian Ocean
Fauna of the Red Sea
Marine fauna of Asia
Marine fauna of Oceania
Fauna of Southeast Asia
Vulnerable fauna of Asia
Vulnerable fauna of Oceania
Corals described in 1860
Taxa named by Henri Milne-Edwards
Taxa named by Jules Haime |
Resistant starch (RS) is starch, including its degradation products, that escapes from digestion in the small intestine of healthy individuals. Resistant starch occurs naturally in foods, but it can also be added as part of dried raw foods, or used as an additive in manufactured foods.
Some types of resistant starch (RS1, RS2 and RS3) are fermented by the large intestinal microbiota, conferring benefits to human health through the production of short-chain fatty acids, increased bacterial mass, and promotion of butyrate-producing bacteria.
Resistant starch has similar physiological effects as dietary fiber, behaving as a mild laxative and possibly causing flatulence.
Origin and history
The concept of resistant starch arose from research in the 1970s and is currently considered to be one of three starch types: rapidly digested starch, slowly digested starch and resistant starch, each of which may affect levels of blood glucose.
The European Commission-supported-research eventually led to a definition of resistant starch.
Health effects
Resistant starch does not release glucose within the small intestine, but rather reaches the large intestine where it is consumed or fermented by colonic bacteria (gut microbiota). On a daily basis, human intestinal microbiota encounter more carbohydrates than any other dietary component. This includes resistant starch, non-starch polysaccharide fibers, oligosaccharides, and simple sugars which have significance in colon health.
The fermentation of resistant starch produces short-chain fatty acids, including acetate, propionate, and butyrate and increased bacterial cell mass. The short-chain fatty acids are produced in the large intestine where they are rapidly absorbed from the colon, then are metabolized in colonic epithelial cells, liver or other tissues. The fermentation of resistant starch produces more butyrate than other types of dietary fibers.
Studies have shown that resistant starch supplementation was well tolerated. Modest amounts of gases such as carbon dioxide, methane, and hydrogen are also produced in intestinal fermentation. One review estimated that the acceptable daily intake of resistant starch may be as high as 45 grams in adults, an amount exceeding the total recommended intake for dietary fiber of 25–38 grams per day. When isolated resistant starch is used to substitute for flour in foods, the glycemic response of that food is reduced.
There is limited evidence that resistant starch can improve fasting glucose, fasting insulin, insulin resistance and sensitivity, especially in individuals who are diabetic, overweight or obese. In 2016, the U.S. FDA approved a qualified health claim stating that resistant starch might reduce the risk of type 2 diabetes, but with qualifying language for product labels that limited scientific evidence exists to support this claim. Because qualified health claims are issued when the science evidence is weak or not consistent, the FDA requires specific labeling language, such as the guideline concerning resistant starch: "High-amylose maize resistant starch may reduce the risk of Type 2 diabetes. FDA has concluded that there is limited scientific evidence for this claim."
Resistant starch may reduce appetite, especially with doses of 25 grams or more.
Resistant starch may reduce low-density cholesterol.
There is limited evidence that resistant starch might improve inflammatory biomarkers, including interleukin-6, tumor necrosis factor alpha, and C-reactive protein.
Starch structure
Plants store starch in tightly packed granules, consisting of layers of amylose and amylopectin. The size and shape of the starch granule varies by botanical source. For instance, the average size of potato starch is approximately 38 micrometers, wheat starch an average of 22 micrometers and rice starch approximately 8 micrometers.
{| class="wikitable"
|-
! colspan=4 | Starch granule characteristics
|-
! Starch || Diameter, microns (micrometers) || Granule Shape ||Gelatinization temp, °C
|-
| Maize / corn || align=center | 5-30|| Round, Polygonal || align=center | 62-72
|-
| Waxy maize || align=center | 5-30|| Round, Polygonal || align=center | 63-72
|-
| Tapioca || align=center | 4-35 || Oval, Truncated ||align=center | 62-73
|-
| Potato || align=center | 5-100 ||Oval, Spherical || align=center | 59-68
|-
| Wheat || align=center | 1-45||Round, Lenticular|| align=center | 58-64
|-
| Rice || align=center | 3-8 ||Polygonal, Spherical Compound granules ||align=center | 68-78
|-
| High amylose maize ||align=center | 5-30||Polygonal, Irregular Elongated || align=center | 63-92 (not gelatinized in boiling water)
|}
Raw starch granules resist digestion, e.g., raw bananas, raw potatoes. This does not depend on the amylose or amylopectin content, but rather the structure of the granule protecting the starch.
When starch granules are cooked, water is absorbed into the granule causing swelling and increased size. In addition, amylose chains can leak out as the granule swells. The viscosity of the solution increases as the temperature is increased. The gelatinization temperature is defined as the temperature at which maximum gelatinization or swelling of the starch granule has occurred. This is also the point of maximum viscosity. Further cooking will burst the granule apart completely, releasing all of the glucose chains. In addition, viscosity is reduced as the granules are destroyed. The glucose chains can reassociate into short crystalline structures, which typically involves rapid recrystallization of amylose molecules followed by a slow recrystallization of amylopectin molecules in a process called retrogradation.
Plants produce starch with different types of structure and shape characteristics which may affect digestion. For instance, smaller starch granules are more available to enzyme digestion because the larger percentage of surface area increases the enzyme binding rate.
Starch consists of amylose and amylopectin which affect the textural properties of manufactured foods. Cooked starches with high amylose content generally have increased resistant starch.
Definition and categorization
Resistant starch (RS) is any starch or starch digestion products that are not digested and absorbed in the stomach or small intestine and pass on to the large intestine. RS has been categorized into five types:
RS1 – Physically inaccessible or undigestible resistant starch, such as that found in seeds or legumes and unprocessed whole grains. This starch is bound within the fibrous cell walls of the aforementioned foods.
RS2 – Resistant starch is inaccessible to enzymes due to starch conformation, as in green bananas, raw potatoes, and high amylose corn starch.
RS3 – Resistant starch that is formed when starch-containing foods (e.g. rice, potatoes) are cooked and cooled, such as pasta. Occurs due to retrogradation, which refers to the collective processes of dissolved starch becoming less soluble after being heated and dissolved in water and then cooled.
RS4 – Starches that have been chemically modified to resist digestion.
RS5 – Starches that are complexed with lipids.
Processing effects
Processing may affect the natural resistant starch content of foods. In general, processes that break down structural barriers to digestion reduce resistant starch content, with greater reductions resulting from processing. Whole grain wheat may contain as high as 14% resistant starch, while milled wheat flour may contain only 2%. Resistant starch content of cooked rice may decrease due to grinding or cooking.
Other types of processing increase resistant starch content. If cooking includes excess water, the starch is gelatinized and becomes more digestible. However, if these starch gels are then cooled, they can form starch crystals resistant to digestive enzymes (Type RS3 or retrograded resistant starch), such as those occurring in cooked and cooled cereals or potatoes (e.g., potato salad). Cooling boiled potatoes overnight at 4 °C (39.2 °F) was found to increase the amount of resistant starch by a factor of 2.8.
High amylose varieties of corn, wheat, barley, potato and rice have been naturally bred to increase the resistant starch content that will survive baking and mild extrusion processing, which enables the delivery of resistant starch in processed foods.
Nutritional information
Resistant starch is considered both a dietary fiber and a functional fiber, depending on whether it is naturally in foods or added. Although the U.S. Institute of Medicine has defined total fiber as equal to functional fiber plus dietary fiber, U.S. food labeling does not distinguish between them.
{| class="wikitable"
|-
! colspan=4 | Examples of naturally occurring resistant starch
|-
! Food || Serving size (1 cup is ≈227 grams) || Resistant starch (grams) || grams per 100 grams (%)
|-
| Banana flour, from green bananas || 1 cup, uncooked || align=center | 42–52.8 || align=center | ~20.9 (dry)
|-
| Banana, raw, slightly green || 1 medium, peeled || align=center | 4.7
|-
| High amylose RS2 corn resistant starch || 1 tablespoon (9.5 g) || align=center | 4.5 || align=center | 47.4 (dry)
|-
| High amylose RS2 wheat resistant starch || 1/4 cup (30 g) || align=center | 5.0 || align=center | 16.7
|-
| Oats, rolled || 1 cup, uncooked (81.08 g) || align=center | 17.6 || align=center | 21.7 (dry)
|-
| Green peas, frozen || 1 cup, cooked (160 g) || align=center | 4.0 || align=center | 2.5
|-
| White beans || 1 cup, cooked (179 g) || align=center | 7.4 || align=center | 4.1
|-
| Lentils || 1 cup cooked (198 g) || align=center | 5.0 || align=center | 2.5
|-
| Cold pasta || 1 cup (160g) || align=center | 1.9 || align=center | 1.2
|-
| Pearl barley || 1 cup cooked (157 g) || align=center | 3.2 || align=center | 2.03
|-
| Cold potato || 1/2" diameter || align=center | 0.6 – 0.8
|-
| Oatmeal || 1 cup cooked (234 g) || align=center | 0.5 || align=center | 0.2
|}
The Institute of Medicine Panel on the Definition of Dietary Fiber proposed two definitions: functional fiber as "isolated, nondigestible carbohydrates that have beneficial physiological effects in humans", and dietary fiber as "nondigestible carbohydrates and lignin that are intrinsic and intact in plants." They also proposed that the prior classifications of soluble versus insoluble be phased out and replaced with viscous versus fermentable for each specific fiber.
Uses
In food
Starch has been consumed by people and animals for thousands of years. Thus, foods containing resistant starch are already commonly consumed.
It has been estimated that average resistant starch intake in developed countries ranges from 3–6 grams/day for Northern Europeans, Australians and Americans, 8.5 grams/day for Italians and 10–15 grams/day in Indian and Chinese diets. The higher consumption of starch-containing foods like pasta and rice likely accounts for higher intake of resistant starch in Italy, India and China.
Several studies have found that the traditional African diet is high in resistant starch. Rural black South Africans consume an average of 38 grams of resistant starch per day by having cooked and cooled corn porridge and beans in their diets.
RS2 resistant starch from high amylose wheat and high amylose corn can be baked into foods, usually replacing flour or other high glycemic carbohydrates.
Isolated
Isolated and extracted resistant starch and foods rich in resistant starch have been used to fortify foods to increase their dietary fiber content. Typically, food fortification utilizes RS2 resistant starch from high amylose corn or high amylose wheat, RS3 resistant starch from cassava and RS4 resistant starch from wheat and potato, as these sources can survive varying degrees of food processing without losing their resistant starch content.
Resistant starch has a small particle size, white appearance, bland flavor and low water-holding capacity. Resistant starch typically replaces flour in foods such as bread and other baked goods, pasta, cereal and batters because it can produce foods with similar color and texture of the original food. It has also been used for its textural properties in imitation cheese.
Some types of resistant starch are used as dietary supplements in the United States. RS2 from potato starch and green banana starch maintain their resistance as long as they are consumed raw and unheated. If they are heated or baked, these types of starch may become rapidly digestible.
References
Starch
Prebiotics (nutrition)
Food additives |
Area commands were the major operational and administrative formations of the Royal Australian Air Force (RAAF) between 1940 and 1954. Established in response to the outbreak of World War II, they underpinned the Air Force's geographically based command-and-control system for the duration of the conflict and into the early years of the Cold War, until being superseded by a functional control system made up of Home, Training, and Maintenance Commands.
The area commands and their responsibilities evolved over time according to changing circumstances. The RAAF established four commands to begin with in 1940–41: Southern Area, Central Area, Western Area, and Northern Area. They oversaw most of the operations, training and maintenance within their boundaries. A concession to functional control occurred in mid-1941, when the Air Force formed two groups that assumed the training role of the southern and eastern states; Central Area was disbanded and most of its units taken over by Northern and Southern Areas, and the newly formed No. 2 (Training) Group. The area structure was further revised in 1942, following the outbreak of the Pacific War; Northern Area was split into North-Eastern Area and North-Western Area, and a new command, Eastern Area, was created, making a total of five commands. The same year, the RAAF formed two functional groups that assumed the maintenance role of the area commands; the latter focussed on operations until the end of hostilities. A new area command covering RAAF units in New Guinea, Northern Command, was formed in 1944 and dissolved soon after the war.
By the early 1950s, most operational units were based within Eastern Area Command, most Air Force training was controlled by Southern Area Command, and maintenance was the responsibility of Maintenance Group. The area command structure was no longer considered appropriate for delivering the concentration of force necessary for combat, and the Federal government decided to replace it with a functional command-and-control system. In 1953, Eastern Area Command was re-formed as Home Command (controlling operations), Southern Area Command was re-formed as Training Command, and Maintenance Group was re-designated Maintenance Command. The three remaining area commands ceded their authority to the functional commands in 1954, and were disbanded by the end of 1956.
History
Origin and purpose
On the eve of World War II, the Royal Australian Air Force (RAAF) comprised twelve flying squadrons, two aircraft depots and a flying school, situated at five air bases: Point Cook and Laverton in Victoria; Richmond and Rathmines in New South Wales; and Pearce in Western Australia. An air force of this size did not require large-scale operational formations such as wings, groups, or commands, as all units could be directly administered and controlled by RAAF Headquarters in Melbourne. With the onset of war in September 1939, the Australian Air Board decided to implement a decentralised form of command and control, commensurate with an envisioned increase in manpower and units. The RAAF's initial move in this direction was to create Nos. 1 and 2 Groups in November 1939, the former based in Melbourne to control units in Victoria, and the latter in Sydney to control units in New South Wales.
In January 1940, the Chief of the Air Staff, Air Vice-Marshal Jimmy Goble, proposed organising the RAAF along functional lines with Home Defence, Training, and Maintenance Commands, but the Federal government did not take up this plan. Goble was replaced in February by a Royal Air Force (RAF) officer, Air Chief Marshal Sir Charles Burnett, who focussed on rapid expansion of the RAAF to meet the needs of the Empire Air Training Scheme and believed that Australia's huge land mass would make a functional command system unwieldy. He proceeded to reorganise the Air Force into a geographically based "area" system. The roles of each area command were the same: air defence, protection of adjacent sea lanes, and aerial reconnaissance. Each area was led by an Air Officer Commanding (AOC) who was responsible for the administration and operations of all bases and units within his boundary. Exceptions to this policy included aircraft depots and the Central Flying School that trained flying instructors, as their range of responsibilities crossed area boundaries and therefore came under the direct control of RAAF Headquarters. The static area system was primarily defensive in nature, but considered well-suited to training new pilots, who could be instructed at flying schools and mentored through their initial squadron postings, all within the same geographical region.
Evolution and control
The RAAF planned four area commands initially: Southern Area, covering all units in Victoria, Tasmania, South Australia and the southern Riverina district of New South Wales; Central Area, covering units in New South Wales except southern Riverina and the north of the state; Western Area, covering units in Western Australia; and Northern Area, covering units in northern New South Wales, Queensland, Northern Territory and Papua. The first two commands established, in March 1940, were Southern Area, which essentially took over the role and headquarters of No. 1 Group in Melbourne, and Central Area, which evolved from No. 2 Group in Sydney. Western and Northern Areas eventually followed in January and May 1941, respectively; pending their formation, units in Queensland were temporarily controlled by Central Area Command, and those in Western Australia, Northern Territory and Papua came under the direct control of RAAF Headquarters.
By mid-1941, RAAF Headquarters had determined to form training units in the southern and eastern states into semi-geographical, semi-functional groups separate to the area commands. This led to the establishment in August of No. 1 (Training) Group in Melbourne, covering Victoria, Tasmania and South Australia, and No. 2 (Training) Group in Sydney, covering New South Wales and Queensland. Central Area was then disbanded and its responsibilities "divided as convenient", according to the official history of the war, between Southern Area, Northern Area, and No. 2 (Training) Group. Western Area retained responsibility for training, as well as operations and maintenance, within its boundaries.
With the outbreak of the Pacific War in December 1941, Northern Area was split the following month into North-Western and North-Eastern Areas, to counter distinct Japanese threats to Northern Australia and New Guinea, respectively. Southern Area was also considered appropriate for subdivision owing to its size, so Eastern Area was established in May 1942 to take over control of operational units in New South Wales and southern Queensland. These arrangements stabilised the number of area commands at five. Of necessity, the two northerly commands were primarily responsible for bombing and air defence, while the other commands focussed on maritime patrol and anti-submarine warfare. Further convergence of command-and-control responsibilities along semi-geographical, semi-functional lines took place between June and September 1942, when authority over maintenance units was transferred from the area commands to the newly formed No. 4 (Maintenance) Group in Melbourne and No. 5 (Maintenance) Group in Sydney. Some fine-tuning of the area boundaries occurred in August: as well as the Northern Territory, North-Western Area was given responsibility for the portion of Western Australia north of a line drawn south-east from Yampi Sound to the Northern Territory border, and part of Queensland adjacent to the Barkly Tableland.
Until 1942, RAAF Headquarters exercised complete operational and administrative control over the area commands. In April that year, Allied Air Forces (AAF) Headquarters was established under General Douglas MacArthur's South West Pacific Area (SWPA), with operational authority over all RAAF combat infrastructure, including the area commands. In September the new AAF commander, Major General George Kenney, formed the majority of his US flying units into Fifth Air Force, and most of their Australian counterparts into RAAF Command, led by Air Vice-Marshal Bill Bostock. Bostock exercised control of Australian air operations through the area commands, although RAAF Headquarters continued to hold overarching administrative authority, meaning that Bostock and his area commanders were ultimately dependent for supplies and equipment on the Chief of the Air Staff, Air Vice-Marshal George Jones, who had taken over from Burnett in May 1942.
To help overcome the static nature of the area command system, in September 1942 the RAAF created a large mobile formation known as No. 9 (Operational) Group, a self-contained tactical air force that could keep pace with Allied advances north through New Guinea and towards Japan. By April 1944, No. 9 Group had become a garrison force in New Guinea and lost its mobile function to No. 10 (Operational) Group (later the Australian First Tactical Air Force). No. 9 Group was therefore re-formed as a dedicated area command covering air units in New Guinea; Bostock had recommended calling it Northern Area, before RAAF Headquarters settled on Northern Command. In August that year, RAAF Headquarters proposed disbanding the training and maintenance groups formed in 1941–42 and return their functions to the control of the area commands, but no action was taken. The same month, the Air Board recommended carving a new Central Area Command out of Eastern Area, which it considered too large to be controlled by one headquarters. This proposed Central Area would have been responsible for units in southern Queensland but the War Cabinet deferred its decision, as it had when a similar concept was raised in October 1943.
Near the end of the war, No. 11 Group was formed on Morotai in the Dutch East Indies, using elements of Northern Command and the First Tactical Air Force; this freed the latter from garrison duties following the liberation of Borneo. In recommending the Morotai garrison's establishment, Bostock explained that while it shared the static characteristic of an area command, it differed in that the area commands were part of the permanent structure of the Air Force and situated within the borders of Australia's mainland and overseas territories, whereas the new formation was a temporary wartime measure, headquartered on foreign territory.
Post-war organisation and supersession
Following the end of the Pacific War in August 1945, SWPA was dissolved and the Air Board again assumed full control of all its operational formations. Nos. 1 and 2 (Training) Groups, and No. 5 (Maintenance) Group, were disbanded between January and March 1946. Northern Command, having been re-designated Northern Area in December 1945, was disbanded in February 1947. The other area commands continued to function with essentially the same boundaries as during the war, except that North-Western Area no longer covered the Dutch East Indies.
In the aftermath of the war, a geographically based command-and-control system was considered outmoded, and calls came to replace it with a system based on function. Bostock, who found the area boundaries "arbitrary", proposed a functional structure consisting of operational, maintenance, and training commands. With hindsight, the area commands were judged adequate for the organisation of the Air Force in the early years of World War II, but not for the rapid response times and concentration of force necessary to properly prepare for attacks on Australia following the start of the Pacific War, nor for conducting offensive operations from 1943 onwards. Air Marshal Jones, who had retained his position as Chief of the Air Staff (CAS) following the war, resisted pressure to replace the area structure. He was persuaded by his staff to set up a conference to discuss the possibility of change, but participation by the CAS, who had been satisfied with the wartime system, and the area commanders themselves, whose positions were on the line, was half-hearted at best. Jones did suggest reducing the number of area commands to three (Northern Area to cover Queensland and the Northern Territory, Eastern Area to cover New South Wales, and Southern Area to encompass Western Australia, South Australia, Victoria and Tasmania) as part of a much larger proposal to restructure the post-war RAAF, but this never eventuated.
The Federal government retired Jones in February 1952 and replaced him with an RAF officer, Air Marshal Donald Hardman, who was well versed in the functional command system employed in Britain. Hardman believed that restructuring the Air Force would remove inefficiencies and duplication, and permit commanders greater autonomy, allowing more effective concentration of strength in a potential combat situation. He declared that the RAAF was "the one force that could quickly strike for Australia's and the Commonwealth's defence in South East Asia". To this end he proposed reorganising command and control of the Air Force according to three major functions: operations, covering home defence and mobile task forces; training, including all permanent, reserve and national service recruitment and instruction; and maintenance, responsible for supply, equipment and other logistical services. The three functions were duly constituted in October 1953 as Home, Training, and Maintenance Commands, respectively.
Home Command was formed from the existing Eastern Area Command, which was considered a de facto operational organisation owing to the preponderance of such forces within its boundaries. Training Command was formed from Southern Area Command, as it was already the hub of training services, controlling those in New South Wales and Queensland as well as Victoria and South Australia. Maintenance Command was formed from the extant Maintenance Group—as No. 4 (Maintenance) Group had been known since July 1947—headquartered in Melbourne. The transition to a functional system was completed in February 1954, when the three new commands assumed control of all operations, training and maintenance from Western, North-Western, and North-Eastern Area Commands. The headquarters of these three area commands remained in existence but only, according to the Melbourne Argus, as "remote control points" for Home Command. North-Western Area Command was disbanded in June 1955, Western Area Command in November 1956, and North-Eastern Area Command in December 1956.
Aftermath
The functional commands established in 1953–54 were revised in 1959. Home Command was renamed Operational Command, and Training and Maintenance Commands merged to become Support Command. Operational Command was renamed Air Command in 1987, and three years later Support Command split into Logistics Command and Training Command. In 1997, logistics management became the responsibility of Support Command (Air Force), the RAAF component of the Defence-wide Support Command Australia (later subsumed by the Defence Materiel Organisation). Training Command was re-formed as Air Force Training Group, a force element group under Air Command, in 2006. Air Command became the sole command-level organisation in the RAAF.
Summary of area commands formed
The RAAF raised eight area commands over the course of World War II, and five of them continued to operate into the 1950s:
RAAF organisation chart
Notes
References
RAAF commands
Structure of contemporary air forces |
Játékok (Hungarian: Games) is an ongoing collection of "pedagogical performance pieces" by György Kurtág. He has been writing them since 1973. Ten volumes had been published as of 2021 (by Editio Musica Budapest). Volumes I, II, III, V, VI, VII, IX and X are for piano solo. Volumes IV and VIII are for piano 4-hands or two pianos.
Volume I was essentially completed in 1973 but not published until 1979, by which time Volumes II, III and IV had also been composed. Volumes V and VI were published in 1997, Volume VII in 2003, Volume VIII in 2010, Volume IX in 2017, and Volume X in 2021.
Several pieces from the collection have started to be regularly performed, including a Prelude and Chorale, an Antiphon in F, and one called 3 in memoriam.
Concept
Kurtág began the composition of Játékok to try to recapture something of the spirit of a child's play. He started with a few ideas set out in the foreword to the first four volumes:
Recordings
György Kurtág: Játékok Márta Kurtág and György Kurtág piano. With Bach transcriptions by Kurtág himself and his wife Márta. Recorded July 1996. ECM New Series 1619 (CD)
György Kurtág: Játékok Valeria Szervánszky and Ronald Cavaye. The first complete recording of volumes 1 - 4. Recorded October 1992. (4 CDs - available on iTunes, Amazon, CD Baby, etc.)
Performances
György Kurtág and his wife Márta performed an always-renewing selection of pieces for two and four hands, including transcriptions. The later volumes of Játékok bear the sub-title Diary Entries and Personal Messages. This, to some extent, reveals the lineage of the unique microcosms, which irresistibly involve the listener at their recitals.
The couple played a selection as part of the Composer's Portrait of the Rheingau Musik Festival, 8 August 2004, in the "Kulturforum Schillerplatz" (now "ESWE Atrium") in Wiesbaden. The Bach transcriptions, interspersed with the miniature character pieces, were Aus tiefer Not (BWV 687), Sonatina from Actus Tragicus, Trio sonata in E major (BWV 525) and O Lamm Gottes (BWV 618).
They performed in Carnegie Hall’s Zankel Hall in February 2009.
References
External links
ECM Records page on Játékok, accessed 4 Feb 2021
Compositions by György Kurtág
Compositions for solo piano
Compositions for piano four-hands
Contemporary classical compositions
Compositions that use extended techniques |
Allée des Acacias, in the Bois de Boulogne is a gouache on card painting by French artist Roger de La Fresnaye, from 1908. It depicts a car on a strete in the Bois de Boulogne. It is held in the Musée Carnavalet, in Paris. It was once used on a poster promoting cars made by the painter's brother.
References
1908 paintings
Paintings by Roger de La Fresnaye
Paintings in the Musée Carnavalet |
Lee Hsiu-fen (, 28 December 1910 – 18 January 1985) was a Chinese academic and politician. She was among the first group of women elected to the Legislative Yuan in 1948.
Biography
Lee was originally from Huailai County in Chahar Province. After graduating from Peking Normal University, she earned a master's degree at Stanford University in the United States. Returning to China, she became a professor at Guangdong Menqin University and Guangdong Provincial College of Arts & Science. She also served as headteacher of Chongqing China Women's Vocational School.
In the 1948 elections to the Legislative Yuan Lee ran as a Kuomintang candidate in Chahar Province and was elected to parliament. She relocated to Taiwan during the Chinese Civil War, where she became a professor at Chinese Culture University, Tamkang College of Arts and Sciences and Feng Chia Business School. She died in January 1985.
References
1910 births
Beijing Normal University alumni
Stanford University alumni
Academic staff of the South China Normal University
Members of the Kuomintang
20th-century Chinese women politicians
Members of the 1st Legislative Yuan
Members of the 1st Legislative Yuan in Taiwan
Academic staff of the Chinese Culture University
Academic staff of Tamkang University
Academic staff of Feng Chia University
1985 deaths |
Kalmunai North Hospital is a government hospital in Kalmunai, Sri Lanka. It is controlled by the central government in Colombo. As of 2010 it had 413 beds. The hospital is sometimes called Kalmunai North Base Hospital.
References
Central government hospitals in Sri Lanka
Kalmunai
Hospitals in Ampara District |
Tana Nile is a fictional character appearing in American comic books published by Marvel Comics.
Publication history
Tana Nile first appeared in Thor #129 and was created by Stan Lee and Jack Kirby.
Fictional character biography
Tana Nile, of the planet Rigel-3, was a leading female member of the Colonizers of Rigel. In her attempt to colonize the planet Earth, Tana Nile took a human form as Jane Foster's roommate. Tana took control of Jane Foster's will, and then resumed her Rigellian form. She attempted to take control of the Earth, but was ordered to cease her attempt to colonize Earth. She left Earth to be given a new assignment, and was told that the High Commissioner of Rigel had chosen her to be his wife. Some time later, she encountered Thor during his second journey into the Black Galaxy.
Tana Nile later encountered Sif, Hildegarde, and sailor Silas Grant on the Blackworld planet while she fought Ego-Prime. She revealed that Ego-Prime was a slab that she had removed from Ego the Living Planet and had taken to Blackworld in order to transform it into a habitable world, but that Ego-Prime had proved to be uncontrollable. Blackworld was destroyed in a nuclear war, and Tana and her allies fled to Earth, pursued by Ego-Prime. There, she was aided by Silas Grant in clashes with Ego-Prime's monsters. Tana assumed a human form in order to live on Earth. Tana then became an ally to Thor and the Asgardians. She aided Thor in battling trolls. She first visited Asgard. She was captured by Sssthgar, but was freed by Thor, and she released Odin, Hogun, and Fandral from captivity. She accompanied Thor to the Dark Nebula to help rescue Sif and Karnilla. She accompanied Thor back to Rigel-3, just in time to witness the destruction of Rigel-3 by the Rhunians. She was then reunited with the Grand Commissioner. She accompanied Thor to the planet Rhun. She then bade farewell to Thor, while Silas Grant announces that he will stay with his "good friend" Tana.
Tana visited Charles Xavier's Massachusetts Academy to learn more about human beings. During an adventure in an alternate dimension created by Franklin Richards, she fell in love with Howard the Duck. After a spontaneous kiss, Howard tells her of his attachment to Beverly Switzler, and she accepts that romance with him is inappropriate.
During the Annihilation storyline, Tana Nile frames Ronan the Accuser for the House of Fiyero in exchange for information on Ronan. He promises to hunt her down, along with others involved in the trial, to discover the true reason behind his dismissal. Tana Nile later joined Gamora's Graces, a collection of super-powered women from across the galaxy. The Graces, along with much of known space, comes under threat by Annihilus' Annihilation Wave. Tana does not survive.
Powers and abilities
Thanks to the alien attributes of the Rigellian race, Tana Nile has the ability to increase her own density at will, increasing her strength and resistance to physical injury to superhuman levels. She has the psionic ability to control the mind of another humanoid or to override another humanoid's control of his or her voluntary muscles (through "mind thrust").
Tana Nile wears body armor of unknown composition, which includes devices enabling her to rearrange the molecular structure of her body and clothing in order to disguise herself as an Earthwoman. She was armed with a "stasis gun" that can project concussive energy or intense heat. She also uses a solar beam communicator device, worn on her wrist, permitting instantaneous communication between Earth and Rigel via hyperspace transmission.
In other media
Television
Tana Nile appeared in The Super Hero Squad Show episode "Tremble at the Might of...MODOK."
Tana Nile appears in the Ultimate Spider-Man episode "Guardians of the Galaxy", voiced by Grey DeLisle. She is seen in a video game that Peter Parker and Sam Alexander are playing.
Tana Nile appears in the Guardians of the Galaxy episode "Girls Just Wanna Have Fun," voiced by Jessica DiCicco. This version is the daughter of the Grand Commissioner of Rigel. After Tana Nile fled from Rigel-3 to continue her party lifestyle on Conjunction as a way to avoid the Rigellians' coming of age ritual called the Centering, the Grand Commissioner hired the Guardians of the Galaxy to bring her back to Rigel-3. After some difficulty and a special strategy from Drax the Destroyer, the Guardians of the Galaxy were able to apprehend Tana Nile. While on their way back to Rigel-3 with Tana Nile, the Guardians of the Galaxy are warned by the Grand Commissioner that Tana Nile can throw tantrums most of the time and not to let her fall into the hands of a rebel Rigellian group called the Empathetics. As Tana Nile reminds him of his deceased daughter, Drax tries to keep her in a good mood. Eventually, the strain of being their prisoner causes Tana Nile to break Drax's stuffed toy Mr. Rhinopus and flee from the ship in a pod. Drax and Gamora track her to Scrapyard Drofnas where the Empathetics are. When the Empathetics start to harm Drax the Destroyer and Gamora, Star-Lord, Rocket Raccoon, and Groot arrive upon calling the Rigellian army. It was revealed during this time by Tana Nile and the Grand Commissioner that the Centering involves stripping the Rigellian of their emotions to get better control of their telepathy. When Tana Nile was caught in the tractor beam of the Grand Commissioner's ship with Drax also in toll, she accepts her fate as she passes this part of the Centering. Eventually, Tana Nile decides to follow in her father's footsteps where she plans to lead the Rigellians into an era of compassion and better understanding. In addition, she mails Drax a package containing his repaired Mr. Rhinopus. In the episode "Me and You and a Dog Named Cosmo," Tana Nile holds a Rigellian Peace Conference on Knowhere between the Grand Commissioner of Rigel and the Empathetics led by Jukka where Gamora and Drax the Destroyer help with the security detail. During the Universal Believers' attack on Knowhere, Tana Nile persuades her father and Jukka to use their telepathy to throw Drax the Destroyer towards the Universal Believers' flagship.
References
External links
Tana Nile at Marvel.com
Tana Nile at Comic Book Database
Characters created by Jack Kirby
Characters created by Stan Lee
Marvel Comics aliens |
Hamra: Al-Ḥamrāʾ means "the red one" in Arabic. It may refer to:
Places
Israel
Al-Hamra', a depopulated Arab village near Safad
Al-Hamra, Baysan, a depopulated Arab village near Baysan
Lebanon
Hamra, Beirut, a neighborhood
Hamra Street, a street in Beirut known as Rue Hamra or "Beirut's Champs Elysées"
Oman
Al Hamra, Oman, a historic town
Saudi Arabia
Al Hamra', Al Madinah
Al Hamra (Riyadh)
Al Hamra Palace (Riyadh)
Spain
Alhambra (Al-Hamra in Arabic), a fortress and palace in Andalusia
Syria
Al-Hamraa, a town in the vicinity of Hama
Al-Hamra, al-Suqaylabiyah, a town in the al-Suqaylabiyah District
Sweden
Hamra, Gotland, a settlement
Hamra formation, a Silurian sedimentary rock formation on the island of Gotland
Hamra National Park
West Bank
Hamra, Bik'at HaYarden, an Israeli settlement
Yemen
Bayt al-Hamra', a village in Sanaa Governorate
Other uses
9373 Hamra, a main-belt asteroid
Battle of Hamra al-Asad, a battle in 625 AD (3 AH) in which the Islamic prophet Muhammad participated
Hamra (Mandaeism), water mixed with mashed raisins that is used in Mandaean rituals
See also
Alhambra (disambiguation)
Al Jazirah Al Hamra, United Arab Emirates |
Willis (also Brady, Brady's Crossing, Vista) is an unincorporated community in Dakota County, Nebraska, United States. The community lies at the intersection of U.S. Route 20 and Nebraska Highway 12.
Notes
Unincorporated communities in Dakota County, Nebraska
Unincorporated communities in Nebraska |
Bazarsar-e Lafmejan (, also Romanized as Bāzārsar-e Lafmejān) is a village in Lafmejan Rural District, in the Central District of Lahijan County, Gilan Province, Iran. At the 2006 census, its population was 382, in 130 families.
References
Populated places in Lahijan County |
Technology, Education, Management, Informatics (TEM) is a quarterly peer-reviewed academic journal covering technology and business. The journal has a significant impact as evidenced by citations in Google Scholar. It is indexed by Scopus, Web of Science, and other citation indices.
Publication
TEM is published by UIKTEN – Association for Information Communication Technology Education and Science, Serbia. It is open access, and does not require a subscription or registration. All previous issues are accessible online.
References
External links
Quarterly journals
Open access journals
Academic journals established in 2012
Academic journals published by learned and professional societies
Academic journals published by non-profit organizations
English-language journals |
This is a list of the mammal species recorded in El Salvador. Of the mammal species in El Salvador, one is endangered, three are vulnerable, and two are near threatened.
The following tags are used to highlight each species' conservation status as assessed by the International Union for Conservation of Nature:
Some species were assessed using an earlier set of criteria. Species assessed using this system have the following instead of near threatened and least concern categories:
Subclass: Theria
Infraclass: Metatheria
Order: Didelphimorphia (common opossums)
Didelphimorphia is the order of common opossums of the Western Hemisphere. Opossums probably diverged from the basic South American marsupials in the late Cretaceous or early Paleocene. They are small to medium-sized marsupials, about the size of a large house cat, with a long snout and prehensile tail.
Family: Didelphidae (American opossums)
Subfamily: Didelphinae
Genus: Chironectes
Water opossum, Chironectes minimus LR/nt
Genus: Didelphis
Common opossum, Didelphis marsupialis LR/lc
Virginia opossum, Didelphis virginiana LR/lc
Genus: Marmosa
Mexican mouse opossum, Marmosa mexicana LR/lc
Genus: Philander
Gray four-eyed opossum, Philander opossum LR/lc
Infraclass: Eutheria
Order: Cingulata (armadillos)
The armadillos are small mammals with a bony armoured shell. They are native to the Americas. There are around 20 extant species.
Family: Dasypodidae (armadillos)
Subfamily: Dasypodinae
Genus: Dasypus
Nine-banded armadillo, Dasypus novemcinctus LC
Subfamily: Tolypeutinae
Genus: Cabassous
Northern naked-tailed armadillo, Cabassous centralis DD
Order: Pilosa (anteaters, sloths and tamanduas)
The order Pilosa is extant only in the Americas and includes the anteaters, sloths, and tamanduas.
Suborder: Vermilingua
Family: Myrmecophagidae (American anteaters)
Genus: Myrmecophaga
Giant anteater, Myrmecophaga tridactyla VU possibly extirpated
Genus: Tamandua
Northern tamandua, Tamandua mexicana LC
Order: Primates
The order Primates contains humans and their closest relatives: lemurs, lorisoids, tarsiers, monkeys, and apes.
Suborder: Haplorhini
Infraorder: Simiiformes
Parvorder: Platyrrhini
Family: Atelidae
Subfamily: Atelinae
Genus: Ateles
Geoffroy's spider monkey, Ateles geoffroyi LC
Order: Rodentia (rodents)
Rodents make up the largest order of mammals, with over 40% of mammalian species. They have two incisors in the upper and lower jaw which grow continually and must be kept short by gnawing. Most rodents are small though the capybara can weigh up to .
Suborder: Hystricognathi
Family: Erethizontidae (New World porcupines)
Subfamily: Erethizontinae
Genus: Coendou
Mexican hairy dwarf porcupine, Coendou mexicanus LR/lc
Family: Dasyproctidae (agoutis and pacas)
Genus: Dasyprocta
Central American agouti, Dasyprocta punctata LR/lc
Family: Cuniculidae
Genus: Cuniculus
Lowland paca, Cuniculus paca LC
Suborder: Sciurognathi
Family: Sciuridae (squirrels)
Subfamily: Sciurinae
Tribe: Sciurini
Genus: Sciurus
Deppe's squirrel, Sciurus deppei LR/lc
Variegated squirrel, Sciurus variegatoides LR/lc
Family: Heteromyidae
Subfamily: Heteromyinae
Genus: Heteromys
Desmarest's spiny pocket mouse, Heteromys desmarestianus LR/lc
Salvin's spiny pocket mouse, Heteromys salvini LR/lc
Family: Cricetidae
Subfamily: Tylomyinae
Genus: Nyctomys
Sumichrast's vesper rat, Nyctomys sumichrasti LR/lc
Genus: Ototylomys
Big-eared climbing rat, Ototylomys phyllotis LR/lc
Genus: Tylomys
Peters's climbing rat, Tylomys nudicaudus LR/lc
Subfamily: Neotominae
Genus: Baiomys
Southern pygmy mouse, Baiomys musculus LR/lc
Genus: Habromys
Crested-tailed deer mouse, Habromys lophurus LR/lc
Genus: Neotoma
Mexican woodrat, Neotoma mexicana LR/lc
Genus: Peromyscus
Aztec mouse, Peromyscus aztecus LR/lc
Naked-eared deer mouse, Peromyscus gymnotis LR/lc
Nimble-footed mouse, Peromyscus levipes LR/lc
Stirton's deer mouse, Peromyscus stirtoni LR/lc
Genus: Reithrodontomys
Fulvous harvest mouse, Reithrodontomys fulvescens LR/lc
Slender harvest mouse, Reithrodontomys gracilis LR/lc
Mexican harvest mouse, Reithrodontomys mexicanus LR/lc
Sumichrast's harvest mouse, Reithrodontomys sumichrasti LR/lc
Genus: Scotinomys
Alston's brown mouse, Scotinomys teguina LR/lc
Subfamily: Sigmodontinae
Genus: Oligoryzomys
Fulvous pygmy rice rat, Oligoryzomys fulvescens LR/lc
Genus: Oryzomys
Alfaro's rice rat, Oryzomys alfaroi LR/lc
Coues' rice rat, Oryzomys couesi LR/lc
Long-nosed rice rat, Oryzomys rostratus LR/lc
Cloud forest rice rat, Oryzomys saturatior LR/lc
Genus: Rheomys
Thomas's water mouse, Rheomys thomasi LR/lc
Genus: Sigmodon
Southern cotton rat, Sigmodon hirsutus LC
Order: Lagomorpha (lagomorphs)
The lagomorphs comprise two families, Leporidae (hares and rabbits), and Ochotonidae (pikas). Though they can resemble rodents, and were classified as a superfamily in that order until the early 20th century, they have since been considered a separate order. They differ from rodents in a number of physical characteristics, such as having four incisors in the upper jaw rather than two.
Family: Leporidae (rabbits, hares)
Genus: Sylvilagus
Eastern cottontail, Sylvilagus floridanus LR/lc
Central American tapetí, Sylvilagus gabbi LC
Order: Eulipotyphla (shrews, hedgehogs, moles, and solenodons)
Eulipotyphlans are insectivorous mammals. Shrews and solenodons closely resemble mice, hedgehogs carry spines, while moles are stout-bodied burrowers.
Family: Soricidae (shrews)
Subfamily: Soricinae
Tribe: Blarinini
Genus: Cryptotis
Goodwin's broad-clawed shrew, Cryptotis goodwini LR/lc
Honduran small-eared shrew, Cryptotis hondurensis VU
Blackish small-eared shrew, Cryptotis nigrescens LR/lc
North American least shrew, Cryptotis parva LR/lc
Order: Chiroptera (bats)
The bats' most distinguishing feature is that their forelimbs are developed as wings, making them the only mammals capable of flight. Bat species account for about 20% of all mammals.
Family: Noctilionidae
Genus: Noctilio
Lesser bulldog bat, Noctilio albiventris LR/lc
Greater bulldog bat, Noctilio leporinus LR/lc
Family: Vespertilionidae
Subfamily: Myotinae
Genus: Myotis
Elegant myotis, Myotis elegans LR/nt
Hairy-legged myotis, Myotis keaysi LR/lc
Black myotis, Myotis nigricans LR/lc
Cave myotis, Myotis velifer LR/lc
Subfamily: Vespertilioninae
Genus: Eptesicus
Brazilian brown bat, Eptesicus brasiliensis LR/lc
Big brown bat, Eptesicus fuscus LR/lc
Genus: Lasiurus
Desert red bat, Lasiurus blossevillii LR/lc
Southern yellow bat, Lasiurus ega LR/lc
Northern yellow bat, Lasiurus intermedius LR/lc
Genus: Rhogeessa
Black-winged little yellow bat, Rhogeessa tumida LR/lc
Family: Molossidae
Genus: Eumops
Black bonneted bat, Eumops auripendulus LR/lc
Dwarf bonneted bat, Eumops bonariensis LR/lc
Underwood's bonneted bat, Eumops underwoodi LR/nt
Genus: Molossus
Black mastiff bat, Molossus ater LR/lc
Molossus coibensis LR/nt
Velvety free-tailed bat, Molossus molossus LR/lc
Sinaloan mastiff bat, Molossus sinaloae LR/lc
Genus: Nyctinomops
Broad-eared bat, Nyctinomops laticaudatus LR/lc
Genus: Tadarida
Mexican free-tailed bat, Tadarida brasiliensis LR/nt
Family: Emballonuridae
Genus: Balantiopteryx
Gray sac-winged bat, Balantiopteryx plicata LR/lc
Genus: Diclidurus
Northern ghost bat, Diclidurus albus LR/lc
Genus: Peropteryx
Greater dog-like bat, Peropteryx kappleri LR/lc
Lesser dog-like bat, Peropteryx macrotis LR/lc
Genus: Rhynchonycteris
Proboscis bat, Rhynchonycteris naso LR/lc
Genus: Saccopteryx
Greater sac-winged bat, Saccopteryx bilineata LR/lc
Lesser sac-winged bat, Saccopteryx leptura LR/lc
Family: Mormoopidae
Genus: Mormoops
Ghost-faced bat, Mormoops megalophylla LR/lc
Genus: Pteronotus
Naked-backed bat, Pteronotus davyi LR/lc
Big naked-backed bat, Pteronotus gymnonotus LR/lc
Parnell's mustached bat, Pteronotus parnellii LR/lc
Wagner's mustached bat, Pteronotus personatus LR/lc
Family: Phyllostomidae
Subfamily: Phyllostominae
Genus: Chrotopterus
Big-eared woolly bat, Chrotopterus auritus LR/lc
Genus: Lonchorhina
Tomes's sword-nosed bat, Lonchorhina aurita LR/lc
Genus: Macrophyllum
Long-legged bat, Macrophyllum macrophyllum LR/lc
Genus: Micronycteris
Schmidts's big-eared bat, Micronycteris schmidtorum LR/lc
Genus: Phyllostomus
Pale spear-nosed bat, Phyllostomus discolor LR/lc
Genus: Trachops
Fringe-lipped bat, Trachops cirrhosus LR/lc
Subfamily: Glossophaginae
Genus: Anoura
Geoffroy's tailless bat, Anoura geoffroyi LR/lc
Genus: Choeroniscus
Godman's long-tailed bat, Choeroniscus godmani LR/nt
Genus: Choeronycteris
Mexican long-tongued bat, Choeronycteris mexicana LR/nt
Genus: Glossophaga
Commissaris's long-tongued bat, Glossophaga commissarisi LR/lc
Gray long-tongued bat, Glossophaga leachii LR/lc
Pallas's long-tongued bat, Glossophaga soricina LR/lc
Genus: Leptonycteris
Southern long-nosed bat, Leptonycteris curasoae VU
Subfamily: Carolliinae
Genus: Carollia
Silky short-tailed bat, Carollia brevicauda LR/lc
Seba's short-tailed bat, Carollia perspicillata LR/lc
Gray short-tailed bat, Carollia subrufa LR/lc
Subfamily: Stenodermatinae
Genus: Artibeus
Aztec fruit-eating bat, Artibeus aztecus LR/lc
Honduran fruit-eating bat, Artibeus inopinatus VU
Jamaican fruit bat, Artibeus jamaicensis LR/lc
Great fruit-eating bat, Artibeus lituratus LR/lc
Pygmy fruit-eating bat, Artibeus phaeotis LR/lc
Toltec fruit-eating bat, Artibeus toltecus LR/lc
Genus: Centurio
Wrinkle-faced bat, Centurio senex LR/lc
Genus: Chiroderma
Salvin's big-eyed bat, Chiroderma salvini LR/lc
Hairy big-eyed bat, Chiroderma villosum LR/lc
Genus: Enchisthenes
Velvety fruit-eating bat, Enchisthenes hartii LR/lc
Genus: Sturnira
Little yellow-shouldered bat, Sturnira lilium LR/lc
Highland yellow-shouldered bat, Sturnira ludovici LR/lc
Genus: Uroderma
Tent-making bat, Uroderma bilobatum LR/lc
Brown tent-making bat, Uroderma magnirostrum LR/lc
Genus: Vampyressa
Southern little yellow-eared bat, Vampyressa pusilla LR/lc
Genus: Vampyrodes
Great stripe-faced bat, Vampyrodes caraccioli LR/lc
Genus: Platyrrhinus
Heller's broad-nosed bat, Platyrrhinus helleri LR/lc
Subfamily: Desmodontinae
Genus: Desmodus
Common vampire bat, Desmodus rotundus LR/lc
Genus: Diaemus
White-winged vampire bat, Diaemus youngi LR/lc
Genus: Diphylla
Hairy-legged vampire bat, Diphylla ecaudata LR/nt
Order: Cetacea (whales)
The order Cetacea includes whales, dolphins and porpoises. They are the mammals most fully adapted to aquatic life with a spindle-shaped nearly hairless body, protected by a thick layer of blubber, and forelimbs and tail modified to provide propulsion underwater.
Suborder: Mysticeti
Family: Balaenopteridae (baleen whales)
Genus: Balaenoptera
Common minke whale, Balaenoptera acutorostrata
Sei whale, Balaenoptera borealis
Bryde's whale, Balaenoptera brydei
Blue whale, Balaenoptera musculus
Genus: Megaptera
Humpback whale, Megaptera novaeangliae
Suborder: Odontoceti
Superfamily: Platanistoidea
Family: Delphinidae (marine dolphins)
Genus: Delphinus
Short-beaked common dolphin, Delphinus delphis DD
Genus: Feresa
Pygmy killer whale, Feresa attenuata DD
Genus: Globicephala
Short-finned pilot whale, Globicephala macrorhyncus DD
Genus: Lagenodelphis
Fraser's dolphin, Lagenodelphis hosei DD
Genus: Grampus
Risso's dolphin, Grampus griseus DD
Genus: Orcinus
Killer whale, Orcinus orca DD
Genus: Peponocephala
Melon-headed whale, Peponocephala electra DD
Genus: Pseudorca
False killer whale, Pseudorca crassidens DD
Genus: Stenella
Pantropical spotted dolphin, Stenella attenuata DD
Spinner dolphin, Stenella longirostris DD
Genus: Steno
Rough-toothed dolphin, Steno bredanensis DD
Genus: Tursiops
Common bottlenose dolphin, Tursiops truncatus
Family: Physeteridae (sperm whales)
Genus: Physeter
Sperm whale, Physeter catodon DD
Family: Kogiidae (dwarf sperm whales)
Genus: Kogia
Pygmy sperm whale, Kogia breviceps DD
Dwarf sperm whale, Kogia sima DD
Superfamily Ziphioidea
Family: Ziphidae (beaked whales)
Genus: Mesoplodon
Ginkgo-toothed beaked whale, Mesoplodon ginkgodens DD
Pygmy beaked whale, Mesoplodon peruvianus DD
Genus: Ziphius
Cuvier's beaked whale, Ziphius cavirostris DD
Order: Carnivora (carnivorans)
There are over 260 species of carnivores, the majority of which feed primarily on meat. They have a characteristic skull shape and dentition.
Suborder: Feliformia
Family: Felidae (cats)
Subfamily: Felinae
Genus:Herpailurus
Jaguarundi, H. yagouaroundi LC
Genus: Leopardus
Ocelot, L. pardalis LC
Margay, L. wiedii LC
Genus: Puma
Cougar, P. concolor LC
Subfamily: Pantherinae
Genus: Panthera
Jaguar, P. onca NT extirpated
Suborder: Caniformia
Family: Canidae (dogs, foxes)
Genus: Canis
Coyote, Canis latrans LC
Genus: Urocyon
Gray fox, Urocyon cinereoargenteus LC
Family: Procyonidae (raccoons)
Genus: Bassariscus
Cacomistle, Bassariscus sumichrasti LR/nt
Genus: Nasua
White-nosed coati, Nasua narica LR/lc
Genus: Potos
Kinkajou, Potos flavus LR/lc
Genus: Procyon
Common raccoon, Procyon lotor LR/lc
Family: Mustelidae (mustelids)
Genus: Eira
Tayra, Eira barbara LR/lc
Genus: Galictis
Greater grison, Galictis vittata LR/lc
Genus: Lontra
Neotropical river otter, Lontra longicaudis NT
Genus: Neogale
Long-tailed weasel, Neogale frenata LR/lc
Family: Mephitidae
Genus: Conepatus
American hog-nosed skunk, Conepatus leuconotus LR/lc
Genus: Mephitis
Hooded skunk, Mephitis macroura LR/lc
Genus: Spilogale
Eastern spotted skunk, Spilogale putorius LR/lc
Family: Otariidae (eared seals)
Genus: Otaria
South American sea lion, Otaria flavescens LR/lc vagrant
Genus: Zalophus
California sea lion, Zalophus californianus LR/lc vagrant
Order: Perissodactyla (odd-toed ungulates)
The odd-toed ungulates are browsing and grazing mammals. They are usually large to very large, and have relatively simple stomachs and a large middle toe.
Family: Tapiridae (tapirs)
Genus: Tapirus
Baird's tapir, T. bairdii EN extirpated
Order: Artiodactyla (even-toed ungulates)
The even-toed ungulates are ungulates whose weight is borne about equally by the third and fourth toes, rather than mostly or entirely by the third as in perissodactyls. There are about 220 artiodactyl species, including many that are of great economic importance to humans.
Family: Tayassuidae (peccaries)
Genus: Dicotyles
Collared peccary, D. tajacu LC
Genus: Tayassu
White-lipped peccary, T. pecari VU extirpated
Family: Cervidae (deer)
Subfamily: Capreolinae
Genus: Mazama
Central American red brocket, Mazama temama DD
Genus: Odocoileus
White-tailed deer, O. virginianus LC
Notes
References
See also
List of chordate orders
Lists of mammals by region
List of prehistoric mammals
Mammal classification
List of mammals described in the 2000s
El Salvador
Mammals
El Salvador |
North Earltown is a community in the Canadian province of Nova Scotia, located in Colchester County .
References
North Earltown on Destination Nova Scotia
Communities in Colchester County
General Service Areas in Nova Scotia |
Charles de Coligny (1564–1632) was a member of the House of Coligny. The youngest of the three children of Gaspard II de Coligny and Charlotte de Laval, he became marquis of Coligny-le-Vieux, Andelot and Saint-Bris, baron of Lanty and lord of Dinteville, Dannemarie, Auxon and Cusey. He was the only one of Gaspard and Charlotte's children to be baptized a Protestant and the only one to convert to Roman Catholicism.
Life
He was captured after the St Bartholomew's Day Massacre and imprisoned in Marseille until freed in May 1576. He then fought for the King of Navarre alongside his brother in the Rouerge and Languedoc. In August 1577 he and his brother recaptured the town of Mauguio and Charles was left behind to garrison it. In June 1585 he raised an infantry regiment and led it on campaign in Languedoc until 1587 as part of the duke of Montmorency's force. He fought alongside Lesdiguières in summer 1587 in the Dauphiné, Savoy and Vivarais.
He was captured again in July 1590 during the siege of Paris, before switching to the Catholic League and converting to Roman Catholicism. He based himself in Lyon and was imprisoned for a time at Pierre Scize on the orders of the duke of Nemours in 1593. In 1596 he became a gentleman in ordinary to Henry IV of France. In 1598 he was made a maréchal de camp, in 1604 governor of Langres and in 1608 lieutenant general to the government of Champagne - he gave up the lieutenancy generalship in 1615 in favour of his eldest son. From 1615 to 1616 he was put in command of a small force sent against the rebel princes such as Luxembourg in the Champagne - commanding 2,500 infantry and 600 cavalry he besieged Varennes and Soyeras in Bassigny then Brienne and Rosnay. In 1617 he was made freeholder of Coligny-le-Vieil and Andelot by Archduke Albert. Coligny-le-Vieux and Andelot were promoted into marquisates in his favour, but in 1629 he sold them both to his cousin Clériadus de Coligny. On 31 December 1619 he was made a knight of the Order of the Holy Spirit and the Order of Saint Michael.
Marriage and issue
He married Humberte or Huberte de Chastenay, lady of Lanty and Dinteville.
Joachim François
Joachim-François, marquis d’Andelot, mestre-de-camp to a 1200 strong infantry regiment and his father's successor as lieutenant governor of Champagne (1615). He campaigned in Italy and in 1623 presented himself to Monsieur de Bérulle for reception into the Oratorian order in Paris. He was ordained a priest by Sébastien Zamet, bishop of Langres, in February 1625. He became head of the new Company of the Holy Sacrament in 1631 and founded a 'carmel' at Chaumont-en-Bassigny as well as making many gifts to Châtillon. After his brother's death he retired to Lanty and fell sick in 1654. He moved to Châtillon and made his will before dying on 18 October 1654 - after receiving the last rites he cried out "I die a child of the Catholic, Apostolic and Roman Church". His body was buried in the castle church at Châtillon and his heart in Lenty.
Bernard
Born in 1605, he owed his name to his recovery from illness aged six months on 7 February 1609, after his father prayed for the intercession of saint Bernard of Clairvaux. He became marquis of Coligny-le-Vieux, Andelot and Saint-Bris, baron of Lanty and Dinteville and lieutenant-général of Champagne. In 1625 he married Gabrielle de Pouilly, daughter of Simon de Pouilly, baron of Esne and Manonville, lord of Loupy, marshal of Barrois, governor of Stenay, and his wife Françoise de Berniaut. He died without issue in 1627 and his widow remarried to Claude-Roger de Cominges, marquis of Vervins.
Marguerite-Marie
In 1621 she married Pierre-Ernest, sovereign count of Créanges and in 1650 (after 14 years as a widow) to Charles-Étienne d’Hury de Boutenay, count of Hombourg, baron of Lenty, grand-tranchant de France, who died aged 63 in 1686. Marguerite-Marie died in 1672 and was buried at Les Carmélites de Chaumont-en-Bassigny, founded by her brother.
Family tree
References
Bibliography
Roch de Pillot de Coligny (Axor-Danaé éditeur), Histoire généalogique de la maison de Coligny
1564 births
1632 deaths
Charles
French people of the French Wars of Religion
Converts to Roman Catholicism from Calvinism |
Sikkim Ekta Manch (translation: Sikkim Unity Platform), was a political party in the Indian state of Sikkim founded in August 1997, when Laxmi Parasad Tiwari and T. M. Rai broke from the Indian National Congress (INC). The party drew dissident members from the ruling Sikkim Democratic Front and the INC, who claimed the new party would promote a Sikkim free of caste or communal based politics.
In the October 1997 panchayat (local) elections, the first local elections in Sikkim to allow political parties, the SEM criticised this "politicization" and only fielded independent candidates.
Shortly thereafter, Rai broke away from the SEM to form the Sikkim Janshakti Party.
In the 1998 general election SEM ran a joint candidate with Congress, the Sikkim Sangram Parishad and the Sikkim National Front for the state's single Lok Sabha seat.
In November 1998 SEM merged with INC.
References
Defunct political parties in Sikkim
1997 establishments in Sikkim
Political parties established in 1997
Political parties disestablished in 1998
Indian National Congress breakaway groups |
Kilroy's College is a distance learning institution based in Dublin, Ireland. The college is a registered QQI course provider.
History
The school was founded in 1932 by P.J. Kilroy and originally known as the 'Irish Correspondence College'.
The school was taken over by Charles Kilroy in the 1960s. His son Patrick Kilroy took over running of Kilroy's College in 1999.
Courses were initially offered by correspondence education, and aimed primarily at adult learners. In 1937, the school began teaching Leaving Certificate subjects to school leaving students.
See also
Distance Education
Education in the Republic of Ireland
References
External links
Kilroy's College distance learning Ireland
Kilroy's College home study UK
Kilroys College on Nightcourses.com – Ireland's National Course Finder
Distance education institutions based in the Republic of Ireland
Education in Dublin (city) |
With Light and with Love is the eighth studio album by the American band Woods, released on April 15, 2014 on Woodsist. The album is the band's first following the departure of bass guitarist Kevin Morby.
The album was followed by a 7" and digital release of two non-album tracks, "Tambourine Light" and the B-side "Tomorrow's Only Yesterday".
Critical reception
With Light and with Love received largely positive reviews from contemporary music critics. At Metacritic, which assigns a normalized rating out of 100 to reviews from mainstream critics, the album received an average score of 79, based on 19 reviews, which indicates "generally favorable reviews".
Ian Cohen of Pitchfork Media gave the album a positive review, stating, "The versatility of Woods becomes more evident throughout the album, as they spread outwards rather than building upward: you get B3-infused soul (“Leaves Like Glass”), breezy psychedelia (“New Light”) and darker shades of American Beauty (“Shining”), giving jamband types, roots fans, folkies, indie kids and DIY fetishists a place to link up. “Breakthrough”, “masterpiece”, “bold leap”—those aren’t words that really seem applicable to With Light and With Love, or Woods for that matter, but they’re allowing themselves to be extremely likable for a larger crowd."
Fred Thomas of AllMusic praised the album, stating, "The album is easily the most solid offering from the Woods camp to date, besting even the production of its incredibly strong predecessor and presenting the songs with even more clarity and interesting choices than ever before." Carey Hodges of Paste also acclaimed the album, stating, "Even the most drawn-out, mind-bending stretches on the album serve a purpose, managing to avoid sounding like sonic filler."
Philip Cosores of Consequence of Sound was more critical of the album, stating, "While With Light and With Love might sound more instantly accessible than previous Woods albums, it also shows that it might not be a good thing for Woods to tinker with their most defining quality: the intimacy of their songs."
Track listing
Personnel
Main personnel
Jarvis Taveniere – bass, engineer, guitar, twelve-string guitar, electric guitar, producer
Jeremy Earl – bass, composer, drums, guitar, twelve-string guitar, acoustic guitar, electric guitar, percussion, producer, vocals
Aaron Neveu – bass, drums, acoustic guitar
John Andrews – musical saw, organ, piano
Samara Lubelski – violin
Tim Presley – slide guitar
Jonathan Rado – organ
Al Carlson – engineer, mellotron, mixing
Additional personnel
Timothy Stollenwerk – mastering
Terry Willard Earl – photography
References
2014 albums
Albums produced by Jarvis Taveniere
Albums produced by Jeremy Earl
Woods (band) albums
Woodsist albums |
Alexander Yuk Ching Ma (born 1952 in British Hong Kong) is an American former CIA clandestine officer accused of acting as a double agent on behalf of the People's Republic of China, gaining employment with the FBI in order to act as a mole. He was arrested in August 2020, charged under the Espionage Act with conspiring along with his brother, also a former CIA officer, to pass classified information to officials of the Chinese Ministry of State Security. His trial is scheduled for 2024.
Early life and CIA career
Born in British Hong Kong in 1952, Ma and his older brother, David, born in nationalist Chinese Shanghai in 1936, moved to Honolulu, Hawaii in 1968 and became US citizens, attending the University of Hawaiʻi at Mānoa. Following graduation, David joined the CIA as a clandestine officer assigned to the Far East at the height of the Vietnam war.
In 1983, David Ma resigned from the CIA after an investigation found he inappropriately used his position to assist Chinese nationals obtain entry into the United States. Within the same year, then 30-year old Alex joined the agency, also as a clandestine officer. Following training at The Farm, the younger Ma was also sent to the Far East.
In 1989, Alex Ma abruptly left the agency, and around 1995 he moved to Shanghai.
Espionage for China
Ma's alleged spying for China is believed to have begun in March 2001, with a three-day debriefing in a Hong Kong hotel by officers of the Shanghai State Security Bureau (SSSB), the city's aggressive subsidiary of China's Ministry of State Security (MSS). During the meeting, which was partly videotaped, Ma and his brother David are alleged to have provided information about the CIA personnel, operations, and covert communications techniques, in exchange for $50,000 in cash.
After Ma moved back to Hawaii in 2002, he sought employment with the FBI with the intent to regain access to classified information in order to provide it to the MSS. Though he applied for a position as a special agent, at age 49 he was over the age limit, instead he was hired by the FBI’s Honolulu Field Office as a linguist tasked with translating Chinese language documents. During his hiring by the FBI in 2004, he is alleged to have passed a polygraph examination which asked questions regarding foreign contacts and personal loyalties. The day before starting his new job with the FBI, Ma called a suspected accomplice to inform them he would now be working full-time for "the other side."
Over the following six years with the FBI, Ma regularly copied, photographed and stole classified documents, bringing many of them with him on frequent trips to China with the intent to provide them to his handlers. Customs declarations indicated that Ma often returned from China with thousands of dollars in cash and expensive gifts, such as a new set of golf clubs.
David Ma is believed to have continued to maintain contact with the MSS, staying in contact with Alex and MSS handlers while he embedded himself in the Chinese immigrant community in Los Angeles.
In one instance, Alex's wife Amy Ma, also born in Hong Kong, was used as a courier, flying to Shanghai and delivering an encrypted laptop computer to handlers from the SSSB.
Investigation and arrest
In January 2019, Ma confirmed to an undercover FBI agent that he had in the past provided valuable U.S. government materials to the Chinese government, and that he would be willing to do so in the future. On March 13, 2019, Ma accepted $2,000 from the same undercover FBI agent, who told Ma that the money was acknowledgment for his work on behalf of China. On August 12, 2020, Ma accepted another $2,000 from the undercover FBI agent, expressed his willingness to continue to help the Chinese government, and stated that he wanted "the motherland" to succeed.
On August 14, 2020, Ma was arrested on charges of conspiracy. The Justice Department identified Ma's older brother, David, as an unindicted co-conspirator to the crimes, but deemed him unfit to stand trial due to his advanced neurological decline from an Alzheimer’s diagnosis ten years prior. In 2021, Alexander Ma claimed to be having memory problems and asked for a mental competency evaluation. In February 2023, he was deemed competent, his case is scheduled to go to trial in 2024.
References
Chinese spies
Central Intelligence Agency
Central Intelligence Agency controversies
People of the Central Intelligence Agency
University of Hawaiʻi at Mānoa alumni
1952 births
Living people |
The siege of Dieppe (2 November 1442 – 14 August 1443) took place during the Hundred Years War. English forces led by John Talbot, Earl of Shrewsbury besieged and failed to capture the French-held port of Dieppe in Normandy.
Prelude
The English commander John Talbot, Earl of Shrewsbury marched out with a core troop of 600 men from his headquarters in Jumièges, Normandy at the end of October 1442 to besiege the French-held port of Dieppe. The French garrison of the castle of Charlemesnil surrendered to Talbot's army.
Siege
Talbot built a wooden fort on the heights of Le Pollet east of Dieppe and installed a garrison of 500 men under Sir William Peyto along with 200 artillery pieces of various make and began to bombard Dieppe's fortifications and houses with them.
On 12 August 1443 a French relief army of 1,600 men under the dauphin Louis arrived at Dieppe, which was garrisoned by several hundred men-at-arms led by Charles Desmarets. Two more French armies had reinforced the town previously. At 8 am on 14 August, the French attacked the English fort to the sound of trumpets. The French had five or six wooden bridges on wheels and cranes that hoisted the bridges into position over the English walls. The attacking French troops were repulsed by English missile and arrow fire and lost 100 killed and hundreds wounded.
The citizens of Dieppe reinforced the French army with between 60 and 80 large crossbows and the dauphin ordered the attack renewed. The English were defeated, with 300 killed and 14 French-speaking survivors hanged as traitors on the dauphin's orders. Sir William Peyto, Sir John Ripley and Henry Talbot were captured, among others. The fort was dismantled on the dauphin's orders and the artillery carried off to Dieppe's arsenal.
Citations
References
1440s in France
Dieppe
Dieppe
Dieppe
Military history of Normandy
Dieppe
Dieppe
Hundred Years' War, 1415–1453
Dieppe |
Priaulx is a name of French origin, and may refer to:
Andy Priaulx (born 1974), British professional racing driver from Guernsey
Priaulx Rainier (190386), South African-British composer
Priaulx League, an association football league on the island of Guernsey
Priaulx Library, located in St Peter Port, Guernsey
Sebastian Priaulx (born 2001), British racing driver from Guernsey
See also |
```scss
.video-react .video-react-poster {
display: inline-block;
vertical-align: middle;
background-repeat: no-repeat;
background-position: 50% 50%;
background-size: contain;
background-color: #000000;
cursor: pointer;
margin: 0;
padding: 0;
position: absolute;
top: 0;
right: 0;
bottom: 0;
left: 0;
height: 100%;
img {
display: block;
vertical-align: middle;
margin: 0 auto;
max-height: 100%;
padding: 0;
width: 100%;
}
}
``` |
```python
from django.shortcuts import render, redirect
from django.http import HttpResponse, HttpResponseBadRequest
from django.contrib.auth.decorators import login_required
from bootcamp.decorators import ajax_required
from django.contrib.auth.models import User
import json
from bootcamp.messenger.models import Message
@login_required
def inbox(request):
conversations = Message.get_conversations(user=request.user)
active_conversation = None
messages = None
if conversations:
conversation = conversations[0]
active_conversation = conversation['user'].username
messages = Message.objects.filter(user=request.user,
conversation=conversation['user'])
messages.update(is_read=True)
for conversation in conversations:
if conversation['user'].username == active_conversation:
conversation['unread'] = 0
return render(request, 'messenger/inbox.html', {
'messages': messages,
'conversations': conversations,
'active': active_conversation
})
@login_required
def messages(request, username):
conversations = Message.get_conversations(user=request.user)
active_conversation = username
messages = Message.objects.filter(user=request.user,
conversation__username=username)
messages.update(is_read=True)
for conversation in conversations:
if conversation['user'].username == username:
conversation['unread'] = 0
return render(request, 'messenger/inbox.html', {
'messages': messages,
'conversations': conversations,
'active': active_conversation
})
@login_required
def new(request):
if request.method == 'POST':
from_user = request.user
to_user_username = request.POST.get('to')
try:
to_user = User.objects.get(username=to_user_username)
except Exception, e:
try:
to_user_username = to_user_username[
to_user_username.rfind('(')+1:len(to_user_username)-1]
to_user = User.objects.get(username=to_user_username)
except Exception, e:
return redirect('/messages/new/')
message = request.POST.get('message')
if len(message.strip()) == 0:
return redirect('/messages/new/')
if from_user != to_user:
Message.send_message(from_user, to_user, message)
return redirect(u'/messages/{0}/'.format(to_user_username))
else:
conversations = Message.get_conversations(user=request.user)
return render(request, 'messenger/new.html',
{'conversations': conversations})
@login_required
@ajax_required
def delete(request):
return HttpResponse()
@login_required
@ajax_required
def send(request):
if request.method == 'POST':
from_user = request.user
to_user_username = request.POST.get('to')
to_user = User.objects.get(username=to_user_username)
message = request.POST.get('message')
if len(message.strip()) == 0:
return HttpResponse()
if from_user != to_user:
msg = Message.send_message(from_user, to_user, message)
return render(request, 'messenger/includes/partial_message.html',
{'message': msg})
return HttpResponse()
else:
return HttpResponseBadRequest()
@login_required
@ajax_required
def users(request):
users = User.objects.filter(is_active=True)
dump = []
template = u'{0} ({1})'
for user in users:
if user.profile.get_screen_name() != user.username:
dump.append(template.format(user.profile.get_screen_name(), user.username))
else:
dump.append(user.username)
data = json.dumps(dump)
return HttpResponse(data, content_type='application/json')
@login_required
@ajax_required
def check(request):
count = Message.objects.filter(user=request.user, is_read=False).count()
return HttpResponse(count)
``` |
is a retired judoka who competed in the middleweight division (80 kg) in the 1964 Summer Olympics.
Biography
Okano entered the 1964 Summer Olympics while studying at Chuo University's law school, and won the gold medal in the middleweight division. He won another gold medal at the World Judo Championships in 1965, becoming the champion of his division at only 21 years of age. He also won the open-weight class division of the All-Japan Judo Championships in 1967 and 1969, and placed second in 1968. At 80 kg, he and Shinobu Sekine remain the lightest ever competitors to win these championships. Okano suddenly retired from competitive judo at only 25 years of age, and founded the Sekijuku (currently the Ryutsu Keizai University's judo team) in 1970, where he instructed future Olympic gold medalist Kazuhiro Ninomiya. He also served as a coach for the Japanese team during the 1976 Summer Olympics. He later worked as a judo instructor at Keio University from 1989 to 1998, and the University of Tokyo from 1989 to 2000. He is a retired professor and Head of the Judo Department at Ryutsu Keizai University. He has held the judo rank of 6th dan for more than 40 years. Isao Okano is the author of Vital Judo, which was published in 1976. Okano is famously known for his seoinage, kouchi gari and osoto gari.
Also known as a master in the field of newaza, Okano is considered by some an important contributor to the late art of Brazilian jiu-jitsu. He was a teacher to Brazilian jiu-jitsu black belts like Joe Moreira, Fredson Paixao, Edson Carvalho and Oswaldo Alves, with the last citing their training with Okano as instrumental for the development of sweeps, side control and guard work in modern jiu-jitsu.
See also
List of judoka
List of Olympic medalists in judo
seoinage
References
External links
Competition videos of Isao Okano at Judovision
1944 births
Living people
Japanese male judoka
Judoka at the 1964 Summer Olympics
Olympic judoka for Japan
Olympic gold medalists for Japan
People from Ibaraki Prefecture
Olympic medalists in judo
Medalists at the 1964 Summer Olympics |
The Luxembourg Cup () is the national knockout cup competition in Luxembourgian football. It was first held in 1922, and has been held annually since, with the exception of the four seasons during the German occupation during Second World War, though the 2019-20 and 2020-21 seasons were unable to be completed due to the COVID-19 pandemic. The Stade de Luxembourg hosts the final of the tournament.
Winners
Performances
Performance by club
Performance by town
Performance by canton
References
External links
Luxembourg – List of Cup Finals, RSSSF.com
National association football cups
Cup
1921 establishments in Luxembourg
Recurring sporting events established in 1921 |
Hesamabad (), also rendered as Hisamabad, may refer to:
Hesamabad, Fars
Hesamabad, Asadabad, Hamadan Province
Hesamabad, Famenin, Hamadan Province
Hesamabad, Khuzestan
Hesamabad, Markazi
Hesamabad, Qazvin
Hesamabad, Zanjan |
```shell
#!/bin/bash
#
# 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.
source ${CCPROOT}/examples/common.sh
echo_info "Cleaning up.."
cleanup "${CCP_NAMESPACE?}-sync"
$CCPROOT/examples/waitforterm.sh primarysync ${CCP_CLI?}
$CCPROOT/examples/waitforterm.sh replicasync ${CCP_CLI?}
``` |
```xml
import { GraphQLProject } from "./base";
import { LoadingHandler } from "../loadingHandler";
import { FileSet } from "../fileSet";
import { ServiceConfig } from "../config";
import { ClientIdentity } from "../engine";
import URI from "vscode-uri";
export function isServiceProject(
project: GraphQLProject
): project is GraphQLServiceProject {
return project instanceof GraphQLServiceProject;
}
export interface GraphQLServiceProjectConfig {
clientIdentity?: ClientIdentity;
config: ServiceConfig;
rootURI: URI;
loadingHandler: LoadingHandler;
}
export class GraphQLServiceProject extends GraphQLProject {
constructor({
clientIdentity,
config,
rootURI,
loadingHandler,
}: GraphQLServiceProjectConfig) {
const fileSet = new FileSet({
rootURI: config.configDirURI || rootURI,
includes: [
...config.service.includes,
".env",
"apollo.config.js",
"apollo.config.cjs",
],
excludes: config.service.excludes,
configURI: config.configURI,
});
super({ config, fileSet, loadingHandler, clientIdentity });
this.config = config;
}
get displayName() {
return this.config.graph || "Unnamed Project";
}
initialize() {
return [];
}
validate() {}
getProjectStats() {
return { loaded: true, type: "service" };
}
resolveFederationInfo() {
return this.schemaProvider.resolveFederatedServiceSDL();
}
}
``` |
Lauter is a small river of Baden-Württemberg, Germany. It is a left tributary of the Blau near Blaustein.
See also
List of rivers of Baden-Württemberg
Rivers of Baden-Württemberg
Rivers of Germany |
```kotlin
package kotlinx.coroutines
import kotlinx.coroutines.testing.*
import org.junit.*
class RunBlockingJvmTest : TestBase() {
@Test
fun testContract() {
val rb: Int
runBlocking {
rb = 42
}
rb.hashCode() // unused
}
}
``` |
Uncover is the third extended play (EP) by Swedish singer Zara Larsson. The EP was released on 16 January 2015 by TEN Music Group, Epic Records, and Sony Music. It is her first release internationally outside of Europe. The EP features six songs taken from her debut studio album, 1.
Critical reception
Kristen Maree of Renowned for Sound stated "Kicking off with laid-back, mid-tempo track 'Wanna Be Your Baby', Zara throws us back to some of Mariah Carey's peppier stuff, move quickly to 'Never Gonna Die' which you would be forgiven for mistaking for Rihanna. The title track 'Uncover' is the pretty ballad of the bunch, while 'Carry You Home' is exceptionally current and unique. The echoey 'She’s Not Me' is the closest we get to cliché, saved by Zara’s stunning vocal performance, while the closing 'Rooftop' is the nicest way to round off the EP, sounding like something from Taylor Swift's 1989." MuuMuse's Bradley Stern claimed "[Uncover] is the very essence of Swede–pop at its finest – strong songcraft, powerful melodies, and captivatingly pure vocals, from the feel–good, '80's synth–soaked 'Wanna Be Your Baby' to the thoroughly brilliant 'Rooftop' to 'She's Not Me, Pt. 1 & 2', which glides across ghostly wisps like one long, paranoid internal monologue and/or ode to Madonna's Hard Candy jam."
Track listing
Release history
References
2015 EPs
Pop music EPs
Zara Larsson albums |
Marijan Trepše (25 March 1887 – 4 October 1964) was a Croatian painter, graphic artist and set designer, considered to be one of the key figures in Croatian art in the early part of the 20th century. In 1919 the seventh exhibition of the Spring Salon opened at the Crafts school in Zagreb. Exhibiting for the first time together, Milivoj Uzelac, Vilko Gecan, Marijan Trepše and Vladimir Varlaj dominated the exhibit with their expressionist works. The Prague Four, as they became known, had returned to Zagreb that year from their studies at the Prague academy and the work of these young painters brought in new expressionist ideas that were to dominate the Croatian art scene of the 1920s.
Together with Gecan, Uzelac and Varlaj, with whom he was later to exhibit as the Group of Four, Marijan Trepše represents the link through which Miroslav Kraljević’s style evolved into expressionism. Trepše’s own art moved from early expressionist and classicist inspirations to more open colour and freedom of gesture. His early work was characterised by interiors with figures, generally featuring a single woman. After 1933, he created a series of landscapes from around Zagreb and motifs from the south, and worked as a set designer for the Croatian National Theatre in Zagreb.
Biography
Marijan Trepše was born in Zagreb on 25 March 1887. He attended the High School for Arts Crafts in Zagreb (1914–1918), where he studied under Bela Čikoš Sesija. His studies continued at the Academy of Fine Arts in Prague with Max Švabinský, then from 1920 to 1922, in Paris, at the Académie de la Grande Chaumière.
From 1919, Marijan Trepše exhibited his work at the Zagreb Spring Salon, and later as part of the Group of Four (Gecan, Trepše, Uzelac, Varlaj). In 1926 he was awarded a gold medal for art in an international exhibition in Philadelphia.
From 1925 until his retirement in 1956 he worked as a set designer at the Croatian National Theatre in Zagreb, and between 1926 and 1931 he taught at the National Crafts School in Zagreb. From 1950, he worked with the Zadar and Zagreb Puppet Theatres.
Marijan Trepše died 4 October 1964 in Zagreb.
Legacy
Trepše is one of those artists who achieved his best work in his youth. Although Trepše was educated at the Zagreb Academy of Bela Čikoš Sesija, his early work shows no traces of the Art Nouveau and Symbolism of his teacher. After graduating from Zagreb, in the autumn of 1918 he moved to Prague, where Milivoj Uzelac had been since 1915. Vladimir Varlaj and Vilko Gecan also arrived in Prague, meeting up with Ivo Režek and Frano Kršinić to make the city an important reference for Croatian modern art. From there, they picked up the new ideas of secessionism and expressionism, which they brought back to Croatian art.
An important influence on Trepše and his contemporaries was the artist Miroslav Kraljević, who had died in 1913, aged only 27. While Kraljević had depicted wealthy gentlemen in the company of courtesans in Paris, Trepše and his fellow artists in Prague showed working people. A typical scene in Trepše's paintings had sombre men in hats sitting around a wooden table in a bar, playing cards and drinking, some fallen asleep where they sat. The place is obscurely lit, full of smoke, and there is usually just one woman in the company.
A large retrospective exhibit of his works opened in 2010 in the Art Pavilion, Zagreb. It included works in oils, watercolour and prints, as well as some of his original designs for theatre sets. More comprehensive than the previous retrospective held at the same venue in 1975, the exhibit provided the opportunity for a new reading of Trepše's work. In fact, much of his work was not generally known to the public, and this was the first showing for some of his best works. According to the art historian Zvonko Matković, who was responsible for organizing the exhibit, Marijan Trepše belongs among the most important Croatian artists of the first half of the 20th century. He was one of those who revived the style of Miroslav Kraljević, and took it closer to expressionism. Together with his contemporaries (Uzelac, Gecan and Varlaj) he brought important changes to the Spring Salon, a key part of the development of art in Croatia between the World wars.
Trepše's output was diverse. He is considered one of the best graphic artists in the years immediately after World War I. In the early 1920s in Paris, classicist tendencies had emerged, with the rounded solid forms which can be seen in much of Trepše's art. Derain and Picasso were important references of the time. In the mid-1920s Trepše began to work in stained glass for which he received many commissions. His most important work Calvary (Golgota), which in 1935 was placed in the chapel of the suffering of Jesus (Trpećeg Isusa) in Zagreb. In 1925 he began work at the Croatian National Theatre in Zagreb, at a time when set design was developing in exciting new directions.
Works
Paintings
Olive Tree (Maslinik), 1919
Calvary (Golgota), 1920
Portrait of Krleža (Portret Krleže), 1920
Portrait of a Boy (Portret dječaka), 1920
Self-portrait (Autoportret), around 1920
Spring (U prirodi), 1921
Ilich Square (Ilički trg), 1921
Card Player (Kartaš), 1920/21
Woman Before Sleeping (Žena prije spavanja), 1921/22
Woman with Jar (Žena s vrčem), 1926
Reclining Woman (Žena koja leži)
Woman with Fan (Dama s lepezom), 1930
Woman with Cat (Žena s mačkom), 1931
Village (Selo), 1930s
Graphical illustrations
From Tales of Hoffmann (Iz Hoffmannovih priča), 1919
From Cabaret (Iz cabareta), 1919
Murder (Ubojstvo), 1919
Thunderbird (Grom), 1919
The Afflicted (Bijednici), 1919
Samson and Delila (Samson i Dalila), 1919
We Want Barrabas (Hoćemo Barabu), 1919
Theatrical set designs
Sets and costumes for National Theatre productions, including
Calderon's Gospođe Đavolice, 1925
Johnny plays (Johnny svira), 1928
Maruf's H. Rabauda (1929)
Bone (Koštana), 1931
Samson and Delila (Samson i Dalila), 1937
Stonemason (Kamenik) 1946/1947
Equinox (Ekvinocij), 1950/1951
Exhibitions
During his lifetime, Marijan Trepše exhibited in the Zagreb Spring Salon, and with the Group of Four.
Solo exhibitions
Recent exhibitions of his work include:
2010-2011 Marijan Trepše retrospektiva, Art Pavilion Zagreb
1975 Marijan Trepše - Art Pavilion, Zagreb
Group exhibitions
1997 Realism of the 1920s: Magic, Classic, Objective in Croatian Art. ArTresor Studio, Zagreb
1980 Expressionism and Croatian Art, Art Pavilion Zagreb
Public Collections
Marijan Trepše's work can be found in the following public collections
Croatia
Museum of Contemporary Art, Zagreb
Gallery of Fine Arts, Split
Gallery of Fine Arts, Osijek
Museum of Modern and Contemporary Art, Rijeka
Serbia
Museum of Contemporary Art, Belgrade
References
1887 births
1964 deaths
Croatian designers
Artists from Zagreb
Academy of Fine Arts, Prague alumni
Alumni of the Académie de la Grande Chaumière
20th-century Croatian painters
Croatian male painters
20th-century Croatian male artists |
```c
/* ====================================================================
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
*
* 3. All advertising materials mentioning features or use of this
* software must display the following acknowledgment:
* "This product includes software developed by the OpenSSL Project
* for use in the OpenSSL Toolkit. (path_to_url"
*
* 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
* endorse or promote products derived from this software without
* prior written permission. For written permission, please contact
* openssl-core@openssl.org.
*
* 5. Products derived from this software may not be called "OpenSSL"
* nor may "OpenSSL" appear in their names without prior written
* permission of the OpenSSL Project.
*
* 6. Redistributions of any form whatsoever must retain the following
* acknowledgment:
* "This product includes software developed by the OpenSSL Project
* for use in the OpenSSL Toolkit (path_to_url"
*
* THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
* EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
* OF THE POSSIBILITY OF SUCH DAMAGE.
* ==================================================================== */
#include <assert.h>
#include <string.h>
#include "internal.h"
#ifndef STRICT_ALIGNMENT
# define STRICT_ALIGNMENT 0
#endif
void CRYPTO_cbc128_encrypt(const uint8_t *in, uint8_t *out, size_t len,
const void *key, uint8_t ivec[16],
block128_f block) {
size_t n;
const uint8_t *iv = ivec;
assert(key != NULL && ivec != NULL);
assert(len == 0 || (in != NULL && out != NULL));
if (STRICT_ALIGNMENT &&
((size_t)in | (size_t)out | (size_t)ivec) % sizeof(size_t) != 0) {
while (len >= 16) {
for (n = 0; n < 16; ++n) {
out[n] = in[n] ^ iv[n];
}
(*block)(out, out, key);
iv = out;
len -= 16;
in += 16;
out += 16;
}
} else {
while (len >= 16) {
for (n = 0; n < 16; n += sizeof(size_t)) {
*(size_t *)(out + n) = *(size_t *)(in + n) ^ *(size_t *)(iv + n);
}
(*block)(out, out, key);
iv = out;
len -= 16;
in += 16;
out += 16;
}
}
while (len) {
for (n = 0; n < 16 && n < len; ++n) {
out[n] = in[n] ^ iv[n];
}
for (; n < 16; ++n) {
out[n] = iv[n];
}
(*block)(out, out, key);
iv = out;
if (len <= 16) {
break;
}
len -= 16;
in += 16;
out += 16;
}
memcpy(ivec, iv, 16);
}
void CRYPTO_cbc128_decrypt(const uint8_t *in, uint8_t *out, size_t len,
const void *key, uint8_t ivec[16],
block128_f block) {
size_t n;
union {
size_t t[16 / sizeof(size_t)];
uint8_t c[16];
} tmp;
assert(key != NULL && ivec != NULL);
assert(len == 0 || (in != NULL && out != NULL));
const uintptr_t inptr = (uintptr_t) in;
const uintptr_t outptr = (uintptr_t) out;
/* If |in| and |out| alias, |in| must be ahead. */
assert(inptr >= outptr || inptr + len <= outptr);
if ((inptr >= 32 && outptr <= inptr - 32) || inptr < outptr) {
/* If |out| is at least two blocks behind |in| or completely disjoint, there
* is no need to decrypt to a temporary block. */
const uint8_t *iv = ivec;
if (STRICT_ALIGNMENT &&
((size_t)in | (size_t)out | (size_t)ivec) % sizeof(size_t) != 0) {
while (len >= 16) {
(*block)(in, out, key);
for (n = 0; n < 16; ++n) {
out[n] ^= iv[n];
}
iv = in;
len -= 16;
in += 16;
out += 16;
}
} else if (16 % sizeof(size_t) == 0) { /* always true */
while (len >= 16) {
size_t *out_t = (size_t *)out, *iv_t = (size_t *)iv;
(*block)(in, out, key);
for (n = 0; n < 16 / sizeof(size_t); n++) {
out_t[n] ^= iv_t[n];
}
iv = in;
len -= 16;
in += 16;
out += 16;
}
}
memcpy(ivec, iv, 16);
} else {
/* |out| is less than two blocks behind |in|. Decrypting an input block
* directly to |out| would overwrite a ciphertext block before it is used as
* the next block's IV. Decrypt to a temporary block instead. */
if (STRICT_ALIGNMENT &&
((size_t)in | (size_t)out | (size_t)ivec) % sizeof(size_t) != 0) {
uint8_t c;
while (len >= 16) {
(*block)(in, tmp.c, key);
for (n = 0; n < 16; ++n) {
c = in[n];
out[n] = tmp.c[n] ^ ivec[n];
ivec[n] = c;
}
len -= 16;
in += 16;
out += 16;
}
} else if (16 % sizeof(size_t) == 0) { /* always true */
while (len >= 16) {
size_t c, *out_t = (size_t *)out, *ivec_t = (size_t *)ivec;
const size_t *in_t = (const size_t *)in;
(*block)(in, tmp.c, key);
for (n = 0; n < 16 / sizeof(size_t); n++) {
c = in_t[n];
out_t[n] = tmp.t[n] ^ ivec_t[n];
ivec_t[n] = c;
}
len -= 16;
in += 16;
out += 16;
}
}
}
while (len) {
uint8_t c;
(*block)(in, tmp.c, key);
for (n = 0; n < 16 && n < len; ++n) {
c = in[n];
out[n] = tmp.c[n] ^ ivec[n];
ivec[n] = c;
}
if (len <= 16) {
for (; n < 16; ++n) {
ivec[n] = in[n];
}
break;
}
len -= 16;
in += 16;
out += 16;
}
}
``` |
```yaml
version: "3.1"
intents:
- affirm
- deny
- greet
- thankyou
- goodbye
- search_concerts
- search_venues
- compare_reviews
- bot_challenge
- nlu_fallback
- how_to_get_started
entities:
- name
slots:
concerts:
type: list
influence_conversation: false
mappings:
- type: custom
venues:
type: list
influence_conversation: false
mappings:
- type: custom
likes_music:
type: bool
influence_conversation: true
mappings:
- type: custom
responses:
utter_greet:
- text: "Hey there!"
utter_goodbye:
- text: "Goodbye :("
utter_default:
- text: "Sorry, I didn't get that, can you rephrase?"
utter_youarewelcome:
- text: "You're very welcome."
utter_iamabot:
- text: "I am a bot, powered by Rasa."
utter_get_started:
- text: "I can help you find concerts and venues. Do you like music?"
utter_awesome:
- text: "Awesome! You can ask me things like \"Find me some concerts\" or \"What's a good venue\""
actions:
- action_search_concerts
- action_search_venues
- action_show_concert_reviews
- action_show_venue_reviews
- action_set_music_preference
session_config:
session_expiration_time: 60 # value in minutes
carry_over_slots_to_new_session: true
``` |
```shell
#!/bin/sh
# @cmd:
pyomo solve scont2.py --transform gdp.bigm --solver=glpk
# @:cmd
python verify_scont.py results.yml
rm results.yml
``` |
The 2nd constituency of Vendée is a French legislative constituency in the Vendée département. It elects one MP to the National Assembly of France.
Description
The 2nd Constituency of Vendée stretches from the southern half of La Roche-sur-Yon to the southern edge of the department.
Between 1988 and 2012 this constituency consistently returned conservative centre-right candidates.to the National Assembly. In 2012 the seat elected a Socialist Party deputy for the first time, followed in 2017 by Patricia Gallerneau of the MoDem.
Patricia Gallerneau, a member of the MoDem and related group, was elected to this constituency following the 2017 elections. She died from cancer in July 2019 and was replaced by her substitute Patrick Loiseau, who sits in the same group. Loiseau lost his seat in the 2022 election, and was succeeded by Béatrice Bellamy.
Assembly Members
Election results
2022
|-
| colspan="8" bgcolor="#E9E9E9"|
|-
* LREM dissident not supported by the Ensemble Citoyens alliance
2017
|-
| colspan="8" bgcolor="#E9E9E9"|
|-
2012
|-
| colspan="8" bgcolor="#E9E9E9"|
|-
2007
|-
| colspan="8" bgcolor="#E9E9E9"|
|-
2002
|-
| colspan="8" bgcolor="#E9E9E9"|
|-
1997
|-
| colspan="8" bgcolor="#E9E9E9"|
|-
References
2 |
Hell's Horizon is a 1955 American war film directed by Tom Gries. The film stars John Ireland and Marla English. Hell's Horizon recounts the story of a bomber crew in the Korean War.
Plot
During the Korean War, United States Air Force Captain John Merrill (John Ireland) is the pilot of a Boeing B-29 Superfortress bomber. Merrill is based in Okinawa and is ordered to destroy a Yalu River bridge in Korea. The mission is continually delayed due to bad weather. His co-pilot (Bill Williams) has to step in when the bored and frustrated crew members begin to fight over Sammi (Marla English), a local woman who is employed as a laundress at their base.
When the weather finally clears over the target, Merrill is ordered to attack the strategic bridge, but with only cloud cover as his protection. The North Koreans are prepared, and anti-aircraft guns hit the bomber as it descends out of the clouds. The attack is a success, but some crew members are killed, including "Jockey" (Chet Baker), the popular trumpeter of the base. Others on board are wounded. Merrill has to contend not only with the damaged bomber, but also flying through a deadly storm.
The bomber returns to base with extensive damage and only one engine still working, so Merrill has to make a "pancake" landing. The survivors make it back in time to hear the announcement of Sammi's engagement to one of the crew, Sgt. "Buddy" Lewis (Larry Pennell).
Cast
John Ireland as Capt. John Merrill
Marla English as Sammi
Bill Williams as Paul Jenkins
Hugh Beaumont as Sgt. Al Trask
Larry Pennell as Sgt. "Buddy" Lewis
Chet Baker as "Jockey"
Production
Hell's Horizon relied on a large amount of stock footage.
Reception
Despite its release only a few years after the end of the Korean War, Hell's Horizon was no more than a typical B war film. Reviewer Alun Evans summed it up as a "standard action drama of a single bomber raid in the Korean conflict with no redeeming features." In Leonard Maltin's review, he merely noted, "Interaction among men of bombing squad in the Korean War."
See also
List of American films of 1955
Notes
References
Bibliography
Evans, Alun. Brassey's Guide to War Films. Dulles, Virginia: Potomac Books, 2000. .
External links
1955 films
1955 war films
American war films
American aviation films
American black-and-white films
Films directed by Tom Gries
Korean War aviation films
Columbia Pictures films
1950s English-language films
1950s American films |
```smalltalk
using AspNetCoreSpa.Domain.Entities;
using Microsoft.EntityFrameworkCore;
using Microsoft.EntityFrameworkCore.Metadata.Builders;
namespace AspNetCoreSpa.Infrastructure.Persistence.Configurations
{
public class EmployeeTerritoryConfiguration : IEntityTypeConfiguration<EmployeeTerritory>
{
public void Configure(EntityTypeBuilder<EmployeeTerritory> builder)
{
builder.HasKey(e => new { e.EmployeeId, e.TerritoryId })
.IsClustered(false);
builder.Property(e => e.EmployeeId).HasColumnName("EmployeeID");
builder.Property(e => e.TerritoryId)
.HasColumnName("TerritoryID")
.HasMaxLength(20);
builder.HasOne(d => d.Employee)
.WithMany(p => p.EmployeeTerritories)
.HasForeignKey(d => d.EmployeeId)
.OnDelete(DeleteBehavior.ClientSetNull)
.HasConstraintName("FK_EmployeeTerritories_Employees");
builder.HasOne(d => d.Territory)
.WithMany(p => p.EmployeeTerritories)
.HasForeignKey(d => d.TerritoryId)
.OnDelete(DeleteBehavior.ClientSetNull)
.HasConstraintName("FK_EmployeeTerritories_Territories");
}
}
}
``` |
```java
package org.hswebframework.web.datasource.switcher;
import lombok.extern.slf4j.Slf4j;
import org.hswebframework.web.context.ContextKey;
import org.hswebframework.web.context.ContextUtils;
import java.util.Deque;
import java.util.LinkedList;
import java.util.Optional;
@Slf4j
public class DefaultSwitcher implements Switcher {
private String name;
private String defaultId;
private String type;
public DefaultSwitcher(String name, String type) {
this.name = "DefaultSwitcher.".concat(name);
this.defaultId = name.concat(".").concat("_default");
this.type = type;
}
protected Deque<String> getUsedHistoryQueue() {
// ThreadLocal
return ContextUtils.currentContext()
.<Deque<String>>getOrDefault(ContextKey.of(name), LinkedList::new);
}
@Override
public void useLast() {
//
if (getUsedHistoryQueue().isEmpty()) {
return;
}
//,
getUsedHistoryQueue().removeLast();
if (log.isDebugEnabled()) {
String current = current().orElse(null);
if (null != current) {
log.debug("try use last {} : {}", type, current);
} else {
log.debug("try use last default {}", type);
}
}
}
@Override
public void use(String id) {
//
getUsedHistoryQueue().addLast(id);
if (log.isDebugEnabled()) {
log.debug("try use {} : {}", type, id);
}
}
@Override
public void useDefault() {
getUsedHistoryQueue().addLast(defaultId);
if (log.isDebugEnabled()) {
log.debug("try use default {}", type);
}
}
@Override
public Optional<String> current() {
if (getUsedHistoryQueue().isEmpty()) {
return Optional.empty();
}
String activeId = getUsedHistoryQueue().getLast();
if (defaultId.equals(activeId)) {
return Optional.empty();
}
return Optional.of(activeId);
}
@Override
public void reset() {
getUsedHistoryQueue().clear();
if (log.isDebugEnabled()) {
log.debug("reset {} history", type);
}
}
}
``` |
The seventh competition weekend of the 2010–11 ISU Speed Skating World Cup was held in Salt Lake City, United States, on February 18–19, 2011.
Martina Sáblíková of the Czech Republic set a new world record on the women's 5000 metres.
Schedule of events
The schedule of the event is below:
Medal summary
Men's events
Women's events
References
7
Isu World Cup, 2010-11, 7
Sports in Salt Lake City
ISU Speed Skating |
Abacetus sinuaticollis is a species of ground beetle in the subfamily Pterostichinae. It was described by Straneo in 1939.
References
sinuaticollis
Beetles described in 1939 |
```go
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
// +build darwin dragonfly freebsd netbsd
package route
import (
"runtime"
"syscall"
)
func (m *RouteMessage) marshal() ([]byte, error) {
w, ok := wireFormats[m.Type]
if !ok {
return nil, errUnsupportedMessage
}
l := w.bodyOff + addrsSpace(m.Addrs)
if runtime.GOOS == "darwin" {
// Fix stray pointer writes on macOS.
// See golang.org/issue/22456.
l += 1024
}
b := make([]byte, l)
nativeEndian.PutUint16(b[:2], uint16(l))
if m.Version == 0 {
b[2] = sysRTM_VERSION
} else {
b[2] = byte(m.Version)
}
b[3] = byte(m.Type)
nativeEndian.PutUint32(b[8:12], uint32(m.Flags))
nativeEndian.PutUint16(b[4:6], uint16(m.Index))
nativeEndian.PutUint32(b[16:20], uint32(m.ID))
nativeEndian.PutUint32(b[20:24], uint32(m.Seq))
attrs, err := marshalAddrs(b[w.bodyOff:], m.Addrs)
if err != nil {
return nil, err
}
if attrs > 0 {
nativeEndian.PutUint32(b[12:16], uint32(attrs))
}
return b, nil
}
func (w *wireFormat) parseRouteMessage(typ RIBType, b []byte) (Message, error) {
if len(b) < w.bodyOff {
return nil, errMessageTooShort
}
l := int(nativeEndian.Uint16(b[:2]))
if len(b) < l {
return nil, errInvalidMessage
}
m := &RouteMessage{
Version: int(b[2]),
Type: int(b[3]),
Flags: int(nativeEndian.Uint32(b[8:12])),
Index: int(nativeEndian.Uint16(b[4:6])),
ID: uintptr(nativeEndian.Uint32(b[16:20])),
Seq: int(nativeEndian.Uint32(b[20:24])),
extOff: w.extOff,
raw: b[:l],
}
errno := syscall.Errno(nativeEndian.Uint32(b[28:32]))
if errno != 0 {
m.Err = errno
}
var err error
m.Addrs, err = parseAddrs(uint(nativeEndian.Uint32(b[12:16])), parseKernelInetAddr, b[w.bodyOff:])
if err != nil {
return nil, err
}
return m, nil
}
``` |
```c
/*
* This file is part of FFmpeg.
*
* FFmpeg is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
*
* FFmpeg is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
*
* You should have received a copy of the GNU Lesser General Public
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include "libavutil/log.h"
#include "libavutil/timer.h"
#include "libavutil/lfg.h"
int main(void)
{
int x = 0;
int i, j;
AVLFG state;
av_lfg_init(&state, 0xdeadbeef);
for (j = 0; j < 10000; j++) {
START_TIMER
for (i = 0; i < 624; i++) {
//av_log(NULL, AV_LOG_ERROR, "%X\n", av_lfg_get(&state));
x += av_lfg_get(&state);
}
STOP_TIMER("624 calls of av_lfg_get");
}
av_log(NULL, AV_LOG_ERROR, "final value:%X\n", x);
/* BMG usage example */
{
double mean = 1000;
double stddev = 53;
double samp_mean = 0.0, samp_stddev = 0.0;
double samp0, samp1;
av_lfg_init(&state, 42);
for (i = 0; i < 1000; i += 2) {
double bmg_out[2];
av_bmg_get(&state, bmg_out);
samp0 = bmg_out[0] * stddev + mean;
samp1 = bmg_out[1] * stddev + mean;
samp_mean += samp0 + samp1;
samp_stddev += samp0 * samp0 + samp1 * samp1;
av_log(NULL, AV_LOG_INFO,
"%f\n%f\n",
samp0,
samp1);
}
/* TODO: add proper normality test */
samp_mean /= 1000;
samp_stddev /= 999;
samp_stddev -= (1000.0/999.0)*samp_mean*samp_mean;
samp_stddev = sqrt(samp_stddev);
av_log(NULL, AV_LOG_INFO, "sample mean : %f\n"
"true mean : %f\n"
"sample stddev: %f\n"
"true stddev : %f\n",
samp_mean, mean, samp_stddev, stddev);
}
return 0;
}
``` |
This is a complete list of recipients of the Israel Prize from the inception of the Prize in 1953 through to 2022.
List
For each year, the recipients are, in most instances, listed in the order in which they appear on the official Israel Prize website.
Note: The table can be sorted chronologically (default), alphabetically or by field utilizing the icon.
See also
List of Israeli Nobel laureates
References
External links
List at the Jewish Virtual Library
Israel Prize winners
Israel Prize winners
de:Israel-Preis#Die Preisträger |
```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 proto defines the protobuf codec. Importing this package will
// register the codec.
package proto
import (
"fmt"
"github.com/golang/protobuf/proto"
"google.golang.org/grpc/encoding"
)
// Name is the name registered for the proto compressor.
const Name = "proto"
func init() {
encoding.RegisterCodec(codec{})
}
// codec is a Codec implementation with protobuf. It is the default codec for gRPC.
type codec struct{}
func (codec) Marshal(v interface{}) ([]byte, error) {
vv, ok := v.(proto.Message)
if !ok {
return nil, fmt.Errorf("failed to marshal, message is %T, want proto.Message", v)
}
return proto.Marshal(vv)
}
func (codec) Unmarshal(data []byte, v interface{}) error {
vv, ok := v.(proto.Message)
if !ok {
return fmt.Errorf("failed to unmarshal, message is %T, want proto.Message", v)
}
return proto.Unmarshal(data, vv)
}
func (codec) Name() string {
return Name
}
``` |
```ocaml
(* Unison file synchronizer: src/fileutil.mli *)
(* Convert backslashes in a string to forward slashes. Useful in Windows. *)
val backslashes2forwardslashes : string -> string
val removeTrailingSlashes : string -> string
``` |
Dryophytes eximius, commonly known as the mountain tree frog, is a species of frog in the family Hylidae endemic to Mexico. Its natural habitats are mesquite grasslands, scrub forests, and pine-oak forests. It is a widely distributed species that faces no major threats.
Dryophytes eximius is listed as the state amphibian of Arizona. As currently circumscribed, Dryophytes eximius does not occur in Arizona. Dryophytes wrightorum, the Wright's mountain tree frog, which has previously been regarded as a synonym of Dryophytes eximius does occur in Arizona.
References
Dryophytes
Amphibians described in 1854
Taxa named by Spencer Fullerton Baird
Endemic amphibians of Mexico
Taxonomy articles created by Polbot |
The 15th Rome Quadriennale or XV Rome Quadriennale (Italian pronunciation: Quindicesima Quadriennale di Roma) is an Italian art exhibition (the 15th edition of the Rome Quadrennial) held between 19 June and 14 September 2008 at its historical site, the Palazzo delle Esposizioni of Rome, Italy.
The exhibition has no thematic restrictions and originates with the aim of documenting a situation in evolution, by mapping out a panorama of contemporary Italian art of the two decades preceding 2008.
The 15ª Q, as it is called on the cover of the catalogue and on the publicity materials connected to the manifestation, cost about two million euro and had some 30,000 visitors during the 76 days that it was open.
The exhibition
The aim of the exhibition is to trace out a map of the main results of the artistic research conducted in Italy during the two decades prior to 2008 as well as of the experiences considered representative of that period, devoting particular attention to the artists in the middle of their careers and the younger ones, indicative of the possible future evolution of the Italian artistic panorama. The exhibition registers the different tendencies of contemporary art in which conceptual art, minimalism, and the various tendencies of the pictorial and photographic image are confronted in a further attempt to identify the possible singularities of the Italian situation in the international system of art.
Ninety-nine artists have been invited, each with a single recent work, in many cases created for the occasion. Painting, photography, video art, sculpture, installations and net art are the expressions that have been adopted in the exhibition in proportions that are not homogeneous. The artists participating have an average age of forty-five years, one-quarter of them are under thirty-five and a third are women.
The XV Rome Quadrennial has been dedicated to the memory of Luciano Fabro: his sculpture Autunno (Autumn), exhibited here for the first time, opens the exhibition in the Sala della Rotonda of Palazzo delle Esposizioni.
During the exhibition period, the educational services of the Palazzo delle Esposizioni, in collaboration with the Faculty of Letters and Philosophy of the Sapienza University of Rome, have organized meetings between the artists and the public in the sphere of thematic visits.
Committee members and installation
A committee of curators and art historians, composed of Chiara Bertola, Lorenzo Canova, Bruno Corà, Daniela Lancioni and Claudio Spadoni, is responsible for the critical installation of the exhibition as well as the choice of artists to invite to participate.
The itinerary of the exhibition extends over 3,000 square metres on the three levels of Palazzo delle Esposizioni, Giulio Turchetta has organized the installation.
Artists
Mario Airò, Carolina Raquel Antich, Andrea Aquilanti, Stefano Arienti, Sergia Avveduti, Massimo Bartolini, Matteo Basilé, Alessandro Bazan, Vanessa Beecroft, Angelo Bellobono, Elisabetta Benassi, Manfredi Beninati, Stefano Boccalini, Francesco Bocchini, Stefano Bonacci, Giuseppe Caccavale, Alessandro Cannistrà, Gea Casolaro, Antonio Catelani, Alice Cattaneo, Loris Cecchini, Francesco Cervelli, Paolo Chiasera, Claudio Citterio, Marco Colazzo, Luca Costantini, Francesco De Grandi, Daniela De Lorenzo, Giulio De Mitri, Fabrice de Nola, Alberto Di Fabio, Anna Di Febo, Elisabetta Di Maggio, Andrea Di Marco, Rä di Martino, Fulvio Di Piazza, Mauro Di Silvestre, Valentino Diego, Bruna Esposito, Stefania Fabrizi, Luciano Fabro, David Fagioli, Lara Favaretto, Flavio Favelli, Danilo Fiorucci, Simona Frillici, Paolo Grassino, Alice Guareschi, Debora Hirsch, Irena Kalođera, Karpüseeler, Deborah Logorio, Federico Lombardo, Claudia Losi, Serenella Lupparelli, Andrea Mastrovito, Vittoria Mazzoni, Sabrina Mezzaqui, Matteo Montani, Diego Morandini, Maria Morganti, Liliana Moro, Adriano Nardi, Marco Neri, Davide Nido, Adrian Paci, Luca Pancrazzi, Marina Paris, Luana Perilli, Perino & Vele, Diego Perrone, Paola Pivi, Piero Pompili, Franco Pozzi, Luisa Protti, Daniele Puppi, Luisa Rabbia, Antonio Riello, Giovanni Rizzoli, Bernhard Rüdiger, Andrea Salvino, Mariateresa Sartori, Maurizio Savini, Francesco Simeti, Sissi, Federico Solmi, Vittorio Sopracase, Donatella Spaziani, Stalker/ON, Giuseppe Stampone, Giovanni Termini, Alessandra Tesi, Silvano Tessarollo, Grazia Toderi, Stefano Tondo, Luca Trevisani, Erich Turroni, Nico Vascellari, Nicola Verlato, Marco Verrelli.
Jury and Prizes
For the first time in the history of the Rome Quadrennial, the jury, composed of Suzanne Pagé, Director of the Foundation Louis-Vuitton, Gerald Matt, Director of the Kunsthalle of Vienna and Vicente Todolí, Director of the Tate Modern of London, is not Italian.
On 12 September 2008 2008, the Prize Jury of the XV Quadrennial awarded the Quadrennial Prize (20,000 euro) to Adrian Paci, and the Prize for Young Art (10,000 euro) to Deborah Ligorio. Both Adrian Paci and Deborah Ligorio have participated with video art works.
A career prize (a gold medal) was awarded to Maurizio Cattelan. On 24 March 2009, at the MAXXI of Rome, the singer Elio of the Elio e le Storie Tese, who announced that he was the real Cattelan, came to receive the prize, making witty remarks and answering questions from Francesco Prosperetti, Anna Mattirolo, Gino Agnese, Stefano Chiodi, Andrea Cortellessa, Cornelia Lauf and the public that was present.
Catalogue
The exhibition is documented by a catalogue of the works of 320 pages published by Marsilio. The volume opens with critical essays by Chiara Bertola, Lorenzo Canova, Bruno Corà, Daniela Lancioni and Claudio Spadoni.
Along the itinerary of the exhibition, it is possible to consult a tactile screen with images of the works and entries about the artists edited by Paola Bonani for the Quadriennale Foundation.
Related exhibitions
During the 15th Quadriennale, a documentary exhibition of the history of the Quadrennial of Rome has been installed in the Spazio Fontana of Palazzo delle Esposizioni. This exhibition has been organized by the Archive of the Quadriennale Foundation in collaboration with the Istituto Luce and RAI Teche.
See also
Rome Quadriennale
Venice Biennale
Farnesina Experimenta Art Collection
References
Notes
Bibliography
Chiara Bertola, Lorenzo Canova, Bruno Corà, Daniela Lancioni, Claudio Spadoni. XV Quadriennale d'arte di Roma. Venezia, Marsilio Editori, 2008. .
Emily Verla Bovino, 15th Quadriennale of Rome, Artforum, August 2008.
External links
15th Rome Quadrennial of Art at Palazzo delle Esposizioni.
The Artists and the Works (pdf).
Official Rome Quadrennial Foundation Website.
Video including works and some interviews at Palazzo delle Esposizioni website.
Photogallery of the exhibition at Palazzo delle Esposizioni website.
Contemporary art exhibitions
Art exhibitions in Italy
Festivals in Rome
Italian contemporary art |
Helicoprion is an extinct genus of shark-like eugeneodont fish. Almost all fossil specimens are of spirally arranged clusters of the individuals' teeth, called "tooth whorls", which in life were embedded in the lower jaw. As with most extinct cartilaginous fish, the skeleton is mostly unknown. Fossils of Helicoprion are known from a 20 million year timespan during the Permian period from the Artinskian stage of the Cisuralian (Early Permian) to the Roadian stage of the Guadalupian (Middle Permian). The closest living relatives of Helicoprion (and other eugeneodonts) are the chimaeras, though their relationship is very distant. The unusual tooth arrangement is thought to have been an adaption for feeding on soft bodied prey, and may have functioned as a deshelling mechanism for hard bodied cephalopods such as nautiloids and ammonoids. In 2013, systematic revision of Helicoprion via morphometric analysis of the tooth whorls found only H. davisii, H. bessonowi and H. ergassaminon to be valid, with some of the larger tooth whorls being outliers.
Fossils of Helicoprion have been found worldwide, as the genus is known from Russia, Western Australia, China, Kazakhstan, Japan, Laos, Norway, Canada, Mexico, and the United States (Idaho, Nevada, Wyoming, Texas, Utah, and California). More than 50% of the fossils referred to Helicoprion are H. davisii specimens from the Phosphoria Formation of Idaho. An additional 25% of fossils are found in the Ural Mountains of Russia, belonging to the species H. bessonowi.
Description
Like other chondrichthyan fish, Helicoprion and other eugeneodonts had skeletons made of cartilage. As a result, the entire body disintegrated once it began to decay, unless preserved by exceptional circumstances. This can make it difficult to draw precise conclusions on the full body appearance of Helicoprion. However, the body shape can be estimated via postcranial remains known from a few eugeneodonts. Eugeneodonts with preserved postcrania include the Pennsylvanian to Triassic-age caseodontoids Caseodus, Fadenia, and Romerodus.
These taxa have a fusiform (streamlined, torpedo-shaped) body plan, with triangular pectoral fins. There is a single large and triangular dorsal fin without a fin spine, and a tall, forked caudal fin which externally appears to be homocercal (with two equally-sized lobes). This general body plan is shared by active, open-water predatory fish such as tuna, swordfish, and lamnid sharks. Eugeneodonts also lack pelvic and anal fins, and judging by Romerodus, they would have had broad keels along the side of the body up to the caudal fin. Fadenia had five well-exposed gill slits, possibly with a vestigial sixth gill. There is no evidence of the specialized gill basket and fleshy operculum present in living chimaeroids. Based on the proportional size of caseodontoid tooth whorls, Lebedev suggested that Helicoprion individuals with tooth whorls reaching in diameter could reach in length, rivaling the size of modern basking sharks. The largest known Helicoprion tooth whorl, specimen IMNH 49382 representing an unknown species, reached in diameter and in crown height, which would have belonged to an individual over in length.
Tooth whorls
Almost all Helicoprion specimens are known solely from "tooth whorls", which consist of dozens of enameloid covered teeth embedded within a common logarithmic spiral-shaped root. The youngest and first tooth at the center of the spiral, referred to as the "juvenile tooth arch", is hooked, but all other teeth are generally triangular in shape, laterally compressed and often serrated. Tooth size increases away from the center of the spiral (abaxial), with the largest teeth possibly exceeding in length. The lower part of the teeth form projections that are shingled below the crown of the previous tooth. The lowest portion of the root below the enameloid tooth projections is referred to as the "shaft", and lies on cartilage that encapsulates the previous revolutions of the whorl. In a complete tooth whorl, the outermost part of the spiral terminates with an extended root that lacks the middle and upper portions of the tooth crown.
Cartilaginous skull
Helicoprion specimens preserving more than tooth whorls are very rare. The best-preserved specimen of Helicoprion is IMNH 37899 (also known as "Idaho 4"), referred to Helicoprion davisii. It was found in Idaho in 1950 and was originally described in 1966 by Svend Erik Bendix-Almgreen. A 2013 redescription by Tapanila and colleagues was accompanied by CT scanning, in order to reveal the cartilaginous remains in more detail. CT scanning revealed a nearly complete jaw apparatus, articulated in a closed position with three-dimensional preservation. Alongside the tooth whorl, the specimen preserves a palatoquadrate (forming the upper jaw), Meckel's cartilage (forming the lower jaw), and a robust labial cartilage bracing the tooth whorl. All of these structures are composed of prismatic calcified cartilage, as with modern chondrichthyans. The specimen did not preserve a chondrocranium, the cartilaginous structure which would have housed the brain and sensory organs. The jaws are extensively laterally compressed (narrow) compared to living chondrichthyans, though this may at least partially be an artifact of post-mortem compression.
Helicoprion had an autodiastylic jaw suspension, meaning that the inner edge of the palatoquadrate was firmly attached (but not fused) to the chondrocranium at two separate points. These two attachment points are the dome-shaped ethmoid process at the front of the palatoquadrate, and the flange-like basal process at its upper rear corner. Autodiastylic jaws are common in early euchondrocephalans, though in modern animals they can only be found in embryonic chimaeriforms. Another well-preserved specimen, USNM 22577+494391 (the "Sweetwood specimen"), has demonstrated that the inner surface of the palatoquadrate was covered with numerous small (~2 mm wide) teeth. The palatoquadrate teeth were low and rounded, forming a "pavement" which scraped against the tooth whorl. When seen from behind, the palatoquadrate forms a paired jaw joint with the Meckel's cartilage. There is no evidence for an articulation between the palatoquadrate and the hyomandibula.
Meckel's cartilage has an additional projection right before the joint with the palatoquadrate. This extra process, unique to Helicoprion, likely served to limit jaw closure to prevent the whorl from puncturing the chondrocranium. Another unique characteristic of Helicoprion is that the preserved labial cartilage forms a synchondrosis (fused joint) with the upper surface of the Meckel's cartilage. This joint is facilitated via a long facet on the upper edge of Meckel's cartilage. The labial cartilage provides lateral support for the tooth whorl, widening near the root of each volution. By wedging into the palatoquadrate while the mouth is closed, the upper edge of the labial cartilage helps to spread out the forces used to limit the extent of the jaw closure. The rear portion of the labial cartilage has a cup-like form, protecting the developing root of the last and youngest volution.
Scales
Tooth-like chondricthyan scales, specifically known as odontodes, have been found associated with H. bessonowi remains in Kazakhstan. They are broadly similar to scales of other eugeneodonts such as Sarcoprion and Ornithoprion. The scales have a cap-shaped base with a concave lower surface. The crowns are conical and covered with serrated longitudinal ridges. The scales may be monodontode (with one crown per base) or polyodontode (with a bundle of multiple crowns resulting from the fusion of several odontodes into a larger structure). Compared to other eugeneodonts, the scales of Helicoprion are more strongly pointed.
Paleobiology
The unusual saw-like tooth whorl and the lack of wear on the teeth of Helicoprion implies a diet of soft bodied prey, as hard shelled prey would simply slip out of the mouth. Due to the narrow nature of the jaw, suction feeding is unlikely to have been effective, and Helicoprion is thought to have been a bite feeder. Biomechanical modelling by Ramsay et al. (2015) suggests that the teeth in the whorl had distinct functions depending on where they were in the spiral. The frontmost teeth served to snag and pull prey further into the mouth, while the middle teeth spear and the hind teeth served to puncture and bring prey further into the throat, with the prey being squeezed between the whorl and the two halves of the palatoquadrate. The labial cartilage served to buttress and provide support to the whorl.
Helicoprion may have started with a large gape during initial prey capture, followed by smaller jaw opening and closing cycles to further transport prey into the mouth, as is done by modern bite-feeding sharks. While modern sharks shake their heads from side to side to facilitate sawing and cutting their prey, the teeth of Helicoprion would likely further cut the prey during the jaw opening, due to the arc-like path of the front teeth, similar to the slashing motion of a knife. Helicoprion likely used a series of rapid, forceful jaw closures to initially capture and push prey deeper into the oral cavity, followed by cyclic opening and closing of the jaw to facilitate sawing through prey.
Ramsay and colleagues further suggested that the whorl could have served as an effective mechanism for deshelling hard-shelled cephalopods such as ammonoids and nautiloids, which were abundant in Early Permian oceans. If a hard-shelled cephalopod was bitten head-on, it was possible that the whorl could have served to pull the soft body out of the shell and into the mouth. During jaw closure, the palatoquadrates and tooth whorl combined to form a three-point system, equivalent to the set-up of an inverted three-point flexural test. This system was effective at trapping and holding soft parts to increase cutting efficiency and provide leverage against hard-shelled prey. At the three points of contact, the estimated bite force ranges between , with estimated bite stresses ranging from during initial prey contact. This large bite force may have allowed Helicoprion to expand its diet to vertebrates, as its jaw apparatus was more than capable of cutting through skeletal elements of unarmoured bony fish and other chondrichthyans.
Classification
Skull data from IMNH 37899 reveals several characteristics, such as an autodiastylic jaw suspension without an integrated hyomandibula, which confirm the placement of Helicoprion within the chondrichthyan subgroup Euchondrocephali. In contrast to their sister group Elasmobranchii (containing true sharks, rays, and kin), euchondrocephalans are primarily an extinct group. Living members of Euchondrocephali are solely represented by the order Chimaeriformes in the subclass Holocephali. Chimaeriforms, commonly known as chimaeras or ratfish, are a small and specialized group of rare deep-sea cartilaginous fish. The relationship between Helicoprion and living chimaeras is very distant, but had been previously suspected based on details of its tooth anatomy.
More specifically, Helicoprion can be characterized as a member of Eugeneodontida, an order of shark-like euchondrocephalans which lived from the Devonian to Triassic periods. Eugeneodonts have simple, autodiastylic skulls with reduced marginal dentition and enlarged whorls of blade-like symphysial teeth on the midline of the jaw. Within Eugeneodontida, Helicoprion is placed within Edestoidea, a group of eugeneodonts with particularly tall and angled symphysial teeth. Members of the Edestoidea are divided into two families based on the style of the dentition. One family, the Edestidae, has relatively short tooth blades with roots which incline backwards.
The other family, which contains Helicoprion, is sometimes called Agassizodontidae, based on the genus Agassizodus. However, other authors prefer the family name Helicoprionidae, which was first utilized 70 years prior to Agassizodontidae. Helicoprionids (or agassizodontids) have large, cartilage-supported whorls with strongly arched shapes. Helicoprionids do not shed their teeth; instead, their tooth whorls continually add new teeth with bases inclined forwards at the top of the whorl. As most eugeneodonts are based on fragmentary tooth remains, concrete phylogenetic relationships within the group remain unclear.
History and species
Three species of Helicoprion are currently considered valid via morphometric analyses, differing in the proportions of the upper, middle and lower sections of the tooth crown. These differences are only apparent in adult individuals past the 85th tooth of the spiral.
H. davisii and synonyms
The first specimen of Helicoprion to be described was WAMAG 9080, a 15-tooth fragment of a tooth whorl found along a tributary of the Gascoyne River in Western Australia. Henry Woodward described the fossil in 1886 and named it as the species Edestus davisii, commemorating the man who discovered it. Upon naming H. bessonowi in 1899, Alexander Karpinsky reassigned E. davisii to Helicoprion. In 1902, Charles R. Eastman referred H. davisii to his new genus Campyloprion, but this proposal was never widely accepted. Karpinsky's identification of Edestus davisii as a species of Helicoprion would eventually be upheld by Curt Teichert, who described several more complete tooth whorls from the Wandagee Formation of Western Australia in the late 1930s.
In 1907 and 1909, Oliver Perry Hay described a new genus and species of eugeneodont, Lissoprion ferrieri, from numerous fossils found in phosphate-rich Phosphoria Formation on the border between Idaho and Wyoming. He also synonymized H. davisii with his new genus and species. However, Karpinsky separated the two species once more and transferred them to Helicoprion in 1911. H. ferrieri was initially differentiated using the metrics of tooth angle and height, but Tapanila and Pruitt (2013) considered these characteristics to be intraspecifically variable. As a result, they reassigned H. ferrieri as a junior synonym of H. davisii. Outside the Phosphoria Formation, H. davisii specimens have also been found in Mexico, Texas, and Canada (Nunavut and Alberta). H. davisii is characterized by its tall and widely spaced tooth whorl, with these becoming more pronounced with age. The teeth also noticeably curve forwards.In a 1939 publication, Harry E. Wheeler described two new species of Helicoprion from California and Nevada. One of these, Helicoprion sierrensis, was described from a specimen (UNMMPC 1002) found in glacial moraine deposits in Eastern California, likely originating from the Goodhue Formation. Tapanila and Pruitt determined that the distinguishing shaft range of H. sierrensis was well within the variation found in H. davisii.
H. jingmenense was described in 2007 from a nearly complete tooth whorl (YIGM V 25147) with more than four volutions across a part and counterpart slab. It was discovered during the construction of a road passing through the Lower Permian Qixia Formation of Hubei Province, China. The specimen is very similar to H. ferrieri and H. bessonowi, though it differs from the former by having teeth with a wider cutting blade, and a shorter compound root, and differs from the latter by having fewer than 39 teeth per volution. Tapanila and Pruitt argued that the specimen was partially obscured by the surrounding matrix, resulting in an underestimation of tooth height. Taking into account intraspecific variation, they synonymized it with H. davisii.
H. bessonowi and synonyms
Helicoprion bessonowi was first described in an 1899 monograph by Alexander Karpinsky. Although it was not the first Helicoprion species to be described, it was the first known from complete tooth whorls, demonstrating that Helicoprion was distinct from Edestus. As a result, H. bessonowi serves as the type species for Helicoprion. H. bessonowi is primarily based on a number of specimens from Artinskian-age limestone of the Divya Formation, in the Ural Mountains of Russia. H. bessonowi specimens are also known from the Tanukihara Formation of Japan and Artinskian-age strata in Kazakhstan. It can be differentiated from other Helicoprion species by a short and narrowly spaced tooth whorl, backward-directed tooth tips, obtusely-angled tooth bases, and a consistently narrow whorl shaft.
One of two Helicoprion species described by Wheeler in 1939, H. nevadensis, is based on a single partial fossil found in a Nevadan mine by Elbert A. Stuart in 1929. This fossil, UNMMPC 1001, has been lost. It was reported as having originated from the Rochester Trachyte deposits, which Wheeler considered to be of Artinskian age. However, the Rochester Trachyte is in fact Triassic, and H. nevadensis likely did not originate in the Rochester Trachyte, thus rendering its true age unknown. Wheeler differentiated H. nevadensis from H. bessonowi by its pattern of whorl expansion and tooth height, but Leif Tapanila and Jesse Pruitt showed in 2013 that these were consistent with H. bessonowi at the developmental stage that the specimen represents.
Based on isolated teeth and partial whorls found on the island of Spitsbergen, Norway, H. svalis was described by Stanisław Siedlecki in 1970. The type specimen, a very large whorl with specimen number PMO A-33961, was noted for its narrow teeth that apparently are not in contact with each other. However, this seems to be a consequence of only the central part of the teeth being preserved, according to Tapanila and Pruitt. Since the whorl shaft is partially obscured, H. svalis cannot be definitely assigned to H. bessonowi, but it closely approaches the latter species in many aspects of its proportions. With a maximum volution height of , H. svalis is similar in size to the largest H. bessonowi, which has a maximum volution height of .
In 1999, the holotype of H. bessonowi was stolen, but afterwards was shortly recovered with the aid of an anonymous fossil dealer.
H. ergassaminon
Like H. davisii, Helicoprion ergassaminon is known from the Phosphoria Formation of Idaho. However, it is comparatively much rarer. H. ergassimon was named and described in detail within a 1966 monograph by Svend Erik Bendix-Almgreen. The holotype specimen ("Idaho 5"), now lost, bore breakage and wear marks indicative of its usage in feeding. H. ergassimon is also represented by several other specimens from the Phosphoria Formation, though none of these show wear marks. This species is roughly intermediate between the two contrasting forms represented by H. bessonowi and H. davisii, having tall but narrowly-spaced teeth. Its teeth are also gently curved, with obtusely-angled tooth bases.
Other material
Several large whorls are difficult to assign to any particular species group, H. svalis among them. IMNH 14095, a specimen from Idaho, appears to be similar to H. bessonowi, but it has unique flange-like edges on the apices of its teeth. IMNH 49382, also from Idaho, has the largest known whorl diameter at for the outermost volution (the only one preserved), but it is incompletely preserved and still partially buried. H. mexicanus, named by F.K.G. Müllerreid in 1945, was supposedly distinguished by its tooth ornamentation. Its holotype is currently missing, though its morphology was similar to that of IMNH 49382. In the absence of other material, it is currently a nomen dubium. Vladimir Obruchev described H. karpinskii from two teeth in 1953. He provided no distinguishing traits for this species, thus it must be regarded as a nomen nudum. Various other indeterminate Helicoprion specimens have been described from Canada, Japan, Laos, Idaho, Utah, Wyoming, and Nevada.
In 1922, Karpinsky named a new species of Helicoprion, H. ivanovi, from Gzhelian (latest Carboniferous) strata near Moscow. However, this species has subsequently been removed from Helicoprion and placed as a second species of the related eugeneodont Campyloprion.
Historical reconstructions
Earliest reconstructions
Hypotheses for the placement and identity of Helicoprion's tooth whorls were controversial from the moment it was discovered. Woodward (1886), who referred the first known Helicoprion fossils to Edestus, discussed the various hypotheses concerning the nature of Edestus fossils.
Joseph Leidy, who originally described Edestus vorax, argued that they represented the jaws of "plagiostomous" (chondrichthyan) fish. William Davies agreed, specifically comparing it to the jaws of Janassa bituminosa, a Permian petalodont. On the other hand, J.S. Newberry suggested that the jaw-like fossils were defensive spines of a stringray-like fish. Woodward eventually settled on E.D. Cope's argument that they represented pectoral fin spines from fish similar to "Pelecopterus" (now known as Protosphyraena).
Karpinsky's 1899 monograph on Helicoprion noted that the bizarre nature of the tooth whorl made it difficult to reach precise conclusions on its function. He tentatively suggested that it curled up from the upper jaw for defensive or offensive purposes. This was justified by comparison to the upper tooth blades of Edestus, which by 1899 had been re-evaluated as structures belonging to the jaw.
Debates over the identity of Helicoprion's tooth whorl were abundant in the years following Karpinsky's monograph. In 1900, the publication was reviewed by Charles Eastman, who appreciated the paper as a whole but derided the sketch of the supposed life position of the whorl. Though Eastman admitted that the teeth of the whorl were very similar to those of other chondrichthyans, he still supported the idea that the whorl may have been a defensive structure embedded into the body of the animal, rather than the mouth. Shortly after his original monograph, Karpinsky published the argument that the whorl represented a curled, scute-covered tail akin to that of Hippocampus (seahorses). This proposal was immediately criticized by various researchers. E. Van den Broeck noted the fragility of the structure and argued that it was most well-protected as a paired feeding apparatus in the cheek of the animal. A.S. Woodward (unrelated to Henry Woodward) followed this suggestion with the hypothesis that each whorl represented a tooth battery from a gigantic shark. G. Simoens illustrated Karpinsky's various proposals and used histological data to adamantly argue that the whorls were toothed structures placed within the mouth. In 1911, Karpinsky illustrated the whorls as components of the dorsal fins. Reconstructions similar to those of Karpinsky (1899) were common in Russian publications as late as 2001.
Later reconstructions
By the mid-20th century, the tooth whorl was generally accepted as positioned in the lower jaw of the animal. Though this general position was suspected almost immediately in the aftermath of Karpinsky's monograph, it was not illustrated as such until the mid-1900s. Around that time, an artist known only as "F. John" depicted Helicoprion within a set of "Tiere der Urwelt" trading cards. Their reconstruction presented the tooth whorl as an external structure curling down from the lower jaw of the animal. Similar downward-curling reconstructions have also been created by modern paleontologists and artists such as John A. Long, Todd Marshall and Karen Carr. The utility of the tooth whorl in this type of reconstruction was inferred based on sawfish, which incapacitate prey via lateral blows of their denticle-covered snouts.
Information on the position of eugeneodont tooth whorls was bolstered by two major publications in 1966. The first was Rainer Zangerl's description of a new Carboniferous eugeneodont, Ornithoprion. This taxon had a highly specialized skull with a small tooth whorl in a symphysial position, i.e. at the midline of the base of the lower jaw. Although skull material had also been reported for Sarcoprion and Fadenia at the time, Ornithoprion was the first eugeneodont to have its skull described in detail.
The other publication was Bendix-Almgreen's monograph on Helicoprion. His investigations reinterpreted the tooth-whorl as a symphyseal structure wedged between the meckelian cartilages, which were separated by a gap at the front. A pair of cartilage loops, the symphyseal crista, seems to develop as a paired extension of the jaw symphysis where the meckelian cartilages meet at the back of the jaw. Each loop arches up before curling back inwards, tracing over the root of the tooth whorl. The largest and youngest teeth form at the symphysis near the back of the jaw. Over time they are carried along the symphyseal crista, spiraling forwards, then downwards and inwards. The series of teeth accumulate into a spiraling structure, which is housed within the cavity defined by the symphyseal crista. The lateral and lower edges of the tooth whorl would have been obscured by skin during life. According to Bendix-Almgreen, the most likely use of the tooth whorl was as a tool for tearing and cutting prey against the upper jaw.
In the 1994 book Planet Ocean: A Story of Life, the Sea, and Dancing to the Fossil Record, author Brad Matsen and artist Ray Troll describe and depict a reconstruction based on the information gleaned by Bendix-Almgreen (1966). They proposed that no teeth were present in the animal's upper jaw, besides crushing teeth for the whorl to cut against. The two envisioned the living animal to have a long and very narrow skull, creating a long nose akin to the modern-day goblin shark. A 1996 textbook by Philippe Janvier presented a similar reconstruction, albeit with sharp teeth at the front of the upper jaw and rows of low crushing teeth in the back of the jaw.
In 2008, Mary Parrish created a new reconstruction for the renovated Ocean Hall at the Smithsonian Museum of Natural History. Designed under the direction of Robert Purdy, Victor Springer, and Matt Carrano, Parrish's reconstruction places the whorl deeper within the throat. This hypothesis was justified by the argument that the teeth supposedly had no wear marks, and the assumption that the whorl would have created a drag-inducing bulge on the chin of the animal if located in a symphysial position. They envisioned the tooth whorl as a structure derived from throat denticles and designed to assist swallowing. This would hypothetically negate the disadvantages the tooth whorl would produce if positioned further forward in the jaw. This reconstruction was criticized for the overly intricate and potentially ineffective design of such a structure, if solely used to assist swallowing.
Lebedev (2009) found more support for a reconstruction similar to those of Bendix-Almgreen (1966) and Troll (1994). A tooth whorl found in Kazakhstan preserved radial scratch marks; the whorl was also found near several wide tuberculated teeth similar to those of the putative caseodontoid Campodus. Lebedev's reconstruction presented a cartilage-protected tooth whorl in a symphysial position at the front of the long lower jaw. When the mouth was closed, the tooth whorl would fit into a deep longitudinal pocket on the upper jaw. Both the pocket in the upper jaw and the edges of the lower jaw would have been lined with dense rows of Campodus-like teeth. This was similar to the situation reported in related helicoprionids such as Sarcoprion and Agassizodus. As for Helicoprion's ecology, it was compared to modern cetaceans such as Physeter (the sperm whale), Kogia (dwarf and pygmy sperm whales), Grampus (Risso's dolphin), and Ziphius (Cuvier's beaked whale). These fish- and squid-eating mammals have reduced dentition, often restricted to the tip of the lower jaw. Lebedev's reconstruction approximates modern views on Helicoprion's anatomy, though the hypothetical long jaw and Campodus-like lateral dentition has been superseded by CT data.
References
External links
Agassizodontidae
Prehistoric cartilaginous fish genera
Cisuralian first appearances
Permian cartilaginous fish
Permian extinctions
Prehistoric fish of Australia
Permian fish of Asia
Prehistoric fish of Europe
Prehistoric fish of North America
Fossil taxa described in 1899
Fossils of the United States
Paleozoic life of Alberta
Paleozoic life of British Columbia
Paleozoic life of Nunavut
Permian sharks
Prehistoric shark genera
Cisuralian life
Artinskian life
Kungurian life
Guadalupian life
Roadian life |
Kim Powers is an American writer. His memoir The History of Swimming: A Memoir was a finalist for the Lambda Literary Award for Gay Biography, and his television writing has brought him two Emmies, a Peabody Award, and three Edward R. Murrow Awards. In 2007, Out named him one of their "Out 100," a list of the "top 100 most influential gays or lesbians in the country."
Early life
Powers was born in Texas but currently lives in New York City and Asbury Park, New Jersey with his spouse, Jess Goldstein.
He received an undergraduate degree from Austin College and a Master of Fine Arts from Yale School of Drama.
Career
Powers worked at ABC News from 2008 to 2020, writing for Good Morning America and Primetime. He was also a staff writer for AMC's The Lot, producer for PBS's Great Performances, as well as executive developer for other film and television projects.
His coverage of 9/11 won him an Emmy and a Peabody Award, and while writing for 20/20, his team won three consecutive Edward R. Murrow Awards.
Selected works
The History of Swimming (2006)
The History of Swimming: A Memoir, published August 13, 2006 by Da Capo Press, is "an examination of the unique relationship shared by twins, and a coming-of-age story of a gay man in the era of AIDS."
Kirkus Reviews provided a starred review, calling the book "a powerful nod to familial bonding, written with verve and genuine affection."
The book received positive reviews from Booklist and The New York Times Book Review. Booklist called The History of Swimming "haunting."
Publishers Weekly provided a mixed review, saying the "uneven writing distracts from the story." However, they noted, "Powers's strength in relating his own personal struggles within the context of his twin's holds this unique memoir together."
Discussing the book, Powers was interviewed on 20/20 with Diane Sawyer, as well as with the Princeton Theological Seminary.
In 2007, the book was a finalist for the Lambda Literary Award for Gay Biography.
Dig Two Graves (2015)
Dig Two Graves was published December 4, 2015 by Gallery Books. The book received positive reviews from Booklist, School Library Journal, Publishers Weekly, and Kirkus Reviews.
Publications
The History of Swimming: A Memoir (2006)
Capote in Kansas: A Ghost Story (2007)
Dig Two Graves (2015)
Rules for Being Dead (2020)
Filmography
Actor
Finding North (1998)
Producer
20/20 (2018)
The Lot (1999)
Writer
The Year: 2020 (2020)
What Would You Do? (2020)
20/20 (2008, 2010, 2017)
The Year: 2019 (2019)
Countdown to the Oscars: 15 Movies That Changed American Cinema (2015)
25 Years of Sexy: People Magazine's Sexiest Man Alive! (2010)
The Barbara Walters Summer Special (2008-2009)
Fallen Idol (2005)
Primetime Live: Brad Pitt's Journey to Africa (2005)
My Big Wild You're-Not-Gonna-Believe This Wedding (2003)
The Lot (1999)
Finding North (1998)
References
Lambda Literary Award winners
David Geffen School of Drama at Yale University alumni
Austin College alumni
American LGBT screenwriters |
Ouro Sogui or Ourossogui lies in Matam Region in eastern Senegal on the N2 and N3 roads, just south west of Matam on the River Senegal. It is an important market town and transport hub.
In the census of 2002, Ourossogui had 13,177 inhabitants. In 2007, according to official estimates, it had grown to 15,614.
Populated places in Matam Region
Communes of Senegal |
Group C of the 2013 Africa Cup of Nations ran from 21 January until 29 January. It consisted of Zambia (holders), Nigeria, Burkina Faso and Ethiopia. The matches were held in the South African cities of Nelspruit and Rustenburg.
Standings
All times South African Standard Time (UTC+2)
Zambia vs. Ethiopia
Nigeria vs. Burkina Faso
Zambia vs. Nigeria
Burkina Faso vs. Ethiopia
Burkina Faso vs. Zambia
Ethiopia vs. Nigeria
References
External links
2013 Africa Cup of Nations |
```php
<?php
namespace Modules\Team\Http\Controllers;
use App\ApiConfig\ApiConfig;
use Illuminate\Http\Request;
use Illuminate\Support\Facades\Validator;
use Modules\Team\Http\Requests\ModalTeamRequest;
use Illuminate\Routing\Controller;
use Modules\Team\Http\Requests\CreatTeamRequest;
use Illuminate\Support\Facades\Session;
use Modules\User\helper;
use Exception;
class TeamController extends Controller
{
protected $helper;
public function __construct()
{
$this->helper = Helper::getInstance();
}
public function viewTeams()
{
$apiUrl = ApiConfig::get('/team/get-details');
try {
$response = $this->helper->postApiCallWithAuth('get', $apiUrl);
if ($response['code'] === 200) {
$responseData = $this->helper->responseHandler($response['data']);
return view('team::view_teams')->with(["accounts" => $responseData]);
} else {
return view('team::view_teams')->with(["ErrorMessage" => 'Can not complete the process, please reload page']);
}
} catch (Exception $e) {
$this->helper->logException($e->getLine(), $e->getCode(), $e->getMessage(), 'viewTeams() {TeamController}');
}
}
public function teamView($id)
{
$teamName = '';
$teamLogo = '';
try {
$apiUrl = ApiConfig::get('/team/get-team-details?teamId=' . $id);
$response = $this->helper->postApiCallWithAuth('get', $apiUrl);
if ($response['data']->code === 200) {
$teamName = $response['data']->data->teamSocialAccountDetails[0]->team_name;
$teamLogo = $response['data']->data->teamSocialAccountDetails[0]->team_logo;
$data = array('teamName' => $teamName, 'teamLogo' => $teamLogo);
$result['code'] = 200;
$result['message'] = 'Success';
$result['data'] = $data;
} else if ($response['data']->code === 400) {
$result['code'] = 400;
$result['message'] = 'failed';
} else {
$result['code'] = 500;
$result['message'] = 'failed';
}
return view('team::view_particular_team')->with(['team_id' => $id, 'data' => $result]);
} catch (\Exception $e) {
$this->helper->logException($e->getLine(), $e->getCode(), $e->getMessage(), 'teamView() {TeamController}');
return view('team::view_particular_team')->with('team_id', $id);
}
}
public function viewTeam()
{
return view('team::index');
}
public function createTeam(Request $request)
{
if ($request->isMethod('get')) {
return view('team::create_team');
} elseif ($request->isMethod('post')) {
$result = [];
if ($request->team_name == "") {
$result['code'] = 204;
$result['message'] = "Team name is required";
return $result;
}
try {
if (isset($request->profile_avatar)) {
$file = $request->profile_avatar;
$team = Session::get('team');
$pathToStorage = public_path('media/uploads');
if (!file_exists($pathToStorage))
mkdir($pathToStorage, 0777, true);
$publishimage = $file->getClientOriginalName();
$data['media'] = $pathToStorage . "/" . $publishimage;;
file_put_contents($data['media'], file_get_contents($file->path()));
$filedata = array("name" => "media",
"file" => $data['media']);
$apiUrl = env('API_URL_PUBLISH') . env('API_VERSION') . '/upload/media?title=' . $team['teamName'] . '&teamId=' . $team["teamid"] . '&privacy=3';
$response = $this->helper->postApiCallWithAuth('post', $apiUrl, $filedata, true);
$responseData = $this->helper->responseHandler($response['data']);
if ($responseData['code'] == 200) {
$str=substr(env('APP_URL'), 0, 30);
$mediaUrl = $str . "media/uploads/".$publishimage;;
$data['TeamInfo'] = array(
"name" => $request->team_name,
"description" => "Short note about the team activity",
"logoUrl" => $mediaUrl
);
} else {
$data['TeamInfo'] = array(
"name" => $request->team_name,
"description" => "Short note about the team activity",
"logoUrl" => null
);
}
} else {
$data['TeamInfo'] = array(
"name" => $request->team_name,
"description" => "Short note about the team activity",
"logoUrl" => 'path_to_url
);
}
} catch (\GuzzleHttp\Exception\RequestException $e) {
$this->helper->logException($e, 'createTeam() {TeamController}');
return redirect()->back()->with("ErrorMessage", 'Can not complete the process, please check default team is set or not');
}
$apiUrl = ApiConfig::get('/team/create');
try {
$response = $this->helper->postApiCallWithAuth('post', $apiUrl, $data);
$responseData = $this->helper->responseHandler($response['data']);
if ($responseData['code'] == 200) {
$team = array(
'team_name' => $responseData['data']->team_name,
'team_id' => $responseData['data']->team_id,
);
$user = Session::get('user');
$responseData['admin'] = $user['userDetails']['first_name']." ". $user['userDetails']['last_name'];
$responseData['admin_profile'] = $user['userDetails']['profile_picture'];
$responseData['admin_id'] = $user['userDetails']['user_id'];
$responseData['email'] = $user['userDetails']['email'];
return $responseData;
} else {
return $responseData;
}
} catch (\GuzzleHttp\Exception\RequestException $e) {
$this->helper->logException($e, 'createTeam() {TeamController}');
return redirect()->back()->with("ErrorMessage", 'Can not complete the process, please reload page');
}
}
}
public function getParticularTeamDetails(Request $request)
{
try {
$adminIds = [];
$adminData = [];
$socialAccounts = [];
$teamMembersAcceptedIDs = [];
$teamMembersPendingIds = [];
$leftFromTeamIds = [];
$teamMembersAcceptedDatas = [];
$teamMembersPendingDatas = [];
$leftFromTeamDatas = [];
$availableSocialAccounts = [];
$availableSocialAccountsDatas = [];
$teamDetails = [];
$teamId = $request->teamid;
$apiUrl = ApiConfig::get('/team/get-team-details?teamId=' . $teamId);
$response = $this->helper->postApiCallWithAuth('get', $apiUrl);
if ($response['data']->code === 200) {
$socialAccounts = $response['data']->data->teamSocialAccountDetails[0]->SocialAccount;
$availableSocialAccounts = $this->getAvailableSocialAccounts();
if ($availableSocialAccounts['code'] === 200) {
$availableSocialAccounts = $availableSocialAccounts['data'];
if (count($socialAccounts) > 0) {
for ($i = 0; $i < count($availableSocialAccounts); $i++) {
$count = 0;
for ($j = 0; $j < count($socialAccounts); $j++) {
if ($availableSocialAccounts[$i]->account_id !== $socialAccounts[$j]->account_id) {
$count++;
if ($count === count($socialAccounts)) {
array_push($availableSocialAccountsDatas, $availableSocialAccounts[$i]);
}
}
}
}
} else {
$availableSocialAccountsDatas = $availableSocialAccounts;
}
} else {
$availableSocialAccountsDatas = [];
}
foreach ($response['data']->data->teamMembers as $data) {
if ($data->permission === 2 && $data->left_from_team === 0 && $data->invitation_accepted === 1 ) {
array_push($adminIds, $data->user_id);
}
if ($data->invitation_accepted === 1 && $data->left_from_team === 0) {
array_push($teamMembersAcceptedIDs, (object)array('teamMembersAcceptedIDs' => $data->user_id, 'permissions' => $data->permission));
}
if ($data->invitation_accepted === 0 ) {
array_push($teamMembersPendingIds, (object)array('teamMembersPendingIds' => $data->user_id, 'permissions' => $data->permission));
}
if ($data->left_from_team === 1) {
array_push($leftFromTeamIds, $data->user_id);
}
}
foreach ($response['data']->data->memberProfileDetails as $data2) {
for ($i = 0; $i < count($adminIds); $i++) {
if ($adminIds[$i] === $data2->user_id) {
array_push($adminData, $data2);
}
}
for ($i = 0; $i < count($leftFromTeamIds); $i++) {
if ($leftFromTeamIds[$i] === $data2->user_id) {
array_push($leftFromTeamDatas, $data2);
}
}
for ($i = 0; $i < count($teamMembersAcceptedIDs); $i++) {
if ($teamMembersAcceptedIDs[$i]->teamMembersAcceptedIDs === $data2->user_id) {
if ($teamMembersAcceptedIDs[$i]->permissions === 1) {
array_push($teamMembersAcceptedDatas, array('label' => 'Full permissions', 'user' => $data2));
} else {
array_push($teamMembersAcceptedDatas, array('label' => 'Admin', 'user' => $data2));
}
}
}
for ($i = 0; $i < count($teamMembersPendingIds); $i++) {
if ($teamMembersPendingIds[$i]->teamMembersPendingIds === $data2->user_id) {
array_push($teamMembersPendingDatas, $data2);
}
}
}
$teamDetails['code'] = 200;
$teamDetails['teamMembersAcceptedDatas'] = $teamMembersAcceptedDatas;
$teamDetails['teamMembersPendingDatas'] = $teamMembersPendingDatas;
$teamDetails['adminData'] = $adminData;
$teamDetails['teamSocialAccounts'] = $socialAccounts;
$teamDetails['availableSocialAccounts'] = $availableSocialAccountsDatas;
$teamDetails['leftFromTeamDatas'] = $leftFromTeamDatas;
return $teamDetails;
} else if ($response['data']->code === 400) {
$result['code'] = 400;
$result['message'] = $response['data']->error;
return $result;
} else {
$result['code'] = 500;
$result['message'] = 'Some error occurred while fetching data Please reload it...';
return $result;
}
} catch (\Exception $e) {
return $this->helper->errorHandler($e->getLine(), $e->getCode(), $e->getMessage(), 'getParticularTeamDetails(){TeamController}');
}
}
public function getAvailableSocialAccounts()
{
try {
$apiUrl = ApiConfig::get('/team/get-available-social-accounts');
$response = $this->helper->postApiCallWithAuth('get', $apiUrl);
$socialAccounts = [];
if ($response['data']->code === 200) {
$socialAccounts = $response['data']->data;
$result['code'] = 200;
$result['data'] = $socialAccounts;
return $result;
}
} catch (\Exception $e) {
return $this->helper->errorHandler($e->getLine(), $e->getCode(), $e->getMessage(), 'getAvailableSocialAccounts(){TeamController}');
}
}
public function dragDopTeamOperation(Request $request)
{
$sourcevalue = $request->sourceValue;
$targetValue = $request->targetValue;
$accid = (int)$request->id;
$teamid = (int)$request->teamid;
$currentUserid = session::get('user')['userDetails']['user_id'];
$usertype = 'Member';
try {
$apiUrl = ApiConfig::get('/team/get-team-details?teamId=' . $teamid);
$response = $this->helper->postApiCallWithAuth('get', $apiUrl);
if ($response['data']->code === 200) {
foreach ($response['data']->data->teamMembers as $data) {
if ($data->permission === 2) {
if ($data->user_id === $currentUserid) {
$usertype = 'Admin';
break;
}
}
}
}
} catch (\Exception $e) {
return $this->helper->errorHandler($e->getLine(), $e->getCode(), $e->getMessage(), 'dragDopTeamOperation(){TeamController}');
}
if ($sourcevalue === '_allSocialAccounts' && $targetValue === '_teamSocialAccounts') {
$apiUrl = ApiConfig::get('/team/add-other-team-account?accountId=' . $accid . '&teamId=' . $teamid);
$response = $this->helper->postApiCallWithAuth('post', $apiUrl);
return $this->helper->responseHandler($response['data']);
} else if ($sourcevalue === '_teamSocialAccounts' && $targetValue === '_allSocialAccounts') {
$apiUrl = ApiConfig::get('/team/delete-team-social-profile?accountId=' . $accid . '&teamId=' . $teamid);
$response = $this->helper->postApiCallWithAuth('delete', $apiUrl);
if ($response['data']->code === 200) {
$result['code'] = 200;
$result['message'] = 'Account Removed from Team';
} else if ($response['data']->code === 400) {
$result['code'] = 400;
$result['message'] = $response['data']->error;
} else {
$result['code'] = 500;
$result['message'] = 'some error occured';
}
return $result;
} else if ($sourcevalue === '_teamSocialAccounts' && $targetValue === '_teamMembers') {
$result['code'] = 501;
$result['message'] = 'We can not Move Social Accounts to Team members';
return $result;
} else if ($sourcevalue === '_allSocialAccounts' && $targetValue === '_teamMembers') {
$result['code'] = 501;
$result['message'] = 'We can not Move Social Accounts to Team members';
return $result;
} else if ($sourcevalue === '_allSocialAccounts' && $targetValue === '_pendingTeamMembers') {
$result['code'] = 501;
$result['message'] = 'We can not Move Social Accounts to Pending Team members';
return $result;
} else if ($sourcevalue === '_teamSocialAccounts' && $targetValue === '_pendingTeamMembers') {
$result['code'] = 501;
$result['message'] = 'We can not Move Social Accounts to Pending Team members';
return $result;
} else if ($sourcevalue === '_teamSocialAccounts' && $targetValue === '_leftTeamMembers') {
$result['code'] = 501;
$result['message'] = 'We can not Move Social Accounts to Left Team members';
return $result;
} else if ($sourcevalue === '_admin') {
if (($targetValue === '_allSocialAccounts' || $targetValue === '_teamSocialAccounts')) {
$result['code'] = 501;
$result['message'] = 'We can not move the Admin to Accounts';
return $result;
} else {
if ($targetValue === '_teamMembers') {
if ($accid === $currentUserid) {
$result['code'] = 501;
$result['message'] = 'We can not Move Main admin';
return $result;
} else {
try {
$apiUrl = ApiConfig::get('/team/edit-member-permission?teamId=' . $teamid . '&memberId=' . $accid . '&Permission=1');
$response = $this->helper->postApiCallWithAuth('post', $apiUrl);
if ($response['data']->code === 200) {
$result['code'] = 200;
$result['message'] = 'Added to Team members';
} else if ($response['data']->code === 400) {
$result['code'] = 400;
$result['message'] = $response['data']->error;
} else {
$result['code'] = 500;
$result['message'] = 'some error occured';
}
return $result;
} catch (\Exception $e) {
return $this->helper->errorHandler($e->getLine(), $e->getCode(), $e->getMessage(), 'dragDopTeamOperation(){TeamController}');
}
}
} else if ($targetValue === '_pendingTeamMembers') {
$result['code'] = 501;
$result['message'] = 'We can not perform operations from Pending Team members';
return $result;
} else {
if ($accid === $currentUserid) {
$result['code'] = 501;
$result['message'] = 'We can not Move Main admin';
return $result;
} else {
try {
$apiUrl = ApiConfig::get('/team/removeTeamMember?teamId=' . $teamid . '&memberId=' . $accid);
$response = $this->helper->postApiCallWithAuth('delete', $apiUrl);
if ($response->code === 200) {
$result['code'] = 200;
$result['message'] = 'You have left from Team';
} else if ($response->code === 400) {
$result['code'] = 400;
$result['message'] = $response->message;
} else {
$result['code'] = 500;
$result['message'] = 'some error occured';
}
return $result;
} catch (\Exception $e) {
return $this->helper->errorHandler($e->getLine(), $e->getCode(), $e->getMessage(), 'dragDopTeamOperation(){TeamController}');
}
}
}
}
} else if ($sourcevalue === '_leftTeamMembers') {
$result['code'] = 501;
$result['message'] = 'We can not move the Left/removed Members';
return $result;
} else if ($sourcevalue === '_teamMembers') {
if (($targetValue === '_allSocialAccounts' || $targetValue === '_teamSocialAccounts')) {
$result['code'] = 501;
$result['message'] = 'We can not add Team members to Social accounts';
return $result;
} else if ($targetValue === '_admin') {
try {
$apiUrl = ApiConfig::get('/team/edit-member-permission?teamId=' . $teamid . '&memberId=' . $accid . '&Permission=2');
$response = $this->helper->postApiCallWithAuth('post', $apiUrl);
if ($response['data']->code === 200) {
$result['code'] = 200;
$result['message'] = 'Added to Admin';
} else if ($response['data']->code === 400) {
$result['code'] = 400;
$result['message'] = $response['data']->error;
} else {
$result['code'] = 500;
$result['message'] = 'some error occured';
}
return $result;
} catch (\Exception $e) {
return $this->helper->errorHandler($e->getLine(), $e->getCode(), $e->getMessage(), 'dragDopTeamOperation(){TeamController}');
}
} else if ($targetValue === '_pendingTeamMembers') {
$result['code'] = 501;
$result['message'] = 'We can not add Team members to Pending Members';
return $result;
} else {
if ($accid === $currentUserid) {
$result['code'] = 501;
$result['message'] = 'We can not remove Main admin';
return $result;
} else {
try {
$apiUrl = ApiConfig::get('/team/remove-teamMember?teamId=' . $teamid . '&memberId=' . $accid);
$response = $this->helper->postApiCallWithAuth('delete', $apiUrl);
if ($response['data']->code === 200) {
$result['code'] = 200;
$result['message'] = 'You have left from Team';
} else if ($response['data']->code === 400) {
$result['code'] = 400;
$result['message'] = $response['data']->error;
} else {
$result['code'] = 500;
$result['message'] = 'some error occured';
}
return $result;
} catch (\Exception $e) {
return $this->helper->errorHandler($e->getLine(), $e->getCode(), $e->getMessage(), 'dragDopTeamOperation(){TeamController}');
}
}
}
} else if ($sourcevalue === '_pendingTeamMembers') {
$result['code'] = 501;
$result['message'] = 'We can not perform oprations from Pending Team members';
return $result;
} else if ($sourcevalue === '_teamSocialAccounts' || $sourcevalue === '_allSocialAccounts') {
if ($targetValue === '_admin') {
$result['code'] = 501;
$result['message'] = 'We can not add Social Accounts to the Admin';
return $result;
}
} else {
if (($targetValue === '_allSocialAccounts' || $targetValue === '_teamSocialAccounts')) {
$result['code'] = 501;
$result['message'] = 'We can not add Team Members to Social accounts';
return $result;
} else if ($targetValue === '_leftTeamMembers') {
if ($accid === $currentUserid) {
$result['code'] = 501;
$result['message'] = 'We can not Move Main admin';
return $result;
} else {
try {
$apiUrl = ApiConfig::get('/team/remove-teamMember?teamId=' . $teamid . '&memberId=' . $accid);
$response = $this->helper->postApiCallWithAuth('delete', $apiUrl);
if ($response['data']->code === 200) {
$result['code'] = 200;
$result['message'] = 'You have left from Team';
} else if ($response['data']->code === 400) {
$result['code'] = 400;
$result['message'] = $response->error;
} else {
$result['code'] = 500;
$result['message'] = 'some error occured';
}
return $result;
} catch (\Exception $e) {
return $this->helper->errorHandler($e->getLine(), $e->getCode(), $e->getMessage(), 'dragDopTeamOperation(){TeamController}');
}
}
}
}
}
// public function teamModal(ModalTeamRequest $request)
// {
// $html = null;
// if ($request['modal'] === 'create')
// {
// $html = view('team::createModal')->render();
// }
// if ($request['modal'] === 'invite')
// {
// $html = view('team::inviteModal')->render();
// }
// return response()->json([
// 'html' => $html,
// 'status' => true,
// 'modal' => $request['modal']
// ]);
// }
public function getAvailableMembers()
{
// $apiUrl = $this->API_URL . env('API_VERSION') . '/team/getAvailableTeamMembers';
$apiUrl = ApiConfig::get('/team/get-available-team-members');
try {
$response = $this->helper->postApiCallWithAuth('get', $apiUrl);
return $this->helper->responseHandler($response['data']);
} catch (\GuzzleHttp\Exception\RequestException $e) {
$this->helper->errorHandler($e, 'getAvailableMembers(){TeamController}');
return redirect()->back()->with("ErrorMessage", 'Can not complete the process, please reload page');
}
}
public function getInvitedMembers()
{
$apiUrl = ApiConfig::get('/team/get-available-invited-members');
try {
$response = $this->helper->postApiCallWithAuth('get', $apiUrl);
return $this->helper->responseHandler($response['data']);
} catch (\GuzzleHttp\Exception\RequestException $e) {
$this->helper->errorHandler($e, 'getInvitedMembers(){TeamController}');
return redirect()->back()->with("ErrorMessage", 'Can not complete the process, please reload page');
}
}
public function deleteTeams($id)
{
$team = Session::get('team');
if ($team['teamid'] == $id) {
$response['code'] = '500';
$response['error'] = ' Current Team you cannot delete, switch to other Team to delete this Team';
return $response;
} else {
$apiUrl = ApiConfig::get('/team/delete?teamId=');
$apiUrl = $apiUrl . $id;
try {
$response = $this->helper->postApiCallWithAuth('delete', $apiUrl);
return $this->helper->responseHandler($response['data']);
} catch (\GuzzleHttp\Exception\RequestException $e) {
$this->helper->logException($e, 'deleteTeams() {TeamController}');
return redirect()->back()->with("ErrorMessage", 'Can not complete the process, please reload page');
}
}
}
public function updateTeams(Request $request)
{
$apiUrlupdate = ApiConfig::get('/team/edit?teamId=');
$apiUrlupdate = $apiUrlupdate . $request->id;
$logo = '';
$team = Session::get('team');
if (isset($request->profile_avatar)) {
$file = $request->profile_avatar;
$pathToStorage = public_path('media/uploads');
if (!file_exists($pathToStorage))
mkdir($pathToStorage, 0777, true);
$publishimage = $file->getClientOriginalName();
$data['media'] = $pathToStorage . "/" . $publishimage;;
file_put_contents($data['media'], file_get_contents($file->path()));
$filedata = array("name" => "media",
"file" => $data['media']);
$apiUrl = env('API_URL_PUBLISH') . env('API_VERSION') . '/upload/media?title=' . $team['teamName'] . '&teamId=' . $team["teamid"] . '&privacy=3';
$response = $this->helper->postApiCallWithAuth('post', $apiUrl, $filedata, true);
$responseData = $this->helper->responseHandler($response['data']);
if ($responseData['code'] == 200) {
$mediaUrl = 'path_to_url . $responseData['data'][0]->media_url;
$details['TeamInfo'] = array(
"name" => $request->team_name,
"logoUrl" => $mediaUrl
);
$logo = $mediaUrl;
} else {
$details['TeamInfo'] = array(
"name" => $request->team_name,
"logoUrl" => null
);
}
} else {
$details['TeamInfo'] = array(
"name" => $request->team_name,
"logoUrl" => $request->old_pic
);
$logo = $request->old_pic;
}
try {
$response = $this->helper->postApiCallWithAuth('post', $apiUrlupdate, $details);
$respons = $this->helper->responseHandler($response['data']);
if ($respons['code'] === 200) {
if ($team['teamid'] === (int)$request->id) {
$team['teamLogo'] = $logo;
session()->put('team', $team);
}
}
return $respons;
} catch (\GuzzleHttp\Exception\RequestException $e) {
$this->helper->logException($e, 'updateTeams() {TeamController}');
return redirect()->back()->with("ErrorMessage", 'Can not complete the process, please reload page');
}
}
public function holdTeams($id)
{
$apiUrl = ApiConfig::get('/team/lock-team');
try {
$parameters = [$id];
$response = $this->helper->postApiCallWithAuth('put', $apiUrl, $parameters);
return $this->helper->responseHandler($response['data']);
} catch (\GuzzleHttp\Exception\RequestException $e) {
$this->helper->logException($e, 'holdTeams() {TeamController}');
return redirect()->back()->with("ErrorMessage", 'Can not complete the process, please reload page');
}
}
public function unholdTeams($id)
{
$apiUrl = ApiConfig::get('/team/unlock-team');
try {
$parameters = [$id];
$response = $this->helper->postApiCallWithAuth('put', $apiUrl, $parameters);
return $this->helper->responseHandler($response['data']);
} catch (\GuzzleHttp\Exception\RequestException $e) {
$this->helper->logException($e, 'unholdTeams() {TeamController}');
return redirect()->back()->with("ErrorMessage", 'Can not complete the process, please reload page');
}
}
public function dragToInviteMembers(Request $request)
{
if (str_contains($request['targetValue'], '_team')) {
$id = trim($request['targetValue'], '_team');
$apiUrl = ApiConfig::get('/team/invite?teamId=');
$apiUrl = $apiUrl . $id . '&Permission=1&Email=' . $request['email'];
try {
$response = $this->helper->postApiCallWithAuth('post', $apiUrl);
return $this->helper->responseHandler($response['data']);
} catch (\GuzzleHttp\Exception\RequestException $e) {
$this->helper->logException($e, 'dragToInviteMembers() {TeamController}');
return redirect()->back()->with("ErrorMessage", 'Can not complete the process, please reload page');
}
} else {
$result = array("code" => "500", "message" => "You can't make non-members as Admins");
return $result;
}
}
public function inviteMembers(Request $request)
{
if ($request['member_email'] == "") {
$result['code'] = 204;
$result['message'] = "Email is required";
return $result;
}
$name = $request->member_name !== null ? $request->member_name : "";
$apiUrl = ApiConfig::get('/team/invite?teamId=');
$apiUrl = $apiUrl . $request['team_id'] . '&Permission=' . $request['permission'] . '&Email=' . $request['member_email'].'&name='.$name;
try {
$response = $this->helper->postApiCallWithAuth('post', $apiUrl);
return $this->helper->responseHandler($response['data']);
} catch (\GuzzleHttp\Exception\RequestException $e) {
$this->helper->logException($e, 'inviteMembers() {TeamController}');
return redirect()->back()->with("ErrorMessage", 'Can not complete the process, please reload page');
}
}
public function changeTeamSession(Request $request)
{
try {
$teamID = (int)$request->teamid;
$apiUrl = ApiConfig::get('/team/get-team-details?teamId=' . $teamID);
$response = $this->helper->postApiCallWithAuth('get', $apiUrl);
if ($response['data']->code === 200) {
$teamid = $response['data']->data->teamSocialAccountDetails[0]->team_id;
$teamname = $response['data']->data->teamSocialAccountDetails[0]->team_name;
$teamlogo = $response['data']->data->teamSocialAccountDetails[0]->team_logo;
$teamDetails['teamid'] = $teamid;
$teamDetails['teamName'] = $teamname;
$teamDetails['teamLogo'] = $teamlogo;
session()->put('team', $teamDetails);
Session::save();
$result['code'] = 200;
$result['message'] = 'Successfully Switched Team';
} else if ($response->code === 400) {
$result['code'] = 400;
$result['message'] = $response->message;
} else {
$result['code'] = 500;
$result['message'] = 'Some error occured';
}
return $result;
} catch (\Exception $e) {
return $this->helper->errorHandler($e->getLine(), $e->getCode(), $e->getMessage(), 'changeTeamSession(){TeamController}');
}
}
public function searchTeam(Request $request)
{
$validator = Validator::make($request->all(), [
'team_name' => 'required',
]);
if ($validator->fails()) {
return redirect()->back()
->withErrors($validator)
->withInput();
}
$apiUrl = ApiConfig::get('/team/search-team?teamName=' . $request->team_name);
try {
$response = $this->helper->postApiCallWithAuth('post', $apiUrl);
if ($response['code'] === 200) {
$responseData = $this->helper->responseHandler($response['data']);
return view('team::view_teams')->with(["accounts" => $responseData]);
} else {
return view('team::view_teams')->with(["ErrorMessage" => 'Can not complete the process, please reload page']);
}
} catch (Exception $e) {
$this->helper->logException($e->getLine(), $e->getCode(), $e->getMessage(), 'viewTeams() {TeamController}');
}
}
function withDrawInvitation(Request $request)
{
try {
$teamid=(integer)$request->teamId;
$email=$request->email;
$apiUrl = ApiConfig::get('/team/withdraw-invitation?teamId=' . $teamid.'&Email='.$email);
$response = $this->helper->postApiCallWithAuth('delete', $apiUrl);
if ($response['data']->code === 200) {
$result['code'] = 200;
$result['message'] = 'Invitation Withdrawn';
} else if ($response['data']->code === 400) {
$result['code'] = 400;
$result['message'] = $response->error;
} else {
$result['code'] = 500;
$result['message'] = 'some error occured';
}
return $result;
}
catch (Exception $e) {
$this->helper->logException($e->getLine(), $e->getCode(), $e->getMessage(), 'withDrawInvitation() {TeamController}');
}
}
}
``` |
```c++
/**
* (C) 1999-2003 Lars Knoll (knoll@kde.org)
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
*
* along with this library; see the file COPYING.LIB. If not, write to
* the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*/
#include "config.h"
#include "core/css/StyleSheetList.h"
#include "core/HTMLNames.h"
#include "core/dom/Document.h"
#include "core/dom/StyleEngine.h"
#include "core/frame/UseCounter.h"
#include "core/html/HTMLStyleElement.h"
#include "wtf/text/WTFString.h"
namespace blink {
using namespace HTMLNames;
StyleSheetList::StyleSheetList(TreeScope* treeScope)
: m_treeScope(treeScope)
{
}
DEFINE_EMPTY_DESTRUCTOR_WILL_BE_REMOVED(StyleSheetList);
inline const WillBeHeapVector<RefPtrWillBeMember<StyleSheet>>& StyleSheetList::styleSheets()
{
#if !ENABLE(OILPAN)
if (!m_treeScope)
return m_detachedStyleSheets;
#endif
return document()->styleEngine().styleSheetsForStyleSheetList(*m_treeScope);
}
#if !ENABLE(OILPAN)
void StyleSheetList::detachFromDocument()
{
m_detachedStyleSheets = document()->styleEngine().styleSheetsForStyleSheetList(*m_treeScope);
m_treeScope = nullptr;
}
#endif
unsigned StyleSheetList::length()
{
return styleSheets().size();
}
StyleSheet* StyleSheetList::item(unsigned index)
{
const WillBeHeapVector<RefPtrWillBeMember<StyleSheet>>& sheets = styleSheets();
return index < sheets.size() ? sheets[index].get() : 0;
}
HTMLStyleElement* StyleSheetList::getNamedItem(const AtomicString& name) const
{
#if !ENABLE(OILPAN)
if (!m_treeScope)
return 0;
#endif
// IE also supports retrieving a stylesheet by name, using the name/id of the <style> tag
// (this is consistent with all the other collections)
// ### Bad implementation because returns a single element (are IDs always unique?)
// and doesn't look for name attribute.
// But unicity of stylesheet ids is good practice anyway ;)
// FIXME: We should figure out if we should change this or fix the spec.
Element* element = m_treeScope->getElementById(name);
return isHTMLStyleElement(element) ? toHTMLStyleElement(element) : 0;
}
CSSStyleSheet* StyleSheetList::anonymousNamedGetter(const AtomicString& name)
{
if (document())
UseCounter::count(*document(), UseCounter::StyleSheetListAnonymousNamedGetter);
HTMLStyleElement* item = getNamedItem(name);
if (!item)
return 0;
return item->sheet();
}
DEFINE_TRACE(StyleSheetList)
{
visitor->trace(m_treeScope);
}
} // namespace blink
``` |
Via or VIA may refer to the following:
Arts and entertainment
Via (Volumes album), 2011
Via (Thalia Zedek album), 2013
VIA (music), Soviet and Russian term for a music collective
Businesses and organisations
Via Foundation, a Czech charitable foundation
VIA Programs (Volunteers In Asia), an American non-profit organization
VIA Technologies, a Taiwanese manufacturer of electronics
VIA University College, a Danish university college
VIA Vancouver Institute for the Americas, a Canadian education organization
Volunteers in Africa Foundation, an American non-profit organization
VIA, stock ticker for:
Viacom (1952–2006)
Viacom (2005–2019)
Vià, a French television network
Transportation
VIA Metropolitan Transit, in San Antonio, Texas, U.S.
Via Rail, rail operator in Canada
Via Transportation, a global transportation technology company
Air VIA, a former Bulgarian airline
VIA Airways, a Bulgarian airline, now Fly2Sky Airlines
Via Airlines, a former American airline
Viasa, a former Venezuelan airline, ICAO airline VIA
Science and technology
Via (electronics), an electrical connection between conductor layers in a printed circuit board or a microchip
Via (moth), a genus of moths in the family Noctuidae
Virtual Interface Adapter, a network protocol
Virtual Interface Architecture, a networking standard used in high-performance computing
Other uses
Via (geomancy), a geomantic figure
Via (surname), including a list of people with the name
Values in Action Inventory, a proprietary psychological assessment measure
VIA, a brand of instant coffee by Starbucks
Rokospol Via, a Czech aircraft design
See also
Vias (disambiguation)
Roman road (viae Romana)
Viaduct, a kind of bridge |
Rajni Kothari (16 August 1928 – 19 January 2015) was an Indian political scientist, political theorist, academic and writer. He was the founder of Centre for the Study of Developing Societies (CSDS) in 1963, a social sciences and humanities research institute, based in Delhi and Lokayan (Dialogue of the People), started in 1980 as a forum for interaction between activists and intellectuals. He was also associated with Indian Council of Social Science Research, International Foundation for Development Alternatives, and People's Union for Civil Liberties.
One of the great political thinkers of the 20th-century, amongst his noted works include Politics in India (1970), Caste in Indian Politics (1973), and Rethinking Democracy (2005). In 1985, Lokayan was awarded the Right Livelihood Award for "linking and strengthening local groups working to protect civil liberties, women's rights and the environment."
Early life and background
Kothari was the only son of his father, a Jain trader. His mother died early in life.
Career
Kothari started his career as a lecturer at Baroda University (now Maharaja Sayajirao University of Baroda). While working here he first received recognition in 1961, when his essays series, "Form and Substance in Indian Politics" were published in the Economic and Political Weekly (then Economic Weekly) over six issues. He had also started writing for Seminar, the journal published by Romesh Thapar. Thereafter he was invited by Professor Shyama Charan Dube to become the Assistant Director of the National Institute of Community Development, Mussoorie.
In 1963, he moved to Delhi, where using a personal grant of Rs. 70,000 given by Professor Richard L. Park, head of Asia Foundation’s India chapter, he started the Centre for the Study of Developing Societies (CSDS), in the premises of the Indian Adult Education Association at Indraprastha Estate, Delhi, before moving to its present location in Civil Lines, Delhi. Here working along with Ashis Nandy, D.L. Sheth, Ramashray Roy, Bashiruddin Ahmed and others, pioneering works in social sciences were published over next two decades. In 1970 he published Politics in India, which first theorized Indian National Congress as a system rather than a party. Thereafter he published noted works like Caste in Indian Politics (1973) and Footsteps into the Future (1975).
During the early 1970s, he was associated with Congress-leader Indira Gandhi, and negotiated with the Congress-led central government for Navnirman movement, a socio-political movement of 1974 against corruption in Gujarat, which ultimately led to the dissolution of the state government. However, with the entry of Sanjay Gandhi, he distanced himself from Congress, and came close to Jaya Prakash Narayan and the Janata Party instead. After the Emergency of 1975, he moved away from political parties, and started his career as an activist. This phase culminated with the foundation of Lokayan - Dialogue of the People in 1980, a forum for interaction between activists, thinkers and intellectuals to talked about positive changes in the fields of religion, agriculture, health, politics, and education.
He soon became associated with Citizens for Democracy, and People's Union for Civil Liberties, a human rights body established in 1976, where he remained General Secretary from 1982 to 1984, and subsequently its President. He served as the chairman of Indian Council of Social Science Research and remained a member of the Planning Commission.
Besides scholarly articles he also wrote newspaper columns, and in 2002 published his memoirs titled, Memoirs: Uneasy is the Life of the Mind. In his final book, Rethinking Democracy (2005), Kothari explored the possible meanings of democracy. An excerpt from the book was later included in the first volume of India Since the 90s series, The Hunger of the Republic: Our Present in Retrospect, edited by Ashish Rajadhyaksha.
CSDS where he was an honorary fellow, in 2004 established The Rajni Kothari Chair in Democracy in his honour, funded by Ford Foundation and the Sir Ratan Tata Trust. On 27 November 2012, CSDS celebrated its 50th anniversary, presided over by Kothari.
Personal life
He married in 1947, and his wife Hansa died in 1999.
In his final years, his eldest son Smitu died in 2009. Smitu, trained in physics, communications and sociology, was involved in ecological, cultural and human rights issues. He had been a visiting professor at Cornell and Princeton Universities.Rajni Kothari had two other sons, Miloon and Ashish, and two grandchildren, Emma and Gyan.
Death
He died on 19 January 2015 at his residence at Patparganj in East Delhi following urinary tract infection and other age related ailments.
Works
References
External links
Centre for the Study of Developing Societies, Official Website
Lokayan - Dialogue of the people, website
1928 births
2015 deaths
Indian political scientists
Indian founders
Academic staff of Maharaja Sayajirao University of Baroda
Indian political philosophers
Members of the Planning Commission of India
20th-century Indian educators
Indian political writers
Indian male writers |
Przejazd is a settlement in the administrative district of Gmina Iława, within Iława County, Warmian-Masurian Voivodeship, in northern Poland.
References
Przejazd |
```python
# mypy: allow-untyped-defs
from typing import Any, Callable, cast, Tuple
import torch
import torch.distributed as dist
__all__ = [
"allreduce_hook",
"fp16_compress_hook",
"bf16_compress_hook",
"fp16_compress_wrapper",
"bf16_compress_wrapper",
]
def _allreduce_fut(
process_group: dist.ProcessGroup, tensor: torch.Tensor
) -> torch.futures.Future[torch.Tensor]:
"""Average the input gradient tensor by allreduce and returns a future."""
group_to_use = process_group if process_group is not None else dist.group.WORLD
# Apply the division first to avoid overflow, especially for FP16.
tensor.div_(group_to_use.size())
return (
dist.all_reduce(tensor, group=group_to_use, async_op=True)
.get_future()
.then(lambda fut: fut.value()[0])
)
def allreduce_hook(
process_group: dist.ProcessGroup, bucket: dist.GradBucket
) -> torch.futures.Future[torch.Tensor]:
"""
Call ``allreduce`` using ``GradBucket`` tensors.
Once gradient tensors are aggregated across all workers, its ``then``
callback takes the mean and returns the result.
If user registers this DDP communication hook,
DDP results is expected to be same as the case where no hook was registered.
Hence, this won't change behavior of DDP and user can use this as a reference
or modify this hook to log useful information or any other purposes while
unaffecting DDP behavior.
Example::
>>> # xdoctest: +SKIP
>>> ddp_model.register_comm_hook(process_group, allreduce_hook)
"""
return _allreduce_fut(process_group, bucket.buffer())
def fp16_compress_hook(
process_group: dist.ProcessGroup,
bucket: dist.GradBucket,
) -> torch.futures.Future[torch.Tensor]:
"""
Compress by casting ``GradBucket`` to ``torch.float16`` divided by process group size.
This DDP communication hook implements a simple gradient compression
approach that casts ``GradBucket`` tensor to half-precision floating-point format (``torch.float16``)
and then divides it by the process group size.
It allreduces those ``float16`` gradient tensors. Once compressed gradient
tensors are allreduced, the chained callback ``decompress`` casts it back to the input data type (such as ``float32``).
Example::
>>> # xdoctest: +SKIP
>>> ddp_model.register_comm_hook(process_group, fp16_compress_hook)
"""
group_to_use = process_group if process_group is not None else dist.group.WORLD
world_size = group_to_use.size()
buffer = (
cast(Tuple[torch.Tensor, ...], bucket)[0]
if isinstance(bucket, tuple)
else bucket.buffer()
)
compressed_tensor = buffer.to(torch.float16).div_(world_size)
def decompress(fut):
decompressed_tensor = buffer
# Decompress in place to reduce the peak memory.
# See: path_to_url
value = fut if isinstance(fut, torch.Tensor) else fut.value()[0]
decompressed_tensor.copy_(value)
return decompressed_tensor
if torch._utils.is_compiling():
grad = dist._functional_collectives.all_reduce(
compressed_tensor, "sum", group_to_use
)
return decompress(grad)
else:
fut = dist.all_reduce(
compressed_tensor, group=group_to_use, async_op=True
).get_future()
return fut.then(decompress)
# TODO: create an internal helper function and extract the duplicate code in FP16_compress and BF16_compress.
def bf16_compress_hook(
process_group: dist.ProcessGroup,
bucket: dist.GradBucket,
) -> torch.futures.Future[torch.Tensor]:
"""
Warning: This API is experimental, and it requires NCCL version later than 2.9.6.
This DDP communication hook implements a simple gradient compression
approach that casts ``GradBucket`` tensor to half-precision
`Brain floating point format <path_to_url`_ (``torch.bfloat16``)
and then divides it by the process group size.
It allreduces those ``bfloat16`` gradient tensors. Once compressed gradient
tensors are allreduced, the chained callback ``decompress`` casts it back to the input data type (such as ``float32``).
Example::
>>> # xdoctest: +SKIP
>>> ddp_model.register_comm_hook(process_group, bf16_compress_hook)
"""
group_to_use = process_group if process_group is not None else dist.group.WORLD
world_size = group_to_use.size()
buffer = (
cast(Tuple[torch.Tensor, ...], bucket)[0]
if isinstance(bucket, tuple)
else bucket.buffer()
)
compressed_tensor = buffer.to(torch.bfloat16).div_(world_size)
def decompress(fut):
decompressed_tensor = buffer
# Decompress in place to reduce the peak memory.
# See: path_to_url
value = fut if isinstance(fut, torch.Tensor) else fut.value()[0]
decompressed_tensor.copy_(value)
return decompressed_tensor
if torch._utils.is_compiling():
grad = dist._functional_collectives.all_reduce(
compressed_tensor, "sum", group_to_use
)
return decompress(grad)
else:
fut = dist.all_reduce(
compressed_tensor, group=group_to_use, async_op=True
).get_future()
return fut.then(decompress)
def fp16_compress_wrapper(
hook: Callable[[Any, dist.GradBucket], torch.futures.Future[torch.Tensor]]
) -> Callable[[Any, dist.GradBucket], torch.futures.Future[torch.Tensor]]:
"""
Cast input tensor to ``torch.float16``, cast result of hook back to input dtype.
This wrapper casts the input gradient tensor of a given DDP communication hook to half-precision
floating point format (``torch.float16``), and casts the resulting tensor of the given hook back to
the input data type, such as ``float32``.
Therefore, ``fp16_compress_hook`` is equivalent to ``fp16_compress_wrapper(allreduce_hook)``.
Example::
>>> # xdoctest: +SKIP
>>> state = PowerSGDState(process_group=process_group, matrix_approximation_rank=1, start_powerSGD_iter=10)
>>> ddp_model.register_comm_hook(state, fp16_compress_wrapper(powerSGD_hook))
"""
def fp16_compress_wrapper_hook(
hook_state, bucket: dist.GradBucket
) -> torch.futures.Future[torch.Tensor]:
# Cast bucket tensor to FP16.
bucket.set_buffer(bucket.buffer().to(torch.float16))
fut = hook(hook_state, bucket)
def decompress(fut):
decompressed_tensor = bucket.buffer()
# Decompress in place to reduce the peak memory.
# See: path_to_url
decompressed_tensor.copy_(fut.value())
return decompressed_tensor
# Decompress after hook has run.
return fut.then(decompress)
return fp16_compress_wrapper_hook
def bf16_compress_wrapper(
hook: Callable[[Any, dist.GradBucket], torch.futures.Future[torch.Tensor]]
) -> Callable[[Any, dist.GradBucket], torch.futures.Future[torch.Tensor]]:
"""
Warning: This API is experimental, and it requires NCCL version later than 2.9.6.
This wrapper casts the input gradient tensor of a given DDP communication hook to half-precision
`Brain floating point format <path_to_url `_ (``torch.bfloat16``),
and casts the resulting tensor of the given hook back to the input data type, such as ``float32``.
Therefore, ``bf16_compress_hook`` is equivalent to ``bf16_compress_wrapper(allreduce_hook)``.
Example::
>>> # xdoctest: +SKIP
>>> state = PowerSGDState(process_group=process_group, matrix_approximation_rank=1, start_powerSGD_iter=10)
>>> ddp_model.register_comm_hook(state, bf16_compress_wrapper(powerSGD_hook))
"""
def bf16_compress_wrapper_hook(
hook_state, bucket: dist.GradBucket
) -> torch.futures.Future[torch.Tensor]:
# Cast bucket tensor to BF16.
bucket.set_buffer(bucket.buffer().to(torch.bfloat16))
fut = hook(hook_state, bucket)
def decompress(fut):
decompressed_tensor = bucket.buffer()
# Decompress in place to reduce the peak memory.
# See: path_to_url
decompressed_tensor.copy_(fut.value())
return decompressed_tensor
# Decompress after hook has run.
return fut.then(decompress)
return bf16_compress_wrapper_hook
``` |
İzmit İsmetpaşa Stadium () was a multi-purpose stadium in the Derince district of İzmit in Kocaeli Province, Turkey. It was named after the Turkish general and statesman İsmet İnönü (1884–1973), widely known as İsmet Pasha.
Built in 1972, it was situated on the Istanbul-İzmit highway . The stadium held 15,462 spectators, and was primarily used for football matches as the home stadium of Kocaelispor.
Demolition
In 2013, it was announced that the stadium's estate was handed over to Public Works and the stadium will be demolished in order to make place for residences and a shopping mall. A new stadium, İzmit Stadium, with 33,000 seating capacity was built in Alikahya neighborhood of Kartepe district. The demolition works are scheduled to start in June 2015.
References
External links
Venue information
Football venues in Turkey
Kocaelispor
Multi-purpose stadiums in Turkey
Sports venues in İzmit |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.