text
stringlengths 1
22.8M
|
|---|
The Anderson Platoon (, released in 1966 in Europe, 1967 in the US) is a documentary feature by Pierre Schoendoerffer about the Vietnam War, named after the leader of the platoon - Lieutenant Joseph B. Anderson - with which Schoendeorffer was embedded. Two decades later, a sequel was released as Reminiscence.
Background
In summer 1966, France Soir news magazine director and French public channel ORTF producer Pierre Lazareff proposed that war reporter and director Pierre Schoendoerffer complete the "unachieved" war documentary Schoendoerffer began in 1954.
Back in May 1954, Schoendoerffer was covering the First Indochina War for the French army's cinematographic service SCA. At the siege of Dien Bien Phu, he filmed the battle between the French Union forces and the Viet Minh, but his reels were captured when he surrendered to the enemy.
After French forces departed from Vietnam in 1956, the United States increased their support for the south, culminating in full scale military intervention and the Vietnam War.
Arguing that "the war was the same, the French only switching with the Americans", Lazareff convinced the French veteran to return to Vietnam as a kind of second chance to complete his war documentary.
Premise
The French war cameraman and First Indochina War veteran Schoendoerffer (38), already famous for his celebrated masterpiece The 317th Platoon (1965), returns to Vietnam.
On 1 August 1965, the 1st Cavalry Division (United States) is sent to South Vietnam. The following year in September, Schoendoerffer joins it and follows a 33-man platoon of GIs led by Black West Pointer Lieutenant Joseph B. Anderson (24) until October 1966.
Reception
Anderson Platoon was screened in more than 20 countries and won several prizes, including an Oscar on April 10, 1968, at the Santa Monica Civic Auditorium.
1967: Prix Italia for Original Dramatic Program
1968: Emmy Award for the Best Documentary Film of 1967
1967: Academy Award for Documentary Feature
1968: Merit Award (BBC)
Anderson's comments
Some time after the film was released, Captain Joseph B. Anderson, Jr., the leader of the unit of the US Army's 1st Cavalry Division after whom the film is named, commented on the film (and on his other experiences in Vietnam and in the military, in general). He observed:
Captain Anderson discusses the death from friendly fire of a white soldier from California named Shannon, who is also introduced in the film. Anderson states: "I did write a letter to his folks, telling them he did an exceptionally good job. I did not describe the circumstances under which he was killed, because we were directed not to put those kinds of details in letters whatever the case may be." He continues: "The film describes the grenade as an enemy grenade. Which is not the real circumstances."
Captain Anderson notes: "I spent my last months in the base camp at An Khe, an aide to the commanding general. Being featured in The Anderson Platoon had obviously helped my career."
Releases
Television
The Anderson Platoon was broadcast on the French public channel ORTF's monthly show Cinq colonnes à la une on February 3, 1967.
CBS premiered the English dub version on television in the United States on July 4, 1967. Shortly after its 1968 Academy Award, it was broadcast a second time in France's ORTF.
In West Germany, the 62 min. version was broadcast on July 17, 1968, on NDR, SFB, and Bremen III. After the Berlin wall's fall it was broadcast in Germany, on WDR, on January 15, 1995.
Theater
This documentary was originally made for a French TV show and was released in theaters in the United States only.
Alternate titles
La Section Anderson: original title.
The Anderson Platoon: English re-edited uncensored version title. This is the only accurate account for this title.
2. Kompanie, 1. Zug, Vietnam 1966 ("2nd Company, 1st Platoon, Vietnam 1966"): West German title. The "Anderson Platoon"'s actual name is "1st Platoon". The platoon belongs to the "B" for "Bravo" Company (the second letter in the English alphabet), and the documentary was shot in South Vietnam in 1966, hence the German title.
Abteilung Anderson ("Detachment Anderson"): German title after the reunification. This is a translation of the original title; "Detachment" is a synonym for "Platoon" in French.
Home video
The Anderson Platoon was made available on VHS tapes in the United States only.
A 60 min. VHS re-edited uncensored video edition was released in December 1987 by Hollywood Select Video. It was re-released by Timeless Video in May 1990. Timeless released a second print in June 1999.
By June 2000, Homevision released the original 65 min. French version subtitled in English.
Video on demand
In France it was available online April 26, 2006 as a VOD pay-per-view service through the National Audiovisual Institute's website hosting the ORTF archives.
Reminiscence
A sequel to The Anderson Platoon, entitled Reminiscence, was released in 1989. It depicts Schoendoerffer's meeting the platoon survivors 20 years after the events.
See also
1st Cavalry Division (United States)
A Face of War, documentary of a US Marine squad in Vietnam in 1966
Vietnam war
The 317th Platoon (1965)
Platoon (1986)
Joe Anderson's Interview with West Point Center for Oral History http://www.westpointcoh.org/interviews/before-and-after-the-anderson-platoon-a-lifetime-of-leadership-service-and-achievement see also http://www.westpointcoh.org/
Media links
La Section Anderson on the ORTF in 1968, 10 min. sample (National Audiovisual Institute)
References
External links
Vietnam: la section Anderson at the Institut national de l'audiovisuel
"How One French Director Brought the Vietnam War Home for Americans" by James T. Quinlivan, published at The National Interest on October 22, 2017
1966 films
1966 documentary films
Best Documentary Feature Academy Award winners
Black-and-white documentary films
Documentary films about the United States Army
Documentary films about the Vietnam War
1960s English-language films
Films directed by Pierre Schoendoerffer
French documentary films
1960s French-language films
Vietnamese-language films
1960s multilingual films
French multilingual films
1960s French films
|
```objective-c
// Protocol Buffers - Google's data interchange format
// path_to_url
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
// Authors: wink@google.com (Wink Saville),
// kenton@google.com (Kenton Varda)
// Based on original Protocol Buffers design by
// Sanjay Ghemawat, Jeff Dean, and others.
//
// Defines MessageLite, the abstract interface implemented by all (lite
// and non-lite) protocol message objects.
#ifndef GOOGLE_PROTOBUF_MESSAGE_LITE_H__
#define GOOGLE_PROTOBUF_MESSAGE_LITE_H__
#include <google/protobuf/stubs/common.h>
namespace google {
namespace protobuf {
namespace io {
class CodedInputStream;
class CodedOutputStream;
class ZeroCopyInputStream;
class ZeroCopyOutputStream;
}
// Interface to light weight protocol messages.
//
// This interface is implemented by all protocol message objects. Non-lite
// messages additionally implement the Message interface, which is a
// subclass of MessageLite. Use MessageLite instead when you only need
// the subset of features which it supports -- namely, nothing that uses
// descriptors or reflection. You can instruct the protocol compiler
// to generate classes which implement only MessageLite, not the full
// Message interface, by adding the following line to the .proto file:
//
// option optimize_for = LITE_RUNTIME;
//
// This is particularly useful on resource-constrained systems where
// the full protocol buffers runtime library is too big.
//
// Note that on non-constrained systems (e.g. servers) when you need
// to link in lots of protocol definitions, a better way to reduce
// total code footprint is to use optimize_for = CODE_SIZE. This
// will make the generated code smaller while still supporting all the
// same features (at the expense of speed). optimize_for = LITE_RUNTIME
// is best when you only have a small number of message types linked
// into your binary, in which case the size of the protocol buffers
// runtime itself is the biggest problem.
class LIBPROTOBUF_EXPORT MessageLite {
public:
inline MessageLite() {}
virtual ~MessageLite();
// Basic Operations ------------------------------------------------
// Get the name of this message type, e.g. "foo.bar.BazProto".
virtual string GetTypeName() const = 0;
// Construct a new instance of the same type. Ownership is passed to the
// caller.
virtual MessageLite* New() const = 0;
// Clear all fields of the message and set them to their default values.
// Clear() avoids freeing memory, assuming that any memory allocated
// to hold parts of the message will be needed again to hold the next
// message. If you actually want to free the memory used by a Message,
// you must delete it.
virtual void Clear() = 0;
// Quickly check if all required fields have values set.
virtual bool IsInitialized() const = 0;
// This is not implemented for Lite messages -- it just returns "(cannot
// determine missing fields for lite message)". However, it is implemented
// for full messages. See message.h.
virtual string InitializationErrorString() const;
// If |other| is the exact same class as this, calls MergeFrom(). Otherwise,
// results are undefined (probably crash).
virtual void CheckTypeAndMergeFrom(const MessageLite& other) = 0;
// Parsing ---------------------------------------------------------
// Methods for parsing in protocol buffer format. Most of these are
// just simple wrappers around MergeFromCodedStream().
// Fill the message with a protocol buffer parsed from the given input
// stream. Returns false on a read error or if the input is in the
// wrong format.
bool ParseFromCodedStream(io::CodedInputStream* input);
// Like ParseFromCodedStream(), but accepts messages that are missing
// required fields.
bool ParsePartialFromCodedStream(io::CodedInputStream* input);
// Read a protocol buffer from the given zero-copy input stream. If
// successful, the entire input will be consumed.
bool ParseFromZeroCopyStream(io::ZeroCopyInputStream* input);
// Like ParseFromZeroCopyStream(), but accepts messages that are missing
// required fields.
bool ParsePartialFromZeroCopyStream(io::ZeroCopyInputStream* input);
// Read a protocol buffer from the given zero-copy input stream, expecting
// the message to be exactly "size" bytes long. If successful, exactly
// this many bytes will have been consumed from the input.
bool ParseFromBoundedZeroCopyStream(io::ZeroCopyInputStream* input, int size);
// Like ParseFromBoundedZeroCopyStream(), but accepts messages that are
// missing required fields.
bool ParsePartialFromBoundedZeroCopyStream(io::ZeroCopyInputStream* input,
int size);
// Parse a protocol buffer contained in a string.
bool ParseFromString(const string& data);
// Like ParseFromString(), but accepts messages that are missing
// required fields.
bool ParsePartialFromString(const string& data);
// Parse a protocol buffer contained in an array of bytes.
bool ParseFromArray(const void* data, int size);
// Like ParseFromArray(), but accepts messages that are missing
// required fields.
bool ParsePartialFromArray(const void* data, int size);
// Reads a protocol buffer from the stream and merges it into this
// Message. Singular fields read from the input overwrite what is
// already in the Message and repeated fields are appended to those
// already present.
//
// It is the responsibility of the caller to call input->LastTagWas()
// (for groups) or input->ConsumedEntireMessage() (for non-groups) after
// this returns to verify that the message's end was delimited correctly.
//
// ParsefromCodedStream() is implemented as Clear() followed by
// MergeFromCodedStream().
bool MergeFromCodedStream(io::CodedInputStream* input);
// Like MergeFromCodedStream(), but succeeds even if required fields are
// missing in the input.
//
// MergeFromCodedStream() is just implemented as MergePartialFromCodedStream()
// followed by IsInitialized().
virtual bool MergePartialFromCodedStream(io::CodedInputStream* input) = 0;
// Serialization ---------------------------------------------------
// Methods for serializing in protocol buffer format. Most of these
// are just simple wrappers around ByteSize() and SerializeWithCachedSizes().
// Write a protocol buffer of this message to the given output. Returns
// false on a write error. If the message is missing required fields,
// this may GOOGLE_CHECK-fail.
bool SerializeToCodedStream(io::CodedOutputStream* output) const;
// Like SerializeToCodedStream(), but allows missing required fields.
bool SerializePartialToCodedStream(io::CodedOutputStream* output) const;
// Write the message to the given zero-copy output stream. All required
// fields must be set.
bool SerializeToZeroCopyStream(io::ZeroCopyOutputStream* output) const;
// Like SerializeToZeroCopyStream(), but allows missing required fields.
bool SerializePartialToZeroCopyStream(io::ZeroCopyOutputStream* output) const;
// Serialize the message and store it in the given string. All required
// fields must be set.
bool SerializeToString(string* output) const;
// Like SerializeToString(), but allows missing required fields.
bool SerializePartialToString(string* output) const;
// Serialize the message and store it in the given byte array. All required
// fields must be set.
bool SerializeToArray(void* data, int size) const;
// Like SerializeToArray(), but allows missing required fields.
bool SerializePartialToArray(void* data, int size) const;
// Make a string encoding the message. Is equivalent to calling
// SerializeToString() on a string and using that. Returns the empty
// string if SerializeToString() would have returned an error.
// Note: If you intend to generate many such strings, you may
// reduce heap fragmentation by instead re-using the same string
// object with calls to SerializeToString().
string SerializeAsString() const;
// Like SerializeAsString(), but allows missing required fields.
string SerializePartialAsString() const;
// Like SerializeToString(), but appends to the data to the string's existing
// contents. All required fields must be set.
bool AppendToString(string* output) const;
// Like AppendToString(), but allows missing required fields.
bool AppendPartialToString(string* output) const;
// Computes the serialized size of the message. This recursively calls
// ByteSize() on all embedded messages. If a subclass does not override
// this, it MUST override SetCachedSize().
virtual int ByteSize() const = 0;
// Serializes the message without recomputing the size. The message must
// not have changed since the last call to ByteSize(); if it has, the results
// are undefined.
virtual void SerializeWithCachedSizes(
io::CodedOutputStream* output) const = 0;
// Like SerializeWithCachedSizes, but writes directly to *target, returning
// a pointer to the byte immediately after the last byte written. "target"
// must point at a byte array of at least ByteSize() bytes.
virtual uint8* SerializeWithCachedSizesToArray(uint8* target) const;
// Returns the result of the last call to ByteSize(). An embedded message's
// size is needed both to serialize it (because embedded messages are
// length-delimited) and to compute the outer message's size. Caching
// the size avoids computing it multiple times.
//
// ByteSize() does not automatically use the cached size when available
// because this would require invalidating it every time the message was
// modified, which would be too hard and expensive. (E.g. if a deeply-nested
// sub-message is changed, all of its parents' cached sizes would need to be
// invalidated, which is too much work for an otherwise inlined setter
// method.)
virtual int GetCachedSize() const = 0;
private:
GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(MessageLite);
};
} // namespace protobuf
} // namespace google
#endif // GOOGLE_PROTOBUF_MESSAGE_LITE_H__
```
|
Hoyt Sanford Vandenberg (January 24, 1899 – April 2, 1954) was a United States Air Force general. He served as the second Chief of Staff of the Air Force, and the second Director of Central Intelligence.
During World War II, Vandenberg was the commanding general of the Ninth Air Force, a tactical air force in England and in France, supporting the Army, from August 1944 until V-E Day. Vandenberg Space Force Base on the central coast of California is named after him. In 1946, he was briefly the U.S. Chief of Military Intelligence. He was the nephew of Arthur H. Vandenberg, a former U.S. Senator from Michigan.
Early life
Vandenberg was born in Milwaukee, Wisconsin, the son of Pearl Kane and William Collins Vandenbergh, both from Dutch ancestry. He grew up in Lowell, Massachusetts, spending his teenage years there. While there he was one of the first Eagle Scouts in the Boy Scouts of America's Lowell Council. He graduated from the United States Military Academy on June 12, 1923, and was commissioned a second lieutenant in the United States Army Air Service.
Military career
Vandenberg graduated from the Air Service Flying School at Brooks Field, Texas, in February 1924, and from the Air Service Advanced Flying School at Kelly Field, Texas, in September 1924.
Vandenberg's first assignment was with the 90th Attack Squadron, part of the 3rd Attack Group at Kelly Field. (In 1926 Lt. Van was also a stunt pilot for the silent film "Wings" which was filming in San Antonio. "Wings" won the first Academy Award for a motion picture.) Vandenberg was appointed commander of the 90th AS on January 1, 1926. In 1927, he became an instructor at the Air Corps Primary Flying School at March Field, Calif. In 1928 he was promoted to first lieutenant. In May 1929 he went to Wheeler Field, Hawaii, to join the 6th Pursuit Squadron, and assumed command of it the following November.
Returning in September 1931, Vandenberg was appointed a flying instructor at Randolph Field, Texas, and became a flight commander and deputy stage commander there in March 1933. He entered the Air Corps Tactical School at Maxwell Field, Alabama, in August 1934, and graduated the following June. Two months later he enrolled in the Command and General Staff School at Fort Leavenworth, Kansas; he completed the course in June 1936 and was promoted to the rank of captain. He then became an instructor in the Pursuit Section of the Air Corps Tactical School, where he taught until September 1936, when he entered the Army War College, where he specialized in air defense planning for the Philippines.
After graduating from the War College in June 1939, Vandenberg was assigned to the Plans Division in the Office of the Chief of Air Corps, selected personally by its head, Brigadier General Carl Spaatz, whom he had met at the Command and General Staff College. In September 1939 and the autumn of 1940, Vandenberg developed two air plans for the Philippine Department, the second based on Royal Air Force interceptor operations in the Battle of Britain, but neither was adopted by the War Department when the Roosevelt Administration reaffirmed its long-standing opposition to any plan that called for extensive reinforcement of the defenses in the Philippines. In 1940 Vandenberg was promoted to major and in 1941 to lieutenant colonel.
A few months after the United States entered World War II, Vandenberg was promoted to colonel and became operations and training officer of the Air Staff. For his services in these two positions he received the Distinguished Service Medal.
In June 1942, Vandenberg was assigned to the United Kingdom and assisted in the organization of the Air Forces in North Africa. While in Great Britain he was appointed the chief of staff of the Twelfth Air Force, which he helped organize. In December 1942 Vandenberg earned the promotion to brigadier general. On February 18, 1943, Vandenberg became the chief of staff of the Northwest African Strategic Air Force (NASAF), which was under the command of Major General James Doolittle. NASAF was the strategic arm of the new Northwest African Air Forces (NAAF) under Lieutenant General Carl Spaatz. With NASAF, Vandenberg flew on numerous missions over Tunisia, Pantelleria, Sardinia, Sicily, and Italy. He was awarded both the Silver Star and the Distinguished Flying Cross for his services during this time. For his organizational ability with the Twelfth Air Force and his work as chief of staff of the NASAF, he was awarded the Legion of Merit. In August 1943, Vandenberg was assigned to Air Force headquarters as Deputy Chief of Air Staff. In September 1943, he became head of an air mission to Russia, under Ambassador Harriman, and returned to the United States in January 1944. In March 1944, he earned the promotion to major general and then he was transferred to the European theater; in April 1944, he was designated the Deputy Air Commander in Chief of the Allied Expeditionary Forces and the Commander of its American Air Component.
In August 1944, Vandenberg assumed command of the Ninth Air Force. On November 28, 1944, he received an oak leaf cluster to his Distinguished Service Medal for his part in planning the Normandy invasion. He was promoted to lieutenant general in March 1945.
Vandenberg was appointed the Assistant Chief of Air Staff at the U.S. Army Air Forces (USAAF) headquarters in July 1945. In January 1946, he became Director of Intelligence on the War Department general staff where he served until his appointment in June 1946, as Director of Central Intelligence, a position he held until May 1947.
Vandenberg returned to duty with the Air Force in April 1947, and on June 15 became the Deputy Commander in Chief of the Air Staff. Following the division of the United States Department of War into the Departments of the Army and the Air Force, Vandenberg was designated the Vice Chief of Staff of the United States Air Force on October 1, 1947, and promoted to the rank of general.
Even when Vandenberg was at the pinnacle of his military career, his boyish good looks and outgoing personality often made him the target of attacks on his credibility and experience. However, the attention that his appearance brought on was not all bad. He appeared on the covers of Time and Life magazines. The Washington Post once described him as "the most impossibly handsome man on the entire Washington scene," and Marilyn Monroe once named Vandenberg, along with Joe DiMaggio and Albert Einstein, as one of the three people with whom she would want to be stranded on a deserted island.
On April 30, 1948, Vandenberg became the Chief of Staff of the United States Air Force, succeeding General Carl Spaatz. He was renominated by President Harry S. Truman for a second term as Air Force Chief of Staff on March 6, 1952. The nomination was confirmed on April 28, with Vandenberg serving until June 30, 1953.
A controversy arose while Vandenberg was the Air Force Chief of Staff, when he opposed the United States Secretary of Defense Charles Erwin Wilson on a proposed $5 billion budget reduction for the Air Force. Vandenberg maintained that the cut backed by Wilson would reduce military aviation to a "one-shot Air Force," inferior to that of the Soviet Union. He said it was another instance of "start-stop" planning of a kind that had impeded Air Force development in previous years. The cut in appropriations went into effect in July 1953, immediately after his retirement from the Air Force.
Later life
A scratch golfer, he spent much time on golf courses. He was also a lover of movies, Westerns, and scotch. Vandenberg retired from active duty on June 30, 1953, and he died nine months later, at the Walter Reed Army Medical Center of prostate cancer at the age of 55. He is interred in Section 30 of Arlington National Cemetery.
His wife, Gladys Merritt (Rose) Vandenberg (1898–1978), started the concept of the Arlington Ladies while he was Air Force Chief of Staff. The program provides that a woman of the appropriate military service represents the service chief at all military funerals at Arlington National Cemetery. She was buried, alongside her husband, in Arlington National Cemetery upon her death on January 9, 1978. They are survived by their children, Gloria Vandenberg Miller and Hoyt S. Vandenberg, Jr.
Namesakes
On October 4, 1958, the missile and space base at Camp Cooke in Lompoc, California, was renamed Vandenberg Air Force Base (which was redesignated Vandenberg Space Force Base in 2021). In July 1963, the instrument ship was renamed at Cape Canaveral, Florida, for duty on the Eastern Space and Missile Range in the Atlantic. One of the two cadets' dormitories at the United States Air Force Academy, Vandenberg Hall, is also named in his honor. In addition, a popular enlisted "hangout" for technical school Airmen at Keesler AFB, Mississippi, is named in his honor, as was the Vandenberg Esplanade, along the Merrimack River in Lowell, Massachusetts and part of the Lowell Heritage State Park.
Dates of rank
Sources:
Awards and decorations
Command Pilot
Foreign awards
The Manuscript Collection of Hoyt S. Vandenberg at the Library of Congress as of November 2005 is Classified information.
References
External links
Biography by the United States Air Force
National Aviation – Hoyt Vandenberg
General Vandenberg on the cover of Life magazine, December 5 1949
|-
|-
1899 births
1954 deaths
Air Corps Tactical School alumni
American people of Dutch descent
Burials at Arlington National Cemetery
Chiefs of Staff of the United States Air Force
Commanders with Star of the Order of Polonia Restituta
Deaths from prostate cancer
Directors of the Central Intelligence Agency
Grand Officers of the Order of Orange-Nassau
Honorary Knights Commander of the Order of the Bath
Joint Chiefs of Staff
Knights Grand Cross of the Military Order of Savoy
Recipients of the Legion of Honour
Military personnel from Lowell, Massachusetts
Military personnel from Milwaukee
Recipients of the Air Medal
Recipients of the Croix de guerre (Belgium)
Recipients of the Croix de Guerre (France)
Recipients of the Distinguished Flying Cross (United States)
Recipients of the Distinguished Service Medal (US Army)
Recipients of the Legion of Merit
Recipients of the Order of Aviz
Recipients of the Order of the Sacred Tripod
Recipients of the Silver Star
United States Air Force generals
United States Army Command and General Staff College alumni
United States Military Academy alumni
Vice Chiefs of Staff of the United States Air Force
|
```lua
This program is free software; you can redistribute it and/or modify
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
with this program; if not, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
]]
-- Demonstration of using text to create a different level each time the player
-- reaches a goal object.
local random = require 'common.random'
local make_map = require 'common.make_map'
local pickups = require 'common.pickups'
local api = {}
-- `make_map` has default pickup types A = apple_reward and G = goal.
-- This callback is used to create pickups with those names.
function api:createPickup(className)
return pickups.defaults[className]
end
-- Called at the begining of each episode.
function api:start(episode, seed)
random:seed(seed)
-- When converting from text to map the theme variations, wall decorations and
-- light positions are chosen randomly.
make_map.random():seed(random:mapGenerationSeed())
end
-- Called each time a map is needed to be generated.
-- The first map is generated after start is called and the following each time
-- the goal object is picked up.
function api:nextMap()
-- All maps must have at least one spawn point.
local map = 'P'
-- Add between [0, 5] apples.
for i = 0, make_map.random():uniformInt(0, 5) do
map = map .. ' A'
end
-- Add a door and a goal object.
-- When reaching the goal object the map is finished and a new map is
-- requested.
map = map .. ' I G'
return make_map.makeMap{
mapName = 'random_length',
mapEntityLayer = map
}
end
return api
```
|
Bicycling the Pacific Coast is a 1984 bicycle touring guide by Vicky Spring and Tom Kirkendall, published by The Mountaineers Books. The book covers a nearly route from Vancouver, British Columbia to Tijuana, Mexico, following mostly United States Highway 101 and California State Route 1.
It has been called "a classic" and "the Bible for touring cyclists." In its Oregon Coast Bike Route guide, Oregon Department of Transportation noted the book as an "excellent" guide to its portion of Spring and Kirkendall's route.
Notes
1984 non-fiction books
American travel books
Bicycle tours
Books about camping
Books about California
Cycling books
|
Denmark participated in the Eurovision Song Contest 2006 with the song "Twist of Love" written by Niels Drevsholt. The song was performed by Sidsel Ben Semmane. The Danish broadcaster DR organised the national final Dansk Melodi Grand Prix 2006 in order to select the Danish entry for the 2006 contest in Athens, Greece. Ten songs competed in a televised show where "Twist of Love" performed by Sidsel Ben Semmane was the winner as decided upon through two rounds of public voting.
As one of the ten highest placed finishers in 2005, Denmark automatically qualified to compete in the final of the Eurovision Song Contest. Performing during the show in position 9, Denmark placed eighteenth out of the 24 participating countries with 26 points.
Background
Prior to the 2006 contest, Denmark had participated in the Eurovision Song Contest thirty-four times since its first entry in 1957. Denmark had won the contest, to this point, on two occasions: in with the song "Dansevise" performed by Grethe and Jørgen Ingmann, and in with the song "Fly on the Wings of Love" performed by Olsen Brothers. In the 2005 contest, "Talking to You" performed by Jakob Sveistrup qualified Denmark to the final placing ninth.
The Danish national broadcaster, DR, broadcasts the event within Denmark and organises the selection process for the nation's entry. DR confirmed their intentions to participate at the 2006 Eurovision Song Contest on 17 June 2005. Denmark has selected all of their Eurovision entries through the national final Dansk Melodi Grand Prix. Along with their participation confirmation, the broadcaster announced that Dansk Melodi Grand Prix 2006 would be organised in order to select Denmark's entry for the 2006 contest.
Before Eurovision
Dansk Melodi Grand Prix 2006
Dansk Melodi Grand Prix 2006 was the 36th edition of Dansk Melodi Grand Prix, the music competition that selects Denmark's entries for the Eurovision Song Contest. The event was held on 11 February 2006 at the Gigantium in Aalborg, hosted by Adam Duvå Hall and Mads Vangsø with Græker-Kaj hosting segments from the green room. The show was televised on DR1 as well as streamed online at the official DR website. The national final was watched by 1.651 million viewers in Denmark.
Competing entries
DR opened a submission period between 17 June 2005 and 10 October 2005 for composers to submit their entries. All composers and lyricists were required to be Danish citizens or have been registered as a Danish resident from 1 July 2005 to 20 May 2006. The broadcaster received 336 entries during the submission period. A selection committee selected ten songs from the entries submitted to the broadcaster, while the artists of the selected entries were chosen by DR in consultation with their composers. DR held a press meet and greet at the DR Byen in Copenhagen on 8 December 2005 where the competing artists and songs were announced and officially presented. Among the artists were Helge Engelbrecht (member of Neighbours) who represented Denmark in the Eurovision Song Contest 1987 as part of Bandjo, Trine Jepsen who represented Denmark in the Eurovision Song Contest 1999, and Søren Poppe who represented Denmark in the Eurovision Song Contest 2001 as part of Rollo and King.
Final
The final took place on 11 February 2006 where the winner was determined over two rounds of public voting. The running order was determined by DR and announced on 6 January 2006. In the first round of voting the top five advanced to the superfinal. In the superfinal, the winner, "Twist of Love" performed by Sidsel Ben Semmane, was selected. Viewers were able to vote via telephone or SMS and the voting results of each of Denmark's four regions in the superfinal were converted to points which were distributed as follows: 4, 6, 8, 10 and 12 points.
At Eurovision
According to Eurovision rules, all nations with the exceptions of the host country, the "Big Four" (France, Germany, Spain and the United Kingdom) and the ten highest placed finishers in the 2005 contest are required to qualify from the semi-final in order to compete for the final; the top ten countries from the semi-final progress to the final. As one of the ten highest placed finishers in the 2005 contest, Denmark automatically qualified to compete in the final on 20 May 2006. On 21 March 2006, a special allocation draw was held which determined the running order and Denmark was set to perform in position 9, following the entry from Germany and before the entry from Russia. Denmark placed eighteenth in the final, scoring 26 points.
The semi-final and final were broadcast on DR1 with commentary by Mads Vangsø and Adam Duvå Hall. The Danish spokesperson, who announced the Danish votes during the final, was Jørgen de Mylius. The final of the contest was watched by a total of 1.7 million viewers in Denmark.
Voting
Below is a breakdown of points awarded to Denmark and awarded by Denmark in the semi-final and grand final of the contest. The nation awarded its 12 points to Sweden in the semi-final and to Finland in the final of the contest.
Points awarded to Denmark
Points awarded by Denmark
References
2006
Countries in the Eurovision Song Contest 2006
Eurovision
Eurovision
|
```java
How to list all files in a directory that match a filename extension in Java
Reading and writing text files
Translating `Scanner` tokens into primitive types
Listing a file system's root directories
List contents of a directory with `newDirectoryStream`
```
|
```kotlin
package de.westnordost.streetcomplete.quests.sidewalk
import de.westnordost.streetcomplete.data.osm.geometry.ElementPolylinesGeometry
import de.westnordost.streetcomplete.quests.TestMapDataWithGeometry
import de.westnordost.streetcomplete.testutils.p
import de.westnordost.streetcomplete.testutils.way
import de.westnordost.streetcomplete.util.math.translate
import kotlin.test.Test
import kotlin.test.assertEquals
import kotlin.test.assertTrue
class AddSidewalkTest {
private val questType = AddSidewalk()
@Test fun `not applicable to road with sidewalk`() {
val road = way(tags = mapOf(
"highway" to "primary",
"sidewalk" to "both"
))
val mapData = TestMapDataWithGeometry(listOf(road))
assertEquals(0, questType.getApplicableElements(mapData).toList().size)
assertEquals(false, questType.isApplicableTo(road))
}
@Test fun `applicable to road with missing sidewalk`() {
val road = way(tags = mapOf(
"highway" to "primary",
"lit" to "yes"
))
val mapData = TestMapDataWithGeometry(listOf(road))
assertEquals(1, questType.getApplicableElements(mapData).toList().size)
assertTrue(questType.isApplicableTo(road))
}
@Test fun `applicable to road with incomplete sidewalk tagging`() {
val road = way(tags = mapOf(
"highway" to "residential",
"sidewalk:left" to "yes"
))
val mapData = TestMapDataWithGeometry(listOf(road))
assertEquals(1, questType.getApplicableElements(mapData).toList().size)
assertTrue(questType.isApplicableTo(road))
}
@Test fun `applicable to road with invalid sidewalk tagging`() {
val road = way(tags = mapOf(
"highway" to "residential",
"sidewalk" to "something"
))
val footway = way(2, listOf(3, 4), mapOf(
"highway" to "footway"
))
val mapData = TestMapDataWithGeometry(listOf(road, footway))
val p1 = p(0.0, 0.0)
val p2 = p1.translate(50.0, 45.0)
val p3 = p1.translate(13.0, 135.0)
val p4 = p3.translate(50.0, 45.0)
mapData.wayGeometriesById[1L] = ElementPolylinesGeometry(listOf(listOf(p1, p2)), p1)
mapData.wayGeometriesById[2L] = ElementPolylinesGeometry(listOf(listOf(p3, p4)), p3)
assertEquals(1, questType.getApplicableElements(mapData).toList().size)
assertTrue(questType.isApplicableTo(road))
}
@Test fun `applicable to road with overloaded sidewalk tagging`() {
val road = way(tags = mapOf(
"highway" to "residential",
"sidewalk" to "left",
"sidewalk:right" to "yes"
))
val footway = way(2, listOf(3, 4), mapOf(
"highway" to "footway"
))
val mapData = TestMapDataWithGeometry(listOf(road, footway))
val p1 = p(0.0, 0.0)
val p2 = p1.translate(50.0, 45.0)
val p3 = p1.translate(13.0, 135.0)
val p4 = p3.translate(50.0, 45.0)
mapData.wayGeometriesById[1L] = ElementPolylinesGeometry(listOf(listOf(p1, p2)), p1)
mapData.wayGeometriesById[2L] = ElementPolylinesGeometry(listOf(listOf(p3, p4)), p3)
assertEquals(1, questType.getApplicableElements(mapData).toList().size)
assertTrue(questType.isApplicableTo(road))
}
@Test fun `not applicable to motorways`() {
val road = way(tags = mapOf(
"highway" to "motorway",
))
val mapData = TestMapDataWithGeometry(listOf(road))
assertEquals(0, questType.getApplicableElements(mapData).toList().size)
assertEquals(false, questType.isApplicableTo(road))
}
@Test fun `applicable to motorways marked as legally accessible to pedestrians`() {
val road = way(tags = mapOf(
"highway" to "motorway",
"foot" to "yes"
))
val mapData = TestMapDataWithGeometry(listOf(road))
assertEquals(1, questType.getApplicableElements(mapData).toList().size)
assertTrue(questType.isApplicableTo(road))
}
@Test fun `applicable to motorways marked as legally accessible to pedestrians and with tagged speed limit`() {
val road = way(tags = mapOf(
"highway" to "motorway",
"foot" to "yes",
"maxspeed" to "65 mph",
))
val mapData = TestMapDataWithGeometry(listOf(road))
assertEquals(1, questType.getApplicableElements(mapData).toList().size)
assertTrue(questType.isApplicableTo(road))
}
@Test fun `not applicable to road with very low speed limit`() {
val road = way(tags = mapOf(
"highway" to "residential",
"maxspeed" to "9",
))
val mapData = TestMapDataWithGeometry(listOf(road))
assertEquals(0, questType.getApplicableElements(mapData).toList().size)
assertEquals(false, questType.isApplicableTo(road))
}
@Test fun `applicable to road with implicit speed limit`() {
val road = way(tags = mapOf(
"highway" to "primary",
"maxspeed" to "DE:zone30",
))
val mapData = TestMapDataWithGeometry(listOf(road))
assertEquals(1, questType.getApplicableElements(mapData).toList().size)
assertTrue(questType.isApplicableTo(road))
}
@Test fun `applicable to road with urban speed limit`() {
val road = way(tags = mapOf(
"highway" to "primary",
"maxspeed" to "60",
))
val mapData = TestMapDataWithGeometry(listOf(road))
assertEquals(1, questType.getApplicableElements(mapData).toList().size)
assertTrue(questType.isApplicableTo(road))
}
}
```
|
Yogeshvara () is a Sanskrit epithet employed in Hinduism. The term Yogeshvara is a portmanteau of yoga and ishvara, meaning 'Lord of Yoga', 'Lord of Yogis', or 'God of Yoga'. The term is primarily employed to address the deities Shiva and Krishna.
Hinduism
The term is an epithet of Krishna in Vaishnavism, who is also known as Parameshvara, the supreme god.
Yogeshvara is a main deity in the Swadhyaya Movement, along with Shiva, Ganesha, and Parvati.
References
Hindu philosophical concepts
Names of God in Hinduism
Vedanta
|
Luis López Hartinger (born December 27, 1975) is a Peruvian former swimmer, who specialized in sprint freestyle events. Lopez competed only in the men's 50 m freestyle at the 2000 Summer Olympics in Sydney. He achieved a FINA B-standard entry time of 23.76 from the Pan American Games in Winnipeg, Manitoba, Canada. He challenged seven other swimmers in heat four, including Kyrgyzstan's Sergey Ashihmin, Goodwill Games silver medalist for Russia, and Kazakhstan's two-time Olympian Sergey Borisenko. He shared a fourth seed with Singapore's Leslie Kwok in a matching time of 24.00. Lopez failed to advance into the semifinals, as he placed forty-seventh overall out of 80 swimmers in the prelims.
References
1975 births
Living people
Peruvian male freestyle swimmers
Olympic swimmers for Peru
Swimmers at the 1999 Pan American Games
Swimmers at the 2000 Summer Olympics
Pan American Games competitors for Peru
20th-century Peruvian people
|
```c++
// Boost.Geometry (aka GGL, Generic Geometry Library)
// Unit Test
// This file was modified by Oracle on 2015.
// Modifications copyright (c) 2015 Oracle and/or its affiliates.
// Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
// (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// path_to_url
#include <geometry_test_common.hpp>
#include <boost/concept_check.hpp>
#include <boost/geometry/strategies/geographic/distance_thomas.hpp>
#include <boost/geometry/strategies/geographic/side_thomas.hpp>
#include <boost/geometry/core/srs.hpp>
#include <boost/geometry/strategies/strategies.hpp>
#include <boost/geometry/algorithms/assign.hpp>
#include <boost/geometry/geometries/point.hpp>
#include <test_common/test_point.hpp>
#ifdef HAVE_TTMATH
# include <boost/geometry/extensions/contrib/ttmath_stub.hpp>
#endif
template <typename P1, typename P2>
void test_distance(double lon1, double lat1, double lon2, double lat2, double expected_km)
{
// Set radius type, but for integer coordinates we want to have floating point radius type
typedef typename bg::promote_floating_point
<
typename bg::coordinate_type<P1>::type
>::type rtype;
typedef bg::srs::spheroid<rtype> stype;
typedef bg::strategy::distance::thomas<stype> thomas_type;
BOOST_CONCEPT_ASSERT
(
(bg::concepts::PointDistanceStrategy<thomas_type, P1, P2>)
);
thomas_type thomas;
typedef typename bg::strategy::distance
::services::return_type<thomas_type, P1, P2>::type return_type;
P1 p1;
P2 p2;
bg::assign_values(p1, lon1, lat1);
bg::assign_values(p2, lon2, lat2);
BOOST_CHECK_CLOSE(thomas.apply(p1, p2), return_type(1000.0 * expected_km), 0.001);
BOOST_CHECK_CLOSE(bg::distance(p1, p2, thomas), return_type(1000.0 * expected_km), 0.001);
}
template <typename PS, typename P>
void test_side(double lon1, double lat1,
double lon2, double lat2,
double lon, double lat,
int expected_side)
{
// Set radius type, but for integer coordinates we want to have floating point radius type
typedef typename bg::promote_floating_point
<
typename bg::coordinate_type<PS>::type
>::type rtype;
typedef bg::srs::spheroid<rtype> stype;
typedef bg::strategy::side::thomas<stype> strategy_type;
strategy_type strategy;
PS p1, p2;
P p;
bg::assign_values(p1, lon1, lat1);
bg::assign_values(p2, lon2, lat2);
bg::assign_values(p, lon, lat);
int side = strategy.apply(p1, p2, p);
BOOST_CHECK_EQUAL(side, expected_side);
}
template <typename P1, typename P2>
void test_all()
{
test_distance<P1, P2>(0, 90, 1, 80, 1116.825795); // polar
test_distance<P1, P2>(0, -90, 1, -80, 1116.825795); // polar
test_distance<P1, P2>(4, 52, 4, 52, 0.0); // no point difference
test_distance<P1, P2>(4, 52, 3, 40, 1336.025365); // normal case
test_side<P1, P2>(0, 0, 0, 1, 0, 2, 0);
test_side<P1, P2>(0, 0, 0, 1, 0, -2, 0);
test_side<P1, P2>(10, 0, 10, 1, 10, 2, 0);
test_side<P1, P2>(10, 0, 10, -1, 10, 2, 0);
test_side<P1, P2>(10, 0, 10, 1, 0, 2, 1); // left
test_side<P1, P2>(10, 0, 10, -1, 0, 2, -1); // right
test_side<P1, P2>(-10, -10, 10, 10, 10, 0, -1); // right
test_side<P1, P2>(-10, -10, 10, 10, -10, 0, 1); // left
test_side<P1, P2>(170, -10, -170, 10, -170, 0, -1); // right
test_side<P1, P2>(170, -10, -170, 10, 170, 0, 1); // left
}
template <typename P>
void test_all()
{
test_all<P, P>();
}
int test_main(int, char* [])
{
//test_all<float[2]>();
//test_all<double[2]>();
test_all<bg::model::point<int, 2, bg::cs::geographic<bg::degree> > >();
test_all<bg::model::point<float, 2, bg::cs::geographic<bg::degree> > >();
test_all<bg::model::point<double, 2, bg::cs::geographic<bg::degree> > >();
#if defined(HAVE_TTMATH)
test_all<bg::model::point<ttmath::Big<1,4>, 2, bg::cs::geographic<bg::degree> > >();
test_all<bg::model::point<ttmath_big, 2, bg::cs::geographic<bg::degree> > >();
#endif
return 0;
}
```
|
```css
h1 {
color: rgb(114, 191, 190);
}
#color {
width: 300px;
height: 300px;
margin: 0 auto;
}
button {
cursor: pointer;
display: inline-block;
height: 20px;
background-color: rgb(123, 109, 198);
color: rgb(255, 255, 255);
padding: 10px 5px;
border-radius: 4px;
border-bottom: 2px solid rgb(143, 132, 200);
}
```
|
```xml
import { Component } from '@angular/core';
import { Code } from '@domain/code';
@Component({
selector: 'avatar-size-demo',
template: `
<app-docsectiontext>
<p><i>size</i> property defines the size of the Avatar with <i>large</i> and <i>xlarge</i> as possible values.</p>
</app-docsectiontext>
<div class="card flex justify-content-center gap-2">
<p-avatar label="P" size="large" />
<p-avatar label="T" size="xlarge" />
</div>
<app-code [code]="code" selector="avatar-size-demo"></app-code>
`
})
export class SizeDoc {
code: Code = {
basic: `<p-avatar label="P" size="large" />
<p-avatar label="T" size="xlarge" />`,
html: `<div class="card flex justify-content-center gap-2">
<p-avatar label="P" size="large" />
<p-avatar label="T" size="xlarge" />
</div>`,
typescript: `import { Component } from '@angular/core';
import { AvatarModule } from 'primeng/avatar';
@Component({
selector: 'avatar-size-demo',
templateUrl: './avatar-size-demo.html',
standalone: true,
imports: [AvatarModule]
})
export class AvatarSizeDemo {}`
};
}
```
|
Frederic Harrison (18 October 1831 – 14 January 1923) was a British jurist and historian.
Biography
Born at 17 Euston Square, London, he was the son of Frederick Harrison (1799–1881), a stockbroker and his wife Jane, daughter of Alexander Brice, a Belfast granite merchant. He was baptised at St. Pancras Church, Euston, and spent his early childhood at the northern London suburb of Muswell Hill, to which the family moved soon after his birth. His father later acquired a lease on the grand Tudor manor house Sutton Place near Guildford, Surrey, in 1874, which descended to his elder son Sidney, and about which Frederic jnr. wrote the definitive history Annals of an Old Manor House: Sutton Place, Guildford, first published in 1893. His paternal grandfather was a Leicestershire builder. In 1840 the family moved again to 22 Oxford Square, Hyde Park, London, a house designed by Harrison's father. Along with his siblings Sidney and Lawrence, Harrison received his initial education at home before attending a day school in St John's Wood. In 1843 he entered King's College School, graduating as second in the school in 1849.
Oxford and Positivism
He received a scholarship to Wadham College, Oxford in 1849. It was at Oxford that he was to embrace positive philosophy, under the influence of his tutor Richard Congreve and the works of John Stuart Mill and George Henry Lewes. Harrison found himself in conflict with Congreve as to details, and eventually led the Positivists who split off and founded Newton Hall in 1881, and he was president of the English Positivist Committee from 1880 to 1905; he was also editor and part author of the Positivist New Calendar of great Men (1892), and wrote much on Auguste Comte and Positivism. For more than three decades, he was a regular contributor to The Fortnightly Review, often in defence of Positivism, especially Comte's version of it.
Among his contemporaries at Wadham were Edward Spencer Beesly, John Henry Bridges, and George Earlam Thorley who were to become the leaders of the secular Religion of Humanity or "Comtism" in England. He received a second class in Moderations in 1852 and a first class in Literae Humaniores in 1853. In the following year he was elected a fellow of the college and became a tutor, taking over from Congreve. He became part of a liberal group of academics at Oxford that also included Arthur Penrhyn Stanley, Goldwin Smith, Mark Pattison and Benjamin Jowett.
As a religious teacher, literary critic, historian and jurist, Harrison took a prominent part in the life of his time, and his writings, though often violently controversial on political, religious and social subjects, and in their judgment and historical perspective characterized by a modern Radical point of view, are those of an accomplished scholar, and of one whose wide knowledge of literature was combined with independence of thought and admirable vigour of style. In 1907 he published The Creed of a Layman, which included his Apologia pro fide mea, in explanation of his Positivist religious position.
Legal and publishing career
He was called to the bar in 1858, and, in addition to his practice in equity cases, soon began to distinguish himself as an effective contributor to the higher-class reviews. Two articles in the Westminster Review, one on the Italian question, which procured him the special thanks of Cavour, the other on Essays and Reviews, which had the probably undesigned effect of stimulating the attack on the book, attracted especial notice. A few years later Harrison worked at the codification of the law with Lord Westbury, of whom he contributed an interesting notice to Nash's biography of the chancellor. His special interest in legislation for the working classes led him to be placed upon the Trades Union Commission of 1867–1869; he was secretary to the commission for the digest of the law, 1869–1870; and was from 1877 to 1889 professor of jurisprudence and international law under the Council of Legal Education. He was also professor of jurisprudence to the Inns of Court, and an Honorary fellow of Wadham College.
Of his separate publications, the most important are his lives of Cromwell (1888), William the Silent, (1897), Ruskin (1902), and Chatham (1905); his Meaning of History (1862; enlarged 1894) and Byzantine History in the Early Middle Ages (1900); and his essays on Early Victorian Literature (1896) and The Choice of Books (1886) are remarkable alike for generous admiration and good sense. In 1904 he published a "romantic monograph" of the 10th century Byzantine resurgence, Theophano, based on the empress of that name, and in 1906 a verse tragedy, Nicephorus, based on Emperor Nikephoros II. His Annals of an Old Manor House: Sutton Place, Guildford, first published in London in 1893 as a quarto work, re-issued in a small abridged form in 1899, is a valuable and detailed study of the Weston family and the architecturally important manor house Sutton Place built by Sir Richard Weston c. 1525. Harrison's father had been the lessee since 1874 and the author had many years of access in which to perform his detailed investigations and researches.
He gave the Sir Robert Rede Lecture at the University of Cambridge in 1900.
Politics
An advanced and vehement Radical in politics and Progressive in municipal affairs, Harrison in 1886 stood unsuccessfully as the Liberal Party candidate against Sir John Lubbock for the University of London parliamentary constituency. In 1889 he was elected an alderman of the London County Council, but resigned in 1893.
Harrison was a regular contributor to George Potter's trade unionist journal The Beehive, and to W. H. Riley's Commonwealth, which promoted the International Working Men's Association. He was a supporter of Polish and Italian independence, the Union in the American civil war, the reformers in the Jamaica Committee of 1866, the Paris Commune and was a vice president of the Reform League. In an article defending the Paris Commune which appeared in the Fortnightly Review Harrison proclaimed: 'The status quo is impossible. The alternative is Communism or Positivism.'
Later works include Autobiographic Memoirs (1911); The Positive Evolution of Religion (1912); The German Peril (1915); On Society (1918); Jurisprudence and Conflict of Nations (1919); Obiter Dicta (1919); Novissima Verba (1920). The last two of these were collections of vigorous comments on politics and literature contributed by him to the Fortnightly Review towards the end of World War I and immediately afterwards.
Family
In 1870 Harrison married his first cousin Ethel Bertha Harrison, daughter of William Harrison. They had four sons, including the journalist and literary critic Austin Harrison. George Gissing, the novelist, was at one time their tutor; and in 1905 Harrison wrote a preface to Gissing's Veranilda. One of the sons, Christopher René Harrison, was killed in World War I.
Works
References
External links
Works by Frederic Harrison, at Hathi Trust
Catalogue of the Harrison papers held at LSE Archives
1831 births
1923 deaths
English barristers
19th-century English historians
People educated at King's College School, London
Comtism
Progressive Party (London) politicians
Members of London County Council
Fellows of Wadham College, Oxford
English Christian socialists
20th-century English historians
Liberal Party (UK) parliamentary candidates
|
KBFR may refer to:
KBFR (FM), a radio station (101.1 FM) licensed to serve Desert Center, California, United States
KBFR (pirate radio), a pirate radio station broadcasting from Boulder, Colorado, United States
KXRP, a radio station (91.7 FM) licensed to serve Bismarck, North Dakota, United States, which held the call sign KBFR from 2002 to 2014
Virgil I. Grissom Municipal Airport (ICAO code KBFR)
|
Sparrevohn LRRS Airport is a military airstrip located south of Sparrevohn, in the Bethel Census Area of the U.S. state of Alaska. The airstrip is also located south of McGrath, Alaska, and west of Anchorage, Alaska . It is not open for public use.
Overview
Sparrevohn Airport is a United States Air Force military airstrip. Its mission is to provide access to the Sparrevohn Long Range Radar Site for servicing and other requirements.
The airstrip was constructed in 1952 as part of the construction of the Sparrevohn Air Force Station. During the station's operational use as a manned radar station, it provided transportation for station personnel and for supplies and equipment to be airlifted to the station. With the manned radar station's closure in 1983, the airstrip now provides access to the site for supply runs and to transfer crews.
It is staffed by five or fewer civilian contractors at any one time, and is not open to the public. During the winter months, it may be inaccessible due to the extreme weather conditions at the location.
Facilities and aircraft
Sparrevohn LRRS has one runway designated 16/34 with a gravel surface measuring 4,198 by 151 feet (1,280 x 46 m). For the 12-month period ending July 17, 1978, the airport had 240 general aviation aircraft operations, an average of 20 per month.
References
External links
Airports in the Bethel Census Area, Alaska
Military installations in Alaska
|
```objective-c
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef HTMLElementLookupTrie_h
#define HTMLElementLookupTrie_h
#include "wtf/text/StringImpl.h"
namespace blink {
StringImpl* lookupHTMLTag(const UChar* data, unsigned length);
} // namespace blink
#endif
```
|
```objective-c
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef V8_CODEGEN_COMPILER_H_
#define V8_CODEGEN_COMPILER_H_
#include <forward_list>
#include <memory>
#include "src/base/platform/elapsed-timer.h"
#include "src/codegen/bailout-reason.h"
#include "src/common/globals.h"
#include "src/execution/isolate.h"
#include "src/execution/off-thread-isolate.h"
#include "src/logging/code-events.h"
#include "src/objects/contexts.h"
#include "src/parsing/parse-info.h"
#include "src/parsing/pending-compilation-error-handler.h"
#include "src/utils/allocation.h"
#include "src/zone/zone.h"
namespace v8 {
namespace internal {
// Forward declarations.
class AstRawString;
class BackgroundCompileTask;
class IsCompiledScope;
class JavaScriptFrame;
class OptimizedCompilationInfo;
class OptimizedCompilationJob;
class ParseInfo;
class Parser;
class RuntimeCallStats;
class ScriptData;
struct ScriptStreamingData;
class TimedHistogram;
class UnoptimizedCompilationInfo;
class UnoptimizedCompilationJob;
class WorkerThreadRuntimeCallStats;
using UnoptimizedCompilationJobList =
std::forward_list<std::unique_ptr<UnoptimizedCompilationJob>>;
// The V8 compiler API.
//
// This is the central hub for dispatching to the various compilers within V8.
// Logic for which compiler to choose and how to wire compilation results into
// the object heap should be kept inside this class.
//
// General strategy: Scripts are translated into anonymous functions w/o
// parameters which then can be executed. If the source code contains other
// functions, they might be compiled and allocated as part of the compilation
// of the source code or deferred for lazy compilation at a later point.
class V8_EXPORT_PRIVATE Compiler : public AllStatic {
public:
enum ClearExceptionFlag { KEEP_EXCEPTION, CLEAR_EXCEPTION };
// ===========================================================================
// The following family of methods ensures a given function is compiled. The
// general contract is that failures will be reported by returning {false},
// whereas successful compilation ensures the {is_compiled} predicate on the
// given function holds (except for live-edit, which compiles the world).
static bool Compile(Handle<SharedFunctionInfo> shared,
ClearExceptionFlag flag,
IsCompiledScope* is_compiled_scope);
static bool Compile(Handle<JSFunction> function, ClearExceptionFlag flag,
IsCompiledScope* is_compiled_scope);
static bool CompileOptimized(Handle<JSFunction> function, ConcurrencyMode);
// Collect source positions for a function that has already been compiled to
// bytecode, but for which source positions were not collected (e.g. because
// they were not immediately needed).
static bool CollectSourcePositions(Isolate* isolate,
Handle<SharedFunctionInfo> shared);
V8_WARN_UNUSED_RESULT static MaybeHandle<SharedFunctionInfo>
CompileForLiveEdit(ParseInfo* parse_info, Handle<Script> script,
Isolate* isolate);
// Finalize and install code from previously run background compile task.
static bool FinalizeBackgroundCompileTask(
BackgroundCompileTask* task, Handle<SharedFunctionInfo> shared_info,
Isolate* isolate, ClearExceptionFlag flag);
// Finalize and install optimized code from previously run job.
static bool FinalizeOptimizedCompilationJob(OptimizedCompilationJob* job,
Isolate* isolate);
// Give the compiler a chance to perform low-latency initialization tasks of
// the given {function} on its instantiation. Note that only the runtime will
// offer this chance, optimized closure instantiation will not call this.
static void PostInstantiation(Handle<JSFunction> function);
// ===========================================================================
// The following family of methods instantiates new functions for scripts or
// function literals. The decision whether those functions will be compiled,
// is left to the discretion of the compiler.
//
// Please note this interface returns shared function infos. This means you
// need to call Factory::NewFunctionFromSharedFunctionInfo before you have a
// real function with a context.
// Create a (bound) function for a String source within a context for eval.
V8_WARN_UNUSED_RESULT static MaybeHandle<JSFunction> GetFunctionFromEval(
Handle<String> source, Handle<SharedFunctionInfo> outer_info,
Handle<Context> context, LanguageMode language_mode,
ParseRestriction restriction, int parameters_end_pos,
int eval_scope_position, int eval_position);
struct ScriptDetails {
ScriptDetails()
: line_offset(0), column_offset(0), repl_mode(REPLMode::kNo) {}
explicit ScriptDetails(Handle<Object> script_name)
: line_offset(0),
column_offset(0),
name_obj(script_name),
repl_mode(REPLMode::kNo) {}
int line_offset;
int column_offset;
i::MaybeHandle<i::Object> name_obj;
i::MaybeHandle<i::Object> source_map_url;
i::MaybeHandle<i::FixedArray> host_defined_options;
REPLMode repl_mode;
};
// Create a function that results from wrapping |source| in a function,
// with |arguments| being a list of parameters for that function.
V8_WARN_UNUSED_RESULT static MaybeHandle<JSFunction> GetWrappedFunction(
Handle<String> source, Handle<FixedArray> arguments,
Handle<Context> context, const ScriptDetails& script_details,
ScriptOriginOptions origin_options, ScriptData* cached_data,
v8::ScriptCompiler::CompileOptions compile_options,
v8::ScriptCompiler::NoCacheReason no_cache_reason);
// Create a (bound) function for a String source within a context for eval.
V8_WARN_UNUSED_RESULT static MaybeHandle<JSFunction> GetFunctionFromString(
Handle<Context> context, Handle<i::Object> source,
ParseRestriction restriction, int parameters_end_pos);
// Decompose GetFunctionFromString into two functions, to allow callers to
// deal seperately with a case of object not handled by the embedder.
V8_WARN_UNUSED_RESULT static std::pair<MaybeHandle<String>, bool>
ValidateDynamicCompilationSource(Isolate* isolate, Handle<Context> context,
Handle<i::Object> source_object);
V8_WARN_UNUSED_RESULT static MaybeHandle<JSFunction>
GetFunctionFromValidatedString(Handle<Context> context,
MaybeHandle<String> source,
ParseRestriction restriction,
int parameters_end_pos);
// Create a shared function info object for a String source.
static MaybeHandle<SharedFunctionInfo> GetSharedFunctionInfoForScript(
Isolate* isolate, Handle<String> source,
const ScriptDetails& script_details, ScriptOriginOptions origin_options,
v8::Extension* extension, ScriptData* cached_data,
ScriptCompiler::CompileOptions compile_options,
ScriptCompiler::NoCacheReason no_cache_reason,
NativesFlag is_natives_code);
// Create a shared function info object for a Script source that has already
// been parsed and possibly compiled on a background thread while being loaded
// from a streamed source. On return, the data held by |streaming_data| will
// have been released, however the object itself isn't freed and is still
// owned by the caller.
static MaybeHandle<SharedFunctionInfo> GetSharedFunctionInfoForStreamedScript(
Isolate* isolate, Handle<String> source,
const ScriptDetails& script_details, ScriptOriginOptions origin_options,
ScriptStreamingData* streaming_data);
// Create a shared function info object for the given function literal
// node (the code may be lazily compiled).
template <typename LocalIsolate>
static Handle<SharedFunctionInfo> GetSharedFunctionInfo(
FunctionLiteral* node, Handle<Script> script, LocalIsolate* isolate);
// ===========================================================================
// The following family of methods provides support for OSR. Code generated
// for entry via OSR might not be suitable for normal entry, hence will be
// returned directly to the caller.
//
// Please note this interface is the only part dealing with {Code} objects
// directly. Other methods are agnostic to {Code} and can use an interpreter
// instead of generating JIT code for a function at all.
// Generate and return optimized code for OSR, or empty handle on failure.
V8_WARN_UNUSED_RESULT static MaybeHandle<Code> GetOptimizedCodeForOSR(
Handle<JSFunction> function, BailoutId osr_offset,
JavaScriptFrame* osr_frame);
};
// A base class for compilation jobs intended to run concurrent to the main
// thread. The current state of the job can be checked using {state()}.
class V8_EXPORT_PRIVATE CompilationJob {
public:
enum Status { SUCCEEDED, FAILED };
enum class State {
kReadyToPrepare,
kReadyToExecute,
kReadyToFinalize,
kSucceeded,
kFailed,
};
explicit CompilationJob(State initial_state) : state_(initial_state) {
timer_.Start();
}
virtual ~CompilationJob() = default;
State state() const { return state_; }
protected:
V8_WARN_UNUSED_RESULT base::TimeDelta ElapsedTime() const {
return timer_.Elapsed();
}
V8_WARN_UNUSED_RESULT Status UpdateState(Status status, State next_state) {
if (status == SUCCEEDED) {
state_ = next_state;
} else {
state_ = State::kFailed;
}
return status;
}
private:
State state_;
base::ElapsedTimer timer_;
};
// A base class for unoptimized compilation jobs.
//
// The job is split into two phases which are called in sequence on
// different threads and with different limitations:
// 1) ExecuteJob: Runs concurrently. No heap allocation or handle derefs.
// 2) FinalizeJob: Runs on main thread. No dependency changes.
//
// Either of phases can either fail or succeed.
class UnoptimizedCompilationJob : public CompilationJob {
public:
enum class CanOffThreadFinalize : bool { kYes = true, kNo = false };
UnoptimizedCompilationJob(uintptr_t stack_limit, ParseInfo* parse_info,
UnoptimizedCompilationInfo* compilation_info,
CanOffThreadFinalize can_off_thread_finalize)
: CompilationJob(State::kReadyToExecute),
stack_limit_(stack_limit),
parse_info_(parse_info),
compilation_info_(compilation_info),
can_off_thread_finalize_(can_off_thread_finalize ==
CanOffThreadFinalize::kYes) {}
// Executes the compile job. Can be called on a background thread.
V8_WARN_UNUSED_RESULT Status ExecuteJob();
// Finalizes the compile job. Must be called on the main thread.
V8_WARN_UNUSED_RESULT Status
FinalizeJob(Handle<SharedFunctionInfo> shared_info, Isolate* isolate);
// Finalizes the compile job. Can be called on a background thread.
V8_WARN_UNUSED_RESULT Status FinalizeJob(
Handle<SharedFunctionInfo> shared_info, OffThreadIsolate* isolate);
void RecordCompilationStats(Isolate* isolate) const;
void RecordFunctionCompilation(CodeEventListener::LogEventsAndTags tag,
Handle<SharedFunctionInfo> shared,
Isolate* isolate) const;
ParseInfo* parse_info() const { return parse_info_; }
UnoptimizedCompilationInfo* compilation_info() const {
return compilation_info_;
}
uintptr_t stack_limit() const { return stack_limit_; }
base::TimeDelta time_taken_to_execute() const {
return time_taken_to_execute_;
}
base::TimeDelta time_taken_to_finalize() const {
return time_taken_to_finalize_;
}
bool can_off_thread_finalize() const { return can_off_thread_finalize_; }
protected:
// Overridden by the actual implementation.
virtual Status ExecuteJobImpl() = 0;
virtual Status FinalizeJobImpl(Handle<SharedFunctionInfo> shared_info,
Isolate* isolate) = 0;
virtual Status FinalizeJobImpl(Handle<SharedFunctionInfo> shared_info,
OffThreadIsolate* isolate) = 0;
private:
uintptr_t stack_limit_;
ParseInfo* parse_info_;
UnoptimizedCompilationInfo* compilation_info_;
base::TimeDelta time_taken_to_execute_;
base::TimeDelta time_taken_to_finalize_;
bool can_off_thread_finalize_;
};
// A base class for optimized compilation jobs.
//
// The job is split into three phases which are called in sequence on
// different threads and with different limitations:
// 1) PrepareJob: Runs on main thread. No major limitations.
// 2) ExecuteJob: Runs concurrently. No heap allocation or handle derefs.
// 3) FinalizeJob: Runs on main thread. No dependency changes.
//
// Each of the three phases can either fail or succeed.
class OptimizedCompilationJob : public CompilationJob {
public:
OptimizedCompilationJob(OptimizedCompilationInfo* compilation_info,
const char* compiler_name,
State initial_state = State::kReadyToPrepare)
: CompilationJob(initial_state),
compilation_info_(compilation_info),
compiler_name_(compiler_name) {}
// Prepare the compile job. Must be called on the main thread.
V8_WARN_UNUSED_RESULT Status PrepareJob(Isolate* isolate);
// Executes the compile job. Can be called on a background thread if
// can_execute_on_background_thread() returns true.
V8_WARN_UNUSED_RESULT Status ExecuteJob(RuntimeCallStats* stats);
// Finalizes the compile job. Must be called on the main thread.
V8_WARN_UNUSED_RESULT Status FinalizeJob(Isolate* isolate);
// Report a transient failure, try again next time. Should only be called on
// optimization compilation jobs.
Status RetryOptimization(BailoutReason reason);
// Report a persistent failure, disable future optimization on the function.
// Should only be called on optimization compilation jobs.
Status AbortOptimization(BailoutReason reason);
enum CompilationMode { kConcurrent, kSynchronous };
void RecordCompilationStats(CompilationMode mode, Isolate* isolate) const;
void RecordFunctionCompilation(CodeEventListener::LogEventsAndTags tag,
Isolate* isolate) const;
OptimizedCompilationInfo* compilation_info() const {
return compilation_info_;
}
protected:
// Overridden by the actual implementation.
virtual Status PrepareJobImpl(Isolate* isolate) = 0;
virtual Status ExecuteJobImpl(RuntimeCallStats* stats) = 0;
virtual Status FinalizeJobImpl(Isolate* isolate) = 0;
private:
OptimizedCompilationInfo* compilation_info_;
base::TimeDelta time_taken_to_prepare_;
base::TimeDelta time_taken_to_execute_;
base::TimeDelta time_taken_to_finalize_;
const char* compiler_name_;
};
class FinalizeUnoptimizedCompilationData {
public:
FinalizeUnoptimizedCompilationData(Isolate* isolate,
Handle<SharedFunctionInfo> function_handle,
base::TimeDelta time_taken_to_execute,
base::TimeDelta time_taken_to_finalize)
: time_taken_to_execute_(time_taken_to_execute),
time_taken_to_finalize_(time_taken_to_finalize),
function_handle_(function_handle),
handle_state_(kHandle) {}
FinalizeUnoptimizedCompilationData(OffThreadIsolate* isolate,
Handle<SharedFunctionInfo> function_handle,
base::TimeDelta time_taken_to_execute,
base::TimeDelta time_taken_to_finalize)
: time_taken_to_execute_(time_taken_to_execute),
time_taken_to_finalize_(time_taken_to_finalize),
function_transfer_handle_(isolate->TransferHandle(function_handle)),
handle_state_(kTransferHandle) {}
Handle<SharedFunctionInfo> function_handle() const {
switch (handle_state_) {
case kHandle:
return function_handle_;
case kTransferHandle:
return function_transfer_handle_.ToHandle();
}
}
base::TimeDelta time_taken_to_execute() const {
return time_taken_to_execute_;
}
base::TimeDelta time_taken_to_finalize() const {
return time_taken_to_finalize_;
}
private:
base::TimeDelta time_taken_to_execute_;
base::TimeDelta time_taken_to_finalize_;
union {
Handle<SharedFunctionInfo> function_handle_;
OffThreadTransferHandle<SharedFunctionInfo> function_transfer_handle_;
};
enum { kHandle, kTransferHandle } handle_state_;
};
using FinalizeUnoptimizedCompilationDataList =
std::vector<FinalizeUnoptimizedCompilationData>;
class V8_EXPORT_PRIVATE BackgroundCompileTask {
public:
// Creates a new task that when run will parse and compile the streamed
// script associated with |data| and can be finalized with
// Compiler::GetSharedFunctionInfoForStreamedScript.
// Note: does not take ownership of |data|.
BackgroundCompileTask(ScriptStreamingData* data, Isolate* isolate);
~BackgroundCompileTask();
// Creates a new task that when run will parse and compile the
// |function_literal| and can be finalized with
// Compiler::FinalizeBackgroundCompileTask.
BackgroundCompileTask(
const ParseInfo* outer_parse_info, const AstRawString* function_name,
const FunctionLiteral* function_literal,
WorkerThreadRuntimeCallStats* worker_thread_runtime_stats,
TimedHistogram* timer, int max_stack_size);
void Run();
ParseInfo* info() {
DCHECK_NOT_NULL(info_);
return info_.get();
}
Parser* parser() { return parser_.get(); }
UnoptimizedCompilationJob* outer_function_job() {
return outer_function_job_.get();
}
UnoptimizedCompilationJobList* inner_function_jobs() {
return &inner_function_jobs_;
}
UnoptimizedCompileFlags flags() const { return flags_; }
const UnoptimizedCompileState* compile_state() const {
return &compile_state_;
}
LanguageMode language_mode() { return language_mode_; }
bool finalize_on_background_thread() {
return finalize_on_background_thread_;
}
OffThreadIsolate* off_thread_isolate() { return off_thread_isolate_.get(); }
MaybeHandle<SharedFunctionInfo> outer_function_sfi() {
DCHECK_NOT_NULL(off_thread_isolate_);
return outer_function_sfi_.ToHandle();
}
Handle<Script> script() {
DCHECK_NOT_NULL(off_thread_isolate_);
return script_.ToHandle();
}
FinalizeUnoptimizedCompilationDataList*
finalize_unoptimized_compilation_data() {
return &finalize_unoptimized_compilation_data_;
}
private:
// Data needed for parsing, and data needed to to be passed between thread
// between parsing and compilation. These need to be initialized before the
// compilation starts.
UnoptimizedCompileFlags flags_;
UnoptimizedCompileState compile_state_;
std::unique_ptr<ParseInfo> info_;
std::unique_ptr<Parser> parser_;
// Data needed for finalizing compilation after background compilation.
std::unique_ptr<UnoptimizedCompilationJob> outer_function_job_;
UnoptimizedCompilationJobList inner_function_jobs_;
// Data needed for merging onto the main thread after background finalization.
// TODO(leszeks): When these are available, the above fields are not. We
// should add some stricter type-safety or DCHECKs to ensure that the user of
// the task knows this.
std::unique_ptr<OffThreadIsolate> off_thread_isolate_;
OffThreadTransferMaybeHandle<SharedFunctionInfo> outer_function_sfi_;
OffThreadTransferHandle<Script> script_;
FinalizeUnoptimizedCompilationDataList finalize_unoptimized_compilation_data_;
// Single function data for top-level function compilation.
int start_position_;
int end_position_;
int function_literal_id_;
int stack_size_;
WorkerThreadRuntimeCallStats* worker_thread_runtime_call_stats_;
TimedHistogram* timer_;
LanguageMode language_mode_;
// True if the background compilation should be finalized on the background
// thread. When this is true, the ParseInfo, Parser and compilation jobs are
// freed on the background thread, the outer_function_sfi holds the top-level
// function, and the off_thread_isolate has to be merged into the main-thread
// Isolate.
bool finalize_on_background_thread_;
DISALLOW_COPY_AND_ASSIGN(BackgroundCompileTask);
};
// Contains all data which needs to be transmitted between threads for
// background parsing and compiling and finalizing it on the main thread.
struct ScriptStreamingData {
ScriptStreamingData(
std::unique_ptr<ScriptCompiler::ExternalSourceStream> source_stream,
ScriptCompiler::StreamedSource::Encoding encoding);
~ScriptStreamingData();
void Release();
// Internal implementation of v8::ScriptCompiler::StreamedSource.
std::unique_ptr<ScriptCompiler::ExternalSourceStream> source_stream;
ScriptCompiler::StreamedSource::Encoding encoding;
// Task that performs background parsing and compilation.
std::unique_ptr<BackgroundCompileTask> task;
DISALLOW_COPY_AND_ASSIGN(ScriptStreamingData);
};
} // namespace internal
} // namespace v8
#endif // V8_CODEGEN_COMPILER_H_
```
|
Bahrain participated in the 2018 Asian Games in Jakarta and Palembang, Indonesia from 18 August to 2 September 2018. Bahrain first competed at the Asian Games in 1982 Delhi, and has collected 58 medals in all - 25 gold, 17 silver, and 16 bronze until the last Games in 2014 Incheon.
The chef de mission of the team, Bader Nasser, was the country's flag bearer during the opening ceremony.
Medalists
The following Bahrain competitors won medals at the Games.
Competitors
The following is a list of the number of competitors representing Bahrain that participated at the Games:
Athletics
Bowling
Men
Cycling
Road
Track
Pursuit
Omnium
Equestrian
Jumping
# – indicates that the score of this rider does not count in the team competition, since only the best three results of a team are counted.
Football
Bahrain national men's team drawn in group E at the Games.
Summary
Men's tournament
Roster
Group E
Round of 16
Handball
Bahrain men's team entered the competition and join in group D.
Summary
Men's tournament
Roster
Ali Merza
Hasan Al-Samahiji
Isa Ahmed
Mahmood Salman
Mohamed Abdulredha
Mohamed Merza Ali
Mohamed Ali
Bilal Askani
Hasan Madan
Husain Mohamed
Komail Mahfoodh
Jasim Al-Salatna
Salman Ali
Hasan Al-Fardan
Mohamed Ahmed
Husain Al-Sayyad
Group D
Main round (Group II)
Semifinal
Gold medal game
Ju-jitsu
Bahrain entered the ju-jitsu competition with 5 men's athletes.
Men
Sailing
Men
Sambo
Shooting
Bahrain has including seven shooters (3 men's and 4 women's) under coach Thanin Thaislilp, Iordan Mitov and Valeriy Timokhinto to compete at the Games.
Men
Women
Taekwondo
Kyorugi
Triathlon
Bahrain triathletes competed in the individual event at the Games.
Individual
Wrestling
Bahrain wrestler Adam Batirov will participate in freestyle −74 kg event.
Men's freestyle
References
Nations at the 2018 Asian Games
2018
Asian Games
|
```javascript
/*
* Author: Abdullah A Almsaeed
* Date: 4 Jan 2014
* Description:
* This is a demo file used only for the main dashboard (index.html)
**/
$(function () {
"use strict";
//Make the dashboard widgets sortable Using jquery UI
$(".connectedSortable").sortable({
placeholder: "sort-highlight",
connectWith: ".connectedSortable",
handle: ".box-header, .nav-tabs",
forcePlaceholderSize: true,
zIndex: 999999
});
$(".connectedSortable .box-header, .connectedSortable .nav-tabs-custom").css("cursor", "move");
//jQuery UI sortable for the todo list
$(".todo-list").sortable({
placeholder: "sort-highlight",
handle: ".handle",
forcePlaceholderSize: true,
zIndex: 999999
});
//bootstrap WYSIHTML5 - text editor
$(".textarea").wysihtml5();
$('.daterange').daterangepicker({
ranges: {
'Today': [moment(), moment()],
'Yesterday': [moment().subtract(1, 'days'), moment().subtract(1, 'days')],
'Last 7 Days': [moment().subtract(6, 'days'), moment()],
'Last 30 Days': [moment().subtract(29, 'days'), moment()],
'This Month': [moment().startOf('month'), moment().endOf('month')],
'Last Month': [moment().subtract(1, 'month').startOf('month'), moment().subtract(1, 'month').endOf('month')]
},
startDate: moment().subtract(29, 'days'),
endDate: moment()
}, function (start, end) {
window.alert("You chose: " + start.format('MMMM D, YYYY') + ' - ' + end.format('MMMM D, YYYY'));
});
/* jQueryKnob */
$(".knob").knob();
//jvectormap data
var visitorsData = {
"US": 398, //USA
"SA": 400, //Saudi Arabia
"CA": 1000, //Canada
"DE": 500, //Germany
"FR": 760, //France
"CN": 300, //China
"AU": 700, //Australia
"BR": 600, //Brazil
"IN": 800, //India
"GB": 320, //Great Britain
"RU": 3000 //Russia
};
//World map by jvectormap
$('#world-map').vectorMap({
map: 'world_mill_en',
backgroundColor: "transparent",
regionStyle: {
initial: {
fill: '#e4e4e4',
"fill-opacity": 1,
stroke: 'none',
"stroke-width": 0,
"stroke-opacity": 1
}
},
series: {
regions: [{
values: visitorsData,
scale: ["#92c1dc", "#ebf4f9"],
normalizeFunction: 'polynomial'
}]
},
onRegionLabelShow: function (e, el, code) {
if (typeof visitorsData[code] != "undefined")
el.html(el.html() + ': ' + visitorsData[code] + ' new visitors');
}
});
//Sparkline charts
var myvalues = [1000, 1200, 920, 927, 931, 1027, 819, 930, 1021];
$('#sparkline-1').sparkline(myvalues, {
type: 'line',
lineColor: '#92c1dc',
fillColor: "#ebf4f9",
height: '50',
width: '80'
});
myvalues = [515, 519, 520, 522, 652, 810, 370, 627, 319, 630, 921];
$('#sparkline-2').sparkline(myvalues, {
type: 'line',
lineColor: '#92c1dc',
fillColor: "#ebf4f9",
height: '50',
width: '80'
});
myvalues = [15, 19, 20, 22, 33, 27, 31, 27, 19, 30, 21];
$('#sparkline-3').sparkline(myvalues, {
type: 'line',
lineColor: '#92c1dc',
fillColor: "#ebf4f9",
height: '50',
width: '80'
});
//The Calender
$("#calendar").datepicker();
//SLIMSCROLL FOR CHAT WIDGET
$('#chat-box').slimScroll({
height: '250px'
});
/* Morris.js Charts */
// Sales chart
var area = new Morris.Area({
element: 'revenue-chart',
resize: true,
data: [
{y: '2011 Q1', item1: 2666, item2: 2666},
{y: '2011 Q2', item1: 2778, item2: 2294},
{y: '2011 Q3', item1: 4912, item2: 1969},
{y: '2011 Q4', item1: 3767, item2: 3597},
{y: '2012 Q1', item1: 6810, item2: 1914},
{y: '2012 Q2', item1: 5670, item2: 4293},
{y: '2012 Q3', item1: 4820, item2: 3795},
{y: '2012 Q4', item1: 15073, item2: 5967},
{y: '2013 Q1', item1: 10687, item2: 4460},
{y: '2013 Q2', item1: 8432, item2: 5713}
],
xkey: 'y',
ykeys: ['item1', 'item2'],
labels: ['Item 1', 'Item 2'],
lineColors: ['#a0d0e0', '#3c8dbc'],
hideHover: 'auto'
});
var line = new Morris.Line({
element: 'line-chart',
resize: true,
data: [
{y: '2011 Q1', item1: 2666},
{y: '2011 Q2', item1: 2778},
{y: '2011 Q3', item1: 4912},
{y: '2011 Q4', item1: 3767},
{y: '2012 Q1', item1: 6810},
{y: '2012 Q2', item1: 5670},
{y: '2012 Q3', item1: 4820},
{y: '2012 Q4', item1: 15073},
{y: '2013 Q1', item1: 10687},
{y: '2013 Q2', item1: 8432}
],
xkey: 'y',
ykeys: ['item1'],
labels: ['Item 1'],
lineColors: ['#efefef'],
lineWidth: 2,
hideHover: 'auto',
gridTextColor: "#fff",
gridStrokeWidth: 0.4,
pointSize: 4,
pointStrokeColors: ["#efefef"],
gridLineColor: "#efefef",
gridTextFamily: "Open Sans",
gridTextSize: 10
});
//Donut Chart
var donut = new Morris.Donut({
element: 'sales-chart',
resize: true,
colors: ["#3c8dbc", "#f56954", "#00a65a"],
data: [
{label: "Download Sales", value: 12},
{label: "In-Store Sales", value: 30},
{label: "Mail-Order Sales", value: 20}
],
hideHover: 'auto'
});
//Fix for charts under tabs
$('.box ul.nav a').on('shown.bs.tab', function () {
area.redraw();
donut.redraw();
line.redraw();
});
/* The todo list plugin */
$(".todo-list").todolist({
onCheck: function (ele) {
window.console.log("The element has been checked");
return ele;
},
onUncheck: function (ele) {
window.console.log("The element has been unchecked");
return ele;
}
});
});
```
|
```html
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Header <boost/algorithm/cxx11/partition_copy.hpp></title>
<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
<link rel="home" href="../../../../index.html" title="The Boost Algorithm Library">
<link rel="up" href="../../../../algorithm/reference.html" title="Reference">
<link rel="prev" href="../../../../boost/algorithm/one_of_equal_idp47304944.html" title="Function template one_of_equal">
<link rel="next" href="../../../../boost/algorithm/partition_copy_idp47313456.html" title="Function template partition_copy">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
<td align="center"><a href="../../../../../../../../index.html">Home</a></td>
<td align="center"><a href="../../../../../../../../libs/libraries.htm">Libraries</a></td>
<td align="center"><a href="path_to_url">People</a></td>
<td align="center"><a href="path_to_url">FAQ</a></td>
<td align="center"><a href="../../../../../../../../more/index.htm">More</a></td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="../../../../boost/algorithm/one_of_equal_idp47304944.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../../algorithm/reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../../../boost/algorithm/partition_copy_idp47313456.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="header.boost.algorithm.cxx11.partition_copy_hpp"></a>Header <<a href="../../../../../../../../boost/algorithm/cxx11/partition_copy.hpp" target="_top">boost/algorithm/cxx11/partition_copy.hpp</a>></h3></div></div></div>
<p>Copy a subset of a sequence to a new sequence. </p>
<p>Marshall Clow </p>
<p>
</p>
<pre class="synopsis"><span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span>
<span class="keyword">namespace</span> <span class="identifier">algorithm</span> <span class="special">{</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator<span class="special">,</span> <span class="keyword">typename</span> OutputIterator1<span class="special">,</span>
<span class="keyword">typename</span> OutputIterator2<span class="special">,</span> <span class="keyword">typename</span> UnaryPredicate<span class="special">></span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="identifier">OutputIterator1</span><span class="special">,</span> <span class="identifier">OutputIterator2</span> <span class="special">></span>
<a class="link" href="../../../../boost/algorithm/partition_copy_idp47313456.html" title="Function template partition_copy"><span class="identifier">partition_copy</span></a><span class="special">(</span><span class="identifier">InputIterator</span><span class="special">,</span> <span class="identifier">InputIterator</span><span class="special">,</span> <span class="identifier">OutputIterator1</span><span class="special">,</span>
<span class="identifier">OutputIterator2</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span><span class="special">)</span><span class="special">;</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Range<span class="special">,</span> <span class="keyword">typename</span> OutputIterator1<span class="special">,</span>
<span class="keyword">typename</span> OutputIterator2<span class="special">,</span> <span class="keyword">typename</span> UnaryPredicate<span class="special">></span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="identifier">OutputIterator1</span><span class="special">,</span> <span class="identifier">OutputIterator2</span> <span class="special">></span>
<a class="link" href="../../../../boost/algorithm/partition_copy_idp47324096.html" title="Function template partition_copy"><span class="identifier">partition_copy</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">&</span><span class="special">,</span> <span class="identifier">OutputIterator1</span><span class="special">,</span> <span class="identifier">OutputIterator2</span><span class="special">,</span>
<span class="identifier">UnaryPredicate</span><span class="special">)</span><span class="special">;</span>
<span class="special">}</span>
<span class="special">}</span></pre>
</div>
<table xmlns:rev="path_to_url~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
file LICENSE_1_0.txt or copy at <a href="path_to_url" target="_top">path_to_url
</p>
</div></td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="../../../../boost/algorithm/one_of_equal_idp47304944.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../../algorithm/reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../../../boost/algorithm/partition_copy_idp47313456.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
```
|
```objective-c
#pragma once
#include "config.h"
#include <Access/Common/AccessFlags.h>
#include <Interpreters/Context.h>
#include <Interpreters/parseColumnsListForTableFunction.h>
#include <TableFunctions/ITableFunction.h>
#include <TableFunctions/TableFunctionObjectStorage.h>
#include <Storages/ObjectStorage/StorageObjectStorage.h>
#include <Storages/ObjectStorage/DataLakes/IStorageDataLake.h>
#include <Storages/ObjectStorage/DataLakes/IcebergMetadata.h>
#include <TableFunctions/TableFunctionFactory.h>
namespace DB
{
template <typename Name, typename Storage, typename TableFunction>
class ITableFunctionDataLake : public TableFunction
{
public:
static constexpr auto name = Name::name;
std::string getName() const override { return name; }
protected:
StoragePtr executeImpl(
const ASTPtr & /* ast_function */,
ContextPtr context,
const std::string & table_name,
ColumnsDescription cached_columns,
bool /*is_insert_query*/) const override
{
ColumnsDescription columns;
auto configuration = TableFunction::getConfiguration();
if (configuration->structure != "auto")
columns = parseColumnsListFromString(configuration->structure, context);
else if (!cached_columns.empty())
columns = cached_columns;
StoragePtr storage = Storage::create(
configuration, context, StorageID(TableFunction::getDatabaseName(), table_name),
columns, ConstraintsDescription{}, String{}, std::nullopt, LoadingStrictnessLevel::CREATE);
storage->startup();
return storage;
}
const char * getStorageTypeName() const override { return name; }
ColumnsDescription getActualTableStructure(ContextPtr context, bool is_insert_query) const override
{
auto configuration = TableFunction::getConfiguration();
if (configuration->structure == "auto")
{
context->checkAccess(TableFunction::getSourceAccessType());
auto object_storage = TableFunction::getObjectStorage(context, !is_insert_query);
return Storage::getTableStructureFromData(object_storage, configuration, std::nullopt, context);
}
else
{
return parseColumnsListFromString(configuration->structure, context);
}
}
void parseArguments(const ASTPtr & ast_function, ContextPtr context) override
{
auto configuration = TableFunction::getConfiguration();
configuration->format = "Parquet";
/// Set default format to Parquet if it's not specified in arguments.
TableFunction::parseArguments(ast_function, context);
}
};
struct TableFunctionIcebergName
{
static constexpr auto name = "iceberg";
};
struct TableFunctionDeltaLakeName
{
static constexpr auto name = "deltaLake";
};
struct TableFunctionHudiName
{
static constexpr auto name = "hudi";
};
#if USE_AWS_S3
#if USE_AVRO
using TableFunctionIceberg = ITableFunctionDataLake<TableFunctionIcebergName, StorageIceberg, TableFunctionS3>;
#endif
#if USE_PARQUET
using TableFunctionDeltaLake = ITableFunctionDataLake<TableFunctionDeltaLakeName, StorageDeltaLake, TableFunctionS3>;
#endif
using TableFunctionHudi = ITableFunctionDataLake<TableFunctionHudiName, StorageHudi, TableFunctionS3>;
#endif
}
```
|
```c++
/*******************************************************************************
*
*
* 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.
*******************************************************************************/
#ifndef MEMORY_MAP_MANAGER_HPP
#define MEMORY_MAP_MANAGER_HPP
#include "common/c_types_map.hpp"
#include "common/nstl.hpp"
#include "common/utils.hpp"
#include <functional>
#include <mutex>
#include <unordered_map>
namespace dnnl {
namespace impl {
// Service class to support RAII semantics with parameterized "finalization".
template <typename key_type, typename tag_type = void>
struct memory_map_manager_t : public c_compatible {
using unmap_func_type = std::function<status_t(stream_t *, void *)>;
memory_map_manager_t() = default;
~memory_map_manager_t() { assert(entries_.empty()); }
static memory_map_manager_t &instance() {
static memory_map_manager_t _instancwe;
return _instancwe;
}
status_t map(const memory_storage_t *mem_storage, stream_t *stream,
void *mapped_ptr, const unmap_func_type &unmap_func) {
std::lock_guard<std::mutex> guard(mutex_);
assert(entries_.count(mem_storage) == 0);
entries_[mem_storage] = entry_t(stream, mapped_ptr, unmap_func);
return status::success;
}
status_t unmap(const memory_storage_t *mem_storage, stream_t *stream,
void *mapped_ptr) {
std::lock_guard<std::mutex> guard(mutex_);
auto it = entries_.find(mem_storage);
if (it == entries_.end()) return status::runtime_error;
CHECK(it->second.unmap(stream, mapped_ptr));
entries_.erase(it);
return status::success;
}
private:
DNNL_DISALLOW_COPY_AND_ASSIGN(memory_map_manager_t);
struct entry_t {
entry_t() = default;
entry_t(stream_t *stream, void *mapped_ptr,
const unmap_func_type &unmap_func)
: stream(stream), mapped_ptr(mapped_ptr), unmap_func(unmap_func) {}
status_t unmap(stream_t *unmap_stream, void *unmap_mapped_ptr) {
if (unmap_mapped_ptr != mapped_ptr) return status::runtime_error;
return unmap_func(unmap_stream, unmap_mapped_ptr);
}
stream_t *stream = nullptr;
void *mapped_ptr = nullptr;
unmap_func_type unmap_func;
};
std::unordered_map<const memory_storage_t *, entry_t> entries_;
std::mutex mutex_;
};
} // namespace impl
} // namespace dnnl
#endif
```
|
Glyptostrobus is a small genus of conifers in the family Cupressaceae (formerly in the family Taxodiaceae). The sole living species, Glyptostrobus pensilis, is native to subtropical southeastern China, from Fujian west to southeast Yunnan, and also very locally in northern Vietnam and Borikhamxai Province of eastern Laos near the Vietnam border.
The genus formerly had a much wider range, covering most of the Northern Hemisphere, including the high Arctic in the Paleocene and Eocene. The oldest known fossils are late Cretaceous in age, found in North America. It contributed greatly to the coal swamps of the Cenozoic era. It was reduced to its current range before and during the Pleistocene ice ages.
G. pensilis is a medium-sized to large tree, reaching tall and with a trunk diameter of up to , possibly more. The leaves are deciduous, spirally arranged but twisted at the base to lie in two horizontal ranks, long and broad, but long and scale-like on shoots in the upper crown. The cones are green maturing yellow-brown, pear-shaped, long and diameter, broadest near the apex. They open when mature to release the small, long, winged seeds.
It typically grows in river banks, ponds and swamps, growing in water up to deep. Like the related genus Taxodium, it produces 'cypress knees' when growing in water, thought to help transport oxygen to the roots.
The species is nearly extinct in the wild due to overcutting for its valuable decay-resistant, scented wood, but it is also fairly widely planted along the banks of rice paddies where its roots help to stabilise the banks by reducing soil erosion.
References
External links
Gymnosperm Database: Glyptostrobus
Arboretum de Villardebelle: photo of cone
Cupressaceae
Conifer genera
Deciduous conifers
|
Capivari do Sul is a municipality in the state of Rio Grande do Sul, Brazil.
See also
List of municipalities in Rio Grande do Sul
References
Municipalities in Rio Grande do Sul
|
```objective-c
// Specific definitions for generic platforms -*- C++ -*-
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// Free Software Foundation; either version 2, or (at your option)
// any later version.
// 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
// with this library; see the file COPYING. If not, write to the Free
// Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
// USA.
// As a special exception, you may use this file as part of a free software
// library without restriction. Specifically, if other files instantiate
// templates or use macros or inline functions from this file, or you compile
// this file and link it with other files to produce an executable, this
// file does not by itself cause the resulting executable to be covered by
// invalidate any other reasons why the executable file might be covered by
#ifndef _GLIBCPP_OS_DEFINES
# define _GLIBCPP_OS_DEFINES
// System-specific #define, typedefs, corrections, etc, go here. This
// file will come before all others.
#endif
```
|
```css
@tailwind base;
@tailwind components;
@tailwind utilities;
```
|
In computer security, a billion laughs attack is a type of denial-of-service (DoS) attack which is aimed at parsers of XML documents.
It is also referred to as an XML bomb or as an exponential entity expansion attack.
Details
The example attack consists of defining 10 entities, each defined as consisting of 10 of the previous entity, with the document consisting of a single instance of the largest entity, which expands to one billion copies of the first entity.
In the most frequently cited example, the first entity is the string "lol", hence the name "billion laughs". At the time this vulnerability was first reported, the computer memory used by a billion instances of the string "lol" would likely exceed that available to the process parsing the XML.
While the original form of the attack was aimed specifically at XML parsers, the term may be applicable to similar subjects as well.
The problem was first reported as early as 2002, but began to be widely addressed in 2008.
Defenses against this kind of attack include capping the memory allocated in an individual parser if loss of the document is acceptable, or treating entities symbolically and expanding them lazily only when (and to the extent) their content is to be used.
Code example
<?xml version="1.0"?>
<!DOCTYPE lolz [
<!ENTITY lol "lol">
<!ELEMENT lolz (#PCDATA)>
<!ENTITY lol1 "&lol;&lol;&lol;&lol;&lol;&lol;&lol;&lol;&lol;&lol;">
<!ENTITY lol2 "&lol1;&lol1;&lol1;&lol1;&lol1;&lol1;&lol1;&lol1;&lol1;&lol1;">
<!ENTITY lol3 "&lol2;&lol2;&lol2;&lol2;&lol2;&lol2;&lol2;&lol2;&lol2;&lol2;">
<!ENTITY lol4 "&lol3;&lol3;&lol3;&lol3;&lol3;&lol3;&lol3;&lol3;&lol3;&lol3;">
<!ENTITY lol5 "&lol4;&lol4;&lol4;&lol4;&lol4;&lol4;&lol4;&lol4;&lol4;&lol4;">
<!ENTITY lol6 "&lol5;&lol5;&lol5;&lol5;&lol5;&lol5;&lol5;&lol5;&lol5;&lol5;">
<!ENTITY lol7 "&lol6;&lol6;&lol6;&lol6;&lol6;&lol6;&lol6;&lol6;&lol6;&lol6;">
<!ENTITY lol8 "&lol7;&lol7;&lol7;&lol7;&lol7;&lol7;&lol7;&lol7;&lol7;&lol7;">
<!ENTITY lol9 "&lol8;&lol8;&lol8;&lol8;&lol8;&lol8;&lol8;&lol8;&lol8;&lol8;">
]>
<lolz>&lol9;</lolz>
When an XML parser loads this document, it sees that it includes one root element, "lolz", that contains the text "&lol9;". However, "&lol9;" is a defined entity that expands to a string containing ten "&lol8;" strings. Each "&lol8;" string is a defined entity that expands to ten "&lol7;" strings, and so on. After all the entity expansions have been processed, this small (< 1 KB) block of XML will actually contain 109 = a billion "lol"s, taking up almost 3 gigabytes of memory.
Variations
The billion laughs attack described above can take an exponential amount of space or time. The quadratic blowup variation causes quadratic growth in resource requirements by simply repeating a large entity over and over again, to avoid countermeasures that detect heavily nested entities. (See computational complexity theory for comparisons of different growth classes.)
A "billion laughs" attack could exist for any file format that can contain macro expansions, for example this YAML bomb:
a: &a ["lol","lol","lol","lol","lol","lol","lol","lol","lol"]
b: &b [*a,*a,*a,*a,*a,*a,*a,*a,*a]
c: &c [*b,*b,*b,*b,*b,*b,*b,*b,*b]
d: &d [*c,*c,*c,*c,*c,*c,*c,*c,*c]
e: &e [*d,*d,*d,*d,*d,*d,*d,*d,*d]
f: &f [*e,*e,*e,*e,*e,*e,*e,*e,*e]
g: &g [*f,*f,*f,*f,*f,*f,*f,*f,*f]
h: &h [*g,*g,*g,*g,*g,*g,*g,*g,*g]
i: &i [*h,*h,*h,*h,*h,*h,*h,*h,*h]
This crashed earlier versions of Go because the Go YAML processor (contrary to the YAML spec) expands references as if they were macros. The Go YAML processor was modified to fail parsing if the result object becomes too large.
Enterprise software like Kubernetes has been affected by this attack through its YAML parser. For this reason, either a parser with intentionally limited capabilities is preferred (like StrictYAML) or file formats that do not allow references are often preferred for data arriving from untrusted sources.
See also
Fork bomb: a similar method to exhaust a system's resources through recursion
Zip bomb: a similar attack utilizing zip archives
XML external entity attack: an XML attack to return arbitrary server files
Document type definition: a template for validating XML files
References
Algorithmic complexity attacks
Denial-of-service attacks
XML
|
Robert Lee Collins (June 1, 1930 – October 21, 2011) was an American television director and screenwriter who created the American police procedural television series Police Woman, which starred Angie Dickinson.
Collins also was about to direct Star Trek: Phase II, but was changed due to the basis of the motion picture and was replaced by director, Robert Wise. His other credits includes, Police Story, Marcus Welby, M.D., The Bold Ones: The New Doctors, Cannon and The Name of the Game. In 1975, Collins was nominated for an Primetime Emmy for Outstanding Writing in a Drama Series. He died in October 2011 of cardiopulmonary arrest in Van Nuys, California, at the age of 81.
References
External links
1930 births
2011 deaths
American male screenwriters
American film directors
American television directors
American male television writers
American directors
People from Los Angeles
|
Dakin Evans "Dusty" Miller (September 3, 1876 – April 19, 1950) was an American professional baseball player. He played 51 games in Major League Baseball for the Chicago Orphans in 1902, primarily as a left fielder.
External links
1876 births
1950 deaths
Major League Baseball left fielders
Chicago Orphans players
Kansas City Blues (baseball) players
Denver Grizzlies (baseball) players
Kansas City Blue Stockings players
Omaha Indians players
Des Moines Prohibitionists players
Omaha Rangers players
Seattle Siwashes players
Wichita Jobbers players
Little Rock Travelers players
Dubuque Dubs players
Baseball players from Iowa
|
Ibrahim Abd al-Qadir al-Mazini (, ; August 19, 1889 or 1890 – July 12 or August 10, 1949) was an Egyptian poet, novelist, journalist, and translator.
Early life
Al-Mazini was born in Cairo, to a well-off family, but grew up in relative poverty after his father died while he was young. He registered in 1906 at Cairo's Teacher's College, despite having no great interest in teaching; he had been unable to stomach the anatomical dissections at the medical school, and the tuition at the law school was too expensive. Nonetheless, the school contributed greatly to his literary development, since in the years prior to the founding of the Egyptian University, the Teacher's College was one of the few accessible avenues for students with literary ambitions, and its students included a number who would become prominent in Egyptian literature, including Abd Al-Rahman Shukri, who became an important influence and associate of al-Mazini's. Around the same time, al-Mazini also met Abbas al-Aqqad and Muhammad al-Sibai. Al-Mazini's first literary reviews were published in publications edited by al-Aqqad, and al-Sibai introduced him to English literature and to the classical poet Ibn al-Rumi, both of which would become major influences on al-Mazini's poetry.
Poet and critic
Graduating from the Teacher's College in 1909, al-Mazini taught first at the Khedivial School, and then at Dar al-Ulum, from which he resigned in 1914, after possibly having been reassigned (and assigned to teach a minor subject) due to one of his critiques offending , the Minister of Education. From 1914 to 1918 he taught at a series of private schools, sometimes the same ones as al-Aqqad. During this period, his two collections of poetry were published, one in 1913, and one in 1917. Though influential for the Egyptian revivalist poetry of the 1910s, his poetry was accused of being too heavily based on both European and classical influences, an accusation he didn't greatly dispute; and after 1917 he published very little additional poetry.
Unsatisfied with teaching, al-Mazini became a full-time journalist in 1918, writing initially for the newspaper Wad in Alexandria, and then for a series of newspapers with varying political perspectives, generally united only in being opposed to the Wafd Party. He continued to publish literary criticism, and in 1921 co-wrote the critical work al-Diwan with al-Aqqad, which included an attack on the conservative literary establishment represented by writers such as Mustafa Lutfi el-Manfaluti and Ahmed Shawqi. Al-Mazini, al-Aqqad, and Shurki became known as the Diwan Group, which was greatly influenced by English lyric poetry, and emphasized poetry that conveyed the poet's experience and emotion, as well as avoiding social and political commentary.
Novelist and essayist
Al-Mazini began writing prose in the mid-1920s, and completed his first novel, Ibrahim al-Katib (Ibrahim the Writer), in 1925–26, though it didn't receive publication until 1931. Upon its publication, it was considered a landmark in Egyptian literature, "probably the first novel to depend primarily for its well-recognized fame on its artistic value", rather than for its social, political, or historical views, as was common in Egyptian literature of the time. He was among the contributors of Al Siyasa, newspaper of the Liberal Constitutional Party.
Despite the novel's positive reception, al-Mazini forsook novel-writing for political and narrative essay-writing from 1931 to 1943; some of his writings from this period were published in two collections, Khuyut al-Ankabut (Spider Webs, 1935) and Fi al-tariq (On the Road, 1937). He also during that time helped found the Egyptian Journalists Syndicate in 1941, and served as its first vice-president. The break in his novel-writing career may have been related to a plagiarism controversy, as Ibrahim al-Katib contained several pages from a Russian novel al-Mazini had previously translated.
In 1943, he published a sequel to Ibrahim al-Katib, entitled Ibrahim al-thani (Ibrahim the Second), as well as three additional novels in quick succession.
Late in life, he was elected to both the Arab Academy of Damascus and Academy of the Arabic Language in Cairo.
References
External links
1890 births
1949 deaths
Egyptian journalists
Egyptian literary critics
Egyptian novelists
Egyptian male poets
Egyptian translators
Writers from Cairo
20th-century Egyptian poets
20th-century novelists
20th-century translators
20th-century male writers
20th-century journalists
Members of Academy of the Arabic Language in Cairo
|
The 2017 Coastal Carolina Chanticleers football team represented Coastal Carolina University in the 2017 NCAA Division I FBS football season. The Chanticleers played their home games at the Brooks Stadium in Conway, South Carolina, and competed in the Sun Belt Conference. They were led by interim head coach Jamey Chadwell, who also served as offense coordinator, while permanent head coach Joe Moglia was on leave due to medical issues. The season marked the Chanticleers' first year in the Sun Belt and the FBS, and their second of a two year transition period. They would not become bowl-eligible until the 2018 season. They finished the season 3–9, 2–6 in Sun Belt play to finish in a tie for 10th place.
Schedule
Coastal Carolina announced its 2017 football schedule on March 1, 2017. The 2017 schedule consisted of six home and away games in the regular season. The Chanticleers hosted Sun Belt foes Georgia Southern, Georgia State, Texas State, and Troy, and traveled to Appalachian State, Arkansas State, Idaho, and Louisiana–Monroe
The Chanticleers hosted two of the four non-conference opponents, Massachusetts, who was independent from a conference and Western Illinois from the FCS Missouri Valley Football Conference, and traveled to Arkansas from the Southeastern Conference and UAB from Conference USA.
Schedule Source:
Game summaries
UMass
At UAB
Western Illinois
At Louisiana–Monroe
Georgia State
At Arkansas State
At Appalachian State
Texas State
At Arkansas
Troy
At Idaho
Georgia Southern
References
Coastal Carolina
Coastal Carolina Chanticleers football seasons
Coastal Carolina Chanticleers football
|
Tourism in Brisbane is an important industry for the Queensland economy, being the third-most popular destination for international tourists after Sydney and Melbourne.
Brisbane is a popular tourist destination, serving as a gateway to the state of Queensland, particularly to the Gold Coast and the Sunshine Coast, which are home to numerous popular surf beaches, located immediately south and north of Brisbane respectively. Major landmarks and attractions include South Bank Parklands, the Queensland Cultural Centre (including the Queensland Museum, Queensland Art Gallery, Gallery of Modern Art, Queensland Performing Arts Centre and State Library of Queensland), City Hall, the Story Bridge, the City Botanic Gardens and Parliament of Queensland, the Howard Smith Wharves, ANZAC Square, Fortitude Valley (including James Street and Chinatown), West End, the Teneriffe woolstores precinct, Roma Street Parkland, New Farm Park (including the Brisbane Powerhouse), St John's Cathedral, the Lone Pine Koala Sanctuary, the Mount Coot-tha Lookout and Botanic Gardens, the D'Aguilar Range and National Park, the Brisbane River and its Riverwalk network, as well as Moreton Bay (including Moreton, North Stradbroke and Bribie islands, and coastal suburbs such as Shorncliffe, Wynnum and those on the Redcliffe Peninsula).
City landmarks
Story Bridge
The Story Bridge is a Brisbane icon, designed by Dr. John Bradfield, designer of the Sydney Harbour Bridge. It spans Petrie Bight from Kangaroo Point to Fortitude Valley and totals meters in length.
Tourist groups run the Story Bridge Adventure Climb as well as the Abseil Climb, which provides daylight, twilight, and night tours.
Brisbane City Hall
Brisbane's most famous landmark is Australia's largest and grandest city hall. It is home to the Museum of Brisbane and features the circular Concert Hall and a world-famous grand piano organ. Free tours are available of the city hall and its clock tower.
The Brisbane City Hall contains the re-established historic Tudor-style Shingle Inn restaurant, with its original 1936 Tudor furnishing and fittings restored.
Kangaroo Point Cliffs
The Kangaroo Point Cliffs extend south from just north of the former Naval Bridge Depot to the former South Brisbane Dry Dock, west of the Captain Cook Bridge. The rock comprising the cliffs was formed about 230 million years ago, but the cliffs as they are today were created by convicts quarrying the stone for the early colony. The cliff are popular with rock climbers, and the park and gardens below are available for BBQs and picnics.
Fortitude Valley
The Valley experienced an urban renaissance in the 1980s and 1990s, when young people flocked to new nightclubs, some in place of the brothels and illegal gambling joints of an earlier era. As more people lived in the suburb, social and religious developmental trends explain the present diverse nature of The Valley, characterised by commercial buildings, hotels and churches side by side with residential buildings. James Street is a popular shopping street that straddles Fortitude Valley and the adjoing suburb of New Farm.
Treasury Building
The Conrad Treasury Casino, formerly the State Government of Queensland Treasury Building, is situated at 1-27 Queen St, right up at the top of the city near the Victoria Bridge. It was built on a site that had been earmarked for Government use since around 1825. Three stages of construction went into the completed building, starting with the William Street frontage. Completed, occupied and opened officially in 1928 at a final cost of £137,817, it provided expansive space for its Treasury Building tenants. As State Government Departments moved into the nearby Executive Building in the 1980s, the Treasury Building and adjacent Land Administration Building were sold, and consequently redeveloped as the Conrad Treasury Casino and Hotel precinct.
The Gabba
One of Australia's most famous sports stadiums, the Gabba was established in 1895 and hosts a number of sports including AFL, cricket, rugby league, rugby union, and baseball, as well as athletics and concerts. Its current seating capacity is 42,000.
Lang Park
Lang Park, also known as Suncorp Stadium, is a major sports stadium and is considered the best rectangular stadium in Australia. It was established in 1914 on the site of a former cemetery. The stadium hosts mainly rugby league and football, and is a venue of the State of Origin. Its current seating capacity is 52,500.
St John's Cathedral
St John's Cathedral is a Medieval gothic revival cathedral, and an international centre of pilgrimage attracting over 20,000 visitors annually from around the world. The cathedral is the centre for big diocesan events, and is a major centre for the arts and music with its own orchestra. St John's also has the largest cathedral organ in Australia, which hosts many concerts throughout the year.
Customs House
The Customs House is a Brisbane landmark known for its distinctive copper dome. Originally constructed for the government, there is now a restaurant and function centre within the building, and regular concerts and art exhibitions are also held here.
Cultural attractions
Queensland Gallery of Modern Art
The Queensland Gallery of Modern Art has a total floor area of . The Gallery holds mostly Queensland arts as well as a variety of artworks from around the world.
Queensland Museum
The Queensland Museum has various human and natural historical artefacts. It is located within the Queensland Cultural Centre at South Bank and has various cafes and restaurants within and surrounding its location across the Brisbane River from the Brisbane CBD.
Queensland Performing Arts Centre
Also located within the Entertainment District of South Bank, the Queensland Performing Arts Centre has a number of theatres and auditoriums showcasing various famous shows and operas annually. Some of the most recognized shows featured at the centre include Mamma Mia!, The Phantom of the Opera, Wicked, Jersey Boys, and International Gala.
State Library of Queensland
The State Library of Queensland is Queensland's largest library, and contains extensive historical and archive materials.
Museum of Brisbane
The Museum of Brisbane is the City of Brisbane's official museum and is located in Brisbane City Hall. It features a changing exhibition program that celebrates Brisbane through social history, visual arts, craft and design.
Queensland Maritime Museum
The Queensland Maritime Museum is located adjacent to South Bank Parklands.
Parks and outdoor attractions
Brisbane's major parklands include the riverside City Botanic Gardens at Gardens Point, Roma Street Parkland, the 27-hectare Victoria Park at Spring Hill and Herston, South Bank Parklands along the river at South Bank, the Brisbane Botanic Gardens at Mount Coot-tha and the riverside New Farm Park at New Farm.
There are many national parks surrounding the Brisbane metropolitan area. The D'Aguilar National Park is a major national park along the northwest of the metropolitan area in the D'Aguilar Range. The Glass House Mountains National Park is located to the north of the metropolitan area in the Glass House Mountains and provides green space between the Brisbane metropolitan area and the Sunshine Coast. The Tamborine National Park at Tamborine Mountain is located in the Gold Coast hinterland to the south of the metropolitan area.
The eastern metropolitan area is built along the Moreton Bay Marine Park, encompassing Moreton Bay. Significant areas of Moreton, North Stradbroke and Bribie islands also covered by the Moreton Island National Park, Naree Budjong Djara National Park and the Bribie Island National Park respectively. The Boondall Wetlands in the suburb of Boondall include 1100 hectares of wetlands which are home to mangroves and shorebirds as well as walking tracks.
Mountains and national parks
There are many national parks surrounding the Brisbane metropolitan area which are popular recreational attractions for hiking and bushwalking. The D'Aguilar National Park runs along the northwest of the metropolitan area in the D'Aguilar Range, and contains popular bushwalking and hiking peaks at Mount Nebo, Camp Mountain, Mount Pleasant, Mount Glorious, Mount Samson and Mount Mee. The Glass House Mountains National Park is located to the north of the metropolitan area in the Glass House Mountains between it and that of the Sunshine Coast. The Tamborine National Park at Tamborine Mountain is located in the Gold Coast hinterland to the south of the metropolitan area. Moreton, North Stradbroke and Bribie islands are substantially covered by the Moreton Island National Park, Naree Budjong Djara National Park and the Bribie Island National Park respectively. The Boondall Wetlands in the suburb of Boondall are protected mangrove wetlands with floating walking trails.
Mount Coot-tha
The suburb Mount Coot-tha Reserve contains the Mount Coot-tha Botanic Gardens which house the Sir Thomas Brisbane Planetarium and the "Tsuki-yama-chisen" Japanese Garden (formerly of the Japanese Government Pavilion of Brisbane's World Expo '88). Atop the mountain is the Mount Coot-tha Lookout, providing views of the metropolitan area and Moreton Bay.
South Bank Parklands
South Bank Parklands attractions include the Wheel of Brisbane (a large ferris wheel), a swimming lagoon with sandy beaches, the South Bank Arbour, rainforest walks, picnic areas and a picturesque riverfront promenade. Entertainment venues at South Bank Parklands include the Queensland Conservatorium Griffith University and Suncorp Piazza. South Bank Parklands are also home to the Lifestyle Markets on Fridays (5pm-10pm), Saturdays (11am-5pm) and Sundays (9am-5pm).
City Botanic Gardens
The City Botanic Gardens include Brisbane's most mature gardens, with many rare and unusual botanic species. In particular the Gardens feature a special collection of cycads, palms, figs and bamboo. The Gardens are located at Gardens Point, to the south-east of the CBD, within walking distance of the city centre.
New Farm Park
New Farm Park is a large heritage-listed riverfront public park covering . It is located at the southeastern end of the New Farm peninsula within a bend in the Brisbane River. The Powerhouse arts centre is at the eastern end of the park. The park also includes the New Farm Park ferry wharf and links to the Brisbane Riverwalk from Newstead to Toowong. It is one of Brisbane's most popular parklands and tourist attractions.
Roma Street Parkland
Roma Street Parkland is the world's largest subtropical garden in a city centre. The parkland features a variety of themed gardens and recreational areas, with a web of pathways and boardwalks traversing cascading waterways and rocky outcrops, and in situ artworks by 16 local artists. Roma Street Parkland also has an open air amphitheatre (which was previously called the Albert Park Amphitheatre).
Moreton Bay
Moreton Bay and its marine park is also a major attraction, and its three primary islands Moreton Island, North Stradbroke Island and Bribie Island, accessible by ferry, contain popular surf beaches and resorts. Tangalooma resort on Moreton Island is popular for its nightly wild dolphin feeding attraction, and for operating Australia's longest running whale watching cruises. Beachside suburbs such as those on the Redcliffe Peninsula, as well as Shorncliffe, Sandgate, Wynnum, Manly and Wellington Point are also popular attractions for their bayside beaches, piers, and infrastructure for boating, sailing, fishing and kitesurfing.
Moreton Bay is on the east side of Brisbane, sheltered from the Pacific Ocean by two sand islands - Moreton Island to the north and North Stradbroke Island to the south. Activities here include sailing, boating, diving, windsurfing and fishing. Tangalooma, at the site of an old whaling station on the bay-side of Moreton Island, offers diving, whale-watching and dolphin tours. The two larger islands, and many of the smaller islands, for example, Coochiemudlo Island, Lamb Island and Russell Island, can be accessed by ferry. St Helena Island is near the mouth of the Brisbane River and is significant for its history as a penal colony, and its migratory birds.
Beachside suburbs that offer swimming and watersports include Wynnum, Manly, Shorncliffe, Sandgate and Wellington Point.
Nudgee Beach is a suburb about outside of Brisbane. The beach is surrounded by numerous mangroves, and has a bike track that heads down to Boondall Wetlands.
Shopping
Retail in the CBD is centred around the Queen Street Mall, which is Australia's largest pedestrian mall. Shopping centres in the CBD include the Myer Centre, the Wintergarden, MacArthur Central and QueensPlaza, with the last of these along with Edward Street forming the city's focus for luxury brands. There are historical shopping arcades at Brisbane Arcade and Tattersalls Arcade. Suburbs adjacent to the CBD such as Fortitude Valley (particularly James Street), South Brisbane and West End are also a major inner-city retail hubs.
Outside of the inner-city, retail is focused on indoor shopping centres, including numerous regional shopping centres along with six super regional shopping centres, all of which are among Australia's largest, namely: Westfield Chermside in the north; Westfield Garden City in the south; Westfield Carindale in the east; Indooroopilly Shopping Centre in the west; Westfield North Lakes in the outer-north; and Logan Hyperdome in the outer-south. Brisbane's major factory outlet centres are the Direct Factory Outlets at Skygate and Jindalee.
The 100 hectare Brisbane Markets at Rocklea are Brisbane's largest wholesale markets, whilst smaller markets operate at numerous locations throughout the city including South Bank Parklands, Davies Park in West End and the Eat Street Markets at Hamilton.
Queen Street Mall
Located in the centre of the city, the Queen Street Mall and its nearby surrounds is Queensland's premier shopping destination. The mall is open plan, stretching half a kilometre along Queen Street Mall. There are five major shopping centres, two department stores and four shopping arcades located within the mall.
Entertainment precincts
South Bank Parklands
South Bank Parklands, once the site of the Expo '88, is now an entertainment precinct boasting entertainment, cafes, restaurants, man-made beaches, lagoons, playgrounds and views of the city along its boardwalk. It is also the location for the Brisbane Convention and Exhibition Centre, and the temporary, relocatable Ferris wheel, the 60-metre Wheel of Brisbane.
Howard Smith Wharves
Howard Smith Wharves along the New Farm Cliffs below the Story Bridge is a stretch of riverside parkland which incorporates numerous entertainment and restaurant venues.
Eagle Street Pier
Eagle Street Pier is a riverside entertainment precinct which is home to numerous restaurants.
Portside Wharf
Portside Wharf, located approximately from the Brisbane CBD on the Brisbane River, is a residential, retail precinct with numerous cafes, restaurants, shops and cinemas.
Throughout Brisbane
RiverWalk
Brisbane is notable for its Brisbane Riverwalk network, which runs along much of the Brisbane River foreshore throughout the inner-city area, with the longest span running between Newstead and Toowong. Another popular stretch runs beneath the Kangaroo Point Cliffs between South Brisbane and Kangaroo Point. Several spans of the Riverwalk are built out over the Brisbane River. Brisbane also has over of bicycle pathways, mostly surrounding the Brisbane River and city centre. Other popular recreation activities include the Story Bridge adventure climb and rock climbing at the Kangaroo Point Cliffs.
CityCat Ferries
CityCat Ferries are catamarans, and are a pleasant way to travel past such Brisbane icons as the Story Bridge and South Bank Parklands.
City tours
Brisbane Greeters provide free walking tours around Brisbane, aiming to provide a customised, flexible, intimate and authentic experiences through a knowledgeable and enthusiastic local volunteer.
Kangaroo Segway Tours offer tours of the city's major attractions using segways.
Brisbane By Bicycle conduct daily tours of Brisbane city and surrounding areas in small groups. The tours are fully guided by a Brisbane local with extensive knowledge of the city including local bars, restaurants, events and attractions.
Brisbane's Food Scene
Brisbane is home to over 6,000 restaurants and dining establishments, with outdoor dining featuring prominently. The most popular cuisines by number of dining establishments are Japanese, Chinese, Modern Australian, Italian, American, Indian, and Vietnamese. Moreton Bay bugs, less commonly known as flathead lobsters, are an ingredient named for the Brisbane region and which feature commonly in the city's cuisine, along with macadamia nuts, also native to the region. There are many Good Food Guide-awarded restaurants, cafes and bars in the region.
Brisbane has a number of food markets to sample the local cuisine and street eats. Eat Street Markets at Hamilton and Boundary Street Markets at West End are popular weekend markets, especially with locals and offer a variety of cuisines from local restaurants and food trucks.
Food Tours
Food tours provide great insight into a city's local food scene, and Brisbane's local food culture can be experienced on a tour with Delectable Tours.
Other attractions
Lone Pine Koala Sanctuary
The Lone Pine Koala Sanctuary opened in 1927 and was the world's first koala sanctuary. Wildlife in the sanctuary includes koalas, kangaroos, Tasmanian devils, wombats, echidnas, various species of reptiles, as well as many types of Australian birds. The sanctuary is located in the Brisbane suburb of Fig Tree Pocket.
Brisbane Tramway Museum
Brisbane Tramway Museum is a transport museum which preserves and displays trams and trolley-buses, most of which operated in Brisbane, Queensland, Australia. The museum also has a collection of vehicles and other equipment used in maintaining Brisbane's electric street transport system which operated from 1897 to 1969. The museum is located at Ferny Grove, a north-west suburb of Brisbane.
Newstead House
Newstead House, in Newstead Park, is the oldest house in Brisbane. Built in 1846, it is now a museum and heritage listed site. It is open to the public, and concerts are sometimes held at the house and grounds.
Day trips
The Gold Coast and Hinterland
The Gold Coast is a strip of urban areas and beaches located about south of Brisbane, about an hour's travel by car or train.
Major centres with shopping, restaurants and sandy beaches include Surfers Paradise, Mermaid Beach, Burleigh Heads and Coolangatta. There are several theme parks in the region, including Movie World, Sea World, Wet'n'Wild Water World and Dreamworld, and wildlife parks such as David Fleay Wildlife Park and Currumbin Wildlife Sanctuary.
The Gold Coast hinterland features rainforests and wet sclerophyll forest with walking tracks and picnic areas. Some areas also offer camping sites, bed-and-breakfast accommodation, cafes and markets. Popular areas for tourism include Springbrook National Park, Lamington National Park and Tamborine Mountain. The Hinterland is promoted as "The Green Behind The Gold".
Bribie Island
Bribie Island is a sand island north of Brisbane, accessible by a road bridge over Pumicestone Passage. The area features a surf beach on the east side at Woorim, and quiet estuaries for boating and fishing on the west side, in the Passage. Accommodation is available in caravan parks. There are 4WD-accessible camping sites on the northern end of the island, which require permits. Attractions include the recently opened Bribie Island Seaside Museum, Passage cruises, and birdwatching at Buckley's Hole Environmental Park.
The Sunshine Coast and Hinterland
The Sunshine Coast, about an hour drive north of Brisbane, offers a wide range of beaches, national parks, theme parks and golf courses. Urban centres that cater for tourism along the coastline include Caloundra, Maroochydore, Noosa, and Coolum. To the west, the iconic Glasshouse Mountains offer scenic drives, lookouts, walking tracks and picnic areas. There is a ginger factory at Yandina, and Maleny and Montville offer art galleries, wineries, shops and cafes. The Woodford Folk Festival, an annual music festival, is held near the semi-rural town of Woodford, north of Brisbane.
Rainbow Beach
Rainbow Beach is a coastal town in south-eastern Queensland, Australia, near Gympie, famed for its rainbow-coloured sand dunes, sand cliffs and pleasant beaches. The beach is located approximately north of Brisbane, east of Gympie and 700 metres west of Fraser Island on the Cooloola Coast.
Kondalilla Falls National Park
Named after the spectacular Kondalilla Falls, where Skene Creek drops 90m into a rainforest valley, this park is a cool mountain retreat and an important refuge for many native animals and plants. From Brisbane, the drive to the falls takes roughly 2 hours.
See also
Tourism in Australia
References
External links
Brisbane Tourism Guide
VisitBrisbane.com
Brisbane - Tourism Australia
Make the Day - Brisbane Outdoor Activities
|
```javascript
var res = [];
var output = {Success: false};
var cmdline = 'sudo vol.py -f ' + args.memdump + ' malfind';
if (args.pid) {
cmdline = cmdline + ' -p ' + args.pid;
}
var dumpdir = args.dumpdir;
cmdline = cmdline + ' -D ' + dumpdir;
executeCommand('RemoteExec', {system:args.system, cmd:'sudo mkdir ' + dumpdir});
var volExec = executeCommand('RemoteExec', {system:args.system, cmd: cmdline})[0];
res.push(volExec);
if (volExec.Type !== entryTypes.error) {
// we need to take all the files and move them over.
res.push(executeCommand('copy-from', {using:args.system, file: dumpdir + '/*'}));
}
if ('true' === args.dodelete) {
res.push(executeCommand('RemoteExec', {system:args.system, cmd:'sudo rm -rf ' + dumpdir}));
}
return res;
```
|
Lee Kyung-hee (born 1969) is a South Korean female television screenwriter.
Lee Kyung-hee is also the name of:
Ko Eun-ah (actress, born 1946) (born Lee Kyung-hee), South Korean actress
Li Gyong-hui (born 1972), North Korean rhythmic gymnast
Ri Kyong-hui (born 1967), North Korean cross-country skier
Lee Kyung-hee (footballer) (born 1978), South Korean female footballer
Grace Lee (born Lee Kyung-hee 1982), South Korean female television host
|
Lophomyrmex is a genus of ants in the subfamily Myrmicinae. It is known from the Oriental and Indo-Australian regions.
Species
Lophomyrmex ambiguus Rigato, 1994
Lophomyrmex bedoti Emery, 1893
Lophomyrmex birmanus Emery, 1893
Lophomyrmex changlangensis Sheela & Ghosh, 2008
Lophomyrmex kali Rigato, 1994
Lophomyrmex longicornis Rigato, 1994
Lophomyrmex lucidus Menozzi, 1930
Lophomyrmex opaciceps Viehmeyer, 1922
Lophomyrmex quadrispinosus (Jerdon, 1851)
Lophomyrmex striatulus Rigato, 1994
Lophomyrmex taivanae Forel, 1912
Lophomyrmex terraceensis Bharti & Kumar, 2012
References
External links
Myrmicinae
Ant genera
Hymenoptera of Asia
Hymenoptera of Australia
|
```go
// go run linux/mksysnum.go -Wall -Werror -static -I/tmp/include /tmp/include/asm/unistd.h
// Code generated by the command above; see README.md. DO NOT EDIT.
// +build mips,linux
package unix
const (
SYS_SYSCALL = 4000
SYS_EXIT = 4001
SYS_FORK = 4002
SYS_READ = 4003
SYS_WRITE = 4004
SYS_OPEN = 4005
SYS_CLOSE = 4006
SYS_WAITPID = 4007
SYS_CREAT = 4008
SYS_LINK = 4009
SYS_UNLINK = 4010
SYS_EXECVE = 4011
SYS_CHDIR = 4012
SYS_TIME = 4013
SYS_MKNOD = 4014
SYS_CHMOD = 4015
SYS_LCHOWN = 4016
SYS_BREAK = 4017
SYS_UNUSED18 = 4018
SYS_LSEEK = 4019
SYS_GETPID = 4020
SYS_MOUNT = 4021
SYS_UMOUNT = 4022
SYS_SETUID = 4023
SYS_GETUID = 4024
SYS_STIME = 4025
SYS_PTRACE = 4026
SYS_ALARM = 4027
SYS_UNUSED28 = 4028
SYS_PAUSE = 4029
SYS_UTIME = 4030
SYS_STTY = 4031
SYS_GTTY = 4032
SYS_ACCESS = 4033
SYS_NICE = 4034
SYS_FTIME = 4035
SYS_SYNC = 4036
SYS_KILL = 4037
SYS_RENAME = 4038
SYS_MKDIR = 4039
SYS_RMDIR = 4040
SYS_DUP = 4041
SYS_PIPE = 4042
SYS_TIMES = 4043
SYS_PROF = 4044
SYS_BRK = 4045
SYS_SETGID = 4046
SYS_GETGID = 4047
SYS_SIGNAL = 4048
SYS_GETEUID = 4049
SYS_GETEGID = 4050
SYS_ACCT = 4051
SYS_UMOUNT2 = 4052
SYS_LOCK = 4053
SYS_IOCTL = 4054
SYS_FCNTL = 4055
SYS_MPX = 4056
SYS_SETPGID = 4057
SYS_ULIMIT = 4058
SYS_UNUSED59 = 4059
SYS_UMASK = 4060
SYS_CHROOT = 4061
SYS_USTAT = 4062
SYS_DUP2 = 4063
SYS_GETPPID = 4064
SYS_GETPGRP = 4065
SYS_SETSID = 4066
SYS_SIGACTION = 4067
SYS_SGETMASK = 4068
SYS_SSETMASK = 4069
SYS_SETREUID = 4070
SYS_SETREGID = 4071
SYS_SIGSUSPEND = 4072
SYS_SIGPENDING = 4073
SYS_SETHOSTNAME = 4074
SYS_SETRLIMIT = 4075
SYS_GETRLIMIT = 4076
SYS_GETRUSAGE = 4077
SYS_GETTIMEOFDAY = 4078
SYS_SETTIMEOFDAY = 4079
SYS_GETGROUPS = 4080
SYS_SETGROUPS = 4081
SYS_RESERVED82 = 4082
SYS_SYMLINK = 4083
SYS_UNUSED84 = 4084
SYS_READLINK = 4085
SYS_USELIB = 4086
SYS_SWAPON = 4087
SYS_REBOOT = 4088
SYS_READDIR = 4089
SYS_MMAP = 4090
SYS_MUNMAP = 4091
SYS_TRUNCATE = 4092
SYS_FTRUNCATE = 4093
SYS_FCHMOD = 4094
SYS_FCHOWN = 4095
SYS_GETPRIORITY = 4096
SYS_SETPRIORITY = 4097
SYS_PROFIL = 4098
SYS_STATFS = 4099
SYS_FSTATFS = 4100
SYS_IOPERM = 4101
SYS_SOCKETCALL = 4102
SYS_SYSLOG = 4103
SYS_SETITIMER = 4104
SYS_GETITIMER = 4105
SYS_STAT = 4106
SYS_LSTAT = 4107
SYS_FSTAT = 4108
SYS_UNUSED109 = 4109
SYS_IOPL = 4110
SYS_VHANGUP = 4111
SYS_IDLE = 4112
SYS_VM86 = 4113
SYS_WAIT4 = 4114
SYS_SWAPOFF = 4115
SYS_SYSINFO = 4116
SYS_IPC = 4117
SYS_FSYNC = 4118
SYS_SIGRETURN = 4119
SYS_CLONE = 4120
SYS_SETDOMAINNAME = 4121
SYS_UNAME = 4122
SYS_MODIFY_LDT = 4123
SYS_ADJTIMEX = 4124
SYS_MPROTECT = 4125
SYS_SIGPROCMASK = 4126
SYS_CREATE_MODULE = 4127
SYS_INIT_MODULE = 4128
SYS_DELETE_MODULE = 4129
SYS_GET_KERNEL_SYMS = 4130
SYS_QUOTACTL = 4131
SYS_GETPGID = 4132
SYS_FCHDIR = 4133
SYS_BDFLUSH = 4134
SYS_SYSFS = 4135
SYS_PERSONALITY = 4136
SYS_AFS_SYSCALL = 4137
SYS_SETFSUID = 4138
SYS_SETFSGID = 4139
SYS__LLSEEK = 4140
SYS_GETDENTS = 4141
SYS__NEWSELECT = 4142
SYS_FLOCK = 4143
SYS_MSYNC = 4144
SYS_READV = 4145
SYS_WRITEV = 4146
SYS_CACHEFLUSH = 4147
SYS_CACHECTL = 4148
SYS_SYSMIPS = 4149
SYS_UNUSED150 = 4150
SYS_GETSID = 4151
SYS_FDATASYNC = 4152
SYS__SYSCTL = 4153
SYS_MLOCK = 4154
SYS_MUNLOCK = 4155
SYS_MLOCKALL = 4156
SYS_MUNLOCKALL = 4157
SYS_SCHED_SETPARAM = 4158
SYS_SCHED_GETPARAM = 4159
SYS_SCHED_SETSCHEDULER = 4160
SYS_SCHED_GETSCHEDULER = 4161
SYS_SCHED_YIELD = 4162
SYS_SCHED_GET_PRIORITY_MAX = 4163
SYS_SCHED_GET_PRIORITY_MIN = 4164
SYS_SCHED_RR_GET_INTERVAL = 4165
SYS_NANOSLEEP = 4166
SYS_MREMAP = 4167
SYS_ACCEPT = 4168
SYS_BIND = 4169
SYS_CONNECT = 4170
SYS_GETPEERNAME = 4171
SYS_GETSOCKNAME = 4172
SYS_GETSOCKOPT = 4173
SYS_LISTEN = 4174
SYS_RECV = 4175
SYS_RECVFROM = 4176
SYS_RECVMSG = 4177
SYS_SEND = 4178
SYS_SENDMSG = 4179
SYS_SENDTO = 4180
SYS_SETSOCKOPT = 4181
SYS_SHUTDOWN = 4182
SYS_SOCKET = 4183
SYS_SOCKETPAIR = 4184
SYS_SETRESUID = 4185
SYS_GETRESUID = 4186
SYS_QUERY_MODULE = 4187
SYS_POLL = 4188
SYS_NFSSERVCTL = 4189
SYS_SETRESGID = 4190
SYS_GETRESGID = 4191
SYS_PRCTL = 4192
SYS_RT_SIGRETURN = 4193
SYS_RT_SIGACTION = 4194
SYS_RT_SIGPROCMASK = 4195
SYS_RT_SIGPENDING = 4196
SYS_RT_SIGTIMEDWAIT = 4197
SYS_RT_SIGQUEUEINFO = 4198
SYS_RT_SIGSUSPEND = 4199
SYS_PREAD64 = 4200
SYS_PWRITE64 = 4201
SYS_CHOWN = 4202
SYS_GETCWD = 4203
SYS_CAPGET = 4204
SYS_CAPSET = 4205
SYS_SIGALTSTACK = 4206
SYS_SENDFILE = 4207
SYS_GETPMSG = 4208
SYS_PUTPMSG = 4209
SYS_MMAP2 = 4210
SYS_TRUNCATE64 = 4211
SYS_FTRUNCATE64 = 4212
SYS_STAT64 = 4213
SYS_LSTAT64 = 4214
SYS_FSTAT64 = 4215
SYS_PIVOT_ROOT = 4216
SYS_MINCORE = 4217
SYS_MADVISE = 4218
SYS_GETDENTS64 = 4219
SYS_FCNTL64 = 4220
SYS_RESERVED221 = 4221
SYS_GETTID = 4222
SYS_READAHEAD = 4223
SYS_SETXATTR = 4224
SYS_LSETXATTR = 4225
SYS_FSETXATTR = 4226
SYS_GETXATTR = 4227
SYS_LGETXATTR = 4228
SYS_FGETXATTR = 4229
SYS_LISTXATTR = 4230
SYS_LLISTXATTR = 4231
SYS_FLISTXATTR = 4232
SYS_REMOVEXATTR = 4233
SYS_LREMOVEXATTR = 4234
SYS_FREMOVEXATTR = 4235
SYS_TKILL = 4236
SYS_SENDFILE64 = 4237
SYS_FUTEX = 4238
SYS_SCHED_SETAFFINITY = 4239
SYS_SCHED_GETAFFINITY = 4240
SYS_IO_SETUP = 4241
SYS_IO_DESTROY = 4242
SYS_IO_GETEVENTS = 4243
SYS_IO_SUBMIT = 4244
SYS_IO_CANCEL = 4245
SYS_EXIT_GROUP = 4246
SYS_LOOKUP_DCOOKIE = 4247
SYS_EPOLL_CREATE = 4248
SYS_EPOLL_CTL = 4249
SYS_EPOLL_WAIT = 4250
SYS_REMAP_FILE_PAGES = 4251
SYS_SET_TID_ADDRESS = 4252
SYS_RESTART_SYSCALL = 4253
SYS_FADVISE64 = 4254
SYS_STATFS64 = 4255
SYS_FSTATFS64 = 4256
SYS_TIMER_CREATE = 4257
SYS_TIMER_SETTIME = 4258
SYS_TIMER_GETTIME = 4259
SYS_TIMER_GETOVERRUN = 4260
SYS_TIMER_DELETE = 4261
SYS_CLOCK_SETTIME = 4262
SYS_CLOCK_GETTIME = 4263
SYS_CLOCK_GETRES = 4264
SYS_CLOCK_NANOSLEEP = 4265
SYS_TGKILL = 4266
SYS_UTIMES = 4267
SYS_MBIND = 4268
SYS_GET_MEMPOLICY = 4269
SYS_SET_MEMPOLICY = 4270
SYS_MQ_OPEN = 4271
SYS_MQ_UNLINK = 4272
SYS_MQ_TIMEDSEND = 4273
SYS_MQ_TIMEDRECEIVE = 4274
SYS_MQ_NOTIFY = 4275
SYS_MQ_GETSETATTR = 4276
SYS_VSERVER = 4277
SYS_WAITID = 4278
SYS_ADD_KEY = 4280
SYS_REQUEST_KEY = 4281
SYS_KEYCTL = 4282
SYS_SET_THREAD_AREA = 4283
SYS_INOTIFY_INIT = 4284
SYS_INOTIFY_ADD_WATCH = 4285
SYS_INOTIFY_RM_WATCH = 4286
SYS_MIGRATE_PAGES = 4287
SYS_OPENAT = 4288
SYS_MKDIRAT = 4289
SYS_MKNODAT = 4290
SYS_FCHOWNAT = 4291
SYS_FUTIMESAT = 4292
SYS_FSTATAT64 = 4293
SYS_UNLINKAT = 4294
SYS_RENAMEAT = 4295
SYS_LINKAT = 4296
SYS_SYMLINKAT = 4297
SYS_READLINKAT = 4298
SYS_FCHMODAT = 4299
SYS_FACCESSAT = 4300
SYS_PSELECT6 = 4301
SYS_PPOLL = 4302
SYS_UNSHARE = 4303
SYS_SPLICE = 4304
SYS_SYNC_FILE_RANGE = 4305
SYS_TEE = 4306
SYS_VMSPLICE = 4307
SYS_MOVE_PAGES = 4308
SYS_SET_ROBUST_LIST = 4309
SYS_GET_ROBUST_LIST = 4310
SYS_KEXEC_LOAD = 4311
SYS_GETCPU = 4312
SYS_EPOLL_PWAIT = 4313
SYS_IOPRIO_SET = 4314
SYS_IOPRIO_GET = 4315
SYS_UTIMENSAT = 4316
SYS_SIGNALFD = 4317
SYS_TIMERFD = 4318
SYS_EVENTFD = 4319
SYS_FALLOCATE = 4320
SYS_TIMERFD_CREATE = 4321
SYS_TIMERFD_GETTIME = 4322
SYS_TIMERFD_SETTIME = 4323
SYS_SIGNALFD4 = 4324
SYS_EVENTFD2 = 4325
SYS_EPOLL_CREATE1 = 4326
SYS_DUP3 = 4327
SYS_PIPE2 = 4328
SYS_INOTIFY_INIT1 = 4329
SYS_PREADV = 4330
SYS_PWRITEV = 4331
SYS_RT_TGSIGQUEUEINFO = 4332
SYS_PERF_EVENT_OPEN = 4333
SYS_ACCEPT4 = 4334
SYS_RECVMMSG = 4335
SYS_FANOTIFY_INIT = 4336
SYS_FANOTIFY_MARK = 4337
SYS_PRLIMIT64 = 4338
SYS_NAME_TO_HANDLE_AT = 4339
SYS_OPEN_BY_HANDLE_AT = 4340
SYS_CLOCK_ADJTIME = 4341
SYS_SYNCFS = 4342
SYS_SENDMMSG = 4343
SYS_SETNS = 4344
SYS_PROCESS_VM_READV = 4345
SYS_PROCESS_VM_WRITEV = 4346
SYS_KCMP = 4347
SYS_FINIT_MODULE = 4348
SYS_SCHED_SETATTR = 4349
SYS_SCHED_GETATTR = 4350
SYS_RENAMEAT2 = 4351
SYS_SECCOMP = 4352
SYS_GETRANDOM = 4353
SYS_MEMFD_CREATE = 4354
SYS_BPF = 4355
SYS_EXECVEAT = 4356
SYS_USERFAULTFD = 4357
SYS_MEMBARRIER = 4358
SYS_MLOCK2 = 4359
SYS_COPY_FILE_RANGE = 4360
SYS_PREADV2 = 4361
SYS_PWRITEV2 = 4362
SYS_PKEY_MPROTECT = 4363
SYS_PKEY_ALLOC = 4364
SYS_PKEY_FREE = 4365
SYS_STATX = 4366
SYS_RSEQ = 4367
SYS_IO_PGETEVENTS = 4368
SYS_SEMGET = 4393
SYS_SEMCTL = 4394
SYS_SHMGET = 4395
SYS_SHMCTL = 4396
SYS_SHMAT = 4397
SYS_SHMDT = 4398
SYS_MSGGET = 4399
SYS_MSGSND = 4400
SYS_MSGRCV = 4401
SYS_MSGCTL = 4402
SYS_CLOCK_GETTIME64 = 4403
SYS_CLOCK_SETTIME64 = 4404
SYS_CLOCK_ADJTIME64 = 4405
SYS_CLOCK_GETRES_TIME64 = 4406
SYS_CLOCK_NANOSLEEP_TIME64 = 4407
SYS_TIMER_GETTIME64 = 4408
SYS_TIMER_SETTIME64 = 4409
SYS_TIMERFD_GETTIME64 = 4410
SYS_TIMERFD_SETTIME64 = 4411
SYS_UTIMENSAT_TIME64 = 4412
SYS_PSELECT6_TIME64 = 4413
SYS_PPOLL_TIME64 = 4414
SYS_IO_PGETEVENTS_TIME64 = 4416
SYS_RECVMMSG_TIME64 = 4417
SYS_MQ_TIMEDSEND_TIME64 = 4418
SYS_MQ_TIMEDRECEIVE_TIME64 = 4419
SYS_SEMTIMEDOP_TIME64 = 4420
SYS_RT_SIGTIMEDWAIT_TIME64 = 4421
SYS_FUTEX_TIME64 = 4422
SYS_SCHED_RR_GET_INTERVAL_TIME64 = 4423
SYS_PIDFD_SEND_SIGNAL = 4424
SYS_IO_URING_SETUP = 4425
SYS_IO_URING_ENTER = 4426
SYS_IO_URING_REGISTER = 4427
SYS_OPEN_TREE = 4428
SYS_MOVE_MOUNT = 4429
SYS_FSOPEN = 4430
SYS_FSCONFIG = 4431
SYS_FSMOUNT = 4432
SYS_FSPICK = 4433
SYS_PIDFD_OPEN = 4434
SYS_CLONE3 = 4435
SYS_CLOSE_RANGE = 4436
SYS_OPENAT2 = 4437
SYS_PIDFD_GETFD = 4438
SYS_FACCESSAT2 = 4439
)
```
|
```go
/*
path_to_url
Unless required by applicable law or agreed to in writing, software
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
// Code generated by applyconfiguration-gen. DO NOT EDIT.
package v1beta1
// RuntimeClassStrategyOptionsApplyConfiguration represents an declarative configuration of the RuntimeClassStrategyOptions type for use
// with apply.
type RuntimeClassStrategyOptionsApplyConfiguration struct {
AllowedRuntimeClassNames []string `json:"allowedRuntimeClassNames,omitempty"`
DefaultRuntimeClassName *string `json:"defaultRuntimeClassName,omitempty"`
}
// RuntimeClassStrategyOptionsApplyConfiguration constructs an declarative configuration of the RuntimeClassStrategyOptions type for use with
// apply.
func RuntimeClassStrategyOptions() *RuntimeClassStrategyOptionsApplyConfiguration {
return &RuntimeClassStrategyOptionsApplyConfiguration{}
}
// WithAllowedRuntimeClassNames adds the given value to the AllowedRuntimeClassNames field in the declarative configuration
// and returns the receiver, so that objects can be build by chaining "With" function invocations.
// If called multiple times, values provided by each call will be appended to the AllowedRuntimeClassNames field.
func (b *RuntimeClassStrategyOptionsApplyConfiguration) WithAllowedRuntimeClassNames(values ...string) *RuntimeClassStrategyOptionsApplyConfiguration {
for i := range values {
b.AllowedRuntimeClassNames = append(b.AllowedRuntimeClassNames, values[i])
}
return b
}
// WithDefaultRuntimeClassName sets the DefaultRuntimeClassName field in the declarative configuration to the given value
// and returns the receiver, so that objects can be built by chaining "With" function invocations.
// If called multiple times, the DefaultRuntimeClassName field is set to the value of the last call.
func (b *RuntimeClassStrategyOptionsApplyConfiguration) WithDefaultRuntimeClassName(value string) *RuntimeClassStrategyOptionsApplyConfiguration {
b.DefaultRuntimeClassName = &value
return b
}
```
|
```smalltalk
namespace Asp.Versioning.Builder;
using Microsoft.AspNetCore.Builder;
using Microsoft.AspNetCore.Routing;
/// <summary>
/// Creates and returns a new versioned endpoint route builder.
/// </summary>
/// <param name="routeBuilder">The inner <see cref="IEndpointRouteBuilder"/> the new instance decorates.</param>
/// <param name="conventionBuilder">The inner <see cref="IEndpointConventionBuilder"/> the new instance decorates.</param>
/// <param name="apiVersionSetBuilder">The associated <see cref="ApiVersionSetBuilder">API version set builder</see>.</param>
/// <returns>A new <see cref="IVersionedEndpointRouteBuilder"/> instance.</returns>
[CLSCompliant( false )]
public delegate IVersionedEndpointRouteBuilder VersionedEndpointRouteBuilderFactory(
IEndpointRouteBuilder routeBuilder,
IEndpointConventionBuilder conventionBuilder,
ApiVersionSetBuilder apiVersionSetBuilder );
```
|
```xml
import type { MockInstance } from 'vitest';
import { afterEach, beforeEach, describe, expect, it, vi } from 'vitest';
import type { StorybookConfigRaw } from 'storybook/internal/types';
import { checkWebpack5Builder } from './checkWebpack5Builder';
import { getBuilderPackageName } from './mainConfigFile';
const mockMainConfig: StorybookConfigRaw = {
framework: 'react',
addons: [],
stories: [],
};
vi.mock('./mainConfigFile');
describe('checkWebpack5Builder', () => {
let loggerWarnSpy: MockInstance;
let loggerInfoSpy: MockInstance;
beforeEach(() => {
loggerWarnSpy = vi.spyOn(console, 'warn').mockImplementation(() => {});
loggerInfoSpy = vi.spyOn(console, 'info').mockImplementation(() => {});
});
afterEach(() => {
loggerWarnSpy.mockRestore();
loggerInfoSpy.mockRestore();
});
it('should return null and log a warning if storybook version is below 6.3.0', async () => {
const result = await checkWebpack5Builder({
mainConfig: mockMainConfig,
storybookVersion: '6.2.9',
});
expect(result).toBeNull();
expect(loggerWarnSpy).toHaveBeenCalledWith(expect.any(String));
});
it('should return null if storybook version is 7.0.0 or above', async () => {
const result = await checkWebpack5Builder({
mainConfig: mockMainConfig,
storybookVersion: '7.0.0',
});
expect(result).toBeNull();
expect(loggerWarnSpy).not.toHaveBeenCalled();
});
it('should return null and log a warning if mainConfig is missing', async () => {
const result = await checkWebpack5Builder({
// @ts-expect-error (Type 'undefined' is not assignable to type 'StorybookConfigRaw'.)
mainConfig: undefined,
storybookVersion: '6.3.0',
});
expect(result).toBeNull();
expect(loggerWarnSpy).toHaveBeenCalledWith(expect.any(String));
});
it('should return null and log an info message if builderPackageName is found but not "webpack4"', async () => {
vi.mocked(getBuilderPackageName).mockReturnValueOnce('webpack5');
const result = await checkWebpack5Builder({
mainConfig: mockMainConfig,
storybookVersion: '6.3.0',
});
expect(result).toBeNull();
expect(loggerInfoSpy).toHaveBeenCalledWith(expect.any(String));
});
it('should return { storybookVersion } if all checks pass', async () => {
vi.mocked(getBuilderPackageName).mockReturnValueOnce('webpack4');
const result = await checkWebpack5Builder({
mainConfig: mockMainConfig,
storybookVersion: '6.3.0',
});
expect(result).toEqual({ storybookVersion: '6.3.0' });
expect(loggerWarnSpy).not.toHaveBeenCalled();
expect(loggerInfoSpy).not.toHaveBeenCalled();
});
});
```
|
```javascript
/*
Use of this source code is governed by a MIT license
that can be found in the LICENSE file.
*/
Tests.register("Audio.getContext()", function() {
var ctx = Audio.getContext();
Assert(ctx instanceof AudioContext);
});
Tests.register("Audio.getContext() with params", function() {
var ctx = Audio.getContext(1024, 2, 22050);
Assert(ctx instanceof AudioContext);
Assert.equal(ctx.bufferSize, 1024);
Assert.equal(ctx.channels, 2);
Assert.equal(ctx.sampleRate, 22050);
});
Tests.register("Audio.getContext() with invalid buffer size", function() {
try {
var ctx = Audio.getContext(-1024);
} catch (e) {
Assert(e.message.indexOf("Unsuported buffer size") == 0);
return;
}
Assert(false, "Exception was expected");
});
Tests.register("Audio.getContext() with invalid channels", function() {
try {
var ctx = Audio.getContext(1024, 64);
} catch (e) {
Assert(e.message.indexOf("Unsuported channels number") == 0);
return;
}
Assert(false, "Exception was expected");
});
Tests.register("Audio.getContext() with invalid sample rate", function() {
try {
var ctx = Audio.getContext(1024, 32, 11025);
} catch (e) {
Assert(e.message.indexOf("Unsuported sample rate") == 0);
return;
}
Assert(false, "Exception was expected");
});
```
|
The 2018 Galway Senior Hurling Championship was the 121st staging of the Galway Senior Hurling Championship since its establishment in 1887.
The winners St. Thomas' were presented with the Tom Callanan Cup having beaten Liam Mellows in the final on 18 November.
Liam Mellows were the reigning champions. Ballinderreen participated in the senior championship having been promoted from the intermediate competition in 2017.
Competition format
Twenty four reams compete in the initial group stages of the championship – the top ranked twelve teams compete in the Senior A Group and the second ranked twelve teams compete in the Senior B Group. Eight teams from the Senior A Group and four teams from the Senior B Group progress to the knockout stage. The competition format is explained further in each of the championship rounds in the sections below.
Group stage
Senior A
Senior A consists of 12 teams divided into two groups of 6. The top two teams from each group automatically qualify for the quarter finals. The third and fourth teams from each group play in the preliminary quarter finals. The bottom two teams from each group play-off with the losing team relegated to playing in the following year's Senior B Section.
Senior A - Group 1
{| class="wikitable"
!width=20|
! style="width:150px; text-align:left;"|Team
!width=20|
!width=20|
!width=20|
!width=20|
!width=30|
!width=40|
!width=20|
!width=20|
|- style="background:#98FB98;"
|1||align=left| St. Thomas' ||5||4||1||0||4-97||5-65||29||9
|- style="background:#98FB98;"
|2||align=left| Liam Mellows ||5||3||1||1||5-83||3-82||7||7
|- style="background:#ccf;"
|3||align=left| Tommy Larkin's ||5||1||4||0||4-73||5-78||2||6
|- style="background:#ccf;"
|4||align=left| Castlegar ||5||2||1||2||8-72||4-75||9||5
|-
|5||align=left| Craughwell ||5||1||0||4||7-68||6-83||-12||2
|-
|6||align=left| Kilnadeema-Leitrim ||5||0||1||4||3-73||7-96||-35||1
|}
Senior A - Group 2
{| class="wikitable"
!width=20|
! style="width:150px; text-align:left;"|Team
!width=20|
!width=20|
!width=20|
!width=20|
!width=30|
!width=35|
!width=20|
!width=20|
|- style="background:#98FB98;"
|1||align=left| Sarsfields ||5||3||1||1||3-74||6-68||-3||7
|- style="background:#98FB98;"
|2|| style="text-align:left;"| Loughrea ||5||3||0||2||5-76||4-76||3||6
|- style="background:#ccf;"
|3|| style="text-align:left;"| Gort ||5||3||0||2||3-95||3-79||16||6
|- style="background:#ccf;"
|4|| style="text-align:left;"| Cappataggle ||5||2||1||2||2-83||4-73||4||5
|-
|5|| style="text-align:left;"| Mullagh||5||2||0||3||5-71||2-90||-10||4
|-
|6|| style="text-align:left;"| Portumna ||5||1||0||4||3-78||2-91||-10||2
|}
Senior A - Relegation
Senior B
Senior B consists of 12 teams divided into two groups of 6. The winners of each group qualify for the 2018 preliminary quarter finals and compete in the following year's Senior A competition. The four second and third placed teams play-off with the two winners also qualifying for the 2018 preliminary quarter finals.
Senior B - Group 1
{| class="wikitable"
!width=20|
! style="width:150px; text-align:left;"|Team
!width=20|
!width=20|
!width=20|
!width=20|
!width=40|
!width=45|
!width=20|
!width=20|
|- style="background:#98FB98;"
|1|| style="text-align:left;"| Turloughmore ||5||5||0||0||4-93||5-61||29||10
|- style="background:#ccf;"
|2|| style="text-align:left;"| Clarinbridge ||5||4||0||1||7-82||2-81||19||8
|- style="background:#ccf;"
|3|| style="text-align:left;"| Killimordaly ||5||2||1||2||5-82||4-75||10||5
|-
|4|| style="text-align:left;"| Ballinderreen ||5||2||0||3||8-59||4-76||-5||4
|-
|5|| style="text-align:left;"| Ahascragh-Fohenagh ||5||1||0||4||5-63||8-84||-30||2
|-
|6|| style="text-align:left;"| Beagh ||5||0||1||4||6-81||12-83||-23||1
|}
Senior B - Group 2
{| class="wikitable"
!width=20|
! style="width:150px; text-align:left;"|Team
!width=20|
!width=20|
!width=20|
!width=20|
!width=30|
!width=40|
!width=20|
!width=20|
|- style="background:#98FB98;"
|1||align=left| Tynagh-Abbey/Duniry ||5||4||1||0||6-89||4-63||32||9
|- style="background:#ccf;"
|2||align=left| Athenry ||5||3||0||2||6-71||2-69||14||6
|- style="background:#ccf;"
|3||align=left| Padraig Pearse's ||5||3||0||2||4-74||1-65||18||6
|-
|4||align=left| Abbeyknockmoy ||5||1||2||2||6-79||8-77||-14||4
|-
|5||align=left| Ardrahan ||5||1||1||3||3-69||2-82||-10||3
|-
|6||align=left| Moycullen ||5||0||2||3||4-67||12-83||-40||2
|}
Senior B - playoffs
The second team in Senior B Group 1 plays the third team in Senior B Group 2 and the third team in Senior B Group 1 plays the second team in Senior B Group 2. The two winning teams qualify for the 2018 senior preliminary quarter finals. The two losing teams are eliminated from this year's senior championship.
Senior B - Relegation
The losing team is relegated to the following year's intermediate championship.
Senior Knockout stage
Senior Preliminary Quarter-finals
The four teams who finished third and fourth in the two Senior A Groups play the four Senior B teams who qualified (the two winners of the two Senior B Groups plus the two winners of the Senior B play-offs).
Senior Quarter-finals
The four teams who finished first and second in the two Senior A groups play the four winners of the senior preliminary quarter finals.
Senior Semi-finals
Senior final
References
Galway Senior Hurling Championship
Galway Senior Hurling Championship
|
During the 1996–97 English football season, Chelsea competed in the Premier League.
Season summary
With Glenn Hoddle leaving to become England manager, Chelsea gave the managerial role to midfielder Ruud Gullit, who used his continental connections to bring in world-class international players such as France center-back Frank Leboeuf, and Italian superstars such as midfielder Roberto Di Matteo, Parma's playmaker Gianfranco Zola and the Champions League winning striker and Juventus captain Gianluca Vialli. Gullit had a dream start to his managerial career as Chelsea won the FA Cup with a 2–0 win over Middlesbrough, ending Chelsea's 26-year trophy drought and making him the first foreign manager to win a major trophy with an English club. Zola was voted FWA Footballer of the Year after a brilliant first season at Stamford Bridge in which he scored 12 goals and contributed many assists, while fellow countryman and record £4.5 million signing Roberto Di Matteo scored one of Chelsea's goals in the triumphant Wembley final.
The club suffered a tragedy in late October when director Matthew Harding was killed in a helicopter crash in Cheshire when returning home from the club's League Cup exit at Bolton.
Final league table
Results summary
Results by round
Results
Premier League
League Cup
FA Cup
First team squad
Squad at end of season
Left club during season
Reserve squad
Statistics
|}
Statistics taken from . Squad details and shirt numbers from and .
Transfers
In
Out
Transfers in: £14,450,000
Transfers out: £4,965,000
Total spending: £9,485,000
References
Hockings, Ron. 100 Years of the Blues: A Statistical History of Chelsea Football Club. (2007)
Chelsea F.C. seasons
Chelsea
|
```javascript
'use strict';
var _require = require('../helpers/is'),
isArray = _require.isArray,
isObject = _require.isObject,
isFunction = _require.isFunction;
module.exports = function skipUntil(valueOrFunction) {
var _this = this;
var previous = null;
var items;
var callback = function callback(value) {
return value === valueOrFunction;
};
if (isFunction(valueOrFunction)) {
callback = valueOrFunction;
}
if (isArray(this.items)) {
items = this.items.filter(function (item) {
if (previous !== true) {
previous = callback(item);
}
return previous;
});
}
if (isObject(this.items)) {
items = Object.keys(this.items).reduce(function (acc, key) {
if (previous !== true) {
previous = callback(_this.items[key]);
}
if (previous !== false) {
acc[key] = _this.items[key];
}
return acc;
}, {});
}
return new this.constructor(items);
};
```
|
```objective-c
// 2016 and later: Unicode, Inc. and others.
// collunsafe.h
// All Rights Reserved.
// To be included by collationdatareader.cpp, and generated by gencolusb.
// Machine generated, do not edit.
#ifndef COLLUNSAFE_H
#define COLLUNSAFE_H
#include "unicode/utypes.h"
#define COLLUNSAFE_ICU_VERSION "56.0.1"
#define COLLUNSAFE_COLL_VERSION "9.64"
#define COLLUNSAFE_SERIALIZE 1
static const int32_t unsafe_serializedCount = 850;
static const uint16_t unsafe_serializedData[850] = {
0x8350, 0x01B8, 0x0034, 0x0035, 0x004C, 0x004D, 0x00A0, 0x00A1, // 8
0x0300, 0x034F, 0x0350, 0x0370, 0x03A9, 0x03AA, 0x03E2, 0x03E3, // 16
0x042F, 0x0430, 0x0483, 0x0488, 0x0531, 0x0532, 0x0591, 0x05BE, // 24
0x05BF, 0x05C0, 0x05C1, 0x05C3, 0x05C4, 0x05C6, 0x05C7, 0x05C8, // 32
0x05D0, 0x05D1, 0x0610, 0x061B, 0x0628, 0x0629, 0x064B, 0x0660, // 40
0x0670, 0x0671, 0x06D6, 0x06DD, 0x06DF, 0x06E5, 0x06E7, 0x06E9, // 48
0x06EA, 0x06EE, 0x0710, 0x0712, 0x0730, 0x074B, 0x078C, 0x078D, // 56
0x07D8, 0x07D9, 0x07EB, 0x07F4, 0x0800, 0x0801, 0x0816, 0x081A, // 64
0x081B, 0x0824, 0x0825, 0x0828, 0x0829, 0x082E, 0x0840, 0x0841, // 72
0x0859, 0x085C, 0x08E3, 0x0900, 0x0905, 0x0906, 0x093C, 0x093D, // 80
0x094D, 0x094E, 0x0951, 0x0955, 0x0995, 0x0996, 0x09BC, 0x09BD, // 88
0x09BE, 0x09BF, 0x09CD, 0x09CE, 0x09D7, 0x09D8, 0x0A15, 0x0A16, // 96
0x0A3C, 0x0A3D, 0x0A4D, 0x0A4E, 0x0A95, 0x0A96, 0x0ABC, 0x0ABD, // 104
0x0ACD, 0x0ACE, 0x0B15, 0x0B16, 0x0B3C, 0x0B3D, 0x0B3E, 0x0B3F, // 112
0x0B4D, 0x0B4E, 0x0B56, 0x0B58, 0x0B95, 0x0B96, 0x0BBE, 0x0BBF, // 120
0x0BCD, 0x0BCE, 0x0BD7, 0x0BD8, 0x0C15, 0x0C16, 0x0C4D, 0x0C4E, // 128
0x0C55, 0x0C57, 0x0C95, 0x0C96, 0x0CBC, 0x0CBD, 0x0CC2, 0x0CC3, // 136
0x0CCD, 0x0CCE, 0x0CD5, 0x0CD7, 0x0D15, 0x0D16, 0x0D3E, 0x0D3F, // 144
0x0D4D, 0x0D4E, 0x0D57, 0x0D58, 0x0D85, 0x0D86, 0x0DCA, 0x0DCB, // 152
0x0DCF, 0x0DD0, 0x0DDF, 0x0DE0, 0x0E01, 0x0E2F, 0x0E32, 0x0E33, // 160
0x0E38, 0x0E3B, 0x0E48, 0x0E4C, 0x0E81, 0x0E83, 0x0E84, 0x0E85, // 168
0x0E87, 0x0E89, 0x0E8A, 0x0E8B, 0x0E8D, 0x0E8E, 0x0E94, 0x0E98, // 176
0x0E99, 0x0EA0, 0x0EA1, 0x0EA4, 0x0EA5, 0x0EA6, 0x0EA7, 0x0EA8, // 184
0x0EAA, 0x0EAC, 0x0EAD, 0x0EAF, 0x0EB2, 0x0EB3, 0x0EB8, 0x0EBA, // 192
0x0EC8, 0x0ECC, 0x0EDC, 0x0EE0, 0x0F18, 0x0F1A, 0x0F35, 0x0F36, // 200
0x0F37, 0x0F38, 0x0F39, 0x0F3A, 0x0F40, 0x0F41, 0x0F71, 0x0F76, // 208
0x0F7A, 0x0F7E, 0x0F80, 0x0F85, 0x0F86, 0x0F88, 0x0FC6, 0x0FC7, // 216
0x1000, 0x1001, 0x102E, 0x102F, 0x1037, 0x1038, 0x1039, 0x103B, // 224
0x108D, 0x108E, 0x10D3, 0x10D4, 0x12A0, 0x12A1, 0x135D, 0x1360, // 232
0x13C4, 0x13C5, 0x14C0, 0x14C1, 0x168F, 0x1690, 0x16A0, 0x16A1, // 240
0x1703, 0x1704, 0x1714, 0x1715, 0x1723, 0x1724, 0x1734, 0x1735, // 248
0x1743, 0x1744, 0x1763, 0x1764, 0x1780, 0x1781, 0x17D2, 0x17D3, // 256
0x17DD, 0x17DE, 0x1826, 0x1827, 0x18A9, 0x18AA, 0x1900, 0x1901, // 264
0x1939, 0x193C, 0x1950, 0x1951, 0x1980, 0x19AC, 0x1A00, 0x1A01, // 272
0x1A17, 0x1A19, 0x1A20, 0x1A21, 0x1A60, 0x1A61, 0x1A75, 0x1A7D, // 280
0x1A7F, 0x1A80, 0x1AB0, 0x1ABE, 0x1B05, 0x1B06, 0x1B34, 0x1B36, // 288
0x1B44, 0x1B45, 0x1B6B, 0x1B74, 0x1B83, 0x1B84, 0x1BAA, 0x1BAC, // 296
0x1BC0, 0x1BC1, 0x1BE6, 0x1BE7, 0x1BF2, 0x1BF4, 0x1C00, 0x1C01, // 304
0x1C37, 0x1C38, 0x1C5A, 0x1C5B, 0x1CD0, 0x1CD3, 0x1CD4, 0x1CE1, // 312
0x1CE2, 0x1CE9, 0x1CED, 0x1CEE, 0x1CF4, 0x1CF5, 0x1CF8, 0x1CFA, // 320
0x1DC0, 0x1DF6, 0x1DFC, 0x1E00, 0x201C, 0x201D, 0x20AC, 0x20AD, // 328
0x20D0, 0x20DD, 0x20E1, 0x20E2, 0x20E5, 0x20F1, 0x263A, 0x263B, // 336
0x2C00, 0x2C01, 0x2CEF, 0x2CF2, 0x2D5E, 0x2D5F, 0x2D7F, 0x2D80, // 344
0x2DE0, 0x2E00, 0x302A, 0x3030, 0x304B, 0x304C, 0x3099, 0x309B, // 352
0x30AB, 0x30AC, 0x3105, 0x3106, 0x5B57, 0x5B58, 0xA288, 0xA289, // 360
0xA4E8, 0xA4E9, 0xA549, 0xA54A, 0xA66F, 0xA670, 0xA674, 0xA67E, // 368
0xA69E, 0xA6A1, 0xA6F0, 0xA6F2, 0xA800, 0xA801, 0xA806, 0xA807, // 376
0xA840, 0xA841, 0xA882, 0xA883, 0xA8C4, 0xA8C5, 0xA8E0, 0xA8F2, // 384
0xA90A, 0xA90B, 0xA92B, 0xA92E, 0xA930, 0xA931, 0xA953, 0xA954, // 392
0xA984, 0xA985, 0xA9B3, 0xA9B4, 0xA9C0, 0xA9C1, 0xAA00, 0xAA01, // 400
0xAA80, 0xAAB1, 0xAAB2, 0xAAB5, 0xAAB7, 0xAAB9, 0xAABE, 0xAAC0, // 408
0xAAC1, 0xAAC2, 0xAAF6, 0xAAF7, 0xABC0, 0xABC1, 0xABED, 0xABEE, // 416
0xAC00, 0xAC01, 0xD800, 0xD807, 0xD808, 0xD809, 0xD80C, 0xD80D, // 424
0xD811, 0xD812, 0xD81A, 0xD81C, 0xD82F, 0xD830, 0xD834, 0xD835, // 432
0xD83A, 0xD83B, 0xDC00, 0xE000, 0xFB1E, 0xFB1F, 0xFDD0, 0xFDD1, // 440
0xFE20, 0xFE30, 0x0001, 0x0000, 0x0001, 0x0001, 0x0001, 0x01FD, // 448
0x0001, 0x01FE, 0x0001, 0x0280, 0x0001, 0x0281, 0x0001, 0x02B7, // 456
0x0001, 0x02B8, 0x0001, 0x02E0, 0x0001, 0x02E1, 0x0001, 0x0308, // 464
0x0001, 0x0309, 0x0001, 0x0330, 0x0001, 0x0331, 0x0001, 0x036B, // 472
0x0001, 0x036C, 0x0001, 0x0376, 0x0001, 0x037B, 0x0001, 0x0380, // 480
0x0001, 0x0381, 0x0001, 0x03A0, 0x0001, 0x03A1, 0x0001, 0x0414, // 488
0x0001, 0x0415, 0x0001, 0x0450, 0x0001, 0x0451, 0x0001, 0x0480, // 496
0x0001, 0x0481, 0x0001, 0x0500, 0x0001, 0x0501, 0x0001, 0x0537, // 504
0x0001, 0x0538, 0x0001, 0x0647, 0x0001, 0x0648, 0x0001, 0x0800, // 512
0x0001, 0x0801, 0x0001, 0x0840, 0x0001, 0x0841, 0x0001, 0x0873, // 520
0x0001, 0x0874, 0x0001, 0x0896, 0x0001, 0x0897, 0x0001, 0x08F4, // 528
0x0001, 0x08F5, 0x0001, 0x0900, 0x0001, 0x0901, 0x0001, 0x0920, // 536
0x0001, 0x0921, 0x0001, 0x0980, 0x0001, 0x0981, 0x0001, 0x09A0, // 544
0x0001, 0x09A1, 0x0001, 0x0A00, 0x0001, 0x0A01, 0x0001, 0x0A0D, // 552
0x0001, 0x0A0E, 0x0001, 0x0A0F, 0x0001, 0x0A10, 0x0001, 0x0A38, // 560
0x0001, 0x0A3B, 0x0001, 0x0A3F, 0x0001, 0x0A40, 0x0001, 0x0A60, // 568
0x0001, 0x0A61, 0x0001, 0x0A95, 0x0001, 0x0A96, 0x0001, 0x0AC1, // 576
0x0001, 0x0AC2, 0x0001, 0x0AE5, 0x0001, 0x0AE7, 0x0001, 0x0B00, // 584
0x0001, 0x0B01, 0x0001, 0x0B40, 0x0001, 0x0B41, 0x0001, 0x0B60, // 592
0x0001, 0x0B61, 0x0001, 0x0B8F, 0x0001, 0x0B90, 0x0001, 0x0C00, // 600
0x0001, 0x0C01, 0x0001, 0x0CA1, 0x0001, 0x0CA2, 0x0001, 0x1005, // 608
0x0001, 0x1006, 0x0001, 0x1046, 0x0001, 0x1047, 0x0001, 0x107F, // 616
0x0001, 0x1080, 0x0001, 0x1083, 0x0001, 0x1084, 0x0001, 0x10B9, // 624
0x0001, 0x10BB, 0x0001, 0x10D0, 0x0001, 0x10D1, 0x0001, 0x1100, // 632
0x0001, 0x1104, 0x0001, 0x1127, 0x0001, 0x1128, 0x0001, 0x1133, // 640
0x0001, 0x1135, 0x0001, 0x1152, 0x0001, 0x1153, 0x0001, 0x1173, // 648
0x0001, 0x1174, 0x0001, 0x1183, 0x0001, 0x1184, 0x0001, 0x11C0, // 656
0x0001, 0x11C1, 0x0001, 0x11CA, 0x0001, 0x11CB, 0x0001, 0x1208, // 664
0x0001, 0x1209, 0x0001, 0x1235, 0x0001, 0x1237, 0x0001, 0x128F, // 672
0x0001, 0x1290, 0x0001, 0x12BE, 0x0001, 0x12BF, 0x0001, 0x12E9, // 680
0x0001, 0x12EB, 0x0001, 0x1315, 0x0001, 0x1316, 0x0001, 0x133C, // 688
0x0001, 0x133D, 0x0001, 0x133E, 0x0001, 0x133F, 0x0001, 0x134D, // 696
0x0001, 0x134E, 0x0001, 0x1357, 0x0001, 0x1358, 0x0001, 0x1366, // 704
0x0001, 0x136D, 0x0001, 0x1370, 0x0001, 0x1375, 0x0001, 0x1484, // 712
0x0001, 0x1485, 0x0001, 0x14B0, 0x0001, 0x14B1, 0x0001, 0x14BA, // 720
0x0001, 0x14BB, 0x0001, 0x14BD, 0x0001, 0x14BE, 0x0001, 0x14C2, // 728
0x0001, 0x14C4, 0x0001, 0x158E, 0x0001, 0x158F, 0x0001, 0x15AF, // 736
0x0001, 0x15B0, 0x0001, 0x15BF, 0x0001, 0x15C1, 0x0001, 0x160E, // 744
0x0001, 0x160F, 0x0001, 0x163F, 0x0001, 0x1640, 0x0001, 0x1680, // 752
0x0001, 0x1681, 0x0001, 0x16B6, 0x0001, 0x16B8, 0x0001, 0x1717, // 760
0x0001, 0x1718, 0x0001, 0x172B, 0x0001, 0x172C, 0x0001, 0x18B4, // 768
0x0001, 0x18B5, 0x0001, 0x1AC0, 0x0001, 0x1AC1, 0x0001, 0x2000, // 776
0x0001, 0x2001, 0x0001, 0x3153, 0x0001, 0x3154, 0x0001, 0x4400, // 784
0x0001, 0x4401, 0x0001, 0x6A4F, 0x0001, 0x6A50, 0x0001, 0x6AE6, // 792
0x0001, 0x6AE7, 0x0001, 0x6AF0, 0x0001, 0x6AF5, 0x0001, 0x6B1C, // 800
0x0001, 0x6B1D, 0x0001, 0x6B30, 0x0001, 0x6B37, 0x0001, 0x6F00, // 808
0x0001, 0x6F01, 0x0001, 0xBC20, 0x0001, 0xBC21, 0x0001, 0xBC9E, // 816
0x0001, 0xBC9F, 0x0001, 0xD165, 0x0001, 0xD16A, 0x0001, 0xD16D, // 824
0x0001, 0xD173, 0x0001, 0xD17B, 0x0001, 0xD183, 0x0001, 0xD185, // 832
0x0001, 0xD18C, 0x0001, 0xD1AA, 0x0001, 0xD1AE, 0x0001, 0xD242, // 840
0x0001, 0xD245, 0x0001, 0xE802, 0x0001, 0xE803, 0x0001, 0xE8D0, // 848
0x0001, 0xE8D7};
#endif
```
|
Taşucu Seka Harbor is a harbor in Turkey. Taşucu is a town in Silifke ilçe (district) of Mersin Province. It is situated to the west of the Göksu River, and is the main port of the settlements in the Göksu River valley. Taşucu is the name of the belde (town) and Seka is the name of the paper mill situated next to Taşucu.
The harbor
In the province, Taşucu Seka Harbor is the second biggest harbor after Mersin Harbor.
The harbor is composed of two sections. The smaller section in the west was constructed as the harbor of the town and the bigger section in the east was the harbor of the Seka paper mill which is currently out of service. The longer breakwater to the east is at .
References
Buildings and structures in Mersin Province
Silifke District
Ports and harbours of Turkey
Ports and harbours of the Mediterranean
|
```javascript
'use strict';
import React from 'react';
import PropTypes from 'prop-types';
import Project from './project.js';
import {
manageApp,
exitApp,
updateBeacon,
fetchAppSettings,
upsertAppSettingsFile,
showAlert
} from '../../actions';
import { connect } from 'react-redux';
import { Grid, Row, Col } from 'react-bootstrap';
const styles = {
root: {
display: 'flex',
justifyContent: 'space-around'
},
refresh: {
display: 'inline-block',
position: 'relative',
background: 'none',
boxShadow: 'none',
marginTop: '-6px',
float: 'right'
}
};
export class Projectscontainer extends React.Component {
static propTypes = {
dispatch: PropTypes.any,
currentUser: PropTypes.any,
apps: PropTypes.any,
beacons: PropTypes.any,
generalSettings: PropTypes.any
}
constructor (props) {
super(props);
this.state = {
value: '',
appSettingObj: {
appIcon: null,
appInProduction: false,
appName: null
}
};
}
changeHandler = (e) => {
this.setState({ value: e.target.value });
}
onDeleteDev = (appId) => {
this.props.dispatch(exitApp(appId, this.props.currentUser.user._id));
}
onProjectClick = (appId, masterKey, jsKey, name, from) => {
this.props.dispatch(updateBeacon(this.props.beacons, 'tableDesignerLink'));
this.props.dispatch(manageApp(appId, masterKey, jsKey, name, from));
}
fetchAppSettings = (appId, masterKey, file) => {
if (file.type.includes('image')) {
this.props.dispatch({ type: 'START_LOADING' });
this.props.dispatch(fetchAppSettings(appId, masterKey, '/')).then(() => {
if (this.props.generalSettings) {
this.props.dispatch(upsertAppSettingsFile(appId, masterKey, file, 'general', {
...this.state
}));
}
});
} else {
showAlert('error', 'Only images are allowed.');
}
}
render () {
const content = this.props.apps.length
// ? this.props.apps.map(app => <Col xs={8} sm={6} md={4} lg={3} key={app._id} className='project-grid'>
? this.props.apps.map(app => <Col key={app._id} className='project-grid'>
<Project onProjectClick={this.onProjectClick}
key={app._id}
fetchAppSettings={this.fetchAppSettings}
{...app}
currentUser={this.props.currentUser}
onDeleteDev={this.onDeleteDev}
beacons={this.props.beacons}
selectedPlan={app.planId} />
</Col>)
: '';
return (
<div style={styles.root}>
<Grid fluid className='projects-container'>
<Row className='show-grid'>
{content}
</Row>
</Grid>
</div>
);
}
}
const mapStateToProps = (state) => {
let generalSettings = null;
if (state.settings.length) {
generalSettings = state.settings.filter(x => x.category === 'general')[0];
}
return {
apps: state.apps || [],
currentUser: state.user,
loading: state.loader,
beacons: state.beacons,
generalSettings: generalSettings
};
};
export default connect(mapStateToProps, null)(Projectscontainer);
```
|
Dai Yunqiang (born 20 July 1990) is a Chinese Paralympic athlete. He won the silver medal in the men's 800 metres T54 event at the 2020 Summer Paralympics held in Tokyo, Japan. He also won the bronze medal in the men's 400 metres T54 event.
He also competed in the men's 1500 metres T54, men's 5000 metres T54 and men's marathon T54 events.
In 2023, he won the bronze medal in the men's 400 metres T54 event at the World Para Athletics Championships held in Paris, France.
References
External links
Living people
1990 births
Athletes from Qingdao
Paralympic medalists in athletics (track and field)
Athletes (track and field) at the 2020 Summer Paralympics
Medalists at the 2020 Summer Paralympics
Medalists at the World Para Athletics Championships
Paralympic silver medalists for China
Paralympic bronze medalists for China
Paralympic athletes for China
21st-century Chinese people
|
```javascript
import {Color} from "three";
import {Locale} from "../../../../../locale/LocaleManager.js";
import {ChangeAction} from "../../../../../history/action/ChangeAction.js";
import {ObjectInspector} from "../ObjectInspector.js";
import {LightShadowFormSnippet} from "../../../../form-snippet/LightShadowFormSnippet.js";
import {Editor} from "../../../../../Editor.js";
import {ColorChooser} from "../../../../../components/input/ColorChooser.js";
import {CheckBox} from "../../../../../components/input/CheckBox.js";
function DirectionalLightInspector(parent, object)
{
ObjectInspector.call(this, parent, object);
var self = this;
// Color
this.form.addText(Locale.color);
this.color = new ColorChooser(this.form);
this.color.size.set(80, 18);
this.color.setOnChange(function()
{
Editor.addAction(new ChangeAction(self.object, "color", new Color(self.color.getValueHex())));
});
this.form.add(this.color);
this.form.nextRow();
// Shadow map
this.form.addText(Locale.shadows);
this.form.nextRow();
// Cast shadow
this.form.addText(Locale.castShadows);
this.castShadow = new CheckBox(this.form);
this.castShadow.size.set(18, 18);
this.castShadow.position.set(5, 85);
this.castShadow.updateInterface();
this.castShadow.setOnChange(function()
{
Editor.addAction(new ChangeAction(self.object, "castShadow", self.castShadow.getValue()));
});
this.form.add(this.castShadow);
this.form.nextRow();
// Shadow
this.shadow = new LightShadowFormSnippet(this.form, object);
}
DirectionalLightInspector.prototype = Object.create(ObjectInspector.prototype);
DirectionalLightInspector.prototype.updateInspector = function()
{
ObjectInspector.prototype.updateInspector.call(this);
this.color.setValue(this.object.color.r, this.object.color.g, this.object.color.b);
this.castShadow.setValue(this.object.castShadow);
this.shadow.attach(this.object);
};
export {DirectionalLightInspector};
```
|
```c++
#include "selfdrive/ui/qt/spinner.h"
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <QApplication>
#include <QGridLayout>
#include <QPainter>
#include <QString>
#include <QTransform>
#include "system/hardware/hw.h"
#include "selfdrive/ui/qt/qt_window.h"
#include "selfdrive/ui/qt/util.h"
TrackWidget::TrackWidget(QWidget *parent) : QWidget(parent) {
setAttribute(Qt::WA_OpaquePaintEvent);
setFixedSize(spinner_size);
// pre-compute all the track imgs. make this a gif instead?
QPixmap comma_img = loadPixmap("../assets/img_spinner_comma.png", spinner_size);
QPixmap track_img = loadPixmap("../assets/img_spinner_track.png", spinner_size);
QTransform transform(1, 0, 0, 1, width() / 2, height() / 2);
QPixmap pm(spinner_size);
QPainter p(&pm);
p.setRenderHint(QPainter::SmoothPixmapTransform);
for (int i = 0; i < track_imgs.size(); ++i) {
p.resetTransform();
p.fillRect(0, 0, spinner_size.width(), spinner_size.height(), Qt::black);
p.drawPixmap(0, 0, comma_img);
p.setTransform(transform.rotate(360 / spinner_fps));
p.drawPixmap(-width() / 2, -height() / 2, track_img);
track_imgs[i] = pm.copy();
}
m_anim.setDuration(1000);
m_anim.setStartValue(0);
m_anim.setEndValue(int(track_imgs.size() -1));
m_anim.setLoopCount(-1);
m_anim.start();
connect(&m_anim, SIGNAL(valueChanged(QVariant)), SLOT(update()));
}
void TrackWidget::paintEvent(QPaintEvent *event) {
QPainter painter(this);
painter.drawPixmap(0, 0, track_imgs[m_anim.currentValue().toInt()]);
}
// Spinner
Spinner::Spinner(QWidget *parent) : QWidget(parent) {
QGridLayout *main_layout = new QGridLayout(this);
main_layout->setSpacing(0);
main_layout->setMargin(200);
main_layout->addWidget(new TrackWidget(this), 0, 0, Qt::AlignHCenter | Qt::AlignVCenter);
text = new QLabel();
text->setWordWrap(true);
text->setVisible(false);
text->setAlignment(Qt::AlignCenter);
main_layout->addWidget(text, 1, 0, Qt::AlignHCenter);
progress_bar = new QProgressBar();
progress_bar->setRange(5, 100);
progress_bar->setTextVisible(false);
progress_bar->setVisible(false);
progress_bar->setFixedHeight(20);
main_layout->addWidget(progress_bar, 1, 0, Qt::AlignHCenter);
setStyleSheet(R"(
Spinner {
background-color: black;
}
QLabel {
color: white;
font-size: 80px;
background-color: transparent;
}
QProgressBar {
background-color: #373737;
width: 1000px;
border solid white;
border-radius: 10px;
}
QProgressBar::chunk {
border-radius: 10px;
background-color: white;
}
)");
notifier = new QSocketNotifier(fileno(stdin), QSocketNotifier::Read);
QObject::connect(notifier, &QSocketNotifier::activated, this, &Spinner::update);
}
void Spinner::update(int n) {
std::string line;
std::getline(std::cin, line);
if (line.length()) {
bool number = std::all_of(line.begin(), line.end(), ::isdigit);
text->setVisible(!number);
progress_bar->setVisible(number);
text->setText(QString::fromStdString(line));
if (number) {
progress_bar->setValue(std::stoi(line));
}
}
}
int main(int argc, char *argv[]) {
initApp(argc, argv);
QApplication a(argc, argv);
Spinner spinner;
setMainWindow(&spinner);
return a.exec();
}
```
|
Pleurotomella normalis is a species of sea snail, a marine gastropod mollusk in the family Raphitomidae.
Description
(Original description) The short and very stout shell contains seven whorls. The body whorl measures about eight elevenths of the whole length. The apex of the protoconch is smooth. The remainder consists of the 3½ yellow-brown nuclear whorls, beautifully reticulated with wavy transverse lines, then changing suddenly into waxy white. The subsequent whorls show spiral
threads, set in pairs which frequently blend to make one flattened spiral thread, with wider interspaces between the threads. Two or three threads next the suture are stronger and wider apart than the others, the outer one strongest, giving the whorl a turreted appearance, and rising into little knobs on the transverse ridges. These ridges are rather sharp, sixteen to eighteen in number, fading away toward the siphonal canal in most but not all specimens, flexuous with the lines of growth. The columella is straight, the edge obliquely cut off, shorter than the aperture anteriorly. There is a light deposit of callus on the body. The aperture is proportionally wide, thin-lipped and about half as long as the shell.
Distribution
This marine species occurs in the Yucatan Strait.
References
de Boury, E., 1899. Révision des pleurotomes éocènes du Bassin de Paris. La Feuille des Jeunes Naturalistes 29: 117-163, sér. 3° série
External links
Holotype at MNHN, Paris
normalis
Gastropods described in 1881
|
```dart
// MIT-style license that can be found in the LICENSE file or at
// path_to_url
import 'package:js/js.dart';
@JS()
@anonymous
class RenderContext {
external RenderContextOptions get options;
external bool? get fromImport;
external factory RenderContext(
{required RenderContextOptions options, bool? fromImport});
}
@JS()
@anonymous
class RenderContextOptions {
external String? get file;
external String? get data;
external String get includePaths;
external int get precision;
external int get style;
external int get indentType;
external int get indentWidth;
external String get linefeed;
external RenderContext get context;
external set context(RenderContext value);
external RenderContextResult get result;
external factory RenderContextOptions(
{String? file,
String? data,
required String includePaths,
required int precision,
required int style,
required int indentType,
required int indentWidth,
required String linefeed,
required RenderContextResult result});
}
@JS()
@anonymous
class RenderContextResult {
external RenderContextResultStats get stats;
external factory RenderContextResult(
{required RenderContextResultStats stats});
}
@JS()
@anonymous
class RenderContextResultStats {
external int get start;
external String get entry;
external factory RenderContextResultStats(
{required int start, required String entry});
}
```
|
is a Sengoku period Japanese castle located in Oga, Akita Prefecture, in the Tōhoku region of Japan. The site was designated a National Historic Site of Japan in 1979.
Background
The precise date of the construction of Wakimoto Castle is not known, but it is presumed to be sometime during the 15th century. The castle was the stronghold of the Andō clan, whose origins are also shrouded in mystery. The Andō were possibly descendants of the indigenous Emishi people who populated the Tōhoku region prior to the arrival of the Yamato Japanese in the late Nara period. The Andō were a maritime clan who controlled the northern Sea of Japan coastline of Japan, including southern Ezo (Hokkaido), and who engaged in trade and fishing. Under the Kamakura shogunate and into the Nanbokuchō period, the clan enjoyed virtual autonomy in their domains, trading with mainland Asia through the Tosaminato port in what is now Aomori Prefecture and from the 14th century at Tsuchizaki Port in what is now the city of Akita. However, in the 15th century, the Andō came under attack by the Nanbu clan based at Sannohe Castle and was forced to retreat from Tosaminoto Port to Hokkaido. Despite numerous counterattacks, the Andō were unable to recover Tosaminato, but a branch of the clan called the "Minato Andō" held out at Tsuchizaki. In the middle of the 15th century, the Minato Andō asked the main branch of the clan to relocate from Hokkaido to Dewa Province, and under Andō Masasue (d.1488), they built Hiyama Castle near Noshiro, becoming the "Hiyama Andō". The two branches of the clan co-existed for a century.
The two branches of the clan united under Andō Chikasue (1539-1587). Andō Chikasue rebuilt a pre-existing fortification at Wakimoto from 1577, and used this as his seat.
Structure
Wakimoto Castle is located on a flat-topped hill with a height of 100 meters at the base of Oga Peninsula near the edge of the Akita Plain and near the mouth of Lake Hachirogata (which has now disappeared due to land reclamation). It was protected by the lake to its front, and by the Sea of Japan to its rear. At the peak of the hill there is a group of square-shaped enclosures which contained the residence, surrounded by kuruwa terraces, which might be a remnant of the original castle. In the 1577 reconstruction, an adjacent peak facing the sea was incorporated into the castle area, separated by ridges to the east and south, with a new Inner bailey at the tip of the eastern ridge. This enclosure had a square profile, 100 meters on each side, protected by a five-meter high clay rampart and several smaller surrounding enclosures. The southern ridge has two layers of enclosures for senior retainers; however, a large portion of the southern ridge has now collapsed into the ocean due to erosion and after earthquakes. Between the new and the old castle enclosures was a road protected by a clay wall with a length of 300 meters. The total castle area spreads over a 1000 meter wide x 1500 meter long area. On the eastern hillside was the jōkamachi, which extended down the coast for a kilometer, and which was also protected by an outer barrier. These fortifications made Wakimoto Castle one of the largest in eastern Japan at the time.
Subsequent history
Andō Chikasue pledged fealty to Oda Nobunaga and to Toyotomi Hideyoshi and was confirmed in his holdings which extended over two-thirds of Dewa Province. He also changed his surname from Andō to "Akita". After his death, the clan fell into civil war between followers of his son, Akita Sanesue (1576-1660) and loyalists of the former Minato Andō. Sanesue moved his seat to Minato Castle in Tsuchizaki and Wakimoto Castle fell into ruins. After many vicissitudes, the Akita clan continued to the end of the Tokugawa shogunate as daimyō of Miharu Domain in what is now Fukushima Prefecture.
No buildings or structures remain of Wakimoto Castle today, however, the terraces with clay ramparts and dry moats remain. The castle was listed as one of the Continued Top 100 Japanese Castles in 2017. The site is located approximately 25 minutes on foot from JR East Oga Line Wakimoto Station.
See also
List of Historic Sites of Japan (Akita)
Literature
References
External links
Oga City home page
Castles in Akita Prefecture
Ruined castles in Japan
History of Akita Prefecture
Oga, Akita
Dewa Province
Akita clan
Historic Sites of Japan
|
```kotlin
package it.sephiroth.android.library.bottomnavigation
import android.annotation.SuppressLint
import android.content.Context
import android.util.Log
import android.util.Log.INFO
import android.view.MotionEvent
import android.view.View
import android.widget.LinearLayout
import android.widget.Toast
import it.sephiroth.android.library.bottomnavigation.MiscUtils.log
import it.sephiroth.android.library.bottonnavigation.R
/**
* Created by crugnola on 4/4/16.
* MaterialBottomNavigation
*
*/
class FixedLayout(context: Context) : ItemsLayoutContainer(context) {
private val maxActiveItemWidth: Int
private val minActiveItemWidth: Int
private var totalChildrenSize: Int = 0
private var hasFrame: Boolean = false
private var selectedIndex: Int = 0
private var itemFinalWidth: Int = 0
private var menu: MenuParser.Menu? = null
init {
val res = resources
maxActiveItemWidth = res.getDimensionPixelSize(R.dimen.bbn_fixed_maxActiveItemWidth)
minActiveItemWidth = res.getDimensionPixelSize(R.dimen.bbn_fixed_minActiveItemWidth)
}
override fun removeAll() {
removeAllViews()
}
override fun onLayout(changed: Boolean, l: Int, t: Int, r: Int, b: Int) {
if (!hasFrame || childCount == 0) {
return
}
if (totalChildrenSize == 0) {
totalChildrenSize = itemFinalWidth * (childCount - 1) + itemFinalWidth
}
val width = r - l
var left = (width - totalChildrenSize) / 2
for (i in 0 until childCount) {
val child = getChildAt(i)
val params = child.layoutParams
setChildFrame(child, left, 0, params.width, params.height)
left += child.width
}
}
override fun onSizeChanged(w: Int, h: Int, oldw: Int, oldh: Int) {
super.onSizeChanged(w, h, oldw, oldh)
hasFrame = true
if (null != menu) {
populateInternal(menu!!)
menu = null
}
}
private fun setChildFrame(child: View, left: Int, top: Int, width: Int, height: Int) {
child.layout(left, top, left + width, top + height)
}
override fun setSelectedIndex(index: Int, animate: Boolean) {
MiscUtils.log(Log.INFO, "setSelectedIndex: $index")
if (selectedIndex == index) {
return
}
val oldSelectedIndex = this.selectedIndex
this.selectedIndex = index
if (!hasFrame || childCount == 0) {
return
}
val current = getChildAt(oldSelectedIndex) as BottomNavigationFixedItemView
val child = getChildAt(index) as BottomNavigationFixedItemView
current.setExpanded(false, 0, animate)
child.setExpanded(true, 0, animate)
}
override fun setItemEnabled(index: Int, enabled: Boolean) {
log(INFO, "setItemEnabled(%d, %b)", index, enabled)
val child = getChildAt(index) as BottomNavigationItemViewAbstract
child.isEnabled = enabled
child.postInvalidate()
requestLayout()
}
override fun getSelectedIndex(): Int {
return selectedIndex
}
override fun populate(menu: MenuParser.Menu) {
log(Log.INFO, "populate: $menu")
if (hasFrame) {
populateInternal(menu)
} else {
this.menu = menu
}
}
@SuppressLint("ClickableViewAccessibility")
private fun populateInternal(menu: MenuParser.Menu) {
log(Log.DEBUG, "populateInternal")
val parent = parent as BottomNavigation
val screenWidth = parent.width
var proposedWidth = Math.min(Math.max(screenWidth / menu.itemsCount, minActiveItemWidth), maxActiveItemWidth)
if (proposedWidth * menu.itemsCount > screenWidth) {
proposedWidth = screenWidth / menu.itemsCount
}
this.itemFinalWidth = proposedWidth
for (i in 0 until menu.itemsCount) {
val item = menu.getItemAt(i)
val params = LinearLayout.LayoutParams(proposedWidth, height)
val view = BottomNavigationFixedItemView(parent, i == selectedIndex, menu)
view.item = item
view.layoutParams = params
view.isClickable = true
view.setTypeface(parent.typeface)
view.setOnTouchListener { v, event ->
val action = event.actionMasked
if (action == MotionEvent.ACTION_DOWN) {
itemClickListener?.onItemDown(this@FixedLayout, v, true, event.x, event.y)
} else if (action == MotionEvent.ACTION_UP || action == MotionEvent.ACTION_CANCEL) {
itemClickListener?.onItemDown(this@FixedLayout, v, false, event.x, event.y)
}
false
}
view.setOnClickListener { v ->
itemClickListener?.onItemClick(this@FixedLayout, v, i, true)
}
view.setOnLongClickListener {
Toast.makeText(context, item.title, Toast.LENGTH_SHORT).show()
true
}
addView(view)
}
}
}
```
|
```html
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Class template interval_base_map</title>
<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
<link rel="home" href="../../index.html" title="Chapter 1. Boost.Icl">
<link rel="up" href="../../header/boost/icl/interval_base_map_hpp.html" title="Header <boost/icl/interval_base_map.hpp>">
<link rel="prev" href="mapping_pair.html" title="Struct template mapping_pair">
<link rel="next" href="interval_base_map/on_codomain_model.html" title="Struct template on_codomain_model">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center"><a href="../../../../../../index.html">Home</a></td>
<td align="center"><a href="../../../../../libraries.htm">Libraries</a></td>
<td align="center"><a href="path_to_url">People</a></td>
<td align="center"><a href="path_to_url">FAQ</a></td>
<td align="center"><a href="../../../../../../more/index.htm">More</a></td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="mapping_pair.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/icl/interval_base_map_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="interval_base_map/on_codomain_model.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="refentry">
<a name="boost.icl.interval_base_map"></a><div class="titlepage"></div>
<div class="refnamediv">
<h2><span class="refentrytitle">Class template interval_base_map</span></h2>
<p>boost::icl::interval_base_map — Implements a map as a map of intervals (base class) </p>
</div>
<h2 xmlns:rev="path_to_url~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
<div xmlns:rev="path_to_url~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../header/boost/icl/interval_base_map_hpp.html" title="Header <boost/icl/interval_base_map.hpp>">boost/icl/interval_base_map.hpp</a>>
</span><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> SubType<span class="special">,</span> <span class="keyword">typename</span> DomainT<span class="special">,</span> <span class="keyword">typename</span> CodomainT<span class="special">,</span>
<span class="keyword">typename</span> Traits <span class="special">=</span> <a class="link" href="partial_absorber.html" title="Struct partial_absorber">icl::partial_absorber</a><span class="special">,</span>
<span class="identifier">ICL_COMPARE</span> Compare <span class="special">=</span> <span class="identifier">ICL_COMPARE_INSTANCE</span><span class="special">(</span><span class="identifier">ICL_COMPARE_DEFAULT</span><span class="special">,</span> <span class="identifier">DomainT</span><span class="special">)</span><span class="special">,</span>
<span class="identifier">ICL_COMBINE</span> Combine <span class="special">=</span> <span class="identifier">ICL_COMBINE_INSTANCE</span><span class="special">(</span><a class="link" href="inplace_plus.html" title="Struct template inplace_plus">icl::inplace_plus</a><span class="special">,</span> <span class="identifier">CodomainT</span><span class="special">)</span><span class="special">,</span>
<span class="identifier">ICL_SECTION</span> Section <span class="special">=</span> <span class="identifier">ICL_SECTION_INSTANCE</span><span class="special">(</span><a class="link" href="inter_section.html" title="Struct template inter_section">icl::inter_section</a><span class="special">,</span> <span class="identifier">CodomainT</span><span class="special">)</span><span class="special">,</span>
<span class="identifier">ICL_INTERVAL</span><span class="special">(</span><span class="identifier">ICL_COMPARE</span><span class="special">)</span> Interval <span class="special">=</span> <span class="identifier">ICL_INTERVAL_INSTANCE</span><span class="special">(</span><span class="identifier">ICL_INTERVAL_DEFAULT</span><span class="special">,</span> <span class="identifier">DomainT</span><span class="special">,</span> <span class="identifier">Compare</span><span class="special">)</span><span class="special">,</span>
<span class="identifier">ICL_ALLOC</span> Alloc <span class="special">=</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">allocator</span><span class="special">></span>
<span class="keyword">class</span> <a class="link" href="interval_base_map.html" title="Class template interval_base_map">interval_base_map</a> <span class="special">{</span>
<span class="keyword">public</span><span class="special">:</span>
<span class="comment">// types</span>
<span class="keyword">typedef</span> <a class="link" href="interval_base_map.html" title="Class template interval_base_map">interval_base_map</a><span class="special"><</span> <span class="identifier">SubType</span><span class="special">,</span> <span class="identifier">DomainT</span><span class="special">,</span> <span class="identifier">CodomainT</span><span class="special">,</span> <span class="identifier">Traits</span><span class="special">,</span> <span class="identifier">Compare</span><span class="special">,</span> <span class="identifier">Combine</span><span class="special">,</span> <span class="identifier">Section</span><span class="special">,</span> <span class="identifier">Interval</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">></span> <a name="boost.icl.interval_base_map.type"></a><span class="identifier">type</span><span class="special">;</span>
<span class="keyword">typedef</span> <span class="identifier">SubType</span> <a name="boost.icl.interval_base_map.sub_type"></a><span class="identifier">sub_type</span><span class="special">;</span> <span class="comment">// The designated <span class="emphasis"><em>derived</em></span> or <span class="emphasis"><em>sub_type</em></span> of this base class. </span>
<span class="keyword">typedef</span> <a class="link" href="interval_base_map.html#boost.icl.interval_base_map.type">type</a> <a name="boost.icl.interval_base_map.overloadable_type"></a><span class="identifier">overloadable_type</span><span class="special">;</span> <span class="comment">// Auxilliary type for overloadresolution. </span>
<span class="keyword">typedef</span> <span class="identifier">Traits</span> <a name="boost.icl.interval_base_map.traits"></a><span class="identifier">traits</span><span class="special">;</span> <span class="comment">// Traits of an itl map. </span>
<span class="keyword">typedef</span> <a class="link" href="map.html" title="Class template map">icl::map</a><span class="special"><</span> <span class="identifier">DomainT</span><span class="special">,</span> <span class="identifier">CodomainT</span><span class="special">,</span> <span class="identifier">Traits</span><span class="special">,</span> <span class="identifier">Compare</span><span class="special">,</span> <span class="identifier">Combine</span><span class="special">,</span> <span class="identifier">Section</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">></span> <a name="boost.icl.interval_base_map.atomized_type"></a><span class="identifier">atomized_type</span><span class="special">;</span> <span class="comment">// The atomized type representing the corresponding container of elements. </span>
<span class="keyword">typedef</span> <span class="identifier">DomainT</span> <a name="boost.icl.interval_base_map.domain_type"></a><span class="identifier">domain_type</span><span class="special">;</span> <span class="comment">// Domain type (type of the keys) of the map. </span>
<span class="keyword">typedef</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">call_traits</span><span class="special"><</span> <span class="identifier">DomainT</span> <span class="special">></span><span class="special">::</span><span class="identifier">param_type</span> <a name="boost.icl.interval_base_map.domain_param"></a><span class="identifier">domain_param</span><span class="special">;</span>
<span class="keyword">typedef</span> <span class="identifier">CodomainT</span> <a name="boost.icl.interval_base_map.codomain_type"></a><span class="identifier">codomain_type</span><span class="special">;</span> <span class="comment">// Domain type (type of the keys) of the map. </span>
<span class="keyword">typedef</span> <a class="link" href="mapping_pair.html" title="Struct template mapping_pair">mapping_pair</a><span class="special"><</span> <span class="identifier">domain_type</span><span class="special">,</span> <span class="identifier">codomain_type</span> <span class="special">></span> <a name="boost.icl.interval_base_map.domain_mapping_type"></a><span class="identifier">domain_mapping_type</span><span class="special">;</span> <span class="comment">// Auxiliary type to help the compiler resolve ambiguities when using std::make_pair. </span>
<span class="keyword">typedef</span> <span class="identifier">domain_mapping_type</span> <a name="boost.icl.interval_base_map.element_type"></a><span class="identifier">element_type</span><span class="special">;</span> <span class="comment">// Conceptual is a map a set of elements of type <code class="computeroutput">element_type</code>. </span>
<span class="keyword">typedef</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="identifier">interval_type</span><span class="special">,</span> <span class="identifier">CodomainT</span> <span class="special">></span> <a name="boost.icl.interval_base_map.interval_mapping_type"></a><span class="identifier">interval_mapping_type</span><span class="special">;</span> <span class="comment">// Auxiliary type for overload resolution. </span>
<span class="keyword">typedef</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="identifier">interval_type</span><span class="special">,</span> <span class="identifier">CodomainT</span> <span class="special">></span> <a name="boost.icl.interval_base_map.segment_type"></a><span class="identifier">segment_type</span><span class="special">;</span> <span class="comment">// Type of an interval containers segment, that is spanned by an interval. </span>
<span class="keyword">typedef</span> <span class="identifier">difference_type_of</span><span class="special"><</span> <span class="identifier">domain_type</span> <span class="special">></span><span class="special">::</span><a class="link" href="interval_base_map.html#boost.icl.interval_base_map.type">type</a> <a name="boost.icl.interval_base_map.difference_type"></a><span class="identifier">difference_type</span><span class="special">;</span> <span class="comment">// The difference type of an interval which is sometimes different form the domain_type. </span>
<span class="keyword">typedef</span> <span class="identifier">size_type_of</span><span class="special"><</span> <span class="identifier">domain_type</span> <span class="special">></span><span class="special">::</span><a class="link" href="interval_base_map.html#boost.icl.interval_base_map.type">type</a> <a name="boost.icl.interval_base_map.size_type"></a><span class="identifier">size_type</span><span class="special">;</span> <span class="comment">// The size type of an interval which is mostly std::size_t. </span>
<span class="keyword">typedef</span> <a class="link" href="inverse.html" title="Struct template inverse">inverse</a><span class="special"><</span> <span class="identifier">codomain_combine</span> <span class="special">></span><span class="special">::</span><a class="link" href="interval_base_map.html#boost.icl.interval_base_map.type">type</a> <a name="boost.icl.interval_base_map.inverse_codomain_combine"></a><span class="identifier">inverse_codomain_combine</span><span class="special">;</span> <span class="comment">// Inverse Combine functor for codomain value aggregation. </span>
<span class="keyword">typedef</span> <span class="identifier">mpl</span><span class="special">::</span><span class="identifier">if_</span><span class="special"><</span> <span class="identifier">has_set_semantics</span><span class="special"><</span> <span class="identifier">codomain_type</span> <span class="special">></span><span class="special">,</span> <span class="identifier">ICL_SECTION_CODOMAIN</span><span class="special">(</span><span class="identifier">Section</span><span class="special">,</span> <span class="identifier">CodomainT</span><span class="special">)</span><span class="special">,</span> <span class="identifier">codomain_combine</span> <span class="special">></span><span class="special">::</span><a class="link" href="interval_base_map.html#boost.icl.interval_base_map.type">type</a> <a name="boost.icl.interval_base_map.codomain_intersect"></a><span class="identifier">codomain_intersect</span><span class="special">;</span> <span class="comment">// Intersection functor for codomain values. </span>
<span class="keyword">typedef</span> <a class="link" href="inverse.html" title="Struct template inverse">inverse</a><span class="special"><</span> <span class="identifier">codomain_intersect</span> <span class="special">></span><span class="special">::</span><a class="link" href="interval_base_map.html#boost.icl.interval_base_map.type">type</a> <a name="boost.icl.interval_base_map.inverse_codomain_intersect"></a><span class="identifier">inverse_codomain_intersect</span><span class="special">;</span> <span class="comment">// Inverse Combine functor for codomain value intersection. </span>
<span class="keyword">typedef</span> <span class="identifier">exclusive_less_than</span><span class="special"><</span> <span class="identifier">interval_type</span> <span class="special">></span> <a name="boost.icl.interval_base_map.interval_compare"></a><span class="identifier">interval_compare</span><span class="special">;</span> <span class="comment">// Comparison functor for intervals which are keys as well. </span>
<span class="keyword">typedef</span> <span class="identifier">exclusive_less_than</span><span class="special"><</span> <span class="identifier">interval_type</span> <span class="special">></span> <a name="boost.icl.interval_base_map.key_compare"></a><span class="identifier">key_compare</span><span class="special">;</span> <span class="comment">// Comparison functor for keys. </span>
<span class="keyword">typedef</span> <span class="identifier">Alloc</span><span class="special"><</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="keyword">const</span> <span class="identifier">interval_type</span><span class="special">,</span> <span class="identifier">codomain_type</span> <span class="special">></span> <span class="special">></span> <a name="boost.icl.interval_base_map.allocator_type"></a><span class="identifier">allocator_type</span><span class="special">;</span> <span class="comment">// The allocator type of the set. </span>
<span class="keyword">typedef</span> <span class="identifier">ICL_IMPL_SPACE</span><span class="special">::</span><span class="identifier">map</span><span class="special"><</span> <span class="identifier">interval_type</span><span class="special">,</span> <span class="identifier">codomain_type</span><span class="special">,</span> <span class="identifier">key_compare</span><span class="special">,</span> <span class="identifier">allocator_type</span> <span class="special">></span> <a name="boost.icl.interval_base_map.ImplMapT"></a><span class="identifier">ImplMapT</span><span class="special">;</span> <span class="comment">// Container type for the implementation. </span>
<span class="keyword">typedef</span> <span class="identifier">ImplMapT</span><span class="special">::</span><span class="identifier">key_type</span> <a name="boost.icl.interval_base_map.key_type"></a><span class="identifier">key_type</span><span class="special">;</span> <span class="comment">// key type of the implementing container </span>
<span class="keyword">typedef</span> <span class="identifier">ImplMapT</span><span class="special">::</span><span class="identifier">value_type</span> <a name="boost.icl.interval_base_map.value_type"></a><span class="identifier">value_type</span><span class="special">;</span> <span class="comment">// value type of the implementing container </span>
<span class="keyword">typedef</span> <span class="identifier">ImplMapT</span><span class="special">::</span><span class="identifier">value_type</span><span class="special">::</span><span class="identifier">second_type</span> <a name="boost.icl.interval_base_map.data_type"></a><span class="identifier">data_type</span><span class="special">;</span> <span class="comment">// data type of the implementing container </span>
<span class="keyword">typedef</span> <span class="identifier">ImplMapT</span><span class="special">::</span><span class="identifier">pointer</span> <a name="boost.icl.interval_base_map.pointer"></a><span class="identifier">pointer</span><span class="special">;</span> <span class="comment">// pointer type </span>
<span class="keyword">typedef</span> <span class="identifier">ImplMapT</span><span class="special">::</span><span class="identifier">const_pointer</span> <a name="boost.icl.interval_base_map.const_pointer"></a><span class="identifier">const_pointer</span><span class="special">;</span> <span class="comment">// const pointer type </span>
<span class="keyword">typedef</span> <span class="identifier">ImplMapT</span><span class="special">::</span><span class="identifier">reference</span> <a name="boost.icl.interval_base_map.reference"></a><span class="identifier">reference</span><span class="special">;</span> <span class="comment">// reference type </span>
<span class="keyword">typedef</span> <span class="identifier">ImplMapT</span><span class="special">::</span><span class="identifier">const_reference</span> <a name="boost.icl.interval_base_map.const_reference"></a><span class="identifier">const_reference</span><span class="special">;</span> <span class="comment">// const reference type </span>
<span class="keyword">typedef</span> <span class="identifier">ImplMapT</span><span class="special">::</span><span class="identifier">iterator</span> <a name="boost.icl.interval_base_map.iterator"></a><span class="identifier">iterator</span><span class="special">;</span> <span class="comment">// iterator for iteration over intervals </span>
<span class="keyword">typedef</span> <span class="identifier">ImplMapT</span><span class="special">::</span><span class="identifier">const_iterator</span> <a name="boost.icl.interval_base_map.const_iterator"></a><span class="identifier">const_iterator</span><span class="special">;</span> <span class="comment">// const_iterator for iteration over intervals </span>
<span class="keyword">typedef</span> <span class="identifier">ImplMapT</span><span class="special">::</span><span class="identifier">reverse_iterator</span> <a name="boost.icl.interval_base_map.reverse_iterator"></a><span class="identifier">reverse_iterator</span><span class="special">;</span> <span class="comment">// iterator for reverse iteration over intervals </span>
<span class="keyword">typedef</span> <span class="identifier">ImplMapT</span><span class="special">::</span><span class="identifier">const_reverse_iterator</span> <a name="boost.icl.interval_base_map.const_reverse_iterator"></a><span class="identifier">const_reverse_iterator</span><span class="special">;</span> <span class="comment">// const_iterator for iteration over intervals </span>
<span class="keyword">typedef</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">icl</span><span class="special">::</span><span class="identifier">element_iterator</span><span class="special"><</span> <span class="identifier">iterator</span> <span class="special">></span> <a name="boost.icl.interval_base_map.element_iterator"></a><span class="identifier">element_iterator</span><span class="special">;</span> <span class="comment">// element iterator: Depreciated, see documentation. </span>
<span class="keyword">typedef</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">icl</span><span class="special">::</span><span class="identifier">element_iterator</span><span class="special"><</span> <span class="identifier">const_iterator</span> <span class="special">></span> <a name="boost.icl.interval_base_map.element_const_iterator"></a><span class="identifier">element_const_iterator</span><span class="special">;</span> <span class="comment">// const element iterator: Depreciated, see documentation. </span>
<span class="keyword">typedef</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">icl</span><span class="special">::</span><span class="identifier">element_iterator</span><span class="special"><</span> <span class="identifier">reverse_iterator</span> <span class="special">></span> <a name="boost.icl.interval_base_map.element_reverse_iterator"></a><span class="identifier">element_reverse_iterator</span><span class="special">;</span> <span class="comment">// element reverse iterator: Depreciated, see documentation. </span>
<span class="keyword">typedef</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">icl</span><span class="special">::</span><span class="identifier">element_iterator</span><span class="special"><</span> <span class="identifier">const_reverse_iterator</span> <span class="special">></span> <a name="boost.icl.interval_base_map.element_const__idp58130240"></a><span class="identifier">element_const_reverse_iterator</span><span class="special">;</span> <span class="comment">// element const reverse iterator: Depreciated, see documentation. </span>
<span class="keyword">typedef</span> <span class="identifier">on_absorbtion</span><span class="special"><</span> <a class="link" href="interval_base_map.html#boost.icl.interval_base_map.type">type</a><span class="special">,</span> <span class="identifier">codomain_combine</span><span class="special">,</span> <span class="identifier">Traits</span><span class="special">::</span><span class="identifier">absorbs_identities</span> <span class="special">></span><span class="special">::</span><a class="link" href="interval_base_map.html#boost.icl.interval_base_map.type">type</a> <a name="boost.icl.interval_base_map.on_codomain_absorbtion"></a><span class="identifier">on_codomain_absorbtion</span><span class="special">;</span>
<span class="comment">// member classes/structs/unions</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Type<span class="special">,</span> <span class="keyword">bool</span> has_set_semantics<span class="special">></span>
<span class="keyword">struct</span> <a class="link" href="interval_base_map/on_codomain_model.html" title="Struct template on_codomain_model">on_codomain_model</a> <span class="special">{</span>
<span class="special">}</span><span class="special">;</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Type<span class="special">></span>
<span class="keyword">struct</span> <a class="link" href="interval_base_map/on_codomain_mo_idp58006704.html" title="Struct template on_codomain_model<Type, false>">on_codomain_model</a><span class="special"><</span><span class="identifier">Type</span><span class="special">,</span> <span class="keyword">false</span><span class="special">></span> <span class="special">{</span>
<span class="comment">// types</span>
<span class="keyword">typedef</span> <span class="identifier">Type</span><span class="special">::</span><span class="identifier">interval_type</span> <a class="link" href="interval_base_map/on_codomain_mo_idp58006704.html#boost.icl.interval_base_map.on_codomain_mo_idp58006704.interval_type"><span class="identifier">interval_type</span></a><span class="special">;</span>
<span class="keyword">typedef</span> <span class="identifier">Type</span><span class="special">::</span><span class="identifier">codomain_type</span> <a class="link" href="interval_base_map/on_codomain_mo_idp58006704.html#boost.icl.interval_base_map.on_codomain_mo_idp58006704.codomain_type"><span class="identifier">codomain_type</span></a><span class="special">;</span>
<span class="keyword">typedef</span> <span class="identifier">Type</span><span class="special">::</span><span class="identifier">segment_type</span> <a class="link" href="interval_base_map/on_codomain_mo_idp58006704.html#boost.icl.interval_base_map.on_codomain_mo_idp58006704.segment_type"><span class="identifier">segment_type</span></a><span class="special">;</span>
<span class="keyword">typedef</span> <span class="identifier">Type</span><span class="special">::</span><span class="identifier">codomain_combine</span> <a class="link" href="interval_base_map/on_codomain_mo_idp58006704.html#boost.icl.interval_base_map.on_codomain_mo_idp58006704.codomain_combine"><span class="identifier">codomain_combine</span></a><span class="special">;</span>
<span class="comment">// <a class="link" href="interval_base_map/on_codomain_mo_idp58006704.html#idp58012048-bb">public static functions</a></span>
<span class="keyword">static</span> <span class="keyword">void</span> <a class="link" href="interval_base_map/on_codomain_mo_idp58006704.html#idp58012608-bb"><span class="identifier">add</span></a><span class="special">(</span><span class="identifier">Type</span> <span class="special">&</span><span class="special">,</span> <span class="identifier">interval_type</span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">codomain_type</span> <span class="special">&</span><span class="special">,</span>
<span class="keyword">const</span> <span class="identifier">codomain_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="special">}</span><span class="special">;</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Type<span class="special">></span>
<span class="keyword">struct</span> <a class="link" href="interval_base_map/on_codomain_mo_idp58016640.html" title="Struct template on_codomain_model<Type, true>">on_codomain_model</a><span class="special"><</span><span class="identifier">Type</span><span class="special">,</span> <span class="keyword">true</span><span class="special">></span> <span class="special">{</span>
<span class="comment">// types</span>
<span class="keyword">typedef</span> <span class="identifier">Type</span><span class="special">::</span><span class="identifier">interval_type</span> <a class="link" href="interval_base_map/on_codomain_mo_idp58016640.html#boost.icl.interval_base_map.on_codomain_mo_idp58016640.interval_type"><span class="identifier">interval_type</span></a><span class="special">;</span>
<span class="keyword">typedef</span> <span class="identifier">Type</span><span class="special">::</span><span class="identifier">codomain_type</span> <a class="link" href="interval_base_map/on_codomain_mo_idp58016640.html#boost.icl.interval_base_map.on_codomain_mo_idp58016640.codomain_type"><span class="identifier">codomain_type</span></a><span class="special">;</span>
<span class="keyword">typedef</span> <span class="identifier">Type</span><span class="special">::</span><span class="identifier">segment_type</span> <a class="link" href="interval_base_map/on_codomain_mo_idp58016640.html#boost.icl.interval_base_map.on_codomain_mo_idp58016640.segment_type"><span class="identifier">segment_type</span></a><span class="special">;</span>
<span class="keyword">typedef</span> <span class="identifier">Type</span><span class="special">::</span><span class="identifier">codomain_combine</span> <a class="link" href="interval_base_map/on_codomain_mo_idp58016640.html#boost.icl.interval_base_map.on_codomain_mo_idp58016640.codomain_combine"><span class="identifier">codomain_combine</span></a><span class="special">;</span>
<span class="keyword">typedef</span> <span class="identifier">Type</span><span class="special">::</span><span class="identifier">inverse_codomain_intersect</span> <a class="link" href="interval_base_map/on_codomain_mo_idp58016640.html#boost.icl.interval_base_map.on_codomain_mo_idp58016640.inverse_codomain_intersect"><span class="identifier">inverse_codomain_intersect</span></a><span class="special">;</span>
<span class="comment">// <a class="link" href="interval_base_map/on_codomain_mo_idp58016640.html#idp58022864-bb">public static functions</a></span>
<span class="keyword">static</span> <span class="keyword">void</span> <a class="link" href="interval_base_map/on_codomain_mo_idp58016640.html#idp58023424-bb"><span class="identifier">add</span></a><span class="special">(</span><span class="identifier">Type</span> <span class="special">&</span><span class="special">,</span> <span class="identifier">interval_type</span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">codomain_type</span> <span class="special">&</span><span class="special">,</span>
<span class="keyword">const</span> <span class="identifier">codomain_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="special">}</span><span class="special">;</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Type<span class="special">,</span> <span class="keyword">bool</span> is_total<span class="special">></span>
<span class="keyword">struct</span> <a class="link" href="interval_base_map/on_definedness.html" title="Struct template on_definedness">on_definedness</a> <span class="special">{</span>
<span class="special">}</span><span class="special">;</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Type<span class="special">></span>
<span class="keyword">struct</span> <a class="link" href="interval_base_map/on_definedness_idp58029552.html" title="Struct template on_definedness<Type, false>">on_definedness</a><span class="special"><</span><span class="identifier">Type</span><span class="special">,</span> <span class="keyword">false</span><span class="special">></span> <span class="special">{</span>
<span class="comment">// <a class="link" href="interval_base_map/on_definedness_idp58029552.html#idp58031504-bb">public static functions</a></span>
<span class="keyword">static</span> <span class="keyword">void</span> <a class="link" href="interval_base_map/on_definedness_idp58029552.html#idp58032064-bb"><span class="identifier">add_intersection</span></a><span class="special">(</span><span class="identifier">Type</span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Type</span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="special">}</span><span class="special">;</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Type<span class="special">></span>
<span class="keyword">struct</span> <a class="link" href="interval_base_map/on_definedness_idp58035408.html" title="Struct template on_definedness<Type, true>">on_definedness</a><span class="special"><</span><span class="identifier">Type</span><span class="special">,</span> <span class="keyword">true</span><span class="special">></span> <span class="special">{</span>
<span class="comment">// <a class="link" href="interval_base_map/on_definedness_idp58035408.html#idp58037360-bb">public static functions</a></span>
<span class="keyword">static</span> <span class="keyword">void</span> <a class="link" href="interval_base_map/on_definedness_idp58035408.html#idp58037920-bb"><span class="identifier">add_intersection</span></a><span class="special">(</span><span class="identifier">Type</span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Type</span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="special">}</span><span class="special">;</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Type<span class="special">,</span> <span class="keyword">bool</span> is_total_invertible<span class="special">></span>
<span class="keyword">struct</span> <a class="link" href="interval_base_map/on_invertible.html" title="Struct template on_invertible">on_invertible</a> <span class="special">{</span>
<span class="special">}</span><span class="special">;</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Type<span class="special">></span>
<span class="keyword">struct</span> <a class="link" href="interval_base_map/on_invertible__idp58043360.html" title="Struct template on_invertible<Type, false>">on_invertible</a><span class="special"><</span><span class="identifier">Type</span><span class="special">,</span> <span class="keyword">false</span><span class="special">></span> <span class="special">{</span>
<span class="comment">// types</span>
<span class="keyword">typedef</span> <span class="identifier">Type</span><span class="special">::</span><span class="identifier">segment_type</span> <a class="link" href="interval_base_map/on_invertible__idp58043360.html#boost.icl.interval_base_map.on_invertible__idp58043360.segment_type"><span class="identifier">segment_type</span></a><span class="special">;</span>
<span class="keyword">typedef</span> <span class="identifier">Type</span><span class="special">::</span><span class="identifier">inverse_codomain_combine</span> <a class="link" href="interval_base_map/on_invertible__idp58043360.html#boost.icl.interval_base_map.on_invertible__idp58043360.inverse_codomain_combine"><span class="identifier">inverse_codomain_combine</span></a><span class="special">;</span>
<span class="comment">// <a class="link" href="interval_base_map/on_invertible__idp58043360.html#idp58047040-bb">public static functions</a></span>
<span class="keyword">static</span> <span class="keyword">void</span> <a class="link" href="interval_base_map/on_invertible__idp58043360.html#idp58047600-bb"><span class="identifier">subtract</span></a><span class="special">(</span><span class="identifier">Type</span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="special">}</span><span class="special">;</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Type<span class="special">></span>
<span class="keyword">struct</span> <a class="link" href="interval_base_map/on_invertible__idp58050256.html" title="Struct template on_invertible<Type, true>">on_invertible</a><span class="special"><</span><span class="identifier">Type</span><span class="special">,</span> <span class="keyword">true</span><span class="special">></span> <span class="special">{</span>
<span class="comment">// types</span>
<span class="keyword">typedef</span> <span class="identifier">Type</span><span class="special">::</span><span class="identifier">segment_type</span> <a class="link" href="interval_base_map/on_invertible__idp58050256.html#boost.icl.interval_base_map.on_invertible__idp58050256.segment_type"><span class="identifier">segment_type</span></a><span class="special">;</span>
<span class="keyword">typedef</span> <span class="identifier">Type</span><span class="special">::</span><span class="identifier">inverse_codomain_combine</span> <a class="link" href="interval_base_map/on_invertible__idp58050256.html#boost.icl.interval_base_map.on_invertible__idp58050256.inverse_codomain_combine"><span class="identifier">inverse_codomain_combine</span></a><span class="special">;</span>
<span class="comment">// <a class="link" href="interval_base_map/on_invertible__idp58050256.html#idp58053936-bb">public static functions</a></span>
<span class="keyword">static</span> <span class="keyword">void</span> <a class="link" href="interval_base_map/on_invertible__idp58050256.html#idp58054496-bb"><span class="identifier">subtract</span></a><span class="special">(</span><span class="identifier">Type</span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="special">}</span><span class="special">;</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Type<span class="special">,</span> <span class="keyword">bool</span> is_total<span class="special">,</span> <span class="keyword">bool</span> absorbs_identities<span class="special">></span>
<span class="keyword">struct</span> <a class="link" href="interval_base_map/on_total_absorbable.html" title="Struct template on_total_absorbable">on_total_absorbable</a> <span class="special">{</span>
<span class="special">}</span><span class="special">;</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Type<span class="special">,</span> <span class="keyword">bool</span> absorbs_identities<span class="special">></span>
<span class="keyword">struct</span> <a class="link" href="interval_base_map/on_total_absor_idp58060096.html" title="Struct template on_total_absorbable<Type, false, absorbs_identities>">on_total_absorbable</a><span class="special"><</span><span class="identifier">Type</span><span class="special">,</span> <span class="keyword">false</span><span class="special">,</span> <span class="identifier">absorbs_identities</span><span class="special">></span> <span class="special">{</span>
<span class="comment">// types</span>
<span class="keyword">typedef</span> <span class="identifier">Type</span><span class="special">::</span><span class="identifier">segment_type</span> <a class="link" href="interval_base_map/on_total_absor_idp58060096.html#boost.icl.interval_base_map.on_total_absor_idp58060096.segment_type"><span class="identifier">segment_type</span></a><span class="special">;</span>
<span class="keyword">typedef</span> <span class="identifier">Type</span><span class="special">::</span><span class="identifier">codomain_type</span> <a class="link" href="interval_base_map/on_total_absor_idp58060096.html#boost.icl.interval_base_map.on_total_absor_idp58060096.codomain_type"><span class="identifier">codomain_type</span></a><span class="special">;</span>
<span class="keyword">typedef</span> <span class="identifier">Type</span><span class="special">::</span><span class="identifier">interval_type</span> <a class="link" href="interval_base_map/on_total_absor_idp58060096.html#boost.icl.interval_base_map.on_total_absor_idp58060096.interval_type"><span class="identifier">interval_type</span></a><span class="special">;</span>
<span class="keyword">typedef</span> <span class="identifier">Type</span><span class="special">::</span><span class="identifier">value_type</span> <a class="link" href="interval_base_map/on_total_absor_idp58060096.html#boost.icl.interval_base_map.on_total_absor_idp58060096.value_type"><span class="identifier">value_type</span></a><span class="special">;</span>
<span class="keyword">typedef</span> <span class="identifier">Type</span><span class="special">::</span><span class="identifier">const_iterator</span> <a class="link" href="interval_base_map/on_total_absor_idp58060096.html#boost.icl.interval_base_map.on_total_absor_idp58060096.const_iterator"><span class="identifier">const_iterator</span></a><span class="special">;</span>
<span class="keyword">typedef</span> <span class="identifier">Type</span><span class="special">::</span><span class="identifier">set_type</span> <a class="link" href="interval_base_map/on_total_absor_idp58060096.html#boost.icl.interval_base_map.on_total_absor_idp58060096.set_type"><span class="identifier">set_type</span></a><span class="special">;</span>
<span class="keyword">typedef</span> <span class="identifier">Type</span><span class="special">::</span><span class="identifier">inverse_codomain_intersect</span> <a class="link" href="interval_base_map/on_total_absor_idp58060096.html#boost.icl.interval_base_map.on_total_absor_idp58060096.inverse_codomain_intersect"><span class="identifier">inverse_codomain_intersect</span></a><span class="special">;</span>
<span class="comment">// <a class="link" href="interval_base_map/on_total_absor_idp58060096.html#idp58069152-bb">public static functions</a></span>
<span class="keyword">static</span> <span class="keyword">void</span> <a class="link" href="interval_base_map/on_total_absor_idp58060096.html#idp58069712-bb"><span class="identifier">flip</span></a><span class="special">(</span><span class="identifier">Type</span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="special">}</span><span class="special">;</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Type<span class="special">></span>
<span class="keyword">struct</span> <a class="link" href="interval_base_map/on_total_absor_idp58072368.html" title="Struct template on_total_absorbable<Type, true, false>">on_total_absorbable</a><span class="special"><</span><span class="identifier">Type</span><span class="special">,</span> <span class="keyword">true</span><span class="special">,</span> <span class="keyword">false</span><span class="special">></span> <span class="special">{</span>
<span class="comment">// types</span>
<span class="keyword">typedef</span> <span class="identifier">Type</span><span class="special">::</span><span class="identifier">segment_type</span> <a class="link" href="interval_base_map/on_total_absor_idp58072368.html#boost.icl.interval_base_map.on_total_absor_idp58072368.segment_type"><span class="identifier">segment_type</span></a><span class="special">;</span>
<span class="keyword">typedef</span> <span class="identifier">Type</span><span class="special">::</span><span class="identifier">codomain_type</span> <a class="link" href="interval_base_map/on_total_absor_idp58072368.html#boost.icl.interval_base_map.on_total_absor_idp58072368.codomain_type"><span class="identifier">codomain_type</span></a><span class="special">;</span>
<span class="comment">// <a class="link" href="interval_base_map/on_total_absor_idp58072368.html#idp58076304-bb">public static functions</a></span>
<span class="keyword">static</span> <span class="keyword">void</span> <a class="link" href="interval_base_map/on_total_absor_idp58072368.html#idp58076864-bb"><span class="identifier">flip</span></a><span class="special">(</span><span class="identifier">Type</span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="special">}</span><span class="special">;</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Type<span class="special">></span>
<span class="keyword">struct</span> <a class="link" href="interval_base_map/on_total_absor_idp58079520.html" title="Struct template on_total_absorbable<Type, true, true>">on_total_absorbable</a><span class="special"><</span><span class="identifier">Type</span><span class="special">,</span> <span class="keyword">true</span><span class="special">,</span> <span class="keyword">true</span><span class="special">></span> <span class="special">{</span>
<span class="comment">// <a class="link" href="interval_base_map/on_total_absor_idp58079520.html#idp58081760-bb">public static functions</a></span>
<span class="keyword">static</span> <span class="keyword">void</span> <a class="link" href="interval_base_map/on_total_absor_idp58079520.html#idp58082320-bb"><span class="identifier">flip</span></a><span class="special">(</span><span class="identifier">Type</span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">typename</span> <span class="identifier">Type</span><span class="special">::</span><span class="identifier">segment_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="special">}</span><span class="special">;</span>
<span class="comment">// <a class="link" href="interval_base_map.html#boost.icl.interval_base_mapconstruct-copy-destruct">construct/copy/destruct</a></span>
<a class="link" href="interval_base_map.html#idp58241680-bb"><span class="identifier">interval_base_map</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span>
<a class="link" href="interval_base_map.html#idp58242416-bb"><span class="identifier">interval_base_map</span></a><span class="special">(</span><span class="keyword">const</span> <a class="link" href="interval_base_map.html" title="Class template interval_base_map">interval_base_map</a> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<a class="link" href="interval_base_map.html#idp58244256-bb"><span class="identifier">interval_base_map</span></a><span class="special">(</span><a class="link" href="interval_base_map.html" title="Class template interval_base_map">interval_base_map</a> <span class="special">&&</span><span class="special">)</span><span class="special">;</span>
<a class="link" href="interval_base_map.html" title="Class template interval_base_map">interval_base_map</a> <span class="special">&</span> <a class="link" href="interval_base_map.html#idp58245936-bb"><span class="keyword">operator</span><span class="special">=</span></a><span class="special">(</span><a class="link" href="interval_base_map.html" title="Class template interval_base_map">interval_base_map</a><span class="special">)</span><span class="special">;</span>
<span class="comment">// <a class="link" href="interval_base_map.html#idp58133088-bb">public member functions</a></span>
<span class="keyword">typedef</span> <a class="link" href="interval_base_map.html#idp58133648-bb"><span class="identifier">ICL_INTERVAL_TYPE</span></a><span class="special">(</span><span class="identifier">Interval</span><span class="special">,</span> <span class="identifier">DomainT</span><span class="special">,</span> <span class="identifier">Compare</span><span class="special">)</span><span class="special">;</span>
<span class="keyword">typedef</span> <a class="link" href="interval_base_map.html#idp58136864-bb"><span class="identifier">ICL_COMPARE_DOMAIN</span></a><span class="special">(</span><span class="identifier">Compare</span><span class="special">,</span> <span class="identifier">DomainT</span><span class="special">)</span><span class="special">;</span>
<span class="keyword">typedef</span> <a class="link" href="interval_base_map.html#idp58139392-bb"><span class="identifier">ICL_COMPARE_DOMAIN</span></a><span class="special">(</span><span class="identifier">Compare</span><span class="special">,</span> <span class="identifier">segment_type</span><span class="special">)</span><span class="special">;</span>
<span class="keyword">typedef</span> <a class="link" href="interval_base_map.html#idp58141616-bb"><span class="identifier">ICL_COMBINE_CODOMAIN</span></a><span class="special">(</span><span class="identifier">Combine</span><span class="special">,</span> <span class="identifier">CodomainT</span><span class="special">)</span><span class="special">;</span>
<a class="link" href="interval_base_map.html#idp58144160-bb"><span class="identifier">BOOST_STATIC_CONSTANT</span></a><span class="special">(</span><span class="keyword">bool</span><span class="special">,</span>
<span class="identifier">is_total_invertible</span> <span class="special">=</span> <span class="special">(</span><span class="identifier">Traits</span><span class="special">::</span><span class="identifier">is_total</span> <span class="special">&&</span><span class="identifier">has_inverse</span><span class="special"><</span> <span class="identifier">codomain_type</span> <span class="special">></span><span class="special">::</span><span class="identifier">value</span><span class="special">)</span><span class="special">)</span><span class="special">;</span>
<a class="link" href="interval_base_map.html#idp58146560-bb"><span class="identifier">BOOST_STATIC_CONSTANT</span></a><span class="special">(</span><span class="keyword">int</span><span class="special">,</span> <span class="identifier">fineness</span> <span class="special">=</span> <span class="number">0</span><span class="special">)</span><span class="special">;</span>
<span class="keyword">void</span> <a class="link" href="interval_base_map.html#idp58148912-bb"><span class="identifier">swap</span></a><span class="special">(</span><a class="link" href="interval_base_map.html" title="Class template interval_base_map">interval_base_map</a> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="keyword">void</span> <a class="link" href="interval_base_map.html#idp58151168-bb"><span class="identifier">clear</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span>
<span class="keyword">bool</span> <a class="link" href="interval_base_map.html#idp58152432-bb"><span class="identifier">empty</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
<span class="identifier">size_type</span> <a class="link" href="interval_base_map.html#idp58153968-bb"><span class="identifier">size</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> <a class="link" href="interval_base_map.html#idp58155536-bb"><span class="identifier">iterative_size</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
<span class="identifier">const_iterator</span> <a class="link" href="interval_base_map.html#idp58157104-bb"><span class="identifier">find</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">domain_type</span> <span class="special">&</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
<span class="identifier">const_iterator</span> <a class="link" href="interval_base_map.html#idp58159808-bb"><span class="identifier">find</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">interval_type</span> <span class="special">&</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
<span class="identifier">codomain_type</span> <a class="link" href="interval_base_map.html#idp58162528-bb"><span class="keyword">operator</span><span class="special">(</span><span class="special">)</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">domain_type</span> <span class="special">&</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
<span class="identifier">SubType</span> <span class="special">&</span> <a class="link" href="interval_base_map.html#idp58164752-bb"><span class="identifier">add</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">element_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="identifier">SubType</span> <span class="special">&</span> <a class="link" href="interval_base_map.html#idp58166736-bb"><span class="identifier">add</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="identifier">iterator</span> <a class="link" href="interval_base_map.html#idp58168720-bb"><span class="identifier">add</span></a><span class="special">(</span><span class="identifier">iterator</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="identifier">SubType</span> <span class="special">&</span> <a class="link" href="interval_base_map.html#idp58172752-bb"><span class="identifier">subtract</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">element_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="identifier">SubType</span> <span class="special">&</span> <a class="link" href="interval_base_map.html#idp58174736-bb"><span class="identifier">subtract</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="identifier">SubType</span> <span class="special">&</span> <a class="link" href="interval_base_map.html#idp58176720-bb"><span class="identifier">insert</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">element_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="identifier">SubType</span> <span class="special">&</span> <a class="link" href="interval_base_map.html#idp58179120-bb"><span class="identifier">insert</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="identifier">iterator</span> <a class="link" href="interval_base_map.html#idp58181520-bb"><span class="identifier">insert</span></a><span class="special">(</span><span class="identifier">iterator</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="identifier">SubType</span> <span class="special">&</span> <a class="link" href="interval_base_map.html#idp58185552-bb"><span class="identifier">set</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">element_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="identifier">SubType</span> <span class="special">&</span> <a class="link" href="interval_base_map.html#idp58188848-bb"><span class="identifier">set</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="identifier">SubType</span> <span class="special">&</span> <a class="link" href="interval_base_map.html#idp58192176-bb"><span class="identifier">erase</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">element_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="identifier">SubType</span> <span class="special">&</span> <a class="link" href="interval_base_map.html#idp58194576-bb"><span class="identifier">erase</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="identifier">SubType</span> <span class="special">&</span> <a class="link" href="interval_base_map.html#idp58196976-bb"><span class="identifier">erase</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">domain_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="identifier">SubType</span> <span class="special">&</span> <a class="link" href="interval_base_map.html#idp58199392-bb"><span class="identifier">erase</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">interval_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="keyword">void</span> <a class="link" href="interval_base_map.html#idp58201824-bb"><span class="identifier">erase</span></a><span class="special">(</span><span class="identifier">iterator</span><span class="special">)</span><span class="special">;</span>
<span class="keyword">void</span> <a class="link" href="interval_base_map.html#idp58204272-bb"><span class="identifier">erase</span></a><span class="special">(</span><span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">iterator</span><span class="special">)</span><span class="special">;</span>
<span class="keyword">void</span> <a class="link" href="interval_base_map.html#idp58207392-bb"><span class="identifier">add_intersection</span></a><span class="special">(</span><span class="identifier">SubType</span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
<span class="identifier">SubType</span> <span class="special">&</span> <a class="link" href="interval_base_map.html#idp58211648-bb"><span class="identifier">flip</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">element_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="identifier">SubType</span> <span class="special">&</span> <a class="link" href="interval_base_map.html#idp58214512-bb"><span class="identifier">flip</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="identifier">iterator</span> <a class="link" href="interval_base_map.html#idp58217376-bb"><span class="identifier">lower_bound</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="identifier">iterator</span> <a class="link" href="interval_base_map.html#idp58218912-bb"><span class="identifier">upper_bound</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="identifier">const_iterator</span> <a class="link" href="interval_base_map.html#idp58220448-bb"><span class="identifier">lower_bound</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
<span class="identifier">const_iterator</span> <a class="link" href="interval_base_map.html#idp58222256-bb"><span class="identifier">upper_bound</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="special">></span> <a class="link" href="interval_base_map.html#idp58224064-bb"><span class="identifier">equal_range</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">const_iterator</span> <span class="special">></span>
<a class="link" href="interval_base_map.html#idp58225616-bb"><span class="identifier">equal_range</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
<span class="identifier">iterator</span> <a class="link" href="interval_base_map.html#idp58227456-bb"><span class="identifier">begin</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span>
<span class="identifier">iterator</span> <a class="link" href="interval_base_map.html#idp58228304-bb"><span class="identifier">end</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span>
<span class="identifier">const_iterator</span> <a class="link" href="interval_base_map.html#idp58229152-bb"><span class="identifier">begin</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
<span class="identifier">const_iterator</span> <a class="link" href="interval_base_map.html#idp58230272-bb"><span class="identifier">end</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
<span class="identifier">reverse_iterator</span> <a class="link" href="interval_base_map.html#idp58231392-bb"><span class="identifier">rbegin</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span>
<span class="identifier">reverse_iterator</span> <a class="link" href="interval_base_map.html#idp58232240-bb"><span class="identifier">rend</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span>
<span class="identifier">const_reverse_iterator</span> <a class="link" href="interval_base_map.html#idp58233088-bb"><span class="identifier">rbegin</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
<span class="identifier">const_reverse_iterator</span> <a class="link" href="interval_base_map.html#idp58234208-bb"><span class="identifier">rend</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Combiner<span class="special">></span>
<a class="link" href="interval_base_map.html" title="Class template interval_base_map">interval_base_map</a><span class="special"><</span> <span class="identifier">SubType</span><span class="special">,</span> <span class="identifier">DomainT</span><span class="special">,</span> <span class="identifier">CodomainT</span><span class="special">,</span> <span class="identifier">Traits</span><span class="special">,</span> <span class="identifier">Compare</span><span class="special">,</span> <span class="identifier">Combine</span><span class="special">,</span> <span class="identifier">Section</span><span class="special">,</span> <span class="identifier">Interval</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">></span><span class="special">::</span><span class="identifier">iterator</span>
<a class="link" href="interval_base_map.html#idp58235328-bb"><span class="identifier">_add</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Combiner<span class="special">></span>
<a class="link" href="interval_base_map.html" title="Class template interval_base_map">interval_base_map</a><span class="special"><</span> <span class="identifier">SubType</span><span class="special">,</span> <span class="identifier">DomainT</span><span class="special">,</span> <span class="identifier">CodomainT</span><span class="special">,</span> <span class="identifier">Traits</span><span class="special">,</span> <span class="identifier">Compare</span><span class="special">,</span> <span class="identifier">Combine</span><span class="special">,</span> <span class="identifier">Section</span><span class="special">,</span> <span class="identifier">Interval</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">></span><span class="special">::</span><span class="identifier">iterator</span>
<a class="link" href="interval_base_map.html#idp58238080-bb"><span class="identifier">_add</span></a><span class="special">(</span><span class="identifier">iterator</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="comment">// <a class="link" href="interval_base_map.html#idp58248048-bb">private member functions</a></span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Combiner<span class="special">></span> <span class="identifier">iterator</span> <a class="link" href="interval_base_map.html#idp58248624-bb"><span class="identifier">_add</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Combiner<span class="special">></span> <span class="identifier">iterator</span> <a class="link" href="interval_base_map.html#idp58251008-bb"><span class="identifier">_add</span></a><span class="special">(</span><span class="identifier">iterator</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Combiner<span class="special">></span> <span class="keyword">void</span> <a class="link" href="interval_base_map.html#idp58254080-bb"><span class="identifier">_subtract</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="identifier">iterator</span> <a class="link" href="interval_base_map.html#idp58256464-bb"><span class="identifier">_insert</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="identifier">iterator</span> <a class="link" href="interval_base_map.html#idp58258000-bb"><span class="identifier">_insert</span></a><span class="special">(</span><span class="identifier">iterator</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Combiner<span class="special">></span>
<span class="keyword">void</span> <a class="link" href="interval_base_map.html#idp58260224-bb"><span class="identifier">add_segment</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">interval_type</span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">CodomainT</span> <span class="special">&</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Combiner<span class="special">></span>
<span class="keyword">void</span> <a class="link" href="interval_base_map.html#idp58263984-bb"><span class="identifier">add_main</span></a><span class="special">(</span><span class="identifier">interval_type</span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">CodomainT</span> <span class="special">&</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="special">&</span><span class="special">,</span>
<span class="keyword">const</span> <span class="identifier">iterator</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Combiner<span class="special">></span>
<span class="keyword">void</span> <a class="link" href="interval_base_map.html#idp58268432-bb"><span class="identifier">add_rear</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">interval_type</span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">CodomainT</span> <span class="special">&</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="keyword">void</span> <a class="link" href="interval_base_map.html#idp58272192-bb"><span class="identifier">add_front</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">interval_type</span> <span class="special">&</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="keyword">void</span> <a class="link" href="interval_base_map.html#idp58274416-bb"><span class="identifier">subtract_front</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">interval_type</span> <span class="special">&</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Combiner<span class="special">></span>
<span class="keyword">void</span> <a class="link" href="interval_base_map.html#idp58276640-bb"><span class="identifier">subtract_main</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">CodomainT</span> <span class="special">&</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">iterator</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Combiner<span class="special">></span>
<span class="keyword">void</span> <a class="link" href="interval_base_map.html#idp58280400-bb"><span class="identifier">subtract_rear</span></a><span class="special">(</span><span class="identifier">interval_type</span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">CodomainT</span> <span class="special">&</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="keyword">void</span> <a class="link" href="interval_base_map.html#idp58284160-bb"><span class="identifier">insert_main</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">interval_type</span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">CodomainT</span> <span class="special">&</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="special">&</span><span class="special">,</span>
<span class="keyword">const</span> <span class="identifier">iterator</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="keyword">void</span> <a class="link" href="interval_base_map.html#idp58287760-bb"><span class="identifier">erase_rest</span></a><span class="special">(</span><span class="identifier">interval_type</span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">CodomainT</span> <span class="special">&</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="special">&</span><span class="special">,</span>
<span class="keyword">const</span> <span class="identifier">iterator</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> FragmentT<span class="special">></span>
<span class="keyword">void</span> <a class="link" href="interval_base_map.html#idp58291360-bb"><span class="identifier">total_add_intersection</span></a><span class="special">(</span><span class="identifier">SubType</span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">FragmentT</span> <span class="special">&</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
<span class="keyword">void</span> <a class="link" href="interval_base_map.html#idp58294704-bb"><span class="identifier">partial_add_intersection</span></a><span class="special">(</span><span class="identifier">SubType</span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
<span class="keyword">void</span> <a class="link" href="interval_base_map.html#idp58297216-bb"><span class="identifier">partial_add_intersection</span></a><span class="special">(</span><span class="identifier">SubType</span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">element_type</span> <span class="special">&</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
<span class="comment">// <a class="link" href="interval_base_map.html#idp58299888-bb">protected member functions</a></span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Combiner<span class="special">></span>
<span class="identifier">iterator</span> <a class="link" href="interval_base_map.html#idp58300464-bb"><span class="identifier">gap_insert</span></a><span class="special">(</span><span class="identifier">iterator</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">interval_type</span> <span class="special">&</span><span class="special">,</span>
<span class="keyword">const</span> <span class="identifier">codomain_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Combiner<span class="special">></span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="identifier">iterator</span><span class="special">,</span> <span class="keyword">bool</span> <span class="special">></span>
<a class="link" href="interval_base_map.html#idp58304224-bb"><span class="identifier">add_at</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">iterator</span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">interval_type</span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">codomain_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="identifier">iterator</span><span class="special">,</span> <span class="keyword">bool</span> <span class="special">></span>
<a class="link" href="interval_base_map.html#idp58308000-bb"><span class="identifier">insert_at</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">iterator</span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">interval_type</span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">codomain_type</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="identifier">sub_type</span> <span class="special">*</span> <a class="link" href="interval_base_map.html#idp58310928-bb"><span class="identifier">that</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span>
<span class="keyword">const</span> <span class="identifier">sub_type</span> <span class="special">*</span> <a class="link" href="interval_base_map.html#idp58311776-bb"><span class="identifier">that</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
<span class="special">}</span><span class="special">;</span></pre></div>
<div class="refsect1">
<a name="idp114011632"></a><h2>Description</h2>
<div class="refsect2">
<a name="idp114012048"></a><h3>
<a name="boost.icl.interval_base_mapconstruct-copy-destruct"></a><code class="computeroutput">interval_base_map</code>
public
construct/copy/destruct</h3>
<div class="orderedlist"><ol class="orderedlist" type="1">
<li class="listitem">
<pre class="literallayout"><a name="idp58241680-bb"></a><span class="identifier">interval_base_map</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
<p>Default constructor for the empty object </p>
</li>
<li class="listitem">
<pre class="literallayout"><a name="idp58242416-bb"></a><span class="identifier">interval_base_map</span><span class="special">(</span><span class="keyword">const</span> <a class="link" href="interval_base_map.html" title="Class template interval_base_map">interval_base_map</a> <span class="special">&</span> src<span class="special">)</span><span class="special">;</span></pre>
<p>Copy constructor </p>
</li>
<li class="listitem">
<pre class="literallayout"><a name="idp58244256-bb"></a><span class="identifier">interval_base_map</span><span class="special">(</span><a class="link" href="interval_base_map.html" title="Class template interval_base_map">interval_base_map</a> <span class="special">&&</span> src<span class="special">)</span><span class="special">;</span></pre>
<p>Move constructor </p>
</li>
<li class="listitem">
<pre class="literallayout"><a class="link" href="interval_base_map.html" title="Class template interval_base_map">interval_base_map</a> <span class="special">&</span> <a name="idp58245936-bb"></a><span class="keyword">operator</span><span class="special">=</span><span class="special">(</span><a class="link" href="interval_base_map.html" title="Class template interval_base_map">interval_base_map</a> src<span class="special">)</span><span class="special">;</span></pre>
<p>Move assignment operator </p>
</li>
</ol></div>
</div>
<div class="refsect2">
<a name="idp114036784"></a><h3>
<a name="idp58133088-bb"></a><code class="computeroutput">interval_base_map</code> public member functions</h3>
<div class="orderedlist"><ol class="orderedlist" type="1">
<li class="listitem">
<pre class="literallayout"><span class="keyword">typedef</span> <a name="idp58133648-bb"></a><span class="identifier">ICL_INTERVAL_TYPE</span><span class="special">(</span><span class="identifier">Interval</span><span class="special">,</span> <span class="identifier">DomainT</span><span class="special">,</span> <span class="identifier">Compare</span><span class="special">)</span><span class="special">;</span></pre>The interval type of the map. </li>
<li class="listitem">
<pre class="literallayout"><span class="keyword">typedef</span> <a name="idp58136864-bb"></a><span class="identifier">ICL_COMPARE_DOMAIN</span><span class="special">(</span><span class="identifier">Compare</span><span class="special">,</span> <span class="identifier">DomainT</span><span class="special">)</span><span class="special">;</span></pre>Comparison functor for domain values. </li>
<li class="listitem"><pre class="literallayout"><span class="keyword">typedef</span> <a name="idp58139392-bb"></a><span class="identifier">ICL_COMPARE_DOMAIN</span><span class="special">(</span><span class="identifier">Compare</span><span class="special">,</span> <span class="identifier">segment_type</span><span class="special">)</span><span class="special">;</span></pre></li>
<li class="listitem">
<pre class="literallayout"><span class="keyword">typedef</span> <a name="idp58141616-bb"></a><span class="identifier">ICL_COMBINE_CODOMAIN</span><span class="special">(</span><span class="identifier">Combine</span><span class="special">,</span> <span class="identifier">CodomainT</span><span class="special">)</span><span class="special">;</span></pre>Combine functor for codomain value aggregation. </li>
<li class="listitem"><pre class="literallayout"> <a name="idp58144160-bb"></a><span class="identifier">BOOST_STATIC_CONSTANT</span><span class="special">(</span><span class="keyword">bool</span><span class="special">,</span>
<span class="identifier">is_total_invertible</span> <span class="special">=</span> <span class="special">(</span><span class="identifier">Traits</span><span class="special">::</span><span class="identifier">is_total</span> <span class="special">&&</span><span class="identifier">has_inverse</span><span class="special"><</span> <span class="identifier">codomain_type</span> <span class="special">></span><span class="special">::</span><span class="identifier">value</span><span class="special">)</span><span class="special">)</span><span class="special">;</span></pre></li>
<li class="listitem"><pre class="literallayout"> <a name="idp58146560-bb"></a><span class="identifier">BOOST_STATIC_CONSTANT</span><span class="special">(</span><span class="keyword">int</span><span class="special">,</span> <span class="identifier">fineness</span> <span class="special">=</span> <span class="number">0</span><span class="special">)</span><span class="special">;</span></pre></li>
<li class="listitem">
<pre class="literallayout"><span class="keyword">void</span> <a name="idp58148912-bb"></a><span class="identifier">swap</span><span class="special">(</span><a class="link" href="interval_base_map.html" title="Class template interval_base_map">interval_base_map</a> <span class="special">&</span> object<span class="special">)</span><span class="special">;</span></pre>
<p>swap the content of containers </p>
</li>
<li class="listitem">
<pre class="literallayout"><span class="keyword">void</span> <a name="idp58151168-bb"></a><span class="identifier">clear</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
<p>clear the map </p>
</li>
<li class="listitem">
<pre class="literallayout"><span class="keyword">bool</span> <a name="idp58152432-bb"></a><span class="identifier">empty</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
<p>is the map empty? </p>
</li>
<li class="listitem">
<pre class="literallayout"><span class="identifier">size_type</span> <a name="idp58153968-bb"></a><span class="identifier">size</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
<p>An interval map's size is it's cardinality </p>
</li>
<li class="listitem">
<pre class="literallayout"><span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> <a name="idp58155536-bb"></a><span class="identifier">iterative_size</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
<p>Size of the iteration over this container </p>
</li>
<li class="listitem">
<pre class="literallayout"><span class="identifier">const_iterator</span> <a name="idp58157104-bb"></a><span class="identifier">find</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">domain_type</span> <span class="special">&</span> key_value<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
<p>Find the interval value pair, that contains <code class="computeroutput">key</code> </p>
</li>
<li class="listitem">
<pre class="literallayout"><span class="identifier">const_iterator</span> <a name="idp58159808-bb"></a><span class="identifier">find</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">interval_type</span> <span class="special">&</span> key_interval<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
<p>Find the first interval value pair, that collides with interval <code class="computeroutput">key_interval</code> </p>
</li>
<li class="listitem">
<pre class="literallayout"><span class="identifier">codomain_type</span> <a name="idp58162528-bb"></a><span class="keyword">operator</span><span class="special">(</span><span class="special">)</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">domain_type</span> <span class="special">&</span> key_value<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
<p>Total select function. </p>
</li>
<li class="listitem">
<pre class="literallayout"><span class="identifier">SubType</span> <span class="special">&</span> <a name="idp58164752-bb"></a><span class="identifier">add</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">element_type</span> <span class="special">&</span> key_value_pair<span class="special">)</span><span class="special">;</span></pre>
<p>Addition of a key value pair to the map </p>
</li>
<li class="listitem">
<pre class="literallayout"><span class="identifier">SubType</span> <span class="special">&</span> <a name="idp58166736-bb"></a><span class="identifier">add</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span> interval_value_pair<span class="special">)</span><span class="special">;</span></pre>
<p>Addition of an interval value pair to the map. </p>
</li>
<li class="listitem">
<pre class="literallayout"><span class="identifier">iterator</span> <a name="idp58168720-bb"></a><span class="identifier">add</span><span class="special">(</span><span class="identifier">iterator</span> prior_<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span> interval_value_pair<span class="special">)</span><span class="special">;</span></pre>
<p>Addition of an interval value pair <code class="computeroutput">interval_value_pair</code> to the map. Iterator <code class="computeroutput">prior_</code> is a hint to the position <code class="computeroutput">interval_value_pair</code> can be inserted after. </p>
</li>
<li class="listitem">
<pre class="literallayout"><span class="identifier">SubType</span> <span class="special">&</span> <a name="idp58172752-bb"></a><span class="identifier">subtract</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">element_type</span> <span class="special">&</span> key_value_pair<span class="special">)</span><span class="special">;</span></pre>
<p>Subtraction of a key value pair from the map </p>
</li>
<li class="listitem">
<pre class="literallayout"><span class="identifier">SubType</span> <span class="special">&</span> <a name="idp58174736-bb"></a><span class="identifier">subtract</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span> interval_value_pair<span class="special">)</span><span class="special">;</span></pre>
<p>Subtraction of an interval value pair from the map. </p>
</li>
<li class="listitem">
<pre class="literallayout"><span class="identifier">SubType</span> <span class="special">&</span> <a name="idp58176720-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">element_type</span> <span class="special">&</span> key_value_pair<span class="special">)</span><span class="special">;</span></pre>
<p>Insertion of a <code class="computeroutput">key_value_pair</code> into the map. </p>
</li>
<li class="listitem">
<pre class="literallayout"><span class="identifier">SubType</span> <span class="special">&</span> <a name="idp58179120-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span> interval_value_pair<span class="special">)</span><span class="special">;</span></pre>
<p>Insertion of an <code class="computeroutput">interval_value_pair</code> into the map. </p>
</li>
<li class="listitem">
<pre class="literallayout"><span class="identifier">iterator</span> <a name="idp58181520-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">iterator</span> prior<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span> interval_value_pair<span class="special">)</span><span class="special">;</span></pre>
<p>Insertion of an <code class="computeroutput">interval_value_pair</code> into the map. Iterator <code class="computeroutput">prior_</code>. serves as a hint to insert after the element <code class="computeroutput">prior</code> point to. </p>
</li>
<li class="listitem">
<pre class="literallayout"><span class="identifier">SubType</span> <span class="special">&</span> <a name="idp58185552-bb"></a><span class="identifier">set</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">element_type</span> <span class="special">&</span> key_value_pair<span class="special">)</span><span class="special">;</span></pre>
<p>With <code class="computeroutput">key_value_pair = (k,v)</code> set value <code class="computeroutput">v</code> for key <code class="computeroutput">k</code> </p>
</li>
<li class="listitem">
<pre class="literallayout"><span class="identifier">SubType</span> <span class="special">&</span> <a name="idp58188848-bb"></a><span class="identifier">set</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span> interval_value_pair<span class="special">)</span><span class="special">;</span></pre>
<p>With <code class="computeroutput">interval_value_pair = (I,v)</code> set value <code class="computeroutput">v</code> for all keys in interval <code class="computeroutput">I</code> in the map. </p>
</li>
<li class="listitem">
<pre class="literallayout"><span class="identifier">SubType</span> <span class="special">&</span> <a name="idp58192176-bb"></a><span class="identifier">erase</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">element_type</span> <span class="special">&</span> key_value_pair<span class="special">)</span><span class="special">;</span></pre>
<p>Erase a <code class="computeroutput">key_value_pair</code> from the map. </p>
</li>
<li class="listitem">
<pre class="literallayout"><span class="identifier">SubType</span> <span class="special">&</span> <a name="idp58194576-bb"></a><span class="identifier">erase</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span> interval_value_pair<span class="special">)</span><span class="special">;</span></pre>
<p>Erase an <code class="computeroutput">interval_value_pair</code> from the map. </p>
</li>
<li class="listitem">
<pre class="literallayout"><span class="identifier">SubType</span> <span class="special">&</span> <a name="idp58196976-bb"></a><span class="identifier">erase</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">domain_type</span> <span class="special">&</span> key<span class="special">)</span><span class="special">;</span></pre>
<p>Erase a key value pair for <code class="computeroutput">key</code>. </p>
</li>
<li class="listitem">
<pre class="literallayout"><span class="identifier">SubType</span> <span class="special">&</span> <a name="idp58199392-bb"></a><span class="identifier">erase</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">interval_type</span> <span class="special">&</span> inter_val<span class="special">)</span><span class="special">;</span></pre>
<p>Erase all value pairs within the range of the interval <code class="computeroutput">inter_val</code> from the map. </p>
</li>
<li class="listitem">
<pre class="literallayout"><span class="keyword">void</span> <a name="idp58201824-bb"></a><span class="identifier">erase</span><span class="special">(</span><span class="identifier">iterator</span> position<span class="special">)</span><span class="special">;</span></pre>
<p>Erase all value pairs within the range of the interval that iterator <code class="computeroutput">position</code> points to. </p>
</li>
<li class="listitem">
<pre class="literallayout"><span class="keyword">void</span> <a name="idp58204272-bb"></a><span class="identifier">erase</span><span class="special">(</span><span class="identifier">iterator</span> first<span class="special">,</span> <span class="identifier">iterator</span> past<span class="special">)</span><span class="special">;</span></pre>
<p>Erase all value pairs for a range of iterators <code class="computeroutput">[first,past)</code>. </p>
</li>
<li class="listitem">
<pre class="literallayout"><span class="keyword">void</span> <a name="idp58207392-bb"></a><span class="identifier">add_intersection</span><span class="special">(</span><span class="identifier">SubType</span> <span class="special">&</span> section<span class="special">,</span>
<span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span> interval_value_pair<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
<p>The intersection of <code class="computeroutput">interval_value_pair</code> and <code class="computeroutput">*this</code> map is added to <code class="computeroutput">section</code>. </p>
</li>
<li class="listitem">
<pre class="literallayout"><span class="identifier">SubType</span> <span class="special">&</span> <a name="idp58211648-bb"></a><span class="identifier">flip</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">element_type</span> <span class="special">&</span> key_value_pair<span class="special">)</span><span class="special">;</span></pre>
<p>If <code class="computeroutput">*this</code> map contains <code class="computeroutput">key_value_pair</code> it is erased, otherwise it is added. </p>
</li>
<li class="listitem">
<pre class="literallayout"><span class="identifier">SubType</span> <span class="special">&</span> <a name="idp58214512-bb"></a><span class="identifier">flip</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span> interval_value_pair<span class="special">)</span><span class="special">;</span></pre>
<p>If <code class="computeroutput">*this</code> map contains <code class="computeroutput">interval_value_pair</code> it is erased, otherwise it is added. </p>
</li>
<li class="listitem"><pre class="literallayout"><span class="identifier">iterator</span> <a name="idp58217376-bb"></a><span class="identifier">lower_bound</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&</span> interval<span class="special">)</span><span class="special">;</span></pre></li>
<li class="listitem"><pre class="literallayout"><span class="identifier">iterator</span> <a name="idp58218912-bb"></a><span class="identifier">upper_bound</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&</span> interval<span class="special">)</span><span class="special">;</span></pre></li>
<li class="listitem"><pre class="literallayout"><span class="identifier">const_iterator</span> <a name="idp58220448-bb"></a><span class="identifier">lower_bound</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&</span> interval<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre></li>
<li class="listitem"><pre class="literallayout"><span class="identifier">const_iterator</span> <a name="idp58222256-bb"></a><span class="identifier">upper_bound</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&</span> interval<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre></li>
<li class="listitem"><pre class="literallayout"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="special">></span> <a name="idp58224064-bb"></a><span class="identifier">equal_range</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&</span> interval<span class="special">)</span><span class="special">;</span></pre></li>
<li class="listitem"><pre class="literallayout"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">const_iterator</span> <span class="special">></span>
<a name="idp58225616-bb"></a><span class="identifier">equal_range</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&</span> interval<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre></li>
<li class="listitem"><pre class="literallayout"><span class="identifier">iterator</span> <a name="idp58227456-bb"></a><span class="identifier">begin</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre></li>
<li class="listitem"><pre class="literallayout"><span class="identifier">iterator</span> <a name="idp58228304-bb"></a><span class="identifier">end</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre></li>
<li class="listitem"><pre class="literallayout"><span class="identifier">const_iterator</span> <a name="idp58229152-bb"></a><span class="identifier">begin</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre></li>
<li class="listitem"><pre class="literallayout"><span class="identifier">const_iterator</span> <a name="idp58230272-bb"></a><span class="identifier">end</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre></li>
<li class="listitem"><pre class="literallayout"><span class="identifier">reverse_iterator</span> <a name="idp58231392-bb"></a><span class="identifier">rbegin</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre></li>
<li class="listitem"><pre class="literallayout"><span class="identifier">reverse_iterator</span> <a name="idp58232240-bb"></a><span class="identifier">rend</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre></li>
<li class="listitem"><pre class="literallayout"><span class="identifier">const_reverse_iterator</span> <a name="idp58233088-bb"></a><span class="identifier">rbegin</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre></li>
<li class="listitem"><pre class="literallayout"><span class="identifier">const_reverse_iterator</span> <a name="idp58234208-bb"></a><span class="identifier">rend</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre></li>
<li class="listitem"><pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Combiner<span class="special">></span>
<a class="link" href="interval_base_map.html" title="Class template interval_base_map">interval_base_map</a><span class="special"><</span> <span class="identifier">SubType</span><span class="special">,</span> <span class="identifier">DomainT</span><span class="special">,</span> <span class="identifier">CodomainT</span><span class="special">,</span> <span class="identifier">Traits</span><span class="special">,</span> <span class="identifier">Compare</span><span class="special">,</span> <span class="identifier">Combine</span><span class="special">,</span> <span class="identifier">Section</span><span class="special">,</span> <span class="identifier">Interval</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">></span><span class="special">::</span><span class="identifier">iterator</span>
<a name="idp58235328-bb"></a><span class="identifier">_add</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span> addend<span class="special">)</span><span class="special">;</span></pre></li>
<li class="listitem"><pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Combiner<span class="special">></span>
<a class="link" href="interval_base_map.html" title="Class template interval_base_map">interval_base_map</a><span class="special"><</span> <span class="identifier">SubType</span><span class="special">,</span> <span class="identifier">DomainT</span><span class="special">,</span> <span class="identifier">CodomainT</span><span class="special">,</span> <span class="identifier">Traits</span><span class="special">,</span> <span class="identifier">Compare</span><span class="special">,</span> <span class="identifier">Combine</span><span class="special">,</span> <span class="identifier">Section</span><span class="special">,</span> <span class="identifier">Interval</span><span class="special">,</span> <span class="identifier">Alloc</span> <span class="special">></span><span class="special">::</span><span class="identifier">iterator</span>
<a name="idp58238080-bb"></a><span class="identifier">_add</span><span class="special">(</span><span class="identifier">iterator</span> prior_<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span> addend<span class="special">)</span><span class="special">;</span></pre></li>
</ol></div>
</div>
<div class="refsect2">
<a name="idp114429424"></a><h3>
<a name="idp58248048-bb"></a><code class="computeroutput">interval_base_map</code> private member functions</h3>
<div class="orderedlist"><ol class="orderedlist" type="1">
<li class="listitem"><pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Combiner<span class="special">></span>
<span class="identifier">iterator</span> <a name="idp58248624-bb"></a><span class="identifier">_add</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span> interval_value_pair<span class="special">)</span><span class="special">;</span></pre></li>
<li class="listitem"><pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Combiner<span class="special">></span>
<span class="identifier">iterator</span> <a name="idp58251008-bb"></a><span class="identifier">_add</span><span class="special">(</span><span class="identifier">iterator</span> prior_<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span> interval_value_pair<span class="special">)</span><span class="special">;</span></pre></li>
<li class="listitem"><pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Combiner<span class="special">></span>
<span class="keyword">void</span> <a name="idp58254080-bb"></a><span class="identifier">_subtract</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span> interval_value_pair<span class="special">)</span><span class="special">;</span></pre></li>
<li class="listitem"><pre class="literallayout"><span class="identifier">iterator</span> <a name="idp58256464-bb"></a><span class="identifier">_insert</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span> interval_value_pair<span class="special">)</span><span class="special">;</span></pre></li>
<li class="listitem"><pre class="literallayout"><span class="identifier">iterator</span> <a name="idp58258000-bb"></a><span class="identifier">_insert</span><span class="special">(</span><span class="identifier">iterator</span> prior_<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span> interval_value_pair<span class="special">)</span><span class="special">;</span></pre></li>
<li class="listitem"><pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Combiner<span class="special">></span>
<span class="keyword">void</span> <a name="idp58260224-bb"></a><span class="identifier">add_segment</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">interval_type</span> <span class="special">&</span> inter_val<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">CodomainT</span> <span class="special">&</span> co_val<span class="special">,</span>
<span class="identifier">iterator</span> <span class="special">&</span> it_<span class="special">)</span><span class="special">;</span></pre></li>
<li class="listitem"><pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Combiner<span class="special">></span>
<span class="keyword">void</span> <a name="idp58263984-bb"></a><span class="identifier">add_main</span><span class="special">(</span><span class="identifier">interval_type</span> <span class="special">&</span> inter_val<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">CodomainT</span> <span class="special">&</span> co_val<span class="special">,</span>
<span class="identifier">iterator</span> <span class="special">&</span> it_<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">iterator</span> <span class="special">&</span> last_<span class="special">)</span><span class="special">;</span></pre></li>
<li class="listitem"><pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Combiner<span class="special">></span>
<span class="keyword">void</span> <a name="idp58268432-bb"></a><span class="identifier">add_rear</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">interval_type</span> <span class="special">&</span> inter_val<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">CodomainT</span> <span class="special">&</span> co_val<span class="special">,</span>
<span class="identifier">iterator</span> <span class="special">&</span> it_<span class="special">)</span><span class="special">;</span></pre></li>
<li class="listitem"><pre class="literallayout"><span class="keyword">void</span> <a name="idp58272192-bb"></a><span class="identifier">add_front</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">interval_type</span> <span class="special">&</span> inter_val<span class="special">,</span> <span class="identifier">iterator</span> <span class="special">&</span> first_<span class="special">)</span><span class="special">;</span></pre></li>
<li class="listitem"><pre class="literallayout"><span class="keyword">void</span> <a name="idp58274416-bb"></a><span class="identifier">subtract_front</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">interval_type</span> <span class="special">&</span> inter_val<span class="special">,</span> <span class="identifier">iterator</span> <span class="special">&</span> first_<span class="special">)</span><span class="special">;</span></pre></li>
<li class="listitem"><pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Combiner<span class="special">></span>
<span class="keyword">void</span> <a name="idp58276640-bb"></a><span class="identifier">subtract_main</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">CodomainT</span> <span class="special">&</span> co_val<span class="special">,</span> <span class="identifier">iterator</span> <span class="special">&</span> it_<span class="special">,</span>
<span class="keyword">const</span> <span class="identifier">iterator</span> <span class="special">&</span> last_<span class="special">)</span><span class="special">;</span></pre></li>
<li class="listitem"><pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Combiner<span class="special">></span>
<span class="keyword">void</span> <a name="idp58280400-bb"></a><span class="identifier">subtract_rear</span><span class="special">(</span><span class="identifier">interval_type</span> <span class="special">&</span> inter_val<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">CodomainT</span> <span class="special">&</span> co_val<span class="special">,</span>
<span class="identifier">iterator</span> <span class="special">&</span> it_<span class="special">)</span><span class="special">;</span></pre></li>
<li class="listitem"><pre class="literallayout"><span class="keyword">void</span> <a name="idp58284160-bb"></a><span class="identifier">insert_main</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">interval_type</span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">CodomainT</span> <span class="special">&</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="special">&</span><span class="special">,</span>
<span class="keyword">const</span> <span class="identifier">iterator</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span></pre></li>
<li class="listitem"><pre class="literallayout"><span class="keyword">void</span> <a name="idp58287760-bb"></a><span class="identifier">erase_rest</span><span class="special">(</span><span class="identifier">interval_type</span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">CodomainT</span> <span class="special">&</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="special">&</span><span class="special">,</span>
<span class="keyword">const</span> <span class="identifier">iterator</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span></pre></li>
<li class="listitem"><pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> FragmentT<span class="special">></span>
<span class="keyword">void</span> <a name="idp58291360-bb"></a><span class="identifier">total_add_intersection</span><span class="special">(</span><span class="identifier">SubType</span> <span class="special">&</span> section<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">FragmentT</span> <span class="special">&</span> fragment<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre></li>
<li class="listitem"><pre class="literallayout"><span class="keyword">void</span> <a name="idp58294704-bb"></a><span class="identifier">partial_add_intersection</span><span class="special">(</span><span class="identifier">SubType</span> <span class="special">&</span> section<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">segment_type</span> <span class="special">&</span> operand<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre></li>
<li class="listitem"><pre class="literallayout"><span class="keyword">void</span> <a name="idp58297216-bb"></a><span class="identifier">partial_add_intersection</span><span class="special">(</span><span class="identifier">SubType</span> <span class="special">&</span> section<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">element_type</span> <span class="special">&</span> operand<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre></li>
</ol></div>
</div>
<div class="refsect2">
<a name="idp114617296"></a><h3>
<a name="idp58299888-bb"></a><code class="computeroutput">interval_base_map</code> protected member functions</h3>
<div class="orderedlist"><ol class="orderedlist" type="1">
<li class="listitem"><pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Combiner<span class="special">></span>
<span class="identifier">iterator</span> <a name="idp58300464-bb"></a><span class="identifier">gap_insert</span><span class="special">(</span><span class="identifier">iterator</span> prior_<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">interval_type</span> <span class="special">&</span> inter_val<span class="special">,</span>
<span class="keyword">const</span> <span class="identifier">codomain_type</span> <span class="special">&</span> co_val<span class="special">)</span><span class="special">;</span></pre></li>
<li class="listitem"><pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Combiner<span class="special">></span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="identifier">iterator</span><span class="special">,</span> <span class="keyword">bool</span> <span class="special">></span>
<a name="idp58304224-bb"></a><span class="identifier">add_at</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">iterator</span> <span class="special">&</span> prior_<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">interval_type</span> <span class="special">&</span> inter_val<span class="special">,</span>
<span class="keyword">const</span> <span class="identifier">codomain_type</span> <span class="special">&</span> co_val<span class="special">)</span><span class="special">;</span></pre></li>
<li class="listitem"><pre class="literallayout"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="identifier">iterator</span><span class="special">,</span> <span class="keyword">bool</span> <span class="special">></span>
<a name="idp58308000-bb"></a><span class="identifier">insert_at</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">iterator</span> <span class="special">&</span> prior_<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">interval_type</span> <span class="special">&</span> inter_val<span class="special">,</span>
<span class="keyword">const</span> <span class="identifier">codomain_type</span> <span class="special">&</span> co_val<span class="special">)</span><span class="special">;</span></pre></li>
<li class="listitem"><pre class="literallayout"><span class="identifier">sub_type</span> <span class="special">*</span> <a name="idp58310928-bb"></a><span class="identifier">that</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre></li>
<li class="listitem"><pre class="literallayout"><span class="keyword">const</span> <span class="identifier">sub_type</span> <span class="special">*</span> <a name="idp58311776-bb"></a><span class="identifier">that</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre></li>
</ol></div>
</div>
</div>
</div>
<table xmlns:rev="path_to_url~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
GmbH<p>
file LICENSE_1_0.txt or copy at <a href="path_to_url" target="_top">path_to_url
</p>
</div></td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="mapping_pair.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/icl/interval_base_map_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="interval_base_map/on_codomain_model.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
```
|
The 103rd Infantry Division "Piacenza" () was an infantry division of the Royal Italian Army during World War II. The Piacenza was named for the city of Piacenza and classified as an auto-transportable division, meaning it had some motorized transport, but not enough to move the entire division at once.
History
World War I
The division's lineage begins with the Brigade "Piacenza" raised on 15 March 1915 with the 111th and 112th infantry regiments. The brigade fought on the Italian front in World War I and was disbanded after the war in October 1920.
World War II
The 103rd Infantry Division "Piacenza" was activated in Bolzano on 15 March 1942 and consisted of the 111th and 112th infantry regiments, and the 80th Artillery Regiment. As a division raised during the war the Piacenza did not have its own regimental depots and therefore its regiments were raised by the depots of the 102nd Motorized Division "Trento": the 111th Infantry Regiment "Piacenza" was raised in Trento on 1 January 1942 by the 61st Infantry Regiment "Trento" and the 112th Infantry Regiment "Piacenza" was raised in Trento on 1 January 1942 by the 62nd Infantry Regiment "Trento", while the 108th Motorized Artillery Regiment was raised in Trento by the 46th Motorized Artillery Regiment "Trento".
In June 1942 the division exchanged artillery regiments with the 5th Infantry Division "Cosseria", which needed a fully motorized and modern equipped artillery regiment for its deployment to the Soviet Union: the Piacenza ceded the 108th Motorized Artillery Regiment equipped with modern 75/18 Mod. 34 howitzers to the Cosseria and received the 37th Artillery Regiment equipped with World War I vintage 75/27 Mod. 06 field guns in return.
In June 1942 the division moved to Cuneo and Borgo San Dalmazzo in Southern Piedmont and Rivarolo in Liguria. In November 1942 the entire Piacenza moved to Liguria after the XXII Army Corps and its units guarding the Ligurian coast participated in the occupation of Southern France and remained there afterwards as Italian occupation force. In Liguria the Piacenza formed the mobile reserve behind the 201st Coastal Division in the area of Vado Ligure, Savona, Varazze, and Genova.
After the fall of Sicily the division was transferred to Southern Lazio as mobile reserve in the area between the river Garigliano and the city of Ardea. The division's headquarters was at Velletri. After the Armistice of Cassibile was announced on 8 September 1943 the division began to disintegrate and by 12 September its remnants were dissolved by the invading Germans.
Organization
103rd Infantry Division "Piacenza"
111th Infantry Regiment "Piacenza"
Command Company
3× Fusilier battalions
Support Weapons Company (65/17 infantry support guns)
Mortar Company (81mm Mod. 35 mortars)
112th Infantry Regiment "Piacenza"
Command Company
3× Fusilier battalions
Support Weapons Company (65/17 infantry support guns)
Mortar Company (81mm Mod. 35 mortars)
37th Artillery Regiment "Piacenza", in Albenga (transferred from the 5th Infantry Division "Cosseria" in June 1942)
Command Unit
I Group (100/17 howitzers; re-equipped with 105/28 guns in late 1942)
II Group (75/27 field guns; re-equipped with 75/18 Mod. 35 howitzers in late 1942)
III Group (75/27 field guns; re-equipped with 75/18 Mod. 35 howitzers in late 1942)
1× Anti-aircraft battery (20/65 Mod. 35 anti-aircraft guns; a second battery was added in late 1942)
Ammunition and Supply Unit
108th Motorized Artillery Regiment (transferred to the 5th Infantry Division "Cosseria" in June 1942)
Command Unit
I Group (105/28 guns)
II Group (75/18 Mod. 35 howitzers)
III Group (75/18 Mod. 35 howitzers)
87th Anti-aircraft Battery (20/65 Mod. 35 anti-aircraft guns)
305th Anti-aircraft Battery (20/65 Mod. 35 anti-aircraft guns)
Ammunition and Supply Unit
CIII Mortar Battalion (81mm Mod. 35 mortars; joined the division in October 1942)
303rd Anti-tank Company (47/32 anti-tank guns)
78th Engineer Company
103rd Telegraph and Radio Operators Company
103rd Medical Section
2× Field hospitals
1× Surgical unit
103rd Supply Section
Bakers Section
148th Carabinieri Section
149th Carabinieri Section
94th Field Post Office
Commanding officers
The division's commanding officers were:
Generale di Divisione Carlo Rossi (15 March 1942 - 12 September 1943)
References
Infantry divisions of Italy in World War II
Military units and formations established in 1942
Military units and formations disestablished in 1943
1942 establishments in Italy
|
The men's 50 kilometres race walk at the 1969 European Athletics Championships was held in Athens, Greece, on 18 September 1969.
Medalists
Results
Final
18 September
Participation
According to an unofficial count, 25 athletes from 14 countries participated in the event.
(1)
(1)
(3)
(1)
(2)
(2)
(2)
(1)
(2)
(1)
(3)
(2)
(1)
(3)
References
50 kilometres race walk
Racewalking at the European Athletics Championships
|
The Collegium Canisianum or simply Canisianum in Innsbruck, Austria, is an international School of Theology for priests' of the Roman Catholic church run by the Jesuits.
History
The Canisianum is one of many Jesuit seminaries worldwide named after Saint Peter Canisius and was built in 1910–1911 under Rector, or Regens, Michael Hofmann, to replace the previous Nicolaihaus seminary, which had been outgrown.
During World War I it also accommodated from 1915 to 1919 the students of the Collegium Germanicum in Rome.
On 21 November 1938 it was shut down by the National Socialists. The theology Faculty relocated to Sitten, Switzerland until they were able to return to Innsbruck in October 1945. In 2007 the Canisianum changed from a seminary to an International School of Theology, for ordained priests pursuing advanced studies at the University of Innsbruck.
Renovations were completed on the 100 year old building in 2022.
Notable alumni
Blessed Vilmos Apor (1892–1945), bishop of the diocese of Győr, beatified in 1997
Blessed Nykyta Budka (1877–1959), auxiliary bishop of Lviv (Lwów), beatified in 2001
Petar Čule (1898–1985), bishop of Mostar-Duvno and apostolic administrator of Trebinje-Mrkan
Josef Frings (1887–1978), Archbishop of Cologne, cardinal
Blessed Clemens August Graf von Galen (1878–1946), bishop of Münster, cardinal, beatified 2005
Wilhelm Imkamp (b. 1951), German Catholic prelate
Blessed Andrew Ishchak (1887–1941), professor at the theological academy in Lwów, beatified in 2001
Myroslav Ivan Lubachivsky (1914–2000), Cardinal, archbishop of Lviv of the Ukrainian Catholic Church
Konrad Graf von Preysing (1880–1950), bishop of Berlin, cardinal
Paulus Rusch (1903–1986), bishop of Innsbruck
Adam Stefan Sapieha (1867–1951), cardinal archbishop of Kraków, cardinal
Joseph Slipyj (1892–1984), Metropolitan of the Ukrainian Catholic church, cardinal
Reinhold Stecher (b. 1921), bishop of Innsbruck
Blessed Clement Sheptytsky (1869–1951), Exarch of Russia and Siberia, Archimandrite of the Studite monks, beatified 2001
Bruno Wechner (1908–1999), first bishop of Feldkirch
Henry Joseph Grimmelsmann (1890–1972), first bishop of Evansville, Indiana and a principal author of The Holy Bible, New Testament, Challoner-Rheims Version, Confraternity of Christian Doctrine Revision
See also
List of Jesuit sites
References
External links
Canisianum Website
Catholic seminaries
Buildings and structures in Tyrol (state)
Educational institutions established in 1910
Seminaries and theological colleges in Austria
Education in Tyrol (state)
1910 establishments in Austria-Hungary
|
The 1891–92 Irish League was the 2nd edition of the Irish League, the highest level of league competition in Irish football.
The league comprised 10 teams, and Linfield won the championship.
League standings
Results
References
Northern Ireland - List of final tables (RSSSF)
External links
Irish Premier League Website
Irish Football Club Project
1891-92
1891–92 domestic association football leagues
1891–92 in Irish association football
|
```css
Change the color of the decoration with `text-decoration-color`
Use `em` instead of `px` for sizes
Load custom fonts on a web page using `@font-face`
A great font resource: Google Font API
`letter-spacing` property
```
|
The Chiayi Performing Arts Center () is an art center in Minxiong Township, Chiayi County, Taiwan.
History
The planning for the center began in 1995 and the construction started in 1997. Due to budget constraint, the construction was suspended twice in 1998 and 1999. The construction eventually completed in 2005. The first show performed at the center happened on 22-23 April 2005 and the center was officially opened on 10 May 2005.
Architecture
The center is built in a 6.1 hectares of land, which consists of auditorium, theater hall, rehearsal classroom, open air theater, art gallery, tourist service area, restaurant, shop, stage, pavilion etc.
Transportation
The arts center is accessible within walking distance south of Minxiong Station of Taiwan Railways.
See also
List of tourist attractions in Taiwan
References
External links
2005 establishments in Taiwan
Buildings and structures in Chiayi County
Performing arts centers in Taiwan
|
```xml
import { REPV1UUID } from '@config';
import { MIGRATION_CONFIGS } from '@features/TokenMigration/config';
import {
createApproveTx,
createRepMigrationTx
} from '@features/TokenMigration/RepTokenMigration/helpers';
import { fApproveERC20TxResponse, fREPTokenMigrationTxResponse } from '@fixtures';
import { ITokenMigrationFormFull, ITxStatus, ITxType, TxParcel } from '@types';
import { generateUUID, inputGasLimitToHex, inputNonceToHex } from '@utils';
import { fAccount } from './account';
import { fAssets } from './assets';
import { fNetwork } from './network';
export const fTokenMigrationTxs = (): TxParcel[] => {
const tokenMigrationPayload: ITokenMigrationFormFull = {
tokenConfig: MIGRATION_CONFIGS.REP,
asset: fAssets.find(({ uuid }) => uuid === REPV1UUID)!,
network: fNetwork,
address: fAccount.address,
amount: '4',
gasLimit: 500000,
gasPrice: '20',
nonce: '1',
account: fAccount,
maxFeePerGas: '20',
maxPriorityFeePerGas: '1'
};
const approveTx = createApproveTx(tokenMigrationPayload);
const approveTxParcel: TxParcel = {
_uuid: generateUUID(),
txRaw: {
...approveTx,
gasLimit: inputGasLimitToHex('150000'),
nonce: inputNonceToHex(tokenMigrationPayload.nonce)
},
txType: ITxType.APPROVAL,
txResponse: fApproveERC20TxResponse,
status: ITxStatus.CONFIRMING
};
const migrationTx = createRepMigrationTx(tokenMigrationPayload);
const migrationTxParcel: TxParcel = {
_uuid: generateUUID(),
txRaw: {
...migrationTx,
gasLimit: inputGasLimitToHex(tokenMigrationPayload.gasLimit.toString()),
nonce: inputNonceToHex((parseInt(tokenMigrationPayload.nonce) + 1).toString())
},
txType: ITxType.REP_TOKEN_MIGRATION,
txResponse: fREPTokenMigrationTxResponse,
status: ITxStatus.CONFIRMING
};
return [approveTxParcel, migrationTxParcel];
};
```
|
Pascal-Pierre Paillé (born May 30, 1978) is a Canadian politician, who was elected to represent the electoral district of Louis-Hébert in the 2008 Canadian federal election. He is a member of the Bloc Québécois.
Born in Sherbrooke, Quebec, Paillé is the nephew of Daniel Paillé, Leader of the Bloc Québécois and former Parti Québécois MNA in the National Assembly of Quebec who was elected as the MP for Hochelaga in a 2009 by-election. He is married to Hélène Guillemette, who ran as a PQ candidate in the 2008 provincial election.
References
External links
Pascal-Pierre Paillé
1978 births
Living people
Bloc Québécois MPs
French Quebecers
Members of the House of Commons of Canada from Quebec
Politicians from Quebec City
Politicians from Sherbrooke
Université Laval alumni
|
```go
package systemartifact
import (
"context"
"errors"
"testing"
testifymock "github.com/stretchr/testify/mock"
"github.com/stretchr/testify/suite"
"github.com/goharbor/harbor/src/pkg/task"
"github.com/goharbor/harbor/src/testing/controller/systemartifact"
"github.com/goharbor/harbor/src/testing/mock"
)
type CallbackTestSuite struct {
suite.Suite
cleanupController *systemartifact.Controller
}
func (suite *CallbackTestSuite) SetupSuite() {
suite.cleanupController = &systemartifact.Controller{}
cleanupController = suite.cleanupController
}
func (suite *CallbackTestSuite) TestCleanupCallbackSuccess() {
{
ctx := context.TODO()
suite.cleanupController.On("Start", mock.Anything, mock.Anything, mock.Anything).Return(nil)
triggerScheduleMatcher := testifymock.MatchedBy(func(trigger string) bool {
return trigger == task.ExecutionTriggerSchedule
})
err := cleanupCallBack(ctx, "")
suite.NoErrorf(err, "Unexpected error : %v", err)
suite.cleanupController.AssertCalled(suite.T(), "Start", mock.Anything, true, triggerScheduleMatcher)
}
{
suite.cleanupController = nil
suite.cleanupController = &systemartifact.Controller{}
cleanupController = suite.cleanupController
}
{
ctx := context.TODO()
suite.cleanupController.On("Start", mock.Anything, mock.Anything, mock.Anything).Return(errors.New("test error"))
triggerScheduleMatcher := testifymock.MatchedBy(func(trigger string) bool {
return trigger == task.ExecutionTriggerSchedule
})
err := cleanupCallBack(ctx, "")
suite.Error(err)
suite.cleanupController.AssertCalled(suite.T(), "Start", mock.Anything, true, triggerScheduleMatcher)
}
}
func TestCallbackTestSuite(t *testing.T) {
suite.Run(t, &CallbackTestSuite{})
}
```
|
Yengi Molk (, also Romanized as Yengī Molk, Yengīmelk, and Yangī Molk; also known as Ingemulk and Yengeh Molk) is a village in Khosrow Beyk Rural District, Milajerd District, Komijan County, Markazi Province, Iran. At the 2006 census, its population was 545, in 118 families.
References
Populated places in Komijan County
|
```yaml
description: Test device for pin controller.
compatible: "vnd,pinctrl-device"
include: [base.yaml, pinctrl-device.yaml]
```
|
Sabata is a series of Spaghetti Western films released between 1969 and 1971, directed by Gianfranco Parolini, and starring Lee Van Cleef in the first, Sabata, Yul Brynner in the second, Adiós, Sabata, and Van Cleef returning for the third, Return of Sabata.
Overview
Sabata (1969)
Lee Van Cleef stars as a mostly silent, loner gunman who foils a plan by some leaders of a small Texas town to rob their own bank and sell the town to the railroad. William Berger co-stars as Banjo, an opposing gunman.
Adiós, Sabata (1970)
With Yul Brynner cast in the lead role, this film was originally going to be entitled Indio Black, but the title was changed after the first Sabata film proved successful and had inspired many imitators. Lee Van Cleef, star of the first Sabata film, had been offered the role, but had to decline because he was committed to The Magnificent Seven Ride! in the role of Chris Adams, which Brynner had made famous in The Magnificent Seven. Adiós, Sabata is set in Mexico under the rule of Emperor Maximilian I, and Sabata is hired to steal a wagonload of gold from the Austrian army.
Return of Sabata (1971)
Lee Van Cleef returns to the role of Sabata, who goes to a small Texas town and seeks revenge on a robber baron, determined to steal back some money that the man has stolen from the towns people.
Cast and characters
Crew
DVD release
The Sabata Trilogy was released on DVD by MGM/UA in October 2005.
Other Sabata films
As was common with successful Spaghetti Western franchises, such as the Dollars Trilogy, Django or Sartana series, several other Sabata imitators were released. None of these are considered part of the "official" series. They include:
Wanted Sabata (1970) directed by Roberto Mauri and starring Brad Harris.
Arriva Sabata! (1970) directed by Tulio Demicheli and starring Peter Lee Lawrence.
Dig Your Grave Friend... Sabata's Coming (1971) directed by Juan Bosch and starring Raf Baldassarre.
Watch Out Gringo! Sabata Will Return (1972) directed by Alfonso Balcázar and Pedro Luis Ramírez, and starring George Martin.
References
External links
Spaghetti Western films
Italian film series
1960s Italian-language films
1970s Italian-language films
United Artists films
Films directed by Gianfranco Parolini
Sabata
|
The Best American Short Stories 1998, a volume in The Best American Short Stories series, was edited by Katrina Kenison and by guest editor Garrison Keillor.
Short stories included
Other notable stories
Among the other notable writers whose stories were among the "100 Other Distinguished Stories of 1997" were Ann Beattie, T. C. Boyle, Michael Chabon, Louise Erdrich, Jeffrey Eugenides, Tess Gallagher, Joyce Carol Oates, Annie Proulx, and Tobias Wolff.
Notes
1998 anthologies
Fiction anthologies
Short Stories 1998
Houghton Mifflin books
|
The 1936–37 British Home Championship was a football tournament played between the British Home Nations during the 1936–37 seasons. The trophy was won by Wales with Scotland coming second. This was the last Home Championship that Wales would win exclusively, all subsequent victories would be shared with one of the other Home Nations. Wales began the competition by beating England and followed it with a similar 2–1 victory against Scotland. With the two favourites beaten Wales only required a draw with Ireland to complete a rare tournament success. They ultimately took the title in style, winning 4–1 at home. Scotland recovered from their loss to Wales in their final game with a commanding 3–1 victory over England in Glasgow to come second, whilst England's only points came from their own 3–1 defeat of the disappointing Irish.
Table
Results
References
1936–37 in English football
1936–37 in Scottish football
Brit
1937 in British sport
1936-37
1936–37 in Northern Ireland association football
|
Cerdaia is a genus of beetles in the family Cerambycidae, containing the following species:
Cerdaia lunata (Germain, 1898)
Cerdaia testacea (Cerda, 1980)
References
Achrysonini
|
Kobło-Kolonia is a village in the administrative district of Gmina Horodło, within Hrubieszów County, Lublin Voivodeship, in eastern Poland, close to the border with Ukraine.
References
Villages in Hrubieszów County
|
Eucyclodes is a genus of moths in the family Geometridae. According to the Catalogue of Life as of March 2017, only E. buprestaria is included in the genus. Other species are categorized into Chloromachia.
Species
Chloromachia albiceps Felder, 1875
Eucyclodes absona (Warren, 1896) = Anisozyga absona
Eucyclodes albisparsa (Walker, 1861) = Chloromachia albisparsa
Eucyclodes aphrias (Meyrick, 1889) = Anisozyga aphrias
Chloromachia augustaria Oberthür, 1916
Chloromachia aureofulva Warren, 1897
Osteosema discata (Prout) - ssp. benguetensis
Eucyclodes buprestaria (Guenée, 1857)
Eucyclodes caledonica (Thierry-Mieg, 1915)
Eucyclodes callisticta (Turner, 1904)
Eucyclodes charma (Prout, 1917)
Chloromachia concinnata Pagenstecher, 1888
Eucyclodes difficta (Walker, 1861)
Eucyclodes discipennata (Walker, 1861)
Eucyclodes divapala (Walker, 1861)
Eucyclodes erotyla Turner, 1910
Eucyclodes erymnodes Turner, 1910
Eucyclodes fascinans (Lucas, 1894)
Eucyclodes gavissima (Walker, 1861) = Anisozyga gavissima
Eucyclodes goniota (Lower, 1894)
Chloromachia infracta Wileman, 191?
Eucyclodes insperata (Walker, 1861)
Eucyclodes lepta (West)
Eucyclodes leptocosma (Prout, 1933)
Eucyclodes lithocrossa (Meyrick, 1889)
Eucyclodes metaspila (Walker, 1861)
Eucyclodes nivestrota (Warren, 1907)
Eucyclodes picturata (Hampson 1903)
Eucyclodes pieroides (Walker, 1861)
Eucyclodes praeampla (Warren, 1897)
Chloromachia pulchella Warren, 1899
Eucyclodes rufimargo (Warren, 1897) = Chloromachia rufimargo
Eucyclodes sanguilineata (Moore, [1868])
Eucyclodes semialba (Walker, 1861) - ssp. Eucyclodes angiportus
Eucyclodes speciosa (Lucas, 1890)
Eucyclodes textiloides Holloway, 1996
Eucyclodes vicaria (Herbulot)
References
Eucyclodes at Markku Savela's Lepidoptera and Some Other Life Forms
Natural History Museum Lepidoptera genus database
Geometrinae
Geometridae genera
|
```python
"""
Basics
------
:mod:`textacy.extract.basics`: Extract basic components from a document or sentence
via spaCy, with bells and whistles for filtering the results.
"""
from __future__ import annotations
from functools import partial
from typing import Collection, Iterable, Optional, Union
from cytoolz import itertoolz
from spacy.parts_of_speech import DET
from spacy.tokens import Span, Token
from .. import constants, errors, types, utils
def words(
doclike: types.DocLike,
*,
filter_stops: bool = True,
filter_punct: bool = True,
filter_nums: bool = False,
include_pos: Optional[str | Collection[str]] = None,
exclude_pos: Optional[str | Collection[str]] = None,
min_freq: int = 1,
) -> Iterable[Token]:
"""
Extract an ordered sequence of words from a document processed by spaCy,
optionally filtering words by part-of-speech tag and frequency.
Args:
doclike
filter_stops: If True, remove stop words from word list.
filter_punct: If True, remove punctuation from word list.
filter_nums: If True, remove number-like words (e.g. 10, "ten")
from word list.
include_pos: Remove words whose part-of-speech tag IS NOT in the specified tags.
exclude_pos: Remove words whose part-of-speech tag IS in the specified tags.
min_freq: Remove words that occur in ``doclike`` fewer than ``min_freq`` times.
Yields:
Next token from ``doclike`` passing specified filters in order of appearance
in the document.
Raises:
TypeError: if ``include_pos`` or ``exclude_pos`` is not a str, a set of str,
or a falsy value
Note:
Filtering by part-of-speech tag uses the universal POS tag set; for details,
check spaCy's docs: path_to_url#pos-tagging
"""
words_: Iterable[Token] = (w for w in doclike if not w.is_space)
if filter_stops is True:
words_ = (w for w in words_ if not w.is_stop)
if filter_punct is True:
words_ = (w for w in words_ if not w.is_punct)
if filter_nums is True:
words_ = (w for w in words_ if not w.like_num)
if include_pos:
include_pos_: set[str] = {pos.upper() for pos in utils.to_set(include_pos)}
words_ = (w for w in words_ if w.pos_ in include_pos_)
if exclude_pos:
exclude_pos_: set[str] = {pos.upper() for pos in utils.to_set(exclude_pos)}
words_ = (w for w in words_ if w.pos_ not in exclude_pos_)
if min_freq > 1:
words_ = list(words_)
freqs = itertoolz.frequencies(w.lower_ for w in words_)
words_ = (w for w in words_ if freqs[w.lower_] >= min_freq)
for word in words_:
yield word
def ngrams(
doclike: types.DocLike,
n: int | Collection[int],
*,
filter_stops: bool = True,
filter_punct: bool = True,
filter_nums: bool = False,
include_pos: Optional[str | Collection[str]] = None,
exclude_pos: Optional[str | Collection[str]] = None,
min_freq: int = 1,
) -> Iterable[Span]:
"""
Extract an ordered sequence of n-grams (``n`` consecutive tokens) from a spaCy
``Doc`` or ``Span``, for one or multiple ``n`` values, optionally filtering n-grams
by the types and parts-of-speech of the constituent tokens.
Args:
doclike
n: Number of tokens included per n-gram; for example, ``2`` yields bigrams
and ``3`` yields trigrams. If multiple values are specified, then the
collections of n-grams are concatenated together; for example, ``(2, 3)``
yields bigrams and then trigrams.
filter_stops: If True, remove ngrams that start or end with a stop word.
filter_punct: If True, remove ngrams that contain any punctuation-only tokens.
filter_nums: If True, remove ngrams that contain any numbers
or number-like tokens (e.g. 10, 'ten').
include_pos: Remove ngrams if any constituent tokens' part-of-speech tags
ARE NOT included in this param.
exclude_pos: Remove ngrams if any constituent tokens' part-of-speech tags
ARE included in this param.
min_freq: Remove ngrams that occur in ``doclike`` fewer than ``min_freq`` times
Yields:
Next ngram from ``doclike`` passing all specified filters, in order of appearance
in the document.
Raises:
ValueError: if any ``n`` < 1
TypeError: if ``include_pos`` or ``exclude_pos`` is not a str, a set of str,
or a falsy value
Note:
Filtering by part-of-speech tag uses the universal POS tag set; for details,
check spaCy's docs: path_to_url#pos-tagging
"""
ns_: tuple[int, ...] = utils.to_tuple(n)
if any(n_ < 1 for n_ in ns_):
raise ValueError("n must be greater than or equal to 1")
ngrams_: Iterable[Span]
for n_ in ns_:
ngrams_ = (doclike[i : i + n_] for i in range(len(doclike) - n_ + 1))
ngrams_ = (ng for ng in ngrams_ if not any(w.is_space for w in ng))
if filter_stops is True:
ngrams_ = (ng for ng in ngrams_ if not ng[0].is_stop and not ng[-1].is_stop)
if filter_punct is True:
ngrams_ = (ng for ng in ngrams_ if not any(w.is_punct for w in ng))
if filter_nums is True:
ngrams_ = (ng for ng in ngrams_ if not any(w.like_num for w in ng))
if include_pos:
include_pos_: set[str] = {pos.upper() for pos in utils.to_set(include_pos)}
ngrams_ = (ng for ng in ngrams_ if all(w.pos_ in include_pos_ for w in ng))
if exclude_pos:
exclude_pos_: set[str] = {pos.upper() for pos in utils.to_set(exclude_pos)}
ngrams_ = (
ng for ng in ngrams_ if not any(w.pos_ in exclude_pos_ for w in ng)
)
if min_freq > 1:
ngrams_ = list(ngrams_)
freqs = itertoolz.frequencies(ng.text.lower() for ng in ngrams_)
ngrams_ = (ng for ng in ngrams_ if freqs[ng.text.lower()] >= min_freq)
for ngram in ngrams_:
yield ngram
def entities(
doclike: types.DocLike,
*,
include_types: Optional[str | Collection[str]] = None,
exclude_types: Optional[str | Collection[str]] = None,
drop_determiners: bool = True,
min_freq: int = 1,
) -> Iterable[Span]:
"""
Extract an ordered sequence of named entities (PERSON, ORG, LOC, etc.) from
a ``Doc``, optionally filtering by entity types and frequencies.
Args:
doclike
include_types: Remove entities whose type IS NOT
in this param; if "NUMERIC", all numeric entity types ("DATE",
"MONEY", "ORDINAL", etc.) are included
exclude_types: Remove entities whose type IS
in this param; if "NUMERIC", all numeric entity types ("DATE",
"MONEY", "ORDINAL", etc.) are excluded
drop_determiners: Remove leading determiners (e.g. "the")
from entities (e.g. "the United States" => "United States").
.. note:: Entities from which a leading determiner has been removed
are, effectively, *new* entities, and not saved to the ``Doc``
from which they came. This is irritating but unavoidable, since
this function is not meant to have side-effects on document state.
If you're only using the text of the returned spans, this is no
big deal, but watch out if you're counting on determiner-less
entities associated with the doc downstream.
min_freq: Remove entities that occur in ``doclike`` fewer
than ``min_freq`` times
Yields:
Next entity from ``doclike`` passing all specified filters in order of appearance
in the document
Raises:
TypeError: if ``include_types`` or ``exclude_types`` is not a str, a set of
str, or a falsy value
"""
ents = doclike.ents
# HACK: spacy's models have been erroneously tagging whitespace as entities
# path_to_url
ents = (ent for ent in ents if not ent.text.isspace())
include_types = _parse_ent_types(include_types, "include")
exclude_types = _parse_ent_types(exclude_types, "exclude")
if include_types:
if isinstance(include_types, str):
ents = (ent for ent in ents if ent.label_ == include_types)
elif isinstance(include_types, (set, frozenset, list, tuple)):
ents = (ent for ent in ents if ent.label_ in include_types)
if exclude_types:
if isinstance(exclude_types, str):
ents = (ent for ent in ents if ent.label_ != exclude_types)
elif isinstance(exclude_types, (set, frozenset, list, tuple)):
ents = (ent for ent in ents if ent.label_ not in exclude_types)
if drop_determiners is True:
ents = (
ent
if ent[0].pos != DET
else Span(
ent.doc, ent.start + 1, ent.end, label=ent.label, vector=ent.vector
)
for ent in ents
)
if min_freq > 1:
ents = list(ents) # type: ignore
freqs = itertoolz.frequencies(ent.text.lower() for ent in ents)
ents = (ent for ent in ents if freqs[ent.text.lower()] >= min_freq)
for ent in ents:
yield ent
def _parse_ent_types(
ent_types: Optional[str | Collection[str]], which: str
) -> Optional[str | set[str]]:
if not ent_types:
return None
elif isinstance(ent_types, str):
ent_types = ent_types.upper()
# replace the shorthand numeric case by its corresponding constant
if ent_types == "NUMERIC":
return constants.NUMERIC_ENT_TYPES
else:
return ent_types
elif isinstance(ent_types, (set, frozenset, list, tuple)):
ent_types = {ent_type.upper() for ent_type in ent_types}
# again, replace the shorthand numeric case by its corresponding constant
# and include it in the set in case other types are specified
if any(ent_type == "NUMERIC" for ent_type in ent_types):
return ent_types.union(constants.NUMERIC_ENT_TYPES)
else:
return ent_types
else:
raise TypeError(
errors.type_invalid_msg(
f"{which}_types", type(ent_types), Optional[Union[str, Collection[str]]]
)
)
def noun_chunks(
doclike: types.DocLike, *, drop_determiners: bool = True, min_freq: int = 1
) -> Iterable[Span]:
"""
Extract an ordered sequence of noun chunks from a spacy-parsed doc, optionally
filtering by frequency and dropping leading determiners.
Args:
doclike
drop_determiners: Remove leading determiners (e.g. "the")
from phrases (e.g. "the quick brown fox" => "quick brown fox")
min_freq: Remove chunks that occur in ``doclike`` fewer than ``min_freq`` times
Yields:
Next noun chunk from ``doclike`` in order of appearance in the document
"""
ncs: Iterable[Span]
ncs = doclike.noun_chunks
if drop_determiners is True:
ncs = (nc if nc[0].pos != DET else nc[1:] for nc in ncs)
if min_freq > 1:
ncs = list(ncs)
freqs = itertoolz.frequencies(nc.text.lower() for nc in ncs)
ncs = (nc for nc in ncs if freqs[nc.text.lower()] >= min_freq)
for nc in ncs:
yield nc
def terms(
doclike: types.DocLike,
*,
ngs: Optional[int | Collection[int] | types.DocLikeToSpans] = None,
ents: Optional[bool | types.DocLikeToSpans] = None,
ncs: Optional[bool | types.DocLikeToSpans] = None,
dedupe: bool = True,
) -> Iterable[Span]:
"""
Extract one or multiple types of terms -- ngrams, entities, and/or noun chunks --
from ``doclike`` as a single, concatenated collection, with optional deduplication
of spans extracted by more than one type.
.. code-block:: pycon
>>> extract.terms(doc, ngs=2, ents=True, ncs=True)
>>> extract.terms(doc, ngs=lambda doc: extract.ngrams(doc, n=2))
>>> extract.terms(doc, ents=extract.entities)
>>> extract.terms(doc, ents=partial(extract.entities, include_types="PERSON"))
Args:
doclike
ngs: N-gram terms to be extracted.
If one or multiple ints, :func:`textacy.extract.ngrams(doclike, n=ngs)` is
used to extract terms; if a callable, ``ngs(doclike)`` is used to extract
terms; if None, no n-gram terms are extracted.
ents: Entity terms to be extracted.
If True, :func:`textacy.extract.entities(doclike)` is used to extract terms;
if a callable, ``ents(doclike)`` is used to extract terms;
if None, no entity terms are extracted.
ncs: Noun chunk terms to be extracted.
If True, :func:`textacy.extract.noun_chunks(doclike)` is used to extract
terms; if a callable, ``ncs(doclike)`` is used to extract terms;
if None, no noun chunk terms are extracted.
dedupe: If True, deduplicate terms whose spans are extracted by multiple types
(e.g. a span that is both an n-gram and an entity), as identified by
identical (start, stop) indexes in ``doclike``; otherwise, don't.
Returns:
Next term from ``doclike``, in order of n-grams then entities then noun chunks,
with each collection's terms given in order of appearance.
Note:
This function is *not* to be confused with keyterm extraction, which leverages
statistics and algorithms to quantify the "key"-ness of terms before returning
the top-ranking terms. There is no such scoring or ranking here.
See Also:
- :func:`textacy.extact.ngrams()`
- :func:`textacy.extact.entities()`
- :func:`textacy.extact.noun_chunks()`
- :mod:`textacy.extact.keyterms`
"""
extractors = _get_extractors(ngs, ents, ncs)
terms_ = itertoolz.concat(extractor(doclike) for extractor in extractors)
if dedupe is True:
terms_ = itertoolz.unique(terms_, lambda span: (span.start, span.end))
for term in terms_:
yield term
def _get_extractors(ngs, ents, ncs) -> list[types.DocLikeToSpans]:
all_extractors = [
_get_ngs_extractor(ngs),
_get_ents_extractor(ents),
_get_ncs_extractor(ncs),
]
extractors = [extractor for extractor in all_extractors if extractor is not None]
if not extractors:
raise ValueError("at least one term extractor must be specified")
else:
return extractors
def _get_ngs_extractor(ngs) -> Optional[types.DocLikeToSpans]:
if ngs is None:
return None
elif callable(ngs):
return ngs
elif isinstance(ngs, int) or (
isinstance(ngs, Collection) and all(isinstance(ng, int) for ng in ngs)
):
return partial(ngrams, n=ngs)
else:
raise TypeError()
def _get_ents_extractor(ents) -> Optional[types.DocLikeToSpans]:
if ents is None:
return None
elif callable(ents):
return ents
elif isinstance(ents, bool):
return entities
else:
raise TypeError()
def _get_ncs_extractor(ncs) -> Optional[types.DocLikeToSpans]:
if ncs is None:
return None
elif callable(ncs):
return ncs
elif isinstance(ncs, bool):
return noun_chunks
else:
raise TypeError()
```
|
```javascript
/**
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
'use strict';
// MODULES //
var bench = require( '@stdlib/bench' );
var randu = require( '@stdlib/random/base/randu' );
var floor = require( '@stdlib/math/base/special/floor' );
var fromCodePoint = require( '@stdlib/string/from-code-point' );
var isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;
var UNICODE_MAX = require( '@stdlib/constants/unicode/max' );
var pkg = require( './../package.json' ).name;
var hasUTF16SurrogatePairAt = require( './../lib' );
// MAIN //
bench( pkg, function benchmark( b ) {
var bool;
var x;
var i;
b.tic();
for ( i = 0; i < b.iterations; i++ ) {
x = floor( randu() * UNICODE_MAX );
bool = hasUTF16SurrogatePairAt( fromCodePoint( x ), 0 );
if ( typeof bool !== 'boolean' ) {
b.fail( 'should return a boolean' );
}
}
b.toc();
b.pass( 'benchmark finished' );
if ( !isBoolean( bool ) ) {
b.fail( 'should return a boolean' );
}
b.end();
});
```
|
```kotlin
import platform.darwin.*
import platform.Foundation.*
class Zzz : NSCopyingProtocolMeta
```
|
```swift
//
// SceneObject.swift
// DragonMetal
//
// Created by Simon Rodriguez on 10/06/2017.
//
import Foundation
import MetalKit
class SceneObject : Object {
private var textureColor: MTLTexture!
private var textureNormal: MTLTexture!
private var shadowMap: MTLTexture!
init(name: String, device: MTLDevice, shininess: Int, shadowMap: MTLTexture) {
super.init(name: name, device: device, shininess: shininess)
// Store the sahdow map.
self.shadowMap = shadowMap
}
override func loadTextures(device: MTLDevice) {
let textureLoader = MTKTextureLoader(device: device)
// Two textures: color and normals.
let urlTexColor = Bundle.main.url(forResource: name + "_texture_color", withExtension: ".png")!
let urlTexNormal = Bundle.main.url(forResource: name + "_texture_normal", withExtension: ".png")!
textureColor = textureLoader.newTexture(withContentsOf: urlTexColor, srgb: false)
textureNormal = textureLoader.newTexture(withContentsOf: urlTexNormal, srgb: false)
}
override func setFragmentTextures(encoder: MTLRenderCommandEncoder) {
encoder.setFragmentTexture(textureColor, index: 0)
encoder.setFragmentTexture(textureNormal, index: 1)
encoder.setFragmentTexture(shadowMap, index: 2)
}
}
```
|
```html
<html lang="en">
<head>
<title>M32C Pragmas - Using the GNU Compiler Collection (GCC)</title>
<meta http-equiv="Content-Type" content="text/html">
<meta name="description" content="Using the GNU Compiler Collection (GCC)">
<meta name="generator" content="makeinfo 4.8">
<link title="Top" rel="start" href="index.html#Top">
<link rel="up" href="Pragmas.html#Pragmas" title="Pragmas">
<link rel="prev" href="ARM-Pragmas.html#ARM-Pragmas" title="ARM Pragmas">
<link rel="next" href="MeP-Pragmas.html#MeP-Pragmas" title="MeP Pragmas">
<link href="path_to_url" rel="generator-home" title="Texinfo Homepage">
<!--
Permission is granted to copy, distribute and/or modify this document
any later version published by the Free Software Foundation; with the
Invariant Sections being ``Funding Free Software'', the Front-Cover
Texts being (a) (see below), and with the Back-Cover Texts being (b)
(see below). A copy of the license is included in the section entitled
(a) The FSF's Front-Cover Text is:
A GNU Manual
(b) The FSF's Back-Cover Text is:
You have freedom to copy and modify this GNU Manual, like GNU
software. Copies published by the Free Software Foundation raise
funds for GNU development.-->
<meta http-equiv="Content-Style-Type" content="text/css">
<style type="text/css"><!--
pre.display { font-family:inherit }
pre.format { font-family:inherit }
pre.smalldisplay { font-family:inherit; font-size:smaller }
pre.smallformat { font-family:inherit; font-size:smaller }
pre.smallexample { font-size:smaller }
pre.smalllisp { font-size:smaller }
span.sc { font-variant:small-caps }
span.roman { font-family:serif; font-weight:normal; }
span.sansserif { font-family:sans-serif; font-weight:normal; }
--></style>
</head>
<body>
<div class="node">
<p>
<a name="M32C-Pragmas"></a>
Next: <a rel="next" accesskey="n" href="MeP-Pragmas.html#MeP-Pragmas">MeP Pragmas</a>,
Previous: <a rel="previous" accesskey="p" href="ARM-Pragmas.html#ARM-Pragmas">ARM Pragmas</a>,
Up: <a rel="up" accesskey="u" href="Pragmas.html#Pragmas">Pragmas</a>
<hr>
</div>
<h4 class="subsection">6.60.2 M32C Pragmas</h4>
<dl>
<dt><code>GCC memregs </code><var>number</var><dd><a name="index-pragma_002c-memregs-4157"></a>Overrides the command-line option <code>-memregs=</code> for the current
file. Use with care! This pragma must be before any function in the
file, and mixing different memregs values in different objects may
make them incompatible. This pragma is useful when a
performance-critical function uses a memreg for temporary values,
as it may allow you to reduce the number of memregs used.
<br><dt><code>ADDRESS </code><var>name</var> <var>address</var><dd><a name="index-pragma_002c-address-4158"></a>For any declared symbols matching <var>name</var>, this does three things
to that symbol: it forces the symbol to be located at the given
address (a number), it forces the symbol to be volatile, and it
changes the symbol's scope to be static. This pragma exists for
compatibility with other compilers, but note that the common
<code>1234H</code> numeric syntax is not supported (use <code>0x1234</code>
instead). Example:
<pre class="smallexample"> #pragma ADDRESS port3 0x103
char port3;
</pre>
</dl>
</body></html>
```
|
```elixir
defmodule Routeguide.App do
use Application
@cert_path Path.expand("./tls/server1.pem", :code.priv_dir(:route_guide))
@key_path Path.expand("./tls/server1.key", :code.priv_dir(:route_guide))
def start(_type, _args) do
children = [
RouteGuide.Data,
{GRPC.Server.Supervisor, start_args()}
]
opts = [strategy: :one_for_one, name: Routeguide]
Supervisor.start_link(children, opts)
end
defp start_args do
opts = [endpoint: Routeguide.Endpoint, port: 10000, start_server: true]
if System.get_env("TLS") do
cred = GRPC.Credential.new(ssl: [certfile: @cert_path, keyfile: @key_path])
Keyword.put(opts, :cred, cred)
else
opts
end
end
end
```
|
Domagnano is a municipality in San Marino. It has 3,565 inhabitants (May 2018) in an area of 6.62 km2.
Geography
It borders the San Marino municipalities Faetano, Borgo Maggiore, Serravalle and the Italian municipality Coriano.
History
Domagnano, previously known as Montelupo (mountain of wolves) after its coat of arms, was already colonized by Roman times and was first mentioned in c. 1300. It is located on Monte Titano and you can see the Adriatic Sea from here. The so-called Domagnano Treasure was found in the castle here in the late nineteenth century. It is now split between a number of museums, but the largest portions of the treasure are kept at the Germanisches Nationalmuseum in Nuremberg and the British Museum.
Demographic evolution
Parishes
Domagnano has five parishes (curazie):
Cà Giannino, Fiorina, Piandivello, Spaccio Giannoni, Torraccia
References
Municipalities of San Marino
|
Abisara chelina is a butterfly in the family Riodinidae. It is found in southern Burma, Thailand, Peninsular Malaysia, Indo China and southern China.
Subspecies
Abisara chelina chelina (Yunnan)
Abisara chelina duanhuii Huang, 2001 (south-eastern Tibet)
References
Butterflies described in 1904
Abisara
Insects of Myanmar
Insects of Thailand
Insects of China
Butterflies of Asia
|
Everett Gee Jackson (8 October 1900 – 4 March 1995) was an American impressionist painter and professor. He rose to prominence for his landscapes and portraits in 20th century Mexico City and Southern California.
Early life
Jackson was born in Mexia, Texas in 1900. He studied at Texas A&M University before deciding to embark on an art career. He continued his studies at the Art Institute of Chicago and in 1923 traveled to Mexico with his friend and fellow artist, Lowell Houser. They spent time in Guadalajara, Guanajuato, and Oaxaca, until Jackson moved to Mexico City with his wife. He remained there for several years before moving to San Diego.
Career
While in Mexico, Jackson established studios in Oaxaca and Mexico City. He was greatly influenced by Diego Rivera, José Clemente Orozco, and David Siqueiros. After moving back to San Diego, Jackson received his M.A. from the University of Southern California and began teaching Pre-Columbian Art History at San Diego State University, where he remained from 1930 to 1963. He was active in the local art scene and was the founder of the Latin American Arts Committee of the San Diego Museum of Art. During his lengthy career, he illustrated many books about Latin American History. The campus graduate student art gallery at San Diego State University is named after him.
Notable works
United States President Ronald Reagan presented one of Jackson's pieces, The Hikuli Seekers, as a gift to President José López Portillo of Mexico in 1981. Additionally, Jackson's painting, Serra Museum Tower, San Diego, hangs in the Smithsonian American Art Museum.
References
External links
Serra Museum Tower, Jackson c. 1972. Oil on canvas
1900 births
1995 deaths
San Diego State University faculty
Impressionist artists
Texas A&M University alumni
School of the Art Institute of Chicago alumni
American expatriates in Mexico
University of Southern California alumni
People from Mexia, Texas
|
```xml
<?xml version="1.0" encoding="utf-8"?>
<menu xmlns:android="path_to_url"
xmlns:app="path_to_url">
<item android:id="@+id/search"
app:showAsAction="ifRoom"
android:icon="@drawable/ic_search_white_24dp"
android:title="@string/search"
app:actionViewClass="androidx.appcompat.widget.SearchView"/>
<item android:id="@+id/feed_menu"
app:showAsAction="ifRoom"
android:icon="@drawable/ic_rss_feed_white_24dp"
android:title="@string/feed" />
<item android:id="@+id/pause_all_menu"
app:showAsAction="ifRoom"
android:icon="@drawable/ic_pause_white_24dp"
android:title="@string/pause_all" />
<item android:id="@+id/resume_all_menu"
app:showAsAction="ifRoom"
android:icon="@drawable/ic_play_arrow_white_24dp"
android:title="@string/resume_all" />
<item android:id="@+id/log_menu"
android:title="@string/log_journal" />
<item android:id="@+id/settings_menu"
android:icon="@drawable/ic_settings_white_24dp"
android:title="@string/settings" />
<item android:id="@+id/about_menu"
android:icon="@drawable/ic_info_white_24dp"
android:title="@string/about" />
<item android:id="@+id/shutdown_app_menu"
android:icon="@drawable/ic_power_settings_new_white_24dp"
android:title="@string/shutdown" />
</menu>
```
|
Anne Louis François de Paule Lefèvre d'Ormesson de Noyseau (known as Monsieur de Noiseau), (26 February 1753 - 20 April 1794) was a French deputy, librarian, and Hellenist. From 1789 to 1792 he was director of the Bibliotheque du Roi (Royal Library), the precursor to the Bibliothèque nationale de France. He died on the guillotine in Paris, accused of being a royalist.
Biography
He was the son of , the president of the Parliament of Paris exiled to Orly during the Maupeou reform of 1771.
Louis entered the same parliament on 6 September 1770 and was a councillor until it dissolved in 1771. He became Président à mortier (presiding member) on 15 March 1779, taking over the position previously held by his father.
On 7 May 1789 he was elected with 113 of 200 votes to the Estates-General as a deputy for the nobility, from the Paris-Hors-les-Murs (Paris outside the walls) constituency, by the prévôts and other aristocracy of Paris. He was part of the ecclesiastical committee that produced the law on the Civil Constitution of the Clergy adopted by the Assembly, and also one of the deputies brought back to Paris with the king on 6 October 1789 after the Women's March on Versailles. He favored the "vote par tête", one deputy one vote, as opposed to the weighted system then in effect. He opposed the abolition of feudal rights, and signed the protests of 12 and 15 September 1791 against the decisions of the Constituent Assembly. His term ended on 30 September 1791 when the new constitution took effect, creating the National Assembly.
He succeeded Jean-Charles-Pierre Lenoir in 1790 at the Royal Library and was there until August 1792, when he became a member of the commission of public monuments, and of the Académie des Inscriptions et Belles-Lettres as a distinguished Hellenist.
He was arrested in December 1793 as a royalist along with Jean Baptiste Gaspard Bochart de Saron. He was brought before the Revolutionary Tribunal, and condemned to death for having signed a protest against the abolition of the parliaments. This protest was found in the papers of , when he was arrested with all his family in the Château de Malesherbes, with his father-in-law Chrétien Guillaume de Lamoignon de Malesherbes, one of Louis XVI's lawyers. Lefèvre d'Ormesson was executed along with twenty-one other deputies of the old parliaments of Paris and Toulouse on 1 Floréal, Year II.
He married Anne-Louise-Reine-Jeanne Lyon Baillon in 1779. He had no children.
Bibliography
References
Members of the National Constituent Assembly (France)
French librarians
French people executed by guillotine during the French Revolution
Members of the Académie des Inscriptions et Belles-Lettres
1753 births
1794 deaths
French translators
Greek–French translators
|
```ruby
class Nfdump < Formula
desc "Tools to collect and process netflow data on the command-line"
homepage "path_to_url"
url "path_to_url"
sha256 your_sha256_hash
license "BSD-3-Clause"
head "path_to_url", branch: "master"
bottle do
sha256 cellar: :any, arm64_sonoma: your_sha256_hash
sha256 cellar: :any, arm64_ventura: your_sha256_hash
sha256 cellar: :any, arm64_monterey: your_sha256_hash
sha256 cellar: :any, sonoma: your_sha256_hash
sha256 cellar: :any, ventura: your_sha256_hash
sha256 cellar: :any, monterey: your_sha256_hash
sha256 cellar: :any_skip_relocation, x86_64_linux: your_sha256_hash
end
depends_on "autoconf" => :build
depends_on "automake" => :build
depends_on "libtool" => :build
depends_on "pkg-config" => :build
uses_from_macos "bison" => :build
uses_from_macos "flex" => :build
uses_from_macos "bzip2"
uses_from_macos "libpcap"
def install
system "./autogen.sh"
system "./configure", *std_configure_args, "--enable-readpcap", "LEXLIB="
system "make", "install"
end
test do
system bin/"nfdump", "-Z", "host 8.8.8.8"
end
end
```
|
```c
/**
******************************************************************************
* @file stm32f769i_discovery_eeprom.c
* @author MCD Application Team
* @brief This file provides a set of functions needed to manage an I2C M24LR64
* EEPROM memory.
@verbatim
To be able to use this driver, the switch EE_M24LR64 must be defined
in your toolchain compiler preprocessor
===================================================================
Notes:
- The I2C EEPROM memory (M24LR64) is available on separate daughter
board ANT7-M24LR-A, which is not provided with the STM32F769I_DISCOVERY
board.
To use this driver you have to connect the ANT7-M24LR-A to CN2
connector of STM32F769I_DISCOVERY board.
===================================================================
It implements a high level communication layer for read and write
from/to this memory. The needed STM32F7xx hardware resources (I2C and
GPIO) are defined in stm32f769i_discovery.h file, and the initialization is
performed in EEPROM_IO_Init() function declared in stm32f769i_discovery.c
file.
You can easily tailor this driver to any other development board,
by just adapting the defines for hardware resources and
EEPROM_IO_Init() function.
@note In this driver, basic read and write functions (BSP_EEPROM_ReadBuffer()
and BSP_EEPROM_WritePage()) use DMA mode to perform the data
transfer to/from EEPROM memory.
@note Regarding BSP_EEPROM_WritePage(), it is an optimized function to perform
small write (less than 1 page) BUT the number of bytes (combined to write start address) must not
cross the EEPROM page boundary. This function can only writes into
the boundaries of an EEPROM page.
This function doesn't check on boundaries condition (in this driver
the function BSP_EEPROM_WriteBuffer() which calls BSP_EEPROM_WritePage() is
responsible of checking on Page boundaries).
+your_sha256_hash-+
| Pin assignment for M24LR64 EEPROM |
+---------------------------------------+-----------+-------------+
| STM32F7xx I2C Pins | EEPROM | Pin |
+---------------------------------------+-----------+-------------+
| . | E0(GND) | 1 (0V) |
| . | AC0 | 2 |
| . | AC1 | 3 |
| . | VSS | 4 (0V) |
| SDA | SDA | 5 |
| SCL | SCL | 6 |
| . | E1(GND) | 7 (0V) |
| . | VDD | 8 (3.3V) |
+---------------------------------------+-----------+-------------+
@endverbatim
******************************************************************************
* @attention
*
* <h2><center>© COPYRIGHT(c) 2016 STMicroelectronics</center></h2>
*
* Redistribution and use in source and binary forms, with or without modification,
* are permitted provided that the following conditions are met:
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* 3. Neither the name of STMicroelectronics nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
******************************************************************************
*/
/* Dependencies
- stm32f769i_discovery.c
EndDependencies */
/* Includes your_sha256_hash--*/
#include "stm32f769i_discovery_eeprom.h"
/** @addtogroup BSP
* @{
*/
/** @addtogroup STM32F769I_DISCOVERY
* @{
*/
/** @addtogroup STM32F769I_DISCOVERY_EEPROM STM32F769I_DISCOVERY EEPROM
* @brief This file includes the I2C EEPROM driver of STM32F769I-DISCOVERY board.
* @{
*/
/** @defgroup STM32F769I_DISCOVERY_EEPROM_Private_Types EEPROM Private Types
* @{
*/
/**
* @}
*/
/** @defgroup STM32F769I_DISCOVERY_EEPROM_Private_Defines EEPROM Private Defines
* @{
*/
/**
* @}
*/
/** @defgroup STM32F769I_DISCOVERY_EEPROM_Private_Macros EEPROM Private Macros
* @{
*/
/**
* @}
*/
/** @defgroup STM32F769I_DISCOVERY_EEPROM_Private_Variables EEPROM Private Variables
* @{
*/
__IO uint16_t EEPROMAddress = 0;
__IO uint16_t EEPROMDataRead;
__IO uint8_t EEPROMDataWrite;
/**
* @}
*/
/** @defgroup STM32F769I_DISCOVERY_EEPROM_Private_Function_Prototypes EEPROM Private Function Prototypes
* @{
*/
/**
* @}
*/
/** @defgroup STM32F769I_DISCOVERY_EEPROM_Private_Functions EEPROM Private Functions
* @{
*/
/**
* @brief Initializes peripherals used by the I2C EEPROM driver.
* @note There are 2 different versions of M24LR64 (A01 & A02).
* Then try to connect on 1st one (EEPROM_I2C_ADDRESS_A01)
* and if problem, check the 2nd one (EEPROM_I2C_ADDRESS_A02)
* @retval EEPROM_OK (0) if operation is correctly performed, else return value
* different from EEPROM_OK (0)
*/
uint32_t BSP_EEPROM_Init(void)
{
/* I2C Initialization */
EEPROM_IO_Init();
/* Select the EEPROM address for A01 and check if OK */
EEPROMAddress = EEPROM_I2C_ADDRESS_A01;
if(EEPROM_IO_IsDeviceReady(EEPROMAddress, EEPROM_MAX_TRIALS) != HAL_OK)
{
/* Select the EEPROM address for A02 and check if OK */
EEPROMAddress = EEPROM_I2C_ADDRESS_A02;
if(EEPROM_IO_IsDeviceReady(EEPROMAddress, EEPROM_MAX_TRIALS) != HAL_OK)
{
return EEPROM_FAIL;
}
}
return EEPROM_OK;
}
/**
* @brief DeInitializes the EEPROM.
* @retval EEPROM state
*/
uint8_t BSP_EEPROM_DeInit(void)
{
/* I2C won't be disabled because common to other functionalities */
return EEPROM_OK;
}
/**
* @brief Reads a block of data from the EEPROM.
* @param pBuffer: pointer to the buffer that receives the data read from
* the EEPROM.
* @param ReadAddr: EEPROM's internal address to start reading from.
* @param NumByteToRead: pointer to the variable holding number of bytes to
* be read from the EEPROM.
*
* @note The variable pointed by NumByteToRead is reset to 0 when all the
* data are read from the EEPROM. Application should monitor this
* variable in order know when the transfer is complete.
*
* @retval EEPROM_OK (0) if operation is correctly performed, else return value
* different from EEPROM_OK (0) or the timeout user callback.
*/
uint32_t BSP_EEPROM_ReadBuffer(uint8_t* pBuffer, uint16_t ReadAddr, uint16_t* NumByteToRead)
{
uint32_t buffersize = *NumByteToRead;
/* Set the pointer to the Number of data to be read. This pointer will be used
by the DMA Transfer Completer interrupt Handler in order to reset the
variable to 0. User should check on this variable in order to know if the
DMA transfer has been complete or not. */
EEPROMDataRead = *NumByteToRead;
if(EEPROM_IO_ReadData(EEPROMAddress, ReadAddr, pBuffer, buffersize) != HAL_OK)
{
BSP_EEPROM_TIMEOUT_UserCallback();
return EEPROM_FAIL;
}
/* If all operations OK, return EEPROM_OK (0) */
return EEPROM_OK;
}
/**
* @brief Writes more than one byte to the EEPROM with a single WRITE cycle.
*
* @note The number of bytes (combined to write start address) must not
* cross the EEPROM page boundary. This function can only write into
* the boundaries of an EEPROM page.
* This function doesn't check on boundaries condition (in this driver
* the function BSP_EEPROM_WriteBuffer() which calls BSP_EEPROM_WritePage() is
* responsible of checking on Page boundaries).
*
* @param pBuffer: pointer to the buffer containing the data to be written to
* the EEPROM.
* @param WriteAddr: EEPROM's internal address to write to.
* @param NumByteToWrite: pointer to the variable holding number of bytes to
* be written into the EEPROM.
*
* @note The variable pointed by NumByteToWrite is reset to 0 when all the
* data are written to the EEPROM. Application should monitor this
* variable in order know when the transfer is complete.
*
* @note This function just configure the communication and enable the DMA
* channel to transfer data. Meanwhile, the user application may perform
* other tasks in parallel.
*
* @retval EEPROM_OK (0) if operation is correctly performed, else return value
* different from EEPROM_OK (0) or the timeout user callback.
*/
uint32_t BSP_EEPROM_WritePage(uint8_t* pBuffer, uint16_t WriteAddr, uint8_t* NumByteToWrite)
{
uint32_t buffersize = *NumByteToWrite;
uint32_t status = EEPROM_OK;
/* Set the pointer to the Number of data to be written. This pointer will be used
by the DMA Transfer Completer interrupt Handler in order to reset the
variable to 0. User should check on this variable in order to know if the
DMA transfer has been complete or not. */
EEPROMDataWrite = *NumByteToWrite;
if(EEPROM_IO_WriteData(EEPROMAddress, WriteAddr, pBuffer, buffersize) != HAL_OK)
{
BSP_EEPROM_TIMEOUT_UserCallback();
status = EEPROM_FAIL;
}
if(BSP_EEPROM_WaitEepromStandbyState() != EEPROM_OK)
{
return EEPROM_FAIL;
}
/* If all operations OK, return EEPROM_OK (0) */
return status;
}
/**
* @brief Writes buffer of data to the I2C EEPROM.
* @param pBuffer: pointer to the buffer containing the data to be written
* to the EEPROM.
* @param WriteAddr: EEPROM's internal address to write to.
* @param NumByteToWrite: number of bytes to write to the EEPROM.
* @retval EEPROM_OK (0) if operation is correctly performed, else return value
* different from EEPROM_OK (0) or the timeout user callback.
*/
uint32_t BSP_EEPROM_WriteBuffer(uint8_t *pBuffer, uint16_t WriteAddr, uint16_t NumByteToWrite)
{
uint16_t numofpage = 0, numofsingle = 0, count = 0;
uint16_t addr = 0;
uint8_t dataindex = 0;
uint32_t status = EEPROM_OK;
addr = WriteAddr % EEPROM_PAGESIZE;
count = EEPROM_PAGESIZE - addr;
numofpage = NumByteToWrite / EEPROM_PAGESIZE;
numofsingle = NumByteToWrite % EEPROM_PAGESIZE;
/* If WriteAddr is EEPROM_PAGESIZE aligned */
if(addr == 0)
{
/* If NumByteToWrite < EEPROM_PAGESIZE */
if(numofpage == 0)
{
/* Store the number of data to be written */
dataindex = numofsingle;
/* Start writing data */
status = BSP_EEPROM_WritePage(pBuffer, WriteAddr, (uint8_t*)(&dataindex));
if(status != EEPROM_OK)
{
return status;
}
}
/* If NumByteToWrite > EEPROM_PAGESIZE */
else
{
while(numofpage--)
{
/* Store the number of data to be written */
dataindex = EEPROM_PAGESIZE;
status = BSP_EEPROM_WritePage(pBuffer, WriteAddr, (uint8_t*)(&dataindex));
if(status != EEPROM_OK)
{
return status;
}
WriteAddr += EEPROM_PAGESIZE;
pBuffer += EEPROM_PAGESIZE;
}
if(numofsingle!=0)
{
/* Store the number of data to be written */
dataindex = numofsingle;
status = BSP_EEPROM_WritePage(pBuffer, WriteAddr, (uint8_t*)(&dataindex));
if(status != EEPROM_OK)
{
return status;
}
}
}
}
/* If WriteAddr is not EEPROM_PAGESIZE aligned */
else
{
/* If NumByteToWrite < EEPROM_PAGESIZE */
if(numofpage== 0)
{
/* If the number of data to be written is more than the remaining space
in the current page: */
if(NumByteToWrite > count)
{
/* Store the number of data to be written */
dataindex = count;
/* Write the data contained in same page */
status = BSP_EEPROM_WritePage(pBuffer, WriteAddr, (uint8_t*)(&dataindex));
if(status != EEPROM_OK)
{
return status;
}
/* Store the number of data to be written */
dataindex = (NumByteToWrite - count);
/* Write the remaining data in the following page */
status = BSP_EEPROM_WritePage((uint8_t*)(pBuffer + count), (WriteAddr + count), (uint8_t*)(&dataindex));
if(status != EEPROM_OK)
{
return status;
}
}
else
{
/* Store the number of data to be written */
dataindex = numofsingle;
status = BSP_EEPROM_WritePage(pBuffer, WriteAddr, (uint8_t*)(&dataindex));
if(status != EEPROM_OK)
{
return status;
}
}
}
/* If NumByteToWrite > EEPROM_PAGESIZE */
else
{
NumByteToWrite -= count;
numofpage = NumByteToWrite / EEPROM_PAGESIZE;
numofsingle = NumByteToWrite % EEPROM_PAGESIZE;
if(count != 0)
{
/* Store the number of data to be written */
dataindex = count;
status = BSP_EEPROM_WritePage(pBuffer, WriteAddr, (uint8_t*)(&dataindex));
if(status != EEPROM_OK)
{
return status;
}
WriteAddr += count;
pBuffer += count;
}
while(numofpage--)
{
/* Store the number of data to be written */
dataindex = EEPROM_PAGESIZE;
status = BSP_EEPROM_WritePage(pBuffer, WriteAddr, (uint8_t*)(&dataindex));
if(status != EEPROM_OK)
{
return status;
}
WriteAddr += EEPROM_PAGESIZE;
pBuffer += EEPROM_PAGESIZE;
}
if(numofsingle != 0)
{
/* Store the number of data to be written */
dataindex = numofsingle;
status = BSP_EEPROM_WritePage(pBuffer, WriteAddr, (uint8_t*)(&dataindex));
if(status != EEPROM_OK)
{
return status;
}
}
}
}
/* If all operations OK, return EEPROM_OK (0) */
return EEPROM_OK;
}
/**
* @brief Wait for EEPROM Standby state.
*
* @note This function allows to wait and check that EEPROM has finished the
* last operation. It is mostly used after Write operation: after receiving
* the buffer to be written, the EEPROM may need additional time to actually
* perform the write operation. During this time, it doesn't answer to
* I2C packets addressed to it. Once the write operation is complete
* the EEPROM responds to its address.
*
* @retval EEPROM_OK (0) if operation is correctly performed, else return value
* different from EEPROM_OK (0) or the timeout user callback.
*/
uint32_t BSP_EEPROM_WaitEepromStandbyState(void)
{
/* Check if the maximum allowed number of trials has bee reached */
if(EEPROM_IO_IsDeviceReady(EEPROMAddress, EEPROM_MAX_TRIALS) != HAL_OK)
{
/* If the maximum number of trials has been reached, exit the function */
BSP_EEPROM_TIMEOUT_UserCallback();
return EEPROM_TIMEOUT;
}
return EEPROM_OK;
}
/**
* @brief Basic management of the timeout situation.
* @retval None
*/
__weak void BSP_EEPROM_TIMEOUT_UserCallback(void)
{
}
/**
* @}
*/
/**
* @}
*/
/**
* @}
*/
/**
* @}
*/
/************************ (C) COPYRIGHT STMicroelectronics *****END OF FILE****/
```
|
Macarao is a parish located in the Libertador Bolivarian Municipality, southwest of the city of Caracas, Venezuela.
References
Parishes of Capital District (Venezuela)
|
```python
from jupyterlab.commands import watch_dev
if __name__ == "__main__":
procs = watch_dev()
procs[0].wait()
```
|
```yaml
models:
- columns:
- name: id
tests:
- unique
- not_null
- relationships:
field: id
to: ref('node_0')
name: node_597
version: 2
```
|
```python
"""
Support for GEOS spatial predicates
"""
from shapely.geos import PredicateError, TopologicalError
from shapely.topology import Delegating
class BinaryPredicate(Delegating):
def __call__(self, this, other, *args):
self._validate(this)
self._validate(other, stop_prepared=True)
try:
return self.fn(this._geom, other._geom, *args)
except PredicateError as err:
# Dig deeper into causes of errors.
self._check_topology(err, this, other)
class UnaryPredicate(Delegating):
def __call__(self, this):
self._validate(this)
return self.fn(this._geom)
```
|
Bregawn (foaled 1974) was an Irish-bred racehorse who developed into a top class steeplechaser. He is best known for winning the 1983 running of the Cheltenham Gold Cup, when his trainer Michael Dickinson trained the first five runners home.
Background
Bregawn was foaled in 1974 in Ireland. His sire, Saint Denys, finished second in the 1962 running of the Irish 2,000 Guineas. His dam was unraced.
Early career
Bregawn went into training with Chris Kinane in Ireland. He won a bumpers event in early 1979, then a maiden hurdle race at Limerick in December of the same year. On his sixth and final start of the 1979/80 season, he was sent over to Aintree, where he finished second in an amateur riders' handicap hurdle. After that run he remained in England and was transferred to the stables of Michael Dickinson.
1980/1981 season
Switched straight to fences, Bregawn ran twelve times during this season, winning on six occasions. The victories came at Market Rasen, Catterick, Wetherby, Warwick, Newcastle and Aintree. He did however fail to complete the course on four occasions, and when he won at Warwick the Raceform representative reporting on the day, Ivor Markham, noted that "he is still inclined to go right at his fences and makes hard work of jumping." Bregawn had progressed enough to take his chance in the Ritz Club Handicap Chase at Cheltenham in March. He was leading in that event when falling three fences from home. The Timeform organisation stated that, "in our opinion Bregawn would have won had he stood up." In his final race of the season he won the Siematic Kitchens Novices Chase at the Aintree Grand National meeting. Bregawn did not have a regular rider during the season and was partnered by a different rider for each victory.
1981/1982 season
Bregawn developed into a high class chaser during this season. He won four of his six starts and in his last run he finished runner up to his stable companion Silver Buck in the Cheltenham Gold Cup. Bregawn's winning reappearance in a small handicap chase at Market Rasen was his only start before Christmas. He next appeared in the Peter Marsh Chase at Haydock Park, where he took advantage of the 19 lb in weight he received from Night Nurse, to beat that rival by five lengths. Bregawn ran again a week later in the Great Yorkshire Chase at Doncaster. On his previous two starts he had been ridden by Graham Bradley and Robert Earnshaw, who were both attached to the Dickinson yard. At Doncaster John Francome was aboard. Bregawn started the 11/8 favourite on the strength of his victory the previous weekend. He led four fences from home and won by two and a half lengths from Megan's Boy. With a growing reputation, Bregawn made another quick reappearance seven days later in the Freshfields Holidays Handicap Chase at Sandown. With Robert Earnshaw back on board, Bregawn started the 3/1 favourite, went into the lead five fences form home and beat Saint Fillans by five lengths. Night Nurse, who was concededing 20 lb in weight to Bregawn, was a further two lengths back in third. Bregawn was next seen in the Greenall Whitley Chase at Haydock Park in early March. Starting the 11/10 favourite, he failed by a length to concede 9 lb to the winner Scot Lane, running on strongly late on after being interfered with by a faller two fences from the finish. The Raceform representative was of the opinion that Bregawn, " must be considered an unlucky loser". Bregawn's final appearance of the season came in the Cheltenham Gold Cup. This was the stiffest task of his career so far and he started at odds of 18/1 in a twenty two runner field. With Graham Bradley in the saddle, Bregawn was prominent all the way and he and his stable companion Silver Buck fought out the contest from two fences out. Silver Buck eventually came out on top by two lengths, with a twelve length gap back to the third horse home, Sunset Cristo. Bregawn finished the season with a Timeform rating of 174, one pound behind his stable companion Silver Buck, who was voted National Hunt Horse of the Year.
1982/1983 season
Bregawn ran seven times during this season, winning on five occasions, finishing the season with victory in the Cheltenham Gold Cup. After beginning the season with victory in a minor event at Newton Abbott in October, Bregawn was not hard pressed to win the four runner Rehearsal Chase at Chepstow in early November. Bregawn then lined up for the Hennessy Gold Cup at Newbury on the final Saturday of November. Ridden by his now regular rider Graham Bradley, Bregawn carried the second top weight of 11 stone 10 lb, 2 lb lower than the top weight, Night Nurse. Starting the 9/4 favourite, he fought out the later stages of the race with his stable companion Captain John, to whom he was conceding 10 lb. In an exciting finish, Bregawn made a bad mistake at the final fence, nearly unseating Bradley, and started the run-in three lengths behind his rival. He then found extra reserves to chase down and pass Captain John and passed the line three lengths ahead. Describing the performance, Timeform stated," the closing stages of the Hennessy underlined Bregawn's battling qualities and his tremendous zest for racing." Bregawn was beaten in his next start, the Tommy Whittle Chase at Haydock Park by his sole rival, the 1981 Cheltenham Gold Cup winner Little Owl. Bregawn was said to have pulled a muscle and this would keep him out of the King George VI Chase. Bregawn was next seen on 24 February in the Jim Ford Challenge Cup at Wincanton. In a seven runner event, he started the 6/5 favourite and was beaten half a length by Comb's Ditch. The Timeform representative at the course reported that Bregawn was "very much in need of the race - he looked quite distressed afterwards and blew very hard." A field of eleven lined up for the 1983 Cheltenham Gold Cup run on soft ground. Bregawn went off the 100/30 favourite ahead of Comb's Ditch at 9/2. Then came two of Bregawn's stable companions Silver Buck and Wayward Lad at 5/1 and 6/1 respectively. The Fred Winter trained pair of Fifty Dollars More and Brown Chamberlin came next in the betting followed by the other two Dickinson runners, Captain John and Ashley House. In a race famous for Michael Dickinson training the first five home, Bregawn went to the front at the fifth fence and remained ahead from then on, seeing off the strong challenges of stable companions Captain John and Wayward Lad in the later stages of the race. Bregawn passed the post five lengths ahead of Captain John, with a further length and a half back to Wayward Lad in third. There was then a large gap back to the other two Dickinson runners, Silver Buck and Ashley House. Bregawn ended the season as Timeform's best staying chaser, with a rating of 177, behind only the two-mile champion Badsworth Boy, another Michael Dickinson trained horse who received a rating of 179. Bregawn would never repeat the level of the form shown during this season. In referral to the Gold Cup performance, Graham Bradley is on record as saying, " I firmly believe that he was so brave that day and put in so much effort that he was totally exhausted. It blew his mind and, a bit like a boxer who wins a championship but gets badly beaten doing it, Bregawn just didn't want to go through the pain barrier again."
1983/1984 season
Bregawn ran seven times during this season without winning. He often showed signs of temperament and even refused during the Jim Ford Chase at Wincanton. On other occasions he dropped himself out of contention and tried to pull himself up when tried in blinkers in the 1984 Cheltenham Gold Cup. The Timeform organisation, commenting on Bregawn's season, said that he, " fell from grace faster than Icarus", and their advice to punters was, " Bregawn is best left severely alone nowadays."
1984/1985 season
Bregawn was trained in Ireland during this, his last season racing. His first run of the season was from the stable of Martin Cullinane, and the remaining three runs after being moved to the yard of Paddy Mullins. He won a handicap hurdle at Limerick in March, then was sent to England to run in the 1985 Cheltenham Gold Cup in which he was tailed off when refusing at the last. This was to be his final race.
Retirement
Bregawn enjoyed a long retirement at his owner's stud in Mylerstown, Ireland, spending much of his time out at grass with the owner's foals and yearlings. He died in 2007.
References
1974 racehorse births
National Hunt racehorses
Cheltenham Gold Cup winners
2007 racehorse deaths
|
Juha Pekka Leskinen (born 26 February 1954) is a Finnish former competitive figure skater. He represented Finland at the 1976 Winter Olympics in Innsbruck and finished 13th overall. He won the Finnish national title three times (1970, 1971, 1975). Later in his career, he was an ISU Judge for Finland and judged in the 2002, 2010, and 2018 Winter Olympics.
Results
References
1954 births
Living people
Finnish male single skaters
Figure skaters at the 1976 Winter Olympics
Olympic figure skaters for Finland
Sportspeople from Kuopio
|
Horology (; related to Latin ; ; , interfix -o-, and suffix -logy) is the study of the measurement of time. Clocks, watches, clockwork, sundials, hourglasses, clepsydras, timers, time recorders, marine chronometers, and atomic clocks are all examples of instruments used to measure time. In current usage, horology refers mainly to the study of mechanical time-keeping devices, while chronometry more broadly includes electronic devices that have largely supplanted mechanical clocks for the best accuracy and precision in time-keeping.
People interested in horology are called horologists. That term is used both by people who deal professionally with timekeeping apparatuses (watchmakers, clockmakers), as well as aficionados and scholars of horology. Horology and horologists have numerous organizations, both professional associations and more scholarly societies. The largest horological membership organisation globally is the NAWCC, the National Association of Watch and Clock Collectors, which is US based, but also has local chapters elsewhere.
History
Museums and libraries
In Europe
There are many horology museums and several specialized libraries devoted to the subject. One example is the Royal Greenwich Observatory, which is also the source of the Prime Meridian (longitude 0° 0' 0"), and the home of the first marine timekeepers accurate enough to determine longitude (made by John Harrison). Other horological museums in the London area include the Clockmakers' Museum, which re-opened at the Science Museum in October 2015, the horological collections at the British Museum, the Science Museum (London), and the Wallace Collection. The Guildhall Library in London contains an extensive public collection on horology. In Upton, also in the United Kingdom, at the headquarters of the British Horological Institute, there is the Museum of Timekeeping. A more specialised museum of horology in the United Kingdom is the Cuckooland Museum in Cheshire, which hosts the world's largest collection of antique cuckoo clocks.
One of the more comprehensive museums dedicated to horology is the Musée international d'horlogerie, in La Chaux-de-Fonds in Switzerland, which contains a public library of horology. The Musée d'Horlogerie du Locle is smaller but located nearby. Other good horological libraries providing public access are at the Musée international d'horlogerie in Switzerland, at La Chaux-de-Fonds, and at Le Locle.
In France, Besançon has the Musée du Temps (Museum of Time) in the historic Palais Grenvelle. In Serpa and Évora, in Portugal, there is the Museu do Relógio. In Germany, there is the Deutsches Uhrenmuseum in Furtwangen im Schwarzwald, in the Black Forest, which contains a public library of horology.
In North America
The two leading specialised horological museums in North America are the National Watch and Clock Museum in Columbia, Pennsylvania, and the American Clock and Watch Museum in Bristol, Connecticut. Another museum dedicated to clocks is the Willard House and Clock Museum in Grafton, Massachusetts. One of the most comprehensive horological libraries open to the public is the National Watch and Clock Library in Columbia, Pennsylvania.
Organizations
Notable scholarly horological organizations include:
American Watchmakers-Clockmakers Institute – AWCI (United States of America)
Antiquarian Horological Society – AHS (United Kingdom)
British Horological Institute – BHI (United Kingdom)
Chronometrophilia (Switzerland)
Deutsche Gesellschaft für Chronometrie – DGC (Germany)
Horological Society of New York – HSNY (United States of America)
National Association of Watch and Clock Collectors – NAWCC (United States of America)
UK Horology - UK Clock & Watch Company based in Bristol
World exhibitions
Geneva Time Exhibition
Salon International de la Haute Horlogerie (SIHH)
Glossary
See also
References
Further reading
Perman, Stacy, A Grand Complication: The Race to Build the World's Most Legendary Watch, Atria Books (Simon & Schuster), February 2013.
Berner, G.A., Illustrated Professional Dictionary of Horology, Federation of the Swiss Watch Industry FH 1961 - 2012
Daniels, George, Watchmaking, London: Philip Wilson Publishers, 1981 (reprinted June 15, 2011)
Beckett, Edmund, A Rudimentary Treatise on Clocks, Watches and Bells, 1903, from Project Gutenberg
Grafton, Edward, Horology, a popular sketch of clock and watch making, London: Aylett and Jones, 1849
External links
Dictionary of Horology
Timekeeping
|
```java
/*
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package org.apache.shardingsphere.sharding.route.engine.type.ignore;
import org.apache.shardingsphere.infra.route.context.RouteContext;
import org.apache.shardingsphere.sharding.route.engine.type.ShardingRouteEngine;
import org.apache.shardingsphere.sharding.rule.ShardingRule;
/**
* Sharding ignore routing engine.
*/
public final class ShardingIgnoreRoutingEngine implements ShardingRouteEngine {
@Override
public RouteContext route(final ShardingRule shardingRule) {
return new RouteContext();
}
}
```
|
In quantum field theory, a Slavnov–Taylor identity is the non-Abelian generalisation of a Ward–Takahashi identity, which in turn is an identity between correlation functions that follows from the global or gauged symmetries of a theory, and which remains valid after renormalization. The identity was originally discovered by Gerard 't Hooft, and it is named after Andrei Slavnov and John C. Taylor who rephrased the identity to hold off the mass shell.
References
External links
Slavnov-Taylor identities
Gauge theories
|
```smalltalk
using Aurora.Settings;
using Aurora.Settings.Layers;
using System.Collections.Generic;
using System.Drawing;
using System.Linq;
using System.Runtime.Serialization;
namespace Aurora.Profiles.QuantumConumdrum
{
public class QuantumConumdrumProfile : ApplicationProfile
{
public QuantumConumdrumProfile() : base()
{
}
[OnDeserialized]
void OnDeserialized(StreamingContext context)
{
if (!Layers.Any(lyr => lyr.Handler.GetType().Equals(typeof(Aurora.Settings.Layers.WrapperLightsLayerHandler))))
Layers.Add(new Layer("Wrapper Lighting", new Aurora.Settings.Layers.WrapperLightsLayerHandler()));
}
public override void Reset()
{
base.Reset();
Layers = new System.Collections.ObjectModel.ObservableCollection<Layer>()
{
new Layer("Movement", new SolidColorLayerHandler()
{
Properties = new LayerHandlerProperties()
{
_PrimaryColor = Color.DodgerBlue,
_Sequence = new KeySequence(new Devices.DeviceKeys[] { Devices.DeviceKeys.W, Devices.DeviceKeys.A, Devices.DeviceKeys.S, Devices.DeviceKeys.D, Devices.DeviceKeys.SPACE})
}
}
),
new Layer("Fluffy", new SolidColorLayerHandler()
{
Properties = new LayerHandlerProperties()
{
_PrimaryColor = Color.Pink,
_Sequence = new KeySequence(new Devices.DeviceKeys[] { Devices.DeviceKeys.Q})
}
}
),
new Layer("Heavy", new SolidColorLayerHandler()
{
Properties = new LayerHandlerProperties()
{
_PrimaryColor = Color.Red,
_Sequence = new KeySequence(new Devices.DeviceKeys[] { Devices.DeviceKeys.E})
}
}
),
new Layer("Slow", new SolidColorLayerHandler()
{
Properties = new LayerHandlerProperties()
{
_PrimaryColor = Color.Yellow,
_Sequence = new KeySequence(new Devices.DeviceKeys[] { Devices.DeviceKeys.ONE})
}
}
),
new Layer("Reverse", new SolidColorLayerHandler()
{
Properties = new LayerHandlerProperties()
{
_PrimaryColor = Color.Green,
_Sequence = new KeySequence(new Devices.DeviceKeys[] { Devices.DeviceKeys.THREE})
}
}
),
new Layer("Wrapper Lighting", new Aurora.Settings.Layers.WrapperLightsLayerHandler())
};
}
}
}
```
|
```groovy
package fastdex.build.transform
import com.android.build.api.transform.*
import fastdex.build.util.Constants
import fastdex.build.variant.FastdexVariant
import org.gradle.api.file.FileCollection
import java.lang.reflect.Constructor
/**
* Created by tong on 17/10/31.
*/
@Deprecated
class FastdexDexMergerTransform extends TransformProxy {
FastdexDexMergerTransform(Transform base,File streamOutputFolder, FastdexVariant fastdexVariant) {
super(replaceBaseTransform(base,fastdexVariant),streamOutputFolder,fastdexVariant)
}
@Override
void transform(TransformInvocation transformInvocation) throws TransformException, IOException, InterruptedException {
if (fastdexVariant.hasDexCache) {
if (fastdexVariant.projectSnapshoot.diffResultSet.isJavaFileChanged()) {
File patchJar = new File(fastdexVariant.dexBuilderOutputFolder,Constants.PATCH_JAR)
fastdexBuilder.patchBuild(base,patchJar,streamOutputFolder)
}
else {
project.logger.error("==fastdex no java files have changed, just ignore")
}
}
else {
project.logger.error("\n==fastdex normal transform start")
fastdexBuilder.invokeNormalBuildTransform(base,transformInvocation)
project.logger.error("==fastdex normal transform end\n")
}
}
static Transform replaceBaseTransform(Transform base, FastdexVariant fastdexVariant) {
//multiDexEnabled true, minSdkVersion 15
// base.dexingType: LEGACY_MULTIDEX
// base.mainDexListFile: file collection
// base.errorReporter: com.android.build.gradle.internal.ExtraModelInfo@5b238f1d
// base.dexMerger: DX
// base.minSdkVersion: 15
// base.isDebuggable: true
//
//multiDexEnabled true, minSdkVersion 21
// base.dexingType: NATIVE_MULTIDEX
// base.mainDexListFile: null
// base.errorReporter: com.android.build.gradle.internal.ExtraModelInfo@3c9d924
// base.dexMerger: DX
// base.minSdkVersion: 21
// base.isDebuggable: true
//com.android.build.gradle.internal.transforms.DexMergerTransform
Class dexingTypeClass = Class.forName("com.android.builder.dexing.DexingType")
Object[] values = dexingTypeClass.getMethod("values").invoke(null,null)
Constructor<?>[] constructors = base.getClass().getConstructors()
Constructor targetConstructor = constructors[0]
Transform result =
targetConstructor.newInstance(values.find { it.isMultiDex() && it.isPreDex() }
,(FileCollection)null
, base.errorReporter
,base.dexMerger
,21
,true)
return result
}
}
```
|
```xml
<resources>
<declare-styleable name="ExTabLayout">
<attr name="tabTitleArray" format="string" />
<attr name="tabIcon1" format="reference" />
<attr name="tabIcon2" format="reference" />
<attr name="tabIcon3" format="reference" />
<attr name="tabIcon4" format="reference" />
<attr name="tabIcon5" format="reference" />
<attr name="tabMyTextColor" format="reference" />
</declare-styleable>
<declare-styleable name="ExViewPager">
<attr name="pagerCurrItem" format="integer" />
<attr name="pagerLayout1" format="reference" />
<attr name="pagerLayout2" format="reference" />
<attr name="pagerLayout3" format="reference" />
<attr name="pagerLayout4" format="reference" />
<attr name="pagerLayout5" format="reference" />
</declare-styleable>
<declare-styleable name="ExPagerBottomTabLayout">
<attr name="bottomCurrItem" format="integer" />
<attr name="bottomTabTitleArray" format="string" />
<attr name="bottomTab1" format="reference" />
<attr name="bottomTab2" format="reference" />
<attr name="bottomTab3" format="reference" />
<attr name="bottomTab4" format="reference" />
<attr name="bottomTab5" format="reference" />
<attr name="bottomTab6" format="reference" />
</declare-styleable>
<declare-styleable name="ExAutoLabelUI">
<attr name="tagArray" format="string" />
</declare-styleable>
<declare-styleable name="NumberPickerPreference">
<attr name="MinValue" format="integer" />
<attr name="MaxValue" format="integer"/>
<attr name="android:summary"/>
</declare-styleable>
</resources>
```
|
The Serie B 1984–85 was the fifty-third tournament of this competition played in Italy since its creation.
Teams
Parma, Bologna, Bari and Taranto had been promoted from Serie C, while Genoa, Pisa and Catania had been relegated from Serie A.
Final classification
Results
References and sources
Almanacco Illustrato del Calcio - La Storia 1898-2004, Panini Edizioni, Modena, September 2005
Serie B seasons
2
Italy
|
```c++
#include "gtest/gtest.h"
#include "spec.h"
#include "common.h"
#include "redisearch_api.h"
#include "fork_gc.h"
#include "tag_index.h"
#include "rules.h"
#include "query_error.h"
#include "inverted_index.h"
#include "rwlock.h"
extern "C" {
#include "util/dict.h"
}
#include <set>
/**
* The following tests purpose is to make sure the garbage collection is working properly,
* without causing any data corruption or loss.
*
* Main assumption are:
* 1. New entries are always added to the last block (or to a new block if it reaches its
* maximum capacity)
*
* 2. Old entries can not be modified, but only deleted if the fork process found them as deleted.
*
* 3. Last block is defined as the last block as seen by the child.
* We always prefer the parent process last block. If it was simultaneously modified by both the child and
* the parent, we take the parent's version.
*
* 4. Modifications performed on blocks, other than the last block, are always safe to apply
* and hence will take place. (relying on (1))
*
*/
static timespec getTimespecCb(void *) {
timespec ts = {0};
ts.tv_nsec = 5000;
return ts;
}
typedef struct {
RedisModuleCtx *ctx;
void *fgc;
RefManager *ism;
} args_t;
static pthread_t thread;
void *cbWrapper(void *args) {
args_t *fgcArgs = (args_t *)args;
ForkGC *fgc = reinterpret_cast<ForkGC *>(get_spec(fgcArgs->ism)->gc->gcCtx);
// sync thread
while (fgc->pauseState != FGC_PAUSED_CHILD) {
usleep(500);
}
// run ForkGC
get_spec(fgcArgs->ism)->gc->callbacks.periodicCallback(fgcArgs->fgc);
rm_free(args);
return NULL;
}
class FGCTest : public ::testing::Test {
protected:
RMCK::Context ctx;
RefManager *ism;
ForkGC *fgc;
void SetUp() override {
ism = createIndex(ctx);
RSGlobalConfig.gcConfigParams.forkGc.forkGcCleanThreshold = 0;
runGcThread();
}
void runGcThread() {
Spec_AddToDict(ism);
fgc = reinterpret_cast<ForkGC *>(get_spec(ism)->gc->gcCtx);
thread = {0};
args_t *args = (args_t *)rm_calloc(1, sizeof(*args));
*args = {.ctx = ctx, .fgc = fgc, .ism = ism};
pthread_create(&thread, NULL, cbWrapper, args);
}
void TearDown() override {
// Return the reference
IndexSpec_RemoveFromGlobals({ism});
// Detach from the gc to make sure we are not stuck on waiting
// for the pauseState to be changed.
pthread_detach(thread);
}
RefManager *createIndex(RedisModuleCtx *ctx) {
RSIndexOptions opts = {0};
opts.gcPolicy = GC_POLICY_FORK;
auto ism = RediSearch_CreateIndex("idx", &opts);
EXPECT_FALSE(ism == NULL);
EXPECT_FALSE(get_spec(ism)->gc == NULL);
// Let's use a tag field, so that there's only one entry in the tag index
RediSearch_CreateField(ism, "f1", RSFLDTYPE_TAG, 0);
const char *pref = "";
SchemaRuleArgs args = {0};
args.type = "HASH";
args.prefixes = &pref;
args.nprefixes = 1;
QueryError status = {};
get_spec(ism)->rule = SchemaRule_Create(&args, {ism}, &status);
return ism;
}
size_t addDocumentWrapper(const char *docid, const char *field, const char *value) {
size_t beforAddMem = (get_spec(ism))->stats.invertedSize;
assert(RS::addDocument(ctx, ism, docid, field, value));
return (get_spec(ism))->stats.invertedSize - beforAddMem;
}
};
static InvertedIndex *getTagInvidx(RedisSearchCtx* sctx, const char *field,
const char *value) {
RedisModuleKey *keyp = NULL;
RedisModuleString *fmtkey = IndexSpec_GetFormattedKeyByName(sctx->spec, "f1", INDEXFLD_T_TAG);
auto tix = TagIndex_Open(sctx, fmtkey, 1, &keyp);
size_t sz;
auto iv = TagIndex_OpenIndex(tix, "hello", strlen("hello"), 1, &sz);
sctx->spec->stats.invertedSize += sz;
return iv;
}
static std::string numToDocid(unsigned id) {
char buf[1024];
sprintf(buf, "doc%u", id);
return std::string(buf);
}
/** Mark one of the entries in the last block as deleted while the child is running.
* This means the number of original entries recorded by the child and the current number of
* entries are equal, and we conclude there weren't any changes in the parent to the block buffer.
* Make sure the modification take place. */
TEST_F(FGCTest, testRemoveEntryFromLastBlock) {
// Add two documents
size_t docSize = addDocumentWrapper("doc1", "f1", "hello");
ASSERT_TRUE(RS::addDocument(ctx, ism, "doc2", "f1", "hello"));
/**
* To properly test this; we must ensure that the gc is forked AFTER
* the deletion, but BEFORE the addition.
*/
FGC_WaitBeforeFork(fgc);
auto rv = RS::deleteDocument(ctx, ism, "doc1");
ASSERT_TRUE(rv);
/**
* This function allows the GC to perform fork(2), but makes it wait
* before it begins receiving results.
*/
FGC_ForkAndWaitBeforeApply(fgc);
rv = RS::deleteDocument(ctx, ism, "doc2");
size_t invertedSizeBeforeApply = (get_spec(ism))->stats.invertedSize;
/** This function allows the gc to receive the results */
FGC_Apply(fgc);
// gc stats
ASSERT_EQ(0, fgc->stats.gcBlocksDenied);
// The buffer's initial capacity is INDEX_BLOCK_INITIAL_CAP, the function
// IndexBlock_Repair() shrinks the buffer to the number of valid entries in
// the block, collecting the remaining memory.
ASSERT_EQ(INDEX_BLOCK_INITIAL_CAP - 1, fgc->stats.totalCollected);
// numDocuments is updated in the indexing process, while all other fields are only updated if
// their memory was cleaned by the gc.
ASSERT_EQ(0, (get_spec(ism))->stats.numDocuments);
ASSERT_EQ(1, (get_spec(ism))->stats.numRecords);
ASSERT_EQ(invertedSizeBeforeApply - fgc->stats.totalCollected, (get_spec(ism))->stats.invertedSize);
ASSERT_EQ(1, TotalIIBlocks);
}
/**
* In this test, the child process needs to delete the only and last block in the index,
* while the main process adds a document to it.
* In this case, we discard the changes collected by the child process, so eventually the
* index contains both documents.
* */
TEST_F(FGCTest, testRemoveLastBlockWhileUpdate) {
// Add a document
ASSERT_TRUE(RS::addDocument(ctx, ism, "doc1", "f1", "hello"));
/**
* To properly test this; we must ensure that the gc is forked AFTER
* the deletion, but BEFORE the addition.
*/
FGC_WaitBeforeFork(fgc);
auto rv = RS::deleteDocument(ctx, ism, "doc1");
ASSERT_TRUE(rv);
/**
* This function allows the GC to perform fork(2), but makes it wait
* before it begins receiving results.
*/
FGC_ForkAndWaitBeforeApply(fgc);
ASSERT_TRUE(RS::addDocument(ctx, ism, "doc2", "f1", "hello"));
size_t invertedSizeBeforeApply = (get_spec(ism))->stats.invertedSize;
/** This function allows the gc to receive the results */
FGC_Apply(fgc);
// gc stats
ASSERT_EQ(1, fgc->stats.gcBlocksDenied);
ASSERT_EQ(0, fgc->stats.totalCollected);
// numDocuments is updated in the indexing process, while all other fields are only updated if
// their memory was cleaned by the gc.
ASSERT_EQ(1, (get_spec(ism))->stats.numDocuments);
ASSERT_EQ(2, (get_spec(ism))->stats.numRecords);
ASSERT_EQ(invertedSizeBeforeApply, (get_spec(ism))->stats.invertedSize);
ASSERT_EQ(1, TotalIIBlocks);
}
/**
* Modify the last block, but don't delete it entirly. While the fork is running,
* fill up the last block and add more blocks.
* Make sur eno modifications are applied.
* */
TEST_F(FGCTest, testModifyLastBlockWhileAddingNewBlocks) {
unsigned curId = 1;
// populate the first(last) block with two document
ASSERT_TRUE(RS::addDocument(ctx, ism, numToDocid(curId++).c_str(), "f1", "hello"));
ASSERT_TRUE(RS::addDocument(ctx, ism, numToDocid(curId++).c_str(), "f1", "hello"));
// Delete one of the documents.
ASSERT_TRUE(RS::deleteDocument(ctx, ism, "doc1"));
FGC_WaitBeforeFork(fgc);
// The fork will see one block of 2 docs with 1 deleted doc.
FGC_ForkAndWaitBeforeApply(fgc);
// Now add documents until we have new blocks added.
RedisSearchCtx sctx = SEARCH_CTX_STATIC(ctx, get_spec(ism));
auto iv = getTagInvidx(&sctx, "f1", "hello");
while (iv->size < 3) {
ASSERT_TRUE(RS::addDocument(ctx, ism, numToDocid(curId++).c_str(), "f1", "hello"));
}
ASSERT_EQ(3, TotalIIBlocks);
// Save the pointer to the original block data.
const char *originalData = iv->blocks[0].buf.data;
// The fork will return an array of one block with one entry, but we will ignore it.
size_t invertedSizeBeforeApply = (get_spec(ism))->stats.invertedSize;
FGC_Apply(fgc);
const char *afterGcData = iv->blocks[0].buf.data;
ASSERT_EQ(afterGcData, originalData);
// gc stats
ASSERT_EQ(1, fgc->stats.gcBlocksDenied);
ASSERT_EQ(0, fgc->stats.totalCollected);
size_t addedDocs = curId -1;
// numDocuments is updated in the indexing process, while all other fields are only updated if
// their memory was cleaned by the gc.
ASSERT_EQ(addedDocs - 1, (get_spec(ism))->stats.numDocuments);
// All other updates are ignored.
ASSERT_EQ(3, TotalIIBlocks);
ASSERT_EQ(addedDocs, (get_spec(ism))->stats.numRecords);
ASSERT_EQ(invertedSizeBeforeApply, (get_spec(ism))->stats.invertedSize);
}
/** Delete all the blocks, while the main process adds entries to the last block.
* All the blocks, except the last block, should be removed.
*/
TEST_F(FGCTest, testRemoveAllBlocksWhileUpdateLast) {
unsigned curId = 1;
char buf[1024];
RedisSearchCtx sctx = SEARCH_CTX_STATIC(ctx, get_spec(ism));
// Add documents to the index until it has 2 blocks (1 full block + 1 block with one entry)
auto iv = getTagInvidx(&sctx, "f1", "hello");
// Measure the memory added by the last block.
size_t lastBlockMemory = 0;
while (iv->size < 2) {
size_t n = sprintf(buf, "doc%u", curId++);
lastBlockMemory = addDocumentWrapper(buf, "f1", "hello");
}
ASSERT_EQ(2, TotalIIBlocks);
FGC_WaitBeforeFork(fgc);
// Delete all.
for (unsigned i = 1; i < curId; i++) {
size_t n = sprintf(buf, "doc%u", i);
ASSERT_TRUE(RS::deleteDocument(ctx, ism, buf));
}
ASSERT_EQ(0, sctx.spec->stats.numDocuments);
/**
* This function allows the GC to perform fork(2), but makes it wait
* before it begins receiving results. From this point any changes made by the
* main process are not part of the forked process.
*/
FGC_ForkAndWaitBeforeApply(fgc);
size_t invertedSizeBeforeApply = sctx.spec->stats.invertedSize;
// Add a new document so the last block's is different from the the one copied to the fork.
size_t n = sprintf(buf, "doc%u", curId);
lastBlockMemory += addDocumentWrapper(buf, "f1", "hello");
// Save the pointer to the original last block data.
const char *originalData = iv->blocks[iv->size - 1].buf.data;
/** Apply the child changes. All the entries the child has seen are marked as deleted,
* but since the last block was modified by the main the process, we keep it, assuming it
* will be deleted in the next gc run (where the fork is not running during modifications,
* or the we opened a new block and this block is no longer the last)
*/
FGC_Apply(fgc);
// gc stats - make sure we skipped the last block
const char *afterGcData = iv->blocks[iv->size - 1].buf.data;
ASSERT_EQ(afterGcData, originalData);
ASSERT_EQ(1, fgc->stats.gcBlocksDenied);
// numDocuments is updated in the indexing process, while all other fields are only updated if
// their memory was cleaned by the gc.
// In this case the spec contains only one valid document.
ASSERT_EQ(1, sctx.spec->stats.numDocuments);
// But the last block deletion was skipped.
ASSERT_EQ(2, sctx.spec->stats.numRecords);
ASSERT_EQ(lastBlockMemory + sizeof_InvertedIndex(iv->flags), sctx.spec->stats.invertedSize);
ASSERT_EQ(1, TotalIIBlocks);
}
/**
* Repair the last block, while adding more documents to it and removing a middle block.
* This test should be checked with valgrind as it cause index corruption.
*/
TEST_F(FGCTest, testRepairLastBlockWhileRemovingMiddle) {
// Delete the first block:
char buf[1024];
unsigned curId = 1;
RedisSearchCtx sctx = SEARCH_CTX_STATIC(ctx, get_spec(ism));
auto iv = getTagInvidx(&sctx, "f1", "hello");
// Add 2 full blocks + 1 block with1 entry.
unsigned middleBlockFirstId = 0;
while (iv->size < 3) {
size_t n = sprintf(buf, "doc%u", curId++);
ASSERT_TRUE(RS::addDocument(ctx, ism, buf, "f1", "hello"));
// A new block had opened
if (iv->size == 2 && !middleBlockFirstId) {
middleBlockFirstId = curId - 1;
}
}
unsigned lastBlockFirstId = curId - 1;
ASSERT_EQ(3, TotalIIBlocks);
/**
* In this case, we want to keep the first entry in the last block,
* but we want to delete the second entry while appending more documents to it.
* The block will remain unchanged.
**/
sprintf(buf, "doc%u", curId++);
RS::addDocument(ctx, ism, buf, "f1", "hello");
// Wait before we fork so the next updates will copied to the child memory.
FGC_WaitBeforeFork(fgc);
// Delete the second entry of the last block
ASSERT_TRUE(RS::deleteDocument(ctx, ism, buf));
// Delete first entry in the index
ASSERT_TRUE(RS::deleteDocument(ctx, ism, "doc1"));
unsigned total_deletions = 2;
// Delete the second block (out of 3 blocks)
for (unsigned i = middleBlockFirstId; i < lastBlockFirstId; ++i) {
sprintf(buf, "doc%u", i);
ASSERT_TRUE(RS::deleteDocument(ctx, ism, buf));
++total_deletions;
}
// curId - 1 = total added documents
size_t valid_docs = curId - 1 - total_deletions;
ASSERT_EQ(valid_docs, sctx.spec->stats.numDocuments);
size_t lastBlockEntries = iv->blocks[2].numEntries;
FGC_ForkAndWaitBeforeApply(fgc);
// Add a document -- this one is to keep
sprintf(buf, "doc%u", curId);
RS::addDocument(ctx, ism, buf, "f1", "hello");
++valid_docs;
FGC_Apply(fgc);
// Since we added entries to the last block after the fork, we ignore the fork updates in the last block
ASSERT_EQ(1, fgc->stats.gcBlocksDenied);
// The deletion in the last block was ignored,
ASSERT_EQ(1 + valid_docs, sctx.spec->stats.numRecords);
// Other updates should take place.
ASSERT_EQ(valid_docs, sctx.spec->stats.numDocuments);
// We are left with the first + last block.
ASSERT_EQ(2, iv->size);
// The first entry was deleted. first block starts from docId = 2.
ASSERT_EQ(2, iv->blocks[0].firstId);
// Last block was moved.
ASSERT_EQ(lastBlockFirstId, iv->blocks[1].firstId);
ASSERT_EQ(3, iv->blocks[1].numEntries);
}
/**
* Repair the last block, while adding more documents to it...
*/
TEST_F(FGCTest, testRepairLastBlock) {
// Delete the first block:
unsigned curId = 0;
RedisSearchCtx sctx = SEARCH_CTX_STATIC(ctx, get_spec(ism));
auto iv = getTagInvidx(&sctx, "f1", "hello");
while (iv->size < 2) {
char buf[1024];
size_t n = sprintf(buf, "doc%u", curId++);
ASSERT_TRUE(RS::addDocument(ctx, ism, buf, "f1", "hello"));
}
/**
* In this case, we want to keep `curId`, but we want to delete a 'middle' entry
* while appending documents to it..
**/
//add another document. now the last block has 2 entries.
char buf[1024];
sprintf(buf, "doc%u", curId++);
RS::addDocument(ctx, ism, buf, "f1", "hello");
FGC_WaitBeforeFork(fgc);
// Delete the doc we have just added.
ASSERT_TRUE(RS::deleteDocument(ctx, ism, buf));
FGC_ForkAndWaitBeforeApply(fgc);
// Add a document to the last block. This change is not known to the child.
sprintf(buf, "doc%u", curId);
RS::addDocument(ctx, ism, buf, "f1", "hello");
FGC_Apply(fgc);
// since the block size in the main process doesn't equal to its original size as seen by the child,
// we ignore the fork collection - the last block changes should be discarded.
ASSERT_EQ(1, fgc->stats.gcBlocksDenied);
ASSERT_EQ(2, iv->size);
}
/**
* Test repair middle block while last block is removed on child and modified on parent.
* Make sure there is no datalose.
*/
TEST_F(FGCTest, testRepairMiddleRemoveLast) {
// Delete the first block:
unsigned curId = 0;
RedisSearchCtx sctx = SEARCH_CTX_STATIC(ctx, get_spec(ism));
auto iv = getTagInvidx(&sctx, "f1", "hello");
while (iv->size < 3) {
char buf[1024];
size_t n = sprintf(buf, "doc%u", curId++);
ASSERT_TRUE(RS::addDocument(ctx, ism, buf, "f1", "hello"));
}
char buf[1024];
sprintf(buf, "doc%u", curId);
ASSERT_TRUE(RS::addDocument(ctx, ism, buf, "f1", "hello"));
unsigned next_id = curId + 1;
/**
* In this case, we want to keep `curId`, but we want to delete a 'middle' entry
* while appending documents to it..
**/
FGC_WaitBeforeFork(fgc);
while (curId > 100) {
sprintf(buf, "doc%u", --curId);
ASSERT_TRUE(RS::deleteDocument(ctx, ism, buf));
}
FGC_ForkAndWaitBeforeApply(fgc);
sprintf(buf, "doc%u", next_id);
ASSERT_TRUE(RS::addDocument(ctx, ism, buf, "f1", "hello"));
FGC_Apply(fgc);
ASSERT_EQ(2, iv->size);
}
/**
* Ensure that removing a middle block while adding to the parent will maintain
* the parent's changes
*/
TEST_F(FGCTest, testRemoveMiddleBlock) {
// Delete the first block:
unsigned curId = 0;
RedisSearchCtx sctx = SEARCH_CTX_STATIC(ctx, get_spec(ism));
InvertedIndex *iv = getTagInvidx(&sctx, "f1", "hello");
while (iv->size < 2) {
RS::addDocument(ctx, ism, numToDocid(++curId).c_str(), "f1", "hello");
}
unsigned firstMidId = curId;
while (iv->size < 3) {
RS::addDocument(ctx, ism, numToDocid(++curId).c_str(), "f1", "hello");
}
unsigned firstLastBlockId = curId;
unsigned lastMidId = curId - 1;
ASSERT_EQ(3, TotalIIBlocks);
FGC_WaitBeforeFork(fgc);
// Delete the middle block
for (size_t ii = firstMidId; ii < firstLastBlockId; ++ii) {
RS::deleteDocument(ctx, ism, numToDocid(ii).c_str());
}
FGC_ForkAndWaitBeforeApply(fgc);
// While the child is running, fill the last block and add another block.
unsigned newLastBlockId = curId + 1;
while (iv->size < 4) {
ASSERT_TRUE(RS::addDocument(ctx, ism, numToDocid(++curId).c_str(), "f1", "hello"));
}
unsigned lastLastBlockId = curId - 1;
// Get the previous pointer, i.e. the one we expect to have the updated
// info. We do -2 and not -1 because we have one new document in the
// fourth block (as a sentinel)
const char *pp = iv->blocks[iv->size - 2].buf.data;
FGC_Apply(fgc);
// We hadn't performed any changes to the last block prior to the fork.
ASSERT_EQ(0, fgc->stats.gcBlocksDenied);
ASSERT_EQ(3, iv->size);
// The pointer to the last gc-block, received from the fork
const char *gcpp = iv->blocks[iv->size - 2].buf.data;
ASSERT_EQ(pp, gcpp);
// Now search for the ID- let's be sure it exists
auto vv = RS::search(ism, "@f1:{hello}");
std::set<std::string> ss(vv.begin(), vv.end());
ASSERT_NE(ss.end(), ss.find(numToDocid(newLastBlockId)));
ASSERT_NE(ss.end(), ss.find(numToDocid(newLastBlockId - 1)));
ASSERT_NE(ss.end(), ss.find(numToDocid(lastLastBlockId)));
}
```
|
```c++
// This file was automatically generated on Mon Aug 25 18:12:27 2014
// by libs/config/tools/generate.cpp
// Use, modification and distribution are subject to the
// LICENSE_1_0.txt or copy at path_to_url
// See path_to_url for the most recent version.//
// Revision $Id$
//
// Test file for macro BOOST_NO_CXX11_FIXED_LENGTH_VARIADIC_TEMPLATE_EXPANSION_PACKS
// This file should compile, if it does not then
// BOOST_NO_CXX11_FIXED_LENGTH_VARIADIC_TEMPLATE_EXPANSION_PACKS should be defined.
// See file boost_no_fixed_len_variadic_templates.ipp for details
// Must not have BOOST_ASSERT_CONFIG set; it defeats
// the objective of this file:
#ifdef BOOST_ASSERT_CONFIG
# undef BOOST_ASSERT_CONFIG
#endif
#include <boost/config.hpp>
#include "test.hpp"
#ifndef BOOST_NO_CXX11_FIXED_LENGTH_VARIADIC_TEMPLATE_EXPANSION_PACKS
#include "boost_no_fixed_len_variadic_templates.ipp"
#else
namespace boost_no_cxx11_fixed_length_variadic_template_expansion_packs = empty_boost;
#endif
int main( int, char *[] )
{
return boost_no_cxx11_fixed_length_variadic_template_expansion_packs::test();
}
```
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.